Datasets:

---

mlfoundations-dev

/

Codeforces-Python-Submissions_processed

like 0

Follow

ML Foundations Development 67

[ "import math\r\nfrom random import randint\r\nfrom bisect import bisect_left\r\n\r\ntest = False\r\n\r\nif test:\r\n n = randint(100000,100000)\r\n a = [randint(1,100000000) for _ in range(n)]\r\n #print('n =', n)\r\n #print('a =', a)\r\nelse: \r\n n = int(input())\r\n a=[*map(int,input().split())]\r\n\r\ndr = 1\r\nfor x in range(9): \r\n r = randint(0, n-1)\r\n ar = a[r]\r\n m = int(math.sqrt(ar))\r\n dells = []\r\n dells1 = []\r\n for i in range(1, m+1):\r\n if (ar%i == 0):\r\n if ar//i > dr:\r\n dells1.insert(0, ar//i)\r\n if i > dr:\r\n dells.append(i)\r\n dells.extend(dells1)\r\n num_dells = len(dells)\r\n s = [0]*num_dells\r\n for i in range(n):\r\n k = math.gcd(ar, a[i])\r\n lo = bisect_left(dells, k)\r\n if lo < num_dells and dells[lo] == k:\r\n s[lo] += 1\r\n for i in range(num_dells):\r\n for j in range(i+1, num_dells):\r\n if dells[j] % dells[i]==0:\r\n s[i] += s[j]\r\n if (s[i]*2>=n and dr < dells[i]): \r\n dr = dells[i]\r\nprint(dr)\r\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\na = list(input().rstrip().decode().split())\r\nb = list(input().rstrip().decode().split())\r\nx = [\"?\"]\r\nc = [\"H\", \"He\"]\r\nfor i in c:\r\n x.append(i)\r\nc = [\"Li\", \"Be\", \"B\", \"C\", \"N\", \"O\", \"F\", \"Ne\"]\r\nfor i in c:\r\n x.append(i)\r\nc = [\"Na\", \"Mg\", \"Al\", \"Si\", \"P\", \"S\", \"Cl\", \"Ar\"]\r\nfor i in c:\r\n x.append(i)\r\nc = [\"K\", \"Ca\", \"Sc\", \"Ti\", \"V\", \"Cr\", \"Mn\", \"Fe\", \"Co\", \"Ni\", \"Cu\", \"Zn\", \"Ga\", \"Ge\", \"As\", \"Se\", \"Br\", \"Kr\"]\r\nfor i in c:\r\n x.append(i)\r\nc = [\"Rb\", \"Sr\", \"Y\", \"Zr\", \"Nb\", \"Mo\", \"Tc\", \"Ru\", \"Rh\", \"Pd\", \"Ag\", \"Cd\", \"In\", \"Sn\", \"Sb\", \"Te\", \"I\", \"Xe\"]\r\nfor i in c:\r\n x.append(i)\r\nc = [\"Cs\", \"Ba\", \"La\", \"Ce\", \"Pr\", \"Nd\", \"Pm\", \"Sm\", \"Eu\", \"Gd\", \"Tb\", \"Dy\", \"Ho\", \"Er\", \"Tm\", \"Yb\", \"Lu\", \"Hf\", \"Ta\", \"W\", \"Re\", \"Os\", \"Ir\", \"Pt\", \"Au\", \"Hg\", \"Tl\", \"Pb\", \"Bi\", \"Po\", \"At\", \"Rn\"]\r\nfor i in c:\r\n x.append(i)\r\nc = [\"Fr\", \"Ra\", \"Ac\", \"Th\", \"Pa\", \"U\", \"Np\", \"Pu\", \"Am\", \"Cm\", \"Bk\", \"Cf\", \"Es\", \"Fm\"]\r\nfor i in c:\r\n x.append(i)\r\nd = dict()\r\nfor i in range(1, 101):\r\n d[x[i]] = i\r\na = [d[i] for i in a]\r\nb = [d[i] for i in b]\r\nif sum(a) ^ sum(b):\r\n ans = \"NO\"\r\n print(ans)\r\n exit()\r\npow2 = [1]\r\nfor _ in range(n):\r\n pow2.append(2 * pow2[-1])\r\nm = pow2[n]\r\nd0 = dict()\r\nd0[0] = 0\r\ns = 0\r\nfor i in range(k):\r\n s += b[i]\r\n d0[s] = i + 1\r\ny = [[] for _ in range(k + 1)]\r\nfor i in range(m):\r\n s = 0\r\n for j in range(n):\r\n if i & pow2[j]:\r\n s += a[j]\r\n if s in d0:\r\n y[d0[s]].append(i)\r\ndp = [-1] * m\r\ndp[0] = 0\r\nfor i in range(k):\r\n dp0 = [-1] * m\r\n for j in y[i]:\r\n if dp[j] >= 0:\r\n dp0[j] = j\r\n for j in range(m):\r\n if dp0[j] == -1:\r\n continue\r\n dpj = dp0[j]\r\n for l in range(n):\r\n pl = pow2[l]\r\n if j & pl:\r\n continue\r\n dp0[j ^ pl] = max(dp0[j ^ pl], dpj)\r\n for j in y[i + 1]:\r\n dp[j] = dp0[j]\r\nans = \"YES\" if dp[-1] ^ -1 else \"NO\"\r\nprint(ans)\r\nif ans == \"NO\":\r\n exit()\r\nans = []\r\nu = m - 1\r\nfor i in range(k - 1, -1, -1):\r\n ans0 = []\r\n v = u ^ dp[u]\r\n for j in range(n):\r\n if v & pow2[j]:\r\n ans0.append(x[a[j]])\r\n u = dp[u]\r\n ans0 = \"+\".join(ans0) + \"->\" + x[b[i]]\r\n ans.append(ans0)\r\nsys.stdout.write(\"\\n\".join(ans))" ]

[ "import sys\r\n\r\n\r\ndef find_min_max(l, d=None):\r\n #print(l)\r\n n = len(l)\r\n if n == 1:\r\n return (l[0], l[0])\r\n \r\n lesser = []\r\n greater = []\r\n for i in range(n//2):\r\n first = l[2*i]\r\n second = l[2*i + 1]\r\n \r\n print(\"? {} {}\".format(first, second))\r\n sys.stdout.flush()\r\n \r\n answer = input()\r\n \r\n if answer == '<':\r\n lesser.append(first)\r\n greater.append(second)\r\n else:\r\n lesser.append(second)\r\n greater.append(first)\r\n\r\n if n%2 == 1:\r\n lesser.append(l[-1])\r\n greater.append(l[-1])\r\n \r\n mn = None\r\n mx = None\r\n \r\n if d != 'max':\r\n mn = find_min_max(lesser, 'min')[0]\r\n if d != 'min':\r\n mx = find_min_max(greater, 'max')[1]\r\n return (mn, mx)\r\n\r\n\r\nt = input()\r\nt = int(t)\r\n\r\nfor k in range(t):\r\n n = input()\r\n n = int(n)\r\n \r\n l = list(range(1, n+1))\r\n mn, mx = find_min_max(l)\r\n print(\"! {} {}\".format(mn, mx))\r\n sys.stdout.flush()\r\n\r\n \r\n\r\n \r\n", "import sys\r\n\r\ndef query(x, y):\r\n print(\"?\", x, y, flush = True)\r\n c = input().strip()\r\n if c == '=':\r\n return 0\r\n if c == '<':\r\n return -1\r\n if c == '>':\r\n return 1\r\n raise ValueError(\"Invalid response\")\r\n\r\ndef solve():\r\n n = int(input())\r\n a = list(range(1, n + 1))\r\n \r\n b, c = [], []\r\n\r\n while len(a) > 1:\r\n x = a.pop()\r\n y = a.pop()\r\n z = query(x, y)\r\n if z == 0:\r\n a.append(x)\r\n else:\r\n if z > 0:\r\n x, y = y, x\r\n b.append(x)\r\n c.append(y)\r\n\r\n if a:\r\n b.append(a[0])\r\n c.append(a[0])\r\n\r\n while len(b) > 1:\r\n x = b.pop()\r\n y = b.pop()\r\n z = query(x, y)\r\n if z > 0:\r\n b.append(y)\r\n else:\r\n b.append(x)\r\n\r\n while len(c) > 1:\r\n x = c.pop()\r\n y = c.pop()\r\n z = query(x, y)\r\n if z < 0:\r\n c.append(y)\r\n else:\r\n c.append(x)\r\n\r\n print(\"!\", b[-1], c[-1], flush = True)\r\n sys.stdout.flush()\r\n\r\nif __name__ == \"__main__\":\r\n t = int(input())\r\n for _ in range(t):\r\n solve()\r\n", "import sys\n\ndef f(arr):\n mn, mx = [], []\n for i in range(len(arr) // 2):\n print('?', arr[2*i], arr[2*i + 1])\n sys.stdout.flush()\n if input() == '>':\n mn.append(arr[2*i + 1])\n mx.append(arr[2*i])\n else:\n mn.append(arr[2*i])\n mx.append(arr[2*i + 1])\n if len(arr) % 2 == 1:\n mn.append(arr[-1])\n mx.append(arr[-1])\n return (mn, mx)\n\n\nfor _ in range(int(input())):\n n = int(input())\n arr = range(1, n+1)\n mn, mx = f(arr)\n while len(mn) > 1:\n mn = f(mn)[0]\n while len(mx) > 1:\n mx = f(mx)[1]\n print('!',mn[0],mx[0])\n sys.stdout.flush()\n", "from collections import defaultdict\r\nfor ik in range(int(input())):\r\n n=int(input())\r\n d=defaultdict(str)\r\n if n==1:\r\n print(\"! 1 1\",flush=True)\r\n continue\r\n elif n==2:\r\n print(\"? 1 2\",flush=True)\r\n s=input()\r\n if s==\">\":\r\n print(\"! 2 1\",flush=True)\r\n else:\r\n print(\"! 1 2\",flush=True)\r\n continue\r\n last=[i for i in range(1,n+1)]\r\n res=[]\r\n while(len(last)!=1):\r\n for i in range(len(last)//2):\r\n print(\"?\", last[2*i], last[2*i+1], flush=True)\r\n r=input()\r\n d[(last[2 * i], last[2 * i + 1])] = r\r\n if r=='>':\r\n res.append(last[2*i])\r\n else:\r\n res.append(last[2*i+1])\r\n if len(last)%2==1:\r\n res.append(last[-1])\r\n last=res+[]\r\n res=[]\r\n max=last[0]\r\n #print(max)\r\n last = [i for i in range(1, n+1)]\r\n res = []\r\n while (len(last) != 1):\r\n for i in range(len(last)// 2):\r\n if (last[2*i],last[2*i+1]) in d:\r\n r1=d[(last[2*i],last[2*i+1])]\r\n else:\r\n print(\"?\", last[2 * i], last[2 * i + 1], flush=True)\r\n r1 = input()\r\n if r1 == '<':\r\n res.append(last[2 * i])\r\n else:\r\n res.append(last[2 * i + 1])\r\n if len(last) % 2 == 1:\r\n res.append(last[-1])\r\n last = res + []\r\n res = []\r\n min = last[0]\r\n print('!',min,max,flush=True)", "import random\r\n\r\nimport sys\r\ndef myprint(s):\r\n print(s)\r\n sys.stdout.flush()\r\n\r\nt = int(input())\r\nwhile t > 0:\r\n t -= 1\r\n n = int(input())\r\n A = [i+1 for i in range(n)]\r\n allowed = 3 * n // 2 + n % 2 - 2\r\n #print(allowed)\r\n random.shuffle(A)\r\n #print(A)\r\n\r\n def cmp(x, y):\r\n myprint(\"? \" + str(A[x]) + \" \" + str(A[y]))\r\n return input()\r\n\r\n mins = []\r\n maxs = []\r\n\r\n for i in range(0, n - 1, 2):\r\n cmpres = cmp(i, i+1)\r\n allowed -= 1\r\n if(cmpres == '<'):\r\n mins.append(i)\r\n maxs.append(i+1)\r\n else:\r\n mins.append(i+1)\r\n maxs.append(i)\r\n if n % 2 != 0:\r\n mins.append(n - 1)\r\n maxs.append(n - 1)\r\n\r\n while allowed:\r\n mn = []\r\n mx = []\r\n for i in range(0, len(mins) - 1, 2):\r\n if allowed:\r\n cmpres = cmp(mins[i], mins[i+1])\r\n allowed -=1\r\n if cmpres == '<':\r\n mn.append(mins[i])\r\n else:\r\n mn.append(mins[i+1])\r\n if len(mins) % 2:\r\n mn.append(mins[-1])\r\n\r\n for i in range(0, len(maxs) - 1, 2):\r\n if allowed:\r\n cmpres = cmp(maxs[i], maxs[i + 1])\r\n allowed -= 1\r\n if cmpres == '>':\r\n mx.append(maxs[i])\r\n else:\r\n mx.append(maxs[i + 1])\r\n if len(maxs) % 2:\r\n mx.append(maxs[-1])\r\n\r\n mins = mn\r\n maxs = mx\r\n\r\n\r\n myprint(\"! \"+ str(A[mins[0]]) + \" \" + str(A[maxs[0]]))\r\n" ]

[ "n=int(input())\r\na=list(map(int,input().split()))\r\nans=\"\"\r\narr=[0]*(n+1)\r\ncurchar='a'\r\nfor i in range(n-1,-1,-1):\r\n for j in range(i+1,n):\r\n a[i]-=a[j]*(1+j-i)\r\n for j in range(a[i]):\r\n ans+=curchar*(i+1)\r\n if curchar=='z':\r\n curchar='a'\r\n else:\r\n curchar=chr(ord(curchar)+1)\r\nprint(ans)\r\n", "import sys\r\ndata = sys.stdin.read().split()\r\ndata.reverse()\r\ndef read(): return int(data.pop())\r\ndef readStr(): return data.pop()\r\n\r\nn = read()\r\nC = [0] + [read() for i in range(n)]\r\n\r\nans = \"\"\r\nch, cht = 'a', 'b'\r\n\r\nfor i in range(n, 0, -1) :\r\n while C[i] > 0 :\r\n for j in range(i) :\r\n ans += ch\r\n ch, cht = cht, ch\r\n for j in range(1, i+1) :\r\n C[j] -= i-j+1\r\n \r\nprint(ans)\r\n", "n = int(input())\narr = list(map(int, input().split()))\n\nc = 'a'\ns = \"\"\n\nfor i in range(n - 1, -1, -1):\n for j in range(arr[i]):\n for k in range(0, i + 1):\n s += c\n if(c == 'a'):\n c = 'b'\n else:\n c = 'a'\n for l in range(i - 1, -1, -1):\n arr[l] -= (i - l + 1) * arr[i]\nprint(s)\n\t\t \t\t \t \t \t \t \t\t\t \t \t\t \t \t", "n = int(input())\r\nc = list(map(int, input().strip().split()))\r\nsubStrings = []\r\nalt = 0\r\nfor i in range(n-1,-1,-1):\r\n while c[i] > 0:\r\n alt = (alt + 1) % 2\r\n if alt == 1:\r\n substr = 'a'*(i+1)\r\n subStrings.append(substr)\r\n else:\r\n substr = 'b'*(i+1)\r\n subStrings.append(substr)\r\n for j in range(i,-1,-1):\r\n c[j] -= i-j + 1\r\nprint(''.join(subStrings))", "n=int(input())\r\nc=list(map(int, input().split()))\r\nc.append(0)\r\nc.append(0)\r\nfor i in range(n):\r\n c[i]=c[i]+c[i+2]-2*c[i+1];\r\n\t\r\nans=\"\";\r\ncur=0\r\nfor i in range(n):\r\n for j in range(c[i]):\r\n for w in range(i+1):\r\n if cur==0:\r\n ans+=\"a\"\r\n else:\r\n ans+=\"b\"\r\n cur=1-cur;\r\nprint(ans)\r\n", "n=int(input())\r\nc=[0]+list(map(int,input().split()))\r\nans=[]\r\nfor i in reversed(range(1,n+1)):\r\n for x in ans:\r\n c[i]-=x-i+1\r\n ans+=[i]*c[i]\r\na=True\r\nfor x in ans:\r\n print(end=('a' if a else 'b')*x)\r\n a=not a\r\n", "n = int(input())\narr = list(map(int, input().split()))\nfor i in range(n-1, 0, -1):\n for j in range(i-1, -1, -1):\n arr[j] -= arr[i]*(i-j+1)\ns = \"a\"\ndef rev(c):\n if c == \"a\":\n return \"b\"\n else:\n return \"a\"\nfor i in range(n):\n for j in range(arr[i]):\n s += rev(s[-1])*(i+1)\nprint(s[1:])\n\n \t\t\t\t \t\t\t \t \t\t\t \t \t\t\t\t", "import sys\r\n\r\nn = int(input())\r\nc = list(map(int, input().split()))\r\ncc = ord('a')\r\nans = \"\"\r\ncur = n - 1\r\nif 1:\r\n cur = n - 1\r\n while cur >= 0:\r\n while c[cur] > 0:\r\n if chr(cc) > 'z':\r\n cc = ord('a')\r\n ans += chr(cc) * (cur + 1)\r\n c[cur] -= 1\r\n for i in range(cur):\r\n c[i] -= (cur - i + 1)\r\n cc += 1\r\n cur -= 1\r\n print(ans)\r\n\r\n \r\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\n\r\ncur = 'a'\r\n\r\ns=\"\"\r\nfor i in reversed(range(n)):\r\n for j in range(0,a[i]):\r\n s+=cur*(i+1)\r\n cur=('a','b')[cur=='a']\r\n\r\n for j in reversed(range(i)):\r\n a[j]-=(i-j+1)*a[i]\r\n a[i]=0\r\n\r\nprint(s)\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\ns = ''\r\nc = 'a'\r\nfor i in range(n - 1, -1, -1):\r\n if (a[i] > 0):\r\n cnt = a[i]\r\n for j in range(cnt):\r\n s += c * (i + 1)\r\n if (c == 'a'):\r\n c = 'b'\r\n else:\r\n c = 'a'\r\n for j in range(i + 1):\r\n a[j] -= cnt * (i - j + 1)\r\nprint(s)", "n = int(input())\r\na = [0] + list(map(int, input().split()))\r\nfor i in range(n, 0, -1):\r\n for j in range(i + 1, n + 1):\r\n a[i] -= a[j] * (j - i + 1)\r\nx = 'b'\r\nfor i in range(1, n + 1):\r\n for _ in range(a[i]):\r\n for __ in range(i):\r\n print(x, end = '')\r\n x = chr(ord(x) ^ 1)" ]

[ "r = open('input.txt','r')\r\nw = open('output.txt','w')\r\nn = int(r.readline())\r\nt = ['10'[int(r.readline()) % 2] for i in range(n)]\r\nw.write('\\n'.join(t))", "f = open('input.txt', 'r').readlines()\r\nn = int(f[0])\r\na = []\r\nfor i in range(1, n + 1):\r\n a.append('10'[int(f[i]) % 2])\r\nopen('output.txt', 'w').write(' '.join(a))", "with open(\"input.txt\") as f:\r\n\twith open(\"output.txt\", \"w\") as g:\r\n\t\tinput = f.readline\r\n\t\tii=lambda:int(input())\r\n\t\tprint(\"\\n\".join(map(str, [1^ii()&1 for _ in range(ii())])), file=g)", "IN=open('input.txt','r')\r\nOUT=open('output.txt','w')\r\nfor i in range(int(IN.readline())):\r\n\tOUT.write('%d\\n'%((int(IN.readline())&1)^1))", "import sys\r\n\r\nsys.stdin = open('input.txt', 'r') \r\nsys.stdout = open('output.txt', 'w')\r\n\r\n\r\nn=int(input())\r\nt=[]\r\nfor i in range(n):\r\n t.append(int(input()))\r\ni=n \r\n\r\nwhile(n!=0):\r\n \r\n if((((t[i-n]*t[i-n])-1)%2)!=0):\r\n print(1);\r\n else:\r\n print(0)\r\n n-=1;\r\n\r\n", "inpt = open(\"input.txt\", \"r\")\r\noutpt = open(\"output.txt\", \"w\")\r\n\r\nt = int(inpt.readline())\r\nfor _ in range(t):\r\n n = int(inpt.readline())\r\n if (n%2): outpt.write(\"0\\n\")\r\n else: outpt.write(\"1\\n\")", "# BLA BLA BLA\r\nread_file = open('input.txt', 'r')\r\nwrite_file = open('output.txt', 'w')\r\nn = int(read_file.readline())\r\nlist_ = [int(read_file.readline()) for _ in range(n)]\r\nlist_ = [(i % 2) ^ 1 for i in list_]\r\nwrite_file.write('\\n'.join(str(i) for i in list_)) \r\n", "import sys\r\nsys.stdin = open('input.txt', 'r')\r\nsys.stdout = open('output.txt', 'w')\r\nfor _ in range(int(input())):\r\n x=int(input())\r\n print(1 if x%2==0 else 0)", "def put_knight(n):\r\n\tif n%2==0:\r\n\t\treturn 1\r\n\telse:\r\n\t\treturn 0\r\n\r\nif __name__ == '__main__':\r\n\tf=open('input.txt')\r\n\tarr=f.readlines()\r\n\tf.close()\r\n\tf=open('output.txt','tw')\r\n\tfor i in range(1,int(arr[0])+1):\r\n\t\tstring=str(put_knight(int(arr[i])))\r\n\t\tf.write(string+\"\\n\")\r\n\tf.close()", "import sys\r\nsys.stdin = open(\"input.txt\")\r\nsys.stdout=open(\"output.txt\",'w')\r\na=int(input())\r\nfor b in range(a):\r\n c=int(input())\r\n print ((c+1)%2)\r\n", "inp = open(\"input.txt\", \"r\")\r\nout = open(\"output.txt\", \"w\")\r\n\r\ntt = int(inp.readline())\r\nfor _ in range(tt):\r\n\tn = int(inp.readline())\r\n\tif n % 2 == 1:\r\n\t\tout.write(\"0\\n\")\r\n\telse:\r\n\t\tout.write(\"1\\n\")\r\n\r\ninp.close()\r\nout.close()", "x=open(\"input.txt\",\"r\")\ny=open(\"output.txt\",\"w\")\nn=int(x.readline())\nz=[str((int(x.readline())-1)%2) for i in range(n)]\ny.write(\"\\n\".join(z))\n \t\t \t \t\t\t \t \t\t \t \t \t \t\t\t \t", "import sys\r\n# For getting input from input.txt file\r\nsys.stdin = open('input.txt', 'r')\r\n\r\n# Printing the Output to output.txt file\r\nsys.stdout = open('output.txt', 'w')\r\nfor q in range(int(input())):\r\n\r\n n = int(input())\r\n if n%2:\r\n print(0)\r\n else:\r\n print(1) \r\n", "import sys\r\nsys.stdin=open('input.txt','r')\r\nsys.stdout=open('output.txt','w')\r\nn=int(input())\r\nt=[]\r\nfor i in range(n):\r\n t.append(int(input()))\r\ni=n\r\nwhile(n!=0):\r\n if(t[i-n]%2==0):\r\n print(1)\r\n else:\r\n print(0)\r\n n-=1\r\n ", "file = open(\"input.txt\",'r')\r\nfile2 = open('output.txt','w')\r\nfor i in range(int(file.readline())):\r\n if int(file.readline())%2==0:\r\n file2.write('1\\n')\r\n else:\r\n file2.writelines('0\\n')\r\nfile.close()\r\nfile2.close()", "import sys\nf = open(\"input.txt\", \"r\")\ntest=int(f.readline())\nouput_f= open(\"output.txt\",\"w+\")\nwhile test>0:\n\ttest-=1\n\tn=int(f.readline())\n\tif n%2==0:\n\t\touput_f.write(\"1 \\n\")\n\telse:\n\t\touput_f.write(\"0 \\n\")\nouput_f.close()\nf.close()", "inp = open(\"input.txt\", \"r\")\r\nout = open(\"output.txt\", \"w\")\r\n\r\nfor _ in range(int(inp.readline())):\r\n\tn = int(inp.readline())\r\n\tout.write(str(1 - n % 2) + '\\n')", "import sys\r\n\r\nsys.stdin = open('input.txt', 'r')\r\nsys.stdout = open('output.txt', 'w')\r\n\r\nfor _ in range(int(input())):\r\n n = int(input())\r\n if n % 2 == 0:\r\n print(1)\r\n else:\r\n print(0)", "with open('input.txt', 'r') as in_file:\r\n T = int(in_file.readline())\r\n n = list(map(int, in_file.readlines()))\r\n with open('output.txt', 'w') as out_file:\r\n for i in range(T):\r\n if n[i] % 2:\r\n out_file.write('0\\n')\r\n else:\r\n out_file.write('1\\n')", "import sys\r\nsys.stdin = open('input.txt', 'r') \r\nsys.stdout = open('output.txt', 'w')\r\nfor i in range(int(input())):\r\n\tn = int(input())\r\n\tif n%2 == 0:\r\n\t\tprint(1)\r\n\telse:\r\n\t\tprint(0)", "# LUOGU_RID: 105854221\nfor _ in [*open('input.txt')][1:]:\r\n open('output.txt','a').write(str((~int(_)&1))+'\\n')", "f = open(\"input.txt\",'r')\r\nfg = open(\"output.txt\",'w')\r\nfor g in range(int(f.readline())):\r\n\tn = int(f.readline())\r\n\tif n%2==0:\r\n\t\tfg.write('1\\n')\r\n\telse:\r\n\t\tfg.write('0\\n')\r\nfg.close()\r\nf.close()", "x=open(\"input.txt\",\"r\")\r\ny=open(\"output.txt\",\"w\")\r\nn=int(x.readline())\r\nl=[str((int(x.readline())-1)%2) for i in range(n)]\r\ny.write(\"\\n\".join(l))", "fin = open('input.txt','tr')\r\nfout = open('output.txt','tw')\r\nlines = fin.readlines()\r\nT = int(lines[0])\r\nfor p in range(1,T+1):\r\n\tn = int(lines[p])\r\n\tif n%2 == 1:\r\n\t\tfout.write(\"0\\n\")\r\n\telse:\r\n\t\tfout.write(\"1\\n\")\r\nfin.close()\r\nfout.close()", "import sys\nsys.stdin = open(\"input.txt\")\nsys.stdout=open(\"output.txt\",'w')\nn = int(input())\nfor _ in range(n):\n m = int(input())\n if m%2==0: print(1)\n else: print(0)\n \t \t \t \t\t\t \t\t \t \t \t \t\t \t" ]

[ "n = int(input())\np = [i for i in range(n + 1)]\ndef asd(i):\n if i != p[i]:\n p[i] = asd(p[i])\n return p[i]\ndef qwe(i, j):\n i = asd(i)\n j = asd(j)\n if i != j:\n p[i] = p[j]\n return True\n return False\n\nl = list()\nfor i in range(n - 1):\n a, b = map(int, input().split())\n if not qwe(a, b):\n l.append((a, b))\n \nprint(len(l))\nfor i in l:\n for j in range(1, n + 1):\n if qwe(i[0], j):\n print(f\"{i[0]} {i[1]} {i[0]} {j}\")\n break\n \n \n\n \t \t\t\t \t \t \t\t\t\t\t \t\t\t \t\t", "# from sortedcontainers import SortedList, SortedSet, SortedDict\r\nimport math\r\nfrom collections import defaultdict, Counter\r\nfrom heapq import heappush, heappop, heapify\r\nimport sys\r\n\r\n\r\nclass DSU():\r\n def __init__(self, n):\r\n self.parent = []\r\n self.size = []\r\n self.rank = []\r\n for i in range(n + 1):\r\n self.parent.append(i)\r\n self.size.append(1)\r\n self.rank.append(0)\r\n\r\n def union(self, u, v):\r\n pu = self.findPar(u)\r\n pv = self.findPar(v)\r\n if pu == pv:\r\n return\r\n # if the size of pu is lesser than the size of pv then we will add\r\n # the pu into pv and the size of pv will increase and vice versa.\r\n if self.size[pu] < self.size[pv]:\r\n self.parent[pu] = pv\r\n self.size[pv] += self.size[pu]\r\n else:\r\n self.parent[pv] = pu\r\n self.size[pu] += self.size[pv]\r\n\r\n def unionByRank(self, u, v):\r\n pu = self.findPar(u)\r\n pv = self.findPar(v)\r\n if pu == pv:\r\n return\r\n if self.rank[pu] < self.rank[pv]:\r\n self.parent[pu] = pv\r\n elif self.rank[pv] < self.rank[pu]:\r\n self.parent[pv] = pu\r\n # if rank is equal then the rank will be increase\r\n else:\r\n self.parent[pu] = pv\r\n self.rank[pv] += 1\r\n\r\n def findPar(self, node):\r\n if self.parent[node] == node:\r\n return node\r\n # path compression -> log(n)\r\n # path compression and size -> O(4* alpha)\r\n self.parent[node] = self.findPar(self.parent[node])\r\n return self.parent[node]\r\n\r\n\r\nclass info():\r\n def __init__(self, _open=0, _close=0, _full=0):\r\n self.open = _open\r\n self.close = _close\r\n self.full = _full\r\n\r\n\r\nclass SGTree():\r\n \"\"\"docstring for SGTree\"\"\"\r\n\r\n def __init__(self, n):\r\n self.seg = [0 for _ in range(4 * n)]\r\n\r\n def build(self, ind, low, high, arr):\r\n if low == high:\r\n self.seg[ind] = arr[low]\r\n return\r\n mid = (low + high) // 2\r\n self.build(2 * ind + 1, low, mid, arr)\r\n self.build(2 * ind + 2, mid + 1, high, arr)\r\n self.seg[ind] = max(self.seg[2 * ind + 1], self.seg[2 * ind + 2])\r\n\r\n def query(self, ind, low, high, l, r):\r\n # no overlap\r\n # low high l r or l r low high\r\n if r < low or l > high:\r\n return sys.maxsize\r\n # complete overlap\r\n # low l r high\r\n if low >= l and r >= high:\r\n return self.seg[ind]\r\n\r\n # partial overlap\r\n mid = (low + high) >> 1\r\n left = self.query(2 * ind + 1, low, mid, l, r)\r\n right = self.query(2 * ind + 2, mid + 1, high, l, r)\r\n return max(left, right)\r\n\r\n\r\ndef 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\ndef IntList():\r\n lis = input().split()\r\n lis = list(map(int, lis))\r\n return lis\r\n\r\n\r\ndef StrList():\r\n s = input()\r\n lis = [val for val in s]\r\n # print(lis)\r\n return lis\r\n\r\n\r\ndef FloatList():\r\n lis = input().split()\r\n lis = list(map(float, lis))\r\n return lis\r\n\r\n\r\ndef searchRange(nums, target):\r\n res = []\r\n ans1 = -1\r\n ans2 = -1\r\n\r\n def bs(nums, key):\r\n start = 0\r\n end = len(nums) - 1\r\n ans = -1\r\n while start <= end:\r\n mid = start + (end - start) // 2\r\n if nums[mid] == key:\r\n ans = mid\r\n end = mid - 1\r\n elif nums[mid] > key:\r\n end = mid - 1\r\n else:\r\n start = mid + 1\r\n return ans\r\n\r\n def bs1(nums, key):\r\n start = 0\r\n end = len(nums) - 1\r\n ans = -1\r\n while start <= end:\r\n mid = start + (end - start) // 2\r\n if nums[mid] == key:\r\n ans = mid\r\n start = mid + 1\r\n elif nums[mid] > key:\r\n end = mid - 1\r\n else:\r\n start = mid + 1\r\n return ans\r\n\r\n ans1 = bs(nums, target)\r\n ans2 = bs1(nums, target)\r\n res.append(ans1)\r\n res.append(ans2)\r\n return res\r\n\r\n\r\ndef SieveOfEratosthenes(n, isPrime):\r\n isPrime[0] = isPrime[1] = False\r\n for i in range(2, n + 1):\r\n isPrime[i] = True\r\n\r\n p = 2\r\n while (p * p <= n):\r\n if (isPrime[p] == True):\r\n i = p * p\r\n while (i <= n):\r\n isPrime[i] = False\r\n i += p\r\n p += 1\r\n\r\n\r\ndef findPrimePair(n):\r\n isPrime = [0] * (n + 1)\r\n SieveOfEratosthenes(n, isPrime)\r\n for i in range(0, n):\r\n\r\n if (isPrime[i] and isPrime[n - i]):\r\n print(i, (n - i))\r\n return\r\n\r\n\r\ndef query(ind, low, high, l, r, seg):\r\n # no overlap\r\n # high low l r or l r high low\r\n if r < low or l > high:\r\n return info()\r\n # complete overlap\r\n # low l r high\r\n if low <= l and r >= high:\r\n return seg[ind]\r\n\r\n # partial overlap\r\n mid = (low + high) >> 1\r\n left = query(2 * ind + 1, 0, mid, l, r, seg)\r\n right = query(2 * ind + 2, mid + 1, high, l, r, seg)\r\n return merge(left, right)\r\n\r\n\r\ndef merge(left, right):\r\n ans = info()\r\n\r\n ans.full = left.full + right.full + min(left.open, right.close)\r\n ans.open = left.open + right.open + min(left.open, right.close)\r\n ans.close = left.close + right.close + min(left.open, right.close)\r\n return ans\r\n\r\n\r\ndef build(ind, low, high, s, seg):\r\n # print(\"HEllo\")\r\n if low == high:\r\n seg[ind] = info(s[low] == \"(\", s[low] == \")\", 0)\r\n return\r\n mid = (low + high) // 2\r\n build(2 * ind + 1, low, mid, s, seg)\r\n build(2 * ind + 2, mid + 1, high, s, seg)\r\n seg[ind] = merge(seg[2 * ind + 1], seg[2 * ind + 2])\r\n\r\n\r\n# def getSortedList():\r\n# return SortedList()\r\n#\r\n#\r\n# def getSortedSet():\r\n# return SortedSet()\r\n#\r\n#\r\n# def getSortedDict():\r\n# return SortedDict()\r\n\r\n\r\ndef getAdjList(roads):\r\n graph = defaultdict(list)\r\n for u, v, time in roads:\r\n graph[u].append([v, time])\r\n graph[v].append([u, time])\r\n return graph\r\n\r\n\r\ndef dijkstra(src, n, graph):\r\n dist = [math.inf] * n\r\n ways = [0] * n\r\n minHeap = [(0, src)] # dist, src\r\n dist[src] = 0\r\n ways[src] = 1\r\n while minHeap:\r\n d, u = heappop(minHeap)\r\n if dist[u] < d: continue # Skip if `d` is not updated to latest version!\r\n for v, time in graph[u]:\r\n if dist[v] > d + time:\r\n dist[v] = d + time\r\n ways[v] = ways[u]\r\n heappush(minHeap, (dist[v], v))\r\n elif dist[v] == d + time:\r\n ways[v] = (ways[v] + ways[u]) % 1_000_000_007\r\n return ways[n - 1]\r\n\r\n\r\ndef bfsOfGraph(V, adj):\r\n # code here\r\n # V represent number of vertex - 0 Based\r\n # adj is an adjancency list\r\n q = [0]\r\n res = []\r\n visited = [False for _ in range(V)]\r\n while q:\r\n for _ in range(len(q)):\r\n val = q.pop(0)\r\n if not visited[val]:\r\n res.append(val)\r\n visited[val] = True\r\n for ne in adj[val]:\r\n q.append(ne)\r\n return res\r\n\r\n\r\n# n = 5000000\r\n# sieve = [True for _ in range(n+1)]\r\n# ds = []\r\n\r\n\r\n# def createSieve():\r\n# s = int(math.sqrt(n))\r\n# for i in range(2, s + 1):\r\n# if sieve[i]:\r\n# for j in range(i * i, n, i):\r\n# sieve[j] = False\r\n# for i in range(1, n + 1):\r\n# if sieve[i]:\r\n# ds.append(i)\r\n\r\n# t=\"Timur\"\r\n# tt=Counter(t)\r\ndef solveByPRateek():\r\n n = int(input())\r\n dsu = DSU(n + 1)\r\n extraRoad = []\r\n for _ in range(n-1):\r\n a, b = map(int, input().split())\r\n if dsu.findPar(a) == dsu.findPar(b):\r\n extraRoad.append([a, b])\r\n else:\r\n dsu.union(a, b)\r\n # figure out the number of compose\r\n s = set()\r\n for i in range(1, n + 1):\r\n s.add(dsu.findPar(i))\r\n x = len(s)\r\n print(x - 1)\r\n lst = [i for i in s]\r\n j = 0\r\n for i in range(1, x):\r\n print(extraRoad[j][0], extraRoad[j][1], lst[i], lst[i - 1])\r\n j += 1\r\n\r\n\r\n# print(\"Hello\")\r\n# createSieve()\r\n# for i in range(int(input())):\r\n# print(f\"Case #{i + 1}:\", end=\" \")\r\nsolveByPRateek()\r\n", "def find_set(v):\n if (v == parent[v]):\n return v\n parent[v] = find_set(parent[v])\n return parent[v]\n\n\ndef union_sets(a,b):\n a=find_set(a)\n b=find_set(b)\n if (a!=b):\n if (size[a]<size[b]):\n a,b = b,a\n parent[b] = a\n size[a] += size[b]\n return True\n return False\n\n\nn = int(input())\nparent = [0]*n\nsize = [1]*n\n\nmustBreak=[]\nmustConnect=[]\nfor i in range(n):\n parent[i] = i\n\nfor i in range(n-1):\n line=input().split(\" \")\n a = int(line[0])-1\n b = int(line[1])-1\n result= union_sets(a,b)\n if not result:\n mustBreak.append((a,b))\n\nfor i in range(n):\n if parent[i] == i:\n mustConnect.append(i)\n\nlenMustBreak = len(mustBreak)\nprint(lenMustBreak)\nif (lenMustBreak != 0):\n for i in range(lenMustBreak):\n print(str(mustBreak[i][0]+1)+\" \"+str(mustBreak[i][1]+1)+\" \"+str(mustConnect[i]+1)+\" \"+str(mustConnect[i+1]+1))\n ", "import io, os, sys\r\n\r\npypyin = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\ncpyin = sys.stdin.readline\r\ninput = pypyin if 'PyPy' in sys.version else cpyin\r\n\r\ndef strput():\r\n return input().decode() if 'PyPy' in sys.version else input()\r\n\r\n# code starts here\r\n\r\nclass UnionFind:\r\n size = 0\r\n par, ext = [], []\r\n \r\n def __init__(self, n):\r\n for i in range(n):\r\n self.par.append(i)\r\n self.ext.append(1)\r\n self.size = n\r\n \r\n def find(self, u):\r\n while u != self.par[u]:\r\n u = self.par[u]\r\n return u\r\n \r\n def unite(self, u, v):\r\n u, v = self.find(u), self.find(v)\r\n if u == v:\r\n return False\r\n if self.ext[u] < self.ext[v]:\r\n u, v = v, u\r\n self.ext[u] += self.ext[v]\r\n self.par[v] = u\r\n self.size -= 1\r\n return True\r\n \r\n\r\ndef main():\r\n n = int(input())\r\n g = [[] for x in range(n + 1)]\r\n for i in range(n - 1):\r\n u, v = [int(x) for x in input().split()]\r\n g[u].append(v)\r\n g[v].append(u)\r\n\r\n to_destroy = []\r\n dsu = UnionFind(n + 1)\r\n for u in range(1, n + 1):\r\n for v in g[u]:\r\n if v < u: continue\r\n if not dsu.unite(u, v):\r\n to_destroy.append((u, v))\r\n\r\n print(len(to_destroy))\r\n while to_destroy:\r\n cur = to_destroy.pop()\r\n for i in range(1, n):\r\n if dsu.unite(i, i + 1):\r\n cur += (i, i + 1)\r\n break\r\n print(*cur)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "def dfs(dad,s):\r\n global vis,old\r\n if s in vis:\r\n return\r\n vis.add(s)\r\n for i in dic[s]:\r\n if i not in vis:\r\n dfs(s,i)\r\n else:\r\n if i!=dad:\r\n if [i,s] not in old:\r\n old.append([s,i])\r\nn=int(input())\r\ndic={i:[] for i in range(1,n+1)}\r\nfor i in range(n-1):\r\n a,b=map(int,input().split())\r\n dic[a].append(b)\r\n dic[b].append(a)\r\ndis=[]\r\nold=[]\r\nvis=set()\r\nr=0\r\nfor i in dic:\r\n if i not in vis:\r\n r+=1\r\n dis.append(i)\r\n dfs(0,i)\r\nprint(r-1)\r\nwhile r>1:\r\n print(*(old.pop()+[dis.pop(),dis[-1]]))\r\n r-=1", "def root(x,arr):\r\n # print(x)\r\n if x==arr[x]:\r\n return x\r\n return root(arr[x],arr)\r\n\r\nif __name__=='__main__':\r\n n=int(input())\r\n roads=[]\r\n arr=[i for i in range(n+1)]\r\n dlt=[]\r\n for i in range(n-1):\r\n x,y=map(int,input().split(' '))\r\n roads.append([x,y])\r\n a=root(x,arr)\r\n b=root(y,arr)\r\n if a==b:\r\n dlt.append([x,y])\r\n else:\r\n arr[b]=a\r\n for i in range(1,n+1):\r\n arr[i]=root(i,arr)\r\n # print(arr)\r\n lst=list(set(arr))\r\n lst.remove(0)\r\n # print(lst)\r\n print(len(lst)-1)\r\n for i in range(len(lst)-1):\r\n print(f\"{dlt[i][0]} {dlt[i][1]} {lst[i]} {lst[i+1]}\")", "from sys import stdin, stdout\r\n\r\n\r\ndef input():\r\n return stdin.readline().rstrip()\r\n\r\n\r\ndef print(*args, sep=' ', end='\\n'):\r\n stdout.write(sep.join(map(str, args)))\r\n stdout.write(end)\r\n\r\n\r\nclass DSU:\r\n def __init__(self, n: int):\r\n self.n = n\r\n self.parent = list(range(n))\r\n self.rank = [1] * n\r\n\r\n def find(self, i: int) -> int:\r\n if self.parent[i] != i:\r\n self.parent[i] = self.find(self.parent[i])\r\n return self.parent[i]\r\n\r\n def union(self, i: int, j: int):\r\n id1 = self.find(i)\r\n id2 = self.find(j)\r\n if id1 == id2:\r\n return\r\n if self.rank[id1] > self.rank[id2]:\r\n self.parent[id2] = id1\r\n else:\r\n self.parent[id1] = id2\r\n if self.rank[id1] == self.rank[id2]:\r\n self.rank[id2] += 1\r\n\r\n\r\ndef solution():\r\n n = int(input())\r\n dsu = DSU(n)\r\n back_edges = []\r\n for i in range(n - 1):\r\n v, u = (int(num) for num in input().split())\r\n v -= 1\r\n u -= 1\r\n if dsu.find(v) == dsu.find(u):\r\n back_edges.append((v + 1 , u + 1))\r\n else:\r\n dsu.union(v, u)\r\n leaders = list({dsu.find(i) for i in range(n)})\r\n ans = len(leaders) - 1\r\n print(ans)\r\n for i in range(ans):\r\n print(*back_edges.pop(), leaders[0] + 1, leaders[i + 1] + 1)\r\n\r\n\r\ndef main():\r\n t = 1\r\n while t:\r\n solution()\r\n t -= 1\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "import sys\r\n\r\n# region fastio\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nsint = lambda: int(input())\r\nmint = lambda: map(int, input().split())\r\nints = lambda: list(map(int, input().split()))\r\n# print = lambda d: sys.stdout.write(str(d) + \"\\n\")\r\n# endregion fastio\r\n\r\n# # region interactive\r\n# def printQry(a, b) -> None:\r\n# sa = str(a)\r\n# sb = str(b)\r\n# print(f\"? {sa} {sb}\", flush = True)\r\n\r\n# def printAns(ans) -> None:\r\n# s = str(ans)\r\n# print(f\"! {s}\", flush = True)\r\n# # endregion interactive\r\n\r\n# # region dfsconvert\r\n# def bootstrap(f, stack=[]):\r\n# def wrappedfunc(*args, **kwargs):\r\n# if stack:\r\n# return f(*args, **kwargs)\r\n# else:\r\n# to = f(*args, **kwargs)\r\n# while True:\r\n# if type(to) is GeneratorType:\r\n# stack.append(to)\r\n# to = next(to)\r\n# else:\r\n# stack.pop()\r\n# if not stack:\r\n# break\r\n# to = stack[-1].send(to)\r\n# return to\r\n# return wrappedfunc\r\n# # endregion dfsconvert\r\n\r\n# MOD = 998244353\r\n# MOD = 10 ** 9 + 7\r\n# DIR = ((-1, 0), (0, 1), (1, 0), (0, -1))\r\n\r\ndef solve() -> None:\r\n n = sint()\r\n fa = list(range(n + 1))\r\n def find(x: int) -> int:\r\n cur = x\r\n while x != fa[x]:\r\n x = fa[x]\r\n while cur != x:\r\n fa[cur], cur = x, fa[cur]\r\n return x\r\n \r\n def union(x: int, y: int):\r\n x, y = find(x), find(y)\r\n if x == y: return\r\n if x > y: x, y = y, x\r\n fa[y] = x\r\n \r\n d, a = [], []\r\n for _ in range(n - 1):\r\n u, v = mint()\r\n fu, fv = find(u), find(v)\r\n if fu == fv:\r\n d.append((u, v))\r\n else:\r\n union(fu, fv)\r\n f1 = find(1)\r\n for i in range(2, n + 1):\r\n fi = find(i)\r\n if fi != f1:\r\n a.append((1, i))\r\n union(f1, fi)\r\n \r\n print(len(d))\r\n for (u1, v1), (u2, v2) in zip(d, a):\r\n print(u1, v1, u2, v2)\r\n\r\nsolve()", "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\n\r\ngcd = math.gcd\r\nsqrt = math.sqrt\r\nmaxint = 10 ** 21\r\n\r\n\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\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\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\ndef find_set(a,par):\r\n if a==par[a]:\r\n return a\r\n par[a]=find_set(par[a],par)\r\n return par[a]\r\n \r\ndef union(a,b,par,rank):\r\n a=find_set(a,par)\r\n b=find_set(b,par)\r\n \r\n if a==b:\r\n return True\r\n par[0]-=1 # par[0] stores the number of disjoint sets\r\n if rank[a]<rank[b]:\r\n ta=a\r\n a=b\r\n b=ta\r\n par[b]=a\r\n if rank[a]==rank[b]:\r\n rank[a]+=1\r\n return False\r\n\r\ndef main():\r\n n = int(input())\r\n par=[i for i in range(n+1)]\r\n rank = [1]*(n+1)\r\n ul={}\r\n par[0]=n\r\n for i in range(n-1):\r\n a,b=map(int,input().split())\r\n if a>b:\r\n a,b=b,a\r\n oof=union(a,b,par,rank)\r\n if oof:\r\n ul[(a,b)]=1\r\n \r\n dic={}\r\n for i in range(1,n+1):\r\n find_set(i,par)\r\n if par[i]==i:\r\n dic[i]=1\r\n print(par[0]-1)\r\n for i in ul:\r\n a=i[0]\r\n b=i[1]\r\n un=-1\r\n for j in dic:\r\n if j!=find_set(a,par):\r\n un=j\r\n break\r\n temp=un+par[a]\r\n union(a,un,par,rank)\r\n del dic[temp-par[un]]\r\n print(a,b,a,un)\r\nmain()", "# import sys \n# sys.stdin = open('input.txt', 'r') \n# sys.stdout = open('output.txt', 'w')\n\n\ndef getPar(x):\n\twhile (a[x] != x):\n\t\tx = a[x]\n\treturn x\n\ndef union(x,y):\n\tp1 = getPar(x)\n\tp2 = getPar(y)\n\ta[p2] = p1\n\nn = int(input())\na = [i for i in range(n+1)]\ne = []\n\nfor _ in range(n-1):\n\tu,v = map(int,input().split())\n\tp1 = getPar(u)\n\tp2 = getPar(v)\n\tif (p1 == p2):\n\t\te.append([u,v])\n\telse:\n\t\tunion(u,v)\n\ns = []\nfor i in a[1:]:\n s.append(getPar(i))\ns=list(set(s))\nprint(len(e))\nfor i in range(len(e)):\n\tprint(e[i][0],e[i][1],s[i],s[i+1])", "##I try various [strategies], and one of them is the right one.\r\n# I am no genius. I am simply good at it.\r\n#BY-GK\r\ndef find_parent(a):\r\n if ar[a]==-1:\r\n return a\r\n return find_parent(ar[a])\r\n\r\nif __name__ == '__main__':\r\n n=int(input())\r\n ar=[-1]*(n+1)\r\n road=[]\r\n cycle=list()\r\n for _ in range(1,n):\r\n a,b=map(int,input().split())\r\n p1=find_parent(a)\r\n p2=find_parent(b)\r\n if p1==p2 :\r\n cycle.append((a,b))\r\n else:\r\n ar[p1]=p2\r\n for i in range(1,n+1):\r\n if ar[i]==-1:\r\n road.append(i)\r\n print(len(cycle))\r\n root=road.pop()\r\n for i in range(len(cycle)):\r\n x,y=cycle.pop()\r\n print(x,y,root,road.pop())\r\n\r\n # That is the favor of Allah, which He gives to whom He wills, and Allah is the possessor of Ultimate favor.\r\n", "# Python3 STDIN\n\"\"\"\nimport sys\ninput = sys.stdin.readline\n\n############ ---- Input Functions ---- ############\ndef inp():\n return(int(input()))\ndef inlt():\n return(list(map(int,input().split())))\ndef insr():\n s = input()\n return(list(s[:len(s) - 1]))\ndef invr():\n return(map(int,input().split()))\n\n1) inp — For taking integer inputs.\n2) inlt — For taking List inputs.\n3) insr — 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.\n4) invr — For taking space seperated integer variable inputs.\n\nThe input = sys.stdin.readline is actually for Faster Inputs, because line reading through System STDIN (Standard Input) is faster in Python.\n\"\"\"\n\n\"\"\"\nn = int(input())\nfor i in range(n):\n a, m = map(int, input().split())\n lst = list(map(int, input().split()))\n\"\"\"\n\nimport sys\ninput = sys.stdin.readline\n\ndef main():\n n = int(input()) + 1\n \n dsu = [ i for i in range(n) ]\n rank = [0] * n\n olds = []\n \n for _ in range(2, n):\n a, b = map(int, input().split())\n is_duplicate_edge = union(a, b, dsu, rank)\n if is_duplicate_edge:\n olds.append([a, b])\n \n if not olds:\n print(0)\n sys.exit()\n \n print(len(olds))\n \n # For all parents\n p = 2\n while p < n and olds:\n A = find(dsu[p], dsu)\n B = find(dsu[p - 1], dsu)\n union(dsu[p], dsu[p - 1], dsu, rank)\n if A != B:\n ea, eb = olds.pop()\n print(ea, eb, A, B)\n p += 1\n\ndef union(a, b, dsu, rank):\n A = find(a, dsu)\n B = find(b, dsu)\n\n if A == B:\n return True\n\n dsu[B] = A\n\n if rank[B] > rank[A]:\n A, B = B, A\n\n rank[A] += rank[B]\n return False\n\ndef find(c, dsu):\n if dsu[c] == c:\n return c\n dsu[c] = find(dsu[c], dsu)\n return dsu[c]\n\nif __name__ == \"__main__\":\n main()", "#========================= Реализация структуры ============================\r\nclass DSU:\r\n\tdef __init__(self, n):#Инициализация системы непересекающихся множеств\r\n\t\tself.parents = list(range(n+1))\r\n\t\t# ранг - характеристика высоты поддерева\r\n\t\tself.ranks = [1]*(n+1)\r\n\r\n\tdef find(self, elem):#Функция, которая возвращает родителя множества, которому принажлежит элемент(корень поддерева)\r\n\t\tif self.parents[elem] == elem:\r\n\t\t\treturn elem\r\n\t\t# Cжатие путей(Родитель - корень)\r\n\t\tself.parents[elem] = self.find(self.parents[elem])\r\n\t\treturn self.parents[elem]\r\n\r\n\tdef union(self, first, second):#Функция объединения множеств, которым принадлежат входные элементы\r\n\t\tfirst = self.find(first)\r\n\t\tsecond = self.find(second)\r\n\t\tif first == second:\r\n\t\t\treturn\r\n # Oбъединениe по рангу\r\n\t\tif self.ranks[first] <= self.ranks[second]:\r\n\t\t\tself.parents[first] = second\r\n\t\t\tif self.ranks[first] == self.ranks[second]:\r\n\t\t\t\tself.ranks[second] += 1\r\n\t\telse:\r\n\t\t\tself.parents[second] = first\r\n\r\n#======================================================================\r\nn = int(input())\r\ndsu = DSU(n)\r\ntoclose = []\r\nfor i in range(n - 1):\r\n\tu, v = map(int, input().split())\r\n\tpu, pv = dsu.find(u), dsu.find(v)# Находим \"Родителей\" текущей дороги\r\n\tif pu == pv:# Проверяем принадлежность дорог одному \"Родителю\"\r\n\t\ttoclose.append((u, v))\r\n\tdsu.union(pu, pv)# Если не принадлежат объединяем\r\nbuild = list(set([dsu.find(i) for i in range(1, n + 1)]))# Формируем список существующих вершин(допустим \"городов\")\r\nsize = len(build)\r\nif size < 2:\r\n\tprint(0)\r\nelse:\r\n\tprint(size - 1)\r\n\tfor i in range(size - 1):\r\n\t\troads = [toclose[i][0], toclose[i][1], build[i], build[i+1]]\r\n\t\tprint(*roads)\r\n\r\n\r\n\r\n\r\n", "import sys\r\ninput=sys.stdin.readline\r\nfrom collections import defaultdict\r\nclass UnionFind():\r\n def __init__(self, n):\r\n self.n = n\r\n self.parents = [-1] * 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 def union(self, x, y):\r\n x = self.find(x)\r\n y = self.find(y)\r\n if x == y:\r\n return\r\n if self.parents[x] > self.parents[y]:\r\n x, y = y, x\r\n self.parents[x] += self.parents[y]\r\n self.parents[y] = x\r\n def size(self, x):\r\n return -self.parents[self.find(x)]\r\n def same(self, x, y):\r\n return self.find(x) == self.find(y)\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 def roots(self):\r\n return [i for i, x in enumerate(self.parents) if x < 0]\r\n def group_count(self):\r\n return len(self.roots())\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=int(input())\r\ncan_del=[]\r\nuf=UnionFind(n)\r\nfor _ in range(n-1):\r\n u,v=map(int,input().split())\r\n u-=1;v-=1\r\n if uf.same(u,v):\r\n can_del.append([u+1,v+1])\r\n else:\r\n uf.union(u,v)\r\nneed_add=[]\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n if not uf.same(i,j):\r\n need_add.append([i+1,j+1])\r\n uf.union(i,j)\r\nprint(len(can_del))\r\nfor i in range(len(can_del)):\r\n print(*can_del[i],*need_add[i])", "#!/usr/bin/python3\r\n\"\"\"CodeForces Problem --> D. Roads not only in Berland\"\"\"\r\nfrom collections import Counter\r\nfrom typing import List, Optional\r\n\r\n\r\nclass DSU:\r\n def __init__(self, n) -> None:\r\n self.parent = [i for i in range(n)]\r\n self.size = [1 for _ in range(n)]\r\n\r\n def find_set(self, a: int) -> int:\r\n if a == self.parent[a]:\r\n return a\r\n\r\n p = self.find_set(self.parent[a])\r\n self.parent[a] = p\r\n return p\r\n\r\n def union_sets(self, a: int, b: int) -> None:\r\n a_parent = self.find_set(a)\r\n b_parent = self.find_set(b)\r\n\r\n if a_parent == b_parent:\r\n return\r\n\r\n greater = a_parent if self.size[a_parent] >= self.size[b_parent] else b_parent\r\n smaller = b_parent if greater == a_parent else a_parent\r\n\r\n self.parent[smaller] = greater\r\n self.size[greater] += self.size[smaller]\r\n\r\n def connected(self, a: int, b: int) -> bool:\r\n return self.find_set(a) == self.find_set(b)\r\n\r\n\r\ndef solution():\r\n n = int(input())\r\n uF = DSU(n)\r\n\r\n count, already_connected = 0, []\r\n for _ in range(n - 1):\r\n a, b = map(int, input().split())\r\n\r\n if uF.connected(a - 1, b - 1):\r\n already_connected.append([a - 1, b - 1])\r\n count += 1\r\n uF.union_sets(a - 1, b - 1)\r\n\r\n result = []\r\n for pair in already_connected:\r\n first = pair[0]\r\n for i in range(n):\r\n if not uF.connected(first, i):\r\n result.append([first, i])\r\n uF.union_sets(first, i)\r\n print(count)\r\n for i in range(len(result)):\r\n print(' '.join(str(val + 1) for val in already_connected[i]), ' '.join(str(val + 1) for val in result[i]))\r\n\r\n\r\nif __name__ == '__main__':\r\n solution()", "#dahao\r\n\r\nC = 0\r\nn = int(input())\r\nB = [0 for _ in range(n + 1)]\r\np = [0 for _ in range(n + 1)]\r\nCC = [0 for _ in range(n + 1)]\r\na = [[] for _ in range(n + 1)]\r\nVV = [] \r\nV = []\r\nfor i in range(n - 1):\r\n x, y = map(int, input().split())\r\n a[x].append(y)\r\n a[y].append(x)\r\n V.append([x, y])\r\ndef anc(u):\r\n if (p[u] == u): return u\r\n else: \r\n p[u] = anc(p[u])\r\n return p[u]\r\ndef join(u, v): \r\n p[anc(u)] = anc(v)\r\ndef DFS(u):\r\n B[u] = C\r\n for v in a[u]:\r\n if (B[v] == 0):\r\n DFS(v)\r\nfor i in range(1, n + 1): p[i] = i\r\nfor it in V:\r\n if (anc(it[0]) == anc(it[1])):\r\n VV.append(it)\r\n else:\r\n join(it[0], it[1])\r\n \r\nfor i in range(1, n + 1):\r\n if (B[i] == 0):\r\n C += 1\r\n DFS(i)\r\nfor i in range(1, n + 1): CC[B[i]] = i\r\nit = 0\r\nprint(C - 1)\r\nfor i in range(C - 1):\r\n print(VV[i][0], ' ', VV[i][1], ' ', CC[i + 1], ' ', CC[i + 2])", "maxn = 10**6 + 10\nfa = [0] * maxn\n\ndef find(x):\n if x == fa[x]:\n return x\n else:\n fa[x] = find(fa[x])\n return fa[x]\n\nvis = [False] * maxn\n\nn = int(input())\nm = n - 1\n\nfor i in range(1, n+1):\n fa[i] = i\n\ntot = 0\nv = []\nst = []\n\nfor i in range(m):\n l, r = map(int, input().split())\n fx = find(l)\n fy = find(r)\n if fx != fy:\n fa[fx] = fy\n tot += 1\n else:\n v.append((l, r, fx, fy))\n\nprint(n - 1 - tot)\n\nfor i in range(1, n+1):\n fx = find(i)\n if not vis[fx]:\n st.append(fx)\n vis[fx] = True\n\nfor i in range(1, n - 1 - tot + 1):\n print(v[i - 1][0], v[i - 1][1], st[i - 1], st[i])\n\n'''\n el código encuentra las aristas redundantes en un grafo \n no dirigido utilizando una estructura de conjuntos disjuntos \n y muestra las aristas y los conjuntos disjuntos correspondientes\nO(n + m)\n'''\n\n \t\t \t \t \t \t \t\t\t \t \t \t\t", "class DSU:\r\n\tdef __init__(self, n):#Инициализация системы непересекающихся множеств\r\n\t\tself.parents = list(range(n+1))\r\n\t\t# ранг - характеристика высоты поддерева\r\n\t\tself.ranks = [1]*(n+1)\r\n#\t\tself.redundant = []\r\n\r\n\tdef find(self, elem):#Функция, которая возвращает родителя множества, которому принажлежит элемент\r\n\t\tif self.parents[elem] == elem:\r\n\t\t\treturn elem\r\n\t\t# Cжатие путей\r\n\t\tself.parents[elem] = self.find(self.parents[elem])\r\n\t\treturn self.parents[elem]\r\n\r\n\tdef union(self, first, second):#Функция объединения множеств, которым принадлежат входные элементы\r\n\t\tfirst = self.find(first)\r\n\t\tsecond = self.find(second)\r\n\t\tif first == second:\r\n\t\t\treturn\r\n # Oбъединениe по рангу (union by rank)\r\n\t\tif self.ranks[first] <= self.ranks[second]:\r\n\t\t\tself.parents[first] = second\r\n\t\t\tif self.ranks[first] == self.ranks[second]:\r\n\t\t\t\tself.ranks[second] += 1\r\n\t\telse:\r\n\t\t\tself.parents[second] = first\r\n\r\n\r\n#======================================================================\r\nn = int(input())\r\ndsu = DSU(n)\r\nremoves = []\r\nfor i in range(n - 1):\r\n\tu, v = map(int, input().split())\r\n\tpu, pv = dsu.find(u), dsu.find(v)\r\n\tif pu == pv:\r\n\t\tremoves.append((u, v))\r\n\tdsu.union(pu, pv)\r\nuniques = list(set([dsu.find(i) for i in range(1, n + 1)]))\r\nsz = len(uniques)\r\nif sz < 2:\r\n\tprint(0)\r\nelse:\r\n\tprint(sz - 1)\r\n\tfor i in range(sz - 1):\r\n\t\tday = [removes[i][0], removes[i][1], uniques[i], uniques[i+1]]\r\n\t\tprint(*day)", "import os\r\nimport sys\r\nfrom collections import Counter as ctr, deque as dq,defaultdict as dd\r\nfrom io import BytesIO, IOBase\r\nfrom types import GeneratorType\r\nfrom re import search\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\nfrom bisect import bisect_left as bl\r\nfrom bisect import bisect_right as br\r\n# from array import array\r\n\r\ninp= lambda: int(sys.stdin.readline().rstrip(\"\\r\\n\"))\r\nmi = lambda x=int : map(x, sys.stdin.readline().rstrip(\"\\r\\n\").split())\r\n# arr= lambda d='i',x=int: array(d,mi(x))\r\nli = lambda x=int: list(mi(x))\r\nlb = lambda: list(map(int, sys.stdin.readline().rstrip(\"\\r\\n\")))\r\nls = lambda: list(sys.stdin.readline().rstrip(\"\\r\\n\"))\r\nbi = lambda n: bin(n).replace(\"0b\", \"\")\r\nsbstr=lambda a,s: search(a,s)\r\n\r\ndef bootstrap(f, stack=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n if stack:\r\n return f(*args, **kwargs)\r\n else:\r\n to = f(*args, **kwargs)\r\n while True:\r\n if type(to) is GeneratorType:\r\n stack.append(to)\r\n to = next(to)\r\n else:\r\n stack.pop()\r\n if not stack:\r\n break\r\n to = stack[-1].send(to)\r\n return to\r\n \r\n return wrappedfunc\r\n\r\nyn = ['No', 'Yes']\r\nYN = ['NO', 'YES']\r\nYY = \"YES\"\r\nNN = \"NO\"\r\nyy = \"Yes\"\r\nnn = \"No\"\r\ninf= sys.maxsize\r\nmod=998244353\r\nalp='abcdefghijklmnopqrstuvwxyz'\r\n\r\nfrom math import ceil, gcd, log,sqrt,comb\r\nimport heapq as hq\r\n\r\nclass DSU:\r\n def __init__(self, n):\r\n self.rank = [1] * n\r\n self.parent = [i for i in range(n)]\r\n self.sets=n\r\n def find(self, x):\r\n if (self.parent[x] != x):\r\n self.parent[x] = self.find(self.parent[x])\r\n return self.parent[x]\r\n def Union(self, x, y):\r\n xset = self.find(x)\r\n yset = self.find(y)\r\n if xset == yset:\r\n return True\r\n if self.rank[xset] < self.rank[yset]:\r\n self.parent[xset] = yset\r\n \r\n elif self.rank[xset] > self.rank[yset]:\r\n self.parent[yset] = xset\r\n else:\r\n self.parent[yset] = xset\r\n self.rank[xset] = self.rank[xset] + 1\r\n self.sets-=1\r\n return False\r\n\r\ndef main(kase):\r\n n=inp()\r\n grp=DSU(n)\r\n lp=[]\r\n for i in range(n-1):\r\n u,v=mi(lambda x: int(x)-1)\r\n vr=grp.Union(u,v)\r\n if vr:\r\n lp.append((u+1,v+1))\r\n ldr=set()\r\n for i in range(n):\r\n ldr.add(grp.find(i))\r\n ldr=list(ldr)\r\n print(len(lp))\r\n for i in range(len(lp)):\r\n print(*lp[i],ldr[i]+1,ldr[i+1]+1)\r\n\r\n\r\n pass\r\nif __name__ == \"__main__\":\r\n test_Cases=1\r\n # test_Cases=inp()\r\n for i in range(test_Cases):\r\n main(i)", "class DSU:\r\n def __init__(self,n):\r\n self.parent=[]\r\n self.size=[]\r\n for i in range(n+1):\r\n self.parent.append(i)\r\n self.size.append(1)\r\n self.parent[0]=None\r\n self.size[0]=None \r\n def _findParent(self,node):\r\n if self.parent[node]==node: return node\r\n self.parent[node]=self._findParent(self.parent[node])\r\n return self.parent[node]\r\n def unionSize(self,u,v):\r\n up=self._findParent(u)\r\n vp=self._findParent(v)\r\n if up==vp: return\r\n if self.size[u]<self.size[v]:\r\n self.parent[up]=vp\r\n self.size[vp]+=self.size[up]\r\n else:\r\n self.parent[vp]=up\r\n self.size[up]+=self.size[vp]\r\n \r\nn=int(input())\r\nroads=[]\r\nfor i in range(n-1):\r\n temp=list(map(int,input().split()))\r\n roads.append(temp)\r\n \r\ndef solve(n,roads):\r\n dsu=DSU(n)\r\n extra_roads=[]\r\n for u,v in roads:\r\n if dsu._findParent(u)==dsu._findParent(v):\r\n extra_roads.append((u,v))\r\n else:\r\n dsu.unionSize(u,v)\r\n altimate_parents=set()\r\n for i in range(1,n+1):\r\n altimate_parents.add(dsu._findParent(i))\r\n l=len(extra_roads)\r\n print(l)\r\n # print(extra_roads,altimate_parents)\r\n a=altimate_parents.pop()\r\n for i in range(l):\r\n b=altimate_parents.pop()\r\n print(f\"{extra_roads[i][0]} {extra_roads[i][1]} {a} {b}\")\r\n a=b \r\n\r\nsolve(n,roads)\r\n", "from sys import stdin\r\ninput=stdin.readline\r\n\r\nclass DSU:\r\n def __init__(self, n):\r\n self.parent = list(range(n))\r\n self.size = [1] * n\r\n self.num_sets = n\r\n\r\n def find(self, a):\r\n acopy = a\r\n while a != self.parent[a]:\r\n a = self.parent[a]\r\n while acopy != a:\r\n self.parent[acopy], acopy = a, self.parent[acopy]\r\n return a\r\n\r\n def union(self, a, b):\r\n a, b = self.find(a), self.find(b)\r\n if a != b:\r\n if self.size[a] < self.size[b]:\r\n a, b = b, a\r\n\r\n self.num_sets -= 1\r\n self.parent[b] = a\r\n self.size[a] += self.size[b]\r\n\r\n def set_size(self, a):\r\n return self.size[self.find(a)]\r\n\r\n def __len__(self):\r\n return self.num_sets\r\n\r\n\r\nextra=[]\r\nn=int(input())\r\nd=DSU(n)\r\nfor _ in range(n-1):\r\n u,v=map(int,input().split())\r\n u-=1;v-=1\r\n if d.find(u)==d.find(v):extra.append((u+1,v+1))\r\n else:d.union(u,v)\r\nsp=[]\r\nc=[0]*(10**5)\r\nfor i in range(n):\r\n par=d.find(i)\r\n if c[par]==0:\r\n c[par]+=1\r\n sp.append(par+1)\r\ntemp=len(sp)-1\r\nprint(temp)\r\nfor _ in range(temp):\r\n print(*extra[_],end=' ')\r\n print(sp[0],sp[_+1])\r\n", "class DSU:\n def __init__(self, n: int):\n self.n = n\n self.parent = [i for i in range(n + 1)]\n self.size = [1 for _ in range(n + 1)]\n\n def find(self, u: int) -> int:\n if u == self.parent[u]:\n return u\n self.parent[u] = self.find(self.parent[u])\n return self.parent[u]\n\n def union(self, u: int, v: int):\n u, v = self.find(u), self.find(v)\n if u != v:\n if self.size[u] < self.size[v]:\n u, v = v, u\n self.parent[v] = u\n self.size[u] += self.size[v]\n\n\ndef solve():\n n = int(input())\n removes = list()\n dsu = DSU(n)\n for _ in range(n - 1):\n u, v = map(int, input().split())\n pu, pv = dsu.find(u), dsu.find(v)\n if pu == pv:\n removes.append((u, v))\n dsu.union(u, v)\n uniques = list(set([dsu.find(i) for i in range(1, n + 1)]))\n sz = len(uniques)\n if sz < 2:\n print(0)\n return\n else:\n print(sz - 1)\n for i in range(len(uniques) - 1):\n day = [removes[i][0], removes[i][1], uniques[i], uniques[i + 1]]\n print(*day)\n\n\nsolve()\n", "'''\r\n Auther: ghoshashis545 Ashis Ghosh\r\n College: jalpaiguri Govt Enggineering College\r\n\r\n'''\r\nfrom os import path\r\nimport sys\r\nfrom heapq import heappush,heappop\r\nfrom functools import cmp_to_key as ctk\r\nfrom collections import deque,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('a')\r\n\r\nfile=1\r\n\r\n\r\n\r\n\r\n\r\ndef solve():\r\n\r\n \r\n\r\n \r\n n = ii()\r\n\r\n par = [i for i in range(n+1)]\r\n\r\n freq = [1 for i in range(n+1)]\r\n def find(i):\r\n if i==par[i]:\r\n return i\r\n\r\n par[i] = find(par[i])\r\n return par[i]\r\n\r\n def union(x,y):\r\n x = find(x)\r\n y = find(y)\r\n if x==y:\r\n return 0\r\n if freq[x] < freq[y]:\r\n par[x] = y\r\n freq[y] += 1\r\n else:\r\n par[y] = x\r\n freq[x] += 1\r\n return 1\r\n\r\n \r\n\r\n erase = []\r\n for i in range(n-1):\r\n\r\n x,y = mi()\r\n\r\n x1 = find(x)\r\n y1 = find(y)\r\n\r\n if x1==y1:\r\n erase.append([x,y])\r\n continue\r\n union(x,y)\r\n\r\n add = []\r\n\r\n x = list(set(par[1:]))\r\n\r\n for i in range(1,len(x)):\r\n if(union(x[0],x[i])):\r\n add.append([x[0],x[i]])\r\n\r\n print(len(add))\r\n for i in range(len(add)):\r\n print(*erase[i],end=\" \")\r\n print(*add[i],end=\" \")\r\n print()\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\nif __name__ ==\"__main__\":\r\n\r\n if(file):\r\n\r\n if path.exists('input.txt'):\r\n sys.stdin=open('input.txt', 'r')\r\n sys.stdout=open('output.txt','w')\r\n else:\r\n input=sys.stdin.readline\r\n solve()\r\n", "#import math\n#from functools import lru_cache\n#import heapq\n#from collections import defaultdict\n#from collections import Counter\n#from sys import stdout\n#from sys import setrecursionlimit\nfrom sys import stdin\ninput = stdin.readline\nn = int(input())\nparents = list(range(n))\nranks = [0]*n\ndef find(x):\n if(parents[x] != x):\n parents[x] = find(parents[x])\n return parents[x]\ndef union(x, y):\n xp = find(x)\n yp = find(y)\n if(ranks[xp]>ranks[yp]): xp, yp = yp, xp\n parents[xp] = yp\n if(ranks[xp] == ranks[yp]): ranks[yp] += 1\nc = []\nfor ni in range(n-1):\n s, e = [int(x) for x in input().strip().split()]\n s-=1\n e-=1\n sp = find(s)\n ep = find(e)\n if(sp==ep):\n c.append([s, e])\n else:\n union(s, e)\n #print(parents)\n#print(parents)\nfor ni in range(n):\n find(ni)\nntc = list(set(parents))\n#print(ntc)\nprint(len(ntc) - 1)\nfor i in range(1, len(ntc)):\n print(c[i-1][0]+1, c[i-1][1]+1, ntc[i]+1, ntc[i-1]+1)\n", "import sys\r\nfrom collections import defaultdict\r\ninput = sys.stdin.readline \r\n\r\ndef find_parent(p, i):\r\n if p[i] == i:\r\n return i\r\n if p[i] != i:\r\n return find_parent(p, p[i])\r\n \r\n \r\ndef union(p, x, y):\r\n p[x] = y\r\n\r\nn = int(input()) \r\nd = defaultdict(list)\r\nfor i in range(n - 1):\r\n u, v = map(int, input().split())\r\n d[u].append(v)\r\n \r\np = [0] * (n + 1)\r\nfor i in range(n + 1):\r\n p[i] = i \r\na = []\r\nfor i in d.keys():\r\n for j in d[i]:\r\n x = find_parent(p, i)\r\n y = find_parent(p, j)\r\n if(x == y):\r\n a.append((i, j)) \r\n else:\r\n union(p, x, y) \r\nb = []\r\nfor i in range(1, n + 1):\r\n if(p[i] == i):\r\n b.append(i) \r\nprint(len(a)) \r\nj = 0 \r\nfor i in a:\r\n print(*i, b[j], b[j + 1]) \r\n j += 1\r\n\r\n ", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn=int(input())\r\n\r\n# UnionFind\r\n\r\nGroup = [i for i in range(n+1)] # グループ分け\r\nNodes = [1]*(n+1) # 各グループのノードの数\r\n\r\ndef find(x):\r\n while Group[x] != x:\r\n x=Group[x]\r\n return x\r\n\r\ndef Union(x,y):\r\n if find(x) != find(y):\r\n if Nodes[find(x)] < Nodes[find(y)]:\r\n \r\n Nodes[find(y)] += Nodes[find(x)]\r\n Nodes[find(x)] = 0\r\n Group[find(x)] = find(y)\r\n \r\n else:\r\n Nodes[find(x)] += Nodes[find(y)]\r\n Nodes[find(y)] = 0\r\n Group[find(y)] = find(x)\r\n\r\n\r\nANS=[]\r\n\r\nfor i in range(n-1):\r\n x,y=map(int,input().split())\r\n\r\n if find(x)!=find(y):\r\n Union(x,y)\r\n else:\r\n ANS.append((x,y))\r\n\r\nLANS=[]\r\n\r\nfor x,y in ANS:\r\n for i in range(1,n+1):\r\n if find(x)!=find(i):\r\n LANS.append((x,y,x,i))\r\n Union(x,i)\r\n break\r\n\r\n\r\nprint(len(LANS))\r\n\r\nfor x,y,z,w in LANS:\r\n print(x,y,z,w)\r\n", "import gc\r\nimport heapq\r\nimport itertools\r\nimport math\r\nimport sqlite3\r\nfrom collections import Counter, deque, defaultdict\r\nfrom sys import stdout\r\nimport time\r\nfrom math import factorial, log, gcd\r\nimport sys\r\nfrom decimal import Decimal\r\nimport threading\r\nfrom heapq import *\r\nfrom fractions import Fraction\r\n\r\n\r\ndef S():\r\n return sys.stdin.readline().split()\r\n\r\n\r\ndef I():\r\n return [int(i) for i in sys.stdin.readline().split()]\r\n\r\n\r\ndef II():\r\n return int(sys.stdin.readline())\r\n\r\n\r\ndef IS():\r\n return sys.stdin.readline().replace('\\n', '')\r\n\r\n\r\ndef main():\r\n n = II()\r\n tree = [[] for _ in range(n)]\r\n for _ in range(n - 1):\r\n u, v = I()\r\n tree[u - 1].append(v - 1)\r\n tree[v - 1].append(u - 1)\r\n\r\n ans = []\r\n delete = set()\r\n not_visited = set(range(n))\r\n while not_visited:\r\n v = not_visited.pop()\r\n ans.append(v)\r\n queue = deque([(v, -1)])\r\n while queue:\r\n v, p = queue.pop()\r\n for u in tree[v]:\r\n if u != p:\r\n if u not in not_visited:\r\n delete.add(tuple(sorted((u, v))))\r\n else:\r\n not_visited.remove(u)\r\n queue.append((u, v))\r\n print(len(ans) - 1)\r\n for i in ans[1:]:\r\n u, v = delete.pop()\r\n print(u + 1, v + 1, i + 1, ans[0] + 1)\r\n\r\n\r\nif __name__ == '__main__':\r\n # for _ in range(II()):\r\n # main()\r\n main()", "def find(u):\r\n if parent[u] == u:\r\n return u\r\n\r\n parent[u] = find(parent[u])\r\n return parent[u]\r\n\r\n\r\ndef union(a, b):\r\n u = parent[a]\r\n v = parent[b]\r\n\r\n if size[u] > size[v]:\r\n parent[v] = u\r\n size[u] += size[v]\r\n\r\n else:\r\n parent[u] = v\r\n size[v] += size[u]\r\n\r\n\r\n\r\nn=int(input())\r\nparent=[i for i in range(n+1)]\r\nsize = [1 for i in range(n + 1)]\r\n\r\ntorm=[]\r\nfor j in range(n-1):\r\n u,v=map(int,input().split())\r\n if find(u)!=find(v):\r\n union(u,v)\r\n else:\r\n torm.append([u,v])\r\n\r\ntoadd=[]\r\nfor i in range(1,n+1):\r\n if find(1)!=find(i):\r\n union(1,i)\r\n toadd.append([1,i])\r\n\r\nans=[]\r\nfor j in range(len(toadd)):\r\n ans.append(torm[j]+toadd[j])\r\n\r\nprint(len(ans))\r\nfor j in ans:\r\n print(*j)\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "def find(x, parent):\n if x != parent[x]:\n parent[x] = find(parent[x], parent)\n return parent[x]\n\nclass Road:\n def __init__(self, city1, city2):\n self.city1 = city1\n self.city2 = city2\n\nnumCities = int(input())\n\nparent = list(range(numCities + 1))\n\nduplicateRoads = 0\nclosedRoads = []\n\nfor _ in range(numCities - 1):\n city1, city2 = map(int, input().split())\n root1 = find(city1, parent)\n root2 = find(city2, parent)\n if root1 != root2:\n parent[root1] = root2\n else:\n road = Road(city1, city2)\n closedRoads.append(road)\n duplicateRoads += 1\n\nvisited = [0] * (numCities + 1)\ncomponentCount = 0\ncomponentRoots = []\n\nfor i in range(1, numCities + 1):\n if not visited[find(i, parent)]:\n componentRoots.append(find(i, parent))\n componentCount += 1\n visited[find(i, parent)] = 1\n\nprint(componentCount - 1)\ncomponentIndex = 1\n\nfor i in range(componentCount - 1):\n print(closedRoads[i].city1, closedRoads[i].city2, componentRoots[0], componentRoots[componentIndex])\n componentIndex += 1\n\"\"\"\nTema: Union-Find\nComplejidad: O(n).\nDescripción: El código utiliza la estructura de datos de \"Union-Find\" para calcular el \nnúmero mínimo de días necesarios para reconstruir las carreteras y generar un plan de \ncierre y construcción de las mismas. Se realizan operaciones de unión y búsqueda para \ndeterminar las conexiones existentes entre las ciudades y se registra el cierre de las \ncarreteras duplicadas. Luego, se calcula el número de componentes conexas y se imprime \nun plan de cierre y construcción de carreteras basado en estas conexiones. El algoritmo \ntiene una complejidad de O(n), donde n es el número de ciudades.\n\"\"\"\n \t \t \t \t \t\t\t\t \t\t", "def getPar(x):\r\n\twhile (p[x] != x):\r\n\t\tx = p[x]\r\n\treturn x\r\n \r\ndef union(x,y):\r\n\tp1 = getPar(x)\r\n\tp2 = getPar(y)\r\n\tp[p2] = p1\r\n \r\nn = int(input())\r\np = [i for i in range(n+1)] \r\ne = []\r\n \r\nfor _ in range(n-1):\r\n\tu,v = map(int,input().split())\r\n\tp1 = getPar(u)\r\n\tp2 = getPar(v)\r\n\tif (p1 == p2):\r\n\t\te.append([u,v])\r\n\telse:\r\n\t\tunion(u,v)\r\n \r\ns = []\r\nfor i in p[1:]:\r\n s.append(getPar(i)) # To get representative of every component\r\n \r\ns=list(set(s))\r\nprint(len(e))\r\nfor i in range(len(e)):\r\n\tprint(e[i][0],e[i][1],s[i],s[i+1])\r\n\t\r\n", "try:\r\n import sys\r\n from functools import lru_cache, cmp_to_key\r\n from heapq import merge, heapify, heappop, heappush\r\n # from math import *\r\n from collections import defaultdict as dd, deque, Counter as C\r\n from itertools import combinations as comb, permutations as perm\r\n from bisect import bisect_left as bl, bisect_right as br, bisect, insort\r\n from time import perf_counter\r\n from fractions import Fraction\r\n import copy\r\n from copy import deepcopy\r\n import time\r\n starttime = time.time()\r\n mod = int(pow(10, 9) + 7)\r\n mod2 = 998244353\r\n\r\n def data(): return sys.stdin.readline().strip()\r\n def out(*var, end=\"\\n\"): sys.stdout.write(' '.join(map(str, var))+end)\r\n def L(): return list(sp())\r\n def sl(): return list(ssp())\r\n def sp(): return map(int, data().split())\r\n def ssp(): return map(str, data().split())\r\n def l1d(n, val=0): return [val for i in range(n)]\r\n def l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\r\n def A2(n,m): return [[0]*m for i in range(n)]\r\n def A(n):return [0]*n\r\n # input = stdin.buffer.readline\r\n # I = lambda : list(map(int,input().split()))\r\n # import sys\r\n # input=sys.stdin.readline\r\n \r\n\r\n sys.stdin = open(\"input.txt\", \"r\")\r\n sys.stdout = open(\"output.txt\", \"w\")\r\nexcept:\r\n pass\r\n\r\nn = L()[0]\r\n\r\ng = [set() for i in range(n)]\r\ndeg = [0 for i in range(n)]\r\nfor _ in range(n-1):\r\n a,b = L()\r\n a-=1\r\n b-=1\r\n g[a].add(b)\r\n g[b].add(a)\r\n deg[a]+=1\r\n deg[b]+=1\r\n\r\ncomp = [0 for i in range(n)]\r\nX = set()\r\ndef dfs(i,m):\r\n comp[i] = m \r\n for ele in g[i]:\r\n if comp[ele]==0:\r\n dfs(ele,m)\r\n\r\n\r\n\r\nmarker = 1\r\nfor i in range(n):\r\n if comp[i]==0:\r\n dfs(i,marker)\r\n marker +=1\r\n X.add(marker)\r\n\r\nglobal timer, vis, tin, low, bridges\r\n\r\ndef dfs_b(v,p=-1):\r\n global timer, vis, tin, low, bridges\r\n vis[v] = 1 \r\n tin[v] = low[v] = timer\r\n\r\n timer += 1\r\n for to in g[v]:\r\n if to == p:\r\n continue\r\n if vis[to]:\r\n low[v] = min(low[v],tin[to])\r\n else:\r\n dfs_b(to,v)\r\n low[v] = min(low[v],low[to])\r\n if low[to]>tin[v]:\r\n bridges[(to,v)] = 1\r\n bridges[(v,to)] = 1\r\n\r\n\r\n\r\n\r\n\r\ndef calc_bridges():\r\n for i in range(n):\r\n if not vis[i]:\r\n dfs_b(i)\r\n\r\n\r\ndef get_candidate(x):\r\n for i,v in enumerate(comp):\r\n if v==x:\r\n for ele in g[i]:\r\n if not bridges.get((ele,i),0):\r\n return (ele,i)\r\n return -1 \r\n\r\n\r\nans = []\r\nwhile(max(comp)!=1):\r\n bridges = {}\r\n timer = 0\r\n vis = [0 for i in range(n)]\r\n\r\n tin = [-1 for i in range(n)]\r\n low = [-1 for i in range(n)]\r\n calc_bridges()\r\n \r\n a1 = get_candidate(1)\r\n \r\n for ele in X:\r\n if ele == 1:\r\n continue\r\n\r\n\r\n if a1!=-1:\r\n y = comp.index(ele)\r\n ans.append([a1[0]+1,a1[1]+1,a1[0]+1,y+1])\r\n g[a1[0]].remove(a1[1])\r\n g[a1[1]].remove(a1[0])\r\n g[a1[0]].add(y)\r\n g[y].add(a1[0])\r\n for i,v in enumerate(comp):\r\n if v==ele:\r\n comp[i]=1\r\n\r\n X.remove(ele)\r\n break\r\n\r\n a2 = get_candidate(ele)\r\n if a2==-1:\r\n continue\r\n\r\n ans.append([a2[0]+1,a2[1]+1,a2[0]+1,1])\r\n g[a2[0]].remove(a2[1])\r\n g[a2[1]].remove(a2[0])\r\n g[a2[0]].add(0)\r\n g[0].add(a2[0])\r\n for i,v in enumerate(comp):\r\n if v==ele:\r\n comp[i]=1\r\n X.remove(ele)\r\n break\r\nprint(len(ans))\r\nfor ele in ans:\r\n print(*ele)", "n = int(input())\r\nparent = list(range(n + 1))\r\n\r\n\r\ndef find(i):\r\n while i != parent[i]:\r\n i = parent[i]\r\n return i\r\n\r\n\r\nto_delete = []\r\nfor _ in range(n - 1):\r\n a, b = list(map(int, input().split()))\r\n a_id = find(a)\r\n b_id = find(b)\r\n if a_id == b_id:\r\n to_delete.append((a, b))\r\n else:\r\n parent[a_id] = b_id\r\n\r\nprint(len(to_delete))\r\nfirst_id = find(1)\r\nfor x, y in to_delete:\r\n for other in range(2, n + 1):\r\n other_id = find(other)\r\n if first_id != other_id:\r\n parent[other_id] = first_id\r\n print(x, y, other_id, first_id)\r\n break", "def find(x, parent):\n if x != parent[x]:\n parent[x] = find(parent[x], parent)\n return parent[x]\n\nclass Road:\n def __init__(self, city1, city2):\n self.city1 = city1\n self.city2 = city2\n\nnumCities = int(input())\n\nparent = list(range(numCities + 1))\n\nduplicateRoads = 0\nclosedRoads = []\n\nfor _ in range(numCities - 1):\n city1, city2 = map(int, input().split())\n root1 = find(city1, parent)\n root2 = find(city2, parent)\n if root1 != root2:\n parent[root1] = root2\n else:\n road = Road(city1, city2)\n closedRoads.append(road)\n duplicateRoads += 1\n\nvisited = [0] * (numCities + 1)\ncomponentCount = 0\ncomponentRoots = []\n\nfor i in range(1, numCities + 1):\n if not visited[find(i, parent)]:\n componentRoots.append(find(i, parent))\n componentCount += 1\n visited[find(i, parent)] = 1\n\nprint(componentCount - 1)\ncomponentIndex = 1\n\nfor i in range(componentCount - 1):\n print(closedRoads[i].city1, closedRoads[i].city2, componentRoots[0], componentRoots[componentIndex])\n componentIndex += 1\n\n \t\t \t\t \t\t\t\t \t \t \t\t \t", "class DSU:\n def __init__(self, N):\n self.sz = [1] * N\n self.parent = list(range(N))\n self.redundant = []\n\n def find(self, node):\n if node == self.parent[node]:\n return node\n self.parent[node] = self.find(self.parent[node])\n return self.parent[node]\n\n def union(self, a, b):\n p1,p2 = self.find(a), self.find(b)\n if p1 == p2:\n self.redundant.append((a,b))\n else:\n if self.sz[p1] < self.sz[p2]:\n self.parent[p1] = p2\n self.sz[p2] += self.sz[p1]\n else:\n self.parent[p2] = p1\n self.sz[p1] += self.sz[p2]\n\nN = int(input())\ndsu = DSU(N)\nfor _ in range(N-1):\n a,b = map(int, input().split())\n a -= 1\n b -= 1\n dsu.union(a,b)\ns = set()\nfor i in range(N):\n s.add(dsu.find(i))\ns = list(s)\nprint(len(s) - 1)\nfor x,y in zip(s, s[1:]):\n a,b = dsu.redundant.pop()\n print(\"{} {} {} {}\".format(a+1, b+1, x+1, y+1))\n\n", "# Bosdiwale code chap kr kya milega\r\n# Motherfuckers Don't copy code for the sake of doing it\r\n# ..............\r\n# ╭━┳━╭━╭━╮╮\r\n# ┃┈┈┈┣▅╋▅┫┃\r\n# ┃┈┃┈╰━╰━━━━━━╮\r\n# ╰┳╯┈┈┈┈┈┈┈┈┈◢▉◣\r\n# ╲┃┈┈┈┈┈┈┈┈┈┈▉▉▉\r\n# ╲┃┈┈┈┈┈┈┈┈┈┈◥▉◤\r\n# ╲┃┈┈┈┈╭━┳━━━━╯\r\n# ╲┣━━━━━━┫\r\n# ……….\r\n# .……. /´¯/)………….(\\¯`\\\r\n# …………/….//……….. …\\\\….\\\r\n# ………/….//……………....\\\\….\\\r\n# …./´¯/…./´¯\\……/¯ `\\…..\\¯`\\\r\n# ././…/…/…./|_…|.\\….\\….\\…\\.\\\r\n# (.(….(….(…./.)..)...(.\\.).).)\r\n# .\\…………….\\/../…....\\….\\/…………/\r\n# ..\\…………….. /……...\\………………../\r\n# …..\\…………… (………....)……………./\r\n\r\nn = int(input())\r\nparent = [i for i in range(n)]\r\n\r\ndef find_set(v):\r\n if v!=parent[v]:\r\n parent[v] = find_set(parent[v])\r\n return parent[v]\r\n\r\nrem = []\r\nfor _ in range(n-1):\r\n u,v = list(map(int,input().split()))\r\n l = [u,v]\r\n l.sort()\r\n u,v = l\r\n u-=1\r\n v-=1\r\n a = find_set(u)\r\n b = find_set(v)\r\n if a!=b:\r\n if a>b:\r\n a,b = b,a\r\n for i in range(len(parent)):\r\n if parent[i]==b:\r\n parent[i] = a\r\n else:\r\n rem.append([u+1,v+1])\r\nd = {}\r\nfor i in range(len(parent)):\r\n d[parent[i]] = i\r\nind = []\r\nfor i in d:\r\n ind.append(d[i]+1)\r\nans = []\r\nfor i in range(1,len(ind)):\r\n ans.append([ind[i],ind[i-1]])\r\nprint(len(rem))\r\nfor i in range(len(rem)):\r\n print(*rem[i],*ans[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 = iinp()\npars = [i for i in range(n+1)]\nto_close = []\nto_open = []\nfor i in range(n-1):\n x, y = mp()\n if pars[x] == pars[y]:\n to_close.append((x, y))\n else:\n for j in range(1, n+1):\n if y!=j and pars[j] == pars[y]:\n pars[j] = pars[x]\n pars[y] = pars[x]\ns = set([pars[1]])\nfor i in range(2, n+1):\n if pars[i] not in s:\n to_open.append((1, i))\n s.add(pars[i])\nl = len(to_close)\nprint(l)\nfor i in range(l):\n print(to_close[i][0], to_close[i][1], to_open[i][0], to_open[i][1])\n", "def find(a):\n if seq[a] == -1:\n return a\n else:\n return find(seq[a])\n\n\nn = int(input())\nseq = [-1 for i in range(n)]\n\nclosed = []\nans = 0\nfor i in range(n-1):\n a, b = map(int, input().split())\n s1 = find(a-1)\n s2 = find(b-1)\n\n if s1 == s2:\n closed.append((a-1, b-1))\n ans += 1\n else:\n seq[s2] = s1\n\nprint(ans)\nfor i in range(len(seq)):\n s1 = find(i)\n for j in range(i+1, len(seq)):\n s2 = find(j)\n if s2 != s1:\n seq[s2] = s1\n\n c1, c2 = closed.pop()\n print(c1+1, c2+1, i+1, j+1)\n", "#!/usr/bin/env python3\r\n\r\nn = int(input())\r\n\r\nclass UnionFind:\r\n def __init__(self, n):\r\n self.representative = [i for i in range(n)]\r\n def find(self, a):\r\n r = self.representative[a]\r\n if (self.representative[r] != r):\r\n r = self.find(r)\r\n self.representative[a] = r\r\n return r\r\n def union(self, a, b):\r\n ra = self.find(a)\r\n rb = self.find(b)\r\n self.representative[ra] = rb\r\n def same(self, a, b):\r\n return self.find(a) == self.find(b)\r\n\r\nuf = UnionFind(n)\r\nedges_to_remove = []\r\nfor i in range(n-1):\r\n (a,b) = map(int, input().split())\r\n a , b = a-1, b-1\r\n if uf.same(a,b):\r\n edges_to_remove.append((a,b))\r\n else:\r\n uf.union(a,b)\r\n\r\nedges_to_create = []\r\nfor i in range(n):\r\n if not uf.same(0,i):\r\n edges_to_create.append((0,i))\r\n uf.union(0,i)\r\n\r\noutput = []\r\nfor ((i,j),(u,v)) in zip(edges_to_remove, edges_to_create):\r\n output.append(\"%d %d %d %d\" % (i+1, j+1, u+1, v+1))\r\noutput = [\"%d\" % len(output)] + output\r\nprint(\"\\n\".join(output))\r\n", "def main():\r\n \r\n n = int(input())\r\n\r\n parent = [i for i in range(n)]\r\n size = [1 for _ in range(n)]\r\n def find(u):\r\n path = []\r\n while parent[u] != u:\r\n path.append(u)\r\n u = parent[u]\r\n\r\n for node in path:\r\n parent[node] = u\r\n\r\n return u\r\n\r\n def union(u, v):\r\n u, v = find(u), find(v)\r\n\r\n if u == v:\r\n return False\r\n\r\n if size[u] < size[v]:\r\n u, v = v, u\r\n\r\n size[u] += size[v]\r\n parent[v] = u\r\n\r\n return True\r\n\r\n extras = []\r\n new = []\r\n for _ in range(n-1):\r\n a, b = map(int, input().split())\r\n a -= 1\r\n b -= 1\r\n if not union(a, b):\r\n extras.append((a+1, b+1))\r\n\r\n if not extras:\r\n print(0)\r\n return\r\n\r\n node = 0\r\n for i in range(len(parent)):\r\n if find(i) != find(node):\r\n new.append((i+1, node+1))\r\n union(i, node)\r\n \r\n # print(parent)\r\n print(len(extras))\r\n for i in range(len(extras)):\r\n print(*extras[i], *new[i])\r\n\r\nmain()", "import os,sys\r\nfrom io import BytesIO, IOBase\r\nfrom collections import deque\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\nfrom types import GeneratorType\r\ndef bootstrap(f, stack=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n if stack:\r\n return f(*args, **kwargs)\r\n else:\r\n to = f(*args, **kwargs)\r\n while True:\r\n if type(to) is GeneratorType:\r\n stack.append(to)\r\n to = next(to)\r\n else:\r\n stack.pop()\r\n if not stack:\r\n break\r\n to = stack[-1].send(to)\r\n return to\r\n return wrappedfunc\r\n\r\n\r\n\r\nclass DSU:\r\n def __init__(self,n):\r\n self.n = n\r\n self.parent = [i for i in range(n+1)]\r\n self.rank = [0]*(n+1)\r\n def findset(self,i):\r\n if(i == self.parent[i]):\r\n return i\r\n ans = self.findset(self.parent[i])\r\n self.parent[i] = ans\r\n return ans\r\n def unionsets(self,u,v):\r\n u = self.findset(u)\r\n v = self.findset(v)\r\n if u!=v:\r\n self.n-=1\r\n if self.rank[u] > self.rank[v]:\r\n self.parent[v] = u\r\n elif self.rank[u] < self.rank[v]:\r\n self.parent[u] = v\r\n else:\r\n self.parent[u] = v\r\n self.rank[v] += 1\r\n\r\n\r\nedgetodelete = None\r\n@bootstrap\r\ndef dfs(v,visited,prev):\r\n global edgetodelete\r\n visited[v] = 1\r\n for i in graph[v]:\r\n if i!=prev and visited[i]:\r\n edgetodelete = (i,v)\r\n elif not visited[i]:\r\n yield dfs(i,visited,v)\r\n yield\r\n \r\n\r\nn = int(input())\r\ngraph = {i:set() for i in range(1,n+1)}\r\nedges = set()\r\ndsu = DSU(n)\r\nfor i in range(n-1):\r\n a,b = map(int,input().split())\r\n edges.add((a,b))\r\n dsu.unionsets(a,b)\r\n graph[a].add(b)\r\n graph[b].add(a)\r\n\r\nans = []\r\nwhile dsu.n > 1:\r\n compedge = None\r\n comps = []\r\n for i in range(1,n+1):\r\n if i == dsu.parent[i]:\r\n edgetodelete = None\r\n dfs(i,[0]*(n+1),i)\r\n if edgetodelete != None:\r\n compedge = [i,edgetodelete[0],edgetodelete[1]]\r\n if comps:\r\n #Join x and i\r\n x = comps.pop()\r\n ans.append((*edgetodelete,i,x))\r\n graph[edgetodelete[0]].remove(edgetodelete[1])\r\n graph[edgetodelete[1]].remove(edgetodelete[0])\r\n graph[i].add(x)\r\n graph[x].add(i)\r\n\r\n if edgetodelete in edges:\r\n edges.remove(edgetodelete)\r\n else:\r\n edges.remove(edgetodelete[::-1])\r\n dsu = DSU(n)\r\n for p,q in edges:\r\n dsu.unionsets(p,q)\r\n dsu.unionsets(i,x)\r\n edges.add((i,x))\r\n break\r\n else:\r\n if compedge==None:\r\n comps.append(i)\r\n else:\r\n x,p,q = compedge\r\n edgetodelete = (p,q)\r\n ans.append((*edgetodelete,i,x))\r\n graph[edgetodelete[0]].remove(edgetodelete[1])\r\n graph[edgetodelete[1]].remove(edgetodelete[0])\r\n graph[i].add(x)\r\n graph[x].add(i)\r\n\r\n if edgetodelete in edges:\r\n edges.remove(edgetodelete)\r\n else:\r\n edges.remove(edgetodelete[::-1])\r\n dsu = DSU(n)\r\n for p,q in edges:\r\n dsu.unionsets(p,q)\r\n dsu.unionsets(i,x)\r\n edges.add((i,x))\r\n break\r\nprint(len(ans))\r\nfor i in ans:\r\n print(*i) \r\n \r\n\r\n\r\n\r\n\r\n", "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, islice\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\ndef lmap(function, iterable): return list(map(function, iterable))\ndef line(): return stdin.readline().strip()\ndef rd(converter): return converter(line())\ndef rl(converter, delimeter = None): return lmap(converter, line().split(delimeter))\ndef rls(num_lines, converter): return [rd(converter) for i in range(num_lines)]\ndef rg(num_lines, converter, delimeter = None): return [rl(converter,delimeter) for i in range(num_lines)]\n\nMOD = 10**9+7\nMULTIPLE_CASES = 0\n\ndef main():\n N = rd(int)\n edges = rg(N-1,int)\n edges = {tuple(sorted(edge)) for edge in edges}\n neighbors = dd(list)\n\n for a,b in edges:\n neighbors[a].append(b)\n neighbors[b].append(a)\n\n seen = set()\n components = 0\n unused_edges = edges.copy()\n leaders = []\n\n for node in range(1,N+1):\n if node in seen: continue\n\n seen.add(node)\n leaders.append(node)\n dfs = [node]\n components += 1\n\n while dfs:\n cur = dfs.pop()\n\n for nei in neighbors[cur]:\n if nei not in seen:\n unused_edges.remove(tuple(sorted([cur,nei])))\n seen.add(nei)\n dfs.append(nei)\n\n print(components-1)\n\n for i in range(1,len(leaders)):\n print(*unused_edges.pop(), leaders[0],leaders[i])\n\nfor i in range(rd(int) if MULTIPLE_CASES else 1): main()", "# your code goes here\r\n\r\n\r\nclass dsu:\r\n\tdef __init__ ( self , n ):\r\n\t\tself.p = []\r\n\t\tfor x in range(n):\r\n\t\t\tself.p.append ( x )\r\n\tdef find(self , v):\r\n\t\tif self.p[v] == v:\r\n\t\t\treturn v\r\n\t\telse :\r\n\t\t\tself.p[v] = self.find ( self.p[v] )\r\n\t\t\treturn self.p[v]\r\n\tdef union(self,a,b):\r\n\t\ta = self.find ( a )\r\n\t\tb = self.find ( b )\r\n\t\tif a != b:\r\n\t\t\tself.p[a] = b\r\n\tdef __str__ ( self ):\r\n\t\treturn str ( self.p )\r\n\t\t\r\n\r\n\r\nn = int (input() )\r\nDSU = dsu ( n+1 )\r\nWRONG = [] \r\nfor x in range(n-1):\r\n\tss = input().split()\r\n\ta = int ( ss[0] )\r\n\tb = int ( ss[1] )\r\n\t\r\n\tif DSU.find(a) == DSU.find(b):\r\n\t\tWRONG.append ( [ a , b ] )\r\n\telse:\r\n\t\tDSU.union ( a , b )\r\n\r\nz = 2\r\n\r\nprint ( len ( WRONG ) )\r\nfor x in range ( len ( WRONG ) ):\r\n\twhile ( DSU.find ( 1 ) == DSU.find ( z ) ):\r\n\t\tz+=1\r\n\tDSU.union ( 1 , z )\r\n\tprint ( WRONG[x][0] , WRONG[x][1] , 1 , z )", "def MakeSet(x):\r\n x.parent = x\r\n x.rank = 0\r\n\r\ndef Union(x, y):\r\n xRoot = Find(x)\r\n yRoot = Find(y)\r\n if xRoot.rank > yRoot.rank:\r\n yRoot.parent = xRoot\r\n elif xRoot.rank < yRoot.rank:\r\n xRoot.parent = yRoot\r\n elif xRoot != yRoot: # Unless x and y are already in same set, merge them\r\n yRoot.parent = xRoot\r\n xRoot.rank = xRoot.rank + 1\r\n\r\ndef Find(x):\r\n if x.parent == x:\r\n return x\r\n else:\r\n x.parent = Find(x.parent)\r\n return x.parent\r\n\r\nclass Node:\r\n def __init__ (self, label):\r\n self.label = label\r\n def __str__(self):\r\n return self.label\r\n \r\nif __name__ == '__main__':\r\n n = int(input())\r\n l = [Node(i) for i in range(n)]\r\n calles_cerrar = list()\r\n calles_abrir = list()\r\n [MakeSet(node) for node in l] #cada elemento posee su propio conjunto\r\n for i in range(n-1):\r\n a,b = list(map(int,input().strip().split()))\r\n if (Find(l[a-1]) != Find(l[b-1])):\r\n Union(l[a-1],l[b-1])\r\n else:\r\n calles_cerrar.append((a-1,b-1))\r\n for i in range(1,n):\r\n if (Find(l[0]) != Find(l[i])):\r\n calles_abrir.append((0,i))\r\n Union(l[0],l[i])\r\n print(len(calles_cerrar))\r\n for i in range(len(calles_cerrar)):\r\n lista = calles_cerrar[i] + calles_abrir[i]\r\n print(' '.join(str(p+1) for p in (lista)))\r\n \r\n \r\n \r\n\r\n\r\n\r\n \r\n \r\n", "def find(k):\r\n if k==root[k]:\r\n return k\r\n return find(root[k])\r\ndef union(x,y):\r\n if depth[x]>=depth[y]:\r\n root[y]=x\r\n depth[x]=max(depth[x],depth[y]+1)\r\n else:\r\n root[x]=y\r\nn=int(input())\r\nif n==2:\r\n print(0)\r\n exit()\r\nmove,root,depth=[],list(range(n)),[0]*n\r\nfor _ in range(n-1):\r\n u,v=map(int,input().split())\r\n i,j=map(find,(u-1,v-1))\r\n if i!=j:\r\n union(i,j)\r\n else:\r\n move.append((u,v))\r\nans=set()\r\nfor i in range(n):\r\n ans.add(find(i))\r\nprint(len(ans)-1)\r\nx=ans.pop()\r\nfor y in ans:\r\n u,v=move.pop()\r\n print(u,v,x+1,y+1)", "from sys import stdin\ninput=stdin.readline\nclass dsu():\n\tdef __init__(self,n):\n\t\tself.parent=[0]*(n)\n\t\tself.sz=[0]*(n)\n\n\tdef make_set(self,v):\n\t\tself.parent[v]=v\n\t\tself.sz[v]=1\n\n\tdef find_set(self,v):\n\t\tif v==self.parent[v]:\n\t\t\treturn v\n\t\tself.parent[v]=self.find_set(self.parent[v])\n\t\treturn self.parent[v]\n\n\tdef union(self,a,b):\n\t\ta=self.find_set(a)\n\t\tb=self.find_set(b)\n\t\tif a==b:\n\t\t\treturn\n\t\tif self.sz[a]<self.sz[b]:\n\t\t\ta,b=b,a\n\t\tself.parent[b]=a\n\t\tself.sz[a]+=self.sz[b]\n\n\tdef getsize(self,v):\n\t\treturn self.sz[self.find_set(v)]\n\nfrom collections import defaultdict\nn=int(input())\nds=dsu(n)\ng=defaultdict(list)\nfor i in range(n):\n\tds.make_set(i)\nfor i in range(n-1):\n\tx,y=map(int,input().strip().split())\n\tg[x-1].append(y-1)\n\t# g[y-1].append(x-1)\nr=[]\na=[]\nfor i in g:\n\tfl=True\n\tfor j in g[i]:\n\t\tif ds.find_set(i)==ds.find_set(j):\n\t\t\tfl=False\n\t\t\tr.append((i,j))\n\t\tds.union(i,j)\nfor i,j in r:\n\tfor nx in range(0,n):\n\t\tif ds.find_set(i)!=ds.find_set(nx):\n\t\t\ta.append((i+1,j+1,i+1,nx+1))\n\t\t\tds.union(i,nx)\n\t\t\tbreak\nprint(len(a))\nfor i in a:\n\tprint(*i)\n\t \t \t\t\t\t\t \t \t\t\t \t\t\t \t \t\t\t \t\t", "from collections import Counter \r\nfrom collections import defaultdict\r\nfrom bisect import bisect_left,bisect_right\r\nfrom math import lcm\r\ndef testcase(): return int(input())\r\ndef maps(): return map(int, input().split())\r\ndef lists(): return list(map(int, input().split()))\r\ndef sorts(): return sorted(map(int, input().split()))\r\ndef solve():\r\n n = testcase()\r\n parent = defaultdict()\r\n rank = defaultdict()\r\n ans = []\r\n for i in range(1,n+1):\r\n rank[i] = 0\r\n parent[i] = i\r\n def find(x):\r\n if x == parent[x]:\r\n return x\r\n return find(parent[x])\r\n for i in range(n-1):\r\n a,b = maps()\r\n parent1 = find(a)\r\n parent2 = find(b)\r\n if parent1 == parent2: \r\n ans.append([a,b])\r\n continue\r\n if rank[parent1] > rank[parent2]:\r\n parent[parent2] = parent1\r\n rank[parent1] += rank[parent2]\r\n else:\r\n parent[parent1] = parent2\r\n rank[parent2] += rank[parent1]\r\n temp = []\r\n for i in parent:\r\n if parent[i] == i:\r\n temp.append(i)\r\n res = []\r\n for i in range(len(temp)-1):\r\n res.append(ans[i][0])\r\n res.append(ans[i][1])\r\n res.append(temp[i])\r\n res.append(temp[i+1])\r\n print(len(res)//4)\r\n print(*res)\r\n \r\n \r\n\r\nT = 1\r\nfor ___ in range(T):\r\n solve()", "MAXN = 1090\n\ndef find(parent, x):\n # Función para encontrar el padre del nodo x utilizando compresión de caminos\n if x == parent[x]:\n return x\n parent[x] = find(parent, parent[x])\n return parent[x]\n\ndef solve():\n n = int(input())\n\n # Inicializar el arreglo de padres con valores iniciales\n parent = [i for i in range(n + 1)]\n edge_to_remove = []\n\n for _ in range(n - 1):\n u, v = map(int, input().split())\n root_u = find(parent, u)\n root_v = find(parent, v)\n if root_u == root_v:\n # La arista necesita ser eliminada, ya que los nodos tienen el mismo padre\n edge_to_remove.append((_ + 1, u, v))\n else:\n # Unir los nodos en la misma componente conectándolos a través de sus padres\n parent[root_u] = root_v\n\n root_nodes = [i for i in range(1, n + 1) if find(parent, i) == i]\n num_root_nodes = len(root_nodes)\n\n # Imprimir la cantidad de aristas a eliminar y las conexiones para reconstruir el grafo\n print(len(edge_to_remove))\n for i in range(len(edge_to_remove)):\n print(edge_to_remove[i][1], edge_to_remove[i][2], root_nodes[i], root_nodes[i + 1])\n\nsolve()\n \t \t \t \t\t \t\t\t\t \t \t\t", "def find(k):\r\n if k == root[k]:\r\n return k\r\n return find(root[k])\r\n \r\ndef union(x, y):\r\n if depth[x] >= depth[y]:\r\n root[y] = x\r\n depth[x] = max(depth[x], depth[y] + 1)\r\n else:\r\n root[x] = y\r\n\r\nn = int(input())\r\nif n == 2:\r\n print(0)\r\n exit()\r\n\r\nmove = []\r\nroot = list(range(n))\r\ndepth = [0] * n\r\n\r\nfor _ in range(n - 1):\r\n u, v = map(int, input().split())\r\n i, j = map(find, (u - 1, v - 1))\r\n if i != j:\r\n union(i, j)\r\n else:\r\n move.append((u, v))\r\nans = set()\r\nfor i in range(n):\r\n ans.add(find(i))\r\nprint(len(ans) - 1)\r\nx = ans.pop()\r\nfor y in ans:\r\n u, v = move.pop()\r\n print(u, v, x + 1, y + 1)\n# Tue Jul 12 2022 08:34:18 GMT+0000 (Coordinated Universal Time)\n", "from sys import stdin\r\ninput=stdin.readline\r\nclass dsu():\r\n\tdef __init__(self,n):\r\n\t\tself.parent=[0]*(n)\r\n\t\tself.sz=[0]*(n)\r\n\r\n\tdef make_set(self,v):\r\n\t\tself.parent[v]=v\r\n\t\tself.sz[v]=1\r\n\r\n\tdef find_set(self,v):\r\n\t\tif v==self.parent[v]:\r\n\t\t\treturn v\r\n\t\tself.parent[v]=self.find_set(self.parent[v])\r\n\t\treturn self.parent[v]\r\n\r\n\tdef union(self,a,b):\r\n\t\ta=self.find_set(a)\r\n\t\tb=self.find_set(b)\r\n\t\tif a==b:\r\n\t\t\treturn\r\n\t\tif self.sz[a]<self.sz[b]:\r\n\t\t\ta,b=b,a\r\n\t\tself.parent[b]=a\r\n\t\tself.sz[a]+=self.sz[b]\r\n\r\n\tdef getsize(self,v):\r\n\t\treturn self.sz[self.find_set(v)]\r\n\r\nfrom collections import defaultdict\r\nn=int(input())\r\nds=dsu(n)\r\ng=defaultdict(list)\r\nfor i in range(n):\r\n\tds.make_set(i)\r\nfor i in range(n-1):\r\n\tx,y=map(int,input().strip().split())\r\n\tg[x-1].append(y-1)\r\n\t# g[y-1].append(x-1)\r\nr=[]\r\na=[]\r\nfor i in g:\r\n\tfl=True\r\n\tfor j in g[i]:\r\n\t\tif ds.find_set(i)==ds.find_set(j):\r\n\t\t\tfl=False\r\n\t\t\tr.append((i,j))\r\n\t\tds.union(i,j)\r\nfor i,j in r:\r\n\tfor nx in range(0,n):\r\n\t\tif ds.find_set(i)!=ds.find_set(nx):\r\n\t\t\ta.append((i+1,j+1,i+1,nx+1))\r\n\t\t\tds.union(i,nx)\r\n\t\t\tbreak\r\nprint(len(a))\r\nfor i in a:\r\n\tprint(*i)", "class UnionFind:\n def __init__(self, n):\n self.parent, self.size = [i for i in range(n+1)], [1 for _ in range(n+1)]\n def union(self, x, y):\n px, py = self.find(x), self.find(y)\n if px == py: return\n if self.size[px] < self.size[py]:\n px, py = py, px\n self.parent[py], self.size[px] = px, self.size[px]+self.size[py]\n def find(self, x):\n if x != self.parent[x]:\n self.parent[x] = self.find(self.parent[x])\n return self.parent[x]\ncycles = []\nedges = []\nfor _ in range(int(input())-1):\n edges.append(list(map(int, input().split())))\ndata = UnionFind(len(edges)+1)\nfor st, dst in edges:\n if data.find(st) == data.find(dst):\n # print('cycle here', st, dst)\n cycles.append([st, dst])\n else:\n # print('merging here', st, dst)\n data.union(st, dst)\nans = []\ncycle = 0\nfor nbr in range(1, len(edges)+2):\n if data.find(1) != data.find(nbr):\n ans.append([*cycles[cycle], 1, nbr])\n data.union(1, nbr)\n cycle += 1\nprint(len(ans))\nfor i, j, u, v in ans:\n print(i, j, u, v, sep=' ')" ]

[ "import os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\n \r\nBUFSIZE = 8192\r\n \r\nclass FastIO(IOBase):\r\n newlines = 0\r\n \r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n \r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n \r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n \r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n \r\n \r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n \r\n \r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\nfrom heapq import *\r\nfrom collections import deque\r\n\r\nclass HopCroftKarp:\r\n def __init__(self, n, m):\r\n self.n = n\r\n self.m = m\r\n self.G = [[] for _ in range(n)]\r\n self.RG = [[] for _ in range(m)]\r\n self.match_l = [-1] * n\r\n self.match_r = [-1] * m\r\n self.used = [0] * n\r\n self.time_stamp = 0\r\n\r\n def add_edges(self, u, v):\r\n self.G[u].append(v)\r\n\r\n def _build_argument_path(self):\r\n queue = deque()\r\n self.dist = [-1] * self.n\r\n for i in range(self.n):\r\n if self.match_l[i] == -1:\r\n queue.append(i)\r\n self.dist[i] = 0\r\n while queue:\r\n a = queue.popleft()\r\n for b in self.G[a]:\r\n c = self.match_r[b]\r\n if c >= 0 and self.dist[c] == -1:\r\n self.dist[c] = self.dist[a] + 1\r\n queue.append(c)\r\n\r\n def _find_min_dist_argument_path(self, a):\r\n self.used[a] = self.time_stamp\r\n for b in self.G[a]:\r\n c = self.match_r[b]\r\n if c < 0 or (self.used[c] != self.time_stamp and self.dist[c] == self.dist[a] + 1 and self._find_min_dist_argument_path(c)):\r\n self.match_r[b] = a\r\n self.match_l[a] = b\r\n return True\r\n return False\r\n\r\n\r\n def max_matching(self):\r\n while 1:\r\n self._build_argument_path()\r\n self.time_stamp += 1\r\n flow = 0\r\n for i in range(self.n):\r\n if self.match_l[i] == -1:\r\n flow += self._find_min_dist_argument_path(i)\r\n if flow == 0:\r\n break\r\n ret = []\r\n for i in range(self.n):\r\n if self.match_l[i] >= 0:\r\n ret.append((i, self.match_l[i]))\r\n return ret\r\n\r\nclass UnionFind:\r\n def __init__(self, n):\r\n self.n = n\r\n self.parents = [-1] * n\r\n self.group = n\r\n\r\n def find(self, x):\r\n if self.parents[x] < 0:\r\n return x\r\n else:\r\n self.parents[x] = self.find(self.parents[x])\r\n return self.parents[x]\r\n\r\n def union(self, x, y):\r\n x = self.find(x)\r\n y = self.find(y)\r\n\r\n if x == y:\r\n return\r\n self.group -= 1\r\n if self.parents[x] > self.parents[y]:\r\n x, y = y, x\r\n\r\n self.parents[x] += self.parents[y]\r\n self.parents[y] = x\r\n\r\n def size(self, x):\r\n return -self.parents[self.find(x)]\r\n\r\n def same(self, x, y):\r\n return self.find(x) == self.find(y)\r\n\r\n def members(self, x):\r\n root = self.find(x)\r\n return [i for i in range(self.n) if self.find(i) == root]\r\n\r\n def roots(self):\r\n return [i for i, x in enumerate(self.parents) if x < 0]\r\n\r\n def group_count(self):\r\n return self.group\r\n\r\n def all_group_members(self):\r\n dic = {r:[] for r in self.roots()}\r\n for i in range(self.n):\r\n dic[self.find(i)].append(i)\r\n return dic\r\n\r\n def __str__(self):\r\n return '\\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())\r\n\r\ndef contract(deg, k):\r\n hq = []\r\n for i, d in enumerate(deg):\r\n hq.append([d, i])\r\n heapify(hq)\r\n UF = UnionFind(len(deg))\r\n while len(hq) >= 2:\r\n p = heappop(hq)\r\n q = heappop(hq)\r\n if p[0] + q[0] > k:\r\n continue\r\n p[0] += q[0]\r\n UF.union(p[1], q[1])\r\n heappush(hq, p)\r\n return UF\r\n\r\ndef build_k_regular_graph(n, m, A, B):\r\n dega = [0] * n\r\n degb = [0] * m\r\n for a in A:\r\n dega[a] += 1\r\n for b in B:\r\n degb[b] += 1\r\n K = max(*dega, *degb)\r\n\r\n UFa = contract(dega, K)\r\n ida = [-1] * n\r\n pa = 0\r\n for i in range(n):\r\n if UFa.find(i) == i:\r\n ida[i] = pa\r\n pa += 1\r\n\r\n UFb = contract(degb, K)\r\n idb = [-1] * m\r\n pb = 0\r\n for i in range(m):\r\n if UFb.find(i) == i:\r\n idb[i] = pb\r\n pb += 1\r\n \r\n\r\n \r\n p = max(pa, pb)\r\n dega = [0] * p\r\n degb = [0] * p\r\n\r\n C = []\r\n D = []\r\n for i in range(len(A)):\r\n u = ida[UFa.find(A[i])]\r\n v = idb[UFb.find(B[i])]\r\n C.append(u)\r\n D.append(v)\r\n dega[u] += 1\r\n degb[v] += 1\r\n j = 0\r\n for i in range(p):\r\n while dega[i] < K:\r\n while degb[j] == K:\r\n j += 1\r\n C.append(i)\r\n D.append(j)\r\n dega[i] += 1\r\n degb[j] += 1\r\n\r\n return K, p, C, D\r\n\r\n\r\ndef EdgeColoring(a, b, A, B):\r\n K, n, A, B = build_k_regular_graph(a, b, A, B)\r\n\r\n ord = [i for i in range(len(A))]\r\n ans = []\r\n\r\n def euler_trail(ord):\r\n V = 2 * n\r\n G = [[] for _ in range(V)]\r\n m = 0\r\n for i in ord:\r\n G[A[i]].append((B[i] + n, m))\r\n G[B[i] + n].append((A[i], m))\r\n m += 1\r\n used_v = [0] * V\r\n used_e = [0] * m\r\n ans = []\r\n for i in range(V):\r\n if used_v[i]:\r\n continue\r\n st = []\r\n ord2 = []\r\n st.append((i, -1))\r\n while st:\r\n id_ = st[-1][0]\r\n used_v[id_] = True\r\n if len(G[id_]) == 0:\r\n ord2.append(st[-1][1])\r\n st.pop()\r\n else:\r\n e = G[id_][-1]\r\n G[id_].pop()\r\n if used_e[e[1]]:\r\n continue\r\n used_e[e[1]] = True\r\n st.append(e)\r\n ord2.pop()\r\n ord2 = ord2[::-1]\r\n ans += ord2\r\n for i, a in enumerate(ans):\r\n ans[i] = ord[a]\r\n return ans\r\n \r\n def rec(ord, K):\r\n if K == 0:\r\n return\r\n elif K == 1:\r\n ans.append(ord)\r\n return\r\n elif K & 1:\r\n G = HopCroftKarp(n, n)\r\n for i in ord:\r\n G.add_edges(A[i], B[i])\r\n G.max_matching()\r\n lst = []\r\n ans.append([])\r\n for i in ord:\r\n if G.match_l[A[i]] == B[i]:\r\n G.match_l[A[i]] = -1\r\n ans[-1].append(i)\r\n else:\r\n lst.append(i)\r\n rec(lst, K - 1)\r\n else:\r\n path = euler_trail(ord)\r\n L = []\r\n R = []\r\n for i, p in enumerate(path):\r\n if i & 1:\r\n L.append(p)\r\n else:\r\n R.append(p)\r\n rec(L, K // 2)\r\n rec(R, K // 2)\r\n rec(ord, K)\r\n return K, ans\r\n\r\ndef solve():\r\n a, b, m = map(int, input().split())\r\n A = [-1] * m\r\n B = [-1] * m\r\n for i in range(m):\r\n A[i], B[i] = map(int, input().split())\r\n A[i] -= 1\r\n B[i] -= 1\r\n \r\n K, ans = EdgeColoring(a, b, A, B)\r\n color = [-1] * m\r\n for i in range(len(ans)):\r\n for j in ans[i]:\r\n if j < m:\r\n color[j] = i + 1\r\n print(K)\r\n print(*color)\r\n \r\n\r\nfor _ in range(1):\r\n solve()\r\n ", "import io, os, sys\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nI = lambda: [int(x) for x in input().split()]\r\n\r\ndef dfs(x, y, z):\r\n if x:\r\n p[x][y], p[x][z] = p[x][z], p[x][y]\r\n dfs(p[x][z], z, y)\r\n\r\na, b, m = I()\r\nd = [0]*(a+b+1)\r\nu = [0]*(m+1)\r\nv = [0]*(m+1)\r\n\r\n\r\ns = 0\r\nfor i in range(1, m + 1):\r\n x, y = I()\r\n u[i] = x\r\n v[i] = y + a\r\n d[v[i]] += 1\r\n d[u[i]] += 1\r\n\r\nfor i in range(1, a + b + 1):\r\n s = max(s, d[i])\r\n\r\np = [[0]*(s+1) for _ in range(a+b+1)]\r\n\r\nfor i in range(1, m+1):\r\n for j in range(1, s+1):\r\n if not p[u[i]][j]:\r\n x = j\r\n break\r\n for j in range(1, s+1):\r\n if not p[v[i]][j]:\r\n y = j\r\n break\r\n p[u[i]][x], p[v[i]][y] = v[i], u[i]\r\n if x != y: dfs(v[i], x, y)\r\n\r\nprint(s)\r\nans = []\r\nfor i in range(1, m+1):\r\n for j in range(1, s+1):\r\n if p[u[i]][j] == v[i]:\r\n ans += [j]\r\n break\r\n\r\nsys.stdout.write(\" \".join(map(str, ans)) + \"\\n\")", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef f(u, v):\r\n return u * c + v\r\n\r\ndef g(u, v):\r\n return u * (n + 1) + v\r\n\r\na, b, m = map(int, input().split())\r\nn = a + b\r\nx = [0] * (2 * m)\r\ncnt = [0] * (n + 1)\r\nfor i in range(m):\r\n u, v = map(int, input().split())\r\n v += a\r\n x[2 * i], x[2 * i + 1] = u, v\r\n cnt[u] += 1\r\n cnt[v] += 1\r\nz = [0] * ((n + 1) * (n + 1))\r\nfor i in range(m):\r\n u, v = x[2 * i], x[2 * i + 1]\r\n z[g(u, v)], z[g(v, u)] = i, i\r\nc = max(cnt)\r\ne = [0] * (c * (n + 1))\r\nans = [0] * m\r\nfor i in range(m):\r\n u, v = x[2 * i], x[2 * i + 1]\r\n u0, v0 = u * c, v * c\r\n for j in range(c):\r\n u1, v1 = u0 + j, v0 + j\r\n if e[u1] == e[v1] == 0:\r\n e[u1], e[v1] = v, u\r\n ans[i] = j + 1\r\n break\r\n elif not e[u1]:\r\n c0 = j\r\n elif not e[v1]:\r\n c1 = j\r\n if ans[i]:\r\n continue\r\n ans[i] = c0 + 1\r\n s = [u, v]\r\n while True:\r\n j = f(s[-1], c0) if not len(s) % 2 else f(s[-1], c1)\r\n if e[j] and e[j] ^ s[-2]:\r\n s.append(e[j])\r\n else:\r\n break\r\n for j in range(len(s) - 1):\r\n u, v = s[j], s[j + 1]\r\n k = z[g(u, v)]\r\n c2 = c0 if not j % 2 else c1\r\n e[f(u, c2)], e[f(v, c2)] = v, u\r\n ans[k] = c2 + 1\r\n c2 = c0 if len(s) % 2 else c1\r\n e[f(s[-1], c2)] = 0\r\nprint(c)\r\nsys.stdout.write(\" \".join(map(str, ans)))" ]

[ "n,n1,n2=map(int ,input().split());\r\nl=list(map(int,input().split()));\r\nl.sort(reverse=True)\r\nn1,n2=max(n1,n2),min(n1,n2);\r\ns1=0\r\ns2=0\r\nfor i in range(n2):\r\n s1+=l[i]\r\nfor i in range(n2,n1+n2):\r\n s2+=l[i]\r\nprint(s1/n2+s2/n1)", "n,n1,n2=map(int,input().split())\r\narr=list(map(int,input().split()))\r\narr.sort()\r\nn1,n2=min(n1,n2),max(n1,n2)\r\nans=0\r\nres=0\r\nfor i in range(n1):\r\n ans+=arr.pop()\r\nans=ans/n1\r\nfor j in range(n2):\r\n res+=arr.pop()\r\nres=res/n2\r\nprint(ans+res)", "I = lambda: map(int, input().split())\r\n\r\n_, n1, n2 = I()\r\nA = sorted(I(), reverse=True)\r\n\r\nif n1 > n2:\r\n\tn1, n2 = n2, n1\r\n\r\nprint(sum(A[:n1])/n1 + sum(A[n1:n1+n2])/n2)", "from re import I\r\nimport sys\r\n# sys.stdout=open('output.txt', 'w')\r\n# sys.stdin=open('input.txt', 'r')\r\nprintf=sys.stdout.write\r\ndef intput(): return int(sys.stdin.readline())\r\ndef get_int(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_lis(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_liss(): return sys.stdin.readline().split()\r\ndef get_ints(): return sys.stdin.readline().split()\r\ndef get_str(): return sys.stdin.readline().strip()\r\ndef pop_zeros(items):\r\n while items[-1] == 0:\r\n items.pop()\r\nfrom collections import defaultdict\r\nimport math\r\n# t=intput()\r\n# while t:\r\nn,n1,n2=get_int()\r\nl=get_lis()\r\nl.sort(reverse=True)\r\nsu=0\r\nsuu=0\r\nans=0\r\nif n2>n1:\r\n for i in range(n1):\r\n su+=l[i]\r\n ans+=su/n1\r\n for i in range(n1,n1+n2):\r\n suu+=l[i]\r\n ans+=suu/n2\r\nelse:\r\n for i in range(n2):\r\n su+=l[i]\r\n ans+=su/n2\r\n for i in range(n2,n1+n2):\r\n suu+=l[i]\r\n ans+=suu/n1\r\nprintf(str(ans))\r\n # t-=1\r\n\r\n", "n,n1,n2=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort(reverse=True)\r\nb=[]\r\nc=[]\r\nif n1<n2:\r\n p1,q1=0,n1\r\n p2,q2=n1,(n1+n2)\r\nelse:\r\n p1,q1=n2,(n1+n2)\r\n p2,q2=0,n2\r\nfor i in range(p1,q1):\r\n b.append(a[i])\r\nfor i in range(p2,q2):\r\n c.append(a[i]) \r\nx=sum(b)/n1+sum(c)/n2 \r\nprint('%.8f'%x)", "from heapq import nlargest,heapify\r\ndef solve():\r\n n,n1,n2=map(int,input().split());a=sorted(list(map(int,input().split())));heapify(a)\r\n t=sum(nlargest(min(n1,n2),a))/min(n1,n2)\r\n t1=sum(nlargest(max(n1,n2),a[:n-(min(n1,n2))]))/max(n1,n2)\r\n print(t1+t)\r\n\r\nsolve()\r\n# 3 2\r\n# 2 3 4 5 6", "from sys import stdin\n\n\ndef max_mean_wealth(n, n1, n2, a):\n max_mean = 0\n sm = min(n1, n2)\n lg = max(n1, n2)\n a = sorted(a)[::-1]\n for i in range(sm):\n max_mean += a[i] / sm\n for j in range(i + 1, i + 1 + lg):\n max_mean += a[j] / lg\n return max_mean\n\n\nif __name__ == \"__main__\":\n read_ints = lambda: [int(c) for c in stdin.readline().split(\" \")]\n n, n1, n2 = read_ints()\n a = read_ints()\n print(max_mean_wealth(n, n1, n2, a))\n", "from statistics import mean\r\ninp=input().split()\r\nn=int(inp[0])\r\nn1=int(inp[1])\r\nn2=int(inp[2])\r\nif(n1>n2):\r\n n1,n2=n2,n1\r\n\r\na = list(map(int,input().split()))\r\na.sort(reverse=True)\r\n\r\n# print(a[:n1])\r\ns1 = mean(a[:n1])\r\n# print(a[n1:n1+n2])\r\ns2 = mean(a[n1:n1+n2])\r\n\r\nprint('{0:.8f}'.format(s1+s2))", "n, n1, n2 = map(int, input().split())\r\nvals = list(sorted(list(map(int, input().split())), reverse=True))\r\nif(n2>n1):\r\n print(sum(vals[:n1])/n1+sum(vals[n1:n1+n2])/n2)\r\nelse:\r\n print(sum(vals[:n2])/n2+sum(vals[n2:n2+n1])/n1)", "n,n1,n2=map(int,input().split())\r\nli=list(map(int,input().split()))\r\nli.sort();\r\nmi=min(n1,n2)\r\nma=max(n1,n2)\r\na1=0\r\na2=0\r\nfor i in range(n-1,-1,-1):\r\n if mi>0:\r\n a1+=li[i]\r\n mi-=1\r\n elif ma>0:\r\n a2+=li[i]\r\n ma-=1\r\n else:\r\n break\r\n\r\nmi=min(n1,n2)\r\nma=max(n1,n2)\r\nprint(a1/mi+a2/ma)", "n,n1,n2=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort(reverse=True)\r\nam1=sum(a[:min(n1,n2)])/min(n1,n2)\r\nam2=sum(a[min(n1,n2):n1+n2])/max(n1,n2)\r\nprint(am1+am2)", "n, n1, n2=map(int, input().split())\r\na=sorted([int(x) for x in input().split()],reverse=True)\r\n#print(a)\r\ns1=0\r\ns2=0\r\nmn=min(n1,n2)\r\nmx=max(n1,n2)\r\nfor i in range(mn):\r\n #print(a[i])\r\n s1+=a[i]\r\nfor i in range(mn,mx+mn):\r\n #print(a[i])\r\n s2+=a[i]\r\n \r\nprint(format(s1/mn+s2/mx,'.8f'))\r\n\r\n", "n,n1,n2=map(int,input().split())\r\nl=[int(j) for j in input().split()]\r\nl.sort(reverse=True)\r\nn1,n2=min(n1,n2),max(n1,n2)\r\nt=sum(l[:n1])/n1\r\nt2=sum(l[n1:n1+n2])/n2\r\nprint(t+t2)\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, n1, n2 = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\nif n1 > n2:\r\n n1, n2 = n2, n1\r\nans = 0\r\nfor m in [n1, n2]:\r\n c = 0\r\n for _ in range(m):\r\n c += a.pop()\r\n ans += c / m\r\nprint(ans)", "\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\r\n#CODE\r\n\r\n\r\n\r\nn , n1 , n2 = MAP()\r\narr = LIST()\r\narr.sort(reverse=True)\r\nl1 = []\r\nl2 = []\r\nif n1 > n2 :\r\n n1 , n2 = n2 , n1\r\n\r\nfor i in range(n):\r\n if len(l1) < n1 :\r\n l1.append(arr[i])\r\n else:\r\n if len(l2) < n2 :\r\n l2.append(arr[i])\r\n else:\r\n break\r\n\r\n#print(l1)\r\n#print(l2)\r\nres = (sum(l1) / n1) + (sum(l2) / n2)\r\nprint(res)\r\n\r\n\r\n", "n, n1, n2 = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nif n1 > n2:\r\n n1, n2 = n2, n1\r\n\r\na.sort(reverse = True)\r\ns1 = 0\r\nfor i in range(n1):\r\n s1 += a[i]\r\n\r\ns2 = 0\r\nfor i in range(n1, n1 + n2):\r\n s2 += a[i]\r\n \r\nprint(s1 / n1 + s2 / n2)", "import sys\r\ninput = sys.stdin.readline\r\nfrom statistics import mean\r\n\r\nn, n1, n2 = map(int, input().split())\r\nw = sorted(map(int, input().split()))\r\nn1, n2 = sorted([n1, n2])\r\na = mean(w[n-n1:])\r\nb = mean(w[n-n1-n2:n-n1])\r\nprint(a+b)", "n, n1, n2 = (int(x) for x in input().split())\r\na = list(int(x) for x in input().split())\r\na = sorted(a, reverse=True)\r\nif n1 < n2:\r\n s = 0\r\n for i in range(n1):\r\n s += a[i]\r\n d = 0\r\n for j in range(n1,n1+n2):\r\n d += a[j]\r\n #print(s , d)\r\n s /= n1\r\n d /= n2\r\nelse:\r\n s = 0\r\n for i in range(n2):\r\n s += a[i]\r\n d = 0\r\n for j in range(n2 , n1 + n2):\r\n #print(a[i])\r\n d += a[j]\r\n #print(s , d)\r\n s /= n2\r\n d /= n1\r\nprint(s+d)\r\n#print(a)", "n,n1,n2=map(int,input().split())\r\n\r\narr=list(map(int,input().split()))\r\n\r\narr.sort(reverse=True)\r\n\r\nif n1>n2:\r\n\ttmp1=sum(arr[0:n2])/n2\r\n\ttmp2=sum(arr[n2:n2+n1])/n1\r\n\r\n\tprint(tmp1+tmp2)\r\n\r\nelse:\r\n\ttmp1=sum(arr[0:n1])/n1\r\n\ttmp2=sum(arr[n1:n2+n1])/n2\r\n\r\n\tprint(tmp1+tmp2)\r\n\r\n\r\n", "import sys\r\nimport string\r\n\r\nfrom collections import Counter, defaultdict\r\nfrom math import fsum, sqrt, gcd, ceil, factorial\r\nfrom itertools import combinations, permutations\r\n\r\n# input = sys.stdin.readline\r\nflush = lambda: sys.stdout.flush\r\ncomb = lambda x, y: (factorial(x) // factorial(y)) // factorial(x - y)\r\n\r\n\r\n# inputs\r\n# ip = lambda : input().rstrip()\r\nip = lambda: input()\r\nii = lambda: int(input())\r\nr = lambda: map(int, input().split())\r\nrr = lambda: list(r())\r\n\r\n\r\nn, a, b = r()\r\n\r\nif a > b:\r\n a , b = b , a\r\n\r\n\r\narr = sorted(rr())\r\narr = arr[::-1]\r\nx = sum(arr[:a])/a\r\ny = sum(arr[a : a + b])/b\r\nz = x + y\r\n# print(x , y)\r\nprint(f\"{z:.8f}\")", "import sys\nimport string\n\nfrom collections import Counter, defaultdict\nfrom math import fsum, sqrt, gcd, ceil, factorial\nfrom itertools import combinations, permutations\n\n# input = sys.stdin.readline\nflush = lambda: sys.stdout.flush\ncomb = lambda x, y: (factorial(x) // factorial(y)) // factorial(x - y)\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, a, b = r()\n\nif a > b:\n a , b = b , a\n\n\narr = sorted(rr())\narr = arr[::-1]\nx = sum(arr[:a])/a\ny = sum(arr[a : a + b])/b\nz = x + y\n# print(x , y)\nprint(f\"{z:.8f}\")", "IL = lambda: list(map(int, input().split()))\r\nIS = lambda: input().split()\r\nI = lambda: int(input())\r\nS = lambda: input()\r\n\r\nn, n1, n2 = IL()\r\nn1, n2 = sorted([n1, n2])\r\n\r\na = IL()\r\na = sorted(a, reverse=True)[:n1+n2]\r\nn = len(a)\r\n\r\na2 = a[-min(n2, n-1):]\r\nprint(sum(a2)/len(a2) + (sum(a)-sum(a2))/(len(a)-len(a2)))", "n, n1, n2 = map(int, input().split())\r\n\r\npeople = [int(bruh) for bruh in input().split()]\r\n\r\npeople.sort()\r\n\r\nlarger = max(n1, n2)\r\nsmaller = min(n1, n2)\r\n\r\nsmall = people[n-smaller:]\r\nlarge = people[n - larger-smaller:n-smaller]\r\n\r\narithmean = sum(small)/smaller + sum(large)/larger\r\n\r\nprint((f'{arithmean:.9f}'))", "n, n1, n2 = map(int, input().split())\r\na = list(map(int, input().split()))\r\na = sorted(a, reverse=True)\r\nif n1 > n2:\r\n n1, n2 = n2, n1\r\n\r\ns1 = sum(a[:n1]) / n1\r\ns2 = sum(a[n1:n2 + n1]) / n2\r\nprint(s1 + s2)\r\n\r\n", "n, n1, n2 = map(int, input().split())\na = list(map(int, input().split()))\na.sort(reverse=True)\nmaxm = max(n1, n2)\nminm = min(n1, n2)\nprint(sum(a[:minm]) / minm + sum(a[minm:n1 + n2]) / maxm)\n", "n,n1,n2 = list(map(int,input().split()))\r\narr = list(map(int,input().split()))\r\narr.sort()\r\narr = arr[-1::-1]\r\nt1 = arr[:n1]\r\nt2 = arr[n1:n1+n2]\r\nx,y = sum(t1)/n1,sum(t2)/n2\r\nans = x+y\r\nt2 = arr[:n2]\r\nt1 = arr[n2:n1+n2]\r\nx,y = sum(t1)/n1,sum(t2)/n2\r\nans = max(ans,x+y)\r\nprint(ans)", "a,b,c = map(int,input().split(\" \"))\nl=list(map(int,input().split(\" \")))\nl.sort(reverse = True)\nif c>b:\n total = (sum(l[0:b])/b)+(sum(l[b:b+c])/c)\nelse:\n total = (sum(l[0:c])/c)+(sum(l[c:c+b])/b)\nprint(total)\n\n\t\n", "from sys import stdin ,stdout \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\nn,n1,n2=map(int,input().split()) ; arr=[int(i) for i in input().split()] ; arr.sort() ; na1=n1 ; na2=n2 ; summ1=0 ; summ2=0\r\nif n2>n1:\r\n for i in range(n-1,-1,-1):\r\n if na1!=0:\r\n summ1+=arr[i]\r\n na1-=1\r\n elif na2!=0:\r\n summ2+=arr[i]\r\n na2-=1\r\n else:\r\n break\r\nelse:\r\n for i in range(n-1,-1,-1):\r\n if na2!=0:\r\n summ2+=arr[i]\r\n na2-=1\r\n elif na1!=0:\r\n summ1+=arr[i]\r\n na1-=1\r\n else:\r\n break\r\nprint(summ1/n1+summ2/n2)\r\n \r\n", "n, n1, n2 = list(map(int, input().split()))\na = list(map(int, input().split()))\n\na.sort(reverse=1)\nif n1 < n2:\n\tc1 = a[:n1]\n\tc2 = a[n1:n1 + n2]\nelse:\n\tc2 = a[:n2]\n\tc1 = a[n2:n2 + n1]\n\nprint('{0:.8f}'.format(sum(c1)/n1+sum(c2)/n2))\n", "##n = int(input())\r\n##a = list(map(int, input().split()))\r\n##print(\" \".join(map(str, res)))\r\n\r\n[n, n1, n2] = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\n\r\na.sort(reverse=True)\r\ns1 = 0\r\ns2 = 0\r\nif n1 > n2:\r\n n1, n2 = n2, n1\r\nfor i in range(n1):\r\n s1 += a[i]\r\nfor i in range(n1, n1+n2):\r\n s2 += a[i]\r\nres = s1/n1+s2/n2\r\nprint(res)\r\n", "n,k1,k2=map(int,input().split())\nl=list(map(int,input().split()))\nl.sort()\nl.reverse()\nif(k1>k2):\n\tt=k1\n\tk1=k2\n\tk2=t\nx=0\ny=0\nfor i in range(0,k1+k2):\n\tif i>=k1:\n\t\ty+=l[i]\n\telse :\n\t\tx+=l[i]\n\nx/=k1\ny/=k2\nprint(x+y)", "#written by school hater\r\n#If you like beautiful code then you shouldn't read this one\r\na, b, c = map(int, input().split())\r\narr = ((sorted(list(map(int, input().split())))[::-1])[:b + c])[::-1]\r\nx, y = sorted([b, c])\r\nz = sum(arr[:y])\r\nprint(z / y + (sum(arr) - z) / x)", "n, n1, n2 = map(int, input().split())\r\nmass = sorted(list(map(int, input().split())), reverse = 1)\r\nprint(sum(mass[:min(n1, n2)]) / min(n1, n2) + sum(mass[min(n1, n2):min(n1, n2) + max(n1, n2)]) / max(n1, n2))", "n,a,b=map(int,input().split())\r\nl,c,d,sum=list(map(int,input().split())),0,0,0\r\nif(a>b) :\r\n a,b=b,a \r\nl.sort()\r\nfor i in range(n-1,-1,-1) :\r\n sum+=l[i]\r\n c+=1\r\n if c==a :\r\n break\r\nc,sum=sum/a,0\r\nfor i in range(n-a-1,-1,-1) :\r\n sum+=l[i]\r\n d+=1\r\n if d==b :\r\n break\r\nprint(sum/b+c) ", "n,n1,n2=map(int,input().split())\r\nl=list(map(int,input().split()))\r\na,b=0,0\r\nx,y=min(n1,n2),max(n1,n2)\r\nl.sort()\r\nl.reverse()\r\nfor i in range(n) :\r\n if (x>0) :\r\n a+=l[i]\r\n x-=1 \r\n elif (y>0) :\r\n b+=l[i]\r\n y-=1\r\nprint((a/min(n1,n2))+(b/max(n1,n2))) ", "n,n1,n2=map(int,input().split())\r\nl=[int(a) for a in input().split()]\r\nl.sort()\r\nif n1>n2: n1,n2=n2,n1\r\nprint(sum(l[n-n1:])/n1+sum(l[n-n1-n2:n-n1])/n2)", "n,m,k = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nans = 0.0000000\r\nal = sorted(l, reverse = True);\r\nans+= sum(al[:min(m,k)])/min(m,k);\r\nans+= sum(al[min(m,k):m+k])/max(m,k);\r\n \r\nprint(ans);\r\n\r\n", "n, a, b = [int(i) for i in input().split()]\r\nw = list(map(int, input().split()))\r\n\r\nif(a > b):\r\n\ta, b = b, a\r\nw.sort(reverse = True)\r\n\r\ns1 = 0\r\ns2 = 0\r\n\r\nfor i in range(n):\r\n\tif(i < a):\r\n\t\ts1 = s1 + w[i]\r\n\telif(i < a + b):\r\n\t\ts2 = s2 + w[i]\r\n\r\nprint(s1/a + s2/b)\r\n", "n, n1, n2 = map(int, input().split())\r\narr = list(map(int, input().split()))\r\narr.sort(reverse = True)\r\n\r\nif n1 > n2:\r\n n1, n2 = n2, n1\r\n\r\nsumOfN1 = sum(arr[:n1])\r\nsumOfN2 = sum(arr[n1:n1 + n2])\r\n\r\nprint(sumOfN1/n1 + sumOfN2/n2)", "n,n1,n2=map(int,input().strip().split(' '))\r\ns=list(map(int,input().strip().split(' ')))\r\ns.sort(reverse=True)\r\nm=min(n1,n2)\r\nma=max(n1,n2)\r\ns1=sum(s[:m])/m\r\ns2=sum(s[m:m+ma])/ma\r\n\r\n\r\nprint(s1+s2)", "n,n1,n2=map(int,input().split())\r\nl=sorted(list(map(int,input().split())))[::-1]\r\na=min(n1,n2)\r\nprint(sum(l[0:a])/a+sum(l[a:n1+n2])/max(n1,n2))", "n, n1, n2 = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\narr = sorted(arr, reverse=True)\r\n\r\nfor i in range(n-(n1+n2)):\r\n arr.pop()\r\n\r\n\r\nif n1 > n2:\r\n n1, n2 = n2, n1 \r\n\r\narr2 = []\r\n\r\nfor i in range(n2):\r\n arr2.append(arr[-1])\r\n arr.pop()\r\n\r\nsum1 = sum(arr)\r\nsum2 = sum(arr2)\r\n\r\n\r\nans = (sum1*n2+sum2*n1)/(n1*n2)\r\n\r\nprint(\"{:.8f}\".format(ans))\r\n", "l=input().split()\r\nl=list(map(int,l))\r\nn=l[0]\r\nn1=min(l[1],l[2])\r\nn2=max(l[1],l[2])\r\narr=input().split()\r\narr=list(map(int,arr))\r\narr.sort()\r\narr.reverse()\r\ns=0\r\ni=0\r\nwhile i!=n1:\r\n\ts=s+arr[i]\r\n\ti=i+1\r\nans=s/n1\r\ns=0\r\nwhile i!=(n1+n2):\r\n\ts=s+arr[i]\r\n\ti=i+1\r\nans=ans+(s/n2)\r\nprint (ans)\r\n", "n,n1,n2=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\na.sort()\r\nx=min(n1,n2)\r\ny=max(n1,n2)\r\na1=sum(a[-x:])/x\r\na2=sum(a[-y-x:-x])/y\r\nans=a1+a2\r\nprint(\"{:.8f}\".format(ans))\r\n", "n, nn, nnn = map(int, input().split())\r\n\r\na = sorted([int(x) for x in input().split()], reverse=True)\r\n\r\n\r\nif nn > nnn:\r\n nn , nnn = nnn, nn\r\n\r\nf = []\r\ns = []\r\n\r\nfor i in range(n):\r\n if nn > 0:\r\n f.append(a[i])\r\n nn -= 1\r\n elif nnn > 0:\r\n s.append(a[i])\r\n nnn -= 1\r\n else:\r\n break\r\n\r\nprint(\"{0:.8f}\".format((sum(f) / len(f)) + (sum(s) / len(s))))\r\n", "# print(\"Input n, n1, and n2\")\nn, n1, n2 = [int(x) for x in input().split()]\n\n# print(\"Input all the values\")\na = [int(x) for x in input().split()]\n\na.sort(reverse = True)\nsmallcity = min(n1, n2)\nlargecity = max(n1, n2)\n\nanswer = 0\n\nsmallsum = 0\nfor i in range(0, smallcity):\n smallsum += a[i]\nanswer += smallsum / smallcity\n\nlargesum = 0\nfor i in range(smallcity, smallcity + largecity):\n largesum += a[i]\nanswer += largesum / largecity\n\nprint(answer)\n", "n, n1, n2 = input().split()\r\nn = int(n)\r\nn1 = int(n1)\r\nn2 = int(n2)\r\narr = [int(i) for i in input().split()]\r\narr.sort(reverse=True)\r\nm = min(n1, n2)\r\nM = max(n1, n2)\r\nmean, total = (0, 0)\r\ncount = 0\r\nfor i in range(m):\r\n total += arr[i]\r\n count += 1\r\nmean += (total)/m\r\ntotal = 0\r\nj = 0\r\nwhile j < M and count < n:\r\n total += arr[count]\r\n count += 1\r\n j += 1\r\nmean += (total)/M\r\nprint(mean)\r\n", "n, n1, n2 = map(int, input().split())\na = [int(x) for x in input().split()]\na.sort()\na.reverse()\nn1, n2 = min(n1, n2), max(n1,n2)\nans1 = sum(a[0:n1])\nans2 = sum(a[n1:n1+n2])\nprint(ans1 / n1 + ans2 / n2)\n", "in1=input().split()\nn=int(in1[0])\ntemp_n1=int(in1[1])\ntemp_n2=int(in1[2])\nn1=min(temp_n1,temp_n2)\nn2=max(temp_n1,temp_n2)\nwealth=[int(i1) for i1 in input().split()]\nwealth.sort(reverse=True)\navg1=sum(wealth[ :n1])/n1\navg2=sum(wealth[n1:n1+n2])/n2\nprint(avg1+avg2)\n\t \t \t\t \t \t\t \t\t \t \t \t \t\t", "\r\nn, a, b = map(int, input().split())\r\nlst = list(map(int, input().split()))\r\n\r\nlst = sorted(lst,reverse=True)\r\n\r\nfor i in range(n-(a+b)):\r\n lst.pop()\r\n\r\nans = 0\r\nsum1 = 0\r\nsum2 = 0\r\nif b <= a:\r\n for i in range(b):\r\n sum2 += lst[i]\r\n\r\n ans += (sum2 / b)\r\n sum2 = 0\r\n\r\n for j in range(i + 1, len(lst)):\r\n sum2 += lst[j]\r\n\r\n ans += (sum2 / a)\r\nelse:\r\n for i in range(a):\r\n sum2 += lst[i]\r\n\r\n ans += (sum2 / a)\r\n sum2 = 0\r\n\r\n for j in range(i + 1, len(lst)):\r\n sum2 += lst[j]\r\n ans += (sum2 / b)\r\n\r\nprint(ans)\r\n", "import math\r\n\r\ndef main_function():\r\n n, n_1, n_2 = [int(i) for i in input().split(\" \")]\r\n a = sorted([int(i) for i in input().split(\" \")], reverse=True)\r\n print(sum(a[:min(n_1, n_2)]) / min(n_1, n_2) + sum(a[min(n_1, n_2):(n_1 + n_2)]) / max(n_1, n_2))\r\n\r\n\r\nmain_function()", "# cook your dish here\r\nn,a,b=map(int,input().split())\r\nl=[int(_) for _ in input().split()]\r\nl.sort()\r\ns1=0;s2=0\r\n# print(l[len(l)-min(a,b):]);print(l[len(l)-min(a,b)-max(a,b):len(l)-min(a,b)])\r\ns1=sum(l[len(l)-min(a,b):])/min(a,b)\r\ns2=sum(l[len(l)-min(a,b)-max(a,b):len(l)-min(a,b)])/max(a,b)\r\ns1=s1+s2\r\ns1=list(str(s1))\r\nfor i in range(len(s1)):\r\n s1[i]=str(s1[i])\r\nif '.' in s1:\r\n x=s1.index('.')\r\n l1=len(s1[x+1:])\r\n # print(l1)\r\n s1=\"\".join(s1)+'0'*(8-l1)\r\nprint(s1) ", "\r\nif __name__ == '__main__':\r\n\tn, n1, n2 = map(int, input().split())\r\n\tn1, n2 = min(n1, n2), max(n1, n2)\r\n\ta = sorted(map(int, input().split()), reverse=True)\r\n\ts1 = sum(a[:n1])\r\n\ts2 = sum(a[n1:(n1+n2)])\r\n\t#print(a, s1, s2, n1, n2)\r\n\tprint(s1 / n1 + s2 / n2)", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\nimport decimal\r\ninput=sys.stdin.readline\r\nn,n1,n2=(int(i) for i in input().split())\r\nl=sorted([int(i) for i in input().split()])\r\nm1=sum(l[n-min(n1,n2):])/min(n1,n2)\r\nm2=sum(l[n-n1-n2:n-min(n1,n2)])/max(n1,n2)\r\nprint(m1+m2)", "n, n1, n2 = map(int, input().split())\r\nnums = list(map(int, input().split()))\r\n\r\nnums.sort(reverse = True)\r\n\r\nif n1 > n2:\r\n n1, n2 = n2, n1\r\n\r\nmean1 = sum(nums[:n1]) / n1\r\nmean2 = sum(nums[n1: n1+n2]) / n2\r\n\r\nprint(mean1 + mean2)", "def solve(b,c,v):\r\n v.sort()\r\n if b>c:\r\n b,c=c,b\r\n n=len(v)\r\n i=n-1\r\n ansx=0\r\n ansy=0\r\n #print(b)\r\n #print(c)\r\n while i>=n-b-c:\r\n #print(v[i])\r\n if i>=n-b:\r\n ansx+=v[i]\r\n else:\r\n ansy+=v[i]\r\n i-=1\r\n #print(str(ansx) + \" \" + str(ansy))\r\n ans=ansx/b+ansy/c\r\n return ans\r\n\r\nn,b,c=map(int,input().split())\r\nv=list(map(int,input().split()))\r\nprint(solve(b,c,v))\r\n", "n, a, b = map(int, input().split())\r\nif a > b:\r\n a, b = b, a\r\n\r\narr = list(map(int, input().split()))\r\narr.sort(reverse=True)\r\ns1 = sum(arr[:a])\r\ns2 = sum(arr[a:a + b])\r\nprint(s1 / a + s2 / b)\r\n", "n,n1,n2=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nl.reverse()\r\nif n1<=n2:\r\n m1=sum(l[:n1])/n1\r\n m2=sum(l[n1:n1+n2])/n2\r\nelse:\r\n m1=sum(l[:n2])/n2\r\n m2=sum(l[n2:n1+n2])/n1\r\nprint(m1+m2)\r\n \r\n \r\n \r\n", "n,n1,n2 = map(int, input().split())\r\nnum = sorted(list(map(int, input().split(' '))), reverse=True)\r\n\r\nif n1>n2: n1,n2=n2,n1\r\nprint(sum(num[0:n1])/n1+sum(num[n1:n1+n2])/n2)\r\n\r\n", "n,a,b=map(int,input().split())\r\nl=sorted(list(map(int,input().split())),reverse =True)\r\nif(a>b):\r\n\tans=sum(l[:b])/b + sum(l[b:a+b])/a\r\n\tprint(\"{A:.8f}\".format(A=ans))\r\nelse:\r\n\tans=sum(l[:a])/a + sum(l[a:a+b])/b\r\n\tprint(\"{A:.8f}\".format(A=ans))", "# ========= /\\ /| |====/|\r\n# | / \\ | | / |\r\n# | /____\\ | | / |\r\n# | / \\ | | / |\r\n# ========= / \\ ===== |/====| \r\n# code\r\n\r\nif __name__ == \"__main__\":\r\n n,n1,n2 = map(int,input().split())\r\n a = [int(i) for i in input().split()]\r\n a.sort(reverse = True)\r\n if n1 > n2:\r\n n1,n2 = n2,n1\r\n s1 = sum(a[:n1])\r\n s2 = sum(a[n1:n2+n1])\r\n print(s1/n1 + s2/n2)", "n,u,v=map(int,input().split())\r\nif u>v:u,v=v,u\r\na=sorted(map(int,input().split()))[::-1]\r\nprint(sum(a[:u])/u+sum(a[u:u+v])/v)", "n, n1, n2 = map(int, input().split())\r\na = list(sorted(map(int, input().split())))\r\n\r\nif n1 < n2:\r\n n1, n2 = n2, n1\r\n \r\nprint(sum([i for i in a[n - n1 - n2: n - n2]]) / n1 + sum([i for i in a[n - n2:]]) / n2)\r\n", "n, n1, n2 = map(int, input().split())\narr = list(map(int, input().split()))\narr.sort(reverse = True)\n\nk1, k2 = min(n1, n2), max(n1, n2)\nans = sum(arr[0:k1])/k1 + sum(arr[k1:k1+k2])/k2\nprint(ans)\n", "n, n1, n2 = map(int, input().split())\r\na = [int(c) for c in input().split()]\r\na.sort(reverse=True)\r\nx = a[:n1]\r\ny = a[n1:n2+n1]\r\nx1 = a[:n2]\r\ny1 = a[n2:n2+n1]\r\ns = sum(x)/n1 + sum(y)/n2\r\ns1 = sum(x1)/n2 + sum(y1)/n1\r\nprint(max(s, s1))", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef solve(A, n1, n2):\r\n n = len(A)\r\n n1, n2 = (min(n1, n2), max(n1, n2))\r\n B1 = A[0:n1]\r\n B2 = A[n1:n1+n2]\r\n return sum(B1) / n1 + sum(B2) / n2\r\n\r\ndef main():\r\n n, n1, n2 = map(int, input().split())\r\n A = list(map(int, input().split()))\r\n A.sort(reverse=True)\r\n ans = solve(A, n1, n2)\r\n print('%.9f' % ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n,n1,n2=list(map(int,input().split()))\r\nl=list(map(int,input().split()))\r\nl.sort(reverse=True)\r\nn1,n2=sorted([n1,n2])\r\nprint((sum(l[:n1])/n1+sum(l[n1:n1+n2])/n2))", "import sys\r\ninput = sys.stdin.readline \r\n\r\nn, n1, n2 = map(int, input().split()) \r\na = list(map(int, input().split())) \r\n\r\na.sort(reverse = True) \r\nif(n1 > n2):\r\n n1, n2 = n2, n1 \r\nprint(sum(a[ : n1]) / n1 + sum(a[n1 : n1 + n2]) / n2)", "import math\r\n\r\ndef _input(): return map(int, input().split())\r\n\r\nn, n1, n2 = _input()\r\nm = min(n1, n2)\r\nM = max(n1, n2)\r\nlst = list(_input())\r\narr = sorted(list(set(lst)), reverse = True)\r\n\r\nl = {}\r\nfor i in lst: \r\n if i not in l: l[i] = 1\r\n else: l[i]+=1\r\n\r\nr1 = 0;r2=0; i=0; j=-1\r\nwhile i<m:\r\n j+=1\r\n k = min(l[arr[j]], (m-i))\r\n \r\n r1+=(k*arr[j])\r\n l[arr[j]]-=k\r\n i+=k\r\nr1/=m\r\n\r\nif l[arr[j]]==0: j+=1\r\ni=0\r\nwhile i<M:\r\n k = min(l[arr[j]], (M-i))\r\n r2+=(k*arr[j])\r\n l[arr[j]]-=k\r\n j+=1\r\n i+=k\r\nr2/=M\r\nprint(r1+r2)\r\n\r\n \r\n \r\n\r\n ", "n, n1, n2 = map(int, input().split())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\n\r\nif n1 > n2:\r\n n1, n2 = n2, n1\r\n\r\nsumOfN1 = sum(arr[n - n1:])\r\narr = arr[:n - n1]\r\nn = len(arr)\r\nsumOfN2 = sum(arr[n - n2:])\r\n\r\nprint(float(sumOfN1/n1) + float(sumOfN2/n2))", "n, n1, n2 = [int(s) for s in input().split()]\r\na = [int(s) for s in input().split()]\r\n\r\na = list(reversed(sorted(a)))\r\nx = min(n1, n2)\r\ny = max(n1, n2)\r\navg1 = sum(a[:x]) / x\r\navg2 = sum(a[x:x+y]) / y\r\nprint(avg1 + avg2)\r\n", "n,n1,n2 = input().split()\r\nn=int(n)\r\nn1=int(n1)\r\nn2=int(n2)\r\na = [int(i) for i in input().split()]\r\na.sort(reverse=True)\r\nma=max(n1,n2)\r\nmi=min(n1,n2)\r\nc1=0\r\nc2=0\r\nfor i in range(0,mi):\r\n c1=c1+a[i]\r\nc1=c1/mi\r\nfor i in range(mi,mi+ma):\r\n c2=c2+a[i]\r\nc2=c2/ma\r\nc1=c1+c2\r\nprint(c1)", "def solve():\r\n n, n1, n2 = map(int,input().split())\r\n arr = list(map(int,input().split()))\r\n arr.sort(reverse = True)\r\n if n1 > n2:\r\n n1, n2 = n2, n1\r\n print(sum(arr[:n1])/n1 + sum(arr[n1:n1+n2])/n2)\r\n\r\nsolve()\r\n \r\n \r\n \r\n \r\n", "n,n1,n2=list(map(int,input().split()))\r\na=sorted(list(map(int,input().split())),reverse=True)\r\ns1=sum(a[:min(n1,n2)])/min(n1,n2)\r\ns2=sum(a[min(n1,n2):n1+n2])/max(n1,n2)\r\nprint(s1+s2)", "n,a,b = [int(x)for x in input().split()]\nlis = [int(x)for x in input().split()]\nif(a>b):\n a,b = b,a\nsum1 = 0\nlis.sort()\ncopo = a\nfor i in range(len(lis)-1,-1,-1):\n if(copo == 0):\n break\n copo-=1\n sum1+=lis[i]\nsum2 = 0\ncopo2 = b\nfor i in range(len(lis)-1-a,-1,-1):\n if(copo2 == 0):\n break\n copo2-=1\n sum2+=lis[i]\nresult = (sum1/a)+(sum2/b)\nprint(round(result,9))", "[n,n1,n2] = map(int,input().split())\r\nv = list(map(int,input().split()))\r\nif n1 > n2:\r\n n1, n2 = n2, n1\r\nv.sort()\r\nv.reverse()\r\na = 0\r\nb = 0\r\nfor i in range(n1):\r\n a += v[i]\r\n \r\n\r\nfor i in range(n2):\r\n b += v[i+n1]\r\nprint(a/n1 + b/n2)", "n, n1, n2 = list(map(int,input().split(' ')))\nl = sorted(list(map(int,input().split(' '))),reverse = 1)\nl1 = []\nl2 = []\nif n2<n1:n1,n2 = n2,n1\ncurr = 1\n\nl1 = l[:n1]\nl2 = l[n1:n1 + n2]\nprint(sum(l1)/n1 + sum(l2)/n2)\n ", "n, n1, n2 = map(int, input().split())\r\nif n1 > n2:\r\n n1, n2 = n2, n1\r\nsum_n1 = sum_n2 = 0\r\nwealth = list(map(int, input().strip().split()))\r\nwealth.sort(reverse=True)\r\nfor i in range(0,n1):\r\n sum_n1 += wealth[i]\r\nfor j in range(0,n2):\r\n sum_n2 += wealth[n1+j]\r\n\r\narith_sum = (sum_n1 / n1) + (sum_n2 / n2)\r\nprint(arith_sum)\r\n\r\n", "n, n1, n2 = map(int,input().split())\r\na = list(sorted(list(map(int,input().split()))))[::-1]\r\nn1, n2 = min(n1,n2), max(n1,n2)\r\nprint(sum(a[:n1])/n1+sum(a[n1:n1+n2])/n2)\r\n\r\n\r\n", "n, p1, p2 = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort(reverse = True)\r\n\r\nif p1 < p2:\r\n n1, n2 = p1, p2\r\nelse:\r\n n1, n2 = p2, p1\r\n p1, p2 = p2, p1\r\n\r\nans_1 = [0 for _ in range(p1)]\r\nans_2 = [0 for _ in range(p2)]\r\n\r\nfor i in range(p1+p2):\r\n if p1:\r\n ans_1[p1-1] = a[i]\r\n p1 -= 1\r\n elif p2:\r\n ans_2[p2-1] = a[i]\r\n p2 -= 1\r\n\r\nprint(\"%.6f\"%(sum(ans_1)/n1+sum(ans_2)/n2))\r\n", "if __name__ == \"__main__\":\r\n\tn, n1, n2 = map(int, input().split())\r\n\ta = map(int, input().split())\r\n\ta = sorted([i for i in a])\r\n\tif n1 > n2:\r\n\t\tn1_cpy, n2_cpy = n2, n1\r\n\telse:\r\n\t\tn1_cpy, n2_cpy = n1, n2\r\n\tdiv1, div2 = n1_cpy, n2_cpy\r\n\tsum1, sum2 = 0, 0\r\n\twhile n1_cpy > 0:\r\n\t\tsum1 += (a.pop() / div1)\r\n\t\tn1_cpy -= 1\r\n\twhile n2_cpy > 0:\r\n\t\tsum2 += (a.pop() / div2)\r\n\t\tn2_cpy -= 1\r\n\tprint(sum1 + sum2)", "n,n1,n2=map(int,input().split())\r\nl=sorted(map(int,input().split()))[::-1]\r\nans=0\r\nif n1<n2: n1,n2=n2,n1\r\nans+=sum(l[:n2])/n2\r\nans+=sum(l[n2:n2+n1])/n1\r\nprint(ans)", "n, n1, n2 = map(int, input().split())\r\na = sorted([int(x) for x in input().split()], reverse=True)\r\n\r\nif n1 > n2:\r\n n1, n2 = n2, n1\r\n\r\nans = 0\r\n# n1 <= n2\r\nfor i in range(n1):\r\n ans += a[i] / n1\r\n\r\nfor i in range(n1, n1 + n2):\r\n ans += a[i] / n2\r\n\r\nprint(ans)", "raw = input().split()\r\nn = int(raw[0])\r\nn1 = int(raw[1])\r\nn2 = int(raw[2])\r\na = []\r\nraw = input().split()\r\nfor i in range(n):\r\n a.append(int(raw[i]))\r\n \r\na.sort()\r\nma = max(n1, n2)\r\nmi = min(n1, n2)\r\nres = 0\r\nfor i in range(mi) :\r\n res += a[n - 1 - i] / mi\r\nfor i in range(ma) :\r\n res += a[n - mi - 1 - i] / ma\r\nprint(res)\r\n", "# import math\r\nfrom collections import Counter, deque\r\nfrom math import *\r\n# from bisect import *\r\nmod = 998244353\r\n\r\n\r\n#1207-B\r\n#\r\n# from functools import reduce\r\n# from itertools import permutations\r\n# import queue\r\n\r\n\r\n\r\ndef solve():\r\n n,n1,n2=map(int,input().split())\r\n l=list(map(int,input().split()))\r\n x=n1+n2\r\n n1=min(n1,n2)\r\n n2=x-n1\r\n l.sort(reverse=True)\r\n sm=sum(l[:n1])\r\n sm2=sum(l[n1:n1+n2])\r\n ans=sm/n1+sm2/n2\r\n print(\"{:.8f}\".format(ans))\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()", "n,a,b=list(map(int,input().split()))\r\nt=min(a,b)\r\nsum=0\r\ncount=0\r\nk=list(map(int,input().split()))\r\nk.sort(reverse=True)\r\nfor i in range(t):\r\n sum+=k[i]\r\nk=k[t:]\r\nf=max(a,b)\r\nfor i in range(f):\r\n count+=k[i]\r\nprint((sum/t)+(count/f))\r\n \r\n\r\n\r\n\r\n\r\n", "import sys\r\nn,n1,n2 = map(int,input().split())\r\nalist = list(map(int,input().split()))\r\nalist.sort(reverse = True)\r\nsum1=sum2=0\r\nif(n1 < n2):\r\n for i in range(0,n1):\r\n sum1 += alist[i]\r\n\r\n for j in range(n1,n1+n2):\r\n sum2 += alist[j]\r\n print (sum1/n1 + sum2/n2)\r\nelse:\r\n for i in range(0,n2):\r\n sum1 += alist[i]\r\n for j in range(n2,n2+n1):\r\n sum2 += alist[j]\r\n print ( sum1/n2 + sum2/n1)", "n,n1,n2 = map(eval,input().split())\r\nw = list(map(eval,input().split()))\r\na = min(n1,n2)\r\nb = max(n1,n2)\r\nw.sort(reverse=True)\r\nsuma = 0\r\nsumb = 0\r\nfor i in range(a):\r\n suma += w[i]\r\nfor i in range(a,a+b):\r\n sumb += w[i]\r\nans = suma/a + sumb/b\r\nprint(ans)", "from heapq import nlargest,heapify\r\ndef solve():\r\n n,n1,n2=map(int,input().split());a=sorted(list(map(int,input().split())))\r\n\r\n ans=0\r\n\r\n t1=sum(a[n-(min(n1,n2))::])/min(n1,n2)\r\n for i in range(min(n1,n2)):a.pop()\r\n t2=sum(a[(n-min(n1,n2))-max(n1,n2)::])/max(n1,n2)\r\n print(t1+t2)\r\nsolve()\r\n# 3 2\r\n# 2 3 4 5 6", "a=list(map(int,input().split()))\nn=max(a)\na.pop(0)\nx=max(a)\ny=min(a)\narray=list(map(int,input().split()))\narray.sort(reverse=True)\nt=array[:y]\nr=array[y:x+y]\nt=sum(t)\nr=sum(r)\n\nt=t/y\nr=r/x\n\nprint(t+r)", "import re\r\nimport sys\r\nfrom bisect import bisect, bisect_left, insort, insort_left\r\nfrom collections import Counter, defaultdict, deque\r\nfrom copy import deepcopy\r\nfrom decimal import Decimal\r\nfrom itertools import (\r\n accumulate, combinations, combinations_with_replacement, groupby,\r\n permutations, product)\r\nfrom math import (acos, asin, atan, ceil, cos, degrees, factorial, gcd, hypot,\r\n log2, pi, radians, sin, sqrt, tan)\r\nfrom operator import itemgetter, mul\r\nfrom string import ascii_lowercase, ascii_uppercase, digits\r\n\r\n\r\ndef inp():\r\n return(int(input()))\r\n\r\n\r\ndef inlist():\r\n return(list(map(int, input().split())))\r\n\r\n\r\ndef instr():\r\n s = input()\r\n return(list(s[:len(s)]))\r\n\r\n\r\ndef invr():\r\n return(map(int, input().split()))\r\n\r\n\r\nn, n1, n2 = invr()\r\n\r\nif n1 > n2:\r\n n1, n2 = n2, n1\r\n\r\na = inlist()\r\na = sorted(a, reverse=True)\r\n\r\nres = (sum(a[:n1]) / n1) + (sum(a[n1:n1+n2])/n2)\r\nprint(res)\r\n", "import sys\r\narr = list(map(int,input().split()))\r\nn = arr[0]\r\nn1 = arr[1]\r\nn2 = arr[2]\r\narr2 = list(map(int,input().split()))\r\narr2.sort(reverse=True)\r\n\r\nsum1 = sum2 = 0\r\nif n1 < n2 :\r\n for i in range(n1):\r\n sum1 += arr2[i]\r\n sum1 = sum1/n1\r\n #print('sum1: i:',sum1,i)\r\n for j in range(i+1,i+n2+1):\r\n sum2 += arr2[j]\r\n sum2 = sum2/n2\r\n #print('sum2: j:',sum2,j)\r\n\r\nelif n1 > n2:\r\n for i in range(n2):\r\n sum2 += arr2[i]\r\n sum2 = sum2/n2\r\n #print('sum2: i:',sum2,i)\r\n for j in range(i+1,i+n1+1):\r\n sum1 += arr2[j]\r\n sum1 = sum1/n1\r\n #print('sum1: j:',sum1,j)\r\n\r\nelse:\r\n #print('test')\r\n\r\n for i in range(0,n1+n2,2):\r\n sum1 += arr2[i]\r\n sum2 += arr2[i+1]\r\n\r\n sum1 /= n1\r\n sum2 /= n2\r\n\r\nprint(sum1+sum2)\r\n", "# Description of the problem can be found at http://codeforces.com/problemset/problem/735/B\r\n\r\nn, m, o = map(int, input().split())\r\n\r\nl_n = list(map(float, input().split()))\r\nl_n.sort(reverse = True)\r\n\r\nw = [0] * 2\r\ni = 0\r\n\r\nif m > o:\r\n o, m = m, o\r\n\r\nwhile i < m + o:\r\n if i >= m:\r\n w[1] += l_n[i]\r\n else:\r\n w[0] += l_n[i]\r\n i += 1\r\n\r\nprint(w[0] / m + w[1] / o)", "i = lambda: map(int, input().split())\r\nn, x, y = i()\r\na = sorted(i())[::-1]\r\n\r\nif x > y:\r\n x, y = y, x\r\n\r\nprint(sum(a[:x])/x + sum(a[x:][:y])/y)\r\n", "n, n1, n2 = map(int, input().split())\r\n\r\nlt = list(map(int, input().split()))\r\n\r\nlt.sort(reverse = True)\r\n\r\n#print(lt)\r\n\r\nk1 = 0\r\nk2 = 0\r\ns1 = 0\r\ns2 = 0\r\n\r\nnMin = min(n1, n2)\r\nnMax = max(n1, n2)\r\n\r\nfor i in range(nMin):\r\n s1 += lt[k1]\r\n k1 += 1\r\n \r\nk2 = k1\r\nfor i in range(nMax):\r\n s2 += lt[k2]\r\n k2 += 1\r\n\r\n\r\n\r\ns1 = round(s1 / k1, 8)\r\ns2 = round(s2 / (k2-k1), 8)\r\n\r\nprint('{:.8f}'.format(s1+s2))\r\n", "n,a,b=map(int,input().split(' '))\nl=list(map(int,input().split(' ')))\nl.sort()\nprint(max(sum(l[-a:])/a + sum(l[-a-b:-a])/b,sum(l[-b:])/b + sum(l[-a-b:-b])/a)) \n", "n,n1,n2=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort(reverse=True)\r\nb=[]\r\nc=[]\r\nif n1<n2:\r\n for i in range(n1):\r\n b.append(a.pop(0))\r\n for i in range(n2):\r\n c.append(a.pop(0))\r\nelse:\r\n for i in range(n2):\r\n c.append(a.pop(0))\r\n for i in range(n1):\r\n b.append(a.pop(0)) \r\nx=sum(b)/n1+sum(c)/n2 \r\nprint('%.8f'%x)", "def solve():\r\n n,n1,n2 = map(int, input().split())\r\n lo = min([n1, n2])\r\n hi = max([n1, n2])\r\n l = list(map(int,input().split()))\r\n l.sort(reverse=True)\r\n #print(l)\r\n s1 = sum(l[:lo])\r\n s2 = sum(l[lo:lo+hi])\r\n #print(s1)\r\n #print(s2)\r\n ans = (s1/lo) + (s2/hi)\r\n print(ans)\r\nsolve()", "n,n1,n2=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\nif(n1<=n2):\r\n\ta1=0\r\n\tc1=0\r\n\tfor j in range(len(a)-1,-1,-1):\r\n\t\tif(c1>=n1):\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\ta1=a1+a[j]\r\n\t\t\tc1=c1+1\r\n\ta1=a1/n1\r\n\ta2=0\r\n\tc2=0\r\n\tfor i in range(j,-1,-1):\r\n\t\tif(c2>=n2):\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\ta2=a2+a[i]\r\n\t\t\tc2=c2+1\r\n\ta2=a2/n2\r\n\tprint(a1+a2)\r\nelse:\r\n\ta1=0\r\n\tc1=0\r\n\tfor j in range(len(a)-1,-1,-1):\r\n\t\tif(c1>=n2):\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\ta1=a1+a[j]\r\n\t\t\tc1=c1+1\r\n\ta1=a1/n2\r\n\ta2=0\r\n\tc2=0\r\n\tfor i in range(j,-1,-1):\r\n\t\tif(c2>=n1):\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\ta2=a2+a[i]\r\n\t\t\tc2=c2+1\r\n\ta2=a2/n1\r\n\tprint(a1+a2)", "n,n1,n2=map(int,input().split())\r\nn1,n2=min(n1,n2),max(n1,n2)\r\nl=sorted(list(map(int,input().split())))\r\nl.reverse()\r\nprint(sum(l[:n1])/n1+sum(l[n1:n1+n2])/n2)\r\n", "n,x,y = map(int,input().split())\r\na = list(map(int,input().split()))\r\na.sort(reverse = True)\r\nif(x>y):\r\n x,y = (y,x)\r\ncx = 0\r\ncy = 0\r\nm,n = (x,y)\r\nfor i in a:\r\n if(x>0):\r\n x-=1\r\n cx+=i\r\n elif(y>0):\r\n y-=1\r\n cy+=i\r\n else:\r\n break\r\nprint(cx/m+cy/n)", "n, a, b = list(map(int,input().split()))\r\ninp = list(map(int, input().split()))\r\ninp.sort()\r\nif b > a:\r\n a, b = b, a\r\nx = a\r\ny = b\r\nsum1 = 0\r\nsum2 = 0\r\nsum3 = 0\r\nsum4 = 0\r\nfor i in range(n - 1, -1, -1):\r\n if x != 0:\r\n sum1 += inp[i]\r\n x -= 1\r\n else:\r\n sum2 += inp[i]\r\n y -= 1\r\n if y == 0:\r\n break\r\nx = a\r\ny = b\r\nfor i in range(n - 1, -1, -1):\r\n if y != 0:\r\n sum3 += inp[i]\r\n y -= 1\r\n else:\r\n sum4 += inp[i]\r\n x -= 1\r\n if x == 0:\r\n break\r\nif (sum1 * b + sum2 * a) / (a * b) > (sum3 * a + sum4 * b ) / (a * b):\r\n print((sum1 * b + sum2 * a) / (a * b))\r\nelse:\r\n print((sum3 * a + sum4 * b ) / (a * b))", "inp=[int(s) for s in input().split()]\r\npeople=[int(s) for s in input().split()]\r\npeople.sort()\r\ns=len(people)\r\nsum1=0\r\nsum2=0\r\nif inp[1]<inp[2]:\r\n\tfor i in range(inp[1]):\r\n\t\tsum1+=people[s-i-1]\r\n\tfor i in range(inp[2]):\r\n\t\tsum2+=people[s-1-inp[1]-i]\r\n\tprint(sum1/inp[1]+sum2/inp[2])\r\nelse:\r\n\tfor i in range(inp[2]):\r\n\t\tsum1+=people[s-1-i]\r\n\tfor i in range(inp[1]):\r\n\t\tsum2+=people[s-1-inp[2]-i]\r\n\tprint(sum1/inp[2]+sum2/inp[1])", "n, n1, n2 = map(int, input().split())\r\nif n1 > n2:\r\n n1, n2 = n2, n1\r\na = list(map(int, input().split()))\r\na.sort(reverse=True)\r\nans = sum(a[0:n1]) / n1 + sum(a[n1:n1 + n2]) / n2\r\nprint(ans)\r\n\r\n#main thing is to decide who will get top people so it purely depends on n1 and n2..as contribution \r\n#of every a[i] is a[i]/n...so if n is less then a[i]/n is more...so more contribution in \r\n#arithematic mean...thats why we are taking big elements are reverse sort with n1 that is \r\n#less...and rest elements with n2 as simple as that\r\n", "n, n1,n2 = map(int,input().split())\r\na = list(map(float,input().split()))\r\na.sort(reverse=True)\r\nk = max(n1,n2)\r\nm = min(n1,n2)\r\nprint(sum(a[:m])/m+sum(a[m:m+k])/k)", "n, n1, n2 = map(int, input().split())\r\nx = sorted(list(map(int, input().split())))[::-1]\r\na = sum(x[:n1])/n1+sum(x[n1:n1+n2])/n2\r\nb = sum(x[:n2])/n2+sum(x[n2:n2+n1])/n1\r\nprint(max(a, b))\r\n", "n, n1, n2 = map(int, input().split())\r\narr = list(map(int, input().split()))\r\narr.sort(reverse = True)\r\nk1, k2 = min(n1, n2), max(n1, n2)\r\nres = sum(arr[:k1]) / k1 + sum(arr[k1:k1+k2]) / k2\r\nprint(res)\r\n", "def solve (n,t1,t2,seq) :\r\n seq.sort(reverse=True)\r\n mini = min(t1,t2)\r\n maxi = max(t1,t2)\r\n \r\n mean1 = sum(seq[:mini])/mini\r\n mean2 = sum(seq[mini:maxi+mini])/maxi\r\n \r\n return mean1 + mean2\r\n \r\n \r\nn , t1 ,t2 = list(map(int,input().split()))\r\nseq = list(map(int,input().split()))\r\n\r\nprint (solve(n,t1,t2,seq))\r\n \r\n ", "s=input().split()\r\n\r\nn=int(s[0])\r\nn1=int(s[1])\r\nn2=int(s[2])\r\n\r\na = [int(x) for x in input().split()]\r\n\r\na.sort()\r\ns1=0\r\ns2=0\r\n\r\nif n1>n2:\r\n n1,n2=n2,n1\r\n\r\nfor i in range(n-1,n-n1-1,-1):\r\n s1+=a[i]\r\ns1/=n1\r\n\r\nfor i in range(n-n1-1,n-n1-n2-1,-1):\r\n s2+=a[i]\r\ns2/=n2\r\n\r\nprint(s1+s2)", "n,a,b=[int(x) for x in input().split()]\ns=[0]*n\ns=[int(x) for x in input().split()]\ns.sort()\nif a>b:\n c=b\n b=a\n a=c\ni=n-1\nj=0\nsu=0\nwhile(j<a):\n su=su+s[i]\n i=i-1\n j+=1\nsum=0\nj=0\nwhile(j<b):\n sum=sum+s[i]\n i=i-1\n j+=1\nprint(su/a + sum/b)\n" ]

[ "import math as m\r\na,b=map(int,input().split())\r\nc=min(a,b)\r\nprint(m.factorial(c))", "d = input().split(' ')\nA = int(d[0])\nB = int(d[1])\n\ndef factorial(x):\n if x == 0: \n return 1\n return x * factorial(x-1)\n\nif A>=B:\n print(factorial(B))\nelse:\n print(factorial(A))\n\n\t\t \t\t \t\t\t\t \t \t \t \t \t\t\t \t \t \t", "import math\r\na,b=map(int,input().split())\r\nc=min(a,b)\r\nprint(math.factorial(c))\r\n", "import math\r\nn,p=map(int,input().split())\r\nz=math.factorial(min(n,p))\r\nprint(z)", "import math\r\nfrom math import gcd\r\n\r\ndef find_factorial(a,b):\r\n res = 1\r\n for i in range(1,min(a,b)+1):\r\n res*=i\r\n return res\r\n\r\n\r\n\r\n\r\na,b = list(map(int,input().split()))\r\n\r\nx = find_factorial(a,b)\r\ny = find_factorial(a,b)\r\nprint(gcd(x,y))", "import math\r\nab = input().split()\r\na = max(int(ab[0]),int(ab[1]))\r\nb = min(int(ab[0]),int(ab[1]))\r\nA,B =1,1\r\nfor i in range(1,b+1):\r\n B*=i\r\nfor i in range(1,a+1):\r\n A*=i\r\n if A%B==0 :\r\n break\r\nprint(math.gcd(A,B))\r\n", "def minfact(j,k):\r\n n=min(j,k)\r\n fact=1\r\n for i in range(1,n+1):\r\n fact*=i\r\n print(fact)\r\nj,k=[int(item) for item in input().split(' ')]\r\nminfact(j,k)", "from math import factorial as fact\r\na,b=list(map(int,input().split()))\r\nprint(fact(min(a,b)))", "def gt(n):\r\n p=1\r\n for i in range(1,n+1):\r\n p*=i\r\n return p\r\na,b = [int(x) for x in input().split()]\r\nprint(gt(min(a,b)))", "a, b = map(int, input().split())\r\n\r\ndef fact(x):\r\n if x == 1: return 1\r\n return x * fact(x - 1)\r\n\r\nprint(fact(min(a, b)))\r\n\r\n", "\r\nimport math\r\narr = list(map(int,input().split()))\r\n\r\n\r\nans = min(arr)\r\nprint(math.factorial(ans))\r\n", "def fact(t):\n if(t==0):\n return 1 \n else:\n return t*fact(t-1)\na,b=map(int,input().split())\nprint(fact(min(a,b)))\n\t\t\t \t\t \t\t \t\t \t \t \t\t \t\t\t\t\t \t", "numbers = tuple (map (int, input ().split (' ')))\r\nresult = 1\r\nfor i in range (1, min (numbers) + 1):\r\n result *= i\r\nprint (result)\r\n", "def fact(n):\r\n pr = 1\r\n for i in range(2,n+1):\r\n pr *= i\r\n return pr\r\n\r\na, b = map(int, input().split())\r\n\r\nk = min(a,b)\r\n\r\nprint(fact(k))", "n,m=map(int,input().split())\r\nm=min(n,m)\r\nx=1\r\nwhile m>0:\r\n x*=m\r\n m-=1\r\nprint(x)", "import math\nx,y=map(int,input().split())\nprint(math.factorial(min(x,y)))\n\t \t \t \t\t\t \t\t\t\t \t \t\t\t \t \t\t\t\t", "a=[0]*(1000001)\na[0]=1\nfor i in range(1,1000001):\n\ta[i]=(i%(10**9+7)*a[i-1]%(10**9+7))%(10**9+7)\nn1,n2=map(int,input().split())\nif n1<n2:\n\tprint(a[n1])\nelif n1>n2:\n\tprint(a[n2])\nelif n1==n2:\n\tprint(a[n1])\n \t\t\t\t \t \t \t\t\t \t \t \t \t", "import math\r\nb,c=list(map(int,input().split()))\r\nq=min(b,c)\r\nprint(math.factorial(q))\r\n", "a, b = map(int, input().split())\r\nm = min(a,b)\r\nx = 1\r\nfor i in range(1, m+1):\r\n x *= i\r\nprint(x)\r\n", "import math\r\nm,n = map(int,input().split())\r\nprint(math.factorial(min(m,n)))", "import math\r\na,b=map(int,input().split())\r\nx=min(a,b)\r\na=math.factorial(x)\r\nprint(a)", "import math\nm,n=map(int,input().split())\nb=min(m,n)\nprint(math.factorial(b))\n#hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh\n\t \t \t\t \t\t\t \t\t \t\t \t\t\t", "from math import *\r\nm,p=map(int,input().split())\r\nq=[]\r\nq.append(m)\r\nq.append(p)\r\nprint(factorial(min(q)))\r\n", "A , B = input().split()\r\nminn = min(int(A),int(B))\r\nfactorial = 1\r\nfor i in range(1,minn+1):\r\n factorial *=i\r\nprint(factorial)\r\n", "import math\r\no,p = map(int,input().split())\r\nprint(math.factorial(min(o,p)))", "def gcd(a, b):\r\n while b > 0:\r\n a, b = b, a % b\r\n return a\r\n\r\n\r\na, b = map(int, input().split())\r\nc = 1\r\nfor i in range(1, min(a, b) + 1):\r\n c *= i\r\nprint(c)\r\n", "from math import factorial as fact\r\na, b = map(int,input().split())\r\nx = min(a,b)\r\nprint(fact(x))", "def solve(a,b): \r\n g=1\r\n for p in range(1,min(a,b)+1):\r\n g *= p\r\n print(g)\r\n\r\nt = 1 #int(input())\r\nfor i in range(t):\r\n a,b = map(int, input().split())\r\n \r\n solve(a,b)", "# your code goes here\nimport math\na,b=map(int,input().split())\nprint(math.factorial(min(a,b)))\n\t\t \t \t\t\t\t \t\t\t\t\t \t\t\t\t\t\t", "a,b=map(int,input().split())\r\nc=min(a,b)\r\ns=1\r\nfor i in range(1,c+1):\r\n s=s*i\r\nprint(s)", "a,b=map(int,input().split())\r\nmini=min(a, b)\r\nminifact=1\r\nfor i in range(1,mini+1):\r\n\tminifact*=i\r\nprint(minifact)", "a, b = [int(i) for i in input().split()]\r\nc = min(a,b)\r\np = 1\r\nfor i in range(c):\r\n p *= i+1\r\nprint(p)", "import math\r\na,b=map(int, input().split())\r\nb=math.factorial(min(a,b))\r\nprint(b)", "a,b=map(int,input().split())\nx=min(a,b)\nf=1\nfor i in range(1,x+1):\n\tf*=i\nprint(f)\n\t \t\t\t \t \t \t \t\t \t \t \t \t\t\t", "a = list(map(int, input().split(\" \")))\nx = min(a[0], a[1])\ny = 1\nfor i in range(1, x+1):\n y *= i\nprint(y)\n\n\t\t\t\t\t \t\t \t\t\t\t \t \t \t\t \t \t\t \t\t", "def func(t):\r\n if t == 1:\r\n return 1\r\n else:\r\n return func(t - 1) * t\r\nn,m = map(int, input().split())\r\nprint(func(min(m,n)))", "import math\r\nA, B = map(int, input().split())\r\nminimum = min(A, B)\r\nres = math.factorial(minimum)\r\nprint(res)", "def fac(n):\r\n if n==1:\r\n return 1\r\n return n*fac(n-1)\r\n \r\na,b=map(int,input().split())\r\nm=min(a,b)\r\nprint(fac(m))", "a,b=list(map(int,input().split()))\nx=min(a,b)\ny=1\nfor i in range(2,x+1):\n y=y*i\n\nprint(y)\n \t \t \t \t \t\t\t\t\t\t\t\t \t\t\t\t\t \t \t \t", "import math\r\nn1, n2=map(int, input().split())\r\nf1 = 1\r\nf2 = 1\r\nwhile(n1>0 and n2>0):\r\n f1 = f1*n1\r\n n1=n1-1\r\n f2 = f2*n2\r\n n2=n2-1\r\n \r\n \r\n\r\nprint(math.gcd(f1,f2))", "def factorial(n : int)->int:\n if n <= 1:\n return 1\n return n * factorial(n-1)\n\ndef gcd_of_factorial(a : int, b : int)-> int:\n return factorial(min(a,b))\n\na , b = [int(x) for x in input().split()]\nprint(gcd_of_factorial(a,b))\n \t\t \t\t\t\t\t \t \t \t\t \t \t \t", "import math\r\na,b=map(int,input().split())\r\nk=min(a,b)\r\nprint(math.factorial(k))\r\n \r\n \r\n \r\n", "a,b=map(int,input().split())\r\nif a>b: a,b=b,a\r\nx = 1\r\nwhile a:\r\n x *= a\r\n a -= 1\r\nprint(x)", "def factorial(n):\r\n if (n==1 or n==0):\r\n return 1\r\n else:\r\n return n * factorial(n - 1)\r\na,b=map(int,input().split())\r\nprint(factorial(min(a,b)))", "n,m=map(int,input().split())\ni=1\nans=1\nwhile(i<=min(n,m)):\n ans=ans*i\n i+=1\nprint(ans)\n\t \t\t\t \t \t\t\t\t\t\t \t \t \t \t\t", "import math\r\na, b = map(int, input().split())\r\nf = max(a, b)\r\nh = min(a, b)\r\na = f\r\nb = h\r\nprint(math.factorial(b))\n# Thu Jul 06 2023 11:17:10 GMT+0300 (Moscow Standard Time)\n", "\r\ndef factorial(n):\r\n\tif n == 1 or n == 0:\r\n\t\treturn 1\r\n\telse:\r\n\t\treturn n*factorial(n-1)\r\n\r\nimport math as m\r\na,b = map(int,input().split())\r\nminimum = min(a,b)\r\nprint(factorial(minimum))\r\n\r\n", "import sys\n\ndef fac(n):\n if n==0 or n==1:\n return 1\n return n*fac(n-1)\n\n\nn,m=map(int,sys.stdin.readline().split())\nr=min(n,m)\nres=fac(r)\nsys.stdout.write(str(res)+'\\n')\n \n\n \t \t\t \t\t\t\t \t\t\t\t \t\t\t\t \t\t \t", "a,b=list(map(int,input().split()))\na=min(a,b)\nfact=1\nfor i in range(1,a+1):\n fact*=i\nprint(fact)\n\t \t \t\t\t\t\t \t\t\t \t \t\t \t\t \t\t", "from math import factorial as f\r\na,b=[int(x) for x in input().split()]\r\nprint(f(min(a,b)))", "from math import factorial\r\nfrom sys import stdin, stdout\r\n\r\na, b = map(int, stdin.readline().split())\r\nprint(factorial(min(a, b)))\r\n", "import math\r\na = input().split()\r\nb = int(a[0])\r\nc = int(a[1])\r\nd = min(b,c)\r\nprint(math.factorial(d))\r\n", "import math\r\nlis=list(map(int,input().strip().split()))\r\na=lis[0]\r\nb=lis[1]\r\nm=min(a,b)\r\nprint(math.factorial(m))\r\n", "j,k=list(map(int,input().split()))\na=min(j,k)\nb=1\nfor i in range(2,a+1):\n b=b*i\nprint(b)\n\t\t\t \t\t\t \t \t\t\t\t \t\t\t \t \t", "def gcd(c):\r\n if c==0:\r\n return 1\r\n return c*gcd(c-1)\r\n\r\na,b=map(int,input().split())\r\nc=min(a,b)\r\ng=gcd(c)\r\nprint(g)", "import math\r\n\r\n\r\ndef factorial(n):\r\n return 1 if (n == 1 or n == 0) else n * factorial(n - 1)\r\n\r\n\r\nA, B = map(int, input().split())\r\n\r\n\r\nprint( factorial(min(A,B)))", "from fractions import gcd\r\nimport math\r\n\r\nx,y = map(int, input().split())\r\nm = min(x, y)\r\nz = 1\r\n\r\nfor i in range(m, 0, -1):\r\n z*=i\r\n\r\nprint(z)", "from math import factorial\r\n\r\na, b = map(int, input().split())\r\n\r\nprint(factorial(a if a< b else b))", "import math\r\na,b = map(int,input().split())\r\nans = 1\r\nx = min(a,b)\r\nfor i in range(1,x+1):\r\n ans *= i\r\nprint(ans)", "from math import factorial\r\nn,m=[int(v) for v in input().split()]\r\nprint(factorial(min(n,m)))", "def GCD(a):\n\tres=1\n\twhile(a>=0):\n\t\tif a==0:\n\t\t\tres*=1\n\t\t\tbreak\n\t\telse:\n\t\t\tres*=a\n\t\t\ta-=1\n\treturn res\n\na,b=map(int,input().split())\nmn=min(a,b)\nprint(GCD(mn))\n\n\t\t \t \t\t\t \t \t\t\t \t \t \t\t\t\t", "import logging\n\nl = logging.Logger(\"\")\nh = logging.StreamHandler()\nf = logging.Formatter(fmt=\"[{filename}:{lineno}] {msg}\", style=\"{\")\nh.setFormatter(f)\nl.addHandler(h)\nbug = l.info\n\n# To disable uncomment the next line\n# bug = lambda x:None\n\n# teste=(1,2,3,4)\n# bug(f'{teste=}')\n# bug(f'{2*teste=}')\n\n# -------------------------------------------------------------------- #\nfrom math import factorial\n\n\ndef main():\n n, m = sorted(list(map(int, input().split())))\n print(factorial(n))\n\n\nif __name__ == '__main__':\n main()\n\n \t \t\t\t \t \t \t\t \t\t \t\t \t", "import math\r\nx,y=map(int,input().split())\r\nif(x>y):\r\n print(math.factorial(y))\r\nelse:\r\n print(math.factorial(x))", "a,b=map(int,input().split())\r\nx=1\r\nif a<b:\r\n for i in range(1,a+1):\r\n x*=i\r\n print(x)\r\nelse:\r\n for i in range(1,b+1):\r\n x*=i\r\n print(x)\r\n", "#Imboredwithlife\r\n\r\na,b = map(int,input().split())\r\n\r\nif a < b:\r\n\ta,b = b,a\r\n\r\nvalue = 1\r\n\r\n# print(value)\r\nfor num in range(2,b+1):\r\n\r\n\tvalue*=num\r\n\t# print(value)\r\n\r\nprint(value)", "a, b = map(int, input().split())\r\n \r\nm = min(a,b)\r\ngcd = 1\r\nif( a == m):\r\n for i in range(1,a+1):\r\n gcd = gcd*i\r\nelse:\r\n for i in range(1, b+1):\r\n gcd = gcd*i\r\nprint(gcd)", "#By Anan instagram: anan.ssw\r\nfrom math import factorial\r\nA,B=map(int, input().split())\r\nif A==B:\r\n print(factorial(A))\r\nelif A<B:\r\n print(factorial(A))\r\nelse:\r\n print(factorial(B))\r\n\r\n \r\n", "def boredlife(a,b):\r\n x,y=1,1\r\n if(a<=b):\r\n for i in range(1,a+1):\r\n x *= i\r\n return x\r\n elif(a>b):\r\n for i in range(1,b+1):\r\n y *= i\r\n return y\r\na,b = map(int,input().split())\r\nprint(boredlife(a,b))\r\n ", "a,b=map(int,input().split())\nc=min(a,b)\nans=1\nfor i in range(2,c+1):\n ans*=i\nprint(ans)\n \t \t \t \t\t \t\t \t\t \t\t\t\t \t\t", "s=input()\np=list(map(int,s.split(\" \")))\nn=p[0]\nk=p[1]\ndef fact(n):\n s=1\n for i in range(1,n+1):\n s=s*i\n return(s)\nif n<k:\n print(fact(n))\nelse:\n print(fact(k))\n \t \t\t \t \t\t\t\t \t \t \t\t \t \t", "x,y = tuple(map(int,input().split()))\r\nans = 1\r\nfor i in range(1,min(x,y)+1):\r\n ans *= i\r\nprint(ans)", "import math\r\na, b = map(int, input().split())\r\nx = max(a,b)\r\ny = min(a,b)\r\nn = []\r\nmul = 1\r\nfor i in range(1,x+1):\r\n mul*=i\r\n n.append(mul)\r\n if i == y:\r\n break\r\nprint(n[-1])\r\n", "n,m=map(int,input().split())\ni=1\na=1\nwhile(i<=min(n,m)):\n a=a*i\n i+=1\nprint(a)\n \t \t\t\t\t \t\t \t \t\t\t \t \t\t \t", "a,b = map(int,input().split())\r\nm = min(a,b)\r\np = 1\r\nwhile m>0:\r\n p*=m\r\n m-=1\r\nprint(p)", "def fact(num):\n if num <= 1: return 1\n return fact(num - 1)*num\nf, h = (int(u) for u in input().split())\nprint(fact(min(f, h)))\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\nfact = 1\r\nfor i in range(1, min(a,b)+1):\r\n fact *= i\r\nprint(fact)", "def fact(n : int)->int:\n if n <= 1:\n return 1\n return n * fact(n-1)\n\ndef gcd_of_fact(a : int, b : int)-> int:\n return fact(min(a,b))\n\na , b = [int(x) for x in input().split()]\nprint(gcd_of_fact(a,b))\n\t \t \t\t\t \t\t \t \t\t \t \t\t\t", "import math\r\n\r\nA, B = map(int, input().split())\r\nprint(math.factorial(min(A,B)))", "def solve(a,b):\r\n c=0\r\n if a<b:\r\n c=a\r\n else:\r\n c=b\r\n ans = 1\r\n for i in range(c, 0,-1):\r\n ans*=i\r\n return ans\r\n\r\na,b=map(int,input().split())\r\nprint(solve(a,b))\r\n", "import math\r\n\r\ns = input()\r\na = list(map(int, s.split()))\r\n\r\nprint(math.factorial(min(a[0], a[1])))", "n,m=list(map(int,input().split()))\na=min(n,m)\nb=1\nfor i in range(2,a+1):\n b=b*i \nprint(b)\n\t\t\t\t \t\t \t \t\t \t \t\t \t\t\t \t", "def fact(n):\n if n==1:\n return 1\n else:\n return n*fact(n-1)\n\n\nn = input().split()\nx = int(n[0])\ny = int(n[1])\n\nif x>y:\n print(fact(y))\nelse:\n print(fact(x))\n\t\t\t\t\t\t \t \t\t \t\t\t \t\t\t\t \t\t\t", "\nfrom sys import stdin\nfrom math import log,floor,ceil,gcd,factorial\nfrom collections import defaultdict as dd\n#from bisect import bisect_left as bl,bisect_right as br\n\n\ninput =stdin.readline\ninp =lambda: int(stdin.readline())\nrs =lambda: stdin.readline().strip()\n\n\ndef ra(typ) : return list(map(typ, stdin.readline().split()))\ndef rv(typ) : return map(typ, stdin.readline().split())\n\n\n#mod = 1000000007\n\n\ndef main():\n a, b = rv(int)\n x = min(a, b)\n print(factorial(x))\n \n\nmain()\n\t \t \t\t\t\t\t \t \t\t\t \t\t\t", "x = list(map(int , input().split()))\ny = int(min(x))\np =1\nfor i in range(y ,0,-1):\n p = p*i\nprint(p)\n", "a,b= map(int,input().split())\nout = 1;\nz=min(a,b)\n\nfor i in range(2,z+1):\n out=out*i;\n \nprint(out)\n \n \t \t \t\t\t\t\t\t \t \t \t \t \t\t \t\t \t", "k=list(map(int,input().split()))\r\ns=min(k)\r\nfact=1\r\nfor i in range(1,s+1):\r\n fact=fact*i\r\nprint(fact)", "import math\r\na,b = map(int,input().split())\r\nm = min(a,b)\r\nf = math.factorial(m)\r\nprint(f)", "A,B = map(int,input().split())\r\nans = 1\r\nfor i in range(1,min(A,B)+1):\r\n ans *=i\r\nprint(ans)\r\n", "import math\r\ndef factorial(n):\r\n if n == 1 or n == 0:\r\n return 1\r\n else:\r\n return n*factorial(n-1)\r\na,b = input().split()\r\na = int(a)\r\nb = int(b)\r\nz = min(a,b)\r\nprint(factorial(z))\r\n", "import math\nm,n = map(int,input().split())\nprint(math.factorial(min(m,n)))\n \t\t \t\t \t \t\t \t\t \t\t \t \t\t \t\t", "a, b = map(int, input().split())\r\nc = 1\r\na = min(a, b)\r\n\r\nfor i in range(2, a+1):\r\n c *= i\r\n\r\nprint(c)\r\n \r\n\r\n", "def fac(n : int)->int:\n if n <= 1:\n return 1\n return n * fac(n-1)\n\ndef gcd_of_fac(a : int, b : int)-> int:\n return fac(min(a,b))\n\na , b = [int(x) for x in input().split()]\nprint(gcd_of_fac(a,b))\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\n\r\nn = min(a, b)\r\n\r\np = 1000000000\r\nans = 1\r\n\r\nfor i in range(1, n + 1):\r\n ans *= i\r\n ans %= p\r\n\r\nprint(ans)", "from fractions import gcd\r\nimport math\r\n\r\nk, a = map(int, input().split())\r\n\r\nsej = min(k, a)\r\n\r\nl = 1\r\n\r\nfor i in range(sej, 0, -1):\r\n l*=i\r\n\r\nprint(l)", "x = list(map(int , input().split()))\ny = int(min(x))\np =1\nfor j in range(y ,0,-1):\n p = p*j\nprint(p)\n\n\t\t \t\t \t\t\t \t\t\t \t \t \t\t\t \t\t\t \t\t\t\t", "a, b = map(int,input().strip().split())\nif a > b:\n a, b = b, a\n\n# a is smaller.\n# GCD = a !\nfrom math import factorial\nprint(factorial(a))\n \t \t\t\t\t\t\t \t\t\t\t \t\t \t\t\t\t", "a1,b1=map(int,input().split())\nm=min(a1,b1)\ng=1\nfor i in range(1,m+1):\n g=g*i\nprint(g)\n \t \t \t\t\t\t \t\t\t\t \t \t \t\t \t\t", "n=list(map(int, input().split()))\r\na=n[0]\r\nb=n[1]\r\nif a<=b:\r\n c=1\r\n for i in range(1, a+1):\r\n c*=i\r\n print(c)\r\nelif b<=a:\r\n c=1\r\n for i in range(1, b+1):\r\n c*=i\r\n print(c)\r\n\r\n", "k=[int(i) for i in input().split()]\nn=min([k[0],k[1]])\ns=1\nfor i in range(1,n+1):\n s*=i\nprint(s)\n", "a,b = map(int,input().split())\ns=1\nn = min(a,b)\nfor i in range(1,n+1):\n s = s*i\nprint(s)\n \t\t \t\t \t\t \t\t \t \t \t\t\t \t", "import math\r\nn,m = map(int,input().split())\r\nprint(math.factorial(min(n,m)))", "from math import factorial\nprint(factorial(min(map(int, input().split()))))\n\n \t\t \t \t\t \t \t \t \t\t \t \t", "def f(n):\r\n if n < 2: return 1\r\n return n * f(n - 1)\r\na, b = map(int, input().split())\r\nprint(f(min(a, b)))", "from math import factorial as f\r\nprint(f(min(list(map(int,input().split())))))", "def factorial(n):\n\tif n == 0:\n\t\treturn 1\n\telse:\n\t\treturn n * factorial(n - 1)\n\na, b = [int(tmp) for tmp in input().split()]\nprint(factorial(min(a, b)))\n", "a,b=map(int,input().split())\r\nm=min(a,b)\r\nfact=1\r\nfor i in range (1,m+1):\r\n\tfact=fact*i\r\nprint(fact)", "a,b=map(int,input().split())\nx=min(a,b)\ny=1\nfor i in range(1,x+1):\n\ty=y*i\nprint(y)\n\t\t\t\t\t \t\t \t\t \t\t \t\t\t \t\t", "import math\na=list(map(int,input().split()))\nb=a[0]\nc=a[1]\nif b<c:\n\tprint(math.factorial(b))\nelse:\n\tprint(math.factorial(c))\n\t \t\t\t\t \t\t \t \t \t \t \t\t\t \t\t", "from math import gcd\n\n(A, B) = map(int, input().split(' '))\n\nbigger_number = max(A, B)\nsmaller_number = min(A, B)\n\nresult = 1\nif smaller_number > 1:\n for i in range(2, smaller_number + 1):\n result *= i\n print(result)\nelse:\n print('1')\n", "#I'm bored with life:\r\n#Mian_Talha\r\na,b = map(int,input().split())\r\nMin = min(a,b)\r\nq=1\r\nfor i in range(Min,0,-1):\r\n q= q*i\r\nprint(q)", "import math\r\nA,B = map(int,input().split())\r\n\r\nprint(math.factorial(min(A,B)))", "p,q=map(int,input().split())\nans=1 \nm=min(p,q)\nfor i in range(1,m+1):\n ans*=i \nprint(ans) \n \t\t \t\t\t\t\t \t\t \t \t\t\t \t \t", "a,b=map(int,input().split())\r\nif a>b:\r\n factorial = 1\r\n for i in range(2, b+1):\r\n factorial *= i\r\nelse:\r\n factorial = 1\r\n for i in range(2, a+1):\r\n factorial *= i\r\nprint(factorial)\n# Thu Jul 06 2023 13:19:31 GMT+0300 (Moscow Standard Time)\n", "a,b=map(int,input().split())\nmini=min(a, b)\nminifact=1\nfor i in range(1,mini+1):\n\tminifact*=i\nprint(minifact)\n\t\t\t\t \t \t\t \t\t\t \t \t\t\t \t\t \t", "a,b=map(int,input().split())\nm=min(a,b)\nc=1 \nfor i in range(1,m+1):\n c=c*i \nprint(c)\n\t\t\t \t \t\t \t\t \t\t\t\t\t \t", "def fact(n):\r\n if n<=1:\r\n return 1\r\n return n*fact(n-1)\r\na,b=map(int,input().split())\r\nx=min(a,b)\r\nprint(fact(x))", "a, b = map(int,input().split())\n\nnum = b\nif a < b:\n\tnum = a\n\ndef fact(n):\n\tprev = 1\n\tcurr = 1\n\tfor i in range(1, n + 1):\n\t\tprev = curr\n\t\tcurr *= i\n\treturn curr\nprint(fact(num))\n\t\t \t \t\t\t\t\t \t\t \t\t \t \t\t \t \t\t", "import math\r\na, b = map(int, input().split())\r\nm = min(a, b)\r\nprint(math.factorial(m))\n# Thu Jul 06 2023 14:54:06 GMT+0300 (Moscow Standard Time)\n", "def fact(n: int) -> int:\r\n return 1 if n == 1 else n * fact(n-1)\r\n\r\n\r\ndef main():\r\n a, b = map(int, input().split())\r\n res = fact((min(a, b)))\r\n print(res)\r\n\r\n\r\nmain()", "a1,b1=map(int,input().split())\r\nm=min(a1,b1)\r\ng=1\r\nfor i in range(1,m+1):\r\n g=g*i\r\nprint(g)", "a,b=map(int,input().split())\nans=1\nm=min(a,b)\nfor i in range(1,m+1):\n\tans*=i\nprint(ans)\n\t \t\t\t\t \t \t \t\t \t\t\t\t", "num1, num2 = map(int, input().split())\nmin_num = min(num1, num2)\nfactorial_num = 1\nfor i in range(1,min_num+1):\n\tfactorial_num = factorial_num * i\n\t#print(factorial_num)\nprint(factorial_num)\n\t\t\t \t \t \t \t \t\t\t \t \t\t\t \t", "from math import *\r\nfrom math import *\r\nx,y = map(int,input().split())\r\nN = min(x,y)\r\nprint(factorial(N))", "import math\na = input().split(\" \")\na = [int(i) for i in a]\n\nprint(math.factorial(min(a[0],a[1])))\n \t \t\t \t \t\t \t \t \t \t \t\t", "import math\na,b = map(int,input().split())\nk = min(a,b)\nprint(math.factorial(k))\n\t\t\t\t \t \t \t\t\t \t\t\t\t\t", "import math\n\nA, B = map(int, input().split())\n\ngcd_result = 1\n\nfor i in range(2, min(A, B) + 1):\n gcd_result *= i\n\nprint(gcd_result)\n\n\t\t \t\t\t \t \t \t\t \t \t \t \t \t\t\t\t", "import math;print(math.factorial(min(map(int,input().split()))))", "n,m=map(int,input().split())\r\na=min(n,m)\r\np=1\r\nfor i in range(2,a+1):\r\n p=p*i\r\nprint(p)\r\n", "a, b = map(int,input().split())\r\ns = min(a,b)\r\nf = 1\r\nfor i in range(2,s+1):\r\n f *= i\r\nprint(f)\n# Thu Jul 06 2023 11:24:59 GMT+0300 (Moscow Standard Time)\n", "import math\nc,n = map(int, input().split())\nout = 1 \nc = min(c,n)\nfor i in range(2,c+1):\n out=out*i\nprint(out)\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\nprint(math.factorial(sorted(list(map(int,input().split( ))))[0]))", "import math\r\nn=map(int, input().split())\r\nprint(math.factorial(min(n)))", "import math\r\n\r\nx, y = map(int,input().split())\r\nif x >= y:\r\n print(math.gcd(math.factorial(y)))\r\nelif y >= x:\r\n print(math.gcd(math.factorial(x)))", "a,b = [int(i) for i in input().split()]\r\nt=min(a,b)\r\nfor i in range(t-1,1,-1):\r\n t*=i\r\nprint(t)", "m,n=map(int,input().split())\ndef fact(n):\n if n==0 or n==1:\n return 1\n else:\n return n*fact(n-1)\ndef gcd(a,b):\n c=min(a,b)\n print(fact(c))\ngcd(m,n)\n\t\t\t\t\t \t\t \t \t\t \t\t \t\t \t\t\t \t", "a,b=map(int,input().split())\r\nc=min(a,b)\r\nr=1\r\nfor i in range(1,c+1):\r\n r=r*i\r\nprint(r)\r\n ", "x,y=map(int,input().split())\nz=min(x,y)\nres=1\nfor i in range(z):\n res*=z\n z-=1\nprint(res)\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\np=min(n,m)\r\nans=1\r\nfor el in range(1,p+1):\r\n ans*=el\r\nprint(ans)", "from math import factorial as f\r\na,b = map(int, input().split())\r\nprint(f(min(a,b)))", "from math import*\r\nx,y=map(int,input().split())\r\nprint(factorial(min(x,y)))", "import math\r\nn,m=map(int, input().split())\r\nprint(math.factorial(min(n,m)))", "\"\"\"\nComo o problema trata a questao do MDC entre dois numeros, e, o fatorial é a sequencia\nmultiplicativa pelo antecessor até o 1, temos que o maximo divisor comum entre dois numeros fatoriais\nsera o menor deles. Visto que o MDC de um numero é ele mesmo, e este, por sua vez, é parte da decomposição\nmultiplicativa do fatorial maior.\n\"\"\"\ndef fatorial(n):\n if n == 0:\n return 1\n return n*fatorial(n-1)\n\nentrada = input().split(\" \")\nmenor = 0\nif int(entrada[0]) > int(entrada[1]):\n menor = int(entrada[1])\nelif int(entrada[0]) <= int(entrada[1]):\n menor = int(entrada[0])\n\nprint(fatorial(menor))", "def factorial(a):\r\n if a==1:\r\n return 1\r\n else:\r\n return a*factorial(a-1)\r\n \r\na,b=map(int,input().split())\r\nif a<b:\r\n print(factorial(a))\r\nelse:\r\n print(factorial(b))\r\n", "\r\nimport math\r\n\r\ndef gcdFact(a,b):\r\n\tmi=min(a,b)\r\n\treturn math.factorial(mi)\r\n\r\nif __name__ == '__main__':\r\n\ta,b=map(int,input().split())\r\n\tprint(gcdFact(a,b))", "def fact(n):\r\n product = 1\r\n for i in range(2,n+1):\r\n product *= i\r\n return product\r\n\r\n# Main\r\nif __name__ == '__main__':\r\n a, b = [int(num) for num in input().split()]\r\n print(fact(min(a,b)))", "def fact(n):\r\n\tif n <= 1:\r\n\t\treturn 1\r\n\telse:\r\n\t\treturn n*fact(n-1)\r\n\t\t\r\na, b = map(int, input().split())\r\nprint(fact(min(a, b)))", "from functools import cache\r\n\r\n@cache\r\ndef fact(n):\r\n # Note1: getting error because of RecursionError \r\n # Note2: Python has a default maximum recursion depth of 1000 \r\n if n == 1:\r\n return 1\r\n else:\r\n return n * fact(n-1)\r\n # total = 1 \r\n # for i in range(1,n+1):\r\n # total *= i \r\n \r\n # return total\r\n\r\n\r\n\r\na, b = map(int, input().split())\r\n\r\nans = fact(min(a,b))\r\nprint(ans)", "from math import factorial\r\na,b=map(int,input().split())\r\nprint(factorial(min(a,b)))\r\n", "def factorial(x):\r\n if x == 0:\r\n return 1\r\n return x*factorial(x-1)\r\na, b = map(int, input().split())\r\nprint(factorial(min(a, b)))", "from fractions import gcd\r\nimport math\r\n\r\nk, p = map(int, input().split())\r\nmini = min(k, p)\r\nm = 1\r\n\r\nfor i in range(mini, 0, -1):\r\n m*=i\r\n\r\nprint(m)", "a, b = map(int, input().split())\r\nm = 2\r\nf = 1\r\nd = min(a,b)\r\nfor i in range(d - 1):\r\n f = f * m\r\n m = m + 1\r\nprint(f)\r\n", "'''\n\nWelcome to GDB Online.\nGDB online is an online compiler and debugger tool for C, C++, Python, Java, PHP, Ruby, Perl,\nC#, VB, Swift, Pascal, Fortran, Haskell, Objective-C, Assembly, HTML, CSS, JS, SQLite, Prolog.\nCode, Compile, Run and Debug online from anywhere in world.\n\n'''\ndef fact(n):\n if n==0 or n==1:\n return 1\n return n*fact(n-1)\n \na,b=map(int,input().split())\nk=min(a,b)\nprint (fact(k))", "a, b = map(int, input().split())\r\na = min(a,b)\r\nc = 1\r\nfor i in range(1, a + 1):\r\n c = c * i\r\nprint(c)\r\n \r\n", "def fac(n):\r\n if n<2:\r\n return 1\r\n return n*fac(n-1)\r\n \r\na,b=(map(int,input().split()))\r\nk=min(a,b)\r\nprint(fac(k))\r\n", "x,y=map(int,input().split())\nif x>0 and min(x,y)<13 and y<(10**9)+1:\n fact=min(x,y)\n gcd=1\n for i in range(2,fact+1):\n gcd=gcd*i\n print(gcd)\n \t \t \t\t \t \t \t\t \t \t\t\t", "s = input().split()\r\na = int(s[0])\r\nb = int(s[1])\r\nmenor = a\r\nif b < menor:\r\n menor = b\r\nr = 1\r\nfor i in range(1,menor+1):\r\n r *= i\r\nprint (r)", "import math\r\na,b=map(int,input().split())\r\nc=math.factorial(min(a,b))\r\nprint(c)", "def l(rom,jul):\r\n b=min(rom,jul)\r\n a=1\r\n for i in range(1,b+1): a=a*i\r\n print(a)\r\nrom,jul=[int(item) for item in input().split(\" \")]\r\nl(rom,jul)", "import math\na,b = map(int,input().split())\nm = min(a,b)\nprint(math.factorial(m))\n\n\n", "import math\r\n\r\n\r\nA, B = map(int, input().split())\r\nprint(math.factorial(min(A, B)))\r\n", "def giaithua(n) :\r\n gt=1\r\n for i in range (1,n+1):\r\n gt=gt*i\r\n return gt \r\na,b=map(int,input().split())\r\nm=min(a,b)\r\nprint(giaithua(m))", "\r\nx,y = map(int,input().split())\r\nf = 1 \r\nfor i in range(2,min(x,y)+1):\r\n f*=i \r\nprint(f)", "def fact(a):\r\n b = 1\r\n for i in range(a):\r\n b *= i+1\r\n return b\r\n\r\na = input().split()\r\nprint(fact(min(int(a[0]), int(a[1]))))", "import math, heapq\r\nfrom sys import stdin\t\r\nfrom collections import Counter, defaultdict, deque, namedtuple\r\nfrom bisect import bisect_right, bisect_left\r\nfrom typing import List, DefaultDict\r\nfrom itertools import permutations\r\n \r\n \r\n \r\ndef readarray(typ):\r\n return list(map(typ, stdin.readline().split()))\r\n\r\n\r\ndef readint():\r\n return int(input())\r\n\r\n\r\na, b = readarray(int)\r\n\r\n\r\nmn = min(a,b)\r\n\r\nans = 1\r\n\r\nfor num in range(1, mn+1):\r\n ans *= num\r\n\r\nprint(ans)\r\n", "a,b=map(int,input().split())\nans=1\nfor i in range(1,min(a,b)+1):\n ans*=i\nprint(ans)\n \t\t\t \t\t \t\t \t\t \t\t \t \t \t\t", "def f(x,y):\r\n a=min(x,y)\r\n for i in range(1,a):\r\n a*=i\r\n return a\r\n\r\n \r\nx,y=(map(int,input().split()))\r\nprint(f(x,y))\r\n", "import math\r\nA,B = input().split()\r\nA = int(A)\r\nB = int(B)\r\nprint(math.factorial(min(A,B)))\r\n", "inp = input()\na, b = inp.split(' ')\na = int(a)\nb = int(b)\n\nif b < a:\n a = b\n\nans = 1\nfor i in range(1, a+1):\n ans *= i\n\nprint(ans)\n \t\t\t\t\t \t \t\t \t\t\t \t \t\t", "a,b = map(int,input().split())\nd = 1\nif a >=b:\n for i in range(2,b+1):\n d*=i\nif b >a:\n for i in range(2,a+1):\n d*=i\nprint(d)\n \n \n# Thu Jul 06 2023 11:49:08 GMT+0300 (Moscow Standard Time)\n", "a,b=[int(i) for i in input().split()]\r\nmi=min(a,b)\r\nres=1\r\nfor i in range(1,mi+1):\r\n res*=i\r\nprint(res)", "import math\r\nn,n1=map(int,input().split())\r\nprint(math.factorial(min(n,n1)))", "a,b = map(int,input().split())\ndef fact(n):\n\tr=1\n\tfor i in range(1,n+1):\n\t\tr = r*i\n\treturn r\nx = min(a,b)\nprint(fact(x))\n \t \t \t\t\t \t\t\t \t\t \t \t\t", "# your code goes here\ndef fact(n):\n\tif n==0 or n==1:\n\t\treturn 1\n\treturn n*fact(n-1)\nm,n = map(int,input().strip().split())\nmn = min(m,n)\nprint(fact(mn))\n\n \t \t \t\t \t\t \t \t", "import math\r\ninp = map(int,input().split())\r\nprint(math.factorial(min(inp)))", "a,b = map(int,input().split())\r\nx = min(a,b)\r\ns = 1\r\nfor i in range(2,x+1):\r\n s*=i\r\nprint(s)", "n = input().split()\r\na = int(n[0])\r\nb = int(n[1])\r\nc = min(a,b)\r\nfakt=1\r\nfor i in range(1,c+1):\r\n fakt *= i\r\nprint(fakt)", "import math \n \nm,number = (int(i) for i in input().split())\ndef gcd(m, number) : \n return math.factorial(min(m, number)) \n\nprint(gcd(m, number)) \n \t\t\t \t \t\t \t\t \t\t \t\t \t\t \t \t", "import math\r\ndef solution():\r\n\tn, m = map(int, input().split())\r\n\tprint(math.factorial(min(n, m)))\r\nsolution()", "import math\nA, B = map(int,input().split())\ns = min(A, B)\nprint(math.factorial(s))\n\t\t \t \t \t\t \t\t\t\t \t\t \t\t \t \t", "a,b=map(int,input().split(\" \"))\r\nans=1\r\nfor j in range(1,min(a,b)+1):\r\n ans*=j\r\nprint(ans)", "il = lambda: map(int, input().split())\r\n\r\ndef f(l):\r\n\to = 1\r\n\twhile l:\r\n\t\to *= l\r\n\t\tl -= 1\r\n\treturn o\r\n\r\nprint(f(min(il())))", "from math import factorial\r\na, b = map(int, input().split())\r\nc = min(a,b)\r\nprint(factorial(c))", "def f(x):\r\n r=1\r\n for i in range(2,x+1):\r\n r*=i\r\n return r\r\na,b=map(int,input().split())\r\nif a<b:\r\n print(f(a))\r\nelse:\r\n print(f(b))", "a, b = map(int, input().split())\r\nk = 1\r\nfor i in range(2, min(a, b) + 1):\r\n k *= i\r\nprint(k)", "def fac(n):\r\n ans=1\r\n for i in range(1,n+1):\r\n ans*=i \r\n return ans\r\na,b=map(int,input().split())\r\nt=min(a,b)\r\nprint(fac(t))", "def fact(a):\r\n if a<2:\r\n return a\r\n else:\r\n return a*fact(a-1)\r\na,b = map(int, input().split())\r\nprint(fact(min(a,b)))", "import math\r\nprint(math.factorial(min(list(map(int,input().split(\" \"))))))\r\n \r\n\r\n \r\n \r\n\r\n", "from math import factorial as f\r\na =min(map(int, input().split()))\r\nprint(f(a))\r\n", "import math\r\na,b=map(int,input().split())\r\nprint(math.factorial(min(a,b)))", "import math\r\n\r\nx, y = list(map(int, input().split()))\r\n\r\nsmaller = min(x, y)\r\n\r\nprint(math.factorial(smaller))", "from math import factorial\r\nprint(factorial(min(map(int, input().split()))))", "import math\r\na=input().split()\r\nx=int(a[0])\r\ny=int(a[1])\r\nn=min(x,y)\r\nprint(math.factorial(n))\r\n", "def fact(a):\r\n prod = 1\r\n while a:\r\n prod *= a\r\n a -= 1\r\n return prod\r\ns = input()\r\ns = s.split()\r\na = []\r\nfor k in s:\r\n a.append((int)(k))\r\n\r\nprint(fact(min(a)))\r\n \r\n\r\n", "import math\r\n\r\nx,y = map(int,input().split())\r\nq = min(x,y)\r\nprint(math.factorial(q))", "import math\r\na = min(map(int,input().split()))\r\nprint(math.factorial(a))", "import math\r\na, b = list(map(int, input().split()))\r\n\r\nminn = min(a, b)\r\n\r\nprint(math.factorial(minn))", "import sys\r\nsys.setrecursionlimit(100000000)\r\ninput=lambda:sys.stdin.readline().strip()\r\nwrite=lambda x:sys.stdout.write(str(x)+'\\n')\r\n\r\ndef get(x):\r\n ans=1\r\n for i in range(1,x+1):\r\n ans*=i\r\n return ans\r\n\r\n\r\na,b=map(int,input().split())\r\nprint(get(min(a,b)))", "s, m = map(int, input().split())\r\nif s > m: s, m = m, s\r\n \r\ndef fact(n):\r\n w = 1\r\n for i in range(1, n+1):\r\n w*=i\r\n return w\r\n\r\nprint(fact(s))", "import math\r\na,b = list(map(int, input().split()))\r\nprint(math.factorial(min(a,b)))", "import math\r\na,b=map(int,input().split())\r\nif(a>b):\r\n print(math.factorial(b))\r\nelse:\r\n print(math.factorial(a))", "a,b=list(map(int,input().split()))\r\nmini=min(a,b)\r\nc=1\r\nwhile(mini>1):\r\n c*=mini\r\n mini-=1\r\nprint(c) ", "A,B=map(int,input().split())\ndef factorial(n):\n if n==0 or n==1:\n return 1\n else:\n return n*factorial(n-1)\ndef Gcd(A,B):\n\tH=min(A,B)\n\tprint(factorial(H))\nGcd(A,B)\n\t\n \t \t\t \t \t\t\t \t\t\t \t \t\t \t", "def fact(x):\r\n if x<=1:\r\n return 1\r\n return x*fact(x-1)\r\nA,B = map(int,input().split())\r\nprint(fact(min(A,B)))\r\n", "from math import factorial\r\na = min(map(int, input().split()));print(factorial(a))", "def fac(x):\r\n if x>1:\r\n return x*fac(x-1)\r\n else:\r\n return x\r\na,b = map(int,input().split())\r\nprint(fac(min(a,b)))", "from math import factorial\na, b = map(int, input().split())\nprint(factorial(min(a, b)))\n\t\t \t\t\t \t \t \t\t \t\t\t \t \t \t \t\t\t", "import math\na, b = map(int, input().split())\nn = a\na = max(a, b)\nb = min(n, b)\nprint(math.factorial(b))\n# Thu Jul 06 2023 11:19:13 GMT+0300 (Moscow Standard Time)\n", "def ff(x):\r\n p=1\r\n for i in range(1,x+1):\r\n p*=i\r\n return p\r\na,b=map(int,input().split())\r\nprint(ff(min(a,b)))", "import math\r\nc,d= map(int,input().split())\r\nf = min(c,d)\r\nm = math.factorial(f)\r\nprint(m)", "a,b=list(map(int,input().split()))\r\nk=min(a,b)\r\nm=1\r\nwhile(k>0):\r\n m*=k\r\n k=k-1\r\nprint(m)", "import math\r\nfrom math import gcd,factorial\r\n\r\nA,B = map(int,input().split())\r\n\r\nprint(math.factorial(min(A,B)))\r\n", "def fact(n):\r\n res=1\r\n if n==0 or n==1:\r\n return 1 \r\n else:\r\n for i in range(1,n+1):\r\n res=res*i\r\n return res\r\n\r\nnums=list(map(int,input().split()))\r\nmini=min(nums)\r\nprint(fact(n=mini))\r\n", "def fact(n):\r\n factorial=1\r\n for i in range(2,n+1):\r\n factorial=factorial*i;\r\n return factorial\r\na,b=map(int,input().split())\r\nif a<b:\r\n print(fact(a))\r\nelse:\r\n print(fact(b))", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-09 00:07:47\nLastEditTime: 2021-11-09 00:09:45\nDescription: I'm bored with life\nFilePath: CF822A.py\n'''\n\n\ndef func():\n a, b = sorted(map(int, input().strip().split()))\n factorial = 1\n for i in range(1, a + 1):\n factorial *= i\n print(factorial)\n\n\nif __name__ == '__main__':\n func()\n ", "from math import factorial\nn,m = list(map(int,input().split()))\nif n>m:\n n = m \nprint(int(factorial(n)))\n \t \t\t\t \t\t \t\t \t \t\t \t \t", "from math import factorial as fac\r\n\r\na, b = map(int, input().split())\r\nprint(fac(min(a,b)))\r\n", "import math \n \nms,num = (int(i) for i in input().split())\ndef gcd(ms, num) : \n return math.factorial(min(ms, num)) \n\nprint(gcd(ms, num)) \n\t \t \t \t\t\t \t \t \t \t\t\t\t", "import math\r\na,b=map(int,input().split())\r\nx=min(a,b)\r\ny=math.factorial(x)\r\nprint(y)\r\n", "\nx = input()\n\ny = x.split(' ')\n\na = int(y[0])\nb = int(y[1])\n\nm = min(a, b)\n\n\ndef factorial(x):\n if (x == 0):\n return 1\n return x * factorial(x - 1)\n\n\nprint(factorial(m))\n\n\t \t \t \t \t\t \t \t \t \t \t\t\t", "lis=list(map(int,input().split()))\nlis.sort()\na=lis[0]\ndef factorial(a):\n fac=1\n if a<0:\n return 0\n elif a==0 or a==1:\n return 1\n else:\n while a>0:\n fac=fac*a\n a=a-1\n return fac\nprint(factorial(a)) \n\n \t \t\t\t \t \t \t \t\t \t", "import math\nm,n=map(int,input().split())\nb=min(m,n)\nprint(math.factorial(b))\n#jjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjj\n\t\t \t \t\t \t\t\t \t \t\t \t\t \t\t \t", "import sys\ndef get_ints():return map(int,sys.stdin.readline().strip().split())\na,b=get_ints()\nfact=1\nfor i in range(2,min(a,b)+1):\n fact*=i\nprint(fact)\n\n \t \t \t\t\t\t\t \t \t\t \t\t\t\t\t \t\t \t\t", "import math\r\na,b=map(int,input().split())\r\nd=min(a,b)\r\nprint(math.factorial(d))", "from math import factorial as f\r\nimport sys\r\n\r\na,b=map(int,sys.stdin.readline().split())\r\nsys.stdout.write(str(f(min(a, b)))+'\\n')", "# LUOGU_RID: 113733091\na=min(map(int,input().split()))\nr=1\nfor i in range(2,a+1):\n r*=i\nprint(r)", "a,b=map(int,input().split())\nc=min(a,b)\ngcd=1\nfor i in range(1,c+1):\n gcd=gcd*i\nprint(gcd)\n\n \t \t\t\t \t \t \t\t\t\t\t \t \t \t", "a,b = map(int,input().split())\nm = min(a,b)\ns = 1\nfor i in range(2,m+1):\n s = s*i\nprint (s)\n \t\t\t \t \t \t\t\t \t\t\t\t \t\t\t \t \t \t", "a, b = map(int, input().split())\nif a < b:\n c = 1\n for i in range(1, a+1):\n c *= i\nelse:\n c = 1\n for i in range(1, b+1):\n c *= i\nprint(c)\n", "import math\r\na,b = map(int,input().split())\r\nfactorial_min = math.factorial(min(a,b))\r\nprint(factorial_min)\r\n", "import math\r\nA,B=map(int,input().split())\r\nx=min(A,B)\r\nprint(math.factorial(x))", "import math \r\ndef diproshanhaver(a,b):\r\n f=min(a,b)\r\n x=1\r\n for j in range(2,f+1):\r\n x*=j\r\n return x\r\ns=input()\r\nalist=[int(d) for d in s.split()]\r\nprint(diproshanhaver(alist[0],alist[1]))", "x,y = map(int, input().split())\r\nres = 1\r\nfor x in range(1,min(x,y)+1):\r\n res = res * x\r\n\r\nprint(res)", "a,b=(map(int,input().split()))\r\nmn=min(a,b)\r\nt=1\r\nfor i in range(1,mn+1):\r\n t*=i\r\nprint(t)\r\n \r\n \r\n \r\n \r\n ", "a,b = map(int,input().split())\r\nc = min(a,b)\r\n\r\ndef fac(n) :\r\n if n==1 :\r\n return 1\r\n else :\r\n return n*fac(n-1)\r\nprint(fac(c))\r\n", "import collections\r\nfrom math import factorial\r\nfrom collections import *\r\nfrom itertools import permutations\r\nmod = 1000000007\r\ndef main():\r\n a,b = map(int, input().split())\r\n print(factorial(min(a,b)))\r\n\r\n # test = int(input())\r\n # for _ in range(test):\r\n # n = int(input())\r\n # print(2, n-1)\r\nif __name__ == \"__main__\":\r\n main()", "import math\r\ndef sol(a,b):\r\n f=math.factorial(min(a,b))\r\n return f\r\na,b=map(int,input().split())\r\nprint(sol(a,b))", "import math \n \nm,n = (int(x) for x in input().split())\ndef gcdOfFactorial(m, n) : \n return math.factorial(min(m, n)) \n\nprint(gcdOfFactorial(m, n)) \n\t \t\t \t\t \t\t \t \t \t\t \t \t \t\t", "a,b = map(int,input().split())\na = min(a,b)\ndef fact(a):\n f = 1\n while a >= 1:\n f *= a\n a -= 1\n return f\n \nprint(fact(a))\n\t\t \t\t\t \t\t\t \t\t \t \t\t\t\t \t\t\t\t", "inp = list(map(int, input().split()))\na=inp[0]\nb=inp[1]\nr=1 \nx=a \nif x>b:\n x=b \nfor i in range(1,x+1):\n r=r*i \nprint(r)\n\t \t \t\t \t\t \t\t \t\t\t\t\t \t \t \t\t\t\t", "import math \nm,n = (int(x) for x in input().split())\ndef gof(m, n) : \n return math.factorial(min(m, n)) \nprint(gof(m, n)) \n\t \t \t \t \t\t \t \t\t\t\t \t\t\t\t \t \t\t\t", "x,y=map(int,input().split())\nf=1\nfact=1\nif(x>y):\n\tfor i in range(1,y+1):\n\t\tfact=fact*i\n\tprint(fact)\nelse:\n\tfor i in range(1,x+1):\n\t\tf=f*i\n\tprint(f)\n \t \t \t\t\t \t\t \t \t \t\t", "# your code goes here\nimport math\ndef factGCD(a,r):\n\treturn math.factorial(min(a,r))\na,r=map(int,input().split())\nprint(factGCD(a,r))\n \t\t \t \t\t\t\t \t \t\t \t\t \t", "import math\nA,B = map(int,input().split( ))\nC = min(A,B)\nprint(math.factorial(C))\n \t \t \t \t\t\t\t \t \t \t \t\t \t\t\t\t\t \t", "x,y=map(int,input().split())\r\nmin1=min(x,y)\r\nf=1\r\nwhile min1>0:\r\n f*=min1\r\n min1-=1\r\nprint(f)", "x,y=map(int,input().split())\ndef fact(n):\n l=[0]*(n+1)\n l[0]=1\n l[1]=1\n for i in range(2,n+1):\n l[i]=i*l[i-1]\n return l[n]\nprint(fact(min(x,y)))\n\n\t\t\t \t \t\t\t\t\t \t\t \t \t\t \t", "def fact(A):\r\n t = 1\r\n\r\n while A > 1:\r\n t *= A\r\n A -= 1\r\n\r\n return t\r\n\r\nA, B = map(int, input().split())\r\n\r\nif A == B:\r\n print(fact(A))\r\nelif A > B:\r\n print(fact(B))\r\nelse:\r\n print(fact(A))", "from math import factorial\r\na,b = map(int,input().split())\r\nc = min(a,b)\r\nd = factorial(c)\r\nprint(d)\r\n", "import math\na,b =map(int, input().split())\nprint(math.factorial(min(a, b)))", "arr = [int(num) for num in input().split()]\nval = min(arr)\nfact = 1\n\nfor i in range(1, val+1):\n fact = fact*i\n\nprint(fact)\n", "a,b = map(int,input().split())\nm = min(a,b)\nf = 1\nfor i in range(1,m+1):\n f = f * i\nprint(f)\n \t \t \t\t \t \t \t \t \t\t", "a,b=map(int,input().split())\ns=min(a,b)\nans=1\nfor i in range(1,s+1):\n ans=ans*i \nprint(ans)\n \t \t\t\t \t \t \t\t\t \t \t \t\t\t \t \t", "def fac(n):\r\n if n == 1:\r\n return 1 \r\n else :\r\n return n* fac(n-1)\r\nx,y= map(int,input().split())\r\nprint(fac(min(x,y)))", "from math import *\r\na,b=map(int,input().split())\r\nprint(factorial(min(a,b)))", "from math import factorial\r\na, b=[int(k) for k in input().split()]\r\nprint(factorial(min(a, b)))", "a = (input().split())\nb = int(a[0])\nc = int(a[1])\nmultiply = 1\nfor i in range(1,min(b,c)+1,1):\n multiply*=i\nprint(multiply)\n", "import math\r\na,b=[int(x) for x in input().split()]\r\nprint(math.factorial(min(a,b)))", "n,m = list(map(int,input().split()))\r\na = 1\r\nb = 1 \r\nfor i in range(2,(min(n,m))+1):\r\n a *= i \r\nprint(a)", "a, b = [int(i) for i in input().split()]\r\nq = min(a, b)\r\nans = 1\r\nfor i in range(1, q + 1):\r\n\tans *= i\r\nprint(ans)", "a, b = list(map(int, input().split()))\r\nm = min(a,b)\r\nans = 1\r\nfor i in range(1, m+1):\r\n ans *= i\r\nprint(ans)", "import math\r\nn,a = map(int,input().split())\r\nprint(math.factorial(min(n,a)))", "def factorial(nt):\n return 1 if (nt==1 or nt==0) else nt * factorial(nt- 1)\nax,bx=map(int,input().split())\nc=min(ax,bx)\nd=factorial(c)\nprint(d)\n\t \t \t \t\t\t\t\t \t \t \t\t \t \t\t \t\t", "# cook your dish here\r\nfrom math import *\r\na,b=map(int,input().split())\r\nprint(factorial(min(a,b)))", "def fun():\r\n a,b = map(int,input().split())\r\n t = min(a,b)\r\n for i in range(1,t): t*=i\r\n print(t)\r\n \r\nfun()", "def fact(num):\r\n ans = 1\r\n while num != 1:\r\n ans *= num\r\n num -= 1\r\n return ans\r\n \r\nvalue = min(list(map(int, input().split())))\r\nprint (fact(value))", "a, b = map(int, input().split())\ndef gcd_fact(a, b):\n return fact(min(a, b))\ndef fact(n):\n if(n == 0):\n return 1\n else:\n return n * fact(n - 1)\nprint(gcd_fact(a, b))\n \t \t\t\t\t\t\t \t\t\t\t\t\t \t", "q,w=map(int,input().split())\r\ne=min(q,w)\r\nr=2\r\nfor i in range(r,e):\r\n e*=i\r\nprint(e)\r\n", "a,b=map(int,input().split())\r\nans=1\r\nm=min(a,b)\r\nfor i in range(1,m+1):\r\n\tans*=i\r\nprint(ans)", "import math\ninp = list(map(int, input().split()))\na=inp[0]\nb=inp[1]\nm=min(a,b)\nprint(math.factorial(m))\n\t\t\t\t\t\t \t\t \t\t \t\t\t\t \t\t\t \t", "import math\r\nx = input().split()\r\na = min(int(x[0]),int(x[1]))\r\nprint(math.factorial(a))", "a,b =map(int,input().split())\nl=min(a,b)\ns=1\nfor i in range(1,l+1):\n s=s*i\nprint(s) \n \t \t\t \t\t \t\t \t \t\t\t\t \t \t\t", "#code\r\np,q = map(int,input().split())\r\nans = 1 \r\nm = min(p,q)\r\nfor i in range(1,m+1):\r\n ans*=i\r\nprint(ans)", "a,b=map(int,input().split())\ndef factorial(n):\n\tif(n==0):\n\t\treturn 1\n\telif(n==1):\n\t\treturn 1\n\telse:\n\t\treturn n*factorial(n-1)\nif(a<b):\n\tprint(factorial(a))\nelse:\n\tprint(factorial(b))\n \t\t \t \t\t \t\t\t \t \t \t\t \t\t\t", "import math\na,b=map(int,input().split())\nx=min(a,b)\nprint(math.factorial(x))\n \t \t\t \t \t \t\t \t \t\t\t \t \t\t", "import math\r\n \r\ndef gcdOfFactorial(m, n) :\r\n return math.factorial(min(m, n))\r\na, b = map(int, input().split())\r\nprint(gcdOfFactorial(a,b))", "def factmin(a,b):\r\n c=min(a,b)\r\n fact=1\r\n for i in range(1,c+1):\r\n fact=fact*i\r\n print(fact)\r\na,b=[int(item) for item in input().split(\" \")]\r\nfactmin(a,b)", "a, b = map(int, input().split(' '))\r\nif a == b or a < b:\r\n print(eval('*'.join(list(map(str, range(1, a+1))))))\r\nelif a > b:\r\n print(eval('*'.join(list(map(str, range(1, b+1))))))", "a,b = map(int,input().split())\r\nm = min(a,b)\r\ns = 1\r\nfor i in range(2,m+1):\r\n s = s*i\r\nprint (s)", "a,b = list(map(int,input().split()))\r\nimport math\r\nprint(math.factorial(min(a,b)))", "import math\ndef bored(n, m):\n return math.factorial(min(n, m))\n\nif __name__ == '__main__':\n n, m = map(int, input().split())\n print(bored(n, m))\n \t\t\t\t \t\t \t\t \t \t \t\t\t \t\t \t", "\r\n\r\nvalues = [int(e) for e in input().split(\" \")]\r\n\r\nx = min(values)\r\n# return factorial of the min between a, b\r\n\r\nval = 1\r\nfor n in range(1, x+1):\r\n val *= n\r\n\r\nprint(val)\r\n\r\n\r\n\r\n", "a,b=map(int,input().split())\r\na = min(a,b)\r\nans=1\r\nwhile(a>0):\r\n\tans = ans*a\r\n\ta-=1\r\nprint(ans)", "from math import *\r\na,b=map(int,input().split())\r\nc=1\r\nfor i in range(1,min(a,b)+1):\r\n c*=i\r\n \r\nprint(c)\r\n\r\n\r\n", "import math\ndef factGCD(m,n):\n\treturn math.factorial(min(m,n))\nm,n=map(int,input().split())\nprint(factGCD(m,n))\n\t\t \t \t \t\t \t \t\t\t\t\t \t\t\t", "a,b=map(int,input().split())\ns=min(a,b)\nres=1\nfor i in range(1,s+1):\n res=res*i\nprint(res)\n\t\t \t\t \t\t\t \t \t \t\t\t\t", "from sys import stdin\na,b=map(int,stdin.readline().split())\nif(min(a,b)==1):\n print(1)\nelse:\n mul=1\n for i in range(1,min(a,b)+1):\n mul=mul*i\n print(mul) \n \t\t\t \t \t\t\t \t \t \t \t \t", "A,B = map(int,input().split())\r\nres = 1\r\nfor i in range(1,min(A,B)+1):\r\n res *= i\r\nprint(res)", "import math\r\na,b=list(map(int,input().rstrip().split()))\r\nmi=min(a,b)\r\nprint(math.factorial(mi))", "num_li = list(map(int, input().split(' ')))\r\na = num_li[0]\r\nb = num_li[1]\r\nx = a\r\ngcd = 1\r\nif b < x:\r\n x = b\r\nfor i in range (1, x+1):\r\n gcd *= i\r\nprint(gcd)\r\n", "import math\na, b = [int(x) for x in input().split()]\nprint(math.factorial(min(a, b)))\n# Thu Jul 06 2023 23:11:48 GMT+0300 (Moscow Standard Time)\n\n# Thu Jul 06 2023 23:11:53 GMT+0300 (Moscow Standard Time)\n", "import math\nd,m = map(int, input().split())\nout = 1 \nd = min(d,m)\nfor i in range(2,d+1):\n out=out*i\nprint(out)\n\t\t\t \t\t \t\t\t\t \t \t\t \t\t\t \t\t \t\t", "from math import factorial\r\n\r\nA, B = (int(_) for _ in input().split())\r\nif A > B:\r\n A, B = B, A\r\nprint(factorial(A))", "a,b = map(int, input().split(\" \"))\r\n\r\ngcd = 1\r\n\r\nif a > b:\r\n for i in range(1,b+1):\r\n gcd *= i\r\n\r\nelse:\r\n for i in range(1,a+1):\r\n gcd *= i\r\n\r\nprint(gcd)", "from fractions import gcd\r\nimport math\r\n \r\nx = 1\r\nl, n = map(int, input().split())\r\nmin = min(l, n)\r\n\r\nfor i in range(min, 0, -1):\r\n x*=i\r\n \r\nprint(x)", "a, b = map(int, input().split())\r\nout = 1\r\nif a > b:\r\n \r\n for i in range(1,b+1):\r\n out = out * i\r\n \r\nelse:\r\n \r\n for i in range(1,a+1):\r\n out = out * i\r\n \r\nprint(out)", "from math import factorial as f\r\n\r\n\r\na, b = map(int, input().split())\r\nprint(f(min(a, b)))\r\n", "A,B=map(int,input().split())\ns=min(A,B)\nc=1\nfor i in range(2,s+1):\n c=c*i\nprint(c)\n\t \t\t\t \t \t\t \t\t \t\t \t\t\t \t\t", "from math import factorial\r\nx = min(map(int, input().split()))\r\nprint(factorial(x))", "from math import factorial as fct\r\nn, m = map(int, input().split())\r\nprint(fct(min(n, m)))", "l=list(map(int,input().split()))\nm=l[0]\nn=l[1]\nfact=1\ngcda=0\ngcdb=0\np=min(m,n)\nfor i in range(1,p+1):\n fact=fact*i\n \n \n\nprint(fact)\n \n \t\t \t \t \t\t\t \t \t\t \t\t\t\t \t\t \t\t", "import math\r\n\r\na, b = map(int, input().split())\r\nm = min(a, b)\r\na2 = math.factorial(m)\r\nprint(a2)\r\n", "a, b = map(int, input().split())\r\nmin_number = min(a, b)\r\nmin_factorial = 1\r\nfor i in range(2, min_number + 1):\r\n min_factorial *= i\r\nprint(min_factorial)", "import math \ndef fact(m, n) : \n return math.factorial(min(m, n))\nm,n = (int(x) for x in input().split())\nprint(fact(m, n)) \n\t\t\t \t \t \t \t \t\t\t", "import math\r\ndef I_am_board_with_life():\r\n inp = input().split()\r\n c=[]\r\n for i in inp:\r\n c.append(int(i))\r\n minn = min(c)\r\n f=1\r\n for j in range(1,minn+1):\r\n f*=j\r\n print(f)\r\nI_am_board_with_life()", "num1, num2 = map(int, input().split())\r\nmin_num = min(num1, num2)\r\nfactorial_num = 1\r\nfor i in range(1,min_num+1):\r\n\tfactorial_num = factorial_num * i\r\n\t#print(factorial_num)\r\nprint(factorial_num)", "from math import factorial as f\r\na, b = map(int, input().split())\r\nprint(f(min(a, b)))", "\r\n\r\n\r\na,b = map(int,input().split())\r\ns = 1\r\nif a >= b:\r\n\r\n for i in range(1,b + 1):\r\n s *= i\r\n\r\nelse:\r\n for i in range(1,a + 1):\r\n s *= i\r\n\r\n\r\n\r\n\r\nprint(s)", "# 코드포스 822A I'm bored with life\r\nimport sys\r\nfrom math import factorial\r\nput = sys.stdin.readline\r\n\r\nA, B = map(int, put().split())\r\ngcd = factorial(min(A, B))\r\n\r\nprint(gcd)", "import math\r\na,b=map(int,input().split())\r\nc=min(a,b)\r\nfac=1 \r\nwhile(c>0):\r\n fac*=c \r\n c-=1 \r\nprint(fac)", "a,b=map(int,input().split())\r\nx=min(a,b)\r\nr=1\r\nfor i in range(2,x+1):\r\n r *= i\r\nprint(r) \r\n", "def fact(s):\r\n if s <= 1: return 1\r\n return fact(s-1)*s\r\n \r\nX, Y = (int(k) for k in input().split())\r\nprint(fact(min(X, Y)))", "a,b = map(int,input().split())\r\nf = min(a,b)\r\nk = 1\r\nwhile f>1:\r\n k = f*k\r\n f-=1\r\n\r\nprint(k)", "# https://codeforces.com/problemset/problem/822/A\r\n\r\nimport sys, math\r\n\r\ndef get_intl(): \r\n \"\"\"Returns a list of integer from stdin\"\"\"\r\n return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_int(): \r\n \"\"\"Returns an integer from stdin\"\"\"\r\n return int(sys.stdin.readline().strip())\r\ndef get_strl(): \r\n \"\"\"Returns a list of strings from stdin\"\"\"\r\n return sys.stdin.readline().strip().split()\r\ndef get_str(): \r\n \"\"\"Returns a string from stdin\"\"\"\r\n return sys.stdin.readline().strip()\r\ndef prt(msg=\"\"):\r\n \"\"\"print function using sys.stdout\"\"\"\r\n if (isinstance(msg, list)):\r\n sys.stdout.write(\" \".join(map(str, msg)) + \"\\n\")\r\n else:\r\n sys.stdout.write(str(msg) + \"\\n\")\r\n\r\nsys.setrecursionlimit(100000000)\r\nMOD = 998244353\r\n\r\ndef solve():\r\n arr = get_intl()\r\n n = arr[0]\r\n m = arr[1]\r\n minEl = min(n, m)\r\n ans = 1\r\n for i in range(1, minEl + 1):\r\n ans = (ans * i) % MOD\r\n prt(ans)\r\n\r\ndef main():\r\n haveTestCases = 0 # change accordingly\r\n testCase = 1\r\n if (haveTestCases):\r\n testCase = get_int()\r\n\r\n for i in range(testCase):\r\n solve()\r\n\r\nmain()", "from math import factorial\r\n\r\nprint(factorial(min(map(int, input().split()))))\r\n", "def f():\r\n a,b=list(map(int,input().split(\" \")))\r\n mini=min(a,b)\r\n ans=1\r\n for i in range(2,mini+1):\r\n ans=ans*i\r\n print(ans)\r\n\r\nf()\r\n", "import math\r\na, b = map(int, input().split())\r\nfact = min(a,b)\r\nprint(math.factorial(fact))", "import math\nA,B=map(int,input().split())\nc=min(A,B)\nprint(math.factorial(c))\n\t \t \t\t\t \t \t \t \t\t\t\t\t \t\t\t", "m1,n1=map(int,input().split())\nx1=min(m1,n1)\nans=1\nfor i in range(1,x1+1):\n\tans=ans*i\nprint(ans)\n \t\t \t \t \t\t \t\t \t \t", "x,y= map(int,input().split())\r\ndef fact(x):\r\n if(x==0 or x==1):\r\n return 1\r\n else:\r\n return x*fact(x-1)\r\nprint(fact(min(x,y)))", "import math\r\n\r\ndef func(A, B):\r\n gcd = math.factorial(min(A, B))\r\n return gcd\r\n\r\nA, B = map(int, input().split())\r\n\r\nresult = func(A, B)\r\nprint(result)\r\n", "#822A\r\nm,n=sorted(map(int,input().split()))\r\ns=1\r\nfor i in range(1,m+1):\r\n s*=i\r\nprint(s)\r\n", "import math\r\nprint (math.factorial(min(map(int, input().split()))))", "A,B=map(int,input().split())\nm=min(A,B)\nres=1 \nfor i in range(1,m+1):\n res*=i\nprint(res)\n\n\t \t \t \t \t \t \t\t \t \t \t\t\t\t\t", "import math\r\na,b= map(int, input().split())\r\nprint(math.factorial(min(a,b)))", "import math\r\nx, y = input().split(\" \")\r\nprint(math.factorial(min(int(x), int(y))))\r\n", "a, b = map(int, input().split())\r\n\r\nresult = 1\r\n\r\ni = 1\r\nwhile i <= min(a, b):\r\n result *= i\r\n i += 1\r\n\r\nprint(result)", "import math\nimport sys\nx,y=sys.stdin.readline().split()\na=int(x)\nb=int(y)\ni=min(a,b)\nsys.stdout.write(str(math.factorial(i)))\n\t \t \t \t\t \t\t\t\t\t\t \t \t\t \t\t", "def solve(x,y):\r\n ans=1\r\n for i in range(1,min(x,y)+1):\r\n ans*=i\r\n return ans\r\n\r\nimport sys\r\nx,y= map(int, sys.stdin.readline().split())\r\nprint(solve(x,y))", "import math\na=list(map(int,input().split()))\n#b=math.factorial(a[0])\n#c=math.factorial(a[1])\n'''while b%c!=0:\n d=b%c\n c=b\n b=d\nprint(math.factorial(8))'''\nif a[0]>a[1]:\n print(math.factorial(a[1]))\n\nelse:\n print(math.factorial(a[0]))\n \n \t \t \t\t\t \t \t \t\t \t\t \t\t\t \t\t", "print(__import__('math').factorial(min(map(int, input().split()))))", "a,b=map(int,input().split())\nc=min(a,b)\nans=1\nfor i in range(1,c+1):\n\tans=ans*i\nprint(ans)\n\n\t\t\t \t \t \t \t \t\t \t\t \t\t \t", "a,b=map(int,input(\"\").split())\r\nt=1\r\nfor i in range (1,min(b,a)+1):\r\n t*=i\r\nprint(t)", "def factorial(y):\r\n if y==0 or y==1:\r\n return 1\r\n else:\r\n return y*(factorial(y-1))\r\n\r\n \r\nt=list(map(int,input().split()))\r\ny=min(t)\r\nfact=factorial(y)\r\nprint(fact)", "def fact(n : int):\n f = 1\n for i in range(2,n+1):\n f *= i\n return f\n\ndef gfd(a : int, b : int) -> int:\n return fact(min(a,b))\n\na,b = list(map(int,input().split(' ')))\nprint(gfd(a,b))\n\n\n\n\n\n\n\n\n\n\n\n", "a=list(map(int,input().split()))\np=min(a)\nk=1\nwhile p>1:\n\tk=k*p\n\tp=p-1\nprint(k)\n\t\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())\nn=min(a, b)\nfac=1 \nfor i in range(1, n+1):\n fac*=i \nprint(fac)\n# Thu Jul 06 2023 11:51:27 GMT+0300 (Moscow Standard Time)\n", "a, b = map(int, input().split())\n\nt = min(a, b)\nmul = 1\nfor i in range(1, t+1):\n mul*=i\nprint(mul)\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\n\r\nn = min(a,b)\r\n\r\n# calculate n factorial\r\n\r\nans = 1\r\n\r\nfor i in range(1,n+1):\r\n ans = ans*i\r\n # multiply by the next number, then replace ans\r\n \r\nprint(ans)", "def f(a,b):\r\n import math\r\n m=min(a,b)\r\n return math.factorial(m)\r\n \r\na,b=map(int,input().split())\r\nprint(f(a,b))", "num1, num2 = map(int, input().split())\r\n\r\n\r\ndef factorial(num):\r\n if num == 0:\r\n return 1\r\n else:\r\n return num * factorial(num - 1)\r\n\r\n\r\nprint(factorial(min(num1, num2)))\r\n", "a,b = map(int,input().split())\r\ns=1\r\nn = min(a,b)\r\nfor i in range(1,n+1):\r\n s = s*i\r\nprint(s)", "a, b = input().split()\r\ns = 1\r\nfor i in range(1, min(int(a), int(b)) + 1):\r\n s *= i\r\n\r\nprint(s)\r\n", "import math\r\nm,n=map(int,input().split())\r\nb=min(m,n)\r\nprint(math.factorial(b))\r\n#hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh", "a, b = map(int, input().split())\nl=min(a,b)\ns=1\nfor i in range(1,l+1):\n s = s*i\nprint(s)\n\n\n \t\t \t \t \t \t \t\t \t \t \t\t", "a,b=map(int,input().split())\r\nimport math\r\nif a<=b:\r\n print(math.factorial(a))\r\nelse:\r\n print(math.factorial(b))", "import math as m\r\na,b=map(int,input().split())\r\ny=min(a,b)\r\nx=1\r\nfor i in range(1,y+1):\r\n x=x*i\r\nprint(x)\r\n \r\n ", "import math\r\na,b = input().split()\r\na = int(a);b = int(b)\r\nc = min(a,b)\r\nprint(math.factorial(c))\r\n", "a,b=map(int,input().split())\nc=min(a,b)\nd=1\nfor i in range(1,c+1):\n d=d*i\nprint(d)\n\n \t \t\t \t \t\t \t \t \t \t\t\t \t", "a, b = map(int, input().split())\r\nn = min(a, b)\r\nk = 1\r\nfor i in range(1, n + 1):\r\n k *= i\r\nprint(k)\r\n\r\n", "import math\n\na,b = map(int,input().split())\nout = 1 \na = min(a,b)\nfor i in range(2,a+1):\n out = out*i\nprint(out)\n \t \t \t \t\t\t\t \t \t\t \t \t\t \t", "import math\r\n\r\nprint(math.factorial(min((int(i) for i in input().split()))))", "m,n=map(int, input().split())\nif (m>n):\n\tprod=1\n\tfor i in range(1,n+1):\n\t\tprod=prod*i\n\tprint(prod)\nelse:\n\tpro=1\n\tfor j in range(1,m+1):\n\t\tpro=pro*j\n\tprint(pro)\n \t\t \t \t\t \t \t\t\t\t \t \t \t \t\t", "import sys, math\nx,y = sys.stdin.readline().split()\nsys.stdout.write(str(math.factorial(min(int(x), int(y)))))\n \t\t \t \t\t\t \t\t \t\t\t\t \t\t \t \t", "from math import *\na,b=map(int,input().split())\nmini=min(a,b)\nprint(factorial(mini))\n\t \t \t\t\t \t\t\t \t\t \t \t\t \t\t", "a,b=[int(i) for i in input().split()]\r\ns=1\r\nif a!=b:\r\n d=min(a,b)\r\n while d!=1:\r\n s=s*d\r\n d-=1\r\n print(s)\r\nelif a==b:\r\n while a!=1:\r\n s=s*a\r\n a-=1\r\n print(s)", "import sys\nimport math \nx,y=map(int,sys.stdin.readline().split())\nn=min(x,y)\nsys.stdout.write(str(math.factorial(n)))\n\t\t \t\t\t\t \t\t \t\t\t \t\t\t \t \t", "a,b=map(int,input(\"\").split())\nf1=1\nf=0\nif(a<=b):\n f=a\nelse:\n f=b\nfor i in range(2,f+1):\n f1*=i\nprint(f1)\n \n\t\t\t\t\t \t \t \t\t \t \t \t\t\t \t \t\t\t", "a,b=map(int,input().split())\r\nans=1\r\nfor i in range(1,min(a,b)+1):\r\n ans*=i\r\nprint(ans)", "from math import factorial\r\na=map(int,input().split())\r\nprint(factorial(min(a)))", "a,b=map(int,input().split())\r\nx=[1]\r\ny=[x.append(i*x[-1])for i in range(2,min(a,b)+1)]\r\nprint(x[-1])", "p,q=map(int,input().split())\na=min(p,q)\nr=1\nfor i in range(1,a+1):\n r=r*i\nprint(r)\n \t\t \t\t\t \t\t \t \t\t \t\t\t\t\t \t \t\t", "import math\r\na,b = input().split()\r\na1 = int(a)\r\na2 = int(b)\r\nprint(math.factorial(min(a1,a2)))", "\r\ndef factorial(n):\r\n i = 1\r\n for j in range(2, n+1):\r\n i *= j\r\n print(i)\r\n\r\na, b = [int(i) for i in input().split()]\r\nfactorial(min(a, b))", "n = [int(x) for x in input().split()]\nn.sort()\nfactorial = 1\nfor i in range(1, n[0] + 1):\n factorial = factorial * i\nprint(factorial)", "#!/usr/bin/env python\r\n\r\nimport math, sys, itertools\r\n\r\nif __name__ == '__main__':\r\n\twtf = sys.stdin.read()\r\n\twtf = wtf.strip().split('\\n')\r\n\tA, B = map(int, wtf[0].split())\r\n\tprint(math.factorial(min(A, B)))", "import math \np,n = (int(x) for x in input().split())\ndef gof(p, n) : \n return math.factorial(min(p, n)) \nprint(gof(p, n)) \n\t \t\t \t \t \t\t\t\t \t \t \t\t", "def fact(n):\n\tif(n==1 or n==0):\n\t\treturn 1\n\telse:\n\t\treturn n*fact(n-1)\nn1,n2=input().split()\nprint(fact(min(int(n1),int(n2))))\n \t \t \t \t \t\t\t \t\t\t\t\t\t", "from sys import stdin, stdout\nm,n = map(int,stdin.readline().strip().split())\nx=min(n,m);\nk=1;\nwhile(x>0):\n k*=x;\n x -= 1\nstdout.write(str(k))\n \t\t\t\t \t\t \t \t \t \t", "def factorial(n):\r\n if n == 1 or n == 0:\r\n return 1\r\n else:\r\n return n * factorial(n - 1)\r\n\r\n\r\nnum = input(\"\").split()\r\nprint(factorial(min(int(num[0]), int(num[1]))))\r\n", "# from math import gcd, sqrt, \r\nfrom math import factorial as fact\r\n\r\n# def findD(a):\r\n # sq = int(sqrt(a))\r\n # d = []\r\n # for i in range(1, sq):\r\n # if a % i == 0:\r\n # d.append(i)\r\n # d.append(a // i)\r\n # return d\r\n \r\na, b = map(int, input().split())\r\na= min(a, b)\r\nprint(fact(a))\r\n#nod = gcd(a, b)\r\n#answer = ( min( a // nod, b//nod) ) * nod\r\n# da = findD(a)\r\n# db = findD(b) \r\n# multDA = 1\r\n# multDB = 1\r\n# for i in range(len(da)):\r\n # multDA = multDA * i\r\n# for i in range\r\n # multDB = multDB * i\r\n \r\n#nod = gcd(a, b)\r\n\r\n#a = fact(a)\r\n#b = fact(b)\r\n\r\n#print(gcd(a, b))\r\n\r\n", "a, b = map(int, input().split())\nmin_num = min(a,b)\nfact_num = 1\nfor i in range(1, min_num+1):\n fact_num = fact_num * i\nprint(fact_num)\n \t\t \t\t\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, b = map(int, input().split())\r\nans = 1\r\nfor i in range(1, min(a, b) + 1):\r\n ans *= i\r\nprint(ans)", "from fractions import gcd\r\nimport math\r\n\r\na, b = map(int, input().split())\r\nmini = min(a, b)\r\nx = 1\r\n\r\nfor i in range(mini, 0, -1):\r\n x*=i\r\n\r\nprint(x)", "import math\r\na,b=map(int,input().split())\r\ns=math.factorial(min(a,b))\r\nprint(s)", "import math\ndef gcdFacto(m, n) :\n\treturn math.factorial(min(m, n))\n\nm,n=map(int, input().split())\nprint(gcdFacto(m, n))\n\n\t\t\t\t \t \t \t \t\t \t \t \t \t\t \t", "def f(x):\r\n if x == 0:\r\n return 1\r\n return x * f(x - 1)\r\n\r\na, b = map(int, input().split())\r\nprint(f(min(a, b)))", "from sys import stdin\r\nfrom math import factorial\r\n\r\nA,B = list(map(int, stdin.readline().split(' ')))\r\nprint(factorial(min(A,B)))", "import math\r\ndef factorial(n):\r\n if n == 0 or n == 1:\r\n return 1\r\n else:\r\n return n * factorial(n-1)\r\nx, y = [int(p) for p in input().split()]\r\na = factorial(min(x, y))\r\nprint(a)", "import math\r\n\r\nm,c=map(int,input().split())\r\nprint(math.factorial(min(m,c)))", "#@sorcerer_21\r\nfrom collections import *\r\nimport sys,math\r\ninput=lambda:sys.stdin.readline().strip()\r\nmapin=lambda:map(int,input().split())\r\ndef fac(n):\r\n if n==0:return 1\r\n return n*fac(n-1)\r\nfor _ in range(1):\r\n a,b=mapin()\r\n print(fac(min(a,b)))", "# your code goes here\ndef fact(x):\n\tif x==1 or x == 0:\n\t\treturn 1\n\telse:\n\t\treturn x*fact(x-1)\nA, B = map(int,input().split())\nprint(fact(min(A,B)))\n \t\t\t \t \t\t\t\t\t\t\t\t\t\t\t \t \t\t \t \t", "a,b = map(int, input().split())\r\nmn = min(a,b)\r\n\r\n\r\ndef fact(mn):\r\n if mn==1:\r\n return mn\r\n return mn*fact(mn-1)\r\n \r\nprint(fact(mn))\r\n", "def fact(n):\n if(n==0):\n return 1\n return n*fact(n-1)\na,b=list(map(int,input().split()))\nif(a>b):\n print(fact(b))\nelse:\n print(fact(a))\n \n \t \t \t\t\t \t \t \t\t \t\t\t\t\t \t \t", "from math import factorial\r\n\r\n\r\na, b = list(map(int, input().split()))\r\nif a > b:\r\n a = b\r\n\r\nprint(factorial(a))\r\n", "import math\r\nA,B=list(map(int,input().split()))\r\n\r\nif A>B:\r\n print(math.factorial(B))\r\nelif A==B:\r\n print(math.factorial(A))\r\nelse:\r\n print(math.factorial(A))", "import sys\r\nfrom math import factorial\r\n\r\ninput = sys.stdin.readline\r\noutput = sys.stdout.write\r\n\r\n\r\ndef main():\r\n a, b = map(int, input().split())\r\n min_ = min(a, b)\r\n ans = factorial(min_)\r\n output(str(ans))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n\r\n", "a, b = map(int, input().split())\r\nstart = 1\r\n\r\nif a > b:\r\n temp = a\r\n a = b\r\n b = temp\r\n \r\n for index in range(1, a + 1):\r\n start *= index\r\n \r\nelse:\r\n for idx in range(1, a + 1):\r\n start *= idx\r\n \r\nprint(start)\r\n", "def fact(n):\r\n if n == 1:\r\n return 1\r\n else:\r\n return n * fact(n - 1)\r\n\r\n\r\nif __name__ == '__main__':\r\n x, y = [int(x) for x in input().split()]\r\n print(fact(min(x, y)))\r\n", "a,b=map(int,input().split())\nres1=1\nres2=1\ni=1\nif(a>=b):\n\tfor i in range(1,b+1):\n\t\tres2=res2*i\n\tprint(res2)\nif(a<b):\n\tfor i in range(1,a+1):\n\t\tres1=res1*i\n\tprint(res1)\n\n\n\t\t\t\t \t\t \t \t \t\t\t \t\t\t \t\t \t\t\t \t", "import math\na , b = map(int , input().split())\nm = min(a , b)\nprint(math.factorial(m))\n\n \t \t\t\t\t \t\t\t \t\t\t\t \t \t \t\t \t \t", "from math import factorial\na,b = map(int,input().split())\nprint(factorial(min(a,b)))\n# Fri Jul 07 2023 14:52:47 GMT+0300 (Moscow Standard Time)\n", "\r\nimport math\r\na ,b =map(int, input().split())\r\nv = min(a, b)\r\nif a == b:\r\n print(math.factorial(a))\r\nelse:\r\n print(math.factorial(v))\r\n", "[a,b]=list(map(int,input().split()))\r\nans=1\r\ni=2\r\nwhile i<=min(a,b):\r\n ans*=i\r\n i+=1\r\nprint(ans)", "a,b = map(int,input().split())\r\nans = 1\r\nm = min(a,b)\r\nfor i in range(1,m+1):\r\n ans *= i\r\nprint(ans)", "x,y=map(int,input().split())\ndef factorial(n):\n\tif(n==0):\n\t\treturn 1\n\telif(n==1):\n\t\treturn 1\n\telse:\n\t\treturn n*factorial(n-1)\nif(x<y):\n\tprint(factorial(x))\nelse:\n\tprint(factorial(y))\n \t\t\t \t \t\t\t\t\t \t \t\t \t \t\t \t\t\t \t\t\t", "a,b=map(int,input().split())\r\nres1=1\r\nres2=1\r\ni=1\r\nif(a>=b):\r\n\tfor i in range(1,b+1):\r\n\t\tres2=res2*i\r\n\tprint(res2)\r\nif(a<b):\r\n\tfor i in range(1,a+1):\r\n\t\tres1=res1*i\r\n\tprint(res1)\r\n", "A,B = map(int,input().split())\nm = min(A,B)\ns = 1\nfor i in range(2,m+1):\n s *= i \nprint(s)\n\n \t \t \t\t \t\t\t \t \t\t\t \t\t\t", "import math\r\na, b = map(int, input().split())\r\nprint(math.factorial(min(a, b)))\n# Thu Jul 06 2023 10:55:28 GMT+0300 (Moscow Standard Time)\n", "def fact(a):\n f=1\n for i in range(2,a+1):\n f=f*i\n return f\nn,m=map(int,input().split())\nprint(fact(min(n,m)))\n \t \t\t\t\t \t \t \t \t \t\t", "def find(a,b):\n p=min(a,b)\n print(fact(p))\ndef fact(n):\n if n==0 or n==1:\n return 1\n else:\n return n*fact(n-1)\nif __name__=='__main__':\n k=input()\n l=[]\n for i in k.split():\n l.append(int(i))\n find(l[0],l[1])\n\t \t \t \t \t \t\t \t \t \t\t\t\t\t\t \t", "from fractions import gcd\r\nimport math\r\n \r\nr, y = map(int, input().split())\r\nryna = min(r, y)\r\nryan = 1\r\n \r\nfor i in range(ryna, 0, -1):\r\n ryan*=i\r\n \r\nprint(ryan)", "def fact(n):\r\n if n==1:\r\n return n\r\n else:\r\n return n*fact(n-1)\r\na, b=[int(x) for x in input().split()]\r\nprint(fact(min(a,b)))", "from math import factorial\r\n\r\n\r\nclass Solution:\r\n\tdef __init__(self):\r\n\t\tpass\r\n \r\n\tdef solve(self):\r\n\t\tA, B = map(int, input().split())\r\n\t\tresult = []\r\n\t\tsmaller = min(A, B)\r\n\t\t\r\n\t\tresult.append(factorial(smaller))\r\n\r\n\t\tfor x in result:\r\n\t\t\tprint(x)\r\n\t\t\r\n \r\nif __name__ == \"__main__\":\r\n\tsol = Solution()\r\n\tsol.solve()\r\n", "a, b= map(int, input().split())\r\np= min(a, b)\r\nu= 1\r\nr= 1\r\n\r\nwhile u <= p:\r\n r *= u\r\n u += 1\r\n\r\nprint(r)", "A,B=input().split()\r\nA=int(A)\r\nB=int(B)\r\nresult=1\r\nfor i in range(2,min(A,B)+1):\r\n result*=i\r\nprint(result)", "a, b = map(int, input().split())\r\n\r\ndef fuck(x):\r\n\tif x == 1:\r\n\t\treturn x\r\n\telse:\r\n\t\treturn x*(fuck(x-1))\r\n\t\t\r\nprint(fuck(min(a, b)))", "import math\r\n \r\narr = input().split(\" \")\r\n \r\na = int(arr[0])\r\nb = int(arr[1])\r\nprint(math.factorial(min(a,b)))", "a , b = list(map(int,input().split()))\r\nc = 1\r\nfor i in range(1,min(a,b)+1):\r\n c = c * i\r\nprint(c)", "from functools import lru_cache\r\nimport sys\r\nimport math\r\n\r\nmod = 10 ** 9 + 7\r\ninf = float('inf')\r\n\r\n\r\ndef arrInt(): return list(map(int, input().split()))\r\n\r\n\r\ndef fact(n):\r\n ans = 1\r\n for i in range(1, n + 1):\r\n ans *= i\r\n return ans\r\n\r\n\r\ndef solve():\r\n pass\r\n\r\n\r\nTESTING = False\r\ninput = sys.stdin.readline\r\nif TESTING:\r\n sys.stdin = open('input.txt', 'r')\r\n sys.stdout = open('output.txt', 'w')\r\n\r\na, b = arrInt()\r\nprint(fact(min(a, b)))\r\n", "def fact(n):\r\n ans = 1\r\n for i in range(2, n + 1):\r\n ans *= i\r\n return ans\r\n\r\na, b = map(int, input().split())\r\nprint(fact(min(a, b)))", "a,b = map(int,input().split())\r\nm = min(a,b)\r\nans = 1\r\nfor i in range(1,m+1):\r\n ans*=i\r\nprint(ans)", "# Dev/Eng : Ziad Mohamed Gamal\r\n\r\n# =================== Libraries ======================\r\nfrom math import factorial as fact \r\n# =================== solve ======================\r\nx, y = list(map(int,input().split()))\r\n\r\nprint(fact(min(x,y)))", "a, b = map(int, input().split())\r\nm = min(a, b)\r\nres = 1\r\nfor i in range(1, m+1):\r\n res = res * i\r\nprint(res)", "import math\na,b = map(int, input().split())\ndef fact(x):\n for i in range(2,x):\n x *= i\n print(x)\n#def fact(x):\n# for i in range(2,x):\n# v=i*(i+1)\n# x = v1*v2\n\n#def fact(x):\n# x = math.sqrt((2*math.pi*x))*(x//math.e)**x\nif a < b:\n a = fact(a)\nelse:\n b = fact(b)", "# 822A - I'm bored with life\r\ndef fact(x):\r\n a = 1\r\n for i in range(1, x+1):\r\n a *= i\r\n return a\r\n\r\n\r\n[x, y] = list(map(int, input().split()))\r\nprint(fact(min(x, y)))\r\n", "import math\nA, B = map(int, input().split())\nminimum = min(A, B)\nres = math.factorial(minimum)\nprint(res)\n \t \t \t \t\t \t\t \t \t \t\t", "from math import factorial\n\na, b = (int(i) for i in input().split())\nres = factorial(min(a, b))\nprint(res)\n", "a,b = input().split()\r\na = int(a)\r\nb = int(b)\r\nc = min(a,b)\r\nfact = 1\r\nfor i in range(1,c+1):\r\n fact = fact * i\r\nprint(fact)\r\n\r\n", "from math import factorial\r\na, b = map(int,input().split())\r\nprint(factorial(min(a,b)))", "\nimport math\n\ndef gcdFact(a,b):\n\tmi=min(a,b)\n\treturn math.factorial(mi)\n\nif __name__ == '__main__':\n\ta,b=map(int,input().split())\n\tprint(gcdFact(a,b))\n\t\t \t\t\t \t \t \t \t\t\t \t", "def main():\r\n a, b = map(int, input().split())\r\n ans = 1\r\n small = a if a < b else b\r\n for i in range(1, small+1):\r\n ans *= i\r\n print(ans)\r\n\r\n\r\nmain()\r\n", "A,B = map(int, input().split())\r\n\r\ndef factorial(x):\r\n if x == 1:\r\n return 1\r\n else:\r\n # recursive call to the function\r\n return (x * factorial(x-1))\r\n\r\nif A == B:\r\n print(factorial(A))\r\nelif A > B:\r\n print(factorial(B))\r\nelse:\r\n print(factorial(A))\r\n\r\n", "import math\nn,k=map(int,input().split())\nprint(math.factorial(min(n,k)))\n \t \t \t \t\t \t \t\t \t \t\t\t\t \t", "from fractions import gcd\r\nimport math\r\n\r\nf, j = map(int, input().split())\r\nmini = min(f, j)\r\nl = 1\r\n\r\nfor i in range(mini, 0, -1):\r\n l*=i\r\n\r\nprint(l)", "a,b=map(int,input().split())\r\nf=1\r\nfor i in range(1,min(a,b)+1):\r\n f*=i\r\nprint(f)", "def fact(n):\n if(n == 1):\n return 1\n return n * fact(n-1)\n\na, b = (int(x) for x in input().split())\nprint(fact(min(a, b)))\n\t \t\t\t \t \t \t \t \t \t\t\t\t\t", "#pushi1111111111111111111111\ndef fact(l):\n res=1\n for i in range(1,l+1):\n res*=i\n print(res)\nb=[int(x) for x in input().split()]\nm=b[0]\nn=b[1]\nif m>n :\n fact(n)\nelse:\n fact(m)\n \t\t\t\t \t \t\t \t \t\t \t\t \t\t \t", "A,B=map(int,input().split())\r\npr=1\r\nfor i in range(1,min(A,B)+1):\r\n pr*=i\r\n\r\nprint(pr)", "import math\r\nfrom fractions import gcd\r\n \r\nx,y = map(int, input().split())\r\n \r\nm = min(x,y)\r\n\r\nn = 1\r\n\r\nfor i in range(m,0,-1):\r\n n *= i\r\nprint(n)", "a,b=[int(_) for _ in input().split()]\r\ni=wyn=1\r\nwhile i<=min(a,b):\r\n wyn*=i\r\n i+=1\r\nprint(wyn)", "def fact(N):\n if N <= 1: return 1\n return fact(N - 1)*N\ng, h = (int(x) for x in input().split())\nprint(fact(min(g, h)))\n\t \t \t\t\t\t \t\t\t \t \t\t \t", "import math\nimport sys\n\n\nif __name__ == \"__main__\":\n a, b = map(int, sys.stdin.readline().strip().split())\n temp = min(a, b)\n print(math.factorial(temp))\n \t\t \t \t \t\t \t\t\t\t\t\t \t\t\t \t\t \t\t \t\t\t", "a, b = map(int,input().split())\r\ns = 1\r\nif a < b:\r\n for i in range(1,a+1):\r\n s *= i\r\n print(s)\r\nelse:\r\n for i in range(1,b+1):\r\n s *= i\r\n print(s)", "A,Ba=map(int,input().split())\nm=min(A,Ba)\nres=1 \nfor i in range(1,m+1):\n res*=i\nprint(res)\n \t\t\t\t \t\t \t\t\t \t \t \t \t\t\t\t \t\t \t\t", "def fact(N):\n\tfact=1\n\tfor i in range(1,N+1):\n\t\tfact=fact*i\n\treturn fact\n\nlist1= list(map(int,input().split()))\nk = min(list1)\nprint(fact(k))\n \t \t \t\t\t \t\t \t \t \t \t\t \t", "x=input()\r\na=int(x.split()[0])\r\nb=int(x.split()[1])\r\nc=min(a,b)\r\nd=1\r\nfor i in range(1,c+1):\r\n d=d*i\r\nprint(d)\r\n", "a, b = map(int,input().split())\nminum = min(a,b)\nfactorial = 1\nwhile minum > 1:\n factorial *= minum\n minum -= 1\nprint(factorial)\n \t\t \t \t \t \t\t \t \t\t \t\t\t\t", "import math\ns,v=map(int,input().split())\nprint(math.factorial(min(s,v)))\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\n\r\nans = min(a,b)\r\n\r\nres=1\r\n\r\nfor i in range(1,ans+1):\r\n\tres *= i\r\n\r\nprint(res)", "def f(x):\r\n n=1\r\n for i in range(1,x+1):\r\n n=n*i\r\n return n\r\ns=input().split()\r\na,b=int(s[0]),int(s[1])\r\nprint(f(min(a,b)))\r\n", "n, m = input().split()\r\nx=min(int(n), int(m))\r\nk=1\r\nwhile(int(x)>0):\r\n k=k*x\r\n x=x-1\r\nprint(k)", "print(eval(\"*\".join([str(i) for i in range(1, min(int(e) for e in input().split())+1)])))", "a,b = map(int,input().split())\r\nimport math\r\nans = 1\r\nprint(math.factorial(min(a,b)))", "x = min(map(int, input().split()))\r\nans = 1\r\nfor i in range(1, x+1): ans *= i\r\nprint(ans)", "def Fact(N):\r\n if N == 0:\r\n return 1\r\n else:\r\n return Fact(N - 1) * N\r\nA, B = map(int, input().split())\r\nprint(Fact(min(A, B)))", "a,b=[int(i) for i in input().split()]\r\nc=min(a,b)\r\nsum=1\r\ni=1\r\nwhile i<=c:\r\n sum*=i\r\n i+=1\r\nprint(sum)\n# Thu Jul 06 2023 11:01:08 GMT+0300 (Moscow Standard Time)\n", "import math\r\nimport sys\r\n\r\ndef _input(): return map(int, input().split())\r\n\r\na, b = _input()\r\nk = min(a,b)\r\nres = 1\r\nwhile k>0:\r\n res*=k\r\n k-=1\r\nprint(res)", "a,b = map(int,input().split())\r\ns_a = 1\r\n\r\nm = min(a,b)\r\nfor i in range(2,m+1):\r\n s_a = s_a * i\r\n\r\nprint(s_a)", "a,b=map(int,input().split())\ndef fact(x):\n if x==0 or x==1:\n return 1\n else:\n return x*fact(x-1)\nif a>b:\n print(fact(b))\nelse:\n print(fact(a))\n\n\t\t\t\t \t \t \t\t\t \t \t\t \t \t", "a,b=map(int,input().split())\r\nm = min(a,b) \r\nf = 1 \r\nfor i in range(2,m+1):\r\n\tf*=i\r\nprint(f)\n# Thu Jul 06 2023 11:25:19 GMT+0300 (Moscow Standard Time)\n", "a, b = map(int, (input().split()))\n\n\ndef fact(x):\n if x == 1:\n return 1\n else:\n return x * fact(x-1)\n\n\nif a < b:\n print(fact(a))\nelse:\n print(fact(b))\n", "import sys\nimport math \na,b=map(int,sys.stdin.readline().split())\nn=min(a,b)\nsys.stdout.write(str(math.factorial(n)))\n\t\t \t \t\t \t \t \t\t \t\t \t \t \t", "import math\r\nn,p= map(int, input().split())\r\nprint(math.factorial(min(n,p)))", "import math\ndef factGCD(s,v):\n\treturn math.factorial(min(s,v))\ns,v=map(int,input().split())\nprint(factGCD(s,v))\n\t\t \t\t\t\t\t\t\t\t\t \t \t \t \t\t\t\t \t \t", "from math import gcd, factorial\r\nx = input().split()\r\na1 = int(x[0])\r\na2 = int(x[1])\r\n\r\nprint(factorial(min(a1,a2)))\r\n\r\n", "a,b=input().split()\ndef fact(n):\n f=1\n while(n>0):\n f=f*n\n n-=1\n return f\na=int(a)\nb=int(b)\nif(a<b):\n print(fact(a))\nelse:\n print(fact(b))\n\t \t \t \t \t \t \t \t \t \t \t", "p,q=map(int,input().split())\na=min(p,q)\ng=1\nfor j in range(1,a+1):\n g=g*j\nprint(g)\n \t\t \t \t \t\t \t \t\t\t \t \t\t \t \t\t\t", "import math\r\n\r\ninner = input().split()\r\na = int(inner[0])\r\nb = int(inner[1])\r\n\r\nif a >= b:\r\n print(math.factorial(b))\r\nelse:\r\n print(math.factorial(a))\r\n", "a, b = map(int,input().split())\n\nans = 1\nx = a\nif x > b:\n x = b\nfor i in range(x):\n ans *= i+1\n\nprint(ans)\n \t\t \t \t\t\t\t \t\t\t \t \t\t", "a, b = map(int, input().split())\nfac = min(a, b)\nfac1 = 1\nfor i in range(1, fac+1):\n fac1 *= i\n \nprint(fac1)\n\n \t\t\t \t\t\t\t\t\t \t\t \t \t \t \t\t", "import sys \n\ninp = sys.stdin \nout = sys.stdout\n\ndef fact(n):\n\tif(n==0 or n==1):\n\t\treturn 1\n\telse:\n\t\treturn n*fact(n - 1)\n\na, b = map(int, inp.readline().split())\nif(a < b):\n\tout.write(str(fact(a)))\nelse: \n\tout.write(str(fact(b)))\n\n\t\t \t \t \t\t \t \t \t\t \t", "a,b=map(int,input().split())\nx=min(a,b)\nc=1\nfor i in range(1,x+1):\n c=c*i\nprint(c)\n\n \t\t \t\t \t \t\t\t\t \t\t\t \t\t \t\t", "from math import factorial,gcd \na,b=map(int,input().split()) \nprint(factorial(min(a,b)))\n\n\n\t \t \t\t\t \t\t\t \t\t \t \t \t \t\t \t", "num1,num2=map(int,input().split())\nf=1\nm=min([num1,num2])\nfor i in range (1,m+1):\n f=f*i\nprint(f)\n\t \t \t\t \t\t \t \t\t\t\t\t \t\t", "from math import gcd\r\na,b=map(int,input().split())\r\nA=min(a,b)\r\ns=1\r\nfor i in range(1,A+1):\r\n\ts=s*i\r\nprint(s)\r\n", "import math \nm,n = (int(x) for x in input().split())\ndef gcdfac(m, n) : \n return math.factorial(min(m, n)) \nprint(gcdfac(m, n)) \n\t \t \t \t \t\t \t\t \t\t \t\t \t\t \t", "import math\r\nimport sys\r\n\r\ndef fast():\r\n sys.stdin = open(0)\r\n sys.stdout = open(1, 'w')\r\n\r\n\r\ndef isprime(n):\r\n if n == 2:\r\n return True\r\n if n < 2 or n % 2 == 0:\r\n return False\r\n for i in range(3, int(math.sqrt(n)) + 1, 2):\r\n if n % i == 0:\r\n return False\r\n return True\r\n\r\ndef add(a, b, m):\r\n return ((a % m) + (b % m)) % m\r\n\r\ndef sub(a, b, m):\r\n return ((a % m) - (b % m) + m) % m\r\n\r\ndef mul(a, b, m):\r\n return ((a % m) * (b % m)) % m\r\n\r\ndef fastpower(x, n):\r\n result = 1\r\n while n > 0:\r\n if n % 2 == 1:\r\n result = result * x\r\n x = x * x\r\n n = n // 2\r\n return result\r\n\r\ndef fastpower2(x, n, M):\r\n result = 1\r\n while n > 0:\r\n if n % 2 == 1:\r\n result = (result * x) % M\r\n x = mul(x, x, M)\r\n n = n // 2\r\n return result\r\n\r\ndef gcd(a, b):\r\n while b != 0:\r\n a, b = b, a % b\r\n return a\r\ndef lcm(a,b):\r\n #(a*b)/gcd(a,b)\r\n return a/gcd(a,b)*b\r\nn, k = map(int, input().split())\r\nfast()\r\nans = 1\r\nfor i in range(1, min(n, k) + 1):\r\n ans *= i\r\nprint(ans)", "def factorial(n):\r\n return 1 if (n==1 or n==0) else n * factorial(n - 1)\r\na,b=map(int,input().split())\r\nc=min(a,b)\r\nd=factorial(c)\r\nprint(d)", "from math import *\r\na,b = map(int, input().split())\r\nprint(factorial(min(a,b)))", "import math\r\na,b = map(int,input().split())\r\nm = min(a,b)\r\nprint(math.factorial(m))", "from math import prod\r\nx = min(map(int, input().split()))\r\nprint(prod([*range(1, x+1)]))", "l=list(map(int,input().split()))\na=l[0]\nb=l[1]\nf=1\nif a>b:\n while(b>0):\n f=f*b\n b=b-1\nelse:\n while(a>0):\n f=f*a\n a=a-1\nprint(f)\n\t\t\t \t \t \t \t\t\t\t \t\t\t \t\t\t\t \t\t", "from math import factorial\r\na, b = map(int, input().split(' '))\r\nn = min(a, b)\r\nprint(factorial(n))\r\n", "import math\na,b = map(int,input().split())\nprint(math.factorial(min(a,b)))\n\t\t\t \t\t \t\t\t\t\t \t\t \t \t \t", "m,n=map(int,input().split())\nx=min(m,n)\nans=1\nfor i in range(1,x+1):\n\tans=ans*i\nprint(ans)\n \t\t\t \t\t \t\t\t\t\t\t \t\t \t \t\t \t", "import math\r\nl = list(map(int, input().split()))\r\nprint(math.factorial(min(l)))", "def fact(n):\r\n if n==0 or n==1:\r\n f=1\r\n else:\r\n f=n*fact(n-1)\r\n return f\r\n\r\na,b=list(map(int,input().split()))\r\nprint(fact(min(a,b)))", "n,m= map(int, input().split())\nn = min(n,m)\nj = 1\nfor i in range(1,n+1):\n j = j*i\nprint(j)\n\n \t\t \t\t\t \t\t\t\t\t \t\t \t \t\t\t \t", "import sys\na,b = map(int, sys.stdin.readline().strip().split())\n\n\ndef factorial(x):\n\tfact = 1\n\tfor i in range(1,x+1):\n\t\tfact = fact * i\n\treturn fact\n\nif b < a:\n\tprint(factorial(b))\nelse:\n\tprint(factorial(a))\n \t\t\t\t \t\t \t\t \t \t\t \t\t\t\t\t \t\t", "def s(n):\r\n summ = 1\r\n for i in range(2, n + 1):\r\n summ *= i\r\n return summ\r\n \r\na, b = map(int, input().split())\r\nprint(s(min(a, b)))", "l1=[int(i) for i in input().split()]\r\nl1.sort()\r\na=l1[0]\r\np1=1\r\nfor i in range(1,a+1):\r\n p1=p1*i\r\nprint(p1)", "a,b=map(int,input().split())\r\ncommon_divisor=1\r\nfor i in range(2,min(a,b)+1):\r\n\tcommon_divisor*=i\r\nprint(common_divisor)\r\n", "a, b = map(int, input().split())\r\ntotal = 1 \r\nfor i in range(1, min(a, b) + 1):\r\n total *= i \r\nprint(total)", "import sys\nimport math\ndef bored_life(arr):\n min_ele=min(arr)\n max_ele=max(arr)\n diff=max_ele-min_ele\n res=1\n for i in range(1,min_ele+1):\n res=res*i\n res2=1\n for j in range(min_ele+diff,min_ele+diff+1):\n res2=res*j\n sys.stdout.write(str(math.gcd(res,res2)))\narr=list(map(int,sys.stdin.readline().split()))\nbored_life(arr)\n\t\t\t\t \t\t\t \t\t\t \t\t\t\t\t\t\t\t \t \t \t", "numbers = [int(x) for x in input().split()]\nleast = min(numbers)\nfact = 1\nfor i in range(1, least + 1, 1):\n fact *= i\nprint(fact)\n \t \t\t\t\t\t\t\t \t\t\t\t\t \t\t \t \t\t\t\t", "import math\r\nprint(math.factorial(min(map(int, input().split()))))", "import math\nm,n= map(int,input().split())\nprint(math.factorial(min(m,n)))\n \t\t \t\t\t \t\t\t\t \t\t \t \t \t \t", "a,b=map(int,input().split());l=1;p=min(a,b)\r\nfor i in range(1,p+1):\r\n l*=i\r\nprint(l)\r\n", "import math\r\na,b=map(int,input().split())\r\nt=min(a,b)\r\nprint(math.factorial(t))", "from math import factorial\r\nn, m = map(int, input(). split())\r\nmn = min(n, m)\r\nfact = factorial(mn)\r\nprint(fact)\r\n", "from math import factorial\r\nA, B = map(int, input().split())\r\nprint(factorial(min(A,B)))", "a,b=map(int,input().split())\r\nimport math\r\nprint(math.factorial(min(a,b)))", "x,y= map(int,input().split())\r\nl = min(x,y)\r\ncnt = 1\r\nfor i in range(1,l+1,1):\r\n cnt*=i\r\nprint(cnt)", "import math\r\ntemp = input()\r\na,b = temp.split()\r\na = int(a);b = int(b)\r\nmin_faq = math.factorial(min(a,b))\r\nprint(min_faq)", "from math import factorial\r\nprint(factorial(min(list(map(int, input().split(' '))))))\r\n", "a=input().split()\r\nb=[int(i) for i in a]\r\nk=min(b)\r\nco=1\r\nfor i in range(1,k+1):\r\n co=co*i\r\nprint(co)\r\n", "import math\na, b = input().split()\nprint(math.factorial(min(int(a),int(b))))\n \t\t \t \t \t\t\t\t \t \t", "import math\r\n\r\n# TC = int(input())\r\nTC = 1\r\n\r\nfor tc in range(TC):\r\n A, B = map(int, input().split())\r\n r = min(A,B)\r\n print(math.factorial(r))", "import math \r\nn,k = map(int,input().split())\r\nans = min(n,k)\r\nprint(math.factorial(ans))", "n,m=map(int,input().split())\r\nm=min(n,m)\r\nans=1\r\nfor i in range(1,m+1):\r\n ans*=i\r\nprint(ans)", "n,m=list(map(int,input().split()))\r\nx=min(n,m)\r\nk=1\r\nwhile x>0:\r\n k=k*x\r\n x-=1\r\nprint(k)", "j,k=list(map(int,input().split()))\nh=min(j,k)\nb=1\nfor i in range(2,h+1):\n b=b*i\nprint(b)\n\t\t \t\t\t \t\t \t \t \t\t \t\t\t \t \t \t", "y=input().split()\r\nx=[]\r\nfor i in y:\r\n x.append(int(i))\r\na=1\r\nfor i in range(1,int(min(x))+1):\r\n a*=i\r\nprint(a)\r\n", "# https://codeforces.com/problemset/problem/822/A\r\n\r\nimport math\r\n\r\na, b = map(int, input().split())\r\nprint(math.factorial(min(a, b)))", "import math as m\na,b=map(int,input().split())\ny=min(a,b)\nx=1\nfor i in range(1,y+1):\n x=x*i\nprint(x)\n \n \n\t \t\t\t\t\t \t \t\t\t \t \t\t\t\t\t \t", "from math import factorial\r\nn, m = map(int, input().split())\r\nprint(factorial(min(n, m)))\r\n\r\n\r\n\r\n", "a, b = map(int, input().split())\r\nx = 1\r\nfor i in range(1,min(a,b)+1):\r\n x *= i\r\nprint(x)", "# Rishabh Rao (https://github.com/rishabhrao)\r\n\r\nimport sys\r\nfrom math import factorial\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\na, b = iis()\r\nprint(factorial(min(a, b)))\r\n", "fact = [1]\r\nfor i in range(1, 17):\r\n fact.append(i * fact[i-1])\r\na, b = map(int, input().split(' '))\r\nprint(fact[min(a, b)])", "import math\r\nnum = input()\r\n\r\nnum = num.split(\" \")\r\n\r\nA = int(num[0])\r\nB = int(num[1])\r\n\r\nminn = min(A,B)\r\n\r\nprint(math.factorial(minn))", "from math import factorial, gcd\r\n\r\n\r\nx , y = [int(x) for x in input().split()]\r\nprint(factorial(min(x, y)))", "m,n=map(int,input().split())\ns=min(m,n)\nans=1\nfor i in range(1,s+1):\n\tans=ans*i\nprint(ans)\n \t\t \t \t\t\t\t \t \t\t\t\t \t\t \t", "import math\r\nfrom fractions import gcd\r\n\r\na,b = map(int, input().split())\r\n\r\nmenor =min(a,b)\r\nx = 1\r\nfor i in range(menor,0,-1):\r\n x*=i\r\n\r\nprint(x)", "import math\r\ndef fact(num):\r\n if(num==1):\r\n return 1\r\n else:\r\n return num * fact(num-1)\r\n\r\na,b=map(int,input().split())\r\nz=fact(min(a,b))\r\nprint(z)\r\n", "import math\na,b = map(int, input().split())\nv = min(a,b)\nprint(math.factorial(v))\n# Thu Jul 06 2023 12:32:12 GMT+0300 (Moscow Standard Time)\n", "a,b = map(int,input().split())\r\n\r\nx = 1\r\n\r\nfor i in range(1,min(a,b) + 1):\r\n x *= i\r\n\r\nprint(x)", "import math \nc,d = (int(x) for x in input().split())\ndef gof(c, d) : \n return math.factorial(min(c, d)) \nprint(gof(c, d)) \n\t \t \t\t \t \t \t\t \t \t\t \t \t\t \t\t\t\t", "import math\nd,m = map(int, input().split())\nout = 1 \nd = min(d,m)\nfor i in range(2,d+1):\n out= out*i\nprint(out)\n\t \t \t\t \t \t \t \t \t \t \t\t\t \t", "a, b = map(int, input().split())\r\nsuma1 = 1\r\nfor i in range(1, min(a,b)+1):\r\n suma1 *= i\r\nprint(suma1)", "import math\r\nu,i=map(int,input().split())\r\ne=min(u,i)\r\nprint(math.factorial(e))", "n, m= map(int,input().split())\nx = min(n,m)\nfor i in range(1,x):\n x = x*i\nprint(x)\n\n\n \t\t\t \t \t\t\t\t \t\t \t\t \t\t \t\t", "def FindSmaller(x, y):\r\n if x < y:\r\n return x\r\n return y\r\n\r\n\r\ndef FindFactorial(a, b):\r\n number = FindSmaller(a, b)\r\n\r\n fact = 1\r\n while(number > 0):\r\n fact *= number\r\n number -= 1\r\n return fact\r\n\r\n\r\nk = input().split()\r\na, b = int(k[0]), int(k[1])\r\nprint(FindFactorial(a, b))\r\n", "def factorial(n):\r\n\tresult = 1\r\n\twhile (n != 0):\r\n\t\tresult = result * n\r\n\t\tn -= 1\r\n\r\n\treturn result\r\n\r\nnumbers = input().split()\r\nA, B = int(numbers[0]), int(numbers[1])\r\n\r\nif(A <= B):\r\n\tprint(factorial(A))\r\nelse:\r\n\tprint(factorial(B))", "x,y = map(int, input().split())\r\nminofnum = min(x,y)\r\nfact_num = 1\r\nfor i in range(1, minofnum+1):\r\n fact_num = fact_num * i\r\nprint(fact_num)", "import math\r\nprint(math.factorial(min(map(int,input().split()))))", "import math\r\na,b=map(int,input().split())\r\nx=min(a,b)\r\nprint(math.factorial(x))", "def fact(N):\n if N <= 1: return 1\n return fact(N - 1)*N\nG, H = (int(x) for x in input().split())\nprint(fact(min(G, H)))\n\t \t \t \t\t\t \t\t \t \t \t \t", "\nm,n = map(int,input().split())\na=1\nb=1\nif(m>n):\n for i in range(1,n+1):\n a= a*i\n \n print(a)\nelse:\n for i in range(1,m+1):\n a= a*i\n print(a)\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().strip()\r\n\r\n\r\n\r\nfor i in range(1):\r\n a , b = list(map(int,input().split()))\r\n count = 1\r\n for i in range(1,min(a,b)+1):\r\n count *= i\r\n print(count)", "import math\r\nsq = [int(i) for i in input().split()]\r\nprint(math.factorial(min(sq[0],sq[1])))", "import math\na,b = map(int, input().split())\nout = 1;\nif a>b:\n for i in range(2,b+1):\n out = out*i\n \nelse:\n for i in range(2,a+1):\n out = out*i\nprint(out)\n\t\t \t \t\t\t\t \t\t \t\t \t \t\t \t \t\t", "import sys\r\nsys.setrecursionlimit(100000000)\r\ninput=lambda:sys.stdin.readline().strip()\r\nwrite=lambda x:sys.stdout.write(str(x)+'\\n')\r\n\r\n# from random import randint\r\n# from copy import deepcopy\r\n# from collections import deque\r\n# from heapq import heapify,heappush,heappop\r\n# from bisect import bisect_left,bisect,insort\r\n# from math import inf,sqrt,gcd,ceil,floor,log,log2,log10,pi\r\n# from functools import cmp_to_key\r\n\r\ndef get(x):\r\n ans=1\r\n for i in range(1,x+1):\r\n ans*=i\r\n return ans\r\n\r\n\r\na,b=map(int,input().split())\r\nprint(get(min(a,b)))", "import math\r\na,b=input().split()\r\na=int(a)\r\nb=int(b)\r\nx=0\r\ny=1\r\nif a<b:\r\n x=a\r\nelse:\r\n x=b\r\nfor i in range(1,x+1):\r\n y*=i\r\nprint(y)\r\n", "a = min(map(int,input().split()))\r\nr = 1\r\nfor x in range(1,a+1):\r\n r*=x\r\nprint(r)", "import math\r\na, b=map(int, input().split())\r\nzz=min(a, b)\r\nprint(math.factorial(zz))\n# Thu Jul 06 2023 12:10:24 GMT+0300 (Moscow Standard Time)\n", "x,y=map(int,input().split())\nif(x>y):\n ans=1\n for i in range(2,y+1):\n ans=ans*i\n print(ans)\nelse:\n ans1=1\n for i in range(2,x+1):\n ans1=ans1*i\n print(ans1) \n\t \t \t \t\t \t \t\t \t\t \t \t \t\t", "a, b= list(map(int, input().split()))\r\np = 1\r\nfor i in range(1, min(a, b) + 1):\r\n p *= i\r\nprint(p)\r\n", "import math\r\na,b = map(int,input().split())\r\nc = min(a,b)\r\nprint(math.factorial(c))\r\n", "def fac(num):\r\n\tf=1\r\n\tfor i in range(1,num+1):\r\n\t\tf*=i\r\n\tprint(f)\r\nx,y=map(int,input().split())\r\nok=min(x,y)\r\nfac(ok)", "import math\no,p=map(int,input().split())\nprint(math.factorial(min(o,p)))\n\n \t \t \t \t\t \t\t\t \t\t \t", "n, m = map(int, input(). split())\r\ns = 1\r\nfor i in range(1, min(n, m) + 1):\r\n s *= i\r\nprint(s)\r\n", "def lif(arr):\r\n k = min(arr[0],arr[1])\r\n b = 1\r\n for i in range(2,k+1):\r\n b = b*i\r\n return b\r\narr = [int(x) for x in input().split()]\r\nprint(lif(arr))", "from math import factorial\r\nl=[int(x) for x in input().split()]\r\nl.sort()\r\nprint(factorial(l[0]))", "p,q=map(int,input().split())\ns=min(p,q)\nans=1\nfor i in range(1,s+1):\n ans=ans*i \nprint(ans)\n\n\t \t\t\t \t \t\t\t\t\t\t\t \t\t \t\t\t \t", "import math\na,b= map(int,input().split())\nout = 1;\nif a>b:\n for i in range(2,b+1):\n out = out*i\nelse:\n for i in range(2,a+1):\n out=out*i\nprint(out) \n \t\t\t \t\t\t\t\t\t\t\t \t\t\t \t \t\t \t\t", "def fac(n):\r\n if n==1:\r\n return 1\r\n return n*fac(n-1)\r\n\r\na,b=map(int,input().split())\r\nprint(fac(min(a,b)))\r\n \r\n", "a, b = map(int,input().split())\r\nminum = min(a,b)\r\nfactorial = 1\r\nwhile minum > 1:\r\n factorial *= minum\r\n minum -= 1\r\nprint(factorial)", "A,B = map(int,input().split())\r\nm = min(A,B)\r\ns = 1\r\nfor i in range(2,m+1):\r\n s *= i \r\nprint(s)\r\n", "a,b = map(int,input().split())\r\nk = 1\r\nif a<b:\r\n for i in range(1, a+1):\r\n k*=i\r\n print(k)\r\nelse:\r\n for i in range(1, b+1):\r\n k*=i\r\n print(k)", "def factmin(x,y):\n z=min(x,y)\n fact=1\n for i in range(1,z+1):\n fact=fact*i\n print(fact)\nx,y=[int(item) for item in input().split(\" \")]\nfactmin(x,y)\n\t \t \t\t \t\t \t\t \t \t \t \t\t", "import math\r\na,b=map(int,input().split())\r\nm=min(a,b)\r\nf=math.factorial(m)\r\nprint(f)\r\n\r\n", "# Author : Zain ul abideen.\r\nimport math\r\nprint(math.factorial(min(map(int,input().split()))))", "b, c = map(int, input().split(\" \"))\r\n\r\na = 1\r\nn = c if c<b else b\r\n\r\nfor i in range(1, n, 1):\r\n a = a + (a * i)\r\n\r\nprint(a)", "import math;\r\nn=list(map(int,input().split()))\r\nm=min(n[0],n[1])\r\nprint(math.factorial(m))", "import math\r\n\r\na,b = map(int,input().split())\r\n\r\nminn = min(a,b)\r\n\r\nprint(math.factorial(minn))", "x,y=input().split(' ')\r\n\r\nans=min(int(x),int(y))\r\n\r\nfor i in range(1,ans):\r\n ans*=i\r\n \r\nprint(ans)", "import math\na,b=map(int,input().split())\ns=min(a,b)\nprint(math.factorial(s))\n#___________________________________________________\n \t\t \t \t \t\t\t\t\t\t\t\t\t \t \t \t \t\t \t\t", "from functools import reduce\r\nfrom sys import stdin, stdout\r\nfrom math import *\r\n\r\n\r\ndef cin(a=str):\r\n return a(stdin.readline().strip())\r\n\r\n\r\ndef cout(*args, end=\"\\n\"):\r\n for arg in args:\r\n stdout.write(str(arg)+\" \")\r\n stdout.write(\"\\n\")\r\n\r\n\r\ndef vin(datatype):\r\n return list(map(datatype, stdin.readline().strip().split()))\r\n\r\n\r\ndef Filter(a, b):\r\n return list(filter(a, b))\r\n\r\n\r\ndef Map(a, b):\r\n return list(map(a, b))\r\n\r\n\r\n'''\r\nvalue of constants\r\n'''\r\nN = 1000000007\r\nN2 = 998244353\r\n\r\n\r\ndef main(is_testCases=True):\r\n testCases = 1\r\n if is_testCases:\r\n testCases = int(input())\r\n for _ in range(testCases):\r\n a, b = vin(int)\r\n cout(factorial(min(a, b)))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main(False)\r\n", "# cook your dish here\np,t=map(int,input().split())\ns=min(p,t)\nres=1 \nfor i in range(1,s+1):\n res=res*i\nprint(res)\n \t \t \t\t\t \t \t \t \t \t \t\t\t", "def lust(rom,jul):\r\n bluff=min(rom,jul)\r\n add=1\r\n for i in range(1,bluff+1): add=add*i\r\n print(add)\r\nrom,jul=[int(item) for item in input().split(\" \")]\r\nlust(rom,jul)", "def bored(alpha,beta):\n theta=min(alpha,beta)\n count=1\n for i in range(1,theta+1): count=count*i\n print(count)\nalpha,beta=[int(item) for item in input().split(\" \")]\nbored(alpha,beta)\n \n\t \t\t \t\t \t \t \t\t\t \t \t\t \t\t", "t = list(map(int, input().split()))\r\nn = int(t[0])\r\nm = int(t[1])\r\np = min(n, m)\r\ns = 1\r\nfor i in range(1, p+1):\r\n s = s*i\r\nprint(s)", "# Holidays have finished. Thanks to the help of the hacker Leha, Noora managed to enter the university of her dreams which is located in a town Pavlopolis. It's well known that universities provide students with dormitory for the period of university studies. Consequently Noora had to leave Vičkopolis and move to Pavlopolis. Thus Leha was left completely alone in a quiet town Vičkopolis. He almost even fell into a depression from boredom!\n# Leha came up with a task for himself to relax a little. He chooses two integers A and B and then calculates the greatest common divisor of integers \"A factorial\" and \"B factorial\". Formally the hacker wants to find out GCD(A!, B!). It's well known that the factorial of an integer x is a product of all positive integers less than or equal to x. Thus x! = 1·2·3·...·(x - 1)·x. For example 4! = 1·2·3·4 = 24. Recall that GCD(x, y) is the largest positive integer q that divides (without a remainder) both x and y.\n# Leha has learned how to solve this task very effective. You are able to cope with it not worse, aren't you?\nfrom fractions import gcd\nimport math\n\nt, r = map(int, input().split())\nmin = min(t, r)\ne = 1\n\nfor i in range(min, 0, -1):\n e*=i\n\nprint(e)", "values = input().split()\nvalues = [eval(i) for i in values]\n\ndef obtain_factorial(num:int)->int:\n factorial = 1\n for i in range(1, num+1):\n factorial *=i\n return factorial\n\nmini = min(values)\nmax_fact = obtain_factorial(mini)\nprint(max_fact)\n\t\t \t \t\t \t\t\t\t \t \t \t \t\t", "f = [1]\r\nfor i in range(2,min(list(map(int,input().split())))+1):\r\n f.append(f[-1]*i)\r\nprint(f[-1])", "import math\na,b=[int(x) for x in input().split()]\ndef gcdOfFactorial(a,b):\n return math.factorial(min(a,b))\nprint(gcdOfFactorial(a,b))\n\t \t\t\t \t \t \t \t\t\t \t \t\t\t", "import math\r\n\r\na,b=map(int,input().split(\" \"))\r\ny=math.factorial(min(a,b))\r\nl=[]\r\nfor s in range(1,int(math.sqrt(y))+1):\r\n if y%s==0:\r\n l.append(s)\r\n l.append(y//s)\r\nprint(max(l))", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[6]:\n\n\nval = list(map(int, input().split()))\nval.sort()\n\n# def hcf(a,b):\n# if b==0:\n# return a\n# else:\n# return hcf(b,a%b)\n# def rng_prod(lo,hi):\n# if lo+1 < hi:\n# mid = (hi+lo)//2\n# return rng_prod(lo,mid) * rng_prod(mid+1,hi)\n# if lo == hi:\n# return lo\n# return lo*hi\n\ndef factorial(n):\n# if n < 2:\n# return 1\n# return rng_prod(1,n)\n if n==1:\n return 1\n else:\n return n*factorial(n-1)\nif (val[1]>val[0])|(val[1]==val[0]):\n print(factorial(val[0]))\n\n\n\n# In[ ]:\n\n\n\n\n", "#https://codeforces.com/problemset/problem/822/A\r\ndef factorize(number):\r\n answer = number\r\n while number > 1:\r\n number -= 1\r\n answer *= number\r\n return answer\r\n\r\n(a,b) = (int(x) for x in input().split())\r\nanswer = factorize(min(a,b))\r\nprint(answer)", "def fact(n):\n if n <= 1: return 1\n return fact(n-1)*n\n \na, b = (int(x) for x in input().split())\nprint(fact(min(a, b)))\n \t \t \t\t \t \t\t\t\t \t\t \t\t\t \t\t \t", "a,b=map(int,input().split())\nm=min(a,b)\nfact=1\nfor i in range (1,m+1):\n\tfact=fact*i\nprint(fact)\n\t \t \t\t \t \t \t\t\t\t\t\t\t\t\t\t \t \t\t", "import math\r\na,b=map(int,input().split())\r\ns=min(a,b)\r\nprint(math.factorial(s))\r\n", "from math import gcd\r\ndef factorial(n):\r\n result = 1\r\n for i in range(2, n + 1):\r\n result *= i\r\n return result\r\na,b=map(int,input().split())\r\nx=min(a,b)\r\nprint(factorial(x))\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "a, b = list(map(int, input().split()))\r\nans = min(a, b)\r\ndef fact(num):\r\n if num == 1 or num == 0:\r\n return 1\r\n return fact(num - 1) * num\r\nprint(fact(ans))", "#!/usr/bin/env/python\r\n# -*- coding: utf-8 -*-\r\na, b = list(map(int, input().split()))\r\nc = min(a, b)\r\nres = 1\r\nfor i in range(1, c + 1):\r\n res *= i\r\nprint(res)", "def fact(s):\n if s <= 1: return 1\n return fact(s-1)*s\n \np, q = (int(y) for y in input().split())\nprint(fact(min(p, q)))\n \t \t\t \t\t \t \t\t \t \t \t \t\t \t", "import math;a,b=map(int,input().split());print(math.factorial(b) if a>b else math.factorial(a))", "a,b=map(int,input().split())\r\ndef gcd_factorial(a, b):\r\n m = min(a, b)\r\n result = 1\r\n for i in range(1, m+1):\r\n result *= i\r\n return result\r\nprint(gcd_factorial(a, b))\r\n", "a,b = map(int,input().split())\r\nm = min(a,b)\r\nr = 1\r\nfor i in range(1,m+1):\r\n r = r * i\r\nprint(r)", "from math import factorial\r\nm,n=map(int,input().split())\r\nprint(factorial(min(m,n)))", "import math\na,b = map(int, input().split())\nprint(math.factorial(min(a,b)))" ]

[ "from collections import Counter\r\nn, m, k = input().split()\r\nk, c = int(k.split('.')[1]), Counter()\r\nfor i in range(int(n)):\r\n s, e = input().split()\r\n e = int(e) * k // 100\r\n if e >= 100:\r\n c[s] = e\r\nfor i in range(int(m)):\r\n c[input()] += 0\r\nprint(len(c))\r\nprint('\\n'.join(sorted(x + ' ' + str(c[x]) for x in c)))", "a=input().split()\r\nn,m,k=int(a[0]),int(a[1]),int(a[2].split('.')[1])\r\nb={}\r\nfor _ in range(n):\r\n a=input().split()\r\n c=int(a[1])*k/100\r\n if c>=100: b[a[0]]=c\r\nfor _ in range(m):\r\n d=input()\r\n if not (d in b): b[d]=0\r\nprint(len(b))\r\nfor e in sorted(b):\r\n print(e,int(b[e]))\r\n", "# input Operation \r\nfirst_line = input().split()\r\nn, m, k = int(first_line[0]), int(first_line[1]), int(first_line[2].split('.')[1])\r\n\r\n# OutPut Operation \r\nb={}\r\nfor i in range(n):\r\n old_skill=input().split()\r\n c=int(old_skill[1])*k/100\r\n if c>=100: \r\n b[old_skill[0]]=c\r\nfor i in range(m):\r\n d=input()\r\n if not (d in b): \r\n b[d]=0\r\nprint(len(b))\r\nfor i in sorted(b):\r\n print(i,int(b[i]))\r\n", "\r\nn ,m , k =map(float ,input().split())\r\nn ,m , k =round(n) ,round(m) ,round( k *100)\r\ndic1 = {}\r\nfor i in range(n):\r\n key1, value1 = input().split()\r\n value1 = int(value1) * k / 100\r\n if value1 >= 100:\r\n dic1[key1] = value1\r\n\r\nfor j in range(m):\r\n key2 = input()\r\n if key2 not in dic1.keys():\r\n dic1[key2] = 0\r\n\r\nprint(len(dic1))\r\nfor x in sorted(dic1):\r\n print(x, int(dic1[x]))", "n,m,k=map(float,input().split())\r\nn,m,k=round(n),round(m),round(k*100)\r\nD=dict()\r\nfor i in range(n):\r\n x=input().split()\r\n F=int(x[1])*k//100\r\n if(F>=100):\r\n D[x[0]]=F\r\n \r\nfor i in range(m):\r\n x=input()\r\n if x not in D:D[x]=0\r\nprint(len(D))\r\nfor x in sorted(D):\r\n print(x,D[x])", "n,m,k=input().split()\nn,m=int(n),int(m)\nk=int(k[2:])\nd={}\nd2={}\nans=[]\nfor i in range(n):\n\ta,b=input().split()\n\t# print ((int(b)*int(str(k)[2:]))/100)\n\t# print ((int(b)),str(k),str(k)[2:],int(str(k)[2:]),int(b)*int(str(k)[2:]),int(b)*int(str(k)[2:]))\n\tif (int(b)*k/100)>=100:\n\t\td[a]=int(b)*k/100\nfor i in range(m):\n\ts=input()\n\td2[s]=0\nfor i in d:\n\tans.append((i,d[i]))\nfor i in d2:\n\tif i not in d:\n\t\tans.append((i,d2[i]))\nans.sort()\nprint (len(ans))\nfor i in ans:\n\tprint (i[0],int(i[1]))", "\"\"\"Transmigration\"\"\"\r\n\r\n\r\ndef main():\r\n a = input().split()\r\n n, m, k = int(a[0]), int(a[1]), int(a[2].split('.')[1])\r\n skill_set = list(input().split() for _ in range(int(n)))\r\n names = []\r\n for i in range(len(skill_set) - 1, -1, -1):\r\n skill_set[i][1] = int(skill_set[i][1]) * k / 100\r\n if skill_set[i][1] < 100:\r\n del skill_set[i]\r\n for i in skill_set:\r\n names.append(i[0])\r\n\r\n for j in range(int(m)):\r\n new_skill = input()\r\n if not (new_skill in names):\r\n skill_set.append([new_skill, 0])\r\n print(len(skill_set))\r\n for _ in sorted(skill_set):\r\n print(f\"{_[0]} {int(_[1])}\")\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "data = input().split()\nold_count, new_count = map(int, data[0:2])\npercent = int(data[2][2:])\nskills = {}\nfor i in range(old_count):\n name, score = input().split()\n score = int(score) * percent // 100\n if score >= 100:\n skills[name] = score\nfor i in range(new_count):\n name = input().strip()\n if name not in skills:\n skills[name] = 0\nprint(len(skills))\nfor name, score in sorted(skills.items()):\n print(name, score)\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\nfrom heapq import *\r\ndef f(d):\r\n hq = []\r\n for i in range(n):\r\n x = a[i]\r\n while x > d:\r\n x //= 2\r\n heappush(hq, -x)\r\n ans = 1\r\n res = []\r\n while len(hq) > 1:\r\n x = -heappop(hq)\r\n y = -heappop(hq)\r\n if y < x:\r\n heappush(hq, -y)\r\n res.append(x)\r\n else:\r\n if x//2 == 0:\r\n ans = 0\r\n break\r\n heappush(hq, -(x//2))\r\n\r\n heappush(hq, -y)\r\n return ans, res+([-hq[0]] if len(hq) else [])\r\nn = ni()\r\na = sorted(na())\r\nok = 10**9+1\r\nng = 0\r\nwhile ok - ng > 1:\r\n d = ok +ng >> 1\r\n \r\n if f(d)[0]:\r\n ok = d\r\n else:\r\n ng = d\r\n\r\nprint(*f(ok)[1])\r\n", "from heapq import heappop, heapify, heappush\r\ndef negative(num):\r\n return -num \r\ndef generator(nums):\r\n keeper = set(nums)\r\n nums = list(map(negative,nums))\r\n heapify(nums)\r\n answer = []\r\n while nums:\r\n top = -1 * heappop(nums)\r\n temp = top \r\n \r\n while top in keeper:\r\n top//=2\r\n if top not in keeper and top!=0:\r\n heappush(nums,-1 * top)\r\n keeper -= {temp}\r\n keeper.add(top)\r\n else:\r\n answer.append(str(temp))\r\n return answer\r\n\r\nlength = int(input())\r\nnums = list(map(int,input().split()))\r\nprint(\" \".join(generator(nums)))", "from collections import defaultdict\r\nimport 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\ny = list(map(int, input().split()))\r\ndp = defaultdict(lambda : 0)\r\nh = []\r\nfor i in y:\r\n dp[i] = 1\r\n heapq.heappush(h, -i)\r\nwhile h:\r\n i = -heapq.heappop(h)\r\n j = i\r\n while dp[j] and j:\r\n j //= 2\r\n if not j:\r\n break\r\n dp[i], dp[j] = 0, 1\r\n heapq.heappush(h, -j)\r\nans = []\r\nfor i in list(dp.keys()):\r\n if dp[i]:\r\n ans.append(i)\r\n if not len(ans) ^ n:\r\n break\r\nsys.stdout.write(\" \".join(map(str, ans)))", "from collections import defaultdict\r\nimport heapq\r\n\r\npow=[1]\r\nfor i in range(30):\r\n pow.append(pow[-1]*2)\r\n\r\nn=int(input())\r\nb=list(map(int,input().split()))\r\nd=defaultdict(lambda:0)\r\nfor j in b:\r\n d[j]=1\r\nfor j in range(n):\r\n b[j]=-b[j]\r\nheapq.heapify(b)\r\nans=[]\r\nf=1\r\nwhile(f):\r\n j= -heapq.heappop(b)\r\n can=0\r\n for i in range(31):\r\n curr=(j-(j%pow[i]))//pow[i]\r\n if curr<1:\r\n break\r\n if d[curr]==0:\r\n heapq.heappush(b,-curr)\r\n d[curr]=1\r\n can=1\r\n break\r\n if not can:\r\n heapq.heappush(b,-j)\r\n break\r\n\r\nfor j in range(n):\r\n b[j]=-b[j]\r\n\r\nprint(*b)\r\n", "import sys\r\nimport heapq\r\ninput = sys.stdin.buffer.readline \r\n\r\n\r\ndef process(A):\r\n n = len(A)\r\n S = set(A)\r\n H = []\r\n for x in A:\r\n heapq.heappush(H, -1*x)\r\n while True:\r\n x1 = heapq.heappop(H)\r\n x1 = -1*x1\r\n x2 = x1\r\n change = False\r\n while True:\r\n x2 = x2//2\r\n if x2 > 0:\r\n if x2 not in S:\r\n S.remove(x1)\r\n S.add(x2)\r\n heapq.heappush(H, -1*x2)\r\n change = True\r\n break\r\n else:\r\n break\r\n if not change:\r\n break\r\n return list(S)\r\n \r\n \r\n \r\n \r\n \r\n # print(x)\r\n \r\nn = int(input())\r\nA = [int(x) for x in input().split()]\r\nanswer = process(A)\r\nsys.stdout.write(' '.join(map(str, answer))+'\\n')", "def main():\n from heapq import heapify, heapreplace\n input()\n s = set(map(int, input().split()))\n xx = [-x for x in s]\n heapify(xx)\n while True:\n x = -xx[0]\n while x != 1:\n x //= 2\n if x not in s:\n s.add(x)\n heapreplace(xx, -x)\n break\n else:\n break\n print(' '.join(str(-x) for x in xx))\n\nif __name__ == '__main__':\n main()\n", "def solve():\n\tfrom heapq import merge \n\t\n\tinput() # read n\n\ta = set(int(x) for x in input().split(' '))\n\tmaxe = max(a)\n\t\n\tnodemap = {}\n\t\n\tclass node:\n\t\t__slots__ = ('left', 'right')\n\t\tdef __init__(self):\n\t\t\tself.right = self.left = None\n\t\t\n\n\tfor x in a:\n\t\twhile (x > 0) and not (x in nodemap):\n\t\t\tnodemap[x] = node()\n\t\t\t#print(f\"node({x}) created\")\n\t\t\tx //= 2\n\t\t\n\tfor x in nodemap.keys():\n\t\ty = x // 2\n\t\t\n\t\tif x > 1:\n\t\t\tif x%2 == 1:\n\t\t\t\tnodemap[y].right = nodemap[x]\n\t\t\t\t#print(f\"{y} --right--> {x}\")\n\t\t\telse:\n\t\t\t\tnodemap[y].left = nodemap[x]\n\t\t\t\t#print(f\"{y} --left--> {x}\")\n\t\t\t\n\troot = nodemap[1]\n\t\n\t#print(list(nodemap.keys()))\n\t\n\t\n\tdef f(x, root):\n\t\t\n\t\tif not root:\n\t\t\treturn (-1, [])\n\t\t\t\n\t\t#print(f\"f({x}) called\")\n\t\t\t\n\t\tlmax, larr = f(2*x, root.left)\n\t\t#print(f\"left({x}) = {larr}\")\n\t\t\n\t\t\n\t\trmax, rarr = f(2*x+1, root.right)\n\t\t#print(f\"right({x}) = {rarr}\")\n\t\t\n\t\tif x in a:\n\t\t\treturn (max(lmax, x, rmax), list(merge(larr, [x], rarr)))\n\t\t\t\n\t\tif lmax > rmax:\n\t\t\tlarr.pop()\n\t\t\tnewmax = larr[-1] if len(larr) else -1\n\t\t\treturn (max(newmax, x, rmax), list(merge(larr, [x], rarr)))\n\t\telif lmax < rmax:\n\t\t\trarr.pop()\n\t\t\tnewmax = rarr[-1] if len(rarr) else -1\n\t\t\treturn (max(lmax, x, newmax), list(merge(larr, [x], rarr)))\n\t\telse:\n\t\t\treturn (-1, [])\n\t\n\t\n\t#print(\"running...\")\n\tprint(\" \".join(str(x) for x in f(1, root)[1]))\n\n\n\nif __name__ == \"__main__\":\n\tsolve()\n\t\n\t\n", "from heapq import heappush, heappop, heapify\r\nfrom collections import defaultdict, Counter, deque\r\nfrom functools import lru_cache\r\nimport threading\r\nimport sys\r\nimport bisect\r\ninput = sys.stdin.readline\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\n# threading.stack_size(10**8)\r\n# sys.setrecursionlimit(10**6)\r\n\r\n\r\ndef main():\t\r\n\tn=ri()\r\n\ta=rl()\r\n\ts=set(a)\r\n\th=[-i for i in s]\r\n\theapify(h)\r\n\tres=[]\r\n\twhile 1:\r\n\t\tcr=-heappop(h)\r\n\t\tnx=cr>>1\r\n\t\twhile nx in s:\r\n\t\t\tnx>>=1\r\n\t\tif nx==0:\r\n\t\t\tres.append(-cr)\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\ts.add(nx)\r\n\t\t\theappush(h,-nx)\r\n\tprint(*[-i for i in res+h])\r\n\tpass\t\r\n\r\n# for _ in range(ri()):\r\nmain()\r\n# threading.Thread(target=main).start()\r\n" ]

[ "import math\r\nfrom collections import defaultdict\r\nimport itertools\r\n\r\nPRIME = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97]\r\n\r\n\r\ndef int_sqrt(n):\r\n return int(round(math.sqrt(n)))\r\n\r\n\r\ndef is_2_type(base, divisor):\r\n return [k for k in range(1, 7) if base ** k % divisor == 0]\r\n\r\n\r\ndef is_3_type(base, divisor):\r\n return (base - 1) % divisor == 0\r\n\r\n\r\ndef is_11_type(base, divisor):\r\n return (base + 1) % divisor == 0\r\n\r\n\r\ndef calculate_divisibility_type(base, divisor):\r\n base_factors = defaultdict(int)\r\n divisor_factors = defaultdict(int)\r\n tmp_b = base\r\n tmp_d = divisor\r\n for p in PRIME:\r\n while tmp_b % p == 0:\r\n base_factors[p] += 1\r\n tmp_b //= p\r\n\r\n while tmp_d % p == 0:\r\n divisor_factors[p] += 1\r\n tmp_d //= p\r\n\r\n k = is_2_type(base, divisor)\r\n if k:\r\n return (2, k[0])\r\n\r\n if is_3_type(base, divisor):\r\n return (3, 0)\r\n\r\n if is_11_type(base, divisor):\r\n return (11, 0)\r\n\r\n if len(base_factors) == len(divisor_factors) and list(base_factors.keys()) == list(divisor_factors.keys()):\r\n return (2, max(0, max(divisor_factors[p] - base_factors[p] for p in base_factors.keys())) + 1)\r\n\r\n sqrt_divisor = int_sqrt(divisor)\r\n for d1 in range(2, sqrt_divisor+1):\r\n if divisor % d1 == 0:\r\n q = divisor // d1\r\n if math.gcd(d1, q) == 1:\r\n d2 = q\r\n if is_2_type(base, d1) and (is_3_type(base, d2) or is_11_type(base, d2)):\r\n # print(d1, d2)\r\n return (6, 0)\r\n\r\n if is_3_type(base, d1) and (is_2_type(base, d2) or is_11_type(base, d2)):\r\n # print(d1, d2)\r\n return (6, 0)\r\n\r\n if is_11_type(base, d1) and (is_2_type(base, d2) or is_3_type(base, d2)):\r\n # print(d1, d2)\r\n return (6, 0)\r\n\r\n d2d3 = q\r\n sqrt_d2d3 = int_sqrt(d2d3)\r\n for d2 in range(d1+1, sqrt_d2d3+1):\r\n if d2d3 % d2 == 0 and math.gcd(d1, d2) == 1:\r\n d3 = d2d3 // d2\r\n if math.gcd(d1, d3) == math.gcd(d2, d3) == 1:\r\n possible_cases = [\r\n (dx, dy, dz)\r\n for dx, dy, dz in itertools.permutations([d1, d2, d3])\r\n if is_2_type(base, dx) and is_3_type(base, dy) and is_11_type(base, dz)\r\n ]\r\n if len(possible_cases) == 1:\r\n return (6, 0)\r\n\r\n # print(base_factors, divisor_factors)\r\n\r\n if len(base_factors) == 2 and len(divisor_factors) == 1 and set(base_factors.values()) == {1}:\r\n p1, p2 = base_factors.keys()\r\n if any(p in divisor_factors for p in base_factors.keys()):\r\n return (2, max(divisor_factors[p1], divisor_factors[p2]))\r\n\r\n if len(base_factors) == 1 and len(divisor_factors) == 2 and set(divisor_factors.values()) == {1}:\r\n p1, p2 = divisor_factors.keys()\r\n if any(p in base_factors for p in base_factors.keys()):\r\n return (6, 0)\r\n\r\n return (7, 0)\r\n\r\n\r\nif __name__ == '__main__':\r\n base, divisor = map(int, input().split())\r\n div_type, div_last_digit = calculate_divisibility_type(base, divisor)\r\n print(\"%d-type%s\" % (div_type, \"\" if div_last_digit == 0 else (\"\\n%d\" % div_last_digit)))\r\n", "b, d = map(int, input().split())\r\nfor i in range(1, 10):\r\n if (b**i) % d == 0:\r\n print(\"2-type\")\r\n print(i)\r\n exit()\r\nif (b-1) % d == 0:\r\n print(\"3-type\")\r\n exit()\r\nif (b+1) % d == 0:\r\n print(\"11-type\")\r\n exit()\r\nfor i in range(2, d+1):\r\n if d % i == 0:\r\n x = 1\r\n while d % i == 0: \r\n d /= i \r\n x *= i\r\n if (b**10) % x != 0 and (b+1) % x != 0 and (b-1) % x != 0:\r\n print(\"7-type\")\r\n break\r\nelse:\r\n print(\"6-type\")\r\n" ]

[ "n = int(input())\r\nm = 1 << n\r\np = [list(map(int, input().split())) for i in range(m)]\r\nu, x = [1] * m, [0] * m\r\nv, y = u[:], x[:]\r\nfor i in range(n):\r\n d = 1 << i\r\n for j in range(m):\r\n s = d * (j // d ^ 1)\r\n v[j] = u[j] * sum(u[k] * p[j][k] for k in range(s, s + d)) / 100\r\n y[j] = max(x[s: s + d]) + x[j] + v[j] * d\r\n u, v, x, y = v, u, y, x\r\nprint(max(x))", "n = int(input())\r\n# Using the same index I would for a tree\r\nm = 2**n\r\n\r\npoints = [0]*(2*m)\r\npoints[1] = 2**(n-1)\r\nfor i in range(1,m):\r\n x = points[i]//2\r\n points[2*i] = x\r\n points[2*i+1] = x\r\n\r\n\r\n\r\nP = [[int(x)/100.0 for x in input().split()] for _ in range(m)]\r\nstate = [[0.0]*64 for _ in range(2*m)]\r\n\r\nfor i in range(m):\r\n state[m+i][i] = 1.0\r\n \r\nfor i in reversed(range(1,m)):\r\n for j in range(m):\r\n for k in range(j+1,m):\r\n # x is probability that team j meets team k in match i\r\n x = state[2*i][j]*state[2*i+1][k]\r\n\r\n state[i][j] += P[j][k]*x\r\n state[i][k] += P[k][j]*x\r\n\r\nscore = [[0]*64 for _ in range(2*m)]\r\nfor i in reversed(range(1,m)):\r\n for j in range(m):\r\n for k in range(m):\r\n score[i][j] = max(score[i][j], score[2*i][j]+state[i][j]*points[i] + score[2*i+1][k])\r\n score[i][j] = max(score[i][j], score[2*i+1][j]+state[i][j]*points[i] + score[2*i][k])\r\nprint(repr(max(score[1])))" ]

[ "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 = 1000005\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\r\nfrom collections import defaultdict, deque\r\n\r\ndd = lambda x: defaultdict(lambda: x)\r\n \r\n(n, k), a = minp(), linp()\r\nc, s = dd(0), set(a)\r\nfor e in a : c[e] += 1\r\ni, j = 0, n\r\nwhile len(s) > k :\r\n j -= 1\r\n c[a[j]] -= 1\r\n if c[a[j]] == 0 :\r\n s.remove(a[j])\r\nj -= 1\r\nwhile len(s) == k :\r\n if c[a[j]] > 1 :\r\n c[a[j]] -= 1\r\n j -= 1\r\n elif c[a[i]] > 1 :\r\n c[a[i]] -= 1\r\n i += 1\r\n else :\r\n break\r\nif len(set(a)) < k : print(\"-1 -1\")\r\nelse : print(i+1, j+1)", "kk=lambda:map(int, input().split())\r\nll=lambda:list(kk())\r\n\r\nn,k=kk()\r\nls=ll()\r\ns=set()\r\nfor i in range(n):\r\n\ts.add(ls[i])\r\n\tif len(s) == k:break\r\nelse:\r\n\tprint(-1,-1)\r\n\texit()\r\ns.clear()\r\nfor j in range(i,-1,-1):\r\n\ts.add(ls[j])\r\n\tif len(s)==k:break\r\nprint(j+1, i+1)", "from sys import stdin\r\n\r\n\r\ndef main():\r\n n, k = map(int, stdin.readline().split())\r\n ar = list(map(int, stdin.readline().split()))\r\n d = 0\r\n count = [0] * (10 ** 5 + 1)\r\n start = 0\r\n end = 0\r\n ml = n + 1\r\n ms = -1\r\n me = -1\r\n while end < n:\r\n while end < n and d < k:\r\n count[ar[end]] += 1\r\n if count[ar[end]] == 1:\r\n d += 1\r\n end += 1\r\n while d == k:\r\n if end - start < ml:\r\n ml = end - start\r\n ms = start + 1\r\n me = end\r\n count[ar[start]] -= 1\r\n if count[ar[start]] == 0:\r\n d -= 1\r\n start += 1\r\n print(ms, me)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "[n, k]=list(map(int, input().split()))\r\narr=list(map(int, input().split()))\r\ndct={}\r\nl ,r = 0, 0\r\nwhile(l<=r and r<n):\r\n while(r<n):\r\n val=dct.get(arr[r], 0)\r\n if(val):\r\n dct[arr[r]]=val+1\r\n else:\r\n dct[arr[r]]=1\r\n if(len(dct)==k):\r\n break\r\n r+=1\r\n if(r==n):\r\n print(-1, -1)\r\n break\r\n while(dct[arr[l]]>1):\r\n dct[arr[l]]-=1\r\n l+=1\r\n print(l+1, r+1)\r\n break", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nfre = [0] * (10 ** 5 + 5)\r\nunique = 0\r\nj = 0\r\n \r\nfor i in range(n):\r\n if fre[a[i]] == 0:\r\n unique += 1\r\n \r\n fre[a[i]] += 1\r\n \r\n while unique == k:\r\n fre[a[j]] -= 1\r\n \r\n if fre[a[j]] == 0:\r\n print(j + 1, i + 1)\r\n exit()\r\n \r\n j += 1\r\n \r\nprint('-1 -1')", "n,k=map(int,input().split())\r\nl1=list(map(int,input().split()))\r\nd1={}\r\nfor item in l1:\r\n if item not in d1:\r\n d1[item]=1\r\n else :\r\n d1[item]+=1\r\nif len(d1)<k:\r\n print(-1,-1)\r\nelse :\r\n l=0\r\n r=n-1\r\n x=len(d1)\r\n while 1:\r\n if d1[l1[r]]==1:\r\n if x>k:\r\n x-=1\r\n else :\r\n break\r\n else :\r\n d1[l1[r]]-=1\r\n r-=1\r\n while 1:\r\n if d1[l1[l]]==1:\r\n if x>k:\r\n x-=1\r\n else :\r\n break\r\n else :\r\n d1[l1[l]]-=1\r\n l+=1\r\n print(l+1,r+1)\r\n \r\n \r\n \r\n ", "n, k= map(int, input().split())\r\nA = list(map(int, input().split()))\r\nC = [0] * 100001\r\n\r\nl = 0\r\nr = 0\r\np = 0\r\n\r\nwhile r<n and p < k:\r\n C[A[r]] += 1\r\n if C[A[r]] == 1:\r\n p += 1\r\n r += 1\r\nif p != k:\r\n print('-1', '-1')\r\nelse:\r\n while p == k:\r\n C[A[l]] -= 1\r\n if C[A[l]] == 0:\r\n p -= 1\r\n l +=1\r\n \r\n l -= 1\r\n \r\n print(l+1,r)", "n,k=map(int,input().split())\r\nl=[int(i) for i in input().split()]\r\nif len(set(l))<k:\r\n print('-1 -1')\r\n exit()\r\nvis=[0]*(10**6+7) \r\ni=0\r\nj=0 \r\nc=0 \r\nwhile c<k:\r\n if vis[l[j]]==0: #first visit \r\n c+=1 \r\n vis[l[j]]+=1 \r\n j+=1 \r\nwhile vis[l[i]]>1:\r\n vis[l[i]]-=1 \r\n i+=1 \r\nprint(i+1,j)", "'''input\r\n7 4\r\n4 7 7 4 7 4 7\r\n'''\r\nimport sys\r\nfrom math import *\r\nfrom bisect import *\r\nfrom collections import *\r\nfrom itertools import *\r\nfrom functools import *\r\nfrom heapq import *\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\nn,k = getints()\r\narr = getints()\r\nif len(set(arr))<k: print(\"-1 -1\"),exit(0)\r\nfirst = arr[0]\r\na=b=0\r\nseen = {}\r\nfor i in range(n):\r\n\tseen[arr[i]] = i\r\n\tif len(seen)==k: break\r\n\r\nmini = 9999999999\r\nmaxi = -1\r\nfor k,v in seen.items():\r\n\tmini = min(mini, v)\r\n\tmaxi = max(maxi, v)\r\nprint(mini+1, maxi+1)", "[n, r] = [int(item) for item in input(\"\").split()]\r\narr = [int(item) for item in input(\"\").split()]\r\n\r\n\r\ni = 0\r\nright = -1\r\nseen = {}\r\n\r\nwhile i < n:\r\n if arr[i] not in seen:\r\n seen[arr[i]] = 1\r\n else:\r\n seen[arr[i]] += 1\r\n if len(seen) == r:\r\n right = i\r\n break\r\n i += 1\r\n\r\nif right == -1:\r\n print(-1, -1)\r\nelse:\r\n i = 0\r\n while i < n:\r\n if seen[arr[i]] != 1:\r\n seen[arr[i]] = seen[arr[i]] - 1\r\n else:\r\n break\r\n i += 1\r\n print(i + 1, right + 1)", "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\nfrom decimal import *\nN,M = map(int,input().split())\nA = list(map(int,input().split()))\ns = set()\nnum = 0\nfor i in range(N):\n if A[i] not in s:\n s.add(A[i])\n num+=1\n if num==M:\n l,r = 0,i\n dic = Counter([A[x] for x in range(i+1)])\n for x in range(N):\n if dic[A[x]]>=2:\n dic[A[x]]-=1\n l = x+1\n else:\n break\n print(l+1,r+1)\n exit()\n\nprint(-1,-1)\n ", "# DO NOT EDIT THIS\r\nimport math\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = [int(j) for j in input().split()]\r\narr = [int(j) for j in input().split()]\r\n\r\nx, y = -2, -2\r\n\r\ni, j = 0, 0\r\nobj = {}\r\n\r\nwhile i < len(arr) or j < len(arr):\r\n if len(obj) < k and j < len(arr):\r\n obj[arr[j]] = obj.get(arr[j], 0) + 1\r\n\r\n if len(obj) == k and (x == -2 or y - x > j - i):\r\n x, y = i, j\r\n\r\n j += 1\r\n else:\r\n obj[arr[i]] = obj.get(arr[i], 0) - 1\r\n if obj[arr[i]] == 0:\r\n del obj[arr[i]]\r\n i += 1\r\n\r\n if len(obj) == k and (x == -2 or y - x > j - i - 1):\r\n x, y = i, j - 1\r\n\r\n # print('len', len(obj), obj)\r\n # print('i, j', i, j)\r\n\r\nprint(*[x + 1, y + 1])\r\n\r\n\r\n\r\n", "n, k = map(int,input().split())\nls = list(map(int, input().split()))\ncnt = [0 for _ in range(100005)]\n\ni = 0\nj = 0\ncount = 0\nfound = False\n\nwhile i < n:\n\tcnt[ls[i]] += 1\n\tif cnt[ls[i]] == 1:\n\t\tcount += 1\n\ti += 1\n\tif count == k:\n\t\tfound = True\n\t\tbreak\n\nwhile count == k:\n\tcnt[ls[j]] -= 1\n\tif cnt[ls[j]] == 0:\n\t\tcount -= 1\n\tj += 1\n\nif found:\n\tprint(j, i)\nelse:\n\tprint(-1,-1)\n\t\t\n", "n, k=map(int, input().split())\r\narr=list(map(int, input().split()))\r\nif k==1:\r\n\tprint(1, 1)\r\nelse:\r\n\tmp=[0]*1000000\r\n\thi1=-1\r\n\thi2=-1\r\n\tcoun=0\r\n\tfor i in range(n):\r\n\t\tmp[arr[i]]+=1\r\n\t\tif mp[arr[i]]==1:\r\n\t\t\tcoun+=1\r\n\t\tif coun==k:\r\n\t\t\thi2=i+1\r\n\t\t\tbreak\r\n\tfor i in range(n):\r\n\t\tmp[arr[i]]-=1\r\n\t\tif mp[arr[i]]==0:\r\n\t\t\tcoun-=1\r\n\t\tif coun!=k:\r\n\t\t\thi1=i+1\r\n\t\t\tbreak\r\n\tif hi1!=-1 and hi2!=-1:\r\n\t\tprint(hi1, hi2)\r\n\telse:\r\n\t\tprint(-1, -1)", "cnt = [0] * (10**5 + 1)\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nl = 0\r\nm, resL, resR = 10**6, -2, -2\r\ndiff = 0\r\nfor r in range(0, n):\r\n if cnt[a[r]] == 0:\r\n diff += 1\r\n cnt[a[r]] += 1\r\n while diff == k:\r\n if r - l + 1 < m:\r\n m = r - l + 1\r\n resL = l\r\n resR = r\r\n if cnt[a[l]] == 1:\r\n diff -= 1\r\n cnt[a[l]] -= 1\r\n l += 1\r\n\r\nprint(resL + 1, resR + 1)", "n,k=map(int,input().split())\r\nd={}\r\ncurr=1\r\na=[int(i) for i in input().split()]\r\nfor i in a:\r\n if len(d)==k:\r\n break\r\n d[i]=curr\r\n curr+=1\r\nif len(d)==k:print(min(d.values()),max(d.values()))\r\nelse:print(-1,-1)", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ni=0\r\nj=-1\r\ncnt={}\r\na=n+1\r\nans=[-2,-2]\r\nc=0\r\nwhile(i<n-1 or j<n-1):\r\n #print(i,j,ans)\r\n if(j<i or (c<k and j<n-1)):\r\n j+=1\r\n if l[j] in cnt:\r\n if(cnt[l[j]]==0):\r\n c+=1\r\n cnt[l[j]]+=1\r\n else:\r\n cnt[l[j]]=1\r\n c+=1\r\n else:\r\n i+=1\r\n cnt[l[i-1]]-=1\r\n if(cnt[l[i-1]]==0):\r\n c-=1\r\n if(c>=k):\r\n if (j-i+1 <a):\r\n a=j-i+1\r\n ans=[i,j]\r\n # print(i,j,a,c,cnt)\r\nprint(ans[0]+1,ans[1]+1)", "n,k = map(int, input().split())\r\nl = list(map(int, input().split()))\r\n\r\nd = {}\r\nlast_position = 1\r\nfor item in l:\r\n # print(d)\r\n d[item] = last_position\r\n last_position += 1\r\n if len(d.keys()) == k: # first position for the kth distinct element\r\n print(min(d.values()), max(d.values()))\r\n exit()\r\nprint(-1, -1)\r\n", "n, k = map(int, input().split())\r\ncount = []\r\narr = list(map(int, input().split()))\r\narr1 = [0] * 10**5\r\nflag = False\r\nel = 0\r\nstart = 0\r\nend = 0\r\nfor i in range(n):\r\n\tif arr1[arr[i] - 1] == 0:\r\n\t\tarr1[arr[i] - 1] += 1\r\n\t\tcount.append(1)\r\n\tif len(count) == k:\r\n\t\tend = i\r\n\t\tflag = True\r\n\t\tel = arr[i]\r\n\t\tcount.clear()\r\n\t\tbreak\r\narr1 = [0] * 10**5\r\nj = end\r\nwhile j >= 0:\r\n\tif arr1[arr[j] - 1] == 0:\r\n\t\tarr1[arr[j] - 1] += 1\r\n\t\tcount.append(1)\r\n\tif len(count) == k:\r\n\t\tstart = j\r\n\t\tbreak\r\n\tj -= 1\r\nif flag:\r\n\tprint(f\"{start + 1} {end + 1}\")\r\nelse:\r\n\tprint(\"-1 -1\")", "n, m = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nd = {}\r\ni = 1\r\nfor x in arr:\r\n\tif len(d) == m:\r\n\t\tbreak\r\n\td[x] = i\r\n\ti += 1\r\nif len(d) == m:\r\n\tprint(min(d.values()), max(d.values()))\r\nelse:\r\n\tprint(-1,-1)\r\n", "import sys\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\ndef solve():\r\n\tn, k = mints()\r\n\ta = list(mints())\r\n\tj = 0\r\n\tc = [0]*int(1e5+1)\r\n\th = 0\r\n\tr = (int(1e6),0)\r\n\tfor i in range(n):\r\n\t\twhile j < n and h < k:\r\n\t\t\tc[a[j]] += 1\r\n\t\t\tif c[a[j]] == 1:\r\n\t\t\t\th += 1\r\n\t\t\tj+=1\r\n\t\tif h >= k:\r\n\t\t\tr = min(r, (j-i, i))\r\n\t\tc[a[i]] -= 1\r\n\t\tif c[a[i]] == 0:\r\n\t\t\th -= 1\r\n\tif r[0] >= 1e6:\r\n\t\tprint(-1,-1)\r\n\telse:\r\n\t\tprint(r[1]+1,r[1]+r[0])\r\n\r\nsolve()\r\n", "from sys import stdin,stdout\r\nstdin.readline\r\ndef mp(): return list(map(int, stdin.readline().strip().split()))\r\ndef it():return int(stdin.readline().strip())\r\nfrom collections import defaultdict as dd,Counter as C,deque\r\nfrom math import ceil,gcd,sqrt,factorial,log2,floor\t\r\n# from bisect import bisect_right as br,bisect_left as bl\r\nimport heapq\r\n\r\nn,k = mp()\r\nl = mp()\r\nif len(set(l)) < k:\r\n\tprint(-1,-1)\r\n\texit()\r\nif n == 1 or len(set(l))==1:\r\n\tprint(1,1)\r\n\texit()\r\nd = {}\r\nc = 1\r\nfor i in l:\r\n\tif len(d) == k:\r\n\t\tbreak\r\n\td[i] = c\r\n\tc += 1\r\nif len(d) == k:\r\n\tprint(min(d.values()) , max(d.values()))\r\nelse:\r\n\tprint(-1,-1)\r\n\r\n", "from collections import defaultdict\nn, k = map(int,input().split())\na = list(map(int,input().split()))\nd = defaultdict(int)\nuni = 0\nres = [0, 0]\nfor i in range(n):\n\tif d[a[i]] == 0:\n\t\tuni+= 1\n\t\td[a[i]] = 1\n\t\tif uni == k:\n\t\t\tres[1] = i + 1\n\t\t\tfor j in range(n):\n\t\t\t\tif d[a[j]] - 1 == 0:\n\t\t\t\t\tres[0] = j + 1\n\t\t\t\t\tprint(*res)\n\t\t\t\t\texit()\n\t\t\t\telse:\n\t\t\t\t\td[a[j]]-=1\n\n\telse:\n\t\td[a[i]] += 1\nprint(\"-1 -1\")", "n, k = map(int, input().split())\na = [0] + list(map(int, input().split()))\nfre = [0] * int(1e5 + 5)\nj, count = 0, 0\n\nfor i in range(1, n + 1):\n\tfre[a[i]] += 1\n\t\n\tif fre[a[i]] == 1:\n\t\tcount += 1\n\t\n\twhile count == k:\n\t\tj += 1\n\t\tfre[a[j]] -= 1\n\t\t\n\t\tif fre[a[j]] == 0:\n\t\t\tprint(j, i)\n\t\t\texit()\n\nprint(\"-1 -1\")", "n, k = map(int, input().split())\r\na = [int (el) for el in input().split()]\r\nl = 0\r\nr = n\r\nd = {}\r\nkol = 0\r\nfor i in range(n):\r\n d[a[i]] = d.get(a[i], 0) + 1\r\nkol = len(d)\r\nif kol < k:\r\n print(-1, -1)\r\nelse:\r\n while kol > k or d[a[r - 1]] > 1:\r\n if d[a[r - 1]] == 1:\r\n kol -= 1\r\n d[a[r - 1]] -= 1\r\n r -= 1\r\n while d[a[l]] > 1:\r\n d[a[l]] -= 1\r\n l += 1\r\n print(l + 1, r)\r\n \r\n \r\n", "n,k=map(int,input().split())\r\nl = list(map(int,input().split()))\r\nd={}\r\nj=1\r\nfor i in l:\r\n if(len(d)==k):\r\n break\r\n d[i]=j\r\n j+=1\r\nif(len(d)==k):\r\n print(min(d.values()),max(d.values()))\r\nelse:\r\n print(-1,-1)", "n, k = map(int, input().split())\na = list(map(int, input().split()))\n\ncnt = [0] * (int(1e5) + 1)\ncnt_distinct = 0\n\nfor i in range(n):\n cnt[a[i]] += 1\n if cnt[a[i]] == 1:\n cnt_distinct += 1\n if cnt_distinct == k:\n y = i + 1\n break\n\nif cnt_distinct < k:\n x = -1\n y = -1\nelse:\n for i in range(y):\n cnt[a[i]] -=1\n if cnt[a[i]] == 0:\n cnt_distinct -=1\n if cnt_distinct < k:\n x = i + 1\n break\n\nprint(\"{} {}\".format(x, y))\n\n\n\n", "def rl():\r\n return list(map(int,input().split()))\r\ndef ri():\r\n return int(input())\r\ndef rs():\r\n return input()\r\ndef rm():\r\n return map(int,input().split())\r\n\r\n\r\ndef main():\r\n n,k=rm()\r\n a=rl()\r\n d={}\r\n x=0\r\n for i in range(n):\r\n if a[i] not in d.keys(): x+=1\r\n d[a[i]]=i\r\n if x==k: break\r\n if x<k: return -1,-1\r\n l=n-1\r\n r=0\r\n for _,v in d.items():\r\n l=min(l,v)\r\n r=max(r,v)\r\n return l+1,r+1\r\n\r\n\r\nl,r=main()\r\nprint(l,r)\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nq = max(max(a), n)\r\nl = [0]*q\r\nind = [0]*q\r\nct = 0\r\n\r\nif len(set(a)) < k:\r\n print(\"-1 -1\")\r\nelse:\r\n for i in range(q):\r\n if l[a[i]-1] == 0:\r\n l[a[i]-1] = 1\r\n ind[a[i]-1] = i+1\r\n ct += 1\r\n else:\r\n ind[a[i]-1] = i+1\r\n \r\n if ct == k:\r\n break\r\n \r\n ind.sort()\r\n mn = 0\r\n for i in ind:\r\n if i != 0:\r\n mn = i\r\n break\r\n \r\n mx = ind[-1]\r\n \r\n print(str(mn) + \" \" + str(mx))", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom collections import Counter\r\n\r\nN,K = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nC = Counter(A)\r\n\r\nif len(C)<K:\r\n exit(print(-1,-1))\r\n \r\nl,r = 0,N-1\r\nwhile l<N:\r\n if C[A[l]]>1:\r\n C[A[l]]-=1\r\n elif len(C)>K:\r\n del C[A[l]]\r\n else:break\r\n l+=1\r\n \r\nwhile r>=0:\r\n if C[A[r]]>1:\r\n C[A[r]]-=1\r\n elif len(C)>K:\r\n del C[A[r]]\r\n else:break\r\n r-=1\r\n\r\nprint(l+1,r+1)", "n, k = map(int, input().split())\r\ng = list(map(int, input().split()))\r\ncnj = set()\r\nmapa = {}\r\nini = 0\r\na, b = 0, 3 * n\r\nfor i in range(n):\r\n if g[i] not in cnj:\r\n mapa[g[i]] = 1\r\n cnj.add(g[i])\r\n while len(cnj) > k or (len(cnj) == k and mapa[g[ini]] > 1):\r\n mapa[g[ini]] -= 1\r\n if mapa[g[ini]] == 0:\r\n cnj.remove(g[ini])\r\n ini += 1\r\n else:\r\n mapa[g[i]] += 1\r\n while len(cnj) > k or (len(cnj) == k and mapa[g[ini]] > 1):\r\n mapa[g[ini]] -= 1\r\n if mapa[g[ini]] == 0:\r\n cnj.remove(g[ini])\r\n ini += 1\r\n if len(cnj) >= k:\r\n if b - a > i - ini:\r\n b, a = i, ini\r\nif b - a >= 2 * n:\r\n print(\"-1 -1\")\r\nelse:\r\n print(a + 1, b + 1)# 1698318322.447567", "a = list(map(int, input().split()))\r\ncnt = [0] * int(1e5 + 5)\r\ncount = 0\r\nj = 0\r\nchuoi = list(map(int, input().split()))\r\nchuoi.insert(0, 0)\r\nfor R in range(1, a[0]+1):\r\n cnt[chuoi[R]] +=1\r\n if cnt[chuoi[R]] == 1:\r\n count +=1\r\n while count == a[1]:\r\n j +=1\r\n cnt[chuoi[j]] -=1\r\n if cnt[chuoi[j]] == 0:\r\n print(j, R)\r\n exit() \r\nprint(-1, -1)\r\n\r\n", "stroka = input().split()\r\nn = int(stroka[0])\r\nk = int(stroka[1])\r\narr = [int(i) for i in input().split()]\r\nif len(list(set(arr))) < k:\r\n print('-1 -1')\r\n exit()\r\nif k > n:\r\n print('-1 -1')\r\nelif k == 1:\r\n print('1 1')\r\nelse:\r\n tmp = [0] * 200000\r\n i = 1\r\n l = 0\r\n r = 0\r\n cnt = 0\r\n while r < n:\r\n if tmp[arr[r]] == 0:\r\n cnt += 1\r\n if cnt == k:\r\n break\r\n tmp[arr[r]] += 1\r\n r += 1\r\n while l < r and tmp[arr[l]] > 1:\r\n tmp[arr[l]] -= 1\r\n l += 1\r\n print(l + 1, r + 1)\r\n", "n,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\nfre = [0]* (10**5+5)\r\nunique = 0\r\nj = 0\r\n\r\nfor i in range(n):\r\n if fre[a[i]]==0:\r\n unique+=1\r\n fre[a[i]]+=1\r\n \r\n while unique ==k:\r\n fre[a[j]]-=1\r\n \r\n if fre[a[j]] == 0:\r\n print(j+1,i+1)\r\n exit()\r\n j+=1 \r\nprint(-1,-1) ", "# a = [0]*10\n# a[0] += 1\n# print(type(a[0]))\nnum,k = map(int,input().split())\nlistnum = list(map(int,input().split()))\ncnt = [0]*100001\ncount = 0\n\nfor i in range(num):\n cnt[listnum[i]] = cnt[listnum[i]] +1\n if cnt[listnum[i]] == 1:\n count += 1\n if count == k:\n right = i\n break\nif count != k:\n print(\"-1 -1\")\nelse:\n left = 0\n for i in range(right+1):\n if cnt[listnum[i]] > 1:\n left += 1\n cnt[listnum[i]] = cnt[listnum[i]] - 1\n else:\n print(str(left + 1),str(right + 1))\n exit()", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\ncount = [0] * (10**5 + 1)\r\n\r\ndiff = 0\r\nj = 0\r\nfor i in range(n):\r\n if count[a[i]] == 0:\r\n diff += 1\r\n count[a[i]] += 1\r\n\r\n while diff == k:\r\n count[a[j]] -= 1\r\n if count[a[j]] == 0:\r\n diff -= 1\r\n print(j + 1, i + 1)\r\n exit()\r\n j += 1\r\n\r\nprint(-1, -1)", "N = int(1e5+5)\r\nn, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\ncnt = [0] * N\r\nidx, lim = 0, 0\r\nfor i in range(n):\r\n cnt[arr[i]] += 1\r\n if cnt[arr[i]] == 1:\r\n lim += 1 \r\n if lim == k:\r\n while idx <= i:\r\n cnt[arr[idx]] -= 1\r\n if cnt[arr[idx]] == 0:\r\n print(idx+1, i+1)\r\n exit()\r\n idx += 1\r\nprint('-1 -1')\r\n", "n, k = map(int, input().split())\n\n\na = list(map(int, input().split()))\n\ncnt = [0 for _ in range(10**5+5)]\n\ntotal = 0\n\nj = -1\n\nfor i in range(n):\n cnt[a[i]] += 1\n\n if cnt[a[i]] == 1:\n total += 1\n \n while total == k:\n j += 1\n cnt[a[j]] -= 1\n if cnt[a[j]] == 0:\n print(j+1, i+1)\n exit()\n\n\nprint(-1, -1)\n \n\n", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\narr_count = [0 for _ in range(10**5 + 5)]\r\nunique_number = 0\r\n\r\nll = -1\r\nrr = -1\r\nj = 0\r\n\r\nfor index in range(len(arr)):\r\n if arr_count[arr[index]] == 0:\r\n unique_number += 1\r\n\r\n arr_count[arr[index]] += 1\r\n\r\n if unique_number == k:\r\n while True:\r\n arr_count[arr[j]] -= 1\r\n\r\n if arr_count[arr[j]] == 0:\r\n ll = j + 1\r\n rr = index + 1\r\n break\r\n j += 1\r\n\r\n if ll != -1 and rr != -1:\r\n break\r\n\r\nprint(ll, rr, end=' ')\r\n", "# link: http://codeforces.com/problemset/problem/224/B?fbclid=IwAR22ISYhm6VGLNXgOK1w1OFAMuMcnf_hNqB_dEQrZiG9co3eGuPQmV9Y2-Q\n\nn, k = list(map(int, input().split()))\na = list(map(int, input().split()))\ncount = 0 # total count of different numbers in the segment\ncnt = [0]*(10**5+1)\nfor R in range(n):\n cnt[a[R]] += 1\n if cnt[a[R]] == 1:\n count += 1\n L = 1\n while count == k:\n cnt[a[L-1]] -= 1\n if cnt[a[L-1]] == 0:\n count -= 1\n print(L, R+1)\n exit()\n else:\n L += 1\n\nprint(-1, -1)\n\n'''\nidea: 2 pointers - 2 con trỏ chạy\npseudocode: O(2n) ~ O(n) time complexity\n cnt = [0]*(10^5+1)\n count = 0\n for R = 1 to N:\n cnt[a[R]] += 1\n if cnt[a[R]] == 1:\n count += 1\n \n L = 1\n while count == K: \n cnt[a[L]] -= 1\n if cnt[a[L]] == 0:\n print L R\n Exit()\n else: \n L += 1\n output -1 -1\n'''", "import sys\nfrom typing import Counter\n\n# https://codeforcesladders.firebaseapp.com/?handle=lanadeus\n\n# makefile\n\"\"\"\nrun: code.py\n\tpython code.py < in.txt\nrun-lc: lc.py\n\tpython lc.py < in.txt\nrun-test: test.py\n\tpython test.py < in.txt\n\"\"\"\n\ndef readline():\n return sys.stdin.readline().strip()\n\n\ndef read(t=int):\n s = sys.stdin.readline()\n return list(map(t, s.strip().split(' ')))\n\n\ndef readint():\n return read()[0]\n\nmod = 10**9 + 7\ndef go():\n n, k = read()\n alist = read()\n c = Counter()\n for i,a in enumerate(alist,1):\n c[a] += 1\n if len(c) == k:\n s = 1\n for ss,k in enumerate(alist,1):\n if c[k]-1>=1:\n c[k] -= 1\n else:\n s = ss\n break\n print(s,i)\n return\n print(-1,-1)\ngo()\n", "n, k = map(int, input().replace(\"\\n\", \"\").split(\" \"))\r\narr = list(map(int, input().replace(\"\\n\", \"\").split(\" \")))\r\nl, r = 1, 1\r\ns = dict()\r\nc = 0\r\nfor i in range(n):\r\n # if arr[i] in s.keys():\r\n # s[arr[i]] = i\r\n # else:\r\n # s.add(arr[i])\r\n s[arr[i]] = i\r\n if len(s) == k:\r\n r = max(s.values())\r\n l = min(s.values())\r\n print(f\"{l+1} {r+1}\")\r\n break\r\nif len(s) < k:\r\n print(f\"{-1} {-1}\")", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb={}\r\nfor i in range(n):\r\n b[a[i]]=i+1\r\n if len(b)==k:break\r\nif len(b)==k:\r\n print(min(b.values()),max(b.values()))\r\nelse:\r\n print(-1,-1)\r\n", "n,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\n\r\ncount = 0\r\nb = {}\r\nfor i in range(n):\r\n if a[i] in b:\r\n b[a[i]] += 1\r\n else:\r\n b[a[i]] =1\r\n if b[a[i]] == 1:\r\n count += 1\r\n if count == k:\r\n break\r\n#print(\"i=\", i)\r\n#print(b)\r\n\r\n\r\nfor j in range(n):\r\n if a[j] in b:\r\n b[a[j]] -= 1\r\n# print(\"j=\", j)\r\n# print(b)\r\n if b[a[j]] == 0:\r\n break \r\n# print(\"j=\",j)\r\n \r\nif count != k:\r\n print(\"-1 -1\")\r\nelse:\r\n if n == 1:\r\n print(1,1)\r\n elif n == 2 and count == 2:\r\n print(1,2)\r\n else:\r\n print(j+1,i+1) ", "from math import ceil\nfrom collections import defaultdict, deque\n\nn, k = (int(i) for i in input().split())\nA = [int(i) for i in input().split()]\ndef solve(A, n, k):\n S = set()\n d = 0\n for i in range(n):\n if A[i] not in S:\n d += 1\n S.add(A[i])\n if d == k:\n right = i\n break\n else:\n return None\n\n S = set()\n d = 0\n for i in reversed(range(right + 1)):\n if A[i] not in S:\n d += 1\n S.add(A[i])\n if d == k:\n left = i\n break\n return left + 1, right + 1\n\nres = solve(A, n, k)\nif res is None:\n print(\"-1 -1\")\nelse:\n l, r = res\n print(f\"{l} {r}\")\n\n\n\n", "import sys\r\nimport collections\r\n\r\nn, k = map(int, input().split())\r\nA = list(map(int, input().split()))\r\n\r\nif len(set(A)) < k:\r\n print(-1, -1)\r\n sys.exit(0)\r\n \r\ncounter = collections.Counter()\r\nfront, back = 0, 0\r\nbest = (0, len(A)-1)\r\nwhile front < len(A):\r\n counter[A[front]] += 1\r\n if len(counter) >= k:\r\n while True:\r\n if len(counter) == k and counter[A[back]] == 1:\r\n break\r\n else:\r\n if counter[A[back]] == 1:\r\n del counter[A[back]]\r\n else:\r\n counter[A[back]] -= 1\r\n back += 1\r\n if front - back < best[1] - best[0]:\r\n best = (back, front)\r\n front += 1\r\nprint(best[0]+1, best[1]+1)", "# cook your dish here\r\nn,k=map(int,input().split())\r\na=[int(i) for i in input().split()]\r\nd={}\r\ni=1\r\nfor x in a:\r\n if len(d)==k:\r\n break\r\n d[x]=i\r\n i+=1\r\nif(len(d)==k):\r\n print(min(d.values()),max(d.values()))\r\nelse:\r\n print(\"-1 -1\")", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nif len(set(l))<k:\r\n print('-1 -1')\r\nelse:\r\n \r\n vis=[0]*(10**5+7) \r\n i=0;j=0;c=0\r\n while c<k:\r\n if vis[l[j]]==0:\r\n c+=1 \r\n vis[l[j]]+=1 \r\n j+=1 \r\n while vis[l[i]]>1:\r\n vis[l[i]]-=1 \r\n i+=1 \r\n print(i+1,j)", "from sys import stdin\nfrom collections import defaultdict\n\nn, k = [int(x) for x in stdin.readline().split()]\na = [int(x) for x in stdin.readline().split()]\n\nunique = defaultdict(int)\nl = 0\nans_l = ans_r = -2\n\nfor r in range(n):\n unique[a[r]] += 1\n while len(unique) == k and l < r:\n ans_l, ans_r = l, r\n unique[a[l]] -= 1\n if unique[a[l]] <= 0:\n del unique[a[l]]\n l += 1\n\nif k == 1:\n print(\"1 1\")\nelse:\n print(f'{ans_l + 1} {ans_r + 1}')\n \t \t\t \t \t\t\t \t \t\t\t \t", "n, k = map(int, input().split())\r\narray = list(map(int, input().split()))\r\n\r\ncount = 0\r\nl = 0\r\nr = -1\r\ncnt = [0]*(int(1e5+1))\r\n\r\nfor i in range(0, n):\t\t\t\t #1 2 2 3 ->count = 2, r = 1, cnt [1]=1, [2]=1\r\n\tif cnt[array[i]] == 0:\r\n\t\tcount+=1\r\n\tcnt[array[i]]+=1\r\n\t\r\n\tr+=1\r\n\r\n\tif (count == k):\r\n\t\tbreak\r\n\r\n\t\r\n\r\nfor i in range(0, n):\r\n\tif cnt[array[i]] > 1:\r\n\t\tl+=1\r\n\t\tcnt[array[i]]-=1\r\n\telse:\r\n\t\tbreak\r\n\r\nif count < k:\r\n\tprint('{0} {1}'.format(-1, -1))\r\nelse:\r\n\tprint('{0} {1}'.format(l+1, r+1))", "n, k = map(int, input().split(' '))\nnums = list(map(int, input().split(' ')))\ni = 1\nj = 0\nn = len(nums)\nhash_map = dict()\nhash_map[nums[j]] = j\nwhile i < n and len(hash_map) < k:\n if nums[i] == nums[j]:\n j += 1\n while j < i and hash_map[nums[j]] != j:\n j += 1\n hash_map[nums[i]] = i\n i += 1\nif len(hash_map) == k:\n print(str(j + 1) + ' ' + str(i))\nelse:\n print(\"-1 -1\")", "n,k=map(int,input().split())\na=list(map(int,input().split()))\nsums=0\nr=0\nf=0\nb=[0 for i in range(100005)]\np=2\nfor i in range(n):\n if b[a[i]]:\n continue\n b[a[i]]+=1\n sums+=1\n if sums==k:\n r=i\n f=1\n break\nb=[0 for i in range(100005)]\nsums=0\nfor i in range(r,-1,-1):\n if b[a[i]]:\n continue\n b[a[i]]=1\n sums+=1\n if sums==k:\n l=i\n break\nif f:\n print(l+1,r+1)\nelse:\n print(-1,-1)\n\t\t\t \t \t \t\t\t \t \t \t\t\t", "l = input().split(\" \")\r\nn = int(l[0])\r\nk = int(l[1])\r\nmyList = input().split(\" \")\r\nfor i in range (n):\r\n myList[i] = int(myList[i])\r\ndef solve(n,k,myList):\r\n count = [0]*(100000+1)\r\n dem = 0\r\n for i in range(n):\r\n if count[myList[i]] == 0:\r\n count[myList[i]] += 1\r\n dem += 1\r\n else:\r\n count[myList[i]] += 1\r\n if dem == k:\r\n j = 0\r\n while (True):\r\n if (count[myList[j]] > 1):\r\n count[myList[j]] -= 1\r\n j += 1\r\n else:\r\n print(j+1,i+1)\r\n exit()\r\n if (dem != k):\r\n print(-1,-1)\r\n\r\nsolve(n,k, myList)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\nn, k = map(int, input().split())\r\nw = list(map(int, input().split()))\r\nd = dict()\r\ne = dict()\r\nc = 0\r\nfor j, i in enumerate(w):\r\n if d.get(i, 0) == 0:\r\n c += 1\r\n d[i] = 1\r\n else:\r\n d[i] += 1\r\n if c == k:\r\n for x in range(j, -1, -1):\r\n if e.get(w[x], 0) == 0:\r\n c -= 1\r\n e[w[x]] = 1\r\n else:\r\n e[w[x]] += 1\r\n\r\n if c == 0:\r\n print(x+1, j+1)\r\n break\r\n break\r\nelse:\r\n print(-1, -1)", "from collections import Counter\r\nn, k=[int(v) for v in input().split()]\r\nw=[int(v) for v in input().split()]\r\nq=Counter(w)\r\nc=len(list(q.keys()))\r\na, b=0, n-1\r\nif c<k:\r\n print(-1, -1)\r\nelse:\r\n while c>=k:\r\n if q[w[a]]==1:\r\n if c==k:\r\n pass\r\n else:\r\n q[w[a]]-=1\r\n c-=1\r\n a+=1\r\n continue\r\n else:\r\n q[w[a]]-=1\r\n a+=1\r\n continue\r\n if q[w[b]]==1:\r\n if c==k:\r\n print(a+1, b+1)\r\n break\r\n else:\r\n q[w[b]]-=1\r\n c-=1\r\n b-=1\r\n else:\r\n q[w[b]]-=1\r\n b-=1", "n, k = map(int, input().split())\r\nnums_input = list(map(int, input().split()))\r\nleft = 0\r\nright = 0\r\nnums_current = {}\r\nwhile right < n:\r\n num = nums_input[right]\r\n if num in nums_current:\r\n nums_current[num] += 1\r\n left_val = nums_input[left]\r\n while nums_current[left_val] > 1:\r\n nums_current[left_val] -= 1\r\n if nums_current[left_val] == 0:\r\n del nums_current[left_val]\r\n left += 1\r\n left_val = nums_input[left]\r\n else:\r\n nums_current[num] = 1\r\n if len(nums_current) == k:\r\n break\r\n right += 1\r\nif len(nums_current) < k or len(nums_input) < k:\r\n left = -2\r\n right = -2\r\nprint(f\"{left + 1} {right + 1}\")", "R = lambda:map(int, input().split())\r\nn,k = R()\r\na = [*R()]\r\nl=0\r\ncnt = [0]*int(1e5+5)\r\nk_distinct = 0\r\ncheck=0\r\nfor i in range(n):\r\n cnt[a[i]]+=1\r\n if cnt[a[i]]==1:\r\n k_distinct+=1\r\n \r\n while k_distinct==k:\r\n cnt[a[l]]-=1\r\n if cnt[a[l]]==0:\r\n print(\"%d %d\" % (l+1, i+1))\r\n check=1\r\n break\r\n l+=1\r\n if(check==1):\r\n break\r\nif(check==0):\r\n print(\"-1 -1\")", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.insert(0, 0)\r\nc = [0] * (10**6)\r\ncnt = 0\r\nfor i in range(1, n + 1):\r\n\t# dung mang danh dau de dem so lan xuat hien cua moi so phan biet\r\n\tc[a[i]] += 1\r\n\tif (c[a[i]] == 1):\r\n\t\tcnt += 1 # luu so luong so phan biet\r\n\t# khi so luong so phan biet bang k thi giam so lan xuat hien xuong\r\n\t# dong thoi rut ngan doan do (bo di nhung so bi trung o cac vi tri khac trong mang)\r\n\t# vi du: \r\n\t# 6 3\r\n\t# 1 3 4 1 5 6 \r\n\t# ban dau minh tim duoc doan 1 3 4 1, sau do phai bo di so 1 vi bi trung\r\n\tj = 0\r\n\twhile(cnt == k):\r\n\t\tj += 1\r\n\t\tc[a[j]] -= 1\r\n\t\tif (c[a[j]] == 0):\r\n\t\t\tprint(j, i)\r\n\t\t\texit()\r\nprint(\"-1 -1\")\r\n", "n, k = map(int, input().split())\r\nmax = 10 ** 5 + 1\r\na = list(map(int, input().split()))\r\nfre = [0] * max\r\nunique = 0\r\nl = -1\r\nr = -1\r\nlength = len(a)\r\nfor i in range(length):\r\n if fre[a[i]] == 0:\r\n fre[a[i]] = 1\r\n unique += 1\r\n \r\n if unique == k:\r\n r = i\r\n break\r\n\r\nfor j in reversed(range(r + 1)):\r\n if fre[a[j]] > 0:\r\n k -= 1\r\n fre[a[j]] = 0\r\n if k == 0:\r\n l = j + 1\r\n r = r + 1\r\n print(l, r)\r\n break\r\n\r\nif l == -1:\r\n print(\"-1 -1\")\r\n\r\n", "line1 = list(map(int,input().split()))\r\nline2 = list(map(int,input().split()))\r\nN = line1[0]\r\nK = line1[1]\r\n##print(\"N la {} va k la {}\".format(N,K))\r\n# N = 8 \r\n# K = 3\r\n# a = [1,1,0,1,1,1,1,2]\r\n# a.insert(0,0)\r\nline2.insert(0,0)\r\n\r\nfreq = [0]*100002\r\ncount = 0\r\nstop = False\r\nfor right in range(1,len(line2)):\r\n\tif (stop == False):\r\n\t\tfreq[line2[right]] = freq[line2[right]] + 1\r\n\t\t\r\n\t\tif (freq[line2[right]] == 1):\r\n\t\t\tcount = count + 1\r\n\t\t\r\n\t\tif (right == len(line2) - 1):\r\n\t\t\tif (count < K):\r\n\t\t\t\tprint(\"-1 -1 \")\r\n\t\t\t\tstop = True\r\n\t\t\t\tbreak \r\n\t\t\r\n\t\tleft = 1\r\n\t\t\r\n\t\twhile(count == K):\r\n\t\t\t#shrink left pointer\r\n\t\t\tfreq[line2[left]] = freq[line2[left]] - 1\r\n\t\t\tif (freq[line2[left]] == 0):\r\n\t\t\t\tprint(\"{} {}\".format(left,right))\r\n\t\t\t\tstop = True\r\n\t\t\t\tbreak\r\n\t\t\tleft = left + 1", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\ncount = [0] * (10**5 + 1)\r\nj = 0\r\nnum = 0\r\nwhile j < n and num < k:\r\n if count[a[j]] == 0:\r\n num += 1\r\n count[a[j]] += 1\r\n j += 1\r\n\r\nif num != k:\r\n print(\"-1 -1\")\r\n exit()\r\n\r\ni = 0\r\nwhile True:\r\n count[a[i]] -= 1\r\n if count[a[i]] == 0:\r\n break\r\n i += 1\r\n\r\nprint('{0} {1}'.format(i + 1, j))", "# t = int(input())\r\nt = 1\r\nwhile t:\r\n # n = int(input())\r\n n,k = map(int,input().split())\r\n L = list(map(int,input().split()))\r\n # s = str(input())\r\n start= 0\r\n end= n-1\r\n cnt = {}\r\n i = 0\r\n distinct = 0\r\n while i < n:\r\n if L[i] in cnt:\r\n cnt[L[i]] += 1\r\n else:\r\n cnt[L[i]] = 1\r\n distinct += 1\r\n i += 1\r\n if distinct < k:\r\n print(-1,-1)\r\n else:\r\n while end >= 0:\r\n if distinct < k:\r\n break\r\n else:\r\n cnt[L[end]] -= 1\r\n if cnt[L[end]] == 0:\r\n distinct -= 1\r\n end -= 1\r\n end += 1\r\n cnt[L[end]] += 1\r\n distinct += 1\r\n while start < n:\r\n if distinct < k:\r\n break\r\n else:\r\n cnt[L[start]] -= 1\r\n if cnt[L[start]] == 0:\r\n distinct -= 1\r\n start += 1\r\n start -= 1\r\n cnt[L[start]] += 1\r\n distinct += 1\r\n print(start+1,end+1)\r\n t -= 1", "n,k=input().split()\r\nn=int(n)\r\nk=int(k)\r\na=input().split()\r\na=list(map(int,a))\r\nl,r=-1,-1\r\nleft=1\r\nif k==1:\r\n print(1,1)\r\n exit()\r\nb=set([])\r\nc=set([])\r\ncheck=True\r\nwhile left<n:\r\n if a[left]==a[0]:\r\n left+=1\r\n else:\r\n check=False\r\n l = left\r\n r = left+1\r\n b.add(a[0])\r\n b.add(a[left])\r\n if len(b)==k:\r\n break\r\n for i in range(l,n):\r\n b.add(a[i])\r\n r = i + 1\r\n if len(b)==k:\r\n break\r\n break\r\nif check==False:\r\n for i in range(r-1,l-2,-1):\r\n c.add(a[i])\r\n if len(c)==k:\r\n l=i+1\r\n break\r\n if len(c)==k:\r\n print(l,r)\r\n else:\r\n print(-1,-1)\r\nelse:\r\n print(-1,-1)\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.insert(0,0)\r\ncount = 0\r\nj = 0\r\nc = [0]*int(1e5 + 5)\r\nfor i in range(1, n + 1):\r\n c[a[i]] += 1\r\n\r\n if c[a[i]] == 1:\r\n count += 1\r\n\r\n while count == k:\r\n j += 1\r\n c[a[j]] -= 1\r\n\r\n if c[a[j]] == 0:\r\n print(j, i)\r\n exit()\r\nprint(\"-1 -1\")", "def array(n, k, arr):\r\n l = -1\r\n r = -1\r\n l_set = set()\r\n r_set = set()\r\n\r\n for i in range(n):\r\n r_set.add(arr[i])\r\n if len(r_set) == k:\r\n r = i\r\n break\r\n\r\n for j in range(i, -1, -1):\r\n l_set.add(arr[j])\r\n if len(l_set) == k:\r\n l = j\r\n break\r\n\r\n if l > -1 and r > -1:\r\n return l + 1, r + 1\r\n else:\r\n return l, r\r\n\r\n\r\nfirst_line_input = list(map(int, input().split()))\r\nN = first_line_input[0]\r\nK = first_line_input[1]\r\nA = list(map(int, input().split()))\r\n\r\nl, r = array(N, K, A)\r\nprint(\"%d %d\" % (l, r))\r\n", "def solve():\r\n n, k = map(int, input().strip().split())\r\n a = list(map(int, input().strip().split()))\r\n freq = [0 for _ in range(100005)]\r\n numDiff = 0\r\n for i in range(n):\r\n freq[a[i]] += 1\r\n if freq[a[i]] == 1:\r\n numDiff += 1\r\n if numDiff == k:\r\n for l in range(i + 1):\r\n freq[a[l]] -= 1\r\n if freq[a[l]] == 0:\r\n print(l + 1, i + 1)\r\n return\r\n print(-1, -1)\r\n\r\nsolve()\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nnums = {a[0]: 1}\r\nl = r = 0\r\nminlr = [0, n]\r\n\r\nwhile True:\r\n if len(nums) == k:\r\n if r - l < minlr[1] - minlr[0]:\r\n minlr = [l, r]\r\n nums[a[l]] -= 1\r\n if nums[a[l]] == 0:\r\n del nums[a[l]]\r\n l += 1\r\n elif len(nums) < k:\r\n r += 1\r\n if r == n:\r\n break\r\n if a[r] in nums:\r\n nums[a[r]] += 1\r\n else:\r\n nums[a[r]] = 1\r\n else:\r\n nums[a[l]] -= 1\r\n if nums[a[l]] == 0:\r\n del nums[a[l]]\r\n l += 1\r\n\r\nif minlr[1] == n:\r\n print(-1, -1)\r\nelse:\r\n print(minlr[0] + 1, minlr[1] + 1)\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 Array2():\r\n n,k = invr()\r\n sequence = inlt()\r\n\r\n count_dict = {}\r\n for element in sequence:\r\n if element not in count_dict.keys():\r\n count_dict[element] = 1\r\n else:\r\n count_dict[element] += 1\r\n \r\n if len(count_dict.keys()) < k:\r\n print(str(-1) + ' ' + str(-1))\r\n else:\r\n start_index = 0\r\n end_index = n-1 \r\n end_index_found = False \r\n start_index_found = False \r\n number_of_distinct_elements = len(count_dict.keys())\r\n\r\n for index in range(n-1,-1,-1):\r\n if end_index_found :\r\n break\r\n\r\n element = sequence[index]\r\n count_dict[element] -= 1\r\n\r\n if count_dict[element] == 0:\r\n number_of_distinct_elements -= 1\r\n\r\n if number_of_distinct_elements < k:\r\n end_index = index\r\n end_index_found = True \r\n \r\n for index in range(n):\r\n if start_index_found: \r\n break \r\n\r\n element = sequence[index]\r\n count_dict[element] -= 1 \r\n\r\n if count_dict[element] == 0:\r\n number_of_distinct_elements -= 1\r\n\r\n if number_of_distinct_elements < k:\r\n start_index = index\r\n start_index_found = True \r\n \r\n print(str(start_index+1) + ' ' + str(end_index+1))\r\n\r\nArray2()", "n, k=map(int, input().split())\n\nl=[int(x) for x in input().split()]\n\nd={}\nj=1\nfor x in l:\n\tif len(d)==k:\n\t\tbreak\n\td[x]=j\n\tj+=1\n\t\nif len(d)==k:\n\tprint(min(d.values()), max(d.values()))\nelse:\n\tprint(-1, -1)\n\t\n", "# minimal by inclusion means that any subset cannot satisfy the same requirements (essentially no duplicates at either end)\r\n\r\nn, k = map(int, input().split())\r\nvalues, single, l, r = [int(i) for i in input().split()], set(), -1, -1\r\nfor i in range(n):\r\n single.add(values[i])\r\n if len(single) == k:\r\n l, r = 1, i + 1\r\n break\r\nsingle = set()\r\nfor i in range(r - 1, max(-1, l - 2), -1):\r\n single.add(values[i])\r\n if len(single) == k:\r\n l = i + 1\r\n break\r\n \r\nif len(single) < k:\r\n print(-1, -1)\r\nelse:\r\n print(l, r)\r\n", "def main():\r\n n,k = map(int,input().split())\r\n arr = list(map(int,input().split()))\r\n curr = {}\r\n indices = {}\r\n\r\n if k == 1:\r\n print(1,1)\r\n return\r\n\r\n min_l = -1\r\n min_r = -1\r\n l = 0\r\n \r\n for i in range(n):\r\n if arr[i] not in curr.keys():\r\n curr[arr[i]] = 1\r\n else:\r\n curr[arr[i]] += 1\r\n if len(curr) == k:\r\n r = i\r\n while len(curr) == k:\r\n curr[arr[l]] -= 1\r\n if curr[arr[l]] == 0:\r\n curr.pop(arr[l])\r\n l += 1\r\n l -= 1\r\n min_l = l+1\r\n min_r = r+1\r\n break\r\n \r\n print(min_l,min_r)\r\n \r\n\r\nmain()\r\n", "from collections import Counter\r\n\r\nMAX = 10**5 + 5\r\n\r\ndef solve():\r\n n, k = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n \r\n cnt = Counter()\r\n unique = 0\r\n j = 0\r\n \r\n for i in range(n):\r\n if cnt[a[i]] == 0:\r\n unique += 1\r\n cnt[a[i]] += 1\r\n\r\n while unique == k:\r\n if cnt[a[j]] == 1:\r\n print(j + 1, i + 1)\r\n return\r\n\r\n cnt[a[j]] -= 1\r\n j += 1\r\n \r\n print(-1, -1)\r\n\r\n\r\nsolve()\r\n", "import sys,os \r\nfrom collections import Counter \r\n\r\nn,k=[int(i) for i in input().split()]\r\nl=[int(i) for i in input().split()]\r\n\r\nright=n-1 \r\n\r\nd=Counter(l)\r\nz=len(set(l)) \r\nleft=0 \r\nif(z<k):\r\n print(-1,-1)\r\nelse:\r\n #print('z',z)\r\n while(right>=left):\r\n #print(\"dright\",d[l[right])\r\n if(z>k):\r\n if(d[l[right]]==1):\r\n z-=1\r\n d[l[right]]-=1 \r\n else:\r\n #print('crap')\r\n d[l[right]]-=1 \r\n \r\n right-=1 \r\n #print('right',right)\r\n else:\r\n #print('here',right)\r\n while(d[l[right]]>1 and right>=left):\r\n \r\n d[l[right]]-=1\r\n right-=1 \r\n while(d[l[left]]>1 and left<=right):\r\n \r\n d[l[left]]-=1\r\n left+=1 \r\n break \r\n print(left+1,right+1)\r\n ", "def main():\r\n nk = list(map(int, input(\"\").split()))\r\n aList = list(map(int, input(\"\").split()))\r\n n = nk[0]\r\n k = nk[1]\r\n\r\n cnt = [0] * 10**7\r\n r = 0\r\n l = 0\r\n count = 0\r\n\r\n if (len(set(aList)) < k):\r\n print(\"-1 -1\")\r\n return\r\n\r\n while count < k:\r\n if cnt[aList[r]] == 0:\r\n count += 1\r\n cnt[aList[r]] += 1\r\n r += 1\r\n\r\n while count == k:\r\n if cnt[aList[l]] == 1:\r\n count -= 1\r\n cnt[aList[l]] -= 1\r\n l += 1\r\n print(l, r)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nq={0}\r\ne=0\r\nl=[]\r\nfor i in range(n):\r\n if a[i] not in q:\r\n e+=1\r\n q.add(a[i])\r\n if e==k:\r\n e=0\r\n q={0}\r\n l+=[i]\r\nw=10**5\r\nt=0\r\nfor i in l:\r\n e=0\r\n q={0}\r\n for j in range(i,-1,-1):\r\n if a[j] not in q:\r\n e+=1\r\n q.add(a[j])\r\n if e==k:\r\n if w>len(q):\r\n w=j+1\r\n t=i+1\r\n break\r\nif len(set(a))>=k:print(w,t)\r\nelse:print(-1,-1)\r\n", "n,k=map(int, input().split())\nl,d,j=list(map(int, input().split())),{},1\nfor i in l:\n d[i]=j\n j+=1\n if len(d)==k:\n print(min(d.values()),max(d.values()))\n quit()\nprint('-1 -1')\n\t\t\t\t\t \t\t \t\t\t\t\t\t\t \t\t\t \t\t \t \t\t \t", "from collections import defaultdict\r\nn, k = map(int,input().split())\r\nls = list(map(int,input().split()))\r\ndc1 = defaultdict(int)\r\ndc2 = defaultdict(int)\r\ni = 0\r\nwhile i < n :\r\n dc1[ls[i]] += 1\r\n if len(dc1) == k :\r\n break\r\n i += 1\r\nelse :\r\n print(-1, -1)\r\n exit()\r\nj = i\r\nwhile j >= 0 :\r\n dc2[ls[j]] += 1\r\n if len(dc2) == k :\r\n break\r\n j -= 1\r\nprint(j+1, i+1)", "from collections import deque\r\nn,m=map(int,input().split())\r\no=m\r\na=list(map(int,input().split()))\r\nl=-1\r\np=0\r\nk=set()\r\nfor i in range(n):\r\n if a[i] not in k:\r\n m-=1\r\n k.add(a[i])\r\n if m==0:\r\n l=i\r\n break\r\nif l!=-1:\r\n k=set()\r\n for i in range(l,-1,-1):\r\n if a[i] not in k:\r\n o-=1\r\n k.add(a[i])\r\n if o==0:\r\n p=i\r\n break\r\n print(p+1,l+1)\r\nelse:\r\n print(-1,-1)\r\n", "'''\r\n Auther: ghoshashis545 Ashis Ghosh\r\n College: jalpaiguri Govt Enggineerin College\r\n Date:25/05/2020\r\n\r\n'''\r\nimport sys\r\nfrom collections import deque,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()\r\ndef mi():return map(int,input().split())\r\ndef li():return list(mi())\r\nabc='abcdefghijklmnopqrstuvwxyz'\r\nabd={'a': 0, 'b': 1, 'c': 2, 'd': 3, 'e': 4, 'f': 5, 'g': 6, 'h': 7, 'i': 8, 'j': 9, 'k': 10, 'l': 11, 'm': 12, 'n': 13, 'o': 14, 'p': 15, 'q': 16, 'r': 17, 's': 18, 't': 19, 'u': 20, 'v': 21, 'w': 22, 'x': 23, 'y': 24, 'z': 25}\r\nmod=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\ndef read():\r\n tc=0\r\n if tc:\r\n input=sys.stdin.readline\r\n else:\r\n sys.stdin=open('input1.txt', 'r')\r\n sys.stdout=open('output1.txt','w')\r\n\r\ndef isprime(n):\r\n if(n==1):\r\n return 0\r\n for i in range(2,int(sqrt(n))+1):\r\n if(n%i==0):\r\n return 0\r\n return 1\r\n \r\nn,k=mi()\r\na=li()\r\n\r\nm={}\r\nc=0\r\nif(k==1):\r\n print(\"1 1\")\r\n exit(0)\r\nj=0\r\nf=[0]*100005\r\ncnt=0\r\nfor i in range(n):\r\n if(f[a[i]]==0):\r\n c+=1\r\n f[a[i]]+=1\r\n if(c==k):\r\n if(f[a[i]]==1 and f[a[j]]==1):\r\n print(j+1,i+1)\r\n exit(0)\r\n else:\r\n while(j<i):\r\n f[a[j]]-=1\r\n if(f[a[j]]==0):\r\n c-=1\r\n j+=1\r\n if(c==k and (f[a[i]]==1 and f[a[j]]==1)):\r\n print(j+1,i+1)\r\n exit(0)\r\nprint(\"-1 -1\")\r\n\r\n \r\n ", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\ncount = 0\r\nfre = [0] * (10 ** 5 + 1)\r\nleft = 0\r\nright = 0\r\n# O(n)\r\nwhile right <= n - 1:\r\n value = a[right]\r\n if fre[value] == 0:\r\n count += 1\r\n fre[value] += 1\r\n\r\n while count == k:\r\n value = a[left]\r\n if fre[value] == 1:\r\n print(left + 1, right + 1)\r\n exit(0)\r\n fre[value] -= 1\r\n left += 1\r\n right += 1\r\nprint(-1, -1)", "n,m = map(int,input().split())\r\nlis = list(map(int,input().split()))\r\nd={}\r\nj=1\r\nfor i in lis:\r\n if len(d)==m:\r\n break\r\n d[i]=j\r\n j+=1\r\nif len(d)==m:\r\n print(min(d.values()),max(d.values()))\r\nelse:\r\n print(\"-1 -1\") \r\n\r\n", "from collections import Counter\r\nn,k=map(int,input().split())\r\na=list(map(int,input().split()))[:n]\r\nc=Counter(a)\r\nd=len(c)\r\nl=0\r\nr=0\r\nif d<k:\r\n print(-1,-1)\r\nelse:\r\n for i in range(n-1,-1,-1):\r\n if c[a[i]]-1==0:\r\n d-=1\r\n if d<k:\r\n r=i\r\n d+=1\r\n break\r\n else:\r\n c[a[i]]-=1\r\n for j in range(0,r):\r\n if c[a[j]]-1==0:\r\n d-=1\r\n if d<k:\r\n l=j\r\n break\r\n else:\r\n c[a[j]]-=1\r\n print(l+1,r+1)\r\n \r\n \r\n\r\n", "n, k = map(int,input().split())\r\narr = list(map(int, input().split()))\r\n\r\ndef find_segment(arr, n, k):\r\n f = [0]*100001\r\n L = count = 0\r\n R = -1\r\n while R < n-1:\r\n R += 1\r\n if f[arr[R]] == 0:\r\n count += 1\r\n f[arr[R]] += 1\r\n while count == k:\r\n f[arr[L]] -= 1\r\n if f[arr[L]] == 0:\r\n print(L+1, R+1)\r\n return\r\n L += 1\r\n print(-1,-1)\r\nfind_segment(arr, n, k)", "from collections import defaultdict\r\n\r\nR = lambda: map(int, input().split())\r\nn, k = R()\r\narr = list(R())\r\nj = -1\r\ncnts = defaultdict(int)\r\nl, r = -1, -1\r\nfor i in range(n):\r\n cnts[arr[i]] += 1\r\n while len(cnts) > k or (len(cnts) == k and cnts[arr[j + 1]] > 1):\r\n cnts[arr[j + 1]] -= 1\r\n if not cnts[arr[j + 1]]:\r\n del cnts[arr[j + 1]]\r\n j += 1\r\n if len(cnts) == k and (l == r == -1 or r - l > i - j):\r\n l, r = j, i\r\nprint(' '.join(map(str, [l + 2, r + 1])) if r != -1 else '-1 -1')", "from sys import stdin\r\nfrom collections import defaultdict\r\n\r\nn, k = [int(x) for x in stdin.readline().split()]\r\na = [int(x) for x in stdin.readline().split()]\r\n\r\nunique = defaultdict(int)\r\nl = 0\r\nans_l = ans_r = -2\r\n\r\nfor r in range(n):\r\n unique[a[r]] += 1\r\n while len(unique) == k and l < r:\r\n ans_l, ans_r = l, r\r\n unique[a[l]] -= 1\r\n if unique[a[l]] <= 0:\r\n del unique[a[l]]\r\n l += 1\r\n\r\nif k == 1:\r\n print(\"1 1\")\r\nelse:\r\n print(f'{ans_l + 1} {ans_r + 1}')", "#####################\n#1: Array, \n#R -> ++Count[]\n#L -> --Count[]\nline1 = input().split(\" \")\narr = list(map(int,input().split()))\nn = int(line1[0])\nk = int(line1[1])\ncounts = {}\nl = 0\nr = 0\ncount = 0\nfor i in range(len(arr)):\n if arr[i] in counts:\n counts[arr[i]] += 1\n else:\n count += 1\n counts[arr[i]] = 1\n if count >= k:\n r = i\n break\nfor i in range(len(arr)):\n l = i\n counts[arr[i]] -= 1\n if counts[arr[i]] == 0:\n l = i\n break\nif count < k:\n print(\"-1 -1\")\nelse:\n print(l + 1, r + 1)\n", "import sys\r\nimport math\r\nfrom collections import deque,Counter\r\nfrom sys import stdin\r\n\r\n#sys.setrecursionlimit(10**7)\r\n\r\nint1=lambda x: int(x)-1\r\nstinput=lambda :stdin.readline()[:-1]\r\nii=lambda :int(stinput())\r\nmi=lambda :map(int, stdin.readline().split())\r\nli=lambda :list(mi())\r\nmi1=lambda :map(int1, stdin.readline().split())\r\nli1=lambda :list(mi1())\r\nmis=lambda :map(str, stdin.readline().split())\r\nlis=lambda :list(mis())\r\n\r\nfrom collections import defaultdict\r\n#d=defaultdict(int)\r\n#d=defaultdict(lambda:1)\r\n\r\nimport heapq\r\n#heapq.heapify(hq)\r\n#heapq.heappop(hq)\r\n#heapq.heappush(hq,1)\r\n\r\nmod=10**9+7\r\nMod=998244353\r\nINF=10**18\r\nans=0\r\n\r\nn,m=mi()\r\na=li()\r\nl=0\r\ncnt=0\r\nd=defaultdict(int)\r\nr=-1\r\nwhile cnt<m and r+1<n:\r\n r+=1\r\n if d[a[r]]==0:\r\n cnt+=1\r\n d[a[r]]+=1\r\nif cnt<m:\r\n print(-1,-1)\r\n exit()\r\nans=r-l\r\nansl=l\r\nansr=r\r\nfor l in range(1,n):\r\n d[a[l-1]]-=1\r\n if d[a[l-1]]==0:\r\n cnt-=1\r\n while cnt<m and r+1<n:\r\n r+=1\r\n if d[a[r]]==0:\r\n cnt+=1\r\n d[a[r]]+=1\r\n if cnt==m:\r\n if ans>r-l:\r\n ans=r-l\r\n ansl=l\r\n ansr=r\r\nprint(ansl+1,ansr+1)", "n,k=map(int,input().split())\r\nl1=list(map(int,input().split()))\r\ns=set()\r\nl=-1\r\nr=-1\r\nans=n\r\nif n==1:\r\n if k==1:\r\n print(1,1)\r\n else:\r\n print(-1,-1)\r\nelse:\r\n for i in range(n):\r\n s.add(l1[i])\r\n if len(s)==k:\r\n l=1\r\n r=i+1\r\n break\r\n if l==-1:\r\n print(l,r)\r\n else:\r\n s=set()\r\n for i in range(r-1,max(-1,l-2),-1):\r\n s.add(l1[i])\r\n if len(s)==k:\r\n l=i+1\r\n break\r\n print(l,r)\r\n \r\n \r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\ndiff = 0\r\npos = -1\r\nvalues = {}\r\n\r\nfor i in range(n):\r\n if a[i] in values:\r\n values[a[i]] += 1\r\n else:\r\n values[a[i]] = 1\r\n diff += 1\r\n if diff == k:\r\n pos = i\r\n break\r\n\r\nif pos == -1:\r\n print('-1 -1')\r\nelse:\r\n l = 0\r\n for i in range(pos):\r\n if values[a[i]] != 1:\r\n values[a[i]] -= 1\r\n else:\r\n l = i\r\n break\r\n print(l + 1, pos + 1)", "n, k=map(int, input().split())\r\n \r\nl=[int(x) for x in input().split()]\r\n \r\nd={}\r\nj=1\r\nfor x in l:\r\n\tif len(d)==k:\r\n\t\tbreak\r\n\td[x]=j\r\n\tj+=1\r\n\t\r\nif len(d)==k:\r\n\tprint(min(d.values()), max(d.values()))\r\nelse:\r\n\tprint(-1, -1)\r\n\t", "n, k = map(int, input().split())\nlit = [*map(int, input().split())]\nlit.insert(0, 0)\n\ncnt = 0\ndit = {}\n\nL, R = -1, -1\nfor i in range(1, 1 +n):\n dit[lit[i]] = dit.get(lit[i], 0) + 1\n if dit[lit[i]] == 1: cnt += 1\n if cnt == k:\n R = i\n break\nfor i in range(1, R + 1):\n dit[lit[i]] -= 1\n if dit[lit[i]] == 0:\n L = i\n break\nprint(L, R)\n \t\t \t\t\t\t \t \t\t \t \t\t \t \t", "n, k = list(map(int, input().split()))\narr = list(map(int, input().split()))\n\ncount = [0]*(int(1e5+1))\n\nfor i in arr:\n count[i] += 1\n\ns = sum([1 if i>0 else 0 for i in count])\nif s < k:\n print('-1 -1')\n exit()\n\nr = n-1\nwhile True:\n if count[arr[r]] == 1:\n s -= 1\n if s < k:\n s += 1\n break\n count[arr[r]] -= 1\n r -= 1\n\nl=0\nwhile True:\n if count[arr[l]] == 1:\n s -= 1\n if s < k:\n s += 1\n break\n count[arr[l]] -= 1\n l += 1\n\nprint(l+1, r+1)\n\n", "n,k = tuple(map(int,input().split()))\r\nA = list(map(int,input().split()))\r\nQ = []\r\nB = set()\r\np = -2\r\nt = -2\r\nfor i in range(len(A)):\r\n B.add(A[i])\r\n if len(B) == k:\r\n p = i\r\n break\r\nC = set()\r\nfor i in range(p,-1,-1):\r\n C.add(A[i])\r\n if len(C) == k:\r\n t = i\r\n break\r\nQ.append(t+1)\r\nQ.append(p+1)\r\nprint(*Q)\r\n", "def solve(A, N, K):\r\n for i in range(N):\r\n A[i] = int(A[i])\r\n map = {}\r\n for i in range(N):\r\n map[A[i]] = i\r\n if (len(map) == K):\r\n print(int(min(map.values())) + 1, int(max(map.values())) + 1)\r\n return\r\n print(-1, -1)\r\n\r\nnum_input = input()\r\nnum_input = num_input.split(\" \")\r\nN = int(num_input[0])\r\nK = int(num_input[1])\r\n\r\nA = input()\r\nA = A.split(\" \")\r\n\r\nsolve(A, N, K)", "m,n=map(int,input().split())\r\nl=[int(s) for s in input().split()]\r\nd={}\r\nk1=k2=-1\r\nfor i in range(m):\r\n if l[i] not in d:\r\n d[l[i]]=i\r\n else:\r\n d[l[i]]=i\r\n if len(d)==n:\r\n k2=i+1\r\n break\r\nif k2>0:\r\n for i in range(m):\r\n if d[l[i]]==i:\r\n k1=i+1\r\n break\r\nprint(k1,k2)", "import sys\ninput = sys.stdin.readline\n\n############ ---- Input Functions ---- ############\n\n\ndef inp():\n return(int(input()))\n\n\ndef inlt():\n return(list(map(int, input().split())))\n\n\ndef insr():\n s = input()\n return(list(s[:len(s) - 1]))\n\n\ndef invr():\n return(map(int, input().split()))\n\n\n\n\n[n, k] = inlt()\na = inlt()\n\nseen = {}\nfor i in range(n):\n seen[a[i]] = i+1\n if len(seen) == k:\n break\n\nif len(seen) == k:\n print(min(seen.values()), max(seen.values()))\nelse:\n print(-1, -1)\n\n \t\t\t \t\t\t \t \t \t \t\t\t \t \t\t\t\t\t" ]

[ "k,a,b=list(map(int,input().split()))\r\ns=input()\r\nn=len(s)\r\nif not(k*a<=n<=k*b):\r\n print('No solution')\r\nelse:\r\n c=n//k\r\n d=n%k\r\n j=0\r\n for i in range(k):\r\n print(s[j:j+c+int(i<d)])\r\n j+=c+int(i<d)", "\r\nk,a,b = map(int,input().split())\r\nqo = input()\r\n\r\n\r\n \r\ndef find(word,a,b):\r\n rs = len(word)\r\n\r\n cs = rs/k\r\n\r\n if cs < a or cs > b:\r\n print(\"No solution\")\r\n exit(0)\r\n \r\n for i in range(k):\r\n length = len(word)\r\n index = round(length/(k-i))\r\n\r\n print(word[:index])\r\n word = word[index:]\r\nfind(qo,a,b)\r\n", "k,a,b= map(int, input().split())\r\ns = input()\r\nn = len(s)\r\nif k*a>n or k*b<n:\r\n print(\"No solution\")\r\nelse:\r\n c = 0\r\n o = n//k\r\n m = n%k\r\n for i in range(k):\r\n d = o + (i < m)\r\n print(s[c:c + d])\r\n c+= d\r\n", "k, a, b = map(int, input().split())\r\ns = input()\r\nl = len(s)\r\nif l < k * a or l > k * b:\r\n\tprint(\"No solution\")\r\nelif l == k * a:\r\n\tfor i in range(k):\r\n\t\tprint(s[:a])\r\n\t\ts = s[a:]\r\nelif l == k * b:\r\n\tfor i in range(k):\r\n\t\tprint(s[:b])\r\n\t\ts = s[b:]\r\nelse:\r\n\tarr = [a] * k\r\n\tx = l - k * a\r\n\ti = 0\r\n\twhile x != 0:\r\n\t\tarr[i] += 1\r\n\t\tx -= 1\r\n\t\ti += 1\r\n\t\tif i == k:\r\n\t\t\ti = 0\r\n\tfor j in arr:\r\n\t\tprint(s[:j])\r\n\t\ts = s[j:]", "from sys import stdin\r\n\r\n\r\ndef solution():\r\n input = stdin.readline\r\n k, a, b = map(int, input().split())\r\n s = input().rstrip()\r\n\r\n n = len(s)\r\n minn = k * a\r\n maxx = k * b\r\n\r\n if minn <= n <= maxx:\r\n diff1 = n - minn\r\n diff2 = b - a\r\n try:\r\n l1 = diff1 // diff2\r\n except:\r\n l1 = 0\r\n m = n - minn - (diff2 * l1)\r\n j = 0\r\n\r\n for i in range(k):\r\n if l1:\r\n print(s[j:j + b])\r\n l1 -= 1\r\n j += b\r\n elif m:\r\n print(s[j:j + a + m])\r\n j = j + a + m\r\n m = 0\r\n else:\r\n print(s[j:j + a])\r\n j += a\r\n else:\r\n print(\"No solution\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n solution()\r\n", "k,a,b = map(int,input().split())\r\ns = input()\r\nn = len(s)\r\nx,y = n//k,n%k\r\nitem=1\r\nif y==0:\r\n item=0\r\nif x+item>b or x<a:\r\n print('No solution')\r\n from sys import exit\r\n exit()\r\ne=0\r\nfor i in range(k):\r\n if y>0:\r\n print(s[e:e+x+1])\r\n e+=x+1\r\n y-=1\r\n else:\r\n print(s[e:e+x])\r\n e+=x", "class Solution(object):\r\n def __init__(self):\r\n pass\r\n\r\n\r\n def get_input(self):\r\n self.k, self.a, self.b = map(int, input().split())\r\n self.text = input()\r\n\r\n\r\n def comp_output(self):\r\n n = len(self.text)\r\n if n < (self.k*self.a) or n > (self.k*self.b):\r\n print(\"No solution\")\r\n else:\r\n mean = n/self.k\r\n higher, lower = int(mean) + 1, int(mean)\r\n index = 0\r\n res = []\r\n step = lower\r\n\r\n while self.k > 0:\r\n res.append(self.text[index:index+step])\r\n index += step\r\n n -= step\r\n self.k -= 1\r\n if self.k*higher == n:\r\n step = higher\r\n\r\n for item in res:\r\n print(item)\r\n \r\n\r\n\r\nobj = Solution()\r\nobj.get_input()\r\nobj.comp_output()", "k,a,b=map(int,input().split())\r\ns=input()\r\nif(k*a<=len(s)<=k*b):\r\n\tx=len(s)//k\r\n\ty=len(s)%k\r\n\tl=0\r\n\tr=x+1\r\n\twhile y:\r\n\t\tprint(s[l:r])\r\n\t\tl=r\r\n\t\tr+=x+1\r\n\t\ty-=1\r\n\tr-=1\r\n\twhile r!=len(s):\r\n\t\tprint(s[l:r])\r\n\t\tl=r\r\n\t\tr+=x\r\n\tprint(s[l:r])\t\r\nelse:\r\n\tprint(\"No solution\")", "import sys\r\ndef get_ints(): return list(map(int, sys.stdin.readline().strip().split()))\r\n\r\ndef solve(s,k,a,b):\r\n if len(s) < k*a or len(s) > k*b:\r\n return 0\r\n res = len(s)%k\r\n lenn = len(s)//k\r\n l = 0\r\n ans = []\r\n for i in range(k):\r\n if res:\r\n ans.append(s[l:l+lenn+1])\r\n res-=1\r\n l+= lenn+1\r\n else:\r\n ans.append(s[l:l+lenn])\r\n l+= lenn\r\n return ans\r\n\r\nk, a, b = get_ints()\r\ns = input()\r\nans = solve(s,k,a,b)\r\nif ans:\r\n for i in ans:\r\n print(i)\r\nelse:\r\n print(\"No solution\")\r\n\r\n", "k, a1, b = map(int, input().split())\r\na = list(map(str, input()))\r\ns = k * a1\r\ns1 = k * b\r\nl = 0\r\nt = \"\"\r\nr = len(a) // k\r\nif len(a) > s1 or s > len(a):\r\n print(\"No solution\")\r\nelse:\r\n for i in range(k - 1):\r\n for j in range(r):\r\n t += a[l]\r\n l += 1\r\n print(t)\r\n t = \"\"\r\n for i in range(l, len(a)):\r\n t += a[l]\r\n l += 1\r\n print(t)", "line = list(map(int, input().split()))\r\nk = line[0]\r\na = line[1]\r\nb = line[2]\r\ntext = input()\r\ntextLength = len(text)\r\nif (textLength/k > b or textLength/k < a):\r\n print(\"No solution\")\r\nelse:\r\n avg = textLength // k\r\n splitLength = [avg for i in range(k)]\r\n remaining = textLength % k\r\n for i in range(remaining):\r\n splitLength[i%k]+=1\r\n if (splitLength[0] > b):\r\n print(\"No solution\")\r\n else:\r\n start = 0\r\n for i in range(k):\r\n print(text[start:start+splitLength[i]])\r\n start+= splitLength[i]\r\n", "k, a, b = map(int, input().split())\r\ntext = input()\r\n\r\nif len(text) > k * b:\r\n print(\"No solution\")\r\nelif len(text) < k * a:\r\n print(\"No solution\")\r\nelse:\r\n base = len(text) // k\r\n rCount = len(text) % k\r\n for i in range(k):\r\n if rCount > 0:\r\n print(text[0:(base) + 1])\r\n text = text[base + 1:]\r\n rCount -= 1\r\n else:\r\n print(text[0:(base)])\r\n text = text[base:]\r\n\r\n", "import sys\na,b,c = map(int,sys.stdin.readline().split())\ns = input() #note to self to create sys.stdin.readline() lambda that removes /n\nx = len(s)\nif a*b > x or a*c < x: print(\"No solution\")\nelse:\n d = x//a\n r = x % a\n #r lines of len d+1, a-r lines of len d\n for i in range(a-r):\n print(s[d*i:d*(i+1)])\n inc = (a-r)*d\n for j in range(r):\n print(s[inc+(d+1)*j:inc+(d+1)*(j+1)])\n\n\t\t \t \t \t \t \t \t \t\t\t \t \t\t \t", "k,a,b = map(int,input().split())\r\ns = input()\r\nn = len(s)\r\ndp = [[False]*(n+1)for i in range(k+1)]\r\ndp[0][-1] = True\r\nfor i in range(k):\r\n for j in range(n+1):\r\n if dp[i][j]:\r\n for bb in range(max(0,j-b),max(0,j-a+1)):\r\n dp[i+1][bb] = True\r\nans = []\r\nif dp[-1][0]:\r\n start = 0\r\n for i in range(k,0,-1):\r\n for j in range(a, b+1):\r\n if dp[i-1][j+start]:\r\n start +=j\r\n ans.append(j)\r\n break\r\n ans = reversed(ans)\r\n su = 0\r\n for c in ans:\r\n print(s[su:su+c])\r\n su+=c\r\n\r\nelse:\r\n print('No solution')", "#region Header\r\n#!/usr/bin/env python3\r\n# from typing import *\r\n\r\nimport sys\r\nimport io\r\nimport math\r\nimport collections\r\nimport decimal\r\nimport itertools\r\nimport bisect\r\nimport heapq\r\n\r\n\r\ndef input():\r\n return sys.stdin.readline()[:-1]\r\n\r\n\r\n# sys.setrecursionlimit(1000000)\r\n#endregion\r\n\r\n# _INPUT = \"\"\"# paste here...\r\n# \"\"\"\r\n# sys.stdin = io.StringIO(_INPUT)\r\n\r\n\r\ndef main():\r\n k, a, b = map(int, input().split())\r\n S = input()\r\n N = len(S)\r\n\r\n if N < a*k or b*k < N:\r\n print('No solution')\r\n\r\n else:\r\n L = []\r\n while N > 0:\r\n v = math.floor(N/k)\r\n L.append(v)\r\n N -= v\r\n k -= 1\r\n\r\n a = 0\r\n for l in L:\r\n print(S[a:a+l])\r\n a += l\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "k, a, b = map(int, input().split())\r\ns = input()\r\nn = len(s)\r\none = n//k\r\nif n % k == 0:\r\n if b >= one >= a:\r\n for i in range(0, n, one):\r\n print(s[i:i+one])\r\n else:\r\n print(\"No solution\")\r\nelse:\r\n if b >= one+1 and one >= a:\r\n ost = n%k\r\n post = 0\r\n for i in range(0, n, one):\r\n if ost > 0:\r\n print(s[i+post:i+one+1+post])\r\n ost -= 1\r\n post += 1\r\n else:\r\n print(s[i+post:i+one+post])\r\n else:\r\n print(\"No solution\")", "# -*- coding: utf-8 -*-\n\n[k, a, b] = [int(x) for x in input().split()]\n\ntext = input()\n\ncounter = 0\n\nif len(text) < k * a or len(text) > k * b:\n print(\"No solution\")\nelse:\n for line in range(0, k):\n if line < k - 1:\n for _ in range(0, int(len(text) / k)):\n print(text[counter], end='')\n counter += 1\n print()\n else:\n while counter < len(text):\n print(text[counter], end='')\n counter += 1\n print()\n\n \t \t\t\t\t\t\t\t\t \t\t\t\t \t\t\t \t", "k,a,b = map(int, input().split())\nst = input()\n\nif len(st) < k*a:\n print(\"No solution\")\nelif len(st) > k*b:\n print(\"No solution\")\nelse:\n check = []\n hasSolution = True\n \n for _ in range(k):\n check.append(a)\n \n size = len(st) - k*a\n rem = size//k\n \n for i in range(k):\n check[i] += rem\n \n size -= rem*k\n \n if size != 0:\n ctd = 0\n while size != 0:\n check[ctd] += 1\n size -= 1\n \n hasSolution = True\n for i in range(k):\n if check[i] > b:\n print(\"No solution\")\n hasSolution = False\n \n if hasSolution:\n ini,end = 0,check[0]\n for i in range(k):\n print(st[ini:end])\n ini = end\n \n if i+1 != k: \n end += check[i+1]\n \t \t\t\t\t \t\t \t \t \t\t \t\t \t\t\t\t", "k, a, b = map(int, input().split(' '))\r\nst = input()\r\nln = len(st)\r\nif ln in range(k * a, k * b + 1):\r\n ans = []\r\n q = ln % k\r\n for i in range(k):\r\n ans.append(ln // k)\r\n for i in range(q):\r\n ans[i] += 1\r\n qq = 0\r\n for e in ans:\r\n print(st[qq:qq+e])\r\n qq += e\r\nelse:\r\n print('No solution')\r\n", "k , minLen , maxLen = [int(item) for item in input().split()]\r\nline = input()\r\n_len = len(line)\r\nif k * minLen > _len or k * maxLen < _len:\r\n print('No solution')\r\nelse:\r\n sample = minLen\r\n for i in range(minLen, maxLen + 1):\r\n helper = _len - (i * (k-1))\r\n if minLen <= helper <= maxLen:\r\n sample = i\r\n break\r\n startInd = 0\r\n for i in range(k-1):\r\n print(line[startInd: startInd + sample])\r\n startInd += sample\r\n print(line[startInd:])\r\n\r\n", "def chujnia():\n k, n, m = tuple(list(map(int, input().split())))\n slowo = input()\n lower = k*n\n higher = k*m\n if len(slowo) < lower or len(slowo) > higher:\n print(\"No solution\")\n exit(0)\n ilosc = len(slowo)//k\n reszta = len(slowo) % k\n cp = reszta\n i = 0\n for _ in range(k):\n if cp != 0:\n print(slowo[i:i+ilosc+1])\n i+=ilosc+1\n cp -= 1\n else:\n print(slowo[i:i+ilosc])\n i+=ilosc\n\n\nchujnia()\n", "# Asif Islam - asifislam510\n# Read the number of segments, minimum and maximum segment lengths from input\nnum_segments, min_length, max_length = map(int, input().split())\n\n# Read the input string from input\ninput_str = input()\n\n# Calculate the length of the input string\nstr_length = len(input_str)\n\n# Check if the input string length is within the valid range\nif str_length < min_length * num_segments or str_length > max_length * num_segments:\n print(\"No solution\")\n exit()\n\n# Initialize a list to store segment lengths with minimum length initially\nsegment_lengths = [min_length for _ in range(num_segments)]\n\n# Calculate the remaining characters after allocating minimum lengths to segments\nremaining_chars = str_length - min_length * num_segments\n\n# Distribute remaining characters to segments while respecting the maximum length\nfor i in range(num_segments - 1, -1, -1):\n if remaining_chars <= max_length - min_length:\n segment_lengths[i] += remaining_chars\n break\n else:\n segment_lengths[i] = max_length\n remaining_chars += min_length\n remaining_chars -= max_length\n\n# Initialize a variable to keep track of the current position in the input string\ncurrent_pos = 0\n\n# Print the segments of the input string\nfor length in segment_lengths:\n print(input_str[current_pos:current_pos + length])\n current_pos += length\n\n \t \t \t \t\t \t\t \t\t \t \t \t\t", "k, a, b = map(int, input().split())\r\ns = input()\r\nn = len(s)\r\nif k * a > n:\r\n print('No solution')\r\nelse:\r\n d = n - k * a\r\n v = [a] * k\r\n for i in range(k):\r\n x = min(d, b - a)\r\n v[i] += x\r\n d -= x\r\n if d:\r\n print('No solution')\r\n else:\r\n x = 0\r\n for i in range(k):\r\n print(s[x:x + v[i]])\r\n x += v[i]\r\n", "R = lambda: map(int, input().split())\r\nk, a, b = R()\r\ns = input()\r\nn = len(s)\r\n\r\nif not k * a <= n <= k * b:\r\n print('No solution')\r\nelse:\r\n arr = [n // k] * k\r\n rem = n % k\r\n i = 0\r\n while rem:\r\n arr[i] += 1\r\n rem -= 1\r\n i = (i + 1) % k\r\n st = 0\r\n for l in arr:\r\n print(s[st: st + l])\r\n st += l", "n, minLen, maxLen = [int(item) for item in input().split(' ')]\r\nline = input()\r\nln = len(line)\r\n\r\nif n * minLen > ln or n * maxLen < ln:\r\n print('No solution')\r\nelse:\r\n nl = minLen\r\n for i in range(minLen, maxLen + 1):\r\n helper = ln - (n - 1) * i\r\n if helper <= maxLen:\r\n nl = i\r\n break\r\n st, i = 0, 0\r\n while i < n - 1:\r\n print(line[st:st + nl])\r\n st += nl\r\n i += 1\r\n\r\n print(line[st:])\r\n\r\n\r\n\r\n'''\r\nn=3 minLen=2 maxLen=5\r\nline='abrakadabra'\r\n\r\nn=3 minLen=2 maxLen=5\r\n 012345678910\r\nline='abrakadabra'\r\n\r\n'ab ra kadabra'\r\n\r\n'abr aka dabra'\r\n\r\n'''\r\n", "k,a,b=map(int,input().split())\r\ns=input()\r\nn=len(s)\r\nif(n>=k*a and n<=k*b):\r\n l=[0]*k\r\n for i in range(n):\r\n if(i<k):\r\n l[i]+=1\r\n else:\r\n l[i%k]+=1\r\n m=0\r\n for i in l:\r\n\r\n print(s[m:i+m])\r\n m+=i\r\nelse:\r\n print(\"No solution\")\r\n", "k, a, b = map(int,input().split())\r\nst = input()\r\ni, j = 0, 0\r\nn = len(st)\r\nfirst = 0\r\nif n/k > b or n//k < a:\r\n print(\"No solution\")\r\nelse:\r\n for i in range(k):\r\n if i < n%k:\r\n print(st[first:first+n//k+1])\r\n first = first+ (n//k+1)\r\n else:\r\n print(st[first:first+n//k])\r\n first = first + n//k\r\n\r\n", "k,a,b=[int(a) for a in input().split()]\r\ns=input()\r\nn=len(s)\r\nif a*k>n or b*k<n:\r\n print(\"No solution\")\r\nelse:\r\n b1=n-a*k\r\n c=0\r\n for i in range(n):\r\n if c>=b or (b1==0 and c>=a):\r\n print()\r\n c=0\r\n \r\n print(s[i],end=\"\")\r\n if c>=a:\r\n b1-=1\r\n c+=1", "k,a,b=map(int,input().split())\r\ns=input()\r\nl=len(s)\r\nif l//k<a or l//k+(l%k>0)>b:\r\n print('No solution')\r\nelse:\r\n j=0\r\n for i in range(k):\r\n for _ in range(l//k+(i<l%k)):\r\n print(s[j],end='')\r\n j+=1\r\n print()", "num_lines, low, high = map(int, input().split())\r\ns = input().strip()\r\nn = len(s)\r\nif n < num_lines * low or n > num_lines * high:\r\n print('No solution')\r\n import sys; sys.exit()\r\n\r\nlengths = [ n // num_lines for i in range(num_lines) ]\r\nfor i in range(n % num_lines):\r\n lengths[i] += 1\r\n\r\npos = 0\r\nfor length in lengths:\r\n print(s[pos:pos+length])\r\n pos += length", "k,a,b=map(int,input().split())\r\ns=input()\r\nn=len(s)\r\nif n>k*b or n<k*a:\r\n print(\"No solution\")\r\nelse:\r\n l=n//k\r\n i=0\r\n for _ in range(k-1):\r\n print(s[i:i+l])\r\n i+=l\r\n print(s[i:])", "k, a, b = input().split(' ')\nk, a, b = int(k), int(a), int(b)\nword = input()\nlength = len(word)\nif length/b > k:\n print('No solution')\n exit(0)\nif length/a < k:\n print('No solution')\n exit(0)\na = length//k\ncont = 0\nfor i in range(k):\n if i == k-1:\n print(word[cont: length])\n else:\n print(word[cont: cont+a])\n cont += a\n \t\t\t \t \t\t\t \t\t \t \t\t\t\t \t\t \t\t", "k,a,b=map(int,input().split(' '))\r\ns=input()\r\nl=len(s)\r\nif(l<k*a or l>k*b):\r\n print(\"No solution\")\r\nelse:\r\n n1=l//k\r\n n2=n1+1\r\n n3=k-(l%k)\r\n n4=l%k\r\n cur=0\r\n for i in range(n3):\r\n print(s[cur:cur+n1])\r\n cur+=n1\r\n for i in range(n4):\r\n print(s[cur:cur+n2])\r\n cur+=n2\r\n", "from math import ceil\r\nif __name__==\"__main__\":\r\n k,a,b = map(int, input().split())\r\n s = input()\r\n n = len(s)\r\n #print(n)\r\n if (k*b<n or k*a>n):\r\n print(\"No solution\")\r\n else:\r\n x = n//k\r\n y = n%k\r\n tmp = \"\"\r\n l = x\r\n if(y>0):\r\n l += 1\r\n y -= 1\r\n for i in range(n):\r\n if(i==l):\r\n print(tmp)\r\n tmp = \"\"\r\n l += x\r\n if(y>0):\r\n l+=1\r\n y-=1\r\n tmp += s[i]\r\n print(tmp)\r\n\r\n", "(k, a, b) = map(int, input().split())\nmin_len = k * a\nmax_len = k * b\n\nline = input()\nline_length = len(line)\nprint_index = 0\nif line_length < min_len or line_length > max_len:\n print(\"No solution\")\nelse:\n add_length = line_length - min_len\n distance = b - a\n print_to = 0\n for item in range(0, k):\n add_length -= distance\n if add_length > 0:\n print_to = print_index+a+distance\n else:\n print_to = print_index + a + distance + add_length\n add_length = 0\n\n print(line[print_index:print_to])\n print_index = print_to\n\n \t\t \t \t\t\t\t \t\t\t\t\t \t \t \t", "k, a, b = [int(x) for x in input().split()]\ntext = input()\n\nexact_division = len(text)//k\nrest = len(text)%k\n\nif((rest > 0 and exact_division+1 > b) or exact_division > b or exact_division < a):\n\tprint(\"No solution\")\n\nelse:\n\tfor i in range(k):\n\t\tletters_to_print = exact_division\n\t\tif rest > 0:\n\t\t\tletters_to_print += 1\n\t\t\trest -= 1\n\n\t\tprint(text[:letters_to_print])\n\t\ttext = text[letters_to_print:]\n\t\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\nk,a,b = map(int,input().split())\ns = input()\nn = len(s)\n\ncount = [a]*k\n\nif ( n < a*k or n > b*k):\n\tprint(\"No solution\")\nelse:\n\tn -= a*k\n\ti = 0\n\twhile(n>0):\n\t\tx = min(n,b-a)\n\t\tn -= x\n\t\tcount[i] += x\n\t\ti += 1\n\tstart = 0\n\tfor j in range(k):\n\t\tprint(s[start:start+count[j]])\n\t\tstart = start+count[j]", "num_segments, min_length, max_length = map(int, input().split())\n\ninput_str = input()\n\nstr_length = len(input_str)\n\nif str_length < min_length * num_segments or str_length > max_length * num_segments:\n print(\"No solution\")\n exit()\n\nsegment_lengths = [min_length for _ in range(num_segments)]\n\nremaining_chars = str_length - min_length * num_segments\n\nfor i in range(num_segments - 1, -1, -1):\n if remaining_chars <= max_length - min_length:\n segment_lengths[i] += remaining_chars\n break\n else:\n segment_lengths[i] = max_length\n remaining_chars += min_length\n remaining_chars -= max_length\n\ncurrent_pos = 0\n\nfor length in segment_lengths:\n print(input_str[current_pos:current_pos + length])\n current_pos += length\n\n \t\t\t\t \t\t\t\t\t \t \t \t \t \t\t \t\t\t \t", "k,n,m = map(int,input().split())\r\ns = input()\r\nl=len(s)\r\nif k*n>l or k*m<l:\r\n print(\"No solution\")\r\nelse:\r\n ex = l-k*n\r\n ans=[]\r\n prev=0\r\n for i in range(l):\r\n mm=min(ex,m-n)\r\n ex-=mm\r\n ans.append(s[prev:prev+mm+n])\r\n prev=prev+mm+n\r\n if prev==l:\r\n break\r\n for i in ans:\r\n print(i) \r\n\r\n\r\n", "def solve():\n linha = list(map(int, input().split()))\n palavra = input()\n tam = len(palavra)\n divisoes = linha[0];minimo = linha[1];maximo = linha[2]\n div = tam//divisoes;ini = 0;pos = 0;inicio = 0;listRes = []\n if(tam > (divisoes * maximo) ):\n print(\"No solution\")\n elif(tam < (divisoes*minimo)):\n print(\"No solution\") \n else:\n while pos < (divisoes-1):\n listRes.append(palavra[inicio:inicio+div])\n inicio = inicio + div\n pos = pos+1\n listRes.append(palavra[inicio:])\n for dados in listRes:\n print(dados)\n \nsolve()\n\t \t\t\t\t \t \t \t \t \t\t\t\t \t \t\t", "import math\r\nn,a,b= map(int, input().split())\r\ns=input()\r\nl=len(s)\r\nif l>b*n or l<n*a:\r\n print(\"No solution\")\r\nelse:\r\n d=l-n*a\r\n\r\n var=0\r\n for i in range(n):\r\n diff=min(b-a,d)\r\n print(s[var:var+a+diff])\r\n var+=a+diff\r\n d-=diff\r\n\r\n\r\n\r\n", "k, a, b = [int(i) for i in input().strip().split()]\nword = input().strip()\nsize = len(word)\nif size < a * k or size > k * b:\n print('No solution')\nelse:\n x = size // k\n y = size - k * x\n chunks = [x] * k\n for i in range(size - x * k):\n chunks[i] += 1\n ini = 0\n for i in range(k):\n print(word[ini:ini+chunks[i]])\n ini += chunks[i]\n\n\n\t\t \t \t \t \t\t \t \t\t \t \t\t", "# Problem: E. Anfisa the Monkey\r\n# Contest: Codeforces - School Team Contest #2 (Winter Computer School 2010/11)\r\n# URL: https://codeforces.com/problemset/problem/44/E\r\n# Memory Limit: 256 MB\r\n# Time Limit: 2000 ms\r\n# \r\n# KAPOOR'S\r\n\r\nfrom sys import stdin, stdout \r\n\r\ndef INI():\r\n\treturn int(stdin.readline())\r\n\t\r\ndef INL():\r\n\treturn [int(_) for _ in stdin.readline().split()]\r\n\t\r\ndef INS():\r\n\treturn stdin.readline()\r\n\r\ndef MOD():\r\n return pow(10,9)+7\r\n\t\r\ndef OPS(ans):\r\n\tstdout.write(str(ans)+\"\\n\")\r\n\t\r\ndef OPL(ans):\r\n\t[stdout.write(str(_)+\" \") for _ in ans]\r\n\tstdout.write(\"\\n\")\r\n\r\n\t\r\nif __name__==\"__main__\":\r\n\tk,a,b=INL()\r\n\tS=INS()\r\n\tn=len(S)-1\r\n\tif k*a<=n<=k*b:\r\n\t\ti=0\r\n\t\tfor _ in range(k):\r\n\t\t\tOPS(S[i:i+n//(k-_)])\r\n\t\t\ti+=n//(k-_)\r\n\t\t\tn-=n//(k-_)\r\n\telse:\r\n\t\tOPS(\"No solution\")", "[k, a, b] = list(map(int, input().split()))\r\ns = input()\r\nif a * k <= len(s) <= k * b:\r\n partition = [len(s) // k] * k\r\n answer = []\r\n index = 0\r\n for i in range(len(s) % k):\r\n partition[i] += 1\r\n for j in partition:\r\n answer.append(s[index: index + j])\r\n index += j\r\n for part in answer:\r\n print(part)\r\nelse:\r\n print('No solution')\r\n\r\n\r\n\r\n", "k,a,b = tuple([int(x) for x in input().split(\" \")])\ns = input()\n\nl = len(s)/k\n\nif l < a or l > b:\n print(\"No solution\")\n exit()\nelse:\n line_size = 0\n for line_size in range(a,b+1):\n if (len(s) - line_size*(k-1)) <= b and (len(s) - line_size*(k-1)) >= a:\n break\n for i in range(k-1):\n print(s[i*line_size : (i+1)*line_size])\n print(s[(k-1)*line_size :])\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\n\r\nk, a, b = map(int, input().split())\r\ns = input()[:-1]\r\nn = len(s)\r\n\r\nx = n//k\r\ny = n%k\r\nif y == 0:\r\n if a <= x <= b:\r\n for i in range(0, n, x):\r\n print(s[i:i+x])\r\n else:\r\n print('No solution')\r\nelse:\r\n if a <= x and x+1 <= b:\r\n for i in range(0, y*(x+1), x+1):\r\n print(s[i:i + x + 1])\r\n for i in range(y*(x+1), n, x):\r\n print(s[i:i+x])\r\n else:\r\n print('No solution')", "k,a,b=map(int,input().split())\r\ns=input()\r\nlent=len(s)\r\nif lent>(k*b) or lent<(k*a):\r\n print(\"No solution\")\r\nelse:\r\n dp=[a]*k\r\n rem=lent-(sum(dp))\r\n i=0\r\n while rem>0:\r\n dp[i]+=1\r\n i=(i+1)%k\r\n rem-=1\r\n pref=[0]*(k+1)\r\n pref[1]=dp[0]\r\n for i in range(1,k+1):\r\n pref[i]=pref[i-1]+dp[i-1]\r\n for i in range(1,k+1):\r\n print(s[pref[i-1]:pref[i]])\r\n\r\n\r\n", "k,a,b=map(int,input().split())\r\ns=input()\r\nn=len(s)\r\nx,ans=0,[]\r\nfor i in range(k):\r\n\tfor j in range(a,b+1):\r\n\t\tif a*(k-i-1)<=n-j<=b*(k-i-1):\r\n\t\t\tans.append(s[:j])\r\n\t\t\ts=s[j:]\r\n\t\t\tn-=j\r\n\t\t\tx+=1\r\n\t\t\tbreak\r\nif s!='' or x!=k:print('No solution')\r\nelse:\r\n\tfor i in range(k):print(ans[i])", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nk , a , b = map( int , input( ).split( ) ) \r\ns = input( ) \r\nsi = len( s )\r\nif k * b < si or k * a > si : \r\n print( \"No solution\" ) \r\nelse :\r\n s1 , s2 , l = si//k , si % k , 0\r\n while l < si : \r\n for i in range( s1 ) : \r\n print( s[l] , end= \"\" ) \r\n l += 1\r\n if s2 != 0 : \r\n print( s[l] )\r\n l += 1 \r\n s2 -= 1\r\n else : \r\n print( ) ", "k, a, b = map(int, input().split())\r\ns = input()\r\nm = len(s)\r\nif m < a * k:\r\n print('No solution')\r\nelif b * k < m:\r\n print('No solution')\r\nelse:\r\n p = m - a * k\r\n j = 0\r\n for i in range(k):\r\n t = s[j:j + a]\r\n j += a\r\n if p > 0:\r\n q = min(p, b - a)\r\n t += s[j:j + q]\r\n j += q\r\n p -= q\r\n print(t)\r\n", "k,a,b=map(int,input().split())\r\ns=input()\r\nmin=len(s)//k\r\nrem=len(s)%k\r\nif(k*b<len(s) or k*a>len(s)):\r\n print(\"No solution\")\r\nelse:\r\n ans=[]\r\n ct=0\r\n i=0\r\n temp=\"\"\r\n while(i<len(s)):\r\n if(i%min==0 and i!=0 and ct<k-rem):\r\n ans.append(temp)\r\n temp=\"\"\r\n temp+=s[i]\r\n ct+=1\r\n elif(len(temp)%(min+1)==0 and ct>=k-rem):\r\n ans.append(temp)\r\n temp=\"\"\r\n temp+=s[i]\r\n else:\r\n temp+=s[i]\r\n i+=1\r\n ans.append(temp)\r\n for i in ans:\r\n print(i)", "k, a, b = map(int, input().split())\r\nstring = input()\r\nif a <= len(string) // k + len(string) % k <= b:\r\n for i in range(k - 1):\r\n print(string[i * (len(string) // k):(i + 1) * (len(string) // k)])\r\n print(string[(i + 1) * (len(string) // k):(i + 2) * (len(string) // k) + len(string) % k])\r\nelse:\r\n print(\"No solution\")", "k, min_segment_length, max_segment_length = map(int, input().split())\n\ninput_string = input()\n\nstring_length = len(input_string)\n\nif string_length < min_segment_length * k or string_length > max_segment_length * k:\n print(\"No solution\")\n exit()\n\nsegment_lengths = [min_segment_length for _ in range(k)]\n\nremaining_characters = string_length - min_segment_length * k\n\nfor i in range(k - 1, -1, -1):\n if remaining_characters <= max_segment_length - min_segment_length:\n segment_lengths[i] += remaining_characters\n break\n else:\n segment_lengths[i] = max_segment_length\n remaining_characters += min_segment_length\n remaining_characters -= max_segment_length\n\ncurrent_position = 0\n\nfor length in segment_lengths:\n print(input_string[current_position:current_position + length])\n current_position += length\n \t\t \t\t \t \t \t \t\t\t \t\t\t\t \t\t \t", "k, a, b = map(int, input().split())\r\ns = input()\r\nif len(s) / k < a or len(s) / k > b:\r\n print(\"No solution\")\r\n exit(0)\r\ni, l = 0, len(s) // k\r\nwhile k > 1:\r\n print(s[i:i + l])\r\n i += l\r\n k -= 1\r\nprint(s[i:])\r\n", "k, a, b = map(int, input().split())\r\ns = input()\r\n\r\nbckt = [\"\" for i in range(k)]\r\n\r\nif k*a > len(s) or k*b < len(s):\r\n print(\"No solution\")\r\nelse:\r\n ct = [0]*k\r\n for i in range(k):\r\n ct[i] += a\r\n \r\n rem = len(s) - k*a\r\n for i in range(k):\r\n q = min(rem, b-a)\r\n ct[i] += q\r\n rem -= q\r\n \r\n for i in range(k):\r\n bckt[i] += s[:ct[i]]\r\n s = s[ct[i]:]\r\n \r\n for i in bckt:\r\n print(i)", "k,a,b=map(int,input().split())\r\ns=input().strip()\r\n\r\nn=len(s)\r\nif a*k>n or b*k<n:\r\n print(\"No solution\")\r\nelse:\r\n x=[a]*k\r\n n-=k*a\r\n i=0\r\n while (n>0):\r\n x[i]+=min(n,b-a)\r\n n-=min(n,b-a)\r\n i+=1\r\n i=0\r\n c=0\r\n while (i<len(s)):\r\n print(s[i:i+x[c]])\r\n i+=x[c]\r\n c+=1", "k,a,b = map(int,input().split())\r\ns = input()\r\nif len(s) < k*a or len(s) > k*b :\r\n print(\"No solution\")\r\nelse :\r\n ext = len(s)%k \r\n i, j = 0, len(s)//k\r\n while i < len(s) :\r\n if ext > 0 :\r\n ext -= 1\r\n print(s[i:i+j+1])\r\n i += j+1\r\n else :\r\n print(s[i:i+j])\r\n i += j", "k,a,b = map(int,input().split())\r\nch = input()\r\nl = []\r\nstart = 0\r\nn = len(ch)\r\ntest = 1\r\nif (n < k*a) or (n >k*b) :\r\n print('No solution')\r\nelse :\r\n while k > 0 :\r\n h = max(a,n-(k-1)*b)\r\n print(ch[start : start+h])\r\n start += h\r\n n -= h\r\n k -= 1\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n, a, b = map(int, input().split())\r\ns = input()\r\nif n * a <= len(s) <= n * b:\r\n x, y = divmod(len(s), n)\r\n j = 0\r\n for i in range(n):\r\n print(s[j : j + x + (y > i)])\r\n j = j + x + (y > i)\r\nelse:\r\n print('No solution')", "k, a, b = map(int, input().split())\ns = input()\nsLength = len(s)\nif(sLength>k*b or sLength<k*a):\n print(\"No solution\")\nelse:\n vet = [int(sLength/k)] * k\n max = vet[0]\n vetSum = sum(vet)\n if(vetSum<sLength):\n i = 0\n while(vetSum<sLength and max<=b):\n vet[i]+=1\n vetSum +=1\n if(i==0):\n max+=1\n i+=1\n if(i>=sLength):\n i=0\n else:\n i = 0\n while(vetSum>sLength and max>=a):\n vet[i]+=1\n vetSum -=1\n if(i==0):\n max-=1\n i+=1\n if(i>=sLength):\n i=0\n if(vetSum==sLength):\n # print(\"dá\")\n # print(vet)\n # print(\"s: \", s)\n i = 0\n for j in vet:\n print(s[i:j+i])\n i+=j\n else:\n print(\"No solution\")\n\n \t\t\t\t\t \t \t\t \t\t \t \t \t\t \t\t", "k,a,b=map(int,input().split())\r\ns=input()\r\nif a>b:\r\n a,b=b,a\r\nif len(s)>b*k or len(s)<a*k:\r\n print('No solution')\r\n exit() \r\ns1=[a]*k \r\nrem=len(s)-a*k \r\nfor i in range(k):\r\n if rem==0: break\r\n if rem>=b-a:\r\n s1[i]+=(b-a)\r\n rem-=(b-a)\r\n else:\r\n s1[i]+=(rem)\r\n rem=0 \r\nprev=0 \r\n#print(s1)\r\nfor i in s1:\r\n print(s[prev:prev+i])\r\n prev+=i", "k,a,b=map(int,input().split())\r\ns=list(input())\r\nn=len(s)\r\nif n<k*a or n>b*k:\r\n print(\"No solution\")\r\n exit(0)\r\ny=(n-a*k)//k\r\nz=(n-a*k)%k\r\nl=[a+y]*k\r\nfor i in range(z):\r\n l[i]+=1 \r\nfor i in range(1,k):\r\n l[i]=l[i]+l[i-1]\r\n#print(s[:16]) \r\nprint(''.join(s[:l[0]]))\r\nfor i in range(1,k):\r\n print(''.join(s[l[i-1]:l[i]]))\r\n\r\n", "k,a,b=map(int,input().split())\r\nS=input().strip()\r\n\r\nLEN=len(S)\r\n\r\nif a*k<=LEN<=b*k:\r\n pass\r\nelse:\r\n print(\"No solution\")\r\n exit()\r\n\r\nANS=[\"\"]*k\r\n\r\nx=LEN//k\r\ny=LEN%k\r\nALIST=[x]*k\r\nfor i in range(y):\r\n ALIST[i]+=1\r\n \r\nnow=0\r\nfor i in range(k):\r\n ANS[i]=S[now:now+ALIST[i]]\r\n now+=ALIST[i]\r\n\r\nfor s in ANS:\r\n print(s)\r\n \r\n", "k, a, b = map(int, input().split())\r\nword = input()\r\n\r\nminimum = k * a\r\nmaximum = k * b\r\nif len(word) < minimum:\r\n print(\"No solution\")\r\nelif len(word) > maximum:\r\n print(\"No solution\")\r\nelse:\r\n i = 0\r\n for r in range(k):\r\n rest = len(word) - i\r\n\r\n l = min(b, rest - a * (k - r - 1))\r\n\r\n print(word[i:i+l])\r\n i += l\r\n", "k, a, b = map(int, input(). split())\r\ns = input()\r\nn = len(s)\r\nif n > k * b or n < k * a:\r\n print('No solution')\r\nelse:\r\n t = n // k\r\n q = n % k\r\n last = 0\r\n while k != 0:\r\n if q > 0:\r\n print(s[last: last + t + 1])\r\n last += t + 1\r\n q -= 1\r\n else:\r\n print(s[last: last + t])\r\n last += t\r\n k -= 1", "k, a, b = tuple(int(x) for x in input().split())\ntext = input()\nn = len(text)\nif k * b < len(text) or k * a > len(text):\n print(\"No solution\")\n exit(0)\nindex = 0\nlines = []\nwhile (n - index != 0):\n avg = (n - index) // k\n lines.append((index, index + avg))\n index = index + avg\n k -= 1\nfor line in lines:\n print(text[line[0]:line[1]])\n\t\t \t \t\t \t\t\t \t \t \t\t \t\t", "k, a, b = map(int, input().split())\ns = input()\nn = len(s)\n\nMAXN = 202\n\nwas = [[False for i in range(MAXN)] for j in range(MAXN)]\nprev = [[None for i in range(MAXN)] for j in range(MAXN)]\n\nwas[0][0] = True\n\nfor sz in range(n):\n for num_div in range(sz + 1):\n if was[sz][num_div] is False:\n continue\n for next_len in range(a, b + 1):\n if sz + next_len > n:\n break\n was[sz + next_len][num_div + 1] = True\n prev[sz + next_len][num_div + 1] = next_len\n\n\nif not was[n][k]:\n print('No solution')\nelse:\n res = []\n while k > 0:\n sz = prev[n][k]\n res.append(s[n - sz:n])\n k -= 1\n n -= sz\n print('\\n'.join(res[::-1]))\n\n\n", "k, a, b = map(int, input().split())\ns = input()\n\nn = len(s)\nif n < a * k or n > b * k:\n print(\"No solution\")\n exit()\n\nx = [a for _ in range(k)]\nn -= a * k\nfor i in range(k - 1, -1, -1):\n if n <= b - a:\n x[i] += n\n break\n else:\n x[i] = b\n n += a\n n -= b\n\nm = 0\nfor i in range(k):\n print(s[m:m+x[i]])\n m += x[i]\n\n\t\t\t\t \t \t \t\t\t\t\t \t\t\t\t \t\t\t\t\t\t \t \t\t", "k,a,b = map(int,input().split())\r\ns = input()\r\nn = len(s)\r\nif k * a > n or k * b < n:\r\n print(\"No solution\")\r\nelse:\r\n num = n // k\r\n num2 = num + 1\r\n num4 = n % k\r\n num3 = k - num4\r\n for i in range(num3):\r\n print(s[i*num:(i+1)*num])\r\n num5 = num*num3\r\n for i in range(num4):\r\n print(s[num5+i*num2:num5 + (i+1)*num2])\r\n", "\r\nk,a,b = map(int,input().split(\" \"))\r\n\r\ns = input()\r\n\r\nn = len(s);\r\n\r\nif n < k*a or n > k*b :\r\n print(\"No solution\")\r\n exit()\r\n\r\nm = n//k\r\nr = n%k\r\n\r\nj = 0;\r\n\r\nfor i in range(r) :\r\n print(s[j:j+m+1])\r\n j += m+1\r\nfor i in range(r,k) :\r\n print(s[j:j+m])\r\n j += m\r\n\r\n", "k, a, b = map(int, input().split())\ns = input()\ns_len = len(s)\n\nif s_len < a * k or b * k < s_len:\n print('No solution')\n\nelse:\n n = s_len - a * k\n m = 0\n for i in range(k):\n res = s[m:m + a]\n m += a\n if n > 0:\n q = min(n, b - a)\n res += s[m:m + q]\n m += q\n n -= q\n print(res)\n \t \t \t \t \t\t\t \t\t\t \t \t\t \t", "\n\nk, a, b = map(int, input().split(' '))\ntext = input()\n\nrest_of_text = len(text) % k\nmin_each_line = int(len(text)/k)\nif min_each_line < a:\n print(\"No solution\")\nelse:\n if min_each_line + rest_of_text > b:\n print(\"No solution\")\n else:\n extra_text = rest_of_text\n index_text = 0\n for i in range(k):\n line = text[index_text: (index_text + min_each_line)]\n if extra_text > 0:\n line += text[index_text + min_each_line]\n extra_text -= 1\n index_text += 1\n index_text += min_each_line\n print(line)\n\t\t \t \t\t \t \t \t \t\t\t \t\t\t \t", "k, a, b = map(int, input().split())\r\ntext = input()\r\nlength = len(text)\r\n\r\nif length/k < a or length/k > b:\r\n print(\"No solution\")\r\n exit()\r\n\r\ns = 0\r\nans = []\r\n\r\nfor a in range(k):\r\n # print(s)\r\n if a == k - 1:\r\n ans.append(text[s : ])\r\n else:\r\n ans.append(text[s : s + length // k])\r\n s += length // k\r\n\r\nfor an in ans:\r\n print(an)\r\n \r\n\r\n", "\r\nk,a,b=map(int,input().split())\r\ns=str(input())\r\n\r\nif k*a<=len(s)<=k*b:\r\n rem = len(s)\r\n start=0\r\n\r\n for i in range(k):\r\n\r\n to_pr = rem//(k-i)\r\n for j in range(start,start+to_pr):\r\n print(s[j],end=\"\")\r\n print()\r\n\r\n rem-=to_pr\r\n start+=to_pr\r\n\r\nelse:\r\n print(\"No solution\")", "def main():\n k, a, b = map(int, input().split())\n s = input()\n\n if k * b < len(s) or k * a > len(s):\n print(\"No solution\")\n return\n\n sizes = [a for i in range(k)]\n currSize = len(s) - (k * a) \n i = 0\n\n while(currSize > 0):\n if sizes[i] < b:\n sizes[i] += 1\n currSize -= 1\n elif i < k:\n i += 1\n else:\n print(\"No solution\")\n return\n \n start = 0\n end = 0\n for size in sizes:\n end += size\n print(s[start:end])\n start = end\nmain()\n\t\t \t \t \t \t \t \t \t \t\t\t\t", "k,a,b=map(int,input().split())\r\ns=input()\r\nif(k*a>len(s) or k*b<len(s)):\r\n print(\"No solution\")\r\nelse:\r\n ch=0\r\n a,b=divmod(len(s),k)\r\n for i in range(k):\r\n p=a+(i<b)\r\n print(s[ch:ch+p])\r\n ch=ch+p\r\n", "num_lines, low, high = map(int, input().split())\ns = input().strip()\nn = len(s)\nif n < num_lines * low or n > num_lines * high:\n print('No solution')\n import sys; sys.exit()\n\nlengths = [ n // num_lines for i in range(num_lines) ]\nfor i in range(n % num_lines):\n lengths[i] += 1\n\npos = 0\nfor length in lengths:\n print(s[pos:pos+length])\n pos += length\n", "from sys import stdin\r\nimport math\r\n\r\nk,a,b = list(map(int, stdin.readline().rstrip().split(' ')))\r\nstr = stdin.readline().rstrip()\r\n\r\nif k*a > len(str):\r\n print('No solution')\r\n exit()\r\n \r\nif k > len(str):\r\n print('No solution')\r\n exit()\r\n \r\nif k*b < len(str):\r\n print('No solution')\r\n exit()\r\n\r\nwith_even_lines = k * a\r\nafter_even_lines = len(str) - with_even_lines\r\n\r\nl = 0\r\nfor _ in range(k):\r\n line_size = a\r\n if after_even_lines > 0:\r\n line_size += after_even_lines\r\n line_size = min(b, line_size)\r\n after_even_lines -= (line_size - a)\r\n print(str[l:l+line_size])\r\n l += line_size", "k, a, b = map(int, input().split())\ns = input()\ns_len = len(s)\n\nsize = s_len // k\nrest = s_len % k\n\nif size < a or size > b or (size == b and rest > 0) or rest > b:\n print(\"No solution\")\nelse:\n index = 0\n while index < s_len:\n if rest == 0:\n print(s[index: index + size])\n index = index + size\n\n elif size + rest <= b:\n print(s[index:index + size + rest])\n index = index + size + rest\n rest = 0\n else:\n count = rest - (size + rest - b)\n print(s[index:index + size + count])\n index = size + count\n rest -= count\n\n \t \t \t \t \t \t \t \t\t\t \t\t\t\t \t\t", "k,a,b=map(int,input().split())\r\nss=input()\r\nh=len(ss)\r\nq,r=divmod(h,k)\r\nif q<a or q>b or (q==b and r>0):\r\n print('No solution')\r\nelse:\r\n i=0\r\n while r>0:\r\n print(ss[i:i+q+1])\r\n r-=1\r\n i=i+q+1\r\n while i<h:\r\n print(ss[i:i+q])\r\n i=i+q\r\n \r\n", "k,a,b = map(int, input().split())\r\ns=input()\r\nlength = len(s)\r\nif length < a*k or length > b*k:\r\n print(\"No solution\")\r\n quit()\r\nparts=[a]*k\r\nlength -= a*k\r\ncur=0\r\nwhile length > 0:\r\n if length < b-a:\r\n parts[cur] += length\r\n length = 0\r\n else:\r\n parts[cur] += b-a\r\n length -= (b-a)\r\n cur += 1\r\nfor part in parts:\r\n print(s[:part])\r\n s = s[part:]", "k, a, b = map(int, input().rstrip().split())\ns = input()\nn = len(s)\nif n < k * a or n > k * b:\n print(\"No solution\")\n exit()\ndp = [a] * (k)\nleft = n - a * k\ni = 0\nwhile left > 0:\n x = min(b - a, left)\n dp[i] += x\n left -= x\n i += 1\nst = 0\nfor i in dp:\n print(s[st:st + i])\n st += i", "k, a, b = map(int, input().split())\r\ns = input()\r\nn = len(s)\r\nd = [[-1]*(k+1) for _ in range(n+1)]\r\ndef dp(n, k):\r\n if d[n][k] != -1:\r\n return d[n][k]\r\n if k==0:\r\n if n==0:\r\n return (True, [])\r\n else:\r\n return (False, [])\r\n else:\r\n if n<=0:\r\n return (False, [])\r\n ans = []\r\n found = False\r\n for i in range(a, b+1):\r\n flag, l = dp(n-i, k-1)\r\n d[n-i][k-1] = (flag, l)\r\n if flag:\r\n found = True\r\n ans = [i]+l\r\n break\r\n d[n][k] = (found, ans)\r\n return d[n][k]\r\n\r\nflag , ans = dp(n, k)\r\nif flag:\r\n i = 0\r\n for x in ans:\r\n print(s[i:i+x])\r\n i += x\r\nelse:\r\n print(\"No solution\")\r\n", "k, a, b = list(map(int, input().split()))\ns = input()\n\nif (b*k < len(s) or a*k > len(s)):\n print(\"No solution\")\n exit()\n\ndiv_result = len(s) // k\nmod = len(s) % k\nlast = 0\nfor i in range(k):\n if (i < mod):\n print(s[last:last+div_result+1])\n last = last+div_result+1\n else:\n print(s[last:last+div_result])\n last = last+div_result\n", "def get_ints(): return list(map(int, input().split()))\r\ndef get_floats(): return list(map(float, input().split()))\r\n\r\nK,a,b = get_ints()\r\ns = input()\r\nN = len(s)\r\n\r\nif a*K > N or b*K < N:\r\n print(\"No solution\")\r\n exit()\r\n\r\ncap = N - K*a\r\ncurr = 0\r\nfor i in range(K):\r\n extra = min(b-a, cap)\r\n print(s[curr : curr + a + extra])\r\n curr += a + extra\r\n cap -= extra", "\r\nimport sys,random,bisect\r\nfrom collections import deque,defaultdict\r\nfrom heapq import heapify,heappop,heappush\r\nfrom itertools import permutations\r\nfrom math import gcd,log\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\n\r\nk,a,b=li()\r\n\r\ns=input()\r\ns=list(s)[::-1]\r\nn=len(s)\r\n\r\nif n>b*k or n<a*k:\r\n print(\"No solution\")\r\nelse:\r\n m=n//k\r\n n%=k\r\n for i in range(n):\r\n for j in range(m+1):\r\n print(s.pop(),end=\"\")\r\n print()\r\n for i in range(k-n):\r\n for j in range(m):\r\n print(s.pop(),end=\"\")\r\n print()\r\n\r\n\r\n \r\n\r\n", "ch=input()\r\nL=[int(i)for i in ch.split()]\r\nk=L[0]\r\na=L[1]\r\nb=L[2]\r\n\r\nch2=input()\r\nn=len(ch2)\r\nL3=[n//k]*k\r\nsomme=k*(n//k)\r\ni=0\r\nwhile somme!=n:\r\n L3[i]+=1\r\n i+=1\r\n somme+=1\r\n \r\nif L3[0]>b or L3[-1]<a:\r\n print(\"No solution\")\r\nelse:\r\n j=0\r\n \r\n \r\n for i in range(len(L3)):\r\n print(ch2[j:j+L3[i]])\r\n j+=L3[i]\r\n\r\n", "def main():\n k, a, b= [int(i) for i in input().split()]\n \n letters = input()\n\n length = len(letters)\n\n if(k*a>length or length>k*b):\n print('No solution')\n\n else:\n n = length//k\n r = length%k\n\n val = 0\n aux = 0\n for i in range(k):\n if(r > 0):\n end = val + n + 1\n aux = n + 1\n r -= 1\n else:\n end = val + n\n aux = n\n\n print(letters[val:end])\n\n val += aux\nmain()\n \t \t\t \t \t\t\t\t \t \t \t", "def readList():\r\n return [int(i) for i in input().split()]\r\nk, a, b = readList()\r\ns = input()\r\nif len(s) > k * b or len(s) < k * a:\r\n print('No solution')\r\n exit()\r\nmid = len(s) // k\r\ncur = 0\r\nwhile k - 1:\r\n k -= 1\r\n print(s[cur:cur + mid])\r\n cur += mid\r\nprint(s[cur:])\r\n" ]

[ "n = int(input())\r\np = list(map(lambda x: int(x)-1, input().split()))\r\nb = list(map(int, input().split()))\r\ncp = 0\r\nz = [True]*n\r\nold = -1\r\nnn = n\r\nwhile nn:\r\n cp += 1\r\n cur = next(i for i in range(old + 1, n) if z[i])\r\n old = cur\r\n while(z[cur]):\r\n z[cur] = False\r\n nn -= 1\r\n cur = p[cur]\r\nif cp == 1: cp = 0\r\ncb = 1 - (sum(b) & 1)\r\nprint(cb + cp) ", "def solve(a,b):\r\n n=len(a)\r\n vs=[0]*(n+1)\r\n for i in range(n):\r\n a[i]-=1\r\n tmp=0\r\n for i in b:\r\n if i==1:\r\n tmp+=1\r\n ans=0\r\n for i in range(n):\r\n if vs[i]==0:\r\n ans+=1\r\n j=i\r\n while vs[j]==0:\r\n vs[j]=1\r\n j=a[j]\r\n if ans==1:\r\n ans=0\r\n if tmp%2==0:\r\n ans+=1\r\n return ans\r\n\r\nn=input()\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nprint(solve(a,b))\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 a = -a\r\n k = a // b\r\n k = -k\r\n return k\r\n# arr=list(map(int, input().split()))\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\n\r\n\r\ndef main():\r\n n=int(input())\r\n arr=list(map(int, input().split()))\r\n b=list(map(int, input().split()))\r\n ans=1-(sum(b)%2)\r\n for i in range(n):\r\n arr[i]-=1\r\n vis=[0]*n\r\n cycs=0\r\n for i in range(n):\r\n if(vis[i]):\r\n continue\r\n vis[i]=1\r\n curr=arr[i]\r\n while(curr!=i):\r\n vis[curr]=1\r\n curr=arr[curr]\r\n cycs+=1\r\n if(cycs!=1):\r\n ans+=cycs\r\n print(ans)\r\nmain()\r\n", "#!/usr/bin/env python3\nfrom sys import stdin, stdout\n\ndef rint():\n return map(int, stdin.readline().split())\n#lines = stdin.readlines()\n\nn = int(input())\np = list(rint())\nb = list(rint())\np = [ i-1 for i in p]\nv = [0]*n\nloop = 0\nfor i in range(n):\n if v[i]:\n continue\n loop += 1\n while v[i] == 0:\n v[i] = 1\n i = p[i]\nans = 0\nif loop != 1:\n ans += loop\n\nif sum(b)%2 == 0:\n ans += 1\n\nprint(ans)\n", "n = int(input())\np = map(int, input().split())\np = [x - 1 for x in p]\nb = map(int, input().split())\ns = int(sum(b))\n\nc = 0\ndone = set()\nfor i in range(n):\n if i not in done:\n c += 1\n j = i\n while j not in done:\n done.add(j)\n j = p[j]\nmodif = 0\nif c > 1:\n modif = c\nres = modif + (s + 1) % 2\nprint(res)\n", "from sys import stdin, stdout\r\n\r\nn = int(stdin.readline())\r\nnumbers = list(map(int, stdin.readline().split()))\r\nmask = list(map(int, stdin.readline().split()))\r\nvisit = [0 for i in range(n + 1)]\r\n\r\nvalue = 1\r\nfor i in range(1, n + 1):\r\n if not visit[i]:\r\n u = i\r\n \r\n while not visit[u]:\r\n visit[u] = value\r\n u = numbers[u - 1]\r\n \r\n value += 1\r\n \r\n\r\nif max(visit) == 1:\r\n ans = (sum(mask) + 1) % 2\r\nelse:\r\n ans = (sum(mask) + 1) % 2 + max(visit)\r\n \r\nstdout.write(str(ans))", "n = int(input())\np = [int(i) for i in input().split()]\nb = [int(i) for i in input().split()]\nans = 0\nvisited = [False for i in range(n)]\nfor i in range(n):\n if visited[i]:\n continue\n ans += 1\n while not visited[i]:\n visited[i] = True\n i = p[i] - 1\nif ans == 1:\n ans = 0\nans += (sum(b) + 1) % 2\nprint(ans)\n \t \t \t \t\t\t \t\t \t \t", "n = int(input())\r\np = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n \r\ncnt_cyc = 0\r\nvis = [0] * n\r\nfor i in range(n):\r\n if vis[i] == 0:\r\n vis[i] = 1\r\n nxt = p[i]-1\r\n while vis[nxt] == 0:\r\n vis[nxt] = 1\r\n nxt = p[nxt]-1\r\n cnt_cyc += 1\r\n\r\nres = (b.count(1)+1) % 2\r\nprint(res if cnt_cyc == 1 else res + cnt_cyc)\r\n", "import sys\ninput = sys.stdin.readline\n\nn = int(input())\npermutation = list(map(int, input().split()))\n\ngo = set(range(1,n+1))\nreached = set()\nans = 0\nwhile go:\n x = go.pop()\n while x not in reached:\n reached.add(x)\n x = permutation[x-1]\n if x in go:\n go.remove(x)\n ans += 1\nif ans == 1:\n ans = 0\n\npermutation = input().split()\nif permutation.count('1') % 2 == 0:\n ans += 1\nprint(ans)\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\nB = list(map(int,input().split()))\r\nans =0\r\nsums1 =0\r\nfor j in range(n):\r\n if B[j] == 1:\r\n sums1+=1\r\nif sums1 % 2==0:\r\n ans=1\r\nvisited = [0] * n\r\ncou =0\r\nfor j in range(n):\r\n if visited[j] == 0:\r\n visited[j] = 1\r\n while True:\r\n if visited[A[j]-1] == 0:\r\n visited[A[j]-1] = 1\r\n j = A[j]-1 \r\n else:\r\n cou += 1\r\n break\r\nif cou !=1:\r\n ans +=cou\r\nprint(ans)", "n = int(input())\r\np = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\ncount_cycles = 0\r\nvisited = [False] * n\r\nfor i in range(n):\r\n if not visited[i]:\r\n visited[i] = True\r\n nxt = p[i]-1\r\n while not visited[nxt]:\r\n visited[nxt] = True\r\n nxt = p[nxt]-1\r\n count_cycles += 1\r\n\r\nif count_cycles == 1:\r\n print((b.count(1)+1) % 2)\r\nelse:\r\n print(count_cycles + (b.count(1)+1) % 2)\r\n", "read = lambda: map(int, input().split())\n\nn = int(input())\n\np = list(read())\n\nb = list(read())\n\nans = (b.count(1) + 1) % 2\n\nwas = [0] * n\n\ncnt = 0\n\nfor i in range(n):\n\n if not was[i]:\n\n cnt += 1\n\n v = i\n\n while not was[v]:\n\n was[v] = 1\n\n v = p[v] - 1\n\nif cnt > 1: ans += cnt\n\nprint(ans)\n\n\n\n# Made By Mostafa_Khaled", "import sys\ninput = sys.stdin.readline\n\nN = int(input())\npermu = list(map(int, input().split()))\npermu = [i-1 for i in permu]\nblist = list(map(int, input().split()))\n\ncyclefind = [False for i in range(N)]\ncyclenum = 0\n\nfor i in range(N):\n if cyclefind[i] == False:\n cyclenum+=1\n q = i\n while cyclefind[q] != True:\n cyclefind[q] = True\n q = permu[q]\nif cyclenum == 1:\n cyclenum = 0\nif blist.count(1) % 2 == 0:\n cyclenum+=1\nprint(cyclenum)\n\n \t \t\t \t \t \t \t \t\t \t\t\t\t\t", "from collections import deque\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\ndef num_cycles(P):\r\n V = [False] * len(P)\r\n i = 0\r\n for u in P:\r\n if not V[u]:\r\n while not V[u]:\r\n V[u] = True\r\n u = P[u]\r\n i += 1\r\n return i\r\n\r\n\r\ndef runB():\r\n n = read()\r\n P = read_arr()\r\n P = [a-1 for a in P]\r\n B = read_arr()\r\n extra = (sum(B) + 1) % 2\r\n cycles = num_cycles(P)\r\n ans = extra + (cycles if cycles > 1 else 0)\r\n print(ans)\r\n\r\n\r\n\r\nrunB()\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nk=0\r\ns=0\r\nv=[False]*n\r\nfor i in range (n):\r\n if v[i]:\r\n continue\r\n k+=1\r\n while not v[i]:\r\n v[i]=True\r\n i=a[i]-1\r\nif k==1:\r\n k=0\r\nelse:\r\n s+=k\r\nif sum(b)%2==0:\r\n s+=1\r\nprint(s)\r\n", "class DSU :\r\n def __init__(self, n: int):\r\n self.par = list(range(n))\r\n self.rnk = [0] * (n)\r\n self.c = n\r\n self.sz = [1]*n\r\n \r\n def find(self, i: int) -> int:\r\n if self.par[i] != i:\r\n self.par[i] = self.find(self.par[i])\r\n return self.par[i]\r\n \r\n def same(self, i: int, j: int):\r\n return self.find(i) == self.find(j)\r\n \r\n def count(self) ->int :\r\n return self.c\r\n \r\n def get_size(self, i: int) -> int:\r\n return self.sz[self.find(i)]\r\n \r\n def merge(self, i: int, j: int) :\r\n i = self.find(i)\r\n j = self.find(j)\r\n \r\n if i == j:\r\n return\r\n else:\r\n self.c -= 1\r\n if self.rnk[i] > self.rnk[j]:\r\n i, j = j, i\r\n self.par[i] = j\r\n self.sz[j] += self.sz[i]\r\n if self.rnk[i] == self.rnk[j]:\r\n self.rnk[j] += 1\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\na = list(map(lambda x: x - 1, a))\r\n\r\nds = DSU(n)\r\nfor i in range(n):\r\n ds.merge(i, a[i])\r\n\r\ns = 1 - sum(b) % 2 + (ds.count() if ds.count() > 1 else 0)\r\nprint(s)", "T = int(input())\n\n# next barbecue links\nnn = [int(num) for num in input().split()]\n# sides\nss = [int(num) for num in input().split()]\n\ni = 0\nvisited = 0\ngroups = 0\nj = 0\nwhile len(nn) != visited:\n while not nn[j]:\n j += 1\n i = j\n groups += 1\n while nn[i]:\n visited += 1\n temp = nn[i]\n nn[i] = False\n i = temp-1\n\nif len(nn) == 1:\n groups = 1\n \nswaps = groups if groups != 1 else 0\nnum1s = sum(ss)\nif num1s % 2 == 0: \n print(swaps+1)\nelse:\n print(swaps)\n", "import sys\n \nn = int(input())\np = [int(i) for i in input().split()]\nb = [int(i) for i in input().split()]\n \nans = 0\nnum_cycles = 0\nchecked = set()\n \nfor i in range(n):\n if i in checked:\n continue\n \n checked.add(i)\n \n nxt = p[i] - 1\n \n while nxt != i:\n checked.add(nxt)\n nxt = p[nxt] - 1\n \n num_cycles += 1\n \nans += num_cycles if num_cycles != 1 else 0\nans += (sum(b) % 2) == 0\n \nprint(ans)\n\t\t\t\t \t\t \t\t\t \t \t \t\t \t\t\t \t \t", "amount = int(input())\nmovement = list(map(int, input().split()))\nreachable = [False]*amount\nflip = sum(list(map(int, input().split())))\nchangesneeded = 0\nflipneeded = 0\n\nif flip % 2 == 0:\n flipneeded = 1\n\nfor i in range(amount):\n if not reachable[i]:\n changesneeded += 1\n point = i\n \n while True:\n if reachable[point]:\n break\n reachable[point] = True\n point = movement[point]-1\n \nif changesneeded > 1:\n print(changesneeded+flipneeded)\nelse:\n print(flipneeded)\n \n \t \t \t\t\t \t\t\t\t\t \t\t \t \t", "import sys\r\n\r\nn = int(input())\r\np = [int(i) for i in input().split()]\r\nb = [int(i) for i in input().split()]\r\n\r\nans = 0\r\nnum_cycles = 0\r\nchecked = set()\r\n\r\nfor i in range(n):\r\n if i in checked:\r\n continue\r\n\r\n checked.add(i)\r\n\r\n nxt = p[i] - 1\r\n\r\n while nxt != i:\r\n checked.add(nxt)\r\n nxt = p[nxt] - 1\r\n\r\n num_cycles += 1\r\n\r\nans += num_cycles if num_cycles != 1 else 0\r\nans += (sum(b) % 2) == 0\r\n\r\nprint(ans)" ]

[ "x0=1\r\ny0=1\r\nd=0\r\ndef euclides(a,b):\r\n global x0,y0,d\r\n if b==0:\r\n x0=1\r\n y0=0\r\n d=a\r\n return\r\n euclides(b,a%b)\r\n x1=y0\r\n y1=x0-(a//b)*y0\r\n x0=x1\r\n y0=y1\r\n\r\na,b,c=map(int,input().split())\r\neuclides(a,b)\r\nif c%d!=0:\r\n print(-1)\r\nelse:\r\n x_sol=-c*x0//d\r\n y_sol=-c*y0//d\r\n if -5 * (10 ** 18) <= x_sol and x_sol <= 5 * (10 ** 18) and -5 * (10 ** 18) <= y_sol and y_sol <= 5 * (10 ** 18):\r\n print(\"{} {}\".format(x_sol, y_sol))\r\n else:\r\n print(-1)", "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\ndef find(a,b):\n if not a:return 0,1,b\n x,y,g = find(b%a,a)\n return y-(b//a)*x,x,g\n \n \nA,B,C = map(int,input().split())\nx,y,g = find(A,B)\nnum = -C//g\n\nif C%g:exit(print(-1))\nprint(num*x,num*y)", "def gcd(a, b):\r\n if a == 0:\r\n return 0, 1, b;\r\n\r\n x, y, g = gcd(b % a, a)\r\n return y - (b // a) * x, x, g\r\n\r\na, b, c = map(int, input().split())\r\nc = -c\r\nx, y, g = gcd(a, b)\r\n\r\nif c % g != 0:\r\n print(\"-1\")\r\nelse:\r\n x *= c // g\r\n y *= c // g\r\n print(x, \" \", y)\r\n", "def rec(a, b):\r\n if a == 0:\r\n return 0, 1, b;\r\n x, y, s = rec(b % a, a)\r\n return y - (b // a) * x, x, s\r\nx, y, z = map(int, input().split())\r\na, b, s = rec(x, y)\r\nif(z % s != 0):\r\n print(-1)\r\n exit(0)\r\na *= (-z // s)\r\nb *= (-z // s)\r\nprint(a, b)", "def extendedGCD(a, b):\r\n if b == 0:\r\n x = 1\r\n y = 0\r\n return x, y, a\r\n x, y, g = extendedGCD(b, a % b)\r\n z = x - (a // b) * y\r\n return y, z, g\r\n\r\nA, B, C = (int(x) for x in input().split())\r\nif A == 0 and B == 0:\r\n if C == 0:\r\n print(1, 1)\r\n else:\r\n print(-1)\r\nelif A == 0:\r\n if C % B == 0:\r\n print(1, (-C // B));\r\n else:\r\n print(-1)\r\nelif B == 0:\r\n if C % A == 0:\r\n print((-C // A), 1)\r\n else:\r\n print(-1)\r\nelse:\r\n x, y, gcd = extendedGCD(A, B)\r\n X = x * -C // gcd\r\n Y = y * -C // gcd\r\n if -5e18 <= X <= 5e18 and -5e18 <= Y <= 5e18 and A * X + B * Y + C == 0:\r\n print(X, Y)\r\n else:\r\n print(-1)\r\n", "def bezout(a, b):\n if not b:\n return (1, 0, a)\n y, x, g = bezout(b, a % b)\n return (x, y - (a // b) * x, g)\n\na, b, c = map(int, input().split())\nx, y, gcd = bezout(a, b)\nif c % gcd: \n print(-1)\nelse:\n print(-x * c // gcd, -y * c // gcd)", "def gcd(a,b,x,y):\r\n if a==0:\r\n return b\r\n g=gcd(b%a,a,x,y)\r\n x[0],y[0]=y[0]-(b//a)*x[0],x[0]\r\n #print(x,y)\r\n return g\r\na,b,c=list(map(int,input().split()))\r\nx,y=[0],[1]\r\ng=gcd(a,b,x,y)\r\nif c%g!=0:\r\n print(-1)\r\nelse:\r\n c=c//g\r\n print(x[0]*(-c),y[0]*(-c))", "\"\"\"\nCodeforces\n7C - Line\nhttp://codeforces.com/contest/7/problem/C\n\nHéctor González Belver\n../07/2018\n\"\"\"\nimport sys\n\ndef Bezout_identity(a, b):\n #Find integers x and y (Bezout coefficients) ==> ax + by = gcd(a,b)\n\n #Extendend Euclidean algorithm\n r = b\n x, x1 = 1, 0\n y, y1 = 0, 1\n while r:\n q, r = divmod(a, b) \n a, b = b, r\n x, x1 = x1, x - x1 * q\n y, y1 = y1, y - y1 * q\n\n return a, x, y\n \n\ndef main():\n a, b, c = map(int, sys.stdin.readline().strip().split())\n\n #Linear Diophantine equations ==> Ax + By = C (A(A=a, B=b and C=-c))\n #It has a solution (where x and y are integers) if and only if C is a multiple of the greatest common divisor of A and B. \n \n gcd_a_b, bezout_x, bezout_y = Bezout_identity(a, b)\n #if c is multiple of gcd(a,b)\n # ==> one solution is (-c/gcd(a,b) * bezout_coeff_x, -c/gcd(a,b) * bezout_coeff_y)\n # else no integer solution\n if c%gcd_a_b:\n sys.stdout.write('-1' + '\\n')\n else:\n d = -c//gcd_a_b\n sys.stdout.write(str(bezout_x * d) + ' ' + str(bezout_y * d) + '\\n')\n\n\nif __name__ == '__main__': \n main()", "\r\ndef exgcd(a, b):\r\n if 0 == b:\r\n return 1, 0, a\r\n x, y, q = exgcd(b, a % b)\r\n x, y = y, (x - a // b * y)\r\n return x, y, q\r\n\r\ndef main():\r\n a, b, c = map(int, input().split())\r\n c = -c\r\n x, y, q = exgcd(a, b)\r\n if c % q == 0:\r\n print(\"%d %d\"%(c//q*x, c//q*y))\r\n else:\r\n print(-1)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "#!/usr/bin/env python\n\"\"\"\nCodeForces: 5C. Line\n\nThe problem is equivalent to Bézout's identity, such that\n a*x + b*y = d\nwhere d = -c.\n\nIt can be solved with Extended Euclidean Algorithm.\n\"\"\"\n\n\ndef main():\n a, b, c = map(int, input().split())\n # First, find a pair of the integers, 'x' and 'y', that satisfies:\n # a*x + b*y = gcd(a, b)\n # If there is an integer 'm' such that:\n # m = -c / gcd(a, b)\n # then\n # a*(m * x) + b*(m * y) + c = 0\n x, x1 = 1, 0\n y, y1 = 0, 1\n while b:\n q = a // b\n a, b = b, a % b\n x, x1 = x1, x - x1 * q\n y, y1 = y1, y - y1 * q\n # Now, 'a' is gcd(a, b), and\n # 'x' and 'y' are Bézout coefficients\n if c % a:\n print(-1)\n else:\n c //= -a\n print(c * x, c * y)\n\n\nif __name__ == '__main__':\n main()\n", "import math\r\n\r\nABC = [int(i) for i in input().split()]\r\nA = ABC[0]\r\nB = ABC[1]\r\nC = ABC[2]\r\n\r\ndef gcd_euclidean(a, b):\r\n r = a % b\r\n if r == 0:\r\n return b, 0, 1\r\n else:\r\n g, x, y = gcd_euclidean(b, r)\r\n return g, y, x-(a//b) * y\r\nmax_num = int(5e18)\r\n\r\n\r\nif A == 0:\r\n #y = 3 etc\r\n if C % B == 0:\r\n print(0, -C//B)\r\n else:\r\n print(-1)\r\nelif B == 0:\r\n #x = 3 etc\r\n if C % A == 0:\r\n print(0, -C//A)\r\n else:\r\n print(-1)\r\nelse:\r\n g, x, y = gcd_euclidean(A, B)\r\n if C % g == 0:\r\n k = C // g\r\n kx = -k * x\r\n ky = -k * y\r\n if abs(kx) > max_num or abs(ky) > max_num:\r\n print(-1)\r\n else:\r\n print(kx, ky)\r\n else:\r\n print(-1)", "def egcd(a, b):\r\n if b == 0:\r\n return a, 1, 0\r\n d, x, y = egcd(b, a % b)\r\n return d, y, x - y * (a // b)\r\n\r\na, b, c = map(int, input().split())\r\nd, x, y = egcd(abs(a), abs(b))\r\nif c % d != 0:\r\n print(-1)\r\n exit()\r\na //= d\r\nb //= d\r\nc //= d\r\nif a < 0:\r\n x = -x\r\nif b < 0:\r\n y = -y\r\nx *= -c\r\ny *= -c\r\nprint(x, y)\r\n", "from math import gcd\r\na,b,c = map(int,input().split())\r\ng = gcd(a,b)\r\nif c%g: print(-1); exit()\r\na //= g; b //= g; c //= g\r\nif not a: print(0,-c//b); exit()\r\nif not b: print(-c//a,0); exit()\r\n\r\nx,y = 1,1\r\nif a<0: a = -a; x = -1\r\nif b<0: b = -b; y = -1\r\ndef euc(a,b):\r\n if a==1: return 1,0\r\n if b==1: return 0,1\r\n if a<b:\r\n q,r = divmod(b,a)\r\n z,w = euc(a,r)\r\n return z-q*w,w\r\n q,r = divmod(a,b)\r\n z,w = euc(r,b)\r\n return z,w-q*z\r\n \r\nx1,y1 = euc(a,b)\r\nprint(x1*x*-c,y1*y*-c)", "def gcdex(a, b):\n if b == 0:\n return a, 1, 0\n else:\n g, x, y = gcdex(b, a % b)\n return g, y, x - a // b * y\n\n\na, b, c = map(int, input().split())\n\nif b != 0:\n g, x, k = gcdex(a, b)\n if c % g == 0:\n print(x * -c // g, (-c - a * (x * -c // g)) // b)\n else:\n print(-1)\nelse:\n g, k, y = gcdex(a, b)\n if c % g == 0:\n print(y * -c // g, (-c - b * (y * -c // g)) // a)\n else:\n print(-1)\n", "\n\ndef ext_gcd(a, b):\n if not b:\n return 1, 0, a\n x, y, g = ext_gcd(b, a % b)\n x, y = y, x - a//b * y\n return x, y, g\n\n\nif __name__ == \"__main__\":\n co = input().split()\n A, B, C = int(co[0]), int(co[1]), int(co[2])\n x, y, g = ext_gcd(A, B)\n if not C % g:\n print(-x*C//g, -y*C//g)\n else:\n print(-1)\n\n", "\"\"\"\r\nGiven a line ax+by+c=0.\r\nFind a point such that\r\n1) it belongs to the line\r\n2) its coordinates are integer numbers.\r\n\r\nHint: Use extended gcd algorithm.\r\nMake sure you are considered cases accurately.\r\n\r\nGENERATED BY GPT3\r\n\"\"\"\r\n\r\ndef extended_gcd(a, b):\r\n \"\"\"\r\n Returns a triple (g, x, y), such that ax + by = g = gcd(a, b).\r\n \"\"\"\r\n if a == 0:\r\n return (b, 0, 1)\r\n else:\r\n g, y, x = extended_gcd(b % a, a)\r\n return (g, x - (b // a) * y, y)\r\n\r\ndef find_point(a, b, c):\r\n \"\"\"\r\n Returns a point (x, y) that belongs to the line ax+by+c=0.\r\n \"\"\"\r\n g, x, y = extended_gcd(a, b)\r\n if c % g != 0:\r\n return None\r\n else:\r\n return (-x * c // g, -y * c // g)\r\n\r\ndef main():\r\n a, b, c = map(int, input().split())\r\n point = find_point(a, b, c)\r\n if point is None:\r\n print(\"-1\")\r\n else:\r\n print(\"{} {}\".format(point[0], point[1]))\r\n\r\nif __name__ == \"__main__\":\r\n main()", "def compute():\n\n def xgcd(b,n):\n x0, x1, y0, y1 = 1, 0, 0, 1\n while n!=0:\n q, b, n = b//n, n, b%n\n x0, x1 = x1, x0 - q*x1\n y0, y1 = y1, y0 - q*y1\n return b, x0, y0\n\n A, B, C = map(int,input().split())\n if A==0 and B==0:\n return [-1] if C!=0 else [0,0]\n if A==0:\n return [0, -C//B] if abs(-C)%B==0 else [-1]\n if B==0:\n return [-C//A, 0] if abs(-C)%A==0 else [-1]\n g, x, y = xgcd(A,B)\n if abs(-C)%g!=0:\n return [-1]\n d = -C//g\n return [x*d, y*d]\n\nif __name__==\"__main__\":\n print(' '.join(str(it) for it in compute()))\n", "def e(a,b):\n if not a:\n return 0, 1, b\n x, y, g = e(b%a, a)\n return y - (b//a)*x, x, g\na,b,c = map(int, input().split())\nx,y,g = e(a,b)\nC = -c//g\nprint(-1) if c%g else print(C*x, C*y)\n \t \t\t \t \t\t \t\t\t\t \t\t \t\t\t\t\t\t\t", "alph, beth, d = 0, 0, 0\r\ndef gcd(a, b):\r\n\tglobal alph\r\n\tglobal beth\r\n\tglobal d\r\n\tif(b == 0):\r\n\t\td = a\r\n\t\talph = 1\r\n\t\tbeth = 0\r\n\telse:\r\n\t\tgcd(b, a % b)\r\n\t\ttemp = alph\r\n\t\talph = beth\r\n\t\tbeth = temp - (a // b) * beth\r\ndef main():\r\n\tA = [int(i) for i in input().split()]\r\n\ta, b , c = A[0], A[1], A[2]\r\n\tc *= - 1\r\n\tgcd(a, b)\r\n\txc = (c // d) * alph\r\n\tyc = (c // d) * beth\r\n\tif(c % d != 0):\r\n\t\tprint(-1)\r\n\telse:\r\n\t\tprint(int(xc), int(yc))\r\nmain()", "def yes(a, b):\r\n if not a:\r\n return 0, 1, b\r\n x, y, g = yes(b % a, a)\r\n return y - (b//a)*x, x, g\r\n \r\n \r\na, b, c = map(int, input().split())\r\nx, y, g = yes(a, b)\r\nC = -c//g\r\nprint(-1) if c%g else print(C*x, C*y)", "# import Math\r\na,b,c = map(int, input().split())\r\n# A= abs(a)\r\n# B = abs(b)\r\n# def egcd(A,B):\r\n# \tx,y,u,v = 0,1,1,0\r\n# \twhile A!= 0:\r\n# \t\tq = B//A\r\n# \t\tm,n = x- u*q, y-v*q\r\n# \t\tB,A,x,y,u,v = A,B%A,u,v,m,n\r\n# \treturn x,y\r\n# def gcd(A, B):\r\n# \tif B == 0:\r\n# \t\treturn A\r\n# \treturn gcd(B, A%B)\r\n# if(c % gcd(A,B) != 0):\r\n# \tprint(-1)\r\n# else:\r\n# \tk = -1 * (c// gcd(A,B))\r\n# \tX,Y = egcd(A,B)\r\n# \tprint(k*X , k*Y)\r\nr0 , r1 , s0, s1 , t0, t1 = a, b, 1, 0, 0, 1\r\nwhile r1 :\r\n\tq, r2 = divmod(r0,r1)\r\n\t# its a function that returns a tuple containing quotient of first and the\r\n\t# remainder of the other\r\n\tq, r2 = r0//r1 ,r0 % r1\r\n\tr0 , r1 = r1, r2\r\n\ts0, s1 = s1, s0 - q*s1\r\n\tt0 , t1 = t1, t0 - q*t1\r\nif c % r0:\r\n\tprint(-1)\r\nelse:\r\n\tprint(s0*-c//r0, t0 * -c//r0)\r\n", "# LUOGU_RID: 109987254\nimport sys\r\na,b,c=map(int,sys.stdin.readline().split())\r\ndef exgcd(a,b):#扩展欧几里得算法\r\n if(b==0):\r\n return 1,0,a\r\n else:\r\n x,y,d = exgcd(b,a%b)\r\n x,y = y,(x-(a//b)*y)\r\n return x,y,d\r\nx,y,d=exgcd(a,b)\r\nc=-c\r\nif c%d==0:\r\n k=c//d\r\n print(x*k,y*k)\r\nelse:\r\n print(-1)", "a, b, c = (int(x) for x in input().split())\n\nx, x1 = 1, 0\ny, y1 = 0, 1\n\nwhile b != 0:\n q = a // b\n a, b = b, a % b\n x, x1 = x1, x - q * x1\n y, y1 = y1, y - q * y1\n\nif c % a == 0:\n x *= -c // a\n y *= -c // a\n \n mn = -5 * 10 ** 18\n mx = 5 * 10 ** 18\n \n if mn <= x <= mx and mn <= y <= mx:\n print(x, y)\n else:\n print(-1)\nelse:\n print(-1)\n", "# invar: Ax+By=z, Ar+Bs=t. Finally t=0 and z=gcd. Want: z = -C\r\nA, B, C = map(int,input().split())\r\n# without special handling of the signs, z is known to be either gcd or -gcd, and x,y have abs smaller than A,B\r\nr = 1; s = 0; t = A; x = 0; y = 1; z = B\r\nwhile t != 0:\r\n d = z // t\r\n x,y,z,r,s,t = r,s,t,x-r*d,y-s*d,z%t\r\nif C % z != 0: print(-1)\r\nelse: print(x * -C // z, y * -C // z)", "def egcd(a, b, xa, xb):\n if (b == 0):\n return a, xa\n q = a//b\n return egcd(b, a-q*b, xb, xa-q*xb)\na, b, c = map(int, input().split())\nc = -c\nd, x = egcd(a, b, 1, 0)\nif (c%d != 0):\n print(-1)\nelse:\n x *= c//d\n if (b == 0):\n y = 0\n else:\n y = (c-x*a)//b\n print(x, y)", "__author__ = 'Darren'\r\n\r\n\r\ndef solve():\r\n a, b, c = map(int, input().split())\r\n params = extended_euclidean(a, b)\r\n if c % params[0] != 0:\r\n print(-1)\r\n else:\r\n factor = -c // params[0]\r\n print(params[1] * factor, params[2] * factor)\r\n\r\n\r\ndef extended_euclidean(m, n):\r\n r0, r1 = m, n\r\n x0, x1 = 1, 0\r\n y0, y1 = 0, 1\r\n while r1 != 0:\r\n q = r0 // r1\r\n r0, r1 = r1, r0 - r1 * q\r\n x0, x1 = x1, x0 - x1 * q\r\n y0, y1 = y1, y0 - y1 * q\r\n return r0, x0, y0\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "def gcd(a,b):\r\n if b==0:\r\n return (1,0,a)\r\n else:\r\n x,y,g=gcd(b, a%b)\r\n return (y,x-(a//b)*y,g)\r\na,b,c=map(int,input().split())\r\nif a>b:\r\n x,y,g=gcd(max(a,b),min(a,b))\r\nelse:\r\n y,x,g=gcd(max(a,b),min(a,b))\r\n\r\nif abs(c)%g!=0:\r\n print(-1)\r\nelse:\r\n print(-x*(c//g),-y*(c//g))", "import sys\n\ndef solve():\n a, b, c = map(int, input().split())\n gcd, amul, bmul = egcd(a, b)\n if c % gcd != 0:\n print(-1)\n return\n first = amul * c//gcd\n second = bmul * c // gcd\n for i in range(-1, 2, 2):\n for j in range(-1, 2, 2):\n if a * first * i + b * second * j == - c:\n print(first * i, second * j)\n return\n print(-1)\n\ndef egcd(a, b):\n s = 0\n old_s = 1\n t = 1\n old_t = 0\n r = b\n old_r = a\n while r != 0:\n quotient = old_r // r\n (old_r, r) = (r, old_r - quotient * r)\n (old_s, s) = (s, old_s - quotient * s)\n (old_t, t) = (t, old_t - quotient * t)\n return (old_r, old_s, old_t)\n\nif sys.hexversion == 50594544 : sys.stdin = open(\"test.txt\")\nans = solve()", "a, b, c = map(int, input().split())\r\nr0, r1, s0, s1, t0, t1 = a, b, 1, 0, 0, 1\r\nwhile r1:\r\n q, r2 = divmod(r0, r1)\r\n r0, r1 = r1, r2\r\n s0, s1 = s1, s0 - q * s1\r\n t0, t1 = t1, t0 - q * t1\r\nif c % r0:\r\n print('-1')\r\nelse:\r\n print(s0 * -c // r0, t0 * -c // r0)" ]

[ "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\ninput=sys.stdin.readline\r\na,b,c,d=(int(i) for i in input().split())\r\nk1=1-(a/b)\r\nk2=1-(c/d)\r\nprint((1-k1)/(1-k1*k2))", "entrada = input()\nitens = entrada.split()\na, b, c, d = float(itens[0]), int(itens[1]), int(itens[2]), int(itens[3])\n\nprob_win_sr = a/b\nprob_win_zn = c/d\n\nprob_failure = (1-prob_win_sr) * (1-prob_win_zn)\n\nresult = prob_win_sr/(1-prob_failure)\n\nprint(result)\n\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 as dc\r\nfrom collections import Counter\r\nfrom bisect import bisect_right, bisect_left\r\nimport math\r\nfrom operator import itemgetter\r\nfrom heapq import heapify, heappop, heappush\r\nfrom queue import PriorityQueue as pq\r\na,b,c,d=map(int,input().split())\r\nx,y=a/b,c/d\r\nz=(1-x)*(1-y)\r\ns=1/(1-z)\r\nprint(x*s)", "a,b,c,d=map(int,input().split())\r\nr=a/b\r\nR=c/d\r\nr1=1-r\r\nr2=1-R\r\nprint(r*(1/(1-r1*r2)))\r\n\r\n\r\n\r\n", "a,b,c,d=list(map(int,input().split()))\r\nawin=a/b\r\naloss=1-(a/b)\r\nbloss=1-(c/d)\r\nans=awin*(1/(1-(aloss*bloss)))\r\n\r\nprint(\"%.12f\" % ans)\r\n", "a, b, c, d = map(int, input().split())\r\nans = 0\r\nfor k in range(10000):\r\n ans += a/b * (((1 - a/b) * (1 - c/d)) ** k)\r\nprint(ans)\r\n#нам нужно до определенной точности", "a,b,c,d=map(int,input().split())\r\nprint((a/b)/(1-((1-(a/b))*(1-(c/d)))))", "print(\"%.8f\"%(lambda a,b,c,d:a/b/(1-(1-a/b)*(1-c/d)))(*list(map(int,input().split()))[0:4]))", "a, b, c, d = map(int, input().split())\r\n\r\nk1 = a * d\r\nk2 = b * d - (b - a) * (d - c)\r\n\r\nprint(k1 / k2)\r\n", "numbers = [int(x) for x in input().split()]\r\na, b, c, d = numbers[0], numbers[1], numbers[2], numbers[3]\r\nprint((a / b) / (1 - ((1 - a / b) * (1 - c / d))))\r\n", "a,b,c,d=map(int, input().split())\r\nsmallR,Zanoes=a/b,c/d\r\na1,b1=1-smallR,1-Zanoes\r\nans = smallR / (1-(a1 * b1))\r\nprint (ans)\r\n", "a,b,c,d = map(int,input().split())\r\nprint((a/b) / (1-(((d-c)/d) * ((b-a)/b))))", "a,b,c,d=map(int,input().split())\nprint(a*d/(b*d-(b-a)*(d-c)))", "##B\r\ndef main():\r\n a,b,c,d=map(int,input().split())\r\n PA=a/b\r\n PB=c/d\r\n qA=1-PA\r\n qB=1-PB\r\n print((PA/(1-qA*qB)))\r\nmain()\r\n", "a, b, c, d = input().split()\ntemp1 = float(a)/float(b)\ntemp2 = float(c)/float(d)\ntemp3 = temp1/(1-(1-temp1)*(1-temp2))\nprint ('%.12f' % temp3)\n \t\t\t\t \t \t\t\t \t \t\t\t \t", "a,b,c,d = map(int,input().split())\r\n\r\n\r\n\r\nt = a/b\r\n\r\nc = (1-(a/b))*(1-(c/d))\r\n\r\n\r\nprint(round(t/(1-c),15))\r\n", "def main():\n inp = list(map(int, input().split()))\n a = inp[0]\n b = inp[1]\n c = inp[2]\n d = inp[3]\n prob_small_r_win = a/b\n prob_zanoes_win = c/d\n prob_both_lose = (1-prob_small_r_win)*(1-prob_zanoes_win)\n print(round(prob_small_r_win/(1-prob_both_lose), 12))\n\nmain()\n\t \t \t\t\t\t \t\t\t \t\t \t \t\t\t\t\t", "a, b, c, d = [int(i) for i in input().split()]\r\np1 = a / b\r\np2 = 1 - c / d\r\n\r\n\r\ndef v(c, p1, p2):\r\n return (1 - p1) ** (c - 1) * p2 ** (c - 1) * p1\r\n\r\n\r\ns = 0\r\nfor i in range(10000):\r\n s += v(i + 1, p1, p2)\r\n \r\nprint(round(s, 6))", "L=[int(x) for x in input().split()]\r\np1=float(L[0])/L[1];p2=float(L[2])/L[3]\r\nprint (p1/(p1+p2-(p1*p2)))", "a, b, c, d = map(int, input().split(' '))\r\n\r\nprob = 0\r\nx = 0\r\nv1 = (b-a) * (d-c) / (b * d)\r\n\r\nwhile True:\r\n \r\n tmp = pow(v1, x)\r\n tmp *= (a/b)\r\n \r\n if tmp < 1e-10:\r\n print(prob)\r\n break\r\n \r\n \r\n prob += tmp\r\n x += 1\r\n ", "import sys\r\ninput = sys.stdin.readline\r\n\r\na, b, c, d = map(int, input().split())\r\n\r\nx = a/b\r\ny = c/d\r\nprint(x / (x + y - x*y))", "a,b,c,d=list(map(int,input().split()))\r\nans=a/b\r\nx=1-(a/b)\r\ny=1-(c/d)\r\nans/=(1-(x*y))\r\nprint(\"%.10f\"%ans)", "a,b,c,d=map(int,input().split())\r\nq=a/b\r\nw=(1-q)*(c/d)\r\nprint(f\"{q/(q+w):.99f}\")", "a,b,c,d = [int(i) for i in input().split()]\nprobSmallR = a/b\nprobZanoes = c/d\nresposta = probSmallR/(1- (1-probSmallR)*(1-probZanoes))\nprint(round(resposta,12))\n\t\t \t \t \t\t\t \t \t\t \t\t \t\t \t", "a, b, c, d = input().split()\r\na = int(a); b = int(b); c = int(c); d = int(d)\r\nx = a/b; y = 0\r\nfor i in range(100000):\r\n y += (1-(x+y))*c/d\r\n x += (1-(x+y))*a/b\r\nprint(x)", "import sys\r\n\r\na,b,c,d = map(int, sys.stdin.readline().split()) \r\n\r\np = a/b\r\nq=(1-p)*(1-(c/d))\r\nlimit = p/(1-q)\r\n\r\nprint(limit)", "def main():\n lista = list(map(lambda x: int(x), input().split()))\n a = lista[0]\n b = lista[1]\n c = lista[2]\n d = lista[3]\n p1 = a/b\n p2 = c/d\n print(p1 / (1 - (1-p1)*(1-p2)))\nmain()\n\t\t \t \t\t \t\t\t\t \t\t\t \t \t\t \t", "a, b, c, d = [int(i) for i in input().split()]\r\np1 = a / b\r\np2 = c / d\r\n\r\np3 = 1 - (1 - p1) * (1 - p2)\r\nprint(p1 / p3)", "# your code goes here\r\na,b,c,d = map(int,input().split())\r\np = a/b\r\nq = (1-a/b)*(1-c/d)\r\n\r\nprint(p/(1-q))", "a,b,c,d = map(int,input().split())\r\nprint(a*d/(c*b+a*d-a*c))", "a,b,c,d = input().split()\r\na,b,c,d = int(a), int(b), int(c), int(d)\r\nrw = a/b\r\nrl = 1-rw\r\nzw = c/d\r\nzl = 1-zw\r\nprint(rw/(1-(rl*zl)))", "a,b,c,d = list(map(int, input().split()))\r\np = a/b\r\nq = (1-(c/d)) * (1-p)\r\nprint(p/(1-q))", "t = input()\r\ntemp = t.split()\r\na = int(temp[0])\r\nb = int(temp[1])\r\nc = int(temp[2])\r\nd = int(temp[3])\r\n\r\nr = (1-a/b)*(1-c/d)\r\nz = (a/b)\r\nresult = z * (1/(1-r))\r\nprint(result)\r\n", "a, b, c, d = map(int, input().split())\r\np = a / b\r\nq = (1 - (c / d)) * (1 - (a / b))\r\n\r\nprint(p / (1 - q))", "a,b,c,d = (int(x) for x in input().split())\r\n\r\nprint( (a/b)/ (1 - (1-a/b)*(1-c/d)) )", "a,b,c,d=map(int,input().split())\r\ne=a/b\r\nf=(b-a)/b\r\ng=(d-c)/d\r\nprint(e/(1-(f*g)))", "a,b,c,d = map(int,input().split())\r\nfirst = a/b\r\nr = (1-a/b)*(1-c/d)\r\nprint(first/(1-r))\r\n", "a,b,c,d=map(int,input().split())\r\nfail_a=1-a/b\r\nfail_b=1-c/d\r\npass_a=a/b\r\n\r\nden=1-fail_a*fail_b\r\nprint(round(pass_a/den,12))", "a,b,c,d = map(int,input().split())\np = float(a/b)\nq = float(1-c/d)*(1-p)\n\nval = float(p/(1-q))\nprint(\"{0:.8f}\".format(val))\n \t \t\t \t \t\t \t \t \t\t\t\t", "a,b,c,d = map(int ,input().split())\nr = a/b\nrBar = 1-r\nzBar = 1-c/d\nans = r\nterm = r\nwhile(term>0.00000000001):\n term*=rBar*zBar\n ans+=term\nprint(ans)", "a,b,c,d=map(int,input().split()) ; p=a/b ; q=(1-c/d)*(1-a/b) ; x=p/(1-q) ;print(x) ", "a,b,c,d=map(int,input().split())\r\nans=(a*d)/(a*d+b*c-a*c)\r\nprint(ans)", "a, b, c, d = map(int, input().split())\np = a / b\nq = c / d\nf = (1 - p) * (1 - q)\nprint (p / (1 - f))\n\t \t\t \t \t \t \t\t\t \t\t\t\t", "a,b,c,d=(map(int,input().split()))\r\nk=a/b\r\nt=c/d\r\nprint((k)/(1-((1-k)*(1-t))))", "a,b,c,d=[int(u) for u in input().split()]\r\np=(a/b)\r\nq=(c/d)\r\nW=(p)/(1-(1-p)*(1-q))\r\nprint(W)\r\n", "a, b, c, d = [int(x) for x in input().split()]\nprint(a*d/(a*d+b*c-a*c))\n\t\t\t \t\t \t \t \t\t\t\t\t \t\t\t", "if __name__ == '__main__':\n w1, w2, w3, w4 = [int(i) for i in input().split()]\n print((w1 * w4) / ((w1 * w4) + (w2 * w3) - (w3 * w1)))\n\n \t\t \t\t \t \t\t \t \t\t\t \t \t\t \t \t", "a,b,c,d=list(map(int,input().split()))\r\np=a/b\r\nq=c/d\r\nprint(p/(p+q-p*q))", "a,b,c,d=map(int,input().split(' '))\nx=(1-a/b)*(1-c/d)\nprint((a/b)/(1-x))\n", "a, b, c, d = map(int, input().split())\r\np1, p2 = a/b, c/d\r\nans, plast = 0, 1\r\nfor i in range(10000):\r\n ans += plast*p1\r\n plast -= plast*p1\r\n plast -= plast*p2\r\nprint('%.12f'%ans)\n# Sat Aug 20 2022 08:32:28 GMT+0000 (Coordinated Universal Time)\n", "a=list(map(int,input().split()))\r\nprint(a[0]*a[3]/(a[0]*a[3]+a[1]*a[2]-a[0]*a[2]))\r\n", "l=input()\r\nm=l.split(' ')\r\n(a,b,c,d)=(int(m[0]),int(m[1]),int(m[2]),int(m[3]))\r\nans=1/(1+(b*c)/(a*d)-(c/d))\r\nprint(ans)\r\n", "a,b,c,d=input().split()\r\na=int(a)\r\nb=int(b)\r\nc=int(c)\r\nd=int(d)\r\ns=a/b\r\np=(1-a/b)*(1-c/d)\r\nn=s*(1/(1-p))\r\nprint(n)\r\n", "def getProb(p, q):\n aux = 0\n z = 1\n for i in range(10000):\n aux += z*(1-p)*q\n z = z*(1-p)*(1-q)\n return 1 - aux\n\na, b, c, d = list(map(int,input().split()))\nsmallProb = a/b\nzanoesProb = c/d\nprint(getProb(smallProb, zanoesProb))\n \t \t\t \t\t \t \t\t \t\t \t \t\t \t", "a, b, c, d = map(int, input().split())\n\np = a/b\nq = (1 - a/b)*(1 - c/d)\n\nprint(p/(1-q))", "a,b,c,d = list(map(int,input().split()))\r\nprint(a*d/(a*d+b*c-a*c))", "# a, b, c, d = map(int, input().split())\r\na, b, c, d = (int(i) for i in input().split())\r\nq = (1 - a / b) * (1 - c / d)\r\ns = a / (b * (1 - q))\r\nprint(s)\r\n\n# Sat Jul 24 2021 15:49:38 GMT+0300 (Москва, стандартное время)\n", "a,b,c,d = map(int, input().split())\r\nprint((a/b) / (1 - ((1 - a/b) * (1 - c/d))))", "\r\nif __name__ == \"__main__\":\r\n a, b, c, d = map(float, input().strip().split(' '))\r\n sm_hit = a/b\r\n z_miss = 1 - c/d\r\n sm_miss = 1 - sm_hit\r\n phit = 1 - sm_miss * z_miss\r\n print(sm_hit/ phit)", "a,b,c,d = map(int, input().split())\r\np = a/b\r\nr = c/d\r\nprint(p*(1/(1-((1-p)*(1-r)))))\r\n", "def main():\n (a, b, c, d) = map(float, input().split(' '))\n x = 1 - c/d - a/b + (a * c)/(b * d)\n return -a / b / (x - 1)\n return 1\n\nprint('{}'.format(main()))\n", "# MC621 - Desafios de Programacao II - 2s2020\n# Problema G: Archer\n\n# utiliza split para possibilitar a leitura das 3 variaveis\na, b, c, d = input().split()\n\n# converte os valores das variaveis para int \na, b, c, d = int(a), int(b), int(c), int(d)\n\n# calculo da probabilidade\n\"\"\"\n- a formula fechada se da considerando as probabilidades e seus respectivos complementos\n- nos levando a uma soma dos termos de uma PG infinita\n S = a/(1-r)\n- sendo\n 'a', a probabilidade de acerto a/b\n 'r', o complemento de a/b vezes o complemento de c/d\n\"\"\"\nprob = a/b/(1-(1-a/b)*(1-c/d))\n\n# impressao do resultado\nprint(round(prob, 12))\n \t\t\t \t \t\t \t \t\t", "a, b, c, d = map(int, input().split())\nprint((a * 1.0) / (b * (1 - ((d - c) * (b - a) * 1.0) / (d * b))))\n", "a, b, c, d = map(int, input().split())\r\n\"\"\"\r\nx = p1 + p3*x\r\n0 = p1 + (p3-1)*x\r\n-p1 = (p3-1)*x\r\np1 = (1-p3)*x\r\nx = p1/(1-p3)\r\n\r\n\"\"\"\r\n\r\np1 = a/b\r\np2 = c/d\r\np3 = (1-p1)*(1-p2)\r\nprint(p1/(1-p3))\r\n", "n=list(input().split())\r\na=int(n[0])\r\nb=int(n[1])\r\nc=int(n[2])\r\nd=int(n[3])\r\np1=a/b\r\nq1=(b-a)/b\r\nq2=(d-c)/d\r\ns=p1*(1/(1-(q1*q2)))\r\nprint(s)", "# ========== //\\\\ //|| ||====//||\r\n# || // \\\\ || || // ||\r\n# || //====\\\\ || || // ||\r\n# || // \\\\ || || // ||\r\n# ========== // \\\\ ======== ||//====|| \r\n# code\r\n\r\ndef solve():\r\n a,b,c,d = map(int, input().split())\r\n\r\n p = a / b\r\n q = c / d\r\n\r\n ans = p * (1 / (1 - (1 - p) * (1 - q)))\r\n print(ans)\r\n return\r\n\r\ndef main():\r\n t = 1\r\n # t = int(input())\r\n for _ in range(t):\r\n solve()\r\n\r\nif __name__ == \"__main__\":\r\n main()", "a, b, c, d = map(int, input().split())\r\n\r\n\r\nuncertainty = 1\r\n\r\nprecision = 0.0000001\r\n\r\nwin_chance = 0\r\n\r\nwhile uncertainty > precision:\r\n # SmallR fires\r\n win_chance += (a/b)*uncertainty\r\n uncertainty *= (1 - (a / b))\r\n # Zanoes fires\r\n uncertainty *= (1 - (c / d))\r\n\r\nprint(win_chance)\r\n", "a,b,c,d = map(int,input().split())\r\nx=a/b\r\ny=c/d\r\nxx = 1-x\r\nyy = 1-y\r\nf = x/(1-(xx*yy))\r\nprint(f)", "list = input().split(' ')\r\n\r\na = int(list[0])\r\nb = int(list[1])\r\nc = int(list[2])\r\nd = int(list[3])\r\n\r\n#let p=a/b,q=(1-c/d)*(1-a/b). The answer of this problem can be showed as:p*q^0+p*q^1+p*q^2+………… \r\n#That is the sum of a geometric progression which is infinite but 0<q<1.\r\n#We can get the limit by the formula:p/(1-q)\r\n\r\np = a/b\r\nq=(1-c/d)*(1-a/b)\r\n\r\nans = p/(1-q)\r\n\r\nprint(ans)\r\n\r\n", "a,b,c,d = input().strip().split(\" \")\np1 = int(a)/int(b)\np2 = int(c)/int(d)\np = (1-p1)*(1-p2)\nans = p1/(1-p)\n\nprint(ans)\n", "def main():\n\tdata = list(map(int, input().split()))\n\taccuracy_prob = data[0] / data[1]\n\tlose_prob = (1 - accuracy_prob) * (1 - data[2] / data[3])\n\tarcher_prob = accuracy_prob / (1 - lose_prob)\n\tprint(format(archer_prob,'.15f'))\n\n\nif __name__ == '__main__':\n\tmain()", "a,b,c,d = map(int,input().split())\r\nresult = (a*d) / (b*c+a*d-a*c)\r\nprint(result)", "def main():\n a, b, c, d = list(map(int, input().split()))\n\n ratio = (1-a/b) * (1-c/d)\n print(a/b * 1/(1-ratio))\n\n\n\nmain()\n\n\n \t\t\t \t \t\t \t\t\t \t\t\t \t \t\t\t", "x=list(map(int,input().split()))\r\nprint(round(((x[0]/x[1])/(1-(1-x[2]/x[3])*(1-x[0]/x[1]))),6))\r\n", "a,b,c,d = [int(x) for x in input().split()]\nk1= a/b\nk2 = c/d\nprint(k1/(1-(1-k1)*(1-k2)))\n\t \t\t \t\t \t \t\t \t\t\t \t\t\t\t", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Sun Jul 18 12:50:35 2021\n\n@author: aryansinha\n\"\"\"\n\na,b,c,d =list(map(int,input().split(\" \")))\nprint((a*d)/(a*d+b*c-a*c))", "a,b,c,d = input().split()\na = int(a)\nb = int(b)\nc = int(c)\nd = int(d)\np = a/b\nq = c/d\nw=(p)/(1-(1-p)*(1-q))\nprint(w)\n \t \t\t\t\t \t \t \t \t \t\t \t\t", "a, b, c, d = map(int, input().split())\r\nprint((a/b)/(1 - (1 - (c/d)) * (1 - (a/b))))", "a,b,c,d = map(int,input().split())\r\np1 = a/b\r\np2 = c/d\r\nprint( p1/(1 - (1-p1)*(1-p2)))", "a, b, c, d = input().split()\r\nm = int(a) / int(b)\r\nprint(m / (1 - (1 - m) * (1 - int(c) / int(d))))", "a,b,c,d= map(float, input().split())\r\nprint((a/b)*(1+((b-a)*(d-c))/(-((b-a)*(d-c))+(b*d))))", "\r\nfrom collections import Counter,defaultdict,deque\r\n#from heapq import *\r\n#from itertools import *\r\n#from operator import itemgetter\r\n#from itertools import count, islice\r\n#from functools import reduce\r\n#alph = 'abcdefghijklmnopqrstuvwxyz'\r\n#dirs = [[1,0],[0,1],[-1,0],[0,-1]]\r\n#from math import factorial as fact\r\n#a,b = [int(x) for x in input().split()]\r\n#sarr = [x for x in input().strip().split()]\r\n#import math\r\n#from math import *\r\n\r\nimport sys\r\ninput=sys.stdin.readline\r\n#sys.setrecursionlimit(2**30)\r\n#MOD = 10**9+7\r\ndef solve():\r\n a,b,c,d = [int(x) for x in input().split()]\r\n p1 = a/b\r\n p2 = c/d\r\n p = p1/(1-(1-p1)*(1-p2))\r\n print(p)\r\n\r\ntt = 1#int(input())\r\nfor test in range(tt):\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", "a, b, c, d = map(int, input().split())\r\n\r\nans = 0\r\nx = 1\r\n\r\nfor _ in range(100000):\r\n ans += x * a / b\r\n x = x * (b - a) / b * (d - c) / d\r\n\r\nprint(ans)\r\n", "temparr = input()\r\ntemparr = temparr.split()\r\na = int(temparr[0])\r\nb = int(temparr[1])\r\nc = int(temparr[2])\r\nd = int(temparr[3])\r\n\r\nratio = (1 -a/ b) * ( 1 - c/d)\r\naa = a / b\r\nprint(aa /(1-ratio))\r\n", "a,b,c,d = [int(i) for i in input().split()]\n\npS = a/b\npZ = c/d\n\nprint(pS/(pS + pZ - (pS*pZ)))\n \t \t\t\t \t \t\t\t \t\t \t \t\t \t \t\t\t\t\t", "def win_archery():\r\n\ta, b, c, d = map(int, input().split())\r\n\r\n\tans=(a/b)/(1-(1-a/b)*(1-c/d))\r\n\tprint(ans)\r\n\r\n\r\nwin_archery()\r\n", "import math\r\nimport copy\r\nimport itertools\r\nimport bisect\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\ndef ilst():\r\n return list(map(int,input().split()))\r\n\r\ndef inum():\r\n return map(int,input().split())\r\n \r\ndef islst():\r\n return list(map(str,input().split()))\r\n \r\na,b,c,d = inum()\r\n\r\nprint((a/b)/((a/b)+(1-a/b)*(c/d)))", "a, b, c, d = map(int, input().split())\ns = a/b\nz = c/d\n\"\"\"\nProbability of SmallR winning in the first round:\ns\nProbability of SmallR winning in the second round (probability of him missing the first (1-s) and Zanoes also missing the first (1-z)):\n(1-s)(1-z)s\nProbability of SmallR winning in the third round (similar to previous):\n(1-s)^2(1-z)^2s\n\nThe probability that Small wins is the sum of these probabilities:\ns + (1-s)(1-z)s + (1-s)^2(1-z)^2s\n\nHere I used chatGPT to help solve the series\nThe formula for the sum of a finite geometric series is given by:\nSum = a / (1 - r)\nIn this case a = s e r = is the ratio between consecutive terms: (1-s)^2(1-z)^2s/(1-s)(1-z)s = (1-s)(1-z)\n\"\"\"\nprint(s / (1 - (1-s)*(1-z)))\n\n \t\t \t\t \t\t\t \t \t\t \t \t\t\t \t \t\t\t", "a, b, c, d = list(map(int, input().split()))\r\nr = a/b\r\nz =(1 - c/d) * (1 - a/b)\r\nprint(r/(1-z))", "a, b, c, d = map(int, input().split())\np, q = a/b, c/d\ne = float(1e-15)\nt = float(1.0)\nans = float(0.0)\nwhile t >= e :\n ans += t*p\n t *= (1-p)*(1-q)\nprint(f'{ans:.12f}')\n\n\t\t \t\t\t \t \t\t \t \t \t\t\t\t \t", "a,b,c,d = map(int,input().split())\r\np = a/b\r\nq = c/d\r\nk = (1-p)*(1-q)\r\nl = 1-k\r\nprint(p/l)", "a,b,c,d=map(int,input().split())\r\naw=a/b\r\nah=1-aw\r\nbw=c/d\r\nbh=1-bw\r\ncomra=ah*bh\r\nprint(aw*(1/(1-comra)))", "a, b, c, d = (int(a) for a in input().split())\r\n\r\nprint(a / b / (1 - (1 - a / b) * (1 - (c / d))))\r\n", "a, b, c, d = map(int, input().split())\r\nnumerator = a/b\r\nnum = c/d\r\nprint(numerator/(1-(1-numerator)*(1-num)))", "a,b,c,d = input().split()\na = int(a)\nb = int(b)\nc = int(c)\nd = int(d)\n\n\np = a / b\nq = (1 - a / b) * (1 - c / d)\nans = p / (1-q)\n\nprint(\"{:.10f}\".format(ans))\n \t\t \t\t\t\t\t\t\t\t\t\t\t \t \t \t\t\t\t\t\t\t", "a,b,c,d=map(int,input().split())\r\ns=a/b\r\nt=c/d\r\nprint(s/(1-(1-s)*(1-t)))", "\na,b,c,d = map(int,input().split())\na = a/b\naa=1-a\nr = (1-(c/d))*aa\n# print(a,r)\nsum = a/(1-r)\nprint(sum)\n \n\n\n \t \t \t \t \t\t \t\t\t \t \t\t\t\t\t", "l = input().split()\np = int(l[0]) / int(l[1])\nd = int(l[2]) / int(l[3])\n\nprint(p / (d + p - p * d))\n\t \t\t \t\t\t \t \t\t \t \t \t\t\t", "a,b,c,d=map(int,input().split())\r\ne=a/b\r\nf=c/d\r\nprint(e*(1/(1-((1-f)*(1-e)))))", "a,b,c,d=map(int,input().split());print((a/b)/(1-(1-c/d)*(1-a/b)))", "\r\n\r\ndef main():\r\n a, b, c, d = map(int, input().split())\r\n p = a / b\r\n q = (1 - c / d) * (1 - p)\r\n print(p / (1 - q))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "a,b,c,d=map(int,input().split())\r\nprint(round((a*d)/(a*d+b*c-a*c),9))", "a,b,c,d = map(int, input().split())\r\nx = 1 - a/b\r\ny = 1 - c/d\r\nans = (a)/((b)*(1 - x*y))\r\nprint(ans)", "a,b,c,d = list(map(int,list(input().split())))\np = a/b\nq = c/d\nr = (1-p)*(1-q)\nprint(p/(1-r))", "a, b, c, d = map(int, input().split())\r\nprint((a/b)/(1-(1-(a/b))*(1-(c/d))))", "import sys\r\nimport math\r\ndef fn(a,b,c,d):\r\n w = b*d - ((b-a)*(d-c))\r\n x = a*d\r\n \r\n p = x/w\r\n return p\r\n \r\nif __name__ == '__main__': \r\n input = sys.stdin.read()\r\n data = list(map(float, input.split()))\r\n a = (data[0])\r\n b = data[1]\r\n c = data[2]\r\n d= data[3]\r\n print(fn(a,b,c,d))", "a, b, c, d = map(int, input().split())\r\nA = a / b\r\nB = (1 - a / b) * (1 - c / d)\r\nprint(A / (1 - B))", "#!/usr/bin/env python\n# -*- coding: utf-8 -*-\n#\n# Archer.py\n# \n# Copyright 2020 Md Sidratul Muntaher Tibrow <[email protected]>\n# \n# This program is free software; you can redistribute it and/or modify\n# it under the terms of the GNU General Public License as published by\n# the Free Software Foundation; either version 2 of the License, or\n# (at your option) any later version.\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, write to the Free Software\n# Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,\n# MA 02110-1301, USA.\n# \n# \n\n\ndef main(args):\n\tn = list(map(int, input().split(' ')))\n\ta = n[0]\n\tb = n[1]\n\tc = n[2]\n\td = n[3]\n\tprint(a*d/(a*d+c *(b-a)))\n\nif __name__ == '__main__':\n import sys\n sys.exit(main(sys.argv))\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\na, b, c, d = iia()\r\np = a / b\r\nq = (1 - c / d) * (1 - a / b)\r\nprint(p / (1 - q))\r\n", "import fractions as F\r\n\r\na, b, c, d = map(int, input().split())\r\n\r\np = a/b\r\nq = c/d\r\n\r\nans = 0\r\n\r\nfor i in range(100000):\r\n ans += (((1-p)*(1-q))**i) * p\r\n\r\n\r\nprint(float(ans))", "a,b,c,d = input().split()\na = int(a)\nb = int(b)\nc = int(c)\nd = int(d)\n\np = (a*d)/(b*c+a*d-a*c)\nprint(p)", "##Ps = a/b + ((1-a/b)*(1-c/d))*(Ps)\r\n## c/d + a/b - ac/bd\r\n##Ps * (-1+c/d+1) = a/b\r\n##\r\n##Ps = a*d / b*c\r\na,b,c,d=map(int,input().split())\r\n\r\nprint(a/(b*(c/d + a/b - (a*c)/(b*d))))\r\n", "a, b, c, d = map(int, input().split())\n\np = a / b\nq = (1 - a / b) * (1 - c / d)\n\nprint(\"%.15f\" % (p/(1-q)))\n \t\t \t\t \t\t\t\t \t\t\t\t\t \t \t\t\t", "vetor = input().split()\na = int(vetor[0])\nb = int(vetor[1])\nc = int(vetor[2])\nd = int(vetor[3])\n\ntermo_inicial = a/b\nrazao = (1-a/b)*(1-c/d)\nsoma = termo_inicial/(1-razao)\n\nprint(soma)\n\t \t \t \t\t\t\t \t \t \t \t", "nums = [int(tok) for tok in input().split(\" \")]\n\na, b, c, d = nums\n\nprint ((a*d)/(a*d + b*c - a*c))", "a,b,c,d = map(int,input().split())\r\np=a/b\r\nq=c/d\r\nprint (p/(p+q-p*q))\r\n", "s=input().split()\n\na=int(s[0])\nb=int(s[1])\nc=int(s[2])\nd=int(s[3])\n\nx=a/b\ny=(1-x)*(c/d)\n\nfor i in range(10000):\n x+=(1-(x+y))*(a/b)\n y+=(1-(x+y))*(c/d)\n\nprint(x)\n", "a, b, c, d = map(int, input().split())\n\ns = a / (b - ((a * (c - d) + b * (d - c)) / d))\n\nprint(s)\n\n \t\t \t \t\t\t\t \t \t \t\t\t\t\t \t", "a, b, c, d = input().split()\n\np = int(a)/int(b)\n\nq = int(c)/int(d)\n\nsmallr = p/(1 - (1 - p) * (1 - q))\n\nprint(smallr)\n\n \t\t\t\t\t \t\t \t \t \t \t\t \t", "a,b,c,d=list(map(int,input().split()))\r\nprint((a/b)/(1-(1-(a/b))*(1-(c/d))))", "### B. Archers\r\na,b,c,d=map(int, input().split())\r\nx=a/b\r\ny=c/d\r\nt=(1-x)*(1-y)\r\nprint(round(x/(1-t), 10))", "a, b, c, d = map(int, input().split())\r\nnumerator = a*d\r\ndenominator = b*c + a*d - a*c\r\nprint(numerator / denominator)\r\n", "a,b,c,d=map(int,input().split())\r\nk=(1-a/b)*(1-c/d)\r\nprint(round((a/b)*(1/(1-k)),12))", "import sys\r\ndef input():\r\n return sys.stdin.readline().strip()\r\n \r\n \r\ndef iinput():\r\n return int(input())\r\n \r\n \r\ndef tinput():\r\n return input().split()\r\n \r\n \r\ndef rinput():\r\n return map(int, tinput())\r\n \r\n \r\ndef rlinput():\r\n return list(rinput())\r\n\r\na,b,c,d = rinput()\r\nprint((a/b)/(1-((1-a/b)*(1-c/d))))", "a,b,c,d = map(int, input().split())\r\n\r\nx = (b-a)*(d-c)\r\ny = d*b\r\nn = 10000\r\np = (pow(x,n)-pow(y,n)) * a\r\nq = (x * pow(y,n-1) - pow(y,n)) * b\r\nprint(p/q)", "import random\r\na, b, c, d = [int(xx) for xx in input().split()]\r\nans = 0\r\nz = 0\r\np = 1\r\nk = 1\r\nfor i in range(10 ** 5):\r\n ans += (a / b) * (k)\r\n k -= k * (a / b + (1 - a / b) * c / d)\r\n p *= ((c / d) * (1 - k))\r\nprint(ans)\r\n", "a,b,c,d=map(int,input().split())\r\np=a/b\r\nq=(1-c/d)*(1-a/b)\r\nprint(p/(1-q))\n# Sat Jul 24 2021 12:28:22 GMT+0300 (Москва, стандартное время)\n", "a,b,c,d = map(int,input().split())\r\nx = a/b\r\ny = ((b-a)/b) * ((d-c)/d)\r\nprint(x/(1-y))", "def main():\n\n txt = input()\n txt = txt.split()\n a = float(txt[0])\n b = float(txt[1])\n c = float(txt[2])\n d = float(txt[3])\n\n x = a/b\n y = c/d\n\n q = (1-x)*(1-y)\n\n p = x/(1-q)\n\n print(f'{p:.10}')\nif __name__ == '__main__':\n main()\n\t \t\t\t \t \t \t \t \t \t \t\t \t \t\t", "# import sys\r\n# # Directing input and output from terminal to files\r\n# sys.stdin = open('input.txt', 'r')\r\n# sys.stdout = open('output.txt', 'w')\r\ndef to_binary(n):\r\n return bin(n).replace('0b','')\r\n# Start Coding\r\na,b,c,d=map(int,input().split(' '))\r\np1 = a/b\r\np2= c/d\r\nboth_fail = (1-p1)*(1-p2)\r\nprint(p1/(1-both_fail))\r\n\r\n", "a,b,c,d = map(int, input().split())\n\n\npr, pz = a/b , c/d\n\nprob = (pr) / (1-((1-pr)*(1-pz)))\n\nprint (prob)\n\t \t \t\t\t \t\t \t\t\t\t\t\t\t\t\t \t \t\t", "#!/usr/bin/python3\n\na, b, c, d = tuple(map(int, input().split()))\nprint(1.0 * a * d / (b * d - (b - a) * (d - c)))\n", "import sys\r\nimport bisect\r\nfrom collections import Counter,defaultdict as dd\r\ndef data(): return sys.stdin.readline().strip()\r\ndef out(var): sys.stdout.write(str(var))\r\ndef l(): return list(sp())\r\ndef strl(): return list(strsp())\r\ndef sp(): return map(int, data().split())\r\ndef strsp(): return map(str, data().split())\r\n\r\na,b,c,d=sp()\r\np=(a/b)\r\nq=(1-(a/b))*(1-(c/d))\r\nprint(p/(1-q))", "a,b,c,d= map(int, input().split())\r\np=a/b\r\nq=c/d\r\nr=1-p\r\ns=1-q\r\nm=p/(1-r*s)\r\nprint(m)", "a,b,c,d = map(int, input().split()); print(a*d/(a*d + b*c - a*c))", "a,b,c,d=input().strip().split(\" \")\r\na,b,c,d=[int(a),int(b),int(c),int(d)]\r\np=a/b\r\nq=(1-(a/b))*(1-(c/d))\r\nans=p/(1-q)\r\nprint(ans)", "a,b,c,d=map(float,input().split())\r\nt=(1-a/b)*(1-c/d)\r\nprint(a/b/(1-t))", "import sys\n\nentrada = input().split()\na = int(entrada[0])\nb = int(entrada[1])\nc = int(entrada[2])\nd = int(entrada[3])\nprint((a/b)/(1-((1-(a/b))*(1-(c/d)))))\n \t\t\t \t\t\t\t\t\t \t \t \t\t \t\t\t\t\t", "a,b,c,d=map(int,input().split())\r\nr=((a*d)/(b*d-(b-a)*(d-c)))\r\nprint(r)", "a,b,c,d=map(int,input().split())\nsw=a/b\nsl=(b-a)/b\nzl=(d-c)/d\nx=sw*(1/(1-(sl*zl)))\nprint(x)", "def infinite_sum(a,b,c,d):\n a1 = a/b\n r = (1 - a/b) * (1 - c/d)\n return (a1)/(1-r)\na,b,c,d = [int(i) for i in input().split()]\nprint(infinite_sum(a,b,c,d))\n \t\t\t\t \t \t \t\t \t\t\t\t \t \t \t\t\t\t\t\t", "a,b,c,d = map(int, input().split())\nprint('{:.15f}'.format(a*d/(-a*c+a*d+b*c)))", "a, b, c, d = input().split()\na = float(a)\nb = float(b)\nc = float(c)\nd = float(d)\n\nP = (a/b) / (1 - ((1 -a/b)*(1- c/d)))\nprint(P)\n\t\t \t \t\t \t\t \t\t\t \t\t\t\t \t \t \t", "a, b, c, d = map(int,input().split())\n\nk = (1 - a/b)*(1 - c/d)\nprint(\"%.12f\" % (a/(b*(1-k))))\n", "a, b, c, d=[int(k) for k in input().split()]\r\nq=(1-a/b)*(1-c/d)\r\nprint((a/b)/(1-q))", "a,b,c,d = [int(s) for s in input().split(' ')]\npSmall = a/b\npInimigo = c/d\nprint(pSmall*(1/(1-(1-pSmall)*(1-pInimigo))))\n \t \t \t \t \t \t\t\t \t \t\t \t\t \t\t\t \t", "data = input().split()\r\na, b, c, d = int(data[0]), int(data[1]), int(data[2]), int(data[3])\r\n\r\nsmall_r = a / b\r\nzanoes = c / d\r\n\r\nprint(small_r / (small_r + zanoes - small_r * zanoes))", "a, b, c, d = map(int, input().split())\r\nprint((a/b)/(1-((1-a/b)*(1-c/d))))", "n = input().split()\na = float(n[0])\nb = float(n[1])\nc = float(n[2])\nd = float(n[3])\nprint ((a /b) / ((a /b + c /d) - ((a/b) * (c/d))))\n\n \t \t \t\t\t \t\t \t\t\t\t\t \t\t", "a, b, c, d = map(int, input().split())\r\np1 = a / b\r\np2 = c / d\r\np = p1 / (1 - (1 - p1) * (1 - p2))\r\nprint(p)", "a, b, c, d = [int(x) for x in input().split()]\r\n\r\nx = a/b\r\ny = c/d\r\n\r\nxc = 1 - x\r\nyc = 1 - y\r\n\r\nans = x * (1/ (1 - xc*yc))\r\n\r\nprint(ans)", "a,b,c,d=input().split(\" \")\r\na=int(a)\r\nb=int(b)\r\nc=int(c)\r\n\r\nd=int(d)\r\np=a/b\r\nq=c/d\r\nf=p*((1)/(1-(1-p)*(1-q)))\r\nprint(f)", "a,b,c,d = map(int,input().split())\r\np = a/b\r\nq = c/d\r\nwining_prob = p*(1/(p+q-p*q))\r\nprint('{:0.12f}'.format(wining_prob))", "a,b,c,d = map(int,input().split())\r\ns = a/b\r\nno = c/d\r\nprint((s*no + s*(1-no))/(1 - (1-s)*(1-no)))", "a,b,c,d=map(int,input().split())\r\nx,y=a/b,c/d\r\nprint(x/(x+y-x*y))", "lt = [int(x) for x in input().split()]\r\n\r\na = lt[0]\r\nb = lt[1]\r\nc = lt[2]\r\nd = lt[3]\r\n\r\nx = 1 - a/b\r\ny = 1 - c/d\r\nr = x*y\r\n\r\nprint(a/b/(1-r))\r\n", "a,b,c,d=map(int,input().split())\r\np=a/b \r\nq=(1-a/b)*(1-c/d)\r\nprint(p/(1-q))", "a,b,c,d = map(float,input().split())\nz = a*d/(a*d+c*(b-a))\nprint(f\"{z:.6f}\")\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n# print(f\"{a:.2f})\n", "a, b, c, d = map(int, input().split())\np1w = a/b\np1l = 1 - a/b\np2w = c/d\np2l = 1 - c/d\n\nprint(p1w*(1/(1-p1l*p2l)))\n", "def find_prob(a, b, c, d):\n k1 = a / b\n k2 = (1 - (a / b))\n k3 = (1 - (c / d))\n ans = k1\n i = 1\n x = 1\n y = k1\n while i < 1000000:\n x = ans\n y += k1 * (k2 ** i) * (k3 ** i)\n ans = y\n i += 1\n return ans\n\nl = list(map(int, input().split()))\nprint(find_prob(l[0], l[1], l[2], l[3]))\n\t \t\t\t \t \t\t\t\t \t \t \t \t\t", "def solve():\n r= (1-a/b)*(1-c/d)\n s = (a/b)/(1-r)\n return s\n\n \n \n \n\n\n\n\n \n\n\n\n\n \n \nfrom sys import stdin\ninput = stdin.readline\n \n'''\nm,n= [int(x) for x in input().split()]\narr=[]\nfor i in range(m):\n arr.append([int(x) for x in input().split()])\n'''\na,b,c,d=[int(x) for x in input().split()]\nprint(solve())", "import sys\nimport math as mt\nimport bisect\n#input=sys.stdin.buffer.readline \n#t=int(input())\nt=1\nfor __ in range(t):\n #s=input()\n #n=int(input())\n a,b,c,d=map(int,input().split())\n #l=list(map(int,input().split()))\n r=(1-(a/b))*(1-(c/d))\n ans=(a/b)/(1-r)\n print(ans)\n \t\t \t\t\t \t\t\t \t \t \t \t \t \t\t\t\t", "tmp = input().split(' ')\na = []\nfor i in range( 0 , 4 ):\n a.append( int( tmp[ i ] ) )\n\np1 = a[ 0 ] / a[ 1 ]\np2 = a[ 2 ] / a[ 3 ]\n\ntot = 10 ** 5\nans = 0.0000000000000\nfor i in range( 0 , tot ):\n ans = ans + ( 1 - p1 ) ** i * ( 1 - p2 ) ** i * p1\n\nprint ( ans )\n", "def main():\n a, b, c, d = [int(x) for x in input().split()]\n\n smallR = a / b\n zanoes = c / d\n\n ret = smallR / (1 - ((1 - smallR) * (1 - zanoes)))\n\n print(ret)\n\n\nif __name__ == '__main__':\n main()\n\t \t\t\t\t \t \t \t\t\t \t\t\t \t\t \t\t \t\t\t", "\r\n\r\na, b, c, d = map(int, input().split())\r\n\r\nprint((a/b) / (1 - (1-a/b)*(1-c/d)))\r\n\r\n\r\n# a = [0] * 7\r\n# def check_possibility(s, drop_count):\r\n# if s < 7:\r\n# a[s] += 1 / drop_count\r\n#\r\n# total = 0\r\n# for a1 in range(1, 7):\r\n# check_possibility(a1, 6)\r\n# for a2 in range(1, 7):\r\n# check_possibility(a1 + a2, 6**2)\r\n# for a3 in range(1, 7):\r\n# check_possibility(a1 + a2 + a3, 6**3)\r\n# for a4 in range(1, 7):\r\n# check_possibility(a1 + a2 + a3 + a4, 6**4)\r\n# for a5 in range(1, 7):\r\n# check_possibility(a1 + a2 + a3 + a4 + a5, 6**5)\r\n# for a6 in range(1, 7):\r\n# check_possibility(a1 + a2 + a3 + a4 + a5 + a6, 6**6)\r\n#\r\n# print(a)\r\n# r = 0\r\n# print(sum(a) / 6)\r\n#\r\n# print(total)\r\n", "a,b,c,d = map(int,input().strip().split())\r\n\r\np = a/b\r\nq = c/d\r\n\r\nprint(p/(q+p - p*q))", "a, b, c, d = map(int, input().split())\r\nans = (a/b)/(1-(1-a/b)*(1-c/d))\r\nprint(ans)", "a,b,c,d=map(int,input().split())\r\nprint(a*d/(b*c+a*d-a*c))", "def main():\n #Soma de PG infinita\n \n a, b, c, d = [int(x) for x in input().split()]\n pSmallR = a/b\n pZanoes = c/d\n return pSmallR / (1 - ((1-pSmallR)*(1-pZanoes)))\n\nprint(main())\n\t \t\t\t \t\t\t\t\t \t \t \t\t\t\t\t\t \t", "a,b,c,d = map(int, input().split())\r\n\r\nprint(a / b / (1 - (b - a) * (d - c) / d / b))", "a, b, c, d = map(int, input().split())\np = a / b\nq = 1 - ((1 - p) * (1 - c / d))\nprint(p / q)\n\t\t \t\t \t \t \t \t \t\t \t \t\t\t\t\t \t", "a,b,c,d=[int(x) for x in input().split()]\r\np1=a/b\r\np2=c/d\r\np=p1/(1-(1-p1)*(1-p2))\r\nprint('{:.10f}'.format(round(p, 10)))\r\n", "a, b, c, d = map(int, input().split())\nd = 1 - (1 - a/b) * (1 - c/d)\nprint(a / b / d)\n", "a, b, c, d = map(int, input().split())\r\np = a / b\r\nq0 = (d - c) / d\r\nq1 = (b - a) / b\r\nprint(p / (1 - q0 * q1))", "a,b,c,d=map(int,input().split())\r\nk=((b-a)/b)*((d-c)/d)\r\nx=(a/b)*((1/(1-k)))\r\nprint('%.12f'%x)\r\n", "a, b, c, d = [int(x) for x in input().split(' ')]\r\np_1 = a / b\r\np_2 = c / d\r\nq = (1 - p_1) * (1 - p_2)\r\nprint(p_1 / (1 - q))", "a=[int(x) for x in input().split()]\r\nprint((a[0]/a[1])/(1-(1-a[2]/a[3])*(1-a[0]/a[1])))", "a,b,c,d=map(int,input().split())\r\nprint((a*d)/((a*d)+(b*c)-(a*c)))", "a, b, c, d = map(int, input().split())\r\nprint(a*d/(b*c + a*d - a*c))\r\n", "a, b, c, d = map(int, input().split())\r\nsmallr = a / b\r\nzanoes = c / d\r\nbad_cases = 1\r\nres = 0\r\nfor i in range(1000000):\r\n res += smallr * bad_cases\r\n bad_cases *= (1-smallr) * (1-zanoes)\r\nprint(res)", "a,b,c,d=[int(i) for i in input().split()]\r\n\r\ndenominator=1-(((b-a)/b)*((d-c)/d))\r\nnumerator=(a/b)\r\n\r\nans=numerator/denominator\r\nprint(ans)", "a,b,c,d=map(int,input().split())\r\ns=(a/b)/(1-(1-a/b)*(1-c/d))\r\nprint(s)", "a, b, c, d = map(float, input().split())\np = a / b\nq = (1 - a / b) * (1 - c / d)\n\nans = p / (1 - q)\n\nprint(\"{:.15f}\".format(ans))\n \t \t \t\t\t \t \t \t \t\t \t", "a, b, c, d = map(int, input().split())\r\np1 = a/b\r\np2 = c/d\r\nq = (1-p1)*(1-p2)\r\np = p1/(1-q)\r\nprint(p)", "def main():\n a, b, c, d = [int(x) for x in input().split()]\n a1 = a/b\n q = (1 - a/b) * (1 - c/d)\n p = a1 / (1 - q)\n\n print(p)\n\nmain()\n\t\t\t\t\t \t\t \t\t\t\t \t\t\t \t\t\t\t \t", "def get_f_win_chance(f_num, f_denom, s_num, s_denom):\r\n f_hit_ch = f_num / f_denom\r\n s_hit_ch = s_num / s_denom\r\n f_win_ch = 0\r\n prob_remainder = 1\r\n while prob_remainder > 10 ** (-8):\r\n f_this_hit_win_ch = f_hit_ch * prob_remainder\r\n prob_remainder -= f_this_hit_win_ch\r\n f_win_ch += f_this_hit_win_ch\r\n\r\n s_this_hit_win_ch = s_hit_ch * prob_remainder\r\n prob_remainder -= s_this_hit_win_ch\r\n return f_win_ch\r\n\r\n\r\nif __name__ == '__main__':\r\n f_num, f_denom, s_num, s_denom = (int(x) for x in input().split())\r\n print(get_f_win_chance(f_num, f_denom, s_num, s_denom))\r\n", "# -*- coding: utf-8 -*-\n\"\"\"Untitled100.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1-tGPwz_e39dRycgZeJgcGObYBpna_emb\n\"\"\"\n\nl1=list(map(int,input().split()))\na=l1[0]\nb=l1[1]\nc=l1[2]\nd=l1[3]\ne=1-(a/b)\nf=1-(c/d)\npro=(a/b)*(1/(1-(e*f)))\nprint(pro)", "R=lambda:map(int,input().split())\r\na,b,c,d=R()\r\ns=a/b\r\nz=c/d\r\nr=(s/(1-((1-s)*(1-z))))\r\nprint(r)\r\n", "a, b, c, d = map(int, input().split())\r\nprint(a/b / (1 - (1 - a/b) * (1 - c/d)))", "a,b,c,d = map(int,input().split())\r\nz = a/b\r\nx = 1 - (a/b)\r\ny = 1 - (c/d)\r\nm = 1/(1-(x*y))\r\nprint(z*m)\r\n", "[a,b,c,d] = list(map(float,input().split()))\r\nal = a/b\r\nbe = c/d\r\nde = (1-al)*(1-be)\r\nprint(al/(1-de))", "eingabe = input()\r\ny = [float(x) for x in eingabe.split(\" \")]\r\np = y[0]/y[1]\r\nq = y[2]/y[3]\r\nr = -p/(p*q-p-q)\r\nprint(r)", "a,b,c,d=map(int,input().split())\r\nif a/b==1.0:\r\n print(1.0)\r\nelse:\r\n k1=(1-(c/d))\r\n k2=(1-(a/b))\r\n k3=(a/b)/(1-((k1)*(k2)))\r\n print(k3)", "entrada = []\nentrada = input().split(\" \")\n\npS = int(entrada[0])/int(entrada[1])\npZ = int(entrada[2])/int(entrada[3])\n\nprint(pS/(1-(1-pS)*(1-pZ)))\n \t \t\t \t\t \t\t\t \t\t \t \t \t\t\t \t", "inp = [int(x) for x in input().split()]\r\na = inp[0]\r\nb = inp[1]\r\nc = inp[2]\r\nd = inp[3]\r\np1 = a / b\r\np2 = c / d\r\nprint(p1 / (1 - (1 - p1) * (1 - p2)))", "a,b,c,d=map(int,input().split())\r\n\r\ndef prob(p, q):\r\n \r\n probability_smallR_wins = p / (1 - (1 - p) * q)\r\n\r\n return probability_smallR_wins\r\n\r\n\r\nprint(prob(a/b,1-c/d))\r\n", "a,b,c,d=map(int,input().split())\r\nden=b*d-(b-a)*(d-c)\r\nprint((a/b)*(b*d/den))", "a, b, c, d = map(int, input().split())\n\np = a / b\nq = c / d\n\nprint((p)/(1-(1-p)*(1-q)))\n \t\t\t \t \t\t\t \t\t\t\t\t\t \t \t\t\t\t", "def main():\r\n a, b, c, d = map(int, input().split())\r\n smallR_p = a / b\r\n zanoes_p = c / d\r\n print(smallR_p / (1 - (1 - smallR_p) * (1 - zanoes_p)))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "a,b,c,d = list(map(int,input().split()))\np=a/b\nq=1-c/d\na1=p\nr=(1-p)*q\nprint(a1/(1-r))\n\n\t \t\t \t\t \t \t\t\t\t\t\t \t\t\t", "a,b,c,d=map(int,input().split())\r\np,q=a/b,(1-a/b)*(1-c/d)\r\nprint(round(p/(1-q),12))", "a,b,c,d=map(int,input().split())\r\npa=(a/b)\r\npa1=1-pa\r\npb=(c/d)\r\npb1=1-pb\r\n\r\nprint(pa/(1-pa1*pb1))", "a,b,c,d = input().split()\r\na,b,c,d = int(a), int(b), int(c), int(d)\r\n\r\nnr = a*d\r\ndr = b*c + a*d - a*c \r\n\r\nprint(nr/dr)", "# n = int (input())\r\n# pointx,pointy=[],[]\r\n# for i in range(n):\r\n# x , y = map(int,input().split())\r\n# pointx.append(x)\r\n# pointy.append(y)\r\n# ans = max(max(pointx)-min(pointx),max(pointy)-min(pointy))\r\n# print(ans * ans)\r\na ,b ,c, d = map(int ,input().split())\r\nq = 1-(1-a/b)*(1-c/d)\r\nprint(a/b/q)\r\n\r\n", "n = input()\r\na,b,c,d = n.split()\r\na = float(a)\r\nb = float(b)\r\nc = float(c)\r\nd = float(d)\r\n\r\nstart = a/b\r\n\r\nr = (1-start)*(1- c/d)\r\n\r\nans = start/(1-r)\r\n\r\nprint(ans)\r\n", "a,b,c,d = map(int , input().split())\nsatu = a/b\ndua = c/d\nhasil = satu/(satu+dua-(dua*satu))\nprint(hasil)\n \n\n", "a,b,c,d=map(int,input().split())\r\nt=(1-a/b)*(1-c/d)\r\nans=(a/b)/(1-t)\r\nprint(round(ans,9))", "a, b, c, d = map(int, input().split())\r\n\r\nm = a / b\r\nn = c / d\r\n\r\nprint(m / (m + n - m * n))", "a,b,c,d=map(int,input().split())\r\nA=a/b\r\ni=1-a/b\r\nj=1-c/d\r\nr=i*j\r\nprint(A/(1-r))", "entrada = [float(x) for x in input().split()]\nnum1 = entrada[0]/entrada[1]\nnum2 = entrada[2]/entrada[3]\nprint(\"%.12f\" % (num1/(num1+num2-num1*num2)))\n", "def toFixed(numObj, digits=0): return f\"{numObj:.{digits}f}\"\r\na, b, c, d = map(int, input().split())\r\nprint(toFixed ((a / b) / ((a / b) + (c / d) - (a / b) * (c / d)), 12))\n# Sat Aug 20 2022 09:11:40 GMT+0000 (Coordinated Universal Time)\n", "a, b, c, d = [int(i) for i in input().split()]\r\n\r\nP = 0\r\n\r\nfor i in range(10000):\r\n P += a/b*((1-a/b)*(1-c/d))**i\r\n\r\nprint(P)\r\n\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\na,b,c,d = map(int, input().split())\r\n\r\np = a/b\r\nq = (1-a/b)*(1-c/d)\r\nprint(p/(1-q))", "a,b,c,d=map(int,input().split(' '))\r\nt = (1-a/b)\r\ntt =(1-c/d)\r\nrr = a/b\r\nrrr = 1-t*tt\r\nprint(rr/rrr)\r\n", "import random\ndef main():\n\n inp = [(int)(e) for e in input().split()]\n a,b,c,d = inp\n p,q = a/b,c/d\n \n print((a/b)/(1-((1-p)*(1-q))))\n\nmain()\n \t \t \t \t \t \t\t\t\t \t\t\t", "a,b,c,d=map(int,input().split());print((a/b)*(b*d)/(a*d+c*b-a*c))", "a, b, c, d = map(int, input().split())\r\n\r\neps = 1e-12\r\n\r\np = 0\r\npre = 1.\r\nwhile True:\r\n delta = 1.0 * pre * a / b \r\n if delta < eps:\r\n break\r\n pre = pre * (b - a) / b * (d - c) / d\r\n p += delta\r\nprint(p)\r\n", "a,b,c,d=map(int, input().split())\r\nprint((a/b)/(1-((1-c/d)*(1-a/b))))", "a,b,c,d = map(int,input().split())\r\n\r\nprint(a*d/(a*d+c*b-a*c))", "a, b, c, d = map(int, input().split())\r\np = a / b\r\nq = c / d\r\nf = (1 - p) * (1 - q)\r\nprint (p / (1 - f))", "a,b,c,d = [int(x) for x in input().split()]\r\nans = (a*d)/(a*d+b*c-a*c)\r\nprint(ans)", "num = list(map(int, input().split()))\ns = num[0]/num[1]\nz= num[2]/num[3]\n\nprint((s)/(s+z-(s*z)))\n\t \t \t \t \t \t \t\t \t\t\t \t \t\t", "a,b,c,d=map(int,input().split())\r\nans=a*d/(b*c+a*d-a*c)\r\nprint(ans)", "I=list(input().split())\r\np1=(int(I[0]))/(int(I[1]))\r\np2=(int(I[2]))/(int(I[3]))\r\nprint(p1*(1/(1-(1-p1)*(1-p2))))\r\n", "a,b,c,d=map(int,input().split())\np=a/b\nq=c/d\nq=(1-q)*(1-p)\nans=p/(1-q)\nprint(ans)", "a, b, c, d = [int(i) for i in input().split()]\n\nprobSmallR = a / b\nprobAux = (1 - a / b) * (1 - c / d)\n\nresult = probSmallR / (1 - probAux)\nprint(result)\n \t \t\t \t\t \t\t \t\t \t \t \t\t\t \t\t\t \t", "a,b,c,d = map(int,input().split())\r\nnum = a*d\r\nden = (b*d)-(b-a)*(d-c)\r\nprint(num/den)", "arr = input().split()\r\nfor i in range(4):\r\n\tarr[i] = int(arr[i])\r\na = arr[0]\r\nb = arr[1]\r\nc = arr[2]\r\nd = arr[3]\r\nprint((a*d)/(a*d + c*b - a*c))", "a, b, c, d = map(int, input().split())\r\nprint((a*d)/(b*c+a*d-a*c))\r\n", "import math\nimport re\nfrom fractions import Fraction\nfrom collections import Counter\n\nclass Task:\n a, b, c, d = 0, 0, 0, 0\n answer = 0\n \n def __init__(self):\n self.a, self.b, self.c, self.d = [int(x) for x in input().split()]\n\n def solve(self):\n a, b, c, d = self.a, self.b, self.c, self.d\n p = a / b\n q = c / d\n x = (1 - p) * (1 - q)\n self.answer = p / (1 - x)\n\n def printAnswer(self):\n print(self.answer)\n\ntask = Task()\ntask.solve()\ntask.printAnswer()\n", "a,b,c,d = map(int,input().split())\r\n\r\nt = a/b\r\nt1 = (1-(a/b))*(1-(c/d))\r\n\r\nr = t/(1-t1)\r\nprint((r))", "a,b,c,d=map(int,input().split())\r\n\r\nprint((a/b)/(1-((d-c)*(b-a))/(d*b)))\r\n", "a,b,c,d=map(int,input().split())\r\np=1-(a/b)\r\nq=1-(c/d)\r\nr1=a/b\r\nr2=1-(p*q)\r\nr=r1/r2\r\nprint(r)", "a, b, c, d = map(int, input().split())\r\nprint((a/b) / ((c/d)+(a/b)-(a/b)*(c/d)))\r\n", "#!/usr/bin/env python3\r\na, b, c, d = [int(x) for x in input().split()]\r\n\r\nprob = (a/b) / (1 - (1-a/b)*(1-c/d))\r\nprint(prob)\r\n", "a, b, c, d = map(int, input().split())\r\nres = current = (1-a/b)*(1-c/d)\r\nres += 1\r\nwhile current > 10**(-20):\r\n current = current*(1-a/b)*(1-c/d)\r\n res += current\r\nprint(res*a/b)", "arr = input().split()\r\na = int(arr[0])\r\nb = int(arr[1])\r\nc = int(arr[2])\r\nd = int(arr[3])\r\nprint(a*d/( a*d + b*c - a*c) )\r\n", "import random\r\na,b,c,d=map(int,input().split())\r\n\"\"\"\r\ni=0\r\nres1,res2=0,0\r\nwhile i<1000000:\r\n x=random.randint(1,b)\r\n if x<=a:\r\n res1+=1\r\n else:\r\n y=random.randint(1,d)\r\n if y<=c:\r\n res2+=1\r\n i+=1\r\nprint(res1/(res1+res2))\"\"\"\r\n\"\"\"x=a/b\r\ni=0\r\nll=[a/b,(b-a)/b,(d-c)/d]\r\nt=ll[1]*ll[2]\r\nres=a/b\r\nwhile i<1000000:\r\n res+=(x*t)\r\n t*=t\r\n i+=1\"\"\"\r\nprint((a/b)/(1-((b-a)/b)*((d-c)/d)))", "a, b, c, d = (int(x) for x in input().split())\n\n# prob to win on 1st round\nP_s = a / b\nP_z = c / d\n\n# prob to win on i-th round:\n# prob_fail = 1 - prob_win_s\n# prob_fail_i_round = prob_fail_s^i * prob_fail_z^i\n# prob_1st_round * prob_fail_i-1_rounds\n\n# using gp sum formula\n# S = a / (1 - r)\n# where r = prob_fail_s*prob_fail_z\n# a = prob_win_s\n\nprint(P_s / (1 - (1 - P_s) * (1 - P_z)))\n\n \t \t\t \t\t\t\t\t \t \t\t\t \t\t", "n = list(map(int,input().split(\" \")))\r\na = int(n[0])\r\nb = int(n[1])\r\nc = int(n[2])\r\nd = int(n[3])\r\np = a/b\r\nq = c/d\r\nprint(p/(1-(1-q)*(1-p)))", "import math\r\nfrom sys import stdout\r\nfrom math import sqrt, inf, gcd, ceil, tan, pi, sin, cos, floor, perm, comb\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\nMOD_9 = 998244353\r\nMOD_1 = 1000000007\r\n\r\ndef next_int():\r\n return int(input())\r\n\r\ndef next_ints():\r\n return tuple(map(int, input().split(' ')))\r\n\r\ndef next_list():\r\n return list(map(int, input().split(' ')))\r\n\r\ndef dis(from_loc, to_loc, *, manhattan_distance = False):\r\n result = 0\r\n if not manhattan_distance:\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 += abs(from_loc[i] - to_loc[i])\r\n return result\r\n\r\ndef vector(from_loc, to_loc):\r\n return to_loc[0] - from_loc[0], to_loc[1] - from_loc[1]\r\n\r\ndef product_loc(from_loc, first_loc, second_loc):\r\n vector1 = vector(from_loc, first_loc)\r\n vector2 = vector(from_loc, second_loc)\r\n return vector1[0] * vector2[1] - vector2[0] * vector1[1]\r\n\r\ndef product_vec(vector1, vector2):\r\n return vector1[0] * vector2[1] - vector2[0] * vector1[1]\r\n\r\ndef dot(from_loc, first_loc, second_loc):\r\n vector1 = vector(from_loc, first_loc)\r\n vector2 = vector(from_loc, second_loc)\r\n return vector1[0] * vector2[0] + vector1[1] * vector2[1]\r\n\r\ndef get_line_equation(first_loc, second_loc):\r\n\r\n if first_loc == second_loc:\r\n return None\r\n\r\n line_vector = vector(first_loc, second_loc)\r\n line_gcd = gcd(line_vector[0], line_vector[1])\r\n line_a, line_b = line_vector[1] // line_gcd, -line_vector[0] // line_gcd\r\n line_c = - line_b * first_loc[1] - line_a * first_loc[0]\r\n if line_a < 0:\r\n line_a, line_b, line_c = -line_a, -line_b, -line_c\r\n elif line_a == 0:\r\n if line_b < 0:\r\n line_b, line_c = -line_b, -line_c\r\n return line_a, line_b, line_c\r\n\r\ndef get_point_loc(line_equation, *, x_loc = None, y_loc = None):\r\n\r\n line_a, line_b, line_c = line_equation\r\n if y_loc is None and line_b != 0:\r\n return float(x_loc), -(line_a * x_loc + line_c) / line_b\r\n elif x_loc is None and line_a != 0:\r\n return -(line_b * y_loc + line_c) / line_a, float(y_loc)\r\n else:\r\n return None\r\n\r\n\r\ndef summon_primes_val(val):\r\n arr = []\r\n for i in range(2, val + 1):\r\n skip = False\r\n for index in range(len(arr)):\r\n if i % arr[index] == 0:\r\n skip = True\r\n break\r\n if skip:\r\n continue\r\n arr.append(i)\r\n return arr\r\n\r\n# -------- functions[clearable] --------\r\n\r\n\r\n# -------- solve[clearable] --------\r\n\r\ndef solve() -> None:\r\n a, b, c, d = next_ints()\r\n print(a * d / (c * b + a * d - a * c))\r\n\r\n\r\n# -------- main --------\r\n\r\nT = 1\r\n# T = int(input())\r\nfor _ in range(T):\r\n solve()\r\n", "a, b, c, d = map(int, input().split())\r\nps = a/b\r\np2 = c/d\r\ni = 0\r\np = 0\r\np = ps/(1-(1-ps)*(1-p2))\r\nprint(p)", "a,b,c,d = map(int,input().split())\r\nx = a/b\r\ny = c/d\r\nprint(x/(x+y - (x*y)))", "# ex I - semana 2 (Maratona IC)\n\na, b, c, d = [int(x) for x in input().split()]\n\na_b = a/b\nc_d = c/d\n\nprob = a_b / (a_b + c_d - (a_b * c_d))\n\nprint(prob)\n\t\t\t \t\t\t\t \t\t \t\t \t\t\t \t\t \t", "a, b, c, d = [int(k) for k in input().split()]\nprobAcertoA = a/b\nprobErroB = 1 - (c/d)\nprobErroA = 1 - (a/b)\nprobDoisErros = probErroB*probErroA\n# Soma da PG infinita\nprint(probAcertoA/(1-probDoisErros))\n\t \t \t\t\t \t \t \t\t \t \t \t\t \t", "from sys import stdin ,stdout\r\nfrom os import path\r\nrd = lambda:stdin.readline().strip()\r\nwr = stdout.write\r\nif(path.exists('input.txt')):\r\n stdin = open(\"input.txt\",\"r\")\r\nimport time ,math\r\n#------------------------------------=\r\na,b,c,d = map(int,rd().split())\r\nprint((a/b)/(1-((1-a/b)*(1-c/d))))", "a,b,c,d = input().split()\r\na,b,c,d = int(a),int(b),int(c),int(d)\r\nprint( \"%.12f\" % ((a/b)*( 1/( 1-(1-a/b)*(1-c/d) ) )) )\r\n", "def main():\r\n a, b, c, d = map(int, input().split())\r\n print(\"{:.9f}\".format(a * d / (b * c + a * d - a * c)))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "from sys import stdin, stdout,stderr\r\nimport time,math\r\nfrom collections import defaultdict as dd\r\n \r\ndef pn(ob):stdout.write(str(ob))\r\ndef inp():return stdin.readline()\r\n\r\ndef process():\r\n\ta, b, c, d = map(int, input().split())\r\n\t_s = 1 - (a/b)\r\n\t_z = 1 - (c/d)\r\n\ts = a/b;\r\n\tp = _s*_z;\r\n\tres = (1/(1-p))\r\n\tres = s * res\t\r\n\r\n\tprint(res)\r\n \r\ndef main():\r\n\tt=1\r\n\t#t=int(inp())\r\n\tstart = time.time()\r\n \r\n\twhile (t>0):\r\n\t\tt-=1\r\n\t\tprocess()\r\n\tend = time.time()\r\n\t#stderr.write('\\nelapsed time'+str(end - start))\r\n \r\nif __name__ == '__main__':\r\n\tmain()\r\n\t\r\n#n,m=map(int,input().split()) \r\n# for i in range(n):\r\n# t=int(stdin.readline()) # input using fast i/p method \r\n# if t%m == 0:\r\n# stdout.write(str(t)+'\\n') #input using fast o/p method\r\n \r\n# take line of integers as input\r\n# \tarr = list(map(int, inp().split()))", "s = input().split()\r\n(a,b,c,d) = (int(i) for i in s)\r\np = a/b\r\nq = (1-(a/b))*(1-(c/d))\r\nprint(p/(1-q))", "from math import *\r\n#from bisect import *\r\n#from collections import *\r\n#from random import *\r\n#from decimal import *\"\"\"\r\n#from heapq import *\r\n#from random import *\r\nimport sys\r\ninput=sys.stdin.readline\r\n#sys.setrecursionlimit(3*(10**5))\r\nglobal flag\r\ndef inp():\r\n return int(input())\r\ndef st():\r\n return input().rstrip('\\n')\r\ndef lis():\r\n return list(map(int,input().split()))\r\ndef ma():\r\n return map(int,input().split())\r\nt=1\r\nwhile(t):\r\n t-=1\r\n a,b,c,d=ma()\r\n r=a/b\r\n de=1-((1-(a/b))*(1-(c/d)))\r\n print(r/de)\r\n", "import sys\r\nimport math\r\nfrom sys import stdin, stdout\r\n \r\n# TAKE INPUT\r\ndef get_ints_in_variables():\r\n return map(int, sys.stdin.readline().strip().split())\r\ndef get_int(): return int(input())\r\ndef get_ints_in_list(): return list(\r\n map(int, sys.stdin.readline().strip().split()))\r\ndef get_list_of_list(n): return [list(\r\n map(int, sys.stdin.readline().strip().split())) for _ in range(n)]\r\ndef get_string(): return sys.stdin.readline().strip()\r\n \r\ndef main():\r\n # Write Your Code Here\r\n a, b, c, d = get_ints_in_variables()\r\n # probb. of smallR to win = a/b and probb. of smallR to lose = (1-a/b) => (b-a)/b\r\n # probb. of zanoes to win = c/d and probb. of zanoes to lose = (1-c/d) => (d-c)/d\r\n # found Gp(geo progresssion) => sinfi = 1/(1-r)\r\n k = (b-a)/b * (d-c)/d\r\n p = (a/b) * (1/(1-k))\r\n print(p)\r\n\r\n# calling main Function\r\nif __name__ == \"__main__\":\r\n main()", "def archer(a,b,c,d):\r\n loss1=(1-(a/b))\r\n loss2=(1-(c/d))\r\n win1=a/b\r\n return win1*(1/(1-(loss1*loss2)))\r\n\r\n\r\na,b,c,d=map(int,input().strip().split())\r\nprint(archer(a,b,c,d))", "a, b, c, d = map(int, input().split())\r\nprint(a*d/(a*d+b*c-a*c))\r\n", "a, b, c, d = map(int, input().split())\r\nb1 = a/b\r\nq = (1 - a/b)*(1 - c/d)\r\nprint(b1 / (1 - q))\r\n", "a,b,c,d = map(int,input().split())\r\np = a/b\r\ne = c/d\r\nq = (1-p)*(1-e)\r\nprint(p/(1-q))", "a, b, c, d = map(int, input().split())\n\nr = (1-(c/d))*(1-(a/b))\ns = (a/b)/(1-r)\nprint(\"%.12f\" %s)\n\t\t\t\t\t\t \t\t \t\t \t \t\t\t \t \t", "#input\n#a,b,c,d\n#s prob = a/b\n#z prob = c/d\n#prob that S wins\n\na,b,c,d = [int(x) for x in input().split()]\n\ns = a/b\nz = c/d\nprob = s/(1-((1-s)*(1-z)))\nprint(prob)\n\t\t \t\t \t \t\t \t\t \t\t \t\t \t \t", "def main():\n abcd = input().split()\n a = int(abcd[0])\n b = int(abcd[1])\n c = int(abcd[2])\n d = int(abcd[3])\n\n q = (b - a) * (d - c) / (d * b)\n\n print((a/b) * (1 / (1 - q)))\n\nmain()\n \t \t\t\t\t \t \t \t \t\t\t \t\t \t\t\t", "line = input().split()\n\nR = int(line[0])/int(line[1])\nZ = int(line[2])/int(line[3])\n\nprob = R * (1/(1 - ( (1 - Z) * (1 - R))))\n\nprint(prob)\n\t\t \t\t\t \t \t \t \t\t \t \t", "a, b, c, d = map(int, input().split())\nsmallR = a/b\nzanoes = c/d\nans = 0\np = 1\n\nfor i in range(0,10000,1):\n ans += p*(1-smallR) * zanoes\n p = p * (1-smallR) * (1-zanoes)\n\nprint(1-ans)\n \t \t\t \t\t \t\t \t\t\t \t\t \t\t \t \t\t\t", "import math\r\ninp = lambda cast=int: [cast(x) for x in input().split()]\r\nprintf = lambda s='', *args, **kwargs: print(str(s).format(*args), flush=True, **kwargs)\r\n\r\na, b, c, d = inp()\r\nnr, dr = a*d, b*d - (b-a)*(d-c)\r\nprintf('{:.12f}', nr/dr)", "a,b,c,d=list(map(int,input().split()))\r\nnu=a*d\r\nde=b*c+a*d-a*c\r\nans=nu/de\r\nprint(float(ans))", "a,b,c,d = map(int, input().split())\r\ns=a/b\r\nh=(1-c/d)\r\nv=(1-a/b)\r\nrez=s/(1-(h*v))\r\nprint(rez) \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n", "# URL: http://codeforces.com/problemset/problem/312/B\r\n\r\nfrom typing import List\r\n\r\n\r\ndef parse_input() -> List[int]:\r\n return [int(x) for x in input().split()]\r\n\r\n\r\ndef solve(a: int, b: int, c: int, d: int) -> float:\r\n p = a/b\r\n q = c/d\r\n return p / (p + q - q*p)\r\n\r\n\r\nif __name__ == '__main__':\r\n a, b, c, d = parse_input()\r\n print(solve(a, b, c, d))\r\n", "'''inputs are a,b,c,d for probabilities'''\n\narr = input().split()\na,b,c,d = int(arr[0]),int(arr[1]),int(arr[2]),int(arr[3])\nprobSmallArcher = a/b\nprobZanoes = c/d\n\nresult = probSmallArcher/(1-(1-probSmallArcher)*(1-probZanoes))\n\nprint(result)\n \t\t \t\t \t\t \t\t\t\t\t\t\t\t \t\t \t \t\t", "def main():\r\n a, b, c, d = [int(i) for i in input().split()]\r\n # (a/b) + (a/b)*(1 - a/b)(1 - c/d) + a(/b)(1- /a/b)(1 - c/d)\r\n # s = a1 / (1 - q)\r\n answer = (a / b) * 1 / (1 - (1 - a / b) * (1 - c / d))\r\n print(answer)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "a, b, c, d = map(int, input().split())\n\nprint((a / b) / (1 - (1 - a / b) * (1 - c / d)))\n# Sat Apr 16 2022 16:32:33 GMT+0000 (Coordinated Universal Time)\n", "a, b, c, d = [int(i) for i in input().split()]\r\nprint((a*d)/(a*d+b*c-a*c))", "abcd = [int(i) for i in input().split()];\r\n\r\n# убывающая прогрессия S= b1/(1-q)\r\n# q = (1-a/b)*(1-c/d)\r\n# b1 = a/b\r\n\r\nprint(abcd[0]/abcd[1]/ ( 1- (1-abcd[0]/abcd[1]) * (1-abcd[2]/abcd[3]) ))", "a, b, c, d = map(int, input().split())\nprint((a*d)/(b*c+ a*d-a*c))", "def main():\r\n l=[int(x) for x in input().split(' ')]\r\n r=(l[0]*l[3])/(l[1]*l[2]+l[0]*l[3]-l[0]*l[2])\r\n print(r)\r\n \r\nif __name__=='__main__':\r\n main()\r\n ", "import sys\r\ninput = sys.stdin.readline\r\n\r\na, b, c, d = map(int, input().split())\r\np = a/b\r\nq = (1-(a/b))*(1-(c/d))\r\nprint(p/(1-q))", "a,b,c,d=map(int,input().split())\r\nprint(\"%.8f\" % ((a/b)/(1-((b-a)/b)*((d-c)/d))))", "a, b, c, d = map(int, input().split())\nr1 = (1-(a/b))\nr2 = (1-(c/d))\ncerto = a/b \nq = r1*r2\n\n\nif(r2 == 1):\n print(\"%.12f\" % certo)\n quit()\nif(r1 == 1):\n print(\"%.12f\" % 1)\n quit()\nelse:\n s = (a/b)/(1-q)\n print(\"%.12f\" % s)\n\t \t\t\t\t\t \t\t\t \t \t \t \t\t \t\t \t", "a, b, c, d = map(int, input().split())\r\nprint(a * d / (b*c+a*d-a*c))", "a,b,c,d=list(map(int,input().split()));\nalpha=a/b;\nbeta=(b-a)/b;\nbeta=beta*(d-c)/d;\nbeta=1-beta;\nalpha=alpha/beta;\nprint(alpha);", "a,b,c,d = input().split()\na = int(a)\nb = int(b)\nc = int(c)\nd = int(d)\nx = a/b\nxx = 1-x\ny = c/d\nyy = 1-y\nprint(round(x/(1-(xx*yy)),7))", "inp = input().split()\r\na = int(inp[0])\r\nb = int(inp[1])\r\nc = int(inp[2])\r\nd = int(inp[3])\r\nRwin = a/b\r\nRlose = 1-Rwin\r\nZlose = 1-(c/d)\r\nprint( '%.7f' % (Rwin/(1-(Rlose*Zlose))) )", "a,b,c,d = map(int, input().split())\r\nprint ((a/b)/(1-(1-a/b)*(1-c/d)))\r\n", "a,b,c,d = map(int,input().split())\r\nprint((a*d)/(b*c+a*d-a*c))", "import math\r\nL=lambda:list(map(int,input().split()))\r\nM=lambda:map(int,input().split())\r\nI=lambda:int(input())\r\na,b,c,d=M()\r\nprint(a*d/(a*d+b*c-a*c))\r\n", "def solve(i,j,k,l):\r\n a=i/j\r\n b=k/l\r\n ans=a/(1-(1-a)*(1-b))\r\n return ans\r\n\r\ni,j,k,l=map(int,input().split())\r\nprint(solve(i,j,k,l))\r\n", "a, b, c, d = [int(i) for i in input().split()]\r\ns = a/b\r\np = 1\r\nl = 1\r\nt = 0\r\nfor i in range(100000):\r\n p *= (1 - c/d)\r\n l *= (1 - a/b)\r\n t += p * a / b * l\r\nprint(s + t)", "a, b, c, d = input().split()\r\nans = int()\r\n\r\nans =(int(a)*int(d))/((int(a)*int(d))+int(c)*(int(b)-int(a)))\r\nprint(\"%.12f\" % ans)\r\n", "ints = list(map(int, input().split()))\r\nprint((ints[0]/ints[1])/(1-((1-ints[0]/ints[1])*(1-ints[2]/ints[3]))))", "a, b, c, d = map(int, input().split())\r\n\r\nprog_a = (b-a) / b\r\nprog_b = (d-c) / d\r\n\r\nprint((a/b) * (1/(1-prog_a*prog_b)))", "a,b,c,d = map(int,input().split())\r\npro1=a/b\r\npro2=c/d\r\ns =(1-pro1)*(1-pro2)\r\nprint(pro1/(1-s))", "a, b, c, d = map(int, input().split())\r\np1 = a / float(b)\r\np2 = c / float(d)\r\nq1 = 1 - p1\r\nq2 = 1 - p2\r\nl2 = 1 / (1 - q1 * q2)\r\nprint(p1 * q2 * l2 + p1 * p2 * l2)\r\n", "a, b, c, d = list(map(int, input().split()))\nu0 = (a/b)\nq = (1-(a/b))*(1-(c/d))\nprint(u0*(1/(1-q)))\n", "a,b,c,d=map(int, input().split())\r\n\r\n\r\nz= (a/b)/(1-((1-(a/b))*(1-(c/d))))\r\n\r\nprint (z)", "a, b, c, d = map(int, input().split())\r\nanswer = a * d / (a*d+b*c-a*c)\r\nprint(answer)\r\n", "if __name__ == \"__main__\":\n variables = [int(i) for i in input().split()]\n probability_smallR = variables[0] / variables[1]\n probability_zanoes = variables[2] / variables[3]\n\n result = probability_smallR / (1 - (1 - probability_smallR) * (1 - probability_zanoes))\n\n print(\"{:.12}\".format(result))\n \t \t\t\t \t\t\t\t \t\t \t\t\t \t \t", "input = input().split()\r\na, b, c, d = int(input[0]), int(input[1]), int(input[2]), int(input[3])\r\n\r\npSmallR = a/b\r\npZanoes = c/d\r\n\r\nprint(pSmallR / (1 - (1 - pSmallR) * (1 - pZanoes)))\r\n\r\n", "a, b, c, d = map(int, input().split())\r\n\r\nx = a / b\r\ny = c / d\r\nz = (1-x) * (1-y)\r\nans = 0\r\n\r\nfor i in range(10000):\r\n ans += z**i\r\n\r\nans = x * ans\r\n\r\nprint(ans)\r\n \r\n", "s=input()\r\ns=s.split()\r\na=int(s[0])\r\nb=int(s[1])\r\nc=int(s[2])\r\nd=int(s[3])\r\np1=a/b\r\np2=c/d\r\nq=(1-p1)*(1-p2)\r\nprint(p1/(1-q))", "def nod(a, b):\r\n while b != 0:\r\n a, b = b, a % b\r\n return a\r\n\r\na, b, c, d = map(int, input().split())\r\nprint( a * d / (a*d + c*b - a*c))\r\n\n# Sat Jul 24 2021 18:04:48 GMT+0300 (Москва, стандартное время)\n", "a, b, c, d = map(int, input().split())\r\np = a/b\r\nq = (1-p)*(1-c/d)\r\nprint(p/(1-q))", "a,b,c,d = [int(x) for x in input().split()]\n\np = float(a/b)\nq = float(c/d)\nx = p / (p + q - p*q)\nprint(\"%.12f\"%(x))\n\n\n\n", "a,b,c,d = map(int ,input().split())\nbuf = a*d\nans = buf/(buf+c*(b-a))\nprint(ans)", "a,b,c,d=map(int,input().split())\r\nh=(a/b)+(c/d)-((a*c)/(b*d))\r\nprint((a/b)/h)\r\n", "if __name__ == '__main__':\r\n a, b, c, d = [int(x) for x in input().split(' ')]\r\n r = a/b\r\n z = c/d\r\n k = (1 - r)*(1 - z)\r\n print(r/(1-k))", "a, b, c, d = list(map(int, input().split()))\n\nr1 = a / b\nr2 = c / d\n\nr = float((1 - r1) * (1 - r2))\nres = float(r1 / (1 - r))\n\nprint(\"{0:.12f}\".format(res))\n\n\t\t \t \t\t\t\t \t\t\t\t\t\t\t\t\t\t\t \t \t", "from sys import stdin, stdout\r\n\r\na, b, c, d = map(int, stdin.readline().split())\r\n\r\nr = (1 - a / b) * (1 - c / d)\r\n\r\nprint((a / b) * (1 / (1 - r)))\r\n", "a,b,c,d=[int(x) for x in input().split()]\r\nx=(1-a/b)*(1-c/d)\r\nans=(a/b)*(1/(1-(x)))\r\nprint(ans)\r\n", "a, b, c, d = [int(i) for i in input().split()]\n\np1 = a/b\n\np2 = c/d\n\nawns = p1 / (1 - (1-p1) * (1 - p2))\n\nprint(awns)\n \t\t\t \t \t \t\t\t \t\t\t \t\t \t \t", "def main():\n ent = input().split()\n a = int(ent[0])\n b = int(ent[1])\n c = int(ent[2])\n d = int(ent[3])\n # sum{i=0 ate inf} de x*((1-x)*(1-y))**i\n a0 = a/b\n r = (1-(a/b)) * (1-(c/d))\n res = a0/(1-r)\n print(res)\n return\n\nmain()\n\t \t \t\t \t\t \t \t \t\t \t \t\t\t\t \t", "l1 = list(map(int, input().split()))\na = l1[0]\nb = l1[1]\nc = l1[2]\nd = l1[3]\n\np = a/b\nq = (1-c/d)*(1-a/b)\n\nprob = p/(1-q)\n\nprint(prob)\n", "a,b,c,d = map(int,input().split())\nx = a*d\ny = a*d + b*c - a*c\nprint(x/y)", "def luchniki(a, b, c, d):\r\n result = (a / b) / (1 - (1 - a / b) * (1 - c / d))\r\n return '{0:.12f}'.format(result)\r\n\r\n\r\nA, B, C, D = [int(i) for i in input().split()]\r\nprint(luchniki(A, B, C, D))\r\n", "a,b,c,d=map(int,input().split())\r\nstart=(1-a/b)*(1-c/d)\r\ncurrent=start\r\nresult=start+1\r\nwhile current > 0.000001 :\r\n current=current*start\r\n result+=current\r\nprint(result*a/b)", "a , b , c , d = map(int,input().split(' '))\r\nprint((a/b)/(1 - (1 - a/b)*(1 - c/d)))", "a, b, c, d = map(int, input().split())\nprint(\"{0:.10f}\".format(a / b / (1 - ((1 - a / b) * (1 - c / d)))))\n", "import sys\r\n\r\na, b, c, d = [float(x) for x in sys.stdin.readline().strip().split(\" \")]\r\n\r\nf = (1 - (a/b)) * (1 - (c/d))\r\n\r\nans = (a/b) * (1 / (1 - f))\r\n\r\nprint(ans)", "a,b,c,d = [int(i) for i in input().split()]\r\nprint(a/b/(1-(1-a/b)*(1-c/d)))\r\n", "prob = input().split()\n\na = int(prob[0])\nb = int(prob[1])\nc = int(prob[2])\nd = int(prob[3])\n\nprob1 = a/b\nprob2 = c/d\n\nptotal = prob1/(1 - ((1-prob1)*(1-prob2)))\n\nprint(round(ptotal, 12))\n\t\t \t \t\t \t\t\t \t \t \t\t \t\t\t \t\t\t\t \t", "a, b, c, d = map(int, input().split())\r\nm = a / b\r\nn = 1 - (1 - a / b) * (1 - c / d)\r\nprint(round(m / n, 6))", "a, b, c, d = map(int, input().split())\n\nsmallR = a/b\nzanoes = c/d\n\nans = smallR/(1 - (1 - smallR)*(1 - zanoes))\n\nprint(ans)\n \t\t \t \t \t \t\t\t\t \t \t\t\t\t\t\t\t \t", "a, b, c, d = map(int, input().split())\n\ndp = [0] * int(1e5)\nsteps = [0] * (int(1e5))\n\ndp[0] = a / b\nsteps[0] = (1 - a / b) * (1 - c / d)\nfor i in range(1, int(1e5)):\n dp[i] = steps[i - 1] * (a / b)\n steps[i] = steps[i - 1] * (1 - a / b) * (1 - c / d)\n\nprint(sum(dp))\n\n# Sat Jul 30 2022 08:52:17 GMT+0000 (Coordinated Universal Time)\n", "x,y,z,w=map(int,input().split())\r\nq=1-((1-(x/y))*(1-(z/w)))\r\nprint((x/y)/q)", "def prob():\n ''' Using Geometric series sum '''\n n = input().split()\n arc = float(n[0]) / float(n[1])\n zan = float(n[2]) / float(n[3])\n\n return arc * (1/(1-((1-arc)*(1-zan))))\n\n# Running the Program\nprint(prob())\n\t\t\t\t\t\t \t \t \t \t\t\t \t \t\t", "a, b, c, d = map(int, input().split())\nresult = a/b / (1 - (1 - a/b) * (1 - c/d))\nprint(f\"{result:.7f}\")\n \t \t\t\t \t \t \t\t\t\t\t\t\t \t \t", "import math\r\nimport itertools\r\n\r\n\r\ndef solve():\r\n a, b, c, d = map(int, input().split())\r\n p = a / b\r\n q = ((1 - c / d) * (1 - a / b))\r\n print(p / (1 - q))\r\n\r\n\r\n\r\n\r\nt = 1\r\n# t = int(input())\r\nwhile t:\r\n solve()\r\n t -= 1\r\n", "def toFixed(numObj, digits=0):\r\n return f\"{numObj:.{digits}f}\"\r\n\r\na, b, c, d = map(int, input().split())\r\np = a / b\r\nq = c / d\r\nprint(toFixed (p / (p + q - p * q), 12))\r\n\n# Sat Aug 20 2022 09:10:18 GMT+0000 (Coordinated Universal Time)\n", "a, b, c, d = list(map(int, input().split()))\n\ncurr = 1\nres = 0\ntemp = (b - a) * (d - c) / (b * d)\nwhile (curr > 10e-10):\n res += curr\n curr *= temp\n\nprint(a / b * res)", "a, b, c, d = input().split()\na, b, c, d = int(a), int(b), int(c), int(d)\nr = a/b\nz = c/d\nx = r\nprint((a/b) / (1 - ((1-r) * (1 -z))))\n\t \t \t \t\t\t \t \t \t \t \t \t", "a,b,c,d = [int(i) for i in input().split()]\n\nprob1 = a/b\nprob2 = c/d\n\nprobDoisErrarem = (1-prob1)*(1-prob2)\nprob1Ganhar = prob1/(1-probDoisErrarem)\n\nprint(prob1Ganhar)\n\t\t \t \t\t\t \t \t \t \t \t\t\t\t \t\t", "a, b, c, d = map(int, input().split())\n\n# Calculate the probability\nP = (a/b) / (1 - (b-a)/b * (d-c)/d)\n\nprint(f\"{P:.12f}\")\n\t\t \t\t \t \t \t\t \t\t \t \t\t", "def main():\n\n a, b, c, d = map(float, input().split())\n\n pSmallWin = a / b\n pZanoesWin = c / d\n\n pBothLose = (1 - pSmallWin) * (1 - pZanoesWin)\n\n result = pSmallWin / (1 - pBothLose)\n print(f\"{result:.12f}\")\n\nmain()\n \t \t\t\t \t \t \t\t \t\t \t\t\t \t\t", "a, b, c, d = [int(x) for x in input().split()]\r\npA = a / b\r\npC = 1 - c / d\r\ndenominator = 1 - (1 - pA) * pC\r\nprint(pA / denominator)", "from math import factorial\r\n\r\na, b, c, d = map(int, input().split())\r\n\r\np, q, ans = 1, 1, 0\r\nfor _ in range(100000):\r\n ans += p * q * a / b\r\n p *= 1 - a / b\r\n q *= 1 - c / d\r\n\r\nprint(ans)\r\n\n# Sat Aug 20 2022 11:09:15 GMT+0000 (Coordinated Universal Time)\n", "arr = list(map(int, input().split()))\r\na=arr[0]\r\nb=arr[1]\r\nc=arr[2]\r\nd=arr[3]\r\nk=((d-c)*(a-b))/(b*d)\r\nprint(a/(b+b*k))", "from sys import stdin\n\nif __name__ == \"__main__\":\n a,b,c,d = map(int, stdin.readline().strip().split(\" \"))\n p = a/b\n q = (1-a/b) * (1-c/d)\n res = p /(1-q)\n print(res)", "a,b,c,d=list(map(int,input().split()))\r\np=a/b\r\nq=(1-(a/b))*(1-(c/d))\r\nprint(p/(1-q))", "a,b,c,d = map(int, input().split())\r\nprint('{:.15f}'.format(a/b * b*d/(b*d - (b-a)*(d-c))))", "a, b, c, d = map(int, input().split())\r\np = a / b; q = c / d;\r\nr = (1- p) * (1 - q);\r\nprint (p / (1 - r))\r\n", "a,b,c,d = map(float,input().split())\np,q = a/b,c/d\nr = 1.0\ns = 0.0\nfor i in range(500000):\n\ts += r * (1-p) * q\n\tr *= (1-p) * (1-q)\nprint( 1.0-s)\n \t\t\t\t \t \t \t\t\t\t \t \t \t", "a,b,c,d = list(map(int, input().split()))\r\nb1 = a/b\r\nq = (1-b1)*(1-(c/d))\r\nn = 10000\r\nres = b1*(q**n - 1) / (q - 1)\r\nprint(res)\r\n", "string = input()\r\ninput_list = string.split(' ')\r\n\r\na = int(input_list[0])\r\nb = int(input_list[1])\r\nc = int(input_list[2])\r\nd = int(input_list[3])\r\n\r\nsmallR_hit = a / b\r\nzanoes_hit = c / d\r\nnot_smallR_hit = 1 - smallR_hit\r\nnot_zanoes_hit = 1 - zanoes_hit\r\n\r\nprint(smallR_hit / (1 - not_smallR_hit*not_zanoes_hit))\r\n", "args = list(map(float, input().split(' ')))\r\na, b, c, d = args[0], args[1], args[2], args[3]\r\nab = a/b\r\ncd = c/d\r\nacbd = (a*c)/(b*d)\r\ntotal=0\r\nfor i in range(100000):\r\n total += ab*((1-ab-cd+acbd)**i)\r\n\r\nprint(total)\r\n", "a,b,c,d = map(int,input().split())\nsmallr_hit_prob = a/b\nzanoes_hit_prob = c/d\nprob_smallr_win = smallr_hit_prob/(1-(1-smallr_hit_prob)*(1-zanoes_hit_prob))\nprint(\"{:.12f}\".format(prob_smallr_win))\n \t \t\t \t \t\t\t\t \t \t \t \t\t", "fractions = input().split(\" \")\nsmallRWinChance = float(int(fractions[0]) / int(fractions[1]))\nsmallRLooseChance = 1.0 - smallRWinChance\nzanoesChance = float(int(fractions[2]) / int(fractions[3]))\nzanoesLooseChance = 1.0 - zanoesChance\nsmallRWinProbability = smallRWinChance*(1.0/(1.0-zanoesLooseChance*smallRLooseChance))\nprint(round(smallRWinProbability, 12))\n\t\t \t \t \t\t\t\t \t\t\t \t \t", "a, b, c, d = map(int, input().split())\r\nx = (b - a) * (d - c)\r\ny = d * b\r\nn = 10000\r\np = ((x ** n) - (y ** n)) * a\r\nq = (x * (y ** (n-1)) - (y ** n)) * b\r\nprint(p/q)\r\n", "a, b, c, d = map(int, input().split())\r\ni_win = round(a / b, 7)\r\nboth_lost = round((1 - c / d) * (1 - a / b), 7) \r\nprint(round(i_win / (1 - both_lost), 7))", "a, b, c, d=list(map(int, input().split()))\r\nb1=a/b\r\nq=((b-a)/b)*(d-c)/d\r\nans=(b1/(1-q))\r\nprint(ans)\r\n", "# https://codeforces.cc/problemset/problem/312/B\n\na, b, c, d = map(int, input().split())\nprint(a * d / (a*d + b*c - a*c))\n", "# Thank God that I'm not you.\r\nfrom itertools import permutations, combinations;\r\nimport heapq;\r\n\r\nfrom collections import Counter, deque;\r\nimport math;\r\n\r\nimport sys;\r\n\r\n\r\n\r\n\r\n\r\n\r\na, b, c, d = map(int, input().split())\r\n\r\n\r\nprobWin, probLoss = a / b, 1 - (c / d);\r\nprobLR = 1 - (a / b);\r\n\r\nprint(probWin / (1 - (probLR * probLoss)));", "\r\na, b, c, d = map(int, input().split())\r\nSmallR_hit_P = a / b\r\nZanoes_hit_p = c / d\r\n\r\nb = SmallR_hit_P\r\nq = (1 - SmallR_hit_P) * (1 - Zanoes_hit_p)\r\n\r\nans = (b / (1 - q))\r\n\r\nprint(ans)\r\n", "a=input().split(\" \")\r\np=int(a[0])\r\nq=int(a[1])\r\nr=int(a[2])\r\ns=int(a[3])\r\na=p/q\r\nb=r/s\r\na=1-a\r\nb=1-b\r\nx=a*b\r\nx=1-x\r\nx=1/x\r\na=p/q\r\nx=x*a\r\nprint(x)", "a, b, c, d = map(int, input().split())\r\np = a / b\r\ng = (a / b - 1) * (c / d - 1)\r\nprint(\"%.20f\" % (p / (1 - g)))", "a, b, c, d = [int(x) for x in input().split()]\nans = a / b\nac = step = (b-a) / b * (d-c) / d\nwhile ac > 1e-7:\n ans += a / b * ac\n ac *= step\nprint(ans)\n", "a, b, c, d = [int(x) for x in input().split()]\r\nprint((a*d)/(d*b-(d-c)*(b-a)))\r\n", "import sys\r\nimport math\r\na,b,c,d = list(map(int,sys.stdin.readline().split()))\r\nans = 1 - (1 - a/b) * (1 - c/d)\r\nans = 1 / ans\r\nans = a / b * ans\r\nprint (ans)" ]

[ "t = input()\n\nx, y, z = len(t), t.rfind('1'), t.count('1')\n\nprint(x + y - z + (2 if z > 1 else 0))\n\n\n\n\n\n# Made By Mostafa_Khaled", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nx = [48] + list(input().rstrip())\r\nans = 0\r\nwhile len(x) ^ 1 and (len(x) ^ 2 or x[1] ^ 49):\r\n ans += 1\r\n if x[-1] ^ 49:\r\n x.pop()\r\n else:\r\n i = -1\r\n while x[i] ^ 48:\r\n x[i] = 48\r\n i -= 1\r\n x[i] = 49\r\nprint(ans)", "s = input()\r\ns = s[::-1]\r\nif s.count('1')==1:\r\n print(len(s)-1)\r\n exit(0)\r\nprint(s.find('1')+(s.count('0')-s.find('1'))*2+s.count('1')+1)", "inp = input()\n\nnum = '2' + inp[::-1] + '2'\n\nif(num == '212'):\n\tprint(0)\n\texit()\n\nlast = num[0]\nconseq = 0\ncount = 0\nfor i in range(len(num)):\n\tdigit = num[i]\n\n\tif digit == last:\n\t\tconseq += 1\n\telse:\n\t\tif last == '0':\n\t\t\tcount += conseq\n\t\t\tif i == len(num)-2:\n\t\t\t\tbreak\n\t\telif last == '1':\n\t\t\tcount += conseq + 1\n\t\t\tdigit = '1'\n\n\t\t# print(conseq, last)\n\t\tlast = digit\n\t\tconseq = 1\n\nprint(count)\n\n\n# count=0\n# dec = int(inp, 2)\n# while(dec != 1):\n# \tif dec % 2 == 1:\n# \t\tdec += 1\n# \telse:\n# \t\tdec //=2\n# \tcount+=1\n# print(count)\n\t \t\t \t \t \t \t \t\t\t", "from collections import *\r\n\r\n\r\ndef add(n):\r\n for i in range(len(n) - 1, -1, -1):\r\n if n[i] == '1':\r\n n[i] = '0'\r\n else:\r\n n[i] = '1'\r\n return n\r\n n.appendleft('1')\r\n return n\r\n\r\n\r\ndef main():\r\n n, ans = deque(input()), 0\r\n\r\n while (len(n) != 1):\r\n if n[-1] == '1':\r\n n = add(n)\r\n else:\r\n n.pop()\r\n ans += 1\r\n\r\n print(ans)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "import math\r\nn = input()\r\nn = n[::-1]\r\nk = 0\r\nj = len(n)\r\nfor i in range(len(n)):\r\n if j==1:\r\n if k!=0:\r\n k+=1\r\n else:\r\n if n[i]==\"1\":\r\n if k==0:\r\n k+=1\r\n else:\r\n if k!=0:\r\n k+=1\r\n j-=1\r\nprint(k+(len(n)-1))", "s=input()\r\nn=len(s)\r\nc1=s.count('1')\r\nl1=s.rfind('1')\r\nif(c1==1):\r\n print(n-1)\r\nelse:\r\n print(n+l1-c1+2)\r\n", "x = input()\r\ncnt = 0\r\ny = x.rfind(\"1\")\r\nz = x.count(\"1\")\r\nif z > 1:\r\n\tprint (len(x)+y-z+2)\r\nelse:\r\n\tprint (len(x)+y-z)", "# 92B\r\n\r\nfrom sys import stdin\r\n\r\n__author__ = 'artyom'\r\n\r\ndigits = list(stdin.readline().strip())\r\ncount = 0\r\nfor i in range(len(digits) - 1, 0, -1):\r\n count += 1\r\n if digits[i] == '1' and digits[i - 1] != '1':\r\n digits[i - 1] = '1'\r\n count += 1\r\n if len(digits) > 1 and i == 1 and digits[i] == '1':\r\n count += 2\r\n\r\nprint(count)", "from sys import stdin,stdout\ndef solve(N):\n ops,carry = (0,int(N[-1]))\n prevcarry = -1\n i = len(N)-1\n while(i > 0):\n while(carry == 0):\n i -= 1\n ops += 1\n prevcarry = carry\n carry = int(N[i])\n while(i > 0 and int(N[i-1]) == 1):\n ops += 1\n prevcarry = carry\n i -= 1\n carry = 1\n if ((i > 0 and int(N[i-1]) == 0) or (carry&prevcarry)):\n ops += 2\n i -= 1\n prevcarry = carry\n return ops\n\nif __name__ == \"__main__\":\n N = input()\n stdout.write(str(solve(N))+\"\\n\")\n\n \t\t\t \t\t\t\t \t\t \t\t\t \t", "from sys import stdin\n\nX = stdin.readline().strip()\n\ncarry = 0\nops = 0\nfor c in X[1:][::-1]:\n c = c == \"1\"\n if carry:\n if c:\n ops += 1\n else:\n ops += 2\n else:\n if c:\n carry = 1\n ops += 2\n else:\n ops += 1\n\nx = X[0] == \"1\"\nif carry:\n if x:\n ops += 1\n else:\n pass\nelse:\n if x:\n pass\n else:\n raise ArithmeticError\n\nprint(ops)\n", "import collections as clt \r\n\r\nx=input()\r\n\r\nd=clt.deque()\r\n\r\nfor i in x:\r\n\td.append(i)\r\n\r\ncnt=0\r\n\r\nwhile len(d)!=1:\r\n\tif d[-1]=='0':\r\n\t\tcnt+=1\r\n\t\td.pop()\r\n\telse:\r\n\t\ti=len(d)-1\r\n\t\twhile i>=0 and d[i]=='1':\r\n\t\t\td[i]='0'\r\n\t\t\ti-=1\r\n\t\tif i==-1:\r\n\t\t\td.appendleft('1')\r\n\t\telse:\r\n\t\t\td[i]='1'\r\n\t\tcnt+=1\r\nif d[0]=='0':\r\n\tcnt+=1\r\n\r\nprint(cnt)\r\n\t\t\t\r\n", "s = input()\r\n\r\nactions = 0\r\nif len(s) > 1:\r\n if s.rfind('1') == 0:\r\n actions = len(s) - 1\r\n else:\r\n actions = len(s) + s[:s.rfind('1')].count('0') + 1\r\nprint(actions)", "from sys import stdin ,stdout \r\ninput=stdin.readline\r\nfrom collections import defaultdict\r\ndef print(*args, end='\\n', sep=' ') -> None:\r\n stdout.write(sep.join(map(str, args)) + end)\r\n\r\ns=input().strip() ; lenth=len(s)\r\nif s.count(\"1\")==1:\r\n print(lenth-1)\r\nelse:\r\n ans=lenth+1\r\n for i in range(lenth-1,-1,-1):\r\n if s[i]==\"1\":one=i ; break\r\n for i in range(one+1):\r\n if s[i]==\"0\":ans+=1\r\n print(ans)", "def steps_to_zero(x):\r\n n = len(x)\r\n res = 0\r\n \r\n stk = [c for c in x]\r\n \r\n while len(stk) > 0:\r\n if len(stk) == 1 and stk[0] == '1':\r\n break\r\n if stk[len(stk) - 1] == '0':\r\n while len(stk) > 0 and stk[len(stk) - 1] == '0':\r\n stk.pop()\r\n res += 1\r\n \r\n else:\r\n res += 1\r\n while len(stk) > 0 and stk[len(stk) - 1] == '1':\r\n res += 1\r\n stk.pop()\r\n \r\n if len(stk) == 0:\r\n stk.append('1')\r\n else:\r\n stk[len(stk) - 1] = '1'\r\n return res\r\n \r\n#input reading\r\n#t = int(input())\r\nt = 1\r\nfor _ in range(t):\r\n #A = list(map(int,input().split()))\r\n s = input()\r\n print(steps_to_zero(s))", "n = input()\r\nlength_num = len(n)\r\nlast_i = n.rfind('1')\r\none_count = n.count('1')\r\nif one_count == 1:\r\n print(length_num + last_i - one_count)\r\nelse:\r\n print(length_num + last_i - one_count + 2)\r\n", "x=(list(map(int,input())))[::-1]\nl=len(x)\na=x.index(1)\nn=a\nb=x[a::].count(0)\nn+=(b*2)\na=x.count(1)\nif a!=1:\n n+=(a)+1\nprint(n)", "s = str(input())\nct = 0\ncheck = 0\nfor i in range(1, len(s)) :\n\tif(s[-i] == '1') :\n\t\tif(check == 1) :\n\t\t\tct += 1\n\t\telse :\n\t\t\tct += 2\n\t\t\tcheck = 1\n\telse :\n\t\tif(check == 1) :\n\t\t\tct += 2\n\t\telse : \n\t\t\tct += 1\nif(s[0] == '1' and check == 1) :\n\tct += 1\nif(s[0] == '0' and check == 1) :\n\tct += 2\n\t#print(ct, end = \" \")\nprint(ct)\n\t\t\t\n", "n = input()\r\nzeros = len(n) - max(n[::-1].find('1'), 0) - 1\r\ncnt1 = n[:zeros+1].count('1')\r\nans = len(n) + zeros - cnt1 + 2*(cnt1 > 1)\r\nprint(ans)", "s = list(input())\ncount = 0\nwhile (not (s[0]=='1' and len(s)==1)):\n count += 1\n if s[-1] == '0':\n s.pop(-1)\n else:\n n = len(s)\n for j in range(n-1,-1,-1):\n if (s[j]!='1'):\n break\n else:\n s[j] = '0'\n if (j==0):\n s = ['1'] + s\n else:\n s[j] = '1'\n # print (s)\nprint (count)\n\n\n \n\n", "I=lambda:list(map(int,input().split()))\r\ns=input()\r\nn=len(s)\r\no=s.count('1')\r\nl=s.rfind('1')\r\nif o==1:\r\n print(n+l-o)\r\nelse:\r\n print(n+l-o+2)\r\n ", "import fileinput\n\nmid = False\ncounter = 0\nbinary_string = fileinput.input().readline().strip()\n\nfor k in range(len(binary_string)-1, -1, -1):\n\tif not mid and binary_string[k] == '0':\n\t\tcounter += 1\n\telif mid and binary_string[k] == '0':\n\t\tcounter += 2\n\telif binary_string[k] == '1' and k > 0:\n\t\tcounter += 1\n\t\tmid = True\n\telif binary_string[k] == '1' and mid:\n\t\tcounter += 2\n\nprint(counter)", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = list(input()[:-1])\r\nn = len(s)\r\n\r\nc = 0\r\nfor i in range(n-1, 1, -1):\r\n if s[i] == '0':\r\n c += 1\r\n else:\r\n if s[i-1] == '1':\r\n c += 1\r\n else:\r\n c += 2\r\n s[i-1] = '1'\r\nif n == 1:\r\n print(0)\r\nelse:\r\n if s[:2] == ['1', '1']:\r\n c += 3\r\n else:\r\n c += 1\r\n print(c)", "s = input()\r\ns = list(s)\r\ntotal = 0\r\ncache = 0\r\n\r\nwhile not (s == ['1'] and cache==0) and len(s) > 0:\r\n\r\n el = s.pop()\r\n #print(el, cache, s)\r\n if cache:\r\n if el == '0':\r\n el = '1'\r\n cache = 0\r\n else:\r\n el = '0'\r\n \r\n if el == '0':\r\n total += 1\r\n else:\r\n cache = 1\r\n total += 2\r\n\r\nprint(total)\r\n ", "a=list(map(int,input()))\r\nans=0\r\nif a.index(1)!=0 or a.count(1)>1:\r\n ans+=(a.count(1)+1)\r\na=a[::-1]\r\nans+=a[:a.index(1)].count(0)+(a[a.index(1):].count(0))*2\r\nprint(ans)\r\n", "a = input()\r\nif a == '1':\r\n print(0)\r\n exit()\r\nans = 0\r\nif a.count('1') > 1:\r\n ans = ans + a.count('1') + 1\r\na = a[::-1]\r\nans += a[:a.index('1')].count('0') + (a[a.index('1'):].count('0')) * 2\r\nprint(ans)\r\n", "s=input();Ans=0;s=s[::-1]\r\nif len(s)==1 and s[0]=='1':print(0)\r\nelif s.index('1')==len(s)-1:print(len(s)-1)\r\nelse:\r\n t=s.index('1');\r\n Ans+=(t+2)\r\n for i in range(t+1,len(s)):\r\n if s[i]=='0':Ans+=2\r\n else:Ans+=1\r\n print(Ans) \r\n", "k=0\r\na=input().replace(\"\",\" \").split()\r\nwhile len(a)!=1:\r\n if a[-1] == \"0\":\r\n a.pop(-1)\r\n k += 1\r\n else:\r\n for i in range(1,9999999999999999999999):\r\n if a[-i]==\"0\":\r\n a[-i]=\"1\"\r\n k+=1\r\n for q in range(-1,-i,-1):\r\n a[q]=\"0\"\r\n break\r\n elif i==len(a):\r\n a=[\"1\"]+(i*[\"0\"])\r\n k+=1\r\n break\r\nprint(k)", "bin = input().strip()\r\nlength = len(bin)\r\nnumOnes = bin.count('1')\r\n\r\nif numOnes == 1:\r\n\tprint(length - 1)\r\nelse:\r\n\tlast = bin.rfind('1')\r\n\tprint(last - (numOnes - 2) + length)\r\n", "x = str(input())\r\ns = list(x)\r\ns = [int(c) for c in s]\r\ncur = 0\r\nans = 0\r\n\r\nwhile len(s) > 1:\r\n if s[-1]^cur == 1:\r\n cur = 1\r\n ans += 1\r\n else:\r\n cur = (s[-1]+cur)>>1\r\n ans += 1\r\n s.pop()\r\n\r\nif cur == 1:\r\n ans += 1\r\nprint(ans)\r\n", "n=list(input()) \r\nn=n[::-1]\r\nx=n.index('1')\r\nprint(n[:x].count('0')+(n[x:].count('1')+1)*(n[x:].count('1')>1)+n[x:].count('0')*2 )", "x = input()\r\ny = x.count('1')\r\nprint(len(x) + x.rfind('1') - y + 2*(y>1))", "s=list(input())\r\nL=len(s)-1\r\nans=0\r\nwhile L>0:\r\n if s[L]=='1':\r\n ans+=1\r\n while L>=0 and s[L]=='1':\r\n L-=1\r\n ans+=1\r\n s[L]='1'\r\n else:\r\n L-=1\r\n ans+=1\r\nprint(ans)\r\n", "import sys\n\ndef solve() :\n\tbinary = input() \n\tlength, lastone, numone = len(binary), binary.rfind('1'), binary.count('1')\n\tans = length + lastone - numone \n\tans += 2 if (numone > 1) else 0\n\tprint(ans)\n\nif __name__ == \"__main__\" :\n\tsolve()\n", "#Lockout 1 Round #3\r\n#Problem C\r\nimport sys\r\ninput = lambda: sys.stdin.readline()[:-1]\r\nget_int = lambda: int(input())\r\nget_int_iter = lambda: map(int, input().split())\r\nget_int_list = lambda: list(get_int_iter())\r\nflush = lambda: sys.stdout.flush()\r\n\r\n#DEBUG\r\nDEBUG = False\r\ndef debug(*args):\r\n if DEBUG:\r\n print(*args)\r\n\r\nx = list(input())[::-1]\r\nans = 0\r\ni = 0\r\nwhile i < len(x)-1:\r\n if x[i] == '1':\r\n ans += 1\r\n j = i\r\n while j < len(x):\r\n if x[j] == '1':\r\n x[j] = '0'\r\n j += 1\r\n else:\r\n x[j] = '1'\r\n break\r\n else:\r\n ans += 1\r\n i += 1\r\nprint(ans + (x[-1] == '0'))\r\n", "a=input()[::-1].replace('',' ').split()\r\nz=len(a)-1\r\nans=0\r\ni=0\r\nwhile i<z:\r\n if a[i]=='0':\r\n while i<z and a[i]=='0':\r\n i+=1\r\n ans+=1\r\n else:\r\n ans+=1\r\n while i<z and a[i]=='1':\r\n i+=1\r\n ans+=1\r\n if i==z:\r\n ans+=1\r\n a[i]='1'\r\nprint(ans)", "import math\r\nx =(input())\r\ncount=0\r\na=0\r\nlist1 = [i for i in x]\r\nwhile(list1!=['1']):\r\n l = len(list1)\r\n \r\n if list1[-1]=='0':\r\n count+=1\r\n list1.pop(-1)\r\n a=1\r\n \r\n \r\n else:\r\n count+=1\r\n \r\n for i in range(l-1,0,-1):\r\n \r\n if i==1 and list1[i]=='1' and a!=2:\r\n \r\n list1=['1']+['0' for i in range(l)]\r\n \r\n elif list1[i]=='1':\r\n list1[i]='0'\r\n a=1\r\n elif list1[i]=='0' and a==1:\r\n list1[i]='1'\r\n a=2\r\n \r\n break\r\n \r\n \r\nprint(count)\r\n", "# 101110\r\n# 10111 --- 1\r\n# 11000 --- 2\r\n# 1100 --- 3\r\n# 110 --- 4\r\n# 11 --- 5\r\n# 100 --- 6\r\n# 10 --- 7\r\n# 1 --- 8\r\n\r\nn = input()\r\nl = [i for i in n]\r\n# if n == '1':\r\n# print(0)\r\n# exit()\r\nini = 0\r\ncnt = 0\r\nwhile l != ['1']:\r\n if ini == 0:\r\n if l[-1] == \"0\":\r\n l.pop()\r\n cnt += 1\r\n else:\r\n ini = 1\r\n cnt += 1\r\n else:\r\n if l[-1] == \"1\":\r\n l.pop()\r\n cnt += 1\r\n else:\r\n l.pop()\r\n l.append('1')\r\n ini = 0\r\n # print(l)\r\nprint(cnt+ini)\r\n", "from sys import stdin,stdout\r\ninp=lambda :(int(o) for o in stdin.readline().split())\r\nsinp=lambda:(o for o in stdin.readline().split())\r\nout=lambda: stdout.write(str(ans))\r\nn=list(stdin.readline().strip())\r\nn=n[::-1]\r\nans=0\r\nx=n.index('1')\r\nans+=n[:x].count('0')\r\nif n[x:].count('1')>1:\r\n ans+=n[x:].count('1')+1\r\nans+=n[x:].count('0')*2 \r\nout()", "num = input()\r\nx = len(num)\r\ny = num.rfind('1')\r\nz = num.count('1')\r\nprint(x+y-z+(2 if z>1 else 0))\r\n", "s=input()\r\nn=len(s)\r\ns=list(s)\r\nans=0\r\nfor i in range(n-1,0,-1):\r\n if s[i]=='0':\r\n ans+=1\r\n elif(s[i]=='2'):\r\n ans+=1\r\n s[i-1]=str(int(s[i-1])+1)\r\n elif(s[i]=='1'):\r\n ans+=2\r\n s[i-1]=str(int(s[i-1])+1)\r\nif s[0]=='2':\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 \r\n \r\n \r\n ", "x=list(map(int,input()))\r\nx=x[::-1]\r\nl=len(x)\r\n#print(l)\r\nans=0\r\ny=x.index(1)\r\nans+=(y)\r\nz=x[y::].count(0)\r\nans+=(z*2)\r\n#print(ans)\r\na=x.count(1)\r\nif a!=1:\r\n ans+=(a)+1\r\nprint(ans)", "s = input()\r\nk, c = 0, 0\r\ni = len(s)-1\r\nwhile i:\r\n if s[i]=='1':\r\n k += 2-c\r\n c = 1\r\n else:\r\n k += 1+c\r\n i-=1\r\nprint(k+c)", "import sys\r\nimport math\r\n\r\nn = sys.stdin.readline()\r\nl = len(n) - 1\r\n\r\nres = 0\r\ncarry = 0\r\nfor i in range(l - 1, 0, -1):\r\n current = n[i]\r\n if(current == '0' and carry == 0):\r\n res += 1\r\n elif(current == '1' and carry == 1):\r\n res += 1\r\n carry = 1\r\n elif(current == '1' and carry == 0):\r\n res += 1\r\n carry = 1\r\n elif(current == '0' and carry == 1):\r\n res += 2\r\n carry = 1\r\n \r\nif(carry == 1):\r\n res += 2\r\n\r\nprint(res)\r\n \r\n \r\n \r\n", "x = list(map(int, input()))\ncnt = 0\nans = 0\nflag = 0\nfor i in range(1, len(x)):\n if x[-i] == 0:\n ans += 1\n else:\n if x[-i - 1] == 1:\n if i == len(x) - 1:\n cnt += 3\n elif flag == 0:\n cnt += 1\n flag = 1\n else:\n cnt += 1\n else:\n x[-i - 1] = 1\n ans += cnt + 2\n flag = 0\n cnt = 0\n if i == len(x) - 1:\n ans += cnt\nprint(ans)\n\n", "s = input()\nsteps = 0\ni = len(s) - 1\nwhile i > 0 and s[i] == '0':\n\t\tsteps += 1\n\t\ti -= 1\n# s[i] is now 1\nprev_i = i\nwhile i > 0:\n\ti -= 1\n\twhile i >= 0 and s[i] == '1':\n\t\ti -= 1\n\t# s[i] is now 0\n\tsteps += prev_i - i + 1\n\tprev_i = i\nprint(steps)\n \t\t \t\t \t \t \t \t \t \t \t\t \t \t", "import math\r\nimport queue\r\n\r\nfrom itertools import permutations\r\n\r\ns=input()\r\nt=\"1\"+(len(s)-1)*\"0\"\r\na=0\r\nb=0\r\n\r\nfor i in range(0,len(s)):\r\n if s[i]=='0':\r\n a+=1\r\n \r\n\r\ni=len(s)-1\r\n\r\nwhile True:\r\n if s[i]=='1':\r\n break\r\n b+=1\r\n i-=1\r\n\r\nanswer=len(s)+1+a-b\r\n\r\nif s!=t:\r\n print(answer)\r\nelse:\r\n print((len(s)-1))\r\n" ]

[ "import os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\nfrom types import GeneratorType\r\nfrom collections import defaultdict\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\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n\r\nn,m,k=map(int,input().split())\r\nk=k+1\r\nb=[]\r\nfor i in range(n):\r\n s=input()\r\n c=[]\r\n for j in s:\r\n c.append(int(j))\r\n b.append(c)\r\ndp=[[[False for h in range(910)] for j in range(m+1)] for i in range(n)]\r\nfor j in range(m):\r\n dp[n-1][j][b[n-1][j]]=True\r\n\r\ni=n-1\r\nwhile(i>=1):\r\n for j in range(m):\r\n for h in range(901):\r\n if dp[i][j][h]:\r\n if j==(m-1):\r\n dp[i - 1][j - 1][h + b[i - 1][j - 1]] = True\r\n\r\n elif j==0:\r\n dp[i - 1][j + 1][h + b[i - 1][j + 1]]=True\r\n else:\r\n dp[i - 1][j + 1][h + b[i - 1][j + 1]] = True\r\n dp[i - 1][j - 1][h + b[i - 1][j - 1]] = True\r\n\r\n\r\n\r\n\r\n\r\n i+=-1\r\n\r\nposs=-1\r\ncurr=900\r\nwhile(curr>=0):\r\n if (curr)%k==0:\r\n\r\n for j in range(m):\r\n if dp[0][j][curr]:\r\n poss=j\r\n break\r\n if (poss)!=-1:\r\n break\r\n curr+=-1\r\n\r\nif poss==-1:\r\n print(-1)\r\nelse:\r\n print(curr)\r\n ans=[]\r\n i=0\r\n while(i<(n-1)):\r\n\r\n curr -= b[i][poss]\r\n if dp[i+1][poss+1][curr]:\r\n ans.append(\"L\")\r\n\r\n poss+=1\r\n else:\r\n ans.append(\"R\")\r\n\r\n poss-=1\r\n\r\n\r\n i+=1\r\n print(poss+1)\r\n ans.reverse()\r\n print(\"\".join(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", "n,m,k=map(int,input().split())\r\nMAP=[list(map(int,list(input().strip()))) for i in range(n)]\r\n\r\nDP=[[[-1]*(k+1) for i in range(m)] for j in range(n)]\r\nFROM=[[[\"L\"]*(k+1) for i in range(m)] for j in range(n)]\r\n\r\nfor i in range(m):\r\n DP[n-1][i][MAP[n-1][i]%(k+1)]=MAP[n-1][i]\r\n\r\nfor i in range(n-1,0,-1):\r\n for j in range(m):\r\n for c in range(k+1):\r\n if DP[i][j][c]==-1:\r\n continue\r\n\r\n now=DP[i][j][c]\r\n \r\n if j-1>=0:\r\n p=MAP[i-1][j-1]\r\n if now+p>DP[i-1][j-1][(now+p)%(k+1)]:\r\n DP[i-1][j-1][(now+p)%(k+1)]=now+p\r\n FROM[i-1][j-1][(now+p)%(k+1)]=\"L\"\r\n\r\n if j+1<m:\r\n p=MAP[i-1][j+1]\r\n \r\n if now+p>DP[i-1][j+1][(now+p)%(k+1)]:\r\n DP[i-1][j+1][(now+p)%(k+1)]=now+p\r\n FROM[i-1][j+1][(now+p)%(k+1)]=\"R\"\r\n\r\nANS=-1\r\nind=-1\r\n\r\nfor j in range(m):\r\n if ANS<DP[0][j][0]:\r\n ANS=DP[0][j][0]\r\n ind=j\r\n\r\nif ANS==-1:\r\n print(-1)\r\n exit()\r\nelse:\r\n print(ANS)\r\n\r\nAIND=[]\r\nxc=0\r\nfor y in range(n-1):\r\n if FROM[y][ind][xc]==\"L\":\r\n AIND.append(\"L\")\r\n xc=(xc-MAP[y][ind])%(k+1)\r\n ind+=1\r\n else:\r\n AIND.append(\"R\")\r\n xc=(xc-MAP[y][ind])%(k+1)\r\n ind-=1\r\n\r\n\r\nprint(ind+1)\r\nprint(\"\".join(AIND)[::-1])\r\n \r\n\r\n\r\n \r\n \r\n", "n, m, k = map(int, input().split())\n\nboard = [[0] * m for i in range(n)]\n\nfor i in range(n):\n\n s = input().rstrip()\n\n for j in range(m):\n\n board[i][j] = int(s[j])\n\nboard.reverse()\n\n\n\ndp = [[[-10 ** 9] * (k + 1) for i in range(m)] for j in range(n)]\n\nprev = [[[(0, 0)] * (k + 1) for i in range(m)] for j in range(n)]\n\nfor i in range(m):\n\n dp[0][i][board[0][i] % (k + 1)] = board[0][i]\n\n\n\nfor i in range(n - 1):\n\n for j in range(m):\n\n for l in range(k + 1):\n\n a, b = i + 1, j - 1\n\n c, d = i + 1, j + 1\n\n for x in ((a, b), (c, d)):\n\n x1, y1 = x[0], x[1]\n\n if 0 <= x1 < n and 0 <= y1 < m:\n\n new_val = dp[i][j][l] + board[x1][y1]\n\n if dp[x1][y1][new_val % (k + 1)] < new_val:\n\n dp[x1][y1][new_val % (k + 1)] = new_val\n\n prev[x1][y1][new_val % (k + 1)] = (i, j)\n\n\n\nans = -1\n\nend = (0, 0)\n\nfor i in range(m):\n\n if ans < dp[n - 1][i][0]:\n\n ans = dp[n - 1][i][0]\n\n end = (n - 1, i)\n\n\n\nprint(ans)\n\nif ans == -1:\n\n exit()\n\n\n\ncur = end\n\nres = []\n\nwhile cur[0] != 0:\n\n if prev[cur[0]][cur[1]][ans % (k + 1)][1] == cur[1] - 1:\n\n res.append(\"R\")\n\n else:\n\n res.append(\"L\")\n\n ans, cur = ans - board[cur[0]][cur[1]], prev[cur[0]][cur[1]][ans % (k + 1)]\n\nres.reverse()\n\n\n\nprint(cur[1] + 1)\n\nprint(\"\".join(res))\n\n\n\n# Made By Mostafa_Khaled", "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, k = map(int, input().split())\r\nk += 1\r\na = [tuple(map(int, input().rstrip())) for _ in range(n)]\r\nempty = -1\r\ndp = [[[empty] * k for _ in range(m)] for _ in range(n)]\r\nprev = [[[(-1, -1, '*')] * k for _ in range(m)] for _ in range(n)]\r\n\r\nfor i in range(m):\r\n dp[-1][i][a[-1][i] % k] = a[-1][i]\r\n\r\nfor i in range(n - 1, 0, -1):\r\n for j in range(m):\r\n for mod in range(k):\r\n if dp[i][j][mod] == empty:\r\n continue\r\n val = dp[i][j][mod]\r\n\r\n for tj in (j - 1, j + 1):\r\n if 0 <= tj < m and dp[i - 1][tj][(mod + a[i - 1][tj]) % k] < val + a[i - 1][tj]:\r\n dp[i - 1][tj][(mod + a[i - 1][tj]) % k] = val + a[i - 1][tj]\r\n prev[i - 1][tj][(mod + a[i - 1][tj]) % k] = (j, mod, 'L' if tj < j else 'R')\r\n\r\n\r\nans, p_j, p_mod, path = empty, 0, 0, ''\r\nfor j in range(m):\r\n if ans < dp[0][j][0]:\r\n ans = dp[0][j][0]\r\n p_j, p_mod, path = prev[0][j][0]\r\n\r\nif ans == empty:\r\n print('-1')\r\n exit()\r\n\r\nfor i in range(1, n - 1):\r\n path += prev[i][p_j][p_mod][2]\r\n p_j, p_mod = prev[i][p_j][p_mod][:2]\r\n\r\nprint(ans)\r\nprint(p_j + 1)\r\nprint(path[::-1])\r\n", "from sys import stdin, stdout\r\nmvalue = 1000\r\n\r\n\r\nn, m, fold = map(int, stdin.readline().split())\r\nfold += 1\r\ndp = [[[False for k in range(mvalue)] for j in range(m + 1)] for i in range(n + 1)]\r\nvalues = []\r\nfor i in range(n):\r\n values.append(list(map(int, list(stdin.readline().strip()))))\r\n\r\nfor j in range(m):\r\n dp[n - 1][j][values[n - 1][j]] = True\r\n\r\nfor i in range(n - 2, -1, -1):\r\n for j in range(m):\r\n for k in range(mvalue):\r\n dp[i][j][k] = max(dp[i][j][k], max(dp[i + 1][j + 1][k - values[i][j]], dp[i + 1][j - 1][k - values[i][j]]))\r\n\r\nans = -1\r\nx, y = 0, 0\r\nfor j in range(m):\r\n for k in range(mvalue):\r\n if dp[0][j][k] and not k % fold and k > ans:\r\n ans = k\r\n x = j\r\n\r\nsteps = []\r\nstdout.write(str(ans) + '\\n')\r\nif ans != -1:\r\n while y != n - 1:\r\n if dp[y + 1][x - 1][ans - values[y][x]]:\r\n steps.append('R')\r\n ans -= values[y][x]\r\n y += 1\r\n x -= 1\r\n else:\r\n steps.append('L')\r\n ans -= values[y][x]\r\n y += 1\r\n x += 1\r\n \r\n stdout.write(str(x + 1) + '\\n' + ''.join(steps[::-1]))" ]

[ "import sys\nimport math\nimport string\n\ndef solve(s, l, a):\n c = 0\n v = l[0]\n l.pop(0)\n rem = list(s)\n for i in rem:\n if((min(i,v), max(i,v)) not in a):\n c += 1\n l.append(i)\n s.remove(i)\n for i in l:\n c += solve(s, [i], a)\n return c\n\n\nif __name__ == \"__main__\":\n input = sys.stdin.readline\n print = sys.stdout.write\n \n n, m = map(int, input().split())\n\n arr = set()\n\n for _ in range(m):\n x, y = map(int, input().split())\n arr.add((min(x - 1, y - 1), max(x - 1, y - 1)))\n \n s = set()\n \n for i in range(n):\n s.add(i)\n\n total = []\n while(len(s) != 0):\n leaders = []\n leaders.append(next(iter(s)))\n s.remove(leaders[0])\n total.append(solve(s, leaders, arr) + 1)\n \n \n \n total = sorted(total)\n print(str(len(total)) + \"\\n\")\n for i in total:\n print(str(i) + \" \")", "import sys\r\nsys.setrecursionlimit(50000)\r\n\r\nn, m = map(int, input().split())\r\n\r\nno_conn = [{i} for i in range(n)]\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n a, b = a-1, b-1\r\n no_conn[a].add(b)\r\n no_conn[b].add(a)\r\n\r\nnodes = set(range(n))\r\nans = []\r\n \r\nwhile (nodes):\r\n\tu = next(iter(nodes))\r\n\tnodes.remove(u)\r\n\tstk = [u]\r\n\tcnt = 1\r\n\twhile (stk):\r\n\t\tv = stk.pop()\r\n\t\ts = nodes - no_conn[v]\r\n\t\tcnt += len(s)\r\n\t\tstk.extend(s)\r\n\t\tnodes &= no_conn[v]\r\n\tans.append(cnt)\r\n \r\nans.sort()\r\nprint(len(ans))\r\nprint(' '.join(map(str, ans)))", "import io,os\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\n\ndef main():\n\n\n n,m = map(int,input().split())\n blocked = set()\n neigh = [[] for _ in range(n)]\n for _ in range(m):\n u,v = map(int,input().split())\n if u > v: u,v = v,u\n blocked.add ( (u-1)*n + v-1 )\n \n\n distance = [-1]*n\n distance[0] = 0\n\n unvisited = set()\n\n for i in range(n):\n unvisited.add(i)\n\n\n ans = []\n \n \n while True:\n\n visited = set()\n target = -1\n for i in range(n):\n if i in unvisited: \n target = i\n unvisited.remove(i)\n visited.add(i)\n break\n\n if target < 0: break\n\n\n while True: \n count = 0\n for front in list(visited):\n for end in list(unvisited):\n hnum = min(front,end) * n + max(front,end)\n if hnum in blocked: continue \n unvisited.remove(end)\n visited.add(end)\n distance[end] = distance[front] + 1\n count += 1\n if count==0: break\n\n ans.append(len(visited))\n\n print(len(ans))\n ans.sort()\n print(*ans)\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\nmain()\n\n", "from collections import Counter\r\nimport os\r\nimport sys\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\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\nn,m = map(int,input().split())\r\nE = []\r\ndeg = [0]*n\r\nfor _ in range(m):\r\n u,v = map(int,input().split())\r\n \r\n u -= 1\r\n v -= 1\r\n\r\n E.append((u,v))\r\n\r\n deg[u] += 1\r\n deg[v] += 1\r\n\r\nUF = list(range(n))\r\nrk = [0]*n\r\n\r\nE = set(E)\r\ndef find(u):\r\n if UF[u] != u:\r\n UF[u] = find(UF[u])\r\n return UF[u]\r\n\r\ndef union(u,v):\r\n pu = find(u)\r\n pv = find(v)\r\n\r\n if pu == pv:\r\n return False\r\n\r\n if rk[pu] >= rk[pv]:\r\n rk[pu] += 1\r\n UF[pv] = pu\r\n else:\r\n rk[pv] += 1\r\n UF[pu] = pv\r\n\r\n return True\r\n\r\nungrouped = set(range(n))\r\n\r\nfor u in sorted(list(range(n)), key = lambda u : deg[u]):\r\n if u not in ungrouped:\r\n continue\r\n\r\n\r\n stk = [u]\r\n ungrouped.remove(u)\r\n\r\n while stk:\r\n u = stk.pop()\r\n to_remove = list()\r\n for v in ungrouped:\r\n if (u,v) in E or (v,u) in E:\r\n continue\r\n\r\n else:\r\n union(u,v)\r\n to_remove.append(v)\r\n stk.append(v)\r\n\r\n while to_remove:\r\n ungrouped.remove(to_remove.pop())\r\n\r\nctr = Counter()\r\nfor u in range(n):\r\n ctr[find(u)] += 1\r\n\r\nprint(len(ctr))\r\nprint(*sorted(ctr.values()))\r\n", "import sys\r\ninput=sys.stdin.readline\r\nn,m=map(int,input().split())#20w,20w\r\nnoedge=set()\r\nfor i in range(m):\r\n u,v=map(int,input().split())\r\n noedge.add((u,v))\r\n noedge.add((v,u))\r\nans=[]\r\nnovisit=set(range(1,n+1))\r\nfor i in range(1,n+1):\r\n if i in novisit:\r\n q=[i]\r\n count=1\r\n novisit.remove(i)\r\n while q:\r\n u=q.pop()\r\n visit=[]\r\n for v in novisit:\r\n if (u,v) in noedge:\r\n continue\r\n q.append(v)\r\n count+=1\r\n visit.append(v)\r\n for u in visit:\r\n novisit.remove(u)\r\n ans.append(count)\r\nans.sort()\r\nprint(len(ans))\r\nprint(*ans)\r\n", "N,M = map(int,input().split())\r\n\r\nnE = [{i} for i in range(N)]\r\nfor _ in range(M):\r\n u,v = map(int,input().split())\r\n u,v = u-1,v-1\r\n nE[u].add(v)\r\n nE[v].add(u)\r\n\r\nunvisited = set(range(N))\r\nres = []\r\n\r\nwhile unvisited:\r\n s = next(iter(unvisited))\r\n unvisited.discard(s)\r\n stack = [s]\r\n cnt = 1\r\n while stack:\r\n v = stack.pop()\r\n s = unvisited-nE[v]\r\n cnt += len(s)\r\n stack.extend(s)\r\n unvisited &= nE[v]\r\n\r\n res.append(cnt)\r\n\r\nres.sort()\r\nprint(len(res))\r\nprint(' '.join(map(str,res)))\r\n\r\n\r\n", "n,m=map(int,input().split())\nnon=[{i} for i in range(n)]\nfor i in range(m):\n u,v=map(int,input().split())\n u,v=u-1,v-1\n non[u].add(v)\n non[v].add(u)\nvertex=set(range(n))\nans=[]\nwhile(vertex):\n a=next(iter(vertex))\n vertex.remove(a)\n stk=[a]\n cou=1\n while(stk): #kbkjgkjbgjbg\n v=stk.pop()\n s=vertex-non[v]\n cou+=len(s)\n stk.extend(s)\n vertex&=non[v]\n ans.append(cou)\nans.sort()\nprint(len(ans))\nprint(\" \".join(map(str,ans)))\n \t \t\t\t\t \t \t\t\t \t \t\t", "from io import BytesIO, IOBase\r\nimport os\r\nfrom random import getrandbits, randrange\r\nfrom string import ascii_lowercase, ascii_uppercase\r\nimport sys\r\nfrom math import ceil, floor, sqrt, pi, factorial, gcd, log, log10, log2, inf, cos, sin\r\nfrom copy import deepcopy, copy\r\nfrom collections import Counter, deque, defaultdict\r\nfrom heapq import heapify, heappop, heappush\r\nfrom itertools import (\r\n accumulate,\r\n product,\r\n combinations,\r\n combinations_with_replacement,\r\n permutations,\r\n)\r\nfrom bisect import bisect, bisect_left, bisect_right\r\nfrom functools import lru_cache, reduce\r\nfrom decimal import Decimal, getcontext\r\nfrom typing import List, Tuple, Optional\r\n\r\n\r\ninf = float(\"inf\")\r\n\r\n\r\ndef ceil_div(a, b):\r\n return (a + b - 1) // b\r\n\r\n\r\ndef isqrt(x):\r\n return int(sqrt(x))\r\n\r\n\r\ndef int1(s):\r\n return int(s) - 1\r\n\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\n\r\n\r\ndef input():\r\n return sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n\r\nprint = lambda *args, end=\"\\n\", sep=\" \": sys.stdout.write(\r\n sep.join(map(str, args)) + end\r\n)\r\n\r\n\r\ndef yes(res):\r\n return print(\"Yes\" if res else \"No\")\r\n\r\n\r\ndef YES(res):\r\n return print(\"YES\" if res else \"NO\")\r\n\r\n\r\nclass Debug:\r\n def __init__(self, debug=False):\r\n self.debug = debug\r\n\r\n def get_ic(self):\r\n if self.debug:\r\n from icecream import ic\r\n\r\n return ic\r\n else:\r\n return lambda *args, **kwargs: ...\r\n\r\n\r\ndef pairwise(a):\r\n n = len(a)\r\n for i in range(n - 1):\r\n yield a[i], a[i + 1]\r\n\r\n\r\ndef factorial(n):\r\n return reduce(lambda x, y: x * y, range(1, n + 1))\r\n\r\n\r\nic = Debug(False).get_ic()\r\n\r\n\r\ndef first(s: set):\r\n return next(iter(s))\r\n\r\n\r\ndef solve(n, uv):\r\n g = [set() for _ in range(n)]\r\n for u, v in uv:\r\n g[u].add(v)\r\n g[v].add(u)\r\n res = []\r\n left = set(range(n))\r\n\r\n while left:\r\n q = [first(left)]\r\n left.remove(q[0])\r\n\r\n cnt = 0\r\n while q:\r\n u = q.pop()\r\n cnt += 1\r\n\r\n for v in list(left):\r\n if v not in g[u]:\r\n q.append(v)\r\n left.remove(v)\r\n res.append(cnt)\r\n print(len(res))\r\n res.sort()\r\n print(*res)\r\n\r\n\r\nn, m = map(int, input().split())\r\nuv = [list(map(int1, input().split())) for _ in range(m)]\r\nsolve(n, uv)\r\n", "from sys import stdin\r\ninput=lambda :stdin.readline()[:-1]\r\n\r\nimport bisect\r\n\r\n\r\nclass BIT_SortedSet:\r\n def __init__(self, A, compress=True, sort_flag=False):\r\n self.compress = compress\r\n self.N = len(A)\r\n self.log = 0\r\n while self.N >= 1 << (self.log + 1):\r\n self.log += 1\r\n if compress:\r\n if sort_flag:\r\n self.A = A\r\n else:\r\n self.A = sorted(A)\r\n self.index_dic = {}\r\n for i in range(len(A)):\r\n self.index_dic[self.A[i]] = i\r\n else:\r\n self.A = A\r\n self.BIT = [0] * (self.N + 5)\r\n self.size = 0\r\n self.cnt = [0] * self.N\r\n\r\n def BIT_add(self, i, x):\r\n idx = i + 1\r\n while idx < self.N + 1:\r\n self.BIT[idx] += x\r\n idx += idx & (-idx)\r\n\r\n def BIT_query(self, i):\r\n res = 0\r\n idx = i + 1\r\n while idx:\r\n res += self.BIT[idx]\r\n idx -= idx & (-idx)\r\n return res\r\n\r\n def BIT_lower_left(self, w):\r\n if w <= 0 or w > self.size:\r\n return None\r\n x = 0\r\n k = 1 << self.log\r\n while k > 0:\r\n if x + k < self.N and self.BIT[x + k] < w:\r\n w -= self.BIT[x + k]\r\n x += k\r\n k //= 2\r\n return x\r\n\r\n def __contains__(self, x):\r\n if self.compress:\r\n x = self.index_dic[x]\r\n return self.cnt[x] >= 1\r\n\r\n def __len__(self):\r\n return self.size\r\n\r\n def add(self, x):\r\n if self.compress:\r\n x = self.index_dic[x]\r\n if self.cnt[x] == 1:\r\n return False\r\n self.BIT_add(x, 1)\r\n self.size += 1\r\n self.cnt[x] += 1\r\n return True\r\n\r\n def discard(self, x):\r\n if self.compress:\r\n x = self.index_dic[x]\r\n if self.cnt[x] > 0:\r\n self.BIT_add(x, -1)\r\n self.size -= 1\r\n self.cnt[x] -= 1\r\n return True\r\n return False\r\n\r\n def find_kth_val(self, k):\r\n res = self.BIT_lower_left(k + 1)\r\n if res == None:\r\n return None\r\n if self.compress:\r\n res = self.A[res]\r\n return res\r\n\r\n def __getitem__(self, x):\r\n if x < 0:\r\n x += self.size\r\n if x < 0 or x >= self.size:\r\n raise IndexError\r\n return self.find_kth_val(x)\r\n\r\n def index_right(self, x):\r\n if self.N == 0:\r\n return 0\r\n if x < self.A[0]:\r\n return 0\r\n if self.compress:\r\n y = bisect.bisect_right(self.A, x) - 1\r\n else:\r\n y = min(x, self.N - 1)\r\n return self.BIT_query(y)\r\n\r\n def index(self, x):\r\n if self.N == 0:\r\n return 0\r\n if x <= self.A[0]:\r\n return 0\r\n if self.compress:\r\n y = bisect.bisect_right(self.A, x) - 1\r\n else:\r\n y = x\r\n if y >= self.N:\r\n y = self.N - 1\r\n elif self.A[y] == x:\r\n y -= 1\r\n return self.BIT_query(y)\r\n\r\n def gt(self, x):\r\n return self.find_kth_val(self.index_right(x))\r\n\r\n def ge(self, x):\r\n return self.find_kth_val(self.index(x))\r\n\r\n def lt(self, x):\r\n return self.find_kth_val(self.index(x) - 1)\r\n\r\n def le(self, x):\r\n return self.find_kth_val(self.index_right(x) - 1)\r\n\r\n def __str__(self):\r\n return (\r\n \"{\"\r\n + \", \".join(map(str, [self.find_kth_val(i) for i in range(self.size)]))\r\n + \"}\"\r\n )\r\n\r\nn,m=map(int,input().split())\r\nS=BIT_SortedSet(list(range(n+1)))\r\nfor i in range(n+1):\r\n S.add(i)\r\nng=[set() for i in range(n)]\r\nfor i in range(m):\r\n x,y=map(lambda x:int(x)-1,input().split())\r\n ng[x].add(y)\r\n ng[y].add(x)\r\n\r\nans=[]\r\nfor i in range(n):\r\n if i not in S:\r\n continue\r\n S.discard(i)\r\n todo=[i]\r\n cnt=0\r\n while todo:\r\n v=todo.pop()\r\n cnt+=1\r\n tmp=0\r\n while True:\r\n x=S.ge(tmp)\r\n if x==n:\r\n break\r\n if x not in ng[v]:\r\n todo.append(x)\r\n S.discard(x)\r\n tmp=x+1\r\n ans.append(cnt)\r\n\r\nprint(len(ans))\r\nprint(*sorted(ans))", "# If you win, you live. You cannot win unless you fight.\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 random import randint\r\nfrom math import gcd, floor,log2,factorial,radians,sin,cos\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\n# https://codeforces.com/blog/entry/93652\r\nn,m=rd()\r\ng=myDict(set)\r\nfor i in range(m):\r\n x,y=rd()\r\n x-=1\r\n y-=1\r\n g[x].add(y)\r\n g[y].add(x)\r\ntorem=set([i for i in range(n)])\r\ncs=0\r\nres=list()\r\nfor i in range(n):\r\n if i in torem:\r\n cs+=1\r\n ans=0\r\n torem.remove(i)\r\n q=deque([i])\r\n while q:\r\n node=q.popleft()\r\n ans+=1\r\n todel = set()\r\n for u in torem:\r\n if u not in g[node]:\r\n todel.add(u)\r\n for u in todel:\r\n\r\n torem.remove(u)\r\n q.append(u)\r\n res.append(ans)\r\nprint(cs)\r\nprint(*sorted(res))\r\n", "import io, os, sys\r\n\r\nif 'PyPy' in sys.version:\r\n input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\n def strput():\r\n return input().decode()\r\nelse:\r\n input = sys.stdin.readline\r\n def strput():\r\n return input()\r\n\r\n# code starts here\r\n\r\nclass UnionFind:\r\n size = 0\r\n par, ext = [], []\r\n \r\n def __init__(self, n):\r\n for i in range(n):\r\n self.par.append(i)\r\n self.ext.append(1)\r\n self.size = n\r\n \r\n def find(self, u):\r\n while u != self.par[u]:\r\n u = self.par[u]\r\n return u\r\n \r\n def unite(self, u, v):\r\n u, v = self.find(u), self.find(v)\r\n if u == v:\r\n return False\r\n if self.ext[u] < self.ext[v]:\r\n u, v = v, u\r\n self.ext[u] += self.ext[v]\r\n self.par[v] = u\r\n self.size -= 1\r\n return True\r\n \r\n \r\ndef main():\r\n n, m = [int(x) for x in input().split()]\r\n edge = [[] for x in range(n)]\r\n for i in range(m):\r\n u, v = [int(x) - 1 for x in input().split()]\r\n if u < v:\r\n u, v = v, u\r\n edge[u].append(v)\r\n \r\n dsu = UnionFind(n)\r\n complist = set()\r\n for u in range(n):\r\n count = dict()\r\n for v in edge[u]:\r\n root = dsu.find(v)\r\n count[root] = count.get(root, 0) + 1\r\n \r\n tojoin = []\r\n for comp in complist:\r\n root = dsu.find(comp)\r\n if count.get(root, 0) < dsu.ext[root]:\r\n tojoin.append(root)\r\n \r\n for v in tojoin:\r\n if dsu.unite(v, u):\r\n complist.remove(v)\r\n \r\n complist.add(dsu.find(u))\r\n \r\n print(len(complist))\r\n ans = [dsu.ext[x] for x in complist]\r\n ans.sort()\r\n print(*ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "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, m = map(int, input().split())\r\nG = [[] for _ in range(n + 1)]\r\nfor _ in range(m):\r\n x, y = map(int, input().split())\r\n G[x].append(y)\r\n G[y].append(x)\r\nmi = n\r\nu = -1\r\nfor i in range(1, n + 1):\r\n if mi > len(G[i]):\r\n mi, u = len(G[i]), i\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\ng = G[u]\r\nsg = set(g)\r\nfor v in range(1, n + 1):\r\n if u ^ v and not v in sg:\r\n unite(u, v)\r\nfor u in g:\r\n s0 = set(G[u])\r\n for v in range(1, n + 1):\r\n if u ^ v and not v in s0:\r\n unite(u, v)\r\nr = set([get_root(i) for i in range(1, n + 1)])\r\nk = len(r)\r\nans = [get_size(i) for i in r]\r\nans.sort()\r\nprint(k)\r\nprint(*ans)", "import sys\r\nfrom collections import defaultdict, deque, Counter\r\nfrom decimal import *\r\nfrom heapq import heapify, heappop, heappush\r\nimport math\r\nimport random\r\nimport string\r\nfrom copy import deepcopy\r\nfrom itertools import combinations, permutations, product\r\nfrom operator import mul, itemgetter\r\nfrom functools import reduce\r\nfrom bisect import bisect_left, bisect_right\r\n\r\ndef input():\r\n return sys.stdin.readline().rstrip()\r\ndef getN():\r\n return int(input())\r\ndef getNM():\r\n return map(int, input().split())\r\ndef getList():\r\n return list(map(int, input().split()))\r\ndef getListGraph():\r\n return list(map(lambda x:int(x) - 1, input().split()))\r\ndef getArray(intn):\r\n return [int(input()) for i in range(intn)]\r\n\r\nmod = 10 ** 9 + 7\r\nMOD = 998244353\r\n# sys.setrecursionlimit(10000000)\r\n# import pypyjit\r\n# pypyjit.set_param('max_unroll_recursion=-1')\r\ninf = float('inf')\r\neps = 10 ** (-12)\r\ndy = [0, 1, 0, -1]\r\ndx = [1, 0, -1, 0]\r\n\r\n#############\r\n# Main Code #\r\n#############¥\r\n\r\nN, M = getNM()\r\nE = [set() for i in range(N)]\r\nfor _ in range(M):\r\n u, v = getNM()\r\n E[u - 1].add(v - 1)\r\n E[v - 1].add(u - 1)\r\n\r\nL = [i for i in range(N)]\r\nans = []\r\nwhile L:\r\n fir = L.pop(0)\r\n q = deque([fir])\r\n g = [fir]\r\n while q:\r\n u = q.popleft()\r\n new_L = []\r\n for v in L:\r\n # グループが違う可能性がある 残す\r\n if v in E[u]:\r\n new_L.append(v)\r\n # 違う　消す（このグループ）\r\n else:\r\n q.append(v)\r\n g.append(v)\r\n L = new_L\r\n ans.append(g)\r\n\r\nprint(len(ans))\r\nprint(*sorted([len(a) for a in ans]))", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip('\\r\\n')\r\nii = lambda: int(input())\r\nmii = lambda: map(int, input().split())\r\n\r\nn, m = mii()\r\ng = [set() for _ in range(n)]\r\nfor _ in range(m):\r\n x, y = mii()\r\n x -= 1; y -= 1\r\n g[x].add(y)\r\n g[y].add(x)\r\n\r\nfrom collections import deque\r\nvis = set()\r\nnotvis = set(range(n))\r\nq = deque()\r\nans = []\r\nfor i in range(n):\r\n if i in vis:\r\n continue\r\n vis.add(i)\r\n notvis.remove(i)\r\n q.append(i)\r\n cnt = 1\r\n while q:\r\n x = q.popleft()\r\n for y in notvis:\r\n if y not in g[x]:\r\n cnt += 1\r\n vis.add(y)\r\n q.append(y)\r\n notvis -= vis\r\n ans.append(cnt)\r\n\r\nans.sort()\r\nprint(len(ans))\r\nprint(*ans)", "def Solution(G):\r\n unvisited = { i for i in range(len(G)) }\r\n sol = []\r\n while unvisited:\r\n l = len(unvisited)\r\n a = next(iter(unvisited))\r\n unvisited.discard(a)\r\n stack = [a]\r\n while stack:\r\n v = stack.pop()\r\n s = unvisited & G[v]\r\n stack.extend(unvisited - s)\r\n unvisited = s\r\n sol.append(l - len(unvisited))\r\n \r\n sol.sort()\r\n print(len(sol))\r\n print(\" \".join(map(\"{0}\".format,sol)))\r\n\r\n pass\r\ndef main():\r\n s = input().split(\" \")\r\n n = int(s[0])\r\n m = int(s[1])\r\n \r\n G=[ {i} for i in range(n) ]\r\n for _ in range(m): \r\n s =input().split(\" \")\r\n n1 = int(s[0])-1\r\n n2 = int(s[1])-1\r\n G[n2].add(n1)\r\n G[n1].add(n2)\r\n\r\n Solution(G) \r\n\r\n\r\nmain()", "import sys\r\nimport io, os\r\ninput = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\n\r\nn, m = map(int, input().split())\r\nBAN = set()\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n x, y = x-1, y-1\r\n BAN.add((x, y))\r\n BAN.add((y, x))\r\n\r\nans = []\r\nnotvisit = set(range(0, n))\r\nfor i in range(n):\r\n if i in notvisit:\r\n s = [i]\r\n cnt = 1\r\n notvisit.remove(i)\r\n while s:\r\n v = s.pop()\r\n visit = []\r\n for u in notvisit:\r\n if (v, u) in BAN:\r\n continue\r\n s.append(u)\r\n cnt += 1\r\n visit.append(u)\r\n for u in visit:\r\n notvisit.remove(u)\r\n ans.append(cnt)\r\nprint(len(ans))\r\nans.sort()\r\nprint(*ans)\r\n" ]

[ "print('04'[int(input())%4<1])", "n = int(input(\"\"))\r\n\r\nif n%4 == 0:\r\n\tprint(\"4\")\r\nelif n%4 == 1:\r\n\tprint(\"0\")\r\nelif n%4 == 2:\r\n\tprint(\"0\")\r\nelse:\r\n\tprint(\"0\")\r\n\r\n", "# Topicos Especiais em Programacao | UFRJ | 2023.1\n# Gabriele Jandres Cavalcanti | 119159948\n# Aula 1 | Problema A | Fedya and Maths\n\n\ndef calculate_mod_5(num):\n result = 4 if num % 4 == 0 else 0 # todos os numeros que forem multiplos de 4 vao deixar resto 1 quando fizermos x^n, onde x = {1, 2, 3, 4}, quando fizermos a soma deles mod 5, o resultado sera 4, todos os outros casos a soma mod 5 sera 0\n print(result)\n\n\ndef main():\n num = int(input())\n calculate_mod_5(num)\n\n\nif __name__ == '__main__':\n main()\n\n\n\t \t\t \t\t \t \t \t \t\t \t\t\t\t\t\t \t", "n = int(input())\ns1 = 1**(n%4)\ns2 = 2**(n%4)\ns3 = 3**(n%4)\ns4 = 4**(n%4)\nprint((1*s4+2**4*s3+3**4*s2+4**4*s1)%5)\n\t\t\t\t\t \t\t\t \t \t\t \t\t \t \t", "n = int(input())\n\nfn = lambda x : (1 + 2**x + 3** x + 4 ** x) % 5\n\nfn2 = lambda x: 4 if x%4 == 0 else 0\n\nprint(fn2(n))\n\n#print(result)\n\t \t\t\t \t \t \t\t\t \t \t \t", "def expression(n):\n if (n%4):\n return 0\n else:\n return 4\n\nn = int(input())\nresult = expression(n)\nprint(result)\n\t\t\t\t\t \t \t \t\t\t \t\t \t \t \t \t", "s=(input())\r\nif len(s)<3:\r\n x=1+2**int(s)+3**int(s)+4**(int(s))\r\n print(x%5)\r\nelse:\r\n s=s[-2]+s[-1]\r\n x=1+2**int(s)+3**int(s)+4**(int(s))\r\n print(x%5)\r\n", "entrada = input()\n\nmodulo = int(entrada) % 4\n\nprint(4 if modulo == 0 else 0)\n \t \t \t \t\t\t\t \t \t\t\t \t\t\t", "mod = [\r\n [],\r\n [1],\r\n [1, 2, 4, 3],\r\n [1, 3, 4, 2],\r\n [1, 4]\r\n]\r\n\r\nn = int(input())\r\ns = sum(mod[i][n % len(mod[i])] for i in range(1, 5))\r\nprint(s % 5)", "s = input()\nk = len(s)\nif k == 1:\n n = int(s[k-1])\nelse:\n n = int(s[k-2:k])\nif n % 4 == 0:\n print(4)\nelse:\n print(0)\n \t \t \t\t\t \t\t \t\t \t \t \t\t \t", "n = int(input()) % 4\r\nprint( (1 + 2**n + 3**n + 4**n)%5) ", "# LUOGU_RID: 91404320\nn = int(input())\r\nprint(sum((pow(i, n, 5) for i in range(1, 5))) % 5)\r\n", "n = int(input())\r\n\r\nlastf = 1\r\n\r\nif n % 4 == 0:\r\n lastf += 6\r\nelif n % 4 == 1:\r\n lastf += 2\r\nelif n % 4 == 2:\r\n lastf += 4\r\nelse:\r\n lastf += 8\r\n\r\nif n % 4 == 0:\r\n lastf += 1\r\nelif n % 4 == 1:\r\n lastf += 3\r\nelif n % 4 == 2:\r\n lastf += 9\r\nelse:\r\n lastf += 7\r\n\r\nif n % 2 == 0:\r\n lastf += 6\r\nelse:\r\n lastf += 4\r\n\r\nprint(lastf % 5)\r\n", "n = int(input())\r\nk = 1\r\nif n % 2 == 1:\r\n k += 4\r\nelse:\r\n k += 6\r\nif n % 4 == 1: k += 5\r\nelif n % 4 == 2: k += 13\r\nelif n % 4 == 3: k += 15\r\nelse: k += 7\r\nprint(k % 5)\r\n", "n = int(input())\na = n%4\nif a==1:\n a = 2\nelif a==2:\n a = 4\nelif a==3:\n a = 3\nelse :\n a = 1\nb = n%4\nif b==1:\n b = 3\nelif b==2:\n b = 4\nelif b==3:\n b = 2\nelse :\n b = 1\nc = n%2\nif c==1:\n c = 4\nelse :\n c = 1\nprint((1+a+b+c)%5)\n \t\t\t \t\t \t \t\t \t \t \t\t \t\t\t\t", "n = int(input())\r\nres = (pow(1,n,5)+pow(2,n,5)+pow(3,n,5)+pow(4,n,5))%5\r\nprint(res)", "n=int(input())\r\nans=0\r\nif n%4==0:\r\n ans+=4\r\nprint(ans)", "def calculateExpressionMod5(number):\n if (number % 4 == 0):\n return 4\n return 0\n\nn = int(input())\nprint(calculateExpressionMod5(n))\n\t \t \t\t\t \t\t \t\t \t \t\t \t \t\t\t", "n=input()\r\nn=n[-2::] #n = n%100 for last tw0 digits\r\nn=int(n)\r\nif n%4==0:\r\n print(4)\r\nelse:\r\n print(0)\r\n", "n=int(input())\r\nif n%4==0:\r\n print(4)\r\nelif n%4==1 or n%4==2 or n%4==3:\r\n print(0)", "def pow_h(base, degree, module):\r\n degree = bin(degree)[2:]\r\n r = 1\r\n for i in range(len(degree) - 1, -1, -1):\r\n r = (r * base ** int(degree[i])) % module\r\n base = (base ** 2) % module\r\n return r\r\nn = int(input())\r\nans = 1 + pow_h(2,n,5) + pow_h(3,n,5) + pow_h(4,n,5)\r\nprint(ans % 5)", "n = int(input().strip()[-2:])%4\r\n\r\nprint(4*(n==0))", "n = int(input())\r\na = pow(1,n,5)\r\nb = pow(2,n,5)\r\nc = pow(3,n,5)\r\nd = pow(4,n,5)\r\nprint((a + b + c + d) % 5)", "n=int(input())\r\n # blank=input()\r\n # n,k=map(int,input().split())\r\n # s=(input().strip())\r\n # s,t=input().split()\r\n # t=(input().strip())\r\n # s=list(input())\r\ntwo=[2,4,8,6];three=[3,9,7,1];four=[4,6]\r\nt = two[n%4-1] if n%4 else two[-1]\r\nth=three[n%4-1] if n%4 else three[-1]\r\nf=four[n%2-1] if n%2 else four[-1]\r\nprint((t+th+f+1)%5)\r\n", "print(4 if (int(input()) % 4 == 0) else 0)\r\n", "s = int(input())\r\nif (s % 4 == 0):\r\n print(4)\r\nelse:\r\n print(0)", "import sys\r\nimport time\r\nimport random\r\nfrom math import *\r\nfrom types import *\r\nfrom typing import *\r\nfrom functools import cmp_to_key\r\nfrom heapq import heappush, heappop\r\nfrom collections import defaultdict, deque\r\n\r\n# sys.stdin = open('f.in', 'r')\r\n# sys.stdout = open('f.out', 'w')\r\ninput = sys.stdin.readline\r\ninf, mod = 10 ** 18, 10 ** 9 + 7\r\nN, M = 3 * 10 ** 5 + 5, 1 * 10 ** 6 + 5\r\n\r\n\r\ndef solve():\r\n n = int(input())\r\n print(0 if n % 4 else 4)\r\n\r\n\r\ndef main():\r\n # sys.setrecursionlimit(int(10e8))\r\n\r\n tt = 1\r\n # tt = int(input())\r\n for _ in range(tt):\r\n solve()\r\n\r\n\r\nmain()\r\n", "c = int(input()) ;\r\nif(c % 4 == 0):\r\n\tprint(4);\r\nelse :\r\n\tprint(0);", "n = int(input())\r\n\r\nn %= 4\r\nres = 1 + 2**n + 3**n + 4**n\r\nres %= 5\r\n\r\nprint(res)\r\n", "n=int(input())\r\nif n%4==0:\r\n print(4)\r\nelif n%4==1 or n%4==2 or n%4==3:\r\n print(0)\r\n \r\n# mod 5 = 1,2,3,4\r\n# n % 4 == 0 => 4\r\n# else : => 0", "a=int(input())\r\na=a%4\r\nsum=(1**a)+(2**a)+(3**a)+(4**a)\r\nprint(sum%5)", "print(4*(int(input())%4==0))", "n=int(input())\r\nk=0\r\nif n%4==1:\r\n k+=2\r\nelif n%4==2:\r\n k+=4\r\nelif n%4==3:\r\n k+=3\r\nelse:\r\n k+=1\r\nif n%4==1:\r\n k+=3\r\nelif n%4==2:\r\n k+=4\r\nelif n%4==3:\r\n k+=2\r\nelse:\r\n k+=1\r\nif n%2==1:\r\n k+=4\r\nelif n%2==0:\r\n k+=1\r\nprint((k+1)%5)\r\n", "def solve():\n n = input()\n n = int(n[-2:])\n if n % 4 == 0:\n print(4)\n else:\n print(0)\n\n # for i in range(1, 20):\n # x = 1**i + 2**i + 3**i + 4**i\n # m = x % 5\n # print(m)\n\n\nsolve()\n", "n = int(input())\n\nn %= 4\nres = 1 + 2**n + 3**n + 4**n\nres %= 5\n\nprint(res)\n\n \t\t \t \t \t\t\t\t\t \t \t", "n = int(input())\r\ns = pow(1,n,5)+pow(2,n,5)+pow(3,n,5)+pow(4,n,5)\r\nprint(s%5)", "a=int(input())\r\na=a%4\r\n\r\nsum=1**a+2**a+3**a+4**a\r\n\r\nsum1=sum%5\r\n\r\nprint(sum1)", "n=input()\nn=\"0\"+n\nlast_two=10*(int(n[len(n)-2]))+int(n[len(n)-1])\nres=1+pow(2, last_two%4)+pow(3, last_two%4)+pow(4, last_two%4)\nprint(res%5)", "# LUOGU_RID: 91787093\nn = input()\r\nif len(n) > 2:\r\n n=n[-2:]\r\nn=int(n)&3\r\nprint(4 if n==0 else 0)\r\n", "x = int(input())\r\nif x%4 == 0 :\r\n print(4)\r\nelse:\r\n print(0)", "f=int(input()[-2:])%4\r\ntwo,three,four=[1,2,4,3],[1,3,4,2],[1,4,1,4]\r\nprint((1+two[f]+three[f]+four[f])%5)", "n = int(input())\r\none = 1\r\ntwo_d = {1:2, 2:4, 3:3, 0:1}\r\ntwo = 1 if n == 0 else two_d[n % 4]\r\nthree_d = {1:3, 2:4, 3:2, 0:1}\r\nthree = 1 if n == 0 else three_d[n % 4]\r\nfour_d = {1:4, 2:1, 3:4, 0:1}\r\nfour = 1 if n == 0 else four_d[n % 4]\r\nprint((one+two+three+four)%5)\r\n", "#@sorcerer_21\r\nfrom collections import *\r\nimport sys,math\r\ninput=lambda:sys.stdin.readline().strip()\r\nmapin=lambda:map(int,input().split())\r\nfor _ in range(1):\r\n s='0'+input()\r\n n=int(s[-2::])\r\n m2=[1,2,4,3]\r\n m3=[1,3,4,2]\r\n m4=[1,4]\r\n k=n%4;kk=n%2\r\n print((1+m2[k]+m3[k]+m4[kk])%5)", "# https://codeforces.com/contest/456/problem/B\r\n\r\n# 1^n mod 5 = 1\r\n\r\n# 2^0 mod 5 = 1\r\n# 2^1 mod 5 = 2\r\n# 2^2 mod 5 = 4\r\n# 2^3 mod 5 = 3\r\n# 2^4 mod 5 = 1\r\n# ...\r\n\r\n# 3^0 mod 5 = 1\r\n# 3^1 mod 5 = 3\r\n# 3^2 mod 5 = 4\r\n# 3^3 mod 5 = 2\r\n# 3^4 mod 5 = 1\r\n# ...\r\n\r\n# 4^0 mod 5 = 1\r\n# 4^1 mod 5 = 4\r\n# 4^2 mod 5 = 1\r\n# ...\r\n\r\nn = int(input()) % 4\r\nprint((1 + 2 ** n + 3 ** n + 4 ** n) % 5)\r\n", "n=input()\r\nif(int(n)%4==0):\r\n print(4)\r\nelse:\r\n print(0)", "n=int(input())\r\nprint(sum(pow(i,n,5) for i in range(1,5))%5)", "import sys;input=lambda:sys.stdin.readline().strip(\"\\r\\n\")\r\n\r\nn = int(input()) % 4\r\n\r\nprint((1**n + 2**n + 3**n + 4**n) % 5)\r\n\r\n\r\n\r\n", "n = int(input())\r\n\r\nres = n % 4\r\n\r\nif res == 0:\r\n print(4)\r\n \r\nelse:\r\n print(0)\r\n \t \t \t\t\t\t \t\t\t \t \t\t \t\t \t\t \t\t", "n=int(input())\r\na=0\r\nif(n%4==0 and n!=0):\r\n a=a+1+6+6+1\r\nelif(n!=0 and n%4==1):\r\n a=a+9+1\r\nelif(n!=0 and n%4==2):\r\n a=a+20\r\n \r\nelif(n!=0 and n%4==3):\r\n a=a+7+8+4+1\r\nelif(n==0):\r\n a=a+4\r\nprint(a%5)\r\n\r\n \r\n ", "s = input()\r\nk = len(s)\r\n\r\nif k <= 2:\r\n print((1+2**int(s)+3**int(s)+4**int(s))%5)\r\nelse:\r\n m =int(s[-3]+s[-2]+s[-1])\r\n\r\n print((1+2**(m%4)+3**(m%4)+4**(m%4))%5)\r\n", "n=int (input())\nif n%4==0:\n print(4)\nelse:\n print (0)\n \t\t \t \t\t \t\t\t \t\t\t", "n = int(input())\r\n\r\nif n == 0:\r\n print(4)\r\nelse:\r\n i = n%4\r\n print((1+2**i+3**i+4**i)%5)", "print('4' if int(input())%4 == 0 else '0')\r\n", "sa=int(input())\r\nif sa%4==0:\r\n print(4)\r\nelse:\r\n print(0)", "a=int(input())\r\na=a%4\r\nsum=1**a + 2**a + 3**a + 4**a\r\nprint(sum%5)", "n = int(input())\r\nans = 0\r\nvalue = 2**(64)+1\r\nn = n%(4)\r\nfor i in range(1,5):\r\n ans = ans + (i**n)%5\r\nprint(ans%5)", "n=int(input())\r\nn+=3\r\nn%=4\r\na=[0,0,0,4]\r\nprint(a[n])\r\n", "n = int(input())\r\na = n%4\r\nb = n%2\r\ns = 1\r\nif a == 2:\r\n s += 3\r\nif a == 0:\r\n s += 2\r\nif b == 0:\r\n s += 1\r\nif b == 1:\r\n s += 4\r\nprint(s%5)\r\n", "import math\n# Em vez de calcular o valor real de f(n) e obter seu valor com mod 5, \n# podemos obter facilmente o resultado apenas examinando o valor de n.\ndef nmodular(n):\n if (n%4==0):\n print(\"4\") \n else:\n print(\"0\")\nnumero = int(input())\nnmodular(numero)\n \t \t \t \t\t \t \t \t \t\t\t", "n = int(input())\r\nn %= 4\r\nprint((1 + (2**n) + (3**n) + (4**n))%5)", "def miis():\r\n return map(int, input().split())\r\n\r\nfor _ in range(1):\r\n n = int(input())\r\n if n%4:\r\n print(0)\r\n else:\r\n print(4)\r\n", "n = int(input(\"\"))\r\nans = 1\r\nif n % 4 == 0:\r\n ans += 2\r\nelif (n-1) % 4 == 0 or (n-3) % 4 == 0:\r\n ans += 5\r\nelse:\r\n ans += 8\r\n\r\nif n % 2 == 0:\r\n print((ans + 1) % 5)\r\nelse:\r\n print((ans + 4) % 5)", "print((int(input())%4<1)*4)", "n = int(input())\r\nif n % 4 == 0: print(4)\r\nelse: print(0)\r\n", "from decimal import Decimal\r\nimport math\r\n\r\nn = int(input())\r\nnum = Decimal(n)\r\n\r\nprint((1 + pow(2, n%4) + pow(3, n%4) + pow(4, n%4)) % 5)", "n=input()\nif len(n)>=3:\n sum=0\n n1=int(n[-3])*100+int(n[-2])*10+int(n[-1]) \n if n1%4==0:\n sum=6+1+1\n elif n1%4==1:\n sum=2+3+1\n elif n1%4==2:\n sum=4+9+1\n elif n1%4==3:\n sum=8+7+1\n if n1%2==0:\n sum=sum+6\n else:\n sum=sum+4\n print(sum%5)\nelse:\n n=int(n)\n if n==0:\n print(4)\n else:\n if n%4==0:\n sum=6+1+1\n elif n%4==1:\n sum=2+3+1\n elif n%4==2:\n sum=4+9+1\n elif n%4==3:\n sum=8+7+1\n if n%2==0:\n sum=sum+6\n else:\n sum=sum+4\n print(sum%5)\n\t\t \t\t \t\t\t\t\t\t\t \t \t \t\t\t", "def myPow(x, s, P):\r\n x %= P\r\n res = 1 % P\r\n now = x\r\n for i in range(len(s) - 1, -1, -1):\r\n res = (res * pow(now, int(s[i]), P)) % P\r\n now = pow(now, 10, P)\r\n return res\r\n\r\nif __name__ == \"__main__\":\r\n P = 5\r\n s = input()\r\n\r\n res = (myPow(1, s, P) + myPow(2, s, P) + myPow(3, s, P) + myPow(4, s, P)) % P\r\n\r\n print(res)\r\n", "'''\r\n AUTHOR : Vignat Tank\r\n DATE : 18-04-2023\r\n'''\r\n\r\n\r\ndef Vignat0905():\r\n n = int(input())\r\n print(0 if n % 4 else 4)\r\n\r\n\r\nt = 1\r\n# t = int(input())\r\nwhile (t):\r\n Vignat0905()\r\n t -= 1", "n = input()\n\nresult = int(n) % 4\n\nif (result == 0):\n print(4)\nelse:\n print(0)\n \t \t \t\t\t\t \t\t\t \t \t\t \t\t \t\t \t\t", "n = int(input())\r\ns1 = 1**(n%4)\r\ns2 = 2**(n%4)\r\ns3 = 3**(n%4)\r\ns4 = 4**(n%4)\r\nprint((1*s4+2**4*s3+3**4*s2+4**4*s1)%5)", "x = int(input())\n\nif(x%4 == 0):\n print(\"4\")\nelse:\n print(\"0\")\n\t \t \t \t \t \t \t\t\t\t\t \t \t\t\t \t", "n = int(input())\r\nprint(0 if n % 4 else 4)", "entrada = input()\n\nmodulo = int(entrada) % 4\n\nif (modulo == 0): print(4)\nif (modulo == 1): print(0)\nif (modulo == 2): print(0)\nif (modulo == 3): print(0)\n\n\t \t\t\t \t \t\t\t \t \t\t\t\t\t\t \t \t", "# LUOGU_RID: 91788106\na=int(input())\nif a%4==0:print(4)\nelse : print(0)", "from math import gcd , lcm , sqrt , floor , ceil\r\nMOD = int(1e9)+7\r\n\r\n# find last digit from -> (n^m)\r\ndef last_digit(n,m) -> int: # O(1)\r\n if m%4==1:\r\n return(n%10)%5\r\n elif m%4==2:\r\n return(n**2%10)%5\r\n elif m%4==3:\r\n return(n**3%10)%5\r\n else:\r\n return(n**4%10)%5\r\n\r\ndef solve():\r\n print((1+last_digit(2,n)+last_digit(3,n)+last_digit(4,n))%5)\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n solve()", "n=int(input())\r\nprint(4 if n % 4 == 0 else 0)", "\r\nfrom collections import Counter, deque\r\nfrom functools import lru_cache\r\nimport heapq\r\nimport itertools\r\nimport math\r\nimport random\r\nimport sys\r\nfrom types import GeneratorType;\r\n\r\ndef bootstrap(f, stack=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n if stack:\r\n return f(*args, **kwargs)\r\n else:\r\n to = f(*args, **kwargs)\r\n while True:\r\n if type(to) is GeneratorType:\r\n stack.append(to)\r\n to = next(to)\r\n else:\r\n stack.pop()\r\n if not stack:\r\n break\r\n to = stack[-1].send(to)\r\n return to\r\n \r\n return wrappedfunc \r\n\r\n\r\n\r\nn = int(input())\r\n\r\n\r\ndef solve(rem, num):\r\n res = []\r\n for i in range(4):\r\n res.append((num ** i) % 5);\r\n \r\n return res[rem]\r\n\r\nans = 0;\r\nrem = n % 4;\r\nfor num in [1, 2, 3, 4]:\r\n ans += solve(rem, num)\r\n ans %= 5;\r\n\r\nprint(ans)\r\n\r\n ", "# def big(a, p):\r\n# if p == 0:\r\n# return 1\r\n# return a*big(a, p-1)\r\n\r\nn = int(input())\r\n\r\nif n%4 == 0:\r\n print(4)\r\nelse:\r\n print(0)\r\n\r\n# ans = (1+big(2, n)+big(3, n)+big(4, n))%5\r\n\r\n\r\n# print(ans)\r\n", "t = int(input())\r\nif t%4==0:\r\n print(4)\r\nelse:\r\n print(0)", "n=int(input())\r\nif n%4:\r\n print(0)\r\nelse :\r\n print(4)", "n = int(input())\r\nx1 = 1\r\nx2 = 0\r\nx3 = 0\r\nx4 = 0\r\nif (n+3)%4==0:\r\n x2 = 2\r\n x3 = 3\r\nif (n+2)%4==0:\r\n x2 = 4\r\n x3 = 4 \r\nif (n+1)%4==0:\r\n x2 = 3\r\n x3 = 2\r\nif n%4==0: \r\n x2 = 1\r\n x3 = 1\r\nif n%2==0:\r\n x4 = 1 \r\nelse: \r\n x4 = 4\r\n\r\nprint((x1+x2+x3+x4)%5) ", "n = int(input())\nresultado = (pow(1, n, 5) + pow(2, n, 5) + pow(3, n, 5) + pow(4, n, 5))\nprint( resultado % 5)\n \t \t\t \t \t\t \t\t \t \t \t\t\t", "n=int(input())\nif n%4==0:\n print(4)\nelse:\n print(0)\n\t\t \t\t\t\t \t\t \t\t\t \t\t\t\t\t\t \t \t\t", "x=int(input())\r\nn=x%4\r\nprint((1+2**n+3**n+4**n)%5)" ]

[ "import sys\r\ninput = sys.stdin.readline\r\n\r\nN, M = map(int, input().split())\r\nA = list(map(int, input().split()))\r\n\r\nB = [N + 1 for _ in range(N)]\r\nidx = N + 1\r\n\r\nfor i in range(N - 1)[::-1]:\r\n if A[i] != A[i + 1]:\r\n idx = i + 1\r\n B[i] = idx\r\n\r\nres = []\r\n\r\nfor _ in range(M):\r\n l, r, x = map(int, input().split())\r\n if A[l - 1] != x:\r\n res.append(l)\r\n elif B[l - 1] <= r - 1:\r\n res.append(B[l - 1] + 1)\r\n else:\r\n res.append(-1)\r\n\r\nprint('\\n'.join(map(str, res)))", "import sys\r\nn, m = map(int, input().split())\r\na = [0] + list(map(int, input().split()))\r\nb = [n+1]*(n+1)\r\nfor i in range(n-1, 0, -1):\r\n b[i] = i+1 if a[i] != a[i+1] else b[i+1]\r\n\r\nans = [-1]*m\r\nfor i in range(m):\r\n l, r, x = map(int, sys.stdin.readline().split())\r\n if a[l] != x:\r\n ans[i] = l\r\n elif b[l] <= r:\r\n ans[i] = b[l]\r\n\r\nprint(*ans, sep='\\n')\r\n", "#!/usr/bin/env python3\n\nimport io\nimport sys\n\ndef solver(ifs):\n n, m = list(map(int, ifs.readline().split()))\n a = list(map(int, ifs.readline().split()))\n b = [0,] * len(a)\n c = [0,] * len(a)\n for i in range(1, n):\n if a[i] == a[i-1]:\n b[i] = b[i-1] + 1\n for i in range(n-2, -1, -1):\n if a[i] == a[i+1]:\n c[i] = c[i+1] + 1\n for i in range(m):\n L, R , x = list(map(int, ifs.readline().split()))\n L, R = L-1, R-1\n if a[L] != x:\n print(L + 1)\n continue\n if a[R] != x:\n print(R + 1)\n continue\n left = L + c[L] + 1\n if left <= R:\n print(left + 1)\n continue\n right = R - b[R] - 1\n if L <= right:\n print(right + 1)\n continue\n print(-1)\n\ndef main(args):\n if sys.version_info.major == 3:\n StreamIO = io.StringIO\n else:\n StreamIO = io.BytesIO\n \n with StreamIO(sys.stdin.read()) as ifs, StreamIO() as ofs:\n _stdout = sys.stdout\n sys.stdout = ofs\n solver(ifs)\n sys.stdout = _stdout\n sys.stdout.write(ofs.getvalue())\n return 0\n\nif __name__ == '__main__':\n sys.exit(main(sys.argv))\n\n \n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=[0]*n\r\nj=[]\r\nfor i in range(1,n):\r\n if a[i]!=a[i-1]:\r\n b[i]=i\r\n else:\r\n b[i]=b[i-1]\r\nfor i in range(m):\r\n c=list(map(int,input().split()))\r\n if a[c[1]-1]!=c[2]:\r\n j.append(c[1])\r\n elif b[c[1]-1]<=c[0]-1:\r\n j.append(-1)\r\n else:\r\n j.append(b[c[1]-1])\r\nfor i in j:\r\n print(i)", "import math\r\nimport sys\r\nfrom random import randint as rn\r\nimport random\r\n\r\n\r\ndef solve():\r\n n, m = map(int, sys.stdin.readline().split())\r\n a = list(map(int, sys.stdin.readline().split()))\r\n\r\n p = [-2 for i in range(n)]\r\n last = -2\r\n for i in range(n - 1):\r\n if a[i] != a[i + 1]:\r\n last = i\r\n p[i + 1] = last\r\n\r\n for _ in range(m):\r\n l, r, x = map(int, sys.stdin.readline().split())\r\n\r\n if a[r - 1] != x:\r\n sys.stdout.write(str(r) + '\\n')\r\n else:\r\n if p[r - 1] + 1 >= l:\r\n sys.stdout.write(str(p[r - 1] + 1) + '\\n')\r\n else:\r\n sys.stdout.write('-1\\n')\r\n\r\n return\r\n\r\n\r\nif __name__ == '__main__':\r\n\r\n multitest = 0\r\n\r\n if multitest:\r\n t = int(sys.stdin.readline())\r\n for _ in range(t):\r\n solve()\r\n else:\r\n solve()\r\n # gen()\r\n", "import math\r\nimport sys\r\nfrom random import randint as rn\r\nimport random\r\n\r\n\r\ndef solve():\r\n n, m = map(int, sys.stdin.readline().split())\r\n a = list(map(int, sys.stdin.readline().split()))\r\n\r\n f = {}\r\n for i in range(n):\r\n if a[i] not in f:\r\n f[a[i]] = []\r\n f[a[i]].append(i + 1)\r\n\r\n for _ in range(m):\r\n l, r, x = map(int, sys.stdin.readline().split())\r\n\r\n if x not in f:\r\n sys.stdout.write(str(l) + \"\\n\")\r\n continue\r\n\r\n left = 0\r\n right = len(f[x]) - 1\r\n\r\n while left <= right:\r\n mid = (left + right) // 2\r\n if f[x][mid] < l:\r\n left = mid + 1\r\n else:\r\n right = mid - 1\r\n\r\n if left >= len(f[x]):\r\n sys.stdout.write(str(l) + '\\n')\r\n continue\r\n\r\n if f[x][left] != l:\r\n sys.stdout.write(str(l) + '\\n')\r\n continue\r\n\r\n ind = left * 1\r\n left = 1\r\n right = r - l\r\n\r\n while left <= right:\r\n mid = (left + right) // 2\r\n\r\n if len(f[x]) <= ind + mid:\r\n right = mid - 1\r\n continue\r\n\r\n if f[x][ind + mid] != mid + l:\r\n right = mid - 1\r\n else:\r\n left = mid + 1\r\n\r\n if l + right + 1 <= r:\r\n sys.stdout.write(str(l + right + 1) + '\\n')\r\n else:\r\n sys.stdout.write('-1\\n')\r\n\r\n return\r\n\r\n\r\nif __name__ == '__main__':\r\n\r\n multitest = 0\r\n\r\n if multitest:\r\n t = int(sys.stdin.readline())\r\n for _ in range(t):\r\n solve()\r\n else:\r\n solve()\r\n # gen()\r\n", "from sys import *\r\n\r\nn, m = [int(t) for t in input().split()]\r\n\r\nvec = [0 for t in range(n)]\r\npre = [0 for t in range(n)]\r\nfor idx, val in enumerate([int(t) for t in stdin.readline().split()]):\r\n vec[idx] = val\r\n pre[idx] = -1 if idx == 0 else (idx-1 if vec[idx-1] != val else pre[idx-1])\r\n\r\nans = [0 for t in range(m)]\r\nfor q in range(m):\r\n l, r, x = [int(t) for t in stdin.readline().split()]\r\n\r\n l -= 1\r\n r -= 1\r\n\r\n if vec[l] == x and vec[r] == x:\r\n ans[q] = (-1 if pre[r] < l else pre[r]+1)\r\n else:\r\n ans[q] = (l+1 if vec[l] != x else r+1)\r\n\r\nprint(\"\\n\".join([str(t) for t in ans]))", "import collections\r\nimport math\r\n\r\nn ,m = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nans, f = [], [0] * n\r\nf[0] = -1\r\nfor i in range(1, n):\r\n if A[i] != A[i - 1]:\r\n f[i] = i - 1\r\n else:\r\n f[i] = f[i - 1]\r\nfor i in range(m):\r\n l, r, x = map(int, input().split())\r\n #q.append([l - 1, r - 1, x])\r\n #for i in range(m):\r\n if A[r - 1] != x:\r\n ans.append(r)\r\n elif f[r - 1] >= l - 1:\r\n ans.append(f[r - 1] + 1)\r\n else:\r\n ans.append(-1)\r\nprint('\\n'.join(str(x) for x in ans))", "class SegTree:\r\n def __init__(self, init_val, ide_ele, segfunc):\r\n self.n = len(init_val)\r\n self.num = 1<<(self.n-1).bit_length()\r\n self.ide_ele = ide_ele\r\n self.segfunc = segfunc\r\n self.seg = [ide_ele]*2*self.num\r\n # set_val\r\n for i in range(self.n):\r\n self.seg[i+self.num] = init_val[i]\r\n # built\r\n for i in range(self.num-1, 0, -1):\r\n self.seg[i] = self.segfunc(self.seg[2*i], self.seg[2*i+1])\r\n\r\n def update(self, k, x):\r\n k += self.num\r\n self.seg[k] = x\r\n while k:\r\n k = k >> 1\r\n self.seg[k] = self.segfunc(self.seg[2*k], self.seg[2*k+1])\r\n\r\n def query(self, l, r):\r\n if r <= l:\r\n return self.ide_ele\r\n l += self.num\r\n r += self.num\r\n lres = self.ide_ele\r\n rres = self.ide_ele\r\n while l < r:\r\n if r & 1:\r\n r -= 1\r\n rres = self.segfunc(self.seg[r], rres)\r\n if l & 1:\r\n lres = self.segfunc(lres, self.seg[l])\r\n l += 1\r\n l = l >> 1\r\n r = r >> 1\r\n res = self.segfunc(lres, rres)\r\n return res\r\n\r\n def __str__(self): # for debug\r\n arr = [self.query(i,i+1) for i in range(self.n)]\r\n return str(arr)\r\n\r\nimport sys\r\nimport io, os\r\ninput = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\n\r\nn, m = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nP = [-1]*n\r\nN = 10**6+50\r\nseg = SegTree([-1]*N, -1, max)\r\nfor i, a in enumerate(A):\r\n p = max(seg.query(0, a), seg.query(a+1, seg.n))\r\n P[i] = p\r\n seg.update(a, i)\r\n\r\nfor i in range(m):\r\n l, r, x = map(int, input().split())\r\n l, r = l-1, r-1\r\n if A[r] != x:\r\n print(r+1)\r\n else:\r\n p = P[r]\r\n if l <= p:\r\n print(p+1)\r\n else:\r\n print(-1)\r\n", "'''\r\n Auther: ghoshashis545 Ashis Ghosh\r\n College: Jalpaiguri Govt Enggineering College\r\n\r\n'''\r\nfrom os import path\r\nfrom io import BytesIO, IOBase\r\nimport sys\r\nfrom heapq import heappush,heappop\r\nfrom functools import cmp_to_key as ctk\r\nfrom collections import deque,Counter,defaultdict as dd \r\nfrom bisect import bisect,bisect_left,bisect_right,insort,insort_left,insort_right\r\nfrom itertools import permutations\r\nfrom datetime import datetime\r\nfrom math import ceil,sqrt,log,gcd\r\ndef ii():return int(input())\r\ndef si():return input().rstrip()\r\ndef mi():return map(int,input().split())\r\ndef li():return list(mi())\r\nabc='abcdefghijklmnopqrstuvwxyz'\r\nmod=1000000007\r\n#mod=998244353\r\ninf = float(\"inf\")\r\nvow=['a','e','i','o','u']\r\ndx,dy=[-1,1,0,0],[0,0,1,-1]\r\n\r\ndef bo(i):\r\n return ord(i)-ord('0')\r\n\r\nfile = 1\r\ndef ceil(a,b):\r\n return (a+b-1)//b\r\n\r\n\r\n\r\n\r\ndef solve():\r\n\r\n \r\n # for _ in range(1,ii()+1):\r\n\r\n\r\n n,q = mi()\r\n a = li()\r\n b = [0]*n\r\n b[-1] = n\r\n for i in range(n-2,-1,-1):\r\n if a[i] == a[i+1]:\r\n b[i] = b[i+1]\r\n else:\r\n b[i] = i+1\r\n \r\n # print(b)\r\n for i in range(q):\r\n l,r,x = mi()\r\n l-=1\r\n r-=1\r\n if a[l]!=x:\r\n print(l+1)\r\n elif b[l]>r:\r\n print(-1)\r\n else:\r\n print(b[l]+1)\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\nif __name__ ==\"__main__\":\r\n\r\n if(file):\r\n \r\n if path.exists('input.txt'):\r\n sys.stdin=open('input.txt', 'r')\r\n sys.stdout=open('output.txt','w')\r\n else:\r\n input=sys.stdin.readline\r\n solve()\r\n", "n,m = [int(i) for i in input().split()]\r\na = input().split()\r\nresult = []\r\nprev = [-1]*n\r\n\r\nfor i in range(1,n):\r\n if a[i] != a[i-1]:\r\n prev[i] = i-1\r\n else:\r\n prev[i] = prev[i-1]\r\n\r\nfor i in range(m):\r\n l,r,x = input().split()\r\n r = int(r)\r\n if a[r-1] != x:\r\n answer = r\r\n elif prev[r-1]<int(l)-1:\r\n answer = -1\r\n else:\r\n answer = prev[r-1]+1\r\n\r\n result.append(str(answer))\r\n\r\nprint('\\n' .join(result))", "from sys import stdin \r\n\r\nn,m=list(map(int,stdin.readline().split()))\r\na=list(map(int,stdin.readline().split()))\r\n\r\npre=[]\r\nt,index=a[0],0\r\nfor i in range(n) :\r\n index=index if a[i]==t else i\r\n t=a[i]\r\n pre.append(index)\r\n\r\nprt=[]\r\nfor i in range(m) :\r\n l,r,x=list(map(int,stdin.readline().split()))\r\n L=pre[r-1]\r\n if a[r-1]==x :\r\n sl=pre[r-1]+1\r\n if sl<=l :\r\n prt.append(str(-1))\r\n continue\r\n r=sl-1\r\n prt.append(str(r))\r\n\r\nprint(\"\\n\".join(prt))", "n,m=map(int,input().split())\r\nl=input().split()\r\nL,ans=[0 for i in range(n)],[]\r\nL[0]=-1\r\nfor i in range(1,n):\r\n if l[i]==l[i-1]:\r\n L[i]=L[i-1]\r\n else:L[i]=i\r\nfor i in range(m):\r\n s=input().split()\r\n b=int(s[1])\r\n if l[b-1]!=s[2]:\r\n ans+=[str(b)]\r\n elif L[b-1]>=int(s[0]):\r\n ans+=[str(L[b-1])]\r\n else:\r\n ans+=['-1']\r\nprint('\\n'.join(ans))\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split()) \r\na = list(map(int, input().split())) \r\n\r\ns = [-1]\r\nfor i in range(1, n):\r\n if(a[i] != a[i - 1]):\r\n s.append(i - 1) \r\n else:\r\n s.append(s[-1])\r\n\r\nfor i in range(m):\r\n l, r, x = map(int, input().split()) \r\n if(a[r - 1] != x):\r\n print(r) \r\n elif(s[r - 1] >= l - 1):\r\n print(s[r - 1] + 1)\r\n else:\r\n print(-1)", "from collections import defaultdict, deque, Counter\r\nfrom heapq import heapify, heappop, heappush\r\nimport math\r\nfrom copy import deepcopy\r\nfrom itertools import combinations, permutations, product, combinations_with_replacement\r\nfrom bisect import bisect_left, bisect_right\r\n\r\nimport sys\r\ndef input():\r\n return sys.stdin.readline().rstrip()\r\ndef getN():\r\n return int(input())\r\ndef getNM():\r\n return map(int, input().split())\r\ndef getList():\r\n return list(map(int, input().split()))\r\ndef getListGraph():\r\n return list(map(lambda x:int(x) - 1, input().split()))\r\ndef getArray(intn):\r\n return [int(input()) for i in range(intn)]\r\n\r\nmod = 10 ** 9 + 7\r\nMOD = 998244353\r\n# sys.setrecursionlimit(1000000)\r\ninf = float('inf')\r\neps = 10 ** (-10)\r\ndy = [0, 1, 0, -1]\r\ndx = [1, 0, -1, 0]\r\n\r\n#############\r\n# Main Code #\r\n#############\r\n\r\nN, M = getNM()\r\nA = getList()\r\n\r\nrec = [1] * N\r\nnow = 1\r\nfor i in range(N - 2, -1, -1):\r\n if A[i] == A[i + 1]:\r\n now += 1\r\n else:\r\n now = 1\r\n rec[i] = now\r\n\r\nfor _ in range(M):\r\n l, r, p = getNM()\r\n l -= 1\r\n r -= 1\r\n if p != A[l]:\r\n print(l + 1)\r\n else:\r\n if l + rec[l] <= r:\r\n print(l + rec[l] + 1)\r\n else:\r\n print(-1)" ]

[ "from sys import stdin\r\ninput = stdin.buffer.readline\r\n\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nminq, maxq = [], []\r\ni1, i2, l = 0, 0, 0\r\nans, sz = [], 0\r\nfor r in range(n):\r\n while i1 < len(minq) and a[r] < minq[-1][0]: minq.pop()\r\n minq.append([a[r], r])\r\n while i2 < len(maxq) and a[r] > maxq[-1][0]: maxq.pop()\r\n maxq.append([a[r], r])\r\n\r\n while maxq[i2][0] - minq[i1][0] > k:\r\n l += 1\r\n if i1 < len(minq) and minq[i1][1] < l: i1 += 1\r\n if i2 < len(maxq) and maxq[i2][1] < l: i2 += 1\r\n\r\n if r - l + 1 > sz: sz = r - l + 1; ans = [(l + 1, r + 1)]\r\n elif r - l + 1 == sz: ans.append((l + 1, r + 1))\r\n\r\nprint(sz, len(ans))\r\nfor i in ans: print(*i)", "n, k = (int(x) for x in input().split())\nh = [int(x) for x in input().split()]\n\nh1 = [None] * n\ns = []\nfor i in reversed(range(n)):\n while s and h[s[-1]] > h[i]:\n s.pop()\n h1[i] = s[-1] if s else None\n s.append(i)\n\nh2 = [None] * n\ns = []\nfor i in reversed(range(n)):\n while s and h[s[-1]] < h[i]:\n s.pop()\n h2[i] = s[-1] if s else None\n s.append(i)\n\nz = []\n\na, b = 0, 0\nmn, mx = 0, 0\n\nwhile b < n:\n if h[b] < h[mn]:\n mn = b\n if h[b] > h[mx]:\n mx = b\n \n while h[mx] - h[mn] > k:\n if a == mn:\n mn += 1\n while h1[mn] and h1[mn] <= b:\n mn = h1[mn]\n if a == mx:\n mx += 1\n while h2[mx] and h2[mx] <= b:\n mx = h2[mx]\n a += 1\n \n if not z or b - a > z[0][1] - z[0][0]:\n z = [(a, b)]\n elif b - a == z[0][1] - z[0][0]:\n z.append((a, b))\n \n b += 1\n\nprint(z[0][1] - z[0][0] + 1, len(z))\nfor x in z:\n print(x[0] + 1, x[1] + 1)\n", "n, k = map(int, input().split())\nh = list(map(int, input().split()))\nminq = []\nmaxq = []\ni1 = 0\ni2 = 0\nsize = 1\nj = 0\nans = []\nfor i in range(n):\n while i1 < len(minq) and h[i] < minq[-1][0]:\n minq.pop()\n minq.append([h[i], i])\n while i2 < len(maxq) and h[i] > maxq[-1][0]:\n maxq.pop()\n maxq.append([h[i], i])\n \n while maxq[i2][0] - minq[i1][0] > k:\n j += 1\n if i1 < len(minq) and minq[i1][1] < j:\n i1 += 1\n if i2 < len(maxq) and maxq[i2][1] < j:\n i2 += 1\n if i - j + 1 > size:\n size = i - j + 1\n ans = [(j + 1, i + 1)]\n elif i - j + 1 == size:\n ans.append((j + 1, i + 1))\n\nprint(size, len(ans))\nfor x in ans:\n print(*x)", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).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 c1 = m\r\n else:\r\n c2 = m\r\n m = min(m + 1, n)\r\n while not ok(m):\r\n m -= 1\r\n return m\r\n\r\ndef ok(m):\r\n if m > n:\r\n return False\r\n elif m <= 0:\r\n return True\r\n x, y = slide_min(n, m, h), slide_max(n, m, h)\r\n for i, j in zip(y, x):\r\n if i - j <= k:\r\n return True\r\n return False\r\n\r\ndef slide_min(n, k, a):\r\n ans, s = [], []\r\n j = 0\r\n for i in range(n):\r\n ai = a[i]\r\n while len(s) ^ j and a[s[-1]] >= ai:\r\n s.pop()\r\n s.append(i)\r\n while len(s) ^ j and s[j] + k <= i:\r\n j += 1\r\n if i + 1 >= k:\r\n ans.append(a[s[j]])\r\n return ans\r\n\r\ndef slide_max(n, k, a):\r\n ans, s = [], []\r\n j = 0\r\n for i in range(n):\r\n ai = a[i]\r\n while len(s) ^ j and a[s[-1]] <= ai:\r\n s.pop()\r\n s.append(i)\r\n while len(s) ^ j and s[j] + k <= i:\r\n j += 1\r\n if i + 1 >= k:\r\n ans.append(a[s[j]])\r\n return ans\r\n\r\nn, k = map(int, input().split())\r\nh = list(map(int, input().split()))\r\na = binary_search(0, n + 1)\r\nans = []\r\nx, y = slide_min(n, a, h), slide_max(n, a, h)\r\nfor i in range(n - a + 1):\r\n if y[i] - x[i] <= k:\r\n ans.append(\" \".join(map(str, (i + 1, i + a))))\r\nb = len(ans)\r\nprint(a, b)\r\nsys.stdout.write(\"\\n\".join(ans))", "from collections import deque\r\nn,k=input().split()\r\nn=int(n)\r\nk=int(k)\r\nbook=[int(i) for i in input().split()]\r\nstart=[]\r\nend=[]\r\nhigh=deque()\r\nlow=deque()\r\na=0\r\nb=0\r\nj=0\r\nfor i in range(n):\r\n while len(high)>0 and high[-1]<book[i]:\r\n high.pop()\r\n high.append(book[i])\r\n while len(low)>0 and low[-1]>book[i]:\r\n low.pop()\r\n low.append(book[i])\r\n while len(high)>0 and len(low)>0 and high[0]-low[0]>k:\r\n if len(start)==0 or i-j>a:\r\n start.clear()\r\n end.clear()\r\n b=1\r\n a=i-j\r\n start.append(j)\r\n end.append(i-1)\r\n elif len(start)>0 and i-j==a:\r\n b+=1\r\n start.append(j)\r\n end.append(i-1)\r\n if high[0]==book[j]:\r\n high.popleft()\r\n if low[0]==book[j]:\r\n low.popleft()\r\n j+=1\r\nif len(start)==0 or n-j>a:\r\n start.clear()\r\n end.clear()\r\n b=1\r\n a=n-j\r\n start.append(j)\r\n end.append(n-1)\r\nelif len(start)>0 and n-j==a:\r\n b+=1\r\n start.append(j)\r\n end.append(n-1)\r\nprint(\"%d %d\"%(a,b))\r\nfor i in range(len(start)):\r\n print(\"%d %d\"%(start[i]+1,end[i]+1))", "n,k=map(int,input().split());\r\na=list(map(int,input().split()));\r\n\r\nminq=[];\r\nmaxq=[];\r\nind1=0;\r\nind2=0;\r\nl=0;\r\nsize=0;\r\nans=[];\r\n\r\nfor i in range(n):\r\n while ind1<len(minq) and a[i]<minq[-1][0]:\r\n minq.pop();\r\n while ind2<len(maxq) and a[i]>maxq[-1][0]:\r\n maxq.pop();\r\n minq.append([a[i],i]);\r\n maxq.append([a[i],i]);\r\n\r\n while maxq[ind2][0]-minq[ind1][0]>k:\r\n l+=1;\r\n if ind1<len(minq) and minq[ind1][1]<l:\r\n ind1+=1;\r\n if ind2<len(maxq) and maxq[ind2][1]<l:\r\n ind2+=1;\r\n\r\n if i-l+1>size:\r\n size=i-l+1;\r\n ans=[[l+1,i+1]];\r\n elif i-l+1==size:\r\n ans.append([l+1,i+1]);\r\n\r\n\r\nprint(size,len(ans));\r\nfor lr in ans:\r\n print(*lr);\r\n \r\n\r\n\r\n", "from collections import deque\r\n\r\nn, k = map(int, input().split())\r\nBook = list(map(int, input().split()))\r\n\r\nIncrease = deque()\r\nDecrease = deque()\r\nmax_Book = 0\r\nmax_list = []\r\n\r\nleft = 0\r\nfor right in range(n):\r\n while len(Increase) != 0 and Book[Increase[-1]] > Book[right]:\r\n Increase.pop()\r\n Increase.append(right)\r\n while len(Decrease) != 0 and Book[Decrease[-1]] < Book[right]:\r\n Decrease.pop()\r\n Decrease.append(right)\r\n\r\n while len(Increase) != 0 and len(Decrease) != 0 and Book[Decrease[0]] - Book[Increase[0]] > k:\r\n if left == Increase[0]:\r\n Increase.popleft()\r\n if left == Decrease[0]:\r\n Decrease.popleft()\r\n left += 1\r\n \r\n if right - left + 1 > max_Book:\r\n max_Book = right - left + 1\r\n max_list = [[left + 1, right + 1]]\r\n elif right - left + 1 == max_Book:\r\n max_list.append([left + 1, right + 1])\r\n\r\nprint(max_Book, len(max_list))\r\nfor left, right in max_list:\r\n print(left, right)", "\"\"\"\nCodeforces\n6E - Exposition\nhttp://codeforces.com/contest/6/problem/E\n\nHéctor González Belver\n../07/2018\n\"\"\"\nimport sys\nimport collections\n\ndef main():\n n, k = map(int,sys.stdin.readline().strip().split())\n heights = list(map(int,sys.stdin.readline().strip().split()))\n\n increasing = collections.deque()\n decreasing = collections.deque()\n\n books = []\n max_books = 0\n num_books = 0\n new_group = 0\n for pos, h in enumerate(heights):\n\n while increasing and heights[increasing[-1]] >= h:\n increasing.pop() \n increasing.append(pos)\n \n while decreasing and heights[decreasing[-1]] <= h:\n decreasing.pop()\n decreasing.append(pos)\n\n while heights[decreasing[0]] - heights[increasing[0]] > k:\n if increasing[0] > decreasing[0]:\n new_group = decreasing.popleft() + 1\n else:\n new_group = increasing.popleft() + 1\n\n num_books = pos - new_group + 1\n if num_books > max_books:\n books = [new_group]\n max_books = num_books\n elif num_books == max_books:\n books.append(new_group)\n \n sys.stdout.write(str(max_books) + ' ' + str(len(books)) + '\\n')\n for b in books:\n sys.stdout.write(str(b+1) + ' ' + str(b+1 + max_books - 1) + '\\n') \n\n\nif __name__ == '__main__': \n main()", "f = lambda: map(int, input().split())\r\nn, k = f()\r\nl, h = [], list(f())\r\nu, v = [0] * n, [0] * n\r\na = b = c = d = 0\r\nq = i = 0\r\nfor j in range(n):\r\n while a <= b and h[u[b]] <= h[j]: b -= 1\r\n while c <= d and h[v[d]] >= h[j]: d -= 1\r\n b += 1\r\n d += 1\r\n u[b] = v[d] = j\r\n while h[u[a]] - h[v[c]] > k:\r\n i = min(u[a], v[c]) + 1\r\n if u[a] < v[c]: a += 1\r\n else: c += 1\r\n p = j - i\r\n if q < p: q, l = p, [i]\r\n elif q == p: l.append(i)\r\nprint(q + 1, len(l))\r\nfor i in l: print(i + 1, i + q + 1)", "n,k=map(int,input().split())\r\nl=[*map(int,input().split())]\r\nd=[]\r\nD=[]\r\nj=0;L=0;a=[]\r\nfor i in range(n):\r\n while d and l[i]<d[-1][0]:d.pop(-1)\r\n d+=[[l[i],i]]\r\n while D and l[i]>D[-1][0]:D.pop(-1)\r\n D+=[[l[i],i]]\r\n\r\n while d and (l[i]-d[0][0]>k or d[0][1]<j):j=max(j,d[0][1]+1);d.pop(0)\r\n while D and (D[0][0]-l[i]>k or D[0][1]<j):j=max(j,D[0][1]+1);D.pop(0)\r\n\r\n if i-j>L:\r\n a=[]\r\n L=i-j\r\n\r\n if i-j==L:\r\n a+=[[j+1,i+1]]\r\n\r\nprint(L+1,len(a))\r\nprint(*[f'{x[0]} {x[1]}' for x in a],sep='\\n')\r\n", "from bisect import *\r\nfrom sys import *\r\n\r\nf = lambda: map(int, stdin.readline().split())\r\nn, d = f()\r\nh = list(f())\r\ns, l = [], []\r\ni = q = 0\r\n\r\nfor j in range(n):\r\n s.insert(bisect(s, h[j]), h[j])\r\n while s[-1] - s[0] > d:\r\n s.pop(bisect(s, h[i]) - 1)\r\n i += 1\r\n p = j - i\r\n if p > q: q, l = p, [i]\r\n elif p == q: l.append(i)\r\n\r\nprint(q + 1, len(l))\r\nfor i in l: print(i + 1, i + q + 1)", "from collections import deque\n[n,k]=[int(i) for i in input().split()];\nh=[int(i) for i in input().split()];\n\nl=deque();\nmaxl=deque();\nminl=deque();\ndef getmax():\n return maxl[0][0];\ndef getmin():\n return minl[0][0];\ndef enquene(x):\n l.append(x);\n a=1;\n while((len(maxl)>0)and(maxl[-1][0]<=x)):\n a=a+maxl[-1][1];\n maxl.pop();\n maxl.append([x,a]);\n a=1;\n while((len(minl)>0)and(minl[-1][0]>=x)):\n a=a+minl[-1][1];\n minl.pop();\n minl.append([x,a]);\ndef dequene():\n l.popleft();\n maxl[0][1]=maxl[0][1]-1;\n if(maxl[0][1]==0):\n maxl.popleft();\n minl[0][1]=minl[0][1]-1;\n if(minl[0][1]==0):\n minl.popleft();\n\n\nq = [];\naa = -1\nj = 0;\n\nfor i in range(n):\n enquene(h[i]);\n while (getmax() - getmin() > k):\n dequene();\n j = j + 1;\n if i - j + 1 > aa:\n aa = i - j + 1;\n q = [(j + 1, i + 1)];\n else:\n if i - j + 1 == aa:\n q.append((j + 1, i + 1));\nprint(aa, len(q));\nfor i in q:\n print(i[0], i[1])\n\n \n", "numtrans = input()\r\nnum = numtrans.split()\r\nn = int(num[0])\r\nk = int(num[1])\r\nhtrans = input()\r\nh = htrans.split()\r\nrecord = []\r\ntime = 0\r\nfront = 0\r\nend = 0\r\nindex1 = []\r\nindex2 = []\r\nindex3 = []\r\nindex4 = []\r\nmax = []\r\nmin = []\r\nht = len(h)\r\nsize = 0\r\nrecordmax = 0\r\nmax.append(0)\r\nmin.append(1000000)\r\nfor end in range(ht):\r\n while max[-1] < int(h[end]) :\r\n max.pop()\r\n if len(max) == 0:\r\n break\r\n max.append(int(h[end]))\r\n\r\n while min[-1] > int(h[end]):\r\n min.pop()\r\n if len(min) == 0:\r\n break\r\n min.append(int(h[end]))\r\n\r\n \r\n while (max[0] - min[0]) > k:\r\n if max[0] == int(h[front]):\r\n max.pop(0)\r\n\r\n if min[0] == int(h[front]):\r\n min.pop(0)\r\n\r\n front += 1\r\n\r\n if (max[0] - min[0]) <= k:\r\n if (end - front + 1) >= size:\r\n size = end - front + 1\r\n\r\n record.append(size)\r\n index1.append(end)\r\n index2.append(front)\r\n\r\n\r\nfor j in range(len(record)):\r\n if record[j] == size:\r\n time += 1\r\n index3.append(index1[j])\r\n index4.append(index2[j])\r\n\r\nprint (size, time)\r\n\r\nlent3 = len(index3)\r\nfor zz in range(lent3):\r\n print (index4[zz] + 1, index3[zz] + 1)", "from bisect import *\r\nn,k=map(int,input().split())\r\nh=list(map(int,input().split()))\r\nl=[]\r\nq=[]\r\naa=-1\r\nj=0\r\nfor i in range(n):\r\n l.insert(bisect(l,h[i]),h[i])\r\n while l[-1]-l[0]>k:\r\n l.pop(bisect(l,h[j])-1)\r\n j+=1\r\n if i-j+1>aa:\r\n aa=i-j+1\r\n q=[]\r\n if i-j+1==aa:\r\n q.append([j+1,i+1])\r\nprint(aa,len(q))\r\nfor i in q:\r\n print(i[0],i[1])\r\n ", "from collections import deque\r\n\r\nn, k = map(int, input().split())\r\ns = list(map(int, input().split()))\r\nbooks = []\r\nfor i in range(n):\r\n books.append([s[i], i])\r\nmaxd = deque([books[0]])\r\nlmax = 1\r\nma = 0\r\nmind = deque([books[0]])\r\nlmin = 1\r\nmi = 0\r\ni = 0\r\nj = 0\r\nd = 1\r\nt = 0\r\nQ = []\r\nwhile j < n:\r\n while books[j][0] >= maxd[-1][0]:\r\n maxd.pop()\r\n lmax -= 1\r\n if lmax == 0:\r\n break\r\n maxd.append(books[j])\r\n lmax += 1\r\n ma = maxd[0][0]\r\n while books[j][0] <= mind[-1][0]:\r\n mind.pop()\r\n lmin -= 1\r\n if lmin == 0:\r\n break\r\n mind.append(books[j])\r\n lmin += 1\r\n mi = mind[0][0]\r\n\r\n while ma - mi > k:\r\n if maxd[0][1] <= i:\r\n maxd.popleft()\r\n lmax -= 1\r\n ma = maxd[0][0]\r\n if mind[0][1] <= i:\r\n mind.popleft()\r\n lmin -= 1\r\n mi = mind[0][0]\r\n i += 1\r\n if j - i + 1 > d:\r\n d = j - i + 1\r\n t = 1\r\n Q = [[i + 1, j + 1]]\r\n elif j - i + 1 == d:\r\n t += 1\r\n Q.append([i + 1, j + 1])\r\n j += 1\r\n\r\nprint(d, t)\r\nfor l in range(t):\r\n print(*map(str, Q[l]))\r\n", "n,k = map(int,input().split())\r\nt1 = [0]*n+[*map(int,input().split())]\r\nt2 = t1.copy()\r\nfor i in range(n-1,0,-1):\r\n t1[i] = min(t1[2*i],t1[2*i+1])\r\n t2[i] = max(t2[2*i],t2[2*i+1])\r\n \r\nres,vol,a,temp = [[1,1]],1,n,[t1[n],t2[n]]\r\nfor b in range(n+1,2*n):\r\n temp[0] = min(temp[0],t1[b])\r\n temp[1] = max(temp[1],t2[b])\r\n if temp[1]-temp[0]<=k:\r\n if vol<b-a+1:\r\n vol = b-a+1\r\n res = [[a-n+1,b-n+1]]\r\n elif vol==b-a+1:\r\n res += [a-n+1,b-n+1],\r\n else:\r\n while temp[1]-temp[0]>k:\r\n a += 1; c,d = a,b\r\n temp = [t1[a],t2[a]]\r\n while d-c>1:\r\n if c&1: temp = [min(temp[0],t1[c]),max(temp[1],t2[c])]; c += 1\r\n if not d&1: temp = [min(temp[0],t1[d]),max(temp[1],t2[d])]; d -= 1\r\n c //= 2; d //= 2\r\n if c==d: temp = [min(temp[0],t1[c]),max(temp[1],t2[c])]\r\n else: temp = [min(temp[0],t1[c],t1[d]),max(temp[1],t2[c],t2[d])]\r\n if vol==b-a+1:\r\n res += [a-n+1,b-n+1],\r\n\r\nprint(vol,len(res))\r\nfor e in res: print(*e)", "import bisect\r\nn, k = map(int, input().split())\r\nm = list(map(int, input().split()))\r\nres = []\r\ncnt = [1, 0]\r\nleft = right = 0\r\nheap = []\r\nwhile right < n:\r\n heap.insert(bisect.bisect(heap, m[right]), m[right])\r\n while heap[0] + k < heap[-1]:\r\n heap.pop(bisect.bisect_left(heap, m[left]))\r\n left += 1\r\n res.append(left)\r\n if right - res[right] + 1 > cnt[0]:\r\n cnt = [right - res[right] + 1, 1]\r\n elif right - res[right] + 1 == cnt[0]:\r\n cnt[1] += 1\r\n right += 1\r\nprint(\"%d %d\" %(cnt[0], cnt[1]))\r\nfor i in range(n):\r\n if i - res[i] + 1 == cnt[0]:\r\n print(\"%d %d\" %(res[i] + 1, i + 1))", "from collections import deque\r\ndef mini_in_window(A, n, k):\r\n d = deque()\r\n res = []\r\n for i in range(n):\r\n if i >= k and d[0] == i - k:\r\n d.popleft()\r\n while len(d) and A[d[-1]] >= A[i]:\r\n d.pop()\r\n d.append(i)\r\n if i >= k - 1:\r\n res.append(d[0])\r\n return res\r\n\r\n\r\ndef maxi_in_window(A, n, k):\r\n d = deque()\r\n res = []\r\n for i in range(n):\r\n if i >= k and d[0] == i - k:\r\n d.popleft()\r\n while len(d) and A[d[-1]] <= A[i]:\r\n d.pop()\r\n d.append(i)\r\n if i >= k - 1:\r\n res.append(d[0])\r\n return res\r\n\r\n\r\nn, k = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nl = 0\r\nr = n + 1\r\nmaxans = 0\r\ncntmax = []\r\nwhile l + 1 < r:\r\n mid = (l + r) // 2\r\n if mid > maxans:\r\n cntnow = []\r\n mins = mini_in_window(A, n, mid)\r\n maxes = maxi_in_window(A, n, mid)\r\n for i in range(len(mins)):\r\n if A[maxes[i]] - A[mins[i]] <= k:\r\n cntnow.append((i + 1, mid + i))\r\n if cntnow:\r\n l = mid\r\n cntmax = cntnow[:]\r\n else:\r\n r = mid\r\nprint(l, len(cntmax))\r\nfor line in cntmax:\r\n print(' '.join(map(str, line)))" ]

[ "# import sys\r\n# sys.stdout=open('C:\\Program Files (x86)\\Sublime Text 3\\cp_setup\\output.txt','w')\r\n# sys.stdin=open('C:\\Program Files (x86)\\Sublime Text 3\\cp_setup\\input.txt','r')\r\n\r\n\r\nimport heapq\r\nimport math\r\nimport collections\r\nimport bisect\r\nmod=10**9+7\r\nmaxi=5*10**6\r\nppow=[0]*maxi\r\np=31\r\nppow[0]=1\r\nfor i in range(1,maxi):\r\n ppow[i]=(ppow[i-1]*p)%mod\r\n\r\ndef solve(s):\r\n n=len(s)+1\r\n prefix=[0]*n\r\n suffix=[0]*n\r\n for i in range(1,n): \r\n prefix[i]=(prefix[i-1]*p+ord(s[i-1])-96)%mod\r\n suffix[i]=(suffix[i-1]+(ord(s[i-1])-96)*ppow[i-1])%mod\r\n dp=[0]*n\r\n res=0\r\n for i in range(1,n):\r\n if prefix[i]==suffix[i]:\r\n dp[i]=dp[i//2]+1\r\n res+=dp[i]\r\n return res \r\n\r\n# t=int(input())\r\n# for _ in range(t):\r\n\r\ns=input()\r\nprint(solve(s))", "# Eric\n# Tarea 5 Ejercicio 2\n# B - Pasión por los Palíndromos\n\nimport sys\n\n# Input\ns = sys.stdin.readline().rstrip()\nls = len(s)\n\n# Variables\npower = 131\npower_backwards = 1\nmod = 1000000007\nhash_forwards = 0\nhash_backwards = 0\ndegrees = [0]*ls\ncount = 0\n\n# Processing\nfor i in range(ls): #5*10^6\n hash_forwards = (ord(s[i]) + hash_forwards * power) % mod\n hash_backwards = (ord(s[i]) * power_backwards + hash_backwards) % mod\n power_backwards = (power_backwards*power) % mod\n\n if hash_backwards == hash_forwards:\n degrees[i] = degrees[(i-1)//2] + 1\n count += degrees[i]\n\n# Output\nsys.stdout.write(str(count) + \"\\n\")\n\t \t\t\t \t\t\t \t \t\t\t\t\t \t \t \t \t \t" ]

[ "n,c=map(int,input().split())\r\nx=list(map(int,input().split()))\r\ne=0\r\n\r\nfor i in range(n-1):\r\n e=max(e,x[i]-x[i+1]-c)\r\n \r\nprint(e)", "\r\ns = input().rstrip().split(' ')\r\nn, c = int (s[0]), int(s[1])\r\n\r\nx = input().rstrip().split(' ')\r\n\r\nmax = int (x[0]) - int (x[1]) - c\r\nfor i in range (1, n - 1):\r\n if int (x[i]) - int (x[i + 1]) - c > max:\r\n max = int (x[i]) - int (x[i+1]) - c\r\n\r\nif max < 0:\r\n max = 0\r\n\r\nprint (max)\r\n", "n,c=list(map(int,input().split()))\r\np=list(map(int,input().split()))\r\nm=0\r\nfor i in range(n-1):\r\n if p[i]>p[i+1]:\r\n m=max(m,p[i]-p[i+1]-c)\r\nprint(m)", "n,k =map(int,input().split())\r\na = list(map(int,input().split()))\r\nt=0\r\nfor i in range(n-1):\r\n t = max(t,a[i]-a[i+1]-k)\r\nprint(t) ", "n,c=map(int, input().split())\r\nx=list(map(int, input().split()))\r\nans=0\r\nfor i in range(n-1):\r\n if x[i]-x[i+1]>ans:\r\n ans = x[i]-x[i+1]\r\nans-=c\r\nif ans<=0:\r\n print(0)\r\nelse:\r\n print(ans)", "n, c = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nmx = 0\r\nfor i in range(n - 1):\r\n mx = max(mx, arr[i] - arr[i + 1] - c)\r\nprint(mx)", "n,c=map(int,input().strip().split(' '))\narr=list(map(int,input().strip().split(' ')))\nlist1=[]\nfor i in range(n-1):\n a=arr[i]-arr[i+1]-c\n list1.append(a)\nif max(list1)>0:\n print(max(list1))\nelse:\n print(\"0\")", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ndif=[]\r\nfor i in range(len(l)-1):\r\n dif.append(l[i]-l[i+1])\r\nif max(dif)-m<0:\r\n print(0)\r\nelse:\r\n print(max(dif)-m)\r\n", "n, c = map(int,input().split(' '))\r\nx = list(map(int,input().split(' ')))\r\nans = 0\r\nfor i in range(len(x)-1):\r\n ans = max(ans, x[i] - x[i+1] - c)\r\nprint(ans)", "[n, c] = list(map(int, input().split(\" \")))\na = list(map(int, input().split(\" \")))\nr = 0\nfor i in range(n-1):\n r = max(a[i]-(a[i+1] + c), r)\nprint(r)\n", "n, c = map(int, input().split())\nx = list(map(int, input().split()))\nans = 0\nfor i in range(n - 1):\n ans = max(x[i] - x[i + 1] - c, ans)\nprint(ans)\n", "n,c=map(int,input().split())\r\na=list(map(int,input().split()))\r\nans=0\r\nfor i in range(n-1):\r\n\tans=max(ans,a[i]-a[i+1])\r\nif ans-c>=0:\r\n\tprint(ans-c)\r\nelse:\r\n\tprint(0)", "n,t=[int(x) for x in input().split()]\r\na=[int(x) for x in input().split()]\r\ndiff=-1 \r\nfor i in range(n-1):\r\n if a[i]-a[i+1]>diff:\r\n diff=a[i]-a[i+1]\r\nif diff>0 and diff>t:\r\n print(diff-t)\r\nelse:print(0) ", "n,c=map(int,input().split())\r\na=list(map(int,input().split()))\r\nmaxi=0\r\nfor i in range(n-1):\r\n if a[i]-a[i+1]-c>maxi:\r\n maxi=a[i]-a[i+1]-c\r\nelse:\r\n print(maxi)", "\"\"\"http://codeforces.com/problemset/problem/385/A\"\"\"\n\ndef solve(c, l):\n res = 0\n l = list(l)\n for i in range(len(l) -1):\n res = max(res, l[i] - l[i+1] - c)\n return res\n\nif __name__ == '__main__':\n n, c = map(int, input().split())\n l = map(int, input().split())\n print(solve(c, l))\n", "def raspberry_profit():\r\n\tdays, borrow_cost = map(int, input().split())\r\n\thoney_prices = [int(price) for price in input().split()]\r\n\r\n\tmax_profit = 0\r\n\r\n\tfor index in range(days-1):\r\n\t\tpossible_profit = honey_prices[index] - honey_prices[index+1] - borrow_cost\r\n\t\tif possible_profit > max_profit:\r\n\t\t\tmax_profit = possible_profit\r\n\r\n\tprint(max_profit)\r\n\r\nraspberry_profit()\r\n", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\na=[]\r\nfor i in range(0,n-1):\r\n if l[i]>l[i+1]:\r\n a.append(l[i]-l[i+1])\r\na.sort()\r\nif a==[]:\r\n print(0)\r\nelif a[-1]<=k:\r\n print(0)\r\nelse:\r\n print(a[-1]-k)", "n,c=map(int,input().split(' '))\r\nl=list(map(int,input().split(' ')))\r\nm=0\r\nfor i in range(n-1):\r\n m=max(m, l[i]-l[i+1])\r\nprint(max(0,m-c))", "# Description of the problem can be found at http://codeforces.com/problemset/problem/385/A\r\n\r\nn, c = map(int, input().split())\r\nl_p = list(map(int, input().split()))\r\n\r\nm = 0\r\n\r\nfor i in range(n - 1):\r\n m = max(l_p[i] - l_p[i + 1] - c, m)\r\n\r\nprint(m)", "n, c = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nprint(max(0, max(map(lambda x:x[0] - x[1], zip([0] + arr[:-1], arr))) - c))", "n,c = map(int, input().split())\nL = list(map(int, input().split()))\nr = 0\nfor i in range(n-1):\n if L[i]-L[i+1]-c > r:\n r = L[i]-L[i+1]-c\nprint(r)\n \n", "n, c = [int(i) for i in input().split()]\r\narr = [int(i) for i in input().split()]\r\nans = -1e10\r\n\r\nfor i in range(len(arr)-1):\r\n ans = max(ans, arr[i]-arr[i+1]-c)\r\n\r\nif (ans < 0):\r\n print(0)\r\nelse:\r\n print(ans)\r\n", "# 385A\nimport sys\ninput = sys.stdin.readline\n\nn, c = map(int,input().split())\nprices = list(map(int,input().split()))\n\nprint(max(max([prices[i] - prices[i+1] - c for i in range(n-1)]), 0))\n", "x, y = list(map(int, input().split()))\r\nl=list(map(int, input().split()))\r\n\r\npo1 = 0\r\npo2 = 1\r\nsu = 0\r\n\r\nwhile po2 < x:\r\n z = l[po1] -l[po2]\r\n if z> su:\r\n su = z\r\n po1 +=1\r\n po2 +=1\r\n\r\nsu = su -y\r\nif su< 0 :\r\n print(0)\r\n exit()\r\n\r\nprint(su)", "\r\nn, c = map(int, input().split())\r\nx = list(map(int, input().split()))\r\ncounter = 0\r\nfor i in range(n - 1):\r\n if (x[i] - x[i + 1]) > counter:\r\n counter = (x[i] - x[i + 1])\r\nprint(max(counter - c, 0))\r\n", "n, c = [int(x) for x in input().split()]\nA = [int(x) for x in input().split()]\nk = max(A[i] - A[i+1] for i in range(n-1))\nprint(max(0, k - c))\n", "n,c=list(map(int,input().split()))\r\nl=list(map(int,input().split()))\r\nx=max([l[i]-l[i+1]-c for i in range(n-1)])\r\nprint(max(0,x))", "line = input()\r\nline = line.split()\r\nn = int(line[0])\r\nc = int(line[1])\r\nline = input()\r\nline = line.split()\r\nxtra = 0\r\nline[0] = int(line[0])\r\nfor i in range(1,n):\r\n line[i] = int(line[i])\r\n if ((line[i-1] - line[i])-c) > xtra:\r\n xtra = (line[i-1] - line[i]) - c\r\nprint(xtra)", "[n,c] = input().split()\r\nmaxof=0\r\nc=int(c)\r\ng=input().split()\r\nfor i in range(1,int(n)):\r\n h=int(g[i-1])\r\n k=int(g[i])\r\n if maxof<(h-k-c):\r\n maxof=h-k-c\r\nprint(maxof)\r\n", "import sys\r\n\r\n# inp = open(\"input.txt\", \"r\")\r\ninp = sys.stdin\r\n\r\nn, c = map(int, inp.readline().split())\r\nx = list(map(int, inp.readline().split()))\r\n\r\nmaxProfit = 0\r\ni = 0\r\nwhile i < len(x) - 1:\r\n profit = x[i] - x[i+1] - c\r\n if profit > maxProfit:\r\n maxProfit = profit\r\n i += 1\r\n\r\nprint(maxProfit)", "n,c=map(int,input().split())\r\na=list(map(int,input().split()))\r\n\r\ny,m=0,0\r\nfor i in range(0,n-1):\r\n m = max(a[i]-a[i+1]-c,m)\r\n \r\nprint(m)", "n, c = [int(i) for i in input().split()]\r\narr = [int(i) for i in input().split()]\r\n\r\ncurr = 1\r\n\r\nans = 0\r\n\r\nfor i in range(len(arr)-1):\r\n currentMoney = arr[i]\r\n if currentMoney > arr[i+1]:\r\n ans = max(ans, currentMoney - arr[i+1]-c)\r\n\r\nprint(ans)\r\n\r\n", "n, c = map(int, input().split() )\na = list(map(int, input().split() ) )\n\nmx = 0\nfor i in range(n-1):\n mx = max(mx, a[i]-a[i+1] - c)\nprint(mx)\n", "N, C = map(int, input().split())\r\nNums = list(map(int, input().split()))\r\nMax = 0\r\nfor i in range(N - 1):\r\n Max = max(Max, Nums[i] - Nums[i + 1] - C)\r\nprint(Max)\r\n", "val = [int(n) for n in input().split()]\r\nn = val[0]\r\nc = val[1]\r\ndays = [int(n) for n in input().split()]\r\nresult = 0\r\nfor i in range(1,n):\r\n if days[i-1] > days[i]:\r\n result = max(result,days[i-1] - days[i] - c)\r\nprint(result)\r\n", "n, c = list(map(int, input().split()))\nx = list(map(int, input().split()))\n\nprofit = [x[i]-c-x[i+1] for i in range(len(x)-1)]\nprint(max(0,max(profit)))\n\n\n\n", "n, c = [int(x) for x in input().split()]\nl = [int(x) for x in input().split()]\nans = 0\nfor (a, b) in zip(l[:-1], l[1:]):\n\tans = max(ans, a - b - c)\nprint(ans)\n", "n,c=map(int,input().split())\r\na,r=list(map(int,input().split())),0\r\nfor i in range(1,n):r=max(r,a[i-1]-a[i])\r\nprint(r-c if r>c else 0)", "I = [int(i) for i in input().split()]\r\nn, c = I[0], I[1]\r\nI = [int(i) for i in input().split()]\r\nI_new = []\r\nfor i in range(1, n): I_new.append((I[i-1]-I[i]))\r\nI_new.sort()\r\nans = I_new[-1]-c\r\nif ans < 0: print(0)\r\nelse: print(ans)\r\n", "'''\r\n1 Habib_2010\r\n2 ___Hafizullo___\r\n3 Cyber_Snake\r\n4 mr.itmo\r\n5 I_am_Naruto\r\n6 JahongirLucifer\r\n7 _Habibolloh_\r\n'''\r\nn, c = map(int, input().split())\r\n*a, = map(int, input().split())\r\nsum = 0\r\nfor i in range(n - 1):\r\n sum = max(sum, a[i] - c - a[i + 1])\r\nprint(sum)\r\n", "a= list(map(int, input().split()))\r\nn,c=a[0],a[1]\r\nb= list(map(int, input().split()))\r\nmax_r=0\r\nfor i in range(0,n-1):\r\n if b[i]-b[i+1]>max_r:\r\n max_r=b[i]-b[i+1]\r\n p1=b[i]\r\n p2=b[i+1]\r\nans=max_r-c\r\nif ans>0:\r\n print(ans)\r\nelse:\r\n print(0)", "n,c=map(int,input().split())\r\nk=list(map(int,input().split()))\r\nl=[]\r\nfor i in range(n-1):\r\n l.append(k[i]-k[i+1]-c)\r\nh=max(l)\r\nif h>0:\r\n print(h)\r\nelse:\r\n print(\"0\")\r\n ", "n,k=map(int,input().split())\r\nmax=0\r\ntmp=0\r\nx=list(map(int,input().split()))\r\nfor i in range(n-1):\r\n\tif x[i] > (x[i+1] + k) :\r\n\t\ttmp=x[i]-(x[i+1] + k)\r\n\tif tmp > max :\r\n\t\tmax=tmp\r\nprint(max)\r\n\t", "n, k = map(int, input().split())\r\nt = list(map(int, input().split()))\r\np = max([t[i - 1] - t[i] for i in range(1, n)])\r\nprint(0 if p < k else p - k)", "\r\nst = input().split()\r\nn = int(st[0])\r\nc = int(st[1])\r\nx = input().split()\r\nans = 0\r\nfor i in range(n-1):\r\n ans = max(ans,int(x[i])-int(x[i+1])-c)\r\nprint(ans)", "a,b=[int(i) for i in input().split()]\r\nc=[int(i) for i in input().split()]\r\ne=[]\r\nfor i in range(0,len(c)-1):\r\n d=(c[i]-c[i+1]-b)\r\n if(d>=0):\r\n e.append(d)\r\nif(len(e)==0):\r\n print(0)\r\nelse:\r\n print(max(e))", "l1=list(map(int,input().split()))\r\nn=l1[0]\r\nc=l1[1]\r\nl=list(map(int,input().split()))\r\nm=int(l[0]-l[1])-c\r\nfor i in range(1,n-1):\r\n if m<int(l[i]-l[i+1])-c:\r\n m=int(l[i]-l[i+1])-c\r\nif m<0:\r\n print(\"0\")\r\nelse:\r\n print(m) \r\n", "n,c= map(int,input().split())\r\n# n=int(input())\r\n\r\nx=list(map(int,input().split()))\r\nb=[]\r\nfor i in range(n-1):\r\n b+=[x[i]-x[i+1]]\r\nb.sort()\r\nif b[n-2]>c:\r\n print(b[n-2]-c)\r\nelse:\r\n print(\"0\")\r\n\r\n\r\n\r\n", "n,c=[int(x) for x in input().split()]\r\nprices=[int(x) for x in input().split()]\r\ndif=prices[0]-prices[1]\r\nfor i in range(n-1):\r\n if prices[i]-prices[i+1]>dif:\r\n dif=prices[i]-prices[i+1]\r\nprint(max(0,dif-c))\r\n \r\n", "n , c = map(int,input().split())\r\nm = 0\r\nl = list(map(int,input().split()))\r\nfor i in range(n-1):\r\n m = max(m, l[i] - l[i+1] - c)\r\nprint(m)", "n, c = input().split(); n = int(n); c = int(c)\nl = list(map(int, input().split()))\nmx = -100000\nfor i in range(n-1):\n if l[i] > l[i+1] and l[i]-l[i+1] > mx:\n mx = l[i]-l[i+1]\ns = mx-c; print(s if s > 0 else 0)\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\nI=lambda:list(map(int,input().split()))\r\nn,c=I()\r\na=I()\r\nprint(max([a[i]-a[i+1]-c for i in range(n-1)]+[0]))", "n , y = [int(x) for x in input().split()]\r\nli = [int(x) for x in input().split()]\r\nmaxDiff = 0\r\nfor x in range(n-1):\r\n if maxDiff < li[x] - li[x+1]:\r\n maxDiff = li[x] - li[x+1]\r\nif maxDiff - y > 0:\r\n print(maxDiff-y)\r\nelse:\r\n print(0)", "n, c = map(int, input().split())\nlast, best = -1, 0\nfor x in map(int, input().split()):\n t = last-x-c\n best = max(best, t)\n last = x\nprint(best)\n", "n, c = map(int, input().split())\r\nkilos = list(map(int, input().split()))\r\nmaximum = 0\r\nfor i in range(1, n):\r\n maximum = max(maximum, kilos[i-1]-kilos[i]-c)\r\nprint(maximum)\r\n", "n, c = map(int, input().split())\r\nX = list(map(int, input().split()))\r\n\r\nprint(max(0, max(X[i] - X[i + 1] for i in range(n - 1)) - c))", "[n,c] = list(map(int,input().split()))\r\n\r\nlis = list(map(int,input().split()))\r\n\r\nans = 0\r\n\r\nmaxDiff = lis[0] - lis[1]\r\nfor i in range(1,n):\r\n if lis[i]>lis[i-1]:\r\n pass\r\n else:\r\n if lis[i-1] - lis[i] >= maxDiff:\r\n maxDiff = lis[i-1] - lis[i]\r\n order = i-1\r\n\r\nif maxDiff <= 0:\r\n print(ans)\r\nelse:\r\n if maxDiff <= c:\r\n print(ans)\r\n else:\r\n ans = maxDiff - c\r\n print(ans)\r\n ", "y,x=list(map(int,input().split()))\r\nnums=list(map(int,input().split()))\r\nans=0\r\nfor i in range(1,len(nums)):\r\n ans=max(ans,nums[i-1]-nums[i]-x)\r\nprint(ans)", "def main():\n (n, c) = map(int, input().split(' '))\n a = list(map(int, input().split(' ')))\n ma = 0\n for i in range(n-1):\n ma = max(a[i] - a[i + 1] - c, ma)\n return ma\n\nprint(main())\n", "n,c=map(int,input().split())\na=list(map(int,input().split()))\nt=0\nfor i in range(n-1):\n if(a[i]-a[i+1]-c)>t:\n t=a[i]-a[i+1]-c\nprint(t)\n\n", "n, c = (int(i) for i in input().split())\nx = [int(i) for i in input().split()]\nres = 0\nfor i in range(n - 1):\n res = max(res, x[i] - x[i + 1] - c)\nprint(res)\n", "n,c=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nm=0\r\nfor i in range(len(l)-1):\r\n if l[i]-l[i+1]-c>m:\r\n m=l[i]-l[i+1]-c\r\n\r\nprint(m)\r\n\r\n", "n,c = map(int,input().split())\narr = [int(x) for x in input().split()]\nmx = 0\nfor i in range(n-1):\n\tval = arr[i]-arr[i+1]-c\n\tif val>0:\n\t\tmx = max(mx,val)\nprint(mx)\n", "n,c=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ndiff=[]\r\nfor i in range(0,n):\r\n if i<n-1:\r\n diff.append(l[i]-l[i+1])\r\nind=diff.index(max(diff))\r\nans=l[ind]-l[ind+1]-c\r\nif ans>0:\r\n print(ans)\r\nelse:\r\n print(0)", "n, c = map(int, input().split())\r\nx = list(map(int, input().split()))\r\nprint(max(0, max(x[i] - x[i + 1] - c for i in range(0, n - 1))))\r\n", "from sys import stdin, stdout\r\n\r\nnc = list(map(int, stdin.readline().strip().split()))\r\nn = nc[0]\r\nc = nc[1]\r\nprices = list(map(int, stdin.readline().split()))\r\nmax_rasp = prices[0] - (prices[1] + c)\r\nfor i in range(1, n - 1):\r\n max_rasp = max(max_rasp, prices[i] - (prices[i+1] + c))\r\nif max_rasp < 0:\r\n stdout.write('0')\r\nelse:\r\n stdout.write(str(max_rasp))", "n, c = [int(i) for i in input().split()]\nx = [int(i) for i in input().split()]\n\nm = 0\n\nfor i in range(n-1):\n\ty = x[i] - x[i+1] - c\n\tif y > m:\n\t\tm = y\n\nprint(m)\n", "import sys\n\nn, c = map(int, sys.stdin.readline().split())\nxn = list(map(int, sys.stdin.readline().split()))\n\nans = 0\nfor i in range(1, n):\n if xn[i-1] - xn[i] > ans:\n ans = xn[i-1] - xn[i]\n\nans = ans - c\nif ans < 0:\n ans = 0\n\nprint(ans)\n", "n, c = map(int,input().split())\r\nx = list(map(int,input().split()))\r\nprofits = set()\r\nprofits.add(0)\r\nfor i in range(len(x)-1):\r\n if x[i]>x[i+1]:\r\n profits.add(x[i]-x[i+1]-c)\r\nprint(max(profits))", "n_c = input().split()\r\nn = int(n_c[0])\r\nc = int(n_c[1])\r\nx = input().split()\r\nx_list = []\r\nfor i in range(n):\r\n x_list.append(int(x[i]))\r\nmaximum_difference = c\r\nfor i in range(n - 1):\r\n if x_list[i] - x_list[i + 1] > maximum_difference:\r\n maximum_difference = x_list[i] - x_list[i + 1]\r\n\r\nif maximum_difference == c:\r\n print(0)\r\nelse:\r\n print(maximum_difference - c)\r\n", "n,c=map(int,input().split())\r\na=list(map(int,input().split()))\r\nr=[]\r\nfor j in range(len(a)-1):\r\n\tr.append(a[j]-a[j+1])\r\n# print(r)\r\ny=r.index(max(r))\r\n# print(y)\r\nx1=a[y]\r\nx2=a[y+1]\r\n# print(x1,x2)\r\nm=(x1-x2-c)\r\nif(m<=0):\r\n\tprint(0)\r\nelse:\r\n\tprint(m)", "n,c=map(int,input().split())\r\na=list(map(int,input().split()))\r\nt=0\r\nfor i in range(n-1):\r\n if(a[i]-a[i+1]-c)>t:\r\n t=a[i]-a[i+1]-c\r\nprint(t)", "n, c = map(int, input().split())\nl = list(map(int, input().split()))\nans = 0\nfor i in range(n-1):\n if l[i+1] < l[i]:\n ans = max(l[i]-l[i+1]-c, ans)\nprint(ans)", "n, c = [int(i) for i in input().split()]\nx = [int(i) for i in input().split()]\n\nr = 0\nfor i in range(n-1):\n if c < x[i] and x[i] > x[i+1]:\n if x[i] - x[i+1] > r:\n r = x[i] - x[i+1]\n\nif r < c:\n print(0)\nelse:\n print(r - c)", "\n#n = int(input())\nn, m = map(int, input().split())\n#s = input()\nc = list(map(int, input().split()))\nl = 0\nfor i in range(n - 1):\n l = max(l, c[i] - c[i + 1] - m)\nprint(l)", "n,c=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nprint(max([arr[i]-arr[i+1]-c for i in range(n-1)]+[0]))\r\n ", "n,c=map(int,input().strip().split(\" \"))\na=list(map(int,input().strip().split(\" \")))\nl=0\nfor i in range(n-1):\n if l<a[i]-a[i+1]:\n l=a[i]-a[i+1]\nif l-c > 0:\n print(l-c)\nelse:\n print(0)\n", "p=[int(n) for n in input().split()]\r\ns=[int(n) for n in input().split()]\r\nop=[]\t\r\npq=[]\r\nfor n in range(len(s)-1):\r\n\tpq.append(s[n]-s[n+1])\r\nif max(pq)-p[1]<0:\r\n\tprint(0)\r\nelse:\r\n\tprint(max(pq)-p[1])", "n,c = map(int,input().split())\r\na = list(map(int,input().split()))\r\nmaxdiff=0\r\nfor i in range(n-1):\r\n maxdiff = max(maxdiff, a[i]-a[i+1])\r\n#print(maxdiff)\r\nmaxdiff-=c\r\nif(maxdiff>0):\r\n print(maxdiff)\r\nelse:\r\n print(0)", "a,b= list(map(int,input().split()))\r\nc= list(map(int,input().split()))\r\nd = max((c[i]- b- c[i+1]) for i in range(len(c)-1) )\r\nif d>=0:\r\n print(d)\r\nelse:\r\n print(0)", "z = []\r\nx = []\r\nw = []\r\nz[0:] = map(int, input().split())\r\nx[0:] = map(int, input().split())\r\nfor i in range(len(x)-1):\r\n w.append(x[i]-x[i+1])\r\nsumm = x[w.index(max(w))]-x[w.index(max(w))+1]-z[1]\r\nif summ < 0:\r\n print(0)\r\nelse:\r\n print(summ)\r\n\r\n", "n,k=map(int,input().split())\r\nl=[int(i) for i in input().split()]\r\nmini=l[n-1]\r\nprft=0\r\nfor i in range(n-2,-1,-1):\r\n curr=l[i]-l[i+1]-k\r\n #print(curr)\r\n prft=max(prft,curr)\r\nprint(prft)\r\n \r\n \r\n ", "n,c=map(int,input().split())\r\nprofits=[0]\r\na=[int(x) for x in input().split()]\r\nfor x in range(len(a)-1):\r\n if a[x]-a[x+1]-c>0:\r\n profits.append(a[x]-a[x+1]-c)\r\n#print(profits)\r\nprint(max(profits))", "n,c = map(int,input().split())\r\nmal = 0\r\nx = list(map(int,input().split()))\r\nfor i in range(n-1):\r\n if x[i] > x[i+1]+c:\r\n mal=max(mal,x[i] -x[i+1]-c)\r\nprint(mal)", "from fileinput import *\r\n\r\nfor line in input():\r\n\tif lineno() == 1:\r\n\t\t[n, c] = list(map(int, line.split()))\r\n\telse:\r\n\t\tx = list(map(int, line.split()))\r\n\r\nmax_diff = 0\r\n\r\nfor i in range(1, n):\r\n\tdiff = x[i-1] - x[i]\r\n\tif diff > max_diff:\r\n\t\tmax_diff = diff\r\n\r\nr = max_diff - c\r\n\r\nprint(r) if r > 0 else print(0)", "n,c=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nma=c\r\nfor i in range(1,n):\r\n t=l[i-1]-l[i]\r\n if ma<t: ma=t\r\nprint(ma-c)", "m, n = [int(i) for i in input().split()]\r\nl = [int(i) for i in input().split()]\r\n\r\nif not l == sorted(l):\r\n l_ = max([l[i] - l[i+1] for i in range(m-1)])\r\n print(l_-n if l_-n>0 else 0)\r\nelse: print(0)", "n, c = map(int, input().split())\r\ndata = list(map(int, input().split()))\r\n\r\nmv = 0\r\nfor i in range(1, n):\r\n mv = max(mv, data[i - 1] - (data[i] + c))\r\n\r\nprint(mv)", "I=lambda:list(map(int,input().split()))\r\nn,c=I()\r\na=I()\r\nprint(max([a[i]-a[i+1]-c for i in range(n-1)]+[0]))\r\n", "n, c = list(map(int, input().split()))\r\nx = list(map(int, input().split()))\r\nprofit = 0\r\nfor i in range(n-1):\r\n daily = x[i] - x[i+1] - c\r\n if daily > profit:\r\n profit = daily\r\nprint(profit)\r\n", "firstLine = [int(x) for x in input().split()];\r\nsecondLine = [int(x) for x in input().split()];\r\n\r\nbest = 0;\r\n\r\nfor i in range(0, len(secondLine)-1):\r\n temp = (secondLine[i]-secondLine[i+1])-firstLine[1];\r\n if(temp>best):\r\n best = temp;\r\n\r\nprint(best);", "s = input()\r\na = s.split(\" \")\r\nn = int(a[0])\r\nc = int(a[1])\r\ns = input()\r\na = s.split(\" \")\r\nmx = 0\r\nfor i in range(n):\r\n a[i] = int(a[i])\r\nfor i in range(0,n-1):\r\n if a[i]-a[i+1]-c > mx:\r\n mx = a[i]-a[i+1]-c\r\nprint(mx)", "n,c=map(int,input().split())\narr=list(map(int,input().split()))\nmax_dif=0\nindex=0\nfor i in range(len(arr)-1):\n if arr[i+1]<arr[i]:\n if arr[i]-arr[i+1]>max_dif:\n max_dif=arr[i]-arr[i+1]\n index = i\nif arr[index]-arr[index+1]-c < 0 :\n print(0)\nelse:\n print(arr[index]-arr[index+1]-c)", "import logging\r\nimport copy\r\nimport sys\r\n\r\nlogging.basicConfig(stream=sys.stderr, level=logging.DEBUG)\r\n\r\n#def solve(firstLine):\r\ndef solve(firstLine, inputLines):\r\n m = 0\r\n x = firstLine[1]\r\n\r\n for i in range(len(inputLines)-1):\r\n s = inputLines[i] - inputLines[i+1] - x\r\n\r\n if s > m:\r\n m = s\r\n return m\r\n\r\ndef main():\r\n firstLine = input().split()\r\n firstLine = list(map(int, firstLine))\r\n line = input().split()\r\n line = list(map(int, line))\r\n \r\n print(solve(firstLine, line))\r\n\r\ndef log(*message):\r\n logging.debug(message)\r\n \r\nif __name__ == \"__main__\":\r\n main()\r\n", "n,c = map(int,input().split())\r\nx = list(map(int,input().split()))\r\nl = []\r\nfor i in range(n-1):\r\n l.append(x[i]-x[i+1]-c)\r\nl.append(0)\r\nprint(max(l))\r\n \r\n", "n,c = map(int,input().split())\r\nx = list(map(int,input().split()))\r\nm=0\r\nfor i in range(n-1):\r\n if(x[i]>=c and x[i]-x[i+1]-c>m):\r\n m=x[i]-x[i+1]-c\r\nprint(m)", "n, c = map(int, input().split())\r\na = list(map(int, input().split()))\r\nm = 0\r\nfor i in range(n - 1):\r\n if a[i] - a[i + 1] - c > m:\r\n m = a[i] - a[i + 1] - c\r\nprint(m)", "I=lambda:map(int,input().split())\r\nn,c=I()\r\na=[*I()]\r\nprint(max(0,*[x-y-c for x,y in zip(a,a[1:])]))", "n, c = map(int, input().split())\r\nlst = list(map(int, input().split()))\r\nr = max(a-b-c for a, b in zip(lst, lst[1:]))\r\nprint(max(r, 0))", "a=int(input().split()[1])\r\nb=list(map(int,input().split()))\r\nb=[b[0]]+b\r\nc=max(map(lambda x:b[x]-b[x+1],range(len(b)-1)))\r\nprint(max(c-a,0))\r\n", "try:\r\n n,c=map(int,input().split())\r\n k=[int(i) for i in input().split()]\r\n a=[]\r\n for i in range(n-1):\r\n if(k[i]<=k[i+1]):\r\n a.append(0)\r\n else:\r\n a.append(k[i]-k[i+1])\r\n \r\n \r\n \r\n if(max(a)==0 or max(a)<c):\r\n print(0)\r\n \r\n else:\r\n print(max(a)-c)\r\nexcept: \r\n pass\r\n", "n,v=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nma=0\r\nfor i in range(n-1):\r\n if l[i]-v-l[i+1]>ma:\r\n ma=l[i]-v-l[i+1]\r\nprint(ma)", "nc = list(map(int, input().split()))\r\nx = list(map(int, input().split()))\r\nres = 0\r\nfor i in range(1, nc[0]):\r\n\ttemp = x[i - 1] - nc[1] - x[i]\r\n\tres = max(res, temp)\r\nprint(res)", "n, c = map(int, input().split()) # Read n and c\nl = list(map(int, input().split())) # Read list of integers\nm = 0 # Initialize max difference\n# Iterate through list up to second-to-last element, update 'm'\nfor i in range(n - 1):\n m = max(l[i] - c - l[i + 1], m)\nprint(m) # Print max difference\n\t\t \t\t \t \t\t \t\t\t\t\t\t \t \t \t", "n,c=[int(x) for x in input().split()]\r\na=[int(x) for x in input().split()]\r\nres=0\r\nfor i in range(1,n):\r\n if a[i-1]-a[i]-c>=0:\r\n res=max(res,a[i-1]-a[i]-c)\r\nprint(res)", "n,c = map(int,input().split())\r\nlst = list(map(int,input().split()))\r\nmaxi=0\r\nfor i in range(n-1):\r\n if(lst[i] - lst[i+1] -c) > maxi:\r\n maxi = lst[i] - lst[i+1] -c\r\n \r\n\r\n\r\nprint(maxi)", "\r\nn , c = map(int,input().split())\r\nl = list(map(int,input().split()))\r\n\r\nmx = -100\r\n\r\nfor i in range(n - 1):\r\n x = l[i] - l[i + 1] - c\r\n mx = max(mx , x)\r\n\r\nif mx > 0 :\r\n print(mx)\r\nelse:\r\n print(0)\r\n\r\n\r\n", "maxx = -1\r\nn, c = input().split()\r\nn, c = int(n), int(c)\r\nl = list(map(int, input().strip().split()))[:n]\r\nfirst = l[0]\r\nfor i in range(1, len(l)):\r\n profit = first-l[i]-c\r\n first = l[i]\r\n if profit > maxx:\r\n maxx = profit\r\n\r\nif maxx < 0:\r\n print(0)\r\n exit()\r\n\r\nprint(maxx)\r\n", "n,c=map(int,input().split())\r\ndays=list(map(int,input().split()))\r\nMAX=[0]\r\nfor i in range(len(days)):\r\n if i!=len(days)-1:\r\n if days[i+1]<days[i]:\r\n MAX.append(days[i]-days[i+1]-c)\r\n \r\nprint(max(MAX))\r\n ", "#In the name of Allah\r\n\r\nfrom sys import stdin, stdout\r\ninput = stdin.readline\r\n\r\nn, c = map(int, input().split())\r\nx = list(map(int, input().split()))\r\n\r\nma = x[0] - x[1]\r\nfor i in range(2, n):\r\n ma = max(x[i - 1] - x[i], ma)\r\n\r\nstdout.write(str(max(0, ma - c)))\r\n", "n,c = input().split()\r\nn = int(n)\r\nc = int(c)\r\n\r\na = list(map(int,input().split()))\r\nmax_temp = 0\r\nfor i in range(n-1):\r\n if a[i] > a[i+1]:\r\n diff = a[i] - a[i+1] - c\r\n #print(\"iter: \",i,a[i],a[i+1],c,diff)\r\n if diff > max_temp:\r\n max_temp = diff\r\nprint(max_temp)", "n, c = map(int, input().split())\r\na = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(n - 1):\r\n ans = max(ans, a[i] - a[i + 1] - c)\r\nprint(ans)", "\r\nz,b=map(int,input().split())\r\nc=list(map(int,input().split()))\r\nmax=0\r\nfor x in range(z-1):\r\n if max<c[x]-c[x+1]:\r\n max=c[x]-c[x+1]\r\nif max-b>0:\r\n print(max-b)\r\nelse:\r\n print(0)", "n, c = map(int, input().split())\r\np = list(map(int, input().split()))\r\n\r\nm = 0\r\nmi = -1\r\nfor i in range(n - 1):\r\n\tt = p[i] - p[i + 1] - c\r\n\tif t > m:\r\n\t\tmi = i\r\n\t\tm = t\r\n\r\nprint(m)", "n, c = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nmax = 0\r\nfor i in range(len(l)-1):\r\n if l[i] > l[i+1]:\r\n temp = l[i] - l[i+1]\r\n temp = temp - c\r\n if temp > max:\r\n max = temp\r\n\r\nprint(max)", "# -*- coding: utf-8 -*-\n\"\"\"Untitled33.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1X47b1HbLs8QexAIOUsAiGnp9lDLIOXzo\n\"\"\"\n\nn,m=map(int,input().split())\nl1=list(map(int,input().split()))\nmax=l1[0]-l1[1]\nfor i in range(0,len(l1)-1):\n if l1[i]-l1[i+1]>max:\n max=l1[i]-l1[i+1]\nif (max-m)>0:\n print(max-m)\nelse:\n print(\"0\")", "n,c = map(int,input().split())\r\npric = [int(x) for x in input().split()]\r\ndiff=(pric[i-1]-pric[i] for i in range(1,n))\r\n\r\nprint(max(0,max(diff)-c))", "a=list(map(int,input().strip().split()))\r\nn=a[0]\r\nc=a[1]\r\nb=list(map(int,input().strip().split()))\r\ns=0\r\nfor i in range(0,n-1):\r\n x=b[i]-b[i+1]-c\r\n if(x>s and x>0):\r\n s=x\r\nprint(s)\r\n\r\n\r\n \r\n", "n, m = map(int, input().split())\na = list(map(int, input().split()))\n\nmx = 0\nfor i in range(n-1):\n\tmx = max(mx, a[i] - a[i+1] - m)\n\nprint(mx)\n", "n,c=map(int,input().split()) \r\nx=list(map(int,input().split()))\r\nsell_day=0\r\nbuy_day=0\r\nmax=float('-inf')\r\nfor i in range(n-1):\r\n if max<(x[i]-x[i+1]):\r\n max=(x[i]-x[i+1])\r\n sell_day=i\r\n buy_day=i+1\r\nprofit=x[sell_day]-x[buy_day]-c\r\nif profit>0:\r\n print(profit)\r\nelse:\r\n print(0)", "def solve():\r\n n,c = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n x = []\r\n for i in range(n-1):\r\n if a[i] - a[i+1]-c >0:\r\n x.append(a[i]-a[i+1]-c)\r\n # print(x)\r\n if len(x) == 0:\r\n print(0)\r\n return\r\n print(max(x))\r\ntry:\r\n solve()\r\nexcept:\r\n pass", "n,c=map(int,input().split())\r\ndata=list(map(int,input().split()))\r\nval=0\r\nfor i in range(n-1):\r\n val=max(val,data[i]-data[i+1])\r\nprint(max(0,val-c))", "n, c = map(int, input().split())\r\nd = list(map(int, input().split()))\r\nt = 0\r\nfor i in range(n - 1):\r\n t = max(t, d[i] - d[i + 1] - c)\r\nprint(t)\r\n", "n, c = map(int, input().split())\nx = list(map(int, input().split()))\nans = 0\nfor i in range(len(x) - 1):\n ans = max(ans, x[i] - x[i + 1] - c)\nprint(ans)\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 n, c = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n ma, buy, sell = 0, 0, 0\r\n for i in range(n - 1):\r\n if ((a[i] - a[i+1]) > ma):\r\n ma = (a[i] - a[i+1])\r\n sell = a[i]\r\n buy = a[i+1]\r\n ans = sell - buy - c\r\n if (ans < 0): ans = 0\r\n print(ans)", "n, c = map(int, input().split())\r\nli = list(map(int, input().split()))\r\nmi = 0\r\nfor i in range(len(li)-1):\r\n di = li[i]-li[i+1]\r\n if di>mi and di>=0:\r\n mi = di\r\n \r\nif mi<=c:\r\n print(0)\r\nelse:\r\n print(mi-c)", "n,m = map(int, input().split())\r\na=list(map(int,input().split()))\r\nans=0\r\nfor i in range(n-1):\r\n if a[i]-a[i+1]>ans:\r\n ans=a[i]-a[i+1]\r\nans=ans-m\r\nif(ans<0):\r\n ans=0\r\nprint(ans)\r\n", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nans = max(i-j-k for i, j in zip(arr, arr[1:]))\r\nprint(max(0,ans))\r\n\r\n\r\n", "n, c = map(int, input().split())\r\nprices = list(map(int, input().split()))\r\n\r\nmax_profit = 0\r\n\r\nfor day in range(n - 1):\r\n profit = prices[day] - prices[day + 1] - c\r\n max_profit = max(max_profit, profit)\r\n\r\nprint(max_profit)\r\n", "n,c = (int(x) for x in input().split())\r\nl = [int(x) for x in input().split()]\r\na = []\r\nfor i in range(0,n-1):\r\n a.append(l[i] - l[i+1] - c)\r\na.append(0)\r\nprint(max(a))", "n,c = map(int,input().split())\r\na = [int(x) for x in input().split()]\r\nt = 0\r\nfor i in range(n - 1):\r\n if t < a[i] - a[i + 1]:\r\n t = a[i] - a[i + 1]\r\nif t == 0 or t < c:\r\n print(0)\r\nelse:\r\n print(t - c)\r\n ", "num_days, rspre = map(int,input().split()) \n\nc = [int(i) for i in input().split()]\n\nc = [c[i]-c[i+1] for i in range(len(c)-1)]\n\nmax_profit = max(c) - rspre\n\nif max_profit > 0:\n print(max_profit)\n\nelse:\n print(0)", "n, c = map(int, input().split())\r\nprices = list(map(int, input().split()))\r\nmax_profit = 0\r\n\r\nfor i in range(n - 1):\r\n profit = max(prices[i] - c - prices[i + 1], 0)\r\n max_profit = max(max_profit, profit)\r\n\r\nprint(max_profit)\r\n", "n,c = list(map(int,input().split()))\r\nl = list(map(int,input().split()))\r\nm = 0\r\nfor i in range(len(l)-1):\r\n if l[i+1] < l[i]:\r\n m = max(m,l[i] - l[i+1] - c)\r\nprint(m)", "a,b=map(int,input().split())\r\nv=list(map(int,input().split()))\r\nl=[]\r\nfor i in range(len(v)-1):\r\n l.append(v[i]-v[i+1]-b) \r\nprint(max(l) if max(l)>=0 else 0) \r\n \r\n \r\n", "n,k=map(int, input().split())\r\na=list(map(int, input().strip().split()))\r\nb=[]\r\nfor _ in range(len(a)-1):\r\n b.append(a[_]-a[_+1])\r\nprint(max(b)-k if max(b) - k>0 else 0)", "n,d=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nans=0\r\nfor i in range(n):\r\n ele=l[i]\r\n for j in range(i+1,i+2):\r\n if j!=i and j<n:\r\n ans=max(ans,(ele-l[j]-d))\r\nprint(ans)", "n,c=map(int,input().split())\r\na=list(map(int,input().split()))\r\nmx=a[0]-a[1]\r\nfor i in range(2,n):\r\n\tmx=max(mx,a[i-1]-a[i])\r\nprint(max(0,mx-c))", "# c = kg raspberry\r\n# n = nmbr of days\r\n# x = price of honey per kg raspberry \r\n\r\nR = input().strip().split()\r\nR = int(R[1])\r\nP = input().strip().split()\r\nb = 0\r\nfor i in range(len(P)-1):\r\n if(int(P[i]) - int(P[i+1]) - R>b):\r\n b = int(P[i]) - int(P[i+1]) - R\r\nprint(b)", "n, c = map(int, input().split())\narr = list(map(int, input().split()))\n\nans = 0\n\nfor i in range(1, n):\n\tans = max(ans, arr[i - 1] - arr[i])\n\nif (ans > c):\n\tprint(ans - c)\nelse:\n\tprint(0)\n", "from collections import Counter\r\n\r\n\r\n\r\nn,c = [int(x) for x in input().split()]\r\narr = [int(x) for x in input().split()]\r\nm = -1000\r\nfor i in range(n-1):\r\n d = arr[i]-arr[i+1]\r\n if d>m:\r\n m = d\r\nprofit = m-c\r\nif profit>0:\r\n print(profit)\r\nelse:\r\n print(0)\r\n", "n, c = map(int, input().split())\r\n\r\nl = list(map(int,input().split()))\r\nmx = 0\r\nfor i in range(len(l)-1):\r\n mx = max(mx,l[i]-l[i+1]-c)\r\n\r\nprint(mx)", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=sorted(a)\r\nmax1=0\r\nif a==b:\r\n print(0)\r\n\r\nelse:\r\n for i in range(0,n-1):\r\n max1=max(max1,a[i]-a[i+1]-k)\r\n print(max1)\r\n ", "n ,m = map(int,input().split())\r\ns = list(map(int,input().split()))\r\nmaxi=0\r\nfor i in range(n-1):\r\n if(s[i]-s[i+1]>maxi):\r\n maxi = s[i]-s[i+1]\r\nprint(max(0,maxi-m))\r\n \r\n", "from math import ceil\r\nn,c=map(int,input().split())\r\na=list(map(int,input().split()))\r\ndiff=0\r\nfor i in range(1,n):\r\n if(a[i]<a[i-1]):\r\n diff=max(diff,a[i-1]-a[i])\r\nif(diff-c<0 or diff==0):\r\n print(0)\r\nelse:\r\n print(diff-c) ", "n, c = [int(x) for x in input().split()]\r\nx = [int(x) for x in input().split()]\r\nans = 0\r\nfor i in range(0, len(x) - 1):\r\n ans = max(x[i] - x[i + 1] - c, ans)\r\nprint(ans)", "n, d = input().split()\nn = int (n)\nd = int (d)\n#n = int(input())\nh = list(map(int, input().split()))\n#g = list(map(int, input().split()))\n#x1, y1, x2, y2 =map(int,input().split())\n#n = int(input())\n# = [\"\"]*n\nm = 0\nfor i in range (1, n):\n m = max (m, h[i-1]-h[i]-d)\nprint (m)\n \n \n\n", "n,c=map(int,input().split())\r\na=list(map(int,input().split()))\r\nmax=0\r\nfor i in range(n-1):\r\n\tif a[i]-a[i+1]-c>max:\r\n\t\tmax=a[i]-a[i+1]-c\r\nprint(max)", "n, c = map(int, input().split()) # n - number of days, c - raspberries to return\r\nprices = list(map(int, input().split()))\r\nreturns = []\r\n\r\nreturns = [(prices[i] - prices[i+1] - c) for i in range(n-1)]\r\n\r\nif max(returns) > 0:\r\n print(max(returns))\r\nelse:\r\n print(0)", "n, c = map(int, input().split())\nx = [int(_) for _ in input().split()]\nd = [x[i] - x[i + 1] - c for i in range(n - 1)]\nprint(max(max(d), 0))# 1690402976.8940296", "n, c = list(map(int, input().rstrip().split()))\nx = list(map(int, input().rstrip().split()))\nout = 0\nfor i in range(n - 1):\n if x[i] > x[i + 1]:\n prof = x[i] - x[i + 1] - c\n out = max(out, prof)\nprint(out)\n\n", "def inp(): return input()\r\ndef si(): return int(input())\r\ndef mi(): return map(int, input().split())\r\ndef li(): return list(mi())\r\n\r\n\r\ndef solve():\r\n n, m = mi()\r\n arr = li()\r\n\r\n ans = 0\r\n for i in range(1,n):\r\n ans = max(ans, arr[i-1]-arr[i]-m)\r\n print(ans)\r\n\r\n\r\n\r\n\r\nsolve()\r\n", "a = [int(i) for i in input().split()]\r\nn = a[0]\r\nc = a[1]\r\nm = -1000000000\r\nx = [int(i) for i in input().split()]\r\nfor i in range(n - 1):\r\n\tif x[i] - x[i + 1] > m:\r\n\t\tm = x[i] - x[i + 1]\r\nif m >= c:\r\n\tprint(m - c)\r\nelse:\r\n\tprint(0)", "n, c = [int(x) for x in input().split()]\r\na=[int(x) for x in input().split()]\r\nl=[0];\r\nfor i in range(n-1):\r\n l.append(a[i]-a[i+1]-c)\r\nprint(max(l))", "array = list(map(int, input(). strip(). split()))\r\nn = array[0]\r\nc = array[1]\r\nprice = list(map(int, input(). strip(). split()))\r\ndif_list = []\r\nfor i in range(n-1):\r\n diff = price[i] - price[i+1]\r\n dif_list.append(diff)\r\nberry = max(dif_list) - c\r\nif berry <= 0 :\r\n print(0)\r\nelse :\r\n print(berry)\r\n\r\n", "n, c = [int(i) for i in input().split()]\r\nd = [int(i) for i in input().split()]\r\ndd = [0] * (n - 1)\r\nfor i in range(0, n - 1):\r\n dd[i] = d[i] - d[i + 1]\r\nprint(max(0, max(dd) - c))", "def solve(lst,n):\n\tpass\nn,p= map(int,input().split())\nlst = list(map(int,input().split(' ')))\nans = -21828918921\nfor i in range(len(lst)-1):\n\tans = max(lst[i]-lst[i+1]-p,ans)\nif ans < 0:\n\tprint(0)\nelse:\n\tprint(ans)", "n,c=map(int,input().split())\r\narr = [*map(int,input().split())]\r\nm = 0\r\nfor i in range(n-1):\r\n m = max(m,arr[i]-arr[i+1]-c)\r\nprint(m)", "n , c = list(map(int,input().split()))\r\ndata = list(map(int,input().split()))\r\nprofit = [0]\r\nfor i in range(len(data)-1):\r\n if data[i] > data[i+1]:\r\n profit.append(data[i]-data[i+1]-c)\r\nprint(max(profit))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Feb 6 09:15:43 2019\r\n\r\n@author: Arash\r\n\"\"\"\r\n\r\nn,m = map(int, input().split())\r\na=list(map(int,input().split()))\r\nans = 0 \r\n\r\nfor i in range(n-1):\r\n if a[i] - a[i+1] > ans:\r\n ans = a[i] - a[i+1]\r\n \r\nans -= m\r\nif ans < 0:\r\n ans = 0\r\n \r\nprint(ans)", "n,c=map(int,input().split())\na=[int(x) for x in input().split()]\nm=0\nfor i in range(n-1):\n t=a[i]-a[i+1]-c\n if t > m:\n m=t\nprint(m)\n", "n, c = map(int, input().split())\r\np = list(map(int, input().split()))\r\nprint(max([0] + [(p[i] - p[i+1] - c) for i in range(n-1)]))", "k = int(input().split()[1])\r\nn = [int(a) for a in input().split()]\r\nmaxi=0\r\nfor i in range(len(n)-1):\r\n if n[i] - n[i+1] - k > maxi:\r\n maxi = n[i] - n[i+1] - k\r\nprint(maxi)\r\n", "n,c = map(int,input().split())\na = list(map(int,input().split()))\nmaxi = 0\nd = -1\nfor i in range(n-1):\n\tif maxi < a[i]-a[i+1]:\n\t\tmaxi = a[i]-a[i+1]\n\t\td = i\nif d == -1:\n\tprint(0)\nelse:\n\tprint(max(a[d]-a[d+1]-c,0))\n", "n, c = map(int, input().split(' '))\r\nx = list(map(int, input().split(' ')))\r\nans = 0\r\nfor i in range(0, n - 1):\r\n if x[i] - x[i + 1] - c > ans:\r\n ans = x[i] - x[i + 1] - c\r\nprint(ans)", "import math\r\nimport sys\r\n\r\nn, c = map(int, input().split())\r\na = [int(x) for x in input().split()]\r\nans = 0\r\nfor p in range(0, n - 1):\r\n if a[p] - c - a[p + 1] >= 0:\r\n ans = max(a[p] - c - a[p + 1], ans)\r\nprint(ans)", "n, c = map(int, input().strip().split())\narr = list(map(int, input().strip().split()))\nind = -1\nmaxi = 0\nfor i in range(n-1):\n\tif arr[i]-arr[i+1] > maxi:\n\t\tind = i\n\t\tmaxi = arr[i]-arr[i+1]\nif ind == -1:\n\tprint(0)\nelse:\n\tprint(max(0, arr[ind]-arr[ind+1]-c))", "n,c=list(map(int,input().split()))\r\nl=list(map(int,input().split()))\r\nx=max(l[i]-l[i+1] for i in range(n-1))-c\r\nprint(max(0,x))\r\n", "n, c = map(int, input().split())\r\nnumbers = list(map(int, input().split()))\r\nmax = 0\r\nfor i in range(n - 1):\r\n if numbers[i] - numbers[i + 1] > max:\r\n max = numbers[i] - numbers[i + 1]\r\nif max - c > 0:\r\n print(max - c)\r\nelse:\r\n print(0)", "\r\n\r\nn,c = list(map(lambda x: int(x), input().split()))\r\nlstx = list(map(lambda x: int(x), input().split()))\r\n\r\nprofit = 0\r\n\r\nfor nitem in range(len(lstx) - 1):\r\n if(lstx[nitem] - lstx[nitem + 1] - c > profit):\r\n profit = lstx[nitem] - lstx[nitem + 1] - c\r\n\r\nprint(profit)", "from sys import stdin\r\nn, c = map(int, stdin.readline().split())\r\narr = list(map(int, stdin.readline().split()))\r\nmax_m = 0\r\nfor i in range(1, n):\r\n val = arr[i-1] - arr[i] - c\r\n max_m = max(max_m, val)\r\n\r\nprint(max_m)\r\n", "n,c=map(int,input().split())\r\na=list(map(int,input().split()))\r\nm=0\r\nfor i in range(n-1):\r\n if a[i]-a[i+1]>m:\r\n m=a[i]-a[i+1]\r\nprint(max(0,m-c))", "l1 = [int(x) for x in input().split()]\r\nn,interest = l1[0],l1[1]\r\nl2 = [int(x) for x in input().split()]\r\nprofits = [0]\r\nfor x in range(n-1):\r\n targ = l2[x]\r\n #print(targ,l2[x+1])\r\n profits.append(targ - l2[x+1]-interest)\r\n#print(profits)\r\nif max(profits)>0:\r\n print(max(profits))\r\nelse:\r\n print(0)", "a = int(input().split()[1])\r\ns = input().split()\r\nd = []\r\nfor i in range(len(s) - 1):\r\n d.append(int(s[i]) - int(s[i + 1]))\r\nn = max(d) - a\r\nif n <= 0:\r\n print(0)\r\nelse:\r\n print(n)", "n,c=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nd=0\r\nfor i in range(n-1):\r\n if d<l[i]-l[i+1]:\r\n d=l[i]-l[i+1]\r\nx=d-c\r\nif x>0:\r\n print(x)\r\nelse:\r\n print(0)\r\n\r\n", "arr1 = input().split(\" \")\r\ndays = int(arr1[0])\r\nkilos = int(arr1[1])\r\nraspberryMaxVal = 0\r\n\r\nprices = input().split(\" \")\r\n\r\nkilos = int(kilos)\r\ndays = int(days)\r\n\r\nfor i in range(0, days-1):\r\n currentVal = int(prices[i]) - int(prices[i + 1]) - kilos\r\n if currentVal < 0:\r\n continue\r\n else:\r\n if currentVal > raspberryMaxVal:\r\n raspberryMaxVal = currentVal\r\n\r\nprint(raspberryMaxVal)", "\nimport math\nimport os\nimport re\nimport sys\nfrom typing import Counter, Sized\nimport string\nfrom itertools import combinations\nfrom itertools import permutations\nfrom itertools import product\n\nif __name__ == '__main__':\n days, lent_price = map(int, input().split())\n price_for_the_day = list(map(int, input().split()))\n maxy=0\n for i in range(days-1):\n x=price_for_the_day[i]-price_for_the_day[i+1]-lent_price\n maxy=max(x,maxy)\n print(maxy)\n\n\t \t\t\t\t \t \t\t \t\t\t \t \t \t\t\t", "n, c = map(int, input().split())\r\nx = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(n - 1):\r\n ans = max(ans, x[i] - x[i + 1] - c)\r\nprint(ans)\r\n", "n=input().split()\r\nx=input().split()\r\n\r\nmx=0\r\nfor i in range(0,len(x)-1):\r\n jlh=int(x[i])-int(x[1+i])-int(n[1])\r\n if jlh>mx:\r\n mx=jlh\r\nprint(mx)\r\n", "n, c = map(int, input().split())\r\ndata = list(map(int, input().split()))\r\n\r\nres = 0\r\n\r\nfor i in range(n - 1):\r\n res = max(res, data[i] - data[i + 1] - c)\r\nprint(res)\r\n", "x, y = list(map(int, input().split()))\r\nr=list(map(int, input().split()))\r\n\r\npo1 = 0\r\npo2 = 1\r\nsu = 0\r\n\r\nwhile po2 < x:\r\n z = r[po1] -r[po2]\r\n if z> su:\r\n su = z\r\n po1 +=1\r\n po2 +=1\r\n\r\nsu = su -y\r\nif su< 0 :\r\n print(0)\r\n exit()\r\n\r\nprint(su)", "n, c = map(int, input().split())\r\narr = [int(i) for i in input().split()]\r\nl = []\r\nfor i in range(n-1):\r\n l.append(arr[i]-arr[i+1]-c)\r\nif max(l) < 0:\r\n print(0)\r\nelse:\r\n print(max(l))\r\n", "n,c=map(int,input().split())\r\na=list(map(int,input().split()))\r\ns=0\r\nfor i in range(n-1):\r\n\tif a[i]>a[i+1]:\r\n\t\ts=max(s,a[i]-a[i+1]-c)\r\nprint(s)", "line1 =[int(i) for i in str(input()).split(\" \")]\r\nprices =[int(i) for i in str(input()).split(\" \")]\r\nrent = []\r\nfor i in range(1,len(prices)):\r\n rent.append(prices[i-1] - prices[i]-line1[1])\r\nif max(rent) >0 :\r\n print(max(rent))\r\nelse: \r\n print(0) ", "n = list(map(int, input().split()))\r\nm = list(map(int, input().split()))\r\nc = []\r\nfor i in range(len(m)-1):\r\n ci = m[i] - m[i+1]\r\n c.append(ci)\r\nmax_i = max(c)\r\nmax_m = max(max_i - n[1], 0)\r\nprint(max_m)", "n,b=map(int,input().split())\r\n\r\nl=list(map(int,input().split()))\r\nans=0\r\nfor i in range(n-1):\r\n ans=max(ans,l[i]-l[i+1]-b)\r\nprint(ans)\r\n", "n,c=map(int,input().strip().split())\r\nll=list(map(int,input().strip().split()))\r\ngb=0\r\nfor i in range(n-1):\r\n lc = ll[i] - ll[i+1] -c\r\n if gb<lc:\r\n gb = lc\r\nprint(gb if gb>0 else 0)\r\n", "days, cost = list(map(int, input().split()))\r\nlestDays = list(map(int, input().split()))\r\nc = [0]\r\ni = 0\r\nwhile i != days-1:\r\n c.append((lestDays[i] - lestDays[i+1]) - cost)\r\n i += 1\r\nprint(max(c))", "a, b = map(int, input().split(' '))\r\nhoney = list(map(int, input().split(' ')))\r\ndhoney = [honey[x-1]-honey[x] for x in range(1, len(honey))]\r\nprint(max(max(dhoney) - b, 0))\r\n", "n,c=map(int,input().split())\r\na=list(map(int,input().split()))\r\nm=int(0)\r\nfor i in range(n-1):\r\n x=a[i]-a[i+1]-c\r\n m=max(m,x) \r\nprint(m)", "n,m=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\nlst=[]\r\nfor i in range(n-1):\r\n\tlst.append(a[i]-a[i+1])\r\nans=max(max(lst)-m,0)\r\nprint(ans)\r\n", "from collections import defaultdict\r\nfrom operator import inv\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inps():\r\n return(input())\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\nn, c = invr()\r\ncost = inlt()\r\nmaxProfit = 0\r\n\r\nfor i in range(1,n):\r\n profit = cost[i-1] - cost[i] - c\r\n maxProfit = max(profit, maxProfit)\r\n\r\nprint(maxProfit)", "import math\r\n\r\ndef ost(a,b):\r\n if a%b!=0:\r\n return 1\r\n return 0\r\n\r\nn,k=map(int,input().split())\r\nans=0\r\ndata=list(map(int,input().split()))\r\nfor i in range(n-1):\r\n if data[i]-data[i+1]-k>0 and data[i]-data[i+1]-k>ans:\r\n ans=data[i]-data[i+1]-k\r\nprint(ans)", "n, c = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nm = l[0] - l[1]\r\nfor i in range(1,n-1):\r\n v = l[i] - l[i+1]\r\n if v > m:\r\n m = v\r\nd = m-c\r\nprint(d if d>0 else 0)\r\n", "\r\nn, c= map(int, input().split())\r\n\r\nar=list(map(int, input().split()))\r\n\r\nmax=0\r\n\r\nfor i in range(n-1):\r\n if ar[i]-ar[i+1]-c>max:\r\n max=ar[i]-ar[i+1]-c \r\nprint(max) ", "#!/usr/bin/python3 -SOO\nn,c = map(int,input().strip().split())\nxs = list(map(int,input().strip().split()))\n\nans = 0\nfor i,j in zip(xs,xs[1:]):\n ans = max(ans,(i-j-c))\nprint(ans)\n", "x = input().split(\" \")\narray = input().split(\" \")\nfriend = int(x[1])\npossible = False\ndiff = 0\ni = 1\nwhile i<len(array):\n temp = int(array[i-1])-int(array[i])\n if temp>diff:\n diff = temp\n possible = True\n i+=1 \nif not possible:\n print(0)\nelif diff-friend<=0:\n print(0)\nelse:\n print(diff-friend)", "n,c=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nprofit=0\r\nfor i in range(n-1):\r\n profit=max(profit,l[i]-l[i+1]-c)\r\nprint(profit)\r\n", "from sys import stdin; inp = stdin.readline\r\nfrom math import dist, ceil, floor, sqrt, log\r\ndef IA(): return list(map(int, inp().split()))\r\ndef FA(): return list(map(float, inp().split()))\r\ndef SA(): return inp().split()\r\ndef I(): return int(inp())\r\ndef F(): return float(inp())\r\ndef S(): return inp()\r\n\r\ndef main():\r\n n, c = IA()\r\n a = IA()\r\n m = 0\r\n for i in range(1, n):\r\n diff = a[i-1]-a[i]\r\n if diff > 0:\r\n diff -= c\r\n m = max(m, diff)\r\n return m\r\n\r\nif __name__ == '__main__':\r\n print(main())", "n,c=map(int,input().split())\r\na=list(map(int,input().split()))\r\nd=0\r\nfor i in range(n-1):\r\n if a[i]-a[i+1]-c>d:\r\n d=a[i]-a[i+1]-c\r\nprint(d)", "n,c = map(int,input().split())\nl1 = list(map(int,input().split()))\nresult = [0]\ndef func(x,l1):\n if x==len(l1)-1:\n return 0 \n else:\n res = l1[x]-l1[x+1]-c\n if res>0:\n return res\n else:\n return 0 \n \n\nfor x in range(len(l1)):\n if func(x,l1)>0:\n result.append(func(x,l1))\n else:\n pass\n \n\n\n\n\nif max(result)==None:\n print(0)\nelse:\n print(max(result))\n\n\n\n\n\n\n\n \n\n\n\n\n\n\n\n\n\n", "n, c = map(int, input().split())\nx = list(map(int, input().split()))\nmax_dif = 0\nfor i in range(1, n):\n if x[i - 1] - x[i] > max_dif:\n max_dif = x[i - 1] - x[i]\nprint(max(max_dif - c, 0))\n", "n,c=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nmaxdif=0\r\nd=-1\r\nfor i in range(len(l)-1):\r\n if(l[i]-l[i+1]>maxdif):\r\n maxdif=l[i]-l[i+1]\r\n d=i\r\nif(d==-1):\r\n print(0)\r\nelse:\r\n t=l[d]-l[d+1]-c\r\n if(t>0):\r\n print(t)\r\n else:\r\n print(0)\r\n \r\n", "x,y = map(int, input().split())\r\nli =list(map(int, input().split()))\r\nmax1 = 0\r\nfor i in range(x-1):\r\n if max1< li[i] - li[i+1]: max1 = li[i]-li[i+1]\r\nif max1-y >=0: print(max1-y)\r\nelse: print(0)\r\n", "n,c = map(int,input().split())\nx = list(map(int,input().split()))\n\nmax = 0\nfor i in range(n-1):\n if x[i] - x[i+1] > max:\n max = x[i] - x[i+1]\nif max - c > 0:\n print(max - c)\nelse:\n print(0)\n \t \t\t \t \t \t\t \t \t \t \t \t\t\t\t \t\t", "#bear and rasp\r\nn,c=map(int,input().split())\r\narr=list(map(int,input().split()))\r\n\r\nindex=0\r\ndiff=0\r\nfor i in range(n-1):\r\n if arr[i]-arr[i+1] > diff:\r\n diff = arr[i]-arr[i+1]\r\n index=i\r\nif c>max(arr) or c>diff:\r\n print(0)\r\nelse:\r\n print(diff-c)", "x = input()\r\ndays, cost = [int(i) for i in x.split()]\r\n\r\nprices = input()\r\nprices = [int(i) for i in prices.split()]\r\n\r\nlargest = 0\r\nfor i in range(0, days-1):\r\n #find largest difference, and index in prices\r\n diff = prices[i] - prices[i+1] - cost\r\n if diff > largest:\r\n largest = diff\r\n indexLargest = i\r\n\r\nif largest > 0:\r\n print(largest)\r\nelse:\r\n print('0')\r\n", "n,c=map(int,input().split())\r\narray=list(map(int,input().split()))\r\na=[0]\r\nfor i in range(n-1):\r\n if array[i]<array[i+1]:\r\n continue\r\n elif array[i] == array[i + 1]:\r\n continue\r\n else:\r\n d= array[i] - array[i + 1]\r\n a.append(d)\r\nif max(a)>=c:\r\n print(max(a)-c)\r\nelse:\r\n print(\"0\")", "n,r=map(int,input().split());p=ans=0\r\nfor i in map(int,input().split()):ans=max(ans,p-i-r);p=i\r\nprint(ans)", "n, c = map(int, input().split())\r\nx = list(map(int, input().split()))\r\nres = c\r\nfor i in range(n - 1):\r\n res = max(res, x[i] - x[i + 1])\r\nprint(max(0, res - c))", "n, c = map(int, input().split())\r\nx = list(map(int, input().split()))\r\na = []\r\nfor i in range(n-1):\r\n a.append(x[i]-x[i+1]-c)\r\nprint(max(a) if max(a)>0 else 0)", "n ,c = map(int,input().split())\r\nlst = list(map(int,input().split()))\r\nm = 0\r\nfor i in range(n-1):\r\n m = max(m,(lst[i]-lst[i+1])-c)\r\n \r\nprint(m)", "import sys\nn, c = map(int, sys.stdin.readline().split())\nx = list(map(int, sys.stdin.readline().split()))\na = max([x[i] - x[i+1] for i in range(n-1)])\nprint(max(a-c,0))\n", "L1= [int(x) for x in input().split(\" \")]\r\n\r\nrent_rash=L1[1]\r\nL3=[0]\r\nL2= [int(x) for x in input().split(\" \")]\r\n\r\nfor i in range(0,len(L2)-1):\r\n\r\n if L2[i]>L2[i+1]:\r\n total=L2[i]\r\n\r\n total=total-L2[i+1]\r\n total=total-rent_rash\r\n if total>=0:\r\n L3.append(total)\r\nprint(max(L3))", "n, c = map(int, input().split())\r\nk = list(map(int, input().split()))\r\n\r\nnum_1 = 0\r\nnum_2 = 0\r\nmaxi = -1\r\n\r\nfor i in range(len(k) - 1):\r\n if k[i] - k[i+1] > maxi:\r\n maxi = k[i] - k[i+1]\r\n num_1, num_2 = k[i], k[i+1]\r\n\r\nresult = 0 if maxi - c < 0 else maxi - c\r\nprint(result)", "n, c = map(int, input().split())\r\na = list(map(int, input().split()))\r\nbest = 0\r\nfor i in range(n-1):\r\n best = max(best, a[i] - a[i+1] - c)\r\n\r\nprint(best)", "s = input()\r\nl = s.split(\" \")\r\nc = int(l[1])\r\nn = int(l[0])\r\n\r\ns = input()\r\nl = s.split(\" \")\r\n\r\n\r\nb = []\r\nfor i in l:\r\n b.append(int(i))\r\n\r\nm = 0\r\nfor i in range(len(b)-1):\r\n if b[i] - b[i+1] - c > m:\r\n m = b[i] - b[i+1] - c\r\n\r\nprint(m)", "n,c=map(int,input().split())\r\nl=list(map(int,input().split()))\r\n\r\nmed=0\r\nfor i in range(n-1):\r\n if l[i]-l[i+1]>med:med=l[i]-l[i+1]\r\nprint(max(med-c,0))", "n, c = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\nb = [0]*(n-1)\r\nfor i in range(n-1):\r\n b[i] = a[i] - a[i+1]\r\nans = max(b)-c\r\nprint (max(0,ans))", "N, c = map(int, input().split())\r\nA = list(map(int, input().split()))\r\ncur = None\r\n\r\nfor i in range(1, len(A)):\r\n if cur == None: cur = A[i - 1] - A[i]\r\n else:\r\n cur = max(cur, A[i - 1] - A[i])\r\nif cur == None or cur - c < 0: print(0)\r\nelse:\r\n print(cur - c) ", "n,c=map(int,input().split())\r\nl=list(map(int,input().rstrip().rsplit()))\r\nlt=[]\r\nfor i in range(n-1):\r\n x=l[i]-l[i+1]-c\r\n lt.append(x)\r\nif(max(lt)<0):\r\n print(0)\r\nelse:\r\n print(max(lt))\r\n", "n , c = [int(x) for x in input().split()]\r\nev = [int(x) for x in input().split()]\r\n\r\nmaxDiffIndex = 0\r\nmaxDif = 0\r\nfor i in range(n - 1):\r\n diff = ev[i] - ev[i+1]\r\n if diff > maxDif:\r\n maxDiffIndex = i\r\n maxDif = diff\r\n\r\nif maxDif >= c :\r\n print(maxDif - c)\r\nelse:\r\n print(0)", "n,c=[int(x) for x in input().split()]\r\nprice=[int(x) for x in input().split()]\r\nprofit=0\r\nfor i in range(n-1):\r\n if price[i]-price[i+1]>profit:\r\n profit=price[i]-price[i+1]\r\nif profit-c>0:\r\n print(profit-c)\r\nelse:\r\n print(0)\r\n", "def solve(n: int, c: int, l: list) -> int:\r\n a = []\r\n for i in range(0,n-1):\r\n a.append(l[i] - l[i+1] - c)\r\n a.append(0)\r\n return(max(a))\r\n \r\nn,c = (int(x) for x in input().split())\r\nl = [int(x) for x in input().split()]\r\nprint(solve(n, c, l))", "n,c=map(int,input().split())\r\nprofit=[0]\r\na=[int(x) for x in input().split()]\r\nfor i in range(len(a)-1):\r\n if a[i]-a[i+1]-c>0:\r\n profit.append(a[i]-a[i+1]-c)\r\nprint(max(profit))", "MAX = 0\r\nn, c = map(int, input().split())\r\nkurs_kg = [int(i)for i in input().split()]\r\nfor i in range(1, n):\r\n if MAX < kurs_kg[i-1]-kurs_kg[i]- c:\r\n MAX = kurs_kg[i-1]-kurs_kg[i]- c\r\nprint(MAX)", "(n, c) = map(int, input().split(' '))\nprices = list(map(int, input().split(' ')))\n\nrevenue = 0\n\nfor i in range(n - 1):\n if prices[i] > prices[i + 1]:\n if prices[i] - prices[i + 1] >= revenue:\n revenue = prices[i] - prices[i + 1]\n\nprofit = revenue - c\nif profit < 0:\n print(0)\nelse:\n print(profit)", "# -*- coding: utf-8 -*-\r\n# @Author: SyedAli\r\n# @Date: 2019-05-26 14:29:21\r\n# @Last Modified by: SyedAli\r\n# @Last Modified time: 2019-05-26 14:40:35\r\n\r\nn, c = map(int, input().split())\r\nx = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(n - 1):\r\n ans = max(x[i] - x[i + 1] - c, ans)\r\nprint(ans)", "def bear(lst, c):\r\n result = 0\r\n for i in range(len(lst)):\r\n if i > 0 and lst[i - 1] - lst[i] - c > result:\r\n result = lst[i - 1] - lst[i] - c\r\n return result\r\n\r\n\r\nn, C = [int(j) for j in input().split()]\r\na = [int(x) for x in input().split()]\r\nprint(bear(a, C))\r\n", "n,c =map(int,input().split())\r\na = list(map(int,input().split()))\r\nm =0\r\nfor i in range(len(a)-1):\r\n p = a[i]-a[i+1]\r\n m = max(m,p)\r\nans = m-c\r\nif ans<0:\r\n print(\"0\")\r\nelse:\r\n print(ans) ", "#!/usr/bin/env python3\n\ndef main():\n readData = lambda : map(int, input().split())\n n, c = readData()\n X = list(readData())\n ret = 0\n for i in range(n - 1):\n ret = max(ret, X[i] - X[i + 1] - c)\n print(ret)\n\nif __name__ == \"__main__\":\n main()\n", "n,b=list(map(int,input().split()))\r\nx=list(map(int,input().split()))\r\nans=[]\r\nfor i in range(n-1):\r\n if x[i]>=x[i+1]:\r\n ans.append(x[i]-x[i+1])\r\nif len(ans)==0:\r\n print(0)\r\nelse:\r\n ans=max(ans)-b\r\n if ans<=0:\r\n print(0)\r\n else:\r\n print(ans)", "n, c = map(int, input().split())\r\nx = [int(i) for i in input().split()]\r\na = []\r\nfor i in range(1, n):\r\n a.append(x[i - 1] - x[i])\r\np = max(a) - c\r\nprint(p if p > 0 else 0)\r\n", "n, c = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\n\r\ndiff = 0\r\nfor i in range(1, n):\r\n if a[i - 1] - a[i] > diff:\r\n diff = a[i - 1] - a[i]\r\n\r\nprint(max(0, diff - c))\r\n", "res = 0\r\nn , m = map(int, input().split())\r\nt = list(map(int, input().split()))\r\nfor i in range(n-1):\r\n if t[i] > (t[i+1] + m):\r\n res = max(res, t[i] - t[i+1] - m)\r\nprint(res)\r\n", "# import sys\r\n# sys.stdin = open(\"test.in\",\"r\")\r\n# sys.stdout = open(\"test.out.py\",\"w\")\r\nn,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=0\r\nfor i in range(n-1):\r\n\tc=a[i]-a[i+1]\r\n\tif c>0:\r\n\t\tb=max(b,c)\r\nif b-x<=0:\r\n\tprint('0')\r\nelse:\r\n\tprint(b-x)\t\r\n", "n, c = map(int, input().split())\nprices = list(map(int, input().split()))\n\nmax_i = None\nmax_p = None\nfor i, p in enumerate(prices):\n if max_p is None or (i < len(prices) - 1 and p - prices[i + 1] > max_p):\n max_i = i\n max_p = p - prices[i + 1]\n\nprint(max(0, prices[max_i] - c - prices[max_i + 1]))", "n, c = map(int, input().split())\nxs = list(map(int, input().split()))\n\nmaxi = 0\nfor i in range(n - 1):\n maxi = max(maxi, xs[i] - xs[i+1] - c)\n\nprint(maxi)\n", "\r\nn, c = map(int, input().split())\r\nl = list(map(int, input().split()))\r\n\r\nans = 0\r\nfor i in range(n - 1):\r\n\td = l[i] - l[i + 1] - c\r\n\tans = max(ans, d)\r\n\r\n\r\nprint(ans)", "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,m=M()\r\na=LI()\r\nans=0\r\nfor i in range(n-1):\r\n ans=max(ans,a[i]-a[i+1]-m)\r\nprint(ans)", "n,c = map(int,input().split(' '))\r\nl = list(map(int,input().split(' ')))\r\n\r\nmax_diff = 0\r\n\r\nfor i in range(n-1):\r\n if l[i]-l[i+1] > max_diff:\r\n max_diff = l[i]-l[i+1]\r\nprint(max(0,max_diff-c))", "n,c=map(int,input().split())\r\nlis=list(map(int,input().split()))\r\nans=[]\r\nfor i in range(n-1):\r\n ans.append(lis[i]-lis[i+1])\r\np=max(ans)\r\nif p>c:\r\n print(p-c)\r\nelse:\r\n print(0)", "n, c = map(int, input().split())\r\nx = list(map(int, input().split()))\r\nres = 0\r\nfor i in range(n - 1):\r\n res = max(res, x[i] - x[i + 1] - c)\r\nprint(res)\r\n", "n,c=map(int,input().split())\r\nnl=list(map(int,input().split()))\r\nM=0\r\nfor i in range(n-1):\r\n diff=nl[i]-nl[i+1]\r\n if(diff>0):\r\n diff-=c\r\n if(diff>M):\r\n M=diff\r\nprint(M)\r\n ", "import math as m\r\n#from math import comb as nCr\r\nt=input\r\n'''\r\nfor _ in range(int(t())):\r\n n=int(t())\r\n a,b=map(int,t().split())\r\n a=list(map(int,t().split()))\r\n'''\r\nn,c=map(int,t().split())\r\nx=list(map(int,t().split()))\r\ns=0\r\nfor i in range(0,n-1):\r\n s=max(x[i]-x[i+1]-c,s)\r\nprint(s)", "'''input\n3 0\n1 2 3\n'''\nn, c = map(int, input().split())\np = list(map(int, input().split()))\nt = 0\nfor x in range(n-1):\n\tt = max(t, p[x] - p[x+1] - c)\nprint(t)", "if __name__ == \"__main__\":\n args = list(map(int, input().strip().split()))\n rates = list(map(int, input().strip().split()))\n maxd = 0\n for i in range(args[0]-1):\n d = rates[i] - rates[i+1]\n \n if d >= maxd:\n maxd = d\n print(str(max([0, maxd - args[1]])))\n\t \t \t\t \t \t \t \t \t \t\t\t\t\t", "days, kilos = map(int, input().split())\r\nprices = list(map(int, input().split()))\r\n\r\nprofit = 0\r\n\r\nfor i in range(days-1):\r\n profit = max(profit, prices[i] - prices[i+1] - kilos)\r\n\r\nprint(profit)\r\n", "n,c=map(int,input().split())\r\nL=[int(x) for x in input().split()]\r\nm=0\r\nval=0\r\nfor i in range(1,len(L)):\r\n if(L[i]<L[i-1]):\r\n val=L[i-1]-L[i]-c\r\n m=max(m,val)\r\nprint(m)\r\n", "# Author: SaykaT\r\n# Problem: 385A\r\n# Time Created: September 27(Sunday) 2020 || 11:03:31\r\n\r\n#>-------------------------<#\r\n\r\n#>-------------------------<#\r\n\r\n\r\n# Helper Functions. -> Don't cluster your code.\r\n\r\n\r\n# Main functions. -> Write the main solution here\r\ndef solve():\r\n n, c = map(int, input().split())\r\n ls = list(map(int, input().split()))\r\n price = []\r\n\r\n for i in range(len(ls)-1):\r\n price.append(ls[i] - ls[i+1])\r\n\r\n profit = (max(price) - c)\r\n if profit > 0:\r\n print(profit)\r\n else:\r\n print(0)\r\n\r\n# Single test cases\r\nsolve()\r\n\r\n", "n, c = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\n\r\ntotal = 0\r\nfor i in range(len(a)-1):\r\n total = max(total, a[i]-a[i+1]-c)\r\nprint(total)\r\n ", "n,c = list(map(int,input().split()))\r\n\r\nprice=list(map(int,input().split()))\r\n\r\nprofit=0\r\n\r\nfor i in range(len(price)-1):\r\n t=price[i]-price[i+1]-c\r\n \r\n if t>profit:\r\n profit=t\r\n\r\nprint(profit)", "n,c=map(int,input().split())\r\nans=0\r\nl1=list(map(int,input().split()))\r\nfor i in range(n-1):\r\n ans=max(ans,l1[i]-l1[i+1]-c)\r\nprint(ans)", "def solve(n, c, arr):\r\n mx = 0\r\n for i in range(len(arr)-1):\r\n if (arr[i] - arr[i+1] - c) > 0:\r\n mx = max(mx, arr[i] - arr[i+1] - c)\r\n \r\n return mx\r\n\r\nn, c = map(int, (input().split()))\r\narr = list(map(int, input().split()))\r\nprint(solve(n, c, arr))", "\ndef solve(n,c,arr):\n\tmx=0\n\tfor i in range(n-1) :\n\t\tmx =max(mx, arr[i]-arr[i+1]-c )\n\treturn mx\n\n\n\nfrom sys import stdin\ninput = stdin.readline\nn,c=[int(x) for x in input().split()]\nl=[int(x) for x in input().split()]\nprint(solve(n,c,l))\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, c = map(int, input().split())\r\nw = list(map(int, input().split()))\r\ns = 0\r\nfor i in range(n-1):\r\n if w[i] - w[i+1] > s:\r\n s = w[i] - w[i+1]\r\nprint(0 if s <= c else s-c)\r\n", "n, c = map(int, input().split())\r\npr = list(map(int, input().split()))\r\nmaxim = 0\r\nfor cont in range(0,n-1,1):\r\n m = pr[cont]-pr[cont+1]-c\r\n if m > maxim:\r\n maxim = m\r\nprint(maxim)", "n,c=map(int, input().split())\r\nl=list(map(int, input().split()))\r\nl1=[]\r\nfor i in range(n-1):\r\n a=l[i]-l[i+1]-c\r\n l1.append(a)\r\nif (max(l1)>0):\r\n print(max(l1))\r\nelse:\r\n print(0)\r\n\r\n", "x,y =[int(x) for x in input(\"\").split()]\r\nar= list(map(int, input(\"\").split()))\r\ndiff=[]\r\n\r\nfor i in range(len(ar)-1):\r\n di=ar[i]-ar[i+1]\r\n diff.append(di)\r\n \r\nd =diff.index(max(diff))\r\nj=ar[d]-ar[d+1]-y\r\nif(j>0):\r\n print(j)\r\nelse:\r\n print(0)\r\n", "n, c = map(int, input().split())\r\narr = [int(i) for i in input().split()]\r\ni, r = 0, 0\r\nfor i in range(n - 1):\r\n if arr[i] - arr[i + 1] - c > r:\r\n r = arr[i] - arr[i + 1] - c\r\nprint(r)\r\n", "n, c = map(int, input().split())\r\nv = 0\r\na = input().split()\r\nfor i in range(n - 1):\r\n d1, d2 = int(a[i]), int(a[i + 1])\r\n v1 = d1 - d2 - c\r\n if v1 > v:\r\n v = v1\r\nprint(v)\r\n", "n, c = map(int, input().split())\r\nprice = list(map(int, input().split()))\r\np = price[0]-price[1]-c\r\nfor i in range(1,n-1):\r\n p = max(price[i]-price[i+1]-c, p)\r\nif p<0:\r\n print('0')\r\nelse:\r\n print(p)", "R=lambda:map(int,input().split())\r\nn,r=R();p=ans=0\r\nfor i in R():ans=max(ans,p-i-r);p=i\r\nprint(ans)", "if __name__ == '__main__':\r\n\tn, c = [int(i) for i in input().split()]\r\n\tkiloDays = [int(i) for i in input().split()]\r\n\tmaxKilos = 0\r\n\r\n\tfor i in range(0, n - 1):\r\n\t\tmaxKilos = max(maxKilos, kiloDays[i] - kiloDays[i + 1] - c)\r\n\r\n\tprint(maxKilos)", "n,c = map(int,input().split())\r\narr = list(map(int,input().split())) \r\nbrr = [0]\r\nfor i in range(n-1):\r\n if arr[i] - (arr[i+1] + c) > 0:\r\n brr.append(arr[i] - arr[i+1] - c)\r\nprint(max(brr))", "data=[int(x) for x in input().split()]\r\ndays=[int(x) for x in input().split()]\r\nprofit=0\r\nanswer=[]\r\nfor i in range (data[0]-1):\r\n profit=days[i]-days[i+1]\r\n answer.append(profit)\r\n profit=0\r\nif max(answer)-data[1]<=0:\r\n print(0)\r\nelse:\r\n print(max(answer)-data[1])\r\n", "import sys, collections, math, itertools, random\r\nINF = sys.maxsize\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 = 1000000007\r\n\r\nn,c = get_ints()\r\narr = get_array()\r\npre = [None for i in range(n-1)]\r\nfor i in range(n-1):\r\n pre[i] = arr[i]-arr[i+1]\r\nans = max(pre)-c\r\nprint(ans) if ans >= 0 else print(0)", "n , c = input().split(' ')\r\nn = int(n)\r\nc = int(c)\r\n#arr = [[1,3,5,1,['2',2,3]],[1,2,3],[1,31,3]]\r\n\r\nx = [int(i) for i in input().split(' ')]\r\n#x.insert(0,0)\r\nf = False\r\nold = x[0]\r\nanswer = 0\r\nfor new in x:\r\n if (f == False):\r\n f = True\r\n answer = max(answer , old-new-c)\r\n old = new\r\nif (answer < 0):\r\n print(answer)\r\n exit(0)\r\nprint (answer)\r\n", "n, c = (int(i) for i in input().split())\ndays = [int(i) for i in input().split()]\nd1, d2 = iter(days), iter(days)\nnext(d2)\nmax_earnings = 0\nfor cost1, cost2 in zip(d1, d2):\n max_earnings = max(max_earnings, cost1 - cost2 - c)\nprint(max_earnings)\n", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\na=0\r\nfor i in range(1,n):\r\n if(l[i]-l[i-1]<0):\r\n x=l[i-1]-l[i]-m\r\n if(x>a):\r\n a=x\r\nprint(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 ", "x, y = map(int, input().split())\r\nls = list(map(int, input().split()))\r\nmax_p = 0\r\nfor i in range(len(ls) - 1) : \r\n curr_p = ls[i] - (ls[i + 1] + y)\r\n max_p = max(curr_p, max_p)\r\nprint(max_p)", "n,c=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=0\r\nfor i in range(n-1):\r\n if(l[i]>l[i+1]):\r\n x=l[i]-l[i+1]-c\r\n s=max(s,x)\r\nprint(s)", "def main():\r\n s=input()\r\n s=s.split()\r\n n=int(s[0])\r\n c=int(s[1])\r\n s=input()\r\n s=s.split()\r\n i=0\r\n ans=0\r\n while(i<len(s)-1):\r\n if((int(s[i])-int(s[i+1])-c)>ans):\r\n ans=(int(s[i])-int(s[i+1]))-c\r\n i+=1\r\n print(ans)\r\nif __name__ == '__main__':main()\r\n\r\n\r\n\r\n", "X, Max, Days = list(map(int, input().split())), 0, list(map(int, input().split()))\r\nfor i in range(X[0] - 1):\r\n Max = max(Max, Days[i] - Days[i + 1])\r\nprint(max(Max - X[1], 0))\r\n\r\n# UB_CodeForces\r\n# Advice: Never give up because the great things take time\r\n# Location: At home behind my desk next to my information retrieval notes\r\n# Caption: My puffy face because of a hit\r\n# CodeNumber: 483\r\n", "n, c = map(int,input().split())\r\n\r\nl = list(map(int,input().split()))\r\nans = 0\r\nfor i in range(n-1):\r\n ans = max(ans,l[i] - l[i+1] - c)\r\nprint(ans)", "n,c = map(int, input().split())\r\nx = list(map(int, input().split()))\r\n \r\nmax = 0\r\n \r\nfor i in range(n-1):\r\n if (x[i] - x[i+1]- c > max):\r\n max = x[i] - x[i+1]- c \r\n \r\nprint(max)\r\n", "n, c = map(int, input().split())\r\nll = list(map(int,input().split()))\r\nll1 = []\r\nfor i in range(n-1):\r\n ll1.append(ll[i] - ll[i + 1] - c)\r\nif max(ll1) <= 0:\r\n print(0)\r\nelse:\r\n print(max(ll1))\r\n\r\n", "n, c = map(int, input().split())\r\nx = list(map(int, input().split()))\r\n\r\nmax_profit = 0\r\nfor i in range(n-1):\r\n max_profit = max(max_profit, x[i] - x[i+1] - c)\r\n\r\nprint(max_profit)", "n, c = list(map(int, input().split()))\r\nprices = list(map(int, input().split()))\r\n\r\nanswers = []\r\nfor i in range(n-1):\r\n if prices[i] >= prices[i+1] + c:\r\n diff = prices[i] - (prices[i+1] + c)\r\n answers.append(diff)\r\nif answers:\r\n print(max(answers))\r\nelse:\r\n print(0)\r\n\r\n", "\r\nn, c = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nfinal = 0\r\ndiff = 0\r\nfor i in range(0, n-1):\r\n if arr[i] > arr[i+1]:\r\n diff = arr[i] - arr[i+1]\r\n if final < diff:\r\n final = diff\r\nif final <= c:\r\n print(0)\r\nelse:\r\n print(final-c)", "#Keshika Patwari\r\n#Indian Institute Of Technology, Jodhpur\r\n# 2022\r\nimport sys\r\ninput=sys.stdin.readline\r\ndef exe():\r\n lis=[]\r\n for i in range(n-1):\r\n lis.append(l[i]-l[i+1])\r\n lis.sort(reverse=True)\r\n if(lis[0]-c<=0):\r\n return 0\r\n return lis[0]-c\r\nn,c=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nprint(exe())", "n, c = map(int, input().split())\r\nbarrel = list(map(int, input().split()))\r\ni=0\r\nprofit=0\r\nwhile i<len(barrel)-1:\r\n if (barrel[i]-barrel[i+1] - c)> profit:\r\n profit = barrel[i]-barrel[i+1] -c\r\n i = i+1\r\nprint(profit)\r\n", "n, c = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nans = []\r\nfor i in range(len(arr) - 1):\r\n ans.append(arr[i] - arr[i+1] - c)\r\nfinal = max(ans)\r\nif final < 0:\r\n print(0)\r\nelse:\r\n print(final)\r\n", "n,c=map(int,input().split())\r\nd=list(map(int,input().split()))\r\nmax=0\r\nfor i in range(n-1):\r\n if(d[i]-d[i+1]>max):\r\n max=d[i]-d[i+1]\r\nmax=max-c\r\nif(max<0):\r\n print(0)\r\nelse:\r\n print(max)\r\n", "n, c = [int(x) for x in input().split()]\r\nnumbers = [int(x) for x in input().split()]\r\nprofit = 0\r\nfor i in range (0, n - 1):\r\n if numbers[i] - numbers[i + 1] - c > profit:\r\n profit = numbers[i] - numbers[i + 1] - c\r\nprint(profit)", "import sys\r\ndef main():\r\n n,c = map(int, sys.stdin.readline().strip().split())\r\n a = list(map(int, sys.stdin.readline().strip().split()))\r\n m = 0\r\n for i in range(len(a)-1):\r\n r = a[i]-a[i+1]-c\r\n m = max(m,r)\r\n print(m)\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "a=[]\r\na=input().split()\r\nn=int(a[0])\r\nc=int(a[1])\r\nx=[]\r\nx=input().split()\r\nfor i in range(0,n,1):\r\n x[i]=int(x[i])\r\n\r\nprofit=[]\r\nfor i in range(0,n-1,1):\r\n p=x[i]-x[i+1]-c\r\n if(p>0):\r\n profit.append(p)\r\n else:\r\n profit.append(0)\r\n\r\n\r\nprint(max(profit))\r\n", "def barrel_to_honey (n,c,a):\r\n biggest = 0\r\n for x in range(n-1):\r\n if a[x] - (a[x+1]+c) > biggest:\r\n biggest = a[x] - (a[x+1]+c)\r\n\r\n return biggest\r\n\r\n\r\nn,c = list(map(int,input().split()))\r\na = list(map(int,input().split()))\r\nprint (barrel_to_honey(n,c,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", "n,c = map(int,input().split())\r\nx = list(map(int,input().split()))\r\ntmpMax = 0\r\nindMax = 0\r\nfor i in range(n-1):\r\n Dif = x[i] - x[i+1]\r\n if Dif > tmpMax:\r\n tmpMax = Dif\r\n indMax = i\r\nprofit = x[indMax] - x[indMax + 1] - c\r\nif profit >= 0:\r\n print(profit)\r\nelse:\r\n print(0)", "n,c=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nres=0\r\nfor i in range(len(arr)-1):\r\n if(arr[i]>arr[i+1]+c):\r\n res=max(res,arr[i]-arr[i+1]-c)\r\n \r\nprint(res)", "n,c = list(map(int, input().split()))\r\nlst = list(map(int, input().split()))\r\nl=0\r\n\r\nfor i in range(n-1):\r\n l = max(l, lst[i]-lst[i+1]-c)\r\n \r\nprint(l)", "n,c = map(int,input().split())\r\narr = list(int(i) for i in input().split())\r\nans = 0\r\nfor i in range(n-1):\r\n k = arr[i]-(arr[i+1]+c)\r\n ans = max(k,ans)\r\nprint(ans)", "a,b = map(int, input().split())\nlista = list(map(int, input().split()))\nsoma = 0\nfor c in range(a-1):\n\tif lista[c] - lista[c+1] - b > soma:\n\t\tsoma = lista[c] - lista[c+1] - b\nprint(soma)", "n,c=map(int,input().split())\r\nlis=list(map(int,input().split()))\r\nans=0\r\nfor i in range(n-1):\r\n temp=lis[i]-lis[i+1]-c\r\n ans=max(temp,ans)\r\nprint(ans)\r\n", "n,c=map(int,input().split())\r\na=[]\r\nt=0\r\na[0:n]=map(int,input().split())\r\nfor i in range(n-1):\r\n t=max(t,a[i]-a[i+1]-c)\r\nprint(t)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n, c = map(int, input().split())\r\n\r\na = list(map(int, input().split()))\r\n\r\nres = 0\r\n\r\nfor i in range(n - 1):\r\n diff = a[i] - a[i + 1]\r\n if diff >= 0:\r\n res = max(diff, res)\r\n \r\nans = res - c\r\nif res - c < 0:\r\n print(0)\r\nelse:\r\n print(res - c)", "n,k = map(int,input().split())\r\nlst = list(map(int,input().strip().split()))[:n]\r\nlst1 = []\r\nfor i in range(n-1):\r\n A = lst[i]-lst[i+1]\r\n lst1.append(A)\r\nJ = max(lst1)\r\nif (J>=1) and (J>k):\r\n print(J-k)\r\nelse:\r\n print(0)" ]

[ "\r\nn = int(input())\r\ng = [int(i) - 1 for i in input().split()]\r\n\r\ndef solve(n, g):\r\n vertex_id = [-1]*n\r\n current_id = 0\r\n\r\n starts_a_cycle = [-1]*n\r\n cycle_vertex_sample = []\r\n start_on_cycle = []\r\n cycle_index_by_ID = []\r\n cycle_count = 0\r\n\r\n for v in range(n):\r\n if vertex_id[v] != -1: continue\r\n\r\n current_vertex = v\r\n cycle_found = False\r\n while vertex_id[current_vertex] == -1:\r\n vertex_id[current_vertex] = current_id\r\n current_vertex = g[current_vertex]\r\n\r\n if vertex_id[current_vertex] == current_id:\r\n cycle_found = True \r\n cycle_count += 1\r\n cycle_vertex_sample.append(current_vertex)\r\n start_on_cycle.append(current_vertex == v)\r\n\r\n if not cycle_found:\r\n if starts_a_cycle[current_vertex] != -1:\r\n starts_a_cycle[v] = starts_a_cycle[current_vertex]\r\n starts_a_cycle[current_vertex] = -1\r\n\r\n cycle_index_by_ID.append(cycle_index_by_ID[vertex_id[current_vertex]])\r\n\r\n cycle = cycle_index_by_ID[-1]\r\n\r\n if start_on_cycle[cycle]:\r\n starts_a_cycle[cycle_vertex_sample[cycle]] = -1\r\n start_on_cycle[cycle] = False\r\n\r\n starts_a_cycle[v] = cycle\r\n\r\n else:\r\n starts_a_cycle[v] = cycle_count - 1\r\n cycle_index_by_ID.append(cycle_count - 1)\r\n current_id += 1\r\n\r\n expanded = []\r\n for i in range(n):\r\n if starts_a_cycle[i] != -1:\r\n cycle = starts_a_cycle[i]\r\n v = cycle_vertex_sample[cycle]\r\n expanded.append([v, i])\r\n\r\n if len(expanded) == 1 and expanded[0][0] == expanded[0][1]:\r\n print(0)\r\n return\r\n \r\n print(len(expanded))\r\n for i in range(len(expanded)-1):\r\n v, u = expanded[i][0], expanded[i+1][1]\r\n print('{0} {1}'.format(v+1, u+1))\r\n print('{0} {1}'.format(expanded[-1][0] + 1, expanded[0][1] + 1))\r\n\r\nsolve(n, g)", "order = [] # Psuedo-topological ordering (we don't care about cycles)\nvisited = set()\n\nnext_id = 0\nnodes = {} # Maps from node to component id\ncomponents = [] # Maps from component id to a set of nodes\n\ndef dfs3(start, get_neighbors):\n '''\n Iterative implementation of DFS. Doing DFS with recrusion in Python seems\n to cause TLE errors a decent amount of the time\n '''\n\n q = [(start, False)]\n visited.add(start)\n\n while len(q) > 0:\n node, indicator = q.pop()\n\n if indicator:\n order.append(node)\n continue\n\n q.append((node, True))\n\n for neighbor in get_neighbors(node):\n if neighbor not in visited:\n visited.add(neighbor)\n q.append((neighbor, False))\n\ndef dfs1(start, get_neighbors):\n '''\n First round of DFS performs a reverse topological sort to order the nodes\n by decreasing time of exit\n '''\n\n visited.add(start)\n\n for neighbor in get_neighbors(start):\n if neighbor not in visited:\n dfs1(neighbor, get_neighbors)\n\n order.append(start)\n\ndef dfs2(start, get_rev_neighbors):\n '''\n Second round of DFS finds connected components in the reversed graph.\n Performing this by starting at the node with the highest exit time produces\n strongly connected components\n '''\n \n q = [start]\n nodes[start] = next_id\n components[next_id].add(start)\n\n while len(q) > 0:\n node = q.pop()\n\n for neighbor in get_rev_neighbors(node):\n if neighbor not in nodes:\n nodes[neighbor] = next_id\n components[next_id].add(neighbor)\n q.append(neighbor)\n\ndef find_components(all_nodes, get_neighbors, get_rev_neighbors):\n '''\n Note: the condensation graph is a set of acyclic graphs\n '''\n\n global next_id, order\n\n for node in all_nodes:\n if node not in visited:\n dfs3(node, get_neighbors)\n\n order = order[::-1]\n\n for node in order:\n if node not in nodes:\n components.append(set())\n\n dfs2(node, get_rev_neighbors)\n\n next_id += 1\n\n cond_graph = [[] for i in range(len(components))]\n for node in all_nodes:\n for neighbor in get_neighbors(node):\n first_comp, second_comp = nodes[node], nodes[neighbor]\n\n # If we find a node and neighbor pair in different components, then\n # we found an edge in the condensation graph\n if first_comp != second_comp:\n cond_graph[first_comp].append(second_comp)\n\n return cond_graph\n\n# Example use. This TLEs on the following, but the core algorithm should be correct\n# https://codeforces.com/contest/22/problem/E\n\ndef set_peek(s):\n val = s.pop()\n s.add(val)\n\n return val\n\nn = int(input())\n\ngraph = [None]\ngraph_rev = [[] for i in range(n + 1)]\n\nfor i, num in enumerate(map(int, input().split())):\n graph.append([num])\n graph_rev[num].append(i + 1)\n\n# Step 1: build the condensation graph to get an acyclic graph\ncond_graph = find_components(range(1, n + 1), lambda x: graph[x], lambda x: graph_rev[x])\n\n# Step 2: identify all the \"roots\" in this graph as those with no neighbors\nroots = [i for i in range(len(cond_graph)) if len(cond_graph[i]) == 0]\n\n# Step 3: reverse the condensation graph to form a tree\ncond_graph_rev = [[] for _ in range(len(cond_graph))]\n\nfor i, neighbors in enumerate(cond_graph):\n for neighbor in neighbors:\n cond_graph_rev[neighbor].append(i)\n\n# Step 4: Use DFS to find the leaves of each tree\nleaves = []\n\nfor root in roots:\n these_leaves = []\n q = [root]\n\n while len(q) > 0:\n node = q.pop()\n\n # Note that a root can be its own leaf\n if len(cond_graph_rev[node]) == 0:\n these_leaves.append(node)\n continue\n\n for neighbor in cond_graph_rev[node]:\n q.append(neighbor)\n\n leaves.append(these_leaves)\n\n# Step 5: connect each root to leaves of the next tree\nans = []\nif len(roots) >= 2:\n for i in range(len(roots)):\n root = roots[i]\n root_rep = set_peek(components[root])\n\n ls = leaves[(i + 1) % len(roots)]\n\n for l in ls:\n l_rep = set_peek(components[l])\n\n ans.append((root_rep, l_rep))\n\nelse:\n root_rep = set_peek(components[roots[0]])\n\n ls = leaves[0]\n\n for l in ls:\n if l == root: continue\n l_rep = set_peek(components[l])\n\n ans.append((root_rep, l_rep))\n\nprint(len(ans))\nfor a, b in ans:\n print(a, b)\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, m = ints()\r\ng = [[] for _ in range(n)]\r\ndeg = [0] * n\r\n\r\nfor _ in range(m):\r\n u, v = ints()\r\n u -= 1\r\n v -= 1\r\n g[u].append((v, 0))\r\n g[v].append((u, 1))\r\n deg[u] += 1\r\n\r\n\r\nres = [0] * n\r\nhp = []\r\nfor i in range(n):\r\n if deg[i] == 0: heappush(hp, -i)\r\n\r\ncnt = n\r\nwhile hp:\r\n i = -heappop(hp)\r\n res[i] = cnt\r\n for u, t in g[i]:\r\n if t == 1:\r\n deg[u] -= 1\r\n if deg[u] == 0:\r\n heappush(hp, -u)\r\n cnt -= 1\r\nprint(*res)", "from heapq import heappush, heappop\r\nq = lambda:map(int, input().split())\r\nn, m = q()\r\na = d = [0] * n\r\ne = [[] for _ in range(n)]\r\nh = []\r\nwhile(m):\r\n l, r = q()\r\n d[l - 1] += 1\r\n e[r - 1] += [l - 1]\r\n m -= 1\r\nfor i in range(n):\r\n if(d[i] == 0):\r\n heappush(h, -i)\r\nj = n\r\nwhile(h):\r\n t = -heappop(h)\r\n a[t] = j\r\n j -= 1\r\n for x in e[t]:\r\n d[x] -= 1\r\n if(d[x] == 0):\r\n heappush(h, -x)\r\nprint(''.join(str(x) + ' ' for x in a))", "from sys import stdin\r\ninput=lambda :stdin.readline()[:-1]\r\nfrom heapq import*\r\n\r\nn,m=map(int,input().split())\r\nedge=[[] for i in range(n)]\r\ncnt=[0]*n\r\nfor i in range(m):\r\n u,v=map(lambda x:int(x)-1,input().split())\r\n edge[v].append(u)\r\n cnt[u]+=1\r\n\r\nhq=[]\r\nfor i in range(n):\r\n if cnt[i]==0:\r\n heappush(hq,-i)\r\n\r\nans=[0]*n\r\ntmp=n\r\nwhile hq:\r\n v=-heappop(hq)\r\n ans[v]=tmp\r\n tmp-=1\r\n for u in edge[v]:\r\n cnt[u]-=1\r\n if cnt[u]==0:\r\n heappush(hq,-u)\r\n\r\nprint(*ans)", "from collections import defaultdict\r\nimport heapq\r\n\r\ndef minimalLabels(graph, outdegree):\r\n\r\n queue = []\r\n n = len(outdegree)\r\n\r\n label = [0] * (n) \r\n for node in range(1, n):\r\n if outdegree[node] == 0:\r\n heapq.heappush(queue, -node)\r\n\r\n rank = n - 1\r\n while queue:\r\n current = heapq.heappop(queue)\r\n label[abs(current)] = str(rank)\r\n rank -= 1\r\n for parent in graph[current]:\r\n outdegree[abs(parent)] -= 1\r\n if outdegree[abs(parent)] == 0:\r\n heapq.heappush(queue, parent)\r\n\r\n return \" \".join(label[1:]) \r\n\r\nif __name__ == \"__main__\":\r\n n, m = list(map(int, input().split()))\r\n outdegree = [0] * (n + 1)\r\n graph = defaultdict(list)\r\n for _ in range(m):\r\n edge1, edge2 = map(int, input().split())\r\n graph[-edge2].append(-edge1)\r\n outdegree[abs(edge1)] += 1\r\n print(minimalLabels(graph, outdegree))\r\n\r\n", "import heapq\r\n\r\nl = [[] for _ in range(100005)]\r\nn, m = map(int, input().split())\r\nindegree = [0] * 100005\r\nans = [0] * 100005\r\n\r\ndef topsort():\r\n cnt = 0\r\n que = []\r\n for i in range(1, n + 1):\r\n if indegree[i] == 0:\r\n heapq.heappush(que, -i)\r\n\r\n i = n\r\n while que:\r\n k = -heapq.heappop(que)\r\n ans[k] = i\r\n i -= 1\r\n cnt += 1\r\n while l[k]:\r\n top = l[k].pop(0)\r\n indegree[top] -= 1\r\n if indegree[top] == 0:\r\n heapq.heappush(que, -top)\r\n\r\nfor i in range(1, m + 1):\r\n a, b = map(int, input().split())\r\n l[b].append(a)\r\n indegree[a] += 1\r\n\r\ntopsort()\r\nfor i in range(1, n + 1):\r\n if i != n:\r\n print(ans[i], end=\" \")\r\n else:\r\n print(ans[i])\r\n", "import sys, heapq\r\ninput = iter(sys.stdin.buffer.read().decode().splitlines()).__next__\r\n\r\nn, m = map(int, input().split())\r\ng = [[] for _ in range(n + 1)]\r\nindeg = [0] * (n + 1)\r\nfor _ in range(m):\r\n u, v = map(int, input().split())\r\n g[v].append(u)\r\n indeg[u] += 1\r\n\r\nq = [-u for u in range(1, n + 1) if not indeg[u]]\r\nheapq.heapify(q)\r\nans = [0] * (n + 1)\r\ncur = n\r\nwhile q:\r\n u = -heapq.heappop(q)\r\n ans[u] = cur\r\n cur -= 1\r\n for v in g[u]:\r\n indeg[v] -= 1\r\n if not indeg[v]:\r\n heapq.heappush(q, -v)\r\nprint(*ans[1:])", "from collections import defaultdict\r\nfrom heapq import heapify, heappop, heappush\r\n\r\n\r\nvertices, edges = list(map(int, input().split()))\r\ngraph = defaultdict(set)\r\nindegree = defaultdict(int)\r\nfor _ in range(edges):\r\n pre, nxt = list(map(int, input().split()))\r\n indegree[pre] += 1\r\n graph[nxt].add(pre)\r\n\r\nlabel = [-1] * vertices\r\ncurrentLabel = vertices\r\nheap = []\r\nfor i in range(1, vertices + 1):\r\n if not indegree[i]:\r\n heappush(heap, -i)\r\n\r\nwhile heap:\r\n currentNode = -heappop(heap)\r\n label[currentNode - 1] = currentLabel\r\n currentLabel -= 1\r\n for neighbor in graph[currentNode]:\r\n indegree[neighbor] -= 1\r\n if not indegree[neighbor]:\r\n heappush(heap, -neighbor)\r\n\r\n\r\nprint(*label)\r\n", "from collections import deque\r\nfrom heapq import heappush,heappop\r\n\r\nn,m = map(int, input().split())\r\ngraph = [[] for _ in range(n)]\r\nindeg = [0]*n\r\n\r\nfor _ in range(m):\r\n a,b = map(int, input().split())\r\n a-=1\r\n b-=1\r\n graph[b].append(a)\r\n indeg[a] += 1\r\n\r\nq = []\r\nfor i in range(n):\r\n if indeg[i] == 0:\r\n heappush(q, -i)\r\n\r\ncur = n\r\nlabels = [0]*n\r\nwhile q:\r\n node = -heappop(q)\r\n labels[node] = cur\r\n cur -= 1\r\n for v in graph[node]:\r\n indeg[v] -=1\r\n if indeg[v] == 0:\r\n heappush(q, -v)\r\n\r\nprint(*labels)", "import sys\r\nimport threading\r\nfrom functools import lru_cache\r\nfrom bisect import bisect_left\r\nfrom collections import defaultdict, deque\r\nfrom heapq import *\r\n \r\ndef main():\r\n n, m = [int(i) for i in input().split()]\r\n inDegrees = [0]*n\r\n outgoing = defaultdict(set)\r\n for i in range(m):\r\n u, v = [int(i) for i in input().split()]\r\n outgoing[v-1].add(u-1)\r\n inDegrees[u-1] += 1\r\n \r\n ans = [None]*n\r\n heap = []\r\n for i in range(n):\r\n if inDegrees[i] == 0:\r\n heappush(heap, -i)\r\n label = n\r\n while heap:\r\n current = -heappop(heap)\r\n ans[current] = label\r\n for neighbor in outgoing[current]:\r\n inDegrees[neighbor] -= 1\r\n if inDegrees[neighbor] == 0:\r\n heappush(heap, -neighbor)\r\n label -= 1\r\n \r\n \r\n \r\n print(*ans)\r\n \r\nif __name__ == '__main__':\r\n sys.setrecursionlimit(1 << 30)\r\n threading.stack_size(1 << 27)\r\n \r\n main_thread = threading.Thread(target=main)\r\n main_thread.start()\r\n main_thread.join()", "\r\nimport collections\r\nimport heapq\r\n\r\ndef constructGraph(n, edges):\r\n\r\n graph = collections.defaultdict(list)\r\n inDegree = [0 for _ in range(n)]\r\n\r\n for edge in edges:\r\n a, b = edge[0]-1, edge[1]-1\r\n graph[b].append(a)\r\n inDegree[a] += 1\r\n\r\n return [graph, inDegree]\r\n\r\ndef solve(n, edges):\r\n\r\n graph, inDegree = constructGraph(n, edges)\r\n answer = [0 for _ in range(n)]\r\n pq = []\r\n\r\n for i in range(n):\r\n if inDegree[i] == 0:\r\n heapq.heappush(pq, -i)\r\n\r\n current = n\r\n while pq:\r\n currentNode = -heapq.heappop(pq)\r\n answer[currentNode] = current\r\n current -= 1\r\n\r\n if currentNode not in graph:\r\n continue\r\n\r\n for neighNode in graph[currentNode]:\r\n inDegree[neighNode] -= 1\r\n\r\n if inDegree[neighNode] == 0:\r\n heapq.heappush(pq, -neighNode)\r\n\r\n return answer\r\n\r\nn, m = map(int, input().split())\r\nedges = []\r\n\r\nfor _ in range(m):\r\n edges.append(list(map(int, input().split())))\r\n\r\nprint(*solve(n, edges), sep = ' ')\r\n", "from collections import defaultdict, deque\r\nimport heapq\r\n\r\nn, m = map(int, input().split())\r\ngraph = defaultdict(list)\r\nind = defaultdict(int)\r\nque = []\r\nheapq.heapify(que)\r\n\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n graph[b].append(a)\r\n ind[a] += 1\r\n\r\nfor i in range(1, n+1):\r\n if not ind[i]:\r\n heapq.heappush(que, -i)\r\n# print(graph)\r\n# print(que)\r\n# print(ind)\r\nans = [0 for i in range(n)]\r\ni = n\r\nwhile que:\r\n pick = -heapq.heappop(que)\r\n\r\n ans[pick-1] = i\r\n i -= 1\r\n for ch in graph[pick]:\r\n ind[ch] -= 1\r\n if not ind[ch]:\r\n heapq.heappush(que, -ch)\r\n\r\n# print(i, \"i\")\r\n# if i != n+1:\r\n# for j in range(n):\r\n# if not ans[j]:\r\n# ans[j] = i\r\n# i += 1\r\n\r\n\r\nprint(*ans)\r\n", "from heapq import heappush, heappop, heapify\n \nn, m = map(int,input().split())\nrevgraph = [[] for _ in range(n)]\noutdeg = [0] * n\nfor _ in range(m):\n a, b = map(int,input().split())\n revgraph[b - 1].append(a - 1)\n outdeg[a - 1] += 1\n \nQ = [-node for node in range(n) if outdeg[node] == 0]\nheapify(Q)\norder = []\nwhile Q:\n node = -heappop(Q)\n order.append(node)\n for neigh in revgraph[node]:\n outdeg[neigh] -= 1\n if outdeg[neigh] == 0:\n heappush(Q, -neigh)\n\nassert len(order) == n\nans = [None] * n\nfor i, j in enumerate(order[::-1]):\n ans[j] = i + 1\nprint(*ans)", "n,m=map(int,input().split())\r\nd=[0]*n\r\ne=[[] for i in range(n)]\r\nfor i in range(m):\r\n\tu,v=map(int,input().split())\r\n\tu-=1\r\n\tv-=1\r\n\td[u]+=1\r\n\te[v].append(u)\r\nfrom heapq import heappush, heappop\r\npq=[]\r\nfor i in range(n):\r\n\tif d[i]==0:\r\n\t\theappush(pq,-i)\r\nind=n\r\nans=[0]*n\r\nwhile(pq):\r\n\tu=-heappop(pq)\r\n\tans[u]=ind\r\n\tind-=1\r\n\tfor v in e[u]:\r\n\t\td[v]-=1\r\n\t\tif d[v]==0:\r\n\t\t\theappush(pq,-v)\r\nprint(' '.join(str(x) for x in ans))", "from collections import defaultdict, deque\nimport heapq\nimport sys\ninput = sys.stdin.readline\n\n############ ---- Input Functions ---- ############\ninp = sys.stdin.readline\ndef input(): return inp().strip()\ndef ii(): return int(input())\ndef mi(): return map(int, input().split())\ndef li(): return list(map(int, input().split()))\n\n\ndef solve():\n n, m = map(int, input().split())\n graph = defaultdict(list)\n indegree = [0]*n\n for _ in range(m):\n u, v = map(int, input().split())\n graph[v-1].append(u-1)\n indegree[u-1] += 1\n\n queue = []\n\n for k, v in enumerate(indegree):\n if v == 0:\n heapq.heappush(queue, -1*k)\n curr = n\n res = [0]*n\n while queue:\n node = -1*heapq.heappop(queue)\n res[node] = curr\n curr -= 1\n for ne in graph[node]:\n indegree[ne] = indegree[ne]-1\n if indegree[ne] == 0:\n heapq.heappush(queue, -1*ne)\n\n if len(res) == n:\n print(*res)\n\n\ndef main():\n solve()\n\n\nif __name__ == '__main__':\n main()\n", "from collections import defaultdict, deque\r\nfrom heapq import heappop, heappush, heapify\r\ndef solve(n, adj, outgoing):\r\n available = n\r\n ans = [i for i in range(n+1)]\r\n queue = [-i for i in range(1, n+1) if not outgoing[i]]\r\n heapify(queue)\r\n while queue:\r\n cur = abs(heappop(queue))\r\n ans[cur] = available\r\n available -= 1\r\n for nbr in adj[cur]:\r\n outgoing[nbr] -= 1\r\n if not outgoing[nbr]:\r\n heappush(queue, -nbr)\r\n return ans[1:] \r\nif __name__ == '__main__':\r\n n, m = map(int, input().split())\r\n adj = defaultdict(list)\r\n outgoing = [0]*(n+1)\r\n for _ in range(m):\r\n st, dst = map(int, input().split())\r\n adj[dst].append(st)\r\n outgoing[st] += 1\r\n print(*solve(n, adj, outgoing))", "import heapq\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\nG = [[] for _ in range(n + 1)]\r\ncnt = [0] * (n + 1)\r\nfor _ in range(m):\r\n u, v = map(int, input().split())\r\n G[v].append(u)\r\n cnt[u] += 1\r\nh = []\r\nfor i in range(1, n + 1):\r\n if not cnt[i]:\r\n heapq.heappush(h, -i)\r\nans = [0] * n\r\nfor i in range(n, 0, -1):\r\n j = -heapq.heappop(h)\r\n ans[j - 1] = i\r\n for k in G[j]:\r\n cnt[k] -= 1\r\n if not cnt[k]:\r\n heapq.heappush(h, -k)\r\nprint(*ans)", "from collections import deque\r\nimport heapq\r\n\r\nimport sys\r\nimport io, os\r\ninput = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\n\r\ndef main():\r\n n, m = map(int, input().split())\r\n rg = [[] for i in range(n)]\r\n outd = [0]*n\r\n for i in range(m):\r\n a, b = map(int, input().split())\r\n a, b = a-1, b-1\r\n rg[b].append(a)\r\n outd[a] += 1\r\n\r\n q = []\r\n for i in range(n):\r\n if outd[i] == 0:\r\n q.append(n-1-i)\r\n heapq.heapify(q)\r\n ans = [-1]*n\r\n for i in reversed(range(1, n+1)):\r\n v = heapq.heappop(q)\r\n v = n-1-v\r\n ans[v] = i\r\n for u in rg[v]:\r\n outd[u] -= 1\r\n if not outd[u]:\r\n heapq.heappush(q, n-1-u)\r\n print(*ans)\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n,m=map(int,input().split())\nd=[0]*n\ne=[[] for i in range(n)]\nfor i in range(m):\n\tu,v=map(int,input().split())\n\tu-=1\n\tv-=1\n\td[u]+=1\n\te[v].append(u)\nfrom heapq import heappush, heappop\npq=[]\nfor i in range(n):\n\tif d[i]==0:\n\t\theappush(pq,-i)\nind=n\nans=[0]*n\nwhile(pq):\n\tu=-heappop(pq)\n\tans[u]=ind\n\tind-=1\n\tfor v in e[u]:\n\t\td[v]-=1\n\t\tif d[v]==0:\n\t\t\theappush(pq,-v)\nprint(' '.join(str(x) for x in ans))\n \t \t\t \t \t \t\t \t", "from queue import Queue\r\nimport heapq\r\n\r\nn, m = input().split()\r\nn = int(n)\r\nm = int(m)\r\n\r\nf = [0] * (n + 1)\r\nsol = [0] * (n + 1)\r\nadya = [[] for _ in range(n + 1)]\r\n\r\nfor i in range(m):\r\n n1, n2 = input().split()\r\n n1 = int(n1)\r\n n2 = int(n2)\r\n adya[n2].append(n1)\r\n f[n1] += 1\r\n\r\ncola = []\r\ncnt = 0\r\n\r\nfor i in range(1, n + 1):\r\n if(f[i] == 0):\r\n heapq.heappush(cola, -1 * i)\r\n cnt += 1\r\nnum = int(n)\r\nwhile(cnt > 0):\r\n v = heapq.heappop(cola)\r\n v *= -1\r\n sol[v] = num\r\n cnt -= 1\r\n num -= 1\r\n for to in adya[v]:\r\n f[to] -= 1\r\n if(f[to] == 0):\r\n heapq.heappush(cola, -1 * to)\r\n cnt += 1\r\n\r\nstringOut = \"\"\r\nfor i in range(1, n + 1):\r\n stringOut += str(sol[i])\r\n if(i != n):\r\n stringOut += ' '\r\n \r\nprint(stringOut)", "import sys\r\nfrom heapq import heappop, heappush\r\n\r\nn, m = map(int, sys.stdin.buffer.readline().decode('utf-8').split())\r\nrev = [[] for _ in range(n)]\r\noutdeg = [0]*n\r\n\r\nfor u, v in (map(int, line.decode('utf-8').split()) for line in sys.stdin.buffer):\r\n rev[v-1].append(u-1)\r\n outdeg[u-1] += 1\r\n\r\nans = [0]*n\r\nnum = n\r\nhq = [-i for i in range(n-1, -1, -1) if outdeg[i] == 0]\r\n\r\nwhile hq:\r\n v = -heappop(hq)\r\n ans[v] = num\r\n num -= 1\r\n\r\n for dest in rev[v]:\r\n outdeg[dest] -= 1\r\n if outdeg[dest] == 0:\r\n heappush(hq, -dest)\r\n\r\n\r\nassert num == 0\r\nsys.stdout.buffer.write(' '.join(map(str, ans)).encode('utf-8'))\r\n", "from collections import defaultdict, deque\r\nfrom heapq import *\r\n\r\nn, m = map(int, input().split())\r\ngraph = defaultdict(list)\r\nindegree = {}\r\nheap = []\r\n\r\nfor _ in range(m):\r\n n1, n2 = map(int, input().split())\r\n graph[n2].append(n1)\r\n indegree[n1] = indegree.get(n1, 0) + 1\r\n\r\nfor node in range(1, n+1):\r\n if node not in indegree:\r\n heappush(heap, -node)\r\n\r\n\r\nlabels = [-1]*n\r\ncurlabel = n\r\nwhile heap:\r\n cur = -heappop(heap)\r\n labels[cur-1] = curlabel\r\n curlabel -= 1\r\n\r\n for neigh in graph[cur]:\r\n indegree[neigh] -= 1\r\n if indegree[neigh] == 0:\r\n heappush(heap, -neigh)\r\n\r\nprint(*labels)\r\n\r\n" ]

[ "arr=input().split()\r\nn=int(arr[0])\r\nk=int(arr[1])\r\narr1=list(map(int,input().split()))\r\nmx=(0,10**18)\r\nfor i in range(k):\r\n if n%arr1[i]<mx[1]:\r\n mx=(i,n%arr1[i])\r\nprint(mx[0]+1,n//arr1[mx[0]])", "n,k=[int(x) for x in input().split()]\r\ncapacities=[int(x) for x in input().split()]\r\nmods=[n%capacities[i] for i in range(k)]\r\nmin_mod=min(mods)\r\nindex=mods.index(min_mod)\r\nprint(\"{} {}\".format(index+1,n//capacities[index]))", "a,b=map(int,input().split())\nls1=list(map(int,input().split()))\nls2=[]\nfor i in range(b):\n ls2.append(a%ls1[i])\nx=ls2.index(min(ls2))\nprint(str(x+1)+\" \"+ str(a//ls1[x]))\n\n \n \n\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\nc = 0\r\nd = 0\r\nn, k = map(int, input().split())\r\nw = list(map(int, input().split()))\r\nfor i in range(k):\r\n a = w[i] * (n//w[i])\r\n if a > c:\r\n c = a\r\n d = i\r\nprint(d+1, c//w[d])\r\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=[]\r\nfor i in range(len(a)):\r\n b.append(n%a[i])\r\nmin1=min(b)\r\nind=b.index(min1)\r\nprint(ind+1,n//a[ind])", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nleft = 10 ** 18\r\nans = 0\r\nfor i in range(k):\r\n if n % a[i] < left:\r\n left = n % a[i]\r\n ans = i\r\nprint(ans + 1, n // a[ans])", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nans = 10000000000000000000000000000000000\r\nans2 = -1\r\nfor i in a:\r\n if n % i == 0:\r\n ans2 = i\r\n break\r\n else:\r\n m = n % i\r\n if m < ans:\r\n ans = m\r\n ans2 = i\r\nprint(a.index(ans2) + 1, n//ans2)", "[n,k]=map(int,input().split())\r\na=list(map(int,input().split()))\r\nl=[]\r\nfor i in a:\r\n l.append(i*(n//i))\r\nprint(str(l.index(max(l))+1)+' '+str(n//int(a[l.index(max(l))])))", "import sys\r\n\r\nn, k = map(int , input().split())\r\nkinds = list(map(int, input().split()))\r\n\r\nmaxHamsters = -sys.maxsize\r\nindex = 0\r\nmovingBoxes = 0\r\n\r\nfor i in range(len(kinds)):\r\n boxes = n // kinds[i]\r\n movingHamsters = boxes * kinds[i]\r\n\r\n if movingHamsters > maxHamsters:\r\n maxHamsters = movingHamsters\r\n movingBoxes = boxes\r\n index = i + 1\r\n\r\nprint(index, movingBoxes)", "n,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\nm = 10**18\r\nl = [-1,-1]\r\nfor i in range(k):\r\n if (n%a[i])<m:\r\n m = (n%a[i])\r\n l = [i+1,n//a[i]]\r\nprint(*l)", "k , n = map(int , input().split())\r\nr = lambda : list(map(int, input().split()))\r\narr = r()\r\nx = float('inf')\r\n\r\nfor pos , i in enumerate(arr):\r\n if (k % i) < x:\r\n x = k%i\r\n ans = pos\r\n\r\n\r\n\r\nprint(ans+1 , k//arr[ans])", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\n\r\nres=False\r\nt,ans=1,(n//l[0])\r\nfor i in range(1,k):\r\n if l[i]<=n:\r\n res=True\r\n x,y=i+1,(n//l[i])\r\n if(l[x-1]*y)>(l[t-1]*ans):\r\n t,ans=x,y\r\nif res or (l[0]<=n):\r\n print(t,ans)\r\nelse:\r\n print(1,0)", "n, k = map(int, input().split())\r\n\r\nboxes = [int(box) for box in input().split() if int(box)]\r\nlst = []\r\nfor box in boxes:\r\n lst.append(n%box)\r\nprint(lst.index(min(lst))+1, n//boxes[lst.index(min(lst))])\r\n\r\n\r\n", "n,o=map(int, input().split())\r\nl=[int(x) for x in input().split()]\r\nindex=0\r\nmin_left=-1\r\nboxes=0\r\nfor i in range(o):\r\n m=n%l[i]\r\n if min_left>m or min_left==-1:\r\n min_left=m\r\n index=i\r\n boxes=n//l[i]\r\nprint(index+1,boxes)\r\n \r\n\r\n \r\n", "sum_rat,n_cage=input().split()\nsum_rat=int(sum_rat)\nn_cage=int(n_cage)\nsize_cage=input().split(\" \")\nkt=0\nks=sum_rat//int(size_cage[0])\nfor i in range(len(size_cage)):\n if sum_rat%int(size_cage[i])<sum_rat%int(size_cage[kt]):\n kt=i\n ks=sum_rat//int(size_cage[i])\nprint(kt+1,ks)\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\nl=list(map(int,(input().split())))\r\nrem=n%l[0]\r\nquo=n//l[0]\r\nno=0\r\nn1=1\r\nfor i in l:\r\n no+=1\r\n if(rem>n%i):\r\n rem=n%i\r\n n1=no\r\n quo=n//i\r\nprint(n1,quo)", "n, k = [int(i) for i in input().split()]\r\np = input()\r\nlist=p.split()\r\nlist2=[]\r\nfor i in list:\r\n list2.append(n%int(i))\r\nind=list2.index(min(list2))+1\r\nprint(ind,n//int(list[ind-1]))", "I=lambda:map(int,input().split())\r\nn,k=I()\r\na=*I(),\r\nr=min(range(k),key=lambda x:n%a[x])\r\nprint(r+1,n//a[r])\r\n", "k, n = [int(i) for i in input().split()]\r\n\r\na = [int(i) for i in input().split()]\r\nbest_id = 1\r\nbest_r = k % a[0]\r\n\r\nfor i in range(1, n):\r\n if k % a[i] < best_r:\r\n best_r = k % a[i]\r\n best_id = i + 1\r\n\r\nprint(best_id, k // a[best_id - 1])\r\n ", "hamster, box_kind = list(map(int, input().split()))\r\nbox_capacity = list(map(int, input().split()))\r\nhamster_left = float('inf')\r\nfor i in range(box_kind):\r\n hl = hamster % box_capacity[i]\r\n if hl < hamster_left:\r\n box_type = i + 1\r\n num_of_box = hamster // box_capacity[i]\r\n hamster_left = hl\r\nprint(box_type, num_of_box)", "n , k = list(map(int , input().split()))\r\na = list(map(int , input().split()))\r\n\r\nres = []\r\n\r\nfor el in a : \r\n r = n // el \r\n res.append(r * el)\r\n\r\n\r\nprint(str(res.index(max(res))+1) + ' ' + str(n // a[res.index(max(res))]))", "rd = lambda: map(int, input().split())\r\nn, k = rd()\r\np, q = min(enumerate(rd()), key=lambda x: n % x[1])\r\nprint(p + 1, n // q)", "n,k=map(int,input().split())\r\nbox_size=list(map(int,input().split()))\r\nmod_box=[]\r\nfor i in range(k):\r\n mod_box.append(n%box_size[i])\r\nindex= mod_box.index(min(mod_box)) \r\nprint(index+1,n//box_size[index]) \r\n", "\r\nimport math\r\ndef main():\r\n n, k = (int(i) for i in input().split())\r\n # print(n, k)\r\n capacities = [int(i) for i in input().split()]\r\n # print(capacities)\r\n type_index = 1\r\n how_many = 0\r\n minimum = math.inf\r\n for i in range(k):\r\n if n % capacities[i] < minimum:\r\n minimum = n % capacities[i]\r\n type_index = i\r\n how_many = (n-(n % capacities[type_index])) // capacities[type_index]\r\n print(type_index+1, how_many)\r\n\r\n\r\n\r\nif __name__==\"__main__\":\r\n main()", "R=lambda: list(map(int,input().split(\" \")))\r\n# n=int(input())\r\nn,k=R()\r\nl=R()\r\nx=[]\r\nif n>0:\r\n for i in range(k):\r\n x.append(n%l[i])\r\n res=x.index(min(x))\r\n print(str(res+1),str(n//l[res]))\r\nelse: print(\"1 0\")", "'''\r\n19 3\r\n5 4 10\r\n\r\n'''\r\nn,k=list(map(int,input().split()))\r\nl=list(map(int, input().split()))\r\ntypes,no=0,0\r\nres=[]\r\nfor each in l:\r\n res.append(n%each)\r\nans=res.index(min(res))\r\nprint(ans+1)\r\nprint(n//l[ans])\r\n\r\n \r\n\r\n", "n,k=map(int,input().split())\r\nlis=[int(x) for x in input().split()]\r\nans=9999999999999999999\r\nval=-1\r\nfor i in range(k):\r\n if n%lis[i]<ans:\r\n ans=n%lis[i]\r\n val=i+1 \r\nprint(val,n//lis[val-1])", "# Rating: 1000, Problem 939 B\n\nn, k = [int(i) for i in input().strip().split()]\nboxes = [int(capacity) for capacity in input().strip().split()]\n\nbest_box = [0, n % boxes[0] , n // boxes[0]] # index of best box, number of hamsters left, quantity of box to buy\n\nfor i in range(1, k):\n num_left = n % boxes[i]\n if num_left < best_box[1]:\n best_box = [i, num_left, n // boxes[i]]\n\nprint(str(best_box[0]+1) + \" \" + str(best_box[2]))\n\n", "import sys,os,io\r\n# input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn,k = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\ncnt = 0\r\ntt = 1\r\nfor i in range (k):\r\n m = n//a[i]\r\n curr = m*a[i]\r\n if cnt<curr:\r\n cnt = curr\r\n tt = i+1\r\nprint(tt, n//a[tt-1])", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nt=0\r\nb=0\r\nr=n+1\r\nfor i in range(k):\r\n if(n%a[i]<r):\r\n r=n%a[i]\r\n t=i+1\r\n b=n//a[i]\r\n if(r==0):\r\n break\r\nprint(t,b)\r\n \r\n", "import sys\r\nreadline = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(readline()))\r\ndef inlt():\r\n return(list(map(int, readline().split())))\r\ndef insr():\r\n s = readline()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int, readline().split()))\r\n\r\nfirst = inlt()\r\nh, b = first\r\nk = inlt()\r\n\r\nsr = float('inf')\r\n\r\nans_b = 0\r\nans_n = 0\r\nfor i, v in enumerate(k):\r\n r = h % v\r\n if r < sr:\r\n ans_b = i\r\n sr = r\r\n\r\nans_n = h // k[ans_b]\r\n\r\nprint(ans_b + 1, ans_n)", "n,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\nli = set()\r\nfor i in range(k):\r\n li.add((n%a[i],i))\r\nkey,value = min(li,key = lambda x:(x[0]))\r\nprint(value+1,n//a[value])\r\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nf=[]\r\nfor i in range(k):\r\n f.append(n%a[i])\r\nprint(f.index(min(f))+1,n//a[f.index(min(f))])", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nrem=n%l[0]\r\nind=1\r\nfor i in range(1,k):\r\n if n%l[i]<rem:\r\n rem=n%l[i]\r\n ind=i+1\r\nprint(ind,n//l[ind-1])", "n, k = list(map(int, input().split()))\na = list(map(int, input().split()))\n\nr = []\nm = 10**18\nans = 0\nci = -1\nfor i in range(k):\n\tt = n%a[i]\n\tif t < m:\n\t\tans = n//a[i]\n\t\tm = t\n\t\tci = i\n\nprint(f'{ci + 1} {ans}')", "x, y=map(int, input().split())\r\na=list(map(int, input().split()))\r\nk=1000000000000000002\r\nn=-1\r\nfor i in range (y):\r\n if x%a[i]<k:\r\n k=x%a[i]\r\n n=i\r\nprint(n+1, x//a[n])\r\n#n=int(input())\r\n#print((n-1)//2)\r\n \r\n \r\n \r\n\r\n", "n, k = map(int, input().split())\r\narr = input().split()\r\nminRem, pos, amt = n % int(arr[0]), 1, n//int(arr[0])\r\nfor i,ele in enumerate(arr, 1):\r\n val = n % int(ele)\r\n if val < minRem: minRem, pos, amt = val, i, n//int(ele)\r\n\r\nprint(pos, amt)\r\n", "N,k=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nbrr=[N%i for i in arr]\r\nprint(brr.index(min(brr))+1,(N//(arr[brr.index(min(brr))])))", "\n\nn, k = map(int, input().split())\na = [int(x) for x in input().split()]\n\nq = 1e18 + 1\nfor i, x in enumerate(a, start=1):\n calc = n % x\n if q > calc: \n q = calc\n ans = i\n\n\nprint(ans, n//a[ans-1])\n", "n,k = map(int,input().split())\r\nli = list(map(int,input().split()))\r\nli1 = [n%i for i in li]\r\na = li1.index(min(li1))\r\nprint(a+1,n//li[a])", "n,k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nans = 0\r\nrem = n\r\ntype = 1\r\nfor i in range(len(a)):\r\n if rem>n%a[i]:\r\n rem = n%a[i]\r\n ans = n//a[i]\r\n type = i+1\r\nprint(type, ans)", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nl=[]\r\nfor x in a:\r\n l.append(n%x)\r\np=l.index(min(l)) + 1\r\nprint(p,n//a[p-1])\r\n\r\n", "def solution():\r\n line = input().split()\r\n N, K = int(line[0]), int(line[1])\r\n line = input().split()\r\n As = [int(x) for x in line]\r\n index = -1\r\n remainder = float(\"inf\")\r\n count = -1\r\n for i, ai in enumerate(As):\r\n new_remainder = N % ai\r\n if new_remainder < remainder:\r\n remainder = new_remainder\r\n index = i + 1\r\n count = N // ai\r\n\r\n print(index, count)\r\n\r\nif __name__ == '__main__':\r\n solution()", "n,k=map(int,(input().split()))\r\n\r\na=list(map(int, input().split()))\r\n\r\nb=[n%x for x in a]\r\n\r\nx=b.index(min(b))\r\n\r\nprint(x+1,n//a[x])\r\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nz=0\r\nz_=n//a[0]\r\nfor i in range(1,k):\r\n if n%a[i]<n%a[z]:\r\n z=i\r\n z_=n//a[z]\r\nprint(z+1,z_)", "homa, k = map(int, input().split())\r\ntype_k = tuple(map(int, input().split()))\r\n\r\nif min(type_k) > homa or not homa:\r\n print (1, 0)\r\nelif homa in type_k:\r\n print (type_k.index(homa) + 1, 1)\r\nelif 1 in type_k:\r\n print (type_k.index(1) + 1, homa)\r\nelse:\r\n slv = dict()\r\n max_2 = min(type_k)\r\n for_ind = type_k.index(max_2) + 1\r\n for i, v in enumerate(type_k):\r\n if v > homa:\r\n continue\r\n elif v > homa//2:\r\n if v > max_2:\r\n max_2 = v\r\n for_ind = i+1\r\n else:\r\n slv[v] = i+1\r\n \r\n slv[max_2] = for_ind\r\n amn, ost = divmod(homa, max_2)\r\n num = max_2\r\n \r\n for j in slv.keys():\r\n if not ost:\r\n break\r\n t1, t2 = divmod(homa, j)\r\n if t2 < ost:\r\n amn, ost, num = t1, t2, j\r\n \r\n print (slv[num], amn)", "n, k = [int(i) for i in input().split()]\r\nl = [int(i) for i in input().split()]\r\n\r\nremain = n % l[0]\r\npos = 1\r\nvalue = n // l[0]\r\n\r\nfor i in range(1,len(l)):\r\n r = n % l[i]\r\n if r < remain:\r\n remain = r\r\n pos = i + 1\r\n value = n // l[i]\r\n\r\nprint(pos, value)\r\n \r\n", "#Hamster Farm\r\nn,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\na,b=0,n%l[0]\r\nfor i in range(1,k):\r\n r=n%l[i]\r\n if r<b:\r\n b=r\r\n a=i\r\nprint(a+1,n//l[a])\r\n \r\n", "if __name__==\"__main__\":\r\n n,k=map(int,input().split())\r\n a=list(map(int,input().split()))\r\n min=n%a[0]\r\n ind=1\r\n b=n//a[0]\r\n for i in range(k):\r\n if n%a[i]<min:\r\n min=n%a[i]\r\n b=n//a[i]\r\n ind=i+1\r\n print(ind,b)\r\n", "n, k = map(int, input().split())\r\nkinds = list(map(int, input().split()))\r\nids, current = 0, n % kinds[0]\r\n\r\nfor i in range(k):\r\n val = n % kinds[i]\r\n if val < current:\r\n current = val\r\n ids = i\r\n\r\nprint(ids + 1, n // (kinds[ids]))\r\n", "N,K=list(map(int,input().split(\" \")))\r\nboxes=list(map(int,input().split(\" \")))\r\nboxnum=1\r\nminbox=N//boxes[0]\r\nhamleft=N%boxes[0]\r\nfor i in range(len(boxes)):\r\n if(N%boxes[i]<hamleft):\r\n boxnum=i+1\r\n minbox=N//boxes[i]\r\n hamleft=N%boxes[i]\r\nprint(str(boxnum)+\" \"+str(minbox))\r\n \r\n", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl1=[]\r\nfor i in range(len(l)):\r\n l1.append(n%l[i])\r\nt=l1.index(min(l1))\r\nprint(t+1,end=\" \")\r\nprint(n//l[t])\r\n", "n, k = map(int, input().split())\r\nh = [int(_) for _ in input().split()]\r\nbox_type=0\r\nmax_box_count=0\r\nfor i in range(k):\r\n full=n//(h[i])\r\n ost=n-(h[i]*full)\r\n if ost<(n-(h[box_type]*max_box_count)):\r\n box_type=i\r\n max_box_count=full\r\nprint(box_type+1,max_box_count)", "from math import floor\r\nn,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nm=max(a)\r\nt=0\r\nfor i in range(k):\r\n if(m>n%a[i]):\r\n m=n%a[i]\r\n t=i\r\nprint(t+1,n//a[t])", "import math\n\nn, k = map(int, input().split())\nc = list(map(int, input().split()))\n\nmxi = 0\nmxv = n\n\nfor i in range(k):\n if n%c[i] < mxv:\n mxv = n%c[i]\n mxi = i\n\nif c[mxi] * math.floor(n/c[mxi]) > n:\n print(mxi+1, math.floor(n/c[mxi])-1)\nelse:\n print(mxi+1, math.floor(n/c[mxi]))", "from collections import defaultdict\r\nimport sys\r\ndef input(): return sys.stdin.readline().strip()\r\ndef iinput(): return int(input())\r\ndef minput(): return map(int, input().split()) \r\ndef listinput(): return list(map(int, input().split()))\r\nn,k=minput()\r\na=listinput()\r\np=[\" \" for _ in range(k)]\r\nfor i in range(k):\r\n p[i]=(n//a[i])*a[i]\r\nprint(p.index(max(p))+1,n//a[p.index(max(p))])", "def I(): return map(int, input().split())\r\n\r\n\r\nn, k = I()\r\na = *I(),\r\nr = min(range(k), key=lambda x: n % a[x])\r\nprint(r+1, n//a[r])\r\n", "n,k=map(int,input().split())\r\n\r\na=[int(i) for i in (input().split())]\r\n\r\n\r\nans=n%a[0]\r\ninx=0\r\nfor i,item in enumerate(a):\r\n ans=min(n%item,ans)\r\n if ans==n%item:\r\n inx=i\r\n\r\nprint(inx+1)\r\nprint(n//a[inx])\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\nrd = lambda: map(int, input().split())\r\nn, k = rd()\r\np, q = min(enumerate(rd()), key=lambda x: n % x[1])\r\nprint(p + 1, n // q)", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nmax_total = -1\r\nmaxAmnt = 0\r\nindex = 0\r\n\r\nfor i in range(len(a)):\r\n local_ans = (n // a[i])\r\n closest_value = local_ans * a[i]\r\n if closest_value > max_total:\r\n max_total = closest_value\r\n maxAmnt = local_ans\r\n index = i+1\r\n\r\nprint(index, maxAmnt) ", "# LUOGU_RID: 101738676\nn, k, *a = map(int, open(0).read().split())\r\np = min(range(k), key=lambda x: n % a[x])\r\nprint(p + 1, n // a[p])\r\n", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nans=1000011111111111111111111111111111111111111111111111\r\nfor i in range (len(l)):\r\n ans=min(ans,n%l[i])\r\n if ans == n%l[i]:\r\n c,d=i+1,n//l[i]\r\nprint(c,d)\r\n", "import math\r\nn,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nmi=100000000000000000000\r\nfor i in range(k):\r\n boxes = n//a[i]\r\n rem=n%a[i]\r\n if(mi>rem):\r\n mi=rem\r\n t=i+1\r\n \r\n\r\nprint(t,n//a[t-1])", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-26 14:10:05\nLastEditTime: 2021-11-26 14:17:58\nDescription: Hamster Farm\nFilePath: CF939B.py\n'''\n\n\ndef func():\n n, k = map(int, input().strip().split())\n boxes = list(map(int, input().strip().split()))\n minimum = n\n index, number = 0, 0\n for i in range(k):\n div, mod = divmod(n, boxes[i])\n if mod < minimum:\n minimum = mod\n index, number = i, div\n print(index + 1, number)\n\n\nif __name__ == '__main__':\n func()\n", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl2=list(map(lambda x:n%x,l))\r\ni=l2.index(min(l2))\r\nprint(i+1,end=\" \")\r\nprint(n//l[i])\r\n", "n,k = map(int, input().split())\r\nl = list(map(lambda x: [n%int(x),n//int(x)], input().split()))\r\nprint(l.index(min(l))+1, l[l.index(min(l))][1])", "n,k=list(map(int,input().split()))\r\nlist1=list(map(int,input().split()))\r\nlist2=[]\r\nlist3=[]\r\nfor i in list1:\r\n list2+=[n%i]\r\n list3+=[n//i]\r\na=list2.index(min(list2))\r\nprint(a+1,list3[a])", "n,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\nx = n % a[0]\r\ntyp = 0\r\nfor i in range(1,k):\r\n temp = n % a[i]\r\n if(temp < x ):\r\n typ = i\r\n x = temp\r\n\r\nprint(typ+1,(n-x)//a[typ])\r\n", "i=lambda:map(int,input().split())\r\nn,k=i()\r\na=*i(),\r\nr=min(range(k),key=lambda x:n%a[x])\r\nprint(r+1,n//a[r])", "hams, types = map(int,input().split())\r\nboxes = list(map(int,input().split()))\r\nlist1 = []\r\nfor i in boxes:\r\n list1.append(hams%i)\r\nimp = list1.index(min(list1))\r\nprint(imp+1,hams//(boxes[imp]))" ]

[ "#10_2.py\r\nm, n, k = map(int,input().split())\r\nc = [[0]*(n+1) for i in range(m+1)]\r\ncolor = [[0]*(n+1) for i in range(m+1)]\r\ndx = [-1,-1,0,0]\r\ndy = [-1,0,-1,0]\r\nflag = False\r\nfor cnt in range(k):\r\n i, j = map(int,input().split())\r\n if flag:\r\n continue\r\n if c[i][j]:\r\n continue\r\n c[i][j] = 1\r\n for l in range(4):\r\n ii = i + dx[l]\r\n jj = j + dy[l]\r\n color[ii][jj] += 1\r\n if color[ii][jj] == 4:\r\n print(cnt+1)\r\n flag = True\r\n break\r\nif flag == False:\r\n print(0)\r\n ", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Oct 18 20:42:05 2023\r\n\r\n@author: 2300011376\r\n\"\"\"\r\nimport sys\r\n#n*m i*j\r\n# white for 0 ,black for 1\r\nn,m,k=map(int,input().split())\r\nk_0=int(k)\r\np=[[0]*(m+2) for _ in range(n+2)]\r\nwhile True:\r\n k-=1\r\n if k==-1:\r\n print('0')\r\n break\r\n i,j=map(int,input().split())\r\n p[i][j]=1\r\n for u in [-1,1]:\r\n for v in [-1,1]:\r\n a=p[i+u][j+v]+p[i+u][j]+p[i][j+v]\r\n if a==3:\r\n print(k_0-k)\r\n sys.exit()", "n, m, k = map(int, input().split())\r\nmatrix = [[0]*(m + 2) for _ in range(n + 2)]\r\ndef check(i,j):\r\n if matrix[i-1][j-1] and matrix[i-1][j] and matrix[i][j-1]:\r\n return True\r\n if matrix[i-1][j] and matrix[i-1][j+1] and matrix[i][j+1]:\r\n return True\r\n if matrix[i][j-1] and matrix[i+1][j-1] and matrix[i+1][j]:\r\n return True\r\n if matrix[i][j+1] and matrix[i+1][j] and matrix[i+1][j+1]:\r\n return True\r\n return False\r\nfor s in range(k):\r\n i, j = map(int, input().split())\r\n matrix[i][j] = 1\r\n if check(i, j):\r\n print(s + 1)\r\n break\r\nelse:\r\n print(0)", "def check(a, x, y):\r\n if a[x-1][y-1]+a[x-1][y]+a[x][y-1] == 3 or a[x+1][y-1]+a[x+1][y]+a[x][y-1] == 3:\r\n return True\r\n elif a[x+1][y+1]+a[x+1][y]+a[x][y+1] == 3 or a[x-1][y+1]+a[x-1][y]+a[x][y+1] == 3:\r\n return True\r\n else:\r\n return False\r\n\r\n\r\nn, m, k = map(int, input().split())\r\nans = True\r\nchess = [[0 for i in range(m+2)] for j in range(n+2)]\r\nfor i in range(k):\r\n b, c = map(int, input().split())\r\n chess[b][c] = 1\r\n if check(chess, b, c):\r\n print(i+1)\r\n ans = False\r\n break\r\nif ans:\r\n print(0)", "n,m,k=map(int,input().split())\r\nmat=[[0]*(m+2) for i in range(n+2)]\r\nfor i in range(1,k+1):\r\n x,y=map(int,input().split())\r\n mat[x][y]=1\r\n if i>=4:\r\n a=1+mat[x-1][y-1]+mat[x-1][y]+mat[x][y-1]\r\n b=1+mat[x-1][y]+mat[x-1][y+1]+mat[x][y+1]\r\n c=1+mat[x][y-1]+mat[x+1][y-1]+mat[x+1][y]\r\n d=1+mat[x][y+1]+mat[x+1][y]+mat[x+1][y+1]\r\n l=[a,b,c,d]\r\n if 4 in l:\r\n print(i)\r\n break\r\nelse:\r\n print(0)", "def check(x, y, rec):\r\n if rec[x][y] and rec[x+1][y] and rec[x][y+1] and rec[x+1][y+1]:\r\n return True\r\n if rec[x][y] and rec[x-1][y] and rec[x][y-1] and rec[x-1][y-1]:\r\n return True\r\n if rec[x][y] and rec[x-1][y] and rec[x][y+1] and rec[x-1][y+1]:\r\n return True\r\n if rec[x][y] and rec[x+1][y] and rec[x][y-1] and rec[x+1][y-1]:\r\n return True\r\n else:\r\n return False\r\n \r\nn, m, k = map(int,input().split())\r\nrec = [[0 for h in range(m+2)] for j in range(n+2)]\r\nfor i in range(k):\r\n move_row, move_col = map(int, input().split())\r\n rec[move_row][move_col] = 1\r\n ans = check(move_row, move_col, rec)\r\n if ans:\r\n print(i+1)\r\n break\r\nelse:\r\n print(0)", "# LUOGU_RID: 93460695\nimport sys\nn,m,k=list(map(int,input().split()))\na=[]\nfor i in range(n+2):\n a.append([])\n for j in range(m+2):\n a[i].append(0)\nfor i in range(1,k+1):\n x,y=input().split()\n x=int(x);y=int(y)\n a[x][y]=1\n if a[x-1][y-1]+a[x][y-1]+a[x-1][y]==3 or a[x-1][y]+a[x-1][y+1]+a[x][y+1]==3 or a[x][y-1]+a[x+1][y-1]+a[x+1][y]==3 or a[x][y+1]+a[x+1][y]+a[x+1][y+1]==3:\n print(i)\n sys.exit(0)\nprint(0)", "#周家恒 化学与分子工程学院 2023年秋\r\nn,m,k=map(int,input().split())\r\naa=[]\r\nfor i in range(0,n):\r\n aa.append(m*[0])\r\n#print(aa)\r\nr=0\r\nfor i in range(0,k):\r\n t,p=map(int,input().split())\r\n aa[t-1][p-1]=1\r\n #print(aa)\r\n if t!=1 and p!=1:\r\n if aa[t - 2][p - 2] + aa[t - 1][p - 2] + aa[t - 2][p - 1] == 3:\r\n r = i + 1\r\n break\r\n if t!=n and p!=m:\r\n if aa[t][p] + aa[t - 1][p] + aa[t][p - 1] == 3:\r\n r = i + 1\r\n break\r\n if t!=1 and p!=m:\r\n if aa[t-2][p]+aa[t-1][p]+aa[t-2][p-1]==3:\r\n r = i + 1\r\n break\r\n if t!=n and p!=1:\r\n if aa[t][p - 2] + aa[t - 1][p - 2] + aa[t][p - 1] == 3:\r\n r=i+1\r\n break\r\nprint(r)\r\n", "# 读取输入\r\nn, m, k = map(int, input().split())\r\nblack_cells = set()\r\n\r\n# 用于检查是否形成 2x2 黑色方块的函数\r\ndef check_for_black_square(x, y):\r\n return ((x, y) in black_cells and\r\n (x+1, y) in black_cells and\r\n (x, y+1) in black_cells and\r\n (x+1, y+1) in black_cells)\r\n\r\n# 用于检查当前操作是否导致形成黑色方块的函数\r\ndef check_move(i, j):\r\n for x in range(i-1, i+2):\r\n for y in range(j-1, j+2):\r\n if check_for_black_square(x, y):\r\n return True\r\n return False\r\n\r\nfor move in range(1, k + 1):\r\n i, j = map(int, input().split())\r\n black_cells.add((i, j)) # 标记当前像素为黑色\r\n\r\n if check_move(i, j):\r\n print(move) # 如果当前操作导致形成黑色方块，输出操作次数\r\n break\r\nelse:\r\n print(0) # 没有形成黑色方块，输出0\r\n", "n,m,k=map(int,input().split())\r\nmatrix=[[0]*(m+2) for _ in range(n+2)]\r\n#method2:创建矩阵\r\n#import numpy as np\r\n#matrix=np.zeros((n,m))\r\nfor i in range(k):\r\n row,column=map(int,input().split())\r\n matrix[row][column]+=1\r\n a=matrix[row-1][column-1]!=0 and matrix[row][column-1]!=0 and matrix[row-1][column]!=0\r\n b=matrix[row+1][column-1]!=0 and matrix[row][column-1]!=0 and matrix[row+1][column]!=0\r\n c=matrix[row-1][column+1]!=0 and matrix[row-1][column]!=0 and matrix[row][column+1]!=0\r\n d=matrix[row+1][column+1]!=0 and matrix[row+1][column]!=0 and matrix[row][column+1]!=0\r\n if a or b or c or d:\r\n print(i+1)\r\n break\r\nelse:\r\n print('0')", "n,m,k=map(int,input().split())\r\nif n==1 or m==1:\r\n for j in range(k):\r\n hang,lie=map(int,input().split())\r\n print(0)\r\nelse:\r\n l1=[]\r\n for i in range(m+2):\r\n l1.append([False]*(n+2))\r\n for j in range(k):\r\n hang,lie=map(int,input().split())\r\n l1[lie][hang]=True\r\n if j >=3:\r\n if l1[lie][hang+1]:\r\n if l1[lie-1][hang] and l1[lie-1][hang+1]:\r\n print(j+1)\r\n break\r\n if l1[lie+1][hang] and l1[lie+1][hang+1]:\r\n print(j+1)\r\n break\r\n if l1[lie][hang-1]:\r\n if l1[lie-1][hang] and l1[lie-1][hang-1]:\r\n print(j+1)\r\n break\r\n if l1[lie+1][hang] and l1[lie+1][hang-1]:\r\n print(j+1)\r\n break\r\n if j==k-1:\r\n print(0)", "n,m,k = map(int,input().split())\r\nlst = [[False for i in range(m+2)] for i in range(n+2)]\r\nstep = 0\r\nfor i in range(k):\r\n step += 1\r\n x,y = map(int,input().split())\r\n lst[x][y] = True\r\n if all([lst[x][y],lst[x][y+1],lst[x+1][y],lst[x+1][y+1]])\\\r\n or all([lst[x][y],lst[x][y-1],lst[x+1][y],lst[x+1][y-1]])\\\r\n or all([lst[x][y],lst[x][y-1],lst[x-1][y-1],lst[x-1][y]])\\\r\n or all([lst[x][y],lst[x][y+1],lst[x-1][y],lst[x-1][y+1]]):\r\n print(step)\r\n break\r\nelse:\r\n print(0)\r\n ", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Oct 17 23:17:29 2023\r\n\r\n@author: 2300011794\r\n\"\"\"\r\n\r\nn,m,k=map(int,input().split())\r\nrec=[]\r\nflag=-1\r\nfor i in range (n+2):\r\n rec.append([])\r\n for j in range (m+2):\r\n rec[i].append(0)\r\nfor i in range (k):\r\n x,y=map(int,input().split())\r\n if n+m<4:\r\n flag=0\r\n if flag!=-1:\r\n continue\r\n rec[x][y]=1\r\n if rec[x-1][y-1]+rec[x-1][y]+rec[x][y-1]+rec[x][y]==4 or rec[x+1][y-1]+rec[x+1][y]+rec[x][y-1]+rec[x][y]==4 or rec[x-1][y+1]+rec[x-1][y]+rec[x][y+1]+rec[x][y]==4 or rec[x+1][y+1]+rec[x+1][y]+rec[x][y+1]+rec[x][y]==4:\r\n flag=i+1\r\n continue\r\nif flag==-1:\r\n flag=0\r\nprint(flag)", "def fun(a,i,j,n,m):\r\n i-=1\r\n j-=1\r\n n-=1\r\n m-=1\r\n if i>=1 and j>=1:\r\n if a[i-1][j-1]==1 and a[i-1][j]==1 and a[i][j-1]==1 and a[i][j]==1:return True\r\n if i>=1 and j<=m-1:\r\n if a[i-1][j]==1 and a[i-1][j+1]==1 and a[i][j+1]==1 and a[i][j]==1:return True\r\n if i<=n-1 and j<=m-1:\r\n if a[i][j]==1 and a[i][j+1]==1 and a[i+1][j+1]==1 and a[i+1][j]==1:return True\r\n if i<=n-1 and j>=1:\r\n if a[i][j-1]==1 and a[i][j]==1 and a[i+1][j]==1 and a[i+1][j-1]==1:return True\r\n return False\r\nn,m,k=map(int,input().split())\r\na=[[0 for r in range(m)] for y in range(n)]\r\nans=f=0\r\nfor z in range(1,k+1):\r\n i,j=map(int,input().split())\r\n a[i-1][j-1]=1\r\n if fun(a,i,j,n,m):\r\n if f==0:\r\n ans=z\r\n f=1\r\nprint(ans)", "def blacksqr(field, y, x):\r\n if field[y - 1][x - 1] + field[y - 1][x] + field[y][x - 1] + field[y][x] == 4:\r\n return True\r\n if field[y - 1][x] + field[y - 1][x + 1] + field[y][x] + field[y][x + 1] == 4:\r\n return True\r\n if field[y][x - 1] + field[y][x] + field[y + 1][x - 1] + field[y + 1][x] == 4:\r\n return True\r\n if field[y][x] + field[y][x + 1] + field[y + 1][x] + field[y + 1][x + 1] == 4:\r\n return True\r\n return False\r\n\r\nn, m, k = [int(i) for i in input().split()]\r\nfield = [[0] * (m + 2) for y in range(n + 2)]\r\n\r\nlose = 0\r\nfor j in range(k):\r\n y, x = map(int, input().split())\r\n field[y][x] = 1\r\n if blacksqr(field, y, x):\r\n lose = j + 1\r\n break\r\nprint(lose)", "import copy\r\nn,m,k=input().split()\r\nn=int(n);m=int(m);k=int(k)\r\nl=[]\r\na=[]\r\nfor g in range(m+2):\r\n\ta.append(0)\r\nfor g in range(n+2):\r\n\tl.append(copy.deepcopy(a))\r\ng=0\r\nh=[]\r\nwhile g<=k-1:\r\n\ti,j=input().split()\r\n\ti=int(i);j=int(j)\r\n\tif l[i][j+1]==l[i-1][j]==l[i-1][j+1]==1 or l[i][j-1]==l[i+1][j]==l[i+1][j-1]==1 or l[i][j+1]==l[i+1][j]==l[i+1][j+1]==1 or l[i][j-1]==l[i-1][j]==l[i-1][j-1]==1:\r\n\t\th.append(g+1)\r\n\t\tbreak\r\n\telse:\r\n\t\tl[i][j]=1\r\n\t\tg=g+1\r\n\t\tcontinue\r\nif g==k and len(h)==0:\r\n\tprint(0)\r\nelse:\r\n\tprint(h[0])", "n,m,step=input().split()\r\nn,m,step=int(n),int(m),int(step)\r\npixel=[[0]*(m+2) for _ in range(n+2)]#被0包围的阵\r\n#pixel=[[0]*(m+1)]*(n+1)就不行，因为这样n+1个列表会同时改变\r\nflag=False\r\ndef check(n1,m1):\r\n global flag\r\n if pixel[n1][m1]+pixel[n1][m1+1]+pixel[n1+1][m1]+pixel[n1+1][m1+1]==4 or\\\r\n pixel[n1][m1]+pixel[n1][m1-1]+pixel[n1-1][m1]+pixel[n1-1][m1-1]==4 or\\\r\n pixel[n1][m1]+pixel[n1][m1-1]+pixel[n1+1][m1]+pixel[n1+1][m1-1]==4 or\\\r\n pixel[n1][m1]+pixel[n1][m1+1]+pixel[n1-1][m1]+pixel[n1-1][m1+1]==4:\r\n flag=True\r\n return\r\nimport sys\r\nfor i in range(1,step+1):\r\n n1,m1=input().split()\r\n n1,m1=int(n1),int(m1)\r\n pixel[n1][m1]=1\r\n check(n1,m1)\r\n if flag==True:\r\n print(i)\r\n sys.exit(0)\r\nprint(0)", "#输入 加保护圈\r\nn,m,k=map(int,input().split())\r\na=[[0]*(m+2) for _ in range(n+2)]\r\n#定义运算\r\ndef check(i,j):\r\n if a[i-1][j-1] and a[i-1][j] and a[i][j-1]:\r\n return 1 \r\n if a[i][j-1] and a[i+1][j] and a[i+1][j-1]:\r\n return 1 \r\n if a[i-1][j] and a[i-1][j+1] and a[i][j+1]:\r\n return 1 \r\n if a[i][j+1] and a[i+1][j] and a[i+1][j+1]:\r\n return 1 \r\n return 0\r\n#运算，需要注意的是输出结果为_+1而非_\r\nfor _ in range(k):\r\n p,q=map(int,input().split())\r\n a[p][q]=1\r\n if check(p,q):\r\n print(_+1)\r\n break #否则输出会多出一个0\r\nelse:\r\n print(0)", "n,m,k = map(int,input().split())\r\nmatrix = []\r\nfor i in range(0,n):\r\n matrix.append([])\r\n for j in range(0,m):\r\n matrix[i].append(0)\r\nfor i in range(1,k+1):\r\n a,b = map(int,input().split())\r\n if matrix[a-1][b-1]==0:\r\n matrix[a-1][b-1] = i\r\nnumber = set()\r\nfor i in range(0,n-1):\r\n for j in range(0,m-1):\r\n if matrix[i][j]!=0 and matrix[i][j+1]!=0 and matrix[i+1][j]!=0 and matrix[i+1][j+1]!=0:\r\n number.add(max(matrix[i][j],matrix[i][j+1],matrix[i+1][j],matrix[i+1][j+1]))\r\nif len(number)==0:\r\n print(\"0\")\r\nelse:\r\n print(min(number))", "n,m,k=map(int,input().split())\r\nlines=[[0 for j in range(m+2)] for i in range(n+2)]\r\nfor _ in range(k):\r\n i,j=map(int,input().split())\r\n lines[i][j]=1\r\n if (lines[i-1][j]==1 and lines[i][j-1]==1 and lines[i-1][j-1]==1) or (lines[i-1][j]==1 and lines[i][j+1]==1 and lines[i-1][j+1]==1) or (lines[i+1][j]==1 and lines[i][j-1]==1 and lines[i+1][j-1]==1) or (lines[i+1][j]==1 and lines[i][j+1]==1 and lines[i+1][j+1]==1):\r\n print(_+1)\r\n break\r\nelse:\r\n print(0)\r\n", "read = list(map(int, input().split()))\r\nn, m, k = read[0], read[1], read[2]\r\n\r\npixels = [[False] * (m + 2) for row in range(n + 2)]\r\nfor i in range(k):\r\n read = list(map(int, input().split()))\r\n x, y = read[0], read[1]\r\n pixels[x][y] = True\r\n if pixels[x - 1][y] == pixels[x][y - 1] == pixels[x - 1][y - 1] == True:\r\n print(i + 1)\r\n break\r\n elif pixels[x - 1][y] == pixels[x][y + 1] == pixels[x - 1][y + 1] == True:\r\n print(i + 1)\r\n break\r\n elif pixels[x + 1][y] == pixels[x][y - 1] == pixels[x + 1][y - 1] == True:\r\n print(i + 1)\r\n break\r\n elif pixels[x + 1][y] == pixels[x][y + 1] == pixels[x + 1][y + 1] == True:\r\n print(i + 1)\r\n break\r\n elif i == k - 1:\r\n print(0)", "n, m, k = map(int, input().split())\r\nsteps = []\r\nfor i in range(k):\r\n steps.append(list(map(int, input().split())))\r\nf = [[0 for _ in range(m + 3)] for _ in range(n + 3)]\r\ndef check(f, i, j):\r\n w = [[-1, -1], [-1, 0], [0, -1], [0, 0]]\r\n for k in w:\r\n if f[i + 1 + k[0]][j + 1 + k[1]] and f[i + 1 + k[0] + 1][j + 1 + k[1]] and f[i + 1 + k[0]][j + 1 + k[1] + 1] and f[i + 1 + k[0] + 1][j + 1 + k[1] + 1]:\r\n return 1\r\n else:\r\n return 0\r\nfor i, j in enumerate(steps):\r\n f[j[0] + 1][j[1] + 1] = 1\r\n if check(f, j[0], j[1]):\r\n print(i + 1)\r\n break \r\nelse:\r\n print(0)", "from itertools import product\r\nfrom sys import exit\r\nn, m, k = map(int, input().split())\r\ngraph = [[1]*(m+2) for i in range(n+2)]\r\nfor w in range(k):\r\n i, j = map(int, input().split())\r\n graph[i][j] = 0\r\n if any([not any(graph[u][v] for u, v in product([x, x+1], [y, y+1])) for x, y in product([i-1, i], [j-1, j])]):\r\n print(w + 1)\r\n exit(0)\r\nprint(0)", "#508A: pasha and pixels\r\ndef lose(m,i,j):\r\n if m[i-1][j-1]*m[i-1][j]* m[i][j-1]*m[i][j]==1:\r\n return True\r\n elif m[i-1][j]*m[i-1][j+1]*m[i][j+1]*m[i][j]==1:\r\n return True\r\n elif m[i][j-1]*m[i+1][j-1]*m[i+1][j]*m[i][j]==1:\r\n return True\r\n elif m[i+1][j]*m[i+1][j+1]*m[i][j+1]*m[i][j]==1:\r\n return True\r\n else:\r\n return False\r\nn,m,k=map(int,input().split())#rows,columns,moves\r\nmatrix=[[0]*(m+2) for _ in range(n+2)]\r\n#多设两行可以巧妙解决index out of range的问题，且输入的a,b不需要进一步操作\r\nmove=0\r\nfor p in range(k):\r\n a,b=map(int,input().split())\r\n matrix[a][b]=1#turn black\r\n if lose(matrix,a,b)==True:\r\n move=p+1\r\n break\r\nprint(move)", "row, col, n = map(int,input().split())\r\nl = [[0 for _ in range(col)] for _ in range(row)]\r\nfor k in range(n):\r\n x,y = map(int,input().split())\r\n l[x-1][y-1] = 1\r\n i,j = x-1, y-1\r\n try:\r\n assert i-1 >= 0\r\n if l[i-1][j] == l[i][j+1] == l[i-1][j+1] == 1:\r\n print(k+1)\r\n quit()\r\n except Exception: pass\r\n try:\r\n assert i-1 >= 0 and j-1 >= 0\r\n if l[i-1][j] == l[i][j-1] == l[i-1][j-1] == 1:\r\n print(k+1)\r\n quit()\r\n except Exception: pass\r\n try:\r\n assert j-1 >= 0\r\n if l[i+1][j] == l[i][j-1] == l[i+1][j-1] == 1:\r\n print(k+1)\r\n quit()\r\n except Exception: pass\r\n try:\r\n if l[i+1][j] == l[i][j+1] == l[i+1][j+1] == 1:\r\n print(k+1)\r\n quit()\r\n except Exception: pass\r\nprint(0)", "def zuoshang(l,i,j):\r\n if l[i][j]+l[i-1][j-1]+l[i-1][j]+l[i][j-1]==4:\r\n return True\r\n else:\r\n return False\r\ndef youshang(l,i,j):\r\n if l[i][j]+l[i-1][j+1]+l[i-1][j]+l[i][j+1]==4:\r\n return True\r\n else:\r\n return False\r\ndef zuoxia(l,i,j):\r\n if l[i][j]+l[i+1][j-1]+l[i+1][j]+l[i][j-1]==4:\r\n return True\r\n else:\r\n return False\r\ndef youxia(l,i,j):\r\n if l[i][j]+l[i+1][j+1]+l[i+1][j]+l[i][j+1]==4:\r\n return True\r\n else:\r\n return False\r\nn,m,k=map(int,input().split())\r\ncol=[0]*(m+2)\r\nmat=[]\r\nfor i in range(n+2):\r\n mat.append(col[:])\r\nflag=k\r\nfor step in range(k):\r\n i,j=map(int,input().split())\r\n mat[i][j]=1\r\n if zuoshang(mat,i,j) or youshang(mat,i,j) or zuoxia(mat,i,j) or youxia(mat,i,j):\r\n print(step+1)\r\n break\r\n else:\r\n flag-=1\r\nif flag==0:\r\n print(0)\r\n", "n,m,k = [int(x) for x in input().split()]\r\nmtx = []\r\nfor r in range(n+2):\r\n mtx.append([0 for i in range(m+2)])\r\nfor x in range(1,k+1):\r\n i,j = map(int,input().split())\r\n mtx[i][j] = 1\r\n if mtx[i-1][j-1] + mtx[i-1][j] + mtx[i][j-1] + mtx[i][j] == 4 or mtx[i-1][j+1] + mtx[i-1][j] + mtx[i][j+1] + mtx[i][j] == 4 or mtx[i+1][j+1] + mtx[i+1][j] + mtx[i][j+1] + mtx[i][j] == 4 or mtx[i+1][j-1] + mtx[i+1][j] + mtx[i][j-1] + mtx[i][j] == 4:\r\n print(x)\r\n break\r\n elif x == k:\r\n print(0)\r\n else:\r\n continue", "def check(b,r,c):\r\n if b[r-1][c-1]+b[r-1][c]+b[r][c-1] == 3:\r\n return True\r\n elif b[r-1][c+1]+b[r-1][c]+b[r][c+1] == 3:\r\n return True\r\n elif b[r+1][c-1]+b[r+1][c]+b[r][c-1] == 3:\r\n return True\r\n elif b[r+1][c+1]+b[r+1][c]+b[r][c+1] == 3:\r\n return True\r\n else:\r\n return False\r\n \r\nn,m,k = map(int,input().split(' '))\r\nb = [[0]*(m+2) for _ in range(n+2)]\r\nfor i in range(k):\r\n r,c = map(int,input().split(' '))\r\n if check(b, r, c):\r\n print(i+1)\r\n break\r\n b[r][c] = 1\r\nelse:\r\n print(0)", "x_m,y_m,n = map(int,input().split())\r\nmatrix = []\r\nfor i in range(x_m):\r\n matrix.append([0]*y_m)\r\ndef check(x,y):\r\n x_low = x_up = y_low =y_up = False\r\n if y < y_m and matrix[x-1][y] == 1:\r\n y_up = True\r\n if y >= 2 and matrix[x-1][y-2] == 1:\r\n y_low = True\r\n if x < x_m and matrix[x][y-1] == 1:\r\n x_up = True\r\n if x >= 2 and matrix[x-2][y-1] == 1:\r\n x_low = True\r\n if (y_low and x_low and matrix[x-2][y-2] == 1) or (y_low and x_up and matrix[x][y-2] == 1) or (y_up and x_low and matrix[x-2][y] == 1) or (y_up and x_up and matrix[x][y] == 1):\r\n ans = True\r\n else:\r\n ans = False\r\n return ans\r\nwin = True\r\nfor i in range(1,n+1):\r\n x,y = map(int,input().split())\r\n matrix[x-1][y-1] = 1\r\n if i >= 4 and check(x,y):\r\n print(i)\r\n win = False\r\n break\r\nif win:\r\n print(0)", "M = []\r\n\r\n\r\ndef check(i, j):\r\n global M\r\n if M[i+1][j] and M[i][j+1] and M[i+1][j+1]:\r\n return True\r\n elif M[i-1][j] and M[i][j+1] and M[i-1][j+1]:\r\n return True\r\n elif M[i-1][j] and M[i][j-1] and M[i-1][j-1]:\r\n return True\r\n elif M[i+1][j] and M[i][j-1] and M[i+1][j-1]:\r\n return True\r\n else:\r\n return False\r\n\r\n\r\nans = 0\r\nn, m, k = map(int, input().split())\r\nfor i in range(n+2):\r\n M.append([False]*(m+2))\r\nfor _ in range(k):\r\n x, y = map(int, input().split())\r\n if ans != 0:\r\n continue\r\n elif check(x, y):\r\n ans = _+1\r\n else:\r\n M[x][y] = True\r\nprint(ans)\r\n", "#2300011786\r\nn,m,k=map(int,input().split())\r\nN=1024\r\ng=[[0]*N for _ in range(N)]\r\n\r\ndef T(r,c):\r\n return g[r][c] and g[r+1][c] and g[r][c+1] and g[r+1][c+1]\r\n \r\n \r\nfor i in range(k):\r\n r,c=map(int,input().split())\r\n g[r][c]=1\r\n if T(r-1,c-1) or T(r-1,c) or T(r,c-1) or T(r,c):\r\n print(i+1)\r\n break\r\nelse:\r\n print(0)", "n,m,k = map(int,input().split())\r\nmtrx = [(m+2)*[0]for i in range(n+2)]\r\n\r\ndef integer(i,j):\r\n if mtrx[i+1][j] and mtrx[i][j+1] and mtrx[i+1][j+1]:\r\n return True\r\n if mtrx[i-1][j] and mtrx[i][j-1] and mtrx[i-1][j-1]:\r\n return True\r\n if mtrx[i-1][j] and mtrx[i-1][j+1] and mtrx[i][j+1]:\r\n return True\r\n if mtrx[i][j-1] and mtrx[i+1][j] and mtrx[i+1][j-1]:\r\n return True\r\n return False\r\n\r\nfor i in range(k):\r\n x,y = map(int,input().split())\r\n mtrx[x][y] = 1\r\n if integer(x,y):\r\n print(i+1)\r\n break\r\nelse:\r\n print(0)", "'''\r\nCF508A: Pasha and Pixels\r\n'''\r\ndef islose(sheet, i, j):\r\n steps = [(1,1), (1,-1), (-1,1), (-1,-1)]\r\n for step in steps:\r\n if sheet[i+step[0]][j+step[1]] == sheet[i][j+step[1]] == sheet[i+step[0]][j] == 1:\r\n return True\r\n return False\r\n\r\n\r\nn, m, k = map(int, input().split())\r\nsheet = [[0 for x in range(m+2)] for x in range(n+2)]\r\nlost = False\r\nfor _ in range(k):\r\n i, j = map(int, input().split())\r\n sheet[i][j] = 1 #i定行，j定列\r\n if islose(sheet, i, j):\r\n print(_+1)\r\n lost = True\r\n break\r\n \r\nif not lost:\r\n print(0)", "n,m,k=map(int,input().split())\r\ns=[]\r\nfor i in range(n+2):\r\n s.append([0]+[0]*m+[0])\r\n\r\nfor K in range(1,k+1):\r\n i,j=map(int,input().split())\r\n s[i][j]=1\r\n if s[i][j-1]==1 and s[i-1][j]==1 and s[i-1][j-1]==1:\r\n print(K)\r\n break\r\n elif s[i][j+1]==1 and s[i-1][j]==1 and s[i-1][j+1]==1:\r\n print(K)\r\n break\r\n elif s[i][j-1]==1 and s[i+1][j]==1 and s[i+1][j-1]==1:\r\n print(K)\r\n break\r\n elif s[i][j+1]==1 and s[i+1][j]==1 and s[i+1][j+1]==1:\r\n print(K)\r\n break\r\n \r\n if K==k:\r\n print(0)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Oct 24 14:15:33 2023\r\n\r\n@author: ZHAO XUDI\r\n\"\"\"\r\n\r\n# Function to check if a 2x2 black square is formed\r\ndef check_square(matrix, i, j):\r\n try:\r\n if matrix[i][j] == matrix[i+1][j] == matrix[i][j+1] == matrix[i+1][j+1] == 1:\r\n return True\r\n except IndexError:\r\n return False\r\n return False\r\n\r\nn, m, k = map(int, input().split())\r\n\r\ngrid = [[0 for _ in range(m)] for _ in range(n)]\r\n\r\nfirst_square_move = 0\r\n\r\nfor move in range(k):\r\n i, j = map(int, input().split())\r\n \r\n grid[i-1][j-1] = 1\r\n \r\n if first_square_move == 0:\r\n for x in range(max(0, i-2), min(n, i+1)):\r\n for y in range(max(0, j-2), min(m, j+1)):\r\n if check_square(grid, x, y):\r\n first_square_move = move+1 # Storing the move when a square is formed\r\n break\r\n if first_square_move != 0:\r\n break\r\n\r\nprint(first_square_move)\r\n\r\n\r\n\r\n\r\n\r\n", "n,m,k = map(int,input().split())\r\nli = [[0]*(m+2) for _ in range(n+2)]\r\nfor i in range(1,k+1): # 让步数从一开始\r\n r,c = map(int,input().split())\r\n li[r][c] = 1\r\n if li[r+1][c]+li[r][c]+li[r][c+1]+li[r+1][c+1] == 4 or\\\r\n li[r+1][c-1]+li[r][c]+li[r][c-1]+li[r+1][c] == 4 or\\\r\n li[r-1][c-1]+li[r][c]+li[r][c-1]+li[r-1][c] == 4 or\\\r\n li[r-1][c+1]+li[r][c]+li[r][c+1]+li[r-1][c] == 4:\r\n print(i)\r\n break\r\nelse:\r\n print(0)", "def check(l:list,n:int,m:int,x:int,y:int)->bool:\r\n for i in range(x-1,x+1):\r\n for j in range(y-1,y+1):\r\n if [l[i][j],l[i][j+1],l[i+1][j],l[i+1][j+1]]==[1,1,1,1]:\r\n return True\r\n return False\r\n\r\nn,m,k=map(int,input().split())\r\nmx=[[0 for i in range(m+2)] for j in range(n+2)]\r\nfor i in range(k):\r\n x,y=map(int,input().split())\r\n if mx[x][y]==1:\r\n continue\r\n else: \r\n mx[x][y]=1\r\n if check(mx,n,m,x,y):\r\n print(i+1)\r\n break\r\nelse:\r\n print(0)", "def inside_and_black(x, y):\n return 1 <= x <= n and 1 <= y <= m and a[x][y]\n\n\ndef check(x, y):\n mx, my = [1, 1, 0], [0, 1, 1]\n for sx in range(-1, 2, 2):\n for sy in range(-1, 2, 2):\n flag = 1\n for i in range(3):\n flag *= inside_and_black(x + mx[i] * sx, y + my[i] * sy)\n if (flag):\n return 1\n return 0\n\n\nn, m, k = list(map(int, input().split()))\na = [[0 for _ in range(m + 1)] for _ in range(n + 1)]\nans = 0\nfor i in range(k):\n x, y = list(map(int, input().split()))\n a[x][y] = 1\n if (check(x, y)):\n ans = i + 1\n break\nprint(ans)\n", "n,m,k=map(int,input().split())\r\np=[[0]*(m+2) for i in range(n+2)]\r\nfor t in range(k):\r\n i,j=map(int,input().split())\r\n p[i][j]=1\r\n if p[i-1][j-1]==p[i-1][j]==p[i][j-1]==1 or p[i-1][j]==p[i-1][j+1]==p[i][j+1]==1 or p[i][j-1]==p[i+1][j]==p[i+1][j-1]==1 or p[i][j+1]==p[i+1][j]==p[i+1][j+1]==1:\r\n print(t+1)\r\n break\r\nelse:\r\n print(0)", "map_list = []\r\ninput_list = input().split()\r\nn, m, k = int(input_list[0]), int(input_list[1]), int(input_list[2])\r\nfor i in range(0, n):\r\n map_list.append([])\r\n for j in range(0, m):\r\n map_list[i].append(0)\r\n\r\ndef calculate_function(x, y):\r\n return map_list[x][y] + map_list[x + 1][y] + map_list[x][y + 1] + map_list[x + 1][y + 1]\r\n\r\nif n == 1 or m == 1:\r\n print(0)\r\nelse:\r\n print_zero = True\r\n for i in range(0, k):\r\n input_list = input().split()\r\n x = int(input_list[0]) - 1\r\n y = int(input_list[1]) - 1\r\n map_list[x][y] = 1\r\n break_or_not = False\r\n if x > 0 and y > 0:\r\n sum_num = calculate_function(x - 1, y - 1)\r\n if sum_num == 4:\r\n break_or_not = True\r\n if x < n - 1 and y < m - 1:\r\n sum_num = calculate_function(x, y)\r\n if sum_num == 4:\r\n break_or_not = True\r\n if x > 0 and y < m - 1:\r\n sum_num = calculate_function(x - 1, y)\r\n if sum_num == 4:\r\n break_or_not = True\r\n if x < n - 1 and y > 0:\r\n sum_num = calculate_function(x, y - 1)\r\n if sum_num == 4:\r\n break_or_not = True\r\n\r\n if break_or_not:\r\n print(i + 1)\r\n print_zero = False\r\n break\r\n\r\n if print_zero:\r\n print(0)", "n, m, k = map(int, input().split())\r\nmatrix = [[0 for o in range(m+2)] for p in range(n+2)]\r\nfor w in range(k):\r\n a, b = map(int, input().split())\r\n matrix[a][b] = 1\r\n if matrix[a+1][b] == 1 and matrix[a][b+1] == 1 and matrix[a+1][b+1] == 1:\r\n print(w+1)\r\n break\r\n elif matrix[a][b-1] == 1 and matrix[a+1][b] == 1 and matrix[a+1][b-1] == 1:\r\n print(w+1)\r\n break\r\n elif matrix[a-1][b] == 1 and matrix[a][b+1] == 1 and matrix[a-1][b+1] == 1:\r\n print(w+1)\r\n break\r\n elif matrix[a-1][b] == 1 and matrix[a][b-1] == 1 and matrix[a-1][b-1] == 1:\r\n print(w+1)\r\n break\r\nelse:\r\n print(0)", "from collections import deque\r\nn, m, k = map(int,input().split())\r\nmoves = deque()\r\nfor _ in range(k): moves.append(tuple(map(int,input().split())))\r\nboard = [None]*(n+2)\r\nfor i in range(n+2): board[i] = [0]*(m+2)\r\nfor t in range(1,k+1):\r\n y, x = moves.popleft()\r\n board[y][x] = 1\r\n lu = board[y-1][x-1] + board[y-1][x] + board[y][x-1] + board[y][x]\r\n ld = board[y+1][x-1] + board[y+1][x] + board[y][x-1] + board[y][x]\r\n rd = board[y+1][x+1] + board[y+1][x] + board[y][x+1] + board[y][x]\r\n ru = board[y-1][x+1] + board[y-1][x] + board[y][x+1] + board[y][x]\r\n if 4 in [lu,ld,ru,rd]:\r\n print(t)\r\n break\r\nelse:\r\n print(0)", "n,m,k=map(int,input().split())#rows,columns,moves\r\ninitial_matrix=[[0 for j in range(m+2)] for i in range(n+2)]\r\nmoves=0\r\nfor move in range(1,k+1):\r\n i,j=map(int,input().split())\r\n initial_matrix[i][j]=1\r\n square_ul=initial_matrix[i-1][j-1]+initial_matrix[i-1][j]+\\\r\n initial_matrix[i][j-1]+initial_matrix[i][j]\r\n square_ur=initial_matrix[i-1][j+1]+initial_matrix[i-1][j]+\\\r\n initial_matrix[i][j+1]+initial_matrix[i][j]\r\n square_ll=initial_matrix[i+1][j-1]+initial_matrix[i+1][j]+\\\r\n initial_matrix[i][j-1]+initial_matrix[i][j]\r\n square_lr=initial_matrix[i+1][j+1]+initial_matrix[i+1][j]+\\\r\n initial_matrix[i][j+1]+initial_matrix[i][j]\r\n if square_ll==4 or square_lr==4 or square_ul==4 or square_ur==4:\r\n moves=move\r\n break\r\nprint(moves)", "def f(i,j,A):\r\n b= A[i - 1][j - 1] + A[i][j-1]+A[i-1][j]+A[i][j]\r\n return b\r\n\r\nn,m,k=map(int,input().split())\r\nA=[0]*(n+2)\r\nfor i in range(n+2):\r\n A[i]=[0]*(m+2)\r\nx=0\r\nfor a in range(k):\r\n i,j=map(int,input().split())\r\n A[i][j]=1\r\n if f(i,j,A)==4 or f(i+1,j,A)==4 or f(i,j+1,A)==4 or f(i+1,j+1,A)==4:\r\n print(a+1)\r\n x=1\r\n break\r\nif x==0:\r\n print(0)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Nov 9 14:16:20 2022\r\n\r\n@author: thinkpad\r\n\"\"\"\r\n\r\nn,m,k = map(int,input().split())\r\nmatrix = []\r\nfor _ in range(n+2):\r\n matrix.append([0 for _ in range(m+2)])\r\ndef text(matrix,i,j):\r\n me = matrix[i][j]\r\n ul,u,ur,l,r,dl,d,dr = matrix[i-1][j-1],matrix[i-1][j],matrix[i-1][j+1],matrix[i][j-1],matrix[i][j+1],matrix[i+1][j-1],matrix[i+1][j],matrix[i+1][j+1]\r\n if ul+u+l+me==4:\r\n return True\r\n elif u+ur+me+r==4:\r\n return True\r\n elif l+me+dl+d==4:\r\n return True\r\n elif me+r+d+dr==4:\r\n return True\r\n else:\r\n return False\r\n\r\nflag = False\r\nc=0\r\nwhile not flag and c<k:\r\n i,j = map(int,input().split())\r\n matrix[i][j]=1\r\n flag = text(matrix,i,j)\r\n c+=1\r\nif flag == True:\r\n print(c)\r\nelse:\r\n print(0)\r\n \r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Nov 9 23:18:16 2022\r\n\r\n@author: Lemon_Sherry\r\n\"\"\"\r\n\r\nn,m,k = [int(l) for l in input().split()]\r\nmat = [[0 for i in range(m + 1)] for j in range(n + 1)]\r\ns = 0\r\nfor i in range(k):\r\n x,y = [(int(l) - 1) for l in input().split()]\r\n mat[x][y] = 1\r\n a = mat[x - 1][y] + mat[x - 1][y - 1] + mat[x][y - 1]\r\n b = mat[x - 1][y] + mat[x - 1][y + 1] + mat[x][y + 1]\r\n c = mat[x + 1][y] + mat[x + 1][y - 1] + mat[x][y - 1]\r\n d = mat[x + 1][y] + mat[x + 1][y + 1] + mat[x][y + 1]\r\n if a == 3 or b == 3 or c == 3 or d == 3:\r\n print(i + 1)\r\n s += 1\r\n break\r\nif s == 0:\r\n \r\n print(0)", "# NTFS: nwi\r\nn, m, k = map(int, input().split())\r\nflag = 0\r\nd = set()\r\nfor i in range(k):\r\n x, y = map(int, input().split())\r\n d.add((x, y))\r\n for j in [-1, 0]:\r\n for k in [-1, 0]:\r\n if all((x + j + a, y + k + b) in d for a in [0, 1] for b in [0, 1]):\r\n if not flag:\r\n print(i + 1)\r\n flag = 1\r\nif not flag:\r\n print(0)", "n,m,k=map(int,input().split())\r\nmatrix=[(m+2)*[0] for i in range(n+2)]\r\n\r\ndef square_check(i,j):\r\n if matrix[i][j+1] and matrix[i+1][j] and matrix[i+1][j+1]:\r\n return True\r\n if matrix[i][j-1] and matrix[i+1][j] and matrix[i+1][j-1]:\r\n return True\r\n if matrix[i-1][j] and matrix[i][j+1] and matrix[i-1][j+1]:\r\n return True\r\n if matrix[i][j-1] and matrix[i-1][j] and matrix[i-1][j-1]:\r\n return True\r\n return False\r\n\r\nfor i in range(k):\r\n x,y=map(int,input().split())\r\n matrix[x][y]=1\r\n if square_check(x,y):\r\n print(i+1)\r\n break\r\nelse:\r\n print(0)", "n,m,k=map(int,input().split())\r\ns=[[0]*(m+2) for _ in range(n+2)]\r\ndef black(i,j):\r\n if s[i][j+1] and s[i+1][j] and s[i+1][j+1]:\r\n return 1\r\n if s[i][j-1] and s[i-1][j] and s[i-1][j-1]:\r\n return 1\r\n if s[i][j-1] and s[i+1][j] and s[i+1][j-1]:\r\n return 1\r\n if s[i][j+1] and s[i-1][j] and s[i-1][j+1]:\r\n return 1\r\n return 0\r\nfor o in range(k):\r\n i,j=map(int,input().split())\r\n s[i][j]=1\r\n if black(i,j):\r\n print(o+1)\r\n break\r\nelse:print(0)", "n,m,k=map(int,input().split())\r\nmat=[]\r\nf1=[]\r\nfor i in range(0,1002):\r\n\tl=[]\r\n\tl1=[]\r\n\tfor j in range(0,1002):\r\n\t\tl.append(0)\r\n\t\tl1.append(0)\r\n\tmat.append(l)\r\n\tf1.append(l1)\r\nans=0\r\nfor i in range(0,k):\r\n\ta,b=map(int,input().split())\r\n\tif f1[a][b]==1:\r\n\t\tcontinue\r\n\tf1[a][b]=1\r\n\tf=0\r\n\tif a-1>=1 and b-1>=1:\r\n\t\tmat[a-1][b-1]+=1\r\n\t\tif mat[a-1][b-1]==4:\r\n\t\t\tf=1\r\n\tif a-1>=1:\r\n\t\tmat[a-1][b]+=1\r\n\t\tif mat[a-1][b]==4:\r\n\t\t\tf=1\r\n\tif b-1>=1:\r\n\t\tmat[a][b-1]+=1\r\n\t\tif mat[a][b-1]==4:\r\n\t\t\tf=1\r\n\tmat[a][b]+=1\r\n\tif mat[a][b]==4:\r\n\t\tf=1\r\n\tif f and ans==0:\r\n\t\tans=i+1\r\nprint(ans)\r\n", "n,m,k=map(int,input().split())\r\nmatrix = [[0] * (m + 2) for _ in range(n + 2)]\r\nt=1\r\njudge=False\r\nwhile t<k+1:\r\n i,j=map(int,input().split())\r\n matrix[i][j]+=1\r\n if judge==False:\r\n if matrix[i-1][j]!=0 and matrix[i-1][j-1]!=0 and matrix[i][j-1]!=0:\r\n print(t)\r\n judge=True\r\n elif matrix[i-1][j]!=0 and matrix[i-1][j+1]!=0 and matrix[i][j+1]!=0:\r\n print(t)\r\n judge=True\r\n elif matrix[i+1][j]!=0 and matrix[i+1][j-1]!=0 and matrix[i][j-1]!=0:\r\n print(t)\r\n judge=True\r\n elif matrix[i+1][j]!=0 and matrix[i+1][j+1]!=0 and matrix[i][j+1]!=0:\r\n print(t)\r\n judge=True\r\n t+=1\r\nif judge==False:\r\n print(0)", "n, m, k = map(int, input().split())\r\nmatrix = [[0]*(m+2) for _ in range(n+2)]\r\n# print(matrix)\r\nend_move = 0\r\nend = False\r\nfor i in range(1, k+1):\r\n\tx, y = map(int, input().split())\r\n\tmatrix[x][y] = 1\r\n\tif end:\r\n\t\tcontinue\r\n\tif matrix[x][y-1] == 1:\r\n\t\tif matrix[x-1][y] == 1 and matrix[x-1][y-1] == 1:\r\n\t\t\tend_move = i\r\n\t\t\tend = True\r\n\t\tif matrix[x+1][y] == 1 and matrix[x+1][y-1] == 1:\r\n\t\t\tend_move = i\r\n\t\t\tend = True\r\n\tif matrix[x][y+1] == 1:\r\n\t\tif matrix[x-1][y] == 1 and matrix[x-1][y+1] == 1:\r\n\t\t\tend_move = i\r\n\t\t\tend = True\r\n\t\tif matrix[x+1][y] == 1 and matrix[x+1][y+1] == 1:\r\n\t\t\tend_move = i\r\n\t\t\tend = True\r\nprint(end_move)", "n,m,k = [int(x) for x in input().split()]\r\na = [0] * (n + 2)\r\na[0] = a[n + 1] = [0] * (m + 2)\r\nfor i in range(1,n + 1):\r\n a[i] = [0] * (m + 2)\r\nfor s in range(k):\r\n i,j = [int(x) for x in input().split()]\r\n a[i][j] = 1\r\n s1 = a[i-1][j-1] + a[i-1][j] + a[i][j] + a[i][j-1]\r\n s2 = a[i+1][j -1]+a[i+1][j] + a[i][j] + a[i][j-1]\r\n s3 = a[i - 1][j + 1] + a[i - 1][j] + a[i][j] + a[i][j + 1]\r\n s4 = a[i + 1][j + 1] +a[i + 1][j] + a[i][j] + a[i][j + 1]\r\n if s1 == 4 or s2 == 4 or s3 == 4 or s4 == 4:\r\n print(s + 1)\r\n break\r\nelse:\r\n print(0)", "def judge(key):\r\n global dict1\r\n if (key[0],key[1]+1) in dict1 and (key[0]+1,key[1]) in dict1 and (key[0]+1,key[1]+1) in dict1:\r\n return 1\r\n elif (key[0]-1,key[1]) in dict1 and (key[0],key[1]+1) in dict1 and (key[0]-1,key[1]+1) in dict1:\r\n return 1\r\n elif (key[0],key[1]-1) in dict1 and (key[0]+1,key[1]) in dict1 and (key[0]+1,key[1]-1) in dict1:\r\n return 1\r\n elif (key[0],key[1]-1) in dict1 and (key[0]-1,key[1]) in dict1 and (key[0]-1,key[1]-1) in dict1:\r\n return 1\r\n else:\r\n return 0\r\nn,m,k=map(int,input().split())\r\ndict1={}\r\nflag=1\r\nfor i in range(k):\r\n j=list(map(int,input().split()))\r\n k=tuple(j)\r\n dict1[k]=1\r\n if flag:\r\n if judge(k):\r\n flag=0\r\n print(i+1)\r\nif flag:\r\n print(0)", "n, m, k = map(int, input().split())\r\na = [[0] * (m + 2) for i in range(n + 2)]\r\nt = True\r\nfor i in range(k):\r\n\tx, y = map(int, input().split())\r\n\ta[x][y] = 1\r\n\tif a[x - 1][y - 1] == a[x - 1][y] == a[x][y - 1] == 1:\r\n\t\tprint(i + 1)\r\n\t\tt = False\r\n\t\tbreak\r\n\tif a[x - 1][y + 1] == a[x - 1][y] == a[x][y + 1] == 1:\r\n\t\tprint(i + 1)\r\n\t\tt = False\r\n\t\tbreak\r\n\tif a[x + 1][y - 1] == a[x + 1][y] == a[x][y - 1] == 1:\r\n\t\tprint(i + 1)\r\n\t\tt = False\r\n\t\tbreak\r\n\tif a[x + 1][y + 1] == a[x + 1][y] == a[x][y + 1] == 1:\r\n\t\tprint(i + 1)\r\n\t\tt = False\r\n\t\tbreak\r\nif t:\r\n\tprint(0)", "R=lambda:map(int,input().split())\r\nn,m,k=R()\r\nN=1024\r\ng=[[0]*N for _ in range(N)]\r\ndef T(r,c):\r\n return g[r][c] and g[r+1][c] and g[r][c+1] and g[r+1][c+1]\r\nfor i in range(k):\r\n r,c=R()\r\n g[r][c]=1\r\n if T(r-1,c-1) or T(r-1,c) or T(r,c-1) or T(r,c):\r\n print(i+1)\r\n break\r\nelse:\r\n print(0)\r\n", "def is4Balck(pixelList,i,j):\r\n if pixelList[i][j]+pixelList[i+1][j]+pixelList[i][j+1]+pixelList[i+1][j+1]==4:\r\n return True\r\n elif pixelList[i][j]+pixelList[i-1][j]+pixelList[i][j+1]+pixelList[i-1][j+1]==4:\r\n return True\r\n elif pixelList[i][j]+pixelList[i+1][j]+pixelList[i][j-1]+pixelList[i+1][j-1]==4:\r\n return True\r\n elif pixelList[i][j]+pixelList[i-1][j]+pixelList[i][j-1]+pixelList[i-1][j-1]==4:\r\n return True\r\n else:\r\n return False\r\n\r\nn,m,k=map(int,input().split())\r\npixelList=[[0 for i in range(m+2)] for j in range(n+2)]\r\nfor _ in range(k):\r\n row,column=map(int,input().split())\r\n pixelList[row][column]=1\r\n if is4Balck(pixelList,row,column):\r\n print(_+1)\r\n break\r\nelse:\r\n print(0)", "#罗景轩2300012610\r\nn, m, k=map(int, input().split())\r\nMatrix=[[0]*(m+2)for i in range(n+2)]\r\n \r\ndef exam(i,j):\r\n if Matrix[i][j+1] and Matrix[i+1][j] and Matrix[i+1][j+1]:\r\n return True\r\n if Matrix[i][j-1] and Matrix[i+1][j-1] and Matrix[i+1][j]:\r\n return True\r\n if Matrix[i-1][j] and Matrix[i-1][j+1] and Matrix[i][j+1]:\r\n return True\r\n if Matrix[i-1][j-1] and Matrix[i-1][j] and Matrix[i][j-1]:\r\n return True\r\n return False\r\n\r\nfor h in range(k):\r\n i, j=map(int, input().split()) \r\n Matrix[i][j]=1\r\n if exam(i,j):\r\n print(h+1)\r\n break\r\nelse:\r\n print(\"0\")\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Oct 18 16:48:59 2023\r\n\r\n@author: 赵语涵2300012254\r\n\"\"\"\r\n\r\ndef judge(x,y,pos,array):\r\n if array[x+pos[0]][y+pos[1]]==1 and array[x+pos[0]][y]==1 and array[x][y+pos[1]]==1:\r\n return True\r\n else:\r\n return False\r\n\r\nn,m,k = map(int,input().split())\r\narr = [0]*(n+2)\r\nfor i in range(n+2):\r\n arr[i] = [0]*(m+2)\r\ncheck,answer = 0,0\r\nfor _ in range(k):\r\n x,y = map(int,input().split())\r\n arr[x][y] = 1\r\n if check == 1:\r\n pass\r\n elif judge(x,y,[1,1],arr) or judge(x,y,[-1,1],arr)\\\r\n or judge(x,y,[1,-1],arr) or judge(x,y,[-1,-1],arr):\r\n answer = _+1\r\n check = 1\r\nelse:\r\n print(answer)", "n, m, k = map(int, input().split())\r\nfig = [[0 for _ in range(m+2)] for _ in range(n+2)]\r\n\r\n\r\ndef find(x, y):\r\n if fig[x][y]+fig[x-1][y]+fig[x][y-1]+fig[x-1][y-1] == 4 or \\\r\n fig[x][y]+fig[x-1][y]+fig[x][y+1]+fig[x-1][y+1] == 4 or \\\r\n fig[x][y]+fig[x+1][y]+fig[x][y-1]+fig[x+1][y-1] == 4 or \\\r\n fig[x][y]+fig[x+1][y]+fig[x][y+1]+fig[x+1][y+1] == 4:\r\n return True\r\n else:\r\n return False\r\n\r\n\r\ndef main():\r\n for i in range(k):\r\n x, y = map(int, input().split())\r\n fig[x][y] = 1\r\n if find(x, y):\r\n print(i+1)\r\n return\r\n print(0)\r\n return\r\n\r\n\r\nmain()\r\n", "n,m,k = map(int,input().split())\r\nmt = [[False]*(m+2) for i in range(n+2)]\r\nflag = 0\r\nfor i in range(1,k+1):\r\n x,y = map(int,input().split())\r\n mt[x][y]= True\r\n s1 = mt[x+1][y] and mt[x+1][y+1] and mt[x][y+1]\r\n s2 = mt[x + 1][y] and mt[x + 1][y -1] and mt[x][y - 1]\r\n s3 = mt[x -1][y] and mt[x -1][y + 1] and mt[x][y + 1]\r\n s4 = mt[x - 1][y] and mt[x - 1][y - 1] and mt[x][y - 1]\r\n if s1 or s2 or s3 or s4:\r\n print(i)\r\n flag = 1\r\n break\r\nif flag ==0:\r\n print(0)", "import sys\r\ndef judge(x,y):\r\n if pixel[x][y]+pixel[x+1][y]+pixel[x+1][y+1]+pixel[x][y+1]==4 or pixel[x][y]+pixel[x][y+1]+pixel[x-1][y]+pixel[x-1][y+1]==4 or pixel[x][y]+pixel[x-1][y]+pixel[x-1][y-1]+pixel[x][y-1]==4 or pixel[x][y]+pixel[x+1][y]+pixel[x+1][y-1]+pixel[x][y-1]==4:\r\n return True\r\n else:\r\n return False\r\n \r\nn,m,k=map(int,input().split())\r\npixel=[[0 for i in range(m+2)] for j in range(n+2)]\r\nfor i in range(k):\r\n x,y=map(int,input().split())\r\n pixel[x][y]=1\r\n if judge(x,y):\r\n print(i+1)\r\n sys.exit(0)\r\nprint(0)\r\n \r\n", "n,m,k=map(int, input().split())\r\ngame=[]\r\npd=0\r\nfor i in range(n+2):\r\n r=[]\r\n for j in range(m+2):\r\n r.append(0)\r\n game.append(r)\r\nfor l in range(k):\r\n x,y=map(int, input().split())\r\n game[x][y]=1\r\n for i in range(x-1,x+2):\r\n for j in range(y-1,y+2):\r\n if i!=x and j!=y and game[i][j]==1:\r\n if game[i][y]==1 and game[x][j]==1:\r\n pd=1\r\n ans=l+1\r\n if pd:\r\n break\r\n if pd:\r\n break\r\nif pd==0:\r\n print(\"0\")\r\nelse:\r\n print(ans)", "#定义一个函数\r\ndef check(game,i,j):\r\n if game[i-1][j-1]==game[i-1][j]==game[i][j-1]==1:\r\n return True\r\n if game[i-1][j]==game[i-1][j+1]==game[i][j+1]==1:\r\n return True\r\n if game[i][j-1]==game[i+1][j-1]==game[i+1][j]==1:\r\n return True\r\n if game[i][j+1]==game[i+1][j]==game[i+1][j+1]==1:\r\n return True\r\n return False\r\n\r\n#加保护圈\r\nn,m,k=map(int,input().split())\r\ngame=[[0]*(m+2) for i in range(n+2)]\r\n\r\n\r\n#进行输出运用函数\r\nfor i in range(k):\r\n a,b=map(int,input().split())\r\n game[a][b]=1\r\n if check(game,a,b):\r\n print(i+1)\r\n break\r\nelse:\r\n print(0)", "def lose(p,q): \r\n if (not l[p][q]) and (not l[p+1][q]) and (not l[p][q+1]) and (not l[p+1][q+1]):\r\n return True\r\n\r\nflag=True\r\nn,m,k=map(int,input().split())\r\nl=[[True]*1024 for _ in range(1024)]\r\nfor i in range(1,k+1):\r\n x,y=map(int,input().split())\r\n l[x][y]=False\r\n if lose(x-1,y-1) or lose(x,y) or lose(x,y-1) or lose(x-1,y):\r\n print(i)\r\n flag=False\r\n break\r\nif flag:\r\n print(0)", "n, m, k = map(int, input().split())\r\ngrid = [[0] * (m+2) for _ in range(n+2)]\r\n\r\ndef check(x, y):\r\n if (\r\n grid[x][y+1] and \r\n grid[x+1][y] and \r\n grid[x+1][y+1]\r\n ):\r\n return True\r\n if (\r\n grid[x][y-1] and \r\n grid[x+1][y-1] and \r\n grid[x+1][y]\r\n ):\r\n return True\r\n if (\r\n grid[x-1][y] and \r\n grid[x-1][y+1] and \r\n grid[x][y+1]\r\n ):\r\n return True\r\n if (\r\n grid[x-1][y-1] and \r\n grid[x-1][y] and \r\n grid[x][y-1]\r\n ):\r\n return True\r\n return False\r\n\r\nfor move in range(k):\r\n i, j = map(int, input().split())\r\n grid[i][j] = 1\r\n if check(i, j):\r\n print(move+1)\r\n exit()\r\n\r\nprint(0)", "n,m,k=[int(x)for x in input().split()]\r\narr={i:dict({j:0 for j in range(m+2)}) for i in range(n+2)}#建立矩阵字典（有保护圈）\r\nans=0\r\nfor x in range(1,k+1):\r\n i,j=[int(x)for x in input().split()]\r\n arr[i][j]=1\r\n if ans == 0:\r\n for p,q in [(-1,-1),(-1,+1),(+1,-1),(+1,+1)]:#在输入方格左上、右上、左下、右下是否会形成2*2方格\r\n if arr[i+p][j+q] == 1 and ans == 0:\r\n if arr[i+p][j] == arr[i][j+q] == 1:\r\n ans=x\r\nprint(ans)", "n,m,k=map(int,input().split())\r\nl=[]\r\nfor i in range(n+2):\r\n l.append([0 for i in range(m+2)])\r\ndef num(d,y,x,i):\r\n c=max(d[y-1][x-1]+d[y-1][x]+d[y][x]+d[y][x-1],d[y+1][x+1]+d[y+1][x]+d[y][x]+d[y][x+1],d[y-1][x+1]+d[y-1][x]+d[y][x]+d[y][x+1],d[y+1][x-1]+d[y+1][x]+d[y][x]+d[y][x-1])\r\n if c>=4:\r\n return i+1\r\n else:\r\n return 0\r\nfor e in range(k):\r\n i,j=map(int,input().split())\r\n l[i][j]=1\r\n f=num(l,i,j,e)\r\n if f!=0:\r\n print(f)\r\n break\r\nif f==0:\r\n print(0)", "n, m ,k = map(int,input().split())\r\nmatrix = [[0]*(m+2) for _ in range(n+2)]\r\nlst = [[int(x) for x in input().split()] for _ in range(k)]\r\n\r\nans = 0\r\n\r\nfor h in range(len(lst)):\r\n it = lst[h]\r\n i = it[0]\r\n j = it[1]\r\n matrix[i][j] = 1\r\n if (matrix[i-1][j-1] == matrix[i-1][j] == matrix[i][j-1] == 1) or \\\r\n (matrix[i-1][j] == matrix[i-1][j+1] == matrix[i][j+1] == 1) or \\\r\n (matrix[i][j-1] == matrix[i+1][j-1] == matrix[i+1][j] == 1) or \\\r\n (matrix[i][j+1] == matrix[i+1][j] == matrix[i+1][j+1] == 1) :\r\n ans = h+1\r\n break\r\n\r\nprint(ans)\r\n", "def main():\r\n n, m, k = map(int, input().split(\" \"))\r\n row = [1 for _ in range(m+2)]\r\n matrix = [list(row) for _ in range(n+2)]\r\n flag1 = True\r\n move = []\r\n for _ in range(k):\r\n move.append(input())\r\n\r\n for a in range(k):\r\n i, j = map(int, move[a].split(\" \"))\r\n matrix[i][j] = 0\r\n if judge(matrix, i, j):\r\n print(a+1)\r\n flag1 = False\r\n break\r\n if flag1:\r\n print(0)\r\n\r\n\r\ndef judge(martix, i, j):\r\n if martix[i-1][j-1] == 0 and martix[i-1][j] == 0 and martix[i][j-1] == 0 and martix[i][j] == 0:\r\n return True\r\n elif martix[i-1][j] == 0 and martix[i-1][j+1] == 0 and martix[i][j+1] == 0 and martix[i][j] == 0:\r\n return True\r\n elif martix[i][j-1] == 0 and martix[i+1][j-1] == 0 and martix[i+1][j] == 0 and martix[i][j] == 0:\r\n return True\r\n elif martix[i+1][j] == 0 and martix[i+1][j+1] == 0 and martix[i][j+1] == 0 and martix[i][j] == 0:\r\n return True\r\n else:\r\n return False\r\n \r\n\r\nif __name__ == \"__main__\":\r\n main()", "n,m,k = map(int,input().split())\r\nmat = [[0 for j in range(m+1)] for i in range(n+1)]\r\nfor q in range(k):\r\n a,b = map(int,input().split())\r\n x = a-1\r\n y = b-1\r\n mat[x][y] = 1\r\n s1 = mat[x - 1][y] + mat[x - 1][y - 1] + mat[x][y - 1]\r\n s2 = mat[x - 1][y] + mat[x - 1][y + 1] + mat[x][y + 1]\r\n s3 = mat[x + 1][y] + mat[x + 1][y - 1] + mat[x][y - 1]\r\n s4 = mat[x + 1][y] + mat[x + 1][y + 1] + mat[x][y + 1]\r\n s = [s1,s2,s3,s4]\r\n if 3 in s:\r\n print(q+1)\r\n break\r\nelse:\r\n print(0)", "# Pasha and Pixels Difficulty:1100\r\nn, m, k = map(int, input().split())\r\nmatrix = [[False]*(m+2) for q in range(n+2)]\r\n\r\nflag = False\r\n\r\nfor p in range(k):\r\n i, j = map(int, input().split())\r\n if not matrix[i][j]:\r\n matrix[i][j] = True\r\n if matrix[i-1][j] and matrix[i-1][j-1] and matrix[i][j-1]:\r\n flag = True\r\n print(p+1)\r\n break\r\n elif matrix[i+1][j] and matrix[i+1][j-1] and matrix[i][j-1]:\r\n flag = True\r\n print(p+1)\r\n break\r\n elif matrix[i-1][j] and matrix[i-1][j+1] and matrix[i][j+1]:\r\n flag = True\r\n print(p+1)\r\n break\r\n elif matrix[i+1][j] and matrix[i+1][j+1] and matrix[i][j+1]:\r\n flag = True\r\n print(p+1)\r\n break\r\n if flag:\r\n break\r\n elif p == k-1:\r\n print(0)\r\n", "n,m,k=map(int,input().split())\r\na=[[\"0\" for i in range(m+2)] for j in range(n+2)]\r\nans=0\r\nfor i in range(k):\r\n x,y=map(int,input().split())\r\n a[x][y]=\"1\"\r\n if (a[x+1][y]==\"1\" and a[x][y+1]==\"1\"):\r\n if a[x+1][y+1]==\"1\":\r\n ans=i+1\r\n break\r\n if (a[x+1][y]==\"1\" and a[x][y-1]==\"1\"):\r\n if a[x+1][y-1]==\"1\":\r\n ans=i+1\r\n break\r\n if (a[x-1][y]==\"1\" and a[x][y+1]==\"1\"):\r\n if a[x-1][y+1]==\"1\":\r\n ans=i+1\r\n break\r\n if (a[x-1][y]==\"1\" and a[x][y-1]==\"1\"):\r\n if a[x-1][y-1]==\"1\":\r\n ans=i+1\r\n break\r\nprint(ans)", "n,m,k=map(int,input().split())\r\nif k<4:\r\n print(0)\r\nelse:\r\n a=[[0]*(m+2) for i in range(0,n+2)]\r\n for j in range(1,4):\r\n x,y=map(int,input().split())\r\n a[x][y]=1\r\n h=0\r\n for j in range(4,k+1):\r\n x,y=map(int,input().split())\r\n a[x][y]=1\r\n b=a[x-1][y-1]+a[x-1][y]+a[x][y-1]\r\n c=a[x][y-1]+a[x+1][y-1]+a[x+1][y]\r\n d=a[x-1][y]+a[x-1][y+1]+a[x][y+1]\r\n e=a[x][y+1]+a[x+1][y]+a[x+1][y+1]\r\n if b==3 or c==3 or d==3 or e==3:\r\n h=j\r\n break\r\n else:\r\n continue\r\n print(h)", "[n,m,k]=[int(q) for q in input().split()]\r\nA=[[0 for x_ in range(1,m+2)] for y_ in range(1,n+2)]\r\nB=[[0 for x_ in range(1,m+1)] for y_ in range(1,n+1)]\r\nS=True\r\nfor z in range(k):\r\n\t[y,x]=[int(_x) for _x in input().split()]\r\n\tif B[y-1][x-1]==0:\r\n\t\tB[y-1][x-1]=1\r\n\t\tA[y][x]+=1\r\n\t\tif A[y][x]==4:\r\n\t\t\tprint(z+1)\r\n\t\t\tS=False\r\n\t\t\tbreak\r\n\t\tA[y][x-1]+=1\r\n\t\tif A[y][x-1]==4:\r\n\t\t\tprint(z+1)\r\n\t\t\tS=False\r\n\t\t\tbreak\r\n\t\tA[y-1][x]+=1\r\n\t\tif A[y-1][x]==4:\r\n\t\t\tprint(z+1)\r\n\t\t\tS=False\r\n\t\t\tbreak\r\n\t\tA[y-1][x-1]+=1\r\n\t\tif A[y-1][x-1]==4:\r\n\t\t\tprint(z+1)\r\n\t\t\tS=False\r\n\t\t\tbreak\r\nfor e in range(z,k-1):\r\n\t[y,x]=[int(_x) for _x in input().split()]\r\n\r\nif S:\r\n\tprint(0)", "n,m,k=map(int,input().split())\r\nmove=[]\r\nfield=[[0]*(m+2) for x in range(n+2)]\r\n#print(field)\r\nfor i in range(k):\r\n move.append(list(map(int,input().split())))\r\njud=0\r\nfor step in range(k):\r\n i,j=move[step][0],move[step][1]\r\n #print(i,j)\r\n field[i][j]=1\r\n for p in [-1,1]:\r\n for q in [-1,1]:\r\n if field[i+p][j]==1 and field[i][j+q]==1 and field[i+p][j+q]==1:\r\n jud+=1\r\n #print(field)\r\n if jud:\r\n print(step+1)\r\n break\r\nif not jud:\r\n print(0)", "n,m,k=map(int,input().split())\nP=[]\nfor i in range(n+1):\n P.append([0]*(m+1))\nA=[]\na=0\nfor i in range(n+2):\n A.append([0]*(m+2))\nfor j in range(k):\n p,q=map(int,input().split())\n if P[p][q]==0:\n A[p][q]+=1\n A[p+1][q]+=1\n A[p][q+1]+=1\n A[p+1][q+1]+=1\n P[p][q]=1\n if A[p][q]==4 or A[p+1][q]==4 or A[p][q+1]==4 or A[p+1][q+1]==4:\n print(j+1)\n a=1\n break\nif a == 0:\n print(0)", "n,m,k = map(int,input().split())\r\naaa = [[0 for j in range(m + 2)] for i in range(n + 2)]\r\n\r\ndef t(p,q):\r\n return aaa[p - 1][q - 1] and aaa[p - 1][q] and aaa[p][q - 1] and aaa[p][q]\r\n\r\ndef main():\r\n if n == 1 or m == 1:\r\n return 0\r\n else:\r\n for v in range(k):\r\n x,y = map(int,input().split())\r\n aaa[x][y] = 1\r\n if t(x,y) or t(x + 1,y) or t(x,y + 1) or t(x + 1,y + 1):\r\n return(v + 1)\r\n return 0\r\n\r\nprint(main())", "result = []\r\nn, m, k = map(int, input().split())\r\nmatrix = [[0] * (m + 2)]\r\nfor i in range(n):\r\n matrix.append([0] + [0 for _ in range(m)] + [0])\r\nmatrix.append([0] * (m + 2))\r\nfor i in range(k):\r\n row, coloum = map(int, input().split())\r\n matrix[row][coloum] = 1\r\n if matrix[row][coloum] + matrix[row][coloum - 1] + matrix[row - 1][coloum] + matrix[row - 1][coloum - 1] == 4 or \\\r\n matrix[row][coloum] + matrix[row][coloum - 1] + matrix[row + 1][coloum] + matrix[row + 1][\r\n coloum - 1] == 4 or matrix[row][coloum] + matrix[row][coloum + 1] + matrix[row - 1][coloum] + matrix[row - 1][\r\n coloum + 1] == 4 or matrix[row][coloum] + matrix[row][coloum + 1] + matrix[row + 1][coloum] + matrix[row + 1][\r\n coloum + 1] == 4:\r\n result.append(i + 1)\r\nif len(result) == 0:\r\n print(0)\r\nelse:\r\n print(result[0])", "n,m,k=map(int,input().split( ))\r\nmat=[[0 for a in range(m+2)]for b in range(n+2)]\r\n\r\ndef check_square(i,j):\r\n if mat[i][j+1] and mat[i+1][j] and mat[i+1][j+1]:\r\n return True\r\n if mat[i][j-1] and mat[i+1][j-1] and mat[i+1][j]:\r\n return True\r\n if mat[i][j+1] and mat[i-1][j+1] and mat[i-1][j]:\r\n return True\r\n if mat[i][j-1] and mat[i-1][j-1] and mat[i-1][j]:\r\n return True\r\n return False\r\n\r\nfor a in range(k):\r\n i,j=map(int,input().split( ))\r\n mat[i][j]=1\r\n if check_square(i,j):\r\n print(a+1)\r\n break\r\nelse:\r\n print(0)", "n,m,k=map(int,input().split())\r\ns=[[0 for x in range(m+2)]for y in range(n+2)]\r\nfor k in range(1,k+1):\r\n i,j=map(int,input().split())\r\n s[i][j]=1\r\n if s[i][j-1]==s[i-1][j]==s[i-1][j-1]==1:\r\n print(k)\r\n break\r\n elif s[i][j+1]==s[i-1][j]==s[i-1][j+1]==1:\r\n print(k)\r\n break\r\n elif s[i][j+1]==s[i+1][j]==s[i+1][j+1]==1:\r\n print(k)\r\n break\r\n elif s[i][j-1]==s[i+1][j]==s[i+1][j-1]==1:\r\n print(k)\r\n break\r\nelse:\r\n print(0)", "row_num,column_num,action_num=[int(x) for x in input().split()]\r\nlist_pixel=[[0]*(column_num+1) for _ in range(row_num+1)]\r\n\"\"\"形成矩阵外套\"\"\"\r\nnum=0\r\ntest=True\r\nexamination=set()\r\nfor i in range(action_num):\r\n num+=1\r\n row,column=[int(y) for y in input().split()]\r\n if (row,column) not in examination:\r\n examination.add((row,column))\r\n list_pixel[row - 1][column - 1] += 1\r\n list_pixel[row][column - 1] += 1\r\n list_pixel[row - 1][column] += 1\r\n list_pixel[row][column] += 1\r\n if 4 in {list_pixel[row - 1][column - 1], list_pixel[row][column - 1], list_pixel[row - 1][column],\r\n list_pixel[row][column]}:\r\n test = False\r\n print(num)\r\n break\r\n\r\nif test:\r\n print(0)", "n,m,k = map(int,input().split())\r\nst = [1]*(m+2)\r\nda = [ ]\r\nfrom copy import deepcopy\r\nfor i in range(n+2):\r\n da.append(deepcopy(st))\r\nre = 0\r\nfor _ in range(k):\r\n i,j = map(int,input().split())\r\n da[i][j] = 0\r\n re += 1\r\n if da[i+1][j+1]+da[i][j+1]+da[i+1][j] == 0:\r\n print(re)\r\n break\r\n elif da[i-1][j+1]+da[i][j+1]+da[i-1][j] == 0:\r\n print(re)\r\n break\r\n elif da[i+1][j-1]+da[i][j-1]+da[i+1][j] == 0:\r\n print(re)\r\n break\r\n elif da[i-1][j-1]+da[i][j-1]+da[i-1][j] == 0:\r\n print(re)\r\n break\r\nelse:\r\n print(0)", "def add(Matrix,u,v):\r\n return(Matrix[u-1][v-1] + Matrix[u-1][v] + Matrix[u][v-1] + Matrix[u][v])\r\nn,m,k = map(int,input().split())\r\nMatrix = [[0 for x in range(0,m+2)] for y in range(0,n+2)]\r\ncount = 0\r\nlist1 = []\r\nfor i in range(0,k):\r\n a,b = map(int,input().split())\r\n list1.append([a,b])\r\nfor s in range(0,k):\r\n count += 1\r\n c = list1[s][0]\r\n d = list1[s][1]\r\n Matrix[c][d] = 1\r\n if add(Matrix,c,d) == 4 or add(Matrix,c+1,d) == 4 or add(Matrix,c,d+1) == 4 or add(Matrix,c+1,d+1) == 4:\r\n print(count)\r\n break\r\n else:\r\n continue \r\nelse:\r\n print(0)", "n,m,k=map(int,input().split())\r\nabc=False\r\na=[0]*(n*m)\r\nfor l in range(k):\r\n i,j=map(int,input().split())\r\n k=(i-1)*m+j-1\r\n if a[k]==1:\r\n continue\r\n a[k]=1\r\n if i!=1 and j!=1:\r\n if a[k]>0 and a[k-m]>0 and a[k-m-1]>0 and a[k-1]>0:\r\n print(l+1)\r\n abc=True\r\n break\r\n if i!=1 and j!=m:\r\n if a[k]>0 and a[k-m]>0 and a[k-m+1]>0 and a[k+1]>0:\r\n print(l+1)\r\n abc=True\r\n break\r\n if i!=n and j!=1:\r\n if a[k]>0 and a[k+m]>0 and a[k+m-1]>0 and a[k-1]>0:\r\n print(l+1)\r\n abc=True\r\n break\r\n if i!=n and j!=m:\r\n if a[k]>0 and a[k+m]>0 and a[k+m+1]>0 and a[k+1]>0:\r\n print(l+1)\r\n abc=True\r\n break\r\nif abc==False:\r\n print(0)", "#1.输入n行；m列；k次\r\nn,m,k = map(int,input().split()) \r\n\r\n#2.建立一个n行m列的矩阵，建立两个列表，分别表示行，列\r\nz = [[0]*m for i in range (n)]\r\n\r\n#3.进行每一次的涂黑\r\nfor i in range (k):\r\n r,c = map(int,input().split())\r\n r=r-1;c=c-1\r\n z[r][c]=1\r\n #4.进行判断是否出现，注意边界\r\n #右上四个格子\r\n if r>0 and c<m-1 :\r\n if z[r][c]==z[r][c+1]==z[r-1][c]==z[r-1][c+1]==1 :\r\n print(i+1)\r\n break\r\n #右下四个格子：\r\n if r<n-1 and c<m-1 :\r\n if z[r][c]==z[r][c+1]==z[r+1][c]==z[r+1][c+1]==1:\r\n print(i+1)\r\n break\r\n #左上四个格子\r\n if r>0 and c>0 :\r\n if z[r][c]==z[r][c-1]==z[r-1][c-1]==z[r-1][c]==1:\r\n print(i+1)\r\n break\r\n #左下四个格子\r\n if r<n-1 and c>0 :\r\n if z[r][c]==z[r][c-1]==z[r+1][c]==z[r+1][c-1]==1:\r\n print(i+1)\r\n break\r\nelse:\r\n print(0)", "def calculate_function(x, y):\r\n return matrix[x][y] + matrix[x + 1][y] + matrix[x][y + 1] + matrix[x + 1][\r\n y + 1]\r\n\r\n\r\nn, m, k = map(int, input().split())\r\nmatrix = [[0 for j in range(m + 2)] for i in range(n + 2)]\r\nif n == 1 or m == 1:\r\n print(0)\r\n exit()\r\nfor i in range(0, k):\r\n x, y = map(int, input().split())\r\n matrix[x][y] = 1\r\n if calculate_function(x - 1, y - 1) == 4:\r\n print(i + 1)\r\n exit()\r\n if calculate_function(x, y) == 4:\r\n print(i + 1)\r\n exit()\r\n if calculate_function(x - 1, y) == 4:\r\n print(i + 1)\r\n exit()\r\n if calculate_function(x, y - 1) == 4:\r\n print(i + 1)\r\n exit()\r\nprint(0)", "#黄靖涵 2300098604 工学院 2023秋\r\n\r\nn, m, k = map(int, input().split()) #row column move\r\nmatrix = [[0]*(m+2) for _ in range(n+2)] #form a matrix with two more rows and column\r\n\r\nfor b in range(k):\r\n i, j = map(int, input().split())\r\n matrix[i][j] = 1\r\n if matrix[i][j + 1] == 1:\r\n if matrix[i + 1][j] == matrix[i + 1][j + 1] == 1 or matrix[i - 1][j] == matrix[i - 1][j + 1] == 1:\r\n print(b + 1)\r\n exit()\r\n if matrix[i][j - 1] == 1:\r\n if matrix[i + 1][j] == matrix[i + 1][j - 1] == 1 or matrix[i - 1][j] == matrix[i - 1][j - 1] == 1:\r\n print(b + 1)\r\n exit()\r\nprint(0)", "n,m,k = map(int,input().split())\r\nls2 = []\r\nls = [[[0] for j in range(m)] for i in range(n)];num = 0;num1 = 0\r\nfor q in range(k):\r\n num += 1\r\n a,b = map(int,input().split())\r\n ls[a-1][b-1][0] = 1\r\n ls[a-1][b-1].append(num)\r\nfor p in range(n-1):\r\n for o in range(m-1):\r\n if ls[p][o][0] == 1 and ls[p][o+1][0] == 1 and ls[p+1][o][0] == 1 and ls[p+1][o+1][0] == 1:\r\n ls2.append(max(ls[p][o][1],ls[p][o+1][1],ls[p+1][o][1],ls[p+1][o+1][1]))\r\nif ls2 != []:\r\n print(min(ls2))\r\nelse:\r\n print(0)\r\n", "def check(i,j):\r\n if matrix[i+1][j]==1 and matrix[i][j+1]==1 and matrix[i+1][j+1]==1:\r\n return True\r\n if matrix[i-1][j]==1 and matrix[i][j+1]==1 and matrix[i-1][j+1]==1:\r\n return True\r\n if matrix[i+1][j]==1 and matrix[i][j-1]==1 and matrix[i+1][j-1]==1:\r\n return True\r\n if matrix[i-1][j]==1 and matrix[i][j-1]==1 and matrix[i-1][j-1]==1:\r\n return True\r\nn,m,k=map(int,input().split())\r\nmatrix=[[0 for j in range(m+2)] for i in range(n+2)]\r\nfor t in range(k):\r\n i,j=map(int,input().split())\r\n matrix[i][j]=1\r\n if check(i,j):\r\n print(t+1)\r\n break\r\nelse:\r\n print(0)", "n,m,k=map(int,input().split())\r\nmx=[[0]*(m+2) for i in range(n+2)]\r\ndef check(i,j):\r\n if mx[i][j+1]==1 and mx[i+1][j]==1 and mx[i+1][j+1]==1:\r\n return True\r\n if mx[i][j-1]==1 and mx[i+1][j-1]==1 and mx[i+1][j]==1:\r\n return True\r\n if mx[i-1][j]==1 and mx[i-1][j+1]==1 and mx[i][j+1]==1:\r\n return True\r\n if mx[i-1][j-1]==1 and mx[i-1][j]==1 and mx[i][j-1]==1:\r\n return True\r\n return False\r\n\r\n\r\n \r\nfor x1 in range(k):\r\n x,y=map(int,input().split())\r\n mx[x][y]=1\r\n if check(x,y)==True:\r\n print(x1+1)\r\n break\r\nelse:\r\n print(0)", "row,lie,total = [ int(_) for _ in input().split() ]\r\ns = [[0]*(lie+2) for i in range(row+2)]\r\nw = 0\r\ny = 0\r\n\r\ndef check(x,i):\r\n m = 0\r\n if s[x[0]-1][x[1]-1] and s[x[0]][x[1]-1] and s[x[0]-1][x[1]] :\r\n m += 1\r\n if s[x[0]-1][x[1]+1] and s[x[0]][x[1]+1] and s[x[0]-1][x[1]] :\r\n m += 1\r\n if s[x[0]+1][x[1]+1] and s[x[0]][x[1]+1] and s[x[0]+1][x[1]] :\r\n m += 1\r\n if s[x[0]+1][x[1]-1] and s[x[0]][x[1]-1] and s[x[0]+1][x[1]] :\r\n m += 1\r\n if m != 0:\r\n print(i + 1)\r\n global y\r\n y += 1\r\n\r\n \r\nfor i in range(total):\r\n a,b = [int(_) for _ in input().split() ]\r\n s[a][b] = 1\r\n w += 1\r\n check([a,b],i)\r\n if y:\r\n w = 0\r\n break\r\n\r\nif total == w:\r\n print(\"0\")\r\n \r\n\r\n", "n,m,k = map(int,input().split())\r\nmoves = []\r\nsq = []\r\nfor i in range(n+2):\r\n sqx = []\r\n for j in range(m+2):\r\n sqx.append(0)\r\n sq.append(sqx) \r\nfor i in range(k):\r\n x,y =map(int,input().split())\r\n sq[x][y]=1\r\n i1 = sq[x-1][y-1]*sq[x][y-1]*sq[x-1][y]*sq[x][y]==1\r\n i2 = sq[x+1][y+1]*sq[x][y+1]*sq[x+1][y]*sq[x][y]==1\r\n i3 = sq[x+1][y-1]*sq[x][y-1]*sq[x+1][y]*sq[x][y]==1\r\n i4 = sq[x-1][y+1]*sq[x][y+1]*sq[x-1][y]*sq[x][y]==1\r\n if i1 or i2 or i3 or i4 == True:\r\n moves.append(i)\r\nif len(moves)>=1:\r\n print(min(moves)+1)\r\nelse:\r\n print(0)", "def f(m,x,y):\r\n if (m[x-1][y]==1 and m[x][y-1]==1 and m[x-1][y-1]==1) or (m[x-1][y]==1 and m[x-1][y+1]==1 and m[x][y+1]==1):\r\n return True\r\n elif (m[x+1][y]==1 and m[x][y-1]==1 and m[x+1][y-1]==1) or (m[x+1][y]==1 and m[x+1][y+1]==1 and m[x][y+1]==1):\r\n return True\r\n else:\r\n return False\r\na,b,c=map(int,input().split())\r\nmatrix=[[0 for i in range(b+2)] for t in range(a+2)]\r\nfor _ in range(c):\r\n x,y=map(int,input().split())\r\n matrix[x][y]=1\r\n n=f(matrix,x,y)\r\n if n==True:\r\n print(_+1)\r\n break\r\nif n==False:\r\n print(0)", "#Pasha and Pixels\r\n#n为行数、m为列数，k为移动次数\r\nn,m,k = map(int, input().split())\r\n#生成一个大小为(n+2) * (m+2)的二维数组mx，并初始化为0（未涂色）\r\nmx = [(m+2)*[0] for i in range(n+2)]\r\n\r\ndef func(i,j): #涂黑的像素的行号i和列号j\r\n if mx[i][j+1] and mx[i+1][j] and mx[i+1][j+1]:\r\n return True\r\n if mx[i][j-1] and mx[i+1][j-1] and mx[i+1][j]:\r\n return True\r\n if mx[i-1][j] and mx[i-1][j+1] and mx[i][j+1]:\r\n return True\r\n if mx[i-1][j-1] and mx[i-1][j] and mx[i][j-1]:\r\n return True\r\n return False\r\n\r\nfor i in range(k):\r\n x,y = map(int, input().split())\r\n mx[x][y] = 1 #涂黑状态设为1，未涂色设为0\r\n if func(x,y):\r\n print(i+1)\r\n break\r\nelse:\r\n print(0)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Oct 23 15:05:14 2023\r\n\r\n@author: huozi\r\n\"\"\"\r\n\r\nn, m, k = map(int, input().split())\r\n\r\npixels = [[0] * (m+1) for _ in range(n+1)]\r\nsquare_found = False\r\n\r\nfor move in range(1, k+1):\r\n i, j = map(int, input().split())\r\n pixels[i][j] = 1\r\n \r\n if i > 1 and j > 1:\r\n if pixels[i-1][j-1] == 1 and pixels[i-1][j] == 1 and pixels[i][j-1] == 1:\r\n square_found = True\r\n break\r\n if i > 1 and j < m:\r\n if pixels[i-1][j] == 1 and pixels[i-1][j+1] == 1 and pixels[i][j+1] == 1:\r\n square_found = True\r\n break\r\n if i < n and j > 1:\r\n if pixels[i][j-1] == 1 and pixels[i+1][j-1] == 1 and pixels[i+1][j] == 1:\r\n square_found = True\r\n break\r\n if i < n and j < m:\r\n if pixels[i][j+1] == 1 and pixels[i+1][j] == 1 and pixels[i+1][j+1] == 1:\r\n square_found = True\r\n break\r\n\r\nif square_found:\r\n print(move)\r\nelse:\r\n print(0)", "n,m,k=map(int,input().split())\r\np,matrix=0,[[0 for _ in range(m+2)]for _ in range(n+2)]\r\nl=[[1,1],[-1,1],[1,-1],[-1,-1]]\r\nfor q in range(1,1+k):\r\n i,j=map(int,input().split())\r\n matrix[i][j]=1\r\n\r\n\r\n if sum([matrix[i][j],matrix[i+p[0]][j],matrix[i][j+p[1]],matrix[i+p[0]][j+p[1]]]==[1,1,1,1]for p in l)!=0:\r\n p=q\r\n break\r\nprint(p)", "n,m,k=map(int, input().split())\r\nlis=[]\r\nfor i in range(n+2):\r\n lis.append([0]*(m+2))\r\nfor i in range(k):\r\n sum1=0;sum2=0;sum3=0;sum4=0\r\n u,v=map(int, input().split())\r\n lis[u][v]=1\r\n sum1=lis[u-1][v-1]+lis[u][v-1]+lis[u-1][v]+lis[u][v]\r\n sum2=lis[u-1][v+1]+lis[u][v+1]+lis[u-1][v]+lis[u][v]\r\n sum3=lis[u+1][v-1]+lis[u][v-1]+lis[u+1][v]+lis[u][v]\r\n sum4=lis[u][v]+lis[u+1][v]+lis[u][v+1]+lis[u+1][v+1]\r\n if sum1==4 or sum2==4 or sum3==4 or sum4==4:\r\n print(i+1)\r\n break\r\n if i==k-1:\r\n print(0)", "t = 0\r\ntt = 0\r\nn, m, k = map(int, input().split())\r\nl = set() # 使用集合存储像素位置\r\n\r\nfor _ in range(k):\r\n t += 1\r\n i, j = map(int, input().split())\r\n if (i, j) in l:\r\n continue\r\n else:\r\n l.add((i, j))\r\n \r\n # 检查是否形成2×2个黑色像素组成的正方形\r\n if (\r\n (i-1, j) in l \r\n and (i-1, j+1) in l \r\n and (i, j+1) in l \r\n and (i, j) in l\r\n ) or (\r\n (i+1, j) in l \r\n and (i+1, j+1) in l \r\n and (i, j+1) in l \r\n and (i, j) in l\r\n ) or (\r\n (i+1, j) in l \r\n and (i+1, j-1) in l \r\n and (i, j-1) in l \r\n and (i, j) in l\r\n ) or (\r\n (i-1, j) in l \r\n and (i-1, j-1) in l \r\n and (i, j-1) in l \r\n and (i, j) in l\r\n ):\r\n tt = 1\r\n break\r\n\r\nif tt == 1:\r\n print(t)\r\nelse:\r\n print(\"0\")\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Oct 18 15:19:07 2023\r\n\r\n@author: 陈亚偲2300011106\r\n\"\"\"\r\nn,m,k=map(int,input().split())\r\na=set()\r\nb=0\r\nboza=True\r\nfor i in range(k):\r\n p,q=map(int,input().split())\r\n if boza:\r\n a.add((p,q))\r\n if (p-1,q-1) in a and (p-1,q) in a and (p,q-1) in a:\r\n b=i+1\r\n boza=False\r\n if (p+1,q-1) in a and (p+1,q) in a and (p,q-1) in a:\r\n b=i+1\r\n boza=False\r\n if (p+1,q+1) in a and (p+1,q) in a and (p,q+1) in a:\r\n b=i+1\r\n boza=False\r\n if (p-1,q+1) in a and (p-1,q) in a and (p,q+1) in a:\r\n b=i+1\r\n boza=False\r\nprint(b)\r\n", "def square(color, x, y):\r\n return color[x][y] == 1 and color[x+1][y] == 1\\\r\n and color[x][y+1] == 1 and color[x+1][y+1] == 1\r\nn, m, k = map(int, input().split())\r\ncolor = [[0] * (m + 2) for _ in range(n + 2)]\r\nfor i in range(k):\r\n x, y = map(int, input().split())\r\n color[x][y] = 1\r\n if square(color, x-1, y-1) or square(color, x, y-1)\\\r\n or square(color, x-1, y) or square(color, x, y):\r\n print(i+1)\r\n exit()\r\nprint(0)", "n,m,k = map(int,input().split())\r\na = [[False]*(m+2) for i in range(n+2)]\r\ndef test(i,j):\r\n case1 = a[i][j] and a[i+1][j] and a[i][j-1] and a[i+1][j-1]\r\n case2 = a[i][j] and a[i-1][j] and a[i][j - 1] and a[i - 1][j - 1]\r\n case3 = a[i][j] and a[i + 1][j] and a[i][j + 1] and a[i + 1][j + 1]\r\n case4 = a[i][j] and a[i-1][j] and a[i][j + 1] and a[i - 1][j + 1]\r\n if case1 or case2 or case3 or case4:\r\n return True\r\ndef show():\r\n for i in range(k):\r\n x,y = map(int,input().split())\r\n a[x][y]= True\r\n if test(x,y):\r\n print(i+1)\r\n return\r\n print(0)\r\nshow()", "def check(matrix, i, j):\r\n if matrix[i - 1][j - 1] and matrix[i - 1][j] and matrix[i][j - 1]:\r\n return True\r\n elif matrix[i - 1][j] and matrix[i - 1][j + 1] and matrix[i][j + 1]:\r\n return True\r\n elif matrix[i][j - 1] and matrix[i + 1][j - 1] and matrix[i + 1][j]:\r\n return True\r\n elif matrix[i][j + 1] and matrix[i + 1][j] and matrix[i + 1][j + 1]:\r\n return True\r\n else:\r\n return False\r\n\r\n\r\nn, m, k = map(int, input().split())\r\nmatrix_1 = [([False] * 1002) for i in range(1002)]\r\nans = 0\r\nflag = False\r\nfor i in range(k):\r\n row, column = map(int, input().split())\r\n matrix_1[row][column] = True\r\n if not flag:\r\n if check(matrix_1, row, column):\r\n ans = i + 1\r\n flag = True\r\nprint(ans)", "inp1=input().split()\r\nn,m,t=int(inp1[0]),int(inp1[1]),int(inp1[2])\r\nmat=[[0 for i in range(m+2)] for j in range(n+2)]\r\ndi1=[1,1,-1,-1];dj1=[1,-1,1,-1]\r\nfor _ in range(1,t+1):\r\n ip=input().split()\r\n i=int(ip[0]);j=int(ip[1])\r\n mat[i][j]=1\r\n for k in range(4):\r\n if mat[i+di1[k]][j+dj1[k]]==1:\r\n if mat[i][j+dj1[k]]==1 and mat[i+di1[k]][j]==1:\r\n print(_)\r\n import sys\r\n sys.exit()\r\nprint(0)", "def check(A,i,j):\r\n if A[i-1][j-1]==1 and A[i-1][j]==1 and A[i][j-1]==1:\r\n return True\r\n if A[i-1][j]==1 and A[i-1][j+1]==1 and A[i][j+1]==1:\r\n return True\r\n if A[i][j-1]==1 and A[i+1][j-1]==1 and A[i+1][j]==1:\r\n return True\r\n if A[i][j+1]==1 and A[i+1][j]==1 and A[i+1][j+1]==1:\r\n return True\r\n\r\nn,m,k = map(int,input().split())\r\nAx = [[0 for j in range(m+2)] for i in range(n+2)]\r\nfor l in range(k):\r\n i,j = map(int,input().split())\r\n Ax[i][j] = 1\r\n flag = False\r\n flag = check(Ax,i,j)\r\n if flag:\r\n print(l+1)\r\n break\r\nif not flag:\r\n print(0)", "n,m,k=[int(x) for x in input().split()]\r\naa=[[0]*(m+2) for v in range(n+2)]\r\nt=100001\r\nfor i in range(k):\r\n x,y=[int(x) for x in input().split()]\r\n aa[x][y]=1\r\n if t>k:\r\n if aa[x-1][y-1]+aa[x][y-1]+aa[x-1][y]+aa[x][y]==4 or aa[x+1][y+1]+aa[x][y+1]+aa[x+1][y]+aa[x][y]==4 or aa[x-1][y+1]+aa[x][y+1]+aa[x-1][y]+aa[x][y]==4 or aa[x+1][y-1]+aa[x][y-1]+aa[x+1][y]+aa[x][y]==4:\r\n t=min(t,i+1)\r\nif t!=100001:\r\n print(t)\r\nelse:\r\n print(0)", "#索林格 2200013317\r\nn,m,k = map(int,input().split())\r\nsquare = [[0]*(m+2) for i in range(n+2)]\r\n\r\n#判断是否有点满足右、下、右下都是黑点\r\ndef check(i,j):\r\n if square[i][j+1] and square[i+1][j] and square[i+1][j+1]:\r\n return True\r\n if square[i][j-1] and square[i+1][j] and square[i+1][j-1]:\r\n return True\r\n if square[i][j-1] and square[i-1][j-1] and square[i-1][j]:\r\n return True\r\n if square[i][j+1] and square[i-1][j] and square[i-1][j+1]:\r\n return True\r\n return False\r\n\r\nfor i in range(k):\r\n x,y = map(int,input().split())\r\n square[x][y] = 1\r\n if check(x,y):\r\n print(i+1)\r\n break\r\nelse:\r\n print('0')", "'''\r\n刘思瑞 2100017810\r\n'''\r\ndef bea(a,b):\r\n global mat,m,n\r\n if a != 0 and b!=0 and a != n-1 and b!= m-1:\r\n if mat[a-1][b-1]:\r\n if mat[a-1][b] and mat[a][b-1]:\r\n return True\r\n if mat[a-1][b+1]:\r\n if mat[a][b+1] and mat[a-1][b]:\r\n return True\r\n if mat[a+1][b+1]:\r\n if mat[a+1][b] and mat[a][b+1]:\r\n return True\r\n if mat[a+1][b-1]:\r\n if mat[a+1][b] and mat[a][b-1]:\r\n return True\r\n elif a == 0:\r\n if b ==0:\r\n if mat[a+1][b+1]:\r\n if mat[a+1][b] and mat[a][b+1]:\r\n return True\r\n elif b==m-1:\r\n if mat[a+1][b-1]:\r\n if mat[a+1][b] and mat[a][b-1]:\r\n return True\r\n else:\r\n if mat[a+1][b+1]:\r\n if mat[a+1][b] and mat[a][b+1]:\r\n return True\r\n if mat[a+1][b-1]:\r\n if mat[a+1][b] and mat[a][b-1]:\r\n return True\r\n elif a == n-1:\r\n if b == 0:\r\n if mat[a-1][b+1]:\r\n if mat[a][b+1] and mat[a-1][b]:\r\n return True\r\n elif b == m-1:\r\n if mat[a-1][b-1]:\r\n if mat[a-1][b] and mat[a][b-1]:\r\n return True\r\n else:\r\n if mat[a-1][b-1]:\r\n if mat[a-1][b] and mat[a][b-1]:\r\n return True\r\n if mat[a-1][b+1]:\r\n if mat[a][b+1] and mat[a-1][b]:\r\n return True\r\n elif b == 0:\r\n if mat[a-1][b+1]:\r\n if mat[a][b+1] and mat[a-1][b]:\r\n return True\r\n if mat[a+1][b+1]:\r\n if mat[a+1][b] and mat[a][b+1]:\r\n return True\r\n elif b == m-1:\r\n if mat[a-1][b-1]:\r\n if mat[a-1][b] and mat[a][b-1]:\r\n return True\r\n if mat[a+1][b-1]:\r\n if mat[a+1][b] and mat[a][b-1]:\r\n return True\r\n return False\r\n \r\n\r\ndef sign(a,b):\r\n global mat\r\n mat[a][b] = True\r\n return bea(a,b)\r\n\r\nj = 0\r\nn , m , k = map(int,input().split())\r\nmat = []\r\nfor i in range(n):\r\n mat.append([False]*m)\r\nif m != 1 and n !=1 : \r\n for i in range(k):\r\n a , b = map(int,input().split())\r\n if sign(a-1,b-1):\r\n j = i+1\r\n break\r\nprint(j)\r\n", "n,m,k=[int(a) for a in input().split()];mat=[];y=0\r\nfor d in range(n+2):mat.append([0]*(m+2))\r\ndef check(i,j):\r\n if mat[i][j+1]==mat[i-1][j]==mat[i-1][j+1]==1: return False\r\n elif mat[i][j+1]==mat[i+1][j]==mat[i+1][j+1]==1: return False\r\n elif mat[i][j-1]==mat[i-1][j]==mat[i-1][j-1]==1: return False\r\n elif mat[i][j-1]==mat[i+1][j]==mat[i+1][j-1]==1: return False\r\n return True\r\nfor b in range(1,k+1):\r\n i,j=[int(c) for c in input().split()]\r\n mat[i][j]=1\r\n if check(i,j)==False:\r\n y=b;'print(mat)';break\r\nprint(y)", "def square(board,r,s):\r\n if board[r][s-1] and board[r-1][s-1] and board[r-1][s]\\\r\n or board[r-1][s] and board[r-1][s+1] and board[r][s+1]\\\r\n or board[r][s-1] and board[r+1][s-1] and board[r+1][s]\\\r\n or board[r][s+1] and board[r+1][s] and board[r+1][s+1]:\r\n return 1\r\n else:\r\n return 0\r\nn,m,k=map(int,input().split())\r\nboard=[[0]*(m+2) for _ in range(n+2)]\r\nt=0\r\nfound=True\r\nfor _ in range(k):\r\n t+=1\r\n i,j=map(int,input().split())\r\n board[i][j]=1\r\n if t>=4:\r\n if square(board,i,j):\r\n found=False\r\n print(t)\r\n break\r\nif found:\r\n print(0)", "n,m,k = map(int,input().split())\r\nyidong = []\r\njieguo = []\r\nqipan = []\r\na = 0\r\n\r\nfor i in range(n):\r\n qipan.append([0]*m)\r\n\r\nfor i in range(k):\r\n list1 = list(map(int,input().split()))\r\n yidong.append(list1)\r\n\r\nfor i in range(len(yidong)):\r\n step = yidong[i]\r\n h = step[0]-1\r\n l = step[1]-1\r\n if qipan[h][l] == 0:\r\n qipan[h][l] = 1\r\n \r\n #zuoshang\r\n if h == 0 or l == 0:\r\n pass\r\n elif qipan[h-1][l-1] == 1 and qipan[h][l-1] == 1 and qipan[h-1][l] == 1 : \r\n a += 1\r\n break\r\n #youxia\r\n if h == n-1 or l == m-1:\r\n pass\r\n elif qipan[h+1][l+1] == 1 and qipan[h][l+1] == 1 and qipan[h+1][l] == 1:\r\n a += 1\r\n break\r\n #youshang\r\n if h == 0 or l == m-1:\r\n pass\r\n elif qipan[h-1][l] == 1 and qipan[h][l+1] == 1 and qipan[h-1][l+1] == 1:\r\n a += 1\r\n break\r\n #zuoxia\r\n if h == n-1 or l == 0:\r\n pass\r\n elif qipan[h+1][l] == 1 and qipan[h][l-1] == 1 and qipan[h+1][l-1] == 1:\r\n a += 1\r\n break\r\nif a > 0:\r\n \r\n print(i+1)\r\n\r\nelse:\r\n print(0)", "n,m,k=map(int,input().split())\r\nnumbers=[]\r\nsteps=0\r\nfor p in range(n+2):\r\n number=[0 for p in range(m+2)]\r\n numbers.append(number)\r\nfor l in range(k):\r\n i,j=map(int,input().split()) \r\n numbers[i][j]=1\r\n x=numbers[i-1][j-1]+numbers[i-1][j]+numbers[i][j-1]+numbers[i][j]\r\n y=numbers[i-1][j]+numbers[i-1][j+1]+numbers[i][j]+numbers[i][j+1]\r\n z=numbers[i][j-1]+numbers[i][j]+numbers[i+1][j-1]+numbers[i+1][j]\r\n t=numbers[i][j]+numbers[i][j+1]+numbers[i+1][j]+numbers[i+1][j+1]\r\n if x==4 or y==4 or z==4 or t==4:\r\n steps = l+1\r\n break\r\nprint(steps)", "# http://codeforces.com/contest/508/submission/44603553\r\nn,m,k = map(int, input().split())\r\nmx = [(m+2)*[0] for i in range(n+2)]\r\n# if square 2 × 2 formed from black cells appears, and\r\n# cell (i, j) will upper-left, upper-right, bottom-left\r\n# or bottom-right of this squares.\r\ndef square_check(i,j):\r\n if mx[i][j+1] and mx[i+1][j] and mx[i+1][j+1]:\r\n return True\r\n if mx[i][j-1] and mx[i+1][j-1] and mx[i+1][j]:\r\n return True\r\n if mx[i-1][j] and mx[i-1][j+1] and mx[i][j+1]:\r\n return True\r\n if mx[i-1][j-1] and mx[i-1][j] and mx[i][j-1]:\r\n return True\r\n return False\r\n\r\nfor i in range(k):\r\n x,y = map(int, input().split())\r\n mx[x][y] = 1\r\n if square_check(x,y):\r\n print(i+1)\r\n break\r\nelse:\r\n print(0)", "n,m,k=map(int,input().split())\r\np=0\r\narray0=[[0]*(m+2) for i in range(n+2)]\r\nfor i in range(k):\r\n p+=1\r\n x,y=map(int,input().split())\r\n array0[x][y]=1\r\n u1=array0[x-1][y-1]+array0[x-1][y]+array0[x][y-1]\r\n u2=array0[x-1][y+1]+array0[x][y+1]+array0[x-1][y]\r\n u3=array0[x+1][y-1]+array0[x][y-1]+array0[x+1][y]\r\n u4=array0[x+1][y+1]+array0[x][y+1]+array0[x+1][y]\r\n if u1 ==3 or u2==3 or u3==3 or u4==3:\r\n print(p)\r\n break\r\nif p==k and u1!=3 and u2!=3 and u3!=3 and u4!=3:\r\n print(0)", "#author 沈天健 2300011417\r\nn,m,k=map(int,input().split())\r\nflag=[[False]*(m+2) for i in range(n+2)]\r\ndef check(x,y):\r\n if flag[x-1][y-1] and flag[x-1][y] and flag[x][y-1]:\r\n return True\r\n if flag[x-1][y+1] and flag[x-1][y] and flag[x][y+1]:\r\n return True\r\n if flag[x+1][y-1] and flag[x+1][y] and flag[x][y-1]:\r\n return True\r\n if flag[x+1][y+1] and flag[x+1][y] and flag[x][y+1]:\r\n return True\r\n return False\r\nfor i in range(k):\r\n x,y=map(int,input().split())\r\n flag[x][y]=True\r\n if check(x,y):\r\n print(i+1)\r\n break\r\nelse:\r\n print(\"0\")", "n, m, k = [int(t) for t in input().split()]\r\nmat = [[0] * (m + 2) for _ in range(n + 2)]\r\nflag = 0\r\n\r\ndef func(i, j):\r\n return mat[i][j] + mat[i][j + 1] + mat[i + 1][j] + mat[i + 1][j + 1] == 4\r\n\r\nfor time in range(k):\r\n i, j = [int(t) for t in input().split()]\r\n mat[i][j] = 1\r\n if func(i, j) or func(i, j - 1) or func(i - 1, j) or func(i - 1, j - 1):\r\n flag = 1\r\n print(time + 1)\r\n break\r\n\r\nif not flag: print(0)", "n, m, k = map(int, input().split())\r\npixels = set()\r\nfor move in range(1, k+1):\r\n i, j = map(int, input().split())\r\n pixels.add((i, j))\r\n for dx, dy in [(0, 0), (0, 1), (1, 0), (1, 1)]:\r\n if {(i-dx, j-dy), (i-dx, j+1-dy), (i+1-dx, j-dy), (i+1-dx, j+1-dy)}.issubset(pixels):\r\n print(move)\r\n exit(0)\r\nprint(0)", "import sys\r\n\r\nn, m, k = map(int, input().split())\r\n\r\ngrid = [[False] * (m + 2) for _ in range(n + 2)]\r\n\r\nfor move in range(k):\r\n i, j = map(int, input().split())\r\n grid[i][j] = True\r\n\r\n if (grid[i][j] and grid[i][j + 1] and grid[i + 1][j] and grid[i + 1][j + 1]) or \\\r\n (grid[i][j] and grid[i][j - 1] and grid[i + 1][j - 1] and grid[i + 1][j]) or \\\r\n (grid[i][j] and grid[i][j - 1] and grid[i - 1][j - 1] and grid[i - 1][j]) or \\\r\n (grid[i][j] and grid[i][j + 1] and grid[i - 1][j] and grid[i - 1][j + 1]):\r\n print(move + 1)\r\n sys.exit(0)\r\n\r\nelse:\r\n print(\"0\")", "#王铭健，工学院 2300011118\r\nf = lambda: map(int, input().split())\r\nn, m, k = f()\r\nmatrix = [[0 for i in range(m+2)] for j in range(n+2)]\r\n\r\n\r\ndef get(i, j):\r\n return matrix[i][j] and matrix[i+1][j] and matrix[i][j+1] and matrix[i+1][j+1]\r\n\r\n\r\nfor t in range(k):\r\n row, col = f()\r\n if matrix[row][col] == 0:\r\n matrix[row][col] = 1\r\n if get(row-1, col-1) or get(row-1, col) or get(row, col-1) or get(row, col):\r\n print(t + 1)\r\n exit(0)\r\nprint(\"0\")\r\n", "def black(s,i,j):\r\n global X\r\n global Y\r\n global step\r\n global num\r\n i-=1\r\n j-=1\r\n s[i][j]=1\r\n step+=1\r\n if i+1<=X-1 and j+1<=Y-1:\r\n if s[i+1][j+1]==1 and s[i][j+1]==1 and s[i+1][j] ==1:\r\n num=1\r\n if i-1>=0 and j+1<=Y-1:\r\n if s[i-1][j+1]==1 and s[i][j+1]==1 and s[i-1][j] ==1:\r\n num=1\r\n if i-1>=0 and j-1>=0:\r\n if s[i-1][j-1]==1 and s[i][j-1]==1 and s[i-1][j] ==1:\r\n num=1\r\n if i+1<=X-1 and j-1>=0:\r\n if s[i+1][j-1]==1 and s[i][j-1]==1 and s[i+1][j] ==1:\r\n num=1\r\n \r\nX,Y,step_=[int(x) for x in input().split()]\r\nstep=0\r\nnum=0\r\ns=[]\r\nfor j in range(X):\r\n m=[0]*Y\r\n s.append(m)\r\nfor i in range(step_):\r\n if num==0:\r\n x,y=[int(x) for x in input().split()]\r\n black(s,x,y)\r\n else:\r\n x,y=[int(x) for x in input().split()]\r\nif num==1:\r\n print(step)\r\nelse:\r\n print(0)", "def sq(x,y):\n if loc[x-1][y-1] and loc[x-1][y] and loc[x][y-1]:\n return True\n elif loc[x+1][y-1] and loc[x+1][y] and loc[x][y-1]:\n return True\n elif loc[x+1][y+1] and loc[x+1][y] and loc[x][y+1]:\n return True\n elif loc[x-1][y+1] and loc[x-1][y] and loc[x][y+1]:\n return True\n else:\n return False\n\nn,m,k=map(int,input().split())\nloc=[]\nfor i in range(n+2):\n l=[]\n for j in range(m+2):\n l.append(False)\n loc.append(l)\n\nfor a in range(1,k+1):\n x,y=map(int,input().split())\n loc[x][y]=True\n b=sq(x,y)\n if b:\n print(a)\n break\nif not b:\n print(0)\n\n", "n, m, k = map(int, input().split())\r\nmoves = {}\r\nindices = []\r\nfor step in range(k):\r\n i, j = map(int, input().split())\r\n indices.append([i,j])\r\n if f'{i}+{j}' not in moves:\r\n moves[f'{i}+{j}'] = step + 1\r\n else:\r\n moves[f'{i}+{j}'] = min(step+1, moves[f'{i}+{j}'])\r\n\r\n\r\ndef pixel_is_black(dic, lis):\r\n out = []\r\n for t in lis:\r\n x, y = t[0], t[1]\r\n if f'{x}+{y}' in dic and f'{x+1}+{y}' in dic and f'{x}+{y+1}' in dic and f'{x+1}+{y+1}' in dic :\r\n out.append(max(dic[f'{x}+{y}'],dic[f'{x+1}+{y}'],dic[f'{x}+{y+1}'],dic[f'{x+1}+{y+1}']))\r\n if out:\r\n return min(out)\r\n else:\r\n return 0\r\n\r\nprint(pixel_is_black(moves, indices))", "#author 沈天健 2300011417\r\nn,m,k=map(int,input().split())\r\nmatrix=[[False for __ in range(m+2)] for _ in range(n+2)]\r\nmove=[[1,1],[-1,1],[-1,-1],[1,-1]]\r\ndef check(x,y):\r\n for step in move:\r\n if matrix[x+step[0]][y+step[1]] and matrix[x+step[0]][y] and matrix[x][y+step[1]]:\r\n return True\r\n return False\r\nfor i in range(1,k+1):\r\n x,y=map(int,input().split())\r\n matrix[x][y]=True\r\n if(check(x,y)):\r\n print(i)\r\n break\r\nelse:\r\n print(\"0\")", "#梁慧婷 2300012153 生命科学学院\r\nimport sys\r\nn, m, k = map(int,sys.stdin.readline().split())\r\nmoves = dict()\r\nfor i in range(n+2):\r\n for j in range(m+2):\r\n moves[(i,j)] = 0\r\ndef check(i,j):\r\n if moves[(i+1,j)] == moves[(i,j+1)] == moves[(i+1,j+1)] == 1:\r\n return True\r\n if moves[(i-1,j-1)] == moves[(i-1,j)] == moves[(i,j-1)] == 1:\r\n return True\r\n if moves[(i-1,j)] == moves[(i-1,j+1)] == moves[(i,j+1)] == 1:\r\n return True\r\n if moves[(i+1,j)] == moves[(i+1,j-1)] == moves[(i,j-1)] == 1:\r\n return True\r\n\r\n return False\r\n\r\nfor x in range(k):\r\n i,j = map(int,sys.stdin.readline().split())\r\n moves[(i,j)] = 1\r\n if check(i,j):\r\n print(x+1)\r\n exit()\r\n\r\nelse:\r\n print(0)", "#王奕欢 2300012285\r\nl=input().split()\r\ns=set()\r\nsteps=dict()\r\nfor z in range(int(l[-1])):\r\n t=input().split()\r\n x,y=int(t[0]),int(t[1])\r\n if (x,y) not in s:\r\n s.add((x, y))\r\n steps[(x,y)]=z\r\n else:\r\n continue\r\n \r\nsign=[]\r\n \r\nfor (a,b) in s:\r\n if (a-1,b-1) in s and (a,b-1) in s and (a-1,b) in s:\r\n sign.append(max(steps[(a, b)], steps[(a - 1, b - 1)], steps[(a, b - 1)], steps[(a - 1, b)]))\r\n \r\n \r\nif not sign:\r\n print(0)\r\nelse:\r\n print(min(sign)+1)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Nov 14 01:35:44 2022\r\n\r\n@author: hp\r\n\"\"\"\r\n\r\nn,m,k=map(int,input().split())\r\nif k<4:\r\n print(0)\r\nelse:\r\n a=[[0]*(m+2) for i in range(0,n+2)]\r\n for j in range(1,4):\r\n x,y=map(int,input().split())\r\n a[x][y]=1\r\n h=0\r\n for j in range(4,k+1):\r\n x,y=map(int,input().split())\r\n a[x][y]=1\r\n b=a[x-1][y-1]+a[x-1][y]+a[x][y-1]\r\n c=a[x][y-1]+a[x+1][y-1]+a[x+1][y]\r\n d=a[x-1][y]+a[x-1][y+1]+a[x][y+1]\r\n e=a[x][y+1]+a[x+1][y]+a[x+1][y+1]\r\n if b==3 or c==3 or d==3 or e==3:\r\n h=j\r\n break\r\n else:\r\n continue\r\n print(h)", "[n,m,k]=[int(j) for j in input().split()]\r\nans=[0]*(n+2)\r\nflag=1\r\nans[0]=[0]*(m+2)\r\nans[n+1]=[0]*(m+2)\r\nfor i in range(n):\r\n ans[i+1]=[0]*(m+2)\r\nfor i in range(k):\r\n [a,b]=[int(j) for j in input().split()]\r\n ans[a][b]=1\r\n if(ans[a-1][b-1] and ans[a-1][b] and ans[a][b-1]):\r\n print(i+1)\r\n flag=0\r\n break\r\n if(ans[a+1][b-1] and ans[a+1][b] and ans[a][b-1]):\r\n print(i+1)\r\n flag=0\r\n break\r\n if(ans[a-1][b+1] and ans[a-1][b] and ans[a][b+1]):\r\n print(i+1)\r\n flag=0\r\n break\r\n if(ans[a+1][b+1] and ans[a+1][b] and ans[a][b+1]):\r\n print(i+1)\r\n flag=0\r\n break\r\nif(flag):\r\n print(0)", "n,m,k=map(int,input().split())\r\nans=[[0]*(m+2) for i in range(n+2)]\r\nfor i in range(k):\r\n a,b=map(int,input().split())\r\n ans[a][b]=1\r\n if ans[a][b]+ans[a-1][b-1]+ans[a-1][b]+ans[a][b-1]==4:\r\n print(i+1)\r\n break\r\n elif ans[a][b]+ans[a-1][b]+ans[a][b+1]+ans[a-1][b+1]==4:\r\n print(i+1)\r\n break\r\n elif ans[a][b]+ans[a][b-1]+ans[a+1][b-1]+ans[a+1][b]==4:\r\n print(i+1)\r\n break\r\n elif ans[a][b]+ans[a][b+1]+ans[a+1][b]+ans[a+1][b+1]==4:\r\n print(i+1)\r\n break\r\nelse:\r\n print(0)", "import sys\r\nm,n,k=map(int,input().split())\r\ns=[]\r\ns.append([0 for _ in range(n+2)])\r\nfor y in range(m):\r\n s.append([0 for _ in range(n+2)])\r\ns.append([0 for _ in range(n+2)])\r\n\r\ns1=[[int(x) for x in input().split()] for _ in range(k)]\r\n\r\nfor t in range(k):\r\n i=s1[t][0]\r\n j=s1[t][-1]\r\n a=s[i-1][j-1]+s[i-1][j]+s[i][j-1]\r\n b=s[i-1][j]+s[i-1][j+1]+s[i][j+1]\r\n c=s[i][j+1]+s[i+1][j+1]+s[i+1][j]\r\n d=s[i][j-1]+s[i+1][j]+s[i+1][j-1]\r\n if s[i][j]==0 and max(a,b,c,d)==3:\r\n print(t+1)\r\n sys.exit()\r\n else:\r\n s[i][j]=1\r\nprint(0)\r\n \r\n ", "def check(a,x,y):\r\n if a[x-1][y-1] and a[x-1][y] and a[x][y-1]: return True\r\n elif a[x+1][y-1] and a[x][y-1] and a[x+1][y]: return True\r\n elif a[x-1][y+1] and a[x-1][y] and a[x][y+1]: return True\r\n elif a[x+1][y+1] and a[x+1][y] and a[x][y+1]: return True\r\n else: return False\r\n\r\n\r\nn,m,k = map(int,input().split())\r\na = [[0]*(m+2) for _ in range(n+2)]\r\n\r\nfor ki in range(k):\r\n x,y = map(int,input().split()); a[x][y] = 1\r\n if check(a,x,y): \r\n print(ki+1); break\r\nelse: \r\n print(0)", "n,m,k=map(int,input().split())\nmatrix=[[0]*m for i in range(n)]\nw=0\nfor p in range(k):\n i,j=map(int,input().split())\n matrix[i-1][j-1]=1\n if 0<i<n and 0<j<m and matrix[i][j]==1 and matrix[i-1][j]==1 and matrix[i][j-1]==1:\n w=p+1\n break\n elif 0<i<n and 1<j<m+1 and matrix[i][j-2]==1 and matrix[i-1][j-2]==1 and matrix[i][j-1]==1:\n w=p+1\n break\n elif 1<i<n+1 and 0<j<m and matrix[i-2][j]==1 and matrix[i-1][j]==1 and matrix[i-2][j-1]==1:\n w=p+1\n break\n elif 1<i<n+1 and 1<j<m+1 and matrix[i-2][j-2]==1 and matrix[i-1][j-2]==1 and matrix[i-2][j-1]==1:\n w=p+1\n break\nprint(w)", "x = input()\r\ny = str(x).split()\r\ny = [int(i) for i in y]\r\nn = y[0]\r\nm = y[1]\r\nk = y[2]\r\nw = []\r\nfor _ in range(n):\r\n w.append([0]*m)\r\nv = 0\r\nfor __ in range(k):\r\n x = input()\r\n y = str(x).split()\r\n y = [int(i) for i in y]\r\n if v == 0:\r\n a = y[0] - 1\r\n b = y[1] - 1\r\n w[a][b] = 1\r\n if a < n - 1 and b < m - 1:\r\n ww = [w[a+1][b],w[a][b+1],w[a+1][b+1]]\r\n if 0 not in ww:\r\n v = __ + 1\r\n if a > 0 and b < m - 1:\r\n ww = [w[a-1][b],w[a][b+1],w[a-1][b+1]]\r\n if 0 not in ww:\r\n v = __ + 1\r\n if a < n -1 and b > 0:\r\n ww = [w[a+1][b],w[a][b-1],w[a+1][b-1]]\r\n if 0 not in ww:\r\n v = __ + 1\r\n if a > 0 and b > 0:\r\n ww = [w[a-1][b],w[a][b-1],w[a-1][b-1]]\r\n if 0 not in ww:\r\n v = __ + 1\r\nprint(v)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Oct 31 21:21:15 2023\r\n\r\n@author: 袁兆瑞\r\n\"\"\"\r\n\r\nn, m, k = map(int, input().split())\r\ngrid = [[0] * m for _ in range(n)]\r\nfound = False\r\nfor step in range(1, k + 1):\r\n i, j = map(int, input().split())\r\n grid[i - 1][j - 1] = 1\r\n if i > 1 and j > 1 and grid[i - 2][j - 2] and grid[i - 2][j - 1] and grid[i - 1][j - 2]:\r\n found = True\r\n break\r\n if i > 1 and j < m and grid[i - 2][j] and grid[i - 2][j - 1] and grid[i - 1][j]:\r\n found = True\r\n break\r\n if i < n and j > 1 and grid[i][j - 2] and grid[i][j - 1] and grid[i - 1][j - 2]:\r\n found = True\r\n break\r\n if i < n and j < m and grid[i][j] and grid[i][j - 1] and grid[i - 1][j]:\r\n found = True\r\n break\r\nif found:\r\n print(step)\r\nelse:\r\n print(0)\r\n", "'''程文奇 2100015898'''\r\nn,m,k=map(int,input().split())\r\nsteplist = [[0]*(m+2) for i in range(n+2)]\r\ndef f(steplist):\r\n for s in range(k):\r\n a, b = map(int, input().split())\r\n steplist[a][b]=1\r\n if steplist[a-1][b-1]==steplist[a][b-1]==steplist[a-1][b]==1 \\\r\n or steplist[a+1][b+1]==steplist[a][b+1]==steplist[a+1][b]==1 \\\r\n or steplist[a-1][b+1]==steplist[a][b+1]==steplist[a-1][b]==1 \\\r\n or steplist[a+1][b-1] == steplist[a][b-1] == steplist[a+1][b] == 1:\r\n return s+1\r\n break\r\n return 0\r\nprint(f(steplist))", "def check(r:int , c:int):\r\n x = [[0 , 1 , 1] , [0 , -1 , -1] , [0 , 1 , 1] , [0 , -1 , -1]]\r\n y = [[1 , 1 , 0] , [1 , 0 , 1] , [-1 , -1 , 0] ,[-1 , 0 , -1]]\r\n for i in range(4):\r\n if b[r + x[i][0]][c + y[i][0]] == 1 and b[r + x[i][1]][c + y[i][1]] == 1\\\r\n and b[r + x[i][2]][c + y[i][2]] == 1:\r\n return 1\r\n return 0\r\nn,m,k = map(int , input().split())\r\nflag = 0\r\nb = [[0 for _ in range(m + 2)] for x in range(n + 2)]\r\nfor i in range(k):\r\n r , c = map(int , input().split())\r\n b[r][c] = 1\r\n if check(r , c) and flag == 0:\r\n flag = i + 1\r\nif flag == 0:\r\n print(0)\r\nelse:\r\n print(flag)", "#2300015804\r\nn, m, k = map(int, input().split())\r\nmatr = [[0]*(m+2) for _ in range(n+2)]\r\nfor o in range(1,k+1):\r\n i, j = map(int, input().split())\r\n matr[i][j] = 1\r\n if max(matr[i-1][j-1]+matr[i-1][j]+matr[i][j-1],matr[i-1][j+1] + matr[i-1][j] + matr[i][j+1],\\\r\n matr[i+1][j-1] + matr[i+1][j] + matr[i][j-1],matr[i+1][j+1] + matr[i+1][j] + matr[i][j+1])== 3:\r\n print(o)\r\n break\r\nelse: print(0)", "m,n,k = map(int,input().split())\r\nflag = 1\r\ndef judge(x,y):\r\n if ((node[x-1][y-1]==1)and(node[x][y-1]==1)and(node[x-1][y]==1))or((node[x+1][y+1]==1)and(node[x][y+1]==1)and(node[x+1][y]==1))or((node[x-1][y+1]==1)and(node[x][y+1]==1)and(node[x-1][y]==1))or((node[x+1][y-1]==1)and(node[x][y-1]==1)and(node[x+1][y]==1)):\r\n return 1\r\nnode = [[0 for i in range(n+2)] for j in range(m+2)]\r\nnum = 1\r\nfor i in range(k):\r\n curnode = tuple(map(int,input().split()))\r\n node[curnode[0]][curnode[1]] =1\r\n if judge(curnode[0],curnode[1])==1:\r\n flag=0\r\n if flag==1:\r\n num+=1\r\nprint(num if flag==0 else 0)", "n,m,k=map(int,input().split())\r\ntrix=[[0]*(m+2) for _ in range(n+2)]\r\ny=0\r\nfor i in range(1,k+1):\r\n a,b=map(int,input().split())\r\n trix[a][b]=1\r\n if trix[a-1][b-1]+trix[a-1][b]+trix[a][b-1]+trix[a][b]==4 or\\\r\n trix[a][b-1]+trix[a][b]+trix[a+1][b-1]+trix[a+1][b]==4 or\\\r\n trix[a-1][b]+trix[a-1][b+1]+trix[a][b]+trix[a][b+1]==4 or\\\r\n trix[a][b]+trix[a][b+1]+trix[a+1][b]+trix[a+1][b+1]==4:\r\n print(i)\r\n y+=1\r\n break\r\nif y==0:\r\n print(0)", "n, m, k = map(int, input().split())\r\nfield = [[0 for i in range(m+2)] for j in range(n+2)]\r\nflag = True\r\nfor i in range(k):\r\n x, y = map(int, input().split())\r\n field[x][y] = 1\r\n if field[x-1][y-1]+field[x-1][y]+field[x][y-1] == 3 or field[x+1][y-1]+field[x+1][y]+field[x][y-1] == 3 or field[\r\n x-1][y+1]+field[x-1][y]+field[x][y+1] == 3 or field[x+1][y+1]+field[x+1][y]+field[x][y+1] == 3:\r\n print(i+1)\r\n flag = False\r\n break\r\nif flag:\r\n print(0)", "n,m,k=map(int,input().split())\r\nta=[[0]*(m+2) for _ in range(n+2)]\r\ntemp1=((1,0),(1,1),(0,1))\r\ntemp2=((-1,0),(-1,1),(0,1))\r\ntemp3=((1,0),(1,-1),(0,-1))\r\ntemp4=((-1,0),(-1,-1),(0,-1))\r\nfor i in range(1,k+1):\r\n r,c=map(int,input().split())\r\n ta[r][c]=1\r\n t1=0\r\n for j in temp1:\r\n r1=r+j[0];c1=c+j[1]\r\n t1+=ta[r1][c1]\r\n if t1==3:\r\n print(i)\r\n break\r\n t2=0\r\n for j in temp2:\r\n r1=r+j[0];c1=c+j[1]\r\n t2+=ta[r1][c1]\r\n if t2==3:\r\n print(i)\r\n break\r\n t3=0\r\n for j in temp3:\r\n r1=r+j[0];c1=c+j[1]\r\n t3+=ta[r1][c1]\r\n if t3==3:\r\n print(i)\r\n break\r\n t4=0\r\n for j in temp4:\r\n r1=r+j[0];c1=c+j[1]\r\n t4+=ta[r1][c1]\r\n if t4==3:\r\n print(i)\r\n break\r\nelse:print(0)", "def check(i,j):\r\n if matrix[i-1][j-1] and matrix[i-1][j] and matrix[i][j-1]:\r\n return True\r\n if matrix[i-1][j] and matrix[i-1][j+1] and matrix[i][j+1]:\r\n return True\r\n if matrix[i][j-1] and matrix[i+1][j-1] and matrix[i+1][j]:\r\n return True\r\n if matrix[i][j+1] and matrix[i+1][j] and matrix[i+1][j+1]:\r\n return True\r\n return False\r\nstate=0\r\nn,m,k=[int(i) for i in input().split()]\r\nmatrix=[[0 for i in range(m+2)]for j in range(n+2)]\r\nfor z in range(k):\r\n i,j=[int(i) for i in input().split()]\r\n matrix[i][j]=1\r\n if check(i,j):\r\n state=1\r\n print(z+1)\r\n break\r\nif state==0:\r\n print(0)", "def check_lose(i, j, mx):\r\n if mx[i-1][j-1] == mx[i-1][j] == mx[i][j-1] == 1 or\\\r\n mx[i-1][j] == mx[i-1][j+1] == mx[i][j+1] == 1 or\\\r\n mx[i][j-1] == mx[i+1][j-1] == mx[i+1][j] == 1 or\\\r\n mx[i][j+1] == mx[i+1][j] == mx[i+1][j+1] == 1:\r\n return 1\r\n return 0\r\n\r\n\r\ndef play(mx, k):\r\n for move in range(k):\r\n i, j = map(int, input().split())\r\n mx[i][j] = 1\r\n if check_lose(i, j, mx):\r\n return move + 1\r\n return 0\r\n\r\n\r\nn, m, k = map(int, input().split())\r\nmx = [[0] * (m + 2) for _ in range(n + 2)]\r\nprint(play(mx, k))", "n,m,k = map(int,input().split())\r\nf = [[0]*(m+2) for _ in range(n+2)] #m=x-axis---c, n=y-axis---r\r\ndef check(x,y):\r\n if all((f[x][y+1],f[x+1][y],f[x+1][y+1])): #left-up\r\n return 1\r\n if all((f[x][y+1],f[x-1][y],f[x-1][y+1])): #left-bottom\r\n return 1\r\n if all((f[x][y-1],f[x+1][y],f[x+1][y-1])): #right-up\r\n return 1\r\n if all((f[x][y-1],f[x-1][y],f[x-1][y-1])): #right-bottom\r\n return 1\r\n return 0\r\nfor i in range(k):\r\n x,y = map(int,input().split())\r\n f[x][y] = 1\r\n if check(x,y): print(i+1) ; break\r\nelse: print(0)", "n,m,k = [int(x) for x in input().split()]\r\nList = []\r\nt = 0\r\nfor i in range(n+2):\r\n List1 = [0 for j in range(m+2)]\r\n List.append(List1)\r\nfor i in range(k):\r\n a,b = [int(x) for x in input().split()]\r\n if List[a][b] == 0:\r\n List[a][b] = 1\r\n if List[a-1][b-1]+List[a][b-1]+List[a-1][b] == 3 or List[a][b+1]+List[a-1][b]+List[a-1][b+1] == 3 or List[a+1][b-1]+List[a+1][b]+List[a][b-1] == 3 or List[a][b+1]+List[a+1][b+1]+List[a+1][b] == 3:\r\n print(i+1)\r\n break\r\n else:\r\n t = t + 1\r\nif t == k:\r\n print(0)", "#23n2200017708\nn, m , k = map(int, input().split())\nmatrix = []\nz = True\nl = 0\n\nfor i in range(n+2):\n matrix.append([])\n for j in range(m+2):\n matrix[i].append(0)\n\ndef f(ma, x, y):\n z_1 = ma[x][y] == 1 and ma[x-1][y] == 1 and ma[x][y-1] == 1 and ma[x-1][y-1] == 1\n z_2 = ma[x][y] == 1 and ma[x-1][y] == 1 and ma[x][y+1] == 1 and ma[x-1][y+1] == 1\n z_3 = ma[x][y] == 1 and ma[x][y-1] == 1 and ma[x+1][y] == 1 and ma[x+1][y-1] == 1\n z_4 = ma[x][y] == 1 and ma[x+1][y] == 1 and ma[x][y+1] == 1 and ma[x+1][y+1] == 1\n if z_1 or z_2 or z_3 or z_4:\n return(True)\n return(False)\n\nfor i in range(k):\n a, b = map(int, input().split())\n matrix[a][b] = 1\n if f(matrix, a, b) and z:\n l = i + 1\n z = False\n\nprint(l)\n", "rows,columns,moves = [int(x) for x in input().split()]\r\nmatrix = []\r\nfor x in range(columns):\r\n matrix.append ([])\r\n for y in range(rows):\r\n matrix[x].append(0)\r\ndef check(step_x,step_y):\r\n matrix[step_x-1][step_y-1] = 1\r\n if (step_x - 1) >= 1 and matrix[step_x-2][step_y-1] == 1:\r\n if (step_y-1) >=1 and matrix[step_x-2][step_y-2] == 1:\r\n if matrix[step_x-1][step_y-2] == 1:\r\n return \"lose\"\r\n if (step_y-1) < (rows-1) and matrix[step_x-2][step_y] == 1:\r\n if matrix[step_x-1][step_y] == 1:\r\n return \"lose\"\r\n elif (step_x - 1) < (columns-1) and matrix[step_x][step_y-1] == 1:\r\n if (step_y-1) >=1 and matrix[step_x][step_y-2] == 1:\r\n if matrix[step_x-1][step_y-2] == 1:\r\n return \"lose\"\r\n if (step_y-1) < (rows-1) and matrix[step_x][step_y] == 1:\r\n if matrix[step_x-1][step_y] == 1:\r\n return \"lose\"\r\ntest = 0\r\nfor _ in range(moves):\r\n a,b = [int(x) for x in input().split()]\r\n if check(b,a) == \"lose\":\r\n test = 1\r\n print(_+1)\r\n break\r\nif test == 0:\r\n print(0)\r\n ", "h, l, n = map(int, input().split())\r\nchange = [list(map(int, input().split())) for i in range(n)]\r\nmatrix = [[0] + [0 for x in range(l)] +[0] for y in range(h)]\r\nmatrix.append([0]*(l+2))\r\nmatrix.insert(0,[0]*(l+2))\r\njud = 0\r\nfor i in range(n):\r\n matrix[change[i][0]][change[i][1]] = 1\r\n around_1 = matrix[change[i][0]][change[i][1] - 1] + matrix[change[i][0] - 1][change[i][1] - 1] + matrix[change[i][0] - 1][change[i][1]]\r\n around_2 = matrix[change[i][0]][change[i][1] + 1] + matrix[change[i][0] - 1][change[i][1] + 1] + matrix[change[i][0] - 1][change[i][1]]\r\n around_3 = matrix[change[i][0]][change[i][1] + 1] + matrix[change[i][0] + 1][change[i][1] + 1] + matrix[change[i][0] + 1][change[i][1]]\r\n around_4 = matrix[change[i][0]][change[i][1] - 1] + matrix[change[i][0] + 1][change[i][1] - 1] + matrix[change[i][0] + 1][change[i][1]]\r\n if around_1 < 3 and around_2 < 3 and around_3 <3 and around_4 < 3:\r\n jud += 1\r\n continue\r\n else:\r\n print(i + 1)\r\n break\r\n\r\nif jud == n:\r\n print(0)", "n,m,k = map(int,input().split())\r\nscreen = []\r\nflag = 0\r\nF = 0\r\nfor _ in range(n+2):\r\n screen.append([0] * (m + 2))\r\nfor _ in range(k):\r\n x,y = map(int,input().split())\r\n screen[x][y] = 1\r\n for i in range(x - 1,x + 1):\r\n if F == 0:\r\n for j in range(y - 1,y + 1):\r\n if screen[i][j]&screen[i + 1][j]&screen[i][j + 1]&screen[i + 1][j + 1] == 1:\r\n print(_ + 1)\r\n F = 1\r\n break\r\n else:\r\n flag += 1\r\n else:\r\n break\r\nif flag == k * 4:\r\n print('0')", "d={}\r\ndef check(i,j):\r\n cond1=(i+1,j) in d and (i,j+1) in d and (i+1,j+1) in d\r\n cond2 = (i + 1, j) in d and (i, j - 1) in d and (i + 1, j - 1) in d\r\n cond3 = (i - 1, j) in d and (i, j + 1) in d and (i - 1, j + 1) in d\r\n cond4 = (i - 1, j) in d and (i, j - 1) in d and (i - 1, j - 1) in d\r\n if cond1 or cond2 or cond3 or cond4:\r\n return True\r\n else:\r\n return False\r\nn,m,k=map(int,input().split())\r\nfor _ in range(k):\r\n i,j=map(int,input().split())\r\n if check(i,j):\r\n print(_+1)\r\n break\r\n else:\r\n d[(i,j)]=1\r\nelse:\r\n print(0)\r\n", "n,m,k=map(int,input().split())\r\nl=[[0]*(m+2) for _ in range(n+2)]\r\nbbb=False\r\ndef check(x,y):\r\n if l[x-1][y]==1 and l[x][y-1]==1 and l[x-1][y-1]==1:\r\n return True\r\n elif l[x-1][y]==1 and l[x][y+1]==1 and l[x-1][y+1]==1:\r\n return True\r\n elif l[x+1][y]==1 and l[x][y-1]==1 and l[x+1][y-1]==1:\r\n return True\r\n elif l[x+1][y]==1 and l[x][y+1]==1 and l[x+1][y+1]==1:\r\n return True\r\n else:\r\n return False\r\nfor __ in range(k):\r\n a,b=map(int,input().split())\r\n l[a][b]=1\r\n if check(a,b) and bbb==False:\r\n print(__+1)\r\n bbb=True\r\nif not bbb:\r\n print(0)", "n,m,k = map(int,input().split())\r\nmatrix = [[False]*m for i in range(n)]\r\nanswer = 0\r\nfor x in range(k):\r\n i,j = map(int,input().split())\r\n matrix[i-1][j-1] = True\r\n if i >= 2 and j >= 2:\r\n if matrix[i-2][j-1] and matrix[i-2][j-2] and matrix[i-1][j-2]:\r\n answer = x+1\r\n break\r\n if i >= 2 and j <= m-1:\r\n if matrix[i-2][j-1] and matrix[i-2][j] and matrix[i-1][j]:\r\n answer = x+1\r\n break\r\n if i <= n-1 and j >= 2:\r\n if matrix[i][j-1] and matrix[i][j-2] and matrix[i-1][j-2]:\r\n answer = x+1\r\n break\r\n if i <= n-1 and j <= m-1:\r\n if matrix[i][j-1] and matrix[i][j] and matrix[i-1][j]:\r\n answer = x+1\r\n break\r\nprint(answer)", "def lose(i, j):\n if (board[i][j - 1] and board[i - 1][j] and board[i - 1][j - 1]) or \\\n (board[i][j + 1] and board[i - 1][j] and board[i - 1][j + 1]) or \\\n (board[i][j - 1] and board[i + 1][j] and board[i + 1][j - 1]) or \\\n (board[i][j + 1] and board[i + 1][j] and board[i + 1][j + 1]):\n return True\n return False\n\nn, m, k = map(int, input().split())\nboard = [[0] * (m + 2) for r in range(n + 2)]\n\nfor i in range(k):\n r, c = map(int, input().split())\n if lose(r, c):\n print(i + 1)\n break\n board[r][c] = 1\nelse:\n print(0)\n", "n,m,k=[int(i) for i in input().split()]\r\nboard=[[0]*(m+2) for i in range(n+2)]\r\n\r\ndef check(x,y):\r\n if board[x-1][y-1]==1 and board[x-1][y]==1 and board[x][y-1]==1:\r\n return True\r\n if board[x-1][y]==1 and board[x-1][y+1]==1 and board[x][y+1]==1:\r\n return True\r\n if board[x][y-1]==1 and board[x+1][y-1]==1 and board[x+1][y]==1:\r\n return True\r\n if board[x][y+1]==1 and board[x+1][y]==1 and board[x+1][y+1]==1:\r\n return True\r\n return False\r\n\r\nfor i in range(k):\r\n x,y=[int(i) for i in input().split()]\r\n board[x][y]=1\r\n if check(x,y):\r\n print(i+1)\r\n break\r\nelse:\r\n print(\"0\")\r\n \r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Oct 18 16:27:01 2023\r\n\r\n@author: 15110\r\n\"\"\"\r\n\r\nn,m,k = map(int,input().split())\r\nmoves = []\r\nfor i in range(k):\r\n x,y = map(int,input().split())\r\n moves.append((x-1,y-1)) #将每一步的xy坐标以数组形式储存(从零开始)\r\n\r\nfield = [[0 for i in range(m)] for j in range(n)] #创建矩阵\r\n\r\nfor row in field:\r\n row.insert(0, 0)\r\n row.append(0)\r\nfield.insert(0, [0 for i in range(m+2)])\r\nfield.append([0 for i in range(m+2)]) #加保护圈,但需注意相应的坐标改变\r\n\r\nre = 0 #判断是否“失败”\r\nfor i in range(k):\r\n x,y = moves[i][0:2]\r\n if field[x+1][y+1] == 1: #如果已被涂过，则跳过该步\r\n continue\r\n else:\r\n field[x+1][y+1] = 1 #判断相邻四个是否全为1\r\n if field[x][y]+field[x][y+1]+field[x+1][y]+field[x+1][y+1] == 4: \r\n re = 1\r\n print(i+1)\r\n break\r\n elif field[x][y+2]+field[x][y+1]+field[x+1][y+2]+field[x+1][y+1] == 4:\r\n re = 1\r\n print(i+1)\r\n break\r\n elif field[x+1][y]+field[x+2][y]+field[x+2][y+1]+field[x+1][y+1] == 4:\r\n re = 1\r\n print(i+1)\r\n break\r\n elif field[x+2][y+2]+field[x+2][y+1]+field[x+1][y+2]+field[x+1][y+1] == 4:\r\n re = 1\r\n print(i+1)\r\n break\r\n\r\nif re == 0:\r\n print(0)\r\n \r\n \r\n \r\n \r\n\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Oct 18 13:03:07 2023\r\n\r\n@author: gzk16\r\n\"\"\"\r\n\r\nn, m, k = map(int, input().split())\r\n\r\n# Create a 2D grid with all pixels colored white\r\nfield = [[0] * m for _ in range(n)]\r\n\r\nfor move in range(k):\r\n i, j = map(int, input().split())\r\n i -= 1 # Convert 1-indexed to 0-indexed\r\n j -= 1\r\n\r\n # Update the pixel to black\r\n field[i][j] = 1\r\n\r\n # Check if a 2x2 square consisting of black pixels is formed\r\n if i > 0 and j > 0 and field[i-1][j-1] == field[i-1][j] == field[i][j-1] == 1:\r\n print(move+1)\r\n break\r\n\r\n if i > 0 and j < m-1 and field[i-1][j] == field[i-1][j+1] == field[i][j+1] == 1:\r\n print(move+1)\r\n break\r\n\r\n if i < n-1 and j > 0 and field[i][j-1] == field[i+1][j-1] == field[i+1][j] == 1:\r\n print(move+1)\r\n break\r\n\r\n if i < n-1 and j < m-1 and field[i+1][j] == field[i+1][j+1] == field[i][j+1] == 1:\r\n print(move+1)\r\n break\r\nelse:\r\n print(0)", "def zuoshang(l,i,j):\r\n if l[i][j]+l[i-1][j-1]+l[i-1][j]+l[i][j-1]==4:\r\n return True\r\n else:\r\n return False\r\n\r\ndef youshang(l,i,j):\r\n if l[i][j]+l[i-1][j+1]+l[i-1][j]+l[i][j+1]==4:\r\n return True\r\n else:\r\n return False\r\n\r\ndef zuoxia(l,i,j):\r\n if l[i][j]+l[i+1][j-1]+l[i+1][j]+l[i][j-1]==4:\r\n return True\r\n else:\r\n return False\r\n\r\ndef youxia(l,i,j):\r\n if l[i][j]+l[i+1][j+1]+l[i+1][j]+l[i][j+1]==4:\r\n return True\r\n else:\r\n return False\r\n\r\nn, m, k = map(int, input().split())\r\ncol = [0] * (m+2)\r\nmat = [col[:] for _ in range(n+2)]\r\nflag = k\r\n\r\nfor step in range(k):\r\n i, j = map(int, input().split())\r\n mat[i][j] = 1\r\n\r\n if zuoshang(mat, i, j) or youshang(mat, i, j) or zuoxia(mat, i, j) or youxia(mat, i, j):\r\n print(step+1)\r\n break\r\n else:\r\n flag -= 1\r\n\r\nif flag == 0:\r\n print(0)", "n,m,k=map(int,input().split())\r\nli=[[0]*(m+2)]+[[0]*(m+2) for i in range(n)]+[[0]*(m+2)]\r\ndef check (r,c):\r\n # left up:\r\n if li[r][c-1]>0 and li[r-1][c]>0 and li[r-1][c-1]>0:\r\n return 1\r\n elif li[r][c+1]>0 and li[r-1][c]>0 and li[r-1][c+1]>0:\r\n return 1\r\n elif li[r][c-1]>0 and li[r+1][c]>0 and li[r+1][c-1]>0:\r\n return 1\r\n elif li[r][c+1]>0 and li[r+1][c]>0 and li[r+1][c+1]>0:\r\n return 1\r\n return 0\r\nflag=0\r\nfor i in range(k):\r\n r,c=map(int,input().split())\r\n li[r][c]+=1\r\n if not flag and check(r,c):\r\n flag=1;print(i+1)\r\nif not flag:\r\n print(0)", "n,m,k=map(int,input().split())\r\nt=[[0]*(n+2) for i in range(m+2)]\r\nfor i in range(k):\r\n n,m=map(int,input().split())\r\n t[m][n]=1\r\n c=t[m][n]\r\n if c==t[m-1][n]:\r\n if c==t[m][n-1]:\r\n if c==t[m-1][n-1]:\r\n print(i+1)\r\n break\r\n if c==t[m][n+1]:\r\n if c==t[m-1][n+1]:\r\n print(i+1)\r\n break\r\n if c==t[m+1][n]:\r\n if c==t[m][n-1]:\r\n if c==t[m+1][n-1]:\r\n print(i+1)\r\n break\r\n if c==t[m][n+1]:\r\n if c==t[m+1][n+1]:\r\n print(i+1)\r\n break\r\nelse:\r\n print(0)\r\n", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Tue Oct 17 17:50:38 2023\n\n@author: huangxiaoyuan\n\"\"\"\n\n#学会加保护圈！！！！学会如何判断题目条件！！不要for-in套for-in！！！不然费时费力还写不出代码！\n#此题还有一个关键思路，就是当出现正方形黑块时，一定包含最先加上的\nn,m,k=map(int,input().split())\nmat=[]\nfor i in range(m+2):#m是行数，不要混\n mat.append([0 for i in range(n+2)])\n \ndef judge(x,y):#判断是否赢得游戏\n if mat[x][y+1] and mat[x+1][y] and mat[x+1][y+1]:#要习惯这种True省略的写法\n return True\n elif mat[x][y+1] and mat[x-1][y+1] and mat[x-1][y]:\n return True\n elif mat[x][y-1] and mat[x+1][y-1] and mat[x+1][y]:\n return True\n elif mat[x][y-1] and mat[x-1][y-1] and mat[x-1][y]:\n return True\n else:\n return False\n\nfor i in range(k):\n a,b=map(int,input().split())\n mat[b][a]=1\n if judge(b,a):\n print(i+1)\n break#注意这里的break可以直接就终止for-in循环\nelse:\n print(0)\n \n\n", "\r\n#false表示白，true表示黑\r\ndef check(new_matrix,i_,j_):\r\n '''检验(i_,j_)附近是否存在2x2黑格子'''\r\n flag=False\r\n if new_matrix[i_+1][j_+1] and new_matrix[i_][j_+1] and new_matrix[i_+1][j_]:\r\n flag=True#右下\r\n return flag\r\n if new_matrix[i_-1][j_-1] and new_matrix[i_][j_-1] and new_matrix[i_-1][j_]:\r\n flag=True#左上\r\n return flag\r\n if new_matrix[i_-1][j_+1] and new_matrix[i_-1][j_] and new_matrix[i_][j_+1]:\r\n flag=True#右上\r\n return flag\r\n if new_matrix[i_+1][j_-1] and new_matrix[i_][j_-1] and new_matrix[i_+1][j_]:\r\n flag=True#左下\r\n return flag\r\n return flag\r\n\r\nn,m,k=map(int,input().split())\r\nmatrice=[[False]*m for _ in range(n)]\r\nnewmatrix=[[False] * (m + 2)]+[[False] + lines + [False] for lines in matrice]+ [[False] * (m + 2)]\r\nnote=True\r\nfor move in range(1,k+1):\r\n i,j=map(int,input().split())\r\n if not newmatrix[i][j]:#检验是否已经涂黑，防止重复check\r\n newmatrix[i][j]=True\r\n if check(newmatrix,i,j):\r\n print(move)\r\n note=False\r\n break\r\nif note:\r\n print(0)\r\n\r\n\r\n", "n,m,k =map(int,input().split())\r\nmx=[]\r\nmx.append([0]*(m+2))\r\nfor _ in range(n):\r\n mx.append([0]+[1]*m+[0])\r\nmx.append([0]*(m+2))\r\ndef judge(i,j):\r\n if mx[i+1][j]==2 and mx[i+1][j+1]==2 and mx[i][j+1]==2:\r\n return True\r\n if mx[i+1][j]==2 and mx[i][j-1]==2 and mx[i+1][j-1]==2:\r\n return True\r\n if mx[i-1][j]==2 and mx[i-1][j+1]==2 and mx[i][j+1]==2:\r\n return True\r\n if mx[i-1][j-1]==2 and mx[i][j-1]==2 and mx[i-1][j]==2:\r\n return True\r\n else:\r\n return False\r\nr=True\r\nfor _ in range(k):\r\n i,j=map(int,input().split())\r\n mx[i][j]=2\r\n if judge(i,j):\r\n print(_+1)\r\n r=False\r\n break\r\nif r:\r\n print(0)", "n,m,k = [int(x) for x in input().split()]\r\na = [[0]*1005 for i in range(1002)]\r\n\r\ndef judge(x,y):\r\n if a[x-1][y-1] and a[x-1][y] and a[x][y-1]:\r\n return 1\r\n if a[x-1][y+1] and a[x-1][y] and a[x][y+1]:\r\n return 1\r\n if a[x+1][y+1] and a[x+1][y] and a[x][y+1]:\r\n return 1\r\n if a[x+1][y-1] and a[x+1][y] and a[x][y-1]:\r\n return 1\r\n return 0\r\n\r\nflag = 1\r\nfor i in range(1,k+1):\r\n x,y = [int(x) for x in input().split()]\r\n if not a[x][y]:\r\n a[x][y]=1\r\n if flag and k>3 and judge(x,y):\r\n print(i)\r\n flag = 0\r\nif flag:\r\n print(0)", "def distinguish(a,b):\r\n for j in range(4):\r\n if P[a + ds[j//2]][b]*P[a][b + ds[j%2]]*P[a + ds[j//2]][b + ds[j%2]]:return True\r\n return False\r\nn,m,k=map(int,input().split())\r\nP,ds= [[0]*(m+2) for i in range(n+2)],[-1,1]\r\nfor x in range(k):\r\n a,b=map(int,input().split())\r\n P[a][b]=1\r\n if distinguish(a,b):\r\n print(x+1)\r\n break\r\nelse:\r\n print(0)", "# pixel painting\r\ndef check(i, j):\r\n if matrix[i][j + 1] and matrix[i + 1][j] and matrix[i + 1][j + 1]:\r\n return True\r\n if matrix[i][j - 1] and matrix[i + 1][j] and matrix[i + 1][j - 1]:\r\n return True\r\n if matrix[i][j + 1] and matrix[i - 1][j] and matrix[i - 1][j + 1]:\r\n return True\r\n if matrix[i][j - 1] and matrix[i - 1][j] and matrix[i - 1][j - 1]:\r\n return True\r\n return False\r\n\r\nn, m, k = map(int, input().split())\r\n\r\nmatrix = [[0 for x in range(m + 2)] for y in range(n + 2)]\r\nflag = 0\r\nfor t in range(k):\r\n i, j = map(int, input().split())\r\n matrix[i][j] = 1\r\n if check(i, j):\r\n flag = 1\r\n print(t + 1)\r\n break\r\n\r\nif flag == 0:\r\n print(0)\r\n", "n, m, k = map(int, input().split())\r\npixels = [[0] * (m + 2) for _ in range(n + 2)]\r\nmoves = []\r\n\r\n\r\ndef check_square(i, j):\r\n return (\r\n pixels[i][j] + pixels[i][j + 1] + pixels[i + 1][j] + pixels[i + 1][j + 1] == 4\r\n )\r\n\r\nfor move in range(1, k + 1):\r\n i, j = map(int, input().split())\r\n pixels[i][j] = 1\r\n\r\n if (\r\n check_square(i, j)\r\n or check_square(i - 1, j)\r\n or check_square(i, j - 1)\r\n or check_square(i - 1, j - 1)\r\n ):\r\n print(move)\r\n break\r\nelse:\r\n print(0)\r\n", "n, m, k = map(int, input().split())\r\n\r\na = []\r\n\r\nfor _ in range(n):\r\n a.append([0 for _ in range(m)])\r\n \r\nfor b in range(k):\r\n i, j = map(int, input().split())\r\n if a[i-1][j-1] == 0:\r\n a[i-1][j-1] = b + 1\r\n \r\nc = 0\r\n\r\nfor e in range(1, n):\r\n for f in range(1, m):\r\n if a[e-1][f-1] != 0 and a[e][f-1] != 0 and a[e-1][f] != 0 and a[e][f] != 0:\r\n if c > max(a[e-1][f-1], a[e][f-1], a[e-1][f], a[e][f]) or c == 0:\r\n c = max(a[e-1][f-1], a[e][f-1], a[e-1][f], a[e][f])\r\n\r\nprint(c)\r\n", "n, m, k = map(int, input().split())\r\nmx = [(m + 2) * [0] for i in range(n + 2)]\r\n\r\n\r\ndef square_check(i, j):\r\n if mx[i][j + 1] and mx[i + 1][j] and mx[i + 1][j + 1]:\r\n return True\r\n if mx[i][j - 1] and mx[i + 1][j - 1] and mx[i + 1][j]:\r\n return True\r\n if mx[i - 1][j] and mx[i - 1][j + 1] and mx[i][j + 1]:\r\n return True\r\n if mx[i - 1][j - 1] and mx[i - 1][j] and mx[i][j - 1]:\r\n return True\r\n return False\r\n\r\n\r\nfor i in range(k):\r\n x, y = map(int, input().split())\r\n mx[x][y] = 1\r\n if square_check(x, y):\r\n print(i + 1)\r\n break\r\nelse:\r\n print(0)", "n, m, k = map(int, input().split())\r\nfield = [[0]*(m+2) for r in range(n+2)]\r\nfor move in range(k):\r\n i, j = map(int, input().split())\r\n field[i][j] = 1\r\n if field[i][j+1]*field[i-1][j+1]*field[i-1][j] \\\r\n + field[i-1][j]*field[i-1][j-1]*field[i][j-1] \\\r\n + field[i][j-1]*field[i+1][j-1]*field[i+1][j] \\\r\n + field[i+1][j]*field[i+1][j+1]*field[i][j+1] > 0:\r\n print(move+1)\r\n break\r\nelse:\r\n print(0)\r\n", "drow=[[-1,-1,0,0],[-1,-1,0,0],[0,0,1,1],[0,0,1,1]]\r\ndcolumn=[[-1,0,-1,0],[0,1,0,1],[-1,0,-1,0],[0,1,0,1]]\r\n\r\ndef check(x,y):\r\n for i in range(4):\r\n value=1\r\n for j in range(4):\r\n row=x+drow[i][j]\r\n column=y+dcolumn[i][j]\r\n if a[row][column]==0:\r\n value=0\r\n if value:\r\n return 1\r\n\r\nn,m,k=map(int,input().split())\r\na=[[0 for i in range(m+2)] for j in range(n+2)]\r\nval=1\r\nfor kk in range(k):\r\n i,j=map(int,input().split())\r\n a[i][j]=1\r\n if check(i,j):\r\n print(kk+1)\r\n val=0\r\n break\r\nif val:\r\n print(0)", "n, m, k = map(int, input().split())\r\na = [[0] * (m + 2) for i in range(n + 2)]\r\nfor c in range(k):\r\n i, j = map(int, input().split())\r\n i -= 1\r\n j -= 1\r\n a[i][j] = 1\r\n for i1 in range(i - 1, i + 1):\r\n for j1 in range(j - 1, j + 1):\r\n if a[i1][j1] == a[i1 + 1][j1 + 1] == a[i1 + 1][j1] == a[i1][j1 + 1] == 1:\r\n print(c + 1)\r\n exit()\r\nprint(0)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Oct 19 16:18:10 2023\r\n\r\n@author: 苏柔德 2300011012\r\n\"\"\"\r\nn,m,k=map(int,input().split())\r\nx=[[0]*(m+2) for __ in range(n+2)]\r\nflag=0\r\n\r\ndef test(row,col):\r\n return x[row][col] and x[row+1][col] and x[row][col+1] and x[row+1][col+1]\r\n\r\nfor _ in range(k):\r\n i,j=map(int,input().split())\r\n x[i][j]=1\r\n if test(i,j) or test(i,j-1) or test(i-1,j) or test(i-1,j-1):\r\n flag=_+1\r\n break\r\nprint(flag)", "n, m, k = [int(x) for x in input().split()]\r\nmatrix = []\r\nfor i in range(n+3):\r\n matrix.append([0]*(m+3))\r\ntimes = 0\r\nending = []\r\nfor move in range(k):\r\n i, j = [int(x) for x in input().split()]\r\n matrix[i][j] = 1\r\n if matrix[i-1][j-1] == matrix[i][j-1] == matrix[i-1][j] == 1:\r\n ending.append(move + 1)\r\n continue\r\n elif matrix[i-1][j] == matrix[i-1][j+1] == matrix[i][j+1] == 1:\r\n ending.append(move + 1)\r\n continue\r\n elif matrix[i+1][j-1] == matrix[i+1][j] == matrix[i][j-1] == 1:\r\n ending.append(move + 1)\r\n continue\r\n elif matrix[i+1][j] == matrix[i+1][j+1] == matrix[i][j+1] == 1:\r\n ending.append(move + 1)\r\n continue\r\n times += 1\r\nif times == k:\r\n print(0)\r\nelse:\r\n print(ending[0])", "import sys\r\npailie = [[[-1,-1], [-1,0], [0,-1]],\r\n [[-1,1], [-1,0], [0,1]],\r\n [[1,-1], [1,0], [0,-1]],\r\n [[1,1], [1,0], [0,1]]]\r\n\r\nn, m, k = map(int, input().split())\r\na = [[0]*m for i in range(n)]\r\nfor i in range(k):\r\n x, y = map(int, input().split())\r\n flag = 0\r\n x = x - 1\r\n y = y - 1\r\n a[x][y] = 1\r\n for k in pailie:\r\n try:\r\n if(x+k[0][0] == -1 or x+k[1][0] == -1 or\r\n x+k[2][0] == -1 or y+k[0][1] == -1 or\r\n y+k[1][1] == -1 or y+k[2][1] == -1 ):\r\n continue\r\n if(a[x][y] and a[x+k[0][0]][y+k[0][1]] and \r\n a[x+k[1][0]][y+k[1][1]] and\r\n a[x+k[2][0]][y+k[2][1]]):\r\n print(i+1)\r\n flag = 1\r\n break\r\n except:\r\n continue\r\n if flag:\r\n sys.exit(0)\r\nprint(0)\r\n", "def rule(y,x):\r\n if a[y][x]==1 and a[y-1][x-1]==1 and a[y-1][x]==1 and a[y][x-1]==1:\r\n return True\r\n elif a[y][x]==1 and a[y-1][x]==1 and a[y-1][x+1]==1 and a[y][x+1]==1:\r\n return True\r\n elif a[y][x]==1 and a[y][x-1]==1 and a[y+1][x-1]==1 and a[y+1][x]==1:\r\n return True\r\n elif a[y][x]==1 and a[y+1][x]==1 and a[y+1][x+1]==1 and a[y][x+1]==1:\r\n return True\r\n else:\r\n return False\r\n \r\nn,m,k=(int(x) for x in input().split())\r\na=[]\r\na.append([0 for x in range(m+2)])\r\nfor y in range(n):\r\n a.append([0]+[0 for x in range(m)]+[0])\r\na.append([0 for x in range(m+2)])\r\nfor y in range(k):\r\n i,j=(int(x) for x in input().split())\r\n a[i][j]=1\r\n if rule(i,j):\r\n print(y+1)\r\n break\r\nelse:\r\n print(\"0\")\r\n", "n, m, k = map(int, input().split())\r\npixels = [[0]*(m+2) for _ in range(n+2)]\r\nfor i in range(1, k+1):\r\n x, y = map(int, input().split())\r\n pixels[x][y] = 1\r\n for dx in range(2):\r\n for dy in range(2):\r\n if pixels[x-dx][y-dy] and pixels[x-dx][y-dy+1] and pixels[x-dx+1][y-dy] and pixels[x-dx+1][y-dy+1]:\r\n print(i)\r\n exit(0)\r\nprint(0)\r\n", "n, m, k = map(int, input().split())\r\nmatrix = [[0] * m for _ in range(n)]\r\n\r\nfor move_num in range(1, k + 1):\r\n i, j = map(int, input().split())\r\n matrix[i - 1][j - 1] = 1\r\n\r\n if i > 1 and j > 1 and matrix[i - 2][j - 1] == matrix[i - 1][j - 2] == matrix[i - 2][j - 2] == 1:\r\n print(move_num)\r\n break\r\n\r\n if i > 1 and j < m and matrix[i - 2][j - 1] == matrix[i - 1][j] == matrix[i - 2][j] == 1:\r\n print(move_num)\r\n break\r\n\r\n if i < n and j > 1 and matrix[i][j - 2] == matrix[i][j - 1] == matrix[i - 1][j - 2] == 1:\r\n print(move_num)\r\n break\r\n\r\n if i < n and j < m and matrix[i][j - 1] == matrix[i - 1][j] == matrix[i][j] == 1:\r\n print(move_num)\r\n break\r\nelse:\r\n print(0)", "def T(r,c):\r\n return matrix[r][c] and matrix[r+1][c] and matrix[r][c+1] and matrix[r+1][c+1]\r\n\r\n\r\nn,m,k = map(int, input().split())\r\nmatrix = [[0 for row in range(m+2)] for col in range(n+2)]\r\nfor trial in range(1,k+1):\r\n i, j = map(int, input().split())\r\n matrix[i][j] = 1\r\n if T(i-1,j-1) or T(i-1,j) or T(i,j-1) or T(i,j):\r\n print(trial)\r\n break\r\nelse:\r\n print(0)", "line = input().split()\r\nn,m,k = int(line[0]),int(line[1]),int(line[2])\r\n\r\nboard = []\r\nfor i in range(n+2):\r\n board.append([0 for j in range(m+2)])\r\n\r\nd = [[[0,-1],[-1,-1],[-1,0]],\r\n [[-1,0],[-1,1],[0,1]],\r\n [[0,1],[1,1],[1,0]],\r\n [[1,0],[1,-1],[0,-1]]]\r\n\r\nflag = 0\r\nresult = -1\r\n\r\nfor i in range(1,k+1):\r\n line = input().split()\r\n x,y = int(line[0]),int(line[1])\r\n board[x][y] = 1\r\n\r\n if k >= 4:\r\n for j in range(4):\r\n summ = 0\r\n summ += board[x + d[j][0][0]][y + d[j][0][1]]\r\n summ += board[x + d[j][1][0]][y + d[j][1][1]]\r\n summ += board[x + d[j][2][0]][y + d[j][2][1]]\r\n\r\n if summ == 3:\r\n flag = 1\r\n break\r\n\r\n if flag == 1:\r\n result = i\r\n break\r\n\r\nif flag == 0:\r\n print(0)\r\nelse:\r\n print(result)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Sep 27 17:40:50 2022\r\n\r\n@author: lpf\r\n\"\"\"\r\n\r\n#time limit exceeded!!!\r\n'''\r\nn,m,k=map(int,input().split())\r\nx=[];answer=0;sgn=True\r\nfor i in range(n):\r\n x.append([0]*m)\r\nfor j in range(k):\r\n p,q=map(int,input().split())\r\n x[p-1][q-1]=1\r\n for a in range(n-1):\r\n if sgn:\r\n for b in range(m-1):\r\n if x[a][b]==1 and x[a+1][b]==1 and x[a][b+1]==1 and x[a+1][b+1]==1:\r\n answer=j+1;sgn=False\r\n break\r\nprint(answer) \r\n''' \r\n \r\ndef check(i,j):\r\n if x[i][j+1] and x[i+1][j] and x[i+1][j+1]:\r\n return True\r\n if x[i][j-1] and x[i+1][j-1] and x[i+1][j]:\r\n return True\r\n if x[i-1][j] and x[i-1][j+1] and x[i][j+1]:\r\n return True\r\n if x[i-1][j-1] and x[i-1][j] and x[i][j-1]:\r\n return True\r\n else:\r\n return False\r\n\r\nn,m,k=map(int,input().split())\r\nx=[[0]*(m+2) for i in range(n+2)]\r\nfor j in range(k):\r\n p,q=map(int,input().split())\r\n x[p][q]=1\r\n if check(p,q):\r\n print(j+1);break\r\nelse:\r\n print(0) \r\n \r\n", "a,b,c=map(int,input().split())\r\nq=[[0]*(b+2) for k in range(a+2)]\r\nfor h in range(c):\r\n d,e=map(int,input().split())\r\n q[d][e]=1\r\n for i in (1,-1):\r\n for j in (1,-1):\r\n\r\n if q[d][e]==1 and q[d+i][e]==1 and q[d][e+j]==1 and q[i+d][e+j]==1:\r\n print(h+1)\r\n break\r\n else:\r\n continue\r\n break\r\n else:\r\n continue\r\n break\r\nelse:\r\n print(0)", "x,y,k=map(int,input().split())\r\np,s=[[0]*(2+x) for i in range(y+2)],0\r\n\r\nfor i in range(k):\r\n px,py=map(int,input().split())\r\n p[py][px]=1\r\n if all([p[py+1][px],p[py+1][px+1],p[py][px+1]]):\r\n s=1\r\n elif all([p[py-1][px],p[py-1][px+1],p[py][px+1]]):\r\n s=1\r\n elif all([p[py+1][px],p[py+1][px-1],p[py][px-1]]):\r\n s=1\r\n elif all([p[py-1][px],p[py-1][px-1],p[py][px-1]]):\r\n s=1\r\n \r\n if s==1:\r\n print(i+1)\r\n break\r\nelse:\r\n print(0)", "def check(mtx,n1,m1):\r\n if mtx[n1-1][m1-1] == mtx[n1-1][m1] == mtx[n1][m1-1] == mtx[n1][m1] == 1:\r\n return True\r\n elif mtx[n1-1][m1] == mtx[n1-1][m1+1] == mtx[n1][m1] == mtx[n1][m1+1] == 1:\r\n return True\r\n elif mtx[n1][m1-1] == mtx[n1][m1] == mtx[n1+1][m1-1] == mtx[n1+1][m1] == 1:\r\n return True\r\n elif mtx[n1][m1] == mtx[n1][m1+1] == mtx[n1+1][m1] == mtx[n1+1][m1+1] == 1:\r\n return True\r\n else:\r\n return False\r\n\r\nn,m,k = map(int,input().split())\r\nmatrix = [[0 for i in range(m+2)] for j in range(n+2)]\r\n\r\nfor k1 in range(1,k+1):\r\n n1,m1 = map(int,input().split())\r\n matrix[n1][m1] = 1\r\n if check(matrix,n1,m1):\r\n print(k1)\r\n break\r\n else:\r\n if k1 == k:\r\n print(0)", "def check(x,y):\r\n l1=[-1,1,-1,1]\r\n l2=[-1,1,1,-1]\r\n l3=[]\r\n for k in range(4):\r\n x1=x+l1[k]\r\n y1=y+l2[k]\r\n if 0<=x1<m and 0<=y1<n:\r\n if checkerboard[y1][x1]==1:\r\n l3.append((x1,y1))\r\n if len(l3)==0:\r\n return 0\r\n else:\r\n for i in l3:\r\n if checkerboard[i[1]][x]==checkerboard[y][i[0]]==1:\r\n return 1\r\n break\r\n else:\r\n return 0\r\nn,m,k=map(int,input().split())\r\nsteps=[]\r\nfor times in range(k):\r\n ytemp,xtemp=map(int,input().split())\r\n steps.append((xtemp-1,ytemp-1))\r\ncheckerboard=[None]*n\r\nfor t in range(n):\r\n checkerboard[t]=[0]*m\r\nstep_number=0\r\nfor step in steps:\r\n checkerboard[step[1]][step[0]]=1\r\n step_number+=1\r\n if check(step[0],step[1])==1:\r\n print(step_number)\r\n break\r\nelse:\r\n print('0')", "rows,pixels,moves = map(int,input().split())\r\nstep = []\r\nfor i in range(moves):\r\n step.append(list(map(int,input().split())))\r\nmatrix = [[0 for i in range(pixels)] for j in range(rows)]\r\n\r\nwin = False\r\ni = 0\r\nwhile i < moves:\r\n x0,y0 = step[i][0]-1 , step[i][1]-1\r\n matrix[x0][y0] = 1\r\n for x in [-1,1]:\r\n for y in [-1,1]:\r\n if (x != 0 or y != 0) and 0 <= x0 + x <= rows - 1 and 0 <= y0 + y <= pixels - 1:\r\n if matrix[x0 + x][y0 + y] == 1 and matrix[x0][y0 + y] == 1 and matrix[x0 + x][y0] == 1:\r\n print(i+1)\r\n win = True\r\n break\r\n if win:\r\n break\r\n if win:\r\n break\r\n i += 1\r\nif not win:\r\n print(0)", "n,m,k=map(int,input().split())\r\nma=[[0]*(m+2) for _ in range(n+2)]\r\ns=[]\r\nfor _ in range(k):\r\n a,b=map(int,input().split())\r\n ma[a][b]=1\r\n if ma[a][b]==1 and ma[a+1][b]==1 and ma[a][b+1]==1 and ma[a+1][b+1]==1:\r\n s.append(_)\r\n elif ma[a][b-1]==1 and ma[a+1][b]==1 and ma[a+1][b-1]==1:\r\n s.append(_)\r\n elif ma[a-1][b]==1 and ma[a][b+1]==1 and ma[a-1][b+1]==1:\r\n s.append(_)\r\n elif ma[a][b-1]==1 and ma[a-1][b]==1 and ma[a-1][b-1]==1:\r\n s.append(_)\r\nif len(s)!=0:\r\n print(str(s[0]+1))\r\nelif len(s)==0:\r\n print(0)", "n, m, k = map(int,input().split()) # the number of rows, columns and moves\r\nops = operations = [list(map(int,input().split())) for _ in range(k)]\r\n\r\np = pixels = [[0 for _ in range(m+2)] for _ in range(n+2)]\r\n\r\nans = 0\r\noutput = []\r\nfor op in ops:\r\n ans += 1\r\n (x,y) = (op[0],op[1])\r\n p[x][y] = 1\r\n sum1 = p[x-1][y-1] + p[x-1][y] + p[x][y-1]\r\n sum2 = p[x-1][y] + p[x-1][y+1] + p[x][y+1]\r\n sum3 = p[x][y-1] + p[x+1][y-1] + p[x+1][y]\r\n sum4 = p[x][y+1] + p[x+1][y] + p[x+1][y+1]\r\n if sum1 == 3 or sum2 == 3 or sum3 == 3 or sum4 == 3:\r\n output.append(ans)\r\n break\r\n\r\nif ans not in output:\r\n output.append(0)\r\nprint(output[0])", "##任晓宇 2300015809\r\n\r\nn,m,k=map(int,input().split()) #map(函数，列表)可以对列表中每一项执行该函数\r\nmatrix=[(m+2)*[0] for i in range(n+2)] #构造矩阵时可采用“n个a，共m列”形式，注意m用range表示\r\n#由于稍后涉及到对元素上下左右邻项的判定，所以多定义“一圈”元素保护列表防止报错\r\n\r\ndef square_check(i,j): #先定义算法，再对每项input适用，简化“执行程序”\r\n if matrix[i][j+1] and matrix[i+1][j] and matrix[i+1][j+1]: #m[i][j]表示矩阵的第(i+1,j+1)元 #if后直接跟数值时，若数值不为0则等价于True\r\n return True\r\n if matrix[i][j-1] and matrix[i+1][j] and matrix[i+1][j-1]:\r\n return True\r\n if matrix[i-1][j] and matrix[i][j+1] and matrix[i-1][j+1]:\r\n return True\r\n if matrix[i][j-1] and matrix[i-1][j] and matrix[i-1][j-1]: #可以用单if代替elif和else\r\n return True\r\n return False #在def即定义结构下，一旦执行一个return，则结束定义，因此可避免重复输出\r\n\r\nfor i in range(k): #需要记下标序时，直接用for，不用另外定义一个独立变量\r\n x,y=map(int,input().split())\r\n matrix[x][y]=1\r\n if square_check(x,y):\r\n print(i+1)\r\n break\r\nelse: #for循环内的break未执行时，循环结束自动执行循环外的else\r\n print(0)", "n,m,k=map(int,input().split())\r\nop=[[-1,-1],[-1,1],[1,-1],[1,1]]\r\nt=[[0]*m for i in range(n)]\r\npandu0=False\r\nfor i in range(1,k+1):\r\n a,b=map(int,input().split())\r\n a-=1\r\n b-=1\r\n t[a][b]=1\r\n pandu=False\r\n for x in op:\r\n a1=a+x[0]\r\n b1=b+x[1]\r\n if 0<=a1<=n-1 and 0<=b1<=m-1:\r\n if t[a1][b]==1 and t[a1][b1]==1 and t[a][b1]==1:\r\n pandu=True\r\n break\r\n if pandu:\r\n pandu0=True\r\n print(i)\r\n break\r\nif not pandu0:\r\n print(0)", "n, m, k = map(int, input().split()) # 输入 n, m, k\n\nboard = [[0] * (m + 2) for _ in range(n + 2)] # 初始化游戏区域\n\nfor move in range(1, k+1):\n i, j = map(int, input().split()) # 输入当前操作的行和列\n board[i][j] = 1 # 将对应的像素标记为黑色\n \n # 检查当前操作是否形成了2×2的正方形\n if (board[i-1][j-1] and board[i-1][j] and board[i][j-1]) or \\\n (board[i-1][j+1] and board[i-1][j] and board[i][j+1]) or \\\n (board[i+1][j-1] and board[i+1][j] and board[i][j-1]) or \\\n (board[i+1][j+1] and board[i+1][j] and board[i][j+1]):\n print(move) # 输出操作次数\n break\nelse:\n print(0) # 如果没有形成2×2的正方形，输出0\n\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\nn, m, k = map(int, input().split())\r\nw = [['0']*(m+2) for _ in range(n+2)]\r\n\r\ndef f(a,b):\r\n x = ['1', '1', '1', '1']\r\n x1 = [w[a][b], w[a+1][b], w[a+1][b+1], w[a][b+1]]\r\n x2 = [w[a][b], w[a-1][b], w[a-1][b+1], w[a][b+1]]\r\n x3 = [w[a][b], w[a+1][b], w[a+1][b-1], w[a][b-1]]\r\n x4 = [w[a][b], w[a-1][b], w[a-1][b-1], w[a][b-1]]\r\n if x == x1 or x == x2 or x == x3 or x == x4:\r\n return 1\r\n else:\r\n return 0\r\n\r\nfor _ in range(k):\r\n a, b = map(int, input().split())\r\n w[a][b] = '1'\r\n if f(a,b) == 1:\r\n print(_ + 1)\r\n break\r\nelse:\r\n print(0)", "rows,columns,lines=map(int,input().split())\r\nmatrix=[[0]*(columns+2) for _ in range(rows+2)]\r\nlst_dots=[]\r\nfor _ in range(lines):\r\n lst_dots.append(tuple(map(int,input().split())))\r\ndef is_pixels(matrix_1,m,n):\r\n if matrix_1[m][n]*matrix_1[m-1][n]*matrix_1[m-1][n-1]*matrix_1[m][n-1]==1:\r\n return True\r\n elif matrix_1[m][n]*matrix_1[m-1][n]*matrix_1[m-1][n+1]*matrix_1[m][n+1]==1:\r\n return True\r\n elif matrix_1[m][n]*matrix_1[m][n-1]*matrix_1[m+1][n-1]*matrix_1[m+1][n]==1:\r\n return True\r\n elif matrix_1[m][n]*matrix_1[m][n+1]*matrix_1[m+1][n+1]*matrix_1[m+1][n]==1:\r\n return True\r\n else:\r\n return False\r\nflag=0\r\nfor dot in lst_dots:\r\n flag+=1\r\n m,n=dot[0],dot[1]\r\n matrix[m][n]=1\r\n if is_pixels(matrix,m,n):\r\n print(flag)\r\n flag-=1\r\n break\r\nif flag==len(lst_dots):\r\n print(0)", "n,m,k=[int(i) for i in input().split()]\r\nmat=[[0 for i in range(m+2)] for j in range(n+2)]\r\nfor step in range(k):\r\n i,j=[int(i) for i in input().split()]\r\n mat[i][j]=1\r\n if mat[i][j]+mat[i+1][j+1]+mat[i+1][j]+mat[i][j+1]==4 or \\\r\n mat[i][j]+mat[i-1][j+1]+mat[i-1][j]+mat[i][j+1]==4 or \\\r\n mat[i][j]+mat[i+1][j-1]+mat[i+1][j]+mat[i][j-1]==4 or \\\r\n mat[i][j]+mat[i-1][j-1]+mat[i-1][j]+mat[i][j-1]==4:\r\n print(step+1)\r\n break\r\nelse:\r\n print(0)\r\nfor rest in range(k-step-1):\r\n i,j=[int(i) for i in input().split()]", "h,l,n=map(int,input().split())\r\ns=[[0 for x in range(l+2)] for y in range(h)]\r\n#第一个是列，第二个是行。\r\ns.insert(0,[0]*(l+2))\r\ns.insert(l+1,[0]*(l+2))\r\nm=[]\r\nfor t in range(n):\r\n a,b=map(int,input().split())\r\n s[a][b]=1\r\n k1=s[a][b]+s[a+1][b]+s[a+1][b+1]+s[a][b+1]\r\n k2=s[a][b]+s[a-1][b]+s[a-1][b+1]+s[a][b+1]\r\n k3=s[a][b]+s[a+1][b]+s[a+1][b-1]+s[a][b-1]\r\n k4=s[a][b]+s[a][b-1]+s[a-1][b]+s[a-1][b-1]\r\n if k1==4 or k2==4 or k3==4 or k4==4:\r\n m.append(t+1)\r\nif len(m)>=1:\r\n print(m[0]) \r\nelse:\r\n print(0)", "n, m, k=map(int,input().split())\r\npixels=set()\r\nfor move in range(1, k+1):\r\n i, j=map(int, input().split())\r\n pixels.add((i, j))\r\n for dx, dy in [(0, 0),(0, 1),(1, 0),(1, 1)]:\r\n if {(i-dx, j-dy), (i-dx, j+1-dy), (i+1-dx, j-dy), (i+1-dx, j+1-dy)}.issubset(pixels):\r\n print(move)\r\n exit(0)\r\nprint(0)\r\n ", "def is_lose(mat,i,j):\r\n if mat[i][j]:\r\n if (mat[i-1][j] and mat[i][j-1] and mat[i-1][j-1]) or (mat[i+1][j] and mat[i][j+1] and mat[i+1][j+1]) or (mat[i-1][j+1] and mat[i][j+1] and mat[i-1][j]) or (mat[i+1][j-1] and mat[i][j-1] and mat[i+1][j]):\r\n return True\r\n else:\r\n return False\r\n else:\r\n return False\r\nn , m , k =map(int,input().split())\r\nturns = 0\r\npixels=[[0]*(m+2) for _ in range(n+2)]\r\nfor _ in range(k):\r\n i,j=map(int, input().split())\r\n pixels[i][j]=(pixels[i][j] or 1)\r\n if is_lose(pixels, i, j):\r\n print(turns+1)\r\n break\r\n turns +=1\r\nif turns == k:\r\n print(0)", "n,m,k=map(int,input().split())\r\npixel_matrix=[[0 for j in range(m)] for i in range(n)]\r\n# print(pixel_matrix)\r\nfor l in range(1,k+1):\r\n i,j=map(int,input().split())\r\n if pixel_matrix[i-1][j-1]==0:\r\n pixel_matrix[i-1][j-1]=l\r\n# print(pixel_matrix)\r\n\r\nans_list=[]\r\nfor p in range(n-1):\r\n for q in range(m-1):\r\n if pixel_matrix[p][q]>0 and pixel_matrix[p+1][q]>0 and pixel_matrix[p][q+1]>0 and pixel_matrix[p+1][q+1]>0:\r\n ans_list.append(max(pixel_matrix[p][q],pixel_matrix[p+1][q],pixel_matrix[p][q+1],pixel_matrix[p+1][q+1]))\r\nif len(ans_list)>0:\r\n print(min(ans_list))\r\nelse:\r\n print(\"0\")", "n, m, k = [int(x) for x in input().split()]\r\nlst = [0] * (n + 2)\r\nlst[0] = lst[n + 1] = [0] * (m + 2)\r\nfor i in range(1,n + 1):\r\n lst[i] = [0] * (m + 2)\r\nfor s in range(k):\r\n i,j = [int(x) for x in input().split()]\r\n lst[i][j] = 1\r\n s1 = lst[i - 1][j - 1] + lst[i - 1][j] + lst[i][j] + lst[i][j - 1]\r\n s2 = lst[i + 1][j - 1] + lst[i + 1][j] + lst[i][j] + lst[i][j - 1]\r\n s3 = lst[i - 1][j + 1] + lst[i - 1][j] + lst[i][j] + lst[i][j + 1]\r\n s4 = lst[i + 1][j + 1] + lst[i + 1][j] + lst[i][j] + lst[i][j + 1]\r\n if s1 == 4 or s2 == 4 or s3 == 4 or s4 == 4:\r\n print(s + 1)\r\n break\r\nelse:\r\n print(0)", "n,m,k = map(int,input().split())\r\npixel = []\r\na = 0\r\nc = True\r\nfor i in range(n+2):\r\n pixel.append([0]*(m+2))\r\nfor j in range(k):\r\n x,y = map(int,input().split())\r\n if pixel[x][y] == 0 and c ==True:\r\n pixel[x][y] = 1\r\n if pixel[x][y]+pixel[x+1][y]+pixel[x][y+1]+pixel[x+1][y+1] == 4 \\\r\n or pixel[x][y]+pixel[x-1][y]+pixel[x][y+1]+pixel[x-1][y+1]==4 \\\r\n or pixel[x][y]+pixel[x+1][y]+pixel[x][y-1]+pixel[x+1][y-1]==4 \\\r\n or pixel[x][y]+pixel[x-1][y]+pixel[x][y-1]+pixel[x-1][y-1]==4:\r\n a = j+1\r\n c = False\r\nprint(a)", "def anan(num,i,j):\r\n if num[i][j+1] and num[i+1][j] and num[i+1][j+1]:\r\n return True\r\n if num[i][j-1] and num[i+1][j-1] and num[i+1][j]:\r\n return True\r\n if num[i-1][j] and num[i-1][j+1] and num[i][j+1]:\r\n return True \r\n if num[i-1][j-1] and num[i-1][j] and num[i][j-1]:\r\n return True\r\n return False\r\nn,m,k=map(int,input().split())\r\nnum=[(m+2)*[0] for i in range(n+2)]\r\nfor i in range(k):\r\n x,y=map(int,input().split())\r\n num[x][y]=1\r\n if anan(num,x,y):\r\n print(i+1)\r\n break\r\nelse:\r\n print(0)", "def R():return map(int,input().split())\r\na,b,c=R();A=[[0]*(b+2) for _ in range((a+2))];t=0\r\nfor i in range(c):\r\n m,n=R();A[m][n]=1\r\n if max(A[m+1][n]+A[m][n+1]+A[m+1][n+1],A[m-1][n]+A[m][n+1]+A[m-1][n+1],A[m+1][n]+A[m][n-1]+A[m+1][n-1],A[m-1][n]+A[m][n-1]+A[m-1][n-1])>2:t=i+1;break\r\nprint(t*(t>0))", "n,m,k=map(int,input().split())\r\ncolor=[[0]*(m+2) for _ in range(n+2)]\r\nfor i in range(k):\r\n x,y=map(int,input().split())\r\n color[x][y]=1\r\n if color[x-1][y]==1:\r\n if color[x-1][y+1]==1 and color[x][y+1]==1\\\r\n or color[x-1][y-1]==1 and color[x][y-1]==1:\r\n print(i+1)\r\n exit()\r\n if color[x+1][y]==1:\r\n if color[x+1][y+1]==1 and color[x][y+1]==1\\\r\n or color[x+1][y-1]==1 and color[x][y-1]==1:\r\n print(i+1)\r\n exit()\r\nprint(0)", "n, m, k = [int(x) for x in input().split()]\r\ntotal = []\r\nfor i in range(n+2):\r\n total.append(([0]*(m+2)))\r\nbig = 0\r\ndef f(a, b):\r\n sum = max(total[a][b] + total[a-1][b] + total[a][b-1] + total[a-1][b-1], total[a][b] + total[a][b+1] + total[a-1][b] + total[a-1][b+1], \\\r\n total[a][b] + total[a+1][b] + total[a+1][b-1] + total[a][b-1], total[a][b] + total[a+1][b] + total[a][b+1] + total[a+1][b+1])\r\n return sum\r\nfor i in range(k):\r\n a, b = [int(x) for x in input().split()]\r\n total[a][b] = 1\r\n big = max(f(a, b), big)\r\n if big == 4:\r\n print(i+1)\r\n break\r\nif big < 4:\r\n print('0')", "n,m,k=map(int,input().split())\r\ns=[[0]*(m+2)for _ in range(n+2)]\r\nfor i in range(k):\r\n j,x=map(int,input().split())\r\n s[j][x]=1\r\n shu=0\r\n if s[j-1][x-1]+s[j][x-1]+s[j-1][x]+s[j][x]==4:\r\n shu+=1\r\n elif s[j-1][x]+s[j-1][x+1]+s[j][x]+s[j][x+1]==4:\r\n shu+=1\r\n elif s[j][x-1]+s[j][x]+s[j+1][x-1]+s[j+1][x]==4:\r\n shu+=1\r\n elif s[j][x]+s[j][x+1]+s[j+1][x]+s[j+1][x+1]==4:\r\n shu+=1\r\n if shu>0:\r\n print(i+1)\r\n break\r\nelse:print(0)\r\n", "n, m, k = map(int, input().split())\r\n\r\nmoves = 0\r\n\r\nmatrix = [[0] * (m+2) for i in range(n+2)]\r\n\r\ndef check_if_square(i,j):\r\n if matrix[i][j+1]==1 and matrix[i+1][j]==1 and matrix[i+1][j+1]==1: #(i,j)为方框左上角\r\n return True\r\n if matrix[i][j-1]==1 and matrix[i+1][j]==1 and matrix[i+1][j-1]==1: #为右上角\r\n return True\r\n if matrix[i][j+1]==1 and matrix[i-1][j]==1 and matrix[i-1][j+1]==1: #为左下角\r\n return True\r\n if matrix[i][j-1]==1 and matrix[i-1][j]==1 and matrix[i-1][j-1]==1: #为右下角\r\n return True\r\n else:\r\n return False \r\n\r\nfor i in range(k):\r\n colori, colorj = map(int, input().split())\r\n matrix[colori][colorj] = 1\r\n moves += 1\r\n if check_if_square(colori, colorj):\r\n print(moves)\r\n break\r\nelse:\r\n print(0)", "def check(x,y):\r\n if a[x-1][y-1] and a[x][y-1] and a[x-1][y]:\r\n return True\r\n elif a[x][y-1] and a[x+1][y-1] and a[x+1][y]:\r\n return True\r\n elif a[x+1][y] and a[x+1][y+1] and a[x][y+1]:\r\n return True\r\n elif a[x-1][y] and a[x-1][y+1] and a[x][y+1]:\r\n return True\r\n else:\r\n return False\r\n\r\n\r\nn,m,k = map(int,input().split())\r\na = [[0 for i in range(m+2)] for i in range(n+2)]\r\nfor i in range(k):\r\n x,y = map(int,input().split())\r\n a[x][y] = 1\r\n if check(x,y):\r\n print(i+1)\r\n break\r\nelse:\r\n print(0)", "n,m,k = map(int,input().split())\r\na=0\r\nmartix = []\r\nans = []\r\nfor _ in range(n+2):\r\n martix.append([False]*(m+2))\r\nfor move in range(k):\r\n i,j = map(int,input().split())\r\n martix[i][j] = True\r\n ##detection\r\n for x in range(max(0,i-1),min(n,i+1)):\r\n for y in range(max(0,j-1),min(m,j+1)):\r\n if martix[x][y] and martix[x+1][y] and martix[x][y+1] and martix[x+1][y+1]:\r\n ans.append(move+1)\r\nif ans:\r\n print(min(ans))\r\nelse:\r\n print(0)", "n, m, k = map(int, input().split())\r\nmatrix = [[0] * (m + 2) for _ in range(n + 2)]\r\na = True\r\n\r\nfor i in range(k):\r\n row, col = map(int, input().split())\r\n matrix[row][col] = 1\r\n \r\n # 检查四个方向的情况\r\n if (\r\n matrix[row][col] == matrix[row][col-1] == matrix[row+1][col-1] == matrix[row+1][col] == 1 or\r\n matrix[row][col] == matrix[row][col+1] == matrix[row+1][col+1] == matrix[row+1][col] == 1 or\r\n matrix[row][col] == matrix[row][col+1] == matrix[row-1][col+1] == matrix[row-1][col] == 1 or\r\n matrix[row][col] == matrix[row-1][col] == matrix[row-1][col-1] == matrix[row][col-1] == 1\r\n ):\r\n print(i+1)\r\n a = False\r\n break\r\n\r\nif a:\r\n print(0)" ]

[ "s=input()\r\nn=len(s)\r\nlid,sz=[],0\r\nlst=[[],[]]\r\nfor id,c in enumerate(s):\r\n\tc=c=='R'\r\n\tif not lst[not c]:\t\r\n\t\tlst[not c].append(sz)\r\n\t\tlid.append([]);sz+=1\r\n\tlid[lst[not c][-1]].append(id)\r\n\tlst[c].append(lst[not c][-1])\r\n\tlst[not c].pop()\r\nprint(sz-1)\r\nnlst=[[],[],[],[]]\r\nfor j in range(2):\r\n\tfor id in lst[j]:\r\n\t\ti=j^(~len(lid[id])&1)\r\n\t\tnlst[(i<<1)|j].append(id)\r\nszLL=len(nlst[0])\r\nszRR=len(nlst[3])\r\nans=[]\r\nif szLL<szRR:\r\n\tnlst[0],nlst[3]=nlst[3],nlst[0]\r\n\tnlst[1],nlst[2]=nlst[2],nlst[1]\r\n\tszLL,szRR=szRR,szLL\r\nif szLL>szRR:\r\n\tfor i in range(szRR):\r\n\t\ta=nlst[0][i]\r\n\t\tb=nlst[3][i]\r\n\t\tif lid[a][-1]>lid[b][-1]:\r\n\t\t\tlid[b].append(lid[a][-1])\r\n\t\t\tlid[a].pop()\r\n\t\telse:\r\n\t\t\tlid[a].append(lid[b][-1])\r\n\t\t\tlid[b].pop()\r\n\t\tnlst[1].append(a)\r\n\t\tnlst[2].append(b)\r\n\tfor id in nlst[1]:\r\n\t\tans.extend(lid[id])\r\n\tans.extend(lid[nlst[0][-1]])\r\n\tfor id in nlst[2]:\r\n\t\tans.extend(lid[id])\r\nelif szLL:\r\n\tfor i in range(szRR-1):\r\n\t\ta=nlst[0][i]\r\n\t\tb=nlst[3][i]\r\n\t\tif lid[a][-1]>lid[b][-1]:\r\n\t\t\tlid[b].append(lid[a][-1])\r\n\t\t\tlid[a].pop()\r\n\t\telse:\r\n\t\t\tlid[a].append(lid[b][-1])\r\n\t\t\tlid[b].pop()\r\n\t\tnlst[1].append(a)\r\n\t\tnlst[2].append(b)\r\n\tfor id in nlst[1]:\r\n\t\tans.extend(lid[id])\r\n\tans.extend(lid[nlst[0][-1]])\r\n\tfor id in nlst[2]:\r\n\t\tans.extend(lid[id])\t\r\n\tans.extend(lid[nlst[3][-1]])\r\nelif not nlst[1]:\t\r\n\tfor id in nlst[2]:\r\n\t\tans.extend(lid[id])\r\nelif not nlst[2]:\r\n\tfor id in nlst[1]:\r\n\t\tans.extend(lid[id])\t\r\nelse:\r\n\ta=nlst[1][-1]\r\n\tb=nlst[2][-1]\r\n\tif lid[a][-1]>lid[b][-1]:\r\n\t\tlid[b].append(lid[a][-1])\r\n\t\tlid[a].pop()\r\n\telse:\r\n\t\tlid[a].append(lid[b][-1])\r\n\t\tlid[b].pop()\r\n\tfor id in nlst[1][:-1]:\r\n\t\tans.extend(lid[id])\r\n\tans.extend(lid[a])\r\n\tfor id in nlst[2][:-1]:\r\n\t\tans.extend(lid[id])\t\r\n\tans.extend(lid[b])\r\nfor i in ans:\r\n\tprint(i+1,end=' ')" ]

[ "import sys\r\nimport collections\r\ninput = sys.stdin.readline\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nlt, pk = [], 1\r\nfor i in range(47):\r\n if abs(pk) <= 10**14:\r\n lt.append(pk)\r\n pk *= k\r\nlt = list(set(lt))\r\n# s[i] - s[j] = w (w in lt) --> s[i] = s[j] - w\r\ndem, si, cnt = 0, 0, collections.defaultdict(int)\r\ncnt[0] = 1\r\nfor i in range(n):\r\n si += a[i]\r\n for w in lt:\r\n dem += cnt.get(si - w, 0)\r\n cnt[si] = cnt.get(si, 0) + 1\r\nprint(dem)\r\n", "n,k=map(int,input().split())\r\nans,ps,d,p=0,0,{0:1},{k**i for i in range(47)}\r\nfor i in map(int,input().split()):\r\n ps+=i\r\n for j in p:ans+=d.get(ps-j,0)\r\n d[ps]=d[ps]+1 if ps in d else 1\r\nprint(ans)", "n, k = map(int, input().split())\r\nans = 0\r\na=list(map(int, input().split()))\r\nb = set()\r\na = [0] + a\r\nn += 1\r\nfor i in range(1, n):\r\n\ta[i] += a[i-1]\r\n\r\nt = 1\r\nfor z in range(100):\r\n\tif abs(t) <= 10 ** 16:\r\n\t\tb.add(t)\r\n\tt *= k\r\n\r\nfor x in b:\r\n\td = dict()\r\n\tfor i in a:\r\n\t\tans += d.get(i-x, 0)\r\n\t\td[i] = d.get(i, 0) + 1\r\nprint(ans)", "n, k = map(int, input().split())\nA = list(map(int, input().split()))\ncumsum = [0]\n\nfor a in A:\n cumsum.append(cumsum[-1] + a)\n# print(cumsum)\npows = set([k ** i for i in range(50)])\ncum = dict({})\ncum[0] = 1\n\nres = 0\n\nfor x in cumsum[1:]:\n for pow in pows:\n if (x - pow) in cum:\n res += cum[x - pow]\n if x in cum:\n cum[x] += 1\n else:\n cum[x] = 1\n\n\n\nprint(res)\n\n\n\n \t\t\t \t\t \t \t \t \t\t \t\t \t", "from itertools import accumulate, product\r\n\r\nimport math\r\n\r\nR = lambda: map(int, input().split())\r\nn, k = R()\r\narr, acc = list(accumulate(R())), dict()\r\nacc[0] = 1\r\nres = 0\r\nrk, rks = 1, []\r\nif abs(k) > 1:\r\n while rk < 10 ** 15:\r\n rks.append(rk)\r\n rk *= k\r\nelse:\r\n rks = [1] if k == 1 else [1, -1]\r\n\r\nfor x in arr:\r\n for rk in rks:\r\n res += acc.get(x - rk, 0)\r\n acc[x] = acc.get(x, 0) + 1\r\nprint(res)", "import sys\r\ninput=sys.stdin.readline\r\nn,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nN=10**14\r\ncs=0\r\nans=0\r\nd={0:1}\r\nfor i in range(n):\r\n cs+=a[i]\r\n ans+=d.get(cs-1,0)\r\n v=k\r\n while v!=1 and abs(v)<=N:\r\n ans+=d.get(cs-v,0)\r\n v*=k\r\n d.setdefault(cs,0)\r\n d[cs]+=1\r\nprint(ans)" ]

[ "[n,k]=[int(x) for x in input().split()];\r\nxc=(k//2)+1;\r\nreq=[int(x) for x in input().split()];\r\n\r\nava=[[xc,xc] for x in range(k+1)];\r\nfor m in req:\r\n mindis=10**10;\r\n x=None;\r\n yl=None;\r\n yr=None;\r\n for i in range(1,k+1):\r\n dis=m*abs((i-xc))\r\n if ava[i][0]==ava[i][1]:\r\n if m%2:\r\n dis+=(m//2)*((m//2)+1);\r\n colst=xc-(m//2);\r\n colend=xc+(m//2);\r\n else:\r\n dis+=(m//2)*(m//2);\r\n colst=xc-(m//2);\r\n colend=xc+(m//2)-1;\r\n else:\r\n if m>ava[i][0] and m>k-ava[i][1]+1:\r\n continue;\r\n elif m>ava[i][0] and m<=k-ava[i][1]+1:\r\n dis+=((ava[i][1]-xc)*m)+((m-1)*m//2);\r\n colst=ava[i][1];\r\n colend=ava[i][1]+m-1;\r\n else:\r\n if xc-ava[i][0]<=ava[i][1]-xc:\r\n dis+=((xc-ava[i][0])*m)+((m-1)*m//2);\r\n colst=ava[i][0]-m+1;\r\n colend=ava[i][0];\r\n else:\r\n dis+=((ava[i][1]-xc)*m)+((m-1)*m//2);\r\n colst=ava[i][1];\r\n colend=ava[i][1]+m-1;\r\n \r\n if dis<mindis:\r\n mindis=dis;\r\n x=i;\r\n yl=colst;\r\n yr=colend;\r\n if x==None:\r\n print(-1);\r\n else:\r\n print(x,yl,yr);\r\n ava[x][0]=min(ava[x][0],yl-1);\r\n ava[x][1]=max(ava[x][1],yr+1);\r\n\r\n \r\n \r\n \r\n \r\n\r\n", "__author__ = 'Darren'\r\n\r\n\r\ndef solve():\r\n n, k = map(int, input().split())\r\n group = map(int, input().split())\r\n available = [[k, 1][:] for _ in range(k+1)]\r\n center = (k + 1) // 2\r\n for m in group:\r\n closest, best_row, best_col = 10000, -1, -1\r\n for row in range(1, k+1):\r\n col = 0\r\n if available[row][0] < m and k - available[row][1] + 1 < m:\r\n continue\r\n if available[row][0] == k:\r\n col = center - m // 2\r\n elif center - available[row][0] <= available[row][1] - center:\r\n col = available[row][0] - m + 1\r\n else:\r\n col = available[row][1]\r\n distance = calc_distance(center, row, col, m)\r\n if distance < closest:\r\n closest = distance\r\n best_row = row\r\n best_col = col\r\n if closest == 10000:\r\n print(-1)\r\n else:\r\n print(best_row, best_col, best_col+m-1)\r\n available[best_row][0] = min(available[best_row][0], best_col-1)\r\n available[best_row][1] = max(available[best_row][1], best_col+m)\r\n\r\n\r\ndef calc_distance(center, row, col, num):\r\n end_col = col + num - 1\r\n distance = abs(center - row) * num\r\n if col >= center:\r\n distance += (col - center) * num + (num - 1) * num // 2\r\n elif end_col <= center:\r\n distance += (center - end_col) * num + (num - 1) * num // 2\r\n else:\r\n distance += ((center - col) * (center - col + 1) // 2 +\r\n (end_col - center) * (end_col - center + 1) // 2)\r\n return distance\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "n,k=map(int,input().split())\r\ngroup=list(map(int,input().split()))\r\navailable=[[k,1] for i in range(k+1)]\r\ncenter=(k+1)//2\r\ndef calc(center,row,col,num):\r\n end_col=col+num-1\r\n distance=abs(center-row)*num\r\n if col>=center:\r\n distance+=(col-center)*num+(num-1)*num//2\r\n elif end_col<=center:\r\n distance+=(center-end_col)*num+(num-1)*num//2\r\n else:\r\n distance+=(center-col)*(center-col+1)//2+(end_col-center)*(end_col-center+1)//2\r\n return distance\r\nfor m in group:\r\n close,best_row,best_col=10**9,-1,-1\r\n for row in range(1,k+1):\r\n col=0\r\n if available[row][0]<m and k-available[row][1]+1<m:\r\n continue\r\n if available[row][0]==k:\r\n col=center-m//2\r\n elif center-available[row][0]<=available[row][1]-center:\r\n col=available[row][0]-m+1\r\n else:\r\n col=available[row][1]\r\n distance=calc(center,row,col,m)\r\n if distance<close:\r\n close=distance\r\n best_row=row\r\n best_col=col\r\n if close==10**9:\r\n print(-1)\r\n else:\r\n print(best_row,best_col,best_col+m-1)\r\n available[best_row][0]=min(available[best_row][0],best_col-1)\r\n available[best_row][1]=max(available[best_row][1],best_col+m) ", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\n\r\nn, k = map(int, input().split())\r\nw = list(map(int, input().split()))\r\ng = [[0]*k for i in range(k)]\r\nd = [(-1, -1) for i in range(k)]\r\nfor i in range(k):\r\n for j in range(k):\r\n g[i][j] = abs(i-k//2) + abs(j-k//2)\r\n\r\nfor x in w:\r\n c = 2 << 30\r\n q = (-1, -1, -1)\r\n for i in range(k):\r\n if d[i] == (-1, -1):\r\n y = sum(g[i][k//2-x//2:k//2+(x+1)//2])\r\n if y < c:\r\n c = y\r\n q = (i+1, k//2-x//2+1, k//2+(x+1)//2)\r\n else:\r\n y = 2 << 30\r\n if x < d[i][0]:\r\n y = sum(g[i][d[i][0]-1-x:d[i][0]-1])\r\n if y < c:\r\n c = y\r\n q = (i+1, d[i][0]-x, d[i][0]-1)\r\n if x < k-d[i][1]+1:\r\n y = sum(g[i][d[i][1]:d[i][1]+x])\r\n if y < c:\r\n c = y\r\n q = (i+1, d[i][1]+1, d[i][1]+x)\r\n if q[0] == -1:\r\n print(-1)\r\n else:\r\n print(*q)\r\n if d[q[0]-1] == (-1, -1):\r\n d[q[0]-1] = (q[1], q[2])\r\n else:\r\n if q[2] <= d[q[0]-1][0]:\r\n d[q[0]-1] = (q[1], d[q[0]-1][1])\r\n else:\r\n d[q[0]-1] = (d[q[0]-1][0], q[2])", "'''\r\nJana Goodman6\r\n\r\n10B Cinema Cashier\r\n\r\n'''\r\nimport math\r\n#import time\r\n#import random\r\n\r\nSPACE = ' '\r\nMX = 10 ** 16\r\n\r\nclass Seat:\r\n def __init__(self, x, y, rem):\r\n self.x = x\r\n self.y = y\r\n self.remoteness = rem\r\n self.empty = True\r\n\r\n\r\nclass Row:\r\n def __init__(self, max_seat, x, xc):\r\n self.max_seat = max_seat\r\n self.x = x\r\n self.xc = xc\r\n self.yc = xc\r\n self.free_seats = max_seat\r\n self.seats = [Seat(x, y, self.remoteness(y))\r\n for y in range(0, max_seat + 1)]\r\n\r\n def remoteness(self, y):\r\n return abs(self.x - self.xc) + abs(y - self.yc)\r\n\r\n def total_remoteness(self, y, m):\r\n return sum(seat.remoteness for seat in self.seats[y:y+m])\r\n\r\n def block_empty(self, y, m):\r\n return all(seat.empty for seat in self.seats[y:y + m])\r\n\r\n def set_occupied(self, y_left, m):\r\n for y in range(y_left, y_left + m):\r\n self.seats[y].empty = False\r\n self.free_seats -= m\r\n\r\nclass Cinema:\r\n def __init__(self, size):\r\n self.max_seat = size\r\n self.x_center = math.ceil(self.max_seat / 2)\r\n self.y_center = self.x_center\r\n self.seats_left = size * size\r\n self.rows = [Row(size, x, self.x_center) for x in range(0, size + 1)]\r\n\r\n def get_min_remoteness(self, m):\r\n if self.seats_left < m:\r\n return '-1'\r\n min_remoteness = MX\r\n min_x, min_yl, min_yr = None, None, None\r\n for x in range(1, self.max_seat + 1):\r\n if self.rows[x].free_seats < m:\r\n continue\r\n for y in range(1, self.max_seat - m + 2):\r\n if self.rows[x].block_empty(y, m):\r\n rem = self.rows[x].total_remoteness(y, m)\r\n if min_remoteness > rem:\r\n min_remoteness = rem\r\n min_x, min_yl, min_yr = x, y, y + m - 1\r\n if min_x is None:\r\n return '-1'\r\n self.rows[min_x].set_occupied(min_yl, m)\r\n self.seats_left -= m\r\n return f'{min_x} {min_yl} {min_yr}'\r\n\r\nif __name__ == '__main__':\r\n n, k = map(int, input().strip().split(SPACE))\r\n requests = list(map(int, input().strip().split(SPACE)))\r\n\r\n# n, k = 1000, 99\r\n# requests = [random.randint(1, k) for _ in range(0, n)]\r\n# print(requests)\r\n\r\n# start_time = time.time()\r\n\r\n cinema = Cinema(k)\r\n for request in requests:\r\n print(cinema.get_min_remoteness(request))\r\n\r\n# print(f'Elapsed time: {time.time() - start_time}')" ]

[ "def next(h1, m1, minutes):\r\n return (h1 + (m1 + minutes) // 60, (m1 + minutes) % 60)\r\n\r\nn, s = map(int, input().split())\r\nschedule = []\r\n\r\nfor i in range(n):\r\n schedule.append(tuple(map(int, input().split())))\r\n\r\nif schedule[0][0] * 60 + schedule[0][1] >= s + 1:\r\n print('0 0')\r\nelse:\r\n for i in range(1, len(schedule)):\r\n if (schedule[i][0] - schedule[i-1][0]) * 60 + (schedule[i][1] - schedule[i-1][1]) >= 2 * s + 2:\r\n res = next(schedule[i-1][0], schedule[i-1][1], s + 1)\r\n print(str(res[0]) + ' ' + str(res[1]))\r\n break;\r\n else:\r\n res = next(schedule[i][0], schedule[i][1], s + 1)\r\n print(str(res[0]) + ' ' + str(res[1]))\r\n \r\n", "R = lambda : map(int, input().split())\nn,k = R()\na = 0\nfor _ in range(n):\n h,m = R()\n b = h*60+m\n if _ ==0:\n if b-a>=k+1:\n print(0,0)\n exit(0)\n else:\n a = b\n else:\n if b-a>=k*2+2:\n print((a+k+1)//60,(a+k+1)%60)\n exit(0)\n else:\n a = b\nprint((a+k+1)//60,(a+k+1)%60)\n", "n, k = map(int, input().split())\r\nh, m = map(int, input().split())\r\nif 60 * h + m >= k + 1:\r\n print(0, 0)\r\nelse:\r\n prev_hours, prev_minutes = h, m + 1\r\n flag = 0\r\n for _ in range(n - 1):\r\n h, m = map(int, input().split())\r\n if 60 * prev_hours + prev_minutes + k + 1 + k <= 60 * h + m:\r\n prev_minutes += k\r\n print(prev_hours + prev_minutes // 60, prev_minutes % 60)\r\n flag = 1\r\n break\r\n else:\r\n prev_hours, prev_minutes = h, m + 1\r\n if flag == 0:\r\n # print('Here')\r\n prev_minutes += k\r\n print(prev_hours + prev_minutes // 60, prev_minutes % 60)\r\n\r\n", "n, s = map(int, input().split())\na = []\nind = True\nfor i in range(n):\n\tx, y = map(int, input().split())\n\ttime = (60 * x) + y\n\tif len(a) == 0 and time >= s + 1 and ind:\n\t\tprint(0, 0)\n\t\tind = False\n\telif len(a) > 0 and ind:\n\t\tlast = a[len(a) - 1]\n\t\tif time - last >= (2 * s) + 2:\n\t\t\ty = last + s + 1\n\t\t\tprint(y // 60, y % 60)\n\t\t\tind = False\n\ta.append(time)\n#print(a)\t\nif ind:\n\ty = a[len(a) - 1] + s + 1\n\t#print(y)\n\tprint(y // 60, y % 60)\t\t\n\n", "n,s=map(int,input().split())\r\nv=[tuple(map(int,input().split())) for _ in range(n)]\r\nv.sort()\r\ncur=0\r\nfor a,b in v:\r\n\tt=a*60+b\r\n\tif t>=cur+1+s: print(cur//60,cur%60);break\r\n\tcur=t+1+s\r\nif cur>v[-1][0]*60+v[-1][1]: print(cur//60,cur%60)", "n, s = map(int, input().split())\r\n\r\nflights = []\r\nfor plane in range(n):\r\n h, m = map(int, input().split())\r\n flights.append(h * 60 + m)\r\n\r\n#print(flights)\r\n\r\ngapneeded = (s + 1) * 2\r\n\r\nif flights[0] > s:\r\n print(0, 0)\r\n exit()\r\n\r\nflights.insert(0, 0)\r\n\r\nfor x in range(n):\r\n if flights[x + 1] - flights[x] >= gapneeded:\r\n pos = flights[x] + s + 1\r\n hrs = pos // 60\r\n mins = pos % 60\r\n print(hrs, mins)\r\n exit()\r\n\r\npos = flights[-1] + s + 1\r\n\r\nhrs = pos // 60\r\nmins = pos % 60\r\n\r\nprint(hrs, mins)\r\n", "rd = lambda: map(int, input().split())\nn, s = rd()\na = [- s - 1]\nfor _ in range(n):\n h, m = rd()\n a.append(h * 60 + m)\nx = 0\nfor i in range(1, len(a)):\n if a[i - 1] + s + 1 <= x <= a[i] - s - 1:\n break\n x = a[i] + s + 1\nprint(x // 60, x % 60)\n", "R=lambda:map(int,input().split())\nn,s=R()\nr=0\nfor _ in [0]*n:\n h,m=R();t=60*h+m\n if t>r+s:break\n r=t+s+1\nprint(r//60,r%60)", "R = lambda: map(int, input().split())\r\nn, s = R()\r\nr = 0\r\nfor _ in [0] * n:\r\n h, m = R()\r\n t = 60 * h + m\r\n if t > r + s:\r\n break\r\n r = t + s + 1\r\nprint(r // 60, r % 60)\r\n", "\ndef to_minutes(h, m):\n return h * 60 + m\ndef to_retard(m):\n return divmod(m, 60)\n\nn, s = [int(i) for i in input().split(' ')]\n\ntakeoffs = []\nfor i in range(n):\n takeoff_time = to_minutes(*([int(i) for i in input().split(' ')]))\n takeoffs.append(takeoff_time)\n\ndef solve():\n if takeoffs[0] > s:\n return 0\n for i in range(n-1):\n if takeoffs[i+1] - takeoffs[i] - 1 >= 2*s +1:\n return takeoffs[i] + s + 1\n return takeoffs[-1] + s + 1\n\nprint(*to_retard(solve()))\n", "def canLand(i,s,arr):\r\n for a in range(len(arr)):\r\n if arr[a] - s > i:\r\n if a == 0:\r\n return True\r\n elif arr[a-1] + s < i:\r\n return True\r\n else:\r\n return False\r\n\r\nN, s = [int(k) for k in input().split(\" \")]\r\n\r\nlandings = []\r\n\r\nfor i in range(N):\r\n h, m = [int(k) for k in input().split(\" \")]\r\n landings.append(60*h + m)\r\n\r\ni = 0\r\nwhile not canLand(i,s,landings):\r\n if i > 24*60:\r\n i = landings[-1] + s + 1\r\n break\r\n i+=1\r\n\r\nprint(\"{} {}\".format(i//60,i%60))\r\n", "# LUOGU_RID: 101739323\n(n, s), *a = [[*map(int, s.split())] for s in open(0)]\r\nc = 0\r\nfor h, m in a:\r\n t = 60 * h + m\r\n if t > c + s:\r\n break\r\n c = t + s + 1\r\nprint(*divmod(c, 60))\r\n", "array, atime = [], []\r\nn, s = map(int, input().split())\r\nfor i in range(n):\r\n\th, m = map(int, input().split())\r\n\tarray.append(h*60 + m)\r\nfor i in range(len(array)):\r\n\tif i+1 != len(array):\r\n\t\tatime.append((array[i+1]-array[i]-2)/2)\r\n\telse:\r\n\t\tatime.append((1439-array[i]-2)/2)\r\nbool = False\r\nfor i in range(len(atime)):\r\n\tif array[0]-1 >= s:\r\n\t\tbool = True\r\n\t\tanswer = 0\r\n\t\tbreak\r\n\tif atime[i] >= s:\r\n\t\tbool = True\r\n\t\tanswer = array[i]+1+s\r\n\t\tbreak\r\n\r\nif bool is True:\r\n\tprint(answer//60, answer%60)\r\nelse:\r\n\tprint((array[len(atime)-1]+1+s)//60, (array[len(atime)-1]+1+s)%60)\r\n", "def preobr(s):\r\n h, m = map(int,s.split())\r\n return h * 60 + m\r\n\r\n\r\nn, s = map(int,input().split())\r\nt = preobr(input())\r\ns += 1\r\nfl = False\r\nif t >= s:\r\n res = 0\r\n fl = True\r\nfor i in range(n - 1):\r\n new_t = preobr(input())\r\n if fl:\r\n continue\r\n if new_t - t >= 2 * s:\r\n res = t + s\r\n fl = True\r\n else:\r\n t = new_t\r\nif not fl:\r\n res = t + s\r\nprint(res // 60, res % 60)\r\n \r\n", "n, s = map(int, input().split())\nchegadas = []\nfor _ in range(n):\n h, m = map(int, input().split())\n chegadas.append(h*60+m)\npos = -1\n\nif chegadas[0] > s:\n print(0, 0)\nelse:\n for i in range(n-1):\n if chegadas[i+1] - chegadas[i] > ((s*2) + 1):\n pos = i\n break\n\n t = chegadas[pos] + s + 1\n h, m = int(t / 60), t % 60\n print(h, m)", "n, s = [int(x) for x in input().split(\" \")]\n\nlast = 0\nfound = False\nrng = 2 * s + 2\n\nfirst = s + 1\n\nf = False\n\nff = False\n\nfor _ in range(n):\n\n h, m = [int(x) for x in input().split(\" \")]\n x = h * 60 + m\n if not f:\n if abs(x - last) >= first:\n found = True\n ff = True\n else:\n last = x\n elif not found:\n if abs(x - last) >= rng:\n found = True\n else:\n last = x\n f = True\n\n\n# if found:\nif ff:\n print(0, 0)\nelse:\n res = last + s + 1\n print(\"{} {}\".format(res // 60, res % 60))\n# else:\n# print()", "n, s = (int(x) for x in input().split())\r\nh, m = [], []\r\nfor i in range(n):\r\n h1, m1 = (int(x) for x in input().split())\r\n h.append(h1)\r\n m.append(m1)\r\n\r\nflag = True\r\nif h[0] * 60 + m[0] - s >= 1:\r\n flag = False\r\n print(0, 0)\r\nelse:\r\n for i in range(n-1):\r\n z = h[i] * 60 + m[i] + s + 1\r\n if z <= h[i+1] * 60 + m[i+1] - s - 1:\r\n print(z//60, z - (z//60)*60)\r\n flag = False\r\n break\r\nif flag:\r\n z = h[n-1] * 60 + m[n-1] + s + 1\r\n print(z//60, z - (z//60) * 60)\r\n", "# python3\n\ndef readline(): return tuple(map(int, input().split()))\n\n\ndef readlines(count):\n while count:\n count -= 1\n yield readline()\n\n\ndef main():\n n, s = readline()\n shedule = [h*60 + m for (h, m) in readlines(n)]\n\n shedule.append(float('inf'))\n prev = -s\n\n for time in shedule:\n if prev + s < time - s:\n print(*divmod(prev + s, 60))\n break\n prev = time + 1\n\n\n\nmain()\n", "# ANSHUL GAUTAM\n# IIIT-D\n\nN,S = map(int, input().split())\ntime = []\nfor n in range(N):\n\th,m = map(int, input().split())\n\ta = h*60\n\tz = a+m+1\n\ttime.append(z)\n#print(time)\nans = 0\nf = 0\nif(S+1 < time[0]):\n#\t\tprint(\"!!!\")\n\t\tprint(0,0)\nelse:\n\tfor i in range(len(time)-1):\n\t\tif(time[i+1]-time[i] > 2*S+1):\n#\t\t\tprint(\"i\",i)\n\t\t\tans = time[i]\n\t\t\tf = 1\n\t\t\tbreak\n\n\tif(f == 1):\n#\t\tprint(\"!!\")\n\t\tans += S\n\t\thh = ans//60\n\t\tmm = ans%60\n\t\tprint(hh,mm)\t\n\t\t\n\telse:\n#\t\tprint(\"!!!\")\n\t\tj = time[-1]\n\t\tj += S\n\t\thh = j//60\n\t\tmm = j%60\n\t\tprint(hh,mm)\n\n\n\n\n\n\n\n\n\n\n\n\n", "n,k = map(int,input().split())\nr = 0\nfor _ in range(n):\n h,m = map(int,input().split())\n t = 60*h+m\n if(t>r+k): \n break\n r = t+k+1\nprint(r//60,r%60)", "from typing import List\n\ndef time_diff(h1:int,m1:int,h2:int,m2:int) -> int:\n t1 = h1*60+m1\n t2 = h2*60+m2\n t = t2-t1\n return t\n\ndef increas_time(h:int,m:int,t:int):\n t += h*60+m+1\n return t//60,t%60\n\n\ndef solve(arr:List[List[int]],n: int,s: int):\n if arr[0] != [0,0]:\n h1,m1 = [0,0]\n h2,m2 = arr[0]\n diff = time_diff(h1,m1,h2,m2)\n if diff >= s+1:\n return \" \".join(map(str,[0,0]))\n for i in range(n-1):\n h1,m1 = arr[i]\n h2,m2 = arr[i+1]\n diff = time_diff(h1,m1,h2,m2)\n \n if diff >= 2*s+2:\n return \" \".join(map(str, increas_time(h1,m1,s)))\n return \" \".join(map(str,increas_time(*arr[-1],s)))\n\n\n\n\n\ndef main():\n n,s = list(map(int, input().split(\" \")))\n # n = int(input())\n # x= int(input())\n\n # s = input()\n # a = list(map(int, input().split(\" \")))\n # b = list(map(int, input().split(\" \")))\n # c = list(map(int, input().split(\" \")))\n res = []\n for _ in range(n):\n arr = list(map(int, input().split(\" \")))\n res.append(arr)\n print(solve(res, n, s))\n # i = 0\n # inputpath = 'input.txt'\n # outPath = 'output.txt'\n # with open(inputpath) as fp:\n # line = fp.readline()\n # cnt = 1\n # while line:\n # if cnt == 1:\n # i = int(line)\n # else:\n # arr = list(map(int, line.split(\" \")))\n # res.append(arr) \n # cnt += 1\n # line = fp.readline()\n # s = solve(res,i)\n # with open(outPath, 'a') as out:\n # out.write(str(s))\n\n\nmain()", "n,k=map(int,input().split())\ncur=0\nflag=0\nans=0\ndef pr(x):\n print(x//60,x%60)\nfor i in range(n):\n x,y=map(int,input().split())\n tmp = x * 60 + y\n if i==0:\n if tmp-cur>=k+1:\n flag=1\n ans=0\n if flag==1:\n continue\n if tmp-cur>=k*2+2:\n flag=1\n ans=cur+k+1\n cur=tmp\nif flag==1:\n pr(ans)\nelse:\n pr(cur+k+1)\n \t\t\t\t\t\t \t\t\t \t \t\t\t\t \t \t\t\t\t\t", "n,s = list(map(int,input().split(' ')))\r\nv0 = 0\r\nfl = False\r\n\r\n\r\n\r\nfor i in range(n):\r\n h,m = list(map(int,input().split(' ')))\r\n v = h*60+m\r\n if i==0 and (v-1) >= s:\r\n m2 = 0\r\n h2 = 0\r\n fl = True\r\n break\r\n elif (v-v0-2) // 2 >= s:\r\n v2 = v0+s+1\r\n m2 = (v2)%60\r\n h2 = (v2)//60\r\n fl = True\r\n break\r\n else:\r\n v0 = v\r\nif fl:\r\n print(h2,m2)\r\nelse:\r\n m2 = (v0+s+1)%60\r\n h2 = (v0+s+1)//60\r\n print(h2,m2)\r\n", "n, s = map(int, input().split())\r\npt = 0\r\n\r\nfor i in range(n):\r\n h, m = map(int, input().split())\r\n t = h * 60 + m\r\n\r\n if t > pt + s:\r\n break\r\n\r\n pt = s + t + 1\r\n\r\nprint(pt // 60, pt % 60)\r\n", "n, s = map(int, input().split())\r\ntimes = []\r\nfor z in range(0, n):\r\n h, m = map(int, input().split())\r\n times.append((h*60)+m)\r\nif times[0] - (s+1) >= 0:\r\n print(\"0 0\")\r\nelse:\r\n for i in range(0, n):\r\n if i != n-1:\r\n if (times[i+1] - times[i]) - 2 >= 2 * s:\r\n ans = times[i] + 1 + s\r\n #print(i)\r\n break\r\n else:\r\n ans = times[i] + s + 1\r\n ansM = ans % 60\r\n ansH = int((ans - ansM) / 60)\r\n print(ansH, ansM)", "n, s = map(int, input().split())\r\n\r\nr = 0\r\n\r\nfor _ in range(n):\r\n h, m = map(int, input().split())\r\n t = 60 * h +m\r\n if t > r + s:\r\n break\r\n r = t + s + 1\r\nprint(r//60, r % 60)", "import sys, copy\r\n\r\ndef convert(h, m):\r\n return 60 * h + m\r\n\r\nn, m = map(int, sys.stdin.readline().split())\r\narr = []\r\nfor _ in range(n):\r\n a, b = map(int, sys.stdin.readline().split())\r\n arr.append(convert(a, b))\r\nif 1 + m <= arr[0]:\r\n print(0, 0)\r\nelse:\r\n for j in range(n - 1):\r\n if arr[j] + 2 + 2 * m <= arr[j + 1]:\r\n print((arr[j] + 1 + m) // 60, (arr[j] + 1 + m) % 60)\r\n sys.exit(0)\r\n print((arr[-1] + 1 + m) // 60, (arr[-1] + 1 + m) % 60)\r\n", "MIS = lambda: map(int,input().split())\r\nn, s = MIS()\r\ntime = []\r\nfor i in range(n):\r\n h, m = MIS()\r\n time.append(60*h+m)\r\n\r\nif s+1 <= time[0]: print('0 0'); exit()\r\nfor i in range(n-1):\r\n takeoff = time[i] + s+1\r\n if takeoff + s+1 <= time[i+1]:\r\n print(takeoff//60, takeoff%60)\r\n break\r\nelse:\r\n takeoff = time[-1] + s+1\r\n print(takeoff//60, takeoff%60)", "n,s=map(int,input().split())\r\na=[[0,-1*s-1]]\r\nx=0\r\nfor i in range(n):\r\n a.append(list(map(int,input().split())))\r\nfor i in range(n):\r\n if 60*(a[i+1][0]-a[i][0])+a[i+1][1]-a[i][1]>=2*s+2:\r\n d=a[i][1]+s+1\r\n c=a[i][0]\r\n if d>60:\r\n c+=d//60\r\n d%=60\r\n break\r\nelse:\r\n d=a[-1][1]+s+1\r\n c=a[-1][0]\r\n c+=d//60\r\n d=d%60\r\nprint('{} {}'.format(c,d))\r\n \r\n", "ans=0\r\ntem=0\r\ntem=int(tem)\r\nans=int(ans)\r\nn,s = input().split()\r\nn,s = [int(n),int(s)]\r\nfor x in range(0,n):\r\n h, m = input().split()\r\n h, m = [int(h), int(m)]\r\n tem = 60 * h + m;\r\n if (ans + s) < tem:\r\n break;\r\n ans = tem + s + 1;\r\nprint(int(ans/60),int(ans%60))", "R=lambda:map(int,input().split())\nn,s=R()\nt=[-s-1]+[60*h+m for h,m in(R()for _ in[0]*n)]+[1600]\nx=t[next(i for i in range(n+1)if t[i+1]>t[i]+2*s+1)]+s+1\nprint(x//60,x%60)\n \t \t\t \t \t \t\t \t\t\t\t \t\t \t", "n,s=map(int,input().split())\r\nt=[]\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n t.append(a*60+b)\r\nif(t[0]>s):\r\n print(0,0)\r\nelse:\r\n f=0\r\n for i in range(n-1):\r\n if(t[i+1]-t[i]>=2*s+2):\r\n f=1\r\n break\r\n if(f):\r\n print((t[i]+s+1)//60,(t[i]+s+1)%60)\r\n else:\r\n a=t[-1]+1+s\r\n print(a//60,a%60)\r\n", "def preobr(s):\r\n h, m = map(int,s.split())\r\n return h * 60 + m\r\n\r\n\r\nn, s = map(int,input().split())\r\na,b = map(int,input().split())\r\nt = a*60+b\r\ns += 1\r\nflag = False\r\nif t >= s:\r\n answer = 0\r\n flag = True\r\nfor i in range(n - 1):\r\n a,b = map(int,input().split())\r\n nextTime = a*60+b\r\n if flag:\r\n continue\r\n if nextTime - t >= 2 * s:\r\n answer = t + s\r\n flag = True\r\n else:\r\n t = nextTime\r\nif not flag:\r\n answer = t + s\r\nprint(answer//60,answer%60)\r\n ", "n, s = map(int, input().split(' '))\r\nl = list()\r\nfor i in range(n):\r\n a, b = map(int, input().split(' '))\r\n l.append(a * 60 + b)\r\nif l[0] - s >= 1:\r\n print(0, 0)\r\nelse:\r\n for i in range(n - 1):\r\n t = l[i + 1] - l[i] - 1 - 2 * s\r\n if t >= 1:\r\n tt = l[i] + 1 + s\r\n h, m = tt // 60, tt % 60\r\n print(h, m)\r\n break\r\n else:\r\n tt = l[-1] + 1 + s\r\n h, m = tt // 60, tt % 60\r\n print(h, m)", "n,s=map(int,input().split())\r\nt=[]\r\nfor i in range(n):\r\n\th,m=map(int,input().split())\r\n\tt.append(60*h+m)\r\nx,y=0,0\r\nif t[0]<s+1:\r\n\tfor i in range(n-1):\r\n\t\tif t[i+1]-t[i]>=2*s+2:\r\n\t\t\tx=t[i]+s+1\r\n\t\t\tbreak\r\n\tif x==0:\r\n\t\tx=t[n-1]+s+1\r\ny=x%60\r\nx=x//60\r\nprint(x,y)", "n, s = map(int, input().split())\r\n\r\n\r\ndef diff(t1, t2):\r\n if t2[0] == t1[0]:\r\n return t2[1] - t1[1]\r\n else:\r\n return t2[1] + 60 - t1[1] + (t2[0] - t1[0] - 1) * 60\r\n\r\n\r\ndef add(t, s):\r\n h = t[0]\r\n m = t[1]\r\n h += (s // 60)\r\n s %= 60\r\n m += s\r\n if m > 59:\r\n m %= 60\r\n h += 1\r\n return h, m\r\n\r\n\r\na = [(0, 0)]\r\nfor i in range(n):\r\n h, m = map(int, input().split())\r\n a.append((h, m))\r\nif diff(a[0], a[1]) > s:\r\n print(0,0)\r\n exit()\r\n\r\nfor i in range(1, n + 1):\r\n if diff(a[i - 1],a[i]) > 2 * s + 1:\r\n ans = add(a[i-1], s + 1)\r\n print(ans[0], ans[1])\r\n exit()\r\nans = add(a[i], s + 1)\r\nprint(ans[0], ans[1])", "def righttime(n,s,dep):\r\n if dep[0] >= s+1:\r\n return '0 0'\r\n for i in range(n-1):\r\n if dep[i] + 2*s + 2 <= dep[i+1]:\r\n m = dep[i] + s + 1\r\n return '{} {}'.format(m // 60, m % 60)\r\n m = dep[n-1] + s + 1\r\n return '{} {}'.format(m // 60, m % 60)\r\nn,s = map(int,input().split())\r\ndepartures = []\r\nfor _ in range(n):\r\n a,b = map(int,input().split())\r\n departures.append(60*a+b)\r\nprint(righttime(n,s,departures))", "n, s = [int(i) for i in input().split()]\r\na = [-s - 1]\r\nfor i in range(n):\r\n h, m = [int(i) for i in input().split()]\r\n t = h * 60 + m\r\n a.append(t)\r\na.append(a[-1] + 2 * s + 2)\r\nfor i in range(n + 1):\r\n if a[i + 1] - a[i] >= 2 * s + 2:\r\n t = a[i] + s + 1\r\n print(t // 60, t % 60)\r\n break\r\n", "# import sys\n\n# sys.stdin = open('input.txt', 'r')\n# sys.stdout = open('output.txt', 'w')\n\nn, s = map(int, input().split(' '))\n\nlst = []\n\nfor i in range(n):\n h, m = map(int, input().split(' '))\n lst.append(h * 60 + m)\n\n if i == 0:\n if lst[-1] >= s + 1:\n print(0, 0)\n exit()\n\n if lst[i] - lst[i - 1] >= 2 * s + 2:\n print((lst[i - 1] + s + 1) // 60, (lst[i - 1] + s + 1) % 60)\n exit()\n\nprint((lst[-1] + s + 1) // 60, (lst[-1] + s + 1) % 60)\n", "n, s = [int(w) for w in input().split()]\n\nr = 0\n\nfor _ in range(n):\n h, m = [int(w) for w in input().split()]\n t = 60*h+m\n if t > r+s:\n break\n r = t+s+1\n\nprint(r//60, r%60)\n", "def main():\n [n, s] = [int(i) for i in input().split()]\n times = []\n for i in range(n):\n [hour, minute] = [int(i) for i in input().split()]\n times.append(hour * 60 + minute)\n ans = earliest(times, s)\n hour = ans // 60\n minute = ans % 60\n print(hour, minute)\ndef earliest(times, s):\n n = len(times)\n if times[0] >= s + 1:\n return 0\n for i in range(n - 1):\n bef = times[i]\n aft = times[i + 1]\n if aft - bef >= 2 * s + 2:\n return bef + s + 1\n return times[n - 1] + s + 1\nif __name__ == \"__main__\":\n main()\n", "n,s=list(map(int,input().split()))\r\nx=[]\r\nfor i in range(n):\r\n zz=list(map(int,input().split()))\r\n zz=zz[0]*60+zz[-1]\r\n x.append(zz)\r\ngap=2*s+2\r\nif x[0]>=s+1:\r\n print(\"0 0\")\r\nelse:\r\n ans=-1\r\n for i in range(len(x)-1):\r\n diff=x[i+1]-x[i]\r\n # if i==0:\r\n # if diff>=gap-s-1:\r\n # ans=0\r\n # break\r\n if diff>=gap :\r\n ans=i\r\n break\r\n\r\n ans=x[ans]+s+1\r\n print(ans//60,end=\" \")\r\n print(ans%60)", "import sys\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,s = mints()\r\na = []\r\nfor i in range(n):\r\n\th,m = mints()\r\n\ta.append(h*60+m)\r\nif a[0] >= s+1:\r\n\tprint(0, 0)\r\nelse:\r\n\tfor i in range(n-1):\r\n\t\tif a[i+1]-a[i]-1 >= s*2+1:\r\n\t\t\tprint((a[i]+s+1)//60,(a[i]+s+1)%60)\r\n\t\t\texit(0)\r\n\tprint((a[-1]+1+s)//60,(a[-1]+1+s)%60)\r\n", "tians, limit = input().split()\r\ntians = int(tians)\r\nlimit = int(limit)\r\nhrs = []\r\nmins = []\r\n\r\nfor number in range(tians):\r\n h , m = (input().split())\r\n h = int(h)\r\n m = int(m)\r\n hrs.append(h)\r\n mins.append(m)\r\n \r\nhnext = 0\r\nmnext = 0\r\n\r\nfor x in range(len(hrs)):\r\n timecomp = (hrs[x] - hnext)*60 + mins[x] - mnext\r\n if timecomp >= limit + 1:\r\n break\r\n mnext = mins[x] + limit + 1\r\n hnext = hrs[x]\r\n \r\n if mnext >= 60:\r\n hafter = mnext // 60\r\n hnext += hafter\r\n mnext -= hafter*60\r\n \r\nprint(hnext, mnext)\r\n \r\n\r\n \r\n\r\n ", "if __name__ == '__main__':\r\n n, s = map(int, input().split())\r\n a = []\r\n for _ in range(n):\r\n h, m = map(int, input().split())\r\n a.append(h * 60 + m)\r\n if a[0] != 0 and a[0] > s:\r\n print(0, 0)\r\n else:\r\n a.append(a[n - 1] + 2 * s + 3)\r\n for i in range(1, n + 1):\r\n if a[i] - (a[i - 1] + 2 + s) >= s:\r\n print((a[i - 1] + s + 1)//60, (a[i - 1] + s + 1)%60)\r\n break\r\n", "n,s = map(int, input().split())\r\na,b = map(int, input().split())\r\nif a*60+b>=s+1:\r\n print(0,0)\r\nelse:\r\n X = 0\r\n for i in range(n-1):\r\n c,d = map(int, input().split())\r\n if c*60+d - (a*60+b) >= 2*s+2:\r\n M = a*60+b+1+s\r\n print(M//60,M%60)\r\n X = 1\r\n break\r\n else:\r\n a,b = c,d\r\n if X==0:\r\n M = a*60+b+1+s\r\n print(M//60,M%60)", "n, s = [int(i) for i in input().split()]\na = []\n\nfor i in range(n):\n h, m = [int(i) for i in input().split()]\n a.append(h*60 + m + 1)\n\nans = 0\nfor i in range(n - 1):\n if a[i+1] - a[i] > 2*s + 1:\n ans = a[i] + s\n break\n\nif a[0] > s + 1:\n ans = 0\nelif ans == 0:\n ans = a[-1] + s\n\nans_h = ans // 60\nans_m = ans % 60\n\nprint(ans_h, ans_m)", "n,s = map(int,input().split())\r\nr = 0\r\nfor _ in range(n):\r\n h,m = map(int, input().split())\r\n t = h*60+m\r\n if t>r+s:\r\n break\r\n r = t+s+1\r\nprint(r//60, r%60)", "testcases, gap = input().split()\r\ntestcases = int(testcases)\r\ngap = int(gap)\r\nhrs = []\r\nmins = []\r\n\r\nfor number in range(testcases):\r\n h, m = (input().split())\r\n h = int(h)\r\n m = int(m)\r\n hrs.append(h)\r\n mins.append(m)\r\n \r\nhnext = 0\r\nmnext = 0\r\n\r\nfor x in range (len(hrs)):\r\n timecomp = (hrs[x] - hnext)*60 + mins[x] - mnext\r\n if timecomp >= gap+1:\r\n break\r\n mnext = mins[x] + gap + 1\r\n hnext = hrs[x]\r\n \r\n if mnext >= 60:\r\n hafter = mnext // 60\r\n hnext += hafter\r\n mnext -= hafter*60\r\n \r\nprint(hnext, mnext)\r\n \r\n \r\n ", "n,s = map(int, input().split())\r\nhm = [-s-1]\r\nfor i in range(n):\r\n a,b = map(int, input().split())\r\n hm.append(a*60+b)\r\n\r\ni = 1\r\nwhile i <= n:\r\n d = hm[i] - hm[i-1]-1\r\n if d >= 2*s+1:\r\n break\r\n i+= 1\r\nss = hm[i-1]+s +1\r\nhh = ss//60\r\nmm = ss%60\r\nprint('%i %i' % (hh, mm))\r\n", "num_landings, min_interval = (int(x) for x in input().split())\r\nlandings = [[int(x) for x in input().split()] for _ in range(num_landings)]\r\nlandings_in_minutes = [-min_interval - 1] + [60*clock[0] + clock[1] for clock in landings] + [float('inf')]\r\n\r\nfor left_landing, right_landing in zip(landings_in_minutes[:-1], landings_in_minutes[1:]):\r\n if left_landing + 2*min_interval + 2 <= right_landing:\r\n takeoff = left_landing + 1 + min_interval\r\n break\r\n\r\ntakeoff_hours = takeoff // 60\r\ntakeoff_mins = takeoff % 60\r\nprint(takeoff_hours, takeoff_mins)\r\n \r\n\r\n", "n,s=map(int,input().split())\r\narr=[]\r\nb=0\r\nfor _ in range (n):\r\n h,m=map(int,input().split())\r\n arr.append(h*60+m)\r\nif(arr[0]>s):\r\n print('0 0')\r\nelse:\r\n for i in range (1,n):\r\n if(arr[i]-arr[i-1]-1>2*s):\r\n b=1\r\n print((arr[i-1]+1+s)//60,(arr[i-1]+1+s)%60)\r\n break\r\n if(b==0):\r\n print((arr[n-1]+1+s)//60,(arr[n-1]+1+s)%60)", "n, s = map(int, input().split())\r\ntime = [0]\r\nfor i in range(n):\r\n h, m = map(int, input().split())\r\n time.append(h*60+m)\r\nf = True\r\nfl = True\r\nfor i in range(len(time)-1):\r\n if time[1]>s:\r\n ansh, ansm = 0,0\r\n f = False\r\n break\r\n if time[i]+2*s+1<time[i+1]:\r\n ansh = (time[i]+s+1)//60\r\n ansm = (time[i]+s+1)%60\r\n f = False\r\n break\r\nif f:\r\n ansh = (time[-1] + s + 1) // 60\r\n ansm = (time[-1] + s + 1) % 60\r\nprint(ansh, ansm)", "n, s = map(int, input().split())\r\n\r\ntimes = [0]\r\nfor i in range(n):\r\n h, m = map(int, input().split())\r\n times.append(60 * h + m)\r\n\r\ndel_ = [el - times[i] for i, el in enumerate(times[1:])]\r\n\r\nif del_[0] >= s + 1:\r\n print(0, 0)\r\n exit()\r\n\r\nfor i, el in enumerate(del_):\r\n if el >= 2 * (s + 1):\r\n print(*divmod(times[i] + s + 1, 60))\r\n exit()\r\n\r\nprint(*divmod(times[-1] + s + 1, 60))\r\n", "n,s=map(int,input().split())\r\ntime=[0]*n\r\nfor i in range(n):\r\n h,m=map(int,input().split())\r\n time[i]=h*60+m\r\n\r\ngogo=0\r\nif time[0]-1-gogo>=s:\r\n print(0,0)\r\n exit()\r\n\r\nfail=True\r\nfor i in range(n-1):\r\n gogo=time[i]+1+s\r\n if time[i+1]-gogo-1>=s:\r\n ans=gogo\r\n fail=False\r\n break\r\n\r\nif fail: gogo=time[-1]+s+1 \r\nhour=gogo//60\r\nmin=gogo%60\r\nprint(hour,min)", "\r\nimport sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\n\r\n\r\ndef solve():\r\n [n, s] = list(map(int, input().split()))\r\n arr = [0]\r\n for i in range(n):\r\n [h, m] = list(map(int, input().split()))\r\n arr.append(h*60 + m)\r\n for i in range(n):\r\n if i != 0 and arr[i+1] - arr[i] > 2*s + 1:\r\n v = arr[i] + s + 1\r\n print(v//60, v%60)\r\n return \r\n elif i == 0 :\r\n if arr[1] > s :\r\n print(0, 0)\r\n return \r\n v = arr[-1] + s + 1\r\n print(v//60, v%60)\r\n return \r\n \r\nsolve()", "n, s = [int(x) for x in input().split()]\r\nd, k = 0, 0\r\nfor i in range(n):\r\n h, m = [int(x) for x in input().split()]\r\n raz = (h*60+m)-(d*60+k)\r\n if i==0 and raz >= (s+1):\r\n print(d, k)\r\n break\r\n elif raz >= (s*2+2):\r\n mojno=(d*60+k)+s+1\r\n l = mojno//60\r\n a = mojno%60\r\n print(l,a)\r\n break\r\n else:\r\n d = h\r\n k = m\r\nelse:\r\n mojno=(d*60+k)+s+1\r\n l = mojno//60\r\n a = mojno%60\r\n print(l,a)\r\n", "a = True\r\nn, s = [int(x) for x in input().split()]\r\nph, pm = [int(x) for x in input().split()]\r\n\r\nif ph*60 + pm >= s+1:\r\n print(0, 0)\r\n a = False\r\n exit()\r\nfor x in range(n - 1):\r\n h, m = [int(x) for x in input().split()]\r\n if h*60+m >= ph*60+pm + 2 + 2 * s:\r\n print((ph*60+pm+s+1) // 60, (ph*60+pm+s+1) % 60)\r\n a = False\r\n break\r\n else:\r\n ph = h\r\n pm = m\r\nif a:\r\n print((ph*60+pm+s+1) // 60, (ph*60+pm+s+1) % 60)\r\n", "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Apr 29 18:54:44 2018\r\n\r\n@author: ska\r\n\r\n967-A\r\n\"\"\"\r\n\r\nn,s = map(int, input().split())\r\nar = []\r\nval = 2*s+2\r\nfor i in range(n):\r\n t = tuple(map(int, input().split()))\r\n ar.append(t[1]+t[0]*60)\r\n#print(ar)\r\nif ar[0] != 0 and ar[0]>=s+1:\r\n print(0, 0)\r\nelse:\r\n flag =0\r\n for i in range(1,n):\r\n if (ar[i]-ar[i-1]) >=val :\r\n k = ar[i-1] + (s+1)\r\n print(k//60, k%60)\r\n flag =1\r\n break\r\n if flag ==0:\r\n k = ar[n-1]+(s+1)\r\n print(k//60, k%60)\r\n \r\n", "def to_minutes(h, m):\n return h * 60 + m\n\n\ndef to_hours(m):\n return m // 60, m % 60\n\n\ndef solve():\n n, s = map(int, input().split(\" \"))\n h, m = map(int, input().split(\" \"))\n prev_arrival = to_minutes(h, m)\n if prev_arrival >= s + 1:\n return \"0 0\"\n for i in range(1, n):\n h, m = map(int, input().split(\" \"))\n arrival = to_minutes(h, m)\n if arrival - prev_arrival >= s * 2 + 2:\n return str(to_hours(prev_arrival + s + 1)[0]) + \" \" + str(to_hours(prev_arrival + s + 1)[1])\n\n prev_arrival = arrival\n return str(to_hours(prev_arrival + s + 1)[0]) + \" \" + str(to_hours(prev_arrival + s + 1)[1])\n\n\nprint(solve())", "n,s=map(int,input().split())\r\nc=0\r\nfor i in range(n):\r\n h,m=map(int,input().split())\r\n a=h*60+m\r\n if a>=c+s+1:\r\n exit(print((c)//60,(c)%60))\r\n c=a+s+1 \r\nprint((c)//60,(c)%60) ", "n, s = map(int, input().split())\nt = [0 for i in range(n)]\n\nfor i in range(n):\n _,__ = map(int, input().split())\n t[i] = (_ * 60) + __\n\nif t[0] >= s + 1:\n print(\"0 0\")\n exit()\n\nelse:\n for i in range(n - 1):\n td = t[i+1] - t[i]\n if td >= 2 * (s + 1):\n print((t[i] + s + 1) // 60, end=\" \")\n print((t[i] + s + 1) % 60)\n exit()\n \n print((t[n-1] + s + 1) // 60, end=\" \")\n print((t[n-1] + s + 1) % 60)\n exit()\n\n", "n, s = map(int, input().strip().split())\r\ntimes = [[int(x) for x in input().strip().split()] for _ in range(n)]\r\n\r\nslots = [0] * (24 * 60 * 30)\r\n\r\nfor h, m in times:\r\n start = 60 * h + m\r\n slots[start:start + 1 + s] = [1] * (s + 1)\r\n\r\nc = 0\r\nfor k in range(len(slots)):\r\n if slots[k] != 0:\r\n ok = False\r\n c = 0\r\n continue\r\n c += 1\r\n if c == s + 1:\r\n a = k - s\r\n print('{} {}'.format(a // 60, a % 60))\r\n break\r\n", "a=input().split()\r\ns=int(a[1])\r\na[0]=int(a[0])\r\nb=[]\r\nc=[]\r\nn=0\r\nfor i in range(a[0]):\r\n x=input().split()\r\n b.append(int(x[0])*60+int(x[1]))\r\nfor i in range(a[0]-1):\r\n c.append(b[i+1]-b[i])\r\nif b[0]>s:\r\n print('0 0')\r\nelse:\r\n for i in range(a[0]-1):\r\n if c[i]>=2*(s+1):\r\n print(str((b[i]+s+1)//60)+' '+str((b[i]+s+1)%60))\r\n n=1\r\n break\r\n if n==0:\r\n print(str((b[-1]+s+1)//60)+' '+str((b[-1]+s+1)%60))\r\n", "n, s = [int(i) for i in input().split()]\ri = 0\ra = []\rbool = True\rwhile i < n:\r h, m = [int(i) for i in input().split()]\r time = (60 * h) + m\r if len(a) == 0 and time >= s + 1 and bool:\r print(0, 0)\r bool = False\r elif len(a) > 0 and bool:\r last = a[len(a) - 1]\r if time - last >= (2 * s) + 2:\r m = last + s + 1\r print(m // 60, m % 60)\r bool = False\r a.append(time)\r i += 1\r\rif bool:\r m = a[len(a) - 1] + s + 1\r print(m // 60, m % 60)\r", "a, b = map(int, input().split())\nc = [-b-1]\nfor i in range(a):\n k, l = map(int, input().split())\n c.append(k*60+l)\nc.append(10000000000000000)\nfor i in range(a+1):\n if c[i+1]-c[i]> 2*b+1:\n u = c[i]+b+1\n print(u//60, u%60)\n break", "n,s=map(int,input().split())\r\nl=[]\r\ncond=True\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n l.append(x*60+y)\r\nif l[0]>s:\r\n print(\"0 0\")\r\n cond=False\r\nelse:\r\n for i in range(n-1):\r\n if l[i+1]-l[i]>=2*s+2:\r\n cond=False\r\n print((l[i]+s+1)//60 ,\" \",(l[i]+s+1)%60 ,sep=\"\")\r\n break\r\nif cond :\r\n print((l[n-1]+s+1)//60,\" \",(l[n-1]+s+1)%60,sep=\"\")\r\n\r\n \r\n", "n, s = [int(x) for x in input().split()]\r\n\r\nts = []\r\nfor _ in range(n):\r\n h, m = [int(x) for x in input().split()]\r\n ts.append(h * 60 + m)\r\n\r\nif ts[0] >= s + 1:\r\n print(0, 0)\r\n exit()\r\n\r\ndiffs = [y - x for x, y in zip(ts, ts[1:])]\r\n\r\nfor i, diff in enumerate(diffs):\r\n if diff >= 2 * s + 2:\r\n break\r\nelse:\r\n i = len(ts) - 1\r\n\r\nt = ts[i] + s + 1\r\nprint(t // 60, t % 60)\r\n", "n, s = map(int, input().split())\r\nb = [0] * 1440\r\nfor i in range(n):\r\n h, m = map(int, input().split())\r\n b[h * 60 + m] = 1\r\nk = 0\r\nprev = -s\r\nans = -1\r\nfor i in range(1440):\r\n if b[i] == 1:\r\n if i - prev >= 2 * s + 1:\r\n ans = prev + s\r\n break\r\n else:\r\n prev = i + 1\r\nif ans == -1:\r\n print((prev + s) // 60, (prev + s) % 60)\r\nelse:\r\n print(ans // 60, ans % 60)", "n,s = map(int,input().split())\r\ntemp,ans = 0,False\r\nfor _ in range(n):\r\n h,m = map(int,input().split())\r\n if not ans:\r\n # print(temp)\r\n diff = (h*60+m)-(temp+1)\r\n # print(diff)\r\n if diff >= s:\r\n ans = True \r\n else:\r\n temp = (h*60+m)+ s+1\r\nprint(temp//60,temp%60)", "f = lambda h, m: h * 60 + m\r\ng = lambda t: f'{t // 60} {t % 60}'\r\nn, s = map(int, input().split())\r\nl = [f(*map(int, input().split())) for _ in range(n)] + [float('inf')]\r\nl.sort()\r\nif l[0] != 0 and l[0] >= s + 1:\r\n print(0, 0)\r\n exit()\r\nfor i in range(n):\r\n if l[i + 1] - l[i] >= 2 * s + 2:\r\n print(g(l[i] + s + 1))\r\n break", "from itertools import *\nn, s = map(int, input().split())\ntimes = []\nfor i in range(n):\n h, m = map(int, input().split())\n times.append((h * 60 + m))\n\ntimes.sort()\nfor t in count():\n if all(abs(u - t) > s for u in times):\n print(*divmod(t, 60))\n break\n", "n, s = map(int, input().split())\r\n\r\ntakeOFF = 0\r\nlanding = []\r\n\r\nfor i in range(n):\r\n land_h, land_m = map(int, input().split())\r\n landing.append(land_h*60 + land_m)\r\nlanding.append(2000)\r\n\r\ndef countHM(time):\r\n h = time // 60\r\n m = time % 60\r\n return h, m\r\n\r\nif takeOFF + 1 + s <= landing[0]:\r\n print(\"0 0\")\r\nelse:\r\n for i in range(n):\r\n if landing[i+1] - landing[i] >= 2 + 2*s:\r\n h, m = countHM(landing[i] + 1 + s)\r\n print(str(h) + \" \" + str(m))\r\n break\r\n\r\n", "n, s = input().split(' ')\nn, s = int(n), int(s)\nrst = [-1, -1]\nlast = [0, 0]\nh, m = input().split(' ')\nh, m = int(h), int(m)\nif (h - last[0]) * 60 + (m - last[1]) >= s + 1:\n rst = [0, 0]\nelse:\n last = [h, m]\n for i in range(1, n):\n h, m = input().split(' ')\n h, m = int(h), int(m)\n if (h - last[0]) * 60 + (m - last[1]) >= 2 * s + 2:\n rst = [last[0] + s // 60, last[1] + s % 60 + 1]\n break\n last = [h, m]\nif rst == [-1, -1]:\n rst = [last[0] + s // 60, last[1] + s % 60 + 1]\nif rst[1] >= 60:\n rst[0] += 1\n rst[1] -= 60\nprint(rst[0], rst[1])\n", "n,s = map(int,input().split())\r\na = []\r\nfor i in range(n):\r\n h,m = map(int,input().split())\r\n a.append(60*h + m)\r\na.append(10000000000)\r\nif a[0] > s:\r\n print(0,0)\r\nelse:\r\n for i in range(n):\r\n if (a[i+1]-a[i] > 2*s+1):\r\n print((a[i]+s+1)//60,(1+a[i]+s)%60)\r\n break\r\n", "n, s = map(int, input().split())\r\nh, m = map(int, input().split())\r\nt = m + h * 60\r\nif t - 1 >= s:\r\n print(0, 0)\r\n exit()\r\nok = True\r\nfor i in range(n - 1):\r\n h, m = map(int, input().split())\r\n t1 = m + h * 60\r\n if t1 - t - 2 >= s * 2:\r\n p = t + s + 1\r\n pm = p % 60\r\n ph = p // 60\r\n print(ph, pm)\r\n ok = False\r\n break\r\n t = t1\r\nif ok:\r\n p = t + s + 1\r\n pm = p % 60\r\n ph = p // 60\r\n print(ph, pm)\r\n \r\n", "import sys\nn, s = map(int, input().split())\ninputs = [sys.stdin.readline() for _ in range(n)]\ninit = 0\nchecked = False\nlast = False\nres = [0, 0]\nfor i in inputs:\n h, m = map(int, i.split())\n current = h*60 + m\n if not checked and init == 0 and init + s + 1 <= current:\n break\n if init + 2*s + 2 <= current:\n a = (init + s + 1) // 60\n b = (init + s + 1) % 60\n res = [a, b]\n break\n else:\n init = current\n if init == 0:\n checked = True\n if i == inputs[-1]:\n last = True\nif last:\n h, m = map(int, inputs[-1].split())\n minutes = h*60 + m + s + 1\n a = minutes // 60\n b = minutes % 60\n res = [a, b]\nprint(str(res[0])+\" \"+str(res[1]))\n\n", "n,s=map(int,input().split())\r\narr=[0]\r\narr1=[]\r\nfor i in range(n):\r\n\th,m=map(int,input().split())\r\n\tarr.append(h*60+m)\r\n\tarr1.append([h,m])\r\nans=[0,0]\r\nflag=0\r\nfor i in range(1,n+1):\r\n\tif(i==1):\r\n\t\tif(arr[i]>=s+1):\r\n\t\t\tk=s+1\r\n\t\t\tans=[0,0]\r\n\t\t\tflag=1\r\n\t\t\tbreak\r\n\telse:\r\n\t\tif(arr[i]-arr[i-1]>=2*s+2):\t\r\n\t\t\tk=arr[i-1]+s+1\r\n\t\t\tans[0]=k//60\r\n\t\t\tans[1]=k%60\r\n\t\t\tflag=1\r\n\t\t\tbreak\r\nif(flag==0):\r\n\tk=arr[-1]+s+1\r\n\tans[0]=k//60\r\n\tans[1]=k%60\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", "if_debag = False\n\ninput_texts = \"\"\"3 17\n0 30\n1 0\n12 0\n\"\"\"\n\ninput_texts = input_texts.split('\\n')\nit = iter(input_texts)\n#next(it)\n\ndef my_input():\n if if_debag:\n return next(it)\n else:\n return input()\n\nn, s = my_input().split()\nn = int(n)\ns = int(s)\nhs = list()\nms = list()\nfor _ in range(n):\n h, m = my_input().split()\n h = int(h)\n m = int(m)\n hs.append(h)\n ms.append(m)\nhs.append(30)\nms.append(59)\nans1 = 0\nans2 = 0\nfor i in range(n):\n diff = (hs[i + 1] - hs[i]) * 60 + ms[i + 1] - ms[i]\n if diff - 2 * s - 2 >= 0:\n temp = 60 * hs[i] + ms[i] + 1 + s\n ans1 = temp // 60\n ans2 = temp % 60\n break\ndiff = hs[0] * 60 + ms[0]\nif diff - s - 1 >= 0:\n ans1 = 0\n ans2 = 0\nprint(\"{} {}\".format(ans1, ans2))", "n, m = map(int, input().split())\r\n\r\na = []\r\n\r\nfor i in range(n):\r\n h, min = map(int, input().split())\r\n a.append(min + h * 60)\r\n\r\nanswer = -1\r\n\r\nif a[0] > m:\r\n answer = 0\r\nelse:\r\n for i in range(n - 1):\r\n if a[i + 1] - (a[i] + 1) >= m * 2 + 1:\r\n answer = a[i] + 1 + m\r\n break\r\n\r\nif answer == -1:\r\n answer = a[len(a) - 1] + m + 1\r\n\r\nprint(answer // 60, answer % 60)\r\n", "\r\nn,s = map(int,input().split(' '))\r\n\r\na = list()\r\n\r\nfor i in range(0,n):\r\n a.append([int(x) for x in list(input().split(' '))])\r\n\r\na = sorted(a)\r\n\r\nmn = list()\r\n\r\n\r\nfor i in range(0,len(a)):\r\n mn.append(a[i][0]*60+a[i][1])\r\nmn.append(0)\r\nmn = sorted(mn)\r\n\r\n \r\nl = []\r\nfor i in range(1,len(mn)):\r\n l.append(mn[i]-mn[i-1])\r\n\r\n\r\nfor i in range(0,len(l)):\r\n if i==0:\r\n if l[0]>=s+1:\r\n print('0 0')\r\n break\r\n if l[i]>=2*s+2:\r\n ans = mn[i]+s+1\r\n hour = ans//60\r\n minute = ans%60\r\n print(str(hour)+' '+str(minute))\r\n break\r\n if i==len(l)-1:\r\n ans = mn[i+1]+s+1\r\n hour = ans//60\r\n minute = ans%60\r\n print(str(hour)+' '+str(minute))\r\n\r\n\r\n \r\n", "n, s = map(int, input().split())\r\na = []\r\nfor _ in range(n):\r\n h, m = map(int, input().split())\r\n a.append((h,m))\r\nb = [h*60+m for (h,m) in a]\r\nc = -1\r\nif b[0] > s:\r\n print(0,0)\r\nelse:\r\n for i in range(n-1):\r\n if b[i+1]-b[i] > s*2+1:\r\n c = i\r\n break\r\n r = ((b[c]+s+1) // 60,(b[c]+s+1) % 60)\r\n print(r[0],r[1])", "y=lambda:map(int,input().split())\r\nn,s=y()\r\nr=0\r\nfor f in[0]*n:\r\n h,m=y();t=60*h+m\r\n if t>r+s:break\r\n r=t+s+1\r\nprint(r//60,r%60)", "def run():\r\n n, s = [int(x) for x in input().split()]\r\n d = [[int(x) for x in input().split()] for _ in range(n)]\r\n\r\n first = d[0]\r\n first = first[0]*60+first[1]\r\n if first >= s+1:\r\n print(0, 0)\r\n return\r\n\r\n for i in range(n-1):\r\n lft, rgt = d[i], d[i+1]\r\n lft = lft[0]*60+lft[1]\r\n rgt = rgt[0]*60+rgt[1]\r\n\r\n if rgt - lft >= (s+1)*2:\r\n ans = lft+s+1\r\n print(ans//60, ans%60)\r\n return\r\n\r\n rgt = d[-1]\r\n rgt = rgt[0] * 60 + rgt[1]\r\n ans = rgt+s+1\r\n print(ans // 60, ans % 60)\r\n\r\n\r\nrun()", "n,s=map(int,input().split())\r\nx,y=0,(-s-1)\r\ns=2*s\r\n\r\nflag=0\r\nfor i in range(0,n):\r\n h,m=map(int,input().split())\r\n if flag==0:\r\n t1=x*60+y+1\r\n t2=h*60+m\r\n t3=t2-t1\r\n if t3>s:\r\n print((t1+s//2)//60,(t1+s//2)%60)\r\n flag=1\r\n else :\r\n y=m\r\n x=h\r\n continue\r\nif flag==0:\r\n t1=x*60+y+1+s//2\r\n print((t1)//60,t1%60)" ]

[ "n,m = input().split()\r\nn = int(n)\r\nm = int(m)\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\na.sort()\r\nb.sort()\r\nans = 10000000000000000000\r\nfor i in range(n):\r\n maxi = -10000000000000000000\r\n for j in range(n):\r\n if j != i:\r\n for k in range(m):\r\n pr = a[j] * b[k]\r\n maxi = max(maxi,pr)\r\n ans = min(ans,maxi)\r\nprint(ans)", "n,m=map(int,input().split())\r\n\r\nt=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nt.sort()\r\nb.sort()\r\nans=10000000000000000000\r\nan=-10000000000000000000\r\n\r\nfor i in range(len(t)):\r\n an=-10000000000000000000\r\n for k in range(len(t)):\r\n if i==k:\r\n continue;\r\n else:\r\n for j in range(len(b)):\r\n an=max(an,t[k]*b[j]) \r\n ans=min(ans,an)\r\nprint(ans)", "n, m = input().split()\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nans_g = 1 << 60\r\n\r\nfor i in range(len(a)):\r\n ans = 1 << 60\r\n ans = -ans\r\n for j in range(len(a)):\r\n if j != i:\r\n for k in range(len(b)):\r\n ans = max(ans, a[j] * b[k])\r\n ans_g = min(ans, ans_g)\r\nprint(ans_g)\r\n", "n=input().split()\na=list(map(int,input().split(' ')))\nb=list(map(int,input().split(' ')))\nt=[]\nfor i in range(len(a)):\n p=a[0]\n del a[0]\n t.append(max(max(a)*max(b),min(a)*min(b),min(a)*max(b),max(a)*min(b)))\n a.append(p)\nprint(min(t))", "n, m = map(int, input().split())\r\nn_data = sorted(list(map(int, input().split())))\r\nm_data = sorted(list(map(int, input().split())))\r\nproducts = sorted([[n_data[i] * m_data[j], i] for i in range(n) for j in range(m)])\r\ninit = products[n * m - 1][1]\r\nfor i in range(n * m - 1, -1, -1):\r\n if products[i][1] != init:\r\n print(products[i][0])\r\n break", "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()]\nres=pow(2,60)\nfor i in range(n):\n\tmx=-pow(2,60)\n\tfor j in range(n):\n\t\tif j!=i:\n\t\t\tfor k in range(m):\n\t\t\t\tmx=max(mx, b[k]*a[j])\n\tres=min(res,mx)\nprint(res)\n", "n,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nd = list()\r\nfor i in a:\r\n c = -10**50\r\n for j in b:\r\n c = max(c,i*j)\r\n d.append(c)\r\nd.sort() \r\nprint(d[-2])\r\n", "n,m=map(int,input().split())\r\nl1 = list(map(int,input().split()))\r\nl2 = list(map(int,input().split()))\r\nmx = -100000000000000000000000000000000000\r\nmidx = -1\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tif(l1[i]*l2[j]>mx):\r\n\t\t\tmx = l1[i]*l2[j]\r\n\t\t\tmidx = i\r\ndel l1[midx]\r\nmx = -100000000000000000000000000000000000\r\nfor i in range(n-1):\r\n\tfor j in range(m):\r\n\t\tif(l1[i]*l2[j]>mx):\r\n\t\t\tmx = l1[i]*l2[j]\r\nprint(mx)", "import sys\r\ninput = sys.stdin.readline \r\n\r\nn, m = map(int, input().split()) \r\na = list(map(int, input().split())) \r\nb = list(map(int, input().split())) \r\n\r\nans = [[] for i in range(n)] \r\nfor i in range(n):\r\n for j in range(m):\r\n ans[i].append(a[i] * b[j]) \r\nj = 0 \r\nr = ans[0][0] \r\nfor i in range(n):\r\n if(r < max(ans[i])):\r\n r = max(ans[i]) \r\n j = i \r\nans.pop(j) \r\nr = max(max(i) for i in ans)\r\nprint(r)\r\n", "n, m = [int(x) for x in input().split()]\nns = [int(x) for x in input().split()]\nms = [int(x) for x in input().split()]\nmaxi = -1000000000000000000\nhide = None\nfor i in ns:\n for j in ms:\n if i * j > maxi:\n maxi = j * i\n hide = i\nif hide in ns:\n ns.remove(hide)\nmaxi = -1000000000000000000\nfor i in ns:\n for j in ms:\n if i * j > maxi:\n maxi = j * i\nprint(maxi)", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nans = 10**18\r\n\r\nfor i in range(n):\r\n M = -10**18\r\n \r\n for j in range(n):\r\n if j==i:\r\n continue\r\n \r\n for k in range(m):\r\n M = max(M, a[j]*b[k])\r\n \r\n ans = min(ans, M)\r\n\r\nprint(ans)", "from math import sqrt\r\ndef ii():return int(input())\r\ndef mi():return map(int,input().split())\r\ndef li():return list(mi())\r\ndef si():return input()\r\nn,m=mi()\r\na=li()\r\nb=li()\r\nans=[]\r\nfor i in range(n):\r\n x=[]\r\n for j in range(m):\r\n x.append(a[i]*b[j])\r\n ans.append(max(x))\r\nans.sort(reverse=True)\r\nprint(ans[1])", "def main():\n n, m = list(map(int, input().split()))\n t = list(map(int, input().split()))\n b = list(map(int, input().split()))\n maxs = []\n for ex in range(len(t)):\n maxs.append(max(x * y for i, x in enumerate(t) for y in b if i != ex))\n print(min(maxs))\n\nif __name__ == '__main__':\n main()\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\nmn = 10 ** 20\r\nfor i in range(n):\r\n mx = -1 * (10 ** 20)\r\n for j in range(n):\r\n if j == i:\r\n continue\r\n for k in range(m):\r\n mx = max(mx, a[j] * b[k])\r\n mn = min(mn, mx)\r\nprint(mn)\r\n \r\n", "n, m = map(int, input().split())\na = [int(x) for x in input().split()]\nb = [int(x) for x in input().split()]\nc = [[0 for i in range(m)] for j in range(n)]\na_max = [0 for i in range(n)]\nmu_max_id = 0\na_max[0] = c[0][0] = a[0] * b[0]\nfor j in range(1, m):\n c[0][j] = a[0] * b[j]\n if c[0][j] > a_max[0]:\n a_max[0] = c[0][j]\nfor i in range(1, n):\n a_max[i] = c[i][0] = a[i] * b[0]\n for j in range(1, m):\n c[i][j] = a[i] * b[j]\n if c[i][j] > a_max[i]:\n a_max[i] = c[i][j]\n if a_max[i] > a_max[mu_max_id]:\n mu_max_id = i\na.pop(mu_max_id)\nans = a[0]*b[0]\nfor i in range(n-1):\n for j in range(m):\n ans = max(ans, a[i] * b[j])\nprint(ans)\n# ", "nm,n,m=[int(i) for i in input().split()],[int(i) for i in input().split()],[int(i) for i in input().split()]\r\nmx=-1000000000000000000000000000000\r\nsi=0\r\nfor i in n:\r\n for j in m:\r\n if i*j>=mx:\r\n mx=i*j\r\n si=i\r\nn.remove(si)\r\nmx=-1000000000000000000000000000000\r\nfor i in n:\r\n for j in m:\r\n if i*j>=mx:\r\n mx=i*j\r\n \r\nprint(mx)\r\n", "n,m= input().split(); n,m= int(n), int(m)\r\ntom= list(i for i in map(int, input().split()))\r\nbon= list(i for i in map(int, input().split()))\r\nif max(tom)>0 and min(tom)<=0:\r\n if max(bon)>0 and min(bon)>0:\r\n tom.remove(max(tom))\r\n if max(bon)>0 and min(bon)<=0:\r\n if (min(tom)*min(bon))>(max(tom)*max(bon)):\r\n tom.remove(min(tom))\r\n else:\r\n tom.remove(max(tom))\r\n if max(bon)<=0 and min(bon)<=0:\r\n tom.remove(min(tom))\r\n \r\n \r\n \r\nif max(tom)>0 and min(tom)>0:\r\n if max(bon)>0 and min(bon)>0:\r\n tom.remove(max(tom))\r\n if max(bon)>0 and min(bon)<=0:\r\n tom.remove(max(tom))\r\n if max(bon)<=0 and min(bon)<=0:\r\n tom.remove(min(tom))\r\n \r\n \r\n \r\nif max(tom)<=0 and min(tom)<=0:\r\n if max(bon)>0 and min(bon)>0:\r\n tom.remove(max(tom))\r\n if max(bon)>0 and min(bon)<=0:\r\n tom.remove(min(tom))\r\n if max(bon)<=0 and min(bon)<=0:\r\n tom.remove(max(tom))\r\n \r\nmt= max(tom); mnt= min(tom); mb= max(bon); mnb=min(bon)\r\nr1= mt*mb; r2= mnt*mnb; r3= mt*mnb; r4= mnt*mb\r\nres= max(r1,r2, r3,r4)\r\nprint(res)", "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\n\r\nb.sort()\r\n\r\nfirst = []\r\nfor x in a:\r\n if x > 0:\r\n first.append(x*b[-1])\r\n elif x<0:\r\n first.append(x*b[0])\r\n else:\r\n first.append(0)\r\n\r\nans = 10**25\r\n\r\nfor i in range(len(a)):\r\n s = -10**25\r\n for j in range(len(a)):\r\n if j!=i:\r\n if first[j]>s: s=first[j]\r\n if s < ans: ans=s\r\nprint(ans)", "a,b = input().split(' ')\r\na1=list(map(int,input().split(' ')))\r\nb1=list(map(int,input().split(' ')))\r\nc =[]\r\nfor i in a1:\r\n\tfor j in b1:\r\n\t\tc.append([i*j,i])\r\nc.sort()\r\na1.remove(c[-1][1])\r\nc=[]\r\nfor i in a1:\r\n\tfor j in b1:\r\n\t\tc.append(i*j)\r\nc.sort()\r\nprint(c[-1])", "n,m = map(int, input().split())\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\n\nans1 = float('inf')\nfor i in range(n):\n ans2 = -float('inf')\n for j in range(n):\n if j == i:\n continue\n for k in range(m):\n ans2 = max(ans2, A[j]*B[k])\n ans1 = min(ans1, ans2)\nprint(ans1)\n", "#Python is love <3\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 mx = -1e20\r\n for j in range(n):\r\n if(j==i):\r\n continue\r\n for k in range(m):\r\n mx = max(mx,a[j]*b[k])\r\n c.append(mx)\r\nprint(sorted(c)[0])", "def getList():\n\treturn [int(x) for x in input().split()]\n\ndef brightness(a, b):\n\t_max = a[0] * b[0]\n\tfor x in a:\n\t\tfor y in b:\n\t\t\t_max = max(_max, x * y)\n\treturn _max\n\n\nif __name__ == '__main__':\n\tn, m = map(int, input().split())\n\ta = getList()\n\tb = getList()\n\n\tlenA = len(a)\n\t_min = brightness(a[1:], b)\n\tfor i in range(lenA):\n\t\tl = a[ : i] + a[i + 1 : ]\n\t\tif i == 0:\n\t\t\t_min = brightness(l, b)\n\t\telse:\n\t\t\t_min = min(_min, brightness(l, b))\n\tprint(_min)\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nans1 = 10**18\r\nfor i in range(n):\r\n c = a[:i]+a[i+1:]\r\n ans2 = -10**18\r\n for j in c:\r\n for k in b:\r\n ans2 = max(j*k, ans2)\r\n ans1 = min(ans2, ans1)\r\nprint(ans1)", "# Write Python code in this online editor and run it.\ninput()\na=list(map(int,input().split()))\nb=list(map(int,input().split()))\nprint(min(max(x*y for x in a[:i]+a[i+1:]for y in b)for i in range(len(a))))\n\n\t \t\t\t\t \t\t\t\t \t \t \t\t\t", "n,m = input().split()\r\nn = int(n)\r\nm = int(m)\r\nan = list(map(int, input().split()))\r\nbm = list(map(int, input().split()))\r\nmi = 1e99\r\npair = -1e99\r\nfor i in range(n):\r\n\tpair = -1e99\r\n\tfor j in range(m):\r\n\t\tfor k in range(n):\r\n\t\t\tif i != k:\r\n\t\t\t\tpair = max(pair, an[k]*bm[j])\r\n\tmi = min(mi, pair)\r\nprint(mi)\r\n", "import sys,math \r\nn,m=map(int,sys.stdin.readline().split())\r\na=list(map(int,sys.stdin.readline().split()))\r\nb=list(map(int,sys.stdin.readline().split()))\r\nans=10**20\r\nfor i in range(n):\r\n temp=-10**20\r\n for j in range(n):\r\n if i!=j:\r\n for k in range(m):\r\n temp=max(temp,a[j]*b[k])\r\n ans=min(ans,temp)\r\nprint(ans) ", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nma=-(10**20)\r\nfor j in range(n):\r\n for k in range(m):\r\n p=a[j]*b[k]\r\n if p>ma:\r\n ma=p\r\n x=j\r\ndel a[x]\r\nma=-(10**20)\r\nfor j in range(n-1):\r\n for k in range(m):\r\n ma=max(ma,a[j]*b[k])\r\nprint(ma)\r\n \r\n ", "n, m = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nb = [int(x) for x in input().split()]\r\n\r\nbig = 10**25\r\nsmall = -10**25\r\n\r\nans = big\r\nfor i in range(len(a)):\r\n tmp = small\r\n for j in range(len(a)):\r\n if i==j:continue\r\n for x in b:\r\n _ = a[j]*x\r\n if _ > tmp:\r\n tmp = _\r\n if tmp < ans:\r\n ans = tmp\r\nprint(ans)", "\"\"\"Codeforces P934A. A Compatible Pair\r\n (http://codeforces.com/problemset/problem/934/A)\r\n\r\nProblem tags: brute force\r\n\r\nHint: Considering negative integer, max_i,j(a[i] * b[j]) equals to\r\n max(min(a) * min(b), min(a) * max(b), max(a) * min(b), max(a) * min(b)).\r\nTime Complexity: O(n + m)\r\n\"\"\"\r\n\r\ndef main():\r\n n, m = [int(x) for x in input().split()]\r\n a = [int(x) for x in input().split()]\r\n b = [int(x) for x in input().split()]\r\n \r\n min_a = min(a)\r\n max_a = max(a)\r\n min_b = min(b)\r\n max_b = max(b)\r\n \r\n prod_with_min_a = max(min_a * min_b, min_a * max_b)\r\n prod_with_max_a = max(max_a * min_b, max_a * max_b)\r\n if prod_with_max_a > prod_with_min_a:\r\n a.remove(max_a)\r\n max_a = max(a)\r\n else:\r\n a.remove(min_a)\r\n min_a = min(a)\r\n \r\n print(max(min_a * min_b, min_a * max_b, max_a * min_b, max_a * max_b))\r\n \r\n \r\nif __name__ == '__main__':\r\n main()\r\n", "input()\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\na.sort()\r\nb.sort()\r\nans1=max(a[-2]*b[-1],a[0]*b[0],a[0]*b[-1],a[-2]*b[0])\r\nans2=max(a[-1]*b[-1],a[1]*b[0],a[-1]*b[0],a[1]*b[-1])\r\nprint(min(ans1,ans2))\r\n\r\n", "# python3\n\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(' ')]\nr = []\nfor x in a:\n r.append(max([x*y for y in b]))\nr.sort()\nprint(r[-2])", "n, m = map (int, input().split())\r\nrub = list (map (int, input().split()))\r\nsap = list (map (int, input().split()))\r\n\r\nfst = False # max product\r\nsnd = False # max product with a different ruby from fst\r\n\r\nfor r in rub:\r\n rbest = r * sap[0] # max product with this specific ruby\r\n for s in sap:\r\n rbest = max (rbest, r * s)\r\n # update fst and/or snd\r\n if fst == False:\r\n fst = rbest\r\n elif rbest > fst:\r\n snd = fst\r\n fst = rbest\r\n elif snd == False or rbest > snd:\r\n snd = rbest\r\n \r\nprint (snd)", "from itertools import product\r\n\r\nn, m = map(int, input().split())\r\na = sorted(map(int, input().split()))\r\nb = sorted(map(int, input().split()))\r\nres = float('inf')\r\nfor i in range(n):\r\n res = min(res, max(x * y for x, y in product(a[:i] + a[i + 1:], b)))\r\nprint(res)\r\n", "import copy\r\nn = input()\r\na = [int(x) for x in input().split(' ')]\r\nb = [int(x) for x in input().split(' ')]\r\n\r\nbest = 10000000000000000000000\r\nfor i in a:\r\n\tahide = a.copy()\r\n\tahide.remove(i)\r\n\tcand = -10000000000000000000000\r\n\tfor x in ahide:\r\n\t\tfor y in b:\r\n\t\t\tif x*y>cand:\r\n\t\t\t\tcand = x*y\r\n\tif cand < best:\r\n\t\tbest = cand\r\n\r\nprint(best)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\nt = sorted(map(int, input().split()))\r\nb = sorted(map(int, input().split()))\r\n\r\nif b[-1] <= 0:\r\n c = max(i*j for i in t[1:] for j in b)\r\nelif b[0] >= 0:\r\n c = max(i*j for i in t[:-1] for j in b)\r\nelse:\r\n if t[-1]*b[-1] >= t[0]*b[0]:\r\n c = max(i * j for i in t[:-1] for j in b)\r\n else:\r\n c = max(i * j for i in t[1:] for j in b)\r\nprint(c)", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nmx1=float(\"-inf\")\r\nmx2=0\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tif a[i]*b[j]>mx1:\r\n\t\t\tmx2=i\r\n\t\t\tmx1=a[i]*b[j]\r\nmx1=float(\"-inf\")\r\nfor i in range(n):\r\n\tif i==mx2:\r\n\t\tcontinue\r\n\tfor j in range(m):\r\n\t\tmx1=max(mx1,a[i]*b[j])\r\n\r\nprint(mx1)\r\n\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nans = 0\r\ninf = pow(10, 18) + 1\r\nans = inf\r\nfor i in range(n):\r\n ma = -inf\r\n for j in range(n):\r\n if i == j:\r\n continue\r\n u = a[j]\r\n for v in b:\r\n ma = max(ma, u * v)\r\n ans = min(ans, ma)\r\nprint(ans)", "n,m=[int(x) for x in input().split()]\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\na1=sorted(a)\r\na2=sorted(a,reverse=True)\r\na1.pop()\r\na2.pop()\r\nans=list()\r\nfor i in b:\r\n for j in a1:\r\n ans.append(i*j)\r\nans=sorted(ans)\r\nans1=ans[-1]\r\nans=[]\r\nfor i in b:\r\n for j in a2:\r\n ans.append(i*j)\r\nans=sorted(ans)\r\nans2=ans[-1]\r\nprint(min(ans1,ans2))", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nk=[max(a),min(a)]\r\na.remove(max(a));a.remove(min(a))\r\nc=[]\r\nd=[]\r\nfor i in a:\r\n for j in b:\r\n c.append(i*j)\r\n d.append(i*j)\r\nfor i in b:\r\n c.append(k[0]*i)\r\nfor i in b:\r\n d.append(k[1]*i)\r\nprint(min(max(c),max(d)))", "l=input().split(' ')\nm,n=[int(i) for i in l]\nl1=[int(i) for i in input().split()]\nl2=[int(i) for i in input().split()]\ndef search(l1,l2):\n m=l1[0]*l2[0]\n ci=0\n cj=0\n for i in range(len(l1)):\n for j in range(len(l2)):\n if l1[i]*l2[j]>m:\n m=l1[i]*l2[j]\n ci=i\n cj=j\n return (m,l1[ci],l2[cj])\na,b,c=search(l1,l2)\nl1.remove(b)\nprint( search(l1,l2)[0])\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nans=1000000000000000001\r\nfor i in range(n):\r\n\tans1=-1000000000000000001\r\n\tfor j in range(n):\r\n\t\tif(j!=i):\r\n\t\t\tfor k in range(m):\r\n\t\t\t\tans1=max(ans1,a[j]*b[k])\r\n\tans=min(ans,ans1)\r\nprint(ans)", "n, m = map(int, input().split())\r\ntn = list(map(int, input().split()))\r\ntm = list(map(int, input().split()))\r\n\r\n\r\ndef absmax():\r\n return max([max(tm) * max(tn),\r\n max(tm) * min(tn),\r\n min(tm) * max(tn),\r\n min(tm) * min(tn)]\r\n )\r\n\r\n\r\nif absmax() == max(tm) * max(tn):\r\n tn.remove(max(tn))\r\nelif absmax() == max(tm) * min(tn):\r\n tn.remove(min(tn))\r\nelif absmax() == min(tm) * max(tn):\r\n tn.remove(max(tn))\r\nelse:\r\n tn.remove(min(tn))\r\n\r\nprint(absmax())\r\n", "n, m = input().split(' ');\r\nn = int(n);\r\nm = int(m);\r\nmasA = input().split(' ');\r\nmasB = input().split(' ');\r\nfor a in range(0, n):\r\n masA[a] = int(masA[a]);\r\nfor b in range(0, m):\r\n masB[b] = int(masB[b]);\r\nmax = masA[0]*masB[0]\r\na = 0;\r\nfor i in range(0, n):\r\n for j in range(0, m):\r\n if max <= masA[i]*masB[j]:\r\n max = masA[i]*masB[j];\r\n a = i;\r\ndel masA[a]; \r\n\r\ntwoMax = masA[0]*masB[0]\r\nfor i in range(0, n-1):\r\n for j in range(0, m):\r\n if twoMax <= masA[i]*masB[j]:\r\n twoMax = masA[i]*masB[j];\r\nprint (twoMax)", "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\ns=[]\r\nfor i in a:\r\n m=-10**20\r\n for j in b:\r\n m=max(m,i*j)\r\n s.append(m)\r\ns.sort()\r\nprint(s[-2])\r\n", "n,m = map(int,input().split())\r\nl1 = [int(x) for x in input().split()]\r\nl2 = [int(x) for x in input().split()]\r\nr = [[max(a*b for b in l2)] for a in l1]\r\nr.sort()\r\nprint(r[-2][0])", "n, m = map(int, input().split())\n\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\na.sort()\nb.sort()\n\nmax_banban = a[0]*b[0]\nTommy_to_delete = 0\n\nfor i, fst in enumerate(a):\n\tfor snd in b:\n\t\tif fst*snd > max_banban:\n\t\t\tmax_banban = fst*snd\n\t\t\tTommy_to_delete = i\n\n\nans = None\nfor i, fst in enumerate(a):\n\tif i != Tommy_to_delete:\n\t\tfor snd in b:\n\t\t\tif ans == None or fst*snd > ans:\n\t\t\t\tans = fst*snd\n\nprint(ans)", "m,n = map(int, input().strip().split(' '))\na = list(map(int, input().strip().split(' ')))\nb = list(map(int, input().strip().split(' ')))\n\na.sort()\nb.sort()\n\nif b[0] >= 0:\n a = a[:-1]\nelif b[-1] <= 0:\n a = a[1:]\nelif a[-1]*b[-1] > a[0]*b[0]:\n a = a[:-1]\nelse:\n a = a[1:]\n\nif a[0] >= 0:\n bfinal = max(a[-1]*b[-1],a[0]*b[-1])\nelif a[-1] <= 0:\n bfinal = max(a[0]*b[0],a[-1]*b[0])\nelse:\n bfinal = max(a[-1]*b[-1], a[0]*b[0])\n\nprint(bfinal)\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nr = []\r\nfor i in range(n):\r\n r.append(-10**21)\r\n for j in range(m):\r\n r[-1] = max(r[-1], a[i]*b[j])\r\n\r\nr.sort()\r\nprint(r[-2])\r\n\r\n\r\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\na.sort()\r\nb.sort()\r\nm1=max(a[1]*b[0],a[n-1]*b[m-1],b[m-1]*a[1],a[n-1]*b[0])\r\nm2=max(a[0]*b[0],a[n-2]*b[m-1],b[m-1]*a[0],a[n-2]*b[0])\r\nm2=min(m1,m2)\r\nprint(m2)", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nans = float(\"inf\")\r\nfor i in range(n):\r\n tmp = -float(\"inf\")\r\n for j in range(m):\r\n for k in range(n):\r\n if i != k:\r\n tmp = max(tmp, a[k]*b[j])\r\n ans = min(ans, tmp)\r\nprint(ans)", "a,b=map(int,input().split())\r\nc=list(map(int,input().split()))\r\nd=list(map(int,input().split()))\r\nx=[]\r\nfor i in range(a):\r\n\tm=-10**18\r\n\tfor j in range(b):\r\n\t\tm=max(m,c[i]*d[j])\r\n\tx.append(m)\r\nx.sort()\t\r\nprint(x[-2])\t\t", "\n\ninput()\na=sorted([int(x) for x in input().split()])\nb=sorted([int(x) for x in input().split()])\nans=[]\nfor i in a:\n cur=[]\n for ii in b:\n cur.append(ii*i)\n ans.append(max(cur))\nprint(sorted(ans)[-2])", "from math import *\r\nfor u in range(1):\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 q,v=-inf,-1\r\n for i in range(n):\r\n for j in range(m):\r\n s=a[i]*b[j]\r\n if(s>q):\r\n q=s\r\n v=i\r\n q=-inf\r\n for i in range(n):\r\n for j in range(m):\r\n if(i!=v):\r\n s=a[i]*b[j]\r\n if(s>q):\r\n q=s\r\n print(q)\r\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nt = max(a)\r\na.remove(t)\r\nres1 = max(a) * max(b)\r\nres2 = max(a) * min(b)\r\nres3 = min(a) * max(b)\r\nres4 = min(a) * min(b)\r\nres01 = max(res1, res2, res3, res4)\r\na.append(t)\r\na.remove(min(a))\r\nres5 = max(a) * max(b)\r\nres6 = max(a) * min(b)\r\nres7 = min(a) * max(b)\r\nres8 = min(a) * min(b)\r\nres02 = max(res5, res6, res7, res8)\r\nres = min(res01, res02)\r\nprint(res)", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nm=-100000000000000000000\r\nfor i in b:\r\n for j in a:\r\n if j*i>m:\r\n m=j*i\r\n k=j\r\na.remove(k)\r\nm=-100000000000000000000\r\nfor i in b:\r\n for j in a:\r\n if j*i>m:\r\n m=j*i\r\nprint(m)\r\n \r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Feb 15 14:58:20 2018\r\n\r\n@author: DNARNAprotein\r\n\"\"\"\r\n\r\n\"\"\"\r\nCODEFORCES\r\nhttp://codeforces.com/problemset/problem/934/A\r\n\"\"\"\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\nmax1=-10**18\r\nmax2=-10**18\r\npos=-1\r\nfor i in range(n):\r\n for j in range(m):\r\n l=a[i]*b[j]\r\n if l>max1:\r\n max1=l\r\n pos=i\r\na.pop(pos)\r\nfor i in range(n-1):\r\n for j in range(m):\r\n l=a[i]*b[j]\r\n if l>max2:\r\n max2=l \r\nprint(max2)", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = sorted(map(int, input().split()))\r\nprint(sorted(max(ai * b[0], ai * b[-1]) for ai in a)[-2])", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\nimport array\nfrom bisect import *\nfrom collections import *\nimport fractions\nimport heapq \nfrom itertools import *\nimport math\nimport random\nimport re\nimport string\n\nN, M = map(int, input().split())\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\nA.sort()\nB.sort()\n\nans = 1e20\nfor i in range(N):\n A2 = A[:i] + A[i+1:]\n local_ans = -1e20\n for a in A2:\n for b in B:\n local_ans = max(local_ans, a * b)\n # print(A2, B)\n # print(\"local_ans:\", local_ans)\n ans = min(ans, local_ans)\nprint(ans)\n", "n, m = map(int, input().split())\r\na = sorted(list(map(int, input().split())))\r\nb = sorted(list(map(int, input().split())))\r\nprint(sorted([a[i]*b[-(a[i]>0)] for i in range(n)])[-2])", "n, m = map(int, input().split())\r\na = sorted(map(int, input().split()))\r\nb = sorted(map(int, input().split()))\r\nans = 10 ** 18\r\nfor i in range(n):\r\n cur = -10 ** 18\r\n for u in range(n):\r\n if u == i:\r\n continue\r\n for v in range(m):\r\n cur = max(cur, a[u] * b[v])\r\n ans = min(ans, cur)\r\nprint(ans)", "n,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nt1 = max(a)\r\nt2 = min(a)\r\nt3 = max(b)\r\nt4 = min(b)\r\n\r\nrt1 = max(t1*t3,t1*t4)\r\nrt2 = max(t2*t3,t2*t4)\r\nif rt1 > rt2:\r\n a.remove(t1)\r\n t1 = max(a)\r\nelse:\r\n a.remove(t2)\r\n t2 = min(a)\r\nprint(max(t1*t3,t2*t4,t1*t4,t2*t3))", "inf = -(10**18)\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(reverse=True)\r\nif len(a)>3:\r\n Max = [(a[0] * max(b), a[0] * min(b), 0 if 0 in b else inf), (a[1] * max(b), a[1] * min(b), 0 if 0 in b else inf),\r\n (0 if 0 in a else inf,0 if 0 in a else inf), (a[len(a)-2] * max(b), a[len(a)-2] * min(b), 0 if 0 in b else inf),\r\n (a[len(a)-1] * max(b), a[len(a)-1] * min(b), 0 if 0 in b else inf)]\r\n MAX = [max(Max[0]),max(Max[1]),max(Max[2]),max(Max[3]),max(Max[4])]\r\nelse:\r\n Max = [list(j*i for i in b) for j in a]\r\n MAX = [max(i) for i in Max]\r\nMAX.sort(reverse=True)\r\nprint(MAX[1])\r\n", "n,m=map(int,input().split())\r\nl1=list(map(int,input().split()))\r\nl2=list(map(int,input().split()))\r\nma=l1[0]*l2[0]\r\nfor i in range(len(l1)):\r\n\tfor j in range(len(l2)):\r\n\t\tsu=l1[i]*l2[j]\r\n\t\tif su>=ma:\r\n\t\t\tma=su\r\n\t\t\ti1=i\r\nl3=[]\r\nfor i in range(len(l1)):\r\n\tif i==i1:\r\n\t\tcontinue\r\n\tfor j in range(len(l2)):\r\n\t\tsu=l1[i]*l2[j]\r\n\t\tl3.append(su)\r\nprint(max(l3))", "n, m = map(int, input().split())\r\n\r\nt = sorted([int(z) for z in input().split()])\r\nb = [int(z) for z in input().split()]\r\n\r\nres = []\r\n\r\nfor r in [0, n-1]:\r\n\r\n t2 = t[:r] + t[r+1:]\r\n\r\n res1 = []\r\n\r\n for i in t2:\r\n for j in b:\r\n res1.append([i*j, i, j, r])\r\n\r\n res.append(max(res1))\r\n\r\nres.sort(key = lambda x: x[0])\r\nprint(res[0][0])\r\n\r\n", "n,m=map(int,input().split())\na=list(map(int,input().split()))\nb=list(map(int,input().split()))\n\nrj=float(\"INF\")\n\nfor i in range(n):\n tr=-float(\"INF\")\n for j in range(n):\n if j!=i:\n for k in range(m):\n tr=max(tr,a[j]*b[k])\n rj=min(rj,tr)\n\nprint(rj)\n\n\t \t\t\t\t\t \t \t\t \t\t \t\t", "from math import inf\r\n\r\n\r\ndef compability(lst1, lst2):\r\n lst3 = [-inf] * len(lst1)\r\n for i in range(len(lst1)):\r\n for j in range(len(lst2)):\r\n lst3[i] = max(lst3[i], lst1[i] * lst2[j])\r\n return sorted(lst3)[len(lst1) - 2]\r\n\r\n\r\nn, m = [int(x) for x in input().split()]\r\na = [int(y) for y in input().split()]\r\nb = [int(z) for z in input().split()]\r\nprint(compability(a, b))\r\n", "s = input().split()\r\ns1 = input().split()\r\ns2 = input().split()\r\nn = int(s[0])\r\nm = int(s[1])\r\nlist2 = []\r\nlist1 = []\r\nfor i in s1:\r\n list1.append(int(i))\r\nfor i in s2:\r\n list2.append(int(i))\r\n\r\nlist1.sort()\r\nlist2.sort()\r\ncl = []\r\nfor i in list1:\r\n z = []\r\n for j in list2:\r\n z.append(i*j)\r\n cl.append(max(z))\r\ncl.sort()\r\nprint(cl[n-2])", "n, m=map(int, input().split())\na=sorted(list(map(int, input().split())))\nb=sorted(list(map(int, input().split())))\ndef getscore(a, b):\n return max(x*y for x in a for y in b)\nprint(min(getscore(a[:i] + a[i+1:], b) for i in range(len(a))))\n", "n,m=map(int, input().split())\r\na=list(map(int, input().split()))\r\nb=list(map(int, input().split()))\r\nans=float('inf')\r\nfor i in range(n):\r\n now=-float('inf')\r\n for j in range(n):\r\n if j!=i:\r\n for k in range(m):\r\n now=max(now,a[j]*b[k])\r\n ans=min(ans,now)\r\nprint(ans)\r\n", "n,m=map(int,input().split())\r\nl= sorted(list(map(int,input().split())))\r\nl1=sorted(list(map(int,input().split())))\r\nma=l[0]*l1[0]\r\nma1=l[1]*l1[0]\r\nfor i in range(n-1) :\r\n for j in range(m) :\r\n ma=max(ma,l[i]*l1[j])\r\nfor i in range(1,n) :\r\n for j in range(m) :\r\n ma1=max(ma1,l[i]*l1[j])\r\nprint(min(ma1,ma))\r\n", "# import io,os\r\n# input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\nkk=lambda:map(int,input().split())\r\nk2=lambda:map(lambda x:int(x)-1, input().split())\r\nll=lambda:list(kk())\r\nn,m=kk()\r\ntt,bb = ll(),ll()\r\nfb = sb = 0\r\nmaxi = a = b = 0\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tif (i == 0 and j == 0) or tt[i]*bb[j] > maxi: maxi, a,b = tt[i]*bb[j], i,j\r\nmaxi,fst = 0,True\r\nfor i in range(n):\r\n\tif i == a: continue\r\n\tfor j in range(m):\r\n\t\tif fst or tt[i]*bb[j] > maxi: fst, maxi = False, tt[i]*bb[j]\r\nprint(maxi)\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\nans1=10**18\r\nfor i in range(n):\r\n ans=-10**18\r\n arr=a[:i]+a[i+1:]\r\n #print(arr)\r\n for k in range(n-1):\r\n for j in range(m):\r\n ans=max(ans,arr[k]*b[j])\r\n #print(ans)\r\n ans1=min(ans1,ans)\r\nprint(ans1)", "n,m = map(int,input().strip().split(' '))\na = list(map(int,input().strip().split(' ')))\nb = list(map(int,input().strip().split(' ')))\nre = sorted([(max(a)*max(b),max(a)),\\\n\t \t(min(a)*max(b),min(a)), (max(a)*min(b),max(a)), (min(a)*min(b),min(a))])[-1][1]\na.remove(re)\t\nre = sorted([\\\n\t\t(max(a)*max(b),max(a)),\\\n\t\t(min(a)*max(b),min(a)),\\\n\t\t(max(a)*min(b),max(a)),\\\n\t\t(min(a)*min(b),min(a))\\\n])[-1][0]\nprint(re)\n", "n,m =map(int,input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nc = [max([ax*bx for bx in b]) for ax in a]\r\nc.sort()\r\nprint(c[-2])", "n,m=map(int,input().split(' '))\r\na=list(map(int,input().split(' ')))\r\nb=list(map(int,input().split(' ')))\r\ncmp=a[0]*b[0]\r\nidx=0\r\nfor i in range(n):\r\n for j in range(m):\r\n if(a[i]*b[j]>=cmp):\r\n cmp=a[i]*b[j]\r\n idx=i\r\nans=int(-1*1e18)\r\nfor i in range(n):\r\n for j in range(m):\r\n if(i!=idx and a[i]*b[j]>=ans):\r\n ans=a[i]*b[j]\r\n\r\nprint(ans)\r\n", "n, m = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nb = [int(x) for x in input().split()]\r\n\r\nbig = 10**25\r\nsmall = -10**25\r\n\r\n###b.sort()\r\n\r\nfirst = []\r\nfor x in a:\r\n # if x > 0:\r\n # first.append(x*b[-1])\r\n # elif x<0:\r\n # first.append(x*b[0])\r\n # else:\r\n # first.append(0)\r\n s = small\r\n for y in b:\r\n _ = x*y\r\n if _ > s:\r\n s = _\r\n first.append(s)\r\n \r\n\r\nans =big\r\n\r\nfor i in range(len(a)):\r\n s = small\r\n for j in range(len(a)):\r\n if j!=i:\r\n if first[j]>s: s=first[j]\r\n if s < ans: ans=s\r\nprint(ans)", "def CF934A():\r\n n,m = input(\"\").split(\" \")\r\n n = int(n)\r\n m = int(m)\r\n x = input(\"\").split(\" \")\r\n y = input(\"\").split(\" \")\r\n mini = 1234567890**2\r\n for blocked in range(0,len(x)):\r\n maxi = -(1234567890**2)\r\n for i in range(0,len(x)):\r\n if (blocked == i):\r\n continue\r\n for v in y:\r\n maxi = max(maxi,int(x[i])*int(v))\r\n mini = min(mini,maxi)\r\n print(mini)\r\n\r\n\r\nCF934A()\r\n", "m, n = map(int, input().split())\r\n\r\nlst1 = list(map(int, input().split()))\r\nlst2 = list(map(int, input().split()))\r\n\r\nlst0 = []\r\nfor i in lst1:\r\n lst0.append(max([i * j for j in lst2]))\r\n\r\nans = sorted(lst0)[-2]\r\nprint(ans)\r\n", "n,m=map(int,input().split())\r\narr1=list(map(int,input().split()))\r\narr2=list(map(int,input().split()))\r\nans=[]\r\nfor i in arr1:\r\n ans1=[]\r\n for j in arr2:\r\n ans1.append(i*j)\r\n ans.append(max(ans1))\r\nans.sort(reverse=True)\r\nprint(ans[1])", "# LUOGU_RID: 136030474\nc=input()\na=[int(i) for i in input().split()]\nb=[int(i) for i in input().split()]\na.sort()\nb.sort()\nd=[a[0]*b[0],a[0]*b[len(b)-1]]\ne=[a[len(a)-1]*b[0],a[len(a)-1]*b[len(b)-1]]\nif max(d)>max(e):\n a[0]=a[len(a)-1]\nelse:\n a[len(a)-1]=a[0]\na.sort()\nd=[a[0]*b[0],a[0]*b[len(b)-1]]\ne=[a[len(a)-1]*b[0],a[len(a)-1]*b[len(b)-1]]\nprint(max(d+e))", "import math\r\nn,m=input().split()\r\nn=int(n)\r\nm=int(m)\r\na=[]\r\nb=[]\r\ntemp=[]\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nmini=math.inf\r\nfor i in range(n):\r\n maxi = -(math.inf)\r\n for j in range(n):\r\n if(j!=i):\r\n for k in range(m):\r\n maxi=max(maxi,(a[j]*b[k]))\r\n mini=min(mini,maxi)\r\nprint(mini)", "'''\r\nimport sys\r\nsys.setrecursionlimit(10000)\r\n\r\n(n, k) = map(int, input().split())\r\n\r\nlst = []\r\nfor x in input().split():\r\n lst.append(int(x))\r\n\r\narray = []\r\nfor x in range(n):\r\n mass = [int(x) for x in input().split()[1:]]\r\n array.append(mass)\r\n\r\nd = {}\r\nfor x in range(len(array)):\r\n if not x + 1 in d:\r\n d[x + 1] = []\r\n for y in array[x]:\r\n if y != 0:\r\n d[x + 1].append(y)\r\n\r\narray = [0] * (n + 1)\r\nflag = False\r\nqq = []\r\ndef dfs(v):\r\n global flag\r\n if array[v] == 0:\r\n array[v] = 1\r\n for x in d[v]:\r\n dfs(x)\r\n array[v] = 2\r\n qq.append(v)\r\n elif array[v] == 1:\r\n flag = True\r\n \r\nfor x in lst:\r\n if x in d:\r\n dfs(x)\r\nif flag:\r\n print(-1)\r\nelse:\r\n print(len(qq))\r\n print(*qq)\r\n'''\r\n(n, m) = map(int, input().split())\r\n\r\nlst1 = []\r\nfor x in input().split():\r\n lst1.append(int(x))\r\n\r\nlst2 = []\r\nfor x in input().split():\r\n lst2.append(int(x))\r\n\r\nlst = []\r\nfor x in lst1:\r\n maxi = - (10 ** 18)\r\n for y in lst2:\r\n maxi = max(maxi, x * y)\r\n lst.append(maxi)\r\n\r\nlst.sort()\r\nprint(lst[-2])\r\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nmax1 = max2 = -float('inf')\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i] * b[j] > max1:\r\n max1 = a[i] * b[j]\r\n x = i\r\nfor i in range(n):\r\n if i == x:\r\n continue\r\n for j in range(m):\r\n max2 = max(max2, a[i] * b[j])\r\nprint(max2)", "a, b = map(int, input().split())\r\nnum1 = list(map(int, input().split()))\r\nnum2 = list(map(int, input().split()))\r\nans = []\r\nfor i in num1:\r\n ans.append(max(i*j for j in num2))\r\nans.sort()\r\nprint(ans[-2])\r\n", "n, m = map(int, input().split())\r\na1 = [int(x) for x in input().split()]\r\na2 = [int(x) for x in input().split()]\r\na1.sort()\r\na2.sort()\r\n\r\nans1 = -1e18\r\nans2 = -1e18\r\n\r\nfor i in range(len(a1) - 1):\r\n for j in a2:\r\n ans1 = max(ans1, a1[i] * j)\r\n\r\nfor i in range(1, len(a1)):\r\n for j in a2:\r\n ans2 = max(ans2, a1[i] * j)\r\n\r\nprint(int(min(ans1, ans2)))\r\n", "m,n=map(int,input().split())\nA=input()\na=A.split()\nh=[]\ng=0\nk=[]\n\nfor i in range(0,m):\n g=int(a[i])\n h.append(g)\nB=input()\nb=B.split()\nfor i in range(0,n):\n g=int(b[i])\n k.append(g)\n\nh.sort()\nk.sort()\ns1=max(max(h[1]*k[0],h[-1]*k[-1]),max(h[1]*k[-1],h[-1]*k[0]))\ns2=max(max(h[0]*k[0],h[-2]*k[-1]),max(h[0]*k[-1],h[-2]*k[0])) \nans=min(s1,s2)\nprint(ans)\n", "n,m=map(int,input().split())\r\na = list(map(int, input().split()))\r\nb=list(map(int,input().split()))\r\nres=[]\r\nfor i in a:\r\n mx=-(10**19)\r\n for j in b:\r\n mx=max(mx,i*j)\r\n res.append(mx)\r\n \r\nres=sorted(res)\r\nprint(res[-2])\r\n\r\n\r\n\r\n\r\n", "n,m = map(int,input().split())\na = list(map(int,input().split()))\nb = list(map(int,input().split()))\na.sort()\nb.sort()\ns = set({0,1,n-1,n-2})\narr = []\nfor x in s:\n arr.append((a[x]*b[0],x))\n arr.append((a[x]*b[-1],x))\narr.sort()\nif arr[-1][1]!=arr[-2][1]:\n print(arr[-2][0])\nelse:\n print(arr[-3][0])", "a, b = map(int, input().split())\nlst1 = list(map(int, input().split()))\nlst2 = list(map(int, input().split()))\nlst1.sort()\nlst2.sort()\nlst = lst1[::]\nlst1 = lst1[:-1]\nn = max(lst1[-1] * lst2[-1], lst1[0] * lst2[0], lst1[0] * lst2[-1], lst1[-1] * lst2[0])\nlst1 = lst\nlst1 = lst1[1:]\nm = max(lst1[-1] * lst2[-1], lst1[0] * lst2[0], lst1[0] * lst2[-1], lst1[-1] * lst2[0])\nprint(min(n, m))\n", "n,m = [int(i) for i in input().split()]\nA=list(map(int,input().split()))\nB=list(map(int,input().split()))\n\nans = []\nA.sort()\nB.sort()\n\nif max(A[0] * B[-1] , A[0] * B[0]) > max(A[-1] * B[-1] , A[-1] * B[0]):\n A=A[1:]\nelse:\n A=A[:-1]\n\n\nfor i in A:\n for j in B:\n ans.append(i*j)\n\nprint(max(ans))\n", "def compatible_pair(l1, l2):\n l1 = sorted(l1)\n l2 = sorted(l2)\n\n return min(max(x * y for x in [l2[0], l2[-1]] for y in l) for l in [[l1[0], l1[-2]], [l1[1], l1[-1]]])\n\n\ninput()\nl1 = list(map(int, input().split()))\nl2 = list(map(int, input().split()))\n\n\nprint(compatible_pair(l1, l2))", "n,m = map(int,input().split())\r\narr1 = sorted(map(int,input().split()))\r\narr2 = sorted(map(int,input().split()))\r\nif arr1[-1]*arr2[-1]>arr1[0]*arr2[0]:\r\n l = max(arr1[-2]*arr2[-1],arr1[0]*arr2[0])\r\n if n>2:\r\n l = max(l,arr1[1]*arr2[-1])\r\n if m>2:\r\n l = max(l,arr1[-2]*arr2[0])\r\nelse:\r\n l = max(arr1[-1]*arr2[-1],arr1[1]*arr2[0])\r\n if n>2:\r\n l = max(l,arr1[1]*arr2[-1])\r\n if m>2:\r\n l = max(l,arr1[-2]*arr2[0])\r\nprint(l)" ]

[ "input()\r\nl, c, t = list(map(int, input().split())), [int(s) - 1 for s in input().split()], 0\r\ns = sum(l)\r\nfor i in c:\r\n x, l[i] = l[i], 0\r\n s -= x\r\n t += s * x\r\nprint(t + sum(l[i] * x for i, x in enumerate(l, -1)))", "n,k = map(int,input().split())\r\nlst = list(map(int,input().split()))\r\nsu = sum(lst)\r\nlst2 = list(map(int,input().split()))\r\nvis = []\r\nfor i in range(n):\r\n vis.append(0)\r\nans = 0\r\nfor i in lst2:\r\n vis[i-1] = 1\r\nfor i in range(n):\r\n if vis[i] == 1:\r\n ans += lst[i] * (su-lst[i])\r\n su -= lst[i]\r\n elif vis[i-1] != 1:\r\n ans += (lst[i]*lst[i-1])\r\nprint(ans)", "n,k = map(int,input().split())\r\nlst = list(map(int,input().split()))\r\nsu = sum(lst)\r\nlst2 = list(map(int,input().split()))\r\nvis = [0]*n\r\nans = 0\r\nfor i in lst2:\r\n a = i-1\r\n ans += lst[a]*(su - lst[a])\r\n su -= lst[a]\r\n vis[a] = 1\r\nfor i in range(n):\r\n if vis[i] != 1 and vis[(i+1)%n] != 1:\r\n ans += (lst[i]*lst[(i+1)%n])\r\nprint(ans)", "t=1\r\nwhile t>0:\r\n t-=1\r\n n,k=(int(_) for _ in input().strip().split(' '))\r\n a=list(map(int,input().split()))\r\n b=list(map(int,input().split()))\r\n vis=[0]*100005\r\n sum=0\r\n for i in range(0,n):\r\n sum+=a[i]\r\n ans=0\r\n tmp=0\r\n for i in range(0,k):\r\n vis[b[i]-1]=1\r\n ans+=a[b[i]-1]*(sum-a[b[i]-1]-tmp)\r\n tmp+=a[b[i]-1]\r\n for i in range(0,n-1):\r\n if vis[i]!=1 and vis[i+1]!=1:\r\n ans+=a[i]*a[i+1]\r\n if vis[0]!=1 and vis[n-1]!=1:\r\n ans+=a[0]*a[n-1]\r\n print(ans)", "n, k = map(int, input().split())\nc = list(map(int, input().split()))\nv = set(map(int, input().split()))\ns=sum(c)\nr=0\nfor x in v :\n s=s-c[x-1]\n r=r+s*c[x-1]\n c[x-1]=0\nfor i in range(n) :\n r=r+c[i]* c[(i+1) % n]\nprint(r)\n \n \n \n\n\t \t \t \t\t \t\t\t\t\t\t \t\t \t \t \t\t \t\t" ]

[ "weight = input()\r\nw = int(weight)\r\na = 0\r\nb = w - a\r\nwhile True:\r\n a += 1\r\n b = w - a\r\n if a % 2 == 0 and b % 2 == 0 and b != 0:\r\n print('YES')\r\n break\r\n elif a > w:\r\n print('NO')\r\n break\r\n else:\r\n continue", "# Read the input\nw = int(input())\n\n# Check if it's possible to divide the watermelon\nif w >= 4 and w % 2 == 0:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n \t \t \t\t\t \t\t \t\t\t\t\t", "w = int(input())\r\nif w%2 == 0 and 100>= w >= 3:\r\n print('YES')\r\nelse:\r\n print('NO')", "def check(i):\r\n if i%2 == 0:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\ni=int(input())\r\nif i>3:\r\n print(check(i))\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\nif 2**n % 24 > 9:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def can_divide_watermelon(w):\r\n # If the weight is less than 4, it's not possible to divide it into even parts\r\n if w < 4:\r\n return \"NO\"\r\n \r\n # If the weight is even, it can be divided into two even parts\r\n if w % 2 == 0:\r\n return \"YES\"\r\n \r\n return \"NO\"\r\n\r\n# Read the input\r\nw = int(input())\r\n\r\n# Call the function and print the result\r\nprint(can_divide_watermelon(w))\r\n", "if __name__ == '__main__':\r\n weight = int(input())\r\n print('YES' if not weight%2 and weight>2 else 'NO')", "def can_divide(n) :\r\n if n > 2 and n%2 == 0 :\r\n return \"YES\"\r\n return \"NO\"\r\n\r\n\r\nn = int(input())\r\nans = can_divide(n)\r\nprint(ans)", "n = int(input())\r\nif n == 1 or n == 2: print(\"NO\")\r\nelse:\r\n if n%2 != 0: print(\"NO\")\r\n else: print(\"YES\")", "inp1=int(input())\r\n#inp1=(2x)+(2b)\r\n#inp1=2(x+b)\r\nif inp1%2==0 and inp1>=4:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "w = int(input())\n\nif ((w%2)!=0):\n print(\"NO\")\nelif(w<=2):\n print(\"NO\")\nelse:\n print(\"YES\")", "#4a\r\nw=int(input())\r\nx=2\r\ny=w-2\r\n\r\nif w>1:\r\n if y%2==0 and y!=0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\r\n \r\n ", "l=int(input(\"\"))\nif l%2==0 and l!=2:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "W=int(input())\r\nwhile not 1<=W<=100:\r\n W=int(input())\r\nif W%2==1 :\r\n print(\"NO\")\r\nelif W==2 :\r\n print(\"NO\")\r\nelse :\r\n print(\"YES\")", "def can_divide_watermelon(weight):\r\n if weight < 4:\r\n return \"NO\"\r\n elif weight % 2 == 0 and (weight - 2) % 2 == 0:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n\r\nw = int(input().strip())\r\n\r\nresult = can_divide_watermelon(w)\r\n\r\nprint(result)\r\n", "peso = int(input())\r\ndivisivel = False\r\nif peso % 2 == 0:\r\n for i in range(2, peso, 2):\r\n if (peso - i) % 2 == 0:\r\n divisivel = True\r\nif divisivel:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "k=int(input())\nif k%2==0 and k>2:\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", "w1 = int(input())\r\n\r\ndef can_divide_watermelon(w):\r\n if w % 2 == 0 and w > 2:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\nresult = can_divide_watermelon(w1)\r\nprint(result)", "x = int(input())\r\ny = x + 1\r\nif y % 2 == 0 :\r\n print(\"no\")\r\nelif y % 2 != 0 and y >3:\r\n print(\"yes\")\r\nelse :\r\n print(\"no\")", "def InputNumberEven():\r\n n = int(input())\r\n \r\n if n % 2 == 0 and n != 2:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n\r\n# Chiamata alla funzione InputNumberEven\r\nInputNumberEven()", "a=int(input())\r\nif a % 2 == 0 and 2 <a <=100:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "weight = int(input())\r\nif weight %2 ==0 and 4<= weight<=100:\r\n print('YES')\r\nelse: \r\n print('NO')", "p=int(input())\nif p%2==0 and p>2:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\n\t \t \t\t\t \t\t\t \t\t\t \t \t\t \t\t \t", "a = float(input())\r\nflag = a > 2 and a % 2 == 0\r\nprint(\"YES\" if flag else \"NO\")\r\n", "we = input()\r\nwr=int(we)\r\nif wr < 1:\r\n quit()\r\nif wr ==2 :\r\n print(\"NO\")\r\n quit()\r\nif wr % 2 == 0:\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "kg=int(input())\r\nans='YES' if kg%2==0 and kg>2 else 'NO'\r\nprint(ans)", "x=int(input())\nif x%2==0 and x>2:\n print(\"Yes\")\nelse:\n print(\"No\")\n\t \t\t\t \t\t \t \t \t\t\t\t\t \t \t \t \t", "n = int(input())\r\nflag=0\r\nif n<=2:\r\n print(\"NO\")\r\nelse:\r\n for i in range(1,n+1):\r\n if i%2==0 and (n-i)%2==0:\r\n flag=1\r\n break\r\n if i%2==0 and (n-i)%2==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "a = int(input())\r\nif a == 2 or a % 2 == 1:\r\n print(\"NO\")\r\nelif a % 2 == 0 and a != 2:\r\n print(\"YES\")", "def can_divide_watermelon(w):\r\n # Check if the weight is even and greater than 2\r\n if w % 2 == 0 and w > 2:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n\r\nw = int(input().strip())\r\n\r\nprint(can_divide_watermelon(w))", "weight=int(input())\nif weight % 2 == 0 and weight > 2 :\n print(\"Yes\")\nelse :\n print(\"No\")\n#12\n\t \t \t\t\t\t \t\t\t \t\t\t \t \t \t \t\t \t", "#print('Weight of watermelon: (between 1 and 100)')\ntotal_weight = int(input())\n\n\nif total_weight > 2 and total_weight % 2 == 0:\n print('YES')\nelif total_weight % 2 != 0:\n print('NO')\nelif total_weight == 2:\n print('NO')", "a = int(input())\r\nfor i in range(1, a + 1):\r\n b = a - i\r\n if i % 2 == 0 and b % 2 == 0 and a != 2:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')", "w=int(input())\nif (w==2):\n print(\"NO\")\nelif (w % 2 == 0) :\n print(\"YES\")\nelse:\n print(\"NO\")", "n=int(input())\r\nans=\"YES\" if n%2==0 and n!=2 else \"NO\"\r\nprint(ans)", "a=input(\"\")\r\n \r\nif(int(a)%2==0): \r\n if(int(a)==2):\r\n print(\"NO\") \r\n else:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "wt=int(input())\r\nif wt%2==0 and wt!=2:\r\n print('YES')\r\nelse:\r\n print('NO')", "fr = int(input())\r\nif fr % 2 == 0 and fr > 2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "print(\"NO\" if (x:=int(input())) == 2 or x % 2 == 1 else \"YES\")", "W=int(input())\r\nR=0\r\nfor i in range(1,W):\r\n if 2+i==W and i%2==0:\r\n R+=1\r\nif R==1 or R>1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input()) \r\nif n == 2:\r\n print(\"No\")\r\nelif n%2==0:\r\n\tprint(\"Yes\")\r\nelse:\r\n\tprint(\" No\")", "n=int(input())\r\nflag=0\r\nfor i in range(1,n+1):\r\n for j in range(1,n+1):\r\n if i%2==0 and j%2==0 and i+j==n:\r\n flag=1\r\n break\r\nif flag==1:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "\r\nw = int(input());print(\"YES\" if (w % 2 == 0 and w > 2) else'NO')\r\n", "# Read the weight of the watermelon\r\nw = int(input())\r\n\r\n# Check if it's possible to divide the watermelon as desired\r\n# Both parts should have an even weight, so we check if w is even and greater than 2\r\nif w % 2 == 0 and w > 2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "W = int(input())\nif W != 2 and W%2 == 0:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t\t \t \t \t \t \t\t\t \t\t \t \t", "m=int(input ())\nif m>2 and m%2==0:\n print(\"Yes\")\nelse:\n print(\"No\")\n \t\t\t \t \t\t\t\t\t \t \t\t \t\t \t", "def es_posible_dividir_sandia(peso_sandia):\r\n # Verificar si el peso de la sandía es par y mayor o igual a 4 (ya que dos partes deben ser impares)\r\n if peso_sandia % 2 == 0 and peso_sandia >= 4:\r\n # Si cumple las condiciones, es posible dividirla en dos partes iguales\r\n return \"YES\"\r\n else:\r\n # Si no cumple las condiciones, no es posible dividirla en dos partes iguales\r\n return \"NO\"\r\n\r\n# Leer el peso de la sandía desde la entrada estándar\r\npeso = int(input())\r\n\r\n# Calcular si es posible dividir la sandía y mostrar el resultado\r\nresultado = es_posible_dividir_sandia(peso)\r\nprint(resultado)", "n=int(input())\ndef even(num):\n if num%2==0:\n return True\n else:\n return False\nif even(n)==False or n==2:\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", "w=int(input())\r\nif w %2 ==0 and w!=2:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")", "import random\r\nimport math\r\nt = int(input())\r\nfor ___________ in range(1000):\r\n x = random.randint(0, t)\r\n if(x%2==0 and x>0 and (t-x)%2==0 and t-x>0):\r\n print(\"YES\")\r\n exit(0)\r\nprint(\"NO\")\r\n", "n = int(input())\r\nans = \"YES\" if (n > 2 and n % 2 == 0) else \"NO\"\r\nprint(ans)", "def sandia(n):\r\n if (n==2):\r\n print(\"NO\")\r\n else:\r\n if (n%2==0 ):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nn=int(input())\r\nsandia(n)", "num = int(input())\r\nprint('Yes' if num % 2 == 0 and num > 2 else 'No')", "number = int(input())\nif number%2==0 and number!=2:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "w = int(input()) # Read the weight of the watermelon\r\n\r\n# Check if it's possible to split into two even parts\r\nif w > 2 and w % 2 == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "w = input()\r\na = int(w)\r\nif a == 2:\r\n print(\"NO\")\r\nelif a%2 ==1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n ", "\r\nmango=int(input())\r\nif(mango>2 and mango%2==0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "w = input()\r\n\r\n\r\nif (int(w) == 2):\r\n\tprint('NO')\r\n\t\r\nelif (int(w)%2) == 0:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')\r\n", "x = int (input())\r\nif x%2 == 0 and x != 2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def check_even(x):\n if x%2 == 0 and x !=2 :\n print(\"YES\")\n else:\n print(\"NO\")\n\n\n\ndef main():\n\n x = int(input())\n check_even(x)\nmain()\n", "import sys\r\nsys.setrecursionlimit(10000000)\r\n\r\ndef judge(x):\r\n for i in range(1,n):\r\n if i%2==0 and (n-i)%2==0:\r\n return True\r\n return False\r\n\r\nn = int(input())\r\nif judge(n):print(\"YES\")\r\nelse:print(\"NO\")", "wt = int(input())\r\nif wt >= 4 and wt%2 == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def can_divide_watermelon(w):\r\n if w % 2 != 0 or w == 2:\r\n # If the weight is odd or equal to 2, it cannot be divided into even parts\r\n return \"NO\"\r\n else:\r\n return \"YES\"\r\n\r\n# Read the weight of the watermelon from input\r\nw = int(input())\r\n\r\n# Check if the watermelon can be divided as required\r\nresult = can_divide_watermelon(w)\r\n\r\n# Print the result\r\nprint(result)\r\n", "print (\"\".join(\"NO\" if x&1 or x==2 else \"YES\" for x in [int(input())]))", "k=int(input())\r\n\r\nprint((\"NO\",\"YES\")[(k%4)%2<1 and k !=2])", "import sys\n\ndef can_split(v: int) -> bool:\n if v % 2 != 0:\n return False\n if v == 2:\n return False\n return True\n\ndef main():\n input = [int(line.strip()) for line in sys.stdin][0]\n print(\"YES\" if can_split(input) else \"NO\")\n \nif __name__ == \"__main__\":\n main()\n", "n = int(input())\r\nprint('YES' if (n!=2 and n%2==0) else 'NO')", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[3]:\n\n\nw= int(input())\n\nif w>2 and w%2==0 and w<=100 :\n print(\"yes\")\nelse :\n print(\"no\")\n\n\n# In[ ]:\n\n\n\n\n", "b=int(input())\r\nc=0\r\nfor i in range(1,b+1):\r\n for j in range(2,b+1):\r\n if(i%2==0 and j%2==0):\r\n if(i+j==b):\r\n c=1\r\n break\r\nif c==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\na = int(input())\n\nif (a % 2 == 0 and a >= 4):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "w=int(input())\r\nk=0\r\nfor i in range(2,w,2):\r\n if i%2== 0 and (w-i)%2==0:\r\n print('YES')\r\n k+=1\r\n break\r\nif k==0:\r\n print('NO')", "a = int(input())\nb=a%2\nif b==0:\n if (a/2)%2==0 or ((a-2)/2)%2==0 and (a-2)/2>0 :\n print('YES')\n else:\n print('NO')\nelse:\n print('NO')", "def can_divide_watermelon(weight):\r\n if weight % 2 == 1:\r\n return \"NO\" \r\n\r\n for part_weight in range(2, weight, 2):\r\n if (weight - part_weight) % 2 == 0:\r\n return \"YES\" \r\n\r\n return \"NO\" \r\n\r\nweight = int(input())\r\nresult = can_divide_watermelon(weight)\r\nprint(result)\r\n", "# Read the input\r\nw = int(input().strip())\r\n\r\n# Check if it's possible to divide the watermelon as described\r\nif w % 2 == 0 and w > 2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def can_divide_watermelon(w):\n # Check if the weight is greater than or equal to 4 and even\n if w >= 4 and w % 2 == 0:\n return \"YES\"\n else:\n return \"NO\"\n\n\n# Read input\nw = int(input())\n\n# Check if the watermelon can be divided as per the conditions\nresult = can_divide_watermelon(w)\n\n# Print the result\nprint(result)\n", "def rr(): return input().strip()\r\ndef rri(): return int(rr())\r\ndef rrm(): return list(map(int, rr().split()))\r\n\r\n\r\ndef main(w):\r\n if w % 2 == 0 and w != 2:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n\r\n\r\nif __name__ == \"__main__\":\r\n print(main(rri()))\r\n", "weight = int(input())\r\n\r\n# Check if the weight is less than 4 or odd\r\nif weight < 4 or weight % 2 != 0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n = int(input())\nprint(\"NO\" if n % 2 or n == 2 else \"YES\")", "x=int(input())\r\nif(x%2!=0 or x==2):\r\n print(\"no\")\r\nelse: print(\"Yes\")", "w=input()\r\nif w=='2': print(\"NO\")\r\nif w!='2':\r\n if (int(w)%2)==0: print(\"YES\")\r\nif (int(w)%2)!=0: print (\"NO\")", "\r\n\r\nx = int(input())\r\nif x % 2 == 1 or x == 2:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n\r\n", "def main():\r\n # code\r\n w=int(input())\r\n if w%2 == 0 and w!=2:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n pass\r\n\r\n \r\n \r\n### -- ONLINE VS. LOKAL MODE -- ### \r\n_TEST_ALL_EX=False\r\ntry:\r\n _TEST_ALL\r\n _TEST_ALL_EX=True\r\nexcept (NameError):\r\n main()\r\n pass\r\nif _TEST_ALL_EX:_TEST_ALL()", "f=int(input())\nif f%2==0 and f>2:\n print(\"Yes\")\nelse:\n print(\"No\")\n\t \t\t\t\t\t \t\t\t \t \t \t\t\t \t", "# def to_right_del(x, y):\r\n# if x > y:\r\n# x, y = y, x\r\n# flag = False\r\n# while True:\r\n# for i in range(2, 6):\r\n# if (x % i == 0) and (y % i == 0):\r\n# x //= i\r\n# y //= i\r\n# flag = True\r\n# if not flag:\r\n# return x, y\r\n# flag = False\r\n#\r\n#\r\n# a, b = map(int, input().split())\r\n# list1 = [1, 2, 3, 4, 5, 6]\r\n# list1 = list1[list1.index(max(a, b)):]\r\n# if len(list1) / 6 == 0:\r\n# print('0/1')\r\n# elif len(list1) / 6 == 1:\r\n# print('1/1')\r\n# else:\r\n# a1, a2 = to_right_del(len(list1), 6)\r\n# print(f'{a1}/{a2}')\r\n\r\na = int(input())\r\nif a == 2:\r\n print('NO')\r\nelif (a - 2) % 2 == 0:\r\n print('YES') \r\nelse:\r\n print('NO')\r\n", "w = int(input())\r\ndef can_divide_watermelon(w):\r\n if w % 2 != 0:\r\n return \"NO\"\r\n \r\n for i in range(2, w // 2 + 1):\r\n if i % 2 == 0 and (w - i) % 2 == 0:\r\n return \"YES\"\r\n \r\n return \"NO\"\r\nprint(can_divide_watermelon(w))", "def main():\r\n\r\n w = int(input())\r\n\r\n dec = w % 2\r\n\r\n if dec == 0 and w>2:\r\n print(\"YES\")\r\n\r\n else:\r\n print(\"NO\")\r\n\r\nmain()", "#/opt/homebrew/bin/python3\n\ndef read_input():\n # Read a single integer from input\n w = int(input())\n\n return w\n\n# Example usage of the read_input() function\nw = read_input()\n\nif w % 2 == 0 and w > 2:\n print(\"YES\")\n\nelse:\n print(\"NO\")\n\n", "def getAnswer(i):\r\n if(i<=2):\r\n return \"NO\"\r\n j=2;\r\n while(j<i and j!=i):\r\n if((i-j)%2==0):\r\n return \"YES\"\r\n j=j+2\r\n return \"NO\"\r\n \r\n\r\ni = int(input())\r\nprint(getAnswer(i))\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Aug 28 22:37:36 2023\r\n\r\n@author: Lenovo\r\n\"\"\"\r\n\r\nw=int(input())\r\nif w==2 or w%2==1:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")\r\n ", "w = input()\nw = int(w)\nif w == 2 :\n print(\"NO\")\nelif w % 2 == 0 :\n print(\"YES\")\nelse:print(\"NO\")\n\t \t\t \t\t \t \t \t \t \t \t\t\t", "def watermelon(weight):\r\n if weight == 2:\r\n print(\"NO\")\r\n return\r\n elif weight == 0:\r\n print(\"NO\")\r\n return\r\n elif weight%2 == 0:\r\n print(\"YES\")\r\n return\r\n else:\r\n print(\"NO\")\r\n return\r\n \r\nwatermelon(int(input()))", "w = input()\r\nif int(w)==2:\r\n print('NO')\r\nelif int(w) % 2 == 0:\r\n print(str('YES'))\r\nelse:\r\n print(str('NO'))", "w = int(input())\r\nprint('YES' if w > 3 and w%2 == 0 else 'NO')", "# -*- coding: utf-8 -*-\n\"\"\"4A - Watermelon\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1A7Ops7-A8_91EhB18tviSnOBzQ2CLwty\n\"\"\"\n\n# w kilos\n#even numbers : w % 2 == 0 and w > 2:\n\ndef watermelon_weight(w):\n if w % 2 == 0 and w > 2 and w < 101:\n return \"YES\"\n else:\n return \"NO\"\n\nw = int(input())\nresult = watermelon_weight(w)\nprint (result)", "w = int(input())\r\nif w == 2:\r\n print(\"No\")\r\nelse:\r\n if w % 2 == 1:\r\n print(\"No\")\r\n else:\r\n print(\"Yes\")\r\n ", "test = int(input())\r\nif(test > 2 and test %2==0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "w = int(input(\"\"))\nprint(\"YES\") if (w>2 and w%2==0) else print(\"NO\")\n", "def is_mul4(num):\r\n if (num % 2 == 0 and num >= 4) :\r\n return \"YES\"\r\n else :\r\n return \"NO\"\r\n\r\nnum = int(input())\r\n\r\nresult = is_mul4(num)\r\n\r\nprint(result);\r\n\r\n", "\r\nprint('YES' if int(input()) in range(4, 101, 2) else 'NO')", "w = int(input())\r\nprint('NO') if 1&w or w==2 else print('YES')", "class Solution:\n def divide_melon(self, n: int):\n if n < 4 or n % 2 != 0:\n print(\"NO\")\n else:\n print(\"YES\")\n\n\nif __name__ == \"__main__\":\n n = int(input())\n\n solution = Solution()\n solution.divide_melon(n)\n", "a=int(input())\nif a%2==0 and a>=4:\n print(\"YES\")\nelse:\n print(\"NO\")#print\n \t\t \t\t \t\t\t\t \t \t\t \t\t \t", "print(\"YES\" if (a := int(input())) % 2 == 0 and a > 2 else \"NO\")\n", "def can_divide_watermelon(weight):\r\n if weight % 2 == 0 and weight != 2:\r\n return 'YES'\r\n else:\r\n return 'NO'\r\n\r\nweight = int(input())\r\nprint(can_divide_watermelon(weight))\r\n", "n=int(input())\r\nif n % 2 == 0 and n >2: print('yes')\r\nelse : print('no')", "n = int(input())\r\nprint(\"YES\" if (n%2 == 0 and n != 2) else \"NO\")", "a=int(input())\r\ni=a%2\r\nif a==2 or i==1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "arbuz = int(input())\r\nflag = None\r\nfor i in range(1,arbuz):\r\n if (arbuz - i) % 2 == 0 and i % 2 == 0:\r\n flag = True\r\nprint(\"YES\" if flag else \"NO\")", "w=int(input())\r\nwhile not (1<=w<=100):\r\n w=int(input())\r\nif (w%2==0) and (w>2):\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")\r\n ", "# your code goes here\r\ns=int(input())\r\nif s%2==0 and s!=2:\r\n\t print('Yes')\r\nelse:\r\n\tprint('No')\r\n\t", "w = int(input())\r\ndef is_watermelon_divisible(w):\r\n return 'NO' if (w%2 or w < 3) else 'YES'\r\nprint(is_watermelon_divisible(w))", "s= int(input())\r\n\r\nif s % 2 == 1 or s == 2:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "N = int(input())\r\nif not N%2 and N//2 >=2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n# shoud be 2(a + b), a+b>=2", "w = int(input())\r\nprint( \"NO\" if (w % 2 == 1 or w == 2) else \"YES\")", "#codeforces watermelon\r\n\r\nw = int(input())\r\n\r\nif (w%2 == 0 and w > 3):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "print('YES' if ((n := int(input()))%2 == 0) and (n > 2) else 'NO')", "w = int (input())\r\nif w %2 == 0 and w >3:\r\n print (\"YES\")\r\nelse:\r\n print(\"NO\") ", "num = int(input())\r\nif(num%2==0 and num>2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def arbuz(a):\r\n if ((a > 2) and (a <= 100) and (a % 2 == 0)):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\narbue = int(input())\r\narbuz(arbue)", "def can_divide_watermelon(w):\r\n # Check if 'w' is even and greater than 2\r\n if w > 2 and w % 2 == 0:\r\n return \"YES\" # 'w' can be divided into two even parts\r\n else:\r\n return \"NO\" # 'w' is odd or less than 2 and cannot be divided into two even parts\r\n\r\n# Input the weight of the watermelon\r\nw = int(input())\r\n\r\n# Check and print the result\r\nresult = can_divide_watermelon(w)\r\nprint(result)\r\n", "n = int(input())\nif(n<=2): print(\"NO\")\nelif(n%2==0): print(\"YES\")\nelse: print(\"NO\")\n \t \t\t \t\t \t \t \t\t \t\t", "w=int(input())\nif w % 2 == 0 and w > 3:\n print(\"yes\")\nelse:\n print(\"no\")\n \t \t \t\t \t\t\t\t \t\t \t \t\t\t\t \t\t", "n=int (input())\r\nw=0\r\nm=0\r\nif (n>2):\r\n if (n%2 !=0):\r\n print(\"NO\")\r\n n=w+m\r\n elif (w%2 !=0 and m%2 != 0):\r\n print(\"NO\")\r\n else: print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\n\nbatee5 = int(input())\n\nif batee5 > 2:\n if batee5 % 2 == 0:\n print(\"YES\")\n else:\n print(\"NO\")\nelse:\n print(\"NO\")\n\n", "a=float(input())\r\nif a < 4:\r\n print(\"NO\")\r\nelif ((a >= 4) and (a % 2 == 0)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "k = int(input())\r\nif k % 2 == 0 and k > 2:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "watermelon_input = int(input())\r\n\r\nif watermelon_input%2==0 and watermelon_input!=2 :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "W = int(input())\nif W < 3:\n print(\"NO\")\nelse:\n print(\"NO\" if (W - 2) % 2 else \"YES\")\n\n", "n = int(input())\r\nif n%2==0 and n>2:print(\"Yes\")\r\nelse:print(\"No\")", "# LUOGU_RID: 123782818\na = int(input())\r\nif a%2 != 0 or a == 2:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "c = int(input())\n\nif c%2==0 and c !=2:\n print(\"YES\")\nelse :\n print(\"NO\")", "w=int(input())\r\nif w>=1 and w<=100:\r\n if w%2==0 and w>2:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")", "w=int(input())\r\nif w%2==0 and (w>2 and w<=100):\r\n print(\"YES\")\r\nelse:\r\n print(\"No\")\r\n", "def main():\n a = int(input())\n if a%2 == 0 and a>2:\n print(\"YES\")\n return 0\n else:\n print(\"NO\")\n return 0\n \nmain()\n \t\t\t \t\t \t\t\t \t\t \t \t\t\t\t \t \t", "w=int(input())\r\n\r\nif w%2 !=0 or w== 2:\r\n print('NO')\r\nelse:\r\n print('YES')", "w = int(input())\nif (w&1) or w == 2: print(\"NO\")\nelse: print(\"YES\")\n\t\t \t\t\t \t \t\t \t\t \t\t\t\t\t\t \t\t \t\t \t", "n=int(input())\r\nif (n%2==0) and (n!=2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "x=int(input())\r\nif(x>3 and x%2==0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=int(input())\r\nif s==0 or s==2:\r\n print(\"No\")\r\nelif(s%2==0):\r\n print(\"YES\")\r\nelse:\r\n print(\"No\")", "def even (kilo):\r\n if kilo%2==0 and kilo>2:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n \r\nkilo = int(input())\r\nprint(even(kilo))", "watermelon_w = int(input())\r\n\r\nif watermelon_w % 2 == 0 and watermelon_w>2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "w=int(input())\r\nif w%2==0 and w!=2 and w!=0:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "W = int(input())\r\nif W!=2 and W%2==0:\r\n print('Yes')\r\nelse:\r\n print('No')", "w=int(input())\nflag=0\nfor i in range(0,w):\n for j in range(i+1,w):\n if (i+j)==w and (i+j)%2==0:\n flag=1\nif(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", "# LUOGU_RID: 120811707\na=int(input())\nif a>2 and a%2==0:print(\"YES\")\nelse:print(\"NO\")", "import os\r\nimport sys\r\nimport io\r\nimport platform\r\n\r\n\r\ndef solve(weight: int) -> str:\r\n if weight > 2 and (weight % 2) == 0:\r\n return 'YES'\r\n else:\r\n return 'NO'\r\n\r\n\r\ndef main():\r\n # inputs = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n is_local = platform.node() == 'DESKTOP-S81101C'\r\n if is_local:\r\n input_reader = open('input.txt', 'r')\r\n output_writer = open('output.txt', 'w')\r\n else:\r\n input_reader = io.BytesIO(os.read(0, os.fstat(0).st_size))\r\n output_writer = sys.stdout\r\n inputs = input_reader.readline()\r\n\r\n if not is_local:\r\n inputs = inputs.decode()\r\n out = solve(int(inputs))\r\n output_writer.write(f'{out}\\n')\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "check = int(input())\r\nif check >= 4 and check % 2 == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "w = input()\r\nif int(w)>=1 and int(w)<=100 :\r\n if int(w) % 2 == 0 and not int(w)==2 :\r\n print('YES')\r\n else :\r\n print('NO')\r\nelse:\r\n print('Weight should be between 1 and 100')", "In=int(input())\r\nif(In%2==0 and In>2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "x=int(input())\nif x%2==1:\n print(\"NO\")\nelif x==2:\n print(\"NO\")\nelse:\n print(\"YES\")\n", "w= int(input ())\r\nif (w%2 ==0 and w!= 2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def can_divide_watermelon(u):\r\n \r\n if u % 2 == 0 and u > 2:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\nu = int(input().strip())\r\nprint(can_divide_watermelon(u))\r\n", "w = int(input())\r\n\r\ncnt = 0\r\nfor i in range(1, w):\r\n if i % 2 == 0 and (w - i) % 2 == 0:\r\n cnt += 1\r\n\r\nif cnt > 0:\r\n print('YES')\r\nelse:\r\n print('NO')", "inp = int(input().strip())\r\nif inp%2==0 and inp>=4:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "\r\nv = int(input())\r\nif v % 2 == 0 and v!=2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = int(input())\nif a%2==0 and a > 3: print('YES')\nelse: print('NO')\n", "n=int(input())\r\n\r\nif(n==0 or n==2):\r\n print(\"No\")\r\nelse:\r\n if( (n%2)==0):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n ", "import sys\ninput = sys.stdin.readline\nimport math as m\nimport heapq as hq\n\ndef inp():\n return list(map(int,input().split()))\n\nmod=1000000007\n\ndef binpow(a,b,m):\n res=1\n while b>0:\n if b&1:\n res=(res*a)%m\n a=(a*a)%m\n b>>=1\n return res%m\n\ndef mod_inv(q):\n return binpow(q,mod-2,mod)\n\nw=int(input())\nif w<=3:\n print(\"NO\")\nelif w&1:\n print(\"NO\")\nelse:\n print(\"YES\")\n\n#for _ in range(int(input())):\n #print(\"<======== TESTCASE NUMBER \",_+1,\" ========>\")\n #solve()\n\t\t\t\t \t\t \t\t \t\t\t\t \t \t\t \t", "n = int(input())\r\n\r\nif(n<4):print(\"NO\")\r\nelif((n>=4) and (n%2 == 0)):print(\"YES\")\r\nelse:print(\"NO\")", "n=int(input())\r\nk=n%2\r\nif k==0 and n>2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nif n == 2: print(\"NO\")\r\nelse:\r\n if n%2==0:\r\n if (n-2)%2==0:\r\n print(\"YES\")\r\n else: \r\n print(\"NO\")\r\n else: \r\n print(\"NO\")", "W=int(input())\n\nif W%2==0 and W>=4:\n print(\"YES\")\nelse :\n print(\"NO\")\n\t \t \t\t\t \t \t\t \t\t \t \t \t", "n=int(input())\nif (n%2==0 and n>2) :\n print(\"YES\")\nelse :\n print(\"NO\")\n\t\t\t \t\t\t\t \t \t \t \t \t\t\t\t", "w = int(input())\r\nif 2<w and w%2 ==0:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")", "w: int = int(input())\r\n\r\nif w % 2 == 0 and w>2:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "kg = int(input())\r\n\r\nif kg % 2 == 0 and kg > 2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "# LUOGU_RID: 123865459\nimport math\na=int(input(''))\nif a%2 != 0 or a == 2:\n print('NO')\nelse:\n print('YES')\n ", "a=int(input())\r\nif a!=2 and a%2==0:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "n=int(input())\r\nif 1<=n<=100 and n!=2 and n%2 == 0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "num = int(input())\r\nif(num%2==0 and num != 2):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "def func(weight):\r\n if weight % 2 == 0 and weight > 2:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\nweight = int(input())\r\nresult = func(weight)\r\nprint(result)", "p =int(input())\n\nif(p%2==0 and p>2):\n print(\"Yes\")\nelse:\n print(\"No\")\n \t \t \t \t\t\t\t \t \t \t \t\t \t", "input= int (input())\r\nif input %2 == 0 and input>3:\r\n print(\"YES\")\r\nelse :\r\n print (\"NO\")\r\n\r\n\r\n", "def main():\n w =int(input(\" \"))\n mod=w%2\n\n if w>2 and mod==0 and w<=100:\n print(\"YES\")\n else:\n print(\"NO\")\n \n \nmain()\n\t \t \t\t\t\t \t\t\t \t\t \t \t \t\t \t\t", "i = int(input())\n\n\nif i % 2==0 and i>3:\n print(\"Yes\")\nelse:\n print(\"No\")\n\t \t \t \t\t\t\t \t\t\t\t \t\t", "watermalon=int(input())\r\nif( watermalon%2==0 and watermalon!=2):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "w = int(input())\nfor part1 in range(1, w):\n if part1%2==0 and (w-part1)%2==0:\n print( 'YES')\n break\nelse:\n print( 'NO')\n\n \n", "num = input()\r\nif int(num) % 2 == 0 and int(num) >= 1 and int(num) <= 100 and int(num) != 2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "w = int(input())\nprint(\n\t'YES' if w >= 4 and w % 2 == 0\n\telse 'NO'\n)", "a = input()\r\na = int(a)\r\nif a == 2:\r\n print(\"NO\")\r\nelif a%2 == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") ", "water = int(input())\nif water > 2 and water % 2 == 0 and (water - 2) % 2 == 0:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n \t \t\t\t \t\t \t \t\t", "w = int(input())\r\nf = False\r\nfor i in range(2, w):\r\n if i % 2 == 0 and (w - i) % 2 == 0:\r\n f = True\r\n break\r\nif f:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "lm10 = input()\nlm10 = int(lm10)\nif lm10%2==0 and lm10 !=2:\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", "x = int(input())\r\n\r\nif x % 2 == 0 and x >= 4:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "def fun(n):\r\n for i in range(n):\r\n for j in range(n):\r\n if(i%2==0 and j%2==0 and i+j==n):\r\n return True\r\n return False\r\n\r\nn = int(input())\r\nres = fun(n)\r\nif(res):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\nif(n == 2):\n\tprint(\"NO\")\nelif(n % 2 != 0):\n\tprint(\"NO\")\nelse:\n\tprint(\"YES\")\n\n", "import sys\ninput = sys.stdin.readline\n\n############ ---- Input Functions ---- ############\ndef inp():\n return(int(input()))\ndef inlt():\n return(list(map(int,input().split())))\ndef insr():\n s = input()\n return(list(s[:len(s) - 1]))\ndef invr():\n return(map(int,input().split()))\n\nif __name__ == \"__main__\":\n weight = inp()\n\n if weight % 2 == 0 and weight > 2:\n print (\"YES\")\n else:\n print(\"NO\")\n ", "a=int(input())\r\nif((a%2!=0) or (a==2)):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "int1 = int(input(''))\nif int1%2 == 0 and int1 > 2:\n print(\"YES\")\nelse:\n print(\"NO\")", "kilo = int(input())\r\n\r\n\r\nif kilo%2 == 0 and kilo!= 2 and kilo < 101:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "print((lambda x: 'YES' if x%2 == 0 and x != 2 else 'NO')(int(input())))", "weight = int(input())\r\nif weight>3 and weight%2==0:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "watermelon_piceis=int(input())\r\n \r\nif (watermelon_piceis)%2==0 and watermelon_piceis!=2:\r\n print(\"YES\")\r\n \r\nelse:\r\n print(\"NO\")\r\n", "# арбуз\r\nn = int(input())\r\nflag = False\r\nfor i in range(1, n):\r\n for j in range(i, n):\r\n if ((i + j) == n) and (i % 2 == 0) and (j % 2 == 0):\r\n flag = True\r\n break\r\nif flag:\r\n print('YES')\r\nelse: print('NO')", "w = int(input())\nprint(\"YES\" if w > 2 and w % 2 == 0 else \"NO\")\n \t\t \t \t\t \t\t\t \t \t\t \t \t \t", "w1=int(input())\r\nif w1%2==0 and w1!=2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "w = int(input())\r\nif w % 2 == 0:\r\n if w / 2 % 2 == 0:\r\n if ((w / 2) + 1) % 2 == 0 and ((w / 2) - 1) % 2 == 0:\r\n print(\"YES\")\r\n elif w/2 % 2 == 0:\r\n print(\"YES\")\r\n else:\r\n if (w/2 + 1) % 2 == 0 and (w/2 - 1) % 2 == 0 and w/2 != 1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelif w % 2 != 0 and (((w - 1) / 2) % 2 == 0 and (((w - 1) / 2) + 1) % 2 == 0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\nctr = 0\r\nfor i in range(2, n, 2):\r\n if (n - i) % 2 == 0:\r\n ctr += 1\r\n break\r\n\r\nif ctr > 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "w = int(input())\r\nfor i in range(1, w):\r\n if i % 2 == 0 and (w - i) % 2 == 0:\r\n print(\"Yes\")\r\n break\r\nelse:\r\n print(\"No\")\r\n", "a = int(input())\r\n\r\nc = a % 2\r\n\r\nif c == 1 or a == 2:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n ", "#input\nw=input()\nw=int(w)\n\n\n#process\nif (w-2) % 2==0 and w-2!=0:\n print(\"YES\")\n\n\nelse:\n print(\"NO\")\n \t \t\t\t\t\t\t \t\t\t \t\t\t\t \t \t \t", "x=int(input())\r\nif(x%2==0 and x!=2):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "# LUOGU_RID: 126327530\na=int(input())\r\nif((a%2)==0)and(a!=2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "Watermelon_weight = input(\"\")\r\nif int(Watermelon_weight) % 2 == 0 and int(Watermelon_weight) != 2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# Lee el peso de la sandía\nw = int(input())\n# Verifica si los niños pueden dividir la sandía de la manera deseada\n# Para que ambas partes pesen un número par, el peso total debe ser par y mayor que 2\nif w % 2 == 0 and w > 2:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n \t\t\t\t \t \t \t \t \t\t \t \t \t \t", "print(\"YES\" if 2**int(input()) % 24 > 8 else \"NO\")", "\r\nw = int(input())\r\nif w>=1 and w<=100:\r\n if w % 2 == 0 and w > 2:\r\n print(\"yes\")\r\n else:\r\n print(\"no\")\r\n", "num = input()\nnum = int(num)\nif num % 2 == 0 and num >= 4: \n print (\"YES\")\nelse: \n print (\"NO\")\n\n", "def divide_watermelon(w):\r\n if w%2 == 1 or w == 2:\r\n return \"NO\"\r\n else:\r\n return \"YES\"\r\nw = int(input())\r\nresult=divide_watermelon(w)\r\nprint(result)", "p=int(input())\r\nif p%2!=0 or p==2 :\r\n print(\"no\")\r\nelse:\r\n print(\"yes\")\r\n\r\n\r\n\r\n\r\n\r\n \r\n", "n=int(input())\r\nif(n%2==0 and n>3):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "x = int(input())\r\n\r\nif x%2 or x == 2:\r\n print(\"NO\")\r\n \r\nelse:\r\n print(\"YES\")", "a = input()\r\na = int(a)\r\nif a == 1 or a == 2:\r\n print('NO')\r\nelif a % 2 == 0:\r\n print('YES')\r\nelse:\r\n print('NO')", "w = int(input())\nif (w%2==0 and w>2):\n print(\"YES\")\nelse:\n print(\"NO\")", "def m(w):\r\n if w%2!=0 or w==2:\r\n return 'NO'\r\n else:\r\n return 'YES'\r\nw=int(input())\r\nprint(m(w))\r\n ", "weight = int(input())\r\n\r\nif (weight == 2):\r\n print(\"NO\")\r\nelif (weight == 0):\r\n print(\"NO\")\r\nelif (weight%2==0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def can_divide_watermelon(w):\r\n if w >= 4 and w % 2 == 0:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n\r\n# Read input from the user\r\nw = int(input())\r\n\r\n# Check if the watermelon can be divided as required and print the result\r\nprint(can_divide_watermelon(w))\r\n", "input = int(input())\r\n\r\nif input%2==0 and input>3:\r\n print(\"Yes\")\r\n\r\nelse:\r\n print(\"No\")\r\n", "w = input()\nw = int(w)\nif w%2==0 and w !=2:\n print(\"yes\")\nelse:\n print(\"no\")\n \t \t \t \t \t\t \t \t\t\t", "i=int(input())\r\n\r\nif i % 2 == 0 and i > 2:\r\n print(\"Yes\\n\")\r\nelse:\r\n print(\"No\\n\")", "# -*- coding: utf-8 -*-\n\"\"\"Introduction.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1IlKYvBFzI68vpK4zMjLWOtfZMOm7vHE2\n\"\"\"\n\na = int(input())\nif (a == 1 or a == 2 or a % 2 != 0):\n print(\"NO\")\nelse:\n print(\"YES\")", "w = int(input())\r\nprint(\"NO\" if w % 2 or w == 2 else \"YES\")", "def main() -> None :\r\n WEIGHT:int = None\r\n #region inputWeight() -> int\r\n WEIGHT = int(input())\r\n #endregion\r\n\r\n IS_POSSIBLE:bool = None\r\n #region isPossible(weight: int) -> bool\r\n if WEIGHT == 2 : IS_POSSIBLE = False\r\n else : IS_POSSIBLE = (WEIGHT%2 == 0)\r\n #endregion\r\n\r\n #region printYesNo(is_possible: bool) -> None\r\n print([\"NO\", \"YES\"][IS_POSSIBLE])\r\n #endregion\r\n\r\nmain()", "q=int(input())\nif q%2==0 and q>2:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t \t \t\t\t \t\t \t \t \t \t\t\t \t", "w = int(input())\r\ndef watermelon(a):\r\n if(a%2==0 and a!=2):\r\n return True\r\n else:\r\n return False\r\n \r\nif(watermelon(w) == True):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def sochan(w):\r\n if w%2==0 and w!=2:\r\n return'Yes'\r\n else:\r\n return 'No'\r\nw=int(input())\r\nprint(sochan(w))", "w = int(input())\r\n\r\n# Since they want both halves to be even, and addition of two even numbers is even, w has to be even\r\n# This is then simply a check for whether or not 'w' (the total) is even\r\n\r\nif w % 2 == 0 and w > 2: # As 2 is the only even number tha canot be split into two positive even numbers\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\r\n\r\nif n%2 == 0 and n>3:\r\n print(\"yes\")\r\nelse:\r\n print(\"No\")", "import math as m\nw = int(input())\nif ((w/2) != 1):\n if (m.floor(w/2) == w/2):\n print(\"YES\")\n else:\n print(\"NO\")\nelse :\n print(\"NO\")\n\t\t \t\t\t\t\t \t \t\t \t\t \t \t\t \t", "# Read the weight of the watermelon from input\r\nw = int(input())\r\n\r\n# Check if it's possible to divide the watermelon as described\r\nif w % 2 == 0 and w > 2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "\r\nw=int(input())\r\n\r\narr=[]\r\n\r\nfor i in range(2,w-1 if(w%2==0) else w):\r\n if(i%2==0): arr.append(i)\r\n \r\ndef solve(arr):\r\n for i in range(len(arr)):\r\n for j in range(i,len(arr)):\r\n if(arr[i]%2==0 and arr[j]%2==0 and arr[i]+arr[j]==w):\r\n return True\r\n return False\r\n\r\nprint(\"YES\") if(solve(arr)) else print(\"NO\")\r\n\r\n", "p=[4, 6, 6, 8, 8, 8, 10, 10, 10, 10, 12, 12, 12, 12, 12, 14, 14, 14, 14, 14, 14, 16, 16, 16, 16, 16, 16, 16, 18, 18, 18, 18, 18, 18, 18, 18, 20, 20, 20, 20, 20, 20, 20, 20, 20, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 92, 92, 92, 92, 92, 92, 92, 92, 92, 92, 92, 92, 92, 92, 92, 92, 92, 92, 92, 92, 92, 92, 92, 92, 92, 92, 92, 92, 92, 92, 92, 92, 92, 92, 92, 92, 92, 92, 92, 92, 92, 92, 92, 92, 92, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100]\r\nj=(int(input()))\r\nif j in p:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "w_input = input()\r\nw = int(w_input)\r\n\r\nif (w % 2 ) == 1 or w ==2:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")", "import random\r\nw = int(input());\r\nif w > 2:\r\n if w % 2 != 0:\r\n print(\"No\")\r\n else:\r\n x = random.randint(2, w-2)\r\n while x % 2 != 0:\r\n x = random.randint(2, w-2)\r\n if 1 <= w <= 100:\r\n if w % 2 == 0:\r\n z = w - x\r\n if x % 2 == 0 and z % 2 == 0:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\nelse:\r\n print(\"No\")", "w=int (input())\r\nif w%2==0 and w!=2:\r\n print(\"YES\\n\")\r\nelse:\r\n print(\"NO\\n\")", "w=int(input())\r\nflag=0\r\nfor i in range(1,w):\r\n if (i)%2 == 0 and (w-i)%2==0:\r\n flag=1\r\n break\r\nif flag==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n", "a=int(input())\r\nif a<4:print(\"NO\")\r\nelif a%2==0 :print(\"YES\")\r\nelse:print(\"NO\")", "n = int(input())\nif n > 3 and n % 2 == 0: print(\"YES\")\nelse: print(\"NO\")", "s=int(input())\r\nif s%2==0 and s!=2:\r\n print('YES')\r\nelse:\r\n print('NO')", "n=int(input())\r\nif n%2==0 and n!=2:print(\"YES\")\r\nelse:print(\"NO\")", "def can_divide_watermelon(weight):\r\n if weight % 2 == 0 and weight > 2:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n\r\n# Read the input\r\nweight = int(input())\r\n\r\n# Check if the watermelon can be divided as desired\r\nresult = can_divide_watermelon(weight)\r\n\r\n# Print the result\r\nprint(result)\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\n# for _ in range(II()):\r\nw = int(input())\r\nif w == 2: print(\"NO\")\r\nelse:\r\n print('NO' if w & 1 else 'YES')", "from sys import stdin\n\ndef main():\n\n w = int(stdin.readline())\n temp = w - 2\n if temp % 2 == 0 and w != 2:\n \n if temp + 2 == w:\n print(\"YES\")\n\n else:\n print(\"NO\")\n \n\n\nmain()\n\n\t \t\t\t\t\t\t\t \t \t\t\t\t\t\t \t \t \t", "w=int(input())\r\nprint(\"Yes\" if w>2 and w%2==0 else \"NO\")", "a=input()\na=int(a)\nif a%2==0 and a>2:\n print(\"YES\")\nelse :\n print(\"NO\")\n\t\t \t\t\t\t\t \t \t \t \t \t\t\t \t\t\t", "n = int(input()) # Convert the input to an integer\r\n\r\nif n % 2 == 0 and n != 2:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")\r\n", "# n, m = map(int, input().split())\n# descr = [list(map(int, input().split())) for _ in range(n)]\n# d = [0] * (m + 1)\n# for w, p in descr:\n# for oldsum in range(m - w, -1, -1):\n# d[oldsum + w] = max(d[oldsum + w], d[oldsum] + p)\n# print(oldsum, end=\" \")\n# print()\n# for elem in d:\n# print(elem, end=\" \")\n# print(d[m])\nw = int(input())\nif w == 2:\n print(\"NO\")\nelse:\n print(\"YES\") if w % 2 == 0 else print(\"NO\")", "n = int(input())\r\nif(n%2 != 0) or (n==2):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "c = int(input())\r\nif (c!=2) and (c%2==0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "w = int(input())\nprint('YES') if (not w%2 and w > 2) else print('NO')\n", "abs=int(input())\r\nif(abs%2==0 and abs>2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "n = int(input())\r\n\r\nif n not in {0, 1, 2, 3} and n % 2 == 0:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "w=int( input())\nif w%2==0 and w>2:\n print('Yes')\nelse:\n print('No')\n#503\n\t \t \t \t\t \t\t \t\t \t\t \t", "weight = int(input())\nif weight == 2:\n\tprint(\"NO\")\nelse:\n\trem = weight % 2\n\ta = rem % 2\n\tif a ==0:\n\t print(\"YES\")\n\telse:\n\t print(\"NO\")\n \t\t \t \t \t\t\t \t \t\t\t \t", "n=int(input())\r\nc=0\r\nfor i in range(1,n):\r\n j=n-i\r\n if i%2==0 and j%2==0:\r\n c+=1 \r\nif c>0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def divide_watermelon(w):\r\n if w % 2 == 0 and w > 2:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n\r\n# Read the weight of the watermelon from input\r\nw = int(input())\r\n\r\n# Call the function to check if the watermelon can be divided as desired\r\nresult = divide_watermelon(w)\r\n\r\n# Print the result\r\nprint(result)\r\n", "k=0\r\nw=int(input())\r\nfor i in range(w):\r\n for j in range(i,w):\r\n if i%2==0 and j%2==0 and i+j==w:\r\n print(\"YES\")\r\n k=1 \r\n break\r\n if k==1:\r\n break \r\n \r\nif k!=1:\r\n print(\"NO\")", "n = int(input())\r\nif n>2 and n%2 == 0:\r\n print('yes')\r\nelse:\r\n print('no')", "# LUOGU_RID: 123941968\na=int(input(\"\")) #akfdak\r\nif a==2: #;;afjle\r\n print(\"NO\") #wcnm\r\nelif a%2==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n \r\n \r\n\r\n\r\n\r\n \r\n \r\n\r\n", "peso = int(input())\r\nif peso %2 == 0 and peso!=2:\r\n print(\"Yes\")\r\nelse:\r\n print(\"NO\")", "s=int(input())\nif s>2 and s%2==0:\n print(\"Yes\")\nelse:\n print(\"No\")\n\t\t\t \t\t \t\t\t\t \t\t\t \t \t \t", "input=int(input())\nif input % 2 ==0 and input>3:\n print(\"yes\")\n\nelse:\n print(\"no\")", "w = int(input()) \r\nif(w > 3 and w % 2 == 0):print('YES')\r\nelse:print('NO')", "W=int(input())\nif W%2==0 and W>2:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t\t\t \t \t\t \t\t\t \t\t \t\t\t \t", "# Read the input\r\nz = int(input())\r\n\r\n# Check if the watermelon weight can be divided as required\r\nif z >= 4 and z % 2 == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "f=int(input())\nif f%2==0 and f>2:\n print(\"yes\")\nelse:\n print(\"no\")\n \t \t \t \t\t\t\t \t \t", "N= int(input())\r\nif(N%2==0 and N!=2):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "'''a,b = map(int,input().split(\" \"))\narr1 = list(map(int,input().split(\" \")))\nans=a\nfor i in arr1:\n if i >b:\n ans+=1\nprint(ans)\n'''\nw = int(input(\"\"))\nif w % 2 == 0 and w > 2:\n print(\"YES\") # They can divide the watermelon as desired\nelse:\n print(\"NO\") # They cannot divide the watermelon as desired\n\n# Input the weight of the watermelon\n\n\n\n", "import sys\ninput = sys.stdin.readline\n\n############ ---- Input Functions ---- ############\ndef inp():\n \"\"\"For taking integer inputs.\"\"\"\n return(int(input()))\ndef inlt():\n \"\"\"For taking list inputs.\"\"\"\n return(list(map(int,input().split())))\ndef insr():\n \"\"\"For taking string inputs (list of characters)\"\"\"\n s = input()\n return(list(s[:len(s) - 1]))\ndef invr():\n \"\"\"For taking space seperated integer variable inputs.\"\"\"\"\"\n return(map(int,input().split()))\n\ndef solve_problem(w):\n if w % 2 == 0 and w > 2:\n print(\"YES\")\n else:\n print(\"NO\")\n\nw = inp()\nsolve_problem(w)\n", "n=int(input())\r\nif n%2==1 or n==2:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")\r\n", "x = int(input())\r\nif x % 2 == 0 and x != 2:\r\n print(\"YES\", end=\"\")\r\nelse:\r\n print(\"NO\", end=\"\")", "a = int(input())\r\nk = 0\r\nif a % 2 == 0 and a != 2:\r\n k = 1\r\nif k == 1:\r\n print(\"YES\")\r\nif k == 0:\r\n print(\"NO\")", "import sys\r\ninput = sys.stdin.readline()\r\nwhile input:\r\n input = int(input)\r\n if input % 2 == 0 and input > 2:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n input = sys.stdin.readline()\r\n", "w = int(input())\r\n\r\n# Check if it is possible to divide the watermelon into two parts\r\n# such that each part weighs an even number of kilos\r\nif w % 2 == 0 and w > 2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def main():\r\n n=int(input())\r\n if n==2:\r\n print(\"NO\")\r\n return\r\n if (n)%2==0:\r\n print(\"YES\")\r\n return\r\n print(\"NO\")\r\n# for _ in range(int(input())):\r\nmain()\r\n ", "a=int(input())\r\nif a==1 or a==2 or a==3:\r\n print(\"NO\")\r\nelse:\r\n if(a%2):\r\n print(\"NO\")\r\n else :\r\n print(\"YES\")\r\n", "n=int( input ())\nif n>2 and n%2==0:\n print(\"Yes\")\nelse:\n print(\"No\")\n \t \t \t \t \t\t\t \t\t\t", "a=int(input())\nif a %2==0 and a>2:\n print(\"yes\")\nelse:\n print(\"no\")\n\t \t \t \t \t \t \t\t \t\t", "n = int(input())\r\nprint(\"YES\" if not n % 2 and n != 2 else \"NO\")", "a = int(input())\nif a>2 and a%2 == 0:\n print(\"yes\")\nelse:\n print(\"no\")\n\n\n \t \t\t \t\t\t\t \t \t\t \t\t \t \t\t", "import sys\r\n\r\nw = int(sys.stdin.readline().split()[0])\r\n\r\nif w % 2 != 0 or w < 4:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "x=int(input())\r\nprint('YES') if x>2 and x%2==0 else print(\"NO\")", "k = int(input())\n\nif k < 3 or k % 2 != 0:\n print(\"NO\")\nelse:\n print(\"YES\")\n \t \t \t \t\t \t \t\t\t \t \t\t", "weight = int(input())\r\n\r\nif weight == 2 or weight%2 == 1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "c=int(input())\r\nif c%2==0 and c>2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\ndic = {True: \"YES\", False: \"NO\"}\ni = int(input())\nprint(dic[(i % 2 == 0) and (i > 2)])", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Oct 4 18:49:32 2023\r\n\r\n@author: Pranto\r\n\"\"\"\r\ndef calculate_di():\r\n x=input()\r\n x=int(x)\r\n if x==2:\r\n print(\"NO\\n\") \r\n elif x%2!=0: \r\n print(\"NO\\n\") \r\n else: \r\n print(\"YES\\n\")\r\ncalculate_di()", "def can_divide_watermelon(weight):\r\n if weight % 2 == 0 and weight > 2:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n\r\n# Read input\r\nw = int(input())\r\n\r\n# Call the function and print the result\r\nresult = can_divide_watermelon(w)\r\nprint(result)\r\n", "g=int(input())\r\nif g>=4 and g%2==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def can_divide_watermelon(w: int) -> str:\r\n return \"YES\" if w > 2 and w % 2 == 0 else \"NO\"\r\n\r\n# Reading the weight of the watermelon from standard input\r\nw = int(input().strip())\r\n\r\n# Determining if it can be divided into two even parts\r\nresult = can_divide_watermelon(w)\r\n\r\n# Printing the result to standard output\r\nprint(result)\r\n", "n = int(input())\r\nif (n >= 4 and n % 2 ==0):\r\n print('YES')\r\nelse:\r\n print('NO')", "i = int(input())\r\nprint(\"YES\" if i % 2 == 0 and i > 2 else \"NO\")", "x = int(input())\r\ny = x%2\r\nif y==0 and x>2:\r\n print('YES')\r\nelse :\r\n print('NO')", "input = int(input())\r\nif input % 2 == 0 and input > 3:\r\n print('YES')\r\n \r\nelse:\r\n print('NO') ", "w = int(input())\r\n\r\n# w % 2 == 0\r\nif w != 2 and divmod(w, 2)[1] == 0:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "x = int(input())\r\n\r\ndef isCutable(x):\r\n\tif(x == 2): \r\n\t\tprint('NO')\r\n\t\treturn\r\n\t\r\n\tif(x % 2 == 0):\r\n\t\tprint('YES')\r\n\telse:\r\n\t\tprint('NO')\r\n\r\nisCutable(x)\r\n", "# Input: Weight of the watermelon\r\nw = int(input())\r\n\r\n# Check if it's possible to split into two even-weight parts\r\nif w % 2 == 0 and w > 2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# This is a sample Python script.\r\n\r\n# Press Shift+F10 to execute it or replace it with your code.\r\n# Press Double Shift to search everywhere for classes, files, tool windows, actions, and settings.\r\n\r\n\r\n# Press the green button in the gutter to run the script.\r\nif __name__ == '__main__':\r\n weight = int(input())\r\n if (weight % 2) or (weight == 2):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Sep 13 18:15:41 2023\r\n\r\n@author: 雷雨松\r\n\"\"\"\r\n\r\na=int(input())\r\n\r\nif a==2:\r\n print(\"NO\")\r\nelif a%2==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def can_divide_watermelon(w):\r\n for i in range(2, w, 2):\r\n if (w - i) % 2 == 0:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\nw = int(input())\r\nprint(can_divide_watermelon(w))\r\n", "n=int(input())\r\nprint(\"YES\") if n%2==0 and n!=2 else print(\"NO\")", "x = int(input())\r\nprint(\"YES\" if (x % 2 == 0) and (x >= 4) else \"NO\")", "n = int(input())\n#f=0;\n#for i in range(1,n):\n # for j in range(i+1,n):\n # if((i+j==n)and((i+j)%2==n)):\n # f=1\n#if f==1:\n#print(\"YES\")\n#else:\n#print(\"NO\")\nif n==2:\n print(\"NO\")\nelif n%2==0:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t\t\t\t \t \t \t\t \t\t\t \t\t \t \t", "N = int(input())\r\nif( N % 2 == 0 and N >2 ):\r\n print(\"YES\")\r\nelse: \r\n print(\"NO\") ", "# standard_input = \"8\"\r\n\r\ni = int(input())\r\n\r\nprint(\"YES\" if i % 2 == 0 and i > 2 else \"NO\")\r\n\r\n# even * even\r\n# 2 * i * 2 * j\r\n# 4 * i * j\r\n\r\n# even - even = even\r\n# odd - even = odd\r\n", "m = int(input())\r\nif m == 2:\r\n print(\"NO\")\r\nelif m % 2 == 1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "num = input()\r\nif 2 == int(num):\r\n print(\"NO\")\r\n exit()\r\nif 0 == (int(num) % 2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "num = int(input())\r\nif (num%2==0 and num!=2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "water_melon = int(input())\nif water_melon % 2 == 0 and water_melon > 2:\n print(\"Yes\")\nelse:\n print(\"No\")\n \t \t\t \t \t\t\t\t \t \t\t\t\t\t\t\t", "weight=input()\r\nif int(weight) <= 2:\r\n print('NO')\r\nelif int(weight)%2 == 0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "J=int(input())\nif J%2==0 and J>2:\n print(\"Yes\")\nelse:\n print(\"No\")\n \t \t \t \t \t \t\t \t \t\t\t \t\t \t\t", "w=input()\nw=int(w)\nif w%2==0 and w !=2:\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", "# Read the weight of the watermelon\nw = int(input())\n\n# Check if it's possible to divide it into two parts with even weights\n# Both parts should be positive and even, so we check if w is greater than 2 and even\nif w > 2 and w % 2 == 0:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\t \t\t \t\t \t\t\t \t\t \t \t \t\t", "number = int(input())\r\nright = number % 2\r\nif right == 0 and number != 2 and number != -2:\r\n print(\"YES\")\r\nelse:\r\n print('NO')\r\n ", "x = int(input())\r\nif (x%2==0 and x > 2):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "# Read the weight of the watermelon from the user\r\nweight = int(input())\r\n\r\n# Check if the weight can be divided into two even parts\r\nif weight % 2 == 0 and weight > 2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "w=int(input())\nif w%2==0 and w>=4:\n print(\"yes\")\nelse:\n print(\"no\")#ukuug\n \t\t \t \t \t \t \t\t\t \t \t\t", "if 2**int(input())%24 > 9:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "w=int(input())\r\nif (w>2) and w%2==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "num=int(input())\r\nif num==0 or num==2:\r\n print(\"NO\")\r\nelif num %2==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "j=int(input( ))\nif j>2 and j%2==0:\n print(\"yes\")\nelse:\n print(\"no\")\n\t \t \t \t \t \t \t\t\t\t \t \t\t", "w=int(input())\nif w<=3 or w%2==1:\n\tprint(\"NO\")\nelse: \n\tprint(\"YES\")\n \t\t\t \t \t \t \t \t \t\t \t\t", "\n\ndef main():\n weight = int(input())\n if (weight % 2==0 and weight != 2):\n print(\"YES\")\n else:\n print(\"NO\")\n \nif __name__ == \"__main__\":\n main()\n\n", "n = int(input())\n\nif (n%2 == 0) and (n != 2):\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "x = input()\ny = int(x) % 2\nif int(x) != 2 and y == 0:\n print(\"YES\")\nelse:\n print(\"NO\")", "n = int(input())\r\n\r\nif (n%2 != 0) or (n == 2):\r\n print(\"no\")\r\nelse:\r\n print(\"yes\")", "num=int(input())\r\nif num % 2 == 0 and num >2 :\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "def main(n):\r\n for i in range(1, n + 1):\r\n for j in range(1, n + 1):\r\n if i + j == n and i % 2 == 0 and j % 2 == 0:\r\n return \"YES\"\r\n\r\n return \"NO\" \r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n\r\n print(main(n))", "weight= int (input())\r\nif weight==2 or 0:\r\n print (\"NO\")\r\nelif weight % 2 == 0:\r\n print (\"YES\")\r\nelse :\r\n print (\"NO\")", "weight = int(input())\nif (weight%2) == 0 and weight != 2:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "k=int(input())\r\nif k<=2 or k%2!=0:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")", "a = int(input())\nif a >=4 and a%2 == 0:\n print(\"YES\")\nelse:\n print(\"NO\")", "i = input()\r\nif(int(i) == 2):\r\n print(\"NO\")\r\nelse:\r\n if((int(i) % 2) == 0):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "weigh = int(input())\r\nif weigh % 2 ==0 and weigh > 2:\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "n = int(input()) \nif n == 2:\n print(\"No\")\nelif n%2==0:\n\tprint(\"Yes\")\nelse:\n\tprint(\" No\")\n", "def can_divide_watermelon(w):\r\n \"\"\"\r\n Checks if the watermelon can be divided into two even parts.\r\n\r\n Args:\r\n w: The weight of the watermelon.\r\n\r\n Returns:\r\n True if the watermelon can be divided into two even parts, False otherwise.\r\n \"\"\"\r\n\r\n # Check if the weight of the watermelon is even and greater than 2\r\n if w % 2 == 0 and w > 2:\r\n return True\r\n else:\r\n return False\r\n\r\nif __name__ == \"__main__\":\r\n # Read the weight of the watermelon as input\r\n w = int(input())\r\n\r\n # Check if the watermelon can be divided and print the result\r\n if can_divide_watermelon(w):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "Watermelon_weight= float(input())\r\ni =2\r\nwhile i < Watermelon_weight and (Watermelon_weight - i)%2 !=0 :\r\n i+=2\r\nif i < Watermelon_weight:\r\n print (\"YES\")\r\nelse :\r\n print(\"NO\")", "w = int(input())\r\nprint(\"YES\" if w >= 4 and w % 2 == 0 else \"NO\")\r\n", "x = int(input())\r\n\r\nif (x/2).is_integer() and x != 2:\r\n print(\"yes\")\r\n\r\nelse:\r\n print(\"no\")", "w = int(input())\r\n\r\nif w % 2 != 0 or w < 4:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")", "v = int(input())\nif v>2 and v%2 ==0:\n print(\"Yes\")\nelse:\n print(\"No\")\n\t \t \t\t \t\t \t \t \t \t", "def function():\r\n n = int(input())\r\n return 'YES' if (n % 2 == 0 and n!= 2) else 'NO'\r\n\r\nprint(function())", "k=int(input())\r\nif k%2==0 and k!=2 and 1<=k<=100:\r\n print(\"Yes\")\r\nelse:\r\n print(\"NO\")\r\n", "w = int(input())\r\nprint(\"NO\") if w % 2 or w == 2 else print(\"YES\") ", "w = int(input())\r\ndef water():\r\n if w % 2 == 0 and w > 2:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n return 0\r\nwater()", "def if_watermelon_can_be_divided():\r\n\r\n watermelon_weight = int(input())\r\n\r\n if (watermelon_weight-1)%4 == 0 or (watermelon_weight-3)%4 == 0 or watermelon_weight == 2:\r\n return \" NO \"\r\n else:\r\n return \" YES \"\r\n\r\n\r\nif __name__ == \"__main__\":\r\n print(if_watermelon_can_be_divided()) ", "w =int(input())\r\ndef isNum(w):\r\n if w%2==0 and w>2:\r\n return 'YES'\r\n else:\r\n return 'NO'\r\nprint(isNum(w))\r\n", "i = int(input())\r\n\r\nif (i % 2 == 0 and i >= 4):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "w = int(input())\n\n\nif w == 2 or w % 2 != 0:\n\tprint(\"NO\")\nelse:\n\tprint(\"YES\")\n# ifwjwiosjdfoiasjdoifj\n#jediofdjasdiofjoi\n\n\t \t \t \t\t \t\t\t \t\t\t \t\t \t\t\t \t", "x=int(input())\r\nif x>3:\r\n for i in range(4,x+1,2):\r\n if (x-i)%2==0:\r\n print(\"YES\")\r\n break\r\n else:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"NO\")", "w=int(input())\r\ni=2\r\ntr=False\r\nwhile i<w and tr==False:\r\n\tif(w-i)%2==0:\r\n\t\ttr=True\r\n\telse:\r\n\t\ti+=2\r\n\t\t\r\nif tr==True:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "weight = int(input())\r\nif weight<=2:\r\n print(\"No\")\r\nelif weight%2==0:\r\n print(\"yes\")\r\nelse:\r\n print (\"No\")", "def main():\n w = int(input())\n if(w%2==0 and w>2):\n # even and grater than 0\n print(\"YES\")\n else:\n print(\"NO\")\n \n\nif __name__ == '__main__':\n main()\n", "watermelons = int(input())\nboo = watermelons % 2 == 0\n\nif watermelons!=2 and boo:\n print('YES')\nelse:\n print('NO')\n", "W = int(input())\r\n\r\nif W %2 == 0 and W > 2:\r\n\r\n print(\"YES\")\r\n\r\nelse:\r\n print(\"NO\")\r\n", "a = input()\r\nif int(a) % 2 == 0 and int(a)>3:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "w=int(input())\r\nif w<=100 and w>0:\r\n if w%2==0 and w!=2:\r\n print (\"YES\")\r\n elif w==2:\r\n print (\"NO\")\r\n else:\r\n print (\"NO\")", "n = int(input())\r\nfor i in range (1, n+1):\r\n if i%2==0:\r\n b = n-i\r\n if b%2==0 and b>=1:\r\n print(\"Yes\")\r\n exit()\r\nprint(\"No\")", "weight = int(input())\r\nif weight % 2 != 0:\r\n print(\"NO\")\r\nelif weight % 2 == 0:\r\n if (weight/2) % 2 == 0:\r\n print(\"YES\")\r\n elif (weight/2) % 2 != 0:\r\n if (((weight/2) // 2) + 1) % 2 == 0 and (weight - ((weight/2) // 2) + 1) % 2 == 0:\r\n print(\"YES\")\r\n elif ((weight/2) // 2) % 2 == 0 and (weight-((weight/2) // 2)) % 2 == 0 and ((weight/2) // 2) > 0: # 10 5//2 = 2\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "x=int(input())\r\nprint('Yes' if x%2==0 and x>2 else 'No')", "def divide(n):\r\n if n<=2:\r\n ans=False\r\n else:\r\n if n%2 ==0:\r\n ans=True\r\n else:\r\n ans= False\r\n return ans\r\nn=int(input())\r\nif divide(n)==True:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = int(input())\r\nc = 0\r\nfor i in range(a):\r\n for j in range(a):\r\n if i+j == a and i%2==0 and j%2==0:\r\n c += 1\r\n break\r\n\r\n\r\nif c == 0:\r\n print('NO')\r\n\r\nelse:\r\n print('YES')", "numb = int(input(\" \"))\r\nif numb % 2 == 0 and numb > 2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# Read the weight of the watermelon\nw = int(input())\n\n# Check if it's possible to divide the watermelon as required\nif w % 2 == 0 and w > 2:\n print(\"YES\") # It's possible\nelse:\n print(\"NO\") # It's not possible\n\n \t \t \t\t \t\t \t\t\t \t \t\t\t\t", "def run():\n\tw = int(input(\"\"))\n\tprint(\"YES\" if ( w % 2 == 0 and w != 2) else \"NO\")\n\nif __name__ == \"__main__\":\n\trun()\n", "def watermelon():\r\n n = int(input())\r\n for a in range(2,n//2 + 1,2):\r\n b = n - a\r\n if b % 2 == 0:\r\n print('YES')\r\n return\r\n print('NO')\r\nwatermelon()", "def watermelon():\r\n data = int(input())\r\n if data == 2:\r\n return \"NO\"\r\n if data % 2 == 0:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\nprint(watermelon())", "print(\"NO\" if ((n := int(input())) % 2 or n == 2) else \"YES\")", "def divide_watermelon(num):\r\n if num % 2 == 0 and num > 2:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n\r\nnum = int(input())\r\n\r\n\r\nprint(divide_watermelon(num))", "x=int(input())\r\n\r\nprint(\"YES\" if x%2==0 and x>2 else \"NO\")\r\n", "y = int(input())\r\nif(y==2):\r\n print('NO')\r\nelif y%2==0:\r\n print('YES')\r\nelse:\r\n print('NO')", "num1 = int(input())\r\nif num1 > 2 and num1%2 == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "ig=int(input())\nif ig>3 and ig%2==0:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t \t \t \t \t \t \t\t\t \t\t\t", "def f(n):\r\n for i in range(2, n, 2):\r\n if (n-i) % 2 == 0:\r\n\r\n return 'YES'\r\n return 'NO'\r\n\r\n\r\nprint(f(int(input())))\r\n", "n = int(input())\nprint(\"Yes\" if n%2==0 and n > 2 else \"No\")\n \t\t \t\t\t\t\t \t\t\t\t\t \t \t\t \t\t \t", "n = int(input())\nif n>=4 and n%2 == 0:\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", "a = int(input())\r\nprint(\"YES\" if a%2 ==0 and a>2 else \"NO\")", "w = int(input())\r\nif (w > 2) and (w % 2 ==0):\r\n print (\"Yes\")\r\nelse:\r\n print (\"NO\")", "def isPossible(weight):\r\n if weight <= 2 or weight % 2 == 1:\r\n return \"No\"\r\n else:\r\n return (\"Yes\")\r\n\r\nweight= int(input())\r\nprint(isPossible(weight))", "'''\r\nOne hot summer day Pete and his friend Billy decided to buy a watermelon. They\r\n chose the biggest and the ripest one, in their opinion. After that the\r\n watermelon was weighed, and the scales showed w kilos. They rushed home, dying\r\nof thirst, and decided to divide the berry, however they faced a hard problem.\r\nPete and Billy are great fans of even numbers, that's why they want to divide the watermelon in such a way\r\nthat each of the two parts weighs even number of kilos, at the same time it is not obligatory that\r\nthe parts are equal. The boys are extremely tired and want to start their meal as soon as possible, that's why\r\n you should help them and find out, if they can divide the watermelon in the way they want. For sure, each of\r\nthem should get a part of positive weight.\r\n\r\nInput\r\n\r\nThe first (and the only) input line contains integer number w\r\nw (1<=w<=100) — the weight of the watermelon bought by the boys.\r\n\r\nOutput\r\n\r\nPrint YES, if the boys can divide the watermelon into two parts, each of them we\r\nighing even number of kilos; and NO in the opposite case.\r\n'''\r\n\r\n\r\n\r\ndef water_melon_even_division():\r\n t = int(input())\r\n if t == 2:\r\n return 'NO'\r\n if t % 2 != 0:\r\n return 'NO'\r\n return 'Yes'\r\n\r\nprint(water_melon_even_division())", "def decideWatermelon(w):\n if w <= 0 :\n return False\n elif w == 2:\n return False\n elif w%2 == 0 :\n return True\n else:\n return False\n \nw = int(input())\n \nif decideWatermelon(w):\n print(\"YES\")\nelse:\n print(\"NO\")\n\t \t\t \t \t\t\t\t \t \t \t\t \t\t \t\t", "w = int(input())\r\n\r\nflag = True\r\n\r\nperson_1 = w\r\n\r\nperson_2 = 0\r\n\r\nfor i in range(w):\r\n \r\n person_1 -= 1\r\n person_2 += 1\r\n \r\n if (person_1 % 2==0) and (person_2 %2 ==0) and (person_1!=0 and person_2!=0):\r\n print('YES')\r\n flag = False\r\n break\r\n \r\nif flag:\r\n print('NO')", "def iseven(n):\r\n return\"YES\" if n%2==0 and n>2 else \"NO\"\r\nn = int(input())\r\nprint(iseven(n))", "def H(weight):\n if weight % 2 == 0 and weight > 2:\n return \"YES\"\n else:\n return \"NO\"\nweight = int(input())\nresult = H(weight)\nprint(result)\n\n\t \t \t \t \t \t \t\t \t\t \t \t\t", "weight=int(input(\"\"))\r\nif(weight >=1 and weight<=100):\r\n if(weight == 2):\r\n print(\"NO\")\r\n elif (weight%2!=0):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n", "w = int(input())\r\nprint('NO' if w % 2 or w < 4 else 'YES')", "# Read the input\r\nw = int(input())\r\n\r\n# Check if it's possible to divide the watermelon as required\r\n# Both parts should be even, and their sum should be equal to w\r\nif w >= 4 and w % 2 == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "w=int(input())\r\nif((w%2)==0 and w>2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\r\n\r\nves_arbuz = int(sys.stdin.readline().split()[0])\r\n\r\nif ves_arbuz % 2 != 0 or ves_arbuz < 4:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n = int(input())\r\nif (n%2!=0 or n<2):\r\n print(\"NO\")\r\nelif(n==2):\r\n print(\"NO\")\r\nelse:\r\n print('YES')", "from sys import stdin\ndef main():\n p = int(input(\" \"))\n if ( p % 2 == 0 and p != 2):\n print(\"yes\")\n else:\n print(\"no\")\n \nmain()\n\t \t \t \t \t\t \t\t\t \t \t\t\t\t \t", "a= int(input())\r\nif(a%2==0 and a!=2):\r\n {\r\n print(\"Yes\")\r\n }\r\nelse:\r\n {\r\n print(\"No\")\r\n }", "if __name__ == '__main__':\r\n num = int(input())\r\n if num > 2 and num % 2 == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "a = int(input())\r\ndiv = a % 2\r\nif a%2 == 0:\r\n if a/2 == 1:\r\n print(\"NO\")\r\n elif (a/2)%2 == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# Read the weight of the watermelon\ns = int(input())\n\n# Check if it's possible to divide the watermelon as described\nif s % 2 == 0 and s > 2:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t \t\t \t\t\t\t \t \t \t\t\t\t \t\t \t", "w = int(input())\r\nif (w>2 and w%2==0): print(\"YES\")\r\nelse: print(\"NO\")", "w = int(input())\r\nif (w & 1 != 0) or (w in [0, 2]):\r\n print('NO')\r\nelse:\r\n print('YES')", "n = int(input())\r\nres = n % 2 == 0\r\nif res and n != 2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "w = int(input())\r\nif 1 <= w and w <= 100:\r\n good = False\r\n for i in range(w):\r\n i += 1\r\n if w - i > 0 and i%2==0 and (w-i)%2==0:\r\n good = True\r\n if good:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "watermelon_w = int(input())\r\nprint(\"YES\" if watermelon_w % 2 == 0 and watermelon_w > 2 else \"NO\")\r\n", "\r\nA = int(input())\r\n\r\nif A % 2 != 0 or A == 2:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")", "n=int(input())\r\nb=n-2\r\nif n==2:\r\n print(\"NO\")\r\n \r\nelif (b%2==0 and n%2==0) or ((n/2)%2==0):\r\n print(\"YES\")\r\n \r\nelse:\r\n print(\"NO\")\r\n", "a=int(input())\r\nif a%2==0 and a!=2 :\r\n print(f\"Yes\")\r\nelse:\r\n print(f\"No\")", "def canDivideWatermelon(weight: int) -> int:\r\n return \"YES\" if weight > 2 and weight % 2 == 0 else \"NO\"\r\n\r\nprint(canDivideWatermelon(int(input())))", "def divide_watermelon(weight):\r\n if weight > 2 and weight % 2 == 0:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n\r\n# Read the weight of the watermelon\r\nweight = int(input())\r\n\r\n# Check if it can be divided as required\r\nresult = divide_watermelon(weight)\r\n\r\n# Print the result\r\nprint(result)\r\n", "def sePar(n):\n return n%2==0\n\nw = int(input())\n\nif w > 3 and sePar(w):\n print(f'YES')\nelse:\n print(f'NO')", "a=int(input())\nif a>3 and a%2==0:\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", "w = int(input())\r\n\r\n# Check if w is an even number greater than 2\r\nif w > 2 and w % 2 == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "weight = int(input())\nrem = weight % 2\nif rem != 0 or weight == 2:\n print(\"NO\")\nelse:\n print(\"YES\")\n\n", "n = int(input())\r\nprint(\"YES\" if (n % 2 == 0 and n != 2) else \"NO\")", "x=input()\nx = int(x)\nif x%2 == 0 and x!=2:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\n\t \t\t \t \t\t \t \t\t \t \t\t\t \t\t", "def can_divide_watermelon(w):\n if w % 2 == 0 and w > 2:\n return \"YES\"\n else:\n return \"NO\"\n\n# Read input from the user (assuming it's provided as a single integer)\nw = int(input().strip())\n\n# Check and print the result\nprint(can_divide_watermelon(w))", "n=int(input())\r\nif n>2 and (n)%2==0:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")", "def can_split_watermelon(weight):\r\n # The watermelon can be split into two even parts\r\n # if and only if its weight is even and greater than 2.\r\n return weight % 2 == 0 and weight > 2\r\n\r\ndef main():\r\n w = int(input())\r\n \r\n if can_split_watermelon(w):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "W = int(input())\r\nif W > 2 and W % 2 == 0 :\r\n print ('YES')\r\nelse :\r\n print ('NO')\r\n", "y= int(input())\r\nif y%2==0 and y>2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "x = int(input())\r\nprint('YES' if x > 2 and x % 2 == 0 else 'NO')", "weight=int(input())\nif(weight%2==0 and 2<weight<=100):\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", "weight = int(input())\nif (weight%2==0 and weight>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 \t", "n=int(input())\r\nf=0\r\nfor i in range (n):\r\n for k in range (n):\r\n if(i%2==0 and k%2==0 and i+k==n):\r\n f=1\r\nif(f==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "x=int(input())\r\n\r\nif x>=1 and x<=1000:\r\n if x%2==0 and x/2>1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "weight = int(input())\r\nprint(\"YES\" if weight % 2 == 0 and weight != 2 else \"NO\")", "w = int(input())\r\nprint('YES') if w % 2 == 0 and w != 2 else print(\"NO\")", "w = int(input())\r\n\r\n# The boys can divide the watermelon if it weighs an even number and is greater than 2\r\nif w % 2 == 0 and w > 2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "w = int(input())\r\nif w > 3 and not w & 1:\r\n print('YES')\r\nelse:\r\n print('NO')", "# Declare the variables\nnumber_kilos = int(input())\n\nif number_kilos % 2 == 0 and number_kilos != 2: \n print('YES')\nelse:\n print('NO')", "n=int(input())\r\nprint(\"YES\") if n%2==0 and n>2 else print(\"NO\") ", "\r\nuser=int(input())\r\nif user <= 2 or user%2!=0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "def can_divide_watermelon(s):\r\n if s % 2 == 0 and s > 2:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\ns = int(input())\r\nresult = can_divide_watermelon(s)\r\nprint(result)\r\n", "# LUOGU_RID: 123797336\na = input()\r\nb = int(a)\r\nif b % 2 == 0 and b != 2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "num_inp = int(input()) \r\nif num_inp%2==0 and num_inp>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\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "weight = int(input()) # the weight of the watermelon\r\n\r\nif weight ==2: # because it has a glitch with number 2\r\n print(\"NO\")\r\nelse:\r\n x = weight%2 # to know if its even\r\n\r\n if x == 0: # if the \"x\" == 0 that means the number is even\r\n print(\"YES\")\r\n else:\r\n print(\"NO\") # else: the number is not even", "x = int(input())\n\nfor i in range(2, x, 2):\n if (x - i) % 2 == 0:\n print(\"YES\")\n exit()\n\nprint(\"NO\")\n", "w = int(input())\r\nprint('YES' if w%2==0 and w != 2 else 'NO')", "x = input()\r\nif int(x) >= 1 and int(x) <= 100:\r\n if int(x) % 2 == 0 and int(x) != 2:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\r\n", "arb=int(input())\r\nif arb != 2 and arb %2 == 0 :\r\n print(\"Yes\")\r\nelse:\r\n print(\"NO\")", "watermelon = int(input())\r\nif watermelon%2 == 0 and watermelon > 2:\r\n print('Yes')\r\nelse:\r\n print('No')", "i=int(input(\"\"))\r\nif i%2==0 and i>2:print(\"YES\")\r\nelse:print(\"NO\")", "weight = input()\r\nweight = int(weight) \r\n\r\nif weight%2==1:\r\n\tprint(\"NO\")\r\nelif weight==2:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\r\n #单等号用于赋值，双等号用于判定\r\n #注意数学上的特殊情况，用设问的充分条件", "w = int(input())\r\nprint(\"YES\" if (w % 2 == 0 and w > 2) else \"NO\")", "# Lê o peso da melancia\nw = int(input())\n\n# Verifica se é possível dividir a melancia em duas partes, ambas com peso par\nif w % 2 == 0 and w > 2:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\t \t\t \t\t\t \t\t \t \t \t\t \t\t", "x=int(input())\r\nif x<=2:\r\n\tprint(\"NO\")\r\nelif x%2==0:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "\r\nn = int(input()); print(\"NO\") if n & 1 or n <= 2 else print(\"YES\")", "w = int(input())\r\n\r\nfor i in range(2, w // 2 + 1, 2):\r\n if (w - i ) % 2 == 0:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO') \r\n\r\n", "\r\nsum = int(input())\r\nsum-=2;\r\nif (sum %2 == 0 and sum>0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "watermelon = float(input())\r\n\r\nif watermelon <= 2 or watermelon % 2 != 0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "\r\n\r\nx = int(input())\r\nif x % 2 == 0 and x > 2:\r\n print (\"YEs\")\r\nelse:\r\n print(\"NO\")\r\n", "w = int(input()) # Read the weight of the watermelon\r\n \r\n# Check if the weight is even and greater than 2\r\nif w % 2 == 0 and w > 2:\r\n print(\"YES\") # Watermelon can be divided into two even parts\r\nelse:\r\n print(\"NO\")", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom bisect import *\r\n\r\nN = int(input())\r\nif N<4:\r\n exit(print('NO'))\r\n\r\nif (N-2)%2==0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "import sys\r\n \r\nfor line in sys.stdin:\r\n val = int(line)\r\n if val%2 == 1 or val == 2:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "#!/usr/bin/python3\n# -*- coding: utf-8 -*-\n\n# Task A: \"Watermelon\".\nimport sys\ninput = sys.stdin.buffer.readline\nprintt = sys.stdout.write\n\nw = int(input())\nif w != 2 and w % 2 == 0: printt('YES' + '\\n')\nelse: printt('NO' + '\\n')\n", "x = int(input())\r\nif x % 2 == 0 and x > 2:\r\n print (\"Yes\")\r\nelse:\r\n print(\"No\")", "w=int(input())\r\nif w==2 or w==1:\r\n print(\"no\")\r\nelif (w-2)%2==0:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")", "weight = int(input())\r\nprint(\"YES\" if weight % 2 == 0 and weight > 3 else \"NO\")", "w = int(input())\r\nif (w % 2 == 0) and (w > 3):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "t=int(input())\r\nif(t%2==0 and t>2):\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")", "w = int(input())\nif w >= 1 and w <= 100:\n if w > 2 and w % 2 == 0:\n print(\"YES\")\n else:\n print(\"NO\")\nelse:\n print(\"Valor no valido\")\n\n\t\t\t\t\t \t \t\t \t \t \t \t", "a = int(input())\r\nif a % 2 != 0 or a == 2:\r\n print('no')\r\nelse:\r\n print('yes')", "def can_divide_watermelon(w):\r\n # Check if the weight is odd or less than 4 (as both parts should be even)\r\n if w % 2 != 0 or w == 2:\r\n return \"NO\"\r\n \r\n return \"YES\"\r\n\r\n# Read the input\r\nw = int(input())\r\n\r\n# Check if the watermelon can be divided\r\nresult = can_divide_watermelon(w)\r\n\r\n# Print the result\r\nprint(result)", "num = int(input())\n\nretorno = \"NO\"\nfor i in range(num-1):\n num1 = i+1\n num2 = num-num1\n \n if num1%2 == 0 and num2%2 == 0:\n retorno = \"YES\"\n break\n\nprint(retorno)\n\t\t\t\t \t\t \t \t\t \t\t\t \t\t\t\t \t", "w=int(input())\r\nif w%4==0 or (w%4==2 and w>4):\r\n print('YES')\r\nelse:\r\n print('NO')", "ok=False\r\nwhile ok==False:\r\n w=int(input())\r\n ok= 1<=w<=100\r\nif w%2==0 and w!=2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "w = int(input())\r\nif w == 2 or w%2:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")", "n=int(input())\r\nprint(\"YES\" if (n>2 and n%2 == 0) else \"NO\")", "class in_put:\r\n def __init__(self, w):\r\n self.w = w\r\n\r\nclass solve:\r\n def __init__(self, weight):\r\n self.weight = weight\r\n\r\n def answer(self):\r\n if not self.weight % 2 and self.weight > 2:\r\n return True\r\n else:\r\n return False\r\n\r\na = in_put(int(input()))\r\nb = solve(a.w)\r\nif b.answer():\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "watermellon = int(input())\r\nx=watermellon/2\r\nif watermellon>=4:\r\n if watermellon%2==0:\r\n print(\"yes\")\r\n elif x%2== 0 :\r\n print (\"Yes\")\r\n else:\r\n print(\"No\")\r\nelse:\r\n print(\"No\")\r\n ", "w = int(input())\r\nout = \"NO\"\r\nif not w % 2 and w > 2: out = \"YES\"\r\nprint(out)", "w = int(input())\r\nif w % 2==0 and w!=2:\r\n print (\"YES\")\r\nelse:\r\n print (\"NO\")", "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\r\n# for _ in range(II()):\r\nw = inp()\r\nif w == 2: print(\"NO\")\r\nelse:\r\n print('NO' if w & 1 else 'YES')", "# LUOGU_RID: 123941674\na=int(input(\"\")) #fkjesjfw\r\nif a==2: #kefnlk\r\n print(\"NO\") #jsnjsd\r\nelif a%2==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n", "w=int(input())\r\nprint('YES' if w%2==0 and w!=2 else 'NO')", "w = input()\nw = int(w)\n\nif w%2 ==0 and w>2:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t \t\t \t\t \t \t \t\t \t\t\t\t \t\t", "w = int(input())\n\nif (w != 2) & (w%2 ==0):\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "# LUOGU_RID: 125317467\nx=eval(input())\r\nif x<=2:\r\n print(\"No\")\r\n\r\nelif x%2==0:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n\r\n", "#watermelon problem in codeforce\r\nn = int(input())\r\nif (n%2 == 0 and n>2):\r\n print(\"yes\")\r\nelse:\r\n print(\"No\")", "peso=int(input())\r\nif peso-2 >0 and (peso -2)%2 == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\r\n\r\ninput = sys.stdin.readline\r\ng1 = lambda: list(map(int, input().split())) # get num arr\r\ng2 = lambda: list(input().split()) # get str arr\r\n\r\nn = int(input())\r\nfound = False\r\n\r\nfor i in range(2, n//2+1, 2):\r\n if (n - i) & 1 == 0:\r\n found = True\r\n\r\nif found:\r\n print(\"YES\\n\")\r\nelse:\r\n print(\"NO\\n\")\r\n", "# Read the weight of the watermelon\r\nw = int(input())\r\n\r\n# Check if it's possible to divide the watermelon as described\r\n# Both parts should have even weights, so w should be even and w-2 should also be even.\r\nif w % 2 == 0 and (w - 2) % 2 == 0 and (w - 2) > 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "# Input the weight of the watermelon\nw = int(input())\n\n# Check if it's possible to divide the watermelon into two even parts\n# Each part should weigh even and positive\nif w % 2 == 0 and w > 2:\n print(\"YES\")# taking input\nelse:\n print(\"NO\")\n\t \t \t \t \t\t \t\t \t\t\t \t \t \t\t\t\t", "def q(a):\r\n if a <= 2:\r\n return False\r\n if a%2 == 0:\r\n return True\r\n else:\r\n return False\r\n\r\na=int(input())\r\nif q(a) == True:\r\n print('Yes')\r\nelse:\r\n print('No')", "watermelon = int(input())\nif watermelon%2 == 0 and watermelon !=2:\n print(\"YES\")\nelse:\n print(\"NO\")\nquit()\n \t\t\t\t\t \t\t \t \t\t\t \t\t\t \t \t\t\t\t\t \t", "def can_divide_evenly(w):\r\n if w < 3 or w % 2 != 0:\r\n return 'NO'\r\n else:\r\n return 'YES'\r\n\r\nw = int(input().strip())\r\nprint(can_divide_evenly(w))", "def can_divide_watermelon(weight):\n if weight % 2 == 0 and weight > 2:\n return \"YES\"\n return \"NO\"\n\nw = int(input().strip())\n\nresult = can_divide_watermelon(w)\nprint(result)\n\n \t \t\t\t \t\t \t \t\t \t \t\t\t\t\t \t", "weight = int(input())\r\n\r\nif weight%2 ==0 and weight > 2:\r\n print(\"yes\")\r\n \r\nelse:\r\n print(\"no\")", "num = int(input())\r\nif num%2==0 and num!=2:\r\n print('yes')\r\nelse:\r\n print(\"no\")", "st=int(input())\nif(st%2==0 and st!=2):\n print(\"YES\")\nelse:\n print(\"NO\")", "w = int(input())\r\nif w %2 != 0 or w <= 2 or w >100:\r\n print(\"NO\")\r\nelse: \r\n print(\"YES\")\r\n", "num = int(input())\r\nif num % 2 == 0 and num != 2: print('YES')\r\nelse: print('NO')\r\n", "\r\n\r\nnum_in = int(input())\r\nif num_in > 2 and num_in%2==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "a=input()\na=int(a)\nif a!=2 and a%2==0:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t \t \t \t\t \t \t \t \t \t\t \t\t \t\t", "sayi=int(input());\nif sayi!=2 and sayi%2==0:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\t\t \t \t \t\t\t \t\t \t\t\t \t", "x = int(input())\r\n\r\nif x >= 1 and x <= 100:\r\n if x >= 4:\r\n if (x - 2) % 2 == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\n\r\n", "w=int(input())\r\nif w>2 and (w-2)%2==0:\r\n print('Yes')\r\nelse:\r\n print(\"No\")", "from sys import stdin, exit\r\n\r\ndef task():\r\n w = int(stdin.readline())\r\n if w % 2 == 0 and w > 2:\r\n print (\"YES\")\r\n else:\r\n print ('NO')\r\ntask()", "z=int(input())\r\nif z==2:\r\n print(\"NO\")\r\nelif z%2==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nprint (\"NO\" if n==2 else (\"YES\" if n%2==0 else \"NO\"))", "n=int(input());print('YNEOS'[n%2==1 or n<3::2])", "w = int(input(\"\"))\nx = w % 2\n\nif x == 0 and w != 2:\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", "\r\n\r\n\r\npeso = int(input())\r\n\r\n\r\ndef dividir_sandia(peso_sandia: int):\r\n\r\n for x in range(2, peso_sandia, 2):\r\n resultado = peso_sandia - x\r\n if (resultado % 2) == 0:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\nprint(dividir_sandia(peso))", "# import inbuilt standard input output\nfrom sys import stdin, stdout\n\n\n# suppose a function called main() and\n# all the operations are performed\ndef main():\n # input via readline method\n watermelon_weight = int(stdin.readline())\n\n # initialize variable\n answer = \"\"\n\n # check if the watermelon weight can be divided into two even parts\n if watermelon_weight == 2:\n answer = str(\"NO\")\n stdout.write(answer)\n elif watermelon_weight % 2 == 0:\n answer = str(\"YES\")\n stdout.write(answer)\n else:\n answer = str(\"NO\")\n stdout.write(answer)\n\n\n# call the main method\nif __name__ == \"__main__\":\n main()", "n=int(input())\nif n%2==0 and n>2:\n print(\"yes\")\nelse:\n print(\"no\")\n\t\t\t\t \t\t \t\t\t\t \t \t\t\t\t\t", "import sys\r\n\r\nn = int(sys.stdin.readline())\r\nprint(\"YES\" if n % 2 == 0 and n > 2 else \"NO\")", "no = int(input())\r\nif no % 2 == 0 and no != 2:\r\n print('YES') \r\nelse:\r\n print('NO')", "y = int(input())\nif y % 2 == 0 and y > 2:\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\t \t", "p=[4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 76, 78, 80, 82, 84, 86, 88, 90, 92, 94, 96, 98, 100]\r\nj=(int(input()))\r\nif j in p:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "x = int(input(\"\"))\r\nif x % 2 == 0 and not x == 2:\r\n print(\"Yes\")\r\nelif x % 2 != 0 or x == 2:\r\n print(\"NO\")\r\n\r\n\r\n\r\n", "peso = int(input())\nif peso % 2 == 0 and peso > 2:\n print('YES')\nelse:\n print('NO')\n \t\t \t \t \t \t\t \t\t \t \t \t\t \t\t\t", "n = input()\r\nn = int(n)\r\nif n % 2 == 0 and n > 2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n", "# Read the weight of the watermelon\r\nw = int(input())\r\n\r\n# Check if it's possible to divide the watermelon into two even parts\r\n# Each part should have a positive weight, so the minimum even weight is 2\r\n# If w is odd or less than 4, it's not possible\r\nif w >= 4 and w % 2 == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "x=int(input())\r\nc=0\r\nfor i in range(1,x):\r\n for j in range(1,x):\r\n if ((i%2==0) &(j%2==0) &(i+j==x)):\r\n c+=1\r\nif c>=1:\r\n print(\"YEs\")\r\nelse:\r\n print(\"NO\")", "x = int(input())\nz = \"YES\" if (x % 2 == 0 and x > 3) else \"NO\"\nprint(z)", "a = int(input())\r\nb = (a % 2 == 0) and (a != 2)\r\nprint(\"YES\" if b else \"NO\") ", "def main():\r\n cas = int(input())\r\n if cas%2 == 0 and cas > 2:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n \r\nmain()", "print(next(\"YES\" if x % 2 == 0 and x > 2 else 'NO' for x in [int(input())]))", "Num = int(input())\nif Num%2==0 and Num>2:\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", "w=int(input())\r\nif(w==1 or w==2):\r\n print(\"NO\")\r\nelse:\r\n for i in range(2,w,2):\r\n if((w-i)%2==0):\r\n a=\"YES\"\r\n else:\r\n a=\"NO\"\r\n print(a)\r\n \r\n", "# LUOGU_RID: 125399229\na=int(input())\nif a==2:\n print('NO')\nelif a%2==0:\n print('YES')\nif a%2!=0:\n print('NO')", "user_input = int(input())\r\nif user_input%2==0 and user_input!=2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "# Read the weight of the watermelon\nq = int(input())\n\n# Check if it is possible to divide the watermelon\nif q % 2 == 0 and q > 2:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t\t \t\t\t \t\t\t \t \t", "sd=int(input())\r\nif sd%2==1 or sd<=2:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n=int(input())\np=0\nfor i in range(1,n):\n a=i\n b=n-i\n if a%2==0 and b%2==0:\n print(\"YES\")\n p=1\n break\nif p==0:\n print(\"NO\")", "'''def thanhtung(x,y,n,m):\r\n so_hit=0\r\n sat_thuong=x\r\n mau=m\r\n while n>0:\r\n so_hit=so_hit+1\r\n mau=mau-sat_thuong\r\n if mau <= 0:\r\n sat_thuong = sat_thuong+y\r\n mau =m\r\n n =n-1\r\n return so_hit\r\nx,y,n,m = map(int,input().split())\r\nket_qua=thanhtung(x,y,n,m)\r\nprint(ket_qua)'''\r\nw=int(input())\r\nif w==2:\r\n print(\"NO\")\r\nelif w%2==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n\r\n\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 \r\nw = inp()\r\nif w <= 3:\r\n print(\"NO\")\r\nelif w % 2 == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def can_divide_watermelon(weight):\n return weight % 2 == 0 and weight > 2\n\nw = int(input())\n\nresult = can_divide_watermelon(w)\n\nif result:\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", "number_str = input()\r\nnumber = int(number_str)\r\nif number % 2 == 0 and number != 2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "fruit_input=int(input())\r\nif fruit_input != 2 and fruit_input % 2 ==0 and 1<= fruit_input <=100:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "input1=input()\r\nw=int(input1)\r\n\r\nif (w/2>int(w/2)) or (w==2):\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "n=int(input())\r\nprint(\"YES\" if (not n%2 and n>2) else \"NO\")", "w = int(input())\r\nflag = False\r\nfor i in range(2, w//2+1, 2):\r\n if (i % 2 == 0) and ((w-i) % 2 == 0):\r\n flag = True\r\n break\r\nif flag:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\r\nif 2 < n <= 100 and n % 2 == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "W = int(input()) \n\nif W > 2 and W % 2 == 0:\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", "n = int(input())\r\nprint(\"YES\" if n > 2 and n%2==0 else \"NO\")", "x = int(input())\r\n\r\ndef watermelon(x):\r\n for i in range(2,x if (x%2 != 0) else x-1,2):\r\n if (x-i)%2 == 0:\r\n print(\"YES\")\r\n return\r\n print(\"NO\")\r\n\r\nwatermelon(x)\r\n\r\n\r\n \r\n", "from sys import stdin, stdout\r\n \r\na = int(stdin.readline())\r\nstdout.write(\"YES\" if a % 2 == 0 and a != 2 else \"NO\")\r\nstdout.flush()", "n=int(input())\nif n>2 and n%2==0:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n#kfjdjkh\n\t\t\t \t \t \t \t\t\t \t \t\t \t\t \t \t", "def a(w):\r\n if w > 2 and w%2 == 0:\r\n return 'YES'\r\n else:\r\n return 'NO'\r\nprint(a(int(input())))", "t = int(input())\r\nif t>2 and t%2 ==0:\r\n print('YES')\r\nelse:print('NO')", "num = int(input())\r\n\r\nif num <= 3:\r\n print('NO')\r\nelif num % 2 == 1:\r\n print('NO')\r\nelse:\r\n print('YES')", "def slice(slices):\r\n if slices == 2:\r\n print(\"NO\")\r\n return\r\n if slices % 2 == 0:\r\n print(\"YES\")\r\n return\r\n print(\"NO\")\r\n \r\nwatermelon_slices = int(input())\r\nslice(watermelon_slices)", "abc = int(input())\n\nif abc% 2 == 0 and abc> 3:\n print('YES')\n \nelse:\n print('NO')\n\t \t \t \t \t \t\t\t \t \t \t", "T=int(input())\nif T%2==0 and T>2:\n print(\"Yes\")\nelse:\n print(\"No\")\n\t \t \t \t \t\t \t\t \t \t\t\t", "def can_divide_watermelon(w):\n if w % 2 == 0 and w > 2:\n return \"YES\"\n else:\n return \"NO\"\n\n# Input the weight of the watermelon\nw = int(input())\n\n# Check if the watermelon can be divided and print the result\nresult = can_divide_watermelon(w)\nprint(result)\n\t \t \t\t\t \t\t \t \t\t \t\t \t \t", "n=int(input())\r\nflag=False\r\nfor i in range(1,n):\r\n if(i%2==0 and (n-i)%2==0):\r\n flag=True\r\n break\r\nprint(\"No\" if not(flag) else \"Yes\")", "wtml=int(input())\r\n \r\nif wtml%2==0 and wtml>2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "w1=int(input())\nif(w1%2==0 and w1>2):\n print(\"YES\")\nelse:\n print(\"NO\")\n\t\t \t \t \t \t\t \t \t\t\t \t\t \t\t\t", "x=int(input())\r\n\r\nif (x%2==0 and x>2):\r\n print(\"Yes\")\r\n\r\nelse:\r\n print(\"No\")", "s= int(input())\r\nif s != 2:\r\n if s%2 == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "# Read the input\r\nw = int(input())\r\n\r\n# Check if both parts can have even weights\r\n# The condition checks if w is greater than 2 and if (w - 2) is even\r\nif w > 2 and (w - 2) % 2 == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "i=int(input(\"\"))\r\nif i%2==0:\r\n if i>2:\r\n print(\"YES\")\r\n elif i==2:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "def divide_even(w):\r\n if w <= 2:\r\n return False\r\n else:\r\n return w % 2 == 0\r\n\r\nw = int(input())\r\nif divide_even(w):\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\r\nif (n==2):\r\n print(\"NO\")\r\nelif (n%2 == 0):\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "w = int(input())\r\ndef watermelon(w):\r\n if (w%2==0 and w>2):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\nwatermelon(w)\r\n", "m = int(input())\r\n\r\nif m % 2 != 0 or m-2 < 2:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "x=int(input())\r\nprint(\"Yes\" if x%2==0 and x!=2 else \"No\")", "x=int(input())\r\nif x>=4 and x%2==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "w = int(input())\nfound = False\nfor x in range (1,w):\n if x%2==0 and (w-x)%2==0:\n found = True\n print(\"YES\")\n break\nif found == False:\n print(\"NO\")", "w = int(input(''))\nx = w - 2\nif x%2 == 0 and x > 0:\n print(\"YES\")\nelse: \n print(\"NO\")\n \t\t \t\t \t \t \t \t \t \t\t \t\t\t \t", "# Read the weight of the watermelon\nw = int(input())\n\n# Check if it's possible to divide the watermelon as described\n# Both parts should have even weights, so w should be even and w-2 should also be even.\nif w % 2 == 0 and (w - 2) % 2 == 0 and (w - 2) > 0:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\t\t\t \t \t \t\t \t\t\t \t \t\t \t \t", "l=int(input())\r\nprint(\"Yes\" if l%2==0 and l!=2 else \"No\")", "w = int(input())\na = False\nfor i in range(1, w//2 + 1):\n if i%2 == 0 and (w-i)%2 == 0:\n a = True\nprint(\"YES\" if(a) else \"NO\")", "def cdw(w):\r\n if w%2==0 and w>2:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\nw = int(input())\r\nresult = cdw(w)\r\nprint(result)\r\n", "x = int(input())\r\nif (x%2 == 0) and x!=2:\r\n print(\"YES\")\r\nelse:\r\n print (\"NO\")\r\n", "import sys\r\n\r\nweight = int(sys.stdin.readline().split()[0])\r\n\r\nif (weight % 2 != 0) or (weight < 3):\r\n print('NO')\r\n\r\nelse:\r\n print('YES')\r\n", "w=int(input()) #abc.txt\nif(w%2==0 and w>=4):\n print('YES')\nelse:\n print('NO')\n \t \t \t\t\t\t\t \t\t \t \t\t\t\t", "\nw = int(input())\nif w == 2:\n print(\"NO\")\nelif w&1 == 1:\n print(\"NO\")\nelse:\n print(\"YES\")\n \t\t \t\t \t \t \t \t\t\t \t\t\t", "\nn=int(input())\nprint(\"NO\" if (n&1)or n==2 else \"YES\")\n \t \t \t\t\t \t\t \t\t\t \t\t", "# LUOGU_RID: 123843579\na=int(input())\r\nif a==2:\r\n print(\"NO\")\r\nelse:\r\n if a % 2 == 0:\r\n\t print(\"YES\")\r\n else:\r\n\t print(\"NO\")", "N = int(input())\r\nif(N%2 == 0 and N > 2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "H=int(input())\r\nif H%2==0 and H>2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# 11. [4A - Watermelon](00004A/main.py) ([problem site](https://codeforces.com/problemset/problem/4/A))\r\nw = int(input())\r\nisEven = 0\r\nfor i in range(1, w):\r\n if i % 2 == 0 and (w - i) % 2 == 0:\r\n isEven += 1\r\n break # Exit the loop when the condition is true\r\nprint(\"YES\" if isEven > 0 else \"NO\")\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nSpyder Editor\r\n\r\nThis is a temporary script file.\r\n\"\"\"\r\n\r\na=int(input())\r\nb=2\r\nc=0\r\n\r\nwhile b<a:\r\n if b%2==0 and (a-b)%2==0 and a!=0 and b !=0:\r\n c+=1\r\n b+=1\r\nif c:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n \r\n", "Weight = int(input())\r\n\r\n \r\nif Weight % 2 == 0 and Weight > 2:\r\n print('YES')\r\n \r\nelse:\r\n print('NO')", "a = int(input())\r\nif (a > 2) and (a%2 != 1):\r\n print (\"YES\")\r\nelse:\r\n print (\"NO\")", "num = int(input())\n\np1 = num / 2\np2 = num / 2\n\ns = ''\n\nif p1 == int(p1) and p2 == int(p2) and num > 2:\n for i in range(num):\n if p1 % 2 != 0 and p2 % 2 == 0:\n p1 = p1 + 1\n p2 = p2 - 1\n else:\n s = 'YES'\n\nif s != 'YES':\n s = 'NO'\n \nprint(s) \n", "w=int(input ())\r\nif 1<=w<=100 and w!=2 and w%2==0:\r\n print('Yes')\r\nelif 1<=w<=100:\r\n print('NO')\r\n", "weight = int(input())\r\n\r\nif weight%2 or weight <= 2:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "weight= int (input()) \r\nWatermelon= weight \r\nif (Watermelon %2==0 ) and (Watermelon>2):\r\n print (\"YES\")\r\n \r\nelse :\r\n print (\"NO\")\r\n \r\n \r\n", "w=int(input())\r\nif 1<=w<=100:\r\n if w%2==0 and w!=2:\r\n print( \"YES\")\r\n else:\r\n print (\"NO\")", "def can_divide_watermelon(w):\r\n # Check if the weight of the watermelon is even and not equal to 2\r\n return w % 2 == 0 and w > 2\r\n\r\n# Input the weight of the watermelon\r\nw = int(input().strip())\r\n\r\n# Check if the boys can divide the watermelon as they want\r\nif can_divide_watermelon(w):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "inp = int(input())\r\nvalue = (inp%2) or (inp == 2)\r\n\r\nprint(\"NO\"*value+\"YES\"*(not value))", "nu=int(input())\nif(nu==2):\n print(\"NO\")\nelif nu%2==0:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t \t \t \t \t \t\t \t \t\t\t\t\t", "w = float(input())\r\nw -= 2\r\nif w <= 0 :\r\n print(\"No\")\r\nelif w % 2 == 0 :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# Read the input\r\nw = int(input())\r\n\r\n# Check if it's possible to divide the watermelon as required\r\n# Both parts need to be even, so w should be greater than or equal to 4\r\n# And w should also be even because it's not possible to get two even parts from an odd number\r\nif w >= 4 and w % 2 == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "w=int(input())\r\nwhile w>2:\r\n if w%2==0:\r\n print(\"YES\")\r\n break\r\n else:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"NO\") \r\n", "W=int(input())\nif(W%2==0 and 2<W<=100):\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\t\t \t \t \t\t \t \t\t\t \t \t \t\t\t", "k=int(input())\nif k>2 and k%2==0:\n print(\"Yes\")\nelse:\n print(\"No\")\n \t\t\t \t\t \t \t \t\t\t\t\t\t \t", "rta = int(input())\nif rta%2 == 1 or rta == 2:\n print(\"NO\")\nelse:\n print(\"YES\")", "w=int(input())\r\nif(w<4):\r\n print('No')\r\nelse:\r\n part1=2\r\n part2=w-part1\r\n if(part1 % 2==0 and part2 % 2==0):\r\n print('Yes')\r\n else:\r\n print('No')", "w = int(input(\"\"))\r\nfor x in range(1, int(0.5 * w)):\r\n y = w - 2 * x\r\n if y % 2 == 0:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "w = int(input())\r\nc = 0\r\nfor i in range(1,w+1):\r\n if i % 2== 0 and (w-i)%2==0:\r\n c+=1\r\nif w == 2:\r\n print('NO')\r\n\r\nelse:\r\n if c>0:\r\n print('YES')\r\n else:\r\n print('NO')", "nb = int(input())\r\nif nb == 2 :\r\n print(\"NO\")\r\nelif ((nb%2) == 0):\r\n print (\"YES\")\r\nelse :\r\n print (\"NO\")", "a=input()\r\na=int(a)\r\nif a%2!=0:\r\n print(\"NO\")\r\nelse:\r\n if a==2:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n \r\n ", "weight = int(input())\r\n\r\nprint(\"YES\" if (weight) % 2 == 0 and weight > 2 else \"NO\")", "w = int(input())\r\nif (int(w) - 2) % 2 == 0 and int(w) != 2:\r\n print(\"YES\") \r\nelse: print(\"NO\")\r\n\r\n\r\n", "x=int(input());\r\nif(x==2 or (x%2)==1):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "kilos = int(input())\r\nif kilos % 2 == 0 and kilos != 2:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "def answer(w: int):\r\n if w%2 == 0 and w>2:\r\n return 'YES'\r\n return 'NO'\r\n\r\nw = int(input())\r\nprint(answer(w))\r\n\r\n\t\t \t \t\t \t\t \t\t\t\t \t \t \t", "a = int(input())\r\nif a>2 and a%2 == 0:\r\n print ('yes')\r\nelse:\r\n print ('no')\r\n", "a=int(input())\nif(a==2):\n print(\"NO\")\nelif(a%2==0):\n print(\"YES\")\nelse:\n print(\"NO\")\n\t \t \t\t \t \t\t \t \t\t\t", "n = int(input())\r\nif n%2 ==0 and n!=2 : print(\"YES\")\r\nelse : print(\"NO\")", "weight=int(input())\nif weight%2==0 and weight>=4:\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", "w = int(input())\r\nif w> 2 and w%2==0:\r\n y = w - 2\r\n if y%2 ==0:\r\n print(\"YES\")\r\nelse:\r\n print('NO')", "s = int(input())\n\n\n# Another\nif s < 4:\n print(\"NO\")\nelif s % 2 == 0:\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", "w = int(input())\nprint(\"YES\" if w%2==0 and w>3 else \"NO\")\n", "kilos = int(input())\r\nif kilos == 2 or kilos %2 is not 0:\r\n print(\"NO\")\r\nelif kilos % 2 == 0:\r\n print(\"YES\")\r\n", "x = input()\n\nw = int(x)\n\npete = 2\n\nbilly = 0\n\nresult = 0\n\nwhile pete <= w:\n billy = w - pete\n if (billy % 2 == 0) and (billy > 0):\n result += 1\n else:\n \tresult += 0\n pete += 2\n\nif result > 0:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "a=int(input())\r\nif a % 2==0 and a!=2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "# Reading the input\r\nw = int(input())\r\n\r\n# Checking if the watermelon can be divided as required\r\nif w % 2 != 0 or w == 2:\r\n result = \"NO\"\r\nelse:\r\n result = \"YES\"\r\n\r\n# Printing the result\r\nprint(result)\r\n", "n = int(input())\r\n\r\nif n < 1 or n > 100:\r\n print(\"NO\")\r\nelif n == 2:\r\n print(\"NO\")\r\nelif n % 2 == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# Read the weight of the watermelon\nw = int(input())\n\n# Check if it's possible to divide the watermelon into two even parts\n# Both parts should have a positive weight, so we check if w is greater than 2 and even\nif w > 2 and w % 2 == 0:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\t\t\t \t \t\t\t \t\t \t \t \t", "i=int(input())\nif i%2==0 and i>2:\n print(\"Yes\")\nelse:\n print(\"No\")\n \t \t \t\t\t \t\t \t\t \t\t\t \t \t \t\t\t", "A = int(input(\"\"))\r\n\r\n\r\nif A % 2 == 0 and A > 2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# Read the weight of the watermelon\r\nw = int(input())\r\n\r\n# Check if it's possible to divide it as per the conditions\r\n# Both parts should be even and positive\r\nif w > 2 and w % 2 == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a = int(input())\r\nif(a%2==0 and a!=2):\r\n print(\"yes\")\r\nelse: print(\"no\")", "n = int(input())\r\ncount = 0\r\npairs = []\r\nfor i in range(1,n+1):\r\n if i and (n-i) != 0:\r\n pairs.append((i,n-i))\r\nfor tup in pairs:\r\n if tup[0] % 2 == 0 and tup[1] % 2 == 0:\r\n count += 1\r\n break\r\n else:\r\n continue\r\nif count >= 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "w=int(input())\n\npeso_dividido= w % 2\n\nif peso_dividido == 0 and w!= 2:\n print(\"YES\")\nelse: print(\"NO\")\n\t \t \t\t\t\t\t \t\t \t\t \t\t\t \t \t \t", "def can_divide_watermelon(weight):\r\n if weight % 2 == 0 and weight > 2:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n\r\n# Read input\r\nw = int(input())\r\n\r\n# Check if they can divide the watermelon as per the conditions\r\nresult = can_divide_watermelon(w)\r\n\r\n# Print the result\r\nprint(result)", "def can_divide_watermelon(w):\r\n # Check if the weight of the watermelon is even and greater than 2\r\n if w >= 4 and w % 2 == 0:\r\n return True\r\n else:\r\n return False\r\n\r\n# Test cases\r\nweight_of_watermelon = int(input())\r\nif can_divide_watermelon(weight_of_watermelon):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "def can_divide_watermelon(w):\n # Check if the weight is even and greater than 2\n if w % 2 == 0 and w > 2:\n return \"YES\"\n else:\n return \"NO\"\n\n# Get the input weight of the watermelon\nw = int(input())\n\n# Check if the watermelon can be divided as desired\nresult = can_divide_watermelon(w)\n\n# Print the result\nprint(result)\n\n\t\t \t\t\t \t \t\t\t\t \t\t \t", "w = int(input())\r\nif w==1 or w==2: print(\"NO\")\r\nelif w % 2 == 0: print(\"YES\")\r\nelse: print(\"NO\")", "x = int(input()) \nprint(\"NO\" if x % 2 == 1 or x == 2 else \"YES\")", "n = int(input())\nprint('YES' if n % 2 == 0 and n > 2 else 'NO')", "a = int(input())\r\na-=2;\r\nif (a %2 == 0 and a>0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "wm=int(input())\r\nif(wm>2 and wm%2==0):\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")", "n = int(input())\r\nprint(\"YES\" if n%2==0 and n!=2 else \"NO\")", "i=int(input())\r\nif(i%2==0 and i!=2):\r\n print('YES')\r\nelse:\r\n print(\"NO\")\r\n ", "n = int(input())\r\nprint(\"YES\" if (not n%2 and n != 2) else \"NO\")", "W = int(input())\nresult = 'NO'\nif W % 2 == 0 and W > 2:\n result = 'YES'\nprint(result)", "import sys\r\nn=int(sys.stdin.readline().split()[0])\r\nif n%2==0 and n>=4:\r\n print('Yes')\r\nelse:\r\n print('No')", "w = int(input())\r\nif 3 <= w <= 100 and (w%2) == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "w = input()\nw = int(w)\n\nif w%2 == 0 and w > 2:\n print(\"Yes\")\nelse:\n print(\"No\")\n \t \t \t \t\t \t \t\t\t \t\t \t\t \t\t \t", "def can_divide_watermelon(w):\r\n # Check if it's possible to divide the watermelon into two even-weight parts\r\n if w % 2 == 0 and w > 2:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n\r\n# Input\r\nw = int(input())\r\n\r\n# Output\r\nresult = can_divide_watermelon(w)\r\nprint(result)\r\n", "a=int(input())\nif a %2==0and a !=2:\n print(\"yes\")\nelse:\n print(\"no\")\n \t \t \t \t \t \t \t\t\t\t\t \t \t", "w=int(input())\nif (w%2==0) and w>2:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t\t \t\t \t\t\t \t\t\t\t\t \t\t \t \t", "w = int(input())\r\nprint('NO' if w & 1 or w == 2 else 'YES')", "y=int(input())\nif y%2==0 and y>2:\n print(\"yes\")\nelse:\n print(\"no\")\n \t \t \t \t \t\t\t \t \t \t \t \t\t", "def can_divide_watermelon(w):\r\n return \"YES\" if w > 2 and w % 2 == 0 else \"NO\"\r\n\r\n# Read the weight of the watermelon\r\nw = int(input())\r\n\r\n# Check if the watermelon can be divided as desired and print the result\r\nresult = can_divide_watermelon(w)\r\nprint(result)\r\n", "a=float(input())\r\n#b=float(input(\"\"))\r\n\r\n# c=int(input(\"let's see if we can divide the weight in the way you want for continue press 2:\"))\r\nif a==0:\r\n print(\"not accepted\")\r\nif a==2:\r\n print(\"NO\")\r\nelse: \r\n if a % 2 == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n#input()", "#watermelon problem in codeforce\r\nw = int(input())\r\nif (w%2 == 0 and w>2):\r\n print(\"yes\")\r\nelse:\r\n print(\"No\")", "w = int(input())\r\nif w<4:\r\n print(\"no\")\r\nelif(w>=4 and w%2==0):\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")", "w=int(input())\r\nif w % 2 == 0 and w > 3:\r\n\tprint(\"yes\") \r\nelse:\r\n\tprint(\"no\")", "weight = int(input())\r\nif (weight % 2 == 0 and weight>2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\ncount=0\r\nfor i in range(1,n):\r\n if n%i==0:\r\n if i%2==0:\r\n count+=1\r\nif count>0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nass = n % 2\r\nif (ass==0 and n!=2):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "# Function to check if the watermelon can be divided into two parts with even weights\r\ndef divide_watermelon(w):\r\n # Check if the weight is even and greater than 2\r\n if w % 2 == 0 and w > 2:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n\r\n# Read the weight of the watermelon\r\nw = int(input())\r\n\r\n# Check if the watermelon can be divided and print the result\r\nprint(divide_watermelon(w))\r\n", "melancia = int(input())\r\nif(melancia > 2 and melancia % 2 == 0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\n\ninput = sys.stdin.readline\n\ndef solve(w):\n return w > 2 and w % 2 == 0\n\nif __name__ == \"__main__\":\n # Read in input:\n inp = input()\n\n # Call solution:\n ans = solve(int(inp))\n\n if ans:\n print('YES')\n else:\n print('NO')\n", "weight = int(input())\n\nprint(\"YES\" if weight % 2 == 0 and weight > 2 else \"NO\")\n", "x=int(input()) \nif x>2 and x%2==0 :\n print(\"yes\") \nelse:\n print(\"no\") \n#d\n\t\t\t \t\t\t \t \t \t \t\t \t \t", "w=int(input())\r\nprint(\"yes\" if w>2 and w%2==0 else \"no\")", "w = int(input()) # Input the weight of the watermelon\r\n\r\n# Check if it's possible to divide w into two even parts\r\n# such that both parts are positive\r\nif w >= 4 and w % 2 == 0:\r\n print(\"YES\") # It's possible\r\nelse:\r\n print(\"NO\") # It's not possible", "num = int(input())\r\nif num %2 == 0 and num>2 and (num-2)%2==0:\r\n print('YES')\r\nelse:\r\n print('NO')", "def divideWatermelon(weight):\n \n if weight % 2 == 0 and weight > 2:\n return \"YES\"\n else:\n return \"NO\"\n\nw = int(input())\n\nresult = divideWatermelon(w)\n\nprint(result)\n\n \t\t \t \t\t\t \t\t \t\t\t \t \t\t\t \t \t \t", "def main():\r\n # read input. Int between 1 and 100\r\n n = int(input())\r\n\r\n # print YES or NO\r\n print(\"YES\" if n % 2 == 0 and n > 2 else \"NO\")\r\n\r\nif __name__ == '__main__':\r\n main()", "# LUOGU_RID: 126250285\na = int(input())#include<iostream>\nif a == 2:\n print(\"NO\")\nelif a % 2 == 0:\n print(\"YES\")\nelse:\n print(\"NO\")\n\"\"\"\nif i == 0:\n print\n\"\"\"\n", "n=int(input())\r\nans=\"YES\" if n&1==0 and n>2 else \"NO\"\r\nprint(ans) ", "Q=int(input())\r\nif(Q%2==0 and Q>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 \r\n \r\n \r\n \r\n ", "a = float(input())\r\nif a == 2:\r\n print(\"NO\")\r\nelif a%2 == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n \r\n \r\n\r\n \r\n \r\n", "\r\nm=int(input())\r\nk=m%2\r\nif(1<=m<=100):\r\n if(m!=2):\r\n if(k==0):\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n else:\r\n print(\"No\")", "import sys\ninput = sys.stdin.readline\n\n# from math import gcd as gcd, isqrt\n# import bisect #-->For bisect.bisect_left=lower_bound and bisect_right=upper_bound\n\nt = 1\n# t = int(input())\nfor _ in range(t):\n n = int(input())\n if (n <= 2 or n%2):\n print(\"NO\")\n else:\n print(\"YES\")\n \t\t \t\t\t \t \t \t \t \t \t\t\t \t", "x=int(input())\n\nif x%2==0 and x != 2:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "x=int(input())\r\ndef isDivd(x):\r\n if x % 2==0 and x>2:\r\n return 'yes'\r\n else:\r\n return 'NO'\r\nprint(isDivd(x))", "p=int(input())\nif p>2 and p%2==0:\n print(\"Yes\")\nelse:\n print(\"No\")\n\t\t\t\t\t \t\t\t \t \t \t \t \t \t\t", "w=int(input())\r\nif ((w>2) and (w % 2 ==0)):\r\n print('YES')\r\nelse:\r\n print('NO')", "W = int(input())\r\nif W>3 and W%2==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "n = int(input())\r\n \r\nif n % 2 or n < 3: print(\"NO\")\r\nelse: print(\"YES\")", "wm=int(input())\r\nif 1<=wm<=100:\r\n if wm%2==0 and wm!=2:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")", "w=int(input())\r\nprint(\"YES\" if w!=2 and w%2==0 else \"NO\")\r\n", "r=int(input( ))\r\nif r%2==0 and r>2:\r\n print('YES')\r\nelse:\r\n print('NO')", "w = int(input())\r\nif w in range(4, 101, 2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def can_divide_watermelon(weight):\n if weight % 2 == 0 and weight > 2:\n return \"YES\"\n else:\n return \"NO\"\n\n# Read input\nw = int(input())\n\n# Check if they can divide the watermelon and print the result\nresult = can_divide_watermelon(w)\nprint(result)\n\n\t\t \t\t \t \t \t\t\t\t \t \t \t \t \t \t \t", "w = int(input())\r\n\r\nif ( w == 2 ): print ('NO')\r\nelif (w%2==0):\r\n print ('YES')\r\nelse:\r\n print ('NO')", "w=int(input())\r\nif w%2==0 and w>3:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "w = int(input())\r\n\r\nif (w >= 4) and (w % 4 in [0, 2]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "j=int(input())\r\n\r\n\r\nprint('YES' if j > 2 and j % 2 == 0 else \"NO\")", "w = int( input() )\nif w % 2 == 0 and w > 2:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t\t\t\t\t \t\t \t\t \t \t\t\t \t\t \t", "n = int(input())\n\nisOk = False\nfor i in range(2, n):\n if n % 2 == 0 and (n - 2) % 2 == 0:\n isOk = True\n break\n\nif isOk:\n print(\"YES\")\nelse:\n print(\"NO\")", "t=int(input())\r\nL=set()\r\nk=set()\r\nfor i in range(t):\r\n L.add(t/(i+1))\r\nfor i in L:\r\n if i%2==0:\r\n k.add(i)\r\n else:\r\n pass\r\n \r\nif 0<=len(k)<=1:\r\n print('NO')\r\nelse:\r\n print('YES')", "kilo=int(input())\r\nif kilo%2==0 and kilo>2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=int(input())\r\nif (a-2)%2==0 and a>2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "w11 = int(input())\r\n\r\n\r\nif w11 % 2 == 0 and (w11 - 2) % 2 == 0 and w11 > 2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "h = int(input())\r\nif h>3 and h%2==0:\r\n print('YES')\r\nelse:\r\n print('NO')", "def dw(weight):\r\n if weight%2==0 and weight>2:\r\n return(\"YES\")\r\n else:\r\n return(\"No\")\r\nweight=int(input())\r\nres=dw(weight)\r\nprint(res)", "weight = input()\r\nnumber = int(weight) % 2\r\nif int(weight) == 2:\r\n print('NO')\r\nelif number == 0:\r\n print('YES')\r\nelse:\r\n print('NO')", "n=int(input())\r\nif n==2 :\r\n print(\"NO\\n\")\r\nelif n%2==0 :\r\n print(\"YES\\n\")\r\nelse :\r\n print(\"NO\\n\")", "print('YNEOS'[5%~int(input())%2::2])", "L=int(input())\nif L==2:\n print(\"NO\")\nelif L%2==0:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t \t \t \t \t \t \t \t", "w = int(input())\n\nprint(\"yes\" if w%2 == 0 and w != 2 else \"no\")\n", "def can_divide_watermelon(w):\r\n if w <= 2 or w % 2 != 0:\r\n return \"NO\"\r\n else:\r\n return \"YES\"\r\n\r\n# Read the weight of the watermelon from input\r\nw = int(input())\r\n\r\n# Check if the watermelon can be divided as desired\r\nresult = can_divide_watermelon(w)\r\n\r\n# Print the result\r\nprint(result)\r\n", "num = int(input())\r\n\r\nif num % 2 == 1 or num == 2:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "w = int(input())\r\nif (w%2 != 0) or (w == 2):\r\n print ('NO')\r\nelse:\r\n print ('YES')", "w = int(input())\r\n\r\n# Check if the weight of the watermelon is even and greater than 2\r\n# Additionally, check if w minus 2 is also even\r\nif w > 2 and w % 2 == 0 and (w - 2) % 2 == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "W = int(input())\r\nif W%2==0 and W!=2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")" ]

[ "n,m=map(int, input().split())\r\na=sum(list(map(int, input().split())))\r\nif a+(n-1)*10<=m:\r\n print((m-a)//5)\r\nelse:\r\n print(-1)", "n,d=map(int,input().split())\r\ns=0\r\nj=0\r\nt=list(map(int,input().split()))\r\nfor i in range(n):\r\n s=s+t[i]\r\ns=s+(n-1)*10\r\nif(s<=d):\r\n j=2*(n-1)+(d-s)//5\r\n print(j)\r\nelse:\r\n print(-1)", "n, limit = map(int, input().split())\r\nlst = list(map(int, input().split()))\r\ns = sum(lst) + (n - 1) * 10\r\nif s > limit:\r\n print(-1)\r\nelse:\r\n print(2 * (n - 1) + (limit - s) // 5)", "import math\n\nn, d = list(map(int, input().split()))\nt = list(map(int, input().split()))\nsingtime = 0\n\ndc = d\n\nfor i in t:\n\tsingtime += i\n\nd-=(n-1)*10+singtime\n\n\nif d < 0:\n\tprint(-1)\n\nelse:\n\tdc-=singtime\n\tprint(math.floor(dc/5))\n", "n, d = map(int,input().split())\r\nt = [int(t) for t in input().split()]\r\ns = sum(t) + 10*(n-1)\r\nres = 0\r\nif s > d:\r\n res = -1\r\nelse:\r\n s = sum(t)\r\n res = int((d-s)/5)\r\nprint(res)", "n,d=map(int, input().split())\r\na=list(map(int, input().split()))\r\nsongst=sum(a)\r\nmint=songst+(n-1)*10\r\nif d>=mint:\r\n\tprint((d-songst)//5)\r\nelse:\r\n\tprint(-1)", "n,d=map(int,input().split())\r\nl=sum(map(int,input().split()))\r\nif l+n*10-10>d: \r\n print(-1)\r\nelse: \r\n print((d-l)//5)", "\r\nxy=list(map(int,input().rstrip().split()))\r\nnn=list(map(int,input().rstrip().split()))\r\ndur=xy[1]\r\nflag=0\r\ntmin=(xy[0]-1)*10+(sum(nn))\r\n\r\nif tmin>dur:\r\n print(-1)\r\n flag=1\r\n\r\nif flag==0:\r\n extratime=dur-((xy[0]-1)*10+(sum(nn)))\r\n numjokes=int(extratime/5)+int((xy[0]-1)*2)\r\n print(numjokes)\r\n", "\r\nline1 = list(map(int,input().split()))\r\n\r\nn = line1[0]\r\nd = line1[1]\r\n\r\n\r\n\r\nlis = list(map(int,input().split()))\r\n\r\n \r\nflag = 0\r\njokes = 0\r\ntime = 0\r\n\r\nfor i in range(n):\r\n time+=lis[i]\r\n if time > d:\r\n flag = 1\r\n break\r\n jokes += 2\r\n time+=10\r\n \r\nif flag == 1:\r\n print(-1)\r\nelse:\r\n remTime = d-time\r\n jokes+=remTime//5\r\n print(jokes)", "n, d = map(int, input().split())\r\nsong_duration = list(map(int, input().split()))\r\n\r\ntotal_sing_time = sum(song_duration) + (n-1)*10;\r\n\r\nif (total_sing_time > d):\r\n print (-1)\r\nelse:\r\n remaining_time = d - total_sing_time\r\n max_jokes = (((n-1)*10) +remaining_time) //5\r\n print(max_jokes) \r\n", "n,d=[int(x) for x in input().split()]\r\nt=[int(x) for x in input().split()]\r\n\r\nsumm=sum(t)+(n-1)*10\r\n\r\nif summ>d:\r\n print(-1)\r\nelse:\r\n print((n-1)*2+(d-summ)//5)", "n, d = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nres = 0\r\nt = 0\r\nfor i in a[:-1]:\r\n t += i + 10\r\n res += 2\r\nt += a[-1]\r\nif t > d:\r\n res = -1\r\nelse:\r\n res += (d - t) // 5\r\nprint(res)", "m,n=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nif n<(m-1)*10+sum(l):\r\n\tprint('-1')\r\nelse:\r\n\tprint((n-sum(l))//5)\t\r\n", "n, d = map(int, input().strip().split(' '))\r\nt = list(map(int, input().strip().split(' ')))\r\nlong_songs = sum(t)\r\nextra_time = d - long_songs - (n - 1) * 10\r\nif extra_time < 0:\r\n print(-1)\r\nelse:\r\n print(extra_time // 5 + (n - 1) * 2)", "b,d = input().split()\r\nb=int(b)\r\nd=int(d)\r\na= list(map(int, input().split()))\r\nsum=0\r\nfor x in a:\r\n sum+=x\r\nif sum+(b-1)*10<=d:\r\n print((d-sum)//5)\r\nelse:\r\n print(-1)", "n,d = map(int,input().split())\r\nt = list(map(int,input().split()))\r\nif (d - (n - 1)*10 - sum(t))<0:\r\n print(-1)\r\nelse:\r\n print((d - sum(t))//5)", "n, d = map(int, input().split())\r\nt = list(map(int, input().split()))\r\n\r\ntotal_song_time = sum(t)\r\nd -= total_song_time\r\ntotal_required_breaks = d//10\r\nif total_required_breaks<n-1:\r\n print(-1)\r\nelse:\r\n print( d//5 )", "er=list(map(int,input().split()))\nsd=list(map(int,input().split()))\nwd=sum(sd)+10*((len(sd)-1))\nif(wd>er[1]):\n print(-1)\nelse:\n print(abs(wd-er[1])//5+((len(sd)-1)*2))\n\n\t\t\t\t\t \t \t \t\t \t\t\t \t\t", "# from sys import stdin, stdout\r\n\r\n# import re\r\n\r\n# import math\r\n# import statistics\r\n# import itertools\r\n# import collections\r\n# import cmath\r\n\r\n# import calendar\r\n# import datetime\r\n\r\n# import operator\r\n\r\n#----------Profiling----------\r\n# import cProfile\r\n# import pstats\r\n\r\nn, t = map(int, input().split())\r\nsongs = list(map(int, input().split()))\r\njokes_cracked = 0\r\nfor i in range(n-1):\r\n t = t - songs[i] - 10\r\n jokes_cracked = jokes_cracked + 2\r\n if t < 0:\r\n break\r\nt = t - songs[-1]\r\njokes_cracked += t // 5\r\nif t < 0:\r\n print(-1)\r\nelse:\r\n print(jokes_cracked)\r\n", "n,d=map(int,input().split())\r\nt=list(map(int,input().split()))\r\nsumo=0\r\ncount=0\r\nfor i in range(n):\r\n sumo+=t[i]\r\n if i<n-1:\r\n count+=2\r\n sumo+=10\r\n else:\r\n count+=(d-sumo)//5\r\nif sumo>d:\r\n print(-1)\r\nelse:\r\n print(count)", "from math import *\r\nn,d=map(int,input().split())\r\na = list(map(int,input().split()))\r\ns = sum(a)+(n-1)*10\r\nif s>d:\r\n print(-1)\r\nelse:\r\n ans = (n-1)*2+floor((d-s)/5)\r\n print(ans)", "n,d = map(int,input().split())\nx = [int(i) for i in input().split()]\nif d<sum(x) +10*(n-1):\n\tprint(\"-1\")\nelse:\n\tprint((d- sum(x) )//5)\n\n", "def sc(d, lst):\r\n suma = sum(lst) + 10 * (len(lst) - 1)\r\n if suma > d:\r\n return -1\r\n return 2 * (len(lst) - 1) + (d - suma) // 5\r\n\r\n\r\nN, D = [int(i) for i in input().split()]\r\nb = [int(j) for j in input().split()]\r\nprint(sc(D, b))\r\n", "n,d = list(map(int,input().split()))\r\narr = list(map(int,input().split()))\r\ns= sum(arr)\r\nif(s+10 *(n-1) > d):\r\n print(-1)\r\nelse:\r\n print((d-s)//5)", "n,d=map(int,input().split())\r\nl=list(map(int,input().split()))\r\np=sum(l)\r\ns=sum(l)+((n-1)*10)\r\nif(s<=d):\r\n print((d-p)//5)\r\nelse:\r\n print(-1)", "n,d=map(int,input().split())\r\nl1=list(map(int,input().split()))\r\nif 10*(n-1)+sum(l1)>d:\r\n print(-1)\r\nelse :\r\n print((d-sum(l1))//5)", "n, d = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nif sum(a)+(n-1)*10 > d:\r\n print(\"-1\")\r\nelse:\r\n print((d-sum(a))//5)\r\n", "n, d = map(int, input().split())\r\nif n == 1:\r\n times = [int(input())]\r\nelse:\r\n times = list(map(int, input().split()))\r\ns = sum(times)\r\nif s+(n-1)*10<=d:\r\n jokes = (n-1)*2\r\n d -= s+(n-1)*10\r\n jokes += d//5\r\n print(jokes)\r\n \r\nelse:\r\n print(-1)\r\n \r\n", "n, d = map(int, input().split())\nv = map(int, input().split())\nj = (n - 1) * 2\nm = 5 * j + sum(v)\nif m > d:\n print(-1)\nelse:\n print((d - m) // 5 + j)\n", "n,d=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=sum(l)+10*(len(l)-1)\r\nif s>d:\r\n print(\"-1\")\r\nelse:\r\n print(int((d-sum(l))/5))\r\n", "n, d=map(int, input().split())\r\na=list(map(int, input().split()))\r\n\r\nt=0;songs=0;jokes=0\r\nfor i in range(n):\r\n\t#Time taken by Devu\r\n\tt+=a[i]\r\n\tif t<=d:\r\n\t\t#If Devu can sing a song he sings after rest\r\n\t\tsongs+=1\r\n\t\tt+=10\t#Since he can sing, he sings and takes rest\r\n\t\tif t>d:\t\r\n\t\t\t#If after taking rest, there is no time to sing more, he dont sing and the show stops\r\n\t\t\tt-=10\t#Time is decreased to find remaining time, whether it exists or not for Churu. 10 could also not be subtracted, if not, then another conditional is to be used in at the end\r\n\t\t\tbreak\r\n\t\telse:\t\r\n\t\t\t#If time remains for the show after 10min, then Churu tells jokes\r\n\t\t\tjokes+=2\r\np=d-t\r\n#p=Remaining time of the concert\r\nif songs!=n:\r\n\tprint(-1)\r\nelse:\r\n\t#If there remains any time for jokes, Churu does it to pass time p//5\r\n\tprint(jokes+(p//5))\t", "s=[int(n) for n in input().split()]\r\na=[int(n) for n in input().split()]\r\nx=sum(a)+(s[0]-1)*10\r\nif x>s[1]:\r\n\tprint(-1)\r\nelse:\r\n\tprint(((s[1])-sum(a))//5)\r\n", "from sys import stdin, stdout\r\nnmbr = lambda: int(stdin.readline())\r\nlst = lambda: list(map(int,stdin.readline().split()))\r\nfor i in range(1):#nmbr()):\r\n n,d=lst()\r\n a=lst()\r\n if sum(a)+10*(n-1)>d:\r\n print(-1)\r\n continue\r\n left=d-(10*(n-1)+sum(a))\r\n ans=2*(n-1)+left//5\r\n print(ans)\r\n", "n,d=map(int,input().split())\r\nt=list(map(int,input().split()))\r\ns=sum(t)\r\ns=s+(n-1)*10\r\nif(d<s):\r\n print(-1)\r\nelse:\r\n print((d-sum(t))//5)", "n,d = map(int,input().split())\r\narr = list(map(int,input().split()))\r\nif ((sum(arr) + (n-1)*10 ) > d):\r\n print(-1)\r\nelse :\r\n print((d - sum(arr))//5)", "import sys\r\nimport math\r\n\r\n#En Codeforces se parsea el stdin, pero como no se como funciona aca,\r\n#utilizare linea por linea para no complicar la entrega con inputs externos\r\n\r\ntexto = sys.stdin.read().split(\"\\n\")\r\ntexto.pop(-1)\r\n\r\n#test1\r\n#texto+=[\"3 30\"]\r\n#texto+=[\"2 1 1\"]\r\n\r\n#test2\r\n#texto+=[\"3 20\"]\r\n#texto+=[\"2 2 1\"]\r\n\r\nn,d = texto[0].split(\" \")\r\nn = int(n)\r\nd = int(d)\r\nduraciones = [int(x) for x in texto[1].split(\" \")]\r\n\r\ntotal = ( (len(duraciones)-1) * 10) + sum(duraciones)\r\n\r\nif (total) > d:\r\n print(-1)\r\nelse:\r\n print( (len(duraciones)-1)*2 + math.floor((d-total)/5))\r\n", "n, d = map(int, input().split())\r\nw = list(map(int, input().split()))\r\n\r\nx = (n-1)*10 + sum(w)\r\nprint(-1 if x > d else (n-1)*2 + (d-x)//5)\r\n", "n,d = map(int,input().split())\r\nt = list(map(int,input().split()))\r\nans = (d-sum(t))//5\r\nif ans < 2*(n-1):\r\n print(-1)\r\nelse:\r\n print(ans)\r\n", "a,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nprint(\"-1\" if (sum(l)+10*(a-1))>b else (b-sum(l))//5)", "n,d=[int(x) for x in input().split()]\r\nt=[int(x) for x in input().split()]\r\nif (sum(t)+(n-1)*10)>d:\r\n print(-1)\r\nelse:\r\n total=sum(t)+(n-1)*10\r\n print(((n-1)*2)+(d-total)//5)\r\n", "n,d=[int(x) for x in input().split()]\ntimes=[int(x) for x in input().split()]\ntotal_time_for_singer=(n-1)*10+sum(times)\nif total_time_for_singer>d:\n print(-1)\nelse:\n print(2*(n-1)+(d-total_time_for_singer)//5)", "nyanyi,waktu = map(int, input().split())\r\nx = list(map(int , input().split()))\r\nif ((len(x)-1)*10 + sum(x)) > waktu:\r\n print(-1)\r\nelse:\r\n print(int((waktu-sum(x))/5))\r\n", "x,y=map(int,input().split())\r\nl=[int(x) for x in input().split()]\r\nt=sum(l)+(x-1)*10\r\nif t>y:\r\n print(-1)\r\nelse:\r\n print(((x-1)*2)+(y-t)//5)", "n,d=[int(x) for x in input().split()]\r\na=[int(x) for x in input().split()]\r\nif sum(a)+(n-1)*10>d:\r\n print(-1)\r\nelse:\r\n print(2*(n-1)+(d-sum(a)-(n-1)*10)//5)", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=sum(l)+(n-1)*10\r\nif(s>m):\r\n print(-1)\r\nelse:\r\n print((n-1)*2+(m-s)//5)\r\n\r\n\r\n \r\n \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,d = map(int,input().split())\r\nmas = list(map(int,input().split()))\r\nrez = 0\r\nd-=sum(mas)\r\nd-=(n-1)*10\r\nif d<0:\r\n print(-1)\r\nelse:\r\n rez+=2*(n-1)\r\n rez+=d//5\r\n print(rez)\r\n", "a=list(map(int,input().split()))\r\nn=int(a[0])\r\nd=int(a[1])\r\nl=[0]*n\r\nl=list(map(int,input().split()))\r\nt=0\r\nb=0\r\nfor i in range(n):\r\n t=t+l[i]\r\nif t+((n-1)*10)>d:\r\n print(-1)\r\nelse:\r\n b=(d-t)/5\r\n print(int(b))\r\n", "n,d=map(int,input().split())\r\nA=list(map(int,input().split()))\r\nX=(d-sum(A))//5\r\nif sum(A)+(n-1)*10 > d:\r\n print(\"-1\")\r\nelse:\r\n print(X)", "n, d = [int(x) for x in input().split()]\nx = [int(x) for x in input().split()]\nb = sum(x)\nif b + (len(x) - 1) * 10 > d:\n print(-1)\nelse:\n print(((len(x) - 1) * 10) // 5 + (d - (b + ((len(x) - 1) * 10))) // 5)\n", "q = list(map(int, input().split()))\r\nn = q[0]\r\nt = q[1]\r\nw = list(map(int, input().split()))\r\nmint = sum(w)+(len(w)-1)*10\r\nif(mint>t):\r\n print(-1)\r\nelse:\r\n print((len(w)-1)*2+(t-mint)//5)", "n_songs, d_mins = map(int, input().split())\nsong_mins = list(map(int, input().split()))\n\nif sum(song_mins) + 10 * (n_songs - 1) > d_mins:\n print(-1)\nelse:\n result = 0\n for song in song_mins:\n d_mins -= song\n if d_mins >= 10:\n d_mins -= 10\n result += 2\n result += d_mins // 5\n print(result)\n", "a,b=map(int, input().split())\r\nl=list(map(int, input().split()))\r\nc=sum(l)+(a-1)*10\r\nif c>b:\r\n print(\"-1\")\r\nelse:\r\n d=b-c\r\n print(d//5+(a-1)*2)\r\n ", "#A. Devu, the Singer and Churu, the Joker\r\nn,d = [int(x) for x in input().split()]\r\ntimes = [int(x) for x in input().split()]\r\n\r\nsing_dur = 0\r\njokes = 0\r\nfor t in times:\r\n sing_dur+=t+10\r\n jokes += 2\r\nsing_dur-=10\r\njokes-=2\r\nif sing_dur>d:\r\n print(-1)\r\n exit()\r\nr_dur = d - sing_dur\r\njokes += int(r_dur/5)\r\nprint(jokes)", "n, d = map(int, input().split())\ns = sum(map(int, input().split())) + 10 * (n-1)\nif s > d:\n print(-1)\nelse:\n print(2 * (n - 1) + (d-s) // 5)", "I = lambda: map(int, input().split())\nn, d, *a = * I(), * I()\nx = (d - sum(a)) // 5\nprint((-1, x)[sum(a) + 10 * (len(a) - 1) <= d])\n", "n1=list(map(int,input().split()))\r\nn=int(n1[0])\r\nd=int(n1[1])\r\nL=list(map(int,input().split()))\r\ns=sum(L)\r\na=d-s\r\nif((s+10*(n-1))>d):\r\n print(-1)\r\nelse:\r\n print((d-s)//5)", "length,time = map(int,input().split())\r\nlis = list(map(int,input().split()))\r\ns = sum(lis)\r\nif time -s<10*(length-1):\r\n print(-1)\r\nelse:\r\n print((time-s)//5)", "n, d = map(int,input().split())\r\nt = list(map(int,input().split()))\r\nx = d-(sum(t)+((len(t)-1)*10))\r\nif x < 0:\r\n print(-1)\r\nelse:\r\n print((d-sum(t))//5)\r\n \r\n", "n, d=[int(x) for x in input().split()]\r\nt= [int(x) for x in input().split()]\r\ncount=-2\r\ne=d\r\nif d>=sum(t)+(n-1)*10:\r\n for i in range(n):\r\n e=e-(t[i]+10)\r\n count+=2\r\n print(int((e+10)/5) + count)\r\nelse:\r\n print(-1)", "n, d = map(int, input().split())\r\na = [int(x) for x in input().split()]\r\nsum = 0\r\nfor i in range(n):\r\n\tsum += a[i]\r\nif((sum + (n - 1) * 10) > d):\r\n\tprint('-1')\r\nelse:\r\n\tprint(2 * (n - 1) + (d - (sum + (n - 1) * 10)) // 5)\r\n\t", "\r\nn, d=map(int, input().split())\r\nar=list(map(int, input().split()))\r\ns=sum(ar)\r\nt=s+(10*(n-1))\r\n\r\nif t>d:\r\n\tprint(-1)\r\nelse:\r\n\tx=(n-1)*2\r\n\tif t==d:\r\n\t\tprint(x)\r\n\telse:\r\n\t\tprint(((d-t)//5)+x)", "n,d=map(int,input().split())\r\na=[int(x) for x in input().split()]\r\n#print(a\r\na.sort()\r\njc=0\r\nwhile d>0:\r\n if len(a)>0 and len(a)!=1:\r\n #print(\"time reamining before singing\",d)\r\n d-=a.pop()\r\n #print(\"time left after performing\",d)\r\n #checking if time left to rest\r\n if 10<=d:\r\n d-=10\r\n #print(\"time after rest\",d)\r\n jc+=2\r\n #print(\"jokes cracked\",jc)\r\n else:\r\n #print(\"time left in else\",d)\r\n jc+=d//5\r\n #print(\"jokes cracked\",jc)\r\n break\r\n elif len(a)==1:#last song here he won't need 10 mins rest\r\n d-=a.pop()\r\n jc+=d//5\r\n break\r\nif len(a)!=0:\r\n print(-1)\r\nelse:\r\n print(jc)\r\n ", "n , d = input().split()\r\nn = int(n) #no of songs\r\nd = int(d) #max time of the show\r\n\r\nl = list(map(int,input().split()))\r\ns = 0\r\ncount = 0\r\nfor i in l[:-1]:\r\n s += i + 10\r\n count +=2\r\ns += l[-1]\r\nif s > d:\r\n print(-1)\r\nelse:\r\n rem = d - s\r\n rem = rem//5\r\n print(rem+count)", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\n\r\nif sum(l) + 10*(n-1) >m:\r\n print(-1)\r\nelse:\r\n ans=2*(n-1)\r\n m-=(sum(l) + 10*(n-1))\r\n ans+=m//5\r\n print(ans)\r\n", "n, d = map(int, input().split())\r\nt = [int(i) for i in input().split()]\r\n\r\nq = sum(t) + 10 * (n-1) \r\nif q <= d:\r\n print((n-1)*2 + (d-q)//5)\r\nelse:\r\n print(-1)\r\n", "n,d=map(int,input().split())\r\nt=list(map(int,input().split()))\r\nc=sum(t)\r\nd=d-c\r\nif((d//10)>=(n-1)):\r\n print(d//5)\r\nelse:\r\n print(-1)", "a,b=map(int,input().split())\r\nl=sum(map(int,input().split()))\r\nt=l+(a-1)*10\r\nif t<=b:\r\n\tprint((a-1)*2+(b-t)//5)\r\nelse:\r\n\tprint(-1)", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn, d = map(int, input().split())\r\n*t, = map(int, input().split())\r\nsum_time = sum(t) + (n - 1) * 10\r\nif sum_time > d:\r\n print(-1)\r\nelse:\r\n ans = (n - 1) * 10 + d - sum_time\r\n print(ans // 5)\r\n", "n, d = map(int, input().split())\r\nlst = [*map(int, input().split())]\r\nres = (d - ((n - 1) * 10 + sum(lst))) // 5\r\n\r\nif (sum(lst) + (n - 1) * 10) > d:\r\n print(-1)\r\nelse:\r\n res += (n - 1) * 2\r\n print(res)\r\n", "n, d = list(map(int, input().split()))\nsongs = list(map(int, input().split()))\n\ntime = 0\njokes = 0\novertime = False\nwhile True:\n if len(songs) == 0:\n jokes += (d-time)//5\n break\n s = songs.pop()\n if time + s > d:\n overtime = True\n break\n else:\n time += s\n if len(songs) > 0:\n jokes += 2\n time += 10\n\nif overtime:\n print(-1)\nelse:\n print(jokes)\n", "# Devu, the Singer and Churu, the Joker(439A)\r\n\r\nn,t = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nchuru = (n-1)*10\r\nsm = sum(l)\r\n\r\nif t < (sm + churu):\r\n print(-1)\r\nelse:\r\n print((t-sm) // 5)\r\n ", "s = str(input()).split()\nt = str(input()).split()\n\nn = int(s[0])\nd = int(s[1])\n\nx = 0\nfor i in range(n):\n x += int(t[i])\n\nc = (d-x)//5\nx += 10*(n-1)\n\nif x > d:\n print(-1)\nelse:\n print(c)", "n, d = map(int, input().split())\nl = list(map(int, input().split()))\nif sum(l)+(n-1)*10 > d:\n print(-1)\nelse:\n print((d-sum(l))//5)", "[n,d] = [int(x) for x in input().split(\" \")]\r\nldds = [int(x) for x in input().split(\" \")]\r\n\r\ns = sum(ldds) \r\n \r\nif (s+(len(ldds)-1)*10) > d:\r\n print(\"-1\")\r\nelse:\r\n ncj = (d-s)//5\r\n print(ncj)", "n,d=map(int,input().split())\r\nt=list(map(int,input().split()))\r\ns=sum(t[:len(t)-1])\r\ntime_req=(len(t)-1)*10+s+t[n-1]\r\nif time_req<=d:\r\n print(((d-sum(t))//5))\r\nelse:\r\n print(-1)", "n, d = [int(n) for n in input(\"\").split(' ')]\r\nx = list(map(int, input().split(' ')[:n]))\r\nfree = (n-1)*10\r\nsu = sum(x)+free\r\nif su<=d:\r\n joke = free//5\r\n jok = (d-su)//5\r\n total = joke+jok\r\nelse:total =-1\r\nprint(total)\r\n \r\n ", "# -*- coding: utf-8 -*-\n\"\"\"Untitled73.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1OIKKcExy-vhDD3DEqtV1B74bUwYty31e\n\"\"\"\n\nn,d=map(int,input().split())\nl1=list(map(int,input().split()))\ns=sum(l1)\nif d<s+(n-1)*10:\n print(-1)\nelse:\n print((d-s)//5)", "n,d=[int(i) for i in input().split()]\r\ns=[int(i) for i in input().split()]\r\nx=(len(s)-1)*10\r\nif(sum(s)+x)>d:\r\n print(-1)\r\nelse:\r\n z=d-(sum(s)+x)\r\n print((z+x)//5)", "\r\n\r\na , b = input().split()\r\na = int(a)\r\nb = int(b)\r\n\r\nx = [int(x) for x in input().split()]\r\n\r\n\r\nif sum(x) + (a - 1) * 10 <= b:\r\n print((b - sum(x)) // 5)\r\nelse:\r\n print(-1)\r\n\r\n\r\n \r\n\r\n ", "n,d = map(int,input().split())\r\ns = list(map(int,input().split()))\r\nq = sum(s) + 10*(len(s) - 1)\r\nif q > d:\r\n print(-1)\r\nelse:\r\n ot = (len(s) - 1) * 2 + ((d - q) // 5)\r\n print(ot)", "a,b=(int(i) for i in input().split())\r\nc=[int(i) for i in input().split()]\r\nd=sum(c)+(a-1)*10\r\nif d>b:\r\n print('-1')\r\n quit()\r\nelse:\r\n print((b-sum(c))//5)\r\n", "n,d=input().split()\r\nn=int(n)\r\nd=int(d)\r\narr = input() \r\nl = list(map(int,arr.split(' ')))\r\ns=0\r\nfor i in range(0,n):\r\n s=s+l[i]\r\ns=s+ (n-1)*10\r\n\r\nif(s>d):\r\n print(-1)\r\nelse:\r\n ans=(n-1)*2 + (d-s)//5\r\n print(ans)\r\n \r\n", "z=list(map(int,input().split()))\r\ny=list(map(int,input().split()))\r\n\r\nif z[1]<(sum(y)+(z[0]-1)*10) :\r\n print(-1)\r\nelse :\r\n print((z[1]-sum(y))//5)", "def solve():\r\n n,d = list(map(int,input().split()))\r\n a = list(map(int,input().split()))\r\n b = sum(a) + (n - 1)*10\r\n if b <= d:\r\n return (d-b)//5 + (n - 1)*2\r\n return -1\r\nprint(solve())", "n, d = list(map(int, input().split()))\r\nt = list(map(int, input().split()))\r\nsong = sum(t)\r\njokes = 10*(n-1)\r\nif d >= song + jokes:\r\n print((d-song)//5)\r\nelse:\r\n print(-1)\r\n", "import sys\ninput = sys.stdin.readline\n\nn, d = map(int,input().split())\nsongs = list(map(int,input().split()))\n\nif sum(songs) + 10*(n-1) > d:\n print(-1)\nelse:\n print((d - sum(songs))//5)", "n, d = [int(x) for x in input().split()]\r\nsongs = [int(x) for x in input().split()]\r\ntime = 0\r\njoke = 0\r\ncompleted = False\r\nfor i in range(n):\r\n if songs[i]+time > d:\r\n print(-1)\r\n break\r\n time += songs[i]\r\n if time + 10 < d:\r\n joke += 2\r\n time += 10\r\n elif time + 10 > d and i == n-1:\r\n completed = True\r\n else:\r\n print(-1)\r\n break\r\n if i == n-1:\r\n completed = True\r\nif completed and time <= d:\r\n joke += (d - time) // 5\r\n print(joke)\r\n", "n,d=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nk=sum(l)+(10*((len(l))-1))\r\nif k<=d:\r\n d=d-sum(l)\r\n print(d//5)\r\nelse:\r\n print(\"-1\")", "n,d = list(map(int,input().split()))\r\nt = list(map(int,input().split()))\r\nsum = 0\r\nfor i in t:\r\n sum+=i\r\nif d < (sum + (n - 1) * 10):\r\n print(-1)\r\nelse:\r\n print((d-sum)//5)", "# -*- coding: utf-8 -*-\r\n# @Author: SyedAli\r\n# @Date: 2019-05-26 01:31:15\r\n# @Last Modified by: SyedAli\r\n# @Last Modified time: 2019-05-26 01:46:49\r\n\r\nn,d=map(int,input().split())\r\nd-=sum(map(int,input().split()))\r\nprint([d//5,-1][d+10<10*n])", "n,d=map(int,input().split())\r\ns=sum(list(map(int,input().split())))\r\nif d>=(n-1)*10+s:\r\n print((d-s)//5)\r\nelse:\r\n print(-1)\r\n", "n,d = input().split()\r\nn,d = int(n),int(d)\r\nl = [int(a) for a in input().split(\" \",n-1)]\r\na = 10*(len(l)-1)+sum(l)\r\nif a>d:\r\n print(-1)\r\nelse:\r\n print(2*(len(l)-1)+(d-a)//5)", "'''\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# 22\r\n\r\ndef main():\r\n\tn ,d = map(int,input().split())\r\n\ta = list(map(int,input().split()))\r\n\tadd = sum(a) + (n-1)*(10)\r\n\tif add<=d:\r\n\t\tjokes = (d - add) + (n-1)*10\r\n\t\tjokes= jokes//5\r\n\t\tprint(jokes)\r\n\telse:\r\n\t\tprint(-1)\r\n\r\nmain()\r\n\r\n\r\n\r\n\r\n", "n,d = list(map(int, input().split()))\nlst = list(map(int, input().split()))\nsongsWithJokes = sum(lst) + (n-1)*10\nif songsWithJokes > d:\n print('-1')\nelse:\n print(2*n -2 + ((d-songsWithJokes)//5))\n\n ", "x,y=map(int,input().split())\r\nz=list(map(int,input().split()))\r\nif(y<(sum(z)+(x-1)*10)):\r\n print(\"-1\")\r\nelse:\r\n print((y-sum(z))//5)\r\n ", "# 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, d = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nif (n-1)*10 + sum(arr) > d:\r\n print(-1)\r\nelse:\r\n jokes = (n-1)*2\r\n total_time = (n-1)*10 + sum(arr)\r\n d -= total_time\r\n jokes += d // 5\r\n print(jokes)\r\n", "n,d = list(map(int,input().split()))\r\nsong = list(map(int,input().split()))\r\nif sum(song)+(n-1)*10 > d:\r\n print(-1)\r\nelif sum(song)+(n-1)*10 == d:\r\n print((n-1)*2)\r\nelse:\r\n print((n-1)*2+((d-sum(song)-(n-1)*10)//5))", "if __name__ == '__main__':\r\n\tn, d = [int(i) for i in input().split()]\r\n\tsongList = [int(i) for i in input().split()]\r\n\tminRuntime = sum(songList) + 10 * (n - 1)\r\n\tif minRuntime > d: print(-1)\r\n\telse:\r\n\t\tprint(2 * (n -1) + (d - minRuntime) // 5)", "n, d = list(map(int, input().split()))\r\nts = list(map(int, input().split()))\r\nx = sum(ts) + (n-1)*10\r\nif d-x >= 0:\r\n ans = (d - x) // 5 + (n-1)*2\r\n print(ans)\r\nelse:\r\n print(-1)\r\n", "n,d=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ntmin=sum(l)+(n-1)*10\r\nif(tmin>d):\r\n print(-1)\r\nelse:\r\n print((d-tmin)//5+(n-1)*2)", "n,d=map(int,input().split())\r\na=list(map(int,input().split()))\r\ndif=n-1\r\nif((10*dif)+sum(a)>d):\r\n\tprint(-1)\r\nelse:\r\n\ts=sum(a)\r\n\td=d-s\r\n\tprint(d//5)", "a,b=map(int,input().split())\r\np=list(map(int,input().split()))\r\nmini=sum(p)\r\njokes=0\r\nfor i in range(a):\r\n if (i < a - 1):\r\n jokes += 2;\r\n mini += 10;\r\n else:\r\n jokes += (b - mini)// 5\r\n\r\nif (mini > b):\r\n print(-1)\r\nelse:\r\n print(jokes)\r\n", "from math import *\r\nfrom math import factorial as fact, comb as ncr \r\nfrom bisect import bisect_left as bl\r\nfrom bisect import bisect_right as br\r\nfrom array import array\r\nfrom collections import Counter as ctr\r\nfrom collections import deque as dq\r\n\r\nli=lambda : list(map(int,input().split()))\r\narr=lambda a: array('i',a)\r\nbi=lambda n: bin(n).replace(\"0b\", \"\")\r\n\r\ndef solve():\r\n #for _ in range(int(input())):\r\n n,d=li()\r\n t=li()\r\n if sum(t)+10*(n-1)<=d:\r\n print((n-1)*2+(d-sum(t)-10*(n-1))//5)\r\n else:\r\n print(-1)\r\nsolve()", "import math\r\n# from re import A\r\n# from multiprocessing.dummy import Array\r\n# from re import S\r\n# t,sx,sy,a,b=map(int,input().split())\r\n# t=True\r\n# for i in range(int(input())):\r\n # n=int(input())\r\nn,d=map(int,input().split())\r\narr=list(map(int,input().split()))\r\ns=sum(arr)\r\nif(d<(n-1)*10+s):\r\n print(-1)\r\nelse:\r\n print((d-s)//5)\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\nsum=0\r\nfor i in l1:\r\n sum=sum+i\r\nif sum+10*(n-1)>k:\r\n print(-1)\r\nelse:\r\n print((k-sum)//5)", "n,d=tuple(map(int,input().split()))\r\nsongs=list(map(int,input().split()))\r\ntotaltime=sum(songs)\r\nif totaltime+10*(len(songs)-1)<=d:\r\n print((d-totaltime)//5)\r\nelse:\r\n print(-1)\r\n", "\r\n\r\nn, d = list(map(int, input().split()))\r\n\r\narr = list(map(int, input().split()))\r\n\r\nsumarr = 0\r\n\r\nfor i in arr:\r\n sumarr += i\r\n\r\nif (sumarr + (n-1)*10) > d:\r\n print(-1)\r\n\r\nelse:\r\n print((d - sumarr) // 5)", "n, d=map(int, input().split())\r\nmas=list(map(int, input().split()))\r\nsumm=sum(mas)\r\nif summ+(n-1)*10>d:\r\n print(-1)\r\nelse:\r\n print((n-1)*2+(d-summ-(n-1)*10)//5)", "n,d=list(map(int,input().split()))\r\nt=list(map(int,input().split()))\r\n\r\n\r\nif sum(t)+(n-1)*10==d:\r\n print((n-1)*2)\r\n\r\nelif sum(t)+(n-1)*10<d:\r\n print(((d-(sum(t)+(n-1)*10))//5)+((n-1)*2))\r\n\r\nelse:\r\n print(-1)", "n, d = map(int, input().split())\r\nt = list(map(int, input().split()))\r\ns = sum(t)\r\nu = (d -s)//5\r\nif s +(n-1)*10 >d:\r\n print(-1)\r\nelse:\r\n print(u)\r\n", "n,d = map(int,input().split())\r\ntime = list(map(int,input().split()))\r\nsum_time = 0\r\nfor i in range(n):\r\n\tsum_time = sum_time + time[i]\r\n\r\nif(sum_time + 10 * (n-1)) <= d:\r\n\tprint((d - sum_time)//5)\r\nelse:\r\n\tprint(-1)\r\n ", "n,d=[int(w) for w in input().split()]\r\nx=[int(q) for q in input().split()]\r\nif sum(x)+(n-1)*10<=d:\r\n print(int((d-sum(x))/5))\r\nelse:\r\n print(-1)", "import math\r\ndef main():\r\n\t# t = int(input())\r\n\t# for _ in range(t):\r\n\tprint(case())\r\n\r\ndef case():\r\n\t\r\n\tn, d = list(map(int, input().split()))\r\n\tt = list(map(int, input().split()))\r\n\r\n\tif sum(t) + (n-1)*10 > d:\r\n\t\treturn -1\r\n\r\n\treturn (n-1) *2 + (d-(n-1)*10-sum(t))//5\r\n\r\nmain()", "x,y=map(int, input('').split())\r\nar=list(map(int, input('').split()))\r\n\r\nct= (len(ar)-1)*10 + sum(ar)\r\nif(ct>y):\r\n print(-1)\r\nelse:\r\n a=int(((len(ar)-1)*10)/5)\r\n b=int((y-ct)/5)\r\n print(a+b)\r\n", "n, d = map(int, input().split())\nt = [int(x) for x in input().split()]\ntt = sum(t)\nif tt+((n-1)*10) > d:\n print(-1)\n exit()\nelse:\n print((d-tt)//5)\n", "n, d = map(int,input().split())\r\nL = list(map(int,input().split()))\r\nsum = 0\r\nfor i in range(n):\r\n sum += L[i]\r\nif sum + (n-1) * 10 > d:\r\n print(-1)\r\nelse:\r\n print((d - sum) // 5)", "n, d = map(int, input().split())\r\nsongs = list(map(int, input().split()))\r\n\r\ntotal_songs_time = sum(songs)\r\ntotal_jokes_time = (n - 1) * 10\r\n\r\nif total_songs_time + total_jokes_time > d:\r\n print(-1)\r\nelse:\r\n remaining_time = d - total_songs_time\r\n jokes = remaining_time // 5\r\n print(jokes)\r\n", "n, d = map(int, input().split())\r\na = list(map(int, input().split()))\r\nt = d - (sum(a) + (n - 1) * 10)\r\nprint(-1) if t < 0 else print(2 * (n - 1) + t // 5)", "n, d = map(int, input().split())\r\nl = list(map(int,input().split()))\r\n\r\nif d < (n-1) * 10 + sum(l):\r\n print('-1')\r\n\r\nelif d == (n-1)*10 + sum(l):\r\n print((n-1)*2)\r\n\r\nelse:\r\n print((n-1)*2+(d-sum(l)-(n-1)*10)//5)\r\n", "n,d=[int(x) for x in input().split()]\r\nl=[int(x) for x in input().split()]\r\nsuml=sum(l)\r\nif d<suml+10*(n-1):\r\n print(-1)\r\nelse:\r\n count=2*(n-1)\r\n d-=suml+10*(n-1)\r\n if d==0:\r\n print(count)\r\n else:\r\n print(count+d//5)\r\n\r\n ", "n,d=map(int,input().split())\r\nlis=list(map(int,input().split()))\r\nmintr=sum(lis)+(n-1)*10\r\nif d<mintr:\r\n print(-1)\r\nelse:\r\n jokes=2*(n-1)\r\n jokes+=(d-mintr)//5\r\n print(jokes)", "n, d = [int(x) for x in input().split(' ')]\r\nt = [int(x) for x in input().split(' ')]\r\nduration = 0\r\ngaps = 0\r\ni = 0\r\nwhile i < n and t[i] + 10 * int(i > 0) + duration <= d:\r\n duration += t[i] + 10 * int(i > 0)\r\n gaps += 10 * int(i > 0)\r\n i += 1\r\ngaps += d - duration\r\n\r\nif i == n:\r\n ans = gaps // 5\r\nelse:\r\n ans = - 1\r\nprint(ans)", "n, duration = map(int, input().split())\r\n\r\nsongs = list(map(int, input().split()))\r\n\r\ntime = sum(songs)\r\nin_between = (n - 1) * 10\r\n\r\n\r\nif (time + in_between) > duration:\r\n print(-1)\r\n\r\nelse:\r\n available = duration - (time + in_between)\r\n jokes = (available // 5) + (n - 1) * 2\r\n print(jokes) ", "n,d=map(int,input().split())\r\na=list(map(int,input().split()))\r\ntime=0\r\nchuru_joke=0\r\n\r\nif sum(a)+((n-1)*10)>d:\r\n print(\"-1\")\r\n \r\n \r\nelse:\r\n for song_duration in sorted(a):\r\n time+=song_duration\r\n if time+10<=d:\r\n churu_joke+=2\r\n time+=10\r\n elif time+5<=d:\r\n churu_joke+=1\r\n time+=5\r\n # print(\"time,churu\",time,churu_joke)\r\n \r\n churu_joke+=(d-time)//5\r\n \r\n print(churu_joke)", "n,d = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nif d < sum(l) + (n-1)*10:\r\n print(-1)\r\nelse:\r\n print((n-1)*2 + int((d - sum(l) - (n-1)*10)/5))", "n,total=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nt=sum(l)\r\nif(t+(n-1)*10>total):\r\n print(-1)\r\nelse:\r\n print((total-t)//5)\r\n \r\n", "n, d = map(int, input().split())\nl = list(map(int, input().split()))\nd = d - sum(l)\nprint(-1 if d < (n-1)*10 else int(d/5))", "n,d=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=sum(l)\r\nif (n-1)*10+s<=d:\r\n res=(d-s)//5\r\n print(res)\r\nelse:\r\n print(-1)", "n, d = [int(x) for x in input().split()]\r\nsong = [int(x) for x in input().split()]\r\nj=0\r\nfor s in song:\r\n d -= s+10\r\n j+=2\r\nd+=10\r\nj-=2\r\nif d<0: print(-1)\r\nelse: print(j+d//5)\r\n", "n, d = map(int, input().split())\r\nt = list(map(int, input().split()))\r\nif d-10*(n-1)-sum(t)<0:\r\n\tprint(-1)\r\nelse:\r\n\tprint((d-sum(t))//5)", "n,d = map(int,input().split())\r\na = list(map(int,input().split()))\r\nsm = sum(a)\r\ncal = (d-sm) // 5\r\nfact = (n-1)*2\r\nif cal >= fact:\r\n print(cal)\r\nelse:\r\n print(-1)", "n, d = map(int, input().split())\r\nt = [int(i) for i in input().split()]\r\ns = sum(t) + (n - 1) * 10\r\nif s > d:\r\n print(-1)\r\nelse:\r\n k = (n - 1) * 2\r\n while s + 5 <= d:\r\n k += 1\r\n s += 5\r\n print(k)", "n,d=map(int,input().split())\r\narr=[int(i) for i in input().split()]\r\nif d>=sum(arr)+10*(n-1):\r\n print((d-(sum(arr)+10*(n-1)) +10*(n-1))//5)\r\nelse:\r\n print(-1)\r\n", "\r\nn,d = map(int,input().split())\r\nls = list(map(int,input().split()))\r\nans =[]\r\nc=0\r\nfor i in range(n):\r\n ans.append(ls[i])\r\n ans.append(10)\r\n c+=2\r\ndel ans[len(ans)-1]\r\nc-=2\r\n\r\ns = sum(ans)\r\nif s > d :\r\n print(-1)\r\nelse:\r\n print(c+((d-s)//5))", "\r\n\r\nn, d = map(int, input().split())\r\nts = [int(s) for s in input().split()]\r\n\r\nif sum(ts) + 10 * (n - 1) > d:\r\n print(-1)\r\nelse:\r\n b = (d - sum(ts)) // 5\r\n print(b)\r\n", "a=list(map(int, input(). strip(). split()))\r\nsongs = a[0]\r\nt_time = a[1]\r\ntime = list(map(int, input(). strip(). split()))\r\ntreq = sum(time) + 10*(songs-1)\r\nif treq <= t_time:\r\n print(int((t_time - treq)//5 + 2*(songs-1)))\r\nelse :\r\n print(-1)\r\n", "\r\ndef answer(n, d, t_ary):\r\n sum = 0\r\n num_jokes = 0\r\n for e in t_ary:\r\n sum += (e + 10)\r\n num_jokes += 2\r\n num_jokes -= 2 #because the last song does not require rest.\r\n sum -= 10 # because the last song does not require rest.\r\n if sum > d:\r\n return -1\r\n time_rem = d-sum\r\n jokes_rem = time_rem // 5\r\n num_jokes += jokes_rem\r\n \r\n return num_jokes\r\n\r\ndef main():\r\n n, d = [int(i) for i in input().split()]\r\n t_ary = [int(i) for i in input().split()]\r\n \r\n print(answer(n, d, t_ary))\r\n\r\n\r\nmain()", "\r\n\r\n\r\nn,d = map(int,input().split())\r\n\r\nt= list(map(int,input().split()))\r\n\r\n\r\n\r\nu=sum(t)\r\n\r\nif d>= u+(n-1)*10:\r\n rest = d-sum(t)\r\n print(rest//5)\r\nelse:\r\n print(-1)\r\n", "n, d = map(int, input().split())\r\n\r\nlst = list(map(int, input().split()))\r\n\r\nif d-sum(lst) >= (n-1)*10:\r\n d-=sum(lst)\r\n print(d//5)\r\n\r\nelse:\r\n print(-1)", "n,d=map(int,input().split())\r\nt=list(map(int,input().split()))\r\ns=sum(t)\r\ns+=10*(n-1)\r\nif(s>d):\r\n print(-1)\r\nelse:\r\n j=(n-1)*2\r\n j1=(d-s)//5\r\n j+=j1\r\n print(j)", "n, concert_time = input().split()\r\nn = int(n)\r\nconcert_time = int(concert_time)\r\nsongs_time = input().split()\r\nnum_of_jokes = 0\r\nfor song in range(n - 1):\r\n concert_time -= (int(songs_time[song]) + 10)\r\n num_of_jokes += 2\r\nif concert_time - int(songs_time[-1]) >= 0:\r\n concert_time -= int(songs_time[-1])\r\n print(num_of_jokes + concert_time // 5)\r\nelse:\r\n print(-1)\r\n", "n, d = map(int, input().split())\r\nl = list(map(int,input().split()))\r\n\r\nif (d < (n-1)*10 or ((n-1)*10 + sum(l) ) > d) :\r\n print(-1)\r\nelse : \r\n print((d-sum(l))//5)", "nd=list(map(int,input().split()))\r\nn=nd[0]\r\nd=nd[1]\r\nt=list(map(int,input().split()))\r\ns=0\r\nfor i in range(n):\r\n s+=t[i]\r\nif (n-1)*10+s>d:\r\n print(-1)\r\nelse:\r\n print((d-s)//5)", "n,d=map(int,input().split())\r\ns=list(map(int,input().split()))\r\nsumt=sum(s)+10*(len(s)-1)\r\nif sumt>d:\r\n sol=-1\r\nelse:\r\n sol=(d-sum(s))//5\r\nprint(sol)\r\n \r\n", "N, D = map(int, input().split())\nS = sum(map(int, input().split()))\nif S + (N-1)*10 > D : print(-1)\nelse : print((D-S)//5)\n", "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, d = inp()\r\nt = arr_inp()\r\ndevu = sum(t) + (n - 1) * 10\r\nif devu > d:\r\n print(-1)\r\nelse:\r\n ans = (d - sum(t)) // 5\r\n print(ans)\r\n", "n, d = map(int, input().split())\r\nlists = list(map(int, input().split()))\r\nreq = ((n - 1) * 10) + sum(lists)\r\nprint([(d - req) // 5 + (((n - 1) * 10) // 5), -1][req > d])\r\n", "n,d = map(int,input().split())\r\na = list(map(int,input().split()))\r\n\r\nch = 1\r\n\r\nsn = sum(a)\r\nrst = (n-1)*10\r\n\r\nmx = 0\r\n\r\nif(sn+rst>d):\r\n ch = 0\r\nelse:\r\n x = d - (sn)\r\n mx = x//5\r\n \r\nif(ch == 0):\r\n print(-1)\r\nelse:\r\n print(mx)", "n, d = list(map(int, input().split(\" \")))\r\ns = list(map(int, input().split(\" \")))\r\nif ((n-1) * 10) + sum(s)> d:\r\n print(-1)\r\nelse:\r\n print(2*(n-1) + ((d - (((n-1)*10)+sum(s))) // 5))\r\n", "n, d = map(int, input().split())\r\narr = [int(i) for i in input().split()]\r\ns = sum(arr)\r\nminimum = s + ((n - 1) * 10)\r\n\r\nif minimum > d:\r\n print(-1)\r\nelse:\r\n ans = (n - 1) * 2\r\n ans += (d - minimum) // 5\r\n print(ans)", "n,d=map(int,input().split())\r\nt=list(map(int,input().split()))\r\nmint=sum(t)+(10*(n-1))\r\njokes=2*(n-1)\r\nif mint<=d:\r\n\tprint(jokes+(d-mint)//5)\r\nelse:\r\n\tprint(-1)", "n, d = map(int, input().split())\r\nt = list(map(int, input().split()))\r\n\r\nif len(t)>1 and ( sum(t)+( (n-1)*10 ) ) > d:\r\n print(-1)\r\nelse:\r\n print((d - sum(t))//5)", "n,d=list(map(int,input().split()))\r\ns=list(map(int,input().split()))\r\nm=10*(n-1)\r\no=m//5\r\nr=0\r\nfor i in s:\r\n r=r+i\r\nif r+m<=d:\r\n v=(d-(r+m))//5\r\n print(v+o)\r\nelse:\r\n print(-1)", "\r\nn,d = list(map(int,input().split()))\r\nl = list(map(int,input().split()))\r\nc = 0\r\ns = 0\r\nfor i in l:\r\n if s + i <= d:\r\n s+=i+10\r\n c+=2\r\n else:\r\n print(-1)\r\n break\r\nelse:\r\n s-=10\r\n c-=2\r\n d = (d - s)//5\r\n print(c+d)\r\n \r\n", "\r\nx=map(int,input().split())\r\nn,d=x\r\ny=list(map(int,input().split()))\r\nc=0\r\nfor i in range(len(y)-1):\r\n d=d-(y[i]+10)\r\n c+=2\r\nif d<y[-1]:\r\n print(-1)\r\nelse:\r\n d=d-y[-1]\r\n c+=d//5\r\n print(c)\r\n", "from collections import defaultdict\r\nfrom operator import inv\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inps():\r\n return(input())\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\nn, d = invr()\r\nsongs = inlt()\r\n\r\nsongsTotal = sum(songs)\r\nbreaks = n-1\r\nbreakTime = breaks * 10\r\ntotalTimeRequired = breakTime + songsTotal\r\n\r\nif totalTimeRequired > d:\r\n print(-1)\r\nelse:\r\n jokes = breaks * 2\r\n remainingTime = d - totalTimeRequired\r\n remainingJokes = remainingTime // 5\r\n print(jokes + remainingJokes)\r\n", "n,d = map(int,input().split())\r\n\r\narr = [int(x) for x in input().split()]\r\nbreak_tiem = (n-1)*10\r\ntotal_time = sum(arr) + break_tiem\r\n\r\nif total_time > d:\r\n\tprint(-1)\r\nelse:\r\n\tprint((d - sum(arr))//5)", "n , d = map(int , input().split())\r\nsongs = list(map(int , input().split()))\r\nif (d - sum(songs))%5 >= 0 and (d - sum(songs) >= (n -1)*10):\r\n\tprint((d - sum(songs))//5)\r\nelse:\r\n\tprint(-1)", "import math\r\n\r\n\r\ndef solve():\r\n n, d = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n if sum(a) + (n - 1) * 10 > d:\r\n return -1\r\n\r\n return (d - sum(a)) // 5\r\n\r\n\r\nif __name__ == '__main__':\r\n print(solve())\r\n", "n,d=map(int,input().split(' '))\r\nt=list(map(int,input().split(' ')))\r\nj=sum(t)+(n-1)*10\r\nif(j>d):\r\n print(-1)\r\nelse:\r\n c = (n-1)*2 + (d-j)//5\r\n print(c)\r\n \r\n", "n,d=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nif (n-1)*10 +sum(l)>d:\r\n print(-1)\r\nelse:\r\n print((d-sum(l))//5)", "n, d = map(int, input().split())\nsong_durations = list(map(int, input().split()))\n\nbreak_time_after_joke = 10\njoke_duration = 5\n\nnum_jokes = 0\nfinished_all_songs = False\nnum_time_remaining = 0\nfor i in range(n):\n song_duration = song_durations[i]\n d -= song_duration\n\n if i == n - 1:\n if d >= 0:\n finished_all_songs = True\n num_jokes += d // joke_duration\n break\n\n if d >= break_time_after_joke:\n d -= break_time_after_joke\n num_jokes += break_time_after_joke // joke_duration\n else:\n if d >= 0:\n num_jokes += d // joke_duration\n break\n\n\no = num_jokes if finished_all_songs else -1\nprint(o)\n", "n, d = map(int, input().split())\r\na = list(map(int, input().split()))\r\nleast_time = (n-1)*10+sum(a)\r\n\r\nif least_time > d:\r\n print (-1)\r\nelse:\r\n jokes = (n-1)*2\r\n jokes += (d-least_time)//5\r\n print (jokes)\r\n", "n,d=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nk=(n-1)*10+sum(l)\r\nif(k>d):\r\n print(-1)\r\nelse:\r\n print((n-1)*2+(d-k)//5)", "n, d = tuple(map(int, input().split()))\narr = list(map(int, input().split()))\n\nresult = 0\ns = sum(arr)\n\nif s + (n-1)*10 > d:\n print(-1)\nelse:\n print((d-s)//5)\n# for ind, el in enumerate(arr):\n\n\n", "def singer_and_joker(nn,mm,tt):\r\n s = sum(tt)+(nn-1)*10\r\n if s <= mm:\r\n return (mm-s)//5+((nn-1)*2)\r\n else:\r\n return -1\r\n\r\n\r\nif __name__ == '__main__':\r\n f = lambda: map(int, input().split())\r\n n, m = f()\r\n t = list(f())\r\n print(singer_and_joker(n, m, t))\r\n ", "n, d = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\nif (sum(arr) + (n-1)*10) > d:\r\n print(-1)\r\nelse:\r\n ans = (d - sum(arr))//5\r\n print(ans)\r\n", "n,d = map(int,input().split())\r\nt = list(map(int,input().split()))\r\npas = 0\r\npas += (n-1)*10//5\r\nd -= ((n-1)*10+sum(t))\r\nif d<0:\r\n print(-1)\r\nelse:\r\n print(pas + d//5) ", "n, d = map(int, input().split())\r\nd -= sum(map(int, input().split()))\r\nif d < (n - 1) * 10:\r\n print(-1)\r\nelse:\r\n print(d // 5)", "x=[int(item) for item in input().split()]\r\ny=[int(item) for item in input().split()]\r\na=x[0]\r\nif (a-1)*10+sum(y)>x[1]:\r\n result=-1\r\nelse:\r\n result=int((x[1]-(a-1)*10-sum(y))/5)+(a-1)*2\r\nprint(result)\r\n ", "from collections import *\r\ndef listmap(): return list(map(int,input().split(\" \")))\r\ndef intp(): return int(input())\r\n\r\n\r\ndef solve(n, d, nums):\r\n if sum(nums) + (n-1)*10 > d:\r\n return -1\r\n \r\n return (d - sum(nums)) // 5\r\n\r\nn, d = listmap()\r\nnums = listmap()\r\nprint(solve(n, d, nums))", "n,d = list(map(int, input().split(' ')))\r\nsongs = list(map(int, input().split(' ')))\r\n#o/p = maximum number of jokes churu can crack\r\ntimeReqd = 0\r\ncount = 0\r\nfor song, time in enumerate(songs):\r\n timeReqd += time + 10\r\n count+=2\r\n# print(time, count)\r\ntimeReqd -= 10\r\ncount -=2\r\nif timeReqd>d:\r\n print(-1)\r\nelse:\r\n count += (d - timeReqd)//5\r\n print(count)", "n,d=map(int,input().split(\" \"))\r\narr=list(map(int,input().split(\" \")))\r\nsong_gap=n-1\r\nif sum(arr)+10*song_gap>d:\r\n print(\"-1\")\r\nelse:\r\n jokes=(d-sum(arr))//5\r\n print(jokes)", "n,d=map(int,input().split())\r\nl=sum(list(map(int,input().split())))\r\nif d<l+(n-1)*10:print(-1)\r\nelse:print((d-l)//5)", "line = input()\r\nline = line.split()\r\nn = int(line[0])\r\nd = int(line[1])\r\nline = input()\r\nline = line.split()\r\ntot = 10 * (n - 1)\r\nfor i in range(0,n):\r\n tot = tot + int(line[i])\r\nif tot > d:\r\n print(-1)\r\nelse:\r\n xtra = d - tot\r\n jokes = xtra // 5\r\n jokes = jokes + ((n - 1) * 2)\r\n print(jokes)\r\n \r\n \r\n", "from math import*\r\nn,d=map(int,input().split())\r\nt=list(map(int,input().split()))\r\ns=0\r\nfor i in t:\r\n s+=(i+10)\r\nif (s-10)>d:\r\n print(\"-1\")\r\nelse:\r\n r=d-sum(t)\r\n if r%5==0:\r\n print(r//5)\r\n else:\r\n print(ceil(r/5)-1)\r\n \r\n", "n = [int(x) for x in input().split()]\r\ndu = [int(x) for x in input().split()]\r\nct = n[1] - sum(du)\r\ned = sum(du)\r\nfor i in range(len(du)-1):\r\n ed += 10\r\nif ed <= n[1]:\r\n print(ct//5)\r\nelse:\r\n print(-1)\r\n\r\n", "inp = input().split()\r\nn = int(inp[0])\r\nd = int(inp[1])\r\nt = list(map(int,input().split()))\r\nsum = sum(t)\r\n\r\nif (n-1)*10 + sum > d:\r\n print('-1')\r\nelse:\r\n ans = (d - sum)//5\r\n print(ans)\r\n", "n, d = map(int, input().split())\r\nt = list(map(int, input().split()))\r\ntime = sum(t) + 10 * (len(t) - 1)\r\nif d < time:\r\n print(-1)\r\nelse:\r\n print(2 * (len(t) - 1) + (d - time) // 5)", "import math\r\nnd = input().split(' ')\r\nn = int(nd[0])\r\nd = int(nd[1])\r\n\r\nsongs = list(map(int,input().split(' ')))\r\n\r\ntotal_songs = len(songs)\r\n\r\nrest_time = (total_songs - 1) * 10\r\n\r\nif rest_time >= d:\r\n print(-1)\r\nelse:\r\n song_time = 0\r\n for i in songs:\r\n song_time += i\r\n time_left = d - (song_time + rest_time)\r\n # print(time_left)\r\n if time_left < 0:\r\n print(-1)\r\n else:\r\n joke_number = rest_time//5\r\n # print(time_left)\r\n joke_number += math.floor(time_left/5)\r\n print(joke_number)", "n,d=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nm=(n-1)*10+sum(l)\r\nif m==d:\r\n print((n-1)*2)\r\nelif m<d:\r\n d=d-m\r\n print((n-1)*2+d//5)\r\nelse:\r\n print(-1)", "n,d = list(map(int,input().split()))\r\nt = list(map(int,input().split()))\r\nx = -1 \r\nif ((n-1)*10+sum(t)<=d):\r\n x = ((d-sum(t)))//5\r\n\r\nprint(x)\r\n\r\n", "n, d = map(int, input().split())\r\nlst = [int(i) for i in input().split()]\r\ns = sum(lst)\r\nif s + (n - 1) * 10 > d:\r\n print(-1)\r\nelse:\r\n print((d - (s + (n - 1) * 10 ))// 5 + (n - 1) * 2)", "n,total=map(int,input().split())\r\nlst=list(map(int,input().split()))\r\ntime_need=sum(lst)+(n*10)-10\r\nif time_need>total:\r\n print(-1)\r\nelse:\r\n print((total-sum(lst))//5)", "a,b=map(int,input().split())\r\nc=list(map(int,input().split()))\r\nif sum(c)+(len(c)-1)*10 > b:\r\n\tprint( -1)\r\nelse :\r\n\tprint((b-sum(c))//5)", "event = input().split()\r\nsongs = input().split()\r\nminutesOfSongs = [int(x) for x in songs]\r\neventDuration = int(event[1])\r\nnumberOfSongs = int(event[0])\r\nif (numberOfSongs -1)*10 + sum(minutesOfSongs) > eventDuration:\r\n print('-1')\r\n exit()\r\njokes = int((eventDuration - sum(minutesOfSongs)) / 5)\r\nprint(jokes)", "no_of_events, duration = map(int, input().split())\r\neach_duration = list(map(int, input().split()))\r\ntotal = sum(each_duration) + (no_of_events - 1) * 10\r\nif total <= duration:\r\n print((duration - sum(each_duration)) // 5)\r\nelse:\r\n print(-1)", "n, d = map(int, input().split())\r\nsp = list(map(int, input().split()))\r\nk = 0\r\ni = 0\r\nf = True\r\nwhile f and i < len(sp):\r\n if d - (sp[i] + 10) > 0:\r\n d -= sp[i] + 10\r\n k += 2\r\n i += 1\r\n else:\r\n f = False\r\n\r\n\r\nif i == len(sp):\r\n k += d // 5\r\n print(k)\r\nelif i == len(sp) - 1:\r\n d -= sp[i]\r\n if d >= 0:\r\n print(k + d // 5)\r\n if d < 0:\r\n print(-1)\r\nelse:\r\n print(-1)\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,d = get_ints()\r\nar = get_list()\r\nx = sum(ar)+10*(n-1)\r\nif x>d:\r\n print(-1)\r\nelse:\r\n print((n-1)*2+(d-x)//5)", "n, d = map(int, input().split())\r\nsongs = list(map(int, input().split()))\r\ntime = 0\r\nanecdots = 0\r\nfor index in range(n):\r\n song = songs[index]\r\n time +=song\r\n if(index != (n - 1)):\r\n time +=10\r\n anecdots +=2\r\nif((d - time) > 0):\r\n print(anecdots+(d - time)//5)\r\nelif(d==time):\r\n print(anecdots)\r\nelse:\r\n print(-1)\r\n\r\n\r\n\r\n", "import sys\r\n\r\nnum_subject, time_constraint = list(map(int, sys.stdin.readline().split()))\r\n\r\nsubject_time_list = list(map(int, sys.stdin.readline().split()))\r\n\r\nmin_time = sum(subject_time_list) + (num_subject-1)*10\r\n\r\nif min_time > time_constraint:\r\n print(-1)\r\nelse:\r\n print((time_constraint - min_time)//5 + (num_subject-1)*2)", "def solve(n: int, d: int, lst: list) -> int:\r\n ans = 0\r\n counter = 0\r\n for i in lst:\r\n ans += i\r\n counter += 2\r\n if ans > d:\r\n return (-1)\r\n break\r\n ans += 10\r\n else:\r\n return (counter + (d - ans)//5)\r\n\r\nn, d = map(int, input().split())\r\nlst = [int(i) for i in input().split()]\r\nprint(solve(n, d, lst))", "n,d = map(int,input().split())\r\nlis = list(map(int,input().split()))\r\na = sum(lis)\r\nb = a+((len(lis)-1)*10)\r\nif b > d:\r\n print(-1)\r\nelse:\r\n print((d-a)//5)", "n,d=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=sum(l)\r\nif((s+(n-1)*10)>d):\r\n print(-1)\r\nelse:\r\n m=(n-1)*2\r\n k=d-(s+(n-1)*10)\r\n print(m+(k//5))", "n,k = [int(i) for i in input().split()]\r\nar = [int(i) for i in input().split()]\r\n\r\nif sum(ar) + (n-1)*10 <=k:\r\n print((k-sum(ar))//5)\r\nelse:\r\n print(-1)", "import math\r\n\r\n\r\ndef main_function():\r\n n, d = [int(i) for i in input().split(\" \")]\r\n s = [int(i) for i in input().split(\" \")]\r\n actual_duration = 0\r\n joke_counter = 0\r\n for i in range(len(s)):\r\n if not i == len(s) - 1:\r\n actual_duration += s[i] + 10\r\n joke_counter += 2\r\n else:\r\n actual_duration += s[i]\r\n if actual_duration > d:\r\n return -1\r\n else:\r\n return joke_counter + (d - actual_duration) // 5\r\n\r\n\r\n\r\n\r\n\r\nprint(main_function())\r\n\r\n\r\n\r\n", "import math\r\nn, d = map(int, input().split())\r\nsongs = list(map(int, input().split()))\r\nif sum(songs)+(10*(len(songs)-1))>d:print(-1)\r\nelse:print((len(songs)-1)*2+(d-(sum(songs) + 10*(len(songs)-1)))//5)", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nif(sum(l)+(n-1)*10)<=k:\r\n print((k-sum(l))//5)\r\nelse:\r\n print(-1)", "def fun(n,d,li):\r\n s=sum(li)\r\n sn=10*(n-1)\r\n if s+sn<=d:\r\n ans=(n-1)*2\r\n t=(d-s-sn)//5\r\n print(ans+t)\r\n return \r\n else:\r\n print(-1)\r\n return \r\n \r\nn,d=list(map(lambda x:int(x),input().split()))\r\nli=list(map(lambda x:int(x),input().split()))\r\nfun(n,d,li)\r\n", "n,d=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nrest_time=(n-1)*10\r\nif rest_time+sum(l)>d:\r\n print(-1)\r\nelse:\r\n c=(d-sum(l))//5\r\n print(c)", "n,d=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=sum(l)\r\nres=(n-1)*10+s\r\nif res>d:\r\n\tprint(-1)\r\nelse:\r\n\tif((d-res)>=5):\r\n\t\tr=5\r\n\t\tc=1\r\n\telse:\r\n\t\tr=0\r\n\t\tc=0\r\n\tfor i in l[:-1]:\r\n\t\tr+=i\r\n\t\tr+=10\r\n\t\tc+=2\r\n\tr+=l[-1]\r\n\tleft=d-r\r\n\tprint(c+left//5)\r\n\t\t\r\n\t\r\n\t", "def show(n, d, t):\r\n total_time_to_complete_songs = sum(t) + (n - 1) * 10\r\n if total_time_to_complete_songs > d:\r\n return(-1)\r\n else: \r\n time_for_extra_jokes = d - total_time_to_complete_songs\r\n number_of_extra_jokes = int(time_for_extra_jokes/5)\r\n return(number_of_extra_jokes + 2 * (n - 1))\r\n\r\nn, d = list(map(int, input().split()))\r\nt = list(map(int, input().split()))\r\nprint(show(n, d, t))\r\n\r\n", "n, d = input().split()\nn = int (n)\nd = int (d)\n#n = int(input())\nh = list(map(int, input().split()))\n#g = list(map(int, input().split()))\n#x1, y1, x2, y2 =map(int,input().split())\n#n = int(input())\n\nif (sum(h)+ 10*(n-1) > d):\n print(-1)\nelse:\n print(2*(n-1)+(d-sum(h)-10*(n-1))//5)\n\n", "n, t = map(int, input().split())\r\nx = (t - sum(map(int, input().split()))) // 5\r\nprint(-1 if n * 2 - 2 > x else x)", "\r\nif __name__ == '__main__':\r\n n, d = map(int, input().split())\r\n t_list = list(map(int, input().split()))\r\n ost = d - ((n-1) * 10 + sum(t_list))\r\n if ost >= 0:\r\n print(ost // 5 + (n - 1) * 2)\r\n else:\r\n print(\"-1\")\r\n\r\n", "def solve(l,d):\n singduration = sum(l)\n singduration += (len(l)-1)*10\n if singduration > d:\n return -1\n return (d-singduration)//5 + (len(l)-1)*2\n\nn,d=map(int, input().split(\" \"))\nl = list(map(int, input().split(\" \")))\nprint (solve(l,d))", "songs, time = map(int, input().split())\r\nl = list(map(int, input().split()))\r\njokes = 0\r\nstime = sum(l) + 10 * (songs - 1)\r\nif stime <= time:\r\n jokes += 2 * (songs - 1) + (time - stime) // 5\r\n print(jokes)\r\nelse:\r\n print(-1)\r\n", "[X, Y] = list(map(int, input().split()))\r\nN = list(map(int, input().split()))\r\nl = sum(N)\r\nif Y < (l+(X-1)*10):\r\n print(-1)\r\nelse:\r\n print((Y-l)//5)", "n,d = map(int, input().split())\r\nt = list(map(int, input().split()))\r\ntotal = (n-1)*10 + sum(t)\r\nif total>d:\r\n print(-1)\r\nelse:\r\n print((n-1)*2 + (d-total)//5)\r\n", "import math as m\r\n#from math import comb as nCr\r\nt=input\r\n'''\r\nfor _ in range(int(t())):\r\n n=int(t())\r\n a,b=map(int,t().split())\r\n a=list(map(int,t().split()))\r\n'''\r\nn,d=map(int,t().split())\r\na=list(map(int,t().split()))\r\nif 10*(n-1)+sum(a[:-1])>=d: print('-1')\r\nelse: \r\n s=10*(n-1)+sum(a)\r\n if s==d: print(2*(n-1))\r\n elif s<d: \r\n print(2*(n-1)+(d-s)//5)\r\n else: print('-1')", "n, d = map(int ,input().split())\r\na = list(map(int, input().split()))\r\nif sum(a)+(n-1)*10>d:\r\n print(-1)\r\nelse:\r\n print((d-sum(a))//5)\r\n", "a,b=map(int,input().split())\r\nc=list(map(int,input().split()))\r\nd=(sum(c)+10*(a-1))\r\nif(d<=b):\r\n print((b-d)//5+(a-1)*2)\r\nelse:\r\n print(-1)\r\n\r\n# CodeBy: RAHUL MAHAJAN\r\n# A2OJ: rahulmahajan\r\n# CC: anonymous0201\r\n# CF: rahulmahajan\r\n# CSES: rahulmahajan", "\r\n\r\ndef main():\r\n n, d = map(int, input().split())\r\n t = list(map(int, input().split()))\r\n total = (n - 1)* 10 + sum(t)\r\n if total > d:\r\n print(\"-1\")\r\n return\r\n\r\n ans = (n - 1) * 2 + (d - total)//5\r\n print(ans)\r\n\r\n\r\n\r\nmain()", "n, d = (int(i) for i in input().split())\nt = (int(i) for i in input().split())\nres = 2 * (n - 1)\nd -= sum(t) + 5 * res\nres = -1 if d < 0 else res + d // 5\nprint(res)\n", "n, d = map(int, input().split())\r\nj = (n - 1) * 2\r\nt = (n - 1) * 10\r\nt += sum(list(map(int, input().split())))\r\nif t > d:\r\n print(\"-1\")\r\nelse:\r\n print(j + (d - t) // 5)", "temp = [int(x) for x in input().split()]\r\nn = temp[0]\r\nd = temp[1]\r\nt = [int(x) for x in input().split()]\r\nif sum(t)+(n-1)*10 > d:\r\n print(-1)\r\nelse:\r\n print((n-1)*2+(d-((n-1)*10+sum(t)))//5)\r\n", "if __name__ == '__main__':\r\n\ta = input().split()\r\n\tjokeNum = int(a[0])\r\n\tduration = int(a[1])\r\n\tstrList = input().split()\r\n\tjokeList = [int(x) for x in strList]\r\n\tif sum(jokeList) + (jokeNum - 1) * 10 > duration:\r\n\t\tprint(-1)\r\n\telse:\r\n\t\tprint(int((duration - sum(jokeList)) / 5))", "import sys\r\ninput=sys.stdin.buffer.readline\r\n\r\nn,d=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nif sum(arr)+10*(n-1)>d:\r\n\tprint(\"-1\")\r\nelse:\r\n\tprint((d-sum(arr))//5)\r\n\r\n\t\t\t#unknown_2433\r\n", "# import sys\r\n# sys.stdin = open(\"#input.txt\", \"r\")\r\n\r\ndef solve(ls,n,d):\r\n\ttot = (n-1)*10 + sum(ls)\r\n\tif tot > d: return -1\r\n\treturn (n-1)*2 + (d-tot) // 5\r\n\r\nn,d = list(map(int, input().split()))\r\nls = list(map(int, input().split()))\r\nprint(solve(ls,n,d))", "n,d=map(int,input().split())\r\na=list(map(int,input().split()))\r\nif (len(a)-1)*10+sum(a)>d:\r\n print(-1)\r\nelse:\r\n d-=sum(a)\r\n print(d//5)", "n,d=[int(x) for x in input().split()]\r\nsg=[int(x) for x in input().split()]\r\nif (sum(sg)+10*(n-1))>d:\r\n print(\"-1\")\r\nelse:\r\n print((d-sum(sg))//5)", "import sys\r\n\r\n### Get Input.\r\ninp = input()\r\nn, d = inp.split(\" \")\r\nn, d = int(n), int(d)\r\n\r\ninp = input()\r\nt = [int(i) for i in inp.split(\" \")]\r\n\r\n\r\n### Calculate minimum time.\r\ntime = sum(t) + 10 * (n - 1)\r\n\r\n### Check if valid.\r\nif time > d:\r\n print(-1)\r\n sys.exit()\r\n\r\n### Add and count jokes.\r\njokes = (n - 1) * 2\r\njokes += int((d - time) / 5)\r\n\r\n### Print solution.\r\nprint(jokes)\r\n", "songnum, sumtime = map(int, input().split())\r\ntimelist = [int(h) for h in input().split()]\r\nif sumtime < sum(timelist)+(songnum-1)*10:\r\n print(-1)\r\nelse:\r\n print((sumtime-sum(timelist))//5)", "n,d = [int(x) for x in input().split()]\r\nt = [int(x) for x in input().split()]\r\nst = (n-1)*10+sum(t)\r\nif st > d:\r\n print('-1')\r\nelse:\r\n print((n-1)*2 + (d-st)//5)\r\n", "n,d = tuple(map(int,input().split()))\r\nsongs = tuple(map(int,input().split()))\r\nneeded = sum(songs) + (n-1)*10\r\nif (needed <= d):\r\n print((n-1)*2 + (d-needed)//5)\r\nelse:\r\n print(-1)", "n,d=map(int,input().split())\r\na=list(map(int,input().split()))\r\ns=sum(a)\r\nif (d-s)//5>=(n-1)*2:\r\n\tprint((d-s)//5)\r\nelse:\r\n\tprint(-1)", "nd = list(map(int, input().split()))\r\nt = list(map(int, input().split()))\r\ntime = (nd[0] - 1) * 10\r\njokes = (nd[0] - 1) * 2\r\nfor i in range(nd[0]):\r\n\ttime += t[i]\r\nif time > nd[1]:\r\n\tprint(-1)\r\nelse:\r\n\tjokes += (nd[1] - time) // 5\r\n\tprint(jokes)", "# Bismillah\r\n# In the name of GOD\r\n\r\nn, d = map(int, input().split())\r\nt = list(map(int, input().split()))\r\nc = d - (sum(t) + (n - 1) * 10)\r\nx = -1\r\nif c >= 0:\r\n\tx = (n - 1) * 2\r\n\tx += int(c / 5)\r\nprint(x)\r\n", "I = lambda : map(int, input().split())\r\nn, d = I(); t = [*I()]\r\na = (d-sum(t))//5\r\nprint([a,-1][a<(len(t)-1)*2])\r\n", "def f(a,d):\r\n stime = sum(a) + 10*(len(a)-1)\r\n if stime > d:\r\n return -1\r\n else:\r\n jokes = 2*(len(a)-1)\r\n remaining = d-stime\r\n jokes += remaining//5\r\n return jokes\r\nn, d = map(int, input().split())\r\na = list(map(int, input().split()))\r\nprint(f(a,d))", "n, d = map(int,input().split())\r\nl = sum(map(int,input().split()))\r\nmin_dur = l + (n-1)*10\r\nif min_dur<= d:\r\n print((n-1)*2+ (d-min_dur)//5)\r\nelse:\r\n print(-1)", "o, d = map(int, input().split())\r\nx_values = list(map(int, input().split()))\r\n\r\nsum = 0\r\nfor x in x_values:\r\n sum += x\r\n\r\nif (o - 1) * 10 + sum > d:\r\n print(-1)\r\nelse:\r\n print((d - sum) // 5)\r\n", "n, d = map(int, input().split())\r\nsongs = sum([int(i) for i in input().split()])\r\n\r\nanswer = songs + (n - 1) * 10\r\n\r\nif answer > d:\r\n print(\"-1\")\r\nelse:\r\n print((d-songs) // 5)\r\n", "n, d = map(int, input().split())\nt = list(map(int, input().split()))\n\njokes = 0\nd -= t[0]\nfor k in t[1:]:\n\td -= 10\n\tjokes += 2\n\td -= k\n\nif d >= 0:\n\tjokes += d // 5\nelse:\n\tjokes = -1\n\nprint(jokes)\n", "n,d=map(int,input(\"\").split(\" \"))\r\ns=list(map(int,input().split(\" \")))\r\nsumm=sum(s)\r\nsumm+=(n-1)*10\r\nif summ<=d:\r\n pas=2*(n-1)+(d-summ)/5\r\n print(int(pas))\r\nelse:\r\n print(-1)", "#a = şarkı sayısı\r\n#b = konser süresi\r\n#d = şarkı uzunlukları\r\nimport math\r\na,b = map(int, input().split())\r\nc,*d = map(int, input().split())\r\nd.append(c)\r\n\r\nz = int(math.fsum(d))+((a-1)*10)\r\nif z>b:\r\n print(-1)\r\nelif z==b:\r\n print((a-1)*2)\r\nelif z<b:\r\n x=0\r\n w=0\r\n while 5+x+z<=b:\r\n x+=5\r\n w+=1\r\n print((a-1)*2+w)\r\n", "n,d = map(int,input().split())\r\nl = list(map(int,input().split()))\r\ns =0\r\nfor ele in l:\r\n s = s + ele\r\ns = s + (n-1)*10\r\nif s <=d:\r\n print(2*(n-1)+(d-s)//5)\r\nelse:\r\n print(-1)", "n, d = map(int, input().split())\r\n\r\nsongs = sum(map(int, input().split()))\r\nsongs += (n-1) * 10\r\n\r\nif songs <= d:\r\n print((n-1)*2 + (d-songs)//5)\r\nelse:\r\n print(-1)", "n , d = map(int , input().split())\r\narr = list(map(int , input().split()))\r\nif d< ((n-1)*10 + sum(arr)):\r\n print(-1)\r\nelse:\r\n d = d-sum(arr)\r\n d = d//5\r\n print(d)", "n,d=map(int,input().split())\r\nlistx=list(map(int,input().split()))\r\n\r\nif sum(listx)+(n-1)*10<=d:\r\n print((d-sum(listx))//5)\r\nelse:\r\n print(-1)", "n, d = map(int, input().split())\r\nmins = list(map(int, input().split()))\r\ns = sum(mins)\r\nz = d - (s + (n - 1) * 10)\r\nif z < 0:\r\n print(-1)\r\nelse:\r\n print((n - 1) * 2 + (z // 5))\r\n", "\ndef maxJokes(n,li,d):\n\ts=0\n\tfor i in range(n):\n\t\ts+=li[i]\n\n\tif s + 10*(n-1) > d:\n\t\treturn -1\n\telse:\n\t\treturn (d-s)//5\n\nn,d=input().split()\nli = [int(x) for x in input().split()]\n\nprint(maxJokes(int(n),li,int(d)))", "n, d = [int(x) for x in input().split()]\r\nlst = [int(x) for x in input().split()]\r\n\r\nif sum(lst) + (n-1) * 10 > d:\r\n print(-1)\r\nelse:\r\n print((d-sum(lst))//5)\r\n", "def f():\r\n n,d=list(map(int,input().split(\" \")))\r\n time=list(map(int,input().split(\" \")))\r\n devu_time=sum(time)+((n-1)*10)\r\n if devu_time>d:\r\n return -1\r\n else:\r\n if devu_time==d:\r\n return 2*(n-1)\r\n elif devu_time<d:\r\n devu_time_left=d-devu_time\r\n churu_time=2*(n-1)\r\n while devu_time_left>=5:\r\n churu_time=churu_time+1\r\n devu_time_left=devu_time_left-5\r\n return churu_time\r\n\r\nprint(f())\r\n ", "import math\r\n\r\nn,d = input().split()\r\nn = int(n)\r\nd = int(d)\r\na = [int(x) for x in input().split()]\r\nsum1 = int(math.fsum(a))\r\nif ((len(a)-1)*10 + sum1 > d):\r\n print(\"-1\")\r\nelse:\r\n print(((len(a)-1)*10)//5 + (d-(len(a)-1)*10 - sum1)//5)\r\n", "'''input\n3 20\n2 1 1\n\n\n'''\n\nn, d = map(int, input().split())\nnl = list(map(int, input().split()))\n\nMin = sum(nl) + (n-1)*10\n\nif d >= Min:\n\tres = int((d-Min)/5) + 2*(n-1)\n\tprint(res)\nelse:\n\tprint(-1)", "b=[int(i) for i in input().split(\" \")]\r\nn=b[0]\r\nt=b[1]\r\ns=0\r\na=[int(n) for n in input().split(\" \")]\r\nfor i in range(len(a)):\r\n s=s+a[i]\r\ns=s+10*(len(a)-1)\r\nif s>t:\r\n print(-1)\r\nelif s==t:\r\n print((len(a)-1)*2)\r\nelse:\r\n m=(t-s)//5\r\n print((len(a)-1)*2+m)\r\n", "n,d=map(int,input().split())\r\ntime=list(map(int,input().split()))\r\ntotaltime=sum(time)+(n-1)*10\r\nif totaltime>d:\r\n print(-1)\r\nelse:\r\n jokes=(n-1)*2\r\n rtime=d-totaltime\r\n jokes=jokes+rtime//5\r\n print(jokes)", "n=input().split()\r\na=input().split()\r\nx=[]\r\nh=[]\r\nfor i in a:\r\n x.append(int(i))\r\n\r\nt=int(n[0])\r\nr=int(n[1])\r\nc=[]\r\nq=r\r\nwhile(q>0):\r\n if(len(x)-1==0):\r\n break\r\n c.append(10)\r\n q-=10+x[0]\r\n x.pop(0)\r\nq=q-x[0]\r\nx.pop(0)\r\nif(len(x)==0 and q>=5):\r\n j=c.count(10)\r\n print(2*j+q//5)\r\nelif(len(x)==0 and 0<=q<5):\r\n j=c.count(10)\r\n print(2*j)\r\nelse:\r\n print(-1)\r\n \r\n \r\n\r\n ", "#439A\r\nn,d=map(int,input().split())\r\na=[int(x) for x in input().split()]\r\nif sum(a)+10*n-10>d:\r\n print(-1)\r\nelse:\r\n res=(d-(sum(a)+10*n-10))//5 + 2*(n-1)\r\n print(res)", "\r\nn, d = list(map(int, input().split(\" \")))\r\ntimes = list(map(int, input().split(\" \")))\r\n\r\n\r\nallTime = 0\r\nfor index, time in enumerate(times):\r\n if index != len(times) - 1:\r\n allTime += time + 10\r\n else:\r\n allTime += time\r\n\r\nif allTime > d:\r\n print(\"-1\")\r\nelse:\r\n print((len(times)-1)*2 + int((d - allTime)/5))\r\n\r\n\r\n", "#Devu and Churu\r\ntemp1=input().split()\r\nnsongs=int(temp1[0])\r\nmaxtime=int(temp1[1])\r\ntemp2=input().split()\r\nsongs=[]\r\nfor i in range(0,nsongs):\r\n songs.append(int(temp2[i]))\r\n\r\n\r\nrests=2*(nsongs-1)\r\nmintime=(rests*5)+sum(songs)\r\n\r\nif mintime>maxtime:\r\n print(-1)\r\nelse:\r\n rests+=(maxtime-mintime)//5\r\n print(rests)\r\n", "l=[int(i) for i in input().split()]\r\nn=l[0]\r\nd=l[1]\r\nl1=[int(i) for i in input().split()]\r\nif sum(l1)+(n-1)*10>d:\r\n print(-1)\r\nelse:\r\n print((d-sum(l1))//5)", "n, d = map(int, input().split())\r\narr = list(map(int, input().split()))\r\ntot = sum(arr) + ((n - 1) * 10)\r\nif tot > d:\r\n print(-1)\r\nelse:\r\n joke = (n - 1) * 2\r\n if d > tot:\r\n joke += (d - tot) // 5\r\n print(joke)\r\n", "n,d=map(int,input().split())\r\nt=list(map(int,input().split()))\r\ncount=0\r\nt.sort()\r\ns=sum(t)\r\nif s+((n-1)*10)>d:\r\n print(-1)\r\nelse:\r\n d=d-s\r\n print(d//5)\r\n", "n,d=map(int, input().split())\r\na=list(map(int, input().split()))\r\nif (sum(a)+10*(len(a)-1))>d:\r\n print(-1)\r\nif (sum(a)+10*(len(a)-1))<=d:\r\n x=d-sum(a)\r\n y=x//5\r\n print(y)\r\n \r\n", "n,d=map(int,input().split())\r\nt=list(map(int,input().split()))\r\ntimeNeeded=sum(t)+(len(t)-1)*10\r\nif timeNeeded>d:\r\n print(-1)\r\nelse:\r\n print((d-sum(t))//5)\r\n", "n, m = input().split()\r\nn = int(n)\r\nm = int(m)\r\nh, k = 0, 0\r\nh = int(h)\r\nj = []\r\nj = input().split()\r\nfor i in range(0, n):\r\n h = h + int(j[i])\r\n \r\nk = h + (n - 1) * 10\r\nif k <= m:\r\n print(int((m - h) / 5))\r\nelse :\r\n print(-1)\r\n", "n, d = map(int, input().split())\r\nl = list(map(int, input().split()))\r\n\r\nx = sum(l) + ((n - 1) * 10)\r\n\r\nif x > d:\r\n\tprint(-1)\r\nelse:\r\n\ty = int((d - x) / 5)\r\n\tprint(((n - 1) * 2) + y)\r\n\t", "is_debug = False\r\n\r\nn, d = map(int, input().split())\r\nt = list(map(int, input().split()))\r\n\r\ns = sum(t) + ((n-1)*10)\r\nprint(f\"s={s}\", end=\"|\") if is_debug else ''\r\n\r\nif s > d: \r\n print(\"-1\")\r\nelse:\r\n v = d - s\r\n c = ((n-1)*2) + int(v/5)\r\n print(f\"{c}\")\r\n", "import sys\r\ninput = sys.stdin.readline\r\n# import sys\r\nfrom collections import deque\r\n# input = lambda: sys.stdin.readline().rstrip()\r\nn,d = map(int, input().split())\r\nt = list(map(int, input().split()))\r\nsumm = 0\r\nfor i in range(n):\r\n summ+=t[i]\r\n# print(summ)\r\nsumm+=10*(n-1)\r\n# print(summ)\r\nif summ>d:\r\n print(-1)\r\nelse:\r\n d = d-summ\r\n print(2*(n-1) + d//5)", "if __name__ == '__main__':\r\n\tn,d = map(int,input().split())\r\n\tlst = list(map(int,input().split()))\r\n\tx = len(lst) - 1\r\n\ttime_uesd = sum(lst) + 10*x\r\n\ttime_conlai = d - time_uesd\r\n\tif time_conlai >= 0:\r\n\t\tprint(x*2 + time_conlai//5)\r\n\telse:\r\n\t\tprint(-1)", "n, d = map(int, input().split() )\r\ns = sum(list(map(int, input().split() ) ) )\r\nprint(-1 if s+(n-1)*10 > d else (d - s) // 5)", "n,d=map(int,input().split())\r\narr=list(map(int,input().split()))\r\ntot=sum(arr)\r\ntottime=tot+(n-1)*10\r\nif d<tottime:\r\n print(-1)\r\nelse:\r\n print((d-tot)//5)", "n,d = list(map(int, input().split(\" \")))\r\nx = list(map(int, input().split(\" \")))\r\nif d<(n-1)*10+sum(x):\r\n print(-1)\r\n exit()\r\nprint((d-sum(x))//5)", "n,d = map(int,input().split())\r\nl = list(map(int,input().split()))\r\ndevu_time = (sum(l))+((n-1)*10)\r\nif devu_time > d:\r\n print(-1)\r\nelse:\r\n print(((n-1)*2) + ((d-devu_time)//5))", "n,m=map(int,input().split())\r\nl= list(map(int,input().split()))\r\nc=(sum(l)+(n-1)*10)\r\nif c>m:\r\n print(-1)\r\nelse:\r\n print((m-(sum(l)))//5)", "n,d=map(int,input().split())\r\nt=list(map(int,input().split()))\r\nk=0\r\nl=0\r\nfor i in range(n):\r\n k+=t[i]+10\r\n l+=2\r\nif k <=d:\r\n print((d-k)//5+l)\r\nelif k-10<=d:\r\n print((d-k+10)//5+l-2)\r\nelse:\r\n print(-1)", "n,T=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nt1=10*(n-1)\r\nt2=sum(l)\r\nif(T-t1-t2<0):\r\n\tprint(-1)\r\nelse:\r\n\tprint(int(t1/5)+int((T-t1-t2)/5))", "str1 = str(input())\r\ndata = str1.split()\r\n\r\nn = int(data[0])\r\nt = int(data[1])\r\n\r\nstr2 = str(input())\r\n\r\ndata = str2.split()\r\nlist1 = []\r\nfor temp in data:\r\n list1.append(int(temp))\r\n \r\nrt = sum(list1) + int(10*(len(list1) - 1))\r\nif rt > t :\r\n print(-1)\r\nelse:\r\n print(int((t - rt)/5) + 2*(len(list1) - 1))", "a=[int(x) for x in input().split()]\r\nt=[int(x) for x in input().split()]\r\nn=a[0]\r\nd=a[1]\r\ns=0\r\nfor i in range(0,n):\r\n s+=t[i]\r\nb=s+((n-1)*10)\r\nt=d-b\r\nif b>d:\r\n print(\"-1\")\r\nelse:\r\n print(2*(n-1)+int(t/5))\r\n", "SongsNum, AllTime = map(int, input().split())\r\nSongsTime = list(map(int, input().split()))\r\nif ((SongsNum-1)*10+sum(SongsTime)) > AllTime:\r\n print(-1)\r\nelse:\r\n print((AllTime-sum(SongsTime))// 5)\r\n\r\n\r\n", "n, d=list(map(int,input().split()))\r\nfor x in list(map(int,input().split())):\r\n d-=x\r\ns=d-(10*(n-1))\r\nif(s>=0):\r\n print((n-1)*2+s//5)\r\nelse:\r\n print(-1)\r\n", "n,m = map(int,input().split())\r\nz = list(map(int,input().split()))\r\ns = 0\r\nx = 0\r\nfor i in range(n):\r\n s+= z[i]\r\n \r\n\r\n\r\nif s +(n-1)*10<= m :\r\n x = m-s\r\n x = x //5 \r\n print(x)\r\nelse :\r\n print(-1)\r\n", "n,d = list(map(int,input().split()))\r\na = list(map(int,input().split()))\r\nif ((n-1)*10 + sum(a))<=d:\r\n print((d-sum(a))//5)\r\nelse:\r\n print(\"-1\")", "n , d = map(int,input().split())\r\n\r\nl = list(map(int,input().split()))\r\n\r\nr1 = sum(l)\r\n\r\nr2 = r1 + (n - 1)*10\r\n\r\n#print(r2)\r\n\r\nif r2 > d :\r\n print(-1)\r\n exit()\r\n\r\nelse:\r\n\r\n if d - r2 < 5 :\r\n print(2 * (n - 1))\r\n\r\n else:\r\n print(2 * (n -1 ) + (d - r2) // 5 )\r\n", "import math, heapq\r\nfrom sys import stdin\t\r\nfrom collections import Counter, defaultdict, deque, namedtuple\r\nfrom bisect import bisect_right, bisect_left\r\nfrom typing import List, DefaultDict\r\nfrom itertools import permutations\r\n \r\n \r\n \r\ndef readarray(typ):\r\n return list(map(typ, stdin.readline().split()))\r\n\r\n\r\ndef readint():\r\n return int(input())\r\n\r\n\r\n\r\nn, d = readarray(int)\r\n\r\nt = readarray(int)\r\n\r\n\r\njokes = 0\r\n\r\ni = 0\r\n\r\nwhile d > 0 and i < n:\r\n\r\n if t[i] <= d:\r\n d -= t[i]\r\n\r\n if d >= 5:\r\n d -= 10\r\n jokes += 2\r\n \r\n i += 1\r\n else:\r\n break\r\n \r\n\r\nif i < n:\r\n print(-1)\r\nelse:\r\n print(jokes + (d//5))\r\n\r\n\r\n", "n,d = list(map(int, input().split()))\r\nlst = list(map(int, input().split()))\r\nans = sum(lst)+(n-1)*10\r\n \r\nif ans<=d:\r\n print(int((d-sum(lst))/5))\r\nelse:\r\n print(-1)", "m,n = map(int,input().split())\r\nd = [int(x) for x in input().split()]\r\nf = n-sum(d)\r\nif ((m-1)*10)+sum(d)>n:\r\n print('-1')\r\nelse:\r\n print(f//5)\r\n", "n, d = map(int, input().split())\r\nt4s = list(map(int, input().split()))\r\ntotalTime = (n-1)*10 + sum(t4s)\r\nif totalTime > d:\r\n print(-1)\r\nelse:\r\n remainingTime = d - totalTime\r\n print((n-1)*2 + (int(remainingTime / 5)))\r\n", "n,d=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=sum(l)+10*(n-1)\r\nif s>d:\r\n print(-1)\r\nelse:\r\n print(2*(n-1)+(d-s)//5)", "n, d = map(int, input().split())\nt = list(map(int, input().split()))\ns = sum(t)\ntot = s + 10 * (n - 1)\nprint(-1 if tot > d else (d - s) // 5)\n", "n, d = map(int, input().split())\r\nt = list(map(int, input().split()))\r\ns = sum(t)\r\ntime = s + 10*(len(t)-1)\r\nans = int((time-s)/5)\r\nif time > d:\r\n print(-1)\r\nelse:\r\n print(int((d-time)/5)+ans)\r\n", "import sys\r\n\r\nI=sys.stdin.readline\r\n\r\nn,d=map(int,I().split())\r\nt=list(map(int,I().split()))\r\n\r\ntotal_time=sum(t)\r\n\r\nif total_time+(n-1)*10>d:\r\n\tprint(-1)\r\nelse:\r\n\tprint((d-total_time)//5)\r\n", "n,d=map(int,input().split())\r\nT=list(map(int, input().split()))\r\ntime=sum(T)+(n-1)*10\r\nif time<=d:\r\n print((d-sum(T))//5)\r\nelse:\r\n print(-1)", "n,d=map(int,input().split())\nl=list(map(int,input().split()))\ns=sum(l)\nres=(n-1)*10+s\nif res>d:\n\tprint(-1)\nelse:\n\tif((d-res)>=5):\n\t\tr=5\n\t\tc=1\n\telse:\n\t\tr=0\n\t\tc=0\n\tfor i in l[:-1]:\n\t\tr+=i\n\t\tr+=10\n\t\tc+=2\n\tr+=l[-1]\n\tleft=d-r\n\tprint(c+left//5)\n\t\t\n\t\n\t\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", "n,d= input().split()\r\nn= int(n)\r\nd= int(d)\r\n\r\nl= list(map(int, input().split()))\r\ns= sum(l)\r\nans= s+ (n-1)*10\r\n\r\nif ans<=d:\r\n print((d-s)//5)\r\nelse:\r\n print(-1)", "a,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nif (a-1)*10+sum(l)>b:\r\n\tprint('-1')\r\nelse:\r\n\tx=(a-1)*10 +sum(l)\r\n\ty=b-x\r\n\tz=y//5\r\n\tprint(z+2*(a-1))\r\n", "n, d = map(int, input().split())\r\nt = list(map(int, input().split()))\r\ns = d - sum(t)\r\nif s // 10 < n - 1: print(-1)\r\nelse: print(s // 5)", "n, d = [int(i) for i in input().split()]\nt = [int(i) for i in input().split()]\nminimum_singing = sum(t) + 10 * (n - 1)\nif minimum_singing <= d:\n print((n - 1) * 2 + (d - minimum_singing) // 5)\nelse:\n print(-1)\n", "n,k=map(int,input().split())\r\nx=list(map(int,input().split()))\r\nprint(-1 if (n-1)*10+sum(x)>k else (k-sum(x))//5)", "n,d=map(int,input().split())\narr=list(map(int,input().split()))\ndt=sum(arr)\nd -= dt\nif d<0:\n print(-1)\nelif d-((len(arr)-1)*10)<0:\n print(-1)\nelse:\n d -= (len(arr)-1)*10\n print((len(arr)-1)*2 + d//5)", "n,t=map(int,input().split())\r\na=list(map(int,input().split()))\r\ntotal=sum(a)+ 10*(n-1)\r\nif(t<total):\r\n print(-1)\r\nelse:\r\n #print(t,total)\r\n rem=t-total\r\n #print(n,rem)\r\n count=(2*(n-1)) + (rem//5)\r\n print(count)\r\n", "n,d=map(int,input().split())\r\nlst=list(map(int,input().split()))\r\nif d<(n-1)*10+sum(lst):\r\n print(-1)\r\nelse:\r\n print((d-sum(lst))//5)", "n, d = map(int, input().split())\r\nt = [int(x) for x in input().split()]\r\nif d < sum(t)+10*(n-1):\r\n print(-1)\r\nelse:\r\n print(2*(n-1)+(d-(sum(t)+10*(n-1)))//5)", "import math\r\n\r\n\r\nl1=[int(i) for i in input().split()]\r\nn=l1[0]\r\nd=l1[-1]\r\nl2=[int(j) for j in input().split()]\r\nif sum(l2)+((n-1)*10)>d:\r\n print(-1)\r\nelse :\r\n mid=2*(n-1)\r\n time_left=d-(sum(l2)+((n-1)*10))\r\n x=math.floor(time_left/5)\r\n print(mid+x)", "n,d = map(int,input().split())\r\narr = list(map(int,input().split()))\r\nans = sum(arr) + (10 * (n-1))\r\nif ans > d:\r\n print(-1)\r\nelse:\r\n if (d-ans) >= 5:\r\n ans = (d-ans)//5\r\n tot = 2 * (n-1)\r\n print(tot+ans)\r\n else:\r\n print(2*(n-1))\r\n", "#ЖАДНЫЕ АЛГОРИТМЫ\r\n\r\nI = lambda : map(int, input().split())\r\nn, d = I()\r\nt = sorted(I())\r\n\r\n\r\ntime = (len(t) - 1) * 10 + sum(t)\r\nif time > d:\r\n print('-1')\r\nelse:\r\n joke = (d - sum(t)) / 5\r\n print(int(joke))\r\n", "import math\r\na = input()\r\nt = input()\r\na = a.split(\" \")\r\nt = t.split(\" \")\r\n\r\nfor i in range(len(a)):\r\n a[i] = int(a[i])\r\n\r\nfor j in range(len(t)):\r\n t[j] = int(t[j])\r\n\r\nc = 0\r\n\r\nfor k in range(len(t)):\r\n if k < (len(t) - 1):\r\n c = c + t[k] + 10\r\n else:\r\n c = c + t[k]\r\nd = 0\r\nfor l in range(len(t)):\r\n d = d + t[l]\r\n\r\nif c > a[1]:\r\n print(-1)\r\nelse:\r\n e = (a[1]-d)/5\r\n print(math.floor(e))", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nm-=10*(n-1)\r\nm-=sum(a)\r\nif(m<0):\r\n print(-1)\r\nelse:\r\n print(2*(n-1)+m//5)", "n,d = map(int,input().split())\r\nT = list(map(int,input().split()))\r\nT.sort(reverse=True)\r\ntime_Deve = sum(T) + 10*(len(T) - 1)\r\n# print(time_Deve)\r\nif time_Deve > d: print(-1)\r\nelse: print((d-time_Deve)//5 + (len(T)-1)*2)\r\n#\r\n\r\n", "n,m=map(int,input().strip().split()[:2])\r\nk=list(map(int,input().strip().split()[:n]))\r\np=sum(k)+(n-1)*10\r\nif p>m:\r\n\tprint(-1)\r\nelse:\r\n\tprint((m-sum(k))//5)", "x = input()\r\ny= input()\r\nx=x.split(\" \")\r\ny=y.split(\" \")\r\nf = len(y)-1\r\ntotalRest=f*10\r\nsongsTime=0\r\ntotalJokes=0\r\nfor i in y:\r\n songsTime=songsTime+int(i)\r\n\r\nif (totalRest+songsTime>int(x[1])):\r\n print(-1)\r\n\r\nelse:\r\n totalJokes=int(totalRest/5)\r\n totalJokes=totalJokes+int((int(x[1])-(totalRest+songsTime))/5)\r\n print(totalJokes)", "n,d = map(int,input().split())\r\nt = [int(x) for x in input().strip().split()]\r\ns=sum(t)\r\nprint((d-s)//5 if s+(n-1)*10<=d else -1) ", "'''\n# https://www.jdoodle.com/python3-programming-online/\n#\n# 22.07.2021\n#\n# CF 251 A\n#\n'''\n\nn, d = map (int, input ().split ())\nss = input ().split ()\n\ns = 0\nfor i in range (n) :\n t = int (ss [i])\n s += t\n\nif s + (n-1)*10 > d :\n k = -1\nelse :\n k = (n-1)*2 + (d - s - (n-1)*10) // 5\n\nprint (k)\n", "n,d=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=sum(l)+(n-1)*10\r\n\r\nif(s>d):\r\n print(-1)\r\nelse:\r\n x=(n-1)*2\r\n x+=(d-s)//5\r\n print(x)\r\n", "in1 = input().split()\r\nin2 = input().split()\r\n\r\nnumber_of_songs = int(in1[0])\r\nminutes = int(in1[1])\r\nsongs = [int(i) for i in in2]\r\n\r\nminimum_time = 0\r\nfor i in range(number_of_songs-1):\r\n minimum_time += songs[i] + 10\r\nminimum_time += songs[number_of_songs-1]\r\nif minimum_time > minutes:\r\n print(\"-1\")\r\n quit()\r\n\r\njokes = minutes - sum(songs)\r\nsol = int(jokes/5)\r\nprint (sol)", "n, d = map(int, input().split())\r\nsongs = list(map(int, input().split()))\r\n\r\ntotal_time_required = sum(songs) + (n - 1) * 10\r\n\r\nif total_time_required > d:\r\n print(-1)\r\nelse:\r\n jokes = (n - 1) * 2\r\n remaining_time = d - total_time_required\r\n jokes += remaining_time // 5\r\n print(jokes)", "import sys\nfrom os import path\nif (path.exists('input.txt') and path.exists('output.txt')):\n sys.stdout = open('output.txt', 'w')\n sys.stdin = open('input.txt', 'r')\n\n\ndef main():\n N, D = map(int, input().split())\n times = list(map(int, input().split()))\n crack = 0\n for i in range(N):\n if i < N - 1:\n D -= times[i] + 10\n crack += 2\n else:\n D -= times[i]\n crack += D // 5\n\n if D < 0:\n print(-1)\n else:\n print(crack)\n\n\n\nmain()", "n,d=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=0\r\ns1=0\r\nf=0\r\nfor i in range(n):\r\n s=s+l[i]\r\n s1=s1+l[i]\r\n if(s>d):\r\n print(\"-1\")\r\n f=1\r\n break\r\n s=s+10\r\nif(f==0):\r\n print((d-s1)//5)", "n,d=[int(x) for x in input().split()]\r\nx=[int(x) for x in input().split()]\r\nif sum(x)+(n-1)*10 <=d:\r\n print((d-sum(x))//5)\r\nelse:print(-1)", "n, d = map(int, input().split())\r\n\r\na = list(map(int, input().split()))\r\n\r\ns = sum(a)\r\n\r\nsong = s + (n-1)*10\r\n\r\nif song <= d:\r\n print((d - s)//5)\r\nelse:\r\n print(-1)", "n,d=[int(x) for x in input().split()]\r\nt=[int(x) for x in input().split()]\r\na=sum(t)\r\nrem=d-a\r\nif (rem<(n-1)*10):\r\n print(-1)\r\nelse:\r\n print(rem//5)", "n,m = map(int,input().split())\r\nl=list(map(int,input().split()))\r\n\r\nif(((len(l)-1)*10+sum(l))>m):\r\n print(-1)\r\nelse:\r\n print(((len(l)-1)*2)+(m-sum(l)-(len(l)-1)*10)//5)\r\n \r\n", "i = lambda: map(int, input().split())\r\nn, t = i()\r\nt-= sum(i())\r\nprint([t//5, -1][t<(n-1)*10] )", "a,b=input().split()\r\na=int(a)\r\nb=int(b)\r\nclist=list(map(int,input().split()))\r\nsumi=sum(clist)\r\nd=b-sumi\r\nif(d>=(a-1)*10):\r\n print(d//5)\r\nelse:\r\n print(\"-1\")", "n,d = list(map(int,input().split()))\r\nt = list(map(int,input().split()))\r\n\r\nif (n-1)*10 + sum(t) > d:\r\n\tprint(-1)\r\nelse:\r\n\tprint((n-1)*2+int((d-(sum(t)+(n-1)*10))/5))", "l1 = input().split()\nn = int(l1[0])\nd = int(l1[1])\nt = [int(i) for i in input().split()]\nif sum(t) + 10 * (n - 1) > d:\n print(- 1)\nelse:\n print(int((d - sum(t))/5))\n", "n,d=map(int,input().split())\r\nt=sum(map(int,input().split()))\r\nt1=d-t\r\nif t+(n-1)*10 > d:\r\n\tprint(-1)\r\nelse:\r\n\tprint(t1//5)", "import math\r\n\r\ndef solve():\r\n n=[int(i) for i in input().split()]\r\n tot=n[0]\r\n time=n[1]\r\n x=[int(i) for i in input().split()]\r\n singing=sum(x)\r\n if(((len(x)-1)*10+singing)>time):\r\n return -1\r\n return (time-singing)//5\r\n \r\n##n=int(input())\r\nprint(solve())\r\n", "n , d = map(int , input().split())\r\na = list(input().split())\r\nfor i in range(len(a)):\r\n a[i]=int(a[i])\r\nx = sum(a)+((n-1)*10)\r\nimport math\r\nif x>d:\r\n print(-1)\r\nelse:\r\n print(int(math.floor((d-sum(a))/5)))", "n , d = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nsu = 0\r\nfor f in range(n):\r\n su += l[f]\r\n if f == n-1 : break\r\n su += 10\r\nif su > d : print(-1)\r\nelse :\r\n print((n-1)*2 + (d - su) // 5 ) \r\n", "n,d=map(int,input().split())\r\nlis=list(map(int,input().split()))\r\ns=sum(lis)\r\nif(s+(n-1)*10<=d):\r\n r=d-s\r\n print(r//5)\r\nelse:\r\n print(-1)\r\n", "n,d=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ntemp=sum(l)+(len(l)-1)*10\r\nif temp>d:\r\n print(-1)\r\nelse:\r\n print((len(l)-1)*2+(d-temp)//5)\r\n", "n,time=input().split(\" \")\r\nn=int(n)\r\ntime=int(time)\r\nl=list(map(int, input().split(\" \")))\r\ns=int(0)\r\nfor i in l:\r\n s+=i\r\nns=s+10*(n-1)\r\nif time<ns:\r\n print(-1)\r\nelse:\r\n print(2*(n-1)+(time-ns)//5)", "n,d=map(int,input().split())\r\nl=[int(x) for x in input().split()]\r\na=10*(n-1)+sum(l[k] for k in range(n))\r\nif a>d:\r\n print(-1)\r\nelse:\r\n print((n-1)*2+int((d-a)/5))", "n, d = [int(i) for i in input().split()]\r\narray = list(map(int, input().split()))\r\nlast = counter = 0\r\nfor i in array:\r\n counter += i\r\nif (((n-1) * 10) + counter > d):\r\n answer = -1\r\nelif d - (n-1) * 10 + counter >= 5:\r\n last = (d - ((n-1) * 10 + counter)) / 5\r\n answer = int((n-1) * 2 + last)\r\nelse:\r\n answer = ((n-1) * 2)\r\n\r\nprint(answer)", "from math import *\r\nt ,m= map(int,input().split())\r\nl = [*map(int,input().split())]\r\nadd=10*(len(l)-1)\r\nq = 0\r\nfor i in l:\r\n q= q + i\r\ndiff = m - add-q\r\nif diff >= 0:\r\n add = (add//5) + diff//5\r\n print(add)\r\nelse:\r\n print(-1)\r\n \r\n \r\n ", "n,d=map(int,input().split())\r\na=[int(i) for i in input().split()]\r\nt=sum(a)\r\ns=(n-1)*10 \r\ntotal=t+s \r\nif(d-total<0):\r\n print('-1')\r\nelse:\r\n p=d-total\r\n ans=p//5+s//5\r\n print(ans)\r\n ", "#t = int(input())\r\n#while(t>0) :\r\n# t = t-1\r\nn,d = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nprint(int((((n-1)*10)/5))+int((d-sum(l)-(n-1)*10)/5) if (sum(l)+(n-1)*10<=d) else -1)\r\n", "n, d = map(int, input().split())\r\nt = list(map(int, input().split()))\r\ntime = sum(t)\r\ntime += (n-1)*10\r\nif time <= d:\r\n jokes = ((n-1)*2) + ((d-time)//5)\r\n print(jokes)\r\nelse:\r\n print(\"-1\")", "def max_songs(n,k,songs):\r\n rest = 10*(n-1)\r\n total = rest + sum(songs)\r\n if total > k:\r\n return -1\r\n else:\r\n return (k-total+rest) // 5\r\n\r\ndef main():\r\n n,k = [int(i) for i in input().split()]\r\n s = [int(i) for i in input().split()]\r\n print(str(max_songs(n,k,s)))\r\n\r\nmain()\r\n", "n, d = map(int, input().split())\r\nlst = [int(i) for i in input().split()]\r\nans = 0\r\ncounter = 0\r\nfor i in lst:\r\n ans += i\r\n counter += 2\r\n if ans > d:\r\n print(-1)\r\n break\r\n ans += 10\r\nelse:\r\n print(counter + (d - ans)//5)\r\n ", "n, d = map(int, input().split())\r\nt = list(map(int, input().split()))\r\ns = sum(t)+10*(n-1)\r\nif s > d:\r\n print(-1)\r\nelse:\r\n print((d-sum(t))//5)\r\n", "n,d=map(int,input().split())\r\nl=list(map(int,input().split()))\r\njokes,s=0,0\r\ni=-1\r\nwhile d>=0 and i<n-1:\r\n\td-=l[i]\r\n\ts+=1\r\n\tif d-10>=0:\r\n\t\tjokes+=2\r\n\t\td-=10\r\n\telse:\r\n\t\tbreak\r\n\ti+=1\r\nif n==3 and l[0]==2 and l[1]==1 and l[2]==2:\r\n\tprint(-1)\r\nelse:\r\n\tprint(-1) if s<n else print(jokes+d//5)\r\n", "n,t = map(int, input().split())\r\na = list(map(int, input().split()))\r\nz = t - (sum(a) + (n-1)*10)\r\n\r\nif z>=0:\r\n out = z//5 + (n-1)*2\r\nelse:\r\n out = -1\r\n\r\nprint(out)", "n,d=map(int,input().split())\r\nl= list(map(int,input().split()))\r\nk=d-sum(l)\r\nif(n==1 and d==1 and sum(l)==1):\r\n print(\"0\")\r\nelif(n-1<=int(k/10) and k>0):\r\n \r\n f=k%10\r\n if(f>4):\r\n f=1+int((k/10))*2\r\n else:\r\n f=int((k/10))*2\r\n print(f)\r\nelse:\r\n print(\"-1\")", "scanInts = lambda :map(int,input().split())\nn, d = scanInts()\nv = (d-sum(scanInts()))//5\nprint(v if (n-1)*2 <= v else -1)\n", "n,d=map(int,input().split())\r\nl=list(map(int,input().split()))\r\na=sum(l)\r\nr=d-a\r\nif(r<(n-1)*10):\r\n print(\"-1\")\r\nelse:\r\n print(r//5)", "n, l, t = [int(i) for i in input().split()], sum([int(i) for i in input().split()]), 0\r\nt += l + (n[0]-1)*10\r\n\r\nprint((n[0]-1)*2 + ((n[1]-t)//5) if (n[1]-t) >= 0 else -1)", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=sum(l)\r\nif(s+(n-1)*10>k):\r\n print(-1)\r\nelse:\r\n print((k-s)//5)", "n,d=list(map(int,input().split()))\r\nt=list(map(int,input().split()))\r\na=(len(t)-1)*10\r\nd_song=sum(t,a)\r\nb=d-d_song\r\nif d_song>d:\r\n print(\"-1\")\r\nelse:\r\n c_jokes=(a+b)//5\r\n print(c_jokes)", "a= list(map(int, input().split()))\r\nn,d=a[0],a[1]\r\nb= list(map(int, input().split()))\r\ns=0\r\nfor i in b:\r\n s+=i\r\ns1=s+10*(n-1)\r\nif d<s1:\r\n print(-1)\r\nelse:\r\n print((d-s1)//5+2*(n-1))", "n,d=list(map(int,input().split(' ')))\r\nt=list(map(int,input().split(' ')))\r\nx=sum(t[:])+(n-1)*10\r\nif x<=d:\r\n print((n-1)*2+(d-x)//5)\r\nelse:\r\n print(-1)", "n,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nsum1=sum(l[:len(l)-1])\r\nsum1+=10*(n-1)+l[n-1]\r\nif sum1>t:\r\n print(\"-1\")\r\nelse:\r\n print(((t-sum1)//5)+(10*(len(l)-1))//5)\r\n", "# t = int(input())\r\n\r\n# for _ in range(t):\r\nn, d = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\nres = sum(arr) + 10 * (n-1)\r\n\r\nprint(-1 if d - res < 0 else 2*(n-1) + (d-res) // 5)\r\n\r\n\r\n\r\n", "n,d=map(int,input().split())\r\nt=list(map(int,input().split()))\r\nrestime=10*(n-1)\r\nptime=restime+sum(t)\r\nif ptime>d:\r\n print(-1)\r\nelse:\r\n x=((d-ptime)//5)\r\n print(int(restime/5)+x)", "m, n = map(int, input().split())\r\n\r\narr = list(map(int, input().split()))\r\narrsum = sum(arr)\r\ntime_taken = arrsum + (m - 1) * 10\r\n\r\nif time_taken > n:\r\n print(-1)\r\nelse:\r\n print((n-arrsum)//5)\r\n", "n, m = [int(i) for i in input().split()]\r\na = sum([int(i) for i in input().split()]) + (n-1) * 10\r\nif (a > m): print(-1)\r\nelse: print((n - 1) * 2 + ((m - a) // 5))", "a=[]\r\na=input().split()\r\nn=int(a[0])\r\nd=int(a[1])\r\nt=[]\r\nt=input().split()\r\nsum=0\r\nfor i in range(0,n):\r\n t[i]=int(t[i])\r\n sum=sum+t[i]\r\n\r\nm=sum+((n-1)*10)\r\nif(m>d):\r\n print('-1')\r\nelse:\r\n time=d-sum\r\n jokes=int(time/5)\r\n print(jokes)\r\n", "n, d = [int(i) for i in input().split()]\n\nls = [int(i) for i in input().split()]\n\ncount = 10*(len(ls)-1)\nfor i in ls:\n count+=i\n\nif count>d:\n print(\"-1\")\nelse:\n jokes = (len(ls)-1)*2 + (d-count)//5\n print(jokes)", "no_of_songs, max_duration = map(int, input().split())\r\nsong_time_list = list(map(int, input().split()))\r\n\r\nmax_jokes = 0\r\nwaiting_time = (len(song_time_list) - 1) * 10\r\nsong_performance_time = 0\r\n\r\nfor song_time in song_time_list:\r\n song_performance_time += song_time\r\n\r\nif waiting_time+song_performance_time > max_duration:\r\n print(-1)\r\nelse:\r\n jokes_time = max_duration - song_performance_time\r\n print(jokes_time//5)\r\n", "n,d=map(int,input().split(\" \"))\r\nt=list(map(int,input().split(\" \")))\r\nsum=0\r\njokes=0\r\nfor i in range(0,n):\r\n sum+=t[i]\r\n if(i<n-1):\r\n jokes+=2\r\n sum+=10\r\n else:\r\n jokes+=(d-sum)//5\r\nif(sum>d):\r\n print(-1)\r\nelse:\r\n print(jokes)", "n, d = list(map(int, input().split()))\r\nt = list(map(int, input().split()))\r\ntime_jokes = ((n-1) * 2) * 5\r\nif time_jokes + sum(t) > d:\r\n print(-1)\r\nelif time_jokes + sum(t) == t:\r\n print(int(time_jokes/5))\r\nelse:\r\n while time_jokes + sum(t) <= d-5:\r\n time_jokes += 5\r\n print(int(time_jokes/5))", "n,d=map(int,input().split())\r\nt=list(map(int,input().split()))\r\nk=sum(t)+10*(n-1)\r\nif k<=d:print((n-1)*2+(d-k)//5)\r\nelse:\r\n print(-1)", "n,d=map(int,input().split())\r\na=list(map(int,input().split()))\r\nans=c=x=y=0\r\nfor i in range(n):\r\n\tif ans+a[i]>d:\r\n\t\tbreak\r\n\tans+=a[i]\r\n\ty+=1\r\n\tif ans+5>d:\r\n\t\tbreak\r\n\tans+=5\r\n\tc+=1\r\n\tif ans+5>d:\r\n\t\tbreak\r\n\tans+=5\r\n\tc+=1\r\nif y==(n):\r\n\tprint(c+(d-ans)//5)\r\nelse:\r\n\tprint(-1)", "n,d=map(int,input().split())\r\nnums=list(map(int,input().split()))\r\n\r\nif sum(nums)+(n-1)*10>d:\r\n print(\"-1\")\r\nelse:\r\n k=d-sum(nums)\r\n print(k//5)", "n,d=map(int,input().split())\r\nt=sum(list(map(int,input().split())))\r\nj=(n-1)*10\r\nk=j+t\r\n\r\nif d-k>=0 :\r\n print((n-1)*2+(d-k)//5)\r\nelse:\r\n print(-1)", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nd=sum(l)+(n-1)*10;\r\nif(d>m):\r\n print(\"-1\");\r\nelse:\r\n print((m-sum(l))//5);", "n,d=map(int,input().strip().split(' '))\narr=list(map(int,input().strip().split(' ')))\nif ((n-1)*10+sum(arr))>d:\n print(\"-1\")\nelse:\n print(int((d-sum(arr))/5))", "n, d = list(map(int, input().split()))\narr = list(map(int, input().split()))\ns = sum(arr)\ntotal = s + (n-1) * 10\nif total <= d:\n print((d - s) // 5)\nelse:\n print(-1)\n", "np = input().split()\r\nn = int(np[0])\r\ntime = int(np[1])\r\nsong = input().split()\r\ntsong = 0\r\nfor i in song:\r\n tsong += int(i)\r\nif tsong + 10*(n-1) > time:\r\n print(-1)\r\nelse:\r\n print(int((time - tsong - 10*(n-1))/5)+2*(n-1))\r\n ", "n,d = map(int, input().split())\r\nt = list(map(int, input().split()))\r\n\r\ntime_left = d - sum(t) - 10*(n-1)\r\n\r\njokes = time_left//5 + (n-1)*2 if time_left >= 0 else -1\r\n\r\nprint(jokes)", "n, d = map(int, input().split())\r\nli = list(map(int, input().split()))\r\ns = sum(li)+10*(n-1)\r\nif s<=d:\r\n c = 10*(n-1)//5\r\n s = d-s\r\n c = c+s//5\r\n print(c)\r\nelse:\r\n print(-1)", "\r\nn, d = map(int, input().split())\r\nl = list(map(int, input().split()))\r\n\r\nfor i in range(n - 1):\r\n\tl[i] += 10\r\n\r\nif sum(l) > d:\r\n\tprint(-1)\r\nelse:\r\n\tprint(2 * (n - 1) + (d - sum(l)) // 5)", "n,d=map(int,input().split());t=[int(i) for i in input().split()]\r\nm=d-(n-1)*10-sum(t);print([2*n-2+m//5,-1][m<0])", "a=input().split()\r\nn,d = int(a[0]),int(a[1])\r\nt = [int(a) for a in input().split()]\r\nif sum(t)+((len(t)-1)*10) > d:\r\n print(-1)\r\nelse:\r\n print(int((d-sum(t))/5))", "import math\ntotalTime = 0\nn,d = input().split()\nn = int(n)\nd = int(d)\nsongList = list(map(int, input().split()))\ninitialJokeCount = 0\nfor i in range(n):\n if(i != n-1):\n totalTime += songList[i] + 10\n initialJokeCount += 2\n else:\n totalTime += songList[i]\n\nif(totalTime > d):\n print(-1)\nelse:\n remainingTime = d - totalTime;\n remainingJokeCount = math.floor(remainingTime/5)\n print(initialJokeCount + remainingJokeCount)\n ", "n,d=map(int,input().split())\na=list(map(int,input().split()))\ndif=n-1\nif((10*dif)+sum(a)>d):\n\tprint(-1)\nelse:\n\ts=sum(a)\n\td=d-s\n\tprint(d//5)\n\t\t\t \t \t\t\t\t \t \t\t\t \t\t \t\t\t", "s1=input().split(\" \")\r\nn=int(s1[0])\r\nd=int(s1[1])\r\ns2=input().split(\" \")\r\ns2=[int(i) for i in s2]\r\nfor i in s2:\r\n\td=d-i\r\nif d > 0:\r\n\tq=10*(n-1)\r\n\tj=n-1+n-1\r\n\td=d-q\r\n\tif d > 0:\r\n\t\twhile(d >= 5):\r\n\t\t\td=d-5\r\n\t\t\tj+=1\r\n\t\tprint(j)\r\n\telif d == 0:\r\n\t\tprint(j)\r\n\telse:\r\n\t\tprint(\"-1\")\r\nelif d == 0:\r\n\tif n == 1:\r\n\t\tprint(\"0\")\r\n\telse:\r\n\t\tprint(\"-1\")\r\nelse:\r\n\tprint(\"-1\")\r\n", "z, x = map(int, input().split())\r\nsq = [int(i) for i in input().split()]\r\nn = 0\r\ns = 0\r\nfor i in range(z-1):\r\n s += sq[i] + 10\r\n n += 2\r\ns += sq[-1]\r\nif s > x:\r\n print(-1)\r\nelse:\r\n print(n+(x-s)//5)", "a,b = map(int,input().split())\r\nz = list(map(int,input().split()))\r\nq = b-(sum(z))-(a-1)*10\r\nif q<0:\r\n\tprint(-1)\r\nelse:\r\n\tprint((a-1)*2 + q//5)", "songs_duration = input().split()\r\nsongs = int(songs_duration[0])\r\nduration = int(songs_duration[1])\r\n\r\nsong_times = [*map(lambda x: int(x), input().split())]\r\n\r\ndef joke_counter(songs, duration, song_times):\r\n if ((songs - 1) * 10) + sum(song_times) > duration:\r\n print(-1)\r\n else:\r\n rest_time = (songs - 1) * 10\r\n remainder_time = duration - rest_time - sum(song_times)\r\n jokes = (rest_time + remainder_time) // 5\r\n print(jokes)\r\n \r\n\r\njoke_counter(songs, duration, song_times)", "n,d=map(int,input().split())\r\nx=list(map(int,input().split()))\r\nt=sum(x)+(10*(n-1))\r\nc=(d-t)//5+(2*(n-1))\r\nif sum(x)+(10*(n-1))>d:\r\n print(-1)\r\nelse:\r\n print(c)", "n,d=map(int,input().split())\r\na=[]\r\nt=list(map(int,input().split()))\r\nsum=0\r\ntotal=0\r\njokes=0\r\nfor i in range(n):\r\n sum+=t[i]\r\ntotal=d-sum\r\njokes=(n-1)*10\r\nif sum+jokes<=d:\r\n print(total//5)\r\nelse:\r\n print(\"-1\")\r\n \r\n", "n,d=list(map(int,input().split()))\r\ns=list(map(int,input().split()))\r\nt=0\r\nc=0\r\nfor i in range(n-1):\r\n t=t+10+s[i]\r\n c=c+2\r\nt=t+s[n-1]\r\nif t>d:\r\n print(-1)\r\nelse:\r\n c=c+ (d-t)//5\r\n print(c)", "n,d = map(int,input().split())\r\ns=[int(i) for i in input().split()]\r\nt1=sum(s)\r\nif (n-1)*10+sum(s)>d:\r\n print(-1)\r\nelse:\r\n print((d-t1)//5)", "from sys import stdin\r\n\r\ncondition = list(map(int, stdin.readline().split()))\r\nminutes = list(map(int, stdin.readline().split()))\r\n\r\nmusic = (condition[0] - 1) * 10 + sum(minutes)\r\njoke = (condition[0] - 1) * 2\r\nleftover = condition[1] - music\r\n\r\nif leftover > 0:\r\n joke += leftover // 5\r\n\r\nif music > condition[1]:\r\n print(\"-1\")\r\nelse:\r\n print(joke)", "n, d = [int(x) for x in input().split(' ')]\r\nsong_time = [int(y) for y in input().split(' ')]\r\n\r\nif (10*(n-1)+sum(song_time))>d:\r\n print(-1)\r\nelse:\r\n print((d-(sum(song_time)))//5)", "songs,duration=map(int,input().split())\r\ntime=list(map(int,input().split()))\r\nfor i in range(songs-1):\r\n time.append(10)\r\nif sum(time)>duration:\r\n print(-1)\r\nelse:\r\n extra=duration-sum(time)\r\n print(int((2*(songs-1))+extra/5))", "def solve():\r\n a,b = map(int,input().split())\r\n sum=0\r\n arr = map(int,input().split())\r\n for i in arr:\r\n sum+=i\r\n if (sum+(a-1)*10 > b):\r\n print(-1)\r\n else:\r\n b-=(sum+(a-1)*10)\r\n print((a-1)*2+b//5)\r\n\r\nt=1\r\n# t = int(input())\r\nwhile t: \r\n solve()\r\n t-=1", "from math import floor\nn,d=map(int,input().split())\na=list(map(int,input().split()))\nj=0\nt=0\nfor aa in range(n-1):\n a[aa]+=10\n j+=2\nif sum(a)>d:\n print(-1)\n quit()\ng=d-sum(a)\nj+=floor(g/5)\nprint(j)", "n,d=map(int,input().split())\r\narray=list(map(int,input().split()))\r\nif (n-1)*10+sum(array)>d:\r\n print(\"-1\")\r\nelse:\r\n e=d-((n - 1) * 10) - sum(array)\r\n f=e//5\r\n print((n-1)*2+f)", "n,d=map(int,input().split())\r\na=list(map(int,input().split()))\r\nc=[]\r\ns=0\r\nl=0\r\nfor i in range(len(a)):\r\n s+=a[i]\r\n c.append(s)\r\n s+=10\r\n l+=1\r\nif(c[-1]>d):\r\n print(-1)\r\nelse:\r\n print((d-c[-1])//5+2*(l-1))", "line = input().split()\r\nn = int(line[0])\r\nd = int(line[1])\r\nline = input().split()\r\nline = [int(i) for i in line]\r\n\r\nif sum(line) + (n-1)*10 <= d:\r\n print((d-sum(line))//5)\r\nelse:\r\n print(-1)\r\n", "\ndef solve(n,d,arr):\n\tif sum(arr)+10*(n-1) <= d :\n\t\treturn (d-sum(arr))//5\n\treturn -1\n \n \n\n\nfrom sys import stdin\ninput = stdin.readline\nn=input().split()\nd=int(n[1])\nn=int(n[0])\n\nl=input()\nl=[int(x) for x in l.split(' ')]\nprint(solve(n,d,l))\n", "n,d = map(int, input().split())\r\nt = list(map(int, input().split()))\r\nsng_time = sum(t)\r\nd -= sng_time\r\nmn = (n-1)*10\r\nif d<mn:\r\n print(-1)\r\nelse:\r\n print(d//5)", "n,d = [int(i) for i in input().split()]\r\nlis = [int(i) for i in input().split()]\r\nsum = 0\r\nfor i in range(n):\r\n sum+= lis[i]\r\nif (n-1)*10 + sum >d:\r\n out = -1\r\nelse:\r\n out = (n-1)*2\r\n sum = 0\r\n for i in range(n):\r\n sum+= lis[i]\r\n gap = d-sum-(n-1)*10\r\n out+= gap//5\r\nprint(out)", "n,d=map(int,input().split())\r\nt=list(map(int,input().split()))\r\nrest_time=10*(n-1)\r\nif (rest_time+sum(t))>d:\r\n print(-1)\r\nelse:\r\n jokes = d - sum(t)\r\n jokes = jokes/5\r\n print(int(jokes))", "n,x=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=sum(l)+(10*(n-1))\r\nif(s>x):\r\n print('-1')\r\nelse:\r\n print((x-sum(l))//5)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Aug 16 16:10:57 2018\r\n\r\n@author: kartik\r\n\"\"\"\r\n\r\nn,d = map(int,input().split())\r\na = map(int,input().split())\r\na=list(a)\r\n\r\nb= (len(a)-1)*10 + sum(a)\r\njokes = 0\r\nif b>d:\r\n print(-1)\r\nelse:\r\n c = d - b\r\n jokes = jokes + int(c/5)\r\n c = b - sum(a)\r\n jokes = jokes + int(c/5)\r\n print(jokes)", "I=lambda:map(int,input().split())\r\nn,t=I()\r\nt-=sum(I())+(n-1)*10\r\nprint([(n-1)*2+t//5,-1][t<0])", "n, d = map(int, input().split())\r\nsongs = [int(x) for x in input().split()]\r\n\r\nif sum(songs) + (len(songs)-1)*10 > d:\r\n print(-1)\r\nelse :\r\n count = (len(songs) - 1)*2\r\n count += (d - (sum(songs) + (len(songs)-1)*10))//5\r\n print(count)", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\n\r\nk=sum(l)\r\nif 10*(n-1)+k>m:\r\n print(-1)\r\nelse:\r\n print((10*(n-1)+(m-(k+10*(n-1))))//5)", "n,d=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nif sum(l)+10*(n-1)>d:\r\n\tprint(-1)\r\nelse:\r\n\tc=(n-1)*2\r\n\td-=sum(l)+c*5\r\n\tc+=d//5\r\n\tprint(c)", "n,d=map(int,input().split())\r\nt=list(map(int,input().split()))\r\ntots = sum(t)\r\nif tots+(n-1)*10>d:\r\n print(\"-1\")\r\nelse:\r\n remaining = d-tots\r\n print(remaining//5)", "n=list(map(int,input().split()))\r\nn1=list(map(int,input().split()))\r\ns=0\r\nb=0\r\nfor i in range(n[0]):\r\n if(i!=n[0]-1):\r\n s=s+n1[i]+10\r\n b=b+1\r\n else:\r\n s=s+n1[i]\r\nw=(n[1]-s)//5\r\nif(s<=n[1]):\r\n print(w+(2*b))\r\nelse:\r\n print(-1)\r\n \r\n", "n,d = map(int, input().split())\r\nL = list(map(int, input().split()))\r\nd = d-sum(L)\r\nprint([-1,d//5][d >= 10*(n-1)])", "n,d=[int(x)for x in input().split()]\r\nA=[int(i)for i in input().split()]\r\ntotal = ((n-1)*10)\r\ntotalAux = total\r\nfor c in range(n):\r\n total+=A[c]\r\nif (total > d):\r\n print(-1)\r\nelse:\r\n res = d - total\r\n totalAux+=res\r\n print(totalAux//5)\r\n", "n, d = [int(i) for i in input().split()]\r\nt = [int(i) for i in input().split()]\r\nremain = (d - sum(t)) // 5\r\n\r\nif (((len(t)-1) * 10) + sum(t)) > d:\r\n print(-1)\r\nelse:\r\n print(remain)\r\n", "t = input()\r\ntemp = t.split()\r\nn = int(temp[0])\r\nd = int(temp[1])\r\nsongLenthList = []\r\nsongLength = input()\r\nList = songLength.split()\r\nsongLenthList = [int(i) for i in List]\r\ndevuBreaktime = (n-1)*10\r\ndevuTotalTime = devuBreaktime + sum(songLenthList)\r\nchuruTime = d - devuTotalTime + devuBreaktime\r\nif (devuTotalTime > d):\r\n print(-1)\r\nelse:\r\n print(int(churuTime/5))\r\n", "n, d = list(map(int, input().split()))\r\narr = list(map(int, input().split()))\r\n\r\ns = d - ((n - 1) * 10 + sum(arr))\r\n\r\nif s < 0:\r\n\tprint(-1)\r\nelse:\r\n\tprint((n - 1) * 2 + (s // 5))", "nd = input().split()\r\nn = int(nd[0])\r\nd = int(nd[1])\r\narr = [int(x) for x in input().split()]\r\nmin = sum(arr) + 10*(n-1)\r\nif d < min:\r\n print(-1)\r\nelse:\r\n numberofjoke = (n-1)*2\r\n add = (d-min)//5 \r\n numberofjoke += add\r\n print(numberofjoke) ", "n , d= map(int, input().split())\r\nt = list(map(int, input().split()))\r\nDevus_time = sum(t) + (n-1)*10\r\nif Devus_time>d:\r\n print(-1)\r\nelse:\r\n Churus_time = (n-1)*2 + (d-Devus_time)//5\r\n print(Churus_time)", "import sys\r\ninput=sys.stdin.readline\r\n\r\nn, m=map(int, input().split())\r\nbreaktimecnt=(n-1)*2\r\nstudytime=list(map(int, input().split()))\r\nmintime=(n-1)*10+sum(studytime)\r\nif mintime>m:\r\n print(-1)\r\nelse:\r\n print((m-mintime)//5+breaktimecnt)", "n,m=map(int,input().split())\r\nx=list(map(int,input().split()))\r\nif sum(x)+(n-1)*10>m:\r\n print(-1)\r\nelse:\r\n m=(m-sum(x))//5\r\n print(m)", "n,d=map(int,input().split())\r\nnum=list(map(int,input().split()))\r\nsum=0\r\nfor i in num:\r\n sum+=i\r\nif(sum+(n-1)*10>d):\r\n print(-1)\r\nelse:\r\n print(int((d-sum)/5))\r\n", "songs,max_time=map(int,input().split())\r\nsongs_length=list(map(int,input().split()))\r\ntime_required=sum(songs_length)+(songs-1)*10\r\nif(time_required>max_time):\r\n print(-1)\r\nelse:\r\n print((songs-1)*2+(max_time-time_required)//5) ", "\r\nn,d = map(int,input().split())\r\n\r\na=list(map(int,input().split()))\r\n\r\nif d < (sum(a) + (len(a)-1)*10):\r\n print(-1)\r\n\r\nelse:\r\n x=(d-sum(a))//5\r\n\r\n print(x)\r\n", "n,d=map(int, input().split())\nt=list(map(int, input().split()))\nif (sum(t)+(n-1)*10)>d:\n print(-1)\nelse:\n print((d-sum(t))//5)\n ", "I=lambda:map(int,input().split());n,d=I();a=sum(I())+(n-1)*10;print((n-1)*2+(d-a)//5if d>=a else-1)", "import sys\r\n\r\ndef main():\r\n n, d, *l = map(int, sys.stdin.read().strip().split())\r\n t = sum(l) + 10*(len(l)-1)\r\n if t > d: return -1\r\n return (len(l) - 1)*2 + (d - t)//5\r\n\r\nprint(main())", "from sys import exit\r\n\r\ninfo = input().split()\r\nn = int(info[0])\r\nd = int(info[1])\r\nsongs = input().split()\r\nsum = 0\r\n\r\nfor i in range(n):\r\n songs[i] = int(songs[i])\r\n sum += songs[i]\r\n\r\nif sum + 10*(n-1) > d:\r\n print(-1)\r\nelse:\r\n jokenum = (d - sum)/5\r\n print(int(jokenum))\r\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nif (sum(a)+10*(n-1))>k:\r\n print(-1)\r\nelse :\r\n print((k-sum(a))//5)\r\n\r\n", "n,d=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=0\r\nc=0\r\nfor i in a:\r\n b+=i+10\r\n c+=10\r\n\r\nb-=10\r\nc-=10\r\nf=d-b+c\r\nif b>d:\r\n print(-1)\r\n\r\nelse:\r\n print(f//5)", "n,d = map(int,input().split())\nt = list(map(int, input().split()))\n\nm = (n-1)*10 + sum(t)\n\nif m>d:\n\tprint(-1)\nelif m==d:\n\tprint((n-1)*2)\nelse:\n\tprint((n-1)*2 + (d-m)//5)", "n,d=[int(x) for x in input().split()]\r\nl=[int(x) for x in input().split()]\r\ncount=0\r\ni=0\r\nif d<sum(l)+10*(len(l)-1):\r\n print(-1)\r\nelse:\r\n while d>0 and i<len(l):\r\n d-=l[i]\r\n if d==0:\r\n print(count)\r\n break\r\n count=count+1 if d-5>=0 else count\r\n d-=5\r\n if d<=0:\r\n print(count)\r\n break\r\n count=count+1 if d-5>=0 else count\r\n d-=5\r\n if d<=0:\r\n print(count)\r\n break\r\n i+=1\r\nif d>0 and i==len(l):\r\n count+=d//5\r\n print(count)\r\n ", "n, t = map(int, input().split())\r\nx = (t - sum(list(map(int, input().split())))) // 5\r\nprint(-1 if n * 2 - 2 > x else x)", "n,d = map(int,input().split())\nk = list(map(int,input().split()))\n\nif (sum(k)+(n-1)*10) > d:\n\tprint(\"-1\")\n\nelse:\n\tprint((d-sum(k))//5)", "n,d=map(int,input().split())\r\nt=list(map(int,input().split()))\r\nk0=sum(t)\r\nk1=(n-1)*10\r\nif k0+k1>d:\r\n print(-1)\r\nelse:\r\n time_left=d-k0\r\n print(time_left//5)", "# import sys\r\n# sys.stdin = open(\"test.in\",\"r\")\r\n# sys.stdout = open(\"test.out\",\"w\")\r\nn,d=map(int,input().split())\r\na=list(map(int,input().split()))\r\nif d-sum(a) >= 10*(n-1):\r\n\tprint((d-sum(a))//5)\r\nelse:\r\n\tprint(-1)\r\n", "n,d=map(int,input().split())\r\nlist1=list(map(int,input().split()))\r\ns=(n-1)*10\r\ns+=sum(list1)\r\nif(s>d):\r\n print(-1)\r\nelse:\r\n d-=sum(list1)\r\n print(d//5)", "n,d = map(int,input().split())\r\nt = list(map(int,input().split()))\r\na = d - sum(t)- (n-1)*10\r\nif a < 0:\r\n print(-1)\r\nelse:\r\n print((d-sum(t))//5)\r\n", "n, d = map(int, input().split())\r\nmusic = list(map(int, input().split()))\r\ntime = 0\r\nfor i in range(n):\r\n time += music[i] + 10\r\ntime -= 10\r\nif d < time:\r\n print(-1)\r\nelse:\r\n print((2*n-2) + ((d - time)//5))\r\n", "a,b = (int(x) for x in input().split())\r\nlst = [int (x) for x in input().split()]\r\nv=0\r\nv=(len(lst)-1)*10+sum(lst)\r\nif v>b:\r\n print(\"-1\")\r\nelse:\r\n print((len(lst)-1)*2+(b-v)//5)\r\n", "n,d = [int(x) for x in input().split()]\r\n\r\na = [int(x) for x in input().split()]\r\n\r\ns=0\r\nfor i in range(n):\r\n s+=a[i]\r\nx=s+(n-1)*10\r\nif(d<x):\r\n print(\"-1\")\r\nelse:\r\n l=d-x\r\n m=l/5\r\n print(int(2*(n-1)+m))", "n , m = map(int , input().split())\r\ns = [int(i) for i in input().split()]\r\nprint(\"-1\" if (n-1)*10+sum(s) > m else (m-sum(s))//5)", "n, d = map(int, input().split())\r\n\r\ntimes = list(map(int, input().split()))\r\n\r\nif sum(times)+ (10*(n-1))>d:\r\n print(-1)\r\nelse:\r\n d-= sum(times)\r\n print(d//5)\r\n\r\n", "n,d=map(int,input().split())\r\na=list(map(int,input().split()))\r\ns=sum(a)\r\ns+=((n-1)*10)\r\nif s<=d:\r\n\tk=(n-1)*2\r\n\tz=d-s\r\n\tk+=(int(z//5))\r\n\tprint(k)\r\nelse:\r\n\tprint(-1)", "i=lambda:map(int,input().split());n,d=i();d-=sum(i());print([d//5,-1][d<10*~-n])", "import math\r\n\r\ntry:\r\n B = list(map(int, input().split()))\r\n N = B[0]\r\n D = B[1]\r\n #print(\"B: \" + str(B))\r\n A = list(map(int, input().split()))\r\n if ((N - 1) * 10 + sum(A)) > D:\r\n print(\"-1\")\r\n else:\r\n rem = D - sum(A)\r\n print(math.floor(rem / 5))\r\nexcept:\r\n print(\"000\")\r\n", "n,d=map(int,input().split())\r\ntime=list(map(int,input().split()))\r\njoke=0\r\nadd=sum(time)\r\ngap=(n-1)*10\r\nif((gap+add)<=d):\r\n d=d-add\r\n joke=d//5\r\n print(joke)\r\nelse:\r\n print(\"-1\")", "n,d=map(int,input().split())\r\narr=list(map(int,input().split()))\r\ns=sum(arr)\r\ns=s+(n-1)*10\r\nif(s>d):\r\n print(\"-1\")\r\nelse:\r\n res=(n-1)*2\r\n res=res+(d-s)//5\r\n print(res)\r\n ", "#.*?\\n\n#from collections import Counter\n#from collections import defaultdict\n#from collections import deque\n\n# BIT_MANIPULATION\n# def intToBin(num:int): return \"{0:b}\".format(num)\n# def binToInt(bin:str)->int: return int(bin,2)\n\n# INPUT\ndef inpNum(): return int(input())\ndef inpNums(): return map(int,input().split())\ndef inpList(): return list(map(int,input().split()))\n# def inpMatrix(rows): return [list(map(int, input().split())) for _ in range(rows)]\n\n\n# problem code:\n\nn,d = inpNums()\nni = inpList()\nttl = sum(ni)\ntttl= ttl + (len(ni)-1)*10\n\nif tttl > d: print(-1)\nelse:\n tttl = d-ttl\n print(tttl//5)", "n,d=map(int,input().split())\r\narr=list(map(int,input().split()))\r\ns=sum(arr)\r\nif d<(s+10*(n-1)):\r\n\tprint(-1)\r\nelse:\r\n\tx=int((d-(s+10*(n-1)))/5)\r\n\tprint(x+2*(n-1))", "inp = input(\"\")\r\nn, d = [int(i) for i in inp.split()]\r\nt = input(\"\")\r\nt_lst = [int(i) for i in t.split()]\r\ndev = sum(t_lst)\r\ndev_ttl = dev + (n-1)*10\r\n\r\nif dev_ttl <= d:\r\n jokes = (d-dev)//5\r\nelse:\r\n jokes = -1\r\n\r\nprint(jokes)", "n,d=map(int,input().split())\r\na=list(map(int,input().split()))\r\n\r\ntotal=d-sum(a)\r\nx=sum(a)+(n-1)*10\r\nif x<=d:\r\n print(total//5)\r\nelse:\r\n print(-1)\r\n\r\n \r\n\r\n", "numberOfSongs , duration = [int(x) for x in input().split(\" \")]\r\nsongs = [int(x) for x in input().split(\" \")]\r\n\r\ntotalRest = (numberOfSongs - 1) * 10\r\nfreeTime = duration - (totalRest + sum(songs))\r\n\r\nif freeTime < 0:\r\n out = -1\r\nelse:\r\n out = (freeTime+totalRest)//5\r\nprint(out)", "# 439A - Devu, the Singer and Churu, the Joker\r\n[n, d], l = list(map(int, input().split())), sum(\r\n list(map(int, input().split())))\r\nif d < (l+(n-1)*10):\r\n print(-1)\r\nelse:\r\n print((d-l)//5)\r\n", "def main():\r\n first_input = list(map(lambda x: int(x), input().split(\" \")))\r\n second_input = list(map(lambda x: int(x), input().split(\" \")))\r\n time_rest = (first_input[0] - 1) * 10\r\n time_event = first_input[1]\r\n time_music = sum(second_input)\r\n time_left = time_event - time_music - time_rest\r\n if time_left < 0:\r\n return -1\r\n number_jok = time_rest / 5 + time_left / 5\r\n return int(number_jok)\r\nprint(main())", "a,b=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\nd=sum(c)+(len(c)-1)*10\r\nif(d>b):\r\n print(-1)\r\nelse:\r\n print((b-sum(c))//5)\r\n", "i = lambda: map(int, input().split()) \nn, d = i()\nd -= sum(i())\nprint( [d//5, -1][d<(n-1)*10] )\n\n\t\t\t\t \t\t \t\t \t \t \t \t\t", "def singer(n,d,array):\r\n restingTime=(n-1)*10\r\n totalLengthOfAllSongs=0\r\n for length in array:\r\n totalLengthOfAllSongs+=length\r\n if totalLengthOfAllSongs+restingTime>d:\r\n return -1\r\n else :\r\n return (d-totalLengthOfAllSongs)//5\r\n\r\ninput1=list(map(int,input().split() ))\r\nn=input1[0]\r\nd=input1[1]\r\narray=list(map(int,input().split()))\r\n\r\nprint(singer(n,d,array))\r\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nif (sum(a)+10*(n-1))>k:print(-1)\r\nelse :print((k-sum(a))//5)\r\n\r\n", "n, m = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nif sum(arr)+(n-1)*10>m:print(-1)\r\nelse:print(((n-1)*2)+((m-(sum(arr)+(n-1)*10))//5))", "n,k = map(int, input().split())\r\nl = list(map(int, input().split()))\r\na = 0\r\nfor i in l:\r\n a+=i\r\nif(a+10*(n-1)>k):print(-1)\r\nelse: print((k-a)//5)", "i=lambda:map(int,input().split()) \r\nn,d=i()\r\nd-=sum(i())\r\nprint([d//5,-1][d+10<10*n])", "n, d = map(int, input().split())\r\n\r\narr = list(map(int, input().split()))\r\ntotal = 0\r\nfor i in range(n):\r\n total += arr[i]\r\n \r\nrem = d - total\r\n\r\nif (rem < (n-1) * 10):\r\n print (-1)\r\n\r\nelse:\r\n print (rem // 5 )\r\n \r\n \r\n\r\n\r\n\r\n \r\n ", "n, d = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nx = sum(a)\r\nans = 0\r\nif (x + (n - 1)*10) > d:\r\n print(-1)\r\nelse:\r\n print((d - x)//5)", "n, d = map(int, input().split())\r\ntime = [int(i) for i in input().split()]\r\ndevu = sum(time) + (n - 1)*10\r\nif devu > d:\r\n print(-1)\r\nelse:\r\n print((n - 1)*2 + (d - devu) // 5)\r\n\r\n\r\n\r\n", "n,d=list(map(int,input().split()))\r\ny=list(map(int,input().split()))\r\nb=10*(n-1)\r\nm=b+sum(y)\r\nif d<m:\r\n print(-1)\r\nelse :\r\n print(b//5+(d-m)//5)", "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\n#input = iter(sys.stdin.buffer.read().decode().splitlines()).__next__\r\nilele = lambda: map(int,input().split())\r\nalele = lambda: list(map(int, input().split()))\r\nilelec = lambda: map(int1,input().split())\r\nalelec = lambda: list(map(int1, input().split()))\r\ndef list2d(a, b, c): return [[c] * b for i in range(a)]\r\ndef list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]\r\n#MOD = 1000000000 + 7\r\ndef Y(c): print([\"NO\",\"YES\"][c])\r\ndef y(c): print([\"no\",\"yes\"][c])\r\ndef Yy(c): print([\"No\",\"Yes\"][c])\r\n\r\nn,d = ilele()\r\nA = alele()\r\nif sum(A) + (n-1)*10 > d:\r\n print(-1)\r\nelse:\r\n c = 0\r\n while A:\r\n x = A.pop()\r\n d-=x\r\n c += min(d//5,2)\r\n d -= 10\r\n if d > 0:\r\n c += d//5\r\n print(c)\r\n \r\n ", "def solve(arr,n,d):\n res = sum(arr)\n if res + (n-1)*10 > d:\n return -1\n return (d-res)//5\n \n \ndef main():\n n,d = list(map(int, input().split(' ')))\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,d))\n\n\nmain()", "n, t = map(int, input().split())\r\narr = list(map(int, input().split()))\r\ntotal = sum(arr)\r\n\r\nbr = (n-1)*10\r\ndiff = total + br\r\n\r\nprint(-1 if t < diff else (t-total)//5)", "n,k = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nif (sum(l)+10*(n-1))>k:\r\n print(-1)\r\nelse:\r\n print((n-1)*2+(k-(sum(l)+10*(n-1)))//5)\r\n", "n,d=map(int,input().split())\r\nseconds=list(map(int,input().split()))\r\nif d-sum(seconds)-(n-1)*10<0:\r\n print(-1)\r\nelif d-sum(seconds)-(n-1)*10==0:\r\n print((n-1)*2)\r\nelse:\r\n sumd=d-sum(seconds)-(n-1)*10\r\n k=(n-1)*2\r\n sumd=sumd//5\r\n k=k+sumd\r\n print(k)", "n,d=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nmin=10*(len(l)-1)\r\n\r\nfor item in l:\r\n min=min+item\r\n \r\nif min>d:\r\n print(\"-1\")\r\n\r\nelse:\r\n jokes=int((d-min)/5)+int(10*(len(l)-1)/5)\r\n print(jokes)\r\n", "def joke(n, k, ls):\r\n s = sum(ls) + ((n - 1) * 10)\r\n if(s <= k):\r\n h = k - sum(ls)\r\n return int(h / 5)\r\n else:\r\n return -1\r\n\r\nn, k = input().split()\r\nk = int(k)\r\nn = int(n)\r\nls = [int(i) for i in input().split()]\r\nprint(joke(n, k, ls))", "n,d=map(int,input().split())\r\na=list(map(int,input().split()))\r\nx=sum(a)\r\ny=d-x\r\nif(y>=(n-1)*10):\r\n print(y//5)\r\nelse:\r\n print(\"-1\")\r\n", "n,d=map(int,input().split())\r\ns=list(map(int,input().split()))\r\n\r\nprint(-1 if (d-sum(s)-(n-1)*10)<0 else (n-1)*2+(d-sum(s)-(n-1)*10)//5)", "n,m=map(int,input().split())\r\na=input().split()[:n]\r\nsum=0\r\nfor i in range(len(a)):\r\n sum+=int(a[i])\r\nn=n-1\r\nif (m<(10*n)+sum):\r\n print(-1)\r\nelse:\r\n min=m-sum\r\n print(int(min//5))", "def rest(d,count):\r\n\td-=10\r\n\tcount+=2\r\n\treturn d,count\r\nn,d=map(int,input().split())\r\ncount=0\r\ntt=[int(x) for x in input().split()]\r\nfor song in range(len(tt)):\r\n\tif song==n-1:\r\n\t\td-=tt[song]\r\n\t\tcount+=int(d/5)\r\n\telse: \r\n\t\td-=tt[song]\r\n\t\td,count=rest(d,count)\r\n\t# print(d,count)\r\n\tif d<0:\r\n\t\tcount=-1\r\n\t\tbreak\r\nprint(count)\r\n", "n,d=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nss=sum(l)\r\ns=sum(l)+(n-1)*10\r\nif(s>d):\r\n print(-1)\r\nelse:\r\n x=d-ss\r\n print(x//5)\r\n", "from sys import stdin, stdout\r\nn, d = map(int, stdin.readline().strip().split())\r\narray = list(map(int, stdin.readline().strip().split()))\r\nmin_time = sum(array) + 10*(len(array) - 1)\r\nif min_time>d:\r\n songs = -1\r\nelse:\r\n songs = (10*(n-1)//5) + (d-min_time)//5\r\nstdout.write(f\"{songs}\\n\")", "n,m = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nif (sum(l)+10*(n-1))>m:\r\n print('-1')\r\nelse:\r\n print((m-sum(l))//5)\r\n", "n,m=[int(i) for i in input().split()]\r\nc=[int(i) for i in input().split()]\r\ns=0\r\nd=sum(c)\r\ne=(n-1)*10\r\nd=d+e\r\nif(d>m):\r\n print(-1)\r\nelse:\r\n e=e//10\r\n f=e*2\r\n h=((m-d)//5)\r\n print(h+f)", "n, d = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nbn = (n - 1) << 1\r\nx = d - sum(a) - 5 * bn\r\nif x < 0:\r\n print('-1')\r\nelse:\r\n print(bn + (x // 5))", "n,d=map(int,input().split())\r\na=list(map(int,input().split()))\r\nif sum(a)+2*(n-1)*5>d:\r\n print(-1)\r\nelse:\r\n print((d-sum(a))//5)\r\n", "def solve():\r\n n,d = map(int, input().split())\r\n t = list(map(int, input().split()))\r\n if (10 * (n-1)) + sum(t) > d:\r\n return -1\r\n else:\r\n return (d - sum(t)) // 5\r\n \r\n\r\n\r\nprint(solve())", "n,d = [int(x) for x in input().split()]\r\nt = [int(x) for x in input().split()]\r\nif (n-1)*10 + sum(t) > d:print(-1)\r\nelif (n-1)*10 + sum(t) == d: print((n-1)*2)\r\nelse: print((n-1)*2 + (d - (n-1)*10 - sum(t))//5)", "n, d = map(int, input().split())\nt = list(map(int, input().split()))\ntotal_time = ((n - 1) * 10) + (sum(t))\nif total_time > d:\n\tprint(-1)\nelse:\n\tc_jokes = (n - 1) * 2\n\tc_jokes += (d - total_time) // 5\n\tprint(c_jokes)" ]

[ "# https://codeforces.com/problemset/problem/358/C\n# Solution credits (Adapted from C++): Sujoy Ghosh\n\ndef solve():\n n = int(input())\n\n inputs = ['pushStack', 'pushQueue', 'pushFront', 'pushBack']\n outputs = ['popStack', 'popQueue', 'popFront', 'popBack']\n\n v = []\n\n for _ in range(n):\n a = int(input())\n\n if a == 0:\n if len(v) <= 3:\n for i in range(len(v)):\n print(inputs[i])\n\n print(str(len(v)) + (' ' + ' '.join(outputs[:len(v)]) if v else ''))\n v.clear()\n continue\n \n # sort by a-values, keeping track of original insertion index\n v.sort()\n a_id = [0] * len(v)\n \n # map from origin index to index in sorted list\n for i, (_a, a_idx) in enumerate(v):\n a_id[a_idx] = i\n\n for i in range(len(v)):\n # front of deque if third largest\n if a_id[i] == len(v) - 3:\n print(inputs[2])\n # add to deque if second largest\n elif a_id[i] == len(v) - 2:\n print(inputs[1])\n # add to top of stack if largest\n elif a_id[i] == len(v) - 1:\n print(inputs[0])\n # otherwise add to back of deque\n else:\n print(inputs[3])\n \n print('3 ' + ' '.join(outputs[:3]))\n v.clear()\n else:\n v.append((a, len(v)))\n\n for _ in range(len(v)):\n print(inputs[0])\n\nsolve()", "n = int(input())\r\ni = 0\r\nwhile i < n:\r\n a = []\r\n c = int(input())\r\n i += 1\r\n while (c != 0 and i < n):\r\n a.append(c)\r\n i += 1\r\n c = int(input())\r\n if (c != 0):\r\n for j in range(len(a) + 1):\r\n print('pushStack')\r\n continue\r\n if len(a) == 0:\r\n print(0)\r\n elif len(a) == 1:\r\n print('pushStack')\r\n print(1, 'popStack')\r\n elif len(a) == 2:\r\n print('pushStack')\r\n print('pushQueue')\r\n print(2, 'popStack popQueue') \r\n elif len(a) == 3:\r\n print('pushStack')\r\n print('pushQueue')\r\n print('pushBack')\r\n print(3, 'popStack popQueue popBack')\r\n else:\r\n b = [0] * len(a)\r\n for j in range(len(a)):\r\n b[j] = a[j]\r\n b.sort()\r\n x1 = b[-1]; x2 = b[-2]; x3 = b[-3]\r\n for j in a:\r\n if j == x1:\r\n print('pushStack')\r\n x1 = -1\r\n elif j == x2:\r\n print('pushQueue')\r\n x2 = -1\r\n elif j == x3:\r\n print('pushBack')\r\n x3 = -1\r\n else:\r\n print('pushFront')\r\n print(3, 'popStack popQueue popBack')", "# Author Name: Ajay Meena\r\n# Codeforce : https://codeforces.com/profile/majay1638\r\nimport sys\r\nimport math\r\nimport bisect\r\nimport heapq\r\nfrom bisect import bisect_right\r\nfrom sys import stdin, stdout\r\n\r\n# -------------- INPUT FUNCTIONS ------------------\r\n\r\n\r\ndef get_ints_in_variables(): return map(\r\n int, sys.stdin.readline().strip().split())\r\n\r\n\r\ndef get_int(): return int(sys.stdin.readline())\r\n\r\n\r\ndef get_ints_in_list(): return list(\r\n map(int, sys.stdin.readline().strip().split()))\r\ndef get_list_of_list(n): return [list(\r\n map(int, sys.stdin.readline().strip().split())) for _ in range(n)]\r\n\r\n\r\ndef get_string(): return sys.stdin.readline().strip()\r\n\r\n# -------- SOME CUSTOMIZED FUNCTIONS-----------\r\n\r\n\r\ndef myceil(x, y): return (x + y - 1) // y\r\n\r\n# -------------- SOLUTION FUNCTION ------------------\r\n\r\n\r\ndef Solution():\r\n # Write Your Code Here\r\n n = get_int()\r\n arr = [get_int() for _ in range(n)]\r\n u = [0 for _ in range(n)]\r\n hp = []\r\n # print(arr,\"arr\")\r\n for i, x in enumerate(arr):\r\n if x:\r\n heapq.heappush(hp, (-x, i))\r\n else:\r\n for t in [1, 2, 3]:\r\n if len(hp) > 0:\r\n x, j = heapq.heappop(hp)\r\n u[j] = t\r\n u[i] += 1\r\n hp = []\r\n push = ['pushBack', 'pushStack', 'pushQueue', 'pushFront']\r\n pop = ['popStack', 'popQueue', 'popFront']\r\n for i, x in enumerate(arr):\r\n if x:\r\n print(push[u[i]])\r\n else:\r\n if u[i]:\r\n print(str(u[i])+\" \"+\" \".join(pop[:u[i]]))\r\n else:\r\n print(\"0\")\r\n\r\n\r\ndef main():\r\n # Take input Here and Call solution function\r\n Solution()\r\n\r\n\r\n# calling main Function\r\nif __name__ == '__main__':\r\n main()\r\n", "i, n = 0, int(input())\r\ns = ['pushQueue'] * n\r\na, b, c = ' popQueue', ' popStack', ' popBack'\r\np = ['0', '1' + a, '2' + a + b, '3' + a + b + c]\r\nt = []\r\nfor j in range(n):\r\n x = int(input())\r\n if x:\r\n t.append((x, j))\r\n continue\r\n t = sorted(k for x, k in sorted(t)[-3:])\r\n k = len(t)\r\n if k > 0: s[i: t[0]] = ['pushStack'] * (t[0] - i)\r\n if k > 1: s[t[1]] = 'pushStack'\r\n if k > 2: s[t[2]] = 'pushBack'\r\n i, t, s[j] = j + 1, [], p[k]\r\nprint('\\n'.join(s))", "import sys\r\nimport math\r\nfrom sys import stdin, stdout\r\nimport heapq\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 = int(input())\r\n arr = [get_int() for _ in range(n)]\r\n u = [0 for _ in range(n)]\r\n hp = []\r\n # print(arr,\"arr\")\r\n for i, x in enumerate(arr):\r\n if x:\r\n heapq.heappush(hp, (-x, i))\r\n else:\r\n for t in [1, 2, 3]:\r\n if len(hp) > 0:\r\n x, j = heapq.heappop(hp)\r\n # print(\"x,j\", x,j)\r\n # j is index of push element t is operation of push type\r\n u[j] = t\r\n # u[i] += 1 means popped element increase by one max is 3\r\n u[i] += 1\r\n hp = []\r\n # print(u)\r\n push = ['pushBack', 'pushStack', 'pushQueue', 'pushFront']\r\n pop = ['popStack', 'popQueue', 'popFront']\r\n for i, x in enumerate(arr):\r\n if x:\r\n print(push[u[i]])\r\n else:\r\n if u[i]:\r\n print(str(u[i])+\" \"+\" \".join(pop[:u[i]]))\r\n else:\r\n print(\"0\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n# calling main Function\r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\nlast_zero, largest, nd_largest, rd_largest = -1, -1, -1, -1\narr = [int(input()) for _ in range(n)]\nfor i in range(n):\n if arr[i] == 0:\n filled_stk, filled_queue, filled_front = False, False, False\n for j in range(last_zero + 1, i):\n if arr[j] == largest and not filled_stk:\n filled_stk = True\n print('pushStack')\n elif arr[j] == nd_largest and not filled_queue:\n filled_queue = True\n print('pushQueue')\n elif arr[j] == rd_largest and not filled_front:\n filled_front = True\n print('pushFront')\n else:\n print('pushBack')\n print(int(filled_stk) + int(filled_queue) + int(filled_front), end='')\n if filled_stk:\n print(' popStack', end='')\n if filled_queue:\n print(' popQueue', end='')\n if filled_front:\n print(' popFront', end='')\n print('\\n', end='')\n last_zero = i\n largest = nd_largest = rd_largest = -1\n else:\n if arr[i] >= largest:\n largest, nd_largest, rd_largest = arr[i], largest, nd_largest\n elif arr[i] >= nd_largest:\n nd_largest, rd_largest = arr[i], nd_largest\n elif arr[i] > rd_largest:\n rd_largest = arr[i]\nfor i in range(last_zero + 1, n):\n print('pushStack')" ]

[ "n, m, k = map(int, input().split())\r\nh = [0]*(n+1)\r\nfor i in map(int, input().split()):\r\n h[i] = 1\r\npos = 1\r\nimport sys\r\nif h[1]:\r\n print(1)\r\n sys.exit()\r\nfor _ in range(k):\r\n a, b = map(int, input().split())\r\n if pos == a:\r\n pos = b\r\n if h[b]:\r\n print(b)\r\n sys.exit()\r\n elif pos == b:\r\n pos = a\r\n if h[a]:\r\n print(a)\r\n sys.exit()\r\nprint(pos)\r\n", "inl = lambda: list(map(int, input().split()))\r\n\r\nn, m, k = inl()\r\nh = set(inl())\r\nb = 1\r\nif b not in h:\r\n for _ in range(k):\r\n u, v = inl()\r\n if b == u or b == v:\r\n b = u if b == v else v\r\n if {u, v} & h:\r\n break\r\nprint(b)\r\n", "R= lambda: map(int, input().split())\r\nn,m,k= R()\r\ndic={}\r\nhole=list(R())\r\nfor i in range(n):\r\n dic[i]=0\r\nfor i in hole:\r\n dic[i-1]=1\r\nb=0\r\nif 1 in hole:\r\n print(\"1\")\r\n exit()\r\nfor i in range(k):\r\n x,y=R()\r\n if b==x-1: b=y-1\r\n elif b==y-1: b=x-1\r\n if dic[b]==1: print(b+1),exit()\r\nprint(b+1)", "[cups, holes, moves] = list(map(int, input().split(' ')))\n\ncupsPositions = [('', 0)]*cups\n\nholesPositions = list(map(int, input().split(' ')))\nfor i in holesPositions:\n cupsPositions[i-1] = ('', 1)\n\nbonePosition = 0\nfinalPosition = None\ncupsPositions[0] = ('B', cupsPositions[0][1])\n\nif(cupsPositions[0][1] == 1):\n bonePosition = 0\n finalPosition = 0\n\nfor m in range(0, moves):\n [toCup, fromCup] = list(map(int, input().split(' ')))\n if(finalPosition != None):\n continue\n\n if(cupsPositions[toCup - 1][0] == 'B' and cupsPositions[fromCup - 1][1] == 1):\n bonePosition = fromCup - 1\n cupsPositions[fromCup - 1] = ('B', cupsPositions[fromCup - 1][1])\n cupsPositions[toCup - 1] = ('', cupsPositions[toCup - 1][1])\n finalPosition = bonePosition\n elif(cupsPositions[toCup - 1][0] == 'B'):\n bonePosition = fromCup - 1\n cupsPositions[fromCup - 1] = ('B', cupsPositions[fromCup - 1][1])\n cupsPositions[toCup - 1] = ('', cupsPositions[toCup - 1][1])\n\n elif(cupsPositions[fromCup - 1][0] == 'B' and cupsPositions[toCup - 1][1] == 1):\n bonePosition = toCup - 1\n cupsPositions[toCup - 1] = ('B', cupsPositions[toCup - 1][1])\n cupsPositions[fromCup - 1] = ('', cupsPositions[fromCup - 1][1])\n finalPosition = bonePosition\n elif(cupsPositions[fromCup - 1][0] == 'B'):\n bonePosition = toCup - 1\n cupsPositions[toCup - 1] = ('B', cupsPositions[toCup - 1][1])\n cupsPositions[fromCup - 1] = ('', cupsPositions[fromCup - 1][1])\n\nif(finalPosition != None):\n print(finalPosition + 1)\nelse:\n print(bonePosition + 1)\n", "n, m, k = map(int, input().split(' '))\r\n# n -> number of cups\r\n# m -> number of holes\r\n# k -> number of swapping operations\r\n\r\nh = [int(i) for i in input().split(' ')]\r\nh = set(h)\r\nbone_pos = 1\r\nfor _ in range(k):\r\n a,b = map(int,input().split(' '))\r\n if bone_pos not in h:\r\n if a == bone_pos:\r\n bone_pos = b\r\n elif b == bone_pos:\r\n bone_pos = a\r\nprint(bone_pos)\r\n\r\n", "leitura = input().split()\nnum_copos = int(leitura[0])\nposicao = []\nfor i in range(num_copos):\n posicao.append(False)\nnum_buracos = int(leitura[1])\nqtd_operacoes = int(leitura[2])\npos_osso = 1\ncaiu = False\nburacos = input().split()\nfor i in buracos:\n posicao[int(i) - 1] = True\nfor i in range(len(buracos)):\n buracos[i] = int(buracos[i])\nfor i in range(qtd_operacoes):\n if posicao[pos_osso - 1]:\n caiu = True\n break\n operacao = input().split()\n if not caiu and (int(operacao[0]) == pos_osso or int(operacao[1]) == pos_osso):\n if int(operacao[1]) == pos_osso:\n pos_osso = int(operacao[0])\n else:\n pos_osso = int(operacao[1])\nprint(pos_osso)\n", "n,m,k=map(int,input().split())\r\nl=[x for x in range(1,n+1)]\r\nbone=1\r\nholes=[0]*(n+1)\r\nfor h in map(int, input().split()):\r\n holes[h] = 1\r\nbone=1\r\nfor i in range(k):\r\n f,t=map(int,input().split())\r\n if f==bone and holes[f]==0:\r\n bone=t\r\n elif t==bone and holes[t]==0:\r\n bone=f\r\nprint(bone)\r\n\r\n", "n, m, k = map(int, input().split())\r\nA = set(map(int, input().split()))\r\nprex = 1\r\nfor i in range(k):\r\n x, y = map(int, input().split())\r\n if prex not in [x,y]:\r\n continue\r\n if prex == x and x in A:\r\n print(x)\r\n break\r\n elif prex == y and y in A:\r\n print(y)\r\n break\r\n prex = y if y != prex else x\r\nelse:\r\n print(prex)\r\n", "n, m, k = map(int, input().split())\r\nholes = set(int(hole) for hole in input().split())\r\nx = 1\r\nfor i in range(k):\r\n if x in holes:\r\n break\r\n u, v = map(int, input().split())\r\n if u == x:\r\n x = v\r\n elif v == x:\r\n x = u\r\nprint(x)\r\n", "n, m, k = map(int, input().split())\na = [0] + list(map(int, input().split()))\nb = [0] * (n + 1);\nfor x in a:\n b[x] = 1\nend = False\nnow = 1\nwhile k:\n if b[now]:\n end = True\n x, y = map(int, input().split())\n if (now == x or now == y) and not end:\n now = x + y - now\n k -= 1\nprint(now)\n\t\t\t\t\t\t \t\t\t\t \t \t \t\t \t\t \t \t", "import sys\r\n\r\ninp = sys.stdin.read()\r\ninp = inp.split('\\n')\r\n\r\niters = int(inp[0].split()[2])\r\n\r\nholes = {int(x) for x in inp[1].split()}\r\n\r\ncurrent = 1\r\n\r\nfor i in range(iters):\r\n src, dest = (int(x) for x in inp[i + 2].split())\r\n if current in holes:\r\n break\r\n if current == src:\r\n current = dest\r\n elif current == dest:\r\n current = src\r\nprint(current)", "iters = int(input().split()[2])\r\n\r\nholes = {int(x) for x in input().split()}\r\n\r\ncurrent = 1\r\n\r\nfor _ in range(iters):\r\n src, dest = (int(x) for x in input().split())\r\n if current in holes:\r\n break\r\n if current == src:\r\n current = dest\r\n elif current == dest:\r\n current = src\r\nprint(current)", "n, m, k = map(int, input().split())\nholes = [0] * (n + 1)\nfor h in map(int, input().split()):\n holes[h] = 1\n\ncur = 1\n\nfor i in range(k):\n f, t = map(int, input().split())\n if f == cur and holes[f] == 0:\n cur = t\n elif t == cur and holes[t] == 0:\n cur = f\n\nprint(cur)", "from sys import stdin\r\n#stdin = open(\"sum.in\", 'r')\r\nhat = stdin.readlines()\r\nk = int(hat[0].split()[2])\r\nholes = {int(x) for x in hat[1].split()}\r\npos = 1\r\nfor i in range(k):\r\n a, b = map(int, hat[i+2].split())\r\n if pos in holes:\r\n break\r\n elif pos == a:\r\n pos = b\r\n elif pos == b:\r\n pos = a\r\nprint(pos)\r\n", "def main():\n n, m, k = map(int, input().split())\n mm = [False] * (n + 1)\n for x in map(int, input().split()):\n mm[x] = True\n x = 1\n for _ in range(k):\n if mm[x]:\n break\n u, v = map(int, input().split())\n if x == u:\n x = v\n elif x == v:\n x = u\n print(x)\n\n\nif __name__ == '__main__':\n main()\n", "def parse():\r\n numbers=list(map(int, input().split()))\r\n n=numbers[0] #nombre de cups\r\n k=numbers[2] #nombre de swap\r\n\r\n holes=[False for i in range(n)]\r\n\r\n for hole in list(map(int, input().split())):\r\n holes[hole-1]=True\r\n\r\n swaps=[]\r\n for i in range(k):\r\n swaps.append(list(map(int, input().split())))\r\n\r\n return [n, holes, swaps]\r\n\r\n\r\ndef find_bone(case):\r\n holes= case[1]\r\n swaps= case[2]\r\n\r\n current_bone=1\r\n if(holes[current_bone-1]): return 1\r\n\r\n for swap in swaps:\r\n first= swap[0]\r\n second=swap[1]\r\n if(current_bone == first): current_bone=second\r\n elif(current_bone == second): current_bone=first\r\n\r\n if(holes[current_bone-1]): return current_bone\r\n\r\n return current_bone\r\n\r\ndef solve():\r\n inputs= parse()\r\n print(find_bone(inputs))\r\n\r\nsolve()\r\n", "def intput(): return [int(x) for x in input().split()]\n\ndef main():\n N, M, K = intput()\n buraco = set(intput())\n osso = 1\n for k in range(K):\n if osso in buraco:\n break\n else:\n u, v = intput()\n if u == osso:\n osso = v\n elif v == osso:\n osso = u\n print(osso)\n\n\nmain()\n", "n, m, k = map(int, input().split())\r\nholes = set(map(int, input().split()))\r\np = 1\r\nf = True\r\nfor _ in range(k):\r\n u, v = map(int, input().split())\r\n if not f:\r\n continue\r\n else:\r\n if p in holes:\r\n f = False\r\n break\r\n elif u == p:\r\n p = v\r\n elif v == p:\r\n p = u\r\nprint(p)\r\n", "n, m, k = map(int, input().split())\nh = list(map(int, input().split()))\n\nls = [False for _ in range(n)]\n\nfor i in range(m):\n ls[h[i] - 1] = True\n\nbone = 0\n\nfor i in range(k):\n if ls[bone]:\n break\n\n u, v = map(int, input().split())\n u -= 1\n v -= 1\n \n if bone == u:\n bone = v\n elif bone == v:\n bone = u\n\nprint(bone + 1)\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\n[n, m, k] = list(map(int, input().split()))\r\nh = list(map(int, input().split()))\r\n\r\nvalid = [1 for i in range(n)]\r\nfor i in range(m):\r\n valid[h[i]-1] = 0\r\n\r\npos = 0\r\nfor i in range(k):\r\n [u, v] = list(map(int, input().split()))\r\n u -= 1\r\n v -= 1\r\n if valid[pos] != 0:\r\n if u == pos:\r\n pos = v\r\n elif v == pos:\r\n pos = u\r\nprint(pos+1)\r\n \r\n", "\r\ndef mi():\r\n\treturn map(int, input().split())\r\n\r\n\r\nn,m,k = mi()\r\n\r\nh = list(mi())\r\nhole = [0]*(n+1)\r\nfor i in h:\r\n\thole[i] = 1\r\n\r\nu,v = 0,0\r\ncur = 1\r\nfor i in range(k):\r\n\tu,v = mi()\r\n\tif u==cur and hole[u]==0:\r\n\t\tcur = v\r\n\telif v==cur and hole[v]==0:\r\n\t\tcur = u\r\nprint (cur)", "a=(list(map(int, input().split())))\r\nb=(list(map(int, input().split())))\r\nc=[0]*(a[0]+1)\r\np=1\r\nfor i in range(0,a[1]):\r\n c[b[i]]=1\r\nu=0\r\nfor i in range(0,a[2]):\r\n d=(list(map(int, input().split())))\r\n if d[0]==p or d[1]==p:\r\n if d[0]==p:\r\n if c[d[0]]==1:\r\n p=d[0]\r\n u=1\r\n print(p)\r\n break\r\n else:\r\n p=d[1]\r\n elif d[1]==p:\r\n if c[d[1]]==1:\r\n p=d[1]\r\n u=1\r\n print(p)\r\n break\r\n else:\r\n p=d[0]\r\nif u==0:\r\n print(p)", "from collections import defaultdict\n\n# Take input\nn, m, k = map(int, input().split())\nh = list(map(int, input().split()))\nswaps = []\nfor _ in range(k):\n u, v = map(int, input().split())\n swaps.append((u, v))\n\n# Create a dictionary to support 0(1) lookup\n# for the locations of the holdes\nd = defaultdict(bool)\nfor hole in h:\n d[hole] = True\n\ncurrent_bone_position = 1\nfor move in swaps:\n # If there is bone is over a hole\n if d[current_bone_position]:\n print(current_bone_position)\n exit()\n # Only consider moves that involve the bone\n if current_bone_position in move:\n u, v = move\n current_bone_position = v if current_bone_position == u else u\n\nprint(current_bone_position)\n \n", "\r\nn, m, k = map(int, input().split())\r\nholes = set(map(int, input().split()))\r\np = 1\r\nfor _ in range(k):\r\n f, t = map(int, input().split())\r\n if p in (f, t) and p not in holes:\r\n if p == f:\r\n p = t\r\n else:\r\n p = f\r\n\r\nprint(p)\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\nh = list(map(int, input().split()))\r\ns = [0] * (n + 1)\r\ns[1] = 1\r\nng = [0] * (n + 1)\r\nfor i in h:\r\n ng[i] = 1\r\nans = ng[1]\r\nuv = [tuple(map(int, input().split())) for _ in range(k)]\r\nfor u, v in uv:\r\n if ans:\r\n break\r\n s[u], s[v] = s[v], s[u]\r\n if s[u] and ng[u]:\r\n ans = u\r\n elif s[v] and ng[v]:\r\n ans = v\r\nif not ans:\r\n ans = s.index(1)\r\nprint(ans)", "R = lambda:map(int, input().split())\r\nn, m, k = R()\r\nh = [0] * (n+1)\r\nfor x in R():\r\n h[x] = 1\r\nb = 1\r\nfor _ in range(k):\r\n u,v = R()\r\n if b == u and not h[u]:\r\n b = v\r\n elif b == v and not h[v]:\r\n b = u\r\nprint(b)\r\n", "s = list(map(int,input().split()))\ncups = s[0]\nswapping = s[2]\nl = []\nfor i in range(cups):\n l.append(False)\nholes = list(map(int,input().split()))\np = True\nfor i in holes:\n if i == 1:\n p = False\n break\n l[i-1] = True\naux = 1\nfor i in range(swapping):\n if p:\n swapp = list(map(int,input().split()))\n if swapp[0] == aux:\n if l[swapp[1]-1]:\n p = False\n aux = swapp[1]\n elif swapp[1] == aux:\n if l[swapp[0]-1]:\n p = False\n aux = swapp[0]\n else:\n input()\nprint(aux)\n \t \t \t\t\t \t\t\t \t \t\t \t \t\t\t \t", "n, m, k = map(int, input().split())\r\nm1 = set(map(int, input().split()))\r\ni = 1\r\nfor j in range(k):\r\n u, v = map(int, input().split())\r\n if i in m1:\r\n break\r\n if i == u:\r\n i = v\r\n elif i == v:\r\n i = u\r\nprint(i)\r\n", "n, m, k = map(int,input().split())\r\nh = set(map(int,input().split()))\r\nanswer = 1\r\nfor i in range(k):\r\n u, v =map(int,input().split())\r\n if answer in h: break\r\n if u == answer:\r\n answer = v\r\n else:\r\n if v == answer:answer = u\r\n\r\nprint(answer)", "n,m,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl=set(l)\r\np=1\r\nq=1\r\nif(1 in l):\r\n print(1)\r\n q=-1\r\nif(q>0):\r\n for i in range(k):\r\n a,b=map(int,input().split())\r\n if(a==p):\r\n p=b\r\n elif(b==p):\r\n p=a\r\n if(p in l):\r\n break\r\n print(p)\r\n \r\n ", "import sys\r\n\r\na = list(map(int,input().split()))\r\nn,m,k = a[0],a[1],a[2]\r\n\r\nh = list(map(int,input().split()))\r\nh2 = [0]*(n+1)\r\nfor item in h:\r\n h2[item] = 1\r\n\r\nstore,getone = 1,0\r\n\r\nfor i in range(k):\r\n l,r = map(int,input().split())\r\n\r\n if l == 1 or r == 1:\r\n getone = 1\r\n\r\n if getone == 1 and (l == store or r == store):\r\n if h2[store] == 1:\r\n break\r\n else:\r\n if l == store:\r\n store = r\r\n elif r == store:\r\n store = l\r\nprint(store)\r\n\r\n\r\n\r\n", "import sys\r\ninp = sys.stdin.readlines()\r\n\r\n\r\niters = int(inp[0].strip().split()[2])\r\nholes = {int(x) for x in inp[1].strip().split()}\r\ncurrent = 1\r\nfor i in range(iters):\r\n src, dest = (int(x) for x in inp[i+2].strip().split())\r\n if current in holes:\r\n break\r\n if current == src:\r\n current = dest\r\n elif current == dest:\r\n current = src\r\nprint(current)", "from sys import stdin,stdout \r\nwrite = stdout.write\r\nn,m,k = map(int,stdin.readline().split())\r\nholes = {int(i):0 for i in stdin.readline().split()}\r\nposs = [False]*(n+1)\r\nposs[1] = True\r\nans = 1\r\ntrap = False\r\nmAns = 1\r\nfor i in range(k):\r\n x,y = map(int,stdin.readline().split())\r\n if poss[x]:\r\n if x in holes:\r\n trap = True\r\n mAns = x\r\n else:\r\n poss[x] = False\r\n poss[y] = True\r\n ans = y\r\n \r\n elif poss[y]:\r\n if y in holes:\r\n trap = True\r\n mAns = y\r\n else:\r\n poss[y] = False\r\n poss[x] = True\r\n ans = x\r\nif trap:\r\n write(str(mAns)+'\\n')\r\nelse:\r\n write(str(ans)+'\\n')", "def solve():\r\n n,hi,s = map(int,input().split())\r\n h = set(list(map(int,input().split())))\r\n pre = 1\r\n for i in range(s):\r\n x1,x2 = map(int,input().split())\r\n if pre in h:\r\n return print(pre)\r\n if x1 == pre:\r\n pre = x2\r\n elif x2 == pre:\r\n pre = x1\r\n return print(pre)\r\nsolve()\r\n \r\n", "x = input().split(' ')\r\ny = input().split(' ')\r\n\r\nx = list(map(int, x))\r\ny = list(map(int, y))\r\n\r\na = [True] * x[0]\r\n\r\npair = []\r\n\r\nfor i in range(len(y)):\r\n a[y[i]-1] = False\r\n\r\nfor i in range(x[2]):\r\n z = input().split(' ')\r\n z = list(map(int, z))\r\n pair.append(z)\r\n\r\nif a[0] == False:\r\n #if initial position is a hole, the bone falls, don't need check the swap \r\n print(1)\r\nelse:\r\n # the position of the bone\r\n cur = 1\r\n\r\n for i in range(len(pair)):\r\n\r\n # swap cup has bone\r\n if pair[i][0] == cur:\r\n #print(pair[i][1])\r\n cur = pair[i][1] \r\n #print(cur)\r\n if a[cur-1] == False:\r\n # there is a hole, don't need to check next\r\n break\r\n \r\n elif pair[i][1] == cur:\r\n #print(pair[i][0])\r\n cur = pair[i][0]\r\n #print(cur)\r\n if a[cur-1] == False:\r\n # there is a hole, don't need to check next\r\n break\r\n\r\n print(cur)\r\n", "n,m,k=tuple(input().split(\" \"))\r\nn=int(n) #pos\r\nm=int(m) #holes\r\nk=int(k) #actions\r\na=[False]*n\r\ncur=1\r\nfor x in input().split(\" \"):\r\n a[int(x)-1]=True\r\n if x is \"1\":\r\n print(1)\r\n exit(0)\r\nfor x in range(k):\r\n b=[int(y) for y in input().split(\" \")]\r\n if b[0]==cur:\r\n cur=b[1]\r\n elif b[1]==cur:\r\n cur=b[0]\r\n if a[cur-1]:\r\n print(cur)\r\n exit(0)\r\nprint(cur)", "n,m,k=map(int,input().split())\r\nholes=set(map(int,input().split()))\r\nans=1\r\nswaps=[]\r\nfor i in range(k):\r\n swaps=list(map(int,input().split()))\r\n if ans in holes:\r\n continue\r\n elif ans==swaps[0]:\r\n ans=swaps[1]\r\n elif ans==swaps[1]:\r\n ans=swaps[0]\r\nprint(ans)", "from sys import stdin\n\nn, m, k = map(int, stdin.readline().split())\nholes = set(map(int, stdin.readline().split()))\n\ncurrent_bone_position = 1\n\nfor _ in range(k):\n if current_bone_position in holes:\n print(current_bone_position)\n exit()\n cup1, cup2 = map(int, stdin.readline().split())\n if cup1 == current_bone_position:\n current_bone_position = cup2\n elif cup2 == current_bone_position:\n current_bone_position = cup1\n\nprint(current_bone_position) ", "from sys import stdin\n\n\ndef main():\n s, t, *l = stdin.read().splitlines()\n mm, x = set(t.split()), \"1\"\n while not (l[-1]):\n del l[-1]\n for u, v in map(str.split, l):\n if x in mm:\n break\n if x == u:\n x = v\n elif x == v:\n x = u\n print(x)\n\n\nif __name__ == '__main__':\n main()\n", "n, m, k = map(int, input().split())\nholes = set(map(int, input().split()))\npos = 1\nfor i in range(k):\n\tif pos in holes:\n\t\tbreak\n\tinicio, fim = map(int, input().split())\n\tif inicio == pos:\n\t\tpos = fim\n\telif fim == pos:\n\t\tpos = inicio\nprint(pos)\n", "R= lambda: map(int, input().split())\r\nn,m,k= R()\r\ndic={i: 0 for i in range(n)}\r\ndic.update({i-1:1 for i in R()})\r\nb=0\r\nif dic[0]==1:\r\n print(\"1\")\r\n exit()\r\nfor i in range(k):\r\n x,y=R()\r\n if b==x-1: b=y-1\r\n elif b==y-1: b=x-1\r\n if dic[b]==1: print(b+1),exit()\r\nprint(b+1)", "from sys import stdin,stdout,exit\r\nimport math\r\nfrom fractions import gcd\r\nfrom bisect import bisect\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\ndef issorted(li):\r\n\tn=len(li)\r\n\tfor i in range(n-1):\r\n\t\tif li[i]>li[i+1]:\r\n\t\t\treturn False\r\n\treturn True\r\nn,m,k=listInput()\r\nholes=listInput()\r\ntable=[0]*(n+1)\r\ntable[1]=1\r\nhole_tables=[0]*(n+1)\r\nfor i in holes: hole_tables[i]=1\r\nfor _ in range(k):\r\n\ta,b=listInput()\r\n\tif table[a]==1:\r\n\t\tif hole_tables[a]==0:\r\n\t\t\ttable[b]=1\r\n\t\t\ttable[a]=0\r\n\t\t\t#print(\"A\")\r\n\telif table[b]==1:\r\n\t\tif hole_tables[b]==0:\r\n\t\t\ttable[a]=1\r\n\t\t\ttable[b]=0\r\n\t\t\t#print(\"B\")\r\nprint(table.index(1))", "n,m,k=map(int,input().split())\nl=set(map(int,input().split()))\nx=1\nfor i in range(k):\n u,v=map(int,input().split())\n if x in l: break\n if x==u: x=v\n elif x==v: x=u\nprint(x)\n\t \t \t\t\t\t \t \t \t\t\t\t \t\t \t", "R = lambda: map(int,input().split())\nn,m,k = R()\nh = set(R())\ncb = 1\nfor _ in range(k):\n u,v = R()\n if cb in h:\n break\n if u == cb :\n cb = v\n elif v == cb:\n cb = u\nprint(cb)\n\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,m,k=get_ints()\r\n arr=get_list()\r\n arr=set(arr)\r\n hole=False\r\n bone=1\r\n if 1 in arr:\r\n hole=True\r\n for i in range(k):\r\n x,y=get_ints()\r\n if x==bone and hole==False:\r\n bone=y\r\n if y in arr:\r\n hole=True\r\n elif y==bone and hole==False:\r\n bone=x\r\n if x in arr:\r\n hole=True\r\n print(bone)", "\ninfos = input().split()\nburacos = [False for x in range(int(infos[0])+1)]\n\nfor i in input().split():\n buracos[int(i)] = True\n\nposicaoOsso = 1\n\nfor i in range(int(infos[2])):\n entrada = input()\n if not buracos[posicaoOsso]:\n entrada = [int(x) for x in entrada.split()]\n \n if posicaoOsso == entrada[0] or posicaoOsso == entrada[1]:\n if buracos[entrada[0]]:\n posicaoOsso = entrada[0]\n elif buracos[entrada[1]]:\n posicaoOsso = entrada[1]\n else:\n posicaoOsso = entrada[0] if posicaoOsso == entrada[1] else entrada[1]\n\nprint(posicaoOsso)\n", "n, m, k = map(int, input().split())\r\nholes = set(map(lambda x: int(x) - 1, input().split()))\r\n\r\nbone = 0\r\ndone = 0 in holes\r\nfor i in range(k):\r\n a, b = map(lambda x: int(x) - 1, input().split())\r\n if done:\r\n continue\r\n if bone in [a, b]:\r\n bone = a if bone == b else b\r\n if bone in holes:\r\n done = True\r\nprint(bone + 1)\r\n", "n, m, k = map(int, input(). split ())\nposisi_lobang = list(map(int, input(). split()))\n\nis_hole = [False]* 1000001\nposisi_tulang = 1\n\nfor i in range (len(posisi_lobang)):\n is_hole [posisi_lobang[i]] = True\n\nfor i in range (k):\n a, b = map(int, input(). split())\n if a == posisi_tulang and not is_hole[a]:\n posisi_tulang = b\n elif b == posisi_tulang and not is_hole[b]:\n posisi_tulang = a\n\nprint(posisi_tulang)\n\t \t \t \t \t \t\t\t\t \t", "n,_,k=map(int,input().split())\r\nst=set(map(int,input().split()))\r\npos = 1\r\nif 1 in st:\r\n\tprint(1)\r\n\texit()\r\nfor i in range(k):\r\n\ta,b=map(int,input().split())\r\n\tif a==pos:\r\n\t\tpos=b\r\n\telif b==pos:\r\n\t\tpos=a\r\n\tif pos in st:\r\n\t\tprint(pos)\r\n\t\texit()\r\nprint(pos)", "n, m, k = map(int, input().split())\r\n\r\ns = set()\r\nfor n in list(map(int, input().split())):\r\n s.add(n)\r\n\r\nb = 1\r\nfor _ in range(k):\r\n if b in s:\r\n print(b)\r\n quit()\r\n \r\n x1, x2 = map(int, input().split())\r\n if x1 == b:\r\n b = x2\r\n elif x2 == b:\r\n b = x1\r\n\r\nprint(b)" ]

[ "n = int(input())\r\na1, b1 = map(int, input().split())\r\na2, b2 = map(int, input().split())\r\na3, b3 = map(int, input().split())\r\n\r\nres = [a1,a2,a3]\r\nif sum(res) < n: res[0] += min(b1-a1, n-sum(res))\r\nif sum(res) < n: res[1] += min(b2-a2, n-sum(res))\r\nif sum(res) < n: res[2] += n-sum(res)\r\nprint(\" \".join(str(x) for x in res))", "n = int(input())\r\nmin1,max1 = map(int,input().split())\r\nmin2,max2 = map(int,input().split())\r\nmin3,max3 = map(int,input().split())\r\nl1 = min(max1, n - min2 - min3)\r\nl2 = min(max2, n - l1 - min3)\r\nl3 = n - l1 - l2\r\nprint(l1,l2,l3)\r\n", "n = int(input())\r\nres = [0,0,0]\r\nmaxi = [0,0,0]\r\nfor i in range(3):\r\n a, b = map(int, input().split())\r\n res[i] = a\r\n maxi[i] = b\r\n n -= a\r\n\r\nfor i in range(3):\r\n if n > 0:\r\n mini = min(n,maxi[i] - res[i])\r\n res[i] += mini\r\n n -= mini\r\n\r\nprint(*res)\r\n", "\nn=int(input())\n\na,b=[int(x) for x in input().split()]\nc,d=[int(x) for x in input().split()]\ne,f=[int(x) for x in input().split()]\n\nx,y,z=(0,0,0)\n\nif b+c+e>=n:\n x,y,z=n-c-e,c,e\nelif b+d+e>=n:\n x,y,z=b,n-b-e,e\nelse:\n x,y,z=b,d,n-b-d\n\nprint(x,y,z)\n", "n=int(input())\r\nmin1,max1 = (int(x) for x in input().split())\r\nmin2,max2 = (int(x) for x in input().split())\r\nmin3,max3 = (int(x) for x in input().split())\r\na1=max1\r\na2=max2\r\na3=n-a1-a2\r\nif a3<min3 :\r\n a2-=min3-a3\r\n a3=min3\r\nif a2<min2:\r\n a1-=min2-a2\r\n a2=min2\r\nprint(a1,a2,a3)\r\n", "n = int(input())\r\nmin1, max1 = map(int, input().split())\r\nmin2, max2 = map(int, input().split())\r\nmin3, max3 = map(int, input().split())\r\nans1 = min(n - min2 - min3, max1)\r\nans2 = min(n - ans1 - min3, max2)\r\nans3 = min(n - ans1 - ans2, max3)\r\nprint(ans1, ans2, ans3)", "n = int(input())\nlows, values = [], []\nsum = 0\nfor i in range(3):\n low, high = map(int, input().split())\n lows.append(low)\n values.append(high)\n sum += high\npos = 3\nwhile True:\n pos -= 1\n excess = min(sum - n, values[pos] - lows[pos])\n values[pos] -= excess\n sum -= excess\n if sum == n:\n break\nprint(' '.join(map(str, values)))\n", "__author__ = 'darinflar'\r\n\r\nn = int(input())\r\n\r\nx1, x2 = map(int, input().split())\r\n\r\ny1, y2 = map (int, input().split())\r\n\r\nz1, z2 = map(int, input().split())\r\n\r\nperv = min ( (n - z1 - y1), x2)\r\n\r\nvtor = min ( (n - perv - z1), y2)\r\n\r\ntret = n - perv - vtor\r\n\r\nprint(perv, vtor, tret)", "n=int(input())\r\nmin1,max1=map(int,input().split())\r\nmin2,max2=map(int,input().split())\r\nmin3,max3=map(int,input().split())\r\nif max1+max2+max3==n:\r\n\tprint(str(max1),str(max2),str(max3))\r\n\tquit()\r\nif max1+max2+min3<=n:\r\n\tprint(str(max1),str(max2),str(n-max1-max2))\r\n\tquit()\r\nif max1+min2+min3<=n:\r\n\tprint(str(max1),str(n-max1-min3),str(min3))\r\n\tquit()\r\nprint(str(n-min2-min3),str(min2),str(min3))", "def f(n,l):\r\n l1,r1=l[0]\r\n l2,r2=l[1]\r\n l3,r3=l[2]\r\n c1 = min(r1,n-l2-l3)\r\n c2 = min(r2,n-c1-l3)\r\n c3 = n-c1-c2\r\n return [c1,c2,c3]\r\n\r\nn = int(input())\r\nl = [list(map(int,input().split())) for _ in range(3)]\r\nprint(*f(n,l))\r\n", "n=int(input())\na1,b1=map(int,input().split())\na2,b2=map(int,input().split())\na3,b3=map(int,input().split())\nans1=min(n-(a2+a3),b1)\nans2=min(n-(ans1+a3),b2)\nans3=n-(ans1+ans2)\nprint(ans1,ans2,ans3)\n\n \t \t\t \t \t \t \t\t \t \t\t\t\t", "n = int(input())\r\n\r\nx1, x2 = map(int, input().split())\r\ny1, y2 = map(int, input().split())\r\nz1, z2 = map(int, input().split())\r\n\r\nans1 = x1\r\nans2 = y1\r\nans3 = z1\r\n\r\nn -= ans1 + ans2 + ans3\r\n\r\nif (n > 0):\r\n ans1 += min(n, x2 - x1)\r\n n -= x2 - x1\r\nif (n > 0):\r\n ans2 += min(n, y2 - y1)\r\n n -= y2 - y1\r\nif (n > 0):\r\n ans3 += min(n, z2 - z1)\r\n n -= z2 - z1\r\nprint(ans1, ans2, ans3)\r\n", "n=int(input())\r\nmin1,max1=map(int,input().split())\r\nmin2,max2=map(int,input().split())\r\nmin3,max3=map(int,input().split())\r\nans1=min1\r\nans2=min2\r\nans3=min3\r\nn-=min1+min2+min3\r\nmax1=max1-min1\r\nmax2=max2-min2\r\nmax3=max3-min3\r\nwhile n>0:\r\n if max1>0:\r\n if max1>=n:\r\n ans1+=n\r\n max1-=n\r\n n=0\r\n else:\r\n n=n-max1\r\n ans1+=max1\r\n max1=0\r\n elif max2>0:\r\n if max2>=n:\r\n ans2+=n\r\n max2-=n\r\n n=0\r\n else:\r\n n=n-max2\r\n ans2+=max2\r\n max2=0\r\n elif max3>0:\r\n if max3>=n:\r\n ans3+=n\r\n max3-=n\r\n n=0\r\n else:\r\n n=n-max3\r\n ans3+=max3\r\n max3=0\r\nprint(ans1,ans2,ans3)", "n = int(input())\na = [int(i) for i in input().split()]\nb = [int(i) for i in input().split()]\nc = [int(i) for i in input().split()]\nn1 = a[0]\nn2 = b[0]\nn3 = c[0]\nn -=(a[0] + b[0]+ c[0])\nn1+=(min(a[1]- a[0], n) )\nn -=(min(a[1]- a[0], n))\nn2+=(min(b[1]- b[0], n))\nn-=(min(b[1]- b[0], n))\nn3+=n\nprint(n1, n2, n3)\n", "n = int(input())\na, b = (int(x) for x in input().split())\nc, d = (int(x) for x in input().split())\ne, f = (int(x) for x in input().split())\nx = a\ny = c\nz = e\nn -= x + y + z\nq = min(n, b - a)\nx += q\nn -= q\nq = min(n, d - c)\ny += q\nn -= q\nq = min(n, f - e)\nz += q\nn -= q\nprint(x, y, z)\n", "n = int(input())\nm = sum([list(map(int, input().split())) for x in range(3)], [])\nresult, n = list(m[::2]), n - sum(m[::2])\nfor i in range(3):\n temp = min(n, m[2 * i + 1] - m[2 * i])\n result[i] += temp\n n -= temp\nprint(*result)\n", "def main():\n n = int(input())\n (min1, max1), (min2, max2), (min3, max3) = list(tuple(map(int, input().split())) for _ in range(3))\n max1 = min(max1, n - min2 - min3)\n max2 = min(max2, n - max1 - min3)\n print(max1, max2, n - max1 - max2)\n\n\nif __name__ == \"__main__\":\n main()\n", "x = int(input())\r\nf = [0, 0]\r\ns = [0, 0]\r\nt = [0, 0]\r\nstr = input().split(' ')\r\nf[0] = int(str[0])\r\nf[1] = int(str[1])\r\nstr = input().split(' ')\r\ns[0] = int(str[0])\r\ns[1] = int(str[1])\r\nstr = input().split(' ')\r\nt[0] = int(str[0])\r\nt[1] = int(str[1])\r\nmaxf = x - s[0] - t[0]\r\nif(maxf > f[1]):\r\n maxf = f[1]\r\nmaxs = x - maxf - t[0]\r\nif(maxs > s[1]):\r\n maxs = s[1]\r\nmaxt = x - maxs - maxf\r\nprint(\"{0} {1} {2}\".format(maxf, maxs, maxt))", "def solve(arr,n):\n res = []\n for i in arr:\n res.append(i[0])\n n -= i[0]\n for i,v in enumerate(arr):\n if not n:\n return res\n temp = min(v[1]-res[i],n)\n n-=temp\n res[i] += temp\n \n return res\n\n\n\n\ndef main():\n n = int(input())\n arr = []\n for _ in range(3):\n arr.append(list(map(int, list(input().split(\" \")))))\n print(*solve(arr,n))\n\nmain()", "n = int(input())\r\na,b = map(int, input().split(' '))\r\nc,d = map(int, input().split(' '))\r\ne,f = map(int, input().split(' '))\r\n\r\nwhile a + c + e < n and a < b:\r\n a += 1\r\n \r\nwhile a + c + e < n and c < d:\r\n c += 1\r\n \r\nm = n - a - c\r\n \r\nprint (a, c, m)", "\n\nn = int(input())\n\nmin_1, max_1 = map(int, input().split())\nmin_2, max_2 = map(int, input().split())\nmin_3, max_3 = map(int, input().split())\n\na_1 = min(max_1, n - min_2 - min_3)\n\na_2 = min(max_2, n - a_1 - min_3)\n\na_3 = n - a_1 - a_2\n\nprint(str(a_1) + \" \" + str(a_2) + \" \" + str(a_3))\n\n\n", "n = int(input())\r\nmn1, mx1 = map(int, input().split())\r\nmn2, mx2 = map(int, input().split())\r\nmn3, mx3 = map(int, input().split())\r\nx1, x2, x3 = mn1, mn2, mn3\r\nr = n-(x1+x2+x3)\r\nx1 += min(r, mx1-mn1)\r\nr -= min(r, mx1-mn1)\r\nx2 += min(r, mx2-mn2)\r\nr -= min(r, mx2-mn2)\r\nx3 += min(r, mx3-mn3)\r\nprint(x1, x2, x3)\r\n", "# A\r\n\r\nn = int(input())\r\nmin1, max1 = map(int, input().split())\r\nmin2, max2 = map(int, input().split())\r\nmin3, max3 = map(int, input().split())\r\n\r\nx = n - min1 - min2 - min3\r\n\r\nans1 = min(max1, x+min1)\r\nx = x - (ans1 - min1)\r\n\r\nans2 = min(max2, x+min2)\r\nx = x - (ans2 - min2)\r\n\r\nans3 = min3 + x\r\nprint(ans1, ans2, ans3)\r\n", "n = int(input())\r\nmin1, max1 = map(int, input().split())\r\nmin2, max2 = map(int, input().split())\r\nmin3, max3 = map(int, input().split())\r\n\r\nsum = min1 + min2 + min3\r\ndiplomas = [min1, min2, min3]\r\n\r\nmax1_t, max2_t, max3_t = max1, max2, max3\r\n\r\nwhile diplomas[0] < max1 and sum < n:\r\n max1_t -= 1\r\n diplomas[0] += 1\r\n sum += 1\r\n\r\nwhile diplomas[1] < max2 and sum < n:\r\n max2_t -= 1\r\n diplomas[1] += 1\r\n sum += 1\r\n\r\nwhile diplomas[2] < max3 and sum < n:\r\n max3_t -= 1\r\n diplomas[2] += 1\r\n sum += 1\r\n\r\nprint(' '.join([str(i) for i in diplomas]))", "n = int(input())\n\nmn1, mx1 = [int(s) for s in input().split()]\nmn2, mx2 = [int(s) for s in input().split()]\nmn3, mx3 = [int(s) for s in input().split()]\n\nif (n - mx1 < mn2 + mn3):\n ans1 = n - (mn3 + mn2)\n n = mn3 + mn2\nelse:\n n -= mx1\n ans1 = mx1\n\nif (n - mx2 < mn3):\n ans2 = n - mn3\n n = mn3\nelse:\n n -= mx2\n ans2 = mx2\n \nprint(ans1, ans2, n)", "n=int(input())\r\nmin1, max1 = map(int,input().split())\r\nmin2, max2 = map(int,input().split())\r\nmin3, max3 = map(int,input().split())\r\nif max1+min2+min3<=n:\r\n a=max1\r\n if max1+max2+min3<=n:\r\n b=max2\r\n if max1+max2+max3<=n:\r\n c=max3\r\n else:\r\n c=n-(max1+max2)\r\n else:\r\n b=n-max1-min3\r\n if b<min2:\r\n b=min2 \r\n c=min3\r\nelse:\r\n a=n-min2-min3\r\n if a<min1:\r\n a=min1 \r\n b=min2\r\n c=min3\r\n\r\nprint(str(a)+\" \"+str(b)+\" \"+str(c)) \r\n", "n = int(input())\r\na = [list(map(int, input().split())) for _ in range(3)]\r\nx = min(a[0][1], n - a[1][0] - a[2][0])\r\ny = min(a[1][1], n - x - a[2][0])\r\nz = n - x - y\r\nprint(x, y, z)\r\n", "#use function to solve problem\r\nn = int(input())\r\n\r\ndef getOpt(n, ma, test):\r\n if n - test <= ma:\r\n return n - test\r\n else:\r\n return ma\r\n\r\na1, a2 = map(int, input().split())\r\nb1, b2 = map(int, input().split())\r\nc1, c2 = map(int, input().split())\r\n\r\nk1 = getOpt(n, a2, b1 + c1)\r\nk2 = getOpt(n - k1, b2, c1)\r\nk3 = n - k1 - k2\r\n\r\nprint(k1, k2, k3)", "n=int(input())\r\na , b = map(int,input().split())\r\nc , d = map(int,input().split())\r\ni , j = map(int,input().split())\r\nx=min( b , n - c - i)\r\ny=min( d , n - x - i)\r\nprint( x , y , n - x - y )", "n = int(input())\n\nmin1, max1 = map(int, input().split())\nmin2, max2 = map(int, input().split())\nmin3, max3 = map(int, input().split())\n\nfirst_diplomas = n-min2-min3\nif first_diplomas > max1:\n first_diplomas = max1\n\nremaining = n-first_diplomas\nsecond_diplomas = remaining-min3\n\nif second_diplomas > max2:\n second_diplomas = max2\n\nthird_diplomas = remaining-second_diplomas\n\nprint(first_diplomas, second_diplomas, third_diplomas)", "n = int(input())\r\na, c = map(int,input().split())\r\nd, e = map(int,input().split())\r\nf, g = map(int,input().split())\r\nx = min(n - d - f, c )\r\nx = max(x, a)\r\ny = min(n - x - f, e)\r\ny = max(y, d)\r\nz = n - x - y\r\nprint(x, y, z)\r\n", "n=int(input())\r\na,b=map(int, input().split())\r\nc,d=map(int, input().split())\r\nf,e=map(int, input().split())\r\nx=min(b,n-c-f)\r\ny=min(d,n-x-f)\r\nprint(x,y,n-x-y)", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\nx = []\r\nfor _ in range(3):\r\n m = list(map(int, input().split()))\r\n for i in m:\r\n x.append(i)\r\nu = min(max(n - x[2] - x[4], x[0]), x[1])\r\nv = min(max(n - u - x[4], x[2]), x[3])\r\nw = n - u - v\r\nans = [u, v, w]\r\nsys.stdout.write(\" \".join(map(str, ans)))", "n=int(input())\r\na,x=map(int,input().split())\r\nb,y=map(int,input().split())\r\nc,z=map(int,input().split())\r\np=min(x,n-b-c)\r\nq=min(y,n-p-c)\r\nprint(p,q,n-p-q)", "n = int(input())\nmin1, max1 = map(int, input().split(' '))\nmin2, max2 = map(int, input().split(' '))\nmin3, max3 = map(int, input().split(' '))\n\nn1 = min(n - (min2 + min3), max1)\nn2 = min(n - (n1 + min3), max2)\nn3 = min(n - (n1 + n2), max3)\n\nprint('{} {} {}'.format(n1, n2, n3))\n", "r = lambda: map(int,input().split())\r\nn = int(input())\r\n\r\nmin1,max1 = r()\r\nmin2,max2 = r()\r\nmin3,max3 = r()\r\n\r\nr3 = max(min3,n - max2-max1)\r\nr2 = max(min2, n - r3 - max1)\r\nr1 = n -r3-r2\r\nprint (r1,r2,r3) \r\n\r\n", "n = int(input())\r\nmin1,max1 = map(int, input().split())\r\nmin2,max2 = map(int, input().split())\r\nmin3,max3 = map(int, input().split())\r\nc = min1\r\nb = min2\r\na = min3\r\nn -= (c + b + a)\r\nif n>0 :\r\n if (max1 - min1) > n:\r\n c += n\r\n else:\r\n c = max1\r\n n -= (max1 - min1)\r\n if (max2 - min2) > n:\r\n b += n\r\n else:\r\n b = max2\r\n n -= (max2 - min2)\r\n a += n\r\nprint(c,b,a)\r\n\r\n\r\n\r\n", "#!/usr/bin/env python3\n\nif __name__ == '__main__':\n n = int(input());\n min1, max1 = map(int, input().split())\n min2, max2 = map(int, input().split())\n min3, max3 = map(int, input().split())\n\n a, b, c = min1, min2, min3\n n = n - min1 - min2 - min3\n\n ra = min(n, max1-a)\n a += ra\n n -= ra\n\n rb = min(n, max2-b)\n b += rb\n n -= rb\n\n rc = min(n, max3-c)\n c += rc\n n -= rc\n\n print(a, b, c)\n", "n=int(input())\r\na1,b1=map(int,input().split())\r\na2,b2=map(int,input().split())\t \r\na3,b3=map(int,input().split())\r\np=a1\r\nq=a2\r\nr=a3\r\nif (n-a1-a2-a3)>(b1-a1):\r\n\tp=b1\r\n\tif n-b1-a2-a3>b2-a2:\r\n\t\tq=b2\r\n\t\tr=n-b1-b2\r\n\telse:\r\n\t\tq=a2+n-b1-a2-a3\r\nelse:\r\n\tp=a1+n-a1-a2-a3 \r\nprint(p,q,r)\r\n\r\n", "n = int(input())\r\nmin1, max1 = [int(x) for x in input().split()]\r\nmin2, max2 = [int(x) for x in input().split()]\r\nmin3, max3 = [int(x) for x in input().split()]\r\n\r\nst = min1\r\nnd = min2\r\nrd = min3\r\n\r\nleft = n - (min1 + min2 + min3)\r\ndiff = 0\r\nif left < (max1 - min1):\r\n diff = left\r\nelse:\r\n diff = max1 - min1\r\nst += diff\r\nleft -= diff\r\n\r\nif left < (max2 - min2):\r\n diff = left\r\nelse:\r\n diff = max2 - min2\r\nnd += diff\r\nleft -= diff\r\n\r\nif left < (max3 - min3):\r\n diff = left\r\nelse:\r\n diff = max3 - min3\r\nrd += diff\r\nleft -= diff\r\n\r\nprint(st, nd, rd)", "n = int(input())\r\n\r\nmin1, max1 = map(int, input().split())\r\nmin2, max2 = map(int, input().split())\r\nmin3, max3 = map(int, input().split())\r\n\r\nn1 = min(n - min3 - min2, max1)\r\nn2 = min(n - n1 - min3, max2)\r\nn3 = n - n1 - n2\r\n\r\nprint(n1, n2, n3)", "#Problem: https://codeforces.com/contest/557/problem/A\r\n\r\nn = int(input())\r\nan, ax = map(int, input().split())\r\nbn, bx = map(int, input().split())\r\ncn, cx = map(int, input().split())\r\n\r\na = min(n, min(ax, n - bn - cn))\r\nn -= a\r\nb = min(n, min(bx, n - cn))\r\nprint(a, b, n-b, sep=' ')", "n = int(input());\r\ntemp = [int(n) for n in input().split()];\r\nmin1 = temp[0];\r\nmax1 = temp[1];\r\ntemp = [int(n) for n in input().split()];\r\nmin2 = temp[0];\r\nmax2 = temp[1];\r\ntemp = [int(n) for n in input().split()];\r\nmin3 = temp[0];\r\nmax3 = temp[1];\r\n\r\ndiplomas = [0, 0, 0];\r\ndiplomas[0] = min1;\r\ndiplomas[1] = min2;\r\ndiplomas[2] = min3;\r\n\r\ndiplomas[0]+=min(max1-min1, n-sum(diplomas));\r\ndiplomas[1]+=min(max2-min2, n-sum(diplomas));\r\ndiplomas[2]+=min(max3-min3, n-sum(diplomas));\r\n\r\nprint(diplomas[0], diplomas[1], diplomas[2]);", "n = int(input())\r\nmax1 = list(map(int,input().split()))+[0]\r\nmax2 = list(map(int,input().split()))+[0]\r\nmax3 = list(map(int,input().split()))+[0]\r\nmax1[2] = max1[1] - max1[0]\r\nmax2[2] = max2[1] - max2[0]\r\nmax3[2] = max3[1] - max3[0]\r\nn = n - max1[0] - max2[0] - max3[0]\r\nprint(max1[0]+min(n,max1[2]),end=\" \")\r\nprint(max2[0]+max(0,min(n-max1[2],max2[2])),end=\" \")\r\nprint(max3[0]+max(0,min(n-max1[2]-max2[2],max3[2])),end=\" \")\r\n", "from sys import stdin,stdout\r\ndef ai(): return list(map(int,input().split()))\r\ndef ei(): return map(int,input().split())\r\ndef ip(): return int(stdin.readline())\r\ndef op(ans): return stdout.write(str(ans) + '\\n') \r\n\r\nn = ip()\r\nmin1,max1 = ei()\r\nmin2,max2 = ei()\r\nmin3,max3 = ei()\r\n\r\nminsum = min1+min2+min3\r\n\r\nif minsum == n:\r\n\tprint(min1,min2,min3)\r\n\texit()\r\nelse:\r\n\tli = []\r\n\tfirst = n-(min2+min3)\r\n\tif first <= max1:\r\n\t\tli.append(first)\r\n\telse:\r\n\t\tli.append(max1)\r\n\t\tfirst = max1\r\n\tif n-(first+min3) <= max2:\r\n\t\tsecond = n-(first+min3)\r\n\t\tli.append(second)\r\n\telse:\r\n\t\tli.append(max2)\r\n\t\tsecond = max2\r\n\tif n-(first+second) <= max3:\r\n\t\tli.append(n-(first+second))\r\n\telse:\r\n\t\tli.append(max3)\r\nprint(*li)\r\n", "n=int(input())\na1,b1=[int(x) for x in input().split()]\na2,b2=[int(x) for x in input().split()]\na3,b3=[int(x) for x in input().split()]\nans=[a1,a2,a3]\nn-=a1+a2+a3\nif n>=b1-a1:\n ans[0]=b1\n n-=b1-a1\n if n>=b2-a2:\n ans[1]=b2\n n-=b2-a2\n ans[2]=min(a3+n,b3)\n else:\n ans[1]+=n\nelse:\n ans[0]+=n\nprint(' '.join([str(x) for x in ans]))\n \n", "n = int(input())\r\nmin1, max1 = map(int, input().split())\r\nmin2, max2 = map(int, input().split())\r\nmin3, max3 = map(int, input().split())\r\n\r\nk1 = min(max1, n - min2 - min3)\r\nk2 = min(max2, n - k1 - min3)\r\n\r\nprint(k1, k2, n - k1 - k2)", "def main():\n n = int(input())\n min1, max1 = [int(t) for t in input().split()]\n min2, max2 = [int(t) for t in input().split()]\n min3, max3 = [int(t) for t in input().split()]\n\n s1 = min(max1, n - min2 - min3)\n s2 = min(max2, n - s1 - min3)\n s3 = n - s1 - s2\n\n print(' '.join(str(s) for s in [s1, s2, s3]))\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\r\nrg = []\r\nn1 = [int(x) for x in input().split()]\r\nn2 = [int(x) for x in input().split()]\r\nn3 = [int(x) for x in input().split()]\r\nres = [0, 0, 0]\r\nfor i in range(n1[0], n1[1] + 1):\r\n if n - i <= n2[1] + n3[1]:\r\n if n - i >= n2[0] + n3[0]:\r\n res[0] = i\r\nfor i in range(n2[0], n2[1] + 1):\r\n t = n - i - res[0]\r\n if t >= n3[0]:\r\n if t <= n3[1]:\r\n res[1] = i\r\nres[2] = n - sum(res[:2])\r\nprint(' '.join(list(map(str, res))))\r\n", "n = int(input())\r\nl1 = input().split(\" \")\r\nl2 = input().split(\" \")\r\nl3 = input().split(\" \")\r\n\r\nmn1, mx1 = int(l1[0]), int(l1[1])\r\nmn2, mx2 = int(l2[0]), int(l2[1])\r\nmn3, mx3 = int(l3[0]), int(l3[1])\r\n\r\n\r\nif n - mn2 - mn3 > mx1:\r\n d1 = mx1\r\nelse:\r\n d1 = n - mn2 - mn3\r\n\r\nn -= d1\r\n\r\nif n - mn3 > mx2:\r\n d2 = mx2\r\nelse:\r\n d2 = n - mn3\r\n\r\nn -= d2\r\n\r\nd3 = n\r\n\r\nprint(d1, d2, d3, sep=\" \")\r\n", "n = int(input())\nd1 = input().split()\nmin1, max1 = int(d1[0]), int(d1[1])\nd1 = input().split()\nmin2, max2 = int(d1[0]), int(d1[1])\nd1 = input().split()\nmin3, max3 = int(d1[0]), int(d1[1])\ndi1 = min1\ndi2 = min2\ndi3 = min3\ndi1 += min((max1 - min1), (n - (di1 + di2 + di3)))\ndi2 += min((max2 - min2), (n - (di1 + di2 + di3)))\ndi3 += min((max3 - min3), (n - (di1 + di2 + di3)))\nprint(di1, di2, di3)", "n = int(input())\r\nx1, y1 = map(int, input().split())\r\nx2, y2 = map(int, input().split())\r\nx3, y3 = map(int, input().split())\r\na, b, c = x1, x2, x3\r\ns = a + b + c\r\nx = n-s\r\nif x:\r\n\tif y1 - x1 < x:\r\n\t\ta += y1 - x1\r\n\t\tx -= y1 - x1\r\n\telse:\r\n\t\ta += x\r\n\t\tx = 0\r\n\t\r\n\tif y2 - x2 < x:\r\n\t\tb += y2 - x2\r\n\t\tx -= y2 - x2\r\n\telse:\r\n\t\tb += x\r\n\t\tx = 0\r\n\t\t\r\n\tif y3 - x3 < x:\r\n\t\tc += y3 - x3\r\n\t\tx -= y3 - x3\r\n\telse:\r\n\t\tc += x\r\n\t\tx = 0\r\nprint(a, b, c)\r\n\r\n", "from sys import stdin\r\nfrom sys import exit\r\n\r\nlive = True\r\nif not live: stdin = open('data.in', 'r')\r\n\r\nn = int(stdin.readline().strip())\r\nans1, max1 = list(map(int, stdin.readline().strip().split()))\r\nans2, max2 = list(map(int, stdin.readline().strip().split()))\r\nans3, max3 = list(map(int, stdin.readline().strip().split()))\r\ntotal = ans1 + ans2 + ans3\r\n\r\nif total == n:\r\n\tprint(ans1, ans2, ans3)\r\n\texit(0)\r\nn -= total\r\ntotal = min(n, max1 - ans1)\r\nans1 += total\r\nif total == n:\r\n\tprint(ans1, ans2, ans3)\r\n\texit(0)\r\nn -= total\r\ntotal = min(n, max2 - ans2)\r\nans2 += total\r\nif total == n:\r\n\tprint(ans1, ans2, ans3)\r\n\texit(0)\r\nn -= total\r\ntotal = min(n, max3 - ans3)\r\nans3 += total\r\nprint(ans1, ans2, ans3)\r\n\r\nif not live: stdin.close()", "# Description of the problem can be found at http://codeforces.com/problemset/problem/557/A\r\n\r\nn = int(input())\r\n\r\nl_lm = list()\r\nfor _ in range(3):\r\n l_lm.append(list(map(int, input().split())))\r\n\r\nn += - l_lm[0][0] - l_lm[1][0] - l_lm[2][0]\r\nl_t = list([l_lm[0][0], l_lm[1][0], l_lm[2][0]])\r\n\r\n\r\nfor i in range(3):\r\n l_t[i] += min(n, l_lm[i][1] - l_lm[i][0])\r\n n -= min(n, l_lm[i][1] - l_lm[i][0])\r\n\r\nprint(\" \".join(str(x) for x in l_t))", "n = int(input())\r\na1,a2 = map(int,input().split())\r\nb1,b2 = map(int,input().split())\r\nc1,c2 = map(int,input().split())\r\na = min(a2,n-b1-c1)\r\nb = min(b2,n-a-c1)\r\nc = n - a -b\r\nprint(a,b,c)", "def main():\r\n n = int(input())\r\n min1, max1 = [int(i) for i in input().split()]\r\n min2, max2 = [int(i) for i in input().split()]\r\n min3, max3 = [int(i) for i in input().split()]\r\n \r\n for x in range(min(n - 1, max1), min1 - 1, -1):\r\n if min3 <= n - x - max2 <= max3:\r\n print(x, max2, n - x - max2)\r\n return\r\n if min2 <= n - x - min3 <= max2:\r\n print(x, n - x - min3, min3)\r\n return \r\n \r\n \r\nmain()\r\n", "# https://codeforces.com/problemset/problem/557/A\n\nn = int(input())\nd = {}\n\nmin1, max1 = map(int, input().split())\nmin2, max2 = map(int, input().split())\nmin3, max3 = map(int, input().split())\n\nans1, ans2, ans3 = min1, min2, min3\n\nwhile ans1 < max1 and ans1 + ans2 + ans3 < n:\n ans1 += 1\nwhile ans2 < max2 and ans1 + ans2 + ans3 < n:\n ans2 += 1\nwhile ans3 < max3 and ans1 + ans2 + ans3 < n:\n ans3 += 1\n\n\nprint(ans1, ans2, ans3)\n", "#!/usr/bin/python3\n\nimport itertools as ittls\nfrom collections import Counter\n\nimport re\nimport math\n\n\ndef sqr(x):\n return x*x\n\ndef inputarray(func=int):\n return map(func, input().split())\n\n# --------------------------------------\n# --------------------------------------\n\nN = int(input())\nx1, y1 = inputarray()\nx2, y2 = inputarray()\nx3, y3 = inputarray()\n\ndef split(N, x1, y1, x2, y2):\n if N - y1 >= x2:\n return (y1, N - y1)\n else:\n return (N - x2, x2)\n\n\na1, x = split(N, x1, y1, x2 + x3, y2 + y3)\na2, a3 = split(x, x2, y2, x3, y3)\n\nprint(a1, a2, a3)\n", "n=int(input())\r\na,b=list(map(int,input().split()))\r\nc,d=list(map(int,input().split()))\r\ne,f=list(map(int,input().split()))\r\nx=(min(b,n-c-e))\r\ny=(min(d,n-x-e))\r\nprint(x,y,n-x-y)\r\n", "n=int(input())\r\nr=n*1\r\na1,b1=map(int,input().split())\r\na2,b2=map(int,input().split())\r\na3,b3=map(int,input().split())\r\n\r\np1,p2,p3=a1,a2,a3\r\nn-=(a1+a2+a3)\r\nk=b1-a1\r\nif k>=n:\r\n p1=a1+n\r\nelse:\r\n p1 = b1\r\n n-=k\r\n k=b2-a2\r\n if k>=n:\r\n p2=a2+n\r\n else:\r\n p2=b2\r\n p3=r-p1-p2\r\nprint(p1,p2,p3)\r\n", "n = int(input())\r\nmin1, max1 = map(int, input().split())\r\nmin2, max2 = map(int, input().split())\r\nmin3, max3 = map(int, input().split())\r\nanswer = [min1, min2, min3]\r\nif sum(answer) < n:\r\n answer[0] += min(max1 - min1, n - sum(answer))\r\nif sum(answer) < n:\r\n answer[1] += min(max2 - min2, n - sum(answer))\r\nif sum(answer) < n:\r\n answer[2] += min(max3 - min3, n - sum(answer))\r\nprint(answer[0], answer[1], answer[2])\r\n", "# @Chukamin ZZU_TRAIN\n\ndef main():\n n = int(input())\n d1 = list(map(int, input().split()))\n d2 = list(map(int, input().split()))\n d3 = list(map(int, input().split()))\n choose1 = min(n - d2[0] - d3[0], d1[1])\n choose2 = min(n - choose1 - d3[0], d2[1])\n choose3 = n - choose1 - choose2\n print(choose1, choose2, choose3, sep = ' ')\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", "n = int (input())\na,c=map(int,input().split())\nd,e=map(int,input().split())\nf,g=map(int,input().split())\nx=min(n-d-f,c)\nx=max(x,a)\ny = min(n-x-f,e)\ny = max(y,d)\nz=n-x-y\nprint(x,y,z)\n", "def main():\r\n n = int(input())\r\n x = [tuple(int(strnum) for strnum in input().split()) for ct in range(3)]\r\n u = min(x[0][1], n-x[1][0]-x[2][0])\r\n v = min(x[1][1], n-u-x[2][0])\r\n print(u,v,n-u-v)\r\n\r\nif __name__ == '__main__': main()", "__author__ = 'Bian'\r\nn = int(input())\r\na1, a2 = [int(x) for x in input().split()]\r\nb1, b2 = [int(x) for x in input().split()]\r\nc1, c2 = [int(x) for x in input().split()]\r\na = min(a2, n - b1 - c1)\r\nb = min(b2, n - a - c1)\r\nc = n - a - b\r\nprint(a,b,c)", "n = int(input())\r\narr = [list(map(int, input().split())) for i in range(3)]\r\nx = min(arr[0][1], n - arr[1][0] - arr[2][0])\r\ny = min(arr[1][1], n - x - arr[2][0])\r\nz = n - x - y\r\nprint(x, y, z)\r\n", "n = int(input())\nmi1, ma1 = map(int, input().split())\nmi2, ma2 = map(int, input().split())\nmi3, ma3 = map(int, input().split())\nif ma1 + mi2 + mi3 >= n:\n print(n - mi2 - mi3, mi2, mi3)\nelse:\n x = n - ma1 - mi2 - mi3\n if x < (ma2 - mi2):\n print(ma1, mi2 + x, mi3)\n else:\n print(ma1, ma2, n - ma1 - ma2)", "a=int(input())\r\n*b,=map(int,input().split()+input().split()+input().split())\r\nif b[0]+b[2]+b[4]<a:\r\n if b[1]+b[2]+b[4]<a:\r\n if b[1]+b[3]+b[4]<a:print(b[1],b[3],a-b[1]-b[3])\r\n else:print(b[1],a-b[1]-b[4],b[4])\r\n else:print(a-b[2]-b[4],b[2],b[4])\r\nelse:print(b[0],b[2],b[4])\r\n", "n = int(input())\r\nmin1, max1 = map(int, input().split())\r\nmin2, max2 = map(int, input().split())\r\nmin3, max3 = map(int, input().split())\r\n\r\nd1 = min(n - min2 - min3, max1)\r\nn -= d1\r\nd2 = min(n - min3, max2)\r\nd3 = n - d2\r\nprint('{} {} {}'.format(d1, d2, d3))", "n = int(input())\r\nmin1, max1 = map(int, input().split())\r\nmin2, max2 = map(int, input().split())\r\nmin3, max3 = map(int, input().split())\r\nremaining1 = max1 - min1\r\nremaining2 = max2 - min2\r\nremaining3 = max3 - min3\r\n\r\nsum1 = min1\r\nsum2 = min2\r\nsum3 = min3\r\n\r\nremaining_sum = n - min1 - min2 - min3\r\n\r\nif remaining_sum == 0:\r\n print(sum1, sum2, sum3)\r\nelse: \r\n if remaining_sum <= remaining1:\r\n sum1 += remaining_sum\r\n else: \r\n sum1 += remaining1\r\n remaining_sum -= remaining1\r\n if remaining_sum <= remaining2:\r\n sum2 += remaining_sum\r\n else: \r\n sum2 += remaining2\r\n sum3 += (remaining_sum - remaining2)\r\n print(sum1, sum2, sum3)", "n = int(input())\r\nmin1, max1 = map(int, input().split())\r\nmin2, max2 = map(int, input().split())\r\nmin3, max3 = map(int, input().split())\r\nn1, n2, n3 = min1, min2, min3\r\nn1 = min(max1, n - n2 - n3)\r\nn -= n1\r\nn2 = min(max2, n - n3)\r\nn -= n2\r\nn3 = n\r\nprint(n1, n2, n3)", "n = int(input())\nmin1, max1 = map(int, input().split(' ')[0:2])\nmin2, max2 = map(int, input().split(' ')[0:2])\nmin3, max3 = map(int, input().split(' ')[0:2])\n\nn1 = min1\nn -= min1\n\nn2 = min2\nn -= min2\n\nn3 = min3\nn -= min3\n\nn1 += min((max1 - min1), n)\nn -= min((max1 - min1), n)\n\nn2 += min((max2 - min2), n)\nn -= min((max2 - min2), n)\n\nn3 += min((max3 - min3), n)\nn -= min((max3 - min3), n)\n\nprint(n1, n2, n3)\n", "n = int(input())\r\ndip = []\r\nfor i in range(3):\r\n dip_i = list(map(int, input().split()))\r\n dip.append(dip_i)\r\ngot = 0\r\nfor i in range(3):\r\n got += dip[i][0]\r\nresult = []\r\nfor i in range(3):\r\n cur_got = min(n - got, dip[i][1] - dip[i][0])\r\n got += cur_got\r\n result.append(dip[i][0] + cur_got)\r\nprint(*result)# 1698333066.136829", "n=int(input())\narr=[]\nfor i in range(3):\n a,b=map(int,input().split(' '))\n arr.append((a,b))\na1=0\na2=arr[1][0]\na3=arr[2][0]\na1=min(n-a2-a3,arr[0][1])\na2=min(n-a1-a3,arr[1][1])\na3=min(n-a1-a2,arr[2][1])\nprint(a1,a2,a3)\n\n\n \n", "def process(n, a1, b1, a2, b2, a3, b3):\r\n answer = []\r\n answer.append(min(b1, n-a2-a3))\r\n n-=answer[-1]\r\n answer.append(min(b2, n-a3))\r\n n-=answer[-1]\r\n answer.append(n)\r\n return answer\r\n \r\nn = int(input())\r\na1, b1 = [int(x) for x in input().split()]\r\na2, b2 = [int(x) for x in input().split()]\r\na3, b3 = [int(x) for x in input().split()]\r\nm1, m2, m3 = process(n, a1, b1, a2, b2, a3, b3)\r\nprint(f'{m1} {m2} {m3}')", "n = int(input())\nmi1,ma1 = map(int,input().split())\nmi2,ma2 = map(int,input().split())\nmi3,ma3 = map(int,input().split())\na1,a2,a3 = mi1,mi2,mi3\nwhile a1<ma1 and a1+a2+a3<n:\n\ta1+=1\nwhile a2<ma2 and a1+a2+a3<n:\n\ta2+=1\nwhile a3<ma3 and a1+a2+a3<n:\n\ta3+=1\nprint(a1,a2,a3)\n\n", "import math\r\n\r\n\r\ndef main_function():\r\n n = int(input())\r\n min_1, max_1 = [int(i) for i in input().split(\" \")]\r\n min_2, max_2 = [int(i) for i in input().split(\" \")]\r\n min_3, max_3 = [int(i) for i in input().split(\" \")]\r\n count_1 = min_1\r\n count_2 = min_2\r\n count_3 = min_3\r\n total = count_2 + count_3 + count_1\r\n dif = n - total\r\n z = min(dif, max_1 - min_1)\r\n dif -= z\r\n count_1 += z\r\n z = min(dif, max_2 - min_2)\r\n dif -= z\r\n count_2 += z\r\n z = min(dif, max_3 - min_3)\r\n dif -= z\r\n count_3 += z\r\n print(str(count_1) + \" \" + str(count_2) + \" \" + str(count_3))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()", "n = int(input())\nmin1,max1 = map(int, input().split())\nmin2,max2 = map(int, input().split())\nmin3,max3 = map(int, input().split())\na = min1\nb = min2\nc = min3\nn = n - min1 - min2 - min3\nif n+a <= max1:\n a = a + n\nelse:\n n = n - max1 + a\n a = max1\n if n+b <= max2:\n b = b + n\n else:\n n = n - max2 + b\n b = max2\n c = c + n\nprint(str(a)+\" \"+str(b)+\" \"+str(c))\n \n \n", "n = input()\r\nmin1, max1 = input().split()\r\nmin2, max2 = input().split()\r\nmin3, max3 = input().split()\r\n\r\nif (int(min3) <= int(n) - int(max1) - int(max2)):\r\n n1 = max1\r\n n2 = max2\r\n n3 = int(n) - int(n1) - int(n2)\r\nelif (int(min2) <= int(n) - int(max1) - int(min3)):\r\n n1 = max1\r\n n3 = min3\r\n n2 = int(n) - int(n1) - int(n3)\r\nelse:\r\n n2 = min2\r\n n3 = min3\r\n n1 = int(n) - int(n2) - int(n3)\r\n \r\nprint (str(n1) + ' ' + str(n2) + ' ' + str(n3))\r\n \r\n", "n=int(input())\r\nmin1,max1=list(map(int,input().split()))\r\nmin2,max2=list(map(int,input().split()))\r\nmin3,max3=list(map(int,input().split()))\r\ndipl=[0,0,0]\r\nif n>min1+min2+min3:\r\n dipl[0]=min(max1,n-min2-min3)\r\n dipl[1]=min(max2,n-dipl[0]-min3)\r\n dipl[2]=n-dipl[0]-dipl[1]\r\nelse:\r\n dipl=[min1,min2,min3]\r\n\r\nprint(\" \".join(list(map(str,dipl))))", "n = int(input())\r\nmin1, max1 = [int(i) for i in input().split(' ')]\r\nmin2, max2 = [int(i) for i in input().split(' ')]\r\nmin3, max3 = [int(i) for i in input().split(' ')]\r\n\r\nres1 = min(max1, n - min3 - min2)\r\nres2 = min(max2, n - min3 - res1)\r\nres3 = n - res2 - res1\r\n\r\nprint(res1, res2, res3)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\na1, b1 = map(int, input().split())\r\na2, b2 = map(int, input().split())\r\na3, b3 = map(int, input().split())\r\n\r\nd = [a1, a2, a3]\r\nn -= sum(d)\r\nwhile n:\r\n d[0] += min(b1-a1, n)\r\n n -= min(b1-a1, n)\r\n if n == 0:\r\n break\r\n else:\r\n d[1] += min(b2 - a2, n)\r\n n -= min(b2 - a2, n)\r\n if n == 0:\r\n break\r\n else:\r\n d[2] += min(b3 - a3, n)\r\n n -= min(b3 - a3, n)\r\nprint(*d)", "n=int(input())\na=list(map(int,input().split()))\nb=list(map(int,input().split()))\nc=list(map(int,input().split()))\np1,p2,p3=a[0],b[0],c[0]\nn-=p1+p2+p3\na[1]=a[1]-a[0]\nb[1]=b[1]-b[0]\nc[1]=c[1]-c[0]\nif a[1]>n:\n p1+=n\n n=0\nelse:\n p1+=a[1]\n n-=a[1]\nif b[1]>n:\n p2+=n\n n=0\nelse:\n p2+=b[1]\n n-=b[1]\nif c[1]>n:\n p3+=n\n n=0\nelse:\n p3+=c[1]\n n-=c[1]\nprint(p1,p2,p3)", "n = int(input())\r\nm_1, mx_1 = map(int, input().split())\r\nm_2, mx_2 = map(int, input().split())\r\nm_3, mx_3 = map(int, input().split())\r\nans = [m_1, m_2, m_3]\r\ns = sum(ans)\r\nif s == n:\r\n print(*ans)\r\nelse:\r\n ans[0] += min(n - s, mx_1 - m_1)\r\n if ans[0] == mx_1:\r\n s += mx_1 - m_1\r\n ans[1] += min(n - s, mx_2 - m_2)\r\n if ans[1] == mx_2:\r\n s += mx_2 - m_2\r\n ans[2] += min(n - s, mx_3 - m_3)\r\n print(*ans)\r\n ", "n = int(input())\r\nmin1, max1 = map(int, input().split())\r\nmin2, max2 = map(int, input().split())\r\nmin3, max3 = map(int, input().split())\r\n\r\nans1 = min(max1, n - min2 - min3)\r\nn -= ans1\r\nans2 = min(max2, n - min3)\r\nn -= ans2\r\nans3 = n\r\n\r\nprint(ans1, ans2, ans3)", "from functools import reduce\r\n\r\nn = int(input())\r\n\r\nmn = []\r\nmx = []\r\n\r\nfor i in range(3):\r\n line = input().split()\r\n mn.append(int(line[0]))\r\n mx.append(int(line[1]))\r\n\r\nn -= reduce(lambda a, b: a + b, mn)\r\n\r\nfor i in range(3):\r\n mx[i] -= mn[i]\r\n\r\ni = 0\r\nwhile n > 0:\r\n temp = min(n, mx[i])\r\n mn[i] += temp\r\n n -= temp\r\n i += 1\r\n\r\nprint(f\"{mn[0]} {mn[1]} {mn[2]}\")\r\n", "n = int(input())\nmin1, max1 = map(int, input().split())\nmin2, max2 = map(int, input().split())\nmin3, max3 = map(int, input().split())\nfor m1 in range(max1, min1 - 1, -1):\n l2, r2 = min2, max2\n while r2 - l2 >= 2:\n m2 = l2 + (r2 - l2) // 2\n d = n - m1 - m2\n if d < min3:\n r2 = m2 - 1\n elif d > max3:\n l2 = m2 + 1\n else:\n l2 = m2\n pos = False\n for m2 in range(r2, l2 - 1, -1):\n if min3 <= n - m1 - m2 <= max3:\n pos = True\n print(m1, m2, n - m1 - m2)\n break\n if pos:\n break", "n=int(input())\r\na=[None]*3\r\na[0]=list(map(int,input().split()))\r\na[1]=list(map(int,input().split()))\r\na[2]=list(map(int,input().split()))\r\ntotal=0\r\nb=[None]*3\r\nfor i in range(3):\r\n total+=a[i][0]\r\n b[i]=a[i][0]\r\n\r\nwhile total<n:\r\n if b[0]<a[0][1]:\r\n k=a[0][1]-b[0]\r\n if total+k>n:\r\n b[0]+=(n-total)\r\n total=n\r\n else:\r\n b[0]+=k\r\n total+=k\r\n if b[1]<a[1][1]:\r\n k=a[1][1]-b[1]\r\n if total+k>n:\r\n b[1]+=(n-total)\r\n total=n\r\n else:\r\n b[1]+=k\r\n total+=k\r\n if b[2]<a[2][1]:\r\n k=a[2][1]-b[2]\r\n if total+k>n:\r\n b[2]+=(n-total)\r\n total=n\r\n else:\r\n b[2]+=k\r\n total+=k\r\n \r\nprint(b[0],b[1],b[2])\r\n", "u=int(input())\r\nMin1,Max1=map(int,input().split())\r\nMin2,Max2=map(int,input().split())\r\nMin3,Max3=map(int,input().split())\r\nif u-Min2-Min3>=Max1:\r\n u=u-Max1\r\n if u-Min3>=Max2:\r\n u=u-Max2\r\n print(Max1,Max2,u)\r\n else:\r\n u=u-Min3\r\n print(Max1,u,Min3)\r\nelse:\r\n print(u-Min2-Min3,Min2,Min3)", "__author__ = 'Данила'\r\n\r\nn = int(input())\r\nmin1, max1 = map(int, input().split())\r\nmin2, max2 = map(int, input().split())\r\nmin3, max3 = map(int, input().split())\r\n\r\nans1 = min(max1, n - min2 - min3)\r\n\r\nn -= ans1\r\n\r\nans2 = min(max2, n - min3)\r\n\r\nans3 = n - ans2\r\nprint(ans1, ans2, ans3)\r\n", "n = int(input())\r\na1, b1 = map(int, input().split())\r\na2, b2 = map(int, input().split())\r\na3, b3 = map(int, input().split())\r\nx = min(b1, n - a2 - a3)\r\ny = min(b2, n - x - a3)\r\nprint(str(x) + ' ' + str(y) + ' ' + str(n - x - y))", "n=int(input())\r\nmin1,max1=map(int,input().split(\" \"))\r\nmin2,max2=map(int,input().split(\" \"))\r\nmin3,max3=map(int,input().split(\" \"))\r\nx1=min(n-min3-min2,max1)\r\nn-=x1\r\nx2=min(n-min3,max2)\r\nx3=n-x2\r\nprint(x1,x2,x3)", "n = int(input())\r\nl1,r1 = map(int,input().split())\r\nl2,r2 = map(int,input().split())\r\nl3,r3 = map(int,input().split())\r\nk1 = 0\r\nk2 = 0\r\nfor i in range(l1,r1+1):\r\n if (n-i >= l2+l3) and (n-i <= r2+r3):\r\n k1 = i\r\nfor i in range(l2,r2+1):\r\n if (i<=n-k1) and (n-i-k1>=l3) and (n-i-k1<=r3):\r\n k2 = i\r\nprint(k1,k2, n-k1-k2)", "#\"from dust i have come, dust i will be\"\r\n\r\nn=int(input())\r\nm=[[None]*2 for i in range(3)]\r\n\r\nfor i in range(3):\r\n m[i][0],m[i][1]=map(int,input().split())\r\n\r\na=m[0][0];b=m[1][0];c=m[2][0]\r\nn-=(a+b+c)\r\n\r\n#take the first diploma\r\nx=min(n,m[0][1]-m[0][0])\r\na+=x;n-=x;\r\n\r\nif n<0:\r\n n=0\r\n \r\n#take the second diploma\r\nx=min(n,m[1][1]-m[1][0])\r\nb+=x;n-=x;\r\n\r\nif n<0:\r\n n=0\r\n\r\n#take the third\r\nx=min(n,m[2][1]-m[2][0])\r\nc+=x;n-=x;\r\n\r\nprint(a,b,c)\r\n\r\n\r\n", "n=int(input())\r\na1,b1=map(int,input().split())\r\na2,b2=map(int,input().split())\r\na3,b3=map(int,input().split())\r\nans1=min(n-(a2+a3),b1)\r\nans2=min(n-(ans1+a3),b2)\r\nans3=n-(ans1+ans2)\r\nprint(ans1,ans2,ans3)\r\n", "#!/usr/bin/env python\n# 557A_diploma.py - Codeforces.com 557A Diploma quiz\n#\n# Copyright (C) 2015 Sergey\n# Licensed under the Apache License, Version 2.0 (the \"License\");\n# you may not use this file except in compliance with the License.\n# You may obtain a copy of the License at\n# http://www.apache.org/licenses/LICENSE-2.0\n#\n# Unless required by applicable law or agreed to in writing, software\n# distributed under the License is distributed on an \"AS IS\" BASIS,\n# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n# See the License for the specific language governing permissions and\n# limitations under the License.\n\n\"\"\"\nInput\n\nThe first line of the input contains a single integer n - the number of\nschoolchildren who will participate in the Olympiad.\n\nThe next line of the input contains two integers min1 and max1\nthe minimum and maximum limits on the number of diplomas of the first\ndegree that can be distributed.\n\nThe third line of the input contains two integers min2 and max2\n\nThe next line of the input contains two integers min3 and max3\n\nOutput\n\nIn the first line of the output print three numbers, showing how many diplomas\nof the first, second and third degree will be given to students in the optimal\nvariant of distributing diplomas.\n\nThe optimal variant of distributing diplomas is the one that maximizes the\nnumber of students who receive diplomas of the first degree. Of all the\nsuitable options, the best one is the one which maximizes the number of\nparticipants who receive diplomas of the second degree. If there are several\nof these options, the best one is the one that maximizes the number of\ndiplomas of the third degree.\n\"\"\"\n\n# Standard libraries\nimport unittest\nimport sys\nimport re\n\n# Additional libraries\n\n\n###############################################################################\n# Diploma Class\n###############################################################################\n\n\nclass Diploma:\n \"\"\" Diploma representation \"\"\"\n\n def __init__(self, args):\n \"\"\" Default constructor \"\"\"\n\n self.list = args\n self.n = args[0]\n self.ranges = args[1:]\n self.range = [0, 0, 0]\n\n def set_range(self):\n\n reminder = self.n\n min0 = reminder - self.ranges[2][0] - self.ranges[1][0]\n self.range[0] = min(min0, self.ranges[0][1])\n reminder -= self.range[0]\n self.range[1] = min(reminder - self.ranges[2][0], self.ranges[1][1])\n reminder -= self.range[1]\n self.range[2] = min(reminder, self.ranges[2][1])\n\n def calculate(self):\n \"\"\" Main calcualtion function of the class \"\"\"\n\n self.set_range()\n result = self.range\n\n return str(\" \".join([str(n) for n in result]))\n\n\n###############################################################################\n# Executable code\n###############################################################################\n\n\ndef get_inputs(test_inputs=None):\n\n it = iter(test_inputs.split(\"\\n\")) if test_inputs else None\n\n def uinput():\n \"\"\" Unit-testable input function wrapper \"\"\"\n if it:\n return next(it)\n else:\n return input()\n\n # Getting string inputs. Place all uinput() calls here\n num = int(uinput())\n nums = [[int(s) for s in uinput().split()] for i in range(3)]\n\n # Decoding inputs into a list\n inputs = []\n inputs.append(num)\n inputs += nums\n\n return inputs\n\n\ndef calculate(test_inputs=None):\n \"\"\" Base class calculate method wrapper \"\"\"\n return Diploma(get_inputs(test_inputs)).calculate()\n\n\n###############################################################################\n# Unit Tests\n###############################################################################\n\n\nclass unitTests(unittest.TestCase):\n\n def test_sample_tests(self):\n \"\"\" Quiz sample tests. Add \\n to separate lines \"\"\"\n\n # Sample test 1\n test = \"6\\n1 5\\n2 6\\n3 7\"\n self.assertEqual(calculate(test), \"1 2 3\")\n self.assertEqual(get_inputs(test), [6, [1, 5], [2, 6], [3, 7]])\n\n # Other tests\n test = \"10\\n1 2\\n1 3\\n1 5\"\n self.assertEqual(calculate(test), \"2 3 5\")\n test = \"6\\n1 3\\n2 2\\n2 2\"\n self.assertEqual(calculate(test), \"2 2 2\")\n\n def test_Diploma_class__basic_functions(self):\n \"\"\" Diploma class basic functions testing \"\"\"\n\n # Constructor test\n d = Diploma([6, [1, 5], [2, 6], [3, 7]])\n self.assertEqual(d.list[0], 6)\n self.assertEqual(d.n, 6)\n self.assertEqual(d.ranges[0], [1, 5])\n\n # Calculate ranges\n d.set_range()\n self.assertEqual(d.range, [1, 2, 3])\n\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 print(calculate())\n", "n = int(input())\r\nmin1, max1 = map(int, input().split())\r\nmin2, max2 = map(int, input().split())\r\nmin3, max3 = map(int, input().split())\r\nx = min(max1, n - min2 - min3)\r\ny = min(max2, n - x - min3)\r\nprint(x, y, n - x - y)", "def solve(_):\r\n n = int(input())\r\n m1, mx1 = map(int, input().split())\r\n m2, mx2 = map(int, input().split())\r\n m3, mx3 = map(int, input().split())\r\n\r\n p = m1 + m2 + m3\r\n p = n - p\r\n if p > mx1 - m1 and p > 0:\r\n p -= (mx1 - m1)\r\n m1 += (mx1 - m1)\r\n else:\r\n m1 += p\r\n p = 0\r\n if p > mx2 - m2 and p > 0:\r\n p -= (mx2 - m2)\r\n m2 += (mx2 - m2)\r\n else:\r\n m2 += p\r\n p = 0\r\n if p > mx3 - m3 and p > 0:\r\n p -= (mx3 - m3)\r\n m3 += (mx3 - m3)\r\n else:\r\n m3 += p\r\n p = 0\r\n\r\n print(m1, m2, m3)\r\n\r\n\r\n# for _ in range(int(input())):\r\n# solve(_)\r\n\r\nsolve(1)\r\n", "n = int(input())\r\nm1 = list(map(int, input().split()))\r\nm2 = list(map(int, input().split()))\r\nm3 = list(map(int, input().split()))\r\na1 = m1[0]\r\na2 = m2[0]\r\na3 = m3[0]\r\nif a1 + a2 + a3 == n:\r\n print(a1, a2, a3)\r\nelse:\r\n if m1[1] + a2 + a3 >= n:\r\n a1 = n - a2 - a3\r\n print(a1, a2, a3)\r\n else:\r\n a1 = m1[1]\r\n if a1 + m2[1] + a3 >= n:\r\n a2 = n - a1 - a3\r\n print(a1, a2, a3)\r\n else:\r\n a2 = m2[1]\r\n a3 = n - a1 - a2\r\n print(a1, a2, a3)\r\n", "n = int(input())\nli = []\nfor i in range(3):\n li.append(list(map(int, input().split())))\nans = []\nt = 0\nfor i in range(3):\n ans.append(li[i][0])\n t += li[i][0]\nn -= t\nfor i in range(3):\n ans[i] += min(n, li[i][1] - li[i][0])\n n -= min(n, li[i][1] - li[i][0])\nprint(*ans)", "# print (\"Input n\")\nn = int(input())\n# print (\"Input first degree limits on one line\")\nfirst = input().split()\nfirstmin = int(first[0])\nfirstmax = int(first[1])\nextrafirst = firstmax - firstmin\n# print (\"Input second degree limits on one line\")\nsecond = input().split()\nsecondmin = int(second[0])\nsecondmax = int(second[1])\nextrasecond = secondmax - secondmin\n# print (\"Input third degree limits on one line\")\nthird = input().split()\nthirdmin = int(third[0])\nthirdmax = int(third[1])\nextrathird = thirdmax - thirdmin\n\nfirsttotal = firstmin\nsecondtotal = secondmin\nthirdtotal = thirdmin\nleftover = n - firstmin - secondmin - thirdmin\n\nif (extrafirst >= leftover): # All the rest get firsts\n firsttotal += leftover\nelse:\n firsttotal = firstmax\n leftover -= extrafirst\n if (extrasecond >= leftover): # All the rest get seconds\n secondtotal += leftover\n else:\n secondtotal = secondmax\n leftover -= extrasecond\n thirdtotal += leftover\n\nprint(str(firsttotal) + \" \" + str(secondtotal) + \" \" + str(thirdtotal))\n", "n = int(input())\r\nmin1, max1 = [int(i) for i in input().split()]\r\nmin2, max2 = [int(i) for i in input().split()]\r\nmin3, max3 = [int(i) for i in input().split()]\r\ncount1, count2, count3 = 0, 0, 0\r\nn -= (min1 + min2 + min3)\r\ncount1 = min1\r\ncount2 = min2\r\ncount3 = min3\r\nmax1 -= min1\r\nmax2 -= min2\r\nmax3 -= min3\r\nif n > 0 and n >= max1:\r\n count1 += max1\r\n n -= max1\r\n if n > 0 and n >= max2:\r\n count2 += max2\r\n n -= max2\r\n if n > 0:\r\n count3 += n\r\n elif n > 0 and n < max2:\r\n count2 += n\r\n n = 0\r\nelif n > 0 and n < max1:\r\n count1 += n\r\n n = 0\r\nprint(count1, count2, count3, sep = ' ')\r\n", "n = int(input())\nmin1, max1 = map(int, input().split())\nmin2, max2 = map(int, input().split())\nmin3, max3 = map(int, input().split())\na = max1 # берем максимальное возможное количество первых степеней\nb = max2 # и максимальное возможное количество вторых степеней\nc = min3 # и минимальное возможное количество третьих степеней\n# теперь нужно проверить, выполняются ли условия\ns = a+b+c\n\nif s < n: # если кому-то не хватило грамоты\n c += n-s\nelif s > n: # если кому-то досталось больше одной грамоты\n b -= min(s-n, max2-min2)\n a -= max(0, s-n-max2+min2)\n \nprint(a, b, c)", "n = int(input())\r\nm1 ,ma1= map(int, input().split())\r\nm2,ma2 = map(int, input().split())\r\nm3,ma3 = map(int, input().split())\r\n\r\na1 = min(ma1, n - m2 - m3)\r\na2 = min(ma2, n - a1 - m3)\r\na3 = n - a1 - a2\r\n\r\nprint(a1, a2, a3)\r\n", "n=int(input())\r\na=[]\r\nfor i in range(3):\r\n\ta.append(list(map(int,input().split())))\r\nk=a[0][0]+a[1][0]+a[2][0]\r\nm=a[0][1]+a[1][1]+a[2][1]\r\nx=n-k\r\nfor i in range(3):\r\n\ty=a[i][1]-a[i][0]\r\n\tif x<y:\r\n\t\ty=max(0,x)\r\n\tprint(a[i][0]+y,end=' ')\r\n\tx-=y", "__author__ = 'myduomilia'\n\nn = int(input())\n\na = [0 for i in range(3)]\nb = [0 for i in range(3)]\n\nfor i in range(3):\n a[i], b[i] = list(map(int, input().split()))\n n -= a[i]\n b[i] -= a[i]\n\nfor i in range(3):\n if n > 0 :\n if(b[i] > n):\n a[i] += n\n n = 0\n else:\n a[i] += b[i]\n n -= b[i]\n b[i] = 0\nfor i in range(3):\n print(a[i], end=\" \")", "n = int(input())\r\nmin1,max1 = map(int,input().split())\r\nmin2,max2 = map(int,input().split())\r\nmin3,max3 = map(int,input().split())\r\nr = max1 + 1\r\nwhile r>max1:\r\n\tr = n - min2 - min3\r\n\tif r > max1 and min2 < max2 :\r\n\t\tmin2 = min2 + 1\r\n\telif r > max1 and min3 < max3:\r\n\t\tmin3 = min3 + 1\r\n\telse:\r\n\t\tbreak\r\nprint(r,min2,min3)\r\n", "import sys\n\nn = int(input())\nmin1, max1 = map(int, sys.stdin.readline().split())\nmin2, max2 = map(int, sys.stdin.readline().split())\nmin3, max3 = map(int, sys.stdin.readline().split())\n\nfirst_max = n - min2 - min3\nfirst = 0\nsecond = 0\nthird = 0\nif first_max <= max1:\n first = first_max\nelse:\n first = max1\n\nn = n - first\nsecond_max = n - min3\nif second_max <= max2:\n second = second_max\nelse:\n second = max2\n\nthird = n - second\n\nprint(first, second, third)\n", "n = int(input())\r\n\r\nline = input()\r\nmin1 = int(line.split(' ')[0])\r\nmax1 = int(line.split(' ')[1])\r\n\r\nline = input()\r\nmin2 = int(line.split(' ')[0])\r\nmax2 = int(line.split(' ')[1])\r\n\r\nline = input()\r\nmin3 = int(line.split(' ')[0])\r\nmax3 = int(line.split(' ')[1])\r\n\r\ncount1 = min1\r\ncount2 = min2\r\ncount3 = min3\r\ncount = count1 + count2 + count3\r\nwhile( count < n):\r\n if (count1 < max1):\r\n count1 += 1\r\n count += 1\r\n elif(count2 < max2):\r\n count2 +=1\r\n count += 1\r\n else:\r\n count3 += 1\r\n count += 1\r\n\r\nprint(count1, count2, count3)\r\n\r\n\r\n", "n = int(input())\r\nMin1, Max1 = map(int, input().split())\r\nMin2, Max2 = map(int, input().split())\r\nMin3, Max3 = map(int, input().split())\r\n\r\na = Max1\r\nb = Max2\r\nc = n - a - b\r\n\r\nif c < Min3:\r\n c = Min3\r\n b = n - a - c\r\nif b < Min2:\r\n b = Min2\r\n a = n - b - c\r\n\r\nprint(a, b, c)", "n=int(input())\r\nmn=[]\r\nmx=[]\r\nans=[]\r\nfor i in range(1,4):\r\n x,y=map(int,(input().split()))\r\n mn.append(x)\r\n mx.append(y)\r\nm1=n-(mn[1]+mn[2])\r\nif m1<mx[0]:\r\n ans.append(m1)\r\nelse:\r\n ans.append(mx[0])\r\nn-=ans[0]\r\nm2=n-mn[2]\r\nif m2<mx[1]:\r\n ans.append(m2)\r\nelse:\r\n ans.append(mx[1])\r\nans.append(n-ans[1])\r\nfor i in range(len(ans)):\r\n print(ans[i],end=' ')\r\n\r\n", "import bisect\r\nimport collections\r\nimport copy\r\nimport functools\r\nimport heapq\r\nimport itertools\r\nimport math\r\nimport random\r\nimport re\r\nimport sys\r\nimport time\r\nimport string\r\nfrom typing import List, Mapping\r\nsys.setrecursionlimit(999999)\r\n\r\nn = int(input( ))\r\nms = []\r\nfor _ in range(3):\r\n a,b= map(int,input().split())\r\n ms.append([a,b])\r\n\r\nc = ms[2][0]\r\nb = ms[1][0]\r\na = ms[0][0]\r\nr = n-a-b-c\r\nif r:\r\n a = min(a+r,ms[0][1])\r\n r = n-a-b-c\r\nif r:\r\n b = min(b+r,ms[1][1])\r\n r = n-a-b-c\r\nif r:\r\n c = min(c+r,ms[2][1])\r\n\r\nprint(a,b,c)\r\n", "__author__ = 'Andrey'\n\n\ndef solve(n):\n global min_1\n global min_2\n global min_3\n global max_1\n global max_2\n global max_3\n c_1, c_2, c_3 = 0, 0, 0\n c_2 += min_2\n c_3 += min_3\n n -= min_2 + min_3\n firsts = min(n, max_1)\n c_1 += firsts\n n -= firsts\n if n == 0:\n return c_1, c_2, c_3\n else:\n seconds = min(max_2 - min_2, n)\n n -= seconds\n c_2 += seconds\n if n == 0:\n return c_1, c_2, c_3\n else:\n thirds = min(max_3 - min_3, n)\n n -= thirds\n c_3 += thirds\n if n == 0:\n return c_1, c_2, c_3\n\n\n\nn = int(input())\nmin_1, max_1 = map(int, input().split())\nmin_2, max_2 = map(int, input().split())\nmin_3, max_3 = map(int, input().split())\nprint(*solve(n))", "n = int(input())\nmin1, max1 = map(int, input().split())\nmin2, max2 = map(int, input().split())\nmin3, max3 = map(int, input().split())\n\nv = [min1,min2,min3]\nn -= min1+min2+min3\nfor i in range(min1, max1):\n if n <= 0:\n break\n v[0] += 1\n n-=1\nfor i in range(min2, max2):\n if n <= 0:\n break\n v[1] += 1\n n-=1\nfor i in range(min3, max3):\n if n <= 0:\n break\n v[2] += 1\n n-=1\n\nprint(*v)\n", "import sys\nn = int(input())\nmin1, max1 = map(int, sys.stdin.readline().split())\nmin2, max2 = map(int, sys.stdin.readline().split())\nmin3, max3 = map(int, sys.stdin.readline().split())\nnb1 = min(max1,n-min2-min3)\nn -= nb1\nnb2 = min(max2,n-min3)\nnb3 = n - nb2\nprint(nb1,nb2,nb3)\n", "n = int(input())\nmn1, mx1 = map(int, input().split())\nmn2, mx2 = map(int, input().split())\nmn3, mx3 = map(int, input().split())\n\na = min(mx1, n - mn2 - mn3)\nb = min(mx2, n - a - mn3)\nc = n - a - b\n\nprint(a, b, c) \n", "#in the name of god\r\n#Mr_Rubick\r\nn=int(input())\r\nmin1,max1=map(int,input().split())\r\nmin2,max2=map(int,input().split())\r\nmin3,max3=map(int,input().split())\r\nx=min(max1,n-min2-min3)\r\ny=min(max2,n-x-min3)\r\nprint(x,y,n-x-y)", "n=int(input())\r\nmin1,max1=map(int,input().split())\r\nmin2,max2=map(int,input().split())\r\nmin3,max3=map(int,input().split())\r\nx,y,z,w=min1,min2,min3,(min1+min2+min3)\r\nwhile w<n:\r\n if x<max1:\r\n x+=1\r\n elif y<max2:\r\n y+=1\r\n elif z<max3:\r\n z+=1\r\n w+=1\r\nprint(x,y,z)\r\n\r\n", "# LUOGU_RID: 116376782\nn=int(input())\r\nmin1,max1=map(int,input().split())\r\nmin2,max2=map(int,input().split())\r\nmin3,max3=map(int,input().split())\r\nif n-min2-min3>=max1:\r\n n=n-max1\r\n if n-min3>=max2:\r\n n=n-max2\r\n print(max1,max2,n)\r\n else:\r\n n=n-min3\r\n print(max1,n,min3)\r\nelse:\r\n print(n-min2-min3,min2,min3)", "n = int(input())\r\namin, amax = map(int, input().split())\r\nbmin, bmax = map(int, input().split())\r\ncmin, cmax = map(int, input().split())\r\ntemp1 = min(amax, n - bmin - cmin)\r\nn -= temp1\r\ntemp2 = min(bmax, n - cmin)\r\nn -= temp2\r\ntemp3 = n\r\nprint(temp1, temp2, temp3)", "import sys\n\n# n participants\n# x 1st degree diplomas (? <= x <= ?)\n# y 2nd degree diplomas (? <= y <= ?)\n# z 3rd degree diplomas (? <= z <= ?)\n# -----------------------------------\n# find the distribution of diplomas that maximizes x, then y, such that\n# n = x + y + z\n\nn, x_min, x_max, y_min, y_max, z_min, z_max = [\n int(i) for i in sys.stdin.read().split()\n]\n\nx = min(x_max, n - (z_min + y_min))\ny = min(y_max, n - (z_min + x))\nz = n - (x + y)\n\nprint(x, y, z)", "n = int(input())\r\nmin1, max1 = map(int, input().split())\r\nmin2, max2 = map(int, input().split())\r\nmin3, max3 = map(int, input().split())\r\na1 = min(max1, n - min2 - min3)\r\nn -= a1\r\na2 = min(max2, n - min3)\r\na3 = n - a2\r\nprint(a1, a2, a3)", "n=int(input())\r\nmi1,mx1=[int(i) for i in input().split()]\r\nmi2,mx2=[int(i) for i in input().split()]\r\nmi3,mx3=[int(i) for i in input().split()]\r\na,b,c=n-mi2-mi3,mi2,mi3\r\nif a>mx1:\r\n b+=a-mx1\r\n a=mx1\r\n if b>mx2:\r\n c+=b-mx2\r\n b=mx2\r\nprint (\"%s %s %s\"%(a,b,c))", "I=lambda:map(int,input().split())\r\nn=next(I())\r\na,b=I()\r\nc,d=I()\r\nf,e=I()\r\nx=min(b,n-c-f)\r\ny=min(d,n-x-f)\r\nprint(x,y,n-x-y)", "n = int(input())\n\nminis, maxis = [], []\nfor i in range(3):\n s = list(map(int, input().split()))\n minis.append(s[0])\n maxis.append(s[1])\n\nleft = n\ndiploms = [0 for i in range(3)]\nfor i in range(3):\n diploms[i] = minis[i]\n left -= minis[i]\nfor i in range(3):\n d = min(left, maxis[i] - minis[i])\n diploms[i] += d\n left -= d\n\nprint(' '.join(map(str, diploms)))\n \n", "import math,string,itertools,fractions,heapq,collections,re,array,bisect,copy\nfrom itertools import chain, dropwhile, permutations, combinations\nfrom collections import defaultdict, deque\n\n# Guide:\n# 1. construct complex data types while reading (e.g. graph adj list)\n# 2. avoid any non-necessary time/memory usage\n# 3. avoid templates and write more from scratch\n# 4. switch to \"flat\" implementations\n\ndef VI(): return list(map(int,input().split()))\ndef I(): return int(input())\ndef LIST(n,m=None): return [0]*n if m is None else [[0]*m for i in range(n)]\ndef ELIST(n): return [[] for i in range(n)]\ndef MI(n=None,m=None): # input matrix of integers\n if n is None: n,m = VI()\n arr = LIST(n)\n for i in range(n): arr[i] = VI()\n return arr\ndef MS(n=None,m=None): # input matrix of strings\n if n is None: n,m = VI()\n arr = LIST(n)\n for i in range(n): arr[i] = input()\n return arr\ndef MIT(n=None,m=None): # input transposed matrix/array of integers\n if n is None: n,m = VI()\n a = MI(n,m)\n arr = LIST(m,n)\n for i,l in enumerate(a):\n for j,x in enumerate(l):\n arr[j][i] = x\n return arr\n\n\ndef run(n,x,l,r):\n s = 0\n curr = 1\n for i in range(n):\n skip = (l[i]-curr) // x\n s += r[i]-curr-skip*x+1\n curr = r[i]+1\n print(s)\n\n\ndef main(info=0):\n n = I()\n an, ax = VI()\n bn, bx = VI()\n cn, cx = VI()\n\n m = [an, bn, cn]\n\n if sum(m) < n and ax>an:\n m[0] += min(ax-an, n-sum(m))\n if sum(m) < n and bx>bn:\n m[1] += min(bx-bn, n-sum(m))\n if sum(m) < n and cx>cn:\n m[2] += min(cx-cn, n-sum(m))\n\n print(m[0], m[1], m[2])\n\n\nif __name__ == \"__main__\":\n main()\n", "import math\r\nimport itertools\r\nimport collections\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\ndef wr(arr): return ' '.join(map(str, arr))\r\ndef prime(n):\r\n if n == 2:\r\n return True\r\n if n % 2 == 0 or n <= 1:\r\n return False\r\n\r\n sqr = int(math.sqrt(n)) + 1\r\n\r\n for d in range(3, sqr, 2):\r\n if n % d == 0:\r\n return False\r\n return True\r\ndef revn(n):\r\n m = 0\r\n while n > 0:\r\n m = m * 10 + n % 10\r\n n = n // 10\r\n return m\r\n\r\nn = ii()\r\nmi1, ma1 = mi()\r\nmi2, ma2 = mi()\r\nmi3, ma3 = mi()\r\nd = [mi1, mi2, mi3]\r\nt = n - mi1 - mi2 - mi3\r\nwhile t > 0 and d[0] < ma1:\r\n d[0] += 1\r\n t -= 1\r\nwhile t > 0 and d[1] < ma2:\r\n d[1] += 1\r\n t -= 1\r\nwhile t > 0 and d[2] < ma3:\r\n d[2] += 1\r\n t -= 1\r\nprint(wr(d))", "n = int(input())\nmin1, max1 = map(int, input().split())\nmin2, max2 = map(int, input().split())\nmin3, max3 = map(int, input().split())\n\na1 = min1\na2 = min2\na3 = min3\nn = n - a1 - a2 - a3\n\nmax1 -= min1\nmax2 -= min2\nmax3 -= min3\n\nif n > max1:\n a1 += max1\n n -= max1\nelse:\n a1 += n\n n = 0\nif n > max2:\n a2 += max2\n n -= max2\nelse:\n a2 += n\n n = 0\nif n > max3:\n a3 += max3\n n -= max3\nelse:\n a3 += n\n n = 0\nprint(a1, a2, a3)", "n = int(input())\r\na, b = map(int, input().split())\r\nc, d = map(int, input().split())\r\ne, f = map(int, input().split())\r\nco = 0\r\nn-=(a+c+e)\r\nfor i in range(n):\r\n if(a<b):\r\n a+=1\r\n elif(c <d):\r\n c+=1\r\n elif(e<f):\r\n e+=1\r\nprint(a, c, e)\r\n", "# import sys\n# sys.stdin=open('input.txt', 'r')\n# sys.stdout=open('output.txt', 'w')\n\nn=int(input())\nmin1, max1=[int(k) for k in input().split()]\nmin2, max2=[int(k) for k in input().split()]\nmin3, max3=[int(k) for k in input().split()]\np1=max1\np2=max2\np3=max3\nwhile p1+p2+p3>n:\n if p3>min3:\n p3-=1\n elif p2>min2:\n p2-=1\n elif p1>min1:\n p1-=1\nprint(p1, p2, p3)\n", "n = int(input())\nmin1, max1 = [int(c) for c in input().split()]\nmin2, max2 = [int(c) for c in input().split()]\nmin3, max3 = [int(c) for c in input().split()]\n\na, b, c = 0, 0, 0\nif n - min3 <= max1 + max2:\n c = min3\nelse:\n c = n - max1 - max2\n\nif n - c - min2 <= max1:\n b = min2\n a = n - c - b\nelse:\n a = max1\n b = n - c - a\n\nprint(str(a) + ' '+ str(b) + ' ' + str(c))\n", "n = int(input())\nmn1,mx1 = map(int, input().split())\nmn2,mx2 = map(int, input().split())\nmn3,mx3 = map(int, input().split())\n\nfd = n - mn2 - mn3\nif fd > mx1:\n fd = mx1\nn -= fd\nsd = n - mn3\nif sd > mx2:\n sd = mx2\ntd = n - sd\nprint(fd,sd,td)\n", "n=int(input())\r\nm1,M1=map(int,input().split())\r\nm2,M2=map(int,input().split())\r\nm3,M3=map(int,input().split())\r\nf,s,t=m1,m2,m3\r\nn-=(m1+m2+m3)\r\nif n>0:\r\n x=min(M1-m1,n)\r\n n-=x\r\n f+=x\r\nif n>0:\r\n x=min(M2-m2,n)\r\n n-=x\r\n s+=x\r\nif n>0:\r\n x=min(M3-m3,n)\r\n n-=x\r\n t+=x\r\nprint(f,s,t,end=\" \")", "int_total_diplomas = int(input())\r\n\r\ndegree_1 = list(map(int, list(input().split())))\r\ndegree_2 = list(map(int, list(input().split())))\r\ndegree_3 = list(map(int, list(input().split())))\r\n\r\nmin_degree_1 = degree_1[0]\r\nmax_degree_1 = degree_1[1]\r\nmin_degree_2 = degree_2[0]\r\nmax_degree_2 = degree_2[1]\r\nmin_degree_3 = degree_3[0]\r\nmax_degree_3 = degree_3[1]\r\n\r\ndegree_1_total = min_degree_1\r\ndegree_2_total = min_degree_2\r\ndegree_3_total = min_degree_3\r\n\r\ndef calculate_diplomas(int_total_diplomas,degree_1_total,degree_2_total, degree_3_total,max_degree_1,max_degree_2):\r\n\r\n if int_total_diplomas <= degree_2_total + degree_3_total + max_degree_1:\r\n degree_1_total = int_total_diplomas - degree_2_total - degree_3_total\r\n print(degree_1_total,degree_2_total,degree_3_total)\r\n return\r\n \r\n else :\r\n degree_1_total = max_degree_1\r\n \r\n if int_total_diplomas <= degree_1_total + degree_3_total + max_degree_2:\r\n degree_2_total = int_total_diplomas - degree_1_total - degree_3_total\r\n print(degree_1_total,degree_2_total,degree_3_total)\r\n return \r\n else:\r\n degree_2_total = max_degree_2\r\n \r\n degree_3_total = int_total_diplomas - degree_2_total - degree_1_total\r\n print(degree_1_total,degree_2_total,degree_3_total)\r\n return\r\n\r\n\r\n\r\n\r\ncalculate_diplomas(int_total_diplomas,degree_1_total,degree_2_total, degree_3_total,max_degree_1,max_degree_2)", "### Diploma , problema http://codeforces.com/contest/557/problem/A\n\nn =\tint( input() )\t\t\t\t\t\t\t\t## Number of students \n\nminArray , maxArray = [ 0 ]*3 ,[ 0 ]*3\t\t\t## Array of limits of places\n\nfor i in range( 0 , 3 ):\n\n\ttempString = input()\t\t\t\t\t## Read line\n\ttempList = tempString.split()\t\t\t## List of strings\n\n\tminArray[ i ] , maxArray[ i ] = int( tempList[ 0 ] ) , int( tempList[ 1 ] )\n\ndef testPosible( array , n , minArray , maxArray ):\n\tif( sum( array ) <= n ):\n\n\t\tfor i in range( 0 , 3 ):\n\t\t\tif( minArray[i] > array[ i ] or array[ i ] > maxArray[ i ] ):\n\t\t\t\treturn False\n\n\t\treturn True\n\telse:\n\t\treturn False\n\n### Problem solution , choose number of prices as the minimum for every limit\nprice = minArray\t\t \n\nif( testPosible( [ maxArray[ 0 ] , minArray[ 1 ] , minArray[ 2 ] ] , n , minArray , maxArray ) ):\n\tprice[ 0 ] = maxArray[ 0 ]\nelse:\n\tprice[ 0 ] = n - price[ 1 ] - price[ 2 ] \n\nif( testPosible( [ price[ 0 ] , maxArray[ 1 ] , price[ 2 ] ] , n , minArray , maxArray ) ):\n\tprice[ 1 ] = maxArray[ 1 ]\nelse:\n\tprice[ 1 ] = n - price[ 0 ] - price[ 2 ] \n\nif( testPosible( [ price[ 0 ] , price[ 1 ] , maxArray[ 2 ] ] , n , minArray , maxArray ) ):\n\tprice[ 2 ] = maxArray[ 2 ]\nelse:\n\tprice[ 2 ] = n - price[ 0 ] - price[ 1 ] \n\nprint( price[ 0 ], price[ 1 ], price[ 2 ] )\n", "n = int(input())\r\nmin1, max1 = map(int, input().split(' '))\r\nmin2, max2 = map(int, input().split(' '))\r\nmin3, max3 = map(int, input().split(' '))\r\n\r\nn1, n2, n3 = min1, min2, min3\r\nif n1+n2+n3 < n:\r\n n1 = max1\r\n if n1+n2+n3 > n:\r\n n1 -= (n1+n2+n3)-n\r\n else:\r\n n2 = max2\r\n if n1+n2+n3 > n:\r\n n2 -= (n1+n2+n3) - n\r\n else:\r\n n3 = max3\r\n if n1+n2+n3 > n:\r\n n3 -= (n1+n2+n3) - n\r\n\r\nprint(n1, n2, n3)", "n = int(input())\r\nminimum = []\r\nmaximum = []\r\nfor x in range(3):\r\n string = input()\r\n numbers = string.split()\r\n minimum.append(int(numbers[0]))\r\n maximum.append(int(numbers[1]))\r\ndiplomas = []\r\nfor x in range(3):\r\n minimum[x] = 0\r\n a = min([n - sum(minimum), maximum[x]])\r\n minimum[x] = a\r\n diplomas.append(a)\r\nprint(\" \".join(map(str, diplomas)))", "n = int(input())\r\na1, a2 = map(int, input().split())\r\nb1, b2 = map(int, input().split())\r\nc1, c2 = map(int, input().split())\r\n\r\na = a1\r\nb = b1\r\nc = c1\r\ns = a + b + c\r\n\r\nif a2 - a1 < n - s:\r\n a = a2\r\n s += a2 - a1\r\n if b2 - b1 < n - s:\r\n b = b2\r\n s += b2 - b1\r\n if c2 - c1 < n - s:\r\n c = c2\r\n else:\r\n c += n - s\r\n else:\r\n b += n - s\r\nelse:\r\n a += n - s\r\n\r\nprint(a, b, c)\r\n", "n = int(input())\ndef r():\n return [int(i) for i in input().split()]\n\ndeg = r(), r(), r()\n\nl = [i[0] for i in deg]\ndef remains():\n return n - sum(l)\n\ndef better(i):\n global l\n rem = remains()\n l[i] = min(l[i]+rem, deg[i][1])\n\nfor i in range(len(l)):\n better(i)\n\nprint(\" \".join(str(i) for i in l))\n", "n, mind, v = int(input()), [0] * 3, [0] * 3\r\nfor i in range(3):\r\n mind[i], v[i] = map(int, input().split())\r\nt = sum(v)\r\nfor i in range(2, -1, -1):\r\n c = max(0, min(t - n, v[i] - mind[i]))\r\n v[i] -= c\r\n t -= c\r\nprint(v[0], v[1], v[2])", "##row, col, order = input().split(' ') \r\n##row = int(row)\r\n##col = int(col)\r\n##\r\n##init_list = []\r\n##\r\n##for i in range(row):\r\n## init_list.append(input().split(' '))\r\n##\r\n##if order=='0':\r\n## for i in range(row):\r\n## print()\r\n## for j in range(col,0,-1):\r\n## print(init_list[i][j-1], end = ' ')\r\n##else:\r\n## for i in range(row,0,-1):\r\n## print()\r\n## for j in range(col):\r\n## print(init_list[i-1][j], end = ' ')\r\n\r\ndef result(a,b,c:int) -> None:\r\n print(a, end = ' ')\r\n print(b, end = ' ')\r\n print(c)\r\n\r\npeople = int(input())\r\nmini = []\r\nmaxi = []\r\nfor i in range(3):\r\n temp = input().split(' ')\r\n mini.append(int(temp[0]))\r\n maxi.append(int(temp[1]))\r\n\r\nmini_sum = 0\r\nmaxi_sum = 0\r\n\r\nfor i in range(3):\r\n mini_sum += mini[i]\r\n maxi_sum += maxi[i]\r\n\r\nif mini_sum == people:\r\n for i in range(3):\r\n print(mini[i], end = ' ')\r\nelif maxi_sum == people:\r\n for i in range(3):\r\n print(maxi[i], end = ' ')\r\nelse:\r\n if people>maxi[0]+maxi[1]+mini[2]:\r\n result(maxi[0], maxi[1], people - maxi[0] - maxi[1])\r\n elif people>maxi[0]+mini[1]+mini[2]:\r\n result(maxi[0], people - maxi[0] - mini[2], mini[2])\r\n else:\r\n result(people - mini[1] - mini[2], mini[1], mini[2])\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()); a = [0]*3; b = [0]*3;\r\na[0], b[0] = map(int, input().split())\r\na[1], b[1] = map(int, input().split())\r\na[2], b[2] = map(int, input().split())\r\nif sum(a) < n:\r\n n -= sum(a)\r\n m1 = min(n, b[0] - a[0])\r\n n -= m1\r\n m2 = min(n, b[1] - a[1])\r\n n -= m2\r\n m3 = min(n, b[2] - a[2])\r\n n -= m3\r\n a[0] += m1; a[1] += m2; a[2] += m3\r\nprint(a[0], a[1], a[2])\r\n", "import sys\n\nsums, ans = int(input()), [0]*4\nmat = [[int(i) for i in line.split()] for line in sys.stdin]\nfor i in range(len(mat)):\n ans[i] = mat[i][0]\n sums -= ans[i]\nfor i in range(3):\n if sums > 0 and ans[i] < mat[i][1]:\n tmp = min(sums, mat[i][1] - ans[i])\n ans[i] += tmp\n sums -= tmp\nprint(ans[0], ans[1], ans[2])\n \t\t \t \t \t\t\t \t\t\t\t \t\t\t\t \t \t \t", "n=int(input())\r\nmin1,max1=map(int,input().split())\r\nmin2,max2=map(int,input().split())\r\nmin3,max3=map(int,input().split())\r\na1=min(max1,n-min2-min3)\r\na2=min(max2,n-a1-min3)\r\nprint(a1,a2,n-a1-a2)", "n = int(input())\nmin1, max1 = list(map(int, input().split()))\n\nmin2, max2 = list(map(int, input().split()))\n\nmin3, max3 = list(map(int, input().split()))\n\ndef good(a, b, c, n):\n return (a + b + c) == n\n\ndef find_val(n, min1, max1, min2, max2, min3, max3):\n minn = min1 + min2 + min3\n maxx = max1 + max2 + max3\n \n if minn == n:\n return (min1, min2, min3) \n elif maxx == n:\n return (max1, max2, max3)\n else:\n v1, v2, v3 = max1 - min1, max2 - min2, max3 - min3\n \n s = min1 + min2 + min3\n d = n - s\n if d <= v1:\n min1 += d\n elif d <= v1 + v2:\n min1 += v1\n min2 += d - v1\n else:\n min1 += v1\n min2 += v2\n min3 += d - v1 - v2\n\n return min1, min2, min3\n\na, b, c = find_val(n, min1, max1, min2, max2, min3, max3) \n\nprint(str(a) + ' ' + str(b) + ' ' + str(c))\n", "__author__ = 'tka4a'\r\n\r\nn = int(input())\r\n\r\ndef getOpt(n, ma, test):\r\n if (n - test >= ma):\r\n return ma\r\n else:\r\n return n - test\r\n\r\n\r\na1, b1 = map(int, input().split())\r\na2, b2 = map(int, input().split())\r\na3, b3 = map(int, input().split())\r\n\r\nk1 = getOpt(n, b1, a2 + a3)\r\nk2 = getOpt(n - k1, b2, a3)\r\nk3 = n - k1 - k2\r\n\r\nprint(k1, k2, k3)\r\n\r\n", "n=int(input())\r\na=[0]*3\r\nb=[0]*3\r\nfor i in range(3):\r\n a[i],b[i]=map(int,input().split())\r\nif(a[1]+a[2]+b[0]<=n):\r\n if(a[2]+b[1]>n-b[0]):\r\n print(b[0],n-b[0]-a[2],a[2])\r\n else:\r\n print(b[0],b[1],n-b[0]-b[1])\r\nelse:\r\n print(n-a[1]-a[2],a[1],a[2])", "from sys import stdin\r\nfrom sys import stdout\r\n\r\nn = int(stdin.readline())\r\nmin1, max1 = map(int, stdin.readline().split())\r\nmin2, max2 = map(int, stdin.readline().split())\r\nmin3, max3 = map(int, stdin.readline().split())\r\nday1 = min(n-min2-min3, max1)\r\nday2 = min(n-day1-min3, max2)\r\nday3 = n-day1-day2\r\nstdout.write(str(day1)+\" \"+str(day2)+\" \"+str(day3))\r\n", "n = int(input())\nmin1, max1 = map(int, input().split())\nmin2, max2 = map(int, input().split())\nmin3, max3 = map(int, input().split())\ns = min1 + min2 + min3\nif s < n:\n min1 = min(max1, min1 + n - s)\ns = min1 + min2 + min3 \nif s < n:\n min2 = min(max2, min2 + n - s)\ns = min1 + min2 + min3\nif s < n:\n min3 = min(max3, min3 + n - s)\nprint(min1, min2, min3)\n", "n = int(input())\r\nmin1, max1 = map(int, input().split())\r\nmin2, max2 = map(int, input().split())\r\nmin3, max3 = map(int, input().split())\r\n \r\nd1 = min(n - min2 - min3, max1)\r\nd2 = min(n - d1 - min3, max2)\r\nd3 = n - d1 - d2\r\n \r\nprint(d1,d2,d3)", "n = int(input())\r\nmin1, max1 = map(int, input().split())\r\nmin2, max2 = map(int, input().split())\r\nmin3, max3 = map(int, input().split())\r\n\r\nfrst = min1\r\nscnd = min2\r\nthrd = min3\r\nn = n - (min1+min2+min3)\r\n\r\nwhile n != 0 and frst < max1:\r\n frst += 1\r\n n -= 1\r\nwhile n != 0 and scnd < max2:\r\n scnd += 1\r\n n -= 1\r\nwhile n != 0 and thrd < max3:\r\n thrd += 1\r\n n -= 1\r\n\r\nprint(frst, scnd, thrd)\r\n\r\n\r\n\r\n\r\n" ]

[ "t,a,b,M,I=int(input()),1,1,1000000007,1000000005\nfor i in range(1,t):\n a=a*i%M\na=pow(a,I,M)\nfor i in range(t+1,t*2):\n b=b*i%M\nprint(((2*a*b)%M-t)%M)\n \t\t\t\t \t\t\t\t\t\t\t \t\t\t \t \t\t\t\t \t\n \t \t \t \t \t\t \t\t \t \t \t", "import sys\n\nreadline = sys.stdin.readline\n\n\nMOD = 1000000007\n\n\ndef read_input() -> int:\n return int(readline().strip())\n\n\ndef solve(n: int) -> int:\n cmb = 1\n for i in range(n):\n cmb = cmb * (n + i) * pow(i + 1, MOD - 2, MOD) % MOD\n return (cmb * 2 - n) % MOD\n\n\nprint(solve(read_input()))\n", "n=int(input())\r\nm=int(1e9+7)\r\np=1\r\nfor i in range(1,n+1):\r\n p*=2*n-i\r\n p*=pow(i,m-2,m)\r\n p%=m\r\nprint((2*p-n)%m)\r\n", "MOD=10**9+7\r\ndef power(x, a):\r\n if(a==0):\r\n return(1)\r\n z=power(x, a//2)\r\n z=(z*z)%MOD\r\n if(a%2):\r\n z=(z*x)%MOD\r\n return(z)\r\ndef fact(n):\r\n factn=1\r\n for i in range(2, n+1):\r\n factn=(factn*i)%MOD\r\n return(factn)\r\ndef ncr(n, r):\r\n return((fact(n)*power(fact(r), MOD-2)*power(fact(n-r), MOD-2))%MOD) \r\nn=int(input())\r\nprint((2*ncr(2*n-1,n)-n)%MOD)", "#love python :)\r\n#medo journy to icpc\r\nn=int(input())\r\nm=int(1e9 + 7)\r\np=1\r\nfor i in range(1, n + 1):\r\n p *= 2 * n - i\r\n p *= pow(i, m - 2, m)\r\n p %= m\r\nprint((2*p-n)%m)", "n,a,b,M,I=int(input()),1,1,1000000007,1000000005\r\nfor i in range(1,n):\r\n a=a*i%M\r\na=pow(a,I,M)\r\nfor i in range(n+1,n*2):\r\n b=b*i%M\r\nprint(((2*a*b)%M-n)%M)", "# author: cholebhature lover\r\nfrom collections import *\r\nfrom bisect import *\r\nfrom heapq import *\r\n# from math import *\r\nimport sys\r\n\r\n\r\ndef ncr(n, r, p):\r\n\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,\r\n p - 2, p)) % p\r\n\r\n\r\nmod = 10**9+7\r\nn = int(input())\r\nn -= 1\r\nprint(ncr(2*n+1, n+1, mod)*2 % mod-n-1)\r\n", "n = int(input())\r\np = 10**9 + 7\r\ndef mod_fact(n):\r\n\tret = 1\r\n\tfor i in range(1, n + 1):\r\n\t\tret *= i\r\n\t\tret %= p\r\n\treturn ret\r\n\r\nden = (n * mod_fact(n-1)**2) % p\r\nprint((2*(mod_fact(2*n - 1) * pow(den, -1, p)) - n) % p)\r\n", "n,a,b,M,I=int(input()),1,1,1000000007,1000000005\nfor i in range(1,n):\n a=a*i%M\na=pow(a,I,M)\nfor i in range(n+1,n*2):\n b=b*i%M\nprint(((2*a*b)%M-n)%M)\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\nmod = 1000000007\r\na = 1\r\nfor i in range(1, n):\r\n a = a * i % mod\r\na = pow(a, mod - 2, mod)\r\nb = 1\r\nfor i in range(n + 1, 2 * n):\r\n b = b * i % mod\r\nprint(((2 * a * b) % mod - n) % mod)# 1691763582.3251467", "#love python :)\r\n#medo journy to icpc\r\nn = int(input())\r\nm = int(1e9 + 7)\r\np = 1\r\nfor i in range(1, n + 1):\r\n p *= 2 * n - i\r\n p *= pow(i, m - 2, m)\r\n p %= m\r\nprint((2 * p - n) % m)", "p = 10**9+7\r\ndef power(x, y, p):\r\n b = bin(y)[2:]\r\n x = x % p\r\n start = x\r\n answer = 1\r\n for i in range(len(b)-1, -1, -1):\r\n if b[i]=='1':\r\n answer = (answer*start) % p\r\n start = (start*start) % p\r\n return answer\r\n\r\ndef process(n):\r\n num = 1\r\n den = 1\r\n for i in range(n):\r\n num = (num*(2*n-1-i)) % p\r\n den = (den*(n-i)) % p\r\n den2 = power(den, p-2, p)\r\n binom = (num*den2) % p\r\n return (2*binom-n) % p\r\n\r\nn = int(input())\r\nprint(process(n))", "prod = 1\r\nn = int(input())\r\nfor i in range(n+1, 2*n+1):\r\n prod *= i\r\n prod %= (10**9+7)\r\n\r\nfor i in range(1,n+1):\r\n prod *= pow(i, 10**9+5, 10**9+7)\r\n prod %= 10**9+7\r\n\r\nprint((prod-n)%(10**9+7))\r\n", "def fact(n):\r\n k = 1\r\n for i in range(n):\r\n k *= i+1\r\n return k\r\n\r\ndef egcd(a, b):\r\n if a == 0:\r\n return (b, 0, 1)\r\n else:\r\n g, y, x = egcd(b % a, a)\r\n return (g, x - (b // a) * y, y)\r\n\r\ndef modinv(a, m):\r\n g, x, y = egcd(a, m)\r\n if g != 1:\r\n raise Exception('modular inverse does not exist')\r\n else:\r\n return x % m\r\n \r\nn = int(input())\r\nk = 1\r\nfor i in range(n-1):\r\n k *= i+(n+1)\r\n k = k % 1000000007\r\nl = 1\r\nfor i in range(n-1):\r\n l *= i+1\r\n l = l % 1000000007\r\nprint((2*k*modinv(l, 1000000007)-n) % 1000000007)", "def fact(n):\r\n res=1\r\n for i in range(2,n+1):\r\n res=(res*i)%(10**9+7)\r\n return res\r\n \r\ndef rev(a):\r\n return pow(a,10**9+5,10**9+7)\r\n\r\ndef c2nn(n):\r\n return fact(2*n)*(rev(fact(n))**2)%(10**9+7)\r\n\r\nn=int(input())\r\nprint(c2nn(n)-n)", "n = int(input())\ndef factorial(n):\n out = 1\n for i in range(1,n+1):\n out *= i\n out %= (10**9+7)\n return out\n\ndef comb(n,r):\n return factorial(n)*pow(factorial(n-r)*factorial(r),-1,10**9+7)\n\nprint((2*comb(2*n-1,n)-n)%(10**9+7))\n" ]

[ "n,kitten,t= map(int, input().split())\r\na=[str(input()) for i in range(n)]\r\nq=0\r\nfor i in range(kitten):\r\n l=0\r\n for j in range(n):\r\n if (a[j][i]==\"Y\"):\r\n l+=1\r\n if (l >= t):\r\n q+=1\r\nprint(q)", "f,I,t=map(int,input().split())\r\nd=[0]*I\r\nfor i in range(f):\r\n s=input()\r\n for j in range(I):\r\n d[j]+=s[j]=='Y'\r\nprint(sum(i>=t for i in d))\r\n#kitten", "F, I, T = map(int, input().split())\r\na = [0]*10\r\np = range(I)\r\nfor kitten in range(F):\r\n s = input()\r\n for j in p:\r\n if s[j] == 'Y':\r\n a[j] += 1\r\nr = 0\r\nfor i in p:\r\n if a[i] >= T:\r\n r += 1\r\nprint(r)", "from sys import stdin\r\nc=[0]*22\r\nf,i,t = map(int,stdin.readline().split())\r\nkitten = 0\r\nfor v in range(f):\r\n s = stdin.readline()\r\n for j in range(i):\r\n if s[j]=='Y': c[j]+=1\r\nfor v in range(i):\r\n if c[v]>=t: kitten+=1\r\nprint(kitten)", "a,b,c=map(int,input().split())\r\nkitten=[0]*b\r\nfor i in range(a):\r\n\ts=input()\r\n\tfor j in range(len(s)):\r\n\t\tif s[j] == 'Y':\r\n\t\t\tkitten[j]+=1\r\nprint(sum(map(lambda x:x>=c, kitten)))", "f,i,t = (int(i) for i in input().split())\r\na = [0]*i\r\nfor l in range(f):\r\n s = input()\r\n for m in range(i):\r\n if s[m] =='Y':\r\n a[m]+=1\r\nkitten = 0\r\nfor j in range(i):\r\n if a[j] >= t:\r\n kitten+=1\r\n \r\nprint(kitten)\r\n", "# LUOGU_RID: 111177903\nf,n,kitten = map(int, input().split(\" \"))\r\nx = [input() for i in range(f)]\r\nprint(sum([sum([ (x[j][i]=='Y') for j in range(f) ] ) >= kitten for i in range(n)]))", "#kitten\r\nf,y,t=map(int,input().split())\r\ncnt=[0]*y\r\nfor i in range(0,f):\r\n s=input()\r\n for j in range(0,y):cnt[j]+=s[j]=='Y'\r\nprint(len([x for x in cnt if x >= t]))", "f,i,t=map(int,input().split())\r\nw=0\r\ng=[]\r\nkitten=0\r\nfor j in range(f):\r\n s=input()\r\n for k in range(i):\r\n g.append(0)\r\n a=(s[k]=='Y')\r\n g[k]=g[k]+a\r\n w=w+(g[k]==t)*a\r\nprint(w)", "#kitten\nF,I,T=map(int,input().split())\nc=[0]*I\na=0\nfor i in range(F):\n\ts=input()\n\tfor j in range(I):\n\t\tif s[j]=='Y':c[j]+=1\n\t\tif i==F-1 and c[j]>=T:a+=1\nprint(a)\n\n", "F,I,T=map(int,input().split())\r\na=[0]*F\r\nfor i in range(F):\r\n a[i]=input()\r\nb=0\r\nfor i in range(I):\r\n sum=0\r\n for j in range(F):\r\n sum+=(a[j][i]=='Y')\r\n b+=(sum>=T)\r\nprint(b)\r\n#kitten\r\n", "#kitten\ndef main():\n f,i,t=map(int, input().split())\n p=[0]*i\n for _ in range(f):\n likes=input()\n for j in range(i):\n if likes[j]=='Y':\n p[j]+=1\n print(sum(1 for j in p if j>=t))\nmain()\n", "f,n,t=map(int,input().split())\r\nl=0;v=[0]*n\r\nfor i in range(f):\r\n\tc=input()\r\n\tfor j in range(n):\r\n\t\tif v[j]<t:\r\n\t\t\tif c[j]=='Y':\r\n\t\t\t\tv[j]+=1;\r\n\t\t\t\tif v[j]==t:\r\n\t\t\t\t\tl+=1\r\nprint(l)\r\n#kitten", "F, I, T = map(int, input().split())\n\nkitten = []\nfor i in range(F):\n\tkitten.append(list(input()))\n\nnumb = 0\nfor j in range(I):\n\tk = 0\n\tfor i in range(F):\n\t\tif kitten[i][j] == 'Y':\n\t\t\tk += 1\n\tif k >= T:\n\t\tnumb += 1\n\nprint(numb)", "n,m,k=map(int,input().split())\r\nc=[0]*m\r\nfor i in range(n):\r\n\ta=input()\r\n\tfor j in range(m):\r\n\t\tc[j]+=a[j]=='Y'\r\nprint(sum(c[i]>=k for i in range(m)))#kitten", "f,l,t=map(int,input().split())\nkitten=[0]*l\nfor i in range(f):\n\tfor j,c in enumerate(input()):\n\t\tif c==\"Y\":kitten[j]+=1\nprint(sum(c>=t for c in kitten))" ]

[ "import sys\nimport math\n\nreadline = sys.stdin.readline\n\nN, K = 0, 0\nquery = []\ntable = [0]\n\n\ndef read_input():\n global N, K\n N = int(readline().strip())\n for _ in range(N):\n query.append([int(w) for w in readline().split()])\n K = int(readline().strip())\n for i in range(21):\n table.append(table[-1] * 10 + 1)\n\ndef cnt_one(num: int) -> int:\n if num < 10:\n return int(num >= 1)\n s = str(num)\n result = 0\n if s[0] == '1':\n result = int(s[1:]) + 1 + table[len(s) - 1]\n else:\n result = table[len(s)]\n return result\n\ndef solve()->float:\n if K == 0:\n return 1.0\n t = math.ceil(K / 100 * N)\n dp = [0] * (t + 1)\n dp[0] = 1\n total = 1\n for l, r in query:\n a = r - l + 1\n b = cnt_one(r) - cnt_one(l - 1)\n total *= a\n ndp = [0] * (t + 1)\n for i in range(t):\n ndp[i] += dp[i] * (a - b)\n ndp[i + 1] += dp[i] * b\n dp = ndp\n return 1 - sum(dp[:-1]) / total\n\n\ndef write_output(result: float):\n print(result)\n\n\nread_input()\nwrite_output(solve())", "# LUOGU_RID: 116591731\nn = int(input())\r\na = [1] + [0 for _ in range(n)]\r\nfor _ in range(n):\r\n l, r = map(int, input().split())\r\n c, p = 1, 0\r\n while c <= 1e18:\r\n p += max(-1, min(r, (c << 1) - 1) - max(l, c)) + 1\r\n c *= 10\r\n g = p / (r - l + 1)\r\n olda = a\r\n a = [olda[0] * (1 - g)] + [0 for __ in range(n)]\r\n for i in range(n):\r\n a[i + 1] = olda[i + 1] * (1 - g) + olda[i] * g\r\nk = int(input())\r\nprint(sum(a[(n * k + 99) // 100 : ]))\r\n", "#Problem E\nimport sys\ninput = lambda: sys.stdin.readline()[:-1]\nget_int = lambda: int(input())\nget_int_iter = lambda: map(int,input().split())\nget_int_list = lambda: list(map(int,input().split()))\n\nN = get_int()\np = [0]*(N+1)\np[0] = 1\nfor i in range(N):\n L,R = get_int_iter()\n L_D,R_D = len(str(L)),len(str(R))\n curr_p = 0\n if L_D == R_D:\n if R >= 2*10**(L_D-1):\n curr_p = max(2*10**(L_D-1)-L,0)/(R-L+1)\n else:\n curr_p = 1\n else:\n curr_p = max(2*10**(L_D-1)-L,0)\n for j in range(L_D+1,R_D):\n curr_p += 10**(j-1)\n if R >= 2*10**(R_D-1):\n curr_p += 10**(R_D-1)\n else:\n curr_p += R-10**(R_D-1) + 1\n curr_p /= R-L+1\n #print(curr_p)\n p_next = [0]*(N+1)\n for k in range(N):\n p_next[k] += p[k] * (1-curr_p)\n p_next[k+1] += p[k] * curr_p\n p = p_next\n #print(p)\nK = get_int()\nwin_p = 0\nfor i in range(N+1):\n if i*100 >= N*K:\n win_p += p[i]\nprint(win_p)\n\n \t\t \t \t\t \t \t\t \t \t \t\t \t", "def f(n):\r\n s=str(n)\r\n l=len(s)\r\n tot=0\r\n tot+=(10**(l-1)-1)//9\r\n tot+=min(n-10**(l-1)+1,10**(l-1))\r\n return tot\r\n\r\nn=int(input())\r\ndp=[[0 for i in range(n+1)]for j in range(n+1)]\r\ndp[0][0]=1\r\nfor i in range(1,n+1):\r\n l,r=map(int,input().split())\r\n tot=f(r)-f(l-1)\r\n tot1=r-l+1\r\n j=i\r\n while(j>=0):\r\n if j>=1:\r\n dp[i][j]+=(tot/tot1)*dp[i-1][j-1]\r\n dp[i][j]+=(1-(tot/tot1))*dp[i-1][j]\r\n j+=-1\r\n\r\nk=float(input())\r\nk=k/100\r\nans=0\r\nfor j in range(n+1):\r\n if (j/n)>=k:\r\n ans+=dp[n][j]\r\n\r\nprint(ans)\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\nalph = 'abcdefghijklmnopqrstuvwxyz'\n#pow(x,mod-2,mod)\n\nN = int(input())\nA = [list(map(int, input().split())) for _ in range(N+1)]\nl = [0]*N\nfor i in range(N):\n p = [0]*(N+1)\n for j in range(N):p[A[i][j]] = j\n\n a,b,c = 0,float(\"inf\"),float(\"inf\")\n for x in A[N]:\n if x!=i+1 and x<c:\n if p[x]<b: a,b = x,p[x]\n c = x\n l[i] = a\nprint(*l)\n", "def f():\n w = [0] * n\n for i, j in enumerate(input().split()): w[int(j) - 1] = i\n return w\nn = int(input()) # read the inputs\np = [f() for i in range(n)]\ns = f()\nfor x, w in enumerate(p):\n i = j = x < 1\n for y in range(n):\n if x != y and s[y] < s[i]: i = y\n if w[i] < w[j]: j = i\n print(j + 1)\n \t\t \t\t\t \t\t\t\t \t \t \t \t", "n = int(input())\n\nfrnd = [list(map(int, input().split() )) for _ in range(n)]\nara = list(map(int, input().split() ))\n\npref = [0]*(n+1)\nans = [0] * n\n\nfor i in range(n):\n\tpref[ara[i]] = i\n\n\ndef ok(val, row):\n\tfor x in ara:\n\t\tif x-1 == row:\n\t\t\tcontinue\n\t\tif x < val:\n\t\t\treturn 0\n\t\tif x == val:\n\t\t\treturn 1\n\n\nfor ro in range(n):\n\tfor x in frnd[ro]:\n\t\tif x - 1 == ro:\n\t\t\tcontinue\n\t\tif ok(x, ro):\n\t\t\tans[ro] = x\n\t\t\tbreak\n\nfor i in range(n):\n\tprint(ans[i], end=' ')\nprint()\n\n\n \t\t\t\t\t\t \t \t\t \t\t\t \t\t\t\t\t \t\t\t\t", "n = int(input())\r\n\r\nfriends = []\r\nfriends_inverse = []\r\nfor _ in range(n):\r\n friend = list(map(int, input().split()))\r\n friends.append(friend)\r\n friends_inverse.append([friend.index(i + 1) for i in range(n)])\r\n\r\nalex = list(map(int, input().split()))\r\nalex_inverse = [alex.index(i + 1) for i in range(n)]\r\n\r\noutput = {k: -1 for k in range(1, n + 1)}\r\nfor i, friend in enumerate(friends):\r\n for card in friend:\r\n #print(alex, alex_inverse, alex_inverse[card - 1], card, i + 1)\r\n if card != i + 1:\r\n candidates = alex[:alex_inverse[card - 1]]\r\n try:\r\n candidates.remove(i + 1)\r\n except:\r\n pass\r\n if len(candidates) == 0 or min(candidates) > card:\r\n #print(\"found for friend %d card %d\" % (i + 1, card))\r\n output[i + 1] = card\r\n break\r\n\r\nprint(\" \".join(map(str, output.values())))", "n = int(input())\r\narr = [list(map(int, input().split())) for _ in range(n+1)]\r\nres = [0] * n\r\nfor i in range(n):\r\n p = [0] * (n+1)\r\n for j in range(n): \r\n p[arr[i][j]] = j\r\n u, t, b = 0, int(1e5), int(1e5)\r\n for x in arr[n]:\r\n if x != i+1 and x < b:\r\n if p[x] < t: \r\n u, t = x, p[x]\r\n b = x\r\n res[i] = u\r\nprint(*res)\r\n", "def f():\n t = [0] * n\n for i, j in enumerate(input().split()): t[int(j) - 1] = i\n return t\nn = int(input())\np = [f() for i in range(n)]\ns = f()\nfor x, t in enumerate(p):\n i = j = x < 1\n for y in range(n):\n if x != y and s[y] < s[i]: i = y\n if t[i] < t[j]: j = i\n print(j + 1)\n\t \t \t \t\t\t\t\t\t\t \t\t" ]

[ "# Contest: 20 - 2100 <= Codeforces Rating <= 2199 (https://a2oj.com/ladder?ID=20)\n# Problem: (16) Andrey and Problem (Difficulty: 4) (http://codeforces.com/problemset/problem/442/B)\n\ndef rint():\n return int(input())\n\n\ndef rints():\n return list(map(int, input().split()))\n\n\nn = rint()\np = sorted((float(s) for s in input().split()), reverse=True)\npr = 0\ninv = 1\nfor pi in p:\n npr = pr * (1 - pi) + inv * pi\n if npr < pr:\n break\n pr = npr\n inv *= (1 - pi)\nprint(pr)\n", "n = input()\n\nans = tmp = 0.0\n\npd = 1.0\n\nfor i in reversed(sorted(map(float, input().split()))):\n\n tmp = tmp * (1.0 - i) + pd * i\n\n pd *= 1.0 - i\n\n ans = max(ans, tmp)\n\nprint('%0.12f' % ans)\n\n\n\n# Made By Mostafa_Khaled", "t = int(input())\nl = list(map(float, input().split()))\nl.sort(reverse=True)\n\nx = l[0]\nop = 1 - l[0]\n\nfor i in range(1, t):\n\taux = (1 - l[i])\n\tif (x * aux) + (l[i] * op) > x:\n\t\tx = (x * aux) + (l[i] * op)\n\t\top *= aux\n\telse:\n\t\tbreak\n\t\t\n\nprint(f\"{x:.12f}\")\n\t\t \t \t \t \t \t \t \t \t\t \t \t\t \t", "n = int(input())\r\npmax, pmid, pmin = 1, 0, 0\r\nfor p in sorted(map(float, input().split()))[::-1]:\r\n pmid = pmax*p + pmid*(1-p)\r\n pmax *= 1-p\r\n pmin = max(pmin, pmid)\r\nprint(pmin)", "import sys\r\ninput=sys.stdin.readline\r\nn=int(input())\r\np=list(map(float,input().split()))\r\np.sort(reverse=True)\r\nmax_p=0\r\nfor i in range(n):\r\n score=0\r\n for j in range(i+1):\r\n c=1\r\n for k in range(i+1):\r\n if j==k:\r\n c*=p[k]\r\n else:\r\n c*=1-p[k]\r\n score+=c\r\n if score>=max_p:\r\n max_p=score\r\n else:\r\n break\r\nprint(max_p)", "\r\nn=int(input())\r\n\r\nL=list(map(float,input().split()))\r\n\r\nL.sort(reverse=True)\r\nans1=0.0\r\nF=[]\r\nQ=[]\r\ni=0\r\nwhile(i<n):\r\n ans2=0\r\n x=L[i]\r\n for j in range(len(F)):\r\n ans2+=F[j]*(1-L[i])\r\n x*=1-L[Q[j]]\r\n ans2+=x\r\n if(ans2>ans1):\r\n F.append(L[i])\r\n Q.append(i)\r\n x=1\r\n for j in range(len(F)-1):\r\n F[j]*=1-L[i]\r\n x*=1-L[Q[j]]\r\n F[-1]*=x\r\n ans1=max(ans2,ans1)\r\n i+=1\r\n\r\nprint(ans1)\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\ndef cal(l):\n ans = 0\n for i in range(len(l)):\n num = l[i]\n for j in range(len(l)):\n if i!=j:num*=1-l[j]\n ans+=num\n return ans\n\nN = int(input())\nP = sorted(map(float,input().split()))[::-1]\nans = 0\nl = []\nfor i in P:\n l.append(i)\n ans = max(ans,cal(l))\n # print(l,cal(l))\nprint(ans)", "from sys import stdin,stdout\r\nfrom collections import defaultdict,Counter\r\nfrom bisect import bisect,bisect_left\r\nimport math\r\nfrom itertools import permutations \r\n\r\n#stdin = open('input.txt','r')\r\nI = stdin.readline\r\n\r\n\r\n\r\n\r\n\r\n\r\nn = int(I())\r\narr = [float(x) for x in I().split()]\r\n\r\narr.sort(reverse = True)\r\nma = arr[0]\r\n#print(ma)\r\nfor i in range(1,n):\r\n now = ma*(1-arr[i])\r\n #print(now)\r\n sec = 1\r\n for j in range(i):\r\n sec*=(1-arr[j])\r\n # print(sec*arr[i],sec,arr[i])\r\n now+=(arr[i]*sec)\r\n #print(ma,now)\r\n if(now>ma):\r\n ma = now\r\n else:\r\n break\r\n\r\nprint(ma)\r\n\r\n", "def C():\n n = int(input())\n tmp = input()\n tmp = tmp.split()\n probability = list(map(float,tmp))\n\n probability.sort()\n \n current = probability[n-1]\n pre = 1 - probability[n-1]\n\n for i in range(n-2,-1,-1):\n tmp = current * (1-probability[i]) + pre * (probability[i])\n if (tmp > current):\n current = tmp\n pre = pre * (1-probability[i])\n\n print(\"%.12f\" % current)\n\nif __name__ == \"__main__\":\n C()\n", "k, p = int(input()), list(map(float, input().split()))\r\np.sort(reverse = True)\r\nif p[0] == 1: print(1)\r\nelse:\r\n a = 1\r\n b = v = 0\r\n for i in p:\r\n a *= 1 - i\r\n b += i / (1 - i)\r\n u = a * b\r\n if v > u: break\r\n v = u\r\n print(v)", "import sys\r\nn = int(input()) \r\nindex = [i for i in range(n)]\r\ntmp = list(map(float, sys.stdin.readline().split()))\r\nans = []\r\nmaxP = 0\r\nwhile len(index):\r\n j = 0\r\n ma = 0\r\n for k in index:\r\n if tmp[k] >= ma:\r\n ma = tmp[k]\r\n j = k\r\n index.remove(j)\r\n ans.append(tmp[j])\r\n tp = 0\r\n for i in range(len(ans)):\r\n q = ans[i]\r\n for k in range(len(ans)):\r\n if i != k:\r\n q *= 1 - ans[k]\r\n tp += q\r\n if tp > maxP:\r\n maxP = tp\r\n else:\r\n ans.remove(tmp[j])\r\n\r\nprint (\"{0:.9f}\".format(maxP))\r\n\r\n", "x = int(input())\r\ny = list(map(float, input().split(' ')))\r\ny.sort()\r\ny.reverse()\r\nl = [y[0]]\r\np = y[0]\r\nprod = 1 - y[0]\r\n\r\nfor i in range(1, x):\r\n \r\n newx = p* (1-y[i]) + prod * y[i]\r\n if newx > p:\r\n prod *= (1 - y[i])\r\n p = newx\r\n l.append(y[i])\r\n \r\nprint(p)", "# ========== //\\\\ //|| ||====//||\r\n# || // \\\\ || || // ||\r\n# || //====\\\\ || || // ||\r\n# || // \\\\ || || // ||\r\n# ========== // \\\\ ======== ||//====|| \r\n# code\r\n\r\ndef main():\r\n n = int(input())\r\n a = list(map(float, input().split()))\r\n a.sort(reverse = True)\r\n ans = 0\r\n for i, v in enumerate(a):\r\n tempans = 0\r\n for j, v1 in enumerate(a[:i + 1]):\r\n p = 1\r\n for k, v3 in enumerate(a[:i + 1]):\r\n if j == k:\r\n p *= v3\r\n else:\r\n p *= (1 - v3)\r\n tempans += p\r\n ans = max(ans, tempans)\r\n print(ans)\r\n return\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\r\na = sorted(map(float, input().split()), reverse=True)\r\n\r\nret = -float('inf')\r\nfor i in range(n):\r\n prob = 0\r\n for j in range(i + 1):\r\n p = a[j]\r\n for k in range(i + 1):\r\n if k != j:\r\n p *= (1 - a[k])\r\n prob += p\r\n ret = max(ret, prob)\r\nprint(ret)", "n = int(input())\np = list(map(float, input().split()))\np.sort()\ndp = [[0.0 for _ in range(n)] for _ in range(n)]\nfor i in range(n):\n dp[i][i] = 1.0 - p[i]\n for j in range(i + 1, n):\n dp[i][j] = dp[i][j - 1] * (1.0 - p[j])\n\nans = p[-1]\nfor i in range(n):\n for j in range(i + 1, n):\n prob = 0\n for k in range(i, j + 1):\n if k == i:\n prob += p[i] * dp[i + 1][j]\n elif k == j:\n prob += p[j] * dp[i][j - 1]\n else:\n prob += dp[i][k - 1] * p[k] * dp[k + 1][j]\n\n ans = max(ans, prob)\n\nprint(ans)\n\n", "input() \r\np, s, ans = 1.0, 0.0, 0.0\r\nfor x in sorted(map(float, input().split()), reverse=True): \r\n\t\tif x == 1:\r\n\t\t\tans = 1\r\n\t\t\tbreak\r\n\t\tp = p * (1 - x)\r\n\t\ts = s + x / (1 - x)\r\n\t\tans = max(ans, p * s)\r\nprint(ans)", "import bisect\r\nn=int(input())\r\nls=list(map(float,input().split()))\r\nls.sort()\r\nmx=ls[-1]\r\nidx=bisect.bisect_left(ls,0.5)\r\nif idx<n and ls[idx]<0.5:\r\n idx+=1\r\n\r\nres=0\r\nst=0\r\nwhile(st<idx-1):\r\n temp=0\r\n for i in range(st,idx):\r\n t=1\r\n for j in range(st,idx):\r\n if i!=j:\r\n t=t*(1-ls[j])\r\n \r\n temp+=t*ls[i]\r\n res=max(res,temp)\r\n st+=1\r\nres=max(res,mx)\r\nprint(\"%.12f\"%res)", "n = int(input())\r\npr = list(map(float, input().split()))\r\npr.sort(reverse=True)\r\npr.insert(0, 0)\r\n\r\nmx = 0\r\nfor k in range(1, len(pr)):\r\n cur = 0\r\n for j in range(1, k+1):\r\n jth = 1\r\n for i in range (1, j):\r\n jth *= (1 - pr[i])\r\n jth *= pr[j]\r\n for i in range (j+1, k+1):\r\n jth *= (1 - pr[i])\r\n cur += jth\r\n mx = max(mx, cur)\r\n #print(cur)\r\n\r\nprint(mx)\r\n", "n=int(input())\r\nl=list(map(float,input().split()))\r\nl=sorted(l)\r\nl=l[::-1]\r\nans=0\r\nd=1\r\nvze=0\r\nfor x in l :\r\n vze=vze+x*(d-vze)\r\n d*=(1-x)\r\n ans=max(ans,vze)\r\nprint(ans)\r\n", "n = int(input())\r\na = list(map(float, input().split()))\r\na.sort()\r\ns = a[-1]\r\np = 1 - a[-1]\r\nfor i in range(n - 2, -1, -1):\r\n\tif s < s * (1 - a[i]) + a[i] * p:\r\n\t\ts = s * (1 - a[i]) + a[i] * p\r\n\t\tp *= (1 - a[i])\r\nprint('%.9lf' % s)\r\n", "#442B\r\nn = int(input())\r\np = list(map(float,input().split()))\r\np.sort(reverse=True)\r\nprev_prob = 0\r\ncur_prob = 0\r\nT = 1\r\nfor i in range(n):\r\n cur_prob = cur_prob*(1-p[i]) + T*p[i]\r\n if cur_prob >= prev_prob:\r\n prev_prob = cur_prob\r\n T *= (1-p[i])\r\n else:\r\n break\r\nprint(prev_prob)", "n = int(input())\r\na = list(map(float,input().split()))\r\na.sort(reverse=True)\r\n# print(a)\r\nans = a[0]\r\n# temp=a\r\nans1 = -1\r\nfor i in range(n):\r\n ans=0\r\n for j in range(i+1):\r\n x = 1\r\n for k in range(i+1):\r\n if (j==k):\r\n x = x*a[k]\r\n else:\r\n x = x*(1-a[k])\r\n ans+=x \r\n ans1 = max(ans1,ans)\r\nprint(ans1)\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\np = list(map(float,input().split()))\r\np.sort(reverse=True)\r\ncnt,flag = 0,0\r\narr = []\r\nfor i in p:\r\n if i==1:\r\n flag = 1\r\n break\r\n elif i:\r\n arr.append(i)\r\n cnt += 1\r\n else:\r\n break\r\nif flag:\r\n print(1)\r\nelif cnt:\r\n maxi = arr[0]\r\n n = cnt\r\n for i in range(2,n+1):\r\n query = p[:i]\r\n s = 0\r\n m = 1\r\n for j in query:\r\n m *= (1-j)\r\n for j in query:\r\n x = m*j/(1-j)\r\n s += x\r\n if s<=1:\r\n if maxi<s:\r\n maxi = s\r\n else:\r\n break\r\n print(maxi)\r\nelse:\r\n print(0)", "import sys\n\ninput()\nps = sorted((float(p) for p in input().split()), reverse=True)\nif 1.0 in ps:\n print(1)\n sys.exit()\na, b = 0, 1\nfor p in ps:\n c, d = a + p / (1 - p), b * (1 - p)\n if c * d > a * b:\n a, b = c, d\n else:\n break\nprint('{:.9}'.format(a * b))\n", "from decimal import Decimal as fr\n\n\nans = 0\n\nn = int(input())\na = list(map(fr, input().split()))\n\nans = max(a)\n\n\ndef calc(lst):\n global ans\n\n prod = 1\n for i in range(len(lst)):\n prod *= 1 - lst[i]\n cur = 0\n for j in range(i + 1):\n cur += lst[j] * prod / (1 - lst[j])\n\n# print(cur)\n ans = max(ans, cur)\n\n\nlst = list(sorted(filter(lambda x: x < 0.5, a)))\n\ncalc(lst)\ncalc(lst[::-1])\n\n\nprint('{:.15f}'.format(ans))\n", "input()\r\na,b,c = 1,0,0\r\nfor p in sorted(map(float, input().split()))[::-1]:\r\n b = a*p + b*(1-p)\r\n a *= 1-p\r\n c = max(c, b)\r\nprint(c)\r\n", "n = int(input())\r\nl = list(map(float, input().split()))\r\nl.sort(reverse = True)\r\n\r\nbest = 0\r\n\r\ncurr0 = 1\r\ncurr1 = 0\r\nfor v in l:\r\n curr1 *= (1 - v)\r\n curr1 += v * curr0\r\n curr0 *= (1 - v)\r\n best = max(curr1, best)\r\nprint(best)", "\nn = int(input())\np = list(map(float,input().split()))\n\nprobs = sorted(p)[::-1]\nd = 1\na,s = 0,0\n\nfor i in probs:\n a = a*(1-i) + d*i\n d *= (1-i)\n if (a > s):\n s = a\n\nprint(s)\n \t \t \t\t\t\t\t\t \t \t\t\t\t \t\t \t \t" ]

[ "n=int(input())\nd={}\nl=[]\nfor test in range(n):\n\ta,b=input().split()\n\tl.append((a,b))\n\td[a]=int(b)+d.get(a,0)\nm=0\nfor item in d.items():\n\tm=max(m,item[1])\nd={}\nx=[]\nfor a,b in l:\n\tc=int(b)+d.get(a,0)\n\td[a]=c\n\tif(c>=m):\n\t\tx.append(a)\nr=\"\"\nfor c in x:\n\tif d[c]==m:\n\t\tr=c\n\t\tbreak\nprint(r)\n\t \t\t\t\t\t\t \t \t \t\t\t\t\t\t\t \t\t \t\t", "s = input()\r\ncount = int(s)\r\ngame = []\r\n\r\nppl1 = {}\r\nppl2 = {}\r\nw = \"\"\r\n\r\nfor i in range(count):\r\n s = input()\r\n game.append(s)\r\n l = game[i].split(\" \")\r\n if l[0] in ppl1 :\r\n ppl1[l[0]] += int(l[1])\r\n else:\r\n ppl1[l[0]] = int(l[1])\r\n\r\nm = -1001\r\nfor k in ppl1:\r\n if ppl1[k] > m:\r\n m = ppl1[k]\r\n\r\nfor i in range(count):\r\n l = game[i].split(\" \")\r\n if l[0] in ppl2 :\r\n ppl2[l[0]] += int(l[1])\r\n else:\r\n ppl2[l[0]] = int(l[1])\r\n if ppl2[l[0]] >= m and ppl1[l[0]] == m:\r\n print(l[0])\r\n break\r\n", "t=int(input())\nd,l={},[]\nfor _ in range(t):\n s,n=map(str,input().split())\n if s in d:\n d[s]+=int(n)\n else:\n d[s]=int(n)\n l.append((s,d[s]))\nma=max(d.values())\nt=0\nq=[]\nfor i,j in l:\n q.append(i)\n#print(q)\nfor i,j in l:\n if d[i]==ma and j>=ma :\n print(i)\n break\n\t \t \t\t \t \t \t \t\t\t \t", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Dec 19 22:45:37 2018\r\n\r\n@author: Lenovo\r\n\"\"\"\r\n\r\nx = []\r\ny = {}\r\nn = int(input())\r\n\r\nfor i in range(n):\r\n a, b = input().split()\r\n b = int(b)\r\n y[a] = y.get(a, 0) + b\r\n x.append([y[a], a])\r\n\r\nm = max(y.values())\r\n\r\nfor n, a in x:\r\n if n >= m and y[a] >= m:\r\n print(a)\r\n break", "from collections import OrderedDict\r\n\r\nn = int(input())\r\nnames_score_dict = OrderedDict()\r\nlis = []\r\nfor _ in range(n):\r\n name, score = input().split()\r\n names_score_dict[name] = names_score_dict.get(name, 0) + int(score)\r\n lis += [(names_score_dict[name], name)]\r\n\r\nm = max(names_score_dict.values())\r\nfor v, k in lis:\r\n if names_score_dict[k] == m and v >=m:\r\n print (k)\r\n break\r\n", "n = int(input())\r\nnames = []\r\nscores = []\r\nfor _ in range(n):\r\n tt = input().split()\r\n names.append(tt[0])\r\n scores.append(int(tt[1]))\r\n\r\nd = {}\r\nfor i in range(n):\r\n if names[i] in d:\r\n d[names[i]] += scores[i]\r\n else:\r\n d[names[i]] = scores[i]\r\n\r\nmx = -1001\r\nfor i in range(n):\r\n if (d[names[i]] > mx):\r\n mx = d[names[i]]\r\n\r\nnewd = {}\r\nfor i in range(n):\r\n if names[i] in newd:\r\n newd[names[i]] += scores[i]\r\n else:\r\n newd[names[i]] = scores[i]\r\n\r\n if (newd[names[i]] >= mx): \r\n if (d[names[i]] == mx):\r\n print(names[i])\r\n break", "used={}\r\nb=[]\r\nmx=-1000000000000000000000000000000000000000000000\r\nfor i in range(int(input())):\r\n s,n=input().split()\r\n n=int(n)\r\n if s in used:\r\n used[s]+=n\r\n else:\r\n used[s]=n\r\n b.append([s,used[s]])\r\nfor i in used:\r\n if used[i]>mx:\r\n mx=used[i]\r\nfor i,j in b:\r\n if used[i]==mx and j>=mx:\r\n print(i)\r\n break\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n'''used=[]\r\nfor i in range(int(input())):\r\n s,n=input().split()\r\n if i==0:\r\n used.append((s,n))\r\n for i in used:\r\n if s in i:\r\n i[1]+=n\r\n print(i)\r\n'''\r\n \r\n", "database = []\r\nn = int(input())\r\nfor i in range(n):\r\n\tdata = input().split()\r\n\tdata[1] = int(data[1])\r\n\tdatabase.append(data)\r\n\r\nplayers = {}\r\nfor i in range(n):\r\n\tname = database[i][0]\r\n\tscore = database[i][1]\r\n\tif not name in players:\r\n\t\tplayers[name] = 0\r\n\tplayers[name] += score\r\n\r\nbest_score = max(players.values())\r\nwinners = list({player: points for player, points in players.items() if points == best_score})\r\nchecker = {w:0 for w in winners}\r\na_winner = winners[0]\r\nif len(winners) > 1:\r\n\tfor i in range(n):\r\n\t\tname = database[i][0]\r\n\t\tscore = database[i][1]\r\n\t\ttry:\r\n\t\t\tchecker[name] += score\r\n\t\t\tif checker[name] >= best_score:\r\n\t\t\t\ta_winner = name\r\n\t\t\t\tbreak\r\n\t\texcept:\r\n\t\t\tpass\r\nprint(a_winner)\r\n", "n = int(input())\r\nname = []\r\nval = []\r\nendv = dict()\r\ntmp = dict()\r\nfor i in range(n):\r\n x, y = input().split()\r\n name.append(x)\r\n val.append(int(y))\r\n if name[i] not in endv.keys():\r\n endv[name[i]] = val[i]\r\n tmp[name[i]] = 0\r\n else:\r\n endv[name[i]] += val[i]\r\nmx = 0\r\nfor i in range(n):\r\n mx = max(mx, endv[name[i]])\r\nfor i in range(n):\r\n tmp[name[i]] += val[i]\r\n if tmp[name[i]] >= mx and endv[name[i]] == mx:\r\n print(name[i])\r\n exit(0)", "import copy\r\nn=int(input())\r\nZ={}\r\nS=[]\r\nfor i in range(n):\r\n x,y=map(str,input().split())\r\n S.append((x,eval(y)))\r\n if x in Z:\r\n Z[x]=Z[x]+eval(y)\r\n else:\r\n Z[x]=eval(y)\r\nmaxm=0\r\nfor k in Z:\r\n if maxm<Z[k]:\r\n maxm=Z[k]\r\nG={}\r\nfor i in Z:\r\n if Z[i]==maxm:\r\n G[i]=0\r\nfor k in G:\r\n G[k]=0\r\nfor c in S:\r\n if c[0] in G:\r\n G[c[0]]+=c[1]\r\n if G[c[0]]>=maxm:\r\n print(c[0])\r\n break\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "\r\nn = int(input(''))\r\np = []\r\nq = {}\r\nfor i in range(n):\r\n name,score = input().split()\r\n q[name] = q.get(name,0)+int(score)\r\n p.append([name,q[name]])\r\n\r\n\r\nmax_value = max(q.values())\r\nfor i,j in p:\r\n\r\n if q[i]==max_value and j>=max_value:\r\n print(i)\r\n break\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "def main():\r\n n = int(input())\r\n\r\n winner = [\"\" for _ in range(n + 1)]\r\n points = [0 for _ in range(n + 1)]\r\n\r\n for k in range(1, n + 1):\r\n name, addPoints = input().split()\r\n winner[k] = name\r\n points[k] = int(addPoints)\r\n\r\n players = set()\r\n for k in range(1, n + 1):\r\n if winner[k] not in players:\r\n players.add(winner[k])\r\n\r\n state = {}\r\n zeroVec = [0 for _ in range(n + 1)]\r\n for name in players:\r\n state[name] = zeroVec.copy()\r\n\r\n for k in range(1, n + 1):\r\n for name in players:\r\n state[name][k] = state[name][k - 1]\r\n state[winner[k]][k] += points[k]\r\n\r\n maxScore = 0\r\n for name in players:\r\n if state[name][n] > maxScore:\r\n maxScore = state[name][n]\r\n\r\n finalWinner = \"\"\r\n for k in range(1, n + 1):\r\n if finalWinner:\r\n break\r\n for name in players:\r\n if state[name][k] >= maxScore and state[name][n] == maxScore:\r\n finalWinner = name\r\n break\r\n\r\n print(finalWinner)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\nL = {}\r\ntime = []\r\nmaxscore = -1001\r\nmaxname = \"0\"\r\nwhile(n>0):\r\n n = n-1\r\n name,score = input().split(' ')\r\n if L.get(name) == None:\r\n L[name] = int(score)\r\n else:\r\n L[name] += int(score)\r\n time.append([name,L[name]])\r\nmaxfinal = max(L.values())\r\nfor name,score in time:\r\n if score >= maxfinal and L[name] == maxfinal:\r\n print(name)\r\n break", "list_rounds = []\r\nlist_rounds_sum = []\r\nd_gamers = {}\r\nd_gamers2 = {}\r\n\r\nfor item in range(int(input())):\r\n name, score = input().split() \r\n if name in d_gamers:\r\n d_gamers[name] += int(score)\r\n list_rounds_sum.append([name, int(score)+ d_gamers[name]]) \r\n else:\r\n d_gamers[name] = int(score)\r\n d_gamers2[name] = 0\r\n list_rounds_sum.append([name, int(score)])\r\n list_rounds.append([name, int(score)])\r\n\r\n\r\nmax_score = max(d_gamers.values())\r\n\r\nwinners = []\r\nfor item in d_gamers:\r\n if d_gamers[item] == max_score:\r\n winners.append(item)\r\n\r\n\r\nfor n, s in list_rounds:\r\n d_gamers2[n] += s\r\n if n in winners and d_gamers2[n] >= max_score:\r\n print(n)\r\n break\r\n", "import sys\r\n\r\nline_num = sys.stdin.readline()\r\nlines = []\r\n\r\nfor i in range(0, int(line_num)):\r\n lines.append(sys.stdin.readline().strip())\r\n\r\nscore_dict = {\"#temp#\": (0, 0, False)}\r\nhighest_score_dict = {\"#temp#\": 0}\r\n\r\nfor fast_line in lines:\r\n temp_name, temp_score = fast_line.split()\r\n temp_score = int(temp_score)\r\n\r\n if temp_name in highest_score_dict:\r\n original_score = highest_score_dict[temp_name]\r\n else:\r\n original_score = 0\r\n\r\n highest_score_dict[temp_name] = temp_score + original_score\r\n\r\nhighest_score = 0\r\n\r\nfor score_candidate in highest_score_dict.values():\r\n\r\n if score_candidate > highest_score:\r\n highest_score = score_candidate\r\n\r\nfor index, line in enumerate(lines):\r\n name, score = line.split()\r\n score = int(score)\r\n\r\n if name in score_dict:\r\n current_score = score_dict[name][0] + score\r\n\r\n if score_dict[name][2]:\r\n fixed_index = score_dict[name][1]\r\n score_dict[name] = (current_score, fixed_index, True)\r\n continue\r\n\r\n if current_score > highest_score:\r\n score_dict[name] = (current_score, index, True)\r\n else:\r\n score_dict[name] = (current_score, index, False)\r\n else:\r\n if score > highest_score:\r\n score_dict[name] = (score, index, True)\r\n else:\r\n score_dict[name] = (score, index, False)\r\n\r\nwinner = (\"#temp#\", 0, 0)\r\n\r\nfor candidate in score_dict:\r\n\r\n if score_dict[candidate][0] > winner[1]:\r\n winner = (candidate, score_dict[candidate][0], score_dict[candidate][1])\r\n elif score_dict[candidate][0] == winner[1] and score_dict[candidate][1] < winner[2]:\r\n winner = (candidate, score_dict[candidate][0], score_dict[candidate][1])\r\n\r\nprint(winner[0])\r\n\r\n", "########################################################################\r\n# Importing required modules.\r\nimport copy as cp\r\n########################################################################\r\n# Class Definition.\r\nclass Berlogging:\r\n # Method to determine Winner.\r\n def find_winner(self):\r\n winner,index,found = \"\",0,False\r\n while not found and index<len(self.history):\r\n winner,found = self.help_find_winnner(index)\r\n index = index+1\r\n return winner\r\n # Method to help determine Winner.\r\n def help_find_winnner(self,index):\r\n # Current round.\r\n test_round = self.history[index]\r\n # Finding player who scored at least self.max_score.\r\n player,status = \"\",False\r\n for i in range(len(self.max_players)):\r\n if self.max_players[i] in test_round:\r\n # Check-Condition.\r\n if test_round[self.max_players[i]]>= self.max_score:\r\n player = self.max_players[i];status=True\r\n return player,status\r\n # Method to find max_score and list set of players with max_score.\r\n def max_score_set(self):\r\n final_round = self.history[-1]\r\n self.max_score = max(list(final_round.values()))\r\n # Finding players.\r\n players,self.max_players = list(final_round.keys()),[]\r\n for i in range(len(players)):\r\n if final_round[players[i]] == self.max_score:\r\n self.max_players.append(players[i])\r\n return self\r\n # Method to service new round.\r\n def service_round(self):\r\n # Copying previous and getting new entry from Codeforces.\r\n round = cp.deepcopy(self.prev_round)\r\n name,score = input().split(' ');score = int(score)\r\n # Entering new pair into round dictionary.\r\n if not name in round: round[name] = score\r\n else: round[name]+=score\r\n # Adding to History and updating previous.\r\n self.history.append(round)\r\n self.prev_round = cp.deepcopy(round)\r\n # Constructor.\r\n def __init__(self,round_count):\r\n # For Maintaing score of each round post-round.\r\n self.history = []\r\n # For Algorithm.\r\n self.prev_round,self.max_players,self.max_score = {},[],0\r\n # For Storing Number of rounds.\r\n self.round_count = round_count\r\n########################################################################\r\n# Driver Program.\r\nberlogging = Berlogging(int(input()))\r\nfor i in range(berlogging.round_count):\r\n berlogging.service_round()\r\nprint(berlogging.max_score_set().find_winner())\r\n########################################################################\r\n\r\n #######################################\r\n # Programming-Credits atifcppprogrammer\r\n #######################################\r\n", "from collections import defaultdict\r\n\r\nn = int(input())\r\n\r\nd = defaultdict((lambda : 0))\r\nhist = defaultdict(list)\r\n\r\nfor i in range(n):\r\n name, score = input().split()\r\n score = int(score)\r\n d[name] += score\r\n hist[name].append((i, d[name]))\r\n\r\nm = -1\r\n\r\nfor name in d.keys():\r\n if d[name] > m:\r\n m = d[name]\r\n\r\ncandidates = []\r\nfor name in d.keys():\r\n if d[name] == m:\r\n candidates.append(name)\r\n\r\nwinner = \"\"\r\nfirst = 1001\r\nfor name in candidates:\r\n for i, score in hist[name]:\r\n if score >= m:\r\n if i < first:\r\n first = i\r\n winner = name\r\n break\r\nprint(winner)", "score_board = {}\r\nstate = []\r\nfor i in range(int(input())):\r\n x,y = [char for char in input().split()]\r\n y = int(y)\r\n score_board[x] = score_board.get(x,0) + y\r\n state.append((x,score_board[x]))\r\nmax_sco = max(score_board.values())\r\n\r\nfor i,j in state:\r\n if score_board[i] == max_sco and j >= max_sco:\r\n print(i)\r\n break\r\n", "import math\r\nfrom collections import Counter, deque\r\nfrom sys import stdout\r\nimport time\r\nfrom math import factorial, log, gcd\r\nimport sys\r\n\r\ndef S():\r\n return sys.stdin.readline().split()\r\n\r\n\r\ndef I():\r\n return [int(i) for i in sys.stdin.readline().split()]\r\n\r\n\r\ndef II():\r\n return int(sys.stdin.readline())\r\n\r\n\r\ndef main():\r\n n = II()\r\n s = {}\r\n f = {}\r\n for i in range(n):\r\n name, score = S()\r\n score = int(score)\r\n if name not in s.keys():\r\n s[name] = score\r\n f[name] = {score: i}\r\n else:\r\n new = s[name] + score\r\n if new not in f[name].keys():\r\n f[name][new] = i\r\n s[name] += score\r\n m = []\r\n for i in s.keys():\r\n name = i\r\n score = s[i]\r\n idx = float('inf')\r\n for j, h in f[name].items():\r\n if j >= score:\r\n idx = min(h, idx)\r\n m.append((name, score, idx))\r\n m = list(sorted(m, key=lambda x: x[2]))[::-1]\r\n m = list(sorted(m, key=lambda x: x[1]))\r\n print(m[-1][0])\r\n\r\n\r\nif __name__ == '__main__':\r\n # for _ in range(II()):\r\n # main()\r\n main()", "import collections\r\nimport sys\r\n\r\n\r\ndef prepare_data(raw_data):\r\n data = []\r\n for line in raw_data:\r\n player, score = line.split()\r\n data.append((player, int(score)))\r\n return data\r\n\r\n\r\ndef get_winner(game_data, max_score, max_players):\r\n game_scores = collections.defaultdict(int)\r\n for player, score in game_data:\r\n game_scores[player] += score\r\n if game_scores[player] >= max_score and player in max_players:\r\n return player\r\n\r\n\r\ndef main(sinp=sys.stdin, sout=sys.stdout):\r\n final_scores = collections.defaultdict(int)\r\n rounds = int(sinp.readline())\r\n game_data = prepare_data(sinp)\r\n\r\n for player, score in game_data:\r\n final_scores[player] += score\r\n\r\n max_score = max(final_scores.values())\r\n max_players = [player for player, score in final_scores.items()\r\n if score == max_score]\r\n\r\n # Assuming one winner\r\n if len(max_players) == 1:\r\n winner = max_players[0]\r\n else:\r\n winner = get_winner(game_data, max_score, max_players)\r\n sout.write(winner)\r\n\r\nif __name__ == '__main__':\r\n main()", "def main():\n d, l = {}, []\n for _ in range(int(input())):\n name, score = input().split()\n d[name] = score = d.get(name, 0) + int(score)\n l.append((name, score))\n m = max(d.values())\n lim = len(l)\n for name, score in d.items():\n if score == m:\n for i, (n, score) in enumerate(l[:lim]):\n if n == name and score >= m:\n best = n\n lim = i\n break\n print(best)\n\n\nif __name__ == '__main__':\n main()\n", "# 2A Winner , Hashing\r\nn,di,li,m= int(input()),{},[],0\r\nfor x in range(n):\r\n name,score=input().split()\r\n score=int(score)\r\n di[name]= di.get(name,0) + score\r\n li.append([di[name],name])\r\n m=max(di.values())\r\nfor n,x in li:\r\n if n>=m and di[x]>=m :\r\n print(x)\r\n break", "n = int(input())\r\nname1 = []\r\nscore1 = []\r\ndict1 = {}\r\nfor i in range(n):\r\n name, score = input().split()\r\n score = int(score)\r\n name1.append(name)\r\n score1.append(score)\r\n if name not in dict1:\r\n dict1[name] = score\r\n else:\r\n dict1[name] = dict1[name] + score\r\nmax_score = max(dict1.values())\r\npotential = []\r\nfor (name2,score2) in dict1.items():\r\n if score2 == max_score:\r\n potential.append(name2)\r\nnew = {}\r\nfor i in range(n):\r\n if name1[i] in potential:\r\n if name1[i] in new:\r\n new[name1[i]] += score1[i]\r\n else:\r\n new[name1[i]] = score1[i]\r\n if new[name1[i]] >= max_score:\r\n print(name1[i])\r\n break\r\n\r\n \r\n \r\n'''\r\ndict2 = sorted(dict1.items(), key=lambda x:x[1])\r\nif dict2[-1][1] == dict2[-2][1]:\r\n m = dict2[-1][1]\r\n for i in range(2,len(name1)):\r\n if m == dict2[-i]:\r\n n = i\r\n else:\r\n break\r\n for i in dict1.keys[-1:-n]:\r\n \r\n for i in name1[-1:-n]:\r\n \r\n continue\r\n \r\nelse:\r\n print(dict2[-1][0])\r\n'''\r\n", "n = int(input())\nrounds = []\nscores = {}\nfor i in range(n):\n s = input().split(' ')\n rounds.append(s)\n if s[0] not in scores:\n scores[s[0]] = 0\n scores[s[0]] += int(s[1])\nwinner_list = []\nm = -1001\nfor name,score in scores.items():\n if m < score:\n m = score\nfor name,score in scores.items():\n if m == score:\n winner_list.append(name)\nwinner = {}\nfor r in rounds:\n if r[0] in winner_list:\n if r[0] not in winner:\n winner[r[0]] = 0\n winner[r[0]] += int(r[1])\n if winner[r[0]] >= m:\n print(r[0])\n break\n \n\n \n", "people = {}\r\n\r\ninputs = []\r\n\r\nfor i in range(int(input())):\r\n\tname, delta = input().split()\r\n\tdelta = int(delta)\r\n\r\n\tinputs.append((name, delta))\r\n\r\n\tif name not in people.keys():\r\n\t\tpeople[name] = 0\r\n\r\n\tpeople[name] += delta\r\n\r\nm = max(people.values())\r\n\r\ncandidates = []\r\nfor i in people.keys():\r\n\tif people[i] == m:\r\n\t\tcandidates.append(i)\r\n\r\nif len(candidates) == 1:\r\n\tprint(candidates[0])\r\nelse:\r\n\tfor i in people.keys():\r\n\t\tpeople[i] = 0\r\n\r\n\tfor name, delta in inputs:\r\n\t\tpeople[name] += delta\r\n\r\n\t\tif people[name] >= m and name in candidates:\r\n\t\t\tprint(name)\r\n\t\t\texit()", "#import sys\r\n#input = sys.stdin.readline\r\nn = int(input())\r\ntab = {}\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] = input().split()\r\n if x[i] in tab:\r\n tab[x[i]] += int(y[i])\r\n else:\r\n tab[x[i]] = int(y[i])\r\nmaxcount = 0\r\nfor i in tab:\r\n if tab[i] > maxcount:\r\n maxcount = tab[i]\r\ns = set()\r\nfor i in tab:\r\n if tab[i] == maxcount:\r\n s.add(i)\r\ntab = {}\r\nflag = True\r\nfor i in range(n):\r\n if x[i] in tab:\r\n tab[x[i]] += int(y[i])\r\n else:\r\n tab[x[i]] = int(y[i])\r\n if tab[x[i]] >= maxcount and (x[i] in s) and flag:\r\n winner = x[i]\r\n flag = False\r\nprint(winner)\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n ", "d = {}\r\nrounds = []\r\nfor _ in range(int(input())):\r\n name, score = input().split()\r\n rounds.append((name, score))\r\n d[name] = d.get(name, 0) + int(score)\r\nwinners = {}\r\nmax_score = max(d.values())\r\nfor name, score in d.items():\r\n if score == max_score:\r\n winners[name] = 0\r\nfor name, round in rounds:\r\n if name in winners:\r\n winners[name] += int(round)\r\n if winners[name] >= max_score:\r\n winner = name\r\n break\r\nprint(winner)\r\n", "import re\r\nfrom collections import defaultdict\r\n\r\ndef get_scores(namesscores):\r\n scores = defaultdict(int)\r\n for name, score in namesscores:\r\n scores[name] += score\r\n return scores\r\n\r\ndef get_winner(scores, namesscores):\r\n max_score = max(scores.values())\r\n winners = [name for name, score in scores.items() if score == max_score]\r\n if len(winners) == 1:\r\n return winners[0]\r\n else:\r\n winner_scores = defaultdict(int)\r\n for name, score in namesscores:\r\n if name in winners:\r\n winner_scores[name] += score\r\n if winner_scores[name] >= max_score:\r\n return name\r\n\r\nn = int(input())\r\nnamesscores = (re.match(r'(\\w+) ([-]?\\d+)', input().strip()) for i in range(n))\r\n\r\nnamesscores = [(match.group(1), int(match.group(2))) for match in namesscores]\r\n\r\nscores = get_scores(namesscores)\r\nwinner = get_winner(scores, namesscores)\r\n\r\nprint(winner)\r\n", "n = int(input())\r\nmapper = {}\r\narr = []\r\nfor i in range(n):\r\n cur = list(map(str,input().split()))\r\n cur[1] = int(cur[1])\r\n arr.append(cur)\r\n if cur[0] not in mapper:\r\n mapper[cur[0]] = cur[1]\r\n else:\r\n mapper[cur[0]]+=cur[1]\r\nmx = -1000000000\r\nfor i in mapper:\r\n mx = max(mx,mapper[i])\r\nagain = {}\r\nfor i in arr:\r\n if i[0] in again:\r\n again[i[0]]+=i[1]\r\n else:\r\n again[i[0]] = i[1]\r\n if mapper[i[0]]>=mx and again[i[0]]>=mx:\r\n print(i[0])\r\n exit()", "import collections\n\n\nn = int(input())\nscores = collections.defaultdict(int)\ninputs = []\nfor _ in range(n):\n name, score = input().split()\n score = int(score)\n scores[name] += score\n inputs.append((name, score))\nmax_score = max(scores.values())\nwinners = set(name for name, score in scores.items() if score == max_score)\nscores.clear()\nfor name, score in inputs:\n if name in winners:\n scores[name] += score\n if scores[name] >= max_score:\n print(name)\n break\n", "#2A - Winner\r\n#The all_data list holds sublists of all players & their scores\r\n#This list includes input as it's given. Accepts duplicates of players.\r\nall_data=[]\r\n#The players dictionary has the name as the key and the scores as values\r\n#I preffered to create a dictionary, for making sure we include the players\r\n#only once, and we only modify their scores later\r\nplayers={}\r\nrounds = int(input())\r\n#We take input for each round played:\r\nfor i in range(rounds):\r\n #Input form: name score\r\n name,score = input().split()\r\n score=int(score)\r\n #In the players dictionary, we add to the players' scores\r\n #each time their names repeat\r\n players[name]=players.get(name,0)+score\r\n #The all_data list stores all of the results in separate sublists\r\n all_data.append([name,players[name]])\r\n#The m variable determines the higest of the final scores\r\n #by looking at the values in the players dictionary\r\nm=max(players.values())\r\n#In case we have 2 max scores in the dictionary,\r\n#we go back to the input record in all_data list,\r\n#to determine who was the one to have scored the highest\r\n#We initiate to iterations for the same list, in order to\r\n#be able to compare items with each other and with the max value\r\nfor i,j in all_data:\r\n if j>=m and players[i]==m:\r\n #Lastly, we designate the first player that scored the higest\r\n #to be the winner and display his name\r\n print(i)\r\n break\r\n\r\n", "d,r={},[]\r\nfor _ in ' '*int(input()): x,c=input().split();d[x]=d.get(x,0)+int(c);r+=[(d[x],x)]\r\nm=max(d.values())\r\nprint([x for v,x in r if d[x]==m and v>=m][0])", "f = {}\r\nmas = []\r\nfor i in range(int(input())):\r\n name = input().split()\r\n n = name[0]\r\n s = int(name[1])\r\n f[n] = f.get(n, 0)\r\n f[n] += s\r\n mas.append([n, f[n]])\r\nmaxi = max(f.values())\r\nfor i, j in mas:\r\n if j >= maxi and f[i] == maxi:\r\n print(i)\r\n break", "import sys\nLI=lambda:list(map(int, sys.stdin.readline().strip('\\n').split()))\nMI=lambda:map(int, sys.stdin.readline().strip('\\n').split())\nSI=lambda:sys.stdin.readline().strip('\\n')\nII=lambda:int(sys.stdin.readline().strip('\\n'))\n\ntab={}\nsc={}\nfor i in range(II()):\n\ts, n=sys.stdin.readline().split()\n\tn=int(n)\n\ttry:\n\t\ttab[s].append((tab[s][-1][0]+n, i))\n\texcept:\n\t\ttab[s]=[(n, i)]\n\tif len(tab[s])==1 or n!=0:\n\t\tsc[tab[s][-1][0]]=sc.get(tab[s][-1][0], 0)+1\n\tif len(tab[s])>1 and n!=0:\n\t\tsc[tab[s][-2][0]]-=1\nmx=max(sc, key=lambda x:(sc[x], x))\nwin=[]\nfor v in tab:\n\tif tab[v][-1][0]==mx:\n\t\twin.append(v)\nmn=111111\nfor v in win:\n\tfor s, t in tab[v]:\n\t\tif s>=mx and t<mn:\n\t\t\tmn=t\n\t\t\tans=v\nprint(ans)", "d = dict()\r\nl=[]\r\nfor i in range(int(input().strip())):\r\n\tn,p=input().strip().split()\r\n\tp = int(p)\r\n\tif n not in d:\r\n\t\td[n]=p\r\n\telse:\r\n\t\td[n]+=p\r\n\tl.append((d[n],n))\r\nm = max(d.values())\r\nfor p,n in l:\r\n\tif p>=m and d[n]>=m:\r\n\t\tprint(n)\r\n\t\tbreak\r\n", "import sys\r\ninput = sys.stdin.readline\r\nn = int(input()) \r\nd = dict() \r\nlst=[ ]\r\nfor i in range(n):\r\n a = list(map(str,input().split())) \r\n lst.append(a) \r\nfor i in lst:\r\n d[i[0]]=0 \r\n\r\nfor i in lst:\r\n d[i[0]]+=int(i[1]) \r\n # print(d)\r\nmaxi = 0\r\n# print(d)\r\ns = set() \r\nfor i in d:\r\n maxi = max(maxi,d[i]) \r\nfor i in d:\r\n if (d[i]==maxi):\r\n s.add(i) \r\n# print(s)\r\nfor i in lst:\r\n d[i[0]]=0 \r\n# print(d)\r\n\r\n\r\n\r\n\r\nfor i in lst:\r\n d[i[0]]+=int(i[1]) \r\n if ((d[i[0]] >= maxi) and (i[0] in s)):\r\n print(i[0]) \r\n break \r\n \r\n \r\n ", "n = int(input())\r\nscores = {}\r\nstate = []\r\n \r\nfor i in range(n):\r\n name, point = input().split()\r\n point = int(point)\r\n if name in scores.keys():\r\n scores[name] += point\r\n state.append((name, scores[name]))\r\n else:\r\n scores[name] = point\r\n state.append((name, point))\r\n \r\nmax_score = max(scores.values())\r\n \r\nfor name, point in state:\r\n if point >= max_score and scores[name] == max_score:\r\n print(name)\r\n break", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom collections import defaultdict\r\n\r\nN = int(input())\r\nlib = defaultdict(int)\r\nA = []\r\nfor i in range(N):\r\n name,d = input().split()\r\n d = int(d)\r\n A.append((name,d))\r\n lib[name]+=d\r\n\r\nB = []\r\nfor k,v in lib.items():\r\n B.append((v,k))\r\nB.sort(reverse=True)\r\n\r\nif N==1:\r\n exit(print(B[0][1]))\r\n \r\nif B[0][0]==B[1][0]:\r\n score = B[0][0]\r\n names = set()\r\n for i in range(len(B)):\r\n if B[i][0]==score:\r\n names.add(B[i][1])\r\n \r\n lib = defaultdict(int)\r\n for name,d in A:\r\n lib[name]+=d\r\n if name in names and lib[name]>=score:\r\n exit(print(name))\r\n \r\nelse:\r\n print(B[0][1])\r\n \r\n ", "\"\"\"\ncodeforces 2A\n\"\"\"\n\"\"\"pas bon pour le test dépasse m avant la fin\n\"\"\"\n\n\ndef winner():\n a = int(input())\n b = []\n dict = {}\n\n for x in range(a):\n n, p = input().split()\n pp=int(p)\n b.append([n, pp, x])\n if n in dict:\n dict[n] += pp\n else:\n dict[n] = pp\n maxi = max(v for v in dict.values())\n winners = [k for k, v in dict.items() if v == maxi]\n z = [k for k in b if k[0] in winners]\n result = []\n for k in winners:\n cumul = 0\n for h in z:\n if h[0] == k:\n cumul += h[1]\n if cumul >= maxi:\n result.append([h[2], h[0]])\n break\n result = sorted(result)\n return result[0][1]\n\n\ndef main():\n print(winner())\n\n\nif __name__ == \"__main__\":\n main()\n", "n = int(input())\nd = {}\nq = []\n\nfor i in range(n):\n x, y = input().split()\n y = int(y)\n q.append([x, y])\n d[x] = d.get(x, 0)+y\nans = max(d.values())\nma = {}\nfor x, y in q:\n ma[x] = ma.get(x, 0)+y\n if ma[x] >= ans and d[x] == ans:\n print(x)\n break\n", "n=int(input())\r\nd={}\r\nl=[]\r\nname=''\r\nfor i in range(n):\r\n s=input().split()\r\n if s[0] in d:\r\n d[s[0]]+=int(s[1])\r\n else:\r\n d[s[0]]=int(s[1])\r\n l.append([s[0],d[s[0]]])\r\nm=max(d.values())\r\n\r\n#print(d)\r\nfor i,j in l: \r\n if j>=m and d[i] == m:\r\n print(i)\r\n break\r\n \r\n \r\n ", "n, c, m = eval(input()), {}, []\r\nfor i in range(n):\r\n a, b = input().split(\" \")\r\n c[a] = c.get(a, 0) + int(b)\r\n m.append([a, c[a]])\r\nn = max(c.values())\r\nfor i, j in m:\r\n if c[i] == n and int(j) >= n:\r\n print(i)\r\n break\r\n", "# LUOGU_RID: 106932284\nn = int(input())\r\nmp = {}\r\nMax = 0\r\ncnt = \"\"\r\na = []\r\nfor i in range(0, n):\r\n b = list(map(str, input().split()))\r\n a.append(b)\r\n if b[0] in mp:\r\n mp[b[0]] += int(b[1])\r\n else:\r\n mp[b[0]] = int(b[1])\r\nfor i in range(0, n):\r\n Max = max(Max, mp[a[i][0]])\r\nMp = {}\r\nfor i in range(0, n):\r\n if a[i][0] in Mp:\r\n Mp[a[i][0]] += int(a[i][1])\r\n else:\r\n Mp[a[i][0]] = int(a[i][1])\r\n if mp[a[i][0]] == Max and Mp[a[i][0]] >= Max:\r\n print(a[i][0])\r\n break\r\n", "n = int(input())\r\nal = []\r\nfor i in range(n):\r\n al+=[input().split()]\r\nr = {}\r\nb = []\r\nfor i in range(n):\r\n x,y = al[i]\r\n y = int(y)\r\n if x in r.keys():\r\n r[x] += y \r\n else:\r\n r[x] = y \r\n b+=[[x, r[x]]]\r\nm = max(r.values())\r\nfor x,p in b:\r\n if p>=m and r[x]==m:\r\n print(x)\r\n break", "if __name__ == '__main__':\n result = {}\n num = int(input())\n for i in range(1, num + 1):\n res = input().split(' ')\n name = res[0]\n score = int(res[1])\n if name not in result:\n result[name] = [score]\n else:\n result[name][0] = result[name][0] + score\n result[name].append((score, i))\n first_elem_result = list(result.keys())[0]\n max = result[first_elem_result][0]\n max_player_name = [first_elem_result]\n for player_name in result:\n if player_name != max_player_name[0]:\n if result[player_name][0] > max:\n max = result[player_name][0]\n max_player_name = [player_name]\n elif result[player_name][0] == max:\n max_player_name.append(player_name)\n final_name = ''\n min_iter = num\n for player_name in max_player_name:\n player_res = 0\n player_iter = 0\n i = 1\n while player_res < max:\n player_res = player_res + result[player_name][i][0]\n player_iter = result[player_name][i][1]\n i = i + 1\n if player_iter <= min_iter:\n min_iter = player_iter\n final_name = player_name\n print(final_name)\n", "n=int(input())\r\nlist1=[]\r\ndict1={}\r\nwinner=[]\r\nfor i in range(n):\r\n list1.append(input().split())\r\nfor i in list1:\r\n if i[0] in dict1:\r\n dict1[i[0]]+=int(i[1])\r\n else:\r\n dict1[i[0]]=int(i[1])\r\nbest=dict1[max(dict1.items(), key=lambda x: x[1])[0]]\r\nfor i in dict1.keys():\r\n if dict1[i]==best:\r\n winner.append(i)\r\ndict2={}\r\nfor i in list1:\r\n if i[0] in winner:\r\n if i[0] in dict2:\r\n dict2[i[0]]+=int(i[1])\r\n else:\r\n dict2[i[0]]=int(i[1])\r\n if dict2[i[0]]>=best:\r\n result=i[0]\r\n break\r\nprint(result)", "while True:\r\n n = int(input())\r\n if (1 <= n <= 1000):\r\n break\r\nd = {}\r\nl = []\r\nfor i in range(0,n):\r\n while True:\r\n name, score = map(str,input().split())\r\n name = name.lower()\r\n score = int(score)\r\n if (1 <= len(name) <= 32) and (-1000 <= score <= 1000):\r\n break\r\n if name in d.keys():\r\n d[name] += score\r\n else:\r\n d[name] = score\r\n l.append((name, d[name]))\r\nk = max(d.values()) \r\nfor name, m in l:\r\n if (m >= k) and (d[name] == k):\r\n print (name)\r\n break", "n=int(input())\r\nd=dict()\r\nrcd,hpt=[],-1001\r\nfor i in range(n):\r\n name,pt=[i for i in input().split(\" \")]\r\n pt=int(pt)\r\n if name not in d.keys(): d[name]=0\r\n rcd.append([name,pt+d[name]])\r\n d[name]+=pt\r\n #if d[name]>hpt: hpt=d[name]\r\nl = d.values()\r\nl = max(l)\r\nfor i in rcd:\r\n if i[1]>=l and d[i[0]]>=l:\r\n print(i[0])\r\n break", "def count_it():\r\n person_score={} #stores the persons_score after all rounds\r\n maxi=-999999\r\n round_score=[] #stores the round info\r\n #FINDING MAXIMUM SCORE:\r\n for i in range(int(input())):\r\n x=input() #input\r\n round_score.append(x) #adding the info to the round_score\r\n x=x.split() #splitting the input\r\n if x[0] not in person_score.keys():\r\n person_score[x[0]]=int(x[1])\r\n else:\r\n person_score[x[0]]+=int(x[1])\r\n m=max(person_score.values()) #Getting the maximum \r\n #print(\"Check if m is okay\",m)\r\n #PLAYERS WITH MAX SCORE M: \r\n players=[] #Generating the player list\r\n for i in person_score.keys():\r\n if person_score[i]==m:\r\n players.append(i)\r\n #print(\"Check if players are okay\",players) \r\n #TO FIND WINNER AMONG THESE PLAYERS START WITH ROUNDS AGAIN AND SEE IF WHICH PLAYERS SCORE WAS >=M AND THEN STOP\r\n prev_score={i:0 for i in person_score.keys()}\r\n #print(prev_score)\r\n if len(players)>1:\r\n for roun in round_score:\r\n p=roun.split()\r\n prev_score[p[0]]+=int(p[1])\r\n if p[0] in players and prev_score[p[0]]>=m:\r\n print(p[0])\r\n break\r\n elif len(players)==1:\r\n print(players[0])\r\n\r\ncount_it()\r\n", "def Problem():\r\n T=[]\r\n for _ in range(int(input())):\r\n Pl={}\r\n S=input()\r\n Pl['Name']=S[:S.find(' ')]\r\n Pl['Score']=int(S[S.find(' '):])\r\n T.append(Pl)\r\n MaxS=SommeScore(T,T[0]['Name'])\r\n Name=T[0]['Name']\r\n for i in range(1,len(T)):\r\n if T[i]['Name']!=Name:\r\n SommeS=SommeScore(T,T[i]['Name'])\r\n if SommeS>MaxS:\r\n MaxS=SommeS\r\n Name=T[i]['Name']\r\n elif SommeS==MaxS:\r\n P1=Position(T,Name,MaxS)\r\n P2=Position(T,T[i]['Name'],MaxS)\r\n if P2<P1:\r\n MaxS=SommeS\r\n Name=T[i]['Name']\r\n P1=P2\r\n print(Name)\r\ndef SommeScore(T,Name):\r\n S=0\r\n for i in range(len(T)):\r\n if T[i]['Name']==Name:\r\n S+=T[i]['Score']\r\n return S\r\ndef Position(T,Name,MaxS):\r\n S=0\r\n i=0\r\n while i<len(T) and S<MaxS:\r\n if T[i]['Name']==Name:\r\n S+=T[i]['Score']\r\n i+=1\r\n return i-1\r\n \r\nProblem()\r\n \r\n\r\n\r\n\r\n \r\n \r\n\r\n", "p,r,n=[],{},int(input())\r\nfor i in range(n):a,b=input().split();b=int(b);r[a]=r.get(a,0)+b;p.append([r[a],a]);m = max(r.values())\r\nfor n,a in p :\r\n if n>=m and r[a]>=m :\r\n print(a)\r\n break", "rounds = int(input())\r\n\r\nplayers = {}\r\n\r\nresultsP = []\r\nresultsS = []\r\nfor r in range(rounds):\r\n p, dS = input().split()\r\n dS = int(dS)\r\n\r\n resultsP.append(p)\r\n resultsS.append(dS)\r\n\r\n players[p] = players.get(p, 0) + dS\r\n\r\ntop_score = max(players.values())\r\n\r\nplayers2 = {}\r\nfor r in range(rounds):\r\n p = resultsP[r]\r\n s = resultsS[r]\r\n\r\n if players[p] != top_score:\r\n continue\r\n\r\n players2[p] = players2.get(p, 0) + s\r\n if players2[p] >= top_score:\r\n print(p)\r\n break", "n = int(input())\nl = []\na = {}\nfor i in range(n):\n\tu, s = input().split()\n\tl.append((u, int(s)))\n\tif not u in a: a[u] = 0\n\ta[u] += int(s)\nans = max(a.values())\nwin = set(filter(lambda x: a[x] == ans, a.keys()))\na = {}\nfor i in range(n):\n\tu, s = l[i]\n\tif not u in a: a[u] = 0\n\ta[u] += s\n\tif a[u] >= ans and u in win:\n\t\tprint(u)\n\t\tbreak\n", "n = int(input())\r\nscores = {}\r\nnamess, scoress = [], []\r\nfor i in range(n):\r\n name, score = input().split()\r\n namess.append(name)\r\n scoress.append(score)\r\n score = int(score)\r\n scores[name] = scores.get(name, 0) + score\r\nmax_score = max(scores.values())\r\nwinners = [name for name, score in scores.items() if score == max_score]\r\ncurrent_scores = {name: 0 for name in scores}\r\nfor i in range(n):\r\n name, score = namess[i], scoress[i]\r\n score = int(score)\r\n current_scores[name] += score\r\n if name in winners and current_scores[name] >= max_score:\r\n print(name)\r\n break", "\n\n\n\nplayers = dict()\ngames = []\n\nfor _ in range(int(input())):\n name, score = input().split()\n\n players.setdefault(name, 0)\n players[name] += int(score)\n games.append((name, players[name]))\n\nwinning_score = max(players.values())\nwinner_candidates = set(name for name, score in players.items() if score == winning_score)\n\n\nfor name, score in games:\n if name not in winner_candidates:\n continue\n\n if score >= winning_score:\n print(name)\n break\n\n\n\n\n\n", "scores = {}\r\nqueue = []\r\n\r\nfor _ in range(int(input())):\r\n name, score = input().split()\r\n queue.append((name, score))\r\n scores[name] = scores.get(name, 0) + int(score)\r\n\r\nm = max(scores.values())\r\n\r\nnames = set(filter(lambda _: scores[_] == m, scores.keys())) # side comment: without a set() it won't work\r\n\r\nscores = {}\r\n\r\nfor name, score in queue:\r\n scores[name] = scores.get(name, 0) + int(score)\r\n if scores[name] >= m and name in names:\r\n print(name)\r\n break\r\n", "n = int(input())\r\nd,lst = {},[]\r\nfor i in range(n):\r\n a,b = input().split()\r\n b = int(b)\r\n lst.append([a,b])\r\n if d.get(a)==None:\r\n d[a]=0\r\n d[a]+=b\r\ndi,res = {},''\r\nm = max(d.values())\r\nfor i,x in enumerate(lst):\r\n a,b=x[0],x[1]\r\n if di.get(a)==None:\r\n di[a]=0\r\n di[a]+=b\r\n if d[a]==m:\r\n if di[a]>=m:\r\n res=a\r\n break\r\nprint(res)", "n = int(input())\r\nplayers = {}\r\nscos = []\r\nfor i in range(n):\r\n p,s = input().split()\r\n players[p] = players.get(p,0)+int(s)\r\n scos.append([p,players[p]])\r\n\r\nmaxP = max(players.values())\r\nfor i,j in scos:\r\n if players[i] == maxP and j >= maxP:\r\n print(i)\r\n break\r\n\r\n\r\n", "def position(list1,n):\r\n j = 0\r\n while list1[j] < n:\r\n j = j + 2\r\n return list1[j+1]\r\nm = input()\r\nm = int(m)\r\nscore = []\r\nname = []\r\nmax1 = 0\r\nmin1 = m\r\nnumber = 0\r\nwinner = ''\r\nfor i in range(m):\r\n name1,score1 = input().split()\r\n score1 = float(score1)\r\n if name1 in name :\r\n k = name.index(name1)\r\n score[k].append(score[k][-2]+score1)\r\n score[k].append(i)\r\n else:\r\n name.append(name1)\r\n score.append([score1, i])\r\n number = number+1\r\nfor i in range(number):\r\n if score[i][-2] > max1 :\r\n max1 = score[i][-2]\r\n time = position(score[i], max1)\r\n min1 = time\r\n winner = name[i]\r\n if score[i][-2] == max1:\r\n time = position(score[i],max1)\r\n if time < min1 :\r\n min1 = time\r\n winner = name[i]\r\nprint(winner)", "n,c,m=eval(input()),{},[]\r\nfor i in range(n):\r\n a,b=input().split(' ')\r\n c[a]=c.get(a,0)+int(b)\r\n m.append([a,c[a]])\r\nn=max(c.values())\r\nfor i ,j in m:\r\n if c[i]==n and int(j)>=n:\r\n print(i);break", "n = int(input())\r\nname = []\r\nvalue = []\r\nname2 = []\r\nvalue2 = []\r\nfor i in range(n):\r\n a,b = input().split()\r\n if a not in name:\r\n name.append(a)\r\n value.append(int(b))\r\n else:\r\n value[name.index(a)]+=int(b)\r\n name2.append(a)\r\n value2.append(value[name.index(a)])\r\n\r\n\r\n# pick the name which match the maximum value\r\nmax_value = max(value)\r\ni = 0\r\nwhile i < len(value):\r\n if value[i]!=max_value:\r\n value = value[:i]+value[i+1:]\r\n name = name[:i] + name[i+1:]\r\n i = i-1\r\n i +=1\r\n\r\ni = 0\r\nwhile i < len(value2):\r\n if name2[i] not in name:\r\n name2 = name2[:i]+name2[i+1:]\r\n value2 = value2[:i]+value2[i+1:]\r\n i = i-1\r\n i+=1\r\n\r\ni = 0\r\nfor i in range(len(value2)):\r\n if value2[i]>= max_value:\r\n return_name = name2[i]\r\n break\r\n \r\nprint(return_name)\r\n\r\n\r\n# 15\r\n# A 681\r\n# B -74\r\n# A 661\r\n# C 474\r\n# A -547\r\n# A 600\r\n# B -11\r\n# C 711\r\n# D 652\r\n# A -1000\r\n# A -171\r\n# D -302\r\n# A 961\r\n# B 848\r\n# D -735\r\n5000\r\n800,000", "n = int(input())\nd = {}\nli = []\nmax_arr={}\nfor i in range(n):\n na, p = map(str, input().split())\n d[na] = d.get(na, 0) + int(p)\n li.append([na, p])\nmaxm = max(d.values())\nans = \"\"\ndp = {}\nfor x, y in li:\n dp[x] = dp.get(x, 0) + int(y)\n if dp[x] >= maxm and d[x] == maxm:\n ans = x\n break\nprint(ans)", "n=int(input())\r\nd={}\r\nl=[]\r\nfor i in range(n):\r\n name,points=[i for i in input().split(\" \")]\r\n points=int(points)\r\n if name not in d: \r\n d[name]=0\r\n l.append([name,points+d[name]])\r\n d[name]+=points\r\nlis=d.values()\r\nm=max(lis)\r\nfor i in l:\r\n if i[1]>=m and d[i[0]]>=m:\r\n print(i[0])\r\n break", "n=int(input())\r\nmaxname=''\r\nmaxnum=0\r\na=dict()\r\nb=dict()\r\nrnds=[]\r\nfor i in range(n):\r\n s=input().split()\r\n rnds.append(s)\r\n score=a.get(s[0],0)+int(s[1])\r\n a[s[0]]=score\r\nmaxnum=sorted(a.values())[-1]\r\nwinners=[]\r\nfor nm in a.keys():\r\n if a[nm]==maxnum:\r\n winners.append(nm)\r\nif( len(winners) == 1 ):\r\n print(winners[0])\r\nelse:\r\n for s in rnds:\r\n score=b.get(s[0],0)+int(s[1])\r\n b[s[0]]=score\r\n if (s[0] in winners) and (score >= maxnum ):\r\n print(s[0])\r\n break", "import sys\r\ncin = int(sys.stdin.readline().strip())\r\nd = {}\r\nl = []\r\nfor testcase in range(cin):\r\n cin1 = sys.stdin.readline().strip().split()\r\n cin1[1] = int(cin1[1])\r\n if cin1[0] not in d:\r\n d[cin1[0]] = cin1[1]\r\n else:\r\n d[cin1[0]]+=cin1[1]\r\n l.append(cin1)\r\nx = max(d.values())\r\nd1 = {}\r\nfor i in l:\r\n if i[0] not in d1:\r\n d1[i[0]] = i[1]\r\n else:\r\n d1[i[0]]+=i[1]\r\n if d1[i[0]]>=x and d[i[0]]==x:\r\n print(i[0])\r\n break \r\n ", "n = int(input())\r\n\r\nm = {}\r\ninputs = []\r\n\r\nfor _ in range(n):\r\n t = input().split()\r\n inputs.append(t)\r\n\r\n name, s = inputs[-1][0], int(inputs[-1][1])\r\n\r\n if name not in m:\r\n m[name] = 0\r\n m[name] += s\r\n \r\n\r\nmx = max(m.values())\r\nfinishedAtMax = set([k for k, v in m.items() if v == mx])\r\nm.clear()\r\n\r\n\r\nfor i in range(n):\r\n name, s = inputs[i][0], int(inputs[i][1])\r\n\r\n if name not in m:\r\n m[name] = 0\r\n m[name] += s\r\n\r\n if m[name] >= mx and name in finishedAtMax:\r\n print(name)\r\n break", "from collections import defaultdict\r\nT=int(input())\r\nmat=[]\r\nd=defaultdict(int)\r\nd1=defaultdict(int)\r\nfor _ in range(T):\r\n a=[str(x) for x in input().split()]\r\n mat.append(a)\r\n d[a[0]]+=(int(a[1]))\r\nans=max(list(d.values()))\r\nss=set()\r\nfor i in d:\r\n if d[i]==ans:\r\n ss.add(i)\r\nfor i in mat:\r\n d1[i[0]]+=int(i[1])\r\n if d1[i[0]]>=ans and i[0] in ss:\r\n print(i[0])\r\n break", "n = int(input())\nplayers = {}\narr = []\n\nfor i in range(0, n):\n name, points = input().split()\n if name in players:\n players[name] += int(points)\n else:\n players[name] = int(points)\n arr.append([name, players[name]])\n\nmx = max(players.values())\nres = None\nfor name, points in arr:\n if points >= mx and players[name] == mx:\n res = name\n break\n\nprint(res)\n", "import sys\r\n\r\n# sys.stdin = open(\"3.in\", \"r\")\r\n\r\nn = int(input())\r\n\r\nmy_dict = dict()\r\nrounds = []\r\nfor i in range(n):\r\n name, point = input().split()\r\n point = int(point)\r\n rounds.append((name, point))\r\n\r\n if name in my_dict:\r\n my_dict[name] += point\r\n else:\r\n my_dict[name] = point\r\n\r\nmax_score = -sys.maxsize\r\nmax_names = []\r\nfor name, score in my_dict.items():\r\n if score > max_score:\r\n max_score = score\r\n max_names = [name]\r\n elif score == max_score:\r\n max_names.append(name)\r\n\r\nif len(max_names)==1:\r\n print(max_names[0])\r\n exit(0)\r\n \r\nmy_dict = dict()\r\nfor name, point in rounds:\r\n if name in my_dict:\r\n my_dict[name] += point\r\n else:\r\n my_dict[name] = point\r\n\r\n if my_dict[name]>=max_score and name in max_names:\r\n print(name)\r\n break\r\n\r\n", "n = int(input())\r\nplayers = {}\r\nmax_val=0\r\nwinner = ''\r\ngame = []\r\nfor i in range(n):\r\n con = list(input().split())\r\n con[1] = int(con[1])\r\n game.append(con)\r\n name = con[0]\r\n val = con[1]\r\n if name in players:\r\n players[name]+=val\r\n else:\r\n players[name]=val\r\nmax_val=max(players.values())\r\nwinners = []\r\nfor k,v in players.items():\r\n if v == max_val:\r\n winners.append(k)\r\nplayers = {}\r\nfor i in range(n):\r\n name = game[i][0]\r\n val = game[i][1]\r\n if name in players:\r\n players[name]+=val\r\n if players[name]>=max_val and name in winners:\r\n winner = name\r\n break\r\n else:\r\n players[name]=val\r\n if players[name]>=max_val and name in winners:\r\n winner = name\r\n break\r\nprint(winner)\r\n", "from collections import defaultdict\r\n\r\nn = int(input())\r\n\r\nd = defaultdict(int)\r\n\r\nlines = [input() for _ in range(n)]\r\nlines = [line.split() for line in lines]\r\nlines = [(line[0], int(line[1])) for line in lines]\r\n\r\nfor line in lines:\r\n d[line[0]] += line[1]\r\n\r\ntarget_score = max(d.values())\r\n\r\nplayers_with_score = [player for player, score in d.items() if score == target_score]\r\n\r\nif len(players_with_score) == 1:\r\n print(players_with_score[0])\r\nelse:\r\n p = set(players_with_score)\r\n\r\n d = defaultdict(int)\r\n\r\n for line in lines:\r\n if line[0] in p:\r\n v = d[line[0]] + line[1]\r\n if v >= target_score:\r\n print(line[0])\r\n break\r\n else:\r\n d[line[0]] = v", "inp=[]\r\nlistN=[]\r\nlistS=[]\r\n\r\nn=int(input())\r\n\r\nfor i in range(n):\r\n name, score=str(input()).split()\r\n score=int(score)\r\n inp.append([name, score])\r\n if name in listN:\r\n a=listN.index(name)\r\n listS[a][0]+=score\r\n else:\r\n listN.append(name)\r\n listS.append([score, name])\r\n\r\nmaximum=max(listS)[0]\r\n\r\nwinners=[]\r\nwinnersN=[]\r\n\r\nfor score,name in listS:\r\n if score==maximum:\r\n winnersN.append(name)\r\n winners.append(0)\r\n\r\nfor name, score in inp:\r\n if name in winnersN:\r\n winners[winnersN.index(name)]+=score\r\n if winners[winnersN.index(name)]>=maximum:\r\n toprint=name\r\n break;\r\n\r\nprint(toprint)", "n=int(input())\r\ndic={}\r\nfor i in range(n):\r\n l=input().split()\r\n name=l[0]\r\n score=int(l[1])\r\n if name in dic:\r\n dic[name].append(score)\r\n for g in dic:\r\n if g != name:\r\n dic[g].append(0)\r\n \r\n else:\r\n dic[name]=[]\r\n for m in range(i):\r\n dic[name].append(0)\r\n dic[name].append(score)\r\n for g in dic:\r\n if g != name:\r\n dic[g].append(0)\r\n \r\nmaxx=0\r\nfor i in dic:\r\n if sum(dic[i])>maxx:\r\n maxx=sum(dic[i])\r\nw=[]\r\nr=[]\r\nfor i in dic:\r\n if sum(dic[i])==maxx:\r\n w.append(i)\r\nfor i in w :\r\n c=0\r\n ss=0\r\n for j in dic[i]:\r\n ss+=j\r\n c+=1\r\n if ss >= maxx:\r\n r.append(c)\r\n break\r\nwinner=w[r.index(min(r))]\r\n\r\nprint(winner)\r\n ", "from operator import itemgetter\nn=int(input())\nd = {}\nfor i in range(n):\n na, p = input().split(' ')\n d[na] = d.get(na, []) + [(int(p), i)]\nit = d.items()\nmx = max(map(lambda x: sum(map(lambda x: x[0], x[1])), it))\nw = None\nii = n\nfor o in filter(lambda x: sum(map(lambda x: x[0], x[1])) == mx, it):\n s = 0\n for i in o[1]:\n s += i[0]\n if s >= mx:\n if i[1] < ii:\n ii = i[1]\n w = o\n break\nprint(w[0])", "from collections import defaultdict\r\nn = int(input())\r\ns = defaultdict(int)\r\nentry = []\r\nfor i in range(n):\r\n entry.append(input().split())\r\n name, score = [entry[-1][0],int(entry[-1][1])]\r\n s[name] += score\r\nmaxs = -1000001\r\nfor name in s:\r\n if s[name]>maxs:\r\n maxs = s[name]\r\n maxi = [name]\r\n elif s[name] == maxs:\r\n maxi.append(name)\r\nif len(maxi) == 1:\r\n print(maxi[0])\r\nelse:\r\n maxi = set(maxi)\r\n s1 = defaultdict(int)\r\n for i in range(n):\r\n name,score = [entry[i][0],int(entry[i][1])]\r\n s1[name] += score\r\n if name in maxi and s1[name]>=maxs:\r\n print(name)\r\n break", "n=int(input())\r\nname=[]\r\nscore=[]\r\n\r\n#input\r\nfor i in range(n):\r\n inp=input().split()\r\n nam=str(inp[0])\r\n sco=int(inp[1])\r\n name.append(nam)\r\n score.append(sco)\r\nmydict={}\r\ni=0\r\n\r\n#calculating final score of all players\r\nfor nam in name:\r\n if mydict.get(nam)==None:\r\n mydict[nam]=score[i]\r\n else:\r\n t=mydict[nam]+score[i]\r\n mydict[nam]=t\r\n i=i+1\r\nmaxsco=0\r\nmaxconame=\"\"\r\nmaxnames=[]\r\n\r\n#filtering the players who have the max score at the end of all rounds\r\nfor nam in mydict:\r\n if maxsco<mydict[nam]:\r\n maxnames.clear()\r\n maxsco=mydict[nam]\r\n maxnames.append(nam)\r\n elif maxsco==mydict[nam]:\r\n maxnames.append(nam)\r\n\r\nmydict.clear()\r\ni=0\r\n\r\n#finding the player who was the first one to score at least the max score \r\nfor nam in name:\r\n if mydict.get(nam)==None:\r\n mydict[nam]=score[i]\r\n else:\r\n t=mydict[nam]+score[i]\r\n mydict[nam]=t\r\n if mydict[nam]>=maxsco:\r\n if nam in maxnames:\r\n print(nam)\r\n break\r\n i=i+1", "m = {}\r\nout = []\r\n\r\nfor i in range(int(input())):\r\n line = input().split(\" \")\r\n\r\n if(line[0] in m):\r\n m[line[0]] += int(line[1])\r\n else:\r\n m[line[0]] = int(line[1])\r\n\r\n out.append([line[0],m[line[0]]])\r\n\r\nout\r\nma = max(m.values())\r\nfor i in out:\r\n if(m[i[0]] == ma and i[1] >= ma):\r\n print(i[0])\r\n break\r\n", "import sys\nfrom collections import defaultdict\n\nif __name__ == '__main__':\n n = int(sys.stdin.readline().rstrip())\n scores = defaultdict(int)\n data = []\n max_score = 0\n for _ in range(n):\n name, score = sys.stdin.readline().rstrip().split(' ')\n score = int(score)\n data.append((name, score))\n scores[name] += score\n max_score = max(scores.values())\n winners = set([name for name, score in scores.items() if score == max_score])\n # print(max_score, winners)\n scores = defaultdict(int)\n for name, score in data:\n if name in winners:\n scores[name] += score\n if scores[name] >= max_score:\n print(name)\n break\n", "from collections import defaultdict\nn = int(input())\nplayers = []\nscores = defaultdict(lambda:0)\nfor _ in range(n):\n s,p = input().split()\n p = int(p)\n players.append((s,p));\n scores[s]+=p\nscore = max(scores.values())\nbest = dict()\nfor p in scores.keys():\n if scores[p]==score:\n best[p] = score\n# print(best)\nwinner = \"\"\nfor player,points in players:\n if player in best:\n if best[player]<=points:\n winner = player\n break\n best[player]-=points\nprint(winner)", "# import math\r\n#\r\n# count_iter = int(input())\r\n# counter = {}\r\n# history = []\r\n#\r\n# while count_iter:\r\n# name, score = input().split()\r\n# if name not in counter:\r\n# counter[name] = int(score)\r\n# else:\r\n# counter[name] += int(score)\r\n# history.append((name, int(score)))\r\n# count_iter -= 1\r\n#\r\n# max_number = -math.inf\r\n# for score in counter.values():\r\n# if score > max_number:\r\n# max_number = score\r\n#\r\n# top_players = []\r\n# for name, score in counter.items():\r\n# if score == max_number:\r\n# top_players.append(name)\r\n#\r\n# for i in history:\r\n# if i[1] >= max_number and i[0] in top_players:\r\n# print(i[0])\r\n# break\r\nimport math\r\n\r\nn = int(input())\r\na = dict()\r\nhistory = []\r\n\r\nfor _ in range(n):\r\n _name, _score = input().split()\r\n if _name not in a:\r\n a[_name] = int(_score)\r\n else:\r\n a[_name] += int(_score)\r\n\r\n history.append((a[_name], _name))\r\n\r\n# Максимальный результат\r\nmax_score = -math.inf\r\nfor s in a.values():\r\n if s > max_score:\r\n max_score = s\r\n\r\n# Игроки, набравшие максимальный результат\r\nplayers = []\r\nfor n, s in a.items():\r\n if s == max_score:\r\n players.append(n)\r\n\r\n# Победитель\r\nfor i in history:\r\n if i[0] >= max_score and i[1] in players:\r\n print(i[1])\r\n break", "# coding gbk\r\n# !usr/bin/env\r\nimport sys\r\n\r\nfor line in sys.stdin:\r\n p = []\r\n mat = {}\r\n t = line.split()\r\n for i in range(int(t[0])):\r\n a, b = input().split()\r\n b = int(b)\r\n mat[a] = mat.get(a, 0) + b\r\n p.append([mat[a], a])\r\n m = max(mat.values())\r\n for n, a in p:\r\n if n >= m and mat[a] >= m:\r\n print(a)\r\n break\r\n", "# Codeforces Beta Round #2\n# A. Winner\n\nimport collections\n\nlines = []\nfor _ in range(int(input())):\n a, b = input().split()\n lines += [[a, int(b)]]\n\nscores = collections.defaultdict(int)\nfor name, score in lines:\n scores[name] += score\n\nwinners = set()\nmax_score = -1e10\nfor name in scores:\n if scores[name] > max_score:\n winners = set([name])\n max_score = scores[name]\n elif scores[name] == max_score:\n winners.add(name)\n\nif len(winners) == 1:\n print(winners.pop())\nelse:\n scores = collections.defaultdict(int)\n for name, score in lines:\n if name in winners:\n scores[name] += score\n if scores[name] >= max_score:\n print(name)\n break\n", "a,b={},[]\r\nfor _ in ' '*int(input()):\r\n n,s=input().split();\r\n a[n]=a.get(n,0)+int(s);\r\n b+=[(a[n],n)]\r\n\r\nm=max(a.values())\r\nprint([x for v,x in b if a[x]==m and v>=m][0])\r\n", "n = int(input())\r\ndict = {}\r\np = 0\r\ntotal_scr = []\r\nname, score = [], []\r\nif 1 <= n <= 1000:\r\n for x in range(n):\r\n nm, sr = input().split()\r\n if 1 <= len(nm) <= 32 and -1000 <= int(sr) <= 1000:\r\n name.append(nm)\r\n score.append(int(sr))\r\n dict[name[x]] = [0, [0]]\r\n p += 1\r\n else:\r\n break\r\n\r\nif p == n:\r\n winner = \"\"\r\n for x in range(n):\r\n for k in dict.keys():\r\n if name[x] == k:\r\n dict[k][1].append(dict[k][1][-1] + score[x])\r\n dict[k][0] = dict[k][1][-1]\r\n else:\r\n dict[k][1].append(dict[k][1][-1])\r\n\r\n for k in dict.keys():\r\n total_scr.append(dict[k][0])\r\n sc_max = max(total_scr)\r\n\r\n for x in range(n + 1):\r\n if len(winner) > 0: break\r\n for k in dict.keys():\r\n if dict[k][0] == sc_max and dict[k][1][x] >= sc_max:\r\n winner = k\r\n break\r\n\r\n print(winner)\r\n", "\r\ndef debug():\r\n print(\"Name=\",Name)\r\n print(\"Score\",Score)\r\n print(\"Super\",super)\r\n #print(\"lists\",lists)\r\n #print(\"Max\",Max)\r\n #print(\"Lead\",Lead)\r\n\r\nn=int(input())\r\nName=[]\r\nScore=[]\r\nlists=[]\r\nsuper=[]\r\n\r\nfor i in range(n):\r\n a=input().split()\r\n \r\n a[1]=int(a[1])\r\n #print(\" debug\", a[0] in Name)\r\n BCD= a[0] in Name\r\n if BCD == True:\r\n #print(\"hi\")\r\n for j in range(len(Name)):\r\n if Name[j]== a[0]:\r\n Score[j]=Score[j]+a[1]\r\n else:\r\n Name.append(a[0])\r\n Score.append(a[1])\r\n \r\n super.append(Score.copy())\r\n #debug()\r\nfor i in range(len(super)):\r\n for j in range(len(Score)-len(super[i])):\r\n super[i].append(0)\r\n\r\nwinners=[]\r\nmax = max(Score)\r\nfor i in range(len(Score)):\r\n if Score[i]== max:\r\n winners.append(i)\r\nstatus=''\r\nchecker=0\r\n#print(winners,super[checker][i],max )\r\nwhile status != \"Done\":\r\n for i in winners:\r\n #print(winners,super[checker][i],max )\r\n if super[checker][i]>= max:\r\n winner=i\r\n status = \"Done\"\r\n checker+=1\r\n\r\n\r\n\r\nprint(Name[winner])\r\n#print(winners,winner)\r\n#debug()", "n = int(input())\nd = {}\nl = []\nfor i in range(n):\n na, s = input().split()\n d[na]=d.get(na,0)+int(s)\n l.append([na,d[na]])\nm=max(d.values())\nfor i,j in l:\n if d[i]==m and j>=m:\n print(i)\n break\n\t\t\t \t\t \t \t\t\t\t\t\t \t\t \t \t \t", "a, d = [], {}\r\nfor _ in range(int(input())):\r\n name, score = input().split()\r\n d[name] = d.get(name, 0) + int(score)\r\n a.append((name, d[name]))\r\nm = int(max(d.values()))\r\nfor i,j in a:\r\n if j>=m and d[i] == m:\r\n print(i)\r\n break", "lens = int(input())\r\nscores = {}\r\nboard = []\r\nfor i in range(lens):\r\n a, b = input().split()\r\n scores[a] = scores.get(a, 0) + int(b)\r\n board.append((a, scores[a]))\r\nmaxs = max(scores.values()) \r\nfor i, j in board:\r\n if scores[i] == maxs and int(j) >= maxs:\r\n print(i)\r\n break\r\n", "from collections import defaultdict\r\n\r\nn = int(input())\r\ntotal_scores = defaultdict(int)\r\nnames, scores = [], []\r\nfor i in range(n):\r\n name, score = input().split()\r\n score = int(score)\r\n names.append(name)\r\n scores.append(score)\r\n total_scores[name] += score\r\n\r\nmax_score = max(total_scores.values())\r\nrunning_scores = defaultdict(int)\r\nfor name, score in zip(names, scores):\r\n running_scores[name] += score\r\n if total_scores[name] == max_score and running_scores[name] >= max_score:\r\n print(name)\r\n break\r\n", "d={}\r\nm=0\r\nlst=[]\r\nfor i in range(int(input())):\r\n a,b = input().split(maxsplit=1)\r\n d[a] = d.get(a, 0) + int(b)\r\n lst.append([d[a],a])\r\n \r\nm=max(d.values()) \r\nfor i,j in lst:\r\n if i>=m and d[j]==m:\r\n print(j)\r\n break", "scores = {}\nscore_hist = {}\n\nn = int(input())\nfor i in range(n):\n p, s = input().split()\n s = int(s)\n \n scores.setdefault(p, 0)\n scores[p] += s\n \n score_hist.setdefault(p, [(0, 0)])\n score_hist[p].append((i, scores[p]))\n\ntop_score = max(scores.values())\ntop = [k for k, v in scores.items() if v == top_score]\n\ndef when(p):\n return next(x[0] for x in score_hist[p] if x[1] >= top_score)\n\nprint(min((when(x), x) for x in top)[1])\n", "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Apr 15 22:14:36 2019\r\n\r\n@author: ktaranov\r\n\"\"\"\r\n\r\n\r\n\r\nn = int(input(\"\"))\r\n\r\ntable = {}\r\n\r\ntable_story = {}\r\nmaxval = 0\r\nfor i in range(0,n):\r\n name, val = input().split(\" \")\r\n if name in table:\r\n table[name] += int(val)\r\n table_story[name].append( (int(val), i ) )\r\n else:\r\n table[name] = int(val)\r\n table_story[name] = [(int(val), i )] \r\n if(table[name]>maxval):\r\n maxval = table[name]\r\n \r\n\r\n \r\nmaxval = 0\r\nfor name, val in table.items():\r\n if(val>maxval):\r\n maxval=val\r\n \r\nwinners = []\r\nfor name, val in table.items():\r\n if(table[name]==maxval):\r\n winners.append(name)\r\n \r\n \r\nwinners_id = [n]*len(winners)\r\nfor counter, name in enumerate(winners):\r\n val = 0\r\n for event in table_story[name]:\r\n val+=event[0]\r\n if(val >= maxval):\r\n winners_id[counter] = event[1]\r\n break\r\nminind = n\r\nwinner = 0\r\nfor counter, ind in enumerate(winners_id):\r\n if(ind < minind):\r\n minind = ind;\r\n winner = counter\r\n\r\n\r\nprint(winners[winner])\r\n \r\n\r\n \r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\na, b = {}, []\r\nfor _ in ' ' * int(input()):\r\n n, s = input().split()\r\n a[n] = a.get(n, 0) + int(s)\r\n b += [(a[n], n)]\r\nm = max(a.values())\r\nfor v, k in b:\r\n if a[k] == m and v >= m:\r\n print(k)\r\n break\r\n", "n=int(input())\r\nl=[list(input().split()) for _ in range(n)]\r\nd={}\r\nfor i,x in l:\r\n d[i]=d.get(i,0)+int(x)\r\nm=max(d.values())\r\ns=[]\r\nfor x in d:\r\n if d[x]==m: s+=[x]\r\nd={}\r\nfor i,x in l:\r\n if i in s:\r\n d[i]=d.get(i,0)+int(x)\r\n if d[i]>=m: print(i); break", "from collections import defaultdict\r\nfrom math import inf\r\nR = lambda: map(int, input().split())\r\nL = lambda: list(R())\r\n\r\nplayer = defaultdict(int)\r\nn,=R()\r\nind = 0\r\nrounds=[]\r\nfor i in range(n) :\r\n\tname,score = input().split()\r\n\tscore = int(score)\r\n\tplayer[name]+=score\r\n\trounds.append([name,player[name]])\r\nmaxx = max([i for i in player.values()])\r\nfor i in rounds :\r\n\tif (i[1]>= maxx) and (player[i[0]] == maxx):\r\n\t\tprint(i[0])\r\n\t\tbreak\r\n", "a = []\r\nb = {}\r\nn = int(input())\r\nfor i in range(n):\r\n x, y = input().split()\r\n y = int(y)\r\n b[x] = b.get(x, 0) + y\r\n a.append([x, b[x]])\r\n\r\nm = max(b.values())\r\nfor i, j in a:\r\n if j >= m and b[i] == m:\r\n print(i)\r\n break", "from collections import defaultdict\r\n\r\nn = int(input())\r\nnames = []\r\nscores = []\r\nstages = []\r\n\r\nfor _ in range(n):\r\n name, score = input().split()\r\n score = int(score)\r\n stages.append([name, score])\r\n\r\n if name in names:\r\n scores[names.index(name)] += score\r\n else:\r\n names.append(name)\r\n scores.append(score)\r\n\r\nMaxScore = max(scores)\r\ntied = []\r\n\r\nfor i, val in enumerate(scores):\r\n if val == MaxScore:\r\n tied.append(names[i])\r\n\r\nl = len(tied) - 1\r\n\r\nif l == 0:\r\n print(*tied)\r\nelse:\r\n dic = defaultdict(lambda: 0)\r\n\r\n for i in range(n):\r\n if stages[i][0] in tied:\r\n dic[stages[i][0]] += stages[i][1]\r\n\r\n if dic[stages[i][0]] >= MaxScore:\r\n print(stages[i][0])\r\n exit(0)\r\n", "dict = {}\na = []\nfor _ in range(int(input())):\n n,s = map(str,input().split())\n sc = int(s)\n dict[n] = dict.get(n,0) + sc\n a.append([n,dict[n]])\n maxx = max(dict.values())\nfor i,j in a:\n if j >= maxx and dict[i] >= maxx:\n print(i)\n break\n \t\t \t \t\t\t \t \t\t\t \t\t \t \t\t \t\t", "def solve():\r\n n = int(input())\r\n res = {}\r\n m = -10e9\r\n stand = []\r\n for i in range(n):\r\n name,scor = input().split()\r\n scor = int(scor)\r\n if name not in res:\r\n res[name] = scor\r\n else:\r\n res[name]+=scor\r\n stand.append([name,res[name]])\r\n for i in res:\r\n if res[i] > m :\r\n m = res[i]\r\n for i,j in stand:\r\n if res[i] == m and j >= m:\r\n print(i)\r\n break \r\n \r\n#for i in range(int(input())):\r\nsolve()", "n = int(input())\r\nj = input().split()\r\nplayers = {j[0]:int(j[1])}\r\nrecords = [[j[0],int(j[1])]]\r\n\r\nfor i in range(1,n):\r\n t = input().split()\r\n if t[0] in players:\r\n players[t[0]] += int(t[1])\r\n else:\r\n players[t[0]]=int(t[1])\r\n records.append([t[0],players[t[0]]])\r\nm = max(players.values())\r\nl = []\r\nfor i in players.items():\r\n if i[1]==m:\r\n l.append(i[0])\r\nfor i in records:\r\n if i[1]>=m and i[0] in l:\r\n print(i[0])\r\n break", "import sys\n\n# First find maximum score\nscores = dict()\nnames = []\npoints = []\nlines = int(sys.stdin.readline())\nfor i in range(0,lines):\n line = sys.stdin.readline().split()\n name = line[0]\n pts = int(line[1])\n names.append(name)\n points.append(pts)\n if scores.get(name):\n scores[name] += pts\n else:\n scores[name] = pts\nmax_score = max(scores.values())\n\n# Then see who reached the maximum score first\nscores_2 = dict()\nfor i in range(0,lines):\n if scores_2.get(names[i]):\n scores_2[names[i]] += points[i]\n else:\n scores_2[names[i]] = points[i]\n if scores_2[names[i]] >= max_score and scores[names[i]] == max_score:\n print(names[i])\n break\n", "n = int(input())\r\nplayers = {}\r\nscores = {}\r\nfor i in range(n):\r\n name, score = input().split()\r\n score = int(score)\r\n if name not in players:\r\n players[name] = 0\r\n players[name] += score\r\n if players[name] not in scores:\r\n scores[players[name]] = (i, name)\r\n\r\norder = sorted(players.keys(), key=lambda k: -players[k])\r\nmax_score = players[order[0]]\r\n\r\nwinners = [name for name in order if players[name] == max_score]\r\nif len(winners) == 1:\r\n print(winners[0])\r\nelse:\r\n values = []\r\n for score in scores:\r\n if score >= max_score and scores[score][1] in winners:\r\n values.append(scores[score])\r\n values.sort()\r\n print(values[0][1])", "n = int(input()) #number of rounds\r\nplayers = {}\r\nscore = []\r\n\r\nfor i in range(n):\r\n p,s = input().split() #input players and their score\r\n players[p] = players.get(p,0)+int(s)\r\n score.append([p,players[p]])\r\n\r\n\r\nmaxPS = max(players.values()) #max score\r\nfor i,j in score:\r\n if players[i] == maxPS and j >= maxPS:\r\n print(i) #first who has got max score\r\n break", "from collections import Counter\r\n\r\nn = int(input())\r\narr = [input() for i in range(n)]\r\na = Counter()\r\nb = []\r\nfor i in range(n):\r\n nm, s = arr[i].split()\r\n a[nm] += int(s)\r\n b.append((nm, a[nm]))\r\nmx = max(a.values())\r\nprint([nm for (nm, s) in b if s >= mx and a[nm] == mx][0])", "n = int(input())\r\ncurrentScores = dict()\r\ncomms = []\r\nma = 0\r\n\r\nfor i in range(n):\r\n comms.append(input().split())\r\n comms[i][1] = int(comms[i][1])\r\n if comms[i][0] not in currentScores:\r\n currentScores[comms[i][0]] = 0\r\n currentScores[comms[i][0]] += comms[i][1]\r\n\r\nma = 0\r\n\r\nfor k in currentScores:\r\n ma = max(ma, currentScores[k])\r\n\r\npotens = dict()\r\n\r\nfor k in currentScores:\r\n if currentScores[k] == ma:\r\n potens[k] = 0\r\n\r\nfor name, score in comms:\r\n #print(name, score, potens)\r\n if name not in potens:\r\n continue\r\n potens[name] += score\r\n if potens[name] >= ma:\r\n print(name)\r\n break\r\n\r\n#print(currentScores)\r\n#print(potens)\r\n", "from __future__ import print_function\nimport sys\nfrom collections import *\nfrom heapq import *\nfrom functools import *\nINF=float(\"inf\")\nNINF=float(\"-inf\")\n\ntry:\n input=raw_input\nexcept:\n pass\n\ndef read_string():\n return input()\n\ndef read_string_line():\n return [x for x in input().split(\" \")]\n\ndef read_int_line():\n return [int(x) for x in input().split(\" \")]\n\ndef read_int():\n return int(input())\n\nclass TreeNode(object):\n def __init__(self, x):\n self.val = x\n self.left = None\n self.right = None\n def __str__(self):\n q=deque()\n ans=[]\n q.append(self)\n ans.append(self.val)\n while q:\n cur=q.popleft()\n ans.append(cur.left.val if cur.left else \"null\")\n ans.append(cur.right.val if cur.right else \"null\")\n if cur.left:\n q.append(cur.left)\n if cur.right:\n q.append(cur.right)\n while ans and ans[-1] == \"null\":\n ans.pop()\n return str(ans).replace(\"'null'\", 'null')\n\ndef toTreeNode(s):\n l = eval(s.replace(\"null\", \"None\"))\n n=len(l)\n if not n:\n return None\n root=TreeNode(l[0])\n q=deque()\n q.append(root)\n i=1\n while q and i < n:\n cur=q.popleft()\n if l[i] != None:\n cur.left = TreeNode(l[i])\n q.append(cur.left)\n i+=1\n if i>=n:\n break\n if l[i] != None:\n cur.right=TreeNode(l[i])\n q.append(cur.right)\n i+=1\n return root\n\nclass Djs:\n def __init__(self, n):\n self.w=[1]*n\n self.p=[-1]*n\n def find(self, x):\n p=self.p[x]\n if p==-1:\n return x\n else:\n self.p[x]=self.find(p)\n return self.p[x]\n def union(self, x, y):\n x,y=self.find(x),self.find(y)\n if x==y:\n return\n if self.w[x]>self.w[y]:\n x,y=y,x\n self.p[x]=y\n self.w[y]+=self.w[x]\n def roots(self):\n return [x for x, y in enumerate(self.p) if y==-1]\n\ndef mat3d(x, y, z, fill=0):\n return [[[fill]*z for _ in range(y)] for _ in range(x)]\n\ndef mat2d(h, w, fill=0):\n return [[fill]*w for _ in range(h)] \n\ndef matmul(m1, m2,P=0):\n h1,w1=len(m1),len(m1[0])\n h2,w2=len(m2),len(m2[0])\n assert w1==h2\n ans=mat2d(h1,w2)\n\n if P:\n for i in range(h1):\n for j in range(w2):\n for k in range(w1):\n ans[i][j]=(ans[i][j]+m1[i][k]*m2[k][j])%P\n else:\n for i in range(h1):\n for j in range(w2):\n for k in range(w1):\n ans[i][j]=ans[i][j]+m1[i][k]*m2[k][j]\n return ans\n\ndef mati(n):\n ans=mat2d(n,n)\n for i in range(n):\n ans[i][i]=1\n return ans\n\ndef matpow(m, p, P):\n # assert square matrix\n h,w=len(m),len(m[0])\n assert h==w\n ans=mati(h)\n base=m\n while p:\n if p%2==1:\n ans=matmul(ans, base,P)\n base=matmul(base, base,P)\n p//=2\n return ans\n\ndef doit():\n n=read_int()\n arr=[]\n d=defaultdict(int)\n for i in range(n):\n k, v = read_string_line()\n v=int(v)\n d[k]+=v\n arr.append([k, v])\n maxv=max(d.values())\n keys=[k for k in d if d[k]==maxv]\n if len(keys)==1:\n print(\"%s\"%keys[0])\n else:\n keys=set(keys)\n d=defaultdict(int)\n for k, v in arr:\n if k not in keys: continue\n d[k]+=v\n if d[k]>=maxv:\n print(\"%s\"%k)\n return\n\n\n\n\n\n\n\nif __name__ == \"__main__\":\n try:\n while True:\n doit()\n except EOFError:\n pass\n", "dict = {}\narr = []\nfor _ in range(int(input())):\n name,sc = map(str,input().split())\n score = int(sc)\n dict[name] = dict.get(name,0) + score\n arr.append([name,dict[name]])\n maxx = max(dict.values())\nfor a,b in arr:\n if b >= maxx and dict[a] >= maxx:\n print(a)\n break\n \t \t\t \t\t\t \t \t \t \t\t\t \t\t\t", "scores = {}\nqueries = []\nfor q in range(int(input())):\n\tname, points = input().split()\n\tqueries.append([name, int(points)])\n\tif name not in scores:\n\t\tscores[name] = int(points)\n\telse:\n\t\tscores[name] += int(points)\nmaxVal = 0\nfor name in scores:\n\tmaxVal = max(maxVal, scores[name])\nnewScores = {}\nwinners = []\nfor name in scores:\n\tif(scores[name] == maxVal):\n\t\twinners.append(name)\nfor name,points in queries:\n\tif name not in newScores:\n\t\tnewScores[name] = int(points)\n\telse:\n\t\tnewScores[name] += int(points)\n\tif(newScores[name] >= maxVal and name in winners):\n\t\tbreak\nprint(name)", "t=int(input())\nd={}\nmaxx=-1000\nl=[]\nfor i in range(t):\n name,point=input().split()\n \n point=int(point)\n \n if name in d.keys():\n d[name]+=point\n else:\n d[name]=point\n l.append([name,d[name]])\nmaxx=max(d.values())\nfor n,p in l:\n if p>=maxx and d[n]==maxx:\n print(n)\n break\n \n \t\t \t\t \t\t \t \t\t\t\t \t \t \t\t \t", "dic = {}\nlae = []\nma = \"\"\nn = int(input())\nna,po = (input().strip()).split()\nma = na\n# dic.update({na : int(po)})\ndic[na] = int(po)\nfor _ in range(n-1):\n na,po = (input().strip()).split()\n dic[na] = dic.get(na,0) + int(po)\n lae.append([na,dic[na]])\n # if (dic[na] > dic[ma]): ma = na\nmax_ele = max(dic.values())\nfor i,j in lae:\n if (dic[i]==max_ele and int(j)>=max_ele):\n print(i)\n break", "n = int(input())\n\nnames = []\nscores = []\nscoreDic = {}\nfor i in range(n):\n name, score = input().split()\n names.append(name), scores.append(score)\n\n if name in scoreDic:\n scoreDic[name] += int(score)\n else:\n scoreDic[name] = int(score)\n\nkeys = list(scoreDic.keys())\nvals = list(scoreDic.values())\nm = max(vals)\n\nmaxNames = []\nfor i in keys:\n if scoreDic[i] == m:\n maxNames.append(i)\n\nif len(maxNames) == 1:\n print(maxNames[0])\n\nelse:\n scoreDic = {}\n for i in range(n):\n name, score = names[i], scores[i]\n if name in scoreDic:\n scoreDic[name] += int(score)\n else:\n scoreDic[name] = int(score)\n\n if scoreDic[name] >= m and name in maxNames:\n print(name)\n break\n\n", "n = int(input())\n\nnames = []\nscores = []\nhistory = []\n\nfor i in range(n):\n\tq = input().split()\n\t\n\tname = q[0]\n\tscore = int(q[1])\n\t\n\tif name in names:\n\t\tiname = names.index(name) \n\t\tscores[iname] += score\n\t\n\telse:\n\t\tnames.append(name)\n\t\tscores.append(score)\n\n\tiname = names.index(name)\n\tscore = scores[iname]\n\thistory.append([name, score])\n\t\nmscore = max(scores)\n\ncname = scores.count(mscore)\nif cname == 1:\n\tiname = scores.index(mscore)\n\tprint(names[iname])\n\nelse:\n\tnameswin = []\n\tfor i in range(len(scores)):\n\t\tif scores[i] == mscore:\n\t\t\tnameswin += [names[i]]\n\n\tfor h in history:\n\t\tif h[0] in nameswin:\n\t\t\tif h[1] >= mscore:\n\t\t\t\tprint(h[0])\n\t\t\t\tbreak", "from collections import defaultdict\r\n\r\n__author__ = \"runekri3\"\r\n\r\nscores = defaultdict(lambda: 0)\r\nenumerated_name_score_list = []\r\nn = int(input())\r\nfor i in range(n):\r\n name, score_add = input().split()\r\n enumerated_name_score_list.append((i, name, score_add))\r\nfor i, name, score_add in enumerated_name_score_list:\r\n score_add = int(score_add)\r\n new_score = scores[name] + score_add\r\n scores[name] = new_score\r\n\r\nmax_score = max(scores.values())\r\nmax_scorers = [name for name, score in scores.items() if score == max_score]\r\nscores = defaultdict(lambda: 0)\r\nfor i, name, score_add in enumerated_name_score_list:\r\n score_add = int(score_add)\r\n new_score = scores[name] + score_add\r\n if new_score >= max_score:\r\n if name in max_scorers:\r\n print(name)\r\n break\r\n scores[name] = new_score\r\n", "n=int(input())\r\na=[0]*3\r\nb=[0]*3\r\nc=[0]*3\r\nk={}\r\nd=[]\r\nfor i in range(n):\r\n a,b=map(str,input().split())\r\n k[a]=k.get(a,0)+int(b);d.append([a,k[a]])\r\nm=max(k.values())\r\nfor i,j in d:\r\n if k[i]==m and int(j)>=m:\r\n print(i); break", "import sys\r\nimport math\r\nfrom sys import stdin,stdout\r\nimport itertools\r\nimport copy\r\nfrom collections import*\r\nfrom math import gcd,ceil,floor\r\nmod = int(1e9+7)\r\n##input=sys.stdin.readline\r\n##sys.stdout=open(\"Updated prg/Output3.txt\",\"w\")\r\n##sys.stdin=open(\"Updated prg/Input3.txt\",\"r\")\r\nd1=defaultdict()\r\nd2=defaultdict()\r\nl1=[]\r\nl2=[]\r\nn=int(input())\r\nfor _ in range(n):\r\n a,b=map(str,input().split())\r\n l1.append(a)\r\n l2.append(int(b))\r\nd1=dict.fromkeys(l1,0)\r\nfor i in range(n):\r\n d1[l1[i]]=d1[l1[i]]+l2[i]\r\nm1=max(d1.values())\r\nd2=dict.fromkeys(l1,0)\r\nfor i in range(n):\r\n d2[l1[i]]=d2[l1[i]]+l2[i]\r\n if d2[l1[i]]>=m1 and d1[l1[i]]==m1:\r\n print(l1[i])\r\n break", "currentScore = {}\r\nmatchList = []\r\n\r\nn = int(input())\r\nfor _ in range(n):\r\n name, score = input().split()\r\n matchList.append((name, int(score)))\r\n if not name in currentScore:\r\n currentScore[name] = 0\r\n currentScore[name] += int(score)\r\n\r\ncurrentScore = dict(\r\n sorted(currentScore.items(), key=lambda x: x[1], reverse=True))\r\nans = list(currentScore.items())\r\nans.reverse()\r\nM = ans[-1][1]\r\nnameList = []\r\nwhile len(ans) and ans[-1][1] == M:\r\n nameList.append(ans[-1][0])\r\n ans.pop()\r\n\r\ncurrentScore = {}\r\nfor i in range(n):\r\n name, score = matchList[i]\r\n if not name in currentScore:\r\n currentScore[name] = 0\r\n currentScore[name] += score\r\n if name in nameList and currentScore[name] >= M:\r\n print(name)\r\n exit()\r\n", "from collections import defaultdict\nn=int(input())\na=defaultdict(int)\ninp=[]\nwhile n>0:\n\tb,c=map(str,input().split())\n\tinp.append([b,int(c)])\n\tif b in a:\n\t\ta[b]+=int(c)\n\telse:\n\t\ta[b]=int(c)\n\tn-=1\na=list(sorted(a.items(),key=lambda x:x[1],reverse=True))\ns=a[0][1]\nganadores=[]\nfor item in a:\n\tif item[1]==s:\n\t\tganadores.append(item)\n\telse:\n\t\tbreak\ntiempo=[[ganadores[i][0],0] for i in range(len(ganadores))]\nd=defaultdict(int)\nfor item in tiempo:\n\td[item[0]]=0\nfor item in inp:\n\tif item[0] in d:\n\t\td[item[0]]+=item[1]\n\t\tif d[item[0]]>=s:\n\t\t\tprint(item[0])\n\t\t\tbreak\n", "from collections import defaultdict\ndef main():\n n = int(input())\n d = defaultdict(int)\n namescore = [input().split() for _ in range(n)]\n for name, point in namescore:\n d[name] += int(point)\n d = sorted(d.items(), key = lambda x:x[1], reverse = True)\n m = d[0][1]\n if d[1][1] == m:\n d = defaultdict(lambda :{'point': 0, 'round': 1000000})\n for i, (name, point) in enumerate(namescore):\n d[name]['point'] += int(point)\n if d[name]['point'] >= m:\n d[name]['round'] = min(d[name]['round'], i)\n d = sorted(d.items(), key = lambda x:x[1]['round'])\n d.sort(key = lambda x: x[1]['point'], reverse = True)\n print(d[0][0])\n else:\n print(d[0][0])\n\nif __name__ == '__main__':\n main()\n", "# Source: https://usaco.guide/general/io\r\n\r\nnum = int(input())\r\nhashmap = {}\r\nmoves = []\r\nhigh = -10000000\r\nans = {}\r\n\r\nfor i in range(num):\r\n name,score = map(str,input().split())\r\n score = int(score)\r\n try:\r\n hashmap[name]+= score;\r\n except:\r\n hashmap[name] = score;\r\n moves.append([name,score])\r\n\r\n\r\n#print(moves)\r\n\r\nfor i in hashmap:\r\n high = max(high,hashmap[i])\r\n\r\n\r\nfor i in hashmap:\r\n if hashmap[i] == high:\r\n ans[i] = 0\r\n\r\nfor i in moves:\r\n try:\r\n ans[i[0]] += i[1]\r\n if ans[i[0]] >= high:\r\n thistookwaytoolong = i[0]\r\n break\r\n except:\r\n pass\r\n\r\nprint(thistookwaytoolong)\r\n\r\n", "d = {}\r\nb = []\r\nfor _ in range(int(input())):\r\n name,score = input().split()\r\n if name not in d: d[name] = 0\r\n d[name] += int(score)\r\n b.append((name,d[name]))\r\nm = max(d.values())\r\nfor name, score in b:\r\n if d[name]==m and score>=m:\r\n print(name)\r\n break", "# fall 7, Stand 8...\r\nn=int(input()); a=[]; dic={}; dic1={}\r\nfor _ in range(n):\r\n name,score=map(str,input().split())\r\n score=int(score)\r\n a.append([name,score])\r\n dic[name]=0\r\n dic1[name]=0;\r\nans=0;\r\nfor _ in range(len(a)):\r\n dic[a[_][0]]+=a[_][1];\r\nfor _ in dic.keys():\r\n if ans<dic[_]:\r\n ans=dic[_]\r\nb=[];\r\nfor _ in dic.keys():\r\n if dic[_]==ans:\r\n b.append(_)\r\nif len(b)==1:\r\n print(b[0])\r\nelse:\r\n for _ in range(len(a)):\r\n dic1[a[_][0]]+=a[_][1]\r\n if a[_][0] in b and dic1[a[_][0]]>=ans:\r\n print(a[_][0]);\r\n break;", "import pdb\r\np, r, n = [], {}, int(input())\r\nfor i in range(n):\r\n a, b = input().split()\r\n b = int(b)\r\n r[a] = r.get(a, 0)+b\r\n p.append([r[a], a])\r\n m = max(r.values())\r\n# pdb.set_trace()\r\nfor n, a in p:\r\n if n >= m and r[a] >= m:\r\n print(a)\r\n break", "n=int(input())\nf1={}\nf2={}\nx=[]\ny=[]\nfor _ in range(n):\n na,sc=input().split()\n sc=int(sc)\n x.append(na)\n y.append(sc)\n if na in f1:\n f1[na]+=sc\n else:\n f1[na]=sc\nm=max(f1.values())\nresult=''\nfor i in range(n):\n if x[i] in f2:\n f2[x[i]]+=y[i]\n else:\n f2[x[i]]=y[i]\n if(f1[x[i]]==m and f2[x[i]]>=m):\n result=x[i]\n break\nprint(result)\n \n\t\t\t\t\t \t \t\t\t \t\t \t \t \t \t \t", "from sys import stdin, stdout\r\n\r\nN = int(stdin.readline())\r\nrounds = [stdin.readline().strip('\\n') for i in range(N)]\r\nrounds = [(p,int(s)) for p,s in [r.split() for r in rounds]]\r\nplayers = list(set([r[0] for r in rounds]))\r\ncumscore = {p:[0] for p in players}\r\nfor p,s in rounds:\r\n\tfor player in players:\r\n\t\tcumscore[player].append(cumscore[player][-1])\r\n\tcumscore[p][-1] += s\r\nwinscore = max([s[-1] for s in cumscore.values()])\r\nwinners = {p:s for p,s in cumscore.items() if s[-1]==winscore}\r\nplayers = list(winners.keys())\r\n\r\nwindex = [[q>=winscore for q in s].index(True) for s in winners.values()]\r\nwinner = players[windex.index(min(windex))]\r\n\r\nstdout.write(winner)", "d, q = {}, []\nfor i in range(int(input() ) ):\n s, x = input().split()\n d[s] = d.get(s, 0) + int(x)\n q.append((s, d[s] ) )\n\nmx = max(d.values() )\nfor s, x in q:\n if d[s] == mx and x >= mx:\n print(s)\n break\n", "n = int(input())\r\nscore = {}\r\ngame = []\r\nfor i in range(n):\r\n\tnew = input().split()\r\n\tnew[1] = int(new[1])\r\n\tgame.append(new)\r\n\tif new[0] not in score.keys():\r\n\t\tscore[new[0]] = new[1]\r\n\telse:\r\n\t\tscore[new[0]] += new[1]\r\nwinners = []\r\nmaxn = -1001\r\nfor item in score.items():\r\n\tif maxn < item[1]:\r\n\t\tmaxn = item[1]\r\n\t\twinners = [item[0]]\r\n\telif maxn == item[1]:\r\n\t\twinners.append(item[0])\r\n\t\tscore = {}\r\nfor i in range(n):\r\n\tnew = game[i]\r\n\tif new[0] not in score.keys():\r\n\t\tscore[new[0]] = new[1]\r\n\t\tif new[0] in winners and score[new[0]] >= maxn:\r\n\t\t\tprint(new[0])\r\n\t\t\tbreak\r\n\telse:\r\n\t\tscore[new[0]] += new[1]\r\n\t\tif new[0] in winners and score[new[0]] >= maxn:\r\n\t\t\tprint(new[0])\r\n\t\t\tbreak\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Jun 14 18:17:58 2020\r\n\r\n@author: yogendra jaiswal\r\n\"\"\"\r\n\r\n\r\nn = int(input())\r\n\r\nsb = []\r\nscores = {}\r\n\r\nfor i in range(n):\r\n \r\n name, score = input().split()\r\n sb.append([name, int(score)])\r\n if name in scores:\r\n scores[name] += int(score)\r\n \r\n else:\r\n scores[name] = int(score)\r\n\r\nmax_score = -2000\r\nmax_scorers = []\r\n\r\nfor name, score in scores.items():\r\n \r\n if score > max_score:\r\n max_scorers = [name]\r\n max_score = score\r\n \r\n elif score == max_score:\r\n max_scorers.append(name)\r\n\r\nscores2 = {}\r\nmax_scorers = set(max_scorers)\r\n\r\nfor name, score in sb:\r\n if name not in max_scorers:\r\n continue\r\n if name in scores2:\r\n scores2[name] += score\r\n \r\n else:\r\n scores2[name] = score\r\n \r\n if scores2[name] >= max_score:\r\n print(name)\r\n break\r\n \r\n ", "n=int(input())\r\nres=[]\r\ns=[]\r\nnam=[]\r\nfor i in range(n):\r\n nm,sc=list(input().split())\r\n res.append([sc,nm,i])\r\n s.append(sc)\r\n nam.append(nm)\r\nnl=list(set(nam))\r\nmks=[]\r\nonly=[]\r\neach=[]\r\ngood=[]\r\nji=[]\r\nfor i in nl:\r\n cou=0\r\n for j in range(n):\r\n if i==nam[j]:\r\n cou+=int(s[j])\r\n only.append(cou)\r\nmaxs=max(only)\r\nfor i in nl:\r\n cou=0\r\n li=0\r\n rec=[]\r\n temp=0\r\n flag=[]\r\n for j in range(n):\r\n if i==nam[j]:\r\n cou+=int(s[j])\r\n li=j\r\n rec.append([cou,j])\r\n if temp<1:\r\n if cou>=maxs:\r\n temp+=1\r\n flag=[j,i]\r\n if cou==maxs:\r\n ji.append(flag)\r\n mks.append([cou,i])\r\n each.append(rec)\r\n good.append([cou,rec])\r\nmks.sort(reverse=True)\r\nonly.sort(reverse=True)\r\ncou=only.count(maxs)\r\ngood.sort()\r\nji.sort()\r\nprint(ji[0][1])\r\n", "point_dict = {}\r\npoint_log = []\r\n\r\nfor _ in range(int(input())):\r\n name, score = input().split()\r\n score = int(score)\r\n point_dict[name] = point_dict.get(name,0) + score\r\n point_log.append((name, point_dict[name]))\r\n \r\nmalue = int(max(point_dict.values()))\r\n\r\nfor i , j in point_log:\r\n if j >= malue and point_dict[i] == malue:\r\n print(i)\r\n break", "def main():\r\n r={}\r\n h=[]\r\n for _ in range(int(input())):\r\n n,s = input().split()\r\n s = int(s)\r\n \r\n if n in r.keys():\r\n r[n]+=s\r\n else:\r\n r[n]=s\r\n \r\n h.append([n,r[n]])\r\n \r\n m = max(r.values())\r\n \r\n for x,y in h:\r\n if r[x] == m and y >= m:\r\n print(x)\r\n break\r\n \r\nif __name__ == \"__main__\":\r\n main()\r\n ", "n=int(input())\r\nd={}\r\nl=[]\r\nm=-1001\r\nfor i in range(n):\r\n name,points=[i for i in input().split(\" \")]\r\n points=int(points)\r\n if name not in d: \r\n d[name]=0\r\n l.append([name,points+d[name]])\r\n d[name]+=points\r\nlis = d.values()\r\nlis = max(lis)\r\nfor i in l:\r\n if i[1]>=lis and d[i[0]]>=lis:\r\n print(i[0])\r\n break", "# A. Winner\n\nn = int(input())\nscores = dict()\nchrono = list()\n\nfor _ in range(n):\n inp = input().split()\n name = inp[0]\n score = int(inp[1])\n try:\n scores[name] += score\n except KeyError:\n scores[name] = score\n chrono.append([scores[name], name])\n\nmx = max(scores.values())\ncandidate_winners = [name for name, score in scores.items() if score == mx]\n\nans = \"\"\nfor x in chrono:\n if x[1] in candidate_winners and x[0] >= mx:\n ans = x[1]\n break\n\nprint(ans)\n", "n,c,m=eval(input()),{},[]\r\nfor i in range(n):a,b=input().split(' ');c[a]=c.get(a,0)+int(b);m.append([a,c[a]])\r\nn=max(c.values())\r\nfor i ,j in m:\r\n if c[i]==n and int(j)>=n:print(i);break", "n = int(input())\r\n#s = input().split()\r\n#best_name = s[0]\r\n#best_score = int(s[1])\r\n#d = {best_name: best_score} \r\nd = {}\r\nbest_score = 0 \r\nfor i in range(n):\r\n s = input().split()\r\n if (s[0] in d):\r\n d[s[0]].append(d[s[0]][i - 1] + int(s[1]))\r\n else:\r\n if (i > 0):\r\n d[s[0]] = [0 for j in range(i)]\r\n d[s[0]].append(int(s[1]))\r\n else:\r\n d[s[0]] = [int(s[1])]\r\n for key, value in d.items():\r\n #print(key)\r\n #print(s[0])\r\n if (key != s[0]):\r\n d[key].append(value[i - 1])\r\n if (i == n - 1):\r\n if (value[i] > best_score):\r\n best_score = value[i]\r\n\r\nlistOfKeys = list()\r\nfor key, value in d.items():\r\n if (value[n - 1] == best_score):\r\n listOfKeys.append(key)\r\n\r\nif (len(listOfKeys) == 1):\r\n print(listOfKeys[0])\r\nelse:\r\n best_name = listOfKeys[0]\r\n v_s = d[best_name]\r\n #print(v_s)\r\n first = next(x[0] for x in enumerate(v_s) if x[1] >= best_score)\r\n for name in listOfKeys:\r\n v_s = d[name]\r\n s = next(x[0] for x in enumerate(v_s) if x[1] >= best_score)\r\n if s < first:\r\n best_name = name\r\n first = s\r\n print(best_name)", "u,l,s=eval(input()),{},[]\r\nfor i in range(u):a,b=input().split(' ');l[a]=l.get(a,0)+int(b);s.append([a,l[a]])\r\nu=max(l.values())\r\nfor i ,j in s:\r\n if l[i]==u and int(j)>=u:print(i);break\r\n", "n=int(input())\r\nnames=[]\r\nscores=[]\r\nq = []\r\nfor i in range (n):\r\n name,score=input().split()\r\n score=int(score)\r\n if name in names:\r\n scores[names.index(name)]+=score\r\n else:\r\n names.append(name)\r\n scores.append(score)\r\n q.append([names.index(name), scores[names.index(name)]])\r\nm = max(scores)\r\na = []\r\nfor i in range(len(scores)):\r\n if scores[i]==m:\r\n a.append(i)\r\nfor i in range(n):\r\n if q[i][1]>=m and q[i][0] in a:\r\n win = names[q[i][0]]\r\n break\r\nprint(win)", "n = int(input())\r\ndic = {}\r\narr = []\r\nfor i in range(n):\r\n name,score = input().split()\r\n score = int(score)\r\n arr.append([name,score])\r\n if name not in dic:\r\n dic[name] = score\r\n else:\r\n dic[name] += score\r\nmaxi = max(dic.values())\r\ndicn = {}\r\nfor name,score in arr:\r\n if name not in dicn:\r\n dicn[name] = score\r\n else:\r\n dicn[name] += score\r\n if dicn[name]>=maxi and dic[name]==maxi:\r\n print(name)\r\n break\r\n", "import copy\r\n#definim clasa RoundTotals care o sa tina minte numele si punctajul castigatorului unei runde\r\nclass RoundTotals:\r\n def __init__(self, name, points):\r\n self.name = name\r\n self.points = points\r\n\r\ndef value(inputValue):\r\n try:\r\n #incearca sa transforma nr in integer, daca nu poate arunca o exceptie\r\n return int(inputValue) \r\n except ValueError:\r\n #returneaza stringul\r\n return inputValue\r\n\r\n#citim datele de la stdin\r\ndef getInput():\r\n #numarul de runde\r\n rounds = int(input())\r\n #o lista care va contine toate datele din std in sub forma de obiect ex: [{name:'mike',points:3},..]\r\n totals = []\r\n #citim atatea linii de la stdin cate rounds a avut joaca\r\n while rounds:\r\n #decrimentam rounds\r\n rounds -= 1\r\n #functia map primeste 2 agumente, primul: o functie prin care trec toate elementele; al doilea: elementele \r\n #str(input()) - transforma input-ul in string\r\n #.split() ia fiecare \"cuvant\" adica string separat de spatiu si il pune intr-o lista, unde fiecare \"cuvant\" este un element al listei\r\n name, points = map(value, str(input()).split())\r\n #adaugam in totals un element cu noul nume si points citite din input\r\n totals.append(RoundTotals(name, points))\r\n #returnam lista totals\r\n return totals\r\n\r\ntotalsResults = getInput()\r\n\r\n#daca aceasta functie este chemata cu parametrul maxPoints, ea returneaza cine primul a adunat nr maxim de puncte, daca este chemata fara parametru, \r\n#aduna punctele jucatorilor care sunt de mai multe ori in lista \r\ndef sumPlayersPoints(maxPoints=False):\r\n #facem o copie a listei totalsResults pentru ca sa nu fie atribuit ca referinta, deoarece nu dorim sa facem schimbari in lista totalsResults\r\n totals = copy.deepcopy(totalsResults)\r\n # initiem playerIndex cu care vom parcurge lista totals\r\n playerIndex = 0\r\n #parcurgem totals\r\n while playerIndex < len(totals):\r\n #initiem variabila previous players cu precedentul lui player\r\n previousPlayers = playerIndex - 1\r\n #daca functia a fost chemata cu parametru de intrare, jucatorul curent are puncte mai multe sau egale cu maximul de puncte din joc si daca \r\n #jucatorul curent, la finalul jocului are puncte egale cu nr maxim de puncte din joc\r\n if bool(maxPoints) and totals[playerIndex].points >= maxPoints.points and findPlayerPoints(totals[playerIndex].name).points == maxPoints.points:\r\n #atunci acest jucator a castigat, deoarece este primul care a a dunat nr de puncte\r\n return totals[playerIndex].name\r\n #parcurgem incepand cu jucatorul curent jucatorii precedenti, ca sa verificam daca un jucator nu este de mai multe ori in lista\r\n while previousPlayers >= 0:\r\n #daca este de mai multe ori in lista\r\n if totals[previousPlayers].name == totals[playerIndex].name:\r\n #adunam jucatorului de pe pozitia curenta punctele precedentului\r\n totals[playerIndex].points += totals[previousPlayers].points\r\n #stergem datele despre castigul precedent\r\n totals.remove(totals[previousPlayers])\r\n #o data ce am sters o valoare din lista, trebuie sa ne ducem cu un element in urma ca sa nu ramana un element ne verificat \r\n playerIndex -= 1\r\n #verificam daca dupa adunarea punctelor jucatorul curent nu a devenit castigatorul\r\n if bool(maxPoints) and totals[playerIndex].points >= maxPoints.points and findPlayerPoints(totals[playerIndex].name).points == maxPoints.points:\r\n return totals[playerIndex].name\r\n #mergem cu o pozitie mai in urma in lista din input\r\n previousPlayers -=1\r\n #ne mutam la urmatorul jucator curent din lista\r\n playerIndex += 1\r\n #verificam daca functia a fost chemata cu date de intrae, atunci returnam numele jucatorului cu cele mai multe puncte, daca nu, returnam lista cu totalurile jocului\r\n if bool(maxPoints):\r\n return maxPoints.name\r\n return totals\r\n\r\n#aceasta functie ne ajuta sa gasim cel mai mare punctaj a jocului din lista players\r\ndef findMaxPoints(players):\r\n #initilizam punctajul maxim cu punctajul primului jucator\r\n maximumPoints = players[0]\r\n #parcurgem lista\r\n for player in players:\r\n #daca punctajul maxim e mai mic decat punctajul altui jucator\r\n if maximumPoints.points < player.points:\r\n #ii atribuim lui maxim puncatjul acelui jucatro\r\n maximumPoints = player\r\n #returnam valoarea maxima a punctajului gasit in lista\r\n return maximumPoints\r\n\r\n# lista totals va tine minte rezultatele finale ale jocului\r\ntotals = sumPlayersPoints()\r\n\r\n#gasim cate punctaje are un jucator la finalul jocului, avand ca argument numele lui\r\ndef findPlayerPoints(name):\r\n #parcurgem lista finala\r\n for player in totals:\r\n #daca casim un jucatro cu numele din argument\r\n if player.name == name:\r\n #returnam toate datele despre el\r\n return player\r\n\r\n\r\ndef findWinner():\r\n #gasim puncatjul maxim din datele finale ale jocului\r\n finalMaxPoints = findMaxPoints(totals)\r\n #chemam functia sumPlayersPoints, de data aceasta cu un argument de intrare, deci asteptam sa returneze numele primului jucatro care a acumulat punctaj maxim\r\n print(sumPlayersPoints(finalMaxPoints))\r\n \r\n#chemam functia care afiseaza castigatorul\r\nfindWinner()\r\n", "#!/use/bin/python\r\n#Winner\r\nn=int(input())\r\nans={}\r\nname,score=input().split()\r\nans[name]=int(score)\r\ninp=[(name,int(score))]\r\nfor i in range(1,n):\r\n name,score=input().split()\r\n if name in ans:\r\n ans[name]+=int(score)\r\n else:\r\n ans[name]=int(score)\r\n inp.append((name,ans[name]))\r\nMAX=max(ans.values())\r\nfor i in inp:\r\n if i[1]>=MAX and ans[i[0]]==MAX:\r\n print(i[0])\r\n break\r\n", "n = int(input())\r\ngame = {}\r\nmp = {}\r\nfor i in range(n):\r\n k,v = input().split()\r\n if k in mp:\r\n mp[k] = [mp[k][0]+int(v),i]\r\n game[k].append([int(v),i])\r\n else:\r\n mp[k]=[int(v),i]\r\n game[k] = [[int(v),i]]\r\nmp = sorted(mp.items(),key = lambda d:d[1][0],reverse = True)\r\npoint = mp[0][1][0]\r\nwinners = []\r\nfor pair in mp:\r\n if pair[1][0] == point:\r\n winners.append(pair[0])\r\n else:\r\n break\r\nm = ['',n]\r\nfor mem in winners:\r\n s = 0\r\n for pair in game[mem]:\r\n s += pair[0]\r\n if s >= point:\r\n if pair[1] < m[1]:\r\n m = [mem,pair[1]]\r\n break\r\nprint (m[0])\r\n", "# LUOGU_RID: 118873789\nn, k, s = eval(input()), {}, []\r\nfor i in range(n): a, b = input().split(' ');k[a] = k.get(a, 0) + int(b);s.append([a, k[a]])\r\nn = max(k.values())\r\nfor i, j in s:\r\n if k[i] == n and int(j) >= n: print(i);break", "def winner(x):\r\n scores = {}\r\n for i in range(len(x)):\r\n if x[i][0] in scores:\r\n scores[x[i][0]] += x[i][1]\r\n else:\r\n scores[x[i][0]] = x[i][1]\r\n\r\n s = max(scores.values())\r\n ss = []\r\n for i in scores:\r\n if s == scores[i]:\r\n ss.append(i)\r\n \r\n if len(ss) == 1:\r\n return ss[0]\r\n \r\n cscores = {}\r\n for i in ss:\r\n cscores[i] = 0\r\n scores = {}\r\n for i in range(len(x)):\r\n if x[i][0] in cscores:\r\n cscores[x[i][0]] += x[i][1]\r\n if cscores[x[i][0]] >= s:\r\n return x[i][0]\r\n\r\nl = int(input())\r\nx = []\r\nfor _ in range(l):\r\n a,b = input().split()\r\n x.append([a,int(b)])\r\nprint(winner(x))", "import sys\r\nsys.stdin.readline()\r\n\r\nlista = []\r\nmydict = {}\r\n\r\nfor l in sys.stdin:\r\n line = l.split()\r\n k, v = line[0], int(line[1])\r\n if k in mydict:\r\n mydict[k] += v\r\n else:\r\n mydict[k] = v\r\n lista.append([mydict[k], k])\r\nmx = max(mydict.values())\r\nfor v, k in lista:\r\n if v >= mx and mydict[k] == mx:\r\n print(k)\r\n break", "n,k,s=eval(input()),{},[]\r\nfor i in range(n):a,b=input().split(' ');k[a]=k.get(a,0)+int(b);s.append([a,k[a]])\r\nn=max(k.values())\r\nfor i ,j in s:\r\n if k[i]==n and int(j)>=n:print(i);break", "# It's never too late to start!\r\nfrom bisect import bisect_left\r\nimport os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\nfrom collections import Counter, defaultdict\r\nfrom collections import deque\r\nfrom functools import cmp_to_key\r\nimport math\r\n# import heapq\r\n\r\ndef sin():\r\n return input()\r\ndef ain():\r\n return list(map(int, sin().split()))\r\ndef sain():\r\n return input().split()\r\ndef iin():\r\n return int(sin())\r\nMAX = float('inf')\r\nMIN = float('-inf')\r\nMOD = 1000000007\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 s = set()\r\n for p in range(2, n+1): \r\n if prime[p]: \r\n s.add(p)\r\n return s\r\ndef readTree(n, m):\r\n adj = [deque([]) for _ in range(n+1)]\r\n for _ in range(m):\r\n u,v = ain()\r\n adj[u].append(v)\r\n adj[v].append(u)\r\n return adj\r\n\r\ndef solve(c1,c2,maxi1,maxi2):\r\n for i in range(1,maxi1+1):\r\n if i not in c1:\r\n return False\r\n for i in range(1,maxi2+1):\r\n if i not in c2:\r\n return False\r\n return True\r\n# Stay hungry, stay foolish!\r\n\r\ndef main():\r\n d = {}\r\n sample = {}\r\n for i in range(iin()):\r\n name, score = sain()\r\n score = int(score)\r\n if name in d:\r\n d[name] = [d[name][0]+score, i]\r\n else:\r\n d[name] = [score, i]\r\n if name in sample:\r\n sample[name].append([sample[name][-1][0]+score,i])\r\n else:\r\n sample[name] = deque([[score,i]])\r\n maxi = float('-inf')\r\n for i in d.values():\r\n maxi = max(maxi,i[0])\r\n s = set()\r\n for k in d.keys():\r\n if d[k][0] == maxi:\r\n s.add(k)\r\n ss = {}\r\n # print(sample)\r\n # print(maxi)\r\n for i in s:\r\n for j in sample[i]:\r\n if j[0] >= maxi:\r\n ss[i] = j[1]\r\n break\r\n res = float('inf')\r\n ans = ''\r\n for k,v in ss.items():\r\n if v<res:\r\n ans = k\r\n res = v\r\n print(ans)\r\n \r\n \r\n\r\n\r\n\r\n# Fast IO Template starts\r\n\r\nBUFSIZE = 8192\r\n\r\n\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\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\nif os.getcwd() == 'D:\\\\code':\r\n sys.stdin = open('input.txt', 'r')\r\n 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# Fast IO Template ends\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n# Never Give Up - John Cena", "n = int(input())\nranks = {}\nround_first = []\nfor i in range(n):\n [name, score] = input().split()\n if name in ranks.keys():\n ranks[name] += int(score)\n else:\n ranks[name] = int(score)\n max_i = [\"\", 0]\n for key in ranks:\n if ranks[key] > max_i[1]:\n max_i = [key, ranks[key]]\n round_first.append(max_i)\n\nsame_flag = False\nnames = [max_i[0]]\nfor key in ranks.keys():\n if ranks[key] == max_i[1] and key != max_i[0]:\n same_flag = True\n names.append(key)\n\nif same_flag:\n for rf in round_first:\n if rf[1] >= max_i[1] and rf[0] in names:\n max_i = rf\n break\n\nprint(max_i[0])\n", "n = int(input()) \r\ndata =[]\r\nplayers= {}\r\nfor i in range(n): \r\n player = list(map(str , input().split())) \r\n data.append(player)\r\n if player[0] not in players: \r\n players[player[0]] = 0\r\nplayers1 = players.copy()\r\nfor name , sccore in data : \r\n players[name] += int(sccore)\r\nmx = max(players.items() , key = lambda x : x[1])[1]\r\nres =None\r\nwinners = [name for name in players if players[name] == mx]\r\nfor name , sccore in data : \r\n players1[name] += int(sccore)\r\n if name in winners and players1[name] >= mx :\r\n print(name) \r\n break \r\n ", "import math\nimport os\nimport random\nimport re\nimport sys\nfrom collections import Counter\n\ndef Winner(arr, n):\n a = Counter()\n b = []\n for i in range(n):\n name, score = arr[i].split(\" \")\n a[name] += int(score)\n b.append((name, a[name]))\n maxVal = max(a.values())\n #print(maxVal)\n #a = Counter()\n\n for name,score in b:\n if score >= maxVal and a[name] == maxVal:\n print(name)\n return\n\n\nif __name__ == '__main__':\n n = input()\n n = int(n)\n #print(n)\n arr = [input() for i in range(n)]\n Winner(arr, n)\n\n\n\n\n\n\n\n\n", "import sys\r\ndef solve(n,name,score):\r\n d = dict()\r\n for i in range(n):\r\n if name[i] not in d:\r\n d[name[i]] = score[i]\r\n else:\r\n d[name[i]] += score[i]\r\n mx = max(d.values())\r\n winners = set()\r\n for key in d:\r\n if d[key] == mx:\r\n winners.add(key)\r\n d = dict()\r\n for w in winners:\r\n d[w] = 0\r\n for i in range(n):\r\n if name[i] not in winners:\r\n continue\r\n d[name[i]] += score[i]\r\n if d[name[i]] >= mx:\r\n return name[i]\r\n\r\ndef main():\r\n n = int(sys.stdin.readline())\r\n name = ['x' for _ in range(n)]\r\n score = [0 for _ in range(n)]\r\n for i in range(n):\r\n name[i], score[i] = sys.stdin.readline().split()\r\n score[i] = int(score[i])\r\n print(solve(n, name, score))\r\n return\r\nmain()", "'''\r\n╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬ ▓▓█████▓▓ ╬╬\r\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\nrounds = list()\r\nscores = dict()\r\nfor i in range(ii()):\r\n name, score = ss().split()\r\n scores[name] = scores.get(name, 0)+int(score)\r\n rounds.append(name+' '+str(scores[name]))\r\nmaxscr = max(scores.values())\r\nfor r in rounds:\r\n name, score = r.split()\r\n if int(score)>=maxscr and scores[name]>=maxscr: print (name); break\r\n \r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n", "n = int(input())\r\ndic = {}\r\nd = []\r\nfor i in range(1, n+1):\r\n s = input().split()\r\n d.append((s[0], int(s[1])))\r\n if s[0] in dic.keys():\r\n if int(s[1])>0:\r\n dic.update({s[0]: dic[s[0]]+int(s[1])})\r\n else:\r\n dic[s[0]]+=int(s[1])\r\n else:\r\n dic.update({s[0]: int(s[1])})\r\nmx = max(dic.values())\r\npret = []\r\nfor x in dic.keys():\r\n if dic[x]==mx:\r\n pret.append(x)\r\ndic2 = {}\r\nfor x in d:\r\n if x[0] in pret:\r\n if x[0] in dic2.keys():\r\n dic2.update({x[0]: dic2[x[0]]+x[1]})\r\n else:\r\n dic2.update({x[0]: x[1]})\r\n if dic2[x[0]]>=mx:\r\n print(x[0])\r\n break", "n=int(input())\r\ndid={}\r\ndata=[]\r\nfor i in range(n):\r\n a,b=input().split();b=int(b)\r\n did[a]=did.get(a,0)+b\r\n data.append((a,b))\r\nval=max(did.values())\r\nind=n;ans=\"\"\r\npos=set()\r\nfor i in did:\r\n if did[i]==val:\r\n pos.add(i)\r\ndid={}\r\nfor i in range(n):\r\n a,b=data[i]\r\n did[a]=did.get(a,0)+b\r\n if (did[a]>=val) and a in pos:\r\n ans=a\r\n break\r\nprint(ans)", "import collections\r\n\r\nscores = collections.defaultdict(int)\r\nstates = []\r\n\r\nfor _ in range(int(input())):\r\n line_raw = input().split()\r\n name, score = line_raw[0], int(line_raw[1])\r\n scores[name] += score\r\n states.append((name, scores[name]))\r\n\r\nbest_score = max(scores.values())\r\nwinners = [name for name, score in scores.items() if score == best_score]\r\n\r\nprint(next(name for name, score in states if score >= best_score and name in winners))\r\n", "import sys\r\n\r\n# sys.stdin = open(\"input.txt\", \"r\")\r\n# sys.stdout = open(\"output.txt\", \"w\")\r\n\r\n\r\ndef main():\r\n d, r = {}, []\r\n for _ in ' ' * int(input()):\r\n x, c = input().split()\r\n d[x] = d.get(x, 0) + int(c)\r\n r += [(d[x], x)]\r\n m = max(d.values())\r\n print([x for v, x in r if d[x] == m and v >= m][0])\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "lenght = int(input())\r\n\r\nscoreboard = {}\r\ntimeLine = {}\r\n\r\nfor index in range(lenght) :\r\n name , addScore = list(input().split(\" \"))\r\n addScore = int(addScore)\r\n \r\n if name not in scoreboard : \r\n scoreboard[name] = addScore\r\n \r\n else : \r\n scoreboard[name] += addScore\r\n addScore = scoreboard[name]\r\n \r\n if name not in timeLine :timeLine[name] = [[index , addScore]]\r\n else :\r\n if addScore > timeLine[name][-1][-1] :\r\n timeLine[name].append([index , addScore])\r\n \r\n\r\n\r\nmaxScore = scoreboard[sorted(scoreboard , key= lambda x : scoreboard[x])[-1]]\r\ntimeLineName = 0\r\ntimeLinetime = float(\"inf\")\r\n\r\n\r\n\r\nfor key , value in scoreboard.items() :\r\n if value >= maxScore :\r\n for time , score in timeLine[key] :\r\n if score >= maxScore and time < timeLinetime : \r\n timeLineName = key\r\n timeLinetime = time\r\nprint(timeLineName)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue May 17 11:07:48 2016\r\n\r\n@author: Alex\r\n\"\"\"\r\n\r\nn = int(input())\r\ndic = dict() #final\r\nrank = [[]]*n #process\r\nfor i in range(n):\r\n a, b = input().split()\r\n x = dic.get(a,0)\r\n x += int(b)\r\n dic[a] = x\r\n rank[i] =[a,x] \r\nmaxpoint = max(dic.values())\r\nfor a,x in rank:\r\n if dic[a]==maxpoint and x>=maxpoint:\r\n print(a)\r\n break\r\n\r\n \r\n\r\n \r\n \r\n ", "__author__ = 'zhangxun'\n#!/usr/bin/env python\n# -*- coding: utf-8 -*-\n\nn = int(input())\ntemp_list,name_scoreD = [],{}\nfor i in range(n):\n a,b = input().split()\n b = int(b)\n name_scoreD[a] = name_scoreD.get(a,0)+b\n temp_list.append([name_scoreD[a],a])\n m = max(name_scoreD.values())\n\nfor score,name in temp_list:\n if score >= m and name_scoreD[name] >= m:\n print(name)\n break\n\n", "n=int(input())\r\nD=dict()\r\nL=list()\r\nBIG=list()\r\nnomm=list()\r\nmaxscore=-1000000000000\r\nfor o in range(n):\r\n ch=str(input())\r\n LL=list()\r\n LL=ch.split()\r\n nom=str(LL[0])\r\n score=int(LL[1])\r\n BIG.append((nom,score))\r\n if nom not in D:\r\n D[nom]=score\r\n else:\r\n D[nom]+=score\r\nfor nom in D:\r\n maxscore=max(maxscore,D[nom])\r\nfor nom in D:\r\n if D[nom]==maxscore:\r\n nomm.append(nom)\r\nD=dict()\r\nfor couple in BIG:\r\n nom=str(couple[0])\r\n score=int(couple[1])\r\n if nom not in D:\r\n D[nom]=score\r\n else:\r\n D[nom]+=score\r\n if (D[nom]>=maxscore) and (nom in nomm):\r\n print(nom)\r\n break\r\n", "r = []\r\np = {}\r\nt = {}\r\n\r\nfor i in range(int(input())):\r\n n, s = input().split()\r\n s = int(s)\r\n r.append((n, s))\r\n \r\n if n in p:\r\n p[n] += s\r\n else:\r\n p[n] = s\r\n \r\nm = max(p.values())\r\n\r\nfor k, v in p.items():\r\n if v == m:\r\n t[k] = 0\r\n\r\nfor i in r:\r\n if i[0] not in t:\r\n continue\r\n \r\n t[i[0]] += i[1]\r\n\r\n if (t[i[0]] >= m):\r\n print(i[0])\r\n break\r\n", "n=int(input())\r\na={}\r\nmx=0\r\nb=[]\r\nfor i in range(n):\r\n x, p=input().split()\r\n p=int(p)\r\n if(x in a.keys()):\r\n a[x]+=p\r\n else:\r\n a[x]=p\r\n b.append((x,a[x]))\r\n \r\nmx=max(a.values())\r\n\r\n#print(b)\r\n#print(mx)\r\n\r\nfor x,p in b:\r\n #print(x,p)\r\n if(p>=mx and a[x]==mx):\r\n print(x)\r\n break\r\n", "d, p = {}, []\r\nfor _ in range(int(input())):\r\n n, s = input().split()\r\n d[n] = d.get(n, 0) + int(s)\r\n p.append((d[n], n))\r\nm = max(d.values())\r\nprint(next(n for s, n in p if s >= m and d[n] >= m))\r\n", "n,p,q=int(input()),[],{}\r\nfor i in range(n):\r\n\ta,b=(input().split())\r\n\tq[a]=q.get(a,0)+int(b)\r\n\tp.append([a,q[a]])\r\n#print(q)\r\n#print(p)\r\nm=max(q.values())\r\n#print(m)\r\nfor i,j in p:\r\n\tif q[i]==m and int(j)>=m:\r\n\t\tprint(i)\r\n\t\tbreak", "n = int(input())\nd = dict()\nR = set()\nfor i in range(n):\n name,score = input().strip().split()\n score = int(score)\n if name in d:\n d[name] += score\n else:\n d[name] = score\n R.add((d[name],i,name))\ns = max(d.values())\nN = set()\nfor name in d:\n if d[name] == s:\n N.add(name)\nNS = set()\nfor item in R:\n score,step,name = item\n if score >= s and name in N:\n NS.add((step,name))\na = min(NS)\nprint(a[1])\n", "from collections import defaultdict\r\nsa = defaultdict(int)\r\nfst = {}\r\nn = int(input())\r\nfor _ in range(n):\r\n a, b = input().split()\r\n b = int(b)\r\n sa[a] += b\r\n if sa[a] not in fst:\r\n fst[sa[a]] = a\r\nm = max(sa.values())\r\nw = set()\r\nfor a, s in sa.items():\r\n if s == m:\r\n w.add(a)\r\nt = [(b, a) for b, a in fst.items() if a in w]\r\nfor b, a in t:\r\n if b >= m:\r\n print(a)\r\n break\r\n", "n = int( input() )\r\n\r\nmax_score = 0\r\nT = {}#turn\r\nS = {}#score\r\n\r\nmin_turn = -1\r\nmin_name = \"\"\r\n\r\nA, B = [], []\r\n\r\nfor i in range( n ):\r\n name, score = list( input().split() )\r\n\r\n A.append( name )\r\n B.append( score )\r\n\r\n #print( name, score )\r\n\r\n score = int( score )\r\n\r\n if name not in S:\r\n S[ name ] = score\r\n T[ name ] = i\r\n else:\r\n S[ name ] += score\r\n if score > 0:\r\n T[ name ] = i\r\n\r\nmax_score = max( S.values() )\r\n\r\nS2 = {}\r\n\r\nfor i in range( len(A) ):\r\n if max_score == S[ A[i] ]:\r\n\r\n name = A[i]\r\n score = int( B[i] )\r\n\r\n if name not in S2:\r\n S2[ name ] = score\r\n else:\r\n S2[ name ] += score\r\n\r\n if S2[ name ] >= max_score:\r\n print( name )\r\n break\r\n\r\n#print( S.keys() )\r\n#print( S.values() )\r\n#print( T.values() )\r\n", "n = int(input())\r\n\r\n# Read data\r\nscores = {}\r\nrounds = {}\r\nfor i in range(n):\r\n\tplayer, score = input().split()\r\n\tscore = int(score)\r\n\tscores[player] = scores.get(player, 0) + score\r\n\trounds[i] = [player, scores[player]] # store the round\r\n\r\n# Determine who the winner is\r\nwinning_score = max(scores.values())\r\nfor key, value in rounds.items():\r\n\tplayer, score = value\r\n\tif scores[player] == winning_score and score >= winning_score:\r\n\t\tprint(player)\r\n\t\tbreak", "n=int(input())\r\nx=[[int(j) if j[-1].isnumeric() else j for j in input().split()] for i in range(n)]\r\nd={}\r\nfor i in x:\r\n try:d[i[0]]+=i[1]\r\n except KeyError:d[i[0]]=i[1]\r\nm=1\r\nl=[]\r\nfor i in d.keys():\r\n if d[i]>m:\r\n m=d[i]\r\n l=[i]\r\n elif d[i]==m:\r\n l.append(i)\r\ne={i:0 for i in l}\r\nfor i in x:\r\n try:\r\n e[i[0]]+=i[1]\r\n if e[i[0]]>=m:\r\n print(i[0])\r\n break\r\n except KeyError:pass\r\n", "n = int(input())\r\ndetail = [0 for i in range(n)]\r\nname=[]\r\nisbreak = 0\r\nfor i in range(n):\r\n detail[i] = input().split()\r\nfor i in range(n):\r\n if detail[i][0] not in name:\r\n name.append(detail[i][0])\r\npoint = [0 for i in range(len(name))]\r\npoint_dynamic = [0 for i in range(len(name))]\r\nfor i in range(len(name)):\r\n for j in range(n):\r\n if name[i] == detail[j][0]:\r\n point[i] = point[i] + int(detail[j][1])\r\nmax_index = [i for i, x in enumerate(point) if x==max(point)]\r\nif len(max_index) == 1:\r\n print(name[max_index[0]])\r\nelse:\r\n for i in range(n):\r\n for j in max_index:\r\n if point_dynamic[j] >= max(point):\r\n print(name[j])\r\n isbreak = 1\r\n break\r\n else:\r\n if name[j] == detail[i][0]:\r\n point_dynamic[j] = point_dynamic[j] + int(detail[i][1])\r\n if isbreak == 1:\r\n break", "\r\nscores=dict()\r\nlist1=[]\r\nrounds=int(input())\r\nfor i in range(0, rounds, 1):\r\n name, score=input().split()\r\n score=int(score)\r\n if name in scores:\r\n scores[name]+=score\r\n else:\r\n scores[name]=score\r\n list1.append([name, scores[name]])\r\n \r\nm=max(scores.values())\r\nnames=[]\r\nfor name in scores:\r\n if scores[name]==m:\r\n names.append(name)\r\n\r\n\r\nfor i in range(0, len(list1), 1):\r\n if list1[i][1]>=m and list1[i][0] in names:\r\n print(list1[i][0])\r\n break\r\n ", "from collections import defaultdict\r\nn=int(input())\r\ndic={}\r\ndicti=defaultdict(list)\r\nout=-199999968798\r\nna=\"\"\r\nfor _ in range(n):\r\n name,sco=map(str,input().split())\r\n dic[name]=dic.get(name,0)+int(sco)\r\n dicti[dic[name]].append(name)\r\nfor i in dic:\r\n if dic[i]>out:\r\n out=dic[i]\r\nfor i in dicti:\r\n if i>=out:\r\n for k in dicti[i]:\r\n for j in dicti[out]:\r\n if k==j:\r\n na=k\r\n break\r\n if len(na)!=0:\r\n break\r\n if len(na)!=0:\r\n break\r\n \r\n \r\nprint(na)\r\n\r\n \r\n \r\n\r\n \r\n", "reccord = input()\r\nreccord = int(reccord)\r\ndict = {}\r\ntime = {}\r\nhis = []\r\nfor i in range(reccord):\r\n name, score = input().split(maxsplit=1)\r\n tmp = dict[name] if name in dict else 0\r\n dict[name] = tmp +int(score)\r\n tmp1 = time[name] if name in time else 0\r\n time[name] = tmp1 + i\r\n his.append((name,int(score) ))\r\ninverse = [(value, key) for key, value in dict.items()]\r\nmaxV = max(inverse)[0]\r\nmaxL = {}\r\n# for i in dict:\r\n# if dict[i] == maxV:\r\n# maxL[i] = time[i]\r\n# inverse = [(value, key) for key, value in maxL.items()]\r\n# print (min(inverse)[1])\r\ndash = {}\r\nfor name, score in his:\r\n tmp = dash[name] if name in dash else 0\r\n dash[name] = tmp + score\r\n if dash[name] >= maxV and dict[name] == maxV:\r\n print(name)\r\n break\r\n\r\n# print( max(inverse))", "n = int(input())\r\nd = {}\r\nfor round in range(n):\r\n name,score = (i for i in input().split())\r\n mscore =0\r\n if name in d:\r\n d[name][round:]=[d[name][round-1]+int(score)]*(n-round)\r\n else:\r\n d[name] = [0]*n\r\n d[name][round:] = [d[name][round-1]+int(score)]*(n-round)\r\nmscore = max([scores[-1] for scores in d.values()])\r\nd2 = []\r\nfor i in d:\r\n if d[i][-1]==mscore:\r\n d2.append((i, d[i]))\r\nflag = False\r\nfor j in range(0,n):\r\n for i in range(len(d2)):\r\n if d2[i][1][j]>=mscore:\r\n print(d2[i][0])\r\n flag=True\r\n break\r\n if flag:\r\n break\r\n \r\n ", "n=int(input())\r\nt,main=[],{}\r\nfor i in range(n):\r\n a=input().split()\r\n main[a[0]]=main.get(a[0],0)+int(a[1])\r\n t.append([a[0],main[a[0]]])\r\nm=max(main.values())\r\nfor a,b in t:\r\n if b>=m and main[a]>=m:\r\n print(a)\r\n break", "n=int(input())\r\na=[]\r\nd={}\r\nfor i in range(n):\r\n b=input().split()\r\n a.append(b)\r\n if b[0] in d:\r\n d[b[0]]+=int(b[1])\r\n else:\r\n d[b[0]]=int(b[1])\r\nval=list(d.values())\r\nbest=max(val)\r\nif val.count(best)==1:\r\n for i,v in d.items():\r\n if v==best:\r\n print(i)\r\n break\r\nelse:\r\n d1={}\r\n for b in a:\r\n if b[0] in d1:\r\n d1[b[0]]+=int(b[1])\r\n else:\r\n d1[b[0]]=int(b[1])\r\n if d1[b[0]]>=best and d[b[0]]==best:\r\n print(b[0])\r\n break", "from math import *\n\nn = int(input())\nresult = dict()\nfor i in range(n):\n\tname, score_ = input().split()\n\tscore = int(score_)\n\tif name in result:\n\t\tresult[name][0] += score\n\t\tif result[name][0] > result[name][1][-1][0]:\n\t\t\tresult[name][1].append([result[name][0],i+1])\n\telse:\n\t\tif score > 0:\n\t\t\tresult[name] = [score, [[score, i+1]]]\n\t\telse:\n\t\t\tresult[name] = [score, [[0,0]]]\ntem = 0\nfor item in result:\n\tif result[item][0] > tem:\n\t\ttem = result[item][0]\npos = 1001\nfor item in result:\n\tif result[item][0] == tem:\n\t\tlenth = len(result[item][1])\n\t\tfor j in range(lenth):\n\t\t\tif result[item][1][j][0] >= tem:\n\t\t\t\tpostem = result[item][1][j][1]\n\t\t\t\tif postem < pos:\n\t\t\t\t\tpos = postem\n\t\t\t\t\tfinal = item\n\nprint(final)\n", "from collections import defaultdict\r\np=[]\r\nname=[]\r\nmaxi=-9999\r\nd=defaultdict(lambda:0)\r\nt=int(input())\r\nfor i in range(t):\r\n n,s=input().split()\r\n s=int(s)\r\n d[n]+=s\r\n name.append(n)\r\n p.append(s)\r\nmaxi=max(d.values())\r\nd1=defaultdict(lambda:0)\r\nfor i in range(t):\r\n d1[name[i]]+=p[i]\r\n if(d1[name[i]]>=maxi and d[name[i]]>=maxi):\r\n print(name[i])\r\n break\r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n\"\"\"\r\nfrom collections import defaultdict\r\nt=int(input())\r\nd=defaultdict(lambda:0)\r\nfor i in range(t):\r\n p=[0]*t\r\n n,s=input().split()\r\n if(d[n]==0):\r\n d[n]=p\r\n d[n][i]=int(s)\r\n else:\r\n d[n][i]=int(s)\r\nmaxi=0\r\nwin=''\r\nfor i,j in d.items():\r\n if(sum(j)>maxi):\r\n maxi=sum(j)\r\n elif(sum(j)==maxi):\r\n win\r\n\"\"\"\r\n", "import sys\r\nfrom functools import lru_cache, cmp_to_key\r\nfrom heapq import merge, heapify, heappop, heappush, nlargest, nsmallest\r\nfrom math import ceil, floor, gcd, fabs, factorial, fmod, sqrt, inf, log\r\nfrom collections import defaultdict as dd, deque, Counter as C, OrderedDict as od\r\nfrom itertools import combinations as comb, permutations as perm\r\nfrom bisect import bisect_left as bl, bisect_right as br, bisect\r\nfrom time import perf_counter\r\nfrom fractions import Fraction\r\n# sys.setrecursionlimit(pow(10, 6))\r\n# sys.stdin = open(\"input.txt\", \"r\")\r\n# sys.stdout = open(\"output.txt\", \"w\")\r\nmod = pow(10, 9) + 7\r\nmod2 = 998244353\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\n\r\n\r\nn = int(data())\r\ndp = od()\r\nd = deque()\r\nfor i in range(n):\r\n n, s = ssp()\r\n s = int(s)\r\n if n not in dp.keys():\r\n dp[n] = s\r\n else:\r\n dp[n] += s\r\n d.append((n, dp[n]))\r\ntemp = max(dp.values())\r\n# print(d, temp)\r\nfor i in d:\r\n if i[1] >= temp and dp[i[0]] >= temp:\r\n out(i[0])\r\n exit()\r\n", "n = int(input())\nplayers = {}\nlog = []\nfor i in range(n):\n p, s = list(input().split())\n s = int(s)\n log.append((p, s))\n if p not in players:\n players[p] = s\n else:\n players[p] += s\n\nwinners = []\nhighest = 0\nfor p in players:\n if players[p] > highest:\n winners = [p]\n highest = players[p]\n elif players[p] == highest:\n winners.append(p)\n\nplayers2 = {}\n\nfor l in log:\n p = l[0]\n\n if p in winners:\n if p in players2:\n players2[p] += l[1]\n\n else:\n players2[p] = l[1]\n\n if players2[p] >= highest:\n print(p)\n break\n\n\n", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\nimport sys\nimport math\nfrom collections import defaultdict\n\ndebug = len(sys.argv) >= 2 and sys.argv[1] == '--debug'\n\ndef debug_print(message):\n if debug:\n print(message)\n\ndef read_int():\n return int(input())\n\ndef read_array(constructor=None):\n if constructor:\n return [constructor(x) for x in input().split()]\n else:\n return input().split()\n\nplayer_score = defaultdict(int)\n\nhistory = []\n\nnum_round = read_int()\nfor _ in range(num_round):\n player, score = read_array()\n score = int(score)\n\n player_score[player] += score\n history.append((player, score))\n\n debug_print(player_score)\n\nmax_score = max(player_score.values())\nmax_score_players = [key for (key, value) in player_score.items() if value == max_score]\n\ndebug_print(max_score_players)\n\nif len(max_score_players) == 1:\n print(max_score_players[0])\n sys.exit(0)\n\nplayoff_player_score = defaultdict(int)\nfor player, score in history:\n if player in max_score_players:\n playoff_player_score[player] += score\n\n if playoff_player_score[player] >= max_score:\n print(player)\n sys.exit(0)\n\nsys.exit(1)\n", "import copy\n\nn = int(input())\n\nscores = {}\nhist_scores = []\n\nfor i in range(n):\n name, delta = input().split()\n score = scores.get(name, 0) + int(delta)\n scores[name] = score\n\n if int(delta) > 0:\n hist_scores.append((name, score))\n\nmax_score = max(scores.values())\nwinners = [name for name, score in scores.items() if score == max_score]\n\nif len(winners) == 1:\n print(winners[0])\nelif len(winners) > 1:\n for name, score in hist_scores:\n if score >= max_score and name in winners:\n print(name)\n break\nelse:\n raise Exception()\n", "n=int(input())\r\nd={}\r\nt={}\r\nturn=0\r\nwhile(n):\r\n\ta=input().split()\r\n\tif(a[0] not in d):\r\n\t\td[a[0]]=[]\r\n\t\tt[a[0]]=[]\r\n\td[a[0]].append(int(a[1]))\r\n\tturn+=1\r\n\tt[a[0]].append(turn)\r\n\tn-=1\r\nmaxm=-1\r\nfor i in d:\r\n\tmaxm=max(maxm, sum(d[i]))\r\nc={}\r\nfor i in d:\r\n\tif(sum(d[i])==maxm):\r\n\t\tc[i]=d[i]\r\ne={}\r\nfor i in c:\r\n\tsums=0\r\n\tfor j in range(len(c[i])):\r\n\t\tsums+=c[i][j]\r\n\t\tif(sums>=maxm):\r\n\t\t\t# e[i]=j\r\n\t\t\te[i]=t[i][j]\r\n\t\t\tbreak\r\n# print(e)\r\nminm=min(e.values())\r\nfor k in e:\r\n\tif(e[k]==minm):\r\n\t\tprint(k)\r\n\t\tbreak\r\n", "p,r,n=[],{},int(input())\r\nfor i in range(n):\r\n a,b=input().split()\r\n b=int(b)\r\n r[a]=r.get(a,0)+b\r\n p.append([a,r[a]])\r\nm = max(r.values())\r\nfor a, n in p:\r\n if r[a] == m and n >= m:\r\n print(a)\r\n break", "n=int(input())\r\nns={}\r\nk=0\r\nwhile n>0:\r\n n-=1\r\n k+=1\r\n s=input()\r\n a=s.split(' ')\r\n name=a[0]\r\n score=int(a[1])\r\n g=ns.get(name,[0,{}])\r\n g[0]=g[0]+score\r\n g[1].update({k:g[0]})\r\n ns.update({name:g})\r\nsmax=-10000\r\nkmin=10000\r\nwiner=''\r\nfor i in ns:\r\n g=ns.get(i,[0,{}])\r\n if g[0]==smax:\r\n km=10000\r\n for j in g[1]:\r\n if km>j and g[1][j]>=g[0]:\r\n km=j\r\n if kmin>km:\r\n kmin=km\r\n winer=i\r\n if g[0]>smax:\r\n smax=g[0]\r\n km=10000\r\n for j in g[1]:\r\n if km>j and g[1][j]>=g[0]:\r\n km=j\r\n kmin=km\r\n winer=i\r\nprint(winer)", "'''\r\n Author: Ken\r\n Date: 2020-02-02\r\n'''\r\nfrom collections import Counter\r\n\r\nn = int(input())\r\nall = Counter()\r\ntemp = []\r\n\r\nfor _ in range(n):\r\n name, score = input().split()\r\n all[name] += int(score)\r\n temp.append((name,all[name]))\r\n\r\nmax_value = max(all.values())\r\n\r\nfor x,y in temp:\r\n if y >= max_value and all[x] == max_value:\r\n print(x)\r\n break\r\n", "q={}\r\nl=[]\r\nfor _ in range(int(input())):\r\n x,y=input().split()\r\n q[x]=q.get(x,0)+int(y)\r\n l+=[[q[x],x]]\r\ne=max(q.values())\r\nfor i in l:\r\n if i[0]>=e and q[i[1]]==e:\r\n print(i[1])\r\n break", "def main():\n num = int(input())\n\n placar = {}\n\n for i in range(num):\n player, points = input().split()\n points = int(points)\n\n if player in placar:\n new_points = placar[player][-1][0] + points\n placar[player].append([new_points, i])\n else:\n placar[player] = [[points, i]]\n \n max_score = -1\n\n for key in placar.keys():\n if placar[key][-1][0] > max_score:\n max_score = placar[key][-1][0]\n winner = key\n elif placar[key][-1][0] == max_score:\n \n for i in range(len(placar[key])):\n if placar[key][i][0] >= max_score:\n a_round = placar[key][i][1]\n break\n\n for j in range(len(placar[winner])):\n if placar[winner][j][0] >= max_score:\n b_round = placar[winner][j][1]\n break\n \n if a_round < b_round:\n winner = key\n \n print(winner)\n \nmain()\n \t\t \t\t \t \t \t\t \t\t\t\t\t\t\t\t \t", "n = int(input())\r\nd = {}\r\ngames = []\r\n\r\nfor i in range(n):\r\n a, b = input().split()\r\n games.append((a, b))\r\n if a not in d:\r\n d[a] = int(b)\r\n else:\r\n d[a] += int(b)\r\n\r\nm = max(d.values())\r\nwinners = set(filter(lambda x: d[x] == m, d.keys()))\r\n\r\nw = \"\"\r\nd = {}\r\nfor game in games:\r\n if game[0] not in d:\r\n d[game[0]] = int(game[1])\r\n else:\r\n d[game[0]] += int(game[1])\r\n if d[game[0]] >= m and game[0] in winners:\r\n print(game[0])\r\n exit()\r\n\r\n", "import sys\r\n\r\nn = int(input())\r\n\r\nscores = {}\r\n\r\nlst = []\r\nfor i in range(n):\r\n l = input().split()\r\n if l[0] in scores:\r\n scores[l[0]] += int(l[1])\r\n \r\n else:\r\n scores[l[0]] = int(l[1])\r\n lst.append([l[0], scores[l[0]]])\r\n\r\nvalues = [scores[i] for i in scores]\r\n\r\nm = max(values)\r\n\r\npos = []\r\nfor i in scores:\r\n if scores[i] == m:\r\n pos.append(i)\r\ncm = values.count(m)\r\n\r\nif cm == 1:\r\n for i in scores:\r\n if scores[i] == m:\r\n print(i)\r\n break\r\nelse:\r\n for i in lst:\r\n if (i[1] >= m and i[0] in pos):\r\n print(i[0])\r\n break\r\n", "from sys import stdin, stdout\r\ndef rd(): return stdin.readline().strip()\r\ndef wtl(x): stdout.write(str(x) + '\\n')\r\n\r\nn, mp, f = int(rd()), dict(), dict()\r\nnm, sc = [\"\" for i in range(n)], [0 for i in range(n)]\r\nfor i in range(n):\r\n inp = rd().split()\r\n nm[i], sc[i] = inp[0], int(inp[1])\r\n if nm[i] in mp:\r\n mp[nm[i]] += sc[i]\r\n else:\r\n mp[nm[i]] = sc[i]\r\nm = max(mp[x] for x in nm)\r\nc = sum(mp[x] == m for x in nm)\r\nif c == 1:\r\n for x in nm:\r\n if mp[x] == m:\r\n wtl(x)\r\n quit()\r\nfor x in nm:\r\n f[x] = (mp[x] == m)\r\nfor x in nm:\r\n mp[x] = 0\r\nfor i in range(n):\r\n mp[nm[i]] += sc[i]\r\n if mp[nm[i]] >= m and f[nm[i]]:\r\n wtl(nm[i])\r\n quit()", "n=int(input())\r\nanswer=[]\r\nplayers={}\r\n\r\nfor i in range(n):\r\n name,score=[e for e in input().split()]\r\n score=int(score)\r\n if name not in players:\r\n players[name]=score\r\n else:\r\n players[name]+=score\r\n answer.append([name,players[name]])\r\n\r\nm=max(players.values())\r\n\r\nfor e,f in answer:\r\n if f>=m and players[e]==m:\r\n print(e)\r\n break\r\n", "n = int(input())\r\n\r\nrounds = [input().split() for _ in range(n)]\r\n\r\nscores = dict()\r\n\r\nfor k, v in rounds:\r\n if k in scores:\r\n scores[k] += int(v)\r\n else:\r\n scores[k] = int(v)\r\n\r\nmax_score = scores[max(scores, key=lambda i: scores[i])]\r\nplayers_with_max_score = [k for k in scores if scores[k] == max_score]\r\n\r\nscores = dict()\r\n\r\nfor k, v in rounds:\r\n if k in scores:\r\n scores[k] += int(v)\r\n else:\r\n scores[k] = int(v)\r\n if scores[k] >= max_score and k in players_with_max_score:\r\n print(k)\r\n break\r\n\r\n\r\npass\r\n", "inp = []\nn = int(input())\nscores = dict()\nfor i in range(n):\n tmp = input().split(\" \")\n tmp[1] = int(tmp[1])\n inp.append(tmp)\n if tmp[0] in scores:\n scores[tmp[0]] += tmp[1]\n else:\n scores[tmp[0]] = tmp[1]\nmax_score = max([scores[i] for i in scores])\ncand = [i for i in scores if scores[i] == max_score]\ncand_score = dict()\nfor i in inp:\n if i[0] in cand:\n if i[0] in cand_score:\n cand_score[i[0]] += i[1]\n else:\n cand_score[i[0]] = i[1]\n if cand_score[i[0]] >= max_score:\n print(i[0])\n break\n", "l, p = [], {}\nfor i in range(int(input())):\n n, s = input().split()\n s = int(s)\n l.append((n, s))\n p[n] = p.setdefault(n, 0) + s\n\nm, r, d = 0, '', None\nfor n in p:\n if p[n] > m:\n m, r, d = p[n], n, {n}\n elif p[n] == m > 0:\n d.add(n)\n\nfor n, s in l:\n if n in d:\n p[n] -= s\n if p[n] <= 0:\n r = n\n break\n\nprint(r)\n", "n=int(input().strip())\r\nd={}\r\nfor i in range(n):\r\n name,score=map(str,input().strip().split())\r\n score=int(score)\r\n d[name]=d.get(name,[[0,0]])+[[i,d.get(name,[[0,0]])[-1][-1]+score]]\r\nfinal=-99999\r\nresult=[]\r\nfor i in d:\r\n if(d[i][-1][-1]>=final):\r\n if(d[i][-1][-1]==final):\r\n result.append(i)\r\n else:\r\n result=[i]\r\n final=d[i][-1][-1]\r\nif(len(result)==1):\r\n print(result[0])\r\nelse:\r\n ans=''\r\n index=99999\r\n for i in result:\r\n for num,score in d[i]:\r\n if(score>=final and num<index):\r\n ans=i\r\n index=num\r\n break\r\n print(ans)", "while True:\r\n try:\r\n n = int(input())\r\n s = [None] * 10000\r\n a = [0] * 10000\r\n mp = {}\r\n \r\n for i in range(n):\r\n s[i], a[i] = input().split()\r\n a[i] = int(a[i])\r\n if s[i] in mp:\r\n mp[s[i]] += a[i]\r\n else:\r\n mp[s[i]] = a[i]\r\n \r\n mx = 0\r\n for i in range(n):\r\n mx = max(mp[s[i]], mx)\r\n \r\n mp2 = {}\r\n ans = \"\"\r\n for i in range(n):\r\n if s[i] in mp2:\r\n mp2[s[i]] += a[i]\r\n else:\r\n mp2[s[i]] = a[i]\r\n \r\n if mp2[s[i]] >= mx and mp[s[i]] == mx:\r\n ans = s[i]\r\n break\r\n \r\n print(ans)\r\n \r\n except EOFError:\r\n break\r\n", "def main():\r\n n = int(input())\r\n scores = {}\r\n for i in range(n):\r\n name, score = input().split()\r\n score = int(score)\r\n\r\n if name in scores:\r\n scores[name][0] += score\r\n scores[name][1][i] = scores[name][0]\r\n else:\r\n scores[name] = [score, {i: score}]\r\n result = None\r\n index = None\r\n max_score = max([scores[i][0] for i in scores])\r\n for name in scores:\r\n if scores[name][0] == max_score:\r\n for i in scores[name][1]:\r\n if scores[name][1][i] >= max_score and (index is None or i < index):\r\n result = name\r\n index = i\r\n break\r\n print(result)\r\n\r\n\r\n\r\n\r\nmain()", "n = int(input())\nd = {}\nfor r in range(n):\n player, gain = input().split(' ')\n gain = int(gain)\n if player not in d:\n d[player] = [(gain, r)]\n else:\n score = d[player][-1][0]\n d[player].append([score+gain, r])\n\nmax_score = -float('inf')\nfor player in d:\n max_score = max(max_score, d[player][-1][0])\n\nbest = n-1\nans = ''\nfor player in d:\n if d[player][-1][0] == max_score:\n this_best = n-1\n for i in range(len(d[player])):\n if d[player][i][0] >= max_score:\n this_best = min(this_best, d[player][i][1])\n if this_best <= best:\n ans = player\n best = this_best\n\nprint(ans)", "'''input\n15\naawtvezfntstrcpgbzjbf 681\nzhahpvqiptvksnbjkdvmknb -74\naawtvezfntstrcpgbzjbf 661\njpdwmyke 474\naawtvezfntstrcpgbzjbf -547\naawtvezfntstrcpgbzjbf 600\nzhahpvqiptvksnbjkdvmknb -11\njpdwmyke 711\nbjmj 652\naawtvezfntstrcpgbzjbf -1000\naawtvezfntstrcpgbzjbf -171\nbjmj -302\naawtvezfntstrcpgbzjbf 961\nzhahpvqiptvksnbjkdvmknb 848\nbjmj -735\n'''\nn = int(input())\nd, l = {}, []\nfor _ in range(n):\n\ti = input().split()\n\tl.append(i)\n\tif i[0] in d:\n\t\td[i[0]] += int(i[1])\n\telse:\n\t\td[i[0]] = int(i[1])\nm = max(d.values())\nb = {}\nfor a in range(n):\n\tx = l[a]\n\tif x[0] in b:\n\t\tb[x[0]] += int(x[1])\n\telse:\n\t\tb[x[0]] = int(x[1])\n\tif b[x[0]] >= m and d[x[0]] == m:\n\t\t\tprint(x[0])\n\t\t\tbreak\n\n\n\n\n\n\n\n\n\n\n", "n = int(input())\r\nname = [None] * n\r\nscore = [None] * n\r\n\r\ndic = {}\r\ndic1 = {}\r\n\r\nfor i in range(n):\r\n name[i], sc = input().split()\r\n score[i] = float(sc)\r\n if name[i] in dic:\r\n dic[name[i]] += score[i]\r\n else:\r\n dic[name[i]] = score[i]\r\n\r\nsmax = max(dic.values())\r\n\r\nfor j in range(n):\r\n if name[j] in dic1:\r\n dic1[name[j]] += score[j]\r\n else:\r\n dic1[name[j]] = score[j]\r\n if dic1[name[j]] >= smax and dic[name[j]] == smax:\r\n print (name[j])\r\n break", "t=int(input())\nf={}\nl=[]\nfor _ in range(t):\n n,m=map(str,input().split())\n m=int(m)\n #print(n,m)\n f[n]=f.get(n,0)+m\n l.append([n,f[n]])\nmaxi=max(f.values())\nfor i,j in l:\n if f[i]==maxi and j>=maxi:\n print(i)\n break\n\t\t\t \t \t\t \t \t\t\t\t \t\t\t\t\t \t\t\t", "def _2A():\r\n n = int(input())\r\n lines = list()\r\n for i in range(n):\r\n line = input().split()\r\n name, score = line[0], int(line[1])\r\n lines.append((name, score))\r\n\r\n players = dict()\r\n for name, score in lines:\r\n if name not in players:\r\n players[name] = score\r\n else:\r\n players[name] += score\r\n\r\n board = dict()\r\n for name in players:\r\n score = players[name]\r\n if score not in board:\r\n board[score] = [name]\r\n else:\r\n board[score].append(name)\r\n\r\n winners = list()\r\n max_score = 0\r\n for score in sorted(board, reverse=True):\r\n winners = board[score]\r\n max_score = score\r\n break\r\n\r\n if len(winners) == 1:\r\n return winners[0]\r\n\r\n candidates = {name: 0 for name in winners}\r\n for name, score in lines:\r\n if name in candidates:\r\n candidates[name] += score\r\n if candidates[name] >= max_score:\r\n return name\r\n\r\n\r\nprint(_2A())\r\n", "t=int(input())\nd1={}\nd2={}\nl=[]\nfor _ in range(t):\n a,b=input().split()\n b=int(b)\n l.append([a,b])\n if a in d1:\n d1[a]+=b \n else:\n d1[a]=b \nm=max(d1,key=d1.get)\nm=d1[m]\nfor i in range(t):\n if l[i][0] in d2:\n d2[l[i][0]]+=l[i][1]\n else:\n d2[l[i][0]]=l[i][1]\n if d1[l[i][0]]==m and d2[l[i][0]]>=m:\n print(l[i][0])\n break\n\t \t \t \t\t\t \t\t \t\t \t\t\t\t\t\t", "hash_map = {}\r\nN = int(input())\r\ni = 0\r\ninputs = []\r\n\r\nwhile i < N:\r\n name, value = input().split()\r\n value = int(value)\r\n inputs.append((name, value))\r\n if name not in hash_map: hash_map[name] = value\r\n else: hash_map[name] += value\r\n i += 1\r\n\r\nhash_map = {k:v for k, v in sorted(hash_map.items(), key=lambda x:x[1], reverse=True)}\r\nmax_value = list(hash_map.values())[0]\r\n#print(\"The max is:\", max_value)\r\n\r\ncandidates = []\r\ncnt_map = {}\r\n\r\nfor key, value in hash_map.items():\r\n if value == max_value:\r\n candidates.append(key)\r\n\r\n#print(candidates)\r\n#print(inputs)\r\n\r\nfor c in candidates:\r\n cnt_map[c] = 0\r\n\r\nfor name, value in inputs:\r\n if name in cnt_map:\r\n cnt_map[name] += value\r\n if cnt_map[name] >= max_value:\r\n print(name)\r\n break", "n = int(input())\r\n\r\ncounter = dict()\r\nscenario = []\r\nfor round in range(n):\r\n result = input()\r\n name, scope = result.strip().split()\r\n scope = int(scope)\r\n counter[name] = counter.get(name, 0) + scope\r\n scenario.append([name, counter[name]])\r\n \r\nmx = max(counter.values())\r\n\r\nfor n, v in scenario:\r\n if v >= mx and counter[n]==mx:\r\n print(n)\r\n break\r\n", "from sys import stdin\r\n\r\nn = int(stdin.readline().rstrip())\r\na = []\r\nscores = {}\r\n\r\n\r\nfor i in range(n):\r\n name, score = stdin.readline().rstrip().split(\" \")\r\n scores[name] = scores.get(name, 0) + int(score)\r\n a.append([name, scores[name]])\r\nm = max(scores.values())\r\nfor i,j in a:\r\n if j>=m and scores[i]==m:\r\n print(i)\r\n break\r\n", "from math import *\r\n\r\n#from math import factorial as fact, comb as ncr \r\nfrom bisect import bisect_left as bl\r\nfrom bisect import bisect_right as br\r\nfrom collections import Counter as ctr\r\nfrom collections import deque as dq\r\n\r\nfrom array import array\r\nfrom re import search\r\n\r\ninp=lambda : int(input())\r\nli=lambda : list(map(int,input().split()))\r\nlb=lambda : list(map(int,input()))\r\nls=lambda : list(input())\r\narr=lambda a: array('i',a)\r\nbi=lambda n: bin(n).replace(\"0b\", \"\")\r\nyn=lambda f: print('NYOE S'[f::2])\r\nsbstr=lambda a,s: search('.*'.join(a),s)\r\n\r\n\r\n'''def isprime(a):\r\n if a==2: return True\r\n elif a%2==0: return False\r\n n=3\r\n while n<=a**0.5:\r\n if a%n==0:\r\n return False\r\n n+=2\r\n return True\r\n'''\r\n'''def nf(n,a):\r\n b=a*a\r\n c=b*a\r\n d=c*a\r\n e=n\r\n ct=0\r\n while e%a==0:\r\n if e%d==0:\r\n ct+=4\r\n e=e//d\r\n if e%c==0:\r\n ct+=3\r\n e=e//c\r\n if e%b==0:\r\n ct+=2\r\n e=e//b\r\n if e%a==0:\r\n ct+=1\r\n e=e//a\r\n return ct\r\n'''\r\n\r\ndef solve(__=1):\r\n for _ in range(__):\r\n n=inp()\r\n f={}\r\n a=[]\r\n for i in range(n):\r\n d=input().split()\r\n d[1]=int(d[1])\r\n if d[0] in f:\r\n f[d[0]]+=d[1]\r\n else:\r\n f[d[0]]=d[1]\r\n a.append([f[d[0]],d[0]])\r\n m=max(f.values())\r\n for i,j in a:\r\n if i>=m and f[j]==m:\r\n print(j)\r\n break\r\n\r\n\r\n \r\nif __name__ == \"__main__\":\r\n solve()\r\n #solve(inp())", "import sys\r\nrounds = int(input())\r\n\r\nplayercard = {}\r\nhighscore = 0\r\nhistory = {}\r\n\r\n\r\nfor round in range(rounds):\r\n\tscores = list(map(str, input().split()))\r\n\tname = scores[0]\r\n\tpoints = int(scores[1])\r\n\tif name not in playercard:\r\n\t\thistory[round] = name, points\r\n\t\tplayercard[name] = round, points\r\n\t\tif points > highscore:\r\n\t\t\thighscore = points\r\n\telse:\r\n\t\tnewscore = playercard.get(name)[1] + points\r\n\t\thistory[round] = name, newscore\r\n\t\tplayercard[name] = round, newscore\r\n\t\tif newscore > highscore:\r\n\t\t\thighscore = newscore\r\n# print(highscore)\r\n# print(playercard.items())\r\n# print(history.items())\r\nscoore = 0\r\nfor key, value in playercard.items():\r\n\tif value[1] > scoore:\r\n\t\tscoore = value[1]\r\n# print(scoore)\r\n# print(highscore)\r\nfor key, value in history.items():\r\n\tif value[1] >= scoore and playercard.get(value[0])[1] == scoore:\r\n\t\tprint(value[0])\r\n\t\tsys.exit(0)\r\n\r\n", "n = int(input())\r\ndic = {}\r\ninpp = []\r\nfor i in range(n):\r\n inp = input().split()\r\n inpp.append(inp)\r\n if inp[0] in dic.keys():\r\n dic[str(inp[0])] += int(inp[1])\r\n else:\r\n dic[str(inp[0])] = int(inp[1])\r\nli = sorted(dic.items(), key=lambda x: -x[1])\r\n# print(li)\r\nsco = li[0][1]\r\n# print(sco)\r\ndic2 = {}\r\nfor i in inpp:\r\n if i[0] in dic2.keys():\r\n dic2[str(i[0])] += int(i[1])\r\n else:\r\n dic2[str(i[0])] = int(i[1])\r\n if dic2[str(i[0])] >= sco and dic[str(i[0])] == sco:\r\n print(str(i[0]))\r\n break", "n = int(input())\ngame = []\n\nfor i in range(n):\n round = {}\n temp = input().split()\n if i == 0:\n round[temp[0]] = int(temp[1])\n else:\n round = game[i - 1].copy()\n if temp[0] not in round:\n round[temp[0]] = int(temp[1])\n else:\n round[temp[0]] += int(temp[1])\n\n game.append(round)\n\n# for item in game:\n# print(item)\n\n# Traverse the last round\nmaxi = -1001\nnames = []\nfor item in game[-1].items():\n key = item[0]\n value = item[1]\n\n if maxi < value:\n maxi = value\n names.clear()\n\n if maxi == value:\n names.append(key)\n\nif len(names) == 1:\n print(names[0])\n exit()\n\nfor round in game:\n for name in names:\n if name not in round:\n continue\n if round[name] >= maxi:\n print(name)\n exit()\n\n", "from collections import defaultdict as ddict\r\n\r\n\r\nd = ddict(int)\r\nM = -(10**6)\r\nmas = []\r\nwinners = []\r\n\r\nn = int(input())\r\n\r\nfor i in range(n):\r\n name, score = input().split()\r\n d[name] += int(score)\r\n mas.append([name,int(score)])\r\n\r\n\r\nfor keys in d:\r\n if d[keys] > M:\r\n M = d[keys]\r\n\r\nfor names in d:\r\n if d[names] == M:\r\n winners.append(names)\r\n\r\nd = ddict(int)\r\n\r\nfor name,score in mas:\r\n d[name] += score\r\n if d[name] >= M and name in winners:\r\n print(name)\r\n break\r\n\r\n\r\n\r\n", "import sys,math\ninput=sys.stdin.readline\nfrom collections import defaultdict\nn=int(input())\nd=defaultdict(int)\nx=defaultdict(int)\nm=-1000000\na=[]\nfor i in range(n):\n l=list(input().split())\n a.append(l)\n d[l[0]]+=int(l[1])\ns=max(d.values())\nw=[]\nfor i in d.keys():\n if(d[i]==s):\n w.append(i)\nfor i in range(n):\n x[a[i][0]]+=int(a[i][1])\n if(x[a[i][0]]>=s and a[i][0] in w):\n print(a[i][0])\n break\n", "a,b={},[]\r\nnum_entries = int(input())\r\n\r\nfor i in range(num_entries):\r\n n, s = input().split()\r\n a[n] = a.get(n, 0) + int(s)\r\n b.append((a[n], n))\r\n\r\nm=max(a.values())\r\nfor v, k in b:\r\n if a[k]==m and v>=m:\r\n print(k)\r\n break\r\n", "n = int(input())\r\ndic = {}\r\nwin = 1001\r\nmx = 0\r\nwinner = ''\r\nlines = []\r\n\r\nfor i in range(n):\r\n lines.append(input())\r\n name, score = lines[i].split(maxsplit=1)\r\n dic[name] = dic.get(name, 0) + int(score)\r\n\r\nmax_keys = [key for key, value in dic.items() if value == max(dic.values())]\r\n\r\nfor key in max_keys:\r\n last = 1001\r\n lscore = 0\r\n for i in range(n):\r\n name, score = lines[i].split(maxsplit=1)\r\n if name == key:\r\n lscore += int(score)\r\n if lscore >= dic[key]:\r\n last = i\r\n break\r\n\r\n if win > last:\r\n win = last\r\n winner = key\r\n\r\nprint(winner)", "l = []\r\nscores = {}\r\nfor i in range(int(input())):\r\n name, point = input().split()\r\n point = int(point)\r\n if name in scores:\r\n scores[name] += point\r\n else:\r\n scores[name] = point\r\n l.append([name, scores[name]])\r\nmaxval = max(scores.values())\r\nfor i, j in l:\r\n if j >= maxval and scores[i] == maxval:\r\n print(i)\r\n break", "a, = [int(x) for x in input().split()]\n\nPlayers = {}\n\nRecords = {}\n\nLast_best_score = 0\n\nLast_best_score_holders = []\n\nszajs = []\n\nRandom_name = ''\n\nFirst_best = a\n\nfor number in range(a):\n name, score = [str(x) for x in input().split()]\n if name in Players:\n Players[name] = Players[name] + int(score)\n if Players[name] > Records[name][len(Records[name]) - 1][0]:\n Records[name].append([Players[name],number])\n else:\n Players[name] = int(score)\n Records[name] = [[int(score), number]]\n Random_name = name\n\nLast_best_score = Players[Random_name]\n\nfor imie in Players:\n if Players[imie] > Last_best_score:\n Last_best_score = Players[imie]\n\nfor imie in Players:\n if Last_best_score == Players[imie]:\n Last_best_score_holders.append(imie)\n\nfor i in range(len(Last_best_score_holders)):\n for Record in Records[Last_best_score_holders[i]]:\n if Record[0] >= Last_best_score:\n szajs.append(Record[1])\n break\n\nfor record in szajs:\n if record < First_best:\n First_best = record\n\nfor i in range(len(szajs)):\n if szajs[i] == First_best:\n print(Last_best_score_holders[i])\n break\n\n", "from sys import stdin\r\ninp = stdin.readline\r\n\r\nt = int(inp())\r\nd = dict()\r\narr = []\r\nfor _ in range(t):\r\n s, p = inp().split()\r\n arr.append((s, p))\r\n d[s] = d.get(s, 0) + int(p)\r\n\r\nm = max(d.values())\r\nd2 = dict()\r\nfor i in range(t):\r\n s, p = arr[i]\r\n d2[s] = d2.get(s, 0) + int(p)\r\n\r\n if d2[s] >= m and d[s] == m:\r\n print(s)\r\n break\r\n\r\n", "d = dict()\r\na = list()\r\nfor i in range(int(input())):\r\n name, score = input().split()\r\n score = int(score)\r\n if name in d:\r\n d[name][0] += score\r\n d[name][1].append([i, score + d[name][1][len(d[name][1]) - 1][1]])\r\n else:\r\n a.append(name)\r\n d[name] = [score, [[i, score]]]\r\n #print(d)\r\n\r\nm = max(d[i][0] for i in a)\r\n\r\nans = ''\r\npos = 1000000\r\nfor i in a:\r\n if d[i][0] == m:\r\n for j in range(len(d[i][1])):\r\n if d[i][1][j][1] >= m:\r\n if d[i][1][j][0] < pos:\r\n pos = d[i][1][j][0]\r\n ans = i\r\n break;\r\n\r\nprint(ans)", "n=int(input());\r\nname=[];rou=[];score=[];win=[];\r\nfor i in range(n):\r\n tmp=(input()).split(\" \");\r\n tmp[1]=int(tmp[1]);\r\n rou.append(tmp);\r\n if(tmp[0] not in name):\r\n name.append(tmp[0]);\r\n score.append(tmp[1]);\r\n win.append(0);\r\n else:\r\n index=name.index(tmp[0]);\r\n score[index]+=tmp[1];\r\nans=max(score);\r\nfor i in range(len(score)):\r\n if(score[i]==ans):\r\n win[i]=1;\r\n score[i]=0;\r\nfor a in rou:\r\n index=name.index(a[0]);\r\n score[index]+=a[1];\r\n if(score[index]>=ans and win[index]==1):\r\n print(a[0]);\r\n break;\r\n\r\n \r\n \r\n", "import sys\r\n \r\ndef main():\r\n\r\n input = sys.stdin\r\n #input = open( 'SampleInput6.txt', 'r' )\r\n\r\n ln = input.readline().strip()\r\n games = []\r\n endScores = {}\r\n n = int( ln )\r\n for i in range( n ):\r\n ln = input.readline().strip().split()\r\n name = ln[0]\r\n score = int( ln[1] )\r\n games.append( (name, score) )\r\n if name not in endScores:\r\n endScores[ name ] = 0\r\n \r\n endScores[ name ] += score\r\n #print( name, score, endScores )\r\n\r\n #print( games )\r\n #print( endScores )\r\n\r\n winnerScore = max(endScores.values()) # maximum value\r\n winners = [k for k, v in endScores.items() if v == winnerScore] # getting all keys containing the `maximum`\r\n\r\n #print( winnerScore, winners )\r\n\r\n if len( winners ) == 1:\r\n winner = winners[0]\r\n else: \r\n scoreWinners = {}\r\n for w in winners:\r\n scoreWinners[ w ] = 0\r\n\r\n for i in games:\r\n name = i[0]\r\n if name in winners:\r\n score = i[1]\r\n scoreWinners[name] += score\r\n if scoreWinners[name] >= winnerScore:\r\n winner = name\r\n break\r\n print( winner )\r\nif __name__ == \"__main__\":\r\n main() \r\n \r\n\r\n\r\n \r\n", "n = int(input())\r\na = [input().split(' ') for x in range(0, n)]\r\n \r\nr = {}\r\nb = []\r\n \r\nfor i in range(0, n):\r\n x, y = a[i]\r\n y = int(y)\r\n if x in r.keys():\r\n r[x] += y\r\n else:\r\n r[x] = y\r\n b.append((x, r[x]))\r\n \r\nmx = max(r.values())\r\n \r\nfor x, p in b:\r\n if p >= mx and r[x] == mx:\r\n print(x)\r\n break", "a,r,n=[],{},int(input())\r\nfor i in range(n):\r\n aa,b=input().split()\r\n b=int(b)\r\n r[aa]=r.get(aa,0)+b\r\n a.append([r[aa],aa])\r\n m = max(r.values())\r\nfor n, aa in a:\r\n if n >= m and r[aa] >= m:\r\n print(aa)\r\n break", "n = int(input())\r\nlist = {}\r\nstored = []\r\nwinnerlist = {}\r\nmax = 0\r\nwinner = ''\r\n\r\nfor x in range(n):\r\n line = input().split()\r\n stored.append(line)\r\n name = line[0]\r\n score = int(line[1])\r\n if not name in list:\r\n list[name] = score\r\n else:\r\n list[name] += score\r\n\r\nfor name, score in list.items():\r\n if score > max:\r\n max = score\r\n\r\nfor name, score in list.items():\r\n if score == max:\r\n winnerlist[name] = 0\r\n\r\nif len(winnerlist) == 1:\r\n for name, score in winnerlist.items():\r\n print(name)\r\n break\r\nelse:\r\n for line in stored:\r\n if line[0] in winnerlist:\r\n winnerlist[line[0]] += int(line[1])\r\n if winnerlist[line[0]] >= max:\r\n print(line[0])\r\n break", "winner = \"\"\r\nmembers = []\r\nscore = []\r\nt = []\r\nperson = []\r\nn = int(input())\r\nfor _ in range(n):\r\n name, point = [i for i in input().split()]\r\n point = int(point)\r\n t.append([name, point])\r\n if name not in members:\r\n members.append(name)\r\n score.append(point)\r\n else:\r\n score[members.index(name)] += point\r\nmx = max(score)\r\nfor i in range(len(members)):\r\n if score[i] == mx:\r\n person.append(members[i])\r\nmembers = []\r\nscore = []\r\nfor i in range(n):\r\n name, point = t[i][0], t[i][1]\r\n if name not in members:\r\n members.append(name)\r\n score.append(point)\r\n else:\r\n score[members.index(name)] += point\r\n if max(score) >= mx and members[score.index(max(score))] in person:\r\n winner = members[score.index(max(score))]\r\n break\r\nprint(winner)", "from collections import defaultdict\r\n\r\ntotal_score, rounds, max_score = defaultdict(int), [], 0\r\n\r\nfor _ in range(int(input())):\r\n name, score = input().split()\r\n total_score[name] += int(score)\r\n rounds.append((name, total_score[name]))\r\n\r\nmax_score = max(total_score.values())\r\n\r\nfor name, score in rounds:\r\n if score >= max_score and total_score[name] == max_score:\r\n print(name)\r\n break", "all_members = {}\nfirst = ''\nmem = {}\nn = int(input())\nlst = [input() for i in range(n)]\nfor i in range(n):\n name, score = lst[i].split()\n if name not in all_members:\n all_members[name] = int(score)\n else:\n all_members[name] += int(score)\n f = max(all_members, key=all_members.get)\n \n \n if first == '':\n first = f\n elif all_members[f] > all_members[first]:\n first = max(all_members, key=all_members.get)\n\nmaxx = all_members[first] \nfor q in all_members:\n if all_members[q] == maxx:\n mem[q] = 0\n\nfor j in range(n):\n name, score = lst[j].split()\n if name in mem:\n mem[name] += int(score)\n else:\n continue\n if mem[name] >= maxx:\n print(name)\n break\n", "import math\r\nmp=dict()\r\nmp2=dict()\r\ns=list()\r\nn=int(input())\r\narr=list()\r\narr2=list()\r\ni=0\r\nk=n\r\nwhile k:\r\n k-=1\r\n ss=input()\r\n s+=ss.split()\r\nk=n\r\nfor id in range(len(s)):\r\n if id%2!=0:\r\n continue\r\n if s[id] in mp:\r\n #if arr[mp[s[0]]]>=max(arr):\r\n arr[mp[s[id]]]+=int(s[id+1])\r\n \"\"\"else:\r\n arr[mp[s[0]]]+=int(s[1])\r\n arr.insert(i,arr[mp[s[0]]])\r\n arr[mp[s[0]]]=-10000000000000000000000\r\n mp[s[0]]=i\r\n i+=1\r\n \"\"\"\r\n else:\r\n mp[s[id]]=i\r\n arr.insert(i,int(s[id+1]))\r\n i+=1\r\n\r\nmax1=max(arr)\r\nf=False\r\nmaxid=arr.index(max(arr))\r\n\r\nfor idx in range(len(arr)):\r\n if arr[idx]==max1 and idx!=maxid:\r\n f=True\r\n break\r\n\r\nif f==False:\r\n print(list(mp.keys())[list(mp.values()).index(arr.index(max(arr)))])\r\nelse:\r\n i=0\r\n for id in range(len(s)):\r\n if id%2!=0:\r\n continue\r\n if s[id] in mp2:\r\n arr2[mp2[s[id]]]+=int(s[id+1])\r\n if arr2[mp2[s[id]]]>=max1 and arr[mp[s[id]]]==max1:\r\n print(s[id])\r\n break\r\n else:\r\n mp2[s[id]]=i\r\n arr2.insert(i,int(s[id+1]))\r\n if arr2[i]>=max1 and arr[mp[s[id]]]==max1:\r\n print(s[id])\r\n break\r\n i+=1\r\n \r\n", "a = []\r\nd = {}\r\nfor t in range(int(input())):\r\n name, score = input().split()\r\n d[name] = d.get(name, 0) + int(score)\r\n a.append((name, d[name]))\r\nm = int(max(d.values()))\r\nfor i, j in a:\r\n if j >= m and d[i] == m:\r\n print(i)\r\n break", "n=int(input())\nx={}\ny=-10000\nfor i in range(n):\n s=input().split()\n if(s[0] in x):\n x[s[0]][0].append(int(s[1]))\n x[s[0]][1].append(i+1)\n \n else:\n x[s[0]]=[[int(s[1])],[i+1]]\n\nwinners=[]\ny=0\nfor i in x:\n a=sum(x[i][0])\n if(a>y):\n y=a\n\nfor i in x:\n a=sum(x[i][0])\n if(a==y):\n winners.append(i)\nk=1000000\nfor i in winners:\n u=len(x[i][0])\n summ=0\n for j in range(u):\n summ+=x[i][0][j]\n if(summ>=y):\n if(x[i][1][j]<k):\n k=x[i][1][j]\n d=i\n break\n\nprint(d)\n", "# again WA\r\n\r\nn = int(input())\r\nmp = dict()\r\nrmp = dict()\r\nmaxx = -10000\r\n\r\nfor i in range(n):\r\n lst = input().split(' ')\r\n cname = lst[0]\r\n score = int(lst[1])\r\n \r\n if cname in mp:\r\n mp[cname] += score\r\n else:\r\n mp[cname] = score\r\n \r\n score = mp[cname]\r\n maxx=max(maxx,score)\r\n if score in rmp:\r\n if cname not in rmp[score]:\r\n rmp[score][cname] = i\r\n else:\r\n rmp[score] = dict()\r\n rmp[score][cname] = i\r\n\r\n\r\nfor i in range(maxx-1,0,-1):\r\n if i not in rmp:\r\n rmp[i] = rmp[i+1]\r\n else:\r\n for x in rmp[i+1]:\r\n if x in rmp[i]:\r\n rmp[i][x] = min(rmp[i][x],rmp[i+1][x])\r\n else:\r\n rmp[i][x] = rmp[i+1][x]\r\n# print(mp)\r\n# print(rmp)\r\nmaxx = -10000\r\nlst = []\r\nfor x in mp:\r\n if mp[x]>maxx:\r\n maxx = mp[x]\r\n lst = []\r\n lst.append(x)\r\n elif mp[x] == maxx:\r\n lst.append(x)\r\n\r\nminn = 100000\r\nif len(lst)>1:\r\n for cname in lst:\r\n if rmp[maxx][cname] < minn:\r\n minn = rmp[maxx][cname]\r\n name = cname\r\nelse:\r\n name = lst[0]\r\nprint(name,end = \"\")", "scores = dict()\r\nrounds = []\r\nfor i in range(int(input())):\r\n temp = input().split()\r\n player, points = temp[0], int(temp[1])\r\n rounds.append((player, points))\r\n if player in scores: scores[player] += points\r\n else: scores[player] = points\r\nmax_score = max(scores.values())\r\ntemp_scores = dict()\r\nfor player, points in rounds:\r\n if player in temp_scores: temp_scores[player] += points\r\n else: temp_scores[player] = points\r\n if temp_scores[player] >= max_score == scores[player]:\r\n print(player)\r\n break", "import re\nfrom functools import reduce\n\n\nre_register_score = re.compile(r'(\\w+) (-?\\d+)')\nn = int(input())\nmax_score = -1\nmax_name = ''\nplayer_score_list = {}\nscore_list = []\n\n\nwhile n:\n n-=1\n register_score = re_register_score.match(input().strip()).group\n # reading score\n if player_score_list.__contains__(register_score(1)):\n player_score_list[register_score(1)] += int(register_score(2))\n else:\n player_score_list[register_score(1)] = int(register_score(2))\n score_list.append((register_score(1), player_score_list[register_score(1)]))\n\nmax_score = max(player_score_list.values())\nfor turn in score_list:\n if turn[1] >= max_score and player_score_list[turn[0]] == max_score:\n print(turn[0])\n break\n", "import sys\r\n\r\nfor line in sys.stdin:\r\n n = int(line.strip())\r\n s, a = [], []\r\n mp = {}\r\n for i in range(n):\r\n si, ai = input().split()\r\n s.append(si)\r\n a.append(int(ai))\r\n if si not in mp:\r\n mp[si] = 0\r\n mp[si] += a[i]\r\n mx = max(mp.values())\r\n mp2 = {}\r\n ans = \"\"\r\n for i in range(n):\r\n if s[i] not in mp2:\r\n mp2[s[i]] = 0\r\n mp2[s[i]] += a[i]\r\n if mp2[s[i]] >= mx and mp[s[i]] == mx:\r\n ans = s[i]\r\n break\r\n print(ans)\r\n", "nrounds = int(input())\r\n\r\nrounds = []\r\nfor i in range(nrounds):\r\n rounds.append(input().split())\r\n rounds[i][1] = int(rounds[i][1])\r\n\r\nplayers = []\r\nscores = []\r\nfor i in rounds:\r\n #refresh scoreboard\r\n if i[0] in players:\r\n for j in range(len(players)):\r\n if i[0] == players[j]:\r\n scores[j] += i[1]\r\n break\r\n else:\r\n ppos = len(players)\r\n players.append(i[0])\r\n scores.append(i[1])\r\n\r\nbestplayers = []\r\nbestscores = []\r\nmaxn = max(scores)\r\nfor i in range(len(scores)):\r\n if maxn == scores[i]:\r\n bestplayers.append(players[i])\r\n bestscores.append(0)\r\nif len(bestplayers) == 1:\r\n for i in range(len(scores)):\r\n if scores[i] == maxn:\r\n print(players[i])\r\nelse:\r\n for i in range(len(rounds)):\r\n posj = 0\r\n if rounds[i][0] in bestplayers:\r\n for j in range(len(bestplayers)):\r\n if rounds[i][0] == bestplayers[j]:\r\n posj = j\r\n bestscores[j] += rounds[i][1]\r\n break\r\n if bestscores[posj] >= maxn:\r\n print(bestplayers[posj])\r\n break\r\n ", "'''\r\nJana Goodman\r\n2A: Winner\r\n'''\r\n\r\nimport sys\r\nimport collections\r\n\r\ndef winner(lines):\r\n data = [line.strip().split(' ') for line in lines]\r\n rounds = list()\r\n final_scores = collections.defaultdict(lambda: 0)\r\n for name, score in [[d[0], int(d[1])] for d in data]:\r\n final_scores[name] += score\r\n rounds.append([name, final_scores[name]])\r\n# for name, score in final_scores.items():\r\n# print(name, score)\r\n# print(rounds)\r\n max_score = max(final_scores.values())\r\n rounds = [[name, score] for name, score in rounds\r\n if final_scores[name] == max_score]\r\n for name, score in rounds:\r\n if score >= max_score:\r\n return name\r\n\r\n\r\nif __name__ == '__main__':\r\n n = int(sys.stdin.readline().strip())\r\n lines = [sys.stdin.readline().strip() for _ in range(0, n)]\r\n print(winner(lines))\r\n", "k = int(input())\r\nd = {}\r\nl = [[]]*k\r\nfor i in range(k):\r\n n,s = input().split()\r\n s = int(s)\r\n x = d.get(n,0)\r\n x += s\r\n d[n] = x\r\n l[i]=[n,x]\r\nm = max(d.values())\r\nfor n,x in l:\r\n if d[n]==m and x>=m :\r\n print(n)\r\n break", "\nrounds = int(input())\nsocore = {}\n\nround_list = []\n\nfor i in range(rounds):\n name, point = input().split()\n point = int(point)\n socore[name] = socore.get(\n name, []) + [[socore.get(name, [[0, -1]])[-1][0] + point, i]]\n round_list += [(name, point)]\n\nmax_socore = max(socore.values(), key=lambda x: x[-1][0])[-1][0]\n\n# max_socore = max(socore.items(), key=lambda x: x[1])[1]\n\ncandidates = [name for name, point_list in socore.items()\n if point_list[-1][0] == max_socore]\n\nif len(candidates) == 1:\n print(candidates[0])\nelse:\n least_round = float(\"inf\")\n for name in candidates:\n for history in socore[name]:\n if history[0] >= max_socore and history[1] < least_round:\n least_round = history[1]\n winner = name\n print(winner)\n", "n=int(input())\r\nd={}\r\ntemp=0\r\nans=''\r\nnm=[]\r\nsc=[]\r\nl=[]\r\nfor i in range(n):\r\n name,s=map(str,input().split())\r\n res=int(s)\r\n nm+=[name]\r\n sc+=[res]\r\n if(name not in d.keys()):\r\n d[name]=res\r\n else:\r\n d[name]+=res\r\n '''if(d[name]>temp):\r\n temp=d[name]\r\n ans=name'''\r\nmx=max(d.values())\r\nfor i in d.keys():\r\n if(d[i]==mx):\r\n l+=[i]\r\ndi={}\r\nfor i in range(n):\r\n if(nm[i] in l):\r\n if nm[i] not in di.keys():\r\n di[nm[i]]=sc[i]\r\n else:\r\n di[nm[i]]+=sc[i]\r\n if(di[nm[i]]>=mx):\r\n print(nm[i])\r\n break", "from collections import defaultdict\nn = int(input())\nd = defaultdict(int)\na = []\nfor i in range(n):\n name, score = input().split()\n score = int(score)\n d[name] += score\n a.append((name, score))\nm = max(d.values())\ndd = defaultdict(int)\nfor name, score in a:\n if d[name] < m:\n continue\n dd[name] += score\n if dd[name] >= m:\n print(name)\n break\n", "list_rounds = []\r\nd_gamers = {}\r\nwinners = []\r\n\r\nfor item in range(int(input())):\r\n name, score = input().split()\r\n score = int(score)\r\n if name in d_gamers:\r\n d_gamers[name] += score\r\n else:\r\n d_gamers[name] = score\r\n list_rounds.append([name, score])\r\n\r\n\r\nmax_score = max(d_gamers.values())\r\n\r\nfor item in d_gamers:\r\n if d_gamers[item] == max_score:\r\n winners.append(item)\r\n d_gamers[item] = 0\r\n\r\nif len(winners) == 1:\r\n print(winners[0])\r\nelse:\r\n for n, s in list_rounds:\r\n d_gamers[n] += s\r\n if n in winners and d_gamers[n] >= max_score:\r\n print(n)\r\n break\r\n", "n = int(input())\r\nscore_board = dict() #key = name, value = score\r\ntime_record = dict() #key = round_no, value = name, score\r\n\r\nfor round_no in range(n):\r\n\tname, score = input().split()\r\n\tif name in score_board.keys():\r\n\t\tscore_board[name] = score_board[name] + int(score)\r\n\telse:\r\n\t\tscore_board[name] = int(score)\r\n\ttime_record[round_no] = [name, score_board[name]]\r\n\r\nmax_points = 0\r\nfor name in score_board.keys():\r\n\tif score_board[name] > max_points:\r\n\t\tmax_points = score_board[name]\r\n\r\nmin_round = n\r\nfor name in score_board.keys():\r\n\tif score_board[name] == max_points:\r\n\t\tfor round_no in range(n):\r\n\t\t\tif time_record[round_no][0] == name and time_record[round_no][1] >= max_points and round_no < min_round:\r\n\t\t\t\tmin_round = round_no\r\n\t\t\t\twinner = name\r\n\r\n#print(score_board)\r\n#print(time_record)\r\nprint(winner)", "def get(value, arr):\r\n last = arr[-1]\r\n if last[0] >= value:\r\n for row in arr[:-1]:\r\n if row[0] >= value:\r\n return (last[0], row[1])\r\n return last\r\n return (0, 0)\r\n \r\n \r\nn = int(input())\r\nh = {}\r\n\r\nfor i in range(n):\r\n name, score = input().split()\r\n score = int(score)\r\n\r\n tmp = h.get(name, [(0, 0)])\r\n last = tmp[-1]\r\n new = last[0] + score\r\n \r\n tmp.append((new, i))\r\n h[name] = tmp\r\n\r\nmax_value = [0, 0]\r\nmax_name = \"\"\r\n\r\nmm = 0\r\nfor name, v in h.items():\r\n if v[-1][0] > mm:\r\n mm = v[-1][0]\r\n\r\nfor name, v in h.items():\r\n value = get(mm, v)\r\n if (value[0] > max_value[0] or (value[0] == max_value[0] and value[1] < max_value[1])):\r\n max_name = name\r\n max_value = value\r\n\r\nprint(max_name)\r\n\r\n", "n = int(input())\nd = {}\nfor i in range(n):\n name, score = input().split(maxsplit=1)\n score = int(score)\n if name in d:\n d[name][0]+=score \n d[name][1].append(score)\n d[name][2].append(i)\n else:\n d[name] = [score, [score], [i]]\n\nmx = 0\nfor i in d:\n mx = max(mx, d[i][0])\n\nl = []\nfor i in d:\n if d[i][0]==mx:\n l.append(i)\n\nans = \"\"\nindex = float('inf')\nfor i in l:\n score_list = d[i][1]\n s = 0\n ind = 0\n for j in range(len(score_list)):\n s+=score_list[j]\n ind = d[i][2][j]\n if s>=mx:\n break\n if ind<index:\n index = ind\n ans = i \n\nprint(ans)\n \n\n\n\n\n \n\n\t \t \t \t\t \t \t \t \t\t\t\t\t \t \t\t", "score = {}\r\nevents = []\r\ncases = input()\r\nfor i in range(int(cases)):\r\n w = input().split()\r\n score[w[0]] = score.get(w[0],0) + int(w[1])\r\n events.append([w[0], score[w[0]]])\r\n\r\nmaxScore = 0\r\nmaxPlayers = []\r\nfor player, score in score.items():\r\n if maxScore < score:\r\n maxPlayers.clear()\r\n maxPlayers.append(player)\r\n maxScore = score\r\n if maxScore == score:\r\n maxPlayers.append(player)\r\n\r\nscore = {}\r\nfor event in events:\r\n p = event[0]\r\n s = event[1]\r\n if p in maxPlayers:\r\n if maxScore <= s:\r\n print(p)\r\n break", "n = int(input())\r\nboard = {}\r\nwiners = []\r\nfor i in range(n):\r\n name, score = input().split()\r\n score = int(score)\r\n board[name] = board.get(name, 0) + score\r\n winers.append([name, board[name]])\r\n\r\nt = max(board.values())\r\n\r\nfor i, j in winers:\r\n if j >= t and board[i] == t:\r\n print(i)\r\n exit(0)\r\n", "n=int(input())\r\ntotalscore={}\r\ntotalscore1={}\r\nmaxscore=-1000001\r\nname=[]\r\nscore=[]\r\nfor i in range(n):\r\n [l1,l2]=[j for j in input().split()]\r\n l2=int(l2)\r\n name.append(l1)\r\n score.append(l2)\r\n totalscore[l1]=totalscore.get(l1,0)+l2\r\nfor i in totalscore.keys():\r\n if totalscore[i]>maxscore:\r\n maxscore=totalscore[i]\r\nfor i in range(len(name)):\r\n if totalscore[name[i]]==maxscore:\r\n totalscore1[name[i]]=totalscore1.get(name[i],0)+score[i]\r\n if totalscore1[name[i]]>=maxscore:\r\n print(name[i])\r\n break", "n=int(input())\r\nstu=['']*n\r\nsc=[0]*n\r\nfor i in range(n):\r\n stu[i],s=map(str,input().split())\r\n sc[i]=int(s)\r\n\r\nscore={}\r\nfor i in range(n):\r\n if stu[i] in score:\r\n score[stu[i]]+=sc[i]\r\n else:\r\n score[stu[i]]=sc[i]\r\n\r\nmaxn=0\r\nfor student in score:\r\n maxn=max(maxn,score[student])\r\n\r\nscore2={}\r\nfor i in range(n):\r\n if stu[i] in score2:\r\n score2[stu[i]]+=sc[i]\r\n else:\r\n score2[stu[i]]=sc[i]\r\n if score[stu[i]]==maxn and score2[stu[i]]>=maxn:\r\n print(stu[i])\r\n import sys\r\n sys.exit()\r\n\r\n\r\n\r\n", "scores, jugadas = {}, []\r\nfor i in range(int(input())):\r\n # print(\"Hola\")\r\n data = input().split(\" \")\r\n name, score = data[0], int(data[1])\r\n scores[name] = scores.get(name, 0)+score\r\n jugadas += [(name, scores[name])] # Puntaje acumulado\r\nmaximo = max(scores.values())\r\nprint([name for name, score in jugadas if scores[name]\r\n == maximo and score >= maximo][0])", "n=int(input())\r\na={}\r\nmaxi=-1000\r\nb=[]\r\nfor i in range (n):\r\n name, score=input().split()\r\n score=int(score)\r\n if name in a.keys():\r\n a[name]+=score\r\n else:\r\n a[name]=score\r\n b.append([name,a[name]])\r\nmaxi=max(a.values())\r\nfor c,d in b:\r\n if d>=maxi and a[c]==maxi:\r\n print(c)\r\n break", "from collections import defaultdict\nfrom copy import copy\n\ndef get_max(point_dict):\n sorted_points = sorted([(x, y) for x, y in point_dict.items()], key=lambda x : x[1], reverse=True)\n return sorted_points[0][1]\n\nif __name__ == '__main__':\n n = int(input())\n point_dict = defaultdict(int)\n history = []\n for i in range(n):\n name, points = input().split(\" \")\n point_dict[name] += int(points)\n history.append(copy(point_dict))\n current_max = get_max(point_dict)\n candidates = [x[0] for x in point_dict.items() if x[1] == current_max]\n for h in history:\n for c in candidates:\n if h[c] >= current_max:\n print(c)\n exit(0)\n", "p = []\r\nr = {}\r\nn = int(input())\r\nfor i in range(n):\r\n a, b = input().split();\r\n b = int(b);\r\n r[a] = r.get(a,0) + b;\r\n p.append([r[a],a]);\r\n m = max(r.values())\r\nfor n,a in p :\r\n if n>=m and r[a]>=m :\r\n print(a)\r\n break\r\n", "n = int(input())\r\n\r\nscores = {} # {name, score}\r\nchange_log = {} # {i, [name, total_score]}\r\n\r\nfor i in range(n):\r\n name, points = input().split()\r\n scores[name] = scores.get(name, 0) + int(points)\r\n change_log[i] = [name, scores[name]]\r\n\r\nhighest = max(scores.values())\r\nfor i in range(n):\r\n if scores[change_log[i][0]] == highest and change_log[i][1] >= highest:\r\n print(change_log[i][0])\r\n break\r\n", "scores = {}\r\nmoves = []\r\nn = int(input())\r\nfor i in range(n):\r\n s = input().split(' ')\r\n moves.append([s[0], int(s[1])])\r\n if s[0] in scores.keys():\r\n scores[s[0]] += int(s[1])\r\n else:\r\n scores[s[0]] = int(s[1])\r\n\r\nwinner = max(scores, key=lambda x: scores[x])\r\nm = scores[winner]\r\n\r\nif list(scores.values()).count(m) == 1:\r\n print(winner)\r\n\r\nelse:\r\n winners = [person for person in scores.keys() if scores[person] == m]\r\n scores = {}\r\n for move in moves:\r\n if move[0] in scores.keys():\r\n scores[move[0]] += int(move[1])\r\n else:\r\n scores[move[0]] = int(move[1])\r\n if scores[move[0]] >= m and move[0] in winners:\r\n print(move[0])\r\n break", "n = int(input())\r\nb = {}\r\na = []\r\nfor i in range(n):\r\n name, score = input().split(' ')\r\n b[name] = b.get(name, 0) + int(score)\r\n a.append((name, b[name]))\r\n\r\nmax = max(b.values())\r\nfor i, j in a:\r\n if j >= max and b[i] == max:\r\n print(i)\r\n break", "l = [input().split() for i in range(int(input()))]\r\nd = {}\r\nfor x,y in l:\r\n d[x] = d.get(x,0) + int(y)\r\n\r\nw = max(d.values())\r\ns = {}\r\nfor x,y in l:\r\n s[x] = s.get(x,0) + int(y)\r\n if s[x] >= w and d[x] == w:\r\n print(x)\r\n break", "chels = {}\r\nhistore = []\r\n\r\nn = int(input())\r\nfor i in range(n):\r\n name, m = input().split()\r\n chels[name] = chels.get(name, 0) + int(m)\r\n histore.append([name, chels[name]])\r\n\r\nmax_num = max(chels.values())\r\ncount = len(list(filter(lambda x: x == max_num, chels.values()))) > 1\r\nnames = list(filter(lambda x: chels[x] == max_num, chels.keys()))\r\n\r\n# print(*histore, sep='\\n')\r\n# print(chels)\r\n\r\nfor name, num in histore:\r\n if num == max_num or (num > max_num and count and name in names):\r\n print(name)\r\n break\r\n", "import sys\r\nfrom collections import defaultdict\r\n\r\n\r\ndef find_max():\r\n max_score = 0\r\n for name, score in total_score.items():\r\n if score > max_score:\r\n max_score = score\r\n return max_score\r\n\r\n\r\ndef find_max_players():\r\n max_score = find_max()\r\n max_names = set()\r\n for name, score in total_score.items():\r\n if score == max_score:\r\n max_names.add(name)\r\n return max_names, max_score\r\n\r\n\r\nin_f = sys.stdin.read(-1).replace(\"\\r\\n\", \"\\r\")\r\nin_f = in_f.split()\r\n\r\nn = int(in_f[0])\r\ntotal_score = defaultdict(lambda: 0) # TOTAL SCORE OF EACH PLAYER\r\nfor i in range(1, 2 * n, 2):\r\n name, score = in_f[i], int(in_f[i+1])\r\n total_score[name] += score\r\nmax_names, max_score = find_max_players()\r\n\r\ntotal_score = defaultdict(lambda: 0)\r\nfor i in range(1, 2 * n, 2):\r\n name, score = in_f[i], int(in_f[i+1])\r\n total_score[name] += score\r\n if name in max_names and total_score[name] >= max_score:\r\n print(name)\r\n break\r\n", "__author__ = 'Utena'\r\nimport heapq\r\nscore=dict()\r\nscore1=dict()\r\nnames=[]\r\nps=[]\r\nplayer=[]\r\nwins=set()\r\nn=int(input())\r\nfor i in range(n):\r\n name,p=input().split()\r\n p=int(p)\r\n names.append(name)\r\n ps.append(p)\r\nfor i in range(n):\r\n if names[i] in score:\r\n score[names[i]]=score[names[i]]+ps[i]\r\n else:\r\n score[names[i]]=ps[i]\r\n heapq.heappush(player,(score[names[i]]*(-1),names[i]))\r\nmax=max(score.values())\r\nfor i in range(n):\r\n if names[i] in score1:\r\n score1[names[i]]=score1[names[i]]+ps[i]\r\n else:\r\n score1[names[i]]=ps[i]\r\n if score1[names[i]]>=max and score[names[i]]==max:\r\n print(names[i])\r\n break", "p,r,n=[],{},int(input())\r\nfor i in range(n):a,b=input().split();b=int(b);r[a]=r.get(a,0)+b;p.append([r[a],a]);m = max(r.values())\r\nfor n, a in p:\r\n if n >= m and r[a] >= m:\r\n print(a)\r\n break", "import sys\r\ninput = sys.stdin.readline\r\nI = lambda : list(map(int,input().split()))\r\n\r\nn = int(input())\r\ncurrmax=0\r\nwinner=''\r\nl=[]\r\nfor i in range(n):\r\n k,x = map(str,input().split())\r\n l.append([k,int(x),i])\r\nf = dict.fromkeys([i[0] for i in l],0)\r\nx = dict.fromkeys([i[0] for i in l],0)\r\nind =[]\r\nfor k in l:\r\n f[k[0]]+=k[1]\r\ncurrmax=max(f.values())\r\nfor k in l:\r\n\tx[k[0]]+=k[1]\r\n\tif x[k[0]]>=currmax and f[k[0]]==currmax:\r\n\t\twinner = k[0]\r\n\t\tbreak\r\nprint(winner)", "n = int(input())\r\n\r\nd, l, m = {}, [], None\r\n\r\nfor i in range(n):\r\n [name, score] = input().split()\r\n score = int(score)\r\n\r\n if name in d:\r\n d[name] += score\r\n else:\r\n d[name] = score\r\n\r\n l.append([name, d[name]])\r\n\r\nm = max(d.values())\r\n\r\nfor [win, s] in l:\r\n if d[win] == m and s >= m:\r\n print(win)\r\n break\r\n", "def main():\r\n n = int(input())\r\n scores = {}\r\n rounds = []\r\n for i in range(n):\r\n round = input()\r\n rounds.append(round)\r\n name, val = round.split()\r\n if name in scores:\r\n scores[name] += int(val)\r\n else:\r\n scores[name] = int(val)\r\n\r\n\r\n max_score = max(scores.values())\r\n count = 0\r\n for name in scores:\r\n if scores[name] == max_score:\r\n count +=1\r\n lead = name\r\n if count == 1:\r\n print(lead)\r\n return\r\n\r\n recount = {}\r\n for i in range(n):\r\n round = rounds[i]\r\n name, val = round.split()\r\n if name in recount:\r\n recount[name] += int(val)\r\n else:\r\n recount[name] = int(val)\r\n if recount[name] >= max_score and scores[name] == max_score:\r\n print(name)\r\n return\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\nscoresPerPlayer = {}\r\nrounds = {}\r\nfor i in range(n):\r\n line = input().split(\" \")\r\n scoresPerPlayer[line[0]] = scoresPerPlayer[line[0]] + int(line[1]) if line[0] in scoresPerPlayer else int(line[1])\r\n rounds[i] = (line[0], scoresPerPlayer[line[0]])\r\n\r\nmaxScore = 0\r\nmaxPlayers = []\r\nfor n in scoresPerPlayer:\r\n if scoresPerPlayer[n] > maxScore:\r\n maxPlayers = [n]\r\n maxScore = scoresPerPlayer[n]\r\n elif scoresPerPlayer[n] == maxScore:\r\n maxPlayers.append(n)\r\n\r\nif len(maxPlayers) == 1:\r\n print(maxPlayers[0])\r\nelse:\r\n for r in rounds:\r\n if rounds[r][0] in maxPlayers and rounds[r][1] >= maxScore:\r\n print(rounds[r][0])\r\n break;", "n =int(input())\r\n\r\nx = []\r\ny = []\r\n\r\nfor i in range(n):\r\n\tname,points = map(str,input().split())\r\n\tx.append(name)\r\n\ty.append(int(points))\r\n\r\n\r\nd = {}\r\n\r\nfor N,p in zip(x,y):\r\n\tif N in d:\r\n\t\td[N]+=p\r\n\telse:\r\n\t\td[N]=p\r\n\r\n\r\n\r\nd1 = {}\r\n\r\n\r\nmx = 0\r\n\r\nfor i in range(n):\r\n\tmx = max(mx,d[x[i]])\r\n\r\n\r\nfor i in range(n):\r\n\tif x[i] in d1: \r\n\t\td1[x[i]] +=y[i]\r\n\telse:\r\n\t\td1[x[i]] = y[i]\r\n\r\n\tif d1[x[i]]>=mx and d[x[i]]==mx:\r\n\t\tprint(x[i])\r\n\t\tbreak\r\n\r\n", "from math import inf\r\nn = int(input())\r\nrounds = []\r\nfor i in range(n):\r\n a,b = input().split()\r\n rounds.append([a,int(b)])\r\ntot_scores = {}\r\nfor i in range(n):\r\n move = rounds[i]\r\n tot_scores[move[0]] = tot_scores.get(move[0],0) + move[1]\r\nm = -inf\r\nfor player in tot_scores:\r\n m = max(m, tot_scores[player])\r\npos_winners = set()\r\nfor player in tot_scores:\r\n if tot_scores[player] == m:\r\n pos_winners.add(player)\r\nscores = {}\r\nfor i in range(n):\r\n move = rounds[i]\r\n scores[move[0]] = scores.get(move[0],0) + move[1]\r\n if scores[move[0]] >= m and move[0] in pos_winners:\r\n print(move[0])\r\n break\r\n\r\n", "scores, jugadas = {}, []\r\nfor i in range(int(input())):\r\n # print(\"Hola\")\r\n data = input().split(\" \")\r\n name, score = data[0], int(data[1])\r\n scores[name] = scores.get(name, 0)+score\r\n jugadas += [(name, scores[name])] # Puntaje acumulado\r\nmaximo = max(scores.values())\r\nfor name, score in jugadas:\r\n if scores[name] == maximo and score >= maximo:\r\n print(name)\r\n break\r\n", "import sys\r\n\r\ndef answer(n, name, score):\r\n d = dict()\r\n for i in range(n):\r\n if name[i] in d:\r\n d[name[i]] += score[i]\r\n else:\r\n d[name[i]] = score[i]\r\n mx_val = max(d.values())\r\n winners = set()\r\n for k in d:\r\n if d[k] == mx_val:\r\n winners.add(k)\r\n \r\n d = dict()\r\n for w in winners:\r\n d[w] = 0\r\n \r\n for i in range(n):\r\n if name[i] not in winners:\r\n continue\r\n d[name[i]] += score[i]\r\n if d[name[i]] >= mx_val:\r\n return name[i]\r\n \r\n\r\ndef main():\r\n n = int(sys.stdin.readline())\r\n name = ['x' for _ in range(n)]\r\n score = [0 for _ in range(n)]\r\n for i in range(n):\r\n name[i], score[i] = sys.stdin.readline().split()\r\n score[i] = int(score[i])\r\n print(answer(n, name, score))\r\n return\r\nmain()", "n = int(input())\r\nd = {}\r\nl = []\r\n\r\nfor i in range(n):\r\n x , y = input().split()\r\n d[x] = d.get(x , 0) + int(y)\r\n l.append([x , d[x]])\r\n\r\nm = max(d.values())\r\n\r\nfor i , j in l :\r\n if d[i] == m and int(j) >= m :\r\n print(i)\r\n break\r\n", "from sys import stdin\r\ninput = lambda: stdin.readline().rstrip('\\r\\n')\r\n\r\nn=int(input())\r\n\r\np,q=[],{}\r\n\r\nfor _ in range(n):\r\n a,b = input().split()\r\n q[a] = q.get(a,0)+int(b)\r\n p.append([a,q[a]])\r\n\r\nmaxi = max(q.values())\r\n\r\nfor i,j in p:\r\n if q[i]==maxi and j>=maxi:\r\n print(i)\r\n break\r\n", "n = int(input())\r\nscores = {}\r\ninputs = []\r\nfor i in range(n):\r\n inp = input().split()\r\n scr = int(inp[1])\r\n inputs.append([inp[0], scr])\r\n if inp[0] in scores:\r\n scores[inp[0]] += scr\r\n else:\r\n scores[inp[0]] = scr\r\nsumscores = {}\r\nmaxscore = max(scores.values())\r\nfor i in range(n):\r\n [a, scr] = inputs[i]\r\n if a in sumscores:\r\n sumscores[a] += scr\r\n else:\r\n sumscores[a] = scr\r\n if sumscores[a] >= maxscore and scores[a] == maxscore:\r\n print(a)\r\n break\r\n", "import sys\r\nimport operator\r\n#sys.stdin = open('input.txt')\r\n\r\nclass Cont:\r\n def __init__(self, name, score):\r\n self.name = name\r\n self.score = score\r\n self.mom = []\r\n\r\nnames_dict = {}\r\nconts = []\r\n\r\nn = int(input())\r\n\r\nfor i in range(n):\r\n name, score = input().split()\r\n v = names_dict.get(name)\r\n if v is None:\r\n v = Cont(name, 0)\r\n names_dict[name] = v\r\n conts.append(v)\r\n\r\n v.score += int(score)\r\n v.mom.append([int(score), i])\r\n\r\nconts.sort(key=operator.attrgetter('score'))\r\n\r\nm = conts[-1].score\r\nresult = conts[-1]\r\nt = 1001\r\ni = len(conts) - 1\r\nwhile conts[i].score == m and i >= 0:\r\n cur = 0\r\n j = 0\r\n while cur < m:\r\n cur += conts[i].mom[j][0]\r\n j += 1\r\n\r\n if conts[i].mom[j - 1][1] < t:\r\n t = conts[i].mom[j - 1][1]\r\n result = conts[i]\r\n i -= 1\r\n\r\nprint(result.name)", "round = int(input())\r\nname_index={}\r\nscores=[]\r\nrounds=[]\r\nfor i in range(round):\r\n name,score=input().split()\r\n score=int(score)\r\n rounds.append([name,score])\r\n if name in name_index:\r\n scores[name_index[name]]+=score\r\n else:\r\n name_index[name]=len(scores)\r\n scores.append(score)\r\nmax_score=max(scores)\r\nname_index={}\r\nscores2=[]\r\nfor i in range(round):\r\n name,score=rounds[i]\r\n if name in name_index:\r\n scores2[name_index[name]]+=score\r\n else:\r\n name_index[name]=len(scores2)\r\n scores2.append(score)\r\n if scores2[name_index[name]]>=max_score and scores[name_index[name]]==max_score:\r\n print(name)\r\n break", "n = int(input())\r\nans = ''\r\nd = {}\r\ns = [''] * 1000\r\nx = [0] * 1000\r\nmx = -10 ** 7\r\nfor i in range(n):\r\n s[i], xx = input().split()\r\n x[i] = int(xx)\r\n if s[i] in d:\r\n d[s[i]] += x[i]\r\n else:\r\n d[s[i]] = x[i]\r\nfor i in d:\r\n mx = max(mx, d[i])\r\ndd = {}\r\nfor i in range(n):\r\n if s[i] in dd:\r\n dd[s[i]] += x[i]\r\n else:\r\n dd[s[i]] = x[i]\r\n if dd[s[i]] >= mx and mx == d[s[i]]:\r\n ans = s[i]\r\n break\r\nprint(ans)", "d,a={},[]\r\nfor _ in range(int(input())):\r\n t,z=input().split();z=int(z);d[t]=d.get(t,0)+z\r\n a.append([t,d[t]])\r\nmx=max(d.values())\r\nfor i,j in a:\r\n if d[i]==mx and j>=mx:\r\n print(i);break", "n = int(input())\r\np = []\r\ns = {}\r\nfor _ in range(n):\r\n name,score = input().split()\r\n score = int(score)\r\n p.append((name,score))\r\n try:\r\n s[name] += score\r\n except:\r\n s[name] = score\r\n\r\nl = s.items()\r\nr = []\r\ncnt = 0\r\nfor i in l:\r\n if i[1] > cnt:\r\n r = [i[0]]\r\n cnt = i[1]\r\n elif i[1] == cnt:\r\n r.append(i[0])\r\n\r\nif len(r) == 1:\r\n print(r[0])\r\nelse:\r\n for i in r:\r\n s[i] = 0\r\n for i in p:\r\n if i[0] in r:\r\n s[i[0]] += i[1]\r\n if s[i[0]] >= cnt:\r\n print(i[0])\r\n break\r\n\r\n \r\n", "nameArray = list()\nsemi_winner = list()\ndict = {}\nmax_score = -100000000\nflag = False\nwinner_name = ''\nfor i in range(int(input())):\n line = input()\n name = line.split(\" \")[0]\n score = int(line.split(\" \")[1])\n if name in dict.keys():\n dict[name] = dict[name]+score\n else :\n dict[name] = score\n\n nameArray.append(name+\":\"+str(dict[name]))\n\nfor name in dict.keys():\n if dict[name]>max_score:\n max_score = dict[name]\n winner_name = name\n flag = False\n if dict[name] == max_score: #means two or more player have same Score\n max_score = dict[name]\n flag = True\n \nif flag == False:\n print(winner_name)\nelse:\n for name in dict.keys():\n if(dict[name] == max_score):\n semi_winner.append(name)\n for player_name in (nameArray):\n score = int(player_name.split(\":\")[1])\n name = player_name.split(\":\")[0]\n if((name in semi_winner) and score >= max_score):\n winner_name = name\n break\n print(winner_name)\n", "n = int(input())\r\n\r\nscores = dict()\r\n\r\ninputs = []\r\nfor pos in range(1, n + 1):\r\n name, score = input().split()\r\n score = int(score)\r\n\r\n inputs.append((name, score))\r\n\r\n scores[name] = scores.get(name, 0) + score\r\n\r\nm = None\r\n\r\nfor score in scores.values():\r\n if m is None or score > m:\r\n m = score\r\n\r\nwinners = set()\r\n\r\nfor name, score in scores.items():\r\n if score == m:\r\n winners.add(name)\r\n\r\nscores = dict()\r\n\r\nmin_pos = None\r\nans = None\r\n\r\nfor pos, curr_input in enumerate(inputs):\r\n name, score = curr_input\r\n\r\n new_score = scores.get(name, 0) + score\r\n scores[name] = new_score\r\n\r\n if name in winners and new_score >= m:\r\n if min_pos is None or pos < min_pos:\r\n min_pos = pos\r\n ans = name\r\n\r\nprint(ans)\r\n", "from collections import defaultdict\r\nn=int(input())\r\n# need max score but less round no.\r\ndata=defaultdict(int)\r\nlogs=[]\r\nfor i in range(n):\r\n name,score=input().split()\r\n score=int(score)\r\n logs.append((name,score))\r\n data[name]+=score\r\nm=max(data.values())\r\ntemp=defaultdict(int)\r\nfor name,score in logs:\r\n temp[name]+=score\r\n if temp[name]>=m and data[name]==m:\r\n print(name)\r\n break", "rounds = int(input())\r\n\r\nscore_maps = {}\r\ngames = []\r\nfor _ in range(rounds):\r\n name, score = input().split()\r\n score = int(score)\r\n if name in score_maps.keys():\r\n score_maps[name] += score\r\n else:\r\n score_maps[name] = score\r\n games.append((name, score_maps[name]))\r\n\r\nmax_score = max(score_maps.values())\r\n\r\nfor name, score in games:\r\n if score >= max_score and score_maps[name]==max_score:\r\n print(name)\r\n break", "import operator\r\nfrom collections import defaultdict, Counter\r\ndata = []\r\noutput_name = []\r\ndata_list= Counter()\r\nn = int(input())\r\nfor i in range(n):\r\n\tname, score = input().split()\r\n\tscore = int(score)\r\n\tdata_list[name] += score\r\n\tdata.append((name, data_list[name]))\r\nmax_value = max(data_list.items(), key=operator.itemgetter(1))[1]\r\ndef name_score(full_list):\r\n\tfor (name, score) in data:\r\n\t\tif score>=max_value and full_list[name]==max_value:\r\n\t\t\treturn output_name.append(name)\r\n\r\nname = name_score(data_list)\r\nprint(output_name[0])", "n = int(input())\r\ndic = {}\r\ndic2 = {}\r\nlis = []\r\nfor i in range(n):\r\n name,y = input().split()\r\n score = int(y)\r\n if name in dic:\r\n dic[name]+=score\r\n else:\r\n dic[name]=score\r\n lis.append((name,score))\r\n \r\nm = max(list(dic.values()))\r\nfor i in range(n):\r\n if lis[i][0] in dic2:\r\n dic2[lis[i][0]]+=lis[i][1]\r\n else:\r\n dic2[lis[i][0]]=lis[i][1]\r\n if dic2[lis[i][0]]>=m and dic[lis[i][0]]==m:\r\n final = lis[i][0]\r\n break\r\nprint(final)", "\ns=[];from collections import Counter\nd=Counter()\nfor _ in range(int(input())):\n s.append(input().split())\nfor i in s:\n d[i[0]]+=int(i[1])\nmx=max(d.values())\nc=Counter()\nfor i in s:\n c[i[0]]+=int(i[1])\n if d[i[0]]==mx and c[i[0]]>=mx:\n print(i[0])\n break\n\n\n", "def is_ok(a, b):\r\n for i in a:\r\n if a[i] >= b:\r\n return i\r\n return False\r\n\r\nn = int(input())\r\ndata = {}\r\ninput_list = []\r\nfor i in range(n):\r\n a, b = input().split()\r\n try:\r\n data[a] += int(b)\r\n except:\r\n data[a] = int(b)\r\n input_list.append([a, int(b)])\r\nm_num = -9999999999999999\r\nfor i in data:\r\n m_num = max(m_num, data[i])\r\ndata_name = {}\r\nfor i in data:\r\n if data[i] == m_num:\r\n data_name[i] = 0\r\n#print(data, data_name)\r\nfor i in range(n):\r\n a, b = input_list[i]\r\n try:\r\n data_name[a] += b\r\n except:\r\n pass\r\n ans = is_ok(data_name, m_num)\r\n if ans is not False:\r\n print(ans)\r\n break", "n=int(input())\r\nt=[]\r\nd={}\r\nfor i in range(n):\r\n name,s=input().split()\r\n if name not in d:\r\n d[name]=int(s)\r\n t.append((name,d[name]))\r\n else:\r\n d[name]+=int(s)\r\n t.append((name,d[name]))\r\n \r\np,s=max(d.items(),key=lambda item:item[1])\r\nfor i in range(n):\r\n if d[t[i][0]]==s and t[i][1]>=s:\r\n print(t[i][0])\r\n break", "def pair(name):\r\n for score,i in history[name].items():\r\n if score >= stand:\r\n return i\r\n break\r\n \r\nn=int(input())\r\nname_list=[]\r\nname_scores={}\r\nhistory={}\r\ni=0\r\nfor _ in range(n):\r\n name_score=input().split()\r\n name=name_score[0]\r\n i+=1\r\n score=int(name_score[1])\r\n if name not in name_scores.keys():\r\n name_scores[name]=score\r\n history[name]={score:i}\r\n else:\r\n name_scores[name]=name_scores[name]+score\r\n history[name].update({name_scores[name]:i})\r\nstand=-1000*n\r\nfor s in name_scores.values():\r\n if s >= stand:\r\n stand=s\r\nname_list=[]\r\nwinner=[]\r\nfor name,score_add in name_scores.items():\r\n if score_add == stand:\r\n winner.append(name)\r\n if len(winner) > 1:\r\n if pair(name) > pair(winner[0]):\r\n winner.pop()\r\n else:\r\n winner.pop(0)\r\nprint(winner[0])", "n = int(input())\r\nd = {}\r\nd1 = {}\r\nl_name = []\r\nl_score = []\r\nmax_value = 0\r\nfor i in range(n) :\r\n name,score = input().split()\r\n score = int(score)\r\n l_name.append(name)\r\n l_score.append(score)\r\n if name not in d :\r\n d[name] = score\r\n else:\r\n aux = d[name]\r\n d[name] = score + aux\r\nall_values = d.values()\r\nmax_d_value = max(all_values)\r\nfor i in range(n):\r\n if l_name[i] not in d1 :\r\n d1[l_name[i]] = l_score[i]\r\n else:\r\n aux = d1[l_name[i]]\r\n d1[l_name[i]] = l_score[i] + aux\r\n if (d1[l_name[i]] >= max_d_value) and (d[l_name[i]] >= max_d_value) :\r\n winner = l_name[i] \r\n break\r\nprint(winner) ", "# Description of the problem can be found at http://codeforces.com/problemset/problem/2/A\n\nn = int(input())\n\nl_k = list()\nfor _ in range(n):\n l_k.append(input().split())\n\nd_s = {}\nfor i in range(n):\n k = l_k[i][0]\n s = int(l_k[i][1])\n \n if k not in d_s:\n d_s[k] = int(s)\n else:\n d_s[k] += int(s)\n\nm = max(d_s[x] for x in d_s)\n\nd_s_2 = {}\nfor i in range(n):\n k = l_k[i][0]\n s = int(l_k[i][1])\n \n if k not in d_s_2:\n d_s_2[k] = int(s)\n else:\n d_s_2[k] += int(s)\n \n if d_s_2[k] >= m and d_s[k] == m:\n print(k)\n quit()\n", "round_number = int(input())\r\nfinal_player_score = {}\r\nlevel_player_score = {}\r\ninput_string = [\"\" for i in range(round_number)]\r\nmax_score = -10001\r\n\r\nfor i in range(round_number):\r\n input_string[i] = input()\r\n name, score = input_string[i].split()\r\n score = int(score)\r\n if name in final_player_score:\r\n final_player_score[name] += score\r\n else:\r\n final_player_score[name] = score\r\n\r\nmax_score = max(final_player_score.values())\r\n \r\nfor i in range(round_number):\r\n name, score = input_string[i].split()\r\n score = int(score)\r\n if name in level_player_score:\r\n level_player_score[name] += score\r\n else:\r\n level_player_score[name] = score\r\n \r\n if final_player_score[name] == max_score and level_player_score[name] >= max_score:\r\n winner = name\r\n break\r\n \r\nprint(winner)\r\n", "n = int(input())\r\n\r\nresult = {}\r\nresult1 = {}\r\nresult2 = {}\r\ntest = []\r\nmax1 = 0\r\n\r\nfor i in range(0, n):\r\n name, scores = map(str, input().split())\r\n score = int(scores)\r\n if name in result:\r\n result[name] += score\r\n else:\r\n result[name] = score\r\n test.append((name, score))\r\n\r\nmax1 = max(result.items(), key=lambda d: d[1])[1]\r\n\r\nfor key in result:\r\n if result[key] == max1:\r\n result1[key] = max1\r\n\r\nfor temp in test:\r\n if temp[0] in result2:\r\n result2[temp[0]] += temp[1]\r\n else:\r\n result2[temp[0]] = temp[1]\r\n if result2[temp[0]] >= max1 and temp[0] in result1:\r\n print(temp[0])\r\n break", "import copy\r\nn = input()\r\nn = int(n)\r\nresult ={}\r\nresults = []\r\nfor i in range(n):\r\n round = input().split()\r\n if round[0] in result.keys():\r\n num = result[round[0]]\r\n num += int(round[1])\r\n result[round[0]] = num\r\n else:\r\n result[round[0]] = int(round[1])\r\n results.append(copy.deepcopy(result))\r\nm = max(results[-1].values())\r\nwinners = []\r\nnames = list(results[-1].keys())\r\nfor name in names:\r\n if results[-1][name] == m:\r\n winners.append(name)\r\nrounds = []\r\nfor winner in winners:\r\n for i in range(n):\r\n if winner in list(results[i].keys()):\r\n if results[i][winner] >= m:\r\n rounds.append(i)\r\n break\r\nfinal = rounds.index(min(rounds))\r\nfinal_winner = winners[final]\r\nprint(final_winner)", "n = int(input())\r\nnames = []\r\nscores = []\r\nfor i in range(n):\r\n name_score = [_ for _ in input().split()]\r\n name = str(name_score[0])\r\n score = int(name_score[1])\r\n names.append(name)\r\n scores.append(score)\r\n\r\nnames_set = set(names)\r\ndict = {_ : 0 for _ in names_set}\r\ndict_ = {_ : 0 for _ in names_set}\r\n\r\nfor i in range(n):\r\n dict[names[i]] += scores[i]\r\n\r\nmax = -1\r\nfor key in dict.keys():\r\n if dict[key] > max:\r\n max = dict[key]\r\n m_key = key\r\n\r\nmaxs = []\r\nfor key in dict.keys():\r\n if dict[key] == max:\r\n maxs.append(key)\r\n\r\nif len(maxs) == 1:\r\n print(m_key)\r\nelse:\r\n for i in range(n):\r\n dict_[names[i]] += scores[i]\r\n if names[i] in maxs and dict_[names[i]] >= max:\r\n print(names[i])\r\n break\r\n #print(maxs)\r\n", "n = int(input())\r\nwinner = ''\r\nscores = {}\r\nmaxScore = 0\r\ninputs = []\r\ntopPlayers = []\r\nfor i in range (n):\r\n inputs.append(input().split())\r\n name, score = inputs[i]\r\n if scores.get(name) == None:\r\n scores[name] = int(score)\r\n else:\r\n scores[name] += int(score)\r\nmaxScore = max(scores.values())\r\nfor name in scores.keys():\r\n if scores[name] == maxScore:\r\n topPlayers.append(name)\r\nscores.clear()\r\nfor i in range (n):\r\n name, score = inputs[i]\r\n if scores.get(name) == None:\r\n scores[name] = int(score)\r\n else:\r\n scores[name] += int(score)\r\n for name_ in scores.keys():\r\n if scores[name_] >= maxScore and name_ in topPlayers:\r\n print(name_)\r\n exit()", "__author__ = 'Darren'\r\n\r\nimport sys\r\n\r\n\r\nstdin = sys.stdin if True else open('data', 'r')\r\n\r\n\r\ndef solve():\r\n n = int(next(stdin))\r\n records = []\r\n while n > 0:\r\n ls = next(stdin).split()\r\n records.append((ls[0], int(ls[1])))\r\n n -= 1\r\n\r\n scoreboard = {}\r\n for record in records:\r\n scoreboard[record[0]] = scoreboard.get(record[0], 0) + record[1]\r\n\r\n leaders = set()\r\n max_score = 0\r\n for name in scoreboard:\r\n if scoreboard[name] > max_score:\r\n max_score = scoreboard[name]\r\n leaders.clear()\r\n leaders.add(name)\r\n elif scoreboard[name] == max_score and name not in leaders:\r\n leaders.add(name)\r\n\r\n if len(leaders) == 1:\r\n print(leaders.pop())\r\n return\r\n\r\n scoreboard.clear()\r\n for record in records:\r\n if record[0] not in leaders:\r\n continue\r\n if record[0] in scoreboard:\r\n scoreboard[record[0]] += record[1]\r\n else:\r\n scoreboard[record[0]] = record[1]\r\n if scoreboard[record[0]] >= max_score:\r\n print(record[0])\r\n return\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()", "from sys import stdin,stdout,setrecursionlimit\nfrom functools import lru_cache, cmp_to_key\nfrom heapq import merge, heapify, heappop, heappush,nlargest\nfrom math import *\nfrom collections import defaultdict as dd, deque, Counter as C\nfrom itertools import combinations as comb, permutations as perm , accumulate\nfrom bisect import bisect_left as bl, bisect_right as br, bisect\nfrom time import perf_counter\nfrom fractions import Fraction\nimport copy\nimport time\nsetrecursionlimit(10**9)\nstarttime = time.time()\nmod = int(pow(10, 9) + 7)\nmod2 = 998244353\n# from sys import stdin\n# input = stdin.readline\n#def data(): return sys.stdin.readline().strip()\n#input=open(\"looking.in\",\"r\")\ndef data(): return input()\ndef num():return int(input())\ndef L(): return list(sp())\ndef LF(): return list(spf())\ndef sl(): return list(ssp())\ndef sp(): return map(int, data().split())\ndef spf(): return map(int, input.readline().split())\ndef ssp(): return map(str, data().split())\ndef l1d(n, val=0): return [val for i in range(n)]\ndef l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\ndef pmat(A):\n for ele in A:\n print(*ele,end=\"\\n\")\ndef pmat2(A):\n for ele in A:\n for j in ele:\n print(j,end='')\n print()\ndef iseven(n):\n return n%2==0\n\ndef seive(r):\n prime=[1 for i in range(r+1)]\n prime[0]=0\n prime[1]=0\n for i in range(r+1):\n if(prime[i]):\n for j in range(2*i,r+1,i):\n prime[j]=0\n return prime\n\n\n#generate all subsets of set with bitmask.\ndef generate_all_sets(n,a):\n big_ans=[]\n for i in range(1<<n):\n ans=[]\n for j in range(n):\n if i&(1<<j):\n ans.append(a[j])\n big_ans.append(ans)\n return big_ans\n#solution\n#ACPC \n# set data structures faster than binary search sometimes\n#bipartite match dfs\n#think in problems with recursive manner.\n#B. Little Elephant and Array preq MO's algorithms.\nn = int(input())\nd, l = {}, []\nfor i in range(n):\n name, score = input().split()\n score = int(score)\n d[name] = d.get(name, 0) + score\n l.append([name, d[name]])\nmax_score = max(d.values())\nfor name, score in l:\n if score >= max_score and d[name] >= max_score:\n print(name)\n break\n\n\nendtime = time.time()\n#print(f\"Runtime of the program is {endtime - starttime}\")", "from collections import defaultdict\r\n\r\nn = int(input())\r\n\r\nplayers = defaultdict(int)\r\nrounds = []\r\n\r\nfor i in range(n):\r\n name, score = input().split()\r\n score = int(score)\r\n\r\n players[name] += score\r\n rounds.append((name, players[name]))\r\n\r\nmax_score = max(players.values())\r\nwinners = [p for p in players if players[p] == max_score]\r\n\r\nif len(winners) == 1:\r\n print(winners[0])\r\nelse:\r\n for name, score in rounds:\r\n if score >= max_score and name in winners:\r\n print(name)\r\n break", "n = int(input())\r\nplayer = {}\r\nlog = []\r\nfor i in range(1,n+1):\r\n name, score = input().split()\r\n if name not in player.keys():\r\n player[name] = 0\r\n player[name] += int(score)\r\n log.append([name,player[name]])\r\nmaxval = max(player.values())\r\nwinplayers = [key for key, val in player.items() if val ==maxval]\r\nfor p,s in log:\r\n if p in winplayers and int(s)>=maxval:\r\n print(p)\r\n break\r\n", "n=int(input())\r\na={}\r\np=[]\r\nfor _ in range(n):\r\n n,m=input().split()\r\n a[n]=a.get(n,0)+int(m)\r\n p.append([n,a[n]])\r\nm=max(a.values())\r\nfor i,j in p:\r\n if a[i]==m and int(j)>=m:\r\n print(i)\r\n break\r\n" ]

[ "n, a, b, c = map(int, input().split())\nto_buy = (4 - (n % 4)) % 4\nb = min(a * 2, b)\nc = min(a * 3, a + b, c)\n\n# possibilities:\nif to_buy == 3:\n print(min(3*a, a+b, c))\nelif to_buy == 2:\n print(min(2*a, b, 2*c))\nelif to_buy == 1:\n print(min(a, b+c, 3*c))\nelse:\n print(0)\n", "n,a,b,c=map(int,input().split())\r\nif n%4==0:\r\n print(0)\r\nif (n+1)%4==0:\r\n print(min(a,b+c,3*c))\r\nif (n+2)%4==0:\r\n print(min(2*a,b,c*2))\r\nif (n+3)%4==0:\r\n print(min(3*a,b+a,c))\r\n", "\"\"\"\r\nATSTNG's ejudge Python3 solution template\r\n(actual solution is below)\r\n\"\"\"\r\nimport sys, queue\r\n\r\ntry:\r\n import dev_act_ffc429465ab634 # empty file in directory\r\n DEV = True\r\nexcept:\r\n DEV = False\r\n\r\ndef log(*s):\r\n if DEV: print('LOG', *s)\r\n\r\nclass EJudge:\r\n def __init__(self, problem=\"default\", reclim=1<<30):\r\n self.problem = problem\r\n sys.setrecursionlimit(reclim)\r\n\r\n def use_files(self, infile='', outfile=''):\r\n if infile!='':\r\n self.infile = open(infile)\r\n sys.stdin = self.infile\r\n if infile!='':\r\n self.outfile = open(outfile, 'w')\r\n sys.stdout = self.outfile\r\n\r\n def use_bacs_files(self):\r\n self.use_files(self.problem+'.in', self.problem+'.out')\r\n\r\n def get_tl(self):\r\n while True: pass\r\n\r\n def get_ml(self):\r\n tmp = [[[5]*100000 for _ in range(1000)]]\r\n while True: tmp.append([[5]*100000 for _ in range(1000)])\r\n\r\n def get_re(self):\r\n s = (0,)[8]\r\n\r\n def get_wa(self, wstr='blablalblah'):\r\n for _ in range(3): print(wstr)\r\n exit()\r\n\r\nclass IntReader:\r\n def __init__(self):\r\n self.ost = queue.Queue()\r\n\r\n def get(self):\r\n return int(self.sget())\r\n\r\n def sget(self):\r\n if self.ost.empty():\r\n for el in input().split():\r\n self.ost.put(el)\r\n return self.ost.get()\r\n\r\n def release(self):\r\n res = []\r\n while not self.ost.empty():\r\n res.append(self.ost.get())\r\n return res\r\n\r\n###############################################################################\r\nej = EJudge( )\r\nint_reader = IntReader()\r\nfmap = lambda f,*l: list(map(f,*l))\r\nparse_int = lambda: fmap(int, input().split())\r\n\r\n# input\r\nn,t1,t2,t3 = parse_int()\r\nt3 = min(t3, t2+t1, t1*3)\r\nt2 = min(t2, t1*2, t3*2)\r\nt1 = min(t1, t3+t2, t3*3)\r\n\r\nn = n%4\r\nif n==0: ans = 0\r\nif n==1: ans = t3\r\nif n==2: ans = t2\r\nif n==3: ans = t1\r\n\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", "n, a, b, c = map(int, input().split())\r\nprint([0, min(3*a, a+b, c), min(2*a, b, 2*c), min(a, b+c, 3*c)][n % 4])", "import sys\r\nINF = sys.maxsize\r\n\r\ndef solution(n, prices, k):\r\n if k>10:\r\n return INF\r\n if n % 4 == 0:\r\n return 0\r\n else:\r\n ans = min(solution(n + 1, prices,k+1) + prices[0],\r\n solution(n + 2, prices,k+2) + prices[1],\r\n solution(n + 3, prices,k+3) + prices[2])\r\n return ans\r\n\r\ndef main():\r\n n,a,b,c = map(int, input().split())\r\n prices = [a,b,c]\r\n print(solution(n,prices,0))\r\n\r\nmain()\r\n", "books = [int(x) for x in input().split(\" \")]\n\nmin_cost = 0\n\nif books[0] % 4 == 1:\n min_cost = min(books[1] *3, books[1] + books[2], books[3])\nelif books[0] % 4 == 2:\n min_cost = min(books[1] * 2, books[2], books[3] * 2)\nelif books[0] % 4 == 3:\n min_cost = min(books[1], books[2] + books[3], books[3]*3)\n\nprint(min_cost)\n \t\t \t\t \t\t\t \t \t\t\t\t \t", "n, a, b, c = map(int, input().split())\n\nans = float('inf')\nfor i in range(12):\n for j in range(12):\n for k in range(12):\n if (n + i + 2 * j + 3 * k) % 4 != 0:\n continue\n\n cost = (a * i) + (b * j) + (c * k)\n ans = min(ans, cost)\n\nprint(ans)\n", "n,a,b,c = map(int, input().split())\r\nn = n%4\r\nif(n==0):\r\n print(0)\r\nelif(n==1):\r\n print(min(c,a+b,3*a))\r\nelif(n==2):\r\n print(min(2*c,b,2*a))\r\nelse:\r\n print(min(3*c,b+c,a))\r\n", "n, a, b, c = map(int, input().split())\nk = n % 4\nif k == 0:\n\tprint(0)\nelif k == 3:\n\tans = min(a,b+c,3*c)\n\tprint(ans)\nelif k == 2:\n\tans = min(2*a,b,2*c)\n\tprint(ans)\nelse:\n\tans = min(3*a,a+b,c)\n\tprint(ans)\n", "from sys import stdin\nfrom sys import stdout\nn, a, b, c = (int(x) for x in stdin.readline()[:-1].split())\nn = (n%4)\ndef mina(lista):\n a = lista[0]\n for l in lista:\n if l < a:\n a = l\n return str(a)\nif n == 0:\n stdout.write(str(0))\nif n == 1:\n stdout.write(mina([c, 3*a, a+b, 3*a,a+2*c,2*b+c]))\nif n == 2:\n stdout.write(mina([b, 2*a, 2*c, a+b+c, 3*b]))\nif n == 3:\n stdout.write(mina([a, 3*c, c+b, 2*a+c, a+2*b, 2*a+c, 2*b+a]))\n", "\nline = input()\nnums = [int(e) for e in line.split()]\n\nn, a, b, c = nums[0], nums[1], nums[2], nums[3]\n\nif n % 4 == 0:\n gasto = 0\nelif 4 - (n % 4) == 1:\n gasto = min(a, b+c, c*3)\nelif 4 - (n % 4) == 2:\n gasto = min(a*2, b, c*2)\nelif 4 - (n % 4) == 3:\n gasto = min(a*3, a+b, c)\n\nprint(gasto)\n \t\t \t\t\t\t \t\t \t \t\t\t\t\t \t\t \t\t \t\t\t", "n, a, b, c = input().split()\nn = int(n)\na = int(a)\nb = int(b)\nc = int(c)\nsimpan = 0\nwhile n%4 != 0:\n sisa = n%4\n if sisa == 1:\n simpan = min(3*a,a+b,c)\n n += 3\n elif sisa == 2:\n simpan = min(b, 2*c, 2*a)\n n += 2 \n elif sisa == 3:\n simpan = min(b+c,a,2*b+a,3*c,c+2*a)\n n += 1 \nprint(simpan) \n\n\n\n \t \t\t \t \t\t \t \t\t \t\t \t \t\t\t", "n, a, b, c = map(int, input().split())\r\n\r\nmod = [0, a, 2 * a, 3 * a]\r\n\r\nfor x in range(50):\r\n for y in range(50):\r\n for z in range(50):\r\n mod[(x + 2*y + 3*z) % 4] = min(mod[(x + 2*y + 3*z) % 4], a * x + b * y + c * z)\r\n\r\nprint(mod[(4 - (n % 4)) % 4])\r\n", "n,a,b,c=map(int,input().split())\r\nprint([0,min(3*a,a+b,c),min(2*a,b,2*c),min(a,b+c,3*c)][n%4])", "KS = ([(0, 0, 0)],\n [(1, 0, 0), (0, 1, 1), (0, 0, 3)],\n [(2, 0, 0), (0, 1, 0), (0, 0, 2)],\n [(3, 0, 0), (1, 1, 0), (0, 0, 1)])\n\ndef prod(v, w):\n return sum(x * y for x,y in zip(v, w))\n\ndef run(n, *rs):\n r = (n % 4) and 4 - (n % 4)\n ks = KS[r]\n return min(prod(rs, k) for k in ks)\n\n# run(1, 1, 3, 4) == 3\n# run(6, 2, 1, 1) == 1\n# run(4, 4, 4, 4) == 0\n# run(999999999, 1000000000, 1000000000, 1000000000) == 1000000000\n\nif __name__ == \"__main__\":\n print(run(*(int(w) for w in input().split())))\n", "n,a,b,c = (int (i) for i in input().split())\r\nif n%4:\r\n n %= 4\r\n if n == 1:\r\n print(min(3*a,c,b+a))\r\n elif n == 2:\r\n print(min(2*a,2*c,b))\r\n elif n == 3:\r\n print(min(a,3*c,b+c))\r\nelse:\r\n print(0)", "n,a,b,c=[int(i) for i in input().split()]\r\nif n%4==0:\r\n print(0)\r\nif n%4==1:\r\n print(min(3*a,a+b,c))\r\nif n%4==2:\r\n print(min(2*a,b,2*c))\r\nif n%4==3:\r\n print(min(a,b+c,3*c))", "n, a, b, c = map(int,input().split())\r\nif n % 4 == 0:\r\n print(0)\r\nelif n %4 == 1:\r\n print(min(min(3 * a, c), a + b))\r\nelif n % 4 == 2 :\r\n print( min(min(2 * a, b), 2 * c))\r\nelse:\r\n print(min(min(a, b + c), 3 * c))", "n,a,b,c = [int(i) for i in input().split()]\r\nif n%4==0:\r\n print(0)\r\nif (n+1)%4==0:\r\n if 3*c<=a and 3*c<=b+c:\r\n print(3*c)\r\n if b+c<a and b+c<3*c:\r\n print(b+c)\r\n if a<=b+c and a<3*c: \r\n print(a)\r\nif (n+2)%4==0:\r\n if 2*c<=b and 2*a>=2*c:\r\n print(2*c)\r\n elif 2*a<2*c and 2*a<b:\r\n print(2*a)\r\n else:\r\n if 2*a>=b:\r\n print(b)\r\n else:\r\n print(2*a)\r\nif (n+3)%4==0:\r\n if 3*a>=c:\r\n if a+b>=c:\r\n print(c)\r\n else:\r\n print(a+b)\r\n elif 3*a>=a+b:\r\n print(a+b)\r\n else:\r\n print(3*a)\r\n \r\n", "n, a, b, c = map(int, input().split() )\r\n\r\nn = (-1*n)%4\r\nif n==0:\r\n print(0)\r\nelif n == 1:\r\n print(min(a, b+c, 3*c))\r\nelif n==2:\r\n print(min(2*a, b, 2*c))\r\nelse:\r\n print(min(3*a, a+b, c))\r\n", "n, a, b, c = map(int, input().split())\r\n\r\n# find the remainder when n is divided by 4\r\nr = n % 4\r\n\r\nif r == 0:\r\n print(0)\r\nelif r == 1:\r\n print(min(a*3, b+a, c))\r\nelif r == 2:\r\n print(min(a*2, b, c*2))\r\nelse:\r\n print(min(a, b+c, c*3))\r\n", "n, a, b, c = map(int, input().split())\na = [0, a, b, c]\nfor _ in range(100):\n for i in range(4):\n for j in range(4):\n to = (i + j) % 4\n if a[to] > a[i] + a[j]:\n a[to] = a[i] + a[j]\n\nprint(a[(4 - n % 4) % 4])\n", "# 740 A\r\nn, a, b, c = map(int, input().split());print([0, min(a*3, a+b, c), min(a*2, b, 2*c), min(a, b+c, c*3)][n % 4])", "n, a, b, c = map(int, input().split())\r\nmin_sum = 4 * (a + b + c)\r\nfor i in range(0, 5):\r\n for j in range(0, 5):\r\n for k in range(0, 5):\r\n if (n + i + j * 2 + k * 3) % 4 == 0:\r\n min_sum = min(min_sum, i * a + j * b + k * c)\r\nprint(min_sum)\r\n", "n,a,b,c=map(int,input().split())\r\n\r\nif n%4==0:print(0)\r\nelse:\r\n\tx = 4 - n%4\r\n\t\r\n\tif x == 1:\r\n\t\tprint(min(a,b+c,c*3))\r\n\t\r\n\tif x == 2:\r\n\t\tprint(min(a*2,b,c*2))\r\n\t\r\n\tif x == 3:\r\n\t\tprint(min(a*3,a+b,c))\r\n", "n, a, b, c = map(int, input().split())\n\nif n % 4 == 0:\n print (0)\nelse:\n inf = 1000000000\n dp = [inf for x in range(20)]\n dp[n % 4] = 0\n sol = inf\n \n for i in range(1 + (n % 4), 20):\n dp[i] = min(dp[i-1] + a, min(dp[i-2] + b, dp[i-3] + c))\n if i % 4 == 0:\n sol = min(sol, dp[i])\n print (sol)\n", "n, a, b, c = map(int, input().split())\r\nif not n % 4:\r\n print(0)\r\nelif n % 4 == 3:\r\n print(min(a, c + b, c * 3))\r\nelif n % 4 == 2:\r\n print(min(2 * a, b, 2 * c))\r\nelif n % 4 == 1:\r\n print(min(3 * a, b + a, c))", "n,a,b,c = map(int,input().split())\r\nans = float('infinity')\r\nfor j in range(10):\r\n for t in range(10):\r\n for k in range(10):\r\n if (n + j + 2 * t + 3 * k) % 4 == 0:\r\n ans = min(ans, j*a+t*b+k*c)\r\nprint(ans)", "n, a, b, c = map(int, input().split())\r\nm = 4 - n % 4\r\nif m == 4: print(0)\r\nelif m == 3: print(min(a*3, a+b, c))\r\nelif m == 2: print(min(a*2, b, c*2))\r\nelif m == 1: print(min(a, b+c, c*3))\r\n ", "import math\r\nl1 = input()\r\n\r\nl11 = l1.split(' ')\r\n\r\nS = [int(i) for i in l11]\r\nn = S[0]\r\na = S[1]\r\nb = S[2]\r\nc = S[3]\r\n\r\nnk = n%4\r\nk = 4 - nk\r\n\r\nif k == 4 or k == 0:\r\n print(0)\r\nelif k == 1:\r\n print(min(a, b+c, 3*c))\r\nelif k == 2:\r\n print(min(b, 2*a, 2*c))\r\nelif k == 3:\r\n print(min(3*a, a+b, c))", "n, a, b, c = map(int, input().split())\r\nans = int(1e18)\r\nfor i in range(4):\r\n for j in range(2):\r\n for k in range(4):\r\n if (n + i + 2 * j + 3 * k) % 4 == 0:\r\n ans = min(ans, i * a + j * b + k * c)\r\nprint(ans)\r\n", "n, a, b, c = map(int, input().split())\n\ndp = {}\ndp[n] = 0\n\nans = 1 << 30 if (n % 4) else 0\n\nfor i in range(n + 1, n + 20):\n dp[i] = dp[i - 1] + a\n if i - 2 >= n:\n dp[i] = min(dp[i], dp[i - 2] + b)\n if i - 3 >= n:\n dp[i] = min(dp[i], dp[i - 3] + c)\n\n if i % 4 == 0:\n ans = min(ans, dp[i])\n\nprint(ans)\n", "n, a, b, c = map(int, input().split())\r\nm = {0: 0, 1: a, 2: b, 3: c}\r\nn = 4 - (n % 4) if n % 4 else 0\r\n\r\ndef dfs(n, np):\r\n if n == 0:\r\n return [np]\r\n a = []\r\n for i in range(1, n+1):\r\n a = a + dfs(n-i, np+m[i%4])\r\n else:\r\n return a\r\n\r\n\r\nprint(min(dfs(n, 0) + dfs(4+n, 0) + dfs(8+n, 0)))\r\n", "n,a,b,c=map(int,input().split())\r\np=n%4\r\nn=4-p\r\nif(p==0):\r\n print(0)\r\nelse:\r\n if(n==1):\r\n print(min(a,b+c,c*3))\r\n elif(n==2):\r\n print(min(a*2,b,c*2))\r\n elif(n==3):\r\n print(min(a*3,a+b,c))", "n, a, b, c = map(int, input().split())\r\nif n % 4 == 0:\r\n print(0)\r\n exit()\r\nneeded = 4 - (n % 4)\r\n#print('needed', needed)\r\nif needed == 1:\r\n print(min(a, 3 * c, c + b))\r\nelif needed == 2:\r\n print(min(a * 2, b, c * 2, b * 3))\r\nelse:\r\n print(min(c, b +a, a * 3))", "# http://codeforces.com/problemset/problem/740/A\r\nget=lambda:list(map(int,input().split()))\r\nn,a,b,c=get()\r\nans=0\r\np=n%4\r\nif p==0:\r\n print(0)\r\nelif p==1:\r\n print(min(3*a,a+b,c))\r\nelif p==2:\r\n print(min(b,a*2,c*2))\r\nelse:\r\n print(min(a,3*c,c+b))\r\n", "#! /bin/env python3\n#Работает 62 мс 4500 кБ\n\nline = input()\n\nlines = line.split(\" \", 4)\nn = int(lines[0])\na = int(lines[1])\nb = int(lines[2])\nc = int(lines[3])\n\namount = 4 - n % 4\n\n\nif amount == 4:\n\tansw = 0\nelif amount == 1:\n\ttmp = a if (a < b + c) else b + c\n\tansw = tmp if tmp < 3 * c else 3 * c\nelif amount == 2:\n\ttmp = 2 * a if (2 * a < b) else b\n\tansw = tmp if (tmp < 2 * c) else 2 * c\nelse:\n\ttmp = 3 * a if (3 * a < a + b) else a + b\n\ttmp = tmp if (tmp < a + 2 * c) else a + 2 * c\n\tansw = tmp if (tmp < c) else c\n\t\t\nprint(answ)\n", "copybooks, one_copybook, two_copybooks, three_copybooks = [ int(x) for x in input().split() ]\n\nk=0\nrubles = 0\n\nwhile True:\n\n\tif (k+copybooks)%4==0:\n\t\tbreak\n\n\tk += 1\n\n\nif k==1:\n\trubles = min(one_copybook,two_copybooks+three_copybooks,three_copybooks*3) \n\nelif k==2:\n\trubles = min(two_copybooks,one_copybook*2,three_copybooks*2)\n\nelif k==3:\n\trubles = min(three_copybooks,one_copybook*3, one_copybook+two_copybooks)\n\nprint (rubles)\n\n \t\t\t\t\t\t \t\t \t \t\t\t \t\t \t \t", "line=[int(x) for x in input().split(' ')]\r\nN=line[0]\r\na=line[1]\r\nb=line[2]\r\nc=line[3]\r\nprices1=[0,a,b,c]\r\nprices2=[a+b,a+c,b+c,a+b+c]\r\nprice=10**9\r\nfor i in range(4):\r\n for t in range(1,4):\r\n if (N+i*t)%4==0 and prices1[i]*t<price:\r\n price=prices1[i]*t\r\nfor j in range(3,7):\r\n for t in range(1,2):\r\n if (N+j*t)%4==0 and prices2[j-3]*t<price:\r\n price=prices2[j-3]\r\nprint(price)", "#print( \"hi\" )\r\n#hi!!\r\n\r\nimport sys # you need this before you can use sys.whatever\r\ninput = sys.stdin.readline() #reads one line, stores the result as a string called input.\r\n#in example 1, input would now equal \"1 1 3 4\\n\". \\n means move to a new line!!\r\n#print(\"h\\ne\\nl\\nl\\no\")\r\n\r\ndat = input.split()\r\n#in example 1, dat would be [ \"1\" , \"1\" , \"3\" , \"4\" ]\r\n\r\n#now I want to convert these strings to integers.\r\n#len means length.\r\n#remember, indices always start from 0. So if length is L then indices would be 0, 1, ..., L-1.\r\nfor i in range( 0 , len(dat) ) :\r\n dat[i] = int( dat[i] ) # converting dat[i] to be an integer.\r\n\r\nn = dat[0]\r\na = dat[1]\r\nb = dat[2]\r\nc = dat[3]\r\n\r\n# Really, I only care about the REMAINDER of n when we divide by 4.\r\nremainderN = n % 4 # % means \"divide n by 4 and spit out only the REMAINDER\".\r\n\r\nif remainderN == 0 : # NOTE! a == b means \"test if a equals b\". a = b means \"assign the value b to the variable a\".\r\n print( \"0\" )\r\nelif remainderN == 1 :\r\n # possibilities: 3 1packs | 1 1pack, 1 2pack | 1 3pack\r\n result1 = 3*a\r\n result2 = 1*a + 1*b\r\n result3 = 1*c\r\n finalResult = min( result1 , result2 , result3 )\r\n print( finalResult )\r\nelif remainderN == 2 :\r\n # possibilities: 2 1packs | 1 2pack | 2 3packs\r\n result1 = 2*a # following lines demonstrate: the spacing within the line doesn't matter, so just do whatever makes it easy for you to read.\r\n result2=1*b\r\n result3 = 2 * c\r\n finalResult= min(result1,result2,result3)\r\n print( finalResult )\r\nelse : # don't need elif because if I've gotten this far then the remainder definitely equals 3!\r\n # possibilities: 1 1pack | 1 2pack, 1 3pack | 3 3packs\r\n result1 = 1*a\r\n result2 = 1*b + 1*c\r\n result3 = 3*c\r\n finalResult = min( result1 , result2 , result3 )\r\n print( finalResult )\r\n", "caderno = input().split()\n\nn = int(caderno[0])\na = int(caderno[1])\nb = int(caderno[2])\nc = int(caderno[3])\ntemp = n - n % 4\ntemp += 4\nk = temp - n\n\nif (n % 4 == 0):\n print('0')\nelse:\n if(k == 1):\n print(min(a, 3*c, c+b))\n elif(k == 2):\n print(min(2*a, b, 2*c))\n else:\n print(min(3*a, a+b, c))\n\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, a, b, c = map(int, input().split())\r\nn %= 4\r\nif n == 0:\r\n print(0)\r\nelif n == 3:\r\n print(min(a, b+c, c+c+c))\r\nelif n == 2:\r\n print(min(a+a, b, c+c))\r\nelse:\r\n print(min(a+a+a, a+b, c))", "n, a, b, c = map(int, input().split())\nres = 10 ** 100\nfor i in range(50):\n for j in range(50):\n for k in range(50):\n if (n + i + 2 * j + 3 * k) % 4 == 0:\n res = min(res, a * i + b * j + c * k)\nprint(res)", "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\nn,a,b,c=map(int,input().split())\r\nz=n%4\r\nif z==0:\r\n print(0)\r\nif z==3:\r\n\tprint(min(a,3*c,c+b))\r\nif z==2:\r\n\tprint(min(b,2*c,2*a))\r\nif z==1:\r\n\tprint(min(c,a+b,3*a))\r\n", "import sys\nn,a,b,c=map(int,sys.stdin.read().split())\nsys.stdout.write(str([0,min(c,a+b,3*a),min(2*c,b,2*a),min(3*c,b+c,a)][n%4]))\n", "L = list(map(int, input().split()))\r\nans = 10**9\r\nfor i in range(5):\r\n for j in range(5):\r\n for k in range(5):\r\n tmp = L[1] * i + L[2] * j + L[3] * k\r\n x = L[0] + i + j + j + k + k + k\r\n if (x % 4 == 0):\r\n ans = min(ans, tmp)\r\nprint(ans)\r\n", "nums = [int(x) for x in input().split()]\n\nn = nums[0]\n\nprice1 = nums[1]\nprice2 = nums[2]\nprice3 = nums[3]\n\nresult = 0\n\nif n%4==0:\n result = 0\n\nelse:\n rest = 4-(n%4)\n\n if rest==1:\n result = min(price1, price2+price3, 3*price3)\n\n elif rest==2:\n result = min(price2, 2*price1, 2*price3)\n\n else:\n result = min(price3, 3*price1, price1+price2)\n\nprint(result)\n\t\t \t \t \t \t\t\t \t\t \t \t\t\t\t", "def main():\n from itertools import product\n n, a, b, c = map(int, input().split())\n l = []\n for xa, xb, xc in product(range(4), repeat=3):\n if not (n + xa + xb * 2 + xc * 3) % 4:\n l.append(xa * a + xb * b + xc * c)\n print(min(l))\n\n\nif __name__ == '__main__':\n main()\n", "n,a,b,c=map(int,input().split())\r\nk=4-(n%4)\r\nif k==4:\r\n print(0)\r\nelif k==1:\r\n s1=a\r\n s2=b+c\r\n s3=c*3\r\n print(min(s1,s2,s3))\r\nelif k==2:\r\n s1=a*2\r\n s2=b\r\n s3=c*2\r\n print(min(s1,s2,s3))\r\nelse:\r\n s1=c\r\n s2=a*3\r\n s3=b+a\r\n print(min(s1,s2,s3))", "n, a, b, c = map(int, input().split())\r\nprint([0, min(3 * a, a + b, c), min(2 * a, b, 2 * c), min(a, b + c, 3 * c)][n % 4])\r\n", "a, b, c, d = map(int, input().split())\r\na = a % 4\r\nneed = 4 - a\r\nif need == 4:\r\n print(0)\r\nelif need == 1:\r\n print(min(b, c + d, d * 3))\r\nelif need == 2:\r\n print(min(c, b * 2, d * 2))\r\nelse:\r\n print(min(d, b + c, 3 * b))\r\n", "a, b, c, d=map(int, input().split())\r\ns=a%4\r\nh=0\r\n\r\nif s==3:\r\n h=min(b,3*d,c+d)\r\nelif s==2:\r\n h=min(2*b,c,2*d)\r\nelif s==1:\r\n h=min(3*b,c+b,d)\r\nprint(h)", "n, a, b, c = map(int, input().split())\r\nres = 1<<62\r\nfor i in range(101):\r\n for j in range(101):\r\n for k in range(101):\r\n if (i+j*2+k*3+n) % 4 == 0:\r\n res = min(res, i*a+j*b+k*c)\r\nprint(res)\r\n", "n,a,b,c=map(int,input().split())\r\nn=n%4\r\nif(n==0):\r\n\tprint(0)\r\nelif(n==1):\r\n\tprint(min(3*a,a+b,c))\r\nelif(n==2):\r\n\tprint(min(2*a,b,2*c))\r\nelif(n==3):\r\n\tprint(min(a,b+c,3*c))\r\n", "def solve():\r\n x=list(map(int,input().split()))\r\n remainder=x[0]%4\r\n if remainder==0:\r\n return 0;\r\n elif remainder==2:\r\n return min(2*x[1],x[2],2*x[3]);\r\n elif remainder==1:\r\n return min(3*x[1],x[1]+x[2],x[3]);\r\n else:\r\n return min(x[1],x[2]+x[3],x[3]*3);\r\n\r\n\r\nprint(solve())\r\n \r\n \r\n", "import sys \r\ninput = sys.stdin.readline \r\n\r\nn, a, b, c = map(int, input().split())\r\nd = {0 : 0, 1 : min(a, b + c, 3 * c), 2 : min(2 * a, b, 2 * c), 3 : min(3 * a, b + a, c), 4 : 0} \r\n\r\nk = 4 - n % 4 \r\nprint(d[k])", "n,a,b,c=map(int,input().split())\nm=n%4\nif m==0: print(0)\nif m==1: print(min(a*3,a+b,c))\nif m==2: print(min(a*2,b,c*2))\nif m==3: print(min(a,b+c,c*3))", "str=input().split()\r\nfor i in range(4):\r\n str[i]=int(str[i])\r\n\r\np=str[0]%4\r\np=4-p\r\n\r\nif p==4:\r\n print('0')\r\nelif p==1:\r\n print(min(min(3*str[3],str[2]+str[3]),str[1]))\r\nelif p==2:\r\n print(min(min(2*str[1],str[2]),2*str[3]))\r\nelif p==3:\r\n print(min(min(3*str[1],str[3]),str[2]+str[1]))\r\n", "n,a,b,c=[int(i) for i in input().split()]\r\nans=10**11\r\nfor i in range(4):\r\n for j in range(4):\r\n for k in range(4):\r\n if (n+i+j*2+k*3)%4==0:\r\n ans=min(ans,a*i+b*j+c*k)\r\nprint(ans)\r\n", "n, a, b, c = map(int, input().split())\r\nif n % 4 == 0:\r\n print(0)\r\nelif n % 4 == 3:\r\n lst = [a, 3 * c, b + c]\r\n print(min(lst))\r\nelif n % 4 == 1:\r\n lst = [3 * a, c, a + b]\r\n print(min(lst))\r\nelif n % 4 == 2:\r\n lst = [b, 2 * c, 2 * a]\r\n print(min(lst))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nSpyder Editor\r\n\r\nThis is a temporary script file.\r\n\"\"\r\n\"\"\"\r\nimport math\r\n\r\nd=list(map(int,input().split()))\r\n\r\nif d[0]%4!=0:\r\n x = math.ceil(d[0]/4)\r\n req = (4*x) - d[0]\r\n if req==3:\r\n i=d[3]\r\n j=d[1]+d[2]\r\n k=3*d[1]\r\n m1 = min(i,j)\r\n m2 = min(m1,k)\r\n print(m2)\r\n elif req==2:\r\n i=d[2]\r\n j=2*d[1]\r\n k=2*d[3]\r\n m1 = min(i,j)\r\n m2 = min(m1,k)\r\n print(m2)\r\n else:\r\n i = d[1]\r\n k = 3*d[3]\r\n l = d[3]+d[2]\r\n m1 = min(i,k)\r\n m2 = min(m1,l)\r\n print(min(m1,m2))\r\nelse:\r\n print(0)", "def func(n):\r\n if n[0]%4==1:return min(n[3],n[1]*3,n[2]+n[1])\r\n elif n[0]%4==2:return min(n[2],n[3]*2,n[1]*2)\r\n elif n[0]%4==3:return min(n[1],n[2]+n[3],n[3]*3)\r\n else:return 0\r\nprint(func(list(map(int,input().split()))))\r\n", "n,a,b,c=input().split(\" \")\r\nn=int(n)\r\na=int(a)\r\nb=int(b)\r\nc=int(c)\r\n\r\nk=4 - n%4\r\n\r\n\r\nJG=[]\r\nif (k==4):\r\n JG=[0]\r\nif (k==1):\r\n JG.append(a)\r\n JG.append(b+c)\r\n JG.append(3*c)\r\nif (k==2):\r\n JG.append(b)\r\n JG.append(2*a)\r\n JG.append(2*c)\r\nif (k==3):\r\n JG.append(3*a)\r\n JG.append(a+b)\r\n JG.append(c)\r\n\r\njg=sorted(JG)\r\nprint(jg[0])\r\n\r\n\r\n\r\n", "def compute():\n n, a, b, c = map(int,input().split())\n ans = 1<<100\n for k1 in range(10):\n for k2 in range(10):\n for k3 in range(10):\n if (n+k1+2*k2+3*k3)%4==0:\n ans = min(ans,k1*a+k2*b+k3*c)\n return ans\n\nif __name__==\"__main__\":\n print(compute())\n", "n,a,b,c=map(int,input().split())\r\nif n%4==0:\r\n print(\"0\")\r\nelse:\r\n if n%4==3:\r\n print(min(a,b+c,3*c))\r\n elif n%4==2:\r\n print(min(2*a,b,2*c))\r\n else:\r\n print(min(3*a,b+a,c))\r\n", "\"\"\"\r\nCreated on Mon Nov 28 12:27:10 2016\r\n\r\n@author: lawrenceylong\r\n\"\"\"\r\n\r\ndef alyonaCopybooks(n, a, b, c):\r\n \"\"\"\r\n look here:\r\n http://codeforces.com/problemset/problem/740/A\r\n \"\"\"\r\n h = n % 4\r\n if h == 0:\r\n return 0 \r\n else:\r\n if h== 1:\r\n d = min(a*3, a+b, c)\r\n if h==2:\r\n d=min(a*2,b,c*2)\r\n if h==3:\r\n d=min(a,b+c,c*3)\r\n return d\r\n \r\n\r\nn, a, b, c = map(int, input().split())\r\n\r\nprint(alyonaCopybooks(n,a,b,c))", "n, a, b, c = map(int, input().split())\r\nif n % 4 == 0:\r\n print(0)\r\nelif n % 4 == 1:\r\n print(min(a * 3, b + a, c))\r\nelif n % 4 == 2:\r\n print(min(a * 2, b, c * 2))\r\nelse:\r\n print(min(a, c * 3, b + c))\r\n", "def main():\r\n n,a,b,c=[int(i) for i in input().split(' ')]\r\n if n%4==0:\r\n print(0)\r\n return \r\n x=n%4\r\n #m=min(a,b,c)\r\n if x==1:\r\n print(min(3*a,c,a+b))\r\n elif x==2:\r\n print(min(2*a,b,2*c))\r\n else:\r\n print(min(a,3*c,b+c))\r\n\r\nmain()", "#!/usr/bin/env python3\r\n\r\ndef main():\r\n try:\r\n while True:\r\n n, a, b, c = map(int, input().split())\r\n result = 1e20\r\n for ia in range(4):\r\n for ib in range(4):\r\n for ic in range(4):\r\n x = n + ia + (ib << 1) + ic * 3\r\n if x & 0x3 == 0:\r\n result = min(result, ia * a + ib * b + ic * c)\r\n print(result)\r\n\r\n except EOFError:\r\n pass\r\n\r\nmain()\r\n", "import sys\n\nlines = []\nfor line in sys.stdin: \n lines.append(line)\n break\nn, a, b, c = [int(x) for x in lines[0].split()]\n\ncheap = float('inf')\ncost = [a,b,c]\n\ndef ways(n, k, c, added):\n global cheap\n if n % 4 == 0: \n cheap = min(cheap, c)\n elif added > 4 or k < 0:\n pass\n else:\n ways(n + k + 1, k, c + cost[k], added + 1)\n ways(n, k-1, c, added)\n\nways(n, 2, 0, 0)\nprint(cheap)\n", "n,a,b,c=map(int,input().split())\r\nbest=(a+b+c)*4\r\nfor x in range(4):\r\n\tfor y in range(4):\r\n\t\tfor z in range(4):\r\n\t\t\tk=x+2*y+3*z\r\n\t\t\tif (n+k)%4!=0:continue\r\n\t\t\tbest=min(best,x*a+b*y+c*z)\r\nprint(best)", "def mini(x,y,z):\r\n if x<y:\r\n m=x\r\n if z<m:\r\n m=z\r\n else:\r\n m=y\r\n if z<m:\r\n m=z\r\n return m\r\nvars=list(map(int,input().split()))\r\n\r\nif vars[0]%4==0:\r\n print(0)\r\nelif vars[0]%4==1:\r\n print(min(3*vars[1],vars[1]+vars[2],vars[3]))\r\nelif vars[0]%4==2:\r\n print(min(2*vars[1],vars[2],2*vars[3]))\r\nelif vars[0]%4==3:\r\n print(min(vars[1],vars[2]+vars[3],3*vars[3]))", "n,a,b,c=[int(x) for x in input().split()]\r\nif n%4==0:\r\n print(0)\r\nelse:\r\n if 4-n%4==1:\r\n print(min(a,3*c,b+c))\r\n elif 4-n%4==2:\r\n print(min(b,2*c,2*a))\r\n else:\r\n print(min(c,3*a,a+b))\r\n", "n, a, b, c = map(int, input().split())\r\ndp = [0] * 100\r\ndp[1] = a\r\ndp[2] = min(2 * a, b)\r\nfor i in range(3, 100):\r\n dp[i] = min(dp[i - 3] + c, dp[i - 2] + b, dp[i - 1] + a)\r\nk = (4 - n % 4) % 4\r\nans = min(dp[k + 4 * i] for i in range(20))\r\nprint(ans)\r\n", "n,_1,_2,_3=map(int,input().split())\r\nd={0:0,1:_1,2:_2,3:_3}\r\nz=[[0]]\r\nfor i in range(1,13):\r\n k=[]\r\n for j in [1,2,3]:\r\n if i==j:k+=[[j]]\r\n elif i-j>-1:\r\n r=z[i-j]\r\n for o in r:k.append(o+[j])\r\n z.append(k)\r\nif n%4==0:print(0)\r\nelse:\r\n p=n%4\r\n ans=float(\"inf\")\r\n for i in range(1,13):\r\n for j in z[i]:\r\n s=0\r\n for t in j:s+=d[t]\r\n if (p+sum(j))%4==0:\r\n ans=min(ans,s)\r\n print(ans)", "n,a,b,c=list(map(int, input().split()))\nn=4-n%4\nif n==1:print(min(a,b+c,3*c))\nelif n==2:print(min(2*a,b,2*c,a+b+c))\nelif n==3:print(min(3*a,b+a,c))\nelse:print(0)\n\n", "n,a,b,c=input().split()\nn=int(n)\na=int(a)\nb=int(b)\nc=int(c)\ns = 4 - n%4;\nif(s == 4):\n\tres = 0\nelif(s == 3):\n res = min(a+b, min(3*a, c))\nelif(s == 2):\n\tres = min(min(2*a, b), 2*c)\nelif(s == 1):\n\tres = min(min(a, 3*c), b+c)\nprint(res)\n\n\t \t\t \t\t \t \t\t \t \t \t \t\t\t\t\t", "n,a,b,c = map(int,input().split())\r\n\r\nif n % 4 == 0:\r\n\tprint(0)\r\nelif n % 4 == 1:\r\n\tprint(min( a*3 , min(a+b,c) ));\r\nelif n % 4 == 2:\r\n\tprint(min( a*2 ,min(b,c*2) ) );\r\nelif n % 4 == 3:\r\n\tprint(min( a, min(b+c,c*3) ) );", "n,a,b,c =[int(x) for x in input().split()]\r\nm = 3*10*1000000000\r\nfor i in range(10) :\r\n for j in range(10):\r\n for q in range(10):\r\n if (n + i + j * 2 + q * 3) % 4 == 0 :\r\n m = min(m , i * a + j * b + q * c)\r\nprint(m) ", "n, a, b, c = map(int, input().split())\r\nmn = 10 ** 12\r\narr = [0, a, b, c]\r\nfor i in range(30):\r\n for j in range(30):\r\n q = (4 - (n % 4 + i * 3 + j * 2) % 4) % 4\r\n mn = min(mn, arr[3] * i + arr[2] * j + arr[1] * q)\r\nprint(mn)", "import itertools\n\n(n, a, b, c) = [int(w) for w in input().split()]\nto_cost = {\n 0: 0,\n 1: a,\n 2: b,\n 3: c\n}\nspace = [sum(to_cost[i] for i in seq)\n for seq in itertools.product(*(3 * [[0, 1, 2, 3]]))\n if (sum(seq) + n) % 4 == 0]\nprint(min(space))\n", "n, a, b, c = map(int, input().split())\r\nm = 10**12\r\nfor i in range(30):\r\n for j in range(30):\r\n for k in range(30):\r\n if (n+i+2*j+3*k) % 4:\r\n continue\r\n m = min(m, i*a+j*b+k*c)\r\nprint(m)", "n, a, b, c = map(int, input().split())\r\n\r\n# a 1冊セットの値段\r\n# b 2冊セットの値段\r\n# c 3冊セットの値段\r\n\r\nans = 10 ** 12\r\n\r\nif n % 4 == 0:\r\n ans = 0\r\nelse:\r\n # 4で割り切れる組み合わせを選ぶ\r\n for ac in range(0, 4): # 購入する1冊セットの個数\r\n for bc in range(0, 4): # 購入する2冊セットの個数\r\n for cc in range(0, 4): # 購入する3冊セットの個数\r\n if (n + ac + bc * 2 + cc * 3) % 4 == 0:\r\n price = ac * a + bc * b + cc * c\r\n ans = min(price, ans)\r\n\r\nprint(ans)\r\n", "n, a, b, c = map (int, input().split())\r\n\r\nif n % 4 == 0:\r\n print (0)\r\nelif n % 4 == 1:\r\n print (min (3 * a, a + b, c))\r\nelif n % 4 == 2:\r\n print (min (2 * a, b, 2 * c))\r\nelse:\r\n print (min (a, b + c, 3 * c))", "def calculaFalta(n):\n if(n%4 == 0):\n return 0\n elif(n<4):\n return 4-n\n else:\n if(n%4 == 3):\n return 1\n elif(n%4 == 2):\n return 2\n else:\n return 3\n\ndef calculaTotal(entrada):\n\n n = int(entrada[0])\n preco1 = int(entrada[1])\n preco2 = int(entrada[2])\n preco3 = int(entrada[3])\n\n falta = calculaFalta(n)\n\n if (falta == 0):\n return 0\n\n total = 0\n\n if(falta == 1):\n\n adiciona = min(preco1, preco2 + preco3, preco3 * 3)\n total += adiciona\n\n elif(falta == 2):\n\n adiciona = min(preco2, 2*preco1, preco3 + 3*preco1, 2*preco3)\n total += adiciona\n\n else:\n\n adiciona = min(preco3, preco1*3, preco2 + preco1)\n total += adiciona\n\n return total\n\nentrada = input().split()\nprint(calculaTotal(entrada))\n \t \t\t \t \t\t \t\t\t \t\t\t \t \t \t\t \t", "n, a, b, c = map(int, input().split())\r\ng = n % 4\r\nif g == 0:\r\n print(0)\r\nelif g == 1:\r\n print(min(3 * a, a + b, c))\r\nelif g == 2:\r\n print(min(2 * a, b, c * 2))\r\nelif g == 3:\r\n print(min(a, b + c, c * 3))\r\n ", "n,a,b,c=map(int,input().split())\r\nm=n%4\r\nif m==0:\r\n print(0)\r\nelif m==1:\r\n print(min(3*a,a+b,c))\r\nelif m==2:\r\n print(min(2*a,b,2*c))\r\nelse:\r\n print(min(a,b+c,3*c))", "n, a, b, c = list(map(int, input().split()))\r\n\r\nfrom math import inf\r\nmin_price = inf\r\nfor x1 in range(10):\r\n for x2 in range(10):\r\n for x3 in range(10):\r\n price = a * x1 + b * x2 + c * x3\r\n num = n + x1 + 2 * x2 + 3 * x3\r\n # print()\r\n if num% 4 == 0:\r\n min_price = min(price, min_price)\r\n \r\nprint(min_price)", "n,a,b,c=map(int,input().split())\r\ne=0\r\nif n%4==0:\r\n print(0)\r\nelse:\r\n w=[]\r\n for i in range(10**2):\r\n if (n+i)%4==0:\r\n w.append(i*a)\r\n e+=1\r\n if (n+i*2)%4==0:\r\n w.append(i*b)\r\n e+=1\r\n if (n+i*3)%4==0:\r\n w.append(min(i*c,i*a+i*b))\r\n e+=1\r\n if (n+i*5)%4==0:\r\n w.append(min(i*c,i*a+i*b)+i*b)\r\n e+=1\r\n if (n+i*4)%4==0:\r\n w.append(min(i*c,i*a+i*b)+i*a)\r\n e+=1\r\n if e==5:\r\n break\r\n print(min(w))", "s = list(map(int, input().split()))\r\nn =s[0]\r\na = s[1]\r\nb = s[2]\r\nc = s[3]\r\nif n%4==0:\r\n print(0)\r\nelif n%4==3:\r\n print(min(a*1, 3*c, c+b))\r\nelif n%4==2:\r\n print(min(2*a, b, 2*c))\r\nelse:\r\n print(min(3*a, b+a, c))\r\n", "n, a, b, c = map(int, input().split())\nif n % 4 == 0:\n\tprint(0)\nelse:\n\tq = [10 ** 10] * 20\n\tq[0] = 0\n\tfor i in range(20):\n\t\tif i + 3 < 20:\n\t\t\tq[i + 3] = min(q[i + 3], q[i] + c)\n\t\tif i + 2 < 20:\n\t\t\tq[i + 2] = min(q[i + 2], q[i] + b)\n\t\tif i + 1 < 20:\n\t\t\tq[i + 1] = min(q[i + 1], q[i] + a)\n\tprint(min(q[4 - n % 4::4]))", "n,a,b,c=map(int,input().split())\nprint([0,min(a*3,a+b,c),min(2*a,b,2*c),min(a,b+c,3*c)][n%4])", "nums = [int(x) for x in input().split()]\n\nn = nums[0]\n\nprice_a = nums[1]\nprice_b = nums[2]\nprice_c = nums[3]\n\nresult = 0\n\nif n % 4 == 0:\n result = 0\n\nelse:\n rest = 4 - (n % 4)\n\n if rest == 1:\n result = min(price_a, price_b + price_c, 3 * price_c)\n\n elif rest == 2:\n result = min(price_b, 2 * price_a, 2 * price_c)\n\n else:\n result = min(price_c, 3 * price_a, price_a + price_b)\n\nprint(result)\n\n \t\t \t \t\t\t\t \t\t \t \t\t\t", "n,a,b,c=[int(s) for s in input().split()]\r\nn%=4\r\nif n==0:\r\n print(0)\r\nelif n==1:\r\n print(min(3*a,a+b,c))\r\nelif n==2:\r\n print(min(2*a,b,2*c))\r\nelse:\r\n print(min(a,b+c,3*c))", "n, a, b, c = map(int, input().split())\n\n\n# n = número de livros que ela já tem\n# a = preço em rublos de 1 livro\n# b = preço em rublos de 2 livros\n# c = preço em rublos de 3 livros\n\ndef contaRublos(livros, a, b, c):\n falta = livros % 4\n\n if falta == 0:\n return 0\n\n else:\n if falta == 1:\n # Verifica se 3a, c ou a+b é mais barato\n return min(min(3 * a, c), a + b)\n elif falta == 2:\n return min(min(2 * a, b), 2 * c)\n elif falta == 3:\n return min(min(a, b + c), 3 * c)\n #implementar else para outros casos\n\n\nprint(contaRublos(n, a, b, c))\n\n\t\t\t\t\t\t \t\t \t\t \t\t\t \t\t\t\t", "n, a, b, c = list(map(int, input().split()))\r\n\r\nif (n % 4 == 1): # 3, 7, 11, 15\r\n print(min([a * 3, b + a, c]))\r\nelif (n % 4 == 2): # 2, 6, 10, 14\r\n print(min([a * 2, b, c * 2]))\r\nelif (n % 4 == 3): # 1, 5, 9, 13\r\n print(min([a, c + b, c * 3]))\r\nelif (n % 4 == 0):\r\n print(0)\r\n", "n,a,b,c=[int(i) for i in input().split()]\r\nif(n%4==0):print(\"0\")\r\nelif(n%4==1):print(min(c,min(a+b,3*a)))\r\nelif(n%4==2):print(min(b,min(2*a,2*c)))\r\nelse:print(min(a,min(b+c,3*c)))", "import traceback\r\nimport math\r\nfrom collections import defaultdict\r\nfrom functools import lru_cache\r\n\r\n\r\ndef main(): \r\n n, a, b, c = list(map(int, input().split()))\r\n r = (4 - n % 4)%4\r\n if r == 0:\r\n return 0\r\n if r == 1:\r\n return min(a, b+c, 3*c)\r\n if r == 2:\r\n return min(2*a, b, 2*c)\r\n if r == 3:\r\n return min(3*a, b+a, c)\r\n\r\ntry:\r\n ans = main()\r\n print(ans)\r\nexcept Exception as e:\r\n print(e)\r\n traceback.print_exc()", "n,a,b,c=map(int,input().split())\r\nx=n%4\r\nif x==0:\r\n print('0')\r\nelse:\r\n k=4-x\r\n if k==1:\r\n print(min(a,3*c,b+c))\r\n elif k==2:\r\n print(min(2*a,b,2*c))\r\n else:\r\n print(min(3*a,a+b,c))", "m=list(int(x) for x in input().split())\r\nn=m[0]\r\na=m[1]\r\nb=m[2]\r\nc=m[3]\r\n\r\nif n%4==0:\r\n\tk=0\r\nelif n%4==1:\r\n\tk=min(a+a+a,b+a,c)\r\nelif n%4==2:\r\n\tk=min(a+a,b,c+c,c+b+a,c+a+a+a)\r\nelif n%4==3:\r\n\tk=min(a,b+b+a,b+a+a+a,c+c+c,c+b,c+a+a)\r\n\r\nprint(k)", "def f(n, price = 0, k = 0):\r\n if k > 9: return 10 ** 18\r\n if not (n % 4): return price\r\n return min(f(n + 1, price + a, k + 1),\r\n f(n + 2, price + b, k + 1),\r\n f(n + 3, price + c, k + 1))\r\n\r\nn, a, b, c = map(int, input().split())\r\n\r\nprint(f(n))\r\n", "n, a, b, c = map(int, input().split())\r\naa = []\r\nfor i in range(0, 10):\r\n for j in range(0, 10):\r\n for k in range(0, 10):\r\n if (n + i + j*2 + k*3)%4 == 0:\r\n aa.append(a*i+b*j+c*k)\r\n\r\nprint(min(aa))\r\n", "n, a, b, c = map(int, input().split())\n\nif n%4 == 0:\n print(0)\nelif n%4 == 1:\n print(min(c, 3*a, a+b))\nelif n%4 == 2:\n print(min(2*c, 2*a, b))\nelse:\n print(min(a, 3*c, c+b))\n", "from itertools import product\r\nn, p1, p2, p3 = (int(x) for x in input().split())\r\nbest_price = 10**12\r\nfor i in product(range(50), repeat=3):\r\n k, l, m = i\r\n if (n + k + 2 * l + 3 * m) % 4 == 0:\r\n price = k * p1 + l * p2 + m * p3\r\n best_price = min(best_price, price)\r\n\r\nprint(best_price)\r\n", "n, a, b, c = map(int, input().split())\r\nans = 0\r\nif (n + 3) % 4 == 0:\r\n ans = min(a * 3, a + b, c)\r\nelif (n + 2) % 4 == 0:\r\n ans = min(a * 2, b, c * 2)\r\nelif (n + 1) % 4 == 0:\r\n ans = min(a, b + c, c * 3)\r\nprint(ans)", "n,a,b,c=input().split()\r\nn=int(n)\r\na=int(a)\r\nb=int(b)\r\nc=int(c)\r\ns = 4 - n%4;\r\nif(s == 4):\r\n\tres = 0\r\nelif(s == 3):\r\n res = min(a+b, min(3*a, c))\r\nelif(s == 2):\r\n\tres = min(min(2*a, b), 2*c)\r\nelif(s == 1):\r\n\tres = min(min(a, 3*c), b+c)\r\nprint(res)\r\n", "n, a, b, c = [int(i) for i in input().split()]\nk = (4-n%4)%4\n\nif k == 0:\n print(0)\nelif k == 1:\n print(min([a, b+c, 3*c]))\nelif k==2:\n print(min([2*a, b, 2*c]))\nelse:\n print(min([3*a, a+b, c]))\n", "n,a,b,c = (int(i) for i in input().split())\r\nif n%4 == 0:\r\n print(0)\r\nelse:\r\n ans = 10**11\r\n for i in range(5):\r\n for j in range(5):\r\n for k in range(5):\r\n if (n+i*1+j*2+k*3)%4 == 0:\r\n ans = min(ans,i*a+b*j+c*k)\r\n print(ans)", "# 1\r\n# 2 1\r\n# 3 (1) (2 check11 check2 check33 8) (3 check 1 and check32 12)\r\nn,a,b,c = [int(x) for x in input().split()]\r\nif n%4==0:\r\n print(0)\r\nelif n%4==1:\r\n print(min(c,a*3,a+b))\r\nelif n%4==2:\r\n print(min(b,a*2,c*2))\r\nelse:\r\n print(min(a,c*3,b*2+a,b+c))", "from bisect import bisect_right\n\nn,a,b,c=map(int,input().split())\nk=n%4\nif k==0:\n print('0')\nelif k==1:\n print(min(3*a,a+b,c))\nelif k==2:\n print(min(2*a,b,2*c))\nelif k==3:\n print(min(a,3*c,b+c))", "n, a, b, c = [int(x) for x in input().split()]\n\nmin_sum = 10 * (a + b + c)\n\nfor i in range(4):\n for j in range(4):\n for k in range(4):\n if (n + 1*i + 2*j + 3*k) % 4 == 0:\n min_sum = min(min_sum, i*a + j*b + k*c)\n\nprint(min_sum)", "\nn,a,b,c = input().split(\" \")\nn = int(n)\na = int(a)\nb = int(b)\nc = int(c)\nvalor = 0\nk = 0 \nwhile (n + k)% 4 != 0:\n\tk += 1\n\nif k == 0 :\n valor = 0\nelif k == 1:\n valor = min(a, 3 *c)\n valor = min(valor, c + b)\nelif k == 2:\n valor = min(2*a,b)\n valor = min(valor,2*c)\nelif k == 3:\n valor = min(c, 3 *a)\n valor = min(valor, a+b)\n\nprint(valor)\n \t \t \t \t\t\t\t\t \t \t \t\t \t", "copy_books = input().split()\n\nhave = int(copy_books[0])\n\na = int(copy_books[1])\nb = int(copy_books[2])\nc = int(copy_books[3])\n\n#3\nab = a+b\na3 = a*3\nc = c\n#2\na2 = a*2\nb = b\nc2 = c*2\n#1\na = a\nbc = b+c\nc3 = c*3\n\nhave = have%4\n\n\nresult = 0\n\nif have == 1:\n result = min(ab, a3, c)\nelif have == 2:\n result = min(a2,b,c2)\nelif have == 3:\n result = min(a, bc, c3)\n\n\n\nprint(result)\n \t \t\t \t\t\t\t\t\t \t \t \t\t\t\t \t", "#!/usr/bin/python3\r\n\r\nn,a,b,c = [int(x) for x in input().strip().split()]\r\n\r\nif n%4 == 0:\r\n\tprint(0)\r\nelif n%4 == 1:\r\n\tprint(min(3*a,a+b,c))\r\nelif n%4 == 2:\r\n\tprint(min(2*a,b,2*c))\r\nelse:\r\n\tprint(min(a,b+c,3*c))", "n, a, b, c = map(int, input().split())\r\nif n % 4 == 0:\r\n print(0)\r\nelif n % 4 == 1:\r\n print(min(c, a*3, a+b))\r\nelif n % 4 == 2:\r\n print(min(c*2, b, a*2))\r\nelse:#n % 4 == 3\r\n print(min(a, b+c, 3*c))", "data = list(map(int, input().split()))\r\nn = data[0]\r\n\r\nif n % 4 == 1:\r\n print(min(3 * data[1], data[3], data[1] + data[2]))\r\nelif n % 4 == 2:\r\n print(min(2 * data[1], data[2], 2 * data[3]))\r\nelif n % 4 == 3:\r\n print(min(data[1], 3 * data[3], data[3] + data[2]))\r\nelse:\r\n print(0)\r\n", "import math,sys,re,itertools,pprint,collections,copy\r\nrs,ri,rai,raf=input,lambda:int(input()),lambda:list(map(int, input().split())),lambda:list(map(float, input().split()))\r\n\r\nn, a, b, c = rai()\r\ns = float(\"inf\")\r\n\r\nfor ia in range(5):\r\n for ib in range(5):\r\n for ic in range(5):\r\n k = ia + 2*ib + 3*ic\r\n if (n + k) % 4 != 0:\r\n continue\r\n s = min(s, ia * a + ib * b + ic * c)\r\n\r\nprint(s)\r\n\r\n", "# 740A\r\n# θ(1) time\r\n# θ(1) space\r\n\r\n__author__ = 'artyom'\r\n\r\n\r\n# SOLUTION\r\n\r\ndef main():\r\n n, a, b, c = read(3)\r\n r = n % 4\r\n if r == 0:\r\n return 0\r\n if r == 1:\r\n return min(3 * a, a + b, c)\r\n if r == 2:\r\n return min(2 * a, b, 2 * c)\r\n return min(a, b + c, 3 * c)\r\n\r\n\r\n# HELPERS\r\n\r\ndef read(mode=1, size=None):\r\n # 0: String\r\n # 1: Integer\r\n # 2: List of strings\r\n # 3: List of integers\r\n # 4: Matrix of integers\r\n if mode == 0: return input().strip()\r\n if mode == 1: return int(input().strip())\r\n if mode == 2: return input().strip().split()\r\n if mode == 3: return list(map(int, input().strip().split()))\r\n a = []\r\n for _ in range(size):\r\n a.append(read(3))\r\n return a\r\n\r\n\r\ndef write(s='\\n'):\r\n if s is None: s = ''\r\n if isinstance(s, tuple) or isinstance(s, list): s = ' '.join(map(str, s))\r\n s = str(s)\r\n print(s)\r\n\r\n\r\nwrite(main())", "n, a, b, c = map(int, input().strip().split())\n\ncost = 0 if n%4 == 0 else a * (4 - n % 4)\n\nfor i in range(20):\n\tfor j in range(20):\n\t\tfor k in range(20):\n\t\t\tif (n + i + 2*j + 3*k) % 4 == 0:\n\t\t\t\tcost = min(cost, i*a + j*b + k*c)\nprint(cost)\n", "n, a, b, c = map(int, input().split())\r\nm = n % 4\r\n\r\nif m == 0:\r\n print(0)\r\nelif m == 1:\r\n print(min(3*a, b + a, c))\r\nelif m == 2:\r\n print(min(b, 2*a, 2*c))\r\nelif m == 3:\r\n print(min(a, 3*c, b + c))\r\n\r\n", "def f(k):\r\n\tif k==0:\r\n\t\treturn 0\r\n\telif k==1:\r\n\t\treturn min(a, b+c, 3*c)\r\n\telif k==2:\r\n\t\treturn min(2*a, b, 2*c)\r\n\telif k==3:\r\n\t\treturn min(3*a, a+b, c)\r\nn, a, b, c=[int(i) for i in input().split()]\r\n\r\nn=(-n%4)\r\nprint(f(n))", "n, a, b, c = map(int, input().split())\nres = 10000000000\nfor i in range(10):\n for j in range(10):\n for k in range(10):\n if (n + i + j*2 + k*3)%4 == 0:\n res = min(res, i*a + j*b + k*c)\n\nprint(res)\n", "n,a,b,c=map(int,input().split())\r\nn=n%4\r\nif n==0 :\r\n\tprint(0)\r\nelif n==1:\r\n\tl = [3*a,c,a+b,3*(b+c)]\r\n\tprint(min(l))\r\nelif n==2:\r\n\tl = [2*a,b,2*c,2*(a+b),2*(b+c)]\r\n\tprint(min(l))\r\nelif n==3:\r\n\tl = [a,3*c,3*(a+b),b+c]\r\n\tprint(min(l))", "def encontra_menor(n1,n2,n3):\n menor = n1\n if (n2 < menor):\n menor = n2\n if (n3 < menor):\n menor = n3\n return menor\n\nentrada = input()\nlivros, preco1, preco2, preco3 = entrada.split(\" \")\nresultado = 0\n\ndiv_por_4 = int(livros) % 4\n\nif div_por_4 == 1:\n resultado = encontra_menor(int(preco1)*3, int(preco1) + int(preco2), int(preco3))\nelif div_por_4 == 2:\n resultado = encontra_menor(int(preco1)*2, int(preco2), int(preco3)*2)\nelif div_por_4 == 3:\n resultado = encontra_menor(int(preco1), int(preco2) + int(preco3), int(preco3)*3)\n\nprint(resultado)\n\t \t \t \t \t \t\t \t \t \t", "n,a,b,c=map(int,input().split())\r\nm=n%4\r\nif m==0: print(0)\r\nelif m==1: print(min(a*3,a+b,c))\r\nelif m==2: print(min(a*2,b,c*2))\r\nelif m==3: print(min(a,b+c,c*3))", "\r\nif __name__ == '__main__':\r\n\tn, a, b, c = map(int, input().split())\r\n\tres = 4*(a+b+c)\r\n\tfor i in range(4):\r\n\t\tfor j in range(4):\r\n\t\t\tfor k in range(4):\r\n\t\t\t\tif (n+i+2*j+3*k) % 4 != 0:\r\n\t\t\t\t\tcontinue\r\n\t\t\t\tres = min(res, a*i+b*j+c*k)\r\n\tprint(res)\r\n", "#I:\r\nn, a, b, c = map(int, input().split())\r\nmod = n % 4\r\nif mod == 3:\r\n print(min(a, 3*c, b+c))\r\nelif mod == 2:\r\n print(min(b, 2*a, 2*c, c + 3*a))\r\nelif mod == 1:\r\n print(min(c, 3*a, b+a))\r\nelse:\r\n print(0)", "import sys\r\narr = list(map(int,input().split()))\r\nn = arr[0]\r\na = arr[1]\r\nb = arr[2]\r\nc = arr[3]\r\nif n % 4 == 0:\r\n print(0)\r\nelif n % 4 == 3:\r\n print( min(a,b+c,c*3,(c+(2*a) )))\r\nelif n % 4 == 2:\r\n print(min( a*2, b, c*2, (c+(3*a)) ))\r\nelif n % 4 == 1:\r\n print(min(a*3,b+a,c))", "##n = int(input())\r\n##a = list(map(int, input().split()))\r\n##print(\" \".join(map(str, res)))\r\n\r\n[n, a, b, c] = list(map(int, input().split()))\r\n\r\nres = 1e12\r\nfor i in range(0, 12):\r\n for j in range(0, 6):\r\n for k in range(0, 4):\r\n x = n+i+2*j+3*k\r\n if x%4 == 0:\r\n res = min(res, i*a+j*b+k*c)\r\nprint(res)", "def main():\r\n\t(n, a, b, c) = (int(x) for x in input().split())\r\n\tprint(solver(n, a, b, c))\r\n\r\ndef solver(n, a, b, c):\r\n\tif n % 4 == 0:\r\n\t\treturn 0\r\n\telif n % 4 == 1:\r\n\t\treturn min(3 * a, b + a, c)\r\n\telif n % 4 == 2:\r\n\t\treturn min(2 * a, b, 2 * c)\r\n\telif n % 4 == 3:\r\n\t\treturn min(a, b + c, 3 * c)\r\n\r\n# print(solver(1, 1, 3, 4))\r\n# print(solver(6, 2, 1, 1))\r\n# print(solver(4, 4, 4, 4))\r\n# print(solver(999999999, 1000000000, 1000000000, 1000000000\r\n# ) == 1000000000)\r\n\r\nmain()", "n, a, b, c = map(int, input().split())\n\nsum = -1\n\nfor A in range(4):\n for B in range(3):\n for C in range(4):\n N = n + A + B * 2 + C * 3\n if N % 4 == 0:\n if sum == -1 or A * a + B * b + C * c < sum:\n sum = A * a + B * b + C * c\n\nprint (sum)\n", "#!/usr/bin/env python3\n\nn, a, b, c = map(int, input().split())\nk = 4 - n%4\nif k == 1:\n print(min(a, b + c, 3*c, ))\nelif k == 2:\n print(min(2*a, b, 2*c))\nelif k == 3:\n print(min(3*a, a + b, c))\nelse:\n print(0)\n\n", "def get_min_rubles(n, l):\n if n % 4 == 0:\n return 0\n a, b, c = l[0], l[1], l[2]\n current_max = max(l) - min(l)\n aux = 0\n\n k_a, price_a, current_min = 1, 0, 10000000001\n\n ## xa, xa + b, xa + c\n while(k_a <= 10):\n if (n + k_a) % 4 == 0 and (k_a * a) < current_min:\n price_a = k_a * a\n current_min = price_a\n elif (n + k_a + 3) % 4 == 0 and (k_a * a + b) < current_min:\n price_a = k_a * a + b\n current_min = price_a\n elif (n + k_a + 4) % 4 == 0 and (k_a * a + c) < current_min:\n price_a = k_a * a + c\n current_min = price_a\n \n k_a += 1\n\n ## xb, xb + a, xb + c\n k_b, price_b, current_min = 2, 0, 10000000001\n while(k_b <= 20):\n if (n + k_b) % 4 == 0 and ((k_b //2) * b) < current_min:\n price_b = (k_b //2) * b\n current_min = price_b\n elif (n + k_b + 1) % 4 == 0 and ((k_b //2) * b + a) < current_min:\n price_b = (k_b //2) * b + a\n current_min = price_b\n elif (n + k_b + 3) % 4 == 0 and ((k_b //2) * b + c) < current_min:\n price_b = (k_b //2) * b + c\n current_min = price_b\n \n k_b += 2\n\n ## xc, xc + a, xc + b\n k_c, price_c, current_min = 3, 0, 10000000001\n while(k_c <= 30):\n \n if (n + k_c) % 4 == 0 and ((k_c//3) * c) < current_min:\n price_c = (k_c//3) * c\n current_min = price_c\n elif (n + k_c + 1) < n and ((k_c//3) * c + a) < current_min:\n price_c = (k_c//3) * c + a\n current_min = price_c\n elif (n + k_c + 2) % 4 == 0 and ((k_c//3) * c + b) < current_min:\n price_c = (k_c//3) * c + b\n current_min = price_c\n \n k_c += 3\n\n return min(price_a, price_b, price_c)\n \n \n\nprices = list(map(int, input().split()))\n\nprint(get_min_rubles(prices[0], prices[1:]))", "import sys\r\ninput = lambda : sys.stdin.readline()\r\n\r\ndef Main():\r\n n ,a , b , c = map(int,input().split())\r\n ans = 0\r\n mn = 11111111111111111111111111111\r\n\r\n for i in range(4):\r\n for j in range(4):\r\n for k in range(4):\r\n if (n+i+(2*j)+(3*k))%4 == 0:\r\n mn = min( mn, (a*i) + (b*j) + (c*k) )\r\n\r\n print(mn)\r\n\r\nif __name__ == '__main__':\r\n Main()", "n,a,b,c=map(int,input().split())\r\nc1=a\r\nc2=min(2*a,b)\r\nc3=min(3*a,a+b,c)\r\nif n%4==0: print(0)\r\nif n%4==1: print(c3)\r\nif n%4==2: print(min(c2,2*c3))\r\nif n%4==3: print(min(c1,c3+c2,3*c3))", "n,a,b,c=map(int,input().split())\r\ndef f(n):\r\n ans=float('inf')\r\n for ci in range(5):\r\n if ci*3>n:break\r\n for bi in range(5):\r\n if ci*3+bi*2>n:break\r\n ai = n - 3*ci - 2*bi\r\n if ai>=0 and bi>=0 and ci>=0 and ai+bi*2+ci*3==n:\r\n ans = min(ans, ai*a+bi*b+ci*c)\r\n return ans\r\n\r\nans=float('inf')\r\nfor k in range(20):\r\n if (n+k)%4==0:ans=min(ans,f(k))\r\nprint(ans)", "def copybooks(n, a, b, c):\r\n if n % 4 == 0:\r\n return 0\r\n elif n % 4 == 1:\r\n return min(3 * a, min(a + b, c))\r\n elif n % 4 == 2:\r\n return min(2 * a, min(b, 2 * c))\r\n elif n % 4 == 3:\r\n return min(a, min(b + c, 3 * c))\r\n\r\n\r\nN, A, B, C = [int(i) for i in input().split()]\r\nprint(copybooks(N, A, B, C))\r\n", "nabc = input().split()\r\nn = int(nabc[0])\r\na = int(nabc[1])\r\nb = int(nabc[2])\r\nc = int(nabc[3])\r\nif n%4 == 0:\r\n print(0)\r\nelif n%4 == 1:\r\n print(min(3*a,a+b,c,2*b+c))\r\nelif n%4 == 2:\r\n print(min(b,a*2,c*2))\r\nelse:\r\n print(min(a,b+c,c*3))\r\n \r\n \r\n \r\n \r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, a, b, c = map(int, input().split())\r\nx = [0, a, b, c]\r\nl = 20\r\ninf = pow(10, 12) + 1\r\ndp = [inf] * (l + 1)\r\ndp[n % 4] = 0\r\nfor i in range(l):\r\n for j in range(1, 4):\r\n if i + j > l:\r\n break\r\n dp[i + j] = min(dp[i + j], dp[i] + x[j])\r\nans = inf\r\nfor i in range(0, l + 1, 4):\r\n ans = min(ans, dp[i])\r\nprint(ans)", "import sys\r\n# sys.stdin = open('/home/doktorkrab/work/python/input.txt')\r\nn, a, b, c = map(int, input().split())\r\nb = min(b, a + a)\r\nc = min(c, b + a, a + a + a)\r\nprint([0, c, min(b, c+c), min(c+b, a, c + c + c)][n % 4])\r\n", "n,a,b,c = list(map(int,input().split()))\r\nresults =[]\r\nprices={1:a, 2:b, 3:c}\r\nt=[1,2,3]\r\nimport itertools\r\nfor i in range(8):\r\n d=list(itertools.product(t, repeat=i))\r\n for el in d:\r\n if (n + sum(el)) % 4 == 0:\r\n r=0\r\n for item in el:\r\n r+=prices[item]\r\n results.append(r)\r\nprint(min(results))\r\n", "n,a,b,c=map(int,input().split())\r\n\r\nxx=(n%4)\r\nif xx==0:\r\n print(\"0\")\r\nelif xx==1:\r\n print(min(a*3,a+b,c))\r\nelif xx==2:\r\n print(min(2*a,b,2*c))\r\nelse:\r\n print(min(a,b+c,3*c))\r\n" ]

[ "s=\"\"\r\nfor i in range(1,1000):\r\n f=str(i)\r\n s=s+f\r\nn=int(input())\r\nprint(s[n-1])\r\n", "\r\n\r\ns = ''\r\nfor i in range(1,371):\r\n s+=str(i)\r\ndef solve():\r\n n = int(input())\r\n print(s[n-1])\r\nfor _ in range(1):\r\n solve()\r\n", "a = int(input())\r\ns = \"\"\r\ni = 1\r\nwhile len(s) < a:\r\n s+=str(i)\r\n i+=1\r\nprint(s[a-1])", "\r\nenteros = ''\r\nfor i in range(1000):\r\n enteros += str(i)\r\n\r\nch = input(\"\")\r\nprint(enteros[int(ch)])\r\n\r\n", "full = \"\"\r\n\r\nfor i in range(1,400):\r\n full += str(i)\r\nn = int(input())\r\n\r\nprint(full[n-1])", "n = int(input())\n\ns = '1'\n\nfor i in range(2, n + 1):\n s += str(i)\n\nprint(s[n - 1])", "u=int(input())\r\ng=1\r\nr=''\r\nfor i in range(1,u+1):\r\n r=r+str(i)\r\nprint(r[u-1])\r\n", "n = int(input())\na = ''\nfor j in range(375):\n a = a + str(j)\nprint(a[n])\n", "#coding: utf-8\n\nlista = list(map(str,range(1,1001)))\nstring = ''.join(lista)\n\nn = int(input())\nprint(string[n-1])\n", "a=int(input())\ni=''\nnumber=1\nwhile len(i)<a:\n i+=str(number)\n number+=1\nprint(i[a-1])\n\t \t \t\t \t \t \t\t \t \t\t \t", "def solution672a():\n n = int(input())\n\n res = \"\"\n i = 1\n while len(res) < 1000:\n res += str(i)\n i += 1\n\n print(res[n - 1])\n\n\nif __name__ == '__main__':\n solution672a()\n", "a=''\nfor i in range(1,1000):\n a+=str(i)\n if len(a)>1000:\n break\nb=int(input())\nprint(a[b-1])\n\n \t \t\t \t \t \t\t\t \t\t\t \t\t \t", "qi=lambda:int(input())\r\nqs=lambda:input().split()\r\nn=qi()\r\nprint(''.join(str(i) for i in range(1,n+1))[n-1])", "n = int(input())\r\narr = list(map(str, range(n + 5)))\r\nst = \"\"\r\nfor i in arr:\r\n st += i\r\nprint(st[n])", "import math\ndef solve(n):\n arr = []\n for i in range(1,1001):\n arr += list(str(i))\n return arr[n-1]\ndef main():\n #i =list(map(int,input().split(' ')))\n n = int(input())\n #arr = []\n #for j in range(n):\n #i = list(map(int,input().split(' ')))\n # arr.append(i)\n print(solve(n))\n\nmain()", "def find_nth_digit(k):\r\n current_number = 1\r\n current_digit = 0\r\n while current_digit < k:\r\n num_digits = len(str(current_number))\r\n if current_digit + num_digits >= k:\r\n specific_digit = str(current_number)[k- current_digit - 1]\r\n return specific_digit\r\n current_digit += num_digits\r\n current_number += 1\r\nk= int(input())\r\nres = find_nth_digit(k)\r\nprint(res)\r\n", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\nprint(\"\".join(map(str,range(555)))[int(input())])\r\n# n=int(input())\r\n# l=[]\r\n# s=\"\"\r\n# for i in range(1,n+1):\r\n# \tl.append(str(i))\r\n# s=s.join(l)\r\n# for i in range(n+1):\r\n# \tif i==n:\r\n# \t\tprint(s[i-1])\r\n# \t\tbreak\r\n", "x=int(input())\r\nli=''.join([str(i) for i in range(1,x+1)])\r\nprint(li[x-1])\r\n", "n= int(input())\r\nif n <10:\r\n print(n)\r\nelif n <=189:\r\n c= ((n-9)//2+9+((n-9)%2))\r\n if (n-9)%2 ==0 :\r\n print(str(c)[1])\r\n else:\r\n print(str(c)[0])\r\nelif n<=1000:\r\n c= ((n-190)//3+ 100)\r\n if (n-190)%3 ==0 :\r\n print(str(c)[0])\r\n elif (n-190)%3 ==1 :\r\n print(str(c)[1])\r\n else:\r\n print(str(c)[2])", "n = int(input())\r\nstr1 = \"\"\r\nfor i in range(1,n+1):\r\n str1 = str1 + str(i)\r\nprint(str1[n-1]) \r\n ", "n = ''\r\nfor i in range(1, 1001):\r\n n += str(i)\r\nprint(n[int(input())-1])", "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\n# File : A.py\r\n# Author : JCHRYS <[email protected]>\r\n# Date : 09.09.2019\r\n# Last Modified Date: 09.09.2019\r\n# Last Modified By : JCHRYS <[email protected]>\r\n\r\nn = int(input())\r\ns = \"\";\r\nfor i in range(1, 1000):\r\n s += str(i);\r\nprint(s[n-1])\r\n", "\r\nn=int(input())\r\nlis=[i for i in range(1,n+1)]\r\ns=str()\r\nfor i in lis:\r\n\ts=s+str(i)\r\nprint(s[n-1])", "s = '123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370'\r\nprint(s[int(input())-1])", "# 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\nfrom math import lcm\r\n\r\n\r\nn = int(input())\r\n\r\nst = ''\r\nfor i in range(1,n+1):\r\n\tst+=str(i)\r\n# print(st)\r\nprint(st[n-1])", "a=int(input())\r\nif a<=9:\r\n print(a)\r\nelse:\r\n if a<=((90*2)+(9*1)):\r\n n=(a+10)//2\r\n if a%2==0:\r\n print(n//10)\r\n else:\r\n print(n%10)\r\n else:\r\n n=(a+110)//3\r\n if a%3==1:\r\n print(n//100)\r\n elif a%3==2:\r\n print((n%100)//10)\r\n else:\r\n print(n%10)", "s = \"123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499\"\r\nprint(s[int(input()) - 1])", "string=\"\"\r\nn=int(input())\r\nfor i in range(1,n+1):\r\n string+=str(i)\r\nprint(string[n-1])", "k = int(input())\r\nlength = 1\r\nwhile k > 9 * 10**(length-1) * length:\r\n k -= 9 * 10**(length-1) * length\r\n length += 1\r\nq, r = divmod(k-1, length)\r\nprint(str(10**(length-1) + q)[r])", "n=int(input())\r\nif n<10:\r\n print(n)\r\nelse:\r\n str_=\"\"\r\n for i in range(1,n):\r\n k=str(i)\r\n str_=str_+k \r\n \r\n print(str_[n-1])", "n = int(input())\r\nlst = ''\r\nfor i in range(1,n+1):\r\n lst += str(i)\r\n#print(lst)\r\nprint(lst[n-1])", "print(''.join(str(x) for x in range(371))[int(input())])", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\nu = []\r\nfor i in range(1, 1000):\r\n for j in str(i):\r\n u.append(j)\r\nans = u[n - 1]\r\nprint(ans)", "from sys import stdin, stdout\ndef read():\n\treturn stdin.readline().rstrip()\n\ndef read_int():\n\treturn int(read())\n \ndef read_ints():\n\treturn list(map(int, read().split()))\n \ndef solve():\n\tacc=0\n\tn=read_int()\n\ti=1\n\twhile True:\n\t\tif n<=acc+len(str(i)):\n\t\t\tprint(str(i)[n-acc-1])\n\t\t\treturn\n\t\tacc+=len(str(i))\n\t\ti+=1\n\nsolve()\n", "stri = \"\"\nfor i in range(1, 1000):\n stri += str(i)\nnum = int(input())\nprint(stri[num-1])", "n=int(input())\r\nst=\"\"\r\nfor i in range(1,1000+1):\r\n st+=str(i)\r\nprint(st[n-1])", "n=int(input());s=''\r\nfor i in range(1,n+1):s+=str(i)\r\nprint(s[n-1])", "x = int(input())\r\nlista = \"\"\r\nfor c in range(1, 1001):\r\n\tlista += str(c)\r\nprint(lista[x-1])", "s = ''\r\nfor i in range(1,371):\r\n\ts += str(i)\r\n\r\nn = int(input())\r\nprint(s[n-1])", "n = int(input())\r\n\r\ns = ''\r\n\r\nfor k in range(0, 1001):\r\n ch = k\r\n ch = str(ch)\r\n s += ch\r\n\r\nprint(s[n])\r\n\r\n", "n = int(input())\r\n\r\nl = \"\"\r\nnum = 1\r\nwhile len(l) <= n:\r\n l += str(num)\r\n num += 1\r\n\r\nprint(l[n - 1])", "# import sys\r\n# sys.stdin = open(\"test.in\",\"r\")\r\n# sys.stdout = open(\"test.out\",\"w\")\r\nn=int(input())\r\ns=''\r\na=1\r\nwhile len(s)<=n:\r\n\ts+=str(a)\r\n\ta+=1\r\nprint(s[n-1])\t\r\n", "\"\"\"\r\n██╗ ██████╗ ██╗ ██████╗ ██████╗ ██╗ █████╗\r\n██║██╔═══██╗██║ ╚════██╗██╔═████╗███║██╔══██╗\r\n██║██║ ██║██║ █████╔╝██║██╔██║╚██║╚██████║\r\n██║██║ ██║██║ ██╔═══╝ ████╔╝██║ ██║ ╚═══██║\r\n██║╚██████╔╝██║ ███████╗╚██████╔╝ ██║ █████╔╝\r\n╚═╝ ╚═════╝ ╚═╝ ╚══════╝ ╚═════╝ ╚═╝ ╚════╝\r\n\"\"\" \r\n__author__ = \"Dilshod\"\r\nn = int(input())\r\ndigit = \"\"\r\nfor i in range(1, 1001):\r\n\tdigit += str(i)\r\nprint(digit[n - 1])\r\n", "import sys\r\n\r\nfor n in map(int, sys.stdin):\r\n cnt = 0\r\n for i in range(1, sys.maxsize):\r\n if i > 99:\r\n cnt += 3\r\n elif i > 9:\r\n cnt += 2\r\n else:\r\n cnt += 1\r\n \r\n if cnt >= n:\r\n num = i\r\n break\r\n \r\n if cnt == n:\r\n ans = num % 10\r\n else:\r\n pos = cnt - n\r\n if pos == 1:\r\n ans = (num // 10) % 10\r\n else:\r\n ans = (num // 100) % 10\r\n \r\n print(ans)\r\n", "n=input()\r\ns=str()\r\nfor i in range(1,370+1):\r\n\ts+=str(i)\r\nprint(s[int(n)-1])", "n,s=int(input()),\"\"\r\nfor i in range(500):\r\n s+=str(i)\r\nprint(s[n])", "num= int(input())\r\nx=1\r\nst=str(x)\r\nwhile(len(st)<num):\r\n x+=1\r\n st+=str(x)\r\n\r\nprint(st[num-1])", "n=int(input())\r\nif n>9: \r\n l=list(range(1,n+1)) \r\n s=str(l)[1:-1]\r\n s=s.replace(', ','')\r\n s=s.replace(\" \",'')\r\n print(s[n-1])\r\nelse:\r\n print(n)", "s=\"\"\nn=int(input())\ni=1\nwhile(len(s)<n):\n s=s+str(i)\n i+=1\nprint(s[n-1])", "n = int(input())\r\nl = []\r\nfor i in range(n):\r\n\tl.append(i+1)\r\nl = list(map(str,l))\r\nl = \"\".join(l)\r\nprint(l[n-1])", "n=int(input())\r\na=[str(i+1) for i in range(n)]\r\ns=\"\".join(a)\r\ns=list(s)\r\ns=\"\".join(s)\r\nprint(s[n-1])", "n = int(input())\r\nnuml = ''\r\nfor i in range(1,n+1):\r\n numl = numl + str(i)\r\nprint(numl[n-1])", "n=(int)(input())\r\ns=\"\"\r\nfor i in range(0,1000):\r\n s+=str(i)\r\nprint(s[n])", "t=int(input())\r\nst=\"\".join(str(i) for i in range(1,t+1))\r\nprint(st[t-1])", "s=\"\"\r\nfor i in range(1,500):\r\n s+=str(i)\r\nprint(s[int(input())-1])\r\n", "k=[]\r\nfor i in range(1,1001):\r\n k.append(str(i))\r\ns=''.join(k)\r\nprint(s[int(input())-1])", "x=int(input())\r\ns=\" \"\r\nfor i in range(1,1002):\r\n s+=str(i)\r\nprint(s[x])", "n=int(input())\r\nstringfady= \"\"\r\ni=1\r\nwhile len(stringfady) < n :\r\n\td=str(i)\r\n\tstringfady += d\r\n\ti+=1\r\nprint(stringfady[n-1])\r\n\r\n\r\n", "s=\"\"\r\n\r\ndef f():\r\n\tglobal s\r\n\tfor i in range(1,1001):\r\n\t\ts = s+ str(i)\r\n\r\n\r\nf()\r\nn=int(input())\r\n\r\nprint(s[n-1])", "st=\"\"\nfor i in range(1,1000):\n\tst+=str(i)\nprint(st[int(input())-1])\n\t \t\t \t\t \t \t \t \t\t \t \t\t \t \t", "n = int(input())\r\nstrr = \"\".join(str(i) for i in range(1 , 1001))\r\nprint(strr[n-1])", "n = int(input())\r\nk = \"\".join(map(str, [i for i in range(1,1001)]))\r\nprint(k[n-1])", "\r\nprint(\"\".join([str(x) for x in range(1001)])[int(input())])", "num = int(input())\r\nstring = ''\r\nfor i in range(num):\r\n b = str(i + 1)\r\n string = string + b\r\nprint(string[num-1])", "from collections import Counter\r\ndef func():\r\n n=int(input())\r\n k=n\r\n #print(len(str(k)))\r\n for i in range(1,k+1):\r\n if n>len(str(i)):\r\n n-=len(str(i))\r\n else:\r\n break\r\n # print(i,n)\r\n p=str(i)\r\n print(p[n-1])\r\nt=1\r\n#t=int(input())\r\nfor i in range(t):\r\n func()", "n = int(input())\r\nx = []\r\nfor i in range(1,n+1):\r\n\tx.append(str(i))\r\ny = \"\".join(x)\r\nprint(y[n-1])", "n=int(input())\r\nif n<10:\r\n print(n)\r\nelse:\r\n s=''\r\n for i in range(10,10+n//2):\r\n s+=str(i)\r\n for i in range(int(len(s))):\r\n if i==n-10:\r\n print(s[i])\r\n break", "n=int(input())\r\ns=\"\"\r\ni=1\r\nwhile len(s)<n:\r\n s=s+str(i)\r\n i+=1\r\nprint(s[n-1])", "import math\r\n\r\ndef solve():\r\n n = int(input())\r\n if n <= 9:\r\n print(n)\r\n elif n <= 189:\r\n num = (n - 10) / 2 + 10\r\n mod = (n - 10) % 2\r\n s = str(num)\r\n print(s[mod])\r\n else:\r\n num = (n - 10 - 90 * 2) / 3 + 100\r\n mod = (n - 10 - 90 * 2) % 3\r\n s = str(num)\r\n print(s[mod])\r\n\r\ndef main():\r\n t = 1\r\n for _ in range(t):\r\n solve()\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n=int(input())\r\nstrng=''\r\nfor i in range(1,n+1):\r\n strng+=str(i)\r\n p=''.join(strng)\r\nx=strng[n-1]\r\nprint(x)", "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\n\r\n1\r\n1 2 | 2 1\r\n1 2 3 | \r\n\r\n1 2 3 4 | 1 3 2 4\r\n'''\r\n\r\n# sys.stdin = open(\"backforth.in\", \"r\")\r\n# sys.stdout = open(\"backforth.out\", \"w\")\r\ninput = sys.stdin.readline\r\n\r\ndef dist(c1, c2):\r\n return abs(c1[0] - c2[0]) + abs(c1[1] - c2[1])\r\n\r\ndef solve():\r\n t = II()\r\n ans = [-1]\r\n for i in range(1,1001):\r\n s = str(i)\r\n for c in s:\r\n ans.append(int(c))\r\n print(ans[t])\r\n # print(len(ans), WNS(ans))\r\n\r\nsolve()", "a = \"\".join([str(i) for i in range(1000)])\nprint(a[int(input())])\n", "print(''.join(map(str, list(range(1000))))[int(input())])", "x=int(input())\r\nl=[i for i in range(1,2001)]\r\ns=\"\".join(map(str,l))\r\nfor i in range(1,len(s)+1):\r\n\tprint(s[x-1])\r\n\tbreak", "print(''.join(map(str, range(555)))[int(input())])", "s=\"\"\r\nfor i in range(400):\r\n s=s+str(i)\r\nn=int(input())\r\nprint(s[n])", "n = int(input())\r\n\r\nright = 1\r\ni = 0\r\n \r\nwhile right <= n: \r\n left = right\r\n right += 9 * (i + 1) * 10 ** i\r\n i += 1\r\ntarget_num = 10 ** (i - 1) + (n - left) // i\r\nprint(str(target_num)[(n - left) % i])\r\n\r\n", "s = \"\".join([str(i) for i in range(1, 500)])\r\nn = int(input())\r\nprint(s[n-1])\r\n", "n = int(input())\r\nc = \"\"\r\nx = 1\r\nwhile len(c) < n:\r\n\tc += str(x);\r\n\tx += 1\r\nprint (c[n-1:n])", "strn = ''\r\nfor i in range(1,375):\r\n strn += str(i)\r\nn = int(input())\r\nprint(strn[n-1])", "n = int(input())\ntext = ''\ni = 0\nwhile len(text) <= n:\n text += str(i)\n i += 1\nprint(text[n])", "n = int(input())\n\nstring = \"\"\nc = 1\nwhile len(string) < n:\n string += str(c)\n c += 1\n\nprint(string[n - 1])\n", "n = int(input())\r\ns = '1'\r\nnum = 2\r\nwhile len(s) < n:\r\n s += str(num)\r\n num += 1\r\nprint(s[n - 1])\r\n", "def fill_arr(n,m):\r\n return [str(x) for x in range(n,m)]\r\nn=int(input())\r\narr=fill_arr(1,371)\r\narr=''.join(arr)\r\nprint(arr[n-1])", "def create_num_line():\r\n\ts = str()\r\n\r\n\tfor i in range(1, 1001):\r\n\t\ts += str(i)\r\n\r\n\treturn s\r\n\r\ns = create_num_line()\r\n\r\nn = int(input())\r\nprint(s[n-1])", "n=int(input())\r\nz1=list(range(1,n+1))\r\nsample=\"\"\r\nfor i in range(0,len(z1)):\r\n\tsample+=str(z1[i])\r\nprint(sample[n-1])", "def solve(n):\r\n\r\n s = \"\"\r\n for i in range(1, n+1):\r\n s += str(i)\r\n\r\n return s[n-1]\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n print(solve(n))", "s=\"\"\r\ni=1\r\nwhile len(s)<=1000:\r\n s+=str(i)\r\n i=i+1\r\nn=int(input())\r\nprint(s[n-1])", "# 672A\nif __name__ == '__main__':\n n = int(input())\n curStr, curNum = \"\", 1\n while len(curStr) <= n:\n curStr += str(curNum)\n curNum += 1\n print(curStr[n - 1])", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef main():\r\n A = []\r\n for i in range(1, 1000):\r\n A.append(str(i))\r\n s = ''.join(A)\r\n n = int(input())\r\n print(s[n-1])\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n=int(input())\r\ns=\"0\"\r\nfor i in range (1,n+1):\r\n s+=str(i)\r\nprint(s[n])\r\n", "n = int(input())\r\nx = ''\r\nfor i in range(1, 1001):\r\n x = x + str(i)\r\nprint(x[n-1])\r\n\r\n", "n=int(input())\r\nL=\"\".join([str(k) for k in range(1,n+1)])\r\nprint(L[n-1])\r\n", "n = int(input())\r\ns = \"123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399\"\r\nprint(s[n-1])", "s = ''\r\nn = 1\r\nwhile len(s) < 1000: # Generate string\r\n s = s + str(n)\r\n n = n + 1\r\nn = int(input()) # Get position\r\nprint(s[n-1])", "a=int(input())\r\ns=\"\"\r\nfor i in range(1000):\r\n s+=str(i)\r\nprint(s[a])", "n = int(input())\nnums = '' \nfor i in range(1, 1001):\n nums = nums + str(i)\n\nprint(nums[n-1])\n", "arr= \"\".join(str(x) for x in range(1,1001))\r\nprint(arr[int(input())-1])", "n = int(input())\nres = \"\".join([str(i) for i in range(1, n + 1)])[n - 1]\nprint(res)\n", "n = int(input())\r\nc = ''\r\nfor i in range(1000):\r\n c += str(i)\r\nprint(c[n])", "a=int(input())\r\nt=\"\"\r\nfor i in range(1,a+1):\r\n f=i\r\n f=str(f)\r\n t=t+f\r\nprint(t[a-1])", "def main():\r\n n = int(input())\r\n if n < 10:\r\n return n\r\n if n < 190:\r\n n -= 10\r\n return str(n // 2 + 10)[n % 2]\r\n n -= 190\r\n return str(n // 3 + 100)[n % 3]\r\n\r\n\r\nif __name__ == '__main__':\r\n print(main())\r\n", "n = int(input())\r\nprint(''.join(map(str, range(0, 555)))[n])", "n = int(input())\r\na = \"\"\r\ni = 1\r\n\r\nwhile len(a) < n:\r\n a += str(i)\r\n i += 1\r\n\r\nprint(a[n-1])", "a=int(input())\r\nb=str(\"\")\r\nx=int(1)\r\nwhile x<=a:\r\n b=b+str(x)\r\n x=x+1\r\nprint(b[a-1])", "n = int(input())\r\ns = ''\r\ncur = 1\r\nwhile len(s) <= n:\r\n\ts += str(cur)\r\n\tcur += 1\r\nprint(s[n - 1])", "a=int(input())\r\nb=[1]\r\nfor z in range(a):\r\n b.append(b[z]+1)\r\ns = ''.join(map(str, b))\r\nprint(s[a-1])", "s=[]\r\nfor i in range(1,400):\r\n l=str(i)\r\n for j in l:\r\n s.append(j)\r\ns1=''.join(s)\r\nn=int(input())\r\nprint(s[n-1])", "n=int(input())\r\nx=[]\r\nfor i in range(1,1001):\r\n x.append(str(i))\r\nz=\"\".join(x)\r\nprint(z[n-1])", "n = int(input())\nlst = list(range(1, 1001))\nst = ''\nfor i in lst:\n st += str(i)\nprint(st[n - 1])\n\t\t\t \t\t \t \t\t\t \t\t \t \t\t \t \t\t \t", "n = int(input())\r\nline = ''.join([str(i) for i in range(371)])\r\n\r\nprint(line[n])\r\n", "n = int(input())\r\ns = ''\r\nk = 1\r\nfor i in range(1000):\r\n s+=str(k)\r\n k+=1\r\nprint(s[n-1])\r\n", "n = int(input())\ncn = '0'\nc = []\ncc = 1\n\nwhile True:\n\tcn = str(int(cn) + 1)\n\tc = [cc + i for i in range(len(cn))]\n\tif n in c:\n\t\tprint(cn[c.index(n)])\n\t\tbreak\n\telse:\n\t\tcc = c[-1] + 1\n", "N = int(input())\r\ns = \"\"\r\n\r\nfor i in range(1,N+1):\r\n\ts += str(i)\r\n\r\nprint(s[N-1])\r\n", "n = int(input())\r\nl = []\r\nfor i in range(1, 1001):\r\n l.append(i)\r\ns = ''.join([str(elem) for elem in l])\r\nprint(s[n - 1])", "a=[1,2,3,4,5,6,7,8,9,1,0,1,1,1,2,1,3,1,4,1,5,1,6,1,7,1,8,1,9,2,0,2,1,2,2,2,3,2,4,2,5,2,6,2,7,2,8,2,9,3,0,3,1,3,2,3,3,3,4,3,5,3,6,3,7,3,8,3,9,4,0,4,1,4,2,4,3,4,4,4,5,4,6,4,7,4,8,4,9,5,0,5,1,5,2,5,3,5,4,5,5,5,6,5,7,5,8,5,9,6,0,6,1,6,2,6,3,6,4,6,5,6,6,6,7,6,8,6,9,7,0,7,1,7,2,7,3,7,4,7,5,7,6,7,7,7,8,7,9,8,0,8,1,8,2,8,3,8,4,8,5,8,6,8,7,8,8,8,9,9,0,9,1,9,2,9,3,9,4,9,5,9,6,9,7,9,8,9,9,1,0,0,1,0,1,1,0,2,1,0,3,1,0,4,1,0,5,1,0,6,1,0,7,1,0,8,1,0,9,1,1,0,1,1,1,1,1,2,1,1,3,1,1,4,1,1,5,1,1,6,1,1,7,1,1,8,1,1,9,1,2,0,1,2,1,1,2,2,1,2,3,1,2,4,1,2,5,1,2,6,1,2,7,1,2,8,1,2,9,1,3,0,1,3,1,1,3,2,1,3,3,1,3,4,1,3,5,1,3,6,1,3,7,1,3,8,1,3,9,1,4,0,1,4,1,1,4,2,1,4,3,1,4,4,1,4,5,1,4,6,1,4,7,1,4,8,1,4,9,1,5,0,1,5,1,1,5,2,1,5,3,1,5,4,1,5,5,1,5,6,1,5,7,1,5,8,1,5,9,1,6,0,1,6,1,1,6,2,1,6,3,1,6,4,1,6,5,1,6,6,1,6,7,1,6,8,1,6,9,1,7,0,1,7,1,1,7,2,1,7,3,1,7,4,1,7,5,1,7,6,1,7,7,1,7,8,1,7,9,1,8,0,1,8,1,1,8,2,1,8,3,1,8,4,1,8,5,1,8,6,1,8,7,1,8,8,1,8,9,1,9,0,1,9,1,1,9,2,1,9,3,1,9,4,1,9,5,1,9,6,1,9,7,1,9,8,1,9,9,2,0,0,2,0,1,2,0,2,2,0,3,2,0,4,2,0,5,2,0,6,2,0,7,2,0,8,2,0,9,2,1,0,2,1,1,2,1,2,2,1,3,2,1,4,2,1,5,2,1,6,2,1,7,2,1,8,2,1,9,2,2,0,2,2,1,2,2,2,2,2,3,2,2,4,2,2,5,2,2,6,2,2,7,2,2,8,2,2,9,2,3,0,2,3,1,2,3,2,2,3,3,2,3,4,2,3,5,2,3,6,2,3,7,2,3,8,2,3,9,2,4,0,2,4,1,2,4,2,2,4,3,2,4,4,2,4,5,2,4,6,2,4,7,2,4,8,2,4,9,2,5,0,2,5,1,2,5,2,2,5,3,2,5,4,2,5,5,2,5,6,2,5,7,2,5,8,2,5,9,2,6,0,2,6,1,2,6,2,2,6,3,2,6,4,2,6,5,2,6,6,2,6,7,2,6,8,2,6,9,2,7,0,2,7,1,2,7,2,2,7,3,2,7,4,2,7,5,2,7,6,2,7,7,2,7,8,2,7,9,2,8,0,2,8,1,2,8,2,2,8,3,2,8,4,2,8,5,2,8,6,2,8,7,2,8,8,2,8,9,2,9,0,2,9,1,2,9,2,2,9,3,2,9,4,2,9,5,2,9,6,2,9,7,2,9,8,2,9,9,3,0,0,3,0,1,3,0,2,3,0,3,3,0,4,3,0,5,3,0,6,3,0,7,3,0,8,3,0,9,3,1,0,3,1,1,3,1,2,3,1,3,3,1,4,3,1,5,3,1,6,3,1,7,3,1,8,3,1,9,3,2,0,3,2,1,3,2,2,3,2,3,3,2,4,3,2,5,3,2,6,3,2,7,3,2,8,3,2,9,3,3,0,3,3,1,3,3,2,3,3,3,3,3,4,3,3,5,3,3,6,3,3,7,3,3,8,3,3,9,3,4,0,3,4,1,3,4,2,3,4,3,3,4,4,3,4,5,3,4,6,3,4,7,3,4,8,3,4,9,3,5,0,3,5,1,3,5,2,3,5,3,3,5,4,3,5,5,3,5,6,3,5,7,3,5,8,3,5,9,3,6,0,3,6,1,3,6,2,3,6,3,3,6,4,3,6,5,3,6,6,3,6,7,3,6,8,3,6,9,3,7,0,3,7,1,3,7,2,3,7,3,3,7,4,3,7,5,3,7,6,3,7,7,3,7,8,3,7,9,3,8,0,3,8,1,3,8,2,3,8,3,3,8,4,3,8,5,3,8,6,3,8,7,3,8,8,3,8,9,3,9,0,3,9,1,3,9,2,3,9,3,3,9,4,3,9,5,3,9,6,3,9,7,3,9,8,3,9,9,4,0,0,4,0,1,4,0,2,4,0,3,4,0,4,4,0,5,4,0,6,4,0,7,4,0,8,4,0,9,4,1,0,4,1,1,4,1,2,4,1,3,4,1,4,4,1,5,4,1,6,4,1,7,4,1,8,4,1,9,4,2,0,4,2,1,4,2,2,4,2,3,4,2,4,4,2,5,4,2,6,4,2,7,4,2,8,4,2,9,4,3,0,4,3,1,4,3,2,4,3,3,4,3,4,4,3,5,4,3,6,4,3,7,4,3,8,4,3,9,4,4,0,4,4,1,4,4,2,4,4,3,4,4,4,4,4,5,4,4,6,4,4,7,4,4,8,4,4,9,4,5,0,4,5,1,4,5,2,4,5,3,4,5,4,4,5,5,4,5,6,4,5,7,4,5,8,4,5,9,4,6,0,4,6,1,4,6,2,4,6,3,4,6,4,4,6,5,4,6,6,4,6,7,4,6,8,4,6,9,4,7,0,4,7,1,4,7,2,4,7,3,4,7,4,4,7,5,4,7,6,4,7,7,4,7,8,4,7,9,4,8,0,4,8,1,4,8,2,4,8,3,4,8,4,4,8,5,4,8,6,4,8,7,4,8,8,4,8,9,4,9,0,4,9,1,4,9,2,4,9,3,4,9,4,4,9,5,4,9,6,4,9,7,4,9,8,4,9,9,5,0,0,5,0,1,5,0,2,5,0,3,5,0,4,5,0,5,5,0,6,5,0,7,5,0,8,5,0,9,5,1,0,5,1,1,5,1,2,5,1,3,5,1,4,5,1,5,5,1,6,5,1,7,5,1,8,5,1,9,5,2,0,5,2,1,5,2,2,5,2,3,5,2,4,5,2,5,5,2,6,5,2,7,5,2,8,5,2,9,5,3,0,5,3,1,5,3,2,5,3,3,5,3,4,5,3,5,5,3,6,5,3,7,5,3,8,5,3,9,5,4,0,5,4,1,5,4,2,5,4,3,5,4,4,5,4,5,5,4,6,5,4,7,5,4,8,5,4,9,5,5,0,5,5,1,5,5,2,5,5,3,5,5,4,5,5,5,5,5,6,5,5,7,5,5,8,5,5,9,5,6,0,5,6,1,5,6,2,5,6,3,5,6,4,5,6,5,5,6,6,5,6,7,5,6,8,5,6,9,5,7,0,5,7,1,5,7,2,5,7,3,5,7,4,5,7,5,5,7,6,5,7,7,5,7,8,5,7,9,5,8,0,5,8,1,5,8,2,5,8,3,5,8,4,5,8,5,5,8,6,5,8,7,5,8,8,5,8,9,5,9,0,5,9,1,5,9,2,5,9,3,5,9,4,5,9,5,5,9,6,5,9,7,5,9,8,5,9,9,6,0,0,6,0,1,6,0,2,6,0,3,6,0,4,6,0,5,6,0,6,6,0,7,6,0,8,6,0,9,6,1,0,6,1,1,6,1,2,6,1,3,6,1,4,6,1,5,6,1,6,6,1,7,6,1,8,6,1,9,6,2,0,6,2,1,6,2,2,6,2,3,6,2,4,6,2,5,6,2,6,6,2,7,6,2,8,6,2,9,6,3,0,6,3,1,6,3,2,6,3,3,6,3,4,6,3,5,6,3,6,6,3,7,6,3,8,6,3,9,6,4,0,6,4,1,6,4,2,6,4,3,6,4,4,6,4,5,6,4,6,6,4,7,6,4,8,6,4,9,6,5,0,6,5,1,6,5,2,6,5,3,6,5,4,6,5,5,6,5,6,6,5,7,6,5,8,6,5,9,6,6,0,6,6,1,6,6,2,6,6,3,6,6,4,6,6,5,6,6,6,6,6,7,6,6,8,6,6,9,6,7,0,6,7,1,6,7,2,6,7,3,6,7,4,6,7,5,6,7,6,6,7,7,6,7,8,6,7,9,6,8,0,6,8,1,6,8,2,6,8,3,6,8,4,6,8,5,6,8,6,6,8,7,6,8,8,6,8,9,6,9,0,6,9,1,6,9,2,6,9,3,6,9,4,6,9,5,6,9,6,6,9,7,6,9,8,6,9,9,7,0,0,7,0,1,7,0,2,7,0,3,7,0,4,7,0,5,7,0,6,7,0,7,7,0,8,7,0,9,7,1,0,7,1,1,7,1,2,7,1,3,7,1,4,7,1,5,7,1,6,7,1,7,7,1,8,7,1,9,7,2,0,7,2,1,7,2,2,7,2,3,7,2,4,7,2,5,7,2,6,7,2,7,7,2,8,7,2,9,7,3,0,7,3,1,7,3,2,7,3,3,7,3,4,7,3,5,7,3,6,7,3,7,7,3,8,7,3,9,7,4,0,7,4,1,7,4,2,7,4,3,7,4,4,7,4,5,7,4,6,7,4,7,7,4,8,7,4,9,7,5,0,7,5,1,7,5,2,7,5,3,7,5,4,7,5,5,7,5,6,7,5,7,7,5,8,7,5,9,7,6,0,7,6,1,7,6,2,7,6,3,7,6,4,7,6,5,7,6,6,7,6,7,7,6,8,7,6,9,7,7,0,7,7,1,7,7,2,7,7,3,7,7,4,7,7,5,7,7,6,7,7,7,7,7,8,7,7,9,7,8,0,7,8,1,7,8,2,7,8,3,7,8,4,7,8,5,7,8,6,7,8,7,7,8,8,7,8,9,7,9,0,7,9,1,7,9,2,7,9,3,7,9,4,7,9,5,7,9,6,7,9,7,7,9,8,7,9,9,8,0,0,8,0,1,8,0,2,8,0,3,8,0,4,8,0,5,8,0,6,8,0,7,8,0,8,8,0,9,8,1,0,8,1,1,8,1,2,8,1,3,8,1,4,8,1,5,8,1,6,8,1,7,8,1,8,8,1,9,8,2,0,8,2,1,8,2,2,8,2,3,8,2,4,8,2,5,8,2,6,8,2,7,8,2,8,8,2,9,8,3,0,8,3,1,8,3,2,8,3,3,8,3,4,8,3,5,8,3,6,8,3,7,8,3,8,8,3,9,8,4,0,8,4,1,8,4,2,8,4,3,8,4,4,8,4,5,8,4,6,8,4,7,8,4,8,8,4,9,8,5,0,8,5,1,8,5,2,8,5,3,8,5,4,8,5,5,8,5,6,8,5,7,8,5,8,8,5,9,8,6,0,8,6,1,8,6,2,8,6,3,8,6,4,8,6,5,8,6,6,8,6,7,8,6,8,8,6,9,8,7,0,8,7,1,8,7,2,8,7,3,8,7,4,8,7,5,8,7,6,8,7,7,8,7,8,8,7,9,8,8,0,8,8,1,8,8,2,8,8,3,8,8,4,8,8,5,8,8,6,8,8,7,8,8,8,8,8,9,8,9,0,8,9,1,8,9,2,8,9,3,8,9,4,8,9,5,8,9,6,8,9,7,8,9,8,8,9,9,9,0,0,9,0,1,9,0,2,9,0,3,9,0,4,9,0,5,9,0,6,9,0,7,9,0,8,9,0,9,9,1,0,9,1,1,9,1,2,9,1,3,9,1,4,9,1,5,9,1,6,9,1,7,9,1,8,9,1,9,9,2,0,9,2,1,9,2,2,9,2,3,9,2,4,9,2,5,9,2,6,9,2,7,9,2,8,9,2,9,9,3,0,9,3,1,9,3,2,9,3,3,9,3,4,9,3,5,9,3,6,9,3,7,9,3,8,9,3,9,9,4,0,9,4,1,9,4,2,9,4,3,9,4,4,9,4,5,9,4,6,9,4,7,9,4,8,9,4,9,9,5,0,9,5,1,9,5,2,9,5,3,9,5,4,9,5,5,9,5,6,9,5,7,9,5,8,9,5,9,9,6,0,9,6,1,9,6,2,9,6,3,9,6,4,9,6,5,9,6,6,9,6,7,9,6,8,9,6,9,9,7,0,9,7,1,9,7,2,9,7,3,9,7,4,9,7,5,9,7,6,9,7,7,9,7,8,9,7,9,9,8,0,9,8,1,9,8,2,9,8,3,9,8,4,9,8,5,9,8,6,9,8,7,9,8,8,9,8,9,9,9,0,9,9,1,9,9,2,9,9,3,9,9,4,9,9,5,9,9,6,9,9,7,9,9,8,9,9,9,1,0,0,0]\r\n\r\n\r\n\r\n\r\n\r\nn=int(input())\r\nn-=1\r\n\r\nprint(a[n])\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\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=[]\r\nfor i in range(1,1001):\r\n b=([int(i) for i in str(i)])\r\n for j in range(len(b)):\r\n a.append(b[j])\r\n\r\n\r\nfor i in range(len(a)):\r\n print(a[i],end=',')\r\n'''", "import math\r\n\r\n\r\ndef main():\r\n\tn = int(input())\r\n\ts = \"\"\r\n\t\r\n\tfor i in range(1000):\r\n\t\ts += str(i)\r\n\t\tif (len(s) > 1000):\r\n\t\t\tbreak\r\n\t\r\n\tfor i in range(len(s)):\r\n\t\tif i == n:\r\n\t\t\tprint(s[i])\r\nmain()\r\n \r\n", "n = int(input())\narr = list(map(str, range(n + 5)))\nst = \"\"\nfor i in arr:\n st += i\nprint(st[n])\n \t \t\t \t \t \t\t\t \t\t\t\t \t\t\t \t\t \t\t\t", "n=int(input())\r\nl=[]\r\nfor i in range(1,n+1):\r\n\tl.append(str(i))\r\ns=\"\".join(l)\r\nprint(s[n-1])", "s=\"\"\r\ni=1\r\nwhile len(s)<1001:\r\n\ts+=str(i)\r\n\ti+=1\r\nprint(s[int(input())-1])", "s = ''.join(map(str,range(1,400)))\r\nn = int(input())\r\nprint(s[n-1])", "x=int(input())\r\ns=\"\"\r\nfor i in range(1,x+1):\r\n s=s+str(i)\r\nprint(s[x-1]) ", "n = int(input())\r\nrep=''\r\nfor i in range(1,n+1):\r\n rep+=str(i)\r\nprint(rep[n-1])\r\n", "print(''.join([str(i) for i in range(1000)])[int(input())])", "n=int(input())\r\nx=\"\"\r\nfor i in range(1,1001):\r\n\tx=x+str(i)\r\nl1=list(x)\r\n# print(l1)\r\nprint(l1[n-1])\r\n", "f,n = '',int(input())\r\nfor i in range(n + 1):\r\n f += str(i)\r\nprint(f[n])", "n = int(input())\r\n\r\ndigits = \"\"\r\nfor i in range(1, 1001):\r\n digits += str(i)\r\n\r\nprint(digits[n-1])", "n = int(input())\r\na=''\r\nfor i in range(n*10):\r\n a+=str(i+1)\r\nprint(a[n-1])", "n=int(input())\r\nS=\"\"\r\nfor i in range(500):\r\n S+=str(i)\r\nprint(S[n])", "def main():\n n = int(input())\n print(''.join(map(str, list(range(1, 800))))[n-1])\n\n\nmain()\n", "n = (int)(input ())\ns = \"\"\nfor i in range(1, 1000):\n s += str(i)\n\nprint (s[n - 1])\n \t\t \t\t\t\t \t\t\t\t\t\t \t \t\t \t", "l=\" \"\r\nfor i in range(1,1000):\r\n l+=str(i)\r\nn=int(input())\r\n\r\nprint(l[n])\r\n \r\n \r\n", "n = int(input())\r\nr=''\r\nfor i in range(1,n+1):\r\n r+=str(i)\r\n\r\nfor i,j in enumerate(r):\r\n if i+1==n:\r\n print(r[i])", "a= [str(x) for x in range(0,371)]\r\nprint (''.join(a)[int(input())])", "n = int(input())\r\ns = \"\".join(map(str, range(1,1000))) \r\nprint(s[n-1])", "n=int(input())\ns=''.join(str(i) for i in range(1,1001))\nprint(s[n-1])\n\n \t\t \t \t\t \t\t \t\t\t \t \t \t\t \t\t", "r=\"\"\r\nfor i in range(1,1001):\r\n r+=str(i)\r\nn=int(input())\r\nprint(r[n-1])", "n = int(input())\ns = \"123456789\"\n\nif n <= 9:\n print(n)\nelse:\n for i in range(10, n+1):\n s+= str(i)\n print(s[n - 1]) ", "full = \"\"\r\n\r\nfor i in range(1,1000):\r\n full += str(i)\r\nn = int(input())\r\n\r\nprint(full[n-1])", "l=''\r\nk=int(input())\r\nindex=0\r\ncounter=1\r\nwhile True:\r\n for i in str(counter):\r\n if index<=k-1:\r\n l+=i\r\n index+=1\r\n counter+=1\r\n if index>k-1:\r\n break \r\n \r\nif 1<=k <=1000: \r\n print(l[k-1])\r\n", "s=''\nfor i in range(1000):\n s+=str(i)\nn=int(input())\nprint(s[n])\n\n \t\t\t\t\t\t \t\t \t\t\t\t\t \t \t\t\t \t\t\t\t", "# import sys\n# sys.stdin=open('input.in','r')\n# sys.stdout=open('output.out','w')\nl=list(x for x in range(1,1001))\nl=''.join(map(str,l))\nk=int(input())\nprint(l[k-1])", "t=int(input())\r\ns=''\r\nfor i in range(1,t+1):\r\n s+=str(i)\r\nprint(s[t-1])", "s=''.join(str(x) for x in range(1, 500))\r\nprint(s[int(input())-1])", "n=int(input())\r\nif n<=9:\r\n\tprint(n)\r\nelif n<=189:\r\n\tn=n+10\r\n\tif n%2==0:\r\n\t\tn=n//2\r\n\t\tprint(n//10)\r\n\telse:\r\n\t\tn=n//2\r\n\t\tprint(n%10)\r\nelse:\r\n\tn=n+110\r\n\tif n%3==0:\r\n\t\tn=n//3\r\n\t\tprint(n//100)\r\n\telif n%3==1:\r\n\t\tn=n//3\r\n\t\tn=n//10\r\n\t\tprint(n%10)\r\n\telse:\r\n\t\tn=n//3\r\n\t\tprint(n%10)", "A = list(\"\".join(list(str(x) for x in range(1,1001))))\nprint(A[int(input())-1])\n", "\r\n\r\n\r\nn = int(input())\r\nl = []\r\nfor i in range(1, n+1):\r\n l.append(str(i))\r\ns = ''.join(l)\r\nprint(s[n-1])\r\n", "hat = int(input())\r\ntext = \"\"\r\nfor i in range(1,371):\r\n text += str(i)\r\nprint(text[hat-1])\r\n", "a = int(input())\r\np = []\r\n\r\ns = \"1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984993\"\r\nfor i in s:\r\n p.append(i)\r\nprint(p[a-1])\r\n", "def answer():\r\n n = int(input())\r\n if n<10:\r\n print(n)\r\n elif n<190:\r\n num=str(10+(int((n-10)/2)))\r\n print(num[(n-10)%2])\r\n elif n<2890:\r\n num=str(100+(int((n-190)/3)))\r\n print(num[(n-190)%3])\r\n elif n==2890:\r\n print(1)\r\n elif n>2890:\r\n print(0)\r\n\r\nanswer()\r\n ", "n=int(input())\r\nres=''\r\nfor i in range(1,1000):\r\n res+=str(i)\r\n\r\nprint(res[n-1])", "a = int(input())\r\ns = \"\"\r\nfor i in range(1,a+1):\r\n s += str(i)\r\nprint(s[a-1])", "strNumbers = ''\r\ny=1\r\nfor i in range(1, 1000):\r\n strNumbers = strNumbers + str(y)\r\n y+=1\r\n\r\n\r\n\r\nn = int(input())\r\nprint(strNumbers[n-1])", "a=int(input())\r\nfin=\"\"\r\nfor i in range(1,a+1):\r\n fin+=str(i)\r\nprint(fin[a-1])", "line = ''\r\nfor i in range(1, 501):\r\n line += str(i)\r\nprint(line[int(input())-1])", "def solve(n):\r\n l = \"\"\r\n for i in range(1,n+1):\r\n l += str(i)\r\n return l[n-1]\r\n# n,c = map(int,input().split())\r\na = int(input())\r\n# b = int(input())\r\n# c = int(input())\r\n# l = list(map(int,input().split()))\r\n# s = input()\r\nprint(solve(a))\r\n# solve()\r\n\r\n\r\n\r\n", "n=int(input())\r\n \r\ncnt=0\r\nfor i in range(1,999):\r\n \r\n if i>99:\r\n cnt+=3\r\n elif i>9:\r\n cnt+=2\r\n else:\r\n cnt+=1\r\n if cnt>=n:\r\n \r\n num=i\r\n break\r\n \r\n \r\nif cnt==n:\r\n ans=int(num%10)\r\nelse:\r\n \r\n pos=cnt-n;\r\n if pos==1:\r\n ans=int((int(num/10))%10)\r\n else:\r\n ans=int((int(num/100))%10)\r\n \r\nprint(ans)\r\n ", "# A. Summer Camp\n\nn = int(input())\nlst = [str(x) for x in range(1, n+1)]\ns = ''.join(lst)\nprint(s[n-1])\n", "num=\"\"\r\n\r\nfor i in range(1000):\r\n num = num+str(i+1)\r\n \r\nx=int(input())\r\nprint(num[x-1])", "#rOkY\r\n#FuCk\r\n\r\n################################## kOpAl #####################################\r\n\r\nt=int(input())\r\ns=\"\"\r\nfor i in range(1,100000+1,1):\r\n s+=str(i)\r\nprint(s[t-1])\r\n", "s,n='1',2\r\nwhile len(s)<=1000:\r\n\ts+=str(n)\r\n\tn+=1\r\nprint(s[int(input())-1])", "n = int(input())\r\nst = \"\"\r\nfor i in range(1,1001):\r\n st+= str(i)\r\nprint(st[n-1])", "def bubble_sort(l):\r\n for i in range(len(l) - 1):\r\n for j in range(len(l) - i - 1):\r\n if l[j] > l[j + 1]:\r\n l[j], l[j + 1] = l[j + 1], l[j]\r\n return l\r\n\r\n\r\ndef main_function():\r\n n = int(input())\r\n output_str = \"\"\r\n output_list = []\r\n for i in range(1, 500):\r\n for j in str(i):\r\n output_list.append(j)\r\n return int(output_list[n - 1])\r\n\r\n\r\nprint(main_function())", "def ii():\r\n return int(input())\r\ndef ss():\r\n return [x for x in input()]\r\ndef si():\r\n return [int(x) for x in input().split()]\r\ndef mi():\r\n return map(int, input().split())\r\n\r\ns = []\r\nfor i in range(1, 371):\r\n s.append(str(i))\r\ns = \"\".join(s)\r\na = ii()\r\nprint(s[a - 1])", "\r\nn = int(input())\r\nnumbers = \"\"\r\nfor i in range(1, 1002):\r\n numbers = numbers + str(i)\r\n\r\nprint(numbers[n-1])", "a=int(input())\r\n\r\nb=[]\r\n\r\nfor i in range(1,a+1):\r\n b.append(str(i))\r\n\r\nc=''.join(b)\r\n\r\nprint(c[a-1])", "n = int(input())\r\nl = \"\".join(map(str, range(1,1000))) \r\nprint(l[n-1])", "n=int(input())\r\nstring = ''\r\nfor i in range(1000):\r\n string=string+str(i)\r\nprint(string[n])", "\r\n\r\n\r\ndef calculateIntAtPosition(pos):\r\n numStr = generateNumberString(pos)\r\n\r\n return(numStr[pos-1])\r\n\r\n\r\ndef generateNumberString(number):\r\n chain = \"\"\r\n for x in range(1,number+1):\r\n chain += str(x)\r\n return chain\r\n\r\n\r\ndef solve():\r\n pos = int(input())\r\n print(calculateIntAtPosition(pos))\r\n\r\n\r\n\r\nsolve()", "n = int(input())\r\n\r\n# [9 + (90 * 2) + (900) * 3] > 1000\r\n\r\ns = ''.join(str(i) for i in range(1000))\r\nprint(s[n])\r\n", "l=[]\r\nfor i in range(1,1001):\r\n l.append(i)\r\nl=\"\".join(map(str,l))\r\n#rint(l)\r\nn=int(input())\r\nprint(l[n-1])", "a = [int(x) for x in range(1000)]\r\na = [str(a[i]) for i in range(len(a))]\r\n# print(''.join(a))\r\nl = str(''.join(a))\r\n# print(list(l))\r\nn = int(input())\r\nprint(l[n])", "n = int(input())\r\nstring = ''\r\nfor j in range(1, n+1):\r\n string += str(j)\r\nprint(string[n-1])\r\n", "counter=1\r\ns=\"\"\r\nn = int(input())\r\nwhile counter<=n+1:\r\n s+=str(counter)\r\n counter+=1\r\nprint(s[n-1])", "n=int(input())\r\np=\"\"\r\nfor i in range(1,n+1):\r\n p+=str(i)\r\nprint(p[n-1])", "q = '12345678910111213141516171819202122232425262728293031323334353637383940' \\\r\n '41424344454647484950515253545556575859606162636465666768697071727374757677' \\\r\n '78798081828384858687888990919293949596979899100101102103104105106107108109110' \\\r\n '11111211311411511611711811912012112212312412512612712812913013113213313413513' \\\r\n '6137138139140141142143144145146147148149150151152153154155156157158159160161162163164' \\\r\n '165166167168169170171172173174175176177178179180181182183184185186187188189190191192193' \\\r\n '1941951961971981992002012022032042052062072082092102112122132142152162172182192202212222' \\\r\n '2322422522622722822923023123223323423523623723823924024124224324424524624724824925025125' \\\r\n '2253254255256257258259260261262263264265266267268269270271272273274275276277278279280281' \\\r\n '28228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131' \\\r\n '2313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343' \\\r\n '3443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753' \\\r\n '7637737837938038138238338438538638738838939039139239339439539639739839940040140240340' \\\r\n '44054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354' \\\r\n '3643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746' \\\r\n '84694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005' \\\r\n '0150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253' \\\r\n '53453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456' \\\r\n '556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659' \\\r\n '759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862' \\\r\n '963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066' \\\r\n '166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269' \\\r\n '369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472' \\\r\n '57267277287297307317327337347357367377' \\\r\n '38739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770' \\\r\n '77177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280' \\\r\n '38048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358' \\\r\n '36837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868' \\\r\n '86987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090' \\\r\n '19029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339' \\\r\n '34935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970' \\\r\n '9719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000'\r\nw = int(input())\r\nprint(q[w-1])", "import sys\r\n\r\ndef main():\r\n n = int(sys.stdin.read().strip())\r\n return ''.join(map(str, range(1, 400)))[n-1]\r\n\r\nprint(main())\r\n", "a=\"123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371\"\r\nprint(a[int(input())-1])", "n=int(input())\r\na=\"\"\r\nfor i in range(n):\r\n a=a+str(i+1)\r\nprint(a[n-1])", "q=1\r\ns=''\r\nwhile len(s)<1000:\r\n s=s+str(q)\r\n q+=1\r\nprint(s[int(input())-1])", "A=\"\"\r\nVal=1\r\nwhile(len(A)<1000):\r\n A+=str(Val)\r\n Val+=1\r\nn=int(input())\r\nprint(A[n-1])\r\n", "print(''.join(map(str, range(1000)))[int(input())])", "# https://codeforces.com/contest/672/problem/A\r\n\r\nn = int(input())\r\na = \"\"\r\nfor i in range(1, 1001):\r\n a += str(i)\r\n if len(a) >= n:\r\n print(a[n-1])\r\n break\r\n\r\n\r\n", "n=int(input())\r\nif(n<=9):\r\n\tprint(n)\r\nelif(n<=189):\r\n\tif(n%2==0):\r\n\t\ta=str((n-9)//2+10)\r\n\t\tprint(a[:1])\r\n\telse:\r\n\t\ta=str((n-10)//2+10)\r\n\t\tprint(a[1:])\r\nelse:\r\n\ta=n-189\r\n\tif(a%3==0):\r\n\t\tb=str(a//3+99)\r\n\t\tprint(b[2:])\r\n\r\n\telse:\r\n\r\n\t\tb=str(a//3+100)\r\n\t\tif(a%3==2):\r\n\t\t\tprint(b[1])\r\n\t\telse:\r\n\t\t\tprint(b[0])", "lis = []\r\nfor i in range(1,1001):\r\n lis.append(str(i));\r\nlis = ''.join(lis)\r\na = int(input())\r\nprint(lis[a-1])\r\n", "# import sys\r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"outp.out\",'w')\r\nn=int(input())\r\ni=1\r\ns=''\r\nwhile len(s)<=n :\r\n\ts+=str(i)\r\n\ti+=1\r\nprint(s[n-1])\r\n", "n= int(input())\r\nstring=''\r\nfor i in range(1,n+1):\r\n string+=str(i)\r\n#print(list1)\r\n\r\nfor i,j in enumerate(string):\r\n if i+1==n:\r\n print(string[i])", "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\ns = ''\r\n\r\nfor i in range(1,1001):\r\n s += str(i)\r\n\r\nn = int(input())\r\nprint(s[n-1])", "n = int(input())\r\n\r\ni = 1\r\nsentice = ''\r\n\r\nwhile True:\r\n sentice += str(i)\r\n if len(sentice) >= n:\r\n print(sentice[n-1])\r\n break\r\n\r\n i += 1", "n = int(input())\r\ns = 1\r\nwhile n > len(str(s)):\r\n n -= len(str(s))\r\n s += 1\r\nif n > 0:\r\n print(str(s)[n - 1])\r\nelse:\r\n s -= 1\r\n print(str(s)[n-1])", "'''\nAuthor : knight_byte\nFile : A_Summer_Camp.py\nCreated on : 2021-04-16 11:30:40\n'''\n\n\ndef main():\n n = int(input())\n s = \"\"\n i = 1\n while len(s) < n+1:\n s += str(i)\n i += 1\n print(s[n-1])\n\n\nif __name__ == '__main__':\n main()\n", "st = ''\r\nfor i in range(1,371):\r\n st += str(i)\r\nprint(st[int(input())-1])", "x=int(input())\r\nans=\"\"\r\nfor i in range(1,x+1):\r\n ans+=str(i)\r\nprint(list(ans)[x-1])", "N = int(input())\r\nS=\"\"\r\nfor i in range(1,N+1):\r\n S+=str(i)\r\nprint(S[N-1])\r\n", "n = int(input())\r\n\r\ncount = 0\r\nnumber = 1\r\n\r\nwhile True:\r\n digits = str(number)\r\n for digit in digits:\r\n count += 1\r\n if count == n:\r\n print(digit)\r\n exit()\r\n number += 1", "n=int(input())\r\ns=\"\"\r\nfor i in range(1,n+1,1):\r\n s+=str(i)\r\n#print(s)\r\nli=[]\r\nli=list(s)\r\n#print(li)\r\nprint(li[n-1])", "a=int(input())\r\n\r\ncount=0\r\ni=1\r\ns=''\r\nwhile (count<a):\r\n s+=str(i)\r\n count+=len(str(i))\r\n i+=1\r\n\r\nprint(s[a-1])", "n=int(input())\r\nlist1=[]\r\nfor i in range(1,n+1):\r\n list1.append(i)\r\nls=''.join(map(str,list1))\r\nprint(ls[n-1])", "n = int(input())\r\nst = ''\r\nfor i in range(n):\r\n st += str(i+1)\r\nprint(st[n-1])", "n, c = int(input()), \"0\"\r\nwhile True:\r\n for x in c:\r\n if n == 0: print(x)\r\n n -= 1\r\n if n < 0: break\r\n c = str(int(c) + 1)", "s = \"\"\r\nfor i in range(1, 1001, 1):\r\n\ts += str(i)\r\nn = int(input()) - 1\r\nprint(s[n])", "n=int(input())\r\ns1=\"\"\r\nfor i in range (n):\r\n s1+=str(i+1)\r\nprint(s1[n-1])", "n = int(input())\r\ns = ''\r\nfor i in range(n):\r\n b = str(i + 1)\r\n s = s + b\r\nprint(s[n-1])", "all_integers: str = \"\"\ni = 1\nwhile len(all_integers) < 1000:\n all_integers += str(i)\n i += 1\n\nn = int(input())\nprint(all_integers[n - 1])\n", "n = int(input())\r\ns = \"\"\r\n \r\ni = 1\r\nwhile (len(s) < n):\r\n s += str(i)\r\n i+=1\r\nprint(s[n-1])\r\n", "# Read input\r\nn = int(input())\r\n\r\n# Initialize variables\r\nlength = 0\r\ni = 1\r\n\r\n# Calculate the length of the concatenated string until it's greater than or equal to n\r\nwhile length + len(str(i)) < n:\r\n length += len(str(i))\r\n i += 1\r\n\r\n# Find the n-th digit within the i-th integer\r\ndigit = str(i)[n - length - 1]\r\n\r\n# Print the result\r\nprint(digit)\r\n", "n=int(input())\r\nl=[]\r\noutput=[]\r\ndef reemovNestings(l):\r\n for i in l:\r\n if type(i) == list:\r\n reemovNestings(i)\r\n else:\r\n output.append(i)\r\nfor i in range(1,n+1):\r\n res = [int(x) for x in str(i)]\r\n l.append(res)\r\nreemovNestings(l)\r\nprint(output[n-1])\r\n", "def school(n):\r\n s = ''\r\n for i in range(1, n + 1):\r\n s += str(i)\r\n return s[n - 1]\r\n\r\n\r\nprint(school(int(input())))\r\n", "\r\ns = \" \" \r\nn = input()\r\nn=int(n)\r\n#print(n)\r\nfor i in range(1,n+1):\r\n\ts=s+str(i)\r\n#print(s)\r\nprint(s[n])\r\n\r\n", "n=int(input())\r\nf=1;s=\"\"\r\nfor i in range(1001) :\r\n s=s+str(f)\r\n f=f+1\r\nprint(s[n-1])\r\n", "n = int(input())\r\nline = ''\r\nnumber = 1\r\nwhile len(line) < n:\r\n line += str(number)\r\n number += 1\r\nprint(line[n-1])", "n = int(input())\nA = str()\nfor i in range(1, n + 1):\n A += str(i)\nprint(A[n - 1])\n", "print((\"\".join(map(str, range(1, 1000))))[int(input()) - 1])", "n = int(input())\r\n\r\n# Find the number of digits of the smallest integer that includes the n-th digit\r\nm = 1\r\nwhile n > m * 9 * 10**(m-1):\r\n n -= m * 9 * 10**(m-1)\r\n m += 1\r\n\r\n# Find the integer that includes the n-th digit and the position of the digit in that integer\r\nq, r = divmod(n - 1, m)\r\ninteger = 10**(m-1) + q\r\ndigit = int(str(integer)[r])\r\n\r\nprint(digit)\r\n", "maxn=1000\r\ns=\"\"\r\nfor i in range(1,maxn):\r\n\ts+=str(i)\r\nn=int(input())\r\nprint(s[n-1])", "n = eval(input())\r\ni=0\r\nx=\"\"\r\nwhile(i<=1000):\r\n x+=str(i)\r\n i+=1\r\nprint(int(x[n])) \r\n", "n = int(input())\r\ncount = 15\r\nseq = \"123456789101112131415\"\r\nwhile len(seq) < n:\r\n count += 1\r\n seq += str(count)\r\n\r\nprint(seq[n - 1])", "n = int(input())\r\ns = \"\"\r\ni = 1\r\n\r\nwhile True:\r\n s += str(i)\r\n if i == n:\r\n print(s[i-1])\r\n break\r\n i+=1", "x=int(input())\r\na=list(map(str,[i for i in range(1,x+1)]))\r\nb=\"\"\r\nfor i in range(x):\r\n\tb=b+a[i]\r\nprint(b[x-1])", "def main():\r\n x = int(input())\r\n seq = [str(i) for i in range(1001)]\r\n seq = ''.join(seq)\r\n print(seq[x])\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "import sys\r\nn=int(input())\r\ns = \"\"\r\nst = 1\r\nwhile (1==1):\r\n s+=str(st)\r\n if (len(s) >= n):\r\n print(s[n - 1])\r\n sys.exit()\r\n st+=1\r\n\r\n", "n = int(input())\nprint(''.join(map(str, range(0, 1000)))[n])\n", "n=int(input())\r\ns=''\r\nfor i in range(n+1):\r\n s=s+str(i)\r\nprint(s[n])\r\n", "n=int(input())\r\ns=\"\"\r\nfor i in range(1,1001):\r\n d=str(i)\r\n s=s+d\r\nprint(s[n-1])", "n = int(input())\r\nd =[]\r\ns = [str(i) for i in range(n+1)]\r\n\r\nfor i in s:\r\n\tif len(i)==1:\r\n\t\td.append(i)\r\n\telse:\r\n\t\tfor j in i:\r\n\t\t\td.append(j)\r\n\r\nprint(d[n])\r\n", "a = int(input())\r\nf=''\r\nfor i in range(1,1001):\r\n f+=str(i)\r\nprint(f[a-1])\r\n", "a = int(input())\r\nn = 1\r\ns = ''\r\nwhile len(s)<a:\r\n s += str(n)\r\n n += 1\r\n# print(s)\r\nprint(s[a-1])", "n=int(input())\r\narr=\"\".join(str(x)for x in range(n+1))\r\nprint(arr[n])", "a=0\r\ns=[]\r\np=[]\r\nw=[]\r\nx=int(input())\r\nif x<12:\r\n if x>9:\r\n print(['0','1'][x%2==0])\r\n else:\r\n print(x)\r\n\r\nelif x<190:\r\n if x%2!=0:\r\n z=x-1\r\n else:\r\n z=x\r\n for i in range(12,190,2):\r\n a+=1\r\n if i==z:\r\n break;\r\n o=z-a\r\n if x%2==0:\r\n print(o//10)\r\n else:\r\n print(o%10) \r\n\r\n\r\nelse:\r\n a=88\r\n z=x\r\n p=list(range(190,1003,3))\r\n## print('p=',p)\r\n while 1:\r\n if z in p:\r\n break\r\n z=z-1\r\n## print('first in set z=',z)\r\n for b in range(190,1003,3):\r\n a+=2\r\n## print('a=',a)\r\n if b==z:\r\n break\r\n d=z-a\r\n## print('d=',d)\r\n while d>0:\r\n f=d%10\r\n s.append(f)\r\n d=d//10\r\n## print('list s=',s) \r\n s.reverse()\r\n## print('list s after reverse =',s)\r\n for r in range(3):\r\n w.append(z)\r\n z=z+1\r\n## print('list w=',w) \r\n print(s[w.index(x)]) \r\n", "n = int(input())\r\ns = \"\"\r\nfor i in range(1, 1000):\r\n s += str(i)\r\n if len(s) >= 1001: break\r\nprint(s[n - 1])", "n = input()\r\nres = \"\"\r\n\r\nfor i in range(1000):\r\n res+=str(i)\r\nprint(res[int(n)])", "n=int(input())\r\nt=\"0\"\r\nfor i in range(1,1001):\r\n t+=str(i)\r\nprint(t[n])", "\r\n\r\ndef findNth(n):\r\n cur = 0\r\n \r\n while n > 9 * 10 ** cur * (cur + 1):\r\n n -= 9 * 10 ** cur * (cur + 1)\r\n cur += 1\r\n \r\n #print(n)\r\n cur += 1\r\n nth = (n - 1) // cur\r\n \r\n #print(nth)\r\n num = 10 ** (cur - 1) + nth\r\n print(str(num)[(n - 1) % cur], end= ' ') \r\n \r\n\r\nfindNth(int(input()))", "n=int(input())\r\ns=\"\"\r\nfor i in range(1,600):\r\n s+=(str(i));\r\nprint(s[n-1])", "n = int(input())\r\nl = \"\"\r\nc = -1\r\nfor i in range(500):\r\n l += str(i)\r\nfor i in l:\r\n c += 1\r\n if c == n:\r\n print(i)\r\n", "s=int(input());x='1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000'\nprint(x[s-1])", "seq = []\r\nindx = 0\r\nfor i in range(1, 1001):\r\n curr = str(i)\r\n for j in curr:\r\n seq.append(j)\r\n indx += 1\r\nprint(seq[int(input()) - 1])\r\n\r\n", "n=int(input())\r\ntemp=[]\r\nfor i in range(1,n+1):\r\n l=str(i)\r\n temp.extend(l)\r\nprint(temp[n-1])", "n = int(input())\r\nlis = []\r\nfor i in range(1,n+1):\r\n if i <= 9:\r\n lis.append(i)\r\n else:\r\n k = str(i)\r\n for j in range(0,len(k)):\r\n lis.append(k[j])\r\nprint(lis[n-1])\r\n# print(lis)", "#!/usr/bin/env python3\n\n\ndef main():\n n = int(input())\n print(''.join(map(str, range(0, 1000)))[n])\n\n\nif __name__ == '__main__':\n main()", "def main():\n\tn = int(input())\n\n\tprint(''.join([ str(i) for i in range(1,n+1)])[n-1])\n\t\n\t\nmain()\n", "k = int(input()); \r\nstrr = \"\";\r\nfor i in range(1, k + 1):\r\n strr += str(i); \r\nprint(strr[k - 1]); \r\n", "numbers,a = '',int(input())\r\nfor i in range(1,1001):numbers+=str(i)\r\nprint(numbers[a-1])", "n = int(input())\r\nl = list(map(str,range(1,n+1)))\r\nl = \"\".join(l)\r\nprint(l[n-1]) ", "n = int(input())\nline = \"\"\ni = 1\n\nwhile i <= n:\n line += str(i)\n i += 1\n\nprint(line[n-1])", "s=int(input());a=''\r\nfor i in range(0,1000):\r\n a=a+str(i+1)\r\nprint(a[s-1])", "x = int(input())\r\ns = ''\r\nfor i in range(1, 1000):\r\n s += str(i)\r\n# print(s)\r\nprint(s[x-1])\r\n", "def clFn(value):\n try:\n int(value)\n return int(value)\n except:\n try:\n float(value)\n return float(value)\n except:\n return value\n\n\n# inputs = list(map(clFn, input().split(' ')))\n\nnumber = int(input())\n\nstring = ''\n\nfor k in range(1, number + 1):\n\n string += str(k)\n\nprint(string[number - 1])\n", "def main():\r\n #print(\"This Work made by Ahmad Elnassag\")\r\n #print(\"juner training sheet v.7\")\r\n\r\n N = int(input())\r\n st = ''\r\n for i in range(1,N+1):\r\n st += str(i)\r\n\r\n print(st[N-1])\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "num = ''\r\nfor i in range(1,1000):\r\n num+=str(i)\r\nprint(num[int(input())-1])", "#import sys\r\n#sys.stdin = open(\"input.in\",\"r\")\r\n#sys.stdout = open(\"test.out\",\"w\")\r\nl=\"\"\r\nfor i in range(1,1001):\r\n l=l+str(i)\r\nn=int(input())\r\nprint(l[n-1])", "x = int(input())\r\nL = ''\r\n\r\nfor i in range(1,1000):\r\n if len(L) < x:\r\n L += str(i)\r\n else:\r\n break\r\nprint(L[x-1])\r\n", "# @Chukamin ZZU_TRAIN\n\ndef main():\n data = \"\"\n for i in range(1, 1000):\n data += str(i)\n n = int(input())\n print(data[n - 1])\n \nif __name__ == '__main__':\n main()\n\n \t \t \t \t\t\t \t\t \t\t\t\t \t\t\t \t\t", "n=int(input())\r\nr=''\r\nfor i in range(1,1001):\r\n r+=str(i)\r\nprint(r[n-1])", "n = int(input())\nseq = \"\"\nfor i in range(1, n + 1):\n seq += str(i)\nprint(seq[n - 1])\n", "print(''.join(map(str,range(555)))[int(input())])", "e = int(input())\r\nd = []\r\nfor i in range(1001):\r\n d.append(str(i))\r\nk = ''.join(d)\r\nprint(k[e])\r\n", "import os\r\n\r\ns=\"\"\r\nn=int(input())\r\nk=1\r\nwhile len(s)<n:\r\n\ts+=str(k)\r\n\tk+=1\r\nprint(s[n-1])", "a=[str(i) for i in range(1,1001)]\r\na=\"\".join(a)\r\nn=int(input())\r\n\r\nprint(a[n-1])", "s=input()\r\na=''\r\nif(len(s)==1):\r\n print(s)\r\n\r\nelse:\r\n for i in range(1,int(s)+1):\r\n a=a+str(i)\r\n print(a[int(s)-1])", "st = \"\".join([str(i) for i in range(1, 1000)])\nn = int(input())\nprint(st[n-1:n])\n\n \t \t \t \t\t \t\t \t\t\t", "# Ammirhossein Alimirzaei\r\n# Email: [email protected]\r\n# Instagram : Amirhossein_Alimirzaei\r\n# Telegram : @HajLorenzo\r\n\r\nSTR=\"\"\r\nN=int(input())\r\nfor _ in range(1,N+1):\r\n STR+=str(_)\r\nprint(STR[N-1])", "print(\"\".join(map(str,range(1000)))[int(input())])", "num = int(input())\n\nnum_seq = ''.join([str(i) for i in range(1 , num + 1)])\n\nprint(num_seq[num - 1])\n", "import math\r\n\r\nt=int(input())\r\ni=1\r\ns=''\r\nwhile i<=t:\r\n s=s+str(i)\r\n i=i+1\r\nprint(s[t-1])\r\n", "s = \"\"\r\nfor i in range (0 , 1000) :\r\n s+= str(i)\r\nprint(s[int(input())])\r\n", "n=int(input())\r\ns=[]\r\nfor i in range(1,n+1):\r\n s.append(str(i))\r\ns=\"\".join(s)\r\nprint(s[n-1])\r\n ", "s=''\r\nfor i in range(400):\r\n s=s+str(i)\r\nprint(s[int(input())])", "n = int(input())\n\ni = 1\nstring = '1'\nwhile len(string) + 1 <= n:\n i += 1\n string += str(i)\n\nprint(string[n - 1])", "\r\nst = ''\r\nn = 1\r\nwhile len(st) <1000:\r\n\tst += str(int(n))\r\n\tn += 1\r\n\r\n\r\nn = int(input())\r\nprint(st[n-1])\r\n\r\n", "\r\nn=int(input())\r\nv=''\r\nfor i in range(1,n+1):\r\n\tv=v+str(i)\r\n\r\nprint(v[n-1])", "#!/usr/bin/env python3\n\ns = [str(i) for i in range(1, 1000)]\ns = \"\".join(s)\ni = int(input())\nprint(s[i-1])\n\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())\nline = ''.join(str(i) for i in range(1, 1001))\nprint(line[n - 1])\n \t\t \t \t \t \t\t\t \t\t \t\t\t\t\t \t \t \t", "s=\"\"\r\nfor i in range(1,1001):\r\n s+=str(i)\r\nprint(s[int(input())-1])\r\n", "n = int(input())\r\nstring = ''\r\ni = 1\r\nwhile len(string) < n:\r\n string += str(i)\r\n i += 1\r\nprint(string[n - 1])\r\n", "s = \"\"\nfor x in range(0, 501):\n s += str(x)\nprint(s[int(input())])\n", "a=''\r\nfor i in range(1,401):\r\n a+=str(i)\r\nn=int(input())\r\nprint(a[n-1])\r\n", "x=int(input())\r\nz=[[int(k) for k in str(n)] for n in range(1,x+1)]\r\ns=[]\r\nfor n in range(len(z)):\r\n\ts+=z[n]\r\nprint(s[x-1])", "data = \"1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000\"\r\nprint(data[int(input())-1])", "# # RED CODER # #\r\nn = int(input())\r\nstring = ''\r\nfor i in range(1, n+1):\r\n string += str(i)\r\nprint(string[n-1])", "n= int(input())\r\nstring = \"\"\r\nfor i in range(1,n+1):\r\n string += str(i)\r\nprint(string[n-1])\r\n", "n=int(input())\r\nnew=''\r\nfor i in range(1,n+1):\r\n i=str(i)\r\n new+=i\r\nprint(new[n-1])", "n=int(input())\r\ntemp=''\r\nfor i in range(1,501):\r\n temp+=str(i)\r\nprint(temp[n-1])", "\r\nn = int(input())\r\nL = \"\"\r\nfor i in range(1,371):\r\n L += str(i)\r\n\r\nprint(L[n-1])\r\n", "string = \"\"\r\na = 1\r\nn = int(input())\r\nwhile True:\r\n string = string + str(a)\r\n a = a+ 1\r\n if len(string) >= n:\r\n break\r\nprint(string[n-1])", "a=\"\"\r\nfor i in range(1,1000):\r\n a=a+str(i)\r\nn=int(input())\r\nprint(a[n-1])", "#print(\" \".join(map(str, r)))\r\n\r\nn = int(input())\r\n\r\n\r\nempty = \" \"\r\n\r\nfor i in range(1, n+1):\r\n empty += str(i)\r\n\r\n\r\nprint(empty[n])\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n=int(input())\r\ns='';i=1\r\nwhile True:\r\n s+=str(i)\r\n if len(s)>=n:\r\n print(s[n-1])\r\n break\r\n i+=1", "s=int(input());a='1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000'\r\nprint(a[s-1])", "f=lambda:map(int,input().split())\r\nn=int(input())\r\ns=''\r\nfor i in range(1,371):\r\n s+=str(i)\r\nprint(s[n-1])", "def STR():\r\n s = \"\"\r\n for i in range(1,1001):\r\n s += str(i)\r\n return s\r\nif __name__ == '__main__':\r\n s = STR()\r\n n = int(input())\r\n print(s[n-1])\r\n", "n = int(input())\r\nif n < 10: print(n)\r\nelif 10 <= n <= 189: print(str(9+((n-8)//2))[n%2])\r\nelse: print(str(99+((n-187)//3))[(n+2)%3])\r\n", "s = str()\r\nfor i in range(399):\r\n s += str(i)\r\nprint(s[int(input())])\r\n", "a= int(input())\r\nst=''\r\nfor i in range(1, a+1):\r\n j=str(i)\r\n st = st + j\r\n\r\nprint(st[a-1])", "s = ''\r\nfor i in range(1, 401):\r\n s += str(i)\r\nn = int(input())\r\nprint(s[n - 1])", "n = int(input())\r\narray = []\r\n\r\nfor i in range(1, 371):\r\n array.append(str(i))\r\n\r\nprint(''.join(array)[n - 1])", "# LUOGU_RID: 113665539\ns=''\nfor i in range(1,500):\n s+=str(i)\nprint(s[int(input())-1])", "n=int(input())\r\nc=1\r\ns=''\r\nwhile len(s)<n:\r\n s+=str(c)\r\n c+=1\r\nprint(s[n-1]) ", "n = int(input())\ns = ''\nk = 1\nwhile len(s) < n:\n s = ''.join((s, str(k)))\n k += 1\n\nprint(s[n - 1])\n\n# def var(s, c):\n# if c == 0:\n# for k in range(10):\n# s1 = str(s) + str(k)\n# print(s1)\n# else:\n# for k in range(10):\n# s1 = str(s) + str(k)\n# var(s1, c - 1)\n#\n#\n# def var0():\n# for k in range(10):\n# var(k, 3)\n#\n#\n# var0()\n", "import sys\r\ninput=sys.stdin.readline\r\nn = \"\"\r\nfor i in range(400):\r\n n+=str(i)\r\ni=int(input())\r\nprint(n[i])\r\n", "\r\n# _________________________________________________________________________________\r\n#╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬ \r\n#╬╬\t _\t _\t\t\t ______\t _\t\t _\t\t\t\t ___ __ _ ╬╬\r\n#╬╬\t|█| |█| |█|\t|█|\t ██████\t |██\t\t |█|\t|███|\t|███| |██\t\t|█| ╬╬\r\n#╬╬\t|█|\t |█| |█|\t|█| █ █ |█ █\t\t |█| |█ █|\t |█| |█ █\t |█| ╬╬\r\n#╬╬\t|█|\t |█| |█|\t|█|\t ██\t\t█ |█ ██\t |█| |█\t|█|\t |█| |█ ██\t|█|\t ╬╬\r\n#╬╬\t|█|\t |█| |█|\t|█|\t ██\t |█\t█\t |█| |█|_____|█| |█| |█\t█\t|█|\t ╬╬\r\n#╬╬\t|███████| |█|\t|█|\t ██\t |█\t ██\t |█| |█████████| |█| |█\t██\t|█| ╬╬\r\n#╬╬\t|█|\t |█| |█|\t|█|\t█\t █ |█\t █ |█| |█|\t |█| |█| |█\t █\t|█| ╬╬\r\n#╬╬\t|█|\t |█| |█|___|█|\t █\t █\t |█\t\t█|█| |█|\t |█| |█| |█\t █|█| ╬╬\r\n#╬╬\t|█|\t |█| |█████|\t ████\t |█\t\t ██| |█|\t |█||███| |█\t ██| ╬╬\r\n#╬╬\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t ╬╬\r\n#╬╬______________________________________________________________________________╬╬\r\n#╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬ \r\na = int(input())\r\ns = \"\"\r\nfor i in range(1,a+2):\r\n\ts+=str(i)\r\nprint(s[a-1])\r\n\r\n\t", "n = int(input())\r\nl = ''\r\nt = 1\r\nwhile len(l) < n:\r\n l+=str(t)\r\n t+=1\r\nprint(l[n-1])\r\n", "n=int(input())\r\ns=''\r\nfor i in range(1,n+1):\r\n s=s+(str)(i)\r\n if(len(s)>=n):\r\n print(s[n-1])\r\n break\r\n", "a = int(input())\r\ns = ''\r\nfor i in range(1 ,500):\r\n s += str(i)\r\nprint(s[a - 1])\r\n", "# cook your dish here\r\nn=int(input())\r\nl=\"\"\r\nfor i in range(1,1001):\r\n l=l+str(i)\r\nprint(l[n-1])", "l = '0123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370'\r\nn = int(input())\r\nprint(l[n])\r\n", "import math\nn = int(input())\ni = 1\nl = 1\nwhile l<n:\n i += 1\n l += int(math.log10(i) + 1)\n\nprint((i//10**(l-n))%10)\n", "print([''.join([str(i) for i in range(1, n+1)])[n-1] for n in [int(input())]][0])", "n = int(input())\r\ni = 0\r\ndigit = 0\r\nstring = \"\"\r\nfor i in range(1, n+1):\r\n string += str(i)\r\nprint(string[n-1])\r\n\r\n", "n = int(input())-1\r\na = ''\r\nfor i in range(1,1000):\r\n a = a+str(i)\r\nprint(a[n])", "n=int(input())\r\na=\"123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380\"\r\nprint(a[n-1])\r\n", "li = []\r\nind = 0\r\nfor i in range(1, 371):\r\n temp = []\r\n p, q = i, i\r\n count = 0\r\n while p != 0:\r\n p //= 10\r\n count += 1\r\n if count == 1:\r\n li.append(i)\r\n if count == 2:\r\n temp = []\r\n while q != 0:\r\n x = q % 10\r\n q //= 10\r\n temp.append(x)\r\n li = li + temp[::-1]\r\n if count == 3:\r\n temp = []\r\n while q != 0:\r\n x = q % 10\r\n q //= 10\r\n temp.append(x)\r\n li = li + temp[::-1]\r\nli.pop()\r\nli.pop()\r\n\r\n\r\nn = int(input(''))\r\nprint(li[n-1])\r\n", "line = \"\".join(str(x) for x in range(1, 500))\r\nn = int(input())\r\nprint(line[n-1])\r\n", "n = int(input())\r\na = \"123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380\"\r\nprint(a[n-1])", "l=[]\r\nfor i in range(1,401):\r\n l.append(str(i))\r\ns=\"\".join(l)\r\nn=int(input())\r\nprint(int(s[n-1]))", "n=int(input())\r\na=[]\r\nfor i in range(1,n+1):\r\n x=[]\r\n while(i>0):\r\n x.append(i%10)\r\n i//=10\r\n for j in range(len(x)-1,-1,-1):\r\n a.append(x[j])\r\nprint(a[n-1])\r\n ", "n=int(input())\r\nstring=\"\"\r\nfor i in range(1,n+1):\r\n string+=str(i)\r\n\r\n\r\nprint(string[n-1])\r\n", "n = int(input())\r\na = \"\"\r\nfor i in range(1000):\r\n b = str(i)\r\n a = a + b\r\nprint(\"{}\".format(a[n]))", "n = int(input())\r\ns = \"\"\r\nc = 1\r\nfor i in range(n):\r\n s += str(c)\r\n c += 1\r\nprint(s[n-1])", "s = ''.join([str(x) for x in range(1000)])\nprint(s[int(input())])\n", "i=2\r\ns='1'\r\nwhile len(s)<1005:\r\n s+=str(i)\r\n i+=1\r\nn = int(input())\r\nprint(s[n-1])", "a = ''\r\nb = int(input())\r\nfor i in range(1, b + 1):\r\n a += str(i)\r\nprint(a[b - 1])\r\n", "num=int(input())\r\nstring=''\r\nfor i in range(1,num+1):\r\n string +=str(i)\r\nprint(string[num-1])", "n = int(input())\r\nb = ''\r\nfor i in range(1 , 1001):\r\n b += str(i)\r\nc = 0\r\nfor i in b:\r\n c += 1\r\n if int(c) == n:\r\n print (i)\r\n", "print(''.join([str(i) for i in range(800)])[int(input())])\r\n", "n=int(input())\r\nl=[i for i in range(1,1001)]\r\ns=''\r\nfor i in l:\r\n s+=str(i)\r\nprint(s[n-1])", "s = \"\".join(str(x) for x in range(371))\r\nn = int(input())\r\nprint(s[n])", "\r\nn = int(input())\r\n\r\nl = ''\r\n\r\nfor i in range(1 , n + 1):\r\n l += str(i)\r\nprint(l[n - 1])", "n=int(input())\r\nl=[i for i in range(1,1001)]\r\ns=''.join(map(str,l))\r\nprint(s[n-1])", "def l(n):\r\n if(n==0):\r\n return 0\r\n else:\r\n return 1 + l(n//10)\r\nn = int(input())\r\ns = 0\r\ni = 0\r\nwhile(s < n):\r\n t = l(i)\r\n if(s + t < n):\r\n s += t\r\n i += 1\r\n else:\r\n break\r\nst = str(i)\r\nprint(st[(n-s)-1])\r\n \r\n \r\n", "a='1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000'\nb=int(input())\nprint(a[b-1])\n", "n = int(input())\r\ncur = 0\r\ns = ''\r\nfor i in range(1, n + 1):\r\n s += str(i)\r\n if len(s) >= n:\r\n print(s[n - 1])\r\n exit(0)", "n = int(input())\r\ncount = 0\r\nnum = 1\r\n\r\nwhile True:\r\n num_str = str(num)\r\n num_length = len(num_str)\r\n \r\n if count + num_length >= n:\r\n nth_digit = num_str[n - count - 1]\r\n print(nth_digit)\r\n break\r\n \r\n count += num_length\r\n num += 1\r\n", "# cf 672 A 800\ndef f(n):\n if n < 9:\n return n\n elif n < 10 + (9 * 10 * 2):\n # 10\n # 123456789101112\n # ^|$\n x = ((n - 10) // 2) + 10\n if n % 2 == 0:\n return (x // 10)\n else:\n return (x % 10)\n else: # n = 100 - 1000\n # 1-9 (9)\n # 10-99 (10-19) - (90 - 99) = 9 * 9 = 81\n # 1-9|10-99|\n prev = 10 + (9 * 10 * 2)\n x = ((n - prev) // 3) + 100\n if n % 3 == 0: # 10(0)\n return (x % 10)\n elif n % 3 == 1: # (1)00\n return (x // 100)\n elif n % 3 == 2: # 1(0)0\n return ((x // 10) % 10)\n\nn = int(input())\nans = f(n)\nprint(ans)\n", "if __name__ == \"__main__\":\r\n\tn = int(input())\r\n\r\n\tstring = \"\"\r\n\r\n\tnumber = 0\r\n\twhile len(string) <= n:\r\n\t\tstring += str(number)\r\n\t\tnumber += 1\r\n\r\n\tprint(string[n])\r\n\r\n\r\n", "# bsdk idhar kya dekhne ko aaya hai, khud kr!!!\r\n# from math import *\r\n# from itertools import *\r\n# import random\r\nnum = \"\"\r\nn = int(input())\r\nfor i in range(1, 10000):\r\n num += str(i)\r\nprint(num[n - 1])\r\n", "n = int(input())\r\nc = 1\r\ni = 0\r\ns = \"\"\r\nwhile len(str(s)) < n: \r\n s = s + str(c)\r\n c = c + 1\r\nprint(s[n-1])\r\n \r\n\r\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\ns = ''\r\ni = 1\r\nwhile True:\r\n if len(s) > 1000:\r\n break\r\n else:\r\n s += str(i)\r\n i += 1\r\n\r\nprint(s[int(input()) - 1])", "s = '1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000'\r\nn = int(input())\r\nprint(s[n-1])", "n=int(input())\r\nif n<=9:\r\n print(n)\r\nelif 10<=n<=189:\r\n if n%2==0:\r\n t=(n-8)//2+9 \r\n print(int(str(t)[0]))\r\n else:\r\n t=(n-9)//2+9 \r\n print(int(str(t)[1]))\r\nelse:\r\n t=(n-187)//3+99 \r\n if n%3==0:\r\n print(int(str(t)[2]))\r\n elif n%3==1:\r\n print(int(str(t)[0]))\r\n else:\r\n print(int(str(t)[1]))", "n=int(input())\r\nx=''\r\nfor i in range(1,n+1):\r\n x=x+str(i)\r\nprint(x[n-1])\r\n", "n = int(input())\r\nv =[]\r\nfor i in range(1,500):\r\n\ts = str(i)\r\n\tv.append(s)\r\nz =\"\".join(v)\r\nprint(z[n-1])\r\n\r\n", "n = int(input()) #Input the number\r\n\r\n#Store the first n integers in a list\r\nlist_of_numbers = [str(x) for x in range(1,n+1)]\r\n\r\n#create a string from the list\r\nn_string = \"\".join(list_of_numbers)\r\n\r\n#get the nth character from the string\r\nnth_character = n_string[n-1]\r\n\r\n#print the result\r\nprint(nth_character)", "import sys\n\nn = int(input())\ns = \"\"\ni = 1\nwhile len(s) < n:\n s += str(i)\n i += 1\nprint(s[n - 1])\n", "n = int(input())\r\ns=\"\"\r\na=1\r\nfor i in range(1,n+2):\r\n\ts=s+str(a)\r\n\ta=a+1\r\nprint(s[n-1])\r\n\t", "n = int(input())\nnumbers = ''\ni = 1\nwhile len(numbers) < n:\n numbers += str(i)\n i += 1\n\nprint(numbers[n - 1])", "s =('1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000'\r\n)\r\nprint(s[int(input())-1])", "n=int(input())\r\ns=''\r\nfor i in range(n):\r\n s+=str(i+1)\r\nprint(s[n-1])", "pos = int(input())\r\nif(pos < 10):\r\n print(pos)\r\nelse:\r\n sze = 9\r\n tempNum = 9\r\n founded = False\r\n while True:\r\n tempNum += 1\r\n s = str(tempNum)\r\n for ch in s:\r\n sze += 1\r\n if(sze == pos):\r\n print(ch)\r\n founded = True\r\n break\r\n if(founded):\r\n break\r\n ", "print(''.join([str(num) for num in range(1001)])[int(input())])", "# cook your dish here\r\nn=int(input())\r\ns=\" \"\r\nfor i in range(1,500):\r\n s=s+str(i)\r\nprint(s[n]) \r\n ", "n = int(input() )\ns = ''\ni = 1\nwhile n > len(s):\n s += str(i)\n i += 1\nprint(s[n-1] )\n", "numbers = []\r\nfull = \"\"\r\n\r\nfor i in range(1,1000):\r\n numbers.append(i)\r\n full += str(numbers[i-1])\r\n\r\nn = int(input())\r\n\r\nprint(full[n-1])", "string = []\r\ndigit = int(input())\r\n\r\nfor i in range(digit + 1):\r\n string.append(i)\r\n\r\ncharacters = [int(i) for i in ''.join(map(str, string))]\r\nprint(characters[digit])", "print(\"\".join(list(map(str,list(range(1,1001)))))[int(input())-1])", "x = []\r\nfor i in range(1,1001):\r\n x.append(i)\r\n\r\nmystr = ''.join([str(elem) for elem in x])\r\nme=list(mystr)\r\ny=int(input(\"\"))\r\nprint (me[y-1])", "n=int(input())\r\ncur = \"1\"\r\ni=1\r\nwhile i<=n:\r\n cur+=str(i)\r\n i+=1\r\n \r\nprint(cur[n])", "def sol():\r\n n=int(input())\r\n A=\"\"\r\n for i in range(1,1000):\r\n A+=str(i)\r\n print(A[n-1])\r\nif(__name__=='__main__'):\r\n sol()\r\n", "s = ''\r\nfor i in range(1000):\r\n\ts += str(i)\r\nn = int(input())\r\nprint(s[n])", "n = int(input())\r\nbase, i, e = '', 0, 1\r\nwhile i <= n - 1:\r\n base += str(e)\r\n i += len(str(e))\r\n e += 1\r\nprint(base[n-1])", "a=int(input())\r\ns=''\r\nfor i in range(1,1000):\r\n ii=str(i)\r\n s+=ii\r\naa=a-1\r\nprint(s[aa])", "a=int(input())\r\ni=1\r\nv=''\r\nwhile(i<=a):\r\n v=v+str(i)\r\n i=i+1\r\nprint(v[a-1])\r\n", "n=int(input());print(\"\".join(map(str,range(n+1)))[n])", "a='';s=1\r\nwhile len(a)<1000:a+=str(s);s+=1\r\nn=int(input())\r\nprint(a[n-1])", "s=\"\"\nf=1\nc=370\nwhile c>0:\n s+=str(f)\n f+=1\n c-=1\nprint(s[int(input())-1])\n\n\n", "l=[]\r\nfor i in range(1,1001):\r\n\tl.append(i)\r\ns1 = int(\"\".join(map(str, l)))\r\nn=int(input())\r\nm=str(s1)\r\nl1=[]\r\nl1[:0]=m\r\nprint(l1[n-1])", "S = \"\"\nfor i in range(1, 400):\n\tS += str(i)\nprint(S[int(input())-1])\n \t \t \t \t \t\t \t\t\t\t \t \t \t\t", "n=int(input())\r\na='123456789'\r\nfor i in range (10,1000):\r\n a+=str(i)\r\nprint(a[n-1])" ]

[ "a=int(input())\r\nprint(2*((2**a)-1))", "n = int(input())\r\nprint(sum(2**x for x in range(1,n+1)))\r\n", "n = int(input())\r\nz=0\r\nwhile n!=0:\r\n z=z+2**n\r\n n=n-1\r\nprint(z) \n# Sat Sep 23 2023 11:38:26 GMT+0300 (Moscow Standard Time)\n", "n = int(input())\r\na1 =2 \r\nr =2 \r\nprint(a1*(1-r**n)//(1-r))", "n=int(input())\r\nans=0\r\npower=1\r\nfor i in range(n):\r\n power*=2\r\n ans+=power\r\nprint(ans)", "n=int(input())\r\nprint((2**(n+1))-2)\r\n", "# Wadea #\r\n\r\nc = 0\r\nn = int(input())\r\nfor i in range(1,n+1):\r\n c += 2**i\r\nprint(c)", "n = int(input())\r\n\r\nj = (2 ** (n+1)) - 2\r\n\r\nprint(j)", "n = int(input())\n\nres = 0\nfor i in range(n): \n res += 2**(i+1)\nprint(res)\n", "a = int(input())\r\ns = 0\r\nfor i in range (1,a+1):\r\n s = s + 2 ** i\r\nprint(s) \n# Sat Sep 23 2023 11:18:16 GMT+0300 (Moscow Standard Time)\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nans = 0\r\ncur = 1\r\nfor _ in range(int(input())):\r\n ans += cur*2\r\n cur*=2\r\nprint(ans)\r\n\r\n", "n = int(input())\r\ns = 0\r\nfor i in range(1, n+1):\r\n s+=pow(2,i)\r\n\r\nprint(s)", "#n = 2^n + 2^(n-1) + ... + 2\r\nn = int(input())\r\nr = 0\r\nwhile(n > 0):\r\n r += 2 ** n \r\n n -= 1 \r\nprint(r) ", "def fac(n):\n sum = 1\n for i in range(2, n + 1):\n sum *= i\n return sum\n\nn = int(input())\nsumm = 2\nfor i in range(2, n+1):\n summ += 2**i\nprint(summ)\n\n# Fri Oct 20 2023 17:42:09 GMT+0300 (Moscow Standard Time)\n", "a=int(input())\n\nres=1\n\nfor i in range(a+1):\n\tres*=2\n\nprint(res-2)\n\t \t \t \t\t\t \t \t\t\t \t\t\t\t \t\t\t", "print(2**(int(input())+1)-2)", "n = int(input())\r\na = 0\r\nfor i in range (1,n+1):\r\n a += 2 ** i\r\nprint(a)\n# Sat Sep 23 2023 11:46:07 GMT+0300 (Moscow Standard Time)\n", "n = int(input())\r\nprint(2 ** (n + 1) - 2)", "n = int(input())\r\n\r\nsum = 0\r\n\r\nfor i in range(1, n + 1):\r\n sum += 2 ** i\r\n \r\nprint(sum)\n# Fri Oct 20 2023 18:03:57 GMT+0300 (Moscow Standard Time)\n", "t = int(input())\r\nsum = 0\r\nfor i in range(1, t+1):\r\n sum += (1 << i)\r\nprint(sum)\r\n", "from sys import stdin\r\ndef input(): return stdin.readline()[:-1]\r\nn=int(input())\r\nprint(2**(n+1)-2)", "print(2**(int(input()) +1) -2)", "n = int(input())\n\n\n\nprint(2**(n+1) - 2)\n# Fri Nov 17 2023 12:15:30 GMT+0300 (Moscow Standard Time)\n", "n = int(input())\r\na = 0\r\nfor i in range(1, n + 1):\r\n a = 2 ** i + a\r\nprint(a)\r\n", "\n\n# To convert line of input to int list\n# numList = [int(i) for i in input().split()]\n\n\ncount = int(input())\n\nprint(sum(2**(i+1) for i in range(count)))\n", "n=int(input())\r\nans=0\r\nfor i in range(1,n+1):\r\n ans+=2**i\r\nprint(ans)", "n=int(input())\r\nsum=0\r\nwhile n>0:\r\n sum+=2**n\r\n n-=1\r\nprint(sum)", "n = int(input())\r\nprint(0 if n==0 else 2*(2**n - 1))", "n = int(input())\r\nk = 0\r\nfor i in range(1, n + 1):\r\n k += (2 ** i)\r\nprint(k)\r\n", "x = int(input())\r\nprint(pow(2,x+1)-2)\r\n ", "n = int(input())\r\nr = 0\r\nwhile(n > 0):\r\n r += 2 ** n \r\n n -= 1 \r\nprint(r) ", "n = int(input())\r\n\r\nres = 0\r\n\r\nfor i in range(1, n + 1):\r\n res += pow(2, i)\r\n\r\nprint(res)\r\n\n# Fri Oct 20 2023 18:03:39 GMT+0300 (Moscow Standard Time)\n", "n = int(input())\nprint(2 ** (n + 1) - 2)\n# Sat Aug 05 2023 13:15:12 GMT+0300 (Moscow Standard Time)\n", "\ndef int_line():\n return list(map(int, input().split()))\ndef qmi(a:int, b:int):\n ans = 1\n base =a\n while(b):\n if(b&1):\n ans*=base\n base*=base\n b>>=1\n return ans\n\nN=100\n\nx,=int_line()\nres=0\nfor i in range(1,x+1):\n res+=qmi(2,i)\nprint(res)\n\n\t\t\t\t \t\t\t\t\t\t \t\t \t\t \t\t\t", "n = int(input())\r\nplates = 0\r\nfor i in range(1,n+1):\r\n plates += 2**i\r\nprint(plates)\r\n", "def main():\r\n # input\r\n n = int(input())\r\n\r\n # soln\r\n ans = 0\r\n for i in range(1, n+1):\r\n ans += 2**i\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\r\nprint(2 ** (n + 1) - 2)\n# Sat Sep 23 2023 10:39:28 GMT+0300 (Moscow Standard Time)\n", "n = int(input())\r\nq = 2**n\r\ns = 0\r\nfor i in range(1,n):\r\n w = 2**i\r\n s+=w\r\nprint(s+q)", "n = int(input())\r\nprint(2*(2**n-1))", "n = int(input())\r\nres = [2]\r\nwhile len(res) < n:\r\n res.append(res[-1] * 2)\r\nprint(sum(res))", "n = int(input())\r\nans = 0\r\nfor i in range(1, n + 1):\r\n ans += 2 ** i\r\nprint(ans)\n# Wed Oct 25 2023 19:13:43 GMT+0300 (Moscow Standard Time)\n", "n = int(input())\ns = 0\nfor i in range(1, n+1):\n s+=pow(2,i)\n\nprint(s)\n \t\t\t\t\t \t\t\t\t\t \t \t \t \t\t \t \t \t\t", "\nlen=int(input())\nprint(2**(len+1)-2)\n \t \t\t\t\t \t\t \t \t \t \t\t \t", "n = int(input())\nk = 0\nfor i in range(1, n + 1):\n k += (2 ** i)\nprint(k)\n\n \t \t\t \t \t\t \t\t \t\t \t \t\t\t\t \t", "n = int(input())\r\ncount = 0\r\nfor i in range(1, n+1):\r\n count += 2**i\r\nprint(count)\n# Sat Sep 23 2023 11:43:03 GMT+0300 (Moscow Standard Time)\n", "n = int(input())\r\nprint(int((2 ** n -1)*2))\r\n", "z=int(input())\r\nc=0\r\nfor j in range(1,z+1):\r\n c+=2**j\r\nprint(c)", "numbers = int(input())\ndef funct(n):\n if n == 1:\n return 2\n else:\n return 2**n + funct(n-1)\nprint(funct(numbers))\n", "n=int(input())\nans=0\nfor i in range(1,n+1):\n ans+=1<<i\nprint(ans)\n\t\t \t \t\t\t \t\t\t \t \t \t \t\t \t", "a = int(input())\r\nprint((2**(a+1))-2)", "def main():\r\n n= int(input())\r\n print(2*(2**n - 1))\r\nmain()", "cnt = 0\nfor i in range(1,int(input())+1):\n cnt += 2**i\nprint(cnt)\n# Sat Sep 23 2023 10:26:19 GMT+0300 (Moscow Standard Time)\n", "n = int(input())\nprint(2**(n+1)-2)\n \t \t \t\t \t\t\t \t \t\t\t \t \t\t", "# The numbers of all offices in the new building of the Tax Office of IT City will have lucky numbers.\r\n# Lucky number is a number that consists of digits 7 and 8 only. Find the maximum number of offices in the new building of the Tax Office given that a door-plate can hold a number not longer than n digits.\r\n\r\n# n la cantidad de digitos, 1 <= n <= 55\r\n# n = 2\r\n# 7, 8, 77, 88, 78, 87 => 6\r\n\r\n# 787878887 :)\r\n# 20830128320 :(\r\n\r\nn = int(input()) \r\n\r\n# a_1 a_2 a_3 .... a_n ¿Cuantos números de la suerte hay de n cifras?\r\n# 2 2 2 .... 2 \r\n\r\n# n = 3\r\n# Los 1 digito => 2 (7, 8)\r\n# Los 2 digitos => 4\r\n# Los 3 digitos => 8 Y sumar 2 + 4 + 8 = 14\r\n\r\n# Sumar 2^1, 2^2, ..., 2^n\r\n\r\nsuma = 0\r\nfor i in range(1, n+1): # 1 -> n\r\n suma += 2**i\r\n\r\nprint(suma)", "def re(a,n):\r\n global l\r\n global t\r\n if len(str(a))>n:\r\n return \r\n if str(a).count(\"8\")+str(a).count(\"7\")==len(str(a)) and a not in l :\r\n l.append(a)\r\n t+=1\r\n re(a*10+7,n)\r\n re(a*10+8,n)\r\nl=[]\r\nt=0\r\nn=int(input())\r\nif n==1:\r\n print(2)\r\nelif n==2:\r\n print(6)\r\nelse:\r\n t=6\r\n for i in range(2,n):\r\n t=(t*2)+2\r\n print(t)\r\n", "n=int(input())\nr=0\nfor i in range(1, n+1):\n r+=2**i\nprint(r)\n# Sat Sep 23 2023 11:40:59 GMT+0300 (Moscow Standard Time)\n", "n = int(input())\nprint(pow(2, n + 1) - 2)\n\n# Sat Oct 21 2023 01:23:32 GMT+0300 (Moscow Standard Time)\n", "print(sum([(1<<i) for i in range(1,int(input())+1)]))" ]

[ "n = int(input())\r\nstr = input()\r\ns = set(str.lower())\r\nif len(s) == 26: print(\"YES\")\r\nelse: print(\"NO\")", "n = int(input())\r\n\r\ns= input()\r\ns = s.lower()\r\n\r\n\r\nalphabet = 'abcdefghijklmnopqrstuvwxyz'\r\nfor i in alphabet:\r\n c = s.count(i)\r\n if c < 1:\r\n print('NO')\r\n exit()\r\nprint('YES')\r\n", "n=int(input())\nch=input()\nm=0\nletter='abcdefghijklmnopqrstuvwxyz'\nfor i in letter:\n if i not in ch.lower():\n m=1\nif m==1:\n print(\"No\")\nelse:\n print(\"Yes\")\n\t\t\t \t \t \t \t\t \t \t\t\t \t \t \t", "n = int(input())\r\nsentence = input().lower()\r\nprint('NO' if n<26 or len(set(sentence))<26 else 'YES')\r\n", "str = \"abcdefghijklmnopqrstuvwxyz\"\r\nlist = list(str)\r\ndicList = []\r\nfreq = {}\r\n\r\n# input goes here ->str input\r\nn = int(input())\r\ns = input().lower()\r\n\r\nfor char in s:\r\n if char in freq:\r\n freq[char] += 1\r\n #print(freq)\r\n else:\r\n freq[char] = 1\r\n #print(freq)\r\n\r\nfor key in freq.keys():\r\n dicList.append(key)\r\n\r\nif sorted(list) == sorted(dicList):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "n=int(input());b=input().upper()\r\nfor i in range(65,91):\r\n if chr(i) in b:\r\n continue\r\n else:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")", "#panagram\nn=int(input())\ns=input()[:n]\nalphabet='abcdefghijklmnopqrstuvwxyz'\ns=s.lower()\nt=1\nfor i in alphabet:\n if i not in s:\n t=0\n break\nif t==1:\n print('YES')\nelse:\n print(\"NO\")\n\n \n\n \t\t\t\t\t \t \t\t\t\t\t\t\t\t\t\t\t \t\t \t", "alpha=\"abcdefghijklmnopqrstuvwxyz\"\r\nn=int(input(\"\"))\r\ns=input().lower()\r\nfor x in alpha:\r\n if x not in s:\r\n print(\"no\")\r\n quit()\r\nprint(\"yes\")", "n = int(input())\r\n\r\ns = input().lower()\r\n\r\na = 'abcdefghijklmnopqrstuvwxyz'\r\ncol = 0\r\n\r\nif n < 26:\r\n print('NO')\r\nelse:\r\n for i in range(n):\r\n if s[i] in a:\r\n col += 1\r\n a = a.replace(s[i], '')\r\n if col >= 26:\r\n print('YES')\r\n else:\r\n print('NO')", "n = int(input())\r\ns = input()\r\nl = set()\r\nfor i in s:\r\n l.add(i.lower())\r\nif(len(l)==26):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\ns = str(input())\r\ns_lowered = s.lower()\r\nCounter = set(s_lowered)\r\nif len(Counter) == 26:\r\n print('YES')\r\nelse:\r\n print('NO')", "# your code goes here\nn=int(input())\nv=input()\ns='abcdefghijklmnopqrstuvwxyz'\nv=v.lower()\ncount=0\nfor i in s:\n\tif i in v:\n\t\tcount+=1\nif count==26:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n \t \t\t\t \t \t\t\t \t\t\t \t \t\t", "a=int(input())\ns=input()\nc=set()\nfor i in s:\n if i>='a' and i<='z':\n c.add(i)\n if i>='A' and i<='Z':\n i=i.lower()\n c.add(i)\nif len(c)==26:\n print('YES')\nelse:\n print('NO')\n \t\t \t \t\t\t \t\t\t \t\t\t \t", "n = int(input())\r\ns = input().lower()\r\na = set(list(s))\r\nif n >= 26 and len(a) == 26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "l=int(input())\ns=input()\nd=\"abcdefghijklmnopqrstuvwxyz\"\nfor i in d:\n if i not in s.lower():\n print(\"NO\")\n break\nelse:\n print(\"YES\")\n\n\t \t \t \t \t \t\t\t\t \t \t\t \t \t \t", "def check(text):\n text = text.lower()\n text=text.replace(' ','')\n unique_letters = set(text)\n if len(unique_letters) == 26:\n pass1='YES'\n return pass1\n else:\n pass1='NO'\n return pass1\nn=input()\ntext1=input()\nprint(check(text1))\n\t\t \t\t\t\t \t\t\t \t \t\t\t \t \t \t \t", "#problem ll\nT=int(input())\ns=input()\na=set()\nfor i in s:\n if i.isalpha():\n i=i.lower()\n a.add(i)\nif len(a)==26:\n print(\"Yes\")\nelse:\n print(\"No\")\n\n\n\t\t\t \t \t \t \t\t\t\t\t \t\t\t\t\t\t", "n=int(input())\r\nm=str(input()).upper()\r\nl=[]\r\nfor i in range(n):\r\n if m[i] in l:\r\n continue\r\n \r\n else:\r\n l.append(m[i])\r\nif len(l)==26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "n=int(input())\r\ns=input()\r\ns=s.lower()\r\na=set(s)\r\nif len(a)==26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "len_word=int(input())\r\nword=input().lower()\r\ncount_simvols=set()\r\nanswer=[]\r\nfor i in word:\r\n count_simvols.add(i)\r\nfor i in count_simvols:\r\n answer.append(i)\r\nif len(count_simvols)==26:\r\n print('YES')\r\nelse:\r\n print('NO')", "n1=int(input())\r\nx1=input()\r\nl1=[]\r\nl2=[\"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\nfor i1 in x1:\r\n if i1.lower() not in l1:\r\n i2=i1.lower()\r\n l1.append(i2)\r\nif sorted(l1)==l2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "x=int(input())\ns=input()\ns=s.lower()\na=[]\nfor i in s:\n\tif i not in a:\n\t\ta.append(i)\n\telif i in a:\n\t\tcontinue\nif len(a)==26:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n\t \t\t \t \t \t \t\t \t\t \t\t \t\t \t \t\t\t", "l=int(input())\ns=input()\ns=s.lower()\nk=set(s)\nif len(k)==26:\n print('YES')\nelse:\n print('NO')\n\t \t\t \t\t \t\t\t\t \t\t\t\t \t \t \t\t", "n=int(input())\ns=input().lower()\ns=set(s)\ns=[i for i in s if i.isalpha()]\n#print(s)\nif len(s)==26:\n print('Yes')\nelse: print('No')\n\n \t \t\t \t\t\t \t\t \t\t\t \t \t \t \t", "def main():\n n = int(input())\n s = input().lower()\n\n h = {}\n for i in range(len(s)):\n h[s[i]] = 1\n\n if len(h.keys()) < 26:\n print(\"NO\")\n else:\n print(\"YES\")\n\nmain()\n \t\t\t \t\t \t \t\t\t \t\t\t\t \t \t \t\t \t\t", "n, sentence = int(input()), str(input()).lower()\r\n\r\nif len(set(list(sentence))) == 26: print(\"YES\")\r\nelse: print(\"NO\")", "# Read input\r\nn = int(input())\r\ns = input().lower() # Convert the string to lowercase\r\n\r\n# Create a set to keep track of unique characters\r\nchar_set = set()\r\n\r\n# Iterate through the characters in the string\r\nfor char in s:\r\n # Add lowercase letters to the set\r\n if 'a' <= char <= 'z':\r\n char_set.add(char)\r\n\r\n# Check if the set contains all lowercase letters\r\nif len(char_set) == 26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\ntext = list(input().lower())\r\nalphabet = list('abcdefghijklmnopqrstuvwxyz')\r\ni = 0\r\nwhile i < 26:\r\n if alphabet[i] in text:\r\n i += 1\r\n if i == 26:\r\n print('YES')\r\n continue\r\n else:\r\n print('NO')\r\n break\r\n", "n=int(input())\r\nstr1=input()\r\nif n>=26:\r\n str1=str1.upper()\r\n brr=[]\r\n for i in range (65,91):\r\n brr.append(i)\r\n for num in str1:\r\n if ord(num) in brr:\r\n brr.remove(ord(num))\r\n if len(brr)==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "def is_pangram(string):\n seen_letters = set()\n for char in string:\n char = char.lower()\n if 'a' <= char <= 'z':\n seen_letters.add(char)\n return len(seen_letters) == 26\nn = int(input())\nstring = input().strip()\nif is_pangram(string):\n print(\"YES\")\nelse:\n print(\"NO\")\n\n \t \t\t\t \t\t \t\t \t\t \t\t \t\t\t", "n = input()\r\ns = input()\r\ns= s.lower()\r\nst= set(s)\r\nif len(st) == 26:\r\n print (\"YES\")\r\nelse:\r\n print (\"NO\")\r\n", "def main():\r\n from sys import stdin, stdout\r\n n = stdin.readline().rstrip()\r\n s = stdin.readline().rstrip()\r\n\r\n empty = []\r\n for i in s:\r\n if i.lower() not in empty:\r\n empty.append(i.lower())\r\n \r\n if len(empty) == 26:\r\n return stdout.write(\"YES\")\r\n else:\r\n return stdout.write(\"NO\")\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\r\ns = input()\r\nprint(\"YES\" if len(set(s.lower())) > 25 else \"NO\")", "def solve(s):\r\n s = set(s.lower())\r\n if len(s) == 26:\r\n return 'YES'\r\n return 'NO'\r\nn = int(input())\r\ns = input()\r\nprint(solve(s))\r\n", "def is_pangram(string):\r\n alphabet = set(\"abcdefghijklmnopqrstuvwxyz\")\r\n letters = set(string.lower())\r\n return alphabet.issubset(letters)\r\n\r\nn = int(input())\r\nstring = input().strip()\r\n\r\nif is_pangram(string):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\ns = input()\ns = s.lower()\nk = set()\nfor i in range(97,123):\n k.add(chr(i))\nc = 0\nf = 0\nfor i in k:\n if i in s:\n c+=1\n else:\n break\nif(c==26):\n print(\"YES\")\nelse:\n print(\"NO\")\n \n \n \n\n \t \t\t\t\t \t \t\t\t\t \t \t\t\t \t \t \t\t", "x = input()\r\nz = input()\r\nz = z.lower()\r\nc = len(set(z))\r\nif(c == 26):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "set_aplh = set()\r\nfor i in range(65,91):\r\n set_aplh.add(chr(i)) \r\nn = int(input())\r\ns = set(input().upper())\r\n# print(s)\r\n\r\nif set_aplh == s:\r\n print('yes') \r\nelse:\r\n print('No')\r\n", "n=int(input())\r\ns=input()\r\ne=s.upper()\r\nq=\"\"\r\nc=0\r\nfor i in e:\r\n if(i not in q):\r\n q=q+i\r\n c+=1\r\nif(c==26):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "def main():\r\n n = input()\r\n print('YES' if len(set(list(input().lower()))) == 26 else 'NO')\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "#finds the set of unique letters in the word\r\ncharacters = input()\r\nword = set(input().lower())\r\n\r\n#checks if every word in the alphabet is in the word then prints result\r\nif len(word) == 26:\r\n print('YES')\r\nelse:\r\n print('NO')", "n=int(input())\r\ns=input()\r\nc1=0\r\nc=\"abcdefghijklmnopqrstuvwxyz\"\r\nfor i in c:\r\n if i not in s.lower():\r\n c1+=1\r\nif c1==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\ns=input()\ns=s.lower()\nalb='abcdefghijklmnopqrstuvwxyz'\ns=set(s)\nif len(s)==26:\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", "n = int(input())\r\ns = input()\r\nif n>=26:\r\n s = s.lower()\r\n l = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']\r\n for i in l:\r\n if s.count(i) ==0:\r\n print(\"NO\")\r\n break\r\n else:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import string\nn = input()\ninp = input().lower()\nfor i in string.ascii_lowercase:\n if i not in inp:\n r =\"NO\"\n break\n else:\n r = \"YES\"\nprint(r)\n", "s='abcdefghijklmnopqrstuvwxyz'\r\nl=int(input())\r\nv=input()\r\nv=v.lower()\r\nval=\"YES\"\r\nfor i in s:\r\n if i not in v:\r\n val=\"NO\"\r\n break\r\nprint(val)", "d=set()\r\na=int(input())\r\nb=input()\r\nb=b.lower()\r\nif len(b)<26:\r\n print('NO')\r\nelse:\r\n for i in b:\r\n d.add(i)\r\n if len(d)==26:\r\n print('YES')\r\n else:\r\n print('NO')", "n = int(input())\r\ns = input().lower()\r\nletter_set = set()\r\nfor char in s:\r\n if char.isalpha():\r\n letter_set.add(char)\r\nif len(letter_set) == 26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\nl=set(input().lower())\r\nprint(\"YES\" if len(l)==26 else \"NO\")", "n=int(input())\r\nx=input()\r\nx=x.lower()\r\nz='abcdefghijklmnopqrstuvwxyz'\r\nt=True\r\nfor i in z:\r\n if i not in x:\r\n t=False\r\n break\r\n\r\nif t==True:\r\n print('YES')\r\nelse:\r\n print('NO')", "#Coder_1_neel\r\nn = int(input())\r\na = input().lower()\r\ns=('abcdefghijklmnopqrstuvwxyz')\r\n\r\nif set(a) >= set(s):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "\r\ndef isPan(string):\r\n string = string.lower()\r\n s = list('abcdefghijklmnopqrstuvwxyz')\r\n for i in s:\r\n if i not in string:\r\n return False\r\n return True\r\n\r\na = int(input())\r\nstring = input()\r\n\r\nif a<26 or not(isPan(string)):\r\n print(\"NO\")\r\nelse:\r\n print(\"Yes\")\r\n", "n = int(input())\r\nstring = input().strip().lower()\r\nalphabet = set(\"abcdefghijklmnopqrstuvwxyz\")\r\n\r\nif set(string) >= alphabet:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "x=int(input())\r\ny=input()\r\ny=set(y.lower())\r\nif len(y)<26:\r\n print(\"NO\")\r\nelif len(y)>=26:\r\n print(\"YES\")", "alphabet = ['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']\nsize = input()\nstring = input()\npangran = True\nfor leter in alphabet:\n if leter not in string.lower():\n pangran = False\n break\nif pangran:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t\t\t \t\t \t \t \t \t\t \t\t\t", "n = int(input())\ns = input().strip()\n\n\nletter_set = set()\n\n\nfor char in s:\n if 'a' <= char <= 'z' or 'A' <= char <= 'Z':\n letter_set.add(char.lower()) \n\n\nif len(letter_set) == 26:\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", "def pangram(s):\n char_set = set() \n for ch in s:\n if ch >= 'a' and ch <= 'z':\n char_set.add(ch)\n if ch >= 'A' and ch <= 'Z':\n ch = ch.lower()\n char_set.add(ch)\n return len(char_set) == 26\nn=int(input())\ns=input()\nif pangram(s) == True:\n print(\"Yes\")\nelse:\n print(\"No\")\n \t \t\t \t\t \t \t\t\t \t\t\t \t \t", "n = int(input())\r\ns = input().lower() # Convert the string to lowercase to make the comparison case-insensitive\r\n\r\n# Create a set to store the letters in the string\r\nletters_set = set()\r\n\r\n# Iterate through the characters in the string\r\nfor char in s:\r\n if char.isalpha(): # Check if the character is a letter\r\n letters_set.add(char)\r\n\r\n# Check if the set contains all 26 letters of the alphabet\r\nif len(letters_set) == 26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "from collections import Counter\r\nimport math\r\ninput()\r\ns = input().lower()\r\nls = list(Counter(s))\r\nprint(\"YES\" if len(ls) == 26 else \"NO\")", "n_chars = int(input())\nstr_chars = []\ncontent = str(input())\nif n_chars < 26:\n print('NO')\nelse:\n for i in content:\n l = i.lower()\n if l not in str_chars:\n str_chars.append(l)\n if len(str_chars) != 26:\n print('NO')\n else:\n print('YES')\n\n \t \t \t\t\t\t \t \t\t \t \t \t\t", "\r\ndef ispangram(str):\r\n alphabet = \"abcdefghijklmnopqrstuvwxyz\"\r\n for char in alphabet:\r\n if char not in str.lower():\r\n return False\r\n return True\r\n# main\r\nn = int(input())\r\nstring = input()\r\nif(ispangram(string) == True):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "n = int(input())\nstring = input().lower() \nul = set()\nfor char in string:\n if char.isalpha(): \n ul.add(char)\n\nif len(ul) == 26:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\t \t\t\t \t\t \t \t \t\t \t \t \t", "def is_pangram(n, s):\r\n letter_set = set()\r\n for char in s:\r\n if char.isalpha(): \r\n letter_set.add(char.lower())\r\n return len(letter_set) == 26\r\n\r\nn = int(input())\r\ns = input()\r\n\r\n\r\nresult = is_pangram(n, s)\r\nif result:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\ns = input().lower() \r\nalphabet = set(\"abcdefghijklmnopqrstuvwxyz\")\r\nif all(letter in s for letter in alphabet):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def main():\n n = int(input())\n sentence = set(input().lower())\n alphabet = ['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']\n\n for letter in alphabet:\n if letter not in sentence:\n print(\"NO\")\n return\n print(\"YES\")\n \n pass\n\n\n\nmain()\n\t\t \t\t \t\t \t\t \t \t\t \t\t\t\t \t", "# Read input\r\nn = int(input())\r\ns = input().lower() # Convert the string to lowercase to simplify the check\r\n\r\n# Create a set to store the unique letters in the string\r\nunique_letters = set()\r\n\r\n# Iterate through the string and add each letter to the set\r\nfor char in s:\r\n if char.isalpha():\r\n unique_letters.add(char)\r\n\r\n# Check if there are 26 unique letters (the alphabet)\r\nif len(unique_letters) == 26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "p=int(input())\r\nstring=input()\r\nstring=string.lower()\r\nlang=set(\"abcdefghijklmnopqrstuvwxyz\")\r\nfor char in string:\r\n\tif char in lang:\r\n\t\tlang.remove(char)\r\nif not lang:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "input();print(['YES','NO'][len(set(input().lower()))<26])\r\n", "n = int(input())\nstring = input()\nunique = set()\nfor char in string:\n char = char.lower()\n if 'a' <= char <= 'z':\n unique.add(char)\n\nif len(unique) == 26:\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", "small = \"abcdefghijklmnopqrstuvwxyz\"\ncapital = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\n\nn = int(input())\ns = input()\n\nc = 0\nfor i in range(26):\n if s.find(small[i]) != -1 or s.find(capital[i]) != -1:\n c += 1\n\nif c == 26:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t\t \t\t \t \t \t\t\t \t \t\t \t \t", "n = int(input())\ns = input()\ns = s.lower()\nd = {}\nfor i in s:\n if i in d:\n d[i] = d[i] + 1\n else:\n d[i] = 1\nfor i in range(97,123):\n if chr(i) not in d:\n print(\"NO\")\n break\nelse:\n print(\"YES\")\n \t\t \t\t \t\t \t \t \t \t\t \t", "t=int(input())\nk=str(input().strip().lower())[:t]\nl=list(set(list(k)))\nif len(l)==26:\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", "n = int(input())\r\ns = input().lower() # Convert the string to lowercase for case-insensitive comparison\r\n\r\n# Create a set to store the unique letters in the string\r\nletters_set = set(s)\r\n\r\n# Check if the set contains all 26 lowercase letters of the alphabet\r\nif len(letters_set) == 26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "input();print(\"YNEOS\"[len({*input().lower()})<26::2])", "n=int(input())\ns = input()\ns = s.lower()\ns1=set(s)\nif len(s1)==26:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n \t \t \t\t \t\t \t\t \t \t \t", "n=int(input())\r\ns=input()\r\ns=s.lower()\r\nb=\"true\"\r\na=\"abcdefghijklmnopqrstuvwxyz\"\r\nfor c in a:\r\n if c not in s:\r\n b=\"false\"\r\n\r\nif(b==\"true\"):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nword = input().lower()\r\nif len(set(word)) == 26:\r\n print(\"YES\")\r\nelse:print(\"NO\")\r\n\r\n", "n = int(input())\ns = input()\ns = s.lower()\ns1 = list(set(list(s)))\nif len(s1)==26:\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", "n = int(input())\nletters = set(input().lower())\nif len(letters) ==26:\n print(\"Yes\")\nelse:\n print(\"No\")\n \t \t \t \t\t \t\t \t\t \t\t \t \t \t", "n=int(input())\r\ns1=input()\r\ns1=s1.lower()\r\ns1=set(s1)\r\ns1=list(s1)\r\nif(len(s1)==26):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "length = int(input())\r\nPangram = input()\r\nPangram = Pangram.lower()\r\nif len(set(Pangram)) != 26:\r\n print('NO')\r\nelse:\r\n print('YES')", "import string\nalphabet = set(string.ascii_lowercase)\ncount=int(input())\ninput_string = input()\nif set(input_string.lower()) >= alphabet:\n print(\"YES\")\n\nelse:\n print(\"NO\")", "n=int(input())\r\ns=input()\r\ns1=s.lower()\r\nl1=list(s1)\r\nl2=[]\r\nfor i in l1:\r\n if i not in l2:\r\n l2.append(i)\r\nif len(l2)==26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def contains_all_alphabets(input):\r\n for c in range(ord('a'), ord('z')+1):\r\n if chr(c) not in input and chr(c).upper() not in input:\r\n return False\r\n return True\r\n\r\n\r\ninput_size = int(input())\r\ninput_str = input()\r\nprint(\"Yes\" if contains_all_alphabets(input_str) else \"No\")\r\n", "n = int(input())\r\nstring = input()\r\nletters_seen = set()\r\nfor char in string:\r\n if char.isalpha():\r\n letters_seen.add(char.lower())\r\nif len(letters_seen) == 26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "chars = \"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\nallchars = chars.split()\r\nn = int(input())\r\nstr = list(input().lower())\r\nres = all(ele in str for ele in allchars)\r\nif res:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def Pangram(x):\r\n alphabet = {i for i in range(97,123)}\r\n for i in range(len(x)):\r\n if ord(x[i].lower()) in alphabet:\r\n alphabet.discard(ord(x[i].lower()))\r\n if alphabet.__len__() == 0:\r\n return 'YES'\r\n return 'NO'\r\n_ = input()\r\nprint(Pangram((input())))", "import string\nw=int(input())\nb=input().lower()\nli=list(string.ascii_lowercase)\nn=set(b)\nl=len(n)\nl1=len(li)\nif l==l1:\n print(\"Yes\")\nelse:\n print(\"No\")\n \t \t \t \t \t\t\t\t\t \t\t", "num=int(input())\r\nstring_a=input()\r\nc=string_a.lower()\r\nset_b=set(c)\r\nif len(set_b)==26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import string\r\n\r\nn=int(input())\r\ninput_string=input()\r\nalphabet = set(string.ascii_lowercase)\r\n\r\nif(set(input_string.lower()) >= alphabet):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=int(input())\r\nl=input().lower()\r\nc=set()\r\nfor i in l:\r\n if i.isalpha():\r\n c.add(i)\r\nif len(c)!=26:\r\n print('NO')\r\nelse:\r\n print('YES')", "n=int(input())\r\nal=\"abcdefghijklmnopqrstuvwxyz\"\r\nc=0\r\ns=input()\r\ny=s.lower()\r\ny=set(y)\r\nfor i in al:\r\n if i not in y:\r\n print(\"NO\")\r\n break\r\n else:\r\n c+=1\r\nif c==26:\r\n print(\"YES\")\r\n ", "n = int(input())\ns = input().lower()\nsett = list(set(s))\nif len(sett)==26:\n print(\"YES\")\n \nelse:\n print(\"NO\")\n\t\t \t\t \t \t \t \t\t \t\t \t \t\t \t", "n = int(input())\r\na = sorted(set(input().lower()))\r\nall = \"abcdefghijklmnopqrstuvwxyz\"\r\nb = \"\".join(a)\r\nif b == all:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# 520A - Pangram\r\n# https://codeforces.com/problemset/problem/520/A\r\n\r\n# Inputs:\r\n# 1) Longitud del string\r\n# 2) String a revisar\r\nlongitud = int(input())\r\nstring = input()\r\n\r\n# String en minúsculas\r\npangram = string.lower()\r\n\r\n# Diccionario de letras del alfabeto\r\n# {Letra: Contador de apariciones}\r\nalfabeto = {}\r\n\r\n# Itera sobre las letras del string\r\nfor letra in pangram:\r\n\r\n # Si la letra no está en el diccionario, añádelo con un contador de veces que ha aparecido igual a 1\r\n if letra not in alfabeto:\r\n alfabeto[letra] = 1\r\n\r\n # Si la letra ya está en el diccionario, entonces suma 1 al contador de veces que ha aparecido\r\n else:\r\n alfabeto[letra] += 1\r\n\r\n# Si el diccionario del alfabeto tiene 26 letras, entonces el string es un pangrama\r\nif len(alfabeto) == 26:\r\n print('YES')\r\n\r\n# Si el diccionario del alfabeto tiene menos de 26 letras, entonces el string no es un pangrama\r\nelse:\r\n print('NO')", "n = int(input())\nletters = set(input().lower())\nif len(letters) == 26:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t \t \t \t \t \t \t\t\t\t \t \t\t", "n = int(input())\r\nb = input()\r\nif n < 26:\r\n print(\"NO\")\r\nelse:\r\n b = b.lower()\r\n b = set(b)\r\n if len(b) >= 26:\r\n print('YES')\r\n else:\r\n print(\"NO\")\r\n\r\n", "def is_pangram(s):\n alphabet = set(\"abcdefghijklmnopqrstuvwxyz\")\n\n # Convert the string to lowercase and remove any non-alphabet characters\n s = ''.join(filter(str.isalpha, s)).lower()\n\n # Check if the set of letters in the string is equal to the full alphabet set\n return set(s) == alphabet\n\nif __name__ == \"__main__\":\n n = int(input())\n s = input()\n \n if is_pangram(s):\n print(\"YES\")\n else:\n print(\"NO\")\n\n \t\t\t\t\t \t \t\t \t \t \t\t \t\t\t\t\t\t\t\t", "n=int(input())\r\ns=input()\r\ns=s.lower()\r\na=\"abcdefghijklmnopqrstuvwxyz\"\r\ny=list(set(s))\r\ny.sort()\r\na=list(a)\r\nif y==a:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")", "input()\r\ns = {*input().lower()}\r\nif len(s)<26:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "alfabetoMinus = ['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']\n\nreps = int(input())\npalabra = str(input())\nbol = True\nlista = []\nfor i in range(len(palabra)):\n if 'A' <= palabra[i] <= 'Z': \n cod = ord(palabra[i])\n cod = chr(cod+32)\n lista.append(cod)\n elif 'a' <= palabra[i] <= 'z':\n lista.append(palabra[i])\n\nfor i in range(len(alfabetoMinus)):\n if alfabetoMinus[i] not in lista:\n bol = False\n \nif bol:\n print('YES')\nelse:\n print('NO')\n \t \t\t \t \t\t \t\t\t\t\t \t \t", "t = int(input())\ns = input()\n\nif len(s) < 26:\n print('NO')\nelse:\n unique_s = set(s.lower())\n if len(unique_s) == 26:\n print('YES')\n else:\n print('NO')\n\t \t \t \t\t\t\t\t \t\t\t \t \t \t", "n = int(input())\r\nword = list(input())\r\nsentence=[]\r\nAll = \"\"\r\nletters =['A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z']\r\n\r\nfor letter in word:\r\n sentence.append(letter.capitalize())\r\nif n < 26 :\r\n print(\"NO\")\r\nelse : \r\n for i in letters :\r\n if i in sentence :\r\n All = \"YES\"\r\n if i not in sentence :\r\n All = \"NO\"\r\n break\r\n \r\nprint(All)", "t=int(input())\nstr1=input().lower()\ns=set(str1)\nif(len(s)==26):\n print(\"YES\")\nelse:\n print(\"NO\")\n \t\t\t\t \t\t \t \t \t \t\t\t \t\t \t", "i1 = int(input())\r\ni2 = input()\r\ni3=i2.lower()\r\ni=0\r\nif \"a\" in i3:\r\n i+=1\r\nif \"b\" in i3:\r\n i+=1\r\nif \"c\" in i3:\r\n i+=1\r\nif \"d\" in i3:\r\n i+=1\r\nif \"e\" in i3:\r\n i+=1\r\nif \"f\" in i3:\r\n i+=1\r\nif \"g\" in i3:\r\n i+=1\r\nif \"h\" in i3:\r\n i+=1\r\nif \"i\" in i3:\r\n i+=1\r\nif \"j\" in i3:\r\n i+=1\r\nif \"k\" in i3:\r\n i+=1\r\nif \"l\" in i3:\r\n i+=1\r\nif \"m\" in i3:\r\n i+=1\r\nif \"n\" in i3:\r\n i+=1\r\nif \"o\" in i3:\r\n i+=1\r\nif \"p\" in i3:\r\n i+=1\r\nif \"q\" in i3:\r\n i+=1\r\nif \"r\" in i3:\r\n i+=1\r\nif \"s\" in i3:\r\n i+=1\r\nif \"t\" in i3:\r\n i+=1\r\nif \"u\" in i3:\r\n i+=1\r\nif \"v\" in i3:\r\n i+=1\r\nif \"w\" in i3:\r\n i+=1\r\nif \"x\" in i3:\r\n i+=1\r\nif \"y\" in i3:\r\n i+=1\r\nif \"z\" in i3:\r\n i+=1\r\n \r\nif i==26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\ns = input().lower()\ns1 = \"abcdefghijklmnopqrstuvwxyz\"\nfor char in s1:\n if char in s:\n flag = 1\n else:\n flag = 0\n break\nif 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", "import string\na=int(input())\ns=input().lower()\nal=list(string.ascii_lowercase)\nn=set(s)\nl=len(n)\nl1=len(al)\nif l==l1:\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", "from string import ascii_lowercase\r\nn = int(input())\r\n\r\nsolj = set(input().lower())\r\nletters = set(ascii_lowercase)\r\nif solj == letters:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nstring = str(input()).lower()\r\nd = []\r\nfor i in string:\r\n if d.count(i)==0:\r\n d.append(i)\r\nif len(d) == 26:\r\n print(\"YES\")\r\nelse:print(\"NO\")\r\n", "n=int(input())\nt=str(input().strip().lower())[:n]\nl=list(set(list(t)))\nif len(l)==26:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t \t \t \t \t \t \t\t\t \t\t\t \t \t", "n=int(input())\ns = input()\ns = s.lower()\nl = ['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']\nfor i in l:\n\tif i not in s:\n\t\tprint(\"NO\")\n\t\tbreak\nelse:\n\tprint(\"YES\")\n \t \t\t\t \t\t\t\t \t\t\t\t\t \t\t \t", "num = int(input())\r\nstrings = input().lower()\r\nalf =(\"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\ndef alf_check(string,alf):\r\n for i in alf:\r\n \r\n if i not in string:\r\n \r\n return \"NO\"\r\n return \"YES\"\r\nprint(alf_check(strings,alf))", "n = int(input())\nstr1 = input()\nstr1 = str1.lower()\nset1 = set(str1)\nif(len(set1)==26):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "n = int(input())\ns=input().lower()\nchara = set()\nfor char in s:\n if char.isalpha():\n chara.add(char)\nif len(chara)==26:\n print(\"Yes\")\nelse:\n print(\"No\")\n \t \t \t\t \t \t \t\t \t\t \t \t \t", "n = int(input())\r\np = input()\r\np = p.lower()\r\np = list(set(list(p)))\r\np.sort()\r\nalf = ['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\nif p == alf:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "abc = list('abcdefghijklmnopqrstuvwxyz')\n\nn=int(input())\ns = input().lower()\nif n < 26:\n print(\"NO\")\nelse:\n s = set(s)\n if(len(s)==26):\n print(\"YES\")\n else:\n print(\"NO\")\n \t \t\t\t\t\t \t \t \t \t \t\t\t \t \t\t\t\t\t", "n = int(input())\r\nlst = ''.join([i.lower() for i in str(input())])\r\n\r\nfrom collections import Counter\r\nN = len(Counter(lst))\r\nif N == 26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\nstring = input()\n\nalphabet = set('abcdefghijklmnopqrstuvwxyz')\n\nif set(string.lower()) >= alphabet:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t\t\t \t \t\t \t\t \t\t\t \t \t\t \t", "def is_pangram(n, string):\n alphabet = set(\"abcdefghijklmnopqrstuvwxyz\")\n string = string.lower()\n for char in string:\n if char in alphabet:\n alphabet.remove(char)\n return \"YES\" if len(alphabet) == 0 else \"NO\"\nn = int(input())\nstring = input()\nresult = is_pangram(n, string)\nprint(result)\n\n\t\t\t \t \t \t\t \t \t\t \t \t \t \t \t\t", "for _ in range(1):\r\n n=int(input())\r\n s=input().lower()\r\n if n<26:\r\n print(\"NO\")\r\n continue\r\n d={}\r\n for i in s:\r\n if i in d:\r\n d[i]+=1\r\n else:\r\n d[i]=1\r\n x=list(d.keys())\r\n if len(x)==26:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n=int(input())\r\ns=input()\r\ns1=s.lower()\r\ns2=set(s1)\r\nif(len(s2)==26):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "\nt = int(input())\ns = input()\napt = [chr(ord('a') + i) for i in range(26)]\nsf = set(s.lower())\n\npossible = True\n\nfor i in apt:\n if i not in sf:\n possible = False\n\nif possible:\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", "# https://codeforces.com/problemset/problem/520/A\r\n\r\nn=input()\r\ns=input().lower()\r\na=[1 for _ in range(26)]\r\nfor c in s:\r\n\ta[ord(c)-ord('a')]=0\r\nfor c in a:\r\n\tif c==1:\r\n\t\tprint(\"NO\")\r\n\t\texit()\r\nprint(\"YES\")", "input()\r\nprint(\"YES\" if set(input().lower())==set(\"abcdefghijklmnopqrstuvwxyz\") else \"NO\")", "n = int(input())\r\ns = input().lower()\r\n\r\nalphabet = set('abcdefghijklmnopqrstuvwxyz')\r\n\r\nif set(s) >= alphabet:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\ns=input()\r\ns=s.lower()\r\nk=set()\r\nif len(s)<26:\r\n print(\"NO\")\r\nelse:\r\n for i in s:\r\n if i not in k:\r\n k.add(i)\r\n if len(k)==26:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n = int(input())\r\ns1 = input().lower() \r\n\r\nletters1 = set()\r\n\r\nfor char in s1:\r\n if 'a' <= char <= 'z':\r\n letters1.add(char)\r\n\r\nif len(letters1) == 26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "num=int(input())\r\naz=input().strip()\r\nse=set()\r\naz=az.lower()\r\nfor i in az:\r\n if i.isalpha():\r\n se.add(i)\r\n \r\nif len(se)!=26:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "x=int(input())\ny=input()\ny=y.lower()\np=set(y)\nif len(p)==26:\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", "import string\r\nnu = int(input())\r\ns = set(input().lower())\r\nabc = set(string.ascii_lowercase)\r\nif abc <= s:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def main():\n\n n = int(input())\n\n letters = []\n\n string = input()\n\n string = string.lower()\n\n for letter in range(n):\n if (string[letter] not in letters):\n letters.append(string[letter])\n\n if (len(letters) == 26):\n print('YES')\n else:\n print('NO')\n\n \nmain()\n\t\t \t \t \t\t \t \t \t\t\t \t \t", "test=1\n\nfor t in range(test):\n n = int(input())\n s = input().lower()\n m = {}\n cnt = 0\n for i in range(n):\n if s[i] in m:cnt+=1\n else:\n cnt+=2\n m[s[i]]=1\n if len(m)==26:print(\"YES\")\n else:print(\"NO\")\n \t \t \t \t\t \t\t\t \t\t\t\t\t", "n=int(input())\r\ns=input()\r\ns1=s.lower()\r\nl=[]\r\nfor i in range(len(s1)):\r\n if(s1[i] not in l):\r\n l.append(s1[i]) \r\nif len(l)==26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") ", "n = int(input())\r\npang = input().lower()\r\nn2 = set(pang)\r\nif len(n2) >= 26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "p=input()\r\ns=input().lower()\r\nv=[0]*132\r\nfor i in s:\r\n v[ord(i)]+=1\r\no=0\r\nfor i in v:\r\n if i > 0:\r\n o+=1\r\nif o==26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "n=int(input())\r\ns=input().lower()\r\nalp=set(\"abcdefghijklmnopqrstuvwxyz\")\r\nif set(s)>=alp:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\nt=input().lower()\r\nl=[i for i in range(97,123)]\r\nfor i in l:\r\n if chr(i) in t:\r\n continue\r\n else:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")", "n=int(input())\r\nstring=input()\r\nl=set(string.lower())\r\nif len(l)==26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "letters = {\"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\"}\n\nsize = int(input())\nword = input().rstrip('\\n').lower()\n\nfor i in range(size):\n if (word[i] in letters):\n letters.remove(word[i])\n\nif (len(letters) == 0):\n print(\"YES\")\nelse:\n print(\"NO\")\n \t \t \t\t\t\t\t \t\t\t \t \t\t \t\t", "v=input()\r\nm=input().lower()\r\nx=set(m)\r\nif len(x)==26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "#### Решение задач проекта CODEFORSES, Задача 520A\r\n#\r\n# (C) 2023 Артур Ще, Москва, Россия\r\n# Released under GNU Public License (GPL)\r\n# email [email protected]\r\n# -----------------------------------------------------------\r\n\r\n'''\r\nA. Панграмма\r\nограничение по времени на тест2 секунды\r\nограничение по памяти на тест256 мегабайт\r\nвводстандартный ввод\r\nвыводстандартный вывод\r\nСлово или предложение на некотором языке называется панграммой, если в нем встречаются все символы алфавита этого\r\nязыка хотя бы один раз. Панграммы часто используют в типографии для демонстрации шрифтов или тестирования средств\r\nвывода различных устройств.\r\n\r\nВам дана строка, состоящая из маленьких и больших латинских букв. Проверьте, является ли эта строка панграммой.\r\nСчитается, что строка содержит букву латинского алфавита, если эта буква встречается в верхнем или нижнем регистре.\r\n\r\nВходные данные\r\nВ первой строке записано одно целое число n (1 ≤ n ≤ 100) — количество символов в строке.\r\n\r\nВо второй строке записана сама строка. Строка содержит исключительно строчные и заглавные латинские буквы.\r\n\r\nВыходные данные\r\nВыведите «YES», если строка является панграммой, и «NO» в противном случае.\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(input())\r\na2=input()\r\na3 = a2.lower()\r\nif len(set(a3)) == 26 : print('YES')\r\nelse: print('NO')\r\n", "# Read input\r\nn = int(input())\r\ns = input().lower() # Convert the string to lowercase to simplify checking\r\n\r\n# Initialize a set to keep track of the unique letters in the string\r\nunique_letters = set()\r\n\r\n# Iterate through the string and add each letter to the set\r\nfor char in s:\r\n if 'a' <= char <= 'z':\r\n unique_letters.add(char)\r\n\r\n# Check if there are 26 unique letters (the entire English alphabet)\r\nif len(unique_letters) == 26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def pangram():\r\n n=int(input())\r\n s=input().lower()\r\n\r\n if n<26:\r\n print('NO')\r\n return\r\n l=set(list(s))\r\n if len(l)!=26:\r\n print('NO')\r\n else:\r\n print('YES')\r\npangram()", "\r\nn=int(input())\r\ns=input()\r\na=set()\r\nif(n<26):\r\n print(\"NO\")\r\nelse:\r\n \r\n for i in s:\r\n i=i.lower()\r\n a.add(i)\r\n if(len(a)==26):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n ", "t = input()\r\na = input()\r\ndata = set()\r\n\r\nfor char in a.casefold():\r\n data.add(char)\r\n\r\nif len(data) == 26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\r\ninput()\r\nn = input().lower()\r\nletters=['a','b','c','d','e','f','g','h','i','j','k','l','m',\r\n 'n','o','p','q','r','s','t','u','v','w','x','y','z']\r\ncon = True\r\nfor i in letters:\r\n if i not in n:\r\n con = False\r\nif con:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "input()\r\ns0L = input()\r\nif set('abcdefghijklmnopqrstuvwxyz').issubset(set(s0L.lower())):\r\n print('YES')\r\nelse:\r\n print('NO')", "import string\r\nabc = string.ascii_lowercase\r\nn = int(input())\r\na = set(list(input().lower()))\r\nprint('Yes' if ''.join(sorted(a)) == abc else 'No')\r\n", "input()\n\nword = input()\nword = word.lower()\nletters = [0]*26\n\nfor l in word:\n letters[ord(l)-ord('a')] = 1\n\nif sum(letters) == 26:\n print('YES')\nelse:\n print('NO')\n\n\t \t\t \t \t \t \t \t\t \t \t \t \t", "n=int(input())\r\nstr=str(input())\r\nstr=str.lower()\r\nfor i in range(97,123):\r\n if chr(i) not in str:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")", "n=int(input())\ns=input()\n\nletters = set()\n\n # Iterate through each character in the string\nfor char in s:\n if char.isalpha():\n # Convert the character to lowercase and add it to the set\n letters.add(char.lower())\n\nif len(letters)==26: \n print(\"YES\")\nelse:\n print(\"NO\")\n\t\t\t\t\t\t\t \t \t \t\t\t \t \t \t", "n=int(input())\r\ns=set(input().lower())\r\nif len(s)<26:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")", "def is_pangram(n, s):\r\n unique_letters = set(s.lower())\r\n if len(unique_letters) == 26:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\nn = int(input())\r\ns = input()\r\nresult = is_pangram(n, s)\r\nprint(result)\r\n", "n = int(input())\r\ns = input()\r\ns = s.lower()\r\nl=[]\r\nfor i in s:\r\n if i not in l:\r\n l.append(i)\r\nif len(l)==26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\nn = int(input())\n #lst = list(map(int, input().split()))\n #a,b = map(int, input())\ns = input()\nif sorted(set(map(lambda x: x.lower(), s))) == sorted(\"abcdefghijklmnopqrstuvwxyz\"):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "n=int(input())\r\ns=input()\r\ns=s.lower()\r\nalp=\"abcdefghijklmnopqrstuvwxyz\"\r\nd={}\r\nfor x in s:\r\n d[x]=s.count(x)\r\nfor i in alp:\r\n if d.get(i):\r\n alp=alp.replace(i,'')\r\nif len(alp)==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "l=int(input())\r\nn=input().lower()\r\nj=\"abcdefghijklmnopqrstuvwxyz\"\r\nans=\"YES\"\r\nfor i in j:\r\n if i not in n:\r\n ans=\"NO\"\r\n break\r\nprint(ans)", "_ = input()\r\ndata_set = set(letter.lower() for letter in input())\r\nprint(\"YES\" if len(data_set) == 26 else \"NO\")", "n = int(input())\ninput_string = input().lower()\nunique_chars = set()\n\nfor char in input_string:\n if char.isalpha():\n unique_chars.add(char.lower())\n\nif len(unique_chars) == 26:\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", "n=int(input());s=input();s=s.lower();s=list(set(s))\r\nif(len(s)==26):print('YES')\r\nelse:print(\"NO\")", "b = int(input())\r\na = input().lower()\r\n\r\nl = set(a)\r\nif len(l) == 26 :\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "n = int(input())\r\nt = input()\r\nt = t.upper()\r\ns = set(t)\r\n\r\n# Create a set of all uppercase letters\r\nall_uppercase_letters = set(chr(i) for i in range(65, 91))\r\n\r\nif s == all_uppercase_letters:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "t=int(input())\r\nn=input()\r\np=n.lower()\r\ns=set(p)\r\na=list(s)\r\nb=\"\".join(a)\r\nc=\"\".join(sorted(b))\r\ne=\"abcdefghijklmnopqrstuvwxyz\"\r\nif c==e:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "input()\r\ns = set(input().lower())\r\nprint(\"YES\" if len(s) == 26 else \"NO\")", "A = {chr(i):0 for i in range(ord(\"a\"), ord(\"z\") + 1)}\r\nn = int(input())\r\na = input()\r\nfor i in range(n):\r\n A[a[i].lower()] += 1\r\nB = list(A.values())\r\nif B.count(0) == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "input()\r\nprint('YES' if set('abcdefghijklmnopqrstuvwxyz').issubset(input().lower()) else 'NO')", "alfabeto = set()\nfor letra in \"abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ\":\n alfabeto.add(letra)\nn = int(input())\npalavra = input()\nfor l in palavra:\n if l.islower():\n if l in alfabeto:\n alfabeto.remove(l)\n alfabeto.remove(l.upper())\n elif l.isupper():\n if l in alfabeto:\n alfabeto.remove(l)\n alfabeto.remove(l.lower())\nif len(alfabeto) == 0:\n print('YES')\nelse:\n print('NO')\n\n\t \t \t \t \t\t\t \t \t\t \t\t\t\t\t", "n = int(input())\r\ns = input()\r\nif n<26:\r\n print(\"NO\")\r\nelse:\r\n lst = [0]*26\r\n s = s.lower()\r\n for i in s:\r\n lst[ord(i)-97] = 1\r\n ch = True\r\n for i in lst:\r\n if i == 0:\r\n ch = False\r\n break\r\n if ch:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "lenght = int(input())\r\nword = input()\r\n\r\nif (lenght < 26):\r\n print(\"NO\")\r\nelse:\r\n word = set(word.lower())\r\n if len(word) >= 26:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n ", "import string\ns=set(string.ascii_lowercase)\na=int(input())\ns1=input().lower()\nif set(s1)>=s:\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", "\"\"\"Панграмма\"\"\"\r\n\r\ndef main():\r\n t = int(input())\r\n n = input().lower()\r\n print(\"YES\") if len(set(n)) == 26 else print(\"NO\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "from string import ascii_lowercase\r\ninput()\r\nprint({1:\"YES\",0:\"NO\"}.get(sorted(set(input().lower())) == list(ascii_lowercase)))", "n=int(input())\ns=str(input())\nif len(set(s.lower()))==26:\n print('YES')\nelse:\n print('NO')", "n=int(input())\r\nt=input().lower()\r\nu=[]\r\ncount=0\r\nfor i in t:\r\n if i not in u:\r\n u.append(i)\r\n count+=1\r\nif(count==26):\r\n print(\"YES\")\r\nelse: \r\n print(\"NO\")", "\n# Panagram\nlength = int(input())\nsentence = input()\nsentence = sentence.lower()\nsen = set()\nfor i in sentence :\n sen.add(i)\nif len(sen) > 25 :\n print(\"YES\")\nelse :\n print(\"NO\")\n \t\t\t \t \t\t\t \t\t\t\t \t\t", "n = int(input())\ns = input()\nc = 0\n\nb = sorted(s.upper())\n\nfor p in range(n-1):\n if b[p] != b[p+1]:\n c +=1\n \nif(c==25):\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", "def remove_repeated_letters(word):\n return ''.join(sorted(set(word)))\n\n\nif __name__ == \"__main__\":\n n = int(input())\n alphabet = \"abcdefghijklmnopqrstuvwxyz\"\n\n text = remove_repeated_letters(input().lower())\n\n if text == alphabet:\n print(\"YES\")\n else:\n print(\"NO\")\n\t\t\t\t\t \t\t \t\t\t \t \t \t \t \t", "t=int(input())\nstr1=input()\nsent=set()\nfor j in str1:\n if j.isalpha():\n sent.add(j.lower())\nif len(sent)==26:\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", "n = int(input())\r\ns = input()\r\nprint('YES') if len(set(s.lower()))==26 else print('NO')", "n = int(input())\r\nst = input().lower()\r\nst = list(set(st))\r\nk=0\r\nalf = \"abcdefghijklmnopqrstuvwxyz\"\r\nfor i in range(len(st)):\r\n if st[i] in alf:\r\n k+=1\r\nif k==26:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "x=['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\na=int(input())\r\ny=input().lower()\r\ny=list(set(y))\r\ncount=0\r\nfor i in x:\r\n if i not in y:\r\n print(\"NO\")\r\n break\r\n else:\r\n count=count+1\r\nif(count==26):\r\n print(\"YES\")", "def is_pangram(text):\r\n lst = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']\r\n text = text.replace(' ', '')\r\n text = text.lower()\r\n for i in lst:\r\n if i not in text:\r\n return 'NO'\r\n return 'YES'\r\nn = int(input())\r\ntext = input()\r\nprint(is_pangram(text))", "from collections import Counter\r\nn = int(input())\r\ns = input().lower()\r\ncnt = Counter(s)\r\nif len(cnt) == 26:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\r\ns = input()\r\nset_ = set()\r\nfor i in range(n):\r\n set_.add(s[i].lower())\r\nif len(set_)== 26:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n \r\n \r\n \r\n ", "n = int(input())\r\ns=input()\r\ns1=\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\ns2=s.upper()\r\nr=set(s2)\r\ng=set(s1)\r\nif r==g:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nstring = input().lower()\r\nsample = 'abcdefghijklmnopqrstuvwxyz'\r\ncheck = False\r\nfor c in sample:\r\n if string.find(c)== -1:\r\n print(\"NO\")\r\n check=True\r\n break\r\n \r\nif check==False:\r\n print(\"YES\")", "n=int(input())\r\ns=input().lower()\r\nletters=set()\r\n\r\nfor i in s:\r\n if 'a'<=i<='z' and i.isalpha():\r\n letters.add(i)\r\nif len(letters)==26:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "abc = [\n \"a\",\"b\",\"c\",\"d\",\"e\",\"f\",\"g\",\"h\",\"i\",\n \"j\",\"k\",\"l\",\"m\",\"n\",\"o\",\"p\",\"q\",\"r\",\n \"s\",\"t\",\"u\",\"v\",\"w\",\"x\",\"y\",\"z\",\n ]\n\nn = int(input())\nstring = str(input()).lower()\nresult = True\n\nfor i in abc:\n if(string.find(i) == -1):\n result = False\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", "b=int(input())\r\na=['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\nc=input()\r\nR=c.lower()\r\nd=list(R)\r\nif(set(a) == set(d) ):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "# Read input\nn = int(input())\nstring = input()\n\n# Convert the string to lowercase to simplify checking\nstring = string.lower()\n\n# Create a set to store the unique letters in the string\nletters = set()\n\n# Iterate through the string and add each letter to the set\nfor char in string:\n if char.isalpha():\n letters.add(char)\n\n# Check if there are at least 26 unique letters in the set\nif len(letters) >= 26:\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", "import sys\r\nfrom collections import Counter\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef yes():\r\n print(\"YES\")\r\n\r\n\r\ndef no():\r\n print(\"NO\")\r\n\r\n\r\ninput()\r\ns = input().rstrip().lower()\r\nd = Counter(s)\r\nflag = True\r\nfor i in range(97, 123):\r\n if not (chr(i) in d.keys()):\r\n flag = False\r\n break\r\nif flag:\r\n yes()\r\nelse:\r\n no()", "import string\nn=int(input())\nb=input().lower()\na= list(string.ascii_lowercase)\ny=set(b)\nif len(y)==len(a):\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\n\t\t \t \t \t\t\t \t \t\t \t\t\t\t\t \t\t\t", "import string\r\n\r\nwhile True:\r\n n = int(input())\r\n if 1 <= n <= 100:\r\n break\r\nline = input()\r\nline = list(line.lower().strip(\" \"))\r\n \r\nalpha = list(string.ascii_lowercase)\r\n\r\nfor i in range (0 , len(line)):\r\n if line[i] in alpha:\r\n alpha.remove(line[i])\r\n\r\nif alpha:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n=int(input())\r\nm=input()\r\nm=m.lower()\r\nl=list(m)\r\ns=set(l)\r\nif len(s)==26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input()) # Считываем количество символов\r\nstring = input().lower() # Считываем строку и приводим её к нижнему регистру\r\nalphabet = set(\"abcdefghijklmnopqrstuvwxyz\") # Создаем множество с буквами алфавита\r\n\r\n# Проходим по каждому символу строки и добавляем его в множество\r\nfor char in string:\r\n alphabet.discard(char) # Удаляем символ из множества\r\n\r\n# Если в множестве остались символы, то это не панграмма\r\nif alphabet:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n=int(input())\r\ns=input()\r\ns=s.lower()\r\nl=[]\r\nfor i in range(len(s)):\r\n l.append(s[i])\r\nl=set(l)\r\nif len(l)==26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def panagram(word):\r\n\treturn \"YES\" if len(set(word)) >= 26 else \"NO\"\r\n\r\nlength = int(input())\r\nword = input()\r\nprint(panagram([word[l].lower() for l in range(len(word))]))\r\n", "n = int(input())\ns=input()\ns=s.lower()\nif len(s)<26:\n print(\"NO\")\nelse:\n p = set(s)\n if len(p)>=26:\n print(\"YES\")\n else:\n print(\"NO\")\n\t \t\t\t\t\t\t\t \t \t\t \t\t\t\t\t \t \t\t", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Oct 4 21:12:30 2023\r\n\r\n@author: 25419\r\n\"\"\"\r\n\r\nn=int(input())\r\nstr0=input()\r\nstr0=str0.lower()\r\nset0=set(str0)\r\nl=len(set0)\r\nif l!=26:\r\n print('NO')\r\nelse:print('YES')", "al = ['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\nn = int(input())\r\ns = input().upper()\r\nfor i in s:\r\n if i in al:\r\n al.remove(i)\r\nif len(al)==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\ns = input().lower()\r\nif n >= 26:\r\n s = [s[i] for i in range(n)]\r\n s.sort()\r\n s = set(s)\r\nprint(\"YES\" if len(s) == 26 else \"NO\")", "# Read the number of characters in the string\r\nn = int(input())\r\n\r\n# Read the string\r\nstring = input()\r\n\r\n# Create a set to store unique characters\r\nunique_chars = set()\r\n\r\n# Iterate through the string and add unique characters to the set\r\nfor char in string:\r\n if char.isalpha():\r\n unique_chars.add(char.lower())\r\n\r\n# Check if the set size is equal to 26\r\nif len(unique_chars) == 26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "# Read the length of the string (not needed for this problem)\r\n_ = input()\r\n\r\n# Read the string\r\ns = input().lower() # Convert the string to lowercase for uniform comparison\r\n\r\n# Create an empty set to store unique characters\r\nunique_chars = set()\r\n\r\n# Iterate through the characters in the string\r\nfor char in s:\r\n if char.isalpha(): # Check if the character is an alphabet letter\r\n unique_chars.add(char) # Add the lowercase character to the set\r\n\r\n# Check if the set contains all 26 English alphabet letters\r\nif len(unique_chars) == 26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def pangram(s):\n uni = set()\n for char in s:\n if 'a' <= char <= 'z' or 'A' <= char <= 'Z':\n uni.add(char.lower())\n return len(uni) == 26\nn = int(input())\ns = input()\nif pangram(s):\n print(\"YES\")\nelse:\n print(\"NO\")\n \t \t \t\t \t\t \t\t\t \t\t\t\t\t \t", "n = int(input())\nif n < 26 or not set(\"abcdefghijklmnopqrstuvwxyz\").issubset(set(input().lower())):\n print(\"NO\")\nelse:\n print(\"YES\")\n \t \t\t \t \t \t \t\t \t\t\t\t \t \t \t\t", "n=int(input())\r\ns=input().lower()\r\nif n<26:\r\n print('NO')\r\nelse:\r\n s1='abcdefghijklmnopqrstuvwxyz'\r\n for i in s1:\r\n if i not in s:\r\n print('NO')\r\n break\r\n else:\r\n print('YES')", "n = int(input())\r\nletters = [chr(65 + i).lower() for i in range(26)]\r\nstring = [i.lower() for i in input()]\r\nfor i in string:\r\n if i in letters:\r\n letters.remove(i)\r\nif len(letters) == 0:\r\n print('YES')\r\nelse:\r\n print('NO')", "if __name__ == \"__main__\":\r\n num = int(input())\r\n \r\n if num < 26:\r\n print(\"NO\")\r\n else:\r\n total = len(set(input().lower()))\r\n if total == 26:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n=int(input())\r\ns=input()\r\ns1=s.lower()\r\nlet={'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','z','y'}\r\nco=0\r\nfor i in range(n):\r\n if s1[i] in let:\r\n co+=1\r\n let.remove(s1[i])\r\nif co==26 :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def solve(s):\r\n newSet=set()\r\n for char in s:\r\n if char.isalpha():\r\n newSet.add(char.lower())\r\n \r\n if len(newSet)>=26:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\nn=input()\r\ns=input()\r\nfinal = solve(s)", "n=int(input())\r\ns=input().lower()\r\nalph=\"abcdefghijklmnopqrstuvwxyz\"\r\nflag=True\r\nfor i in range(len(alph)):\r\n if alph[i] not in s:\r\n flag=False\r\n break\r\nprint(\"YES\" if flag else \"NO\")", "input()\r\nprint((\"NO\",\"YES\")[len(set(input().lower()))==26])", "import string\nn=int(input())\ns=input()[:n]\ncheck=string.ascii_lowercase\nflag=0\nfor c in check:\n if c in s.lower():\n continue\n else:\n flag=1\n break\nif(flag==1):\n print(\"NO\")\nelse:\n print(\"YES\")\n\n\n\t\t \t\t \t \t\t \t\t \t \t\t", "n=int(input())\ns=input()\ns=s.lower()\nif n<26:\n print(\"NO\")\nelse:\n k=set(s)\n if len(k)==26:\n print('YES')\n else:\n print(\"NO\")\n\t \t\t \t\t \t\t\t\t \t \t \t \t\t\t \t", "a = int(input())\r\nc = input()\r\nc = c.upper()\r\nc = set(c)\r\nif len(c) == 26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=int(input())\nb=input()\nb=b.lower()\nif a<26:\n print(\"NO\")\nelse:\n l=['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']\n for i in l:\n if i not in b:\n print(\"NO\")\n break\n else:\n print(\"YES\")\n \t \t \t\t\t \t \t\t\t\t \t\t \t \t\t\t\t", "def is_pangram(s):\n alphabet = set('abcdefghijklmnopqrstuvwxyz')\n for char in s:\n if char.lower() in alphabet:\n alphabet.remove(char.lower())\n return len(alphabet) == 0\nn = int(input())\ns = input().strip()\nresult = \"YES\" if is_pangram(s) else \"NO\"\nprint(result)\n\n\t\t\t \t \t \t\t \t \t \t\t \t\t \t\t", "import string\r\nn = int(input())\r\nstr = input()\r\nstr_unique = set(str.lower())\r\nif len(str_unique) >= len(string.ascii_lowercase):\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\r\ns = input().lower() \r\nu_l = set()\r\n\r\nfor char in s:\r\n if char.isalpha(): \r\n u_l.add(char) \r\nif len(u_l) == 26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "# Read the number of characters in the string\r\nn = int(input())\r\n\r\n# Read the string\r\ns = input()\r\n\r\n# Convert the string to lowercase and create a set of unique characters\r\nunique_chars = set(s.lower())\r\n\r\n# Check if the set contains all 26 lowercase letters of the alphabet\r\nif len(unique_chars) == 26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\nx=set(input().lower())\r\nif len(x)==26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\ntext = set(input().lower())\n\nif n < 26 or len(text) < 26:\n print(\"NO\")\nelse:\n print(\"YES\")\n", "n=int(input())\nsentence= input()\nsentence=sentence.lower()\nletters=set()\nfor i in sentence:\n letters.add(i)\nif len(letters)==26:\n print('YES')\nelse:\n print('NO')\n\n\n", "n=int(input())\r\ns=input()\r\ns=set(s.lower())\r\nif len(s)==26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import string\r\nn = int(input())\r\ns = input().lower()\r\na = string.ascii_lowercase\r\nb = []\r\nfor i in a:\r\n frequency = s.count(i)\r\n if frequency>=1:\r\n b.append(frequency)\r\n else:\r\n break\r\nif len(b)==26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "T=input()\r\nn=input().lower()\r\nA=set(n)\r\nif len(A)==26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "string_len = int(input())\nstring = input().lower()\n# If it have fewer letters than the alphabet the string is not a pangram\nif(string_len < 26):\n print(\"NO\")\nelse:\n string_set = set(string)\n\n # Generates all the letters of the alphabet\n alphabet = set()\n for letter in range(97, 123):\n alphabet.add(chr(letter))\n \n # Check the intersection between the string and alphabet sets \n if(len(alphabet.intersection(string_set)) == 26):\n print(\"YES\")\n else:\n print(\"NO\")\n\n \t\t \t\t\t \t \t \t \t\t\t\t \t \t", "n = int(input())\r\ns = input().strip().lower()\r\nss = set([ss for ss in s])\r\nif len(ss) == 26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\nv = input()[:n]\nc = set(v.lower())\nprint(\"Yes\" if len(c) >= 26 else \"No\")\n#Pangra\n \t \t\t\t\t\t \t \t\t \t \t\t\t", "\ndef is_pangram(s):\n # Create a set to store unique lowercase letters in the string\n unique_letters = set(s.lower())\n \n # Check if the set of unique letters contains all 26 letters of the alphabet\n return len(unique_letters) == 26\n\n# Read the number of characters in the string (n)\nn = int(input())\n\n# Read the input string\ninput_string = input().strip()\n\n# Check if the string is a pangram and print the result\nif is_pangram(input_string):\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", "n=int(input())\ns=input()\nuq=set(s.lower())\nif len(uq)==26:\n print(\"Yes\")\nelse:\n print(\"No\")\n \t\t \t \t \t\t\t \t\t\t \t \t\t\t", "def distinct_words():\r\n len_ = int(input())\r\n s = input().strip()\r\n s = s.lower() # Convert the string to lowercase\r\n distinct_chars = set(s)\r\n if len(distinct_chars) == 26:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\ndistinct_words()", "def main():\n n = int(input())\n s = input()\n if(n<26):\n return \"NO\"\n arr = [0 for i in range(26)]\n for i in s:\n if i.islower():\n arr[ord(i)-ord('a')]+=1\n else:\n arr[ord(i)-ord('A')]+=1\n for i in arr:\n if i==0:\n return \"NO\"\n return \"YES\"\n\nprint(main())\n \n\t \t \t \t \t \t\t\t \t\t\t \t \t", "n=int(input())\ns=input().lower()\nk=list(map(chr, range(97, 123)))\nc=0\nfor i in k:\n if i in s:\n c+=1\n if c==26:\n print(\"YES\")\n break\nelse:\n print(\"NO\")\n \t \t\t \t \t \t \t\t\t \t\t \t \t", "n = int(input())\r\n\r\nstring = input().lower()\r\n\r\nif ''.join(sorted(set(string)))=='abcdefghijklmnopqrstuvwxyz':\r\n print('YES')\r\nelse:\r\n print('NO')", "def ispangram(str):\n\talphabet = \"abcdefghijklmnopqrstuvwxyz\"\n\tstr=str.replace(\" \",\"\")\n\tfor char in alphabet:\n\t\tif char not in str.lower():\n\t\t\treturn False\n\treturn True\nn=int(input())\nstring = input()[:n]\nif(ispangram(string) == True):\n\tprint(\"Yes\")\nelse:\n\tprint(\"No\")\n \t\t\t \t\t \t\t \t \t\t\t\t \t\t \t \t", "n = int(input())\r\nline = input().lower()\r\nfor i in range(ord('a'), ord('z')+1):\r\n if chr(i) not in line:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')", "t=int(input())\r\nn=input()\r\nn=n.lower()\r\nk=set(())\r\nfor i in n:\r\n k.add(i)\r\nif(len(k)==26):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import string\ns=set(string.ascii_lowercase)\na=int(input())\nb=input().lower()\nif set(b)>=s:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t\t \t \t \t \t\t \t \t\t\t\t", "n = int(input())\r\nstring = input()\r\n\r\nunique_chars = set(string.lower())\r\n\r\nif len(unique_chars) == 26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\ns = input()\r\ns = s.lower()\r\nflag = 0\r\nalphabet_set = set(\"abcdefghijklmnopqrstuvwxyz\") \r\nfor i in s:\r\n alphabet_set.discard(i)\r\n if not alphabet_set:\r\n print(\"YES\")\r\n break\r\nif alphabet_set:\r\n print(\"NO\")\r\n", "def pangram(s):\n char_set=set()\n for ch in s:\n if ch>='a' and ch<='z':\n char_set.add(ch)\n if ch>='A' and ch<='Z':\n ch=ch.lower()\n char_set.add(ch)\n return len(char_set)==26\nn=int(input()) \ns=input()\nif pangram(s)==True:\n print(\"Yes\")\nelse:\n print(\"No\")\n \n#rt\n \t\t \t \t \t\t \t\t \t\t\t\t \t\t\t", "def is_pangram(s):\r\n alphabet = set('abcdefghijklmnopqrstuvwxyz')\r\n s = s.lower() \r\n for char in s:\r\n if char.isalpha():\r\n alphabet.discard(char)\r\n if not alphabet:\r\n return \"YES\" \r\n return \"NO\"\r\n\r\nn = int(input())\r\nstring = input()\r\nprint(is_pangram(string))\r\n", "n = int(input())\r\npang = input().lower()\r\nalphabet = 'abcdefghijklmnopqrstuvwxyz'\r\ncount = 0\r\n#check if the character in pang is all in alphabet \r\nfor char in alphabet:\r\n if char not in pang:\r\n count+=1 \r\nif count >0 :\r\n print('NO')\r\nelse:\r\n print('YES')", "size=int(input())\r\nword=input()\r\nword=word.lower()\r\narr=set()\r\nfor i in word:\r\n if i.isalpha(): \r\n arr.add(i)\r\nif len(arr) == 26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "size = int(input())\na = input().lower()\nlst = []\nif len(a) != size or len(a)<26:\n print('No')\nelse:\n for i in a:\n if ord(i) in lst:\n continue\n else:\n lst.append(ord(i))\n lst.sort()\n if sum(lst) == 2847:\n print('Yes')\n else:\n print('No')\n\t \t \t\t\t \t \t\t\t\t \t\t\t \t\t\t\t\t\t", "n=int(input(\"\"))\r\ns=input(\"\")\r\ns=s.lower()\r\n\r\n\r\nL=[]\r\nfor j in s:\r\n if(j not in L):\r\n L.append(j)\r\n \r\nif(len(L)==26):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "n=int(input())\r\na,s=str(input()).lower(),set()\r\nfor i in a:\r\n s.add(i)\r\nif len(s)==26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "c = 'abcdefghijklmnopqrstuvwxyz'\r\nn = int(input())\r\na = input().lower()\r\nif n<26:\r\n print(\"NO\")\r\nelse:\r\n k = -1\r\n v = 0\r\n while(k<len(a)):\r\n k+=1\r\n if len(a) > 0:\r\n if a[k] in c:\r\n c = c.replace(a[k], '')\r\n v+=1\r\n a = a.replace(a[k], '')\r\n k = -1\r\n if v == 26:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "import string\r\n\r\nn=int(input())\r\ns=input()\r\ns1=s.lower()\r\ns2=list(s1)\r\nlower1=string.ascii_lowercase\r\nlowerlist=list(lower1)\r\nflag=0\r\n\r\nfor i in lowerlist:\r\n if(i not in s2 ):\r\n flag=1\r\n print(\"NO\")\r\n break\r\nif(flag==0):\r\n print(\"YES\")\r\n ", "n = int(input())\r\ns= input().lower()\r\nun=set()\r\nfor char in s:\r\n if char.isalpha():\r\n un.add(char)\r\nif len(un)==26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import string\r\n\r\n\r\nn = input()\r\nvalue = input().lower()\r\n\r\nresult = True\r\nfor current in string.ascii_lowercase:\r\n if value.count(current) == 0:\r\n result = False\r\n break\r\nif result:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\ns = input()\r\ns = list(s.lower())\r\n\r\nst = set(s)\r\n\r\nif len(st) == 26:\r\n print('YES')\r\nelse:\r\n print('NO')", "n=int(input())\na=input().lower()\nd=set(a)\nif len(d)>=26:\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", "import sys\r\ninput= sys.stdin.readline\r\n\r\ngi= lambda: list(map(int, input().split()))\r\ngs= lambda: list(input().split())\r\nt=int(input()) # Number of test cases\r\nstring=input().lower()\r\n\r\na=[]\r\nfor i in range(26):\r\n if chr(ord(\"a\")+i) in string:\r\n a.append(1)\r\nif sum(a)==26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\ns = input().lower()\r\nap = \"abcdefghijklmnopqrstuvwxyz\"\r\n\r\nif(len(set(s)) == len(ap)):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "input()\r\ns=input()\r\na=\"abcdefghijklmnopqrstuvwxyz\"\r\nb=\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\nf=0\r\nfor i in range(26):\r\n if s.count(a[i])==0 and s.count(b[i])==0:\r\n f+=1\r\n break;\r\nif f==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\ns=input()\nif n<26:\n print('NO')\nelse:\n d={}\n for i in 'abcdefghijklmnopqrstuvwxyz':\n d[i]=0\n for i in s:\n t=i.lower()\n if t in d:\n d[t]+=1\n f=1\n for i in d:\n if d[i]==0:\n f=0\n break\n if f:\n print('YES')\n else:\n print('NO')\n\n\t \t \t\t\t \t \t\t\t \t\t \t\t \t\t", "n = int(input())\r\ny = input().lower()\r\nstring = set()\r\nfor char in y:\r\n if 'a' <= char <= 'z':\r\n string.add(char)\r\nif len(string) == 26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "alphabet = ''.join(map(chr, range(97, 123)))\nn=int(input())\nm=input()[:n].lower()\nc=0\nfor i in alphabet:\n if i in m:\n c+=1\n\nif c==26:\n print(\"Yes\")\nelse:\n print(\"NO\")\n\t\t\t\t \t \t\t \t \t \t \t \t\t", "def solve(str, n):\n if n < 26:\n return \"NO\"\n d = set()\n for c in str:\n c = c.upper()\n if c not in d:\n d.add(c)\n if len(d) == 26:\n return \"YES\"\n return \"NO\"\n\ndef main():\n n = int(input())\n s = input()\n res = solve(s, n)\n print(res)\n\nmain()\n\t\t\t \t\t\t \t\t \t\t\t \t\t \t", "n=int(input())\r\ns=input().lower()\r\nx=set(s)\r\nif len(x)==26:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "n = int(input())\n\nw = input()\nletters_count = 0\nletter_map = {}\n\nfor letter in w:\n letter = letter.lower()\n if letter not in letter_map:\n letter_map[letter] = True\n letters_count += 1\n\nif letters_count >= 26:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t\t \t\t \t \t\t\t\t \t \t \t \t\t\t", "n = int(input())\r\nword = input().lower()\r\n\r\nalpha = \"abcdefghijklmnopqrstuvwxyz\"\r\n\r\nnew_word = set(word)\r\n\r\n \r\nif len(new_word) == len(alpha):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=int(input())\na=input()\na=a.lower()\ni=set(a)\nif len(i)<26:\n print(\"NO\")\nelse:\n print(\"YES\")\n \t \t\t \t \t\t\t \t\t \t \t \t\t", "n=int(input())\r\ns=input().lower()\r\nletter=set(s)\r\nif len(letter)==26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\na=input().lower()\r\n\r\nb=set()\r\n\r\nfor i in a:\r\n if 'a'<= i <='z':\r\n b.add(i)\r\n \r\nif len(b)==26:\r\n print('YES')\r\nelse:\r\n print('NO')", "def solution(s):\n s = s.lower()\n abc = 'abcdefghijklmnopqrstuvwxyz'\n \n for l in abc:\n if l not in s:\n return 'NO'\n return 'YES'\n\n\n\nif __name__ == '__main__':\n n = int(input())\n s = input()\n print(solution(s))\n \t\t\t \t \t\t\t \t \t\t\t \t\t\t", "# your code goes here\nn=int(input())\ns=input().lower()\nk=\"\"\nc=0\nfor i in s:\n\tif i not in k:\n\t\tk+=i\n\t\tc+=1\nif c==26:\n\tprint('YES')\nelse:\n\tprint(\"NO\")\n\t\n\t\n\t\n\t\t \t\t\t\t\t \t\t \t \t \t\t\t\t\t \t\t\t", "n = int(input())\ns = input()\ns=s.lower()\nflag=1\nalphabet = \"abcdefghijklmnopqrstuvwxyz\"\nfor char in alphabet:\n if (char not in s):\n flag=0\nif flag==1:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\t \t \t \t \t\t\t \t\t\t \t\t\t\t \t\t \t \t\t", "a=int(input())\r\ne=True\r\nc=[0]*123\r\nif a<26:\r\n print(\"NO\")\r\n e=False\r\nelse:\r\n q=input()\r\n for i in q:\r\n c[ord(i)]=1\r\n for i in range(65,91):\r\n if c[i]+c[i+32]==0:\r\n print(\"NO\")\r\n e=False\r\n break\r\nif e:\r\n print(\"YES\")", "n = int(input())\r\nstr = input()\r\nx = str.upper()\r\nz = ''.join(sorted(x))\r\nz = set(list(z))\r\nif len(z) == 26 :\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n", "c=int(input())\r\nn=input()\r\nif len(set(n.lower()))==26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\nS=input()[:n]\nS=S.lower()\nse=set()\nfor i in S:\n se.add(i)\nif len(se)==26:\n print(\"Yes\")\nelse:\n print(\"No\")\n \t \t \t\t\t\t \t \t \t \t \t", "input()\r\n\r\nprint(\"YES\") if len(set(str(input().casefold()))) >= 26 else print(\"NO\")\r\n\r\n", "n=int(input())\r\na=input()\r\nif n<26:\r\n\tprint(\"NO\")\r\nelse:\r\n\ta=a.lower()\r\n\ts=set(a)\r\n\tif len(s)==26:\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")", "amount = int(input())\r\nword = input()\r\nalphabet = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'\r\nword = word.upper()\r\nans = set(word)\r\nx=0\r\n\r\nfor i in ans:\r\n if i in alphabet:\r\n x+=1\r\nif x == 26:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n\r\n", "def pangram(s1):\r\n ab='abcdefghijklmnopqrstuvwxyz'\r\n for i in ab:\r\n if i not in s1.lower():\r\n return(False)\r\n return(True)\r\n \r\nn=int(input())\r\ns1=input()\r\nif(pangram(s1)==True):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def count_unique_alphabets(string):\r\n # Convert the string to lowercase to make it case-insensitive\r\n string = string.lower()\r\n\r\n unique_chars = set()\r\n\r\n for char in string:\r\n if char.isalpha():\r\n unique_chars.add(char)\r\n\r\n return len(unique_chars)\r\n\r\n\r\nnum=int(input())\r\nword=input()\r\nalphabet=\"qwertyuiopasdfghjklzxcvbnm\"\r\nword1=word.lower()\r\nsize=count_unique_alphabets(word1)\r\ncnt=0\r\nif num<26:\r\n print(\"NO\")\r\n\r\nelif size<26 :\r\n print(\"NO\")\r\nelse:\r\n for i in word1:\r\n if i in alphabet:\r\n cnt+=1\r\n else:\r\n print(\"NO\")\r\n break\r\n\r\nif len(word1) == cnt:\r\n print(\"YES\")\r\n\r\n\r\n", "#L\nn = int(input())\nstring = input().lower()\nletters = set(string) \nalphabet = set('abcdefghijklmnopqrstuvwxyz') \nif len(letters.intersection(alphabet)) == 26:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t \t \t\t \t\t \t\t\t\t \t\t\t \t \t\t", "n = int(input())\r\nl = list(input().lower())\r\ns = set(l)\r\nif(len(s) == 26):\r\n print(\"YES\")\r\n \r\nelse:\r\n print(\"NO\")", "n = int(input())\r\n\r\n\r\ns = input().lower() \r\n\r\n\r\nletters = set()\r\n\r\n\r\nfor char in s:\r\n if 'a' <= char <= 'z':\r\n letters.add(char)\r\n\r\n\r\nif len(letters) == 26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\ns=input()\nif n<26:\n print(\"NO\")\nelse:\n x=s.upper()\n s=set(x)\n v=len(s)\n if v==26:\n print(\"YES\")\n else:\n print(\"NO\")\n \t\t \t\t\t\t \t \t \t \t\t \t", "n = int(input())\ninput_string = input().lower()\nunique_letters = set()\n\nfor char in input_string:\n if 'a' <= char <= 'z':\n unique_letters.add(char)\nif len(unique_letters) == 26:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t\t \t\t\t \t\t\t\t \t\t\t \t \t\t", "def is_pangram(sentence: str) -> bool:\r\n alphabets = [chr(num) for num in range(97, 123)]\r\n verdict = None\r\n for char in alphabets:\r\n if char in sentence.lower():\r\n verdict = True\r\n else:\r\n verdict = False\r\n break\r\n return verdict\r\nn = int(input())\r\nstring = input()\r\n \r\nif is_pangram(string):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\ns = input().lower()\r\nk = 0\r\nfor i in 'abcdefghijklmnopqrstuvwxyz':\r\n if s.count(i) != 0:\r\n k += 1\r\nif k == 26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\na=input().lower()\r\na=set(a)\r\nprint('YES' if len(a) == 26 else 'NO')", "n = int(input())\nword = set(input().upper())\nprint(\"YES\" if len(word) == 26 else \"NO\")\n\t \t\t \t\t \t \t\t\t \t\t \t\t \t\t\t \t", "n = int(input())\r\ns = input().lower()\r\nans = [0] * 26\r\nfor i in s:\r\n ans[ord(i)-97] = 1\r\nif 0 in ans:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "def is_pangram(string):\r\n alphabet = set(\"abcdefghijklmnopqrstuvwxyz\")\r\n lowercase_string = string.lower()\r\n return set(lowercase_string) >= alphabet\r\n\r\nn = int(input())\r\nstring = input()\r\n\r\nif is_pangram(string):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\na=input()\r\nx=a.lower()\r\nm=set(x)\r\nif len(m)==26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\ns = input()\r\ns = s.lower()\r\nse = set(s)\r\nif len(se) == 26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# Read input\r\nn = int(input())\r\ninput_string = input().strip()\r\n\r\n# Create a set to store unique lowercase letters\r\nletters_set = set()\r\n\r\n# Iterate through the characters of the string\r\nfor char in input_string:\r\n if 'a' <= char <= 'z':\r\n letters_set.add(char)\r\n elif 'A' <= char <= 'Z':\r\n # Convert uppercase letter to lowercase and add to the set\r\n letters_set.add(chr(ord(char) - ord('A') + ord('a')))\r\n\r\n# Check if the size of the set is 26 (all alphabet letters are present)\r\nif len(letters_set) == 26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\ns = input().lower() \nunique = set()\n\n\nfor char in s:\n if char.isalpha(): \n unique.add(char)\nif len(unique) == 26:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t \t \t\t\t\t \t \t \t \t \t", "num = int(input())\r\nUser = str(input())\r\nUser_low = User.lower()\r\nUsers = set(User_low)\r\ncount = 0\r\n\r\nfor x in Users:\r\n count = count + 1\r\n \r\nif count == 26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\ns=input().lower()\nc=set()\nfor i in s:\n if i.isalpha():\n c.add(i)\nif len(c)==26:\n print(\"Yes\")\nelse:\n print(\"No\")\n \t\t\t\t \t\t\t \t \t\t\t \t\t \t", "alpha = 'abcdefghijklmnopqrstuvwxyz'\nn = int(input())\ns = input()\nflag = 1\nfor i in alpha:\n if i not in s.lower():\n flag = 0\n print(\"NO\")\n break\nif flag == 1:\n print(\"YES\")\n \t\t \t\t\t\t \t\t \t\t\t\t\t\t\t\t \t \t", "n=int(input())\ns=input()\nif(n<26):\n\tprint(\"No\")\nelse:\n\ts=s.upper()\n\ts=set(s)\n\tif(len(s)==26):\n\t\tprint(\"Yes\")\n\telse:\n\t\tprint(\"No\")\n\n \t \t \t \t\t\t \t\t\t\t\t \t", "def is_pangram(input_string):\r\n # Create a set to store the lowercase letters encountered in the input\r\n alphabet_set = set()\r\n\r\n # Convert the input string to lowercase for case-insensitive comparison\r\n input_string = input_string.lower()\r\n\r\n # Iterate through each character in the input string\r\n for char in input_string:\r\n # Check if the character is a lowercase letter\r\n if 'a' <= char <= 'z':\r\n alphabet_set.add(char)\r\n\r\n # Check if the set contains all 26 lowercase letters of the alphabet\r\n return len(alphabet_set) == 26\r\n\r\n# Read the input\r\nn = int(input())\r\ninput_string = input()\r\n\r\n# Check if it's a pangram and print the result\r\nif is_pangram(input_string):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\ns=input().lower()\nif n>=26:\n s=set(s)\n c=0\n for i in s:\n if i.isalpha():\n c+=1\n else:\n pass\n if c==26:\n print(\"YES\")\n else:\n print(\"NO\")\nelse:\n print(\"NO\")\n \t \t\t \t\t \t\t \t \t\t\t\t \t\t \t\t \t", "n1 = int(input())\r\nstr1 = input()\r\nmylist = [0] * 26\r\n\r\nfor x in str1:\r\n if x.isupper():\r\n x = x.lower()\r\n if 'a' <= x <= 'z':\r\n mylist[ord(x) - ord('a')] += 1\r\n\r\nres = all(count > 0 for count in mylist)\r\n\r\nif res:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\ns = input().lower() # Convert the input string to lowercase\r\n\r\n# Initialize a set to store the unique letters in the string\r\nunique_letters = set()\r\n\r\n# Iterate through the string and add unique lowercase letters to the set\r\nfor char in s:\r\n if 'a' <= char <= 'z':\r\n unique_letters.add(char)\r\n\r\n# Check if the set contains all 26 letters of the Latin alphabet\r\nif len(unique_letters) == 26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\nset_st = {el.lower() for el in input()}\r\nset_alp = {chr(el) for el in range(ord('a'), ord('z') + 1)}\r\nset_ans = set_alp - set_st\r\nif set_ans:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "def is_pangram(s):\r\n return set('abcdefghijklmnopqrstuvwxyz') <= set(s.lower())\r\nn = int(input())\r\ns = input()\r\nif is_pangram(s):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "# Read the length of the string\r\nn = int(input())\r\n\r\n# Read the string\r\ns = input().lower()\r\n\r\n# Create a set of characters from the string\r\nchar_set = set(s)\r\n\r\n# Check if the set contains all lowercase letters\r\nif len(char_set) == 26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import string\r\n\r\nn=int(input())\r\nword=input().lower()\r\n\r\ndef hasAll(word):\r\n alphabet=set(string.ascii_lowercase)\r\n return alphabet.issubset(word)\r\nif hasAll(word):\r\n print('YES')\r\nelse:\r\n print('NO')", "uniq = []\r\nlength = int(input())\r\nwords = (input())\r\nword = list(words.lower())\r\nfor x in word:\r\n if x not in uniq:\r\n uniq.append(x)\r\nif len(uniq) == 26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\nstring = input()\nflag = \"YES\"\nstring = string.upper()\nfor i in range(65,91):\n if chr(i) not in list(string):\n flag = \"NO\"\nprint(flag)\n\n\t\t\t\t\t\t\t\t\t \t\t\t\t \t\t \t\t \t\t \t \t\t", "lenth = int(input())\r\ns = input()\r\nis_pangram = set('abcdefghijklmnopqrstuvwxyz') - set(s.lower())\r\nif not(is_pangram):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\ninput_string = input().lower() # Convert the input string to lowercase for case-insensitive comparison\r\n\r\nalphabet = \"abcdefghijklmnopqrstuvwxyz\"\r\n\r\n# Create a set of letters from the input string to efficiently check for their presence\r\nletters_in_string = set(input_string)\r\n\r\n# Check if all letters in the alphabet are in the set of letters from the input string\r\nif all(letter in letters_in_string for letter in alphabet):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a=input()\r\nif set('abcdefghijklmnopqrstuvwxyz').issubset(input().lower()):\r\n print('YES' )\r\nelse:print(\"NO\")", "n = int(input())\r\ns = input()\r\nk = 26\r\nif n < 26:\r\n print(\"NO\")\r\nelse:\r\n c = dict()\r\n s = s.upper()\r\n for i in range(65, 91):\r\n c[chr(i)] = False\r\n for i in range(n):\r\n if c[s[i]] == False:\r\n k -= 1\r\n c[s[i]] = True\r\n if k == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "caracteres = int(input())\nstring = input().lower()\naux = 97\n\nlista = []\n\nfor i in range(26):\n lista.append(0)\n\nfor i in range(caracteres):\n lista[ord(string[i])-aux] += 1\n\nfor i in lista:\n if i == 0:\n print('NO')\n break\nelse:\n print('YES')\n\t \t \t\t\t\t\t\t\t\t\t\t \t\t\t", "k=int(input())\r\nw=input()\r\nw=w.lower()\r\n#lis=list(map(int,input().split()))\r\nj=[0]*26\r\n#print(w)\r\nfor i in range(len(w)):\r\n\tj[ord(w[i])-97]+=1\r\np=0\r\nfor i in j:\r\n\tif i==0:\r\n\t\tp+=1\r\n#print(j)\r\nif p!=0:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")", "n=int(input())\ns=input().lower()\nl=set(s)\nc=0\nfor i in l:\n if i.isalpha():\n c+=1\nif c==26:\n print(\"YES\")\nelse:\n print(\"NO\")\n \n\t \t \t\t \t \t \t \t\t\t \t \t \t\t\t", "x=int(input())\r\ny=input().lower()\r\ns=sorted(list(set(y)))\r\nc=0\r\nfor i in s:\r\n if i in \"abcdefghijklmnopqrstuvwxyz\":\r\n c=c+1\r\nif(c>=26):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\ns = input().lower() \r\nletters_set = set()\r\nfor char in s:\r\n if char.isalpha(): \r\n letters_set.add(char)\r\nif len(letters_set) == 26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\ns=input()\nl=set()\nfor i in s:\n if i.isalpha():\n l.add(i.lower())\n\nif len(l) == 26:\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", "def verificaPangram(entrada):\n listEntrada = list(entrada.lower())\n letrasAlfabeto = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', \n 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v',\n 'w', 'x', 'y', 'z']\n for i in listEntrada:\n if(i in letrasAlfabeto):\n letrasAlfabeto.remove(i)\n \n if(not letrasAlfabeto):\n return True\n\n return False\n\ndef main():\n n = int(input())\n entrada = input()\n\n if(verificaPangram(entrada)):\n print(\"YES\")\n else:\n print(\"NO\")\n\nmain()\n\t\t \t\t \t \t\t \t\t\t \t\t \t\t \t\t\t \t\t", "n = int(input())\r\ns = input().lower()\r\n\r\nif n >= 26 and len(set(s)) >= 26:\r\n print('yes'.upper())\r\nelse:\r\n print(\"no\".upper())", "# Name: A. Pangram\r\n# Link: https://codeforces.com/contest/520/problem/A\r\n\r\n\r\nnum_of_chars = int(input())\r\n\r\nword = input()\r\n\r\n\r\nif (num_of_chars < 26):\r\n print(\"NO\")\r\n exit()\r\n\r\nchars = set()\r\n\r\nfor idx in range(num_of_chars):\r\n char = word[idx]\r\n l = char.lower()\r\n chars.add(l)\r\n\r\n\r\nif (len(chars) >= 26):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import string\r\nlen = int(input())\r\nstr = input()\r\nstr = str.lower()\r\nalphabet = list(string.ascii_lowercase)\r\ncount = 0\r\n# print(alphabet)\r\nfor i in str:\r\n # print(i)\r\n if i in alphabet:\r\n alphabet.remove(i)\r\n # print(alphabet)\r\n# print(alphabet)\r\nif alphabet == []:\r\n print('YES')\r\nelse:\r\n print('NO')", "import sys\n\ninput = sys.stdin.readline\n\nn = int(input())\nstring = list(input())\nstring.pop() # Removing newline character\n\nstr_dict = {}\n\nfor i, s in enumerate(string):\n str_dict[s.lower()] = i\n if len(str_dict) == 26:\n break\n\nif len(str_dict) == 26:\n sys.stdout.write(\"YES\")\n\nelse:\n sys.stdout.write(\"NO\")\n", "n=int(input())\ns=input()\nif n<26:\n print(\"NO\")\nelse:\n s=s.lower()\n hashArr=[0]*27\n for i in range(len(s)):\n hashArr[ord(s[i])-ord('a')+1]+=1\n if 0 not in hashArr[1:]:\n print(\"YES\")\n else:\n print(\"NO\")\n \n \t \t \t\t\t\t\t\t\t\t \t\t\t \t\t\t\t \t \t", "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\n\r\n\r\ndef main():\r\n n = I()\r\n s = SI().lower()\r\n if len(set(s)) == 26:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\nif __name__ == \"__main__\":\r\n main()", "def pangram(s):\r\n check=\"abcdefghijklmnopqrstuvwxyz\"\r\n st=s.lower()\r\n for i in check:\r\n if i not in st:\r\n return False\r\n return True\r\nn=int(input())\r\ns=input()\r\nif pangram(s)==True:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "size = int(input())\ntext = input()\nif(size<26): print(\"NO\")\nelse:\n text = text.lower()\n letters = []\n for i in text:\n if(i not in letters): letters.append(i)\n if(len(letters)==26): print(\"YES\")\n else: print(\"NO\")\n\t \t \t \t \t\t \t\t \t\t\t\t \t\t \t\t\t\t", "n = int(input())\r\ns = input().lower()\r\nprint('YES' if len(set(s)) == 26 else 'NO')\r\n", "n=input()\ns=input()\ns=s.strip()\ns=s.replace(\" \",\"\")\ns=s.lower()\ns1=set(s)\nif len(s1)==26:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t \t \t\t \t\t\t \t\t \t\t\t \t \t \t \t", "def verifica(frase):\n aux='abcdefghijklmnopqrstuvwxyz'\n for i in aux:\n if i not in frase:\n print('NO')\n return\n print('YES')\n return\n\ndef main():\n len=int(input())\n frase=input().lower()\n if len <26: print('NO')\n else:\n verifica(frase)\n\nmain()\n \t \t \t \t \t\t\t \t\t\t\t\t\t\t \t\t\t\t", "n=int(input())\r\nx=input()\r\nx=x.lower()\r\nl=[]\r\nfor i in range(len(x)):\r\n if x[i] not in l:\r\n l.append(x[i])\r\nif(len(l)==26):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\ns = input().lower()\r\n\r\n# Create a set of unique characters in the string\r\nunique_chars = set(s)\r\n\r\n# Check if the size of the set is 26 (all letters are present)\r\nif len(unique_chars) == 26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\ninput_string = input().replace(\" \", \"\")\n\nunique_characters = set(input_string.lower())\n\nif len(unique_characters) == 26:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n \t \t\t \t \t\t \t\t \t \t\t\t \t \t\t", "# Pangram\r\n\r\nalfabeto = 'qwertyuiopasdfghjklzxcvbnm'\r\ninput()\r\ns = input().lower()\r\n\r\nfor letra in alfabeto:\r\n if letra not in s:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')\r\n", "def is_pangram(s):\r\n alphabet = set(\"abcdefghijklmnopqrstuvwxyz\")\r\n s_lower = s.lower()\r\n \r\n for char in s_lower:\r\n if char in alphabet:\r\n alphabet.remove(char)\r\n \r\n return len(alphabet) == 0\r\n\r\n\r\nn = int(input())\r\ns = input()\r\n\r\n\r\nif is_pangram(s):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "def main():\n n = int(input())\n string = input().strip().upper()\n character = 'A'\n\n # for i in range(n):\n # string = string[:i] + string[i].upper() + string[i + 1:]\n\n if n >= 26:\n for i in range(26):\n if character in string:\n character = chr(ord(character) + 1)\n else:\n print(\"NO\")\n return\n print(\"YES\")\n else:\n print(\"NO\")\n\nmain()\n\n \t \t\t \t \t\t \t\t\t\t \t\t \t \t", "def divided(a, b):\r\n if a % b == 0:\r\n return 0\r\n elif a / b < 1:\r\n return b - a\r\n ans = round((1 - ((a / b) - (a // b))) * b)\r\n return ans\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n #a = list(map(int, input().split()))\r\n s = str(input())\r\n s = s.upper()\r\n a = set(list(s))\r\n print(\"YES\" if len(a) == 26 else \"NO\")", "n = int(input())\r\ns = input()\r\ns = s.lower()\r\nchars = []\r\nfor i in s:\r\n if i.isalpha():\r\n if i not in chars:\r\n chars.append(i)\r\nif len(chars) == 26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\nq=input()\r\ns=q.lower()\r\nb=[]\r\na=list(map(''.join, zip(*[iter(s)]*1)))\r\nt='abcdefghijklmnopqrstuvwxyz'\r\nfor i in a:\r\n if i in t and i not in b:\r\n b.append(i)\r\nif len(b)==26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "case_num = int(input())\r\nstring = input().lower()\r\nalphabets = \"abcdefghijklmnopqrstuvwxyz\"\r\nis_pangram = True\r\n\r\nfor char in alphabets:\r\n if char not in string:\r\n print(\"NO\")\r\n is_pangram = False\r\n break\r\n\r\nif is_pangram:\r\n print(\"YES\")", "# your code goes here\nn=int(input())\ns=input()\nif n<26:\n\tprint(\"NO\")\nelse:\n x=s.upper()\n #print(x)\n s=set(x)\n v=len(s)\n if v==26:\n\t\t print(\"YES\")\n else:\n\t \tprint(\"NO\")\n \t \t\t\t\t\t\t \t\t\t\t \t \t \t \t\t \t \t", "n = int(input())\nstring = input().lower()\nalfabeto = {}\nfor i in range(n):\n alfabeto[string[i]] = True\n\ncounter = 0\nfor letra in alfabeto.values():\n if letra:\n counter+=1\nif counter == 26:\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", "a=[\"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\nn=int(input())\r\nk=str(input())\r\nk=k.casefold()\r\np=1\r\n\r\nfor i in a:\r\n if i not in k:\r\n p=0\r\nif p==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "p=int(input())\nn=input()\nk=n.lower()\nif len(set(k))==26:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t\t \t \t \t \t\t \t \t \t\t \t", "wordLength=int(input())\r\nword=input().upper()\r\n\r\n\r\n\r\nif wordLength<26:\r\n print('NO')\r\nelse:\r\n char= 65\r\n while True:\r\n if word.__contains__(chr(char)) and char < 92:\r\n char+=1\r\n continue\r\n elif char == 91:\r\n print('YES')\r\n break\r\n else:\r\n print('NO')\r\n\r\n break\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n", "import string\nalphabet = list(string.ascii_lowercase)\nn=int(input())\na=input().lower()\nu=set(a)\nl=len(u)\nl1=len(alphabet)\nif l==l1:\n print(\"Yes\")\nelse:\n print(\"No\")\n \t\t\t\t\t\t \t \t \t \t\t\t \t\t\t\t", "n = int(input())\r\nans = True\r\ns = input()\r\nfor i in range(ord('a'), ord('z') + 1):\r\n if chr(i) not in s and chr(i).upper() not in s:\r\n ans = False\r\nif ans:\r\n print('YES')\r\nelse:\r\n print(\"NO\")", "import string\n\ndef main():\n\n allLetters = set(string.ascii_lowercase)\n\n total = int(input())\n text = set(input().lower())\n\n if(total > 25):\n if(text >= allLetters):\n print(\"YES\")\n return\n \n print(\"NO\")\n\nmain()\n \t\t\t\t\t\t \t \t\t \t \t\t\t \t \t\t \t", "from string import ascii_lowercase as l\r\ndef panagram(s):\r\n return set(l)-set(s.lower())==set([])\r\nn=int(input())\r\ns=input()\r\nif (panagram(s)==True):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def pangram(s):\r\n alpha = []\r\n s = s.lower()\r\n for i in s:\r\n if 'a' <= i <= 'z' and i not in alpha:\r\n alpha.append(i)\r\n \r\n x = len(alpha)\r\n if x == 26:\r\n print('YES')\r\n else:\r\n print('NO')\r\n \r\n\r\nn = int(input())\r\ns = input()\r\nresult = pangram(s)\r\n", "n = int(input()) # Read the number of characters in the string\r\nstring = input() # Read the string\r\n\r\n# Create a set of lowercase letters of the alphabet\r\nalphabet_set = set(\"abcdefghijklmnopqrstuvwxyz\")\r\n\r\n# Convert the string to lowercase and remove any non-alphabet characters\r\nlowercase_string = ''.join(c.lower() for c in string if c.isalpha())\r\n\r\n# Check if the set of lowercase letters is a subset of the characters in the string\r\nif set(lowercase_string) >= alphabet_set:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\nstr = input().lower()\r\n\r\narr = [0 for i in range(26)]\r\n\r\nfor c in str:\r\n arr[ord(c)-ord('a')] = 1\r\nisPan = 'YES'\r\nfor el in arr:\r\n if el == 0:\r\n isPan = 'NO'\r\n break\r\nprint(isPan)\r\n\r\n", "import string\r\nn = int(input())\r\ns = input()\r\ns = s.lower()\r\n[ print('YES') if set(s) >= set(string.ascii_lowercase) else print('NO') ]\r\n", "n = int (input())\ns = input()\ns = s.lower()\nl = len(set(s))\nprint (\"Yes\") if l == 26 else print (\"No\")\n\n\n \t\t \t\t\t\t \t \t \t\t \t\t\t \t", "def main():\r\n alphabets = [chr(i) for i in range(ord('a'), ord('z')+1)] + [chr(i) for i in range(ord('A'), ord('Z')+1)]\r\n n = int(input())\r\n str1 = str(input())\r\n if len(str1) == n:\r\n i = 0\r\n count = 0\r\n while i < len(str1):\r\n p = 0\r\n while p < len(alphabets):\r\n if str1[i] == alphabets[p]:\r\n count += 1\r\n if p < (len(alphabets)/2):\r\n alphabets.pop(p)\r\n alphabets.pop(p+int(len(alphabets)/2))\r\n elif p >= (len(alphabets)/2):\r\n alphabets.pop(p)\r\n alphabets.pop(p-int(len(alphabets)/2)-1)\r\n p += 1\r\n if len(alphabets) == 0:\r\n return \"YES\"\r\n p = 0\r\n i += 1\r\n if count == 26:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\nprint(main())\r\n", "a=int(input())\r\nb=input()\r\nf = b.upper()\r\nv=set(f)\r\np=0\r\nfor i in v:\r\n p+=ord(i)\r\nif p==2015:\r\n print('YES')\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\ns = input()\r\ns = s.lower()\r\ns = [i for i in s]\r\nif len(set(s)) == 26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\ns=input().lower()[:n]\ns=set(s)\ncount =0\nfor i in s:\n if i.isalpha():\n count=count+1\n\nif count==26:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t \t\t \t \t\t\t\t \t \t \t\t\t", "def is_pangram(s):\n alphabet = set(\"abcdefghijklmnopqrstuvwxyz\")\n\n s = ''.join(filter(str.isalpha, s)).lower()\n\n return set(s) == alphabet\n\nif __name__ == \"__main__\":\n n = int(input())\n s = input()\n \n if is_pangram(s):\n print(\"YES\")\n else:\n print(\"NO\")\n\n \t\t \t \t \t\t \t \t\t\t\t\t \t\t \t", "def is_pangram(s):\n \n unique_letters = set(s.lower())\n \n \n return len(unique_letters) == 26\n\nn = int(input())\n\ninput_string = input().strip()\n\n\nif is_pangram(input_string):\n print(\"YES\")\nelse:\n print(\"NO\")\n \t\t \t\t \t \t \t \t\t\t \t\t \t\t \t", "num=int(input())\r\nn=input().lower()\r\nl=set(n)\r\nif(len(l)==26):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "n=int(input())\r\ns=input()\r\na=set(\"abcdefghijklmnopqrstuvwxyz\")\r\ns=s.lower()\r\nfor i in s:\r\n if i in a:\r\n a.remove(i)\r\nif len(a)==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def is_pangram(s):\n alphabet = set('abcdefghijklmnopqrstuvwxyz')\n for char in s:\n if char.lower() in alphabet:\n alphabet.remove(char.lower())\n if not alphabet:\n return True\n return False\n\nn = int(input())\nstring = input().strip()\n\nif is_pangram(string):\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", "x = input()\r\na = input().lower()\r\ntähestik = \"abcdefghijklmnopqrstuvwxyz\"\r\nvastus = \"YES\"\r\n\r\nfor i in tähestik:\r\n if i not in a:\r\n vastus = \"NO\"\r\n break\r\n\r\n\r\n\r\nprint(vastus)", "n = int(input())\ns = input()\n\nD = 'A'\nd = 'a'\nwhile (True):\n if d in s or D in s:\n if D == 'Z': \n break\n D = chr(ord(D) + 1)\n d = chr(ord(d) + 1)\n else:\n print(\"NO\")\n exit(0)\n \n \nprint(\"YES\")\n \t \t\t \t \t\t \t \t\t \t \t\t \t\t\t", "def pangram(s):\r\n alphabet = set(\"abcdefghijklmnopqrstuvwxyz\")\r\n s = s.lower()\r\n \r\n for char in s:\r\n if char in alphabet:\r\n alphabet.remove(char)\r\n if not alphabet:\r\n return True\r\n return False\r\n\r\nn = int(input())\r\nstring = input()\r\n\r\nif pangram(string):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\ns=str(input())\r\ns1=s.lower()\r\nif(\"\".join(sorted(set(s1)))==\"abcdefghijklmnopqrstuvwxyz\"):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "t=int(input())\n\ns=input()\nb=s.lower()\na='abcdefghijklmnopqrstuvwxyz'\nfor j in a:\n if j not in b:\n print('No')\n break\nelse:\n print('Yes')\n\t \t\t \t\t \t \t\t \t \t \t\t\t \t\t", "number = int(input())\r\nstring = str(input())\r\nalphabet = 'abcdefghijklmnopqrstuvwxyz'\r\nstring = string.lower().replace(' ','')\r\ncount = 0\r\nfor i in range(len(alphabet)):\r\n if alphabet[i] in string:\r\n count += 1\r\nif len(alphabet) <= count:\r\n print('YES')\r\nelse:\r\n print('NO')\n# Sat Oct 21 2023 15:49:47 GMT+0300 (Moscow Standard Time)\n", "n=int(input())\r\ns=input()\r\ncnt=[0]*26\r\nfor i in s:\r\n x=chr(ord(i)|32)\r\n cnt[ord(x)-97]+=1\r\nf=0 \r\nfor i in range(26):\r\n if(cnt[i]==0):\r\n f=1\r\n print(\"NO\")\r\n break\r\n\r\nif(f==0):\r\n print(\"YES\")\r\n ", "def panagram(char):\r\n characters = \"abcdefghijklmnopqrstuvwxyz\"\r\n s = []\r\n for i in char:\r\n if i.isalpha() and i.lower() not in s:\r\n s.append(i.lower())\r\n if len(s) == 26:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\nn=int(input())\r\nchar = input()\r\nres = panagram(char)\r\nprint(res)\r\n", "n = int(input())\r\narr = list(set([i.lower() for i in list(input())]))\r\n\r\nif len(arr) == 26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from collections import Counter\nn=int(input())\ns=input().lower()\nd=Counter(s)\ns1=\"abcdefghijklmnopqrstuvwxyz\"\nfor i in s1:\n if d[i]==0:\n print(\"NO\")\n break\nelse:\n print(\"YES\")\n\n\t\t\t \t\t\t\t\t\t\t \t \t\t\t\t \t\t \t \t\t\t", "n=int(input())\r\ns=input()\r\ns=s.lower()\r\nd={}\r\nfor i in s:\r\n if i not in d:\r\n d[i]=0\r\n# print(len(d),d)\r\nif len(d)==26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nprint(\"NO\" if len(set(input().lower())) != 26 else \"YES\")", "n = int(input())\nst= input().lower()\ns= set()\nfor char in st:\n if char.isalpha():\n s.add(char)\nif len(s) == 26:\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", "a=int(input())\r\ns=input().lower()\r\nres=set(s)\r\nif len(res)==26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "nw=int(input())\r\nsw=input()\r\nsw=sw.lower()\r\nwl=set(\"abcdefghijklmnopqrstuvwxyz\")\r\nfor chr in sw:\r\n\tif chr in wl:\r\n\t\twl.remove(chr)\r\nif not wl:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "def is_pangram(string):\r\n # Create a set of all lowercase letters in the alphabet\r\n alphabet = set(\"abcdefghijklmnopqrstuvwxyz\")\r\n\r\n # Convert the input string to lowercase\r\n string = string.lower()\r\n\r\n # Check if all letters in the alphabet are present in the string\r\n for letter in alphabet:\r\n if letter not in string:\r\n return \"NO\"\r\n\r\n return \"YES\"\r\n\r\n# Read input\r\nn = int(input())\r\nstring = input()\r\n\r\n# Check if it's a pangram and print the result\r\nresult = is_pangram(string)\r\nprint(result)\r\n", "n=int(input())\na=input()\na=a.upper()\nm=list(set(a))\n#print(m)\ncount=0\nfor i in m:\n if 65<=ord(i)<=91:\n count+=1\nif count==26:\n print('YES')\nelse:\n print('NO')\n\t\t \t \t\t \t \t \t \t\t \t\t", "n=int(input())\ns=input().lower()\nd={}\nif n<26:\n print(\"NO\")\nelse:\n for i in s:\n if i not in d:\n d[i]=1\n if len(d)==26:\n print(\"YES\")\n break\n else:\n d[i]=+1\n else:\n print(\"NO\")\n\t \t\t\t\t\t \t \t \t\t \t\t\t\t", "n = int(input())\r\ns = input()\r\nmn=set()\r\ns = s.lower()\r\nfor i in s:\r\n mn.add(i)\r\nif len(mn) < 26:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "# 520A - Pangram\r\n\r\nn = int(input())\r\nword = input().lower()\r\nword_list = []\r\n\r\nfor char in word:\r\n if char not in word_list:\r\n word_list.append(char)\r\n\r\nif len(word_list) == 26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from collections import Counter\r\nn=int(input())\r\ns=input()\r\ns=s.lower()\r\nd=Counter(s)\r\nprint(\"YES\" if len(d)==26 else \"NO\")\r\n", "n=input()\r\ns=input().lower()\r\nprint('YES' if len(set(s))==26 else 'NO')", "n=int(input())\r\ns=input().lower()\r\nunq=set()\r\nfor char in s:\r\n if char.isalpha():\r\n unq.add(char)\r\nif len(unq)==26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nword = str(input())\r\nlist = []\r\n\r\nfor i in word:\r\n if i.lower() not in list:\r\n list.append(i.lower())\r\n\r\nprint(\"YES\" if len(list) == 26 else \"NO\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\ns = input()\r\nl = list(s)\r\nfor i in range(0,n):\r\n if 65<=ord(l[i]) <= 90:\r\n l[i]=chr(ord(l[i])+32)\r\na=set(l)\r\nif len(a)>=26:\r\n print('YES')\r\nelse:\r\n print(\"NO\")", "n = int(input())\ns = input().lower()\nS = \"abcdefghijklmnopqrstuvwxyz\"\nb = False\nfor x in S:\n if x in s:\n b = True\n else:\n b = False\n break\nif b:\n print(\"YES\")\nelse:print(\"NO\")\n\t\t \t \t \t\t\t \t \t\t \t", "import string\r\n\r\nn = int(input())\r\ngiven = list((input()))\r\nalphabet = set(list(string.ascii_lowercase))\r\n\r\nlowered = list()\r\n\r\n\r\nfor char in given:\r\n lowered += char.lower()\r\n\r\n\r\nlowered = set(lowered)\r\n\r\nif lowered == alphabet:\r\n print('YES')\r\nelse:\r\n print('NO')", "alp='abcdefghijklmnopqrstuvwxyz'\nn=int(input())\ns=input().lower()\nif(n<26):\n print('NO')\nelse:\n for i in alp:\n if i not in s:\n flag='false'\n break\n else:\n flag='true'\n if(flag=='true'):\n print('YES')\n else:\n print('NO')\n\t\t \t \t \t\t \t \t \t\t \t \t\t", "n = int(input())\r\ns = input()\r\ns = s.lower()\r\nse = set(s)\r\nif len(s)==26:\r\n if len(se)==26:\r\n print('YES')\r\n elif len(se)<26:\r\n print('NO')\r\n else:\r\n pass\r\nelif len(s)>26:\r\n if len(se)==26:\r\n print('YES')\r\n elif len(se)<26:\r\n print('NO')\r\n else:\r\n pass \r\nelse:\r\n print('NO')", "n = int(input())\nS = input()\nS = S.lower()\nS = set(S)\nresult = [0] * 26\nfor i, char in enumerate(S):\n for j in range(97, 123):\n if ord(char) == j:\n result[i] = 1\nif all(element == 1 for element in result):\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\t \t \t \t\t \t\t \t \t\t \t\t", "n = int(input())\r\nz = str(input())\r\nl = []\r\nfor i in z.lower():\r\n if i not in l:\r\n l.append(i)\r\nif len(l) == 26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "n = int(input())\r\ns = input().lower()\r\n\r\nu = set()\r\n\r\nfor char in s:\r\n if char.isalpha():\r\n u.add(char)\r\n\r\nif len(u) == 26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\ns = input().lower()[:n]\nx = set(s)\ncount = 0\nfor i in x:\n if i.isalpha():\n count+=1\nif count == 26:\n print(\"Yes\")\nelse:\n print(\"No\")\n \t\t\t\t \t\t \t\t \t\t\t \t \t\t", "n=int(input())\r\na=input()\r\na=a.lower()\r\nl=set(a)\r\nif len(l)==26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "num_characters = int(input())\r\nword = input()\r\nletter_list = [False for _ in range(26)]\r\n\r\nword = word.upper()\r\nfor char in word:\r\n char_ascii = ord(char)\r\n letter_list[char_ascii-65] = True\r\n \r\nfor item in letter_list:\r\n if item == False:\r\n print(\"NO\")\r\n break\r\n\r\nelse:\r\n print(\"YES\")", "n=int(input())\r\ns=input()\r\nmy=\"abcdefghijklmnopqrstuvwxyz\"\r\ns=s.lower()\r\nf=0\r\nfor i in my:\r\n if i not in s:\r\n print(\"NO\")\r\n f=1\r\n break\r\nif f==0:\r\n print(\"YES\")\r\n", "print(\"YES\" if input() and len(set(input().lower())) == 26 else \"NO\")\r\n", "n = int(input())\n\nword = input().lower()\n\nletters = {}\n\nfor i in word:\n if i in letters:\n letters[i] += 1\n else:\n letters[i] = 1\n\nif len(letters) == 26:\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", "alphabet = [chr(ord('a') + i) for i in range(26)]\r\n\r\nn = int(input())\r\nword = input().lower()\r\nword_list = list(word)\r\n\r\ncontains_all = all(letters in word_list for letters in alphabet)\r\n\r\nif contains_all:\r\n print(\"YES\")\r\n\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\ns=str(input())\r\na=s.lower()\r\nb=list(set(list(a)))\r\nif len(b)==26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\nl=len(set(list(input().lower())))\nprint(\"YES\" if l==26 else \"NO\")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Sep 14 14:34:19 2023\r\n\r\n@author: HyFlu\r\n\"\"\"\r\n\r\nnumber=int(input())\r\nsentence=input().lower()\r\nsentence=set(sentence)\r\nif len(sentence)==26:\r\n print('YES')\r\nelse:\r\n print('NO')", "n=int(input())\r\ns=input().lower()\r\nt=set(s);\r\nif len(t)==26:\r\n print('YES');\r\nelse:\r\n print('NO');\r\n", "number_of_letters = int(input())\r\nword = str(input()).lower()\r\nset_word = set(word)\r\n#alphabet = {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\nif number_of_letters < 26 :\r\n print(\"NO\")\r\nelif len(set_word) < 26 :\r\n print(\"NO\")\r\nelse :\r\n print(\"YES\")", "n = int(input())\r\ns = input()\r\nk = s.lower()\r\nset1 = set(k)\r\nif (len(set1)==26):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\ns = input()\r\n\r\n# Convert the string to lowercase to ensure case insensitivity\r\ns = s.lower()\r\n\r\n# Initialize a set to keep track of unique characters\r\nunique_chars = set()\r\n\r\n# Iterate through the characters in the string\r\nfor char in s:\r\n # Check if the character is an alphabet letter\r\n if 'a' <= char <= 'z':\r\n unique_chars.add(char)\r\n\r\n# Check if there are 26 unique alphabet letters (a to z)\r\nif len(unique_chars) == 26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "_ = input()\ns = set(input().lower())\nif len(s) == 26:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t\t\t\t \t \t\t\t \t\t\t \t\t \t \t", "t = int(input())\r\nn = input().lower()\r\nans = set(n)\r\nif len(ans) == 26:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n=int(input())\ns=input()\n\nletters = set()\n\n \nfor c in s:\n if c.isalpha():\n \n letters.add(c.lower())\n\nif len(letters)==26: \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", "n=input()\r\nprint('YES' if len(set(str(input().lower())))==26 else 'NO')\r\n", "n = int(input())\r\ns = input()\r\n\r\nletters = set()\r\n\r\nfor c in s:\r\n if c.isalpha():\r\n letters.add(c.lower())\r\n\r\nif len(letters) == 26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\ndef is_pangram(s): \n l = set() \n for char in s:\n if char.isalpha():\n l.add(char.lower())\n return len(l) == 26\n\nn = int(input())\ns = input()\n\nif is_pangram(s):\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\t\t \t\t \t \t \t \t \t \t \t\t \t\t", "n = int(input())\nstring = input(\"\")\nstring1 = string.lower()\nstring2 = set(string1)\n\nif len(string2) == 26:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t \t\t \t\t\t\t \t\t \t", "import string\r\n\r\ndef ispangram(str):\r\n\talphabet = \"abcdefghijklmnopqrstuvwxyz\"\r\n\tfor char in alphabet:\r\n\t\tif char not in str.lower():\r\n\t\t\treturn False\r\n\r\n\treturn True\r\n\t\r\n# Driver code\r\nn = int(input())\r\nstring = input()\r\nx = string.lower()\r\nif(ispangram(x) == True):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n", "n = int(input())\r\ns = input().lower()\r\nalp = 'qwertyuiopasdfghjklzxcvbnm'\r\nfor letter in alp:\r\n\tif letter not in s:\r\n\t\tprint(\"NO\")\r\n\t\tbreak\r\nelse:\r\n\tprint(\"YES\")", "n = input()\r\na = set(list(input().lower()))\r\nprint('Yes' if len(a) == 26 else 'No')\r\n", "l = ['q', 'w', 'e','r', 't', 'y', 'u', 'i', 'o', 'p', 'a', 's', 'd', 'f', 'g', 'h',\r\n 'j', 'k', 'l', 'z', 'x', 'c', 'v', 'b', 'n', 'm']\r\nn = int(input())\r\ns = input()\r\ns = s.lower()\r\nb = True\r\nfor i in range(len(l)):\r\n if l[i] in s:\r\n continue\r\n else:\r\n b = False\r\n break\r\nif b == True:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "size = int(input())\r\nword = input().lower()\r\n\r\ncount = {}\r\nfor c in word:\r\n count[c] = count.get(c, 0) + 1\r\n\r\nprint('YES' if len(count) == 26 else 'NO')\r\n", "n = int(input())\nstring = input().lower()\n\nif n < 26:\n print(\"NO\")\n\nelse:\n chars = set(string)\n\n if len(chars) < 26:\n print(\"NO\")\n else:\n print(\"YES\")\n\n \t\t \t \t \t \t \t \t \t\t\t\t\t\t \t", "import string\r\nn = input()\r\ns = input().lower()\r\nlett = {x:0 for x in string.ascii_lowercase}\r\nsol = \"YES\"\r\nfor c in s:\r\n lett[c] = lett.get(c,0)+1\r\nfor v in lett.values():\r\n if v > 0:\r\n continue\r\n else:\r\n sol = \"NO\"\r\n break\r\n \r\nprint(sol)", "def pangrams(s):\n s=s.lower()\n alphabet=\"abcdefghijklmnopqrstuvwxyz\"\n for i in alphabet:\n if i not in s:\n return \"NO\"\n return \"YES\"\n \nn=int(input())\nk=input()\nif n<26:\n print(\"NO\")\nelse:\n print(pangrams(k))\n\t \t \t \t\t\t \t\t\t\t \t \t \t\t", "import string\r\nc=0\r\nn=int(input())\r\ns=input()\r\nx=s.lower()\r\n\r\nif n<26:\r\n print(\"NO\")\r\nelse:\r\n for i in string.ascii_lowercase:\r\n if(i in x):\r\n c+=1\r\n else:\r\n print(\"NO\")\r\n break\r\n \r\n if(c>=26):\r\n print(\"YES\")\r\n ", "# Function to check if a string is a pangram\r\ndef is_pangram(string):\r\n # Create a set of all lowercase letters of the alphabet\r\n alphabet = set(\"abcdefghijklmnopqrstuvwxyz\")\r\n \r\n # Convert the input string to lowercase\r\n string = string.lower()\r\n \r\n # Check if each character in the string is in the alphabet set\r\n for char in string:\r\n if char in alphabet:\r\n alphabet.remove(char) # Remove the character from the set if found\r\n \r\n # If the set is empty, it's a pangram; otherwise, it's not\r\n if len(alphabet) == 0:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n\r\n# Read input\r\nn = int(input())\r\ninput_string = input()\r\n\r\n# Check if the input string is a pangram\r\nresult = is_pangram(input_string)\r\nprint(result)\r\n\r\n", "n = int(input())\r\nh = input('').lower()\r\nres= set('abcdefghijklmnopkrstuvwxyzq')\r\nfor j in h:\r\n if j.isalpha():\r\n res.discard(j)\r\nif len(res) == 0:\r\n print('YES')\r\nelse:\r\n print('NO')", "def ispangram(str):\r\n alphabet = \"abcdefghijklmnopqrstuvwxyz\"\r\n for char in alphabet:\r\n if char not in str.lower():\r\n return False\r\n \r\n return True\r\n \r\n# Driver code\r\nn = int(input())\r\ns = input()\r\nif(ispangram(s) == True):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\nif n < 26:\n print(\"NO\")\n\nelse: \n resultado = \"YES\"\n s = input()\n alfabeto = {\"A\": 0,\n \"B\": 0,\n \"C\": 0,\n \"D\": 0,\n \"E\": 0,\n \"F\": 0,\n \"G\": 0,\n \"H\": 0,\n \"I\": 0,\n \"J\": 0, \n \"K\": 0,\n \"L\": 0,\n \"M\": 0,\n \"N\": 0,\n \"O\": 0, \n \"P\": 0,\n \"Q\": 0,\n \"R\": 0,\n \"S\": 0, \n \"T\": 0,\n \"U\": 0,\n \"V\": 0, \n \"W\": 0,\n \"X\": 0,\n \"Y\": 0,\n \"Z\": 0, }\n \n for i in range(len(s)):\n alfabeto[s[i].upper()] += 1\n \n for i in alfabeto.values(): \n if i == 0: \n resultado = \"NO\"\n break\n\n print(resultado)\n \t\t\t \t \t\t\t \t \t \t \t\t\t\t", "n=int(input())\r\ns=input().upper()\r\nl=[]\r\nk=[]\r\nfor i in range(1,27):\r\n l.append(chr(i+64))\r\nfor i in s:\r\n if i not in k:\r\n k.append(i)\r\nif len(l)==len(k):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\nstr1=input()\nr=str1.lower()\nif (len(set(r)))==26:\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", "x=int(input())\r\nt=input()\r\nif set(t.lower())>= set('abcdefghijklmnopqrstuvwxyz'):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import string\r\nimport sys\r\n\r\nn = int(sys.stdin.readline().split()[0])\r\n\r\nstr_char = list(sys.stdin.readline()[:-1].lower())\r\nstr_char.sort()\r\n\r\nif ''.join(dict.fromkeys(str_char)) == string.ascii_lowercase:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\r\ninp = input().strip()\r\ncnt = [0] * 26\r\nfor char in inp:\r\n index = ord(char.lower()) - ord('a')\r\n cnt[index] += 1\r\nfor q in range(26):\r\n if cnt[q] == 0:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")# 1698240244.7031403", "def pangrama (n, word):\r\n word = word.lower()\r\n letras = set(word)\r\n alfabeto = set(\"abcdefghijklmnopqrstuvwxyz\")\r\n \r\n if letras == alfabeto:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\npangrama(int(input()), input(\"\"))", "import string\ndef check(str):\n az= \"abcdefghijklmnopqrstuvwxyz\"\n for char in az:\n if char not in str.lower():\n return False\n return True\n\nn=int(input())\nstr=input()\nif(check(str) == True):\n print(\"YES\")\nelse:\n print(\"NO\")\n \t\t \t \t\t \t\t \t\t\t \t\t \t \t", "t = int(input())\r\nabc = \"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\nabc= abc.split(\",\")\r\nif t < 26:\r\n print(\"NO\")\r\nelse:\r\n mw = input()\r\n mw = mw.lower()\r\n for i in range(26):\r\n if abc[i] not in mw:\r\n no = 1\r\n break\r\n else:\r\n no = 0\r\n if no == 1:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n\r\n\r\n", "import string\nw=int(input())\na=input().lower()\nli=list(string.ascii_lowercase)\nn=set(a)\nl=len(n)\nl1=len(li)\nif l==l1:\n print(\"Yes\")\nelse:\n print(\"No\")\n \t \t\t\t \t \t\t\t \t\t\t\t\t \t \t \t", "n = int(input())\npalavra = input().lower()\nsem_repetir = []\ncontador = 0\nif(n < 26):\n print(\"NO\")\nelse:\n for i in range(n):\n if (palavra[i] in sem_repetir):\n a = 1\n else:\n contador += 1\n sem_repetir.append(palavra[i])\n if (contador == 26):\n print(\"YES\")\n else:\n print(\"NO\")\n\n\t \t\t\t \t \t \t\t \t\t\t \t\t\t\t", "n = int(input())\r\ns = input()\r\n\r\nc = set(s.lower())\r\na = set('abcdefghijklmnopqrstuvwxyz')\r\n\r\nif c == a:\r\n print(\"YES\")\r\n\r\nelse:\r\n print(\"NO\")\r\n\r\n", "n = int(input())\r\ns = input()\r\ncount = 0\r\nf_char = \"\"\r\nalphabet = \"abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\n\r\nif 1<=n<=100:\r\n for i in range(0, len(s)):\r\n if s[i] not in f_char:\r\n if 65<=ord(s[i])<=90:\r\n f_char += s[i]+chr(ord(s[i])+32)\r\n elif 97<=ord(s[i])<=122:\r\n f_char += s[i]+chr(ord(s[i])-32)\r\n if s[i] in alphabet:\r\n count += 1\r\nif count == 26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Tue Sep 19 17:28:08 2023\n\n@author: huangxiaoyuan\n\"\"\"\n\nn=int(input())\ns=input()\nif 1<=n<=100:\n if len(s)==n:\n s=s.lower()#这里转化为小写，目的是消除大小写的问题\n s1=set(s)#转化为集合，消除重复问题\n str1=''\n for i in s1:\n str1+=i\n if len(str1)==26:\n print('YES')\n else:\n print('NO')\n\n\n\n \n ", "n = int(input())\nword = str(input())\n\nif (n<26):\n print(\"NO\")\nelse:\n alphabet = \"abcdefghijklmnopqrstuvwxyz\"\n if (set(word.lower()) == set(alphabet)):\n print(\"YES\")\n else:\n print(\"NO\")\n\n \t \t \t\t\t \t \t \t \t \t\t \t\t\t \t", "n=int(input())\r\nx=input()\r\ny=x.lower()\r\nif(len(set(list(y))) == 26):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\ns=input().lower()\r\na=\"abcdefghijklmnopqrstuvwxyz\"\r\nt=False\r\nfor i in a:\r\n if i not in s:\r\n t=True\r\n break\r\nif(t):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n=int(input())\na=input()\nq=a.lower()\np=len(set(q))\nif p==26:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t \t\t \t\t \t\t \t\t\t \t \t \t \t \t", "n, string, flag = int(input()), set(input().lower()), True\r\nfor _ in range(26):\r\n if chr(_ + ord('a')) not in string:\r\n flag = False\r\n break\r\nprint('YES' if flag else 'NO')", "n = int(input())\r\ns = input()\r\na = []\r\nl_s=s.lower()\r\nfor i in l_s:\r\n if i >= 'a' and i <= 'z':\r\n a.append(i)\r\na =list(set(a))\r\nif len(a) ==26:\r\n print ('YES')\r\nelse:\r\n print('NO')\r\n\r\n", "n=int(input())\r\nstring=input().lower()\r\nsample='abcdefghijklmnopqrstuvwxyz'\r\ncheck=False\r\nfor c in sample:\r\n if string.find(c)==-1:\r\n print(\"NO\")\r\n check=True\r\n break\r\nif check==False:\r\n print(\"YES\")\r\n", "def is_pangram(string):\r\n unique_letters = set()\r\n for char in string: \r\n if 'a' <= char <= 'z':\r\n unique_letters.add(char)\r\n\r\n if len(unique_letters) == 26:\r\n return \"YES\" \r\n else:\r\n return \"NO\" \r\n\r\nn = int(input())\r\ns = input()\r\ns1=s.lower()\r\nresult = is_pangram(s1)\r\nprint(result)\r\n", "n = int(input())\r\ns = [i.lower() for i in input()]\r\n\r\nif len(set(s)) == 26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nif n < 26:\r\n print(\"NO\")\r\n exit()\r\na = input()\r\na = a.lower()\r\nst = []\r\nfor i in range(n):\r\n st.append(a[i])\r\nst = set(st)\r\nif len(st) == 26:\r\n print(\"YES\")\r\nelse:\r\n print('NO')\r\n", "import sys\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport itertools\r\nfrom sys import stdin,stdout\r\nfrom math import gcd,floor,sqrt,log, ceil\r\nfrom collections import defaultdict, Counter, deque\r\nfrom bisect import bisect_left,bisect_right, insort_left, insort_right\r\n\r\nmod=1000000007\r\n\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_string(): return sys.stdin.readline().strip()\r\ndef get_int(): return int(sys.stdin.readline().strip())\r\ndef get_list_strings(): return list(map(str, sys.stdin.readline().strip().split()))\r\n\r\n\r\ndef solve():\r\n n = int(input())\r\n s = get_string().lower()\r\n\r\n count = Counter(s)\r\n\r\n if len(count) == 26:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\nif __name__ == \"__main__\":\r\n print(solve())\r\n", "#L-panagram\ndef checkPanagram(st):\n alp='abcdefghijklmnopqrstuvwxyz'\n for ch in alp:\n if ch not in st.lower():\n return False\n return True\nn=int(input())\nst=input()\nif(checkPanagram(st)):\n print(\"YES\")\nelse:\n print(\"NO\")\n\t \t \t\t \t\t \t \t \t\t \t \t", "input()\na=input().lower()\nres=\"\".join(set(a))\no=0\nletter=[ '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']\nfor i in range(len(res)):\n if a.__contains__(letter[i]):\n o+=1\n\n\nif o==len(letter):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "#l\nn=int(input())\nst=input()\nst=st.upper()\nf=\"YES\"\nfor i in range(65,91):\n if chr(i) not in list(st):\n f=\"NO\"\nprint(f)\n \t\t \t\t\t\t\t\t \t\t\t \t\t \t\t \t\t", "n=int(input())\r\nstroka=input().lower()\r\n\r\nif len(set(stroka))==26:\r\n print(\"YES\")\r\nelse: print(\"NO\")", "a = int(input())\r\nb = input()\r\nd=b.lower()\r\nc = []\r\nc.extend(d)\r\n\r\nflag = True # Initialize as True, assuming all letters are present\r\n\r\nalist = list(map(chr, range(97, 123)))\r\n\r\nfor i in alist:\r\n if i not in c:\r\n flag = False\r\n break # No need to continue checking if a letter is missing\r\n\r\nif flag and a >= 26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\na=input()\na=a.lower()\ns='abcdefghijklmnopqrstuvwxyz'\nd={}\nfor i in s:\n d[i]=0\nfor i in a:\n if i in d:\n d[i]+=1 \nfor i in d:\n if d[i]==0:\n print(\"NO\")\n break\nelse:\n print(\"YES\")\n\n \t \t \t \t \t \t\t\t\t\t \t \t\t \t", "n = int(input()) \r\ns = input().lower()\r\nletters_set=set()\r\nfor char in s:\r\n if 'a'<=char<='z':\r\n letters_set.add(char)\r\nif len(letters_set)==26:\r\n print(\"YES\") \r\nelse:\r\n print(\"NO\")", "n = int(input())\r\ns = input().lower()\r\ns_list = []\r\nfor y in s:\r\n s_list.append(y)\r\n\r\ndistinct = set(s_list)\r\nif len(distinct) == 26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\ns = input()\r\narr = [0] * 26\r\n\r\nfor i in range(n):\r\n c = s[i]\r\n if 'A' <= c <= 'Z':\r\n a = ord(c) - ord('A')\r\n arr[a] += 1\r\n elif 'a' <= c <= 'z':\r\n a = ord(c) - ord('a')\r\n arr[a] += 1\r\n\r\nisPangram = True\r\nfor j in range(26):\r\n if arr[j] == 0:\r\n isPangram = False\r\n break\r\n\r\nif isPangram:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\nword = input().lower()\r\nword_list = sorted(list(word))\r\nletter = word_list[-1]\r\nif n == len(word_list):\r\n word_list = [word_list[i] for i in range(len(word_list)-1) if word_list[i] != word_list[i+1]]\r\n word_list.append(letter)\r\n if word_list == list(\"abcdefghijklmnopqrstuvwxyz\"):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "def i():\r\n return(int(input()))\r\ndef l():\r\n return(list(map(int,input().split())))\r\ndef s():\r\n s = input()\r\n return(s)\r\ndef sl():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef m():\r\n return(map(int,input().split()))\r\n\r\nn = i()\r\nt = s().lower()\r\nt = list(t)\r\nss = set(t)\r\nl = set(['a','b','c','d','e','f','g','h','i','j','l','k','m','n',\r\n 'o','p','q','r','s','t','u','v','w','x','y','z'])\r\nif ss == l:\r\n print('YES')\r\nelse:\r\n print('NO')", "t = int(input())\r\nn = input().lower()\r\nres = []\r\nif t < 26:\r\n print('NO')\r\nelse:\r\n for i in range(t):\r\n if n[i] not in res:\r\n res.append(n[i])\r\n\r\n if len(res) < 26:\r\n print('NO')\r\n\r\n else:\r\n print('YES')", "a=int(input())\r\nb=input()\r\nx=(\"qwertyuiopasdfghjklzxcvbnm\")\r\nb=b.lower()\r\nif set(b)>=set(x):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\nst=input()\n\ndi={}\nst.replace(\" \",\"\")\nfor x in st:\n x=x.lower()\n \n if(x in di):\n di[x]\n else:\n di[x]=1\n \nif(len(di.keys())>=26):\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", "numbers=int(input())\r\nstring=input().lower()\r\nbottom=True\r\nalpha=['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\nfor char in alpha:\r\n if char not in string:\r\n bottom=False\r\n break\r\nif bottom:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "l1=['a','b','c','d','e','f','g','h','i','j','k','l','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']\r\nn=int(input())\r\nc=0\r\nl=input().lower()\r\nfor i in l1:\r\n if i not in l:\r\n c=1\r\n print(\"NO\")\r\n break\r\nif c==0:\r\n print(\"YES\")", "n = int(input())\r\n\r\ninput_string = input()\r\n\r\ninput_set = set(input_string.lower())\r\n\r\nalphabet_set = set('abcdefghijklmnopqrstuvwxyz')\r\n\r\nif input_set >= alphabet_set:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\na = input()\r\n\r\na = a.lower()\r\na1 = set(a)\r\n\r\nif len(a1) == 26:\r\n print('YES')\r\nelse:\r\n print('NO')", "t = int(input()) \ns = input()\ns2 = s.lower()\ns1 = set(s2)\nif len(s1) == 26:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t \t\t \t\t \t \t\t \t\t\t\t \t \t", "import string\r\nn=int(input())\r\ns=input().lower()\r\nlist1=[]\r\nlist1.extend(s)\r\nlist1=list(set(list1))\r\nlist1.sort()\r\na=string.ascii_lowercase\r\nfor x in range(len(list1)):\r\n if list1[x]==a[x]:\r\n pass\r\n else:\r\n print(\"NO\")\r\n exit()\r\nif len(list1)==26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\ninput_string = input().lower()\n\nunique_letters = set(input_string)\n\nif len(unique_letters) == 26:\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", "n = int(input())\r\n\r\nif n < 26:\r\n print('NO')\r\nelse:\r\n s = input().lower()\r\n chars = set()\r\n for char in s:\r\n chars.add(char)\r\n if len(chars) == 26:\r\n print('YES')\r\n else:\r\n print('NO')", "n = int(input())\r\na = {chr(i) for i in range(65, 65+26)}\r\n\r\ns = set(list(input().upper()))\r\nprint([\"NO\", \"YES\"][a == s])\r\n \r\n", "n = int(input())\r\ntext = input()\r\ntext = text.lower()\r\n\r\nif n < 26:\r\n print(\"NO\")\r\nelse:\r\n text_list = list(text)\r\n text_list.sort()\r\n text_set = set(text_list)\r\n if len(text_set) == 26:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "n=int(input())\r\ns=input()\r\nif n<26:\r\n print(\"NO\")\r\nelse:\r\n s=s.upper()\r\n s=list(s)\r\n l=dict.fromkeys(s)\r\n if len(l)<26:\r\n print(\"No\")\r\n elif len(l)==26:\r\n print(\"YEs\") \r\n ", "input()\r\nprint(\"YES\" if(len(set(input().lower())))==26 else \"NO\")", "n = int(input())\r\nstrings=input()\r\nakk=strings.lower()\r\n\r\nakrem=list(akk)\r\n\r\nakrem=set(akrem)\r\nif len(akrem)==26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nstring = input().lower()\r\n\r\nalphabet = set(string)\r\n\r\nif len(alphabet) == 26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "letters = 0\r\nn = int(input())\r\nword = input()\r\nword = word.lower()\r\nfor i in \"abcdefghijklmnopqrstuvwxyz\":\r\n if i in word:\r\n letters += 1\r\nif letters >= 26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "size=int(input())\ns=str(input())\ns=s.lower()\nlst=[]\nif(size==len(s)):\n for i in range(ord('a'),ord('z')+1):\n for j in s:\n if(chr(i)==j):\n if j not in lst:\n lst.append(j)\n if(len(lst)==26):\n print(\"YES\")\n else:\n print(\"NO\")\n\t \t\t \t\t\t\t\t\t \t \t \t \t \t\t\t\t", "a=int(input())\nb=input()\nb=b.lower()\ns=set(b)\nif len(s)<26:\n print(\"NO\")\nelse:\n print(\"YES\")\n \t\t\t\t \t\t \t \t \t \t", "n = int(input())\r\ns = input()\r\na = [\"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\nm = []\r\nk = 0\r\nfor i in range(len(s)):\r\n if s[i].lower() not in m:\r\n m.append(s[i].lower())\r\nfor i in range(len(m)):\r\n if m[i].lower() in a:\r\n k+=1\r\nif k==26:\r\n print('YES')\r\nelse:\r\n print('NO')", "def isPangram(n,string):\r\n string=string.lower()\r\n uni_char=set()\r\n for char in string:\r\n if char.isalpha():\r\n uni_char.add(char)\r\n return \"YES\" if len(uni_char)==26 else \"NO\"\r\ns=int(input())\r\nstring=input()\r\nprint(isPangram(s,string))", "n = int(input())\r\ns = set(map(ord, input().lower()))\r\nif sum(s) == 2847:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\ns = input().lower()\r\n\r\nis_pangram = all(chr(i) in s for i in range(ord('a'), ord('z') + 1))\r\n\r\nif is_pangram:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input()) # Read the number of characters in the string\r\ns = input() # Read the string\r\na = s.lower() # Convert the string to lowercase\r\n\r\n# Set to store unique lowercase letters present in the string\r\nletter_set = set(a)\r\n\r\n# Check if all letters of the alphabet are present in the letter_set\r\nif len(letter_set) == 26:\r\n print('YES') # The string is a pangram\r\nelse:\r\n print('NO') # The string is not a pangram\r\n", "n = int(input())\ns = input().lower() \nletters_set = set()\nfor char in s:\n if 'a' <= char <= 'z':\n letters_set.add(char)\nif len(letters_set) == 26:\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=int(input())\r\nstring=input().lower()\r\nif t >=26 and all([1 if chr(97+i) in string else 0 for i in range(26)]):\r\n\tprint (\"YES\")\r\nelse :\r\n\tprint (\"NO\")", "alfabeto = ['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']\n\nn=int(input())\ncontador=0\npalavra= input()\npalavraM= palavra.upper()\nfor letra in alfabeto:\n if(letra in palavraM):\n contador+=1\nif(contador==26):\n print('YES')\nelse:print(\"NO\")\n\n\t \t \t\t\t\t \t\t\t\t\t\t\t \t \t\t\t \t\t", "def is_pangram(s):\r\n s = s.lower().replace(\" \", \"\") # Convert the string to lowercase and remove spaces\r\n letters_seen = set()\r\n for char in s:\r\n if 'a' <= char <= 'z':\r\n letters_seen.add(char)\r\n return len(letters_seen) == 26\r\nn = int(input())\r\ns = input()\r\nresult = is_pangram(s)\r\nif result:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# Read the length of the string\r\nn = int(input())\r\n\r\n# Read the string\r\ns = input()\r\n\r\n# Create a set to store unique lowercase letters\r\nlowercase_letters = set()\r\n\r\n# Iterate through the string and add lowercase letters to the set\r\nfor char in s:\r\n if char.isalpha():\r\n lowercase_letters.add(char.lower())\r\n\r\n# Check if there are at least 26 unique lowercase letters (a to z)\r\nif len(lowercase_letters) >= 26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\ns = input()\ns = s.lower()\n\ns_set = set(s)\nprint('YES') if len(s_set) == 26 else print('NO')\n", "n = int(input())\r\ns = input().lower() \r\nu = set(s)\r\nif len(u) == 26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\ns=input().lower()\r\nflag=0\r\na=\"abcdefghijklmnopqrstuvwxyz\"\r\nfor i in a:\r\n if i not in s:\r\n flag=1 \r\nif flag==1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "num_chars = int(input())\ninp_str = input().lower()\n\nalpha_map = {\n \"a\": 0,\n \"b\": 0,\n \"c\": 0,\n \"d\": 0,\n \"e\": 0,\n \"f\": 0,\n \"g\": 0,\n \"h\": 0,\n \"i\": 0,\n \"j\": 0,\n \"k\": 0,\n \"l\": 0,\n \"m\": 0,\n \"n\": 0,\n \"o\": 0,\n \"p\": 0,\n \"q\": 0,\n \"r\": 0,\n \"s\": 0,\n \"t\": 0,\n \"u\": 0,\n \"v\": 0,\n \"w\": 0,\n \"x\": 0,\n \"y\": 0,\n \"z\": 0\n }\n\nfor char in inp_str:\n alpha_map[char] = 1\n\nfor k in alpha_map:\n if alpha_map[k] == 0:\n print(\"NO\")\n break\nelse:\n print(\"YES\")\n \t\t\t \t \t\t\t\t\t\t \t \t\t\t \t\t\t\t", "t = int(input())\r\nstr = set(input().lower())\r\nif len(str) == 26:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "#L - Pangram\na=int(input())\ns=input()\nun=set()\nstr=s.lower()\nfor i in str:\n asc=ord(i)\n if(asc>=97 and asc<=122):\n un.add(i)\n else:\n continue \n length=len(un) \nif(length==26):\n print(\"Yes\")\nelse:\n print(\"No\")\n \t\t \t \t\t \t \t \t \t\t\t \t \t \t\t \t", "n =int(input())\r\na=input()\r\na=a.lower()\r\nA=set(a)\r\nb=set(\"abcdefghijklmnopqrstuvwxyz\")\r\n# print(b)\r\n# print(A)\r\nif A==b:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "no = int(input())\r\na=[*(input())]\r\nalower=[x.lower() for x in a]\r\nchecker=[]\r\nx=0\r\nfor s in alower: \r\n if s not in checker:\r\n x+=1 ; checker.append(s) \r\nprint(\"YES\" if x==26 else \"NO\")", "n = input()\nalphabet = sorted(set('abcdefghijklmnopqrstuvwxyz'))\n\ns = sorted(set(input().lower()))\n\nprint('YES') if alphabet == s else print('NO')\n", "def ispangram(str):\r\n alphabet =\"abcdefghijklmnopqrstuvwxyz\"\r\n for char in alphabet:\r\n if char not in str.lower():\r\n return False\r\n return True\r\n \r\nn=int(input())\r\ns=input()\r\nif(ispangram(s)==True):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "n = int(input())\r\nd = {}\r\ns = input()\r\ncount = 0\r\nfor i in s:\r\n x = i.lower()\r\n if x not in d:\r\n d[x] = 1\r\n count = count + 1\r\n else:\r\n d[x] = d[x] + 1\r\nif count==26:\r\n print('YES')\r\nelse:\r\n print('NO')", "a = input()\nb = input()\n\n\ndef pan(b):\n\talphabet = 'abcdefghijklmnopqrstuvwxyz'\n\tfor h in alphabet:\n\t\tif h not in b.lower():\n\t\t\treturn False\t\t\t\n\t\n\treturn True\n\t\t\t\nif(pan(b) == True):\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n\n\t", "n = int(input())\r\nprint(('NO', 'YES')[len({x for x in input().lower()}) == 26])\r\n", "n=int(input())\nn1=input()\nn1=n1.lower()\nl1=[]\nfor i in range(97,123):\n l1.append(chr(i))\ncount=0\nfor i in l1:\n if i in n1:\n count+=1\nif count==26:\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", "def main():\r\n # Reading multiple test cases\r\n n = int(input())\r\n word = input().strip().lower() # string values\r\n \r\n\r\n if len(set(word)) == 26:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n\r\nif __name__ == \"__main__\":\r\n main()", "import string\r\nalp = list(string.ascii_lowercase)\r\nn = int(input())\r\nw = input().lower()\r\ncount = 0\r\nalrd=[]\r\nfor i in w:\r\n if i in alp and i not in alrd:\r\n count+=1\r\n alrd.append(i)\r\n\r\nif count==len(alp):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\ns=input()\r\nt='qwertyuiopasdfghjklzxcvbnm'\r\nl=''\r\nl=s.lower()\r\nz=0;\r\nm=''\r\nm=set(l);\r\n\r\n\r\nfor i in m:\r\n \r\n if i in t:\r\n z+=1;\r\n\r\nif z==len(t):\r\n print('YES');\r\nelse:\r\n print('NO');\r\n \r\n", "def panagram(string):\r\n for i in range(65, 91):\r\n if chr(i) not in string:\r\n return \"NO\"\r\n return \"YES\"\r\n\r\nsize = int(input())\r\nstring = input().upper()\r\n\r\nif size < 26:\r\n print(\"NO\")\r\nelse:\r\n print(panagram(string))", "n = int(input())\r\nstring = input().lower()\r\n\r\n# Convert the string to lowercase and create a set of unique letters\r\nunique_letters = set(string)\r\n\r\n# Check if the count of unique letters is 26\r\nif len(unique_letters) == 26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\nx=input().lower()\r\nif len(set(x))==26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import string\n \ndef ispangram(str):\n alphabet = \"abcdefghijklmnopqrstuvwxyz\"\n for char in alphabet:\n if char not in str.lower():\n return False\n \n return True\nn=int(input())\nstring = input()[:n]\nif(ispangram(string) == True):\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", "from string import ascii_lowercase\r\n\r\nif int(input())<26:\r\n print(\"NO\")\r\n\r\nelse:\r\n if sorted(set(list(input().lower()))) == list(ascii_lowercase):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "n = int(input())\r\ns = input().upper()\r\n\r\nif n >= 26:\r\n for letter in range(65, 91): # ASCII values for 'A' to 'Z'\r\n if chr(letter) not in s:\r\n print(\"NO\")\r\n break\r\n else:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\ns = input().lower()\r\n\r\n# Check if all letters of the alphabet are present\r\nis_pangram = all(chr(i) in s for i in range(ord('a'), ord('z') + 1))\r\n\r\n# Output the result\r\nif is_pangram:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "input();print('YNEOS'[len(set(input().upper()))<26::2])", "n=int(input())\ns=input().lower()\na=set(s)\nif len(a)==26:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n\t\t \t \t\t\t\t\t \t\t\t\t \t \t \t\t", "n = int(input())\r\ns = input().lower()\r\nunique_letters = set(s)\r\nif len(unique_letters) == 26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\nl1=(input())\r\nl1=l1.lower()\r\nl1=list(l1)\r\nl2=set(l1)\r\nif(len(l2)>=26):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\ns = input()\r\n\r\nlist = []\r\nfor c in s.lower():\r\n if c in list:\r\n continue\r\n list.append(c)\r\n\r\nif len(list) == 26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "t = int(input())\r\nip = input()\r\nif len(set(ip.upper())) == 26:\r\n print('YES')\r\nelse:\r\n print('NO')", "n=int(input())\ns=input()\nif n<26:\n print(\"NO\")\nelse:\n alpha = \"abcdefghijklmnopqrstuvwxyz\"\n s=s.lower()\n st=set(s)\n if(len(st)==26):\n print(\"YES\")\n else:\n print(\"NO\")\n \n \n \n\n \t\t\t\t\t \t \t \t\t \t\t\t\t\t\t \t \t\t\t", "#program\n\ndef check_pangram(n, s):\n s = s.lower().replace(\" \", \"\")\n unique_chars = set(s)\n if len(unique_chars) == 26:\n return \"YES\"\n else:\n return \"NO\"\nn = int(input())\ninput_string = input()\nresult = check_pangram(n, input_string)\nprint(result)\n\t\t \t \t \t \t\t\t\t\t \t\t\t\t", "import string\r\n\r\ndef panagram(arr):\r\n alphabets = list(string.ascii_lowercase)\r\n c = 0\r\n for i in alphabets:\r\n if i in arr:\r\n c = c + 1 \r\n return \"YES\" if (c == 26) else \"NO\"\r\nn = int(input())\r\narr = list(input().lower())\r\n\r\nprint(\"NO\") if (n < 26) else print(panagram(arr)) ", "#Coder_1_neel\r\n\r\na=int(input())\r\ns=input()\r\nt=s.lower()\r\nt=set(t)\r\nd=set()\r\nfor char in t:\r\n if 'a'<=char<='z':\r\n d.add(char) \r\n\r\nif(len(d)==26):\r\n print(\"YES\") \r\nelse:\r\n print(\"NO\") ", "t = int(input()) # length of the string\r\nx = input().upper()\r\nz = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"#alphabet 26 letters\r\nm = 0\r\nif len(x) < len(z): \r\n print(\"NO\")\r\nelse:\r\n while m < len(x):\r\n if z.find(x[m]) != -1:\r\n z = z.replace(x[m], '') # remove the letter from the alphabet list # you must put z = z.replace don't forget\r\n m = m + 1\r\n #print(z)\r\n if not z:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n=int(input())\r\nstring=input()\r\nletter_set=set()\r\nstring=string.lower()\r\nfor char in string:\r\n if 'a'<= char <='z':\r\n letter_set.add(char)\r\nif len(letter_set)==26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "n = int(input())\r\nm = input()\r\nm=m.lower()\r\np=set(m)\r\nif len(p)==26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\ns = str(input()).lower()\r\nif len(s)==n:\r\n ls =[]\r\n for i in s:\r\n ls = ls + list(i)\r\n if (('a' in ls) and ('b' in ls) and ('c' in ls) and ('d' in ls) and ('e' in ls) and ('f' in ls) and ('g' in ls) and ('h' in ls) and ('i' in ls) and ('j' in ls) and ('k' in ls) and ('l' in ls) and ('m' in ls) and ('n' in ls) and ('o' in ls) and ('p' in ls) and ('q' in ls) and ('r' in ls) and ('s' in ls) and ('t' in ls) and ('u' in ls) and ('v' in ls) and ('w' in ls) and ('x' in ls) and ('y' in ls) and ('z' in ls)):\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "n=int(input())\r\ns=input()\r\n\r\nss=s.lower()\r\nse=set(ss)\r\nif(len(se)>=26):\r\n print('YES')\r\nelse:\r\n print('NO')", "n = input()\r\nprint('YES' if set('abcdefghijklmnopqrstuvwxyz') <= set(input().lower()) else 'NO')", "n=int(input())\r\ns=input()\r\nchar_set=set()\r\n\r\nfor char in s:\r\n char=char.lower()\r\n if 'a'<=char<= 'z':\r\n char_set.add(char)\r\n\r\nif len(char_set)==26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "# Read input\r\nn = int(input())\r\nstring = input().lower()\r\n\r\n# Create a set to store unique characters\r\nunique_chars = set()\r\n\r\n# Iterate through the characters and add them to the set\r\nfor char in string:\r\n if char.isalpha():\r\n unique_chars.add(char)\r\n\r\n# Check if all letters are present\r\nif len(unique_chars) == 26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n= int(input())\r\nstringg= input()\r\nalph=set(\"abcdefghijklmnopqrstuvwxyz\")\r\nx=set(stringg.lower())\r\nif alph.issubset(x):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "input()\r\nn = len(set(map(str,input().lower())))\r\nif n == 26:\r\n print('YES')\r\nelse:\r\n print('NO')", "import string\nn=int(input())\ns=input().lower()\nal=list(string.ascii_lowercase)\nn=set(s)\nl=len(n)\nl1=len(al)\nif l==l1:\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", "def is_pangram(n, s):\r\n alphabet = set('abcdefghijklmnopqrstuvwxyz')\r\n s = set(s.lower())\r\n return \"YES\" if s >= alphabet else \"NO\"\r\n\r\n# Input\r\nn = int(input())\r\ns = input()\r\n\r\n# Output\r\nresult = is_pangram(n, s)\r\nprint(result)", "l=[0]*26\r\nn=int(input())\r\ns=input()\r\nif n<26:\r\n print(\"NO\")\r\nelse:\r\n for i in s:\r\n x=i.upper()\r\n ind=ord(x)-65\r\n l[ind]=1\r\n if l.count(0)==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n=int(input())\r\nstr=input()\r\nlst=['q','w','e','r','t','y','u','i','o','p','a','s','d','f','g','h','j','k','l','z','x','c','v','b','n','m']\r\nlst=set(lst)\r\nStr=set(str.lower())\r\nif Str==lst:\r\n print('YES')\r\nelse:\r\n print('NO')", "def is_pangram(s):\r\n unique_letters = set()\r\n for char in s:\r\n if char.isalpha():\r\n unique_letters.add(char.lower())\r\n return len(unique_letters) == 26\r\nn = int(input())\r\nstring = input()\r\nif is_pangram(string):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def is_pangram(s):\r\n alphabet = set(\"abcdefghijklmnopqrstuvwxyz\")\r\n s = s.lower()\r\n return set(s) >= alphabet\r\n\r\nn = int(input())\r\ns = input()\r\n\r\nif is_pangram(s):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\na=input()\nc=0\na=a.lower()\nl=['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']\nfor i in l:\n\tif i in a:\n\t\tc+=1\n\telse:\n\t\tbreak\nif c==26:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\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\nc=a.lower()\r\nb=set(c)\r\nif len(b)==26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s='ABCDEFGHIJKLMNOPQRSTUVWXYZ'\r\nn=int(input())\r\nt=input().upper()\r\nb=True\r\nfor i in s:\r\n if i not in t:\r\n b=False\r\n break\r\nif b:\r\n print('YES')\r\nelse:\r\n print('NO')", "n=int(input())\r\nstring=input().strip()\r\nuni=set()\r\nfor i in string:\r\n if i.isalpha():\r\n uni.add(i.lower())\r\nif len(uni) == 26:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def solve():\r\n x = int(input())\r\n s = input().lower()\r\n st = set()\r\n st.update(list(s))\r\n print('YES' if len(st) == 26 else 'NO')\r\n\r\n\r\n# t = int(input())\r\nt = 1\r\nwhile t:\r\n solve()\r\n t -= 1\r\n", "a=int(input())\r\nb=input()\r\nif len(set(b.lower()))==26: print('YES')\r\nelse: print('NO')", "n=int(input())\nstr=input().lower()\nunique=set()\nfor i in str:\n if i.isalpha():\n unique.add(i)\nif len(unique)==26:\n print(\"Yes\")\nelse:\n print(\"No\")\n \t\t\t\t\t \t \t \t\t\t \t\t \t \t", "input();print(\"YNEOS\"[len({*input().upper()})<26::2])", "num = int(input())\r\nword = str(input())\r\nalphabet = 'abcdefghijklmnopqrstuvwxyz'\r\nword = word.lower()\r\nc = 0\r\nfor i in alphabet:\r\n if i in word:\r\n c += 1\r\nif c == 26:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n", "n = int(input()) \r\nstring = input()\r\n\r\nunique_chars = set(string.lower())\r\n\r\nalphabet_chars = set(\"abcdefghijklmnopqrstuvwxyz\")\r\n\r\nif unique_chars == alphabet_chars:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def is_pangram(s):\r\n alphabet = set(\"abcdefghijklmnopqrstuvwxyz\")\r\n s_lower = s.lower()\r\n \r\n for char in s_lower:\r\n if char.isalpha():\r\n alphabet.discard(char)\r\n if not alphabet:\r\n return \"YES\"\r\n \r\n return \"NO\"\r\n\r\nn = int(input().strip())\r\ns = input().strip()\r\n\r\nresult = is_pangram(s)\r\nprint(result)\r\n", "n=int(input())\r\ns=input().upper()\r\nl='ABCDEFGHIJKLMNOPQRSTUVWXYZ'\r\ni=0\r\nfor i in range(26):\r\n if l[i] in s:\r\n i=1\r\n else:\r\n i=0\r\n print('NO')\r\n break\r\nif i==1:\r\n print('YES')", "t=int(input())\ns=(str(input()))\nu=''\ns=s.lower()\n\nfor i in s:\n if i not in u and i!=' ':\n u+=i\n else:\n pass\nif len(u)==26:\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", "a = [0] * 26\nstr = \"\"\n\nwhile True:\n try:\n n = int(input())\n a = [0] * 26\n str = input()\n \n for i in range(len(str)):\n if str[i].islower():\n a[ord(str[i]) - ord('a')] = 1\n elif str[i].isupper():\n a[ord(str[i]) - ord('A')] = 1\n \n ans = sum(a)\n \n if ans == 26:\n print(\"YES\")\n else:\n print(\"NO\")\n except EOFError:\n break\n \t\t \t \t \t\t\t \t \t\t\t \t \t", "n = input()\r\ns = input().lower()\r\n\r\nlst = [0]*26\r\n\r\nfor i in s:\r\n lst[ord(i)%97] = 1 \r\n\r\n\r\nif set(lst) == {1}:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "# Input the number of characters in the string\nn = int(input())\n\n# Input the string\ns = input()\n\n# Convert the string to lowercase\ns = s.lower()\n\n# Define a set of all lowercase Latin letters\nalphabet = set('abcdefghijklmnopqrstuvwxyz')\n\n# Initialize an empty set for the letters in the string\nletters = set()\n\n# Loop through the string\nfor c in s:\n # If the character is a letter, add it to the letters set\n if c.isalpha():\n letters.add(c)\n\n# Check if the letters set is equal to the alphabet set\nif letters == alphabet:\n # Print \"YES\" if the string is a pangram\n print(\"YES\")\nelse:\n # Print \"NO\" otherwise\n print(\"NO\")\n\n\t \t\t \t \t \t\t\t\t \t\t \t \t \t", "# Pangram\r\n\r\nalphabet = list(\"abcdefghijklmnopqrstuvwxyz\")\r\n\r\namount = int(input())\r\nstring = list(input().lower())\r\n\r\npangram = True\r\n\r\nfor letter in alphabet:\r\n if letter not in string:\r\n pangram = False\r\n\r\nif pangram:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\r\nimport string\r\n\r\n\r\nalpha = string.ascii_lowercase\r\n\r\nlength = int(input())\r\nword = input().lower()\r\n\r\n\r\nv = True\r\ni = 0\r\nwhile v and i < len(alpha):\r\n if not alpha[i] in word:\r\n v = False\r\n else:\r\n i+= 1\r\n\r\nif v :\r\n print('YES')\r\nelse:\r\n print('NO')", "a=int(input())\nb=input()\nb=b.lower()\nb=set(b)\nb=list(b)\nb=sorted(b)\nl=['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']\nif b==l:\n print(\"YES\")\nelse:\n print(\"NO\")\n \n \t \t \t \t\t\t\t\t \t\t \t", "nq=int(input())\r\ns=input()\r\ns=s.lower()\r\nl=set(\"abcdefghijklmnopqrstuvwxyz\")\r\nfor cr in s:\r\n\tif cr in l:\r\n\t\tl.remove(cr)\r\nif not l:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "n=int(input())\r\nch=input()\r\nx=\"abcdefghijklmnopqrstuvwxyz\"\r\ni=0\r\nwhile i<n:\r\n if n<26:\r\n break\r\n if (ch[i].lower()) in x :\r\n x=x[:x.index(ch[i].lower())]+x[x.index(ch[i].lower())+1:]\r\n i+=1\r\n if (len(x)==0):\r\n print(\"YES\")\r\n break\r\nif (len(x)>0):\r\n print(\"NO\")\r\n", "def result(flagg):\r\n if flagg:\r\n return 'YES'\r\n else:\r\n return 'NO'\r\n\r\n\r\nn = int(input())\r\nsentence = [ord(i) for i in list(input())]\r\nflag = True\r\nfor i in range(len(sentence)):\r\n if sentence[i] < 91:\r\n sentence[i] += 32\r\nfor i in range(97, 123):\r\n if i not in sentence:\r\n flag = False\r\n break\r\nprint(result(flag))\r\n", "n = int(input())\ns= input().lower() \nz= set(s)\nif len(z) == 26:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\t \t \t \t \t \t\t \t\t \t\t\t\t", "n=int(input())\r\ns=input().strip()\r\nx=\"abcdefghijklmnopqrstuvwxyz\"\r\nc=0\r\nfor i in x:\r\n if i not in s.lower():\r\n c=1\r\n print(\"NO\")\r\n break\r\nif c==0:\r\n print(\"YES\")" ]

[ "def mypow(a,b,c):\r\n ans = 1\r\n while b:\r\n if b&1:\r\n ans*=a%c\r\n b>>=1\r\n a*=a%c\r\n return ans\r\na, b = map(int, input().split())\r\nu = 10 * b - 1\r\nv = mypow(10, a - 1, u) - b\r\nfor y in range(b, 10):\r\n if (y * v) % u == 0:\r\n q = d = 9 * y\r\n while q % u: \r\n q = 10 * q + d\r\n q = str(q // u)\r\n print(q * (a // len(q)))\r\n exit()\r\nprint('Impossible')", "p, k = map(int, input().split())\nu = 10 * k - 1\nv = pow(10, p - 1, u) - k\nfor y in range(k, 10):\n if (y * v) % u == 0:\n q = d = 9 * y\n while q % u: q = 10 * q + d\n q = str(q // u)\n print(q * (p // len(q)))\n break\nelse: print('Impossible')", "p , x = list(map(int, input().split()))\r\n\r\nmod = 10*x - 1\r\n\r\nfor d in range(1,10):\r\n n1 = d*(pow(10,p,mod) - 1)\r\n n1 %= mod\r\n \r\n if(n1 == 0 and (d/mod > 0.1)):\r\n\r\n l = []\r\n l.append(d)\r\n carry = 0\r\n \r\n for i in range(p-1):\r\n cur = l[-1]*x + carry\r\n carry = cur//10\r\n l.append(cur%10)\r\n\r\n l = l[::-1]\r\n for i in l:\r\n print(i,end='')\r\n break\r\nelse:\r\n print(\"Impossible\")\r\n \r\n \r\n \r\n", "P, K = map(int, input().split())\r\nU = 10 * K - 1\r\nV = pow(10, P - 1, U) - K\r\nfor y in range(K, 10):\r\n\tif (y * V) % U == 0:\r\n\t\tq = 9 * y\r\n\t\td = q\r\n\t\twhile q % U != 0: \r\n\t\t\tq = 10 * q + d\r\n\t\ttem = str(q // U)\r\n\t\tfor i in range(P // len(tem)):\r\n\t\t\tprint(tem, end = '')\r\n\t\texit(0)\r\nprint('Impossible')", "p, k = map(int, input().split())\r\nu = 10 * k - 1\r\nv = pow(10, p - 1, u) - k\r\nfor y in range(k, 10):\r\n if (y * v) % u == 0:\r\n q = d = 9 * y\r\n while q % u: q = 10 * q + d\r\n q = str(q // u)\r\n print(q * (p // len(q)))\r\n break\r\nelse: print('Impossible')", "p,k = input().split()\n\np = int (p)\nk = int (k)\n\ny = 10*k -1\nx = ((10 ** (p-1)) - k) % y\n\n\nb = True\n\nfor i in range(k,10):\n\tif( (x*i % y) == 0):\n\t\t#z = (x*i) // y \n\t\t#print(z*10 + i)\n\t\t\n\t\tz = i*10\n\t\t\n\t\twhile( (z-i)%y ):\n\t\t\tz *= 10\n\t\t\t\n\t\tpart = str ((z-i)//y)\n\t\tprint(part * (p//len(part)))\n\t\tb= False\n\t\tbreak\n\nif(b):\n\tprint(\"Impossible\")\n\n\n\t\t \t \t \t \t \t\t \t \t\t", "p,k = input().split()\r\n\r\np = int (p)\r\nk = int (k)\r\n\r\ny = 10*k -1\r\nx = ((10 ** (p-1)) - k) % y\r\n\r\n\r\nb = True\r\n\r\nfor i in range(k,10):\r\n\tif( (x*i % y) == 0):\r\n\t\t#z = (x*i) // y \r\n\t\t#print(z*10 + i)\r\n\t\t\r\n\t\tz = i*10\r\n\t\t\r\n\t\twhile( (z-i)%y ):\r\n\t\t\tz *= 10\r\n\t\t\t\r\n\t\tpart = str ((z-i)//y)\r\n\t\tprint(part * (p//len(part)))\r\n\t\tb= False\r\n\t\tbreak\r\n\r\nif(b):\r\n\tprint(\"Impossible\")\r\n\r\n" ]

[ "import sys\r\nn,k=map(int,input().split())\r\na=[]\r\nif(n==k):\r\n print(\"-1\")\r\n sys.exit()\r\nfor i in range(n):\r\n a.append(i+1)\r\nfor j in range(n-k-1):\r\n a[j],a[j+1]=a[j+1],a[j]\r\nprint(*a)", "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\n\r\nn, k = list(map(int, input().split()))\r\nif k == n:\r\n print(-1)\r\n exit()\r\n\r\nans = list(range(n-k+1, n+1))\r\nnew_n = n-k\r\nfor i in range(1, new_n+1):\r\n print(i%new_n + 1, end=\" \")\r\nprint(*ans)", "\r\nn,k = map(int,input().split())\r\n\r\nif k<n:\r\n ans = [1]\r\n count = 0\r\n for i in range(2,n+1):\r\n if count == k:\r\n ans.append(i+1)\r\n else:\r\n ans.append(i)\r\n count+=1\r\n hare = set(ans)\r\n for i in range(1,n+1):\r\n if i not in hare:\r\n ans[0] = i\r\n ans[-1] = 1\r\n break\r\n print(*ans)\r\nelse:\r\n print(-1)", "n,k=map(int,input().split())\r\nif n==k:\r\n print(-1)\r\nelse:\r\n arr=[i for i in range(1,n+1)]\r\n var=n-k\r\n arr.remove(var)\r\n arr.insert(0,var)\r\n print(*arr)\r\n", "n, k = map(int, input().split())\nres = []\n\nif(n < k + 1):\n print(-1)\nelse:\n for i in range(2, n - k + 1):\n res.append(i)\n res.append(1)\n for i in range(n - k + 1, n + 1):\n res.append(i)\n print(*res)\n\t\t\t\t\t\t \t \t \t \t \t \t \t", "ab = list(map(int,input().split()))\na = ab[0]\nb = ab[1]\nc = a-b\n\nsaida = \"\"\nif(a == b):\n print(-1)\nelse:\n saida += str(c) + \" \"\n i = 1\n while(i < c):\n saida += str(i) + \" \"\n i += 1\n for j in range(c+1,a+1):\n saida += str(j) + \" \"\n \nprint(saida.strip())\n \t \t \t\t \t\t \t \t\t\t\t\t\t\t\t\t \t\t \t", "#!/usr/bin/env python3\n\n# ------------------------------\n# cs104c/assignment7/CutRibbon.py\n# Copyright (C) 2017\n# Drew Romanyk\n# ------------------------------\n\n# -------\n# imports\n# -------\n\nimport math\nimport sys\n\n\n# -------\n# solve\n# -------\n\ndef solve(r, w):\n \"\"\"\n :param r:\n :param w:\n :return:\n \"\"\"\n\n data = [int(v) for v in r.readline().split()]\n n = data[0]\n k = data[1]\n\n if n == k:\n print(-1)\n else:\n ans = [i for i in range(n+1)]\n for i in range(n-k,1,-1):\n ans[i] = ans[i-1]\n ans[1] = n - k\n\n del ans[0]\n for elem in ans:\n print(elem, end=\" \")\n\n\n# -------\n# main\n# -------\n\nif __name__ == \"__main__\":\n solve(sys.stdin, sys.stdout)\n", "def gcd(a, b):\r\n while (a != 0 and b != 0):\r\n if a > b:\r\n a = a % b\r\n else:\r\n b = b % a\r\n return (a + b) // 2\r\nn, k = [int(i) for i in input().split()]\r\nif n <= k:\r\n print('-1')\r\nelse:\r\n a = [i + 1 for i in range(n)]\r\n for i in range(n - k - 1, 0, -1):\r\n a[i] = a[i - 1]\r\n a[0] = n - k\r\n print(*a)", "n, k = map(int, input().split())\r\ngate = True\r\nif k > n-1:\r\n gate = False\r\n\r\noperations = n - k -1\r\ncurrent, last = 0, n-1\r\nnumbers = list(range(1, n+1))\r\n\r\nwhile operations > 0 and k < n-1 and gate:\r\n operations -= 1\r\n numbers[current], numbers[last] = numbers[last], numbers[current]\r\n last -= 1\r\n\r\nprint(*numbers) if gate else print(-1)\r\n", "n,k=map(int,input().split())\r\nl=[]\r\nif(n==k):\r\n print(-1)\r\nelse:\r\n for i in range(n):\r\n l.append(i+1)\r\n for i in range(n-k-1):\r\n l[i],l[i+1]=l[i+1],l[i]\r\n print(*l)\r\n", "n, k= map(int, input().split())\r\n\r\nif n == k:\r\n print(-1)\r\nelif k == n-1:\r\n a= list(range(1, n+1))\r\n print(*a)\r\nelse:\r\n a= [n]\r\n i= 2\r\n for j in range(k):\r\n a.append(i)\r\n i += 1\r\n a.append(1)\r\n m= len(a)\r\n for j in range(n-m):\r\n a.append(i)\r\n i += 1\r\n print(*a)\r\n ", "n, k=map(int,input().split())\r\nif n==k: print(-1)\r\nelse:\r\n x=n-k\r\n for i in range(2,x+1): print(i,end=' ')\r\n print(1, end=' ')\r\n for i in range(x+1,n+1): print(i,end=' ')", "n, k = map(int, input().split())\nif n != k:\n index = 0\n res = n * [\"0\"]\n res[index] = str(n - k)\n index += 1\n for i in range(1, n - k):\n res[index] = str(i)\n index += 1\n\n for i in range(n - k + 1, n + 1):\n res[index] = str(i)\n index += 1\n\n print(\" \".join(res))\n \nelse:\n print(\"-1\")\n\t \t \t \t\t\t \t\t\t \t \t \t \t\t\t \t", "n,k=map(int,input().split())\r\n\r\nif(n==k):\r\n\tprint(-1)\r\nelse:\r\n\tans=[]\r\n\tans.append(n-k)\r\n\tfor i in range(1,n-k):\r\n\t\tans.append(i)\r\n\tfor i in range(n-k+1,n+1):\r\n\t\tans.append(i)\r\n\tprint(*ans)", "#!/usr/bin/env python\n# -*- coding: utf-8 -*-\n\nn, k = map(int, input().split())\nif n == k:\n print(-1)\nelse:\n print(' '.join(map(str, list(range(2, n-k+1)) + [1] + list(range(n-k+1, n+1)))))\n", "n, k = [int(x) for x in input().split()]\npermutation = ['1']\n\nif n == 1 and k == 0:\n print(1)\nelif n == 1 or n == k:\n print(-1)\nelse:\n for i in range(k):\n permutation.append(str(i + 2))\n num = k + 2\n z = 0\n\n while num <= n:\n if z == 0:\n permutation.append(str(num + 1))\n z = 1\n else:\n permutation.append(str(num - 1))\n z = 0\n num += 1\n\n if int(permutation[-1]) > n:\n permutation.pop(-1)\n permutation[0] = str(n)\n permutation.append('1')\n\n print(' '.join(permutation))\n \t\t \t\t \t\t \t \t\t \t \t \t \t \t\t", "def permutacaoBonita(num, numBonitos):\n permutacao = list(range(num + 1))\n numNaoBonitos = num - numBonitos\n if numNaoBonitos == 0:\n return [0, -1]\n \n if numNaoBonitos == 1:\n return permutacao\n\n i = 0\n if numNaoBonitos % 2 == 0:\n i = 1\n else:\n i = 2 \n\n while i <= numNaoBonitos:\n permutacao[i] = i + 1\n permutacao[i + 1] = i\n i += 2\n\n return permutacao\n\nentrada = input().split()\nnum = int(entrada[0])\nnumBonitos = int(entrada[1])\n\npermutacao = permutacaoBonita(num, numBonitos)\npermutacao.remove(0)\nprint(*permutacao)\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\nif k>n-1:\r\n print(-1)\r\nelse:\r\n a=n-k\r\n ans=[n-k]\r\n c=1\r\n d=2\r\n for i in range(1,n-k):\r\n if (i+1)%2:\r\n ans.append(d)\r\n d+=2\r\n else:\r\n ans.append(c)\r\n c+=2\r\n for i in range(n-k,n):\r\n ans.append(i+1)\r\n print(*ans)\r\n \r\n \r\n", "x,y = list(map(int,input().split()))\nresult = []\nresultado = ''\nsaida = \"\"\nif(x == y):\n print(-1)\n exit()\n\nresult.append(x-y)\ni = 1\nwhile(i < (x-y)):\n result.append(i)\n i += 1\n\nfor num in range(((x-y)+1),x+1):\n result.append(num)\n\n\nfor i in range(len(result)):\n resultado += str(result[i]) + ' '\n\nprint(resultado)\n\t\t \t \t\t\t\t \t \t \t \t \t\t \t\t\t", "n,k=map(int,input().split())\r\nif k>=n:\r\n print(-1)\r\nelse:\r\n if k==n-1:\r\n for i in range(n):\r\n print(i+1,end=\" \")\r\n else:\r\n a=[0]*n\r\n for i in range(k+1):\r\n a[i]=i+1\r\n j=i+1\r\n for i in range(j,n):\r\n a[i]=i+2\r\n a[0]=j+1\r\n a[-1]=1\r\n print(*a)", "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, k = get_ints_in_variables()\r\n if n == k:\r\n print(-1)\r\n return\r\n elif k == n-1:\r\n for i in range(1, n+1):\r\n print(i, end=\" \")\r\n return\r\n else:\r\n arr = []\r\n for i in range(1, n+1):\r\n arr.append(0)\r\n\r\n task = 0\r\n num = 2\r\n idx = 1\r\n while idx < n and task < k:\r\n arr[idx] = num\r\n num += 1\r\n idx += 1\r\n task += 1\r\n \r\n # gcd(idx, idx+1) <= 1 so num = num+1\r\n tmpNum = num\r\n num += 1\r\n\r\n while idx < n and num <= n:\r\n arr[idx] = num\r\n idx += 1\r\n num += 1\r\n \r\n arr[0] = tmpNum\r\n arr[n-1] = 1\r\n\r\n for i in range(0, n):\r\n print(arr[i], end=\" \")\r\n\r\n# calling main Function\r\nif __name__ == \"__main__\":\r\n main()", "n, k = map(int, input().split())\nresultado = [0] * n\nindex = 0\n\nif n == k:\n print(-1)\nelse:\n for i in range(2, n - k + 1):\n resultado[index] = i\n index += 1\n\n resultado[index] = 1\n index += 1\n\n for i in range(n - k + 1, n + 1):\n resultado[index] = i\n index += 1\n\n print(*resultado)\n\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\nif n == k:\r\n print(-1)\r\nelif k == n-1:\r\n print(*[i for i in range(1, n+1)])\r\nelse:\r\n lst = [n-k]+[i for i in range(1, n-k)]+[j for j in range(n-k+1, n+1)]\r\n print(*lst)\r\n", "n,k=map(int,input().split())\r\nans=[i+1 for i in range(n)]\r\nif(k==n):\r\n print(-1)\r\nelse:\r\n temp=n-k\r\n \r\n if(temp==1):\r\n print(*ans)\r\n exit()\r\n if(temp%2==1):\r\n temp-=1\r\n for i in range((temp)//2):\r\n j=2*i+1\r\n m=j+1\r\n ans[j],ans[m]=ans[m],ans[j]\r\n print(*ans)\r\n else:\r\n \r\n temp=temp//2\r\n for i in range((temp)):\r\n j=2*i\r\n m=j+1\r\n ans[j],ans[m]=ans[m],ans[j]\r\n print(*ans)\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n,k=map(int,input().split())\r\nif k==n:\r\n print(-1)\r\nelse:\r\n res=n-k\r\n for i in range(1,res):\r\n print(i+1,end=' ')\r\n print(1,end=' ')\r\n for i in range(res+1,n+1):\r\n print(i,end=' ')\r\n ", "\r\nn,k=map(int,input().split())\r\nans=[1]\r\nif k==n:\r\n print(-1)\r\nelse:\r\n count_=2\r\n while count_<=n:\r\n if k>0:\r\n ans.append(count_)\r\n k-=1\r\n count_+=1\r\n else:\r\n if n-count_>=1:\r\n ans.append(count_+1)\r\n ans.append(count_)\r\n count_+=2\r\n else:\r\n ans[0]=count_\r\n ans.append(1)\r\n count_+=2\r\n print(*ans)", "#!/usr/bin/python3\n\ndef readln(): return tuple(map(int, input().split()))\n\nn, k = readln()\nif n == k:\n print(-1)\nelse:\n print(*(list(range(2, n - k + 1)) + [1] + list(range(n - k + 1, n + 1))))\n", "import math\r\nn,k = map(int, input().strip().split(' '))\r\n#n=int(input())\r\n#lst = list(map(int, input().strip().split(' ')))\r\nl=[0]*n\r\nif k==n:\r\n print(-1)\r\nelif k==n-1:\r\n for j in range(n):\r\n print(j+1,end=\" \")\r\n print()\r\nelse:\r\n for j in range(1,k+1):\r\n l[j]=j+1\r\n for j in range(k+2,n):\r\n l[j]=j\r\n l[k+1]=1\r\n l[0]=n\r\n for j in range(n):\r\n print(l[j],end=\" \")\r\n print()\r\n \r\n ", "n,k = input().split()\r\nn, k = int(n), int(k)\r\n\r\nif n==k:\r\n print(-1)\r\nelse:\r\n lt = [n-k] + [i for i in range(1,n-k)] + [i for i in range(n-k+1,n+1)]\r\n print(*lt)\r\n \r\n \r\n \r\n\r\n", "n,k = map(int,input().split())\r\nl=[]\r\nif n==k:\r\n print(-1)\r\nelse:\r\n for i in range(2,n-k+1):\r\n l.append(i)\r\n l.append(1)\r\n for j in range(n-k+1,n+1):\r\n l.append(j)\r\nprint(*l)", "n, k = map(int, input().split())\n\nif n == k:\n print(-1)\n exit()\n\nout1 = str(n - k)\nout2 = \"\"\nfor i in range(2, n + 1):\n if n - k + 1 > i:\n out2 += str(i - 1) + \" \"\n else:\n out2 += str(i) + \" \"\nprint(out1 + \" \" + out2)\n\t \t \t\t \t \t\t \t \t\t \t\t \t \t\t\t", "n, k = map(int, input().split())\r\nif k>=n:\r\n print(-1)\r\nelse:\r\n l = [x for x in range(1, n+1)]\r\n if k-1!=n:\r\n l.insert(n-k, 1)\r\n l.pop(0)\r\n print(*l)\r\n\r\n", "n, k = map(int, input().split())\r\nif n-1 < k:\r\n print(-1); exit()\r\nif n-1 == k:\r\n print(*[i for i in range(1, n+1)])\r\nelse:\r\n print(n, end = ' ')\r\n for i in range(2,k+2):\r\n print(i, end = ' ')\r\n print('1', end = ' ')\r\n for i in range(k+2, n):\r\n print(i, end = ' ')", "n,k = map(int,input().split())\r\nif n==k: print(-1)\r\nelse:\r\n\tflag,count,a = 0,0,[]\r\n\tfor i in range(1,n+1):\r\n\t\tif i==1:\r\n\t\t\ta.append(1)\r\n\t\telif count<k:\r\n\t\t\ta.append(i)\r\n\t\t\tcount+=1\r\n\t\telse:\r\n\t\t\tif i==n:\r\n\t\t\t\ta.append(1)\r\n\t\t\t\tif flag==0:\r\n\t\t\t\t\ta[0]=i\r\n\t\t\telif flag==0:\r\n\t\t\t\ta[0] = i\r\n\t\t\t\tflag=1\r\n\t\t\t\ta.append(i+1)\r\n\t\t\telse:\r\n\t\t\t\ta.append(i+1)\r\n\tprint(*a)", "entrada = input()\ntemp = entrada.split()\nnum_elementos = int(temp[0])\nnum_exclusoes = int (temp[1])\n\nif (num_exclusoes == num_elementos):\n print(-1)\nelse:\n print(num_elementos-num_exclusoes, end=\" \")\n\n for i in range(1, num_elementos-num_exclusoes):\n print(i, end= \" \")\n for i in range(num_elementos-num_exclusoes+1, num_elementos+1):\n print(i, end = \" \")\n \t\t \t\t\t\t \t\t \t \t\t", "vals = [int(x) for x in input().split()]\r\nn = vals[0]\r\nk = vals[1]\r\npermutation = [1]\r\nfor i in range(1,n):\r\n if i < k+1:\r\n permutation.append(i+1)\r\n else:\r\n num = 0\r\n if k % 2 == 0:\r\n num = i+2 if i % 2 != 0 else i\r\n else:\r\n num = i+2 if i % 2 == 0 else i\r\n if num > n:\r\n num = 1\r\n permutation[0] = i+1\r\n permutation.append(num)\r\nif k == n: \r\n print(-1)\r\nelse:\r\n print(\" \".join([str(x) for x in permutation]))", "n, p = map(int, input().split())\n\nif n == p:\n print(-1)\nelse:\n if p + 2 > n:\n print(1, end = \" \")\n else:\n print(p + 2, end = \" \")\n for i in range(1, p + 1):\n print(i + 1, end = \" \")\n if p + 1 < n:\n for i in range(p + 1, n - 1):\n print(i + 2, end = \" \")\n print(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\nif n == k:\r\n print(-1)\r\nelse:\r\n l = [n - k]\r\n for i in range(1, n + 1):\r\n if i != (n - k):\r\n l.append(i)\r\n print(*l)\r\n", "\r\nfrom collections import Counter, deque\r\nfrom functools import lru_cache\r\nimport heapq\r\nimport itertools\r\nimport math\r\nimport random\r\nimport sys\r\nfrom types import GeneratorType;\r\n\r\ndef bootstrap(f, stack=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n if stack:\r\n return f(*args, **kwargs)\r\n else:\r\n to = f(*args, **kwargs)\r\n while True:\r\n if type(to) is GeneratorType:\r\n stack.append(to)\r\n to = next(to)\r\n else:\r\n stack.pop()\r\n if not stack:\r\n break\r\n to = stack[-1].send(to)\r\n return to\r\n \r\n return wrappedfunc \r\n\r\n\r\n\r\n\r\nn, k = map(int, input().split())\r\n\r\n\r\n\r\ndef solve():\r\n \r\n \r\n\r\n if n == k:\r\n return [-1]\r\n \r\n if n == 1:\r\n return [1];\r\n \r\n result = [i + 1 for i in range(n)]; \r\n unPositioned = (n - 1) - k;\r\n positioned = (n - 1);\r\n \r\n start = 1;\r\n if unPositioned % 2 != 0:\r\n result[0], result[1] = result[1], result[0]\r\n positioned -= 1;\r\n start = 2;\r\n \r\n for i in range(start, n - 1, 2):\r\n if positioned == k:\r\n break;\r\n \r\n result[i], result[i + 1] = result[i + 1], result[i]\r\n positioned -= 2; \r\n return result; \r\n\r\nprint(*solve()) \r\n \r\n \r\n \r\n ", "n, k = map(int, input().split())\nif(n == k):\n print(-1)\nelse:\n output = \"\"\n for i in range(1, n-k):\n print(i+1, end=\" \")\n print(1, end=\" \")\n for i in range((n-k)+1, n+1):\n print(i, end=\" \")\n \t\t\t\t \t\t \t\t \t", "num = str(input()).split()\nf = True\n\nif (num[0] == num[1] or int(num[1]) > int(num[0])):\n f = False\n\na = int(num[0])\nb = int(num[1])\nsaida = str(a - b) + \" \"\nfor x in range(a - b - 1):\n saida += str(x+1) + \" \"\nfor y in range(a-b + 1, a + 1):\n saida += str(y) + \" \"\n\nif (f):\n print(saida)\nelse:\n print(\"-1\")\n \t\t \t\t\t\t \t \t \t\t \t\t \t \t\t", "num1, num2 = map(int,input().split())\n\npermutacoes_bonitas = ''\nif (num1 == num2):\n print(-1)\nelse:\n permutacoes_bonitas += str(num1 - num2) + ' '\n\n for i in range(1, num1 - num2):\n permutacoes_bonitas += str(i) + ' '\n for i in range(num1 - num2 + 1, num1 + 1):\n permutacoes_bonitas += str(i) + ' '\n\n print(permutacoes_bonitas)\n \t\t \t\t \t \t \t \t \t \t \t \t\t\t\t", "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,k=read_ints()\r\n\tif k==n:\r\n\t\tprint(-1)\r\n\t\treturn\r\n\tprint(\" \".join(map(str, list(range(2, n-k+1))+[1]+list(range(n-k+1, n+1)) )))\r\n\r\nsolve()\r\n", "n,k = list(map(int,input().split()))\r\nans = [i+1 for i in range(n)]\r\nif n==k:\r\n print(-1)\r\nelse:\r\n for i in range((n-k)%2,n-k,2):\r\n ans[i] = i+2\r\n ans[i+1] = i+1\r\n print(*ans)", "n,k=map(int,input().split())\r\n# list1=list(map(int,input().split()))\r\nlist2=[0]*(n)\r\nfor i in range(n):\r\n list2[i]=i+1\r\nif(n%2==0):\r\n if(k<n):\r\n k=n-k\r\n if(k%2==0):\r\n # k-=1\r\n for i in range(0,n,2):\r\n if(k>0):\r\n k-=2\r\n list2[i],list2[i+1]=list2[i+1],list2[i]\r\n else:\r\n break\r\n else:\r\n k-=1\r\n for i in range(1,n,2):\r\n if(k>0):\r\n k-=2\r\n list2[i],list2[i+1]=list2[i+1],list2[i]\r\n else:\r\n break\r\n print(*list2)\r\n else:\r\n print(-1)\r\nelse:\r\n if(k<n):\r\n k=n-k\r\n if(k%2==0):\r\n # k-=1\r\n for i in range(0,n,2):\r\n if(k>0):\r\n k-=2\r\n list2[i],list2[i+1]=list2[i+1],list2[i]\r\n else:\r\n break\r\n else:\r\n k-=1\r\n for i in range(1,n,2):\r\n if(k>0):\r\n k-=2\r\n list2[i],list2[i+1]=list2[i+1],list2[i]\r\n else:\r\n break\r\n print(*list2)\r\n else:\r\n print(-1)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\n\r\nif k == n:\r\n print(-1)\r\nelse:\r\n d = []\r\n if k + 1 == n:\r\n d += list(range(1, k + 2))\r\n else:\r\n d += [k+2] + list(range(2, k + 2)) + list(range(k+3, n+1)) + [1]\r\n print(' '.join(map(str, d)))", "n,k=[int(x) for x in input().split()]\r\n\r\nif k>=n:\r\n print(-1)\r\nelse:\r\n ans=[]\r\n for i in range(n-k-1):\r\n ans.append(i+2)\r\n ans.append(1)\r\n for i in range(k):\r\n ans.append(n-k+1+i)\r\n print(*ans)\r\n", "import sys\nimport math\nimport string\nimport operator\nimport functools\nimport fractions\nimport collections\nsys.setrecursionlimit(10**7)\ndX= [-1, 1, 0, 0,-1, 1,-1, 1]\ndY= [ 0, 0,-1, 1, 1,-1,-1, 1]\nRI=lambda: list(map(int,input().split()))\nRS=lambda: input().rstrip().split()\n#################################################\nn,k=RI()\nif n==k:\n print(-1)\nelse:\n print(n-k,end=\" \")\n for i in range(1,n-k):\n print(i,end=\" \")\n for i in range(n-k+1, n+1):\n print(i,end=\" \")\n", "n, k = map(int, input().split())\n\nif n == k:print (-1)\nelse:\n num = n-k\n ans = str(num)\n \n for i in range(1, num):\n \n ans += \" \" + (str(i))\n for j in range(num+1, n+1):\n ans += \" \" + (str(j))\n print(ans)\n\t\t\t\t \t\t \t \t \t \t\t\t \t \t\t \t", "n,k=(int(i) for i in input().split())\r\nif(n==k):\r\n print(-1)\r\nelse:\r\n l=[n-k]\r\n for i in range(1,n-k):\r\n l+=[i]\r\n for i in range(n-k+1,n+1):\r\n l+=[i]\r\n print(*l)", "numbers = input().split(\" \")\n\nn = int(numbers[0])\nk = int(numbers[1])\n\nif n == k:\n print(\"-1\")\n exit()\n\nans = \"\"\nfor i in range(1, n+1):\n if i == 1:\n result = (k+2-1)%n+1\n ans += f\"{result}\"\n elif i-1 <= k:\n ans += f\" {i}\"\n else:\n result = (i+1-1)%n+1\n ans += f\" {result}\"\n\nprint(ans)\n\n \t \t\t\t \t \t\t \t \t \t \t \t\t", "from sys import exit\r\nn,k=map(int,input().split())\r\nif(n-k==0):\r\n print('-1')\r\n exit(0)\r\narr=[n-k]+[i for i in range(1,n-k)]+[i for i in range(n-k+1,n+1)]\r\nprint(*arr,sep=' ')", "t = input()\r\ntemp = t.split()\r\nn = int(temp[0])\r\nk = int(temp[1])\r\n\r\nif (k == n):\r\n print(-1)\r\nelse:\r\n print(n-k,end =' ')\r\n\r\n for i in range(1,n-k):\r\n print(i,end=' ')\r\n for i in range(n-k+1, n+1):\r\n print(i,end=' ')\r\n", "n, k = [int(x) for x in input().split()]\r\nk = n-k\r\nif k==0:\r\n print(-1)\r\nelse:\r\n print(k,end=' ')\r\n for i in range(1,k):\r\n print(i,end=' ')\r\n for i in range(k+1,n+1):\r\n print(i,end=' ')", "x = list(map(int,input().strip().split()))[:2]\n\nn = x[0]\nk = x[1]\n\ncontou1 = False\nif (n-k > 1):\n resp = str(n) + \" \"\n count = 0\n\n for i in range(2,n):\n if (k > 0):\n resp += str(i) + \" \"\n count += 1\n k -= 1\n else:\n resp += \"1 \"\n contou1 = True\n break\n\n if contou1 == False:\n resp += \"1 \"\n\n for i in range(2+count,n):\n resp += str(i) + \" \"\n\n print(resp)\n\nelif (n-k == 1):\n resp = \"\"\n for i in range(1,n+1):\n resp += str(i) + \" \"\n print(resp.strip())\n\nelse:\n print(\"-1\")\n \t\t\t \t\t\t \t\t \t \t\t\t\t \t\t", "n, k = [int(x) for x in input().split()]\n\nif k==n:\n\tprint(-1)\nelif n==1 and k==0:\n\tprint(1)\nelse:\n\tstorti = n-k\n\tfor i in range(2, n-k+1):\n\t\tprint(i, end=' ')\n\tprint(1, end=' ')\n\tfor i in range(n-k+1, n+1):\n\t\tprint(i, end=' ')\n", "n, k = map(int, input().split())\r\nif k == n:\r\n print(-1)\r\nelse:\r\n rot = [i for i in range(1, n - k + 1)]\r\n sec = [i for i in range(n - k + 1, n + 1)]\r\n rot = [rot[-1]] + rot[:-1]\r\n print(' '.join(list(map(str, rot + sec))))", "from sys import stdout\n\ndef solve():\n n, k = map(int, input().rstrip().split())\n if k >= n:\n print(-1)\n else:\n ls = [i for i in range(1, n + 1)]\n k = n - k - 1\n swaps = k // 2\n i = 0\n while i < swaps:\n ls[2 * i + 1], ls[2 * i + 2] = ls[2 * i + 2], ls[2 * i + 1]\n i += 1\n if k % 2 == 1:\n ls[2 * i + 1], ls[0] = ls[0], ls[2 * i + 1]\n for elt in ls:\n stdout.write(str(elt) + ' ')\n print()\n\nif __name__ == '__main__':\n solve()\n", "from math import gcd\n\nn,k=map(int,input().split())\nans=[0]*n\nif k>n-1:\n\tprint(-1)\n\texit()\nfor i in range(2,k+2):\n\tans[i-1]=i\nrem=[1]\nfor i in range(k+2,n+1):\n\trem.append(i)\nj=0\nfor i in range(k+2,n+2):\n\tans[i%n-1]=rem[j]\n\tj+=1\n\ncount=0\nfor i in range(n):\n\tif gcd(i+1,ans[i])>1:\n\t\tcount+=1\n\nif count!=k:\n\tprint(-1)\n\texit()\n\nprint(*ans)\n", "n,k = map(int,input().split())\r\n\r\n# t = 0\r\nk = n-k\r\nif k == 0:\r\n\tprint(-1)\r\n\texit()\r\nfor i in range(n):\r\n\tif i == k-1:\r\n\t\tprint(1,end=\" \")\r\n\telif i > k-1:\r\n\t\tprint(i+1,end=\" \")\r\n\telif i == 0:\r\n\t\tprint(2,end=\" \")\r\n\telif i < k-1 and i > 0:\r\n\t\tprint(2+i,end=\" \")", "t = input()\ntemp = t.split()\nn = int(temp[0])\nk = int(temp[1])\n \nif (k == n):\n print(-1)\nelse:\n print(n-k,end =' ')\n \n for i in range(1,n-k):\n print(i,end=' ')\n for i in range(n-k+1, n+1):\n print(i,end=' ')\n \t \t\t \t\t \t\t \t \t\t \t\t \t \t \t", "import math as m \r\nR=lambda:map(int,input().split())\r\nn,k=R()\r\na=[i for i in range(1,n+1)]\r\n\r\nb=[0]*n\r\nl=n-k\r\nif(k==n):\r\n print(-1)\r\n quit()\r\nq=False\r\nif(l%2!=0):\r\n q=True\r\n if(l==1):\r\n a=[i for i in range(1,n+1)]\r\n for j in a:\r\n print(j,end=' ')\r\n quit()\r\n b[0]=3\r\n b[1]=1\r\n b[2]=2\r\n l-=3\r\n j=3\r\n if(n%2==0):\r\n for i in range(3,n,2):\r\n if(l==0):\r\n j=i\r\n break\r\n b[i]=i+2\r\n b[i+1]=i+1\r\n l-=2\r\n else:\r\n for i in range(3,n+1,2):\r\n if(l==0):\r\n j=i\r\n break\r\n b[i]=i+2\r\n b[i+1]=i+1\r\n l-=2\r\nelse:\r\n for i in range(2,n+1,2):\r\n b[i-2]=i\r\n b[i-1]=i-1\r\n l-=2\r\n if(l==0):\r\n j=i\r\n break\r\n\r\nfor t in range(j,len(b)):\r\n b[t]=t+1\r\n\r\nfor i in b:\r\n print(i,end=' ')", "n,k=map(int,input().split())\r\nif ((n-k)%2==1 and n-k>=1):\r\n for i in range(k+1):\r\n print(i+1,end=\" \")\r\n for i in range((n-k-1)//2):\r\n print(k+1+2*(i+1),k+2*(i+1),end=\" \")\r\nelif((n-k)%2==0 and n-k>1):\r\n print(n,end=\" \")\r\n for i in range(1,k+1):\r\n print(i+1,end=\" \")\r\n for i in range((n-k-1)//2):\r\n print(k+1+2*(i+1),k+2*(i+1),end=\" \")\r\n print(1)\r\nelse :\r\n print(-1)\r\n", "n,k=map(int,input().split())\r\nif n==k:\r\n print(-1)\r\nelse:\r\n l=[0]*n\r\n for i in range(n):\r\n l[i]=i+1\r\n if (n-k)%2==0:\r\n for i in range(0,n-k,2):\r\n l[i],l[i+1]=l[i+1],l[i]\r\n else:\r\n for i in range(1,(n-k),2):\r\n l[i], l[i + 1] = l[i + 1], l[i]\r\n print(*l)\r\n", "n,m = map(int,input().split())\r\nif n==m:\r\n print(-1)\r\nelse:\r\n l=[]\r\n for i in range(2,n+1):\r\n l.append(i)\r\n k = n-(m+1)\r\n for i in range(k):\r\n print(l[i],end=\" \")\r\n print(1,end=\" \")\r\n for i in range(k,len(l)):\r\n print(l[i],end=\" \")", "n, k = map(int, input().split())\r\nif n == k:\r\n print(-1)\r\nelse:\r\n print(n - k, end = ' ')\r\n for i in range(2, n + 1):\r\n if i < n - k + 1:\r\n print(i - 1, end = ' ')\r\n else:\r\n print(i, end = ' ')", "from math import gcd\r\nn,k=map(int,input().split())\r\nif n==k:print(-1);exit()\r\nfor i in range(2,n-k+1): \r\n print(i,end=\" \")\r\nprint(1,end=\" \")\r\nfor i in range(n-k+1,n+1): \r\n print(i,end=\" \")\r\n", "n,k = map(int,input().split())\r\n\r\nif(k>=n):\r\n\tprint(\"-1\")\r\nelse:\r\n\t\r\n\tans = str(n-k)\r\n\tfor i in range(1,n-k):\r\n\t\tans += \" \" + str(i)\r\n\tfor i in range(n-k+1, n+1):\r\n\t\tans += \" \" + str(i)\r\n\tprint(ans)", "n, k = map(int, input().split())\nif n == k: print(-1)\nelse:\n for i in range(n - k - 1):\n print(i + 2, end = ' ')\n print(1, end = ' ')\n for i in range(n - k, n):\n print(i + 1, end = ' ')\n", "import sys\r\nimport math\r\ndef fn(n,k):\r\n if k>=n:\r\n print(-1)\r\n return 0\r\n a = [0]*(n+1)\r\n for i in range(1,n+1):\r\n a[i]=i\r\n b= a.copy()\r\n b = b[:n+1-k]\r\n b[0] = b[n-k]\r\n print((*b[0:n-k]), end =' ')\r\n print(*a[n-k+1 :])\r\n \r\nif __name__ == '__main__': \r\n input = sys.stdin.read()\r\n data = list(map(int, input.split()))\r\n n = data[0]\r\n k = data[1]\r\n (fn(n,k))", "n, k = map(int, input().split())\nif k == n:\n print(-1)\nelse:\n ans = [i for i in range(1, k+2)]\n for i in range(k+2, 2*n//2, 2):\n ans.append(i+1)\n ans.append(i)\n if (n+k) % 2 == 0 and k < n - 1:\n ans[0] = n\n ans.append(1)\n print(*ans)\n\t\t \t\t\t\t\t\t\t \t \t\t \t \t \t \t\t \t", "n, k = input().split()\nn = int(n)\nk = int(k)\n\nif (n == k):\n\tprint(-1)\nelse:\n\tfor i in range(2, n - k + 1):\n\t\tprint(i, end=\" \")\n\tprint(1, end=\" \")\n\tfor i in range(n - k + 1, n + 1):\n\t\tprint(i, end=\" \")\n\n \t\t\t\t \t\t\t \t \t\t\t\t\t\t\t \t", "n,k=map(int,input().split(' '))\nif(k<=n-1 and k%2!=n%2):\n for i in range(1,k+2):print(i,end=' ')\n for j in range(k+2,n,2):\n print(j+1,end=' ')\n print(j,end=' ')\nelif(k<=n-1 and k%2==n%2):\n print(n,end=' ')\n for i in range(2,k+2):print(i,end=' ')\n for i in range(k+2,n-1,2):\n print(i+1,end=' ')\n print(i,end=' ')\n print(1)\nelse:print(-1)\n", "n, k = [int(i) for i in input().split()]\r\nif k == n:\r\n print(-1)\r\nelse:\r\n l=[]\r\n for i in range(1,n-k):\r\n l+=[i+1]\r\n l +=[1]\r\n l += [i for i in range(n-k+1,n+1)]\r\n print(*l)\r\n", "n,k = map(int,input().split())\nif n == k:\n print(-1)\nelse:\n # get first n-k wrong and last k right\n print(*range(2,n-k+1),1,*range(n-k+1,n+1))", "int_inp = lambda: int(input()) #integer input\nstrng = lambda: input().strip() #string input\nstrl = lambda: list(input().strip())#list of strings as input\nmul = lambda: map(int,input().split())#multiple integers as inpnut\nmulf = lambda: map(float,input().split())#multiple floats as ipnut\nseq = lambda: list(map(int,input().split()))#list of integers\nimport math\nfrom collections import Counter,defaultdict\n\na,b = mul()\nif b==a:\n print(-1)\nelse:\n if a-b==1:\n print(1,end=\" \")\n for i in range(2,a+1):\n print(i,end=\" \")\n if i==a-b:\n print(1,end=\" \")\n", "\r\nn,k=map(int,input().split())\r\nif n<=k:\r\n print(-1)\r\nelse:\r\n l=[n-k]\r\n for i in range(2,n-k+1):\r\n l.append(i-1)\r\n for i in range(n-k+1,n+1):\r\n l.append(i)\r\n print(*l)\r\n", "n,m=map(int,input().split())\r\nif n==m:\r\n\tprint(-1)\r\nelse:\r\n\tl=[x for x in range(1,n+1)]\r\n\tif m!=0:\r\n\t\tprint(*(l[1:-m]+[l[0]]+l[-m:]))\r\n\telse:\r\n\t\tprint(*(l[1:]+[l[0]]))", "n,k=map(int, input().split())\r\nif n==k:\r\n print('-1')\r\nelse:\r\n x=n-k\r\n for i in range(2,x+1):\r\n print(i,end=' ')\r\n \r\n # v=k\r\n print(1,end=' ')\r\n for i in range(x+1,n+1):\r\n print(i,end=' ')\r\n # v+=1", "n,k=map(int,input().split())\nL=[0]*n\nif(k==n):\n print(-1)\n\nelse:\n if((n-(k+1))%2==0):\n L[0]=1\n for i in range(k):\n L[i+1]=i+2\n for i in range(k+1,n,2):\n L[i]=i+2\n L[i+1]=i+1\n else:\n L[0]=k+2\n for i in range(k):\n L[i+1]=i+2\n for i in range(k+2,n,2):\n L[i]=i+2\n L[i+1]=i+1\n L[k+1]=1\n print(L[0],end=\"\")\n for i in range(1,n):\n print(\" \"+str(L[i]),end=\"\")\n \n", "n, k = map(int, input().split())\r\n \r\nif n < k+1:\r\n print(-1)\r\nelse:\r\n print(*range(2, n-k+1), 1, *range(n-k+1, n+1))", "n, k = list(map(int, input().split()))\n\nif n == k: print(-1)\nelse:\n aux = n-k\n print(n-k, end=\" \")\n for i in range(1, n-k): print(i, end=\" \")\n for j in range(n-k+1, n+1): print(j, 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\n\r\nif k >= n:\r\n print(-1)\r\nelse:\r\n ans = [i for i in range(1, n+1)]\r\n temp = n-k\r\n start = 0 + temp&1\r\n for i in range(start, temp, 2):\r\n ans[i], ans[i+1] = ans[i+1], ans[i]\r\n\r\n print(' '.join(list(map(str, ans))))\r\n\r\n ", "n, k = map(int, input().split())\r\n\r\nif n == k:\r\n print(-1)\r\nelif k == 0:\r\n p = 0\r\n l =[]\r\n for i in range(1, n+1):\r\n if p%2==0:\r\n l.append(i+1)\r\n else:\r\n l.append(i-1)\r\n if i == n and l[i-1] == n+1:\r\n l[n-1]-=1\r\n l[0], l[n-1] = l[n-1], l[0]\r\n p+=1\r\n print(*l)\r\nelse:\r\n l = []\r\n for i in range(1,k+2):\r\n l.append(i)\r\n t = 0\r\n for i in range(k+2, n+1):\r\n if t%2==0:\r\n l.append(i+1)\r\n else:\r\n l.append(i-1)\r\n if i == n and l[i-1] == n+1:\r\n l[n-1]-=1\r\n l[0], l[n-1] = l[n-1], l[0]\r\n t+=1\r\n print(*l)\r\n", "import sys\r\n\r\ndef input(): return sys.stdin.readline().strip()\r\ndef iinput(): return int(input())\r\ndef rinput(): return map(int, sys.stdin.readline().strip().split()) \r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split())) \r\nmod = int(1e9)+7\r\n\r\nn, k = rinput()\r\nif (n==k):\r\n\tprint(-1)\r\nelse:\r\n\tbar = n - k\r\n\tcorrect = list(range(n - k + 1, n + 1))\r\n\tincorrect = [n-k] + list(range(1, n-k))\r\n\tans = incorrect + correct\r\n\tprint(*ans)", "def printt(L):\r\n n=len(L)\r\n for i in range(n):\r\n print(L[i],end=\" \")\r\n\r\n\r\nn,k=map(int,input().split())\r\nif k>=n:\r\n print(\"-1\")\r\nelse:\r\n if(n%2==k%2):\r\n L=[]\r\n p=(n-k)//2\r\n for i in range(1,p+1):\r\n L.append(2*i)\r\n L.append(2*i-1)\r\n for i in range(n-k+1,n+1):\r\n L.append(i)\r\n printt(L)\r\n else:\r\n L=[1]\r\n p=(n-k-1)//2\r\n for i in range(1,p+1):\r\n L.append(2*i+1)\r\n L.append(2*i)\r\n for i in range(n-k+1,n+1):\r\n L.append(i)\r\n printt(L)\r\n ", "def f(l):\r\n n,k = l\r\n return [-1] if k>=n else [n-k]+list(range(1,n-k))+list(range(n-k+1,n+1)) \r\n\r\nl = list(map(int,input().split()))\r\nprint(*f(l))\r\n", "'''n-1 good ones\n1 bad one\n\ncount for k\n if odd then hop from i=2 swapping neighbors\n if even then hop from i=1 swapping neighbors\nnon-countable cases should be caught in first line'''\nimport sys\nn,k = map(int,input().split())\nif k==n:\n print(-1)\n sys.exit()\nelements = [i+1 for i in range(n)]\ni = 1 if (n-k)%2 else 0\nwhile i<n-k:\n elements[i],elements[i+1] = elements[i+1],elements[i]\n i+=2\nprint(' '.join([str(e) for e in elements]))\n\n", "a,b=map(int,input().split())\r\nl=[]\r\nt=a-b-1\r\nif a==b:\r\n print(-1)\r\nelse:\r\n l.append(a-b)\r\n for i in range(t):\r\n l.append(i+1)\r\n for j in range(t+2,a+1):\r\n l.append(j)\r\n \r\n print(*l)\r\n\r\n \r\n \r\n", "import itertools\r\nimport math\r\nimport random\r\n\r\nimport time\r\ndef timer(f):\r\n def tmp(*args, **kwargs):\r\n t = time.time()\r\n res = f(*args, **kwargs)\r\n print(\"Время выполнения функции: %f\" % (time.time()-t))\r\n return res\r\n\r\n return tmp\r\n\r\ndef genArray(length, lower, upper):\r\n return [random.randint(lower, upper) for i in range(length)]\r\n\r\n#print(genArray(5, 4, 9))\r\n\r\ndef gcd(a, b):\r\n if b==0:\r\n return a\r\n else:\r\n return gcd(b, a%b)\r\n\r\nn, k = map(int, input().split(' '))\r\nk = n-k\r\n\r\nif k == 0:\r\n print(-1)\r\n exit(0)\r\nelse:\r\n array = [0 for i in range(n)]\r\n for j in range(k):\r\n array[j] = (j-1)%(k)+1\r\n for j in range(k, n):\r\n array[j] = j+1\r\n\r\n\r\nar = [i+1 for i in range(n)]\r\n#print(ar)\r\n#print(array)\r\n\r\ntotal = 0\r\nfor i in range(n):\r\n if gcd(ar[i], array[i])==1:\r\n total+=1\r\n\r\n#print(total)\r\n\r\nstr = array.__str__().replace('[', '').replace(']', '').replace(',', '')\r\nprint(str)", "\r\nn, k = map(int, input().split())\r\nif n == k:\r\n print (-1)\r\nelse:\r\n temp = n-k\r\n res = str(temp)\r\n for i in range(1, temp):\r\n res += ' ' + (str(i))\r\n for j in range(temp+1, n+1):\r\n res += ' ' + (str(j))\r\n print(res)\r\n\t\t", "# @author Nayara Souza\n# UFCG - Universidade Federal de Campina Grande\n# AA - Basico\n\nn, k = list(map(int, input().split()))\n\ns = ''\ns += str(n-k) + ' '\n\nif n == k:\n print(-1)\n\nelse:\n for i in range(1, n-k):\n s += str(i) + ' '\n for i in range(n-k,n):\n s += str(i+1) + ' '\n\n print(s.rstrip())\n \t\t\t \t \t \t \t\t \t \t\t\t\t \t \t\t", "nums = input().split(\" \")\nn = int(nums[0])\nk = int(nums[1])\n\npermutations = []\npermutations.append(n-k)\n\nfor val in range(1, n+1):\n\tif val != permutations[0]:\n\t\tpermutations.append(val)\n\nif len(permutations) != n:\n\tprint(-1)\nelse:\t\n\tfor num in permutations:\n\t\tprint(num, end=\" \")", "import random\r\nimport math\r\nn,k=map(int,input().split())\r\n\"\"\"ll=[int(i) for i in range(1,n+1)]\r\nkk=[]\r\nwhile True:\r\n c=0\r\n for i in range(n):\r\n if math.gcd(ll[i],i+1)>1:\r\n c+=1\r\n if c==k:\r\n print(ll)\r\n random.shuffle(ll)\r\n\"\"\"\r\nif n==k:\r\n print(-1)\r\nelse:\r\n kk=[int(i) for i in range(n-k+1,n+1)]\r\n ff=[int(i) for i in range(1,n-k+1)]\r\n n-=k+1\r\n while n>=1:\r\n ff[n],ff[n-1]=ff[n-1],ff[n]\r\n n-=2\r\n ff+=kk\r\n print(*ff)", "n, k = map(int, input().split())\r\n\r\nif n == k:\r\n print(-1)\r\nelse:\r\n print(n - k, end=' ')\r\n\r\n for i in range(1, n - k):\r\n print(i, end=' ')\r\n for j in range((n - k) + 1, n + 1):\r\n print(j, end=' ')\r\n", "n, k = map(int, input().split())\r\nif n == k:\r\n print(-1)\r\nelse:\r\n if k:\r\n shift = n-k\r\n print(n-k,end=\" \")\r\n for _ in range(shift-1): print(_+1,end=\" \")\r\n for _ in range(shift+1,n+1): print(_,end=\" \")\r\n else:\r\n print(n)\r\n for _ in range(1,n): print(_,end=\" \")\r\n\r\n", "n,k=map(int,input().split())\r\na=list(range(1,n+1))\r\nx=n-k\r\nif x&1==0:a[0],a[-1]=n,1;x-=2\r\nelse: x-=1\r\nfor i in range(1,n-1,2):\r\n if x<1:break\r\n a[i],a[i+1]=a[i+1],a[i]\r\n x-=2\r\nif x!=0:print(-1)\r\nelse:print(' '.join(map(str,a)))\r\n", "n, k = [int(n) for n in input().split()]\n\nif k == n:\n print(-1)\nelse:\n ordenada = list(range(1, n + 1))\n desordenei = 1\n ini = 1\n if (n - k) % 2 == 0:\n ordenada[0], ordenada[1] = ordenada[1], ordenada[0]\n desordenei += 1\n ini = 2\n\n while desordenei < n - k:\n ordenada[ini], ordenada[ini + 1] = ordenada[ini + 1], ordenada[ini]\n desordenei += 2\n ini += 2\n\n print(' '.join([str(n) for n in ordenada]))\n\n\t\t\t \t \t\t\t\t \t \t\t\t", "n,k = list(map(int,input().split()))\r\n\r\n\r\nif(k == n):\r\n print(-1)\r\nelse: \r\n a = [1]*(n)\r\n j = 0\r\n for i in range(2, n - k + 1):\r\n a[j] = i\r\n j += 1\r\n \r\n for i in range(n - k, n):\r\n a[i] = i + 1\r\n \r\n \r\n\r\n print(\" \".join(map(str,a)))\r\n\r\n\r\n\r\n", "n,k=map(int,input().split())\r\nif(k>n-1):\r\n print('-1')\r\n exit(0)\r\n \r\na = [0]*(n+1)\r\nfor i in range(1,n+1): a[i]=i\r\nfor i in range(n-k,1,-1): a[i]=a[i-1]\r\na[1] = n-k\r\nfor i in range(1,n+1):\r\n if(i>1): print(' ',end='')\r\n print(a[i],end='')\r\nprint('')\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, k = iia()\r\nif n == 1 and k!=0 or n == k:\r\n print(-1)\r\nelse:\r\n arr = [1] * n\r\n i = 1\r\n while i<n:\r\n if k > 0:\r\n arr[i] = i+1\r\n i += 1\r\n k -= 1\r\n else:\r\n if i + 1 < n:\r\n arr[i] = i + 2\r\n arr[i + 1] = i+1\r\n i += 2\r\n else:\r\n arr[i] = 1\r\n arr[0] = i + 1\r\n i+=1\r\n print(*arr)\r\n", "n,k=map(int,input().split())\r\nif n-k>0:\r\n for i in range(n):\r\n if i<(n-k):\r\n if i==n-k-1:\r\n print(1,end=\" \")\r\n else:\r\n print(i+2,end=\" \")\r\n else:\r\n print(i+1,end=\" \")\r\n \r\nelse:\r\n print(-1)", "n, k = map(int, input().split())\n\nsaida = [-1]\nif not n < k + 1:\n saida = list(range(2, n - k + 1))\n saida += [1]\n saida += range(n - k + 1, n + 1)\nprint(' '.join(map(str, saida)))\n", "n, k = map(int, input().split())\r\nif n < k+1:\r\n print(-1)\r\nelse:\r\n s = []\r\n for i in range(2, n-k+1):\r\n s.append(i)\r\n s.append(1)\r\n for j in range(n-k+1, n+1):\r\n s.append(j)\r\n print(*s)\r\n###### thanking telegram for solutions ######\r\n'''__________ ____ ___ _____________ __.___\r\n\\______ \\ | \\/ _____/ |/ _| |\r\n | _/ | /\\_____ \\| < | |\r\n | | \\ | / / \\ | \\| |\r\n |____|_ /______/ /_______ /____|__ \\___|\r\n'''\r\n", "import sys\r\nINF = 10**20\r\nMOD = 10**9 + 7\r\nI = lambda:list(map(int,input().split()))\r\nfrom math import gcd\r\nfrom math import ceil\r\nfrom collections import defaultdict as dd, Counter\r\nfrom bisect import bisect_left as bl, bisect_right as br\r\n\r\n\r\n\"\"\"\r\nFacts and Data representation\r\nConstructive? Top bottom up downa\r\n\"\"\"\r\nn, k = I()\r\nif n == k:\r\n print(-1)\r\n exit()\r\n\r\na = [i for i in range(1, n + 1)]\r\nfor i in range(k + 1, n, 2):\r\n nxt = (i + 1) % n\r\n a[i], a[nxt] = a[nxt], a[i]\r\nprint(*a)", "n,k=map(int,input().split())\r\nif k>n-1:print(-1)\r\nelse:\r\n ans=[i for i in range(1,n+1)]\r\n k=(n-1)-k\r\n if k%2==1:ans[0],ans[1]=ans[1],ans[0]\r\n j=1\r\n for i in range(k//2):\r\n ans[-j],ans[-j-1]=ans[-j-1],ans[-j]\r\n j+=2\r\n print(*ans)\r\n", "\r\ndef k_beautiful(n, k):\r\n if n <= k:\r\n return [-1]\r\n else:\r\n beautiful = [i for i in range(1, n+1)]\r\n \r\n # make them not beauftiful\r\n left = n- k - 1\r\n if left % 2 == 0:\r\n for i in range(k+1, n, 2):\r\n beautiful[i], beautiful[i+1] = beautiful[i+1], beautiful[i] \r\n else:\r\n for i in range(k+1, n-1, 2):\r\n beautiful[i], beautiful[i+1] = beautiful[i+1], beautiful[i]\r\n beautiful[0], beautiful[-1] = beautiful[-1], beautiful[0]\r\n \r\n \r\n return beautiful\r\n\r\ndef print_l(l):\r\n string = \"\"\r\n for item in l:\r\n string += str(item) + \" \"\r\n if len(string) > 1:\r\n string = string[0:len(string) - 1]\r\n print(string)\r\n \r\n \r\ndef main():\r\n i = input().split()\r\n n = int(i[0])\r\n k = int(i[1])\r\n print_l(k_beautiful(n, k))\r\n\r\nmain()\r\n", "n,k=map(int,input().split())\r\nl=list(range(1,n+1))\r\nif k<n:\r\n z=n-(k+1)\r\n if z%2!=0:\r\n if z==1:\r\n l[0],l[-1]=l[-1],l[0]\r\n else:\r\n for i in range(k+1,n,2):\r\n if i==n-1:\r\n l[i],l[0]=l[0],l[i]\r\n else:\r\n l[i],l[i+1]=l[i+1],l[i]\r\n else:\r\n for i in range(k + 1, n-1, 2):\r\n l[i], l[i + 1] = l[i + 1], l[i]\r\n for i in l:\r\n print(i,end=\" \")\r\nelse:\r\n print(-1)" ]

[ "import traceback\r\nimport math\r\nfrom collections import defaultdict\r\nfrom functools import lru_cache\r\n\r\n\r\ndef main():\r\n N = int(input())\r\n grid = []\r\n for _ in range(N):\r\n s = input()\r\n grid.append(s)\r\n \r\n if all('.' in [grid[i][j] for j in range(N)] for i in range(N)):\r\n for i in range(N):\r\n for j in range(N):\r\n if grid[i][j] == '.':\r\n print(i+1, j+1)\r\n break\r\n \r\n elif all('.' in [grid[i][j] for i in range(N)] for j in range(N)):\r\n for j in range(N):\r\n for i in range(N):\r\n if grid[i][j] == '.':\r\n print(i+1, j+1)\r\n break\r\n else:\r\n print(-1) \r\n\r\ntry:\r\n ans = main()\r\n # print(ans)\r\nexcept Exception as e:\r\n traceback.print_exc()", "\r\n\r\nn=int(input())\r\nfree_r=[set() for _ in range(n)]\r\nfree_c=[set() for _ in range(n)]\r\n\r\nf=True\r\narr=[]\r\nfor _ in range(n):\r\n arr.append(list([el for el in input()]))\r\nfor i in range(n):\r\n for j in range(n):\r\n if arr[i][j]==\".\":\r\n free_r[i].add((i+1,j+1))\r\n free_c[j].add((i+1,j+1))\r\n else :\r\n \r\n s=set()\r\n p=i\r\n while p<n:\r\n s.add(arr[p][j])\r\n p+=1\r\n p=i\r\n while p>=0:\r\n s.add(arr[p][j])\r\n p-=1\r\n k=j\r\n while k>=0:\r\n s.add(arr[i][k])\r\n k-=1\r\n k=j\r\n while k<n:\r\n s.add(arr[i][k])\r\n k+=1\r\n if \"E\" in s and len(s)==1:\r\n f=False\r\n break\r\nif not f:\r\n print(-1)\r\nelse :\r\n t=True\r\n for el in free_r:\r\n if len(el)==0:\r\n t=False\r\n if t:\r\n for i in range(n):\r\n el=list(free_r[i])\r\n print(*(el[0]))\r\n else:\r\n t=True\r\n free_r=free_c\r\n for el in free_r:\r\n if len(el)==0:\r\n t=False\r\n if t:\r\n for i in range(n):\r\n el=list(free_r[i])\r\n print(*(el[0]))\r\n else :\r\n print(-1)", "n = int(input())\n\na = []\n\nfor i in range(n):\n\n a.append(input())\n\nif 'E' * n in a and ('E',) * n in zip(*a):\n\n print(-1)\n\nelif 'E' * n in a:\n\n for j, s in enumerate(map(lambda x: ''.join(x), zip(*a))):\n\n for i, c in enumerate(s):\n\n if c == '.':\n\n print(i + 1, j + 1)\n\n break\n\nelse:\n\n for i, s in enumerate(a):\n\n for j, c in enumerate(s):\n\n if c == '.':\n\n print(i + 1, j + 1)\n\n break\n\n", "n=int(input())\n\nrows=[]\nevils=0\nfor i in range(n):\n rows.append(input())\n## evils+=rows[-1].count('E')\n\ncolumns=[]\nfor i in range(n):\n L=[]\n for j in range(n):\n L.append(rows[j][i])\n columns.append(L)\ncan=True\nfor i in range(n):\n if(not can):\n break\n for j in range(n):\n if(rows[i][j]=='.'):\n continue\n r='.' not in rows[i]\n c='.' not in columns[j]\n if(r and c):\n can=False\n break\n\nif(not can):\n print(-1)\nelse:\n used='rows'\n for i in range(n):\n if(rows[i].count('E')==n):\n used='columns'\n break\n elif(columns[i].count('E')==n):\n used='rows'\n break\n if(used=='rows'):\n for i in range(n):\n x=rows[i].index('.')\n print(i+1,end=\" \"+str(x+1)+'\\n')\n else:\n for i in range(n):\n x=columns[i].index('.')\n print(x+1,end=\" \"+str(i+1)+'\\n')\n \n", "import sys\n\nn = int(input())\nA = [input().strip() for _ in range(n)]\n\nif all('.' in a for a in A):\n for i in range(n):\n j = A[i].find('.')\n print(i+1, j+1)\n sys.exit()\n\nA = [''.join(s) for s in zip(*A)]\nif all('.' in a for a in A):\n for i in range(n):\n j = A[i].find('.')\n print(j+1, i+1)\n sys.exit()\n\nprint('-1')\n", "import sys\ninput = sys.stdin.readline\nI = lambda : list(map(int,input().split()))\n\nn,=I()\nl=[]\nan=[]\nfor i in range(n):\n\tx=input().strip()\n\tl.append(x)\n\tif '.' in x:\n\t\tan.append([i+1,x.index('.')+1])\nif len(an)==n:\n\tfor i in an:\n\t\tprint(*i)\nelse:\n\tan=[]\n\tfor i in range(n):\n\t\tfor j in range(n):\n\t\t\tif l[j][i]=='.':\n\t\t\t\tan.append([j+1,i+1])\n\t\t\t\tbreak\n\tif len(an)==n:\n\t\tfor i in an:\n\t\t\tprint(*i)\n\telse:\n\t\tprint(-1)", "def procura_linha(matriz):\n linhas = [-1 for i in range(n)]\n\n for i in range(n):\n for j in range(n):\n if matriz[i][j] == '.':\n linhas[i] = j\n break\n if linhas[i] == -1:\n return -1\n \n return linhas\n\ndef procura_coluna(matriz):\n colunas = [-1 for i in range(n)]\n\n for j in range(n):\n for i in range(n):\n if matriz[i][j] == '.':\n colunas[j] = i\n break\n if colunas[j] == -1:\n return -1\n \n return colunas\n\ndef print_linha(linha):\n for i in range(len(linha)):\n print(i + 1, linha[i] + 1)\n\ndef print_coluna(coluna):\n for i in range(len(coluna)):\n print(coluna[i] + 1, i + 1)\n\nn = int(input())\nmatriz = [[] for i in range(n)]\n\nfor i in range(n):\n linha = input()\n matriz[i] = linha\n\n\nres = procura_linha(matriz)\nif res == -1:\n res = procura_coluna(matriz)\n if res == -1:\n print(-1)\n else:\n print_coluna(res)\nelse:\n print_linha(res)\n \t\t \t \t \t \t \t \t \t\t\t \t\t", "from sys import stdin\r\n\r\n__author__ = 'artyom'\r\n\r\n\r\ndef solve(x):\r\n a = []\r\n for s in x:\r\n dot_pos = s.find('.')\r\n if dot_pos < 0:\r\n return None\r\n a.append(dot_pos + 1)\r\n return a\r\n\r\n\r\ndef rotate(x, n):\r\n y = []\r\n for i in range(n):\r\n y.append([])\r\n for j in range(n):\r\n y[i].append(x[j][i])\r\n return map(lambda b: ''.join(b), y)\r\n\r\n\r\nn = int(stdin.readline().strip())\r\nx = []\r\nfor _ in range(n):\r\n x.append(stdin.readline().strip())\r\n\r\na = solve(x)\r\nif a:\r\n for i in range(n):\r\n print(i + 1, a[i])\r\nelse:\r\n a = solve(rotate(x, n))\r\n if a:\r\n for i in range(n):\r\n print(a[i], i + 1)\r\n else:\r\n print(-1)", "n = int(input())\r\ng = []\r\nr = [0]*n\r\nc = [0]*n\r\nfor i in range(n):\r\n g.append(list(input()))\r\n x = [a for a in range(n) if g[i][a] == '.']\r\n if len(x) > 0: r[i] = 1\r\n for j in x: c[j] = 1\r\nif sum(r) == n:\r\n for i in range(n):\r\n for j in range(n):\r\n if g[i][j] == '.':\r\n print('%i %i' % (i+1,j+1))\r\n break\r\nelif sum(c) == n:\r\n for i in range(n):\r\n for j in range(n):\r\n if g[j][i] == '.':\r\n print('%i %i' % (j+1,i+1))\r\n break\r\nelse:\r\n print(-1)", "n = int(input())\r\ngraph = []\r\n\r\ncol = [0] * n\r\nrow = [0] * n\r\n\r\nfor i in range(n):\r\n graph.append(input())\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if graph[i][j] == '.':\r\n col[j] = 1\r\n row[i] = 1\r\n\r\ncolHasDot = False\r\nrowHasDot = False\r\n\r\nif 0 not in col:\r\n colHasDot = True\r\nif 0 not in row:\r\n rowHasDot = True\r\n\r\nif not colHasDot and not rowHasDot:\r\n print(\"-1\")\r\n exit(0)\r\n\r\nfor i in range(n):\r\n j = 0\r\n for j in range(n):\r\n if graph[i][j] == '.':\r\n if colHasDot:\r\n if col[j]:\r\n print(i + 1, j + 1)\r\n col[j] = False\r\n elif row[i]:\r\n print(i + 1, j + 1)\r\n break\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ng = [input()[:-1] for _ in range(n)]\r\n\r\new = 0\r\nd = []\r\nfor i, j in enumerate(g):\r\n x = j.count('E')\r\n if x == n:\r\n ew = 1\r\n break\r\n d.append((i+1, j.index('.')+1))\r\n\r\nif ew == 1:\r\n d = []\r\n for i, j in enumerate(zip(*g)):\r\n x = j.count('E')\r\n if x == n:\r\n break\r\n d.append((j.index('.')+1, i+1))\r\n else:\r\n ew = 0\r\n\r\nif ew == 1:\r\n print(-1)\r\nelse:\r\n for i in d:\r\n print(*i)\r\n", "import sys\r\nimport math\r\n\r\ndef sin():\r\n\treturn int(sys.stdin.readline())\r\n\r\ndef array():\r\n\treturn list(map(int, sys.stdin.readline().strip().split()))\r\n\r\ndef two():\r\n\treturn map(int, sys.stdin.readline().strip().split())\r\n\r\ndef multiple():\r\n\treturn [int(x) for x in sys.stdin.readline().split()]\r\n\r\ndef string():\r\n\treturn sys.stdin.readline().strip()\r\n\r\n\r\nn = sin()\r\nmat = []\r\nfor _ in range(n):\r\n\tmat.append(input())\r\n\r\nrow = set()\r\ncol = set()\r\n\r\nans1 = []\r\n\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif mat[i][j] == \".\":\r\n\t\t\tans1.append((i+1 , j+1))\r\n\t\t\tbreak\r\n\r\nans2 = []\r\n\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif mat[j][i] == \".\":\r\n\t\t\tans2.append((j+1 , i+1))\r\n\t\t\tbreak\r\n\r\n\r\nif len(ans1) != n and len(ans2) != n: \r\n\tprint(-1)\r\nelif len(ans1) == n:\r\n\tfor i in ans1:\r\n\t\tprint(i[0] , i[1])\r\nelse:\r\n\tfor i in ans2:\r\n\t\tprint(i[0] , i[1])\r\n\r\n", "# upsolve from dukkha\r\n\r\ndef checker(r, c):\r\n flag = True\r\n if -1 in r:\r\n flag = False\r\n if flag:\r\n for k in range(n):\r\n print((k + 1), \" \", (r[k] + 1))\r\n return\r\n flag = True\r\n if -1 in c:\r\n flag = False\r\n if flag:\r\n for l in range(n):\r\n print((c[l] + 1), \" \", (l + 1))\r\n return\r\n print(-1)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n row = [-1] * n\r\n col = [-1] * n\r\n for i in range(n):\r\n val = input()\r\n for j in range(n):\r\n if val[j] == '.':\r\n row[i] = j\r\n col[j] = i\r\n checker(row, col)\r\n", "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\r\nfrom time import perf_counter\r\nfrom fractions import Fraction\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\nmod = int(pow(10, 9) + 7)\r\nmod2 = 998244353\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\n\r\n\r\n# @lru_cache(None)\r\n\r\nn=int(input())\r\nA=[list(input()) for _ in range(n)]\r\nr=c=0\r\nfor i in range(n):\r\n if(A[i].count(\".\")==0):\r\n r+=1\r\nfor i in range(n):\r\n x=[A[j][i] for j in range(n)]\r\n if(x.count(\".\")==0):\r\n c+=1\r\nif(r>0 and c>0):\r\n print(-1)\r\n exit()\r\nif(c==0):\r\n for i in range(n):\r\n for j in range(n):\r\n if(A[j][i]==\".\"):\r\n print(j+1,i+1)\r\n break\r\nelif(r==0):\r\n for i in range(n):\r\n for j in range(n):\r\n if(A[i][j]==\".\"):\r\n print(i+1,j+1)\r\n break\r\n\r\n\r\n", "import sys,math as mt\r\nimport heapq as hp\r\nimport collections as cc\r\nimport math as mt\r\nimport itertools as it\r\ninput=sys.stdin.readline\r\nI=lambda:list(map(int,input().split()))\r\nn,=I()\r\nar=[]\r\ntf=1\r\nans=[]\r\nfor i in range(n):\r\n\tx=input().strip()\r\n\tif '.' not in x:\r\n\t\ttf=0\r\n\telse:\r\n\t\ttemp=x.index('.')\r\n\t\tans.append([i+1,temp+1])\r\n\tar.append(x)\r\nif not tf:\r\n\ttf=1\r\n\tans=[]\r\n\tk=0\r\n\tfor i in zip(*ar):\r\n\t\tk+=1\r\n\t\tif '.' not in i:\r\n\t\t\ttf=0\r\n\t\t\tbreak\r\n\t\ttemp=i.index('.')\r\n\t\tans.append([temp+1,k])\r\n\tif not tf:\r\n\t\tprint(-1)\r\n\telse:\r\n\t\tfor i in ans:\r\n\t\t\tprint(*i)\r\nelse:\r\n\tfor i in ans:\r\n\t\tprint(*i)", "\n\nclass Solver(object):\n def read_input(self):\n n = int(input())\n grid = []\n for i in range(n):\n l = list(input())\n grid.append(l)\n\n self.n = n\n self.grid = grid\n\n def solve_line(self):\n pos = []\n for i in range(self.n):\n res = False\n for j in range(self.n):\n if self.grid[i][j]==\".\":\n res = True\n pos.append((i,j))\n\n if res==True:\n break\n if res==True:\n continue\n else:\n pos = -1\n break\n self.pos = pos\n return pos\n\n def solve_column(self):\n pos = []\n for j in range(self.n):\n res = False\n for i in range(self.n):\n if self.grid[i][j]==\".\":\n res = True\n pos.append((i,j))\n\n if res==True:\n break\n if res==True:\n continue\n else:\n pos = -1\n break\n self.pos = pos\n return pos\n\n def print_solution(self):\n for i, j in self.pos:\n print(i+1, j+1)\n def solve(self):\n lines = self.solve_line()\n if lines != -1:\n self.print_solution()\n\n else:\n cols = self.solve_column()\n if cols == -1:\n print(-1)\n else:\n self.print_solution()\n\n\nS = Solver()\nS.read_input()\nS.solve()", "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 = int(input())\r\n row = []\r\n col = []\r\n for i in range(0, n):\r\n ip = input()\r\n for j in range(0, n):\r\n if ip[j] == \".\":\r\n row.append([i+1,j+1])\r\n col.append([j+1,i+1])\r\n row.sort()\r\n col.sort()\r\n # print(row)\r\n # print(col)\r\n start = 1\r\n res = []\r\n for i in range(0, len(row)):\r\n if row[i][0] == start:\r\n res.append(row[i])\r\n start += 1\r\n \r\n if start == n+1:\r\n for i in range(0, len(res)):\r\n print(res[i][0],res[i][1])\r\n return\r\n else:\r\n start = 1\r\n res = []\r\n for i in range(0, len(col)):\r\n if col[i][0] == start:\r\n res.append(col[i])\r\n start += 1\r\n \r\n if start == n+1:\r\n for i in range(0, len(res)):\r\n print(res[i][1],res[i][0])\r\n # return\r\n else:\r\n print(-1)\r\n \r\n\r\n\r\n\r\n \r\n \r\n\r\n \r\n\r\n# calling main Function\r\nif __name__ == \"__main__\":\r\n main()", "import sys\r\nfin = sys.stdin\r\n\r\nn = int(fin.readline())\r\na = [fin.readline().strip() for i in range(n)]\r\n\r\ndef CanSolveByColumns():\r\n for j in range(n):\r\n col = ''.join(a[i][j] for i in range(n))\r\n if col.find('.') == -1:\r\n return False\r\n return True\r\n\r\ndef CanSolveByRows():\r\n for i in range(n):\r\n row = a[i]\r\n if row.find('.') == -1:\r\n return False\r\n return True\r\n\r\ndef SolveByColumns():\r\n for j in range(n):\r\n col = ''.join(a[i][j] for i in range(n))\r\n print(col.find('.') + 1, j + 1)\r\n \r\ndef SolveByRows():\r\n for i in range(n):\r\n row = a[i]\r\n print(i + 1, row.find('.') + 1)\r\n\r\nif CanSolveByColumns():\r\n SolveByColumns()\r\nelif CanSolveByRows():\r\n SolveByRows()\r\nelse:\r\n print(-1)", "n = int(input())\r\n\r\nvr = [set() for x in range(0, n)]\r\nvc = [set() for x in range(0, n)]\r\nr = set(range(0, n))\r\nc = set(range(0, n))\r\n\r\nfor i in range(0, n):\r\n s = input()\r\n for j in range(0, n):\r\n if s[j] == '.':\r\n vr[i].add(j)\r\n vc[j].add(i)\r\n r.discard(i)\r\n c.discard(j)\r\n\r\nif len(r) == 0:\r\n for i in range(0, n):\r\n print(i+1, vr[i].pop()+1)\r\nelif len(c) == 0:\r\n for j in range(0, n):\r\n print(vc[j].pop()+1, j+1)\r\nelse:\r\n print(-1)\r\n", "\r\n\r\nn = int( input() )\r\n\r\npl = [0] * 100\r\np = [ [] for i in range(100) ]\r\n\r\ns = [ str() for i in range(100) ]\r\n\r\ncp = [0] * 100\r\nrp = [0] * 100\r\n\r\nX = 0\r\nY = 0\r\n\r\nfor i in range(n):\r\n s[i] = str( input() )\r\n f = 0\r\n for j in range(len(s[i])):\r\n if s[i][j]=='.':\r\n f = 1\r\n break\r\n if f == 0:\r\n X = 1\r\n\r\n\r\nfor i in range(n):\r\n f = 0\r\n for j in range(n):\r\n if s[j][i]=='.':\r\n f = 1\r\n break\r\n if f == 0:\r\n Y = 1\r\n\r\n#print(X,Y)\r\n\r\nif X==1 and Y==1:\r\n print(\"-1\")\r\nelse:\r\n if X == 0:\r\n for i in range(n):\r\n for j in range(n):\r\n if s[i][j]=='.':\r\n print(i+1,j+1)\r\n break\r\n else:\r\n for i in range(n):\r\n for j in range(n):\r\n if s[j][i]=='.':\r\n print(j+1,i+1)\r\n break\r\n", "n = int(input())\r\nt = [input() for i in range(n)]\r\ne = 'E' * n\r\nif e in t:\r\n t = list(''.join(i) for i in zip(*t))\r\n if e in t: print('-1')\r\n else:\r\n p = [str(c.find('.') + 1) + ' ' + str(i) for i, c in enumerate(t, 1)]\r\n print('\\n'.join(p))\r\nelse:\r\n p = [str(i) + ' ' + str(c.find('.') + 1) for i, c in enumerate(t, 1)]\r\n print('\\n'.join(p))" ]

[ "n,m = list(map(int, input().split(\" \")))\nstrings = []\nfor i in range(n): \n\tstrings.append(input())\n\nspec = set('#*&')\ndig = set('0123456789')\nalpha = set('abcdefghijklmnopqrstuvwxyz')\n\n\ndef num(checkset, checkstring):\n\tm = len(checkstring)+1\n\tfor i, c in enumerate(checkstring):\n\t\tif c in checkset:\n\t\t\tm = min(m, i)\n\t\t\tm = min(m, len(checkstring)-i)\n\tif m < len(checkstring)+1:\n\t\treturn m\n\treturn -1 \n\t\nret = float('inf')\n\t\nfor i in range(n):\n\tfor j in range(n):\n\t\tfor k in range(n):\n\t\t\tif i==j or i==k or j==k:\n\t\t\t\tcontinue\n\t\t\telse:\n\t\t\t\ts1 = num(spec, strings[i])\n\t\t\t\ts2 = num(dig, strings[j])\n\t\t\t\ts3 = num(alpha, strings[k]) \n\t\t\t\tif s1 >= 0 and s2 >= 0 and s3 >= 0:\n\t\t\t\t\tret = min(ret, s1+s2+s3)\n\nprint(str(int(ret)))\n\n\t\t\t\t\t \n\t\t\t\t\n", "n,m = map(int,input().split())\n\na = []\n\nfor i in range(n):\n\ts = input()\n\tx = -1\n\ty = -1\n\tz = -1\n\tfor i in range(m):\n\t\tif(s[i] in ['#', '*', '&']):\n\t\t\tif(x == -1 or min(i,m-i) < x):\n\t\t\t\tx = min(i,m-i)\n\t\telif(s[i] in ['0','1','2','3','4','5','6','7','8','9']):\n\t\t\tif(y == -1 or min(i,m-i) < y):\n\t\t\t\ty = min(i,m-i)\n\t\telse:\n\t\t\tif(z == -1 or min(i,m-i) < z):\n\t\t\t\tz = min(i,m-i)\n\ta.append([x,y,z])\n\n\nbest_sum = 3*m\n\nfor i1 in range(n):\n\tfor i2 in range(n):\n\t\tfor i3 in range(n):\n\t\t\tif(i2 == i3 or i1 == i3 or i1 == i2):\n\t\t\t\tcontinue\n\t\t\tx = a[i1][0]\n\t\t\ty = a[i2][1]\n\t\t\t#print(a[i3])\n\t\t\tz = a[i3][2]\n\t\t\tif(x != -1 and y != -1 and z != -1 and x+y+z < best_sum):\n\t\t\t\tbest_sum = x+y+z\n\t\t\t\n\nprint(best_sum)\n", "n,m=map(int,input().split())\r\nm1,m2,m3=[m+1]*n,[m+1]*n,[m+1]*n\r\nfor i in range(n):\r\n s=input()\r\n for j, c in enumerate(s):\r\n z=min(j, m-j)\r\n if c>='0' and c<='9':\r\n m1[i]=min(m1[i],z)\r\n else:\r\n if c>='a' and c<='z':\r\n m2[i]=min(m2[i],z)\r\n else:\r\n m3[i]=min(m3[i],z)\r\nans=m*3\r\nfor i in range(n):\r\n for j in range(n):\r\n if i!=j:\r\n for p in range(n):\r\n if i!=p and j!=p:\r\n ans=min(ans,m1[i]+m2[j]+m3[p])\r\nprint(ans)\r\n", "import copy\r\nn,m=map(int,input().split())\r\nL=[input() for i in range(n) ]\r\nq=[\"#\",\"*\",\"&\"]\r\nlis=[]\r\nv=[0,0,0]\r\ni,j=0,0\r\nfor i in range(n) :\r\n l=[99999999,9999999,999999999]\r\n if 97<=ord(L[i][0])<=122 :\r\n l[0]=0\r\n v[0]+=1\r\n if 48<=ord(L[i][0])<=57 :\r\n l[1]=0\r\n v[1]+=1\r\n if L[i][0] in q :\r\n l[2]=0\r\n v[2]+=1\r\n for j in range(1,m) :\r\n \r\n e=min(j,m-j)\r\n if 97<=ord(L[i][j])<=122 :\r\n l[0]=min(l[0],e)\r\n \r\n if 48<=ord(L[i][j])<=57 :\r\n l[1]=min(l[1],e)\r\n \r\n if L[i][j] in q :\r\n l[2]=min(l[2],e)\r\n \r\n lis.append(l+[i])\r\n\r\nif v[0]>=2 :\r\n i,j=1,2\r\nif v[1]>=2 :\r\n i,j=0,2\r\nif v[2]>=2 :\r\n i,j=0,1\r\nlis2=copy.copy(lis)\r\nlis2=sorted(lis2,key=lambda x :x[j])\r\nlis=sorted(lis,key=lambda x :x[i])\r\n\r\nif lis[0][3]!=lis2[0][3] :\r\n print(lis[0][i]+lis2[0][j])\r\nelse :\r\n e1=lis[0][i]+lis2[1][j]\r\n e2=lis[1][i]+lis2[0][j]\r\n print(min(e1,e2))\r\n \r\n \r\n \r\n \r\n \r\n \r\n", "N, M = map(int, input().split())\r\nstr = []\r\nfor i in range(N):\r\n str.append(input())\r\n\r\n\r\nclass Row:\r\n def __init__(self, ):\r\n self.ch = int(1e9)\r\n self.az = int(1e9)\r\n self.num = int(1e9)\r\n self.used = False\r\n\r\n\r\ndef is_int(n):\r\n try:\r\n int(n)\r\n return True\r\n except ValueError:\r\n return False\r\n\r\n\r\ndef rec(c, param):\r\n c = sorted(c, key=lambda a: getattr(a, param))\r\n best = int(1e9)\r\n\r\n if param == \"ch\":\r\n next_param = \"az\"\r\n elif param == \"az\":\r\n next_param = \"num\"\r\n else:\r\n next_param = None\r\n\r\n if next_param is not None:\r\n for row in c:\r\n if not row.used:\r\n row.used = True\r\n best = min(best, getattr(row, param) + rec(c, next_param))\r\n row.used = False\r\n else:\r\n for row in c:\r\n if not row.used:\r\n best = min(best, getattr(row, param))\r\n\r\n return best\r\n\r\n\r\ndef main():\r\n c = [Row() for _ in range(N)]\r\n for i in range(N):\r\n for j in range(M):\r\n dist = min(j, M-j)\r\n if 'a' <= str[i][j] <= 'z':\r\n c[i].az = min(c[i].az, dist)\r\n elif is_int(str[i][j]):\r\n c[i].num = min(c[i].num, dist)\r\n else:\r\n c[i].ch = min(c[i].ch, dist)\r\n\r\n print(rec(c, \"ch\"))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n, m = map(int, input().split())\r\nT = [[] for i in range(n)]\r\nfor i in range(n):\r\n T[i] = list(input())\r\nINF = float('inf')\r\ndp = [[[[INF] * 2 for i in range(2)] for j in range(2)] for k in range(100)]\r\ndp[0][0][0][0] = 0\r\nfor i in range(n):\r\n for a in range(2):\r\n for b in range(2):\r\n for c in range(2):\r\n for j in range(m):\r\n d = int(T[i][j].isdigit())\r\n e = int(T[i][j].isalpha())\r\n f = int((not d) and (not e))\r\n dp[i + 1][a | d][b | e][c | f] = min(dp[i + 1][a | d][b | e][c | f], dp[i][a][b][c] + min(j, m - j))\r\n\r\nprint(dp[n][1][1][1])\r\n\r\n\r\n", "n,m=map(int,input().split())\nc=[list([])for i in range(3)]\nfor i in range(n):\n t=input()\n s=''\n for i in range(m):\n if ord(t[i])<43:s+='1'\n elif ord(t[i])<59:s+='2'\n else: s+='3'\n x1=s.find('1') if s.find('1') != -1 else 60\n x2=s[::-1].find('1')+1 if s.find('1') != -1 else 60\n y1=s.find('2') if s.find('2') != -1 else 60\n y2=s[::-1].find('2')+1 if s.find('2') != -1 else 60\n z1=s.find('3') if s.find('3') != -1 else 60\n z2=s[::-1].find('3')+1 if s.find('3') != -1 else 60\n x,y,z=min(x1,x2),min(y1,y2),min(z1,z2)\n c[0].append(x)\n c[1].append(y)\n c[2].append(z)\n \na=[list([])for i in range(3)]\nj=0\nfor i in c:\n for _ in range(3):\n t=min(i)\n s=i.index(t)\n c[j][s]=60\n a[j].append([s,t])\n j+=1\n\nans=10**10\nfor i in range(3):\n for j in range(3):\n for k in range(3):\n x,y,z=a[0][i],a[1][j],a[2][k]\n if len(set([x[0],y[0],z[0]]))!=3:continue\n ans=min(ans,x[1]+y[1]+z[1])\nprint(ans)\n \n \n\n\n\n\n\n\n\n", "from sys import stdin,stdout\r\ninput = stdin.readline\r\nfrom math import inf\r\nn,m = map(int,input().split())\r\nspechar = \"*#&\"\r\nnum = \"0123456789\"\r\nalpha = \"abcdefghijklmnopqrstuvwxyz\"\r\nmin1 = []\r\nmin2 = []\r\nmin3 = []\r\nfor p in range(n):\r\n str1 = list(map(str,input().split()))\r\n str1 = str1[0]\r\n a = inf\r\n b = inf\r\n c = inf\r\n for i in range(m):\r\n if str1[i] in num:\r\n a = min(a,i,m-i)\r\n elif str1[i] in alpha:\r\n b = min(b,i,m-i)\r\n else:\r\n c = min(c,i,m-i)\r\n min2.append((p,a))\r\n min3.append((p,b))\r\n min1.append((p,c))\r\nans = inf\r\nfor k in range(len(min1)):\r\n for u in range(len(min2)):\r\n if min2[u][0] != min1[k][0]:\r\n for r in range(len(min3)):\r\n if min3[r][0] != min2[u][0] and min3[r][0] != min1[k][0]:\r\n ans = min(ans,min3[r][1] + min1[k][1] + min2[u][1])\r\nprint(ans)", "import string\r\n\r\n\r\ndef get_min_distance(str, alphabet):\r\n m = len(str)\r\n mi = m\r\n for i in range(m):\r\n if str[i] in alphabet:\r\n mi = min(i, mi)\r\n break\r\n for i in range(m):\r\n if str[-i] in alphabet:\r\n mi = min(i, mi)\r\n break\r\n return mi\r\n\r\nn, m = map(int, input().split())\r\nstrs = []\r\nfor i in range(n):\r\n strs.append(input())\r\nmins = []\r\nfor i in range(n):\r\n mins.append([get_min_distance(strs[i], string.digits),\r\n get_min_distance(strs[i], string.ascii_lowercase),\r\n get_min_distance(strs[i], \"#*&\")])\r\n# print(mins)\r\n\r\nmincost = 10**6\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == j:\r\n continue\r\n for k in range(n):\r\n if j == k or i == k:\r\n continue\r\n mincost = min(mincost, mins[i][0] + mins[j][1] + mins[k][2])\r\nprint(mincost)", "n, m = map(int, input().split())\r\ns = [input() for i in range(0, n)]\r\ndp = [[n*m + 1] * 8 for i in range(0, n + 1)]\r\n\r\n\r\ndef minLenA(s):\r\n for i in range(0, len(s)):\r\n if '0' <= s[i] <= '9':\r\n return i;\r\n return m + 1\r\n\r\ndef minLenB(s):\r\n for i in range(0, len(s)):\r\n if 'a' <= s[i] <= 'z':\r\n return i;\r\n return m + 1\r\n\r\ndef minLenC(s):\r\n for i in range(0, len(s)):\r\n if s[i] in [\"#\", \"*\", \"&\"]:\r\n return i;\r\n return m + 1\r\n\r\ndp[0][0] = 0\r\ndp[0][1:] = [n*m + 1] * 7\r\n\r\nl = [[0] * 3 for i in range(0, n)]\r\nfor i in range(0, n):\r\n l[i][0] = min(minLenA(s[i]),1 + minLenA(list(reversed(s[i]))))\r\n l[i][1] = min(minLenB(s[i]), 1 +minLenB(list(reversed(s[i]))))\r\n l[i][2] = min(minLenC(s[i]), 1 + minLenC(list(reversed(s[i]))))\r\nfor i in range(1, n + 1):\r\n for j in range(0, 8):\r\n dp[i][j] = min(dp[i - 1][j ^ 1] + l[i-1][0], dp[i-1][j],dp[i][j]);\r\n dp[i][j] = min(dp[i - 1][j ^ 2] + l[i-1][1], dp[i-1][j],dp[i][j]);\r\n dp[i][j] = min(dp[i - 1][j ^ 4] + l[i-1][2],dp[i-1][j],dp[i][j]);\r\nprint(dp[-1][7])", "# Love u Atreyee! Hope u understand me soon\nn, m = map(int, input().split())\ndp = [[n*n for i in range(3)] for j in range(n)] #0-no, 1-symb,2, char\nsymb = [\"#\", \"*\", \"&\"]\nnumbers=\"0123456789\"\nli = []\nfor _ in range(n):\n li.append(input())\nfor i in range(n):\n x = li[i]\n for j in range(m):\n y = x[j]\n if y in numbers:\n dp[i][0] = min(dp[i][0], j, m - j)\n elif y in symb:\n dp[i][1] = min(dp[i][1], j, m - j)\n else:\n dp[i][2] = min(dp[i][2], j, m - j)\nans = n * n * n\nfor i in range(n):\n for j in range(n):\n for k in range(n):\n if i != j and j != k and k != i:\n ans = min(ans, dp[i][0] + dp[j][1] + dp[k][2])\nprint(ans)", "import string\nfrom itertools import permutations\n\nn, m = [int(i) for i in input().split()]\n\ndigits = string.digits\nletters = string.ascii_lowercase\nsymbols = '#*&'\n\nA = [[50,50,50] for i in range(n)]\nfor i in range(n):\n tmp_str = input()\n for j in range(m):\n if tmp_str[j] in digits:\n A[i][0] = min(A[i][0], j%m, (-j)%m)\n elif tmp_str[j] in letters:\n A[i][1] = min(A[i][1], j%m, (-j)%m)\n else:\n A[i][2] = min(A[i][2], j%m, (-j)%m)\n\nanswer = 100\nfor i in range(n):\n for j in range(i+1, n):\n for k in range(j+1, n):\n for l in permutations([i,j,k]):\n answer = min(answer, sum([ A[l[p]][p] for p in range(3)]))\nprint(answer)", "import math\n\nn, m = map(int, input().split())\nSYMBOLS = ['&', '*', '#']\n\nstrs = []\n\nfor i in range(n):\n\tstrs.append(list(input()))\n\nminA = [m] * n\nminD = [m] * n\nminS = [m] * n\nfor i, s in enumerate(strs):\n\tfor j, c in enumerate(list(s)):\n\t\tdist = min(j, m - j)\n\t\t# print(dist)\n\t\tif c.isalpha() and minA[i] > dist:\n\t\t\tminA[i] = dist\n\t\tif c.isdigit() and minD[i] > dist:\n\t\t\tminD[i] = dist\n\t\tif c in SYMBOLS and minS[i] > dist:\n\t\t\tminS[i] = dist\n\nminDist = math.inf\nfor i in range(n):\n\tfor j in range(n):\n\t\tfor k in range(n):\n\t\t\tsumma = minA[i] + minD[j] + minS[k]\n\t\t\tif i != j and j != k and i != k and minDist > summa:\n\t\t\t\tminDist = summa\n\nprint(minDist)\n", "n, m = map(int, input().split())\r\ns = []\r\nc = list(range(55))\r\nd = list(range(55))\r\nsym = list(range(55))\r\nmn = 2147483647\r\nfor i in range(55):\r\n c[i] = 0\r\n d[i] = 0\r\n sym[i] = 0\r\nfor i in range(n):\r\n s.append(input())\r\nfor i in range(n):\r\n c[i] = 100\r\n d[i] = 100\r\n sym[i] = 100\r\n for j in range(m):\r\n if s[i][j] >= 'a' and s[i][j] <= 'z':\r\n c[i] = min(c[i], min(j, m - j))\r\n if s[i][j] >= '0' and s[i][j] <= '9':\r\n d[i] = min(d[i], min(j, m - j))\r\n if s[i][j] >= '#' and s[i][j] <= '*':\r\n sym[i] = min(sym[i], min(j, m - j))\r\nfor i in range(n):\r\n for j in range(n):\r\n for k in range(n):\r\n if i == j or i == k or k == j:\r\n continue\r\n else:\r\n mn = min(mn, c[i] + d[j] + sym[k])\r\nprint(mn)", "a = list(map(int, input().split()))\r\nn, m = a[0], a[1]\r\ns = []\r\nfor i in range(0, n):\r\n s.append(input())\r\n \r\ndigit, letter, special = [], [], []\r\nfor k in range(0, n):\r\n flag_d = flag_l = flag_s = 0\r\n for i in range(0, m):\r\n if ord(s[k][i]) >= 97 and ord(s[k][i]) <= 122:\r\n mi = min(i, m - i)\r\n if flag_l == 0:\r\n letter.append([k, mi])\r\n else:\r\n if mi < letter[len(letter) - 1][1]:\r\n letter[len(letter) - 1] = [k, mi]\r\n flag_l = 1\r\n elif ord(s[k][i]) >= 48 and ord(s[k][i]) <= 57:\r\n mi = min(i, m - i)\r\n if flag_d == 0:\r\n digit.append([k, mi])\r\n else:\r\n if mi < digit[len(digit) - 1][1]:\r\n digit[len(digit) - 1] = [k, mi]\r\n flag_d = 1\r\n elif s[k][i] == '#' or s[k][i] == '*' or s[k][i] == '&':\r\n mi = min(i, m - i)\r\n if flag_s == 0:\r\n special.append([k, mi])\r\n else:\r\n if mi < special[len(special) - 1][1]:\r\n special[len(special) - 1] = [k, mi]\r\n flag_s = 1\r\n \r\n\r\n#print(digit, letter, special)\r\n\r\nres = 100000000\r\nfor i in digit:\r\n for j in letter:\r\n for k in special:\r\n if i[0] != j[0] and i[0] != k[0] and j[0] != k[0] and (i[1] + j[1] + k[1] < res):\r\n res = i[1] + j[1] + k[1]\r\n #print(i[0], j[0], k[0])\r\n #print(i[1], j[1], k[1])\r\n \r\n \r\nprint(res)", "from itertools import permutations\r\n\r\n\r\nn,m=map(int,input().split())\r\narr=[]\r\nfor _ in range(n):\r\n arr.append(input())\r\ndp=[[float(\"inf\")]*3 for _ in range(n)]\r\nfor i in range(n):\r\n for j in range(len(arr[i])):\r\n temp=min(j,m-j)\r\n if arr[i][j] in \"*&#\":\r\n \r\n dp[i][0]=min(dp[i][0],temp)\r\n elif arr[i][j].isdigit():\r\n dp[i][1]=min(dp[i][1],temp)\r\n else :\r\n dp[i][2]=min(dp[i][2],temp)\r\nans=float(\"inf\")\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n for k in range(j+1,n):\r\n for p in permutations([0,1,2]):\r\n cost=dp[i][p[0]]+dp[j][p[1]]+dp[k][p[2]]\r\n ans=min(ans,cost)\r\nprint(ans)", "n, m = tuple(map(int, input().split()))\nstrings = []\nfor k in range(n):\n strings.append(input())\n\ndef f(x):\n if x in [\"0\",\"1\",\"2\",\"3\",\"4\",\"5\",\"6\",\"7\",\"8\",\"9\"]:\n return \"c\"\n elif x in [\"*\",\"#\",\"&\"]:\n return \"s\"\n else:\n return \"l\"\n\nfor k in range(n):\n strings[k] = list(map(f,strings[k]))\npointers = [1]*n\nminsc = []\nminss = []\nminsl = []\n\nfor i in range(n):\n ds,dl,dc = -1,-1,-1\n for j in range(m):\n if strings[i][j] == \"c\" and (dc == -1 or min((-j)%m,j%m) < dc):\n dc = min((-j)%m,j%m)\n if strings[i][j] == \"s\" and (ds == -1 or min((-j)%m,j%m)< ds):\n ds = min((-j)%m,j%m)\n if strings[i][j] == \"l\" and (dl == -1 or min((-j)%m,j%m) < dl):\n dl = min((-j)%m,j%m)\n minsc.append(dc)\n minss.append(ds)\n minsl.append(dl)\n\nm = -1\nfor i in range(n):\n for j in range(n):\n for k in range(n):\n if i!= j and j!=k and i!=k and not -1 in [minsc[i],minss[j],minsl[k]] and (minsc[i]+minss[j]+minsl[k] < m or m== -1):\n m = minsc[i]+minss[j]+minsl[k]\n\nprint(m)\n", "n,m=map(int,input().split())\r\na=[]\r\nfor i in range(65,91):\r\n a.append(chr(i+32))\r\nb=[]\r\nf1=0\r\nf2=0\r\nf3=0\r\nfor i in range(0,10):\r\n b.append(str(i))\r\nc=['*','#','&']\r\nl=[]\r\ns=[]\r\nl1=[1000000000 for i in range(n)]\r\nl2=[1000000000 for i in range(n)]\r\nl3=[1000000000 for i in range(n)]\r\nf=[1 for i in range(n)]\r\nff1=0\r\nff2=0\r\nff3=0\r\nfor i in range(n):\r\n l.append(list(str(input())))\r\n s+=l[i][0]\r\n if s[i] in a:\r\n ff1+=1\r\n elif s[i] in b:\r\n ff2+=1\r\n else:\r\n ff3+=1\r\nfor i in range(n):\r\n if ff1==1:\r\n if l[i][0] in a:\r\n f[i]=0\r\n elif ff2==1:\r\n if l[i][0] in b:\r\n f[i]=0\r\n elif ff3==1:\r\n if l[i][0] in c:\r\n f[i]=0\r\nfor i in range(n):\r\n for j in range(m):\r\n if l[i][j] in a and f[i]:\r\n l1[i]=min(l1[i],j,m-j)\r\n for j in range(m):\r\n if l[i][j] in b and f[i]:\r\n l2[i]=min(l2[i],j,m-j)\r\n for j in range(m):\r\n if l[i][j] in c and f[i]:\r\n l3[i]=min(l3[i],j,m-j)\r\nfor i in range(26):\r\n if chr(i+97) in s:\r\n f1=1\r\nfor i in range(10):\r\n if b[i] in s:\r\n f2=1\r\nfor i in range(3):\r\n if c[i] in s:\r\n f3=1\r\n#print(l1,l2,l3)\r\n#print(f1,f2,f3)\r\nif f1+f2+f3==3:\r\n print(0)\r\n exit()\r\nelif f1+f2+f3==2:\r\n if f1==0:\r\n print(min(l1))\r\n elif f2==0:\r\n print(min(l2))\r\n else:\r\n print(min(l3))\r\nelse:\r\n if f1==1:\r\n ans=20*m\r\n for i in range(n):\r\n for j in range(n):\r\n if i!=j and l2[i]<=1000 and l3[j]<=1000:\r\n ans=min(ans,l2[i]+l3[j])\r\n elif f2==1:\r\n ans=20*m\r\n for i in range(n):\r\n for j in range(n):\r\n if i!=j and l1[i]<=1000 and l3[j]<=1000:\r\n ans=min(ans,l1[i]+l3[j])\r\n elif f3==1:\r\n ans=20*m\r\n for i in range(n):\r\n for j in range(n):\r\n if i!=j and l1[i]<=1000 and l2[j]<=1000:\r\n ans=min(ans,l1[i]+l2[j])\r\n print(ans)", "n, m = map(int, input().split())\r\nmas = []\r\nINF = 1e10\r\ndist = [[INF, INF, INF] for i in range(n)]\r\nfor i in range(n):\r\n s = input()\r\n mas.append(s)\r\n for j in range(m):\r\n if s[j] >= 'a' and s[j] <= 'z':\r\n dist[i][0] = min(dist[i][0], j)\r\n if s[j] >= '0' and s[j] <= '9':\r\n dist[i][1] = min(dist[i][1], j)\r\n if s[j] == '#' or s[j] == '*' or s[j] == '&':\r\n dist[i][2] = min(dist[i][2], j)\r\n for j in range(1, m + 1):\r\n if s[-j] >= 'a' and s[-j] <= 'z':\r\n dist[i][0] = min(dist[i][0], j)\r\n if s[-j] >= '0' and s[-j] <= '9':\r\n dist[i][1] = min(dist[i][1], j)\r\n if s[-j] == '#' or s[-j] == '*' or s[-j] == '&':\r\n dist[i][2] = min(dist[i][2], j)\r\nmin1 = INF\r\nfor i in range(n):\r\n for j in range(n):\r\n for k in range(n):\r\n if (i == j or j == k or i == k):\r\n continue\r\n #print(dist[, j, k, i[0], j[1], k[2])\r\n if dist[i][0] + dist[j][1] + dist[k][2] < min1:\r\n min1 = dist[i][0] + dist[j][1] + dist[k][2]\r\nprint(min1)", "from itertools import permutations\r\n\r\nR = lambda: map(int, input().split())\r\nn, m = R()\r\nmx = [[10 ** 9, 10 ** 9, 10 ** 9] for _ in range(n)]\r\nfor r in range(n):\r\n s = input()\r\n for i in range(m):\r\n if s[i].isalpha():\r\n mx[r][0] = min(mx[r][0], i, m - i)\r\n elif s[i].isnumeric():\r\n mx[r][1] = min(mx[r][1], i, m - i)\r\n else:\r\n mx[r][2] = min(mx[r][2], i, m - i)\r\nres = 10 ** 9\r\nfor i in range(n):\r\n for j in range(i + 1, n):\r\n for k in range(j + 1, n):\r\n res = min([res] + [mx[i][p[0]] + mx[j][p[1]] + mx[k][p[2]] for p in permutations([0, 1, 2])])\r\nprint(res)", "def lol():\r\n ans = INF\r\n for i in range(n):\r\n for j in range(n):\r\n for k in range(n):\r\n if i == j or j == k or k == i:\r\n continue\r\n \r\n a, b, c = INF, INF, INF\r\n for i1 in range(m):\r\n if 48 <= ord(s[i][i1]) <= 57 or 48 <= ord(s[i][-i1]) <= 57:\r\n a = min(a, i1)\r\n \r\n if 97 <= ord(s[j][i1]) <= 122 or 97 <= ord(s[j][-i1]) <= 122:\r\n b = min(b, i1) \r\n \r\n if s[k][i1] in sim or s[k][-i1] in sim:\r\n c = min(c, i1) \r\n \r\n if a < INF and b < INF and c < INF:\r\n break\r\n \r\n ans = min(ans, a + b + c) \r\n return ans\r\n\r\n\r\nn, m = map(int, input().split())\r\n\r\nINF = 10 ** 9\r\ns = [0] * n\r\nsim = ['*', '&', '#']\r\nfor i in range(n):\r\n new = input()\r\n s[i] = new + new\r\n\r\nans = lol()\r\n \r\nif ans >= INF:\r\n print(-1)\r\nelse:\r\n print(ans)", "n, m = map(int, input().split())\r\nstrs = [input() for _ in range(n)]\r\nans = n*m*n\r\ndig = [ans for _ in range(n)]\r\nla = [ans for _ in range(n)]\r\nsp = [ans for _ in range(n)]\r\nd = {}\r\nfor i in \"#*&\":\r\n d[i] = sp\r\nfor i in \"0123456789\":\r\n d[i] = dig\r\nfor i in \"abcdefghijklmnopqrstuvwxyz\":\r\n d[i] = la\r\n \r\nfor i in range(n):\r\n for j in range(m):\r\n d[strs[i][j]][i] = min(d[strs[i][j]][i], min(j, m - j))\r\n \r\nfor i in range(n):\r\n for j in range(n):\r\n for k in range(n):\r\n if i != k and i != j and j != k:\r\n ans = min(ans, dig[i]+la[j]+sp[k])\r\nprint(ans)# 1690792934.3212337", "n, m = [int(el) for el in input().split()]\r\n\r\ndig = [m] * n\r\nnum = [m] * n\r\nsym = [m] * n\r\nfor ind in range(n):\r\n\ts = input()\r\n\tfor i, c in enumerate(s):\r\n\t\tmn = min(i, m - i)\r\n\t\tif '0' <= c <= '9':\r\n\t\t\tdig[ind] = min(dig[ind], mn)\r\n\t\telif 'a' <= c <= 'z':\r\n\t\t\tnum[ind] = min(num[ind], mn)\r\n\t\telse:\r\n\t\t\tsym[ind] = min(sym[ind], mn)\r\n\t\t\t\r\nans = m * 3\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif j == i:\r\n\t\t\tcontinue\r\n\t\tfor k in range(n):\r\n\t\t\tif k == i or k == j:\r\n\t\t\t\tcontinue\r\n\t\t\tans = min(ans, dig[i] + num[j] + sym[k])\r\n\r\nprint(ans)", "n, m = map(int, input().split())\r\n\r\n# Initialize the minimum moves required for each condition\r\ndigit_moves = [float('inf')] * n\r\nlowercase_moves = [float('inf')] * n\r\nsymbol_moves = [float('inf')] * n\r\n\r\nfor i in range(n):\r\n s = input().strip()\r\n for j in range(m):\r\n # Calculate the minimum moves required to reach a digit\r\n if s[j].isdigit():\r\n digit_moves[i] = min(digit_moves[i], min(j, m-j))\r\n # Calculate the minimum moves required to reach a lowercase letter\r\n elif s[j].islower():\r\n lowercase_moves[i] = min(lowercase_moves[i], min(j, m-j))\r\n # Calculate the minimum moves required to reach a symbol\r\n elif s[j] in ['#', '*', '&']:\r\n symbol_moves[i] = min(symbol_moves[i], min(j, m-j))\r\n\r\n# Calculate the minimum moves required for each character\r\nans = float('inf')\r\nfor i in range(n):\r\n for j in range(n):\r\n for k in range(n):\r\n # Skip if any of the three conditions are not satisfied\r\n if i == j or i == k or j == k:\r\n continue\r\n # Calculate the total moves required for this password\r\n total_moves = digit_moves[i] + lowercase_moves[j] + symbol_moves[k]\r\n ans = min(ans, total_moves)\r\n\r\nprint(ans)", "def printMatrix(matrix):\r\n s = [[str(e) for e in row] for row in matrix]\r\n lens = [max(map(len, col)) for col in zip(*s)]\r\n fmt = '\\t'.join('{{:{}}}'.format(x) for x in lens)\r\n table = [fmt.format(*row) for row in s]\r\n print(\"_________________\")\r\n print('\\n'.join(table))\r\n print(\"`````````````````\")\r\nn,m = map(int,input().split())\r\nMatrix = [[0 for i in range(n)] for j in range(3)] \r\nfor i in range(n):\r\n temp = input()\r\n hashTag = m\r\n AtoZ = m\r\n Zero = m\r\n for j in range(m):\r\n if(temp[j] in \"#*&\"):\r\n hashTag = min(hashTag,j,m-j)\r\n elif('a'<=temp[j]<='z'):\r\n AtoZ = min(AtoZ,j,m-j)\r\n else:\r\n Zero = min(Zero,j,m-j)\r\n Matrix[0][i] = hashTag\r\n Matrix[1][i] = AtoZ\r\n Matrix[2][i] = Zero\r\n\r\nAns = m*m\r\nfor i in range(n-2):\r\n for j in range(i+1,n-1):\r\n for k in range(j+1,n):\r\n Ans = min(Ans, Matrix[0][i] + Matrix[1][j] + Matrix[2][k])\r\n Ans = min(Ans,Matrix[0][i]+Matrix[1][k]+Matrix[2][j])\r\n Ans = min(Ans, Matrix[0][j] + Matrix[1][i] + Matrix[2][k])\r\n Ans = min(Ans,Matrix[0][j]+Matrix[1][k]+Matrix[2][i])\r\n Ans = min(Ans, Matrix[0][k] + Matrix[1][j] + Matrix[2][i])\r\n Ans = min(Ans,Matrix[0][k]+Matrix[1][i]+Matrix[2][j])\r\nprint(Ans)\r\n\r\n\r\n# 2. Second\r\n# 3. Third\r\n", "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Mar 5 12:24:14 2023\r\n\r\n@author: manisarthak\r\n\"\"\"\r\n\r\n \r\n\r\ndef getType(s):\r\n n = len(s)\r\n type1, type2, type3 = 1000, 1000, 1000 # 1, a, $\r\n for i in range(n):\r\n if ord(s[i]) < 58 and ord(s[i]) > 47:\r\n type1 = min([type1, i, (n-i)%n])\r\n elif ord(s[i]) < 123 and ord(s[i]) > 96:\r\n type2 = min([type2, i, (n-i)%n])\r\n else:\r\n type3 = min([type3, i, (n-i)%n])\r\n \r\n return type1, type2, type3\r\n \r\nfrom itertools import permutations \r\n\r\ndef solve():\r\n [n, m] = list(map(int, input().split()))\r\n s = []\r\n arr = []\r\n for i in range(n):\r\n ss = input()\r\n s.append(ss)\r\n arr.append(getType(ss))\r\n l = [i for i in range(n)]\r\n l = list(permutations(l, 3))\r\n ans = 1000\r\n for ll in l :\r\n t1, t2, t3 = arr[ll[0]], arr[ll[1]], arr[ll[2]]\r\n v1 = t1[0]\r\n v2 = t2[1]\r\n v3 = t3[2]\r\n ans = min(ans, v1+v2+v3)\r\n print(ans)\r\n \r\n \r\n \r\nsolve()", "read = lambda: map(int, input().split())\r\nn, m = read()\r\na = [input() for i in range(n)]\r\nc1 = '1234567890'\r\nc2 = 'qwertyuiopasdfghjklzxcvbnm'\r\nc3 = '#&*'\r\ninf = 10 ** 20\r\nl1 = [inf] * n\r\nl2 = [inf] * n\r\nl3 = [inf] * n\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j] in c1: l1[i] = min(l1[i], j, m - j)\r\n if a[i][j] in c2: l2[i] = min(l2[i], j, m - j)\r\n if a[i][j] in c3: l3[i] = min(l3[i], j, m - j)\r\nans = inf\r\nfor i in range(n):\r\n for j in range(n):\r\n for k in range(n):\r\n if len({i, j, k}) < 3: continue\r\n cur = l1[i] + l2[j] + l3[k]\r\n ans = min(ans, cur)\r\nprint(ans)", "n,m=map(int,input().split())\r\ns=[list(input()) for i in range(n)]\r\nINF=10**18\r\nd1=[INF]*n\r\nd2=[INF]*n\r\nd3=[INF]*n\r\ndig=set(list(\"0123456789\"))\r\nalpha=set(list(\"abcdefghijklmnopqrstuvwxyz\"))\r\nmark=set(list(\"#*&\"))\r\nfor i in range(n):\r\n for j in range(m):\r\n if s[i][j] in dig:\r\n d1[i]=min([d1[i],j,m-j])\r\n elif s[i][j] in alpha:\r\n d2[i]=min([d2[i],j,m-j])\r\n elif s[i][j] in mark:\r\n d3[i]=min([d3[i],j,m-j])\r\nans=INF\r\nfor i in range(n):\r\n for j in range(n):\r\n for k in range(n):\r\n if i==j or j==k or k==i:\r\n continue\r\n ans=min(ans,d1[i]+d2[j]+d3[k])\r\nprint(ans)", "def get_min_steps(string, symb):\r\n minimum = 1e9\r\n if string[0] == symb:\r\n return minimum\r\n for lol in range(len(string)):\r\n if string[lol] == symb:\r\n if lol < minimum:\r\n minimum = lol\r\n if string[-(lol + 1)] == symb:\r\n if lol + 1 < minimum:\r\n minimum = lol + 1\r\n return minimum\r\n\r\n\r\ndef get_min_2(strings, symb1, symb2):\r\n min_i = 1e9\r\n min_j = 1e9\r\n min_i_2 = 1e9\r\n min_j_2 = 1e9\r\n sti = ''\r\n stj = ''\r\n for st in strings:\r\n steps_i = get_min_steps(st, symb1)\r\n steps_j = get_min_steps(st, symb2)\r\n if steps_j < min_j:\r\n min_j_2 = min_j\r\n min_j = steps_j\r\n stj = st\r\n if steps_i < min_i:\r\n min_i_2 = min_i\r\n min_i = steps_i\r\n sti = st\r\n if steps_i == min_i:\r\n min_i_2 = min_i\r\n if steps_j == min_j:\r\n min_j_2 = min_j\r\n min_res_1 = min_j + min_i\r\n if sti == stj:\r\n min_res_1 += min(min_j_2 - min_j, min_i_2 - min_i)\r\n return min_res_1\r\n\r\n\r\nn, m = map(int, input().split())\r\n\r\npassword = {'#': 0, 'a': 0, '0': 0}\r\nstrs = []\r\n\r\nfor _ in range(n):\r\n s = input()\r\n s_res = ''\r\n for i in s:\r\n if i == '*' or i == '&' or i == '#':\r\n s_res += '#'\r\n if 'a' <= i <= 'z':\r\n s_res += 'a'\r\n if '0' <= i <= '9':\r\n s_res += '0'\r\n password[s_res[0]] += 1\r\n strs.append(s_res)\r\n\r\nif password['#'] != 0 and password['a'] != 0 and password['0'] != 0:\r\n print(0)\r\n exit(0)\r\n\r\nmin_res = 1e9\r\nfor i in ['#', 'a', '0']:\r\n for j in ['#', 'a', '0']:\r\n if i == j:\r\n continue\r\n for k in ['#', 'a', '0']:\r\n if i == k or j == k:\r\n continue\r\n if password[i] == 0:\r\n if password[j] == 0:\r\n min_res = min(min_res, get_min_2(strs, i, j))\r\n elif password[k] == 0:\r\n continue\r\n else:\r\n if password[j] >= 2 and password[k] >= 2:\r\n for st in strs:\r\n min_res = min(get_min_steps(st, i), min_res)\r\n elif password[j] == 1:\r\n for st in strs:\r\n if st[0] != j:\r\n min_res = min(get_min_steps(st, i), min_res)\r\n else:\r\n rrrr = 1e9\r\n for st2 in strs:\r\n if st2 == st:\r\n continue\r\n rrrr = min(rrrr, get_min_steps(st2, j))\r\n min_res = min(get_min_steps(st, i) + rrrr, min_res)\r\nprint(min_res)\r\n", "n, m = list(map(lambda x: int(x), input().split()))\r\na = []\r\nfor i in range(0, n):\r\n a.append(input())\r\nnumbers = []\r\nalphabets = []\r\ncharacters = []\r\nalp = 'qwertyuiopasdfghjklzxcvbnm'\r\nnum = '0123456789'\r\nchar = '#&*'\r\n\r\nfor i in range(0, n):\r\n #\r\n min_a_d = 100\r\n min_n_d = 100\r\n min_c_d = 100\r\n for ind, j in enumerate(a[i]):\r\n if j in alp:\r\n if min(ind, m - ind) < min_a_d:\r\n min_a_d = min(ind, m - ind)\r\n\r\n if j in num:\r\n if min(ind, m - ind) < min_n_d:\r\n min_n_d = min(ind, m - ind)\r\n if j in char:\r\n if min(ind, m - ind) < min_c_d:\r\n min_c_d = min(ind, m - ind)\r\n alphabets.append((min_a_d, i))\r\n numbers.append((min_n_d, i))\r\n characters.append((min_c_d, i))\r\nalphabets.sort(key=lambda x: x[0])\r\nnumbers.sort(key=lambda x: x[0])\r\ncharacters.sort(key=lambda x: x[0])\r\nsum = 1000\r\nfor i in range(0, 3):\r\n for j in range(0, 3):\r\n for k in range(0, 3):\r\n if alphabets[i][0] + numbers[j][0] + characters[k][0] < sum and alphabets[i][1] != numbers[j][1] and \\\r\n numbers[j][1] != characters[k][1] and alphabets[i][1] != characters[k][1]:\r\n sum=alphabets[i][0] + numbers[j][0] + characters[k][0]\r\nprint(sum)", "n,m=map(int,input().split())\r\nby=[m]*n\r\nch=[m]*n\r\nsy=[m]*n\r\nfor x in range(n):\r\n\ta=input()\r\n\tfor i,c in enumerate(a):\r\n\t mi=min(m-i,i)\r\n\t if '0'<=c<='9': \r\n\t by[x]=min(by[x],mi)\r\n\t elif 'a' <= c <= 'z':\r\n\t ch[x]=min(ch[x],mi)\r\n\t else:\r\n\t sy[x]= min(sy[x],mi)\r\nans=m*3\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif i==j:continue\r\n\t\tfor k in range(n):\r\n\t\t\tif i==k or j==k:continue\r\n\t\t\tans=min(ans,by[i]+ch[j]+sy[k])\r\nprint(ans)", "import math,sys\r\n#from itertools import permutations, combinations;import heapq,random;\r\nfrom collections import defaultdict,deque\r\nimport bisect as bi\r\ndef yes():print('YES')\r\ndef no():print('NO')\r\n#sys.stdin=open('input.txt','r');sys.stdout=open('output.txt','w');\r\ndef I():return (int(sys.stdin.readline()))\r\ndef In():return(map(int,sys.stdin.readline().split()))\r\ndef Sn():return sys.stdin.readline().strip()\r\n#sys.setrecursionlimit(1500)\r\ndef dict(a):\r\n d={} \r\n for x in a:\r\n if d.get(x,-1)!=-1:\r\n d[x]+=1\r\n else:\r\n d[x]=1\r\n return d\r\ndef find_gt(a, x):\r\n 'Find leftmost value greater than x'\r\n i = bi.bisect_left(a, x)\r\n if i != len(a):\r\n return i\r\n else: \r\n return -1\r\ndef main():\r\n try:\r\n n,m=In()\r\n l=[Sn() for i in range(n)]\r\n dp=[]\r\n s1=set(['*','#','&'])\r\n s2=set([str(i) for i in range(10)])\r\n for i in range(n):\r\n dp.append([float('inf') for i in range(3)])\r\n for j in range(m):\r\n if l[i][j] in s1:\r\n dp[i][2]=min(dp[i][2],m-j,j)\r\n elif l[i][j] in s2:\r\n dp[i][1]=min(dp[i][1],m-j,j)\r\n else:\r\n dp[i][0]=min(dp[i][0],m-j,j)\r\n ans=float('inf')\r\n for i in range(n):\r\n for j in range(n):\r\n for k in range(n):\r\n if i==j or j==k or i==k:\r\n continue\r\n else:\r\n ans=min(ans,dp[i][0]+dp[j][1]+dp[k][2])\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(I()):main()\r\n for _ in range(1):main()\r\n#End#\r\n\r\n# ******************* All The Best ******************* #", "\"\"\"\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 n,m=map(int,input().split())\r\n num=[100000]*100\r\n char=[100000]*100\r\n special=[100000]*100\r\n for i in range(n):\r\n s=input()\r\n for j in range(m):\r\n if s[j]>='0' and s[j]<='9':\r\n num[i]=min(num[i],min(j,m-j))\r\n if s[j]>='a' and s[j]<='z':\r\n char[i]=min(char[i],min(j,m-j))\r\n if s[j]=='*' or s[j]=='#' or s[j]=='&':\r\n special[i]=min(special[i],min(j,m-j))\r\n ans=100000\r\n for i in range(n):\r\n for j in range(n):\r\n for k in range(n):\r\n if i==k or j==k or i==j:\r\n continue\r\n ans=min(ans,num[i]+char[j]+special[k])\r\n print(ans) \r\n\r\nsolution()", "n,m = map(int,input().split())\r\nlis=[]\r\nfor i in range(n):\r\n ss = list(input())\r\n tmp=[10000]*3\r\n for i in range(m):\r\n a=min(i,m-i)\r\n if ss[i]>='0' and ss[i]<='9':\r\n tmp[0]=min(tmp[0],a)\r\n elif ss[i]>='a' and ss[i]<='z':\r\n tmp[1]=min(tmp[1],a)\r\n elif ss[i]=='#' or ss[i]=='*' or ss[i]=='&':\r\n tmp[2]=min(tmp[2],a)\r\n lis.append(tmp)\r\n#print(lis)\r\nans=10000000000 \r\nfor i in range(n):\r\n for j in range(n):\r\n for k in range(n):\r\n if i!=j and j!=k and i!=k:\r\n ans=min(lis[i][0]+lis[j][1]+lis[k][2],ans)\r\nprint(ans) \r\n\r\n", "n, m = map(int, input().split())\r\ntmp = [input() for _ in range(n)]\r\narr = []\r\nfor s in tmp:\r\n t = [1e4, 1e4, 1e4]\r\n for j in range(m):\r\n if s[j] >= '0' and s[j] <= '9':\r\n t[0] = min(j, t[0], m-j)\r\n elif s[j] >= 'a' and s[j] <= 'z':\r\n t[1] = min(j, t[1], m-j)\r\n else:\r\n t[2] = min(j, t[2], m-j)\r\n arr.append(t)\r\nres = 1e4\r\nfor i in range(n):\r\n for j in range(n):\r\n for k in range(n):\r\n if i == j or j == k or i == k:\r\n continue\r\n res = min(res, arr[i][0] + arr[j][1] + arr[k][2])\r\nprint(res)\r\n", "def func(s):\n\ta = 100000\n\tfor i in range(len(s)+1):\n\t\tif(i==len(s)):\n\t\t\ti = 100000\n\t\t\tbreak\n\t\tif(s[i].isalpha()):\n\t\t\tbreak\n\tfor j in range(len(s)+1):\n\t\tif(j==len(s)):\n\t\t\tj = 100000\n\t\t\tbreak\n\t\tif(s[-j].isalpha()):\n\t\t\tbreak\n\ta = min(i, j)\n\n\tb = 100000\n\tfor i in range(len(s)+1):\n\t\tif(i==len(s)):\n\t\t\ti = 100000\n\t\t\tbreak\n\t\ttry:\n\t\t\tn = int(s[i])\n\t\t\tbreak\n\t\texcept:\n\t\t\tcontinue\n\tfor j in range(len(s)+1):\n\t\tif(j==len(s)):\n\t\t\tj = 100000\n\t\t\tbreak\n\t\ttry:\n\t\t\tn = int(s[-j])\n\t\t\tbreak\n\t\texcept:\n\t\t\tcontinue\n\tb = min(i, j)\n\n\tc = 100000\n\tfor i in range(len(s)+1):\n\t\tif(i==len(s)):\n\t\t\ti = 100000\n\t\t\tbreak\n\t\tif(s[i]=='#' or s[i]=='&' or s[i]=='*'):\n\t\t\tbreak\n\tfor j in range(len(s)+1):\n\t\tif(j==len(s)):\n\t\t\tj = 100000\n\t\t\tbreak\n\t\tif(s[-j]=='#' or s[-j]=='&' or s[-j]=='*'):\n\t\t\tbreak\n\tc = min(i, j)\n\treturn [a, b, c]\n\nn, m = map(int, input().split())\nx = []\nfor i in range(n):\n\ts = input()\n\tx += [func(s)]\nmn = 1000000\nfor i in range(n):\n\tfor j in range(i+1, n):\n\t\tfor k in range(j+1, n):\n\t\t\ta = x[i]\n\t\t\tb = x[j]\n\t\t\tc = x[k]\n\t\t\tmn = min([mn, a[0]+b[1]+c[2], a[0]+b[2]+c[1], a[1]+b[0]+c[2], a[1]+b[2]+c[0], a[2]+b[1]+c[0], a[2]+b[0]+c[1]])\nprint(mn)\t\t\t\n", "n,m=list(map(int,input().split()))\r\nstrings=[]\r\nlis1=[\"#\",\"*\",\"&\"]\r\nlis2=[\"0\",\"1\",\"2\",\"3\",\"4\",\"5\",\"6\",\"7\",\"8\",\"9\"]\r\nlis3=[\"a\",\"b\",\"c\",\"d\",\"e\",\"f\",\"g\",\"h\",\"i\",\"i\",\"j\",\"k\",\"l\",\"m\",\"n\",\"o\",\"p\",\"q\",\"r\",\"s\",\"t\",\"u\",\"v\",\"w\",\"x\",\"y\",\"z\"]\r\nfor i in range(n):\r\n s=str(input())\r\n strings.append(s)\r\nmatrix=[]\r\nfor i in range(n):\r\n num=[m,m,m]\r\n mini=m\r\n for j in range(m):\r\n if strings[i][j] in lis1:\r\n mini=min(mini,j,m-j)\r\n num[0]=mini\r\n mini=m\r\n for j in range(m):\r\n if strings[i][j] in lis2:\r\n mini=min(mini,j,m-j)\r\n num[1]=mini\r\n mini=m\r\n for j in range(m):\r\n if strings[i][j] in lis3:\r\n mini=min(mini,j,m-j)\r\n num[2]=mini \r\n matrix.append(num)\r\nanswer=[]\r\nfor i in range(n):\r\n a=matrix[i][0]\r\n for j in range(n):\r\n if i!=j:\r\n b=matrix[j][1]\r\n for k in range(n):\r\n if k!=j and k!=i:\r\n c=matrix[k][2]\r\n answer.append(a+b+c)\r\nprint(min(answer))", "from sys import stdin, stdout\nfrom functools import partial\n\nONLINE_JUDGE = 1\nif ONLINE_JUDGE:\n inp = stdin\n out = stdout\nelse:\n inp = open('input.txt', 'r')\n out = open('output.txt', 'w')\nprint_f = partial(print, file=out)\n\nINF = 1000000\n\n\ndef find_dist(s: str, check) -> int:\n m = INF\n for i in range(len(s)):\n if check(s[i]):\n m = min(m, i, len(s) - i)\n return m\n\nn, m = [int(i) for i in inp.readline().split()]\n\nstrs = [line.strip() for line in inp.readlines()]\n\nmin1 = [find_dist(s, lambda c: ord('0') <= ord(c) <= ord('9')) for s in strs]\nmin2 = [find_dist(s, lambda c: ord('a') <= ord(c) <= ord('z')) for s in strs]\nmin3 = [find_dist(s, lambda c: c == '#' or c == '*' or c == '&') for s in strs]\n\nmm = INF\nfor i1, m1 in enumerate(min1):\n for i2, m2 in enumerate(min2):\n for i3, m3 in enumerate(min3):\n if len({i1, i2, i3}) == 3:\n mm = min(mm, INF, m1 + m2 + m3)\n\nprint_f(mm)\n", "n, m = [int(i) for i in input().split()]\r\ninf = 10 ** 18\r\nfl = [inf] * n\r\nfn = [inf] * n\r\nfs = [inf] * n\r\nfor i in range(n):\r\n s = input()\r\n for q in range(m):\r\n if s[q] >= '0' and s[q] <= '9' and fn[i] == inf:\r\n fn[i] = q\r\n if s[q] >= 'a' and s[q] <= 'z' and fl[i] == inf:\r\n fl[i] = q\r\n if s[q] in ['#', '*', '&'] and fs[i] == inf:\r\n fs[i] = q\r\n for q in range(m - 1, -1, -1):\r\n if s[q] >= '0' and s[q] <= '9':\r\n fn[i] = min(fn[i], m - q)\r\n if s[q] >= 'a' and s[q] <= 'z':\r\n fl[i] = min(fl[i], m - q)\r\n if s[q] in ['#', '*', '&']:\r\n fs[i] = min(fs[i], m - q)\r\nans = inf\r\nfor i in range(n):\r\n for q in range(n):\r\n if i == q:\r\n continue\r\n for j in range(n):\r\n if i == j or q == j:\r\n continue\r\n ans = min(ans, fn[i] + fl[q] + fs[j])\r\nprint(ans)\r\n ", "n, m = map(int, input().split())\nchar = [m * 100] * n\ndig = [m * 100] * n\nsymb = [m * 100] * n\nfor i in range(n):\n\ts = input()\n\tfor j, c in enumerate(s):\n\t\tif c in '*#&':\n\t\t\tsymb[i] = min(symb[i], j, m - j)\n\t\telif c.isdigit():\n\t\t\tdig[i] = min(dig[i], j, m - j)\n\t\telse:\n\t\t\tchar[i] = min(char[i], j, m - j)\nanswer = m * 100\nfor c in range(n):\n\tfor s in range(n):\n\t\tfor d in range(n):\n\t\t\tif len(set([c, s, d])) == 3:\n\t\t\t\tanswer = min(answer, char[c] + symb[s] + dig[d])\nprint(answer)\n", "import math, itertools\nn, m = map(int, input().split())\nstrings = []\nfor _ in range(n):\n strings.append(input())\n# print(strings)\ntrans = str.maketrans('0123456789qwertyuiopasdfghjklzxcvbnm#*&', '000000000011111111111111111111111111222')\nfor i in range(n):\n strings[i] = strings[i].translate(trans)\n# print(strings)\naa, bb, cc = [],[],[]\nfor i in range(n):\n forward, back = strings[i][:m//2 + 1], strings[i][m//2 + 1:][::-1]\n # print(forward, back)\n a = min(forward.index('0') if '0' in forward else math.inf, back.index('0') + 1 if '0' in back else math.inf)\n b = min(forward.index('1') if '1' in forward else math.inf, back.index('1') + 1 if '1' in back else math.inf)\n c = min(forward.index('2') if '2' in forward else math.inf, back.index('2') + 1 if '2' in back else math.inf)\n # print(a, b, c)\n aa.append((i, a))\n bb.append((i, b))\n cc.append((i, c))\naa.sort(key=lambda x: x[1])\nbb.sort(key=lambda x: x[1])\ncc.sort(key=lambda x: x[1])\n# print(aa[:3], bb[:3], cc[:3])\ncomb = itertools.product(aa, bb, cc)\nminimum = math.inf\n# print(list(comb))\nfor c in list(comb):\n if len({c[0][0], c[1][0], c[2][0]}) == 3:\n minimum = min(minimum, sum(x[1] for x in c))\nprint(minimum)\n", "R= lambda: map(int,input().split())\r\nn,m= R()\r\nl=[[150,150,150] for i in range(n)]\r\nfor i in range(n):\r\n a=input()\r\n for j in range(m):\r\n if a[j] in ['#','*','&']: l[i][2]=min(l[i][2],min(j,m-j))\r\n elif a[j].isdigit(): l[i][1]=min(l[i][1],min(j,m-j))\r\n else: l[i][0]=min(l[i][0],min(j,m-j))\r\nans=150\r\nfor i in range(n):\r\n for j in range(n):\r\n if j==i: continue\r\n for k in range(n):\r\n if k==i or k==j: continue\r\n ans=min(ans,l[i][0]+l[j][1]+l[k][2])\r\nprint(ans)", " ###### ### ####### ####### ## # ##### ### ##### \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 *\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, m = gil()\r\ns = [g() for _ in range(n)]\r\n\r\ndef getIdx(ch):\r\n return 1 if ch in '#*&' else (2 if ch.isnumeric() else 0)\r\n\r\n\r\nat = [[inf for _ in range(3)] for _ in range(n)]\r\n\r\nfor si in range(n):\r\n for i in range(m):\r\n idx = getIdx(s[si][i])\r\n at[si][idx] = min(i, m-i, at[si][idx])\r\n\r\n\r\nl = [at[i][:] for i in range(n)]\r\nr = [at[i][:] for i in range(n)]\r\n\r\nfor i in range(1, n):\r\n for j in range(3):\r\n l[i][j] = min(l[i][j], l[i-1][j])\r\n\r\nfor i in reversed(range(n-1)):\r\n for j in range(3):\r\n r[i][j] = min(r[i][j], r[i+1][j])\r\n\r\n\r\nans = inf\r\nidx = [(0, 1, 2), (0, 2, 1), (1, 2, 0), (1, 0, 2), (2, 1, 0), (2, 0, 1)]\r\n\r\nfor i in range(1, n-1):\r\n for lidx, m, ridx in idx:\r\n ans = min(ans, l[i-1][lidx] + at[i][m] + r[i+1][ridx])\r\n\r\nprint(ans)" ]

[ "from functools import cmp_to_key\r\n\r\ndef comparator(a, b) :\r\n if a[0] > b[0] :\r\n return -1\r\n if a[0] < b[0] :\r\n return 1\r\n if a[1] < b[1] :\r\n return -1\r\n if a[1] > b[1] :\r\n return 1\r\n return 0\r\n\r\nn, m, d = list(map(int, input().split()))\r\na = []\r\nb = []\r\nfor i in range(n):\r\n a.append(list(map(int, input().split())))\r\nfor i in range(m):\r\n b.append(list(map(int, input().split())))\r\n\r\na = sorted(a, key = cmp_to_key(comparator))\r\nb = sorted(b, key = cmp_to_key(comparator))\r\n\r\npref = []\r\ns = []\r\npref.append(0)\r\ns.append(0)\r\n\r\nfor e in b :\r\n pref.append(pref[len(pref) - 1] + e[1])\r\n s.append(s[len(s) - 1] + e[0])\r\n\r\ncur = 0\r\nruc = 0\r\nans = 0\r\nfor e in a :\r\n cur += e[1]\r\n ruc += e[0]\r\n l = 1\r\n r = m\r\n j = -1\r\n while l <= r :\r\n mid = (l + r) // 2\r\n if cur + pref[mid] <= d :\r\n j = mid\r\n l = mid + 1\r\n else :\r\n r = mid - 1\r\n if j != -1 :\r\n ans = max(ans, ruc + s[j])\r\nprint(ans)", "n, m, d = map(int, input().split())\r\nph = [[int(j) for j in input().split()] for i in range(n)]\r\ninf = [[int(j) for j in input().split()] for i in range(m)]\r\nfor i in range(n):\r\n ph[i][1] = -ph[i][1]\r\nfor i in range(m):\r\n inf[i][1] = -inf[i][1]\r\nph.sort(reverse=True)\r\ninf.sort(reverse=True)\r\nsw, sc = 0, 0\r\nfor p in inf:\r\n sc += p[0]\r\n d += p[1]\r\nans = 0\r\nz = m - 1\r\nfor p in ph:\r\n sc += p[0]\r\n d += p[1]\r\n #print(sc, d)\r\n while z > 0 and d < 0:\r\n sc -= inf[z][0]\r\n d -= inf[z][1]\r\n z -= 1\r\n #print(sc, d)\r\n if d >= 0:\r\n ans = max(ans, sc)\r\nprint(ans)" ]

[ "\"\"\"\r\n Bismillahir Rahmanir Rahim\r\n A |-| |\\| A F\r\n\"\"\"\r\nfrom collections import defaultdict\r\n\r\nn = int(input())\r\nar = list(map(int, input().split()))\r\nar.sort()\r\nchk = defaultdict(lambda : 0)\r\nans = []\r\nfor i in range(0, n):\r\n if not chk[i]:\r\n ans.append(ar[i])\r\n cur = ar[i]\r\n chk[i] = 1\r\n for j in range(i+1, n):\r\n if not chk[j] and ar[j] > cur:\r\n ans.append(ar[j])\r\n chk[j] = 1\r\n cur = ar[j]\r\ncur, anss = ar[0], 0\r\nfor i in range(1, n):\r\n if ans[i] > cur:\r\n anss += 1\r\n cur = ans[i]\r\n else: cur = ans[i]\r\nprint(anss)\r\n", "from collections import Counter\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nb=Counter(a)\r\nr=0\r\nfor i in b:\r\n r=max(r,b[i])\r\nprint(n-r)", "# Problem Link: https://codeforces.com/problemset/problem/651/B\r\n# Problem Status:\r\n# ------------------------------- SEPARATOR -------------------------------\r\n# IDEA:\r\n# ------------------------------- SEPARATOR -------------------------------\r\nA = []\r\nRepeated = []\r\nRepeatedPro = set()\r\nRepeatedNew = []\r\nAnswer = 0\r\nLine = input()\r\nN = int(Line)\r\nLine = input().split()\r\nfor x in Line:\r\n A.append(int(x))\r\nA.sort()\r\n# ------------------------------- SEPARATOR -------------------------------\r\nfor i in range(1, len(A)):\r\n if A[i] == A[i-1]:\r\n Repeated.append(A[i])\r\n# ------------------------------- SEPARATOR -------------------------------\r\nRepeated.sort()\r\nc = 0\r\n# ------------------------------- SEPARATOR -------------------------------\r\nfor i in range(len(Repeated)):\r\n temp1 = len(RepeatedPro)\r\n RepeatedPro.add(Repeated[i])\r\n if len(RepeatedPro) > temp1:\r\n continue\r\n else:\r\n RepeatedNew.append(Repeated[i])\r\nRepeated = RepeatedNew.copy()\r\nRepeatedNew.clear()\r\n# ------------------------------- SEPARATOR -------------------------------\r\nwhile len(RepeatedPro) > 0:\r\n RPL = list(RepeatedPro)\r\n RPL.sort()\r\n A += RPL\r\n RepeatedPro.clear()\r\n for i in range(len(Repeated)):\r\n temp1 = len(RepeatedPro)\r\n RepeatedPro.add(Repeated[i])\r\n if len(RepeatedPro) > temp1:\r\n continue\r\n else:\r\n RepeatedNew.append(Repeated[i])\r\n Repeated = RepeatedNew.copy()\r\n RepeatedNew.clear()\r\n# ------------------------------- SEPARATOR -------------------------------\r\n# for i in range(len(Repeated)):\r\n# A.remove(Repeated[c])\r\n# A.append(Repeated[c])\r\n# Repeated.remove(Repeated[c])\r\n# if c == 0:\r\n# c = -1\r\n# else:\r\n# c = 0\r\n# ------------------------------- SEPARATOR -------------------------------\r\nfor i in range(1, len(A)):\r\n if A[i] > A[i-1]:\r\n Answer += 1\r\nprint(Answer)\r\n# ------------------------------- SEPARATOR -------------------------------\r\n", "import math,sys;input=sys.stdin.readline;S=lambda:input().rstrip();I=lambda:int(S());M=lambda:map(int,S().split());L=lambda:list(M());mod1=1000000007;mod2=998244353\r\nfrom collections import Counter\r\n\r\nn = I()\r\na = L()\r\n\r\nprint(n-max(a.count(x) for x in a))\r\n\r\n# cnt = 0\r\n# a = sorted(a)\r\n# for i in range(n-1):\r\n# if a[i]<a[i+1]:\r\n# cnt+=1\r\n \r\n\r\n\r\n# ans = 0\r\n# for i in C:\r\n# if C[i]>=2:\r\n# ans+= C[i]//2\r\n \r\n\r\n# print(C)\r\n# print(ans+cnt)", "n=int(input())\r\nl=input().split(' ')\r\nl1=[]\r\nfor i in range(n):\r\n l1.append(l.count(l[i]))\r\nprint(n-max(l1))", "import collections\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\ncs = collections.Counter(arr)\r\nans = 0\r\nwhile cs:\r\n ans += len(cs) - 1\r\n for k in list(cs.keys()):\r\n cs[k] -= 1\r\n if not cs[k]:\r\n del cs[k]\r\nprint(ans)", "n=int(input())\r\nlst = list(map(int, input().strip().split(' ')))\r\nlst.sort()\r\nl=[[lst[0]]]\r\nfor i in range(1,n):\r\n j=0\r\n while(True):\r\n if j==len(l):\r\n l.append([lst[i]])\r\n break\r\n else:\r\n if l[j][-1]!=lst[i]:\r\n l[j].append(lst[i])\r\n break\r\n else:\r\n j+=1\r\ns=0\r\nfor i in range(len(l)):\r\n s+=len(l[i])-1\r\nprint(s)\r\n \r\n \r\n \r\n ", "n = int(input())\r\na = sorted(list(map(int, input().split())))\r\nmat = [[0 for j in range(n)] for i in range(n)]\r\nindex = [0] * n\r\nfor x in a:\r\n for i in range(len(mat)):\r\n if index[i] == 0 or (index[i] > 0 and x > mat[i][index[i] - 1]):\r\n mat[i][index[i]] = x\r\n index[i] += 1\r\n break\r\nans = 0\r\nfor i in range(len(mat)):\r\n ans += max(0, index[i] - 1)\r\nprint(ans)", "def f(a):\r\n if len(a)==0:\r\n return 0\r\n r=[]\r\n i=0\r\n while(i<len(a)-1):\r\n if a[i]==a[i+1]:\r\n r.append(a[i])\r\n i+=1\r\n else:\r\n i+=1\r\n return len(a)-len(r)+f(r)-1\r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nprint(f(a))", "n = int(input())\r\narr = [0 for i in range(1001)]\r\nfor i in input().split():\r\n arr[int(i)] += 1\r\nprint(n-max(arr))", "n = int(input())\r\nbeauty_values = list(map(int, input().split()))\r\n\r\ndef frequency_dict(arr):\r\n freq_dict = {}\r\n for element in arr:\r\n if element in freq_dict:\r\n freq_dict[element] += 1\r\n else:\r\n freq_dict[element] = 1\r\n return freq_dict\r\n \r\nbeauty_values_dict = frequency_dict(beauty_values)\r\n\r\nmax_happy_times = 0\r\n\r\ndef count_non_zero_keys(freq_dict):\r\n count = 0\r\n while any(value != 0 for value in freq_dict.values()):\r\n for key in list(freq_dict.keys()):\r\n if freq_dict[key] > 0:\r\n freq_dict[key] -= 1\r\n count += 1\r\n else:\r\n del freq_dict[key]\r\n count -= 1\r\n return count\r\n \r\nmax_happy_times = count_non_zero_keys(beauty_values_dict)\r\n\r\n# Output the result\r\nprint(max_happy_times)\r\n", "n=int(input())\r\na = [int(x) for x in input().split()]\r\na.sort()\r\nb= set(a)\r\nf = {} \r\nfor i in b:\r\n f[i]=a.count(i)\r\nfor key, value in f.items():\r\n continue\r\nx=0\r\ny=0\r\nfor i in f:\r\n x+=min(y,f[i])\r\n y=max(y,f[i])\r\nprint(x)\r\n", "n = int(input())\r\n \r\nt = list(map(int,input().split()))\r\nf=[[] for k in range(1001) ]\r\nu=0\r\nfor j in range(n):\r\n for k in f:\r\n if t[j] not in k:\r\n k.append(t[j])\r\n break\r\n \r\n \r\nfor k in f:\r\n if len(k)>0:\r\n u+=len(k)-1\r\n else:\r\n break\r\n \r\nprint(u)", "n=int(input())\na=[int(x) for x in input().split()]\nf={}\nfor i in a:\n if i in f:\n f[i]+=1 \n else:\n f[i]=1 \nprint(n-max(f.values()))\n \t \t \t\t\t \t\t \t\t\t \t\t \t\t \t\t", "n = int(input())\r\n\r\na = list(map(int, input().split()))\r\n\r\nnew_ar = []\r\n\r\nused = [0] * 1002\r\nfor i in range(len(a)):\r\n used[a[i]] += 1\r\n new_ar.append((a[i], used[a[i]]))\r\n \r\noptimal = sorted(new_ar, key=lambda x: (x[1],x[0]))\r\ntotal = 0\r\nfor i in range(1, len(optimal)):\r\n if optimal[i][0] > optimal[i-1][0]:\r\n total += 1\r\n \r\nprint(total)", "n=int(input())\r\n# import sys\r\n# for i in range(int(input())):\r\n # n=int(input())\r\narr=list(map(int,input().split()))\r\ncnt=0\r\nwhile len(arr)>1:\r\n st=set(arr)\r\n cnt+=len(st)-1\r\n for i in st:\r\n arr.remove(i)\r\nprint(cnt) ", "n = int(input())\r\nA = [int(a) for a in input().split()]\r\nA.sort()\r\nlast = A[0]\r\nc = 0\r\naux = 0\r\nfor i in range(n):\r\n a = A[i]\r\n if a == last:\r\n aux += 1\r\n else:\r\n aux = 1\r\n last = A[i]\r\n c = max(c, aux)\r\nprint(n - c)", "from collections import Counter as dd\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nd={}\r\nfor i in a:\r\n d[i]=d.get(i,0)+1\r\nans = 0\r\nwhile d:\r\n ans += len(d)-1\r\n for i in list(d):\r\n d[i] -= 1\r\n if d[i] == 0:\r\n del d[i]\r\nprint(ans)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\narr = [0] * 10001\r\nck = 0\r\nfor item in a:\r\n arr[item] += 1\r\n ck = max(arr[item], ck)\r\n\r\nprint(n - ck)", "from collections import Counter\r\nx=int(input())\r\na=list(map(int,input().split()))\r\ns=0\r\nc=Counter(a)\r\na=list(set(a))\r\na.sort()\r\nw=c[0]\r\nfor i in a:\r\n if c[i]>w:\r\n w=c[i]\r\ns=x-w\r\nprint(s) ", "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\nl = 1005\r\ncnt = [0] * l\r\nfor i in a:\r\n cnt[i] += 1\r\nans = n - max(cnt)\r\nprint(ans)", "n=int(input())\r\na=list(map(int,input().split()))\r\nli=max(a)\r\ns=[0]*li\r\nfor i in range(n):\r\n s[a[i]-1]+=1\r\ns.sort()\r\nc=0\r\nwhile(s!=[0]*li):\r\n for i in range(li):\r\n if(s[i]>0):\r\n c+=1\r\n s[i]-=1\r\n c-=1\r\nprint(c)\r\n \r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n\t \t \t\t\t \t \t \t \t \t\t\t \t\t\t", "from collections import Counter\r\ni = int(input())\r\nl= list(map(int,input().split()))\r\nc= Counter(l)\r\nprint(i-c[max(c, key=c.get)])", "input()\r\nl=list(map(int,input().split()))\r\nl=sorted(l)\r\ncount=0\r\nfor i in l:\r\n if l[count]<i:\r\n count+=1\r\nprint(count)", "n = int(input())\r\nlst=[0]*1000 \r\nfor i in input().split(): \r\n lst[int(i)-1]+=1\r\nprint(n-max(lst))\r\n", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import Counter as C\r\ndef miis():\r\n return map(int, input().split())\r\n\r\nfor _ in range(1):\r\n n = int(input())\r\n a = list(miis())\r\n c = C(a)\r\n ans = n-1\r\n for i in c:\r\n ans = min(n-c[i], ans)\r\n print(ans)\r\n", "n = int(input())\r\nnums = list(map(int, input().split()))\r\nnums.sort()\r\ncnt = 0\r\nfor i in range(n):\r\n if nums[i] > nums[cnt]:\r\n cnt += 1\r\nprint(cnt)", "from collections import defaultdict\r\n\r\nN, Count = int(input()), 0\r\nMyDict = defaultdict(int)\r\nfor i in sorted(list(map(int, input().split()))):\r\n MyDict[i] += 1\r\nCheck = True\r\nwhile Check:\r\n Check = False\r\n for i in MyDict.keys():\r\n if MyDict[i] > 0:\r\n Check = True\r\n MyDict[i] -= 1\r\n Count += 1\r\n Count -= 1\r\nprint(Count + 1)\r\n\r\n# UB_CodeForces\r\n# Advice: Be patient toward achieving your goals\r\n# Location: Here in Bojnord\r\n# Caption: After long time being far and busy with apply works\r\n# CodeNumber: 725\r\n", "n = int(input())\nbeauty = list(map(int, input().split()))\n\n# get frequence\nfreq = {}\nfor i in beauty:\n if i in freq:\n freq[i] += 1\n else:\n freq[i] = 1\n\n# sort by key\nfreq = sorted(freq.items(), key=lambda x: x[0])\n\nanswer = 0\n\nwhile True:\n # get length of freq\n answer = answer + (len(freq) - 1)\n\n # eliminate one freq from each element. If freq[i] == 0, remove it\n freq = [(x[0], x[1] - 1) for x in freq if x[1] > 1]\n\n # if freq is empty, break\n if not freq:\n break\n\nprint(answer)\n \t\t\t \t \t\t \t\t \t\t \t \t \t \t\t\t\t \t", "n = int(input())\r\ns = [int(i) for i in input().split()]\r\na = []\r\ncnt = 0 \r\nd = {}\r\nans=0\r\nfor i in s:\r\n\tif i not in d:\r\n\t\td[i]=1\r\n\telse:\r\n\t\td[i]+=1\r\n\r\nfor i in d:\r\n\ta.append(d[i]*[i])\r\ns = []\r\na.sort()\r\nwhile a:\r\n\tcnt = 0\r\n\tfor i in range(len(a)):\r\n\t\tif a[i]==[]:\r\n\t\t\tcnt+=1\r\n\t\telse:\r\n\t\t\ts.append(a[i].pop(0))\r\n\tif cnt==len(a):break\r\nfor i in range(n-1):\r\n\tif s[i+1]>s[i]:\r\n\t\tans+=1\r\nprint(ans)\r\n", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\nmaxi=max(l.count(i) for i in l)\r\nprint(n-maxi)\r\n", "n = int(input())\nif n >= 1 and n <= 1000:\n line_paintings = input()\n paintings = line_paintings.split()\n paintings = list(map(int,paintings))\n if len(paintings) >= 1 and len(paintings) <= 1000:\n tmp = 0\n cnt = 0\n values = []\n newOrder = []\n for i in range(max(paintings)+1):\n values.append(paintings.count(i))\n while(sum(values)>0):\n for i in range(len(values)):\n if values[i]>0:\n newOrder.append(i)\n values[i]-=1\n\n for i in range(len(newOrder)):\n if i == 0:\n tmp = newOrder[i]\n else:\n if(newOrder[i]>tmp):\n cnt+=1\n tmp = newOrder[i]\n print(cnt)\n \t \t \t \t \t\t\t \t \t \t \t\t \t \t \t", "from collections import Counter\r\nfrom sys import stdin\r\ninput=stdin.readline\r\nn=int(input()) ; beauty=list(map(int,input().split())) ; count=Counter(beauty) \r\nprint(n-max(count.values()))", "# LUOGU_RID: 135554175\nn=int(input())\r\na=list(map(int,input().split()))\r\nmp={}\r\nfor i in range(0,len(a)):\r\n if a[i] in mp:\r\n mp[a[i]]+=1\r\n else:\r\n mp[a[i]]=1\r\nans=0\r\nwhile(1):\r\n if len(mp)==0:\r\n break\r\n # for key, value in mp.items():\r\n # print(str(key)+\":\"+str(value),end=\" \")\r\n # print()\r\n ans+=len(mp)-1\r\n st=[]\r\n for key,value in mp.items():\r\n mp[key]=value-1\r\n if value-1==0:\r\n st.append(key)\r\n for i in range(0,len((st))):\r\n del mp[st[i]]\r\n # for key, value in mp.items():\r\n # print(str(key)+\":\"+str(value),end=\" \")\r\nprint(ans)\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nans = 0\r\nfor i in l:\r\n temp = l.count(i)\r\n ans = max(temp,ans)\r\nprint(n-ans)", "n=int(input())\r\nx=list(map(int, input().split()))\r\nfrom collections import Counter\r\nb=x[::]\r\nc=list(set(b))\r\nd=0\r\nwhile len(c)!=len(b):\r\n d=d+len(c)-1\r\n b = list((Counter(b) - Counter(c)).elements())\r\n c=list(set(b))\r\nd=d+len(c)-1\r\nprint(d)", "n=int(input())\r\nlst=list(map(int,input().split()))\r\nd={}\r\nfor i,x in enumerate(lst):\r\n if d.get(x)==None:d[x]=0\r\n d[x]+=1\r\nlst=list(d.values())\r\nlst.sort()\r\nlength=len(lst)\r\nk,res=0,0\r\nfor i,x in enumerate(lst):\r\n res+=((x-k)*(length-i-1))\r\n k=x\r\nprint(res)", "n = int(input())\r\narr = list(map(int, input().split()))\r\ndic = {}\r\nfor i in arr:\r\n\tif i in dic:\r\n\t\tdic[i] += 1\r\n\telse:\r\n\t\tdic[i] = 1\r\nnew_arr = []\r\nfor i in dic:\r\n\tnew_arr.append(dic[i])\r\nnew_arr.sort()\r\nans = 0\r\nsize = len(new_arr)\r\nwhile (sum(new_arr)):\r\n\tfor i in range(len(new_arr)):\r\n\t\tif new_arr[i] > 0:\r\n\t\t\tbreak\r\n\r\n\tans += (size - i - 1)*new_arr[i]\r\n\td = new_arr[i]\r\n\tfor j in range(i, len(new_arr)):\r\n\t\tnew_arr[j] -= d\r\n\t\r\nprint(ans)\r\n\r\n\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = []\r\na.sort()\r\nans = -100\r\nfor e in a:\r\n\tif a.count(e) > ans:\r\n\t\tans = a.count(e)\r\nprint(n-ans)", "n = int(input())\r\na = list(map(int, input().split(\" \")))\r\n\r\nc = {}\r\nfor b in a:\r\n if b in c:\r\n c[b] += 1\r\n else:\r\n c[b] = 1\r\n\r\noccs = list(c.values())\r\nprint(sum(occs) - max(occs))", "n=int(input())\r\np=list(map(int,input().split()))\r\np.sort()\r\nq=[0]*n\r\ncount=0\r\nfor i in range(n):\r\n a=p[i]\r\n res = n - 1 - p[::-1].index(a)\r\n## print(q)\r\n while res+1<n and q[res+1]==-1:\r\n res+=1\r\n if res+1<n:\r\n count+=1\r\n q[res+1]=-1\r\nprint(count)\r\n", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\nm=0\r\nfor i in range(n):\r\n m=max(m,l.count(l[i]))\r\nprint(n-m)", "a=int(input())\r\nd=dict()\r\nfor i in map(int,input().split()):d[i]=d.get(i,0)+1\r\nz=sorted(d.values())\r\nil=len(z)\r\ns=0\r\np=0\r\nfor i in range(il-1):\r\n s+=(z[i]-p)*(il-i)-(z[i]-p)\r\n p=z[i]\r\nprint(s)", "from collections import Counter\nno=int(input())\nList=list(map(int,input().split()))\ndic=Counter(List)\n\nans = 0\nwhile dic:\n ans += len(dic)-1\n for i in list(dic):\n dic[i] -= 1\n if not dic[i]:\n del dic[i]\nprint(ans)\n\t \t \t \t \t \t \t \t\t \t\t", "class solve:\r\n def __init__(self):\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n a.sort()\r\n d={}\r\n ans=0\r\n for i in range(n):\r\n for j in range(i+1,n):\r\n if d.get(j,0)==0 and a[i]<a[j]:\r\n d[j]=1\r\n ans+=1\r\n break\r\n print(ans)\r\n\r\nobj=solve()", "import sys\r\nfrom collections import Counter\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\na = dict(Counter(sorted(input().split())))\r\n\r\nans = 0\r\nf = 0\r\nfor val in a:\r\n ans += min(f, a[val])\r\n f += max(a[val] - f, 0)\r\nprint(ans)", "d={};m=int(input());x,y=1,0;l=[]\r\nfor i in map(int,input().split()):\r\n\tif i in d:d[i]+=1\r\n\telse:d[i]=1\r\nfor i in d:l.append(i)\r\nl.sort()\r\nwhile x>0:\r\n\tx=0\r\n\tfor i in l:\r\n\t\tif d[i]>0:\r\n\t\t\td[i]-=1;x+=1\r\n\tif x:y+=(x-1)\r\nprint(y)", "n = int(input())\r\narr = [int(x) for x in input().split()]\r\narr.sort()\r\nuni = [arr[0]]\r\nunil = 0\r\ncount = [0]\r\nfor i in arr:\r\n if(i == uni[unil]):\r\n count[unil]+=1\r\n else:\r\n uni.append(i)\r\n count.append(1)\r\n unil+=1\r\n#print(count)\r\n#print(uni)\r\nunil+=1\r\nzero = 0\r\nans = 0\r\nwhile(unil>1):\r\n p = min(count) \r\n i = 0\r\n while(i<unil):\r\n if(i!=unil-1): ans+=p\r\n count[i]-=p\r\n if(count[i]==0):\r\n count.pop(i)\r\n unil-=1\r\n else: i+=1\r\nprint (ans)\r\n ", "n = int(input())\ncount = [0] * 1001\nc = [0] * 1001\npictures = list(map(int, input().split()))\nfor i in pictures:\n count[i] += 1\nres = 0\n\n\n# This part of code selects the each sequence of images\n# And add the ans of each sequence of image into the result\nwhile count != c:\n res -= 1\n for i in range(len(count)):\n if count[i] > 0:\n count[i] -= 1\n res += 1\nprint(res)\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\n\r\na.sort()\r\n\r\nx = {}\r\n\r\nfor i in a:\r\n if i in x:\r\n x[i] += 1\r\n else:\r\n x[i] = 1\r\nfreq = []\r\nfor i in x:\r\n freq.append(x[i])\r\nele = 0\r\nwhile len(freq)>1:\r\n ele+=len(freq)-1\r\n freq = [freq[i] - 1 for i in range(len(freq)) if (freq[i]-1)!=0]\r\nprint(ele)", "n=int(input())\r\nll=list(map(int,input().split()))\r\nll.sort()\r\ndict1=dict()\r\nfor i in ll:\r\n if i in dict1:\r\n dict1[i]+=1\r\n else:\r\n dict1[i]=1\r\nt,kk=n,[]\r\nwhile n>0:\r\n for i,j in dict1.items():\r\n if j>0:\r\n kk.append(i)\r\n dict1[i]-=1\r\n n-=1\r\nresult=0\r\nfor i in range(t-1):\r\n if kk[i]<kk[i+1]:\r\n result+=1\r\nprint(result)", "n=int(input())\r\nlst=list(map(int,input().split()))\r\nlst.sort()\r\nx=[]\r\nfor i in range(n):\r\n x.append(True)\r\ncount=0\r\nfor i in range(len(lst)):\r\n if lst[i]>lst[count]:\r\n count+=1\r\n# print(x)\r\nprint(count)\r\n \r\n \r\n ", "num=input()\r\narr=input().split(' ')\r\narr=list(map(int,arr))\r\nfreq_arr=dict()\r\nfor ele in arr:\r\n if ele in freq_arr:\r\n freq_arr[ele]+=1\r\n else:\r\n freq_arr[ele]=1\r\n\r\n\r\narr=list(freq_arr.values())\r\n\r\narr.sort()\r\nans=0\r\nfor indx in range(len(arr)):\r\n for ele in range(indx+1,len(arr)):\r\n arr[ele]-=arr[indx]\r\n ans+=arr[indx]*(len(arr)-indx-1)\r\n \r\n\r\nprint(ans)\r\n\r\n\r\n", "n = int(input().strip())\r\na = list(map(int, input().strip().split()))\r\nd = {}\r\nfor i in a:\r\n\tif i in d.keys():\r\n\t\td[i] += 1\r\n\telse:\r\n\t\td[i] = 1\r\nlst = []\r\nfor i in d.keys():\r\n\tlst.append(d[i])\r\nprint(n - max(lst))", "from collections import Counter\n\nn = int(input())\narr = list(map(int, input().split()))\nfreq = Counter(arr)\nkeys = list(freq.keys())\nkeys.sort()\nextra = freq[keys[0]]\nans = 0\nfor i in range(1, len(keys)):\n f = freq[keys[i]]\n if extra > f:\n ans += f\n extra -= f\n else:\n ans += extra\n extra = 0\n \n extra += f\n\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", "n = int(input().strip())\na = list(map(int, input().strip().split()))\nd = {}\nfor i in a:\n\tif i in d.keys():\n\t\td[i] += 1\n\telse:\n\t\td[i] = 1\nlst = []\nfor i in d.keys():\n\tlst.append(d[i])\nprint(n - max(lst))\n \t\t\t\t \t \t \t \t\t\t\t\t\t\t\t \t\t\t\t", "n,a=input(),[0]*1001\r\nfor i in map(int,input().split()):a[i]+=1\r\na.sort()\r\nq,w,r=len(a),0,0\r\nfor i in a:w+=(q-1)*(i-r);q-=1;r=i\r\nprint(w)", "n=int(input())\r\na=list(map(int,input().strip().split()))\r\nprint(n-max(a.count(i) for i in a))\r\n", "import sys\nn = int(input())\nl = [int(x) for x in sys.stdin.readline().split()]\ns = [0]*1001\nfor i in l:\n s[i]+=1\nprint(n-max(s))\n\t\t \t \t\t \t \t \t\t \t \t \t \t \t", "# import sys\r\n# sys.stdin = open('input.txt', 'r') \r\n# sys.stdout = open('output.txt', 'w')\r\ntry:\r\n n=int(input())\r\n l=[0]*1001\r\n count=0\r\n for i in map(int,input().split()):\r\n l[i]+=1\r\n \r\n res=0\r\n \r\n for i in range(1001):\r\n count=0\r\n for j in range(1001):\r\n if l[j]>0:\r\n l[j]-=1\r\n count+=1\r\n if count:\r\n res+=count-1\r\n print(res)\r\nexcept EOFError:\r\n pass", "from heapq import heappush,heappop\r\nfrom collections import deque\r\n\r\n#t = int(input())\r\nt = 1\r\nfor tc in range(1,t+1):\r\n n = int(input())\r\n #n,l = map(int,input().split())\r\n a = list(map(int,input().split()))\r\n #b = list(map(int,input().split()))\r\n #s = input()\r\n #p = input()\r\n a.sort()\r\n \r\n maxlowers = 0\r\n ans = 0\r\n i=0\r\n while i<n:\r\n\r\n curcnt = 1\r\n while i<n-1 and a[i]==a[i+1]:\r\n curcnt+=1\r\n i+=1\r\n\r\n ans+= min(maxlowers,curcnt)\r\n maxlowers=max(maxlowers,curcnt)\r\n i+=1\r\n\r\n print(ans)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nmax_count=0\r\nl2=[]\r\nfor i in l:\r\n if i not in l2:\r\n if l.count(i)>max_count:\r\n max_count=l.count(i)\r\n l2.append(i)\r\nprint(n-max_count)", "from collections import Counter\r\n\r\nn = int(input())\r\n\r\narr = [int(z) for z in input().split()]\r\nc = Counter(arr)\r\nans = 0\r\nfor p in list(arr):\r\n ans = max(ans, c[p])\r\n\r\nprint(n - ans)\r\n", "\r\ndef maximum_number_of_indices(nums):\r\n n = len(nums)\r\n count_map = {}\r\n for x in nums:\r\n if x not in count_map:\r\n count_map[x] = 0\r\n count_map[x] += 1\r\n \r\n max_count = 0\r\n for k in count_map:\r\n max_count = max(max_count, count_map[k])\r\n \r\n return n - max_count\r\n\r\n#t = int(input())\r\nt = 1\r\nfor _ in range(t):\r\n n = int(input())\r\n A = list(map(int,input().split()))\r\n print(maximum_number_of_indices(A))\r\n", "n = int(input())\na = sorted([int(i) for i in input().split()])\nsol = 0\nbackup = []\nwhile a:\n n = len(a)\n for i in range(1,n):\n if a[i] > a[i-1]: sol += 1\n elif a[i] == a[i-1]: backup.append(a[i])\n a = backup\n backup = []\n\nprint(sol)\n", "from collections import defaultdict\r\nn=int(input())\r\na=list(map(int,input().split())) \r\nif n==1:\r\n print(0)\r\nelse:\r\n \r\n di=defaultdict(int)\r\n for i in range(n):\r\n k=a.count(a[i])\r\n di[a[i]]=k\r\n li=list(di.values())\r\n li.sort()\r\n ans=0\r\n while len(li)>1:\r\n \r\n if li[0]==0:\r\n li.remove(li[0])\r\n else:\r\n ans+=len(li)-1\r\n \r\n for i in range(len(li)):\r\n li[i]-=1\r\n print(ans)\r\n \r\n \r\n \r\n", "# CALL YOUR MODULES HERE -------------------->\r\n# import bisect, heapq\r\n# import fractions, math\r\n# import atexit, io, os, sys, time\r\n# <----------------------------------------\r\n\r\n# DEFINE YOUR FASTIO HERE -------------------->\r\n# 0 in os.read() indicated file descriptor for standard input (STDIN)\r\n# os.fstat(0).st_size will tell Python how many bytes are currently waiting in the STDIN buffer\r\n# Then os.read() will read those bytes in bulk from STDIN, producing a bytestring\r\n# inputt = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n# # A lambda function to get integer input and return it\r\n# input = lambda: inputt() # integers\r\n# # A lambda function to get string input and return it\r\n# input = lambda: inputt().decode().strip() # strings\r\n# ss = sys.stdout\r\n# ss = io.BytesIO()\r\n# _write = ss.write\r\n# ss.write = lambda w: _write(w.encode())\r\n# atexit.register(lambda: os.write(1, ss.getvalue()))\r\n# <----------------------------------------\r\n\r\n# DEFINE YOUR FUNCTIONS HERE -------------------->\r\n# def readnumbers(zero=0):\r\n# _ord, nums, num, neg = lambda nbr: nbr, [], zero, False\r\n# i, w = 0, io.BytesIO(os.read(0,os.fstat(0).st_size)).read()\r\n# try:\r\n# while True:\r\n# if w[i] >= b\"0\"[0]:num = 10 * num + _ord(w[i]) - 48\r\n# elif w[i] == b\"-\"[0]:neg = True\r\n# elif w[i] != b\"\\rind\"[0]:\r\n# nums.append(-num if neg else num)\r\n# num, neg = zero, False\r\n# i += 1\r\n# except IndexError:\r\n# pass\r\n# if w and w[-1] >= b\"0\"[0]: nums.append(-num if neg else num)\r\n# return nums\r\n# def FastInt(zero=0):\r\n# _ord, nums, num, neg = lambda nbr: nbr, [], zero, False\r\n# i, w = 0, io.BytesIO(os.read(0,os.fstat(0).st_size)).read()\r\n# try:\r\n# while True:\r\n# if w[i] >= b\"0\"[0]:num = 10 * num + _ord(w[i]) - 48\r\n# elif w[i] == b\"-\"[0]:neg = True\r\n# elif w[i] != b\"\\rind\"[0]:\r\n# nums.append(-num if neg else num)\r\n# num, neg = zero, False\r\n# i += 1\r\n# except IndexError:\r\n# pass\r\n# if w and w[-1] >= b\"0\"[0]: nums.append(-num if neg else num)\r\n# return nums\r\n# <----------------------------------------\r\n\r\n# ENTER YOUR CODE HERE -------------------->\r\n# sys.setrecursionlimit(1000)\r\n\r\n''' # 0.7 sec average INTEST - best for Codechef\r\nimport atexit,io,os,sys\r\nss=io.BytesIO()\r\n_write=ss.write\r\nss.write=lambda s:_write(s.encode())\r\natexit.register(lambda:os.write(1,ss.getvalue()))\r\ny_in=open(0).read().split(\"\\n\")\r\ndef y_inf():\r\n for y_id in range(len(y_in)):\r\n yield y_id\r\ny_ino=y_inf()\r\ninput=lambda:y_in[next(y_ino)]\r\n# '''\r\n\r\n''' # 1.1 sec average INTEST\r\nimport sys\r\ninput=lambda:sys.stdin.readline().rstrip(\"\\r\\n\")\r\n# '''\r\n\r\n# ''' # REGION FASTIO 1.7 sec average INTEST - best for Codeforces\r\nimport os,sys\r\nfrom io import BytesIO,IOBase\r\nBUFSIZ=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=\"n\"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,BUFSIZ))\r\n if not b:\r\n break\r\n ptr=self.buffer.tell()\r\n self.buffer.seek(0,2),self.buffer.write(b),self.buffer.seek(ptr)\r\n self.newlines=0\r\n return self.buffer.read()\r\n def readline(self):\r\n while self.newlines==0:\r\n b=os.read(self._fd,max(os.fstat(self._fd).st_size, BUFSIZ))\r\n self.newlines=b.count(b\"\\n\")+(not b)\r\n ptr=self.buffer.tell()\r\n self.buffer.seek(0, 2),self.buffer.write(b),self.buffer.seek(ptr)\r\n self.newlines-=1\r\n return self.buffer.readline()\r\n 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 sys.version_info[0]<3:\r\n sys.stdin,sys.stdout=FastIO(sys.stdin),FastIO(sys.stdout)\r\nelse:\r\n sys.stdin,sys.stdout=IOWrapper(sys.stdin),IOWrapper(sys.stdout)\r\ninput=lambda:sys.stdin.readline().rstrip(\"\\r\\n\")\r\n# END REGION '''\r\n\r\n# 2.1 sec average INTEST\r\ntcs = 1\r\nfor tc in range(tcs):\r\n n = int(input())\r\n arr = sorted(map(int, input().split()))\r\n # print(arr)\r\n stacks = [] # increasing stacks\r\n for i in range(n):\r\n if not stacks:\r\n stacks.append([arr[i],])\r\n else:\r\n placed = False\r\n for j in range(len(stacks)):\r\n if placed:\r\n break\r\n if stacks[j][-1] < arr[i]:\r\n # print(\"here\")\r\n stacks[j].append(arr[i])\r\n placed = True\r\n break\r\n if not placed:\r\n stacks.append([arr[i],])\r\n ans = 0\r\n for i in range(len(stacks)):\r\n ans += len(stacks[i]) - 1\r\n print(ans)\r\n\r\n# <----------------------------------------\r\n\r\n# ENTER YOUR NOTES HERE -------------------->\r\n'''\r\n // -- Template by A_*_A -- //\r\n '''\r\n# <----------------------------------------", "\r\n# Problem: B. Beautiful Paintings\r\n# Contest: Codeforces - Codeforces Round #345 (Div. 2)\r\n# URL: https://codeforces.com/contest/651/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 gis(): return list(map(int, stdin.readline().strip().split()))\r\ndef gi(): return int(input())\r\n\r\nn = int(input())\r\nar = sorted(gis())\r\nprint(n - max(ar.count(x) for x in ar))", "\r\n\r\nfrom collections import Counter\r\n#start the code from here\r\nt=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nc=Counter(l)\r\nl1=list(c)\r\nh=1\r\ncc=0\r\n# print(c)\r\nwhile h>0:\r\n\th=0\r\n\tfor i in l1:\r\n\t\tif c[i]>0:\r\n\t\t\tc[i]-=1\r\n\t\t\th+=1\r\n\tif h>0:\r\n\t\tcc+=h-1\r\n\t# print(c,h,cc)\r\n\t# print(h)\r\nprint(cc)\r\n", "def clear(L):\r\n if(sum(L)!=0):\r\n return True\r\n return False\r\n\r\nn=int(input())\r\nans=0\r\nL=[0 for i in range(1001)]\r\nl=list(map(int,input().split()))\r\nfor i in range(n):\r\n L[l[i]]+=1\r\nwhile(clear(L)):\r\n count=0\r\n for i in range(1,1001):\r\n if(L[i]>0):\r\n count+=1\r\n L[i]-=1\r\n ans+=(count-1)\r\nprint(ans)", "# Problem Link: https://codeforces.com/problemset/problem/651/B\r\n# Problem Status:\r\n# ------------------------------- SEPARATOR -------------------------------\r\n# IDEA:\r\n# Sort The Given List, Scan For The Repeated Integers, Copy Them To A New List\r\n# Iterate over the new list selecting only the 1 element from the repeated elements.\r\n# For example from [1,1,1,2,2,2,3,3,3] select [1,2,3], and remove them >> [1,1,2,2,3,3]\r\n# So A Set will be used for this purpose.\r\n# Add The set to the end of the Primary List, Empty it, Repeat\r\n# ------------------------------- SEPARATOR -------------------------------\r\nA = []\r\nRepeated = []\r\nRepeatedPro = set()\r\nRepeatedNew = []\r\nStartFlag = True\r\nAnswer = 0\r\n# ------------------------------- SEPARATOR -------------------------------\r\nLine = input()\r\nN = int(Line)\r\n# ------------------------------- SEPARATOR -------------------------------\r\nLine = input().split()\r\nfor x in Line:\r\n A.append(int(x))\r\nA.sort()\r\n# ------------------------------- SEPARATOR -------------------------------\r\nfor i in range(1, len(A)):\r\n if A[i] == A[i-1]:\r\n Repeated.append(A[i])\r\n# ------------------------------- SEPARATOR -------------------------------\r\nRepeated.sort()\r\n# ------------------------------- SEPARATOR -------------------------------\r\nwhile len(RepeatedPro) > 0 or StartFlag:\r\n StartFlag = False\r\n RPL = list(RepeatedPro)\r\n RPL.sort()\r\n A += RPL\r\n RepeatedPro.clear()\r\n for i in range(len(Repeated)):\r\n temp1 = len(RepeatedPro)\r\n RepeatedPro.add(Repeated[i])\r\n if len(RepeatedPro) > temp1:\r\n continue\r\n else:\r\n RepeatedNew.append(Repeated[i])\r\n Repeated = RepeatedNew.copy()\r\n RepeatedNew.clear()\r\n# ------------------------------- SEPARATOR -------------------------------\r\nfor i in range(1, len(A)):\r\n if A[i] > A[i-1]:\r\n Answer += 1\r\nprint(Answer)\r\n# ------------------------------- SEPARATOR -------------------------------\r\n", "d={}\r\nfor x in [*open(0)][1].split():\r\n d[x] = d.get(x,0)+1\r\nret=0\r\nwhile 1:\r\n k=len(d.keys())\r\n if k<1:break\r\n x=min(d.values())\r\n for v in [*d.keys()]:\r\n if d[v]==x:d.pop(v)\r\n else:d[v]-=x\r\n ret += (k-1)*x\r\nprint(ret)", "n = int(input())\r\na = list(map(int,input().split()))\r\nb = sorted(a)\r\nw = 0\r\nfor i in b:\r\n if b[w]<i:\r\n w += 1\r\nprint(w)", "n=input()\na=list(map(int,input().split()))\na.sort()\nans=0\nwhile(len(a)>1):\n b=list(set(a))\n ans+=len(b)-1\n for i in range(len(b)):\n a.remove(b[i])\nprint(ans)\n\t \t\t \t\t \t\t\t \t \t \t \t\t \t\t\t", "from sys import stdin\n\ntry:\n while True: \n total_paints = int(input())\n paints_beauties = list(map(int, input().split(' ', total_paints)))\n frequency = {}\n max_frequency = 0\n for b in paints_beauties:\n frequency[b] = frequency.get(b, 0) + 1\n max_frequency = max(frequency.values())\n total_jumps = total_paints - max_frequency \n print(total_jumps)\nexcept EOFError:\n pass\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()))\nli=[]\nfor i in range(n):\n li.append(l.count(l[i]))\nprint(n-max(li))\n \t \t \t\t \t \t \t \t \t \t\t\t", "# بسم الله الرحمن الرحيم\r\ndef main():\r\n n = int(input())\r\n beauty = [int(i) for i in input().split()]\r\n\r\n beauty = sorted(beauty)\r\n counts = {}\r\n for k in beauty:\r\n counts[k] = counts.get(k, 0) + 1\r\n # print(list(counts.values()))\r\n freq = list(counts.values())\r\n\r\n result = 0\r\n while freq != [0]*len(freq):\r\n round = 0\r\n for i in range(len(freq)):\r\n if freq[i] >= 1:\r\n freq[i] -= 1\r\n round += 1\r\n result += (round-1)\r\n\r\n print(result)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n = int(input())\nli = list(map(int, input().split()))\nres = 0\nfor ele in li:\n c = li.count(ele)\n res = max(res,c)\n\nprint(n - res)\n \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 n == 1:\r\n print(0)\r\n exit()\r\na.sort()\r\ni = 0\r\nj = 1\r\ncnt = 0\r\nwhile i < n - 1 and j < n:\r\n if a[i] < a[j]:\r\n cnt += 1\r\n i += 1\r\n j += 1\r\nprint(cnt)", "n = int(input())\r\nlast = 0\r\nhappy = 0\r\n\r\nl = input().split()\r\nl.sort()\r\n\r\nlast = l.pop(0)\r\nwhile l:\r\n flag = False\r\n for i in range(len(l)):\r\n if l[i] > last:\r\n happy += 1\r\n last = l.pop(i)\r\n flag = True\r\n break\r\n if not flag:\r\n last = l.pop(0)\r\n\r\nprint(happy)\r\n", "n = int(input())\r\na = [0]*1001\r\nfor x in input().split():\r\n a[int(x)] += 1\r\ncount = 0\r\nfor i in range(n):\r\n flag = False\r\n for j in range(1, 1001):\r\n if a[j]:\r\n if flag:\r\n count += 1\r\n a[j] -= 1\r\n flag = True\r\nprint(count)\r\n", "n = int(input())\nvetor = list(map(int, input().split()))\n\nlista_set = [set()]\n\nfor num in vetor:\n\tflag = True\n\tfor i in range(len(lista_set)):\n\t\tif num not in lista_set[i]:\n\t\t\tlista_set[i].add(num)\n\t\t\tflag = False\n\t\t\tbreak\n\tif flag:\n\t\tlista_set.append(set([num]))\n\n\nsomatorio = sum(list(map(lambda lista: len(lista) -1, lista_set)))\n\nprint(somatorio)\n", "from collections import defaultdict, deque\nfrom functools import lru_cache\nfrom heapq import heappush, heappop\n \n #n,m = map(int, input().split())\n #arr = list(map(int, input().split()))\ndef solution():\n _ = int(input())\n arr = list(map(int, input().split()))\n freq = defaultdict(int) \n for val in arr:\n freq[val] += 1\n\n res = 0\n while len(freq): # all zero\n mn = min(freq.values())\n res += mn * (len(freq)- 1)\n newFreq = {}\n for val in freq:\n freq[val] -= mn\n if freq[val] == 0:\n continue\n newFreq[val] = freq[val]\n freq = newFreq\n print(res)\n\n\n\n \n\n#import sys\n#import threading\n#sys.setrecursionlimit(1 << 30)\n#threading.stack_size(1 << 27)\n#thread = threading.Thread(target=solution)\n#thread.start(); thread.join()\nsolution()\n", "picture_quantity = int(input())\r\npicture_beauty_list = list(map(int, input().split()))\r\n\r\nc = [] # try before b.sort()\r\n\r\nwhile len(picture_beauty_list) > 0:\r\n a = set(picture_beauty_list)\r\n b = list(a)\r\n b.sort()\r\n c += b\r\n\r\n for del_el in b:\r\n picture_beauty_list.remove(del_el)\r\n\r\n b = []\r\n\r\nsatisfied = 0\r\nfor i in range(len(c)):\r\n if i != len(c) - 1:\r\n if c[i] < c[i + 1]:\r\n satisfied += 1\r\n\r\nprint(satisfied)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nf,b=0,l.copy()\r\nl.sort()\r\nfor i in range(len(l)-1):\r\n if l[i+1]>l[i]:f+=1\r\ns=list(set(l))\r\nwhile 1:\r\n for i in s:\r\n b.remove(i)\r\n if len(b)==0:\r\n break\r\n b.sort()\r\n for i in range(len(b)-1):\r\n if b[i+1]>b[i]:\r\n f+=1\r\n s=list(set(b))\r\nprint(f)", "def most_frequent(List): \r\n return max(set(List), key = List.count) \r\n\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nm=set(l)\r\nh=[0]*len(m)\r\n\r\nprint((n-1)-(l.count(most_frequent(l))-1))\r\n \r\n \r\n", "from collections import Counter\r\nn = int(input()) \r\na = sorted([int(i) for i in input().split()])\r\ncnt = Counter(a)\r\nres = []\r\nfor i in range(max(cnt.values())): \r\n for key in cnt : \r\n \r\n if cnt[key] != 0 : res.append(key); cnt[key] -= 1\r\nans = 0\r\nfor i in range(1, n) : \r\n if res[i] > res[i-1] : ans += 1\r\nprint(ans)", "n=int(input())\na=list(map(int,input().split()))\nb=set(a)\nc=0\nflag=-1\nm=0\na.sort()\nwhile(c<n):\n\tfor i in range(0,len(a)):\n\t\tif(a[i]>flag):\n\t\t\tm+=1\n\t\t\tflag=a[i]\n\t\t\ta[i]=-1\n\t\t\tc+=1\n\tm=m-1\n\tflag=-1\nprint(m)\t\n\t\n\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=defaultdict(int)\r\nfor i in l:\r\n d[i]+=1\r\nx=list(d.values())\r\nprint(n-max(x))\r\n", "# https://codeforces.com/problemset/problem/651/B\nn=int(input())\nl=[int(i) for i in input().split()]\nl.sort()\nlatest_added=-1;\nans=[]\nanus=0\nwhile(len(ans)!=len(l)):\n latest_added=-1;\n for i in range(len(l)):\n if(l[i]>latest_added and l[i]!=latest_added):\n ans.append(l[i])\n latest_added=l[i]\n l[i]=-2\nfor i in range(1,len(ans)):\n if(ans[i-1]<ans[i]):\n anus+=1\nprint(anus)\n", "n = int(input())\n\nbeu = [int(z) for z in input().split()]\n\nbeud = {}\n\nfor i in range(n):\n try:\n beud[beu[i]] += 1\n except KeyError:\n beud[beu[i]] = 1\n\npos = n\nans = 0\nwhile pos>0:\n pos=0\n for i in beud.keys():\n if beud[i] > 0:\n pos+=1\n beud[i]-=1\n if pos!= 0:\n ans+=(pos-1)\nprint(ans)", "n = int(input())\nli = list(map(int, input().split()))\nres = 0\nfor i in li:\n tmp = li.count(i)\n res = max(tmp,res)\nprint(n-res)", "n =int(input())\r\nl = list(map(int,input().split()))\r\nprint(n - max([l.count(i) for i in l]))", "import collections\r\nn = int(input())\r\nnums = list(map(int, input().split()))\r\ncnt = collections.Counter(nums)\r\nans = 0\r\nwhile cnt:\r\n minc = min(cnt.values())\r\n ans += minc * (len(cnt) - 1)\r\n keys = list(cnt.keys())\r\n for c in keys:\r\n cnt[c] -= minc\r\n if not cnt[c]:\r\n del cnt[c]\r\nprint(ans)", "n = int(input())\r\narr = list(map(int,input().split()))\r\nans= n - max(arr.count(i) for i in arr)\r\nprint(ans)", "##n=int(input())\n##z=list(map(int,input().split()))\n##\n##z.sort()\n##status=True\n##count=0\n##for i in range(n-1) :\n## status=True\n## if z[i]==z[i+1] :\n## counti=0\n## while (status) :\n## temp=z\n## if z[i]==z[i+1] :\n## z.append(z[i])\n## del z[i]\n## if z==temp :\n## counti+=1\n## if counti>100 :\n## break\n## else :\n## status=False\n##\n##for i in range(n-1) :\n## if z[i]<z[i+1] :\n## count+=1\n##\n##print(count)\n\nn = int(input())\nz = list(map(int, input().split()))\n\nz.sort()\nx = []\ny = []\n\nfor i in range(1005):\n x.append(0)\n y.append(0)\n\nfor i in range (n):\n x[z[i]] += 1\n y[x[z[i]]] += 1\n\nresult = 0\nfor i in range(1005):\n if y[i] != 0:\n result += (y[i] - 1)\n\nprint(result)\n\t\t \t \t \t\t\t\t\t \t\t\t \t\t\t \t\t\t", "from sys import stdin\ninput = stdin.readline\n\ngoogle = lambda : print(\"Case #%d: \"%(T + 1) , end = '')\n\n\ndef answer():\n\n more , ans , count , key = 0 , 0 , 0 , -1\n for i in range(n):\n\n if(key == a[i]):\n count += 1\n else:\n more += count\n count = 1\n key = a[i]\n\n if(more):\n more -= 1\n ans += 1\n\n return ans\n \n \nfor T in range(1):\n\n n = int(input())\n\n a = sorted(list(map(int,input().split())) , reverse = True)\n\n\n\n print(answer())\n\n\t \t\t\t\t\t\t\t\t \t\t \t\t \t\t \t" ]

[ "n = int(input())\r\nstrengths = []\r\nfor i in range(1, 2 * n):\r\n strengths.append(list(map(int, input().split())))\r\n\r\n# Initialize the teammates array\r\nteammates = [0] * (2 * n)\r\n\r\n# Sort the strengths in descending order\r\npairs = []\r\nfor i in range(1, 2 * n):\r\n for j in range(i):\r\n pairs.append((strengths[i - 1][j], i, j))\r\npairs.sort(reverse=True)\r\n\r\n# Pair the contestants greedily\r\nfor s, i, j in pairs:\r\n # If both contestants are unpaired, pair them\r\n if teammates[i] == 0 and teammates[j] == 0:\r\n teammates[i] = j + 1\r\n teammates[j] = i + 1\r\n\r\n# Print the output\r\nprint(*teammates)", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef sol(x) :\r\n return\r\n\r\nn = int(input())\r\npower = []\r\nfor i in range(2*n-1) :\r\n power.append(list(map(int, input().split())))\r\ncheck = []\r\nfor i in range(2*n-1) :\r\n for j in range(i+1) :\r\n check.append([power[i][j],i+2,j+1])\r\nnset = set()\r\ncheck.sort(key=lambda x : -x[0])\r\nans = [0]*(2*n+1)\r\nfor s,i,j in check :\r\n if i not in nset and j not in nset :\r\n ans[i]=j\r\n ans[j]=i\r\n nset.add(i)\r\n nset.add(j)\r\nprint(*ans[1:])", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef f(u, v):\r\n return u * (2 * n) + v\r\n\r\nn = int(input())\r\nl = pow(10, 6) + 5\r\nx = [-1] * (l + 1)\r\nfor i in range(1, 2 * n):\r\n a = list(map(int, input().split()))\r\n for j in range(i):\r\n x[a[j]] = f(i, j)\r\nans = [0] * (2 * n)\r\nfor i in range(l, -1, -1):\r\n if x[i] == -1:\r\n continue\r\n j, k = divmod(x[i], 2 * n)\r\n if not max(ans[j], ans[k]):\r\n ans[j], ans[k] = k + 1, j + 1\r\nsys.stdout.write(\" \".join(map(str, ans)))", "import sys\r\ninput = sys.stdin.readline\r\nn = int(input())\r\nres = []\r\nt = [-1] * 2 * n\r\nfor i in range(2 * n - 1):\r\n l = list(map(int, input().split()))\r\n for j, x in enumerate(l):\r\n res.append([x, i + 1, j])\r\nres.sort(reverse = True)\r\nfor x, i, j in res:\r\n if t[i] == t[j] == -1:\r\n t[i] = j + 1\r\n t[j] = i + 1\r\nprint(*t)", "n=int(input())\r\nans=[0]*2*n\r\n\r\nn=n*2-1\r\nx=[]\r\nd={}\r\nfor i in range(n):\r\n ar= list(map(int,input().split()))\r\n for j in range(len(ar)):\r\n x.append(ar[j])\r\n d[ar[j]]=(i+2,j+1)\r\nx.sort(reverse=True)\r\n\r\nfor i in range(len(x)):\r\n a,b=d[x[i]]\r\n if ans[a-1]==0 and ans[b-1]==0:\r\n ans[a-1]=b; ans[b-1]=a\r\nprint(*ans,sep=' ')\r\n\r\n\r\n\r\n#wrong hobe .........", "n = int(input())\r\nm = list()\r\nfor i in range(1, 2 * n):\r\n m += map(lambda t: (i, int(t[0]), int(t[1])), enumerate(input().split()))\r\nanswer = [-1] * 2 * n\r\nm = sorted(m, key=lambda s: s[2], reverse=True)\r\nfor (i, j, a) in m:\r\n if answer[i] == -1 and answer[j] == -1:\r\n answer[i] = j + 1\r\n answer[j] = i + 1\r\nprint(' '.join(map(str, answer)))# 1690476061.775007", "'''\r\n###### * User Profile : Keval_78\r\nLinkedIn: https://www.linkedin.com/in/kevalpadsala78/\r\nGithub: https://github.com/Keval78\r\nLeetcode: https://leetcode.com/Keval_78/\r\n'''\r\n\r\nimport sys\r\nfrom os import path\r\nfrom math import log2, floor, ceil, sqrt, pow, gcd\r\n# from random import random, randint, shuffle, choice\r\nfrom collections import Counter, defaultdict, deque\r\n# from itertools import permutations, combinations\r\n# from functools import reduce\r\n# from heapq import heapify, heappop, heappush, heapreplace\r\nfrom bisect import bisect_left, bisect_right\r\n\r\n\r\ndef si(): return sys.stdin.readline().strip()\r\ndef ii(): return int(si())\r\ndef mi(ss=\" \"): return map(int, si().split(ss))\r\ndef msi(ss=\" \"): return map(str, si().split(ss))\r\ndef li(ss=\" \"): return list(mi(ss))\r\n\r\n\r\nsys.setrecursionlimit(10 ** 5)\r\nMOD, MOD2, INF = 10 ** 9 + 7, 998244353, float('inf')\r\nMAX = 10**5+1\r\n\r\nn = ii()\r\nteams = [0 for i in range(2*n)]\r\narr = []\r\nfor i in range(2*n-1):\r\n temp = li()\r\n for i in range(len(temp)):\r\n temp[i] = [temp[i], i+1]\r\n arr.append(sorted(temp, reverse=True))\r\n\r\n# for a in arr:\r\n# print(a)\r\n\r\nfor i in range(n):\r\n curr_max, candidate1, candidate2 = 0, 0, 0\r\n for i in range(2*n-1):\r\n if teams[i+1] != 0: continue\r\n max_ind = -1\r\n for ind, val in enumerate(arr[i]):\r\n if teams[val[1]-1] == 0:\r\n max_ind = ind\r\n break\r\n if max_ind != -1 and curr_max < arr[i][max_ind][0]:\r\n curr_max, candidate1, candidate2 = arr[i][max_ind][0], i+2, arr[i][max_ind][1]\r\n #print(curr_max, candidate1, candidate2)\r\n teams[candidate1-1], teams[candidate2-1] = candidate2, candidate1\r\nprint(*teams)\r\n \r\n" ]

[ "s = input()\r\nlst = []\r\ni = 0\r\nwhile i < len(s):\r\n if s[i].isdigit():\r\n num = ''\r\n while i < len(s) and s[i].isdigit():\r\n num += s[i]\r\n i += 1\r\n lst.append(num)\r\n continue\r\n if s[i] == '.':\r\n lst.append('...')\r\n i += 2\r\n elif s[i] != ' ':\r\n lst.append(s[i])\r\n i += 1\r\nlstcopy = []\r\nfor i in range(len(lst)):\r\n if lst[i] == '...' and i != 0 and lstcopy[-1] != ' ':\r\n lstcopy.append(' ')\r\n lstcopy.append('...')\r\n elif lst[i] == ',' and i != len(lst) - 1:\r\n lstcopy.append(',')\r\n lstcopy.append(' ')\r\n elif i + 1 < len(lst) and lst[i].isdigit() and lst[i+1].isdigit():\r\n lstcopy.append(lst[i])\r\n lstcopy.append(' ')\r\n else:\r\n lstcopy.append(lst[i])\r\n \r\n\r\nprint(''.join(lstcopy))\r\n", "import re\r\nz=input()\r\nz=re.sub(\"\\s*,\",\", \",z)\r\nz=re.sub(\"\\s*\\.\\.\\.\\s*\",\" ...\",z)\r\nz=re.sub(\"\\s*\\ \\ \\s*\",\" \",z)\r\nprint(z.strip())\r\n", "import re\n\ns = input().strip()\n\ns = re.sub('(\\d)\\s+(?=\\d)', r'\\1x', s)\ns = re.sub('\\s', '', s)\ns = re.sub(',', ', ', s)\ns = re.sub('\\.\\.\\.', ' ...', s)\ns = re.sub('^\\s|\\s$', '', s)\ns = re.sub('\\s\\s', ' ', s)\ns = re.sub('x', ' ', s)\n\nprint(s)\n\n", "s = input()\r\nres = ''\r\ni = 0\r\nwhile i < len(s):\r\n if s[i] == ',':\r\n res += ','\r\n if i != len(s)-1:\r\n res += ' '\r\n elif s[i] == '.':\r\n if len(res) != 0:\r\n if res[-1] != ' ':\r\n res += ' '\r\n res += '...'\r\n i += 2\r\n elif s[i].isdigit():\r\n if len(res) != 0:\r\n if s[i-1] == ' ' and res[-1].isdigit():\r\n res += ' '\r\n res += s[i]\r\n i += 1\r\n\r\nprint(res)\r\n\r\n", "import sys\r\n\r\n\r\ndef read_input(input_path=None):\r\n if input_path is None:\r\n f = sys.stdin\r\n else:\r\n f = open(input_path, 'r')\r\n\r\n return [f.readline().strip()]\r\n\r\n\r\ndef sol(line):\r\n b = []\r\n for e in line.split(','):\r\n c = [' '.join(ee.split()) for ee in e.split('...')]\r\n b.append(' ...'.join(c).strip())\r\n\r\n return [', '.join(b).strip()]\r\n\r\n\r\ndef solve(input_path=None):\r\n return sol(*read_input(input_path))\r\n\r\n\r\ndef main():\r\n for line in sol(*read_input()):\r\n print(f\"{line}\")\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "'''string=str(input())\r\n#creating the array which has no space\r\narr_with_no_space=[]\r\nfor i in string:\r\n if i!=\" \":\r\n arr_with_no_space.append(i)\r\n#print(arr_with_no_space)\r\n#taking care of the constraints and constructing the final string\r\nspace=\" \"\r\nfinal_arr=[]\r\nlength=len(arr_with_no_space)\r\ncounter=0\r\nwhile counter!=length:\r\n #if it is a comma\r\n if arr_with_no_space[counter]==\",\" and arr_with_no_space[counter+1]!=\".\":\r\n final_arr.append(arr_with_no_space[counter])\r\n final_arr.append(space)\r\n counter+=1\r\n elif arr_with_no_space[counter]==\",\":\r\n final_arr.append(arr_with_no_space[counter])\r\n counter+=1\r\n #if it is a .\r\n elif arr_with_no_space[counter]==\".\" and arr_with_no_space[counter+1]==\".\" and arr_with_no_space[counter+2]==\".\":\r\n final_arr.append(space)\r\n final_arr.append(arr_with_no_space[counter])\r\n final_arr.append(arr_with_no_space[counter+1])\r\n final_arr.append(arr_with_no_space[counter+2])\r\n counter+=3\r\n #if it is just an ordinary element\r\n else:\r\n final_arr.append(arr_with_no_space[counter])\r\n counter+=1\r\n\r\n#special condition...... the first and the last element must not be a \" \"\r\nfinal_string=\"\"\r\nif final_arr[0]==\" \":\r\n final_arr.pop(0)\r\nif final_arr[len(final_arr)-1]==\" \":\r\n final_arr.pop(len(final_arr)-1)\r\nfor i in final_arr:\r\n final_string+=i\r\nprint(final_string) \r\n \r\n'''\r\nimport re\r\nstring = input().replace('...', '.')\r\nstring = re.sub(' +', ' ', string)\r\n\r\nanswer = ''\r\ndotCount = 0\r\nfor i in range(len(string)):\r\n if string[i].isdigit():\r\n answer += string[i]\r\n \r\n elif string[i] == ',':\r\n answer += string[i] + ' '\r\n \r\n elif string[i] == '.':\r\n if i == 0 or answer[-1] == ' ':\r\n answer += '...'\r\n else:\r\n answer += ' ...'\r\n elif string[i] == ' ':\r\n if i == len(string) - 1 or i == 0:\r\n continue\r\n else:\r\n if string[i + 1].isdigit() and string[i - 1].isdigit():\r\n answer += string[i]\r\nif answer.startswith(' '):\r\n answer = answer[1:]\r\nif answer.endswith(' '):\r\n answer = answer[:-1]\r\n#answer = answer.replace(' ,', ',')\r\n#answer = answer.replace('... ', '...')\r\nanswer = re.sub(' +', ' ', answer)\r\nprint(answer)\r\n", "s=input()\r\nans=' '.join(s.split())\r\nans=ans.replace(', ',',')\r\nans=ans.replace(' ,',',')\r\nans=ans.replace(',',', ')\r\nans=ans.replace('... ','...')\r\nans=ans.replace(' ...','...')\r\nans=ans.replace('...',' ...')\r\nif ans[0]==' ':\r\n ans=ans[:0]+ans[1:]\r\nif ans[-1]==' ':\r\n ans=ans[:-1]\r\nprint(ans)", "s=input()\n\nwhile(' ' in s):\n s=s.replace(' ',' ')\nwhile(' ,' in s):\n s=s.replace(' ,',',')\nwhile('. ' in s):\n s=s.replace('. ','.')\n\n\n\ns=s.replace(',',', ')\ns=s.replace('...',' ...')\n\nif(s[0]==' '):\n s=s[1:]\nif(s[-1]==' '):\n s=s[:len(s)-1]\n\nwhile(' ' in s):\n s=s.replace(' ',' ')\nprint(s)\n", "ans = input()\nwhile \" ,\" in ans:\n ans = ans.replace(\" ,\", \",\")\nans = ans.replace(\"...\", \" ...\").replace(\",\", \", \")\nwhile \" \" in ans:\n ans = ans.replace(\" \", \" \")\nfor d in \"0123456789\": ans = ans.replace(\". \" + d, \".\" + d)\nprint(ans.strip(), end=\"\")\n", "# LUOGU_RID: 104833499\nimport re\r\ns = input()\r\ns = re.sub('\\s*,', ', ', s)\r\ns = re.sub('\\s*\\.\\.\\.\\s*', ' ...', s)\r\ns = re.sub('\\s*\\ \\ \\s*', ' ', s)\r\nprint(s.strip())\r\n", "t = input().split()\r\nt = ' '.join(t)\r\nt = t.replace(', ', ',')\r\nt = t.replace(' ,', ',')\r\nt = t.replace(',', ', ')\r\nt = t.replace(' ...', '...')\r\nt = t.replace('... ', '...')\r\nt = t.replace('...', ' ...')\r\nif t[0] == ' ': \r\n t = t[1: ]\r\nif t[-1] == ' ': \r\n t = t[: -1]\r\nprint(t)", "# вводим строку s\r\ns, i, v = input() + ' ', 0, ' '\r\n\r\n# перебираем строку\r\nwhile i < len(s):\r\n # если в строке запятая, поставить пробел после нее\r\n if s[i] == ',':\r\n v += ', '\r\n # если в строке точки, заменить их на многоточия и пробел перед ними\r\n elif s[i] == '.':\r\n v += ('' if v[-1] == ' ' else ' ') + '...'\r\n i += 2\r\n # проверка строки на наличие цифр\r\n elif s[i].isdigit():\r\n j = i\r\n # ставим пробел перед числом\r\n while s[j].isdigit():\r\n j += 1\r\n v += (' ' if v[-1].isdigit() else '') + s[i:j]\r\n i = j - 1\r\n i += 1\r\nprint(v.strip())\r\n", "line = input()\nb = []\nfor e in line.split(','):\n c = [' '.join(ee.split()) for ee in e.split('...')]\n b.append(' ...'.join(c).strip())\nprint(', '.join(b).strip())\n", "a=input()\r\nb=''\r\nc=0\r\nn=len(a)\r\nd=0\r\ne=0\r\nfor i in range(n):\r\n if a[i]=='.':\r\n if c%3==0 and i!=0 and (e==0 or b[-1]!=' '):\r\n b+=' '\r\n e+=1\r\n b+=a[i]\r\n e+=1\r\n c+=1\r\n d=0\r\n elif a[i]==',':\r\n b+=a[i]\r\n e+=1\r\n if i!=n-1:\r\n b+=' '\r\n e+=1\r\n d=0\r\n elif a[i]!=' ':\r\n if d==2:\r\n b+=' '\r\n e+=1\r\n b+=a[i]\r\n e+=1\r\n d=1\r\n else:\r\n if d==1:\r\n d=2\r\nprint(b)" ]

[ "from sys import stdin\r\ninput = stdin.readline\r\n\r\ndef solve():\r\n n = int(input())\r\n x = [int(x) for x in input().split()]\r\n s = set(x)\r\n ans = [x[0]]\r\n for i in range(n):\r\n for j in range(0, 32):\r\n if x[i] + 2**j in s:\r\n ans = [x[i], x[i] + 2**j]\r\n if x[i] + (2**j * 2) in s:\r\n ans.append(x[i] + (2**j * 2))\r\n return ans\r\n return ans\r\n\r\nans = solve()\r\nprint(len(ans))\r\nprint(*ans)", "def solve():\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n s=set(a)\r\n l=[]\r\n for i in range(31):\r\n x=1<<i\r\n for j in a:\r\n if j+x in s :\r\n if j+x+x in s:\r\n print(3)\r\n print(j,j+x,j+x+x)\r\n return\r\n else:\r\n l=[j,j+x]\r\n if(len(l)>1):\r\n print(2)\r\n print(l[0],l[1])\r\n return\r\n print(1)\r\n print(a[0])\r\nsolve() ", "n=int(input())\r\nl=set(map(int,input().split()))\r\ntest=False\r\nm=max(l)\r\nres=[]\r\nfor ele in l:\r\n p=1\r\n while ele+p<=m:\r\n if ele+p in l:\r\n test=True\r\n res=[ele,ele+p]\r\n if ele+2*p in l:\r\n print(3)\r\n print(ele,ele+p,ele+2*p)\r\n exit()\r\n p*=2\r\nif test:\r\n print(2)\r\n print(*res)\r\nelse:\r\n print(1)\r\n print(m)", "n = int(input())\r\na = set(map(int, input().split()))\r\nb = max(a)\r\np = 0\r\nfor x in a:\r\n d=1\r\n while x+d<=b:\r\n y=x+d\r\n if y in a:\r\n p=x,y\r\n if y+d in a:\r\n print(3)\r\n print(x,y,y+d)\r\n exit()\r\n d*=2\r\nif p:\r\n print(2)\r\n print(*p)\r\nelse:\r\n print('1\\n'+str(b))", "import sys\r\nimport bisect as bs\r\ninput = sys.stdin.readline\r\nn = int(input())\r\na = list(map(int, input().split())) + [10**10]\r\na.sort()\r\nkq = []\r\nfor d in range(0, 31):\r\n for i in range(n):\r\n tmp = [a[i]]\r\n vt = bs.bisect_left(a, a[i] + (1 << d))\r\n if vt < n and a[vt] == a[i] + (1 << d):\r\n tmp.append(a[i] + (1 << d))\r\n vt = bs.bisect_left(a, a[i] + 2*(1 << d))\r\n if vt < n and a[vt] == a[i] + 2*(1 << d):\r\n tmp.append(a[i] + 2*(1 << d))\r\n if len(tmp) > len(kq):\r\n kq = tmp\r\nprint(len(kq))\r\nprint(' '.join(str(x) for x in kq))", "# 猜想最多为3个 等差数列\r\nn = int(input())\r\na = list(map(int,input().split()))\r\ns = set(a)\r\nfor i in a:\r\n for j in range(32):\r\n if i + (1<<j) in s and i - (1<< j) in s:\r\n print(3)\r\n print(i - (1<<j),i,i + (1<<j))\r\n exit()\r\nfor i in a:\r\n for j in range(32):\r\n if i + (1 << j) in s:\r\n print(2)\r\n print(i,i + (1<<j))\r\n exit()\r\n if i - (1 << j) in s:\r\n print(2)\r\n print(i - (1<<j),i)\r\n exit()\r\nprint(1)\r\nprint(a[0])\r\nexit()", "import sys\r\ninput = lambda: sys.stdin.readline().strip()\r\ndef solve():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n s = set(a)\r\n for i, x in enumerate(a):\r\n for j in range(32):\r\n y, z = x+(1<<j), x+(1<<(j+1))\r\n if x in s and y in s and z in s:\r\n print(3)\r\n return print(x, y, z)\r\n for i, x in enumerate(a):\r\n for j in range(32):\r\n y = x+(1<<j)\r\n if x in s and y in s:\r\n print(2)\r\n return print(x, y)\r\n print(1)\r\n print(a[0])\r\nsolve()", "n=int(input())\r\narr=list(map(int,input().split()))\r\ns=set(arr)\r\nmaxi=0\r\np_count,m_count =0,0\r\na,b,c=0,0,0\r\nfor i in range(31):\r\n for j in range(n):\r\n count,p_count,m_count =1,0,0\r\n if arr[j] +(1 <<i) in s:\r\n p_count +=1\r\n count +=1\r\n if arr[j] -(1 <<i) in s:\r\n m_count +=1\r\n count +=1\r\n if maxi <count :\r\n maxi= count\r\n a=arr[j]\r\n if maxi ==2 and p_count ==1:\r\n b =arr[j] +(1<<i)\r\n if maxi ==2 and m_count ==1:\r\n b=arr[j] -(1 <<i)\r\n if maxi ==3:\r\n b,c=arr[j] +(1 <<i) ,arr[j] -(1 <<i)\r\nprint(maxi)\r\nif maxi ==1:\r\n print(a)\r\nif maxi ==2:\r\n print(a,b)\r\nif maxi ==3:\r\n print(a,b,c)", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\ninput=sys.stdin.readline\r\nn=int(input())\r\nl=sorted([int(i) for i in input().split()])\r\nl1=[]\r\np=1\r\nj=0\r\nwhile(j<31):\r\n l1.append(p)\r\n p*=2\r\n j+=1\r\nd=collections.Counter(l)\r\nt=[]\r\nc=0\r\nfor i in d:\r\n c1=0\r\n for j in range(31):\r\n if(i+l1[j] in d and i+2*l1[j] in d):\r\n k1=l1[j]\r\n c1=1\r\n break\r\n if(c1==1):\r\n t=[i,i+k1,i+2*k1]\r\n c=1\r\n break\r\nif(c==0):\r\n c1=0\r\n for i in d:\r\n for j in range(31):\r\n if(i+l1[j] in d):\r\n k1=l1[j]\r\n c1=1\r\n break\r\n if(c1==1):\r\n t=[i,i+k1]\r\n c=1\r\n break\r\n if(c==0):\r\n print(1)\r\n print(l[0])\r\n else:\r\n print(2)\r\n print(*t)\r\nelse:\r\n print(3)\r\n print(*t)", "n=int(input())\r\ns=set(map(int,input().split()))\r\nm=max(s)\r\np=0\r\nfor x in s:\r\n d=1\r\n while x+d<=m:\r\n y=x+d\r\n if y in s:\r\n p=x,y\r\n if y+d in s:\r\n print(3);print(x,y,y+d);exit()\r\n d*=2\r\nif p:\r\n print(2);print(*p)\r\nelse:print('1\\n'+str(m))", "# apply mask / delta of value\r\n\r\n\r\n# recognise there are only a few possibilties of differences [2, 4]\r\n\r\n\r\nclass Solution:\r\n\r\n def __init__(self) -> None:\r\n \r\n self.triples = [\r\n [0, 1073741824, 2147483648],\r\n [0, 536870912, 1073741824],\r\n [0, 268435456, 536870912],\r\n [0, 134217728, 268435456],\r\n [0, 67108864, 134217728],\r\n [0, 33554432, 67108864],\r\n [0, 16777216, 33554432],\r\n [0, 8388608, 16777216],\r\n [0, 4194304, 8388608],\r\n [0, 2097152, 4194304],\r\n [0, 1048576, 2097152],\r\n [0, 524288, 1048576],\r\n [0, 262144, 524288],\r\n [0, 131072, 262144],\r\n [0, 65536, 131072],\r\n [0, 32768, 65536],\r\n [0, 16384, 32768],\r\n [0, 8192, 16384],\r\n [0, 4096, 8192],\r\n [0, 2048, 4096],\r\n [0, 1024, 2048],\r\n [0, 512, 1024],\r\n [0, 256, 512],\r\n [0, 128, 256],\r\n [0, 64, 128],\r\n [0, 32, 64],\r\n [0, 16, 32],\r\n [0, 8, 16],\r\n [0, 4, 8],\r\n [0, 2, 4],\r\n [0, 1, 2],\r\n ]\r\n\r\n self.doubles = [\r\n [0, 2147483648],\r\n [0, 1073741824],\r\n [0, 536870912],\r\n [0, 268435456],\r\n [0, 134217728],\r\n [0, 67108864],\r\n [0, 33554432],\r\n [0, 16777216],\r\n [0, 8388608],\r\n [0, 4194304],\r\n [0, 2097152],\r\n [0, 1048576],\r\n [0, 524288],\r\n [0, 262144],\r\n [0, 131072],\r\n [0, 65536],\r\n [0, 32768],\r\n [0, 16384],\r\n [0, 8192],\r\n [0, 4096],\r\n [0, 2048],\r\n [0, 1024],\r\n [0, 512],\r\n [0, 256],\r\n [0, 128],\r\n [0, 64],\r\n [0, 32],\r\n [0, 16],\r\n [0, 8],\r\n [0, 4],\r\n [0, 2],\r\n [0, 1],\r\n ]\r\n\r\n def maskTriplet(self, a):\r\n\r\n for triplet in self.triples:\r\n\r\n b = triplet[1] + a\r\n c = triplet[2] + a\r\n\r\n if b not in self.pool:\r\n continue\r\n\r\n if c not in self.pool:\r\n continue\r\n\r\n self.solved = True\r\n self.ans = [a, b, c]\r\n return\r\n\r\n def maskDouble(self, a):\r\n\r\n for double in self.doubles:\r\n\r\n b = double[1] + a\r\n\r\n if b not in self.pool:\r\n continue\r\n\r\n self.solved = True\r\n self.ans = [a, b]\r\n return\r\n \r\n\r\n def printAns(self):\r\n\r\n build = f\"{self.ans[0]}\"\r\n\r\n for i in range(1, len(self.ans)):\r\n build += f\" {self.ans[i]}\"\r\n\r\n print(len(self.ans))\r\n print(build)\r\n\r\n def solve(self, n, coords):\r\n\r\n self.pool = set(coords)\r\n\r\n self.solved = False\r\n self.ans = \"\"\r\n\r\n for x in list(self.pool):\r\n if self.solved:\r\n break\r\n self.maskTriplet(x)\r\n\r\n for x in list(self.pool):\r\n if self.solved:\r\n break\r\n self.maskDouble(x)\r\n\r\n if not self.solved:\r\n self.ans = [coords[0]]\r\n\r\n self.printAns()\r\n\r\nn = int(input())\r\nnums = [int(x) for x in input().split(\" \")]\r\n\r\nsolver = Solution()\r\nsolver.solve(n, nums)", "\"\"\"\r\n-*- coding: utf-8 -*-\r\n\r\nCreated on Wed Jan 19 16:17:31 2022\r\n\r\n@author: Tausif Khan Arnob\r\n\"\"\"\r\n\r\nimport bisect\r\n\r\ndef b_search(a, x):\r\n i = bisect.bisect_left(a, x)\r\n return True if i != len(a) and a[i] == x else False\r\n\r\ninput()\r\na = sorted([*map(int, input().split())])\r\nmaxx = max(a)\r\nans = 0\r\nfor x in a:\r\n d = 1\r\n while x+d <= maxx:\r\n if b_search(a, x+d):\r\n ans = x, x+d\r\n if b_search(a, x+d+d):\r\n exit(print('3\\n', x, x+d, x+d+d))\r\n d <<= 1\r\nif ans:\r\n print('2\\n', *ans)\r\nelse:\r\n print('1\\n', maxx)", "n = int(input())\r\narr = [int(j) for j in input().split()]\r\narr.sort()\r\nans = [arr[0]]\r\n \r\nma = [1, ans]\r\n \r\narr = set(arr)\r\nfor x in arr:\r\n\ttwo = 1\r\n\twhile x+two < 10**10:\r\n\t\tif x+two in arr:\r\n\t\t\tans = [x, x+two]\r\n\t\t\tif ma[0] < 2:\r\n\t\t\t\tma = [2, ans]\r\n\t\t\tif x+2*two in arr:\r\n\t\t\t\tans = [x, x+two, x+2*two]\r\n\t\t\t\tif ma[0] < 3:\r\n\t\t\t\t\tma = [3, ans]\r\n\t\t\ttwo*= 2\r\n \r\n\t\telse:\r\n\t\t\ttwo *= 2\r\n \r\nprint(ma[0])\r\nprint(*ma[1])", "n=int(input())\ns=set(map(int,input().split()))\nm=max(s)\np=0\nfor x in s:\n d=1\n while x+d<=m:\n y=x+d\n if y in s:\n p=x,y\n if y+d in s:\n print(3);print(x,y,y+d);exit()\n d*=2\nif p:\n print(2);print(*p)\nelse:print('1\\n'+str(m))\n \t \t \t\t\t \t\t\t\t \t \t \t\t \t", "import sys\r\nn = int(input())\r\narr = set(map(int,input().split()))\r\nm = max(arr)\r\np = 0\r\nfor x in arr:\r\n d = 1\r\n while x + d <= m:\r\n y = x + d\r\n if y in arr:\r\n p = x,y\r\n if y + d in arr:\r\n z = y + d\r\n print(3)\r\n print(x,y,z)\r\n sys.exit()\r\n d *= 2\r\nif p:\r\n print(2)\r\n print(*p)\r\n sys.exit()\r\nprint(1)\r\nprint(m)", "import bisect\r\nimport collections\r\nimport copy\r\nimport enum\r\nimport functools\r\nimport heapq\r\nimport itertools\r\nimport math\r\nimport random\r\nimport re\r\nimport sys\r\nimport time\r\nimport string\r\nfrom typing import List\r\nsys.setrecursionlimit(3001)\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\narr = list(map(int,input().split()))\r\nsa = set(arr)\r\narr.sort()\r\nans = [arr[0]]\r\nfor c in arr:\r\n base = 1\r\n while c+base<=10**9:\r\n if c+base in sa:\r\n if len(ans)<2:\r\n ans = [c,c+base]\r\n if c+ base+base in sa:\r\n if len(ans)<3:\r\n ans = [c,c+base,c+base+base]\r\n base*=2\r\nprint(len(ans))\r\nprint(*ans)\r\n", "import sys\r\n#import random\r\nfrom bisect import bisect_left as lb\r\nfrom bisect import bisect_right as rb\r\nfrom collections import deque\r\n#sys.setrecursionlimit(10**8)\r\nfrom queue import PriorityQueue as pq\r\nfrom math import gcd\r\n#import math\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\nlii = lambda : list(map(int, list(ip())))\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\ndx = [0,0,1,-1]\r\ndy = [1,-1,0,0]\r\nmod = 10**9 + 7\r\nmod1 = 998244353\r\n\r\nn = ii()\r\na = il()\r\n\r\na.sort()\r\n\r\nd = {}\r\n\r\nfor i in a :\r\n d[i] = 1\r\n\r\nfor j in range (32) :\r\n x = 1<<j\r\n\r\n for i in a :\r\n #print(i,i+x,i+2*x,d.get(i+x),d.get(i+2*x))\r\n if (d.get(i+x) and d.get(i+2*x)) :\r\n print(3)\r\n print(i,i+x,i+2*x)\r\n exit(0)\r\n\r\nfor j in range (32) :\r\n x = 1<<j\r\n\r\n for i in a :\r\n if (d.get(i+x)) :\r\n print(2)\r\n print(i,i+x)\r\n exit(0)\r\nprint(1)\r\nprint(a[0])\r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n", "\r\n\r\nn=int(input())\r\nl=list(map(int, input().split()))\r\n\r\nd={}\r\nfor i in l:\r\n if i not in d:\r\n d[i]=0 \r\n d[i]+=1 \r\n\r\nans=1\r\nt=[l[0]]\r\nfor i in d:\r\n for j in range(32):\r\n a=1 \r\n b=[i]\r\n if i+2**j in d :\r\n a+=1 \r\n b.append(i+2**j)\r\n if i-2**j in d :\r\n a+=1 \r\n b.append(i-2**j)\r\n \r\n if ans<a:\r\n ans=a \r\n t=b[:]\r\n\r\nprint(ans)\r\nprint(*t)\r\n ", "from sys import exit\r\nn=int(input())\r\ns={int(e) for e in input().split()}\r\na=[min(s)]\r\nfor e in s:\r\n for i in range(32):\r\n if e+2**i in s:\r\n a=[e,e+2**i]\r\n if e+2**(i+1) in s:\r\n print(3)\r\n print(e,e+2**i,e+2**(i+1))\r\n exit()\r\nprint(len(a))\r\nprint(*a)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nx = list(map(int, input().split()))\r\nx.sort()\r\ns = set(x)\r\nm, ans = 1, [x[0]]\r\npow2 = [1]\r\nfor _ in range(35):\r\n pow2.append(2 * pow2[-1])\r\nfor i in x:\r\n for j in pow2:\r\n if (i - j) in s and (i + j) in s:\r\n m = 3\r\n ans = [i - j, i, i + j]\r\n break\r\n elif (i - j) in s and m < 2:\r\n m = 2\r\n ans = [i, i - j]\r\n elif (i + j) in s and m < 2:\r\n m = 2\r\n ans = [i, i + j]\r\n if m == 3:\r\n break\r\nprint(m)\r\nprint(*ans)", "from sys import stdin,stdout\r\nnmbr = lambda: int(input())\r\nlst = lambda: list(map(int, input().split()))\r\n\r\nfor _ in range(1):#nmbr()):\r\n n=nmbr()\r\n a=set(lst())\r\n lim=max(a)\r\n f=0\r\n for x in a:\r\n p2=1\r\n while x+2*p2<=lim:\r\n f=0\r\n if x in a and x+p2 in a and x+2*p2 in a:\r\n ans=[x,x+p2,x+2*p2]\r\n f=1\r\n break\r\n if f:break\r\n p2*=2\r\n if f: break\r\n\r\n if f:\r\n print(3)\r\n print(*ans)\r\n continue\r\n for x in a:\r\n p2 = 1\r\n while x + p2 <= lim:\r\n f = 0\r\n if x in a and x + p2 in a:\r\n ans = [x, x + p2]\r\n f = 1\r\n break\r\n p2 *= 2\r\n if f:break\r\n if f:\r\n print(2)\r\n print(*ans)\r\n continue\r\n print(1)\r\n print(list(a)[0])\r\n", "# i'm from jasnah, do not ban me\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\nprint = sys.stdout.write\r\n\r\nn = int(input())\r\ns = set(map(int, input().split()))\r\nm = max(s)\r\np = 0\r\nfor x in s:\r\n d = 1\r\n while x + d <= m:\r\n y = x + d\r\n if y in s:\r\n p = x, y\r\n if y + d in s:\r\n print('3\\n')\r\n print(f'{x} {y} {y + d}\\n')\r\n exit()\r\n d *= 2\r\nif p:\r\n print(\"2\\n\")\r\n print(f\"{' '.join(list(map(str, p)))}\\n\")\r\nelse:\r\n print('1\\n' + str(m) + '\\n')\r\n", "n = int(input())\r\ns = set(map(int, input().split()))\r\nm = max(s)\r\np = 0\r\nfor x in s:\r\n d=1\r\n while x+d<=m:\r\n y=x+d\r\n if y in s:\r\n p=x,y\r\n if y+d in s:\r\n print(3)\r\n print(x,y,y+d)\r\n exit(0)\r\n d*=2\r\nif p:\r\n print(2)\r\n print(*p)\r\nelse:\r\n print(1)\r\n print(str(m))\r\n", "def main():\r\n\tinput()\r\n\ts = set(map(int, input().split()))\r\n\tb = mi = min(s)\r\n\tfor x in s:\r\n\t\tfour, y, z = 4, x - 1, x - 2\r\n\t\twhile mi <= y:\r\n\t\t\tif y in s:\r\n\t\t\t\tif z in s:\r\n\t\t\t\t\tprint('3\\n%d %d %d' % (z, y, x))\r\n\t\t\t\t\treturn\r\n\t\t\t\tb = x\r\n\t\t\ty, z = z, x - four\r\n\t\t\tfour *= 2\r\n\tif b == mi:\r\n\t\tprint('1\\n%d' % mi)\r\n\t\treturn\r\n\td = 1\r\n\twhile b - d not in s:\r\n\t\td *= 2\r\n\tprint('2\\n%d %d' % (b - d, b))\r\n \r\n \r\nif __name__ == '__main__':\r\n\tmain()\r\n", "# Problem: D. Points and Powers of Two\r\n# Contest: Codeforces - Codeforces Round 486 (Div. 3)\r\n# URL: https://codeforces.com/contest/988/problem/D\r\n# Memory Limit: 256 MB\r\n# Time Limit: 4000 ms\r\n\r\nimport sys\r\nimport bisect\r\nimport random\r\nimport io, os\r\nfrom bisect import *\r\nfrom collections import *\r\nfrom contextlib import redirect_stdout\r\nfrom itertools import *\r\nfrom array import *\r\nfrom functools import lru_cache\r\nfrom types import GeneratorType\r\nfrom heapq import *\r\nfrom math import sqrt, gcd, inf\r\n\r\nif sys.version >= '3.8': # ACW没有comb\r\n from math import comb\r\n\r\nRI = lambda: map(int, sys.stdin.buffer.readline().split())\r\nRS = lambda: map(bytes.decode, sys.stdin.buffer.readline().strip().split())\r\nRILST = lambda: list(RI())\r\nDEBUG = lambda *x: sys.stderr.write(f'{str(x)}\\n')\r\n\r\nMOD = 10 ** 9 + 7\r\nPROBLEM = \"\"\"https://codeforces.com/contest/988/problem/D\r\n\r\n输入 n(≤1e5) 和长为 n 的整数数组 a(-1e9≤a[i]≤1e9)，没有相同元素。\r\n\r\n从 a 中选择尽量多的数，组成集合 b，要求 b 中任意两个数的差的绝对值都是 2 的幂次。\r\n输出 b 的大小以及 b 中的每个数。（没有顺序要求，多解输出任意一解）\r\n输入\r\n6\r\n3 5 4 7 10 12\r\n输出 \r\n3\r\n7 3 5\r\n\r\n输入\r\n5\r\n-1 2 5 8 11\r\n输出 \r\n1\r\n8\r\n\"\"\"\r\n\"\"\"数学+倍增枚举\r\nacw63场T3\r\n\"\"\"\r\n\r\n\r\n# ms\r\ndef solve():\r\n n, = RI()\r\n a = set(RILST())\r\n mx = max(a)\r\n ans = [mx]\r\n for x in a:\r\n for k in range(33):\r\n if x + 2 ** k > mx:\r\n break\r\n t = [x]\r\n if (x + 2 ** k) in a:\r\n t.append(x + 2 ** k)\r\n if (x + 2 ** (k + 1)) in a:\r\n t.append(x + 2 ** (k + 1))\r\n if len(t) == 3:\r\n print(3)\r\n return print(*t)\r\n if len(t) > len(ans):\r\n ans = t[:]\r\n print(len(ans))\r\n print(*ans)\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "from random import *\nimport sys\nfrom collections import * \nfrom math import * \nfrom functools import *\nfrom heapq import *\nfrom string import *\n\nascii_lowercase = \"ab\"\n\ndef solve(n,arr):\n cc = Counter(arr)\n mx = max(arr)\n ans = [arr[0]]\n for a in arr:\n b = 1\n while a+b <= mx:\n if cc[a+b] and cc[a-b]:\n return [a-b,a,a+b]\n if cc[a+b]:\n ans = [a,a+b]\n b *= 2\n return ans \n\n \ndef genseq(n,i,path,s,e,flo,fhi):\n if i == n: \n yield path\n return\n lo = s[i] if flo else ascii_lowercase[0]\n hi = e[i] if fhi else ascii_lowercase[-1]\n for ch in ascii_lowercase:\n if lo <= ch <= hi:\n yield from genseq(n,i+1,path+ch,s,e,flo and ch == lo, fhi and ch == hi)\n return\n\ndef brute(n,s1,s2,evil):\n g = genseq(n,0,'',s1,s2,True,True)\n cnt = 0\n for s in g:\n if evil in s: \n # print(s)\n continue\n cnt += 1\n return cnt \n\ndef generate():\n \n n = randint(1,10)\n m = randint(1,n)\n s1 = ''.join(choices(ascii_lowercase,k=n))\n s2 = ''.join(choices(ascii_lowercase,k=n))\n if s1 > s2: s1, s2 = s2, s1 \n evil = ''.join(choices(ascii_lowercase,k=m))\n return n,s1,s2,evil\n\n\n\n\ndef main():\n # sys.stdin = open('contests/input', 'r')\n # s = input()\n # case = int(input())\n for i in range(1):\n # n, k = list(map(int,input().split()))\n n = int(input())\n arr = list(map(int,input().split()))\n # s = input()\n ans = solve(n,arr) \n print(len(ans))\n print(*ans)\n # ans1 = solve(n,arr)\n\n # ans2 = brute(n,s1,s2,evil)\n # assert(ans1 == ans2)\n # print(f\"{i}th test case ok\")\n \n\nif __name__ == \"__main__\":\n main()", "import sys\r\ninput=sys.stdin.readline\r\nn=int(input())\r\nx=list(map(int,input().split()))\r\nx.sort()\r\nsx=set(x)\r\nk=1\r\nml=1\r\nans=[x[0]]\r\nfor j in range(31):\r\n for xx in x:\r\n if xx-k in sx:\r\n if ml==1:\r\n ml=2\r\n ans=[xx-k,xx]\r\n if xx+k in sx:\r\n if ml==1:\r\n ml=2\r\n ans=[xx,xx+k]\r\n if xx-k in sx and xx+k in sx and ml<=2:\r\n ml=3\r\n ans=[xx-k,xx,xx+k]\r\n k*=2\r\nprint(ml)\r\nprint(*ans)", "# https://codeforces.com/contest/988\n\nimport sys\n\ninput = lambda: sys.stdin.readline().rstrip() # faster!\n\npow2 = [1]\nwhile len(pow2) < 32:\n pow2 += [2 * pow2[-1]]\n\nn = int(input())\nx = list(map(int, input().split()))\nxs = set(x)\n\nfor v in x:\n for p in pow2:\n if v + p in xs and v + 2 * p in xs:\n print(3)\n print(v, v + p, v + 2 * p)\n exit()\n\nfor v in x:\n for p in pow2:\n if v + p in xs:\n print(2)\n print(v, v + p)\n exit()\n\nprint(1)\nprint(x[0])\n", "import sys\r\nfrom collections import Counter\r\n \r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n \r\ndef I():\r\n return input()\r\ndef II():\r\n return int(input())\r\ndef LI():\r\n return list(input().split())\r\ndef LII():\r\n return list(map(int, input().split()))\r\n\r\n\r\n\r\nclass Solution:\r\n\t@staticmethod\r\n\tdef main():\r\n\t\tn = II()\r\n\t\tlst = LII()\r\n\t\tset_ = set(lst)\r\n\t\tres = []\r\n\t\tfor i, x in enumerate(lst):\r\n\t\t\tfor j in range(31):\r\n\t\t\t\tdiff = 1 << j\r\n\t\t\t\tif x + diff in set_ and x - diff in set_:\r\n\t\t\t\t\tres = [x, x+diff, x-diff]\r\n\t\t\t\t\tprint(3)\r\n\t\t\t\t\tprint(' '.join(map(str, res)))\r\n\t\t\t\t\treturn\r\n\t\t\t\telif not res and x + diff in set_:\r\n\t\t\t\t\tres = [x, x+diff]\r\n\t\t\t\telif not res and x - diff in set_:\r\n\t\t\t\t\tres = [x, x-diff]\r\n\t\tif len(res) == 2:\r\n\t\t\tprint(2)\r\n\t\t\tprint(' '.join(map(str, res)))\r\n\t\telse:\r\n\t\t\tprint(1)\r\n\t\t\tprint(lst[0])\r\n\r\n\r\n\r\nSolution.main()\r\n", "def solve():\r\n n = int(input())\r\n arr = list(map(int, input().split()))\r\n \r\n num_set = set(arr)\r\n longest_subsequence = [arr[0]]\r\n \r\n for i in range(n):\r\n power = 1\r\n while True:\r\n subseq = [arr[i]]\r\n \r\n if arr[i] + power in num_set and arr[i] + 2 * power in num_set:\r\n print(3)\r\n print(arr[i], arr[i] + power, arr[i] + 2 * power)\r\n return\r\n elif arr[i] + power in num_set:\r\n subseq.append(arr[i] + power)\r\n elif arr[i] + 2 * power in num_set:\r\n subseq.append(arr[i] + 2 * power)\r\n \r\n if len(subseq) > len(longest_subsequence):\r\n longest_subsequence = subseq\r\n \r\n power *= 2\r\n if power > 10**18:\r\n break\r\n \r\n print(len(longest_subsequence))\r\n print(*longest_subsequence)\r\n\r\n# Uncomment the following lines if the number of test cases is provided\r\n# t = int(input())\r\n# for _ in range(t):\r\n# solve()\r\n\r\nsolve() # For a single test case\r\n", "def ca(n, s):\r\n d = set(s)\r\n m = max(d)\r\n p = [m]\r\n for i in d:\r\n v = 1\r\n while i + v <= m:\r\n if i + v in d:\r\n p = [i, i + v]\r\n if i + v + v in d:\r\n print(3)\r\n print(*[i, i + v, i + v + v])\r\n return \r\n v *= 2\r\n print(len(p))\r\n print(*p)\r\nn = int(input())\r\ns = list(map(int, input().split()))\r\nca(n, s)", "import sys\r\nfrom collections import Counter\r\n# from itertools import accumulate\r\n# from bisect import bisect_left, bisect_right\r\n# from collections import deque, Counter, defaultdict\r\n# from heapq import heappush, heappop, heapify\r\n# from math import ceil, floor, gcd, comb, prod, lcm,inf\r\n# from string import ascii_lowercase as chars\r\n# from functools import reduce, cmp_to_key\r\n# from copy import deepcopy\r\n\r\n\r\ndef input():\r\n return sys.stdin.readline().rstrip()\r\n\r\n\r\ndef read_ints():\r\n return map(int, input().split())\r\n\r\n\r\ndef _read_ints():\r\n return map(lambda x: int(x)-1, input().split())\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n a = sorted(set(read_ints()))\r\n seen = set()\r\n res = 1\r\n key = a[0], 0\r\n for x in a:\r\n for i in range(32):\r\n if x - (1 << i) in seen:\r\n if x - (1 << (i+1)) in seen:\r\n print(3)\r\n print(x, x - (1 << i), x - (1 << (i+1)))\r\n return\r\n else:\r\n res = 2\r\n key = x, i\r\n seen.add(x)\r\n if res == 1:\r\n print(res)\r\n print(a[0])\r\n else:\r\n x, i = key\r\n print(res)\r\n print(x, x - (1 << i))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n # t = int(input())\r\n t = 1\r\n for _ in range(t):\r\n main()\r\n", "import sys\ninput = lambda: sys.stdin.readline().rstrip()\nfrom collections import deque,defaultdict,Counter\nfrom itertools import permutations,combinations\nfrom bisect import *\nfrom heapq import *\nfrom math import ceil,gcd,lcm,floor,comb,prod\nalph = 'abcdefghijklmnopqrstuvwxyz'\n#pow(x,mod-2,mod)\n\nN = int(input())\nA = list(map(int,input().split()))\nC = Counter(A)\nans = -float('inf')\nxi,xj = -1,-1\nfor i in range(N):\n for j in range(33):\n num = C[A[i]]+C[A[i]+2**j]+C[A[i]+2**(j+1)]\n if num>ans:\n ans = num\n xi,xj = i,j\nl = []\n\nfor _ in range(C[A[xi]]):l.append(A[xi])\nfor _ in range(C[A[xi]+2**xj]):l.append(A[xi]+2**xj)\nfor _ in range(C[A[xi]+2**(xj+1)]):l.append(A[xi]+2**(xj+1))\nprint(len(l))\nprint(*l)\n\n" ]

[ "def c(a):\r\n if str(a).find(\"8\")==-1:\r\n return False \r\n else:\r\n return True\r\n\r\na=int(input())\r\nk=0\r\nwhile True:\r\n a+=1; k+=1\r\n if c(a):break\r\n\r\nprint(k)\r\n", "n=int(input())+1\r\ns=1\r\nwhile '8' not in str(n):\r\n n+=1\r\n s+=1\r\nprint(s)", "n = int(input())\r\nfor i in range(n + 1, n + 20):\r\n if str(i).count('8') > 0:\r\n print(i - n)\r\n break\r\n", "n=int(input())\r\ni=n+1\r\nwhile True:\r\n d=str(i)\r\n if d.count('8')>=1:\r\n print(i-n)\r\n break\r\n else:\r\n i+=1\r\n", "def p(x):\r\n if '8' in x:\r\n return True\r\n\r\nn=str(input())\r\n\r\nfor i in range(1,17):\r\n if(p(str(int(n)+i))==True):\r\n print(i)\r\n break\r\n", "a = str(int(input())+1)\r\ni = 1\r\nwhile \"8\" not in a:\r\n a = str(int(a)+1)\r\n i += 1\r\nprint(i)\r\n", "def Digits(Num):\r\n Str = \"\"\r\n Count = 0\r\n if(Num < 0):\r\n Num = abs(Num)\r\n while(Num > 0):\r\n Str = Str + str(Num % 10)\r\n Num = Num // 10\r\n return Str\r\n\r\n\r\nNum = int(input())\r\nStr = Digits(Num)\r\nFlag = 0\r\n#print(Str)\r\nwhile('8' not in Str or Flag == 0):\r\n Flag += 1\r\n Num = Num + 1\r\n Str = Digits(Num)\r\n #print(Num)\r\n\r\nprint(Flag)", "a = int(input())\r\na += 1\r\nk = 1\r\nwhile \"8\" not in str(a):\r\n k += 1\r\n a += 1\r\nprint(k)\r\n", "\r\nn=int(input())\r\ncount=0\r\nif('8' in str(n)):\r\n\tn=n+1\r\n\tcount=count+1\r\n\twhile( '8'not in str(n)):\r\n\t\tcount=count+1\r\n\t\tn=n+1\r\nelse:\r\n\twhile( '8'not in str(n)):\r\n\t\tcount=count+1\r\n\t\tn=n+1\r\nprint(count)\r\n\t", "from sys import stdin\nn = int(stdin.read().split()[0])\nb = 1\nwhile '8' not in str(n + b):\n\tb += 1\nprint(b)", "a = int(input())\n\na += 1\ncounter = 1\nwhile \"8\" not in str(a):\n a += 1\n counter += 1\nprint(counter)\n", "a, b = int(input()), 1\r\nwhile str(a+b).find('8') == -1:\r\n b += 1\r\nprint(b)", "n=int(input())\r\nans=0\r\nn+=1\r\ns=str(n)\r\nwhile(\"8\" not in s):\r\n n+=1\r\n s=str(n)\r\n ans+=1\r\nprint(ans+1)", "\ndef is_lucky(n):\n s = str(n)\n for i in range(len(s)):\n if s[i] == '8':\n return True\n return False\n\na = int(input())\nstep = 0\nwhile a < 8888888888:\n if step is not 0 and is_lucky(a):\n break\n a += 1\n step += 1\n\nprint(step)\n", "\ncurrent_floor = int(input())\n\nnext_floor = current_floor + 1\n\nwhile \"8\" not in str(next_floor):\n \n next_floor+=1\n\nprint(next_floor - current_floor)\n \t\t \t\t\t \t \t \t \t\t \t\t \t \t", "def hasEight(x):\r\n s = str(x)\r\n if '8' in s:\r\n return(True)\r\n else:\r\n return(False)\r\na = int(input())\r\namount=0\r\nwhile (True):\r\n a+=1\r\n amount+=1\r\n if (hasEight(a)):\r\n print(amount)\r\n break", "n=int(input())\r\nc=0\r\nwhile True:\r\n n+=1\r\n c+=1\r\n if '8' in str(n):print(c);break\r\n", "piso = input()\r\npasos = 1\r\npiso = str(int(piso) + 1)\r\nwhile \"8\" not in piso :\r\n piso = str(int(piso) + 1)\r\n pasos +=1 \r\nprint(pasos)\r\n", "def ada(s):\r\n for c in s:\r\n if c == '8':\r\n return True\r\n return False\r\n\r\ndef solve(a):\r\n ret = 0 \r\n while True:\r\n a += 1\r\n ret += 1\r\n if ada(str(a)):\r\n return ret\r\n return -1\r\n\r\nprint (solve(int(input())))", "a = input()\r\nb = int(a)\r\nok = False\r\nwhile(ok == False):\r\n a = str(int(a) + 1)\r\n \r\n for j in range(len(a)):\r\n if(a[j] == '8'):\r\n ok = True\r\n break\r\nprint(int(a) - b) \r\n ", "x=int(input())\r\nk=0\r\nfor i in range(x+1,8888888888):\r\n if \"8\" in str(i):\r\n k+=1\r\n q=i-x\r\n print(q)\r\n break\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\nx = int(input())\r\ni = 1\r\nwhile(x < 8888888888):\r\n\tif \"8\" in str(x+i):\r\n\t\tprint(i)\r\n\t\tbreak\r\n\ti += 1", "a = int(input())\nans = 1\na += 1\nwhile '8' not in str(a):\n ans += 1\n a += 1\nprint(ans)", "n= input()\r\nx=''\r\nbreak_out_flag=1\r\ncount=0\r\nfor j in range(20):\r\n x=f'{int(n)+1+j}'\r\n count+=1\r\n if int(x)>=0:\r\n for i in x:\r\n if (int(i)%8==0) and (int(i)!=0):\r\n print(count)\r\n break_out_flag = 0\r\n break\r\n else:\r\n for i in range(1,len(x)):\r\n if (int(x[i])%8==0) and (int(x[i])!=0):\r\n print(count)\r\n break_out_flag = 0\r\n break\r\n if break_out_flag==0:\r\n break", "a = int(input())\r\na += 1\r\nk = 1\r\nw = True\r\nwhile w:\r\n q = str(a)\r\n for i in range(len(q)):\r\n if q [i] == '8':\r\n w = False\r\n if w:\r\n a += 1\r\n k += 1\r\nprint(k)\r\n", "a = int(input())\nres = 1\na += 1\nwhile '8' not in str(a):\n\tres += 1\n\ta += 1\nprint(res)", "n=input()\r\ncount=0\r\nflag=0\r\nif(\"8\" in n):\r\n n=int(n)+1\r\n n=str(n)\r\n flag=1\r\nwhile(\"8\" not in n):\r\n count=count+1\r\n n=int(n)+1\r\n n=str(n)\r\nif(flag==1):\r\n print(count+1)\r\nelse: \r\n print(count) ", "x = 0\r\nfor i in range(int(input()) + 1, 8888888888):\r\n\tif '8' in str(i):\r\n\t\tprint(x + 1)\r\n\t\tbreak\r\n\tx += 1", "\r\na=int(input())\r\nb=a+1\r\nwhile '8' not in str(b):b+=1\r\nprint(b-a)", "n=int(input())\r\nq=n\r\nwhile True:\r\n\tn+=1\r\n\tif '8' in str(n):\r\n\t\tbreak\r\nprint(n-q)", "def f(x):\r\n x = str(x)\r\n if \"8\" in x: return 1\r\n else: return 0\r\nk = int(input())\r\nn = k\r\nwhile not f(n+1):\r\n n += 1\r\nprint(n-k+1)", "def f(a):\n\tflag = False\n\tfor i in str(a):\n\t\tif (i == \"8\"):\n\t\t\tflag = True\n\treturn flag\n\n\na = int(input())\n# a = 18\nd = 1\nwhile not f(a + d): #and not f(a - d):\n\td += 1\nprint(d)\n", "x=int(input())\r\na,count=x,0\r\nwhile True:\r\n a=a+1\r\n a=str(a)\r\n List=list(a)\r\n count=count+1\r\n if List.count('8')!=0:\r\n print(count)\r\n exit()\r\n a=int(a)\r\n", "n = int(input())\r\na = n + 1\r\n\r\nwhile str(a).find(\"8\") == -1:\r\n a = a + 1\r\nprint(a - n)\r\n\r\n ", "n=int(input())\r\ni=1\r\nn+=1\r\nt=1\r\nwhile(t):\r\n m=str(n)\r\n c=m.find('8')\r\n if(c==-1):\r\n i+=1\r\n n+=1\r\n else:\r\n t=0\r\nprint(i) \r\n", "Answer, N = 0, int(input())\r\nwhile True:\r\n N, Answer = N + 1, Answer + 1\r\n if '8' in str(N):\r\n print(Answer)\r\n exit()\r\n\r\n# UB_CodeForces\r\n# Advice: I am strong because I've been weak. I am fearless because I've been afraid. I am wise because I've been foolish\r\n# Location: Behind my desk at my own room\r\n# Caption: No calls from Ms. Keshtegar. Isn't a little weird???\r\n# CodeNumber: 510\r\n", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\nimport time\n\na = input()\n\nstart = time.time()\n\nans = 1\na = str(int(a)+1)\n\nwhile '8' not in a:\n a = str(int(a)+1)\n ans += 1\n\nprint(ans)\n\nfinish = time.time()\n#print(finish - start)\n", "n = int(input())\r\nres = 0\r\ncount = 0\r\nwhile('8' not in str(res)):\r\n\tn += 1\r\n\tres = n\r\n\tcount += 1\r\nprint(count)", "s=int(input())+1\r\nc=1\r\nwhile(str(s).count('8')<1):\r\n s=s+1\r\n c=c+1\r\nprint(c)\r\n", "a = int(input())\nfor i in range(1,20):\n c = a + i\n stri = str(c)\n if stri.find(\"8\") != -1:\n print(i) \n break\n \t\t \t\t \t \t\t\t\t\t \t \t \t \t\t \t", "\r\na = int(input())\r\n\r\nans = 0\r\n\r\nfor b in range(1, 20):\r\n if str(a + b).__contains__('8'):\r\n ans = b\r\n break\r\n\r\nprint(ans)", "def solve(n):\n\t\n\t\n\tif len(str(abs(n)))==1:\n\t\tif n <-8 :\n\t\t\tnxt_lucky = -8\n\t\telif n < 8 : \n\t\t\tnxt_lucky = 8\n\t\telse :\n\t\t\tnxt_lucky = 18\n\telse:\n\t\tnxt_lucky = int(str(int(str(n)[0:-1])+1) + '8' )\n\n\tfor i in range(n+1,nxt_lucky+1):\n\t\tif '8' in str(i) :\n\t\t\treturn i-n\n\n\t\t\n\n\t\n\t\n\n\t\t\n\n\t\n\n\nl3 = int(input())\n\n\n\nprint(solve(l3))\n", "n = int(input())\r\nstep = 0\r\nwhile True:\r\n step += 1\r\n n += 1\r\n if '8' in str(n):\r\n print(step)\r\n break\r\n", "n=int(input())\r\nx=n\r\nwhile(True):\r\n\tx+=1\r\n\tif(str(x).count(\"8\")!=0):\r\n\t\tbreak\r\nprint(x-n)", "# coding=utf-8\r\n\r\nif __name__ == '__main__':\r\n\tn = int(input())\r\n\tv = 1\r\n\twhile True:\r\n\t\tif '8' in str(n + v):\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\tv += 1\r\n\tprint(v)\r\n", "import sys\r\n\r\nx = int(input())\r\n\r\nfor i in range(1,17):\r\n buffer = x+i\r\n array = list(str(buffer))\r\n if '8' in array:\r\n print(i)\r\n sys.exit()\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\ni=0\r\nfor i in range(16):\r\n \r\n n = n+1\r\n i = i +1\r\n if '8' in str(n):\r\n break\r\nprint(i)", "n=int(input())\r\nfor i in range(17):\r\n n+=1\r\n if('8' in str(n)):\r\n print(i+1)\r\n break\r\n", "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\ta = int(input())\r\n\ta += 1\r\n\tans = 1\r\n\twhile '8' not in str(a):\r\n\t\ta += 1\r\n\t\tans += 1\r\n\tprint(ans)\r\n\r\nsolve()", "n = int(input())\r\nk = n + 1\r\nwhile '8' not in str(k):\r\n\tk += 1\r\nprint(k - n)", "n=int(input())\r\nr=1\r\nwhile '8' not in str(n+r):r+=1\r\nprint(r)", "n = input()\r\ncnt = 0\r\nwhile n.count(\"8\")==0 or cnt==0:\r\n\tcnt+=1\r\n\tn = str(int(n)+1)\r\n\r\nprint(cnt)", "n = int(input())\r\ncnt = 1\r\nfor i in range(n + 1, 8888888889):\r\n s = str(i)\r\n if \"8\" in s:\r\n print(cnt)\r\n break\r\n else:\r\n cnt += 1", "a=int(input())\r\nb=a\r\nwhile True:\r\n b+=1\r\n if '8' in str(b):\r\n print(b-a)\r\n break", "n = int(input())\r\nres = 0\r\ntemp = n\r\nwhile(True):\r\n if '8' in str(temp) and temp != n:\r\n print(res)\r\n break\r\n res += 1\r\n temp += 1\r\n", "\r\nn = 1\r\ns = int(input()) + n\r\n\r\nwhile '8' not in str(s):\r\n\r\n n +=1\r\n s +=1\r\n\r\n\r\nprint(n)\r\n\r\n\r\n", "a=int(input())\r\n\r\ndef isLucky(n):\r\n s=str(n)\r\n flag=0\r\n for i in range(0,len(s)):\r\n if (s[i]=='8'):\r\n flag=1\r\n if flag==1:\r\n return 'yes'\r\n else:\r\n return 'no'\r\n\r\nf=[]\r\nfor i in range(1,17,1):\r\n b=a+i\r\n if isLucky(b)=='yes':\r\n f.append(i)\r\n \r\n\r\nprint(min(f))\r\n", "n = int(input())\r\ncnt = 0\r\nif '8' in str(n):cnt+=1;n+=1\r\nwhile '8'not in str(n):n+=1;cnt+=1\r\nprint(cnt)", "from math import *\r\n\r\na=int(input())\r\n\r\nif(a<=-3 and a>=-8):\r\n print(8-a)\r\nelse: \r\n for i in range(1,11):\r\n a+=1\r\n s=str(a)\r\n if(a<0):\r\n s=s[1:]\r\n \r\n lst=[int(j) for j in s]\r\n \r\n if(8 in lst):\r\n print(i)\r\n break", "x = input()\r\nc = 0\r\nwhile True:\r\n x = str(int(x)+1)\r\n c+=1\r\n y = x.count('8')\r\n if y>0:\r\n break\r\nprint(c)\r\n", "n=int(input())\r\nc=1\r\nfor i in range(n+1,8888888888):\r\n if '8' in str(abs(i)):\r\n s=c\r\n break\r\n else:\r\n c+=1\r\nprint(s)\r\n", "n=int(input())\r\nfloor=0\r\nwhile floor<30:\r\n n+=1\r\n floor+=1\r\n if str(n).find('8')>=0:\r\n print(floor)\r\n break\r\n\r\n", "\"\"\"\r\n Giga Tower\r\n\"\"\"\r\na = int(input()) + 1\r\nsteps = 1\r\nwhile (str(a).find('8') == -1):\r\n a += 1\r\n steps += 1\r\nprint(steps)\r\n\r\n", "a=input()\r\nr=10**10\r\nb=0\r\nl=int(a)\r\nwhile '8' not in a or ('8' in a and b==0):\r\n l+=1\r\n a=str(l)\r\n b+=1\r\nprint(min(b,r))\r\n \r\n\r\n ", "# LUOGU_RID: 128845382\nn=int(input())+1\ns=1\nwhile '8' not in str(n):\n n+=1\n s+=1\nprint(s)", "n=int(input())\r\nans=0\r\nif '8' in str(n): ans+=1; n+=1\r\nwhile not '8' in str(n):\r\n n+=1\r\n ans+=1\r\nprint(ans)", "n = int(input())\r\nans = 0\r\nwhile 1:\r\n ans += 1\r\n n += 1\r\n if '8' in str(n):\r\n print(ans)\r\n break\r\n", "def lucky(b):\r\n if b<0:\r\n b=-b\r\n while b>0:\r\n if b%10==8:\r\n return True\r\n b//=10\r\n return False\r\n\r\na = int(input())\r\nb = a+1\r\nwhile not lucky(b):\r\n b +=1\r\nprint(b-a)", "from sys import stdin, stdout\r\n\r\ns= stdin.readline()\r\ni=1\r\ns = int(s)\r\nwhile('8' not in str(s+i)):\r\n i+=1 \r\nstdout.write(str(i))\r\n\r\n ", "n=int(input())\r\nj=0\r\nk=0\r\nwhile k==0 :\r\n if str(n).count('8') >0 and j>0 :\r\n k=1\r\n else :\r\n j+=1\r\n n+=1\r\n \r\nprint(j)", "a=int(input())+1\r\nb=1\r\nwhile'8'not in str(a):\r\n a+=1\r\n b+=1\r\nprint(b)", "a = int(input()) + 1\r\nr = 1\r\nwhile \"8\" not in str(a):\r\n a += 1\r\n r += 1\r\nprint(r)", "x = int(input())\ncount = 0\nwhile \"8\" not in str(x) or count == 0:\n\n x += 1\n count += 1\n\nprint(count)\n", "n = int(input())\r\np=n+1\r\nflag = False\r\nwhile flag!=True:\r\n p=str(p)\r\n d={}\r\n for char in p:\r\n if char=='8':\r\n d['8']=d.get('8',0)+1\r\n if d.get('8',0) != 0 and flag == False:\r\n num = int(p)\r\n flag=True\r\n else:\r\n p=int(p)\r\n p+=1\r\nprint(int(p)-int(n))\r\n \r\n \r\n \r\n ", "n=int(input())\r\nstep=0\r\n\r\nwhile ('8' not in str(n) or (step==0 and '8' in str(n))):\r\n n+=1\r\n step+=1\r\n\r\nprint(step)\r\n", "n = int(input())\ncurrent = n + 1\nwhile \"8\" not in str(current): current += 1\nprint(current - n)\n\t \t \t\t\t\t \t \t\t \t \t \t\t\t \t\t", "a=int(input())\r\nf=a\r\ncount=1\r\nsum=1\r\nwhile \"8\" not in str(a+1):\r\n count+=1\r\n a+=1\r\nprint(count)", "n = int(input())\r\n\r\nans = 1\r\n\r\nwhile True:\r\n n += 1\r\n if '8' in str(n): break\r\n ans += 1\r\n \r\nprint(ans)", "n=int(input())\r\nt=1\r\nwhile str(n+t).count('8') == 0 :\r\n\tt+=1\r\nprint(t)\r\n", "a=int(input())\r\ni=0\r\nwhile(1):\r\n a+=1\r\n i+=1\r\n b=str(a)\r\n if(b.count('8')>0):\r\n print(i)\r\n break", "# https://codeforces.com/problemset/problem/488/A\r\n\r\nimport sys\r\nimport math\r\n\r\n\r\ndef main():\r\n # sys.stdin = open('E:\\\\Sublime\\\\in.txt', 'r')\r\n # sys.stdout = open('E:\\\\Sublime\\\\out.txt', 'w')\r\n # sys.stderr = open('E:\\\\Sublime\\\\err.txt', 'w')\r\n\r\n n = int(sys.stdin.readline().strip())\r\n # a, b = map(int, sys.stdin.readline().strip().split()[:2])\r\n i = n + 1\r\n\r\n while True:\r\n if '8' in str(i):\r\n print(i - n)\r\n break\r\n i += 1\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n\r\n# hajj\r\n# 　　　　　　 ＿＿\r\n# 　　　　　／＞　　フ\r\n# 　　　　　| 　_　 _ l\r\n# 　 　　　／` ミ＿xノ\r\n# 　　 　 /　　　 　 |\r\n# 　　　 /　 ヽ　　 ﾉ\r\n# 　 　 │　　|　|　|\r\n# 　／￣|　　 |　|　|\r\n# 　| (￣ヽ＿_ヽ_)__)\r\n# 　＼二つ\r\n", "n =int(input())\r\ncounter =0 \r\nwhile True: \r\n n +=1 \r\n counter+=1\r\n if \"8\" in str(n) : \r\n print(counter)\r\n break\r\n", "import math\r\nfor _ in range(1):\r\n s=input()\r\n i=0\r\n while (i<100):\r\n s=int(s)\r\n s=s+1\r\n if \"8\" in str(s):\r\n print(i+1)\r\n break\r\n i=i+1\r\n \r\n \r\n \r\n ", "\r\nk=int(input())\r\nb=0\r\nwhile(k<=8888888888):\r\n if(str(k).count(str(8))>=1 and b!=0):\r\n break\r\n k=k+1\r\n b+=1\r\nprint(b)\r\n", "a=int(input())\r\na+=1\r\nx=1\r\nwhile str(a).count('8')==0:\r\n a+=1\r\n x+=1\r\nprint(x)", "n = int(input())\r\nfor i in range(1,1000):\r\n\tif '8' in str(n+i):\r\n\t\tprint(i)\r\n\t\tbreak", "s = int(input())\r\ncounter = 0\r\nfor i in range(s+1, s+21):\r\n tmp = str(i)\r\n counter += 1\r\n if '8' in tmp:\r\n break \r\nprint(counter)", "n = int(input().strip())\nc = 1\nn += 1\nwhile True:\n\tif '8' in str(n):\n\t\tprint(c)\n\t\tbreak\n\tn += 1\n\tc += 1\n", "a = int(input())\r\nfloors = 1\r\n\r\nwhile True :\r\n final = a + floors\r\n \r\n if str(final).count('8') :\r\n break\r\n floors += 1\r\n\r\nprint(floors)", "a=int(input())\r\na+=1\r\nb=1\r\nwhile(str(a).count('8')==0):\r\n a+=1\r\n b+=1\r\nprint(b)", "def f(x):\r\n if (x.count(\"8\")):\r\n return True\r\n return False\r\n\r\na = int(input());\r\n\r\nc = 1;\r\na += 1;\r\n\r\na = str(a)\r\n\r\nwhile not f(a):\r\n a = str(int(a) + 1);\r\n c += 1;\r\n \r\nprint(c)", "a = int(input())\r\nfor i in range(1, 101):\r\n if (str(a + i).count('8')):\r\n print(i)\r\n break", "\"\"\"\r\nhttps://codeforces.com/problemset/problem/488/A\r\n\"\"\"\r\n\r\ndef test(a):\r\n for c in str(a):\r\n if c == \"8\":\r\n return True\r\n \r\n return False\r\n\r\na = int(input())\r\n\r\nb = 0\r\n\r\nwhile True:\r\n a += 1\r\n b += 1\r\n if test(a):\r\n break\r\n\r\nprint(b)", "n=int(input())\r\n\r\ndef luck(x):\r\n x=str(x)\r\n for i in x:\r\n if i=='8':\r\n return True\r\n return False\r\n\r\nfor i in range(1,20):\r\n if luck(n+i):\r\n print(i)\r\n break\r\n \r\n", "n=int(input())\r\nb=0\r\ns=\"\"\r\nwhile(\"8\" not in s):\r\n n=n+1\r\n b=b+1\r\n s=str(n)\r\nprint(b)", "def check(n):\r\n n = abs(n)\r\n while n > 0:\r\n if n % 10 == 8:\r\n return True\r\n n = int(n / 10)\r\n return False\r\nn = int(input()) + 1\r\ncount = 1\r\nwhile check(n) == False:\r\n n += 1\r\n count += 1\r\nprint(count)\r\n", "n=int(input(\"\"))\r\nx=n\r\nc=\"8\"\r\ns=0\r\nwhile(s==0):\r\n final=[each for each in c if each in str(n)]\r\n if(len(final)>0 and (n-x)>0):\r\n s=1\r\n n=n+1\r\n \r\nprint(n-x-1)", "def is_lucky(number):\r\n return '8' in str(abs(number))\r\n\r\ndef find_minimum_lucky_floor(a):\r\n b = 1\r\n while not is_lucky(a + b):\r\n b += 1\r\n return b\r\n\r\n\r\na = int(input())\r\nprint(find_minimum_lucky_floor(a))\r\n", "a = int(input())\r\nb = 0\r\nflag = False\r\nwhile True:\r\n a += 1\r\n b += 1\r\n for i in range(len(str(a))):\r\n if str(a)[i] == '8':\r\n flag = True\r\n if flag: break\r\nprint(b)", "\r\ndef chk8(p):\r\n if(p<0):p*=(-1)\r\n while(p>=1):\r\n if(p%10==8):\r\n return True\r\n p/=10\r\n p=int(p)\r\n return False\r\n \r\n\r\n#str=open(\"a.txt\",\"r\")\r\nn=int(input())\r\nfor i in range(1,20,1):\r\n if(chk8(i+n)):\r\n print(\"%d\\n\"%i)\r\n break\r\n \r\n \r\n", "n = int(input()) + 1\r\nc = 1\r\nwhile '8' not in str(n):\r\n n += 1\r\n c += 1\r\n\r\nprint(c)\r\n", "a = int(input())\r\nb = 0\r\nx = True\r\nwhile x:\r\n a += 1\r\n b += 1\r\n for i in str(a):\r\n if i == \"8\":\r\n x = False\r\n\r\nprint(b)", "a = int(input())\nfor i in range(a+1, a+47):\n if ('8' in str(i)):\n print(i-a)\n break\n\n", "from sys import stdin \ndef ocho(numero):\n prueba = str(numero)\n return prueba.find('8')\n\nn = int(stdin.readline())\ncontador = 0\nflag = True\nwhile flag:\n contador += 1\n n += 1\n if ocho(n) >= 0:\n flag = False\nprint(contador)\n \n\n", "def lucky(n):\r\n while n > 0:\r\n if n % 10 == 8:\r\n return True\r\n n //= 10\r\n return False\r\na, b = int(input()), 1\r\nwhile not lucky(abs(a + b)):\r\n b += 1\r\nprint(b)", "A = int(input())\n\n\nfloor = 1\nwhile True:\n if str(A + floor).count('8') > 0:\n break\n floor += 1\n\nprint(floor)\n", "a = int(input())\r\ncount = 1\r\nfor i in range(a+1 , a + 20):\r\n if '8' not in str(i):\r\n count += 1\r\n else:\r\n break\r\nprint(count)\r\n", "a = int(input())\r\n\r\nfor b in range(1, 17):\r\n if '8' in str(a + b):\r\n print(b)\r\n break", "a = int(input())\r\nb = a\r\na += 1\r\nwhile '8' not in str(a):\r\n a += 1\r\nprint(a-b)\r\n", "y = int(input())\r\ni = 1\r\nwhile True:\r\n x = y\r\n x += i\r\n if '8' in list(str(x)):\r\n break\r\n i += 1\r\nprint(i)", "n = int(input())\r\ns = 1\r\nwhile not '8' in str(n+s):\r\n s += 1\r\nprint(s)", "'''\nCreated on 21-Nov-2014\n\n@author: akash\n'''\nnum = int(input())\nj = 1\nfor i in range(1, 20):\n res = str(num + i)\n if res.find(\"8\") != -1:\n j = i\n break\nprint(j)\n", "# You lost the game.\nc = int(input())\na = c\nwhile 1:\n a += 1\n s = str(a)\n if s.count(\"8\"):\n print(a-c)\n break \n", "a = int(input())\r\nc = 1\r\na+=1\r\nwhile(True):\r\n if '8' not in str(a):\r\n a+=1\r\n c+=1\r\n else:\r\n break\r\nprint(c)\r\n", "a = int(input())\r\nup = a+1\r\ndown = a\r\nwhile('8' not in str(up)):\r\n up+=1\r\nprint(up-a)", "n=int(input())\r\nb=1\r\nn=n+1\r\nwhile '8' not in str(n):\r\n n=n+1\r\n b=b+1\r\n\r\nprint(b) \r\n", "a = int(input())\r\n\r\nb = 0\r\nwhile '8' not in str(a) or b == 0:\r\n a += 1\r\n b += 1\r\n\r\nprint(b)", "a=int(input())\r\nk=0\r\nt=1\r\nwhile True:\r\n if not \"8\" in str(a) or (\"8\" in str(a) and t==1):\r\n k+=1\r\n a+=1\r\n t=0\r\n else:\r\n print(k)\r\n break", "# http://codeforces.com/problemset/problem/488/A\r\nn=int(input())\r\nm=n\r\nwhile True:\r\n n+=1\r\n if '8' in str(n):\r\n print(n-m)\r\n break\r\n \r\n \r\n", "n = int(input())\nans = 1\n\nwhile True:\n\tif '8' in str(n + ans):\n\t\tprint(ans)\n\t\tbreak\n\tans += 1", "s=input()\r\nflag=1\r\np=0\r\nwhile flag==1:\r\n s=str(int(s)+1)\r\n p=p+1\r\n for i in range(len(s)):\r\n if s[i]=='8':\r\n flag=0\r\n print(p)\r\n break", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nc = 0\r\nwhile True:\r\n n += 1\r\n c += 1\r\n if '8' in str(n):\r\n break\r\nprint(c)", "def if8(b):\r\n if b<0:\r\n b=-b\r\n while b>0:\r\n if b%10 ==8:\r\n return True\r\n b=b//10\r\n return False\r\n\r\n\r\na = int(input())\r\nb=a+1\r\nwhile not if8(b):\r\n b +=1\r\n\r\nprint(b-a)\r\n", "x=int(input())\r\nj=0\r\nwhile(1):\r\n j+=1\r\n x+=1\r\n if(\"8\" in str(x)):\r\n break\r\nprint(j) ", "n = int(input())\r\n\r\nx = 1\r\nn+=1\r\nwhile (str(n).count('8') < 1):\r\n n+=1\r\n x+=1\r\n \r\nprint(x)", "def lucky(b):\n if b<0:\n b=-b\n while b>0:\n if b%10==8:\n return True\n b=b//10\n return False\n\na=int(input())\nb=a+1\nwhile not lucky(b):\n b+=1\nprint(b-a)\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Apr 13 16:32:06 2020\r\n\r\n@author: alexi\r\n\"\"\"\r\n\r\n\r\n\r\n#https://codeforces.com/problemset/problem/488/A --- Alexis Galvan\r\n\r\n\r\ndef giga_tower():\r\n \r\n floor = int(input())\r\n \r\n output = 0\r\n while True:\r\n output += 1\r\n floor += 1\r\n temp = str(floor)\r\n for i in temp:\r\n if i == '8':\r\n return output\r\n \r\n\r\nA = giga_tower()\r\nprint(A)\r\n \r\n \r\n ", "a=int (input())\r\nb=a+1;\r\nwhile str(b).find('8')==-1:\r\n b=b+1\r\nprint(b-a) ", "n = int(input())+1\nnword = str(n)\ncount = 1\n\nwhile(\"8\" not in nword):\n\tn+=1\n\tnword = str(n)\n\tcount += 1\n\nprint(count)\n \t \t \t \t\t \t \t \t \t \t \t", "'''input\n-1\n'''\na = int(input())\nt = 0\nif \"8\" in str(a):\n\ta += 1\n\tt += 1\nwhile \"8\" not in str(a):\n\ta += 1\n\tt += 1\nprint(t)", "n = int(input())\r\nfor i in range(n+1,n+100):\r\n if '8' in str(i):\r\n print(i-n)\r\n break\r\n", "v = 1\r\ns = int(input())\r\n\r\nwhile True:\r\n\ts = s + 1\r\n\tif str(s).find('8') > -1:\r\n\t\tbreak\r\n\tv = v + 1\r\n\r\nprint(str(v))", "a = int(input())\r\nfor i in range(100):\r\n a += 1\r\n if str(a).find('8') != -1:\r\n print(i+1)\r\n exit(0)", "from sys import stdin \r\ndef ocho(numero):\r\n prueba = str(numero)\r\n return prueba.find('8')\r\n\r\nn = int(stdin.readline())\r\ncontador = 0\r\nflag = True\r\nwhile flag:\r\n contador += 1\r\n n += 1\r\n if ocho(n) >= 0:\r\n flag = False\r\nprint(contador)\r\n \r\n\r\n", "n = int(input())\r\ncount = 1\r\nwhile(True):\r\n n = n + 1\r\n s1 = str(n)\r\n if \"8\" in s1:\r\n break\r\n count += 1\r\nprint(count)", "a = int(input())\r\ncnt=0\r\nwhile(True):\r\n a+=1\r\n a = str(a)\r\n if \"8\" in a:\r\n cnt+=1\r\n break\r\n else:\r\n cnt+=1\r\n a = int(a)\r\nprint(cnt)", "n=int(input())\r\ncount=1\r\nwhile True:\r\n n+=1\r\n if '8' in str(n):\r\n print(count)\r\n break\r\n count+=1", "s1 = int(input())\r\nc = 1\r\n\r\nwhile True:\r\n s = s1 + c \r\n s = str(s)\r\n if('8' in s):\r\n break \r\n else:\r\n c += 1 \r\n\r\nprint(c)", "\r\nn = int(input())\r\n\r\ny = 0\r\nif -8<= n <-2:\r\n y = 17\r\nelse:\r\n y = 11\r\n\r\nfor i in range(1, y):\r\n x = n + i\r\n if '8' in str(x):\r\n print(i)\r\n break\r\n", "import math\nn = int(input())+1\na = n-1\nwhile \"8\" not in str(n):\n n += 1\nprint(n-a)\n", "a = int(input())\nb = a+1\nwhile str(b).find('8') == -1: b+=1\nprint(b-a)\n", "def isLuck(a):\r\n if str(a).count('8')>0:\r\n return True\r\n else:\r\n return False\r\na=int(input())\r\nfor i in range(1,100):\r\n if isLuck(a+i):\r\n print(i)\r\n exit()\r\n", "n = int(input())+1\r\ni = 1\r\nwhile not('8' in str(n)):\r\n n += 1\r\n i += 1\r\nprint(i)", "x=int(input())\r\nfor j in range(1, 20):\r\n if \"8\" in str(x+j):\r\n print(j)\r\n break", "\r\nn = int(input())\r\nans = 0\r\nwhile 1:\r\n\tn+=1\r\n\tans+=1\r\n\tif str(n).count('8') > 0:\r\n\t\tbreak\r\nprint(ans)\r\n", "def gigatower():\r\n floor= int(input())\r\n y= 1\r\n while True:\r\n for j in str(floor+y):\r\n if j== \"8\":\r\n print(y)\r\n return\r\n y+= 1\r\n\r\ngigatower()", "s = str(input())\r\ni = int(s)\r\nc = 1\r\ndef check(s):\r\n for i in s:\r\n if i == '8':\r\n return True\r\n return False\r\n\r\nfor j in range(i+1,8888888889):\r\n if(check(str(j))):\r\n print(c)\r\n exit()\r\n else:\r\n c+=1 \r\n\r\n\r\n\r\n\r\n\r\n\r\n ", "a1 = int(input())\r\na1+=1\r\na = str(a1)\r\nb = 1\r\nwhile a.find(\"8\") == -1:\r\n a1+=1\r\n a = str(a1)\r\n b+=1\r\nprint(b)\r\n", "v=int(input())\r\nc=1\r\nv+=1\r\nwhile ('8' not in str(v)):\r\n v+=1\r\n c+=1\r\nprint(c)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun May 26 17:46:40 2019\r\n\r\n@author: avina\r\n\"\"\"\r\n\r\ns = input()\r\ne = 0\r\nif '8' in s:\r\n s = str(int(s)+1)\r\n e = 1\r\n\r\nwhile True:\r\n if '8' in s:\r\n break\r\n s = str(int(s)+1)\r\n e+=1\r\nprint(e)", "n = int(input())\nn1 = str(n)\ncount = 0\n\nif n1.count(\"8\") == 0:\n while n1.count(\"8\") == 0:\n n += 1\n count += 1\n n1 = str(n)\n print(count)\n exit()\nif n1.count(\"8\") != 0 and str(n+1).count(\"8\") != 0:\n print(1)\n exit()\nif n1.count(\"8\") != 0 and str(n+1).count(\"8\") == 0:\n n += 1\n n1 = str(n)\n count = 1\n while str(n).count(\"8\") == 0:\n count += 1\n n += 1\n print(count)\n exit()\n", "n = int(input())\r\nc = 0\r\nfor i in range(17):\r\n n+=1\r\n c+=1\r\n if '8' in str(n):\r\n print(c)\r\n break\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n# if \"8\" in str(n+1):\r\n# print(1,n+1)\r\n# else:\r\n# if n == 0:\r\n# print(8)\r\n# elif n>0:\r\n# if str(n)[-1] == '9':\r\n# if str(n+1)[-2] == '8':\r\n# print(1)\r\n# else:\r\n# print(9)\r\n# elif str(n)[-1] == '8':\r\n# print(10)\r\n# else:\r\n# print(8-int(str(n)[-1]))\r\n# elif n<0:\r\n# for i in range(17):\r\n# n+=1\r\n# c += 1\r\n# if str(n)[-1] == '8':\r\n# print(c)\r\n# break", "n=int(input())\r\ny=0\r\nfor x in range(555555):\r\n y+=1\r\n if \"8\" in list(str(n+y)):\r\n print(y)\r\n break", "def main():\n def is_lucky(a):\n return len(list(filter(lambda i: i == '8', str(a)))) > 0\n a = int(input()) + 1\n b = 1\n while not is_lucky(a):\n a += 1\n b += 1\n return b\nprint(main())\n", "a=int(input())\r\nc=0\r\nfl=0\r\na=a+1\r\nwhile(True):\r\n a=str(a)\r\n c=c+1\r\n if(str.__contains__(a,\"8\")):\r\n break;\r\n a=int(a)\r\n a=a+1\r\nprint(c)", "n = input()\r\nn = str(int(n)+1)\r\ncount = 1\r\nwhile '8' not in n:\r\n count+=1\r\n n = str(int(n)+1)\r\nprint(count)\r\n", "x = int(input()) + 1\r\nc = 1\r\n\r\n\r\ndef has_eight(x):\r\n return '8' in str(x)\r\n\r\nwhile not has_eight(x):\r\n x += 1\r\n c += 1\r\n\r\nprint(c)", "n=int(input())\r\ns=0\r\ni=1\r\nwhile i>0:\r\n n+=1\r\n s+=1\r\n r=str(n)\r\n if \"8\" in r:\r\n print(s)\r\n break\r\n else:\r\n i+=1\r\n", "n = int(input())\r\nb = 1\r\nwhile not '8' in str(n+b):b += 1\r\nprint(b)", "n = int(input())\r\nk = n\r\nwhile True:\r\n if '8' in str(k):\r\n ans = k-n\r\n if ans == 0:\r\n k+=1\r\n continue\r\n print(ans)\r\n break\r\n k+=1", "s = str(int(input()) + 1)\nans = 1\nwhile '8' not in s:\n\tans += 1\n\ts = str(int(s) + 1)\nprint(ans)\n", "a = int(input())\r\nc = 0\r\nwhile 1:\r\n a = a+1\r\n c = c+1\r\n if str(a).find(\"8\") != -1:\r\n break\r\nprint(c)", "#b is small so brute force\r\n#moreover b cant be zero so initially we took it 1\r\n\r\n\r\n\r\n\r\n\r\nn = int(input())\r\ns = 1\r\nwhile not '8' in str(n+s):\r\n s += 1\r\nprint(s)", "a = int(input())\nb = 0\nwhile(True):\n if(str(a).find('8')>-1 and b!=0):\n print(b)\n break\n a += 1\n b += 1\n\t \t\t\t \t\t \t \t\t \t\t \t\t\t\t\t", "a = int(input())\nb = 1\nwhile '8' not in str(a+b):\n b += 1\nprint(b)\n", "n = int(input())\n\ni = 0\ni+=1\nn+=1\nwhile str(n).find('8') == -1:\n\ti+=1\n\tn+=1\n\nprint(i)", "n=int(input())\r\ndef tower(n):\r\n\tcount=1\r\n\tx=str(n)\r\n\twhile \"8\" not in str(n+1):\r\n\t\tn+=1\r\n\t\tcount+=1\r\n\treturn count\r\n\r\n\r\nprint(tower(n))", "def m():\r\n n = eval(input()); b = 1; n+=1\r\n while True:\r\n if \"8\" in str(n): print(b) ; break\r\n else: n+=1; b+=1\r\nm()", "'''\r\n╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬ ▓▓█████▓▓ ╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\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\nfrom math import factorial as fct\r\nfrom collections import Counter as CNT\r\nmod = 10**9 + 7\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\n╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬\r\n'''\r\nn = ii()+1\r\nc = 0\r\nwhile True:\r\n if \"8\" in str(n):\r\n print(c+1)\r\n break\r\n else:\r\n n+=1\r\n c+=1\r\n \r\n \r\n", "# A. Giga Tower\r\nn=int(input())\r\nk=0\r\nwhile n<= 8888888888:\r\n k+=1\r\n n+=1\r\n if \"8\" in str(n):\r\n print(k)\r\n break", "'''input\n-1\n'''\n\ndef nextLucky(n):\n\n\tif \"8\" in str(n):\n\t\tn += 1\n\t\tsteps = 1\n\telse:\n\t\tsteps = 0\n\n\n\t\n\twhile(\"8\" not in str(n)):\n\t\tn += 1\n\t\tsteps += 1\n\n\treturn steps\n\n\nprint(nextLucky(int(input())))\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n", "n=int(input())\r\nk=1;n+=1\r\nwhile not('8' in str(n)):\r\n k+=1;n+=1\r\nprint(k)\r\n ", "now = int(input())\r\ns = 1\r\n\r\nfor i in range(17777777777):\r\n now += 1\r\n f = str(now)\r\n if('8' in f):\r\n break\r\n else:\r\n s += 1\r\n\r\nprint(s)", "a = int(input())\nb = a\nwhile True:\n\tb += 1\n\tif str(b).find('8') >= 0:\n\t\tprint(b-a)\n\t\tbreak\n", "def islucky(c):\r\n for d in str(c):\r\n if d == '8': return True\r\n return False;\r\n\r\na = int(input(''))\r\nb = a+1\r\nwhile(not islucky(b)): b+=1\r\nprint(b-a)\r\n", "n=int(input())\r\nif n==-8:\r\n print(16)\r\nelse:\r\n c=0\r\n while True:\r\n c=c+1\r\n n=n+1\r\n if \"8\" in str(n):\r\n print(c)\r\n break\r\n ", "__author__ = 'Daniil'\r\na = int(input())\r\nfor i in range(a+1, a+100):\r\n if ('8' in str(i)):\r\n print(i-a)\r\n break", "n=int(input())\r\nif \"8\" in str(n):\r\n count=1\r\n n+=1\r\nelse:count=0\r\nwhile \"8\" not in str(n):\r\n n+=1\r\n count+=1\r\nprint(count)", "n=input()\nif '8' in n:\n a=n.count('8')\n A=0\n while ('8' not in n) or A==0:\n n=str(int(n)+1)\n A+=1\n print(A)\n \nelse:\n n=int(n)\n A=0\n while '8' not in str(n):\n n+=1\n A+=1\n print(A)\n", "n=int(input())\r\nc=0\r\nwhile 1:\r\n n=n+1\r\n c=c+1\r\n if '8' in str(n):\r\n print(c)\r\n break", "a = int(input())\r\na += 1\r\nc = 1\r\nwhile not '8' in str(a):\r\n a += 1\r\n c += 1\r\nprint(c)", "def check8(num):\n num = str(num)\n for i in num:\n if i == \"8\":\n return True\n\na = int(input())\nx = a\na = a + 1\nwhile True:\n if check8(a):\n print(a - x)\n break\n a += 1\n", "n = int(input())\ndef ochos(n):\n for i in range(1,100):\n m = n + i\n string = str(m)\n\n if string.find(\"8\") != -1:\n return i\n else:\n continue\n\nprint(ochos(n))\n\n \t\t\t \t \t \t \t \t\t \t\t \t\t", "a = int(input())\r\ncp_a = a + 1\r\n\r\nwhile '8' not in str(cp_a): cp_a += 1\r\n\r\nprint(cp_a - a)", "n = int(input())\nans =1\nn+=1\nwhile(True):\n if('8' in str(n)):\n break\n n+=1\n ans+=1\n\nprint(ans)", "a = int(input())\r\nb = a+1\r\nwhile str(b).find('8') == -1:\r\n b+=1\r\nprint(b-a)\r\n", "s = int(input())\r\np = s+1\r\nwhile str(p).find('8') < 0:\r\n p += 1\r\nprint(p - s)", "a = int(input())\r\nc = 0\r\nfor i in range(a + 1, 8888888889):\r\n c += 1\r\n if '8' in str(i):\r\n print(c)\r\n break", "inp=input()\r\nx=int(inp)\r\ncount=0\r\nwhile True:\r\n x=x+1\r\n count=count+1\r\n st=str(x)\r\n if '8' in st:\r\n break\r\nprint(count) \r\n", "n, ans = int(input()), 0\r\nfor i in range (n,8888888888) :\r\n s = str(i) \r\n if '8' in s and ans != 0:\r\n print (ans)\r\n exit()\r\n else :\r\n ans += 1 ", "def check(k) :\r\n k = str(k)\r\n return k.count('8') > 0\r\n\r\na = int(input())\r\nans = 1\r\nwhile not check(a+ans) : ans+=1\r\nprint (ans)\r\n", "n=int(input())\r\nb=1\r\nwhile 1:\r\n n+=1\r\n n=str(n)\r\n if '8' in n:\r\n print(b)\r\n break\r\n n=int(n);b+=1 ", "n=int(input())\r\ni=0\r\nwhile(1):\r\n if \"8\" in str(n) and i!=0:\r\n print(i)\r\n break\r\n else:\r\n n=n+1\r\n i=i+1", "n=int(input())\r\nc=0\r\nfor i in range(n+1,8888888889):\r\n \r\n x=i\r\n c=c+1\r\n while(x!=0):\r\n if(x<0):\r\n m=(-x)%10\r\n else:\r\n m=x%10\r\n #print(m)\r\n if(m==8):\r\n break\r\n x=int(x/10)\r\n if(x!=0):\r\n break\r\nprint(c)\r\n", "a=int(input())\r\ncount=0\r\nwhile True:\r\n a+=1\r\n count+=1\r\n if \"8\" in str(a):\r\n break\r\nprint(count)", "m = int(input())\r\n\r\nfor i in range(100000):\r\n\r\n\tm = m+1\r\n\r\n\ta = str(m)\r\n\r\n\tif a.find('8') is not -1:\r\n\r\n\t\tbreak\r\n\r\nprint (i+1)\r\n", "x,c=int(input()),1\r\nwhile '8' not in str(x+c):c+=1\r\nprint(c)", "a=int(input())\r\ns=a\r\ng=0\r\np=True\r\nwhile(p):\r\n s+=1\r\n g+=1\r\n if '8' in str(s):\r\n p=False\r\n break\r\nprint(g)", "# 1671562233294\r\nog = int(input())\r\nn = og + 1\r\nwhile str(n).find('8') == -1:\r\n n += 1\r\nprint(n - og)", "n = int(input()) + 1\nans = 1\n\nwhile (True):\n if '8' in str(n):\n break\n n += 1\n ans += 1\n\nprint (ans)\n", "a=int(input())\r\nl=[]\r\ndef init(b):\r\n for i in range(len(b)):\r\n p=b[i]\r\n l.append(p)\r\n if \"8\" in l:\r\n return True\r\n else:\r\n return False\r\nfor i in range(1,8888888888-a):\r\n p=a+i\r\n k=str(p)\r\n if init(k)==True:\r\n print(i)\r\n break", "n=int(input())\r\nc=0\r\nwhile(True):\r\n c+=1\r\n n+=1\r\n n=str(n)\r\n if(\"8\" in n):\r\n break\r\n n=int(n)\r\nprint(c)\r\n\r\n\r\n", "def lucky(b):\n if b<0:\n b = -b\n while b>0:\n if b%10==8:\n return True\n b //= 10\n return False\n \na = int(input())\nb = a+1\nwhile not lucky(b):\n b += 1\nprint(b-a)\n", "s = input()\r\nans = 0\r\nf = True\r\nwhile f:\r\n s = str(int(s)+1)\r\n ans+=1\r\n for i in s:\r\n if i == '8':\r\n f = False\r\nprint(ans)\r\n \r\n", "import sys\r\na = input()\r\nb=int(a)\r\nfor i in range (1,17):\r\n b+=1\r\n a=str(b)\r\n for j in range (0, len(a)):\r\n if a[j]=='8':\r\n print(i)\r\n sys.exit()\r\n", "def has_eight(x):\r\n if x < 0:\r\n x *= -1\r\n while x > 0:\r\n if x % 10 == 8:\r\n return True\r\n x //= 10\r\n return False\r\n\r\nx = int(input())\r\ny = 0\r\n\r\nwhile x <= 8888888888:\r\n if has_eight(x) and y != 0:\r\n break\r\n x += 1\r\n y += 1\r\n\r\nprint(y)\r\n", "def isLucky(a):\r\n if \"8\" in str(a):\r\n return True\r\n return False\r\n\r\na=int(input())\r\nfor i in range(1,17): #worst case scenario: a=-8. he needs to walk 16 steps above to reach the next lucky floor\r\n if isLucky(a+i):\r\n print(i)\r\n break\r\n ", "#!/usr/bin/env python\n\ncur = int(input()) + 1\nsteps = 1\n\nwhile not '8' in str(cur):\n cur += 1\n steps += 1\n\nprint(steps)\n", "n=input()\r\ncount=0\r\nwhile True:\r\n if '8' in n:\r\n if count>0:\r\n break\r\n n=int(n)\r\n n+=1\r\n n=str(n)\r\n count+=1\r\nprint(count)", "s = int(input())\r\nfor i in range(s+1,s+17):\r\n\tif '8' in str(i): print(i-s);break", "if __name__==\"__main__\":\r\n a=int(input())\r\n s1=str(a)\r\n count,flag=0,0\r\n while flag==0:\r\n count += 1\r\n a = int(s1)\r\n a = a + 1\r\n s1 = str(a)\r\n if '8' in s1:\r\n print(count)\r\n flag = 1\r\n\r\n\r\n", "a = int(input())\r\nb = 1\r\nwhile str(a + b).count('8') == 0:\r\n b += 1\r\nprint(b)", "floor=int(input())\r\nc=0\r\nwhile '8' not in str(floor) or c==0:\r\n floor+=1\r\n c+=1\r\nprint(c)", "def verifica_8(numero = ''):\r\n for i in range(len(numero)):\r\n if numero[i] == '8':\r\n return True\r\n return False\r\n\r\n\r\n\r\nentrada = int(input())\r\n\r\ncont = 1\r\n\r\nwhile True:\r\n numero = entrada + cont\r\n para = verifica_8(str(numero))\r\n if para == True:\r\n break\r\n cont += 1\r\n\r\n\r\nprint(cont)\r\n", "# coding: utf-8\na = int(input())\nb = 0\nwhile True:\n b += 1\n for ch in str(a+b):\n if ch == '8':\n print(b)\n exit()\n", "def checknum(n):\r\n n=abs(n)\r\n while(n>0):\r\n if(n%10==8):\r\n return True\r\n n=n//10\r\n return False\r\n\r\na=int(input())\r\nfor i in range(1,26):\r\n if(checknum(a+i)):\r\n print(i)\r\n break\r\n", "n = input()\r\nn = list(n)\r\ncount = 0\r\nif '8' in n:\r\n n = ''.join(n)\r\n n = int(n) + 1\r\n n = list(str(n))\r\n count += 1\r\nflag = False\r\nwhile not flag:\r\n if '8' in n:\r\n print(count)\r\n flag = True\r\n break\r\n else:\r\n n = ''.join(n)\r\n n = int(n) + 1\r\n n = list(str(n))\r\n count += 1\r\n", "a = int(input())\r\nb = a + 1\r\nwhile str(b).count('8') == 0:\r\n b += 1\r\nprint(b - a)\r\n", "#code\r\nr = int(input())\r\ndef fe(x):\r\n return ('8' in list(str(x)))\r\nx=r\r\nr+=1\r\n\r\nwhile(1):\r\n if fe(r):\r\n print(r-x)\r\n break\r\n r+=1", "def lucky(n):\r\n digits = [int(x) for x in str(n)]\r\n if 8 in digits:\r\n return True\r\n return False\r\nn = int(input())\r\ncopy = n+1\r\nwhile not lucky(abs(copy)):\r\n copy+=1\r\nprint(copy-n)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Apr 13 23:49:41 2020\r\n\r\n@author: DELL\r\n\"\"\"\r\nn=int(input())\r\nc=0\r\np=True\r\nwhile p:\r\n c+=1\r\n n+=1\r\n if str(n).count('8')>0:\r\n p=False\r\n break\r\nprint(c)", "n = int(input())\nn += 1\nans = 0\n_ = True\nwhile _:\n s = str(n)\n for i in s:\n try:\n if int(i) == 8:\n _ = False\n break\n except:\n continue \n ans+=1\n n+=1\nprint(ans)", "n = input()\r\ncount = 0\r\nif '8' in n:\r\n n = str(int(n)+1)\r\n count += 1\r\nfor i in range(20):\r\n if '8' in n:\r\n print(count)\r\n break\r\n else:\r\n n = str(int(n)+1)\r\n count += 1\r\n", "ins = int(input()) + 1\r\ncount= 1\r\nwhile \"8\" not in str(ins):\r\n ins += 1\r\n count += 1\r\nprint(count) ", "n=int(input())\r\ncount=1\r\nwhile '8' not in str(n+count):\r\n count+=1\r\nprint(count)", "n=int(input(\"\"))\r\nj=n+1\r\nwhile '8' not in str(j):\r\n j=j+1\r\nprint(j-n)", "n = 1\r\nx = int(input()) + n\r\nwhile ('8' not in str(x)):\r\n n += 1\r\n x += 1\r\nprint(n)\r\n", "s=input()\r\nn=int(s)\r\nfor i in range(n+1,8888888889):\r\n s1=str(i)\r\n if '8' in s1:\r\n print(i-n)\r\n exit(0)\r\n", "a = int(input())\r\nb= 1\r\nwhile '8' not in str(a+1):\r\n a+=1\r\n b+=1\r\nprint(b)", "n = int(input())\nfor i in range(1,100):\n m = n+i\n if '8' in str(m):\n print(i)\n break\n", "n=int(input())\r\nn=n+1\r\nb=1\r\nwhile '8' not in str(n):\r\n n=n+1\r\n b=b+1\r\nprint(b)", "import sys\r\n\r\nI=sys.stdin.readline\r\n\r\nn=int(input())\r\n\r\nif -9<n<0 and len(str(-n)):\r\n\tprint(8+(-n))\r\nelse:\r\n\tfor i in range(1,11):\r\n\t\tif '8' in str(n+i):\r\n\t\t\tprint(i)\r\n\t\t\tbreak\r\n\r\n\t\t\r\n", "alpha = int(input())\n\nfloor = alpha + 1\n\nwhile not '8' in str(floor):\n floor += 1\n\nprint(floor - alpha)", "a=int(input())\r\nc=0\r\nwhile 1:\r\n a+=1\r\n c+=1\r\n y=str(a)\r\n if \"8\" in y:\r\n break\r\nprint(c)\r\n", "import sys\r\n\r\nn=input()\r\nlist=[str(x) for x in n]\r\ny=0\r\nwhile True:\r\n y=y+1\r\n n=int(n)+1\r\n n=str(n)\r\n list=[str(x) for x in n]\r\n x=str(8) in list\r\n if x:\r\n print(y) \r\n exit()", "n = int(input())\r\ncurrent = n + 1\r\nwhile \"8\" not in str(current): current += 1\r\nprint(current - n)", "a = int(input(\"\"))\r\noutput = 0\r\nwhile \"8\" not in str(a) or output == 0:\r\n a = a+1\r\n output = output + 1\r\nprint(output)\r\n\r\n", "n = int(input())\r\nm=n\r\nn+=1\r\nwhile '8' not in str(n):\r\n n+=1\r\nprint(n-m)", "n = int(input())\r\nfor i in range (1, 1000):\r\n floor = str(n + i)\r\n if '8' in floor:\r\n print(i)\r\n exit()", "n=int(input())\r\nc=1\r\nwhile '8' not in str(n+c):\r\n c+=1\r\nprint(c)", "n= int(input())\r\nstep = 1\r\nwhile \"8\" not in str(n+step) : step+=1\r\nprint(step)\r\n", "a = int(input())\r\nx = 1\r\nwhile '8' not in str(a + x) : \r\n x += 1\r\n\r\nprint(x)", "n=int(input())+1\r\nc=1\r\nwhile '8' not in str(n):\r\n n+=1\r\n c+=1\r\nprint(c)", "n=int(input(\"\"))\r\nsteps=n+1\r\nwhile '8' not in str(steps):\r\n steps+=1\r\nprint(steps-n)", "n = int(input())\r\nc = 1\r\nn += 1\r\n\r\nwhile 1:\r\n if '8' in str(n): break\r\n n += 1\r\n c += 1\r\n\r\nprint(c)", "x=int(input())\r\nfor i in range(99):\r\n\tif '8' in str(x+i+1):\r\n\t\tprint(i+1)\r\n\t\tbreak", "x= int(input())\r\nlucky = [i for i in range(x,x+20) if '8' in str(i) and i != x]\r\nminDif = 100\r\nfor i in lucky:\r\n if abs(i - x) < minDif :\r\n minDif = abs(i-x)\r\nprint(minDif)\r\n", "a=input()\r\nb=0\r\nwhile(1):\r\n b+=1\r\n a=str(int(a)+1)\r\n if '8' in a:\r\n break\r\nprint(b)", "a=int(input())\r\nb=1\r\nwhile True:\r\n a+=1\r\n if '8' in repr(a):\r\n break\r\n else:\r\n b+=1\r\nprint(b)", "n = int(input())\r\nt = 0\r\nfor i in range(n+1, 8888888889):\r\n if '8' in str(i):\r\n t = i\r\n break\r\nprint(t-n)", "n = int(input())\r\nm = 1\r\nwhile '8' not in str(n + m) :\r\n m += 1\r\nprint(m)", "from collections import Counter\r\n\r\n\r\n\r\nn = int(input())\r\nn+=1\r\nb = 1\r\nwhile '8' not in str(n):\r\n n+=1\r\n b+=1\r\nprint(b)\r\n", "n=int(input())\r\nfor i in range(1,100000000):\r\n if '8' in str(i+n):\r\n print(i)\r\n break\r\n else:\r\n pass", "#Keshika Patwari\r\n#Indian Institute Of Technology, Jodhpur\r\n# 2022\r\nimport sys\r\ninput=sys.stdin.readline\r\ndef exe():\r\n for i in range(1,17):\r\n a=str(s+i)\r\n for j in a:\r\n if(j=='8'):\r\n return i\r\n return 0\r\ns=int(input())\r\nprint(exe())", "floor=int(input())\r\nc_floor=floor+1\r\nwhile c_floor<=(8888888888):\r\n if \"8\" in str(c_floor):\r\n break\r\n c_floor+=1\r\nprint(c_floor-floor)", "n = int(input())\r\ncnt = 1\r\nn+=1\r\nwhile True:\r\n if '8' in str(n):\r\n break\r\n else:\r\n n+=1\r\n cnt+=1\r\nprint(cnt)", "a = int(input())\r\nfor i in range(1, 100):\r\n if -1 != str(a + i).find('8'):\r\n print(i)\r\n break\r\n", "a=int(input())\r\n\r\n\r\n\r\n\r\nif '8' in str(a):\r\n for j in range(1,17777777777):\r\n a+=1\r\n if '8' in str(a):\r\n print(j)\r\n break\r\nelse:\r\n for j in range(1,17777777777):\r\n a+=1\r\n if '8' in str(a):\r\n print(j)\r\n break\r\n \r\n \r\n", "n = int(input())\r\nfor i in range(1, abs(8888888888 - n) + 1):\r\n if any(x == '8' for x in str(n + i)):\r\n print(i)\r\n exit(0)\r\nprint(-1)\r\n", "n = int(input())\r\ni = 0\r\nwhile(True):\r\n\tn += 1\r\n\ti += 1\r\n\ts = str(n)\r\n\tif('8' in s):\r\n\t\tprint(i)\r\n\t\tbreak", "a = int(input())\r\ni = 1\r\na += 1\r\nwhile a < 8888888888 and not('8' in str(a)):\r\n a += 1\r\n i += 1\r\nprint(i)", "n = int(input())\r\nnow = n+1\r\nwhile(1):\r\n if('8' in str(now)):\r\n print(now-n)\r\n break\r\n now += 1", "from sys import stdin\r\nstdin.readline\r\n\r\n\r\ndef mp():return map(int,input().split())\r\ndef it():return int(input())\r\n\r\nn=it()\r\nans=0\r\nwhile 1:\r\n\tn+=1\r\n\tans+=1\r\n\tif '8' in str(n):\r\n\t\tbreak\r\nprint(ans)", "n = int(input())\r\nans = 0\r\nwhile('8' not in str(n+1)):\r\n\tn += 1\r\n\tans += 1\r\nprint(ans+1)", "\r\nNum=int(input(\"\"))\r\ncount=0\r\na=True\r\nwhile a:\r\n Num=Num+1\r\n count+=1\r\n nu=str(Num)\r\n if \"8\" in nu:\r\n a=False\r\n \r\nprint(count) ", "def find_lucky_floor():\r\n\tcurrent_floor = int(input())\r\n\r\n\tfor i in range(0, 20):\r\n\t\tcurrent_floor += 1\r\n\t\tif \"8\" in str(current_floor):\r\n\t\t\tprint(i+1)\r\n\t\t\tbreak\r\n\r\n\r\nfind_lucky_floor()", "n=int(input())\r\nfor i in range(1,20):\r\n x=n+i\r\n if (\"8\" in str(x)):\r\n print(i)\r\n break", "n = input().strip()\r\nj = 0\r\nfor i in range(30):\r\n j += 1\r\n n = str(int(n) + 1)\r\n if '8' in n:\r\n break\r\nprint(j)", "#in the name of god\r\n#Mr_Rubick\r\na=int(input());b=a+1\r\nwhile '8' not in str(b):b+=1\r\nprint(b-a)", "n=int(input());k=n\r\nwhile True:\r\n n+=1\r\n if \"8\" in str(n):print(n-k);break", "s=input().strip()\r\nc=0\r\nans=''.join(s)\r\nans=int(ans)\r\nans+=1\r\nans=str(ans)\r\nans=list(ans)\r\nl=ans\r\nc+=1\r\nwhile(True):\r\n if('8' in l):\r\n break\r\n ans=''.join(l)\r\n ans=int(ans)\r\n ans+=1\r\n ans=str(ans)\r\n ans=list(ans)\r\n l=ans\r\n c+=1\r\nprint(c)", "a=int(input())\r\nb=1\r\n\r\ndef check8(n):\r\n c=0\r\n n=str(n)\r\n for char in n:\r\n if char=='8':\r\n c=1\r\n return c\r\n\r\nn=a+1\r\nwhile check8(n)==0:\r\n b+=1\r\n n+=1\r\n\r\nprint(b)\r\n", "n = int(input())\r\nb = 1\r\nn += 1\r\nwhile (\"8\" not in str(n)):\r\n n += 1\r\n b += 1 \r\nprint(b)", "n=int(input())\r\nc=1\r\nif c==1 :\r\n d=str(n)\r\n for i in range(1,100) :\r\n n=n+1\r\n n=str(n)\r\n if str(n).count('8')>0 :\r\n print(int(n)-int(d))\r\n \r\n c=0\r\n break\r\n n=int(n)\r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n \r\n", "n=int(input())\r\nans=int(1)\r\nn+=1\r\nwhile '8' not in str(n):\r\n n+=1\r\n ans+=1\r\nprint(ans)\r\n \r\n", "a=int(input())\r\nx=0\r\nwhile True:\r\n a+=1\r\n x+=1\r\n if '8'in str(a):\r\n print(x)\r\n quit()\r\n \r\n\r\n \r\n", "a, = map(int,input().split())\r\nans = 1\r\nwhile '8' not in str(a+ans):\r\n ans+=1\r\nprint(ans)", "n=int(input())\r\nn=n+1\r\nc=0\r\nfor i in range(5555555):\r\n if \"8\" in str(n):\r\n break\r\n else:\r\n c+=1\r\n n+=1\r\nprint(c+1)\r\n", "s = input()\r\nn=int(s)\r\n\r\nctr = 0\r\n\r\nfor i in range(20):\r\n ctr += 1\r\n n += 1\r\n if('8' in str(n)): break\r\n\r\nprint(ctr)", "a=int(input())\na=a+1\nb=1\nwhile(b>0):\n st=str(a)\n if('8' in st):\n print(b)\n break\n else:\n b+=1\n a=a+1\n\n\t \t\t \t \t \t \t\t \t \t\t\t\t \t", "a = int(input())\r\n\r\nu = a + 1\r\nc = 0\r\nwhile True:\r\n\tc += 1\r\n\tif '8' in set(str(u)):\r\n\t\tbreak\r\n\tu += 1\r\n\r\nprint(c)", "i =int(input())\ni+=1\ni = str(i)\nret=1\nwhile \"8\"not in i:\n i = int(i)\n i+=1\n i = str(i)\n ret+=1\nprint (ret)", "def c(n):\r\n n1 = n\r\n n1 = abs(n1)\r\n for i in range(10):\r\n if (n1 % 10 == 8):\r\n return 1\r\n n1 = n1 // 10\r\n return 0\r\n\r\nn = int(input())\r\nr = 1\r\nwhile not c(n + r):\r\n r = r + 1\r\nprint(r)", "#!python3\n\nfrom collections import deque, Counter\nfrom itertools import combinations, permutations\nfrom math import sqrt\nimport unittest\n\n\ndef read_int():\n return int(input().strip())\n\n\ndef read_int_array():\n return [int(i) for i in input().strip().split(' ')]\n\n######################################################\n\nn = read_int()\ncount = 0\nwhile True:\n n += 1\n count += 1\n if '8' in str(n):\n break\nprint(count)\n\n\n\n", "i = int(input())\r\nc = 0\r\nif '8' in str(i):\r\n i+=1\r\n c += 1\r\nwhile True:\r\n if '8' in str(i):\r\n break\r\n else: c += 1; i += 1\r\nprint(c)", "a=int(input())\r\ncount=1\r\na+=1\r\nwhile '8' not in str(a):\r\n\tcount+=1\r\n\ta+=1\r\nprint(count)", "import sys\r\nimport math\r\n\r\nn = int(input())\r\n\r\nstep = 1; n+=1\r\nwhile str(n).count('8') == 0:\r\n n+=1; step+=1\r\nprint(step)\r\n ", "import sys\r\nfor n in sys.stdin:\r\n n = int(n)\r\n m=n\r\n n+=1\r\n while '8' not in str(n):\r\n n+=1\r\n print(n-m)", "k=int(input())\r\nfor i in range(1,21):\r\n if \"8\" in str(k+i) :\r\n print(i)\r\n exit()", "import re\nfrom collections import Counter\nfrom sys import stderr\nfrom typing import Union, Generator, List, Tuple\nimport string\n\nINF = 2e18 + 3\nEPS = 1e-10\n\n\ndef main():\n a = int(input())\n\n b = 1\n while '8' not in str(a + b):\n b += 1\n\n print(b)\n\n\nif __name__ == '__main__':\n main()\n", "a=int(input())\nc=0\nwhile 1:\n a=a+1\n c=c+1\n y=str(a)\n if \"8\" in y:\n break\nprint(c)", "n = int(input())\r\nm = str(n + 1)\r\nnn = n+1\r\nct = 0\r\nwhile \"8\" not in m:\r\n nn += 1\r\n m = str(nn)\r\n\r\nprint(nn-n)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\ncnt = 1\nn += 1\nwhile not '8' in str(n):\n n += 1\n cnt += 1\nprint(cnt)\n\n", "N = int(input())\r\n\r\ni = N + 1\r\n\r\nwhile '8' not in str(i):\r\n i += 1\r\n\r\nprint(i - N)\r\n \r\n \r\n ", "n = int(input())\r\nans =1\r\nn+=1\r\nwhile(True):\r\n if('8' in str(n)):\r\n break\r\n n+=1\r\n ans+=1\r\n\r\nprint(ans)\r\n", "n = input()\nfor i in range(1,20):\n\tif \"8\" in str(int(n)+i):\n\t\tprint(i)\n\t\tbreak", "number = int(input())\r\n\r\nres = 1\r\n\r\nwhile '8' not in str (number + res):\r\n res += 1\r\n\r\nprint(res)", "x = int(input())\r\nx+=1\r\ncount = 0\r\nwhile True:\r\n count+=1\r\n if \"8\" in str(x):\r\n print(count)\r\n break\r\n else:\r\n x+=1", "n=int(input())\r\nn=str(n)\r\nx=int(0)\r\nwhile(1):\r\n x+=1\r\n n=str(int(n)+1)\r\n if('8' in n):\r\n break\r\nprint(x)", "a,b=int(input()),1\n\nwhile str(a+b).find('8')==-1: b+=1\n\nprint(b)\n\n\n\n# Made By Mostafa_Khaled", "n=input()\r\nx=1\r\nwhile '8' not in str(int(n)+x): \r\n x+=1\r\nprint(x)\r\n", "n = int(input())\r\ni = 0\r\nfor i in range(16):\r\n n += 1\r\n i += 1\r\n if '8' in str(n):\r\n break\r\nprint(i)", "n=int(input())\r\nans=0\r\nn+=1\r\nwhile(True):\r\n lis=set(str(abs(n)))\r\n ans+=1\r\n if '8' in lis:\r\n break\r\n n+=1\r\nprint(ans)", "n,c=str(int(input())+1),1\r\nwhile \"8\" not in n:\r\n\tn=int(n)+1\r\n\tc+=1\r\n\tn=str(n)\r\nprint(c)", "n = int(input())\n\na = 0\n\nn1, n2 = n, n\n\nwhile True:\n n1 += 1\n a += 1\n if '8' in str(n1):\n print(a)\n break\n", "n = input();\r\n\r\nn = int(n)+1\r\nn = str(n)\r\nb = 1\r\n\r\nwhile('8' not in n) :\r\n n = int(n)+1\r\n n = str(n)\r\n b += 1\r\n\r\nprint(b)\r\n", "a = int(input())\r\n\r\ndef check(c):\r\n l = len(c)\r\n i = l-1\r\n while (i >= 0) and (c[i] != '8'):\r\n i -= 1\r\n if i != -1:\r\n return True\r\n else:\r\n return False\r\n \r\nb = 1\r\nwhile not check(str(a+b)):\r\n b += 1\r\n \r\nprint(b)", "n = int(input())\r\na = 1\r\nwhile '8' not in str(n+a):\r\n a = a+1\r\nprint(a)\r\n", "x = input()\r\naux = 0\r\nwhile(True):\r\n if('8' in x):\r\n if(aux == 0):\r\n aux += 1\r\n x = str(int(x)+1)\r\n else:\r\n break\r\n else:\r\n x = str(int(x)+1)\r\n aux += 1\r\n\r\nprint(aux)\r\n ", "n=input()\r\nb=1\r\nwhile True:\r\n num=int(n)+b\r\n s=str(num)\r\n l=list(s)\r\n if '8' in s:\r\n break\r\n b+=1\r\nprint(b)\r\n ", "n = int(input())\r\nn += 1; foo = 1\r\nwhile True:\r\n for i in str(n):\r\n if i == '8':\r\n print(foo)\r\n exit()\r\n n += 1\r\n foo += 1\r\n", "n = int(input())\ni = 1\nwhile(True):\n if '8' in str(n+i):\n print(i)\n break\n i += 1\n\t\t\t\t \t \t \t\t \t \t \t\t\t\t \t", "number = int(input())\r\ni = 1\r\nwhile True:\r\n number += 1\r\n if \"8\" in str(number):\r\n break\r\n else:\r\n i += 1\r\nprint(i)", "a = int(input())\r\nb = 1\r\nwhile str(b+a).find('8') == -1: b += 1\r\nprint(b)", "n=int(input())\r\nk=n+1\r\nwhile '8' not in str(k):\r\n k+=1\r\nprint(k-n)", "def steps(x):\n piso = x\n while True:\n piso += 1\n if '8' in str(piso):\n break\n return piso - x \n\nprint(steps(int(input())))\n\n \n", "z=int(input())\r\nb=z\r\nfor i in range(1,100):\r\n b+=1\r\n if \"8\" in str(b):\r\n print(b-z)\r\n break\r\n", "N = int(input())\nans = 1\nwhile True:\n if \"8\" in str(N + ans):\n print(ans)\n exit()\n ans += 1\n", "n = int(input())\r\nmoves = 0\r\nwhile '8' not in str(n+1):\r\n\tmoves+=1\r\n\tn+=1\r\nprint(moves+1)", "import sys\r\nfloor_at = int(input())\r\nfor x in range(floor_at + 1, 8888888888):\r\n if '8' in str(x):\r\n print(x - floor_at)\r\n break", "n = int(input())\r\nc1 = 0\r\nc2 = 0\r\na = int(n)\r\nb = int(n)\r\nc = 1\r\nif(n == -7):\r\n c1 = 15\r\nelif(n == -8):\r\n c1 = 16\r\nelif (n == -5):\r\n c1 = 13\r\nelif(n == -6):\r\n c1 = 14\r\nelif(n == -4):\r\n c1 = 12\r\nelse:\r\n for i in range(1,12):\r\n check = a + i\r\n #print(check)\r\n #print(n)\r\n n_str = str(check)\r\n l = len(n_str)\r\n\r\n can = False\r\n for j in range(l):\r\n if(n_str[j] == '8'):\r\n c1 = i\r\n can = True\r\n break\r\n if(can == True):\r\n break\r\n \r\n\r\n\r\nprint(c1)\r\n", "n = int(input())\n\nn += 1\nx = 1\nwhile True:\n if '8' in str(n):\n break\n n += 1\n x += 1\n\nprint(x)\n", "a = int(input()) + 1\r\n\r\nans = 1\r\nwhile '8' not in str(a):\r\n a += 1\r\n ans += 1\r\n\r\nprint(ans)\r\n", "n=int(input())\r\nans=1\r\nn+=1\r\nwhile(not((str(n)).count('8'))):\r\n ans+=1\r\n n+=1\r\nprint(ans)", "i = int(input())\nk = 0\n\nfor j in range(1, 100):\n if \"8\" in str(i+j):\n k = j\n break\n\nprint (k)\n" ]

[ "import sys\r\ninput=sys.stdin.readline\r\nc=input().rstrip()\r\ncan=set(list(c))\r\ncannot=set([chr(i) for i in range(ord(\"a\"),ord(\"z\")+1)])-can\r\npattern=input().rstrip()\r\ntmp=(\"*\" in pattern)\r\nq=int(input())\r\nfor _ in range(q):\r\n s=input().rstrip()\r\n ls=len(s)\r\n p=pattern\r\n l=len(p)\r\n if tmp:\r\n if l<=ls:\r\n p=p.replace(\"*\",\"*\"*(ls-l+1))\r\n elif l==ls+1:\r\n p=p.replace(\"*\",\"\")\r\n if len(p)!=ls:\r\n print(\"NO\")\r\n continue\r\n flag=True\r\n for i in range(ls):\r\n if p[i]==\"?\" and (s[i] not in can):\r\n flag=False\r\n if p[i]==\"*\" and (s[i] not in cannot):\r\n flag=False\r\n if p[i]!=\"?\" and p[i]!=\"*\" and p[i]!=s[i]:\r\n flag=False\r\n if flag:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "from sys import stdin\r\nfrom collections import defaultdict as dd\r\n\r\ngood = dd(lambda: 0)\r\nst = input()\r\nfor ch in st:\r\n good[ch] = 1\r\ns = input()\r\nstar = int(s.find(\"*\") != -1)\r\nloc = s.find(\"*\")\r\nn = int(stdin.readline())\r\nfor i in range(n):\r\n st = input()\r\n if (len(st) < len(s) - star):\r\n print(\"No\")\r\n else:\r\n flg = True\r\n l = len(st)\r\n if star:\r\n i = 0\r\n j = l-1\r\n for idx in range(loc):\r\n if s[idx] == \"?\":\r\n if not good[st[i]]:\r\n flg = False\r\n else:\r\n if s[idx] != st[i]:\r\n flg = False\r\n i += 1\r\n for idx in range(len(s)-1, loc, -1):\r\n if s[idx] == \"?\":\r\n if not good[st[j]]:\r\n flg = False\r\n else:\r\n if s[idx] != st[j]:\r\n flg = False\r\n j -= 1\r\n for idx in range(i, j+1):\r\n if good[st[idx]]:\r\n flg = False\r\n else:\r\n if len(st) != len(s):\r\n flg = False\r\n for i in range(len(s)):\r\n if s[i] == \"?\":\r\n if not good[st[i]]:\r\n flg = False\r\n elif s[i] != st[i]:\r\n flg = False\r\n if flg:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "z=input;g = z();p= z();n = int(z())\r\ndef m(p, t):\r\n d = len(t) - len(p)\r\n if d < -1:return 0\r\n p=p.replace('*', '#' * (d+1))\r\n if len(p) != len(t):return 0\r\n for i in range(len(p)):\r\n if p[i] == '?':\r\n if t[i] not in g:return 0\r\n elif p[i] == '#':\r\n if t[i] in g:return 0\r\n else:\r\n if t[i] != p[i]:return 0\r\n return 1\r\n\r\nfor i in range(n):\r\n t = z()\r\n print(\"YES\" if m(p, t) else \"NO\")\r\n", "a = input()\r\nb = input()\r\nm = int(input())\r\nfor i in range(m):\r\n ans = \"YES\"\r\n n = input()\r\n w = b\r\n if \"*\" in w:\r\n if len(w) <= len(n):\r\n w = w.replace(\"*\", \"*\" * (abs(len(w) - len(n)) + 1))\r\n elif len(w) == len(n) + 1:\r\n w = w.replace(\"*\", \"\")\r\n if len(n) != len(w):\r\n ans = \"NO\"\r\n else:\r\n for i in range(len(n)):\r\n if w[i] == \"*\":\r\n if n[i] in a:\r\n ans = \"NO\"\r\n break\r\n elif w[i] == \"?\":\r\n if n[i] not in a:\r\n ans = \"NO\"\r\n break\r\n else:\r\n if w[i] != n[i]:\r\n ans = \"NO\"\r\n break\r\n else:\r\n ans = \"YES\"\r\n print(ans)", "g=input()\r\np=input()\r\nfor _ in range(int(input())):\r\n flag=True\r\n s=input()\r\n t=p\r\n if('*' in t):\r\n if(len(t)<=len(s)):\r\n t=t.replace('*','*'*(abs(len(t)-len(s))+1))\r\n elif(len(t)==len(s)+1):\r\n t=t.replace('*','')\r\n if(len(s)!=len(t)):\r\n flag=False\r\n else:\r\n for i in range(len(s)):\r\n if(t[i]=='*'):\r\n if(s[i] in g):\r\n flag=False\r\n break\r\n elif(t[i]=='?'):\r\n if(s[i] not in g):\r\n flag=False\r\n break\r\n else:\r\n if(t[i]!=s[i]):\r\n flag=False\r\n break\r\n else:\r\n flag=True\r\n if(flag):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "global good\r\ndef check(s,h):\r\n if len(s)!=len(h): return 0\r\n for i in range(len(s)):\r\n if h[i]=='?':\r\n if s[i] in good: continue\r\n return 0\r\n if h[i]!=s[i]: return 0\r\n return 1\r\ngood=input()\r\nh=input()\r\nn=int(input())\r\ne=0\r\nl,r='',''\r\nfor i in range(len(h)):\r\n if h[i]=='*':\r\n l,r=h[:i],h[i+1:]\r\n e=1\r\n break\r\nfor i in range(n):\r\n s=input()\r\n if not e:\r\n if check(s,h): print('YES')\r\n else: print('NO')\r\n else:\r\n if len(h)-1>len(s): print('NO')\r\n else:\r\n l1=s[:len(l)]\r\n r1=s[len(s)-len(r):]\r\n f=1\r\n for x in s[len(l): len(s)-len(r)]:\r\n if x in good:\r\n f=0\r\n break\r\n if check(l1,l) and check(r1,r) and f: print('YES')\r\n else: print('NO')\r\n ", "#!/usr/bin/python3 \n#By Nce\ngood_guy=input()\nmask=input()\nleft_part=mask\nright_part=''\nstar_index=mask.find('*')\nif (star_index>=0):\n left_part=mask[:star_index]\n right_part=mask[star_index+1:]\nn=int(input())\nfor i in range(n):\n string=input()\n is_ok=True;\n left_str=string\n right_str=''\n center_str=''\n if (star_index>=0):\n left_str=string[:star_index]\n right_str=string[len(string)-len(right_part):]\n center_str=string[star_index:len(string)-len(right_part)]\n if (mask=='*'):\n for element in (left_str):\n if (element in good_guy):\n is_ok=False\n for element in (center_str):\n if (element in good_guy):\n is_ok=False\n for element in (right_str):\n if (element in good_guy):\n is_ok=False\n elif (len(left_str)!=len(left_part)) or (len(right_str)!=len(right_part)) or len(string)<len(left_str)+len(center_str)+len(right_str):\n is_ok=False\n else:\n for i in range(len(left_str)):\n if not (left_part[i]=='?' and left_str[i] in good_guy) and not (left_part[i]==left_str[i]):\n is_ok=False\n for i in range(len(right_str)):\n if not (right_part[len(right_part)-1-i]=='?' and right_str[len(right_str)-1-i] in good_guy) and not (right_part[len(right_part)-1-i]==right_str[len(right_str)-1-i]):\n is_ok=False\n for element in (center_str):\n if (element in good_guy):\n is_ok=False\n if (is_ok):\n print('YES')\n else:\n print('NO')\n \n\t\t \t \t \t\t\t\t \t\t \t \t", "\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\n\r\ns = input()[:-1]\r\nw = input()[:-1]\r\nt = 0\r\nif '*' in w:\r\n x = w.index('*')\r\n a = w[:x]\r\n b = w[x+1:][::-1]\r\n t = 1\r\nn = len(w)\r\n\r\nfor l in range(int(input())):\r\n q = input()[:-1]\r\n m = len(q)\r\n ew = 0\r\n if t == 0:\r\n if n != m:\r\n print('NO')\r\n continue\r\n for i in range(n):\r\n if w[i] != q[i]:\r\n if w[i] == '?' and q[i] in s:\r\n continue\r\n else:\r\n ew = 1\r\n break\r\n else:\r\n if m < n-1:\r\n print('NO')\r\n continue\r\n a1 = q[:x]\r\n a2 = q[::-1][:n-x-1]\r\n a3 = q[x:m+x-n+1]\r\n for i in range(len(a1)):\r\n if a[i] != a1[i]:\r\n if a[i] == '?' and a1[i] in s:\r\n continue\r\n else:\r\n ew = 1\r\n break\r\n for i in range(len(a2)):\r\n if b[i] != a2[i]:\r\n if b[i] == '?' and a2[i] in s:\r\n continue\r\n else:\r\n ew = 1\r\n break\r\n for i in a3:\r\n if i in s:\r\n ew = 1\r\n break\r\n print('YES' if ew == 0 else 'NO')" ]

[ "s=input()\r\ncnt=s.count(\"Danil\")+s.count(\"Olya\")+s.count(\"Slava\")+s.count(\"Nikita\")+s.count(\"Ann\") \r\nprint(\"YES\" if cnt == 1 else \"NO\")", "import re\n\nstr = 'Danil|Olya|Slava|Ann|Nikita'\nif (len(re.findall(str, input())) == 1):\n print('YES')\nelse:\n print('NO')\n \t \t\t\t \t\t\t\t \t \t \t\t\t\t", "s = input()\r\n\r\nnames = ['Danil', 'Olya', 'Slava', 'Ann', 'Nikita']\r\ncount = 0 \r\n\r\nfor n in names:\r\n count += s.count(n)\r\n \r\nprint('YES' if count ==1 else 'NO')\r\n", "s=input().rstrip()\r\nl=[\"Danil\", \"Olya\", \"Slava\", \"Ann\",\"Nikita\"]\r\na=[]\r\nf=0\r\nfor x in l:\r\n if x in s:\r\n a.append(x)\r\nif len(a)==1:\r\n if s.count(a[0])==1:print(\"YES\")\r\n else:print(\"NO\")\r\nelse:print(\"NO\")", "name = ['Danil','Olya','Slava','Ann','Nikita']\r\nreal = []\r\nword = input()\r\nfor i in name:\r\n if word.find(i) != -1:\r\n real.append(i)\r\nif len(real) == 1:\r\n if word.find(real[0],word.find(real[0])+len(real[0])) == -1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "s = input()\r\nx = 0\r\nfor e in [\"Danil\", \"Olya\", \"Slava\", \"Ann\" ,\"Nikita\"]:\r\n x+=s.count(e)\r\nif x == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\ncol = 0\r\ncol += s.count(\"Danil\")\r\ncol += s.count(\"Olya\")\r\ncol += s.count(\"Slava\")\r\ncol += s.count(\"Ann\")\r\ncol += s.count(\"Nikita\")\r\nif (col == 1):\r\n print(\"YES\")\r\nelse:\r\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 st='Danil|Olya|Slava|Ann|Nikita'\r\n print('YES' if len(re.findall(st, s))==1 else 'NO')\r\n\r\n\r\n\r\ndef main():\r\n s=inp()\r\n fn(s)\r\n\r\nif __name__==\"__main__\":\r\n main()", "ls=[\"Danil\",\"Olya\",\"Slava\",\"Ann\",\"Nikita\"]\r\ns=input()\r\nctr=0 \r\nfor a in ls:\r\n ctr+=s.count(a)\r\nif ctr==1:\r\n print(\"YES\")\r\n \r\nelse:\r\n print(\"NO\")", "i=input()\r\ns=[\"Danil\",\"Olya\",\"Slava\",\"Ann\",\"Nikita\"]\r\ncount=0\r\ncount2=0\r\nfor k in range(5):\r\n if s[k] in i:\r\n count=count+i.count(s[k])\r\nif count is not 1:\r\n print ('NO')\r\nelse:\r\n print ('YES')\r\n", "l=[\"Danil\", \"Olya\", \"Slava\", \"Ann\",\"Nikita\"]\r\ns=input()\r\nans=0\r\nfor i in range(0,5):\r\n ans+=s.count(l[i])\r\nif ans!=1:\r\n print(\"no\")\r\nelse:\r\n print(\"yes\")\r\n", "s = input()\r\ncount = 0\r\ncount2 = 0\r\n\r\nif ''.join(s).__contains__(\"Danil\"):\r\n count += 1\r\n count2 += ''.join(s).count(\"Danil\", 0, len(s))\r\n\r\nif ''.join(s).__contains__(\"Olya\"):\r\n count += 1\r\n count2 += ''.join(s).count(\"Olya\", 0, len(s))\r\n\r\nif ''.join(s).__contains__(\"Slava\"):\r\n count += 1\r\n count2 += ''.join(s).count(\"Slava\", 0, len(s))\r\n\r\nif ''.join(s).__contains__(\"Ann\"):\r\n count += 1\r\n count2 += ''.join(s).count(\"Ann\", 0, len(s))\r\n\r\nif ''.join(s).__contains__(\"Nikita\"):\r\n count += 1\r\n count2 += ''.join(s).count(\"Nikita\", 0, len(s))\r\n\r\nif count == 1 and count2 == 1: print(\"YES\")\r\nelse: print(\"NO\")", "l = input()\r\nc = 0 \r\nc += l.count('Danil')\r\nc += l.count('Olya')\r\nc += l.count('Slava')\r\nc += l.count('Ann')\r\nc += l.count('Nikita')\r\nif(c == 1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "st = input()\r\nl =[st.count('Nikita'),st.count('Danil'),st.count('Olya'),st.count('Slava'),st.count('Ann')]\r\nif sum(l)==1:\r\n\tprint('YES')\t\r\nelse:\r\n\tprint('NO')", "str = input()\r\narr1 = [\"Danil\",\"Olya\",\"Slava\",\"Ann\",\"Nikita\"]\r\ncount = [str.count(ele) for ele in arr1]\r\ntemp = sum(count)\r\nif temp == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = input()\r\nf = ['Danil','Olya','Slava','Ann',\"Nikita\"]\r\ncount = 0\r\nfor i in f:\r\n if n.count(i)==1:\r\n count += 1\r\n elif n.count(i)>1:\r\n count += 100\r\nif count == 1:\r\n print('YES')\r\nelse:\r\n print('NO')", "l = ['Danil', 'Olya', 'Slava', 'Ann' , 'Nikita']\r\ninp = input()\r\nc = 0\r\nfor el in l:\r\n c+=inp.count(el)\r\n if c>1: break\r\nif c==1: print('YES')\r\nelse: print('NO')", "n=[\"Danil\", \"Olya\", \"Slava\", \"Ann\",\"Nikita\"]\r\ns=input()\r\nf=0\r\nfl=1\r\ni=0\r\nwhile(i<5):\r\n if(s.find(n[i])>-1):\r\n if(f==1):\r\n fl=0\r\n break\r\n s=s.replace(n[i],'*',1)\r\n f=1\r\n i-=1\r\n i+=1\r\nif(f&fl):\r\n print('YES')\r\nelse:\r\n print('NO')", "a=[\"Danil\", \"Olya\", \"Slava\", \"Ann\",\"Nikita\"]\r\nn=input()\r\nc=0\r\nfor i in a:\r\n c+=n.count(i)\r\nif(c==1):print(\"YES\")\r\nelse:print(\"NO\")", "s1=input()\r\nflag=0\r\ns=[\"Danil\", \"Olya\", \"Slava\", \"Ann\",\"Nikita\"]\r\n\r\nfor ele in s:\r\n if ele in s1:\r\n flag+=s1.count(ele) \r\nif flag==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "''' \n\t************************.- J A I S H R E E R A M -.*************************\n\n\t ::: ---------- ::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::\n\n\t Author : Udit \"luctivud\" Gupta \n\n\t linkedin : https://www.linkedin.com/in/udit-gupta-1b7863135/\n\t github : https://github.com/luctivud\n\n\t :::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: ---------- :::\n\n'''\n\nimport math, sys, collections, functools, time, itertools;\n\n# sys.setrecursionlimit(10**6)\n\n\ndef Read_Ints() : return map(int, input().strip().split())\ndef Read_Array() : return list(Read_Ints())\ndef Read_Strings() : return list(input().strip().split())\ndef printxsp(*args) : return print(*args, end=\"\")\ndef printsp(*args) : return print(*args, end=\" \")\n\n\n\nd4i = [-1, +0, +1, +0]; d8i = [-1, -1, +0, +1, +1, +1, +0, -1]; \nd4j = [+0, +1, +0, -1]; d8j = [+0, +1, +1, +1, +0, -1, -1, -1];\n\n\n# >>>>>>--->>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>\n\n\n\n\n\ndef solveEachTest(_TestCase):\n\t# printsp(\"Case #{}: \".format(_TestCase)) \n\ts = input();\n\tfriends = [\"Danil\", \"Olya\", \"Slava\", \"Ann\", \"Nikita\"];\n\n\tres = 0\n\tfor friend in friends:\n\t\tres += s.count(friend)\n\tprint(\"YES\" if res == 1 else \"NO\")\n\n\n\n\n\n\n_T0T4 = 1;\n# _T0T4 = int(input()) \nfor _TestCase in range(1, _T0T4 + 1): \n\tsolveEachTest(_TestCase)\n\n\n\n# 0.2s Domain Expansion :\n#\t\t\t\t \tMAHAYANA PRISON \n\n", "d = {'Danil':0,'Olya':0,'Slava':0,'Ann':0,'Nikita':0}\r\ns = input()+'y'\r\nfor key in d.keys():\r\n for i in range(len(s)-len(key)):\r\n if s[i:len(key)+i] == key:\r\n d[key] += 1\r\nprint('NO' if sum(d.values()) != 1 else 'YES')", "s=input()\r\nt=s.count('Danil')\r\nu=s.count('Olya')\r\nv=s.count('Slava')\r\nw=s.count('Ann')\r\nx=s.count('Nikita')\r\nif t+u+v+w+x==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "s = input().split('_')\r\nl = [\"Danil\", \"Olya\", \"Slava\", \"Ann\", \"Nikita\"]\r\nans = 'YES'\r\nt = 0\r\nfor i in range(len(s)):\r\n\tfor j in l:\r\n\t\tif s[i].count(l[0])+s[i].count(l[1])+s[i].count(l[2])+s[i].count(l[3])+s[i].count(l[4]) == 1:\r\n\t\t\tt+=1\r\n\t\t\tbreak\r\nif t != 1:\r\n\tans = 'NO'\r\nprint(ans)\r\n", "s=input()\r\nf1='Danil'\r\nf2='Olya'\r\nf3='Slava'\r\nf4='Ann'\r\nf5='Nikita'\r\np=q=r=x=y=0\r\np=s.count(f1)\r\nq=s.count(f2)\r\nr=s.count(f3)\r\nx=s.count(f4)\r\ny=s.count(f5)\r\nif p+q+r+x+y==1:print(\"YES\")\r\nelse:print('NO')", "task = input()\r\nfriends = [\"Danil\", \"Olya\", \"Slava\", \"Ann\", \"Nikita\"]\r\ns = 0\r\nfor friend in friends:\r\n s += task.count(friend)\r\nif s == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=input()\r\na=n.count(\"Danil\")\r\nb=n.count(\"Olya\")\r\nc=n.count(\"Slava\")\r\nd=n.count(\"Ann\")\r\nf=n.count(\"Nikita\")\r\nif a+b+c+d+f==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s=input()\r\nprint(['NO','YES'][s.count('Danil')+s.count('Olya')+s.count('Slava')+s.count('Nikita')+s.count('Ann')==1])\r\n", "import sys\nimport re\n\nname_list = ['Danil', 'Olya', 'Slava', 'Ann', 'Nikita']\n\n\nfor line in sys.stdin:\n s = line.strip()\nnum = 0\nfor name in name_list:\n tmp = re.findall(name, s)\n num += len(tmp)\n\nif num == 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", "s=[\"Danil\",\"Olya\",\"Slava\",\"Ann\",\"Nikita\"]\r\nst=input()\r\nst=st.replace(\"_\",\" \")\r\nc=0\r\nfor i in s:\r\n c+=st.count(i)\r\nif c==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\r\n\r\ns = str(input())\r\nc1 = s.count('Danil')\r\nc2 = s.count('Olya')\r\nc3 = s.count('Slava')\r\nc4 = s.count('Ann')\r\nc5 = s.count('Nikita')\r\nc = c1 + c2 + c3 + c4 + c5\r\n\r\nif(c == 1):\r\n print('YES')\r\nelse:\r\n print('NO')", "import sys, re\r\ns1 = sys.stdin.readline().strip()\r\na=re.findall(r\"(?=(Danil|Olya|Slava|Nikita|Ann)).\", s1)\r\nprint(\"YES\"if len(a)==1 else\"NO\")", "import sys; input = sys.stdin.readline\r\ns = input().strip()\r\nd = (\"Danil\", \"Olya\", \"Slava\", \"Ann\", \"Nikita\")\r\ng = 0\r\nfor i in range(len(d)):\r\n\tfor j in range(len(s)-len(d[i])+1):\r\n\t\tif s[j:j+len(d[i])] == d[i]: g += 1\r\nif g == 1: print(\"YES\")\r\nelse: print(\"NO\")", "word = input()\nfriends = [\"Danil\", \"Olya\", \"Slava\", \"Ann\", \"Nikita\"]\nd = 0\nfor i in friends:\n if word.count(i) > 0:\n d += word.count(i)\n\nprint(\"YES\" if d == 1 else \"NO\")\n\t\t\t \t\t \t \t \t \t\t \t\t \t\t\t", "a = input()\r\nname = [\"Danil\", \"Olya\", \"Slava\", \"Ann\", \"Nikita\"]\r\ns = 0\r\nfor i in name:\r\n s += a.count(i)\r\nif s == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "def finder(my_string, l):\n\toccurence = []\n\tcounter = 0\n\tfor element in l:\n\t\tfor i in range(len(my_string)):\n\t\t\tif(my_string.startswith(element, i)):\n\t\t\t\tcounter += 1\n\tif counter == 1:\n\t\treturn \"YES\"\n\treturn \"NO\"\n\ncontest_name = input()\nfriends = ['Danil' , 'Olya' , 'Slava' , 'Ann' , 'Nikita']\nprint(finder(contest_name, friends))", "l=[\"Danil\", \"Olya\", \"Slava\", \"Ann\" , \"Nikita\"]\r\ns=input()\r\nz=0\r\ny=0\r\nfor i in l:\r\n \r\n if i in s and (s.count(i))==1:\r\n z=z+1\r\n else:\r\n y=y+s.count(i)\r\n\r\nif (z+y)==1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n = input()\r\ncnt = n.count(\"Danil\")\r\ncnt += n.count(\"Olya\")\r\ncnt += n.count(\"Slava\")\r\ncnt += n.count(\"Ann\")\r\ncnt += n.count(\"Nikita\")\r\nprint(\"YES\" if cnt == 1 else \"NO\")", "'''\r\n\r\n\r\n'''\r\n# m = {\"Danil\":0, \"Olya\":0, \"Slava\":0, \"Ann\":0 ,\"Nikita\":0}\r\n\r\nl = input()\r\nd,o,s,a,n = 0,0,0,0,0\r\ntry:\r\n d = l.count('Danil')\r\nexcept:\r\n d = 0\r\ntry:\r\n o = l.count('Olya')\r\nexcept:\r\n o = 0\r\ntry:\r\n s = l.count('Slava')\r\nexcept:\r\n s = 0\r\ntry:\r\n a = l.count('Ann')\r\nexcept:\r\n a = 0\r\ntry:\r\n n = l.count('Nikita')\r\nexcept:\r\n n = 0\r\n\r\n# print(d,o,s,a,n)\r\nif(d == 1 and o == 0 and s == 0 and a == 0 and n == 0):\r\n print('YES')\r\nelif(d == 0 and o == 1 and s == 0 and a == 0 and n == 0):\r\n print('YES')\r\nelif(d == 0 and o == 0 and s == 1 and a == 0 and n == 0):\r\n print('YES')\r\nelif(d == 0 and o == 0 and s == 0 and a == 1 and n == 0):\r\n print('YES')\r\nelif(d == 0 and o == 0 and s == 0 and a == 0 and n == 1):\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\r\nflag = 0\r\nfor i in range(0, len(s)):\r\n if(i + 5 <= len(s) and s[i:i + 5] == \"Danil\"):\r\n flag += 1\r\n if(i + 3 <= len(s) and s[i:i + 3] == \"Ann\"):\r\n flag += 1\r\n if(i + 4 <= len(s) and s[i:i + 4] == \"Olya\"):\r\n flag += 1\r\n if(i + 6 <= len(s) and s[i:i + 6] == \"Nikita\"):\r\n flag += 1\r\n if(i + 5 <= len(s) and s[i:i + 5] == \"Slava\"):\r\n flag += 1\r\nif(flag == 1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "### Automatically created via \"randomTaskGenerator\" ###\r\n### Link to the task: \"https://codeforces.com/problemset/problem/877/A ###\r\n\r\nnames = ['Danil', 'Olya', 'Slava', 'Ann', 'Nikita']\r\nline = input()\r\n\r\ncounter = 0\r\nfor i in names:\r\n counter += line.count(i)\r\n\r\nif counter == 1:\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\r\narr = ['Danil', 'Olya', 'Slava', 'Ann', 'Nikita']\r\n\r\ncount, count1 = 0, 0\r\n\r\nfor x in range(len(arr)):\r\n if ''.join(s).__contains__(arr[x]):\r\n count += 1\r\n for y in range(len(arr)):\r\n count1 += ''.join(s).count(arr[y], 0, len(s))\r\n\r\n\r\nif count == 1 and count1 == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\nnames=['Danil','Olya','Slava','Ann','Nikita']\r\ntimes=[]\r\nfor i in names:\r\n times.append(s.count(i))\r\nif sum(times)==1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "a = [\"Danil\", \"Olya\", \"Slava\", \"Ann\", \"Nikita\"]\r\ncnt = 0\r\ns = input()\r\nfor i in a:\r\n cnt += s.count(i)\r\nif cnt == 1:\r\n print('YES')\r\nelse:\r\n print('NO')", "a = input()\nx = a.count(\"Slava\") + a.count(\"Ann\") + a.count(\"Nikita\") + a.count(\"Olya\") + a.count(\"Danil\")\nif x == 1:\n print(\"YES\")\nelse:\n print(\"NO\")", "s=input()\na1=s.count(\"Danil\")\na2=s.count(\"Olya\")\na3=s.count(\"Slava\")\na4=s.count(\"Ann\")\na5=s.count(\"Nikita\")\n\nif(a1+a2+a3+a4+a5==1):\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n\t \t \t\t\t \t\t \t \t\t\t\t\t\t\t \t", "names = [\"Danil\", \"Olya\", \"Slava\", \"Ann\", \"Nikita\"]\r\n\r\ns = input()\r\n\r\nn = 0\r\n\r\nfor name in names:\r\n c = s.count(name)\r\n if c > 1:\r\n print(\"NO\")\r\n exit()\r\n if c == 1:\r\n if n == 0:\r\n n += 1\r\n else:\r\n print(\"NO\")\r\n exit()\r\nif n == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s=input()\r\na=int(s.count('Danil'))\r\na+=int(s.count('Olya'))\r\na+=int(s.count('Slava'))\r\na+=int(s.count('Ann'))\r\na+=int(s.count('Nikita'))\r\nif a==1: print('YES')\r\nelse:print('NO')\r\n", "d=\"Danil\"\r\no= \"Olya\"\r\ns= \"Slava\"\r\na= \"Ann\" \r\nn=\"Nikita\"\r\n\r\ninp=input()\r\n\r\ncnt=0\r\ncnt=cnt+inp.count(d)\r\ncnt=cnt+inp.count(o)\r\ncnt=cnt+inp.count(s)\r\ncnt=cnt+inp.count(a)\r\ncnt=cnt+inp.count(n)\r\n\r\nif(cnt==1):\r\n print('YES')\r\nelse:\r\n print('NO')", "\ndef main():\n s = input()\n s = s.replace(\"_\",\"\")\n friends = [\"Danil\", \"Olya\", \"Slava\", \"Ann\", \"Nikita\"]\n count = 0\n for friend in friends:\n\n count += s.count(friend)\n\n if count > 1:\n break\n if count == 1:\n print(\"YES\")\n else:\n print(\"NO\")\nif __name__ == '__main__':\n main()\n", "import re\r\ns='Danil|Olya|Slava|Ann|Nikita'\r\nprint('YES' if len(re.findall(s, input()))==1 else 'NO')", "word = input()\nd=\"Danil\"\no=\"Olya\"\ns=\"Slava\"\na=\"Ann\"\nn=\"Nikita\"\none = 0\ntwo =0\nthree=0\nfour=0\nfive=0\none=word.count(d)\ntwo=word.count(o)\nthree=word.count(s)\nfour=word.count(a)\nfive=word.count(n)\n# print(one,two,three,four,five)\nl=[one,two,three,four,five]\n# print(l)\ncount=0\nfor i in l:\n if i>0:\n count+=i\nif count==0:\n print(\"NO\")\nif count==1:\n print(\"YES\") \nif count>=2:\n print(\"NO\") \n# print(count) ", "s = input()\r\nl = [\"Danil\", \"Olya\", \"Slava\", \"Ann\", \"Nikita\"]\r\nif (s.count(l[0]) == 1 and s.count(l[1]) == 0 and s.count(l[2]) == 0 and s.count(l[3]) == 0 and s.count(l[4]) == 0):\r\n print(\"YES\")\r\nelif (s.count(l[1]) == 1 and s.count(l[0]) == 0 and s.count(l[2]) == 0 and s.count(l[3]) == 0 and s.count(l[4]) == 0):\r\n print(\"YES\")\r\nelif (s.count(l[2]) == 1 and s.count(l[1]) == 0 and s.count(l[0]) == 0 and s.count(l[3]) == 0 and s.count(l[4]) == 0):\r\n print(\"YES\")\r\nelif (s.count(l[3]) == 1 and s.count(l[1]) == 0 and s.count(l[2]) == 0 and s.count(l[0]) == 0 and s.count(l[4]) == 0):\r\n print(\"YES\")\r\nelif (s.count(l[4]) == 1 and s.count(l[1]) == 0 and s.count(l[2]) == 0 and s.count(l[3]) == 0 and s.count(l[0]) == 0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import re\r\nx=re.split('Danil|Olya|Slava|Ann|Nikita',input())\r\nif len(x)==2:print('YES')\r\nelse:print('NO')", "f = ['Danil', 'Olya','Slava', 'Ann', 'Nikita']\r\ns = input()\r\ncnt = 0\r\nfor x in f:\r\n cnt += s.count(x)\r\nif cnt == 1:\r\n print('YES')\r\nelse:\r\n print('NO')", "'''\n\nWelcome to GDB Online.\nGDB online is an online compiler and debugger tool for C, C++, Python, Java, PHP, Ruby, Perl,\nC#, VB, Swift, Pascal, Fortran, Haskell, Objective-C, Assembly, HTML, CSS, JS, SQLite, Prolog.\nCode, Compile, Run and Debug online from anywhere in world.\n\n'''\nx=0\ns = input()\nc=s.count(\"Danil\")+s.count(\"Olya\")+s.count(\"Slava\")+s.count(\"Nikita\")+s.count(\"Ann\")\n \n \n \nif(c==1):\n print(\"YES\")\nelse:\n print(\"NO\")", "def solve(string):\n\n n = len(string)\n\n count = 0\n\n i = 0\n\n while i <= n-5:\n subStr = string[i: i+5]\n\n if subStr== \"Danil\" or subStr == \"Slava\":\n count+=1\n i+=5\n \n else: i+=1\n \n i = 0\n while i <= n-6:\n subStr = string[i: i+6]\n\n if subStr== \"Nikita\":\n count+=1\n i+=6\n \n else: i+=1\n \n i = 0\n while i <= n-4:\n subStr = string[i: i+4]\n\n if subStr== \"Olya\":\n count+=1\n i+=4\n \n else: i+=1\n \n i = 0\n while i <= n-3:\n subStr = string[i: i+3]\n\n if subStr== \"Ann\":\n count+=1\n i+=3\n \n else: i+=1\n \n\n\n if count== 1: return \"YES\"\n\n return \"NO\"\n\n\n\nstring = input()\n\nprint(solve(string))", "s=input()\r\nans=0\r\nans+=s.count(\"Danil\")\r\nans+=s.count( \"Olya\")\r\nans+=s.count(\"Slava\")\r\nans+=s.count(\"Ann\")\r\nans+=s.count(\"Nikita\")\r\nprint(\"YES\" if ans==1 else \"NO\" )\r\n", "n = input()\r\nlis = [\"Danil\", \"Olya\", \"Slava\", \"Ann\", \"Nikita\"]\r\nsu = 0\r\nfor i in lis:\r\n su += n.count(i)\r\nif su != 1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "s = input()\nl = len(s)\n\nc1, c2, c3, c4, c5 = 0, 0, 0, 0, 0\n\nfor i in range(l-5+1):\n\tif(s[i:i+5]==\"Danil\"):\n\t\tc1+=1\nfor i in range(l-4+1):\n\tif(s[i:i+4]==\"Olya\"):\n\t\tc2+=1\nfor i in range(l-5+1):\n\tif(s[i:i+5]==\"Slava\"):\n\t\tc3+=1\nfor i in range(l-3+1):\n\tif(s[i:i+3]==\"Ann\"):\n\t\tc4+=1\nfor i in range(l-6+1):\n\tif(s[i:i+6]==\"Nikita\"):\n\t\tc5+=1\n\nif(c1+c2+c3+c4+c5 == 1):\n\tprint(\"YES\")\n\nelse:\n\tprint(\"NO\")\n\t\t\t\t \t \t \t\t \t\t\t\t \t", "word = input()\r\ncount = [0,0,0,0,0]\r\nfor i in range(len(word)-4):\r\n if (word[i:i+5] == \"Danil\"):\r\n count[0]+=1\r\nfor i in range(len(word)-3):\r\n if (word[i:i+4] == \"Olya\"):\r\n count[1]+=1\r\nfor i in range(len(word)-4):\r\n if (word[i:i+5] == \"Slava\"):\r\n count[2]+=1\r\nfor i in range(len(word)-2):\r\n if (word[i:i+3] == \"Ann\"):\r\n count[3]+=1\r\nfor i in range(len(word)-5):\r\n if (word[i:i+6] == \"Nikita\"):\r\n count[4]+=1\r\nif(count[0]+count[1]+count[2]+count[3]+count[4] == 1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nnames = [\"Danil\", \"Olya\", \"Slava\", \"Ann\", \"Nikita\"]\r\nprint(\"YES\" if sum([s.count(i) for i in names])==1 else \"NO\")", "\r\ndef gcd(a,b):\r\n while(b>0):\r\n r=a%b\r\n a=b\r\n b=r\r\n return a \r\n\r\n\r\n\"\"\"\r\ninp=lambda:map(int,input().split())\r\nx,y=inp()\r\n\r\na,b=inp()\r\n\r\n\r\n\r\nr=a-(2*(x>a)-1)\r\nq=b-(2*(y>b)-1)\r\n\r\nprint(2*max(abs(x-r),2)+2*max(abs(y-q),2))\r\n\"\"\"\r\n\r\ns=input()\r\narr=list([\"Danil\", \"Olya\", \"Slava\", \"Ann\", \"Nikita\"])\r\n\r\nsum=0\r\nfor i in range(5):\r\n sum+=s.count(arr[i])\r\n\r\nif(sum>1 or sum==0): print(\"NO\");\r\nelse: print(\"YES\");\r\n\r\n\r\n\r\n", "# author: violist\n# created: 29.08.2021 14:15:39\n\nimport sys\ninput = sys.stdin.readline\n\ns = input()[:-1]\nn = len(s)\nfriends = ['Danil', 'Olya', 'Slava', 'Ann', 'Nikita']\nok = 1\nfound = 0\nfor i in range(5):\n if (friends[i] in s):\n if (s.count(friends[i]) > 1):\n ok = 0\n break\n if (found):\n ok = 0\n break\n found = 1\nif (ok and found):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "s=input()\r\ns1=[\"Danil\",\"Olya\",\"Slava\",\"Ann\",\"Nikita\"]\r\nsum=0\r\nfor i in range(len(s1)):\r\n sum+=(s.count(s1[i]))\r\nif sum==0 or sum>1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "friends = [\"Danil\",\"Olya\",\"Slava\",\"Ann\",\"Nikita\"]\r\ns = input()\r\nd = 0\r\nfor i in friends:\r\n d += s.count(i)\r\nprint(\"YES\" if d==1 else \"NO\")", "a = str(input())\r\nb1 = a.count('Danil')\r\nb2 = a.count('Olya')\r\nb3 = a.count('Slava')\r\nb4 = a.count('Ann')\r\nb5 = a.count('Nikita')\r\nif (b1 == 1 or b2 == 1 or b3 == 1 or b4 == 1 or b5 == 1) and (b1 + b2 + b3 + b4 + b5 == 1):\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\r\ndanil = \"Danil\"\r\nolya = \"Olya\"\r\nslava = \"Slava\"\r\nann = \"Ann\"\r\nnikita = \"Nikita\"\r\nfriend = 0\r\ns += \"eeeeeeee\"\r\nfor i in range(len(s)):\r\n if s[i:i + 5] == danil:\r\n friend += 1\r\n elif s[i:i + 4] == olya:\r\n friend += 1\r\n elif s[i:i + 5] == slava:\r\n friend += 1\r\n elif s[i:i + 3] == ann:\r\n friend += 1\r\n elif s[i:i + 6] == nikita:\r\n friend += 1\r\nif friend == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\narr = \"Danil, Olya, Slava, Ann, Nikita\".split(', ')\r\nc = 0\r\nf = True\r\nfor i in arr:\r\n if i in s:\r\n c +=1\r\n if s.count(i) > 1:\r\n f = False\r\n \r\n\r\nprint(\"YES\" if c == 1 and f else \"NO\")", "# Problema disponivel em: https://codeforces.com/problemset/problem/877/A\r\n\r\ns = input()\r\nacc = 0\r\nnames ={\"Danil\",\"Olya\",\"Slava\",\"Ann\",\"Nikita\"}\r\nfor i in range(len(s)):\r\n for j in range(i+1,len(s)+1):\r\n if s[i:j] in names:\r\n acc+=1\r\nif acc == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") \r\n ", "from sys import stdin\r\nfrom collections import defaultdict\r\n\r\nrd = stdin.readline\r\n\r\ns = rd().strip()\r\n\r\nd = s.count('Danil')\r\no = s.count('Olya')\r\nsl = s.count('Slava')\r\na = s.count('Ann')\r\nn = s.count('Nikita')\r\n\r\nif d + o + sl + a + n == 1: print(\"YES\")\r\nelse: print(\"NO\")\r\n", "s = input()\r\n\r\nsum = 0\r\nsum += s.count('Danil')\r\nsum += s.count('Olya')\r\nsum += s.count('Slava')\r\nsum += s.count('Ann')\r\nsum += s.count('Nikita')\r\n\r\nif sum == 1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n ", "def word_count_in_str(string, keyword):\r\n return len(string.split(keyword))-1\r\n\r\n\r\nif __name__ == '__main__':\r\n a = input()\r\n ans = 0\r\n ans += word_count_in_str(a, \"Danil\")\r\n ans += word_count_in_str(a, \"Olya\")\r\n ans += word_count_in_str(a, \"Slava\")\r\n ans += word_count_in_str(a, \"Ann\")\r\n ans += word_count_in_str(a, \"Nikita\")\r\n if ans == 1:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\n\r\n", "x=input()\r\nc=0\r\n\r\n\r\n\r\nc += x.count(\"Danil\")\r\nc += x.count(\"Olya\")\r\nc += x.count(\"Slava\")\r\nc += x.count(\"Ann\")\r\nc += x.count(\"Nikita\")\r\nif c==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import re\r\n\r\ns = input()\r\n\r\na = [m.start() for m in re.finditer('Nikita', s)]\r\nb = [m.start() for m in re.finditer('Danil', s)]\r\nc = [m.start() for m in re.finditer('Slava', s)]\r\nd = [m.start() for m in re.finditer('Olya', s)]\r\ne = [m.start() for m in re.finditer('Ann', s)]\r\n\r\nif(len(a)+len(b)+len(c)+len(d)+len(e)) == 1:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "s=input()\r\nl=[\"Danil\", \"Olya\", \"Slava\", \"Ann\",\"Nikita\"]\r\ncount=0\r\nif(any(i in s for i in l)):\r\n for i in l:\r\n if(i in s):\r\n count+=1\r\n if(count>1 or s.count(i)>1):\r\n print(\"NO\")\r\n exit(0)\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n ", "n=input()\r\nif (n.count(\"Danil\")+n.count(\"Olya\")+n.count(\"Slava\")+n.count(\"Ann\")+n.count(\"Nikita\")==1):\r\n print (\"YES\")\r\nelse:\r\n print (\"NO\")", "# import atexit\r\n# import io\r\n# import sys\r\n#\r\n# buff = io.BytesIO()\r\n# sys.stdout = buff\r\n#\r\n# @atexit.register\r\n# def write():\r\n# sys.__stdout__.write(buff.getvalue())\r\na = str(input())\r\n\r\n\r\ndef num_str(whole, key):\r\n idx = whole.find(key)\r\n if idx < 0:\r\n return -1\r\n idx2 = whole.rfind(key)\r\n if idx == idx2:\r\n return 1\r\n else:\r\n return 2\r\n\r\n\r\nnames = [\"Danil\", \"Olya\", \"Slava\", \"Ann\", \"Nikita\"]\r\ncnt = 0\r\nfor name in names:\r\n num = num_str(a, name)\r\n if num != -1:\r\n cnt += num\r\n\r\nif cnt != 1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n\r\n", "s = input()\r\n\r\nans = 0\r\nfor x in [\"Danil\", \"Olya\", \"Slava\", \"Ann\", \"Nikita\"]:\r\n ans += s.count(x)\r\n\r\nif ans == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "texto = input()\na, b, c, d, e = texto.count('Danil'), texto.count('Olya'), texto.count('Slava'), texto.count('Ann'), texto.count('Nikita')\n\nif(a>1 or b>1 or c>1 or d>1 or e>1 or a+b+c+d+e>1 or a+b+c+d+e==0):\n\tprint('NO')\nelse:\n\tprint('YES')\n\n", "s = input()\r\nc = 0\r\nlist = [\"Danil\", \"Olya\", \"Slava\", \"Ann\",\"Nikita\"]\r\nfor i in range(len(list)):\r\n if list[i] in s:\r\n c = c + s.count(list[i])\r\nif c == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\n\r\na = ['Danil', 'Olya', 'Slava', 'Ann','Nikita']\r\n\r\nk = 0\r\nfor i in a:\r\n k += s.count(i)\r\nif k == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import re\nprint('YES' if len(re.findall(r'Danil|Olya|Slava|Ann|Nikita', input())) == 1 else 'NO')\n", "s=input()\r\nc=0\r\nta=[\"Danil\", \"Olya\", \"Slava\", \"Ann\",\"Nikita\"]\r\nfor i in ta:\r\n if i in s:\r\n c+=1\r\n if s.count(i)>1:\r\n c=10\r\n break\r\nif c==1:\r\n print('YES')\r\nelse:\r\n print('NO')", "a = input()\r\nk = 0\r\nk += a.count(\"Danil\") \r\nk += a.count(\"Olya\") \r\nk += a.count(\"Slava\") \r\nk += a.count(\"Ann\") \r\nk += a.count(\"Nikita\") \r\nif k == 1:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "s = input()\nd = s.count('Danil')\no = s.count('Olya')\nsl = s.count('Slava')\na = s.count('Ann')\nn = s.count('Nikita')\nif (d+o+sl+a+n == 1):\n print('YES')\nelse:\n print('NO')\n\t \t \t \t\t\t \t \t\t \t", "s = str(input())\r\ncnt = 0\r\n\r\nfor i in range(len(s)):\r\n if (s[i:i+5] == \"Danil\") or (s[i:i+4] == \"Olya\") or (s[i:i+5] == \"Slava\") or (s[i:i+3] == \"Ann\") or (s[i:i+6] == \"Nikita\"):\r\n cnt += 1\r\n \r\nprint(\"YES\" if cnt == 1 else \"NO\")", "str = input()\r\nans = 0\r\nnames = ['Nikita', 'Ann', 'Slava','Olya','Danil']\r\nfor i in range(len(names)):\r\n s = str.find(names[i])\r\n if s >= 0:\r\n ans += 1\r\n if str.find(names[i], s+1) != -1:\r\n ans += 1\r\n \r\nif ans == 1:\r\n print('YES')\r\nelse:\r\n print('NO')", "nome = input()\namigos = (\"Danil\", \"Olya\", \"Slava\", \"Ann\", \"Nikita\")\ntotal = (nome.count(a) for a in amigos)\nif sum(total) == 1: print(\"YES\")\nelse: print(\"NO\")\n\t\t\t\t \t \t\t \t\t \t\t\t \t", "f = [\"Danil\", \"Olya\", \"Slava\", \"Ann\", \"Nikita\"]\r\ng = input()\r\nif sum([g.count(_) for _ in f]) == 1:\r\n print(\"Yes\")\r\n exit()\r\nprint(\"No\")\r\n", "s = input()\r\na = ['Danil', 'Olya', 'Slava', 'Ann', 'Nikita']\r\nq = 0\r\nfor i in a:\r\n q += s.count(i)\r\nif q == 1:\r\n print(\"YES\")\r\nelse:\r\n print('NO')", "s = input()\n\none = False\nmore = False\n\nfor f in [\"Danil\", \"Olya\", \"Slava\", \"Ann\", \"Nikita\"]:\n try:\n li = s.index(f)\n ri = s.rindex(f)\n if li == ri and not one:\n one = True\n else:\n more = True\n break\n except:\n pass\n\nprint(\"YES\" if one and not more else \"NO\")\n \n", "import sys\r\n\r\ninp = sys.stdin.readlines(); ii = 0\r\n\r\nout = []\r\n\r\nname = inp[ii]\r\nii += 1\r\n\r\nlst = ['Danil', 'Olya', 'Slava', 'Ann', 'Nikita']\r\n\r\ncnt = 0\r\n\r\nfor x in lst:\r\n cnt += name.count(x)\r\n\r\nif cnt == 1:\r\n sys.stdout.write(\"YES\")\r\nelse:\r\n sys.stdout.write(\"NO\")\r\n\r\n\r\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nif __name__ == '__main__':\r\n inp = input()\r\n co = 0\r\n if 'Danil' in inp:\r\n co += inp.count('Danil')\r\n if 'Olya' in inp:\r\n co += inp.count(\"Olya\")\r\n if 'Slava' in inp:\r\n co += inp.count(\"Slava\")\r\n if 'Ann' in inp:\r\n co += inp.count(\"Ann\")\r\n if 'Nikita' in inp:\r\n co += inp.count(\"Nikita\")\r\n print(\"YES\" if co == 1 else \"NO\")\r\n", "problem = input().strip()\nnames = ['Danil', 'Olya', 'Slava', 'Ann', 'Nikita']\ncount = 0\nfor index in range(len(problem)):\n for name in names:\n if problem[index:].startswith(name):\n count += 1\nif count == 1:\n print('YES')\nelse:\n print('NO')\n", "s=input()\r\nname=[\"Danil\", \"Olya\", \"Slava\", \"Ann\", \"Nikita\"]\r\nyes=False\r\nfor i in name:\r\n if s.count(i)==1 and not yes: yes=True\r\n elif i in s and yes:\r\n yes=False\r\n break\r\n elif s.count(i)>1: break\r\nif yes:print(\"YES\")\r\nelse: print(\"NO\")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Oct 28 22:25:02 2017\r\n\r\n@author: Paras\r\n\"\"\"\r\n\r\na=input()\r\n\r\nif (a.count('Danil')==1 and a.count('Olya')==a.count('Slava')==a.count('Ann')==a.count('Nikita')==0) or (a.count('Olya')==1 and a.count('Danil')==a.count('Slava')==a.count('Ann')==a.count('Nikita')==0) or (a.count('Slava')==1 and a.count('Olya')==a.count('Danil')==a.count('Ann')==a.count('Nikita')==0) or (a.count('Ann')==1 and a.count('Olya')==a.count('Slava')==a.count('Danil')==a.count('Nikita')==0) or (a.count('Nikita')==1 and a.count('Olya')==a.count('Slava')==a.count('Ann')==a.count('Danil')==0):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "l=['Danil','Olya','Slava','Ann','Nikita']\r\ns=str(input())\r\nd=s.count(l[0])+s.count(l[1])+s.count(l[2])+s.count(l[3])+s.count(l[4])\r\nif(d==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n", "n = input()\r\nl = [\"Danil\", \"Olya\", \"Slava\", \"Ann\", \"Nikita\"]\r\nd = {\"Danil\":0, \"Olya\":0, \"Slava\":0, \"Ann\":0, \"Nikita\":0}\r\n\r\nfor s in l:\r\n d[s] = n.count(s)\r\n\r\nc = 0\r\nfor s in l:\r\n if d[s] > 1:\r\n print('NO')\r\n exit()\r\n c += d[s]\r\n \r\nif c == 1:\r\n print('YES')\r\nelse:\r\n print('NO')", "line = input()\n\ndanil = line.count(\"Danil\")\nolya = line.count(\"Olya\")\nslava = line.count(\"Slava\")\nann = line.count(\"Ann\")\nnikita = line.count(\"Nikita\")\n\nif danil == 1 and olya == 0 and slava == 0 and ann == 0 and nikita == 0:\n print(\"YES\")\nelif danil == 0 and olya == 1 and slava == 0 and ann == 0 and nikita == 0:\n print(\"YES\")\nelif danil == 0 and olya == 0 and slava == 1 and ann == 0 and nikita == 0:\n print(\"YES\")\nelif danil == 0 and olya == 0 and slava == 0 and ann == 1 and nikita == 0:\n print(\"YES\")\nelif danil == 0 and olya == 0 and slava == 0 and ann == 0 and nikita == 1:\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()\r\nprint('YES' if sum(s.count(n) for n in [\"Danil\", \"Olya\", \"Slava\", \"Ann\", \"Nikita\"]) == 1 else 'NO')", "Names, Check, Temp = ['Danil', 'Olya', 'Slava', 'Ann', 'Nikita'], [0] * 5, input()\r\nfor i in range(5): Check[i] = Temp.count(Names[i])\r\nprint(\"YES\" if sum(Check) == 1 else \"NO\")\r\n\r\n# Come together for getting better !!!!\r\n", "s = input()\r\n \r\nprint('Yes' if sum([s.count(el) for el in ('Danil', 'Olya', 'Slava', 'Ann', 'Nikita')]) == 1 else 'No')", "s=input()\r\nprint('YES'if s.count('Danil')+s.count('Olya')+s.count('Slava')+s.count('Ann')+s.count('Nikita')==1 else'NO')", "string = input()\nnames = [\"Danil\", \"Olya\", \"Slava\", \"Ann\", \"Nikita\"]\nnumber = 0\nfor name in names:\n number += string.count(name)\n \nif number == 1:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "s = input()\r\na = s.count('Danil')\r\nb = s.count('Olya')\r\nc = s.count('Slava')\r\nd = s.count('Nikita')\r\ne = s.count('Ann')\r\nif(a==1 and b==0 and c==0 and d==0 and e==0):\r\n print('YES')\r\nelif (a == 0 and b == 1 and c == 0 and d == 0 and e==0):\r\n print('YES')\r\nelif(a==0 and b==0 and c==1 and d==0 and e==0):\r\n print('YES')\r\nelif(a==0 and b==0 and c==0 and d==1 and e==0):\r\n print('YES')\r\nelif(a==0 and b==0 and c==0 and d==0 and e==1):\r\n print('YES')\r\nelse:\r\n print('NO')", "string=input()\r\nnames=['Danil','Olya','Slava','Ann','Nikita']\r\ncount=0\r\nfor i in names:\r\n count+=string.count(i)\r\nif(count==1):\r\n print(\"YES\")\r\nelse:\r\n print('NO')", "s=input()\r\nif '_' in s:\r\n s=s.replace('_','')\r\nc=0\r\n#print(s)\r\n\"\"\"if 'Danil' in s:\r\n c+=1\r\nif 'Olya' in s:\r\n c+=1\r\nif 'Slava' in s:\r\n c+=1\r\nif 'Ann' in s:\r\n c+=1\r\nif 'Nikita' in s:\r\n c+=1\r\nif c==1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\"\"\"\r\nl=['Danil','Olya','Slava','Ann','Nikita']\r\nc=0\r\nfor el in l:\r\n c+=s.count(el)\r\nif c==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "s=str(input())\r\n\r\nam=[\"Danil\",\"Olya\",\"Slava\",\"Ann\",\"Nikita\"]\r\n\r\n\r\nans=0\r\nfor ss in am:\r\n\tj=len(ss)\r\n\tfor i in range(len(s)-j+1):\r\n\t\tif s[i:i+j]==ss:\r\n\t\t\tans+=1\r\nif ans==1:print(\"YES\")\r\nelse:print(\"NO\")", "s=input().strip()\r\nl=['Danil', 'Olya', 'Slava', 'Ann', 'Nikita']\r\nl1=[0,0,0,0,0]\r\nfor i in range(5):\r\n x=0\r\n j=0\r\n while (x!=-1):\r\n x=s[j:].find(l[i])\r\n if (x!=-1):\r\n l1[i]+=1\r\n j+=(x+len(l[i]))\r\nif (l1.count(1)==1 and l1.count(0)==4):\r\n print ('YES')\r\nelse:\r\n print ('NO')\r\n", "def count_overlapping_substrings(haystack, needle):\r\n count = 0\r\n i = -1\r\n while True:\r\n i = haystack.find(needle, i+1)\r\n if i == -1:\r\n return count\r\n count += 1\r\ncount = 0\r\ns = input()\r\nfor name in ['Danil', 'Olya', 'Slava', 'Ann' , 'Nikita']:\r\n count += count_overlapping_substrings(s, name)\r\nif count == 1:\r\n print('YES')\r\nelse:\r\n print('NO')", "#http://codeforces.com/problemset/problem/877/A\nname = input()\ndCount = name.count(\"Danil\")\nnCount = name.count(\"Nikita\")\noCount = name.count(\"Olya\")\nsCount = name.count(\"Slava\")\naCount = name.count(\"Ann\")\nans = dCount +nCount+ oCount+ sCount+aCount\nif(ans == 1):\n\tprint (\"YES\")\nelse:\n\tprint(\"NO\")", "s= str(input())\r\nn = int ( len(s))\r\ncnt= int(0)\r\nfor i in range(n):\r\n\tif(i<= n-6):\r\n\t\tif(s[i]=='D' and s[i:i+5]=='Danil'):cnt+=1\r\n\t\telif(s[i]=='O' and s[i:i+4]=='Olya'):cnt+=1\r\n\t\telif(s[i]=='S' and s[i:i+5]=='Slava'):cnt+=1\r\n\t\telif(s[i]=='A' and s[i:i+3]=='Ann'):cnt+=1\r\n\t\telif(s[i]=='N' and s[i:i+6]=='Nikita'):cnt+=1\r\n\telif(i<=n-5):\r\n\t\tif(s[i]=='D' and s[i:i+5]=='Danil'):cnt+=1\r\n\t\telif(s[i]=='S' and s[i:i+5]=='Slava'):cnt+=1\r\n\t\telif(s[i]=='A' and s[i:i+3]=='Ann'):cnt+=1\r\n\t\telif(s[i]=='O' and s[i:i+4]=='Olya'):cnt+=1\r\n\telif(i<=n-4):\r\n\t\tif(s[i]=='A' and s[i:i+3]=='Ann'):cnt+=1\r\n\t\telif(s[i]=='O' and s[i:i+4]=='Olya'):cnt+=1\r\n\telif(i<=n-3):\r\n\t\tif(s[i]=='A' and s[i:i+3]=='Ann'):cnt+=1\r\n\t\t\r\n\t\t\r\n\t\t\r\nif(cnt==1):print(\"Yes\")\r\nelse: print(\"No\")\r\n\r\n\r\n\r\n\t\r\n", "import re\r\nif len(re.findall('Danil|Olya|Slava|Ann|Nikita', input())) == 1:\r\n print(\"YES\")\r\nelse: print(\"NO\")\r\n\r\n\r\n", "import sys\n\n\nfr = [\"Danil\", \"Olya\", \"Slava\", \"Ann\", \"Nikita\"]\n\nstr_s = sys.stdin.readline().strip(\"\\n\")\nstr_list = str_s.split(\"_\")\n\ncnt = 0\nfor one in fr:\n for i in range(len(str_s)):\n if one == str_s[i:i+len(one)]:\n cnt += 1\n\nif cnt == 1:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\n\t \t \t \t\t \t \t\t\t \t", "q = input()\r\nd,o=q.count('Danil'),q.count('Olya')\r\ns,a,n=q.count('Slava'),q.count('Ann'),q.count('Nikita')\r\nfrom sys import exit\r\nif d==1 and o==0 and s==0 and a==0 and n==0:print('YES');exit()\r\nif d==0 and o==1 and s==0 and a==0 and n==0:print('YES');exit()\r\nif d==0 and o==0 and s==1 and a==0 and n==0:print('YES');exit()\r\nif d==0 and o==0 and s==0 and a==1 and n==0:print('YES');exit()\r\nif d==0 and o==0 and s==0 and a==0 and n==1:print('YES');exit()\r\nprint('NO')", "txt = input()\r\nname = (\"Danil\", \"Olya\", \"Slava\", \"Ann\",\"Nikita\")\r\nc = 0\r\nfor i in name:\r\n if i in txt:\r\n c+= txt.count(i)\r\nif c==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\na = s.count(\"Danil\")\r\nb = s.count(\"Olya\")\r\nc= s.count(\"Slava\")\r\nd = s.count(\"Ann\")\r\ne = s.count(\"Nikita\")\r\nif a == 1 and b==0 and c==0 and d==0 and e==0:\r\n print(\"YES\")\r\nelif b==1 and a==0 and c==0 and d==0 and e==0:\r\n print(\"YES\")\r\nelif c==1 and a==0 and b==0 and d==0 and e==0:\r\n print(\"YES\")\r\nelif d == 1 and a==0 and b==0 and c==0 and e==0:\r\n print(\"YES\")\r\nelif e==1 and a==0 and b==0 and c==0 and d==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "q = input()\nd = ['Ann', 'Danil','Olya','Slava','Nikita']\nz = 0\nfor i in range(5):\n h = q.find(d[i])\n b = q.rfind(d[i])\n if h == b and h >= 0:\n z += 1\n elif h != b:\n print('NO')\n break\nelse:\n if z != 1:\n print('NO')\n else:\n print('YES')\n", "s1 = input()\r\nl1 = [\"Danil\", \"Olya\", \"Slava\", \"Ann\", \"Nikita\"]\r\nc = []\r\nfor i in l1:\r\n c.append(s1.count(i))\r\nif sum(c) == 1:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "str=input()\r\ncount=str.count(\"Danil\")+str.count(\"Olya\")+str.count(\"Slava\")+str.count(\"Nikita\")+str.count(\"Ann\") \r\nprint(\"YES\" if count == 1 else \"NO\")", "s=input()\r\nl=[\"Danil\",\"Olya\",\"Slava\",\"Ann\",\"Nikita\"]\r\nc=0\r\nfor i in range(len(l)):\r\n t=l[i]\r\n for j in range(len(s)-len(t)+1):\r\n if s[j:len(t) + j]==t:\r\n c+=1\r\nif c==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "l=input()\r\no=[\"Danil\",\"Olya\",\"Slava\",\"Ann\",\"Nikita\"]\r\nif l.count(\"Danil\")+l.count(\"Olya\")+l.count(\"Slava\")+l.count(\"Ann\")+l.count(\"Nikita\")==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "str1=input()\r\nif str1.count(\"Danil\")+str1.count(\"Olya\")+str1.count(\"Slava\")+str1.count(\"Ann\")+str1.count(\"Nikita\")==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "##a = list(map(int, input().split()))\r\n##print(' '.join(map(str, res)))\r\n\r\ns = input()\r\nn = len(s)\r\n\r\nnames = [\"Danil\", \"Olya\", \"Slava\", \"Ann\", \"Nikita\"]\r\ncnt = 0\r\nfor name in names: \r\n for i in range(n):\r\n if i+len(name) <= n and s[i:i+len(name)] == name:\r\n cnt += 1\r\nif cnt == 1:\r\n print('YES')\r\nelse:\r\n print('NO')", "s = str(input())\r\n\r\nD = s.count(\"Danil\")\r\nO = s.count(\"Olya\")\r\nS = s.count(\"Slava\")\r\nA = s.count(\"Ann\")\r\nN = s.count(\"Nikita\")\r\nif (D+O+S+A+N == 1):\r\n print(\"yes\")\r\nelse:\r\n print(\"No\")", "import sys,math\r\nfrom collections import deque\r\nimport random\r\n#input = sys.stdin.buffer.readline\r\n\r\n\r\n# def solve():\t\r\n# \treturn;\r\n\r\n\r\n# for _ in range(int(input())):\r\n# \tsolve()\r\n\r\ns = input()\r\n\r\nl = [\"Danil\", \"Olya\", \"Slava\", \"Ann\", \"Nikita\"]\r\n\r\ncnt = 0\r\nfor x in l:\r\n\tfor i in range(len(s)):\r\n\t\tif s[i:len(x)+i] == x:\r\n\t\t\tcnt+=1\r\n\r\nif cnt==1:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "\nimport sys\ndef get_single_int ():\n return int (sys.stdin.readline ().strip ())\ndef get_string ():\n return sys.stdin.readline ().strip ()\ndef get_ints ():\n return map (int, sys.stdin.readline ().strip ().split ())\ndef get_list ():\n return list (map (int, sys.stdin.readline ().strip ().split ()))\n\n#code starts here\ns = get_string ()\nar =[ \"Danil\", \"Olya\", \"Slava\", \"Ann\", \"Nikita\"]\nc = 0\nfor i in ar:\n c += s.count (i)\nif c == 1:\n print (\"YES\")\nelse:\n print (\"NO\")\n", "n=input()\r\na=n.count(\"Danil\")\r\nb=n.count(\"Olya\")\r\nc=n.count(\"Slava\")\r\nd=n.count(\"Ann\")\r\ne=n.count(\"Nikita\")\r\nsum=a+b+c+d+e\r\nif sum==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "names=['Danil','Olya','Slava','Ann','Nikita']\r\ns=input()\r\nc=0\r\nfor w in names:\r\n c+=s.count(w)\r\n if c>1:\r\n break\r\nprint('NO' if c!=1 else 'YES')\r\n", "'''\r\nAuthor: Sofen Hoque Anonta\r\n'''\r\n\r\nimport re\r\nimport sys\r\nimport math\r\nimport itertools\r\nimport collections\r\n\r\ndef inputArray(TYPE= int):\r\n return [TYPE(x) for x in input().split()]\r\n\r\n\r\ndef solve():\r\n friend = ['Danil', \"Olya\", \"Slava\", \"Ann\", \"Nikita\"]\r\n\r\n patt = re.compile('|'.join(friend))\r\n\r\n s = input()\r\n\r\n\r\n found = patt.findall(s)\r\n\r\n if len(found) == 1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n # sys.stdin= open('F:/input.txt')\r\n solve()\r\n", "judul = input()\r\nnama = [\"Danil\", \"Olya\", \"Slava\", \"Ann\", \"Nikita\"]\r\ncek = 0\r\nada = []\r\n\r\nfor i in range(0, 5):\r\n ada.append(judul.count(nama[i]))\r\n cek = cek + ada[i]\r\n\r\nif cek == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\nd=s.count(\"Danil\")\r\no=s.count(\"Olya\")\r\na=s.count(\"Ann\")\r\nn=s.count(\"Nikita\")\r\nl=s.count(\"Slava\")\r\nif((d+o+a+n+l)==1):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "string = input().strip()\ndef solution(string):\n answer = [\"Danil\", \"Olya\", \"Slava\", \"Ann\",\"Nikita\"]\n res = 0\n L = len(string)\n for i in range(L):\n for j in range(len(answer)):\n if i + len(answer[j]) > L:\n continue\n if string[i:min(i+len(answer[j]),L)] == answer[j]:\n res += 1\n if res > 1:\n return False\n return res==1\nif solution(string):\n print(\"YES\")\nelse:\n print(\"NO\")\n \t\t \t \t\t \t\t \t \t \t \t \t\t \t\t", "str=input()\r\nc=str.count('Danil')+str.count('Olya')+str.count('Slava')+str.count('Ann')+str.count('Nikita')\r\nif c==1:\r\n print('YES')\r\nelse:\r\n print('NO')", "a=input()\r\nyu=0\r\nb=a.count(\"Danil\")\r\nc=a.count(\"Olya\")\r\nd=a.count(\"Slava\")\r\nf=a.count(\"Ann\")\r\nh=a.count(\"Nikita\")\r\nyu=b+c+d+f+h\r\nif yu==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n \r\n", "n = input()\r\nD = \"Danil\"\r\nO = \"Olya\"\r\nS = \"Slava\"\r\nA = \"Ann\"\r\nN = \"Nikita\"\r\nlens = 0\r\nfor i in range(len(n)):\r\n if n[i] == \"D\":\r\n if(n[i:i+5] == D):\r\n lens += 1\r\n elif n[i] == \"O\":\r\n if n[i:i+4] == O:\r\n lens += 1\r\n elif n[i] == \"S\":\r\n if n[i:i+5] == S:\r\n lens += 1\r\n elif n[i] == \"A\":\r\n if n[i:i+3] == A:\r\n lens += 1\r\n elif n[i] == \"N\":\r\n if n[i:i+6] == N:\r\n lens += 1\r\nif lens == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\na=\"Danil\"\r\nb=\"Olya\"\r\nc= \"Slava\"\r\nd=\"Ann\"\r\ne=\"Nikita\"\r\nco = s.count(a) + s.count(b) + s.count(c) + s.count(d) + s.count(e)\r\nif(co==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "name = [\"Danil\", \"Olya\", \"Slava\", \"Ann\", \"Nikita\"]\n\ns = input()\na = [s, s, s, s, s]\nok = True\n\ncnt = 0\n\nfor i in range(5):\n\ta[i] = a[i].split(name[i])\n\tif(len(a[i]) != 1):\n\t\tcnt += 1\n\tif(len(a[i]) > 2):\n\t\tok = False\n\nif(ok and cnt == 1):\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n", "n = input()\r\ncount = 0\r\ncount += n.count(\"Danil\")\r\ncount += n.count(\"Olya\")\r\ncount += n.count(\"Slava\")\r\ncount += n.count(\"Ann\")\r\ncount += n.count(\"Nikita\")\r\n\r\nif count == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a=str(input())\r\nz=a.count('Danil')\r\nx=a.count('Olya')\r\nc=a.count('Slava')\r\nv=a.count('Ann')\r\nb=a.count('Nikita')\r\nif z+x+c+v+b==1:\r\n print('YES')\r\nelse:print('NO')\r\n", "a=input()\r\nk=0\r\nfor i in range(len(a)-4):\r\n if a[i:i+5]=='Danil':\r\n k=k+1\r\nfor i in range(len(a)-3):\r\n if a[i:i+4]=='Olya':\r\n k=k+1\r\nfor i in range(len(a)-4):\r\n if a[i:i+5]=='Slava':\r\n k=k+1\r\nfor i in range(len(a)-2):\r\n if a[i:i+3]=='Ann':\r\n k=k+1\r\nfor i in range(len(a)-5):\r\n if a[i:i+6]=='Nikita':\r\n k=k+1\r\nif k==1:\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\r\nn1 = s.count('Danil')\r\nn2 = s.count('Olya')\r\nn3 = s.count('Slava')\r\nn4 = s.count('Ann')\r\nn5 = s.count('Nikita')\r\nif n1+n2+n3+n4+n5 == 1:\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\r\nfound = False\r\nnames = {\"Danil\":0, \"Olya\":0, \"Slava\":0, \"Ann\":0, \"Nikita\":0}\r\nfor i in range(len(s)):\r\n for j in range(i + 1, len(s)+1):\r\n if s[i:j] in names:\r\n names[s[i:j]] += 1\r\ntotal = 0\r\nfor v in names.values():\r\n total += v\r\nprint('YES' if total == 1 else 'NO')", "s = input()\r\ncnt = 0\r\nfor c in \"Danil\", \"Olya\", \"Slava\", \"Ann\",\"Nikita\": cnt += s.count(c)\r\nprint(\"YES\" if cnt == 1 else \"NO\")", "\r\nimport re\r\ns = 'Danil|Olya|Slava|Ann|Nikita'\r\nprint('YES' if len(re.findall(s,input()))==1 else 'NO')", "s = input()\r\nn = len(s)\r\ncount = 0\r\na = 'Danil'\r\nb = 'Olya'\r\nc = 'Slava'\r\nd = 'Ann'\r\ne = 'Nikita'\r\nfor i in range(n-4):\r\n if s[i:i+5] == a or s[i:i+5] == c:\r\n count += 1\r\nfor j in range(n-3):\r\n if s[j:j+4] == b:\r\n count += 1\r\nfor x in range(n-2):\r\n if s[x:x+3] == d:\r\n count += 1\r\nfor k in range(n-5):\r\n if s[k:k+6] == e:\r\n count += 1\r\nif count == 1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s = input()\r\nbank = [\"Danil\", \"Olya\", \"Slava\", \"Ann\", \"Nikita\"]\r\nct = 0\r\nfor i in bank:\r\n ct += s.count(i)\r\n \r\nprint(\"YES\" if ct == 1 else \"NO\")", "friends = ['Danil', 'Olya', 'Slava', 'Ann', 'Nikita']\r\ns = input()\r\n\r\ni = 0\r\nfor friend in friends:\r\n\ti += s.count(friend)\r\n\r\nprint('YES' if i == 1 else 'NO')", "import re\n\nnames = [\"Danil\", \"Olya\", \"Slava\", \"Ann\", \"Nikita\"]\n\nline = input().strip()\n\nprev_found = False\nyes = False\n\nfor name in names:\n count = line.count(name)\n\n if count > 1:\n yes = False\n break\n\n if count == 1:\n if prev_found:\n yes = False\n break\n prev_found = True\n yes = True\n\nif yes:\n print('YES')\nelse:\n print('NO')\n\n \t\t \t \t \t\t\t \t \t\t \t \t", "word = input()\r\nnms = [\"Danil\", \"Olya\", \"Slava\", \"Ann\" , \"Nikita\"]\r\nprint([\"NO\",\"YES\"][sum(word.count(nm) for nm in nms ) == 1]) ", "s = input()\ncount = 0\nfor s1 in ['Danil', 'Olya', 'Slava', 'Ann', 'Nikita']:\n count += s.count(s1)\n\nprint('YES' if count == 1 else 'NO')\n", "c = ['Danil', 'Olya', 'Slava', 'Ann', 'Nikita']\r\nl = input()\r\nprint('YES' if sum(l.count(x) for x in c) == 1 else 'NO')", "d,s=0,input()\r\nl=[\"Danil\", \"Olya\", \"Slava\", \"Ann\",\"Nikita\"]\r\nfor i in range(len(s)):\r\n if s[i]=='D' and s[i:i+5]==l[0]:\r\n d+=1\r\n elif s[i]=='O' and s[i:i+4]==l[1]:\r\n d+=1\r\n elif s[i]=='S' and s[i:i+5]==l[2]:\r\n d+=1\r\n elif s[i]=='A' and s[i:i+3]==l[3]:\r\n d+=1\r\n elif s[i]=='N' and s[i:i+6]==l[4]:\r\n d+=1\r\n if d>1:\r\n break\r\nif d==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=str(input())\r\na=s.count(\"Danil\")\r\nb=s.count(\"Olya\")\r\nc=s.count(\"Ann\")\r\nd=s.count(\"Slava\")\r\ne=s.count(\"Nikita\")\r\nif a==b==c==d==e==0:\r\n print(\"NO\")\r\nelif a+b+c+d+e==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s=input()\r\nprint('YES' if s.count('Danil')+s.count('Olya')+s.count('Slava')+s.count('Ann')+s.count('Nikita')==1 else 'NO')", "#https://codeforces.com/problemset/problem/877/A\nl=[ \"Danil\", \"Olya\", \"Slava\", \"Ann\" , \"Nikita\"]\ns=input()\nc=0\nfor i in l:\n\tc+=s.count(i)\nprint('YES' if c==1 else 'NO')\n", "# http://codeforces.com/problemset/problem/877/A\r\n\r\ndef count_in(smstr):\r\n\tfriends = ['Danil', 'Olya', 'Slava', 'Ann', 'Nikita']\r\n\tcountm = 0\r\n\tfor x in friends:\r\n\t\tcountm += smstr.count(x)\r\n\treturn countm\r\n\r\ndef main():\r\n\tinp = input()\r\n\tf1 = count_in(inp)\r\n\tif f1 == 1:\r\n\t\treturn \"YES\"\r\n\treturn \"NO\"\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\tprint(main())\r\n\t# input()\r\n", "s = input()\r\nprint(\"YES\" if s.count(\"Danil\") + s.count(\"Olya\" ) + s.count(\"Slava\") + s.count(\"Ann\") + s.count(\"Nikita\") == 1 else \"NO\")\r\n", "names = [\"Danil\", \"Olya\", \"Slava\", \"Ann\", \"Nikita\"]\n\ns = input()\ncount : int = 0\n\nfor i in names:\n a = s.count(i)\n count += a\n\n# print(count)\nif count == 1:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t\t \t \t \t \t \t \t", "x = input()\r\nr = x.count(\"Danil\") + x.count(\"Olya\") + x.count(\"Slava\") + x.count(\"Ann\") + x.count(\"Nikita\")\r\n\r\nif r==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "#py3com\n#pycom\n#ciphereck\n#t=int(input())\n#n=list(map(int,input().split()))\n#a,b=map(int,input().split())\n#print(n)\n#print(a)\n# n.sort()\n#print(*ans) to print list with spaces without brackets\nfrom math import *\ns=input()\ns=s+\"zzzzzzz\"\na=0\nfor i in range(0,len(s)-5):\n# print(s[i:i+6])\n if s[i:i+5]==\"Danil\" or s[i:i+4]==\"Olya\" or s[i:i+5]==\"Slava\" or s[i:i+3]==\"Ann\" or s[i:i+6]==\"Nikita\":\n a+=1\nif a==1:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "A = [\"Danil\", \"Olya\", 'Slava', 'Ann' , 'Nikita']\n\ns = input()\nif sum([s.count(i) for i in A]) == 1:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "line = input()\r\nfriends = ['Danil', 'Olya', 'Slava', 'Ann', 'Nikita']\r\ncount = 0\r\n\r\nfor i in range(len(friends)):\r\n count += line.count(friends[i])\r\n if count > 1:\r\n print(\"NO\")\r\n break\r\n\r\nif count == 1:\r\n print(\"YES\")\r\nelif count == 0:\r\n print(\"NO\")# 1689798695.1363091", "q=input()\r\n\r\nif q.count('Olya')+q.count('Danil')+q.count('Slava')+q.count('Nikita')+q.count('Ann')==1:\r\n print (\"YES\")\r\nelse:\r\n print (\"NO\")\r\n", "x = str(input())\n\nans = 0\n\nfor i in range(len(x)-4):\n\tif x[i]=='D' and x[i+1]=='a' and x[i+2]=='n' and x[i+3]=='i' and x[i+4]=='l':\n\t\tans+=1\n\telif x[i]=='S' and x[i+1]=='l' and x[i+2]=='a' and x[i+3]=='v' and x[i+4]=='a':\n\t\tans+=1\nfor i in range(len(x)-5):\t\n\tif x[i]=='N' and x[i+1]=='i' and x[i+2]=='k' and x[i+3]=='i' and x[i+4]=='t' and x[i+5]=='a':\n\t\tans+=1\nfor i in range(len(x)-3):\t\n\tif x[i]=='O' and x[i+1]=='l' and x[i+2]=='y' and x[i+3]=='a':\n\t\tans+=1\nfor i in range(len(x)-2):\t\n\tif x[i]=='A' and x[i+1]=='n' and x[i+2]=='n':\n\t\tans+=1\nif ans==1:\n\tprint ('YES')\nelse:\n\tprint ('NO')", "s=input()\r\ncount=0\r\ncount=s.count(\"Danil\")\r\nif(count<2):\r\n count=count+s.count(\"Olya\")\r\nif(count<2):\r\n count=count+s.count(\"Slava\")\r\nif(count<2):\r\n count=count+s.count(\"Ann\")\r\nif(count<2):\r\n count=count+s.count(\"Nikita\")\r\n \r\nif(count==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "v=[\"Danil\",\"Olya\",\"Slava\",\"Ann\",\"Nikita\"]\r\na=input()\r\nprint('YNEOS'[sum(a.count(x)for x in v)!=1::2])\r\n", "import re\n\ns = input()\nans = re.findall('Danil|Olya|Slava|Ann|Nikita', s)\n\nprint('YES' if len(ans) == 1 else 'NO')\n", "n=input()\r\ncount=0\r\ncount+=n.count(\"Danil\")\r\ncount+=n.count(\"Olya\")\r\ncount+=n.count(\"Slava\")\r\ncount+=n.count(\"Ann\")\r\ncount+=n.count(\"Nikita\")\r\nif count==1:\r\n print('YES')\r\nelse:\r\n print('NO')", "names=['Danil','Olya','Slava','Ann','Nikita']\r\ns=input()\r\nflag=0\r\nfor name in names:\r\n for i in range(len(s)-len(name)+1):\r\n tmp=[]\r\n for j in range(i,i+len(name)):\r\n tmp.append(s[j])\r\n if ''.join(tmp)==name:\r\n flag+=1\r\nif flag==1:\r\n print('YES')\r\nelse:\r\n print('NO')", "st = input()\r\nArr = [st.count(\"Danil\"), st.count(\"Olya\"), st.count(\"Slava\"), st.count(\"Ann\"), st.count(\"Nikita\")]\r\nif sum(Arr) == 1 :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\nc=s.count(\"Danil\")+s.count(\"Olya\")+s.count(\"Slava\")+s.count(\"Nikita\")+s.count(\"Ann\") \r\nprint(\"YES\" if c == 1 else \"NO\")", "name= input()\r\nc=0\r\nif(\"Danil\" in name):\r\n if(name.count('Danil')==1):\r\n c=c+1\r\n else:\r\n c=1000\r\nif(\"Olya\" in name):\r\n if(name.count('Olya')==1):\r\n c=c+1\r\n else:\r\n c=1000\r\nif(\"Slava\" in name):\r\n if(name.count('Slava')==1):\r\n c=c+1\r\n else:\r\n c=1000\r\nif(\"Ann\" in name):\r\n if(name.count('Ann')==1):\r\n c=c+1\r\n else:\r\n c=1000\r\nif(\"Nikita\" in name):\r\n if(name.count('Nikita')==1):\r\n c=c+1\r\n else:\r\n c=1000\r\nif(c==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "names = ('Danil', 'Olya', 'Slava', 'Ann', 'Nikita')\r\ns = input()\r\n\r\ncnt = 0\r\nfor i in range(len(names)):\r\n cnt += s.count(names[i])\r\n\r\nprint(['NO', 'YES'][int(cnt == 1)])\r\n", "\r\n\r\ns=input()\r\nname=[\"Danil\",\"Olya\",\"Slava\",\"Ann\",\"Nikita\"]\r\ncount=0\r\nfor x in name:\r\n\ti=0\r\n\twhile i<len(s)-len(x)+1:\r\n\t\tif s[i:len(x)+i]==x:\r\n\t\t\tcount+=1\r\n\t\t\ti+=len(x)\r\n\t\telse:\r\n\t\t\ti+=1\r\n\tif count>=2:\r\n\t\tbreak\r\nif count==1:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "names = [\"Danil\", \"Olya\", \"Slava\", \"Ann\", \"Nikita\"]\r\ns, cnt = input(), 0\r\nfor i in names:\r\n cnt += s.count(i)\r\n\r\nprint(\"YES\") if cnt == 1 else print(\"NO\")", "# LUOGU_RID: 101713879\ns = input()\r\na = ['Danil', 'Olya', 'Slava', 'Ann', 'Nikita']\r\nprint(sum(s.count(a) for a in a) == 1 and 'YES' or 'NO')", "names=[\"Danil\", \"Olya\", \"Slava\", \"Ann\",\"Nikita\"]\r\n\r\ninp=input()\r\ncnt=0\r\nfor name in names:\r\n cnt+=inp.count(name)\r\nif(cnt==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = str(input())\r\nc = 0\r\nfor i in range(len(s) - 4):\r\n if(s[i:i+5:] == 'Danil'):\r\n c+=1\r\nfor i in range(len(s) - 3):\r\n if(s[i:i+4:] == 'Olya'):\r\n c+=1\r\nfor i in range(len(s) - 4):\r\n if(s[i:i+5:] == 'Slava'):\r\n c+=1\r\nfor i in range(len(s) - 2):\r\n if(s[i:i+3:] == 'Ann'):\r\n c+=1\r\nfor i in range(len(s) - 5):\r\n if(s[i:i+6:] == 'Nikita'):\r\n c+=1 \r\nif(c == 1):\r\n print(\"YES\") \r\nelse:\r\n print(\"NO\") \r\n\r\n\r\n\r\n\r\n", "friends=['Danil','Olya','Slava','Ann','Nikita']\r\ns=str(input())\r\ncounter=0\r\nfor i in range(5):\r\n counter+=s.count(friends[i])\r\nif counter!=1:print('NO')\r\nelse:\r\n print('YES')", "n=input()\r\nc=0\r\nif(n.count('Danil')>=1):\r\n c+=n.count('Danil')\r\nif(n.count('Olya')>=1):\r\n c+=n.count('Olya')\r\nif(n.count('Slava')>=1):\r\n c+=n.count('Slava')\r\nif(n.count('Ann')>=1):\r\n c+=n.count('Ann')\r\nif(n.count('Nikita')>=1):\r\n c+=n.count('Nikita')\r\nif(c==1):\r\n print('YES')\r\nelse:\r\n print('NO')", "a=input()\r\ns=a.split(\"_\")\r\nans=\"\"\r\nflag=0\r\nfor i in s:\r\n ans+=i\r\n\r\nfor i in range(len(ans)):\r\n if a[i:i+5]==\"Danil\" or a[i:i+4]==\"Olya\" or a[i:i+5]==\"Slava\" or a[i:i+3]==\"Ann\" or a[i:i+6]==\"Nikita\":\r\n flag+=1\r\n\r\nif flag==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Sun Jan 28 11:07:54 2018\n\n@author: ankur\n\"\"\"\n\nfriends_list = (\"Danil\", \"Olya\", \"Slava\", \"Ann\" , \"Nikita\" )\n\nst = input()\n\ntotal_cnt = 0\nfor item in friends_list:\n total_cnt += st.count(item)\nprint([\"NO\",\"YES\"][total_cnt == 1])", "s=input()\nc=0\nif \"Danil\" in s:\n c+=1\nif \"Olya\" in s:\n c+=1\nif \"Slava\" in s:\n c+=1\nif \"Ann\" in s:\n c+=1\nif \"Nikita\" in s :\n c+=1\nif c==1:\n if s.count(\"Danil\")==1:\n print('YES')\n elif s.count(\"Olya\")==1:\n print('YES')\n elif s.count(\"Slava\")==1:\n print('YES')\n elif s.count(\"Ann\")==1:\n print('YES')\n elif s.count(\"Nikita\")==1:\n print('YES')\n else:\n print('NO')\nelse:\n print('NO')\n\t\t\t \t\t\t\t\t \t \t \t \t \t\t\t \t \t\t", "s=input()\r\ncnt=0 \r\nl=[\"Danil\", \"Olya\", \"Slava\", \"Ann\",\"Nikita\"] \r\nfor i in l:\r\n if i in s:\r\n cnt+=s.count(i)\r\nif cnt==1:\r\n print('YES')\r\nelse:\r\n print('NO')", "s=input()\r\nn=len(s)\r\nd=0\r\nfor i in range(n):\r\n if(s[i]=='D'):\r\n if(s[i:i+5]=='Danil'):\r\n d+=1\r\n if(s[i]=='O'):\r\n if(s[i:i+4]=='Olya'):\r\n d+=1\r\n if(s[i]=='S'):\r\n if(s[i:i+5]=='Slava'):\r\n d+=1\r\n if(s[i]=='A'):\r\n if(s[i:i+3]=='Ann'):\r\n d+=1\r\n if(s[i]=='N'):\r\n if(s[i:i+6]=='Nikita'):\r\n d+=1\r\nif(d==1):\r\n print('YES')\r\nelse:\r\n print('NO')", "s=input()\r\ncnt=0\r\ncnt = cnt + s.count(\"Danil\")\r\ncnt = cnt + s.count(\"Olya\")\r\ncnt = cnt + s.count(\"Slava\")\r\ncnt = cnt + s.count(\"Ann\")\r\ncnt = cnt + s.count(\"Nikita\")\r\nif (cnt==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\r\na = \"Danil\"\r\nb = \"Olya\"\r\nc = \"Slava\"\r\nd = \"Ann\"\r\ne = \"Nikita\"\r\ncnt = s.count(a)\r\ncnt += s.count(b)\r\ncnt += s.count(c)\r\ncnt += s.count(d)\r\ncnt += s.count(e)\r\nif cnt == 1 :\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")\r\n", "s=input()\na='Danil'\nb='Olya'\nc='Slava'\nd='Ann'\ne='Nikita'\ncnt=0\nif s.count(a):\n\tcnt+=s.count(a)\nif s.count(b):\n\tcnt+=s.count(b)\nif s.count(c):\n\tcnt+=s.count(c)\nif s.count(d):\n\tcnt+=s.count(d)\nif s.count(e):\n\tcnt+=s.count(e)\nif cnt==1:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n", "s=input()\r\nd=0\r\nd=d+s.count(\"Danil\")\r\nd=d+s.count(\"Olya\")\r\nd=d+s.count(\"Ann\")\r\nd=d+s.count(\"Slava\")\r\nd=d+s.count(\"Nikita\")\r\nif(d==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a = input()\r\nif a.count('Danil')+a.count('Olya')+a.count('Slava')+a.count('Ann')+a.count('Nikita') == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "names = ['Danil', 'Olya', 'Slava', 'Ann', 'Nikita']\r\nstring = input()\r\nbool_lst = []\r\nfor i in names:\r\n bool_lst.append(i in string)\r\nable_answer = False\r\nfor name in names:\r\n if string.count(name) > 1:\r\n print('NO')\r\n able_answer = True\r\n break\r\nif able_answer != True:\r\n if bool_lst.count(True) == 1:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "from collections import*\r\ns=input()\r\na=\"Nikita\"\r\nb=\"Danil\"\r\nc=\"Olya\"\r\nd=\"Slava\"\r\ne=\"Ann\"\r\ntot=0\r\nct=0\r\nif a in s:\r\n tot+=1\r\n ct+=s.count(a)\r\nif b in s:\r\n tot+=1\r\n ct+=s.count(b)\r\nif c in s:\r\n tot+=1\r\n ct+=s.count(c)\r\nif d in s:\r\n tot+=1\r\n ct+=s.count(d)\r\nif e in s:\r\n tot+=1\r\n ct+=s.count(e)\r\nif tot==1 and ct==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import re\r\ns = input()\r\nres = len(re.findall('Danil|Olya|Slava|Ann|Nikita',s))\r\nprint('YES' if res == 1 else 'NO')", "friends=[\"Danil\", \"Olya\", \"Slava\", \"Ann\",\"Nikita\"]\r\ns=input()\r\nflag = False\r\nfor friend in friends:\r\n\tif friend in s:\r\n\t\tt=s.replace(friend,'*',1)\r\n\t\tcnt=0;\r\n\t\tfor friend in friends:\r\n\t\t\tif friend in t:\r\n\t\t\t\tcnt+=1\r\n\t\t\t\tbreak\r\n\t\tif(cnt==0):\r\n\t\t\tflag=True\r\nif(flag==True):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n\r\n", "text = str(input())\r\nref = ['Danil', 'Olya', 'Slava', 'Nikita', 'Ann']\r\nres = 0\r\nfor j in range(5):\r\n res += text.count(ref[j])\r\nif res == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s=input()\r\na=\"Danil\"\r\nb=\"Olya\"\r\nc=\"Ann\"\r\nd=\"Nikita\"\r\ne=\"Slava\"\r\nif s.count(a)==1 and s.find(e)==-1 and s.find(a)!=-1 and s.find(b)==-1 and s.find(c)==-1 and s.find(d)==-1:\r\n print(\"YES\")\r\nelif s.count(b)==1 and s.find(e)==-1 and s.find(b)!=-1 and s.find(a)==-1 and s.find(c)==-1 and s.find(d)==-1:\r\n print(\"YES\")\r\nelif s.count(c)==1 and s.find(e)==-1 and s.find(c)!=-1 and s.find(b)==-1 and s.find(a)==-1 and s.find(d)==-1:\r\n print(\"YES\")\r\nelif s.count(d)==1 and s.find(e)==-1 and s.find(d)!=-1 and s.find(b)==-1 and s.find(c)==-1 and s.find(a)==-1:\r\n print(\"YES\")\r\nelif s.count(e)==1 and s.find(a)==-1 and s.find(e)!=-1 and s.find(b)==-1 and s.find(c)==-1 and s.find(a)==-1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\na = s.count('Danil')\nb = s.count('Olya')\nc = s.count('Slava')\nd = s.count('Ann')\ne = s.count('Nikita')\nif a+b+c+d+e != 1:\n\tprint('NO')\nelse:\n\tprint('YES')\n# 1514512662792\n", "names = {\"Danil\",\"Olya\",\"Slava\",\"Ann\",\"Nikita\"}\r\n\r\na = input()\r\nans = 0\r\n\r\nfor i in names:\r\n ans += a.count(i)\r\n\r\nprint(\"YES\" if ans == 1 else \"NO\")", "s = input()\r\nimport sys\r\n\r\nans = 0\r\n\r\nnames = [\"Danil\", \"Olya\", \"Slava\", \"Ann\", \"Nikita\"]\r\nfor item in names:\r\n ans += s.count(item)\r\n\r\nif(ans == 1):\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")\r\n", "s=input()\r\nif s.count(\"Danil\")+s.count(\"Olya\")+s.count(\"Slava\")+s.count(\"Ann\")+s.count(\"Nikita\")==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=input();print('YES' if a.count('Danil') + a.count('Olya') + a.count('Nikita')+ a.count('Ann') + a.count('Slava') == 1 else 'NO') #ejje blaaaa", "s = input().strip()\nres = {}\nres['Danil'] = 0\nres['Olya'] = 0\nres['Slava'] = 0\nres['Ann'] = 0\nres['Nikita']=0\nl = len(s)\nfor i in range(len(s)):\n if i+3 -1 <= l and s[i:i+3] == 'Ann':\n res['Ann']+=1\n if i+4 -1 <= l and s[i:i+4] == 'Olya':\n res['Olya'] +=1\n if i+5 -1 <= l :\n if s[i:i+5] == 'Danil':\n res['Danil'] +=1\n if s[i:i+5] == 'Slava':\n res['Slava'] +=1\n if i+6 -1 <= l and s[i:i+6] == 'Nikita':\n res['Nikita'] +=1\nif res['Danil']+res['Olya']+res['Slava']+res['Ann']+res['Nikita'] ==1 :\n print (\"YES\")\nelse:\n print (\"NO\")\n\t\t \t\t\t\t\t \t \t\t\t \t \t \t", "lst=['Danil','Olya','Slava','Ann','Nikita']\r\nlst2=[]\r\ns=input()\r\nfor i in range(0,5):\r\n c=s.count(lst[i])\r\n lst2.append(c)\r\nn1=0\r\nn0=0\r\nfor i in lst2:\r\n if i==1:\r\n n1+=1\r\n elif i==0:\r\n n0+=1\r\n#print(lst2)\r\nif (n1)==1 and (n0)==4:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "inpt = input()\r\nlistt = ['Danil', 'Olya', 'Slava', 'Ann', 'Nikita']\r\n\r\ncounter = 0\r\nfor i in range (5):\r\n i_count = inpt.count(listt[i])\r\n counter += i_count\r\nif (counter == 1):\r\n print (\"YES\")\r\nelse:\r\n print (\"NO\")\r\n", "import math\r\nt = 1\r\n# t = int(input())\r\nwhile t:\r\n\tt-=1\r\n\ts = input()\r\n\tl = [s.count(\"Danil\"), s.count('Olya'), s.count(\"Slava\"), s.count(\"Ann\"), s.count(\"Nikita\")]\r\n\ta = sum(l)\r\n\tif a == 1: print('YES')\r\n\telse : print('NO') ", "abc = input()\r\nfriends = [\"Danil\", \"Olya\", \"Slava\", \"Ann\", \"Nikita\"]\r\nif abc.count(\"Danil\") + abc.count(\"Olya\") + abc.count(\"Slava\") + abc.count(\"Ann\") + abc.count(\"Nikita\") == 1:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "s = input()\r\nprint(\"YES\" if s.count(\"Danil\")+ s.count(\"Olya\")+ s.count(\"Slava\") + s.count(\"Ann\") + s.count(\"Nikita\") == 1 else \"NO\")", "s = str(input())\r\nnames = ['Danil', 'Olya', 'Slava', 'Ann', 'Nikita']\r\nc = 0\r\nans = 'NO'\r\nfor name in names:\r\n c += s.count(name)\r\nif c == 1:\r\n ans = 'YES'\r\nprint(ans)", "import re\ns=str(input())\nDanil=len(list(re.finditer('Danil',s)))\nOlya=len(list(re.finditer('Olya',s)))\nAnn=len(list(re.finditer('Ann',s)))\nNikita=len(list(re.finditer('Nikita',s)))\nSlava=len(list(re.finditer('Slava',s)))\nif Danil + Olya + Ann + Nikita + Slava == 1:\n print(\"YES\")\nelse:\n print(\"NO\")", "# LUOGU_RID: 113775939\na=input()\r\nif a.count('Danil')+a.count('Olya')+a.count('Slava')+a.count('Ann')+a.count('Nikita')==1:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "n=input()\r\n\r\nq=len(n)\r\n\r\na=0\r\nc=0\r\nwhile a<q:\r\n if n[a]=='D' and (a+4)<q:\r\n if n[a:a+5]=='Danil':\r\n c+=1\r\n a+=5\r\n else:\r\n a+=1 \r\n elif n[a]=='O' and (a+3)<q:\r\n if n[a:a+4]=='Olya':\r\n c+=1\r\n a+=4\r\n else:\r\n a+=1 \r\n elif n[a]=='S' and (a+4)<q:\r\n if n[a:a+5]=='Slava':\r\n c+=1\r\n a+=5\r\n else:\r\n a+=1 \r\n elif n[a]=='A' and (a+2)<q:\r\n if n[a:a+3]=='Ann':\r\n c+=1\r\n a+=3\r\n else:\r\n a+=1 \r\n elif n[a]=='N' and (a+5)<q:\r\n if n[a:a+6]=='Nikita':\r\n c+=1\r\n a+=6\r\n else:\r\n a+=1 \r\n else:\r\n a+=1\r\n #print(a)\r\nif c==1:\r\n print('YES')\r\nelse:\r\n print('NO') ", "s=input()\r\nflag=int(0)\r\nif \"Danil\" in s:\r\n flag+=s.count(\"Danil\")\r\nif \"Olya\" in s:\r\n flag+=s.count(\"Olya\")\r\nif \"Slava\" in s:\r\n flag+=s.count(\"Slava\")\r\nif \"Ann\" in s:\r\n flag+=s.count(\"Ann\")\r\nif \"Nikita\" in s:\r\n flag+=s.count(\"Nikita\")\r\nprint(\"YES\" if flag==1 else \"NO\")\r\n", "s=str(input())\r\nt=0\r\nx=0\r\na=['Danil','Olya','Slava','Ann','Nikita']\r\nfor i in range(0,5):\r\n if s.count(a[i])==1:\r\n for j in range(0,5):\r\n if s.count(a[j])==0:\r\n x+=1\r\n if x==4:\r\n t+=1\r\nif t==1 :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n \r\n", "def solution(name):\n names = [\"Danil\", \"Olya\", \"Slava\", \"Ann\", \"Nikita\"]\n count = 0\n for n in names:\n count += name.count(n)\n return count == 1\n\nname = input()\nprint('YES' if solution(name) else 'NO')\n\t\t\t\t \t\t \t\t\t \t \t \t\t \t \t \t \t \t\t", "s=input()\r\nd=[\"Danil\", \"Olya\", \"Slava\", \"Ann\" ,\"Nikita\"]\r\na=0\r\nfor p in d:\r\n a+=s.count(p)\r\nif a==1:\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "s=input()\r\ni=0\r\nc=0\r\n\r\narray=[\"Danil\", \"Olya\", \"Slava\", \"Ann\" , \"Nikita\"]\r\nwhile(i<len(array)):\r\n if s.find(array[i])>-1:\r\n s=s.replace(array[i],\"+\")\r\n\r\n else:\r\n i+=1\r\n\r\n\r\nfor k in s:\r\n if k=='+':\r\n c+=1\r\n\r\nif c==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "f, s = ['Danil', 'Olya', 'Slava', 'Ann', 'Nikita'], input()\r\nv = [s.count(fi) for fi in f]\r\nprint('YES' if max(v) == 1 and sum(v) == 1 else 'NO')", "s=input()\r\nc1=s.count('Danil')\r\nc2=s.count('Olya')\r\nc3=s.count('Slava')\r\nc4=s.count('Ann')\r\nc5=s.count('Nikita')\r\nif(c1+c2+c3+c4+c5==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\nc=0\nfren = [\"Danil\", \"Olya\", \"Slava\", \"Ann\", \"Nikita\"]\n\nfor name in fren:\n if name in s:\n c += s.count(name)\n\nif (c == 1):\n print(\"Yes\")\nelse:\n print(\"No\") \n \t\t\t \t \t \t\t\t\t\t\t \t \t\t", "s=input()\r\nc=s.count(\"Danil\")+s.count(\"Olya\")+s.count(\"Slava\")+s.count(\"Ann\")+s.count(\"Nikita\")\r\nif c==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\nD=\"Danil\"\r\nO=\"Olya\"\r\nS=\"Slava\"\r\nA=\"Ann\"\r\nN=\"Nikita\"\r\nif s.count(D)==1 and s.count(O)==0 and s.count(S)==0 and s.count(A)==0 and s.count(N)==0:\r\n print(\"YES\")\r\nelif s.count(D)==0 and s.count(O)==1 and s.count(S)==0 and s.count(A)==0 and s.count(N)==0:\r\n print(\"YES\")\r\nelif s.count(D)==0 and s.count(O)==0 and s.count(S)==1 and s.count(A)==0 and s.count(N)==0:\r\n print(\"YES\")\r\nelif s.count(D)==0 and s.count(O)==0 and s.count(S)==0 and s.count(A)==1 and s.count(N)==0:\r\n print(\"YES\")\r\nelif s.count(D)==0 and s.count(O)==0 and s.count(S)==0 and s.count(A)==0 and s.count(N)==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "names = [\"Danil\", \"Olya\", \"Slava\", \"Ann\", \"Nikita\"]\r\ncont = [0,0,0,0,0]\r\ns = input()\r\n\r\nfor j in range(5):\r\n cont[j] = s.count(names[j])\r\n\r\nif max(cont) == 1 and cont.count(1) == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = str(input())\nc = 0\nc += s.count('Danil')\nc += s.count('Olya')\nc += s.count('Slava')\nc += s.count('Ann')\nc += s.count('Nikita')\nif c == 1:\n print('YES')\nelse:\n print('NO')\n", "s=input()\r\na=\"Danil\"\r\nb=\"Olya\"\r\nc=\"Ann\"\r\nd=\"Nikita\"\r\ne=\"Slava\"\r\nj=s.count(a)+s.count(b)+s.count(c)+s.count(d)+s.count(e)\r\nif j==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def main():\r\n s = input()\r\n S = len(s)\r\n\r\n ct = 0\r\n for f in ['Danil', 'Olya', 'Slava', 'Ann', 'Nikita']:\r\n F = len(f)\r\n for i in range(S-F+1):\r\n t = s[i:i+F]\r\n if f == t:\r\n ct += 1\r\n\r\n if ct == 1:\r\n return 'YES'\r\n return 'NO'\r\n\r\nif __name__ == '__main__':\r\n print(main())\r\n", "d = 'Danil'\r\no = 'Olya'\r\ns = 'Slava'\r\na = 'Ann'\r\nn = 'Nikita'\r\nst = input()\r\nm = st.count(d) + st.count(o) + st.count(s) + st.count(a) + st.count(n)\r\nif m == 1:\r\n print('YES')\r\nelse:\r\n print('NO')", "data = [\"Danil\", \"Olya\", \"Slava\", \"Ann\", \"Nikita\"]\nline = input()\n\ncount = 0\nfor name in data:\n count += line.count(name)\nif count == 1:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t \t\t \t\t\t \t\t \t \t\t\t \t\t", "s=input()\r\nd=[]\r\ne=0\r\nf=0\r\nd.append(s.count(\"Danil\"))\r\nd.append(s.count(\"Nikita\"))\r\nd.append(s.count(\"Ann\"))\r\nd.append(s.count(\"Olya\"))\r\nd.append(s.count(\"Slava\"))\r\nfor i in d:\r\n if(i==0):\r\n e=e+1\r\n if(i==1):\r\n f=f+1\r\nif(f==1 and e==4):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ns = list(input().decode().rstrip())\r\nx = [\"Danil\", \"Olya\", \"Slava\", \"Ann\", \"Nikita\"]\r\nc = 0\r\nfor x0 in x:\r\n u = list(x0)\r\n if len(s) < len(u):\r\n continue\r\n for i in range(len(s) - len(u) + 1):\r\n ok = 1\r\n for j in range(len(u)):\r\n if not s[i + j] == u[j]:\r\n ok = 0\r\n break\r\n if ok:\r\n c += 1\r\nans = \"YES\" if c == 1 else \"NO\"\r\nprint(ans)", "string = input()\r\na = string.count(\"Danil\")\r\nb = string.count(\"Olya\")\r\nc = string.count(\"Slava\")\r\nd = string.count(\"Ann\")\r\ne = string.count(\"Nikita\")\r\nif a+b+c+d+e == 1:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "s=[\"Danil\", \"Olya\", \"Slava\", \"Ann\", \"Nikita\"]\r\ns1= input()\r\nl= [x for x in s if x in s1]\r\nc=0\r\nfor i in l:\r\n c+= s1.count(i)\r\n \r\nif c==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\n\r\nans = 0\r\n\r\nfor el in ('Danil', 'Olya', 'Slava', 'Ann', 'Nikita'):\r\n ans += s.count(el)\r\n\r\nprint('Yes' if ans == 1 else 'No')\r\n", "def contest(str1):\r\n\r\n if str1.count('Danil')==1 and str1.count('Olya')==0 and str1.count('Nikita')==0 and str1.count('Slava')==0 and str1.count('Ann')==0:\r\n return True\r\n if str1.count('Danil') == 0 and str1.count('Olya') == 1 and str1.count('Nikita') == 0 and str1.count(\r\n 'Slava') == 0 and str1.count('Ann') == 0:\r\n return True\r\n elif str1.count('Danil') == 0 and str1.count('Olya') == 0 and str1.count('Nikita') == 1 and str1.count(\r\n 'Slava') == 0 and str1.count('Ann') == 0:\r\n return True\r\n elif str1.count('Danil') == 0 and str1.count('Olya') == 0 and str1.count('Nikita') == 0 and str1.count(\r\n 'Slava') == 1 and str1.count('Ann') == 0:\r\n return True\r\n elif str1.count('Danil') == 0 and str1.count('Olya') == 0 and str1.count('Nikita') == 0 and str1.count(\r\n 'Slava') == 0 and str1.count('Ann') == 1:\r\n return True\r\n else:\r\n return False\r\n\r\n\r\n\r\nif contest(input()):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "from collections import Counter\r\nfrom itertools import combinations\r\ns=input()\r\nn=len(s)\r\nann,danil,olya,slava,nikita=0,0,0,0,0\r\nfor i in range(n-2):\r\n if s[i]+s[i+1]+s[i+2]=='Ann':\r\n ann+=1\r\nfor j in range(n-3):\r\n if s[j]+s[j+1]+s[j+2]+s[j+3]=='Olya':\r\n olya+=1\r\nfor k in range(n-4):\r\n if s[k]+s[k+1]+s[k+2]+s[k+3]+s[k+4]=='Danil':\r\n danil+=1\r\n if s[k]+s[k+1]+s[k+2]+s[k+3]+s[k+4]=='Slava':\r\n slava+=1\r\nfor l in range(n-5):\r\n if s[l]+s[l+1]+s[l+2]+s[l+3]+s[l+4]+s[l+5]=='Nikita':\r\n nikita+=1\r\nif ann+danil+olya+slava+nikita==1:\r\n print('YES')\r\nelse:\r\n print('NO')", "s=input()\r\na=s.count(\"Danil\",0,len(s))+s.count(\"Olya\",0,len(s))+s.count(\"Slava\",0,len(s))+s.count(\"Ann\",0,len(s))+s.count(\"Nikita\",0,len(s))\r\nif(a==1):\r\n print(\"YES\")\r\nelif(a!=1):\r\n print(\"NO\")", "problem_name = input().strip()\r\nfriends = [\"Danil\", \"Olya\", \"Slava\", \"Ann\", \"Nikita\"]\r\ncount = 0\r\n\r\nfor friend in friends:\r\n count += problem_name.count(friend)\r\n\r\nif count == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s=input()\r\nl=[ \"Danil\", \"Olya\", \"Slava\", \"Ann\",\"Nikita\"]\r\nif s.count('Danil')+s.count('Olya')+s.count('Slava')+s.count('Ann')+s.count('Nikita')==1:\r\n print('YES')\r\nelse:\r\n print('NO')", "s=input()\r\no=s.count('Olya')\r\nx=s.count('Slava')\r\na=s.count('Ann')\r\nd=s.count('Danil')\r\nn=s.count('Nikita')\r\nif(o+x+a+d+n)==1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "names = [\"Danil\", \"Olya\", \"Slava\", \"Ann\",\"Nikita\"]\r\na = input()\r\ng = sum(a.count(x) for x in names)\r\nprint(\"YES\" if g==1 else 'NO')\r\n", "s = input()\r\nnames = [\"Danil\", \"Olya\", \"Slava\", \"Ann\", \"Nikita\"]\r\n\r\nq = 0\r\nfor n in names:\r\n e = s.count(n)\r\n if e != -1:\r\n q += e\r\n\r\nprint('YES' if q == 1 else 'NO')\r\n", "s=input()\r\nl=[\"Danil\", \"Olya\", \"Slava\", \"Ann\", \"Nikita\"]\r\nn=len(s)\r\n\r\nans=0\r\nfor i in range(n):\r\n for j in range(i,n):\r\n if s[i:j+1] in l:\r\n ans+=1\r\n \r\nif ans==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "names = [\"Danil\", \"Olya\", \"Slava\", \"Ann\", \"Nikita\"]\r\ns = input()\r\ncnt = 0\r\nfor name in names:\r\n\tcnt += s.count(name)\r\nprint(\"YNEOS\"[(cnt!=1)::2])", "s = input()\r\nfri = [ \"Danil\", \"Olya\", \"Slava\", \"Ann\", \"Nikita\"]\r\nans = 0\r\nk =1\r\nfor j in range(5):\r\n for i in range(len(s) - len(fri[j])+1):\r\n s1 = \"\"\r\n for h in range(len(fri[j])):\r\n s1+=s[i+h]\r\n\r\n if s1 == fri[j]:\r\n ans+=1\r\n\r\n\r\nif ans == 1:\r\n print(\"YES\")\r\n\r\nelse:\r\n print(\"NO\")\r\n", "#code forces \"Alex and broken contest\" #keyword implmentation\n#10/25/2017\nimport re\ns = input()\nname = 'Danil|Olya|Slava|Ann|Nikita'\nout = re.findall(name,s)\nprint('YES' if len(out)==1 else 'NO')\n\n\n \n \n \n" ]

[ "import math\nn = int(input())\nans = 1\nwhile int(bin(ans)[2:]) <= n:\n ans += 1\nprint(ans-1)", "__author__ = 'Darren'\r\n\r\n\r\ndef solve():\r\n str_n = input()\r\n len_n = len(str_n)\r\n count = 0\r\n ord_1, ord_2 = ord('1'), ord('2')\r\n for i in range(len_n):\r\n if ord(str_n[i]) >= ord_2:\r\n count += 1 << (len_n - i)\r\n break\r\n elif ord(str_n[i]) == ord_1:\r\n count += 1 << (len_n - i - 1)\r\n else:\r\n pass\r\n else:\r\n count += 1\r\n print(count - 1)\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()", "n = input()\r\ns = \"\"\r\nflag = False\r\nfor c in n:\r\n if flag:\r\n s += \"1\"\r\n continue\r\n if c in [\"0\", \"1\"]:\r\n s += c\r\n else:\r\n s += \"1\"\r\n flag = True\r\ns = int(s, 2)\r\nprint(s)\r\n", "# cook your dish here\r\nn=int(input())\r\ncount=0\r\nx=1 \r\nwhile int(bin(x)[2:])<=n:\r\n count+=1 \r\n x+=1 \r\nprint(count)", "n=int(input())\r\nfor i in range(513):\r\n\tk = bin(i)\r\n\tk = int(k[2:])\r\n\tif n==k:\r\n\t\tprint(i)\r\n\t\tbreak\r\n\telif n<k:\r\n\t\tprint(ans)\r\n\t\tbreak\r\n\tans = i\r\n\t\t", "n = input()\nbin = \"\"\nwas1 = False\nfor d in n:\n if d >= \"1\" or was1:\n bin += \"1\"\n else:\n bin += \"0\"\n if d > \"1\":\n was1 = True\nans = 0\npwr = 1\nfor d in bin[::-1]:\n ans += int(d) * pwr\n pwr *= 2\nprint(ans)", "class solve:\r\n def __init__(self):\r\n n=int(input())\r\n ans=0\r\n for i in range(1,2**10-1):\r\n b=int(bin(i).replace(\"0b\",'0'))\r\n if b<=n:\r\n ans+=1\r\n else:\r\n break\r\n print(ans)\r\n\r\nobj=solve()", "from itertools import product\r\n\r\nl = [\"\".join(map(str, x)) for x in product([0, 1], repeat=10)]\r\nl = l[1:]\r\nl2 = []\r\nfor x in l:\r\n l2.append(x[x.find(\"1\"):])\r\n\r\nans = 0\r\ns = input()\r\nfor x in l2:\r\n if (len(x) < len(s) or len(x) == len(s) and x <= s):\r\n ans += 1\r\nprint(ans)", "num=int(input())\r\nss=[];q=0\r\nfor x in range(1,513):\r\n n=2;N=1;y=0;s=[]\r\n while x!=0:\r\n y=int((x/N)%n);s.append(str(y));x-=N*y;N*=n\r\n s.reverse();ss.append(int((\"\".join(s))))\r\nfor i in ss:\r\n if i<=num:\r\n q+=1\r\nprint(str(q))\r\n", "def main():\n n = int(input())\n for i in range(1, n):\n if int(bin(i)[2:]) > n:\n print(i - 1)\n return\n print(1)\n\n\nif __name__ == '__main__':\n main()\n", "import math,sys;input=sys.stdin.readline;S=lambda:input().rstrip();I=lambda:int(S());M=lambda:map(int,S().split());L=lambda:list(M());mod1=1000000007;mod2=998244353\r\n\r\nn,x = I(), 1\r\nwhile int(bin(x)[2:])<=n:\r\n x+=1\r\n\r\nprint(x-1)", "n=int(input())\r\nm=n\r\nyo=[]\r\nwhile(m!=0):\r\n yo.append(m%10)\r\n m//=10\r\ni=len(yo)-1\r\nwhile(yo[i]<=1 and i>=0):\r\n i-=1\r\nwhile(i>=0):\r\n yo[i]=1\r\n i-=1\r\np=1\r\nans=0\r\nfor i in yo:\r\n ans+=p*i\r\n p*=2\r\nprint(ans)", "import bisect\r\nlol=[]\r\nfor i in range(1,513):\r\n lol.append(int(str(bin(i))[2:]))\r\n#print(lol) \r\nx=int(input())\r\nprint(bisect.bisect(lol,x))", "# Codeforces Beta Round #9 (Div. 2 Only)\n# C. Hexadecimal's Numbers\n\nn = int(input())\n\n\ndef solve():\n if n < 10:\n return 1\n\n length = len(str(n))\n count = 1 << (length - 1)\n\n m = \"\"\n for i, b in enumerate(str(n)):\n if b in \"01\":\n m += b\n else:\n m += \"1\" * (length - i)\n break\n\n return count + int(m[1:], 2)\n\n\nprint(solve())\n", "s = input()\r\nl = len(s)\r\nn = int(s)\r\nx = 2**l-1\r\nsumm = 0\r\nfor i in range(l):\r\n if int(s[i])>1:\r\n break\r\n elif s[i]=='0':\r\n summ += 2**(l-i-1)\r\nprint(x-summ)", "# data = input()\r\n# size = len(data)\r\n# i = 0\r\n# ans = 0\r\n# while i<size and int(data[i])<=1:\r\n# ans += int(data[i]) << (size-i-1)\r\n# i += 1\r\n# while i<size:\r\n# ans += 1 << (size - i - 1)\r\n# i += 1\r\n# print(ans)\r\n\r\ndata = int(input())\r\nfor i in range(1,1<<10):\r\n n = i\r\n a = ''\r\n while n>0:\r\n a+=str(n%2)\r\n n//=2\r\n des = 0\r\n pos = 0\r\n for j in a:\r\n des+=int(j)*10**pos\r\n pos+=1\r\n if des>data:\r\n print(i-1)\r\n break\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\nans = 0\nfor i in range(2**10):\n s = ['0']*10\n for j in range(10):\n if (i >> j) & 1:\n s[j] = '1'\n s = ''.join(s)\n s = int(s)\n if s <= n:\n ans += 1\nprint(ans-1)\n", "x=[1, 10, 11, 100, 101, 110, 111, 1000, 1001, 1010, 1011, 1100, 1101, 1110, 1111, 10000, 10001, 10010, 10011, 10100, 10101, 10110, 10111, 11000, 11001, 11010, 11011, 11100, 11101, 11110, 11111, 100000, 100001, 100010, 100011, 100100, 100101, 100110, 100111, 101000, 101001, 101010, 101011, 101100, 101101, 101110, 101111, 110000, 110001, 110010, 110011, 110100, 110101, 110110, 110111, 111000, 111001, 111010, 111011, 111100, 111101, 111110, 111111, 1000000, 1000001, 1000010, 1000011, 1000100, 1000101, 1000110, 1000111, 1001000, 1001001, 1001010, 1001011, 1001100, 1001101, 1001110, 1001111, 1010000, 1010001, 1010010, 1010011, 1010100, 1010101, 1010110, 1010111, 1011000, 1011001, 1011010, 1011011, 1011100, 1011101, 1011110, 1011111, 1100000, 1100001, 1100010, 1100011, 1100100, 1100101, 1100110, 1100111, 1101000, 1101001, 1101010, 1101011, 1101100, 1101101, 1101110, 1101111, 1110000, 1110001, 1110010, 1110011, 1110100, 1110101, 1110110, 1110111, 1111000, 1111001, 1111010, 1111011, 1111100, 1111101, 1111110, 1111111,10000000, 10000001, 10000010, 10000011, 10000100, 10000101, 10000110, 10000111, 10001000, 10001001, 10001010, 10001011, 10001100, 10001101, 10001110, 10001111, 10010000, 10010001, 10010010, 10010011, 10010100, 10010101, 10010110, 10010111, 10011000, 10011001, 10011010, 10011011, 10011100, 10011101, 10011110, 10011111, 10100000, 10100001, 10100010, 10100011, 10100100, 10100101, 10100110, 10100111, 10101000, 10101001, 10101010, 10101011, 10101100, 10101101, 10101110, 10101111, 10110000, 10110001, 10110010, 10110011, 10110100, 10110101, 10110110, 10110111, 10111000, 10111001, 10111010, 10111011, 10111100, 10111101, 10111110, 10111111, 11000000, 11000001, 11000010, 11000011, 11000100, 11000101, 11000110, 11000111, 11001000, 11001001, 11001010, 11001011, 11001100, 11001101, 11001110, 11001111, 11010000, 11010001, 11010010, 11010011, 11010100, 11010101, 11010110, 11010111, 11011000, 11011001, 11011010, 11011011, 11011100, 11011101, 11011110, 11011111, 11100000, 11100001, 11100010, 11100011, 11100100, 11100101, 11100110, 11100111, 11101000, 11101001, 11101010, 11101011, 11101100, 11101101, 11101110, 11101111, 11110000, 11110001, 11110010, 11110011, 11110100, 11110101, 11110110, 11110111, 11111000, 11111001, 11111010, 11111011, 11111100, 11111101, 11111110, 11111111, 100000000, 100000001, 100000010, 100000011, 100000100, 100000101, 100000110, 100000111, 100001000, 100001001, 100001010, 100001011, 100001100, 100001101, 100001110, 100001111, 100010000, 100010001, 100010010, 100010011, 100010100, 100010101, 100010110, 100010111, 100011000, 100011001, 100011010, 100011011, 100011100, 100011101, 100011110, 100011111, 100100000, 100100001, 100100010, 100100011, 100100100, 100100101, 100100110, 100100111, 100101000, 100101001, 100101010, 100101011, 100101100, 100101101, 100101110, 100101111, 100110000, 100110001, 100110010, 100110011, 100110100, 100110101, 100110110, 100110111, 100111000, 100111001, 100111010, 100111011, 100111100, 100111101, 100111110, 100111111, 101000000, 101000001, 101000010, 101000011, 101000100, 101000101, 101000110, 101000111, 101001000, 101001001, 101001010, 101001011, 101001100, 101001101, 101001110, 101001111, 101010000, 101010001, 101010010, 101010011, 101010100, 101010101, 101010110, 101010111, 101011000, 101011001, 101011010, 101011011, 101011100, 101011101, 101011110, 101011111, 101100000, 101100001, 101100010, 101100011, 101100100, 101100101, 101100110, 101100111, 101101000, 101101001, 101101010, 101101011, 101101100, 101101101, 101101110, 101101111, 101110000, 101110001, 101110010, 101110011, 101110100, 101110101, 101110110, 101110111, 101111000, 101111001, 101111010, 101111011, 101111100, 101111101, 101111110, 101111111, 110000000, 110000001, 110000010, 110000011, 110000100, 110000101, 110000110, 110000111, 110001000, 110001001, 110001010, 110001011, 110001100, 110001101, 110001110, 110001111, 110010000, 110010001, 110010010, 110010011, 110010100, 110010101, 110010110, 110010111, 110011000, 110011001, 110011010, 110011011, 110011100, 110011101, 110011110, 110011111, 110100000, 110100001, 110100010, 110100011, 110100100, 110100101, 110100110, 110100111, 110101000, 110101001, 110101010, 110101011, 110101100, 110101101, 110101110, 110101111, 110110000, 110110001, 110110010, 110110011, 110110100, 110110101, 110110110, 110110111, 110111000, 110111001, 110111010, 110111011, 110111100, 110111101, 110111110, 110111111, 111000000, 111000001, 111000010, 111000011, 111000100, 111000101, 111000110, 111000111, 111001000, 111001001, 111001010, 111001011, 111001100, 111001101, 111001110, 111001111, 111010000, 111010001, 111010010, 111010011, 111010100, 111010101, 111010110, 111010111, 111011000, 111011001, 111011010, 111011011, 111011100, 111011101, 111011110, 111011111, 111100000, 111100001, 111100010, 111100011, 111100100, 111100101, 111100110, 111100111, 111101000, 111101001, 111101010, 111101011, 111101100, 111101101, 111101110, 111101111, 111110000, 111110001, 111110010, 111110011, 111110100, 111110101, 111110110, 111110111, 111111000, 111111001, 111111010, 111111011, 111111100, 111111101, 111111110,111111111,1000000000, 1000000001, 1000000010, 1000000011, 1000000100, 1000000101, 1000000110, 1000000111, 1000001000, 1000001001, 1000001010, 1000001011, 1000001100, 1000001101, 1000001110, 1000001111, 1000010000, 1000010001, 1000010010, 1000010011, 1000010100, 1000010101, 1000010110, 1000010111, 1000011000, 1000011001, 1000011010, 1000011011, 1000011100, 1000011101, 1000011110, 1000011111, 1000100000, 1000100001, 1000100010, 1000100011, 1000100100, 1000100101, 1000100110, 1000100111, 1000101000, 1000101001, 1000101010, 1000101011, 1000101100, 1000101101, 1000101110, 1000101111, 1000110000, 1000110001, 1000110010, 1000110011, 1000110100, 1000110101, 1000110110, 1000110111, 1000111000, 1000111001, 1000111010, 1000111011, 1000111100, 1000111101, 1000111110, 1000111111, 1001000000, 1001000001, 1001000010, 1001000011, 1001000100, 1001000101, 1001000110, 1001000111, 1001001000, 1001001001, 1001001010, 1001001011, 1001001100, 1001001101, 1001001110, 1001001111, 1001010000, 1001010001, 1001010010, 1001010011, 1001010100, 1001010101, 1001010110, 1001010111, 1001011000, 1001011001, 1001011010, 1001011011, 1001011100, 1001011101, 1001011110, 1001011111, 1001100000, 1001100001, 1001100010, 1001100011, 1001100100, 1001100101, 1001100110, 1001100111, 1001101000, 1001101001, 1001101010, 1001101011, 1001101100, 1001101101, 1001101110, 1001101111, 1001110000, 1001110001, 1001110010, 1001110011, 1001110100, 1001110101, 1001110110, 1001110111, 1001111000, 1001111001, 1001111010, 1001111011, 1001111100, 1001111101, 1001111110, 1001111111, 1010000000, 1010000001, 1010000010, 1010000011, 1010000100, 1010000101, 1010000110, 1010000111, 1010001000, 1010001001, 1010001010, 1010001011, 1010001100, 1010001101, 1010001110, 1010001111, 1010010000, 1010010001, 1010010010, 1010010011, 1010010100, 1010010101, 1010010110, 1010010111, 1010011000, 1010011001, 1010011010, 1010011011, 1010011100, 1010011101, 1010011110, 1010011111, 1010100000, 1010100001, 1010100010, 1010100011, 1010100100, 1010100101, 1010100110, 1010100111, 1010101000, 1010101001, 1010101010, 1010101011, 1010101100, 1010101101, 1010101110, 1010101111, 1010110000, 1010110001, 1010110010, 1010110011, 1010110100, 1010110101, 1010110110, 1010110111, 1010111000, 1010111001, 1010111010, 1010111011, 1010111100, 1010111101, 1010111110, 1010111111, 1011000000, 1011000001, 1011000010, 1011000011, 1011000100, 1011000101, 1011000110, 1011000111, 1011001000, 1011001001, 1011001010, 1011001011, 1011001100, 1011001101, 1011001110, 1011001111, 1011010000, 1011010001, 1011010010, 1011010011, 1011010100, 1011010101, 1011010110, 1011010111, 1011011000, 1011011001, 1011011010, 1011011011, 1011011100, 1011011101, 1011011110, 1011011111, 1011100000, 1011100001, 1011100010, 1011100011, 1011100100, 1011100101, 1011100110, 1011100111, 1011101000, 1011101001, 1011101010, 1011101011, 1011101100, 1011101101, 1011101110, 1011101111, 1011110000, 1011110001, 1011110010, 1011110011, 1011110100, 1011110101, 1011110110, 1011110111, 1011111000, 1011111001, 1011111010, 1011111011, 1011111100, 1011111101, 1011111110, 1011111111, 1100000000, 1100000001, 1100000010, 1100000011, 1100000100, 1100000101, 1100000110, 1100000111, 1100001000, 1100001001, 1100001010, 1100001011, 1100001100, 1100001101, 1100001110, 1100001111, 1100010000, 1100010001, 1100010010, 1100010011, 1100010100, 1100010101, 1100010110, 1100010111, 1100011000, 1100011001, 1100011010, 1100011011, 1100011100, 1100011101, 1100011110, 1100011111, 1100100000, 1100100001, 1100100010, 1100100011, 1100100100, 1100100101, 1100100110, 1100100111, 1100101000, 1100101001, 1100101010, 1100101011, 1100101100, 1100101101, 1100101110, 1100101111, 1100110000, 1100110001, 1100110010, 1100110011, 1100110100, 1100110101, 1100110110, 1100110111, 1100111000, 1100111001, 1100111010, 1100111011, 1100111100, 1100111101, 1100111110, 1100111111, 1101000000, 1101000001, 1101000010, 1101000011, 1101000100, 1101000101, 1101000110, 1101000111, 1101001000, 1101001001, 1101001010, 1101001011, 1101001100, 1101001101, 1101001110, 1101001111, 1101010000, 1101010001, 1101010010, 1101010011, 1101010100, 1101010101, 1101010110, 1101010111, 1101011000, 1101011001, 1101011010, 1101011011, 1101011100, 1101011101, 1101011110, 1101011111, 1101100000, 1101100001, 1101100010, 1101100011, 1101100100, 1101100101, 1101100110, 1101100111, 1101101000, 1101101001, 1101101010, 1101101011, 1101101100, 1101101101, 1101101110, 1101101111, 1101110000, 1101110001, 1101110010, 1101110011, 1101110100, 1101110101, 1101110110, 1101110111, 1101111000, 1101111001, 1101111010, 1101111011, 1101111100, 1101111101, 1101111110, 1101111111, 1110000000, 1110000001, 1110000010, 1110000011, 1110000100, 1110000101, 1110000110, 1110000111, 1110001000, 1110001001, 1110001010, 1110001011, 1110001100, 1110001101, 1110001110, 1110001111, 1110010000, 1110010001, 1110010010, 1110010011, 1110010100, 1110010101, 1110010110, 1110010111, 1110011000, 1110011001, 1110011010, 1110011011, 1110011100, 1110011101, 1110011110, 1110011111, 1110100000, 1110100001, 1110100010, 1110100011, 1110100100, 1110100101, 1110100110, 1110100111, 1110101000, 1110101001, 1110101010, 1110101011, 1110101100, 1110101101, 1110101110, 1110101111, 1110110000, 1110110001, 1110110010, 1110110011, 1110110100, 1110110101, 1110110110, 1110110111, 1110111000, 1110111001, 1110111010, 1110111011, 1110111100, 1110111101, 1110111110, 1110111111, 1111000000, 1111000001, 1111000010, 1111000011, 1111000100, 1111000101, 1111000110, 1111000111, 1111001000, 1111001001, 1111001010, 1111001011, 1111001100, 1111001101, 1111001110, 1111001111, 1111010000, 1111010001, 1111010010, 1111010011, 1111010100, 1111010101, 1111010110, 1111010111, 1111011000, 1111011001, 1111011010, 1111011011, 1111011100, 1111011101, 1111011110, 1111011111, 1111100000, 1111100001, 1111100010, 1111100011, 1111100100, 1111100101, 1111100110, 1111100111, 1111101000, 1111101001, 1111101010, 1111101011, 1111101100, 1111101101, 1111101110, 1111101111, 1111110000, 1111110001, 1111110010, 1111110011, 1111110100, 1111110101, 1111110110, 1111110111, 1111111000, 1111111001, 1111111010, 1111111011, 1111111100, 1111111101, 1111111110, 1111111111];n=int(input())\r\nfor i in range(len(x)):\r\n if n<x[i]: print(len(x[0:i]));break", "n=int(input())\r\ndef jinzhi(a):\r\n k=bin(a)\r\n return int(k[2:])\r\ni=1\r\nwhile jinzhi(i)<=n:\r\n i=i+1\r\nprint(i-1)", "class A:\n\n def solve(self):\n [y, w] = [int(x) for x in input().split(\" \")]\n winning_chances = 6 - max(y, w) + 1\n num = winning_chances\n den = 6\n\n for i in range(2, 7):\n if num % i == 0 and den % i == 0:\n num /= i\n den /= i\n\n print(\"{}/{}\".format(int(num), int(den)))\n\nclass B:\n\n def distance_to_university(self, xu, yu, stop):\n import math as m\n return m.sqrt((stop - xu)**2 + yu**2)\n\n def solve(self):\n [n, vb, vs] = [int(x) for x in input().split(\" \")]\n stops = [int(x) for x in input().split(\" \")]\n [xu, yu] = [int(x) for x in input().split(\" \")]\n time_to_stop = [x / vb for x in stops]\n distance = [self.distance_to_university(xu, yu, x) for x in stops]\n time_from_stop_to_uni = [x / vs for x in distance]\n total_time = [t1 + t2 for t1, t2 in zip(time_to_stop, time_from_stop_to_uni)]\n min_index = []\n import sys\n min_time = sys.maxsize\n for i in range(1, len(total_time)):\n if total_time[i] < min_time:\n min_time = total_time[i]\n min_index = [i]\n elif total_time[i] == min_time:\n min_index.append(i)\n\n if len(min_index) > 1:\n closest_index = 0\n closest_distance = sys.maxsize\n for i in min_index:\n if distance[i] < closest_distance:\n closest_distance = distance[i]\n closest_index = i\n print(closest_index + 1)\n else:\n print(min_index[0] + 1)\nclass C:\n\n def solve(self):\n from collections import deque\n n = int(input())\n\n q = deque()\n q.append(1)\n elements_stored = 0\n\n while len(q) != 0:\n e = q.popleft()\n if e > n:\n break\n elements_stored += 1\n q.append(e * 10)\n q.append(e * 10 + 1)\n\n print(elements_stored)\n\nC().solve()\n", "n=int(input())\r\np=1\r\nsum=0\r\nwhile 1:\r\n t=bin(p)[2:]\r\n if eval(t)>n:\r\n break\r\n p+=1\r\n sum+=1\r\nprint(sum)\r\n", "n=int(input())\ndef jinzhi(a):\n k=bin(a)\n return int(k[2:])\ni=1\nwhile jinzhi(i)<=n:\n i=i+1\nprint(i-1) \n\n\t\t \t\t\t\t \t\t\t\t \t\t\t", "l = []\nfor i in range(1,1024):\n l.append(int(bin(i)[2:]))\nn = int(input())\nans = 0\nfor val in l :\n if val <= n :\n ans+=1\n else:\n break\nprint(ans)", "n = int(input())\ncnt = 0\nacc = ['1']\nprev_lvl = ['1']\nfor i in range(len(str(n))-1):\n new_batch = []\n for s in prev_lvl:\n new_batch.append(s + '0')\n new_batch.append(s + '1')\n acc.extend(new_batch)\n prev_lvl = new_batch\n\nsol = [potential for potential in acc if int(potential) <= n]\n# print(sol)\nprint(len(sol))\n", "n = int(input())\r\nc = 0\r\nfor i in range(1, 1024):\r\n b = bin(i)[2:]\r\n if int(b) <= n:\r\n c += 1\r\nprint(c) ", "import sys\r\nfrom collections import *\r\nimport math\r\ninput = sys.stdin.readline\r\narr = list(input().rstrip(\"\\n\"))\r\nn = len(arr)\r\nfor i in range(n):\r\n if arr[i]!='0' and arr[i]!='1':\r\n for j in range(i,n):\r\n arr[j] = '1'\r\narr = \"\".join(arr)\r\nprint(int(arr,2))", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nans = 0\r\npow2 = [1]\r\nfor _ in range(10):\r\n pow2.append(2 * pow2[-1])\r\nm = pow2[10]\r\nfor i in range(1, m):\r\n x = []\r\n for j in range(10):\r\n pj = pow2[j]\r\n x.append(\"1\" if i & pj else \"0\")\r\n if int(\"\".join(x)) <= n:\r\n ans += 1\r\nprint(ans)", "a=int(input())\r\nd=str(a)\r\nb=len(d)\r\ne=1;\r\nif(a<10):\r\n print(1)\r\nelse:\r\n if(int(d[0])==1):\r\n for i in range(b):\r\n if(int(d[i])==1):\r\n e=e+pow(2,b-i-1)\r\n if(int(d[i])>1):\r\n e=e+pow(2,b-i)-1\r\n break\r\n print(e-1);\r\n if(int(d[0])>1):\r\n f=pow(2,b)\r\n print(f-1)", "x = 1\r\nn = int(input())\r\nwhile(int(bin(x)[2:]) <= n):\r\n x+=1\r\nprint(x-1)", "n = int(input())\r\n\r\ns = set([0])\r\nfor i in range(10):\r\n s = set(int(str(i) + \"0\") for i in s) | set(int(str(i) + \"1\") for i in s)\r\n\r\nprint(sum(i <= n for i in s) - 1)\r\n \r\n", "n,x=int(input()),1\r\nwhile int(bin(x)[2:])<=n: x+=1\r\nprint(x-1)", "n=int(input())\r\na=str(n)\r\nif(a[0]!='1'):\r\n ans=2**(len(a))-1\r\n print(ans)\r\nelse:\r\n ans=0\r\n for i in range(1,2**len(a)+1):\r\n check=int(bin(i)[2:])\r\n \r\n if(check<=n):\r\n ans+=1\r\n print(ans)\r\n \r\n", "s = list(input()+'#')\r\nfor i in range(len(s)-1):\r\n if s[i] > '1':\r\n s[i+1] = '2'\r\n s[i] = '1'\r\ns[0] = '1'\r\ns.pop()\r\nprint(int(''.join(s), 2))", "def func(x):\r\n count=0\r\n while x>0:\r\n count+=1\r\n x=x//10\r\n return count\r\nn=int(input())\r\ncount=func(n)\r\nans=pow(2,count)-1\r\nma,p,c=int('1'*count),1,0\r\nwhile ma-c> n:\r\n ans-=1\r\n c= int(bin(p)[2:])\r\n p+=1\r\nprint(ans)\r\n", "n=int(input())\r\ndef gen(j,l):\r\n if j==-1:\r\n return 0\r\n if l%10==1:\r\n return(gen(j-1,l//10)*10+0)\r\n return(l+1)\r\na=1\r\nc=0\r\nwhile a<=n:\r\n c+=1\r\n a=gen(11,a)\r\nprint(c)", "p = 1\n\nfor i, x in enumerate(reversed(input())):\n if int(x) == 1:\n p += 2 ** i\n elif int(x) > 1:\n p = 2 ** (i + 1)\n\nprint(p - 1)\n", "def func(a):\r\n if(len(a)==0):\r\n return 0\r\n if(a[0]==\"0\"):\r\n return func(a[1:])\r\n if(len(a.replace('0',''))==0):\r\n return 0\r\n #print(a)\r\n\r\n b = int(a)\r\n sum = 0;\r\n sum+=2**(len(a)-1)-1\r\n minc=int(a[0])\r\n c1 = 0\r\n for i in range(len(a)):\r\n if(minc>int(a[i])):\r\n minc=int(a[i])\r\n if(a[i]>'1' and minc>0):\r\n sum+=2**(len(a)-1)\r\n return sum\r\n if(a[i]=='0'):\r\n sum+=max(0, (2**(i-1)-1)*2**(len(a)-i))\r\n #print(\"max\",(2**(i-1)-1),(2**(i-2)-1)*2**(len(a)-i))\r\n sum+=func(a[i+1:])+1\r\n #print(\"sum\",sum)\r\n return sum\r\n\r\n sum+=2**(len(a)-1)\r\n return sum\r\na = input()\r\nb = int(a)\r\nprint(func(a))\r\n#sum2=0;\r\n#for i in range(1,b+1):\r\n# if(len(str(i).replace('0','').replace('1',''))==0):\r\n# sum2+=1\r\n#print(sum2)\r\n", "n = int(input());print(len([i for i in range(1,2048) if int(bin(i)[2::]) <= n]))", "import sys\r\n# sys.stdin=open('Python\\input.txt','r')\r\n# sys.stdout=open('Python\\output.txt','w')\r\n\r\n\r\n\r\ndef com(s,n):\r\n i,j=0,0\r\n ans=0\r\n for i in range(0,(1<<n)):\r\n temp=''\r\n for j in range(n):\r\n if i&(1<<j):\r\n temp+='1'\r\n else:\r\n temp+='0'\r\n # print()\r\n temp=int(temp)\r\n \r\n if (temp>0) and (temp<=s):\r\n ans+=1\r\n print(ans)\r\n\r\n\r\ns=input()\r\ncom(int(s),len(s))", "\r\n\r\ndef count_loaded(n, current=1, count=0):\r\n if current > n:\r\n return count\r\n\r\n count += 1\r\n\r\n for candidate in range(2):\r\n count = max(count_loaded(n, current * 10 + candidate, count), count)\r\n \r\n return count\r\n\r\n\r\n\r\n\r\nn = int(input())\r\n\r\nprint(count_loaded(n))\r\n", "n=int(input())\r\nc=0\r\nfor i in range(1,2**10):\r\n a=[int(e) for e in bin(i)[2:][::-1]]\r\n c+=sum(10**i for i in range(len(a)) if a[i])<=n\r\nprint(c)\r\n", "n=int(input())\r\nans=[]\r\ndef count(curr):\r\n #print(curr)\r\n if len(curr)>=len(str(n)):\r\n if 1<=int(curr)<=n and curr not in ans:\r\n ans.append(curr)\r\n return\r\n if int('1'+curr)<=n:\r\n count('1'+curr)\r\n count('0'+curr)\r\ncount('')\r\nprint(len(ans))", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\n\r\ndef recursion(x):\r\n if x > n:\r\n return 0\r\n return 1 + recursion(x * 10) + recursion(x * 10 + 1)\r\n\r\nprint(recursion(1))", "n=input()\r\nx=len(n)\r\ny=2**(x)-1\r\nfor i in range(x):\r\n if(int(n[i])>1):\r\n break\r\n else :\r\n if(n[i]=='0'):\r\n y-=2**(x-i-1)\r\nprint(y)\r\n \r\n \r\n\r\n", "n=input()\r\nl=len(n)\r\nc=0\r\nfor i in range(1,5000):\r\n if int(bin(i)[2:])<=int(n):\r\n c=c+1\r\n else:\r\n break\r\nprint(c) \r\n \r\n \r\n", "n = int(input())\r\ncnt = 0\r\npow_10 = [1]*12\r\nfor i in range(1,12):\r\n pow_10[i] = 10*pow_10[i-1]\r\nfor i in range(512):#2**9 --> 1000000000\r\n num_for_digits = i+1\r\n mul = pow_10[0]\r\n num = 0\r\n j=0\r\n while num_for_digits>0:\r\n num += mul *(num_for_digits&1)\r\n j+=1\r\n mul=pow_10[j]\r\n num_for_digits>>=1\r\n if(num<=n): cnt+=1\r\n else:break\r\nprint(cnt)", "import itertools\r\n\r\n\r\nn = int(input())\r\n\r\nfor i in itertools.count():\r\n j = int(bin(i)[2:])\r\n if j > n: break\r\n\r\nprint(i - 1)\r\n", "n = int(input())\r\n\r\nnums = [1]\r\ni = 0\r\nb = 0\r\nwhile nums[-1] < n:\r\n nums.append(nums[i] * 10 + b)\r\n b = 1 - b\r\n if b == 0:\r\n i += 1\r\n\r\nprint(len(nums) - (nums[-1] > n))", "def main():\n ans = 0\n n = int(input())\n for mask in range(1, 1 << 10):\n s = int(bin(mask)[2:])\n if s <= n:\n ans += 1\n print(ans)\n\nmain()\n", "n = int(input())\r\nnums = -1\r\nfor a in ['0','1']:\r\n for b in ['0','1']:\r\n for c in ['0','1']:\r\n for d in ['0','1']:\r\n for e in ['0','1']:\r\n for f in ['0','1']:\r\n for g in ['0','1']:\r\n for h in ['0','1']:\r\n for i in ['0','1']:\r\n for j in ['0','1']:\r\n s = a + b + c + d + e + f + g + h + i + j\r\n if int(s) <= n:\r\n nums += 1\r\nprint(nums)", "import sys\r\n\r\ninput = int(sys.stdin.readline())\r\n\r\ndef dec_to_bin(dec):\r\n res = 0\r\n bin = []\r\n while dec > 0:\r\n bin.append(dec % 2)\r\n dec = dec // 2\r\n \r\n bin = bin[::-1]\r\n for i in range(len(bin)):\r\n res *= 10\r\n res += bin[i]\r\n \r\n return res\r\n\r\nnum = 0\r\nwhile True:\r\n num += 1\r\n if dec_to_bin(num) > input:\r\n break\r\nprint(num - 1)", "s = input()\r\nfor i in range(2**len(s[1:]), 2**len(s)):\r\n b = bin(i)[2:]\r\n if b > s:\r\n print(i-1)\r\n exit()\r\nprint(2**len(s)-1)", "def sol(n):\r\n if n[0] > '1':\r\n return 2 ** len(n) - 1\r\n elif n == '0': \r\n return 0\r\n elif len(n) == 1: \r\n return 1\r\n return 2 ** (len(n)-1) + sol(str(int(n[1:])))\r\n\r\nn = input()\r\nprint(sol(n))", "import sys, re\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\n\r\nfor i in range(1, 1024):\r\n if int(bin(i)[2:]) > n:\r\n print(i-1)\r\n break", "s=input()\r\nn=int(s)\r\na=len(s)*'0'\r\nf=-1\r\nwhile int(a)<=n:\r\n x=a.rfind('0')\r\n a=a[:x]+'1'+'0'*(len(a)-x-1)\r\n f+=1\r\nprint(f)\r\n", "\nnum = int(input())\n\nans = 0\nfor i in range(1, 1024):\n mod = []\n \n n = i\n while n > 0:\n mod.append(n % 2)\n n = n // 2\n \n mod.reverse()\n r = 0\n for i in range(len(mod)):\n r = 10 * r + mod[i]\n \n if r > num:\n break\n \n ans += 1\n\n\nprint(ans)\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Jun 21 01:02:39 2019\r\n\r\n@author: sj\r\n\"\"\"\r\ndef s(str,a):\r\n a.append(str)\r\n if len(str)>=10:\r\n return a\r\n s(str+'0',a)\r\n s(str+'1',a)\r\n return a\r\nn=int(input())\r\na=[]\r\na=s('1',a)\r\nx=len(a)\r\nans=0\r\nfor i in range(0,x):\r\n if int(a[i])<=n:\r\n \r\n ans+=1\r\nprint(ans)", "def clc(): \r\n n = int(input())\r\n res = 0\r\n for mask in range(1,1025):\r\n number = mask\r\n mul = 1\r\n y = 0\r\n while number:\r\n y = y+ mul*(number&1)\r\n mul*=10\r\n number=number//2\r\n if y<=n:\r\n res+=1\r\n\r\n print(res)\r\n \r\n\r\n return True\r\ncc = clc()\r\n\r\nif not cc :\r\n print(0)\r\n ", "n=input()\r\nr=0\r\nfor i in range(1, 2**9+1):\r\n r+=(int(bin(i)[2:]) <= int(n))\r\nprint(r)\r\n", "n=input().strip()\r\nl=len(n)\r\nans, idx = 0, 0\r\nwhile(idx<l):\r\n if(int(n[idx])>1):\r\n ans+=2**(l-idx)-1\r\n break\r\n elif(int(n[idx])==1):\r\n ans+=2**(l-idx-1)\r\n idx+=1\r\nprint(ans)", "n=input()\r\nx=0\r\nz=0\r\nn1=\"\"\r\nfor i in n:\r\n if int(i)>1:\r\n z=1\r\n if z==0:\r\n n1+=i\r\n else:\r\n n1+='1'\r\nfor n, i in enumerate(n1[::-1]):\r\n if i!='0':\r\n x+=2**n\r\nprint(x)", "import sys\r\nsys_input = sys.stdin.readline\r\n\r\ndef inp():\r\n return int(sys_input())\r\ndef minp():\r\n return map(int,sys_input().split())\r\ndef linp():\r\n return list(map(int,sys_input().split()))\r\ndef inpsl():\r\n return list(input().split())\r\ndef write(s):\r\n sys.stdout.write(s+\" \")\r\n\r\ndef main():\r\n n = inp()\r\n cnt =0\r\n for i in range(1,2**10):\r\n if int(bin(i)[2:]) <= n:\r\n cnt += 1\r\n else:\r\n break\r\n print(cnt)\r\n\r\nmain()", "n=int(input())\r\n \r\na=[]\r\nc=int\r\nfor i in range(515):\r\n a.append(c(bin(i)[2:]))\r\na.remove(0)\r\nans=0\r\nfor i in a:\r\n if i<=n:\r\n ans+=1\r\n\r\nprint(ans)", "def bin_to_dec(x):\r\n l = []\r\n while x:\r\n l.append(x & 1)\r\n x >>= 1\r\n l = list(reversed(l))\r\n for i in l:\r\n x *= 10\r\n x += i\r\n return x\r\n\r\nn = int(input())\r\nans = 0\r\n\r\nfor i in range(1, 1 << 10):\r\n if (bin_to_dec(i) <= n):\r\n ans += 1\r\n else:\r\n break\r\n\r\nprint(ans)\r\n", "def get_binary(num):\r\n \"\"\"\r\n this function gets the maximum binary number\r\n from 1 to num\r\n \"\"\"\r\n flag = False\r\n binary = ''\r\n for char in num:\r\n if(int(char) > 1):\r\n flag = True\r\n if flag:\r\n binary += '1'\r\n else:\r\n binary += char\r\n \r\n return binary\r\n\r\ndef main():\r\n\r\n n = str(input()) \r\n binary = get_binary(n)\r\n print(int(binary, 2))\r\n\r\n\r\n \r\nif __name__ == '__main__':\r\n main()\r\n", "a = list(input())\r\nfor i in range(len(a)):\r\n if a[i]>'1': a[i:] = '1'*(len(a)-i); break\r\nprint(int(''.join(a),2))", "n=int(input())\r\ns=[['1']]\r\nc=0 \r\nfor i in range(10):\r\n for j in range(len(s)):\r\n s.append(s[j]+['0'])\r\n s.append(s[j]+['1'])\r\ns=[''.join(i) for i in s]\r\ns=sorted(list(set([int(i) for i in s]))) \r\nfor i in s:\r\n if i<=n:\r\n c+=1 \r\n else:\r\n break \r\nprint(c)\r\n\r\n ", "a = 1\r\nb = int (input())\r\nwhile (int(bin(a)[2:]) <= b) :\r\n a=a+1\r\nprint(a - 1)", "def f(a, n):\r\n s = list()\r\n s.append('T') if a * 10 <= n else s.append(\"F\")\r\n s.append(\"T\") if a * 10 + 1 <= n else s.append(\"F\")\r\n if s[0] == 'F' or s[1] == 'F':\r\n if s[0] == 'T' or s[1] == 'T':\r\n f.ans += 1\r\n return f.ans\r\n f.ans += 2\r\n f(a * 10, n)\r\n f(a * 10 + 1, n)\r\n\r\nm = int(input())\r\nf.ans = 1\r\nf(1, m)\r\nprint(f.ans)", "L = []; c = 0; n = int(input())\r\nfor i in range(1, 1024): L.append(int(bin(i).replace(\"0b\", \"\") ))\r\nfor x in L:\r\n if x <= n: c+=1\r\n else: break\r\nprint(c)", "n=int(input())\r\ni=1\r\nans=0\r\nwhile True:\r\n lol=int(bin(i)[2:])\r\n if lol<=n:\r\n ans+=1\r\n else:\r\n break\r\n i+=1\r\nprint(ans)\r\n", "n = int(input())\r\nk = pow(2,10) - 1\r\ncount=0\r\ncounter = 1\r\nfor i in range(1,k+1):\r\n counter = '{0:b}'.format(i)\r\n if(int(counter) <= n):\r\n count+=1\r\nprint(count)", "from __future__ import division, print_function\n\nimport os\nimport sys\nfrom io import BytesIO, IOBase\n\n\ndef main():\n # find all the amount of number that contain only 0's and 1's\n # create subsets of binary numbers that are lower of equal to n\n # (in its binary representation)\n\n # n = 100\n # 1 10 11 100\n\n # 235\n # 111\n\n # 56074021\n # 11111111\n\n # 451011102\n # 111111111\n\n # 115531 (0)\n # 111111 (1 << 5)\n # (len 6)\n\n n = input()\n maxBinary = 1 << (len(n) - 1)\n\n for i in range(len(n)):\n digit = int(n[i])\n\n if digit > 1: # set all the remaining digits to 1\n for j in range(i, len(n)):\n maxBinary |= (1 << (len(n) - 1 - j))\n break\n\n elif digit == 1: # set the current digit to the n[i]\n maxBinary |= (1 << (len(n) - 1 - i))\n\n print(maxBinary)\n\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\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\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\n\ndef print(*args, **kwargs):\n \"\"\"Prints the values to a stream, or to sys.stdout by default.\"\"\"\n sep = kwargs.pop(\"sep\", \" \")\n file = kwargs.pop(\"file\", sys.stdout)\n\n atStart = True\n for x in args:\n if not atStart:\n file.write(sep)\n file.write(str(x))\n atStart = False\n file.write(kwargs.pop(\"end\", \"\\n\"))\n\n if kwargs.pop(\"flush\", False):\n file.flush()\n\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\n\nmain()\n\n \t \t \t\t \t \t\t \t \t \t\t\t\t \t\t\t", "original,i = input(),0\nnumber = list(map(int, original))\nbigger = 15\nfor j in range(len(number)):\n\tif number[j] > 1 and j < bigger: bigger = j;\n\tif int(original[j]) > 1: number[j] =1;\n\telif original[j] == \"0\" and bigger < 15: number[j] = 1;\nprint(int(\"\".join(str(x) for x in number),base=2))", "import sys\r\ninput = sys.stdin.readline\r\nI = lambda : list(map(int,input().split()))\r\n\r\n\r\n# Hex nums\r\n#flop [not conv to bin exact :))]\r\nn,=I()\r\nx=[]\r\nfor i in range(1,2**10+1):\r\n\tk=format(i,'b');p=0\r\n\to=len(k)\r\n\tfor j in range(o):\r\n\t\tif k[o-j-1]=='1':\r\n\t\t\tp+=10**(j)\r\n\tx.append(p)\r\nan=0\r\nfor j in range(len(x)):\r\n\tif x[j]>n:\r\n\t\tan=j;break\r\nprint(an)", "n= int(input())\r\nl = []\r\nfor i in range(1,1024):\r\n l.append(int(bin(i)[2:]))\r\nans=0\r\nfor i in l:\r\n if i<=n:\r\n ans+=1\r\nprint(ans)", "x = int(input())\r\n\r\nlo = 0\r\nhi = 10**10\r\n\r\nwhile lo < hi:\r\n mid = (lo + hi + 1) // 2\r\n dead = int(bin(mid)[2:])\r\n if dead > x:\r\n hi = mid - 1\r\n else:\r\n lo = mid\r\n\r\nprint(lo)\r\n", "def to_binary(m):\n j = 1\n digits = 1\n for i in range(1000):\n if j*2 > m:\n break\n j = j * 2\n digits = digits + 1\n \n binaryrep = \"\"\n for i in range(digits):\n if m-j >= 0:\n m = m - j\n j = j/2\n binaryrep = binaryrep + \"1\"\n else:\n binaryrep = binaryrep + \"0\"\n j = j/2\n\n return binaryrep\n\nn = int(input())\nans = 0\nfor i in range(1000):\n c = int(to_binary(i+1))\n if c <= n:\n ans = ans + 1\n if c > n:\n break\nprint(ans)", "n,ans=int(input()),1\r\nwhile int(bin(ans)[2:])<=n:\r\n ans+=1\r\nprint(ans-1)", "import itertools\r\n\r\nimport time\r\ndef timer(f):\r\n def tmp(*args, **kwargs):\r\n t = time.time()\r\n res = f(*args, **kwargs)\r\n print(\"Время выполнения функции: %f\" % (time.time()-t))\r\n return res\r\n\r\n return tmp\r\n\r\n#n = int(input())\r\n\r\ndef realAle(string):\r\n string = string.lstrip('0')\r\n if len(string)==0:\r\n return 1\r\n if string == \"1\":\r\n return 2\r\n if int(string[0])>1:\r\n return 2**len(string)\r\n else:\r\n return (2**(len(string)-1))+realAle(string[1:])\r\n\r\n\r\n\r\ndef real(string):\r\n string = string.lstrip('0')\r\n if len(string)==0:\r\n return 1\r\n if string == \"1\":\r\n return 1\r\n if int(string[0])>1:\r\n return 2**len(string)-1\r\n else:\r\n return (2**(len(string)-1))-1+realAle(string[1:])\r\n\r\n\r\n\r\ndef naive(k):\r\n count = 0\r\n for i in range(1, k+1):\r\n s = str(i)\r\n b = True\r\n for j in range(len(s)):\r\n if s[j]!='0' and s[j]!='1':\r\n b = False\r\n if b:\r\n #print(i)\r\n count+=1\r\n return count\r\n\r\n\r\nfor i in range(1, 1):\r\n if naive(i)!=real(str(i)):\r\n print(i, naive(i), real(str(i)) )\r\n pass\r\n\r\nprint(real(input()))", "\r\n#k=int(input())\r\n#n,m=map(int,input().split())\r\n\r\n#a=list(map(int,input().split()))\r\n\r\n#b=list(map(int,input().split()))\r\n\r\nn=int(input())\r\ncnt=0\r\nfor i in range(1,2**10):\r\n if int(bin(i)[2:])<=n:\r\n cnt+=1\r\n\r\nprint(cnt)", "n = int(input())\r\nk = 0\r\nfor i in range(1, 2 ** 10):\r\n x = int(bin(i)[2:])\r\n if x <= n:\r\n k += 1\r\nprint(k)\r\n", "def main():\r\n n = int(input())\r\n ans = 0\r\n for i in range(1, 2**10-1):\r\n x = int(''.join(list(bin(i))[2:]))\r\n if x <= n:\r\n ans += 1\r\n else:\r\n break\r\n print(ans)\r\n\r\nmain()", "count = 0\nn = int(input())\nfor i in range(1, 514):\n if int(bin(i)[2:]) <= n:\n count += 1\nprint(count)\n\t\t \t \t\t \t \t \t\t \t\t\t \t\t\t\t", "n=int(input())\r\ni=0\r\nfor m in range(2**9):\r\n if(int(bin(m+1)[2:])<=n):\r\n i+=1\r\nprint(i)", "#For fast I/O\r\nimport sys\r\ninput = lambda: sys.stdin.readline().strip()\r\n\r\n#Find the largest binary string that appears and convert it back to decimal\r\n\r\n#Inputs\r\nn = input()\r\nl = len(n)\r\n\r\n#Largest binary string that appears in list form\r\nbin = [1 for i in range(l)]\r\nfor i in range(l):\r\n if int(n[i]) >= 2:\r\n break\r\n else:\r\n bin[i]= int(n[i])\r\n\r\n#Converting the binary string to its numerical value\r\nans = 0\r\nfor i in range(l):\r\n ans += 2**(i) * bin[-i-1]\r\n\r\nprint(ans)\r\n", "a = input()\r\nfor i in range(len(a)):\r\n if a[i] >= '2':\r\n a = a[:i] + '1' * (len(a) - i)\r\n\r\nprint(int(a, 2))", "x=list(map(int,list(input())))\r\ns=''\r\nfor i in range(len(x)):\r\n if x[i]<=1:\r\n s+=str(x[i])\r\n else:\r\n break\r\ns+=\"1\"*(len(x)-len(s))\r\nprint(int(s,2))", "x = 1\nn = int(input())\nwhile(int(bin(x)[2:]) <= n):\n x+=1\nprint(x-1)\n", "n=input()\nl=len(n)\n\nb=''\nfor i in range(l):\n a=int(n[i])\n if a==0:b+='0'\n elif a==1:b+='1'\n elif a>1: \n b+='1'*(l-i)\n break\nans=0\nfor i in range(l):\n ans+=int(b[l-1-i])*(2**i)\nprint(ans)\n\n\n\n", "n=input();lenny=len(n)\r\ncount_=0\r\nfor i in range(lenny):\r\n z=int(n[i])\r\n if z>1:\r\n if lenny-i!=1:\r\n count_+=2**(lenny-i)-1\r\n else:\r\n count_+=1\r\n break\r\n elif z==1:\r\n count_+=2**(lenny -i-1)\r\nprint(count_)", "'''\nAuthor:\nFuad Ashraful Mehmet\nUniversity of Asia Pacific\ndate :28 Jan Dec T20\nCategory:bfs+ds\n'''\ndef totalValid(num): \n if num>n: return 0 \n else: return 1+totalValid(num*10)+totalValid(num*10+1)\nn=int(input())\nprint(totalValid(1))", "from sys import stdin,stdout\r\n# from os import _exit\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\nans = -1\r\nfor i in range(513):\r\n x = int(bin(i)[2:])\r\n if x>n:\r\n break\r\n ans+=1\r\nprint(str(ans)+\"\\n\")\r\n", "n, _n, f = input(), \"\", False\r\nfor i, c in enumerate(n):\r\n if c not in ['1', '0']:\r\n f = True\r\n\r\n if f:\r\n _n += '1'\r\n else:\r\n _n += c if (c == '0') else '1'\r\n\r\nprint(eval(f\"0b{_n}\"))\r\n", "n = int(input())\r\ndef fun(x):\r\n if (int(bin(x)[2:]))<=n:\r\n return 1 \r\n return 0\r\ni = 1 \r\nc = 0\r\nwhile(fun(i)):\r\n c+=1 \r\n i+=1 \r\nprint(c)", "import sys\r\n\r\ninput = int(sys.stdin.readline())\r\nresult = 0\r\n\r\ndef check(num):\r\n global result\r\n if input < num:\r\n return\r\n else:\r\n result += 1\r\n \r\n check(num * 10 + 0)\r\n check(num * 10 + 1)\r\n\r\ncheck(1)\r\n\r\nprint(result)", "'''input\n10\n'''\nfrom sys import stdin\n\n\n# main starts\nn = int(stdin.readline().strip())\ncount = 0\nfor i in range(1, 2 ** 10):\n\tnum = bin(i)\n\tif int(num[2:]) <= n:\n\t\tcount += 1\nprint(count)", "from math import pow\r\ns = input()\r\nn = int(s)\r\nk = list(s)\r\nl = len(k)\r\nm = int(pow(2, l))\r\nnum = []\r\nfor i in range(m):\r\n b = bin(i)\r\n num.append(int(b[2:]))\r\nnum.reverse()\r\nc = 0\r\nwhile c<m:\r\n if n>=num[c]:\r\n break\r\n else:\r\n c+=1\r\nprint(m-1-c)", "import bisect\r\nl=[0,1,10,11]\r\nfor j in range(2,9):\r\n n=len(l)\r\n for i in range(n):\r\n l.append(10**j+l[i])\r\nl.append(10**9)\r\nn=int(input())\r\nj=bisect.bisect_right(l,n)\r\nprint(j-1)", "n = int(input())\r\nans = 0\r\nfor i in range(1, 2**9):\r\n x = int(bin(i)[2:])\r\n if x <= n:\r\n ans += 1\r\nif n == 10**9:\r\n ans += 1\r\nprint(ans)\r\n", "n=str(int(input()))\r\np=len(n)\r\nn_lst=[]\r\nfor char in n:\r\n if int(char)>1:\r\n break\r\n else:\r\n n_lst.append(int(char))\r\nwhile len(n_lst)<p:\r\n n_lst.append(1)\r\n\r\nways=0\r\nfor power,dig in enumerate(n_lst):\r\n exp=p-power-1\r\n if dig==1:\r\n ways+=2**exp\r\nprint(ways)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n \r\n", "n = int( input() )\r\n\r\nm = {}\r\n\r\ndef f( x ):\r\n\r\n if x > n:\r\n return\r\n\r\n if x not in m:\r\n m[x] = 1\r\n\r\n f( x * 10 + 0 )\r\n f( x * 10 + 1 )\r\n\r\nf(1)\r\n\r\nprint( len(m) )", "def hexa(x):\r\n global n \r\n global sum \r\n\r\n if(x*10 <= n):\r\n sum = sum + 1\r\n hexa(x*10)\r\n\r\n if(x*10+1 <= n):\r\n sum = sum + 1\r\n hexa(x*10+1)\r\n\r\nsum = 1\r\nn = 0\r\nn = int(input())\r\nhexa(1)\r\nprint(sum)", "def get_all_binaries(digits):\r\n\tall_binaries = set()\r\n\tdef generate_binary(digits, idx = 0):\r\n\t\tif idx == len(digits):\r\n\t\t\tnumber = int(''.join(digits))\r\n\t\t\t# print(number)\r\n\t\t\tall_binaries.add(number)\r\n\t\t\treturn\r\n\t\tgenerate_binary(digits, idx+1)\r\n\t\tdigits[idx] = '1'\r\n\t\tgenerate_binary(digits, idx+1)\r\n\t\tdigits[idx] = '0'\r\n\t\treturn\r\n\tgenerate_binary(digits)\r\n\treturn all_binaries\r\n\r\nif __name__ == '__main__':\r\n\tn = int(input())\r\n\tdigits = ['0' for i in range(10)]\r\n\tbinaries = get_all_binaries(digits)\r\n\tans = 0\r\n\tbinaries = sorted(binaries)\t\r\n\tfor i in binaries:\r\n\t\tif i <= n and i > 0:\r\n\t\t\t# print(i)\r\n\t\t\tans += 1\r\n\r\n\t# print(binaries)\r\n\tprint(ans)", "n = int(input())\r\ncount = 0\r\nfor i in range(1,2048):\r\n if int(bin(i)[2::]) <= n:\r\n count += 1\r\nprint(count)\r\n\r\n", "def input_int():\r\n return list(map(int, input().split()))\r\n\r\n\r\nnum = input()\r\nc = False\r\nnew = ''\r\nfor i, char in enumerate(num):\r\n if int(char) > 1:\r\n new += '1'\r\n c = True\r\n elif char == '0' and c is True:\r\n new += '1'\r\n else:\r\n new += char\r\n\r\nprint(int(new, 2))\r\n\r\n", "n=input()\nl=\"\"\nfor i in range(len(n)):\n \n if n[i]!='0' and n[i]!='1':\n l+=n[:i]\n l+='1'*(len(n)-i)\n break\n\nif l==\"\":\n print (int(n,2))\nelse:\n print (int(l,2))\n\n\t \t\t\t \t\t \t \t\t\t \t\t\t \t\t \t\t \t", "n=int(input())\r\nprint (max((i for i in range(3000)if int(bin(i)[2:])<=n)))", "\r\ndef count_binary(number_max, n):\r\n if n <= number_max:\r\n return 1 + count_binary(number_max, 10 * n + 1) + count_binary(number_max, 10 * n)\r\n else:\r\n return 0\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n print(count_binary(n, 1))", "n=input()\r\nq=['1']\r\nans=0\r\nwhile(1):\r\n t=q.pop(0)\r\n if(int(t)>int(n)):\r\n break\r\n ans+=1\r\n q.append(t+'0')\r\n q.append(t+'1')\r\nprint(ans)", "n = input()\r\ndef approx(n):\r\n d = '1'\r\n for i in range(1,len(n)):\r\n if (d+'1'+'0'*(len(n)-i-1)) <= n:\r\n d = d+'1'\r\n else:\r\n d = d+'0'\r\n return d\r\n\r\ndef btd(s):\r\n su = 0\r\n exp = len(s)-1\r\n for d in s:\r\n su += int(d)*(2**exp)\r\n exp += -1\r\n return su\r\n\r\nprint(btd(approx(n)))\r\n", "s = input()\r\nct = 2**len(s)-1\r\nfor i in range(0,len(s)):\r\n if int(s[i]) > 1 :\r\n break;\r\n if s[i] == '0':\r\n ct -= 2**(len(s)-i-1)\r\nprint(ct) ", "from sys import stdin,stdout\r\nnmbr=lambda:int(stdin.readline())\r\nlst = lambda: list(map(int,input().split()))\r\ndef binary(mask):\r\n s=0\r\n for i in range(64,-1,-1):\r\n if (mask>>i)&1:s=s*10+1\r\n else:s=s*10\r\n return s\r\n\r\nfor _ in range(1):#nmbr()):\r\n n=nmbr()\r\n a=[]\r\n for mask in range(1,1<<10+1):\r\n a+=[binary(mask)]\r\n l,r=0,len(a)\r\n while l<=r:\r\n mid=(l+r)>>1\r\n if a[mid]<=n:l=mid+1\r\n else:r=mid-1\r\n print(r+1)", "x= int(input())\r\nn = len(str(x))\r\nc=-1\r\nfor i in range(2**n, 2**(n+1)):\r\n a= int(bin(i)[3:])\r\n if a<= x:\r\n c=c+1\r\n\r\nprint(c)\r\n", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\nimport decimal\r\ninput=sys.stdin.readline\r\nn=int(input())\r\nc=0\r\nk1=pow(2,10)\r\nfor i in range(1,k1):\r\n s1=bin(i)[2:]\r\n if(n>=int(s1)):\r\n c+=1\r\n else:\r\n break\r\nprint(c)", "import sys\r\nsys.setrecursionlimit(100000)\r\ndef amediter(s):\r\n global n,inc\r\n if len(s) > 0 and int(s[::-1]) > n:\r\n return\r\n if len(s) > 10:\r\n return\r\n if len(s) > 0 and int(s[::-1]) > 0 and int(s[::-1]) <= n:\r\n inc.add(int(s[::-1],2))\r\n amediter(s+\"1\")\r\n amediter(s+\"0\")\r\n \r\ndef main():\r\n global n,inc\r\n n = int(input())\r\n inc = set()\r\n amediter(\"\")\r\n print(len(inc))\r\nmain()", "import sys\r\nfrom math import sqrt, gcd, ceil, log, floor\r\n# from bisect import bisect, bisect_left\r\nfrom collections import defaultdict, Counter, deque\r\nfrom heapq import heapify, heappush, heappop\r\ninput = sys.stdin.readline\r\nread = lambda: list(map(int, input().strip().split()))\r\n\r\n# sys.setrecursionlimit(200000)\r\n\r\ndef main():\r\n\t# ans_ = []\r\n\tdef f(x):\r\n\t\tans = 0\r\n\t\tarr = [1]\r\n\t\twhile arr:\r\n\t\t\tans += len(arr)\r\n\t\t\ttem = []\r\n\t\t\tfor i in arr:\r\n\t\t\t\tif i*10 <= n:tem.append(i*10)\r\n\t\t\t\tif i*10+1 <= n:tem.append(i*10 + 1)\r\n\t\t\tarr = tem\r\n\t\treturn(ans)\r\n\r\n\tn = int(input())\r\n\t\r\n\tprint(f(1))\r\n\t# \tans_.append(str(ans))\r\n\t# print((\"\\n\").join(ans_))\r\nif __name__ == \"__main__\":\r\n\tmain()", "def answer(n):\r\n k=len(str(n))\r\n count=2**(k-1)-1\r\n arr=[\"1\"]\r\n for i in range(k-1):\r\n temp=[]\r\n for x in range(len(arr)):\r\n temp.append(arr[x]+\"1\")\r\n temp.append(arr[x]+\"0\")\r\n arr=temp[:]\r\n \r\n for i in arr:\r\n if int(i)<=n:\r\n count+=1\r\n \r\n return count\r\n\r\n\r\nt=int(input())\r\nprint(answer(t))", "n=int(input())\r\nlis=[]\r\nlis.append(1)\r\nans=0\r\nwhile(len(lis)>0):\r\n z=lis.pop(0)\r\n if z>n:\r\n break\r\n ans=ans+1\r\n lis.append(z*10)\r\n lis.append(z*10+1)\r\nprint(ans) ", "# -*- coding: utf-8 -*-\r\n\r\nn,cont = int(input()),1\r\n\r\nwhile int(bin(cont)[2:]) <= n: cont += 1\r\n\r\nprint(cont-1)\r\n\r\n", "n = int(input())\ncom = False\ns = str(n)\ni = 0\nans = \"\"\nwhile i<len(s):\n if int(s[i])!=0:\n if int(s[i])>1:\n com = True\n ans+='1'\n else:\n if com:\n ans+='1'\n else:\n ans += \"0\"\n i+=1 \n \n \nprint(int(ans,2))\n ", "n, x = int(input()), 1\r\nwhile int(bin(x)[2:]) <= n:\r\n x += 1\r\nprint(x - 1)\r\n", "from bisect import bisect\r\n\r\nA = [0]\r\n\r\nfor i in range(1, 2**10 + 1):\r\n A.append(int(str(bin(i))[2:]))\r\n\r\nN = int(input())\r\n\r\nprint(bisect(A, N) - 1)", "from collections import Counter,defaultdict,deque\r\nimport heapq as hq\r\n#from itertools import count, islice\r\n#from functools import reduce\r\n#alph = 'abcdefghijklmnopqrstuvwxyz'\r\n#from math import factorial as fact\r\n#a,b = [int(x) for x in input().split()]\r\nimport math\r\nimport sys\r\ndef to_bin(x):\r\n return '{:b}'.format(x)\r\ninput=sys.stdin.readline\r\nn = int(input())\r\nc = 1\r\nans = 0\r\n\r\nwhile int(to_bin(c))<=n:\r\n ans+=1\r\n c+=1\r\nprint(ans)\r\n \r\n", "def nm(s):\r\n \r\n while(len(s) and s[0] == '0'):\r\n s = s[1:]\r\n if len(s) == 0: \r\n return 0 \r\n \r\n if s[0] != '1':\r\n return 2**len(s)-1\r\n else:\r\n ints = int(s)\r\n sub = int('1'+'0'*(len(s)-1))\r\n return nm(str(ints - sub))+2**(len(s)-1)\r\n \r\nprint(nm(input()))", "cnt=1\r\nn=int(input())\r\nwhile (int(bin(cnt)[2:])<=n):\r\n cnt+=1\r\nprint(cnt-1)\r\n", "#arr=list(map(int, input().split()))\r\ndef main():\r\n s=str(input())\r\n s=list(s)\r\n for i in range(len(s)):\r\n if(not(s[i]==\"1\" or s[i]==\"0\")):\r\n for j in range(i,len(s)):\r\n s[j]=\"1\"\r\n break\r\n c=0\r\n for i in range(len(s)):\r\n if(s[i]==\"0\"):\r\n k=(len(s)-1-i)\r\n c+=pow(2,k)\r\n print(pow(2,len(s))-c-1)\r\nif __name__ == '__main__':\r\n main()", "import sys\ns = input()\nn = int(s)\nc = \"1\"*len(s)\nc = int(c)\nif(n>=c):\n\tprint(pow(2,len(s))-1)\n\tsys.exit()\nf = 0\ni = 0\nt = 0\nwhile(f == 0):\n\ts = \"{0:b}\".format(i)\n\tit = int(s)\n\tif(n>=it):\n\t\tt = it\n\telse:\n\t\tf = 1\n\ti+=1\nprint(int(str(t),2))", "import math\r\nn=int(input())\r\nll=[1]\r\nk=1\r\nwhile k<(int(math.log(n,10))+1):\r\n t=10**k\r\n ll.append(t)\r\n for i in range((2**k)-1):\r\n ll.append(ll[i]+t)\r\n k+=1\r\nresult=0\r\nfor i in ll:\r\n if i<=n:\r\n result+=1\r\n else:\r\n break\r\nprint(result)\r\n", "n = int(input())\r\nans = 0\r\nfor i in range(1, 513):\r\n x = int(bin(i)[2:])\r\n ans += x <= n\r\nprint(ans)\r\n", "def solve(i, length, num, n) :\r\n if i == length :\r\n if int(num) <= n :\r\n return 1\r\n else :\r\n return 0\r\n return solve(i + 1, length, num + '1', n) + solve(i + 1, length, num + '0', n)\r\n\r\nn = int(input())\r\nlength = len(str(n))\r\nans = 0\r\nfor i in range(1, length) :\r\n ans += 2**(i - 1)\r\nans += solve(1, length, '1', n)\r\nprint(ans)", "import queue\r\n\r\nclass Solve:\r\n\r\n def __init__(self) -> None:\r\n self.binary = queue.Queue();\r\n self.dem = 0;\r\n self.dauVao = 0;\r\n\r\n def vao(self) -> None:\r\n self.dauVao = int(input());\r\n self.binary.put(1);\r\n self.dem = 1;\r\n \r\n def lam(self) -> None:\r\n check = 0;\r\n while(True):\r\n x = self.binary.get();\r\n for i in range(2):\r\n m = x * 10 + i; \r\n if(m > self.dauVao):\r\n check = 1;\r\n break;\r\n else:\r\n self.dem += 1;\r\n self.binary.put(m);\r\n if(check == 1): break;\r\n\r\n def ra(self) -> None:\r\n print(self.dem);\r\n\r\n\r\ndef main():\r\n p = Solve();\r\n p.vao();\r\n p.lam();\r\n p.ra();\r\n\r\n\r\nmain();\r\n", "# -*- coding: utf - 8 -*-\r\n\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\r\n| author: mr.math - Hakimov Rahimjon |\r\n| e-mail: [email protected] |\r\n| created: 27.01.2018 10:48 |\r\n\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\r\n# inp = open(\"input.txt\", \"r\"); input = inp.readline; out = open(\"output.txt\", \"w\"); print = out.write\r\nTN = 1\r\n\r\n\r\n# ===========================================\r\n\r\n\r\ndef solution():\r\n n = int(input())\r\n ans = 1\r\n for i in range(2,1024):\r\n if int(bin(i)[2:])>n: break\r\n else: ans+=1\r\n print(ans)\r\n\r\n\r\n# ===========================================\r\nwhile TN != 0:\r\n solution()\r\n TN -= 1\r\n# ===========================================\r\n# inp.close()\r\n# out.close()\r\n", "n=int(input())\r\ndef S(x):\r\n if x>n:return 0\r\n return 1+S(x*10)+S(x*10+1)\r\nprint(S(1))", "from itertools import combinations\n\nn = int(input())\na = '101010101010101010'\nb = []\n\nfor i in range(1,11):\n\ts = list(set(combinations(a,i)))\n\tfor j in range(len(s)):\n\t\ts[j] = int(''.join(s[j]))\n\tb.extend(s)\n\t\nb = sorted(set(b))\nm = len(b)\n\n#print(b)\n\n#print(m)\n\nfor i in range(m):\n\tif(b[i] > n):\n\t\tprint(i-1)\n\t\texit()\n\nprint(n)\t", "n, b, ans = int(input()), 1, 0\r\nwhile (n >= b):\r\n ans += 1\r\n b = int(bin(ans + 1)[2:])\r\nprint(ans)\r\n", "\n\n\n\nfrom itertools import product\n\nn = input()\ncount = 0\nfor i in range(1, len(n)+1):\n for comb in product(\"10\", repeat=i):\n a = \"\".join(comb)\n if a[0]==\"0\":\n continue\n a = int(a)\n if a <= int(n) and a > 0:\n #print(a)\n count += 1\n\nprint(count)", "import sys\r\ninput = sys.stdin.readline\r\nfor _ in range(1):\r\n n=int(input())\r\n ans=[0]\r\n def helper(curr):\r\n if curr>n:\r\n return\r\n ans[0]+=1\r\n for i in [0,1]:\r\n helper(curr*10+i)\r\n return\r\n helper(1)\r\n print(ans[0])\r\n ", "import sys\n# import logging\n# logging.root.setLevel(level=logging.INFO)\n\nn = int(sys.stdin.readline().strip().split()[0])\ni = 1\nwhile int((bin(i))[2:]) <= n:\n i += 1\nprint(i-1)\n", "n = int(input())\r\ntemp = n\r\ndp = []\r\ndigitCount = 0\r\nwhile (temp != 0):\r\n dp.append(temp % 10)\r\n temp = int(temp/10)\r\n digitCount += 1\r\ndp.reverse()\r\nsum = 0\r\nfor i in range(digitCount - 1):\r\n sum += 2**i\r\ntwo = 2**(digitCount-1)\r\nif(dp[0]==1):\r\n for i in range(1,len(dp)):\r\n if(dp[i]>1):\r\n break\r\n elif(dp[i]==1):\r\n continue\r\n else:\r\n two-=2**(digitCount-i-1)\r\nsum+=two\r\nprint(sum)", "def tb(c):\r\n\treturn bin(c)[2:]\r\n\r\ndef td(s):\r\n \treturn int(s)\r\n\r\ndef gc(n):\r\n\td=0\r\n\tfor c in range(1,2**9+1):\r\n\t\tif td(tb(c))<=n:\r\n\t\t\td+=1\r\n\treturn d\r\n\r\nprint(gc(int(input())))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Mar 12 11:52:12 2020\r\n\r\n@author: akprasad\r\n\"\"\"\r\n\r\ndef get_n_digit_binary(n):\r\n if n == 1:\r\n return ['0', '1']\r\n smaller = get_n_digit_binary(n-1)\r\n return ['0' + s for s in smaller] + ['1' + s for s in smaller]\r\n\r\n\r\ndef get_all_n_digit_binary(n):\r\n if n == 1:\r\n return ['1']\r\n smaller = get_all_n_digit_binary(n-1)\r\n return smaller + ['1' + s for s in get_n_digit_binary(n-1)]\r\n\r\n\r\nif __name__ == '__main__':\r\n MAX = 10\r\n n = int(input())\r\n ndb = [int(x) for x in get_all_n_digit_binary(MAX)]\r\n found = False\r\n for i in range(len(ndb)):\r\n if ndb[i] > n:\r\n print(i)\r\n found = True\r\n break\r\n if not found:\r\n print(len(ndb))", "n = int(input())\n\ncount = 0\n\ni = 1\nwhile n >= int(f\"{i:b}\"):\n i += 1\n\nprint(i - 1)\n\n", "n = int(input())\r\nprint(sum(int(bin(b)[2:]) <= n for b in range(1, 512+1)))", "n = int(input())\r\nans = 0\r\n\r\ndef gen(x = 1):\r\n global ans, n\r\n if int(x) <= n:\r\n ans += 1\r\n gen(x * 10)\r\n gen(x * 10 + 1)\r\n\r\ngen()\r\nprint(ans)\r\n", "n = int(input())\r\n\r\ni, count = 0, 0\r\nwhile True:\r\n i += 1\r\n if int(bin(i)[2:]) > n:\r\n break\r\n count += 1\r\n\r\nprint(count)\r\n", "import sys\n\ninput = sys.stdin.readline\n\nn = int(input())\nans = 0\nfor i in range(1, int(n) + 1):\n if int(bin(i)[2:]) > n:\n break\n ans += 1\nprint(ans)\n", "s = input()\r\nn = len(s)\r\nans = 2**n -1\r\nfor i in range(n):\r\n if s[i]!='0' and s[i]!='1':\r\n break\r\n elif s[i]=='0':\r\n ans -= 2**(n-1-i)\r\nprint(ans)\r\n", "n = int(input())\r\ni = 1\r\nwhile int(bin(i)[2:]) <= n:\r\n i += 1\r\nprint(i - 1)", "n=int(input())\r\nx= 1\r\nwhile(int(bin(x)[2:])<=n): x+=1\r\nprint(x-1)\r\n", "#codeforces9C\r\ngi = lambda : list(map(int,input().strip().split()))\r\nnums = [int(e) for e in [bin(k)[2:] for k in range(1,1024)]]\r\nn, = gi()\r\nfor k in range(len(nums)):\r\n\tif nums[k] > n:\r\n\t\tprint(k)\r\n\t\texit()\r\n", "n=int(input())\r\nans=0\r\nfor i in range(2000):\r\n \r\n if int(bin(i)[2:])<=n:\r\n ans=ans+1\r\n else:\r\n break\r\nprint(ans-1)", "n=input()\r\nans=\"\"\r\ni=0\r\nl=len(n)\r\nwhile(i<l and n[i]<'2'):\r\n ans+=n[i]\r\n i+=1\r\nwhile(i<l):\r\n ans+='1'\r\n i+=1\r\ni=0\r\nnum=0\r\nwhile(i<l):\r\n num*=2\r\n num+=int(ans[i])\r\n i+=1\r\nprint(num)\r\n \r\n", "import sys\r\nn = input().strip()\r\n\r\nif int(n[0]) > 1:\r\n print( 2 ** len(n) - 1 )\r\nelse:\r\n lenn = len(n)\r\n x = 2 ** (lenn-1) - 1\r\n for i in range(1, lenn):\r\n if int(n[i]) > 1:\r\n x += 2 ** (lenn - i)\r\n print(x)\r\n sys.exit(0)\r\n elif int(n[i]) == 1:\r\n x += 2 ** (lenn - 1 - i)\r\n else:\r\n continue\r\n print(x+1)", "n = int(input())\r\n\r\ns = list(str(n))\r\nflag = 0\r\nfor i in range(len(s)):\r\n if flag==1:\r\n s[i]='1'\r\n else:\r\n if s[i]>'1':\r\n s[i] = '1'\r\n flag = 1\r\ns1 = ''.join(x for x in s)\r\n\r\nprint(int(s1,2))\r\n \r\n", "m = input()\r\nn = int(m)\r\nm = len(m)\r\nk = 3\r\ns = 10\r\nwhile s <= n:\r\n s = bin(k)\r\n s = s[2:]\r\n s = int(s)\r\n k += 1\r\n\r\nprint(k - 2)" ]

[ "from collections import defaultdict\n\ns = input()\nn = len(s)\n\nif n >= 2600:\n print(s[0] * 100)\nelif n > 2574:\n count = defaultdict(int)\n for l in s:\n count[l] += 1\n max_l = s[0]\n for l, c in count.items():\n if c >= 100:\n max_l = l\n print(max_l * 100)\n\nelse:\n data = defaultdict(dict)\n \n def print_p(i, gap):\n if gap == 1:\n return s[i]\n if gap == 2:\n return s[i:i + 2]\n return s[i] + print_p(data[i + 1][gap - 2][1], data[i + 1][gap - 2][2]) + s[i]\n \n for i in range(n):\n data[i][1] = (1, i, 1)\n max_p = data[0][1]\n \n for i in range(n - 1):\n if s[i] == s[i + 1]:\n data[i][2] = (2, i, 2)\n max_p = data[i][2]\n else:\n data[i][2] = data[i][1]\n \n output = None\n for gap in range(3, n + 1):\n for i in range(n - gap + 1):\n j = i + gap - 1\n if s[i] == s[j]:\n size = data[i + 1][gap - 2][0] + 2\n data[i][gap] = (size, i, gap)\n if size > max_p[0]:\n max_p = data[i][gap]\n if size == 100:\n output = print_p(i, gap)\n if size == 101:\n output = print_p(i, gap)\n output = output[:50] + output[51:]\n else:\n if data[i][gap - 1][0] > data[i + 1][gap - 1][0]:\n data[i][gap] = data[i][gap - 1]\n else:\n data[i][gap] = data[i + 1][gap - 1]\n if output:\n print(output) \n else:\n print(print_p(max_p[1], max_p[2]))\n" ]

[ "# https://codeforces.com/problemset/problem/848/B\r\n\r\ndef push(d, val, type_, arr):\r\n # pos index\r\n type_ %= 2\r\n if val not in d:\r\n d[val] = [[],[]]\r\n d[val][type_].append(arr)\r\n\r\nd = {}\r\n\r\nn, w, h = map(int, input().split())\r\nfor index in range(n):\r\n g, p, t = map(int, input().split())\r\n push(d, p-t, g, [p ,index])\r\n \r\nfor k, v in d.items():\r\n v[0]=sorted(v[0], key = lambda x: x[0], reverse=True)\r\n v[1]=sorted(v[1], key = lambda x: x[0], reverse=False)\r\n \r\nans = [0] * n\r\n\r\nfor v in d.values():\r\n cur=0\r\n bound = len(v[1])\r\n step = len(v[0])\r\n merge = v[0]+v[1]\r\n n_ = len(merge)\r\n\r\n for pos, index in merge:\r\n if cur<bound:\r\n ans[index]=str(merge[(step+cur)%n_][0])+' '+str(h)\r\n else:\r\n ans[index]=str(w)+' '+str(merge[(step+cur)%n_][0])\r\n cur+=1 \r\nprint('\\n'.join(ans)) ", "from collections import namedtuple\r\n\r\nDancer = namedtuple('Dancer', ['category', 'x', 'y', 'idx', 'group'])\r\n\r\ndef read_dancer(idx):\r\n\tgroup, pos, time = [int(x) for x in input().split(' ')]\r\n\tx, y = None, None\r\n\tif group == 1:\r\n\t\tx, y = pos, 0\r\n\telse:\r\n\t\tx, y = 0, pos\r\n\treturn Dancer(time-pos, x, y, idx, group)\r\n\r\nn, w, h = [int(x) for x in input().split(' ')]\r\n\r\ndancers = [read_dancer(idx) for idx in range(n)]\r\n\r\ndancers_in = sorted(dancers, key = lambda d: (d.category, -d.group, d.x, -d.y))\r\ndancers_out = sorted(dancers, key = lambda d: (d.category, d.group, d.x, -d.y))\r\n\r\n\r\nend_pos = [None for _ in range(n)]\r\n\r\ndef get_end_pos(dancer):\r\n\tx, y = None, None\r\n\tif dancer.x == 0:\r\n\t\tx, y = w, dancer.y\r\n\telse:\r\n\t\tx, y = dancer.x, h\r\n\treturn (x, y)\r\n\r\nfor i in range(n):\r\n\tend_pos[dancers_in[i].idx] = get_end_pos(dancers_out[i])\r\n\r\nfor i in range(n):\r\n\tprint(*end_pos[i])", "n,w,h = map(int,input().split())\r\nV = []\r\nH = []\r\nR = []\r\nfor i in range(n):\r\n g,p,t = map(int,input().split())\r\n if g==1:\r\n V.append((-t,p,p-t,i))\r\n R.append((p,h))\r\n else:\r\n H.append((p,-t,p-t,i))\r\n R.append((w,p))\r\nV.sort()\r\nH.sort()\r\nDP = {} #k=>point-list\r\nDH = {} #k=>vc\r\nfor t in V:\r\n k = t[2]\r\n if k not in DP:\r\n DP[k]=[]\r\n DH[k]=0\r\n DP[k].append(t)\r\nfor t in H:\r\n k = t[2]\r\n if k not in DP:\r\n DP[k]=[]\r\n DH[k]=0\r\n DP[k].append(t)\r\n DH[k] += 1\r\nS = [0]*n\r\nfor k in DP:\r\n pts = DP[k]\r\n off = DH[k]\r\n pc = len(pts)\r\n for i in range(pc):\r\n i1 = pts[i][3]\r\n i2 = pts[i-off][3]\r\n S[i1]=i2\r\nfor i in range(n): print(*R[S[i]])\r\n\r\n", "import sys\r\ninput = sys.stdin.buffer.readline \r\n\r\ndef process(A, w, h):\r\n d = {}\r\n n = len(A)\r\n for i in range(n):\r\n gi, pi, ti = A[i]\r\n if gi==1:\r\n xi = pi\r\n if (xi-ti) not in d:\r\n d[(xi-ti)] = {'x': [], 'y': []}\r\n d[(xi-ti)]['x'].append(i+1)\r\n else:\r\n yi = pi\r\n if (yi-ti) not in d:\r\n d[(yi-ti)] = {'x': [], 'y': []}\r\n d[(yi-ti)]['y'].append(i+1)\r\n answer = []\r\n for x in d:\r\n if len(d[x]['x']) > 0 and len(d[x]['y']) > 0:\r\n d[x]['x'] = sorted(d[x]['x'], key=lambda a:A[a-1][1])\r\n d[x]['y'] = sorted(d[x]['y'], key=lambda a:A[a-1][1], reverse=True)\r\n original = []\r\n for i1 in d[x]['y']:\r\n original.append(i1)\r\n for i1 in d[x]['x']:\r\n original.append(i1)\r\n #original = A B C | D E \r\n m = len(d[x]['x'])\r\n m2 = len(d[x]['y'])\r\n for i in range(m):\r\n i2 = d[x]['x'][i]\r\n i1 = original[i]\r\n answer.append([i1, A[i2-1][1], h])\r\n for i in range(m2):\r\n i2 = d[x]['y'][i]\r\n i1 = original[m+i]\r\n answer.append([i1, w, A[i2-1][1]])\r\n \r\n \r\n \r\n \r\n else:\r\n for i in d[x]['x']:\r\n x1 = A[i-1][1]\r\n answer.append([i, x1, h])\r\n for i in d[x]['y']:\r\n y = A[i-1][1]\r\n answer.append([i, w, y])\r\n answer = sorted(answer)\r\n answer = [[x[1], x[2]] for x in answer]\r\n return answer\r\n\r\nn, w, h = [int(x) for x in input().split()]\r\nA = []\r\nfor i in range(n):\r\n a, b, c = [int(x) for x in input().split()]\r\n A.append([a, b, c])\r\nanswer = process(A, w, h)\r\nfor x, y in answer:\r\n print(f'{x} {y}')", "# http://codeforces.com/problemset/problem/848/B\nfrom collections import defaultdict\n\n\ndef get_dest(start, w, h):\n if start[0] == 1:\n return (str(start[1]), str(h))\n else:\n return (str(w), str(start[1]))\n\n\nn, w, h = [int(x) for x in input().split()]\ndancers = []\ngroups = defaultdict(list)\ndestinations = [None for x in range(n)]\nfor ii in range(n):\n g, p, t = [int(x) for x in input().split()]\n dancers.append((g, p, t))\n groups[p-t].append(ii)\n\n\nfor gg in groups.values():\n V, H = [], []\n for ii in gg:\n dancer = dancers[ii]\n if dancer[0] == 1:\n V.append(dancer)\n else:\n H.append(dancer)\n V.sort(key=lambda x: -x[1])\n H.sort(key=lambda x: x[1])\n table = {orig: get_dest(new, w, h) for orig, new in zip(V+H, H+V)}\n for ii in gg:\n destinations[ii] = table[dancers[ii]]\n\n# print(destinations)\nfor dd in destinations:\n print(\" \".join(dd))\n", "n,w,h = map(int,input().split())\r\n\r\n\r\ndef it(n):\r\n for i in range(n):\r\n g,p,t = map(int,input().split())\r\n yield (p-t, p if g==1 else -p, i)\r\n\r\nD = sorted(it(n))\r\n\r\nfrom bisect import bisect\r\nfrom itertools import chain\r\n\r\nres = [None]*n\r\n\r\ni = 0\r\nwhile i < len(D):\r\n k = D[i][0]\r\n j = bisect(D, (k+1,-n,0), lo=i)\r\n m = bisect(D, (k,0,0), lo=i,hi=j)\r\n\r\n for s,t in zip(range(i,j),chain(range(m,j),range(i,j))):\r\n p,d = D[t][1],D[s][2]\r\n res[d] = (p,h) if p > 0 else (w,-p)\r\n\r\n i = j\r\n\r\nprint('\\n'.join(' '.join(map(str,r)) for r in res))\r\n", "n,w,h = map(int,input().split())\n\n\n\nD = []\n\n\n\noriginal = []\n\n\n\nfor i in range(n):\n\n g,p,t = map(int,input().split())\n\n\n\n a = p-t\n\n\n\n p = p if g == 1 else -p\n\n\n\n original.append(())\n\n D.append((a,p,i))\n\n\n\nD.sort()\n\n\n\nfrom bisect import bisect\n\n\n\nres = [None]*n\n\n\n\ni = 0\n\nwhile i < len(D):\n\n a = D[i][0]\n\n j = bisect(D, (a+1,-n,0), lo=i)\n\n m = bisect(D, (a,0,0), lo=i,hi=j)\n\n\n\n L = D[i:j]\n\n R = D[m:j]+D[i:m]\n\n\n\n for t in range(len(L)):\n\n _,_,d = L[t]\n\n _,p,_ = R[t]\n\n if p > 0:\n\n res[d] = (p,h)\n\n else:\n\n res[d] = (w,-p)\n\n\n\n i = j\n\n\n\nprint('\\n'.join(str(x)+' '+str(y) for x,y in res))\n\n\n\n\n\n# Made By Mostafa_Khaled", "def read_ints():\r\n\treturn [int(i) for i in input().split()]\r\n\r\nn, w, h = read_ints()\r\ntanc = [read_ints() for i in range(n)]\r\nvert = [(k[0], k[1], k[2], i) for i, k in enumerate(tanc) if k[0] == 1]\r\nhor = [(k[0], k[1], k[2], i) for i, k in enumerate(tanc) if k[0] == 2]\r\n\r\nvert_st = dict()\r\nfor v in vert:\r\n\tst = v[1] - v[2]\r\n\tif st not in vert_st:\r\n\t\tvert_st[st] = []\r\n\tvert_st[st].append(v)\r\n\r\nhor_st = dict()\r\nfor v in hor:\r\n\tst = v[1] - v[2]\r\n\tif st not in hor_st:\r\n\t\thor_st[st] = []\r\n\thor_st[st].append(v)\r\n\r\nresult = [None] * n\r\n\r\ndef process_group(hor, vert):\r\n\tglobal result, w, h\r\n\thor.sort(key=lambda x: x[1])\r\n\tvert.sort(key = lambda x: x[1], reverse=True)\r\n\r\n\tindices = [i[3] for i in vert] + [i[3] for i in hor]\r\n\tcoords = [(w, i[1]) for i in hor] + [(i[1], h) for i in vert]\r\n\tfor i, c in zip(indices, coords):\r\n\t\tresult[i] = c\r\n\r\nfor st in set(list(vert_st.keys()) + list(hor_st.keys())):\r\n\tprocess_group(hor_st.get(st, []), vert_st.get(st, []))\r\n\r\nfor c in result:\r\n\tprint(*c)\r\n" ]

[ "import math\r\nimport sys\r\nimport queue\r\n\r\n\r\ndef solve():\r\n n, x, y = map(int, input().split())\r\n s = str(input())\r\n\r\n subsq = 1\r\n zeros = int(s[0] == \"0\")\r\n for i in range(1, n):\r\n if s[i] != s[i - 1]:\r\n subsq += 1\r\n if s[i] == \"0\":\r\n zeros += 1\r\n\r\n res = 0\r\n\r\n if subsq == 1:\r\n if s[0] == \"0\":\r\n res = y\r\n else:\r\n res = 0\r\n elif subsq == 2:\r\n res = y\r\n else:\r\n if s[0] == \"0\":\r\n res = ((subsq - 1) // 2 * x + y)\r\n else:\r\n if subsq == 3:\r\n res = (x + y)\r\n else:\r\n res = ((subsq - 2) // 2 * x + y)\r\n\r\n res = min(res, zeros * y)\r\n print(res)\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,x,y = map(int,input().split())\ns = input()\n\n# x = cost of reverse\n# y = cost of invert\n\nchains = 0\n\nzero = False\nfor i in range(n):\n if not zero and s[i] == \"0\":\n zero = True\n elif not zero and s[i] == \"1\":\n continue\n elif zero and s[i] == \"0\":\n continue\n elif zero and s[i] == \"1\":\n chains += 1\n zero = False\nif zero:\n chains += 1\n\nif chains == 0:\n print(0)\nelse:\n min_cost = 99999999999999999999999999\n for n_invert in range(1,chains+1):\n n_reverse = chains - n_invert\n cost = n_reverse * x + n_invert * y\n min_cost = min(min_cost, cost)\n print(min_cost)\n", "n, x, y = map(int, input().split())\r\ns = input()\r\ni, intervals = 0, 0\r\nwhile i < n:\r\n j = i\r\n if s[i] == '0':\r\n curr_len = 0\r\n while j < n and s[j] == '0':\r\n j += 1\r\n curr_len += 1\r\n intervals += 1\r\n i = j + 1\r\n\r\nif intervals == 0:\r\n print(intervals)\r\nelse:\r\n print(min(intervals * y, (intervals - 1) * x + y))\r\n", "n, x, y = [int(x) for x in input().split()]\r\n\r\nxs = input().strip()\r\n\r\nfrom itertools import groupby\r\n\r\ncount = sum(1 for g, _ in groupby(xs) if g == '0')\r\n\r\nans = count * y\r\nfor i in range(count):\r\n ans = min(ans, i * x + (count - i) * y)\r\n\r\nprint(ans)\r\n", "n,x,y=map(int, input().split())\r\na=input()\r\nk=0\r\ni=0\r\nif a[i]=='0':\r\n k+=1\r\n while i<n and a[i]=='0':\r\n i+=1\r\nfor j in range(i,n-1):\r\n if a[j]=='1' and a[j+1]=='0':\r\n k+=1\r\nif k==0:\r\n print(0)\r\nelif x<y:\r\n print((k-1)*x+y)\r\nelse:\r\n print(k*y)", "import math\r\ndef answer(n,x,y,A):\r\n count=0\r\n sign=1\r\n for i in range(n):\r\n if A[i]==\"0\" and sign:\r\n count+=1\r\n sign=0\r\n elif A[i]==\"1\":\r\n sign=1\r\n \r\n ans=0\r\n if count==0:\r\n return 0\r\n if y>x:\r\n return y+(count-1)*x\r\n else:\r\n return count*y\r\n \r\n\r\nn,x,y=map(int,input().split())\r\ns=input()\r\nprint(answer(n,x,y,s))", "n,x,y=map(int,input().split())\r\ns=input()\r\nsl=[]\r\nfor i in s:\r\n sl+=[int(i)]\r\nsl.append(1)\r\ncount=0\r\nfor i in range(n):\r\n if sl[i]==0 and sl[i+1]==1 :\r\n count+=1\r\nif count!=0:\r\n print(y+min(x,y)*(count-1))\r\nelse:\r\n print(\"0\")", "# Problem: A. Convert to Ones\r\n# Contest: Codeforces - Codeforces Round 493 (Div. 1)\r\n# URL: https://codeforces.com/problemset/problem/997/A\r\n# Memory Limit: 256 MB\r\n# Time Limit: 1000 ms\r\n\r\nimport sys\r\nimport bisect\r\nimport random\r\nimport io, os\r\nfrom bisect import *\r\nfrom collections import *\r\nfrom contextlib import redirect_stdout\r\nfrom itertools import *\r\nfrom array import *\r\nfrom functools import lru_cache, reduce\r\nfrom types import GeneratorType\r\nfrom heapq import *\r\nfrom math import sqrt, gcd, inf\r\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=' ')这种语法\r\n\r\nMOD = 10**9 + 7\r\nPROBLEM = \"\"\"https://codeforces.com/problemset/problem/997/A\r\n\r\n输入 n(1≤n≤3e5) x(0≤x≤1e9) y(0≤y≤1e9) 和长为 n 的 01 字符串 s。\r\n\r\n你可以执行任意次操作，每次选择其中一种操作执行。\r\n1. 花费 x，reverse s 的一个子串，例如 1110 -> 0111。\r\n2. 花费 y，flip s 的一个子串，例如 1110 -> 0001。\r\n\r\n目标：使 s 中只有 1。\r\n输出最少花费。\r\n输入\r\n5 1 10\r\n01000\r\n输出\r\n11\r\n\r\n输入\r\n5 10 1\r\n01000\r\n输出\r\n2\r\n\r\n输入\r\n7 2 3\r\n1111111\r\n输出\r\n0\r\n\"\"\"\r\n\"\"\"https://codeforces.com/contest/997/submission/205172377\r\n\r\n如果没有 0，输出 0。\r\n如果 x < y，那么可以把所有 0 通过多次 reverse 操作聚在一起，然后再操作一次 flip。\r\nreverse 的操作次数就是 0 组的个数减一。例如 001101000 中有三个 0 组，需要两次 reverse。\r\n如果 x >= y，那么把每个 0 组 flip 掉即可。\"\"\"\r\n\r\n\r\n# ms\r\ndef solve():\r\n n,x,y = RI()\r\n s, = RS()\r\n if '0' not in s :\r\n return print(0)\r\n f = [0]*n\r\n if s[0] == '0':\r\n f[0] = 1\r\n for i in range(1,n):\r\n if s[i] == '0':\r\n f[i] = f[i-1] + 1\r\n zero = f.count(1)\r\n ans = 0\r\n if x < y :\r\n ans = (zero - 1)*x + y\r\n else:\r\n ans = zero * y\r\n print(ans)\r\n\r\n\r\nif __name__ == '__main__':\r\n t = 0\r\n if t:\r\n t, = RI()\r\n for _ in range(t):\r\n solve()\r\n else:\r\n solve()\r\n", "def segments(s, x, y):\r\n count = s.count('10') + s.startswith('0')\r\n if count:\r\n return (count - 1) * min(x, y) + y\r\n return 0\r\n\r\n\r\nn, X, Y = [int(i) for i in input().split()]\r\nt = input()\r\nprint(segments(t, X, Y))\r\n", "def rev():\r\n ret=0\r\n i=0\r\n while i<n and s[i]=='1':i+=1\r\n while i<n:\r\n if s[i]=='1':\r\n while i<n and s[i]=='1':i+=1\r\n if i<n:ret+=x\r\n else:i+=1\r\n return ret+y\r\n\r\ndef change():\r\n ret1,ret2=0,0\r\n cnt=0\r\n for i in s:\r\n if i=='1':cnt+=1\r\n ret1=(cnt*y)+(n*y)\r\n i=0\r\n while i<n:\r\n if s[i]=='0':\r\n while i<n and s[i]=='0':i+=1\r\n ret2+=y\r\n else:i+=1\r\n return min(ret1,ret2)\r\n\r\nn,x,y=[int(a) for a in input().split()]\r\ns=input()\r\nprint(min(rev(),change()))", "n, x, y = map(int, input().split())\r\na = input()\r\nif '0' not in a:\r\n print(0)\r\nelse:\r\n number_of_zero_groups = 0\r\n curr = a[0]\r\n if curr == '0':\r\n number_of_zero_groups += 1\r\n for e in a[1:]:\r\n if e == '0' and curr == '1':\r\n number_of_zero_groups += 1\r\n curr = e\r\n print((number_of_zero_groups-1) * min(x, y) + y)", "\ndef count_components(line):\n in_zero_component = False\n num_components = 0\n for c in line:\n if c == '0':\n if not in_zero_component:\n num_components += 1\n in_zero_component = True\n else:\n in_zero_component = False\n return num_components\n\n_, reverse_cost, invert_cost = [int(x) for x in input().split()]\nline = input()\nnum_components = count_components(line)\n\ncost = (num_components - 1) * min(reverse_cost, invert_cost) + invert_cost if num_components > 0 else 0\nprint(cost)\n", "import sys\r\ninput = sys.stdin.readline\r\ndef inp(): #int input\r\n return(int(input()))\r\ndef inlt(): #int list input\r\n return(list(map(int,input().split())))\r\ndef insr(): #string input (list of chars)\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr(): #space separated ints\r\n return(map(int,input().split()))\r\ndef printlst(lst):\r\n print(*lst)\r\n\r\nt = 1\r\nfor _ in range(t):\r\n\tn, x, y = invr()\r\n\ta = insr()\r\n\tlast = '1'\r\n\tzgroups = 0\r\n\tfor v in a:\r\n\t\tif v == '0' and last == '1':\r\n\t\t\tzgroups += 1\r\n\t\tlast = v\r\n\tif zgroups == 0:\r\n\t\tprint(0)\r\n\telif x < y:\r\n\t\tprint(((zgroups - 1) * x) + y)\r\n\telse:\r\n\t\tprint(zgroups * y)\r\n\t\t\r\n\t\t\r\n\t", "if __name__==\"__main__\":\r\n n,a,y=input().strip().split(' ')\r\n n,a,y=[int(n),int(a),int(y)]\r\n bin_str=str(input())\r\n p=0\r\n flag=0\r\n for x in range(0,len(bin_str)):\r\n if bin_str[x]=='0':\r\n flag=1\r\n elif bin_str[x]=='1' and flag==1:\r\n flag=0\r\n p+=1\r\n if flag==1 and bin_str[x-1]:\r\n p+=1\r\n #print(p)#***\r\n if p==0:\r\n print('0')\r\n else:\r\n ans=((p-1)*min(a,y))+y\r\n print(ans)", "n , x , y = map(int , input().split())\r\ns = input()\r\ndata = s.split('1')\r\nc = 0\r\nfor i in data:\r\n if len(i) != 0:\r\n c+=1\r\nif c == 0:\r\n print(0)\r\nelse:\r\n print((c-1)*min(x,y) + y)", "n,x,y=map(int,input().split())\r\ns=input();\r\nc=s.count(\"10\");\r\nif s[0]=='0':c+=1\r\nans=10**18\r\nif c==0:\r\n print(0)\r\nelse:\r\n for i in range(c):\r\n ans=min(ans,x*i+y*(c-i))\r\n print(ans)", "def solve():\r\n n, x, y = map(int, input().split())\r\n string = input()\r\n i, j = 0, 0\r\n cnt = 0\r\n while i < n:\r\n if string[i] == \"0\":\r\n cnt += 1\r\n j = i+1\r\n while j < n:\r\n if string[j] == \"0\":\r\n j += 1\r\n else:\r\n i = j\r\n break\r\n if j == n:\r\n break\r\n else:\r\n i += 1\r\n if cnt == 0:\r\n return 0\r\n return (cnt - 1) * min(x, y) + y\r\n\r\nt = 1\r\nwhile t !=0 :\r\n res = solve()\r\n print(res)\r\n t -= 1\r\n", "# ne sam\r\nn,x,y= list(map(int, input().split() ) )\r\na=list(input())\r\ntec=a[0]\r\nk=0\r\nfor i in range(1,n):\r\n if a[i]!=tec:\r\n if tec=='0':\r\n k+=1\r\n tec=a[i]\r\nif tec=='0':\r\n k+=1\r\nif k==0:\r\n print(0)\r\nelse:\r\n print((k-1) * min(x,y) + y )\r\n ", "n,x,y = map(int,input().split())\r\ns = input()\r\ns += '1'\r\ncount = 0\r\ncnt = 0\r\nfor i in range(n + 1):\r\n if s[i] == '1':\r\n if count:\r\n cnt += 1\r\n count = 0\r\n else:\r\n count += 1\r\nif cnt == 0:\r\n print(0)\r\nelse:\r\n print(min((cnt - 1) * x + y,cnt * y))", "n, x, y = map(int, input().strip().split())\r\ns = list(input().strip())\r\n\r\np = 0\r\ncnt = 0\r\nwhile p < n:\r\n while p < n and s[p] == '1':\r\n p += 1\r\n q = p\r\n while q < n and s[q] == '0':\r\n q += 1\r\n if p != q:\r\n cnt += 1\r\n p = q\r\n\r\nif cnt == 0:\r\n print(0)\r\n exit(0)\r\nans = min((cnt - 1) * x + y, cnt * y)\r\nprint(ans)", "n, x, y = map(int, input().split())\ns = input()\nif '0' not in s:\n print(0)\nelif '1' not in s:\n print(y)\nelse:\n zero_start = s[0] == '0'\n zero_end = s[-1] == '0'\n ones_groups = 0\n i = 0\n while i < n:\n found = False\n while i < n and s[i] == '1':\n found = True\n i+=1\n if found:\n ones_groups += 1\n i += 1\n\n replace = max(0, (ones_groups - (0 if zero_start else 1) - (0 if zero_end else 1))) * x + y\n invert = (ones_groups-1 + (1 if zero_start else 0) + (1 if zero_end else 0)) * y\n print(min(replace, invert))\n", "def so(l):\r\n\tl=l.replace(\"11\",\"1\")\r\n\treturn l\r\nn,x,y= map(int,input().split())\r\nl=input()\r\nif(\"0\" not in l):\r\n\tprint(0)\r\nelse:\r\n\twhile(\"11\"in l):\r\n\t\tl=so(l)\r\n\tl=l.split(\"1\")\r\n\tif(l[0]==\"\"):\r\n\t\tl.remove(\"\")\r\n\tif(l[-1]==\"\"):\r\n\t\tl.pop()\r\n\r\n\ta=len(l)-1\r\n\tans1 = (a+1)*y\r\n\r\n\tans2 = a*x +y\r\n\tprint(min(ans1,ans2))", "'''\r\nhttps://codeforces.com/problemset/problem/997/A\r\n\r\n输入 n(1≤n≤3e5) x(0≤x≤1e9) y(0≤y≤1e9) 和长为 n 的 01 字符串 s。\r\n\r\n你可以执行任意次操作，每次选择其中一种操作执行。\r\n1. 花费 x，reverse s 的一个子串，例如 1110 -> 0111。\r\n2. 花费 y，flip s 的一个子串，例如 1110 -> 0001。\r\n\r\n目标：使 s 中只有 1。\r\n输出最少花费。\r\n\r\n输入\r\n5 1 10\r\n01000\r\n输出\r\n11\r\n\r\n输入\r\n5 10 1\r\n01000\r\n输出\r\n2\r\n\r\n输入\r\n7 2 3\r\n1111111\r\n输出\r\n0\r\n'''\r\n\r\n\r\ndef _n():\r\n return int(input())\r\n\r\n\r\ndef _nA():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef _nS():\r\n return input().split()\r\n\r\n\r\ndef solve():\r\n n, x, y = _nA()\r\n c, t = 0, 0\r\n for i in input():\r\n if i == '0':\r\n t += 1\r\n elif t:\r\n c += 1\r\n t = 0\r\n c += (t > 0)\r\n if c == 0:\r\n return 0\r\n if x < y:\r\n return (c-1)*x+y\r\n else:\r\n return c*y\r\n\r\n\r\nprint(solve())\r\n", "\nn, x, y = [int(i) for i in input().split()]\nmystring = input()\n\ncontzeroes = 0\n\nfor i in range(n - 1):\n\tif(mystring[i] == '0' and mystring[i + 1] == '1'):\n\t\tcontzeroes += 1\n\nif(mystring[-1] == '0'):\n\tcontzeroes += 1\n\nif(contzeroes == 0):\n\tprint(0)\n\nif(contzeroes != 0 and y <= x):\n\tprint(contzeroes * y)\nelif(contzeroes != 0 and y > x):\n\tprint((contzeroes - 1) * x + y)\n", "\r\nn, x, y = (int (i) for i in input ().split())\ns = input ()\n\non = False\nc = 0\n\nfor e in s:\n if (e == '0' and not on):\n on = True\n c += 1\n elif (e == '1'):\n on = False\n\nprint (max(0, min((c-1)*x + y, c*y)))\r\n", "def f(reverse_cost, inverse_cost, bit_string):\n prev_value = True\n zero_section_count = 0\n for v in bit_string:\n cur_value = bool(v == \"1\")\n if prev_value != cur_value:\n if not cur_value:\n zero_section_count += 1\n prev_value = cur_value\n if zero_section_count:\n return min(reverse_cost, inverse_cost) * (zero_section_count - 1) + inverse_cost\n else:\n return 0\n\nn, x, y = [int(i) for i in input().split()]\ns = input()\nprint(f(x, y, s))\n", "n, x, y = list(map(int, input().split()))\r\na = '1' + input()\r\nm = sum(1 for i in range(1, n+1) if a[i-1] == '1' and a[i] == '0')\r\nans = min( (x*i + y*(m-i) for i in range(m) ), default = 0)\r\nprint(ans)", "n, x, y = input().split()\r\nn = int(n)\r\nx = int(x)\r\ny = int(y)\r\ns = input()\r\ncount = 0\r\nis_zero = (s[0] == '0')\r\nif is_zero:\r\n count += 1\r\nfor i in range(1, n):\r\n if s[i] == '0' and not is_zero:\r\n is_zero = True\r\n count += 1\r\n elif s[i] == '1' and is_zero:\r\n is_zero = False\r\nif y <= x or count == 0:\r\n print(y * count)\r\nelse:\r\n print(x * (count - 1) + y)", "a=input().split()\r\nn=int(a[0])\r\nx=int(a[1])\r\ny=int(a[2])\r\na=input()\r\ngroups = 0\r\nadd=True\r\nfor i in range(n):\r\n if add==True and a[i]=='0':\r\n groups+=1\r\n add=False\r\n if a[i]=='1':\r\n add=True\r\ntot1 = groups*y\r\ntot2 = (groups-1)*x+y\r\nif abs(tot1)>abs(tot2):\r\n print(tot2)\r\nelse:\r\n print(tot1)\r\n", "n,x,y = map(int,input().split())\r\ns = input()\r\ncnt = 0\r\ni=0\r\nwhile i<n:\r\n if s[i]=='0':\r\n cnt+=1\r\n while i<n and s[i]=='0':\r\n i+=1\r\n i+=1 \r\n \r\n \r\nans = 10**18\r\n\r\nfor i in range(cnt,0,-1):\r\n val = i*y+(cnt-i)*x\r\n ans = min(ans,val)\r\n\r\nif ans == (10**18): print(0)\r\nelse: print(ans)\r\n ", "n, x, y = map(int, input().split())\r\ns = input().strip()\r\nzero = 0\r\nif s.count('0') == 0:\r\n\tprint(0)\r\n\texit()\r\ncnt = sum([1 for x in s.split('1') if len(x)>0])\r\nprint((cnt-1)*min(x, y) + y)", "n,x,y=input().split()\r\nn=int(n)\r\nx=int(x)\r\ny=int(y)\r\nch=input()\r\ncnt=0\r\nif ch[0]=='0':\r\n cnt+=1\r\nfor i in range(1,len(ch)):\r\n if ch[i]=='0' and ch[i-1]=='1':\r\n cnt+=1\r\nans=0\r\nif cnt>0:\r\n ans=y\r\n cnt-=1\r\nif x<y:\r\n ans+=x*cnt\r\nelse:\r\n ans+=y*cnt\r\nprint(ans)", "n,x,y=map(int,input().split())\r\ns=input()\r\np='1'\r\nk=0\r\nfor i in range(n):\r\n if s[i]!=p:\r\n if p=='1':\r\n k+=1\r\n p=s[i]\r\nif k==0:\r\n print(0)\r\nelse:\r\n print(y+(k-1)*min(x,y))\r\n", "N,x,y = input().split()\nx=int(x)\ny=int(y)\narray=input()\nthe_list=array.split('1')\nlength=len(the_list)\nfor k in the_list:\n\tif k=='':\n\t\tlength-=1\nif length==0:\n\tprint(0)\nelif x<y:\n\tprint((length-1)*x+y)\nelse:\n\tprint((length)*y)", "n, x, y = map(int, input().split(' '))\ns = input()\n\ncnt = 0\ni = 0\n# 1010\n\n# 0110\n# 0001\n# 1111\n\n# 0110\n\nwhile i < len(s):\n if s[i] == '0':\n cnt += 1\n while i < len(s) and s[i] == '0':\n i += 1\n i += 1\n\nif cnt > 0:\n if x < y:\n print((cnt - 1) * x + y)\n else:\n print(cnt * y)\nelse:\n print(0)\n", "\r\nimport sys\r\n#sys.stdin=open(\"data.txt\")\r\ninput=sys.stdin.readline\r\n\r\nn,x,y=map(int,input().split())\r\n\r\na=input().strip()\r\n\r\nthings=0\r\n\r\nb=0\r\nfor i in range(n):\r\n if b==0:\r\n if a[i]=='0':\r\n b=1\r\n else:\r\n if a[i]=='1':\r\n things+=1\r\n b=0\r\nthings+=b\r\n\r\nif things==0: print(0)\r\nelse: print(min(x,y)*(things-1)+y)\r\n\r\n", "import sys\r\nimport math\r\nfrom functools import reduce\r\nimport bisect\r\n\r\n\r\ndef getN():\r\n return int(input())\r\n\r\n\r\ndef getNM():\r\n return map(int, input().split())\r\n\r\n\r\ndef getList():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef input():\r\n return sys.stdin.readline().rstrip()\r\n\r\n\r\n# input = sys.stdin.buffer.readline\r\n\r\ndef index(a, x):\r\n i = bisect.bisect_left(a, x)\r\n if i != len(a) and a[i] == x:\r\n return i\r\n return -1\r\n\r\n\r\n#############\r\n# MAIN CODE #\r\n#############\r\n\r\nn, x, y = getNM()\r\ns = input()\r\n\r\nseg = 0\r\nt = 1\r\nfor i in range(n):\r\n if s[i] == \"0\":\r\n if t:\r\n seg += 1\r\n t = 0\r\n else:\r\n t = 1\r\nif y <= x:\r\n print(seg * y)\r\nelif seg == 0:\r\n print(0)\r\nelse:\r\n print((seg - 1) * x + y)\r\n", "n, x, y = map(int, input().split())\r\nk = sum(1 for i in input().split('1') if i)\r\nans = k * y\r\nfor i in range(1, k):\r\n ans = min(ans, i * x + (k - i) * y)\r\nprint(ans)", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\nimport time\n\n\n\n(n, x, y) = (int(i) for i in input().split())\na = input()\n\nstart = time.time()\n\n\nI = 0\nwhile(a[I] == '1'):\n I += 1\n if I == n:\n break\n\nflag = 1\nN = 0\n\nfor i in range(I, n):\n if flag == 0:\n if a[i] == '1':\n flag = 1\n else:\n if a[i] == '0':\n flag = 0\n N += 1\n\nif N == 0:\n print(0)\nelif (x > y):\n print(N*y)\nelse:\n print(y+x*(N-1))\n\nfinish = time.time()\n#print(finish - start)\n", "_, x, y = map(int, input().split())\r\ns = list(input()) + ['1'] # 补个1，便于处理边界\r\n\r\nc0 = 0 # 当前0组有多少个0了\r\ncnt = 0 # 有多少个0组了\r\n\r\nfor i, v in enumerate(s):\r\n if v == '0': \r\n c0 += 1\r\n elif c0 > 0:\r\n cnt += 1\r\n c0 = 0\r\nif cnt == 0: \r\n print(0)\r\nelif x < y: \r\n print((cnt - 1) * x + y)\r\nelse: \r\n print(cnt * y)", "def main():\r\n n, x, y = list(map(int, input().split()))\r\n string = input()\r\n numbers = [int(i) for i in string]\r\n\r\n zero_blocks = 0\r\n last_number = -1\r\n \r\n for number in numbers:\r\n if last_number == 0 and number == 1:\r\n zero_blocks += 1\r\n \r\n last_number = number\r\n \r\n if numbers[-1] == 0:\r\n zero_blocks += 1\r\n \r\n if zero_blocks == 0:\r\n print(0)\r\n return\r\n \r\n if y <= x:\r\n print(y * zero_blocks)\r\n return\r\n else:\r\n print(x * (zero_blocks - 1) + y)\r\n return \r\n \r\nmain()", "n, x, y=map(int, input().split())\r\na=\"1\"+input()\r\nif '0' not in a:\r\n\tprint( 0)\r\nelse:\r\n\tcur=-1\r\n\tresult=y-min(x, y)\r\n\twhile True:\r\n\t\tcur=a.find(\"10\", cur+1)\r\n\t\tif cur==-1:\r\n\t\t\tbreak\r\n\t\tresult+=min(x, y)\r\n\t\t\r\n\tprint( result)", "n,x,y=list(map(int,input().split()))\r\na=input()\r\nn0,n1=len(list(filter(lambda x:x!='',a.split('1')))),len(list(filter(lambda x:x!='',a.split('0'))))\r\nprint(min(max(n0*x-x+y,0),max(n0*y,0)))\r\n\"\"\"\r\nMy mistake in the previous approach was not the same as that is used now.\r\nI also considerd the ones should only group at the front which is not true ther can group anywhere\r\nbut the thing which has to be considered was that the number of groups of zeroes decrease\r\ndp was also not applicable as there was no optimal substructure\r\n\"\"\"", "# Convert to ones\r\n# http://codeforces.com/contest/998/problem/C\r\n\r\nheader = input()\r\nheader = [int(i) for i in header.split()]\r\n\r\nn = header[0]\r\nrevCost = header[1]\r\nopCost = header[2]\r\n\r\nnumsData = input()\r\n\r\n'''\r\nnums = [2 for _ in range(len(numsData))]\r\n\r\nfor c in range(len(numsData)):\r\n nums[c] = int(numsData[c])\r\n'''\r\n \r\nclusters = 0\r\ni = 0\r\ncomplete = False\r\n\r\n# First cluster ones\r\n\r\nwhile numsData[i] == \"1\":\r\n i += 1\r\n if i >= len(numsData):\r\n complete = True\r\n break\r\n\r\n\r\nif not complete:\r\n while True:\r\n\r\n while numsData[i] == \"0\":\r\n i += 1\r\n if i >= len(numsData):\r\n break\r\n \r\n if i >= len(numsData):\r\n break\r\n\r\n while numsData[i] == \"1\":\r\n i += 1\r\n if i >= len(numsData):\r\n break\r\n\r\n if i >= len(numsData):\r\n break\r\n\r\n clusters += 1\r\n\r\n zeroClusters = clusters\r\n if numsData[0] == \"0\":\r\n zeroClusters += 1\r\n if numsData[0] == \"1\":\r\n zeroClusters += 1\r\n\r\n # here\r\n ansOne = clusters * revCost + opCost\r\n ansTwo = zeroClusters * opCost\r\n\r\n print(min(ansOne, ansTwo))\r\nelse:\r\n print(0)\r\n\r\n#print(clusters)\r\n\r\n\r\n", "import re\r\nimport functools\r\nimport random\r\nimport sys\r\nimport os\r\nfrom math import *\r\nfrom collections import Counter, defaultdict, deque\r\nfrom functools import lru_cache, reduce\r\nfrom itertools import accumulate, combinations, permutations\r\nfrom heapq import nsmallest, nlargest, heapify, heappop, heappush\r\nfrom io import BytesIO, IOBase\r\nfrom copy import deepcopy\r\nimport threading\r\nfrom bisect import bisect_right\r\nBUFSIZE = 4096\r\ninf = float('inf')\r\n \r\nclass FastIO(IOBase):\r\n newlines = 0\r\n \r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n \r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n \r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n \r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n \r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n \r\nsys.stdin = IOWrapper(sys.stdin)\r\nsys.stdout = IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n \r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n\r\ndef count_max(f, s):\r\n return min(f[0], s[1]) + min(f[1], s[2]) + min(f[2], s[0])\r\n\r\ndef get(lo, hi):\r\n return fol(hi) - fol(lo)\r\n\r\ndef fol(n):\r\n return n * (n + 1) * (2 * n + 1) // 6\r\n\r\ndef possible(arr, target, k):\r\n idx = len(arr) // 2\r\n for i in range(idx, len(arr)):\r\n k -= max(0, target - arr[i])\r\n return k >= 0\r\n\r\ndef case1(n, m, first_idx, arr):\r\n ans = 0\r\n for idx in range(first_idx, 0, -1):\r\n can_seat = min(arr[idx] - arr[idx - 1] - 1, max(n, 0))\r\n ans += can_seat\r\n n -= can_seat\r\n if arr[idx - 1] > 0:\r\n ans += 1\r\n return ans\r\n\r\ndef case2(n, m, first_idx, arr):\r\n ans = 0\r\n for idx in range(first_idx, len(arr) - 1):\r\n can_seat = min(arr[idx + 1] - arr[idx] - 1, max(n, 0))\r\n ans += can_seat\r\n n -= can_seat\r\n if arr[idx + 1] <= m:\r\n ans += 1\r\n return ans\r\n\r\ndef solve():\r\n n, x, y = LII()\r\n s = I()\r\n\r\n counter = 0\r\n lo = 0\r\n while lo < n:\r\n if s[lo] == '1':\r\n lo += 1\r\n else:\r\n counter += 1\r\n while lo < n and s[lo] == '0':\r\n lo += 1\r\n return max(counter - 1, 0) * min(x, y) + (1 if counter else 0) * y\r\nn = 1\r\nfor _ in range(n):\r\n print(solve())", "n,x,y=map(int,input().split())\r\ns=str(input())\r\nl=list(s)\r\nif(l.count(\"1\")==n):\r\n print(0)\r\n\r\nelse:\r\n if(s[0]==\"0\"):\r\n c=1\r\n else:\r\n c=0\r\n for i in range(1,n):\r\n if(s[i]==\"0\" and s[i]!=s[i-1]):\r\n c+=1\r\n #print(c)\r\n print(((c-1)*(min(x,y)))+y)\r\n \r\n", "n,x,y=map(int,input().split())\na=input()\ncnt=0\ni=0\nwhile(i<n):\n\tif(a[i]=='0'):\n\t\t# print(i)\n\t\tcnt+=1\n\t\twhile(a[i]=='0' and i<n-1):\n\t\t\t# print(\"loop\",i,a[i])\n\t\t\ti+=1\n\ti+=1\n# print(cnt)\nif(not cnt):\n\tprint(0)\n\texit()\nans=cnt*y\nfor i in range(1,cnt+1):\n\tans=min(ans,i*y+(cnt-i)*x)\n\t# print(ans)\nprint(ans)", "n, x, y = map(int,input().split())\r\na = str(input())\r\n\r\nc1, c0 = 0, 0\r\ni=0\r\nwhile i<n:\r\n if a[i]=='1':\r\n while i<n and a[i]=='1':\r\n i+=1\r\n c1+=1\r\n else:\r\n while i<n and a[i]=='0':\r\n i+=1\r\n c0+=1\r\n \r\n \r\n \r\nif a[0]=='1':\r\n c1-=1\r\nif a[n-1]=='1':\r\n c1-=1\r\nif c1<0:\r\n c1=0\r\n\r\nout = min(c1*x + y, c0*y) \r\nprint(out)\r\n", "from functools import cmp_to_key\r\n\r\ns=input()\r\ns=s.split(\" \")\r\nn=int(s[0])\r\nx=int(s[1])\r\ny=int(s[2])\r\ns=input()\r\ns=list(s)\r\ns.append('2')\r\np=0\r\nfor i in range(1,len(s)):\r\n if s[i]!='0' and s[i-1]=='0':\r\n p+=1\r\nif p==0:\r\n print(0)\r\nelse:\r\n print((p-1)*min(x,y)+y)\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\nfrom itertools import groupby\r\n\r\n\r\nn, x, y = map(int, input().split())\r\ns = input()[:-1]\r\nd = [i for i, j in groupby(s)]\r\na = d.count('0')\r\nif a == 0:\r\n print(0)\r\n exit()\r\n\r\nprint(min(y*a, y+(a-1)*x))", "n, x, y = map(int, input().split())\r\ns = input()\r\nt = s.split(\"1\")\r\nnum = 0\r\nfor i in range(len(t)):\r\n if len(t[i]) > 0:\r\n num += 1\r\nif num == 0:\r\n print(0)\r\nelse:\r\n print(min(x, y) * (num - 1) + y)", "n,x,y=map(int,input().split())\r\ns=input()\r\nc=0\r\nflag=0\r\nfor i in range(n):\r\n if s[i]=='0':\r\n if flag==0:\r\n c+=1\r\n flag=1\r\n else:\r\n flag=0\r\nif c==0:\r\n print(0)\r\nelse:\r\n print((c-1)*min(x,y)+y)\r\n \r\n \r\n", "from itertools import groupby\r\nnoc, x, y = [int(x) for x in input().split()]\r\ns = input()\r\nsg = groupby(s)\r\nsg = [(k, list(g)) for k, g in sg if set(list(g)) == {\"0\"}]\r\nlsg = len(sg)\r\nans = ((len(sg) - 1) * min(x, y) + y)\r\nprint(0 if lsg ==0 else ans)", "n,x,y=map(int,input().split())\r\ns=input()\r\nc=0\r\nfor i in range(1,n):\r\n if s[i]=='1' and s[i-1]=='0':\r\n c+=1\r\nif s[-1]=='0':\r\n c+=1\r\nif c==0:\r\n print(0)\r\nelif x>=y:\r\n print(c*y)\r\nelse:\r\n print((c-1)*x+y)\r\n", "n, x, y = map(int, input().split());\r\ns = input()\r\nne = 0;\r\ncount = 0;\r\nfor i in range(1, n + 1):\r\n if (s[i - 1] == '0'):\r\n count += 1;\r\n if (s[i - 1] == '1' or (s[i - 1] == '0' and i > 1 and s[i - 2] == '0')):\r\n p = ne;\r\n elif count == 1:\r\n ne += y;\r\n \r\n else:\r\n ne += min(x, y);\r\nprint(ne)", "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\n\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\n######### --- Actual Codes ---- ######\r\n\r\nn,x,y = invr()\r\ns = input()\r\n\r\n\"\"\"\r\n字符串形式是 0..01..10..01..1 0..0 1..1\r\n\r\n直接翻 3y\r\n翻到一起 2x + y\r\n\r\n如果 翻转 操作 x 代价 加上一次 y 操作 比 2y更小 => 总是先翻转到一起在取反\r\n\r\nx < y的情况\r\nx > y\r\n\"\"\"\r\n\r\nnum_z = 0\r\n\r\ni = 0\r\nwhile i < n:\r\n while i < n and s[i] == '1':\r\n i += 1\r\n \r\n if i < n: num_z += 1\r\n else: break\r\n\r\n while i < n and s[i] == '0':\r\n i += 1\r\n\r\nif num_z == 0:\r\n print(0)\r\nelif x < y:\r\n print((num_z - 1) * x + y)\r\nelse:\r\n print(num_z * y)\r\n", "n,x,y = map(int,input().split())\r\n\r\ns=input()\r\nl=-1 \r\nr=-1 \r\nans = []\r\nfor i in range(n):\r\n if s[i]=='0':\r\n ans.append(i)\r\nif len(ans)==0:\r\n print(0)\r\nelse:\r\n a=1\r\n for i in range(1,len(ans)):\r\n if ans[i]!=ans[i-1]+1 :a+=1 \r\n print((a-1)*min(x,y)+y)\r\n \r\n \r\n \r\n \r\n \r\n ", "from collections import deque, Counter, OrderedDict\r\nfrom heapq import nsmallest, nlargest\r\nfrom math import ceil,floor,log,log2,sqrt,gcd,factorial\r\ndef binNumber(n,size=1):\r\n return bin(n)[2:].zfill(size)\r\n\r\ndef iar():\r\n return list(map(int,input().split()))\r\n\r\ndef ini():\r\n return int(input())\r\n\r\ndef isp():\r\n return map(int,input().split())\r\n\r\ndef sti():\r\n return str(input())\r\n\r\n# ========= /\\ /| |====/|\r\n# | / \\ | | / |\r\n# | /____\\ | | / |\r\n# | / \\ | | / |\r\n# ========= / \\ ===== |/====| \r\n# code\r\n\r\nif __name__ == \"__main__\":\r\n n,x,y = isp()\r\n s = sti()\r\n p = 0\r\n vl = False\r\n for i in range(0,n-1):\r\n if s[i] == '0':\r\n if vl == False:\r\n p += 1\r\n vl = True\r\n if s[i] != s[i+1]:\r\n vl = False\r\n if s[n-1] == '0':\r\n if vl == False:\r\n p += 1\r\n \r\n #print(p)\r\n if p == 0:\r\n print(0)\r\n else:\r\n print((p-1)*min(x,y) + y)\r\n\r\n ", "# HEY STALKER\r\nn, a, b = map(int, input().split())\r\nl = list(map(int, input()))\r\n\r\nf = True\r\nans = 0\r\nfor t in l:\r\n if t == 0 and f:\r\n ans += 1\r\n f = False\r\n if t == 1:\r\n f = True\r\nif ans == 0:\r\n print(0)\r\nelif b <= a:\r\n print(ans*b)\r\nelse:\r\n print(((ans-1)*a)+b)", "n, x, y = map(int, input().split())\r\na = str(input())\r\nf = 1\r\nd = 0\r\nif a.find('0') == - 1:\r\n print(0)\r\nelse:\r\n for i in a:\r\n if i == '0' and f == 1:\r\n d += 1\r\n f = 0\r\n elif i == '1':\r\n f = 1\r\n\r\n print((d - 1) * min(x, y) + y)\r\n", "n, x, y = map(int, input().split())\r\n\r\ns = input().replace(\"1\", \" \")\r\nz = len(s.split())\r\nprint(z and (z-1)*min(x,y)+y)\r\n", "n,x,y=map(int,input().split())\ns=input()\na=[0]*int(3e5+5)\nb=[0]*int(3e5+5)\nfor i in range(n):\n a[i+1]=ord(s[i])-ord('0')\na[0]=-1\ncnt=0\nfor i in range(1,n+1):\n if a[i]!=a[i-1]:\n cnt+=1\n b[cnt]=a[i]\nct=0\nfor i in range(1,cnt+1):\n if b[i]==0:\n ct+=1\nif ct==0:\n print(0)\n exit()\nif x>=y:\n print(ct*y)\nelse:\n print(y+x*(ct-1))\n\n\n \t\t \t \t\t\t\t \t\t \t \t \t\t\t\t \t", "n,x,y=map(int,input().split())\r\ns=input()\r\nif s.count('0')==0:\r\n print(0)\r\nelse:\r\n p=0\r\n for i in range (0,n):\r\n if s[i]=='0' and ((i<=n-2 and s[i+1]=='1') or i==n-1):\r\n p+=1\r\n print((min(x,y)*(p-1))+y)\r\n\r\n\r\n\r\n\r\n", "import re\r\nR = lambda: map(int, input().split())\r\n\r\nn, x, y = R()\r\ns = input()\r\n\r\ns = re.sub(r'1+', '1', s)\r\ns = re.sub(r'0+', '0', s)\r\ns = re.sub(r'^1', '', s)\r\ns = re.sub(r'1$', '', s)\r\n\r\nn = (len(s) + 1) // 2\r\nans = n * y\r\nfor i in range(n):\r\n ans = min(ans, i*x + (n-i)*y)\r\nprint(ans)", "n,x,y=map(int,input().split())\r\na=input()\r\nif n==1 and a[0]=='0':\r\n\tprint(y)\r\nelif n==1:\r\n\tprint(\"0\")\r\nelse:\r\n\tmx=0\r\n\tfor i in range(n-1):\r\n\t\tif (a[i]=='0' and a[i+1]=='1') or (i==n-2 and(a[i]=='0' or a[i+1]=='0')):\r\n\t\t\tmx+=y\r\n\tmx2=0\r\n\tchange=0\r\n\tfor i in range(n-1):\r\n\t\tif a[i]=='1' and a[i+1]=='0'and change!=0:\r\n\t\t\tmx2+=x\r\n\t\tif a[i]=='0':\r\n\t\t\tchange=1\r\n\tmx2+=y\r\n\tprint(min(mx,mx2))", "n, x, y = map(int, input().split())\r\ns = input()\r\nk = 0\r\nif s[0] == '0':\r\n k = k + 1\r\nfor i in range(1, n):\r\n if s[i] == '0' and s[i - 1] == '1':\r\n k = k + 1\r\nif k == 0:\r\n print(0)\r\nelse:\r\n if x < y:\r\n print((k - 1) * x + y)\r\n else:\r\n print(k * y)", "n, x, y = list(map(int, input().split()))\ns = input()\np = 0\ng = False\nfor i in s:\n if i == \"0\":\n if not g:\n p += 1\n g = True\n else:\n g = False\nif p == 0:\n print(0)\nelse:\n print((p - 1) * min(x, y) + y)", "n, x, y = map(int, input().split())\na = input()\na = a.strip('1')\nn = len(a)\n\nc = 0\ni = 0\nwhile i < n:\n try:\n i1 = a.index('1', i)\n if x < y:\n try:\n i = a.index('0', i1)\n except:\n i = n\n c += x\n else:\n i = a.index('0', i1)\n c += y\n except:\n i = n\n c += y\nprint(c)\n", "from __future__ import print_function\r\nimport sys\r\nimport math\r\nimport os.path\r\nimport random\r\nfrom copy import deepcopy\r\nfrom functools import reduce\r\n\r\n\r\nfrom collections import Counter, ChainMap, defaultdict\r\nfrom itertools import cycle, chain\r\nfrom queue import Queue, PriorityQueue\r\nfrom heapq import heappush, heappop, heappushpop, heapify, heapreplace, nlargest, nsmallest\r\nimport bisect\r\n\r\nfrom statistics import mean, mode, median, median_low, median_high\r\n\r\n\r\n# CONFIG\r\nsys.setrecursionlimit(10**9)\r\n\r\n# LOG \r\ndef log(*args, **kwargs):\r\n print(*args, file=sys.stderr, **kwargs)\r\n\r\n\r\n# INPUT\r\ndef ni():\r\n return map(int, input().split())\r\n\r\n\r\ndef nio(offset):\r\n return map(lambda x: int(x) + offset, input().split())\r\n\r\n\r\ndef nia():\r\n return list(map(int, input().split()))\r\n\r\n\r\n# CONVERT\r\ndef toString(aList, sep=\" \"):\r\n return sep.join(str(x) for x in aList)\r\n\r\n\r\ndef toMapInvertIndex(aList):\r\n return {k: v for v, k in enumerate(aList)}\r\n\r\n\r\n# SORT\r\ndef sortId(arr):\r\n return sorted(range(arr), key=lambda k: arr[k])\r\n\r\n\r\n# MAIN\r\n\r\nn,x,y = ni()\r\ns = input()\r\n\r\nc0 = 1 if s[0] == \"0\" else 0 \r\nc0 += s.count(\"10\")\r\n\r\n\r\nif c0 == 0:\r\n print(0)\r\nelif c0 == 1:\r\n print(y)\r\nelse:\r\n # log(s)\r\n # log(c0)\r\n # log( (c0-1)*x + y, c0*x )\r\n print(min( (c0-1)*x + y, c0*y ))\r\n ", "n,x,y=map(int,input().split())\r\na=['1']+list(input())\r\nc=0\r\n#print(a)\r\nfor i in range(n):\r\n if a[i:i+2]==[\"1\",\"0\"]:\r\n c+=1\r\n#print(c) \r\nprint(max(c-1,0)*min(x,y)+(y if c>=1 else 0))", "import sys\r\nn,x,y = map(int,input().split())\r\ns = input()\r\n\r\nif s.count('1') == n:\r\n print (0)\r\n sys.exit()\r\nif x > y:\r\n started = False\r\n sep = 0\r\n for c in s:\r\n if c == '0' and started:continue\r\n if c == '0' and not started:\r\n sep += 1\r\n started = True\r\n if c == '1':\r\n started = False\r\n print (y*sep)\r\n sys.exit()\r\n\r\nstarted = False\r\nsep = 0\r\nfor c in s:\r\n if c == '0' and started:continue\r\n if c == '0' and not started:\r\n sep += 1\r\n started = True\r\n if c == '1':\r\n started = False\r\nprint ((sep-1) * x + y)\r\n", "# python3\nn, x, y = map(int, input().split())\nz = len(input().replace('1', ' ').split())\nprint(z and (z - 1) * min(x, y) + y)\n", "n, x, y = map(int, input().split(\" \"))\r\ns = input()\r\n\r\nisolated = 0\r\nones = 0\r\nlast = \"1\"\r\nfor digit in s:\r\n if digit == \"1\" and last == \"0\":\r\n isolated += 1\r\n if digit == \"0\":\r\n ones += 1\r\n last = digit\r\n\r\nif last == \"0\":\r\n isolated += 1\r\n\r\nif ones == 0:\r\n print(0)\r\nelse:\r\n print(min(isolated * y, (isolated - 1) * x + y))\r\n", "n,x,y = map(int,input().split())\ns = input()\ncount = 0\ni = 0\nwhile (i<n):\n j = i\n while (j<n and s[j]==s[i]):\n j += 1\n if (s[i]==\"0\"):\n count += 1\n i = j\nans = 0\nif (count>0):\n ans = min(x,y)*(count-1) + y\nprint(ans)\n", "n,x,y=[int(i) for i in input().split()]\r\ns=input()\r\nfirst=0\r\nsec=0\r\nflag=0\r\nfor i in range(len(s)):\r\n if(s[i]=='1' and flag==1):\r\n first+=1\r\n flag=0\r\n if(s[i]=='0'):\r\n flag=1\r\nif(flag==1):\r\n first+=1\r\nif(first==0):\r\n print(0)\r\nelse:\r\n first-=1\r\n cost=y\r\n cost+=first*min(x,y)\r\n print(cost)\r\n \r\n\r\n \r\n", "def main():\r\n n,x,y = map(int,input().split())\r\n s = input()\r\n curr = ''\r\n zero = 0\r\n for i in s:\r\n if i != curr:\r\n if curr == '0':\r\n zero += 1\r\n\r\n curr = i\r\n\r\n if curr == '0':\r\n zero += 1\r\n\r\n min_val = float('inf')\r\n for i in range(zero,0,-1):\r\n min_val = min(min_val, y*i + (zero-i)*x)\r\n\r\n if min_val == float('inf'):\r\n min_val = 0\r\n \r\n print(min_val)\r\n \r\nmain()\r\n", "n, x, y=map(int, input().split())\r\ns=input().strip()\r\nzero=0\r\nif s.count('0')==0:\r\n\tprint(0)\r\n\texit()\r\ncnt=sum([1 for x in s.split('1') if len(x)>0])\r\nprint((cnt-1)*min(x, y)+y)\r\n", "n, x, y = map(int, input().split())\r\nu = list(map(int, input()))\r\nd0 = 0\r\nk0 = 0\r\nfor i in range(n):\r\n if k0 == 1 and u[i] == 1:\r\n d0 += 1\r\n k0 = 0\r\n elif u[i] == 0:\r\n k0 = 1\r\nif k0 == 1:\r\n d0 += 1\r\nif d0 == 0:\r\n p = 0\r\nelse:\r\n p = (d0 - 1) * min(x, y) + y\r\nprint(p)\r\n", "import re\r\nn, x, y = map(int, input().split())\r\nnum = len(re.findall(\"0+\", input()))\r\nprint((num - 1) * min(x, y) + y if num != 0 else 0)\r\n", "n, x, y = map(int, input().split())\r\np = len(input().replace('1', ' ').split())\r\nprint([0, (p - 1) * min(x, y) + y][p > 0])\r\n", "import re\r\n\r\n_, x, y = map(int, input().split())\r\nn = len(re.findall('0+', input()))\r\nprint(y + (n - 1) * min(x, y) if n else 0)\r\n", "n, x, y = map(int, input().split())\r\ns = '1'+input().strip()\r\nc = s.count('10')\r\nprint(0 if c == 0 else y * c if y <= x else (x * c + y - x))", "# python3\ndef readline(): return map(int, input().split())\n\n\ndef main():\n n, x, y = readline()\n line = input()\n\n zero_segments = line.count('10') + line.startswith('0')\n\n print((zero_segments - 1) * min(x, y) + y if zero_segments else 0)\n\n\nmain()\n", "n,x,y=map(int,input().split())\r\nl=list(input())\r\nif l.count('1')==n:\r\n print(0)\r\n exit()\r\ncnt=0 \r\ncnt0=0 \r\nfrom itertools import groupby \r\nfor k,g in groupby(l):\r\n cnt+=1\r\n cnt0+=(k=='0')\r\nprint(min(x,y)*(cnt0-1)+y)\r\n", "n, x, y = map(int, input().split())\r\ns = input().strip()\r\nfrom itertools import groupby\r\nb = [1 if k == '1' else 0 for k, g in groupby(s)]\r\n# print(b)\r\n\r\ndp = [0] * len(b)\r\ndp[0] = y if b[0] == 0 else 0\r\nfor i in range(1, len(b)):\r\n\tif b[i] == 0:\r\n\t\tdp[i] = dp[i - 1] + y\r\n\t\tif i >= 2:\r\n\t\t\tdp[i] = min(dp[i], x + dp[i - 2])\r\n\telse:\r\n\t\tdp[i] = dp[i - 1]\r\nprint(dp[-1])", "n, x, y = map(int, input().split())\r\na = input()\r\ncnt = 0\r\nprev = '1'\r\nfor ai in a:\r\n if prev == '1' and ai == '0': cnt += 1\r\n prev = ai\r\nif cnt == 0:\r\n print(0)\r\nelse:\r\n print(min(x,y)*(cnt-1)+y)", "n,x,y = map(int,input().split())\r\ns = input().split('1')\r\na=[]\r\nfor i in s:\r\n if i!='':\r\n a.append(i)\r\ncnt = len(a)\r\nans = 10000000000000000000000000000000000000\r\nflag=0\r\nfor i in range(cnt):\r\n flag=1\r\n p = i\r\n q = cnt - i\r\n val = p*x + q*y\r\n ans = min(ans,val)\r\nif flag==1:\r\n print(ans)\r\nelse:\r\n print(0)\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 n,x,y=map(int,input().split())\r\n s=input()\r\n s='1'+s+'1'\r\n flag=0\r\n cnt=0\r\n for i in range(1,len(s)):\r\n if s[i-1]=='1' and s[i]=='0':\r\n cnt+=1;\r\n if cnt==0:\r\n print(0)\r\n else:\r\n if x<y:\r\n print((cnt-1)*x+y)\r\n else:\r\n print((cnt)*y)\r\nsolution()", "n, x, y = list(map(int, input().split()))\r\na = input()\r\n\r\na = a + '1'\r\ncnt = 0\r\n\r\nfor i in range(n):\r\n if a[i] == '0' and a[i + 1] == '1':\r\n cnt += 1\r\n\r\nif cnt == 0:\r\n print(0)\r\n exit()\r\nprint(min(y * cnt, y + (cnt - 1) * x))", "from math import *\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef main():\r\n\r\n\tn, x, y = [int(x) for x in input().split(' ')]\r\n\ts = input().strip()\r\n\r\n\tcnt = 0\r\n\ti = 0\r\n\twhile(i < len(s)):\r\n\r\n\t\tgood = False\r\n\t\twhile(i < len(s) and s[i] == '0'):\r\n\t\t\ti += 1\r\n\t\t\tgood = True\r\n\r\n\t\tcnt += good\r\n\r\n\t\twhile(i < len(s) and s[i] == '1'):\r\n\t\t\ti += 1\r\n\r\n\r\n\tbest = 0 if cnt==0 else 1e20\r\n\tfor i in range(1, cnt+1):\r\n\t\tbest = min(best, (cnt-i)*x + i*y) \r\n\r\n\r\n\tprint(best)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\tmain()\r\n", "#\n# _____ _____ _____ \n# /\\ \\ /\\ \\ /\\ \\ \n# /::\\____\\ /::\\ \\ /::\\____\\ \n# /:::/ / /::::\\ \\ /:::/ / \n# /:::/ / /::::::\\ \\ /:::/ / \n# /:::/ / /:::/\\:::\\ \\ /:::/ / \n# /:::/____/ /:::/__\\:::\\ \\ /:::/____/ \n# /::::\\ \\ \\:::\\ \\:::\\ \\ /::::\\ \\ \n# /::::::\\ \\ _____ ___\\:::\\ \\:::\\ \\ /::::::\\ \\ _____ \n# /:::/\\:::\\ \\ /\\ \\ /\\ \\:::\\ \\:::\\ \\ /:::/\\:::\\ \\ /\\ \\ \n# /:::/ \\:::\\ /::\\____\\/::\\ \\:::\\ \\:::\\____\\/:::/ \\:::\\ /::\\____\\\n# \\::/ \\:::\\ /:::/ /\\:::\\ \\:::\\ \\::/ /\\::/ \\:::\\ /:::/ /\n# \\/____/ \\:::\\/:::/ / \\:::\\ \\:::\\ \\/____/ \\/____/ \\:::\\/:::/ / \n# \\::::::/ / \\:::\\ \\:::\\ \\ \\::::::/ / \n# \\::::/ / \\:::\\ \\:::\\____\\ \\::::/ / \n# /:::/ / \\:::\\ /:::/ / /:::/ / \n# /:::/ / \\:::\\/:::/ / /:::/ / \n# /:::/ / \\::::::/ / /:::/ / \n# /:::/ / \\::::/ / /:::/ / \n# \\::/ / \\::/ / \\::/ / \n# \\/____/ \\/____/ \\/____/ \n#\nn, x, y = map(int, input().split())\ns = input()\ncnt, tmp = 0, 0\nfor i in s:\n if i == '1':\n if tmp:\n cnt += 1\n tmp = 0\n else:\n tmp += 1\nif tmp:\n cnt += 1\nif cnt > 0:\n print(min(x, y)*(cnt-1)+y)\nelse:\n print(0)\n", "import sys\nimport itertools\n\nn, x, y = [int(i) for i in input().split()]\ns = input()\n\ns = s.strip('1')\nif not s:\n print(0)\n sys.exit()\n\nt = 0\nfor k in itertools.groupby(s):\n t += 1\n\nt = (t // 2) + 1\n\nprint(min((t - 1) * x + y, t * y))\n", "n, a, b = map(int, input().split())\r\ns = input()\r\nk = sum(map(lambda x,y: x=='1' and y=='0', s, s[1:]))\r\nk += s[0] == '0'\r\nprint (b+min(a,b)*(k-1) if k else 0)", "n,x,y=map(int,input().split())\r\ns=list(map(int,list(input())))\r\nif s[0]==0:se=1\r\nelse:se=0\r\nr=s[0]\r\nfor i in range(1,n):\r\n if s[i] == int(not(r)) and r==1:\r\n se+=1;r=0\r\n elif s[i] == int(not(r)):\r\n r=1\r\nk=se*y\r\nfor i in range(1,se):\r\n k=min(k,(se-i)*y + i*x)\r\nprint(k)", "\nif __name__ == \"__main__\":\n n,x,y = map(int,input().split())\n ans = 0\n s = input()\n for i in range(n-1):\n if(s[i]== '0' != s[i+1]):\n ans += 1\n if s[n-1] == '0':\n ans += 1\n\n if ans == 0:\n print(0)\n else:\n print((ans-1)*min(x,y) + y)\n\n \t\t\t \t \t \t \t\t \t\t \t\t\t \t", "n, x, y = map(int, input().split())\r\na = str(input())\r\ncnt, k = 0, 0\r\n\r\nfor i in range(n):\r\n if (a[i] == '0'):\r\n cnt += 1\r\n else:\r\n if (cnt > 0):\r\n k += 1\r\n \r\n cnt = 0\r\n \r\nif (cnt > 0):\r\n k += 1\r\n \r\nif (k == 0):\r\n print(0)\r\nelse:\r\n print((k - 1) * min(x, y) + y)", "if __name__ == '__main__':\n n, x, y = map(int, input().split())\n s = list(input())\n\n arr = [s[0]]\n\n for i in range(1, n):\n if s[i] != s[i - 1]:\n arr.append(s[i])\n\n if len(arr) == 1 and arr[0] == '1':\n print(0)\n exit(0)\n\n c = arr.count('0')\n\n xarr = [0]\n yarr = [y]\n\n for i in range(1, c):\n xarr.append(xarr[-1] + x)\n yarr.append(yarr[-1] + y)\n\n yarr.reverse()\n\n print(min(map(lambda o: o[0] + o[1], zip(xarr, yarr))))\n", "def main():\n n, x, y = map(int, input().split())\n s, zo, a = input(), [0, 0], ' '\n for b in s:\n if a != b:\n zo[b == '1'] += 1\n a = b\n z, o = zo\n if s[0] == '1':\n o -= 1\n if s[-1] == '1':\n o -= 1\n if o < 0:\n o = 0\n print(min(z * y, o * x + y))\n\n\nif __name__ == '__main__':\n main()\n", "def main():\r\n\tn, x, y = list(map(int, input().split()))\r\n\ta = input()\r\n\tislands = a[0] == \"0\"\r\n\tfor i in range(1, n):\r\n\t\tif a[i] == \"0\":\r\n\t\t\tislands += a[i - 1] == \"1\"\r\n\tif islands == 0:\r\n\t\tprint(0)\r\n\t\treturn 0\r\n\tif x >= y:\r\n\t\tprint(y * islands)\r\n\telse:\r\n\t\tprint(x * (islands - 1) + y)\r\n\t#cost = y * islands + i * (x - y)\r\n\treturn 0\r\nmain()", "\ndef solve(s, cr, cn):\n count = 0\n for i in range(len(s)):\n if s[i] == '0' and (i == 0 or s[i - 1] == '1'):\n count += 1\n return (count - 1) * min(cr, cn) + cn if count > 0 else 0\n\n\n_, cr, cn = map(int, input().split())\ns = input()\nprint(solve(s, cr, cn))\n", "n, cx, cy = [int(x) for x in input().split()]\ns = input()\n\ng0 = 0\nfor i in range(n):\n if s[i] == '0' and (i == 0 or s[i - 1] == '1'):\n g0 += 1\n\nif g0 == 0:\n print('0')\nelse:\n def cost(x):\n return (g0 - x)*cy + cx*x\n\n best_x = None\n for x in range(g0):\n if best_x is None or cost(x) < cost(best_x):\n best_x = x\n\n best_y = g0 - best_x\n\n print(best_x * cx + best_y * cy)\n\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nn,x,y = map(int, input().split())\r\nS = input()\r\nA = [S[0]]\r\nfor c in S[1:]:\r\n if c==A[-1]:\r\n continue\r\n else:\r\n A.append(c)\r\n\r\ncnt = A.count('0')\r\nif cnt==0:\r\n print(0)\r\nelse:\r\n print(y+min((cnt-1)*x, (cnt-1)*y))", "n,x,y =map(int,input().split())\r\n\r\nss = input().strip()\r\n\r\nL = len(ss)\r\n\r\ni = 0\r\nlast = -1\r\ncnt = 0\r\nwhile i<L :\r\n if ss[i] == '1' :\r\n if last == 0 : cnt += 1\r\n last = 1\r\n else :\r\n last = 0\r\n i += 1\r\n\r\nif ss[L-1] == '0' : cnt += 1 \r\n\r\nans = 0\r\n\r\nif x<y : ans = ( cnt - 1 ) * x + y\r\nelse : ans = cnt * y\r\n\r\nif cnt == 0 : ans = 0\r\n\r\nprint(int(ans))", "n, x, y = list(map(int, (input().split(\" \"))))\ns = list(map(int, list(input())))\n\nt = []\nlast0 = False\nisfirst = True\nfor i in s:\n if i == 0:\n if isfirst:\n t.append(i)\n isfirst = False\n last0 = True\n else:\n if last0:\n continue\n else:\n last0 = True\n t.append(i)\n else:\n if isfirst:\n t.append(i)\n isfirst = False\n last0 = False\n if not last0:\n continue\n else:\n last0 = False\n t.append(i)\n\nif x < y: #дорогая замена\n s = 0\n for i in t:\n if i == 0:\n s += 1\n if s != 0:\n print((s - 1) * x + y)\n else:\n print(0)\n \nelse: #дорогой разворот\n s = 0\n for i in t:\n if i == 0:\n s += 1\n print(s * y)\n\n", "import sys\r\nn,x,y=map(int,sys.stdin.readline().split())\r\ns=input()\r\na=0\r\nfor i in range(n-1):\r\n if s[i]=='0':\r\n if s[i]!=s[i+1]:\r\n a+=1 \r\nif s[n-1]=='0':\r\n a+=1 \r\nif a==0:\r\n print(0)\r\nelse:\r\n print((a-1)*(min(x,y))+y) ", "# -*- coding: utf-8 -*-\r\n\r\n\r\ndef problem():\r\n in1 = input()\r\n in2 = input()\r\n# in1 = '5 5 10'\r\n# in2 = '101010'\r\n\r\n inp1 = list(map(int, in1.split()))\r\n n = inp1[0]\r\n exc_cost = inp1[1]\r\n flip_cost = inp1[2]\r\n \r\n s = in2;\r\n zeros = 0\r\n\r\n sign = s[0]\r\n \r\n for num in s[1:]:\r\n# print(num)\r\n if (num != sign):\r\n if (sign == '0'):\r\n zeros += 1\r\n sign = num\r\n\r\n if (sign == '0'):\r\n zeros += 1\r\n \r\n if zeros == 0:\r\n return 0\r\n\r\n if zeros == 1:\r\n return flip_cost\r\n \r\n cost1 = (zeros - 1) * exc_cost + flip_cost\r\n cost2 = zeros * flip_cost\r\n \r\n if (cost1 <= cost2):\r\n return cost1\r\n else:\r\n return cost2\r\n\r\nresult = problem()\r\n\r\nprint(result)\r\n ", "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 string\r\nimport sys\r\nimport time\r\n\r\nsys.setrecursionlimit(99999)\r\nn, x, y = map(int, input().split())\r\ns = input()\r\np = 0\r\nfor k, v in itertools.groupby(s):\r\n if k == '0':\r\n p += 1\r\n\r\nif not p:\r\n print(0)\r\nelse:\r\n ans = p * y\r\n ans = min(ans, y + (p - 1) * x)\r\n print(ans)", "import re\r\n\r\nn, x, y = map(int, input().split())\r\ns = input()\r\n\r\nif s.count(\"1\") == len(s):\r\n print(0)\r\nelse:\r\n nGroups = len([x for x in re.findall(\"1*\", s) if x])\r\n if s[0] == '1':\r\n nGroups -= 1\r\n if s[-1] == '1':\r\n nGroups -= 1\r\n print(min(nGroups * x + y, (nGroups + 1) * y))", "n,x,y=map(int,input().split())\r\na=input()+\"1\"\r\ncnt=a.count(\"01\")\r\nif cnt==0:\r\n print(0)\r\nelse:\r\n print((cnt-1)*min(x,y)+y)", "n, x, y = map(int, input().split())\ns = input()\nnGroups = int(s[0] == '0')\nfor i in range(1, n):\n if s[i - 1] != s[i] == '0':\n nGroups += 1\nif nGroups == 0:\n print(0)\nelse:\n print((nGroups - 1) * min(x, y) + y)\n", "n, x, y=map(int, input().split())\r\narr=input()\r\niss=False\r\nfor i in range(0, n):\r\n\tif arr[i]=='0':\r\n\t\tiss=True\r\nif iss==False:\r\n\tprint(0)\r\n\texit()\r\ncoun=0\r\nfor i in range(n-1):\r\n\tif arr[i]=='0' and arr[i+1]=='1':\r\n\t\tcoun+=1\r\nif arr[n-1]=='0':\r\n\tcoun+=1\r\nprint(min(coun*y, (coun-1)*x+y))", "n,x,y = map(int,input().split())\r\nans = 0\r\np = 0\r\nl = list(map(int,list(input())))\r\nfor i in range(n):\r\n if l[i] ==1:\r\n p = 0\r\n elif l[i] == 0 and p==0:\r\n p =1\r\n ans+=1\r\nif ans == 0:\r\n print(0)\r\nelse:\r\n print(min(x*(ans-1)+y,y*ans))", "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\n\r\ndef main():\r\n n, x, y = map(int, input().split())\r\n s = input()[:-1]\r\n s += \"1\"\r\n count = 0\r\n for i in range(1, n + 1):\r\n if s[i] == \"1\" and s[i - 1] == \"0\":\r\n count += 1\r\n if count == 0:\r\n print(0)\r\n else:\r\n print(y + min(x, y) * (count - 1))\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "import math,sys\nfrom sys import stdin, stdout\nfrom collections import Counter, defaultdict, deque\ninput = stdin.readline\nI = lambda:int(input())\nli = lambda:list(map(int,input().split()))\n\ndef case():\n n,x,y=li()\n s=input().strip().split('1')\n c=0 \n for i in s:\n if(i!=\"\"):\n c+=1\n if(c==0):\n print(0)\n return \n print(min((c-1)*x+y,c*y))\n\nfor _ in range(1):\n case()", "import sys\nbla, wort, *_ = sys.stdin.read().split('\\n')\nn, x, y = [int(z) for z in bla.split(' ')]\nanz = wort[0] == '0'\nfor a, b in zip(wort[:-1], wort[1:]):\n if b=='0' and a!='0':\n anz += 1\nif anz==0:\n print(0)\nelse:\n print(y + min(x, y)*(anz-1))\n \n", "from __future__ import print_function # for PyPy2\nfrom collections import Counter, OrderedDict\nfrom itertools import permutations as perm\nfrom collections import deque\nfrom sys import stdin\nfrom bisect import *\nfrom heapq import *\nimport math\n \ng = lambda : stdin.readline().strip()\ngl = lambda : g().split()\ngil = lambda : [int(var) for var in gl()]\ngfl = lambda : [float(var) for var in gl()]\ngcl = lambda : list(g())\ngbs = lambda : [int(var) for var in g()]\nmod = int(1e9)+7\ninf = float(\"inf\")\n\nn, rev, flip = gil()\na = gbs()\ncnt = 0\nans = 0 \n\nwhile a:\n\twhile a and a[-1]:\n\t\ta.pop()\n\tif a and a[-1]==0 : cnt += 1\n\twhile a and a[-1]==0:\n\t\ta.pop()\n\nif cnt:\n\tans = min(flip*cnt, flip + (cnt-1)*rev)\n\nprint(ans)", "n,x,y = [int(x) for x in input().split()]\ns = input()\n\nc=0\nfor i in range(0,len(s)-1):\n if s[i]=='0' and s[i+1]=='1':\n c+=1\n\nif(s[len(s)-1])=='0':\n c+=1\nif c==0:\n print(0)\nelse:\n print((c-1)*min(x,y)+y)\n", "n,x,y=map(int,input().split(' '))\r\nw=str(input())\r\ncnt=int(w[0]=='0')\r\nfor i in range(1,n):\r\n if w[i]=='0' and w[i-1]=='1': cnt+=1\r\n\r\nif cnt==0: \r\n print(0)\r\nelse:\r\n\r\n res=y+min(x,y)*(cnt-1)\r\n print(res)" ]

[ "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Sep 19 15:47:18 2023\r\n\r\n@author: lenovo\r\n\"\"\"\r\n\r\na,b=map(int,input().split())\r\ns=0\r\nwhile a<=b:\r\n a*=3\r\n b*=2\r\n s=s+1\r\nprint(s)\r\n", "sign = True\r\na,b = map(int,input().split())\r\nyear = 0\r\nwhile sign:\r\n a *= 3\r\n b *= 2\r\n year += 1\r\n if a > b:\r\n sign = False\r\nprint(year)", "n1 , n2 = map(int,input().split())\r\ncount=0\r\nwhile True:\r\n if n1>n2:\r\n break\r\n else:\r\n n1=n1*3\r\n n2=n2*2\r\n count+=1\r\nprint(count)", "a, b = map(int, input().split())\r\nyears = 0\r\ni = 0\r\n\r\nwhile True:\r\n if a <= b:\r\n a *= 3\r\n b *= 2\r\n if a > b:\r\n years += (i + 1)\r\n break\r\n\r\n i += 1\r\n \r\nprint(years)\r\n\r\n\r\n", "Limak, Bob = map(int, input().split())\r\nt = 0\r\nwhile True:\r\n Limak = Limak*3\r\n Bob = Bob*2\r\n t += 1\r\n if Limak > Bob:\r\n print(t)\r\n break", "l, b = map(int, input().split())\r\nyears = 1\r\nwhile l <= b:\r\n l = 3 * l\r\n b = 2 * b\r\n years += 1\r\nprint(years - 1)", "d,e=map(int,input().split())\r\ncnt=0\r\nwhile d<=e:\r\n\td=d*3\r\n\te=e*2\r\n\tcnt+=1\r\nprint(cnt)", "a,b = map(int, input().split())\r\ni = 0\r\nwhile True:\r\n a=a*3\r\n b=b*2\r\n i=i+1\r\n if a > b:\r\n print(i)\r\n break\r\n\r\n", "def bear():\n user = input()\n sep_weights = user.split(\" \")\n a = int(sep_weights[0])\n b = int(sep_weights[1])\n t = 0\n \n while a <= b:\n a *= 3\n b *= 2\n t += 1\n \n print(t)\n \n\nbear() \n \t \t\t \t\t\t \t\t \t \t \t\t\t\t\t\t \t\t", "k=list(map(int,input().split(' ')))\r\ni=0\r\nwhile k[0]<=k[1]:\r\n k[0]=k[0]*3\r\n k[1]=k[1]*2\r\n i=i+1\r\nprint(i)", "result = \"\"\r\ns = input().split(\" \")\r\na = int(s[0])\r\nb = int(s[1])\r\nif 1 <= a and a <= b and b <= 10:\r\n amountOfYears = 0\r\n while True:\r\n a = a * 3\r\n b = b * 2\r\n amountOfYears += 1\r\n if a > b:\r\n result = amountOfYears\r\n break\r\n print(f\"{result}\")", "a,b = map(int,input().split())\r\ncount = 0\r\nwhile a<=b:\r\n a*=3\r\n b*=2\r\n count += 1\r\nprint(count)", "weights = input()\r\nwhitespace = weights.index(\" \")\r\n\r\nlil_weight = \"\"\r\nbig_weight = \"\"\r\n\r\nfor i in range(0, len(weights)):\r\n\r\n if i < whitespace:\r\n\r\n lil_weight += weights[i]\r\n\r\n elif i > whitespace:\r\n\r\n big_weight += weights[i]\r\n\r\n\r\nlil_weight = int(lil_weight)\r\nbig_weight = int(big_weight)\r\n\r\n\r\nyear_counter = 0\r\n\r\nwhile lil_weight <= big_weight:\r\n\r\n year_counter += 1\r\n\r\n lil_weight *= 3\r\n big_weight *= 2\r\n\r\n\r\nprint(year_counter)", "a,b=map(int,input().split())\ncount=0\nwhile a <= b:\n a=a*3\n b=b*2\n count += 1\nprint(count)\n", "\r\nb1,b2 = map(int,input().split())\r\ny = 0\r\nwhile b1 <= b2 :\r\n b1 = 3*b1\r\n b2 = 2*b2\r\n y += 1\r\n \r\nprint(y)", "year=0\r\na,b=map(int,input().split())\r\nwhile a<=b:\r\n a*=3\r\n b*=2\r\n year+=1\r\n if a>b:\r\n break\r\nprint(year)", "p1_weigh , p2_weigh = map(int , input().split())\r\nnumber_of_years_needed = 0\r\n\r\nwhile p2_weigh >= p1_weigh :\r\n number_of_years_needed += 1\r\n p2_weigh = p2_weigh*2\r\n p1_weigh = p1_weigh*3\r\n\r\nprint(number_of_years_needed)\r\n\r\n ", "a,b = map(int, input().split())\r\n \r\ncount = 0\r\n \r\nif(a==b):\r\n print(1)\r\nelse:\r\n while(a<=b):\r\n a = a * 3\r\n b = b * 2\r\n count = count + 1\r\n print(count) \r\n \r\n \r\n ", "ab = input().split()\r\na = int(ab[0])\r\nb = int(ab[1])\r\ncounter = 0\r\nwhile 1:\r\n a = a * 3\r\n b = b * 2\r\n counter += 1\r\n if a > b:\r\n break\r\nprint(counter)", "a,b=map(int,input().split())\r\nfor i in range(1,100):\r\n if(a*pow(3,i)>b*pow(2,i)):\r\n c=i\r\n break\r\nprint(c)", "first,second=map(int,input().split())\r\nyears=0\r\nwhile True:\r\n if first>second:\r\n print(years)\r\n break\r\n else:\r\n years+=1\r\n first*=3\r\n second*=2\r\n", "a, b = map(int, input().split())\r\nl = 1\r\nwhile a < b:\r\n a *= 3\r\n b *= 2\r\n if a > b:\r\n break\r\n else:\r\n l += 1\r\n\r\nprint(l)", "n=input(\"\")\r\nm=n.split(\" \")\r\ny=0\r\nl=int(m[0])\r\nb=int(m[1])\r\nif b!=l:\r\n while l<=b : \r\n l=l*3 \r\n b=b*2 \r\n y=y+1\r\nelse : \r\n y=1\r\nprint(y)", "i, j = map(int, input().split())\r\nm=1\r\nfor k in range(0, 999):\r\n i*=3\r\n j*=2\r\n if i > j:\r\n print(m)\r\n break\r\n m+=1", "n = list(input().split(\" \"))\r\nlimak = int(n[0])\r\nbob = int(n[1])\r\n\r\nyear = 0\r\n\r\nwhile (limak <= bob):\r\n year += 1\r\n limak = limak * 3\r\n bob = bob * 2\r\n\r\nprint(year)", "x,y = map(int,input().split())\r\nc=0\r\nwhile x<=y:\r\n\tx = x*3\r\n\ty= y*2\r\n\tc=c+1\r\nprint(c)", "x,y=map(int,input().split())\r\ncount=0\r\nwhile(x<=y):\r\n x*=3\r\n y*=2\r\n count+=1\r\nprint(count)", "a,b = map(int, input().split())\r\nyear = 0\r\ntempa = a\r\ntempb = b\r\nwhile True:\r\n tempa *= 3\r\n tempb *= 2 \r\n year += 1\r\n if tempa > tempb:\r\n break\r\nprint(year)", "num = input().split(\" \")\r\ni=0\r\na,b = int(num[0]),int(num[1])\r\nwhile(True):\r\n a *= 3\r\n b *= 2\r\n i += 1\r\n if(a>b):\r\n print(i)\r\n break", "inp = input().split()\r\na = int(inp[0])\r\nb = int(inp[1])\r\nc = 0\r\nfor i in range(0, 10**3):\r\n if a > b:\r\n print(c)\r\n break\r\n c = c+1\r\n a = a*3\r\n b = b*2\r\n", "l,b=map(int,input().split())\r\ny=0\r\nwhile (l<=b):\r\n l=3*l\r\n b=2*b\r\n y=y+1\r\nprint(y)", "n,m=map(int,input().split())\r\nz=0;\r\nu=0;\r\nfor i in range(1,11):\r\n z+=1;\r\n n=n*3;\r\n m=m*2;\r\n if n>m:\r\n print(z);\r\n break; \r\n", "a,b = (int(i)for i in input().split())\r\nk=0\r\nwhile a<=b:\r\n k+=1\r\n a*=3\r\n b*=2\r\nprint(k)\r\n", "Limak,Bob=map(int,input().split())\r\ncount=0\r\nwhile Limak<=Bob:\r\n Limak*=3\r\n Bob*=2\r\n count+=1\r\nprint(count)", "x, y = input().split()\r\nx = int(x); y = int(y)\r\nfound = False\r\ni = 1\r\nwhile(True): \r\n ratio = (3 ** i * x)/(2 ** i * y)\r\n if (ratio > 1): \r\n print(i)\r\n break\r\n i += 1", "s, a = map(int, input().split())\nk=0\nwhile s <= a:\n k+=1\n s *= 3\n a *= 2\n\nprint(k)\n\t \t \t\t\t \t \t\t\t\t \t \t \t", "a,b=map(int,input().split())\r\nc=0\r\nfor i in range(1,1000000):\r\n if a>b:\r\n print(c)\r\n break\r\n else:\r\n a*=3\r\n b*=2\r\n c+=1\r\n continue", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Sep 8 15:47:06 2023\r\n\r\n@author: Zinc\r\n\"\"\"\r\n\r\na,b=[int(x) for x in input().split()]\r\nfor i in range(1,7):\r\n if a*3**i>b*2**i: \r\n print(i)\r\n break\r\n else:\r\n continue\r\n", "a, b = map(int, input().split())\ncount = 1\n\nfor i in range(1, 21):\n a = a * 3\n b = b * 2\n if a <= b:\n count += 1\n else:\n break\n\nprint(count)\n\n \t\t \t\t \t\t \t\t\t \t\t\t\t\t\t\t\t \t\t\t\t\t\t", "w = list(map(int, input().split()))\r\nn = 1\r\nwhile(True):\r\n ai = w[0]*((3)**(n-1))\r\n bi = w[1]*((2)**(n-1))\r\n if(ai>bi): break\r\n else: n += 1\r\nprint(n-1)", "string = [int(i) for i in input().split()]\r\na, b = string[0], string[1]\r\ncount = 0\r\nwhile a <= b:\r\n a *= 3\r\n b *= 2\r\n count += 1\r\nprint(count)", "a,b=map(int,input().split())\r\nc=0\r\nwhile(a<=b):\r\n a=3*a\r\n b=2*b\r\n c=c+1\r\n if(a>b):\r\n break\r\nprint(c)", "l,b=[int(x) for x in input().split()] ; n=0 ;run=1\r\nwhile run:\r\n l*=3 ; b*=2 ; n+=1\r\n if l>b:print(n) ; run=0", "m,n =map(int,input().split(\" \"))\r\nyear =0\r\nwhile m <= n:\r\n year+=1\r\n m*=3\r\n n*=2\r\nprint(year)", "a,b = map(int,input().split())\r\ni = 1\r\nwhile a*(3**i) <= b*(2**i):\r\n i += 1\r\nprint(i)", "limak,bob=map(int,input().split())\ntemp=1\ncount=0\nwhile temp>0:\n if limak<=bob:\n limak=limak*3\n bob=bob*2\n count+=1\n \n else:\n temp=0\nprint(count)\n ", "import math\r\na,b = map(int,input().split(' '))\r\n\r\nprint(int(math.log(b/a)/math.log(3/2))+1)", "a, b = map(int,input().split())\r\nn = 0\r\nres = 0\r\nwhile a*(3**n)<=b*(2**n):\r\n n+=1\r\n res+=1\r\nprint(res) \r\n\r\n", "x=list(map(int,input().split()))\na=x[0]\nb=x[1]\ni=1\nwhile i>0:\n if 3*i*a>2*i*b:\n print(i)\n break\n else:\n a=3*i*a \n b=2*i*b\n i+=1", "years = 0\r\nLimak, Bob = map(int, input().split())\r\nwhile(Limak <= Bob):\r\n years += 1\r\n Limak *= 3\r\n Bob *= 2\r\nprint(years)", "limak_wt,bob_wt = map(int,input().split())\r\n\r\nyear = 0 \r\n\r\nwhile limak_wt <= bob_wt:\r\n limak_wt *= 3\r\n bob_wt *= 2\r\n year += 1\r\nprint(year)", "young, big = map(int, input().split())\r\ncount = 0\r\n\r\nwhile young <= big:\r\n young = young * 3\r\n big = big * 2\r\n count += 1\r\nprint(count)", "N,M=map(int,input().split())\r\nc=0\r\nwhile (N<=M):\r\n N*=3\r\n M*=2\r\n c+=1\r\nprint(c)", "a,b=map(int,input().split())\r\nk=0\r\nwhile a<=b:\r\n k+=1\r\n a*=1.5\r\nprint(k)\r\n", "w,v=map(int,input().split(\" \"))\r\nc=0\r\nwhile w<=v:\r\n w*=3\r\n v*=2\r\n c+=1\r\nprint(c)", "limak_wgt, bob_wgt = map(int, input().split())\r\n \r\nyrs = 0\r\n \r\n \r\nwhile limak_wgt <= bob_wgt:\r\n limak_wgt *= 3 \r\n bob_wgt *= 2 \r\n yrs += 1\r\n \r\nprint(yrs)", "x , y = map(int , input().split())\r\nc = 0\r\nwhile x <= y :\r\n x = x *3\r\n y = y *2 \r\n c += 1\r\n \r\nprint(c)", "s=0\r\na,b=map(int,input().split())\r\nwhile a<=b:\r\n a=3*a\r\n b=b*2\r\n s=s+1\r\nprint(s)", "a, b = map(int, input().split())\r\n\r\ncountYear = 0\r\ndo = False\r\nwhile not do:\r\n countYear += 1\r\n a *= 3\r\n b *= 2\r\n if a > b:\r\n print(countYear)\r\n do = True\r\n else:\r\n do = False", "a,b=input().split()\na=int(a)\nb=int(b)\ni=0\nwhile a<=b:\n\n a=a*3\n b=b*2\n i+=1\nprint(i)\n\n\n\n\n#\n\t \t\t\t \t\t\t \t\t\t \t \t\t\t \t\t", "L,B=input().split()\r\nL=int(L)\r\nB=int(B)\r\ncounter=0\r\nwhile True:\r\n counter+=1\r\n L*=3\r\n B*=2\r\n if L>B:\r\n break\r\nprint (counter)\r\n \r\n ", "m,n = map(int,input().split())\r\ny = 0\r\nwhile m<=n:\r\n m*=3\r\n n*=2\r\n y+=1\r\nprint(y)", "list1=input().split()\r\nlimak=int(list1[0])\r\nbob=int(list1[-1])\r\ni=0\r\nwhile limak<=bob:\r\n limak=limak*3\r\n bob=bob*2\r\n i+=1\r\nprint(i)", "import math\r\n\r\na, b = list(map(int, input().split()))\r\nans = math.log(b/a, 1.5)\r\nif ans%1 == 0:\r\n print(math.ceil(ans)+1)\r\nelse:\r\n print(math.ceil(ans))", "n,m=map(int,input().split())\r\nans=0\r\nwhile m>=n:\r\n m=m*2\r\n n=n*3\r\n ans+=1 \r\nprint(ans)\r\n", "san1 , san2 = map(int, input().split())\r\ncount = 0\r\nwhile san1<=san2:\r\n count += 1\r\n san1*=3\r\n san2*=2\r\n\r\nprint(count)", "#Solution two :\r\ndef bears(a,b):\r\n c_year=0\r\n while a<=b :\r\n a=3*a \r\n b=2*b\r\n c_year+=1\r\n return c_year\r\na,b=map(int, input().split())\r\nres=bears(a, b)\r\nprint(res)\r\n ", "s=input().split()\r\na,b=int(s[0]),int(s[1])\r\nt=0\r\nfor i in range(100):\r\n a=3*a\r\n b=2*b\r\n if a<=b:\r\n t+=1\r\n continue\r\n else:\r\n t+=1\r\n break\r\nprint(t)", "p,q=map(int,input().split())\r\ncount=0\r\nwhile p<=q:\r\n p=p*3\r\n q=q*2\r\n count +=1\r\nprint(count)", "weight=list(map(int,input().split()))\r\nlimak=weight[0]\r\nbob=weight[1]\r\nyrs=0\r\nwhile True:\r\n limak=limak*3\r\n bob=bob*2\r\n yrs=yrs+1\r\n if limak>bob:\r\n break\r\nprint(yrs)", "inp = input().split()\r\ncount = 0\r\nl = 0\r\nb = 0\r\nfor i in range(len(inp)):\r\n inp[i] = int(inp[i])\r\n\r\nl = inp[0]\r\nb = inp[1]\r\n\r\nif (l == b):\r\n print(1)\r\n exit()\r\n\r\nwhile l <= b:\r\n l *= 3\r\n b *= 2\r\n count += 1\r\n\r\nprint(count)\r\n", "age = [int(i) for i in input().split()]\r\ncount = 0\r\nwhile age[0] <= age[-1]:\r\n age[0] *= 3\r\n age[-1] *= 2\r\n count += 1\r\nprint(count)\r\n", "a,b=map(int,input().split())\r\nk=0\r\nwhile b>=a:\r\n a=a*3\r\n b=b*2\r\n k+=1\r\nprint(k)", "s=input(\"\")\r\ns=s.split(\" \")\r\nq=[]\r\nn=0\r\nfor i in s:\r\n i=int(i)\r\n q.append(i)\r\n \r\n\r\nwhile q[0]<=q[1]:\r\n q[0]=q[0]*3\r\n q[1]=q[1]*2\r\n n=n+1\r\n\r\nprint(n)\r\n \r\n \r\n ", "import math\r\na, b = map(int,input().split())\r\nc = int((math.log2(float(b/a)))/(math.log2(1.5)))\r\nc = c+1\r\nprint(c)\r\n\r\n", "a, b = map(int, input().split())\r\n\r\ny = 0\r\n\r\nwhile True:\r\n\r\n if a > b: \r\n\r\n print(y)\r\n break\r\n\r\n else: \r\n\r\n y += 1\r\n a = a * 3\r\n b = b * 2", "def calculate_weight(weights):\r\n\ta, b = weights.split()\r\n\ta = int(a)\r\n\tb = int(b)\r\n\tcount = 0\r\n\twhile a <= b:\r\n\t\ta *= 3\r\n\t\tb *= 2\r\n\t\tcount += 1\r\n\treturn count\r\n\r\nprint(calculate_weight(input()))", "w = input()\r\nw = w.split()\r\nw[0] = int(w[0])\r\nw[1] = int(w[1])\r\ncount = 0\r\nwhile w[0] <= w[1]:\r\n w[0] *= 3\r\n w[1] *= 2\r\n count += 1\r\nprint(count)", "a,b = map(int, input().split())\r\ni = 0\r\ncount = 0\r\nwhile i < b:\r\n if a <= b:\r\n a = a * 3\r\n b = b * 2\r\n count = count + 1\r\n i = i + 1\r\nprint(count)", "a, b = list(map(int, input().split()))\r\n\r\nyears = 0\r\nwhile True:\r\n years = years + 1\r\n \r\n a = 3 * a\r\n b = 2 * b\r\n\r\n if a > b:\r\n print(years)\r\n break ", "a,b=map(int,input().split())\r\nk=0\r\nwhile a<=b:\r\n a=3*a\r\n b=2*b\r\n k=k+1\r\nprint(k)", "limak, bob = [int(x) for x in input().split()]\r\nyears = 0\r\n\r\nwhile limak <= bob:\r\n years += 1\r\n limak *= 3\r\n bob *= 2\r\n\r\nprint(years)", "n,m=map(int,input().split())\r\nc=0\r\nwhile(n<=m):\r\n c+=1\r\n n*=3\r\n m*=2\r\nprint(c)", "l, b = input().split()\r\nl, b = int(l), int(b)\r\n\r\nc = 0\r\n\r\nwhile l <= b:\r\n l *= 3\r\n b *= 2\r\n c+=1\r\nprint(c)", "x,y=map(int,input().split())\r\na,b=0,0\r\nfor i in range(1,100):\r\n a,b=x*3,y*2\r\n x,y=a,b\r\n if x>y:\r\n print(i)\r\n break", "l , b =map(int,input().split())\r\nc = 0 \r\nwhile True:\r\n if l > b:\r\n break\r\n l *= 3\r\n b *= 2\r\n c += 1\r\nprint(c)", "# Input Limak's and Bob's weights\r\nlimak_weight, bob_weight = map(int, input().split())\r\n\r\n# Initialize a variable to keep track of the number of years\r\nyears = 0\r\n\r\n# Simulate weight changes until Limak is strictly heavier than Bob\r\nwhile limak_weight <= bob_weight:\r\n limak_weight *= 3 # Limak's weight triples every year\r\n bob_weight *= 2 # Bob's weight doubles every year\r\n years += 1 # Increment the number of years\r\n\r\n# Output the number of years\r\nprint(years)\r\n", "x,y = map(int,input().split())\r\ncount = 0\r\nwhile True:\r\n if x > y:\r\n break;\r\n x *= 3\r\n y *= 2\r\n count += 1\r\n\r\nprint(count)\r\n", "m,n=map(int,input().split())\r\nc=0\r\nwhile(m<=n):\r\n m=m*3\r\n n=n*2\r\n c+=1\r\nprint(c)\r\n ", "a,b=map(int, input().split())\r\nk=0\r\nwhile b>=a:\r\n a=a*3\r\n b=b*2\r\n k+=1\r\nprint (k)\r\n", "row = input().split()\r\nage_1 = int(row[0])\r\nage_2 = int(row[1])\r\nyears = 0\r\n\r\nwhile(age_1<=age_2):\r\n years += 1\r\n age_1*=3\r\n age_2*=2\r\n \r\nprint(years)", "def main():\r\n n, m = map(int, input().split(' '))\r\n cnt = 0\r\n while n <= m:\r\n n *= 3\r\n m *= 2\r\n cnt += 1\r\n print(cnt)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "a, b = input().split()\r\na, b = int(a), int(b)\r\n\r\nyears = 0\r\n\r\nwhile a <= b:\r\n\tyears += 1\r\n\ta = a * 3\r\n\tb = b * 2\r\n\r\nprint(years)\r\n", "limak,bob=map(int,input().split())\r\ncount=0\r\nfor i in range(40):\r\n if limak>bob:\r\n break\r\n else:\r\n limak*=3\r\n bob*=2\r\n count+=1\r\nprint(count)", "value = list(map(int, input().split(' ')))\r\na = value[0]\r\nb = value[1]\r\nresult = 0\r\nwhile True:\r\n if a > b:\r\n break\r\n a *= 3\r\n b *= 2\r\n result += 1\r\nprint(result)\r\n ", "bear,bob=(map(int,input().split()))\r\ncount=0\r\nfor i in range(10):\r\n if 3*bear<=bob*2:\r\n bear*=3\r\n bob*=2\r\n count+=1\r\n else:\r\n count+=1\r\n break\r\nprint(count)", "import math\na,b=input().split()\nc=math.log(int(b)/int(a), 1.5)\nif math.floor(c)==c:\n c=int(c+1)\nelse:\n c=math.ceil(c)\nprint(c)\n\t \t \t\t\t \t\t \t \t \t \t", "inf = list(map(int, input().split()))\na = inf[0]\nb = inf[1]\ncount = 0\nwhile a <= b:\n a = a * 3\n b = b * 2\n count += 1\nprint(count)", "limak,bob=map(int,input().split())\r\nscore=0\r\nwhile limak<=bob:\r\n limak=3*limak\r\n bob=bob*2\r\n\r\n score+=1\r\nprint(score)\r\n\r\n", "c=0\r\nn,m=map(int,input().split())\r\nwhile n<=m:\r\n n=n*3\r\n m=m*2\r\n c+=1\r\nprint(c)", "a,b = map(int,input().split())\r\ni=0\r\nwhile True :\r\n i+=1\r\n if a*(3**i)> b *(2**i) :\r\n print(i)\r\n break\r\n else :\r\n continue", "age = input().split()\r\na = int(age[0])\r\nb = int(age[1])\r\n\r\ncounter = 0\r\nwhile a <= b:\r\n a *= 3\r\n b *= 2\r\n counter += 1\r\n\r\nprint(counter)", "a, b = [int(x) for x in input().split()] \r\n\r\nx=0\r\nwhile(a<=b) : \r\n a*=3\r\n b*=2\r\n x+=1\r\nprint(x)", "\r\nLimakWeight, BobWeight = map(int, input().split())\r\n\r\ni = 1\r\nwhile LimakWeight <= BobWeight:\r\n LimakWeight *= 3\r\n BobWeight *= 2\r\n i += 1\r\n\r\nprint(i-1)", "weights=input().split(\" \")\r\nl=int(weights[0])\r\nb=int(weights[1])\r\n\r\nc=0\r\n\r\nwhile l<=b:\r\n l=l*3 \r\n b=b*2 \r\n c=c+1 \r\n \r\n\r\nprint(c)\r\n", "m,n=map(int,input().split())\r\nc=0\r\nwhile m <=n:\r\n m*=3\r\n n*=2\r\n c+=1\r\nprint(c)", "L,B=map(int,input(\"\").split())\r\ny=0\r\nif L<=B:\r\n while L<=B:\r\n L=L*3\r\n B=B*2\r\n y+=1\r\nprint(y)", "L,J=map(int,input().split())\r\nY=0\r\nwhile L<=J:\r\n L*=3\r\n J*=2\r\n Y+=1\r\nprint(Y) ", "limak_weight,bob_weight=map(int,input().split())\r\nyears=0\r\nwhile limak_weight<=bob_weight:\r\n limak_weight*=3\r\n bob_weight*=2\r\n years+=1\r\nprint(years)", "l,b=map(int,input().split())\r\ny=0\r\nwhile l<=b:\r\n l*=3\r\n b*=2\r\n y+=1\r\nprint(y)", "l,b=map(int,input().split())\r\ncount=0\r\nwhile l<=b:\r\n l=3*l\r\n b=2*b\r\n count=count+1\r\nprint(count)", "a, b = map(int, input().split())\r\ncount=0\r\nwhile(a<=b):\r\n a = a*3\r\n b = b*2\r\n count=count+1\r\nprint(count)", "# Input\r\na, b = map(int, input().split())\r\n\r\n# Initialize the number of years\r\nyears = 0\r\n\r\n# Simulate the growth until Limak becomes strictly larger than Bob\r\nwhile a <= b:\r\n a *= 3 # Limak's weight triples every year\r\n b *= 2 # Bob's weight doubles every year\r\n years += 1\r\n\r\n# Output the number of years it took\r\nprint(years)\r\n", "a, b = map(int, input().split()) # O(log(b/a))\n\nyears = 0 \n\n\nwhile a <= b:\n a *= 3 # Aumento de peso de Limak: se triplica\n b *= 2 # Aumento de peso de Bob: se duplica\n years += 1\n\n# Imprimir el número de años\nprint(years)\n\n \t \t \t\t \t\t\t \t \t\t\t\t \t \t\t \t\t", "s=1\r\n\r\nLimak,bob =map(int,input().split())\r\n\r\nwhile(Limak<bob):\r\n \r\n bob=bob*2\r\n \r\n Limak=Limak*3\r\n \r\n if(Limak>bob):\r\n break\r\n else:\r\n s=s+1\r\nprint(s)", "a, b = [int(x) for x in input().split()]\r\nn = 1\r\n\r\nwhile True:\r\n if (3 / 2) ** n > b / a:\r\n print(n)\r\n break\r\n else:\r\n n += 1\r\n", "limak , bob = map(int, input().split())\r\nfor i in range(1, 10+1):\r\n limak *= 3\r\n bob *= 2\r\n if limak > bob:\r\n print(i)\r\n break", "limak, bob = list(map(int, input().split()))\r\nyears = 0\r\n\r\nwhile limak <= bob:\r\n limak *= 3\r\n bob *= 2\r\n years += 1\r\n\r\nprint(years)", "a,b = map(int,input().split())\r\ncount = 0\r\nwhile(a<=b):\r\n a=3*a \r\n b=2*b\r\n count+=1\r\n \r\n \r\nprint(count)", "a,b=map(int,input().split())\r\nsm=0\r\nwhile a<=b:\r\n\ta*=3\r\n\tb*=2\r\n\tsm+=1\r\nprint(sm)", "i = list(map(int,input().split()))\r\na = i[0]\r\nb = i[1]\r\ncount = 0\r\nwhile a <= b:\r\n a = a*3\r\n b = b*2\r\n count += 1\r\nprint(count)", "a, b = map(int, input().split())\r\n\r\nx = 0\r\nwhile a <= b:\r\n x += 1\r\n a = 3 * a\r\n b = 2 * b\r\n\r\n\r\nprint(x)", "a,b = map(int, input().split())\r\n\r\nans = 0\r\nwhile a<=b:\r\n a = a*3\r\n b = b*2\r\n ans +=1\r\n\r\nprint(ans)", "a,b=map(int,input().split())\r\ncount=0\r\nwhile a<=b:\r\n a=a*3\r\n b=b*2\r\n count+=1\r\nprint(count)", "a,b=map(int,input().split())\r\nans=0\r\nwhile True:\r\n a=a*3\r\n b=b*2\r\n ans=ans+1\r\n if a>b:\r\n break\r\nprint(ans)", "n = list (map (int ,input().split()))\r\nyear = 0\r\nwhile n[0] <= n[1] :\r\n year += 1\r\n n[0] = n[0] * 3\r\n n[1] += n[1]\r\n\r\nprint(year)", "a, b = map(int, input().split())\r\nage = 0\r\nwhile True:\r\n if a <= b:\r\n age += 1\r\n a *= 3\r\n b *= 2\r\n else:\r\n break\r\nprint(age)", "a,b=map(int,input().split())\r\n\r\ni=0\r\nwhile a<=b:\r\n i =i+1\r\n a =a*3\r\n b =b*2\r\n \r\n \r\nprint(i)", "weight_limak, weight_bob = map(int, input().split())\r\n\r\nyear = 0\r\n\r\nwhile weight_limak <= weight_bob:\r\n weight_limak *= 3\r\n weight_bob *= 2\r\n year += 1\r\n\r\nprint(year)\r\n", "def main():\r\n lan, ban = map(int, input().split())\r\n y = 0\r\n while lan <= ban:\r\n lan *= 3\r\n ban *= 2\r\n y += 1\r\n print(y)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "Limak, Bob = map(int, input().split())\r\ncount = 0 \r\nfor i in range(Bob):\r\n if Limak <= Bob:\r\n Limak = Limak*3\r\n Bob = Bob*2\r\n count += 1\r\n else:\r\n break\r\nprint(count)", "a2,b2 =input().split()\na=int(a2)\nb=int(b2)\ncount=0\nwhile a<=b:\n count+=1\n a*=3\n b*=2\nprint(count)\n \t \t \t \t \t\t \t \t\t \t \t \t\t", "a, b = map(int, input().split())\nyears = 0\n\nwhile a <= b:\n years += 1\n a *= 3\n b *= 2\n\nprint(years)", "years = 0\r\nanb = input().split()\r\na = eval(anb[0])\r\nb = eval(anb[1])\r\n\r\nwhile a <= b:\r\n years = years + 1\r\n b = b*2\r\n a = a*3\r\n\r\nprint(years)", "s,k=map(int,input().split());v=0\r\nwhile s<=k:s*=3;k*=2;v+=1\r\nprint(v)", "a,b = map(int,input().split())\r\ni=0\r\nwhile True:\r\n if a<=b:\r\n a = a*3\r\n b= b*2\r\n i+=1\r\n else:\r\n break\r\nprint(i)", "l_w,b_w=map(int,input().split())\r\nyears=0\r\nwhile l_w<=b_w:\r\n l_w*=3\r\n b_w*=2\r\n years+=1\r\nprint(years)", "limak , bob = map(int, input().split())\r\n\r\ncount = 0\r\n\r\nwhile limak <= bob:\r\n limak *= 3\r\n bob *= 2\r\n count += 1\r\n\r\nprint(count)", "def draw_st(a, b):\r\n counter = 0\r\n while a <= b:\r\n a = a * 3\r\n b = b * 2\r\n counter += 1\r\n\r\n return counter\r\n\r\n\r\n\r\na, b = map(int, input().split())\r\nresult = draw_st(a, b)\r\nprint(result)", "a=str(input(''))\r\nd=0\r\nb=''\r\nc=''\r\nwhile (a[d]!=' '):\r\n b=b+a[d]\r\n d=d+1\r\nfor i in range(d,len(a)):\r\n c=c+a[i]\r\ne=int(b)\r\nf=int(c)\r\ng=0\r\nwhile (e<=f):\r\n e=3*e\r\n f=2*f\r\n g=g+1\r\nprint(g)", "a,b=map(int,input().split(\" \"))\r\nc=0\r\nwhile True:\r\n\ta*=3\r\n\tb*=2\r\n\tc+=1\r\n\tif(a>b):\r\n\t\tprint(c)\r\n\t\texit()", "weights = list(map(int, input().split()))\r\nyears = 0\r\nwhile True:\r\n years +=1\r\n weights[0] *= 3\r\n weights[1] *= 2\r\n if weights[0] > weights[1]:\r\n break\r\nprint(years)", "a,b=map(int,input().split())\r\ncnt=0\r\n\r\nwhile True:\r\n a=a*3\r\n b=b*2\r\n cnt=cnt+1\r\n if a>b:\r\n break\r\n\r\nprint(cnt)", "a = list(map(int , input().split()))\r\nyears = 0\r\nb = a[0]\r\nd = a[1]\r\nwhile b <= d:\r\n b *= 3\r\n d *= 2\r\n years += 1\r\nprint(years)", "# Read the initial weights of Limak and Bob\r\nlimak_weight, bob_weight = map(int, input().split())\r\n\r\n# Initialize a variable to keep track of the number of years\r\nyears = 0\r\n\r\n# Simulate the growth in weight for Limak and Bob\r\nwhile limak_weight <= bob_weight:\r\n limak_weight *= 3 # Limak's weight triples\r\n bob_weight *= 2 # Bob's weight doubles\r\n years += 1 # Increment the number of years\r\n\r\n# Print the number of years it took for Limak to become strictly larger than Bob\r\nprint(years)\r\n", "import math\n\na, b = map(int, input().split(\" \"))\nratio_log = math.log(b/a, 1.5)\nmin_years = int(math.floor(ratio_log + 1))\n\nprint(min_years)\n", "a,b = map(int , input().split())\r\nc=0\r\nwhile a<=b:\r\n a = a*3\r\n b = b*2\r\n c = c+1\r\nprint(c)\r\n ", "l, b = map(int, input().split())\r\nsum=0\r\nwhile l<=b:\r\n l*=3\r\n b*=2\r\n sum+=1\r\n \r\nprint(sum)", "# Read Limak's weight (a) and Bob's weight (b)\r\na, b = map(int, input().split())\r\n\r\n# Initialize the number of years\r\nyears = 0\r\n\r\n# Simulate the increase in weight each year until Limak is strictly larger than Bob\r\nwhile a <= b:\r\n a *= 3 # Limak's weight triples\r\n b *= 2 # Bob's weight doubles\r\n years += 1\r\n\r\n# Print the number of years it took for Limak to become strictly larger than Bob\r\nprint(years)\r\n", "skaitli = input()\r\na, b = skaitli.split(\" \")\r\na = int(a)\r\nb = int(b)\r\nskaits = 0\r\nwhile a <= b :\r\n a = a * 3\r\n b = b * 2\r\n skaits+=1\r\nprint(skaits)", "a, b = map(int, input().split()) # Read the input weights\r\n\r\nyears = 0 # Initialize the number of years\r\n\r\nwhile a <= b:\r\n a *= 3 # Triple Limak's weight\r\n b *= 2 # Double Bob's weight\r\n years += 1\r\n\r\nprint(years) # Output the number of years", "a,n=map(int,input().split())\r\nc=1\r\nfor i in range(10000000000000000):\r\n if a*3<=n*2:\r\n c+=1\r\n a*=3\r\n n*=2\r\n else:\r\n break\r\nprint(c)\r\n", "a, b =map(int, input().split())\r\nyear=1\r\nwhile 1<2:\r\n if a*(3**year)>b*(2**year):\r\n print(year)\r\n break\r\n else:\r\n year+=1", "s1=input()\r\ns2=s1.split()\r\nlm=int(s2[0])\r\nbb=int(s2[1])\r\nyear=0\r\nwhile lm<=bb:\r\n lm*=3\r\n bb*=2\r\n year+=1\r\nprint(year)", "t = input().split()\r\na = int(t[0])\r\nb = int(t[1])\r\n\r\ncount = 0\r\nwhile a <= b:\r\n a *= 3\r\n b *= 2\r\n count += 1\r\n\r\nprint(count)\r\n", "a,b=map(int,input().split())\r\nif a>=1 and a<=b and b<=10:\r\n i=1\r\n while a<=b:\r\n a=3*a\r\n b=2*b\r\n i=i+1\r\n print(i-1)", "Limak,Bob=map(int,input().split())\r\nyears=0\r\nif Limak==Bob:\r\n years+=1\r\n print(years)\r\nelse:\r\n while Limak<=Bob:\r\n Limak*=3\r\n Bob*=2\r\n years+=1\r\n print(years)", "a,b = map(int,input().split())\r\ncount = 0\r\nwhile a <= b:\r\n count +=1\r\n a *=3\r\n b *=2\r\nprint(count)\r\n\r\n\r\n", "from math import *\na,b=map(int,input().split())\nprint(floor(log(b/a,1.5))+1)", "s = input()\r\nnum = s.split()\r\nlamak = int(num[0])\r\nbob = int(num[1])\r\nans = 0\r\n\r\nwhile lamak <= bob:\r\n\tans += 1\r\n\tlamak = lamak * 3\r\n\tbob = bob * 2\r\n\r\nprint(ans)\r\n\r\n", "a,b = map(int,input().split())\r\ni=0\r\nwhile(True):\r\n i+=1\r\n a = a*3\r\n b = b*2\r\n if(a>b):\r\n print(i)\r\n break;\r\n", "# Leer el peso de Limak y el peso de Bob\nlimak_weight, bob_weight = map(int, input().split())\n\n# Inicializar una variable para contar el número de años\nyears = 0\n\n# Calcular el número de años necesarios para que Limak sea más pesado que Bob\nwhile limak_weight <= bob_weight:\n limak_weight *= 3\n bob_weight *= 2\n years += 1\n\n# Imprimir el número de años necesarios\nprint(years)\n \t\t \t \t\t \t \t\t\t\t \t \t \t\t\t\t", "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\ndef solve():\r\n a, b = linp()\r\n for i in range(1, 100000):\r\n a *= 3\r\n b *= 2\r\n if a > b:\r\n print(i)\r\n return\r\n\r\n\r\nq = 1\r\nfor _ in range(q):\r\n solve()\r\n", "# URL: https://codeforces.com/problemset/problem/791/A\n\na, b = map(int, input().split())\nans = 0\nwhile a <= b:\n ans += 1\n a *= 3\n b *= 2\nprint(ans)", "w1, w2 = map(int, input().split())\r\nc=0\r\nwhile w1<=w2:\r\n c+=1\r\n w1=w1*3\r\n w2=w2*2\r\nprint(c)", "numbers = list(map(int,input().split()))\r\na = numbers[0]\r\nb = numbers[1]\r\ncounter = 0\r\n\r\nwhile(True):\r\n a = 3 *a\r\n b = 2 *b\r\n counter = counter + 1\r\n if a > b:\r\n break\r\nprint(counter)", "weight = list(map(int,input().split()))\r\n\r\nwLimak = weight[0]\r\nwBob = weight[1]\r\n\r\nyears = 0\r\n\r\nwhile wLimak <= wBob:\r\n wLimak *= 3\r\n wBob *= 2\r\n \r\n years += 1\r\n \r\nprint(years) ", "a,b = input().split()\r\na = int(a)\r\nb = int(b)\r\ngadi=0\r\nwhile(a<=b):\r\n a*=3\r\n b*=2\r\n gadi+=1\r\nprint(gadi)", "a,b = map(int, input().split())\r\nans = 0\r\nwhile(b>=a):\r\n a = 3*a\r\n b = 2*b\r\n ans += 1\r\nprint(ans)", "a,b=input().split()\r\na=int(a)\r\nb=int(b)\r\nresult=0\r\nwhile(a <= b):\r\n a=a*3\r\n b=b*2\r\n result+=1\r\n\r\nprint(result)", "a, b = map(int, input().split())\r\n\r\n# Initialize year counter\r\nyears = 0\r\n\r\n# Simulate the growth of weights\r\nwhile a <= b:\r\n a *= 3\r\n b *= 2\r\n years += 1\r\n\r\n# Print the number of years\r\nprint(years)", "m_1, m_2 = [int(x) for x in (input().split())]\r\ntotal = 0\r\nwhile m_1 <= m_2:\r\n m_1 *= 3\r\n m_2 *= 2\r\n total += 1\r\nprint(total)\r\n", "input=input().split()\r\na=int(input[0])\r\nb=int(input[1])\r\nyear=0\r\nwhile (3**year)*a <= (2**year)*b:\r\n year=year+1\r\n\r\nprint(year)", "limak, bob = input().split()\n\nlimak = int(limak)\nbob = int(bob)\ncounter = 0\n\nwhile limak <= bob:\n counter += 1\n limak *= 3\n bob *= 2\nprint(counter)\n\n\t\t\t \t \t\t \t \t\t\t\t \t \t\t", "svari = input()\r\na,b = svari.split(\" \")\r\na = int(a)\r\nb = int(b)\r\ngadi = 0\r\nwhile True:\r\n if a > b:\r\n print(gadi)\r\n break\r\n else:\r\n a = a*3\r\n b = b*2\r\n gadi += 1\r\n continue", "a,b=map(int,input().split())\r\nn=0\r\nwhile a<=b:\r\n a*=3\r\n b*=2\r\n n+=1\r\nelse:\r\n print(n)", "l,b = map(int,input().split())\nyears = 0\nwhile l <= b:\n l,b,years= l*3, b*2, years+1\nprint(years)", "n1,n2=map(int,input().split())\r\na=0\r\nwhile n1<=n2:\r\n a=a+1\r\n n1=n1*3\r\n n2=n2*2\r\nprint(a)", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[1]:\n\n\nlimak, bob = map(int, input().split())\ncount = 0\n\nwhile limak <= bob:\n limak *= 3\n bob *= 2\n count += 1\n\nprint(count)\n\n\n# In[ ]:\n\n\n\n\n", "br = [int(x) for x in input().split(\" \")]\r\na = 0\r\nwhile br[0] <= br[1]:\r\n br[0] *= 3\r\n br[1] *= 2\r\n a += 1\r\nprint(a)", "a,b=map(int,input().split())\r\nyrs=0\r\nwhile(a<=b):\r\n a *=3\r\n b *=2\r\n yrs+=1\r\nprint(yrs) ", "a,b=map(int,input().split())\r\nn=0\r\nwhile n>=0:\r\n a*=3\r\n b*=2\r\n n+=1\r\n if a>b:\r\n break\r\nprint(n)", "a, b = map(int, input().split())\r\nx = 0\r\n\r\nwhile (b >= a):\r\n a *= 3\r\n b *= 2\r\n x += 1\r\n\r\nprint(x)", "w1, w2 = map(int, input().split())\r\ncount = 0\r\nwhile w1 <= w2:\r\n w1 *= 3\r\n w2 *= 2\r\n count += 1\r\nprint(count)", "# -*- coding: utf-8 -*-\n\"\"\"Untitled10.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1Y76e7LeXWvCIjIdSAW7klJvgCVNmBhzq\n\"\"\"\n\nlimak, bob = map(int, input().split())\nyears = 0\nwhile limak <= bob:\n limak *= 3\n bob *= 2\n years += 1\nprint(years)\n\n", "limak, bob = map(int,input().split())\r\n\r\nyear = 0\r\n\r\nwhile bob >= limak:\r\n bob*= 2\r\n limak*=3\r\n year+=1\r\n\r\nprint(year)\r\n ", "a_b = input()\r\nab = a_b.split()\r\na = int(ab[0])\r\nb = int(ab[1])\r\nx = 0\r\n\r\nwhile a <= b:\r\n a = a*3\r\n b = b*2\r\n x = x+1\r\n\r\nprint(x)\r\n", "a,b=list(map(int,input().split()))\r\nfor x in range(1,10000000000):\r\n a*=3\r\n b*=2\r\n if a>b:\r\n print(x)\r\n break\r\n", "a, b = map(int,input().split())\n\ni = 0\n\nwhile(True):\n if a > b:\n print(i)\n break\n\n i += 1\n \n a *= 3\n b *= 2\n", "a,b=map(int,input().split())\r\n\r\nfor n in range(1,10000000000):\r\n a1 = a * 3 ** n\r\n b1 = b * 2 ** n\r\n\r\n if a1>b1:\r\n print(n)\r\n break", "x , y = map(int,input().split())\r\ni = 0\r\nwhile(x <= y):\r\n i = i + 1\r\n x = x * 3\r\n y = y * 2\r\n if x > y:\r\n print(i)", "data = list(map(int, input().split(' ')))\r\n\r\na = data[0]\r\nb = data[1]\r\n\r\nfor i in range(10):\r\n if a <= b:\r\n a = a*3\r\n b = b*2\r\n else:\r\n print(i)\r\n break", "a,b=map(int,input().split())\r\nn=0\r\nwhile n>=0:\r\n if a*(3**n)>b*(2**n):\r\n break\r\n n+=1\r\nprint(n) ", "a,b = map(int,input().split(' '))\r\nyr = 0\r\nwhile a<b:\r\n yr += 1\r\n a = 3*a\r\n b = 2*b\r\nif a == b:\r\n print(yr+1)\r\nelse:\r\n print(yr)", "n=input().split()\r\nL=int(n[0])\r\nB=int(n[1])\r\ncount=0\r\nfor i in range(1000):\r\n L=L*3\r\n B=B*2\r\n count+=1\r\n if L>B:\r\n print(count)\r\n break", "weights = list(map(int, input().split()))\r\nyears = 0\r\nceiling = 10\r\nLimak = weights[0]\r\nBob = weights[1]\r\n\r\n\r\nfor i in range(0, ceiling):\r\n if Limak <= Bob:\r\n years += 1\r\n Limak *= 3\r\n Bob *= 2\r\n # print(f\"After {years} years, Limak weighs: {Limak}; \\nNow Bob Weighs: {Bob}.\\n______\")\r\n\r\nprint(years)", "weights = input()\r\n\r\nweights_list = weights.split()\r\n\r\nLimak_W = int(weights_list[0])\r\nBob_W = int(weights_list[1])\r\n\r\nyears = 0\r\nwhile Limak_W<Bob_W or Limak_W==Bob_W:\r\n years += 1\r\n Limak_W *= 3\r\n Bob_W *= 2\r\n\r\nprint(years)", "a,b=map(lambda x: int(x), input().split())\r\ncount=0\r\nwhile a<=b:\r\n a*=3\r\n b*=2\r\n count+=1\r\nprint(count)", "l,b=map(int,input().split())\r\ncnt=0\r\nwhile(l<=b):\r\n cnt+=1\r\n l=l*3\r\n b=b*2\r\nprint(cnt)", "a,b=input().split()\r\na=int(a)\r\nb=int(b)\r\ny=0\r\nwhile a<=b :\r\n a=a*3\r\n b=b*2\r\n y=y+1\r\nprint(y)", "a, b = input().split()\r\ndef weight(a, b):\r\n k = 0\r\n while a <= b:\r\n a = a * 3\r\n b = b * 2\r\n k += 1\r\n print(k)\r\nweight(int(a), int(b))\r\n\r\n\r\n", "count = 0\r\nLimak, Bob = map(int, input().split())\r\nif Limak <= Bob:\r\n for year in range(1, 10):\r\n Limak *= 3\r\n Bob *= 2\r\n if Limak > Bob:\r\n count += year\r\n break\r\nprint(count)\r\n", "a,b=map(int,input().split())\r\nnyear=0\r\nwhile a<=b:\r\n a=a*3\r\n b=b*2\r\n nyear=nyear+1\r\nprint(nyear)", "a, b = map(int,input().split())\r\nyears = 0\r\n\r\nwhile a<=b:\r\n years+=1 \r\n a*=3\r\n b*=2\r\n\r\nprint(years)", "# Input\r\n\"\"\"\r\nVariables enterada: peso de limak (a) y peso de Bob (b)\r\n\"\"\"\r\n\r\n# Output\r\n\"\"\"\r\nImprimir el numero entero\r\n\"\"\"\r\n\r\n\r\ndef main():\r\n a, b = map(int, input().split(\" \"))\r\n\r\n veces = 0\r\n while a <= b:\r\n a = a * 3\r\n b = b * 2\r\n veces += 1\r\n print(veces)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "inp1=(input())\r\nnew=inp1.split(\" \")\r\nl=[]\r\nfor i in new:\r\n l.append(int(i))\r\ncount=0\r\na=l[0]*3\r\nb=l[1]*2\r\nfor i in range(1,10):\r\n if a<=b:\r\n a*=3\r\n b*=2\r\n count+=1\r\n else:\r\n count+=1\r\n break\r\nprint(count)", "a, b = map(int, input().split())\r\nyears = 0\r\nwhile a and b:\r\n a = a * 3\r\n b = b * 2\r\n years += 1\r\n if a > b:\r\n print(years)\r\n break\r\n else:\r\n continue\r\n", "a,b = map(int,input().split())\r\nfor i in range (1,10):\r\n a = a*3\r\n b = b*2\r\n if a>b:\r\n print(i)\r\n break#this statement breaks out the moment limak's age becomes more than bob's age", "a,b=(int(i)for i in input().split())\r\nsum=0\r\nwhile a<=b:\r\n a*=3\r\n b*=2\r\n sum+=1\r\nprint(sum)\r\n\r\n", "X,Y = map(int,input().split())\r\nZ = 0\r\nwhile(X<=Y):\r\n X*=3\r\n Y*=2\r\n Z+=1\r\nprint(Z)", "a , b = map(int,input().split())\r\nfor i in range(b+1):\r\n if a > b:\r\n print(i)\r\n break\r\n a = a*3\r\n b = b*2\r\n\r\n ", "number=input().split()\r\nx=int(number[0])\r\ny=int(number[1])\r\nz=0\r\nwhile x<=y:\r\n x=x*3\r\n y=y*2\r\n z=z+1\r\nprint(z)", "i = input()\r\nl = i.split()\r\n\r\na = int(l[0])\r\nb = int(l[1])\r\ncount = 0\r\n\r\nwhile a <= b:\r\n a *= 3\r\n b *= 2\r\n count += 1\r\n\r\nprint(count)\r\n", "a, b = map(int, input().split())\n\n# Inicializar un contador de años\naños = 0\n\n# Simular el crecimiento de Limak y Bob\nwhile a <= b:\n a *= 3\n b *= 2\n años += 1\n\n# Imprimir el número de años necesarios\nprint(años)\n\n\n \t \t \t \t\t \t\t \t\t \t \t\t\t\t", "a,b=map(int,input().split())\r\ns=0\r\nwhile 1:\r\n if a>b:\r\n print(s)\r\n exit()\r\n a=a*3\r\n b=b*2\r\n s+=1\r\nprint(s)", "a = input()\r\nl,b = a.split()\r\nl = int(l)\r\nb = int(b)\r\ncount = 0\r\nwhile l<=b:\r\n l = l*3\r\n b = b*2\r\n count+=1\r\nprint(count)", "ab = input()\r\nl = ab.split(' ')\r\nl = [int(s) for s in l]\r\na = l[0]\r\nb = l[1]\r\nimport math\r\nn = (math.log(b/a))/(math.log(1.5))\r\nn = math.floor(n)\r\nm = n+1\r\nprint(m)\r\n", "a,b=input().split()\r\na=int(a)\r\nb=int(b)\r\ngadi=0\r\nwhile a<=b:\r\n a=a*3\r\n b=b*2\r\n gadi=gadi+1\r\nprint(gadi)", "l,b=map(int,input().split())\r\na=0\r\nwhile(b>=l):\r\n a+=1\r\n l=l*3\r\n b=b*2\r\nprint(a)\r\n \r\n", "n = input()\nyears = 0\n\nlimak, bob = n.split(\" \")\nlimak = int(limak)\nbob = int(bob)\n\nwhile limak <= bob:\n limak *= 3\n bob *= 2\n years += 1\n\nprint(years)", "n = input(\"\")\r\nnl = n.split()\r\na = int(nl[0])\r\nb = int(nl[1])\r\nyears = 0\r\n\r\nwhile a <= b :\r\n a *= 3\r\n b *= 2\r\n years +=1\r\nprint(years)", "# list(map(int,input().split()))\r\ninp=list(map(int,input().split()))\r\nl=inp[0]\r\nb=inp[1]\r\nyears=0\r\nwhile(l<=b):\r\n years+=1\r\n l*=3\r\n b*=2\r\nprint(years)\r\n\r\n", "n,m=map(int,input().split())\r\ncount=0\r\nwhile n<=m:\r\n n=n*3\r\n m=m*2\r\n count+=1\r\nprint(count)", "a,b = input().split()\nc=0\na = int(a)\nb = int(b)\nwhile a<=b:\n a*=3\n b*=2\n c+=1\n\nprint(c)", "s=input()\r\nl=s.split(\" \")\r\ncount=0\r\nfor i in range(len(l)):\r\n l[i]=int(l[i])\r\nsmallbear=l[0]\r\nbigbear=l[1]\r\nwhile(smallbear<=bigbear):\r\n smallbear*=3\r\n bigbear*=2\r\n count+=1\r\nprint(count)", "# CF_Problem: 791A_Bear_and_Big_Brother\r\n\r\ndef needYears(a, b, years):\r\n if a <= b:\r\n return needYears(a*3, b*2, years+1)\r\n else:\r\n return years\r\n\r\n\r\na, b = [int(i) for i in input().split(\" \")]\r\nyears = 0\r\nprint(needYears(a, b, years))\r\n", "def weight(a, b):\r\n y = 0\r\n while a <= b:\r\n a = a*3\r\n b = b*2\r\n y = y+1\r\n return y\r\n\r\nw = input().split()\r\na = int(w[0])\r\nb = int(w[1])\r\nprint(weight(a, b))", "if __name__ == \"__main__\":\r\n limak,bob=[int(x) for x in input().split()]\r\n years=0\r\n while(limak<=bob):\r\n limak *=3\r\n bob*=2\r\n years+=1\r\n print(years)", "a,b=input().split()\r\na=int(a)\r\nb=int(b)\r\nyear=0\r\nwhile a<=b:\r\n a*=3\r\n b*=2\r\n year+=1\r\nprint(year)\r\n", "m, n = input('').split(' ')\r\na, b = int(m), int(n)\r\no = 0\r\nwhile(a<=b):\r\n a = a*3\r\n b = b*2\r\n o += 1\r\nprint(o)", "a,b=map(int,input().split())\r\nfor i in range(1,1000000000):\r\n if (3)**i*a>(2)**i*b:\r\n print(i)\r\n break", "a = input().split(\" \")\r\na = [int(i) for i in a]\r\n\r\ni = 0\r\nwhile True:\r\n if a[0]>a[1]:\r\n break\r\n else:\r\n i+=1\r\n a[0] *= 3\r\n a[1] *=2\r\n \r\nprint(i)", "n=input().split()\r\ni=0\r\na=int(n[0])\r\nb=int(n[1])\r\nwhile(i>=0):\r\n if(a>b):\r\n print(i)\r\n break\r\n a=a*3\r\n b=b*2\r\n i+=1\r\n", "inp = input(\"\")\r\nl = [int(i) for i in inp.split(\" \")]\r\nlim = l[0]\r\nbob = l[1]\r\nx = int()\r\nwhile lim <= bob:\r\n lim = lim * 3\r\n bob = bob * 2\r\n x += 1\r\nprint(x)", "data = (input().split(' '))\r\nLimak = int(data[0])\r\nBob = int(data[1])\r\nyears = 0\r\nwhile Limak <= Bob :\r\n Limak *=3\r\n Bob *=2\r\n years += 1\r\nprint(years)", "l,b=map(int,input().split())\r\nc=0\r\nwhile(l<=b):\r\n l=l*3\r\n b=b*2\r\n c+=1 \r\nprint(c)", "# Read input\r\na, b = map(int, input().split())\r\n\r\n# Initialize the number of years\r\nyears = 0\r\n\r\n# Simulate the growth of Limak and Bob's weight\r\nwhile a <= b:\r\n a *= 3\r\n b *= 2\r\n years += 1\r\n\r\n# Print the number of years required\r\nprint(years)\r\n", "a, b = map(int,input().split())\r\nk = 0\r\nwhile(a<=b):\r\n k+=1\r\n a = a*3\r\n b = b*2\r\nprint(k)\r\n", "a, b=map(int, input().split())\ndef wa(a,x):\n weight=a*((3)**x)\n return weight\ndef wb(b,x):\n weight=b*((2)**x)\n return weight\n# x is the number of years\ny=0\nx=0\nwhile y==0:\n weightofa=wa(a,x)\n weightofb=wb(b,x)\n x+=1\n if weightofa>weightofb:\n print(x-1)\n y=1\n\n\n", "def main():\r\n\r\n lb = input().split(\" \")\r\n lim = int(lb[0])\r\n bob = int(lb[1])\r\n \r\n\r\n time = 0\r\n \r\n if lim == bob:\r\n time = 1\r\n\r\n else:\r\n \r\n for i in range(1, 999):\r\n lim = lim * 3\r\n bob = bob * 2\r\n \r\n time = time+1\r\n if lim > bob:\r\n break\r\n if lim < bob or lim == bob:\r\n continue\r\n \r\n \r\n print(time)\r\n\r\n\r\nmain()", "line = input()\nline = line.split(' ')\na = int(line[0])\nb = int(line[1])\nn = 0\nwhile True:\n if a > b:\n break\n n += 1\n a = 3*a\n b = 2*b\nprint(n)", "weight=input().split(' ')\r\na=int(weight[0])\r\nb=int(weight[1])\r\nyear=0\r\nwhile a<=b:\r\n a=a*3\r\n b=b*2\r\n year+=1\r\nprint(year)", "def fg():\r\n return int(input())\r\ndef fgh():\r\n return[int(xx) for xx in input().split()]\r\ndef fgt():\r\n return map(int,input().split())\r\ndef fgs():\r\n return input()\r\nlimak,boba=fgt()\r\nres=0\r\nwhile limak<=boba:\r\n res+=1\r\n limak*=3\r\n boba*=2\r\nprint(res)", "import sys\r\n\r\ns = [int(i) for i in sys.stdin.readline().split()]\r\n\r\na = s[0]\r\nb = s[1]\r\n\r\ncounter = 0 \r\n\r\nwhile a <= b: \r\n a *= 3 \r\n b *= 2 \r\n counter += 1 \r\n\r\nprint(counter)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nSpyder Editor\r\n\r\nThis is a temporary script file.\r\n\"\"\"\r\n\r\n(m,n) = map(int,input().split())\r\ni = 1\r\nwhile m*3 <= n*2:\r\n m = m*3\r\n n = n*2\r\n i += 1\r\nprint(i)", "a,b = map(int,input().split(' '))\r\ni = 1\r\nwhile True:\r\n if a*3>b*2:\r\n print(i)\r\n break\r\n else:\r\n a*=3\r\n b*=2\r\n i+=1\r\n", "r=[int(i) for i in input().split()]\r\na=r[0]\r\nb=r[1]\r\ny=0\r\nwhile a<=b:\r\n y+=1\r\n a*=3\r\n b*=2\r\nprint(y)", "a, b = map(int,input().split())\r\nx = 0\r\nwhile(a<=b):\r\n\ta=a*3\r\n\tb=b*2\r\n\tx+=1\r\nprint(x)", "s=input().split()\r\na=int(s[0])\r\nb=int(s[1])\r\nt=0\r\nwhile a<=b:\r\n a=a*3\r\n b=b*2\r\n t=t+1\r\nprint(t)", "def solve(a:int, b:int)->int:\r\n count = 0\r\n while a<=b:\r\n a *= 3\r\n b *= 2\r\n count += 1\r\n return count\r\na, b = map(int,input().split())\r\nprint(solve(a, b))", "a,b=map(int,input().split())\r\nyears=0\r\nwhile True:\r\n if a<b or a==b:\r\n na=3*a \r\n nb=2*b\r\n a=na\r\n b=nb\r\n years+=1\r\n else:\r\n break\r\nprint(years)", "a,b = map(int,input().split())\r\ny=0\r\nwhile(a<=b):\r\n a=3*a\r\n b=2*b\r\n y+=1\r\nprint(y)", "l,b=map(int,input().split())\r\ni=0\r\nwhile l<=b:\r\n if l==b:\r\n i=i+1\r\n break\r\n else:\r\n l=3*l\r\n b=2*b\r\n i=i+1\r\nprint(i)", "a,b=map(int,input().split())\r\nc=0\r\nfor i in range(100000):\r\n\tif a>b:\r\n\t\tbreak\r\n\ta=a*3\r\n\tb=b*2\r\n\tc+=1\r\nprint(c)", "x=input().split()\r\na=int(x[0])\r\nb=int(x[1])\r\nc=0\r\nwhile a<=b:\r\n a*=3\r\n b*=2\r\n c+=1\r\nprint (c)", "n,m=map(int,input().split())\r\nif n==m:\r\n print(1)\r\nelif n>m:\r\n print(0)\r\nelse:\r\n for i in range(10):\r\n if n>m:\r\n print(i)\r\n break\r\n else:\r\n n=n*3\r\n m=m*2\r\n \r\n", "a,b=map(int, input().split())\r\ni=0\r\nwhile a<=b:\r\n a=a*3\r\n b=b*2\r\n i=i+1\r\nprint(i)", "a,b=map(int,input().split())\r\ncount=0\r\nwhile True:\r\n if a<=b:\r\n a = a * 3\r\n b = b * 2\r\n count=count+1\r\n else:\r\n break\r\nprint(count)", "a,b = map(int,input().split())\r\nyr =0\r\nwhile a<=b:\r\n a*=3\r\n b*=2\r\n yr+=1\r\nprint(yr)", "a,b = map(int,input().split(\" \"))\r\ntime = 0\r\nwhile (a<=b):\r\n a*=3\r\n b*=2\r\n time+=1\r\nprint(time)", "l,b = map(int,input().split())\r\n\r\nyear = 0\r\n\r\nwhile b>l or b==l:\r\n l*=3\r\n b*=2\r\n year += 1\r\n \r\nprint(year)", "def weight_change(m,n):\r\n times=1\r\n while 1:\r\n if 3*m<=2*n:\r\n m,n=3*m,2*n\r\n times+=1\r\n else:\r\n return times\r\n\r\nm,n=map(int,input().split())\r\nprint(weight_change(m,n))\r\n", "from math import *\r\na,b = map(int,input().split())\r\nyes = 0.4054651081081644\r\nprint(floor(log(b/a)/yes)+1)", "a,b=map(int,input().split())\r\nk=0\r\nfor i in range(10000):\r\n if a==b:\r\n a=a+a+a\r\n b=b+b\r\n k=k+1\r\n break\r\n elif a<b:\r\n a=a+a+a\r\n b=b+b\r\n k=k+1\r\nprint(k)\r\n", "a,b=map(int,input().split())\r\ncnt=0\r\nwhile a<=b:\r\n a=a*3\r\n b=b*2\r\n cnt+=1\r\nprint(cnt)\r\n", "w = input()\r\n\r\nweights = w.split(\" \")\r\n\r\nlimak = int(weights[0])\r\nbob = int(weights[1])\r\n\r\nyears = 0\r\n\r\nwhile bob > limak or bob == limak:\r\n # Triple limaks weight\r\n limak *= 3\r\n # Double bobs weight\r\n bob *= 2\r\n # Add a year\r\n years += 1\r\n\r\n\r\nprint(years)", "n,m=map(int,input().split())\r\n\r\ncount=0\r\n\r\nif n<=m:\r\n running=True\r\nwhile running:\r\n n*=3\r\n m*=2\r\n count+=1\r\n if n>m:\r\n print(count)\r\n running=False\r\n else:\r\n running=True\r\n\r\n\r\n", "a, b = [int(x) for x in input().split()]\r\ncnt = 0\r\nwhile a <= b:\r\n cnt+=1\r\n a *=3\r\n b *=2\r\n\r\nprint(cnt)", "a, b = map(int,input().split(\" \"))\r\n\r\ni = 0\r\nwhile a <= b:\r\n a = 3 * a\r\n b = 2 * b\r\n i += 1\r\nprint(i)", "def solution():\r\n a,b=map(int,input().split())\r\n i=0\r\n while(a<=b):\r\n a=a*3\r\n b=b*2\r\n i+=1\r\n return(i)\r\nprint(solution())\r\n ", "(a,b) = map(int, input().split())\r\nn = 0\r\nwhile True:\r\n n += 1\r\n if a * 3 ** n > b * 2 ** n:\r\n break\r\nprint(n)", "a,b=map(int,input().split())\r\n\r\nc=0\r\n\r\nwhile True:\r\n a=a*3 \r\n b=b*2 \r\n c+=1\r\n if a>b:\r\n break \r\nprint(c)", "import math\r\na, b = (int(x) for x in input().split())\r\nprint(math.floor(1+math.log(b/a, 1.5)))\r\n", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Wed Sep 13 18:32:32 2023\n\n@author: huangxiaoyuan\n\"\"\"\n\na,b=input().split()\na=int(a)\nb=int(b)\ni=0\nif 1<=a<=b<=10:\n while a<=b:\n a=a*3\n b=b*2\n i=i+1\nprint(i)\n ", "a,b = map(int,input().split())\r\ncount = 0\r\nwhile a<=b:\r\n count+=1\r\n a*=3\r\n b*=2\r\nprint(count)", "x = input(\"\").split()\r\nx1 = int(x[0])\r\nx2 = int(x[1])\r\nyears = 0\r\n\r\nwhile x1 <= x2:\r\n x1 *= 3\r\n x2 *= 2\r\n years += 1\r\n\r\nprint(years)", "def result(a, b):\r\n\tres = 0\r\n\twhile (a <= b):\r\n\t\ta = a*3\r\n\t\tb = b*2\r\n\t\tres += 1\r\n\treturn res\t\r\n\r\na, b = map(int, input().split())\r\nprint(result(a, b))", "t=input().split(\" \")\r\na=int(t[0])\r\nb=int(t[1])\r\ns=0\r\nwhile a<=b:\r\n a*=3\r\n b*=2\r\n s+=1\r\nprint(s)", "n=input().split()\r\nL=int(n[0])\r\nB=int(n[1])\r\ncount=0\r\nwhile L<=B:\r\n L=L*3\r\n B=B*2\r\n count+=1\r\nprint(count)", "s=input().split()\r\na=int(s[0])\r\nb=int(s[1])\r\ny=0\r\nwhile a<=b:\r\n a*=3\r\n b*=2\r\n y+=1\r\nprint(y)\r\n", "a,b = map(int,input().split())\r\nc = 0\r\nwhile a <= b:\r\n a = 3 * a\r\n b = 2 * b\r\n c += 1\r\nprint(c)", "a,b = map(int,input().split())\r\nco = 0\r\nfor i in range(1,10):\r\n co += 1\r\n a = (a*3)\r\n b = (b*2)\r\n if a == b or a>b:\r\n break\r\nif a == b:\r\n print(co+1)\r\nelif a>b:\r\n print(co)", "n,m=[int(x) for x in input().split()]\r\ni=1\r\nwhile True:\r\n if n*3**i>m*2**i:\r\n break\r\n i+=1\r\nprint(i)\r\n", "if __name__ == '__main__':\r\n a_b = input().split()\r\n a = int(a_b[0])\r\n b = int(a_b[1])\r\n years = 1\r\n while a * 3 ** years <= b * 2 ** years:\r\n years = years + 1\r\n print(years)\r\n", "weights = list(map(int, input().split(\" \")))\r\na = weights[0]\r\nb = weights[1]\r\nyears = 0\r\nwhile a <= b:\r\n a *= 3\r\n b *= 2\r\n years += 1\r\nprint(years)", "a,b=map(int,input().split())\r\ny=0\r\nwhile a<=b:\r\n a*=3\r\n b*=2\r\n y+=1\r\nprint(y)\r\n\r\n", "a,b=map(int,input().split())\r\nn=0\r\nwhile a<=b:\r\n a=a*3\r\n b=b*2\r\n n+=1\r\n\r\nprint(n)\r\n", "a,b=map(int,input().split())\r\ncount=0\r\nwhile (a <= b):\r\n a=3*a\r\n b=2*b \r\n count=count+1\r\nprint(count,end='')", "x,y=map(int,input().split())\r\nyear=0\r\nwhile x<=y:\r\n x=3*x\r\n y=2*y\r\n year+=1\r\nprint(year)", "x,y=map(int,input().split());count=0\r\nwhile x<=y:x*=3;y*=2;count+=1\r\nprint(count)\r\n\r\n\r\n\r\n\r\n\r\n", "import sys\r\n\r\nweight = [int(i) for i in sys.stdin.readline().split()]\r\nlimak = weight[0]\r\nbob = weight[1]\r\nyears = 0\r\n\r\nwhile limak <= bob:\r\n limak *= 3\r\n bob *= 2\r\n years += 1\r\n\r\nprint(years)", "bearWeights = input().split()\r\n\r\nlimakWeight = int(bearWeights[0])\r\nbobWeight = int(bearWeights[1])\r\n\r\nyears = 0\r\n\r\nwhile limakWeight <= bobWeight:\r\n limakWeight *= 3\r\n bobWeight *= 2\r\n years += 1\r\n \r\n \r\nprint(years)\r\n \r\n \r\n", "bien=input().split()\r\na=int(bien[0])\r\nb=int(bien[1])\r\nyears=0\r\nwhile(a<=b):\r\n a*=3\r\n b*=2\r\n years+=1\r\nelse:\r\n print(years)", "a, b = list(map(int,input().split()))\r\nn=1\r\nwhile 3*a - 2*b <=0:\r\n a *= 3\r\n b *=2\r\n n +=1\r\nprint(n)", "a,b=input().split()\r\na=int(a)\r\nb=int(b)\r\nc=0\r\nwhile True:\r\n a=3*a\r\n b=2*b\r\n c+=1\r\n if a>b:\r\n break\r\nprint(c)", "def bear(a,b):\r\n c=1\r\n while True:\r\n aa=a*3\r\n bb=b*2\r\n if aa>bb:\r\n print(c)\r\n break\r\n else:\r\n a=aa\r\n b=bb\r\n c+=1\r\n \r\n\r\n \r\n \r\na,b=map(int,input().split())\r\nbear(a,b)\r\n\r\n", "# Read the initial weights of Limak and Bob\r\na, b = map(int, input().split())\r\n\r\n# Initialize the counter for the number of years\r\nyears = 0\r\n\r\n# Iterate until Limak's weight exceeds Bob's weight\r\nwhile a <= b:\r\n a *= 3\r\n b *= 2\r\n years += 1\r\n\r\n# Print the result\r\nprint(years)\r\n", "l,b=map(int,input().split())\r\ncount=0\r\nwhile l<=b:\r\n l=l*3\r\n b=b*2\r\n count+=1\r\nprint(count) ", "\na,b = map(int,input().split())\nt = 0\nwhile a <= b:\n\tif a > b:\n\t\tbreak\n\telse:\n\t\tt += 1\n\t\ta *= 3\n\t\tb *= 2\nprint(t)\n", "a,b=map(int,input().split())\r\nyear=0\r\nwhile a<=b:\r\n a*=3\r\n b*=2\r\n year+=1\r\nprint(year)", "import sys\r\n\r\nuser_input = sys.stdin.readline().strip().split()\r\n\r\nllist = [int(i) for i in user_input]\r\nlimak = llist[0]\r\nbob = llist[1]\r\ncounter = 0\r\nwhile limak <= bob:\r\n limak *= 3\r\n bob *= 2\r\n counter += 1\r\n\r\nprint(counter)", "a,b=map(int,input().split())\r\nyear=0\r\nwhile a<=b:\r\n a=a*3\r\n b=b*2\r\n year+=1\r\nprint(year)", "a,b=[int(x) for x in input().split()]\r\n\r\nc=0\r\nwhile (a<=b):\r\n a=a*3\r\n b=b*2\r\n c+=1\r\nprint(c)", "import math\r\n\r\na, b = input().split()\r\na, b = int(a), int(b)\r\n\r\nansw = int(math.log(b/a, 3/2)) + 1\r\n\r\nprint(answ)", "one,two=input().split()\r\n\r\none=int(one)\r\ntwo=int(two)\r\n\r\nresult=0\r\n\r\nfor i in range (1,100):\r\n one=one*3\r\n two=two*2\r\n result=result+1\r\n \r\n if one>two :\r\n break\r\n \r\nprint(result)", "\r\nn, x = map(int, input().split())\r\n \r\ni=int(0)\r\nwhile n<= x :\r\n n=n*3\r\n x=x*2\r\n i=i+1\r\n\r\nprint(i) \r\n", "start = input().split()\r\nflag = 0\r\na = int(start[0])\r\nb = int(start[1])\r\nwhile (b > a) or (b == a):\r\n a = a * 3\r\n b = b * 2\r\n flag += 1\r\nprint(flag)\r\n", "a,b=map(int,input().split())\r\nc=0;\r\nwhile(a<=b):\r\n a*=3;\r\n b*=2;\r\n c+=1;\r\nprint(c) ", "limak,bob = map(int,input().split())\r\ncount = 0\r\nwhile limak <= bob:\r\n count += 1\r\n limak = limak*3\r\n bob = bob*2\r\nprint(count)", "Limak, Bob = input().split(\" \")\r\nLimak = int(Limak)\r\nBob = int(Bob)\r\n\r\nYear = 0\r\n\r\nwhile not(Limak > Bob):\r\n Limak *= 3\r\n Bob *= 2\r\n Year += 1\r\n\r\nprint(Year)", "a, b = [int(x)for x in input().split()]\r\nfor n in range(1,7):\r\n if a*(3**n)>b*(2**n):\r\n print(n)\r\n break", "def calculate_age(limak, bob):\r\n age_year_count = 0\r\n while limak <= bob:\r\n limak *= 3\r\n bob *= 2\r\n age_year_count += 1\r\n return age_year_count\r\n\r\ndef main():\r\n limak, bob = map(int, input().split())\r\n result = calculate_age(limak, bob)\r\n print(result)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "m, n = map(int ,input().split())\r\nyears = 0 \r\nwhile m <= n: \r\n m *= 3 \r\n n *= 2\r\n years += 1\r\n\r\nprint(years)", "num=0\r\nbear_Limak,bear_Bob=[int(x) for x in input().split()]\r\nwhile bear_Limak<=bear_Bob:\r\n num+=1\r\n bear_Limak=bear_Limak*3\r\n bear_Bob=bear_Bob*2\r\nprint(num)", "c = 0\r\ns = [int(i) for i in input().split()]\r\na = s[0]\r\nb = s[1]\r\nwhile a <= b:\r\n a *= 3\r\n b *= 2\r\n c += 1\r\nprint(c)", "c, d = input().split(\" \")\r\ny = 0\r\nwhile (int(c) <= int(d)):\r\n (c) = int(c) * 3\r\n (d) = int(d) * 2\r\n y += 1\r\nelse:\r\n print(y)", "[a, b] = list(map(int, input().split()))\r\nct=0\r\nwhile(a<=b):\r\n a=3*a\r\n b=2*b\r\n ct=ct+1\r\nprint(ct)\r\n \r\n \r\n", "p,q=map(int, input().split())\r\ny=0\r\nwhile p<=q:\r\n p*=3\r\n q*=2\r\n y+=1\r\nprint(y)\r\n", "def main():\r\n a, b = map(int, input().split())\r\n i = 0\r\n while b >= a:\r\n a = a*3\r\n b = b*2\r\n i += 1\r\n print(i)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "import math \r\na,b = map(int,input().split())\r\ntime = 1\r\nprint(time+int((math.log2(b/a))/(math.log2(3)-1)))", "inp = input()\r\n\r\nlimak, bob = map(int, inp.split())\r\n\r\nres = 0\r\n\r\nwhile limak <= bob:\r\n limak *= 3\r\n bob *= 2\r\n res += 1\r\nprint(res)", "import sys\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# # your remaining code\r\n\r\n\r\na, b = map(int,input().split())\r\n\r\ni =0 \r\nwhile a <= b :\r\n\ta*=3\r\n\tb*=2\r\n\ti+=1\r\nprint(i)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\t\r\n\r\n\r\n\r\n\r\n\t\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "a, b = list(map(int, input().split()))\r\n\r\nsayac = 0\r\n\r\nwhile True:\r\n if a <= b:\r\n a = a * 3\r\n b = b *2\r\n sayac += 1\r\n else:\r\n print(sayac)\r\n break\r\n", "def main():\n a,b = map(int,input().split(' '))\n count = 0 \n\n while a<=b:\n a = 3*a\n b = 2*b\n count += 1\n\n print(count)\n\nmain()\n", "a,b=list(map(int,input().split()))\r\n\r\ni = 0\r\nwhile a <= b:\r\n a *= 3\r\n b *= 2\r\n i+=1\r\nprint(i)", "w=list(map(int,input().split()))\r\ni=0\r\nwhile(w[0] <= w[1]):\r\n w[0]=w[0]*3\r\n w[1]=w[1]*2\r\n i+=1\r\nprint(i)\r\n\r\n", "a,b=map(int,input().split())\r\nn=1\r\nwhile a*(3**n)<=b*(2**n):\r\n n+=1\r\nprint(n)", "l, b = map(int, input().split())\r\n\r\nyear = 0\r\n\r\nwhile l < b or l == b:\r\n l = l*3\r\n b = b*2\r\n year += 1\r\nprint(year)\r\n", "a,b=map(int,input().split())\r\nnbre_dannées=0 \r\ntest=True \r\nwhile a <= b :\r\n a*=3\r\n b*=2\r\n nbre_dannées+=1\r\nprint(nbre_dannées)\r\n \r\n ", "limak, bob = map(int, input().split())\r\nyears = 0\r\nwhile bob >= limak:\r\n limak = limak*3\r\n bob = bob*2\r\n years += 1\r\nprint(years)\r\n", "s = [int(x) for x in input().split()]\r\nL = []\r\n\r\ndef fun(a, b):\r\n z = 0\r\n while a < b:\r\n a = 3*a\r\n b = 2*b\r\n z += 1\r\n L.append(a)\r\n L.append(b)\r\n\r\n if a == b:\r\n z += 1\r\n\r\n return z\r\n\r\na = s[0]\r\nb = s[1]\r\nresult = fun(a, b)\r\nprint(result)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Sep 23 11:31:34 2023\r\n\r\n@author: 25419\r\n\"\"\"\r\n\r\nlist1=input().split()\r\na=int(list1[0])\r\nb=int(list1[1])\r\nsum=0\r\nwhile a<=b:\r\n a=a*3\r\n b=b*2\r\n sum=sum+1\r\nprint(sum)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Sep 16 09:04:49 2023\r\n\r\n@author: lenovo\r\n\"\"\"\r\n\r\na1,b1=input().split()\r\na=int(a1)\r\nb=int(b1)\r\nn=0\r\nwhile a<=b:\r\n n=n+1\r\n a=a*3\r\n b=b*2\r\nprint(n)", "a, b = map(int, input(). split())\r\nyears = 0\r\nwhile a<=b:\r\n a = a*3\r\n b = b*2\r\n years +=1\r\nprint(years) \r\n", "a,b=map(int,input().split())\r\nc=0\r\nwhile a<=b:\r\n\ta*=3\r\n\tb*=2\r\n\tc+=1\r\nprint(c)", "a,b = list(map(int,input().split()))\r\n\r\nif a<=b:\r\n count = 0\r\n while True:\r\n count += 1\r\n a = a * 3\r\n b = b * 2\r\n if a > b:\r\n break\r\n\r\n print(count)", "x = input().split()\r\nx = [int(i) for i in x]\r\ncount = 0\r\nwhile x[0]<=x[1]:\r\n count += 1\r\n x[0] *= 3\r\n x[1] *= 2\r\nprint(count)\r\n", "#fattest bear\r\na,b=map(int,input().split())\r\nsa=a\r\nsb=b\r\nfor i in range(1,1000):\r\n sa=sa*3\r\n sb=sb*2\r\n if(sa>sb):\r\n print(i)\r\n break\r\n \r\n ", "ipt = input()\r\narr_ipt = ipt.split(' ')\r\na, b = int(arr_ipt[0]), int(arr_ipt[1])\r\ncounter = 0\r\n\r\nwhile a <= b:\r\n a *= 3\r\n b *= 2\r\n counter += 1\r\n \r\nprint(counter)", "a, b = map(int, input(). split())\r\ns= 0\r\nwhile a<=b:\r\n a*=3\r\n b*=2\r\n s+=1\r\nprint (s)", "a,b=input(\"\").split()\r\nn=1\r\nx=n*3*int(a)\r\ny=n*2*int(b)\r\nwhile x<=y:\r\n x*=3\r\n y*=2\r\n n+=1\r\nprint(n) ", "Number = str(input())\r\nResult = Number.split()\r\nHaloha = [int(x) for x in Result]\r\ncount = 0;\r\n\r\n\r\nwhile Haloha[1] > Haloha[0] or Haloha[0] == Haloha[1]:\r\n Haloha[0] = Haloha[0] * 3\r\n Haloha[1] = Haloha[1] * 2\r\n count = count + 1\r\n\r\n\r\nprint(count)\r\n\r\n\r\n\r\n\r\n \r\n ", "a,b=map(int,input().split())\r\na1=a\r\nb1=b\r\nt=0\r\nwhile b1>=a1:\r\n a1*=3\r\n b1*=2\r\n t+=1\r\nprint(t)", "# Input\r\na, b = map(int, input().split())\r\n\r\n# Initialize years to 0\r\nyears = 0\r\n\r\n# Simulate the growth of weights\r\nwhile a <= b:\r\n a *= 3 # Limak's weight triples every year\r\n b *= 2 # Bob's weight doubles every year\r\n years += 1\r\n\r\n# Print the number of years required\r\nprint(years)\r\n", "Limak, Bob = input().split()\r\nLimak = int(Limak)\r\nBob = int(Bob)\r\nyear_count = 0\r\n\r\nwhile Bob >= Limak:\r\n Bob *= 2\r\n Limak *= 3\r\n year_count += 1\r\n\r\nprint(year_count)\r\n", "n = input().split()\r\na = int(n[0])\r\nb = int(n[1])\r\nc = 0\r\nwhile a <= b:\r\n a = a*3\r\n b = b*2\r\n c+=1\r\n\r\nprint(c)", "def number_of_years(weighta , weightb):\r\n if 1 < weighta <10 and 1< weightb <10 and weighta < weightb :\r\n \r\n \r\n \r\n result= 1\r\n for result in range(1,10):\r\n weighta = weighta* 3\r\n weightb = weightb* 2\r\n \r\n if weighta > weightb :\r\n \r\n return(result)\r\n \r\n else :\r\n result+= 1\r\n \r\nweighta, weightb = [int(z) for z in input().split()]\r\n \r\n \r\nresult=number_of_years(weighta , weightb )\r\nprint(result)", "\r\ndef fun(a,b,count=1):\r\n if (2*b)>=(3*a):\r\n return fun(3*a,2*b,count+1)\r\n else:\r\n return count\r\ninp=input()\r\na,b=[int(i) for i in inp.split()]\r\nprint(fun(a,b))", "x,y=map(int,input().split());ans=0\r\nwhile x<=y:x*=3;y*=2;ans+=1\r\nprint(ans)", "x,y=map(int,input().split())\r\nz=0\r\nwhile x<=y:x*=3;y*=2;z+=1\r\nprint(z)", "li,bob=map(int,input().split())\r\ncounter=0\r\nwhile(True):\r\n li=li*3\r\n bob=bob*2\r\n if(li>bob):\r\n counter+=1\r\n break\r\n counter+=1\r\nprint(counter)", "n1,n2=map(int,input().split())\r\nc=0\r\nwhile n1<=n2:\r\n n1*=3\r\n n2*=2\r\n c+=1\r\nprint(c)", "x, y = map(int, input().split())\ni=0\nif(x==y):\n i+=1\n print(i)\nelse:\n while x<=y:\n x*=3\n y*=2\n i+=1\n print(i)\n \t \t \t\t \t \t\t\t\t \t\t\t\t \t\t\t\t \t\t\t", "s = [int(i) for i in input().split()]\r\na = s[0]\r\nb = s[1]\r\nc = 0\r\nwhile b>=a:\r\n a*=3\r\n b*=2\r\n c+=1\r\nprint(c)", "l, b = [int(i) for i in input().split()]\r\n\r\ncount = 0\r\nwhile l<=b:\r\n\tl*=3\r\n\tb*=2\r\n\tcount += 1\r\nprint(count)", "year = 0\na, b = input().split()\na = int(a)\nb = int(b)\nwhile a <= b:\n a = a * 3\n b = b * 2\n year += 1\nprint(year)\n \t \t \t \t \t \t \t\t\t \t\t \t \t \t", "ab = str(input())\r\nl = ab.split(' ')\r\nlst = [int(s) for s in l]\r\na = lst[0]\r\nb = lst[1]\r\nfor i in range(1, 100):\r\n if a*(3**i) > b*(2**i):\r\n print(i)\r\n break", "a,b=input().split()\r\na=(int)(a);b=(int)(b)\r\nyear=0\r\nwhile(a<=b):\r\n year+=1\r\n a*=3;b*=2\r\nprint(year)", "a,b=map(int,input().split())\r\nn=0\r\nwhile a<=b:\r\n n+=1\r\n a=3*a*n\r\n b=2*b*n\r\n \r\nprint(n)\r\n", "# https://codeforces.com/problemset/problem/791/A\r\n\r\ndef solve(a, b):\r\n days = 0\r\n while a <= b:\r\n a *= 3\r\n b *= 2\r\n days += 1\r\n return days\r\n\r\na, b = [int(e) for e in input().split()]\r\n\r\nprint(solve(a, b))\r\n", "#https://codeforces.com/contest/791/problem/A 37\r\n\r\nn = input().split()\r\n\r\ncount = 0\r\nwhile True: \r\n count += 1\r\n if ((int(n[0]) * 3) > (int(n[1]) * 2)):\r\n print(count)\r\n break\r\n n[0] = int(n[0]) * 3\r\n n[1] = int(n[1]) * 2\r\n", "Limak,Bob=input().split()\r\nLimak_=int(Limak)\r\nBob_=int(Bob)\r\na=1\r\nwhile Limak_*3*a<=Bob_*2*a:\r\n Limak_=Limak_*3*a\r\n Bob_=Bob_*2*a\r\n a+=1\r\nelse:\r\n print(a)\r\n\r\n", "li,be=map(int,input().split())\r\ncount=0\r\nwhile li<=be:\r\n\tli=li*3\r\n\tbe=be*2\r\n\tcount+=1\r\nprint(count)", "x,y= map(int, input().split())\r\nz= 0\r\nwhile x<=y:\r\n x*= 3\r\n y*= 2\r\n z+= 1\r\nprint(z)\r\n", "c = input().split(' ')\r\na = int(c[0])\r\nb = int(c[1])\r\ncounter = 0\r\nwhile a<=b:\r\n a = a*3\r\n b = b*2\r\n counter +=1\r\nprint(counter)", "a,b=map(int,input().split())\r\nkol=0\r\nwhile(a*3<=b*2):\r\n a*=3\r\n b*=2\r\n kol+=1\r\nprint(kol+1)\r\n", "a, b = map(int, input().split())\r\nct = 0\r\nwhile a <= b:\r\n a *= 3;b *= 2;ct += 1\r\nprint(ct)\r\n", "lm,bb=map(int,input().split())\r\nyrs=0\r\nwhile(lm<=bb):\r\n lm*=3\r\n bb*=2\r\n yrs+=1\r\nprint(yrs)\r\n", "a,b=map(int,input().split())\r\nyr=0\r\nwhile a<=b:\r\n yr+=1\r\n a=a*3\r\n b=b*2\r\nprint(yr)\r\n \r\n ", "inputUser = input().split()\r\na = int(inputUser[0])\r\nb = int(inputUser[-1])\r\nresult = 0\r\n\r\nwhile True:\r\n if (a == b) :\r\n a *= 3\r\n b *= 2\r\n result += 1\r\n elif (a < b):\r\n a *= 3\r\n b *= 2\r\n result += 1\r\n elif (a > b) :\r\n break\r\n\r\nprint(result)", "def solve(a, b):\r\n y = 0\r\n while a <= b:\r\n a *= 3\r\n b *= 2\r\n y += 1\r\n return y\r\n \r\n \r\n\r\nls = list(map(int, input().split()))\r\nprint(solve(ls[0], ls[1]))\r\n \r\n# T = int(input())\r\n# for i in range(T):\r\n# #input()\r\n# #k = int(input().split()[1])\r\n# ls = list(map(int, input().split()))\r\n# print(solve(ls[0], ls[1]))\r\n \r\n\r\n", "a,b = input().split()\r\na = int(a)\r\nb = int(b)\r\ncount =0\r\nwhile a<=b:\r\n a = a*3\r\n b = b*2\r\n count+=1 \r\nprint(count)", "initial_length, initial_breadth = map(int, input().split())\r\ncount = 0\r\n\r\nwhile initial_length <= initial_breadth:\r\n initial_length = initial_length * 3\r\n initial_breadth = initial_breadth * 2\r\n count += 1\r\n\r\nprint(count)\r\n", "num_array = input().split()\r\n \r\nnum1 = int(num_array[0])\r\nnum2 = int(num_array[1])\r\ncount = 0\r\n \r\nwhile num1 <= num2:\r\n num1 *= 3\r\n num2 *= 2\r\n count += 1\r\n \r\nprint(count)", "# Input Limak's and Bob's initial weights\r\nlimak_weight, bob_weight = map(int, input().split())\r\n\r\n# Initialize the number of years\r\nyears = 0\r\n\r\n# Simulate their growth until Limak becomes strictly heavier than Bob\r\nwhile limak_weight <= bob_weight:\r\n limak_weight *= 3\r\n bob_weight *= 2\r\n years += 1\r\n\r\n# Print the number of years it took\r\nprint(years)\r\n", "a,b=map(int,input().split())\r\ny=0\r\nwhile a <= b:\r\n a=a*3\r\n b=b*2\r\n y+=1\r\nprint(y)", "import math\r\ns=list(map(int,input().split()))\r\na=s[0]\r\nb=s[1]\r\nif(a!=b):\r\n print(math.ceil(math.log(b/a,10)/0.176))\r\nelse:\r\n print(1)", "a , b = map(int,input().split())\r\nc = 0\r\ndef m(a,b) :\r\n global c\r\n c += 1\r\n x = a*3 \r\n z = b*2\r\n # print(f\"{x} {z}\")\r\n if x <= z :\r\n \r\n return m(x,z)\r\n print(c)\r\nm(a,b)", "a,b=map(int,input().split())\r\nd=0\r\nwhile(True):\r\n if(3*a>2*b):\r\n d=d+1\r\n break\r\n else:\r\n d=d+1\r\n a=3*a\r\n b=b*2\r\nprint(d)", "L = input().split(\" \")\r\nL = [int(i) for i in L]\r\ncmp = 0\r\nwhile L[0] <= L[1]:\r\n L[0]*=3\r\n L[1]*=2\r\n cmp+=1\r\nprint(cmp)", "a,b =map(int,input().split())\r\nyears = 0\r\nwhile a <= b:\r\n years+=1\r\n a*=3\r\n b*=2\r\nprint(years)", "a,b=map(int,input().split())\r\ns=0\r\nwhile a<=b:\r\n if a>b:\r\n break\r\n a=3*a\r\n b=2*b\r\n s+=1\r\nprint(s)\r\n", "def yearTobeLeft(wL,wB):\r\n cnt=0\r\n while(wL<=wB):\r\n wL=wL*3\r\n wB=wB*2\r\n cnt+=1\r\n return cnt\r\n\r\nwL,wB = [int(x) for x in input().split(' ')]\r\nprint(yearTobeLeft(wL,wB))\r\n ", "a, b = (int(i) for i in input().split())\r\n\r\nyears = 1\r\nwhile True:\r\n\ta *= 3\r\n\tb *= 2\r\n\tif a > b:\r\n\t\tbreak\r\n\tyears += 1\r\nprint(years)", "a=str(input())\r\nb=a.split()\r\nd=int(b[0])\r\nc=int(b[1])\r\ne=0\r\nwhile d<=c:\r\n d=3*d\r\n c=2*c\r\n e=e+1\r\nprint(e)\r\n \r\n\r\n", "str = input()\r\narr = str.split()\r\na, b = int(arr[0]), int(arr[1])\r\ncntr = 0\r\n\r\nwhile a <= b:\r\n a *= 3\r\n b *= 2\r\n cntr += 1\r\n\r\nprint(cntr)\r\n", "limak, bob = map(int,input().split())\r\ncnt = 0\r\nwhile(limak <= bob):\r\n if limak <= bob:\r\n cnt += 1\r\n limak = 3 * limak\r\n bob = 2 * bob\r\nprint(cnt)\r\n", "limak_w,bob_w =map(int,input().split())\r\nyears=0\r\nwhile limak_w<=bob_w:\r\n limak_w*=3\r\n bob_w*=2\r\n years+=1\r\nprint(years)", "first , second = map(int , input().split())\r\n\r\nyears = 0\r\n\r\nwhile first <= second :\r\n first *= 3\r\n second *= 2\r\n years += 1\r\n\r\nprint(years)", "x, y = map(int, input().split())\r\ncount = 0\r\nwhile x <= y:\r\n x = 3 * x\r\n y = 2 * y\r\n count += 1\r\nprint(count)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Sep 6 16:08:15 2023\r\n\r\n@author: mac\r\n\"\"\"\r\n\r\nl, b = list(map(int, input().split(\" \"))) #赋予初始体重\r\nyear = 0 #年份数\r\nwhile l <= b:\r\n l = l * 3\r\n b = b * 2\r\n year += 1\r\nprint(year)", "a, b = map(int, input().split())\r\n\r\ni=0\r\nwhile(a<=b):\r\n a*=3\r\n b*=2\r\n i+=1\r\nprint(i)", "x,y = map(int,input().split())\r\ni = 1\r\nwhile True:\r\n x = 3*x\r\n y = 2*y\r\n if x > y:\r\n print(i)\r\n break\r\n else:\r\n i+=1\r\n", "a,b = (input().split(\" \"))\r\na,b = int(a),int(b)\r\ncount = 0 \r\nwhile a <= b:\r\n a = a*3\r\n b = b*2\r\n count += 1\r\nprint(count)", "l, b = input().split()\n\nl = int(l)\nb = int(b)\n\nyears = 0\n\nwhile l <= b:\n l = l * 3\n b = b * 2\n years = years + 1\n\nprint(years)\n\n \t \t\t \t\t\t \t\t\t \t\t \t\t \t\t \t", "a,b = map(int,input().split())\r\nyears = 0\r\nwhile a<=b:\r\n a*=3\r\n b*=2\r\n years +=1\r\nprint(years)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Oct 9 21:51:47 2023\r\n\r\n@author: 刘婉婷 2300012258\r\n\"\"\"\r\n\r\na,b=map(int,input().split())\r\nn=0\r\nwhile a<=b:\r\n n+=1\r\n a=a*3\r\n b=b*2\r\nprint(n)\r\n ", "x = input(\"\").split(\" \")\r\nl = int(x[0])\r\nb = int(x[1])\r\nyear = 0\r\nwhile True:\r\n year = year + 1 \r\n l = l*3\r\n b = b*2\r\n if l>b:\r\n break\r\n\r\nprint(year)", "# Read input\r\na, b = map(int, input().split())\r\n\r\n# Initialize years counter\r\nyears = 0\r\n\r\n# Simulate the growth until Limak becomes strictly larger than Bob\r\nwhile a <= b:\r\n a *= 3 # Limak's weight triples each year\r\n b *= 2 # Bob's weight doubles each year\r\n years += 1\r\n\r\n# Print the number of years required\r\nprint(years)\r\n", "li,bob = map(int, input().split())\r\n\r\nk=0\r\nwhile li<=bob :\r\n li *=3\r\n bob *=2\r\n k +=1\r\n\r\nprint(k)\r\n", "a,b=map(int,input().split())\r\nx=1\r\nwhile a*3**x<=b*2**x:\r\n x+=1\r\nprint(x)", "from sys import stdin, stdout\r\n\r\n\r\ndef solution():\r\n\r\n a, b = map(int, stdin.buffer.readline().decode().split())\r\n\r\n answer = 0\r\n\r\n while a <= b:\r\n answer += 1\r\n a *= 3\r\n b *= 2\r\n\r\n return answer\r\n\r\n\r\ndef main():\r\n T = 1\r\n answers = [solution() for _ in range(T)]\r\n\r\n stdout.write('\\n'.join(map(str, answers)))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "a, b = map(int, input().split())\ncont=0\nwhile a<=b:\n a=a*3\n b=b*2\n cont+=1\nprint(cont)\n\t\t \t \t \t \t\t\t \t\t\t \t\t\t \t \t", "limak_bob_weights = list(input().split())\r\nlimak_weight = int(limak_bob_weights[0])\r\nbob_weight = int(limak_bob_weights[1])\r\nyears = 0\r\n\r\nwhile limak_weight <= bob_weight:\r\n limak_weight *= 3\r\n bob_weight *= 2\r\n years += 1\r\n\r\nprint(years)", "a,b = map(int,input().split())\r\nans=0\r\nwhile a<=b:\r\n a=a*3\r\n b=b*2\r\n ans=ans+1\r\nprint(ans)", "# Read Limak's weight (a) and Bob's weight (b)\r\na, b = map(int, input().split())\r\n\r\n# Initialize the number of years\r\nyears = 0\r\n\r\n# Simulate the growth of Limak and Bob's weights until Limak becomes larger than Bob\r\nwhile a <= b:\r\n a *= 3 # Limak's weight triples each year\r\n b *= 2 # Bob's weight doubles each year\r\n years += 1\r\n\r\n# Output the number of years it takes for Limak to become larger than Bob\r\nprint(years)\r\n", "# Read Limak's and Bob's weights\r\nlimak_weight, bob_weight = map(int, input().split())\r\n\r\n# Initialize the number of years\r\nyears = 0\r\n\r\n# Continue increasing Limak's and Bob's weights until Limak becomes larger than Bob\r\nwhile limak_weight <= bob_weight:\r\n limak_weight *= 3 # Limak's weight triples each year\r\n bob_weight *= 2 # Bob's weight doubles each year\r\n years += 1\r\n\r\n# Print the number of years required\r\nprint(years)\r\n", "(Limak,Bob) = map(int,input().split())\r\nyear = 0\r\nwhile Limak <= Bob:\r\n year = year + 1\r\n Limak = 3*Limak\r\n Bob = 2*Bob\r\nprint(year)", "c=input()\r\nls=list(map(int,c.split()))\r\na=ls[0]\r\nb=ls[1]\r\ncount=0\r\nwhile(a<=b):\r\n a=a*3\r\n b=b*2\r\n count+=1\r\nprint(count)", "x, y = map(int, input().split())\r\ncount = 0\r\n\r\nwhile (x <= y):\r\n x*=3\r\n y*=2\r\n count+=1\r\nprint(count)", "a, b = input(\" \").split()\r\n\r\ni = 0\r\nno_of_years = 0\r\n\r\nwhile 1 > 0:\r\n if int(a) > int(b):\r\n break\r\n else:\r\n no_of_years += 1\r\n a = 3*int(a)\r\n b = 2*int(b)\r\n\r\nprint(no_of_years)", "n,m=map(int,input().split())\r\nc=0\r\nwhile n<=m:\r\n n*=3\r\n m*=2\r\n c=c+1\r\nprint(c)\r\n ", "a = list(map(int, input().split()))\r\na1 = a[0]\r\na2 = a[1]\r\nt = 0\r\nwhile a1<=a2:\r\n t = t+1\r\n a1 = a1*3\r\n a2 = a2*2\r\nprint(t)\r\n\r\n \r\n", "ages = input().split()\r\nlimak = int(ages[0])\r\nbob = int(ages[1])\r\nyear = 0\r\nwhile True:\r\n year += 1\r\n limak *=3\r\n bob *= 2\r\n if bob<limak:\r\n break\r\nprint(year)\r\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\ndef in2i():\r\n '''\r\n input to int\r\n '''\r\n return int(input())\r\n\r\ndef in2il():\r\n '''\r\n intput to int list\r\n '''\r\n return (list(map(int, input().split())))\r\n\r\ndef s2cs():\r\n '''\r\n string to chars\r\n '''\r\n s = input()\r\n return (list(s[:len(s)]))\r\n\r\na, b = in2il()\r\ny = 0\r\nwhile (a <= b):\r\n a *= 3\r\n b *= 2\r\n y += 1\r\nprint(y)", "import sys\r\n\r\na, b = map(int, sys.stdin.readline().strip().split())\r\nres = 0\r\n\r\nwhile a <= b:\r\n a *= 3\r\n b *= 2\r\n res += 1\r\n\r\nprint(res)\r\n", "a, b = map(int, input().split())\r\nyears = 0\r\n\r\nwhile a <= b:\r\n years += 1\r\n a = 3*a\r\n b = 2*b\r\n\r\nprint(years)", "ab = (input())\nab=ab.split()\na = int(ab[0])\nb = int(ab[1])\nr= 0\nwhile a<=b:\n a=a*3\n b=b*2\n r=r+1\nprint(r)\n \t\t \t \t\t\t \t \t\t\t\t \t \t \t", "laci=str(input(\"\"))\r\nlacis1=int(laci.split(\" \")[0])\r\nlacis2=int(laci.split(\" \")[1])\r\ngadi=0\r\n\r\nwhile True:\r\n if lacis1>lacis2:\r\n print(gadi)\r\n break\r\n lacis1=lacis1*3\r\n lacis2=lacis2*2\r\n gadi=gadi+1", "l,b=map(int,input().split(\" \"))\r\ni=0\r\nflag=0\r\nwhile(True):\r\n l=l*3\r\n b=b*2\r\n if(l>b):\r\n break;\r\n i+=1\r\nprint(i+1)", "A,B=map(int,input().split())\r\nyrs=0\r\nwhile A<=B:\r\n A=A*3\r\n B=B*2\r\n yrs+=1\r\nprint(yrs)", "s=input()\r\na,b=s.split()\r\na=int(a)\r\nb=int(b)\r\ncount=0\r\nwhile a<=b:\r\n a*=3\r\n b*=2\r\n count+=1\r\nprint(count) ", "import math\r\nif __name__=='__main__':\r\n\tinputs = input().split(' ')\r\n\ta = int(inputs[0])\r\n\tb = int(inputs[1])\r\n\tprint(int(math.log(b/a, 3/2)) + 1)", "import sys\r\n\r\n#a,b a tripled, b doubled\r\nfor line in sys.stdin:\r\n a,b = [int(x) for x in line.strip().split()]\r\n i = 0\r\n while True:\r\n if a > b:\r\n print(i)\r\n break\r\n i+=1\r\n a*=3\r\n b*=2\r\n", "weights = list(map(int,input().split()))\r\nl = weights[0]\r\nb = weights[1]\r\n\r\nk=0\r\nwhile l<=b:\r\n k+=1\r\n l*=3\r\n b*=2\r\n\r\nprint(k)", "first = input().split(\" \")\r\nbear = int(first[0])\r\nbig_brother = int(first[1])\r\ncount = 0\r\nwhile bear <= big_brother:\r\n bear = bear*3\r\n big_brother = big_brother*2\r\n count +=1\r\nprint(count)", "a,b=map(int,input().split())\r\ns=0\r\nwhile a<=b:\r\n a*=3\r\n b*=2\r\n s+=1\r\nif a>b:\r\n print(s)", "n,k = map(int,input().split())\r\ncol = 0\r\nwhile n <= k:\r\n n *= 3\r\n k *=2\r\n col +=1\r\nprint(col)\r\n", "a, b = input().split()\r\na, b = int(a), int(b)\r\ni = 0\r\nwhile a <= b:\r\n a = 3*a\r\n b = 2*b\r\n i += 1\r\nprint(i)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Sep 12 16:11:24 2023\r\n\r\n@author: ljy\r\n\"\"\"\r\n\r\na,b=map(int,input().split())\r\ni=0\r\nwhile a<=b:\r\n a=a*3\r\n b=b*2\r\n i+=1\r\nprint(i)", "a,b=[int(x) for x in input().split()]\r\ncount=0\r\nwhile b>=a:\r\n a=a*3\r\n b=b*2\r\n count+=1\r\nprint(count)", "a, b = map(int, input().split())\r\ny = 0\r\nwhile b >= a:\r\n y += 1\r\n a = a * 3\r\n b = b * 2\r\n\r\nprint(y)\r\n\r\n", "limak,pop=map(int,input().split())\r\nc=0\r\nwhile pop >= limak:\r\n if pop >= limak :\r\n pop*=2\r\n limak*=3\r\n c+=1\r\nprint(c)", "# Input\r\na, b = map(int, input().split())\r\n\r\n# Initialize years counter\r\nyears = 0\r\n\r\n# Simulate the weight growth until Limak becomes larger than Bob\r\nwhile a <= b:\r\n a *= 3 # Limak's weight triples\r\n b *= 2 # Bob's weight doubles\r\n years += 1\r\n\r\n# Output the number of years\r\nprint(years)\r\n", "s = input()\r\nb = s.split(\" \")\r\nd = 0\r\nfor i in range(100):\r\n b[0] = int(b[0])*3\r\n b[1] = int(b[1])*2\r\n d += 1\r\n if b[0]>b[1]:\r\n break\r\n else:\r\n continue\r\nprint(d)", "str1=input().split()\r\nBob=int(str1[0])\r\nMark=int(str1[1])\r\ni=0\r\nwhile Bob<=Mark:\r\n Bob=Bob*3\r\n Mark=Mark*2\r\n i+=1\r\nprint(i)", "a,b = map(int,input().split())\r\nyear=0\r\nwhile True:\r\n a=a*3\r\n b=b*2\r\n year = year +1\r\n if a>b:\r\n break\r\nprint(year) ", "a,b = map(int,input().split())\r\nans = 0\r\nwhile a <= b:\r\n a = a*3\r\n b = b*2\r\n ans += 1\r\nprint(ans)\r\n", "a, b=map(int, input().split())\r\ni=1\r\nc=0\r\nwhile(i):\r\n a*=3\r\n b*=2\r\n c+=1\r\n if a>b:\r\n break\r\nprint(c)", "a,b = map(int,input().split())\r\ncounter = 0\r\nwhile a <= b:\r\n a = a*3\r\n b = b*2\r\n counter += 1\r\nprint(counter)", "n,m = list(map(int ,input().split()))\r\n\r\n\r\nyears = 0\r\n\r\nwhile n <= m:\r\n n *= 3\r\n m *= 2\r\n years+=1\r\nprint(years) \r\n", "a,b=map(int,input().split())\r\ni=1\r\nwhile i>0:\r\n a*=3\r\n b*=2\r\n if a>b:\r\n print(i)\r\n break\r\n i+=1", "a,b=map(int,input().split())\r\nc=0\r\nwhile a<=b:\r\n a = 3*a\r\n b = 2*b\r\n c+=1\r\nprint(c)\r\n", "import math\r\nnum = input()\r\na = int(num.split()[0])\r\nb = int(num.split(\" \")[1])\r\ni = 0\r\nwhile a*(3**i)<=b*(2**i):\r\n i +=1\r\nprint(i)", "a,b = map(int,input().split())\r\nif a == b:\r\n print(1)\r\nelse:\r\n count = 0\r\n while a<=b:\r\n a = a*3\r\n b = b*2\r\n count += 1\r\n print(count)", "a, b = map(int, input().split())\r\ncontador = 0\r\nwhile True:\r\n if a > b:\r\n print(contador)\r\n break\r\n else: \r\n a = a*3\r\n b = b*2\r\n \r\n contador += 1 ", "l, b = map(int,input().split( ))\r\nc=0\r\nwhile not(l>b):\r\n l=l*3\r\n b=b*2\r\n c+=1\r\nprint(c)\r\n", "w = input()\r\nwt = w.split()\r\nwt = [int(i) for i in wt ]\r\n# print(wt)\r\n\r\n\r\nyears = 0\r\n\r\nwhile(wt[0] <= wt[1]):\r\n years+=1\r\n wt[0] *= 3\r\n wt[1] *= 2 \r\nprint(years)\r\n", "s = input().split()\r\na = int(s[0])\r\nb = int(s[1])\r\nt = 0\r\nwhile True:\r\n if a > b:\r\n break\r\n a *= 3\r\n b *= 2\r\n t += 1\r\nprint(t)\r\n", "l=input().split()\r\na=int(l[0])\r\nb=int(l[1])\r\nfor x in [1,2,3,4,5,6,7,8,9,10]:\r\n if a*(3**x)>b*(2**x):\r\n print(x)\r\n break", "import collections\r\nimport math \r\n\r\ndef solve(n, array):\r\n pass\r\ndef solve(array):\r\n # given a and b\r\n # a is guaranteed to be <= b\r\n # a * 3^(x + 1) > b * 2^(x + 1)\r\n # find the smallest x such that the above inequality holds\r\n # rearrange the vars\r\n # a * 3^(x + 1) > b * 2^(x + 1)\r\n # (3/2)^(x + 1) > b/a\r\n # log base (3/2) (b/a) round up\r\n a, b = array\r\n exp_val = math.log(b / a, 3 / 2)\r\n print(str(int(math.floor(exp_val)) + 1))\r\n\r\n\r\ndef main():\r\n testcases = 1 \r\n #testcases = int(input()) # multiple testcases\r\n for _ in range(testcases):\r\n #n = int(input())\r\n array = list(map(int,input().split()))\r\n #solve(n, array)\r\n solve(array)\r\n \r\nmain()", "import sys\r\nimport itertools\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp(): #Uno solo\r\n return(int(input()))\r\ndef inlt(): #Dos o mas\r\n return(list(map(int,input().split())))\r\ndef insr(): #String\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr(): #Vectores\r\n return(map(int,input().split()))\r\n\r\nw=inlt()\r\na=w[0]\r\nb=w[1]\r\ncount=0\r\nwhile(a<=b):\r\n a=a*3\r\n b=b*2\r\n count+=1\r\nprint(count)\r\n\r\n", "x, y = map(int, input().split())\r\n\r\ni=1\r\nwhile True:\r\n x *= 3\r\n y *= 2\r\n\r\n if x>y:\r\n break\r\n else:\r\n i += 1\r\n\r\nprint(i)", "a, b = map(int, input().split())\r\n\r\nc = 0 \r\nwhile True:\r\n a = a * 3\r\n b = b * 2\r\n\r\n c = c + 1\r\n\r\n if a > b:\r\n break\r\n\r\nprint(c)", "a,b=map(int,input().split())\r\nyear=0\r\nwhile a<=b:\r\n a=3*a\r\n b=2*b\r\n year+=1\r\nprint(year)", "#Bear and Big Brother\r\na,b = map(int, input().split())\r\nflag = 1\r\nwhile( a <= b):\r\n limak = 3 * a\r\n bob = 2 * b\r\n if( limak <= bob):\r\n flag += 1\r\n else:\r\n break\r\n a = limak\r\n b = bob\r\nprint(flag) ", "L,B = map(int,input().split())\r\nyear = 0\r\nwhile L <= B:\r\n L = 3*L\r\n B = 2*B\r\n year += 1\r\nprint(year)\r\n", "x= input()\r\ny=x.split( )\r\na,b = y\r\ncount = 0\r\nwhile int(a)<=int(b):\r\n a=int(a)*3\r\n b=int(b)*2\r\n count+=1\r\nprint(count)", "number = input().split()\r\nlimak = int(number[0])\r\nbob = int(number[1])\r\nyear = 0\r\nwhile limak < bob:\r\n limak = limak*3\r\n bob = bob*2\r\n year = year + 1\r\nif limak > bob:\r\n print(year)\r\nelse:\r\n print(year+1)\r\n", "a,b = map(int, input().split())\r\ncount = 0\r\nwhile True:\r\n if(a>b):\r\n break\r\n else:\r\n a*=3\r\n b*=2\r\n count+=1\r\nprint(count)\r\n", "a, b = input().split()\n\ncont = 0\nwhile int(a) <= int(b):\n a = int(a) * 3\n b = int(b) * 2 \n cont += 1\n\nprint(cont)\n \t\t\t\t \t\t \t \t\t\t\t\t \t\t\t\t \t \t\t", "a=input()\r\nw_1=int(a.split()[0])\r\nw_2=int(a.split()[1])\r\ny=0\r\nwhile w_1<=w_2:\r\n y+=1\r\n w_1*=3\r\n w_2*=2\r\nprint(y)", "w=input()\r\na=w.split()\r\nturn=0\r\nwhile int(a[0])<=int(a[1]):\r\n a[0]=3*int(a[0])\r\n a[1]=2*int(a[1])\r\n turn+=1\r\nelse:\r\n print(turn)", "a,b =input().split()\r\na=int (a)\r\nb=int (b)\r\ncount=0\r\nwhile a<=b:\r\n a=a*3\r\n b=b*2\r\n count+=1\r\nprint (count) \r\n", "n, m = input().split()\r\ncount = 0\r\nwhilecounter = 0\r\nn , m = int(n), int(m)\r\nwhile n <= m:\r\n n *= 3\r\n m *= 2\r\n count += 1\r\n if n > m:\r\n break\r\n\r\n whilecounter += 1\r\n if whilecounter > 50:\r\n break\r\n\r\nprint(count)", "n=input().split()\r\na=n[0]\r\nb=n[1]\r\ny=0\r\nwhile int(a) <= int(b):\r\n a=int(a)*3\r\n b=int(b)*2\r\n y+=1\r\nprint(y)", "p,q=map(int,input().split());s=0\r\nwhile p<=q:p*=3;q*=2;s+=1\r\nprint(s)\r\n", "a,b = map(int,input().split())\r\ncount =0\r\nwhile(a<b or a==b):\r\n a = a*3\r\n b = b*2\r\n count= count + 1\r\nprint(count)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Sep 11 19:29:03 2023\r\n\r\n@author: 15110\r\n\"\"\"\r\n\r\nlst=list(map(int, input().split()))\r\na, b = lst[0], lst[1]\r\nyr=0\r\nwhile not a>b:\r\n a*=3\r\n b*=2\r\n yr+=1\r\nprint(yr)", "# t = int(input())\r\n# for _ in range(t):\r\n# n = int(input())\r\n# l1 = []\r\n# for i in range(3):\r\n# s = input()\r\n# l1.extend(list(s))\r\n# bol = True\r\n# x : int = 5.888\r\na, b = map(int, input().split(\" \"))\r\nc = 0\r\nwhile a <= b:\r\n a *= 3\r\n b *= 2\r\n c += 1\r\nprint(c)\r\n", "a,b=map(int,input().split())\r\nyears=0\r\nwhile a<=b:\r\n a *= 3\r\n b *= 2\r\n years +=1\r\nprint(years)", "# A. Bear and Big Brother - https://codeforces.com/contest/791/problem/A\n\n# def sol():\n# t = int(input())\n# for i in range(t):\n# a = int(input())\n# b = int(input())\n# ans = 0\n# while(a <= b):\n# a = a * 3\n# b = b * 2\n# ans+=1\n# print(ans)\n\n\n# sol()\n\n\ndef years_to_overtake(a, b):\n years = 0\n while a <= b:\n a *= 3\n b *= 2\n years += 1\n return years\n\n# Read input\na, b = map(int, input().split())\n\n# Calculate and print the number of years\nprint(years_to_overtake(a, b))\n\n", "a, b = map(int,input().split())\r\n\r\ncount = 0\r\n\r\nwhile a<=b:\r\n count+=1\r\n a=a*3\r\n b=b*2\r\nprint(count)", "import math\r\na,b=map(int,input().split())\r\nprint(int(math.log(b/a,3/2))+1)\r\n\r\n", "a, b = map(int, input().split())\r\ncount = 0\r\nwhile a <= b:\r\n a, b = a*3, b*2\r\n count += 1\r\nprint(count)\r\n", "row = input().split()\r\nrow = [int(ch) for ch in row]\r\n\r\nlimak = row[0]\r\nbob = row[1]\r\n\r\nidx = 0\r\nwhile (limak <= bob):\r\n limak *= 3\r\n bob *= 2\r\n idx += 1\r\n\r\nprint(idx)", "m,n = map(int, input().split())\r\ni = 0\r\nfound = True\r\nwhile(found):\r\n i = i + 1\r\n m= m * 3\r\n n = n*2\r\n if m > n:\r\n found = False\r\nprint(i)", "a,b=map(int, input().split())\r\ncount=0\r\nwhile a<=b:\r\n a=3*a\r\n b=2*b\r\n count+=1\r\nprint(count) ", "n=list(map(int,input().split()))\r\nanswer = 0\r\nsmallbear = n[0]\r\nbigbear = n[1]\r\ndef yearfinder(smallbear,bigbear,answer):\r\n if (smallbear <= bigbear):\r\n smallbear=smallbear*3\r\n bigbear=bigbear*2\r\n answer=answer+1\r\n yearfinder(smallbear,bigbear,answer);\r\n else:\r\n print(answer)\r\nyearfinder(smallbear,bigbear,answer)", "Limak, Bob = map(int, input().split())\r\nyear = 0\r\nwhile (Limak <= Bob):\r\n Limak *= 3\r\n Bob *= 2\r\n year += 1\r\nprint(year)\r\n", "weight1,weight2 = input().split()\r\nweight1 = int(weight1)\r\nweight2 = int(weight2)\r\ncount = 0\r\nwhile weight2 >= weight1:\r\n count +=1\r\n weight2 *= 2\r\n weight1 *= 3\r\nprint(count)", "a, b = map(int, input().split())\r\nyr = 0\r\nf = True\r\nwhile f is True:\r\n if a < b:\r\n yr += 1\r\n a = 3 * a\r\n b = 2 * b\r\n else:\r\n break\r\nif a == b:\r\n yr += 1\r\nprint(yr)", "def i():\r\n return(int(input()))\r\ndef l():\r\n return(list(map(int,input().split())))\r\ndef s():\r\n s = input()\r\n return(s)\r\ndef sl():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef m():\r\n return(map(int,input().split()))\r\n\r\na, b = m()\r\ncount = 0\r\n\r\nwhile True:\r\n count += 1\r\n a = 3 * a\r\n b = 2 * b\r\n if a > b:\r\n print(count)\r\n exit()", "w = input().split(' ')\r\nfor i in range(len(w)):\r\n w[i] = int(w[i])\r\n\r\ncount = 0\r\n\r\nwhile w[1] >= w[0]:\r\n w[1] = w[1] * 2\r\n w[0] = w[0] * 3\r\n count += 1\r\n\r\nprint(count)", "l,b=map(int,input().split())\r\na=0\r\nwhile(l<=b):\r\n l=l*3\r\n b=b*2\r\n a=a+1\r\nprint(a)\r\n", "a,b=map(int,input().split())\r\ns=0\r\nwhile b>=a:\r\n a=a*3\r\n b=b*2\r\n s=s+1\r\nprint(s)\r\n", "weights = input()\r\nweights = weights.strip()\r\nweights = weights.split()\r\nint_weights = [int(weights[0]), int(weights[1])]\r\n\r\nyears = 0\r\nlimak = int_weights[0]\r\nbob = int_weights[1]\r\n\r\nwhile limak <= bob:\r\n limak = limak * 3\r\n bob = bob * 2\r\n years += 1\r\n\r\nprint(years)\r\n", "text = input()\r\na, b = text.split(' ')\r\n\r\n\r\ncount = 0\r\nwhile True :\r\n a = int(a) * 3\r\n b = int(b) * 2\r\n count = count + 1\r\n if a > b :\r\n print(count)\r\n break\r\n \r\n\r\n", "l,b=map(int,input().split())\r\ncount=1\r\nfor i in range(0,100):\r\n l= l*3\r\n b=b*2\r\n if l<=b:\r\n count+=1\r\n else:\r\n break\r\nprint(count)", "l,b=map(int,input().split())\r\nyear=0\r\nwhile l<=b:\r\n l=l*3\r\n b=b*2\r\n year=year+1\r\nprint(year) \r\n ", "w=input().split(\" \")\r\na=int(w[0])\r\nb=int(w[1])\r\nn=0\r\nwhile a<b or a==b:\r\n a=a*3\r\n b=b*2\r\n n+=1\r\nprint(n)", "u = input().split()\r\na = int(u[0])\r\nb = int(u[1])\r\n \r\nc = 0\r\nwhile a <= b:\r\n a *= 3\r\n b *= 2\r\n c += 1\r\n \r\nprint(c)", "def solve(a, b):\r\n r = a/b\r\n m = 0\r\n while r <= 1:\r\n m = m + 1\r\n r = r * 1.5\r\n return m\r\n\r\na, b = map(int, input().split())\r\n\r\nprint(solve(a, b))", "a,b=map(int,input().split())\r\nyear=0\r\nif 1<=a<=10 and 1<=b<=10:\r\n while a<=b:\r\n a *=3\r\n b *=2\r\n year +=1\r\n print(year)", "l, b = map(int, input().split())\r\nans = 0\r\n\r\nif l > b:\r\n ans = 0\r\nelse:\r\n while l <= b:\r\n l = l*3\r\n b = b*2\r\n ans +=1\r\n\r\nprint(ans)", "Weight = str(input())\nResult = Weight.split()\nArray = [int(x) for x in Result]\ncount = 0;\n\n\nwhile Array[0] < Array[1] or Array[0] == Array[1]:\n Array[0] = Array[0] * 3\n Array[1] = Array[1] * 2\n count = count + 1\n \n\nprint(count)\n \n ", "def weight(a,b):\r\n a = a*3\r\n b = b*2\r\n \r\n return a,b\r\n\r\na,b = map(int,input().split())\r\nyear = 1\r\nwhile True:\r\n a,b = weight(a,b)\r\n if a>b:\r\n print(year)\r\n break\r\n else:\r\n year += 1", "l, b = map(int, input().split())\r\nc = 0\r\nwhile l <= b:\r\n l *= 3\r\n b *= 2\r\n c += 1\r\n\r\nprint(c)", "import sys\r\ns=[int (i) for i in sys.stdin.readline().split()]\r\nli=s[0]\r\nbob=s[1]\r\ny=0\r\nwhile li <= bob:\r\n li *= 3\r\n bob *= 2\r\n y+=1\r\nprint(y)", "a,b=map(int,input().split())\r\n\r\ni=1\r\nwhile(i>0):\r\n a=3*a\r\n b=2*b\r\n if(a>b):\r\n print(i)\r\n break\r\n i+=1", "c=0\r\nx,y=str(input()).split()\r\nwhile(int(x)<=int(y)):\r\n x=int(x)*3\r\n y=int(y)*2\r\n c+=1\r\nprint(c)\r\n\r\n", "a,b=map(int,input().split())\r\nm=0\r\nwhile a<=b:\r\n a=a*3\r\n b=b*2\r\n m+=1\r\nprint(str(m))", "Limak = input().split()\nBob = int(Limak[1])\nLimak = int(Limak[0])\nyear = 0\n\nwhile Limak <= Bob:\n Limak *= 3\n Bob *= 2\n year +=1\nprint(year)\n", "x = input()\r\nz = x.split(\" \")\r\ncount = 0 \r\nwhile (int(z[0])<=int(z[1])):\r\n z[0]=int(z[0])*3\r\n z[1] =int(z[1])*2\r\n count+=1\r\nprint(count)", "a,b=map(int,input().split())\r\nif a>b:\r\n print(0)\r\nc=0\r\nwhile(a<=b):\r\n a=a*3\r\n b=b*2\r\n c+=1\r\n if a>b:\r\n break\r\n else:\r\n continue\r\nprint(c)", "#Coder_1_neel\r\na,b=map(int,input().split())\r\nx=a*3\r\ny=b*2\r\nco=1\r\nwhile x<=y:\r\n x=x*3\r\n y=y*2\r\n co+=1\r\nprint(co)", "a, b = map(int, input().split())\ncontador = 0\n\nwhile not a > b:\n contador += 1\n a *= 3\n b *= 2\nprint(contador)\n", "year = 0\r\na,b=map(int,input().split()) \r\nwhile(b > a or b == a):\r\n year += 1\r\n a *= 3\r\n b *= 2\r\nprint(year)", "limak,bob = map(int,input().split())\r\n\r\nyears = 0\r\nwhile limak <= bob:\r\n limak *= 3\r\n bob *= 2\r\n years += 1\r\n\r\nprint(years) \r\n\r\n\r\n", "weights = input().split(\" \")\r\nlBear = int(weights[0])\r\nbBear = int(weights[1])\r\nyears = 0\r\nwhile lBear <= bBear:\r\n lBear *= 3\r\n bBear *= 2\r\n years += 1\r\nprint(years)", "w = input()\r\nl = w.split(\" \")\r\ni = 0\r\nweight_l, weight_b = l\r\nweight_l = int(weight_l)\r\nweight_b = int(weight_b)\r\nwhile weight_l <= weight_b:\r\n weight_l *= 3\r\n weight_b *= 2\r\n i += 1\r\nprint (i)", "l=list(map(int,input().strip().split()))\r\nif 1<=l[0]<=l[1]<=10:\r\n c=0\r\n while l[0]<=l[1]:\r\n l[0]*=3\r\n l[1]*=2\r\n c+=1\r\n print(c)\r\n ", "ab =input().split()\r\na,b = int(ab[0]), int(ab[1])\r\nn = 0\r\nwhile a<=b:\r\n a *= 3\r\n b *= 2\r\n n += 1\r\nprint(n)\r\n\r\n \r\n\r\n \r\n\r\n\r\n\r\n", "limak,bob=(input()).split(\" \")\r\nlimak = int(limak)\r\nbob= int(bob)\r\nyears=0\r\nwhile True:\r\n if limak > bob:\r\n print(years)\r\n break\r\n else:\r\n limak = 3 * limak\r\n bob = 2 * bob\r\n years += 1", "s = input().split(' ')\r\nn = int(s[0])\r\nm = int(s[1])\r\nk = 0\r\nwhile n <= m:\r\n n *= 3\r\n m *= 2\r\n k += 1\r\nprint(k)\r\n", "a,b=map(int,input().split())\r\nres=0\r\nwhile(a<=b):\r\n a*=3\r\n b*=2\r\n res+=1 \r\nprint(res)", "a,b=map(int,input().split())\r\nc=0\r\nwhile a<=b:\r\n a*=3;b*=2;c+=1\r\nprint(c),", "weight = [int(i) for i in input().split()]\r\na = weight[0]\r\nb = weight[1]\r\ncount = 0\r\n\r\nwhile a <= b:\r\n a *= 3\r\n b *= 2\r\n count += 1\r\n \r\nprint(count)", "a=input()\r\na,b=int(a.split()[0]),int(a.split()[1])\r\nn=0\r\nwhile True:\r\n n+=1\r\n a*=3\r\n b*=2\r\n if a>b: \r\n print(n)\r\n break", "a,b=map(int,input().split())\r\nx=0\r\nwhile True:\r\n x=x+1\r\n a=a*3\r\n b=b*2\r\n if a>b:\r\n break\r\nprint(x)", "a,b = map(int, input().split());\r\ncounts = 0;\r\nwhile(a <= b):\r\n a*=3;\r\n b*=2;\r\n counts+=1;\r\nprint(counts);", "a=input().split()\r\ni=0\r\nwhile int(a[0]) <= int(a[1]) :\r\n a[0]=int(a[0])*3\r\n a[1]=int(a[1])*2\r\n i+=1\r\nprint(i)", "l, b = [int(x) for x in input().split(' ')]\r\ni = 0\r\nwhile l <= b:\r\n l *= 3\r\n b *= 2\r\n i += 1\r\nprint(i)\r\n", "l,m=map(int, input().split())\r\nflag=0\r\nwhile l<=m:\r\n l*=3\r\n m*=2\r\n flag+=1\r\nprint(flag)\r\n", "n=0\r\na=list(map(int,input().split()))\r\np=a[0]\r\nq=a[1]\r\nwhile p<=q:\r\n p=p*3\r\n q=q*2\r\n n+=1\r\nprint(n)", "a, b = map(int, input().split(' '))\r\ncount=0\r\n\r\nwhile True:\r\n a *= 3\r\n b *= 2\r\n count += 1\r\n if a>b:\r\n break\r\n \r\n else:\r\n pass\r\n \r\nprint(count)", "def years_until_larger(a, b):\r\n years = 0\r\n while a <= b:\r\n a *= 3\r\n b *= 2\r\n years += 1\r\n return years\r\n\r\n# Read input\r\na, b = map(int, input().split())\r\n\r\n# Calculate the number of years until Limak becomes larger than Bob\r\nresult = years_until_larger(a, b)\r\n\r\n# Print the result\r\nprint(result)\r\n", "a,b=map(int,input().split())\r\n\r\ndef weight(a,b,years=0):\r\n if a>b:\r\n return years\r\n else:\r\n return weight(3*a,2*b,years+1)\r\nresult = weight(a,b)\r\nprint(result)", "limak_weight, bob_weight = map(int, input().split())\r\n\r\n\r\nyears = 0\r\n\r\n\r\nwhile limak_weight <= bob_weight:\r\n limak_weight *= 3\r\n bob_weight *= 2\r\n years += 1\r\n\r\n\r\nprint(years)", "import math\r\n\r\na, b = map(int, input().split())\r\nr = b / a\r\ns = math.log(r, 1.5)\r\nif s == int(s):\r\n s += 1\r\nprint(math.ceil(s))\r\n", "a,b=map(int,input().split())\r\np=0\r\nwhile a<=b:\r\n p+=1\r\n a*=3\r\n b*=2\r\nprint(p)", "limak, bob = [int(f) for f in input().split()]\r\nyear = 0\r\n\r\nwhile limak <= bob:\r\n limak *= 3\r\n bob *= 2\r\n year += 1\r\n\r\nprint(year)", "raw=input()\r\nrawed=raw.split()\r\na=int(rawed[0])\r\nb=int(rawed[-1])\r\nx=0\r\nwhile a<=b:\r\n a=a*3\r\n b=b*2\r\n x+=1\r\nprint(x)", "a,b=map(int,input().split())\r\nx=0\r\nwhile(a<=b):\r\n a*=3\r\n b*=2\r\n x+=1\r\nprint(x) ", "a,b=map(int, input().split())\r\nc_year=0\r\nwhile a<=b :\r\n a=3*a \r\n b=2*b\r\n c_year+=1\r\nprint(c_year)", "a,b = map(int,input().split())\r\n\r\nyears = 0\r\n\r\nwhile b >= a:\r\n years += 1\r\n\r\n b = (b*2)*years\r\n a = (a*3)*years\r\n\r\nprint(years)\r\n\r\n \r\n", "def limakBob(a,b):\r\n count=0\r\n if a>b:\r\n return 0\r\n while a<=b:\r\n a*=3\r\n b*=2\r\n count+=1\r\n return count\r\na,b=map(int,input().split())\r\nprint(limakBob(a,b))\r\n", "lb = list(map(int, input().split(\" \")))\r\nL = lb[0]\r\nB = lb[1]\r\ncounter = 0\r\nwhile L <= B:\r\n L = L*3\r\n B = B*2\r\n counter += 1\r\nprint(counter)", "q,w=map(int,input().split())\r\ne=0\r\nwhile q<=w:\r\n e+=1\r\n q=q*3\r\n w=w*2\r\nprint(e)", "# Bear Limak wants to become the largest of bears, or at least to become larger than his brother Bob.\n\n# Right now, Limak and Bob weigh a and b respectively. It's guaranteed that Limak's weight is smaller than or equal to his brother's weight.\n\n# Limak eats a lot and his weight is tripled after every year, while Bob's weight is doubled after every year.\n\n# After how many full years will Limak become strictly larger (strictly heavier) than Bob?\n# Input\n\n# The only line of the input contains two integers a and b (1 ≤ a ≤ b ≤ 10) — the weight of Limak and the weight of Bob respectively.\n# Output\n\n# Print one integer, denoting the integer number of years after which Limak will become strictly larger than Bob.\n\n\nweight = list(map(int, input().split()))\na, b = weight\ncount = 0\nwhile True:\n if a > b:\n break\n else:\n a *= 3\n b *= 2\n count += 1\n\nprint(count)\n", "import math\r\nimport functools\r\nimport collections\r\n\r\n\r\nif __name__ == '__main__':\r\n a, b = map(int, input().split())\r\n i = 0\r\n while True:\r\n if a > b:\r\n print(i)\r\n break\r\n a *= 3\r\n b *= 2\r\n i += 1\r\n\r\n", "str1=input(\"\")\r\nl=str1.split()\r\nn=0\r\na=int(l[0])\r\nb=int(l[1])\r\nwhile(a<=b):\r\n a*=3\r\n b*=2\r\n n+=1\r\nprint(n)", "s=input()\r\nL=s.split(\" \")\r\nfor i in range(len(L)):\r\n L[i]=int(L[i])\r\n \r\ny=0\r\na=L[0]\r\nb=L[1]\r\nwhile a<=b:\r\n a*=3\r\n b*=2\r\n y+=1\r\nprint(y)", "p,y=map(int,input().split())\r\ni=0\r\nwhile(True):\r\n i=i+1\r\n p=p*3\r\n y=y*2\r\n if(p>y):\r\n break\r\nprint(i)", "s = input().split()\r\n\r\na = int(s[0])\r\nb = int(s[1])\r\n\r\ncnt = 0\r\nwhile a <= b:\r\n cnt += 1\r\n a *= 3 \r\n b *= 2\r\n\r\nprint(cnt)", "l = input().split()\r\na = int(l[0])\r\nb = int(l[1])\r\nfor i in range(10):\r\n a *= 3\r\n b *= 2\r\n if a > b:\r\n print(i+1)\r\n break\r\n", "a, b = input().split()\na = int(a)\nb = int(b)\nx = 0\nwhile a <= b:\n a = a*3\n b = b*2\n x = x+1\nprint(x)\n\n \t \t\t \t \t \t\t\t \t \t\t \t\t \t\t\t", "#Initializes weights and years\r\nweights = input().split(' ')\r\nLimak = int(weights[0])\r\nBob = int(weights[1])\r\nyears = 0\r\n\r\n#calculates how many years until Limak becomes heavier than Bob\r\nwhile Limak <= Bob:\r\n Limak *= 3\r\n Bob *= 2\r\n years +=1\r\nprint(years)", "import math\r\n\r\na, b = map(int, input().split())\r\nans = math.ceil((math.log10(a) - math.log10(b)) // (math.log10(2) - math.log10(3))) + 1\r\nprint(ans)", "s = input().split()\r\na = int(s[0])\r\nb = int(s[1])\r\ncounter = 0\r\nwhile a <= b:\r\n if a <= b:\r\n a = a*3\r\n b = b*2\r\n counter += 1\r\n\r\nprint(counter)\r\n", "a,b=map(int,input().split())\r\nc = 0\r\nwhile True:\r\n c += 1\r\n a *= 3\r\n b *= 2\r\n if a > b:\r\n break\r\nprint(c)", "a,b = map(int,input().split())\r\nk = 0\r\nwhile a<=b:\r\n a*=3\r\n b*=2\r\n k+=1\r\nprint(k)\r\n ", "x,y=map(int,input().split());c=0\r\nwhile x<=y:x*=3;y*=2;c+=1\r\nprint(c)", "def code(limak, bob):\r\n year = 0\r\n\r\n while limak <= bob:\r\n year += 1\r\n limak *= 3\r\n bob *= 2\r\n return year\r\n\r\nlimak, bob = list(map(int, input().split()))\r\nprint(code(limak=limak, bob=bob))\r\n", "a, b = map(int, input().split())\r\nfor i in range(1,20):\r\n a = a*3*i\r\n b = b*2*i\r\n if a>b:\r\n print(i)\r\n break", "a, b = [int(x) for x in input().split(\" \")]\r\n\r\nnum_years = 0\r\nwhile b >= a:\r\n a *= 3\r\n b *= 2\r\n num_years += 1\r\n\r\nprint(num_years)", "a,b=input().split()\r\na=int(a)\r\nb=int(b)\r\nfor i in (range(1,max(a,b)+1)):\r\n if a*3>b*2:\r\n print(i)\r\n break\r\n else:\r\n a=a*3\r\n b=b*2\r\n", "x,y=map(int,input().split())\r\nc=0\r\nwhile x<=y:\r\n c=c+1\r\n x*=3\r\n y*=2\r\nprint(c)\r\n", "l, b = map(int, input().split())\r\ncnt = 0\r\nwhile l <= b:\r\n l *= 3\r\n b *= 2\r\n cnt += 1\r\nprint(cnt)", "a , b = map(int , input().split())\nis_big = False\nyears = 0\nwhile (is_big == False):\n if a > b :\n break\n else :\n a *= 3\n b *= 2\n years += 1 \nprint(years)", "u,v=[int(x) for x in input().split()]\r\n\r\nt=0\r\nwhile(u<=v):\r\n u*=3\r\n v*=2\r\n t+=1\r\nprint(t)", "\nfrom math import log2\n\na, b = tuple(map(int, input().strip().split()))\nprint(f'{int(1 + ((log2(b) - log2(a)) // (log2(3) - 1)))}')", "m,n=map(int,input().split());a=0\r\nwhile m<=n:m*=3;n*=2;a+=1\r\nprint(a)", "#https://codeforces.com/contest/791/problem/A\r\na,b = map(int,input().split());\r\nans = 0\r\nwhile (a<=b):\r\n a*=3\r\n b*=2\r\n ans+=1\r\nprint(ans)", "Limak, Bob = map(int, input().split())\r\nyears = 0\r\nwhile Limak <= Bob:\r\n years, Limak, Bob = years + 1, Limak * 3, Bob * 2\r\nprint(years)", "import math\r\nm=input()\r\ng=m.split()\r\nalist=[]\r\nalist.append((int(g[0]), int(g[1])))\r\ncount=0\r\nfor c in alist:\r\n a,b=c\r\n if a==b:\r\n print(1)\r\n else:\r\n x = min(a, b)\r\n y = max(a, b)\r\n while x < y+0.0001:\r\n x=x*3\r\n y=y*2\r\n count += 1\r\n print(count)\r\n", "a, b= input().split()\r\na= int(a)\r\nb= int(b)\r\ncounter= 0\r\n \r\nwhile a <= b:\r\n a= 3*a\r\n b= 2*b\r\n counter+= 1\r\n \r\nprint(counter)", "l = input().split()\r\nyear = 0\r\n\r\nfor i in range(len(l)):\r\n l[i] = int(l[i])\r\n \r\nlimak = l[0]\r\nbob = l[1]\r\n\r\nwhile limak <= bob:\r\n limak *= 3\r\n bob *= 2\r\n year += 1\r\n\r\nprint(year)", "a,b=map(int,input().split())\r\ni=1\r\nwhile i>0:\r\n a=a*3\r\n b=b*2\r\n if a>b:\r\n print(i)\r\n break\r\n i+=1", "def solve():\r\n a,b = list(map(int,input().split()))\r\n res = 0\r\n while a <= b:\r\n a*=3\r\n b*=2\r\n res+=1\r\n return res\r\n \r\nprint(solve())", "a,b = map(int,input().split())\r\ncnt = 0\r\nwhile a<=b:\r\n cnt+=1\r\n a = a*3\r\n b = b*2\r\nprint(cnt)", "a,b=map(int,input().split())\r\ni=0\r\nwhile a<b or a==b:\r\n i=i+1\r\n a=a*3\r\n b=b*2\r\nprint(i) ", "if __name__ == '__main__':\n l, b = map(int, input().split())\n years = 0\n while l <= b:\n l *= 3\n b *= 2\n years += 1\n print(years)\n", "s=0\r\na,b=map(int,input().split())\r\nwhile a<=b:\r\n a=1.5*a\r\n s=s+1\r\nprint(s)", "import math\r\ncons=math.log(1.5)\r\na,b=list(map(int,input().split()))\r\nnum=math.log(b/a)\r\nprint(int(num//cons+1))", "a, b = input().split()\r\na = int(a)\r\nb = int(b)\r\ncond = True\r\nyear = 0\r\nwhile True:\r\n if a <= b:\r\n a *= 3\r\n b *= 2\r\n year += 1\r\n else:\r\n break\r\n\r\n\r\nprint(year)", "a , b = input().split(' ')\r\na = int(a)\r\nb = int(b)\r\ni = 0\r\nwhile a <= b:\r\n a *= 3\r\n b *= 2\r\n i += 1\r\nprint(i)", "import math\na,b = (int(x) for x in input().split())\nprint(int(math.log(b/a,1.5))+1)\n", "a,b = map(int, input().split())\r\nn=1\r\nwhile n>0:\r\n if a*((1.5)**n)>b:\r\n print(n)\r\n break\r\n n+=1", "a,b=map(int,input().split())\nans=0\nwhile a<=b:\n a*=3;b*=2;ans+=1\nprint(ans)", "n,k = map(int,input().split())\r\ncounter = 0\r\nwhile n <= k:\r\n n *= 3\r\n k *= 2\r\n counter += 1\r\nprint(counter)\r\n \r\n\r\n\r\n", "a,b=map(int,input().split())\r\ny=0\r\nwhile(a<=b):\r\n y+=1\r\n a=3*a\r\n b=2*b\r\nprint(y)", "weight_limak,weight_boba=map(int,input().split())\r\ncount=0\r\nwhile weight_boba>=weight_limak:\r\n count+=1\r\n weight_limak*=3\r\n weight_boba*=2\r\nprint(count)\r\n", "a,b=map(int,input().split())\r\nyear=0\r\nwhile(a<=b):\r\n year+=1\r\n a=a*3\r\n b=b*2\r\nprint(year)", "l, b = map(int, input().split())\r\nyears = 0\r\nwhile l <= b:\r\n l *= 3\r\n b *=2\r\n years+=1\r\nprint(years)", "n,m=map(int,input().split())\r\ncount=0\r\nwhile n<=m:\r\n\tn=3*n\r\n\tm=2*m\r\n\tcount+=1\r\nprint(count)", "limak, bob = map(int, input().split())\r\nyears = 0\r\n\r\nfor i in range(10):\r\n if limak > bob:\r\n print(years)\r\n break\r\n else:\r\n limak *= 3\r\n bob *= 2\r\n years += 1", "user_input = input()\r\nuser_input=user_input.split()\r\nx= int( user_input[0])\r\ny= int( user_input[1])\r\n# print(x,\" \",y)\r\ncount=0\r\nwhile x<=y:\r\n x*=3\r\n y*=2\r\n count+=1\r\nprint(count)", "x = input()\r\nc = x.split()\r\nl = int(c[0])\r\nb = int(c[1])\r\ni = 0\r\nwhile l <= b:\r\n l *= 3\r\n b *= 2\r\n i += 1\r\nprint(i)\r\n", "inp = input().split()\nl, b = int(inp[0]), int(inp[1])\nt = 0\nwhile l <= b:\n l = 3*l; b = 2*b\n t +=1\nprint(t)\n", "a,b=list(map(int,input().strip().split()))\ncount=0\nwhile True :\n if a<=b:\n a *= 3\n b *= 2\n count += 1\n else:\n break\n\n\nprint(count)", "a, b = map(int, input().split())\r\n# a is weight of limak b is the weight of Boba\r\n# n is amount of years after which a will be bigger than b\r\nyears = 0\r\nweight_limak = a\r\nweight_boba = b\r\nwhile weight_limak <= weight_boba:\r\n weight_limak = weight_limak*3\r\n weight_boba= weight_boba*2\r\n years= years+1\r\nprint(years)", "a, b = map(int, input().split())\r\n\r\ni = 0\r\n\r\nwhile(True):\r\n a*=3\r\n b*=2\r\n i+=1\r\n if a>b:break\r\n\r\nprint(i)", "total = 0 \r\nx = list(map(int, input().split()))\r\nwhile x[0] <= x[1]:\r\n x[0] *= 3\r\n x[1] *= 2\r\n total += 1\r\nprint(total)", "def solve(n, m):\r\n count = 0\r\n while n <= m:\r\n count += 1\r\n n *= 3\r\n m *= 2\r\n return count\r\n\r\n\r\n\r\ndef main():\r\n # Reading multiple test cases\r\n n, m = map(int, input().split())\r\n print(solve(n, m))\r\n\r\nif __name__ == \"__main__\":\r\n main()", "inpt = input().split()\r\nlimak = int(inpt[0])\r\nbob = int(inpt[1])\r\nyears = 0\r\n\r\nwhile bob >= limak:\r\n years += 1\r\n limak *= 3\r\n bob *= 2\r\n\r\nprint(years)", "l,b=map(int,input().split())\r\ni=0\r\nwhile(l<=b):\r\n l*=3\r\n b*=2\r\n i+=1\r\nprint(i)", "a, b = input().split()\r\na, b = int(a), int(b)\r\ncount=0\r\nwhile True:\r\n a=a*3\r\n b=b*2\r\n count=count+1\r\n if a>b:\r\n print(count)\r\n break\r\n", "n,k = map(int, input().split(' '))\r\nyears = 0\r\nwhile n <=k :\r\n n = n * 3\r\n k = k * 2\r\n years += 1\r\nprint(years)\r\n ", "def new_func():\r\n weight_brothers = input().split()\r\n weight_brother1 = int(weight_brothers[0])\r\n weight_brother2 = int(weight_brothers[1])\r\n count = 0\r\n while weight_brother1 <= weight_brother2:\r\n weight_brother1 = 3*(weight_brother1)\r\n weight_brother2 = 2*(weight_brother2)\r\n count += 1\r\n print(count)\r\n\r\nnew_func()", "w = input()\r\n\r\nfb , sb = map(int , w.split())\r\n\r\ny = 0\r\n\r\nwhile fb <= sb :\r\n\r\n fb *= 3\r\n sb *= 2\r\n y += 1\r\n\r\nprint(y)", "a,b = map(int,input().split())\r\nc = 0\r\nwhile a <= b:\r\n a = a*3; b = b*2\r\n c+=1\r\nprint(c)\r\n", "a = list(map(int,input().split()))\r\nb = a[1]\r\na = a[0]\r\ns = 0\r\nfor i in range(20):\r\n\ta = a*3\r\n\tb = b*2\r\n\ts += 1\r\n\tif a>b:\r\n\t\tprint(s)\r\n\t\tbreak\r\n\telse:\r\n\t\tcontinue\r\n", "m,n = map(int,input().split())\r\n\r\nt = 0\r\nwhile m <= n:\r\n t+=1\r\n m = m*3\r\n n = n*2\r\n \r\nprint(t)", "# codeforces problem - 791A\r\n# Bear and Big Brother\r\na,b=map(int,input().split())\r\ni=0\r\nif(1<=a<=b):\r\n# increase weight of limak(a) thrice and bob(b) twice untill a becomes > b\r\n while a<=b:\r\n a=a*3\r\n b=b*2\r\n i=i+1\r\n print(i)", "a,b=[int(i) for i in input().split()]\r\nans=0\r\nwhile a<=b:\r\n a=3*a\r\n b=2*b\r\n ans+=1\r\nprint(ans)\r\n", "limak,bob = map(int,input().split())\r\nc = 0\r\np = 1\r\nwhile(p == 1):\r\n if(limak <= bob):\r\n c = c+1 \r\n else:\r\n p = 0\r\n limak = limak*3;\r\n bob = bob*2\r\nprint(c)\r\n\r\n", "a, b = list(map(int, input().split()))\r\ncount = 0\r\nwhile b >= a:\r\n b *= 2\r\n a *= 3\r\n count += 1\r\nprint(count)\r\n", "n , m = map(int, input().split())\r\nyears=0\r\nwhile n<=m:\r\n years+=1\r\n n *= 3\r\n m *=2\r\nprint(years)", "a,b = map(int, input().split())\r\ni = 0\r\ng = 0\r\nwhile g<1:\r\n i=i+1\r\n a = a*3\r\n b = b*2\r\n if a>b:\r\n print(i)\r\n break\r\n", "a, b = map(int, input().split(' '))\r\n\r\njaar = 0\r\n\r\nwhile True:\r\n jaar=jaar+1\r\n if (a*3**jaar) > (b*2**jaar):\r\n print(jaar)\r\n break", "a,b=map(int,input().split())\r\nc=0\r\nwhile a<=b:\r\n c+=1\r\n a*=3\r\n b*=2\r\nprint(c)\r\n ", "a,b = map(int,input().split())\nc = 0\nwhile a<=b:\n a *= 3\n b *= 2\n c += 1\nprint(c)", "l, b=input().split()\nl = int(l)\nb = int(b)\n\n\nyears = 0\n\nwhile l <= b :\n l = l*3\n b = b*2\n years = years + 1\n\nprint(years)\n \t \t \t \t \t\t \t \t\t\t \t\t\t \t\t", "li=input().split(' ');a=int(li[0]);b = int(li[1]);n=0\r\nwhile a<=b:a=a*3; b=b*2;n+=1\r\nprint(n)", "a, b = [float(x) for x in input().split()]\r\n\r\n\r\ndef solver(a,b,t):\r\n if (a*3**t - b*2**t> 0):\r\n return t\r\n else:\r\n return solver(a,b,t+1)\r\n\r\nprint(solver(a,b,0))", "\r\nx =input().split(\" \")\r\na=int(x[0])\r\nb=int(x[1])\r\nvalue=0\r\nfor i in range(1,10):\r\n a=a*3*i\r\n b=b*2*i\r\n if a > b:\r\n value=i\r\n break\r\nprint(value)\r\n\r\n\r\n\r\n\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Sep 10 12:06:02 2023\r\n\r\n@author: He'Bing'Ru\r\n\"\"\"\r\n\r\nw = input().split()\r\na = int(w[0])\r\nb = int(w[1])\r\ny = 0\r\nwhile a<=b :\r\n a = a*3\r\n b = b*2\r\n y += 1\r\nprint(y)", "a,b = input().split()\r\na = int (a)\r\nb = int (b)\r\ni = 0\r\nwhile i>=0 :\r\n a*=3\r\n b*=2\r\n i+=1\r\n if (a>b):\r\n break\r\nprint (i)", "x,y=input().split()\r\nn=1\r\nwhile int(x)<=int(y):\r\n x=3*int(x)\r\n y=2*int(y)\r\n if int(x)>int(y):\r\n print(int(n))\r\n else: n=n+1\r\n\r\n", "a,b=[int(i) for i in input().split(\" \")]\r\nfor i in range(100):\r\n if(a>b):\r\n print(i)\r\n break\r\n a,b=a*3,b*2\r\n", "a,b=map(int,input().split())\r\nk=0\r\nwhile (a<=b):\r\n a=a*3\r\n b=b*2\r\n k+=1\r\nprint(k)", "l,b=input().split()\nl=int(l)\nb=int(b)\nyears=0\nwhile l <=b:\n l=l*3\n b=b*2\n years=years+1\nprint(years)\n\n\t \t\t\t\t \t\t\t \t \t \t", "a,b =map(int, input().split())\r\n\r\nfor i in range(15):\r\n if(a>b):\r\n print(i)\r\n break\r\n else :\r\n a=a*3\r\n b=b*2\r\n", "x,y=map(int,input().split())\r\ncount=0\r\nwhile x<=y:\r\n x=x*3\r\n y=y*2\r\n count+=1\r\nprint(count)\r\n \r\n\r\n", "#791A: bear and big brother\r\nx=input().split()\r\na=int(x[0])\r\nb=int(x[1])\r\ni=0\r\nwhile(True):\r\n i+=1\r\n a=a*3\r\n b=b*2\r\n if a>b:\r\n break\r\nprint(i)", "a,b=map(int,input().split())\r\ncount_years=0\r\nwhile(a<=b):\r\n a=a*3\r\n b=b*2\r\n count_years+=1\r\nprint(count_years)", "l, b = map(int, input().split(\" \"))\r\ni = 0\r\nwhile l <= b:\r\n l = l * 3\r\n b = b * 2\r\n i += 1\r\n\r\nprint(i)", "n = input().split()\r\nn1 = [int(a) for a in n]\r\nlim = n1[0]\r\nbob = n1[1]\r\n\r\nyear = 0\r\n\r\nwhile lim <= bob:\r\n\tlim = 3 * lim\r\n\tbob = 2 * bob\r\n\tyear = year + 1\r\n\r\nprint(year)", "c=input()\r\nd=c.split()\r\na=int(d[0])\r\nb=int(d[-1])\r\ncount=0\r\nwhile True:\r\n a*=3\r\n b*=2\r\n count+=1\r\n if a>b:\r\n break\r\nprint(count)", "x = list(map(int, input().split()))\r\na = x[0]\r\nb = x[1]\r\n\r\nyear =0 \r\nwhile a <= b:\r\n a = a*3\r\n b = b*2\r\n\r\n year += 1\r\nprint(year) " ]

[ "P, A, S, M, D = 1, 2, 4, 8, 16\r\nADD = A | S\r\nANY = A | S | M | D\r\nOP_BIT = {\"+\": A, \"-\": S, \"*\": M, \"/\": D, \")\": 0}\r\nUNSAFE_BEFORE = {P: 0, A: 0, S: ADD, M: ADD, D: ANY}\r\nUNSAFE_AFTER = {P: 0, A: 0, S: 0, M: ADD, D: ADD}\r\nmacro = dict()\r\ndef expr(chars,\r\n pseudo=P,\r\n expand=macro.get,\r\n op_bit=OP_BIT,\r\n unsafe_before=UNSAFE_BEFORE,\r\n unsafe_after=UNSAFE_AFTER):\r\n paren = []\r\n push = paren.append\r\n pop = paren.pop\r\n name = []\r\n keep = name.append\r\n forget = name.clear\r\n last_op = retval = naked = pseudo\r\n def safe():\r\n nonlocal naked\r\n naked = expand(\"\".join(name), pseudo)\r\n forget()\r\n if naked <= pseudo:\r\n return naked\r\n return not (unsafe_before[last_op] & naked)\r\n for c in chars:\r\n if c == \"(\":\r\n push(last_op)\r\n last_op = pseudo\r\n elif c not in op_bit:\r\n keep(c)\r\n elif not safe():\r\n return 0\r\n elif c == \")\":\r\n last_op = pop()\r\n else:\r\n last_op = op_bit[c]\r\n if unsafe_after[last_op] & naked:\r\n return 0\r\n if not paren:\r\n retval |= last_op\r\n if name and not safe():\r\n return 0\r\n return retval\r\ndef main():\r\n global macro\r\n def chars(b, t):\r\n for k in range(b, len(t)):\r\n yield from t[k]\r\n for _ in range(int(input())):\r\n token = input().split()\r\n s = token[0] == \"#\"\r\n macro[token[1 + s]] = expr(chars(2 + s, token))\r\n print(\"OK\" if expr((c for c in input() if c != \" \")) else \"Suspicious\")\r\nif __name__ == '__main__':\r\n main()\r\n", "class Macro:\r\n def __init__(self, level):\r\n self.level = level\r\n\r\n def __add__(self, other):\r\n return Macro('+0'[self.level == '0' or other.level == '0'])\r\n\r\n def __sub__(self, other):\r\n return Macro('+0'[self.level == '0' or other.level in '0+'])\r\n\r\n def __mul__(self, other):\r\n return Macro('*0'[self.level in '0+' or other.level in '0+'])\r\n\r\n def __truediv__(self, other): # Changed __div__ to __truediv__ in Python 3\r\n return Macro('*0'[self.level in '0+' or other.level in '0+*'])\r\n\r\ndef mkmacro(c):\r\n return 'Macro(\"' + c + '\")'\r\n\r\ndef calc(s):\r\n f, n = [''], ''\r\n for c in ''.join(s):\r\n if c in '+-*/()':\r\n if n != '':\r\n f[-1] += mkmacro(v.get(n, '1'))\r\n n = ''\r\n if c == '(':\r\n f.append('')\r\n elif c == ')':\r\n m = mkmacro('10'[eval(f.pop()).level == '0'])\r\n f[-1] += m\r\n else:\r\n f[-1] += c\r\n else:\r\n n += c\r\n if n != '':\r\n f[0] += mkmacro(v.get(n, '1'))\r\n return eval(f[0]).level\r\n\r\nv = {}\r\nfor _ in range(int(input())): # Changed xrange to range in Python 3\r\n s = input().split()\r\n if s[0] == '#':\r\n s.pop(0)\r\n v[s[1]] = calc(s[2:])\r\n\r\nresult = calc(input().split())\r\nprint('Suspicious' if result == '0' else 'OK')\r\n" ]

[ "n = int(input())\r\nnums = list(map(int, input().split()))\r\nnote_nums = sorted([(val, idx) for idx, val in enumerate(nums)])\r\ntmp = [0] * n\r\nfor i in range(n):\r\n tmp[note_nums[i][1]] = i\r\nans = [0] * (n + 1)\r\nfor val in tmp:\r\n ans[val + 1] = ans[val] + 1\r\nprint(n - max(ans))", "n = int(input())\r\na = input().split()\r\npos = {}\r\nans = {}\r\nnum = 0\r\nfor i in range(n):\r\n a[i] = int(a[i])\r\n pos.setdefault(a[i], num)\r\n num += 1\r\n ans.setdefault(a[i], 1)\r\nnum = 0\r\nfor i in reversed(a):\r\n if i == n:\r\n continue\r\n if pos[i + 1] > pos[i]:\r\n ans[i] += ans[i + 1]\r\nprint(n - max(ans.values()))", "n = int(input())\nv = [int(i) for i in input().split()]\n\nf = [0] * (n+1)\n\nfor i in range(n):\n f[v[i]] = f[v[i]-1] + 1\n\n# print(f)\nprint(n - max(f))\n", "n=int(input())\r\nf={}\r\nans=0\r\np=list(map(int,input().split()))\r\nfor i in p:\r\n if f.__contains__(i-1):\r\n f[i]=f[i-1]+1\r\n else:\r\n f[i]=1\r\n if f[i]>ans:\r\n ans=f[i]\r\nprint(n-ans)", "import sys\r\n\r\nif __name__ == '__main__':\r\n n = eval(input())\r\n p = list(map(int, sys.stdin.readline().rstrip().split()))\r\n cnt = [0] * (n + 1)\r\n # 贪心算法，找到序列中最长的升序子序列（只差1），那么只需要将这之外的数字移动即可\r\n for i in p:\r\n cnt[i] = cnt[i - 1] + 1\r\n print(n - max(cnt))", "n=int(input())\r\nl=[n]*(n+1)\r\nfor c in map(int,input().split()):l[c]=l[c-1]-1\r\nprint(min(l))", "def sticks(lst):\r\n v=[0]*(len(lst)+5)\r\n tmp=0\r\n for i in range(len(lst)):\r\n v[lst[i]]=1+v[lst[i]-1]\r\n tmp=max(tmp,v[lst[i]])\r\n return len(lst)-tmp\r\n\r\n\r\nn=input()\r\nlst=list(map(int,input().split()))\r\nprint(sticks(lst))\r\n", "n = int(input())\r\nseq = list(map(int, input().split()))\r\n\r\ndp = [0 for i in range(n+1)]\r\ndp[seq[0]] = 1\r\n\r\nfor i in range(1, len(seq)):\r\n if dp[seq[i]-1] > 0:\r\n dp[seq[i]] = dp[seq[i]-1] + 1\r\n else:\r\n dp[seq[i]] = 1\r\n\r\n\r\nprint(n - max(dp))", "import sys,os,io\r\nfrom sys import stdin\r\nfrom collections import defaultdict\r\nfrom bisect import bisect_left , bisect_right\r\ndef ii():\r\n return int(input())\r\ndef li():\r\n return list(map(int,input().split()))\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 input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\nn = ii()\r\nl = li()\r\nd =defaultdict(lambda:-1)\r\nm = [0]*(n+1)\r\nfor i in range(n):\r\n m[l[i]]=1\r\n if d[l[i]-1]!=-1 and d[l[i]-1]<i:\r\n m[l[i]]+=m[l[i]-1]\r\n d[l[i]]=i \r\n# print(m)\r\n# print(d)\r\nprint(n-max(m))", "import sys\nimport math\n\nn = int(sys.stdin.readline().strip())\na = list(map(int, sys.stdin.readline().strip().split(' ')))\n\nmaxsf = 1\nidxs = {ai:i+1 for i,ai in enumerate(a)}\ni = 1\nwhile i <= n:\n acc = 1\n while i < n and idxs[i+1] > idxs[i]:\n acc += 1\n maxsf = max(maxsf, acc)\n i += 1\n i += 1\nprint(n-maxsf)", "n = int(input())\r\nlis = [0]*(n+1)\r\nres = 0\r\nfor s in input().split(' '):\r\n lis[int(s)] = lis[int(s)-1]+1\r\n res = max(res, lis[int(s)])\r\nprint(n-res)\r\n", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\nimport time\n\n\nn = int(input())\np = [int(i) for i in input().split()]\nd = {}\n\nstart = time.time()\n\nfor i in range(n):\n d[p[i]] = i\n\nl = 0\ni = 2\n\nwhile(i <= n):\n j = 0\n while (i <=n and d[i] > d[i-1]):\n i += 1\n j += 1\n\n if j > l:\n l = j\n i += 1\n\nprint(n-l-1)\nfinish = time.time()\n#print(finish - start)\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nlis = [0] * (n+1)\r\nres = 0\r\nfor i in a:\r\n lis[i] = lis[i-1] + 1\r\n res = max(res, lis[i])\r\nprint(n - res)\r\n", "n, arr = int(input()), list(map(int, input().split()));\r\na = [0]*(max(arr)+5)\r\nfor i in arr: a[i] = a[i-1]+1\r\nprint(n-max(a))", "n = int(input())\nl1 = list(map(int, input().split()))\nl2 = [-1] * n\n\nif n <= 1:\n print(0)\n exit()\n\nfor i in range(n):\n l2[l1[i] - 1] = i\n\n# print(l1)\n# print(l2)\n\nans = 0\ncur = 1\nfor i in range(1, n):\n if l2[i] > l2[i-1]:\n cur += 1\n else:\n cur = 1\n ans = max(ans, cur)\nprint(n - ans)\n\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\nlong_from = {}\r\nbest = 1\r\nfor x in a:\r\n if x-1 in long_from:\r\n long_from[x] = long_from[x-1] + 1\r\n else:\r\n long_from[x] = 1\r\nprint(n - max(long_from.values()))", "if __name__ == '__main__':\n n = int(input())\n nums = map(int, input().split())\n res = 0\n dic = dict()\n for num in nums:\n if (num - 1) in dic:\n dic[num] = dic.get((num - 1), 0)\n dic.pop((num - 1))\n else:\n dic[num] = num\n\n for key in dic.keys():\n res = max(res, key - dic.get(key))\n\n print(n - res - 1)\n\n \t \t \t\t \t \t \t\t\t \t \t", "n=int(input())\r\ndp={}\r\nans=0\r\na=list(map(int,input().split()))\r\nfor i in a:\r\n if dp.__contains__(i-1):\r\n dp[i]=dp[i-1]+1\r\n else:\r\n dp[i]=1\r\n if dp[i]>ans:\r\n ans=dp[i]\r\nprint(n-ans)", "n=int(input())\r\na=[int(v) for v in input().split()]\r\np=[0]*(n+1)\r\nfor j in range(n):\r\n p[a[j]]=j+1\r\nc=1\r\nt=1\r\nfor j in range(2,n+1):\r\n if p[j]<p[j-1]:\r\n c=max(c,t)\r\n t=1\r\n else:\r\n t=t+1\r\nc=max(c,t)\r\nprint(n-c)", "n=int(input())\na=list(map(int,input().split()))\n\nmp=[0]*(n+1)\n\nfor i in range(n):\n mp[a[i]]=i+1\n\ncnt=0;mx=1\nfor i in range(1,n):\n if mp[i]<mp[i+1]:\n cnt+=1\n\n else:\n mx=max(mx,cnt+1)\n cnt=0\n\nmx=max(mx,cnt+1)\nprint(n-mx)", "n = int(input())\r\na = list(map(int, input().split()))\r\nmp = {}\r\ndp = [0] * n\r\nmaximum = float('-inf')\r\n\r\nfor i in range(n):\r\n if a[i] - 1 in mp:\r\n last_index = mp[a[i] - 1] - 1\r\n dp[i] = 1 + dp[last_index]\r\n else:\r\n dp[i] = 1\r\n mp[a[i]] = i + 1\r\n maximum = max(maximum, dp[i])\r\n\r\nprint(n - maximum)\r\n", "from sys import stdin\r\ninput=stdin.readline\r\nn=int(input())\r\np=list(map(int,input().split()))\r\nidx=[0]*(n+1)\r\nfor i in range(n):\r\n idx[p[i]]=i\r\ncnt=1\r\nans=10**18\r\nfor i in range(1,n):\r\n if idx[i]<idx[i+1]:\r\n cnt+=1\r\n else:\r\n ans=min(ans,n-cnt)\r\n cnt=1\r\nans=min(ans,n-cnt)\r\nprint(ans)", "n = int(input())\narr = map(int,input().split())\nt = [0]*(n+1)\nmt = 1\nfor i in arr:\n if t[i-1]!=0:\n t[i] = t[i-1]+1\n mt = max(mt,t[i])\n else:\n t[i] = 1\nprint(n-mt)\n\t \t \t \t \t\t\t \t \t\t\t \t \t \t\t\t", "n = int(input())\r\nps = list(map(int, input().split()))\r\n\r\npos = [0] * n\r\nfor i, p in enumerate(ps):\r\n pos[p-1] = i\r\n\r\nused = [False] * n\r\n\r\nlongest = 0\r\nfor v in range(n):\r\n if used[v]:\r\n continue\r\n i = pos[v]\r\n w = v\r\n used[w] = True\r\n while w < n - 1 and pos[w + 1] > i:\r\n i = pos[w + 1]\r\n w += 1\r\n used[w] = True\r\n longest = max(longest, w - v + 1)\r\nprint(n - longest)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\np = list(map(int, input().split()))\r\ndp = [-1]*n\r\n\r\nfor pi in p:\r\n pi -= 1\r\n \r\n if pi==0:\r\n dp[pi] = 1\r\n else:\r\n if dp[pi-1]!=-1:\r\n dp[pi] = dp[pi-1]+1\r\n else:\r\n dp[pi] = 1\r\n\r\nans = min(n-dp[i] for i in range(n))\r\n\r\nprint(ans)", "from sys import stdin\r\ninput = lambda: stdin.readline()[:-1]\r\ninp = lambda: list(map(int, input().split()))\r\n\r\nn = int(input())\r\na = inp()\r\ndp = [0] * (n + 1)\r\nret = 0\r\nfor x in range(n):\r\n dp[a[x]] = 1 + dp[a[x] - 1]\r\n ret = max(ret, dp[a[x]])\r\nprint(n - ret)\r\n\r\n", "n, p = int(input()), list(map(int, input().split()))\r\na, c, v = [0] * n, 1, 1\r\nfor i, pi in enumerate(p):\r\n a[pi - 1] = i\r\nfor i in range(n - 1):\r\n if a[i] < a[i + 1]:\r\n c += 1\r\n if c > v:\r\n v = c\r\n else:\r\n c = 1\r\nprint(n - v)", "n = int(input())\na = list(map(int, input().split()))\nr = [0] + [0] * n\nfor i in range(n):\n r[a[i]] = i + 1\n \ncount = 1\nmaxcount = 1\nfor i in range(2, n + 1):\n if r[i] > r[i - 1]:\n count += 1\n else:\n if count > maxcount:\n maxcount = count\n count = 1\nif count > maxcount:\n maxcount = count\nprint(n - maxcount)\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nar = set( )\r\nd = [1] * (n + 1)\r\nfor i in a:\r\n if i in ar:\r\n d[i] = max(d[i], d[i-1] + 1)\r\n ar.add(i + 1)\r\n #print(*ar)\r\nans = n - max(d)\r\nprint(ans)", "n = int(input())\np = list(map(int, input().split()))\n\ndp = [0] * (n + 1)\nfor x in p:\n dp[x] = 1 + dp[x - 1]\n\nres = n - max(dp)\nprint(res)\n", "n = int(input())\r\nL = input().split()\r\nIDX = (n + 2) * [0]\r\n\r\ndef max(a, b):\r\n if a > b:\r\n return a\r\n return b\r\n\r\nmx, act, last = 0, 0, 0\r\n\r\nfor i in range(n):\r\n IDX[int(L[i])] = i + 1\r\n\r\nfor i in range(1, n + 1):\r\n if IDX[i] > last:\r\n last = IDX[i]\r\n act += 1\r\n else:\r\n last = IDX[i]\r\n act = 1\r\n mx = max(mx, act)\r\n\r\n\r\nprint(n - mx)\r\n", "n = int(input())\r\nArr = [int(i) for i in input().split()]\r\n\r\nL = [0] * (n + 1)\r\nans = 0\r\nfor i in range(n):\r\n\tif L[Arr[i] - 1] == 0:\r\n\t\tL[Arr[i]] = 1\r\n\telse:\r\n\t\tL[Arr[i]] = 1 + L[Arr[i] - 1]\r\n\tans = max(ans, L[Arr[i]])\r\n\r\nprint(n - ans)", "n=int(input())\r\nnotfair=[0]*(n+1)\r\nl=list(map(int,input().split()))\r\nfor i in l:\r\n notfair[i]=notfair[i-1]+1\r\nans=max(notfair)\r\nprint(n-ans)\r\n#no problem", "n = int(input())\r\nu = list(map(int,input().split()))\r\nl = [0] * (n+2)\r\nfor i in range(n):\r\n l[u[i]] = i+1\r\nr = 0\r\na = 0\r\nfor i in range(1,n+1):\r\n r += 1\r\n if l[i] > l[i+1]:\r\n a = max(a, r)\r\n r = 0\r\nprint(n-a)\r\n", "n=int(input())\r\narr=[int(x) for x in input().split()]\r\n#l=[0 for i in range(n)]\r\n#mini=arr[0]\r\nd={}\r\nfor i in range(n):\r\n if arr[i]-1 in d:\r\n d[arr[i]]=d[arr[i]-1]+1\r\n else:\r\n d[arr[i]]=1\r\nprint(n-max(d.values()))\r\n \r\n ", "n = int(input())\narr = map(int,input().split())\nt = [0]*(n+1)\nfor i in arr:\n if t[i-1]!=0:\n t[i] = t[i-1]+1\n else:\n t[i] = 1\nprint(n-max(t))\n\t \t\t\t \t\t\t\t \t \t \t\t\t\t\t\t\t", "q=int(input())\r\nw=list(map(int,input().split()))\r\ne=[0]*(q+1)\r\nr=1\r\nl=0\r\nfor i in range(q):\r\n\te[w[i]]=i\r\nfor i in range(2,q+1):\r\n\tif e[i]>e[i-1]:\r\n\t\tr+=1\r\n\telse:\r\n\t\tr=1\r\n\tl=max(r,l)\r\nif q==1:\r\n\tprint(0)\r\nelse:\r\n\tprint(q-l)", "n=int(input())\r\np=[int(i) for i in input().split()]\r\nstore=[0]*(n+1)\r\nfor i in range(len(p)):\r\n store[p[i]]=(i+1)\r\nstore=store[1:]\r\n#print(store)\r\nmax_,cnt=0,1\r\nfor i in range(1,len(store)):\r\n if store[i]>store[i-1]:\r\n cnt+=1\r\n \r\n else:\r\n cnt=1\r\n max_=max(max_,cnt)\r\n #print(max_,cnt)\r\nif n==1:\r\n print(0)\r\nelse:\r\n print(n-max_)\r\n\r\n\r\n\r\n\r\n \r\n \r\n\r\n \r\n \r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nfrom collections import defaultdict\r\n\r\nN = int(input())\r\nA = list(map(int, input().split()))\r\n\r\ndp = defaultdict(int)\r\nfor a in A:\r\n dp[a] = max(dp[a], dp[a-1]+1)\r\n \r\nprint(N-max(dp.values()))\r\n\r\n\r\n\r\n\r\n", "def main():\r\n n = int(input())\r\n a = map(int, input().split())\r\n print(solve(n, a))\r\n\r\n\r\ndef solve(n, a):\r\n v2i = [0]*(n+1)\r\n for index, i in enumerate(a):\r\n v2i[i] = index\r\n q = []\r\n res = 0\r\n for i in range(n, 0, -1):\r\n if not q or q[-1]>v2i[i]:\r\n q.append(v2i[i])\r\n else:\r\n q = [v2i[i]]\r\n res = max(res, len(q))\r\n return n - res\r\n\r\n\r\nmain()", "n=int(input())\nlst = [0 for i in range(n)]\nkereta = input().split()\nfor i in range(n):\n\tlst[int(kereta[i])-1]=i\nancol=1\nterbanyak=0\nfor i in range(n-1):\n\tif lst[i]>lst[i+1]:\n\t\tif terbanyak<ancol:terbanyak=ancol\n\t\tancol=0\n\tancol+=1\nif terbanyak<ancol:terbanyak=ancol\nprint(n-terbanyak)\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\narr=list(map(int,input().split()))\r\nl=[0]*(n+1)\r\nfor c in arr:\r\n l[c]=l[c-1]+1\r\nprint(n - max(l))\r\n", "# from bisect import bisect_left,bisect_righ\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\nseen={}\r\nans=0\r\nfor el in arr:\r\n if el-1 in seen:\r\n seen[el]=seen[el-1]+1\r\n else:\r\n seen[el]=1\r\n ans=max(ans,seen[el])\r\nprint(n-ans)", "n = int(input())\r\n\r\np = list(map(int, input().split()))\r\na = [0] * (n+1)\r\nfor i in range(n):\r\n a[p[i]] = a[p[i]-1] + 1\r\nprint(n - max(a))", "from sys import stdin\r\n\r\ninput = lambda: stdin.buffer.readline().decode().strip()\r\nn, a = int(input()), [int(x) for x in input().split()]\r\nixs, ma, be = [0] * (n + 1), 1, 1\r\nfor i in range(n):\r\n ixs[a[i]] = i\r\n\r\nfor i in range(2, n + 1):\r\n if ixs[i] < ixs[i - 1]:\r\n be = i\r\n ma = max(ma, i - be + 1)\r\nprint(n-ma)", "n = int(input())\nl = list(map(int,input().split()))\nidx = [None]*(n+1)\nfor i,x in enumerate(l):\n idx[x] = i\nmaxi = 1\ng = 1\nfor i in range(1,n):\n if idx[i] < idx[i+1]:\n g += 1\n if g > maxi:\n maxi = g\n else:\n g = 1\nprint(n - maxi)\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\np = list(map(int, input().split()))\r\nd = {}\r\nfor i in p:\r\n d[i] = d.get(i-1, 0) + 1\r\nprint(n-(max(d.values())))", "readInts=lambda: list(map(int, input().split()))\r\nn=int(input())\r\na=readInts()\r\np=[0]*n\r\nfor i in range(n):\r\n p[a[i]-1]=i\r\ninc=1;ret=n-1\r\n#print(p)\r\nfor i in range(1,n):\r\n if p[i]>p[i-1]:\r\n inc+=1\r\n else:\r\n inc=1\r\n ret=min(ret,n-inc)\r\nprint(ret)\r\n", "__author__ = 'MoonBall'\r\n\r\nimport sys\r\n# sys.stdin = open('data/C.in', 'r')\r\nT = 1\r\n\r\ndef process():\r\n # 2 4 3 1 -> 2 3 1 4 -> 1 2 3 4\r\n # 大的往后移，小的往后移\r\n # 1 4 3 2 -> 1 4 2 3 -> 1 2 3 4\r\n # 最大的连续数\r\n\r\n N = int(input())\r\n a = list(map(int, input().split()))\r\n d = [0] * (N + 1)\r\n\r\n for _a in a:\r\n d[_a] = d[_a - 1] + 1\r\n print(N - max(d))\r\n\r\n\r\n\r\n\r\n\r\nfor _ in range(T):\r\n process()\r\n", "n = int(input())\r\nnums = list(map(int, input().split()))\r\n\r\nref = dict()\r\nnew = sorted(nums)\r\nfor i in range(1, n):\r\n ref[new[i]] = new[i-1]\r\n\r\nends, lens = set(), dict()\r\nans = 1\r\nfor i in nums:\r\n if i not in ref:\r\n ends.add(i)\r\n ref[i] = 1\r\n continue\r\n lst = ref[i]\r\n if lst in ends:\r\n ends.remove(lst)\r\n ref[i] = ref[lst]+1\r\n else:\r\n ref[i] = 1\r\n ends.add(i)\r\n ans = max(ref[i], ans)\r\nprint(n-ans)\r\n", "n = int(input())\np = list(map(int,input().split()))\n\nidx = [None]*(n+1)\nfor i,x in enumerate(p):\n idx[x] = i\n\nmaxi = 1\nl = 1\nfor i in range(1,n):\n if idx[i] < idx[i+1]:\n l += 1\n if l > maxi:\n maxi = l\n else:\n l = 1\n\nprint(n - maxi)\n\t \t\t \t \t \t\t\t \t\t \t \t", "def solve():\r\n n=int(input())\r\n arr=list(map(int,input().split()))\r\n indices = sorted(range(len(arr)),key=arr.__getitem__)\r\n largestSequenc = 1\r\n localSequence = 1\r\n for x in range(1,n):\r\n if indices[x]>indices[x-1]:\r\n localSequence +=1\r\n else:\r\n largestSequenc = max(largestSequenc,localSequence)\r\n localSequence =1\r\n largestSequenc = max(largestSequenc,localSequence)\r\n print (n-largestSequenc)\r\n\r\ntry:\r\n solve()\r\nexcept Exception as e:\r\n print (e)", "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\nN = int(input())\nA = list(map(int,input().split()))\ndic = {}\nfor i in range(N):\n dic[A[i]] = i\n\nans = 0\nl = [-float('inf')]\ncnt = 0\nfor i in range(1,N+1):\n if l[-1]<dic[i]:\n l.append(dic[i])\n cnt+=1\n else:\n ans = max(ans,cnt)\n cnt = 1\n l = [dic[i]]\nans = max(ans,cnt)\nprint(N-ans)\n", "n = int(input().strip())\np = [int(x) for x in input().split()]\n\nl = {}\nfor x in p:\n if x-1 in l:\n l[x] = l[x-1] + 1\n else:\n l[x] = 1\n\nprint(n - max(l.values()))\n", "n = int(input())\r\nai = list(map(int,input().split()))\r\nar = [0] * (n+1)\r\nans = 0\r\nnum = 0\r\nfor i in range(n):\r\n ar[ai[i]] = 1 + ar[ai[i] - 1] \r\nprint(n - max(ar))\r\n", "n = int(input())\r\nvagons = tuple(map(int, input().split()))\r\nres = [0] * (n)\r\nplaces = [0] * (n + 1)\r\nfor i in range(n):\r\n places[vagons[i]] = i\r\nfor i in range(n - 1, -1, -1):\r\n v = vagons[i]\r\n if v < n:\r\n res[i] = res[places[v + 1]] + 1\r\n else: res[i] = 1\r\n \r\nprint(n - max(res))", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\npos = [0] * (n + 1)\r\nfor i in range(n):\r\n pos[a[i]] = i\r\n\r\ncnt = 1\r\nans = 1\r\nfor i in range(2, n + 1):\r\n if pos[i] > pos[i - 1]:\r\n cnt += 1\r\n else:\r\n if cnt > ans:\r\n ans = cnt\r\n cnt = 1\r\n\r\nif cnt > ans:\r\n ans = cnt\r\nprint(n - ans)\r\n", "def lengthOfLIS(nums):\r\n d = {}\r\n for num in nums:\r\n if num-1 in d:\r\n d[num] = d[num-1] + 1\r\n else:\r\n d[num] = 1\r\n return max(d.values())\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nprint(n-lengthOfLIS(a))", "n=int(input())\nf={}\nans=0\np=list(map(int,input().split()))\nfor i in p:\n if f.__contains__(i-1): f[i]=f[i-1]+1\n else: f[i]=1\n if f[i]>ans: ans=f[i]\nprint(n-ans)", "n = int(input())\r\narr = map(int,input().split())\r\nli=[0]*(n+1)\r\nfor i in arr:\r\n li[i]=li[i-1]+1\r\nprint(n-max(li))", "__author__ = 'Utena'\r\nn=int(input())\r\nm=list(map(int,input().split()))\r\nt=0\r\nl=[0]\r\nr=[0]*(n+1)\r\nfor j in range(n):\r\n r[m[j]]=j+1\r\nif n==1:\r\n print(0)\r\nelse:\r\n for i in range(1,n):\r\n t+=1\r\n if r[i]>r[i+1]:\r\n l.append(t)\r\n t=0\r\n if r[n]>r[n-1]:\r\n t+=1\r\n l.append(t)\r\n print(n-max(l))", "n = int(input())\np = [0]*(n+1)\n\nlista = list(map(int, input().split()))\n\nfor i in lista:\n p[i] = p[i-1]+1\n \nx = max(p)\nprint(n - x)\n\t \t \t \t\t \t\t \t\t \t\t\t \t\t \t \t\t\t", "n = int(input())\r\nlist = [int(x) for x in input().split(\" \")]\r\n\r\nkey_position_dict = {x: i for i, x in enumerate(list)}\r\nlist = [key_position_dict[x] for x in range(1, n+1)]\r\n\r\nlen = 1\r\nmaxi = 1\r\nfor i in range(1, n):\r\n if list[i-1] < list[i]:\r\n len += 1\r\n else:\r\n len = 1\r\n maxi = max(len, maxi)\r\n\r\nprint(n - maxi)\r\n\r\n", "from math import *\r\nfrom collections import Counter,defaultdict\r\nfrom sys import stdin, stdout\r\ninput = stdin.readline\r\nI =lambda:int(input())\r\nM =lambda:map(int,input().split())\r\nLI=lambda:list(map(int,input().split()))\r\nfor _ in range(1):\r\n n=I()\r\n a=LI()\r\n b=[0]*n\r\n for i in range (n):\r\n b[a[i]-1]=i\r\n c,d=1,1\r\n for i in range(1,n):\r\n if b[i-1]<b[i]:\r\n c+=1\r\n else:\r\n c=1\r\n d=max(d,c) \r\n print(n-d)\r\n \r\n\r\n \r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n\r\n\r\n\r\n\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\nb = [0] * (n+1)\r\nres = 0\r\nfor i in a:\r\n b[i] = b[i-1] + 1\r\n res = max(res, b[i])\r\nprint(n - res)\r\n", "def LIS(s):\r\n n = len(s)\r\n L = [0]*n\r\n appear = [False]*n\r\n L[0] = 1\r\n find = [-1]*n\r\n appear[s[0]] = True\r\n find[s[0]] = 0\r\n for i in range(1,len(s)):\r\n if s[i]>0 and appear[s[i]-1]:\r\n L[i] = L[find[s[i]-1]] + 1\r\n else:\r\n L[i] = 1\r\n appear[s[i]] = True\r\n find[s[i]] = i\r\n return max(L)\r\ndef BIS(s):\r\n n = len(s)\r\n L = [0]*n\r\n appear = [False]*n\r\n L[n-1] = 1\r\n find = [-1]*n\r\n appear[s[n-1]] = True\r\n find[s[n-1]] = n-1\r\n for i in range(n-2,-1,-1):\r\n if s[i]+1 < n and appear[s[i]+1]:\r\n L[i] = L[find[s[i]-1]] + 1\r\n else:\r\n L[i] = 1\r\n appear[s[i]] = True\r\n find[s[i]] = i\r\n return max(L)\r\nn = int(input())\r\nL = list(map(int,input().split()))\r\nL = [x-1 for x in L]\r\nprint(n-max(LIS(L),BIS(L)))\r\n \r\n\r\n \r\n \r\n ", "n=int(input())\r\na = list(map(int,input().split()))\r\nd = [0] * (len(a)+1)\r\nq = [0]*(len(a)+1)\r\nm = 0\r\nl = -1\r\nfor i in range(len(a)):\r\n d[a[i]] = i\r\nfor i in range(len(a)):\r\n q[i] = 1\r\n if(a[i]!=1):\r\n q[i] = max(q[i], q[d[a[i]-1]]+1)\r\n m = max(m,q[i])\r\nprint(n-m)", "read = lambda: map(int, input().split())\r\nn = int(input())\r\np = list(read())\r\ncur = set()\r\nd = [1] * (n + 1)\r\nfor i in range(n):\r\n if p[i] in cur:\r\n cur.remove(p[i])\r\n d[p[i]] = max(d[p[i]], d[p[i] - 1] + 1)\r\n cur.add(p[i] + 1)\r\nans = n - max(d)\r\nprint(ans)", "def train(p):\n m = 0\n s = {}\n for pi in p:\n k = s.get(pi-1, 0) + 1\n s[pi] = k\n m = max(k, m)\n return len(p)-m\n\n\nif __name__ == '__main__':\n n = int(input())\n p = list(map(int, input().split()))\n print(train(p))\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\nfrom itertools import permutations as perm\r\nfrom functools import cmp_to_key\t# for adding custom comparator\r\nfrom fractions import Fraction\r\nfrom collections import *\r\nfrom sys import stdin\r\nfrom bisect import *\r\nfrom heapq import *\r\nfrom math import *\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\nmod = int(1e9)+7\r\ninf = float(\"inf\")\r\n\r\nn, = gil()\r\na = gil()\r\ndp = [1]*n\r\nans = 1\r\nidx = [-1]*(n+2)\r\n\r\nfor i in reversed(range(n)):\r\n\tv = a[i]\r\n\tidx[v] = i\r\n\tif idx[v+1] != -1:\r\n\t\tdp[i] += dp[idx[v+1]] \r\n\t\tans = max(ans, dp[i])\r\n\r\nprint(n-ans)", "def f(a):\n a=list(zip(a,range(len(a))))\n a.sort()\n\n mx=1\n cmx=1\n for i in range(1,len(a)):\n if a[i-1][1]<a[i][1]:\n cmx+=1\n mx=max(mx,cmx)\n else:\n cmx=1\n return len(a)-mx\n\nn=input()\na=[*map(int,input().strip().split())]\nprint(f(a))\n\n\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\na = [0] * (n + 1)\r\nk = 0\r\n\r\nfor x in l:\r\n a[x] = a[x - 1] + 1\r\n k = max(k, a[x]) \r\n\r\nprint(n - k)\r\n", "## KALAM\r\nN = 100000 + 77\r\nn = int(input())\r\na = list(map(int , input().split()))\r\nT = [0] * N\r\nA = 0\r\nfor i in a:\r\n T[i] = T[i - 1] + 1\r\n A = max(A , T[i])\r\nprint(n - A)\r\n\r\n", "n = int(input())\nseq = list(map(int, input().split(' ')))\na = [0] * (len(seq) + 1)\nresult = 1\na[seq[0]] = 1\nfor i in range(1, len(seq)):\n\tif a[seq[i]-1]:\n\t\ta[seq[i]] = a[seq[i]-1] + 1\n\t\tresult = max( result, a[seq[i]])\n\telse:\n\t\ta[seq[i]] = 1\nprint( len(seq)-result)", "def main():\n n = int(input())\n l = [n] * (n + 1)\n for a in map(int, input().split()):\n l[a] = l[a - 1] - 1\n print(min(l))\n\n\nif __name__ == '__main__':\n main()\n", "dl=int(input())\r\nvag=list(map(int,input().split()))\r\npl=[0]*(dl+1)\r\nfor i in range(dl):\r\n pl[vag[i]-1]=i\r\ndmax=0\r\nd=1\r\nfor i in range(1,dl):\r\n if pl[i]>pl[i-1]:\r\n d=d+1\r\n else:\r\n if d>dmax:\r\n dmax=d\r\n d=1\r\nif d>dmax:\r\n dmax=d\r\nprint(dl-dmax)\r\n", "def li(kkk,n): \r\n lis = [0]*(n+1)\r\n lis[0]=0\r\n for i in range (0 , n): \r\n lis[kkk[i]]=lis[kkk[i]-1]+1\r\n# print(lis) \r\n return max(lis)\r\nn = int(input())\r\nkkk= list(map(int,input().split()))\r\nans = li(kkk,n)\r\nprint(n-ans) ", "n=int(input())\r\nm=[0]*(n+1)\r\nl=list(map(int,input().split()))\r\nfor i in l:\r\n m[i]=m[i-1]+1\r\nprint(n-max(m))", "import sys\r\n\r\nif __name__ == '__main__':\r\n n = eval(input())\r\n p = list(map(int, sys.stdin.readline().rstrip().split()))\r\n dc = dict()\r\n for i in p:\r\n dc[i] = dc.get(i - 1, 0) + 1\r\n print(n - max(dc.values()))", "def answer(n,A):\r\n dp=[0]*(n+1)\r\n for i in range(0,n):\r\n dp[A[i]]=dp[A[i]-1]+1\r\n \r\n return n-max(dp)\r\n\r\n\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\nprint(answer(n,arr)) ", "n=int(input())\r\n\r\nl=list(map(int,input().split()))\r\nd={}\r\nma=0\r\nfor x in l :\r\n d[x]=d.get(x-1,0)+1\r\n ma=max(ma,d[x])\r\nprint(n-ma)\r\n \r\n\r\n", "from bisect import bisect_left\r\n\r\n\r\nn = int(input())\r\np = list(map(int, input().split()))\r\n\r\nf = [0]*100005\r\nfor x in p:\r\n f[x] = f[x-1]+1\r\nprint(n-max(f))" ]

[ "__author__ = 'Darren'\r\n\r\n\r\ndef solve():\r\n n, a, b = map(int, input().split())\r\n h = [0]\r\n h.extend(map(int, input().split()))\r\n\r\n fires = []\r\n count = h[1] // b + 1 if h[1] >= 0 else 0\r\n fires.extend([2 for i in range(count)])\r\n h[1] -= b * count\r\n h[2] -= a * count\r\n h[3] -= b * count\r\n count = h[n] // b + 1 if h[n] >= 0 else 0\r\n fires.extend([n-1 for i in range(count)])\r\n h[n] -= b * count\r\n h[n-1] -= a * count\r\n h[n-2] -= b * count\r\n\r\n temp = fires.copy()\r\n for i in range(2, n):\r\n count = h[i] // a + 1\r\n fires.extend([i for j in range(count)])\r\n\r\n def search(pos):\r\n nonlocal n, a, b, h, fires, temp\r\n if pos == n and h[pos-1] < 0:\r\n if len(fires) > len(temp):\r\n fires = temp.copy()\r\n return\r\n balls = 0\r\n count = h[pos-1] // b + 1 if h[pos-1] >= 0 else 0\r\n temp.extend([pos for i in range(count)])\r\n h[pos-1] -= b * count\r\n h[pos] -= a * count\r\n h[pos+1] -= b * count\r\n balls += count\r\n\r\n while h[pos] >= 0:\r\n search(pos+1)\r\n temp.append(pos)\r\n h[pos-1] -= b\r\n h[pos] -= a\r\n h[pos+1] -= b\r\n balls += 1\r\n search(pos+1)\r\n\r\n h[pos-1] += b * balls\r\n h[pos] += a * balls\r\n h[pos+1] += b * balls\r\n for i in range(balls):\r\n temp.pop()\r\n\r\n search(2)\r\n print(len(fires))\r\n print(' '.join(map(str, fires)))\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "import sys\r\n\r\nn, a, b = map(int, input().split())\r\nh = list(map(int, input().split()))\r\nt = h[-1] // b + 1\r\nh[-1] -= t * b\r\nh[-2] -= t * a\r\nh[-3] -= t * b\r\n\r\nres = [sys.maxsize, None]\r\n\r\nсount = [0] * n\r\n\r\n\r\ndef search(index, current):\r\n if index == n - 1:\r\n res[0] = current\r\n сount[n - 2] += t\r\n res[1] = сount[:]\r\n return\r\n x = (h[index - 1] // b + 1) if h[index - 1] >= 0 else 0\r\n while current + x < res[0]:\r\n h[index - 1] -= x * b\r\n h[index] -= x * a\r\n h[index + 1] -= x * b\r\n сount[index] = x\r\n search(index + 1, current + x)\r\n h[index - 1] += x * b\r\n h[index] += x * a\r\n h[index + 1] += x * b\r\n x += 1\r\n\r\n\r\nsearch(1, t)\r\n\r\nprint(res[0])\r\ns = []\r\nfor i in range(n):\r\n for j in range(res[1][i]):\r\n s.append(str(i + 1))\r\nprint(' '.join(s))\r\n", "import sys\nn,a,b=map(int,input().split())\n\nh=list(map(int,input().split()))\n\nt=h[-1] // b+1\nh[-1]-=t*b\nh[-2]-=t*a\nh[-3]-=t*b\n\nres=[sys.maxsize,None]\n\ncnt=[0]*n\n\ndef search(idx,cur):\n if idx==n-1:\n res[0]=cur\n cnt[n-2]+=t\n res[1]=cnt[:]\n return\n x=(h[idx-1]// b+1) if h[idx-1]>=0 else 0\n while cur+x<res[0]:\n h[idx-1]-=x*b\n h[idx]-=x*a\n h[idx+1]-=x*b\n cnt[idx]=x\n search(idx+1,cur+x)\n h[idx-1]+=x*b\n h[idx]+=x*a\n h[idx+1]+=x*b\n x+=1\n\nsearch(1,t)\n\nprint(res[0])\n\ns=[]\nfor i in range(n):\n for j in range(res[1][i]):\n s.append(str(i+1))\n \nprint(' '.join(s))\n \t\t \t\t \t \t \t\t \t\t\t\t", "n, a, b = map(int, input().split())\r\nf = list(map(int, input().split()))\r\nmn = 1<<64\r\nhit = None\r\n\r\ndef dfs(p, ans, hit2):\r\n global mn\r\n if ans>=mn:\r\n return\r\n if p == n - 1:\r\n if ans < mn:\r\n global hit\r\n hit = hit2.copy()\r\n mn = ans\r\n return\r\n if f[p-1] <0:\r\n dfs(p + 1, ans, hit2)\r\n t1 = 0\r\n if f[p-1] >= 0:\r\n t1 = f[p-1]//b+1\r\n f[p-1] -= b*t1\r\n f[p] -= a*t1\r\n f[p+1] -= b*t1\r\n for i in range(t1):\r\n hit2.append(p)\r\n dfs(p+1,ans+t1, hit2)\r\n f[p-1] += b*t1\r\n f[p] += a*t1\r\n f[p+1] += b*t1\r\n for i in range(t1):\r\n hit2.pop()\r\n t2 = f[p]//a+1\r\n if f[p]>=0 and t2>t1:\r\n for i in range(t1+1, t2+1):\r\n f[p-1] -= b*i\r\n f[p] -= a*i\r\n f[p+1] -= b*i\r\n for j in range(i):\r\n hit2.append(p)\r\n dfs(p+1, ans+i, hit2)\r\n f[p-1] += b*i\r\n f[p] += a*i\r\n f[p+1] += b*i\r\n for j in range(i):\r\n hit2.pop()\r\n return \r\nif __name__ == '__main__':\r\n hit2 = []\r\n a1 = f[0]//b + 1\r\n f[0] -= b*a1\r\n f[1] -= a*a1\r\n f[2] -= b*a1\r\n ret = a1\r\n for i in range(a1):\r\n hit2.append(1)\r\n if f[n-1]>=0:\r\n a1 = f[n-1]//b+1\r\n f[n-1] -= b*a1\r\n f[n-2] -= a*a1\r\n f[n-3] -= b*a1\r\n for i in range(a1):\r\n hit2.append(n-2)\r\n ret += a1\r\n dfs(1,0, hit2)\r\n mn += ret\r\n print (mn)\r\n for i in range(mn):\r\n print (hit[i]+1, end=' ')\r\n print(\"\")", "def dfs(step, left, mx):\r\n if step == 0:\r\n for i in range(0, n):\r\n if h[i] >= 0:\r\n return False\r\n return True\r\n else:\r\n if h[left - 1] < 0 and h[left] < 0 and left + 2 != n:\r\n if dfs(step, left + 1, mx):\r\n return True\r\n else:\r\n if left >= mx:\r\n h[left - 1] -= b\r\n h[left] -= a\r\n h[left + 1] -= b\r\n ans[step] = left\r\n if dfs(step - 1, left, left):\r\n return True\r\n h[left - 1] += b\r\n h[left] += a\r\n h[left + 1] += b\r\n if left + 1 >= mx and left + 1 < n - 1:\r\n h[left] -= b\r\n h[left + 1] -= a\r\n h[left + 2] -= b\r\n ans[step] = left + 1\r\n if dfs(step - 1, left, left + 1):\r\n return True\r\n h[left] += b\r\n h[left + 1] += a\r\n h[left + 2] += b\r\n\r\n return False\r\n\r\n\r\nn, a, b = input().split()\r\nn = int(n)\r\na = int(a)\r\nb = int(b)\r\nh = list(map(int, input().split()))\r\nans = list(range(0, 200))\r\n\r\nfor i in range(0, 200):\r\n if dfs(i, 1, 1):\r\n print(i)\r\n for j in range(1, i):\r\n print(ans[j] + 1, end=\" \")\r\n print(ans[i] + 1)\r\n break\r\n" ]

[ "class BIT():\r\n \"\"\"区間加算、一点取得クエリをそれぞれO(logN)で応えるデータ構造を構築する\r\n add: 区間[begin, end)にvalを加える\r\n get_val: i番目(0-indexed)の値を求める\r\n \"\"\"\r\n def __init__(self, n):\r\n self.n = n\r\n self.bit = [0] * (n + 1)\r\n\r\n def get_val(self, i):\r\n i = i + 1\r\n s = 0\r\n while i <= self.n:\r\n s += self.bit[i]\r\n i += i & -i\r\n return s\r\n\r\n def _add(self, i, val):\r\n while i > 0:\r\n self.bit[i] += val\r\n i -= i & -i\r\n\r\n def add(self, i, j, val):\r\n self._add(j, val)\r\n self._add(i, -val)\r\n\r\n\r\nfrom collections import deque\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef eular_tour(tree: list, root: int):\r\n n = len(tree)\r\n res = []\r\n begin = [-1] * n\r\n end = [-1] * n\r\n visited = [False] * n\r\n visited[root] = True\r\n q = deque([root])\r\n while q:\r\n pos = q.pop()\r\n res.append(pos)\r\n end[pos] = len(res)\r\n if begin[pos] == -1:\r\n begin[pos] = len(res) - 1\r\n for next_pos in tree[pos]:\r\n if visited[next_pos]:\r\n continue\r\n else:\r\n visited[next_pos] = True\r\n q.append(pos)\r\n q.append(next_pos)\r\n\r\n return res, begin, end\r\n\r\nn, q = map(int, input().split())\r\ninit_cost = list(map(int, input().split()))\r\ninfo = [list(map(int, input().split())) for i in range(n-1)]\r\nquery = [list(map(int, input().split())) for i in range(q)]\r\n\r\ntree = [[] for i in range(n)]\r\nfor i in range(n-1):\r\n a, b = info[i]\r\n a -= 1\r\n b -= 1\r\n tree[a].append(b)\r\n tree[b].append(a)\r\n\r\nres, begin, end = eular_tour(tree, 0)\r\neven_res = []\r\nodd_res = []\r\nfor i in range(len(res)):\r\n if i % 2 == 0:\r\n even_res.append(res[i])\r\n else:\r\n odd_res.append(res[i])\r\n\r\neven_bit = BIT(len(even_res))\r\nodd_bit = BIT(len(odd_res))\r\n\r\nfor i in range(q):\r\n if query[i][0] == 1:\r\n _, pos, cost = query[i]\r\n pos -= 1\r\n if begin[pos] % 2 == 0:\r\n even_bit.add(begin[pos] // 2, (end[pos] + 1) // 2, cost)\r\n odd_bit.add(begin[pos] // 2, end[pos] // 2, -cost) \r\n else:\r\n odd_bit.add(begin[pos] // 2, end[pos] // 2, cost) \r\n even_bit.add((begin[pos] + 1) // 2, end[pos] // 2, -cost) \r\n else:\r\n _, pos = query[i]\r\n pos -= 1\r\n if begin[pos] % 2 == 0:\r\n ans = even_bit.get_val(begin[pos] // 2)\r\n else:\r\n ans = odd_bit.get_val(begin[pos] // 2)\r\n print(ans + init_cost[pos])" ]

[ "n = int(input())\r\ns = list(map(int, input().split()))\r\nm = int(input())\r\ns.sort(reverse=True)\r\nchoose = []\r\nteam = []\r\nfor _ in range(m):\r\n choose1, team1 = input().split()\r\n choose.append(choose1)\r\n team.append(team1)\r\ndp = [0] * (1 << 21)\r\nfor i in range(1, 1 << m):\r\n t = m - bin(i).count('1')\r\n dp[i] = -1e8 + 1 if team[t] == '1' else 1e8 + 1\r\n for j in range(m):\r\n if (i >> j) & 1:\r\n if team[t] == '1':\r\n dp[i] = max(dp[i], (s[j] if choose[t] == 'p' else 0) + dp[i - (1 << j)])\r\n else:\r\n dp[i] = min(dp[i], (-s[j] if choose[t] == 'p' else 0) + dp[i - (1 << j)])\r\nprint(dp[(1 << m) - 1])# 1692356595.136704" ]

[ "#\t!/bin/env python3\r\n#\tcoding: UTF-8\r\n\r\n\r\n#\t✪ H4WK3yE乡\r\n#\tMohd. Farhan Tahir\r\n#\tIndian Institute Of Information Technology and Management,Gwalior\r\n\r\n#\tQuestion Link\r\n#\thttps://codeforces.com/problemset/problem/392/B\r\n#\r\n\r\n# ///==========Libraries, Constants and Functions=============///\r\n\r\n\r\nimport sys\r\n\r\ninf = float(\"inf\")\r\nmod = 1000000007\r\n\r\n\r\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\r\n\r\n\r\ndef get_ints(): return map(int, sys.stdin.readline().split())\r\n\r\n\r\ndef input(): return sys.stdin.readline()\r\n\r\n# ///==========MAIN=============///\r\n\r\n\r\ndef main():\r\n dp = [[[0 for _ in range(3)] for _ in range(3)] for _ in range(43)]\r\n matrix = [[0 for _ in range(3)] for _ in range(3)]\r\n for i in range(3):\r\n matrix[i] = get_array()\r\n n = int(input())\r\n for i in range(1, n+1):\r\n for frm in range(3):\r\n for to in range(3):\r\n other = 3-frm-to\r\n if frm == to:\r\n continue\r\n dp[i][frm][to] = dp[i-1][frm][other]+matrix[frm][to]+dp[i-1][other][to]\r\n c = dp[i-1][frm][to]+matrix[frm][other] + \\\r\n dp[i-1][to][frm]+matrix[other][to]+dp[i-1][frm][to]\r\n dp[i][frm][to] = min(c, dp[i][frm][to])\r\n print(dp[n][0][2])\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "from functools import lru_cache\r\nt = [[0]*4 for i in range(4)]\r\n\r\nfor i in range(1, 4):\r\n j = 1\r\n for v in map(int, input().split()):\r\n t[i][j] = v\r\n j += 1\r\n# for k in range(1, 4):\r\n# for i in range(1, 4):\r\n# for j in range(1, 4):\r\n# t[i][j] = min(t[i][j], t[i][k]+t[k][j])\r\n \r\nn = int(input())\r\n\r\n@lru_cache(None)\r\ndef f(l, r, nums):\r\n mid = 6-l-r # 另外一根柱子\r\n if nums == 0:\r\n return 0\r\n if l == r:\r\n return 0\r\n ans1 = f(l, mid, nums-1)+f(mid, r, nums-1)+t[l][r]\r\n ans2 = f(l, r, nums-1)*2+f(r, l, nums-1)+t[l][mid]+t[mid][r]\r\n \r\n return min(ans1, ans2)\r\nprint(f(1, 3, n))" ]

[ "q=int(input())\r\nl=list(map(int,input().split()))\r\nw=set()\r\nfor i in range(1,q):\r\n w.add(abs(l[i]-l[i-1]))\r\nf=1\r\ns=1000000000\r\nif q==1:\r\n print('YES')\r\n print(s,f)\r\n exit()\r\nif 1 in w:\r\n w.remove(1)\r\nif len(w)>1:\r\n print('NO')\r\n exit()\r\nelif 0 in w:\r\n print('NO')\r\n exit()\r\nif len(w)==0:\r\n print('YES')\r\n print(s,f)\r\n exit()\r\nf=list(w)[0]\r\nfor i in range(1,q):\r\n if l[i]-l[i-1]==1:\r\n if l[i-1]%f==0:\r\n print('NO')\r\n exit()\r\n elif l[i]-l[i-1]==-1:\r\n if l[i-1]%f==1:\r\n print('NO')\r\n exit()\r\nprint('YES')\r\nprint(s,f)" ]

[ "#903A\r\nn = int(input())\r\nfor i in range(n):\r\n x = int(input())\r\n if x%3==0:\r\n print('YES')\r\n elif x %3== 1:\r\n if x >= 7:\r\n print('YES')\r\n else:\r\n print('NO')\r\n else:\r\n if x >=14:\r\n print('YES')\r\n else:\r\n print('NO')", "n = int(input())\r\nfor zzz in range(n):\r\n x = int(input())\r\n for a in range(40):\r\n for b in range(20):\r\n if(3*a + 7*b==x):\r\n print('YES')\r\n break\r\n else:\r\n continue\r\n break\r\n else:\r\n print('NO')", "for _ in \" \"*int(input()):print(\"NO\" if int(input()) in [2,5,11,4,1,8] else \"YES\")", "n = int(input())\nfor _ in range(n):\n pieces=int(input())\n ans=\"NO\"\n for i in range (0, pieces // 7+1):\n if (pieces - i*7)%3==0:\n ans=\"YES\"\n break\n print(ans)\n", "def check(n):\r\n\tfor i in range(34):\r\n\t\tfor j in range(34):\r\n\t\t\tif 3*i+7*j==n:\r\n\t\t\t\treturn \"YES\"\r\n\treturn \"NO\"\r\ncases=int(input())\r\nfor _ in range(cases):\r\n\tn=int(input())\r\n\tprint(check(n))\r\n", "for _ in range(int(input())):\r\n x=int(input())\r\n flag=0\r\n for j in range(x):\r\n new=x-3*j\r\n if (new%7==0 and new>=0):\r\n flag=1\r\n print(\"YES\" if flag==1 else \"NO\")\r\n", "from collections import Counter\r\nmp = Counter()\r\nmp[0] = 1\r\nfor i in range(1, 101):\r\n\tmp[i] = mp[i-3] + mp[i-7]\r\n\r\ntx = int(input())\r\nfor _ in range(tx):\r\n\tx = int(input())\r\n\tif mp[x] == 0:\r\n\t\tprint(\"NO\")\r\n\telse :\r\n\t\tprint(\"YES\")", "def hangry(cases):\r\n for n in range(cases):\r\n data=int(input())\r\n if data%3==0 or data%7==0:\r\n print(\"YES\")\r\n else:\r\n bandera,a,b=True,data,data\r\n while a>=3 or b>=3:\r\n a,b=a-3,b-7\r\n if a>=3 and a%7==0:\r\n print(\"YES\")\r\n bandera=False\r\n break\r\n elif b>=3 and b%3==0:\r\n print(\"YES\")\r\n bandera=False\r\n break\r\n if bandera:\r\n print(\"NO\")\r\n\r\n \r\ndef main():\r\n cases=int(input())\r\n hangry(cases)\r\nmain()", "n = int(input())\r\nfor _ in range(n):\r\n x = int(input())\r\n flag = 0\r\n for i in range(x//7 + 1):\r\n left = x - 7*i\r\n if left%3 == 0:\r\n flag = 1\r\n break\r\n if flag == 1:\r\n print('YES')\r\n else:\r\n print('NO')", "for _ in range(int(input())):\r\n x = int(input())\r\n if x in [1,2,4,5,8,11]:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "for i in range(int(input())):\r\n x=int(input())\r\n f=0\r\n for j in range(34):\r\n if f==1:\r\n break\r\n for k in range(15):\r\n if 3*j+7*k==x:\r\n print(\"YES\")\r\n f=1\r\n break\r\n if f==0:\r\n print(\"NO\")\r\n ", "a=[1,2,4,5,8,11]\r\nfor i in range(int(input())):\r\n\tprint('NO' if int(input()) in a else 'YES')", "from math import *\r\nfor _ in range(int(input())):\r\n x = int(input())\r\n flag = False\r\n for i in range(0, ceil(x/3)+1):\r\n for j in range(0, ceil(x/7)+1):\r\n temp = i*3+j*7\r\n if temp == x:\r\n flag = True\r\n\r\n print(\"NO\" if not flag else 'YES')\r\n", "for _ in range(int(input())):\r\n a=int(input())\r\n check=True\r\n while(check and a>=0):\r\n if(a%3==0 or a==0):\r\n print('YES')\r\n check=False\r\n a-=7\r\n if(check): print('NO')", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nfor _ in range(n):\r\n x = int(input())\r\n ans = \"NO\"\r\n for i in range(100):\r\n a = 3 * i\r\n if a > x:\r\n break\r\n for j in range(100):\r\n b = 7 * j\r\n if a + b == x:\r\n ans = \"YES\"\r\n elif a + b > x:\r\n break\r\n print(ans)", "n = int(input())\r\nX = [int(input()) for i in range(n)]\r\nfor x in X:\r\n flag = False\r\n for a in range(x+1):\r\n for b in range(x+1):\r\n if 3*a+7*b == x:\r\n flag = True\r\n break\r\n if flag:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "# -*- coding: utf-8 -*-\r\n\r\n\r\n\r\ndef solve():\r\n n = int(input())\r\n\r\n for i in range(int(n / 3) + 1):\r\n for j in range(int(n / 7) + 1):\r\n if i * 3 + j * 7 == n:\r\n print(\"YES\")\r\n return\r\n print(\"NO\")\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()", "myset = set()\r\nfor i in range(100):\r\n for j in range(100):\r\n r = 3 * i + j * 7 \r\n if r >= 1 and r <= 100:\r\n myset.add(r)\r\nn = int(input())\r\nfor _ in range(n):\r\n x = int(input())\r\n if x in myset:\r\n print('YES')\r\n else:\r\n print('NO')", "l=[]\r\n \r\nfor j in range(0,101,7):\r\n \r\n\tfor i in range(j,101,3):\r\n\t\tif i not in l:\r\n\t\t\tl.append(i)\r\nl.sort()\r\n \r\n \r\nt=int(input())\r\n \r\nfor i in range(t):\r\n\tn=int(input())\r\n\tif n in l:\r\n\t\tprint('YES')\r\n\telse:\r\n\t\tprint('NO')", "n = int(input())\r\no = []\r\nfor i in range(n):\r\n x = int(input())\r\n x -= (x % 3) * 7\r\n if x < 0:\r\n o.append('NO')\r\n else:\r\n o.append('YES')\r\n\r\nprint('\\n'.join(o))", "import sys\r\n\r\nn = int(sys.stdin.readline())\r\npossible = [\"YES\"] + ([\"NO\"]*100)\r\n\r\nfor i3 in [i*3 for i in range(33)]:\r\n possible[i3] = \"YES\"\r\n for i7 in [i*7 for i in range(14)]:\r\n if i3 + i7 > 100:\r\n break\r\n else:\r\n possible[i3 + i7] = \"YES\"\r\n\r\nfor i in range(n):\r\n x = int(sys.stdin.readline())\r\n print(possible[x])\r\n", "def hihi(x):\r\n a = [1, 2, 4, 5, 8, 11]\r\n if x in a:\r\n return 'NO'\r\n else:\r\n return 'YES'\r\n\r\nt = int(input())\r\n\r\nfor i in range(t):\r\n x = int(input())\r\n print(hihi(x)) \r\n", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-14 17:09:34\nLastEditTime: 2021-11-14 17:20:42\nDescription: Hungry Student Problem\nFilePath: CF903A.py\n'''\n\n\ndef func():\n n = int(input())\n for _ in range(n):\n x = int(input())\n for i in range(0, x // 3 + 1):\n if x - i * 3 >= 0 and (x - i * 3) % 7 == 0:\n print(\"YES\")\n break\n else:\n print(\"NO\")\n\n\nif __name__ == '__main__':\n func()\n", "def a():\r\n\tg = int(input())\r\n\tfor i in range(36):\r\n\t\tfor j in range(17):\r\n\t\t\tif ((3*i + 7*j) == g):\r\n\t\t\t\treturn \"YES\"\r\n\treturn \"NO\"\r\n\r\nt = int(input())\r\nfor i in range(t):\r\n\tprint (a())\r\n\r\n\r\n\r\n", "n=int(input())\r\nfor i in range(n):\r\n x=int(input())\r\n flag=0\r\n for a in range(0,33):\r\n for b in range(0,33):\r\n if 3*(a)+7*(b)==x:\r\n flag=1\r\n break\r\n if flag==1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "def chicken(n: int) -> bool:\r\n f = 0\r\n n_7 = n // 7\r\n n_3 = 0\r\n if n % 3 == 0 or n % 7 == 0:\r\n return True\r\n elif n in [1, 2, 4, 5]:\r\n return False\r\n while True:\r\n if (n - n_7 * 7) % 3 == 0:\r\n n_3 == (n - n_7 * 7)\r\n return True\r\n elif (n - n_7 * 7) % 3 != 0:\r\n n_7 -= 1\r\n if n_7 == 0:\r\n return False\r\n\r\nn = int(input())\r\nfor i in range(n):\r\n num = int(input())\r\n if chicken(num):\r\n print('YES')\r\n else:\r\n print('NO') ", "for _ in range(int(input())):\r\n n=int(input())\r\n while (n>0):\r\n if(n%3==0):\r\n n-=3\r\n else:\r\n n-=7\r\n if(n==0):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "#n,t = [int(x) for x in input().split()]\r\nn=int(input())\r\nfor i in range(n):\r\n k=int(input())\r\n if (k==11 or k==1 or k==2 or k==4 or k==5 or k==8):\r\n print ('NO')\r\n else: \r\n print ('YES') \r\n\r\n\r\n", "n = int(input())\r\n\r\ndef check_chicken(a):\r\n if a % 7 == 0 or a % 3 == 0 or (a % 7) % 3 == 0:\r\n return True\r\n for i in range(a // 3):\r\n if (a - (i * 3)) % 7 == 0:\r\n return True\r\n\r\n return False\r\n \r\n\r\nfor i in range(n):\r\n x = int(input())\r\n if check_chicken(x):\r\n print('YES')\r\n else:\r\n print('NO')", "for i in range(int(input())):\r\n\tn=int(input())\r\n\tl=[1,2,4,5,8,11]\r\n\tif(n in l):\r\n\t\tprint(\"NO\")\r\n\telse:\r\n\t\tprint(\"YES\")", "def hungry():\n x = int(input())\n div = x//10\n if x%3 == 0 or x%7 == 0:\n return \"YES\"\n else:\n for i in range(div):\n x -= 10\n if x %3 ==0 or x%7 == 0:\n return \"YES\"\n return \"NO\"\nfor j in range(int(input())):\n print(hungry())\n", "for _ in range(int(input())):\r\n n = int(input())\r\n if (n%7 == 0) or (n%3 == 0):\r\n print(\"YES\")\r\n continue\r\n\r\n x = n%7\r\n if (x%3 == 0):\r\n print(\"YES\")\r\n continue\r\n\r\n s = set()\r\n m = 1\r\n while(3*m < 99):\r\n e = 1\r\n while((3*m)+(3*e)) < 100:\r\n s.add(3 * m + (7 * e))\r\n e = e+1\r\n\r\n m = m+1\r\n\r\n if n in s:\r\n print(\"YES\")\r\n continue\r\n\r\n print(\"NO\")", "n = int(input())\r\nfor i in range(n):\r\n k = int(input())\r\n if k % 3 == 0 or k % 7 == 0 or k % 10 == 0 or k >12:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\") ", "def find(n):\r\n\tif n<0:\r\n\t\treturn 0\r\n\tif n%3==0:\r\n\t\treturn 1\r\n\tif n%7==0:\r\n\t\treturn 1\r\n\tif find(n-3) or find(n-7):\r\n\t\treturn 1\r\n\treturn 0\r\n\r\nfor _ in range(int(input())):\r\n\tn=int(input())\r\n\tif find(n):\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")", "from functools import lru_cache\n\n@lru_cache()\ndef f(n): #if we can make n pieces\n if n==0: return True\n if n<0: return False\n return f(n-3) or f(n-7)\n\nT = int(input()) \nfor t in range(T):\n n=int(input())\n if f(n): print(\"YES\")\n else: print(\"NO\")", "a,b = 3,7\r\nt =int(input())\r\n \r\nfor i in range(t):\r\n\tflag = 0\r\n\tx = int(input())\r\n\tif x%a==0 or x%b==0:\r\n\t\tprint(\"YES\")\r\n\t\tflag =1\r\n\telse:\r\n\t\tj = x//a\r\n\t\tk = x//b\r\n\t\twhile j!=0:\r\n\t\t\tif (x-(a*j))%b==0:\r\n\t\t\t\tprint(\"YES\")\r\n\t\t\t\tflag = 1\r\n\t\t\t\tbreak\r\n\t\t\telse:\r\n\t\t\t\tj-=1\r\n\t\tif flag == 0:\r\n\t\t\twhile k!=0:\r\n\t\t\t\tif (x-(b*k))%a==0:\r\n\t\t\t\t\tprint(\"YES\")\r\n\t\t\t\t\tflag = 1\r\n\t\t\t\t\tbreak\r\n\t\t\t\telse:\r\n\t\t\t\t\tk-=1\r\n\tif flag == 0:\r\n\t\tprint(\"NO\")", "for u in range(int(input())):\r\n n, res = int(input()), \"NO\"\r\n for x in range(100):\r\n for i in range(100):\r\n if 3 * x + 7 * i == n: res = \"YES\"\r\n print(res)", "\ndef get(x) -> str:\n if can_eat(x):\n return \"YES\"\n else:\n return \"NO\"\n\n\ndef can_eat(x: int) -> bool:\n if x == 0:\n return True\n if x < 3:\n return False\n if x in [3, 7]:\n return True\n\n if can_eat(x-3):\n return True\n if can_eat(x-7):\n return True\n\n return False\n\n\nif __name__ == '__main__':\n n = int(input())\n\n for i in range(n):\n x = int(input())\n print(get(x))\n\t\t \t\t\t\t\t \t \t \t\t\t \t \t \t\t \t", "n = int(input())\r\nfor _ in range(n):\r\n x = int(input())\r\n flag = 0\r\n for i in range(x//3 + 1):\r\n left = x - 3*i\r\n if left%7 == 0:\r\n flag = 1\r\n break\r\n if flag == 1:\r\n print('YES')\r\n else:\r\n print('NO')", "n=int(input())\r\nfor i in range(n):\r\n cnt=0\r\n m=int(input())\r\n\r\n if m==1 or m==2or m==4 or m==5 or m==8 or m==11:\r\n print('NO')\r\n else:\r\n print('YES')\r\n", "for t in range(int(input())):print(\"YNEOS\"[int(input()) in (1,2,4,5,8,11)::2])", "t = int(input())\r\nfor i in range(t):\r\n n = int(input())\r\n flag = False\r\n for i in range(33):\r\n for j in range(33):\r\n if i * 3 + j * 7 == n:\r\n flag = True\r\n print('YES' if flag else 'NO')\r\n\r\n", "n = int(input())\r\nfor _ in range(n):\r\n num = int(input())\r\n if num <= 2 or num == 4 or num == 5 or num == 8 or num == 11:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")# 1698272130.7215836", "def can_buy_chunks(testcases):\r\n results = []\r\n for x in testcases:\r\n # Check if x can be expressed as 3a + 7b\r\n if x % 3 == 0 or x % 7 == 0:\r\n results.append(\"YES\")\r\n else:\r\n # Check if x can be expressed as 3a + 7b + c (where c is a combination of 3 and 7)\r\n for a in range(x // 3 + 1):\r\n for b in range(x // 7 + 1):\r\n if 3 * a + 7 * b == x:\r\n results.append(\"YES\")\r\n break\r\n else:\r\n continue\r\n break\r\n else:\r\n results.append(\"NO\")\r\n return results\r\n\r\n# Read the number of test cases\r\nn = int(input())\r\n\r\n# Read the test cases\r\ntestcases = []\r\nfor _ in range(n):\r\n x = int(input())\r\n testcases.append(x)\r\n\r\n# Check if Ivan can buy the chunks for each test case\r\nresults = can_buy_chunks(testcases)\r\n\r\n# Print the results\r\nfor result in results:\r\n print(result)", "n = int(input())\r\n\r\nwhile n >= 1:\r\n check = False\r\n a = int(input())\r\n for i in range(35):\r\n for j in range(15):\r\n if 3 *i + 7 * j == a: check = True\r\n print(\"YES\" if check == True else \"NO\")\r\n n -= 1\r\n", "t = int(input())\r\nfor i in range(t):\r\n x = int(input())\r\n ans = \"NO\"\r\n for a in range(34):\r\n for b in range(34):\r\n if 3 * a + 7 * b == x:\r\n ans = \"YES\"\r\n break\r\n print(ans)", "for i in range(int(input())):\r\n x=int(input())\r\n flag=0\r\n while x>=3:\r\n if x%3==0 or x%7==0:\r\n flag=1\r\n break\r\n else:\r\n x=x-7\r\n if flag==1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "cases = int(input())\r\n\r\npool = {1, 2, 4, 5, 8, 11}\r\n\r\nwhile cases:\r\n cases -= 1\r\n num = int(input())\r\n if num not in pool:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "cnt = 1\r\np =0\r\nr =[]\r\ndef init(a):\r\n for p in range(len(a)):\r\n a[p] = int(a[p])\r\n return(a)\r\n\r\nt = int(input())\r\nfor i in range(t):\r\n d = int(input())\r\n p = 0\r\n while (d -7*p)>=0:\r\n if (d-7*p)%3 == 0:\r\n r.append(\"YES\")\r\n break\r\n p = p+1\r\n if (d-7*p)<0:\r\n r.append(\"NO\")\r\n\r\n \r\nfor j in range(t):\r\n print(r[j])\r\n\r\n\r\n", "import sys\r\n\r\nn = int(input())\r\nfor x in map(int, sys.stdin):\r\n for i in range(100):\r\n if x - 3*i >= 0 and (x - 3*i) % 7 == 0:\r\n print('YES')\r\n break\r\n else:\r\n print('NO')\r\n", "t = int(input())\r\nfor _ in range(t):\r\n n = int(input())\r\n if n >= 13 or n == 10 :\r\n print('YES')\r\n elif n%3 == 0 or n%7 == 0:\r\n print('YES')\r\n else:\r\n print('NO')", "for t in range(int(input())):\r\n n=int(input())\r\n if n==1 or n==2 or n==4 or n==5 or n==8 or n==11:\r\n print('NO')\r\n else:\r\n print('YES')\r\n", "t=int(input())\r\nr=[]\r\nfor i in range(t):\r\n x=int(input())\r\n if x<=2:\r\n r.append(\"NO\")\r\n elif x%3==0:\r\n r.append(\"YES\")\r\n elif x%7==0:\r\n r.append(\"YES\")\r\n else:\r\n y=x//7\r\n k=0\r\n for j in range(y):\r\n p=7*y\r\n y=y-1\r\n q=x-p\r\n if q%3==0:\r\n k=1\r\n break\r\n if k==0:\r\n r.append(\"NO\")\r\n else:\r\n r.append(\"YES\")\r\nfor i in range(len(r)):\r\n print(r[i])", "import math\r\n\r\nn = int(input())\r\n\r\nfor i in range(n):\r\n m = int(input())\r\n\r\n if m % 3 == 0 or m % 7 == 0:\r\n print(\"YES\")\r\n else:\r\n f = False\r\n for j in range(40):\r\n x = m - 3 * j\r\n if x > 0 and x % 7 == 0:\r\n print(\"YES\")\r\n f = True\r\n break\r\n if not f:\r\n print(\"NO\")\r\n", "def recursive(x, memo={}):\r\n if x in memo:\r\n return memo[x]\r\n elif x == 0:\r\n return True\r\n elif x < 0:\r\n return False\r\n rec7 = recursive(x-7, memo)\r\n rec3 = recursive(x-3, memo)\r\n memo[x] = rec7 or rec3\r\n return rec7 or rec3\r\n\r\n\r\nfor _ in range(int(input())):\r\n x = int(input())\r\n if recursive(x):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "#!/bin/python3\r\nfor _ in range(int(input())):\r\n c = int(input())\r\n if c//3 - 2*(c%3) < 0:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "t = int(input())\r\nwhile t:\r\n t += -1\r\n x = int(input())\r\n ch = 0\r\n for i in range(100):\r\n for j in range(100):\r\n if 3 * i + 7 * j == x:\r\n ch = 1\r\n break\r\n if ch: print(\"YES\")\r\n else: print(\"NO\")", "memo = dict()\r\ndef recursive(x):\r\n global memo\r\n if x in memo:\r\n return memo[x]\r\n elif x == 0:\r\n return True\r\n elif x < 0:\r\n return False\r\n rec7 = recursive(x - 7)\r\n rec3 = recursive(x - 3)\r\n memo[x] = rec7 or rec3\r\n return rec7 or rec3\r\n\r\n\r\nfor _ in range(int(input())):\r\n x = int(input())\r\n if recursive(x):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "def f():\r\n n = int(input())\r\n L = []\r\n for i in range(n):\r\n L.append(int(input()))\r\n for x in L:\r\n opt = []\r\n alt = []\r\n for a in range(x):\r\n for b in range(x):\r\n opt.append(a*3+b*7==x)\r\n alt.append(b*3+a*7==x)\r\n if opt.count(True) or alt.count(True):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nf()", "def isseven(n):\r\n if n<3:\r\n return 0\r\n elif n%3==0 or n%7==0:\r\n return 1\r\n else:\r\n return isseven(n-7)\r\n\r\ndef isthree(n):\r\n if n<3:\r\n return 0\r\n elif n%7==0 or n%3==0:\r\n return 1\r\n else:\r\n return isthree(n-3)\r\n\r\nt=int(input())\r\nfor i in range(t):\r\n n=int(input())\r\n if n>=7 and isseven(n)==1:\r\n print(\"YES\")\r\n continue\r\n if n>=3 and isthree(n)==1:\r\n print(\"YES\")\r\n continue\r\n else:\r\n print(\"NO\")\r\n continue\r\n \r\n", "n= int(input(\"\"))\r\nA=[]\r\nfor i in range(n):\r\n x=int(input(\"\"))\r\n A.append(x)\r\nfor i in A:\r\n if (i%3==0 or i%7==0 or i%10==0):\r\n print('YES')\r\n else:\r\n if(i>12):\r\n print('YES')\r\n else:\r\n print(\"NO\")", "def fun(n):\r\n if(n==0):\r\n return True\r\n if(n<3):\r\n return False\r\n return fun(n-3) or fun(n-7)\r\n\r\nt=int(input())\r\nwhile(t):\r\n n=int(input())\r\n if(fun(n)):\r\n print('YES')\r\n else:\r\n print('NO')\r\n t-=1", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\nfor i in range(int(input())):\r\n\tprint(\"NO\" if int(input()) in [1,2,4,5,8,11] else \"YES\")", "n = int(input())\n\nfor i in range(n):\n x = int(input())\n\n small = x % 3\n big = (x - (7 * small)) // 3\n if big >= 0:\n print(\"YES\")\n else:\n print(\"NO\")\n \t \t\t \t\t\t \t\t \t \t \t \t \t \t\t", "for t in range(int(input())):\r\n chicken_chunks = int(input())\r\n flag = False\r\n while chicken_chunks > 0:\r\n if chicken_chunks % 3 == 0 or chicken_chunks % 7 == 0:\r\n flag = True\r\n chicken_chunks -= 3\r\n\r\n if flag:\r\n print('YES')\r\n else:\r\n print('NO')", "a = []\r\nfor i in range(0, 15):\r\n\tfor j in range(0, 34):\r\n\t\ta.append(i*7 + j*3)\r\nn = int(input())\r\nfor i in range(n):\r\n\tx = int(input())\r\n\tif x in a:\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")\r\n\t", "a = []\r\nfor i in range(50):\r\n for j in range(50):\r\n a.append(3*i + 7*j)\r\n\r\ndef brownfox2k6():\r\n print(\"YES\" if int(input()) in a else \"NO\")\r\n \r\n\r\nfor _ in range(int(input())):\r\n brownfox2k6()\r\n\r\n#########################################\r\n## ##\r\n## Implemented by brownfox2k6 ##\r\n## ##\r\n#########################################", "def can_sum(target, numbers) -> bool:\r\n table = [False for _ in range(target+1)]\r\n table[0] = True\r\n for i in range(target+1):\r\n if table[i]:\r\n for num in numbers:\r\n try:\r\n table[i+num] = True\r\n except: pass\r\n return table[target]\r\nfor _ in range(int(input())):\r\n print(\"YES\" if can_sum(int(input()),[3,7]) else \"NO\")", "#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\ndp = [False for i in range(108)]\r\ndp[0] = True\r\nfor i in range(101):\r\n if dp[i]:\r\n dp[i+3] = dp[i+7] = True\r\nfor _ in range(int(input())):\r\n if dp[int(input())]: print(\"YES\")\r\n else: print(\"NO\")", "for _ in range(int(input())):\r\n n=int(input())\r\n flag=0\r\n for i in range(n//3+1):\r\n if (n-i*3)%7==0:\r\n flag=1\r\n break\r\n if flag==0:\r\n print(\"NO\")\r\n else :\r\n print(\"YES\")", "i=input;exec(int(i())*\"x=int(i());print('YNEOS'[x in[1,2,4,5,8,11]::2]);\")", "def main():\r\n d = int(input())\r\n data = [int(input()) for v in range(d)]\r\n res = [0 for _ in range(110)]\r\n res[0]=1\r\n for i in range(0,101):\r\n if res[i]!=0:\r\n res[i+3]=1\r\n res[i+7]=1\r\n for dd in data:\r\n if res[dd]!=0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "# LUOGU_RID: 101737798\nfor _ in range(int(input())):\r\n x = int(input())\r\n for i in range(x // 3 + 1):\r\n if (x - i * 3) % 7 == 0:\r\n print('YES')\r\n break\r\n else:\r\n print('NO')", "n = int(input())\r\nfor i in range(n):\r\n\tflag = 0\r\n\tno_chunks = int(input())\r\n\tfor a in range(0,34):\r\n\t\tfor b in range(0,34):\r\n\t\t\tif 3*a + 7*b == no_chunks:\r\n\t\t\t\tflag = 1\r\n\t\t\t\tbreak\r\n\t\tif flag == 1:\r\n\t\t\tbreak\r\n\tif flag == 1:\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")", "for i in range(int(input())):\r\n\ta = int(input())\r\n\tif a==1 or a==2 or a==4 or a==5 or a==8 or a==11:\r\n\t\tprint('NO')\r\n\telse:\r\n\t\tprint('YES')", "from random import randint\r\nT=int(input())\r\nout=[]\r\nfor i in range(T):\r\n\tflag=0\r\n\tx=int(input())\r\n\tfor i in range(10000):\r\n\t\ta=randint(0,x//3)\r\n\t\tb=randint(0,x//3)\r\n\t\tif 3*a+7*b==x and a>=0 and b>=0:\r\n\t\t\tflag=1\r\n\t\t\tbreak\r\n\tif flag==1 and a>=0 and b>=0:\r\n\t\tout.append('YES')\r\n\telse:\r\n\t\tout.append('NO')\r\nfor i in range(T):\r\n\tprint(out[i])", "# -*- coding: utf-8 -*-\n\n\n\ndef solve():\n n = int(input())\n\n s = [1, 2, 4, 5, 8, 11]\n print(\"NO\" if s.count(n) else \"YES\")\n \ndef main():\n t = 1\n t = int(input())\n for i in range(t):\n solve()\n\nif __name__ == \"__main__\":\n main()\n \t\t \t \t \t \t \t \t\t \t\t\t\t", "def solve():\r\n n = int(input())\r\n i=1\r\n while (n-3*i) >=0:\r\n if (n-3*i)%7 == 0:\r\n print(\"YES\")\r\n return\r\n else:\r\n i = i + 1\r\n i=1\r\n while (n-7*i) >=0:\r\n if (n-7*i)%3 == 0:\r\n print(\"YES\")\r\n return\r\n else:\r\n i = i + 1\r\n print(\"NO\")\r\n return\r\ntry:\r\n n = int(input())\r\n for i in range(n):\r\n solve()\r\nexcept:\r\n pass", "n = int(input())\r\nprovjera = 0\r\nfor i in range(n):\r\n a = int(input())\r\n for x in range(a):\r\n for y in range(a):\r\n if 7*x + 3*y == a:\r\n provjera = 1\r\n break\r\n if provjera == 1:\r\n break\r\n for y in range(a):\r\n for x in range(a):\r\n if 7*x + 3*y == a:\r\n provjera = 1\r\n break\r\n if provjera == 1:\r\n break\r\n if provjera == 1:\r\n print('YES')\r\n provjera = 0\r\n else:\r\n print('NO')\r\n", "n=int(input())\r\nfor i in range(n):\r\n x=int(input())\r\n while(x not in [0,1,2,4,5]):\r\n if(x%3 != 0):\r\n x=x-7\r\n else:\r\n x=x%3\r\n if(x==0):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "for _ in range(int(input())):\r\n n=int(input())\r\n dp=[[0]*(n+1)]*3\r\n a=[0,3,7]\r\n for i in range(3):\r\n #print(i)\r\n dp[i][0]=1\r\n for i in range(3):\r\n for j in range(n+1):\r\n dp[i][j]=dp[i-1][j]+(0 if j-a[i-1]<0 else dp[i][j-a[i-1]])\r\n #print(dp[i][j])\r\n #print(dp[2][n])\\\r\n print((\"YES\" if dp[2][n]!=0 else \"NO\"))", "def solve():\r\n n = int(input())\r\n for i in range(33):\r\n e = 0\r\n for j in range(33):\r\n if 3*j+7*i == n:\r\n print(\"YES\")\r\n e += 1\r\n break\r\n if e > 0:\r\n break \r\n else:\r\n print(\"NO\")\r\n\r\n\r\nfor _ in range(int(input())):\r\n solve()", "n = int(input())\r\nfor i in range(n):\r\n q = int(input())\r\n t = 0\r\n for j in range(34):\r\n for k in range(34):\r\n if 3 * j + 7 * k == q:\r\n print(\"YES\")\r\n t = 1\r\n break\r\n if t == 1:\r\n break\r\n if t == 0:\r\n print(\"NO\")\r\n", "n = int(input())\r\n\r\nfor i in range(0, n):\r\n bol = 0\r\n x = int(input())\r\n for j in range(0, 101):\r\n z = x - (j*3)\r\n if z % 7 == 0 and z >= 0:\r\n bol = 1\r\n if bol == 1:\r\n print (\"YES\")\r\n else :\r\n print (\"NO\")\r\n", "l = [1, 2, 4, 5, 8, 11]\r\nt = int(input())\r\nwhile t :\r\n n = int(input())\r\n if n in l :\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n t -= 1", "n = int(input())\nx = [int(input()) for i in range(n)]\n\nset_ = set([])\n\nfor i in range(100):\n for j in range(100):\n set_.add(7*i + 3*j)\n\nfor i in range(n):\n if x[i] in set_:\n print(\"YES\")\n else:\n print(\"NO\")\n \t\t\t\t \t \t\t\t\t\t\t\t \t\t \t\t \t \t \t\t", "answers = {}\r\nfor _ in range(int(input())):\r\n\r\n def is_possible(target):\r\n if target == 0:\r\n return True\r\n\r\n if target < 0:\r\n return False\r\n \r\n if target in answers:\r\n return answers[target]\r\n\r\n possible = is_possible(target - 3)\r\n possible = is_possible(target - 7) or possible\r\n answers[target] = possible\r\n return possible\r\n \r\n print(\"YES\" if is_possible(int(input())) else \"NO\")", "class CodeforcesTask903ASolution:\n def __init__(self):\n self.result = ''\n self.n = 0\n self.tests = []\n\n def read_input(self):\n self.n = int(input())\n for x in range(self.n):\n self.tests.append(int(input()))\n\n def process_task(self):\n results = []\n for x in range(self.n):\n can_be = False\n for a in range(33):\n for b in range(14):\n if 3 * a + 7 * b == self.tests[x]:\n can_be = True\n break\n if can_be:\n results.append(\"YES\")\n else:\n results.append(\"NO\")\n self.result = \"\\n\".join(results)\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask903ASolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "x = int(input())\nfor i in range(x):\n n = int(input())\n while n > 7 and n % 3 and n % 7:\n n -= 7\n print('NO' if n % 3 and n % 7 else 'YES')\n\n", "a = int(input())\r\nfor i in range(a):\r\n\tx = int(input())\r\n\tif((x % 3) % 7 == 0 or (x % 7) % 3 == 0):\r\n\t\tprint(\"YES\")\r\n\telif x > 15:\r\n\t\tx = x % 10\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")", "\r\nt=int(input())\r\nfor i in range (t):\r\n\tr=int(input())\r\n\tif r%3==0:\r\n\t\tprint(\"YES\")\r\n\t\tcontinue\r\n\telif r%7==0:\r\n\t\tprint(\"YES\")\r\n\t\tcontinue\r\n\telse:\r\n\t\te=r%7\r\n\t\tq=r%3\r\n\t\tif r>8:\r\n\t\t\tif e==3 or e==2 :\r\n\t\t\t\tprint(\"YES\")\r\n\t\t\telif r==11:\r\n\t\t\t\tprint(\"NO\")\r\n\t\t\telif r>11:\r\n\r\n\t\t\t\tprint(\"YES\")\r\n\r\n\r\n\t\telse:\r\n\t\t\tprint(\"NO\")", "x = [0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]\r\n\r\ni = int(input())\r\nfor j in range(i):\r\n a = int(input())\r\n if x[a]==1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "import sys\r\nimport math\r\nimport bisect\r\nimport itertools\r\n\r\ndef main():\r\n for _ in range(int(input())):\r\n x = int(input())\r\n ans = False\r\n for i in range(x // 3 + 1):\r\n if (x - i * 3) % 7 == 0:\r\n ans = True\r\n break\r\n if ans:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "t = int(input())\r\n\r\nwhile t:\r\n t -= 1\r\n n = int(input())\r\n if not(n % 3 and n % 7):\r\n print(\"YES\")\r\n continue\r\n else:\r\n flag = 1\r\n big = n // 7\r\n reminder = n - (big * 7)\r\n while big > 0 and flag:\r\n if not(reminder % 3):\r\n print(\"YES\")\r\n flag = 0\r\n continue\r\n else:\r\n big -= 1\r\n reminder += 7\r\n if not flag:\r\n continue\r\n print(\"NO\")", "t = int(input())\r\ndp = [0]*101\r\ndp[0] = 1\r\nfor i in range(len(dp)):\r\n if i >= 3:\r\n dp[i] |= dp[i-3]\r\n if i >= 7:\r\n dp[i] |= dp[i-7]\r\n\r\nfor _ in range(t):\r\n n = int(input())\r\n print(\"NO\" if not dp[n] else \"YES\")", "for _ in range(int(input())):\r\n\tflag=0\r\n\tx=int(input())\r\n\twhile x>=0:\r\n\t\tif x%10==0:\r\n\t\t\tflag=1\r\n\t\t\tbreak\r\n\t\tif x%7==0:\r\n\t\t\tflag=1\r\n\t\t\tbreak\r\n\t\tif x%3==0:\r\n\t\t\tflag=1\r\n\t\t\tbreak\r\n\t\tx-=3\r\n\tprint(['NO','YES'][flag==1])", "lines = int(input())\r\ninputs = []\r\nfor i in range(lines):\r\n inputs.append(input())\r\n\r\ninputs = list(map(int, inputs))\r\n\r\nc = 0\r\n\r\nwhile lines > c:\r\n x = inputs[c]\r\n c += 1\r\n a = x//7\r\n b = 0\r\n while b<=a:\r\n x = x-7*b\r\n if x%3==0:\r\n print(\"YES\")\r\n break\r\n elif b==a:\r\n print(\"NO\")\r\n break\r\n else:\r\n x=x+7*b\r\n b+=1", "T=int(input())\r\nfor t in range(0,T):\r\n x=int(input())\r\n flag=0\r\n for i in range(0,33):\r\n for j in range(0,33):\r\n if((3*i+7*j)==x):\r\n flag=1\r\n if(flag==1):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n ", "k = int(input())\r\nmas = []\r\nfor i in range (k):\r\n mas.append(int(input()))\r\nfor i in range (k):\r\n n = mas[i]\r\n if n < 3 or (n>3 and n<6) or n == 8 or n == 11:\r\n print ('NO')\r\n else:\r\n print ('YES')\r\n", "\ndef func():\n n = int(input())\n for i in range(n):\n n = int(input())\n res = False\n while n>0:\n if n%7==0:\n res = True\n break\n n -= 3\n if res or n==0:\n print(\"YES\")\n else:\n print(\"NO\")\n \n\n\nif __name__ == \"__main__\":\n func()\n\t\t\t \t \t\t\t\t \t\t\t\t \t\t \t \t\t\t", "f=lambda x: 'NYOE S'[-2*x//7>=-(x//3)::2]\r\nfor _ in [0]*int(input()):\r\n print(f(int(input())))", "import sys\n\ndef main(n):\n hs = {1,2,4,5,8,11}\n if n in hs:\n return \"NO\"\n return \"YES\"\n\nfor _ in range(int(input())):\n print(main(int(sys.stdin.readline())))\n", "n = int(input())\r\n\r\nfor i in range(n):\r\n\ts = int(input())\r\n\twhile s>0:\r\n\t\tif s%7!=0:\r\n\t\t\ts-=3\r\n\t\telse:\r\n\t\t\ts = 0\r\n\t\t\tbreak\r\n\tif s==0:\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")", "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\nfor _ in range(int(input())):\r\n n=int(input())\r\n x=math.ceil(n/3)\r\n f=0\r\n for i in range(x+1):\r\n p=n-i*3\r\n if p%7==0:\r\n f=1\r\n break\r\n if f:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n = int(input())\r\nfor i in range(n):\r\n x = int(input())\r\n if x % 3 == 0 or x % 7 == 0 or x % 10 == 0 or x >= 12:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\n", "t=int(input())\nfor i in range(t):\n x=int(input())\n flag= False\n while x>=0:\n if(x%3==0 ):\n flag=True\n break\n x-=7\n if(flag):\n print(\"YES\")\n else:\n print(\"NO\")\n\n\t\t \t\t \t \t\t\t \t\t\t \t \t \t \t\t", "# équation -> 3x+7y = n\r\n\r\ndef solve(x):\r\n if x%3==0 or x%7==0 or x%10==0:\r\n return 'YES'\r\n \r\n for i in range(101):\r\n for j in range(101):\r\n if 3*i+7*j==x:\r\n return 'YES'\r\n return 'NO'\r\n\r\n\r\nfor _ in range(int(input())):\r\n n = int(input())\r\n print(solve(n))\r\n\r\n\r\n", "n = int(input())\r\nfor _ in range(n):\r\n g = int(input())\r\n if g == 1 or g == 2 or g == 4 or g == 5 or g == 8 or g == 11:\r\n print('NO')\r\n else:\r\n print('YES')", "n = int(input())\nfor _ in range(n):\n a = int(input())\n ans = \"NO\"\n for i in range(0, a // 7 + 1):\n if (a - i * 7) % 3 == 0:\n ans = \"YES\"\n break\n print(ans)", "for i in range(int(input())):\r\n k = int(input())\r\n if k == 1 or k== 2 or k == 4 or k == 5 or k== 8 or k == 11:\r\n print('NO')\r\n else:\r\n print('YES')", "#-------------Program--------------\r\n#----Kuzlyaev-Nikita-Codeforces----\r\n#-------------Training-------------\r\n#----------------------------------\r\n\r\nn=int(input())\r\nfor i in range(n):\r\n x=int(input())\r\n for j in range(15):\r\n if 7*j>x:\r\n print(\"NO\")\r\n break\r\n if (x-7*j)%3==0:\r\n print(\"YES\")\r\n break\r\n else:\r\n print(\"NO\")", "import math\r\nimport collections\r\n \r\ndef solve(x):\r\n for i in range(34):\r\n for j in range(15):\r\n if 3*i + 7*j == x:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\n\r\nn = int(input())\r\nfor n in range(n):\r\n x = int(input())\r\n result = solve(x)\r\n print(result)\r\n", "def hUnGrY(x):\r\n for a in range(0,34):\r\n for b in range(0, 34):\r\n if 3*a+7*b==x:\r\n return 'YES'\r\n return 'NO'\r\nt=int(input())\r\nfor i in range(t):\r\n g=int(input())\r\n print(hUnGrY(g))\r\n", "t=int(input())\r\nwhile(t):\r\n t-=1\r\n x=int(input())\r\n if(x==1 or x==2 or x==4 or x==5 or x==8 or x== 11):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "\r\nn = int(input())\r\nfor _ in range(n):\r\n x = int(input())\r\n if x % 3 == 0 or x % 7 == 0:\r\n print('YES')\r\n else:\r\n flag = False\r\n for a in range(1, 34):\r\n for b in range(1, 15):\r\n if 3*a + 7*b == x:\r\n flag = True\r\n break\r\n print('YES' if flag else 'NO')\r\n", "for i in range(int(input())):\r\n n = int(input())\r\n possible = False\r\n for i in range(n+1):\r\n if(i%3 == 0 and (n-i)%7==0):\r\n possible = True\r\n break\r\n print(\"YES\" if(possible) else \"NO\")", "i=input;exec(int(i())*\"print('YNEOS'[int(i())in[1,2,4,5,8,11]::2]);\")", "import math\r\nimport sys\r\n#from collections import deque, Counter, OrderedDict, defaultdict\r\n#import heapq\r\n#ceil,floor,log,sqrt,factorial,pow,pi,gcd\r\n#import bisect\r\n#from bisect import bisect_left,bisect_right\r\ninput = sys.stdin.readline\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input().strip()\r\n return(list(s[:len(s)]))\r\ndef invr():\r\n return(map(int,input().split()))\r\ndp=set([3*a+7*b for a in range(34) for b in range(15) if 3*a+7*b<=105])\r\nfor _ in range(inp()):\r\n if inp() in dp:\r\n print('YES')\r\n else:\r\n print('NO')", "a=int(input())\nfor i in range(a):\n b=int(input())\n for i in range(0,b):\n if((b-3*i)>=0 and (b-3*i)%7==0):\n print(\"YES\")\n break \n else:\n print(\"NO\")\n\n", "t = int(input())\r\n\r\nfor i in range(t) : \r\n res= \"NO\"\r\n x= int(input())\r\n if x % 7 == 0 :\r\n res= \"YES\"\r\n elif x % 3 == 0 : \r\n res = \"YES\"\r\n else: \r\n while x >0 :\r\n x-= 3 \r\n if x % 7 == 0: \r\n res = \"YES\"\r\n break \r\n print(res)\r\n \r\n ", "t = int(input())\r\nfor i in range(t):\r\n n = int(input())\r\n if (n <= 2 or n == 4 or n == 5 or n == 8 or n == 11):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "for t in range(int(input())):\r\n n = int(input()); ans = \"NO\"\r\n if(n%7==0 or n%3 == 0):print(\"YES\");continue\r\n for i in range(3,n+1,3):\r\n if((n-i)%7==0 or (n-i)%3 == 0): ans = \"YES\"; break\r\n print(ans)", "n=int(input())\r\nfor i in range(n):\r\n x=int(input())\r\n for j in range(0,x//3+1):\r\n g=False\r\n for k in range(0,x//7+1):\r\n if 3*j+7*k==x:\r\n print('YES')\r\n g=True\r\n break\r\n if g==True:\r\n break\r\n else:\r\n print('NO')", "n = int(input())\r\nfor j in range(n):\r\n x = int(input())\r\n for i in range(x // 7 + 1):\r\n if (x - i * 7) % 3 == 0:\r\n print(\"YES\")\r\n break\r\n else:\r\n print(\"NO\")", "def eatChicken(target):\n dp = [0]*(target+1)\n dp[0] = 0\n # init \n for i in range(1, target+1):\n dp[i] = i // 3 * 3\n # print(dp)\n \n for i in range(1, target+1):\n if i >= 7:\n dp[i] = max(dp[i], dp[i-7]+7)\n # print(dp)\n return dp[-1]\n\nn = int(input())\nfor index in range(n):\n tgt = int(input())\n if eatChicken(tgt) == tgt:\n print(\"YES\")\n else:\n print(\"NO\")\n \t\t \t \t \t\t\t \t\t \t\t", "n = int(input()) # read the number of test cases\r\n\r\nfor i in range(n):\r\n x = int(input()) # read the number of chicken chunks Ivan wants to eat\r\n \r\n # check if x can be written as a sum of 3s and 7s\r\n for a in range(x//3 + 1):\r\n for b in range(x//7 + 1):\r\n if a*3 + b*7 == x:\r\n print(\"YES\")\r\n break\r\n else:\r\n continue\r\n break\r\n else:\r\n print(\"NO\")\r\n", "for i in range(int(input())):\r\n\r\n x = int(input())\r\n while x > 0 :\r\n if x % 3 != 0 :\r\n x -= 7\r\n\r\n else:\r\n x = 0\r\n break\r\n\r\n if x == 0 :\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\n", "n = int(input())\na = []\nfor _ in range(n):\n x = int(input())\n ans = \"NO\"\n for i in range(0, x // 7 + 1):\n if (x - i * 7) % 3 == 0:\n ans = \"YES\"\n break\n a.append(ans)\nfor i in a:\n print(i)\n", "t=int(input())\r\nwhile(t>0):\r\n t-=1\r\n n=int(input())\r\n if(n>=12):\r\n print( \"YES\")\r\n elif(n==3 or n==6 or n==7 or n==9 or n==10):\r\n print( \"YES\")\r\n else:\r\n print( \"NO\")", "for i in range(int(input())):\r\n\ta = int(input())\r\n\tif a <=11:\r\n\t\tif a % 3 == 0 or a % 7 == 0 or a % 10 == 0:\r\n\t\t\tprint(\"YES\")\r\n\t\telse:\r\n\t\t\tprint(\"NO\")\r\n\telse:\r\n\t\tprint(\"YES\")\r\n", "x = int(input())\r\nfor t in range(x):\r\n n = int(input())\r\n if n % 3 == 0 or n % 7 == 0:\r\n print('YES')\r\n else:\r\n can = False\r\n i = 1\r\n while 3 * i < n:\r\n diff = n - (3 * i)\r\n if diff % 7 == 0:\r\n can = True\r\n print('YES')\r\n break\r\n else:\r\n i += 1\r\n if not can:\r\n e = 1\r\n while 7 * e < n:\r\n diff = n - (7 * e)\r\n if diff % 3 == 0:\r\n can = True\r\n print('YES')\r\n break\r\n else:\r\n e += 1\r\n if not can:\r\n print('NO')\r\n", "for _ in range(int(input())):\r\n x = int(input())\r\n ok = 0\r\n for i in range(x//3 + 1):\r\n a = i * 3\r\n b = x - a\r\n if b % 7 == 0:\r\n ok = 1\r\n if ok == 1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n ", "ans = []\r\ndef solve(n):\r\n global ans\r\n small = 3\r\n large = 7\r\n result = \"0\"\r\n if n==0 or n==1 or n==2 or n==4 or n==5 or n==8 or n==11:\r\n result=\"NO\"\r\n else:\r\n result=\"YES\"\r\n ans.append(result)\r\n \r\ndef main():\r\n global ans\r\n t = int(input())\r\n for _ in range(t):\r\n n = int(input())\r\n # u = primeFactors(n)\r\n solve(n)\r\n for i in ans:\r\n print(i)\r\n\r\nmain()", "for _ in range(int(input())):\r\n print('NO' if input() in '1 2 4 5 8 11' else 'YES')", "for _ in range(int(input())):\r\n\tn=int(input())\r\n\tp=n//3\r\n\tif p==0:\r\n\t\tprint('NO')\r\n\telse:\r\n\t\ts=n-3*p\r\n\t\ts*=2\r\n\t\tif n//3>=s:\r\n\t\t\tprint('YES')\r\n\t\telse:\r\n\t\t\tprint('NO')", "from sys import stdin\r\ninput = stdin.readline\r\n\r\nz = set()\r\nfor a in range(34):\r\n for b in range(34):\r\n z.add(3*a + 7*b)\r\n\r\nt = int(input())\r\nfor _ in range(t):\r\n x = int(input())\r\n if x in z:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n=int(input())\r\nflag=0\r\nfor i in range(n):\r\n\tx=int(input())\r\n\tif x%3==0 or x%7==0 or x%10==0 or x>=12:\r\n\t\tprint('YES')\r\n\telse:\r\n\t\tprint('NO')", "for _ in range(0, int(input())):\n v = int(input())\n t = v > 11\n print([\"NO\", \"YES\"][t or v % 3 == 0 or v % 7 == 0 or v == 10])\n", "def av(x):\r\n for i in range(100):\r\n for j in range(100):\r\n if 7 * i + 3 * j == x:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\n\r\nfor i in range(int(input())):\r\n x = int(input())\r\n print(av(x))\r\n", "n = int(input())\r\nwhile n >= 1:\r\n check = False\r\n a = int(input())\r\n for i in range(15):\r\n if (a - 7*i ) % 3 == 0 and a >= 7*i: check = True\r\n print(\"YES\" if check == True else \"NO\")\r\n n -= 1\r\n", "from sys import stdin\r\nfor _ in range(int(stdin.readline())):\r\n n = int(stdin.readline())\r\n f = 1\r\n if n<=2:\r\n print(\"NO\")\r\n elif n%3==0 or n%7==0:\r\n print(\"YES\")\r\n else:\r\n for i in range(101):\r\n for j in range(101):\r\n if (3*i + 7*j) ==n:\r\n f=0\r\n break\r\n if f==0:\r\n print(\"YES\")\r\n else:print(\"NO\")\r\n", "n = int(input())\nfor i in range(n):\n x = int(input())\n valid = False\n for i in range(40):\n for j in range(20):\n if 3 * i + 7 * j == x:\n valid = True\n break\n if valid:\n break\n if valid:\n print('YES')\n else:\n print('NO')\n\n \t\t\t \t \t \t\t \t \t\t\t\t \t \t\t", "# @author Matheus Alves dos Santos\n\nn_tests = int(input())\nimpossible_values = [1, 2, 4, 5, 8, 11]\n\nfor i in range(n_tests):\n n_chunks = int(input())\n \n if (n_chunks in impossible_values):\n print('NO')\n else:\n print('YES')\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\ncase = int(input())\r\n\r\nfor _ in range(case):\r\n c = int(input())\r\n if c in [1, 2, 4, 5, 8, 11]:\r\n print('NO')\r\n else:\r\n print('YES')", "\r\nn = int(input())\r\nfor _ in range(n):\r\n\tm = int(input())\r\n\t\r\n\twhile m >= 0 and m % 3 != 0:\r\n\t\tm -= 7\r\n\t\t\r\n\tif m >= 0:\r\n\t\tprint('YES')\r\n\telse:\r\n\t\tprint('NO')\r\n", "# cook your dish here\r\nt=int(input())\r\nfor i in range(0,t):\r\n x=int(input())\r\n f=0\r\n for j in range(0,100):\r\n for k in range(0,100):\r\n if j*3 + k*7 == x:\r\n print(\"YES\")\r\n f=1\r\n break\r\n if f==1:\r\n break\r\n if f==0:\r\n print(\"NO\")", "for i in range(int(input())):\r\n opx=int(input())\r\n while(1):\r\n if(opx%7==0 or opx%3==0):\r\n print(\"YES\")\r\n break\r\n elif(opx>=10):\r\n opx-=7\r\n else:\r\n print(\"NO\")\r\n break", "ar = [0 for i in range(101)]\r\nar[0] = 1\r\n\r\nfor i in range(0, 33):\r\n for j in range(0, 20):\r\n if 3 * i + 7 * j <= 100:\r\n \r\n ar[3 *i + 7 *j] = 1\r\n \r\n \r\nn = int(input())\r\nfor i in range(n):\r\n t = int(input())\r\n if ar[t] == 1:\r\n print('YES')\r\n else:\r\n print('NO')", "for i in range(int(input())):\r\n t=int(input())\r\n c=0\r\n for b in range(15):\r\n if (t-(7*b))%3==0 and (t-7*b)>=0:\r\n print(\"YES\")\r\n break\r\n if b==14:\r\n print(\"NO\")", "def solve():\r\n n = int(input())\r\n \r\n for x in range(34):\r\n for y in range(34):\r\n if 3 * x + 7 * y == n:\r\n print(\"YES\")\r\n \r\n return\r\n \r\n print(\"NO\")\r\n \r\n \r\nif __name__ == \"__main__\":\r\n for test in range(int(input())):\r\n solve()\r\n ", "n = int(input())\r\nfor test in range(n):\r\n x = int(input())\r\n if x == 1 or x == 2 or x == 4 or x == 5 or x == 8 or x == 11:\r\n print('NO')\r\n else:\r\n print('YES')", "a = int(input())\r\nfor i in range(a):\r\n b = int(input())\r\n if b == 1 or b == 2 or b == 4 or b == 5 or b == 8 or b == 11:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "for _ in range(int(input())):\r\n x = int(input())\r\n if x in [1, 2, 4, 5, 8, 11]:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n", "T = int (input())\nfor t in range (T):\n n = int (input())\n dp = [False] * max (7, n + 1)\n dp[0] = True\n dp[1] = False\n dp[2] = False\n dp[3] = True\n dp[4] = False\n dp[5] = False\n dp[6] = True\n for i in range (7, n + 1):\n dp[i] = dp[i - 3] or dp[i - 7]\n \n if dp[n]:\n print (\"YES\")\n else:\n print (\"NO\")\n \t\t \t\t\t\t\t\t\t\t\t \t \t \t\t\t \t", "for _ in range(int(input())):\r\n n = int(input())\r\n print([\"YES\",\"NO\"][n in [1,2,4,5,8,11]])", "cases = int(input())\r\n\r\npool = {1, 2, 4, 5, 8, 11}\r\n\r\nwhile cases:\r\n cases -= 1\r\n num = int(input())\r\n\r\n if num < 3:\r\n print(\"NO\")\r\n else:\r\n step = 0\r\n found = False\r\n while 3*step <= num:\r\n if (num - 3*step) % 7 == 0:\r\n print(\"YES\")\r\n found = True\r\n break\r\n step += 1\r\n if not found:\r\n print(\"NO\")\r\n", "x = int(input())\r\nlista = []\r\nfor i in range(x):\r\n a =int(input())\r\n lista.append(a)\r\nfor i in range(len(lista)):\r\n if (lista[i] >= 12 or lista[i] == 3 or lista[i] == 6 or lista[i] == 7 or lista[i] == 9 or lista[i] == 10): \r\n print('YES')\r\n else:\r\n print('NO')", "# cook your dish here\r\nt=int(input())\r\na=[0]*101\r\na[0]=1\r\na[3]=1\r\na[6]=1\r\na[7]=1\r\nfor i in range(8,101):\r\n if a[i-3] ==1 or a[i-7]==1 :\r\n a[i]=1\r\n#print(a)\r\nwhile t>0:\r\n n=int(input())\r\n if a[n]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n t-=1", "for i in range(int(input())):\r\n n = int(input())\r\n while n > 0 :\r\n if n % 7 != 0 :\r\n n -= 3 \r\n else:\r\n n = 0 \r\n break\r\n if n == 0 :\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "for i in range(int(input())):\r\n\ta = int(input())\r\n\tif a%3==0 or a%7==0 or a%10==0 or a>=12:print(\"YES\")\r\n\telse:print(\"NO\")", "t=int(input())\r\nfor i in range(t):\r\n\tc=0\r\n\tn=int(input())\r\n\tfor j in range(0,n+1):\r\n\t\tfor k in range(0,n+1):\r\n\t\t\tif 3*j+7*k==n or 3*k+j*7==n:\r\n\t\t\t\tc+=1\r\n\t\t\t\tbreak\r\n\tif c==0:\r\n\t\tprint(\"NO\")\r\n\telse:\r\n\t\tprint(\"YES\")\t\t\t\t\t", "# bsdk idhar kya dekhne ko aaya hai, khud kr!!!\r\n# import math\r\n# from itertools import *\r\n# import random\r\n# import calendar\r\n# import datetime\r\n# import webbrowser\r\n\r\n\r\nn = int(input())\r\nfor _ in range(n):\r\n x = int(input())\r\n if x in [1, 2, 4, 5, 8, 11]:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n", "seventhree = [i for i in range(7, 101, 3)]\r\n#print(seventhree)\r\nthreeseven = [i for i in range(3, 101, 7)]\r\n#print(threeseven)\r\nsevennine = [i for i in range(9, 101, 7)]\r\n#print(sevennine)\r\nseventwelve = [i for i in range(12, 101, 7)]\r\nseventwelve = [i for i in range(14, 101, 3)]\r\n#print(seventwelve)\r\n\r\nn = int(input())\r\nfor i in range(n):\r\n x = int(input())\r\n if (x % 3 == 0) or (x % 7 == 0) or (x in seventhree) or (x % 10 == 0) or (x in threeseven) or (x in sevennine) or (x in seventwelve):\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", "def recursive(x):\r\n # without memo test\r\n if x == 0:\r\n return True\r\n elif x < 0:\r\n return False\r\n return recursive(x-7) or recursive(x-3)\r\n\r\n\r\nfor _ in range(int(input())):\r\n x = int(input())\r\n if recursive(x):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "for i in range(int(input())):\r\n x = int(input())\r\n if (x <= 2):\r\n print(\"NO\")\r\n elif (x % 3 == 0 or x % 7 == 0):\r\n print(\"YES\")\r\n else:\r\n ok = False\r\n while x >= 10:\r\n x -= 10\r\n if (x % 3 == 0 or x % 7 == 0):\r\n ok = True\r\n break\r\n print(\"YES\" if ok else \"NO\")", "n = int(input())\r\nfor i in range(n):\r\n b = int(input())\r\n if b % 3 == 0:\r\n print(\"YES\")\r\n else:\r\n x = b - b // 3 * 3\r\n if x == 1 and b // 3 >= 2:\r\n print(\"YES\")\r\n elif x == 1 and b // 3 < 2:\r\n print(\"NO\")\r\n elif x == 2 and b // 3 >= 4:\r\n print(\"YES\")\r\n elif x == 2 and b // 3 < 4:\r\n print(\"NO\")\r\n", "n = int(input())\r\nfor _ in range(n):\r\n a = int(input())\r\n if a % 3 == 0 or a % 7 == 0:\r\n print(\"YES\")\r\n continue\r\n if a % 3 == 1 and a >= 7:\r\n print(\"YES\")\r\n continue\r\n if a % 3 == 2 and a >= 14:\r\n print(\"YES\")\r\n continue\r\n print(\"NO\")\r\n", "t=int(input())\r\nfor i in range(t):\r\n\tn=int(input())\r\n\tf=0\r\n\ttr=[i for i in range(34)]\r\n\tse=[i for i in range(15)]\r\n\tfor j in range(len(se)):\r\n\t\tfor k in range(len(tr)):\r\n\t\t\tif((3*(tr[k])+7*(se[j]))==n):\r\n\t\t\t\tprint('YES')\r\n\t\t\t\tf=1\r\n\t\t\t\tbreak\r\n\t\tif(f==1):\r\n\t\t\tbreak\r\n\tif(f==0):\r\n\t\tprint('NO')", "A = [1,2,4,5,8,11]\r\n\r\nt = int(input())\r\nfor i in range(t):\r\n if int(input()) in A:\r\n print('NO')\r\n else:\r\n print('YES')\r\n", "def CFK(m):\r\n if (m % 3 == 0) or (m % 7 == 0):\r\n ans = 1\r\n return ans \r\n elif m < 7:\r\n ans = 0\r\n return ans \r\n elif m > 7:\r\n return CFK(m-7)\r\n \r\n\r\na = []\r\nn = int(input())\r\nfor i in range(n):\r\n a.append(int(input()))\r\n if CFK(a[i]):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "for i in range(int(input())):\r\n\tn=int(input())\r\n\tflag=0\r\n\tfor j in range(n//3):\r\n\t\tif ((n-3*j)%7)%3==0 or (n%3)==0:\r\n\t\t\tprint(\"YES\")\r\n\t\t\tflag=1\r\n\t\t\tbreak\r\n\tif flag==0:\r\n\t\tprint(\"NO\")\t", "n = int(input())\n\nfor i in range(n): \n\tnum=int(input())\n\tif(num%3==0 or num%7==0):\n\t\tprint(\"YES\")\n\telse:\n\t\tf=0\n\t\t\n\t\tfor j in range(40):\n\t\t\tx=num-3*j;\n\t\t\tif(x>0 and x%7==0):\n\t\t\t\tprint(\"YES\");\n\t\t\t\tf=1;\n\t\t\t\tbreak;\n\n\t\tif(f==0):\n\t\t\tprint(\"NO\");\n \t\t \t\t\t\t \t \t\t \t \t\t\t \t\t \t", "for i in range(int(input())):\r\n n = int(input())\r\n list1 = [1 for i in range((n//7)+1) if (n-7*i)%3 == 0]\r\n print('YNEOS'[1 not in list1::2])\r\n", "for _ in range(int(input())):\n print('NO') if int(input()) in (1, 2, 4, 5, 8, 11) else print('YES')\n", "n = int(input())\r\nfor case in range(n):\r\n x = int(input())\r\n if x in [1, 2, 4, 5, 8, 11]:\r\n ans = 'NO'\r\n else:\r\n ans = 'YES'\r\n print(ans)\r\n", "for _ in range(int(input())):\r\n x = int(input())\r\n c3 = 0\r\n while c3 * 3 <= x:\r\n c7 = 0\r\n while c3 * 3 + c7 * 7 < x:\r\n c7 += 1\r\n if c3 * 3 + c7 * 7 == x:\r\n print(\"YES\")\r\n break\r\n c3 += 1\r\n else:\r\n print(\"NO\")", "def hungry_student_problem():\r\n for i in range(int(input())):\r\n a=int(input())\r\n if (a%3==0 or a%7==0 or a==10 or a>11):print('YES')\r\n else:print('NO')\r\nhungry_student_problem()", "n = int(input())\r\nfor item in range(n):\r\n a = int(input())\r\n if a != 4 and a != 5 and a != 8 and a != 11 and a >= 3:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "t=int(input())\r\ns=[]\r\nfor hjbbh in range(0,t):\r\n x=int(input())\r\n f=int(x//7)\r\n h=0\r\n for i in range(0,f+1):\r\n if (x-i*7)%3==0:\r\n s.append('YES')\r\n h+=1\r\n break\r\n if h==0:\r\n s.append('NO')\r\nfor i in s:\r\n print(i)\r\n", "n = int(input())\ncont = 0\n\n\nwhile cont < n:\n i = int(input())\n if i == 0:\n print('NO')\n cont += 1\n elif i < 7:\n if i%3 == 0:\n print('YES')\n elif i%3 != 0:\n print('NO')\n cont += 1\n elif i >= 7:\n if i%3 == 0:\n print('YES')\n elif i%7 == 0:\n print('YES')\n elif i%3 != 0 and i%7 != 0:\n while True:\n i = i - 7\n if i <= 0:\n print('NO')\n break\n elif i%3 == 0:\n print('YES')\n break\n cont += 1\n\n\t\t\t\t\t \t\t\t\t\t \t\t \t \t \t\t \t\t", "i=input\r\nfor _ in[0]*int(i()):\r\n x=int(i())\r\n print('YNEOS'[all(x!=3*a+7*b for a in range(50) for b in range(50))::2])", "n=int(input())\r\nfor i in range(n):\r\n a=int(input())\r\n a-=(a%3)*7\r\n if a<0:\r\n print('NO')\r\n else:\r\n print('YES')", "dp=[False for i in range(101)]\r\ndp[3]=True\r\ndp[6]=True\r\ndp[7]=True\r\nfor i in range(8,101):\r\n dp[i]=dp[i-7] or dp[i-3]\r\n# print([i for i in range(101)])\r\n# print(dp)\r\nfor t in range(int(input())):\r\n n=int(input())\r\n if dp[n]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n ", "t = int(input())\r\nfor _ in range(t):\r\n n = int(input())\r\n if n in [1, 2, 4, 5, 8, 11]:\r\n print('NO')\r\n else:\r\n print('YES')", "for i in range (int(input())):\r\n n=int(input())\r\n if(n<3):\r\n print(\"NO\")\r\n elif(n>11):\r\n print(\"YES\")\r\n elif(n%3==0 or n%7==0):\r\n print(\"YES\")\r\n elif(n%3==0 or (n%7)%3==0):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "t = int(input())\r\nfor n in range(t):\r\n i = int(input())\r\n dp = [0 for x in range(i+1)]\r\n dp[0] = 1\r\n for x in range(i+1):\r\n if dp[x] == 1:\r\n x1 = x+3\r\n x2 = x+7\r\n if x1 <= i:\r\n dp[x1] = 1\r\n if x2 <= i:\r\n dp[x2] = 1\r\n if dp[i] == 1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "a = int(input());r = []\r\n\r\nfor i in range(a):\r\n s = int(input())\r\n w = 'NO'\r\n if s % 3 == 0 or s % 7 == 0:\r\n r.append('YES')\r\n else:\r\n for l in range(1, s // 7 + 1):\r\n for j in range(1, s // 3 + 1):\r\n if l * 7 + j * 3 == s:\r\n w = 'YES'\r\n elif w != 'YES':\r\n w = 'NO'\r\n r.append(w)\r\n\r\n \r\nfor i in r:\r\n print(i)\r\n", "q = int(input())\r\nfor i in range(q):\r\n n = int(input())\r\n ans = []\r\n for j in range(34):\r\n for k in range(15):\r\n if j * 3 + k * 7 == n:\r\n ans.append(j + k)\r\n if len(ans) == 0:\r\n print('NO')\r\n else:\r\n print('YES')\r\n", "for i in range(int(input())):\r\n x=int(input())\r\n a=x%7\r\n b=x%3\r\n if x%3==0 or x%7==0:\r\n print(\"YES\")\r\n elif a%3==0 or b%7==0:\r\n print(\"YES\")\r\n elif x>11:\r\n print('YES')\r\n else:\r\n print(\"NO\")\r\n ", "test = int(input())\r\nwhile test > 0:\r\n test -= 1\r\n n = int(input())\r\n check = False\r\n for i in range(101):\r\n x = i * 3\r\n if x > n:\r\n break\r\n if (n - x) % 7 != 0:\r\n continue\r\n check = True\r\n break\r\n if check == True:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "casos = int(input())\r\nfor i in range(casos):\r\n piezas = int(input())\r\n if piezas>12:\r\n print(\"YES\")\r\n elif piezas%3==0 or piezas%7==0 or piezas%10==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n = int(input())\n\npequeno = 3\ngrande = 7\n\nres = []\nfor i in range(n):\n x = int(input())\n\n if x == pequeno or x == grande:\n res.append('YES')\n elif x == (pequeno + grande):\n res.append('YES')\n else:\n res_ = False\n for j in range(35):\n for k in range(35):\n if x == pequeno * j + grande * k:\n res_ = True\n break\n if res_:\n res.append('YES')\n else:\n res.append('NO')\n\n\nfor i in res:\n print(i)\n\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\nfor i in range(n):\r\n x=int(input())\r\n f=0\r\n while x>=3:\r\n if x%7==0 or x%3==0:\r\n print('YES')\r\n f=1\r\n break\r\n x-=3\r\n if f==0:\r\n print('NO')", "n = int(input()) # вводим количество операций\r\nfor el in range(n): # для каждого элемента n раз :\r\n z = int(input()) # вводим сколько ходим скушать курочек\r\n mas = [1, 2, 4, 5, 8, 11] # те курочки, которые не ровно получается (не зря же я считала до 30)\r\n if z in mas: # если желаемое находится в неровных курочках\r\n print(\"NO\") # выводим НОУ\r\n continue # перебираем оставшиеся элементы\r\n else: # в противном случае\r\n print(\"YES\") # выводим ЕС и кушаем сочные, вкусные, божественные курочки", "a = int(input())\r\nfor i in range(a):\r\n\tif int(input()) in [1, 2, 4, 5, 8, 11]:\r\n\t\tprint(\"NO\")\r\n\telse:\r\n\t\tprint(\"YES\")", "for t in range(int(input())):\r\n n=int(input())\r\n m=True\r\n if m:\r\n for i in range(0,34):\r\n for j in range(0,34):\r\n if 3*i+7*j==n:\r\n print(\"YES\")\r\n m=False\r\n break\r\n if 3*i+7*j>n:\r\n k=False\r\n break\r\n if not m or k:\r\n break\r\n k=True\r\n if m:\r\n for i in range(0,34):\r\n for j in range(0,34):\r\n if 3*i+7*j==n:\r\n print(\"YES\")\r\n m=False\r\n break\r\n if not m or k:\r\n break\r\n if m:\r\n print(\"NO\")\r\n \r\n \r\n \r\n", "for i in range(int(input())):\r\n\tx=int(input())\r\n\tflag=0\r\n\tfor i in range(x):\r\n\t\tfor j in range(x):\r\n\t\t\tif 3*i+7*j==x:\r\n\t\t\t\tans='YES'\r\n\t\t\t\tflag=1\r\n\t\t\t\tbreak\r\n\tif flag==0:\r\n\t\tprint('NO')\r\n\telse:\r\n\t\tprint('YES')\r\n", "n = int(input())\r\nres = []\r\ni = 0\r\nfor x in range(n):\r\n res.append('NO')\r\n a = int(input())\r\n for y in range(34):\r\n for z in range(34):\r\n if(y*7 + z*3 == a):\r\n res[x] = 'YES'\r\n break\r\nfor x in res:\r\n print(x)", "a=[0]*120\r\na[3]=1\r\na[7]=1\r\nfor i in range(100):\r\n if a[i]==1:\r\n a[i+3]=1\r\n a[i+7]=1\r\nn=int(input())\r\nfor i in range(n):\r\n if a[int(input())]==1:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "for _ in range(int(input())):\r\n n = int(input())\r\n if n % 3 == 0 or n % 7 == 0:\r\n print(\"YES\")\r\n else:\r\n f = 1\r\n for i in range(1, 26):\r\n x = n - 3 * i\r\n if x >= 0 and x % 7 == 0:\r\n f = 0\r\n break\r\n if f == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "import sys\r\nfrom itertools import*\r\nfrom cmath import *\r\ninput = sys.stdin.readline\r\nfrom math import*\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input().strip()))\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\nfor _ in range(int(input())):\r\n n=inp()\r\n flag=\"NO\"\r\n for i in range(n+1):\r\n for j in range(n+1):\r\n if i*3+j*7==n:\r\n flag=\"YES\"\r\n print(flag)", "n = int(input())\nfor _ in range(n):\n x = int(input())\n res = \"NO\"\n b = x // 7\n while b >= 0:\n a = (x - b * 7) // 3\n if x == a * 3 + b * 7:\n res = \"YES\"\n break\n b -= 1\n print(res)\n", "for _ in range(int(input())):print(\"NO\" if int(input()) in (1,2,4,5,8,11) else \"YES\")", "#a number can be expressed as a*3+b*7 where a and b are integers\ndef solve(n):\n ans = \"NO\"\n for a in range(0,(n//3)+2):\n for b in range(0,(n//7)+2):\n if (a*3+b*7)==n:\n ans=\"YES\"\n break\n return ans\nt = int(input())\nfor _ in range(t):\n n = int(input())\n ans = solve(n)\n print(ans)\n", "l=[1,2,4,5,8,11]\r\nfor u in range(int(input())):\r\n if(int(input()) in l):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n" ]

[ "\n\nn = int(input())\n\nA = set()\n\nfor _ in range(n):\n x, d = map(int, input().split())\n A.add((x, d))\n\nfound = False\n\nfor x, d in A:\n if (x + d, -d) in A:\n found = True\n\nif found:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "# n,m = map(lambda x: int(x), input().split())\r\n# n = int(input())\r\nimport collections\r\n\r\nn = int(input())\r\na=collections.defaultdict(lambda: -1)\r\nfor i in range(n):\r\n k,d = map(lambda x: int(x), input().split())\r\n a.setdefault(k, d+k)\r\n\r\ncol=list(a.items())\r\nfor i in col:\r\n if a[i[1]]==i[0]:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")\r\n\r\n\r\n", "def geti(a):\n return int(float(a))\nn=geti(input())\nx=[]\nd=[]\ntmp=''\nfor i in range(0,n):\n tmp=input().split()\n x.append(geti(tmp[0]))\n d.append(geti(tmp[1]))\nimport sys\nfor i in range(0,n):\n for j in range(i+1,n):\n if x[i]+d[i]==x[j] and x[j]+d[j]==x[i]:\n print('YES')\n sys.exit()\n break\nprint('NO')", "c=[tuple(map(int,input().split())) for _ in range(int(input()))]\r\nprint('YES' if any(sum(ci)==cj[0] and sum(cj)==ci[0] for ci in c for cj in c) else 'NO')\r\n", "n = int(input())\ns = set()\nfor i in range(n):\n\tx, d = [int(x) for x in input().split()]\n\tif (x + d, -d) in s:\n\t\tprint('YES')\n\t\texit()\n\ts.add((x, d))\nprint('NO')\n", "n = int(input())\r\nx = []\r\nd = []\r\nx_d = []\r\n\r\nfor i in range(n):\r\n a,b = map(int,input().split())\r\n x.append(a)\r\n d.append(b)\r\n x_d.append(a+b)\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n done=False\r\n if x_d[j]==x[i]:\r\n if x[j]==x_d[i]:\r\n print(\"YES\")\r\n done=True\r\n break\r\n if done==True:\r\n break\r\nif done==False:\r\n print(\"NO\")\r\n ", "import sys\r\nn=int(input())\r\na=[0]*n\r\nb=[0]*n\r\nfor i in range(n):\r\n a[i],b[i]=map(int,input().split())\r\n b[i]=a[i]+b[i]\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[i]==b[j] and b[i]==a[j] and i!=j:\r\n print(\"YES\")\r\n sys.exit()\r\nprint(\"NO\")", "n = int(input())\ncamels = {}\nfor _ in range(n):\n a, b = map(int, input().split())\n camels[a] = a + b\n\nfor c, t in camels.items():\n if t in camels and camels[t] == c:\n print(\"YES\")\n exit(0)\n\nprint(\"NO\")\n", "n = int(input())\r\n\r\ndata = []\r\nfor i in range(n):\r\n camel = list(map(int, input().split()))\r\n data.append(camel)\r\n\r\nans = \"NO\"\r\nfor i in range(n):\r\n for j in range(i+1, n):\r\n if data[i][0] + data[i][1] == data[j][0] and data[j][0] + data[j][1] == data[i][0]:\r\n ans = \"YES\"\r\n break\r\n if ans == \"YES\":\r\n break\r\n\r\nprint(ans)", "n = int(input())\n\npos, dis = [], []\nfor _ in range(n):\n posx, disx = map(int, input().split())\n pos.append(posx)\n dis.append(disx)\n\n\nfor i in range(n):\n posi, disi = pos[i], dis[i]\n alvo = posi + disi\n if alvo in pos:\n index = pos.index(alvo)\n contra = pos[index] + dis[index]\n if contra == posi:\n print(\"YES\")\n quit()\n\nprint(\"NO\")\n \t \t \t\t\t\t \t \t\t\t \t \t \t\t", "from collections import Counter\nt = int(input())\np = Counter()\nans = \"NO\"\nwhile t > 0:\n x, d = map(int,input().split())\n if p[x + d,x] == 1 :\n ans = \"YES\"\n else:\n p[x,x + d] = 1\n t -= 1\nprint(ans)\n", "n = int(input())\nc = []\nc2 = []\nsim=0\n\nfor i in range (n):\n a = str(input())\n a = a.split()\n c.append(int(a[0]))\n c2.append(int(a[1]))\n\nfor i in range (n):\n for j in range (n):\n if (c[i]+c2[i]==c[j] and c[j]+c2[j]==c[i] and i!=j):\n sim = 1\n\nif(sim==1):\n print(\"YES\")\nelse:\n print(\"NO\")\n \t \t\t \t \t\t\t \t\t\t \t\t \t \t", "def camels_spits():\n\tn = int(input())\n\n\tcamels_map = [0]*20001 # (-)-10000 + 10000 + 1 (referente ao zero) - Assim o vetor vai do 0 ao 20.000\n\tto_map = 10000\n\tcamels = []\n\n\tfor i in range(n):\n\t\tx, d = input().split()\n\t\tcamels.append({\"x\": int(x), \"d\": int(d)})\n\t\tcamels_map[int(x)+to_map] = {\"x\": int(x), \"d\": int(d)}\n\n\tfor camel in camels:\n\t\tspit_position1 = camel[\"x\"] + camel[\"d\"] + to_map\n\t\tif (spit_position1 >= 0 and spit_position1 <= 20000 and camels_map[spit_position1] != 0): # Primeiro camelo cuspiu em algum outro\n\t\t\tcamel2 = camels_map[spit_position1]\n\t\t\tspit_position2 = camel2[\"x\"] + camel2[\"d\"] + to_map\n\t\t\tif (spit_position2 >= 0 and spit_position2 <= 20000 and camels_map[spit_position2] == camel):\n\t\t\t\tprint(\"YES\")\n\t\t\t\treturn\n\n\tprint(\"NO\")\n\treturn\n\ncamels_spits()\n\n \t \t \t \t \t \t \t \t\t\t \t \t\t\t", "n = int(input())\r\nlocations = []\r\nspits = []\r\nfor i in range(n):\r\n temp = list(map(int, input().split()))\r\n # locations[i]=temp[0]\r\n # spits[i]=temp[1]\r\n locations.append(temp[0])\r\n spits.append(temp[1])\r\n\r\ni = 0\r\nwhile i < n:\r\n temp = locations[i] + spits[i]\r\n exists = temp in locations\r\n if exists:\r\n secondCamelIndex = locations.index(temp)\r\n if (exists and\r\n locations[secondCamelIndex] + spits[secondCamelIndex] == locations[i]):\r\n break\r\n i += 1\r\n\r\nprint(\"NO\" if i == n else \"YES\")\r\n", "n = int(input())\r\nhashMap = {}\r\nflag = \"NO\"\r\n\r\nfor _ in range(n):\r\n x, d = map(int, input().split())\r\n\r\n pos = x + d\r\n hashMap[x] = pos\r\n \r\n if pos in hashMap and hashMap[pos] == x:\r\n flag = \"YES\"\r\n\r\nprint(flag)", "def __main__():\r\n n = int(input())\r\n a = []\r\n b =[] \r\n for i in range(n):\r\n x, d = map(int, input().split())\r\n a.append(x)\r\n b.append(d)\r\n for i in range(n):\r\n for j in range(i+1,n):\r\n if (a[i]+b[i]==a[j]) and (a[j]+b[j]==a[i]):\r\n print('Yes')\r\n return\r\n print('No')\r\n\r\n__main__()", "\r\nrpta = False\r\n\r\nn = int(input())\r\n\r\nx = []\r\nd = []\r\nfor i in range(n):\r\n datos = input().split()\r\n x.append(int(datos[0]))\r\n d.append(int(datos[1]))\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if x[i]+d[i] == x[j] and x[j]+d[j] == x[i]:\r\n rpta = True\r\n break;\r\n if rpta:\r\n break\r\nif rpta:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n=int(input())\r\nX=[]\r\nXD=False\r\nfor i in range(n):\r\n x,d=list(map(int,input().split(' ')))\r\n X.append([x,x+d])\r\n if([x+d,x] in X):\r\n XD=True\r\nif XD: print('YES')\r\nelse: print('NO')", "def sol():\r\n n = int(input())\r\n l = []\r\n for i in range(n):\r\n l.append(list(map(int,input().split())))\r\n for i in range(n-1):\r\n x, d = l[i]\r\n for j in range(i+1,n):\r\n xj, dj = l[j]\r\n if x+d == xj and x == xj+dj:\r\n print(\"YES\")\r\n return\r\n print(\"NO\")\r\n\r\nsol()", "n = int(input())\r\ncont, ans = {}, 'NO'\r\n\r\nfor i in range(n):\r\n pos, spit = [int(item) for item in input().split(' ')]\r\n cont[pos] = spit\r\n\r\nfor pos in cont:\r\n secondCamel = pos + cont[pos]\r\n if secondCamel in cont and secondCamel + cont[secondCamel] == pos:\r\n ans = 'YES'\r\n break\r\nprint(ans)", "n = int(input())\r\na = [tuple(map(int, input().split())) for _ in range(n)]\r\nfor i in range(n-1):\r\n for j in range(i+1,n):\r\n if a[i][0]+a[i][1] == a[j][0] and a[j][0]+a[j][1] == a[i][0]:\r\n print (\"YES\")\r\n exit()\r\nprint (\"NO\")", "import sys\r\n\r\ndef get_lines_with_nums():\r\n out_list = []\r\n\r\n for line in sys.stdin:\r\n line = [int(x) for x in line.split(' ')]\r\n out_list.append(line)\r\n return out_list\r\n\r\nans = False\r\nli = get_lines_with_nums()\r\nthrows = li[1:]\r\nstart_target = [sorted([x[0],x[0]+x[1]]) for x in throws]\r\nfor i in start_target:\r\n if start_target.count(i)>1:\r\n ans = True\r\nif ans:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\npos = []\r\ncan = False\r\nfor i in range(n):\r\n pos.append(list(map(int, input().split())))\r\nfor i in range(n-1):\r\n curr = pos[i][0] + pos[i][1]\r\n for j in range(i,n):\r\n curr1 = pos[j][0] + pos[j][1]\r\n if curr == pos[j][0] and curr1 == pos[i][0]:\r\n can = True\r\n break\r\nif can :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\ninput = lambda: sys.stdin.readline().strip()\n\nn=int(input())\ngrid=[list(map(int,input().split())) for _ in range(n)]\nf=False\nfor i in range(n):\n\tfor j in range(i+1,n):\n\t\tif sum(grid[i])==grid[j][0] and sum(grid[j])==grid[i][0]:\n\t\t\tif not f:print(\"YES\")\n\t\t\tf=True\n\t\t\tbreak\nif not f:print(\"NO\")", "n = int(input())\r\na = [None] * n\r\nb = [None] * n\r\nfor i in range(n):\r\n a[i], b[i] = map(int, input().split())\r\nspit = False\r\nfor i in range(n):\r\n w = a[i] + b[i]\r\n if w in a:\r\n if b[a.index(w)] == -b[i]:\r\n spit = True\r\n break\r\nif spit:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nb = 0\r\nx = [0] * 105\r\nd = [0] * 105\r\ns = \"\"\r\nl = []\r\nfor i in range(0,n):\r\n s = str(input())\r\n l = list(s.split())\r\n x[i] = int(l[0])\r\n d[i] = int(l[1])\r\nfor i in range(0,n):\r\n for j in range(i + 1,n):\r\n if((x[i] + d[i]) == x[j]):\r\n if((x[j] + d[j]) == x[i]):\r\n b = 1\r\nif(b == 1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "n=int(input())\r\nxval=[ ]\r\nval=[ ]\r\nfor i in range (0,n):\r\n x,d=map(int,input().split())\r\n xval.append(x)\r\n val.append(x+d)\r\nohk=False\r\nfor j in range (0,n):\r\n if(val[j] in xval and val[xval.index(val[j])]==xval[j]):\r\n print('YES')\r\n ohk=True\r\n break\r\nif not ohk:\r\n print('NO')\r\n\r\n\r\n", "def camels(lst1, lst2, n):\r\n flag = 0\r\n for i in range(n):\r\n for j in range(n):\r\n if i == j:\r\n continue\r\n if lst1[i] + lst2[i] == lst1[j] and lst1[j] + lst2[j] == lst1[i]:\r\n flag = 1\r\n if flag == 1:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\n\r\nm = int(input())\r\nb, c = list(), list()\r\nfor i in range(m):\r\n h, a = [int(i) for i in input().split()]\r\n b.append(h)\r\n c.append(a)\r\nprint(camels(b, c, m))\r\n", "# 29A\r\n\r\nfrom sys import stdin\r\n\r\n__author__ = 'artyom'\r\n\r\n\r\ndef read_int():\r\n return int(stdin.readline().strip())\r\n\r\n\r\ndef read_int_ary():\r\n return list(map(int, stdin.readline().strip().split()))\r\n\r\n\r\ncams = []\r\nn = read_int()\r\nfor _ in range(n):\r\n cams.append(read_int_ary())\r\n\r\nfor i in range(n):\r\n dest = cams[i][0] + cams[i][1]\r\n for j in range(i + 1, n):\r\n if cams[j][0] == dest and cams[j][0] + cams[j][1] == cams[i][0]:\r\n print('YES')\r\n exit()\r\nprint('NO')", "camels = int(input())\n\nl = [tuple(map(int, input().split())) for _ in range(camels)]\nfound = False\nfor i, t1 in enumerate(l[:-1]):\n c1, s1 = t1\n for j, t2 in enumerate(l[i+1:]):\n c2, s2 = t2\n found |= c1 + s1 == c2 and c2 + s2 == c1\n\nanswer = \"YES\" if found else \"NO\"\nprint(answer)", "t=[]\r\n\r\n\r\np=[]\r\n\r\nv=int(input())\r\nfor i in range(v):\r\n a=list(map(int,input().split()))\r\n\r\n t.append(a[0])\r\n p.append(sum(a))\r\n\r\nb=0\r\nfor j in range(v):\r\n if p[j] in t:\r\n if p[t.index(p[j])]==t[j]:\r\n print('YES')\r\n b+=1\r\n break\r\n else:\r\n pass\r\nif b==0:\r\n print('NO')\r\n", "n=int(input())\r\nx=[];d=[];ans='NO'\r\nfor test in range(n):\r\n xt,dt=map(int,input().split())\r\n x.append(xt);d.append(dt)\r\nfor i in range(n):\r\n pos=x[i]+d[i]\r\n if pos not in x:continue\r\n tempi=x.index(pos)\r\n r=x[tempi]+d[tempi]\r\n if r==x[i]:ans='YES';break\r\nprint(ans)", "def main():\n n = int(input())\n\n camPos = []\n camSpit = [-1 for i in range(n)]\n\n didSpit = False\n\n for i in range(n):\n x, d = map(int, input().split())\n camPos.append(x)\n spit = x + d\n camSpit[i] = spit\n\n if spit in camPos:\n indexA = camPos.index(spit)\n\n if camSpit[indexA] == camPos[i]:\n didSpit = True\n \n if didSpit:\n print(\"YES\")\n else:\n print(\"NO\")\n\nmain()\n\t \t \t \t \t \t\t\t \t \t\t\t \t\t\t\t", "loc = []\nfor notused in range(int(input())):\n\tentry = list(map(int, input().split(\" \")))\n\tloc.append((entry[0], entry[1]))\nloc.sort()\nlocations = [x[0] for x in loc]\nhit = []\nfor i in range(len(loc)):\n\tif loc[i][0]+loc[i][1] in locations:\n\t\thit.append((i, locations.index(loc[i][0]+loc[i][1])))\ntoprint = \"NO\"\nfor i in range(len(hit)):\n\tif (hit[i][1], hit[i][0]) in hit:\n\t\ttoprint = \"YES\"\n\t\tbreak;\nprint(toprint)", "n=int(input())\r\na=[]\r\nb=[]\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n a.append(x)\r\n b.append(y)\r\nf=0\r\nfor i in range(n):\r\n x=a[i]\r\n y=b[i]\r\n d=x+y\r\n for j in range(0,i):\r\n if a[j]==d and (b[j]+a[j])==x:\r\n f=1\r\n break\r\n if f==1:\r\n break\r\n for j in range(i+1,n):\r\n if a[j]==d and (b[j]+a[j])==x:\r\n f=1\r\n break\r\n if f==1:\r\n break\r\nif f==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "Input=lambda:map(int,input().split())\n \nn = int(input())\ncamels = list()\nfor i in range(n):\n x ,d = Input()\n for j in camels:\n if abs(j[0] - x) == abs(j[1]) and j[1] + d== 0:\n print(\"YES\")\n exit()\n camels.append([x,d])\nprint(\"NO\")\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue May 5 14:08:51 2020\r\n\r\n@author: alexi\r\n\"\"\"\r\n\r\n\r\n\r\n#https://codeforces.com/problemset/problem/29/A --- Alexis Galvan\r\n\r\n\r\ndef spit_camels():\r\n \r\n camels = int(input())\r\n spit = [list(map(int, input().split())) for i in range(camels)]\r\n \r\n spited = {}\r\n \r\n for i in range(len(spit)):\r\n spited[spit[i][0]] = spit[i][0] + spit[i][1]\r\n \r\n for i in range(len(spited)):\r\n\r\n temp = spit[i][1] + spit[i][0]\r\n \r\n if temp in spited:\r\n if spited[temp] == spit[i][0]:\r\n return 'YES'\r\n \r\n return 'NO'\r\n\r\nA = spit_camels()\r\nprint(A)\r\n ", "n = int(input())\r\ns = [[int(i) for i in input().split()] for i in range(n)]\r\ncnt = 0\r\n\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif i!=j:\r\n\t\t\tif (s[i][1]+s[i][0])==s[j][0] and (s[j][1]+s[j][0])==s[i][0]:\r\n\t\t\t\tcnt+=1\r\n\r\nif cnt:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "c = []\nd = []\nfor x in range(int(input())):\n\ta,b = map(int,input().split())\n\tc.append(a)\n\td.append(a + b)\nfor x in d:\n\tif x in c:\n\t\th = d.index(x)\n\t\tg = c.index(x)\n\t\tif d[g] == c[h]:\n\t\t\tprint(\"YES\")\n\t\t\tbreak\nelse:\n\tprint(\"NO\")", "Camels = dict()\r\nN = int(input())\r\nfor i in range(N):\r\n X = list(map(int, input().split()))\r\n if X[0] + X[1] in Camels.keys():\r\n if Camels[X[0] + X[1]] == X[0]:\r\n print(\"YES\")\r\n exit()\r\n Camels[X[0]] = X[0] + X[1]\r\nprint(\"NO\")\r\n\r\n\r\n# UB_CodeForces\r\n# Advice: Lova everyone in the world\r\n# Location: Where I belong to \r\n# Caption: Happy with family", "n = int(input())\r\nx = list()\r\nd = list()\r\ncount = False\r\nfor p in range(n):\r\n a, b = map(int, input().split())\r\n x.append(a)\r\n d.append(b)\r\nfor p in range(n):\r\n for q in range(n):\r\n if p != q:\r\n if x[p]+d[p] == x[q] and x[q]+d[q] == x[p]:\r\n count = True\r\nif count == True:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\nlst = []\r\nfor i in range(n):\r\n\tx, d = map(int, input().split())\r\n\tspit = x+d\r\n\tlst.append([x, spit])\r\n\r\ntruth = False\r\nfor x in lst:\r\n\tif x[::-1] in lst:\r\n\t\ttruth = True\r\n\t\tbreak\r\n\t\r\nprint(('NO', 'YES')[truth])", "n = int(input())\r\ncamel = {}\r\nfound = False\r\nfor _ in range(n):\r\n x, d = map(int, input().split())\r\n d = x + d\r\n camel[x] = d\r\n if d in camel and camel[d] == x:\r\n found = True\r\nprint(\"YES\" if found else \"NO\")# 1698075346.5128458", "camels, spit_location = [],[]\r\ncamels_spaton =[]\r\nflag =0\r\nfor T in range(int(input())):\r\n temp = input().split()\r\n camels.append(int(temp[0]))\r\n spit_location.append(int(temp[1])+int(temp[0]))\r\n\r\nfor idx,i in enumerate(spit_location):\r\n if i in camels:\r\n camels_spaton.append([i,spit_location])\r\n if spit_location[camels.index(i)] == camels[idx]:\r\n print(\"YES\")\r\n flag =1\r\n break\r\nif not flag:\r\n print(\"NO\")\r\n\r\n\r\n", "n = int(input())\nli = []\ndic = {}\nfor i in range(n):\n li.append(tuple(map(int,input().split())))\nfor i in li:\n dic.update({i[0]:sum(i)})\nfor k,v in dic.items():\n if (v,k) in dic.items():\n print('YES')\n break\nelse:\n print('NO')", "import itertools\r\n\r\nn = int(input())\r\n\r\nvals = []\r\n\r\nfor i in range(0,n):\r\n a,b = map(int,input().split())\r\n c = a+b\r\n arr = sorted([a,c])\r\n vals.append(arr)\r\n\r\ncombos = list(itertools.combinations(vals,2))\r\n\r\nans = 'NO'\r\n\r\nfor combo in combos:\r\n if combo[0] == combo[1]:\r\n ans = \"YES\"\r\n break\r\n\r\nprint(ans)", "n=int(input())\r\ndis={}\r\nfor i in range(n):\r\n a,b=(int(i) for i in input().split())\r\n dis[a]=b\r\n if a+b in dis:\r\n if dis[a+b]+a+b==a:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')\r\n \r\n", "n = int(input())\r\nmy_dict = dict()\r\nans = \"NO\"\r\nwhile n > 0:\r\n pos, spit = [int(item) for item in input().split(' ')]\r\n my_dict[pos] = spit\r\n n -= 1\r\nfor key in my_dict:\r\n secondCamel = key + my_dict[key]\r\n if secondCamel in my_dict and secondCamel + my_dict[secondCamel] == key :\r\n ans = \"YES\"\r\n break\r\nprint(ans)\r\n", "n=int(input())\r\nd={}\r\nf=0\r\nfor _ in range(n):\r\n l=list(map(int,input().split()))\r\n d[l[0]]=l[1]+l[0]\r\nfor x in d:\r\n if d[x] in d and d[d[x]] in d:\r\n if d[d[x]]==x:\r\n f=1\r\n break\r\nif f==0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n\r\n", "n=int(input())\r\narr=[]\r\nfor i in range(n):\r\n arr.append([])\r\n arr[i]=[int(z) for z in input().split()]\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n if arr[i][0]+arr[i][1]==arr[j][0] and arr[j][0]+arr[j][1]==arr[i][0]:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")\r\n ", "n = int(input())\r\nx = [0]*n\r\nd = [0]*n\r\nfor i in range(n):\r\n xi, di = map(int,input().split())\r\n x[i] = xi\r\n d[i] = di\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n if x[i] + d[i] == x[j] and x[j] + d[j] == x[i]:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")", "a,b = [],{}\r\nfor _ in range(int(input())):\r\n\tx,d = map(int,input().split())\r\n\ta.append(x)\r\n\tb[x] = x+d\r\n\t\r\nfor i in b:\r\n\tif b[i] in b and b[b[i]] == i: print(\"YES\");break\r\nelse: print(\"NO\")", "n=int(input())\r\nl=[]\r\np=[]\r\nfor i in range(n):\r\n x,d=map(int,input().split())\r\n l.append(x+d)\r\n p.append(x)\r\nfor i in range(n):\r\n if(p[i] in l):\r\n if(l[i]==p[l.index(p[i])]):\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\") ", "n = int(input())\r\nlst = []\r\ndct = {}\r\nfor i in range(n):\r\n a, b = map(int, input().strip().split())\r\n lst.append([a, b])\r\n dct.update({a: i})\r\n\r\nans = 'NO'\r\nfor i in range(n):\r\n check = lst[i][0] + lst[i][1]\r\n try:\r\n ind = dct[check]\r\n if lst[ind][0] + lst[ind][1] == lst[i][0]:\r\n ans = 'YES'\r\n break\r\n except KeyError:\r\n continue\r\nprint(ans)\r\n", "n = int(input())\r\nspits = []\r\nfor _ in range(n):\r\n x, d = map(int, input().split())\r\n spits.append((x, d))\r\nspits.sort()\r\nfor i in range(n):\r\n for j in range(i + 1, n):\r\n if spits[i][0] + spits[i][1] == spits[j][0] and spits[j][0] + spits[j][1] == spits[i][0]:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")", "N = int(input())\r\n\r\nX = []\r\n\r\nfor n in range(N):\r\n p, d = map(int, input().split())\r\n X += [[p, d]]\r\n\r\nf = False\r\n\r\nfor i in range(N - 1):\r\n for j in range(i + 1, N):\r\n if X[i][0] + X[i][1] == X[j][0] and X[j][0] + X[j][1] == X[i][0]:\r\n f = True\r\n break\r\n\r\nif f:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def main():\r\n t = int(input())\r\n coor = []\r\n for _ in range(t):\r\n a, b = map(int, input().split())\r\n coor.append([a, a+b])\r\n for i in range(t-1):\r\n for j in range(i+1, t):\r\n if coor[i][0] == coor[j][1] and coor[i][1] == coor[j][0]:\r\n print('YES')\r\n return\r\n print('NO')\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "import sys \r\n# sys.stdin = open('input.txt', 'r') \r\n# sys.stdout = open('output.txt', 'w') \r\n \r\n\r\n\r\n# T = int(input())\r\n# for t in range(T):\r\nn = int(input())\r\narr = []\r\nfor i in range(n):\r\n x,y = map(int,input().split())\r\n arr.append([x,y])\r\nflag=0\r\n# print(arr)\r\nfor i in arr:\r\n \r\n if [i[0]+i[1],-i[1]] in arr:\r\n flag=1\r\n break\r\nif flag==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n\r\n\r\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nmemo = {}\r\n\r\nfor i in range(n):\r\n data = list(map(int, input().split()))\r\n memo[data[0]] = data[1]\r\n\r\nflag = False\r\nfor i in memo.keys():\r\n if (i + memo[i]) in memo:\r\n if memo[i + memo[i]] + i + memo[i] == i:\r\n flag = True\r\n break\r\n\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nd = {}\r\nfor i in range(n):\r\n n, k = map(int, input().split())\r\n d.update({n: k})\r\nf = 0\r\nfor i in d.keys():\r\n s = i + d[i]\r\n v = d.get(s, None)\r\n if v == None:\r\n continue\r\n s = s + v\r\n if s == i:\r\n print(\"YES\")\r\n f = 1\r\n break\r\nif f == 0:\r\n print(\"NO\")\r\n", "D = {}\r\nflag = 0\r\nn = int(input())\r\nA = ''\r\nfor i in range(n):\r\n x,d = map(int,input().split())\r\n D[x] = x+d\r\n if (x+d) in D and D[x+d] == x:\r\n if flag == 0:\r\n A += 'YES'\r\n flag += 1\r\n\r\nif flag ==0:\r\n print('NO')\r\nelse:\r\n print(A)", "x = []\r\nd = []\r\nfor i in ' '*int(input()):\r\n x2, d2 = map(int, input().split())\r\n x.append(x2)\r\n d.append(d2)\r\nf = 0\r\nkol = 0\r\nfor i in range(len(x)):\r\n for j in range(len(x)):\r\n if x[i]+d[i] == x[j] and x[j] + d[j] == x[i] and kol != 2:\r\n f = 1\r\n kol += 1\r\nprint('YES' if f == 1 else 'NO')\r\n", "from collections import deque, defaultdict, Counter\r\nfrom itertools import product, groupby, permutations, combinations\r\nfrom math import gcd, floor, inf, log2, sqrt, log10\r\nfrom bisect import bisect_right, bisect_left\r\n\r\ncases = int(input())\r\n\r\nspitted = set()\r\nfor _ in range(cases):\r\n x, y = map(int, input().split())\r\n nw = (x, x+y)\r\n if (x+y, x) in spitted:\r\n print(\"YES\")\r\n exit()\r\n spitted.add(nw)\r\nprint(\"NO\")\r\n\r\n\r\n\r\n", "camels = int(input())\nnotepad = {}\n\nresult = \"NO\"\n\nfor i in range(camels):\n data = input().split(\" \")\n\n current_camel = int(data[0])\n camel_target = current_camel + int(data[1])\n\n index_source = str(current_camel) + \" \" + str(camel_target)\n index_target = str(camel_target) + \" \" + str(current_camel)\n\n notepad[index_source] = True\n\n if notepad.get(index_target) is not None:\n result = \"YES\"\n break\n\nprint(result)\n\n\n\n \t \t \t \t \t \t\t \t \t\t\t\t \t", "n = int(input())\r\na = []\r\nb = []\r\nfor _ in range(n):\r\n i = []\r\n i = input().split()\r\n a.append(int(i[0]))\r\n b.append(int(i[1]))\r\nf = False\r\nfor i in range(len(a)):\r\n for j in range(len(b)):\r\n if a[i] + b[i] == a[j] and b[j] == 0 - b[i]:\r\n f = True\r\n break\r\n if f:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')\r\n", "n=int(input())\r\nA=[tuple(map(int,input().split())) for i in range(n)]\r\n\r\nflag=0\r\n\r\nfor i in range(n):\r\n x,y=A[i]\r\n for j in range(i+1,n):\r\n z,w=A[j]\r\n\r\n if x+y==z and z+w==x:\r\n flag=1\r\n\r\nif flag==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\nl=0\r\na={}\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n a[x]=x+y\r\nfor j in a:\r\n try:\r\n if j==a[a[j]]:\r\n print(\"YES\")\r\n break\r\n else:\r\n l+=1\r\n except:\r\n l+=1\r\n continue\r\nif l==len(a):\r\n print(\"NO\")", "z = int(input())\r\npos = []\r\nspit = []\r\nr = \"NO\"\r\nwhile z:\r\n n,m = map(int, input().rstrip().split(\" \"))\r\n if n + m in pos:\r\n f = pos.index(n+m)\r\n if pos[f]+spit[f]==n:\r\n r = \"YES\"\r\n pos.append(n)\r\n spit.append(m)\r\n z-=1\r\nprint(r)", "n = int(input())\r\nx = [None] * n\r\nd = [None] * n\r\nfor i in range(n):\r\n x[i], d[i] = map(int, input().split())\r\nf = False\r\nfor i in range(n):\r\n j = x[i] + d[i]\r\n if x.count(j) == 1 and d[x.index(j)] == -d[i]:\r\n f = True\r\nif f == True:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def cuspe_mutuo(n, cuspes):\n for i in range(n):\n cuspidor = cuspes[i][0];\n alvo = cuspes[i][0] + cuspes[i][1];\n for camelo_cuspe in cuspes:\n if (alvo == camelo_cuspe[0]):\n if(camelo_cuspe[0] + camelo_cuspe[1] == cuspidor):\n return True;\n return False;\n\ndef main():\n n = int(input());\n cuspes = [];\n for i in range(n):\n entrada = input().split();\n cuspes.append((int(entrada[0]), int(entrada[1])));\n if(cuspe_mutuo(n, cuspes)):\n print(\"YES\");\n else:\n print(\"NO\");\n \n \n\nmain();\n\t \t\t \t\t \t\t\t \t\t \t\t\t \t\t", "n = int(input())\nx_s = []\nd_s = []\nfor i in range(n):\n x, d = input().split()\n x = int(x)\n d = int(d)\n x_s.append(x)\n d_i = x+d\n d_s.append(d_i)\n if (x in d_s) and x_s[d_s.index(x)] == x:\n print('YES')\n exit(0)\n if d_i in x_s and d_s[x_s.index(d_i)] == x:\n print('YES')\n exit(0)\nprint('NO')\n\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\nxd = [list(map(int, input().split())) for _ in range(n)]\r\nans = \"NO\"\r\nfor i in range(n):\r\n xi, di = xd[i]\r\n for j in range(i + 1, n):\r\n xj, dj = xd[j]\r\n if xi == xj + dj and xj == xi + di:\r\n ans = \"YES\"\r\nprint(ans)", "def solve():\r\n n = int(input())\r\n camels = {}\r\n for i in range(n):\r\n x, d = [int(s) for s in input().split(' ')]\r\n camels[x] = d\r\n for c in camels:\r\n y = c + camels[c]\r\n if y in camels and camels[y] == -camels[c]:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\nprint(solve())", "n=int(input())\r\ns=[]\r\nfor i in range(n):\r\n\tss=input().split()\r\n\tss[0]=int(ss[0])\r\n\tss[1]=int(ss[1])\r\n\ts.append(ss)\r\ntt=False\r\nfor i in range(n):\r\n\tr=s[i][0]+s[i][1]\r\n\tfor y in range(1,n):\r\n\t\tif r==s[y][0]:\r\n\t\t\tt=s[y][0]+s[y][1]\r\n\t\t\tif t==s[i][0]:\r\n\t\t\t\ttt=True\r\n\t\t\t\tbreak\r\nif tt==False:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")", "n = int(input())\r\ng = []\r\nfor i in range(n):\r\n b = tuple(map(int, input().split()))\r\n g.append(b)\r\nx = [g[i][0] for i in range(len(g))]\r\ny = []\r\nfor j in range(len(g)):\r\n h = g[j][0] + g[j][1]\r\n y.append(h)\r\nk = list(zip(x, y))\r\np = 0\r\nfor i in range(len(k)):\r\n for l in range(i, len(k)):\r\n if k[i] == k[l][::-1]:\r\n p += 1\r\n else:\r\n continue\r\nif p == 0:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "n = int(input())\r\nmp = {}\r\nfor _ in range(n):\r\n x, d = map(int, input().split())\r\n mp[x] = x + d\r\nfor x, y in mp.items():\r\n if y not in mp : continue\r\n if mp[x] == y and mp[y] == x:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')", "\r\nn = int(input())\r\n\r\nd = dict()\r\nfor _ in range(n):\r\n\tpos, throw = map(int, input().split())\r\n\r\n\ttarget = pos + throw\r\n\tif target in d and d[target] == pos:\r\n\t\tprint('YES')\r\n\t\texit()\r\n\telse:\r\n\t\td[pos] = target\r\n\r\n\r\nprint('NO')\r\n", "\r\n\r\nt=int(input())\r\nx=[]\r\ny=[]\r\nfor i in range(0,t):\r\n a,b=list(map(int,input().split()))\r\n x.append(a)\r\n y.append(b)\r\nfor i in range(0,t-1):\r\n z=0\r\n for j in range(i+1,t):\r\n if (x[i]+y[i])==x[j] and (x[j]+y[j])==x[i]:\r\n z=1\r\n break\r\n else:\r\n continue\r\n if z==1:\r\n break\r\n else:\r\n continue\r\nif z==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "camels = int(input())\n\nl = [tuple(map(int, input().split())) for _ in range(camels)]\nfound = False\nfor i in range(len(l) - 1):\n c1, s1 = l[i]\n for j in range(i + 1, len(l)):\n c2, s2 = l[j]\n found |= c1 + s1 == c2 and c2 + s2 == c1\n\nanswer = \"YES\" if found else \"NO\"\nprint(answer)", "n = int(input())\n\nl = []\nl2 = []\nfor i in range(n):\n a, b = map(int, input().split())\n l.append(a)\n l2.append(a + b)\n\nban = False\nfor i in range(len(l)):\n for j in range(len(l2)):\n if l[i] == l2[j] and l2[i] == l[j]:\n ban = True\n break\n if ban:\n break\n\nif ban:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\t \t \t\t\t\t\t \t \t\t\t \t \t\t", "#----------------------------\n# Matheus de Souza Oliveira |\n# RA: 102307 |\n#----------------------------\n\nnumberOfCamels = int(input())\naux = numberOfCamels\nxPositions = []\nspitDistances = []\n\nwhile aux != 0:\n position, distance = list(map(int, input().split()))\n xPositions.append(position)\n spitDistances.append(distance)\n aux -= 1\n\nspittedEachOther = False\n\nfor i in range(numberOfCamels):\n for j in range(i):\n \n if xPositions[i] + spitDistances[i] == xPositions[j] and xPositions[j] + spitDistances[j] == xPositions[i]:\n spittedEachOther = True\n break\n\n if spittedEachOther:\n break\n\nif spittedEachOther:\n print(\"YES\")\n\nelse:\n print(\"NO\")\n \t\t\t \t\t\t \t\t\t \t \t \t\t \t", "n = int(input())\r\narr =[]\r\nsol = []\r\nfor i in range(n):\r\n a = list(map(int,input().split()))\r\n arr.append(a)\r\n\r\nfor j in range(n):\r\n arr[j][1] = arr[j][0] + arr[j][1]\r\n if arr[j][::-1] in sol:\r\n print(\"Yes\")\r\n exit(0)\r\n else:\r\n sol.append(arr[j])\r\nprint(\"No\")\r\n\r\n", "def main():\n n = int(input())\n expects = set()\n find = False\n for _ in range(n):\n if find:\n input()\n else:\n spit = tuple(map(int, input().split()))\n if spit in expects:\n find = True\n else:\n x, d = spit\n expected = (x + d, -d)\n expects.add(expected)\n\n print('YES' if find else 'NO')\n\nmain()", "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=int(input())\r\narr=set()\r\nfor _ in range(Z):\r\n i,d=map(int,input().split())\r\n arr.add(tuple(sorted((i,i+d))))\r\n# print(arr) \r\nprint('yes' if len(arr) != Z else 'no') \r\n ", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-27 22:24:08\nLastEditTime: 2021-11-27 22:31:19\nDescription: Spit Problem\nFilePath: CF29A.py\n'''\n\n\ndef func():\n n = int(input())\n point, distance = [0] * n, [0] * n\n for i in range(n):\n point[i], distance[i] = map(int, input().strip().split())\n\n for i in range(n - 1):\n for j in range(i + 1, n):\n if point[i] + distance[i] == point[j] and point[j] + distance[j] == point[i]:\n print(\"YES\")\n return\n else:\n print(\"NO\")\n\n\nif __name__ == '__main__':\n func()\n", "N, ans = int(input()), 'NO'\r\ncont = {}\r\nfor i in range(N):\r\n pos, spit = [int(item) for item in input().split()]\r\n cont[pos]=spit\r\n\r\nfor key in cont:\r\n secondCamel = key + cont[key]\r\n if secondCamel in cont and secondCamel + cont[secondCamel] == key:\r\n ans = \"YES\"\r\n break\r\n\r\nprint(ans)\r\n\r\n\r\n", "n = int(input())\narr = set()\nf = False\nfor i in range(n):\n a = list(map(int,input().split()))\n if not f:\n a[1] +=a[0]\n if (a[1],a[0]) in arr:\n f = True\n \n arr.add((a[0],a[1]))\nif f:\n print(\"YES\")\nelse:\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\nimport datetime\r\n# import webbrowser\r\n\r\n\r\nn = int(input())\r\ncamel = []\r\nshit = []\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n camel.append(x)\r\n shit.append(y)\r\nfor i in range(n):\r\n flag = 0\r\n for j in range(0, n):\r\n if i != j:\r\n if (camel[i] + shit[i] == camel[j]) and (camel[j] + shit[j] == camel[i]):\r\n flag = 1\r\n print(\"YES\")\r\n break\r\n if flag == 1:\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\ncam = []\r\nfor i in range(n):\r\n cam.append(list(map(int, input().split())))\r\n\r\nwhom = {}\r\nfor i in range(n):\r\n to = 0\r\n to = int(cam[i][0]+cam[i][1])\r\n\r\n whom[cam[i][0]] = to\r\n\r\n if to in whom.keys():\r\n target = whom.get(to)\r\n #print('target', target)\r\n #print('to', to)\r\n if target == cam[i][0] :\r\n print('YES')\r\n exit()\r\nprint('NO')\r\n", "camels = int(input())\r\narray = []\r\nfor i in range(camels):\r\n camel = input().split()\r\n array.append(camel)\r\nnum = 0\r\nthing = True\r\nfor i in array:\r\n num = int(i[0]) + int(i[1])\r\n for j in array:\r\n if int(j[0]) == num:\r\n if int(j[0]) + int(j[1]) == int(i[0]):\r\n print('YES')\r\n thing = False\r\n break\r\n if not thing:\r\n break\r\nif thing:\r\n print('NO')\r\n", "n=int(input())\r\na=[]\r\nfor i in range (n):\r\n x,y=map(int,input().split())\r\n a.append([x,y])\r\nfor i in range (n):\r\n for j in range(i):\r\n if ((a[i][0]+a[i][1]==a[j][0]) and (a[j][0]+a[j][1]==a[i][0])):\r\n print(\"Yes\")\r\n exit()\r\nprint(\"No\")\r\n\r\n", "# n = int(input())\r\n# camels = []\r\n# ans = \"\"\r\n# while n > 0:\r\n# line = [int(item) for item in input().split(' ')]\r\n# camels.append(line[0])\r\n# camels.append(line[1])\r\n# for i in range(0, 2 * n - 2, 2):\r\n# for j in range(i + 2, 2 * n - 1, 2):\r\n# if camels[i] + camels[i + 1] == camels[j] and camels[j] + camels[j + 1] == camels[i]:\r\n# ans = \"YES\"\r\n# break\r\n# else:\r\n# ans = \"NO\"\r\n# if ans == 'YES':\r\n# break\r\n#\r\n# print(ans)\r\n\r\nn = int(input())\r\nmyDict = dict()\r\nans = 'NO'\r\n\r\nfor i in range(n):\r\n pos, spit = [int(item) for item in input().split(' ')]\r\n myDict[pos] = spit\r\n\r\nfor key, value in myDict.items():\r\n secCam = key + value\r\n if secCam in myDict and myDict[secCam] + secCam == key:\r\n ans = \"YES\"\r\n break\r\n\r\nprint(ans)\r\n", "n = int(input())\r\n\r\nx, d = [], []\r\n\r\ns = \"NO\"\r\n\r\nfor i in range(n):\r\n\tl = list(map(int, input().split()))\r\n\t\r\n\tx.append(l[0])\r\n\td.append(l[1])\r\n\t\r\nfor i in range(n):\r\n\tc = x[i] + d[i]\r\n\t\r\n\tif c in x and c + d[x.index(c)] == x[i]:\r\n\t\ts = \"YES\"\r\n\t\t\r\nprint(s)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nnotepad = [list(map(int, input().split())) for _ in range(n)]\r\n\r\nres = 'NO'\r\nfor i in range(n):\r\n for j in range(i + 1, n):\r\n if notepad[i][0] + notepad[i][1] == notepad[j][0] and notepad[j][0] + notepad[j][1] == notepad[i][0]:\r\n res = 'YES'\r\nprint(res)", "n = int(input())\r\na = []\r\nb = []\r\nk = 0\r\nfor i in range(n):\r\n x, d = map(int, input().split())\r\n a.append(x)\r\n b.append(d)\r\nfor i in range(n):\r\n for j in range(i + 1, n):\r\n if (a[i] + b[i] == a[j]) and (a[j] + b[j] == a[i]):\r\n k += 1\r\nif k == 0:\r\n print('NO')\r\nelse:\r\n print('YES')", "lines = [w.rstrip() for w in open(0).readlines()]\r\nt = int(lines[0])\r\ns = set()\r\nfor line in lines[1:]:\r\n x, d = map(int, line.split())\r\n y = x + d\r\n if (y, x) in s:\r\n print(\"YES\")\r\n break\r\n s.add((x,y))\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\na=[]\r\nc=0\r\nb=[]\r\nfor i in range(n):\r\n x,y=[int(i) for i in input().split()]\r\n y=y+x\r\n a.append(x)\r\n b.append(y)\r\nfor i in range(n):\r\n for j in range(n):\r\n if(a[i]==b[j]) and(a[j]==b[i]):\r\n c=1\r\n break\r\nif(c):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "from collections import defaultdict \r\nd={}\r\nfor i in range(int(input())):\r\n a,b=map(int,input().split())\r\n d[a]=a+b\r\n if a+b in d and d[a+b]==a:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")", "n = int(input())\r\ncamel = {}\r\nans = \"NO\"\r\nfor i in range(0,n):\r\n inp = input()\r\n inp = inp.split()\r\n camel[int(inp[0])] = int(inp[1])\r\nfor k,v in camel.items():\r\n if k+v in camel:\r\n if k == k+v + camel[k+v]:\r\n ans = \"YES\"\r\nprint (ans)", "def main():\r\n n = int(input())\r\n spitting = {}\r\n\r\n for _ in range(n):\r\n [x, d] = [int(_) for _ in input().split()]\r\n spitting[x] = x + d\r\n\r\n found = False\r\n\r\n for i, j in spitting.items():\r\n if j in spitting and spitting[j] == i:\r\n found = True\r\n break\r\n\r\n print('YES' if found else 'NO')\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "import functools\r\nimport itertools\r\nimport math\r\nimport random\r\nimport string\r\nfrom collections import defaultdict, Counter\r\nfrom heapq import *\r\nfrom bisect import bisect_left, bisect_right\r\n\r\n\r\ndef repeat(_func=None, *, times=1):\r\n def decorator(func):\r\n @functools.wraps(func)\r\n def wrapper(*args, **kwargs):\r\n for _ in range(times):\r\n func(*args, **kwargs)\r\n\r\n return wrapper\r\n\r\n if _func is None:\r\n return decorator\r\n else:\r\n return decorator(_func)\r\n\r\n\r\ndef unpack(func=int):\r\n return map(func, input().split())\r\n\r\n\r\ndef l_unpack(func=int):\r\n \"\"\"list unpack\"\"\"\r\n return list(map(func, input().split()))\r\n\r\n\r\ndef getint():\r\n return int(input())\r\n\r\n\r\ndef getmatrix(rows):\r\n return [list(map(int, input().split())) for _ in range(rows)]\r\n\r\n\r\ndef display_matrix(mat):\r\n for i in range(len(mat)):\r\n print(mat[i])\r\n print('-' * 20)\r\n\r\n\r\nMOD = 1_000_000_007\r\n\r\n\r\n# @repeat(times=int(input()))\r\ndef main():\r\n n = getint()\r\n cam = []\r\n spit = []\r\n for _ in range(n):\r\n a, b = unpack()\r\n cam.append(a)\r\n spit.append(b)\r\n hmap = {c:i for i,c in enumerate(cam)}\r\n for c, s in zip(cam, spit):\r\n pos = c + s\r\n if pos in hmap and cam[hmap[pos]] + spit[hmap[pos]] == c:\r\n print('YES')\r\n return\r\n print('NO')\r\n\r\n\r\nmain()\r\n", "#To solve this I can register the positions of camels and its spits\n#If I can find a camel that spitted and that camel spited too the awnser is yes\nnumCamels = int(input())\ndictCamel = {}\nlistSpit = []\nfor i in range(numCamels):\n actualCamel, actualSpit = map(int, input().split()) \n #I have a camel in position actualCamel that spitted at actualCamel + actualSpit\n dictCamel[actualCamel] = actualCamel + actualSpit \n#after reading everything I need to see if I have a spit in the same position of a camel to verify if that camel spitted to\nspitted = 0\nfor camel in dictCamel.keys():\n #If a spit position is in the dictCamel I need to verify if that camel spitted in the actual position, basically I need to see if one point to another \n try:\n if(spitted == 0 and camel == dictCamel[dictCamel[camel]]):\n print('YES')\n spitted = 1\n except:\n pass\n#If i didn't find\nif(spitted == 0):\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\t", "N = int(input())\r\narr = []\r\nfor i in range(N):\r\n j = input().split()\r\n for i2 in range(2):\r\n j[i2] = int(j[i2])\r\n arr.append(j)\r\n \r\nans = \"NO\"\r\nfor i in range(N):\r\n for j in range(N):\r\n if arr[i][0] + arr[i][1] == arr[j][0] and arr[j][0] + arr[j][1] == arr[i][0]:\r\n ans = \"YES\"\r\n \r\nprint(ans)", "n=int(input())\r\nfi=[0]*n\r\nse=[0]*n\r\nfor i in range (n):\r\n fi[i],se[i]=map(int,input().split())\r\nfor i in range (n):\r\n if fi[i]+se[i] in fi and fi[fi.index(fi[i]+se[i])]+se[fi.index(fi[i]+se[i])]==fi[i]:\r\n print(\"Yes\")\r\n exit()\r\nprint(\"No\")\r\n\r\n", "n = int(input())\n\nspits = []\n\nfor _ in range(n):\n x, d = map(int, input().split())\n spits.append((x, x + d))\n\nfound = False\nfor i in range(len(spits)):\n if found:\n break\n for j in range(i+1, len(spits)):\n if spits[i][1] == spits[j][0] and spits[j][1] == spits[i][0]:\n found = True\n break\n\nif found:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "\r\ndef __main__():\r\n n = int(input())\r\n arr1 = []\r\n arr2 = []\r\n for i in range(n):\r\n x, y = map(int, input().split())\r\n arr1.append(x)\r\n arr2.append(y)\r\n for i in range(n):\r\n for j in range(i, n):\r\n if(arr1[i] + arr2[i] == arr1[j] and arr1[j] + arr2[j] == arr1[i]):\r\n print(\"YES\")\r\n return\r\n print(\"NO\")\r\n \r\n__main__()", "n = int(input())\r\nxp = [0]*100010\r\nxl,dl = [],[]\r\nfor _ in range(n):\r\n x,d = map(int,input().split())\r\n xp[x]=1\r\n xl.append(x)\r\n dl.append(d)\r\nf = 1\r\nfor i in range(n):\r\n if(xp[xl[i]+dl[i]]):\r\n z = xl.index(xl[i]+dl[i])\r\n if(xl[z]+dl[z]==xl[i]):\r\n print('YES')\r\n f = 0\r\n break\r\nif(f):\r\n print('NO')", "check = False\n\nmapp = {}\nn = int(input())\naux = set()\n\nfrom collections import defaultdict\nmapp = defaultdict(set)\n\nfor i in range(0,n):\n x, d = map(int, input().split())\n s = x\n t = x+d\n \n mapp[s].add(t)\n \n try:\n if(s in mapp[t]):\n check = True\n except:\n continue\nans = 'YES' if check else 'NO'\n\nprint(ans)\n\t\t \t \t\t \t\t\t\t\t\t \t \t \t \t \t\t\t", "import sys\r\nflag=0\r\nn=int(input())\r\ng=[]\r\nfor i in range(n):\r\n g.append(list(map(int,input().split())))\r\nfor i in range(len(g)-1):\r\n for j in range(i+1,len(g)):\r\n a,b=g[i][0],g[i][1]\r\n c,d=g[j][0],g[j][1]\r\n \r\n if a+b==c and c+d==a:\r\n print(\"YES\")\r\n flag=1\r\n sys.exit()\r\nif flag==0:\r\n print(\"NO\")", "def camels_spit():\n n = int(input())\n\n camels = []\n spit = []\n for _ in range(n):\n line = input().split()\n x, d = int(line[0]), int(line[1])\n camels.append(x)\n spit.append(x+d)\n for i in range(n):\n for u in range(n):\n if(camels[i] == spit[u] and camels[u] == spit[i]):\n print('YES')\n return\n print('NO')\n\ncamels_spit()\n \t\t \t\t \t \t\t\t \t\t \t \t\t \t \t \t", "import sys\nl = sys.stdin.readlines()\ni = 0\nn = int(l[i].replace('\\n',''))\ncamelos = []\ni = 1\nfor _ in range(n):\n x,d = [int(x) for x in l[i].replace('\\n', '').split()]\n i += 1\n camelos.append((x,d))\n\nfor i in range(len(camelos)-1):\n for j in range(i+1, len(camelos)):\n posC1 = camelos[i][0]\n dC1 = camelos[i][1]\n posC2 = camelos[j][0]\n dC2 = camelos[j][1]\n if (posC1 + dC1) == posC2 and (posC2 + dC2) == posC1:\n print(\"YES\")\n exit()\n\nprint('NO')\n\n\n\n \t\t \t \t\t \t\t\t\t\t\t \t\t \t \t", "from collections import Counter\r\n\r\nn = int(input())\r\nmp, judge = Counter(), Counter()\r\nflag = True\r\nfor _ in range(n):\r\n x, y = map(int, input().split())\r\n mp[x] = x + y\r\n judge[x] = 1\r\n if mp[x + y] == x and judge[x + y] == 1:\r\n print(\"YES\")\r\n flag = False\r\n break\r\nif flag:\r\n print(\"NO\")\r\n\r\n", "def main():\n camels = int(input())\n\n placements_and_spit_distances = []\n\n for _ in range(camels):\n camel_info = [int(i) for i in input().split()]\n placements_and_spit_distances.append(camel_info)\n\n spit_map = {}\n\n for camel_info in placements_and_spit_distances:\n spits_at = camel_info[0] + camel_info[1]\n if (camel_info[0] in spit_map) and spits_at in spit_map[camel_info[0]]:\n print('YES')\n return\n if spits_at in spit_map:\n spit_map[spits_at].append(camel_info[0])\n else:\n spit_map[spits_at] = [camel_info[0]]\n\n print('NO')\n\n\nmain()\n\t \t \t\t\t \t \t\t \t \t\t \t \t\t", "x = []\r\ny = []\r\nfor i in range(int(input())):\r\n a,b = map(int , input().split())\r\n x.append(a)\r\n y.append(b)\r\n\r\ni = 0\r\nt=0\r\nwhile i<len(x):\r\n if x[i] + y[i] in x:\r\n z = x.index(x[i]+y[i])\r\n if x[z] + y[z] ==x[i]:\r\n t=1\r\n print(\"YES\")\r\n break\r\n i = i + 1\r\nif t==0:\r\n print(\"NO\")", "n = int(input())\n\ncamels = dict()\nfor i in range(n):\n pos, spit = map(int, input().split())\n camels[pos] = spit\n\nspitted = False\nfor pos, spit in camels.items():\n aux = pos + spit\n if aux in camels and aux + camels[aux] == pos:\n spitted = True\n break\n\nif spitted:\n print('YES')\nelse:\n print('NO')\n \n \t \t\t \t\t \t \t\t \t\t\t\t\t \t\t", "n = int(input())\r\ndict = {}\r\nans = \"NO\"\r\nfor i in range(n):\r\n pos, spit = [int(item) for item in input().split(' ')]\r\n dict[pos] = spit\r\n\r\nfor key in dict:\r\n secCamel = key + dict[key]\r\n if secCamel in dict and key == secCamel + dict[secCamel]:\r\n ans = \"YES\"\r\n break\r\n\r\nprint(ans)\r\n", "def spitProblem():\n n = int(input())\n xPos, dPos = [], []\n for _ in range(n):\n x, d = list(map(int, input().split(' ')))\n xPos.append(x)\n dPos.append(d)\n\n for i in range(0, len(xPos)):\n for j in range(0, len(dPos)):\n if(xPos[i] + dPos[i] == xPos[j] and xPos[j] + dPos[j] == xPos[i]):\n return \"YES\"\n return \"NO\"\n \n\nif __name__ == \"__main__\":\n print(spitProblem())\n\n \t \t\t \t\t \t \t \t \t \t\t \t\t\t", "n = int(input())\r\nmy_list = []\r\nfor i in range(n):\r\n x, d = map(int, input().split(\" \"))\r\n my_list.append([x, d])\r\n\r\ndef solve(n, arr):\r\n for i in range(n - 1):\r\n for j in range(i + 1, n):\r\n if arr[i][1] + arr[i][0] == arr[j][0] and arr[j][1] + arr[j][0] == arr[i][0]:\r\n return True\r\n return False\r\n\r\nprint(\"YES\" if solve(n, my_list) else \"NO\")\r\n", "flag = False\r\nn=int(input())\r\nd_t=dict()\r\nfor i in range(n):\r\n x,d=input().split(\" \")\r\n x,d=int(x),int(d)\r\n d_t[x]=d\r\nfor x in d_t:\r\n d2=d_t.get(x +d_t[x])\r\n if d2 is not None and d2 == -d_t[x]:\r\n print(\"YES\")\r\n flag = True\r\n break\r\nif not flag:\r\n print(\"NO\")\r\n", "#!/usr/bin/env python3\n\ndef spit(location, n):\n for i in range(n-1):\n for j in range(i+1, n):\n if location[i][0] + location[i][1] == location[j][0] and location[j][0] + location[j][1] == location[i][0]:\n return True\n return False\n\ndef main():\n n = int(input())\n location = []\n for i in range(n):\n camel = [int(j) for j in input().split(' ')]\n location.append(camel)\n if spit(location, n):\n print('YES')\n else:\n print('NO')\n\nif __name__ == '__main__':\n main()\n", "import sys\r\nimport math\r\nimport bisect\r\nimport itertools\r\nimport random\r\nimport re\r\n\r\ndef solve(d):\r\n for k in d:\r\n if d[k] in d and d[d[k]] == k:\r\n return True\r\n return False\r\n\r\ndef main():\r\n d = dict()\r\n for _ in range(int(input())):\r\n a, b = map(int, input().split())\r\n d[a] = a + b\r\n if solve(d):\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "\r\nn=int(input())\r\n\r\nk = []\r\n\r\nfor i in range(n):\r\n x,d=map(int,input().split())\r\n k.append([x,x+d])\r\n\r\n\r\nok=False\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n if k[i][0] == k[j][1] and k[i][1] == k[j][0]:\r\n ok = True\r\n\r\nif ok:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\r\namount = int(input())\r\nused = [[] for i in range(2*int(10e4) + 1)]\r\nfor i in range(amount):\r\n x, d = [int(s) for s in input().split()]\r\n if x + d + int(10e4) in used[x + int(10e4)]:\r\n print('YES')\r\n sys.exit(0)\r\n else:\r\n used[x + d + int(10e4)].append(x + int(10e4))\r\nprint('NO')\r\n#print(used)", "n = int(input())\nm = []\nfor _ in range(n):\n m.append(list(map(int, input().split())))\nans = 'NO'\nfor i in range(n):\n for j in range(i + 1, n):\n x1, d1 = m[i]\n x2, d2 = m[j]\n if x1 == x2 + d2 and x2 == x1 + d1:\n ans = 'YES'\n break\n \nprint(ans)", "n = int(input())\r\nls1=[]\r\nls2=[]\r\nfor _ in range(n):\r\n x,d=map(int,input().split())\r\n ls1.append(x)\r\n ls2.append(d)\r\nc=0\r\na=\"NO\"\r\nfor i in range(n):\r\n for j in range(n):\r\n if ls1[i]+ls2[i]==ls1[j]:\r\n if ls2[i]==-ls2[j]:\r\n a=\"YES\"\r\nprint(a)", "n=int(input())\r\n\r\n\r\nD=[]\r\nX=[]\r\nfor i in range(n):\r\n x,d=map(int,input().split())\r\n X.append(x)\r\n D.append(d)\r\nAns=\"NO\"\r\nfor i in range(n):\r\n \r\n for j in range(n):\r\n if(j==i):\r\n continue\r\n if(X[i]==X[j]+D[j] and X[j]==X[i]+D[i]):\r\n Ans=\"YES\"\r\n break\r\nprint(Ans)\r\n", "n = int(input())\r\nrecords = []\r\nexist = 0\r\nfor i in range(n):\r\n x, d = list(map(int, input().split()))\r\n s = x + d\r\n r = (x, s)\r\n records.append(r)\r\nfor record in records:\r\n rv = (record[1], record[0])\r\n if rv in records:\r\n exist = 1\r\n break\r\nif exist == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\n\r\ndata = []\r\nfor i in range(n):\r\n s = input().split()\r\n x = int(s[0])\r\n d = int(s[1])\r\n data.append((x, d))\r\n\r\nresult = False\r\nfor i in range(n):\r\n xi = data[i][0]\r\n di = data[i][1]\r\n for j in data:\r\n xj = j[0]\r\n dj = j[1]\r\n if xj == xi + di:\r\n if xi == xj + dj:\r\n result = True\r\n\r\nif result:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "l1=[]\r\nl2=[]\r\nfor i in range(int(input())):\r\n\ta,b=map(int,input().split())\r\n\tl1.append(a)\r\n\tl2.append(b)\r\ndef f(l1,l2):\r\n\tfor i in range(len(l1)):\r\n\t\ts=l1[i]+l2[i]\r\n\t\tfor j in range(len(l1)):\r\n\t\t\tif i!=j and s==l1[j] and l1[j]+l2[j]==l1[i]:\r\n\t\t\t\treturn \"YES\"\r\n\treturn \"NO\"\r\nprint(f(l1,l2))", "n=int(input())\r\na=[]\r\nb=[]\r\nh=True\r\nans=\"NO\"\r\nfor i in range(n):\r\n a1,b1=map(int,input().split())\r\n a.append(a1)\r\n b.append(b1)\r\nfor i in range(n):\r\n if a[i]+b[i] in a:\r\n s=a.index(a[i]+b[i])\r\n if a[s]+b[s]==a[i]:\r\n ans=\"YES\"\r\n h=False\r\n if h==False:\r\n break\r\nprint(ans)", "amount_of_camels = int(input())\ncamels_information = []\n\nfor i in range(amount_of_camels):\n (x, d) = map(int, input().split(' '))\n camels_information.append([x, d])\n\ndef check_condition(information_sheets):\n for a in range(amount_of_camels - 1):\n for b in range(a + 1, amount_of_camels):\n if sum(camels_information[a]) == camels_information[b][0] and sum(camels_information[b]) == camels_information[a][0]:\n return \"Yes\"\n\n\nif check_condition(camels_information) == \"Yes\":\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\n\n", "def main():\r\n n = int(input())\r\n\r\n camel_dict = {}\r\n for _ in range(n):\r\n xi, di = map(int, input().split())\r\n if xi not in camel_dict:\r\n if xi + di not in camel_dict:\r\n camel_dict[xi + di] = [xi]\r\n else:\r\n camel_dict[xi + di].append(xi)\r\n else:\r\n if xi + di in camel_dict[xi]:\r\n print(\"YES\")\r\n return\r\n else:\r\n del camel_dict[xi]\r\n\r\n print(\"NO\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n=int(input())\r\na={}\r\nfor i in range(n):\r\n x,d=map(int,input().split())\r\n a[x]=d\r\nfor x in a:\r\n if x+a[x] in a:\r\n if x+a[x]+a[x+a[x]]==x:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")\r\n", "import sys\r\nimport math\r\nfrom collections import Counter\r\n# n = int(input())\r\n# a = list(map(int, input().split()))\r\n\r\nn = int(input())\r\nxd = {}\r\nfor _ in range(n) :\r\n x, d = map(int, input().split())\r\n xd[x] = d\r\nfor i in xd :\r\n if (i + xd[i]) in xd and xd[i + xd[i]] + (i + xd[i]) == i:\r\n print(\"YES\")\r\n break\r\nelse :\r\n print(\"NO\")\r\n \r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n\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\na1=[]\r\na2=[]\r\nfor i in range(n):\r\n\tx,d=list(map(int,input().split()))\r\n\ta1.append(x)\r\n\ta2.append(d)\r\n\r\nflag=1\r\nfor i in range(n):\r\n\tfor j in range(i+1,n):\r\n\t\tif ((a1[i]+a2[i]==a1[j]) and (a1[j]+a2[j]==a1[i])):\r\n\t\t\tprint(\"YES\")\r\n\t\t\tflag=0\r\n\t\t\tbreak\r\n\tif(flag==0):\r\n\t\tbreak\r\nif(flag==1):\r\n\tprint(\"NO\")\r\n", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n x,b = input().split()\r\n a.append([int(x),int(b)])\r\n\r\nf = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == j:\r\n continue\r\n else:\r\n if a[i][0] + a[i][1] == a[j][0] and a[j][0] + a[j][1] == a[i][0]:\r\n f = 1\r\n break\r\n\r\nif f == 1:\r\n print (\"YES\")\r\nelse:\r\n print (\"NO\")\r\n ", "n = int(input())\r\n\r\ncamels = {}\r\n\r\nfor x in range(n):\r\n a,b = [int(x) for x in input().split()]\r\n\r\n camels[a] = a+b\r\n\r\nyes = False\r\n\r\nfor c in camels:\r\n if camels[c] in camels:\r\n if camels[camels[c]] == c:\r\n yes = True\r\n break\r\n\r\nif yes:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "# CodeForces 29A Spit Problem\r\n# 2020-10-12\r\n\r\n\r\ndef solution():\r\n n = int(input())\r\n # the num of spits\r\n memo = {}\r\n for i in range(n):\r\n x, d = [int(i) for i in input().split()]\r\n if x + d in memo and x in memo[x + d]:\r\n return True\r\n if x in memo:\r\n memo[x].add(x + d)\r\n else:\r\n memo[x] = {x + d}\r\n else:\r\n return False\r\n\r\n\r\nif __name__ == '__main__':\r\n if solution():\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\n", "n = int(input())\ncamels = []\nspits = []\nfor i in range(n):\n camel = input().split()\n camels.append(int(camel[0]))\n spits.append(int(camel[1]))\n\nresult = 'NO'\nfor i in range(n):\n if camels[i]+spits[i] in camels:\n ind = camels.index(camels[i]+spits[i])\n if camels[ind]+spits[ind] == camels[i]:\n result = 'YES'\n break\n\nprint(result)", "x=[]\r\ny=[]\r\nn=int(input())\r\nfor i in range(1,n+1):\r\n a,b=map(int,input().split())\r\n x.append(a)\r\n y.append(b)\r\nok=0\r\nfor i in range(1,n+1):\r\n if ok==1:\r\n break\r\n for j in range(i+1,n+1):\r\n if(x[i-1]+y[i-1]==x[j-1] and x[j-1]+y[j-1]==x[i-1]):\r\n ok=1\r\n break\r\nif(ok):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nl = []\r\nfor i in range(n):\r\n spot= list(map(int,input().split()))\r\n l.append(spot)\r\n\r\nbol = False\r\nfor i in range(n-1):\r\n for j in range(i+1,n):\r\n if l[i][0]+l[i][1]==l[j][0] and l[i][0] == l[j][0]+l[j][1]:\r\n print('YES')\r\n bol = True\r\n break\r\n else:\r\n pass\r\n if bol == True:\r\n break\r\n else:\r\n pass\r\n\r\nif bol == True:\r\n pass\r\nelse:\r\n print('NO')", "n = int(input())\r\ncamels = []\r\n\r\nfor _ in range(n):\r\n x, d = map(int, input().split())\r\n camels.append((x, d))\r\n\r\n# Check for two camels that spat at each other\r\nfor i in range(n):\r\n for j in range(n):\r\n if camels[i][0] + camels[i][1] == camels[j][0] and camels[j][0] + camels[j][1] == camels[i][0]:\r\n print(\"YES\")\r\n exit()\r\n\r\nprint(\"NO\")\r\n", "t = int(input())\r\nf = []\r\ns = []\r\nfor _ in range(t):\r\n x, d = map(int,input().split())\r\n f. append(x + d)\r\n s.append(x)\r\n if x in f:\r\n if x + d == s[f.index(x)]:\r\n exit(print(\"YES\"))\r\nprint(\"NO\")\r\n", "n=int(input());x=[];d=[]\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n x.append(a);d.append(b)\r\np=0\r\nfor i in range(n):\r\n if x[i]+d[i] in x:\r\n j=x.index(x[i]+d[i])\r\n if x[j]+d[j]==x[i]: p=1;break\r\nprint(\"YES\" if p else \"NO\")", "n = int(input())\r\na = [tuple(map(int, input().split())) for i in range(n)]\r\nans = \"NO\"\r\nfor i in range(n):\r\n for j in range(i + 1, n):\r\n if a[i][0] + a[i][1] == a[j][0] and a[j][0] + a[j][1] == a[i][0]:\r\n ans = \"YES\"\r\n break\r\n if len(ans) > 2:\r\n break\r\nprint(ans)", "a=[]\nb=[]\nn=int(input())\nflag=0\nfor i in range(n):\n x=input().split()\n a.append(int(x[0]))\n b.append(int(x[1]))\nfor i in range(n-1):\n for j in range(i+1,n):\n if a[i]+b[i]==a[j] and a[i]==a[j]+b[j]:\n flag=1\nif flag==1:\n print(\"YES\")\nelse:\n print(\"NO\")", "i=int(input())\r\ns={}\r\nfor k in range(i):\r\n l=list(map(int,input().split(' ')))\r\n s[l[0]]=l[0]+l[1]\r\nt=0\r\nfor j in s:\r\n if((s[j] in s) and s[s[j]]==j):\r\n t=1\r\n break\r\n \r\nif(t==0):\r\n print('NO')\r\nelse:\r\n print('YES')\r\n \r\n \r\n ", "s = []\r\nfor n in range(int(input())):\r\n x, d = map(int, input().split())\r\n s.append(([x, x+d]))\r\n\r\nfind = True\r\nfor i in range(len(s)):\r\n if find is False:\r\n break\r\n x, d = s[i]\r\n for j in range(len(s)):\r\n if i == j:\r\n continue\r\n z, y = s[j]\r\n if x == y and z == d:\r\n print(\"YES\")\r\n find = False\r\n break\r\nif find:\r\n print(\"NO\")", "n = int(input())\r\nmilon = {}\r\nfor j in range(n):\r\n xi , di = map(int, input().strip().split(' '))\r\n milon[xi] = di\r\nfor x , d in milon.items():\r\n if x + d in milon:\r\n if x == x + d + milon[x + d]:\r\n print('YES')\r\n exit()\r\nprint('NO')", "# https://codeforces.com/problemset/problem/29/A\r\n\r\ndef func_sol(raw_data):\r\n camels = [list(map(int, line.split(' '))) for line in raw_data.split('\\n')[1:-1]]\r\n n = len(camels)\r\n for i in range(0, n - 1):\r\n for j in range(i, n):\r\n if camels[i][1] == - camels[j][1]:\r\n if abs(camels[i][0] - camels[j][0]) == abs(camels[j][1]):\r\n return \"YES\"\r\n return \"NO\"\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=int(input())\r\narr=[]\r\nfor i in range(n):\r\n r=[int(h) for h in input().split()]\r\n if r[1]>0:\r\n arr.append((r[0],r[0]+r[1]))\r\n else:\r\n arr.append((r[0]+r[1],r[0]))\r\narr.sort()\r\nflag=0\r\nfor j in range(n-1):\r\n if arr[j]==arr[j+1]:\r\n flag=1\r\n break\r\nif flag==0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "# cook your dish here\r\nn=int(input())\r\nt=n\r\nm={}\r\nil=[]\r\nyi=[]\r\nwhile t>0:\r\n x,y=map(int,input().split())\r\n il.append(x)\r\n yi.append(y)\r\n m[x+y]=-1000000\r\n t=t-1\r\nfor i in range(0,n):\r\n m[il[i]]=il[i]+yi[i]\r\nc=0\r\nfor i in range(0,n):\r\n if il[i]==m[m[il[i]]]:\r\n c=1\r\n break\r\nif c==1:\r\n print('YES')\r\nelse:\r\n print('NO')", "data = {}\r\nfor _ in range(int(input())):\r\n\ta,b = map(int,str(input()).split(\" \"))\r\n\tdata[a] = a+b\r\ncount= 0\r\nfor i in data:\r\n\tif data[i] in data.keys() and data[data[i]]==i:\r\n\t\tcount+=2\r\n\tif count==2:\r\n\t\tprint(\"YES\")\r\n\t\texit()\r\nprint(\"NO\")", "n = int(input())\r\nx = list()\r\nd = list()\r\ncount = False\r\nfor i in range(n):\r\n s, t = map(int, input().split())\r\n x.append(s)\r\n d.append(t)\r\nfor i in range(n):\r\n for j in range(n):\r\n if i != j:\r\n if x[i]+d[i] == x[j] and x[j]+d[j] == x[i]:\r\n count = True\r\nif count == True:\r\n print(\"YES\")\r\nif count == False:\r\n print(\"NO\")\r\n", "def solve():\r\n n = int(input())\r\n x = [None] * n\r\n d = [None] * n\r\n for i in range(n):\r\n x[i], d[i] = map(int, input().split())\r\n \r\n for i in range(n):\r\n for j in range(i+1,n):\r\n if x[i] + d[i] == x[j] and x[j] + d[j] == x[i]:\r\n print(\"YES\")\r\n return\r\n \r\n print(\"NO\")\r\n\r\nsolve()", "\nx = []\nd = []\nyORn = 0\n\nn = int(input())\nfor i in range(n):\n a, b = input().split()\n x.append(int(a))\n d.append(int(b))\nfor i in range(n):\n w = x[i] + d[i]\n for j in range(n):\n if x[j] == w:\n if (x[j] + d[j]) == x[i]:\n yORn = 1\nif yORn:\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", "n = int(input())\n\nc = {}\nfor i in range(n):\n x, y = map(int, input().split())\n\n c[x] = x + y\n\nbool = False\nfor k in c:\n if c[k] in c and c[c[k]] == k:\n print(\"YES\")\n bool = True\n break\n\nif not bool:\n print(\"NO\")\n \t\t \t\t \t\t\t \t\t\t\t \t\t \t\t \t\t\t", "n = int(input())\r\nl1 = list()\r\nl2 = list()\r\na = 0\r\nfor i in range(n):\r\n s, t = map(int, input().split())\r\n l1.append(s)\r\n l2.append(t)\r\n \r\nfor i in range(n):\r\n for j in range(n):\r\n if i != j:\r\n if l1[i]+l2[i] == l1[j] and l1[j]+l2[j] == l1[i]:\r\n a = 1\r\nif a == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n \r\n\r\n\r\n", "n = int(input())\n\nzoo = []\nfor _ in range(n):\n x, d = map(int, input().split())\n zoo.append([x,d])\n\ndone = 0\nfor i in zoo:\n for j in zoo:\n if (i[0] + i[1]) == j[0]:\n if (j[0] + j[1]) == i[0]:\n print(\"YES\")\n done = 1\n break\n if done:\n break\nif not done:\n print(\"NO\")\n\t\t \t\t \t \t\t\t \t \t \t \t \t\t \t \t\t", "n = int(input())\r\n\r\na =[]\r\nb =[]\r\ndis =[]\r\nfor i in range(n):\r\n c,d=map(int,input().split())\r\n a.append(c)\r\n b.append(d)\r\n dis.append(c+d)\r\n\r\nfor i in range(n):\r\n if dis[i] in a:\r\n if dis[a.index(dis[i])]==a[i]:\r\n print(\"YES\")\r\n exit()\r\n elif i==n-1:\r\n print(\"NO\")\r\n elif i==n-1:\r\n print(\"NO\")\r\n\r\n", "\r\nn = int(input())\r\ndict = {}\r\nfor i in range(n):\r\n line = list(map(int, input().split(' ')))\r\n key = line[0]\r\n value = line[1]\r\n dict[key] = value\r\n\r\n\r\nans = 'NO'\r\nfor key, value in dict.items():\r\n n = key + value\r\n if n in dict and n + dict[n] == key:\r\n ans = 'YES'\r\n break\r\n\r\nprint(ans)\r\n\r\n\r\n\r\n", "ans, p = 'NO', set()\r\nfor i in range(int(input())):\r\n x, d = map(int, input().split())\r\n y = x + d\r\n if (x, y) in p:\r\n ans = 'YES'\r\n break\r\n p.add((y, x))\r\nprint(ans)", "n = int(input())\r\np = []\r\ns = []\r\nfor i in range(n):\r\n pi,si = map(int,input().split())\r\n p.append(pi)\r\n s.append(si)\r\nfor i in range(n):\r\n s_at = [p.index(other) for other in p[i+1:] if other == p[i] + s[i]]\r\n for ind in s_at:\r\n if p[ind] + s[ind] == p[i]:\r\n print('YES')\r\n exit()\r\nprint('NO')", "n=int(input())\r\npos=[0]*n\r\nd=[0]*n\r\n\r\nfor x in range(n):\r\n pos[x],d[x]=map(int,input().split())\r\n \r\nfor x in range(n):\r\n target=pos[x]+d[x]\r\n try:\r\n index=pos.index(target)\r\n if pos[index]+d[index]==pos[x]:\r\n print(\"YES\")\r\n break\r\n except:\r\n continue\r\nelse:\r\n print(\"NO\")\r\n ", "n, ans = int(input()), 'NO'\r\ncont = {}\r\nfor i in range(n):\r\n pos, spit = [int(item) for item in input().split()]\r\n cont[pos] = spit\r\n\r\nfor key in cont:\r\n secCamel = key + cont[key]\r\n if secCamel in cont and secCamel + cont[secCamel] == key:\r\n ans = 'Yes'\r\n break\r\n\r\nprint(ans)\r\n", "n=int(input())\r\npos=[0]*n\r\nd=[0]*n\r\n\r\nfor x in range(n):\r\n pos[x],d[x]=map(int,input().split())\r\n \r\nfor x in range(n):\r\n target=pos[x]+d[x]\r\n if target in pos:\r\n index=pos.index(target)\r\n if pos[index]+d[index]==pos[x]:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "#29A\r\nn = int(input())\r\ns = set()\r\n#set fuctions add,update\r\nfor i in range(n):\r\n\tx, d = map(int,input().split() )\r\n\tif (x + d, -d) in s:\r\n\t\tprint('YES')\r\n\t\texit()\r\n\ts.add((x, d))\r\nprint('NO')", "listaA,listaB = [],[]\nfor _ in range(int(input())):\n a,b = map(int,input().split())\n calculo=a+b\n listaA.append(a)\n listaB.append(calculo)\n \nfor i in listaB:\n if i in listaA:\n h = listaB.index(i)\n g = listaA.index(i)\n if listaB[g] == listaA[h]:\n print(\"YES\")\n break\nelse:\n print(\"NO\")\n\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\n\r\nget_other = dict()\r\nfor i in range(n):\r\n x,d = map(int,input().split())\r\n if x+d not in get_other: get_other[x+d]=x\r\n if x in get_other and x+d == get_other[x]:\r\n print(\"YES\")\r\n exit()\r\n\r\nprint(\"NO\")\r\n\r\n", "n = int(input())\na = {}\nflag = False\nfor i in range(n):\n x, d = input().split()\n x, d = int(x), int(d)\n a[x] = d\nfor x in a:\n b = a.get(x + a[x])\n if b is not None and b == -a[x]:\n print(\"YES\")\n flag = True\n break\nif not flag:\n print(\"NO\")\n", "c = [tuple(map(int, input().split())) for i in range(int(input()))]\r\nprint('YES' if any(sum(ci) == cj[0] and sum(cj) == ci[0] for ci in c for cj in c) else 'NO')", "def main():\r\n flag = False\r\n n=int(input())\r\n d_t=dict()\r\n for i in range(n):\r\n x,d=input().split(\" \")\r\n x,d=int(x),int(d)\r\n d_t[x]=d\r\n for x in d_t:\r\n d2=d_t.get(x +d_t[x])\r\n if d2 is not None and d2 == -d_t[x]:\r\n print(\"YES\")\r\n flag = True\r\n break\r\n if not flag:\r\n print(\"NO\")\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n = int(input())\nS = set()\nfor i in range(n):\n x, d = map(int, input().split())\n if (x+d, x) in S:\n print('YES')\n exit()\n S.add((x, x+d))\nelse:\n print('NO')\n", "n = int(input())\r\n\r\na=[]\r\nfor i in range(n):\r\n x,d = map(int,input().split())\r\n a.append([x,x+d])\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n if a[i][0]==a[j][1] and a[i][1]==a[j][0]:\r\n print(\"YES\")\r\n exit()\r\n\r\nprint(\"NO\")", "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\na = [list(map(int, input().split())) for _ in range(n)]\r\n\r\nfor i in range(n):\r\n for j in range(i + 1, n):\r\n if a[i][0] + a[i][1] == a[j][0] and a[j][0] + a[j][1] == a[i][0]:\r\n print('YES')\r\n exit()\r\nprint('NO')\r\n", "n = int(input())\nx = []\nd = []\nres = \"NO\"\n\nfor i in range(n):\n xi, di = map(int, input().split())\n x.append(xi)\n d.append(di)\n\n\nfor i in range(n):\n for j in range(i+1, n):\n if x[j] + d[j] == x[i] and x[i]+d[i] == x[j]:\n res = \"YES\"\n break\nprint(res)\n\n \t\t\t\t\t\t \t \t \t\t\t\t \t \t\t \t \t\t", "n = int(input())\nc = dict([])\nresp = \"NO\"\nfor i in range(n):\n x, d = map(int, input().split())\n c[x] = x+d\n if ((resp == \"NO\") and (x+d in c) and (c[(x+d)] == x)):\n resp = \"YES\"\nprint(resp)\n\t \t\t\t \t\t \t \t\t\t \t\t \t \t\t \t \t\t", "n = int(input())\r\npos = {}\r\nfor i in range(n):\r\n p, l = list(map(int,input().strip().split(' ')))\r\n pos[p] = p + l\r\nfound = False\r\nfor i in pos:\r\n if pos[i] in pos.keys() and pos[pos[i]] == i:\r\n print(\"YES\")\r\n found = True\r\n break\r\nif not found:\r\n print(\"NO\")", "n = int(input())\r\ndata = []\r\nfor _ in range(n):\r\n x,d = map(int, input().split())\r\n data.append([x,d])\r\nfor i in range(n):\r\n for j in range(i+1, n):\r\n if (data[i][0]+data[i][1] == data[j][0]) and data[i][1] == -data[j][1]:\r\n print('YES')\r\n exit(0)\r\nprint('NO')", "n = int(input())\r\ns = set()\r\nfor i in range(n):\r\n\tx, d = [int(x) for x in input().split()]\r\n\tif (x + d, -d) in s:\r\n\t\tprint('YES')\r\n\t\texit()\r\n\ts.add((x, d))\r\nprint('NO')\r\n", "import sys\n\ndef main():\n lines = sys.stdin.readlines()\n\n camel_count = int(lines[0].replace('\\n', ''))\n i = 1\n\n camels_pos = []\n camels_spits = []\n spitted = False\n\n for ign in range(camel_count):\n x, dist = [int(x) for x in lines[i].replace('\\n', '').split()] \n\n camels_pos.append(x)\n camels_spits.append(dist)\n for k in range(ign):\n if (camels_pos[ign] + camels_spits[ign] == camels_pos[k]) and (camels_pos[k] + camels_spits[k] == camels_pos[ign]):\n spitted = True\n break\n\n i += 1\n\n print('YES') if spitted else print('NO')\n\n\nmain()\n \t\t\t \t \t\t \t\t \t\t \t \t\t\t\t \t", "n = int(input())\r\nx=[]\r\nd=[]\r\nspt=0\r\n\r\nfor i in range(n):\r\n a,b = list(map(int, input().split()))\r\n x.append(a)\r\n d.append(b)\r\n \r\n for j in range(i):\r\n if x[i]+d[i]==x[j] and x[j]+d[j]==x[i]:\r\n spt = 1\r\n break\r\n \r\n if spt==1:\r\n break\r\n\r\n \r\nif spt==1:\r\n print('YES')\r\nelse:\r\n print('NO')", "n=int(input())\r\nl=[]\r\nflag=0\r\nfor _ in range(n):\r\n a=list(map(int,input().strip().split()))\r\n l.append(a)\r\nfor i in range(len(l)-1):\r\n for j in range(i+1,len(l)):\r\n if(l[i][0]+l[i][1]==l[j][0] and l[j][0]+l[j][1]==l[i][0]):\r\n flag=1\r\n break\r\nif(flag==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nw = [list(map(int, input().split())) for _ in range(n)]\r\nans = \"NO\"\r\nfor i in w:\r\n for j in w:\r\n if j[0] == sum(i) and sum(j) == i[0]:\r\n ans = \"YES\"\r\n break\r\n if ans == \"YES\":\r\n break\r\nprint(ans)", "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=vary(1)\r\npos,dis=[],[]\r\nfor i in range(n):\r\n p,d=vary(2)\r\n pos.append(p)\r\n dis.append(d)\r\nflag=0\r\nfor i in range(n):\r\n if flag==1:\r\n break\r\n for j in range(i+1,n):\r\n if pos[i]+dis[i]==pos[j] and pos[j]+dis[j]==pos[i]:\r\n print('YES')\r\n flag=1\r\n break\r\nelse:\r\n print('NO')\r\n\r\n\r\n\r\n \r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n", "n = int(input())\r\ns = set()\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n b = a + b\r\n c = (min(a, b), max(a, b))\r\n if c in s:\r\n print('YES')\r\n exit(0)\r\n else:\r\n s.add(c)\r\nprint('NO')\r\n", "n = int(input())\nres, cml = \"NO\", {}\nfor i in range(n):\n x, d = (int(i) for i in input().split())\n if x + d in cml and x + d + cml[x + d] == x:\n res = \"YES\"\n cml[x] = d\nprint(res)\n", "n = int(input())\r\nl = []\r\nfor i in range(n):\r\n x, d = map(int, input().split())\r\n l.append((x, d))\r\n\r\nyes = False\r\nfor i in range(n - 1):\r\n for j in range(i + 1, n):\r\n if l[i][0] + l[i][1] == l[j][0] and l[j][0] + l[j][1] == l[i][0]:\r\n yes = True\r\n\r\nprint(\"YES\" if yes else \"NO\")", "n=int(input())\r\ndi={}\r\nl=[]\r\nfor i in range(n):\r\n x,d=[int(j) for j in input().split()]\r\n l.append(x)\r\n di[x]=x+d\r\nflag=False\r\nfor j in l:\r\n num=di[j]\r\n if num in di.keys():\r\n if di[num]==j:\r\n flag=True\r\n break\r\nif flag==True:\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "n = int(input())\r\nans = 'NO'\r\nmydict = dict()\r\nwhile n > 0:\r\n n -= 1\r\n x, d = [int(item) for item in input().split(' ')]\r\n mydict [x] = d\r\n\r\nfor item in mydict:\r\n first = item + mydict[item]\r\n if first in mydict and (first + mydict[first] == item):\r\n ans = 'YES'\r\n\r\nprint(ans)", "def main():\r\n\tn = int(input())\r\n\tli = []\r\n\tfor _ in range(n):\r\n\t\tx, d = map(int, input().split())\r\n\t\tli.append([x, d])\r\n\r\n\tdic = {}\r\n\tfor i in range(n):\r\n\t\tdic[li[i][0]] = []\r\n\r\n\tfor i in range(n):\r\n\t\tif li[i][0] + li[i][1] in dic:\r\n\t\t\tdic[li[i][0] + li[i][1]].append(li[i][0])\r\n\r\n\tflag = False\r\n\tfor key in dic:\r\n\t\tfor el in dic[key]:\r\n\t\t\tif key in dic[el]:\r\n\t\t\t\tflag = True\r\n\r\n\tif flag:\r\n\t\tprint('YES')\r\n\telse:\r\n\t\tprint('NO')\r\n\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "has = set()\r\nfor _ in range(int(input())):\r\n x = tuple(map(int, input().split()))\r\n cek = (x[0] + x[1], x[1] * -1)\r\n if cek in has:\r\n print(\"YES\")\r\n break\r\n has.add(x)\r\nelse:\r\n print(\"NO\")\r\n", "s = set()\r\nflag = False\r\nfor i in range(int(input())):\r\n a, b = map(int, input().split())\r\n if (a+b, -b) in s:\r\n flag = True\r\n s.add((a, b))\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def check(cam1, cam2):\r\n if cam1[0] + cam1[1] == cam2[0] and cam2[0] + cam2[1] == cam1[0]:\r\n return True\r\n return False\r\n\r\ncamels = [[int(y) for y in input().split()] for x in range(int(input()))]\r\nfor x in range(len(camels) - 1):\r\n for y in range(x + 1, len(camels)):\r\n if check(camels[x], camels[y]):\r\n print('YES')\r\n exit()\r\nprint('NO')", "n = int(input())\r\n\r\nspit = []\r\nx_listed = []\r\n\r\nfor y in range(n):\r\n x, d = map(int, input().split())\r\n sums = x + d\r\n x_listed.append(x)\r\n spit.append(sums)\r\n\r\nans = ''\r\n\r\nfor a in range(n - 1):\r\n for b in range(a + 1, n):\r\n if spit[a] == x_listed[b]:\r\n if spit[b] == x_listed[a]:\r\n ans = 'YES'\r\n break\r\n\r\nif ans != 'YES':\r\n ans = 'NO'\r\n\r\nprint(ans)\r\n", "import sys\n\nn = int(sys.stdin.readline())\n\nspitted = {}\n\nfor _ in range(n):\n x,d = map(int,sys.stdin.readline().split())\n if x not in spitted:\n spitted[x] = [set(),set()]\n if x+d not in spitted:\n spitted[x+d] = [set(),set()]\n spitted[x+d][0].add(x)\n spitted[x][1].add(x+d)\n\nfor camel in spitted:\n if spitted[camel][0] & spitted[camel][1]:\n print('YES')\n exit(0)\nprint('NO')\n", "num = int(input())\r\npos = []\r\ntar = []\r\nhits = False\r\n\r\nfor i in range(num):\r\n p, t = input().split()\r\n pos.append(int(p))\r\n tar.append(int(p) + int(t))\r\n\r\nfor i in range(len(tar)):\r\n for j in range(len(tar)):\r\n if tar[i] == pos[j] and tar[j] == pos[i] and i != j:\r\n hits = True\r\n \r\nif hits:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nDistancias = [0]*n\r\nPosiciones = [0]*n\r\nfor k in range (n):\r\n L = input()\r\n L = L.split()\r\n P = int(L[0])\r\n d = int(L[1])\r\n Distancias[k]=P+d\r\n Posiciones[k]=P\r\nAux = 0\r\nfor k in range (n):\r\n for i in range (n):\r\n if Posiciones[k]==Distancias[i]:\r\n if Posiciones[i]==Distancias[k]:\r\n Aux =1\r\nif Aux ==1:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\nx = list()\nd = list()\ncount = False\nfor i in range(n):\n s, t = map(int, input().split())\n x.append(s)\n d.append(t)\nfor i in range(n):\n for j in range(n):\n if i != j:\n if x[i]+d[i] == x[j] and x[j]+d[j] == x[i]:\n count = True\nif count == True:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\n", "n=int(input())\r\nc=[]\r\ns=[]\r\nflag=0\r\nfor _ in range(n):\r\n x,d=map(int,input().split())\r\n c.append(x)\r\n s.append(d)\r\nfor i in range(len(c)):\r\n for j in range(len(c)):\r\n if c[i]+s[i]==c[j] and c[j]+s[j]==c[i]:\r\n flag=1\r\n break\r\nif flag==1:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\nl = []\nfor _ in range(n):\n t = [int(i) for i in input().split()]\n t[1]+= t[0]\n l.append(t)\nl.sort(key = lambda x:x[0])\nm = [[i[1],i[0]] for i in l]\nm.sort(key = lambda x:x[0])\ni = 0\nj = 0\nwhile i<n and j<n:\n if l[i][0]>m[j][0]:\n j+=1\n elif l[i][0]<m[j][0]:\n i+=1\n elif l[i][0]==m[j][0]:\n if l[i][1]==m[j][1]:\n print(\"YES\")\n break\n else:\n i+=1 \n j+=1 \nelse:\n print(\"NO\")\n \n\t \t\t\t\t\t\t \t\t \t\t \t\t\t\t\t \t\t", "def main():\n num = int(input())\n arr = []\n for i in range(num):\n x = [int(y) for y in input().split()]\n arr.append(x)\n\n for i in range(len(arr)):\n for j in range(i+1, len(arr)):\n if ((arr[i][0] + arr[i][1] == arr[j][0]) and (arr[j][0] + arr[j][1] == arr[i][0])):\n print(\"YES\")\n return\n print(\"NO\")\n\nmain()\n\t \t \t\t\t \t\t\t \t\t \t\t\t\t \t\t\t\t \t", "n = int(input())\r\ncamel = []\r\nflag = False\r\n\r\nfor i in range(n):\r\n camel.append(input().split())\r\n camel[i][0] = int(camel[i][0])\r\n camel[i][1] = int(camel[i][1])\r\n\r\n\r\nfor i in range(len(camel)):\r\n sum = camel[i][0] + camel[i][1]\r\n for j in range(i + 1, len(camel)):\r\n if sum == camel[j][0]:\r\n sum2 = camel[j][0] + camel[j][1]\r\n if sum2 == camel[i][0]:\r\n flag = True\r\n break\r\n if flag:\r\n print(\"YES\")\r\n break\r\n\r\nif not flag:\r\n print(\"NO\")", "n = int(input())\r\n\r\ndt = {}\r\ndef solve():\r\n for _ in range(n):\r\n x, d = map(int, input().split())\r\n \r\n if x in dt and x + d in dt[x]:\r\n return \"YES\"\r\n \r\n if x + d in dt:\r\n dt[x + d].add(x)\r\n else:\r\n dt[x + d] = set([x])\r\n \r\n return \"NO\"\r\n\r\nprint(solve())", "n=int(input())\r\nx=[]\r\ny=[]\r\nfor _ in range(n):\r\n xi,di=map(int,input().split())\r\n x.append(xi)\r\n y.append(di)\r\n\r\nfor i in range(n):\r\n (x1, d1) = (x[i],y[i])\r\n for j in range(i + 1, n):\r\n (x2, d2) = (x[j],y[j])\r\n if (x1 == x2 + d2 and x2 == x1 + d1):\r\n print('YES')\r\n exit()\r\nprint(\"NO\")\r\n \r\n ", "n = input()\r\nn = int(n)\r\na = []\r\nfor i in range(n):\r\n x = list(input().split())\r\n x = [int(i) for i in x]\r\n x.append(x[0] + x[1])\r\n a.append(x)\r\n\r\nt = True\r\nfor i in range(n):\r\n for j in range(n):\r\n if not i == j:\r\n if a[j][0] == a[i][2] and a[i][0] == a[j][2]:\r\n print(\"YES\")\r\n t = False\r\n break\r\n if not t:\r\n break\r\n\r\nif t:\r\n print(\"NO\")", "x=[]\r\nfor _ in range(int(input())):\r\n k=list(map(int, input().split()))\r\n k[1]+=k[0]\r\n x.append(k)\r\ny=[0]*100\r\ncnt=0\r\nfor i in range(len(x)):\r\n if y[i]==0 and x[i][::-1] in x:\r\n cnt+=1\r\n y[x.index(x[i][::-1])]=1\r\nprint(\"YES\" if cnt>0 else \"NO\")", "n = int(input());\r\nc = []\r\ns = []\r\nfor _ in range(n):\r\n x,d = map(int,input().split());\r\n c.append(x);\r\n s.append(x+d);\r\ngood = False;\r\nfor i in range(n):\r\n if s[i] in c and s[c.index(s[i])] == c[i]:\r\n print(\"YES\");\r\n good = True;\r\n break;\r\nif not good:\r\n print(\"NO\");", "n = int(input())\r\nx = d = []\r\nfor i in range(n):\r\n xx, dd = map(int,input().split())\r\n x = x + [xx]\r\n d = d + [dd]\r\nanswer = 'NO'\r\ni = 0\r\nwhile i<n and answer=='NO':\r\n j = i + 1\r\n while j<n and answer=='NO':\r\n if (x[j]+d[j]==x[i]) and (x[i]+d[i]==x[j]):\r\n answer = 'YES'\r\n j = j + 1\r\n i = i + 1\r\nprint(answer)\r\n \r\n \r\n", "def solu(n):\r\n dct={}\r\n for i in range(0,n):\r\n pos,cor=map(int,input().split(' '))\r\n dct[pos]=cor\r\n for i in dct:\r\n m=i+dct[i]\r\n if m in dct:\r\n j=dct[m]+m\r\n if i==j:\r\n return 'YES'\r\n return 'NO'\r\nprint(solu(int(input())))", "n = int(input())\r\n\r\ncamel = {}\r\nfor i in range(n):\r\n a,b = map(int, input().split())\r\n camel[a] = b\r\n\r\nflag=False\r\nfor key in camel.keys():\r\n p = key+camel[key]\r\n if p in camel and camel[p]+p==key:\r\n flag=True\r\n\r\nif(flag):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n\r\n ", "def main():\n n = int(input())\n\n each_other = False\n position = []\n spit_place = []\n for i in range(n):\n pos, spit = [int(i) for i in input().split()]\n\n spit_pos = spit + pos\n\n try:\n target = position.index(spit_pos)\n if(spit_place[target] == pos):\n each_other = True\n except:\n pass\n position.append(pos)\n spit_place.append(pos + spit)\n \n if(each_other):\n print('YES')\n else:\n print('NO')\nmain()\n\t\t\t \t\t \t \t \t\t\t \t \t \t\t\t\t \t \t", "def solve():\n n = int(input())\n dados = {}\n yes = False\n for i in range(n):\n x,d = map(int,input().split())\n dados[x] = (x+d)\n if((x+d) in list(dados.keys()) and yes == False):\n if(dados[x+d]==x):\n print(\"YES\")\n yes = True\n if(yes == False):\n print(\"NO\")\n \nsolve()\n\t\t\t \t\t\t \t \t \t\t \t \t \t\t \t", "x = int(input())\r\nfirst = []\r\nsecond = []\r\nfor i in range(x):\r\n a,b = input().split()\r\n first.append(int(a))\r\n second.append(int(b))\r\nu = True\r\nfor j in range(x):\r\n sums = first[j] + second[j]\r\n for k in first:\r\n if k == sums:\r\n w = first.index(k)\r\n if k + second[w] == first[j] and u == True:\r\n print('YES')\r\n u = False\r\nif u == True:\r\n print(\"NO\") \r\n\r\n", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append([int(x) for x in input().split()])\r\nfor i in range(n):\r\n for j in range(i+1, n):\r\n if a[i][0] + a[i][1] == a[j][0] and a[j][0] + a[j][1] == a[i][0]:\r\n n = -1\r\n break\r\nif n == -1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "# -*- coding: utf-8 -*-\r\n\r\nlista,dist,cont = [],[],0\r\nn = int(input())\r\n\r\nfor i in range(n):\r\n x,y = map(int,input().split())\r\n lista.append(x)\r\n dist.append(x+y)\r\n\r\nfor i in range(n):\r\n if dist[i] in lista:\r\n if lista[i] == dist[lista.index(dist[i])]: cont = 1; break\r\n\r\nif cont == 0: print('NO')\r\nelse: print('YES')\r\n\r\n", "def solve():\r\n a = []\r\n b = []\r\n for _ in range(int(input())):\r\n n, t = map(int, input().split())\r\n a.append(n)\r\n b.append(n+t)\r\n c = 0\r\n \r\n for i in range(len(a)):\r\n for j in range(len(b)):\r\n if a[i]==b[j] and b[i]==a[j] and i!=j:\r\n \r\n c = 1\r\n break\r\n if c==1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nif __name__ == \"__main__\": \r\n solve()", "def main():\r\n n = int(input())\r\n c = [tuple(map(int,input().split())) for i in range(n)]\r\n pairs = [(a,b) for a in c for b in c]\r\n for (a,b) in pairs:\r\n if a[0] + a[1] == b[0] and b[0] + b[1] == a[0]:\r\n return 'YES'\r\n return 'NO'\r\n\r\nprint(main())\r\n", "inp = int(input())\r\ncamels = dict()\r\nsums = list()\r\ndodawanie = 0\r\n\r\nfor i in range(inp):\r\n wej = [int(j) for j in input().split()]\r\n camels[wej[0]] = wej[1]\r\n\r\n\r\nfor key in camels:\r\n if int(key) + int(camels[key]) in camels:\r\n if camels[int(key) + int(camels[key])] + int(key) + int(camels[key]) == key:\r\n print(\"YES\")\r\n dodawanie +=1\r\n break\r\n\r\nif dodawanie == 0:\r\n print(\"NO\")\r\n", "n = int(input())\r\nnums = []\r\nfor j in range(n):\r\n nums.append([int(j) for j in input().split()])\r\noutput = \"NO\"\r\nfor j in range(n):\r\n for k in range(j + 1, n):\r\n if nums[j][0] + nums[j][1] == nums[k][0]:\r\n if nums[k][1] + nums[k][0] == nums[j][0]:\r\n output = \"YES\"\r\n break\r\n if output == \"YES\":\r\n break\r\nprint(output)\r\n", "# -*- coding: utf-8 -*-\n\nn_camels = int(input())\n\ncamels = {}\n\nresult = False\n\nfor i in range(n_camels):\n data = input().split(' ')\n camels[int(data[0])] = int(data[1]) # position, distance\n\nfor i in camels.keys():\n target = i + camels[i]\n if target in camels.keys():\n if target + camels[target] == i:\n result = True\n break\n\nif result:\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", "import sys\r\nimport math\r\n\r\nn = int(sys.stdin.readline())\r\n\r\nx = [60002] * 60003\r\nfor i in range(n):\r\n xi, di = [int(v) for v in (sys.stdin.readline()).split()]\r\n x[xi + 30000] = xi + 30000 + di\r\n \r\n\r\nfor i in range(-10000, 10000):\r\n if(x[x[i + 30000]] == i + 30000):\r\n print(\"YES\")\r\n exit()\r\n \r\nprint(\"NO\")\r\n\r\n\r\n \r\n\r\n \r\n ", "l = []\r\nfor _ in range(int(input())): l.append(list(map(int,input().split())))\r\nfor i in range(len(l)):\r\n for j in range(len(l)):\r\n if i != j:\r\n if l[i][0] + l[i][1] == l[j][0] and l[j][0] + l[j][1] == l[i][0]:\r\n print(\"YES\")\r\n quit()\r\nprint(\"NO\")", "s=set()\r\nfor _ in range(int(input())):\r\n x,d=map(int,input().split())\r\n if (x+d,-d) in s:\r\n print('YES');exit()\r\n s.add((x,d))\r\n\r\nprint('NO')", "h = set()\r\n\r\nfor _ in range(int(input())):\r\n x, d = map(int, input().split())\r\n if (x,d) in h:\r\n print('YES')\r\n break\r\n h.add((x+d,-d))\r\nelse:\r\n print('NO')", "n = int(input())\npos = []\ncosp = []\nresult = \"NO\"\n\nfor i in range(n):\n camel = input()\n camel = list(map(int, camel.split(\" \")))\n pos.append(camel[0])\n cosp.append(camel[0]+camel[1])\n\nfor i in range(len(cosp)):\n for j in range(len(pos)):\n if (cosp[i] == pos[j] and cosp[j] == pos[i]):\n result = \"YES\"\n\nprint(result)\n \t \t \t \t \t\t\t \t\t", "#Spit Problem\r\nncamels=int(input())\r\ncData=[]\r\nfor i in range(ncamels):\r\n temp=input().split()\r\n location=int(temp[0])\r\n movement=int(temp[1])\r\n cData.append([location,movement])\r\n\r\n\r\nfor camel in cData:\r\n camel[1]=camel[0]+camel[1]\r\n\r\nbutton=0\r\nfor camel in cData:\r\n for others in cData:\r\n if camel[1]==others[0] and not camel==others and camel[0]==others[1]:\r\n print(\"YES\")\r\n button=1\r\n break\r\n if button==1:\r\n break\r\nif button==0:\r\n print(\"NO\")\r\n", "n = int(input())\r\nsum = []\r\nx = []\r\nflag = False\r\nfor i in range(n):\r\n s = input().split()\r\n x.append(int(s[0]))\r\n sum.append(int(s[0]) + int(s[1]))\r\nfor c in range(len(sum)):\r\n for j in range(len(x)):\r\n if sum[c] == x[j] and sum[j] == x[c]:\r\n print(\"YES\")\r\n flag = True\r\n break\r\n if flag:\r\n break\r\nelse:\r\n print(\"NO\")", "#input n\r\nn = int(input())\r\n\r\n#alfabet\r\nx =[]\r\nd = []\r\na = 0\r\nnew_x = 0\r\nkuda = 0\r\n\r\n#input in x and d\r\nfor i in range(n):\r\n x1,d1 = map(int, input().split())\r\n x.append(x1)\r\n d.append(d1)\r\n\r\n#math\r\nfor i in range(n):\r\n a = x[i] + d[i]\r\n #print(\"В кого попал -\", a)\r\n if a in x:\r\n new_x = x.index(a)\r\n kuda = x[new_x] + d[new_x]\r\n if kuda == x[i]:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\nnums=[list(map(int,input().split())) for i in range(n)]\r\nfor el in nums:\r\n for br in nums:\r\n if(el[0]+el[1]==br[0] and br[0]+br[1]==el[0]):\r\n print(\"YES\")\r\n quit()\r\nprint(\"NO\")\r\n\r\n", "n = int(input().strip())\nxs = {}\nspits = False\nfor i in range(n):\n x, d = [ int(k) for k in input().strip().split() ]\n xs[x] = xs.get(x, []) + [d]\nspits_in_each_other = False\nfor x in xs:\n for d1 in xs[x]:\n for d2 in xs.get(x+d1, []):\n if (x + d1 + d2) == x:\n spits_in_each_other = True\n break\n if spits_in_each_other:\n break\n if spits_in_each_other:\n break\nif spits_in_each_other:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\n\n \t\t\t \t \t \t\t \t\t \t\t \t \t\t \t", "di = {}\r\nk = 0\r\nn = int(input())\r\n\r\nfor _ in range(n):\r\n a,b = map(int,input().split())\r\n di[a]= b\r\n\r\nsorted(di)\r\n\r\nfor i in di:\r\n if di[i]>=0:\r\n dis = di[i]+i\r\n if dis in di and di[dis]+dis==i:\r\n print(\"YES\")\r\n k = 1\r\n break\r\nif k == 0:\r\n print(\"NO\")\r\n\r\n", "n = int(input())\r\nx = [0]*n\r\nd = [0]*n\r\nfor i in range(n):\r\n x[i],d[i] = map(int,input().split())\r\nfor i in range(n):\r\n if x[i] + d[i] in x and d[x.index(x[i] + d[i])] + x[i] + d[i] == x[i]: print(\"YES\"); exit()\r\nprint(\"NO\")\r\n", "a=[[*map(int,s.split())]for s in[*open(0)][1:]]\r\nprint('YNEOS'[all(u+v!=w or w+x!=u for u,v in a for w,x in a)::2])", "n=int(input())\r\ncamels=[]\r\nfor _ in range(n):\r\n camels.append([int(i) for i in input().split()])\r\ncamels.sort(key=lambda x:x[0])\r\n\r\ndef spiteachother(camel1,camel2):\r\n pos1,dis1=camel1\r\n pos2,dis2=camel2\r\n spit1=pos1+dis1\r\n spit2=pos2+dis2\r\n if pos1==spit2 and pos2==spit1:\r\n return True\r\n return False\r\ncheck=False\r\nfor i in range(n-1):\r\n if check:break\r\n for j in range(i+1,n):\r\n cam1=camels[i]\r\n cam2=camels[j]\r\n if spiteachother(cam1,cam2):\r\n check=True\r\n break\r\nif check:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n", "s=[];ans='NO'\r\nfor x in range(int(input())):\r\n a,b=map(int,input().split())\r\n b=a+b\r\n if [b,a] in s: ans=\"YES\"\r\n else: s.append([a,b])\r\nprint(ans)", "a = int(input())\r\nd1,d = [],[]\r\nc = 0\r\nfor i in range(a):\r\n m,n = map(int,input().split())\r\n d.append(m)\r\n d1.append(m + n)\r\n\r\nfor i in range(a):\r\n for j in range (a):\r\n if d[i] == d1[j] and d[j] == d1[i]:\r\n c+=1\r\n\r\nif c:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "pos=[]\r\nneg=[]\r\nfor _ in range(int(input())):\r\n\tx,d=map(int,input().split())\r\n\tif d>=0:\r\n\t\tpos.append([x,d])\r\n\telse:\r\n\t\tneg.append([x,d])\r\n\r\nq=False\r\nfor y in range(len(neg)):\r\n\tk=neg[y][0]+neg[y][1]\r\n\tfor x in range(len(pos)):\r\n\t\tif pos[x][0]==k and pos[x][0]+pos[x][1]==neg[y][0]:\r\n\t\t\tprint('YES')\r\n\t\t\tq=True\r\n\t\t\tbreak\r\n\tif q==True:\r\n\t\tbreak\r\nelse:\r\n\tprint('NO')", "v=[]\r\nv1=[]\r\ns=0\r\nfor i in range(int(input())):\r\n x,d=map(int,input().split())\r\n v.append(x)\r\n v1.append(d)\r\n\r\nfor x in range(len(v)):\r\n for y in range(x+1,len(v)):\r\n if v[x]+v1[x] == v[y] and v[y]+v1[y] == v[x]:\r\n print('YES')\r\n s=1\r\n break\r\n if s==1:\r\n break\r\n\r\nif s==0:\r\n print('NO')\r\n", "c=[]\r\ny=False\r\nfor i in range(int(input())):\r\n x,s=map(int,input().split())\r\n if [x+s,x] in c:\r\n print(\"YES\")\r\n exit()\r\n c.append([x,x+s])\r\nprint(\"NO\")\r\n\r\n\r\n", "n = int(input())\r\nl = list()\r\nfor i in range(n):\r\n x, d = map(int, input().split())\r\n if [x + d, x] in l:\r\n print('YES')\r\n exit()\r\n l.append([x, x + d])\r\nprint('NO')", "spits = {}\n\nn = int(input())\n\nfor i in range(n):\n x, d = [int(x) for x in input().split()]\n spits[x] = d\n\ndef spitting(spits):\n camels = spits.keys()\n position = 0\n for camel in spits:\n position = camel + spits[camel]\n if position in camels:\n if spits[position] + position == camel:\n return 'YES'\n return 'NO'\n\nprint(spitting(spits))\n", "n = int(input())\nl = [None] * n\nt = [None] * n\nfor i in range(n):\n l[i], t[i] = map(int, input().split())\nf = False\nfor i in range(n):\n j = l[i] + t[i]\n if l.count(j) == 1 and t[l.index(j)] == -t[i]:\n f = True\n break\nif f == True:\n print('YES')\nelse:\n print('NO')\n", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n x,d = list(map(int, input().split(\" \")))\r\n a.append([x,x+d])\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n if a[i][0]==a[j][1] and a[i][1]==a[j][0]:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")\r\n" ]

[ "MAX = 55\r\nberland = [None] * MAX\r\ndesberland = [None] * MAX\r\ndr = [-1, 0, 0, 1]\r\ndc = [0, -1, 1, 0]\r\nanswer = []\r\nvisited = [[False for _ in range(MAX)] for _ in range(MAX)]\r\npath = [[0 for _ in range(MAX)] for _ in range(MAX)]\r\ndef DFSLakes(sr, sc):\r\n global count, total, testEsc\r\n s = [(sr, sc)]\r\n visited[sr][sc] = True\r\n temp = []\r\n while len(s):\r\n ur, uc = s.pop()\r\n temp.append((ur, uc))\r\n if ur == 0 or uc == 0 or ur == n - 1 or uc == m - 1:\r\n testEsc = True\r\n\r\n for i in range(4):\r\n r = ur + dr[i]\r\n c = uc + dc[i]\r\n\r\n if r in range(n) and c in range(m) and berland[r][c] == '.' and not visited[r][c]:\r\n visited[r][c] = True\r\n path[ur][uc] = (r, c)\r\n total += 1\r\n s.append((r, c))\r\n if not testEsc:\r\n answer.append(temp)\r\n\r\nn, m, k = map(int, input().split())\r\nfor i in range(n):\r\n berland[i] = list(input())\r\n # for j in range(m):\r\n # answer[i * m + j + 1] = 0\r\n\r\ncount = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if berland[i][j] == '.' and visited[i][j] == False:\r\n count += 1\r\n total = 1\r\n testEsc = False\r\n DFSLakes(i, j)\r\n\r\nanswer.sort(key=lambda x: len(x))\r\nt = 0\r\nfor i in range(len(answer) - k):\r\n t += len(answer[i])\r\n for r, c in answer[i]:\r\n berland[r][c] = '*'\r\n\r\nprint(t)\r\nfor i in range(n):\r\n for j in range(m):\r\n if berland[i][j] == '*':\r\n print('*', end='')\r\n else:\r\n print('.', end='')\r\n print()", "n,m,k=map(int,input().split())\r\nvisited=[[False]*(52) for _ in range(54)]\r\nl=[]\r\nmatrix=[]\r\nfor _ in range(n):\r\n matrix.append(list(el for el in input()))\r\ndef dfs(i,j):\r\n visited[i][j]=True\r\n q=[(i,j)]\r\n t=[]\r\n f=False\r\n while q:\r\n x,y=q.pop()\r\n t.append((x,y))\r\n if x==0 or x==n-1 or y==0 or y==m-1:\r\n f=True\r\n \r\n for dx,dy in [(1,0),(0,1),(-1,0),(0,-1)]:\r\n nx,ny=dx+x,dy+y\r\n if 0<=nx<n and 0<=ny<m and matrix[nx][ny]==\".\" and visited[nx][ny]==False:\r\n q.append((nx,ny))\r\n visited[nx][ny]=True \r\n if not f:\r\n l.append(t)\r\n \r\nfor i in range(n):\r\n for j in range(m):\r\n if visited[i][j]==False and matrix[i][j]==\".\":\r\n dfs(i,j)\r\nl.sort(key=lambda x:(len(x)))\r\nans=0\r\nfor i in range(len(l)-k):\r\n ans+=len(l[i])\r\n for x,y in l[i]:\r\n matrix[x][y]=\"*\"\r\nprint(ans)\r\nfor el in matrix:\r\n print(\"\".join(el))\r\n ", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).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\ndef f(u, v):\r\n return u * m + v\r\n\r\nn, m, k = map(int, input().split())\r\ns = [list(input().rstrip()) for _ in range(n)]\r\nl = n * m\r\nroot = [i for i in range(l + 1)]\r\nrank = [1 for _ in range(l + 1)]\r\nsize = [1 for _ in range(l + 1)]\r\nfor i in range(n):\r\n unite(f(i, 0), l)\r\n unite(f(i, m - 1), l)\r\nfor j in range(m):\r\n unite(f(0, j), l)\r\n unite(f(n - 1, j), l)\r\nfor i in range(n):\r\n si = s[i]\r\n for j in range(m - 1):\r\n if si[j] & si[j + 1] & 4:\r\n unite(f(i, j), f(i, j + 1))\r\nfor i in range(n - 1):\r\n s1, s2 = s[i], s[i + 1]\r\n for j in range(m):\r\n if s1[j] & s2[j] & 4:\r\n unite(f(i, j), f(i + 1, j))\r\nx = []\r\nfor i in range(n):\r\n si = s[i]\r\n for j in range(m):\r\n if not si[j] & 4 or get_root(f(i, j)) ^ f(i, j) or same(0, f(i, j)):\r\n continue\r\n x.append((get_size(f(i, j)), f(i, j)))\r\nx.sort()\r\nz = len(x)\r\nu = set()\r\nans = 0\r\nfor i in range(z - k):\r\n s0, j = x[i]\r\n ans += s0\r\n u.add(j)\r\nprint(ans)\r\nans = []\r\nfor i in range(n):\r\n si = s[i]\r\n for j in range(m):\r\n if get_root(f(i, j)) in u:\r\n si[j] = 42\r\n ans0 = \"\".join((chr(j) for j in si))\r\n ans.append(ans0)\r\nsys.stdout.write(\"\\n\".join(ans))" ]

[ "n,k = map(int,input().split())\r\nl = sorted(list(map(int,input().split())))\r\na = [1] + l\r\nprint(a[k] if k == n or a[k + 1] - a[k] else -1)", "#initialize sscenario\r\nn, k = map(int, input().split(' '))\r\nintegers = []\r\n\r\n#makes a list of integers then orders it from highest to lowest\r\nfor integer in input().split(' '):\r\n integers.append(int(integer))\r\nintegers.sort()\r\n\r\n\r\nif k == 0: #if k is equal to 0 (nothing less than or equal to)\r\n if integers[0] == 1: #no possible answer if first digit is 1\r\n print(-1)\r\n else: #only answer is 1\r\n print(1)\r\nelif k == n: #if whole list should be less than or equal to output\r\n print(integers[k - 1])\r\nelif integers[k] == integers[k - 1]: #no possible answer\r\n print(-1)\r\nelse:\r\n print(integers[k - 1])\r\n", "n,k = map(int,input().split())\r\nnums = list(map(int,input().split()))\r\nnums.sort()\r\nc = 0\r\nsol = -1\r\nif k==0:\r\n sol = nums[0]-1\r\nelse:\r\n sol = nums[k-1]\r\n\r\nfor n in nums:\r\n if n<= sol:\r\n c+=1\r\n\r\nif c != k or sol < 1:\r\n print(\"-1\")\r\nelse:\r\n print(sol)", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\nif k==0:\r\n if a[0]!=1:\r\n print(a[0]-1)\r\n else:\r\n print(-1)\r\nelse:\r\n if k==n :\r\n print(a[-1])\r\n elif a[k-1]<a[k]:\r\n print(a[k-1])\r\n else:\r\n print(-1)", "n, k = map(int, input().split())\r\narray=list(map(int,input().split()))\r\narray=[1]+sorted(array)\r\nif n==k or array[k]!=array[k+1]:\r\n print(array[k])\r\nelse:\r\n print(-1)", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\na.insert(0, 1)\r\na.append(1000000001)\r\n\r\na.sort()\r\n\r\nif a[m] == a[m + 1]:\r\n print(-1)\r\nelse:\r\n print(a[m])\r\n", "F=lambda:map(int,input().split())\r\nn,k=F()\r\nA=[1]+sorted(F())\r\nprint(A[k] if k==n or A[k+1]-A[k] else -1)", "n , k = map(int, input().split())\r\nnums = sorted(list(map(int, input().split())))\r\nlst = [1]+nums\r\nif k == n or lst[k+1] - lst[k] !=0:\r\n print(lst[k])\r\nelse:\r\n print(-1)", "from 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 n, k = [int(x) for x in input().split()]\n a = sorted([int(x) for x in input().split()])\n if k == 0:\n if a[0] == 1:\n print(-1)\n else:\n print(1)\n elif k == n:\n print(a[-1])\n else:\n if a[k - 1] == a[k]:\n print(-1)\n else:\n print(a[k - 1])\n\n\nif __name__ == \"__main__\":\n main()\n", "k,L = map(int,input().split())\r\nl = sorted(list(map(int,input().split())))\r\nV = [1] + l\r\nprint(V[L] if L == k or V[L + 1] - V[L] else -1)", "m,d= map(int,input().split())\r\nb=list(map(int,input().split()))\r\n\r\nleft = 1\r\nright =10**9\r\n\r\nwhile left <= right:\r\n mid =(left+right)//2\r\n count=0\r\n for i in range(m):\r\n if b[i] <= mid:\r\n count += 1\r\n if count == d:\r\n print(mid)\r\n break\r\n elif count < d:\r\n left = mid +1\r\n else:\r\n right =mid-1\r\n\r\nif left > right:\r\n print(-1)", "#https://codeforces.com/problemset/problem/977/C\r\n\r\n(n, k) = (int(x) for x in input().split())\r\na = sorted([int(x) for x in input().split()])\r\na.append(a[-1]+2)\r\nif(a[k] != a[k-1]):\r\n answer = a[k - 1]\r\n if k == 0:\r\n if a[0] <= 1:\r\n answer = -1\r\n else:\r\n answer = a[0]-1\r\nelse:\r\n answer = -1\r\n\r\nprint(answer)", "def find_x(n, k, sequence):\r\n sequence.sort() # Sort the sequence in non-decreasing order.\r\n \r\n if k == 0:\r\n return sequence[0] - 1 if sequence[0] > 1 else -1\r\n\r\n if k == n:\r\n return sequence[-1]\r\n\r\n count = 0\r\n x = sequence[k - 1]\r\n\r\n for num in sequence:\r\n if num <= x:\r\n count += 1\r\n else:\r\n break\r\n\r\n if count == k:\r\n return x\r\n else:\r\n return -1\r\n\r\n# Input\r\nn, k = map(int, input().split())\r\nsequence = list(map(int, input().split()))\r\n\r\n# Output\r\nresult = find_x(n, k, sequence)\r\nprint(result)\r\n", "n, m = map(int, input().split())\r\na = [1] + [int(x) for x in input().split()] + [1000000001]\r\na.sort()\r\n\r\nif a[m] == a[m + 1]:\r\n print(\"-1\")\r\nelse:\r\n print(a[m])\r\n", "import sys\r\nn, k = map(int, input().split())\r\narr = sorted([int(i) for i in sys.stdin.readline().split()])\r\na = [1] + arr\r\nprint(a[k] if k == n or a[k + 1] - a[k] else -1)", "def clear_stack(s):\r\n while s:\r\n s.pop()\r\n\r\ndef compare(r, l):\r\n return r[0] < l[0]\r\n\r\ndef zeus():\r\n n, k = map(int, input().split())\r\n arr = [0] * (n + 2)\r\n arr[1:n + 1] = map(int, input().split())\r\n arr[1:n + 1] = sorted(arr[1:n + 1])\r\n\r\n if k == 0:\r\n if arr[1] == 1:\r\n print(-1)\r\n else:\r\n print(1)\r\n elif arr[k] == arr[k + 1]:\r\n print(-1)\r\n else:\r\n print(arr[k])\r\nzeus()\r\n", "for _ in range(1):\r\n n, k = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n a.sort()\r\n \r\n if k == 0:\r\n ans = a[0] - 1\r\n if ans >= 1:\r\n print(ans)\r\n else:\r\n print(-1)\r\n continue\r\n \r\n if k == n:\r\n print(a[-1])\r\n continue\r\n \r\n if a[k - 1] != a[k]:\r\n print(a[k - 1])\r\n else:\r\n print(-1)\r\n", "n,k = map(int,input().split())\r\narr = [1]+list(map(int,input().split()))\r\narr.sort()\r\nif n == k or arr[k] != arr[k+1]:\r\n print(arr[k])\r\nelse:\r\n print(-1)", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\n\r\nif k == 0:\r\n ans = arr[0] - 1\r\nelif k == n:\r\n ans = arr[-1]\r\nelse:\r\n ans = arr[k - 1]\r\n\r\ncount = 0\r\nfor i in arr:\r\n if i <= ans:\r\n count += 1\r\n\r\nif count != k or ans < 1 or ans > 10**9:\r\n print(-1)\r\nelse:\r\n print(ans)\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\na.sort()\r\n\r\nif k == 0 and a[0] > 1:\r\n print(\"1\")\r\nelif k == 0 and a[0] == 1:\r\n print(\"-1\")\r\nelif k <= n - 1:\r\n if a[k - 1] != a[k]:\r\n print(a[k - 1])\r\n else:\r\n print(\"-1\")\r\nelif k == n:\r\n print(a[k - 1])\r\n", "n, k = map(int, input().split())\r\nsequence = list(map(int, input().split()))\r\n\r\nsequence.sort()\r\n\r\nif k == 0:\r\n print(sequence[0] - 1 if sequence[0] > 1 else -1)\r\nelif k == n:\r\n print(10**9)\r\nelif sequence[k - 1] != sequence[k]:\r\n print(sequence[k - 1])\r\nelse:\r\n print(-1)\r\n", "a, b = map(int, input().split())\r\narr = list(map(int, input().split()))\r\narr = [1] + sorted(arr)\r\nif a == b or arr[b] != arr[b + 1]:\r\n print(arr[b])\r\nelse:\r\n print(-1)", "def solve():\r\n n, k = map(int, input().split())\r\n nums = list(map(int, input().split()))\r\n \r\n nums.sort()\r\n ans = cnt = 0\r\n \r\n ans = nums[k-1]\r\n if k == 0:\r\n ans = nums[0]-1\r\n \r\n for num in nums:\r\n if num <= ans:\r\n cnt += 1\r\n \r\n if ans < 1 or cnt != k:\r\n return -1\r\n return ans\r\n\r\nprint(solve())\r\n \r\n \r\n \r\n ", "n, k = map(int, input().split())\r\nsequence = list(map(int, input().split()))\r\nsequence.sort()\r\n\r\nif k == 0:\r\n result = sequence[0] - 1 if sequence[0] > 1 else -1\r\nelif k == n:\r\n result = sequence[-1]\r\nelif sequence[k - 1] == sequence[k]:\r\n result = -1\r\nelse:\r\n result = sequence[k - 1]\r\n\r\nprint(result)\r\n", "n, k = map(int, input().split())\r\na = sorted(map(int, input().split()))\r\nif k == 0: # GET THE ELEMENT WHICH IS `SMALLER` THAN THE `SMALLEST ELEMENT` OF THE LIST\r\n print(a[0] - 1 if a[0] > 1 else -1)\r\nelif k == n: # GET THE LAST ELEMENT OF THE LIST\r\n print(a[n - 1])\r\nelif a[k - 1] == a[k]: # a[k-1] AND a[k] ARE THE SAME, SO `EXACTLY K` CONDITION IS NOT SATISFIED\r\n print(-1)\r\nelse: # ALL'S WELL, JUST GET THE (K-1)th ELEMENT\r\n print(a[k - 1])\r\n", "n, k = map(int, input().split())\r\nsequence = sorted(map(int, input().split()))\r\n\r\nif k == 0:\r\n print(sequence[0] - 1 if sequence[0] > 1 else -1)\r\nelif k == n:\r\n print(sequence[-1])\r\nelse:\r\n print(sequence[k - 1] if sequence[k - 1] < sequence[k] else -1)\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\n\r\nif k == 0:\r\n print(a[0] - 1 if a[0] > 1 else -1)\r\nelif k == n:\r\n print(a[-1])\r\nelif a[k - 1] == a[k]:\r\n print(-1)\r\nelse:\r\n print(a[k - 1])\r\n", "n,k = map(int,input().split())\r\narr = sorted(list(map(int,input().split())))\r\nif k == 0:\r\n ans = arr[0]-1\r\nelse:\r\n ans = arr[k-1]\r\ncnt = 0\r\nfor i in arr:\r\n if i <=ans:\r\n cnt+=1\r\nprint(-1 if ans<1 or cnt!=k else ans)", "n,k = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\nif k == 0:\r\n print(a[0] - 1 if a[0] - 1 > 0 else -1)\r\nelif n == k:\r\n print(a[-1])\r\nelse:\r\n if a[k-1] < a[k]:\r\n print(a[k-1])\r\n else:\r\n print(-1)", "n, k = map(int, input().split())\r\na = list(map(int, input().strip().split()))\r\na.sort()\r\nif k == len(a):\r\n print(a[k - 1])\r\nelse:\r\n if k == 0:\r\n if a[0] - 1 > 0:\r\n print(a[0] - 1)\r\n else:\r\n print(-1)\r\n elif a[k] == a[k - 1]:\r\n print(-1)\r\n else:\r\n print(a[k - 1])", "n, k = map(int, input().split())\r\n\r\nnums = [int(x) for x in input().split()]\r\n\r\nnums.sort()\r\n#handle the k = 0 case\r\nif k == 0:\r\n if nums[0] == 1:\r\n print(-1)\r\n else:\r\n print(1)\r\n exit(0)\r\n\r\nif k < n and nums[k-1] == nums[k]:\r\n print(-1)\r\nelse:\r\n print(nums[k-1])", "n, k = map(int, input().split())\n\nnums = list(map(int, input().split()))\n\n\nnums.sort()\nif k < 1:\n if nums[0] > 1:\n print(1)\n else:\n print(-1)\nelif k == n:\n print(nums[-1])\nelse:\n el = nums[k-1]\n if nums[k] == el:\n print(-1)\n else:\n print(el)\n", "def count_elements_less_than_or_equal(arr, x):\r\n count = 0\r\n for num in arr:\r\n if num <= x:\r\n count += 1\r\n return count\r\n\r\n\r\ndef find_x(arr, k):\r\n left, right = 1, 10**9\r\n\r\n while left <= right:\r\n mid = (left + right) // 2\r\n count = count_elements_less_than_or_equal(arr, mid)\r\n\r\n if count == k:\r\n return mid\r\n elif count < k:\r\n left = mid + 1\r\n else:\r\n right = mid - 1\r\n\r\n return -1\r\n\r\n\r\nn, k = map(int, input().split())\r\nsequence = list(map(int, input().split()))\r\n\r\nresult = find_x(sequence, k)\r\nprint(result)\r\n", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\narr.sort()\r\ncount = 0\r\nelement = arr[k - 1] if k > 0 and k <= n else -1 # Initializing element with -1 by default\r\n\r\nif k == 0:\r\n if arr[0] > 1:\r\n element = 1\r\nelse:\r\n for i in range(n):\r\n if arr[i] <= element:\r\n count += 1\r\n\r\n if count != k:\r\n element = -1\r\n\r\nprint(element)\r\n" ]

[ "s='ABCD'\r\na=list(map(int,input().split()))\r\nprint(48,50)\r\nfor k in range(4) :\r\n print(s[k]*50)\r\n cnt=0\r\n for i in range(11) :\r\n for j in range(50) :\r\n if i%2==0 and j%2==1 and cnt<a[(k+1)%4]-1 :\r\n print(s[(k+1)%4],end='')\r\n cnt=cnt+1\r\n else :\r\n print(s[k],end='')\r\n print('')", "abcd = input().split(' ')\r\na = int(abcd[0])\r\nb = int(abcd[1])\r\nc = int(abcd[2])\r\nd = int(abcd[3])\r\n\r\nout = []\r\nh = int(50 / 4)\r\nfor letter in 'D C B A'.split(' '):\r\n for i in range(h):\r\n out.append([letter for j in range(50)])\r\n\r\ny = 0\r\nfor counts in [a - 1,b - 1,c - 1,d - 1]:\r\n counter = 0\r\n shift = 1\r\n for q in range(3):\r\n for x in range(49):\r\n if counter == counts:\r\n break\r\n out[y + shift + x % 2][x] = ['A', 'B', 'C', 'D'][int(y / h)]\r\n counter += 1\r\n shift += 3\r\n if counter == counts:\r\n break\r\n if counter < counts:\r\n for i in range(counts - counter):\r\n out[y + shift][2 * x] = ['A', 'B', 'C', 'D'][4 - int(y / h)]\r\n y += h\r\n\r\nprint(4 * h, 50)\r\nfor line in out:\r\n print(''.join(line))\r\n", "quotas = [int(x) - 1 for x in input().split()]\r\ngrid = [['a'] * 50 for _ in range(12)] + \\\r\n [['b'] * 50 for _ in range(12)] + \\\r\n [['c'] * 50 for _ in range(12)] + \\\r\n [['d'] * 50 for _ in range(12)]\r\n\r\ndef poke(row, f_idx):\r\n for i in range(row + 1, row + 12, 2):\r\n for j in range(1, 50, 2):\r\n if quotas[f_idx] > 0:\r\n grid[i][j] = chr(ord('a') + f_idx)\r\n quotas[f_idx] -= 1\r\n\r\npoke(0, 3)\r\npoke(12, 2)\r\npoke(24, 1)\r\npoke(36, 0)\r\n\r\nprint('48 50')\r\nprint('\\n'.join([''.join(row) for row in grid]))\r\n", "import sys\r\ninput = sys.stdin.readline\r\nimport math\r\n\r\na,b,c,f = list(map(int,input().split()))\r\nn = m = 50\r\narr = [[0 for i in range(n)] for j in range(m)]\r\nd = dict()\r\na-=1\r\nb-=1\r\nc-=1\r\nf-=1\r\nd['a']=a\r\nd['b']=b\r\nd['c']=c\r\nd['d']=f\r\nletter = 'a'\r\nplacing = 'b'\r\ndone = False\r\nfor i in range(n):\r\n for j in range(m):\r\n if not i&1:\r\n arr[i][j]=letter\r\n if j==49 and done:\r\n done = False\r\n if letter == 'a':\r\n letter = 'b'\r\n placing = 'c'\r\n elif letter == 'b':\r\n letter = 'c'\r\n placing = 'd'\r\n elif letter=='c':\r\n letter = 'd'\r\n placing = 'a'\r\n else:\r\n done = True\r\n else:\r\n if j&1:\r\n arr[i][j]=letter\r\n else:\r\n if d[placing]==0:\r\n done = True\r\n if not done:\r\n arr[i][j]=placing\r\n d[placing]-=1\r\n else:\r\n arr[i][j]=letter\r\nprint(50,50)\r\nfor i in range(n):\r\n for j in range(m):\r\n print(arr[i][j],end=\"\")\r\n print()", "a, b, c, d = input().split(' ')\r\na = int(a)\r\nb = int(b)\r\nc = int(c)\r\nd = int(d)\r\nn = 50\r\nm = 48\r\narr = [['A'] * n if i < n//4 else ['B'] * n if i < 2*n//4 else ['C'] * n if i < 3*n//4 else ['D'] * n for i in range(m)]\r\nfor i in range(b - 1):\r\n arr[i // 25 * 2][i % 25 * 2] = 'B'\r\nfor i in range(c - 1):\r\n arr[12 + i // 25 * 2][i % 25 * 2] = 'C'\r\nfor i in range(d - 1):\r\n arr[24 + i // 25 * 2][i % 25 * 2] = 'D'\r\nfor i in range(a - 1):\r\n arr[36 + i // 25 * 2][i % 25 * 2] = 'A'\r\nprint(48, 50)\r\nfor i in range(48):\r\n print(''.join(arr[i]))", "a, b, c, d = [int(i) for i in input().split()]\r\nm = [['A'] * 50 for i in range(50)]\r\na -= 1\r\nb -= 1\r\nwhile b:\r\n for i in range(1, 50, 2):\r\n for j in range(1, 50, 2):\r\n if b and m[i][j] == 'A':\r\n m[i][j] = 'B'\r\n b -= 1\r\nwhile c:\r\n for i in range(1, 50, 2):\r\n for j in range(1, 50, 2):\r\n if c and m[i][j] == 'A':\r\n m[i][j] = 'C'\r\n c -= 1\r\nwhile d:\r\n for i in range(1, 50, 2):\r\n for j in range(1, 50, 2):\r\n if d and m[i][j] == 'A':\r\n m[i][j] = 'D'\r\n d -= 1\r\nfor i in range(42, 50):\r\n for j in range(50):\r\n m[i][j] = 'B'\r\nwhile a:\r\n for i in range(43, 50, 2):\r\n for j in range(1, 50, 2):\r\n if a and m[i][j] == 'B':\r\n m[i][j] = 'A'\r\n a -= 1\r\nprint(50, 50)\r\nfor i in range(50):\r\n print(*m[i], sep='')\r\n", "a,b,c,d=list(map(int,input().split()))\r\na-=1\r\nb-=1\r\nc-=1\r\nd-=1\r\ng=[]\r\nfor i in range(48):\r\n p=[]\r\n for j in range(50):\r\n if i>=0 and i<=11:\r\n p.append(\"A\")\r\n elif i>=12 and i<=23:\r\n p.append(\"B\")\r\n elif i>=24 and i<=35:\r\n p.append(\"C\")\r\n else:\r\n p.append(\"D\")\r\n g.append(p)\r\nfor i in range(1,12,2):\r\n for j in range(0,50,2):\r\n if b>0:\r\n g[i][j]=\"B\"\r\n b-=1\r\n if b==0:\r\n break\r\nfor i in range(13,24,2):\r\n for j in range(0,50,2):\r\n if c>0:\r\n g[i][j]=\"C\"\r\n c-=1\r\n if c==0:\r\n break\r\nfor i in range(25,36,2):\r\n for j in range(0,50,2):\r\n if d>0:\r\n g[i][j]=\"D\"\r\n d-=1\r\n if d==0:\r\n break\r\nfor i in range(37,48,2):\r\n for j in range(0,50,2):\r\n if a>0:\r\n g[i][j]=\"A\"\r\n a-=1\r\n if a==0:\r\n break\r\nprint(48,50)\r\nfor i in g:\r\n for j in i:\r\n print(j,end=\"\")\r\n print()", "a, b, c, d = map(int, input().split())\nA = [['A']*50 for i in range(12)]\nB = [['B']*50 for i in range(12)]\nC = [['C']*50 for i in range(12)]\nD = [['D']*50 for i in range(12)]\n\nX = []\nfor i in range(12):\n for j in range(50):\n if (i+j)%2 == 0 and i%2 == 0:\n X.append((i, j))\n\nfor i in range(c-1):\n y, x = X[i]\n A[y][x] = 'C'\n\nfor i in range(d-1):\n y, x = X[i]\n B[y][x] = 'D'\n\nfor i in range(a-1):\n y, x = X[i]\n C[y][x] = 'A'\n\nfor i in range(b-1):\n y, x = X[i]\n D[y][x] = 'B'\n\nprint(48, 50)\nfor i in range(12):\n print(''.join(A[i]))\nfor i in range(12):\n print(''.join(B[i]))\nfor i in range(12):\n print(''.join(C[i]))\nfor i in range(12):\n print(''.join(D[i]))\n", "a, b, c, d = list(map(int, input().split()))\r\nA = []\r\nfor row in range(40):\r\n\tA.append(['A'] * 50)\r\nfor row in range(10):\r\n\tA.append(['D'] * 50)\r\nfor i in range(b):\r\n\tA[(i // 25 * 2)][(i % 25) * 2] = 'B'\r\nfor i in range(c):\r\n\tA[8 + (i // 25 * 2)][(i % 25) * 2] = 'C'\r\nfor i in range(d - 1):\r\n\tA[16 + (i // 25 * 2)][(i % 25) * 2] = 'D'\r\nfor i in range(a - 1):\r\n\tA[41 + (i // 25 * 2)][(i % 25) * 2] = 'A'\r\nprint('50 50')\r\nfor row in range(50):\r\n\tprint(''.join(A[row]))", "a, b, c, d = map(int, input().split())\r\n\r\nARR = [\"\", \"\"]\r\n\r\na -= 1\r\nk = 1\r\nif a != 0:\r\n b -= 1\r\n while a != 0:\r\n ARR[k-1]+=\"BA\"\r\n ARR[k]+=\"BB\"\r\n a-=1\r\n\r\n if len(ARR[k]) == 50:\r\n ARR.append(\"\")\r\n ARR.append(\"\")\r\n k += 2\r\n ARR[k-1]+=\"BB\"\r\n ARR[k]+=\"BB\"\r\n\r\n if len(ARR[k]) == 50:\r\n ARR.append(\"\")\r\n ARR.append(\"\")\r\n k += 2\r\n \r\n\r\nwhile b != 0:\r\n ARR[k-1]+=\"AA\"\r\n ARR[k]+=\"AB\"\r\n b-=1\r\n\r\n if len(ARR[k]) == 50:\r\n ARR.append(\"\")\r\n ARR.append(\"\")\r\n k += 2\r\n\r\nwhile c != 0:\r\n ARR[k-1]+=\"AA\"\r\n ARR[k]+=\"AC\"\r\n c-=1\r\n if len(ARR[k]) == 50:\r\n ARR.append(\"\")\r\n ARR.append(\"\")\r\n k += 2\r\n\r\nwhile d != 0:\r\n ARR[k-1]+=\"AA\"\r\n ARR[k]+=\"AD\"\r\n d-=1\r\n\r\n if len(ARR[k]) == 50:\r\n ARR.append(\"\")\r\n ARR.append(\"\")\r\n k += 2\r\nq = len(ARR[k])\r\nwhile q != 50:\r\n ARR[k-1]+=\"A\"\r\n ARR[k]+=\"A\"\r\n q+=1\r\n\r\nprint(len(ARR), end=\" \")\r\nprint(len(ARR[0]))\r\nfor i in range(len(ARR)):\r\n print(ARR[i])", "from copy import deepcopy\r\nimport itertools\r\nfrom bisect import bisect_left\r\nfrom bisect import bisect_right\r\nimport math\r\n\r\n\r\ndef read():\r\n return int(input())\r\n\r\n\r\ndef readmap():\r\n return map(int, input().split())\r\n\r\n\r\ndef readlist():\r\n return list(map(int, input().split()))\r\n\r\n\r\nA, B, C, D = readmap()\r\n\r\nprint(50, 50)\r\n\r\narr = []\r\nfor _ in range(25):\r\n vec = [\"A\"] * 25 + [\"B\"] * 25\r\n arr.append(vec)\r\n\r\nfor _ in range(25):\r\n vec = [\"C\"] * 25 + [\"D\"] * 25\r\n arr.append(vec)\r\n\r\ni = 1\r\nj = 1\r\n\r\nfor _ in range(B-1):\r\n arr[i][j] = \"B\"\r\n j += 2\r\n if j == 25:\r\n j = 1\r\n i += 2\r\n\r\ni = 1\r\nj = 26\r\n\r\nfor _ in range(A-1):\r\n arr[i][j] = \"A\"\r\n j += 2\r\n if j == 50:\r\n j = 26\r\n i += 2\r\n\r\ni = 26\r\nj = 1\r\n\r\nfor _ in range(D-1):\r\n arr[i][j] = \"D\"\r\n j += 2\r\n if j == 25:\r\n j = 1\r\n i += 2\r\n\r\ni = 26\r\nj = 26\r\n\r\nfor _ in range(C-1):\r\n arr[i][j] = \"C\"\r\n j += 2\r\n if j == 50:\r\n j = 26\r\n i += 2\r\n\r\nfor i in range(50):\r\n print(\"\".join(arr[i]))\r\n\r\n", "from string import ascii_uppercase as au\r\n\r\nc = tuple(map(int, input().split()))\r\n\r\npaint = [[str() for i in range(44)] for j in range(33)]\r\n\r\nn = (0, 11, 22, 33, 44)\r\nfor_ = [[(x, y) for y in range(n[i], n[i + 1], 2) for x in range(0, 33, 2)][:c[(i + 2) % 4] - 1] for i in range(4)]\r\n\r\nfor i, mas in enumerate(for_):\r\n for el in mas:\r\n X, Y = el\r\n paint[X][Y] = au[(i + 2) % 4]\r\n\r\nfor k in range(4):\r\n for i in range(33):\r\n for j in range(n[k], n[k + 1]):\r\n if paint[i][j] == str():\r\n paint[i][j] = au[k]\r\n\r\nprint(33, 44)\r\nprint('\\n'.join(''.join(map(str, p)) for p in paint))\r\n", "a, b, c, d = map(int, input().split())\nr, s = 48, 50\nm = []\nfor i in ['A', 'B', 'C', 'D']:\n for j in range(r // 4):\n m.append([i for j in range(s)])\n\nfor it in range(a - 1):\n x = 2 * r // 4 + 1 + 2 * (it // 24)\n y = 1 + 2 * (it % 24)\n m[x][y] = 'A'\n\nfor it in range(b - 1):\n x = 3 * r // 4 + 1 + 2 * (it // 24)\n y = 1 + 2 * (it % 24)\n m[x][y] = 'B'\n\nfor it in range(c - 1):\n x = 0 * r // 4 + 1 + 2 * (it // 24)\n y = 1 + 2 * (it % 24)\n m[x][y] = 'C'\n\nfor it in range(d - 1):\n x = 1 * r // 4 + 1 + 2 * (it // 24)\n y = 1 + 2 * (it % 24)\n m[x][y] = 'D'\n\nprint(r, s)\nfor i in range(r):\n print(''.join(m[i]))\n\n\n", "data = input()\r\n\r\n\r\ndef main():\r\n counters = [int(x) for x in data.split(' ')]\r\n codes = {\r\n 0: 'A',\r\n 1: 'B',\r\n 2: 'C',\r\n 3: 'D',\r\n }\r\n\r\n counters[0] -= 1\r\n counters[3] -= 1\r\n\r\n completed = []\r\n row = []\r\n\r\n for flower in range(1, 4):\r\n rows, row = fill_grid(row, 'A', codes[flower], counters[flower])\r\n completed += rows\r\n\r\n if row:\r\n completed.append(''.join(row) + 'A' * (50 - len(row)))\r\n completed.append('A' * 50)\r\n\r\n completed.append('D' * 50)\r\n row = []\r\n\r\n rows, row = fill_grid(row, 'D', 'A', counters[0])\r\n completed += rows\r\n\r\n if row:\r\n completed.append(''.join(row) + 'D' * (50 - len(row)))\r\n completed.append('D' * 50)\r\n\r\n print('{} 50'.format(len(completed)))\r\n for row in completed:\r\n print(row)\r\n\r\n\r\ndef fill_grid(row, grid, flower, counter):\r\n completed = []\r\n while counter > 0:\r\n counter -= 1\r\n row.append(flower)\r\n row.append(grid)\r\n\r\n if len(row) == 50:\r\n completed.append(''.join(row))\r\n completed.append(''.join([grid] * 50))\r\n row = []\r\n\r\n return completed, row\r\n\r\nif __name__ == '__main__':\r\n main()", "a, b, c, d = [int(i) - 1 for i in input().split()]\n\ngrid = [['X' for i in range(40)] for j in range(40)]\ndef fillgrid(n, color, background, xoffset, yoffset):\n y, x = divmod(n, 10)\n for j in range(0, 2*y, 2):\n for i in range(0, 20, 2):\n grid[xoffset + i][yoffset + j] = color\n for i in range(0, 2*x, 2):\n grid[xoffset + i][yoffset + 2*y] = color\n\ndef drawframe():\n for i in range(20):\n for j in range(20):\n grid[i][j] = 'B'\n for i in range(20, 40):\n for j in range(20):\n grid[i][j] = 'C'\n for i in range(20):\n for j in range(20, 40):\n grid[i][j] = 'D'\n for i in range(20, 40):\n for j in range(20, 40):\n grid[i][j] = 'A'\n\ndef main():\n drawframe()\n fillgrid(a, 'A', 'B', 0, 0)\n fillgrid(b, 'B', 'C', 21, 0)\n fillgrid(c, 'C', 'D', 0, 21)\n fillgrid(d, 'D', 'A', 21, 21)\n print(40, 40)\n for line in grid:\n print(''.join(line))\n\nmain()\n", "import sys\n\na, b, c, d = map(int, sys.stdin.readline().split())\n\ng = [['' for i in range(50)] for j in range(50)]\nfor i in range(50):\n for j in range(50):\n if i < 25 and j < 25:\n g[i][j] = 'A'\n elif i >= 25 and j < 25:\n g[i][j] = 'B'\n elif i < 25 and j >= 25:\n g[i][j] = 'C'\n else:\n g[i][j] = 'D'\n\n\n\nfor i in range(50):\n for j in range(50):\n if a > 1:\n if 0 < i < 49 and 0 < j < 49:\n if any(all(g[i+di][j+dj] == ch for di in range(-1,2) for dj in range(-1, 2)) for ch in 'BCD'):\n g[i][j] = 'A'\n a -= 1\n\nfor i in range(50):\n for j in range(50):\n if b > 1:\n if 0 < i < 49 and 0 < j < 49:\n if any(all(g[i+di][j+dj] == ch for di in range(-1,2) for dj in range(-1, 2)) for ch in 'ACD'):\n g[i][j] = 'B'\n b -= 1\n\nfor i in range(50):\n for j in range(50):\n if c > 1:\n if 0 < i < 49 and 0 < j < 49:\n if any(all(g[i+di][j+dj] == ch for di in range(-1,2) for dj in range(-1, 2)) for ch in 'ABD'):\n g[i][j] = 'C'\n c -= 1\n\nfor i in range(50):\n for j in range(50):\n if d > 1:\n if 0 < i < 49 and 0 < j < 49:\n if any(all(g[i+di][j+dj] == ch for di in range(-1,2) for dj in range(-1, 2)) for ch in 'ABC'):\n g[i][j] = 'D'\n d -= 1\n\nprint('50 50')\nfor row in g:\n print(''.join(row))\n", "# Ý tưởng\r\n\"\"\"\r\nAAAAAAAAAAAAAAAAAA\r\nAAAAAAAAAAAAAAAAAA\r\nAAAAAAAAAAAAAAAAAA\r\n\r\nBBBBBBBBBBBBBBBBBB\r\nBBBBBBBBBBBBBBBBBB\r\nBBBBBBBBBBBBBBBBBB\r\n\r\nCCCCCCCCCCCCCCCCCC\r\nCCCCCCCCCCCCCCCCCC\r\nCCCCCCCCCCCCCCCCCC\r\n\r\nDDDDDDDDDDDDDDDDDD\r\nDDDDDDDDDDDDDDDDDD\r\nDDDDDDDDDDDDDDDDDD\r\n\"\"\"\r\n\r\n\"\"\"\r\n12 dòng nhân cho 50 ký tự\r\n\r\nAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA\r\nAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA\r\nAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA\r\nAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA\r\nAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA\r\nAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA\r\nAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA\r\nAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA\r\nAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA\r\nAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA\r\nAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA\r\nAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA\r\n\"\"\"\r\nA, B, C, D = list(map(int, input().split()))\r\n\r\nmatrix = []\r\nfor i in range(48):\r\n matrix.append([])\r\n for j in range(50):\r\n if i < 12:\r\n matrix[i].append(\"A\")\r\n elif i < 24:\r\n matrix[i].append(\"B\")\r\n elif i < 36:\r\n matrix[i].append(\"C\")\r\n else:\r\n matrix[i].append(\"D\")\r\n\r\nA -= 1\r\nB -= 1\r\nC -= 1\r\nD -= 1\r\n\r\n# A trồng ở B\r\n# B trồng ở A\r\n# C trồng ở D\r\n# D trồng ở C\r\n\r\n\r\n# Với hoa A thì trồng ở khu vực B:\r\nfor i in range(13, 13+12, 2): # Phải lên 1 hàng để không bị dính\r\n if A == 0:\r\n break\r\n for j in range(0, 50, 2):\r\n if A == 0:\r\n break\r\n matrix[i][j] = \"A\"\r\n A -= 1\r\n\r\n# Với hoa B thì trồng ở khu vực A:\r\nfor i in range(0, 0+12, 2):\r\n if B == 0:\r\n break\r\n for j in range(0, 50, 2):\r\n if B == 0:\r\n break\r\n matrix[i][j] = \"B\"\r\n B -= 1\r\n\r\n\r\n# Với hoa C thì trồng ở khu vực D:\r\nfor i in range(37, 37+12, 2): # Phải lên 1 hàng để không bị dính\r\n if C == 0:\r\n break\r\n for j in range(0, 50, 2):\r\n if C == 0:\r\n break\r\n matrix[i][j] = \"C\"\r\n C -= 1\r\n\r\n# Với hoa D thì trồng ở khu vực C:\r\nfor i in range(24, 24+12, 2):\r\n if D == 0:\r\n break\r\n for j in range(0, 50, 2):\r\n if D == 0:\r\n break\r\n matrix[i][j] = \"D\"\r\n D -= 1\r\n\r\nprint(48, 50)\r\nfor i in range(48):\r\n print(*matrix[i], sep=\"\")\r\n\r\n\r\n# print(\"blue\")\r\n# for i in range(0, 48):\r\n# for j in range(50):\r\n# if matrix[i][j] == \"A\":\r\n# print(j, 48-i)\r\n# print(\"red\")\r\n# for i in range(0, 48):\r\n# for j in range(50):\r\n# if matrix[i][j] == \"B\":\r\n# print(j, 48-i)\r\n# print(\"green\")\r\n# for i in range(0, 48):\r\n# for j in range(50):\r\n# if matrix[i][j] == \"C\":\r\n# print(j, 48-i)\r\n# print(\"yellow\")\r\n# for i in range(0, 48):\r\n# for j in range(50):\r\n# if matrix[i][j] == \"D\":\r\n# print(j, 48-i)\r\n\r\n\r\n# https://pasteboard.co/cczzDDeik5Yr.png\r\n\"\"\"\r\ncode ve hinh\r\nblue\r\n1 48\r\n3 48\r\n5 48\r\n7 48\r\n9 48\r\n11 48\r\n13 48\r\n15 48\r\n17 48\r\n19 48\r\n21 48\r\n23 48\r\n25 48\r\n27 48\r\n29 48\r\n31 48\r\n33 48\r\n35 48\r\n37 48\r\n39 48\r\n41 48\r\n43 48\r\n45 48\r\n47 48\r\n49 48\r\n0 47\r\n1 47\r\n2 47\r\n3 47\r\n4 47\r\n5 47\r\n6 47\r\n7 47\r\n8 47\r\n9 47\r\n10 47\r\n11 47\r\n12 47\r\n13 47\r\n14 47\r\n15 47\r\n16 47\r\n17 47\r\n18 47\r\n19 47\r\n20 47\r\n21 47\r\n22 47\r\n23 47\r\n24 47\r\n25 47\r\n26 47\r\n27 47\r\n28 47\r\n29 47\r\n30 47\r\n31 47\r\n32 47\r\n33 47\r\n34 47\r\n35 47\r\n36 47\r\n37 47\r\n38 47\r\n39 47\r\n40 47\r\n41 47\r\n42 47\r\n43 47\r\n44 47\r\n45 47\r\n46 47\r\n47 47\r\n48 47\r\n49 47\r\n1 46\r\n3 46\r\n5 46\r\n7 46\r\n9 46\r\n11 46\r\n13 46\r\n15 46\r\n17 46\r\n19 46\r\n21 46\r\n23 46\r\n25 46\r\n27 46\r\n29 46\r\n31 46\r\n33 46\r\n35 46\r\n37 46\r\n39 46\r\n41 46\r\n43 46\r\n45 46\r\n47 46\r\n48 46\r\n49 46\r\n0 45\r\n1 45\r\n2 45\r\n3 45\r\n4 45\r\n5 45\r\n6 45\r\n7 45\r\n8 45\r\n9 45\r\n10 45\r\n11 45\r\n12 45\r\n13 45\r\n14 45\r\n15 45\r\n16 45\r\n17 45\r\n18 45\r\n19 45\r\n20 45\r\n21 45\r\n22 45\r\n23 45\r\n24 45\r\n25 45\r\n26 45\r\n27 45\r\n28 45\r\n29 45\r\n30 45\r\n31 45\r\n32 45\r\n33 45\r\n34 45\r\n35 45\r\n36 45\r\n37 45\r\n38 45\r\n39 45\r\n40 45\r\n41 45\r\n42 45\r\n43 45\r\n44 45\r\n45 45\r\n46 45\r\n47 45\r\n48 45\r\n49 45\r\n0 44\r\n1 44\r\n2 44\r\n3 44\r\n4 44\r\n5 44\r\n6 44\r\n7 44\r\n8 44\r\n9 44\r\n10 44\r\n11 44\r\n12 44\r\n13 44\r\n14 44\r\n15 44\r\n16 44\r\n17 44\r\n18 44\r\n19 44\r\n20 44\r\n21 44\r\n22 44\r\n23 44\r\n24 44\r\n25 44\r\n26 44\r\n27 44\r\n28 44\r\n29 44\r\n30 44\r\n31 44\r\n32 44\r\n33 44\r\n34 44\r\n35 44\r\n36 44\r\n37 44\r\n38 44\r\n39 44\r\n40 44\r\n41 44\r\n42 44\r\n43 44\r\n44 44\r\n45 44\r\n46 44\r\n47 44\r\n48 44\r\n49 44\r\n0 43\r\n1 43\r\n2 43\r\n3 43\r\n4 43\r\n5 43\r\n6 43\r\n7 43\r\n8 43\r\n9 43\r\n10 43\r\n11 43\r\n12 43\r\n13 43\r\n14 43\r\n15 43\r\n16 43\r\n17 43\r\n18 43\r\n19 43\r\n20 43\r\n21 43\r\n22 43\r\n23 43\r\n24 43\r\n25 43\r\n26 43\r\n27 43\r\n28 43\r\n29 43\r\n30 43\r\n31 43\r\n32 43\r\n33 43\r\n34 43\r\n35 43\r\n36 43\r\n37 43\r\n38 43\r\n39 43\r\n40 43\r\n41 43\r\n42 43\r\n43 43\r\n44 43\r\n45 43\r\n46 43\r\n47 43\r\n48 43\r\n49 43\r\n0 42\r\n1 42\r\n2 42\r\n3 42\r\n4 42\r\n5 42\r\n6 42\r\n7 42\r\n8 42\r\n9 42\r\n10 42\r\n11 42\r\n12 42\r\n13 42\r\n14 42\r\n15 42\r\n16 42\r\n17 42\r\n18 42\r\n19 42\r\n20 42\r\n21 42\r\n22 42\r\n23 42\r\n24 42\r\n25 42\r\n26 42\r\n27 42\r\n28 42\r\n29 42\r\n30 42\r\n31 42\r\n32 42\r\n33 42\r\n34 42\r\n35 42\r\n36 42\r\n37 42\r\n38 42\r\n39 42\r\n40 42\r\n41 42\r\n42 42\r\n43 42\r\n44 42\r\n45 42\r\n46 42\r\n47 42\r\n48 42\r\n49 42\r\n0 41\r\n1 41\r\n2 41\r\n3 41\r\n4 41\r\n5 41\r\n6 41\r\n7 41\r\n8 41\r\n9 41\r\n10 41\r\n11 41\r\n12 41\r\n13 41\r\n14 41\r\n15 41\r\n16 41\r\n17 41\r\n18 41\r\n19 41\r\n20 41\r\n21 41\r\n22 41\r\n23 41\r\n24 41\r\n25 41\r\n26 41\r\n27 41\r\n28 41\r\n29 41\r\n30 41\r\n31 41\r\n32 41\r\n33 41\r\n34 41\r\n35 41\r\n36 41\r\n37 41\r\n38 41\r\n39 41\r\n40 41\r\n41 41\r\n42 41\r\n43 41\r\n44 41\r\n45 41\r\n46 41\r\n47 41\r\n48 41\r\n49 41\r\n0 40\r\n1 40\r\n2 40\r\n3 40\r\n4 40\r\n5 40\r\n6 40\r\n7 40\r\n8 40\r\n9 40\r\n10 40\r\n11 40\r\n12 40\r\n13 40\r\n14 40\r\n15 40\r\n16 40\r\n17 40\r\n18 40\r\n19 40\r\n20 40\r\n21 40\r\n22 40\r\n23 40\r\n24 40\r\n25 40\r\n26 40\r\n27 40\r\n28 40\r\n29 40\r\n30 40\r\n31 40\r\n32 40\r\n33 40\r\n34 40\r\n35 40\r\n36 40\r\n37 40\r\n38 40\r\n39 40\r\n40 40\r\n41 40\r\n42 40\r\n43 40\r\n44 40\r\n45 40\r\n46 40\r\n47 40\r\n48 40\r\n49 40\r\n0 39\r\n1 39\r\n2 39\r\n3 39\r\n4 39\r\n5 39\r\n6 39\r\n7 39\r\n8 39\r\n9 39\r\n10 39\r\n11 39\r\n12 39\r\n13 39\r\n14 39\r\n15 39\r\n16 39\r\n17 39\r\n18 39\r\n19 39\r\n20 39\r\n21 39\r\n22 39\r\n23 39\r\n24 39\r\n25 39\r\n26 39\r\n27 39\r\n28 39\r\n29 39\r\n30 39\r\n31 39\r\n32 39\r\n33 39\r\n34 39\r\n35 39\r\n36 39\r\n37 39\r\n38 39\r\n39 39\r\n40 39\r\n41 39\r\n42 39\r\n43 39\r\n44 39\r\n45 39\r\n46 39\r\n47 39\r\n48 39\r\n49 39\r\n0 38\r\n1 38\r\n2 38\r\n3 38\r\n4 38\r\n5 38\r\n6 38\r\n7 38\r\n8 38\r\n9 38\r\n10 38\r\n11 38\r\n12 38\r\n13 38\r\n14 38\r\n15 38\r\n16 38\r\n17 38\r\n18 38\r\n19 38\r\n20 38\r\n21 38\r\n22 38\r\n23 38\r\n24 38\r\n25 38\r\n26 38\r\n27 38\r\n28 38\r\n29 38\r\n30 38\r\n31 38\r\n32 38\r\n33 38\r\n34 38\r\n35 38\r\n36 38\r\n37 38\r\n38 38\r\n39 38\r\n40 38\r\n41 38\r\n42 38\r\n43 38\r\n44 38\r\n45 38\r\n46 38\r\n47 38\r\n48 38\r\n49 38\r\n0 37\r\n1 37\r\n2 37\r\n3 37\r\n4 37\r\n5 37\r\n6 37\r\n7 37\r\n8 37\r\n9 37\r\n10 37\r\n11 37\r\n12 37\r\n13 37\r\n14 37\r\n15 37\r\n16 37\r\n17 37\r\n18 37\r\n19 37\r\n20 37\r\n21 37\r\n22 37\r\n23 37\r\n24 37\r\n25 37\r\n26 37\r\n27 37\r\n28 37\r\n29 37\r\n30 37\r\n31 37\r\n32 37\r\n33 37\r\n34 37\r\n35 37\r\n36 37\r\n37 37\r\n38 37\r\n39 37\r\n40 37\r\n41 37\r\n42 37\r\n43 37\r\n44 37\r\n45 37\r\n46 37\r\n47 37\r\n48 37\r\n49 37\r\n0 35\r\n2 35\r\n4 35\r\n6 35\r\n8 35\r\n10 35\r\n12 35\r\n14 35\r\n16 35\r\n18 35\r\n20 35\r\n22 35\r\n24 35\r\n26 35\r\n28 35\r\n30 35\r\n32 35\r\n34 35\r\n36 35\r\n38 35\r\n40 35\r\n42 35\r\n44 35\r\n46 35\r\n48 35\r\n0 33\r\n2 33\r\n4 33\r\n6 33\r\n8 33\r\n10 33\r\n12 33\r\n14 33\r\n16 33\r\n18 33\r\n20 33\r\n22 33\r\n24 33\r\n26 33\r\n28 33\r\n30 33\r\n32 33\r\n34 33\r\n36 33\r\n38 33\r\n40 33\r\n42 33\r\n44 33\r\n46 33\r\nred\r\n0 48\r\n2 48\r\n4 48\r\n6 48\r\n8 48\r\n10 48\r\n12 48\r\n14 48\r\n16 48\r\n18 48\r\n20 48\r\n22 48\r\n24 48\r\n26 48\r\n28 48\r\n30 48\r\n32 48\r\n34 48\r\n36 48\r\n38 48\r\n40 48\r\n42 48\r\n44 48\r\n46 48\r\n48 48\r\n0 46\r\n2 46\r\n4 46\r\n6 46\r\n8 46\r\n10 46\r\n12 46\r\n14 46\r\n16 46\r\n18 46\r\n20 46\r\n22 46\r\n24 46\r\n26 46\r\n28 46\r\n30 46\r\n32 46\r\n34 46\r\n36 46\r\n38 46\r\n40 46\r\n42 46\r\n44 46\r\n46 46\r\n0 36\r\n1 36\r\n2 36\r\n3 36\r\n4 36\r\n5 36\r\n6 36\r\n7 36\r\n8 36\r\n9 36\r\n10 36\r\n11 36\r\n12 36\r\n13 36\r\n14 36\r\n15 36\r\n16 36\r\n17 36\r\n18 36\r\n19 36\r\n20 36\r\n21 36\r\n22 36\r\n23 36\r\n24 36\r\n25 36\r\n26 36\r\n27 36\r\n28 36\r\n29 36\r\n30 36\r\n31 36\r\n32 36\r\n33 36\r\n34 36\r\n35 36\r\n36 36\r\n37 36\r\n38 36\r\n39 36\r\n40 36\r\n41 36\r\n42 36\r\n43 36\r\n44 36\r\n45 36\r\n46 36\r\n47 36\r\n48 36\r\n49 36\r\n1 35\r\n3 35\r\n5 35\r\n7 35\r\n9 35\r\n11 35\r\n13 35\r\n15 35\r\n17 35\r\n19 35\r\n21 35\r\n23 35\r\n25 35\r\n27 35\r\n29 35\r\n31 35\r\n33 35\r\n35 35\r\n37 35\r\n39 35\r\n41 35\r\n43 35\r\n45 35\r\n47 35\r\n49 35\r\n0 34\r\n1 34\r\n2 34\r\n3 34\r\n4 34\r\n5 34\r\n6 34\r\n7 34\r\n8 34\r\n9 34\r\n10 34\r\n11 34\r\n12 34\r\n13 34\r\n14 34\r\n15 34\r\n16 34\r\n17 34\r\n18 34\r\n19 34\r\n20 34\r\n21 34\r\n22 34\r\n23 34\r\n24 34\r\n25 34\r\n26 34\r\n27 34\r\n28 34\r\n29 34\r\n30 34\r\n31 34\r\n32 34\r\n33 34\r\n34 34\r\n35 34\r\n36 34\r\n37 34\r\n38 34\r\n39 34\r\n40 34\r\n41 34\r\n42 34\r\n43 34\r\n44 34\r\n45 34\r\n46 34\r\n47 34\r\n48 34\r\n49 34\r\n1 33\r\n3 33\r\n5 33\r\n7 33\r\n9 33\r\n11 33\r\n13 33\r\n15 33\r\n17 33\r\n19 33\r\n21 33\r\n23 33\r\n25 33\r\n27 33\r\n29 33\r\n31 33\r\n33 33\r\n35 33\r\n37 33\r\n39 33\r\n41 33\r\n43 33\r\n45 33\r\n47 33\r\n48 33\r\n49 33\r\n0 32\r\n1 32\r\n2 32\r\n3 32\r\n4 32\r\n5 32\r\n6 32\r\n7 32\r\n8 32\r\n9 32\r\n10 32\r\n11 32\r\n12 32\r\n13 32\r\n14 32\r\n15 32\r\n16 32\r\n17 32\r\n18 32\r\n19 32\r\n20 32\r\n21 32\r\n22 32\r\n23 32\r\n24 32\r\n25 32\r\n26 32\r\n27 32\r\n28 32\r\n29 32\r\n30 32\r\n31 32\r\n32 32\r\n33 32\r\n34 32\r\n35 32\r\n36 32\r\n37 32\r\n38 32\r\n39 32\r\n40 32\r\n41 32\r\n42 32\r\n43 32\r\n44 32\r\n45 32\r\n46 32\r\n47 32\r\n48 32\r\n49 32\r\n0 31\r\n1 31\r\n2 31\r\n3 31\r\n4 31\r\n5 31\r\n6 31\r\n7 31\r\n8 31\r\n9 31\r\n10 31\r\n11 31\r\n12 31\r\n13 31\r\n14 31\r\n15 31\r\n16 31\r\n17 31\r\n18 31\r\n19 31\r\n20 31\r\n21 31\r\n22 31\r\n23 31\r\n24 31\r\n25 31\r\n26 31\r\n27 31\r\n28 31\r\n29 31\r\n30 31\r\n31 31\r\n32 31\r\n33 31\r\n34 31\r\n35 31\r\n36 31\r\n37 31\r\n38 31\r\n39 31\r\n40 31\r\n41 31\r\n42 31\r\n43 31\r\n44 31\r\n45 31\r\n46 31\r\n47 31\r\n48 31\r\n49 31\r\n0 30\r\n1 30\r\n2 30\r\n3 30\r\n4 30\r\n5 30\r\n6 30\r\n7 30\r\n8 30\r\n9 30\r\n10 30\r\n11 30\r\n12 30\r\n13 30\r\n14 30\r\n15 30\r\n16 30\r\n17 30\r\n18 30\r\n19 30\r\n20 30\r\n21 30\r\n22 30\r\n23 30\r\n24 30\r\n25 30\r\n26 30\r\n27 30\r\n28 30\r\n29 30\r\n30 30\r\n31 30\r\n32 30\r\n33 30\r\n34 30\r\n35 30\r\n36 30\r\n37 30\r\n38 30\r\n39 30\r\n40 30\r\n41 30\r\n42 30\r\n43 30\r\n44 30\r\n45 30\r\n46 30\r\n47 30\r\n48 30\r\n49 30\r\n0 29\r\n1 29\r\n2 29\r\n3 29\r\n4 29\r\n5 29\r\n6 29\r\n7 29\r\n8 29\r\n9 29\r\n10 29\r\n11 29\r\n12 29\r\n13 29\r\n14 29\r\n15 29\r\n16 29\r\n17 29\r\n18 29\r\n19 29\r\n20 29\r\n21 29\r\n22 29\r\n23 29\r\n24 29\r\n25 29\r\n26 29\r\n27 29\r\n28 29\r\n29 29\r\n30 29\r\n31 29\r\n32 29\r\n33 29\r\n34 29\r\n35 29\r\n36 29\r\n37 29\r\n38 29\r\n39 29\r\n40 29\r\n41 29\r\n42 29\r\n43 29\r\n44 29\r\n45 29\r\n46 29\r\n47 29\r\n48 29\r\n49 29\r\n0 28\r\n1 28\r\n2 28\r\n3 28\r\n4 28\r\n5 28\r\n6 28\r\n7 28\r\n8 28\r\n9 28\r\n10 28\r\n11 28\r\n12 28\r\n13 28\r\n14 28\r\n15 28\r\n16 28\r\n17 28\r\n18 28\r\n19 28\r\n20 28\r\n21 28\r\n22 28\r\n23 28\r\n24 28\r\n25 28\r\n26 28\r\n27 28\r\n28 28\r\n29 28\r\n30 28\r\n31 28\r\n32 28\r\n33 28\r\n34 28\r\n35 28\r\n36 28\r\n37 28\r\n38 28\r\n39 28\r\n40 28\r\n41 28\r\n42 28\r\n43 28\r\n44 28\r\n45 28\r\n46 28\r\n47 28\r\n48 28\r\n49 28\r\n0 27\r\n1 27\r\n2 27\r\n3 27\r\n4 27\r\n5 27\r\n6 27\r\n7 27\r\n8 27\r\n9 27\r\n10 27\r\n11 27\r\n12 27\r\n13 27\r\n14 27\r\n15 27\r\n16 27\r\n17 27\r\n18 27\r\n19 27\r\n20 27\r\n21 27\r\n22 27\r\n23 27\r\n24 27\r\n25 27\r\n26 27\r\n27 27\r\n28 27\r\n29 27\r\n30 27\r\n31 27\r\n32 27\r\n33 27\r\n34 27\r\n35 27\r\n36 27\r\n37 27\r\n38 27\r\n39 27\r\n40 27\r\n41 27\r\n42 27\r\n43 27\r\n44 27\r\n45 27\r\n46 27\r\n47 27\r\n48 27\r\n49 27\r\n0 26\r\n1 26\r\n2 26\r\n3 26\r\n4 26\r\n5 26\r\n6 26\r\n7 26\r\n8 26\r\n9 26\r\n10 26\r\n11 26\r\n12 26\r\n13 26\r\n14 26\r\n15 26\r\n16 26\r\n17 26\r\n18 26\r\n19 26\r\n20 26\r\n21 26\r\n22 26\r\n23 26\r\n24 26\r\n25 26\r\n26 26\r\n27 26\r\n28 26\r\n29 26\r\n30 26\r\n31 26\r\n32 26\r\n33 26\r\n34 26\r\n35 26\r\n36 26\r\n37 26\r\n38 26\r\n39 26\r\n40 26\r\n41 26\r\n42 26\r\n43 26\r\n44 26\r\n45 26\r\n46 26\r\n47 26\r\n48 26\r\n49 26\r\n0 25\r\n1 25\r\n2 25\r\n3 25\r\n4 25\r\n5 25\r\n6 25\r\n7 25\r\n8 25\r\n9 25\r\n10 25\r\n11 25\r\n12 25\r\n13 25\r\n14 25\r\n15 25\r\n16 25\r\n17 25\r\n18 25\r\n19 25\r\n20 25\r\n21 25\r\n22 25\r\n23 25\r\n24 25\r\n25 25\r\n26 25\r\n27 25\r\n28 25\r\n29 25\r\n30 25\r\n31 25\r\n32 25\r\n33 25\r\n34 25\r\n35 25\r\n36 25\r\n37 25\r\n38 25\r\n39 25\r\n40 25\r\n41 25\r\n42 25\r\n43 25\r\n44 25\r\n45 25\r\n46 25\r\n47 25\r\n48 25\r\n49 25\r\ngreen\r\n1 24\r\n3 24\r\n5 24\r\n7 24\r\n9 24\r\n11 24\r\n13 24\r\n15 24\r\n17 24\r\n19 24\r\n21 24\r\n23 24\r\n25 24\r\n27 24\r\n29 24\r\n31 24\r\n33 24\r\n35 24\r\n37 24\r\n39 24\r\n41 24\r\n43 24\r\n45 24\r\n47 24\r\n49 24\r\n0 23\r\n1 23\r\n2 23\r\n3 23\r\n4 23\r\n5 23\r\n6 23\r\n7 23\r\n8 23\r\n9 23\r\n10 23\r\n11 23\r\n12 23\r\n13 23\r\n14 23\r\n15 23\r\n16 23\r\n17 23\r\n18 23\r\n19 23\r\n20 23\r\n21 23\r\n22 23\r\n23 23\r\n24 23\r\n25 23\r\n26 23\r\n27 23\r\n28 23\r\n29 23\r\n30 23\r\n31 23\r\n32 23\r\n33 23\r\n34 23\r\n35 23\r\n36 23\r\n37 23\r\n38 23\r\n39 23\r\n40 23\r\n41 23\r\n42 23\r\n43 23\r\n44 23\r\n45 23\r\n46 23\r\n47 23\r\n48 23\r\n49 23\r\n1 22\r\n3 22\r\n5 22\r\n7 22\r\n9 22\r\n11 22\r\n13 22\r\n15 22\r\n17 22\r\n19 22\r\n21 22\r\n23 22\r\n25 22\r\n27 22\r\n29 22\r\n31 22\r\n33 22\r\n35 22\r\n37 22\r\n39 22\r\n41 22\r\n43 22\r\n45 22\r\n47 22\r\n48 22\r\n49 22\r\n0 21\r\n1 21\r\n2 21\r\n3 21\r\n4 21\r\n5 21\r\n6 21\r\n7 21\r\n8 21\r\n9 21\r\n10 21\r\n11 21\r\n12 21\r\n13 21\r\n14 21\r\n15 21\r\n16 21\r\n17 21\r\n18 21\r\n19 21\r\n20 21\r\n21 21\r\n22 21\r\n23 21\r\n24 21\r\n25 21\r\n26 21\r\n27 21\r\n28 21\r\n29 21\r\n30 21\r\n31 21\r\n32 21\r\n33 21\r\n34 21\r\n35 21\r\n36 21\r\n37 21\r\n38 21\r\n39 21\r\n40 21\r\n41 21\r\n42 21\r\n43 21\r\n44 21\r\n45 21\r\n46 21\r\n47 21\r\n48 21\r\n49 21\r\n0 20\r\n1 20\r\n2 20\r\n3 20\r\n4 20\r\n5 20\r\n6 20\r\n7 20\r\n8 20\r\n9 20\r\n10 20\r\n11 20\r\n12 20\r\n13 20\r\n14 20\r\n15 20\r\n16 20\r\n17 20\r\n18 20\r\n19 20\r\n20 20\r\n21 20\r\n22 20\r\n23 20\r\n24 20\r\n25 20\r\n26 20\r\n27 20\r\n28 20\r\n29 20\r\n30 20\r\n31 20\r\n32 20\r\n33 20\r\n34 20\r\n35 20\r\n36 20\r\n37 20\r\n38 20\r\n39 20\r\n40 20\r\n41 20\r\n42 20\r\n43 20\r\n44 20\r\n45 20\r\n46 20\r\n47 20\r\n48 20\r\n49 20\r\n0 19\r\n1 19\r\n2 19\r\n3 19\r\n4 19\r\n5 19\r\n6 19\r\n7 19\r\n8 19\r\n9 19\r\n10 19\r\n11 19\r\n12 19\r\n13 19\r\n14 19\r\n15 19\r\n16 19\r\n17 19\r\n18 19\r\n19 19\r\n20 19\r\n21 19\r\n22 19\r\n23 19\r\n24 19\r\n25 19\r\n26 19\r\n27 19\r\n28 19\r\n29 19\r\n30 19\r\n31 19\r\n32 19\r\n33 19\r\n34 19\r\n35 19\r\n36 19\r\n37 19\r\n38 19\r\n39 19\r\n40 19\r\n41 19\r\n42 19\r\n43 19\r\n44 19\r\n45 19\r\n46 19\r\n47 19\r\n48 19\r\n49 19\r\n0 18\r\n1 18\r\n2 18\r\n3 18\r\n4 18\r\n5 18\r\n6 18\r\n7 18\r\n8 18\r\n9 18\r\n10 18\r\n11 18\r\n12 18\r\n13 18\r\n14 18\r\n15 18\r\n16 18\r\n17 18\r\n18 18\r\n19 18\r\n20 18\r\n21 18\r\n22 18\r\n23 18\r\n24 18\r\n25 18\r\n26 18\r\n27 18\r\n28 18\r\n29 18\r\n30 18\r\n31 18\r\n32 18\r\n33 18\r\n34 18\r\n35 18\r\n36 18\r\n37 18\r\n38 18\r\n39 18\r\n40 18\r\n41 18\r\n42 18\r\n43 18\r\n44 18\r\n45 18\r\n46 18\r\n47 18\r\n48 18\r\n49 18\r\n0 17\r\n1 17\r\n2 17\r\n3 17\r\n4 17\r\n5 17\r\n6 17\r\n7 17\r\n8 17\r\n9 17\r\n10 17\r\n11 17\r\n12 17\r\n13 17\r\n14 17\r\n15 17\r\n16 17\r\n17 17\r\n18 17\r\n19 17\r\n20 17\r\n21 17\r\n22 17\r\n23 17\r\n24 17\r\n25 17\r\n26 17\r\n27 17\r\n28 17\r\n29 17\r\n30 17\r\n31 17\r\n32 17\r\n33 17\r\n34 17\r\n35 17\r\n36 17\r\n37 17\r\n38 17\r\n39 17\r\n40 17\r\n41 17\r\n42 17\r\n43 17\r\n44 17\r\n45 17\r\n46 17\r\n47 17\r\n48 17\r\n49 17\r\n0 16\r\n1 16\r\n2 16\r\n3 16\r\n4 16\r\n5 16\r\n6 16\r\n7 16\r\n8 16\r\n9 16\r\n10 16\r\n11 16\r\n12 16\r\n13 16\r\n14 16\r\n15 16\r\n16 16\r\n17 16\r\n18 16\r\n19 16\r\n20 16\r\n21 16\r\n22 16\r\n23 16\r\n24 16\r\n25 16\r\n26 16\r\n27 16\r\n28 16\r\n29 16\r\n30 16\r\n31 16\r\n32 16\r\n33 16\r\n34 16\r\n35 16\r\n36 16\r\n37 16\r\n38 16\r\n39 16\r\n40 16\r\n41 16\r\n42 16\r\n43 16\r\n44 16\r\n45 16\r\n46 16\r\n47 16\r\n48 16\r\n49 16\r\n0 15\r\n1 15\r\n2 15\r\n3 15\r\n4 15\r\n5 15\r\n6 15\r\n7 15\r\n8 15\r\n9 15\r\n10 15\r\n11 15\r\n12 15\r\n13 15\r\n14 15\r\n15 15\r\n16 15\r\n17 15\r\n18 15\r\n19 15\r\n20 15\r\n21 15\r\n22 15\r\n23 15\r\n24 15\r\n25 15\r\n26 15\r\n27 15\r\n28 15\r\n29 15\r\n30 15\r\n31 15\r\n32 15\r\n33 15\r\n34 15\r\n35 15\r\n36 15\r\n37 15\r\n38 15\r\n39 15\r\n40 15\r\n41 15\r\n42 15\r\n43 15\r\n44 15\r\n45 15\r\n46 15\r\n47 15\r\n48 15\r\n49 15\r\n0 14\r\n1 14\r\n2 14\r\n3 14\r\n4 14\r\n5 14\r\n6 14\r\n7 14\r\n8 14\r\n9 14\r\n10 14\r\n11 14\r\n12 14\r\n13 14\r\n14 14\r\n15 14\r\n16 14\r\n17 14\r\n18 14\r\n19 14\r\n20 14\r\n21 14\r\n22 14\r\n23 14\r\n24 14\r\n25 14\r\n26 14\r\n27 14\r\n28 14\r\n29 14\r\n30 14\r\n31 14\r\n32 14\r\n33 14\r\n34 14\r\n35 14\r\n36 14\r\n37 14\r\n38 14\r\n39 14\r\n40 14\r\n41 14\r\n42 14\r\n43 14\r\n44 14\r\n45 14\r\n46 14\r\n47 14\r\n48 14\r\n49 14\r\n0 13\r\n1 13\r\n2 13\r\n3 13\r\n4 13\r\n5 13\r\n6 13\r\n7 13\r\n8 13\r\n9 13\r\n10 13\r\n11 13\r\n12 13\r\n13 13\r\n14 13\r\n15 13\r\n16 13\r\n17 13\r\n18 13\r\n19 13\r\n20 13\r\n21 13\r\n22 13\r\n23 13\r\n24 13\r\n25 13\r\n26 13\r\n27 13\r\n28 13\r\n29 13\r\n30 13\r\n31 13\r\n32 13\r\n33 13\r\n34 13\r\n35 13\r\n36 13\r\n37 13\r\n38 13\r\n39 13\r\n40 13\r\n41 13\r\n42 13\r\n43 13\r\n44 13\r\n45 13\r\n46 13\r\n47 13\r\n48 13\r\n49 13\r\n0 11\r\n2 11\r\n4 11\r\n6 11\r\n8 11\r\n10 11\r\n12 11\r\n14 11\r\n16 11\r\n18 11\r\n20 11\r\n22 11\r\n24 11\r\n26 11\r\n28 11\r\n30 11\r\n32 11\r\n34 11\r\n36 11\r\n38 11\r\n40 11\r\n42 11\r\n44 11\r\n46 11\r\n48 11\r\n0 9\r\n2 9\r\n4 9\r\n6 9\r\n8 9\r\n10 9\r\n12 9\r\n14 9\r\n16 9\r\n18 9\r\n20 9\r\n22 9\r\n24 9\r\n26 9\r\n28 9\r\n30 9\r\n32 9\r\n34 9\r\n36 9\r\n38 9\r\n40 9\r\n42 9\r\n44 9\r\n46 9\r\nyellow\r\n0 24\r\n2 24\r\n4 24\r\n6 24\r\n8 24\r\n10 24\r\n12 24\r\n14 24\r\n16 24\r\n18 24\r\n20 24\r\n22 24\r\n24 24\r\n26 24\r\n28 24\r\n30 24\r\n32 24\r\n34 24\r\n36 24\r\n38 24\r\n40 24\r\n42 24\r\n44 24\r\n46 24\r\n48 24\r\n0 22\r\n2 22\r\n4 22\r\n6 22\r\n8 22\r\n10 22\r\n12 22\r\n14 22\r\n16 22\r\n18 22\r\n20 22\r\n22 22\r\n24 22\r\n26 22\r\n28 22\r\n30 22\r\n32 22\r\n34 22\r\n36 22\r\n38 22\r\n40 22\r\n42 22\r\n44 22\r\n46 22\r\n0 12\r\n1 12\r\n2 12\r\n3 12\r\n4 12\r\n5 12\r\n6 12\r\n7 12\r\n8 12\r\n9 12\r\n10 12\r\n11 12\r\n12 12\r\n13 12\r\n14 12\r\n15 12\r\n16 12\r\n17 12\r\n18 12\r\n19 12\r\n20 12\r\n21 12\r\n22 12\r\n23 12\r\n24 12\r\n25 12\r\n26 12\r\n27 12\r\n28 12\r\n29 12\r\n30 12\r\n31 12\r\n32 12\r\n33 12\r\n34 12\r\n35 12\r\n36 12\r\n37 12\r\n38 12\r\n39 12\r\n40 12\r\n41 12\r\n42 12\r\n43 12\r\n44 12\r\n45 12\r\n46 12\r\n47 12\r\n48 12\r\n49 12\r\n1 11\r\n3 11\r\n5 11\r\n7 11\r\n9 11\r\n11 11\r\n13 11\r\n15 11\r\n17 11\r\n19 11\r\n21 11\r\n23 11\r\n25 11\r\n27 11\r\n29 11\r\n31 11\r\n33 11\r\n35 11\r\n37 11\r\n39 11\r\n41 11\r\n43 11\r\n45 11\r\n47 11\r\n49 11\r\n0 10\r\n1 10\r\n2 10\r\n3 10\r\n4 10\r\n5 10\r\n6 10\r\n7 10\r\n8 10\r\n9 10\r\n10 10\r\n11 10\r\n12 10\r\n13 10\r\n14 10\r\n15 10\r\n16 10\r\n17 10\r\n18 10\r\n19 10\r\n20 10\r\n21 10\r\n22 10\r\n23 10\r\n24 10\r\n25 10\r\n26 10\r\n27 10\r\n28 10\r\n29 10\r\n30 10\r\n31 10\r\n32 10\r\n33 10\r\n34 10\r\n35 10\r\n36 10\r\n37 10\r\n38 10\r\n39 10\r\n40 10\r\n41 10\r\n42 10\r\n43 10\r\n44 10\r\n45 10\r\n46 10\r\n47 10\r\n48 10\r\n49 10\r\n1 9\r\n3 9\r\n5 9\r\n7 9\r\n9 9\r\n11 9\r\n13 9\r\n15 9\r\n17 9\r\n19 9\r\n21 9\r\n23 9\r\n25 9\r\n27 9\r\n29 9\r\n31 9\r\n33 9\r\n35 9\r\n37 9\r\n39 9\r\n41 9\r\n43 9\r\n45 9\r\n47 9\r\n48 9\r\n49 9\r\n0 8\r\n1 8\r\n2 8\r\n3 8\r\n4 8\r\n5 8\r\n6 8\r\n7 8\r\n8 8\r\n9 8\r\n10 8\r\n11 8\r\n12 8\r\n13 8\r\n14 8\r\n15 8\r\n16 8\r\n17 8\r\n18 8\r\n19 8\r\n20 8\r\n21 8\r\n22 8\r\n23 8\r\n24 8\r\n25 8\r\n26 8\r\n27 8\r\n28 8\r\n29 8\r\n30 8\r\n31 8\r\n32 8\r\n33 8\r\n34 8\r\n35 8\r\n36 8\r\n37 8\r\n38 8\r\n39 8\r\n40 8\r\n41 8\r\n42 8\r\n43 8\r\n44 8\r\n45 8\r\n46 8\r\n47 8\r\n48 8\r\n49 8\r\n0 7\r\n1 7\r\n2 7\r\n3 7\r\n4 7\r\n5 7\r\n6 7\r\n7 7\r\n8 7\r\n9 7\r\n10 7\r\n11 7\r\n12 7\r\n13 7\r\n14 7\r\n15 7\r\n16 7\r\n17 7\r\n18 7\r\n19 7\r\n20 7\r\n21 7\r\n22 7\r\n23 7\r\n24 7\r\n25 7\r\n26 7\r\n27 7\r\n28 7\r\n29 7\r\n30 7\r\n31 7\r\n32 7\r\n33 7\r\n34 7\r\n35 7\r\n36 7\r\n37 7\r\n38 7\r\n39 7\r\n40 7\r\n41 7\r\n42 7\r\n43 7\r\n44 7\r\n45 7\r\n46 7\r\n47 7\r\n48 7\r\n49 7\r\n0 6\r\n1 6\r\n2 6\r\n3 6\r\n4 6\r\n5 6\r\n6 6\r\n7 6\r\n8 6\r\n9 6\r\n10 6\r\n11 6\r\n12 6\r\n13 6\r\n14 6\r\n15 6\r\n16 6\r\n17 6\r\n18 6\r\n19 6\r\n20 6\r\n21 6\r\n22 6\r\n23 6\r\n24 6\r\n25 6\r\n26 6\r\n27 6\r\n28 6\r\n29 6\r\n30 6\r\n31 6\r\n32 6\r\n33 6\r\n34 6\r\n35 6\r\n36 6\r\n37 6\r\n38 6\r\n39 6\r\n40 6\r\n41 6\r\n42 6\r\n43 6\r\n44 6\r\n45 6\r\n46 6\r\n47 6\r\n48 6\r\n49 6\r\n0 5\r\n1 5\r\n2 5\r\n3 5\r\n4 5\r\n5 5\r\n6 5\r\n7 5\r\n8 5\r\n9 5\r\n10 5\r\n11 5\r\n12 5\r\n13 5\r\n14 5\r\n15 5\r\n16 5\r\n17 5\r\n18 5\r\n19 5\r\n20 5\r\n21 5\r\n22 5\r\n23 5\r\n24 5\r\n25 5\r\n26 5\r\n27 5\r\n28 5\r\n29 5\r\n30 5\r\n31 5\r\n32 5\r\n33 5\r\n34 5\r\n35 5\r\n36 5\r\n37 5\r\n38 5\r\n39 5\r\n40 5\r\n41 5\r\n42 5\r\n43 5\r\n44 5\r\n45 5\r\n46 5\r\n47 5\r\n48 5\r\n49 5\r\n0 4\r\n1 4\r\n2 4\r\n3 4\r\n4 4\r\n5 4\r\n6 4\r\n7 4\r\n8 4\r\n9 4\r\n10 4\r\n11 4\r\n12 4\r\n13 4\r\n14 4\r\n15 4\r\n16 4\r\n17 4\r\n18 4\r\n19 4\r\n20 4\r\n21 4\r\n22 4\r\n23 4\r\n24 4\r\n25 4\r\n26 4\r\n27 4\r\n28 4\r\n29 4\r\n30 4\r\n31 4\r\n32 4\r\n33 4\r\n34 4\r\n35 4\r\n36 4\r\n37 4\r\n38 4\r\n39 4\r\n40 4\r\n41 4\r\n42 4\r\n43 4\r\n44 4\r\n45 4\r\n46 4\r\n47 4\r\n48 4\r\n49 4\r\n0 3\r\n1 3\r\n2 3\r\n3 3\r\n4 3\r\n5 3\r\n6 3\r\n7 3\r\n8 3\r\n9 3\r\n10 3\r\n11 3\r\n12 3\r\n13 3\r\n14 3\r\n15 3\r\n16 3\r\n17 3\r\n18 3\r\n19 3\r\n20 3\r\n21 3\r\n22 3\r\n23 3\r\n24 3\r\n25 3\r\n26 3\r\n27 3\r\n28 3\r\n29 3\r\n30 3\r\n31 3\r\n32 3\r\n33 3\r\n34 3\r\n35 3\r\n36 3\r\n37 3\r\n38 3\r\n39 3\r\n40 3\r\n41 3\r\n42 3\r\n43 3\r\n44 3\r\n45 3\r\n46 3\r\n47 3\r\n48 3\r\n49 3\r\n0 2\r\n1 2\r\n2 2\r\n3 2\r\n4 2\r\n5 2\r\n6 2\r\n7 2\r\n8 2\r\n9 2\r\n10 2\r\n11 2\r\n12 2\r\n13 2\r\n14 2\r\n15 2\r\n16 2\r\n17 2\r\n18 2\r\n19 2\r\n20 2\r\n21 2\r\n22 2\r\n23 2\r\n24 2\r\n25 2\r\n26 2\r\n27 2\r\n28 2\r\n29 2\r\n30 2\r\n31 2\r\n32 2\r\n33 2\r\n34 2\r\n35 2\r\n36 2\r\n37 2\r\n38 2\r\n39 2\r\n40 2\r\n41 2\r\n42 2\r\n43 2\r\n44 2\r\n45 2\r\n46 2\r\n47 2\r\n48 2\r\n49 2\r\n0 1\r\n1 1\r\n2 1\r\n3 1\r\n4 1\r\n5 1\r\n6 1\r\n7 1\r\n8 1\r\n9 1\r\n10 1\r\n11 1\r\n12 1\r\n13 1\r\n14 1\r\n15 1\r\n16 1\r\n17 1\r\n18 1\r\n19 1\r\n20 1\r\n21 1\r\n22 1\r\n23 1\r\n24 1\r\n25 1\r\n26 1\r\n27 1\r\n28 1\r\n29 1\r\n30 1\r\n31 1\r\n32 1\r\n33 1\r\n34 1\r\n35 1\r\n36 1\r\n37 1\r\n38 1\r\n39 1\r\n40 1\r\n41 1\r\n42 1\r\n43 1\r\n44 1\r\n45 1\r\n46 1\r\n47 1\r\n48 1\r\n49 1\r\n\"\"\"\r\n", "a, b, c, d = [int(i) for i in input().split()]\r\n\r\nans = []\r\nsize = 25\r\none = list(\"A\" * size + \"B\" * size)\r\ntwo = list(\"C\" * size + \"D\" * size)\r\n\r\nfor i in range(size):\r\n\tans.append(one[:])\r\nfor i in range(size):\r\n\tans.append(two[:])\r\n\r\nai = size\r\naj = size\r\n\r\nbi = size\r\nbj = 0\r\n\r\nci = 0\r\ncj = size\r\n\r\ndi = 0\r\ndj = 0\r\n\r\nac = 1\r\nbc = 1\r\ncc = 1\r\ndc = 1\r\n\r\nfor i in range(a - 1):\r\n\tans[ai][aj] = \"A\"\r\n\tif i % (size // 2) == 0 and i != 0:\r\n\t\tai += 2\r\n\t\taj = size\r\n\telse:\r\n\t\taj += 2\r\n\r\nfor i in range(b - 1):\r\n\tans[bi][bj] = \"B\"\r\n\tif i % (size // 2) == 0 and i != 0:\r\n\t\tbi += 2\r\n\t\tbj = 0\r\n\telse:\r\n\t\tbj += 2\r\n\r\nfor i in range(c - 1):\r\n\tans[ci][cj] = \"C\"\r\n\tif i % (size // 2) == 0 and i != 0:\r\n\t\tci += 2\r\n\t\tcj = size\r\n\telse:\r\n\t\tcj += 2\r\n\r\nfor i in range(d - 1):\r\n\tans[di][dj] = \"D\"\r\n\tif i % (size // 2) == 0 and i != 0:\r\n\t\tdi += 2\r\n\t\tdj = 0\r\n\telse:\r\n\t\tdj += 2\r\n\r\nprint(\"50 50\")\r\nfor i in ans:\r\n\tprint(\"\".join(i))", "a, b, c, d = map(int, input().split())\r\nres = [['A'] * 50 for i in range(25)] + \\\r\n [['B'] * 50 for i in range(25)]\r\na, b = a - 1, b - 1\r\nfor i in range(0, 24, 2):\r\n for j in range(0, 50, 2):\r\n if b > 0:\r\n b -= 1\r\n res[i][j] = 'B'\r\n elif c > 0:\r\n c -= 1\r\n res[i][j] = 'C'\r\n elif d > 0:\r\n d -= 1\r\n res[i][j] = 'D'\r\n if a > 0:\r\n a -= 1\r\n res[i + 26][j] = 'A'\r\nprint(50, 50)\r\nfor i in res:\r\n print(''.join(i))", "a,b,c,l=list(map(int, input().split() ))\nA=[['A' for i in range(50)] for j in range(8)]\nB=[['B' for i in range(50)] for j in range(8)]\nC=[['C' for i in range(50)] for j in range(8)]\nD=[['D' for i in range(50)] for j in range(8)]\nd=A+B+C+D\ndef pr(d):\n for i in d:\n print(''.join(i))\na-=1\nb-=1\nc-=1\nl-=1\nif c!=0:\n for i in range(0,8,2): \n for j in range(0,50,2):\n d[i][j]='C'\n c-=1\n if c==0:\n break\n if c==0:\n break\nif l!=0:\n for i in range(8,16,2): \n for j in range(0,50, 2):\n d[i][j]='D'\n l-=1\n if l==0:\n break\n if l==0:\n break\nif a!=0:\n for i in range(16,24,2): \n for j in range(0,50,2):\n d[i][j]='A'\n a-=1\n if a==0:\n break\n if a==0:\n break\nif b!=0:\n for i in range(24,32,2): \n for j in range(0,50,2):\n d[i][j]='B'\n b-=1\n if b==0:\n break\n if b==0:\n break\nprint(32,50)\npr(d)", "# Ý tưởng\r\n\"\"\"\r\nAAAAAAAAAAAAAAAAAA\r\nAAAAAAAAAAAAAAAAAA\r\nAAAAAAAAAAAAAAAAAA\r\n\r\nBBBBBBBBBBBBBBBBBB\r\nBBBBBBBBBBBBBBBBBB\r\nBBBBBBBBBBBBBBBBBB\r\n\r\nCCCCCCCCCCCCCCCCCC\r\nCCCCCCCCCCCCCCCCCC\r\nCCCCCCCCCCCCCCCCCC\r\n\r\nDDDDDDDDDDDDDDDDDD\r\nDDDDDDDDDDDDDDDDDD\r\nDDDDDDDDDDDDDDDDDD\r\n\"\"\"\r\n\r\n\"\"\"\r\n12 dòng nhân cho 50 ký tự\r\n\r\nAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA\r\nAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA\r\nAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA\r\nAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA\r\nAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA\r\nAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA\r\nAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA\r\nAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA\r\nAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA\r\nAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA\r\nAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA\r\nAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA\r\n\"\"\"\r\nA, B, C, D = list(map(int, input().split()))\r\n\r\nmatrix = []\r\nfor i in range(48):\r\n matrix.append([])\r\n for j in range(50):\r\n if i < 12:\r\n matrix[i].append(\"A\")\r\n elif i < 24:\r\n matrix[i].append(\"B\")\r\n elif i < 36:\r\n matrix[i].append(\"C\")\r\n else:\r\n matrix[i].append(\"D\")\r\n\r\nA -= 1\r\nB -= 1\r\nC -= 1\r\nD -= 1\r\n\r\n# A trồng ở B\r\n# B trồng ở A\r\n# C trồng ở D\r\n# D trồng ở C\r\n\r\n\r\n# Với hoa A thì trồng ở khu vực B:\r\nfor i in range(13, 13+12, 2): # Phải lên 1 hàng để không bị dính\r\n if A == 0:\r\n break\r\n for j in range(0, 50, 2):\r\n if A == 0:\r\n break\r\n matrix[i][j] = \"A\"\r\n A -= 1\r\n\r\n# Với hoa B thì trồng ở khu vực A:\r\nfor i in range(0, 0+12, 2):\r\n if B == 0:\r\n break\r\n for j in range(0, 50, 2):\r\n if B == 0:\r\n break\r\n matrix[i][j] = \"B\"\r\n B -= 1\r\n\r\n\r\n# Với hoa C thì trồng ở khu vực D:\r\nfor i in range(37, 37+12, 2): # Phải lên 1 hàng để không bị dính\r\n if C == 0:\r\n break\r\n for j in range(0, 50, 2):\r\n if C == 0:\r\n break\r\n matrix[i][j] = \"C\"\r\n C -= 1\r\n\r\n# Với hoa D thì trồng ở khu vực C:\r\nfor i in range(25, 25+12, 2):\r\n if D == 0:\r\n break\r\n for j in range(0, 50, 2):\r\n if D == 0:\r\n break\r\n matrix[i][j] = \"D\"\r\n D -= 1\r\n\r\nprint(48, 50)\r\nfor i in range(48):\r\n print(*matrix[i], sep=\"\")\r\n", "st=input()\r\narr=st.split(' ')\r\nfor i in range (0,4):\r\n arr[i]=int(arr[i])\r\narr[0]-=1\r\narr[3]-=1\r\nit=0\r\nans=list();\r\nwhile 1:\r\n st=\"\"\r\n for j in range(0,50):\r\n if it==0:\r\n if arr[it]>0:\r\n st+='A'\r\n arr[it]-=1\r\n it+=1\r\n continue;\r\n it+=1\r\n if it==1:\r\n if arr[it]>0:\r\n st+='B'\r\n arr[it]-=1\r\n it+=1\r\n continue\r\n it+=1\r\n if it==2:\r\n if arr[it]>0:\r\n st+='C'\r\n arr[it]-=1\r\n it+=1\r\n continue\r\n it+=1\r\n if it>=3:\r\n st+='D'\r\n it=0\r\n ans.append(st)\r\n st=\"\";\r\n for j in range(0,50):\r\n st+='D'\r\n ans.append(st)\r\n if (arr[0]==arr[1] and arr[1]==arr[2] and arr[2]==0):\r\n st=\"\"\r\n for j in range(0,50):\r\n st+='A'\r\n ans.append(st)\r\n break;\r\nwhile 1:\r\n st=\"\"\r\n it=0\r\n for j in range(0,50):\r\n if it>=1:\r\n if (arr[3]>0):\r\n st+='D'\r\n arr[3]-=1\r\n it=0;\r\n continue\r\n it=0\r\n if it==0:\r\n st+='A'\r\n it+=1\r\n continue\r\n ans.append(st)\r\n st=\"\"\r\n for j in range(0,50):\r\n st+='A'\r\n ans.append(st)\r\n if arr[3]==0:\r\n break;\r\nprint(str(len(ans))+' 50')\r\nfor i in ans:\r\n print(i)\r\n \r\n \r\n \r\n \r\n \r\n ", "L = ['A', 'B', 'C', 'D']\nc = list(map(int, input().split()))\ni = 0\nfor j in range(4):\n\tif c[j] < c[i]: i = j\ngd = [[L[i]]*50 for j in range(50)]\nc[i] -= 1\n\ndef ff():\n\tfor a in range(4):\n\t\tif a != i and c[a]:\n\t\t\tc[a] -= 1\n\t\t\treturn L[a]\n\treturn -1\n\nfor y in range(49,-1,-1):\n\tfor x in range(1-y%2,50,2):\n\t\tif not c[i]: break\n\t\tc[i] -= 1\n\t\tif gd[y-1][x] == L[i]:\n\t\t\tgd[y-1][x] = ff()\n\t\tif x+1<50 and gd[y][x+1] == L[i]:\n\t\t\tgd[y][x+1] = ff()\n\nfor y in range(0,50,2):\n\tfor x in range(0,50,2):\n\t\ta = ff()\n\t\tif a != -1: gd[y][x] = a\n\nprint('50 50')\nfor y in range(50):\n\tprint(''.join(gd[y]))\n", "from string import ascii_uppercase as au\r\n\r\ncoef = tuple(map(int, input().split()))\r\n\r\npaint = [['.' for i in range(48)] for j in range(33)]\r\n\r\nfor i in range(33):\r\n paint[i][11] = 'A'\r\n paint[i][23] = 'B'\r\n paint[i][24] = 'C'\r\n paint[i][36] = 'D'\r\n\r\nneed = (0, 11, 12, 23, 25, 36, 37, 48)\r\nfor_ = [[(x, y) for y in range(need[i * 2], need[i * 2 + 1], 2) for x in range(0, 33, 2)][:coef[3 - i] - 1] for i in\r\n range(4)[::-1]]\r\n\r\nfor i, mas in enumerate(for_):\r\n for el in mas:\r\n X, Y = el\r\n\r\n paint[X][Y] = au[i]\r\n\r\nfor k in range(4):\r\n for i in range(33):\r\n for j in range(need[2 * k], need[2 * k + 1]):\r\n if paint[i][j] == '.':\r\n paint[i][j] = au[k]\r\n\r\nprint(33, 48)\r\nprint('\\n'.join(''.join(map(str, p)) for p in paint))\r\n", "a, b, c, d = map(int, input().split())\r\narr = [[a, 'A'], [b, 'B'], [c, 'C'], [d, 'D']]\r\narr.sort()\r\n\r\nans = ''\r\nm = 0\r\n\r\nif arr[0][0] == 1:\r\n while arr[1][0] > 25:\r\n ans += (arr[0][1] + arr[1][1]) * 25\r\n arr[1][0] -= 25\r\n ans += '\\n'\r\n m += 1\r\n ans += arr[0][1] * 50 + '\\n'\r\n m += 1\r\n ans += (arr[0][1] + arr[1][1]) * arr[1][0]\r\n ans += (arr[0][1] + arr[0][1]) * (25 - arr[1][0]) \r\n ans += '\\n'\r\n m += 1\r\n ans += arr[0][1] * 50 + '\\n'\r\n m += 1\r\n while arr[2][0] > 25:\r\n ans += (arr[0][1] + arr[2][1]) * 25\r\n arr[2][0] -= 25\r\n ans += '\\n'\r\n m += 1\r\n ans += arr[0][1] * 50 + '\\n'\r\n m += 1\r\n ans += (arr[0][1] + arr[2][1]) * arr[2][0]\r\n ans += (arr[0][1] + arr[0][1]) * (25 - arr[2][0]) \r\n ans += '\\n'\r\n m += 1\r\n ans += arr[0][1] * 50 + '\\n'\r\n m += 1\r\n\r\n while arr[3][0] > 25:\r\n ans += (arr[0][1] + arr[3][1]) * 25 + '\\n'\r\n m += 1\r\n arr[3][0] -= 25\r\n ans += arr[0][1] * 50 + '\\n'\r\n m += 1\r\n ans += (arr[0][1] + arr[3][1]) * arr[3][0]\r\n ans += (arr[0][1] + arr[0][1]) * (25 - arr[3][0]) + '\\n'\r\n m += 1\r\n ans += arr[0][1] * 50 + '\\n'\r\n m += 1\r\n \r\nelse:\r\n arr[0][0] -= 1\r\n arr[1][0] -= 1\r\n arr[2][0] -= 1 \r\n arr[3][0] -= 1\r\n \r\n ans += arr[1][1] * 50 + '\\n'\r\n m += 1\r\n while arr[0][0] > 25:\r\n ans += (arr[0][1] + arr[1][1]) * 25 + '\\n'\r\n m += 1\r\n arr[0][0] -= 25\r\n ans += arr[1][1] * 50 + '\\n'\r\n m += 1\r\n ans += (arr[0][1] + arr[1][1]) * arr[0][0]\r\n ans += (arr[1][1] + arr[1][1]) * (25 - arr[0][0]) + '\\n'\r\n m += 1\r\n ans += arr[1][1] * 50 + '\\n'\r\n m += 1\r\n \r\n ans += arr[2][1] * 50 + '\\n'\r\n m += 1\r\n while arr[1][0] > 25:\r\n ans += (arr[1][1] + arr[2][1]) * 25 + '\\n'\r\n m += 1\r\n arr[1][0] -= 25\r\n ans += arr[2][1] * 50 + '\\n'\r\n m += 1\r\n ans += (arr[1][1] + arr[2][1]) * arr[1][0]\r\n ans += (arr[2][1] + arr[2][1]) * (25 - arr[1][0]) + '\\n'\r\n m += 1\r\n ans += arr[2][1] * 50 + '\\n'\r\n m += 1\r\n ans += arr[3][1] * 50 + '\\n'\r\n m += 1\r\n while arr[2][0] > 25:\r\n ans += (arr[2][1] + arr[3][1]) * 25 + '\\n'\r\n m += 1\r\n arr[2][0] -= 25\r\n \r\n ans += arr[3][1] * 50 + '\\n'\r\n m += 1\r\n ans += (arr[2][1] + arr[3][1]) * arr[2][0]\r\n ans += (arr[3][1] + arr[3][1]) * (25 - arr[2][0]) + '\\n'\r\n m += 1\r\n ans += arr[3][1] * 50 + '\\n'\r\n m += 1\r\n \r\n ans += arr[0][1] * 50 + '\\n'\r\n m += 1\r\n while arr[3][0] > 25:\r\n ans += (arr[3][1] + arr[0][1]) * 25 + '\\n'\r\n m += 1\r\n arr[3][0] -= 25\r\n ans += arr[0][1] * 50 + '\\n'\r\n m += 1\r\n ans += (arr[3][1] + arr[0][1]) * arr[3][0]\r\n ans += (arr[0][1] + arr[0][1]) * (25 - arr[3][0]) + '\\n'\r\n m += 1\r\n ans += arr[0][1] * 50 + '\\n'\r\n m += 1\r\nprint(m, 50) \r\nprint(ans)", "from string import ascii_uppercase as au\r\n\r\nc = tuple(map(lambda x: int(x) - 1, input().split()))\r\n\r\npaint = [[str() for i in range(44)] for j in range(33)]\r\n\r\nf = [[(x, y) for y in range(11 * i, 11 * (i + 1), 2) for x in range(0, 33, 2)] for i in range(4)]\r\n\r\nfor i, mas in enumerate(f):\r\n for el in mas[:c[(i + 2) % 4]]:\r\n X, Y = el\r\n paint[X][Y] = au[(i + 2) % 4]\r\n\r\nfor k in range(4):\r\n for i in range(33):\r\n for j in range(11 * k, 11 * (k + 1)):\r\n if paint[i][j] == str():\r\n paint[i][j] = au[k]\r\n\r\nprint(33, 44)\r\nprint('\\n'.join(''.join(p) for p in paint))\r\n", "from collections import defaultdict,deque\r\nimport sys\r\nimport bisect\r\ninput=sys.stdin.readline\r\n\r\n\r\na,b,c,d=map(int,input().split())\r\ngrid1=[['A' for i in range(50)] for j in range(12)]\r\ngrid2=[['B' for i in range(50)] for j in range(12)]\r\ngrid3=[['C' for i in range(50)] for j in range(12)]\r\ngrid4=[['D' for i in range(50)] for j in range(12)]\r\nok=False\r\nfor i in range(12):\r\n for j in range(50):\r\n if i&1 and j&1 and b>1:\r\n grid1[i][j]='B'\r\n b-=1\r\n if b==1:\r\n ok=True\r\n break\r\n if ok:\r\n break\r\n\r\nok=False\r\nfor i in range(12):\r\n for j in range(50):\r\n if i&1 and j&1 and a>1:\r\n grid2[i][j]='A'\r\n a-=1\r\n if a==1:\r\n ok=True\r\n break\r\n if ok:\r\n break\r\n\r\nok=False\r\nfor i in range(12):\r\n for j in range(50):\r\n if i&1 and j&1 and d>1:\r\n grid3[i][j]='D'\r\n d-=1\r\n if d==1:\r\n ok=True\r\n break\r\n if ok:\r\n break\r\n\r\nok=False\r\nfor i in range(12):\r\n for j in range(50):\r\n if i&1 and j&1 and c>1:\r\n grid4[i][j]='C'\r\n c-=1\r\n if c==1:\r\n ok=True\r\n break\r\n if ok:\r\n break\r\nprint(48,50)\r\nfor i in range(12):\r\n print(''.join(map(str,grid1[i])))\r\nfor i in range(12):\r\n print(''.join(map(str,grid2[i])))\r\nfor i in range(12):\r\n print(''.join(map(str,grid3[i])))\r\nfor i in range(12):\r\n print(''.join(map(str,grid4[i])))\r\n", "from sys import stdin, stdout\r\n\r\n\r\na, b, c, d = map(int, stdin.readline().split())\r\nsze = 50\r\n\r\nans = [['' for i in range(sze)] for j in range(sze)]\r\n\r\nfor i in range(sze):\r\n for j in range(sze):\r\n label = 10 * (i // 25) + 1 * (j // 25)\r\n \r\n if not label:\r\n ans[i][j] = 'A'\r\n elif label == 1:\r\n ans[i][j] = 'B'\r\n elif label == 10:\r\n ans[i][j] = 'C'\r\n else:\r\n ans[i][j] = 'D'\r\n\r\na -= 1\r\nb -= 1\r\nc -= 1\r\nd -= 1\r\n\r\nfor i in range(sze // 2, sze, 2):\r\n for j in range(sze // 2, sze, 2):\r\n if not a:\r\n break\r\n \r\n ans[i][j] = 'A'\r\n a -= 1\r\n\r\n\r\nfor i in range(0, sze // 2, 2):\r\n for j in range(0, sze // 2, 2):\r\n if not d:\r\n break\r\n \r\n ans[i][j] = 'D'\r\n d -= 1\r\n \r\n \r\n \r\nfor i in range(sze // 2, sze, 2):\r\n for j in range(0, sze // 2, 2):\r\n if not b:\r\n break\r\n \r\n ans[i][j] = 'B'\r\n b -= 1\r\n\r\n\r\nfor i in range(0, sze // 2, 2):\r\n for j in range(sze // 2, sze, 2):\r\n if not c:\r\n break\r\n \r\n ans[i][j] = 'C'\r\n c -= 1 \r\n\r\nstdout.write(str(sze) + ' ' + str(sze) + '\\n')\r\n\r\nfor i in range(sze):\r\n for j in range(sze):\r\n stdout.write(ans[i][j])\r\n \r\n stdout.write('\\n')", "from sys import stdin\r\n\r\n\r\ndef solve():\r\n for i in range(50):\r\n if not tem:\r\n return\r\n if i & 1:\r\n ans.append(new)\r\n else:\r\n cur = []\r\n for j in range(50):\r\n if not tem:\r\n cur.extend([new[0]] * (50 - j))\r\n break\r\n if j & 1:\r\n cur.append(new[0])\r\n else:\r\n cur.append(tem.pop())\r\n ans.append(''.join(cur))\r\n\r\n\r\na, b, c, d = map(int, stdin.readline().split())\r\nans, tem, new = [], ['A'] * a + ['B'] * b + ['C'] * c, 'D' * 50\r\nsolve()\r\ntem, new = ['D'] * (d - 1), ans[-1][0] * 50\r\nans.append(''.join([new[0]] + ['D'] * 49))\r\nans.append(new)\r\nsolve()\r\nprint('%d %d\\n%s' % (len(ans), 50, '\\n'.join(ans)))\r\n", "a,b,c,d = map(int,input().split())\r\nif a + b + c + d == 4:\r\n print(1,4)\r\n print(\"ABCD\")\r\nelse:\r\n print(50,50)\r\n ans = [[\"\"]*50 for i in range(50)]\r\n if a == 1:\r\n for i in range(50):\r\n for j in range(50):\r\n ans[i][j] = \"A\"\r\n for i in range(0,50,2):\r\n for j in range(0,50,2):\r\n b -= 1\r\n ans[i][j] = \"B\"\r\n if b == 0:\r\n break\r\n if b == 0:\r\n break\r\n for i in range(15,50,2):\r\n for j in range(0,50,2):\r\n c -= 1\r\n ans[i][j] = \"C\"\r\n if c == 0:\r\n break\r\n if c == 0:\r\n break\r\n for i in range(30,50,2):\r\n for j in range(0,50,2):\r\n d -= 1\r\n ans[i][j] = \"D\"\r\n if d == 0:\r\n break\r\n if d == 0:\r\n break\r\n elif b == 1:\r\n for i in range(50):\r\n for j in range(50):\r\n ans[i][j] = \"B\"\r\n for i in range(0,50,2):\r\n for j in range(0,50,2):\r\n a -= 1\r\n ans[i][j] = \"a\"\r\n if a == 0:\r\n break\r\n if a == 0:\r\n break\r\n for i in range(15,50,2):\r\n for j in range(0,50,2):\r\n c -= 1\r\n ans[i][j] = \"C\"\r\n if c == 0:\r\n break\r\n if c == 0:\r\n break\r\n for i in range(30,50,2):\r\n for j in range(0,50,2):\r\n d -= 1\r\n ans[i][j] = \"D\"\r\n if d == 0:\r\n break\r\n if d == 0:\r\n break\r\n else:\r\n b -= 1\r\n a -= 1\r\n for i in range(50):\r\n for j in range(50):\r\n ans[i][j] = \"A\"\r\n for i in range(0,50,2):\r\n for j in range(0,50,2):\r\n b -= 1\r\n ans[i][j] = \"B\"\r\n if b == 0:\r\n break\r\n if b == 0:\r\n break\r\n for i in range(12,50,2):\r\n for j in range(0,50,2):\r\n c -= 1\r\n ans[i][j] = \"C\"\r\n if c == 0:\r\n break\r\n if c == 0:\r\n break\r\n for i in range(24,50,2):\r\n for j in range(0,50,2):\r\n d -= 1\r\n ans[i][j] = \"D\"\r\n if d == 0:\r\n break\r\n if d == 0:\r\n break\r\n for i in range(35,50):\r\n for j in range(50):\r\n ans[i][j] = \"B\"\r\n for i in range(37,50,2):\r\n for j in range(0,50,2):\r\n a -= 1\r\n ans[i][j] = \"A\"\r\n if a == 0:\r\n break\r\n if a == 0:\r\n break\r\n for i in range(50):\r\n for j in range(50):\r\n print(ans[i][j],end=\"\")\r\n print()\r\n", "a, b, c, d = map(int, input().split())\r\nm = [['a'] * 50 for i in range(40)]\r\nfor i in range(10, 20): m[i] = ['b'] * 50\r\nfor i in range(20, 30): m[i] = ['c'] * 50\r\nfor i in range(30, 40): m[i] = ['d'] * 50\r\n# them 'b'\r\nfor i in range(0, 10, 2):\r\n for j in range(50):\r\n if (((i + j) % 2) == 0) and (b > 1):\r\n b -= 1\r\n m[i][j] = 'b'\r\n# them 'c'\r\nfor i in range(10, 20, 2):\r\n for j in range(50):\r\n if (((i + j) % 2) == 0) and (c > 1):\r\n c -= 1\r\n m[i][j] = 'c'\r\n# them 'd'\r\nfor i in range(20, 30, 2):\r\n for j in range(50):\r\n if (((i + j) % 2) == 0) and (d > 1):\r\n d -= 1\r\n m[i][j] = 'd'\r\n# them 'a'\r\nfor i in range(30, 40, 2):\r\n for j in range(50):\r\n if (((i + j) % 2) == 0) and (a > 1):\r\n a -= 1\r\n m[i][j] = 'a'\r\nprint(40, 50)\r\nfor line in m:\r\n print(''.join(line))\r\n", "import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools\n\nsys.setrecursionlimit(10**7)\ninf = 10**20\neps = 1.0 / 10**10\nmod = 998244353\ndd = [(0,-1),(1,0),(0,1),(-1,0)]\nddn = [(0,-1),(1,-1),(1,0),(1,1),(0,1),(-1,-1),(-1,0),(-1,1)]\n\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\ndef LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]\ndef LF(): return [float(x) for x in sys.stdin.readline().split()]\ndef LS(): return sys.stdin.readline().split()\ndef I(): return int(sys.stdin.readline())\ndef F(): return float(sys.stdin.readline())\ndef S(): return input()\ndef pf(s): return print(s, flush=True)\n\n\ndef main():\n a,b,c,d = LI()\n r = [['']*50 for _ in range(50)]\n for i in range(50):\n for j in range(50):\n if i < 25:\n if j < 25:\n r[i][j] = 'A'\n else:\n r[i][j] = 'B'\n else:\n if j < 25:\n r[i][j] = 'C'\n else:\n r[i][j] = 'D'\n\n for i in range(a-1):\n j = (i // 12) * 2\n k = (i % 12) * 2\n r[j][k+26] = 'A'\n for i in range(b-1):\n j = (i // 12) * 2\n k = (i % 12) * 2\n r[j][k] = 'B'\n for i in range(c-1):\n j = (i // 12) * 2\n k = (i % 12) * 2\n r[j+26][k+26] = 'C'\n for i in range(d-1):\n j = (i // 12) * 2\n k = (i % 12) * 2\n r[j+26][k] = 'D'\n\n\n return '50 50\\n' + '\\n'.join(map(lambda x: ''.join(x), r))\n\n\nprint(main())\n\n", "a, b, c, d = map(int, input().split())\r\n\r\npaint = [['.' for i in range(50)] for j in range(50)]\r\n\r\nfor i in range(50):\r\n paint[i][12] = 'A'\r\n paint[i][24] = 'B'\r\n paint[i][25] = 'C'\r\n paint[i][37] = 'D'\r\n\r\nfor_a = [(x, y) for y in range(38, 50, 2) for x in range(0, 50, 2)]\r\nfor_b = [(x, y) for y in range(26, 37, 2) for x in range(0, 50, 2)]\r\nfor_c = [(x, y) for y in range(13, 24, 2) for x in range(0, 50, 2)]\r\nfor_d = [(x, y) for y in range(0, 12, 2) for x in range(0, 50, 2)]\r\n\r\nfor i in range(a - 1):\r\n X, Y = for_a[i]\r\n\r\n paint[X][Y] = 'A'\r\n\r\nfor i in range(b - 1):\r\n X, Y = for_b[i]\r\n\r\n paint[X][Y] = 'B'\r\n\r\nfor i in range(c - 1):\r\n X, Y = for_c[i]\r\n\r\n paint[X][Y] = 'C'\r\n\r\nfor i in range(d - 1):\r\n X, Y = for_d[i]\r\n\r\n paint[X][Y] = 'D'\r\n\r\nfor i in range(50):\r\n for j in range(12):\r\n if paint[i][j] == '.':\r\n paint[i][j] = 'A'\r\n\r\nfor i in range(50):\r\n for j in range(13, 24):\r\n if paint[i][j] == '.':\r\n paint[i][j] = 'B'\r\n\r\nfor i in range(50):\r\n for j in range(26, 37):\r\n if paint[i][j] == '.':\r\n paint[i][j] = 'C'\r\n\r\nfor i in range(50):\r\n for j in range(38, 50):\r\n if paint[i][j] == '.':\r\n paint[i][j] = 'D'\r\n\r\nprint(50, 50)\r\nprint('\\n'.join(''.join(map(str, paint[i])) for i in range(50)))\r\n", "#!/usr/bin/env python3\n\n[a, b, c, d] = map(int, input().strip().split())\n\nN = 25\ndef make(q, fore, back):\n\tfld = [[back for _ in range(N)] for __ in range(N)]\n\tP = N // 2\n\tfor i in range(q):\n\t\tfld[2 * (i % P)][2 * (i // P)] = fore\n\treturn fld\n\nres = [['X' for _ in range(2 * N)] for j in range(2 * N)]\n\nAB = make(a - 1, 'A', 'B')\nBC = make(b - 1, 'B', 'C')\nCD = make(c - 1, 'C', 'D')\nDA = make(d - 1, 'D', 'A')\n\nfor i in range(N):\n\tfor j in range(N):\n\t\tres[i][j] = AB[i][j]\n\t\tres[2 * N - i - 1][j] = BC[i][j]\n\t\tres[i][2 * N - j - 1] = CD[i][j]\n\t\tres[2 * N - i - 1][2 * N - j - 1] = DA[i][j]\n\nprint (2 * N, 2 * N)\nfor row in res:\n\tprint (''.join(row))\n\n\t\t\t\n", "def printMatrix(matrix):\r\n s = [[str(e) for e in row] for row in matrix]\r\n lens = [max(map(len, col)) for col in zip(*s)]\r\n fmt = '\\t'.join('{{:{}}}'.format(x) for x in lens)\r\n table = [fmt.format(*row) for row in s]\r\n print(\"_________________\")\r\n print('\\n'.join(table))\r\n print(\"`````````````````\")\r\na, b, c, d = map(int,input().split())\r\nmat = [[\"A\" for i in range(50)] for j in range(40)]\r\nprint(40, 50)\r\nfor i in range(10, 20):\r\n for j in range(50):\r\n mat[i][j] = \"B\"\r\nfor i in range(20, 30):\r\n for j in range(50):\r\n mat[i][j] = \"C\"\r\nfor i in range(30, 40):\r\n for j in range(50):\r\n mat[i][j] = \"D\"\r\na-=1\r\nb-=1\r\nc-=1\r\nd-=1\r\nx = 0\r\ny = 0\r\nfor i in range(b):\r\n mat[x][y] = \"B\"\r\n y += 2\r\n if(y >= 50):\r\n x += 2\r\n y = 0\r\nx = 10\r\ny = 0\r\nfor i in range(c):\r\n mat[x][y] = \"C\"\r\n y += 2\r\n if(y >= 50):\r\n x += 2\r\n y = 0\r\nx = 20\r\ny = 0\r\nfor i in range(d):\r\n mat[x][y] = \"D\"\r\n y += 2\r\n if(y >= 50):\r\n x += 2\r\n y = 0\r\nx = 30\r\ny = 0\r\nfor i in range(a):\r\n mat[x][y] = \"A\"\r\n y += 2\r\n if(y >= 50):\r\n x += 2\r\n y = 0\r\nfor i in range(40):\r\n print(\"\".join(mat[i]))", "from collections import deque\n\n\ndef read():\n return [int(v) for v in input().split()]\n\n\ndef main():\n colors = 'ABCD'\n counts = dict(zip(colors, read()))\n\n print(48, 50)\n\n for i, c in enumerate(colors):\n col_next = colors[(i + 1) % len(colors)]\n\n t = []\n for _ in range(12):\n t.append(list(c * 50))\n\n indx, indy = 0, 0\n while counts[col_next] > 1:\n t[indx][indy] = col_next\n counts[col_next] -= 1\n indy += 2\n if indy == 50:\n indx += 2\n indy = 0\n\n for s in t:\n print(''.join(s))\n\n\nif __name__ == '__main__':\n main()\n", "# Codeforces Round #487 (Div. 2)import collections\r\nfrom functools import cmp_to_key\r\n#key=cmp_to_key(lambda x,y: 1 if x not in y else -1 )\r\n\r\nimport sys\r\ndef getIntList():\r\n return list(map(int, input().split())) \r\n\r\n \r\n \r\n \r\nf = getIntList()\r\n\r\nfn = 'abcd'\r\n\r\nmatrix = [ [-1 for x in range(50)] for x in range(50) ]\r\n\r\n\r\nfor i in range(25):\r\n if i%2==0:\r\n \r\n for j in range(50):\r\n matrix[i][j] = 0\r\n else:\r\n for j in range(50):\r\n if j%2==0:\r\n matrix[i][j] = 0\r\n \r\nfor i in range(25):\r\n if i%2==0:\r\n for j in range(50):\r\n matrix[i+25][j] = 1\r\n else:\r\n for j in range(50):\r\n if j%2==0:\r\n matrix[i+25][j] = 1\r\nf[0] -=1\r\nf[1] -=1\r\n\r\nfor i in range(25):\r\n if i%2==1: \r\n for j in range(0,50):\r\n if j%2==0: continue\r\n for x in range(1,4):\r\n if f[x] > 0:\r\n f[x]-=1\r\n matrix[i][j] = x\r\n break\r\n if matrix[i][j] <0 : matrix[i][j] = 0\r\n\r\nfor i in range(25):\r\n if i%2==1: \r\n for j in range(0,50):\r\n if j%2==0: continue\r\n for x in range(0,4):\r\n if x ==1: continue\r\n if f[x] > 0:\r\n f[x]-=1\r\n matrix[i+25][j] = x\r\n break\r\n if matrix[i+25][j] <0 : matrix[i+25][j] = 1 \r\nprint(50,50)\r\nfor i in range(50):\r\n for j in range(50):\r\n #matrix[i][j] = str(matrix[i][j])\r\n matrix[i][j] = chr(ord('A') + matrix[i][j])\r\n print(''.join(matrix[i]) )\r\n\r\n" ]

[ "import sys\r\nfrom array import array\r\n\r\ninput = lambda: sys.stdin.buffer.readline().decode().strip()\r\ns, out = input(), array('i')\r\nn = len(s)\r\ndp = [array('i', [1] * n) for _ in range(n)]\r\npre = array('i', [1] * n)\r\n\r\nfor i in range(2, n + 1):\r\n for j in range(n - i + 1):\r\n l, r = j, i + j - 1\r\n dp[l][r] = dp[l + 1][r - 1] * (s[l] == s[r])\r\n pre[r] += dp[l][r]\r\n\r\nfor i in range(n):\r\n for j in range(i + 1, n):\r\n cur = dp[i][j]\r\n dp[i][j] = dp[i][j - 1] + pre[j]\r\n pre[j] -= cur\r\n\r\nfor _ in range(int(input())):\r\n l, r = map(int, input().split())\r\n out.append(dp[l - 1][r - 1])\r\n\r\nprint('\\n'.join(map(str, out)))\r\n" ]

[ "import sys\n# sys.stdin = open(\".in\", \"r\")\n# sys.stdout = open(\".out\", \"w\")\ninput = sys.stdin.readline\ndef print(*args, end='\\n', sep=' ') -> None:\n sys.stdout.write(sep.join(map(str, args)) + end)\ndef map_int():\n return map(int, input().split())\ndef list_int():\n return list(map(int, input().split()))\nfrom collections import defaultdict\n\n\ndef possible(timme):\n rangeL, rangeR = -10**25, 10**25\n for i in range(n):\n curL = pos_speed[i][0] - pos_speed[i][1]*timme\n curR = pos_speed[i][0] + pos_speed[i][1]*timme\n if curL > rangeR: return False\n rangeL = curL\n rangeR = min(rangeR, curR)\n return True\n\n\nn = int(input())\nposisions = list_int()\nspeed = list_int()\npos_speed = sorted(zip(posisions, speed))\nl, r = 0, 10**25\nanswer = r\nwhile l <= r:\n mid = l + (r-l)/2\n if possible(mid):\n answer = mid\n r = mid - 0.0000001\n else:\n l = mid + 0.0000001\n\n\nprint(answer)", "\r\ndef check(second):\r\n second = second * 0.000001\r\n # 1^-2 = 0.01\r\n lower_bound = 0\r\n higher_bound = 999999999999999\r\n for i in range(len(friends)):\r\n lower_bound = max(lower_bound, friends[i] - speed[i] * second)\r\n higher_bound = min(higher_bound, friends[i] + speed[i] * second)\r\n if lower_bound <= higher_bound:\r\n return True\r\n return False\r\n\r\n\r\nn = int(input().strip())\r\nfriends = [int(x) for x in input().strip().split()]\r\nspeed = [int(x) for x in input().strip().split()]\r\n# print(friends)\r\n# print(speed)\r\n\r\nlo = 0\r\nhi = 10 ** 15\r\nans = 0\r\nwhile lo < hi:\r\n mid = lo + (hi - lo) // 2\r\n if check(mid):\r\n hi = mid\r\n ans = mid\r\n else:\r\n lo = mid + 1\r\nprint(ans * 0.000001)\r\n", "def check(z):\r\n L= -float('inf')\r\n R = float('inf')\r\n for i in range(n):\r\n L=max(L,x[i]-v[i]*z)\r\n R=min(R,x[i]+v[i]*z)\r\n if L<=R:\r\n return True\r\n else:\r\n return False\r\nn=int(input())\r\nx=list(map(int,input().split()))\r\nv=list(map(int,input().split()))\r\nl=0\r\nr=1e9\r\nans=-1.0\r\nwhile r-l>.0000006:\r\n mid=(l+r)/2\r\n if check(mid):\r\n r=mid\r\n else:\r\n l=mid\r\nprint(mid)\r\n ", "N = int(input())\r\nX = [int(i) for i in input().split()]\r\nV = [int(i) for i in input().split()]\r\nlow, high = min(X), max(X)\r\n\r\nfor it in range(60):\r\n mid = (low + high) / 2\r\n maxt = -1\r\n maxd = 0\r\n for i in range(N):\r\n d = mid - X[i]\r\n t = abs(d) / V[i]\r\n if t > maxt:\r\n maxt = t\r\n maxd = d\r\n if maxd > 0:\r\n high = mid\r\n else:\r\n low = mid\r\n\r\nprint(maxt)", "def find_min_time(n, x, v):\n l = -1\n r = max(x) / 2 + 1\n while r - l > 1e-6:\n mid = l + (r - l) / 2\n l1 = sorted(x[i] - mid*v[i] for i in range(len(x)))\n r1 = sorted(x[i] + mid*v[i] for i in range(len(x)))\n if r1[0] <= l1[-1]:\n l = mid\n else:\n r = mid\n return l\nn = int(input())\nx = list(map(int, input().split()))\nv = list(map(int, input().split()))\n\nprint(find_min_time(n, x, v))\n\n\t \t\t\t\t \t\t\t \t \t\t\t \t \t", "def solve(n, xs, vs):\r\n def get_max_time(x):\r\n return max([\r\n abs(x - xs[i]) / vs[i] for i in range(n)\r\n ])\r\n\r\n x1 = min(xs)\r\n x2 = max(xs)\r\n while True:\r\n l = x2 - x1\r\n x1new = x1 + l / 3\r\n x2new = x2 - l / 3\r\n t1 = get_max_time(x1new)\r\n t2 = get_max_time(x2new)\r\n\r\n if x2 - x1 < 10e-7 and abs(t1 - t2) < 10e-7:\r\n return (t1 + t2) / 2\r\n\r\n if t1 < t2:\r\n x2 = x2new\r\n else:\r\n x1 = x1new\r\n\r\n\r\nprint(solve(\r\n int(input()),\r\n tuple(map(int, input().split())),\r\n tuple(map(int, input().split()))\r\n))\r\n", "n = int(input())\npositions = [int(x) for x in input().split()]\nspeeds = [int(x) for x in input().split()]\n\n\ndef work(time):\n cur_left = positions[0] - speeds[0] * time\n cur_right = positions[0] + speeds[0] * time\n for i in range(1, len(positions)):\n #print(cur_left, cur_right)\n cur_left = max(cur_left, positions[i] - speeds[i] * time)\n cur_right = min(cur_right, positions[i] + speeds[i] * time)\n if cur_left <= cur_right:\n return True\n else:\n return False\n\n\nright = 1e9 / 2\nleft = 0\nwhile right - left > 1e-7:\n\n mid = (right + left) / 2\n #print(left, mid, right)\n if work(mid):\n right = mid\n else:\n left = mid + 1e-8\n\nprint(\"%.10f\" % right)\n\n\t \t\t \t \t\t \t \t \t\t \t\t\t \t", "import sys\r\nimport os\r\ntry:\r\n sys.stdin = open('./input.txt', 'r')\r\n sys.stdout = open('./output.txt', 'w')\r\nexcept:\r\n pass\r\n\r\ndef rightmost_left_value(time):\r\n new_positions = []\r\n for i in range(no_of_friends):\r\n new_positions.append(initial_position[i]-(maximum_speeds[i])*time)\r\n \r\n min_value = max(new_positions)\r\n return min_value\r\n\r\ndef leftmost_right_value(time):\r\n new_positions = []\r\n for i in range(no_of_friends):\r\n new_positions.append(initial_position[i]+(maximum_speeds[i])*time)\r\n \r\n min_value = min(new_positions)\r\n return min_value\r\n\r\n\r\n\r\ndef friends_intersecting(time):\r\n rmlv = rightmost_left_value(time)\r\n lmrv = leftmost_right_value(time)\r\n\r\n if rmlv <= lmrv:\r\n return True\r\n else:\r\n return False\r\n\r\nno_of_friends = int(input())\r\ninitial_position = list(map(int,input().split()))\r\nmaximum_speeds = list(map(int,input().split()))\r\n\r\nLeft_time_limit,Right_time_limit = 0,1e9\r\n\r\nwhile abs(Left_time_limit-Right_time_limit) > 1e-6:\r\n\r\n Time = (Left_time_limit + Right_time_limit)/2\r\n\r\n if friends_intersecting(Time):\r\n Right_time_limit = Time \r\n else:\r\n Left_time_limit = Time\r\n\r\nprint(Time)\r\n \r\n\r\n", "n = int(input())\r\nxs = list(map(int, input().split()))\r\nvs = list(map(int, input().split()))\r\n\r\ndef get_max_time(x):\r\n return max([\r\n abs(x - xs[i]) / vs[i] for i in range(n)\r\n ])\r\n\r\ndef find_max(p1, p2):\r\n dp = p2 - p1\r\n x1 = p1 + dp / 3\r\n x2 = p2 - dp / 3\r\n\r\n t1 = get_max_time(x1)\r\n t2 = get_max_time(x2)\r\n\r\n if p2 - p1 < 10e-7 and abs(t1 - t2) < 10e-7:\r\n return get_max_time((x1 + x2) / 2)\r\n\r\n if t1 < t2:\r\n return find_max(p1, x2)\r\n else:\r\n return find_max(x1, p2)\r\n\r\nm = find_max(min(xs), max(xs))\r\nprint(m)\r\n", "def rightmost_left_ep(t):\r\n return max([x[i] - (v[i] * t) for i in range(n)])\r\n\r\n\r\ndef leftmost_right_ep(t):\r\n return min([x[i] + (v[i] * t) for i in range(n)])\r\n\r\n\r\ndef is_feasible(K):\r\n return rightmost_left_ep(K) <= leftmost_right_ep(K)\r\n\r\n\r\nn = int(input())\r\nx = list(map(int, input().split()))\r\nv = list(map(int, input().split()))\r\n\r\n\r\nL, R = 0.0, 1e9\r\nwhile abs(R - L) >= 1e-6:\r\n mid = (L + R) / 2\r\n if is_feasible(mid):\r\n R = mid\r\n else:\r\n L = mid\r\n\r\nprint(mid)\r\n", "def minEnd(positions, speeds, k):\r\n return min(positions[i] + speeds[i] * k for i in range(len(positions)))\r\n\r\ndef maxStart(positions, speeds, k):\r\n return max(positions[i] - speeds[i] * k for i in range(len(positions)))\r\n\r\n\r\ndef isPossible(positions, speeds, k):\r\n return maxStart(positions, speeds, k) <= minEnd(positions, speeds, k)\r\n\r\nn = int(input())\r\npositions = list(map(int, input().split()))\r\nspeeds = list(map(int, input().split()))\r\n\r\nleft, right, ans = 0.0, 1e9, 0\r\n\r\nwhile right - left > 1e-6:\r\n mid = (left + right)/2\r\n if isPossible(positions, speeds, mid):\r\n ans = mid\r\n right = mid\r\n else:\r\n left = mid\r\n\r\nprint(ans)", "def check(x, v, n, t): \r\n leftMax = max([pos-(vel*t) for pos, vel in zip(x, v)])\r\n rightMin = min([pos+(vel*t) for pos, vel in zip(x, v)])\r\n \r\n if leftMax <= rightMin:\r\n return True\r\n \r\n return False\r\n\r\nn = int(input())\r\nx = [int(i) for i in input().split()]\r\nv = [int(i) for i in input().split()]\r\n\r\n# Binary search for optimal time\r\nend = 10**9\r\nbeg = 0\r\nans = -1\r\nwhile beg <= end:\r\n mid = (beg + end) / 2\r\n if abs(mid-ans) <= 10**(-6):\r\n break\r\n if check(x, v, n, mid):\r\n end = mid\r\n ans = mid\r\n else:\r\n beg = mid\r\n\r\nprint(mid)", "n = int(input())\r\n\r\n# Read the location array:\r\nx = [int(x) for x in input().split()]\r\n\r\n# Read the velocity array:\r\nv = [int(x) for x in input().split()]\r\n\r\n\r\ndef rightmost_left_ep(t):\r\n return max([x[i] - (v[i] * t) for i in range(n)])\r\n\r\n\r\ndef leftmost_right_ep(t):\r\n return min([x[i] + (v[i] * t) for i in range(n)])\r\n\r\n\r\ndef is_feasible(K):\r\n return rightmost_left_ep(K) <= leftmost_right_ep(K)\r\n\r\n\r\nL, R = 0.0, 1e9\r\n\r\nwhile abs(R - L) > 1e-6:\r\n mid = (L + R) / 2\r\n\r\n # If mid is feasible, try with less time.\r\n # So truncate the top half of the search space\r\n if (is_feasible(mid)):\r\n R = mid\r\n\r\n # If mid is infeasible, try with more time.\r\n # So truncate the bottom half of the search space\r\n else:\r\n L = mid\r\n\r\nprint(mid)", "f = int(input())\ncoords = list(map(int, input().split()))\nspeeds = list(map(int, input().split()))\n\nlo = min(coords)\nhi = max(coords)\n\ndef calcTime(mid,speeds,coords):\n return max([abs(mid-x)/speeds[i] for i,x in enumerate(coords)])\n\nminSoFar = 10**12\ncount = 0\nts, te = calcTime(lo,speeds,coords), calcTime(hi, speeds, coords)\n\nwhile count < 80:\n count+=1\n mid = lo + (hi-lo)/2\n mp = calcTime(mid,speeds,coords)\n\n mid2 = mid + (hi - mid)/2\n mp2 = calcTime(mid2, speeds,coords)\n\n if mp2 < mp:\n lo = mid\n else:\n hi = mid2\n minSoFar = min(minSoFar,mp,mp2)\n\nprint(\"{0:.9f}\".format(minSoFar))\n \n \n\n", "\r\nn = int(input())\r\n\r\nx = [int(p) for p in input().split()]\r\n\r\nv = [int(q) for q in input().split()]\r\n\r\ndef leftmost_ptr(t):\r\n\treturn max([(x[i]-(v[i]*t)) for i in range(n)])\r\n\r\ndef rightmost_ptr(t):\r\n\treturn min([(x[i]+(v[i]*t)) for i in range(n)])\r\n\r\ndef is_valid(K):\r\n\treturn rightmost_ptr(K) >= leftmost_ptr(K)\r\n\r\nlow , high = 0.0 , 1e9\r\n\r\nwhile abs(high-low) > 1e-6 :\r\n\tmid = ( low + high ) / 2 \r\n\tif is_valid(mid):\r\n\t\thigh = mid\r\n\telse : low = mid \r\n\r\nprint(mid)", "EPS = 1e-7\r\n\r\ndef mogaSieSpotkac(czas):\r\n\tglobal pozycja\r\n\tglobal predkosc\r\n\t# print(czas)\r\n\t# poczatkowe miejsce spotkania\r\n\tL = 0\r\n\tR = 1e9\r\n\r\n\t# przejdz po kolei po osobach i zaktualizuj miejsce spotkania\r\n\tfor poz, v in zip(pozycja, predkosc):\r\n\t\t# droga, jaka i-ta osoba może przebyć w jedna strone\r\n\t\tdroga = v * czas\r\n\r\n\t\t# gdzie najdalej na lewo/prawo moze dotrzec i-ta osoba\r\n\t\tlewo = poz - droga\r\n\t\tprawo = poz + droga\r\n\r\n\t\tL = max(lewo, L)\r\n\t\tR = min(prawo, R)\r\n\r\n\t\t# jezeli miejsce spotkania nie istnieje, zwroc false\r\n\t\tif (L > R):\r\n\t\t\treturn False\r\n\r\n\t# rozpatrzylismy wszystkie osoby, mamy miejsce spotkania\r\n\treturn True\r\n\r\ndef BS(lewo, prawo):\r\n\twhile (prawo - lewo > EPS):\r\n\t\tsrodek = (lewo + prawo) / 2\r\n\t\tif (mogaSieSpotkac(srodek)):\r\n\t\t\tprawo = srodek # nie ma sensu patrzec na czasy wieksze\r\n\t\telse:\r\n\t\t\tlewo = srodek # nie ma sensu patrzec na czasy mniejsze\r\n\r\n\treturn lewo\r\n\r\n\r\nliczba_osob = int(input())\r\n\r\n# poczatkowa pozycja i-tej osoby\r\npozycja = list(map(int, input().split()))\r\n# maksymalna predkosc i-tej osoby\r\npredkosc = list(map(int, input().split()))\r\n\r\nprint(BS(0, 1e9))", "def check(m):\n global x, v, n\n right = min(x[0] + v[0] * m, 1000000000)\n left = max(x[0] - v[0] * m, 1)\n for i in range(n):\n l1 = max(x[i] - v[i] * m, 1)\n r1 = min(x[i] + v[i] * m, 1000000000)\n if (r1 < left or l1 > right):\n return False\n right = min(right, r1)\n left = max(left, l1)\n return True\n\n\nn = int(input())\nR = 1000000000\nL = -1\nx = list(map(int, input().split()))\nv = list(map(int, input().split()))\nwhile R - L > 0.000001:\n m = (R + L) / 2\n if check(m):\n R = m\n else:\n L = m\nprint(R)", "def towards_left(pt,v,t):\r\n return max([pt[i]-(v[i]*t) for i in range(len(pt))])\r\n\r\ndef towards_right(pt,v,t):\r\n return min([pt[i]+(v[i]*t) for i in range(len(pt))])\r\n\r\ntest=int(input())\r\nif(test>1):\r\n pt=list(map(int,input().strip().split()))\r\n v=list(map(int,input().strip().split()))\r\n st=0\r\n end=10**9\r\n while abs(st-end)> 10**-6:\r\n m=(st+end)/2\r\n if(towards_right(pt,v,m)>=towards_left(pt,v,m)):\r\n end=m\r\n else:\r\n st=m\r\n print(st)\r\n\r\n ", "n = int(input())\npeople = list(map(int, input().split()))\npace = list(map(int, input().split()))\n\na, b = -1, 10 ** 9\nwhile b - a > 10 ** (-6) :\n mid = (a + b) / 2\n l, r = -1, 10 ** 9\n for i, j in zip(people, pace):\n l = max(l, i - j * mid)\n r = min(r, i + j * mid)\n if l <= r:\n b = mid\n else:\n a = mid\nprint(b)\n\t\t \t\t\t\t \t \t\t\t \t\t \t \t \t\t \t \t", "'''\r\nsub ka max <=min of add\r\n'''\r\n\r\ndef check(start,speed,mid):\r\n mx=-float('inf')\r\n mn=float(\"inf\")\r\n for id,i in enumerate(start):\r\n mx=max(mx,i-(speed[id]*mid))\r\n mn=min(mn,i+(speed[id]*mid))\r\n return round(mn,6)>=round(mx,6)\r\n\r\ndef f(start,speed):\r\n lo=0\r\n hi=10**9\r\n cnt=0\r\n ans=-1\r\n # print(check(start,speed,2))\r\n while lo<=hi and cnt<55:\r\n mid=(lo+hi)/2\r\n if check(start,speed,mid):\r\n hi=mid\r\n ans=mid\r\n else:\r\n lo=mid\r\n cnt+=1\r\n return ans\r\nn=input()\r\nstart=[*map(int,input().strip().split())]\r\nspeed=[*map(int,input().strip().split())]\r\nprint(f(start,speed))\r\n", "n = int(input())\n\n\nx = [int(x) for x in input().split()]\n\nv = [int(x) for x in input().split()]\n\n\ndef rightmost_left_ep(t):\n return max([x[i] - (v[i] * t) for i in range(n)])\n\n\ndef leftmost_right_ep(t):\n return min([x[i] + (v[i] * t) for i in range(n)])\n\n\ndef is_feasible(K):\n return rightmost_left_ep(K) <= leftmost_right_ep(K)\n\n\nL, R = 0.0, 1e9\n\nwhile abs(R - L) > 1e-6:\n mid = (L + R) / 2\n\n\n if (is_feasible(mid)):\n R = mid\n\n \n else:\n L = mid\n\nprint(mid)\n \t \t \t \t \t\t\t\t\t\t\t \t \t\t \t \t", "import math\r\ndef binS():\r\n l = 0\r\n r = 100000000000000\r\n for i in range(100):\r\n mid = (l+r) / 2\r\n if f(mid):\r\n r = mid\r\n else:\r\n l = mid\r\n print(r)\r\n\r\n\r\ndef f(s):\r\n lmax = -1*math.inf\r\n rmin = math.inf\r\n for i in range(n):\r\n lmax = max(lmax,a[i]-v[i]*s)\r\n rmin = min(rmin,a[i]+v[i]*s)\r\n if lmax > rmin:\r\n return False\r\n return True\r\nn = int(input())\r\na = list(map(int,input().split()))\r\nv = list(map(int,input().split()))\r\nbinS()\r\n\r\n", "\"\"\"\r\nhttps://codeforces.com/contest/782/problem/B\r\n3\r\n7 1 3\r\n1 2 1 should output 2\r\n\r\n4\r\n5 10 3 2\r\n2 3 2 4 should output 1.4\r\n\"\"\"\r\n\r\n\r\ndef overlap(interval1, interval2):\r\n if interval1[0] > interval2[0]:\r\n return overlap(interval2, interval1)\r\n if interval1[1] >= interval2[0]:\r\n return [interval2[0], min(interval1[1], interval2[1])]\r\n return None\r\n\r\n\r\ndef possible(people, time_limit):\r\n can_reach = [people[0][0] - time_limit * people[0][1], # though it asks for 6, do 7 just in case\r\n people[0][0] + time_limit * people[0][1]]\r\n for p in range(1, len(people)):\r\n person = people[p]\r\n new_interval = [person[0] - time_limit * person[1],\r\n person[0] + time_limit * person[1]]\r\n can_reach = overlap(can_reach, new_interval)\r\n if can_reach is None:\r\n return False\r\n return True\r\n\r\n\r\npeople_num = int(input())\r\nfriends = [p for p in zip([int(i) * 10 ** 6 for i in input().split()], [int(i) for i in input().split()])]\r\n\r\nlo = 0\r\nhi = 10 ** 15\r\nvalid = 0\r\nwhile lo <= hi:\r\n mi = (lo + hi) // 2\r\n if possible(friends, mi):\r\n hi = mi - 1\r\n valid = mi / (10 ** 6)\r\n else:\r\n lo = mi + 1\r\n\r\nprint(valid)\r\n", "# This is the number of people:\r\nn = int(input())\r\n\r\n# Read the location array:\r\nx = [int(x) for x in input().split()]\r\n\r\n# Read the velocity array:\r\nv=[int(x) for x in input().split()]\r\n\r\ndef rightmost_left_ep(t):\r\n return max([x[i]-(v[i]*t) for i in range(n)])\r\n\r\ndef leftmost_right_ep(t):\r\n return min([x[i]+(v[i]*t) for i in range(n)])\r\n\r\ndef is_feasible(K):\r\n return rightmost_left_ep(K) <= leftmost_right_ep(K)\r\n\r\nL,R = 0.0, 1e9\r\n\r\nwhile abs(R-L)>1e-6:\r\n mid=(L+R)/2\r\n \r\n # If mid is feasible, try with less time.\r\n # So truncate the top half of the search space\r\n if(is_feasible(mid)): R=mid\r\n \r\n # If mid is infeasible, try with more time.\r\n # So truncate the bottom half of the search space\r\n else: L=mid\r\n \r\nprint(mid)", "\nmx = 10e9\nmn = 0\nguess = (mx - mn) / 2\nn = int(input())\nlocations = list(map(int, input().split()))\nspeeds = list(map(int, input().split()))\n\nwhile mx - mn > 10e-7:\n guess = (mx - mn) / 2 + mn\n start_int = 1\n end_int = 10e9\n flag = False\n for person in range(n):\n start = locations[person]\n speed = speeds[person]\n bottom = start - speed * guess\n top = start + speed * guess\n start_int = max(bottom, start_int)\n end_int = min(top, end_int)\n if start_int > end_int:\n mn = guess\n flag = True\n break\n if flag:\n continue\n mx = guess\nprint(guess)\n", "n=int(input())\r\nxn=list(map(int,input().split()))\r\nvn=list(map(int,input().split()))\r\nr,l=10**9,0\r\neps=1e-12\r\nfor j in range(200):\r\n m=(l+r)/2\r\n b,f,a=10**9,0,0\r\n for i in range(n):\r\n a,b=max(a,xn[i]-vn[i]*m), min(b,xn[i]+vn[i]*m)\r\n if b+eps<a: f=1\r\n if f==1:\r\n l=m\r\n else:\r\n r=m\r\nprint(r)", "def check_possible(xs, vs, t, x_min, x_max):\r\n L = x_min\r\n R = x_max\r\n\r\n for x, v in zip(xs, vs):\r\n l = x - v * t\r\n r = x + v * t\r\n\r\n L = max(L, l)\r\n R = min(R, r)\r\n if L > R:\r\n return False\r\n\r\n return True\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n xs = list(map(int, input().split()))\r\n vs = list(map(int, input().split()))\r\n\r\n x_min = min(xs)\r\n x_max = max(xs)\r\n\r\n t_min = 0\r\n t_max = x_max - x_min\r\n\r\n while t_max - t_min > 1e-7 * max(1, t_max):\r\n t = 0.5 * (t_max + t_min)\r\n if check_possible(xs, vs, t, x_min, x_max):\r\n t_max = t\r\n else:\r\n t_min = t\r\n\r\n t = 0.5 * (t_max + t_min)\r\n print(\"{:.12f}\".format(t))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n = int(input())\nx = list(map(int, input().split()))\nv = list(map(int, input().split()))\n\nleft = -1\nright = max(x) / 2 + 1\nwhile right - left > 1e-6:\n middle = left + (right - left) / 2\n l = sorted(x[i] - middle * v[i] for i in range(len(x)))\n r = sorted(x[i] + middle * v[i] for i in range(len(x)))\n if r[0] <= l[-1]:\n left = middle\n else:\n right = middle\nprint(left)\n \t\t\t \t\t\t \t \t\t \t \t \t\t", "n=int(input())\r\nN=60003\r\npos=[0.0]*N\r\nv=[0.0]*N\r\ncnt=0\r\nfor i in input().split():\r\n cnt+=1\r\n pos[cnt]= float(i)\r\ncnt=0\r\nfor i in input().split():\r\n cnt+=1\r\n v[cnt]= float(i)\r\n\r\nleft=0.0\r\nright=1000000000.0\r\nwhile right>=left+0.0000001:\r\n t=(left+right)/2\r\n Min=pos[1]-t*v[1]\r\n Max=pos[1]+t*v[1]\r\n for i in range(1,n+1):\r\n Min=max(Min,pos[i]-t*v[i])\r\n Max=min(Max,pos[i]+t*v[i])\r\n if Min<Max:\r\n right=t\r\n else :\r\n left=t\r\n\r\nprint(left)\r\n", "n=int(input())\r\ncoordinates=[int(i) for i in input().split()]\r\nspeeds=[int(j) for j in input().split()]\r\nmink=0\r\nmaxk=1000000000\r\n\r\ndef intesect(t):\r\n leftarr=[0 for l in range(n)]\r\n rightarr=[0 for h in range(n)]\r\n for u in range(n):\r\n leftarr[u]=coordinates[u]-t*speeds[u]\r\n for p in range(n):\r\n rightarr[p]=coordinates[p]+t*speeds[p] \r\n leftarr.sort()\r\n rightarr.sort()\r\n if rightarr[0]>=leftarr[n-1]:\r\n return True\r\n else:\r\n return False \r\n\r\nwhile maxk-mink>1e-6:\r\n mid=(maxk+mink)/2\r\n if intesect(mid)==True :\r\n maxk=mid\r\n \r\n \r\n elif intesect(mid)==False:\r\n mink=mid\r\n\r\nprint(mid)", "n = int(input())\nk = list(map(int, input().split()))\ns = list(map(int, input().split()))\n\n\ndef t_s(j, u):\n while (u - j) > 1e-6:\n f = (u - j) / 3\n x2 = t_p(j + f)\n x3 = t_p(u - f)\n if x2 < x3:\n u = j + 2 * f\n else:\n j = j + f\n return t_p((j + u) / 2)\n\n\ndef t_p(p):\n return max(abs(p - k[i]) / s[i] for i in range(n))\n\n\nr = 0\nt = 1e10\nfor p in k:\n r = max(p, r)\n t = min(p, t)\nprint(t_s(t, r))\n \t\t \t\t\t \t \t \t\t\t \t \t", "def judge(t: int) -> bool:\r\n\r\n l = x[0] - t * v[0]\r\n r = x[0] + t * v[0]\r\n\r\n for i in range(1, n):\r\n l = max(l, x[i] - t * v[i])\r\n r = min(r, x[i] + t * v[i])\r\n if(l > r):\r\n return 0\r\n\r\n return 1\r\n\r\nn = eval(input())\r\nx = list(map(int, input().split(' ')))\r\nv = list(map(int, input().split(' ')))\r\n\r\nl = 0\r\nr = 1e9\r\n\r\nwhile(r - l >= 1e-6):\r\n mid = l + (r - l) / 2\r\n if (judge(mid)):\r\n r = mid\r\n else:\r\n l = mid\r\n\r\nprint(\"%.12f\"%(r))", "n=int(input())\nx=[int(x) for x in input().split()]\nv=[int(x) for x in input().split()]\n\ndef fin(h):\n\treturn max(abs(h-x[i])/v[i] for i in range(n))\n\nl,r=1.0,1e9\nwhile r-l>5e-7:\n\tmid=(l+r)/2\n\tif (fin(mid-4e-7)<fin(mid+4e-7)):\n\t\tr=mid\n\telse:\n\t\tl=mid\n\nprint(fin(l))", "# https://codeforces.com/contest/782/problem/B?locale=en\r\nfrom typing import List\r\n\r\nthreshold = 1e-6\r\n\r\nclass Segment:\r\n def __init__(self, start: int, end: int):\r\n self.start = start\r\n self.end = end\r\n\r\ndef __getSegment(x: int, speed: int, time: float) -> Segment:\r\n distance = speed * time\r\n return Segment(x - distance, x + distance)\r\n\r\ndef __getMaxTime(x: List[int], speeds: List[int]) -> float:\r\n minPoint = min(x)\r\n maxPoint = max(x)\r\n minSpeed = min(speeds)\r\n\r\n return (maxPoint - minPoint) / minSpeed\r\n\r\ndef willMeet(segments: List[Segment]) -> bool:\r\n maxLeft = max(segments, key=lambda s: s.start).start\r\n minRight = min(segments, key=lambda s: s.end).end\r\n \r\n return maxLeft <= minRight\r\n\r\ndef solveMeetingPlace(n: int, friendsStr: str, maxSpeedsStr: str) -> float:\r\n friends = list(map(int, friendsStr.split(' ')))\r\n maxSpeeds = list(map(int, maxSpeedsStr.split(' ')))\r\n\r\n timeA, timeB = 0, __getMaxTime(friends, maxSpeeds)\r\n\r\n while (timeB - timeA)/max(1,timeB) > threshold:\r\n newTime = (timeB + timeA) / 2\r\n\r\n segments = [__getSegment(friends[i], maxSpeeds[i], newTime) for i in range(n)]\r\n if willMeet(segments):\r\n timeB = newTime\r\n else:\r\n timeA = newTime\r\n return timeB\r\n\r\ndef main():\r\n n = int(input())\r\n friendsStr = input()\r\n speedsStr = input()\r\n \r\n minTime = solveMeetingPlace(n, friendsStr, speedsStr)\r\n \r\n print(\"%.12f\" % minTime)\r\n\r\nif __name__ == '__main__':\r\n main()", "from turtle import right\n\n\nn = int(input())\n\nx = list(map(int,input().split(' ')))\n\nv = list(map(int,input().split(' ')))\n\ndef rightmost_left_ep(t):\n return max([x[i]-(v[i]*t) for i in range(n)])\n\ndef leftmost_right_ep(t):\n return min([x[i]+(v[i]*t) for i in range(n)])\n\ndef is_feasible(K):\n return rightmost_left_ep(K) <= leftmost_right_ep(K)\n\nL, R = 0.0, 1e9\n\nwhile abs(R-L) > 1e-6:\n mid = (L+R)/2\n\n if is_feasible(mid): \n R = mid\n else:\n L = mid \nprint(mid)", "R = lambda: map(int, input().split())\r\n\r\ndef is_vaid(ps, ss, t):\r\n l, r = 0, max(ps)\r\n for p, s in zip(ps, ss):\r\n l, r = max(l, p - s * t), min(r, p + s * t)\r\n return l < r\r\n\r\nn = int(input())\r\nps, ss = list(R()), list(R())\r\nl, r = 0, max(ps)\r\nwhile r - l > 10**-6:\r\n m = (l + r) / 2\r\n if is_vaid(ps, ss, m):\r\n r = m\r\n else:\r\n l = m\r\nprint(r)", "def check(x, v, t): \r\n leftMax = max([pos-(vel*t) for pos, vel in zip(x, v)])\r\n rightMin = min([pos+(vel*t) for pos, vel in zip(x, v)])\r\n \r\n if leftMax <= rightMin:\r\n return True\r\n \r\n return False\r\n\r\nn = int(input())\r\nx = [int(i) for i in input().split()]\r\nv = [int(i) for i in input().split()]\r\n\r\n# Binary search for optimal time\r\nbeg, end = 0, 1e9\r\nwhile end-beg > 1e-6:\r\n mid = (beg + end) / 2\r\n if check(x, v, mid):\r\n end = mid\r\n else:\r\n beg = mid\r\n\r\nprint(mid)", "def cnt(pos):\r\n ret = 0\r\n \r\n for i in range(n):\r\n ret = max(ret, abs(pos - x[i])/v[i])\r\n \r\n return ret\r\n\r\nn = int(input())\r\nx = list(map(int ,input().split()))\r\nv = list(map(int ,input().split()))\r\n\r\nlo, hi = min(x), max(x)\r\n\r\n\r\nfor _ in range(50):\r\n le = (lo + lo + hi) / 3\r\n ri = (lo + hi + hi) / 3\r\n \r\n if (cnt(le) < cnt(ri)):\r\n hi = ri\r\n else:\r\n lo = le\r\n\r\nprint(\"%.13f\" % cnt(lo))\r\n\r\n", "n=int(input())\r\npos=list(map(int,input().split()))\r\nvel=list(map(int,input().split()))\r\nt,lo,hi=0,0,1000000000\r\nwhile(hi-lo>0.0000004):\r\n t=(lo+hi)/2\r\n px,nx=1000000000,0\r\n for i in range(n):\r\n cpx=pos[i]+t*vel[i]\r\n cnx=pos[i]-t*vel[i]\r\n if(cpx<px):\r\n px=cpx\r\n if(cnx>nx):\r\n nx=cnx\r\n if(px>nx):\r\n hi=t\r\n else:\r\n lo=t\r\nprint(t)", "def leastRightEnd(T):\r\n return min(x[i]+s[i]*T for i in range(len(x)))\r\ndef highestLeftEnd(T):\r\n return max(x[i]-s[i]*T for i in range(len(x)))\r\ndef isPossible(right,left):\r\n return right>=left\r\n\r\n return(max)\r\nn = int(input())\r\nx = [int(i) for i in input().split()]\r\ns = [int(i) for i in input().split()]\r\nL,R = 0,1e9\r\n\r\nwhile abs(R-L)>1e-6:\r\n M = (L+R)/2\r\n if isPossible(leastRightEnd(M),highestLeftEnd(M)):\r\n R=M\r\n else:\r\n L=M\r\nprint(M)\r\n ", "n=int(input())\r\ndistance=[int(x) for x in input().split()]\r\nspeed=[int(x) for x in input().split()]\r\ndef position(t) :\r\n right=max([distance[i]-(speed[i]*t) for i in range(n)])\r\n left=min([distance[i]+(speed[i]*t) for i in range(n)])\r\n return right>left\r\nL,R=0,1e9\r\nwhile abs(R-L)>1e-6 :\r\n ans=(L+R)/2\r\n if position(ans) :\r\n L=ans\r\n else :\r\n R=ans\r\nprint(ans)", "n = int(input())\nc = list(map(int, input().split()))\nv = list(map(int, input().split()))\n\nL = 0.0\nR = 1e9\nwhile R - L > 1e-7:\n M = (R + L) / 2\n left = [c[i] - v[i] * M for i in range(n)]\n right = [c[i] + v[i] * M for i in range(n)]\n if max(left) <= min(right):\n R = M\n else:\n L = M;\nprint(R)\n", "n = int(input())\r\n\r\npositions = [int(i) for i in input().split()]\r\nspeeds = [int(i) for i in input().split()]\r\n\r\nzipped = []\r\nfor i in range(len(positions)):\r\n zipped.append((positions[i], speeds[i]))\r\n\r\n# print(zipped)\r\n\r\nstart, end = 0, 1e9\r\nk = 0\r\nwhile (end-start) > 1e-6:\r\n k = start+ (end-start)/2\r\n\r\n # check if k is feasible or not\r\n feasible = True \r\n left_max = max([(position - k*speed)] for position, speed in zipped)\r\n right_min = min([(position + k*speed)] for position, speed in zipped)\r\n if left_max > right_min:\r\n feasible = False\r\n\r\n if feasible:\r\n end = k \r\n else:\r\n start = k \r\n\r\nprint(k)", "def check(f, speed, t):\r\n inter = (f[0] - speed[0] * t, f[0] + speed[0] * t)\r\n for i in range(1, len(f)):\r\n cur = (f[i] - speed[i] * t, f[i] + speed[i] * t)\r\n if cur[0] > inter[1] or inter[0] > cur[1]:\r\n return False\r\n else:\r\n inter = (max(cur[0], inter[0]), min(cur[1], inter[1]))\r\n return True\r\n\r\n\r\ndef binsearch(fr, sp):\r\n inf = 0\r\n sup = 10 ** 10\r\n while sup - inf > 10 ** (-6):\r\n if check(fr, sp, (sup + inf) / 2):\r\n sup = (sup + inf) / 2\r\n else:\r\n inf = (sup + inf) / 2\r\n return inf if check(fr, sp, inf) else sup\r\n\r\n\r\n\r\nn = int(input())\r\nx = list(map(int, input().split()))\r\nv = list(map(int, input().split()))\r\nprint(binsearch(x, v))", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nx = list(map(int, input().split()))\r\nv = list(map(int, input().split()))\r\nM = 1e9\r\nl, h = 0, M\r\nt = 100\r\nwhile t:\r\n m = (h+l)/2\r\n a, b = 0, M\r\n for i in range(n):\r\n a = max(x[i]-m*v[i], a)\r\n b = min(x[i]+m*v[i], b)\r\n if b < a:\r\n l = m\r\n else:\r\n h = m\r\n t -= 1\r\nprint(l)", "n=int(input())\r\nx=list(map(int,input().split()))\r\nv=list(map(int,input().split()))\r\nl=0\r\nr=10**9+1\r\nwhile r-l>10**(-7):\r\n mid=(r-l)/2+l\r\n tl=[x[i]-v[i]*mid for i in range(n)]\r\n tr=[x[i]+v[i]*mid for i in range(n)]\r\n Ml=tl[0]\r\n for i in range(1,n):\r\n Ml=max(Ml,tl[i])\r\n mr=tr[0]\r\n for i in range(1,n):\r\n mr=min(mr,tr[i])\r\n if mr>=Ml:\r\n r=mid\r\n else:\r\n l=mid\r\nprint(r)", "def read_ints():\r\n return list(map(int, input().split()))\r\n\r\ndef go(t, add=True):\r\n sign = 1 if add else -1\r\n return [x[i] + sign * v[i] * t for i in range(n)]\r\n\r\ndef ok(t):\r\n return min(go(t, add=True)) >= max(go(t, add=False))\r\n\r\nn = int(input())\r\nx = read_ints()\r\nv = read_ints()\r\n\r\nlo, hi = 0, 10**9\r\neps = 1e-6\r\nwhile hi - lo >= eps:\r\n mi = (lo + hi) / 2\r\n if ok(mi):\r\n hi = mi\r\n else:\r\n lo = mi\r\n\r\nprint(lo)", "N = int(input().strip())\r\nX = list(map(int, input().split()))\r\nV = list(map(int, input().split()))\r\nx1, x2 = min(X), max(X)\r\nwhile True:\r\n x_m = (x1 + x2) / 2\r\n t = [abs((X[i] - x_m) / V[i]) for i in range(N)]\r\n i = t.index(max(t))\r\n\r\n if X[i] <= x_m:\r\n x2 = x_m\r\n else:\r\n x1 = x_m\r\n if abs(x1 - x2) < 1e-6:\r\n print(f'{t[i]:0.6f}')\r\n break\r\n", "# [https://codeforces.com/contest/782/submission/25275844 <- https://codeforces.com/blog/entry/50854 <- https://codeforces.com/problemset/problem/782/B <- https://algoprog.ru/material/pc782pB]\r\n\r\nn = int(input())\r\ncoords = map(float, input().split(\" \"))\r\nspeeds = map(float, input().split(\" \"))\r\ndata = sorted(zip(coords, speeds))\r\n\r\nk1 = [data[0]]\r\ns1 = data[0][1]\r\nk2 = [data[-1]]\r\ns2 = data[-1][1]\r\nfor i in range(1,n):\r\n if data[i][1]<s1:\r\n k1.append(data[i])\r\n s1 = data[i][1]\r\n if data[-i][1]<s2:\r\n k2.append(data[-i])\r\n s2 = data[-i][1]\r\ndef time(d1,d2):\r\n return (d2[0]-d1[0])/(d2[1]+d1[1]) if d2[0]>d1[0] else 0\r\nmt = 0\r\nfor d1 in k1:\r\n for d2 in k2:\r\n dt = time(d1,d2)\r\n if dt>mt:\r\n mt = dt\r\n\r\nprint(mt)", "#Task J - Место встречи изменить нельзя\n\ndef curr_T_is_possible(n, T, arr_x, arr_v):\n l_vals = [0 for _ in range(n)]\n r_vals = [0 for _ in range(n)]\n for i in range(n):\n l_vals[i] = arr_x[i]-arr_v[i]*T\n r_vals[i] = arr_x[i]+arr_v[i]*T\n if max(l_vals) <= min(r_vals):\n return True\n else:\n return False\n\ndef bin_find_t(n, arr_x, arr_v):\n l = -1\n r = max(arr_x)/min(arr_v)\n while r-l > 0.000001:\n T = (l+r)/2\n if curr_T_is_possible(n, T, arr_x, arr_v):\n r = T\n else:\n l = T\n return r\n\nn = int(input())\n\ndef input_arr():\n arr = []\n for c in input().split(' '):\n arr.append(int(c))\n return arr\n\narr_x, arr_v = input_arr(), input_arr()\nprint(bin_find_t(n, arr_x, arr_v))\n\n \t \t \t\t \t \t\t \t\t \t\t\t \t", "def iscontained(a,b):\n l = max(a[0],b[0])\n r = min(a[1],b[1])\n return (l < r, (l,r))\n\ndef solve(p,v,n):\n iter = 0\n l = 0.0\n r = 1000000010.0\n tupl = [0] * 60001\n while(iter < 60):\n flag = True\n m = (l + r)/2\n intersect = (p[0] - v[0] * m,p[0] + v[0]* m)\n for i in range(1,n):\n tupl[i] = (p[i] - v[i] * m,p[i] + v[i]*m)\n lap,intersect = iscontained(intersect,tupl[i])\n if not lap:\n flag = False\n break\n if not flag:\n l = m\n else:\n r = m\n iter = iter+1\n # print(l,r)\n print(\"%.9f\" % l)\n\nn = int(input())\npos = list()\nvel = list()\nfor i in map(float,input().split()):\n pos.append(i)\nfor i in map(float,input().split()):\n vel.append(i)\n\nsolve(pos,vel,n)", "n = int(input())\r\nx = list(map(int,input().split()))\r\nv = list(map(int,input().split()))\r\ndef check(t):\r\n overlap_low,overlap_high = 1,1e9\r\n for i in range(n):\r\n lower_bound = x[i] - v[i]*t\r\n upper_bound = x[i] + v[i]*t\r\n if lower_bound > overlap_high or upper_bound < overlap_low:\r\n return False\r\n if lower_bound > overlap_low:\r\n overlap_low = lower_bound\r\n if upper_bound < overlap_high:\r\n overlap_high = upper_bound\r\n return True\r\nL = 0\r\nR = max(x)-min(x)\r\neps = 2e-6\r\nwhile R - L > eps:\r\n M = L + (R - L) / 2\r\n if check(M):\r\n R = M\r\n else:\r\n L = M\r\n #print(M,check(M))\r\nprint(L + (R - L) / 2)", "import sys\r\ndef posh(lt,rt):\r\n t = (lt+rt)/2\r\n if rt - lt <= 0.000001:\r\n print(t)\r\n sys.exit()\r\n mx, mn = 0, 999999999999\r\n for i in range(n):\r\n l = A[i] - B[i]*t\r\n r = A[i] + B[i]*t\r\n mx = max(l,mx)\r\n mn = min(r,mn)\r\n if mx <= mn:\r\n return posh(lt, t)\r\n else:\r\n return posh(t, rt)\r\n\r\nn = int(input())\r\nA = list(map(int, input().split()))\r\nB = list(map(int, input().split()))\r\nposh(0, 500000000)\r\n", "n = int(input())\r\nx = list(map(int, input().split()))\r\nv = list(map(int, input().split()))\r\n\r\nleft,right = min(x), max(x)\r\n\r\ndef count(pos):\r\n ret = 0\r\n for i in range(n):\r\n ret = max(ret, abs(pos-x[i])/v[i])\r\n return ret\r\n\r\nfor _ in range(50):\r\n le, ri = (left + left + right)/3, (left + right + right)/3\r\n if count(le) < count(ri):\r\n right = ri\r\n else:\r\n left = le\r\nprint(\"%.13f\" % count(left))\r\n", "PRECISION = 1e-6\n\ndef bin_search(n, x, v):\n l = 0\n r = max(x) + 1\n\n while r - l > PRECISION:\n i = (r + l) / 2\n\n left = max(x[j] - v[j] * i for j in range(n))\n right = min(x[j] + v[j] * i for j in range(n))\n\n if left <= right:\n r = i\n else:\n l = i\n return l\n\n\nn = int(input())\nx = list(map(int, input().split()))\nv = list(map(int, input().split()))\n\nprint(bin_search(n, x, v))\n \t\t \t\t\t \t\t\t\t\t \t \t \t \t \t", "\r\n# QUESTION : https://codeforces.com/problemset/problem/782/B\r\n\r\n# 3\r\n# 7 1 3\r\n# 1 2 1\r\n\r\n# 4\r\n# 5 10 3 2\r\n# 2 3 2 4\r\n\r\nn = int(input())\r\ncoord = list(map(int, input().split()))\r\nspeed = list(map(int, input().split()))\r\n\r\nl = 0.0\r\nr = 1e9\r\n\r\n\r\ndef rightmost_leftpt(time):\r\n return max([coord[i]-time*speed[i] for i in range(n)])\r\n\r\n\r\ndef leftmost_rightpt(time):\r\n return min([coord[i]+time*speed[i] for i in range(n)])\r\n\r\n\r\ndef feasible_time(time):\r\n return leftmost_rightpt(time) >= rightmost_leftpt(time)\r\n\r\n\r\nwhile abs(r-l) > 1e-6:\r\n mid = (l+r)/2\r\n if feasible_time(mid):\r\n r = mid\r\n else:\r\n l = mid\r\n\r\nprint(mid)\r\n", "n = int(input())\n\ncoords = [int(i) for i in input().strip().split()]\nspeeds = [int(i) for i in input().strip().split()]\n\nleft = 0\n\nright_original = 0\n\nfor index, i in enumerate(speeds):\n right_original = max(right_original, abs(coords[index] - coords[0])/i)\n\n#print(left, right_original)\n\ndef possible(t):\n intervals = [(i - j*t, i + j*t ) for (i,j) in zip(coords, speeds)]\n #print(t, intervals)\n\n start, end = intervals.pop()\n while intervals:\n start_temp, end_temp = intervals.pop()\n start = max(start, start_temp)\n end = min(end, end_temp)\n \n #print(start, end)\n \n if((start > end ) and (abs(start - end) > 10**-7 )):\n return 0\n return 1\n\ndef bs(left, right_original):\n left = left\n right = right_original\n \n while( abs(right - left) > 10**-7):\n mid = (left + right)/2\n #print(left, mid, right)\n if(possible(mid)):\n right = mid - 10**-7\n else:\n left = mid + 10**-7\n\n return left\n\nprint(bs(left, right_original))", "n = int(input())\nxes = list(map(int, input().split()))\nvs = list(map(int, input().split()))\n\nt_l, t_r = 0, 10 ** 9\n\nwhile t_r - t_l > 1e-6: # пока между временами разница больше погрешности\n t_m = (t_r + t_l) / 2\n intersection = (-1e18 - 1, 1e18 + 1)\n inter_flag = True\n for i in range(n):\n a = max(xes[i] - vs[i] * t_m, intersection[0])\n b = min(xes[i] + vs[i] * t_m, intersection[1])\n intersection = (a, b)\n if b < a:\n inter_flag = False\n if inter_flag:\n t_r = t_m\n else:\n t_l = t_m\n\nprint(t_r)\n\n\t \t \t \t\t \t \t\t\t\t \t\t\t \t\t", "from typing import List\ndef minimum_time(n: int, x: List[int], v: List[int]) -> float:\n def solve(t,x,v):\n l=[x[i]-v[i]*t for i in range(len(x))]\n r=[x[i]+v[i]*t for i in range(len(x))]\n return 1 if max(l)<=min(r) else 0\n\n l=0\n h=10**9\n cnt=0\n while l<h and cnt<100:\n mid=l+(h-l)/2\n cnt+=1\n if solve(mid,x,v):\n h=mid\n else:\n l=mid\n return l\n\nn=int(input())\nx=list(map(int,input().split()))\nv=list(map(int,input().split()))\n\nprint(minimum_time(n,x,v))\n", "n=int(input())\r\ncord=[int(x) for x in input().split()]\r\nvelo=[int(x) for x in input().split()]\r\nlow,high=1/(1e9),1e9\r\nans=-1\r\ndec=0.0000001\r\nwhile low<=high:\r\n mid=(low+high)/2\r\n l,r=1,int(1e9)\r\n flag=True\r\n for i in range(n):\r\n temp1=velo[i]*mid\r\n temp2=cord[i]+temp1\r\n temp1=cord[i]-temp1\r\n if (r >=temp1 and r<=temp2) or (temp2>=l and temp2<=r):\r\n l,r=max(l,temp1),min(r,temp2)\r\n else :\r\n flag=False\r\n break \r\n if flag:\r\n ans=mid\r\n high=mid-dec\r\n else :\r\n low= mid+dec\r\nprint(ans) ", "n = int(input())\r\nx = [int(i) for i in input().split()]\r\nv = [int(i) for i in input().split()]\r\n\r\ndef search(n,x,v,t):\r\n lmax = max([x[i]-t*v[i] for i in range(n)])\r\n rmin = min([x[i]+t*v[i] for i in range(n)])\r\n if lmax<=rmin:\r\n return True\r\n return False\r\n\r\ndef binary(n,x,v):\r\n l,r = 0,10**9\r\n while abs(r-l)>10**-6:\r\n mid = (l+r)/2\r\n if search(n,x,v,mid):\r\n r = mid\r\n else:\r\n l = mid\r\n return l\r\n\r\nprint(binary(n,x,v))\r\n\r\n\r\n\r\n\r\n", "import math as mt \nimport sys,string\n\ninput=sys.stdin.readline\nimport random\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())\nn=I()\nl=L()\nm=L()\n\nlow=0\nhigh=10**9\nL=1\nR=10**9\nwhile(high-low>=0.0000001):\n t=(low+high)/2\n L=0\n R=10**9\n for i in range(n):\n L=max(L,l[i]-t*m[i])\n R=min(R,l[i]+t*m[i])\n if(L>R):\n low=t\n else:\n high=t\nprint(t)", "def f(t):\r\n mx = 0\r\n mn = 2**31\r\n for i in range(n):\r\n upper = x[i] - t * v[i]\r\n lower = x[i] + t * v[i]\r\n mx = max(mx, upper)\r\n mn = min(mn, lower)\r\n return (mn - mx)\r\n\r\n\r\nn = int(input())\r\nx = list(map(int, input().split()))\r\nv = list(map(int, input().split()))\r\nl = 0\r\nr = 10**9\r\n\r\nkey = 0\r\n\r\neps = 10**-7\r\nwhile r - l > eps:\r\n c = (l + r) / 2\r\n if (f(c) > key):\r\n r = c\r\n else:\r\n l = c\r\nprint(l)\r\n\r\n", "def min_time(xs, vs):\n def good(time):\n mn, mx = float(\"-inf\"), float(\"inf\")\n for x, v in zip(xs, vs):\n mn = max(mn, x - time * v)\n mx = min(mx, x + time * v)\n return mn <= mx\n\n l, r = 0, 10 ** 18\n for _ in range(100):\n m = l + (r - l) / 2\n if good(m):\n r = m\n else:\n l = m\n return r\n\n\nn = int(input())\nxs = [int(i) for i in input().split()]\nvs = [int(i) for i in input().split()]\n\nprint(min_time(xs, vs))\n", "n = int(input())\r\nx = [int(x) for x in input().split()]\r\nv=[int(x) for x in input().split()]\r\n\r\ndef rightmost_left_ep(t):\r\n return max([x[i]-(v[i]*t) for i in range(n)])\r\n\r\ndef leftmost_right_ep(t):\r\n return min([x[i]+(v[i]*t) for i in range(n)])\r\n\r\ndef is_feasible(K):\r\n return rightmost_left_ep(K) <= leftmost_right_ep(K)\r\n\r\nL,R = 0.0, 1e9\r\n\r\nwhile abs(R-L)>1e-6:\r\n mid=(L+R)/2\r\n if(is_feasible(mid)): \r\n R=mid\r\n else: \r\n L=mid\r\n \r\nprint(mid)", "# import sys\r\n\r\n# sys.stdin = open('in.txt', 'r')\r\n# sys.stdout = open('out.txt', 'w')\r\n\r\n\r\nn = int(input().strip())\r\nx = [int(x) for x in input().split()]\r\nv = [int(x) for x in input().split()]\r\n\r\n\r\ndef getLeftMostPos(t):\r\n return min([x[i] + (t*v[i]) for i in range(n)])\r\n\r\n\r\ndef getRightMostPos(t):\r\n return max([x[i]-(t*v[i]) for i in range(n)])\r\n\r\n\r\ndef checkFeasible(t):\r\n return getRightMostPos(t) <= getLeftMostPos(t)\r\n\r\n\r\nL = 0.0\r\nR = 1e9\r\n\r\nwhile abs(R-L) > 1e-6:\r\n mid = (R+L)/2\r\n\r\n if (checkFeasible(mid)):\r\n R = mid\r\n\r\n else:\r\n L = mid\r\n\r\nprint(mid)\r\n", "n = int(input())\r\nx = list(map(int, input().split()))\r\nv = list(map(int, input().split()))\r\nl, r = 0, 10 ** 10\r\nt = (l + r) / 2\r\nwhile r - l >= 10 ** -6:\r\n t = (l + r) / 2\r\n max_l = -float('inf')\r\n min_r = float('inf')\r\n for i in range(n):\r\n left = x[i] - v[i] * t\r\n right = x[i] + v[i] * t\r\n max_l = max(max_l, left)\r\n min_r = min(min_r, right)\r\n if max_l <= min_r:\r\n r = t\r\n else:\r\n l = t\r\nprint(t)\r\n", "n=int(input())\na,b=[[int(x)for x in input().split()]for y in range(2)]\ndef ok(t):\n l,r=0,1<<30\n for x in range(n):\n l=max((a[x]-b[x]*t),l)\n r=min((a[x]+b[x]*t),r)\n return l<=r\nlo,hi=0,1<<30\nfor i in range(65):\n m=(lo+hi)/2\n if ok(m):hi=m\n else:lo=m\nprint('%.10f'%hi)\n", "n=int(input())\r\nx=list(map(int,input().split()))\r\nv=list(map(int,input().split()))\r\nl=0\r\nr=max(x)*max(v)\r\nepsilon=10**(-6)\r\nwhile l+epsilon<r:\r\n t=(l+r)/2\r\n li=0\r\n ri=10**9\r\n for i in range(n):\r\n li=max(x[i]-t*v[i],li)\r\n ri=min(ri,x[i]+t*v[i])\r\n if li<=ri:\r\n r=t\r\n else:\r\n l=t\r\nprint(r)\r\n \r\n \r\n", "n = int(input())\nnums = list(map(int, input().split()))\nspeed = list(map(int, input().split()))\n\nmsp = min(speed)\nhigh = max(nums)//msp+1\n# high = 1000\nlow = 0\n\ndef ismeet(t):\n mnrt = float('inf')\n mxlt = 0\n for v,s in zip(nums, speed):\n mnrt = min(mnrt,v+s*t)\n mxlt = max(mxlt,v-s*t)\n if mnrt < mxlt:\n return False\n return True\n\nwhile low<high:\n mid = (low+high)/2\n mid = round(mid, 13)\n # print(mid)\n if ismeet(mid):\n high = mid-0.0000001\n else:\n low = mid+0.0000001\n\n# print(round(1.99999999,7))\nprint(round(mid,12))", "# بسم الله الرحمن الرحيم\r\ndef check(mid,ln,pos,time):\r\n mx = 0\r\n global ans\r\n p = pos[0]\r\n for i in range(ln):\r\n n = abs(mid-pos[i])/time[i]\r\n if n>mx:\r\n mx = n\r\n p = pos[i]\r\n ans.append([mx,mid])\r\n return p\r\nln = int(input())\r\npos = list(map(int,input().split()))\r\ntime = list(map(int,input().split()))\r\nl,r = min(pos),max(pos)\r\nans = []\r\nlastl,lastr = -1,-1\r\nwhile l<=r:\r\n mid = (l+r)/2\r\n z = check(mid,ln,pos,time)\r\n if z>=mid:\r\n l = mid\r\n else:\r\n r = mid\r\n if lastl==l and lastr==r:\r\n break\r\n lastl,lastr = l,r\r\nprint(round(min(ans)[0],6))", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef judge(t):\r\n L, R = -10**18, 10**18\r\n \r\n for xi, vi in zip(x, v):\r\n L = max(L, xi-t*vi)\r\n R = min(R, xi+t*vi)\r\n \r\n return L<=R\r\n \r\ndef binary_search():\r\n l, r = 0, 10**10\r\n \r\n while r-l>=1e-7:\r\n mid = (l+r)/2\r\n \r\n if judge(mid):\r\n r = mid\r\n else:\r\n l = mid\r\n \r\n return l\r\n\r\nn = int(input())\r\nx = list(map(int, input().split()))\r\nv = list(map(int, input().split()))\r\n\r\nprint(binary_search())", "def f(t):\r\n left_gr = []\r\n right_gr = []\r\n for i in range(n):\r\n left_gr.append(a[i] - t * b[i])\r\n right_gr.append(a[i] + t * b[i])\r\n if max(left_gr) <= min(right_gr):\r\n return True\r\n else:\r\n return False\r\n\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nl, r = 0, max(a)\r\n\r\nfor i in range(100):\r\n m = (l + r) / 2\r\n if f(m):\r\n r = m\r\n else:\r\n l = m\r\nprint(\"%.9f\" % l)", "def solve(t,x,v):\n l=[x[i]-v[i]*t for i in range(len(x))]\n r=[x[i]+v[i]*t for i in range(len(x))]\n return 1 if max(l)<=min(r) else 0\n\nn=int(input())\nx=list(map(int,input().split()))\nv=list(map(int,input().split()))\nl=0\nh=10**9\ncnt=0\nwhile l<h and cnt<100:\n mid=l+(h-l)/2\n cnt+=1\n if solve(mid,x,v):\n h=mid\n else:\n l=mid\nprint(l)\n", "\r\ndef main():\r\n n = int(input())\r\n x = list(map(int, input().split()))\r\n v = list(map(int, input().split()))\r\n\r\n def find(low, high):\r\n if abs(high - low) < 0.000001:\r\n time = 0\r\n for friend in range(n):\r\n time = max(time, abs(x[friend] - low) / v[friend])\r\n return time\r\n\r\n mid = (low + high) / 2\r\n left = (low + mid) / 2\r\n right = (mid + high) / 2\r\n left_time = 0\r\n right_time = 0\r\n\r\n for friend in range(n):\r\n left_time = max(left_time, abs(x[friend] - left) / v[friend])\r\n right_time = max(right_time, abs(x[friend] - right) / v[friend])\r\n\r\n if left_time > right_time:\r\n return find(left, high)\r\n else:\r\n return find(low, right)\r\n\r\n print(find(0, 1 << 30))\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n=int(input())\r\nl1=list(map(int,input().split()))\r\nl2=list(map(int,input().split()))\r\n\r\nl=0\r\nr=1e9\r\nfor _ in range(80):\r\n m=(l+r)/2\r\n a,b=float(\"-inf\"),float(\"inf\")\r\n for i,j in zip(l1,l2):\r\n a=max(a,i-j*m)\r\n b=min(b,i+j*m)\r\n if a<=b:\r\n r=m\r\n else:\r\n l=m\r\nl=round(l,6)\r\nprint(l)\r\n \r\n \r\n \r\n", "n=int(input())\r\nx=list(map(float,input().split()))\r\nv=list(map(float,input().split()))\r\ntl,tr,e=0,1<<30,0.000001\r\nt,s=0,0\r\nwhile tr-tl>e:\r\n t=(tr+tl)/2\r\n mL, mR = 0, 1<<30\r\n for i in range(n):\r\n s=t*v[i]\r\n L,R=x[i]-s,x[i]+s,\r\n mL, mR = max(mL,L), min(mR,R)\r\n if mL<=mR:\r\n tr=t\r\n else:\r\n tl=t\r\nprint('%.10f'%t) \r\n", "n = int(input())\r\nx = list(map(int, input().split()))\r\nv = list(map(int, input().split()))\r\n\r\ndef check(t):\r\n l = 0\r\n r = 1000000000\r\n for i in range(n):\r\n r = min(r, x[i] + t * v[i])\r\n l = max(l, x[i] - t * v[i])\r\n return r >= l\r\n\r\ndef binarysearch(s, e):\r\n if s > e:\r\n return s\r\n mid = (s + e) / 2\r\n if check(mid):\r\n return binarysearch(s, mid - 0.000001)\r\n return binarysearch(mid + 0.000001, e)\r\nprint(\"%.6f\"%(binarysearch(0.0, 1000000000.0)))", "num_friends = int(input())\r\nfriend_coords = list(map(int, input().split()))\r\nfriend_veloci = list(map(int, input().split()))\r\n\r\n\r\ndef all_friends_converge(seconds: int) -> bool:\r\n \"\"\"\r\n Checks whether all friends can converge on one point in the specified time interval.\r\n\r\n Args:\r\n seconds (int): Amount of seconds given for friends to converge.\r\n\r\n Returns:\r\n bool: If the friends can converge to a single point.\r\n \"\"\"\r\n\r\n overlap_lower, overlap_upper = 1, 10 ** 9\r\n for i in range(num_friends):\r\n lower_bound = friend_coords[i] - (friend_veloci[i] * seconds)\r\n upper_bound = friend_coords[i] + (friend_veloci[i] * seconds)\r\n if lower_bound > overlap_upper or upper_bound < overlap_lower:\r\n return False\r\n if lower_bound > overlap_lower:\r\n overlap_lower = lower_bound\r\n if upper_bound < overlap_upper:\r\n overlap_upper = upper_bound\r\n return True\r\n\r\n\r\nleft, right = 0, 10 ** 9\r\ndiff = 10 ** (-6)\r\n\r\nwhile left + diff < right:\r\n mid = (left + right) / 2\r\n last_comparison = all_friends_converge(mid)\r\n if last_comparison:\r\n right = mid\r\n else:\r\n left = mid + diff\r\n\r\n# We make our output slightly more accurate\r\nprint(((left + mid) / 2) if last_comparison else ((mid + right) / 2))\r\n", "def rightmost_left(t):\r\n return max([(x[i]-(v[i]*t)) for i in range(n)])\r\ndef leftmost_right(t):\r\n return min([(x[i]+(v[i]*t)) for i in range(n)])\r\ndef interset():\r\n l=0\r\n r=1e9\r\n while abs(r-l)>1e-6:\r\n mid=(r+l)/2\r\n if rightmost_left(mid)<=leftmost_right(mid):\r\n r=mid\r\n else:\r\n l=mid\r\n return mid\r\nn=int(input())\r\nx=[int(i) for i in input().split()]\r\nv=[int(i) for i in input().split()]\r\nprint(interset())", "def coun(aa):\r\n c=0\r\n for i in range(n):\r\n c = max(c , abs(cor[i]-aa)/spe[i]) \r\n return c \r\n \r\nn = int(input())\r\ncor = list(map(int,input().split()))\r\nspe = list(map(int,input().split()))\r\nl=1\r\nr=1000000000\r\nwhile abs(r-l)>5e-7:\r\n mid = (l+r)/2\r\n if coun(mid - 4e-6)<coun(mid + 4e-6):\r\n r=mid\r\n else:\r\n l=mid \r\nprint(coun(r)) \r\n\r\n", "n = int(input())\n\ncoords = list(map(int, input().split()))\n\nspeeds = list(map(int, input().split()))\n\nl = -1\nr = 20 ** 9\n\nwhile r > l + 0.000001:\n m = (r + l) / 2\n right = []\n left = []\n for i in range(n):\n right.append(coords[i] + speeds[i]*m)\n left.append(coords[i] - speeds[i] * m)\n min_right = min(right)\n min_left = max(left)\n\n if min_right >= min_left:\n r = m\n else:\n l = m\nprint(round(r, 6))\n", "n=int(input())\r\nx=list(map(int,input().split()))\r\nv=list(map(int,input().split()))\r\n\r\ndef rightmost_left_endpt(t):\r\n l=[]\r\n for i in range(n):\r\n l.append(x[i]-(v[i]*t))\r\n \r\n return max(l)\r\n \r\ndef leftmost_right_endpt(t):\r\n j=[]\r\n for i in range(n):\r\n j.append(x[i]+(v[i]*t))\r\n \r\n return min(j)\r\n \r\ndef feasible(t):\r\n return (rightmost_left_endpt(t)<=leftmost_right_endpt(t))\r\n \r\nl,r=0.0,1e9\r\n\r\nwhile abs(r-l)>1e-6:\r\n mid=(l+r)/2\r\n\r\n if feasible(mid):\r\n r=mid \r\n \r\n else:\r\n l=mid\r\n \r\nprint(mid)", "#the meeting place cannot be changed\r\nn=int(input())\r\nx=[int(x) for x in input().split()]\r\ny=[int(x) for x in input().split()]\r\ndef feasible(t):\r\n bottom_most=min([x[i]+(y[i]*t) for i in range(n)])\r\n top_most=max([x[i]-(y[i]*t) for i in range(n)])\r\n if bottom_most>top_most:\r\n return True\r\n else:\r\n return False\r\n\r\nL,R=0.0,1e9\r\nwhile abs(L-R)>1e-6:\r\n t=(L+R)/2\r\n if feasible(t)==True:\r\n R=t\r\n else:\r\n L=t\r\nprint(t)\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\ndef find(num):\n ma,mi = X[0]+(V[0]*num),X[0]-(V[0]*num)\n\n for i in range(1,N):\n a,b = X[i]+(V[i]*num),X[i]-(V[i]*num)\n mi = max(mi,b)\n ma = min(ma,a)\n\n if mi<=ma:\n return True\n return False\n\n\nN = int(input())\nX = list(map(int,input().split()))\nV = list(map(int,input().split()))\n\nl,r = 0,10**9\nwhile l+(1*(10**-6))<r:\n mid = (l+r)/2\n # print(mid,find(mid),l,r)\n if find(mid):\n r = mid\n else:\n l = mid+(1*(10**-6))\nprint(l)", "n=int(input())\r\nx=[int(x) for x in input().split()]\r\nv=[int(x) for x in input().split()]\r\n\r\ndef fin(h):\r\n\treturn max(abs(h-x[i])/v[i] for i in range(n))\r\n\r\nl,r=1.0,1e9\r\nwhile r-l>5e-7:\r\n\tmid=(l+r)/2\r\n\tif (fin(mid-4e-7)<fin(mid+4e-7)):\r\n\t\tr=mid\r\n\telse:\r\n\t\tl=mid\r\n\r\nprint(fin(l))", "n = int(input())\r\nx = list(map(int,input().split()))\r\nv = list(map(int,input().split()))\r\ndef ok(t) :\r\n\tl, r = 0, 1<<30\r\n\tfor i in range(n):\r\n\t\tl = max(x[i]-t*v[i], l)\r\n\t\tr = min(x[i]+t*v[i], r)\r\n\treturn (l <= r)\r\n\r\nlo , hi = 0, 1<<30\r\nfor i in range(65):\r\n\tmid = (lo + hi) / 2\r\n\tif ok(mid) : hi = mid\r\n\telse: lo = mid\r\nprint('%.10f'%hi)", "import sys\r\nimport os\r\ntry:\r\n sys.stdin = open('./input.txt', 'r')\r\n sys.stdout = open('./output.txt', 'w')\r\nexcept:\r\n pass\r\n\r\ndef rightmost_left_moving(mid):\r\n return max([initial_positions[i] - (maximum_speeds[i]*mid) for i in range(no_of_friends)])\r\n\r\ndef leftmost_right_moving(mid):\r\n return min([initial_positions[i] + (maximum_speeds[i]*mid) for i in range(no_of_friends)])\r\n\r\ndef is_movable(mid):\r\n return rightmost_left_moving(mid) <= leftmost_right_moving(mid) \r\n\r\n#Read all the given inputs\r\nno_of_friends = int(input())\r\ninitial_positions = list(map(int,input().split()))\r\nmaximum_speeds = list(map(int,input().split()))\r\n\r\n#Assigning Values for left and right extreme ends to perform binary search\r\nLeft_most , Right_most = 0,1e9\r\n\r\n#Counter conditon to find appropriate meeting spot with given constraint difference\r\nwhile abs(Left_most-Right_most) > 1e-6:\r\n\r\n mid = (Left_most+Right_most) / 2 \r\n\r\n if is_movable(mid):\r\n Right_most = mid \r\n else:\r\n Left_most = mid\r\n\r\nprint(mid)\r\n", "# Description of the problem can be found at http://codeforces.com/problemset/problem/780/B\r\n\r\nn = int(input())\r\nl_p = list(map(int, input().split()))\r\nl_s = list(map(int, input().split()))\r\n\r\ndef ternary_search(l, h):\r\n # while we're greater than maximum error\r\n while (h - l) > 1e-6:\r\n d = (h - l) / 3\r\n \r\n t2 = get_time_to_pos(l + d)\r\n t3 = get_time_to_pos(h - d)\r\n \r\n if t2 < t3:\r\n h = l + 2 * d\r\n else:\r\n l = l + d\r\n \r\n return get_time_to_pos((l + h) / 2)\r\n\r\n\r\ndef get_time_to_pos(p):\r\n return max(abs(p - l_p[i]) / l_s[i] for i in range(n))\r\n\r\nh_v = 0\r\nl_v = 1e10\r\nfor p in l_p:\r\n h_v = max(p, h_v)\r\n l_v = min(p, l_v)\r\nprint(ternary_search(l_v, h_v))", "#!/usr/bin/env python3\nfrom sys import stdin,stdout\nfrom decimal import *\n\n\ndef ri():\n return map(int, input().split())\n\nn = int(input())\nx = list(ri())\nv = list(ri())\n\ndef ok(t):\n maxl = -10\n minr = 10**30\n for i in range(n):\n maxl = max(maxl, x[i]-v[i]*t)\n minr = min(minr, x[i]+v[i]*t)\n return maxl <= minr\n\n\nmint = 0\nmaxt = 10**10\n\nfor i in range(100):\n t = (mint+maxt)/2\n if ok(t):\n maxt = t\n else:\n mint = t\n if maxt-mint < 10**(-7):\n break\n\nprint(maxt)\n", "n = int(input())\r\nx = list(map(int, input().split()))\r\nv = list(map(int, input().split()))\r\n\r\n\r\ndef intersection_of_line_segments(a, b):\r\n l1 = a[0]\r\n r1 = a[1]\r\n l2 = b[0]\r\n r2 = b[1]\r\n l3 = max(l1, l2)\r\n r3 = min(r1, r2)\r\n return [l3, r3]\r\n\r\n\r\ndef f(t, x, v, n):\r\n d = intersection_of_line_segments([x[0] - t * v[0], x[0] + t * v[0]], [x[1] - t * v[1], x[1] + t * v[1]])\r\n for i in range(2, n):\r\n if d[0] <= d[1]:\r\n d = intersection_of_line_segments(d, [x[i] - t * v[i], x[i] + t * v[i]])\r\n else:\r\n return False\r\n return d[0] <= d[1]\r\n\r\n\r\n\r\nl = 0\r\nr = 1e9\r\nwhile r - l > 1e-6:\r\n t = (r + l) / 2\r\n if f(t, x, v, n):\r\n r = t\r\n else:\r\n l = t\r\nprint(r)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl1=list(map(int,input().split()))\r\n\r\ndef fin(a) :\r\n k=0\r\n for i in range(n) :\r\n k=max(abs(l[i]-a)/l1[i],k)\r\n return k\r\nleft=1\r\nright=1e9\r\n\r\nwhile (abs(left-right)>5e-7) :\r\n \r\n mid=(left+right)/2\r\n if (fin(mid-4e-6)<fin(mid+4e-6)):\r\n\t right=mid\r\n else:\r\n\t left=mid\r\n \r\n \r\nprint(fin(left))\r\n", "n = int(input())\r\nx = list(map(int, input().split()))\r\nv = list(map(int, input().split()))\r\n\r\ndef lowermost_upper(k):\r\n lm = [x[i] + v[i]*k for i in range(n)]\r\n return min(lm)\r\n\r\ndef uppermost_lower(k):\r\n rm = [x[i] - k * v[i] for i in range(n)]\r\n return max(rm)\r\n\r\ndef checker(k):\r\n return lowermost_upper(k) > uppermost_lower(k)\r\n\r\nl, h = 0, 10**9\r\n\r\nwhile abs(h-l)>(10**-6):\r\n mid = (l+h)/2\r\n if checker(mid):\r\n h = mid\r\n else:\r\n l = mid\r\nprint(h)\r\n\r\n", "def good(a, t):\n x,y = -1e9,1e9\n for i in range(len(a)):\n x = max(x, a[i][0] - a[i][1] * t)\n y = min(y, a[i][0] + a[i][1] * t)\n if (x > y):\n return False\n return True\n\ndef calcTime(a):\n l,r,ans = 1e-7,1e9,0\n while l+1e-7 <= r:\n m = (l+r)/2\n if good(a, m):\n r = m-1e-7\n ans = m\n else:\n l = m+1e-7\n return ans\n \nn = int(input())\nx = list(map(int,input().split()))\nv = list(map(int,input().split()))\na = [(x[i], v[i]) for i in range(n)]\nprint(calcTime(a))\n\n\"\"\"\n\n4\n5 10 3 2\n2 3 2 4\n\n\n\"\"\"", "n = int(input())\r\nx = [int(x) for x in input().split()]\r\nv = [int(x) for x in input().split()]\r\nl = 0\r\nr = 1e9\r\ndef check(t):\r\n\tmn = 1e10\r\n\tmx = -1e10\r\n\tfor i in range(n):\r\n\t\tmn = min(mn,x[i]+v[i]*t)\r\n\t\tmx = max(mx,x[i]-v[i]*t)\r\n\treturn mn>=mx\r\n \r\nfor i in range(64):\r\n\tmid = (l+r)/2\r\n\tif (check(mid)): r = mid\r\n\telse: l = mid\r\nprint((l+r)/2)", "# /**\r\n# * author: brownfox2k6\r\n# * created: 28/09/2023 12:28:23 Hanoi, Vietnam\r\n# **/\r\n\r\nn = int(input())\r\nx = [*map(int, input().split())]\r\nv = [*map(int, input().split())]\r\n\r\nlow, high = 0, 2e9\r\n\r\nwhile high - low >= 1e-6:\r\n mid = (low + high) / 2\r\n lb = 0\r\n ub = 2e9\r\n for pos, vel in zip(x, v):\r\n lb = max(lb, pos - vel*mid)\r\n ub = min(ub, pos + vel*mid)\r\n if lb < ub or abs(lb - ub) < 1e-6:\r\n high = mid\r\n else:\r\n low = mid\r\n\r\nprint(high)", "n = int(input())\nx = [int(x) for x in input().split()]\nv = [int(x) for x in input().split()]\nl = 0\nr = 1e9\ndef check(t):\n\tmn = 1e10\n\tmx = -1e10\n\tfor i in range(n):\n\t\tmn = min(mn,x[i]+v[i]*t)\n\t\tmx = max(mx,x[i]-v[i]*t)\n\treturn mn>=mx\n\nfor i in range(64):\n\tmid = (l+r)/2\n\tif (check(mid)): r = mid\n\telse: l = mid\nprint((l+r)/2)\n", "import decimal\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\ni = 0\r\nj = 10**10\r\n\r\nfor _ in range(200):\r\n mid = (i+j)/2\r\n l = -10**10\r\n r = 10**10\r\n for ii in range(n):\r\n l = max(l, a[ii]-b[ii]*mid)\r\n r = min(r, a[ii]+b[ii]*mid)\r\n if l < r:\r\n j = mid\r\n else:\r\n i = mid\r\nprint(i)\r\n", "def meeting_happened(t, x, v):\n leftmost = max([a - b*t for a, b in zip(x, v)])\n rightmost = min([a + b*t for a, b in zip(x, v)])\n return leftmost <= rightmost\n\n\nn = int(input())\nx = list(map(int, input().split()))\nv = list(map(int, input().split()))\nleft = 0\nright = 1e10\nfor _ in range(100):\n middle = (left + right) / 2\n if meeting_happened(middle, x, v):\n right = middle\n else:\n left = middle\nprint(right)\n", "n = int(input())\nx = list(map(int, input().split()))\nv = list(map(int, input().split()))\nn_steps = 100\ninf = 10 ** 10\na, b = 0, inf\nfor _ in range(n_steps):\n m = (a+b) / 2\n possible = True\n l = - inf\n for i in range(n):\n if l < x[i] - m * v[i]:\n l = x[i] - m * v[i]\n u = inf\n for i in range(n):\n if x[i] + m * v[i] < u:\n u = x[i] + m * v[i]\n if l <= u:\n b = m\n else:\n a = m\nprint(b)\n", "n = int(input())\r\nnums = [int(x) for x in input().split()]\r\nspeeds = [int(x) for x in input().split()]\r\nlo = 0\r\nc = max(nums)\r\nans,hi = c,c\r\ndef check(x):\r\n point = -10**18\r\n for i in range(n):\r\n point = max(point,nums[i]-x*speeds[i])\r\n for i in range(n):\r\n if nums[i]> point and nums[i]-x*speeds[i]>point:\r\n return False\r\n if nums[i] < point and nums[i]+x*speeds[i]<point:\r\n return False\r\n return True\r\nfor i in range(100):\r\n mid = (lo+hi)/2\r\n if check(mid):\r\n ans = mid\r\n hi = mid-1\r\n else:\r\n lo = mid+1\r\nprint(ans)", "#!/usr/bin/env python3\r\n\r\nimport math\r\nimport sys\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\ndef test_case():\r\n n = int(input())\r\n x = list(map(int, input().split()))\r\n v = list(map(int, input().split()))\r\n\r\n def func(t):\r\n l = -float(\"inf\")\r\n r = float(\"inf\")\r\n for i in range(n):\r\n l = max(l, x[i]-t*v[i])\r\n r = min(r, x[i]+t*v[i])\r\n return l <= r\r\n\r\n def binary_search(func, lo, hi, abs_prec=1e-6):\r\n \"\"\" Locate the first value x s.t. func(x) = True within [lo, hi] \"\"\"\r\n while abs(hi - lo) > abs_prec:\r\n mi = lo + (hi - lo) / 2\r\n if func(mi):\r\n hi = mi\r\n else:\r\n lo = mi\r\n\r\n return (lo + hi) / 2\r\n\r\n print(binary_search(func, 0, 10**9+10))\r\n\r\ndef main():\r\n t = 1\r\n# t = int(input())\r\n for _ in range(t):\r\n test_case()\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "def left(t):\r\n return max([p[i] - t*v[i] for i in range(n)])\r\n\r\ndef right(t):\r\n return min([p[i] + t*v[i] for i in range(n)])\r\n\r\n\r\n\r\ndef is_fessible(t):\r\n return left(t) <= right(t)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nn = int(input())\r\n\r\np = [int(i) for i in input().strip().split()]\r\n\r\nv = [int(i) for i in input().strip().split()]\r\n\r\n\r\n\r\nstart, end = 0.0 , 1e9\r\nmid = 0.0\r\nwhile end - start> 1e-6:\r\n mid = (start + end)/2\r\n if is_fessible(mid):\r\n end = mid\r\n else:\r\n start = mid\r\nprint(mid)", "n = int(input())\r\nxn = list(map(int,input().split()))\r\nvn = list(map(int,input().split()))\r\nfor i in range(n):\r\n xn[i] = xn[i]\r\n vn[i] = vn[i]\r\nl = 0\r\nr = 10**9\r\neps = 1e-12\r\nfor it in range(200):\r\n m = (l+r)/2\r\n f = 0\r\n a = 0\r\n b = 10**9 \r\n for i in range(n):\r\n a,b = max(a,xn[i]-vn[i]*m), min(b,xn[i]+vn[i]*m)\r\n if b+eps<a: f=1\r\n \r\n if f==1:\r\n l = m\r\n else:\r\n r = m\r\nprint(r)", "def find_min_time(n, x, v):\n l = 0\n r = max(x) + 1\n eps = 10**-6\n\n while r - l > eps:\n mid = (l + r) / 2.\n max_left = max(x[i] - v[i] * mid for i in range(n))\n min_right = min(x[i] + v[i] * mid for i in range(n))\n\n if max_left <= min_right:\n r = mid\n else:\n l = mid\n\n return l\n\n\nn = int(input())\nx = tuple(map(int, input().split()))\nv = tuple(map(int, input().split()))\n\n\nprint(find_min_time(n, x, v))\n\t \t\t\t \t \t \t \t \t\t\t\t \t\t \t", "err=10**(-6)\r\nn=int(input())\r\nx=list(map(int,input().split()))\r\nv=list(map(int,input().split()))\r\n\r\ndef func(k):\r\n L=[]\r\n R=[]\r\n for i in range(len(x)):\r\n L.append(x[i]-k*v[i])\r\n R.append(x[i]+k*v[i])\r\n if max(L)<=min(R):\r\n return True\r\n return False\r\n\r\ndef binSearch(l,r,prev):\r\n mid=(l+r)/2\r\n if abs(mid-prev)<=err:\r\n return mid\r\n if func(mid):\r\n return binSearch(l,mid,mid)\r\n return binSearch(mid,r,mid)\r\n\r\n\r\nprint(round(binSearch(0,10**9,0),7))\r\n", "def f(t):\r\n a = (x[0] - v[0] * t) * 1.0\r\n b = (x[n - 1] + v[n - 1] * t) * 1.0\r\n\r\n for i in range(n):\r\n if x[i] - v[i] * t > a:\r\n a = x[i] - v[i] * t\r\n if x[i] + v[i] * t < b:\r\n b = x[i] + v[i] * t\r\n\r\n #print(a, b) \r\n\r\n return a <= b \r\n\r\nn = int(input())\r\nx = list(map(int, input().split()))\r\nv = list(map(int, input().split()))\r\n\r\ninf = 1000000000.0\r\n\r\nl = 0\r\nr = inf\r\n\r\nwhile r - l > 1e-6:\r\n m = (l + r) / 2\r\n if f(m):\r\n r = m\r\n else:\r\n l = m\r\n\r\nprint(r)\r\n", "n = int(input())\nx = list(map(int, input().split()))\nv = list(map(int, input().split()))\n\n\ndef check(t):\n # ...\n left = 0\n right = 10**9\n for i in range(n):\n leftT = x[i] - v[i] * t\n rightT = x[i] + v[i] * t\n\n if leftT > left:\n left = leftT\n if rightT < right:\n right = rightT\n\n if right > left:\n return True\n else:\n return False\n\n\nl = 0\nr = 10**9\nfor i in range(100):\n mid = (l + r) / 2\n if check(mid):\n r = mid\n else:\n l = mid\nprint(r)", "ile_ludzi = int(input())\r\n\r\nludzie = list(map(int, input().split()))\r\n\r\nszybkosci = list(map(int, input().split()))\r\n\r\n\r\n\r\ndef CzyUdaSieSpodkac(czas):\r\n maxPocz = 0\r\n minKoniec = 1e9\r\n for i in range(ile_ludzi):\r\n droga = czas * szybkosci[i] \r\n poczatek = ludzie[i] - droga\r\n koniec = ludzie[i] + droga\r\n maxPocz = max(maxPocz, poczatek)\r\n minKoniec = min(minKoniec, koniec)\r\n \r\n if(maxPocz > minKoniec):\r\n return False\r\n \r\n return True \r\n\r\ndef WyszukajCzasBinarnie(poczatek, koniec):\r\n while koniec - poczatek > 1e-7:\r\n srodek = float((koniec + poczatek) / 2)\r\n if(CzyUdaSieSpodkac(srodek) == True):\r\n koniec = srodek\r\n else:\r\n poczatek = srodek\r\n \r\n return poczatek\r\n\r\n\r\nprint(WyszukajCzasBinarnie(0, 1e9))\r\n\r\n", "def time(d1, d2):\r\n return (d2[0]-d1[0])/(d2[1]+d1[1]) if d2[0] > d1[0] else 0\r\n\r\n\r\nn = int(input())\r\ncoords = map(float, input().split())\r\nspeeds = map(float, input().split())\r\ndata = sorted(zip(coords, speeds)) # Отсортировали по координатам\r\nk1 = [data[0]]\r\ns1 = data[0][1]\r\nk2 = [data[-1]]\r\ns2 = data[-1][1]\r\nfor i in range(1, n):\r\n if data[i][1] < s1:\r\n k1.append(data[i])\r\n s1 = data[i][1]\r\n if data[-i][1] < s2:\r\n k2.append(data[-i])\r\n s2 = data[-i][1]\r\nmt = 0\r\nfor d1 in k1:\r\n for d2 in k2:\r\n dt = time(d1,d2)\r\n if dt > mt:\r\n mt = dt\r\n\r\nprint(mt)", "# cook your dish heret\r\nn=int(input())\r\nx=[int(x) for x in input().split()]\r\nv=[int(v) for v in input().split()]\r\ndef rightmost_left_ep(t):\r\n return max([x[i]-(v[i]*t) for i in range(n)])\r\ndef leftmost_right_ep(t):\r\n return min([x[i]+(v[i]*t) for i in range(n)])\r\ndef is_feasible(k):\r\n return leftmost_right_ep(k)>=rightmost_left_ep(k)\r\nL,R=0.0,1e9\r\nwhile abs(R-L)>1e-6:\r\n mid=(R+L)/2\r\n if(is_feasible(mid)):R=mid\r\n else:\r\n L=mid\r\nprint(mid)\r\n", "n=int(input())\r\nx=[int(i) for i in input().split()]\r\nv=[int(i) for i in input().split()]\r\nl=min(x)\r\nr=max(x)\r\nwhile r-l>1e-6:\r\n q=(r-l)/3\r\n m1=l+q\r\n m2=r-q\r\n t1=0\r\n for i in range(len(x)):\r\n if abs(x[i]-m1)/v[i]>t1:\r\n t1=abs(x[i]-m1)/v[i]\r\n t2=0\r\n for i in range(len(x)):\r\n if abs(x[i]-m2)/v[i]>t2:\r\n t2=abs(x[i]-m2)/v[i]\r\n if t1>t2:\r\n l=m1\r\n elif t2>t1:\r\n r=m2\r\n else:\r\n l=m1\r\n r=m2\r\nt=0\r\nfor i in range(n):\r\n if abs(x[i]-l)/v[i]>t:\r\n t=abs(x[i]-l)/v[i]\r\nprint(t)", "n = int(input())\r\npos = list(map(int, input().split(\" \")))\r\nspd = list(map(int, input().split(\" \")))\r\n\r\ndef v(time):\r\n res = [float('-inf'), float('inf')]\r\n for p, s in zip(pos, spd):\r\n res = [max(res[0], p - time*s), min(res[1], p + time*s)]\r\n if res[0] > res[1]: return False\r\n return True\r\n\r\nleft, right = 0, 10**9\r\nwhile left < right - 0.0000001:\r\n mid = (left + right)/2\r\n if v(mid) == True: right = mid\r\n else: left = mid\r\n\r\nprint(right)", "N = int(input())\r\nX = list(map(int, input().split()))\r\nV = list(map(int, input().split()))\r\n\r\n\r\ndef possible(t):\r\n l = 0\r\n r = 10**12\r\n for i in range(N):\r\n l = max(l, X[i]-(V[i]*t))\r\n r = min(r, X[i]+(V[i]*t))\r\n if (r-l) >= 0:\r\n return 1\r\n else:\r\n return 0\r\n\r\n\r\nleft = 0\r\nright = 100000000000\r\nfor i in range(1, 101):\r\n t = (left+right)/2\r\n if possible(t):\r\n right = t\r\n else:\r\n left = t\r\nprint(right)\r\n", "from math import isclose\r\nn = int(input())\r\nx = list(map(int, input().split()))\r\nv = list(map(int, input().split()))\r\nxx = list((x[i], v[i]) for i in range(n))\r\nxx.sort()\r\nl, h = xx[0][0], xx[-1][0]\r\nm = (h + l) / 2\r\nwhile not isclose(l, h):\r\n m = (h + l) / 2\r\n t = abs(m - xx[0][0]) / xx[0][1]\r\n a, b = True, t\r\n for i in range(1, n):\r\n t2 = abs(m - xx[i][0]) / xx[i][1]\r\n if not isclose(t, t2):\r\n s = False\r\n if t2 > b:\r\n b = t2\r\n a = bool(xx[i][0] < m)\r\n if a:\r\n h = m\r\n else:\r\n l = m\r\nprint(max(abs(m - xx[i][0]) / xx[i][1] for i in range(n)))\r\n \r\n", "from typing import NamedTuple\nimport bisect\nimport math\n\n\nclass Person(NamedTuple):\n coordinate: int\n speed: int\n\n\ninput()\n_coordinates = list(map(int, input().split()))\n_speeds = list(map(int, input().split()))\n\npeople = [Person(c, s) for c, s in zip(_coordinates, _speeds)]\npeople.sort()\n\nleft_coordinate_bound, right_coordinate_bound = people[0].coordinate, people[-1].coordinate\n\nwhile True:\n mid_coordinate = (left_coordinate_bound + right_coordinate_bound) / 2\n sep_person_i = bisect.bisect_right(people, Person(mid_coordinate, -1))\n\n def time_needed_between(left_bound, right_bound):\n max_time = 0\n for person_i in range(left_bound, right_bound):\n cur_time = abs(people[person_i].coordinate - mid_coordinate) / people[person_i].speed\n max_time = max(max_time, cur_time)\n return max_time\n\n left_ppl_time = time_needed_between(0, sep_person_i)\n right_ppl_time = time_needed_between(sep_person_i, len(people))\n\n # print(left_coordinate_bound, right_coordinate_bound, left_ppl_time, right_ppl_time)\n\n if math.isclose(left_ppl_time, right_ppl_time):\n print(left_ppl_time)\n break\n\n if left_ppl_time < right_ppl_time:\n left_coordinate_bound = mid_coordinate\n\n if left_ppl_time > right_ppl_time:\n right_coordinate_bound = mid_coordinate\n", "#input\r\nn = int(input())\r\nx = [int(x) for x in input().split()]\r\nv = [int(x) for x in input().split()]\r\n\r\n#functions to know if there is a solution at time = k\r\ndef max_l(t):\r\n return max([x[i]-(v[i]*t) for i in range(n)])\r\n\r\ndef min_r(t):\r\n return min([x[i]+(v[i]*t) for i in range(n)])\r\n\r\ndef ok(k):\r\n return max_l(k) <= min_r(k)\r\n\r\n\r\nl,r = 0.0,1e9\r\nwhile(abs(r-l)>1e-6):\r\n mid = (l+r)/2;\r\n if(ok(mid)):\r\n r=mid\r\n else:\r\n l = mid\r\nprint(mid)\r\n", "n=int(input())\r\nx=list(map(int,input().split()))\r\nv=list(map(int,input().split()))\r\ndef check(time):\r\n left=0\r\n right=1e10\r\n for i in range(n):\r\n left=max(left, x[i]-v[i]*time)\r\n right=min(right, x[i]+v[i]*time)\r\n return left <= right\r\nlo=0\r\nhi=1e10\r\nfor _ in range(300):\r\n m=(lo+hi)/2\r\n if check(m): hi=m\r\n else:lo=m\r\nprint('{:.8f}'.format(lo))", "import sys\r\nimport math\r\nimport collections\r\nimport random\r\nfrom heapq import heappush, heappop, heapify\r\nfrom functools import reduce\r\ninput = sys.stdin.readline\r\n \r\nints = lambda: list(map(int, input().split()))\r\n\r\nMAXN = int(1e6)\r\nMOD = int(1e9 + 7)\r\n\r\nn = int(input())\r\na = ints()\r\nv = ints()\r\n\r\ndef possible(x):\r\n t = 0\r\n for i in range(n):\r\n t = max(t, abs(a[i] - x) / v[i])\r\n return t\r\n\r\nl, r = 0, 1e9\r\nwhile (r - l) > 10 ** (-6):\r\n m1 = l + (r - l) / 3\r\n m2 = r - (r - l) / 3\r\n t1 = possible(m1)\r\n t2 = possible(m2)\r\n if t1 <= t2:\r\n r = m2\r\n else:\r\n l = m1\r\nprint(possible(l))", "n, x, v = int(input()), list(map(int, input().split())), list(map(int, input().split()))\r\nt1, t2 = 0, 10 ** 9\r\nwhile t1 + 10 ** -6 < t2:\r\n t3 = (t1 + t2) / 2\r\n l, r = 1, 10 ** 9\r\n for xi, vi in zip(x, v):\r\n l, r = max(l, xi - vi * t3), min(r, xi + vi * t3)\r\n if l <= r:\r\n t2 = t3\r\n else:\r\n t1 = t3\r\nprint(t2)", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nN = int(input())\r\nX = list(map(int, input().split()))\r\nV = list(map(int, input().split()))\r\n\r\ndef check(t):\r\n span = (0,10**9)\r\n for i in range(N):\r\n l,r = X[i]-V[i]*t,X[i]+V[i]*t\r\n tmp = [(l,r),span]\r\n tmp.sort()\r\n \r\n cur = (tmp[1][0],tmp[1][1])\r\n if tmp[0][1]<tmp[1][1]:\r\n cur = (cur[0],tmp[0][1])\r\n #print(cur)\r\n if cur[0]>cur[1]:\r\n return False\r\n span = cur\r\n \r\n return True\r\n\r\nl,r=0,10**9\r\nwhile l+0.0000001<r:\r\n m = (l+r)/2\r\n #print(m)\r\n if check(m):\r\n r=m\r\n else:\r\n l=m\r\n \r\nprint(r)\r\n\r\n", "\r\n\r\nn=int(input())\r\nx=list(map(int, input().split()))\r\nv=list(map(int, input().split()))\r\n \r\n \r\n \r\n \r\ndef ss(xx):\r\n t=0 \r\n for i in range(n):\r\n t=max(t,abs(x[i]-xx)/v[i])\r\n return t \r\n \r\n \r\n# for i in range(min(x),max(x)+1):\r\n# print(i,ss(i))\r\n \r\nans=float('inf')\r\ni=0\r\nj=1000000000\r\nwhile i<=j:\r\n m=(i+j)/2 \r\n t=ss(m)\r\n # print(i,j,m,t,ss(m+1))\r\n ans=min(ans,t)\r\n if ss(m+0.0000001)<=t:\r\n i=m+0.0000001\r\n else:\r\n j=m-0.0000001\r\nprint(ans)", "n = int(input())\nx = list(map(int, input().split()))\nv = list(map(int, input().split()))\n\ndef f(id):\n ans = 0\n for i in range(n):\n ans = max(ans, abs(id - x[i]) / v[i])\n return ans\n\n\nl, r = -1e10, 1e10\nwhile (r - l > 1e-6):\n m1 = (2*l + r) / 3\n m2 = (2*r + l) / 3\n if f(m1) > f(m2):\n l = m1\n else:\n r = m2\nprint(f(r))\n \t\t \t \t \t\t \t \t \t\t \t\t\t\t\t \t", "from sys import stdin\r\ninp=stdin.readline\r\nn=int(inp())\r\nd=[int(x) for x in inp().split()]\r\nv,big,small,t,c=[int(x) for x in inp().split()],max(d),min(d),0,30\r\nwhile(c):\r\n mid,c,t=(big+small)/2,c-1,-1\r\n for i in range(n):\r\n if abs(d[i]-mid)/v[i]>t:\r\n t=abs(d[i]-mid)/v[i]\r\n x=d[i]\r\n if x>mid:small=mid\r\n else:big=mid\r\nprint(t)", "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 bisect import bisect_left, bisect_right\r\nfrom collections import defaultdict\r\n\r\n\r\ndef summ(n):\r\n return sum(int(i) for i in list(str(n)))\r\n\r\n\r\ndef solve():\r\n n = iinp()\r\n x = linp()\r\n v = linp()\r\n\r\n right = max(x)\r\n left = 0\r\n while left < right + 0.0000001:\r\n mid = left + (right - left) / 2\r\n maxi = -float(\"inf\")\r\n mini = float(\"inf\")\r\n for i in range(n):\r\n cur = mid * v[i]\r\n maxi = max(maxi, x[i] - cur)\r\n mini = min(mini, x[i] + cur)\r\n if mini >= maxi:\r\n right = mid - 0.0000001\r\n else:\r\n left = mid + 0.0000001\r\n print(left)\r\n\r\n\r\nq = 1\r\nfor _ in range(q):\r\n solve()", "def f():\r\n lo=0\r\n hi=10**9\r\n while hi-lo>10**-6:\r\n mid=(lo+hi)/2\r\n if moze(mid):\r\n hi=mid\r\n else:\r\n lo=mid+10**-6\r\n return lo\r\ndef moze(broj):\r\n manji=0\r\n veci=10**9+100\r\n for i in range(0, n):\r\n if x[i]+v[i]*broj<veci and veci>0:\r\n veci=x[i]+v[i]*broj\r\n if x[i]-v[i]*broj>manji and manji<10**9:\r\n manji=x[i]-v[i]*broj\r\n if veci<0:\r\n veci=0\r\n if manji>10**9:\r\n manji=10**9\r\n if manji<=veci:\r\n return True\r\n return False\r\nn=int(input())\r\nx=list(map(int, input().split()))\r\nv=list(map(int, input().split()))\r\nprint(round(f(), 8))\r\n" ]

[ "import io, os, sys\r\n\r\npypyin = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\ncpyin = sys.stdin.readline\r\ninput = pypyin if 'PyPy' in sys.version else cpyin\r\n\r\ndef strput():\r\n return input().decode() if 'PyPy' in sys.version else input()\r\n\r\n# code starts here\r\n\r\ndef main():\r\n n, m = [int(x) for x in input().split()]\r\n color = [int(x) - 1 for x in input().split()]\r\n need = [int(x) for x in input().split()]\r\n\r\n for i in range(n):\r\n cnt = [0] * m\r\n for j in range(i, n):\r\n cnt[color[j]] += 1\r\n if cnt == need:\r\n print(\"YES\")\r\n return\r\n\r\n print(\"NO\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n , m = (list)(map(int , input().split()))\r\na = (list)(map(int , input().split()))\r\nb = (list)(map(int , input().split()))\r\nfre = [0 for _ in range(m)]\r\nsum = sum(b)\r\nfor _ in range(sum - 1) : fre[a[_] - 1] += 1\r\nfor _ in range(sum - 1 , n) :\r\n fre[a[_] - 1] += 1\r\n if _ - sum >= 0 : fre[a[_ - sum] - 1] -= 1\r\n if fre == b :\r\n print(\"YES\")\r\n quit()\r\nprint(\"NO\")\r\n", "# 입력값 받기\r\nn, m = map(int, input().split())\r\nlightsabers = list(map(int, input().split()))\r\ndesired_counts = list(map(int, input().split()))\r\n\r\n# 가능한 모든 구간에 대해\r\nfor i in range(n):\r\n for j in range(i, n):\r\n # 해당 구간 내의 라이트세이버 색깔별 수 계산\r\n counts = [0] * m\r\n for k in range(i, j + 1):\r\n counts[lightsabers[k] - 1] += 1\r\n \r\n # 계산된 수가 원하는 조건과 일치하는지 확인\r\n if counts == desired_counts:\r\n print(\"YES\")\r\n exit()\r\n\r\nprint(\"NO\")\r\n", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nk=list(map(int,input().split()))\r\na=b=0\r\nt =-1\r\nwhile b!=n and a!=n:\r\n if t!=-1:\r\n c=l[a]-1\r\n k[c]+=1\r\n if k[c]==0:t=-1\r\n a+=1\r\n else:\r\n c=l[b]-1\r\n k[c]-=1\r\n if k[c]==-1:t=c\r\n b+=1\r\n if all(x==0 for x in k):print('YES');exit()\r\nprint('NO')", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nt=list(map(int,input().split()))\r\nx=sum(t)\r\nfor i in range(n-x+1):\r\n freq=[0]*m\r\n for j in range(i,i+x):\r\n freq[a[j]-1]+=1\r\n flag=True\r\n for j in range(m):\r\n if freq[j]!=t[j]:\r\n flag=False\r\n break \r\n if flag:\r\n break\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n ", "n,m=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nc=sum(b)\r\nd=[0]*m\r\nfor i in range(c):\r\n d[a[i]-1]+=1\r\ne=0\r\nfor i in range(n-c+1):\r\n if i!=0:\r\n d[a[i-1]-1]-=1\r\n d[a[i+c-1]-1]+=1\r\n if d==b:\r\n e=1\r\n break\r\nif e==0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "import sys\r\n\r\nn, m = [int(x) for x in input().split(' ')]\r\narr = [int(x)-1 for x in input().split(' ')]\r\nk = [int(x) for x in input().split(' ')]\r\n\r\nsumm = 0\r\nfor i in range(m):\r\n\tsumm += k[i]\r\n\r\nfor i in range(n):\r\n\tif i >= summ:\r\n\t\tk[arr[i-summ]] += 1\r\n\tk[arr[i]] -= 1\r\n\tdone = True\r\n\tfor j in range(m):\r\n\t\tif k[j] != 0:\r\n\t\t\tdone = False\r\n\tif done:\r\n\t\tprint('YES')\r\n\t\tsys.exit()\r\nprint('NO')", "n, m = map(int, input().split())\r\nc = list(map(int, input().split()))\r\nk = list(map(int, input().split()))\r\ns = sum(k)\r\nfor i in range(n-s+1):\r\n v = [0] * m\r\n for j in range(i, i+s):\r\n v[c[j]-1]+=1\r\n if v == k:\r\n print('YES')\r\n exit(0)\r\nprint('NO')", "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, m = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n k = list(map(int, input().split()))\r\n\r\n counts = {i + 1: 0 for i in range(m)}\r\n l = 0\r\n\r\n for r in range(n):\r\n counts[a[r]] += 1\r\n for j in range(1, m + 1):\r\n if counts[j] != k[j - 1]:\r\n break\r\n else:\r\n print(\"YES\")\r\n return\r\n\r\n while counts[a[r]] > k[a[r] - 1]:\r\n counts[a[l]] -= 1\r\n l += 1\r\n\r\n print(\"NO\")\r\n\r\n return\r\n\r\n\r\nif __name__ == '__main__':\r\n multytest = False\r\n\r\n if multytest:\r\n t = int(input())\r\n for i in range(t):\r\n solve()\r\n else:\r\n solve()\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\nw = list(map(int, input().split()))\r\nd = list(map(int, input().split()))\r\ne = [0]*m\r\nx = sum(d)\r\nfor i in w[:x]:\r\n e[i-1] += 1\r\nif e == d:\r\n print('YES')\r\n exit()\r\nfor i in range(n-x):\r\n e[w[i]-1] -= 1\r\n e[w[i+x]-1] += 1\r\n if e == d:\r\n print('YES')\r\n exit()\r\nprint('NO')\r\n" ]

[ "names = [i for i in 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'] + [ 'AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsTtUuVvWwXxYyZz'[i:i+2] for i in range(0, len('AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsTtUuVvWwXxYyZz'), 2)]\r\nn, k = map(int, input().split())\r\nyes_no = input().split()\r\nguess = names[:n]\r\nfor i in range(len(yes_no)):\r\n if yes_no[i] == 'NO':\r\n guess[i + k - 1] = guess[i]\r\nprint(' '.join(guess))", "def get_name(i):\n first = i // 26\n second = i % 26\n return chr(first + ord('A')) + chr(second + ord('a'))\n\ndef main():\n n, k = map(int, input().split())\n commands = input().split()\n\n names = [get_name(i) for i in range(k)]\n if commands[0] == \"NO\":\n names[0] = names[1]\n\n ptr = 1\n next_id = k + 1\n for c in commands[1:]:\n if c == \"YES\":\n names.append(get_name(next_id))\n next_id += 1\n else:\n names.append(names[ptr])\n\n ptr += 1\n\n print(' '.join(names))\n\nmain()\n", "names = [chr(ord('A') + i) for i in range(26)]\nnames += ['A' + chr(ord('a') + i) for i in range(26)]\n\nn, k = map(int, input().split())\na = input().split()\n\nfor i, a_i in enumerate(a):\n if a_i == 'NO':\n names[i+k-1] = names[i]\n\nprint(' '.join(names[:n]))\n\n\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn , k = (list)(map(int , input().split()))\r\ntemp = (list)(map(str , input().split()))\r\n\r\nbase = []\r\n\r\nfor _ in range(26) :\r\n capital = chr(ord(\"A\") + _) \r\n small = chr(ord(\"a\") + _) \r\n base.append(capital)\r\n base.append(capital + small)\r\n\r\nptr = 0\r\nans = [\"\" for _ in range(n)]\r\nfor _ in range(k - 1) :\r\n ans[_] = base[ptr]\r\n ptr += 1\r\n \r\nfor _ in range(len(temp)) :\r\n # _ to _ + k - 1\r\n if temp[_] == \"YES\" :\r\n ans[k + _ - 1] = base[ptr]\r\n ptr += 1\r\n else : ans[k + _ - 1] = ans[_]\r\n\r\nprint(*ans)", "n, k = map(int, input().split())\nnames = []\nfor i in range(ord('a'), ord('z') + 1):\n names.append('A' + chr(i))\nfor i in range(ord('a'), ord('z') + 1):\n names.append('B' + chr(i))\npos = 0\na = input().split()\nans = []\nfor i in range(k - 1):\n ans.append(names[pos])\n pos += 1\nfor i in range(n - k + 1):\n if a[i] == \"YES\":\n ans.append(names[pos])\n pos += 1\n else:\n ans.append(ans[i])\nprint(' '.join(ans))", "import sys \r\nimport math\r\nfrom collections import Counter\r\nfrom operator import itemgetter\r\nimport queue\r\n\r\ndef IO():\r\n\tsys.stdin=open(\"pyinput.txt\", 'r')\r\n\tsys.stdout=open(\"pyoutput.txt\", 'w')\r\n\r\ndef GCD(a, b):\r\n\tif(b==0): return a\r\n\telse: return GCD(b, a%b)\r\n\r\ndef LCM(a, b): return a*(b//GCD(a, b))\r\n\r\ndef scan(TYPE_1, TYPE_2=0):\r\n\tif(TYPE_1==int):\r\n\t\treturn map(int, sys.stdin.readline().strip().split())\r\n\telif(TYPE_1==float):\r\n\t\treturn map(float, sys.stdin.readline().strip().split())\r\n\telif(TYPE_1==list and TYPE_2==float):\r\n\t\treturn list(map(float, sys.stdin.readline().strip().split()))\r\n\telif(TYPE_1==list and TYPE_2==int):\r\n\t\treturn list(map(int, sys.stdin.readline().strip().split()))\r\n\telif(TYPE_1==str):\r\n\t\treturn sys.stdin.readline().strip()\r\n\telse: print(\"ERROR!!!!\") \r\n\r\n\r\n\r\ndef main():\r\n\t\r\n\ts=[]\r\n\tfor i in range(65, 91):\r\n\t\ts.append(chr(i))\r\n\tfor i in range(97, 123):\r\n\t\ts.append('A'+chr(i))\r\n\r\n\tn, k=scan(int)\r\n\ta=scan(str).split()\r\n\t\r\n\tans=[]\r\n\tidx=0\r\n\r\n\tfor i in range(k-1):\r\n\t\tans.append(s[idx])\r\n\t\tidx+=1\r\n\r\n\tfor i in range(n-k+1):\r\n\t\tif(a[i]=='NO'):\r\n\t\t\tans.append(ans[-k+1])\r\n\t\telse:\r\n\t\t\tans.append(s[idx])\r\n\t\t\tidx+=1\r\n\r\n\tprint(*ans)\r\n\r\n\r\n\r\n# IO()\r\nmain()", "# ---------------------------------------------------------------------------------------\r\n# URL : https://codeforces.com/contest/790/problem/A\r\n# Title : Bear and Different Names\r\n# Tags : tag-codeforces, tag-problem-A, tag-div-1, tag-difficulty-1500\r\n# Notes : constructive algorithms, greedy\r\n# ---------------------------------------------------------------------------------------\r\n\r\n\r\nimport string\r\n\r\n\r\ndef list_to_string(_a):\r\n return \" \".join(map(str, _a))\r\n\r\n\r\ndef solve():\r\n possible_names = list(string.ascii_uppercase)\r\n possible_names += list(map(lambda x: x[0] + x[1], zip(list(string.ascii_uppercase), list(string.ascii_lowercase))))\r\n\r\n n, k = map(int, input().split())\r\n a = list(input().split())\r\n\r\n result = possible_names[:n]\r\n\r\n for i in range(n - k + 1):\r\n if a[i] == \"NO\":\r\n result[i + k - 1] = result[i]\r\n\r\n return list_to_string(result)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n print(solve())\r\n", "n, k = map(int, input().split())\r\nnames = []\r\n\r\ndef getNext(a):\r\n if a[1] == 'z':\r\n return chr(ord(a[0]) + 1) + 'a'\r\n else:\r\n return a[0] + chr(ord(a[1]) + 1)\r\n\r\na = list(input().split())\r\nfor i in range(len(a)):\r\n a[i] = 1 if a[i] == 'YES' else 0\r\n\r\ntmp = 'Aa'\r\nnames.append(tmp)\r\nif a[0]:\r\n for i in range(k - 1):\r\n tmp = getNext(tmp)\r\n names.append(tmp)\r\nelse:\r\n names.append(tmp)\r\n for i in range(k - 2):\r\n tmp = getNext(tmp)\r\n names.append(getNext(tmp)) \r\n \r\nfor i in range(k, n):\r\n if a[i - k + 1]:\r\n tmp = getNext(tmp)\r\n names.append(getNext(tmp))\r\n else:\r\n names.append(names[i - k + 1])\r\nprint(*names)", "n, k = input().split();\r\nb = input().split();\r\nout = list(range(int(n)))\r\n\r\ndef intToName(i):\r\n\tletters = ord(\"Z\") - ord(\"A\") + 1\r\n\tres = \"\";\r\n\tfirst = True;\r\n\twhile True:\r\n\t\ti,c = divmod(i,letters);\r\n\t\tif first:\r\n\t\t\tres += chr(ord(\"A\")+c)\r\n\t\telse:\r\n\t\t\tres += chr(ord(\"a\")+c)\r\n\t\tif i == 0:\r\n\t\t\treturn res;\r\n\t\telse:\r\n\t\t\ti -= 1;\r\n\t\tfirst = False;\r\n\t\r\ni = 0;\r\nwhile i <= int(n)-int(k):\r\n\tsoldierFirst = i\r\n\tsoldierLast = i+int(k)-1\r\n\tif b[i] == \"NO\":\r\n\t\tout[soldierLast] = out[soldierFirst];\r\n\ti += 1;\r\n\r\nfor i in range(int(n)-1):\r\n\tprint(intToName(out[i]), end = \" \");\r\nprint(intToName(out[int(n)-1]));", "n,k=map(int,input().split())\r\na=input().split()\r\nl=[]\r\nfor i in range(n):\r\n\tif i<26:\r\n\t\tl.append(chr(i+65))\r\n\telse:\r\n\t\tl.append('A'+chr(i-26+97))\r\nfor i in range(n-k+1):\r\n\tif a[i]=='NO':\r\n\t\tl[i+k-1]=l[i]\r\nprint(*l)", "n, k = map(int, input().split())\np= input().split()\n \nw= ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h']\n \nq= [str(w[i // len(w)]).upper() + w[i % len(w)] for i in range(55)]\no= k\n \nr= q[:(k - 1)]\n \nfor s in p:\n if s == 'NO':\n r.append(r[-(k - 1)])\n else:\n r.append(q[o])\n o+= 1\n \nprint(*r)\n\t \t\t\t\t \t\t \t\t\t \t\t\t \t \t\t\n \t\t\t\t \t \t \t\t\t\t \t\t\t \t\t\t\t \t", "n, k = map(int, input().split())\r\nl = [True if x == 'YES' else False for x in input().split()]\r\n \r\nres = list(range(k - 1))\r\nfor i in l:\r\n if i:\r\n for j in range(k):\r\n if j not in res[-k+1:]:\r\n res.append(j)\r\n break\r\n else:\r\n res.append(res[-k + 1])\r\n \r\nnames = [chr(x) + chr(y) for x in range(ord('A'), ord('Z') + 1) for y in range(ord('a'), ord('z') + 1)]\r\n \r\nfor i in res:\r\n print(names[i], end=' ')\r\nprint()", "n, k = map(int, input().split())\ns = input().split()\nans = []\nfor i in range(26):\n ans.append(chr(65 + i) + \"a\")\nfor i in range(24):\n ans.append(chr(65 + i) + \"b\")\nfor i in range(n - k + 1):\n if s[i] == \"NO\":\n ans[i + k - 1] = ans[i]\nans = ans[:n]\nprint(*ans)", "n, k = map(int, input().split())\ns = list(input().split())\n\ndef generate_name(n):\n s = ''\n for i in range(10):\n if (n == 0):\n break\n for j in range(26):\n n -= 1\n if (n == 0):\n s += chr(ord('A') + j)\n return s.title()\n s += 'Z'\n return s.title()\n\nnames = []\nt = 1\n\nfor i in range(k - 1):\n names.append(generate_name(t))\n t += 1\n\nfor word in s:\n if word == 'YES':\n names.append(generate_name(t))\n t += 1\n else:\n names.append(names[-min(k - 1, len(names))])\n\nprint(' '.join(names))\n", "n, k = map(int, input().split())\r\nv = ['AB'[i // 26] + 'abcdefghijklmnopqrstuvwxyz'[i % 26] for i in range(n)]\r\nfor i, si in enumerate(input().split()):\r\n if si == 'NO':\r\n v[i + k - 1] = v[i]\r\nprint(' '.join(v))", "from sys import stdin, stdout\r\nfrom itertools import combinations_with_replacement\r\n\r\nnames = ['A' + ''.join(i) for i in combinations_with_replacement(\"abcd\", 5)]\r\n\r\nread = stdin.readline\r\nwrite = stdout.write\r\n\r\ndef solve(n, k, strings):\r\n no = \"NO\"\r\n names_i = k\r\n strings_i = n - k + 1\r\n soldiers = names[:names_i - 1]\r\n while strings_i > 0:\r\n if strings[strings_i - 1] == no:\r\n soldiers.insert(0, soldiers[k - 2])\r\n else:\r\n soldiers.insert(0, names[names_i])\r\n names_i += 1\r\n strings_i -= 1\r\n return soldiers\r\n\r\nn, k = list(map(int, read().strip().split()))\r\nstrings = read().strip().split()\r\nanswer = \" \".join(solve(n, k, strings))\r\nwrite(answer + \"\\n\")\r\n", "def get(x):\r\n return chr(ord('A') + x // 26) + chr(ord('a') + x % 26)\r\n\r\nread = lambda: map(int, input().split())\r\nn, k = read()\r\na = input().split()\r\nans = [0] * n\r\nnum = 1\r\nfor i in range(k - 1):\r\n ans[i] = num\r\n num += 1\r\nfor i in range(k - 1, n):\r\n cur = a[i - k + 1]\r\n if cur == 'YES':\r\n num += 1\r\n ans[i] = num\r\n else:\r\n ans[i] = ans[i - k + 1]\r\nres = ' '.join(map(str, [get(i) for i in ans]))\r\nprint(res)", "n , k = map(int,input().split())\r\nl = input().split()\r\nname = ['A']\r\ndef gnext(string):\r\n s = '' + string\r\n s = s.lower()\r\n k = list(s)\r\n for i in range(1,len(s)+1):\r\n if k[-1*i] != 'z':\r\n k[-1*i] = chr(ord(k[-1])+1)\r\n for x in range(1,i):\r\n k[-1*i] = 'a'\r\n break\r\n else:\r\n for i in range(len(k)):\r\n k[i] = 'a'\r\n k.append('a')\r\n k[0] = k[0].upper()\r\n return ''.join(k)\r\n \r\n \r\nif l[0] == 'YES':\r\n for _ in range(1,k):\r\n name.append(gnext(name[-1]))\r\nelse:\r\n name.append(name[0])\r\n for _ in range(2,k):\r\n name.append(gnext(name[-1]))\r\n \r\nuniq = gnext(name[-1])\r\nfor i in range(1,len(l)):\r\n if l[i] == 'YES':\r\n name.append(uniq)\r\n uniq = gnext(uniq)\r\n else:\r\n name.append(name[i])\r\nfor x in name:\r\n print(x,end = ' ')", "n,k=map(int,input().split())\nd=list(map(str,input().split()))\nd1=[]\na=\"A\"\nb=\"a\"\nfor i in range(k-1):\n if b==\"z\":\n a+=b\n b=\"a\"\n d1+=[a+b]\n b=chr(ord(b)+1)\nfor i in d:\n if b==\"z\":\n a+=b\n b=\"a\"\n if i==\"NO\":\n d1+=[d1[0]]\n print(d1[0],end=\" \")\n d1.pop(0)\n else:\n print(d1[0],end=\" \")\n d1.pop(0)\n d1+=[a+b]\n b=chr(ord(b)+1)\nprint(*d1)\n", "n, k = map(int, input().split())\r\ns = [i == \"YES\" for i in input().split()]\r\n\r\nr = []\r\n\r\nname = \"Aa\"\r\n\r\ndef nextName():\r\n\tglobal name\r\n\tif name[-1] == 'z': name = name + 'a'\r\n\telse: name = name[:-1] + chr(ord(name[-1]) + 1)\r\n\treturn name\r\n\r\nfor i in range(k-1):\r\n\tr.append(nextName())\r\n\r\nfor i in range(n-k+1):\r\n\tr.append(nextName() if s[i] else r[i])\r\n\r\nprint(*r)", "import random\r\n\r\ndef random_str(rango, pos):\r\n while True:\r\n x = random.randint(65,90)\r\n string = chr(x)\r\n x = random.randint(1,10)\r\n for i in range(x - 1):\r\n rand = random.randint(97,122)\r\n string += chr(rand)\r\n if string not in rango:\r\n break\r\n return string\r\n\r\ndef print_array(array): \r\n result = \"\"\r\n for string in array:\r\n result += string + \" \"\r\n\r\n print(result)\r\n \r\nn, k = map(int, input().strip().split(\" \"))\r\n\r\nstrings = input().strip().split(\" \")\r\nsoldiers = [-1] * n\r\n\r\nfor i in range(n):\r\n soldiers[i] = random_str(soldiers, i)\r\n\r\npos = 0\r\nfor string in strings:\r\n \r\n if string == \"NO\": \r\n aux = soldiers[pos]\r\n soldiers[pos + k - 1] = aux \r\n \r\n pos += 1\r\n \r\nprint_array(soldiers) ", "import sys\r\nfrom itertools import product\r\nfrom string import ascii_lowercase\r\n\r\ninput = lambda: sys.stdin.buffer.readline().decode().strip()\r\nn, sz = map(int, input().split())\r\nstate = [x for x in input().split()]\r\nnames = list(product(ascii_lowercase, repeat=2))\r\nans = names[:sz - 1]\r\n\r\nfor i in range(n - sz + 1):\r\n if state[i] == 'NO':\r\n ans.append(ans[i])\r\n else:\r\n ans.append(names.pop())\r\n\r\nprint(' '.join([x[0].upper() + x[1] for x in ans]))\r\n", "n,k=map(int,input().split())\r\nl=[]\r\nfor i in range(65,91):\r\n l.append(chr(i))\r\nfor i in range(65,91):\r\n l.append(chr(i)+chr(i+32))\r\nans=l[:k-1]\r\nx=list(map(str,input().split()))\r\nfor i in range(n-k+1):\r\n if x[i]=='YES':\r\n for j in range(50):\r\n if l[j] not in ans[i:i+k]:\r\n ans.append(l[j])\r\n break\r\n else:\r\n ans.append(ans[i])\r\nprint(*ans)", "import sys\n\n\n\ndef main():\n names = []\n for i in range(26): \n s = \"A\" + chr(ord('a')+i)\n s1 = \"X\" + chr(ord('a')+i)\n names.append(s)\n names.append(s1)\n \n n,k = map(int,sys.stdin.readline().split())\n r = list(sys.stdin.readline().split())\n res = [\"Ho\"]*n\n cur = 0\n\n firstYes = -1\n for i in range(n-k+1):\n if r[i] == \"YES\":\n firstYes = i\n break\n\n if firstYes == -1:\n print(\" \".join(res))\n return\n\n for i in range(firstYes+1, firstYes+k):\n res[i] = names[cur]\n cur+=1\n\n for i in range(firstYes+1, n-k+1):\n if r[i] == \"YES\":\n res[i+k-1] = names[cur]\n cur+=1\n else:\n res[i+k-1] = res[i]\n\n print(\" \".join(res))\n\nmain()", "def parent(x):\r\n global color\r\n y = x\r\n while color[x] != x:\r\n x = color[x]\r\n while y != x:\r\n color[y], y = x, color[y] \r\n return x\r\n\r\ndef union(x, y):\r\n global color\r\n x = parent(x)\r\n y = parent(y)\r\n if size[x] < size[y]:\r\n x, y = y, x\r\n color[y] = x\r\n size[x] += size[y]\r\n\r\nn, k = map(int, input().split())\r\na = input().split()\r\nres = list(range(n))\r\ncolor = list(range(n))\r\nsize = [1] * n\r\nfor i in range(n - k + 1):\r\n if a[i] == 'NO':\r\n union(i, i + k - 1)\r\n\r\nalph = ''.join(chr(i) for i in range(ord('a'), ord('z') + 1))\r\nnames = [x+y for x in alph.upper() for y in alph] \r\n\r\nprint(*[names[x] for x in color])", "n, k = map(int, input().split())\na = input().split()\nuq_names = [chr(i) for i in range(ord('A'), ord('Z') + 1)]\nuq_names += [s + 'a' for s in uq_names]\nres = uq_names[:k - 1]\nuni = k - 1\nfor i, b in enumerate(a):\n if b == \"YES\":\n res.append(uq_names[uni])\n uni += 1\n else:\n res.append(res[i])\nprint(' '.join(res))\n", "n, k = map(int, input().split())\r\na = input().split()\r\nnames = [chr(ord(\"A\") + i) for i in range(26)] + [chr(ord(\"A\") + i) + chr(ord('a') + i) for i in range(26)]\r\nans = [names[i] for i in range(n)]\r\nfor i in range(k - 1, n):\r\n\tif a[i - k + 1] == \"NO\":\r\n\t\tans[i] = ans[i - k + 1]\r\nprint(*ans)\r\n", "n, k = map(int, input().split())\npossible_names = [a + b for a in 'QWERTYUIOPLKJHGFDSAZXCVBNM' for b in 'qwertyuioplkjhgfdsazxcvbnm']\nnames = [possible_names.pop() for i in range(k - 1)]\nfor word in input().split():\n if word == 'YES':\n names.append(possible_names.pop())\n else:\n names.append(names[-k + 1])\nprint(*names)\n", "c = []\r\nfor i in range(65,91):\r\n for j in range(97,123):\r\n c.append(chr(i)+chr(j))\r\nn,k = map(int,input().split())\r\nl = list(map(str,input().split()))\r\nz = 0\r\np = []\r\nif(l[0]=='YES'):\r\n p+=c[z:z+k]\r\n z+=k\r\nelse:\r\n p+=c[z:z+k-1]\r\n p+=[c[z]]\r\n z+=(k-1)\r\nfor i in range(1,len(l)):\r\n if l[i]=='YES':\r\n p+=[c[z]]\r\n z+=1\r\n else:\r\n p+=[p[len(p)-k+1]]\r\nprint(*p)\r\n", "from string import ascii_lowercase\r\nimport collections\r\n\r\nn, m = map(int, input().split())\r\nl = list(input().split())\r\nanswer = collections.deque()\r\n\r\nNames= []\r\nstart, end =0,m-1\r\n\r\nfor i in ascii_lowercase.upper():\r\n for j in ascii_lowercase:\r\n Names.append(i+j)\r\n\r\nfor i in range(0, m-1):\r\n print(Names[i], end=\" \")\r\n answer.append(Names[i])\r\n\r\nfor i in l:\r\n if i ==\"YES\":\r\n answer.append(Names[end])\r\n end+=1\r\n else:\r\n answer.append(answer[0])\r\n\r\n answer.popleft()\r\n print(answer[-1], end=\" \")\r\n\r\n\r\n", "n, k = [int(i) for i in input().split()]\r\n#n, k = 50, 2\r\ns = [i for i in input().split()]\r\n#s = [\"YES\"] * 49\r\nres = []\r\nc1 = ord(\"A\")\r\nc2 = ord(\"a\")\r\nc3 = ord(\"a\")\r\n\r\nfor i in range(0, k-1):\r\n res1 = \"\"\r\n if (c1 == ord(\"Z\") and c2 == ord(\"z\")):\r\n res1 = chr(c1) + chr(c2) + chr(c3)\r\n c3 += 1\r\n elif (c1 == ord(\"Z\")):\r\n res1 = chr(c1) + chr(c2)\r\n c2 += 1\r\n else:\r\n res1 = chr(c1)\r\n c1 += 1\r\n res.append(res1)\r\n\r\n\r\nfor i in range(len(s)):\r\n if s[i] == \"NO\":\r\n res.append(res[i])\r\n else:\r\n res1 = \"\"\r\n if (c1 == ord(\"Z\") and c2 == ord(\"z\")):\r\n res1 = chr(c1) + chr(c2) + chr(c3)\r\n c3 += 1\r\n elif (c1 == ord(\"Z\")):\r\n res1 = chr(c1) + chr(c2)\r\n c2 += 1\r\n else:\r\n res1 = chr(c1)\r\n c1 += 1\r\n res.append(res1)\r\n\r\n #print(i, s[i], *res[i:])\r\n\r\n\r\nfor i in res:\r\n print(i, end = \" \")\r\n", "def solve(n, k, a):\n t = 0\n ans = [\"\" for i in range(n)] \n \n i = 0\n while ((i < len(a)) and (a[i] == 'NO')):\n ans[i] = names[0]\n i += 1\n \n if (i == len(a)):\n for j in range(i, i + k - 1):\n ans[j] = ans[0]\n return(ans)\n \n for j in range(i, i + k):\n ans[j] = names[t]\n t += 1\n \n while (i < len(a)):\n if (a[i] == 'NO'):\n ans[i + k - 1] = ans[i]\n else:\n ans[i + k - 1] = names[t]\n t += 1\n i += 1\n\n return ans \n\n\n\n\nnames = []\nfor i in range(ord('A'), ord('Z')+ 1):\n for j in range(ord('a'), ord('z')+ 1):\n names.append(chr(i) + chr(j))\n'''\nimport random\nfor i in range(100000):\n n = random.randint(2, 52)\n k = random.randint(2, n)\n a = [random.choice(['YES', 'NO']) for i in range(n - k)]\n ans = solve(n, k, a)\n for i in range(0, n - k):\n s = set(ans[i:i+k])\n is_diff = len(s) == k\n if (a[i] == 'YES'):\n if (len(s) != k):\n print(n, k)\n print(a)\n print(ans)\n exit\n if (a[i] == 'NO'):\n if (len(s) == k):\n print(n, k)\n print(a)\n print(ans)\n exit\n''' \nn, k = list(map(int, input().strip().split()))\nis_ok = input().strip().split()\nans = solve(n, k, is_ok)\nprint(*ans)\n\n", "n, k = map(int, input().split())\nwords = []\nfor i in range(ord('A'), ord('Z') + 1):\n for j in range(ord('a'), ord('z') + 1):\n words.append(chr(i) + chr(j))\n\nour = input().split()\n \nres = [i for i in range(n)]\nfor j in range(50):\n for i in range(len(our)):\n if our[i] == 'NO':\n res[i] = res[i + k - 1]\n\nfor elem in res:\n print(words[elem],end=' ')", "def name(n):\r\n\treturn chr(ord('A') + n % 26) + chr(ord('a') + n // 26)\r\n\r\ndef main():\r\n\tn, k = map(int, input().split())\r\n\tarr = list(map(str, input().split()))\r\n\tif (arr.count(\"YES\") == 0):\r\n\t\tfor i in range(n):\r\n\t\t\tprint(\"Max \", end = \"\")\r\n\t\treturn\r\n\tans = [\"\" for i in range(n)]\r\n\tx = arr.index(\"YES\")\r\n\tfor i in range(k):\r\n\t\tans[x + i] = name(i + x)\r\n\tfor i in range(x + 1, n - k + 1):\r\n\t\tif (arr[i] == \"YES\"):\r\n\t\t\tans[i + k - 1] = name(i + k - 1)\r\n\t\telse:\r\n\t\t\tans[i + k - 1] = ans[i]\r\n\r\n\r\n\tfor i in range(x - 1, -1, -1):\r\n\t\tif (arr[i] == \"YES\"):\r\n\t\t\tans[i] = name(i)\r\n\t\telse:\r\n\t\t\tans[i] = ans[i + k - 1]\r\n\tprint(*ans)\r\n\r\n\r\nmain()", "names = [chr(i + 65) + chr(j + 97) for i in range(26) for j in range(26)]\r\nn, m = map(int, input().split())\r\nans = names[:m - 1]\r\nj = m - 1\r\nk = 0\r\nfor i in input().split():\r\n if i == \"YES\":\r\n ans.append(names[j])\r\n j += 1\r\n else:\r\n ans.append(ans[k])\r\n k += 1\r\nprint(\" \".join(ans))", "def sToName(s):\n return 'A'+chr((s//26)+ord('a'))+chr(s%26+ord('a'))\n\nn,k = map(int,input().split())\na = list(map(lambda x:x=='YES',input().split()))\nd = [0]*n\ns=-1\nfor i in range(k-1):\n s+=1\n d[i]=s\nfor i in range(k-1,n):\n if a[i-k+1]:\n s+=1\n d[i]=s\n else:\n d[i]=d[i-k+1]\nprint(*list(map(lambda x:sToName(x),d)))\n\n\n", "\r\ndef genname(index):\r\n first = index//26\r\n second = index%26\r\n return chr(ord('A')+first)+''+chr(ord('a')+second)\r\n\r\n\r\n\r\n\r\nn, k = map(int,input().split())\r\ndecisions = input().split()\r\n\r\nnames = []\r\n\r\nfor i in range(k):\r\n names.append(genname(i))\r\n\r\nif decisions[0] == 'NO':\r\n names[0] = names[1]\r\n\r\n\r\nptr = 1\r\nnext = k+1\r\n\r\nfor d in decisions[1:]:\r\n if d == 'YES':\r\n names.append(genname(next))\r\n else:\r\n names.append(names[ptr])\r\n\r\n next += 1\r\n ptr += 1\r\n\r\n\r\nprint(' '.join(names))\r\n\r\n\r\n", "l = []\r\n\r\nfor i in range(65,91):\r\n l.append(chr(i))\r\n\r\n\r\nfor i in range(0,26):\r\n l.append(l[i]+l[i].lower())\r\n\r\n\r\n\r\nt = input().split()\r\n\r\nn = int(t[0])\r\nk = int(t[1])\r\n\r\n\r\nresp = input().split()\r\n\r\nans = []\r\n\r\nfor i in range(0,k-1):\r\n ans.append(l[i])\r\n\r\nj = k-1\r\n\r\nfor m in range(len(resp)):\r\n if (resp[m] == \"YES\"):\r\n ans.append(l[j])\r\n j+=1\r\n else:\r\n ans.append(ans[m])\r\n\r\nfor i in ans:\r\n print(i, end=\" \")\r\n\r\n\r\n\r\n\r\n\r\n", "from sys import stdin, stdout\r\nfrom itertools import combinations_with_replacement\r\n\r\nnames = [\r\n \"Alice\",\r\n \"Bob\",\r\n \"Charlie\",\r\n \"David\",\r\n \"Ella\",\r\n \"Frank\",\r\n \"Grace\",\r\n \"Henry\",\r\n \"Isabella\",\r\n \"Jack\",\r\n \"Katherine\",\r\n \"Liam\",\r\n \"Mia\",\r\n \"Noah\",\r\n \"Olivia\",\r\n \"Penelope\",\r\n \"Quinn\",\r\n \"Ryan\",\r\n \"Sophia\",\r\n \"Thomas\",\r\n \"Uma\",\r\n \"Victoria\",\r\n \"William\",\r\n \"Xavier\",\r\n \"Yasmine\",\r\n \"Zane\",\r\n \"Amelia\",\r\n \"Benjamin\",\r\n \"Chloe\",\r\n \"Daniel\",\r\n \"Emma\",\r\n \"Finn\",\r\n \"Georgia\",\r\n \"Hannah\",\r\n \"Isaac\",\r\n \"Julia\",\r\n \"Kai\",\r\n \"Lily\",\r\n \"Mason\",\r\n \"Nora\",\r\n \"Oliver\",\r\n \"Piper\",\r\n \"Quincy\",\r\n \"Riley\",\r\n \"Samuel\",\r\n \"Tessa\",\r\n \"Ulysses\",\r\n \"Violet\",\r\n \"Wyatt\",\r\n \"Xander\",\r\n \"Yara\",\r\n \"Zoe\"\r\n]\r\n\r\nread = stdin.readline\r\nwrite = stdout.write\r\n\r\ndef solve(n, k, strings):\r\n no = \"NO\"\r\n names_i = k\r\n strings_i = n - k + 1\r\n soldiers = names[:names_i - 1]\r\n while strings_i > 0:\r\n if strings[strings_i - 1] == no:\r\n soldiers.insert(0, soldiers[k - 2])\r\n else:\r\n soldiers.insert(0, names[names_i])\r\n names_i += 1\r\n strings_i -= 1\r\n return soldiers\r\n\r\nn, k = list(map(int, read().strip().split()))\r\nstrings = read().strip().split()\r\nanswer = \" \".join(solve(n, k, strings))\r\nwrite(answer + \"\\n\")\r\n", "l=['Aa','Ab','Ac','Ad','Ae','Af','Ag','Ah','Ai','Aj','Ak','Al','Am','An','Ao','Ap','Aq','Ar','As','At','Au','Av','Aw','Ax','Ay','Az','Aaa','Abb','Acc','Add','Aee','Aff','Agg','Ahh','Aii','Ajj','Akk','All','Amm','Ann','Aoo','App','Aqq','Arr','Ass','Att','Auu','Avv','Aww','Axx','Ayy']\r\nn,k=map(int,input().split())\r\nli=list(map(str,input().split()))\r\nlc=l[:n]\r\nfor i in range(len(li)):\r\n if li[i]==\"NO\":\r\n lc[i+k-1]=lc[i]\r\nfor i in lc:\r\n print(i,end=\" \")\r\n \r\n", "def main():\n n, k = map(int, input().split())\n res = ['AB'[i // 26] + chr(97 + i % 26) for i in range(n)]\n for i, w in enumerate(input().split()):\n if w == 'NO':\n res[i + k - 1] = res[i]\n print(*res)\n\n\nif __name__ == '__main__':\n main()\n", "\r\ndef getName(i) :\r\n\treturn chr((65 + i // 26)) + chr(97 + (i % 26))\r\n\r\nn, k = map(int, input().split())\r\ns = input().split()\r\n\r\nif k == 1 :\r\n\tfor i in range(n) :\r\n\t\tprint(getName(i), end = ' ')\r\nelse :\r\n\tres = [0] * (n)\r\n\tres[0] = getName(0)\r\n\tj = 1\r\n\tif s[0] == 'NO' :\r\n\t\tj = 0\r\n\tfor i in range(k - 1) :\r\n\t\tres[i + 1] = getName(j)\r\n\t\tj += 1\r\n\tfor i in range(1, n - k + 1) :\r\n\t\tif s[i] == 'YES' :\r\n\t\t\tres[i + k - 1] = getName(j)\r\n\t\t\tj += 1\r\n\t\telse :\r\n\t\t\tres[i + k - 1] = res[i]\r\n\tprint(' '.join(st for st in res))\r\n\r\n", "import string\r\n\r\nnames = []\r\nfor t in range(9):\r\n for i in range(26):\r\n l = string.ascii_uppercase[i]\r\n names.append(l + (l*t).lower())\r\n\r\ncurrent = []\r\n\r\nn, k = map(int, input().split())\r\nstat = input().split()\r\n\r\nif(stat[0] == \"YES\"):\r\n for i in range(k):\r\n current.append(names[i])\r\nelse:\r\n current.append(\"A\")\r\n for i in range(k - 2):\r\n current.append(names[i + 1])\r\n current.append(\"A\")\r\n\r\ncounter = 1\r\nfor item in stat[1:]:\r\n if(item == \"YES\"):\r\n current.append(names[counter + 100])\r\n else:\r\n current.append(current[counter])\r\n counter += 1\r\n\r\nprint(\" \".join(current))\r\n", "n,k=map(int,input().split())\r\na=input().split()\r\nl=[chr(i+65) if i<26 else 'A'+chr(i-26+97) for i in range(n)]\r\nfor i in range(n-k+1):\r\n\tl[i+k-1]= l[i] if a[i]=='NO' else l[i+k-1]\r\nprint(*l)", "n, k = map(int, input().split())\r\narr = input().split()\r\ncap = [chr(i+ord('A')) for i in range(26)]\r\nsml = [chr(i+ord('a')) for i in range(26)]\r\nres = []\r\nfor i in cap:\r\n for j in sml:\r\n res.append(i+j)\r\nfor i in range(n-k+1):\r\n if arr[i] == 'NO':\r\n res[i+k-1] = res[i]\r\nprint(*res[:n])\r\n", "n,k=map(int,input().split())\r\nl=list(map(str,input().split()))\r\nA=['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','Aa','Ab','Ac','Ad','Ae','Af','Ag','Ah','Ai','Aj','Ak','Al','Am','An','Ao','Ap','Aq','Ar','As','At','Au','Av','Aw','Ax','Ay','Az']\r\nans=[]\r\nfor i in range(k-1):\r\n ans.append(A[i])\r\ntemp1=0\r\ntemp2=k-1\r\nfor i in range(len(l)):\r\n if l[i]==\"YES\":\r\n ans.append(A[temp2])\r\n temp2+=1\r\n else:\r\n ans.append(ans[-k+1])\r\nprint(*ans) \r\n", "# Description of the problem can be found at http://codeforces.com/contest/771/problem/B\r\n\r\nn, k = map(int, input().split())\r\nl_o = input().split()\r\n\r\na_n = [\"A\"]\r\nfor i in range(1, n):\r\n diff = i - 25 if i >= 25 else 0 \r\n a_n += [chr(ord(\"A\") + i - (26 if diff != 0 else 0)) + (\"\" if diff == 0 else chr(ord(\"a\") + diff))]\r\n\r\nfor i in range(n - k + 1):\r\n if l_o[i] == \"NO\":\r\n a_n[i + k - 1] = a_n[i]\r\nprint(\" \".join(a_n))", "import math, sys, itertools\r\ndef main():\r\n\tn,k = map(int, input().split())\r\n\tlst = input().split()\r\n\td = []\r\n\tit = 0\r\n\titd = 0\r\n\tfor i in range(k):\r\n\t\tif (it>25):\r\n\t\t\titd+=1\r\n\t\t\tit = 0\r\n\t\td.append(chr(65+itd)+chr(97+it))\r\n\t\tit+=1\r\n\t\r\n\tans = []\r\n\tfor i in range(k-1):\r\n\t\tans.append(d.pop())\r\n\tfor i in range(k-1,n):\r\n\t\tif lst[i-(k-1)]==\"NO\":\r\n\t\t\tans.append(ans[i-(k-1)])\r\n\t\telse:\r\n\t\t\tans.append(d.pop())\r\n\t\t\td.append(ans[i-(k-1)])\r\n\tfor i in range(n):\r\n\t\tprint(ans[i], end=' ')\r\n\tprint()\r\n\t\t\t\r\n\t\r\n\t\t\r\nif __name__==\"__main__\":\r\n\tmain()\r\n" ]

[ "n,m,r=map(int,input().split());o=0\r\nwhile(m<n):\r\n m*=r;o+=1\r\nprint(o)\r\n", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\nimport time\nimport math\n\n(T, S, q) = (int(i) for i in input().split())\nstart = time.time()\n\nans = math.log(T/S, q)\nif int(ans) - ans != 0:\n ans = int(ans) + 1\nelse:\n ans = int(ans)\nprint(ans)\nfinish = time.time()\n#print(finish - start)\n", "t,s,q=map(int,input().split())\r\np=0\r\nwhile s<t:s=s*q;p+=1\r\nprint(p) ", "#print(\"Hello World!\")\r\nt,s,q = map(int,input().split())\r\ncount = 0\r\nwhile(s<t):\r\n s = s*q\r\n count +=1\r\nprint(count)", "info=list(map(int,input().split()))\r\nt=info[0]\r\ns=info[1]\r\nq=info[2]\r\nq=(q-1)/q\r\np=s\r\nans=0\r\nwhile p<t:\r\n\r\n p=p/(1-q)\r\n if ((int(p)+1)-p)<.005:\r\n p=int(p)+1\r\n ans+=1\r\n \r\nprint(ans) \r\n", "datos=input()\r\ndatos=datos.split(\" \")\r\nT=int(datos[0])\r\nS=int(datos[1])\r\nq=int(datos[2])\r\n\r\nplay=0\r\n\r\nwhile S<T:\r\n S=S*q\r\n play+=1\r\nprint(play)", "#!/usr/bin/env python\n# -*- coding: utf-8 -*-\n\nt, s, q = map(int, input().split())\n\nc = 0\nwhile s < t:\n s *= q\n c += 1\n\nprint(c)\n", "def solve(m,b,a):\r\n ans=0\r\n while b<m:\r\n ans+=1\r\n b*=a\r\n return ans\r\n\r\nm,b,a=map(int,input().split())\r\nprint(solve(m,b,a))\r\n", "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\nT, S, q = mints()\r\nr = 0\r\nwhile S < T:\r\n\tr += 1\r\n\tS += S*(q-1)\r\nprint(r)\r\n", "t,s,q = map(int,input().split())\r\ncount = 0\r\nwhile s < t:\r\n s *= q\r\n count += 1\r\nprint(count)", "T,S,q = map(int,input().split())\r\n\r\nr = 0\r\nwhile T > S :\r\n S *= q\r\n r += 1\r\nprint(r)\r\n", "t, s, q = map(int, input().split())\nlecture = 0\nsol = 1\npas = 1-1/q\npiste = s\nwhile piste < t:\n\tx = q*(piste-lecture)\n\tif piste+x*pas < t:\n\t\tsol += 1\n\t\tpiste += x*pas\n\t\tlecture = 0\n\telse:\n\t\tbreak\nprint(sol)\n", "def music(lst):\r\n count = 0\r\n while lst[1] < lst[0]:\r\n lst[1] *= lst[2]\r\n count += 1\r\n return count\r\n\r\n\r\nT, s, q = [int(i) for i in input().split()]\r\nprint(music(list((T, s, q))))\r\n", "ans = 0\r\nt, s, q = map(int,input().split())\r\n\r\nwhile s<t:\r\n s *= q\r\n ans += 1\r\n \r\nprint(ans)", "\r\nT,S,q = tuple(int(i) for i in input().split())\r\n\r\ncurrcount = 0\r\nwhile(S<T):\r\n\tS*=q\r\n\tcurrcount+=1\r\n\r\nprint(currcount)\r\n", "t,s,q=map(int,input().split(' '))\r\nres=0\r\nwhile(s<t):\r\n res+=1\r\n s*=q\r\nprint(res)", "t,s,q = map(int, input().split())\r\nans = 0\r\nwhile(s<t):\r\n s*=q\r\n ans+=1\r\nprint(ans)", "t, s, q = map(int, input().split())\r\nx = s\r\nans = 1\r\nwhile x < t:\r\n ans += 1\r\n x += (q - 1) * s\r\n s = x\r\nprint(ans - 1)", "T, t, q = map(int, input().split())\r\n\r\nn = 1\r\n\r\nwhile t < T:\r\n t += t * (q-1)\r\n if t < T:\r\n n += 1\r\nprint(n)\r\n", "t,s,q = map(int,input().split(\" \"))\r\n\r\ntek = 0\r\nv = (q-1)/q\r\nans = 1\r\n\r\nif t == 6562 and s == 1 and q == 3:\r\n print(9)\r\n exit(0)\r\n\r\nwhile tek < t:\r\n if tek + 1 >= s + v and s + v < t:\r\n ans += 1\r\n tek = 0\r\n s += v\r\n else:\r\n s += v\r\n tek += 1\r\nprint(ans)", "'''\r\nCreated on Apr 30, 2016\r\nGmail : [email protected]\r\n@author: Md. Rezwanul Haque\r\n'''\r\nT,S,q = map(int,(input().split()))\r\nans= 0\r\nwhile S<T:\r\n ans+=1\r\n S = S*q\r\nprint(ans)\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nT,S,q = map(int, input().split())\r\ncur = S\r\nans = 1\r\nwhile cur<T:\r\n seconds = cur*q\r\n cur=seconds\r\n #print(seconds)\r\n if cur>=T:break\r\n ans+=1\r\n \r\nprint(ans)\r\n\r\n\r\n", "import math\ndef main():\n read = lambda: tuple(map(int, input().split()))\n t, s, q = read()\n print(math.ceil(math.log(t/s,q)))\nmain()\n", "from math import ceil,log\r\nt,s,q=[int(i) for i in input().split()]\r\nprint (ceil(log(t/s,q)))", "t,s,q = map(int, input().split(\" \")); k = 0\r\nwhile s < t: s *=q; k +=1;\r\nprint(k)", "def music(T,S,q):\r\n n = 1\r\n while S*q**n < T:\r\n n += 1\r\n return n\r\n\r\nlist = list(map(int,input().split()))\r\nprint(music(list[0],list[1],list[2]))", "import sys\r\nimport random\r\nimport os\r\nt,s,q=input().split()\r\nt=int(t)\r\ns=int(s)\r\nq=int(q)\r\nans=0\r\nwhile(s<t):\r\n s=s*q\r\n ans+=1\r\nprint(ans)", "T, S, q = map(int, input().split())\r\ns = S*q\r\ncounter = 1\r\nwhile s < T:\r\n s*=q\r\n counter +=1\r\nprint(counter)\r\n", "import math\r\n\r\nT, S, q = map(int, input().split())\r\nprint(int(math.log((T - 1) / S) / math.log(q) + 1))\r\n", "t, s, q = map(int, input().split())\r\nans = 0\r\n\r\nwhile (s < t):\r\n s *= q\r\n ans += 1\r\nprint(ans)\r\n", "t,s,q=list(map(int,input().split(' ')))\r\nc=1\r\nwhile s<t:\r\n x=q*s-s\r\n s+=x\r\n c+=1\r\nprint(c-1)", "t,s,q=map(int,input().split())\r\nres=0\r\nwhile s<t:s*=q;res+=1\r\nprint(res)", "line = input()\r\n\r\nT, S, q = [int(i) for i in line.split(' ')]\r\n\r\ncount, total = 0, 1\r\nwhile S < T:\r\n S *= q\r\n count += 1\r\n\r\nprint(count)\r\n", "T, S, q = map(int, input().split())\r\nzap = 0\r\nwhile S < T:\r\n S = S*q\r\n zap += 1\r\nprint(zap)\r\n", "t, s, q = map(int, input().split())\r\nr = 1\r\nwhile t > s * q:\r\n s *= q\r\n r += 1\r\nprint(r)\r\n \r\n", "import math, os, sys\r\nimport string, re\r\n\r\nfrom itertools import *\r\nfrom collections import Counter\r\nfrom operator import mul\r\n\r\ndef inputint():\r\n return int(input())\r\n\r\ndef inputarray(func=int):\r\n return map(func, input().split())\r\n\r\ndef inputarray2(n, func=int):\r\n for _ in range(n):\r\n yield func(input())\r\n\r\nT, S, q = inputarray()\r\ni, g = 0, S\r\nwhile g < T:\r\n i = i + 1\r\n g = g + (q - 1)*g\r\n\r\n\r\nprint(i)\r\n", "import sys\r\nfrom bisect import bisect, insort\r\nfrom collections import Counter, OrderedDict, defaultdict, deque\r\nfrom functools import cache, lru_cache, reduce\r\nfrom heapq import heapify, heappop, heappush, nlargest\r\nfrom itertools import accumulate, combinations, permutations, product, repeat\r\nfrom math import ceil, floor, gcd, hypot, lcm, log, sqrt\r\n\r\nsys.setrecursionlimit(10**5)\r\ndef input(): return sys.stdin.readline().strip('\\r\\n')\r\ndef pyint(): return int(input())\r\ndef pyline(): return map(int, input().split())\r\ndef pylist(): return list(map(int, input().split()))\r\n\r\n\r\nT, S, q = pyline()\r\n\r\ncount = 0\r\nwhile S < T:\r\n S *= q\r\n count += 1\r\n\r\nprint(count)\r\n", "T,S,q=map(int,input().split())\r\nans=1\r\np=0\r\nwhile True:\r\n S=S+(q-1)\r\n p+=q\r\n #rint(S,p) \r\n if S>=T: break\r\n if p>=S: p=0; ans+=1\r\n \r\nprint(ans)\r\n ", "t, s, q = [int(i) for i in input().split()]\r\na = 1\r\nl = 0\r\nwhile t > s:\r\n l += q\r\n l = min(l, t)\r\n s += q - 1\r\n s = min(s, t)\r\n if l >= s and s != t:\r\n a += 1\r\n l = 0\r\nprint(a)\r\n", "t, s, q = [int(i) for i in input().split()]\r\nc = (q - 1) / q\r\ncnt = 1\r\ntime = s\r\nwhile True:\r\n time = time / (1 - c)\r\n if t - time <= 0.0001:\r\n break\r\n cnt += 1\r\nprint(cnt)", "T, S, q = map(int, input().split())\r\np = S\r\nr = 0\r\nwhile p < T:\r\n r += 1\r\n p *= q\r\nprint(r)\r\n", "t,s,q=map(int,input().split(\" \"))\r\nans=0\r\nwhile s<t:\r\n s*=q\r\n ans+=1\r\nprint(ans)\r\n", "T, S, q = map(int, input().split())\r\nans = 0\r\nwhile S < T:\r\n S *= q\r\n ans += 1\r\nprint(ans)", "__author__ = 'Алексей'\n\nT, S, q = map(int, input().split())\n\ncnt, total = 1, q*S\nwhile total < T:\n cnt += 1\n total *= q\n\nprint(cnt)", "def main():\n t, s, q = map(int, input().split())\n res = 0\n while s < t:\n s *= q\n res += 1\n print(res)\n\n\nif __name__ == '__main__':\n main()\n", "t, s, q = [int(i) for i in input().split()]\nc = (q - 1) / q\ncnt = 1\ntime = s\nwhile True:\n time = time / (1 - c)\n if t - time <= 0.0001:\n break\n cnt += 1\nprint(cnt)", "T,S,q=map(int,input().split())\r\nsum = 0;\r\nwhile S < T:\r\n S *= q\r\n sum += 1\r\nprint(sum)", "\n\nt, s, q = map(int, input().split())\nans = 1\n\nwhile True:\n x = s * q\n if x >= t:\n break\n\n ans += 1\n s = x\n\nprint(ans)\n", "(T, S, q) = (int(token) for token in input().split())\nout = 0\nwhile S <= T:\n S = q*S\n out += 1\n if S == T:\n break\nprint(out)", "def mp(): return map(int,input().split())\r\ndef lt(): return list(map(int,input().split()))\r\ndef pt(x): print(x)\r\ndef ip(): return input()\r\ndef it(): return int(input())\r\ndef sl(x): return [t for t in x]\r\ndef spl(x): return x.split()\r\ndef aj(liste, item): liste.append(item)\r\ndef bin(x): return \"{0:b}\".format(x)\r\ndef 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\nt,s,q = mp()\r\n\r\ntime = 0\r\nwhile s < t:\r\n s *= q\r\n time += 1\r\nprint(time)\r\n ", "a,b,c=map(int,input().split())\r\nans=1\r\nt=1/c\r\nt1=b/t\r\nwhile a>t1 :\r\n ans+=1\r\n b=t1\r\n t1=b/t\r\nprint(ans)\r\n \r\n", "T, S, q = map(int, input().split())\r\nans = 0\r\nx = 0\r\n\r\nwhile x < T:\r\n x = S * q\r\n S = x\r\n ans += 1\r\n\r\nprint(ans)", "t, s, q = map(int, input().split())\r\n\r\np = s\r\n\r\nres = 0\r\nwhile p < t:\r\n p *= q\r\n res += 1\r\n\r\nprint(res)\r\n\r\n", "\r\n\r\nt,s,q= map(int,input().split(\" \"))\r\nj=0\r\nwhile s<t:\r\n s*=q\r\n j+=1;\r\nelse:\r\n print(j)\r\n\r\n\r\n\r\n", "T, S, q = map(int, input().split())\r\ncount = 0\r\nwhile True:\r\n count += 1\r\n ds = S * (q - 1)\r\n S += ds\r\n if S >= T:\r\n break\r\nprint(count)", "t,s,q = map(int,input().split())\r\nans = 1\r\nfor i in range(t):\r\n s += s*(q-1)\r\n if s < t:\r\n ans += 1\r\n else:\r\n break\r\nprint(ans)", "dur, downloaded, sec = map(int, input().split())\r\n# dur - ����������������� �����\r\n# first_sec - ������ ������� ����.\r\ntimes = 0\r\nwhile downloaded < dur:\r\n downloaded*= sec # ��� ���������� �� �������\r\n times+=1\r\nprint(times)", "t,s,q=map(int, input().split())\r\nans=1\r\nfor i in range(t):\r\n s+=s*(q-1)\r\n if s<t:\r\n ans+=1\r\n else:\r\n break\r\nprint(ans)\r\n", "#!/usr/bin/env python3\nimport collections, itertools, functools, math, fractions\n\ndef solve():\n T, S, q = map(int, input().split())\n\n r = 0\n down = S\n while down < T:\n down *= q\n r += 1\n\n return r\n\n\n\nif __name__ == '__main__':\n print(solve())\n\n", "t, s, q = map(int, input().split())\r\ncnt = 0\r\n\r\nwhile s < t:\r\n s = s * q\r\n cnt += 1\r\nprint(cnt)\r\n\r\n\r\n", "t,s,q = [int(x) for x in input().split()]\r\na = 0\r\nwhile s<t:\r\n s = s*q\r\n a = a+1\r\nprint(a)", "tsq = input().split(' ')\nt=int(tsq[0])\ns=int(tsq[1])\nq=int(tsq[2])\nans = 0\n\nwhile s < t:\n ans += 1\n s *= q\n\nprint(ans)\n", "t,s,q=map(int,input().split())\ninit=q \ncount=1\nwhile(init<t/s):\n init=init*q\n count=count+1\nprint(count)", "# LUOGU_RID: 112645722\n[t, s, q] = [int(x) for x in input().split()]\nmid, ans = 0, 0\nwhile s < t:\n s *= q\n ans += 1\nprint(ans)", "a,b,c = map(int,input().split())\r\ns = 0\r\nwhile b < a :\r\n s+=1\r\n b *= c\r\n\r\nprint(s)\r\n", "t, s, q = map(int, input().split())\r\nc = s\r\nans = 1\r\nwhile s < t:\r\n s += q - 1\r\n c -= 1\r\n if c == 0 and s < t:\r\n ans += 1\r\n c = s\r\nprint(ans)\r\n", "\"\"\"\r\n\tAuthor\t\t: Arif Ahmad\r\n\tDate \t\t: \r\n\tAlgo \t\t: \r\n\tDifficulty\t: \r\n\"\"\"\r\n\r\ndef main():\r\n\tt, s, q = map(int, input().split())\r\n\r\n\tans = 0\r\n\twhile s < t:\r\n\t\ts *= q\r\n\t\tans += 1\r\n\r\n\tprint(ans)\r\n\r\nif __name__ == '__main__':\r\n main()\r\n \r\n", "T,S,q = map(int,input().split())\r\nn = 0\r\nwhile S < T:\r\n\tS = S*q\r\n\tn = n+1\r\nprint(n)", "SS = input().split()\r\n\r\n\r\nT = int(SS[0])\r\nS = int (SS[1])\r\nq = int(SS[2])\r\n\r\na = 0;\r\n\r\nwhile(S<T):\r\n\tS = S + S*(q-1)\r\n\ta+=1\r\n\r\n\t\r\nprint(a)\r\n", "import math\r\nt,s,q = map(int,input().split())\r\na=0\r\nc=0\r\ntim=a\r\nwhile t>s:\r\n s=s*q\r\n a+=1\r\nprint(a) \r\n", "T, S, q = [int(i) for i in input().split(' ')]\r\n\r\nres = 1\r\n\r\nloaded = S\r\nwhile loaded*q < T:\r\n loaded = loaded*q\r\n res+=1\r\nprint(res)", "#!/usr/bin/python3\nt,s,q=map(int,input().split())\nd=0\nres=0\nwhile True:\n res+=1\n s=q*s\n if s>=t:\n break\nprint(res) \n \n \n \n", "T,S,q = map(int,input().split())\r\nans = 0\r\nwhile S<T:\r\n ans+=1\r\n S*=q\r\nprint(ans)", "T, S, q = map(int, input().split())\r\nv = 1\r\nwhile T > q * S:\r\n S += (q - 1) * S\r\n v += 1\r\nprint(v)", "t, s, q = map(int, input().split())\r\nans = 1\r\nwhile s * q < t:\r\n ans += 1\r\n s *= q\r\nprint(ans)", "T, S, q = map(int, input().split())\ncount = 0\nwhile S < T:\n S *= q\n count += 1\nprint(count)\n", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\nimport time\nimport math\n\n(T, S, q) = (int(i) for i in input().split())\nstart = time.time()\n\nans = math.ceil(math.log(T/S, q))\nprint(ans)\n#finish = time.time()\n#print(finish - start)\n", "T,S,q = map(int,input().split())\r\nt,con = 0,S\r\nwhile S<T:\r\n S += con*(q-1)\r\n con = S\r\n t += 1\r\nprint(t)", "t, s, q = map(int, input().split(\" \"))\nans = 0\nwhile s < t:\n ans += 1\n s = s * q\n \nprint (ans)\n\n\n", "a,b,c=map(int,input().split())\r\no=0\r\nwhile b<a:b*=c;o+=1\r\nprint(o)", "t, s, q = map(int, input().split())\r\n\r\nc = 0\r\nwhile s < t:\r\n s = s / (1 / q)\r\n c += 1\r\n\r\nprint(c)", "import math\nT,S,q=map(int,input().split())\nprint(math.ceil(math.log(T/S,q)))\n", "t, s, q = map(int, input().split())\r\nr = 0\r\nwhile s < t:\r\n s *= q\r\n r += 1\r\nprint(r)\r\n", "t, s, q = map(int, input().split())\r\ni = 0\r\nwhile(s < t):\r\n s *= q; i += 1\r\nprint(i)", "t, s, q = list(map(int, input().split()))\r\nc = 0\r\nwhile s < t:\r\n s *= q\r\n c += 1\r\nprint(c)\r\n", "t,s,q = input().split()\r\nt=int(t)\r\ns=int(s)\r\nq=int(q)\r\nr=s\r\nm=1\r\nwhile(r<t):\r\n r=r*q\r\n if(r<t):\r\n m+=1\r\nprint(m)\r\n", "from math import ceil,log\r\na,b,c=map(int,input().split())\r\nprint(ceil(log(a/b,c)))\r\n", "t,s,q=input().split()\r\nt=int(t)\r\ns=int(s)\r\nq=int(q)\r\ncount=0\r\nwhile(s<t):\r\n s*=q\r\n count+=1\r\n\r\nprint(count)", "t,s,q=[int(j) for j in input().split()]\r\nk=s\r\nans=0\r\nq=q-1\r\nwhile k<t:\r\n k=k+(k*q)\r\n ans=ans+1\r\nprint(ans)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nT, S, q = map(int, input().split())\r\nc = 1\r\na = S*q\r\nwhile a < T:\r\n c += 1\r\n a *= q\r\nprint(c)", "t, s, q = list(map(int,input().split()))\na = 0\nwhile s < t:\n s *= q\n a += 1\nprint(a)\n", "t,s,q = map(int, input().split())\r\nplay = 0\r\nwhile s < t:\r\n s = s * q\r\n play += 1\r\nprint(play)\r\n" ]

[ "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).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\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 _ in range(n - 1):\r\n u, v, w = map(int, input().split())\r\n x = [0] * 10\r\n for j in str(w):\r\n x[int(j)] = 1\r\n ok = 1\r\n for j in range(10):\r\n if j ^ 4 and j ^ 7 and x[j]:\r\n ok = 0\r\n break\r\n if not ok:\r\n unite(u, v)\r\nans = 0\r\nfor i in range(1, n + 1):\r\n if i ^ get_root(i):\r\n continue\r\n u = get_size(i)\r\n v = n - u\r\n ans += u * v * (v - 1)\r\nprint(ans)", "from heapq import heappush, heappop, heapify\r\nfrom collections import defaultdict, Counter, deque\r\nfrom functools import lru_cache\r\nimport threading\r\nimport sys\r\nimport bisect\r\ninput = sys.stdin.readline\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\n# threading.stack_size(10**8)\r\n# sys.setrecursionlimit(10**6)\r\n\r\n\r\nclass UnionFind:\r\n def __init__(self, n):\r\n self.parent = list(range(n))\r\n self.size = [1] * 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 if self.find(b) != self.find(a):\r\n self.size[self.find(a)] += self.size[self.find(b)]\r\n self.parent[self.find(b)] = self.find(a)\r\n\r\n def getSize(self, a):\r\n return self.size[self.find(a)]\r\n\r\n\r\ndef main():\r\n n = ri()\r\n d = UnionFind(n+1)\r\n for _ in range(n-1):\r\n u, v, w = rl()\r\n c = Counter(str(w))\r\n if c['4']+c['7'] != len(str(w)):\r\n d.merge(u, v)\r\n res = 0\r\n for i in range(1, n+1):\r\n tc = n-d.getSize(i)\r\n res += tc*(tc-1)\r\n print(res)\r\n\r\n\r\n# for _ in range(ri()):\r\nmain()\r\n# threading.Thread(target=main).start()\r\n" ]

[ "#391_A\n\nst = list(input())\n\n#B = 1, u = 2, l = 1, b = 1, a = 2, s = 1, r = 1\n\ndct = {\"B\": 0, \"u\": 0, \"l\": 0, \"b\": 0, \"a\": 0, \"s\": 0, \"r\": 0}\n\nfor i in range(0, len(st)):\n if st[i] in dct:\n dct[st[i]] += 1\n\nn = min(dct[\"B\"], dct[\"u\"] // 2, dct[\"l\"], dct[\"b\"], dct[\"a\"] // 2, dct[\"s\"], dct[\"r\"])\nprint(n)\n", "s = input()\r\n\r\nt = [0, 0, 0, 0, 0, 0, 0]\r\n\r\nfor i in s:\r\n if i == 'B':\r\n t[0] += 1\r\n elif i == 'a':\r\n t[1] += 1\r\n elif i == 'b':\r\n t[2] += 1\r\n elif i == 'l':\r\n t[3] += 1\r\n elif i == 'r':\r\n t[4] += 1\r\n elif i == 's':\r\n t[5] += 1\r\n elif i == 'u':\r\n t[6] += 1\r\n\r\nt[1] = t[1] // 2\r\nt[6] = t[6] // 2\r\n\r\nprint(min(t))\r\n", "i=input()\r\nprint(min(i.count(\"B\"),i.count(\"u\")//2,i.count(\"l\"),i.count(\"a\")//2,i.count(\"s\"),i.count(\"r\"),i.count(\"b\")))", "string = input()\r\ncheck = \"Bulbasaur\"\r\nres = 1000000000000000\r\nfor x in check:\r\n res = min(res,string.count(x)//check.count(x))\r\nprint(res) \r\n", "def solve(data: list) -> int:\r\n now = 0\r\n target = \"auBlbsr\"\r\n memo = [0] * 7\r\n cnt = 0\r\n for i in range(len(data)):\r\n for j in range(len(target)):\r\n if data[i] == target[j]:\r\n memo[j] += 1\r\n \r\n memo[0] //= 2\r\n memo[1] //= 2\r\n return(min(memo))\r\n \r\ndata = list(input())\r\nprint(solve(data))\r\n\r\n \r\n\r\n \r\n ", "# @author Matheus Alves dos Santos\n\nletters = input()\ncounter = [0, 0, 0, 0, 0, 0, 0]\n\nfor c in letters:\n if (c == 'B'):\n counter[0] += 1\n elif (c == 'u'):\n counter[1] += 1\n elif (c == 'l'):\n counter[2] += 1\n elif (c == 'b'):\n counter[3] += 1\n elif (c == 'a'):\n counter[4] += 1\n elif (c == 's'):\n counter[5] += 1\n elif (c == 'r'):\n counter[6] += 1\n\ncounter[1] //= 2\ncounter[4] //= 2\n\nprint(min(counter))\n", "word=list(input())\r\nmy=\"Bulbasaur\"\r\ncounterB=0 #1 B\r\ncounteru=0 #2 u\r\ncounterl=0 #1 l\r\ncountera=0 #2 a\r\ncounters=0 #1 s\r\ncounterr=0 #1 r\r\ncounterb=0 #1 b\r\nif len(word)<len(my):\r\n print(0)\r\nelse :\r\n for i in word :\r\n if i ==\"B\":\r\n counterB+=1\r\n elif i == \"u\":\r\n counteru+=1\r\n elif i ==\"l\":\r\n counterl+=1\r\n elif i ==\"a\":\r\n countera+=1\r\n elif i ==\"s\":\r\n counters+=1\r\n elif i==\"r\":\r\n counterr+=1\r\n elif i==\"b\":\r\n counterb+=1\r\n counteru //=2\r\n countera //=2\r\n print(min(counterB,counteru,counterl,countera,counters,counterr,counterb))", "cnt = [0] * 256\r\nans = 0\r\n\r\nfor c in input():\r\n cnt[ord(c)] += 1\r\nwhile True:\r\n for c in 'Bulbasaur':\r\n cnt[ord(c)] -= 1\r\n if (cnt[ord(c)] < 0):\r\n print(ans);exit()\r\n ans += 1\r\n", "s = input()\r\nmas = [0, 0, 0, 0, 0, 0, 0]\r\n\r\nfor i in s:\r\n\tif i == 'B':\r\n\t\tmas[0] += 1\r\n\telif i == 'u':\r\n\t\tmas[1] += 1\r\n\telif i == 'l':\r\n\t\tmas[2] += 1\r\n\telif i == 'b':\r\n\t\tmas[3] += 1\r\n\telif i == 'a':\r\n\t\tmas[4] += 1\r\n\telif i == 's':\r\n\t\tmas[5] += 1\r\n\telif i == 'r':\r\n\t\tmas[6] += 1\r\n\t\t\r\nmas[1] = mas[1] // 2\r\nmas[4] = mas[4] // 2\r\nprint(min(mas))\r\n", "w = input()\r\nc = [w.count(l) for l in \"Bulbasr\"]\r\nc[1] //= 2\r\nc[4] //= 2\r\nprint(min(c))", "from collections import Counter\r\n\r\nc, pattern = Counter(input()), 'Bulbasaur'\r\n\r\nprint(min(c[ch] // pattern.count(ch) for ch in set(pattern)))", "s=input()\r\ncnt=0\r\nl=['B','b','u','l','a','s','r']\r\nres=[]\r\nfor i in range(7):\r\n res.append(s.count(l[i]))\r\nwhile res[0]>=1 and res[1]>=1 and res[2]>=2 and res[3]>=1 and res[4]>=2 and res[5]>=1 and res[6]>=1:\r\n res[0]-=1\r\n res[1]-=1\r\n res[2]-=2\r\n res[3]-=1\r\n res[4]-=2\r\n res[5]-=1\r\n res[6]-=1\r\n cnt+=1\r\nprint(cnt)\r\n", "\r\n# Bulbasaur\r\n\r\ndct={'B':0, 'u':0, 'l':0, 'b':0, 'a':0, 's':0, 'r':0}\r\n\r\n#s='aBddulbasaurrgndgbualdBdsagaurrgndbb'\r\n\r\ns=input()\r\nfor c in s :\r\n\tif c in dct :\r\n\t\tdct[c]+=1\r\n\r\ndct['a']=dct['a']//2\r\ndct['u']=dct['u']//2\r\n\r\nprint(min(dct.values()))\r\n", "s1=input()\r\nif(len(s1)<9):\r\n print(0)\r\nelse:\r\n B=s1.count('B')\r\n a=s1.count('a')\r\n u=s1.count('u')\r\n l=s1.count('l')\r\n b=s1.count('b')\r\n s=s1.count('s')\r\n r=s1.count('r')\r\n print(min(B,u//2,l,b,a//2,s,r))", "bulba=input()\r\nB=bulba.count('B')\r\nu=bulba.count('u')//2\r\nl=bulba.count('l')\r\nb=bulba.count('b') \r\na=bulba.count('a')//2\r\ns=bulba.count('s')\r\nr=bulba.count('r')\r\nprint(min(B,u,l,b,a,s,r))", "s = input()\r\n\r\ncount = {'B':0, 'u':0, 'l':0, 'b':0, 's':0, 'a':0, 'r':0}\r\n\r\nfor i in range(len(s)):\r\n if s[i] in count:\r\n count[s[i]]+=1\r\n\r\ncount['a'] = int(count['a']/2)\r\ncount['u'] = int(count['u']/2)\r\nmyList = count.values()\r\nprint(min(myList))", "l = input()\r\nw = [0,0,0,0,0,0,0]\r\nfor i in range(len(l)):\r\n if l[i] == 'B':\r\n w[0] = w[0] + 1\r\n elif l[i] == 'u':\r\n w[1] = w[1] + 1\r\n elif l[i] == 'l':\r\n w[2] = w[2] + 1\r\n elif l[i] == 'b':\r\n w[3] = w[3] + 1\r\n elif l[i] == 'a':\r\n w[4] = w[4] + 1\r\n elif l[i] == 's':\r\n w[5] = w[5] + 1\r\n elif l[i] == 'r':\r\n w[6] = w[6] + 1\r\nw[1] = w[1] // 2\r\nw[4] = w[4] // 2\r\nprint (min(w))", "S = input()\n\ncomp = \"Bulbasaur\"\nnB = S.count(\"B\")\nnu = S.count(\"u\")\nnl = S.count(\"l\")\nnb = S.count(\"b\")\nna = S.count(\"a\")\nns = S.count(\"s\")\nnr = S.count(\"r\")\nans = min(nB, nu // 2, nl, nb, na // 2, ns, nr)\nprint(ans)\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ns = list(input().rstrip())\r\nx = list(\"Bulbasaur\")\r\nc1, c2 = [0] * 130, [0] * 130\r\nfor i in s:\r\n c1[i] += 1\r\nfor i in x:\r\n c2[ord(i)] += 1\r\nans = len(s)\r\nfor i, j in zip(c1, c2):\r\n if not j:\r\n continue\r\n ans = min(ans, i // j)\r\nprint(ans)", "import collections\r\n\r\ntext = str(input())\r\n\r\nDetail = collections.Counter(text)\r\nDetail['u'] = int(Detail['u']/2)\r\nDetail['a'] = int(Detail['a']/2)\r\n\r\nprint(min(Detail['B'],Detail['u'],Detail['l'],Detail['b'],Detail['a'],Detail['s'],Detail['r']))\r\n", "S = [0] * 7\r\n\r\nN = input()\r\n\r\nfor n in N:\r\n if n == 'B':\r\n S[0] += 1\r\n elif n == 'b':\r\n S[1] += 1\r\n elif n == 'u':\r\n S[2] += 1\r\n elif n == 'l':\r\n S[3] += 1\r\n elif n == 's':\r\n S[4] += 1\r\n elif n == 'a':\r\n S[5] += 1\r\n elif n == 'r':\r\n S[6] += 1\r\n\r\nS[5] //= 2\r\nS[2] //= 2\r\nprint(min(S))", "s=input()\r\nbb=0\r\nu=0\r\nl=0\r\nb=0\r\na=0\r\nss=0\r\nr=0\r\nfor i in s:\r\n if i=='B':\r\n bb+=1\r\n elif i=='u':\r\n u+=1\r\n elif i=='l':\r\n l+=1\r\n elif i=='b':\r\n b+=1\r\n elif i=='a':\r\n a+=1\r\n elif i=='s':\r\n ss+=1\r\n elif i=='r':\r\n r+=1\r\nu=u//2\r\na=a//2\r\nmi1=min(bb,u)\r\nmi2=min(l,b)\r\nmi1=min(mi1,mi2)\r\nmi3=min(a,ss)\r\nmi2=min(mi2,mi3)\r\nmi3=min(mi1,mi2)\r\nans=min(mi3,r)\r\nprint(ans)\r\n", "import sys\ninput = sys.stdin.readline\n\nn = input()\n\nB = n.count('B')\nu = n.count('u')//2\nl = n.count('l')\nb = n.count('b')\na = n.count('a')//2\ns = n.count('s')\nr = n.count('r')\n\nprint(min(B,u,l,b,a,s,r))\n\n \t\t\t\t\t \t \t\t\t \t\t\t\t \t\t \t \t", "base_freq = {}\r\nfor x in 'Bulbasaur':\r\n base_freq[x] = base_freq.get(x, 0) + 1\r\nfreq = {}\r\nfor x in input():\r\n freq[x] = freq.get(x, 0) + 1\r\nans = min([freq.get(key, 0) // base_freq[key] for key in base_freq])\r\nprint(ans)", "Bb = input()\r\nx = 'Bulbasaur'\r\nls = ['B', 'b', 'u', 'l', 'a', 'r', 's']\r\nm = []\r\n\r\nfor c in ls:\r\n y = Bb.count(c) // x.count(c)\r\n m.append(y)\r\n\r\nk = min(m)\r\n\r\nprint(k)", "st = input()\r\ncb = st.count('B')\r\nu = st.count('u') // 2\r\nl = st.count('l')\r\nb = st.count('b')\r\na = st.count('a') // 2\r\ns = st.count('s')\r\nr = st.count('r')\r\nprint(min(cb, u, l, b, a, s, r))\r\n", "def main(my_string):\r\n freq = [0, 0, 0, 0, 0, 0, 0]\r\n for c in my_string:\r\n if c == 'B':\r\n freq[0] = freq[0] + 1\r\n elif c == 'u':\r\n freq[1] = freq[1] + 1\r\n elif c == 'l':\r\n freq[2] = freq[2] + 1\r\n elif c == 'b':\r\n freq[3] = freq[3] + 1\r\n elif c == 'a':\r\n freq[4] = freq[4] + 1\r\n elif c == 's':\r\n freq[5] = freq[5] + 1\r\n elif c == 'r':\r\n freq[6] = freq[6] + 1\r\n if freq[1] > 0:\r\n freq[1] = freq[1] // 2\r\n if freq[4] > 0:\r\n freq[4] = freq[4] // 2\r\n return min(freq)\r\n\r\n\r\nif __name__ == '__main__':\r\n my_string = input()\r\n print(main(my_string))", "s = list(input())\r\na = [0]*7\r\nfor i in range(len(s)):\r\n if s[i] == 'B':\r\n a[0] += 1\r\n elif s[i] == 'u':\r\n a[1] += 1\r\n elif s[i] == 'l':\r\n a[2] += 1\r\n elif s[i] == 'b':\r\n a[3] += 1\r\n elif s[i] == 'a':\r\n a[4] += 1\r\n elif s[i] == 's':\r\n a[5] += 1\r\n elif s[i] == 'r':\r\n a[6] += 1\r\nres = 0\r\na[4] = a[4]//2\r\na[1] = a[1]//2\r\nres += min(a)\r\nprint(res)", "x=input()\r\nB=0\r\nu=0\r\nl=0\r\nb=0\r\na=0\r\ns=0\r\nr=0\r\nfor i in x:\r\n if i == \"B\":\r\n B+=1\r\n elif i == \"u\":\r\n u+=1\r\n elif i == \"l\":\r\n l+=1\r\n elif i == \"b\":\r\n b+=1\r\n elif i == \"a\":\r\n a+=1\r\n elif i == \"s\":\r\n s+=1\r\n elif i == \"r\":\r\n r+=1\r\n# Bulbasaur\r\npokemons=0\r\nwhile B>=1 and u>=2 and l>=1 and b>=1 and a>=2 and s>=1 and r>=1:\r\n pokemons+=1\r\n B-=1\r\n u-=2\r\n l-=1\r\n b-=1\r\n a-=2\r\n s-=1\r\n r-=1\r\nprint(pokemons)", "# https://codeforces.com/problemset/problem/757/A\n\nstring = input()\ncount_B = string.count('B')\ncount_u = string.count('u')\ncount_l = string.count('l')\ncount_b = string.count('b')\ncount_a = string.count('a')\ncount_s = string.count('s')\ncount_r = string.count('r')\n\n# print(count_B, count_u/2, count_l, count_b, count_a/2, count_s, count_u, count_r)\nprint(min(count_B, int(count_u/2), count_l, count_b, int(count_a/2), count_s, count_u, count_r))\n\n", "from collections import Counter\r\ns = Counter({'B': 0, 'u': 0, 'l': 0, 'b': 0, 'a': 0, 's': 0, 'r': 0})\r\ns.update(input())\r\nprint(min(s['B'], s['u']//2, s['l'], s['b'], s['a']//2, s['s'], s['r']))", "\"\"\"\nhttps://codeforces.com/problemset/problem/757/A\n\"\"\"\nchaine=input()\ndico=dict()\nfor c in chaine:\n if c in 'Bulbasaur':\n dico[c]=dico.get(c,0)+1\n\nmini=1e16\nfor c in 'Bulbasaur':\n k = dico.get(c,0)\n if c in 'au':\n k=k//2\n if k<mini:\n mini=k\n\nprint(mini)\n", "chrs = {\r\n 'u' : 0,\r\n 'B' : 0,\r\n 'l' : 0,\r\n 'b' : 0,\r\n 'a' : 0,\r\n 's' : 0,\r\n 'r' : 0\r\n}\r\n\r\ndef func(ch):\r\n if ch in chrs.keys():\r\n chrs[ch] += 1\r\n\r\nstr = input()\r\n\r\nfor i in list(str):\r\n func(i)\r\n\r\nchrs['u'] /= 2\r\nchrs['a'] /= 2\r\n\r\nprint(int(min(chrs.values())))", "inn = input()\n\n# Bulbasaur\n\nB = inn.count('B')\nu = inn.count('u') // 2\nl = inn.count('l')\nb = inn.count('b')\na = inn.count('a') // 2\ns = inn.count('s')\nr = inn.count('r')\n\nprint(min(B,u,l,b,a,s,r))", "s = input()\n\npattern = \"Bulbasaur\"\n\ncnt_of_each_letter = []\n\nfor letter in pattern:\n cnt = s.count(letter)\n if letter == \"u\" or letter == \"a\":\n cnt //= 2\n cnt_of_each_letter.append(cnt)\n\nprint(min(cnt_of_each_letter))", "s = str(input())\r\nseen = {}\r\nneed = \"Bulbasaur\"\r\nto_check = set(need)\r\n\r\nfor i in s:\r\n if i in to_check and i not in seen:\r\n seen[i] = 1\r\n elif i in to_check and i in seen:\r\n seen[i] += 1\r\n\r\nif len(seen) != 7:\r\n print(0)\r\nelse:\r\n letter_u_check = seen[\"u\"] // 2\r\n letter_a_check = seen[\"a\"] // 2\r\n minimumLetter = min(seen.values())\r\n print(min(letter_a_check, letter_u_check, minimumLetter))", "s = input()\r\na, b, c, d, e, f, g = s.count('B'), s.count('b'), s.count('l'), s.count('r'), s.count('s'), s.count('u') // 2, s.count('a') // 2 \r\nprint(min(a,b,c,d,e,f,g))\r\n", "s,t=input(),\"Bulbasaur\"\r\nprint(min([s.count(c)//t.count(c) for c in t]))", "s=input()\r\nj=[]\r\nd={\r\n\t\"B\":0,\r\n\t\"b\":0,\r\n\t\"u\":0,\r\n\t\"a\":0,\r\n\t\"l\":0,\r\n\t\"s\":0,\r\n\t\"r\":0\r\n}\r\nfor i in range(len(s)):\r\n\tif s[i] in d:\r\n\t\td[s[i]]+=1\r\nfor i in d:\r\n\tif i==\"a\" or i==\"u\":\r\n\t\tj.append(d[i]//2)\r\n\telse:\r\n\t\tj.append(d[i])\r\nprint(min(j))\r\n", "s=input()\r\nt=\"Bulbasaur\"\r\nprint(min([s.count(c)//t.count(c) for c in t]))", "import collections\r\ns = input()\r\ncs = collections.Counter(s)\r\ncs1 = collections.Counter(\"Bulbasaur\")\r\nans = len(s)\r\nfor k,v in cs1.items():\r\n ans = min(ans,cs[k]//v)\r\nprint(ans)\r\n", "n=input()\r\ndic={i:0 for i in \"Bulbasaur\"}\r\nfor i in n:\r\n if i in \"Bulbasaur\":\r\n dic[i]+=1\r\ndic['u']=dic['u']//2\r\ndic['a']=dic['a']//2\r\nprint(min(dic.values())) \r\n", "from collections import Counter\r\n\r\nsrc = Counter(list(input()))\r\ntgt = Counter(list('Bulbasaur'))\r\nfor c in tgt.keys():\r\n if c not in src: \r\n src[c] = 0\r\nres = min(src[k] // v for k, v in tgt.items())\r\nprint(res)", "s= input()\r\nd = {}\r\nfor c in \"Bulbasaur\":\r\n d[c] = 0\r\n\r\nfor c in s:\r\n if c in d:\r\n d[c]+=1\r\n\r\nans = float('inf')\r\nfor c in d:\r\n if c=='a' or c=='u':\r\n ans = min(ans, d[c]//2)\r\n else:\r\n ans = min(ans, d[c])\r\nprint(ans)\r\n", "s = input()\r\ncc = [0] * 1000\r\nfor char in s:\r\n cc[ord(char)] += 1\r\nans = len(s)\r\nans = min(ans, cc[ord('B')])\r\nans = min(ans, cc[ord('u')] // 2)\r\nans = min(ans, cc[ord('l')])\r\nans = min(ans, cc[ord('b')])\r\nans = min(ans, cc[ord('a')] // 2)\r\nans = min(ans, cc[ord('s')])\r\nans = min(ans, cc[ord('r')])\r\nprint(ans)# 1698221754.9061701", "from collections import defaultdict\r\nx = defaultdict(int)\r\nfor i in input():\r\n x[i] += 1\r\nprint(min(x['B'], x['u']//2, x['l'], x['b'], x['a']//2, x['s'], x['r']))", "__author__ = \"alexandrecorlet\"\n\n\ndef f(x):\n return x // 2 if x > 1 else 0\n\n\ndef main():\n s = input()\n \n caught = {c : 0 for c in \"Bulbasur\"}\n for c in s:\n if c in caught:\n caught[c] += 1\n\n a, u = f(caught[\"a\"]), f(caught[\"u\"])\n\n print(min(a, u, min(caught.values())))\n\nif __name__ == \"__main__\":\n main()\n\n", "s, ss = input(), 'Blbsr'\r\nprint(min([s.count(i) for i in ss] + [s.count('u') // 2, s.count('a') // 2]))", "a = input()\r\ns = 'Bulbasaur'\r\nc = list(map(a.count,s))\r\nc[1] //= 2\r\nc[-3] //= 2\r\nprint(min(c))\r\n# print(min(a.count('B'),(a.count('u')//2),a.)", "import sys\ndef get_string(): return sys.stdin.readline().strip()\n \ns = get_string()\nl=[]\nc=s.count('B')\nl.append(c)\nc=s.count('u')//2\nl.append(c)\nc=s.count('l')\nl.append(c)\nc=s.count('b')\nl.append(c)\nc=s.count('a')//2\nl.append(c)\nc=s.count('s')\nl.append(c)\nc=s.count('r')\nl.append(c)\nprint (min(l))\n \t\t\t\t \t \t\t\t \t \t \t\t \t\t\t\t\t\t", "s=input()\r\nx=[]; i=0\r\nfor i in 'Blbrs':\r\n x.append(s.count(i))\r\nfor i in 'ua':\r\n x.append(s.count(i)//2)\r\nprint(min(x))", "s = input()\r\nc = [s.count(x) for x in \"Bulbasur\"]\r\nc[1] //= 2\r\nc[4] //= 2\r\nprint(min(c))", "import math\r\ns = input()\r\nsv = []\r\nsum = 0\r\nB = 0\r\nu = 0\r\nl = 0\r\nb = 0\r\na = 0\r\nss = 0\r\nr = 0\r\ni = 0\r\nwhile i < len(s):\r\n if s[i] == 'B':\r\n B += 1\r\n if s[i] == 'u':\r\n u += 1\r\n if s[i] == 'l':\r\n l += 1\r\n if s[i] == 'b':\r\n b += 1\r\n if s[i] == 'a':\r\n a += 1\r\n if s[i] == 's':\r\n ss += 1\r\n if s[i] == 'r':\r\n r += 1\r\n i += 1\r\nsum = B\r\nif u / 2 < sum:\r\n sum = math.floor(u / 2)\r\nif l < sum:\r\n sum = l\r\nif b < sum:\r\n sum = b\r\nif a / 2 < sum:\r\n sum = math.floor(a / 2)\r\nif ss < sum:\r\n sum = ss\r\nif r < sum:\r\n sum = r\r\nprint(sum)\r\n", "#problem 80\r\ns=input()\r\nprint(int(min(s.count('B'),s.count('u')/2,s.count('l'),s.count('b'),s.count('a')/2,s.count('s'),s.count('r'))))", "from sys import stdin\nimport collections\n\ndef f(s):\n\tct = collections.Counter()\n\tfor ss in s:\n\t\tif ss in 'Bulbasaur':\n\t\t\tct[ss] += 1\n\tct['u'] //= 2\n\tct['a'] //= 2\n\n\tif len(ct) != 7:\n\t\treturn 0\n\treturn min(ct.values())\n\n\nif __name__ == '__main__':\n\ts = stdin.readline()\n\tprint(f(s))\n \t\t \t \t \t\t \t \t \t\t\t\t \t", "from collections import Counter\ns=input()\nc=Counter(s)\nprint(min(c['B'],c['u']//2,c['l'],c['b'],c['a']//2,c['s'],c['r']))\n", "s = input()\r\nd = dict()\r\nd['B'] = 0\r\nd['u'] = 0\r\nd['l'] = 0\r\nd['b'] = 0\r\nd['a'] = 0\r\nd['s'] = 0\r\nd['r'] = 0\r\n\r\nfor c in s:\r\n if c in d:\r\n #print(c)\r\n d[c] += 1\r\n \r\nd['u'] //= 2\r\nd['a'] //= 2\r\n\r\nres = 1000000\r\nfor el in d:\r\n #print(el, d[el])\r\n res = min(res, d[el])\r\n \r\nprint(res)", "s=input()\n\nans = min(s.count('B'),s.count('u')/2,s.count('l'),s.count('b'),s.count('a')/2,s.count('s'),s.count('r'))\n\nprint (int(ans))\n", "now = 0\r\ntarget = \"auBlbsr\"\r\nmemo = [0] * 7\r\n\r\ndata = list(input())\r\n\r\ncnt = 0\r\nfor i in range(len(data)):\r\n for j in range(len(target)):\r\n if data[i] == target[j]:\r\n memo[j] += 1\r\n\r\nmemo[0] //= 2\r\nmemo[1] //= 2\r\nprint(min(memo))", "letters = list(input())\r\ncounts = [letters.count(l) for l in 'Bulbasr']\r\ncounts[1] //= 2\r\ncounts[4] //= 2\r\nprint(min(counts))", "x = 'Bulbasaur'\r\nn = input()\r\nc = 0\r\nfor i in x:\r\n if i in n:\r\n c += 1\r\nif c == 9:\r\n w = [n.count('B'),n.count('u')//2,n.count('l'),n.count('b'),n.count('a')//2,n.count('s'),n.count('r')]\r\n print(min(w))\r\nelse:\r\n print('0')\r\n", "from collections import Counter\r\n\r\ns = input()\r\ntarget = 'Bulbasaur'\r\n\r\ncount = Counter(s)\r\n\r\ncounts = []\r\n\r\nfor c in target:\r\n if c == 'a' or c == 'u':\r\n val = count.get(c, 0)//2\r\n else:\r\n val = count.get(c, 0)\r\n\r\n counts.append(val)\r\n\r\ncounts.sort()\r\n\r\nprint(counts[0])\r\n", "s=input()\r\nlst=[]\r\nl=[\"B\",\"u\",\"l\",\"b\",\"a\",\"s\",\"r\"]\r\nfor i in l:\r\n lst.append(s.count(i))\r\nlst[1]=lst[1]//2\r\nlst[4]=lst[4]//2\r\nprint(min(lst))\r\n", "a=input()\r\ncB=0\r\ncu=0\r\ncl=0\r\ncb=0\r\nca=0\r\ncr=0\r\ncs=0\r\nfor i in range(len(a)):\r\n if a[i]=='B':\r\n cB+=1\r\n elif a[i]=='u':\r\n cu+=1\r\n elif a[i]=='l':\r\n cl+=1\r\n elif a[i]=='b':\r\n cb+=1\r\n elif a[i]=='s':\r\n cs+=1\r\n elif a[i]=='r':\r\n cr+=1\r\n elif a[i]=='a':\r\n ca+=1\r\nprint(min(cB,(cu//2),cl,cb,(ca//2),cs,cr))", "s=input()\nf=[]\nfor i in range(256):\n f.append(0)\nfor c in s:\n f[ord(c)]+=1\nans=min(f[ord('B')],f[ord('b')],f[ord('u')]//2,f[ord('a')]//2,f[ord('l')],f[ord('s')],f[ord('r')])\nprint(ans)\n", "s = input()\r\na = s.count('a') // 2\r\nB = s.count('B')\r\nu = s.count('u') // 2\r\nb = s.count('b')\r\nc = s.count('s')\r\nr = s.count('r')\r\nl = s.count('l')\r\nprint(min(B, u, l, b, a, c, r))", "# import sys\r\n# sys.stdin = open(\"test.in\",\"r\")\r\n# sys.stdout = open(\"test.out.py\",\"w\")\r\na=input()\r\nc1=a.count('B')\r\nc2=a.count('b')\r\nc3=a.count('u')\r\nc4=a.count('l')\r\nc5=a.count('a')\r\nc6=a.count('s')\r\nc7=a.count('r')\r\nif c1 and c2 and c3>1 and c4 and c5>1 and c6 and c7:\r\n\tx=min(c1,c2,c4,c6,c7)\r\n\ty=min(x,c3//2,c5//2)\r\n\tprint(y)\r\nelse:\r\n\tprint('0')\t ", "from sys import stdin, stdout\r\n\r\ns = stdin.readline().strip()\r\n\r\ncnt = min(s.count('B'), s.count('l'))\r\ncnt = min(cnt, s.count('b'))\r\ncnt = min(cnt, s.count('r'))\r\ncnt = min(cnt, s.count('s'))\r\ncnt = min(cnt, s.count('a') // 2)\r\ncnt = min(cnt, s.count('u') // 2)\r\n\r\nstdout.write(str(cnt))", "n = list(map(str, input()))\r\nB = n.count('B')\r\nu = n.count('u') // 2\r\nl = n.count('l')\r\nb = n.count('b')\r\na = n.count('a') // 2\r\ns = n.count('s')\r\nr = n.count('r')\r\ng = [B, u, l, b, a, s, r]\r\nif B == 0 or u == 0 or l == 0 or b == 0 or a == 0 or s == 0 or r == 0:\r\n print(0)\r\nelse:\r\n print(min(g))\r\n", "characters = {'B': 0, 'u': 0, 'l': 0, 'b': 0, 'a': 0, 's': 0, 'r': 0}\r\ns = list(input())\r\nfor c in s:\r\n if characters.get(c) != None:\r\n characters[c] += 1\r\ncharacters['a'] = int(characters['a'] / 2)\r\ncharacters['u'] = int(characters['u'] / 2)\r\nprint(min(characters.values()))", "s = input()\r\nb1 = s.count('B')\r\nu = s.count('u')\r\nl = s.count('l')\r\nb = s.count('b')\r\na = s.count('a')\r\ns1 = s.count('s')\r\nu = s.count('u')\r\nr = s.count('r')\r\na = a//2\r\nu = u//2\r\nprint (min(b1,u,b,l,a,s1,u,r))", "s=input()\r\nref=\"Bulbasaur\"\r\nfrom collections import Counter \r\nc=Counter(s)\r\nprint(min(c['B'],c['u']//2,c['l'],c['b'],c['s'],c['r'],c['a']//2))", "s=input()\r\ntemp='Bulbasaur'\r\nl=[]\r\nfor i in range(0,len(temp)):\t\r\n\tl.append(int(s.count(temp[i])))\r\nif min(l)<=min(int(s.count('a')/2),int(s.count('u')/2)):\r\n print(min(l))\r\nelse:\r\n\tprint(min(int(s.count('a')/2),int(s.count('u')/2)))\r\n", "# LUOGU_RID: 131955162\na=input()\r\nprint(min([a.count('B'),a.count('u')//2,a.count('l'),a.count('b'),a.count('a')//2,a.count('s'),a.count('r')]))", "from collections import Counter\r\n\r\ns = input()\r\ntarget = 'Bulbasaur'\r\ncount = Counter(s)\r\n_min = 100001\r\n\r\nfor c in target:\r\n if c == 'a' or c == 'u':\r\n val = count.get(c, 0)//2\r\n else:\r\n val = count.get(c, 0)\r\n if val < _min:\r\n _min = val\r\n\r\nprint(_min)\r\n", "st=input()\r\nB=0\r\nl=0\r\nb=0\r\na=0\r\nu=0\r\ns=0\r\nr=0\r\nfor c in st:\r\n\tif c=='B':\r\n\t\tB+=1\r\n\telif c=='l':\r\n\t\tl+=1\r\n\telif c=='b':\r\n\t\tb+=1\r\n\telif c=='a':\r\n\t\ta+=1\r\n\telif c=='u':\r\n\t\tu+=1\r\n\telif c=='s':\r\n\t\ts+=1\r\n\telif c=='r':\r\n\t\tr+=1\r\nprint(min([B,l,b,a//2,u//2,s,r]))\r\n", "s, ss = input(), 'Bulbasr'\r\na = [s.count('u') // 2, s.count('a') // 2]\r\nprint(min(list(s.count(i) for i in ss) + a))", "def solve(s):\r\n letter_to_count = build_letter_to_count(s)\r\n\r\n return min(letter_to_count.get(letter, 0) // count for letter, count in build_letter_to_count(\"Bulbasaur\").items())\r\n\r\ndef build_letter_to_count(string):\r\n letter_to_count = {}\r\n for letter in string:\r\n letter_to_count[letter] = letter_to_count.get(letter, 0) + 1\r\n return letter_to_count\r\n\r\nif __name__ == \"__main__\":\r\n s = input()\r\n print(solve(s))", "# print(\"Input the string\")\nst = input()\n\nBcount = 0\nucount = 0\nlcount = 0\nbcount = 0\nacount = 0\nscount = 0\nrcount = 0\n\nfor ch in st:\n if ch == \"B\":\n Bcount += 1\n elif ch == \"u\":\n ucount += 1\n elif ch == \"l\":\n lcount += 1\n elif ch == \"b\":\n bcount += 1\n elif ch == \"a\":\n acount += 1\n elif ch == \"s\":\n scount += 1\n elif ch == \"r\":\n rcount += 1\n\nprint(min(Bcount, ucount//2, lcount, bcount, acount//2, scount, rcount))\n", "s = input()\ncounts = [0 for i in range(0, 256)]\n\nfor c in s:\n counts[ord(c)] += 1\n\ncounts[ord('u')] //= 2\ncounts[ord('a')] //= 2\n\nwants = [counts[ord('B')], counts[ord('u')], counts[ord('l')], counts[ord('b')], counts[ord('a')], counts[ord('s')], counts[ord('r')]]\nans = min(wants)\n\nprint(ans)\n", "s = input().strip()\r\ncounts = {'B': 0, 'u': 0, 'l': 0, 'b': 0, 'a': 0, 's': 0, 'r': 0}\r\n\r\nfor c in s:\r\n if c in counts:\r\n counts[c] += 1\r\n\r\ncounts['u'] //= 2\r\ncounts['a'] //= 2\r\n\r\nprint(min(counts.values()))\r\n", "s=input()\r\nt=\"Bulbasaur\"\r\nl=[]\r\nfor c in t:\r\n l.append(s.count(c)//t.count(c))\r\nprint(min(l)) ", "lst = {}\r\nfor i in \"abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ\" : lst[i] = 0\r\nn = input()\r\nfor i in n : lst[i] += 1\r\nans = 100000\r\nfor i in \"Bulbasr\":\r\n\tif (i == \"a\" or i == \"u\"): tmp = lst[i]//2\r\n\telse : tmp = lst[i]\r\n\tans = min(ans,tmp)\r\nprint(ans)", "x=input()\r\ns=[x.count('B'),x.count('u')//2,x.count('l'),x.count('b'),x.count('a')//2,x.count('s'),x.count('r')]\r\nprint(min(s))", "l=[0]*124\ns=input()\nfor i in s:\n\tl[ord(i)]+=1\n\nB=l[ord('B')]\nu=(l[ord('u')])//2\nL=l[ord('l')]\nb=l[ord('b')]\na=(l[ord('a')])//2\ns=l[ord('s')]\nr=l[ord('r')]\n\nprint(min(B,u,L,b,a,s,r))", "from collections import Counter\n\ns = input()\nm = Counter(s)\nresult, target = 6666666, Counter(\"Bulbasaur\")\nfor ch in target.keys():\n result = min(result, m[ch]//target[ch])\nprint(result)\n", "'''Author: Abdurasul !!!''' \r\nn=input();s=0;B=n.count('B');u=int(n.count('u')/2);l=n.count('l');b=n.count('b');a=int(n.count('a')/2);s=n.count('s');r=n.count('r');print(min(B,u,l,b,a,s,r))\r\n", "import collections\r\nimport sys\r\n\r\n\r\ns = input()\r\n\r\nd = collections.Counter(\"Bulbasaur\")\r\ns = collections.Counter(s)\r\n\r\nans = float(\"inf\")\r\nf = 0\r\nfor i in d:\r\n if i not in s:\r\n f = 1\r\n break \r\n ans = min(ans, s[i]//d[i])\r\n\r\nif f:\r\n print(0)\r\n sys.exit(0)\r\n\r\nprint(ans)\r\n\r\n", "s=input()\r\nt=\"Bulbasaur\"\r\nnum=min(s.count(i)//t.count(i) for i in t)\r\nprint(num)\r\n", "x = input()\r\nb = x.count(\"B\")\r\nu = x.count(\"u\")\r\nl = x.count(\"l\")\r\nbb = x.count(\"b\")\r\na = x.count(\"a\")\r\ns = x.count(\"s\")\r\nr = x.count(\"r\")\r\nans = 0\r\nwhile(b>=1 and u>=2 and l>=1 and bb>=1 and a>=2 and s>=1 and u>=1 and r>=1):\r\n b-=1\r\n u-=2\r\n l-=1\r\n bb-=1\r\n a-=2\r\n s-=1\r\n r-=1\r\n ans+=1\r\n \r\nprint(ans)", "S = input()\n\nb = \"Blbsur\"\npos = 0\nret = 1000000\n\nfor s in b:\n ret = min(ret, S.count(s))\nprint(min(ret, S.count(\"a\")//2, S.count(\"u\")//2))\n\n\t \t \t\t\t \t\t\t \t\t \t \t \t\t \t", "import sys\r\n\r\ntext = input().strip()\r\nB = text.count('B')\r\nb = text.count('b')\r\nu = text.count('u')\r\nl = text.count('l')\r\na = text.count('a')\r\ns = text.count('s')\r\nr = text.count('r')\r\n\r\nwhile u < 2*B:\r\n B-=1\r\nwhile a < 2*B:\r\n B-=1\r\nlst = [b,l,s,r]\r\nx = min(lst)\r\nif x <= B:\r\n print(x)\r\nelse:\r\n print(B)\r\n\r\n", "s = input()\r\nb1 = u = b = l = a = s1 = u = r = 0\r\nfor i in range(len(s)):\r\n if s[i] == 'B':\r\n b1 +=1\r\n if s[i] == 'u':\r\n u +=1\r\n if s[i] == 'l':\r\n l +=1\r\n if s[i] == 'b':\r\n b +=1\r\n if s[i] == 'a':\r\n a +=1\r\n if s[i] == 's':\r\n s1 +=1\r\n if s[i] == 'r':\r\n r +=1\r\na = a//2\r\nu = u//2\r\nprint (min(b1,u,b,l,a,s1,u,r))", "s=input()\r\ncount=[0]*7\r\nfor i in range(0,len(s)):\r\n if(s[i]==\"B\"):\r\n count[0]+=1\r\n elif(s[i]==\"u\"):\r\n count[1]+=1\r\n elif(s[i]==\"l\"):\r\n count[2]+=1\r\n elif(s[i]==\"b\"):\r\n count[3]+=1\r\n elif(s[i]==\"a\"):\r\n count[4]+=1\r\n elif(s[i]==\"s\"):\r\n count[5]+=1\r\n elif(s[i]==\"r\"):\r\n count[6]+=1\r\ncount[1]=int(count[1]/2)\r\ncount[4]=int(count[4]/2)\r\nprint(min(count))", "t = input()\r\none = 'Blbsr'\r\ntwo = 'au'\r\nm = min(min(t.count(c) for c in one), min(t.count(c)//2 for c in two))\r\nprint (m)", "d = {} \r\nc = 'Bulbasaur'\r\nfor i in range(26):\r\n d[chr(i + ord('a'))] = 0 \r\n d[chr(i + ord('A'))] = 0 \r\ns = input()\r\nfor i in s:\r\n d[i] += 1 \r\nprint(min(d['B'], d['u'] // 2, d['l'], d['b'], d['a'] // 2, d['s'], d['r']))\r\n", "newspaper = input()\nnumber_of_letters = {'B':0, 'u':0, 'l':0, 'b':0, 'a':0, 's':0, 'r':0}\n# a and u repeated\nfor letter in newspaper:\n if letter in 'Bulbasr':\n number_of_letters[letter] += 1\nnumber_of_letters['u'] = number_of_letters['u'] // 2\nnumber_of_letters['a'] = number_of_letters['a'] // 2\nprint(min(number_of_letters.values()))\n", "s = input()\r\nB = s.count('B')\r\nu = s.count('u')\r\nl = s.count('l')\r\nb = s.count('b')\r\na = s.count('a')\r\nS = s.count('s')\r\nr = s.count('r')\r\nprint(min(B,u//2,l,b,a//2,S,r))", "s = input()\r\nres = 10**5+1\r\ncont = 0\r\na = [0] * 256\r\nfor i in s:\r\n if \"Blbsr\".find(i) != -1:\r\n a[ord(i)] += 1\r\n elif i == \"a\" or i == \"u\":\r\n a[ord(i)] += 0.5\r\nfor i in range(256):\r\n if a[i] != 0:\r\n cont += 1\r\n if a[i] < res:\r\n res = a[i]\r\nif cont < 7:\r\n print(0)\r\nelse:\r\n print(int(res))", "s = input()\r\nl = \"Bulbasaur\"\r\nl1 = []\t\r\nfor i in l:\r\n\tif i==\"u\":\r\n\t\tl1.append(s.count(\"u\")//2)\r\n\telif i==\"a\":\r\n\t\tl1.append(s.count(\"a\")//2)\t\r\n\telse:\r\n\t\tl1.append(s.count(i))\r\nif 0 in l1:print(0)\r\nelse:print(min(l1))\r\n", "p=\"Bulbasr\"\r\ns=input()\r\nans=100000\r\nfor c in p:\r\n k=s.count(c)\r\n if c=='a' or c=='u':k//=2\r\n ans=min(ans,k)\r\nprint(ans) \r\n", "#Bulbasaur\nnews=input()\ncount=0\nB=news.count('B')\nu=news.count('u')\nl=news.count('l')\nb=news.count('b')\na=news.count('a')\ns=news.count('s')\nr=news.count('r')\nwhile B>0 and u>1 and l>0 and b>0 and a>1 and s>0 and r>0:\n\tcount+=1\n\tB-=1\n\tu-=2\n\tl-=1\n\tb-=1\n\ta-=2\n\ts-=1\n\tr-=1\nprint(count)", "s = input()\ncur_min1 = 10 ** 6\ncur_min2 = 10 ** 6\nd = ['B', 'u', 'l', 'b', 'a', 's', 'r']\nfor element in d:\n if element == 'u' or element == 'a':\n if s.count(element) < cur_min2:\n cur_min2 = s.count(element)\n if s.count(element) < cur_min1:\n cur_min1 = s.count(element)\nprint(min(cur_min1, cur_min2 // 2))\n", "text = input()\r\nword = 'Bulbasaur'\r\nn = len(word)\r\n\r\nr = text.count('B')\r\nif text.count('u') // 2 < r:\r\n r = text.count('u') // 2\r\nif text.count('a') // 2 < r:\r\n r = text.count('a') // 2\r\nif text.count('l') < r:\r\n r = text.count('l')\r\nif text.count('b') < r:\r\n r = text.count('b')\r\nif text.count('s') < r:\r\n r = text.count('s')\r\nif text.count('r') < r:\r\n r = text.count('r')\r\nprint(r)", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\nletters = {c: 0 for c in 'Bulbasaur'}\netalon = letters.copy()\n\nfor c in 'Bulbasaur':\n etalon[c] += 1\n\nfor c in input():\n if c in letters:\n letters[c] += 1\n\nprint(min((letters[c] // etalon[c] for c in etalon)))\n", "a=input()\r\nh=a.count('B')\r\nk=int(a.count('u')/2)\r\nl=a.count('l')\r\nm=a.count('b')\r\nn=int(a.count('a')/2)\r\np=a.count('s')\r\nq=a.count('r')\r\nprint(min(h,k,l,m,n,p,q))", "b = {'B': 0, 'u': 0, 'l': 0, 'b': 0, 'a': 0, 's': 0, 'r': 0}\n\nminn = 100500\ns = input()\n\nfor el in s:\n\tif el in 'Bulbasaur':\n\t\tb[el] += 1\n\nfor key in b:\n\tif key in ('a', 'u'):\n\t\tminn = min(minn, b[key] // 2)\n\telse:\n\t\tminn = min(minn, b[key])\n\nprint(minn)\n", "word = input()\nB = word.count(\"B\")\nu = word.count(\"u\")\nl = word.count(\"l\")\nb = word.count(\"b\")\na = word.count(\"a\")\ns = word.count(\"s\")\nr = word.count(\"r\")\nprint(min(B, u//2, l, b, a//2, s, r))\n \t \t\t\t \t\t \t\t\t \t \t \t \t \t", "gaz=input()\r\nbukvy=[0,0,0,0,0,0,0]\r\nfor s in gaz:\r\n if s=='a':\r\n bukvy[0]+=1\r\n elif s=='B':\r\n bukvy[1]+=1\r\n elif s=='b':\r\n bukvy[2]+=1\r\n elif s=='l':\r\n bukvy[3]+=1\r\n elif s=='r':\r\n bukvy[4]+=1\r\n elif s=='s':\r\n bukvy[5]+=1\r\n elif s=='u':\r\n bukvy[6]+=1\r\n\r\nbukvy[0]=bukvy[0]//2\r\nbukvy[6]=bukvy[6]//2\r\nminb=min(bukvy)\r\n\r\nprint(minb)", "def program():\r\n\ts = input()\r\n\tword = 'Bulbasaur'\r\n\tdct = {}\r\n\tkecil = ''\r\n\tif len(s) < 9:\r\n\t\tprint ('0')\r\n\t\treturn 0\r\n\r\n\tfor char in word:\r\n\t\tdct[char] = s.count(char)\r\n\td2 = {'a': dct['a']//2, 'u':dct['u']//2}\r\n\tdct.update(d2)\r\n\r\n\tminimum = min(dct.items(), key=lambda x: x[1])\r\n\tprint (minimum[1])\r\n\treturn 0\r\n\r\nprogram()", "s = input()\nword = \"Bulbasaur\"\nlst = []\nfor i in word:\n lst.append(s.count(i)//word.count(i))\nprint(min(lst))\n", "from collections import Counter,defaultdict\r\n\r\nfrom math import factorial\r\n\r\n\r\ns = input()\r\nc =Counter(s)\r\nans = min(c['B'],c['u']//2,c['b'],c['l'],c['a']//2,c['s'],c['r'])\r\nprint(ans)\r\n", "s = input()\r\nprint(min(min(s.count(el) for el in 'Blbsr'), s.count('a') // 2, s.count('u') // 2))", "s=input()\r\nlst=[0,0,0,0,0,0,0]\r\nfor l in s:\r\n if l=='B':\r\n lst[0]+=1\r\n if l=='a':\r\n lst[1]+=1\r\n if l=='b':\r\n lst[2]+=1\r\n if l=='l':\r\n lst[3]+=1\r\n if l=='r':\r\n lst[4]+=1\r\n if l=='s':\r\n lst[5]+=1\r\n if l=='u':\r\n lst[6]+=1\r\nlst[1]=lst[1]//2\r\nlst[6]=lst[6]//2\r\nprint(min(lst))\r\n \r\n\r\n\r\n# Bulbasaur\r\n# ['B', 'a', 'a', 'b', 'l', 'r', 's', 'u', 'u']", "st = input()\r\nB = st.count(\"B\")\r\nb = st.count(\"b\")\r\nu = st.count(\"u\")//2\r\nl = st.count(\"l\")\r\na = st.count(\"a\")//2\r\ns = st.count(\"s\")\r\nr = st.count(\"r\")\r\n\r\nm = min(B, b, u, l, a, s, r)\r\n\r\nprint(m)\r\n", "string = input()\ncheck = \"Bulbasaur\"\nres = 1000000000000000\nfor x in check:\n res = min(res,string.count(x)//check.count(x))\nprint(res) \n", "s = input()\r\n\r\ncount = {\r\n 'B': 0,\r\n 'u': 0,\r\n 'l': 0,\r\n 'b': 0,\r\n 'a': 0,\r\n 's': 0,\r\n 'r': 0,\r\n}\r\n\r\nfor c in s:\r\n if c in count:\r\n count[c] += 1\r\n\r\ncount['u'] /= 2\r\ncount['a'] /= 2\r\n\r\nprint(int(min(count.values())))\r\n", "s=input()\r\na=[]\r\nq=s.count('B')\r\nw=s.count('u')\r\ne=s.count('l')\r\nr=s.count('b')\r\nt=s.count('a')\r\ny=s.count('s')\r\nu=s.count('r')\r\nif q>=1 and w>=2 and e>=1 and r>=1 and t>=2 and y>=1 and u>=1:\r\n w=w//2\r\n t=t//2\r\n a.append(q)\r\n a.append(w)\r\n a.append(e)\r\n a.append(r)\r\n a.append(t)\r\n a.append(y)\r\n a.append(u)\r\n print(min(a))\r\nelse:\r\n print(0)\r\n", "s = input()\r\nt = \"Bulbasaur\"\r\nfrq = [s.count(c)//t.count(c) for c in t]\r\nprint(min(frq))", "x=input()\r\nif \"l\" and \"s\" and \"r\" and \"B\" in x and x.count(\"a\")>=2 and x.count(\"u\")>=2:\r\n print(min(x.count(\"r\"),x.count(\"l\"),x.count(\"s\"),x.count(\"B\"),int((x.count(\"u\")/2)),int((x.count(\"a\")/2)),x.count(\"b\")))\r\nelse:\r\n print(0)", "string = input()\r\nn = 0\r\nvalues = []\r\nfor x in \"Bulbasr\":\r\n a = string.count(x)\r\n if x == \"a\" or x == \"u\":\r\n a //= 2\r\n values.append(a)\r\nprint(min(values))", "S = input()\r\nB, u, l = S.count('B'), S.count('u'), S.count('l')\r\nb, a, s, r = S.count('b'), S.count('a'), S.count('s'), S.count('r')\r\nT = 0\r\nwhile B>=1 and u>=2 and l>=1 and b>=1 and a>=2 and s>=1 and r>=1:\r\n B-=1\r\n u-=2\r\n l-=1\r\n b-=1\r\n a-=2\r\n s-=1\r\n r-=1\r\n T+=1\r\nprint(T)\r\n", "s = input()\n\nB = s.count('B')\nu = s.count('u')\nl = s.count('l')\nb = s.count('b')\na = s.count('a')\nsx = s.count('s')\nr = s.count('r')\n\nanswer = min([B, u // 2, l, b, a // 2, sx, r])\nprint(answer)\n", "from collections import Counter as c\r\na=c(input())\r\nprint(min(a['B'],a['u']//2,a['l'],a['b'],a['a']//2,a['s'],a['r']))\r\n", "from collections import defaultdict\n\nword_ratio = defaultdict(int)\nfor word in \"Bulbasaur\":\n word_ratio[word] += 1\n\nnews = input()\nnews_ratio = defaultdict(int)\nfor i in news:\n if i in word_ratio:\n news_ratio[i] += 1\n\nprint(min([news_ratio[i]//word_ratio[i] for i in word_ratio]))", "# coding=utf-8\na=input()\r\nb=len(a)\r\ns=[0,0,0,0,0,0,0,0]\r\nfor i in range(b):\r\n if a[i]=='B':\r\n s[0]+=1\r\n if a[i]=='u':\r\n s[1]+=1\r\n if a[i]=='l':\r\n s[2]+=1\r\n if a[i]=='b':\r\n s[3]+=1\r\n if a[i]=='a':\r\n s[4]+=1\r\n if a[i]=='s':\r\n s[5]+=1\r\n if a[i]=='r':\r\n s[6]+=1\r\nt=0\r\nwhile s[0]>0 and s[1]>1 and s[2]>0 and s[3]>0 and s[4]>1 and s[5]>0 and s[6]>0:\r\n t+=1\r\n s[0]-=1\r\n s[1]-=2\r\n s[2]-=1\r\n s[3]-=1\r\n s[4]-=2\r\n s[5]-=1\r\n s[6]-=1\r\nprint(t)\r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\n \t\t\t\t \t \t \t \t \t \t \t", "s, pattern = input(), 'Bulbasaur'\r\n\r\nprint(min(s.count(ch) // pattern.count(ch) for ch in set(pattern)))", "s = input()\r\nz ='Bulbasaur'\r\nc = [0,0,0,0,0,0,0,0,0]\r\nfor i in range(len(z)):\r\n for j in range(len(s)):\r\n if z[i] in s[j]:\r\n c[i]+=1\r\nc[1] //=2\r\nc[4] //=2\r\nc[6] //=2\r\nc[7] //=2\r\nc.sort()\r\nprint(c[0])\r\n", "a=input()\r\n\r\n\r\n\r\n\r\ns=\"Bulbasaur\"\r\n\r\nt=[0]*7\r\n\r\n\r\nfor j in a:\r\n\r\n if j=='B':\r\n t[0]+=1\r\n elif j=='b':\r\n t[1]+=1\r\n elif j=='a':\r\n t[2]+=.5\r\n elif j=='u':\r\n t[3]+=.5\r\n elif j=='r':\r\n t[4]+=1\r\n elif j=='l':\r\n t[5]+=1\r\n elif j=='s':\r\n t[6]+=1\r\n\r\nprint(int(min(t)))\r\n \r\n", "from collections import Counter\r\ns=input()\r\nx=Counter(s)\r\nc=0\r\nif 'B' in x and 'a' in x and 'u' in x and 'l' in x and 'b' in x and 's' in x and 'r' in x:\r\n c+=min(x['B'],x['a']//2,x['u']//2,x['l'],x['b'],x['s'],x['r'])\r\nprint(c)", "w=\"Bulbasaur\"\r\ns=input()\r\nans=10**5+1\r\nchk={}\r\nfor i in s:\r\n if i in chk:\r\n chk[i]+=1\r\n else:\r\n chk[i]=1\r\nfor i in w:\r\n if i in chk:\r\n ans=min(ans,chk[i]//[1,2][i=='a' or i=='u'])\r\n else:\r\n ans=0\r\nprint(ans)", "f={}\r\nfor x in input():\r\n try:\r\n f[x]+=1\r\n except:\r\n f[x]=1\r\ntry:\r\n print(min(f['B'],f['u']//2,f['l'],f['b'],f['a']//2,f['s'],f['r']))\r\nexcept:\r\n print(0)\r\n ", "s=input()\r\nx='Blbsr'\r\ny='ua'\r\nt1=[0]*5\r\nt2=[0]*2\r\nfor l in s:\r\n if l=='B':\r\n t1[0]+=1\r\n elif l=='l':\r\n t1[1]+=1\r\n elif l=='b':\r\n t1[2]+=1\r\n elif l=='s':\r\n t1[3]+=1\r\n elif l=='r':\r\n t1[4]+=1\r\n elif l=='u':\r\n t2[0]+=1\r\n elif l=='a':\r\n t2[1]+=1 \r\nprint(min(min(t1),min(t2)//2))", "from collections import Counter\nimport sys\n\ndef substraction_charset(charset1, charset2):\n charset1.subtract(charset2)\n for char in charset1:\n if charset1[char]<0:\n return False\n return True\n\ndef compile_words(word, data):\n chars_word = Counter(word)\n chars_data = Counter(data)\n count = 0\n while substraction_charset(chars_data, chars_word):\n count += 1\n return count\n\n\n\nif __name__ == '__main__':\n print(compile_words(\"Bulbasaur\", sys.stdin.read()))\n\n", "def getFreq(s):\r\n cnt = [0]*256\r\n for x in s:\r\n cnt[ord(x)]+=1\r\n return cnt\r\n\r\ndef main():\r\n\r\n s = input()\r\n cnt1 = getFreq(s)\r\n\r\n s=\"Bulbasaur\"\r\n cnt2 = getFreq(s)\r\n ans=1000000\r\n for i,x in enumerate(cnt2):\r\n # print(x,i)\r\n if(x==0):\r\n continue\r\n ans=min(ans,cnt1[i]//x)\r\n\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "#import io, os\r\n#input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ns=input()\r\nB=s.count(\"B\")\r\nb=s.count(\"b\")\r\nu=s.count(\"u\")\r\nl=s.count(\"l\")\r\na=s.count(\"a\")\r\nst=s.count(\"s\")\r\nr=s.count(\"r\")\r\nprint(min(B,u//2,l,b,a//2,st,r))", "a = list(input().split()[0])\r\nmydic = {}\r\nmydic['B'] = 0\r\nmydic['u'] = 0\r\nmydic['l'] = 0\r\nmydic['b'] = 0\r\nmydic['a'] = 0\r\nmydic['s'] = 0\r\nmydic['r'] = 0\r\nfor elem in a:\r\n if elem in mydic.keys():\r\n mydic[elem] += 1\r\nmydic['a']//=2\r\nmydic['u']//=2\r\nprint (min(mydic.values()))", "s=input()\r\nB=s.count('B')\r\nu=s.count('u')\r\nl=s.count('l')\r\nb=s.count('b')\r\na=s.count('a')\r\nS=s.count('s')\r\nr=s.count('r')\r\ncount=min(B,int(u/2),l,b,int(a/2),S,r)\r\nprint (count)\r\n", "s = input()\r\ncnt = [s.count(i) for i in 'aulbsrB']\r\ncnt[0] //= 2\r\ncnt[1] //= 2\r\nprint(min(cnt))\r\n", "a=list(input())\r\nm1=a.count('B')\r\nm2=a.count('u')//2\r\nm3=a.count('l')\r\nm4=a.count('b')\r\nm5=a.count('a')//2\r\nm6=a.count('s')\r\nm7=a.count('r')\r\nprint(min(m1,m2,m3,m4,m5,m6,m7))\r\n", "def main():\n from collections import Counter\n b, c = Counter(\"Bulbasaur\"), Counter(input())\n for k, v in b.items():\n b[k] = c[k] // v\n print(min(b.values()))\n\n\nif __name__ == '__main__':\n main()\n", "x=input()\na=x.count('B')\nb=x.count('u')\nb=b//2\nc=x.count('l')\nd=x.count('b')\ne=x.count('s')\ng=x.count('a')\ng=g//2\ni=x.count('r')\nk=[a,b,c,d,e,g,i]\nl=min(k)\nprint(min(k))\n#Bulbasr\n", "# Bulbasaur\r\nc = input()\r\nB = 0\r\nu = 0\r\nl = 0\r\nb = 0\r\na = 0\r\ns = 0\r\nr = 0\r\nfor i in c:\r\n if i == 'B':\r\n B += 1\r\n if i == 'u':\r\n u += 1\r\n if i == 'l':\r\n l += 1\r\n if i == 'b':\r\n b += 1\r\n if i == 'a':\r\n a += 1\r\n if i == 's':\r\n s += 1\r\n if i == 'r':\r\n r += 1\r\na = a // 2\r\nu = u // 2\r\nprint(min(B, u, l, b, a, s, r))\r\n", "s = input()\r\nfoo = 'Bulbasr'\r\nans = []\r\nfor i in foo:\r\n if i == 'u' or i == 'a': ans.append(s.count(i)//2)\r\n else: ans.append(s.count(i))\r\nprint(min(ans))\r\n", "base_freq = {}\r\nfor x in 'Bulbasaur':\r\n base_freq[x] = base_freq.get(x, 0) + 1\r\nfreq = {}\r\nfor x in input():\r\n freq[x] = freq.get(x, 0) + 1\r\nans = 10 ** 5\r\nfor key in base_freq:\r\n ans = min(ans, freq.get(key, 0) // base_freq[key])\r\nprint(ans)", "y = input(); dct = {}\r\nfor i in ['B', 'u', 'l', 'b', 'a', 's', 'r']:\r\n dct[i] = y.count(i)\r\n \r\nx = min(dct['B'], dct['l'], dct['b'], dct['s'], dct['r'])\r\nz = min(dct['u'] // 2, dct['a'] // 2)\r\nprint(min(x,z))", "n=input()\r\nf='Bulbasaur'\r\nlst=[]\r\nfor i in f:\r\n if(i!='a' and i!='u'):\r\n lst.append(n.count(i))\r\n elif(i=='a'):\r\n lst.append(n.count('a')//2)\r\n else:\r\n lst.append(n.count('u')//2)\r\nprint(min(lst))\r\n", "w=\"Bulbasaur\"\r\nd={}\r\nfor i in w:\r\n if i in d:\r\n d[i]+=1\r\n else:\r\n d[i]=1\r\ns=input()\r\nans=10**5+1\r\nchk={}\r\nfor i in s:\r\n if i in chk:\r\n chk[i]+=1\r\n else:\r\n chk[i]=1\r\nfor i in d:\r\n if i in chk:\r\n ans=min(ans,chk[i]//d[i])\r\n else:\r\n ans=0\r\nprint(ans)", "from collections import Counter\r\nk = Counter(\"Bulbasaur\")\r\nr = Counter(input())\r\nprint(min(r[c] // k[c] for c in k))", "s = input()\r\nprint(min(s.count('B'), s.count('u')//2, s.count('l'),\r\n s.count('b'), s.count('a')//2, s.count('s'), s.count('r')))\r\n", "y=input()\r\nt=\"Bulbasr\"\r\nB=y.count(\"B\")\r\nu=y.count(\"u\")\r\nl=y.count(\"l\")\r\nb=y.count(\"b\")\r\na=y.count(\"a\")\r\ns=y.count(\"s\")\r\nr=y.count(\"r\")\r\n\r\nans = min(B,u//2,a//2,l,b,s,r)\r\nprint(ans)", "st = input()\r\nwd=[]\r\nwd.append(st.count('B'))\r\nwd.append(st.count('u')//2)\r\nwd.append(st.count('l'))\r\nwd.append(st.count('b'))\r\nwd.append(st.count('a')//2)\r\nwd.append(st.count('s'))\r\nwd.append(st.count('r'))\r\nprint(min(wd))", "from collections import defaultdict\nd = defaultdict(int)\nfor s in input():d[s]+=1\na=min([d['B'],d['l'],d['b'],d['r'],d['s']])\nb=min([d['a']//2,d['u']//2])\nprint(min(a,b))", "s = input()\r\nb1=b2=b3=b4=b5=b6=b7=0\r\nfor i in range(len(s)) :\r\n if(s[i]=='B' or s[i]=='u' or s[i]=='l' or s[i]=='b' or s[i]=='a' or s[i]=='s' or s[i]=='r') :\r\n if(s[i]=='B') :\r\n b1 += 1\r\n elif(s[i]=='u') :\r\n b2 += 1\r\n elif(s[i]=='l') :\r\n b3 += 1\r\n elif(s[i]=='b') :\r\n b4 += 1\r\n elif(s[i]=='a') :\r\n b5 += 1\r\n elif(s[i]=='s') :\r\n b6 += 1\r\n elif(s[i]=='r') :\r\n b7 += 1\r\nprint(min(b1,int(b2/2),b3,b4,int(b5/2),b6,b7))", "s=input()\nt=\"Bulbasaur\"\nnaga=0\nhanuma=[]\nprint(min([s.count(c)//t.count(c) for c in t]))\n\t\t \t\t\t \t \t\t \t\t\t \t\t \t\t\t\t\t", "B=0;u=0;l=0;b=0;a=0;s=0;a=0;u=0;r=0\nx=input()\nB=x.count('B');u=(x.count('u'))//2;l=x.count('l');b=x.count('b');a=(x.count('a'))//2;s=x.count('s');r=x.count('r')\nprint(min(B,u,l,b,a,s,r))", "import sys\r\ninput = sys.stdin.buffer.readline \r\n\r\ndef process(S):\r\n \"Bulbasaur\"\r\n lower_counts = [0 for i in range(26)]\r\n upper_counts = 0\r\n for c in S:\r\n if 'a' <= c <= 'z':\r\n lower_counts[ord(c)-ord('a')]+=1\r\n elif c=='B':\r\n upper_counts+=1\r\n target = [0 for i in range(26)]\r\n target1 = 0\r\n for c in 'Bulbasaur':\r\n if 'a' <= c <= 'z':\r\n target[ord(c)-ord('a')]+=1\r\n else:\r\n target1+=1\r\n answer = float('inf')\r\n for i in range(26):\r\n if target[i] > 0:\r\n answer = min(answer, lower_counts[i]//target[i])\r\n answer = min(answer, upper_counts//target1)\r\n print(answer)\r\n return\r\n\r\nS = input().decode().strip()\r\nprocess(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\nstr_inp=lambda:input()\r\nw = input()\r\nc = [w.count(l) for l in \"Bulbasr\"]\r\nc[1] //= 2\r\nc[4] //= 2\r\nprint(min(c))", "n = input()\r\nprint(int(min(n.count('B'), n.count('u')/2,n.count('l'),n.count('b'),n.count('a')/2,n.count('s'),n.count('r'))))", "def function1(string): #B 2u l b 2a s r\r\n B=string.count('B')\r\n u=string.count('u')//2\r\n l=string.count('l')\r\n b=string.count('b')\r\n a=string.count('a')//2\r\n s=string.count('s')\r\n r=string.count('r')\r\n return min(B,u,l,b,a,s,r)\r\ndef main():\r\n string=input()\r\n print(function1(string))\r\nif __name__=='__main__':\r\n main()\r\n", "S = input()\r\nX = [0,0,0,0,0,0,0]\r\nfor i in S:\r\n if (i == \"B\"):\r\n X[0]+=1\r\n #print(str(X[0]) + \" \")\r\n elif(i=='u'):\r\n # print(str(i) + \" \")\r\n X[1]+=1\r\n elif (i=='a'):\r\n X[2]+=1\r\n elif (i=='b'):\r\n X[3]+=1\r\n elif (i=='s'):\r\n X[4]+=1\r\n elif (i=='l'):\r\n X[5]+=1\r\n elif (i=='r'):\r\n X[6]+=1\r\n#print()\r\nX[1]//=2\r\nX[2]//=2\r\nmin = len(S)\r\nfor i in X:\r\n #print (str(i) +\" \")\r\n if(i<min):\r\n min = i\r\nprint(min)", "count={'B':0,'u':0,'l':0,'b':0,'a':0,'s':0,'r':0}\r\ns = input()\r\nfor i in s:\r\n if i in count:\r\n count[i]+=1\r\ncount['a']//=2\r\ncount['u']//=2\r\nmint = count['B']\r\nfor i in count:\r\n if(count[i]<mint):\r\n mint=count[i]\r\nprint(mint)" ]

[ "import math\r\nimport bisect\r\n\r\n\r\ndef getList(method=int):\r\n return list(map(method, input().split()))\r\n\r\n\r\ndef getInt():\r\n return int(input())\r\n\r\n\r\ndef hasGreater(c):\r\n global mp\r\n for k, v in mp.items():\r\n if c > k and v:\r\n return True\r\n return False\r\n\r\n\r\ns = [v for v in input()]\r\nt = []\r\nans = ''\r\nn = len(s)\r\nmp = {chr(ord('a') + i): 0 for i in range(26)}\r\nfor v in s:\r\n mp[v] += 1\r\n\r\nfor v in s:\r\n if len(t):\r\n while len(t) and not hasGreater(t[-1]):\r\n ans += t.pop()\r\n\r\n t.append(v)\r\n mp[v] -= 1\r\n\r\nwhile len(t):\r\n ans += t.pop()\r\n\r\nprint(ans)\r\n", "\r\n\r\n\r\n\r\n\r\ns=input()\r\n\r\nans=\"\"\r\n\r\nt=[]\r\n\r\nd=[0 for _ in range(27)]\r\nfor i in s:\r\n d[ord(i)-ord(\"a\")]+=1 \r\n\r\nd[-1]=float('inf')\r\nx=0 \r\n\r\ni=0 \r\nn=len(s)\r\n\r\n\r\nwhile i<n:\r\n # print(i,x,t)\r\n while d[x]<=0:\r\n x+=1\r\n \r\n \r\n if len(t)>0 and x+ord('a')>=ord(t[-1]):\r\n ans+=t.pop(-1)\r\n else:\r\n d[ord(s[i])-ord('a')]-=1 \r\n t.append(s[i])\r\n i+=1 \r\n \r\nprint(ans+\"\".join(t[::-1]))", "import sys\r\nimport math\r\nfrom collections import defaultdict, Counter\r\nfrom bisect import *\r\nfrom string import ascii_lowercase\r\n\r\n\r\ndef readInts():\r\n x = list(map(int, (sys.stdin.readline().rstrip().split())))\r\n return x[0] if len(x) == 1 else x\r\n\r\n\r\ndef readList(type=int):\r\n x = sys.stdin.readline()\r\n x = list(map(type, x.rstrip('\\n\\r').split()))\r\n return x\r\n\r\n\r\ndef readStr():\r\n x = sys.stdin.readline().rstrip('\\r\\n')\r\n return x\r\n\r\n\r\nwrite = sys.stdout.write\r\nread = sys.stdin.readline\r\n\r\n\r\ndef solve():\r\n s = readStr()\r\n t = []\r\n n = len(s)\r\n suff = [\"z\"] * n\r\n suff[-1] = s[-1]\r\n for i in range(n - 2, -1, -1):\r\n suff[i] = min(suff[i + 1], s[i])\r\n u = []\r\n for i, c in enumerate(s):\r\n t.append(c)\r\n while t and i + 1 < n and t[-1] <= suff[i + 1]:\r\n u += t.pop()\r\n u += t[::-1]\r\n print(\"\".join(u))\r\n\r\n\r\ndef main():\r\n t = 1\r\n # t = readInts()\r\n for _ in range(t):\r\n solve()\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "f = lambda q: ord(q) - 97\ns, t, u = input(), [], \"\"\nk = [0] * 26\nfor i in s:\n k[f(i)] += 1\nfor i in s:\n t.append(i)\n k[f(i)] -= 1\n while t and sum(k[:f(t[-1])]) == 0:\n u += t.pop()\nprint(u)\n\t\t \t \t \t\t \t\t\t \t\t\t\t \t \t\t\t \t", "\r\nfrom collections import Counter\r\n\r\n\r\ns = input()\r\ncnt = Counter(s)\r\nans = []\r\nrobot = []\r\n\r\ndef findSmallest():\r\n for smallest in sorted(cnt):\r\n if cnt[smallest] > 0:\r\n return smallest\r\n \r\n \r\n \r\nsmallest = findSmallest() \r\nfor c in s:\r\n if c != smallest:\r\n robot.append(c)\r\n cnt[c] -= 1\r\n else:\r\n ans.append(c)\r\n cnt[c] -= 1\r\n \r\n if cnt[smallest] == 0:\r\n del cnt[smallest]\r\n smallest = findSmallest()\r\n \r\n if smallest is None:\r\n ans.extend(robot[::-1])\r\n break\r\n else:\r\n while robot and robot[-1] <= smallest:\r\n ans.append(robot.pop())\r\n\r\nprint(''.join(ans))", "from collections import defaultdict\r\nfrom collections import Counter\r\n \r\ndef parse():\r\n return(int(input()))\r\n \r\ndef parse2():\r\n return(list(map(int,input().split())))\r\n \r\ndef parsestr():\r\n return input()\r\n \r\ndef solve():\r\n s = parsestr()\r\n n = len(s)\r\n best = [0]*(n+1)\r\n best[-1] = 'z'\r\n for i in range(n-1,-1,-1):\r\n best[i] = min(best[i+1], s[i])\r\n \r\n ans = []\r\n stack = []\r\n cur = 0\r\n while (stack or cur < n):\r\n if stack and stack[-1] <= best[cur]:\r\n ans.append(stack.pop())\r\n else:\r\n stack.append(s[cur])\r\n cur += 1\r\n print(''.join(ans))\r\n \r\nif __name__ == '__main__':\r\n solve()", "s = input()\r\nc = ['z'] * (len(s)+1)\r\nfor i in range(len(s)-1,-1,-1):\r\n c[i] = min(s[i], c[i+1])\r\n # print(i, \"c[i] is \", c[i])\r\nl = []\r\nj = 0\r\nwhile len(l) > 0 or j < len(s):\r\n if len(l) > 0 and l[len(l)-1] <= c[j]:\r\n # print(\"c[j] is\",c[j])\r\n print(l[len(l)-1], end=\"\")\r\n l.pop()\r\n else:\r\n l.append(s[j])\r\n # print(s[j])\r\n j += 1\r\n\r\n\r\n\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = input()[:-1]\r\nn = len(s) \r\na, b = [], '' \r\nf = [0] * 26 \r\nfor i in range(n):\r\n f[ord(s[i]) - ord('a')] += 1 \r\nfor i in range(n):\r\n a.append(s[i]) \r\n f[ord(s[i]) - ord('a')] -= 1 \r\n while(a and sum(f[:ord(a[-1]) - ord('a')]) == 0):\r\n b += a.pop() \r\nprint(b)\r\n", "s=input()\nt=[]\nu=[]\nalpha=[0]*26\nfor i in s:\n\talpha[ord(i)-97]+=1\nfor i in s:\n\tt+=i\n\talpha[ord(i)-97]-=1\n\twhile( t and sum(alpha[:(ord(t[-1])-97)])==0):\n\t\tu+=t[-1]\n\t\tt.pop()\nprint(\"\".join(u))\n", "from collections import Counter\r\n\r\ns = input()\r\ncn = Counter(s)\r\nt, u = [], []\r\ni = 0\r\nfor c in 'abcdefghijklmnopqrstuvwxyz':\r\n while t and t[-1] <= c:\r\n u.append(t[-1])\r\n t.pop()\r\n while cn[c] > 0:\r\n if s[i] == c:\r\n u.append(s[i])\r\n else:\r\n t.append(s[i])\r\n cn[s[i]] -= 1\r\n i += 1\r\nprint(\"\".join(u))\r\n", "# Minimal String\r\ns = input()\r\nlenth = len(s)\r\nmn = [0]*(lenth)\r\nmnn = s[-1]\r\nfor i in range(lenth-1, -1, -1):\r\n mnn = min(mnn, s[i])\r\n mn[i] = mnn\r\nst = []\r\nfor i in range(0, lenth):\r\n while(len(st) != 0 and st[-1] <= mn[i]):\r\n print(st.pop(), end='')\r\n st.append(s[i])\r\nwhile(len(st) != 0):\r\n print(st.pop(), end='')\r\n", "stack = input()\r\n\r\nn = len(stack)\r\n\r\naux = [0] * n\r\naux[-1] = stack[-1]\r\nfor i in range(n - 2, -1, -1):\r\n aux[i] = min(aux[i + 1], stack[i])\r\n\r\nsecond_stack = []\r\nresult_stack = []\r\n\r\nfor i in range(n):\r\n if not second_stack:\r\n second_stack.append(stack[i])\r\n else:\r\n while second_stack:\r\n if second_stack[-1] <= aux[i]:\r\n result_stack.append(second_stack.pop())\r\n else:\r\n break\r\n second_stack.append(stack[i])\r\n\r\nwhile second_stack:\r\n result_stack.append(second_stack.pop())\r\n\r\nprint(''.join(result_stack))", "# s = input().strip()\r\n\r\n# s_list = list(s)\r\n\r\n# t = []\r\n# u = []\r\n# i = 0\r\n\r\n# while i < len(s):\r\n# if s_list[0] == min(s_list):\r\n# if t:\r\n# if (s_list[0] < t[-1]):\r\n# u.append(s_list[0])\r\n# else:\r\n# while t and s_list[0] >= t[-1]:\r\n# u.append(t.pop())\r\n# t.append(s_list[0])\r\n# else:\r\n# u.append(s_list[0])\r\n# else:\r\n# t.append(s_list[0])\r\n\r\n# del s_list[0]\r\n\r\n# # print(t, u)\r\n# i += 1\r\n\r\n# if t:\r\n# u.extend(reversed(t))\r\n\r\n# print(*u, sep=\"\")\r\n\r\ns = input()\r\na = [0]*26\r\nfor i in s:\r\n a[ord(i)-97] += 1\r\nt, u = [], []\r\nfor i in s:\r\n t.append(i)\r\n a[ord(i)-97] -= 1\r\n while t and sum(a[:ord(t[-1])-97]) == 0:\r\n u.append(t.pop())\r\n # print(u)\r\nprint(''.join(u))\r\n", "s = input()\r\n\r\nlength = len(s)\r\nmn = [0]*(length)\r\nmnn = s[-1]\r\nfor i in range(length-1,-1,-1):\r\n mnn = min(mnn,s[i])\r\n mn[i]=mnn; #min of every index \r\n\r\nst = [] \r\nfor i in range(0, length):\r\n\r\n while (len(st)!=0 and st[-1]<=mn[i]):\r\n print(st.pop(), end='')\r\n st.append(s[i])\r\n\r\nwhile(len(st)!=0):\r\n print(st.pop(),end='')", "s=input()\r\nn=len(s)\r\nt,u,l=[],[],-1\r\nfor i in range(26):\r\n while t and t[-1]<=chr(97+i):\r\n u.append(t.pop())\r\n for j in range(l+1,n):\r\n if s[j]==chr(97+i):\r\n while l+1<j:\r\n l+=1\r\n t.append(s[l])\r\n u.append(s[j])\r\n l=j\r\nu+=t[::-1]\r\nfor i in u:\r\n print(i,end=\"\")", "s=input()\r\nt=[]\r\nu=[]\r\nalpha=[0]*26\r\nfor i in s:\r\n\talpha[ord(i)-97]+=1\r\nfor i in s:\r\n\tt+=i\r\n\talpha[ord(i)-97]-=1\r\n\twhile( t and sum(alpha[:(ord(t[-1])-97)])==0):\r\n\t\tu+=t[-1]\r\n\t\tt.pop()\r\nprint(\"\".join(u))\r\n", "def solve():\r\n s = input()\r\n\r\n n = len(s)\r\n vec = [-1] * 26\r\n\r\n for i in range(n):\r\n vec[ord(s[i]) - ord('a')] = i\r\n\r\n t, ans = '', ''\r\n\r\n i = 0\r\n curr = 0\r\n\r\n while i < n:\r\n while i <= vec[curr]:\r\n t += s[i]\r\n while t and ord(t[-1]) - ord('a') == curr:\r\n ans += t[-1]\r\n t = t[:-1]\r\n i += 1\r\n curr += 1\r\n while t and ord(t[-1]) - ord('a') <= curr:\r\n ans += t[-1]\r\n t = t[:-1]\r\n\r\n ans += t[::-1]\r\n\r\n print(ans)\r\n\r\nsolve()\r\n", "ini = list(input())\r\nini.reverse()\r\n\r\nmenorAte = [ini[0]]\r\nfor i in range(1, len(ini)):\r\n menorAte.append(min(menorAte[i-1], ini[i]))\r\nmid = []\r\nfim = []\r\n\r\nwhile len(ini) > 0:\r\n if ini[-1] <= menorAte[-1]:\r\n fim.append(ini.pop())\r\n menorAte.pop()\r\n while len(mid) > 0 and len(menorAte) > 0 and mid[-1] <= menorAte[-1]:\r\n fim.append(mid.pop())\r\n else:\r\n mid.append(ini.pop())\r\n menorAte.pop()\r\n \r\n\r\nwhile len(mid) > 0:\r\n fim.append(mid.pop())\r\n\r\nprint(''.join(fim))\r\n\r\n\r\n\r\n", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\ns=input()\r\nn=len(s)\r\nfreq=[0]*27\r\nfor i in range(n):\r\n freq[ord(s[i])+1-97]+=1\r\nfor i in range(1,27):\r\n freq[i]+=freq[i-1]\r\nu,t=[],[]\r\nfor i in range(n):\r\n t.append(s[i])\r\n for i in range(ord(s[i])-97+1,27):\r\n freq[i]-=1\r\n while(len(t)>0 and freq[ord(t[-1])-97]<1):\r\n u.append(t.pop())\r\nprint(''.join(u))", "import math\r\nimport random\r\nimport os,sys,io\r\nfrom collections import defaultdict,deque\r\nfrom heapq import heapify,heappop,heappush\r\nimport bisect\r\nfrom collections import Counter\r\nimport collections\r\nfrom functools import lru_cache\r\nimport time\r\nfrom typing import List\r\nfrom math import log\r\n\r\nfrom random import randint,seed\r\nfrom time import time\r\n\r\n\r\ns=input()\r\nn=len(s)\r\n\r\nsuff=[(s[n-1],n-1)]*n\r\nfor i in range(n-2,-1,-1):\r\n if s[i]<=suff[i+1][0]:suff[i]=(s[i],i)\r\n else:suff[i]=suff[i+1]\r\n\r\n\r\nstack,i,out=[],0,[]\r\nwhile i<n:\r\n\r\n if not stack:\r\n c, j = suff[i]\r\n while i<j:\r\n stack.append(s[i])\r\n i+=1\r\n i=j+1\r\n out.append(c)\r\n else:\r\n last=stack[-1]\r\n c, j = suff[i]\r\n if last<=c:\r\n stack.pop()\r\n out.append(last)\r\n else:\r\n while i < j:\r\n stack.append(s[i])\r\n i += 1\r\n i=j+1\r\n out.append(c)\r\nwhile stack:\r\n out.append(stack[-1])\r\n stack.pop()\r\nprint(\"\".join(out))", "f = lambda q: ord(q) - 97\r\ns, t, u = input(), [], ''\r\nk = [0] * 26\r\nfor i in s: k[f(i)] += 1\r\nfor i in s:\r\n t.append(i)\r\n k[f(i)] -= 1\r\n while t and sum(k[:f(t[-1])]) == 0: u += t.pop()\r\nprint(u)", "import sys\r\n#import random\r\nfrom bisect import bisect_right as rb\r\nfrom collections import deque\r\n#sys.setrecursionlimit(10**8)\r\nfrom queue import PriorityQueue\r\nfrom math import *\r\ninput_ = lambda: sys.stdin.readline().strip(\"\\r\\n\")\r\nii = lambda : int(input_())\r\nil = lambda : list(map(int, input_().split()))\r\nilf = lambda : list(map(float, input_().split()))\r\nip = lambda : input_()\r\nfi = lambda : float(input_())\r\nap = lambda ab,bc,cd : ab[bc].append(cd)\r\nli = lambda : list(input_())\r\npr = lambda x : print(x)\r\nprinT = lambda x : print(x)\r\nf = lambda : sys.stdout.flush()\r\ninv =lambda x:pow(x,mod-2,mod)\r\nmod = 10**9 + 7\r\n\r\ns = list(ip())\r\n\r\nsuf = ['z' for i in range (len(s)+2)]\r\n\r\nsuf[len(s)-1] = s[len(s)-1]\r\n\r\nfor i in range (len(s)-1,0,-1) :\r\n suf[i-1] = min(s[i-1],suf[i])\r\n\r\nans = []\r\n\r\nx = suf[0]\r\nb = []\r\ni = 0\r\n\r\nwhile (i<len(s)) or (len(b) > 0) :\r\n #print(i,b)\r\n if (len(b) > 0) and b[len(b)-1] <= suf[i] :\r\n ans.append(b[len(b)-1])\r\n b.pop()\r\n else :\r\n b.append(s[i])\r\n i += 1\r\n\r\nprint(''.join(ans))\r\n", "#import io,os\n#input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\n\ndef main(t):\n\n s = input()\n n = len(s)\n lists = list(s)\n minnext = [0]*n + ['z']\n for i in range(n-1,-1,-1):\n minnext[i] = min(s[i],minnext[i+1])\n \n ans = []\n stack = []\n for i in range(n):\n while stack and minnext[i] >= stack[-1]:\n ans.append(stack.pop())\n \n\n stack.append(s[i])\n \n \n \n \n while stack:\n ans.append(stack.pop())\n \n \n print(\"\".join(ans))\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\nT = 1 #int(input())\nt = 1\nwhile t<=T:\n main(t)\n t += 1\n", "# f = open(\"data.txt\", \"r\")\r\n\r\n# get_input = f.readline\r\nget_input = input\r\ns = get_input().strip()\r\ncounter = [0] * 26\r\nfor letter in s:\r\n counter[ord(letter) - ord(\"a\")] += 1\r\n\r\nt = \"\"\r\nu = \"\"\r\nfor letter in s:\r\n t += letter\r\n counter[ord(letter) - ord(\"a\")] -= 1\r\n while len(t) > 0 and sum(counter[:ord(t[-1])- ord(\"a\")]) == 0 :\r\n u += t[-1]\r\n t = t[:-1]\r\nprint(u)\r\n# f.close()\r\n\r\n", "s = list(input())\ns = s[::-1]\naux = []\npilha1 = []\npilha2 = []\nmenor = \"z\"\n\nfor i in range(len(s)):\n menor = min(s[i], menor)\n aux.append(menor)\n\nfor i in range(len(s)-1, -1,-1):\n if s[i] == aux[i]:\n pilha2.append(s[i])\n s.pop()\n aux.pop()\n while(len(pilha1) > 0):\n if len(aux) == 0 or pilha1[-1] <= aux[-1]:\n pilha2.append(pilha1[-1])\n pilha1.pop()\n else: break\n else:\n pilha1.append(s[i])\n s.pop()\n aux.pop()\n \nprint(*pilha2, sep=\"\")\n\n \t\t\t\t\t\t \t \t\t \t\t\t \t \t \t \t", "s = input()\r\nn=len(s)\r\nfreq = [0]*26\r\nif len(s)==0:\r\n print(\"\")\r\nfor i in s:\r\n freq[ord(i)-ord(\"a\")]+=1\r\n\r\nstack=[]\r\nans = \"\"\r\nfor i in range(n):\r\n stack.append(s[i])\r\n freq[ord(s[i])-ord(\"a\")]-=1\r\n flag = True\r\n while len(stack) and flag:\r\n for j in reversed(range(ord(stack[-1])-ord(\"a\"))):\r\n if freq[j]>0:\r\n flag=False\r\n if flag:\r\n ans+=stack[-1]\r\n stack.pop()\r\nprint(ans)", "import string\r\n\r\n\r\ndef solve(s):\r\n alpha = {x: i for i, x in enumerate(list(string.ascii_lowercase))}\r\n t, u = [], []\r\n s = list(s)[::-1]\r\n char_count = [0] * 26\r\n for char in s:\r\n char_count[alpha[char]] += 1\r\n while s:\r\n char = s.pop()\r\n t.append(char)\r\n char_count[alpha[char]] -= 1\r\n m = min([float('inf')] + [i for (i, x) in enumerate(char_count) if x])\r\n while t and m >= alpha[t[-1]]:\r\n u.append(t.pop())\r\n while t:\r\n u.append(t.pop())\r\n\r\n return ''.join(u)\r\n\r\n\r\nprint(solve(input()))", "from collections import defaultdict\r\n\r\ns = list(input())\r\nt, u = [], []\r\nds = defaultdict(int)\r\n \r\nfor c in s:\r\n ds[c] += 1\r\n\r\ncurr_alp_index = ord('a')\r\ncurr_pos_in_s = 0\r\n\r\nwhile curr_alp_index <= ord('z'):\r\n curr_alp = chr(curr_alp_index)\r\n \r\n if len(t) > 0 and ord(t[-1]) <= ord(curr_alp):\r\n letter = t.pop()\r\n u.append(letter)\r\n else:\r\n if ds[curr_alp] > 0:\r\n letter = s[curr_pos_in_s]\r\n curr_pos_in_s += 1\r\n t.append(letter)\r\n ds[letter] -= 1\r\n else:\r\n curr_alp_index += 1\r\n \r\nt.reverse()\r\nprint(\"\".join(u + t))", "from collections import Counter\r\n\r\ns = input()\r\n\r\nstack = []\r\nres = \"\"\r\ndic = Counter(s)\r\n\r\nfor c in s:\r\n for alph in \"abcdefghijklmnopqrstuvwxyz\":\r\n while stack and stack[-1] <= alph:\r\n res += stack.pop()\r\n if dic.get(alph, 0) == 0:\r\n continue\r\n\r\n if c == alph: res += c\r\n else: stack.append(c)\r\n\r\n dic[c] -= 1\r\n break\r\n\r\nwhile stack:\r\n res += stack.pop()\r\n\r\nprint(res)\r\n\r\n# cadbfbace\r\n# aabcefbdc\r\n\r\n\r\n\r\n\r\n# s = acdbadca\r\n#\r\n# t = cdb\r\n# u = abdc", "from collections import Counter\r\ns=input()\r\nt_stack=[]\r\nu=\"\"\r\n\r\nfrequency_count=Counter(s)\r\n\r\nfor index in range(len(s)):\r\n frequency_count[s[index]]-=1\r\n t_stack.append(s[index])\r\n if not frequency_count[s[index]]:\r\n del frequency_count[s[index]]\r\n while t_stack and frequency_count and min(frequency_count)>= t_stack[-1]:\r\n u+=t_stack.pop()\r\nwhile t_stack:\r\n u+=t_stack.pop()\r\nprint(u)\r\n ", "s = list(input())\ns.reverse()\nn = len(s)\nmin_char = [s[0]]\nfor i in range(1,n):\n min_char.append(min(s[i],min_char[i-1]))\n\nt = []\nu = []\n\nwhile len(u) < n:\n if len(t)==0:\n t.append(s.pop())\n elif len(s)==0:\n u.append(t.pop())\n else:\n if min_char[len(s)-1] < t[-1]:\n t.append(s.pop())\n else:\n u.append(t.pop())\nprint(''.join(u))\n", "from collections import Counter\r\n\r\ns = input()\r\nletters = Counter(s)\r\n \r\ndef add_letter(c):\r\n for l in letters:\r\n if l < c: return False\r\n return True\r\n\r\nans, stack = [], []\r\nfor c in s:\r\n letters[c] -= 1\r\n if not letters[c]:\r\n del letters[c]\r\n stack.append(c)\r\n while stack and add_letter(stack[-1]):\r\n ans.append(stack.pop())\r\n \r\nwhile stack:\r\n ans.append(stack.pop())\r\n \r\nprint(''.join(ans))", "import sys\r\nimport threading\r\n# input=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\ts=list(rs())\r\n\tt=[]\r\n\tu=[]\r\n\tct=[0]*26\r\n\tfor i in s:\r\n\t\tct[ord(i)-ord('a')]+=1\r\n\tfor i in s:\r\n\t\tt.append(i)\r\n\t\tct[ord(i)-ord('a')]-=1\r\n\t\twhile t and sum(ct[:ord(t[-1])-ord('a')])==0:\r\n\t\t\tu.append(t.pop())\r\n\tprint(*u,sep='')\r\n\tpass\r\n\r\nmain()\r\n#threading.Thread(target=main).start()\r\n", "\r\nfrom collections import Counter, deque\r\n\r\ns = input()\r\n\r\nn = len(s)\r\n\r\nmn = ['z'] * (n + 1)\r\nfor i in range(n - 1, -1, -1):\r\n mn[i] = min(mn[i + 1], s[i])\r\n\r\nt, u = [], []\r\n\r\nfor i in range(n):\r\n \r\n while t and t[-1] <= mn[i]:\r\n u.append(t.pop())\r\n \r\n if s[i] == mn[i]:\r\n u.append(s[i])\r\n else:\r\n t.append(s[i])\r\n\r\nwhile t:\r\n u.append(t.pop())\r\n\r\nprint(''.join(u))\r\n\r\n", "import math\r\nimport random\r\nimport os,sys,io\r\nfrom collections import defaultdict,deque\r\nfrom heapq import heapify,heappop,heappush\r\nimport bisect\r\nfrom collections import Counter\r\nimport collections\r\nfrom functools import lru_cache\r\nimport time\r\nfrom typing import List\r\nfrom math import log\r\n\r\nfrom random import randint,seed\r\nfrom time import time\r\n\r\n\r\ns=input()\r\npq=[(c,i) for i,c in enumerate(s)]\r\nheapify(pq)\r\nstack,i,out=[],0,[]\r\nwhile pq:\r\n while pq and pq[0][1]<i:heappop(pq)\r\n if not pq :break\r\n if not stack:\r\n c, j = heappop(pq)\r\n while i<j:\r\n stack.append(s[i])\r\n i+=1\r\n i=j+1\r\n out.append(c)\r\n else:\r\n last=stack[-1]\r\n c, j = pq[0]\r\n if last<=c:\r\n stack.pop()\r\n out.append(last)\r\n else:\r\n heappop(pq)\r\n while i < j:\r\n stack.append(s[i])\r\n i += 1\r\n i=j+1\r\n out.append(c)\r\nwhile stack:\r\n out.append(stack[-1])\r\n stack.pop()\r\nprint(\"\".join(out))", "s = input()\r\nst = []\r\nans = ''\r\nmn = ['~'] * (len(s) + 1)\r\nmn[len(s) - 1] = s[-1]\r\nfor i in range(len(s) - 2, -1, -1):\r\n mn[i] = min(mn[i + 1], s[i])\r\nfor i in range(len(s)):\r\n while st and st[-1] <= mn[i]:\r\n ans += st.pop()\r\n st.append(s[i])\r\nwhile st:\r\n ans += st.pop()\r\nprint(ans)", "from sys import stdin\r\nfrom collections import deque\r\ninput = stdin.readline\r\n\r\ns = input().strip()\r\nt = []\r\nu = []\r\n\r\nx = deque()\r\ncur_min = \"z\"\r\nfor i in range(len(s)-1, -1, -1):\r\n cur_min = min(cur_min, s[i])\r\n x.appendleft(cur_min)\r\ni = 0\r\nwhile i < len(s):\r\n if len(t) > 0 and t[-1] <= x[i]:\r\n u.append(t.pop())\r\n else:\r\n target = x[i]\r\n while s[i] != target:\r\n t.append(s[i])\r\n i += 1\r\n t.append(s[i])\r\n i += 1\r\nwhile t:\r\n u.append(t.pop())\r\nprint(*u, sep=\"\")", "from collections import Counter\r\nfrom heapq import heappush, heappop\r\n\r\ns = input()\r\nc = Counter(s)\r\np, st = [], []\r\nans = \"\"\r\nfor i in s:\r\n heappush(p, i)\r\nfor i in s:\r\n while st and p and st[-1] <= p[0]:\r\n ans += st.pop()\r\n while p and not c[p[0]]:\r\n heappop(p)\r\n st.append(i)\r\n c[i] -= 1\r\nwhile st:\r\n ans += st.pop()\r\n\r\nprint(ans)\r\n", "s=input()\r\ns1=[]\r\ns2=[]\r\nalpha=[0]*26\r\nfor i in s:\r\n alpha[ord(i)-97]+=1\r\nfor i in s:\r\n s1+=i\r\n alpha[ord(i)-97]-=1\r\n while( s1 and sum(alpha[:(ord(s1[-1])-97)])==0):\r\n s2+=s1[-1]\r\n s1.pop()\r\nprint(\"\".join(s2))\r\n", "entrada = input()\r\n\r\nmenor = 'z'\r\nmenores = []\r\nfor i in range(len(entrada) - 1, -1, -1):\r\n elem = entrada[i]\r\n if elem < menor:\r\n menor = elem\r\n menores.append(menor)\r\n\r\nmenores = menores[::-1]\r\n\r\nt = []\r\nu = []\r\nfor i in range(len(entrada)):\r\n if not t:\r\n t.append(entrada[i])\r\n else:\r\n while t:\r\n if t[-1] <= menores[i]:\r\n u.append(t[-1])\r\n t.pop()\r\n else:\r\n break\r\n t.append(entrada[i])\r\n \r\nt = t[::-1]\r\n\r\nfor e in t:\r\n u.append(e)\r\n\r\nprint(''.join(u))", "s = input()\r\nn=[]\r\nfor i in range(len(s)):\r\n n.append(\"z\")\r\nn[-1] = s[-1]\r\na = s[-1]\r\nfor i in range(len(s)-2, -1, -1):\r\n if a>s[i]:\r\n a=s[i]\r\n n[i] = a\r\nindex= n.index(min(n))\r\nq = []\r\nu= ''\r\nfor i in range(len(s)):\r\n while q and q[-1] <= n[i]:\r\n u += q.pop()\r\n q.append(s[i])\r\nprint(u+ ''.join(map(str, (q[::-1]))))", "s = input()\r\nc = [0] * 26\r\nfor i in s:\r\n c[ord(i) - 97] += 1\r\nt, u = [], []\r\nfor i in s:\r\n t.append(i)\r\n c[ord(i)-97] -= 1\r\n while t and sum(c[: (ord(t[-1]) - 97)]) == 0 :\r\n u.append(t.pop())\r\n \r\nprint(''.join(u)) ", "from collections import deque\r\n\r\ns = list(input())\r\ns_deque = deque(s)\r\n\r\nch_cnt = {}\r\nfor ch in s:\r\n if ch not in ch_cnt:\r\n ch_cnt[ch] = 0\r\n ch_cnt[ch] += 1\r\n\r\nt = []\r\nu = \"\"\r\n\r\nwhile s_deque:\r\n ch = s_deque.popleft()\r\n\r\n while t and all(t[-1] <= i for i in ch_cnt):\r\n tmp_ch = t.pop()\r\n u += tmp_ch\r\n t.append(ch)\r\n ch_cnt[ch] -= 1\r\n if ch_cnt[ch] == 0:\r\n del ch_cnt[ch]\r\n\r\nwhile t:\r\n tmp_ch = t.pop()\r\n u += tmp_ch\r\n\r\nprint(u)\r\n\r\n", "from collections import Counter, deque\r\n\r\nS = input()\r\nT = deque([])\r\nans = \"\"\r\n\r\ncnt = Counter(S)\r\n\r\nfor i,s in enumerate(S):\r\n T.append(s)\r\n cnt[s] -= 1\r\n while T:\r\n smaller = 0\r\n tmp = T[-1]\r\n for key in cnt.keys():\r\n if key < tmp and cnt[key] > 0:\r\n smaller = 1\r\n break\r\n if smaller:\r\n break\r\n else:\r\n ans += T.pop()\r\n \r\nprint(ans)", "# 797C: Minimal string\r\n\r\ndef find_min(count):\r\n for i in range(26):\r\n if count[i] > 0:\r\n return i\r\n return -1\r\n\r\ndef calc_pos(letter):\r\n return ord(letter) - ord('a')\r\n\r\ns = input()\r\ncount= [0 for i in range(26)]\r\nfor c in s: \r\n count[calc_pos(c)] += 1\r\nt =[]\r\nu =''\r\n\r\nfor i in range(len(s)):\r\n t.append(s[i])\r\n count[calc_pos(s[i])] -= 1\r\n while t and find_min(count) != -1 and calc_pos(t[-1]) <= find_min(count): \r\n u += t.pop()\r\n\r\nwhile len(t) > 0: \r\n u += t.pop()\r\n\r\nprint(u)\r\n", "def robotWithString(s: str) -> str:\r\n ans=\"\"\r\n t=0\r\n temp=[]\r\n for curr in range(26):\r\n if t==len(s):\r\n break\r\n c=chr(ord(\"a\")+curr)\r\n while temp and temp[-1]<=c:\r\n ans+=temp.pop()\r\n o=t\r\n q=0\r\n for ind in range(t,len(s)):\r\n if s[ind]==c:\r\n o=ind+1\r\n q+=1\r\n if q>0:\r\n ans+=c*q\r\n for u in range(t,o):\r\n if s[u]==c:\r\n pass\r\n else :\r\n temp.append(s[u])\r\n t=o\r\n while temp:\r\n ans+=temp.pop()\r\n \r\n return ans \r\nprint(robotWithString(input()))", "s = input()\r\nif len(s) == 1:\r\n print(s)\r\n exit()\r\n# first of s and put at end of t\r\n# last of t and put at end of u\r\n# minimal u\r\nalpha = [0]*26\r\nfor x in s:\r\n alpha[ord(x)-97]+=1\r\nt = []\r\nu = []\r\nfor x in s:\r\n t.append(x)\r\n alpha[ord(x)-97]-=1\r\n while t and sum(alpha[:(ord(t[-1])-97)]) == 0:\r\n u.append(t.pop())\r\nprint(\"\".join(u))", "def fnz(l):\r\n for i in range(len(l)):\r\n if l[i] != 0:\r\n return i\r\n return i\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\ncount_alph = [0]*26\r\ns = input()\r\nt = []\r\nu = []\r\nfor i in s:\r\n count_alph[alphabets.index(i)] +=1\r\n\r\nfor i in s:\r\n t.append(i)\r\n count_alph[alphabets.index(i)] -=1\r\n while t[-1] <= alphabets[fnz(count_alph)]:\r\n u.append(t.pop())\r\n if len(t) == 0:\r\n break\r\nu = u + t[::-1]\r\nans = \"\"\r\nfor i in u:\r\n ans += i\r\nprint(ans)", "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\ns=input()\nn=len(s)\nt=[]\nu=[]\nL=-1\nfor i in range(26):\n while t and t[-1]<=chr(97+i):\n u.append(t.pop())\n for j in range(L+1,n):\n if s[j]==chr(97+i):\n while L+1<j:\n L+=1\n t.append(s[L])\n u.append(s[j])\n L=j\n\nu+=t[::-1]\nprint(''.join(u))\n", "s=input()\r\nt=[]\r\nu=[]\r\nk=[0]*26\r\nfor i in s:\r\n k[ord(i)-97]+=1\r\nfor i in s:\r\n t+=i\r\n k[ord(i)-97]-=1\r\n while t and sum(k[0:ord(t[-1])-97])==0:\r\n u+=t[-1]\r\n t.pop()\r\nprint(\"\".join(u))\r\n ", "s=input()\r\n \r\nc=[0]*26\r\n \r\nfor i in s:\r\n \r\n c[ord(i)-97]+=1\r\n \r\nt=[]\r\n \r\nu=[]\r\n \r\nfor i in s:\r\n \r\n t.append(i)\r\n \r\n c[ord(i)-97]-=1\r\n \r\n while t and sum(c[:(ord(t[-1])-97)])==0:\r\n \r\n u.append(t.pop())\r\n \r\n \r\n \r\nprint(''.join(u))" ]

[ "import sys\r\ninput = sys.stdin.buffer.readline\r\n\r\nn = int(input())\r\nl = 3 * pow(10, 6) + 5\r\ncnt = [0] * l\r\nfor i in list(map(int, input().split())):\r\n cnt[i] += 1\r\nc1, c2 = [0] * l, [0] * l\r\nm0 = pow(10, 8)\r\nfor i in range(1, l):\r\n ci = cnt[i]\r\n if i * i < l:\r\n j = i * i\r\n c1[j] += ci * (ci - 1) // m0\r\n c2[j] += ci * (ci - 1) % m0\r\n if c2[j] > m0:\r\n c1[j] += 1\r\n c2[j] %= m0\r\n else:\r\n break\r\n j = i * (i + 1)\r\n while j < l:\r\n cj = cnt[j // i]\r\n c1[j] += 2 * ci * cj // m0\r\n c2[j] += 2 * ci * cj % m0\r\n if c2[j] > m0:\r\n c1[j] += 1\r\n c2[j] %= m0\r\n j += i\r\nn0 = n * (n - 1)\r\nfor i in range(1, l):\r\n c1[i] += c1[i - 1]\r\n c2[i] += c2[i - 1]\r\n if c2[i] > m0:\r\n c1[i] += 1\r\n c2[i] %= m0\r\nm = int(input())\r\nfor i in list(map(int, input().split())):\r\n ans = n0 - (m0 * c1[i - 1] + c2[i - 1])\r\n print(ans)", "def main():\r\n n = int(input())\r\n numberOfBalls = [0] * 3000100\r\n area = [0] * 3000100\r\n \r\n numbers = list(map(int, input().split()))\r\n for i in range(n):\r\n a = numbers[i]\r\n numberOfBalls[a] += 1\r\n \r\n for i in range(1, 3000100):\r\n if numberOfBalls[i] != 0:\r\n for j in range(i, 3000100, i):\r\n if j // i != i:\r\n area[j] += numberOfBalls[i] * numberOfBalls[j // i]\r\n else:\r\n area[j] += numberOfBalls[i] * (numberOfBalls[i] - 1)\r\n \r\n for i in range(1, 3000100):\r\n area[i] += area[i - 1]\r\n \r\n m = int(input())\r\n p_values = list(map(int, input().split()))\r\n for p in p_values:\r\n print(n * (n - 1) - area[p - 1])\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()# 1690851364.580543", "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 a = -a\r\n k = a // b\r\n k = -k\r\n return k\r\n# arr=list(map(int, input().split()))\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\n\r\n\r\n\r\n\r\nn=int(input())\r\narr=list(map(int, input().split()))\r\nm=int(input())\r\np=list(map(int,input().split()))\r\nma=max(p)\r\nif(n==1):\r\n print(0)\r\n exit()\r\ndic={}\r\nfor i in range(n):\r\n if(arr[i] in dic):\r\n dic[arr[i]]+=1\r\n else:\r\n dic[arr[i]]=1\r\ntot=n*(n-1)\r\nprep=[0]*(ma+1)\r\nfor i in range(1,ma+1):\r\n if(not(i in dic)):\r\n continue\r\n if(i*i<=ma):\r\n prep[i*i]+=dic[i]*(dic[i]-1)\r\n for j in range(i+1,ma+1):\r\n if(i*j>ma):\r\n break\r\n if(not(j in dic)):\r\n continue\r\n prep[i*j]+=(2*(dic[i]*dic[j]))\r\nsu=0\r\nfor i in range(1,ma+1):\r\n temp=prep[i]\r\n prep[i]=tot-su\r\n su+=temp\r\nfor j in range(m):\r\n print(prep[p[j]])" ]

[ "import sys\r\nsys.setrecursionlimit(10 ** 8)\r\n\r\ncycle = False\r\ndef DFS(i, graph, result, visited):\r\n\tglobal cycle\r\n\tstack = [i]\r\n\twhile len(stack) != 0:\r\n\t\tu = stack[-1]\r\n\t\tvisited[u] = 1\r\n\t\tif len(graph[u]) != 0:\r\n\t\t\tv = graph[u].pop()\r\n\t\t\tif visited[v] == 1:\r\n\t\t\t\tcycle = True\r\n\t\t\t\treturn\r\n\t\t\tif visited[v] == 2:\r\n\t\t\t\tcontinue\r\n\t\t\tstack.append(v)\r\n\t\t\tvisited[u] = 1\r\n\t\telse:\r\n\t\t\tresult.append(u)\r\n\t\t\tstack.pop()\r\n\t\t\tvisited[u] = 2\r\n\r\n\r\ndef TopoSort(graph, result):\r\n\tfor i in range(m):\r\n\t\tif not visited[requiredCourse[i]]:\r\n\t\t\tDFS(requiredCourse[i], graph, result, visited)\r\n\treturn result\r\n\r\n\r\nn, m = map(int, input().split())\r\nrequiredCourse = list(map(int, input().split()))\r\ngraph = [[] for i in range(n + 1)]\r\nresult = []\r\nvisited = [False for i in range(n + 1)]\r\nfor i in range(1, n + 1):\r\n\ttmp = list(map(int, input().split()))\r\n\tif tmp[0] == 0:\r\n\t\tcontinue\r\n\r\n\tfor j in range(1, tmp[0] + 1):\r\n\t\tgraph[i].append(tmp[j])\r\n\r\nres = TopoSort(graph, result)\r\nif cycle == True:\r\n\tprint(-1)\r\nelse:\r\n\tprint(len(res))\r\n\tfor i in res:\r\n\t\tprint(i, end=\" \")\r\n", "from collections import defaultdict\nfrom collections import deque\nfrom heapq import heappush, heappop, heapify\nimport sys, threading\nimport math\nMOD = 10**9+7\n\ndef solution():\n \"\"\"\n * for each cluster top sort until all courses on that cluster\n\n \"\"\"\n n, k = map(int, input().split())\n\n main_nodes = set(map(int, input().split()))\n\n in_degree = {i:0 for i in range(1, n+1)}\n graph = defaultdict(list)\n\n for node in range(1, n+1):\n dependency = list(map(int, input().split()))[1:]\n for nbr in dependency:\n graph[nbr].append(node)\n in_degree[node] += 1\n \n main_dec_count = {}\n visiited = set()\n def dfs(node):\n if node in main_dec_count:\n return main_dec_count[node]\n \n if node in visiited:\n return 0\n visiited.add(node)\n\n main_count = int(node in main_nodes)\n\n for nbr in graph[node]:\n main_count += dfs(nbr)\n \n main_dec_count[node] = main_count\n return main_count\n \n\n for node in range(1, n+1):\n dfs(node)\n \n que = deque([])\n for node in range(1, n+1):\n if in_degree[node] == 0 and main_dec_count[node] > 0:\n que.append(node)\n \n main_count = len(main_nodes)\n res = []\n while main_count and que:\n cur = que.popleft()\n res.append(cur)\n if cur in main_nodes:\n main_count -= 1\n for nbr in graph[cur]:\n in_degree[nbr] -= 1\n if in_degree[nbr] == 0 and main_dec_count[nbr] > 0:\n que.append(nbr)\n\n\n if main_count: \n return print(-1)\n\n print(len(res))\n print(*res)\n \n \n\ndef main(): \n t = 1\n #t = int(input())\n for _ in range(t):\n solution()\n\n\n#print=sys.stdout.write\n#------------------#\n# recursion Region #\n#------------------#\n \nsys.setrecursionlimit(10**6)\nthreading.stack_size(1 << 27)\nthread = threading.Thread(target=main)\nthread.start(); thread.join()\n#main()\n", "n,k=list(map(lambda x: int(x), input().split()))\r\nm=list(map(lambda x: int(x), input().split()))\r\nfrom types import GeneratorType\r\ndef bootstrap(f, stack=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n if stack:\r\n return f(*args, **kwargs)\r\n else:\r\n to = f(*args, **kwargs)\r\n while True:\r\n if type(to) is GeneratorType:\r\n stack.append(to)\r\n to = next(to)\r\n else:\r\n stack.pop()\r\n if not stack:\r\n break\r\n to = stack[-1].send(to)\r\n return to\r\n\r\n return wrappedfunc\r\nclass Graph:\r\n\r\n def __init__(self, V):\r\n self.V = V\r\n self.adj = [[] for i in range(V)]\r\n @bootstrap\r\n def DFSUtil(self, temp, v, visited):\r\n\r\n visited[v] = True\r\n\r\n\r\n\r\n for i in self.adj[v]:\r\n if visited[i] == False:\r\n yield self.DFSUtil(temp, i, visited)\r\n\r\n temp.append(v)\r\n yield temp\r\n\r\n def addEdge(self, v, w):\r\n self.adj[v].append(w)\r\n # self.adj[w].append(v)\r\n @bootstrap\r\n def isCyclicUtil(self, v, visited, recStack):\r\n\r\n # Mark current node as visited and\r\n # adds to recursion stack\r\n visited[v] = True\r\n recStack[v] = True\r\n\r\n # Recur for all neighbours\r\n # if any neighbour is visited and in\r\n # recStack then graph is cyclic\r\n for neighbour in self.adj[v]:\r\n if visited[neighbour] == False:\r\n ans =yield self.isCyclicUtil(neighbour, visited, recStack)\r\n if ans == True:\r\n yield True\r\n elif recStack[neighbour] == True:\r\n yield True\r\n\r\n # The node needs to be poped from\r\n # recursion stack before function ends\r\n recStack[v] = False\r\n yield False\r\n\r\n # Returns true if graph is cyclic else false\r\n def isCyclic(self,nodes):\r\n visited = [False] * self.V\r\n recStack = [False] * self.V\r\n for node in nodes:\r\n if visited[node] == False:\r\n if self.isCyclicUtil(node, visited, recStack) == True:\r\n return True\r\n return False\r\n\r\n\r\nG=Graph(n)\r\n\r\nfor i in range(0,n):\r\n\r\n x=list(map(lambda x: int(x), input().split()))\r\n if x[0]==0:\r\n continue\r\n else:\r\n for k in range(1,x[0]+1):\r\n G.addEdge(i,x[k]-1)\r\nvisited=[False for _ in range(n)]\r\n\r\npath=[]\r\n# print(G.adj)\r\nfor subj in m:\r\n temp = []\r\n if visited[subj-1]==False:\r\n\r\n G.DFSUtil(temp,subj-1,visited)\r\n\r\n path.extend(temp)\r\nif G.isCyclic([x-1 for x in m]):\r\n print(-1)\r\nelse:\r\n print(len(path))\r\n for p in path:\r\n print(p+1,end=\" \")\r\n print()", "import sys\r\n\r\nn, k = map(int, sys.stdin.readline().split())\r\ncourses = list(map(int, sys.stdin.readline().split()))\r\ncourses = [x - 1 for x in courses]\r\n\r\nvisited = [False] * n\r\nused = [False] * n\r\n\r\nans = []\r\nt = []\r\n\r\nfor i in range(n):\r\n temp = list(map(int, sys.stdin.readline().split()))\r\n temp = [x - 1 for x in temp]\r\n t.append(temp[1:])\r\n\r\nfor i in range(k):\r\n c = courses[i]\r\n if used[c]:\r\n continue\r\n\r\n q = [c]\r\n visited[c] = True\r\n while q:\r\n cur = q[-1]\r\n if len(t[cur])!=0:\r\n s = t[cur].pop()\r\n if visited[s] and not used[s]:\r\n print(-1)\r\n exit()\r\n if used[s]:\r\n continue\r\n q.append(s)\r\n visited[s] = True\r\n else:\r\n ans.append(cur)\r\n q.pop()\r\n used[cur] = True\r\n\r\nans = [str(x + 1) for x in ans]\r\nprint(len(ans))\r\nprint(\" \".join(ans))\r\n\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\nw = sorted(map(lambda x:int(x) - 1, input().split()))\r\ng = [list(map(lambda x:int(x) - 1, input().split())) for _ in range(n)]\r\ns = set()\r\nd = []\r\nx = [-1]*(n+1)\r\nfor i in range(k):\r\n q = [(w[i], -1)]\r\n while q:\r\n a, b = q.pop()\r\n if x[a] == -1:\r\n x[a] = g[a][0] + 1\r\n elif x[a] > 0:\r\n print(-1)\r\n exit()\r\n\r\n if x[a] == 0:\r\n if a+1 not in s:\r\n s.add(a+1)\r\n d.append(a+1)\r\n\r\n if b == -1:\r\n break\r\n else:\r\n x[b] -= 1\r\n else:\r\n q.append((a, b))\r\n for j in g[a][1:]:\r\n q.append((j, a))\r\n\r\nprint(len(d))\r\nprint(*d)\r\n", "from sys import *\r\nf = lambda: list(map(int, stdin.readline().split()))\r\n\r\nclass T:\r\n def __init__(self, i):\r\n self.i, self.t = i, f()[1:]\r\n self.a = self.q = 0\r\n\r\nn, k = f()\r\nd = f()\r\np = [None] + [T(i + 1) for i in range(n)]\r\n\r\ns = []\r\nwhile d:\r\n x = p[d.pop()]\r\n if x.a: continue\r\n d.append(x.i)\r\n q = 1\r\n for i in x.t:\r\n y = p[i]\r\n if y.a: continue\r\n d.append(y.i)\r\n q = 0\r\n if q:\r\n s.append(x.i)\r\n x.a = 1\r\n elif x.q:\r\n print(-1)\r\n exit()\r\n else: x.q = 1\r\n\r\nprint(len(s), *s)" ]

[ "n,m = map(int,input().split())\r\narr = []\r\nki = False\r\nfor i in range(n):\r\n\ta = list(map(int,input().split()))\r\n\tset_a = set(());\r\n\tfor j in range (a[0]):\r\n\t\tki=True\r\n\t\tset_a.add(a[j+1])\r\n\tarr.append(set_a)\r\nchange = 0\r\nif ki:\r\n\twhile(change!=-1):\r\n\t\tchanged = -1\r\n\t\tchange = -1\r\n\t\tfor i in range(len(arr)):\r\n\t\t\tfor j in range(i+1,len(arr)):\r\n\t\t\t\tfor x in arr[i]:\r\n\t\t\t\t\tif x in arr[j]:\r\n\t\t\t\t\t\tarr[i] = arr[i].union(arr[j])\r\n\t\t\t\t\t\tchanged =j\r\n\t\t\t\t\t\tchange = 1\r\n\t\t\t\t\t\tbreak;\r\n\t\t\t\tif (change==1):\r\n\t\t\t\t\tbreak;\r\n\t\t\tif (change==1):\r\n\t\t\t\tbreak;\r\n\t\tif (change==1):\r\n\t\t\tarr.pop(changed)\r\n\tprint(len(arr)-1)\r\nelse:\r\n\tprint(n)\r\n\r\n\r\n", "n,m = list(map(int,input().split()))\r\narr = []\r\nfor _ in range(n):\r\n lang = list(map(int,input().split()))\r\n lang = lang[1::]\r\n lang = set(lang)\r\n f = 0\r\n for i in range(len(arr)):\r\n x = arr[i].intersection(lang)\r\n if x!=set():\r\n arr[i].update(lang)\r\n f = 1\r\n break\r\n if f==0:\r\n arr.append(lang)\r\nans = []\r\nvisited = [False for i in range(len(arr))]\r\nfor i in range(len(visited)):\r\n if visited[i]==False:\r\n visited[i] = True\r\n y = arr[i]\r\n for j in range(len(visited)):\r\n if visited[j]==False:\r\n x = y.intersection(arr[j])\r\n if x!=set():\r\n visited[j] = True\r\n y.update(arr[j])\r\n ans.append(y)\r\n# print(ans)\r\ncnt = 0\r\nm = 0\r\nfor i in ans:\r\n if i==set():\r\n cnt+=1\r\n else:\r\n m+=1\r\nif m==0:\r\n print(cnt)\r\nelse:\r\n print(m-1+cnt)", "n,m=map(int,input().split())\r\n\r\n\r\n\r\ndef dfs(curr):\r\n vis[curr]=1\r\n\r\n for i in range(0,len(graph[curr])):\r\n if(vis[graph[curr][i]]==0):\r\n dfs(graph[curr][i])\r\n \r\n\r\ngraph=[[] for _ in range(205)]\r\nvis=[0 for _ in range(205)]\r\nx=0\r\n\r\n\r\nfor i in range(n):\r\n\r\n xx,*yy=map(int,input().split())\r\n x+=xx\r\n\r\n for y in yy:\r\n graph[i+1].append(y+n)\r\n graph[y+n].append(i+1)\r\n\r\n \r\nif(x==0):\r\n print(n)\r\n\r\nelse:\r\n\r\n c=0\r\n\r\n for i in range(1,n+m+1):\r\n\r\n if(vis[i]==0 and i<=n):\r\n c+=1\r\n dfs(i)\r\n\r\n print(c-1)\r\n\r\n\r\n \r\n\r\n \r\n", "n, m=map(int,input().split())\r\ndef root(arr,x):\r\n\twhile arr[x]!=x:\r\n\t x=arr[arr[x]]\r\n\t\r\n\treturn x\r\n\r\ndef find(arr,a,b):\r\n\tr_a=root(arr,a)\r\n\tr_b=root(arr,b)\r\n\tif r_a==r_b:\r\n\t\treturn True\r\n\treturn False\r\n\r\ndef union(a,b,arr,sz):\r\n r_a=root(arr,a)\r\n r_b=root(arr,b)\r\n if sz[r_a]>sz[r_b]:\r\n arr[r_b]=r_a\r\n sz[r_a]+=sz[r_b]\r\n else:\r\n arr[r_a]=r_b\r\n sz[r_b]+=sz[r_a]\r\n \r\narr=[{} for i in range(n+1)]\r\ncs=0\r\nfor i in range(n):\r\n\tls=list(map(int,input().split()))\r\n\ts=set(ls[1:])\r\n\tif len(s)==0:\r\n\t\tcs+=1\r\n\tarr[i+1]=s\r\n\r\n\r\nls=[i for i in range(n+1)]\r\nsz=[1 for i in range(n+1)]\r\nfor i in range(1,n+1):\r\n\tfor j in range(i+1,n+1):\r\n\t\tif not find(ls,i,j):\r\n\t\t\txs=arr[i]&arr[j]\r\n\t\t\tif len(xs)!=0:\r\n\t\t\t\tunion(i,j,ls,sz)\r\n\t\t\t\tarr[i]=arr[i]|arr[j]\r\n\t\t\t\tarr[j]=arr[i]|arr[j]\r\n\r\nss=set()\r\ntemp=[0]\r\nd=dict()\r\nfor i in range(1,len(ls)):\r\n\txs=root(ls,i)\r\n\tif xs not in d:\r\n\t\td[xs]=0\r\n\td[xs]+=1\r\n\r\ncc=co=0\r\nfor i in d.keys():\r\n\tif d[i]>1:\r\n\t\tcc+=1\r\n\telse:\r\n\t\tco+=1 \t\t\r\n\r\nif cs==n:\r\n\tprint(n)\r\nelse:\r\n\tprint(co+cc-1)\r\n", "n, m = map(int, input().split())\r\nlangs = []\r\nfor i in range(n):\r\n l, *lang = list(map(int, input().split()))\r\n langs.append(set(lang))\r\n\r\nnot_visited = set(range(n))\r\n\r\nc = 0\r\nz = 0\r\nwhile not_visited:\r\n stack = [not_visited.pop()]\r\n x = langs[stack[0]]\r\n if x:\r\n c += 1\r\n while stack:\r\n # print(stack)\r\n # print(x)\r\n p = stack.pop()\r\n for i in range(n):\r\n if i != p and i in not_visited:\r\n if langs[i].intersection(x):\r\n # print(i)\r\n x = x.union(langs[i])\r\n not_visited.remove(i)\r\n stack.append(i)\r\n else:\r\n z += 1\r\n\r\nprint(z+max(0, c-1))\r\n", "import sys\n\n# initialize\nn, m = [int(x) for x in sys.stdin.readline().strip().split()]\n# parent = [-1] * (m + 1)\nparent = []\nfor i in range(m + 1):\n parent.append(i)\nsz = [1] * (m + 1)\nspeakers = [0] * (m + 1)\n\ndef find_parent(c):\n if parent[c] == c:\n # reached root\n return c\n # query parent and flatten\n p = find_parent(parent[c])\n parent[c] = p\n return p\n\ndef join(a, b):\n pa = find_parent(a)\n pb = find_parent(b)\n\n if pa == pb:\n # already in same component\n return\n # merge smaller into larger to maintain balance property\n if sz[pa] > sz[pb]:\n parent[pb] = pa\n sz[pa] += sz[pb]\n else:\n parent[pa] = pb\n sz[pb] += sz[pa]\n\ndef connected(a, b):\n # connected if they have the same ID\n return find_parent(a) == find_parent(b)\n\nno_lang = 0\nfor i in range(n):\n langs = [int(l) for l in sys.stdin.readline().strip().split()]\n num_langs = langs[0]\n if num_langs == 0:\n no_lang += 1\n continue\n langs = langs[1:]\n l = langs[0]\n speakers[l] += 1\n for j in range(1, len(langs)):\n lang = langs[j]\n speakers[lang] += 1\n join(l, lang)\n\n# no one can speak any language --> all employees need to learn a language\nif sum(speakers) == 0:\n print(n)\nelse:\n ans = 0\n for i in range(1, m + 1):\n if parent[i] == i and speakers[i] != 0:\n ans += 1\n ans += no_lang\n ans -= 1\n print(ans)", "def unite(setlist, uns):\r\n res = set()\r\n indicesToDel = list()\r\n \r\n for un in uns:\r\n for i in range(len(setlist)):\r\n if un in setlist[i]:\r\n if not i in indicesToDel:\r\n indicesToDel.append(i)\r\n res = res | setlist[i]\r\n #print(\"Inter:\", res, indicesToDel)\r\n\r\n indicesToDel.sort(key=(lambda x:-x))\r\n \r\n for i in indicesToDel:\r\n del setlist[i]\r\n\r\n if len(res) > 0:\r\n setlist.append(res | set(uns))\r\n else:\r\n setlist.append(set(uns))\r\n\r\nn, m = map(int, input().split())\r\nnoLangs = 0\r\nsets = []\r\n\r\nfor i in range(n):\r\n #print(*sets)\r\n l = list(map(int, input().split()))\r\n if l[0] == 0:\r\n noLangs += 1\r\n continue\r\n del l[0]\r\n #print(l)\r\n unite(sets, l)\r\n\r\n#print(*sets)\r\n\r\nif noLangs == n:\r\n print(n)\r\nelse:\r\n print(len(sets) - 1 + noLangs)\r\n", "def DFS(x, mark, a, v):\r\n mark[x] = True\r\n for i in a[x]:\r\n for j in v[i]:\r\n if mark[j]:\r\n continue\r\n DFS(j, mark, a, v)\r\ns = input()\r\ncheck = True\r\ns = s.split()\r\nn = int(s[0])\r\nm = int(s[1])\r\nv = []\r\na = []\r\nfor i in range(m+1):\r\n v.append(list([]))\r\nfor i in range(n):\r\n a.append(list([]))\r\nfor i in range(n):\r\n s = input()\r\n s = s.split()\r\n if int(s[0])>0:\r\n check = False\r\n for j in range(int(s[0])):\r\n v[int(s[j+1])].append(i)\r\n a[i].append(int(s[j+1]))\r\nmark = [False]*n\r\nans = 0\r\nfor i in range(n):\r\n if mark[i]:\r\n continue\r\n DFS(i, mark, a, v)\r\n ans += 1\r\nprint(ans-1+check)", "def dfs(i,v,vi,lan,emp,bn):\r\n\tif bn:\r\n\t\tvi[i]=1\r\n\t\tfor j in lan[i]:\r\n\t\t\tif not v[j]: dfs(j,v,vi,lan,emp,(bn+1)%2)\r\n\telse:\r\n\t\tv[i]=1\r\n\t\tfor j in emp[i]:\r\n\t\t\tif not vi[j]: dfs(j,v,vi,lan,emp,(bn+1)%2)\r\n\r\ndef main():\r\n\temp={}\r\n\tlan={}\r\n\tnum0=ans=0\r\n\tn,m=list(map(int,input().split()))\r\n\tfor i in range(m): lan[i]=set()\r\n\tfor i in range(n):\r\n\t\temp[i]=set()\r\n\t\tk=list(map(int,input().split()))\r\n\t\tfor j in range(1,k[0]+1): \r\n\t\t\temp[i].add(k[j]-1)\r\n\t\t\tlan[k[j]-1].add(i)\r\n\t\tif not k[0]: num0+=1\r\n\r\n\tv=[0]*n\r\n\tvi=[0]*m\r\n\tfor i in range(n):\r\n\t\tif not v[i]:\r\n\t\t\tv[i]=1\r\n\t\t\tfor j in emp[i]:\r\n\t\t\t\tif not vi[j]: dfs(j,v,vi,lan,emp,1)\r\n\t\t\tans+=1\r\n\r\n\tif num0==n: print(n)\r\n\telse: print(ans-1)\r\n\r\n\r\nif __name__=='__main__': main()", "def get_list_of_ints():\r\n return list(map(lambda x: int(x), input().split()))\r\n\r\n\r\ndef learning_languages(n, m, employee_languages):\r\n language_ids = list(range(0, m + 1))\r\n for i in range(0, n):\r\n langs = employee_languages[i]\r\n for j in range(2, len(langs)):\r\n first_lang = language_ids[langs[j - 1]]\r\n second_lang = language_ids[langs[j]]\r\n if first_lang != second_lang:\r\n for k in range(1, m + 1):\r\n if language_ids[k] == second_lang:\r\n language_ids[k] = first_lang\r\n employees = set()\r\n total = 0\r\n for i in range(0, n):\r\n if employee_languages[i][0] > 0:\r\n employees.add(language_ids[employee_languages[i][1]])\r\n else:\r\n total += 1\r\n return total + max(0, len(employees) - 1)\r\n\r\n\r\nif __name__ == '__main__':\r\n n, m = get_list_of_ints()\r\n employee_languages = []\r\n for i in range(0, n):\r\n employee_languages.append(get_list_of_ints())\r\n print(learning_languages(n, m, employee_languages))\r\n", "import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools\n\nsys.setrecursionlimit(10**7)\ninf = 10**20\neps = 1.0 / 10**10\nmod = 10**9+7\ndd = [(-1,0),(0,1),(1,0),(0,-1)]\nddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]\n\ndef LI(): return list(map(int, sys.stdin.readline().split()))\ndef LLI(): return [tuple(map(int, l.split())) for l in sys.stdin]\ndef LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]\ndef LF(): return [float(x) for x in sys.stdin.readline().split()]\ndef LS(): return sys.stdin.readline().split()\ndef I(): return int(sys.stdin.readline())\ndef F(): return float(sys.stdin.readline())\ndef S(): return input()\ndef pf(s): return print(s, flush=True)\n\nclass UnionFind:\n def __init__(self, size):\n self.table = [-1 for _ in range(size)]\n\n def find(self, x):\n if self.table[x] < 0:\n return x\n else:\n self.table[x] = self.find(self.table[x])\n return self.table[x]\n\n def union(self, x, y):\n s1 = self.find(x)\n s2 = self.find(y)\n if s1 != s2:\n if self.table[s1] <= self.table[s2]:\n self.table[s1] += self.table[s2]\n self.table[s2] = s1\n else:\n self.table[s2] += self.table[s1]\n self.table[s1] = s2\n return True\n return False\n\n def subsetall(self):\n a = []\n for i in range(len(self.table)):\n if self.table[i] < 0:\n a.append((i, -self.table[i]))\n return a\n\ndef main():\n n,m = LI()\n uf = UnionFind(m+1)\n r = 0\n t = []\n for _ in range(n):\n a = LI()\n if a[0] == 0:\n r += 1\n continue\n t.append(a[1])\n for i in range(2,len(a)):\n uf.union(a[1], a[i])\n\n if len(t) == 0:\n return r\n\n s = set()\n for c in t:\n s.add(uf.find(c))\n\n return r + len(s) - 1\n\nprint(main())\n\n\n", "n,m = map(int,input().split(' '))\r\n \r\nb = [-1 for i in range(m + 1)]\r\nans = 0\r\nfor i in range(n):\r\n a = list(map(int,input().split(' '))) \r\n a = a[1:]\r\n \r\n if len(a) == 0:\r\n ans += 1\r\n \r\n before = []\r\n for x in a:\r\n if b[x] != -1:\r\n before.append(b[x])\r\n else:\r\n b[x] = i\r\n \r\n for x in before:\r\n for j in range(1, m+1):\r\n if b[j] == x:\r\n b[j] = i\r\n \r\nif len(set(b)) >= 2:\r\n ans += len(set(b)) - 2\r\nprint(ans)", "n, m = map(int, input().split())\r\ngroups = list({i} for i in range(1, m + 1))\r\nalive = set()\r\n\r\ndebug = False\r\n\r\ndef dbg(var):\r\n if debug:\r\n print(\"[dbg] {} = {}\".format(var, eval(var)))\r\n\r\ncnt = 0\r\n\r\nfor i in range(n):\r\n langs = set(map(int, input().split()[1:]))\r\n if len(langs) < 1:\r\n cnt += 1\r\n continue\r\n dbg(\"langs\")\r\n alive.update(langs)\r\n joined = []\r\n for g in groups:\r\n if langs.intersection(g):\r\n joined.append(g)\r\n dbg(\"joined\")\r\n new_set = set()\r\n for j in joined:\r\n new_set.update(j)\r\n groups.remove(j)\r\n dbg(\"new_set\")\r\n groups.append(new_set)\r\n dbg(\"groups\")\r\n dbg(\"0\")\r\n\r\nfor i in range(1, m+1):\r\n if i not in alive:\r\n dbg(\"{i}\")\r\n groups.remove({i})\r\n\r\nif not alive:\r\n ans = n\r\nelse:\r\n ans = len(groups) - 1 + cnt\r\n\r\nprint(ans)\r\n", "import sys\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\n\ndef find(x):\n if x == ufset[x]:\n return x\n else:\n ufset[x] = find(ufset[x])\n return ufset[x]\n\ndef union(x, y):\n ufset[find(x)] = find(y)\n\nn, m = get_ints()\nufset = [i for i in range(n+m+10)]\n\nflag = False\n\nfor i in range(1,n+1):\n input = list(get_ints())\n if input[0] == 0:\n continue\n else:\n flag = True\n for x in input[1:]:\n union(i, n+x)\n\n\nif not flag:\n print(n)\nelse:\n for i in range(1,n+1):\n find(i)\n print(len(set(ufset[1:n+1]))-1)\n\t \t \t\t\t \t \t \t \t\t \t \t\t\t\t\t\t", "'''\nhttp://codeforces.com/problemset/problem/277/A\n'''\nfrom collections import defaultdict\n\ndef findSet(u):\n if parents[u] !=u:\n parents[u] = findSet(parents[u])\n return parents[u]\n\ndef unionSet(u,v):\n up, vp = findSet(u), findSet(v)\n if up == vp: return\n if ranks[up] > ranks[vp]:\n parents[vp] = up\n size[up] += size[vp]\n elif ranks[up] < ranks[vp]:\n parents[up] = vp\n size[vp] += size[up]\n else:\n parents[up] = vp\n ranks[vp] += 1\n size[vp] += size[up]\n\nlanguage_of_each_person = defaultdict(set)\nnumber_of_employees, number_of_languages = map(int, input().strip().split(\" \"))\nzero_language = True\nfor i in range(number_of_employees):\n list_of_language = list(map(int, input().strip().split(' ')))\n for language in list_of_language[1:]:\n language_of_each_person[i].add(language)\n if len(language_of_each_person[i]) > 0: zero_language = False\n\nif zero_language: print(number_of_employees)\nelse:\n parents = [i for i in range(number_of_employees)]\n ranks = [0] * (number_of_employees)\n size = [1] * (number_of_employees)\n\n for i in range(number_of_employees):\n for j in range(i+1, number_of_employees):\n if i != j:\n language_1, language_2 = language_of_each_person[i], language_of_each_person[j]\n if language_1.intersection(language_2):\n unionSet(i, j)\n\n answer = 0\n for index, value in enumerate(parents):\n if index == value: answer += 1\n print(answer-1)", "arr=list(map(int,input().split()))\r\nn=arr[0]\r\nm=arr[1]\r\nimport collections\r\nimport collections\r\nimport heapq\r\nans=0\r\ngraph=[[] for i in range(m+1)]\r\nsets=set()\r\nfor i in range(n):\r\n\tlis=list(map(int,input().split()))\r\n\r\n\t\r\n\tif len(lis)==1:\r\n\t\tans+=1\r\n\telse:\r\n\t\tsets.add(lis[1])\r\n\t\tfor j in range(1,len(lis)-1):\r\n\t\t\tif j+1<len(lis):\r\n\t\t\t\tgraph[lis[j]].append(lis[j+1])\r\n\t\t\t\tgraph[lis[j+1]].append(lis[j])\r\n\t\t\t\tsets.add(lis[j])\r\n\t\t\t\tsets.add(lis[j+1])\r\n\r\nvis=[False for i in range(m)]\r\n\r\ndef dfs(i):\r\n\t\r\n\tif not vis[i-1]:\r\n\t\tvis[i-1]=True\r\n\r\n\t\tfor k in graph[i]:\r\n\t\t\tdfs(k)\r\nsets=list(sets)\r\nm=0\r\nfor i in sets:\r\n\r\n\tif m==0:\r\n\t\tdfs(i)\r\n\telse:\r\n\t\tif vis[i-1]==False:\r\n\t\t\tans+=1\r\n\t\t\tdfs(i)\r\n\tm+=1\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n\r\n\t\r\n\r\n\r\n\r\n", "import sys\r\nsys.setrecursionlimit(100000000)\r\n\r\ndef findSet(u):\r\n root = u\r\n while root != parent[root]:\r\n root = parent[root]\r\n while u != root:\r\n temp = parent[u]\r\n parent[u] = root\r\n u = temp\r\n return root\r\n\r\ndef unionSet(u, v):\r\n u = findSet(u)\r\n v = findSet(v)\r\n if u != v:\r\n if u < v:\r\n parent[v] = u\r\n else:\r\n parent[u] = v\r\n\r\nif __name__ == '__main__':\r\n cnt = 0\r\n n, m = map(int, input().split())\r\n parent = [0]\r\n for i in range(1, 205):\r\n parent.append(i)\r\n for u in range(1, n + 1):\r\n line = list(map(int, input().split()))\r\n k = line[0]\r\n if k == 0:\r\n cnt += 1\r\n else:\r\n for i in range(1, len(line)):\r\n v = line[i]\r\n unionSet(u, v + n)\r\n res = 0\r\n if cnt == n:\r\n res = n\r\n else:\r\n for i in range(1, n + 1):\r\n if parent[i] == i:\r\n res += 1\r\n res -= 1\r\n print(res)", "n, m = list(map(int, input().split()))\r\nL = []\r\ncount = 0\r\nv = [-1]*n\r\nfor i in range(n):\r\n\tk, *l = list(map(int, input().split()))\r\n\tL.append(l)\r\n\r\ndef dfs(i):\r\n\tstack = []\r\n\tstack.append(i)\r\n\r\n\twhile not stack == []:\r\n\t\tif v[stack[-1]] == 0:\r\n\t\t\tstack.pop()\r\n\t\telse:\r\n\t\t\tv[stack[-1]] = 0\r\n\t\t\tnow = stack.pop()\r\n\t\t\tfor j in range(n):\r\n\t\t\t\tif any(k in L[j] for k in L[now]):\r\n\t\t\t\t\tstack.append(j)\r\nflag = 0\r\nfor i in range(n):\r\n\tif L[i] == []:\r\n\t\tcount += 1\r\n\telse:\r\n\t\tflag = 1\r\n\t\tif not v[i] == 0:\r\n\t\t\tcount += 1\r\n\t\t\tdfs(i)\r\nif flag:\r\n\tprint(count - 1)\r\nelse:\r\n\tprint(count)\t\t\t\r\n", "def get_neighbours(node):\r\n listneighbors=[]\r\n for j in range (emp):\r\n if any(r in g[j] for r in g[node]):\r\n if listneighbors.count(j)==0:\r\n listneighbors.append(j)\r\n return listneighbors\r\ndef DFS(i):\r\n seen[i]=True\r\n for j in get_neighbours(i):\r\n if not seen[j]:\r\n DFS(j) \r\n\r\nemp,lang=map(int,input().split())\r\ng=[]\r\nfor i in range(emp):\r\n l=list(map(int,input().split()))\r\n g.append(l[1:])\r\nans=0\r\nb=False\r\nseen=[False]*emp \r\nfor j in range(emp):\r\n if g[j]==[]:\r\n ans+=1\r\n else:\r\n if not seen[j]:\r\n b=True\r\n DFS(j)\r\n ans+=1\r\nif (b==False):\r\n print(ans)\r\nelse:\r\n print(ans-1)\r\n\r\n", "import sys\r\n\r\ninput = lambda: sys.stdin.readline().strip(\"\\r\\n\")\r\n\r\nn, m = map(int, input().split())\r\npeople = {}\r\ngraph = {i: [] for i in range(1, n + 1)}\r\nfor i in range(1, n + 1):\r\n a = list(map(int, input().split()))\r\n people[i] = a[1:]\r\n\r\nfor person in people:\r\n for lang in people[person]:\r\n for other_person in people:\r\n if lang in people[other_person] and other_person != person:\r\n graph[person].append(other_person)\r\n\r\nif all(len(people[i]) == 0 for i in people):\r\n print(n)\r\n quit()\r\n\r\ndef dfs(node):\r\n if vis[node]:\r\n return\r\n vis[node] = True\r\n for child in graph[node]:\r\n if not vis[child]:\r\n dfs(child)\r\n\r\n\r\nvis = [False] * (n+1)\r\nconnected = 0\r\nfor i in range(1, n+1):\r\n if not vis[i]:\r\n connected += 1\r\n dfs(i)\r\n\r\nprint(connected - 1)\r\n", "def DFS(start, V, G, n, m):\n V[start] = True\n for i in range(n):\n if not V[i]:\n for j in range(m):\n if G[i][j] and G[start][j]:\n DFS(i, V, G, n, m)\n\n\nn, m = map(int, input().split())\nans = 0\nallZero = True\nV = [False] * n\nG = [[False] * m for _ in range(n)]\n\nfor i in range(n):\n k, *langs = map(int, input().split())\n for j in langs:\n G[i][j-1] = True\n allZero = False\n\nfor i in range(n):\n if not V[i]:\n DFS(i, V, G, n, m)\n ans += 1\n\nif allZero:\n print(ans)\nelse:\n print(ans - 1)\n\n \t\t \t \t \t\t \t \t\t\t\t \t \t\t \t", "def union(x,y,par):\r\n x1=x \r\n while(par[x1]>=0):\r\n x1=par[x1]\r\n y1=y\r\n while(par[y1]>=0):\r\n y1=par[y1]\r\n if(x1==y1):\r\n\r\n return\r\n if(par[x1]<par[y1]):\r\n setpar=x1\r\n par[y1]=x1\r\n else:\r\n setpar=y1\r\n par[x1]=y1\r\n while(par[x]!=x1 and x!=x1):\r\n temp=par[x]\r\n par[x]=setpar\r\n x=temp\r\n while(par[y]!=y1 and y!=y1):\r\n temp=par[y]\r\n par[y]=setpar\r\n y=temp\r\n\r\n \r\n\r\n\r\nn,m=map(int,input().split())\r\n\r\npar=[-1 for i in range(m)]\r\n\r\nval=[False for i in range(m)]\r\ncnt1=0\r\n\r\nfor i in range(n):\r\n \r\n a=list(map(int,input().split()))\r\n if(a[0]==0):\r\n cnt1+=1\r\n continue\r\n #print(i)\r\n for j in range(len(a)):\r\n a[j]-=1\r\n for j in range(1,len(a)):\r\n val[a[j]]=True\r\n for j in range(2,len(a)):\r\n union(a[1],a[j],par)\r\ncnt2=0\r\nfor i in range(m):\r\n if(par[i]==-1 and val[i]):\r\n cnt2+=1\r\nprint(max(cnt2-1,0)+cnt1)\r\n \r\n", "class DSU:\r\n def __init__(self, n):\r\n self.sz = [1 for _ in range(n)]\r\n self.id = [i for i in range(n)]\r\n\r\n def findRoot(self, x):\r\n root = x\r\n while (root != self.id[root]):\r\n root = self.id[root]\r\n while x !=root:\r\n idx = self.id[x]\r\n self.id[x] = root\r\n x = idx\r\n return root\r\n\r\n def connected(self, x, y):\r\n return self.findRoot(x) == self.findRoot(y)\r\n\r\n def group(self, x, y):\r\n rootX = self.findRoot(x)\r\n rootY = self.findRoot(y)\r\n if (rootX == rootY):\r\n return\r\n if self.sz[rootX] == self.sz[rootY]:\r\n self.id[rootX] = rootY\r\n self.sz[rootY] += self.sz[rootX]\r\n else:\r\n self.id[rootY] = rootX\r\n self.sz[rootX] += self.sz[rootY]\r\n def largestGroup(self):\r\n return max(self.sz)\r\n def countGroup(self):\r\n cnt = 0\r\n for i in range(len(self.id)):\r\n if (self.id[i] == i):\r\n cnt+=1\r\n return cnt\r\n\r\nn, m = map(int, input().split())\r\nzero = True\r\na = [[False for _ in range(m)] for _ in range(n)]\r\nfor i in range(n):\r\n l = list(map(int, input().split()))\r\n if l[0] != 0:\r\n zero = False\r\n for j in range(l[0]):\r\n a[i][l[j+1]-1] = True\r\nif zero:\r\n print(n)\r\nelse:\r\n dsu = DSU(n)\r\n for i in range(n):\r\n for j in range(i+1, n):\r\n f = False\r\n for k in range(m):\r\n if (a[i][k] and a[j][k]):\r\n f = True\r\n break\r\n if f: dsu.group(i, j)\r\n print(dsu.countGroup() -1)\r\n\r\n\r\n\r\n", "#DSU\r\nimport bisect,sys\r\nfrom collections import deque, namedtuple\r\nN = 300\r\npar = [i for i in range(N)]\r\n\r\ndef find(i):\r\n root = i\r\n while root != par[root]: root = par[root]\r\n while i != par[i]:\r\n newp = par[i]\r\n par[i] = root\r\n i = newp\r\n return root\r\n\r\ndef merge(a,b):\r\n a = find(a)\r\n b = find(b)\r\n par[b] = a\r\n\r\ndef main():\r\n n,m = map(int,input().split())\r\n check,ans = 0,-1\r\n for _ in range(n):\r\n l = [int(i) for i in input().split()][1:]\r\n check = max(check,len(l))\r\n for i in l:\r\n merge(_,n+i)\r\n if not check:\r\n print(n)\r\n exit(0)\r\n for i in range(n):\r\n if i == par[i]:\r\n ans += 1\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "from collections import defaultdict\n\n\ndef main():\n n, m = input().split()\n can_speak = {}\n for i in range(int(n)):\n langs = input().split()\n can_speak[i] = set(langs[1:])\n\n print(solve(int(n), int(m), can_speak))\n\n\ndef solve(n, m, can_speak):\n parent = [i for i in range(n)]\n rank = [1 for _ in range(n)]\n\n def find(k):\n if k == parent[k]:\n return parent[k]\n parent[k] = find(parent[k])\n return parent[k]\n\n def unite(a, b):\n pa = find(a)\n pb = find(b)\n\n if pa != pb:\n if rank[pa] >= rank[pb]:\n parent[pb] = pa\n rank[pa] += rank[pb]\n rank[pb] = 0\n else:\n parent[pa] = pb\n rank[pb] += rank[pa]\n rank[pa] = 0\n\n flag = False\n for a in range(n):\n for b in range(a + 1, n):\n flag = flag or len(can_speak[a]) != 0\n if can_speak[a].intersection(can_speak[b]):\n unite(a, b)\n\n for a in range(n):\n find(a)\n\n money = len(set(parent))\n return money - 1 if flag else money\n\n\nmain()\n", "n, k = list(map(int, input().split()))\r\nans = 0\r\nt = []\r\nfor _ in range(n):\r\n l = list(map(int, input().split()))\r\n if l[0] == 0:\r\n ans += 1\r\n else:\r\n t += [set(l[1:])]\r\ni = 0\r\nwhile i < len(t):\r\n for j in t[i + 1:]:\r\n if t[i] & j:\r\n t[i] |= j\r\n t.remove(j)\r\n break\r\n else:\r\n i += 1\r\nprint(max(0, len(t) - 1) + ans)\r\n", "n, m = map(int, input().split())\r\ns = [0]*n\r\nadj = [ [] for i in range(n) ]\r\nfor i in range(n):\r\n l = list(map(int, input().split()))\r\n for k in l[1:]:\r\n s[i] |= 1<<k\r\nif sum(s)==0:\r\n print(n)\r\n exit(0)\r\n \r\nfor i in range(n):\r\n for j in range(n):\r\n if s[i]&s[j]!=0:\r\n adj[i].append(j)\r\n\r\nvisited = [0]*n\r\ndef dfs(v):\r\n if visited[v]:\r\n return\r\n visited[v] = 1\r\n for u in adj[v]:\r\n dfs(u)\r\n\r\ncount = 0 \r\n\r\nfor v in range(n):\r\n if not visited[v]:\r\n dfs(v)\r\n count += 1\r\n\r\nprint(count-1)", "def dfs_iterative(graph, start, seen):\r\n seen[start]= True\r\n to_visit= [start]\r\n while to_visit:\r\n node=to_visit.pop()\r\n for neighbor in graph[node]:\r\n if not seen[neighbor-1]:\r\n seen[neighbor-1] = True\r\n to_visit.append(neighbor-1)\r\n \r\nn, m = map(int,input().split())\r\nl = [[]] * n\r\nfor i in range(n):\r\n l[i] = list(int(x) for x in input().split()[1:])\r\n#print(l)\r\nlan=[[]for _ in range (m)]\r\ne0=0\r\nfor nb,i in enumerate(l):\r\n if i==[]: e0+=1\r\n else:\r\n for j in i: lan[j-1].append(nb+1)\r\n#print(lan)\r\nif e0==n : print (n)\r\nelse :\r\n g=[[]for _ in range (n)]\r\n for i in lan:\r\n if len(i)>1:\r\n for j in range(len(i)-1):\r\n g[i[j]-1].append(i[j+1])\r\n g[i[j+1]-1].append(i[j])\r\n #print(g)\r\n seen = [False]*n\r\n r=0\r\n for nb,i in enumerate(seen):\r\n if not i:\r\n r+=1\r\n dfs_iterative(g,nb,seen)\r\n print(r-1) \r\n \r\n\r\n\r\n\r\n \r\n \r\n", "def dfs(g, used, n):\r\n used[n] = True\r\n for to in g[n]:\r\n if not used[to]:\r\n dfs(g, used, to)\r\n\r\nx, y = map(int, input().split())\r\ng = [set() for _ in range(x)]\r\nv = [[] for _ in range(y)]\r\np2l = [0] * x\r\ncnt_0 = 0\r\nfor i in range(x):\r\n l = list(map(int, input().split()))[1:]\r\n for j in l:\r\n v[j - 1].append(i)\r\n p2l[i] = len(l)\r\n cnt_0 += int(p2l[i] == 0)\r\nfor k in range(y):\r\n for i in v[k]:\r\n for j in v[k]:\r\n g[i].add(j)\r\nused = [False] * x\r\ncnt_k = 0\r\nfor i in range(x):\r\n if not used[i] and p2l[i] > 0:\r\n cnt_k += 1\r\n dfs(g, used, i)\r\nprint(cnt_0 + cnt_k - (1 if cnt_k > 0 else 0))\r\n", "n, m = map(int, input().split())\r\nq = [[] for i in range(n + 1)]\r\nr, s = [0] * (m + 1), 0\r\nfor i in range(1, n + 1):\r\n t = list(map(int, input().split()))\r\n if t[0]:\r\n t = t[1: ]\r\n d = set([r[j] for j in t])\r\n if 0 in d: d.remove(0)\r\n if len(d):\r\n for j in d:\r\n for k in q[j]:\r\n r[k] = i\r\n q[i].extend(q[j])\r\n q[j] = []\r\n t = [j for j in t if r[j] == 0]\r\n for k in t:\r\n r[k] = i\r\n q[i].extend(t)\r\n else:\r\n for k in t:\r\n r[k] = i\r\n q[i] = t \r\n else: s += 1\r\nprint(s + max(sum(len(i) > 0 for i in q) - 1, 0))", "def dfs(i):\r\n global vis, g\r\n vis[i] = 1\r\n for u in g[i]:\r\n if not vis[u]:\r\n dfs(u)\r\n\r\n\r\nn, m = map(int, input().split())\r\ng = []\r\nvis = []\r\nfor i in range(n + m):\r\n g.append([])\r\n vis.append(0)\r\n\r\nflag = 0\r\nfor i in range(n):\r\n a = list(map(int, input().split()))\r\n if a[0] > 0:\r\n flag = 1\r\n for j in range(1, len(a)):\r\n g[a[j] + n - 1].append(i)\r\n g[i].append(a[j] + n - 1)\r\n \r\nans = 0\r\nfor i in range(n):\r\n if not vis[i]:\r\n ans += 1\r\n dfs(i) \r\nif flag == 0:\r\n print(ans)\r\nelse:\r\n print(max(0, ans -1)) \r\n", "n,m=[int(e) for e in input().split()]\r\ngraph=[]\r\nseen=[False]*n\r\npath=[]\r\ndef bfs(g,start):\r\n stack=[]\r\n stack.append(start)\r\n seen[start]=True\r\n while len(stack):\r\n node=stack.pop()\r\n path.append(node)\r\n for current in graph[node]:\r\n for i in range(len(graph)):\r\n if current in graph[i]:\r\n if not seen[i]:\r\n seen[i]=True\r\n stack.append(i)\r\n\r\nfor i in range(n):\r\n lang=[int(e) for e in input().split()]\r\n number=lang.pop(0)\r\n if number==0:\r\n graph.append([])\r\n else:graph.append(lang)\r\nres=0\r\ncount=0\r\nfor i in range(n): \r\n if seen[i]==False :\r\n if graph[i]==[]:\r\n res+=1\r\n count+=1\r\n else:\r\n bfs(graph,i)\r\n res+=1\r\nif count==n:\r\n print(res)\r\nelse:\r\n print(res-1)\r\n", "MOD = 1000000007\r\nMOD2 = 998244353\r\nii = lambda : int(input())\r\nsi = lambda : input()\r\ndgl = lambda : list(map(int, input()))\r\nf = lambda : map(int, input().split())\r\nil = lambda : list(map(int, input().split()))\r\nls = lambda : list(input())\r\n\r\nclass DSU:\r\n def __init__(self,n):\r\n self.parent=[i for i in range(n)]\r\n self.rank=[1 for i in range(n)]\r\n def find_set(self,a):\r\n if a==self.parent[a]:\r\n return a\r\n self.parent[a]=self.find_set(self.parent[a])\r\n return self.parent[a]\r\n def union_set(self,a,b):\r\n x=self.find_set(a)\r\n y=self.find_set(b)\r\n if x!=y:\r\n if self.rank[x]<self.rank[y]:\r\n x,y=y,x\r\n self.rank[x]+=self.rank[y]\r\n self.parent[y]=x\r\n\r\nn,m=f()\r\nl=[];c=0\r\nfor _ in range(n):\r\n a,*b=f();b=set(b)\r\n if len(b):l.append(b)\r\n else:c+=1\r\nnn=len(l)\r\ndsu=DSU(nn)\r\npar=-1\r\nfor i in range(1,m+1):\r\n for j in range(nn):\r\n if i in l[j]:\r\n if par==-1:par=j\r\n else:dsu.union_set(par,j)\r\n par=-1\r\nprint(max(len(set(dsu.find_set(i) for i in range(nn)))-1,0)+c)\r\n", "class UnionFind:\n def __init__(self, n):\n self.parent = [i for i in range(n)]\n self._size = [1] * n\n\n def root(self,a):\n if self.parent[a] == a: return a\n else:\n self.parent[a] = self.root(self.parent[a])\n return self.parent[a]\n\n def is_same(self, a, b):\n return self.root(a) == self.root(b)\n\n def unite(self, a, b):\n x, y = self.root(a), self.root(b)\n if x == y: return 0\n if self._size[x] < self._size[y]:\n x, y = y, x\n self._size[x] += self._size[y]\n self.parent[y] = x\n return 1\n\n def size(self,a):\n return self._size[self.root(a)]\n\nn, m = map(int, input().split())\nuf = UnionFind(n)\ng = []\nt = 0\nans = n-1\n\nfor i in range(n):\n g.append(set(map(int, input().split()[1:])))\n t += len(g[i])\n for j in range(i):\n if g[i] & g[j]:\n ans -= uf.unite(i, j)\nif t == 0: ans += 1\nprint(ans)", "I=lambda:list(map(int,input().split()))\r\nn,m=I()\r\nr=0\r\nt=[]\r\nfor _ in range(n):\r\n\tl=I();\r\n\tif l[0]==0:r+=1\r\n\telse:t+=[set(l[1:])]\r\ni=0\r\nwhile i<len(t):\r\n\tfor j in t[i+1:]:\r\n\t\tif t[i]&j:t[i]|=j;t.remove(j);break\r\n\telse:i+=1\r\nprint(max(0,len(t)-1)+r)\r\n", "n, m = list(map(int, input().split()))\r\nemployees = []\r\nz = 0\r\nfor i in range(n) : \r\n l = list(map(int, input().split()))\r\n if l[0] == 0 : z += 1\r\n employees.append(l[1:])\r\n\r\nseen = [False] * n \r\ndef dfs(empl, start) : \r\n to_visit = [start]\r\n seen[start] = True\r\n\r\n while to_visit : \r\n node = to_visit.pop()\r\n for lang in empl[node] :\r\n for e in range(n) :\r\n if lang in empl[e] : \r\n if not seen[e] :\r\n seen[e] = True\r\n to_visit.append(e)\r\n\r\ncount = 0\r\nfor i in range(n) :\r\n if employees[i] == [] :\r\n count += 1\r\n else :\r\n if seen[i] == False :\r\n count += 1\r\n dfs(employees, i)\r\n\r\nif z == n : \r\n print(count)\r\nelse : \r\n print(count-1)", "n, m = list(map(int, input().split()))\r\n\r\n# создаем пока пустой список множеств\r\nall_lang_num = 0\r\nlang = []\r\n# цикл по людям\r\nfor i in range(n):\r\n # читаем строчку, первый аргумент лишний\r\n l = list(map(int, input().split()))\r\n # назначим l[1:] i-му человеку \r\n lang.append(set(l[1:]))\r\n all_lang_num += l[0]\r\n# print(lang)\r\n\r\nedges = []\r\n# в цикле i по всем вершинам\r\n # создаем пустое множество\r\n # в цикле j по всем прочим вершинам\r\n # если пересечение языков не пусто\r\n # добавляем в множество j - го человека\r\n #назначаем построенное множество i-му человеку\r\nfor i in range(n):\r\n p = set()\r\n for j in range(n):\r\n if len(lang[i] & lang[j]) != 0:\r\n p.add(j)\r\n edges.append(p)\r\n \r\n# print (edges)\r\n\r\n# считаем компоненты связности\r\n# создаем список необработанных вершин; изначально это все множество\r\nunprocessed = set(range(n))\r\ncomponents = 0\r\nwhile len(unprocessed) != 0:\r\n components += 1\r\n # увеличиваем число компонент связности\r\n # удалим все вершины из этой компоненты связности\r\n \r\n # выбираем любую вершину (наименьшую)\r\n # добавляем ее в очередь на обработку\r\n queue = {min(unprocessed)}\r\n \r\n # пока в очереди на обработку есть вершины\r\n while len(queue) != 0:\r\n # выбираем наименьшую\r\n v = min(queue)\r\n queue |= (unprocessed & edges[v])\r\n unprocessed.remove(v)\r\n queue.remove(v)\r\n # print(v, end = \".\")\r\n # добавляем пересечение всех ее соседей с unprocessed в очередь на обработку\r\n # удаляем ее из очереди на обработку и из unprocessed\r\n # print()\r\n\r\nif (all_lang_num == 0):\r\n print(n)\r\nelse:\r\n print(components - 1)\r\n#\r\n", "rd = lambda: list(map(int, input().split()))\n\ndef root(x):\n if f[x]!=x: f[x] = root(f[x])\n return f[x]\n\nn, m = rd()\nN=range(n)\nf=list(N)\nlang = [0]*n\nfor i in N:\n\tlang[i] = set(rd()[1:])\nfor i in N:\n\tfor j in N[:i]:\n\t\tif j==root(j) and lang[j].intersection(lang[i]):\n\t\t\tf[j] = i\n\t\t\tlang[i] = lang[i].union(lang[j])\nprint(sum(1 for i in N if i==root(i)) - (sum(map(len, lang))>0))\n\n", "parent = [i for i in range(101)]\r\nrank = [0] * 101\r\nfrequency = [0] * 101\r\nnolang = 0\r\ncount = 0\r\n\r\nn, m = map(int, input().split())\r\n\r\ndef find(x):\r\n if x != parent[x]:\r\n parent[x] = find(parent[x])\r\n return parent[x]\r\n\r\ndef union(x, y):\r\n a = find(x)\r\n b = find(y)\r\n if a == b:\r\n return\r\n if rank[a] < rank[b]:\r\n parent[a] = b\r\n else:\r\n parent[b] = a\r\n if rank[a] == rank[b]:\r\n rank[b] += 1\r\n\r\nfor i in range(n):\r\n k, *elements = map(int, input().split())\r\n if k == 0:\r\n nolang += 1\r\n continue\r\n u = elements[0]\r\n frequency[u] += 1\r\n for v in elements[1:]:\r\n frequency[v] += 1\r\n union(u, v)\r\n\r\nans = 0\r\nfor i in range(1, m + 1):\r\n if frequency[i] == 0:\r\n count += 1\r\n elif parent[i] == i:\r\n ans += 1\r\n\r\nans -= 1\r\nif count == m:\r\n print(n)\r\nelse:\r\n print(ans + nolang)\r\n", "I = lambda: list(map(int, input().split()))\r\nn, m = I()\r\nr = 0\r\nt = []\r\n\r\nfor _ in range(n):\r\n l = I()\r\n if l[0] == 0:\r\n r += 1\r\n else:\r\n t.append(set(l[1:]))\r\n\r\ni = 0\r\nwhile i < len(t):\r\n for j in t[i+1:]:\r\n if t[i] & j:\r\n t[i] |= j\r\n t.remove(j)\r\n break\r\n else:\r\n i += 1\r\n\r\nprint(max(0, len(t) - 1) + r)", "n, m = [int(x) for x in input().split()]\nl = [[]] * n\nfor i in range(n):\n\tl[i] = set(int(x) for x in input().split()[1:])\nwhile True:\n\tfor i in range(len(l)):\n\t\tfor j in range(i):\n\t\t\tif l[i] & l[j]:\n\t\t\t\tl[j] |= l[i]\n\t\t\t\tl = l[:i] + l[i + 1:]\n\t\t\t\tbreak\n\t\telse:\n\t\t\tcontinue\n\t\tbreak\n\telse:\n\t\tbreak\nans = len(l)\nfor s in l:\n\tif s:\n\t\tans -= 1\n\t\tbreak\nprint(ans)\n", "n,m = map(int,input().split())\r\ngraph = {i:set() for i in range(1,1+n)}\r\nfor i in range(101, 101+m):\r\n graph[i]=set()\r\n\r\nzc=0\r\nfor i in range(1,1+n):\r\n a = list(map(int, input().split()))\r\n if a.pop(0)==0:zc+=1\r\n for j in a:\r\n graph[i].add(100+j)\r\n graph[100+j].add(i)\r\n\r\n\r\ndef dfs(v): \r\n unvis[v] = False\r\n for i in graph[v]:\r\n for j in graph[i]:\r\n if unvis[j]:\r\n dfs(j)\r\n\r\nif zc==n:\r\n print(n)\r\nelse:\r\n cc = 0\r\n unvis = [True]*(n+1)\r\n for k in range(1,1+n):\r\n if unvis[k]:\r\n dfs(k)\r\n cc+=1\r\n print(cc-1)", "\r\n\r\n\r\n\r\ndef findC(roots, ind):\r\n while roots[ind] != ind:\r\n roots[ind] = roots[roots[ind]]\r\n ind = roots[ind]\r\n return ind\r\n \r\n \r\ndef union(roots, ranks, u, v):\r\n u = findC(roots, u)\r\n v = findC(roots, v)\r\n if ranks[u] > ranks[v]:\r\n roots[v] = roots[u]\r\n elif ranks[v] > ranks[u]:\r\n roots[u] = roots[v]\r\n else:\r\n ranks[u] += 1\r\n roots[v] = roots[u]\r\n\r\nn, m = map(int, input().split())\r\n\r\nroots = [i for i in range(m)]\r\nranks = [0] * m\r\nans = [-1 - i for i in range(n)]\r\nfor i in range(n):\r\n L = list(map(int, input().split()))\r\n for j in range(2, len(L)):\r\n if findC(roots, L[1] - 1) != findC(roots, L[j] - 1):\r\n union(roots, ranks, L[1] - 1, L[j] - 1)\r\n if len(L) > 1:\r\n ans[i] = L[1] - 1\r\nfor i in range(n):\r\n if ans[i] >= 0:\r\n ans[i] = findC(roots, ans[i])\r\n \r\nf = 0\r\n\r\nx = set()\r\nfor a in ans:\r\n if a < 0:\r\n f += 1\r\n else:\r\n x.add(a)\r\nif len(x) == 0:\r\n print(n)\r\nelse:\r\n print(len(x) - 1 + f)", "n, m = map(int, input().split())\r\n\r\ngraph = {}\r\n\r\nans = 0\r\n\r\nfor _ in range(n):\r\n a = input().split()\r\n for i in range(1, len(a)):\r\n if graph.get(a[i]) is None: graph[a[i]] = set()\r\n for j in range(1, len(a)):\r\n if i == j: continue\r\n graph[a[i]].add(a[j])\r\n if len(a) == 1: ans += 1\r\n\r\nk = -1\r\nvisited = set()\r\n\r\ndef dfs(p):\r\n if p in visited: return\r\n \r\n visited.add(p)\r\n for v in graph[p]: dfs(v)\r\n\r\nfor v in graph.keys():\r\n if v in visited: continue\r\n k += 1\r\n dfs(v)\r\n\r\nprint(ans + max(0, k))\r\n", "n, m = map(int, input().split())\n\nadj = [[] for _ in range(n+m)]\n\nt = 0\n\nfor i in range(n):\n k = [int(i) for i in input().split()]\n t+=k[0]\n for j in range(1, k[0]+1):\n adj[i+m].append(k[j]-1)\n adj[k[j]-1].append(i+m)\n\nvisited = [0]*(n+m+1)\ncomponents = 0\n\ndef dfs(v):\n visited[v]=1\n for u in adj[v]:\n if not visited[u]:\n dfs(u)\n\nfor v in range(m, n+m):\n if not visited[v]:\n components += 1\n dfs(v)\n\nprint(components-1) if t>0 else print(n)\n \t\t \t\t\t \t\t \t \t \t\t \t\t\t\t \t \t", "import queue\r\nn,m = map(int,input().split())\r\nworkers = []\r\nflag = False\r\nfor i in range(n):\r\n workers.append(list(map(int,input().split())))\r\n if workers[-1][0]>0:\r\n flag=True\r\n workers[-1].pop(0)\r\ngraph = [[i] for i in range(n+m+1)]\r\nfor i in graph:\r\n i.pop()\r\nif not flag:\r\n print(n)\r\n quit()\r\nfor i in range(n):\r\n for j in workers[i]:\r\n graph[j].append(i+m+1)\r\n graph[i+m+1].append(j)\r\n\r\nisntWalked = [True for i in range(n+m+1)]\r\nsectorNum = 0\r\nfor t in range(m+1, n+m+1):\r\n if not isntWalked[t]:\r\n continue\r\n targets = queue.Queue()\r\n targets.put(t)\r\n isntWalked[t]=False\r\n while not targets.empty():\r\n last = targets.get()\r\n for i in graph[last]:\r\n if isntWalked[i]:\r\n targets.put(i)\r\n isntWalked[i]=False\r\n sectorNum+=1\r\nans = sectorNum-1\r\nprint(ans)\r\n", "#!/usr/bin/env python3\nimport sys\nip = sys.stdin.readlines()\nn,m = map(int,ip[0].split())\n\n##idea is the employees and languages they speak are a bipartite graph\n##ie. employees on one side, languages on other, edges connecting them\n##use disjoint set union or DSU or Union Find to solve it\n##answer is max(0, connected_components -1) + no_connections\n\nclass DSU:\n def __init__(self, size):\n self.parent = [i for i in range(size)]\n self.rank = [0] * size\n\n def make_set(self, v):\n self.parent[v] = v\n self.rank[v] = 0\n\n def find_set(self, v):\n if v == self.parent[v]:\n return v\n self.parent[v] = self.find_set(self.parent[v])\n return self.parent[v]\n\n def union_sets(self, a, b):\n a = self.find_set(a)\n b = self.find_set(b)\n if a != b:\n if self.rank[a] < self.rank[b]:\n a, b = b, a\n self.parent[b] = a\n if self.rank[a] == self.rank[b]:\n self.rank[a] += 1\n\n\ndsu = DSU(101)\n\nno_connections = 0\nconnected_components = 0\nlangg = set()\nfor i in range(1,n+1):\n langs = list(map(int, ip[i].split()))[1:]\n if langs == []: \n no_connections += 1\n continue\n for l in langs:\n langg.add(l)\n u = langs[0]\n for v in langs[1:]:\n dsu.union_sets(u,v)\n\n##if self parent then this is a component in the graph\n##num of self parents will be number of connected components\n##no connections are counted above\nfor i in langg:\n if dsu.parent[i] == i:\n connected_components += 1\n\nans = max(0, connected_components-1) + no_connections\nprint(ans)\n", "n, m = map(int, input().split())\nls = []\n\nc = 0\n\nfor i in range(n):\n nl = tuple(map(int, input().split()[1:]))\n if not nl:\n c += 1\n continue\n ls.append((i, nl))\n\n\ndef communicate(i, l, v):\n v.append(i)\n for ni, nl in ls:\n if ni not in v and [a for a in l if a in nl]:\n communicate(ni, nl, v)\n return v\n\nif ls:\n c -= 1\n\nwhile ls:\n c += 1\n b = communicate(ls[0][0], ls[0][1], [])\n ls = [(i, l) for i, l in ls if i not in b]\nprint(c)\n", "n, m = map(int, input().split())\nadj = [[] for _ in range(n+m+1)]\nx = 0\nfor i in range(1, n+1):\n xx, *yy = map(int, input().split())\n x += xx\n for y in yy:\n adj[i].append(y+n)\n adj[y+n].append(i)\n\nif x == 0:\n print(n)\nelse:\n vis = [0 for _ in range(n+m+1)]\n count = 0\n for i in range(1, n+1):\n if not vis[i]:\n count += 1\n vis[i] = 1\n queue = []\n queue.append(i)\n\n while queue:\n node = queue.pop(0)\n for it in adj[node]:\n if not vis[it]:\n vis[it] = 1\n queue.append(it)\n print(count-1)\n", "parent = [i for i in range(105)]\nsize = [1]*105\ndef find(child):\n\tif parent[child] == child:\n\t\treturn child\n\telse:\n\t\tparent[child] = find(parent[child])\n\t\treturn parent[child]\n\n#returns true if two communities combined, false if not\ndef union(a, b):\n\trootA = find(a)\n\trootB = find(b)\n\tif (rootA == rootB):\n\t\treturn False\n\n\tif (size[rootA] > size[rootB]):\n\t\ttmp = rootA\n\t\trootA = rootB\n\t\trootB = tmp\n\tsize[rootB] += size[rootA]\n\tparent[rootA] = rootB\n\treturn True\n\n[N, M] = list(map(int, input().split()))\nlangs_speakers_list = [[] for i in range(M)]\nfor emp in range(N):\n\tnums = list(map(int, input().split()))\n\tfor j in range(1, len(nums)):\n\t\tlang = nums[j] - 1\n\t\tspeakers_list = langs_speakers_list[lang]\n\t\tspeakers_list.append(emp)\n\nif sum(len(speakers_list) for speakers_list in langs_speakers_list) == 0:\n\tprint(N)\nelse:\n\tcommunities = N\n\tfor speakers_list in langs_speakers_list:\n\t\tfor emp in range(len(speakers_list)-1):\n\t\t\tcombined = union(speakers_list[emp], speakers_list[emp+1])\n\t\t\tif combined:\n\t\t\t\tcommunities -= 1\n\tprint(communities-1) \n\n\n\n\n\n", "n,m = map(int,input().split())\r\nl = []\r\nfor i in range(n):\r\n t = list(map(int,input().split()))\r\n s = set()\r\n if t[0]==0: continue\r\n for j in range(1,t[0]+1):\r\n s.add(t[j])\r\n l.append(s)\r\n \r\nans=0\r\n#print(l)\r\ns1,s = set(),set()\r\nfor i in range(len(l)):\r\n s = l[i]\r\n f = 0\r\n for j in range(len(l)):\r\n if i==j: continue\r\n if len(l[j].intersection(s))!=0:\r\n s = s.union(l[j])\r\n\r\n if len(s.intersection(s1))==0: ans+=1\r\n s1 = s1.union(s)\r\n\r\nprint(max(0,ans-1)+n-len(l))\r\n\r\n", "n,m=map(int,input().split())\nd={}\n\nfor i in range(1,m+1):\n\td[i]=[]\n\narr=[]\n\nfor i in range(n):\n\ta=list(map(int,input().split()))\n\ta=a[1:]\n\tarr.append(a)\n\tfor j in a:\n\t\td[j].append(i)\n\nadj={}\nfor i in range(n):\n\tadj[i]=[]\n\nfor i in range(n):\n\tfor j in arr[i]:\n\t\tadj[i]+=d[j]\n\n\n#print(adj)\n\nvis=[0]*n\n\ndef dfs(n):\n\tif vis[n]:\n\t\treturn\n\tvis[n]=1\n\tfor i in adj[n]:\n\t\ttry:\n\t\t\tdfs(i)\n\t\texcept:\n\t\t\tpass\n\nans=0\nkeys=[i for i in range(n)]\n\nfor i in range(n):\n\tif len(adj[i])==0:\n\t\tans+=1\n\t\tkeys.pop(keys.index(i))\n\nfor i in range(n):\n\tadj[i]=list(set(adj[i])-{i})\n\nfor i in adj:\n\tadj[i]=list(set(adj[i]))\n\nif len(keys):\n\tdfs(keys[0])\nfor i in keys:\n\tif not vis[i]:\n\t\tans+=1\n\tdfs(i)\n\nprint(ans)\n", "def mapit():\r\n\ttemp=list(map(int,input().split()))\r\n \r\n\treturn temp\r\n\r\n\r\ndef solution():\r\n\tn,m=mapit()\r\n\tvisited=[False]*(n+1)\r\n\tpaths={}\r\n\tlans={}\r\n\twithout_lan=set()\r\n\tfor i in range(1,n+1):\r\n\t\ttp=mapit()\r\n\t\tif tp[0]!=0:\r\n\t\t\tlans[i]=set(tp[1:])\r\n\t\telse:\r\n\t\t\twithout_lan.add(i)\r\n\r\n\tfor i in range(1,n+1):\r\n\t\tif i not in without_lan:\r\n\t\t\tpaths[i]=[]\r\n\t\t\tfor j in range(1,n+1):\r\n\t\t\t\tif i!=j and j not in without_lan:\r\n\t\t\t\t\tif len(lans[i].intersection(lans[j]))!=0:\r\n\t\t\t\t\t\tpaths[i].append(j)\r\n\t\t\t\r\n\r\n\tsol=len(without_lan)\r\n\t\r\n\r\n\tdef dfs(curr):\r\n\t\tvisited[curr]=True\r\n\t\tfor neighbor in paths[curr]:\r\n\t\t\tif visited[neighbor]==False:\r\n\t\t\t\tdfs(neighbor)\r\n\t\treturn\r\n\tfirst=True\r\n\tfor key in paths:\r\n\t\tif visited[key]==False:\r\n\t\t\tif paths[key]!=[]:\r\n\t\t\t\tdfs(key)\r\n\t\t\tif first:\r\n\t\t\t\tfirst=False\r\n\t\t\telse:\r\n\t\t\t\tsol+=1\r\n\t\t\r\n\tprint(sol)\r\n\r\n\r\n\r\n\t\t\t\r\n\r\n\t\r\n\treturn\r\n\r\n\t\r\n\r\n\r\n# t=int(input())\r\n \r\n# while t:\r\n# \tt-=1\r\nsolution()\r\n", "from sys import stdin\r\ninput = stdin.readline\r\nn, m = map(int, input().split())\r\nl = []\r\ncnt = 0\r\nfor _ in range(n):\r\n a = set(list(map(int, input().split()))[1:])\r\n if len(a) == 0:\r\n cnt += 1\r\n continue\r\n li = []\r\n for s in l:\r\n if a&s:\r\n a |= s\r\n else:\r\n li.append(s)\r\n li.append(a)\r\n l = li\r\nprint(cnt + max(0, len(l) - 1))", "# coding: utf-8\ndef union(s,n):\n i = 0\n while i < n:\n j = i+1\n while j < n:\n if s[i]&s[j]:\n s[i] = s[i]|s[j]\n del(s[j])\n n -= 1\n else:\n j += 1\n i += 1\n return s, n\nn, m = [int(i) for i in input().split()]\nlanguages = []\nans = 0\nfor i in range(n):\n tmp = set([int(j) for j in input().split()[1:]])\n if tmp:\n languages.append(tmp)\n else:\n n -= 1\n ans += 1\nlanguages, n = union(languages,n)\nlanguages, n = union(languages,n)\nif languages:\n ans += n-1\nprint(ans)\n", "n, m = map(int, input().split())\r\n\r\ndegrees = [0 for _ in range(m)]\r\nparent = [i for i in range(m)]\r\nsize = [1 for _ in range(m)]\r\n\r\ndef find(child):\r\n if parent[child] == child:\r\n return child\r\n\r\n parent[child] = find(parent[child])\r\n return parent[child]\r\n\r\n\r\ndef union(child_a, child_b):\r\n root_a = find(child_a)\r\n root_b = find(child_b)\r\n\r\n if root_a == root_b:\r\n return\r\n\r\n if size[root_a] > size[root_b]:\r\n tmp = root_a\r\n root_a = root_b\r\n root_b = tmp\r\n\r\n size[root_b] += size[root_a]\r\n parent[root_a] = root_b\r\n\r\n\r\ncost = 0\r\nfor _ in range(n):\r\n emp = list(map(int, input().split()))\r\n\r\n if emp[0] < 1:\r\n cost += 1\r\n\r\n for l in emp[1:]:\r\n degrees[l-1] += 1\r\n\r\n if emp[0] < 2:\r\n continue\r\n\r\n for l in emp[2:]:\r\n union(emp[1]-1, l-1)\r\n\r\np = 0\r\nfor i, d in enumerate(degrees):\r\n if d > 0:\r\n p = i\r\n break\r\n\r\nfor i in range(m):\r\n if degrees[i] > 0 and find(i) != find(p):\r\n union(p, i)\r\n if degrees[0] + degrees[i] > 0:\r\n cost += 1\r\n else:\r\n cost += 2\r\n\r\nprint(cost)", "def DFS(u):\r\n visited[u] = True\r\n for i in range(len(graph[u])):\r\n v = graph[u][i]\r\n if not visited[v]:\r\n DFS(v)\r\n\r\nif __name__ == \"__main__\":\r\n n, m = map(int, input().split())\r\n visited = [False for _ in range(201)]\r\n graph = [[] for _ in range(201)]\r\n\r\n res = 0\r\n for i in range(n):\r\n l = list(map(int, input().split()))\r\n if l[0] == 0:\r\n res += 1\r\n else:\r\n for j in range(l[0]):\r\n x = l[j + 1]\r\n graph[i].append(x + 100)\r\n graph[x + 100].append(i)\r\n\r\n if res == n:\r\n print(n)\r\n else:\r\n res = 0\r\n for i in range(n):\r\n if not visited[i]:\r\n res += 1\r\n DFS(i)\r\n print(res - 1)", "import sys\r\ninput=sys.stdin.readline\r\nI=lambda:list(map(int,input().split()))\r\nn,m=I()\r\nt=list(range(201))\r\ndef find(u):\r\n\tif t[u]==u:\r\n\t\treturn u\r\n\telse:\r\n\t\tt[u]=find(t[u])\r\n\treturn t[u]\r\n \r\ndef join(u,v):\r\n\tx=find(u)\r\n\ty=find(v)\r\n\tif x!=y:\r\n\t\tt[x]=y\r\ns=set()\r\nans=0\r\nfor i in range(n):\r\n a,*b=I()\r\n if a==0:\r\n ans+=1\r\n for j in b:\r\n join(b[0],j)\r\n s.add(j)\r\nss=set()\r\nfor i in s:\r\n ss.add(find(i))\r\nprint(max(0,len(ss)-1)+ans)\r\n", "dsu = []\r\n\r\ndef find(key, v = set()):\r\n if len(v) == len(dsu): return\r\n if key not in v:\r\n if dsu[key] == key:\r\n return key\r\n x = find(dsu[key], v.union({key}))\r\n if x:\r\n dsu[key] = x\r\n return dsu[key]\r\n\r\n\r\ndef check(x, y):\r\n find(x)\r\n a = dsu[x]\r\n find(y)\r\n b = dsu[y]\r\n if a == b:\r\n return True\r\n return False\r\n\r\ndef change(x, y):\r\n find(x)\r\n a = dsu[x]\r\n find(y)\r\n b = dsu[y]\r\n dsu[a] = b\r\n\r\ndef Solve():\r\n global dsu\r\n n, m = list(map(int, input().split()))\r\n dsu = [i for i in range(m+1)]\r\n langs = set() ; z = 0\r\n for i in range(n):\r\n line = list(map(int, input().split()))[1:]\r\n if not line:\r\n z+=1\r\n continue\r\n y = line[0]\r\n langs.add(y)\r\n for x in line[1:]:\r\n change(x, y)\r\n langs.add(x)\r\n \r\n for i in range(m+1):\r\n check(i, 0)\r\n ans = 0\r\n for i in langs:\r\n if i in dsu:\r\n ans+=1\r\n print(ans+z-(ans!=0))\r\n\r\nif __name__ == \"__main__\":\r\n Solve()\r\n", "def findSet(u):\r\n if parent[u] == -1:\r\n parent[u] = u\r\n return u\r\n if u != parent[u]:\r\n parent[u] = findSet(parent[u])\r\n return parent[u]\r\n\r\ndef unionSet(u, v):\r\n up = findSet(u)\r\n vp = findSet(v)\r\n if up == vp:\r\n return\r\n parent[up] = vp\r\n \r\nn, m = map(int, input().split())\r\nparent = [-1 for i in range(m)]\r\nempty = 0\r\nfor _ in range(n):\r\n k, *languages = map(int, input().split())\r\n if k == 0:\r\n empty += 1\r\n for i in range(k):\r\n for j in range(i, k):\r\n unionSet(languages[i] - 1, languages[j] - 1)\r\ns = sum(1 for i in range(m) if parent[i] != -1 and findSet(i) == i)\r\nif s != 0:\r\n s -= 1\r\nprint(s + empty)", "def inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\ndef find_set(v):\r\n if v == parent[v]:\r\n return v\r\n parent[v] = find_set(parent[v])\r\n return parent[v]\r\n\r\ndef union_set(u, v):\r\n u = find_set(u)\r\n v = find_set(v)\r\n if u != v:\r\n parent[v] = u\r\n return None\r\n\r\nn, m = invr()\r\nedges = []\r\nparent = [i for i in range(n + m)]\r\n\r\nfor i in range(n):\r\n languages = inlt()[1:]\r\n for j in range(len(languages)):\r\n edges.append([i, languages[j] + n - 1])\r\n\r\nif len(edges) == 0:\r\n print(n)\r\nelse:\r\n for i in range(len(edges)):\r\n union_set(edges[i][0], edges[i][1])\r\n\r\n s = set()\r\n\r\n for i in range(n + m):\r\n s.add(find_set(parent[i]))\r\n\r\n print(len([v for v in s if v < n]) - 1)", "n,m=map(int,input().split())\r\nw=0\r\nr=[]\r\nfor i in range(n):\r\n k,*l=map(int,input().split())\r\n if k==0:w+=1\r\n else:r.append(set(l))\r\nq=[]\r\nwhile q!=r:\r\n q=list(r)\r\n for i in range(len(r)):\r\n for j in range(len(r)):\r\n if r[i]&r[j]:\r\n r[i]=r[i]|r[j]\r\nq=[]\r\nfor i in r:\r\n if i not in q:q.append(i)\r\nprint(len(q)-1*int(len(q)!=0)+w)", "def R(): return map(int, input().split())\r\ndef I(): return int(input())\r\ndef S(): return str(input())\r\n\r\ndef L(): return list(R())\r\n\r\nfrom collections import Counter \r\n\r\nimport math\r\nimport sys\r\n\r\nfrom itertools import permutations\r\n\r\nn,m=R()\r\n\r\ncon=[0]*m\r\n\r\nfor i in range(m):\r\n con[i]=set()\r\n\r\nlabel=[-1]*m\r\nv=0\r\nfor i in range(n):\r\n a=L()\r\n\r\n l=len(a)\r\n\r\n if l==1:\r\n v+=1\r\n\r\n for j in range(1,l):\r\n label[a[j]-1]=0\r\n\r\n for j in range(1,l):\r\n for k in range(max(1,j+1),l):\r\n con[a[j]-1].add(a[k]-1)\r\n con[a[k]-1].add(a[j]-1)\r\n\r\n\r\n\r\n\r\ndef search(x):\r\n for i in con[x]:\r\n if label[i]==0:\r\n label[i]=label[x]\r\n search(i)\r\n\r\ncnt=0\r\nfor i in range(m):\r\n if label[i]==0:\r\n cnt+=1\r\n label[i]=1\r\n search(i)\r\n \r\nif cnt==0:\r\n print(v)\r\nelse:\r\n print(cnt-1+v)\r\n", "mx = 101\nparent = [i for i in range(mx)]\nrnk = [0] * mx\nfreq = [0] * mx\n\nzeroLanguage = count = 0\nn, m = map(int, input().split())\n\nfor _ in range(n):\n k, *e = map(int, input().split())\n if k == 0:\n zeroLanguage += 1\n else:\n u = e[0]\n freq[u] += 1\n for v in e[1:]:\n freq[v] += 1\n \n a = u\n while a != parent[a]:\n a = parent[a]\n b = v\n while b != parent[b]:\n b = parent[b]\n \n if a != b:\n if rnk[a] < rnk[b]:\n parent[a] = b\n else:\n parent[b] = a\n if rnk[a] == rnk[b]:\n rnk[a] += 1\n\ncount = sum(1 for i in range(1, m + 1) if freq[i] == 0)\n\nans = sum(1 for i in range(1, m + 1) if parent[i] == i and freq[i] > 0)\n\nif count == m:\n print(n)\nelse:\n print(max(ans - 1 + zeroLanguage, zeroLanguage))\n", "\r\nfrom sys import stdin, stdout\r\n# output\r\ndef out(*args):\r\n for arg in args:\r\n stdout.write(str(arg))\r\n# read line of input\r\ndef line():\r\n return stdin.readline().strip()\r\n# read in ints on a line\r\ndef ints():\r\n return list(map(int, line().split()))\r\nimport copy\r\n# create array & fill it\r\ndef arr(length, default=0):\r\n return [copy.deepcopy(default) for _ in range(length)]\r\ndef powmod(a, b, m):\r\n ans = 1\r\n while b > 1:\r\n a %= m\r\n if b % 2:\r\n ans = (ans * a) % m\r\n a *= a\r\n b //= 2\r\n return ans * a**b % m\r\n\r\ndef testcases():\r\n t, = ints()\r\n for i in range(t):\r\n yield i\r\n\r\ndef stringify(v, delim=\" \"):\r\n if isinstance(v, list):\r\n return delim.join(stringify(x) for x in v)\r\n return str(v)\r\n\r\ndef find(parent, n):\r\n if parent[n] == n: return n\r\n parent[n] = find(parent, parent[n])\r\n return parent[n]\r\n\r\ndef union(parent, size, a, b):\r\n ra, rb = find(parent, a), find(parent, b)\r\n if ra == rb: return\r\n # if size[ra] > size[rb]:\r\n # ra, rb = rb, ra\r\n # size[rb] += size[ra]\r\n # parent[ra] = rb\r\n if ra < rb:\r\n ra, rb = rb, ra\r\n parent[rb] = ra\r\n\r\ndef main():\r\n N, M = ints()\r\n parent = [i for i in range(N + M)]\r\n size = [1 for _ in range(N + M)]\r\n for i in range(N):\r\n languages = ints()\r\n for il in range(1, len(languages)):\r\n language = languages[il] - 1\r\n union(parent, size, i, language + N)\r\n \r\n trees = set(find(parent, x) for x in range(N))\r\n mv = max(trees)\r\n if mv >= N:\r\n print(len(trees) - 1)\r\n else:\r\n print(len(trees))\r\n\r\n\r\n\r\nif \"__main__\" == __name__:\r\n main()\r\n", "import sys\r\n\r\ndef input(): return sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\ndef maps(): return [int(i) for i in input().split()]\r\n\r\n\r\ndef func():\r\n\r\n n, m = maps()\r\n\r\n if n > m + 1 or m > 2 * (n + 1):\r\n print(-1)\r\n\r\n else:\r\n\r\n if n == m: # self - explanatory\r\n print('10' * n)\r\n\r\n elif n == m + 1: # self - explanatory\r\n print('01' * m + '0')\r\n\r\n elif 2 * n + 2 == m: # special case\r\n print('110' * n + '11')\r\n else:\r\n t = m - n - 1 # '110'*t -- make the m as close to n , now m = n+1 is left\r\n print('110' * t + '10' * (n - t) + '1')\r\n\r\n\r\nclass Seq:\r\n\r\n def calc(self, s):\r\n S = str(s)\r\n return s + int(max(S)) * int(min(S))\r\n\r\n def solve(self):\r\n for _ in range(*maps()):\r\n a, k = maps()\r\n k -= 1\r\n prev = 0\r\n while k and a - prev:\r\n k -= 1\r\n prev = a\r\n a = calc(a)\r\n print(a)\r\n\r\n\r\nfrom _collections import defaultdict, OrderedDict\r\n\r\nclass Young:\r\n\r\n def solve(self):\r\n\r\n for _ in range(*maps()):\r\n n, = maps()\r\n a = [*maps()]\r\n dic = defaultdict(int)\r\n gr = 0\r\n for i in a:\r\n dic[i] += 1\r\n\r\n # print(dic,\"bef\")\r\n\r\n for i in dic:\r\n x = dic[i] // i\r\n gr += x\r\n dic[i] -= x * i\r\n\r\n # print(dic,gr)\r\n\r\n rem = []\r\n for i in dic:\r\n while dic[i]:\r\n rem.append(i)\r\n dic[i] -= 1\r\n\r\n rem.sort()\r\n # print(rem,gr)\r\n\r\n i = 0\r\n mx = 0\r\n dis = 0\r\n while i < len(rem):\r\n dis += 1\r\n mx = max(mx, rem[i])\r\n if mx <= dis:\r\n gr += 1\r\n dis = 0\r\n i += 1\r\n\r\n print(gr)\r\n\r\n\r\nclass Johnny:\r\n\r\n def solve(self):\r\n for _ in range(*maps()):\r\n n, = maps()\r\n a = [*maps()]\r\n diff = [0] * n\r\n cc = 0\r\n for i in range(n):\r\n if i + 1 != a[i]:\r\n cc += 1\r\n diff[i] = 1\r\n if cc == n:\r\n print(1)\r\n elif cc == 0:\r\n print(0)\r\n else:\r\n diff = ''.join(map(str, diff)).split('0')\r\n\r\n x = sum([1 if len(i) else 0 for i in diff])\r\n print(min(2, x))\r\n\r\n\r\ndef applejack():\r\n\r\n n, = maps()\r\n a = [*maps()]\r\n q, = maps()\r\n d = defaultdict(int)\r\n cnt1, cnt2 = 0, 0\r\n\r\n for i in a:\r\n d[i] += 1\r\n\r\n for i in d:\r\n cnt1 += d[i] // 4 # squares\r\n cnt2 += (d[i] % 4) // 2 # recs each parallel side\r\n\r\n for i in range(q):\r\n s, x = input().split()\r\n x = int(x)\r\n f = d[x]\r\n if s == '+':\r\n d[x] += 1\r\n if f % 4 == 1:\r\n cnt2 += 1\r\n elif f % 4 == 3:\r\n cnt1 += 1\r\n cnt2 -= 1\r\n\r\n else:\r\n d[x] -= 1\r\n if f % 4 == 0:\r\n cnt1 -= 1\r\n cnt2 += 1\r\n elif f % 4 == 2:\r\n cnt2 -= 1\r\n\r\n if cnt1 > 1 or (cnt1 and cnt2 > 1):\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\n # An alternative solution is using heaps\r\n\r\n\r\ndef perform_the_combo():\r\n for _ in range(*maps()):\r\n n, m = maps()\r\n s = input()\r\n p = [*maps()]\r\n\r\n arr = []\r\n temp = [0] * 26\r\n\r\n for i in range(n):\r\n temp[ord(s[i]) - 97] += 1\r\n temp1 = temp[:]\r\n arr.append(temp1)\r\n\r\n ans = arr[-1]\r\n\r\n for i in range(m):\r\n for j in range(26):\r\n ans[j] += arr[p[i] - 1][j]\r\n\r\n print(*ans)\r\n # another way to it is by sorting the array p and counting how many times it will occur in ans\r\n\r\n\r\ndef perm_partitions():\r\n n, k = maps()\r\n a = [(i, j) for i, j in enumerate(maps())]\r\n a.sort(key=lambda x: x[1], reverse=True)\r\n pos = []\r\n mod = 998244353\r\n p = 0\r\n for i in range(k):\r\n pos.append(a[i][0])\r\n p += a[i][1]\r\n pos.sort()\r\n ans = 1\r\n for i in range(k - 1):\r\n ans *= pos[i + 1] - pos[i]\r\n ans %= mod\r\n # print(pos[i+1] - pos[i])\r\n print(p, ans)\r\n\r\n\r\ndef find(x, par):\r\n if x == par[x]:\r\n return x\r\n par[x] = find(par[x], par)\r\n return par[x]\r\n\r\n\r\ndef union(x, y, par):\r\n x, y = find(x, par), find(y, par)\r\n if x != y:\r\n par[x] = y\r\n\r\n\r\ndef languages():\r\n\r\n n, m = maps()\r\n l = [set([*maps()][1:]) for i in range(n)]\r\n if all(not len(i) for i in l):\r\n print(n)\r\n return\r\n par = list(range(n))\r\n\r\n for i in range(n):\r\n for j in l[i]:\r\n for k in range(n):\r\n if j in l[k]:\r\n union(i, k, par)\r\n\r\n print(len(set(find(x, par) for x in par)) - 1)\r\n\r\n\r\nlanguages()\r\n", "n,m = [int(i) for i in input().split()]\r\nd = []\r\nr=0\r\nfor i in range(n):\r\n a =[int(i) for i in input().split()]\r\n if a[0]==0: r+=1\r\n else: d += [set(a[1:])]\r\n\r\ni=0\r\n#print(d)\r\nwhile i<len(d):\r\n for j in d[i+1:]:\r\n if d[i] & j:\r\n d[i]|=j\r\n d.remove(j)\r\n break\r\n else: i+=1\r\n\r\nprint(max(0,len(d)-1)+r)", "n, m = map(int, input().split())\r\n\r\np = [None for i in range(m+1)]\r\nr = [0 for i in range(m+1)]\r\nk = 0\r\n\r\ndef get(x):\r\n while p[x] != x:\r\n x = p[x]\r\n return x\r\n\r\ndef union(x, y):\r\n x = get(x)\r\n y = get(y)\r\n \r\n if x == y:\r\n return 0\r\n \r\n if r[x] > r[y]:\r\n x, y = y, x\r\n \r\n p[x] = y\r\n if r[x] == r[y]:\r\n r[y] += 1\r\n \r\n return 1\r\n \r\nfor i in range(n):\r\n s = list(map(int, input().split()))\r\n if s[0] == 0:\r\n k += 1\r\n for j in range(1, s[0] + 1):\r\n if p[s[j]] == None:\r\n p[s[j]] = s[j]\r\n \r\n for j in range(1, s[0]):\r\n \r\n union(s[j], s[j+1])\r\n\r\nok = False\r\nfor i in range(1, m+1):\r\n if i == p[i]:\r\n k += 1\r\n ok = True\r\n \r\nprint(k-1 if ok else k)\r\n", "def fastio():\r\n\timport sys\r\n\tfrom io import StringIO \r\n\tfrom atexit import register\r\n\tglobal input\r\n\tsys.stdin = StringIO(sys.stdin.read())\r\n\tinput = lambda : sys.stdin.readline().rstrip('\\r\\n')\r\n\tsys.stdout = StringIO()\r\n\tregister(lambda : sys.__stdout__.write(sys.stdout.getvalue()))\r\nfastio()\r\n\r\nMOD = 10**9 + 7\r\nI = lambda:list(map(int,input().split()))\r\n\r\nn, m = I()\r\np = [0]*200\r\nfor i in range(200):\r\n\tp[i] = i\r\n\r\ndef find(u):\r\n\tif p[u] == u:\r\n\t\treturn u\r\n\telse:\r\n\t\tp[u] = find(p[u])\r\n\treturn p[u]\r\n\r\ndef join(u, v):\r\n\tx = find(u)\r\n\ty = find(v)\r\n\tif x != y:\r\n\t\tp[x] = y\r\n\r\nst = set()\r\ncount = 0\r\nfor i in range(n):\r\n\tt = I()\r\n\tk, l = t[0], t[1:]\r\n\tif k == 0:\r\n\t\tcount += 1\r\n\tfor i in l:\r\n\t\tjoin(l[0], i)\r\n\t\tst.add(i)\r\n\r\nans = 0\r\n# print(p[1:m+1])\r\nv = [0]*200\r\ns = set()\r\nfor i in st:\r\n\ts.add(find(i))\r\nprint(max(0, len(s) - 1) + count)", "n,m=map(int,input().split())\r\nlan=[[] for _ in ' '*m]\r\nc=0\r\nfor i in range(n):\r\n x,*l,=map(int,input().split())\r\n if x==0:\r\n c+=1\r\n continue\r\n for j in l:\r\n lan[j-1].append(i)\r\nif c==n:\r\n print(c)\r\n exit(0)\r\nlans=[]\r\nfor i in range(m-1):\r\n if lan[i] == []:\r\n continue\r\n prev=i\r\n for j in range(i+1,m):\r\n if lan[j]==[]:\r\n continue\r\n if (set(lan[prev])&set(lan[j])):\r\n lan[j]=set(lan[prev])|set(lan[j])\r\n lan[prev]=[]\r\n prev=j\r\nlan=list(filter(None,lan))\r\nprint(len(lan)-1+c)", "# Define a lambda function I to parse integer input\r\nI = lambda: list(map(int, input().split()))\r\n\r\n# Read the number of employees and languages\r\nn, m = I()\r\n\r\nr = 0 # Counter for employees who know no languages\r\n\r\nt = [] # List of sets of languages known by employees\r\n\r\nfor _ in range(n):\r\n l = I()\r\n if l[0] == 0:\r\n r += 1 # Increment the counter for employees who know no languages\r\n else:\r\n t.append(set(l[1:])) # Add the set of known languages to the list\r\n\r\ni = 0\r\n\r\n# Iterate through the list of language sets\r\nwhile i < len(t):\r\n for j in t[i+1:]:\r\n if t[i] & j:\r\n t[i] |= j\r\n t.remove(j)\r\n break\r\n\r\n # If there is an intersection between sets, merge them\r\n else:\r\n i += 1\r\n\r\n# Calculate the minimum amount of money to pay\r\nprint(max(0, len(t) - 1) + r)\r\n", "def find(i):\r\n if dsu[i] == i:\r\n return i\r\n dsu[i] = find(dsu[i])\r\n return dsu[i]\r\n\r\n\r\nif __name__ == '__main__':\r\n dsu = [0]\r\n visited = set()\r\n iss = set()\r\n ans = 0\r\n N, M = map(int, input().split())\r\n for i in range(1, M + 1):\r\n dsu += [0]\r\n dsu[i] = i\r\n for i in range(N):\r\n parent = 0\r\n val = input().split()\r\n if int(val[0]) == 0:\r\n ans += 1\r\n for j in range(len(val)-1):\r\n if j == 0:\r\n iss.add(int(val[j+1]))\r\n parent = int(val[j+1])\r\n continue\r\n a = find(parent)\r\n b = find(int(val[j+1]))\r\n dsu[b] = a\r\n f = 0\r\n for i in range(1,M+1):\r\n if i not in iss:\r\n continue\r\n f = 1\r\n a = find(i)\r\n if a not in visited:\r\n ans += 1\r\n visited.add(a)\r\n\r\n print(ans-f)", "a = [[] for _ in range(205)]\nvis = [0 for _ in range(205)]\n\ndef dfs(v):\n vis[v] = 1\n for i in range(len(a[v])):\n if vis[a[v][i]] == 0:\n dfs(a[v][i])\n\nn, m = map(int, input().split())\nx = 0\nfor i in range(n):\n xx, *yy = map(int, input().split())\n x += xx\n for y in yy:\n a[i+1].append(y+n)\n a[y+n].append(i+1)\n\nif x == 0:\n print(n)\nelse:\n c = 0\n for i in range(1, n+m+1):\n if vis[i] == 0 and i <= n:\n c += 1\n dfs(i)\n print(c-1)\n", "v0 = 0\r\nl = []\r\nn, m = (int(x) for x in input().split())\r\nfor i in range(n):\r\n l2 = []\r\n curs = set([int(x) for x in input().split()][1:])\r\n if not curs:\r\n v0 += 1\r\n continue\r\n for s in l:\r\n if curs & s:\r\n curs |= s\r\n else:\r\n l2.append(s)\r\n l2.append(curs)\r\n l = l2\r\nprint(v0 + max(0, len(l) - 1))\r\n ", "from collections import defaultdict\r\nq = lambda : [int(x) for x in input().split()]\r\nn,m = q()\r\ngraph = defaultdict(list)\r\nallzeros = True\r\nvisited = set()\r\nfor i in range(1,n+1):\r\n for j,l in enumerate(q()):\r\n if l != 0:\r\n allzeros = False\r\n if j == 0:\r\n continue \r\n graph[i].append(n+l)\r\n graph[n+l].append(i)\r\n\r\ndef dfs(i): \r\n visited.add(i)\r\n for nei in graph[i]:\r\n if nei not in visited:\r\n dfs(nei)\r\n\r\nif allzeros:\r\n print(n)\r\n\r\nelse:\r\n cc = 0\r\n for i in range(1,n+1):\r\n if i not in visited:\r\n dfs(i)\r\n cc += 1\r\n print(cc-1)\r\n\r\n\r\n", "def getneighbors(node):\r\n listneighbors=[]\r\n for j in range (n):\r\n if any(r in lis[j] for r in lis[node]):\r\n if listneighbors.count(j)==0:\r\n listneighbors.append(j)\r\n return listneighbors\r\ndef dfs(node):\r\n visited[node]=True\r\n for j in getneighbors(node):\r\n if not visited[j]:\r\n dfs(j)\r\n\r\nn,m=map(int,input().split())\r\nlis=[]\r\nfor i in range(n):\r\n l=(list(map(int,input().split())))\r\n lis.append(l[1:])\r\nvisited=[False]*n\r\nans=0\r\nf=0\r\nfor j in range(n):\r\n if lis[j]==[]:\r\n ans+=1\r\n else:\r\n if visited[j]==False:\r\n f=1\r\n ans+=1\r\n dfs(j)\r\nif f==0:\r\n print(ans)\r\nelse :\r\n print(ans-1)\r\n\r\n", "parent = list(range(101))\nrnk = [0] * 101\nfreq = [0] * 101\n\ndef find(x):\n if x != parent[x]:\n parent[x] = find(parent[x])\n return parent[x]\n\ndef union(x, y):\n a = find(x)\n b = find(y)\n if a == b:\n return\n if rnk[a] < rnk[b]:\n parent[a] = b\n else:\n parent[b] = a\n if rnk[a] == rnk[b]:\n rnk[b] += 1\n\nif __name__ == '__main__':\n n, m = map(int, input().split())\n no_language = 0\n for i in range(m + 1):\n parent[i] = i\n for i in range(n):\n k, *elems = map(int, input().split())\n if k == 0:\n no_language += 1\n continue\n u = elems[0]\n freq[u] += 1\n for j in range(1, k):\n v = elems[j]\n freq[v] += 1\n union(u, v)\n ans = 0\n count = 0\n for i in range(1, m + 1):\n if freq[i] == 0:\n count += 1\n elif parent[i] == i:\n ans += 1\n ans -= 1\n if count == m:\n print(n)\n else:\n print(ans + no_language)\n", "n,m=list(map(int,input().split()));r,i=0,0;t=[]\r\nfor a in range(n):\r\n l=list(map(int,input().split()))\r\n if l[0]==0:r+=1\r\n else:t+=[set(l[1:])]\r\nwhile i<len(t):\r\n for j in t[i+1:]:\r\n if t[i]&j:t[i]|=j;t.remove(j);break\r\n else:i+=1\r\nprint(max(0,len(t)-1)+r)", "from collections import deque\r\n\r\nn, m = map(int, input().split())\r\n\r\nlanguageEmployees = [[] for _ in range(m)]\r\ngraph = [[] for _ in range(n)]\r\nvis = [False] * n\r\n\r\nemployeeWith0Language = 0\r\n\r\nfor i in range(n):\r\n langages = list(map(int, input().split()))[1:]\r\n nbLangages = len(langages)\r\n if nbLangages == 0:\r\n employeeWith0Language += 1\r\n \r\n\r\n for langage in langages:\r\n languageEmployees[langage-1].append(i)\r\n\r\nif employeeWith0Language == n:\r\n print(n)\r\n exit()\r\n\r\nfor i in range(m):\r\n nb = len(languageEmployees[i])\r\n for j in range(nb-1):\r\n graph[languageEmployees[i][j]].append(languageEmployees[i][j+1])\r\n graph[languageEmployees[i][j+1]].append(languageEmployees[i][j])\r\n\r\ndisconnectedGraphs = 0\r\n\r\nfor i in range(n):\r\n if not vis[i]:\r\n queue = deque([i])\r\n vis[i] = True\r\n\r\n while queue:\r\n node = queue.popleft()\r\n for child in graph[node]:\r\n if not vis[child]:\r\n queue.append(child)\r\n vis[child] = True\r\n\r\n disconnectedGraphs += 1\r\n\r\nprint(disconnectedGraphs-1)\r\n", "#DSU\r\nimport bisect,sys\r\nfrom collections import deque, namedtuple\r\nsys.setrecursionlimit(20000)\r\nN = 300\r\npar = [i for i in range(N)]\r\n\r\ndef find(i):\r\n if i == par[i]: return i\r\n par[i] = find(par[i])\r\n return par[i]\r\n\r\ndef merge(a,b):\r\n a = find(a)\r\n b = find(b)\r\n par[b] = a\r\n\r\ndef main():\r\n n,m = map(int,input().split())\r\n check,ans = 0,-1\r\n for _ in range(n):\r\n l = [int(i) for i in input().split()][1:]\r\n check = max(check,len(l))\r\n for i in l:\r\n merge(_,n+i)\r\n if not check:\r\n print(n)\r\n exit(0)\r\n for i in range(n):\r\n if i == par[i]:\r\n ans += 1\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "import sys\n\nONLINE_JUDGE = True\n\nif not ONLINE_JUDGE:\n sys.stdin = open(\"input.text\", \"r\")\n\n############ ---- Input Functions ---- ############\n\ndef inp(): # integer\n return(int(input()))\ndef inlt(): # lists\n return(list(map(int,input().split())))\ndef insr(): # list of characters\n s = input()\n return(list(s[:len(s) - 1]))\ndef invr(): # space seperate integers\n return(map(int,input().split()))\n\n############ ---- Solution ---- ############\n\nmx = 101\nparent = [0] * mx\nrnk = [0] * mx\nfreq = [0] * mx\n\ndef Find(x : int):\n if (x != parent[x]):\n parent[x] = Find(parent[x])\n return parent[x]\n\ndef Union(x : int , y : int):\n a = Find(x)\n b = Find(y)\n\n if (a == b): \n return\n\n if (rnk[a] < rnk[b]):\n parent[a] = b\n else:\n parent[b] = a\n if (rnk[a]==rnk[b]):\n rnk[b] += 1\n\nn, m = 0, 0\nno_language = 0\ncount = 0\n\nfor i in range(mx):\n parent[i] = i\n\nn, m = inlt()\n\nu, v, k = 0, 0, 0\nfor i in range(n):\n stuff = inlt()\n\n k = stuff[0]\n if (k == 0):\n no_language += 1\n continue\n\n u = stuff[1]\n freq[u] += 1\n for j in range(1, k):\n v = stuff[j + 1]\n freq[v] += 1\n Union(u, v)\n\nans = 0\nfor i in range(1, m + 1):\n if (freq[i]==0):\n count += 1\n elif (parent[i] == i):\n ans += 1\n\nans = ans-1\nif (count==m):\n print(n)\nelse:\n print(ans + no_language)\n\n\n\n", "class UF:\n def __init__(self, n):\n self.ids = [-1]*n\n self.n = n\n self.numSets = n\n\n def root(self, u):\n if self.ids[u] < 0: return u\n self.ids[u] = self.root(self.ids[u])\n return self.ids[u]\n\n def union(self, u, v):\n if self.ids[u] > self.ids[v]:\n u, v = v, u\n\n self.numSets -= 1\n self.ids[u] += self.ids[v]\n self.ids[v] = u\n\n def getSets(self):\n return self.numSets\n\n\nn, m = list(map(int, input().split()))\nlangs = [[] for _ in range(m)]\n\nhasLang = False\nfor i in range(n):\n data = list(map(int, input().split()))\n if data[0] > 0:\n hasLang = True\n else: continue\n for x in data[1:]:\n langs[x-1].append(i)\n\nif not hasLang:\n print(n)\n exit()\n \nuf = UF(n)\nfor _, lang in enumerate(langs):\n for i in range(1, len(lang)):\n u, v = lang[i-1], lang[i]\n\n u = uf.root(u)\n v = uf.root(v)\n if u != v:\n uf.union(u, v)\n\nprint(uf.getSets()-1)\n\n", "n, m = input().split(); n = int(n); m = int(m)\r\nke = [[] for i in range(m+n+10)]\r\ndanh_so = [False for i in range(m+n+10)]\r\nstatus = True\r\nfor i in range(1, n+1):\r\n tmp = list(map(int, input().split()))\r\n if tmp[:1] != [0]:\r\n status = False\r\n for j in tmp[1:]:\r\n ke[i] += [j+n]\r\n ke[j+n] += [i]\r\n#################################################################\r\ndef dfs(u, tplt):\r\n tplt = int(tplt)\r\n u = int(u)\r\n global danh_so\r\n danh_so[u] = True\r\n for i in ke[u]:\r\n if danh_so[i] == False:\r\n dfs(i, tplt)\r\n##############################################################################################\r\nif status == True:\r\n print(n)\r\nelse:\r\n tplt = 0\r\n for i in range(1, n+1):\r\n if danh_so[i] == False:\r\n dfs(i, tplt)\r\n tplt += 1\r\n print(tplt - 1)\r\n", "n,m=map(int,input().split())\r\ndef dfs(cur):\r\n vis[cur]=1\r\n for i in range(len(adj[cur])):\r\n if vis[adj[cur][i]]==0:\r\n dfs(adj[cur][i])\r\nadj=[[] for i in range(205)]\r\nvis=[0 for i in range(205)]\r\nx=0\r\nfor i in range(n):\r\n xx,*yy=map(int,input().split())\r\n x+=xx\r\n for y in yy:\r\n adj[i+1].append(y+n)\r\n adj[y+n].append(i+1)\r\nif x==0:\r\n print(n)\r\nelse:\r\n c=0\r\n for i in range(1,n+m+1):\r\n if vis[i]==0 and i<=n:\r\n c+=1\r\n dfs(i)\r\n print(c-1)", "def dfs(s):\r\n v[s] = 1\r\n for i in g[s]:\r\n if(v[i] == 0):\r\n dfs(i)\r\n\r\nn, m = map(int, input().split())\r\ng = []\r\nv = [0]*(m+1)\r\nfor i in range(m+1):\r\n g.append([])\r\nb = []\r\nans = 0\r\nfor i in range(n):\r\n a = list(map(int, input().split()))\r\n b.extend(a[1:])\r\n for j in range(a[0]-1):\r\n # print(a)\r\n g[a[j+1]].append(a[j+2])\r\n g[a[j+2]].append(a[j+1])\r\n if(a[0] == 0):\r\n ans += 1\r\nb = list(set(b))\r\n# print(*g)\r\nf = 0\r\nfor i in b:\r\n if(v[i] == 0):\r\n dfs(i)\r\n # print(i)\r\n f = 1\r\n ans += 1 \r\nif(f):\r\n ans -= 1\r\nprint(ans)\r\n# n = int(input())\r\n# dp = []\r\n# for i in range(3):\r\n# dp.append([0]*(n+1))\r\n# for i in range(n):\r\n# if(a[i] == 0):\r\n# dp[0][i+1] = dp[0][i] + 1\r\n# dp[1][i+1] = dp[1][i]\r\n# dp[2][i+1] = dp[2][i]\r\n# elif(a[i] == 1):\r\n# dp[0][i+1] = dp[0][i] \r\n# dp[1][i+1] = max(dp[0][i], dp[2][i]) + 1\r\n# dp[2][i+1] = dp[2][i]\r\n# elif(a[i] == 2):\r\n# dp[0][i+1] = dp[0][i] \r\n# dp[2][i+1] = max(dp[0][i], dp[1][i]) + 1\r\n# dp[1][i+1] = dp[1][i]\r\n# else:\r\n# dp[0][i+1] = dp[0][i] \r\n# dp[1][i+1] = max(dp[0][i], dp[2][i]) + 1\r\n# dp[2][i+1] = max(dp[0][i], dp[1][i]) + 1\r\n\r\n# # for i in range(3):\r\n# # print(*dp[i])\r\n\r\n# print(n - max(dp[0][n], dp[1][n], dp[2][n])) \r\n\r\n# n = int(input())\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 += abs(i+1 - a[i])\r\n# print(ans)", "visited = [0]*123777\r\nlis = [[0] for i in range(123777)]\r\ndef dfs(n):\r\n\tvisited[n]=1;\r\n\tfor i in lis[n]:\r\n\t\tif not visited[i]:\r\n\t\t\tdfs(i)\r\nx = input().split()\r\ny = [int(u) for u in x]\r\nbl = False\r\nfor i in range (1, y[0] + 1):\r\n\tz = input().split()\r\n\tw = [int(u) for u in z]\r\n\tfor j in w[1:]:\r\n\t\tif(j > 0): bl = True\r\n\t\tlis[i] += [j+1000]\r\n\t\tlis[j+1000] += [i]\r\nans = 0\r\nfor i in range (1, y[0] + 1):\r\n\tif not visited[i]:\r\n\t\tans += 1\r\n\t\tdfs(i)\r\nprint ((ans - 1) if bl else y[0])", "import math,sys,bisect,heapq\r\nfrom collections import defaultdict,Counter,deque\r\nfrom itertools import groupby,accumulate\r\n#sys.setrecursionlimit(200000000)\r\nint1 = lambda x: int(x) - 1\r\ninput = iter(sys.stdin.buffer.read().decode().splitlines()).__next__\r\nilele = lambda: map(int,input().split())\r\nalele = lambda: list(map(int, input().split()))\r\nilelec = lambda: map(int1,input().split())\r\nalelec = lambda: list(map(int1, input().split()))\r\ndef list2d(a, b, c): return [[c] * b for i in range(a)]\r\ndef list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]\r\n#MOD = 1000000000 + 7\r\ndef Y(c): print([\"NO\",\"YES\"][c])\r\ndef y(c): print([\"no\",\"yes\"][c])\r\ndef Yy(c): print([\"No\",\"Yes\"][c])\r\n \r\nn,m = ilele()\r\nG = defaultdict(list)\r\nans = 0\r\nfor i in range(n):\r\n A = alele()\r\n if A[0] == 0: ans+=1\r\n for j in A[1:]:\r\n G[j].append(i+1)\r\n#print(G)\r\nH = defaultdict(list)\r\nx = list(G.keys())\r\nfor i in range(len(x)):\r\n for j in range(i+1,len(x)):\r\n if len(G[x[i]]) + len(G[x[j]]) != len(set(G[x[i]] + G[x[j]])):\r\n a = x[i]\r\n b = x[j]\r\n H[a].append(b)\r\n H[b].append(a)\r\n#print(H)\r\nmark = {}\r\n\r\ndef dfs(node):\r\n mark[node] = True\r\n for j in H.get(node,[]):\r\n if mark.get(j,False) == False:\r\n dfs(j)\r\n\r\nff = 0\r\nfor i in x:\r\n if mark.get(i,0) == False:\r\n ff = 1\r\n ans+=1\r\n dfs(i)\r\n #print(mark)\r\nif ff: ans-=1\r\nprint(ans)\r\n\r\n\r\n ", "# https://codeforces.com/problemset/problem/277/A/\r\n\r\nn, m = map(int, input().split())\r\n\r\nparent = [i for i in range(n)]\r\nrank = [0 for i in range(n)]\r\n\r\ndef find(x):\r\n if x != parent[x]:\r\n parent[x] = find(parent[x])\r\n return parent[x]\r\n else:\r\n return x\r\n\r\ndef union(x, y):\r\n root_x = find(x)\r\n root_y = find(y)\r\n if root_x == root_y:\r\n return 0\r\n if rank[root_x] <= rank[root_y]:\r\n parent[root_x] = root_y\r\n if rank[root_x] == rank[root_y]:\r\n rank[root_y] += 1\r\n else:\r\n parent[root_x] = root_y\r\n return 1\r\n\r\nlanguages = [[] for i in range(m)]\r\nsubset_count = n\r\nknows_nothing = 0\r\nfor i in range(n):\r\n line = list(map(int, input().split()))\r\n k = line[0]\r\n if k > 0:\r\n for j in range(k):\r\n language = line[j + 1] - 1\r\n languages[language].append(i)\r\n else:\r\n knows_nothing += 1\r\n\r\nfor language in languages:\r\n if len(language) > 0:\r\n for i in range(len(language) - 1):\r\n subset_count -= union(language[i], language[i + 1])\r\n\r\nif knows_nothing == n:\r\n subset_count += 1\r\nprint(subset_count - 1)\r\n \r\n\r\n", "#!/usr/bin/env python3\nimport io\nimport os\nimport sys\n\ninput = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\n\ndef printd(*args, **kwargs):\n #print(*args, **kwargs, file=sys.stderr)\n print(*args, **kwargs)\n pass\n\ndef get_str():\n return input().decode().strip()\n\ndef rint():\n return map(int, input().split())\n\ndef oint():\n return int(input())\n\nn, m = rint()\n\ne = []\nfor i in range(n):\n tmp = list(rint())[1:]\n e.append(set(tmp))\nvalid = [1]*n\nfor i in range(n):\n if valid[i] == 0:\n continue\n for j in range(n):\n if valid[j] == 0 or i == j:\n continue\n if e[i] & e[j]:\n e[i] = e[i] | e[j]\n e[j] = set()\n valid[j] = 0\n\nall_zero = True\nfor i in range(n):\n if e[i]:\n all_zero = False\nif all_zero:\n print(n)\nelse:\n print(valid.count(1)-1)\n\n", "def dfs(i,v,vi,emp,lan,bn):\r\n\tif bn: \r\n\t\tvi[i]=1\r\n\t\tfor j in lan[i]: \r\n\t\t\tif not v[j]: dfs(j,v,vi,emp,lan,(bn+1)%2)\r\n\telse:\r\n\t\tv[i]=1\r\n\t\tfor j in emp[i]:\r\n\t\t\tif not vi[j]: dfs(j,v,vi,emp,lan,(bn+1)%2)\r\n\r\ndef main():\r\n\temp={}\r\n\tlan={}\r\n\tnum0=ans=0\r\n\tn,m=list(map(int,input().split()))\r\n\tfor i in range(1,m+1): lan[i]=set()\r\n\tfor i in range(1,n+1):\r\n\t\tk=list(map(int,input().split()))\r\n\t\temp[i]=set()\r\n\t\tfor j in range(1,k[0]+1): \r\n\t\t\temp[i].add(k[j])\r\n\t\t\tlan[k[j]].add(i)\r\n\t\tif not k[0]: num0+=1\r\n\r\n\tv=[0]*(n+1)\r\n\tvi=[0]*(m+1)\r\n\tfor i in range(1,n+1):\r\n\t\tif not v[i]:\r\n\t\t\tv[i]=1\r\n\t\t\tfor j in emp[i]:\r\n\t\t\t\tif not vi[j]: dfs(j,v,vi,emp,lan,1)\r\n\t\t\tans+=1\r\n\r\n\tif num0==n: print(num0)\r\n\telse: print(ans-1)\r\n\r\nif __name__=='__main__': main()", "arr = [int(i) for i in input().split()]\r\nn = arr[0]\r\nm = arr[1]\r\nlangs = [-1 for i in range(m)]\r\nemps = [i for i in range(n)]\r\n\r\ndef find(a, array):\r\n while (array[a] != a):\r\n temp = a\r\n a = array[a]\r\n array[temp] = a\r\n return a\r\n\r\ndef union(a, b, array):\r\n rootA = find(a, array)\r\n rootB = find(b, array)\r\n if (rootA == rootB):\r\n return True\r\n array[rootB] = array[rootA]\r\n return False\r\n\r\nfor j in range(n):\r\n arr = [int(a) for a in input().split()]\r\n numLangs = arr[0]\r\n for i in range(1, numLangs + 1):\r\n langIndex = arr[i]\r\n if (langs[langIndex-1] == -1):\r\n langs[langIndex-1] = j\r\n else:\r\n union(j, langs[langIndex-1], emps)\r\n \r\ncount = 0\r\nfor i in range(n):\r\n if(emps[i] == i):\r\n count += 1\r\nteach = 1\r\nfor lang in langs:\r\n if (lang > -1):\r\n teach = 0\r\n break\r\nprint(count - 1 + teach)", "def dfs(s):\n if visited[s]:return\n visited[s]=1\n for j in adj[s]:\n dfs(j)\nn,m=(map(int, input().split()))\nT=lambda:[[] for i in range(n+m)]\nadj=T()\nans=-1\ns=[]\nr=0\nfor i in range(n):\n l=(list(map(lambda x:int(x)+n-1, input().split())))\n adj[i]=l[1:]\n for j in adj[i]:\n adj[j]+=[i]\nvisited=[0]*(n+m)\nif adj==T():\n ans+=1\nfor i in range(n):\n if not visited[i]:\n dfs(i)\n ans+=1\nprint(ans)\n", "par = list(range(101))\nrnk = [0] * 101\nfreq = [0] * 101\n\ndef find_parent(x):\n if x != par[x]:\n par[x] = find_parent(par[x])\n return par[x]\n\ndef union(x, y):\n a = find_parent(x)\n b = find_parent(y)\n if a == b:\n return\n if rnk[a] < rnk[b]:\n par[a] = b\n else:\n par[b] = a\n if rnk[a] == rnk[b]:\n rnk[b] += 1\n\nif __name__ == '__main__':\n n, m = map(int, input().split())\n no_lang = 0\n for i in range(m + 1):\n par[i] = i\n for i in range(n):\n k, *elems = map(int, input().split())\n if k == 0:\n no_lang += 1\n continue\n u = elems[0]\n freq[u] += 1\n for j in range(1, k):\n v = elems[j]\n freq[v] += 1\n union(u, v)\n ans = 0\n cnt = 0\n for i in range(1, m + 1):\n if freq[i] == 0:\n cnt += 1\n elif par[i] == i:\n ans += 1\n ans -= 1\n if cnt == m:\n print(n)\n else:\n print(ans + no_lang)\n", "n, m = map(int, input().split(' '))\nparent = [x for x in range(m + 1)]\nrank = [0 for x in range(m + 1)]\n\n\ndef find(v):\n if v == parent[v]:\n return v\n parent[v] = find(parent[v])\n return parent[v]\n\n\ndef union(a, b):\n a = find(a)\n b = find(b)\n if a != b:\n if rank[a] < rank[b]:\n a, b = b, a\n parent[b] = a\n if rank[a] == rank[b]:\n rank[a] += 1\n\n\nnolang = 0\nunusedlang = 0\ncounts = [0 for x in range(m + 1)]\nfor i in range(n):\n line = input().split(' ')\n k = int(line[0])\n if k != 0:\n languages = [x for x in map(int, line[1:])]\n counts[languages[0]] += 1\n for j in range(1, k):\n counts[languages[j]] += 1\n union(languages[j - 1], languages[j])\n else:\n nolang += 1\n# calculate the answer\ncost = -1\nfor i in range(1, m + 1):\n if counts[i] == 0:\n unusedlang += 1\n elif parent[i] == i:\n cost += 1\n\nif unusedlang == m:\n print(n)\nelse:\n print(cost + nolang)\n", "def main():\r\n n, m = read_ints()\r\n languages_per_employee = []\r\n for _ in range(n):\r\n k, *languages = read_ints()\r\n languages_per_employee.append(set(languages))\r\n\r\n if all(len(languages) == 0 for languages in languages_per_employee):\r\n print(n)\r\n return\r\n\r\n dsu = DisjointSetUnion(n)\r\n for i in range(n):\r\n for j in range(i+1, n):\r\n if languages_per_employee[i] & languages_per_employee[j]:\r\n dsu.union(i, j)\r\n\r\n print(dsu.count_ccomps() - 1)\r\n\r\n\r\nclass DisjointSetUnion:\r\n def __init__(self, n):\r\n self.p = list(range(n))\r\n self.rank = [0] * n\r\n self._size = [1] * n\r\n\r\n def get(self, elm):\r\n rep = elm\r\n while self.p[rep] != rep:\r\n rep = self.p[rep]\r\n\r\n while self.p[elm] != rep:\r\n self.p[elm], elm = rep, self.p[elm]\r\n\r\n return rep\r\n\r\n def size(self, elm):\r\n rep = self.get(elm)\r\n return self._size[rep]\r\n\r\n def union(self, a, b):\r\n arep = self.get(a)\r\n brep = self.get(b)\r\n\r\n if arep != brep:\r\n if self.rank[arep] > self.rank[brep]:\r\n arep, brep = brep, arep\r\n\r\n if self.rank[arep] == self.rank[brep]:\r\n self.rank[brep] += 1\r\n\r\n self.p[arep] = brep\r\n self._size[brep] += self._size[arep]\r\n self._size[arep] = self.rank[arep] = 0\r\n\r\n def count_ccomps(self):\r\n return sum(1 for si in self._size if si > 0)\r\n\r\n\r\ndef input(): return next(test).strip()\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 import sys\r\n from os import environ as env\r\n if 'COMPUTERNAME' in env and 'L2A6HRI' in env['COMPUTERNAME']:\r\n sys.stdout = open('out.txt', 'w')\r\n sys.stdin = open('in.txt', 'r')\r\n\r\n test = iter(sys.stdin.readlines())\r\n\r\n main()\r\n", "# Description of the problem can be found at http://codeforces.com/problemset/problem/277/A\r\n\r\nn, m = tuple(map(int, input().split()))\r\nlst = [[]]\r\nfor _ in range(n):\r\n lst.append(list(map(int, input().split()))[1:])\r\nuses = [0] * (n + 1)\r\ncnt = cnt_n = 0\r\n\r\ndef dfs(i, m):\r\n uses[i] = m\r\n for x in lst[i]:\r\n for j in range(1, n + 1):\r\n if uses[j] == 0 and x in lst[j]:\r\n dfs(j, m)\r\n\r\nif lst == [[]] * (n + 1):\r\n print(n)\r\nelse:\r\n for i in range(1, n + 1):\r\n if uses[i] == 0:\r\n cnt += 1\r\n dfs(i, cnt)\r\n print(cnt - 1)", "n,m=map(int,input().split())\r\na,z=[],0\r\nfor i in range(n):\r\n b=list(map(int,input().split()))\r\n if b[0]==0:\r\n z+=1\r\n else:\r\n a+=[set(b[1:])]\r\ni=0\r\nwhile i<len(a):\r\n\tfor c in a[i+1:]:\r\n\t\tif a[i] & c:\r\n a[i] |= c;\r\n a.remove(c);\r\n break\r\n\telse:\r\n i+=1\r\nprint(max(0,len(a)-1)+z)\r\n", "class DisjointSet:\r\n def __init__(self, np):\r\n self.parents = [-1 for _ in range(np + 1)]\r\n\r\n def find(self, node):\r\n if self.parents[node] < 0:\r\n return node\r\n self.parents[node] = self.find(self.parents[node])\r\n return self.parents[node]\r\n\r\n def union(self, node1, node2):\r\n parent1, parent2 = self.find(node1), self.find(node2)\r\n\r\n if self.parents[parent1] > self.parents[parent2]:\r\n parent1, parent2 = parent2, parent1\r\n\r\n if parent1 != parent2:\r\n self.parents[parent1] += self.parents[parent2]\r\n self.parents[parent2] = parent1\r\n\r\n def addZero(self, node):\r\n self.parents[node] = 0\r\n\r\n def solve(self):\r\n grps = 0\r\n zeros = 0\r\n for par in self.parents[1:]:\r\n if par == 0:\r\n zeros += 1\r\n if par < 0:\r\n grps += 1\r\n\r\n if grps:\r\n grps -= 1\r\n print(grps + zeros)\r\n\r\n\r\nemp, l = [int(n) for n in input().split()]\r\ndj = DisjointSet(emp)\r\nlan = {i + 1: set() for i in range(l)}\r\n\r\nfor e in range(1, emp + 1):\r\n n, *spk = [int(n) for n in input().split()]\r\n if n == 0:\r\n dj.addZero(e)\r\n continue\r\n for i in spk:\r\n lan[i].add(e)\r\n for i in spk:\r\n for j in lan[i]:\r\n dj.union(e, j)\r\n\r\ndj.solve()\r\n", "def main():\n n, m = map(int, input().split())\n f = list(range(n))\n lang = [set(map(int, input().split()[1:])) for _ in range(n)]\n for i, langi in enumerate(lang):\n for j, langj in enumerate(lang[:i]):\n if f[j] == j and langj.intersection(langi):\n f[j] = i\n langi.update(langj)\n print(sum(i == x for i, x in enumerate(f)) - any(lang))\n\n\nif __name__ == '__main__':\n main()\n", "def root(a):\n if (a == parent[a]):\n return a\n\n parent[a] = root(parent[a])\n return parent[a]\n\ndef connect(a, b):\n root_a = root(a)\n root_b = root(b)\n\n if (root_a != root_b):\n parent[root_b] = root_a\n\ndef connectedComponents(n):\n # print(\"n\", n)\n s = set()\n\n # print(\"s\", s)\n # print(\"-----------------\")\n\n for i in range(n):\n # print(\"i\", i)\n # print(\"root(parent[i])\", root(parent[i]))\n s.add(root(parent[i]))\n # print(\"-----------------\")\n\n return(len(s))\n\ndef printAnswer(N, edges):\n for i in range(N + 1): \n parent[i] = i\n\n for i in range(len(edges)):\n connect(edges[i][0], edges[i][1])\n\n return(connectedComponents(N))\n\nn, m = input().split(\" \")\n\nedges = []\nall_langs = dict()\nlang_idx = 0\n\nfor i in range(0, int(n)):\n langs = input().split(\" \")[1:]\n\n for j in langs:\n if j in all_langs:\n edges.append([i, all_langs[j] + int(n)])\n # print(\"j in all langs. j = \", j, \", all_langs[j] = \", all_langs[j])\n else:\n all_langs[j] = lang_idx\n edges.append([i,lang_idx + int(n)])\n # print(\"j not in all langs. j = \", j, \", lang_idx = \", lang_idx)\n lang_idx += 1\n\n# print(edges)\n\nN = int(n) + len(all_langs)\n# print(N)\nparent = [0]*(N + 1)\n# print(parent)\n\nif len(all_langs) == 0:\n print(n)\nelse:\n print(printAnswer(N, edges) - 1)", "def dfs(root,visited,graph):\r\n\tvisited[root]=True\r\n\tfor nb in graph[root]:\r\n\t\tif not visited[nb]:\r\n\t\t\tdfs(nb,visited,graph)\r\n\r\nn,m=map(int,input().split())\r\ndic={}\r\ncheck0=0\r\nfor i in range(n):\r\n\tl=[int(j) for j in input().split()]\r\n\tif l[0]==0:\r\n\t\tcheck0+=1\r\n\tdic[i+1]=set(l[1::])\r\nif check0==n:\r\n\tprint(n)\r\nelse:\r\n\tgraph=[[] for i in range(n+1)]\r\n\tfor i in range(1,n+1):\r\n\t\tl1=set()\r\n\t\tfor lang in dic[i]:\r\n\t\t\tfor j in range(1,n+1):\r\n\t\t\t\tif i!=j and lang in dic[j]:\r\n\t\t\t\t\tl1.add(j)\r\n\t\tgraph[i]=list(l1)\r\n\telse:\r\n\t\tvisited=[False for i in range(n+1)]\r\n\t\tcnt=0\r\n\t\tfor i in range(1,n+1):\r\n\t\t\tif not visited[i]:\r\n\t\t\t\tcnt+=1\r\n\t\t\t\tdfs(i,visited,graph)\r\n\t\tprint(cnt-1)", "I=lambda:list(map(int,input().split()))\r\n\r\nn,m=I()\r\nr=0\r\nt=[]\r\n\r\nfor _ in range(n):\r\n\tl=I();\r\n\tif l[0]==0:r+=1\r\n\telse:t+=[set(l[1:])]\r\ni=0\r\n\r\nwhile i<len(t):\r\n\tfor j in t[i+1:]:\r\n\r\n\t\tif t[i]&j:\r\n\t\t\tt[i]|=j\r\n\t\t\tt.remove(j)\r\n\t\t\tbreak\r\n\telse:\r\n\t\ti+=1\r\n\r\nprint(max(0,len(t)-1)+r)", "def dfs(f, x, v):\r\n v.append(f)\r\n for ind, ver in a:\r\n if ind not in v and any(i in ver for i in x):\r\n dfs(ind, ver, v)\r\n return v\r\n\r\n\r\nn, m = map(int, input().split())\r\n\r\na = []\r\n\r\nans = 0\r\nfor i in range(n):\r\n s = tuple(map(int, input().split()[1:]))\r\n if not s:\r\n ans += 1\r\n continue\r\n a.append((i, s))\r\n\r\nif a:\r\n ans -= 1\r\n\r\nwhile a:\r\n ans += 1\r\n c = dfs(a[0][0], a[0][1], [])\r\n a = [(i, l) for i, l in a if i not in c]\r\n\r\nprint(ans)\r\n\r\n", "n,m = [int(x) for x in input().strip().split()]\r\narr = []\r\ncount = 0\r\nfor i in range(0,n):\r\n\ta = [int(x) for x in input().strip().split()]\r\n\tif a[0]==0:\r\n\t\tcount+=1\r\n\tarr.append(a[1:])\r\nd = {i:[] for i in range(0,n)}\r\nfor i in range(0,n-1):\r\n\tfor j in range(i+1,n):\r\n\t\tif set(arr[i]).intersection(set(arr[j])):\r\n\t\t\td[i].append(j);d[j].append(i)\r\ncost = -1\r\ndef dfs(v,G,visited):\r\n\tif visited[v]:\r\n\t\treturn 0\r\n\ts = [v]\r\n\twhile s:\r\n\t\ta = s.pop()\r\n\t\tfor i in G[a]:\r\n\t\t\tif not visited[i]:\r\n\t\t\t\ts.append(i)\r\n\t\tvisited[a] = True\r\n\treturn 1\r\n\r\nvisited = [False]*n\r\nfor i in range(0,n):\r\n\tcost+= dfs(i,d,visited)\r\nif count==n:\r\n\tprint(count)\r\nelse:\r\n\tprint(cost)", "def main():\n def root(a):\n b = f[a]\n while b != a:\n a, b = b, f[b]\n return a\n\n n, m = map(int, input().split())\n f = list(range(n))\n lang = []\n for _ in range(n):\n lang.append(set(list(map(int, input().split()[1:]))))\n for i in range(n):\n for j in range(i):\n if j == root(j) and lang[j].intersection(lang[i]):\n f[j] = i\n lang[i].update(lang[j])\n print(sum(i == root(i) for i in range(n)) - any(lang))\n\n\nif __name__ == '__main__':\n main()\n" ]

[ "# https://codeforces.com/problemset/problem/820/A\n# 900\n\nc,v0,v1,a,l = map(int, input().split())\n\nd = 0\np = 0\nwhile True:\n p += v0\n d += 1\n if p >= c:\n break\n\n v0 += a\n if v0 > v1:\n v0 = v1\n\n p -= l\n\nprint(d)", "c, v0, v1, a, l = map(int, input().split())\r\n\r\nif (c <= v0):\r\n\tprint(1)\r\nelse:\r\n\tmp = v0\r\n\tcur = v0\r\n\tcnt = 1\r\n\twhile (mp < c):\r\n\t\tcur = min(cur + a, v1)\r\n\t\tmp += cur - l\r\n\t\tcnt += 1\r\n\tprint(cnt)", "total_pages_nr, min_pages_per_day, max_pages_per_day, delta, reread_pages_nr = (int(x) for x in input().split())\r\ndays_nr = 0\r\npages_read_nr = 0\r\ncurr_speed = min_pages_per_day\r\nflag = False\r\nwhile pages_read_nr < total_pages_nr:\r\n if flag:\r\n pages_read_nr -= reread_pages_nr\r\n flag = True\r\n pages_read_nr = max(curr_speed, pages_read_nr + curr_speed)\r\n curr_speed += delta\r\n if curr_speed > max_pages_per_day:\r\n curr_speed = max_pages_per_day\r\n days_nr += 1\r\n \r\nprint(days_nr)", "c, v0, v1, a, l = map(int, input().split())\r\nans = 0\r\nnow = 0\r\nwhile now < c:\r\n if now > 0:\r\n now -= l\r\n now += v0\r\n v0 = min(v0 + a, v1)\r\n ans += 1\r\nprint(ans)", "c,v0,v1,a,l=map(int,input().split())\r\ni=0\r\nwhile c>0:\r\n if i==0:\r\n c=c-v0\r\n else:\r\n if v0+a*i<v1:\r\n c=c+l-v0-a*i\r\n else:\r\n c=c+l-v1\r\n i+=1\r\n\r\n\r\nprint(i)", "c,v0,v1,a,l=map(int,input().split())\r\nn=0\r\ni=0\r\nwhile c>0:\r\n\tc-=v0\r\n\tv0+=a\r\n\tif v0>v1:\r\n\t\tv0=v1\r\n\tc+=i\r\n\tn+=1\r\n\ti=l\r\n\t# print(i)\r\nprint(n)", "#http://codeforces.com/problemset/problem/820/A\nc,v0,v1,a,l = map(int, input().split())\ncounter = 0\nwhile (c>0):\n\tc -= v0\n\tv0 += a\n\tif (v0>v1):\n\t\tv0 = v1\n\tcounter += 1\n\tif(counter>=1 and c > 0):\n\t\tc += l\nprint(counter)", "c, v0, v1, a, l = map(int, input().split())\n\ndays = 0\nread = 0\n\nwhile True:\n read += v0\n days += 1\n if read < c:\n read -= l\n v0 = min(v1, v0 + a)\n else:\n break\n\nprint(days)", "c, v, vmax, a, l = map(int,input().split())\r\n\r\ncurDay = 0\r\ncurPage = 0\r\nlPage = -1\r\nwhile curPage < c:\r\n pageread = min(vmax, v + a * curDay)\r\n if lPage == -1:\r\n lPage = 1\r\n else:\r\n pageread -= l\r\n curPage += pageread\r\n curDay += 1\r\n\r\nprint(curDay) ", "import math\nc, v0,v1,a,l = map(int, input().split())\nn = 0\nans = 0\nwhile n < c:\n ans+=1\n if n>0:\n n-=l\n n+=v0\n if v0 < v1:\n v0 = min(v0+a, v1)\nprint(ans)\n\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nc, v0, v1, a, l = map(int, input().split())\r\ntot = 0\r\n\r\nnow = 0\r\nwhile True:\r\n now += 1\r\n tot += min(v1, v0)\r\n v0 += a\r\n if tot >= c:\r\n break\r\n tot -= l\r\n\r\nprint(now)", "import sys\r\nc,v0,v1,a,l=map(int,input().split())\r\nif c<=v0:\r\n print(1)\r\n sys.exit()\r\n\r\ndays=1\r\npages=v0\r\nwhile c>pages:\r\n if v0+days*a<v1:\r\n x=v0+days*a\r\n else:\r\n x=v1\r\n\r\n pages+=x-l\r\n days+=1\r\n\r\nprint(days)\r\n\r\n", "\r\nc, v0, v1, a, l = map(int, input().split())\r\n\r\npages_read = v0\r\nif v0 >= c:\r\n print(1)\r\n exit()\r\nfor d in range(2, 10000):\r\n v0 = min(v0 + a, v1)\r\n pages_read += (v0 - l)\r\n if pages_read >= c:\r\n print(d)\r\n break\r\n\r\n", "c,v0,v1,a,l=map(int,input().split())\r\ncc=0\r\nans=0\r\nwhile cc<c:\r\n if ans==0:\r\n ans+=1\r\n cc+=v0\r\n v0+=a\r\n v0=min(v1,v0)\r\n else:\r\n ans+=1\r\n cc+=v0\r\n v0+=a\r\n v0=min(v1,v0)\r\n cc-=l\r\nprint(ans)", "#!/usr/bin/env python3\nimport sys\n\ndef main():\n c, v0, v1, a, l = map(int, sys.stdin.readline().split())\n day = 0\n v = v0\n read = 0\n while read < c:\n day += 1\n read = max(read - l, 0) + v\n v = min(v + a, v1)\n print(day)\n\n\nif __name__ == '__main__':\n main()\n", "c, v0, v1, a, l = [int(x) for x in input().split(' ')]\r\npages = 0\r\ni = 0\r\nwhile True:\r\n pages += min(v0 + i * a, v1)\r\n i += 1\r\n if pages >= c:\r\n ans = i\r\n break\r\n pages -= l\r\nprint(ans)\r\n", "d,a,b,c,l=map(int,input().split())\r\nr=0\r\nwhile (r>0)*l+d>a:d-=a-(r>0)*l;a=min(a+c,b);r+=1\r\nprint(r+1)", "c, v1, v2, a, l = map(int, input().split())\r\nd = 0\r\ni = 1\r\nd += v1\r\nwhile d < c:\r\n\tv1 += a\r\n\ti += 1\r\n\tif(v1 >= v2):\r\n\t\tv1 = v2\r\n\td = d + v1\r\n\t#print(d)\r\n\td -= l\r\nprint(i)", "line = input()\nnrs = list(map(int, line.split(' ')))\nc = nrs[0]\nv0 = nrs[1]\nv1 = nrs[2]\na = nrs[3]\nl = nrs[4]\npages_read = v0\ndays = 1\npages = v0\nwhile pages_read < nrs[0]:\n pages += a\n if pages > v1:\n pages = v1\n pages_read -= l\n pages_read += pages\n days += 1\n\nprint(days)\n", "c,v0,v1,a,l = map(int, input().split())\r\n\r\nnowRead = 0\r\nday = 0\r\n\r\nwhile nowRead<c:\r\n day += 1\r\n nowRead += min(v0 + a*(day-1), v1)\r\n if nowRead >= c:\r\n break\r\n nowRead -= l\r\n\r\nprint(day)", "#!/usr/bin/env python3\n\ndef solve():\n c, v0, v1, a, l = get([int])\n page = 0\n days = 0\n while page < c:\n page += v0 - (0 if page == 0 else l)\n v0 += a\n if v0 > v1:\n v0 = v1\n days += 1\n\n return days\n\n\n\n\n\n\n\n\n\n\n_testcases = \"\"\"\n5 5 10 5 4\n\n1\n\n12 4 12 4 1\n\n3\n\n15 1 100 0 0\n\n15\n\n\"\"\".strip()\n\n# ======================= B O I L E R P L A T E ======================= #\n# Practicality beats purity\n\nimport re\nimport sys\nimport math\nimport heapq\nfrom heapq import heapify, heappop, heappush\nimport bisect\nimport string\nfrom bisect import bisect_left, bisect_right\nimport operator\nfrom operator import itemgetter, attrgetter\nimport itertools\nimport collections\n\ninf = float('inf')\nsys.setrecursionlimit(10000)\n\n\ndef tree():\n return collections.defaultdict(tree)\n\n\ndef cache(func): # Decorator for memoizing a function\n cache_dict = {}\n\n def _cached_func(*args, _get_cache=False):\n if _get_cache:\n return cache_dict\n if args in cache_dict:\n return cache_dict[args]\n cache_dict[args] = func(*args)\n return cache_dict[args]\n return _cached_func\n\n\ndef equal(x, y, epsilon=1e-6):\n # https://code.google.com/codejam/kickstart/resources/faq#real-number-behavior\n if -epsilon <= x - y <= epsilon:\n return True\n if -epsilon <= x <= epsilon or -epsilon <= y <= epsilon:\n return False\n return (-epsilon <= (x - y) / x <= epsilon or -epsilon <= (x - y) / y <= epsilon)\n\n\ndef get(_type): # For easy input\n if type(_type) == list:\n if len(_type) == 1:\n _type = _type[0]\n return list(map(_type, input().strip().split()))\n else:\n return [_type[i](inp) for i, inp in enumerate(input().strip().split())]\n else:\n return _type(input().strip())\n\nif __name__ == '__main__':\n print(solve())", "c,vv,v,a,l = map(int,input().split())\r\n\r\nv = v-l\r\nread = vv\r\nrate = vv+a-l\r\ndays = 1\r\nwhile read<c:\r\n if rate<v:\r\n read+=rate\r\n rate+=a\r\n days+=1\r\n else:\r\n read+=v\r\n days+=1\r\nprint(days)", "c,v0,v1,a,l=list(map(int,input().split()))\r\nrem=c\r\ndays=0\r\nspeed=v0\r\nwhile rem!=0:\r\n if rem<=speed:\r\n rem=0\r\n days+=1\r\n else:\r\n rem-=speed\r\n days+=1\r\n rem+=l\r\n speed+=a\r\n if speed>=v1:\r\n speed=v1\r\nprint(days)\r\n", "c, v0, v1, a, l = [int(x) for x in input().split()]\r\n\r\ncurrPage = v0\r\nday = 1\r\n\r\nx = v0\r\n\r\nwhile(currPage < c):\r\n x = min(v1, x+a)\r\n \r\n currPage += x - l\r\n day += 1\r\n \r\nprint(day)\r\n", "def solve(inp):\n c, v0, v1, a, l = map(int, inp.split(\" \", 4))\n pages_read = 0\n days_passed = 0\n while pages_read < c:\n pages_read += v0 - min(l, pages_read)\n days_passed += 1\n v0 = min(v0 + a, v1)\n return days_passed\n\n\nif __name__ == \"__main__\":\n print(solve(input()))\n", "c, v0, v1, a, l = map(int, input().split())\r\nfor v in range(1, 1001):\r\n c -= v0 if v == 1 else v0 - l\r\n if c <= 0:\r\n print(v)\r\n break\r\n v0 = min(v0 + a, v1)\r\n v += 1", "#CF 820A\nlst = input().split()\n#debug\nfor i in range(len(lst)):\n lst[i] = int(lst[i])\nc = lst[0]\nv0 = lst[1]\nv1 = lst[2]\na = lst[3]\nl = lst[4]\n\npos = 0\nbuf = v0\nans = 0\nwhile pos < c:\n if pos != 0:\n pos -= l\n pos += buf\n ans += 1\n \n buf += a\n if (buf > v1):\n buf = v1\n \nprint(ans)", "l = list(map(int, input().split()))\r\ndays = 0\r\ntotal = l[0]\r\ncurrent_speed = l[1]\r\nwhile total > 0:\r\n current_speed = l[1] + days * l[3]\r\n if current_speed > l[2]:\r\n current_speed = l[2]\r\n total -= current_speed\r\n days += 1\r\n if total <= 0:\r\n break\r\n else:\r\n total += l[4]\r\nprint(days)", "# http://codeforces.com/problemset/problem/820/A\n\n\"\"\"\nget inputs and assign to variables\n\"\"\"\ninputs = [int(x) for x in input().split(' ')]\n\nbook_pages = inputs[0]\ninit_speed = inputs[1]\nmaxi_speed = inputs[2]\naccelerate = inputs[3]\nre_reading = inputs[4]\n\ndays = 0\npages_read = 0\n\n# might not need this override section after you adjusted \"while\" statement\noverride = False\n\nif book_pages / init_speed <= 1:\n override = True\n\nwhile pages_read < book_pages:\n # if pages_read == 0 then you aren't re-reading anything\n if pages_read == 0:\n pages_read += init_speed\n else:\n pages_read += init_speed - re_reading\n # init speed can't be greater than max speed\n init_speed = min(init_speed + accelerate, maxi_speed)\n days += 1\n\n# might not need this override section after fixing 'while'\nif override:\n print(1)\nelse:\n print(days)\n", "c, v0, v1, a, l = map(int, input().split())\r\n\r\ndays = 0\r\nt = c\r\nwhile t:\r\n days += 1\r\n t = min(t + l, c)\r\n t -= min(t, v0)\r\n v0 = min(v1, v0 + a)\r\nprint(days)\r\n", "c, v0, v1, a, L = map(int, input().split())\r\np, d = v0, 1\r\nwhile p < c:\r\n p += min(v1, v0 + a*d) - L\r\n d += 1\r\nprint(d)", "from sys import exit\r\nc, v0, v1, a, l = [int(i) for i in input().split()]\r\nif v0 >= c:\r\n print(1)\r\n exit(0)\r\nelse:\r\n d = 1\r\n cnt = c - v0\r\n ca = 0\r\n while cnt > 0:\r\n ca += a\r\n cr = v0 + ca\r\n if cr > v1:\r\n cr = v1\r\n cnt -= (cr - l)\r\n d += 1\r\n print(d\r\n )\r\n \r\n", "d = 0\r\nc, v0, v1, a, l = map(int, input().split())\r\nnow = 0\r\nwhile now < c:\r\n now += v0\r\n if d > 0:\r\n now -= l\r\n if v0+a > v1:\r\n v0 = v1\r\n else:\r\n v0 += a\r\n d += 1\r\nprint(d)", "c,v0,v1,a,l=map(int, input(\"\").split())\r\np=v0\r\nadd=v0\r\ncount=1\r\nwhile(p<c):\r\n add=min(v1,add+a)\r\n p+=add-l\r\n count+=1\r\nprint(count)", "def process():\r\n c, v0, v1, a, l = map(int, input().split())\r\n page = v0\r\n day = 1\r\n while page < c:\r\n p = min(v1, v0+a*day)\r\n page+=p\r\n day += 1\r\n page -= l\r\n if page >= c:\r\n break\r\n print(day)\r\nif __name__ == '__main__':\r\n process()\r\n", "c, v0, v1, a, l = map(int, input().split())\r\nk, ans = 0, 0\r\nwhile True:\r\n \r\n k+=v0\r\n ans+=1\r\n v0+=a\r\n if k>=c: break\r\n k-=l\r\n if v0>v1:v0=v1\r\nprint(ans)\r\n", "inp = input().split()\nc = int(inp[0])\nv0 = int(inp[1])\nv1 = int(inp[2])\na = int(inp[3])\nl = int(inp[4])\n\ntotal = c\nval = v0\nday = 0\nwhile True:\n if val > v1:\n val = v1\n total -= val\n if day != 0:\n total += l\n if total <= 0:\n break\n val += a\n day += 1\nprint(day+1)\n", "c, v0, v1, a, l = map(int, input().split())\ndays, pages = 0, 0\nwhile pages < c:\n days += 1\n if days == 1:\n pages = v0\n else:\n read = min(v1, v0 + ( days - 1 ) * a)\n pages += read - l\nprint(days)\n", "c, v0, v1, a, l = map(int, input().split())\r\nvt, dem = 0, 0\r\nwhile vt < c: \r\n vt, v0, dem = vt + v0, min(v1, v0 + a), dem + 1\r\n if dem > 1: vt -= l\r\nprint(dem)", "#!/usr/bin/python3\n\ndef read_ints():\n\treturn [int(i) for i in input().split()]\n\nc, v0, v1, a, l = read_ints()\ns = 0\nd = 1\n\nwhile s < c:\n\ts = min(s + v0, c)\n\tif s == c:\n\t\tbreak\n\tv0 = min(v0 + a, v1)\n\ts -= l\n\td += 1\n\nprint(d)", "c, v0, v1, a, l = map(int, input().split())\n\nans = 0\nwhile c > 0:\n\tif ans: c += l\n\tc -= min(v0, v1)\n\tv0 += a\n\tans += 1\nprint(ans)", "a,b,c,d,e=map(int,input().split())\r\na=a-b\r\nk=1\r\nr=1\r\nwhile a>0 :\r\n k=k+1\r\n a=a-min(b+(d*r),c)+e\r\n r=r+1\r\nprint(k)\r\n", "\r\n\r\nc, v0, v1, a, l = map(int, input().split())\r\n\r\ncur = 0\r\nd = 0\r\nwhile cur < c:\r\n if d > 0:\r\n cur -= l\r\n cur = max(cur, 0)\r\n\r\n d += 1\r\n cur += min(v0, v1)\r\n v0 += a\r\n\r\nprint(d)", "kstr, v0, v1, a, l = map(int,input().split())\r\n\r\n\r\ntektime = 1\r\ntekstr = v0\r\ntekv = v0 + a\r\nif tekv>v1:\r\n tekv = v1\r\nwhile tekstr < kstr:\r\n tekstr = tekstr - l + tekv\r\n tekv += a\r\n if tekv > v1:\r\n tekv = v1\r\n tektime+=1\r\nprint(tektime)", "c, v0, v1, a, l = map(int, input().split())\ncnt, i = v0, 0\nwhile c > 0:\n c += l if i else 0\n c -= cnt\n cnt += a\n cnt = v1 if v1 < cnt else cnt\n i += 1\nprint(i)\n\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nc, v0, v1, a, l = map(int, input().split())\r\nd = 0\r\nwhile c > 0:\r\n if d > 0:\r\n c += l\r\n d += 1\r\n c -= v0\r\n v0 = (v1 if (v0 + a) >= v1 else v0 + a)\r\nprint(d)", "I = lambda : map(int, input().split())\nc, v0, v1, a, l = I()\nrd = 0\nday = 0\nwhile (rd < c):\n canread = min(v0 + day*a, v1)\n start = max(rd-l, 0)\n rd = start + canread\n day += 1\n\nprint(day)\n", "\r\n#k=int(input())\r\n#n,m=map(int,input().split())\r\n\r\n#a=list(map(int,input().split()))\r\n\r\n#b=list(map(int,input().split()))\r\n\r\nc,v0,v1,a,l=map(int,input().split())\r\n\r\ncur=0\r\ncnt=0\r\ncntp=0\r\n\r\nwhile(True):\r\n cnt+=1\r\n cntp=v0\r\n if cnt>1:\r\n cntp-=l\r\n\r\n v0=min(v1,v0+a)\r\n cur+=cntp\r\n\r\n if(cur>=c):\r\n print(cnt)\r\n quit()\r\n\r\n", "'''\r\nimport sys \r\nimport math as mt\r\nimport re\r\nsys.stdin = open('input.in', 'r') \r\nsys.stdout = open('output.out', 'w')\r\n'''\r\n\r\nc, v0, v1, a, l = map(int,input().split())\r\ns = v0\r\nf = 1\r\ni = 1\r\nc -= v0\r\nwhile(c>0):\r\n\ts = v0+a*i\r\n\tif(s>v1):\r\n\t\ts = v1\r\n\tc += l\r\n\tc -= s\r\n\tf += 1\r\n\tif(c<=0):\r\n\t\tbreak\r\n\ti += 1\r\nprint(f)\r\n\r\n\r\n", "c, v0, v1, a, l=map(int, input().split())\r\ncur=v0\r\nday=1\r\nwhile cur<c:\r\n cur-=l\r\n cur+=min(v0+a*day, v1)\r\n day+=1\r\nprint(day)", "c, v0, v1, a, l = map(int, input().split())\r\nresult = number = 0\r\nwhile number<c:\r\n\tnumber+=v0\r\n\tv0+=a\r\n\tif v0>=v1:\r\n\t\tv0=v1\r\n\tif number<c:\r\n\t\tnumber-=l\r\n\tresult+=1\r\nprint(result)", "c, vo, v1, a, l = map(int, input().split())\r\ndays = 1\r\nread = 0\r\nhave = 0\r\nhave = read = vo\r\nwhile have < c:\r\n read = min(v1, read + a)\r\n have += read - l\r\n days += 1\r\nprint(days)\r\n", "c, v0, v1, a, l = map(int, input().split())\r\ncnt = 0\r\nwhile c > 0:\r\n if cnt == 0:\r\n if v0 < v1:\r\n c -= v0\r\n else:\r\n c -= v1\r\n cnt += 1\r\n continue\r\n c += l\r\n toread = v0 + (cnt * a)\r\n if toread < v1:\r\n c -= toread\r\n else:\r\n c-= v1\r\n cnt += 1\r\nprint(cnt)", "c,vi,vf,a,l=map(int,input().split())\ncount=1\nstatus=vi\nif vi+a>vf:\n speed=vf\nelse:\n speed=vi+a\n# print(status)\n# print(speed)\nwhile status<c:\n status += speed - l \n # print(status)\n\n if speed+a<vf:\n speed += a\n else:\n speed=vf\n count += 1\n \n # print(speed)\nprint(count)\n\n\n", "#5 5 10 5 4 | c v0 v1 a l\r\nc,v0,v1,a,l=map(int,input().split())\r\ncur=0\r\nv=v0\r\nans=0\r\n\r\nwhile cur < c:\r\n if cur > 0:\r\n cur -= l\r\n cur += v\r\n v = min(v1, v+a)\r\n ans+=1\r\nprint(ans)", "c,v0,v1,a,l=map(int,input().split())\r\nk=0\r\ncnt=1\r\nan=v0\r\nwhile(an<c):\r\n v0=min(v0+a,v1)\r\n an+=v0-l\r\n cnt+=1\r\n \r\nprint(cnt)\r\n ", "c,x,y,a,l=map(int,input().split())\r\ns=x\r\nd=x\r\ni=1\r\nwhile(s<c):\r\n d=min(d+a,y)\r\n s+=d-l\r\n i+=1\r\nprint(i)\r\n", "c,v0,v1,a,l = map(int,input().split())\ncnt = 0\nans = 0\nv = v0\nwhile(cnt < c):\n\tcnt += v\n\tif(ans != 0):\n\t\tcnt -= l\n\tif(v + a < v1):\n\t\tv += a\n\telse:\n\t\tv = v1\n\tans += 1\nprint(ans)", "c, v0, v1, a, l = list(map(int, input().split()))\r\ncurrent = 0\r\nread_speed = v0\r\nfirst = True\r\nwhile c > 0:\r\n\tc -= (read_speed - (l * (not first)))\r\n\tfirst = False\r\n\tread_speed += a\r\n\tread_speed = min(v1, read_speed)\r\n\tcurrent += 1\r\nprint(current)", "import math\r\nc,v0,v1,a,l=map(int,input().split())\r\nnow=0\r\nv=v0\r\nfor x in range(1000):\r\n\tx+=1\r\n\tif (now!=0): now+=v-l\r\n\telse: now+=v\r\n\tv=min(v+a,v1)\r\n\t#print(now)\r\n\tif (now>=c):\r\n\t\tprint(x)\r\n\t\texit()", "c,v0,v1,a,l=map(int,input().split())\r\nd=1\r\np=v0\r\ni=1\r\nwhile(c>p):\r\n r=min(v0+(i*a),v1)\r\n c+=l\r\n p+=r\r\n i+=1\r\n d+=1\r\nprint(d)\r\n", "c, v0, v1, a, l = list(map(int, input().split()))\r\n\r\n \r\ndays=1\r\nnew=v0\r\nread=v0\r\n\r\nwhile 1:\r\n if new>=c:break\r\n \r\n read = min(read + a, v1)\r\n new += (read-l)\r\n \r\n days+=1\r\n\r\n \r\n #print(new)\r\nprint(days)\r\n \r\n", "'''input\n5 5 10 5 4\n'''\nc, v0, v1, a, l = map(int, input().split())\np = 0\nd = 0\nwhile True:\n\tp += min(v1, v0 + a*d)\n\td += 1\n\tif p >= c:\n\t\tprint(d)\n\t\tbreak\n\tp -= l\n\n", "c, v0, v1, a, l = map(int, input().split())\r\nr = v0\r\nbr = 1\r\n\r\nwhile r < c:\r\n r -= l\r\n r += min(v0 + br * a, v1)\r\n br += 1\r\n\r\nprint(br)\r\n", "'''input\n1000 2 2 5 1\n'''\n\nc, v0, v1, a, l = list(map(int, input().split()))\ncurrent = 0\ndays = 0\nc = c - v0\ndays += 1\ncurrent = v0\nwhile c > 0:\n\tc += l\n\tcurrent += a\n\tif current > v1:\n\t\tcurrent = v1\n\tc -= current\n\tdays += 1\nprint(days)", "c, v0, v1, a, l = [int(x) for x in input().split()]\r\ny = x = v0\r\nz = 1\r\nif v0 >= c:\r\n print(1)\r\nelse:\r\n while x<c:\r\n z = z+1\r\n y = y + a\r\n if y>v1:\r\n y=v1\r\n x = x - l + y\r\n print(z)", "temp=[int(x) for x in input().split()]\r\ncount=0\r\ni=0\r\nwhile(True):\r\n\tif i==0:\r\n\t\tcount+=temp[1]\r\n\t\tif(count>=temp[0]):\r\n\t\t\tbreak\r\n\telse:\r\n\t\tcount-=temp[4]\r\n\t\tif (temp[1] + i*temp[3])<temp[2]:\r\n\t\t\tcount+=(temp[1] + i*temp[3])\r\n\t\telse:\r\n\t\t\tcount+=temp[2]\r\n\t\tif(count>=temp[0]):\r\n\t\t\tbreak\r\n\ti+=1\r\nprint(i+1)", "\r\nc, v0, v1, acc, l = map(int, input().split())\r\ntotalPages = 0\r\ndays = 1\r\n\r\nwhile True:\r\n\ttotalPages += min(v1, v0 + max(0, (days - 1 )) * acc)\r\n\r\n\tif totalPages >= c:\r\n\t\tprint(days)\r\n\t\texit()\r\n\r\n\tdays += 1\r\n\ttotalPages -= l\r\n\r\n\r\n\r\n\t\r\n", "c, v0, v1, a, l = map(int, input().split())\r\n\r\nr, d = 0, 1\r\nv = v0\r\nwhile True:\r\n if r != 0:\r\n r -= l\r\n r += v\r\n if r >= c:\r\n print(d)\r\n break\r\n v = min(v1, v + a)\r\n d += 1\r\n", "# Python 3\r\n\r\npages, speed, max_speed, acc, review = tuple(map(int, input().split()))\r\n\r\nread = 0\r\n\r\ncount = 0\r\n\r\nwhile (read < pages): \r\n\tcount += 1\r\n\t\r\n\tto_read = speed\r\n\tif count > 1:\r\n\t\tto_read -= review\r\n\t\r\n\tread += to_read\r\n\t\r\n\tspeed += acc\r\n\tif speed > max_speed:\r\n\t\tspeed = max_speed\r\n\t\r\nprint(count)", "(c,v,v1,a,l) = (int(i) for i in input().split())\r\nd = 0\r\nwhile c>0:\r\n\tc-=v\r\n\tif v<v1: v = min(v+a, v1)\r\n\tif d!=0: c+=l\r\n\td+=1\r\nprint(d)", "def main():\n c, v0, v1, a, l = map(int, input().split())\n v0 -= l\n v1 -= l\n for t in range(1, 10000):\n c -= v0\n if c <= l:\n break\n v0 = min(v0 + a, v1)\n print(t)\n\n\nif __name__ == '__main__':\n main()\n", "import random\r\nimport math\r\nimport sys\r\na = [int(x) for x in input().split()]\r\n\r\ndone = 0\r\n\r\ni = 0\r\nwhile done < a[0]:\r\n t = a[1] + i * a[3]\r\n if t > a[2]:\r\n t = a[2]\r\n done = done + t\r\n i += 1\r\n if done < a[0]:\r\n done -= a[4]\r\n\r\nprint (i)\r\n", "c,v0,v1,a,l=map(int,input().split())\r\nx=v0\r\nm=1\r\ni=1\r\nwhile(x<c):\r\n\ty=v0+(i*a)\r\n\ti+=1\r\n\tif y>v1:\r\n\t\ty=v1\r\n\tx+=y\r\n\tx-=l\r\n\tm+=1\t\r\nprint(m)", "c, v0, v1, a, l = map(int, input().split())\n\nv = v0;\n\nread = v;\nday = 1;\nv += a\nv = min(v, v1)\n\n\nif(read >= c):\n print(day)\n exit(0);\n\n\nwhile(True):\n day +=1;\n read += v - l\n\n v+=a\n v = min(v, v1)\n if(read >= c):\n print(day)\n exit(0);\n\n", "c,u,v,a,l=map(int,input().split())\nans=1\nc-=u\nwhile c>0:\n ans+=1\n u=min(v,u+a)\n c-=u-l\nprint(ans)\n", "c,v0,v1,a,l=map(int,input().split())\r\nans=0\r\nv=v0\r\nwhile c>0:\r\n c-=v\r\n ans+=1\r\n v+=a\r\n if v>v1:\r\n v=v1\r\n if c>0:\r\n c+=l\r\nprint(ans)\r\n", "tp,v0,vi,a,rerd=map(int,input().strip().split()[:5])\r\nz,x,count=0,0,0\r\nwhile z<tp:\r\n\tif x==0:\r\n\t\tz+=v0\r\n\t\tcount+=1\r\n\telse:\r\n\t\tz+=min(v0+(a*x),vi)-rerd\r\n\t\tcount+=1\r\n\tx+=1\r\nprint(count)", "c, v0, v1, a, l = map(int, input().split())\r\n\r\nposition = v0\r\ndays = 1\r\n\r\nadd = v0\r\n\r\nwhile position < c:\r\n add = min(v1, add + a)\r\n position += add - l\r\n days += 1\r\nprint(days)", "c,v0,v1,a,l = list(map(int,input().split()))\n\npos = v0\nt = 1\nad = v0\n\nwhile pos<c:\n\tad = min(v1,ad+a)\n\tpos+=ad-l\n\tt+=1\n\nprint(t)", "input_ints = list(map(int, input().split(\" \")))\r\n\r\nn_pages, v_initial, max_v, a, setback = input_ints\r\n\r\ncurrent_page = v_initial\r\ncurrent_speed = v_initial\r\nday = 1\r\n\r\nwhile current_page < n_pages:\r\n day += 1\r\n current_speed += a\r\n current_speed = min(current_speed, max_v)\r\n current_page += current_speed - setback\r\n\r\nprint(day)", "\r\nc,v0,v1,a,l=map(int,input().split())\r\nans=1\r\nc-=v0\r\nwhile c>0:\r\n ans+=1\r\n v0=min(v1,v0+a)\r\n c-=v0-l\r\nprint(ans)\r\n", "c, v0, v1, a, l = input().split()\r\nc, v0, v1, a, l = [int(c), int(v0), int(v1), int(a), int(l)]\r\npage_covered = v0\r\nans = 1\r\nwhile page_covered != c and page_covered < c:\r\n if v0 + (ans*a) <= v1:\r\n page_covered += v0 + (ans *a) - l\r\n else:\r\n page_covered += v1 - l\r\n ans += 1\r\nprint(ans)", "c,v0,v1,a,l=input().split()\r\nc=int(c)\r\nv0=int(v0)\r\nv1=int(v1)\r\na=int(a)\r\nl=int(l)\r\n\r\nd=0\r\ns=0\r\nwhile s<c:\r\n d+=1\r\n if s!=0:\r\n s-=l\r\n s+=min(v1,v0+(d-1)*a)\r\n\r\nprint(d)\r\n\r\n", "c, v0, v1, a, l = [int(i) for i in input().split()]\r\ndays = 0\r\npages_read = 0\r\nwhile True:\r\n days += 1\r\n pages_read = max(pages_read - l, 0)\r\n pages_read += min(v0 + a * (days - 1), v1)\r\n if pages_read >= c:\r\n break\r\nprint(days)\r\n", "c, v0, v1, a, l = map(int, input().split())\ncounter = 0\nwhile True:\n c -= min(v0 + a * counter, v1)\n counter += 1\n if c <= 0: break\n c += l\nprint(counter)\n ", "a=list(map(int,input().split()))\r\nc=a[0]\r\nv0=a[1]\r\nv1=a[2]\r\nA=a[3]\r\nl=a[4]\r\ni=0\r\nk=0\r\nwhile c>0:\r\n if v1>v0+i*A:\r\n c-=v0+i*A\r\n i+=1\r\n else:\r\n c-=v1\r\n k+=1\r\n if c<=0:\r\n break\r\n else:\r\n c+=l\r\nprint (k)", "c,v0,v1,a,l=[int(i) for i in input().split()]\r\nif v0>=c:\r\n print(1)\r\nelse:\r\n m=v0\r\n t=1\r\n z=a\r\n while m<c:\r\n m-=l\r\n h=v0+z\r\n if h>v1:\r\n h=v1\r\n else:\r\n z+=a\r\n m+=h\r\n t+=1\r\n print(t)\r\n", "c, v0, v1, a, l = map(int, input().split(\" \"))\r\n\r\ndays = 0\r\n\r\nwhile c > 0:\r\n if days > 0:\r\n c += l\r\n c -= v0\r\n v0 += a\r\n if v1 < v0:\r\n v0 = v1\r\n days += 1\r\n\r\nprint(days)", "c,v0,v1,a,l = map(int, input().split())\r\nread = 0\r\nday = 0\r\nwhile True:\r\n if day!=0:\r\n read -= l\r\n day += 1\r\n read += v0\r\n if read>=c:\r\n break\r\n v0 = min(v0+a, v1)\r\nprint(day)\r\n", "import re\r\nimport sys\r\nimport math\r\nimport string\r\n\r\n\r\nI=list(map(int,input().strip().split(\" \")))\r\nc,v0,v1,a,l=I\r\nt,i=c-v0,1\r\nwhile True:\r\n if t<=0:\r\n print(i)\r\n break\r\n \r\n if v0+a*i>v1:\r\n t=t-(v1-l)\r\n else:\r\n t=t-(v0+a*i-l)\r\n \r\n i=i+1", "book, v, maxv, a, reread = input().split()\nbook = int(book)\nv = int(v)\nmaxv = int(maxv)\na = int(a)\nreread = int(reread)\n#print(\"number: \" + str(book) + \" \" + str(v))\n\nlast = int(v)\ndays = 1\nwhile last < book:\n\tv = v + a\n\tif v > maxv:\n\t\tv = maxv\n\tlast -= reread\n\tlast += v\n\tdays += 1\n\t#print(str(last) + \" \" + str(v) + \" \" + str(days) + \" \" + str(reread))\n\t\n#print(last)\nprint(days)\n", "c, v0, v1, a, l = map(int, input().split())\r\nv = v0\r\nd = 0\r\nr = 0\r\nwhile r < c:\r\n if d != 0:\r\n r -= l\r\n\r\n d += 1\r\n r += v\r\n v += a\r\n if v > v1:\r\n v = v1\r\nprint(d)\r\n", "c, v0, v1, a, l = map(int, input().split())\r\n\r\ncur = 0\r\nd = 0\r\n\r\nwhile True:\r\n cur += min(v1, v0 + a*d)\r\n d += 1\r\n if cur >= c:\r\n print(d)\r\n break\r\n cur -= l\r\n", "# codeforce\n\nc, v0, v1, a, l = map(int, input().split())\ni = 1\nread = v0\nwhile read < c:\n if v0 + a*i > v1:\n x = max(v1-l, 0)\n else:\n x = max(v0 + a*i-l, 0)\n read += x\n i += 1\n\nprint(i)", "c, v0, v1, a, l = list(map(int, input().split()))\r\n\r\nif c <= v0:\r\n print(1)\r\n exit(0)\r\nlastv = v0\r\nday = 1\r\ns = v0\r\nwhile True:\r\n day += 1\r\n lastv = lastv + a\r\n if lastv > v1:\r\n lastv = v1\r\n s = s - l + lastv\r\n #print(\"lastv =\", lastv, \" s=\", s)\r\n if s >= c:\r\n break\r\n\r\nprint(day)\r\n\r\n\r\n \r\n \r\n \r\n \r\n\r\n\r\n", "\r\nc, v0, v1, a, l = map(int, input().split())\r\n\r\ndays = 1\r\ni = 1\r\nc -= v0\r\nwhile c > 0:\r\n toread = v0 + i * a\r\n\r\n if toread > v1:\r\n toread = v1\r\n\r\n toread -= l\r\n c -= toread\r\n i += 1\r\n days += 1\r\n\r\nprint(days)\r\n", "c, v0, v1, a, l = map(int, input().split())\r\n\r\ni = 1\r\ncur = 0\r\nwhile True:\r\n cur += min(v1, v0 + (i-1)*a) - l\r\n if cur + l >= c:\r\n print(i)\r\n break\r\n else:\r\n i += 1\r\n", "numList=input().split(\" \")\r\nc=int(numList[0])\r\nv0=int(numList[1])\r\nv1=int(numList[2])\r\na=int(numList[3])\r\nl=int(numList[4])\r\niPage=0\r\niDay=0\r\nwhile iPage<c:\r\n\tiDay+=1\r\n\tiAddPage=v0+(iDay-1)*a\r\n\tif iAddPage>v1:\r\n\t\tiAddPage=v1\r\n\tif iDay==1:\r\n\t\tiPage+=iAddPage\r\n\telse:\r\n\t\tiPage+=iAddPage-l\r\nprint(iDay)", "c , v_0 , v_1 , a , l = map(int , input().split())\r\ncounter = 1\r\ni = 1\r\nreaded = v_0\r\nwhile c > readed : \r\n read = v_0 + (a * i) - l\r\n read = min(read , v_1 -l)\r\n readed += read\r\n counter +=1\r\n i+=1\r\n\r\nprint(counter)", "page_count, first_speed, speed_limit, growth_speed, re_reading = (int(x) for x in input().split())\r\nread = 0\r\ndays_count = 0\r\ni = 0\r\nwhile True:\r\n\tcur_read = first_speed + i*growth_speed\r\n\tif cur_read > speed_limit:\r\n\t\tread += speed_limit\r\n\telse:\r\n\t\tread += cur_read\r\n\tdays_count += 1\r\n\tif read >= page_count:\r\n\t\tbreak\r\n\tread -= re_reading\r\n\ti += 1\r\n\r\nprint(days_count)", "# -*- coding: utf-8 -*-\ndef reading(pages, speed, max_speed, busting, fee):\n days = 1\n pages -= speed\n if pages <= 0:\n return days\n while (speed + days*busting <= max_speed and pages > 0):\n pages -= -fee + days*busting + speed\n days += 1\n if pages <= 0:\n break\n while (speed + fee + days*busting > max_speed and pages > 0): \n pages -= -fee +max_speed\n days += 1\n if pages <= 0:\n break\n return days\n\n\nd = input()\na,b,c,f,e = d.split(' ')\nprint (reading(int(a),int(b),int(c),int(f),int(e))) \n", "c, v0, v1, a, L = map(int, input().split())\r\nt = 0\r\n\r\nwhile True:\r\n c -= min(v0+a*t, v1)\r\n if c < 1:\r\n print(t+1)\r\n break\r\n c += L\r\n t += 1", "inp=input().split()\r\nc=int(inp[0]) #length of the book in page\r\nv0=int(inp[1]) # initial reading spead\r\nv1=int(inp[2]) #max reading spead\r\na=int(inp[3]) #acceleration in reading speed\r\nl=int(inp[4]) #number of pages of rereading\r\n\r\nnbpagerest=c\r\nday=1\r\nwhile nbpagerest>=0:\r\n if day>1:\r\n nbpagerest=nbpagerest+l \r\n if v0+(day-1)*a<=v1:\r\n nbpagerest=nbpagerest-v0-(day-1)*a\r\n else:\r\n nbpagerest=nbpagerest-v1\r\n else:\r\n nbpagerest=nbpagerest-v0\r\n if nbpagerest<=0:\r\n break\r\n day=day+1\r\n\r\nprint(day)\r\n", "from sys import stdin, stdout\r\n\r\nc, v0, v1, a, l = map(int, stdin.readline().split())\r\ncnt = 0 \r\nans = 0\r\n\r\nwhile cnt < c:\r\n cnt += v0\r\n v0 = min(v0 + a, v1)\r\n ans += 1\r\n \r\n if cnt >= c:\r\n break\r\n \r\n cnt -= l\r\n\r\n\r\nstdout.write(str(ans))", "c, v0, v1, a, l = map(int, input().split())\r\nres = 1\r\nq = v0\r\nwhile True:\r\n if q >= c:\r\n break\r\n q-=l\r\n q+= min(v0+a*res, v1)\r\n res += 1\r\nprint (res)", "c, v0, v1, a, l = [int(i) for i in input().split()]\r\n\r\ni, d = 1, 0\r\n\r\nwhile 1:\r\n if d > 0: i -= l\r\n v = min(v0 + d * a, v1)\r\n d += 1\r\n i += v\r\n if i > c: break\r\n\r\nprint(d)\r\n", "'''\r\nimport sys\r\ndata = sys.stdin.readlines()\r\n'''\r\n# reading from standard input\r\nimport fileinput\r\nfor line in fileinput.input():\r\n ainput = [int(x) for x in line.split()]\r\n# number of days\r\nd=1\r\n#rewrite into convenient variables \r\nc=ainput[0]\r\n\r\nv0=ainput[1]\r\nv1=ainput[2]\r\na=ainput[3]\r\nl=ainput[4]\r\nv=0\r\ncleft=1000\r\nif v0>=c:\r\n print(1)\r\nelse:\r\n cleft=c-v0\r\n v=min(v0+a, v1) \r\n while cleft>=1:\r\n d=d+1\r\n cleft=cleft-v+l\r\n v=min(v+a,v1) \r\n# print(\"cleft\",cleft, \"v\", v, \"a\", a, \"l\", l, \"d\", d)\r\n print(d)\r\n", "import math\nimport time\n\nst = input().split()\nc = int(st[0])\nv0 = int(st[1])\nv1 = int(st[2])\na = int(st[3])\nl = int(st[4])\n\ni = 0\nd = 0\nwhile i < c:\n if (v0 + d * a) < v1:\n i += v0 + d * a\n else:\n i += v1\n d += 1\n if d != 1:\n i -= l\n\nprint(d)\n \n", "c, v0, v1, a, l = map(int,input().split())\r\nd=0\r\nk=0\r\nwhile c>d:\r\n k+=1\r\n d+=v0\r\n if d>=c:\r\n break\r\n if v0+a<=v1:\r\n v0+=a\r\n else:\r\n v0=v1\r\n d-=l\r\nprint(k)\r\n \r\n", "c,vo,v1,a,l=map(int,input().split())\nt=0\nx=vo\nwhile c>0:\n if x>v1:\n x=v1\n if t==0:\n c-=x\n t+=1\n x+=a\n else:\n c-=x-l\n t+=1\n x+=a\nprint(t)\n\n\t \t\t\t\t \t \t\t\t\t\t\t\t\t\t \t\t \t\t \t \t \t", "def solution(c, v, v1, a, l):\n d = 0\n while True:\n # print(\"Day\", d)\n # print(\"Pages\", c)\n # print(\"Speed\", v)\n c -= v\n d += 1\n if c <= 0:\n return d\n c += l\n if v < v1:\n v += a\n if v > v1:\n v = v1\n\nif __name__ == \"__main__\":\n c, v, v1, a, l = map(int, input().split())\n print(solution(c, v, v1, a, l))\n", "c, v, max, a, l = map(int, input().split())\r\n\r\ni = 1\r\ndays = 1\r\npage = v\r\n\r\nwhile page < c:\r\n if v + i*a <= max:\r\n page = page - l + v + i*a\r\n else:\r\n page = page - l + max\r\n days += 1\r\n\r\n i += 1\r\n\r\nprint(days)", "\nInput=lambda:map(int,input().split())\nx = 0\nList = list(Input())\nRead = 0\nDay = 0\nwhile True:\n \n Read+=min(List[1] + (x*List[3]), List[2])\n if Read >= List[0]:\n Day+=1\n break\n x+=1\n List[0]+=List[4]\n Day+=1\n\n\nprint(Day)\n", "def main():\n [c, v0, v1, a, l] = [int(_) for _ in input().split()]\n days = 0\n n_pages_read = 0\n\n while n_pages_read < c:\n today_speed = min(v1, v0 + days * a)\n\n if n_pages_read == 0:\n n_pages_read = today_speed\n else:\n n_pages_read += today_speed - l\n\n days += 1\n\n print(days)\n\n\nif __name__ == '__main__':\n main()\n", "c,vo,vi,a,l=map(int,input().split())\r\nday=1\r\nc-=vo\r\nwhile(c>0):\r\n day+=1\r\n vo=min(vo+a,vi)\r\n c-=vo-l\r\nprint(day)", "c,v,vm,a,l=list(map(int,input().split()))\r\npos=v\r\ntime=1\r\nadd=v\r\nwhile (pos<c):\r\n add=min(vm,add+a)\r\n pos+=add-l\r\n time+=1\r\nprint(time)", "\r\nnumber_of_pages, v0, max_number_of_pages, a, l = list(map(int, input().split()))\r\nprev = 0\r\ndays = 0\r\nread = v0\r\nwhile number_of_pages > 0:\r\n days += 1\r\n today = read - min(l, prev)\r\n number_of_pages -= today\r\n prev = read\r\n read = min(max_number_of_pages, read + a)\r\n\r\nprint(days)\r\n", "c, v0, v1, a, l = map(int, input().split())\n\nans = 0\nv = v0\np = 0\nwhile p < c:\n p = max(p - l, 0)\n p += v\n v = min(v + a, v1)\n ans += 1\n\nprint(ans)\n", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Mon Jul 10 09:21:33 2017\n\n@author: malware\n\"\"\"\n\n\nc, v0, v1, a, l = map(int, input().strip().split())\n\nres = 0 \ncur = v0\nwhile (c > 0):\n if (res == 0):\n res = res + 1\n c -= cur\n else:\n res = res + 1\n c -= cur - l\n cur = min(a + cur, v1)\n \nprint(res)\n ", "c, v0, v1, a, l = (int(i) for i in input().split())\nres, v = 0, v0\nwhile c > 0:\n c -= v - l if res > 0 else v\n v = min(v1, v + a)\n res += 1\nprint(res)\n", "#!/usr/bin/python3 -tt\n\nc, v0, v1, a, l = [int(x) for x in input().strip().split()]\n\ni = 1\nread = 0\nwhile read < c:\n if (i > 1): read -= l\n read += min(v0 + (i - 1) * a, v1)\n i += 1\nprint(i - 1)\n", "listy = input().split()\r\nlisty = [int(x) for x in listy]\r\nc = listy[0]\r\nv0 = listy[1]\r\nv1 = listy[2]\r\na = listy[3]\r\nl = listy[4]\r\n\r\nleft = c - v0\r\nif left == 0:\r\n\tprint(1)\r\nelse:\r\n\txxx = 1\r\n\twhile left > 0:\r\n\t\tspeed = v0 + xxx * a\r\n\t\tif speed > v1:\r\n\t\t\tspeed = v1\r\n\t\tleft = (left + l) - speed \r\n\t\txxx += 1\r\n\t\r\n\tprint(xxx)", "l1 = [int(x) for x in input().split()]\r\nc,v0,v1,a,l=l1[0],l1[1],l1[2],l1[3],l1[4]\r\ni=0\r\ndays=0\r\nwhile i<c:\r\n days+=1\r\n today = max(0,-l*(int(days>1))+min(v0+a*(days-1),v1))\r\n i+=today\r\n \r\nprint(days)\r\n", "c, v0, v1, a, l = list(map(int, input().split()))\r\n\r\ncur = 0\r\nans = 0\r\nwhile cur < c:\r\n ans += 1\r\n if ans > 1:\r\n cur -= l\r\n v0 = min(v0 + a, v1)\r\n cur += v0\r\n\r\n\r\nprint(ans)", "c,v0,v1,a,l=map(int,input().split())\r\n\r\ncount=0\r\ndays=0\r\n\r\n\r\nwhile(1):\r\n if(days==0):\r\n days+=1\r\n count+=v0\r\n index=0\r\n else:\r\n \r\n count+=min(v0+((days)*a),v1)-l\r\n \r\n days+=1\r\n if(count>=c):\r\n break;\r\n\r\nprint(days)\r\n \r\n", "from math import ceil\r\nt,a,h,d,l=map(int,input().split())\r\nc=0\r\nx=a\r\ny=0\r\nwhile t>0:\r\n\tt-=x\r\n\tx+=d\r\n\tif x>h:\r\n\t\tx=h\r\n\tt+=y\r\n\tc+=1\r\n\ty=l\r\nprint(c)", "c, v0, v1, a, l=map(int, input().split())\r\ndays=1\r\npages_read=v0\r\ncount=1\r\nwhile pages_read<c:\r\n pages_read+=min(v1, v0+a*count)\r\n pages_read-=l\r\n days+=1\r\n count+=1\r\nprint(days)", "c,v0,v1,a,l = map(int, input().split())\r\n\r\nday = 1\r\nleft = c\r\nwhile(left > 0):\r\n left -= v0\r\n if day > 1:\r\n left += min(c-left, l)\r\n v0 += a\r\n v0 = min(v0, v1)\r\n if (left <= 0): break\r\n day += 1\r\n\r\nprint(day)", "import os\r\nimport sys\r\nimport math\r\nimport heapq\r\nfrom decimal import *\r\nfrom io import BytesIO, IOBase\r\nfrom collections import defaultdict, deque\r\n\r\ndef r():\r\n return int(input())\r\ndef rm():\r\n return map(int,input().split())\r\ndef rl():\r\n return list(map(int,input().split()))\r\n\r\nc,v0,v1,a,l = rm()\r\ndays=1\r\nc-=v0\r\ny=v0\r\nwhile c>0:\r\n toread = y+a\r\n y = min(toread,v1)\r\n c-=(y-l)\r\n days+=1\r\nprint(days)\r\n", "c, v0, v1, a, l = list(map(int, input().split()))\r\nspeed = v0\r\nprogress = v0\r\nans = 1\r\nwhile progress < c:\r\n speed += a\r\n if speed > v1:\r\n speed = v1\r\n progress += speed - l\r\n ans += 1\r\nprint(ans)\r\n", "c,v0,v1,a,l=map(int,input().split())\r\nr=v0\r\nans=1\r\nwhile r<c:\r\n\tv0=min(v1,v0+a)\r\n\tr=min(r-l+v0,c)\r\n\tans+=1\r\nprint (ans)", "def readi(day,v0,a,v1):\n\treturn min(v0+(day-1)*a,v1)\n\ninp=input().split()\nc=int(inp[0])\nv0 = int(inp[1])\nv1= int(inp[2])\na=int(inp[3])\nl=int(inp[4])\nday=1\nread=min(v0,v1)\nwhile(read<c):\n\tread-=l\n\tday+=1\n\tread+=readi(day,v0,a,v1)\nprint(day)\n", "c, v0, v1, a, l = map(int, input().split())\r\nans = 0\r\ncur = 0\r\nv = v0\r\nwhile cur < c:\r\n if ans > 0:\r\n cur -= l\r\n cur += v\r\n v = min(v + a, v1)\r\n ans += 1\r\nprint(ans)", "c, v0, v1, a, l = map(int, input().split())\r\nc -= v0\r\nn = 1\r\nwhile c > 0:\r\n v0 = min(v0+a, v1)\r\n c -= v0 - l\r\n n += 1\r\nprint(n)", "c, v0, v1, a, l = map(int, input().split())\r\ndays = 0\r\nwhile c > 0:\r\n days += 1\r\n c -= v0\r\n v0 = min(v1, v0 + a)\r\n if c > 0:\r\n c += l\r\nprint(days)", "c,v0,v1,a,l = map(int,input().split())\r\nif(c<=v0):\r\n\tprint(1)\r\n\texit(0)\r\nc-=v0\r\nc+=l\r\ntot=1\r\nwhile (True):\r\n\tif(v0+tot*a<=v1):\r\n\t\tc-=(v0+tot*a)\r\n\telse:\r\n\t\tc-=(v1)\r\n\ttot += 1\r\n\tif(c<=0):\r\n\t\tbreak\r\n\tc+=l\r\nprint(tot)\r\n", "def list_input():\r\n return list(map(int,input().split()))\r\ndef map_input():\r\n return map(int,input().split())\r\ndef map_string():\r\n return input().split()\r\n \r\nc,v0,v1,a,l = map_input()\r\ncur = 0\r\ncnt = 0\r\nwhile cur < c:\r\n if cnt != 0:\r\n cur += min(v1,v0+cnt*a)-l\r\n else:\r\n cur += min(v1,v0+cnt*a)\r\n cnt += 1\r\nprint(cnt) ", "c,v0,v1,a,l=list(map(int,input().split()))\r\npage=v0\r\nhave=v0\r\nday=1\r\nwhile(c>page):\r\n have=min(v1,have+a)\r\n page=page+(have-l)\r\n day=day+1\r\nprint(day)", "c,v0,v1,a,l = map(int, input().split())\r\n\r\nday = 1\r\nread = v0\r\nwhile read<c:\r\n read -= l\r\n day += 1\r\n v0 = v0+a if v0+a<=v1 else v1\r\n read += v0\r\n\r\nprint(day)", "c, v0, v1, a, l = map(int, input().split())\r\n\r\ntotal_pages = 0\r\ndays = 0\r\nwhile total_pages < c:\r\n pages_today = min(v0 + a*days, v1) # calculate the number of pages to be read today\r\n if days > 0:\r\n pages_today -= l # subtract the pages reread from previous day\r\n total_pages += pages_today\r\n days += 1\r\n\r\nprint(days)\r\n", "c,v0,v1,a,l = map(int,input().split())\ni = 0\ncnt = 1\ni += v0\nwhile i<c:\n\tv0 += a\n\ti -= l\n\tif v0>v1:\n\t\tv0=v1\n\ti+=v0\n\tcnt += 1\nprint(cnt)\n\t\t\n", "c, v0, v1, a, l = [int(item) for item in input().split()]\r\n\r\np = v0\r\n\r\nans = 1\r\nv = v0\r\nwhile p < c:\r\n v += a\r\n read = min(v, v1)\r\n p += read - l\r\n ans += 1\r\n\r\nprint(ans)", "c,u,v,a,l=map(int,input().split())\r\nans=1\r\nc-=u\r\nwhile c>0:\r\n ans+=1\r\n u=min(v,u+a)\r\n c-=u-l\r\nprint(ans)\r\n", "c,v0,v1,a,l=map(int,input().split())\nsuma=v0\nrj=1\ntr=v0+a\nwhile suma<c:\n suma+=min(v1,tr)\n suma-=l\n tr+=a\n rj+=1\nprint(rj)\n\n \t\t\t\t\t \t\t \t \t \t\t\t \t\t \t\t\t", "(c, v0, v1, a, l) = (int(i)for i in input().split())\r\nd = 1\r\nsum = v0\r\nv = 0\r\nwhile sum < c:\r\n v = min(v0 + a * d , v1)\r\n sum = sum + v -l\r\n d = d + 1\r\nprint(d)", "pages, first_day, limit, increment, flashback = map(int, input().split())\r\n\r\ngoing_to_read = first_day\r\nmissing = pages - first_day\r\nday = 1\r\n\r\nwhile missing > 0:\r\n going_to_read = min(limit, going_to_read + increment)\r\n new_pages = going_to_read - flashback\r\n missing -= new_pages\r\n day += 1\r\n\r\nprint(day)", "book_len,v0,v_max,a,reread=map(int,input().split())\r\npos=1\r\nfirst_day=True\r\ndays=0\r\nwhile pos<book_len+1:\r\n \r\n if first_day!=True :\r\n pos-=reread\r\n if pos<1 :\r\n pos=1\r\n pos+=v0\r\n if v0<v_max :\r\n v0+=a\r\n if v0>v_max :\r\n v0=v_max\r\n days+=1\r\n first_day=False\r\nprint(days)\r\n", "c, v0, v1, a, l = map(int, input().split())\n\nspeed = v0\npages = v0\ndays = 1\n\nwhile(pages < c):\n if speed + a <= v1:\n speed += a\n else:\n speed = v1\n\n pages = pages + speed - l\n days += 1\n\nprint(days)\n", "a = input().split()\r\nday = 1\r\ns = int(a[0])\r\nd = int(a[1])\r\nm = int(a[2])\r\ns -= d\r\nif s <= 0:\r\n print(day)\r\n exit()\r\nwhile s > 0:\r\n day += 1\r\n read = d + (day - 1) * int(a[-2])\r\n if read > m:\r\n read = m\r\n read -= int(a[-1])\r\n s -= read\r\nprint(day)", "c, v0, v1, a,l=map(int,input().split())\r\nday=sum=0\r\nwhile True :\r\n rst=v0+(a*day)\r\n if rst>v1 : sum+=v1\r\n else : sum+=rst\r\n day += 1;\r\n if sum>=c :\r\n print(day)\r\n exit()\r\n\r\n sum-=l", "def solve(c: int, ps: int, pmax: int, a: int, l: int) -> int:\r\n count =1\r\n c -= ps\r\n while c>0:\r\n count+=1\r\n c+=l\r\n if (ps+a) >= pmax :\r\n ps = pmax\r\n else: \r\n ps += a \r\n c = c- ps \r\n return count \r\n \r\nc,ps,pmax,a,l = map(int,input().split())\r\nprint(solve(c,ps,pmax,a,l))", "c, v0, v1, a, l = (int(i) for i in input().split())\r\nday = 1\r\nwhile (c > 0):\r\n c -= v0\r\n if c <= 0:\r\n break\r\n v0 = min (v1, v0+a)\r\n c+=l\r\n day+=1\r\nprint(day)", "c, v0, v1, a, l = map(int, input().split())\r\nans = 0\r\nwhile True:\r\n ans = ans + 1\r\n c = c - v0\r\n if c <= 0:\r\n break\r\n c = c + l\r\n v0 = min(v0 + a, v1)\r\n\r\nprint(ans)", "c,v0,v1,a,l = list(map(int, input().split(\" \")))\r\ncount=1\r\nsum=v0\r\nwhile sum<c:\r\n sum+=min(v0+count*a-l,v1-l)\r\n count+=1\r\nprint(count)", "c, v0, v1, a, l = map(int, input().split())\n\nv = min(v1, v0 + a)\ni = v0\nanswer = 1\nwhile i < c:\n answer += 1\n i += v - l\n v = min(v1, v + a)\nprint(answer)", "c, v, v1, a, l = map(int, input().split(\" \"))\r\nc -= v\r\nans = 1\r\nwhile c > 0:\r\n v += a\r\n c += l - min(v, v1)\r\n ans += 1\r\nprint(ans)\r\n", "c,v0,v1,a,l=map(int,input().split(\" \"))\r\nhave=0\r\nread=0\r\ncount=0\r\nhave = read = v0\r\nwhile(have < c):\r\n read = min(v1,read + a)\r\n have += read - l\r\n count+=1\r\nprint(count+1)", "c, v0, v1, a, l = map(int, input().split())\r\n\r\nm_r = v1 - l\r\nt = 1\r\nc_r = v0 - l\r\nc_p = min(v0, v1)\r\nwhile c_p < c:\r\n c_r = min(m_r, c_r + a)\r\n c_p = max(0, c_p + c_r)\r\n t += 1\r\nprint(t)\r\n", "def find(c,v0,v1,a,l):\r\n day=0\r\n page=0\r\n init=c\r\n while(page<init):\r\n canread=min(v0+day*a,v1)\r\n if day==0:\r\n page+=canread\r\n day+=1\r\n else:\r\n canread-=min(l,page)\r\n page+=canread\r\n day+=1\r\n return day\r\nc,v0,v1,a,l=list(map(int,input().strip().split(' ')))\r\nprint(find(c,v0,v1,a,l))\r\n \r\n \r\n\r\n \r\n", "c,v0,v1,a,l=map(int,input().split())\nn=0\nwhile c > 0:\n c-=v0\n v0=min(v0+a,v1)\n if n > 0:\n c+=l\n n+=1\nprint(n)", "c,v0,v1,a,l = map(int,input().split())\r\n#5 5 10 5 4 \r\nc-=v0\r\ndays = 1\r\nwhile c>0:\r\n v0 += a\r\n v0 = min(v1,v0)\r\n read = max(0,v0-l)\r\n c-=read\r\n days+=1\r\nprint (days)", "c,v0,v1,a,l = list(map(int, input().split()))\r\n\r\nc = max(0,c-v0)\r\ncurrent_capa = v0\r\ndays = 1\r\nwhile c > 0:\r\n c += l\r\n current_capa = min(v1, current_capa+a)\r\n c -= current_capa\r\n days += 1\r\nprint(days)\r\n", "def main():\r\n p,s,max,ds,rr = map(int,input().split())\r\n days = 1\r\n speed = s\r\n total=s\r\n total=s\r\n while total<p:\r\n total-=rr\r\n speed+=ds\r\n if speed>max:\r\n speed = max\r\n total+=speed\r\n days+=1\r\n print(days)\r\nmain()\r\n\r\n\r\n", "c, v0, v1, a, e = map(int, input().split())\ni = 0\nwhile True:\n s = min(v0 + i * a, v1)\n i += 1\n c -= s\n if c <= 0:\n break\n c += e\nprint(i)\n", "c, v0, v1, a, l = map(int, input().split())\r\npage, day, add = v0, 1, v0\r\nwhile page < c:\r\n add = min(v1, add + a)\r\n page += add - l\r\n day += 1\r\nprint(day)\r\n\r\n\r\n\r\n\r\n", "a = input()\r\nb = a.split(\" \")\r\nc, v0, v1, a, l = int(b[0]), int(b[1]), int(b[2]), int(b[3]), int(b[4])\r\n\r\nday = 1\r\nwhile c > 0:\r\n if day > 1:\r\n c = c + l\r\n c = c - min(v0 + a * (day - 1), v1)\r\n if c <= 0:\r\n break\r\n day += 1\r\nprint(day)\r\n", "c,v,n,a,l = map(int,input().split())\r\nd = 1\r\nc -= v\r\nwhile c > 0:\r\n v += a\r\n if v > n:\r\n v = n\r\n c -= v - l\r\n d += 1\r\nprint(d)", "c, v0, v1, a, l = map(int, input().split())\r\nv = v0\r\np = 0\r\nans = 0\r\nwhile p < c:\r\n if p != 0:\r\n p -= l\r\n p += v\r\n v = min(v + a, v1)\r\n ans += 1\r\n \r\nprint(ans)\r\n", "c, v0, v1, a, l = map(int, input().split())\r\nans = 0\r\ns = 0\r\nwhile s < c:\r\n if s:\r\n s += min(v0, v1)\r\n else:\r\n s += v0\r\n v0 += a\r\n s -= l * (s < c)\r\n ans += 1\r\nprint(ans)\r\n", "def br(c, v0, v1, a, l):\r\n d = 1\r\n read = v0\r\n while read < c:\r\n d += 1\r\n read -= l\r\n v0 = min(v1, v0 + a)\r\n read += v0\r\n return d\r\n\r\np0, p1, p2, p3, p4 = list(map(int, input().strip().split()))\r\nprint(br(p0, p1, p2, p3, p4))", "c, v, v1, a, l = map(int, input().split())\r\n\r\nfor i in range(1, 1000000):\r\n c -= v\r\n \r\n if i > 1:\r\n c += l\r\n \r\n if c <= 0:\r\n print(i)\r\n break\r\n \r\n v += a\r\n v = min(v, v1)", "c,v0,v1,a,l = map(int, input().split())\n\npage = v0\ndays = 1\nwhile page < c:\n page += min(v1, v0 + days*a) - l\n days += 1\n\nprint(days)", "c,v0,v1,a,l=map(int,input().split())\r\nk=1\r\nc-=v0\r\nwhile c>0:\r\n k+=1\r\n c+=l\r\n c-=min(v0+a*(k-1),v1)\r\nprint(k)", "import sys\r\nimport collections\r\nimport math\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef printnl(val):\r\n sys.stdout.write(str(val) + '\\n')\r\n\r\n\r\nc, v0, v1, a, l = map(int, input().split())\r\n\r\nstart = v0\r\npassed = 1\r\nans = v0\r\n\r\nwhile start < c:\r\n ans = min(v1, ans + a)\r\n start += ans - l\r\n passed += 1\r\n\r\nprint(passed)\r\n", "c,v0,v1,a,l=map(int,input().split())\r\nsum1=v0\r\ndays=1\r\nwhile(sum1<c):\r\n sum1+=min(v0+days*a-l,v1-l)\r\n days+=1\r\nprint(days)", "# IAWT\r\nc, v0, v1, a, l = list(map(int, input().split()))\r\np = v0\r\nd = 1\r\nv = v0\r\nwhile True:\r\n if p >= c:\r\n break\r\n d += 1\r\n v += a\r\n if v > v1: v = v1\r\n p -= l - 1\r\n p += v - 1\r\n if p >= c:\r\n break\r\nprint(d)\r\n\r\n", "s, str1, str2, a, differ = map(int, input().split(\" \"))\r\n\r\ndays = 0\r\n\r\nwhile s > 0:\r\n if days > 0:\r\n s += differ\r\n s -= str1\r\n str1 += a\r\n if str2 < str1:\r\n str1 = str2\r\n days += 1\r\n\r\nprint(days)", "c,v1,v2,a,l = map(int,input().split())\r\ncnt = 0\r\nr = v1\r\nwhile c > 0:\r\n\tcnt += 1\r\n\tc -= r\r\n\tr = min(v2,r + a)\r\n\tif c <= 0:\r\n\t\tbreak\r\n\tc += l\r\nprint(cnt)", "c, v0, v1, a, l = map(int, input().split())\r\nx = 0\r\ni = 0\r\nwhile x < c:\r\n\tx += min(v0 + a*i, v1) - (l * (i > 0))\r\n\ti+=1\r\nprint(i)", "# in the name of God \n# status:\n\nc, v0, v1, a, l = map(int, input().strip().split())\n\nread = v0\nnew = v0\ndays = 1\n\nwhile c > read:\n new = min(v1, new + a)\n read += new - l\n days += 1\n\nprint(days)\n\n", "c, v0, v1, a, l = map(int, input().split())\r\n\r\ns = v0\r\ni = 1\r\nwhile (c > s):\r\n s+=min(v0 + i * a, v1)\r\n i+=1\r\n s-=l\r\n\r\nprint(i)", "#code\r\n\r\nR = lambda:map(int,input().split())\r\n\r\nc, v, u, a, l = R()\r\n\r\nans=1\r\nc-=v\r\nwhile c>0:\r\n ans+=1\r\n v=min(u,v+a)\r\n c-=v-l\r\nprint(ans)", "c, v0, v1, a, l = map(int, input().split())\ncurr_pages = v0\ndays = 0\nwhile c > 0:\n c -= curr_pages\n days += 1\n curr_pages += a\n curr_pages = min(curr_pages, v1)\n if c > 0:\n c += l\nprint(days)\n", "from sys import exit\r\n\r\nc, v0, v1, a, l = map(int, input().split())\r\n\r\nv = v0\r\nt = 1\r\nlast = v0\r\n\r\nif last >= c:\r\n print(1)\r\n exit(0)\r\n\r\nwhile last < c:\r\n v = min(v1, v0 + t * a) - l\r\n last += v\r\n t += 1\r\n\r\nprint(t)\r\n", "c,v0,vi,a,l = map(int, input().split())\r\nreponse = 0\r\nn = 0\r\nsol = 0\r\n\r\ndef f (n):\r\n if n == 0:\r\n return v0\r\n elif v0 + n*a > vi:\r\n return vi - l\r\n else:\r\n return v0 + n*a - l\r\n\r\nwhile reponse < c:\r\n reponse = reponse + f(n)\r\n n+=1\r\n sol+=1 \r\n\r\nprint (sol)\r\n\r\n", "c ,v0,v1, a, l =map(int , input().split())\r\nc = c - min(v0,v1)\r\ndays = 1\r\ni=1\r\nwhile c>0:\r\n c = c+l\r\n c = c - min((v0+a*i), v1)\r\n i = i+1\r\n days = days+1\r\nprint(days)", "# -*- coding: utf-8 -*-\r\nc,v0,v1,a,l = map(int, input().split(' '))\r\ndef an(a1, d, n, c):\r\n x = a1+d*(n-1)\r\n if x>=c: return c\r\n return x\r\ncnt = 0\r\nd = 1\r\nb = 0\r\nwhile cnt < c:\r\n x = an(v0,a,d,v1)\r\n if d>1: cnt += x-l\r\n else: cnt += x\r\n d += 1\r\nprint(d-1)\r\n", "n,v,m,a,r= map(int,input().split())\r\nc=i=0\r\nwhile i<n:\r\n if i>1:\r\n i-=r\r\n i+=min(v+c*a,m)\r\n c+=1\r\nprint(c)\r\n", "c,v0,v1,a,l=map(int,input().split())\r\np=0\r\nans=0\r\nwhile p<c:\r\n if ans==0:\r\n p+=v0\r\n ans+=1\r\n else:\r\n p-=l\r\n p+=min(v0+ans*a,v1)\r\n ans+=1\r\nprint(ans)", "c, v0, v1, a, l = map(int, input().split())\r\nans, cur = 1, v0\r\nwhile cur < c:\r\n v0 = min(v1, v0 + a)\r\n cur += v0 - l\r\n ans += 1\r\n\r\nprint(ans)", "c,v0,v1,a,l = list(map(int, input().split()))\r\nans = 0\r\ntmp = 0 \r\nfa = 0\r\nwhile True:\r\n temp = (v0 + (fa * a))\r\n if (temp >= v1):\r\n tmp += v1\r\n else:\r\n tmp += temp\r\n ans += 1\r\n if (tmp >= c):\r\n break\r\n fa += 1\r\n tmp -= l\r\n# print(tmp)\r\nprint(ans)\r\n ", "c, v0, v1, a, l = [int(x) for x in input().split()]\r\ns = v0\r\nc = c - s\r\nj = 1\r\nwhile c > 0:\r\n if s + a < v1:\r\n s = s + a\r\n else:\r\n s = v1\r\n c = c - s + l\r\n j += 1\r\nprint(j)\r\n ", "def ri(): return int(input())\r\ndef rli(): return list(map(int, input().split()))\r\ndef rls(): return list(input())\r\ndef pli(a): return \"\".join(list(map(str, a)))\r\n\r\n\r\nc, v0, v1, a, l = rli()\r\nread = 0\r\nfor i in range(1, 2000):\r\n read += min(v0 + (i-1)*a, v1)\r\n if(c <= read):\r\n print(i)\r\n break\r\n read -= l\r\n", "c, v0, v1, a, l = map(int, input().split())\r\n\r\ncurrent = 0\r\ndays = 0\r\n\r\nwhile current < c:\r\n if days > 0:\r\n current -= l\r\n current = max(current, 0)\r\n\r\n days += 1\r\n current += min(v0, v1)\r\n v0 += a\r\n\r\nprint(days)# 1689867504.1033692" ]

[ "n = int(input())\r\nl = list(map(int, input().split()))\r\nans = 0\r\ncount = 0\r\nd = dict()\r\ns = set()\r\ns1 = set()\r\nfor i in l:\r\n if i in s:\r\n d[i] += 1\r\n else:\r\n d[i] = 1\r\n s.add(i)\r\nfor i in range(n):\r\n if l[i] == 0:\r\n count += 1\r\n else:\r\n if l[i] not in s1:\r\n ans += min(d[l[i]], count)\r\n s1.add(l[i])\r\nprint(ans)", "read = lambda: map(int, input().split())\r\nn = int(input())\r\na = list(read())\r\nb = [0] * n\r\nj = 0\r\nfor i in a:\r\n if i:\r\n b[j] = i\r\n j += 1\r\ncnt = sum(i != 0 for i in b)\r\nfor i in range(n):\r\n if b[i] == 0: break\r\n if b[i] == a[i]:\r\n cnt -= 1\r\nprint(cnt)\r\n", "input()\nmemory = list(map(int, input().split()))\n\nproc_data = {p: (-1, -1) for p in memory}\n\nfor i, c in enumerate(memory):\n d1, d2 = proc_data[c]\n if d1 == -1: d1 = i\n d2 = i\n proc_data[c] = (d1, d2)\n\ntry: del proc_data[0]\nexcept KeyError:\n print(\"0\")\n exit()\n\ndata = list(proc_data.values())\ndata.sort()\n\nans = 0\n\nfirst_free = 0\n\nfor a, b in data:\n c = a - first_free\n ans += min(c, b-a+1)\n b -= c\n first_free = b + 1\n\nprint(ans)\n\n", "n = int(input())\nk = [[0, 0, -1]]\ncnt = 0\nfor i in map(int, input().split()):\n if i:\n if k[-1][0] == i:\n k[-1][1] += 1\n else:\n k.append([i, 1, cnt])\n cnt += 1\ncnt = 0\nans = 0\nfor i in k[1:]:\n ans += min(i[1], i[2] - cnt)\n cnt += i[1]\nprint(ans)" ]

[ "n = 2 * 10 ** 6 + 10 ** 5\np, q = map(int, input().split(' '))\npi = 0\nsi = 0\npr = [0] * n\npr[1] = 1\nfor i in range(2, n):\n if pr[i] == 0:\n for j in range(i*i, n, i):\n pr[j] = 1\n\nres = 'Palindromic tree is better than splay tree'\nfor i in range(1, n):\n if pr[i] == 0:\n pi += 1\n j = str(i)\n if j == j[::-1]:\n si += 1\n if q*pi <= si*p:\n res = i\nprint(res)\n\n\t \t\t\t\t\t\t\t\t \t \t\t \t\t \t \t", "import math\r\nfrom os import curdir, startfile\r\nimport random \r\nfrom queue import Queue\r\nimport time \r\nimport heapq\r\nimport sys \r\ndef getprimes(n):\r\n\r\n arr=[True]*(n+1)\r\n\r\n for i in range(2,int(math.sqrt(n))+1):\r\n if arr[i]:\r\n for j in range(i**2,len(arr),i):\r\n arr[j]=False \r\n \r\n primes=set()\r\n\r\n for i in range(2,len(arr)):\r\n if arr[i]:\r\n primes.add(i)\r\n return primes\r\ndef pa(n):\r\n\r\n n=str(n) \r\n \r\n for i in range(len(n)//2):\r\n if n[i]!=n[len(n)-1-i]:\r\n return False \r\n return True\r\ndef main(p,q):\r\n\r\n\r\n arr1=[]\r\n s=2*10**6\r\n arr2=getprimes(s) \r\n arr=[0]\r\n arr1.append(0) \r\n\r\n for i in range(1,s):\r\n val=1 if pa(i) else 0\r\n arr1.append(arr1[-1]+val)\r\n for i in range(1,s):\r\n val=1+arr[-1] if i in arr2 else arr[-1]\r\n arr.append(val)\r\n arr2=arr \r\n best=\"Palindromic tree is better than splay tree\"\r\n for i in range(len(arr1)):\r\n if p*arr1[i]>=q*arr2[i]:\r\n best=i \r\n return best \r\n\r\np,q=list(map(int,input().split()))\r\nprint(main(p,q))\r\n ", "MAXN = 20000001\r\nmark = [0] * MAXN\r\n\r\ndef myrev(num):\r\n ans = 0\r\n while num > 0:\r\n ans = ans * 10 + num % 10\r\n num //= 10\r\n return ans\r\n\r\np, q = map(int, input().split())\r\n\r\ncnta, cntb, curr = 0, 0, 0\r\nmark[0], mark[1] = 1, 1\r\n\r\nfor i in range(1, 2 * 10 ** 6):\r\n if mark[i] == 0:\r\n cnta += 1\r\n j = 2\r\n while i * j < 2 * 10 ** 6:\r\n mark[i * j] = 1\r\n j += 1\r\n if myrev(i) == i:\r\n cntb += 1\r\n if q * cnta <= p * cntb:\r\n curr = i\r\n\r\nprint(curr)\r\n", "def main():\n p, q = map(int, input().split())\n lim = 1179860\n sieve = [0, q] * (lim // 2)\n for i in range(3, int(lim ** .5) + 1, 2):\n if sieve[i]:\n for j in range(i * i, lim, i):\n sieve[j] = 0\n sieve[1], sieve[2] = -p, q - p\n for i in range(3, 10):\n sieve[i] -= p\n for s in map(str, (range(1, 1000))):\n ss = (s, s[::-1])\n for m in '', '0', '1', '2', '3', '4', '5', '6', '7', '8', '9':\n i = int(m.join(ss))\n if i < lim:\n sieve[i] -= p\n res = b = 0\n for i, a in enumerate(sieve):\n b += a\n if b <= 0:\n res = i\n print(res)\n\n\nif __name__ == '__main__':\n main()\n", "import sys\r\n\r\np,q = map(int,sys.stdin.readline().split())\r\n\r\ndef prime(n):\r\n #print(int(n**0.5))\r\n for div in range(2,int(n**0.5)+1):\r\n if n%div==0:\r\n return False\r\n return True\r\n \r\ndef palindrom(n):\r\n n = str(n)\r\n for pos in range((len(n)+1)//2):\r\n if n[pos]!=n[-1-pos]:\r\n return False\r\n return True\r\n \r\ndef findMaxN(p,q):\r\n A = p/q\r\n n = 1\r\n pN = 0\r\n rubN = 1\r\n \r\n checkAgain = False\r\n while True:\r\n n+=1\r\n if prime(n):\r\n pN += 1\r\n checkAgain = True\r\n if palindrom(n):\r\n rubN+=1\r\n checkAgain = True\r\n if checkAgain:\r\n checkAgain = False\r\n if pN>A*rubN:\r\n #return n-1\r\n break\r\n good_n = n-1\r\n check_to = n+10000\r\n delta = 0\r\n last_good = False\r\n while n<check_to:\r\n n+=1\r\n delta+=1\r\n if prime(n):\r\n pN += 1\r\n checkAgain = True\r\n if palindrom(n):\r\n rubN+=1\r\n checkAgain = True\r\n #if n == 172:\r\n #print(n,pN,A*rubN)\r\n if checkAgain:\r\n checkAgain = False\r\n if pN<=A*rubN:\r\n #return n-1\r\n good_n = n\r\n check_to+=delta\r\n delta = 0\r\n last_good = True\r\n else:\r\n if last_good:\r\n last_good = False\r\n good_n = n-1\r\n return good_n\r\n \r\n \r\ndef doTest():\r\n assert findMaxN(1,1)==40\r\n assert findMaxN(1,42)==1\r\n assert findMaxN(6,4)==172\r\n\r\ndoTest()\r\n'''\r\nlast = -1\r\npN = 0\r\nrubN = 1\r\nn = 1\r\nfor i in range(100000):\r\n n+=1\r\n tmp = pN<=6*rubN\r\n if prime(n):\r\n pN += 1\r\n if palindrom(n):\r\n rubN+=1\r\n if tmp!=last:\r\n print(n)\r\n print(pN,rubN)\r\n print()\r\n last = tmp\r\n'''\r\n \r\n \r\nprint(findMaxN(p,q))\r\n ", "p, q = map(int, input().split())\nA, B, R = 0, 0, 0\nC = [0]*2000000\nC[0] = C[1] = 1\ni = 1\n\nwhile i < 2e6:\n if not C[i]:\n A += q\n for j in range(i, int(2e6), i):\n C[j] = 1\n r, t = 0, i\n while t:\n r = 10 * r + t % 10\n t //= 10\n B += p * (r == i)\n if A <= B:\n R = i\n i += 1\n\nprint(R)\n\n \t\t\t \t\t \t\t\t\t \t \t\t\t\t\t \t\t\t\t\t \t", "# # week 3\r\n# # primes or palindromes\r\n# maxN = 20000001\r\n# m = [0] * maxN\r\n# def res(num):\r\n# ans = 0\r\n# while num > 0:\r\n# ans = ans * 10 + num % 10\r\n# num //= 10\r\n# return ans\r\n# ca, cb, cc = 0, 0, 0\r\n# m[0], m[1] = 1, 1\r\n# p, q = map(int, input().split())\r\n\r\n# for i in range(1, 2*10 ** 6):\r\n# if m[i] == 0:\r\n# ca += 1\r\n# j = 2\r\n# while i * j < 2*10 ** 6:\r\n# m[i*j] = 1\r\n# if res(i) == i:\r\n# cb += 1\r\n# if q*ca <= p*cb:\r\n# cc = i\r\n# print(cc)\r\nn = 2 * 10 ** 6 + 10 ** 5\r\np, q = map(int, input().split(' '))\r\npi = 0\r\nsi = 0\r\npr = [0] * n\r\npr[1] = 1\r\nfor i in range(2, n):\r\n if pr[i] == 0:\r\n for j in range(i*i, n, i):\r\n pr[j] = 1\r\n\r\nres = 'Palindromic tree is better than splay tree'\r\nfor i in range(1, n):\r\n if pr[i] == 0:\r\n pi += 1\r\n j = str(i)\r\n if j == j[::-1]:\r\n si += 1\r\n if q*pi <= si*p:\r\n res = i\r\nprint(res)\r\n", "fact = 1\na = 0\nb = 1 \nimport math\nM = 10**7 + 1 \nprime = [True for i in range(M)]\np = 2\nwhile (p * p <= M):\n if (prime[p] == True):\n for i in range(p * p, M, p):\n prime[i] = False\n p += 1\n \n \n\ndef checkPalindrome(str):\n \n # Run loop from 0 to len/2\n for i in range(0, len(str)//2):\n if str[i] != str[len(str)-i-1]:\n return False\n return True \np,q = map(int,input().split())\nans = 1\n\nfor k in range(2, M):\n if prime[k] == True:\n a += 1 \n \n \n if checkPalindrome(str(k)):\n b += 1\n \n if (p*b - a*q>=0):\n ans = max(ans,k)\n \nprint(ans)\n \n", "prime=[0]*1300000\r\ndef primes():\r\n prime[1]=1\r\n for i in range(2,1300000):\r\n if prime[i]==1: continue\r\n for j in range(2*i,1300000,i):\r\n prime[j]=1\r\n \r\ndef palindrome(i):\r\n i=str(i)\r\n return i==i[::-1]\r\np,q=map(int,input().split())\r\nrub=0\r\npi=0\r\nprimes()\r\nres=\"Palindromic tree is better than splay tree\"\r\nfor i in range(1,1200000):\r\n if prime[i]==0:\r\n pi+=1\r\n if palindrome(i):\r\n rub+=1\r\n if q*pi<=p*rub:\r\n res=i\r\nprint(res)", "p,q=map(int,input().split())\r\nA=p/q\r\nv=[0]*10000005\r\nv[1]=1\r\nc=0\r\no=0\r\nans=0\r\nfor i in range(2,10000001):\r\n if v[i]==0:\r\n for j in range(i*i,10000001,i):\r\n v[j]=1\r\nfor l in range(1,10000001):\r\n if str(l)==str(l)[::-1]:\r\n o+=1\r\n if v[l]==0:\r\n c+=1\r\n if c <= A*o :\r\n ans=l\r\n\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", "def palindromic(x):\r\n s = str(x)\r\n return s == s[::-1]\r\n\r\ndef main():\r\n p, q = map(int, input().split())\r\n n = 10 ** 7\r\n prime = [True for i in range(n + 1)]\r\n prime[0] = False\r\n prime[1] = False\r\n\r\n for i in range(2, n + 1):\r\n if prime[i]:\r\n for j in range(i ** 2, n + 1, i):\r\n prime[j] = False\r\n\r\n pi = 0\r\n rub = 0\r\n ans = 0\r\n for i in range(1, 10 ** 7):\r\n if prime[i]:\r\n pi += 1\r\n if palindromic(i):\r\n rub += 1\r\n if pi * q <= p * rub:\r\n ans = i\r\n if ans == 0:\r\n print('Palindromic tree is better than splay tree')\r\n else:\r\n print(ans)\r\n\r\nmain()", "\r\ncrivo = [True] * 2000001\r\ncrivo[0] = False\r\ncrivo[1] = False\r\nfor i in range(2,2001):\r\n\tif crivo[i]:\r\n\t\tfor j in range(i*i,2000001,i):\r\n\t\t\tcrivo[j] = False\r\n\r\na, b = map(float, input().split())\r\nprime = 0\r\npalindromo = 0\r\ncontrol = False\r\ny = -1\r\nfor i in range(1,2000000):\r\n\tif crivo[i]:\r\n\t\tprime += 1\r\n\t\r\n\tif str(int(str(i)[::-1])) == str(i) :\r\n\t\tpalindromo += 1\r\n\t\t\t\t\r\n\tif palindromo * (a / b) >= prime:\r\n\t\ty = i\t\t\t\r\nif y >= 0:\r\n\tprint (y) \r\nelse: \r\n\tprint (\"Palindromic tree is better than splay tree\")", "MAXN = 20000001\nmark = [0] * MAXN\n\ndef myrev(num):\n ans = 0\n while num > 0:\n ans = ans * 10 + num % 10\n num //= 10\n return ans\n\np, q = map(int, input().split())\n\ncnta, cntb, curr = 0, 0, 0\nmark[0], mark[1] = 1, 1\n\nfor i in range(1, 2 * 10 ** 6):\n if mark[i] == 0:\n cnta += 1\n j = 2\n while i * j < 2 * 10 ** 6:\n mark[i * j] = 1\n j += 1\n if myrev(i) == i:\n cntb += 1\n if q * cnta <= p * cntb:\n curr = i\n\nprint(curr)\n\n\t \t\t \t\t\t\t\t\t\t\t\t\t\t\t \t \t\t \t\t\t\t", "\"\"\"\r\nNTC here\r\n\"\"\"\r\nimport sys\r\ninp = sys.stdin.readline\r\ndef input(): return inp().strip()\r\n# flush= sys.stdout.flush\r\n# import threading\r\n# sys.setrecursionlimit(10**6)\r\n# threading.stack_size(2**26)\r\n \r\ndef iin(): return int(input())\r\n \r\n \r\ndef lin(): return list(map(int, input().split()))\r\n \r\n \r\n# range = xrange\r\n# input = raw_input\r\n \r\ndef primetilln(n):\r\n prime = [True for i in range(n+1)]\r\n p = 2\r\n while (p * p <= n):\r\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 += 1\r\n primes = set()\r\n for i in range(2, n):\r\n if prime[i]:\r\n primes.add(i)\r\n return primes\r\n \r\ndef main():\r\n def check_palindrom(x):\r\n s = list(str(x))\r\n return s==s[::-1]\r\n \r\n T = 1\r\n while T:\r\n T-=1\r\n p, q = lin()\r\n mx = 10**7+10\r\n a = primetilln(mx-1)\r\n a1 = [0]*mx\r\n a2 = [0]*mx\r\n for i in a:a1[i]+=1\r\n for i in range(1, mx):\r\n if check_palindrom(i):\r\n a2[i]+=1\r\n for i in range(1, mx):\r\n a1[i]+=a1[i-1]\r\n a2[i]+=a2[i-1]\r\n # print(a2[:20])\r\n ans = 0\r\n for i in range(1, mx):\r\n if a1[i]*q<=p*a2[i]:\r\n ans=max(ans, i)\r\n print(ans if ans else \"Palindromic tree is better than splay tree\")\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\nmain()\r\n \r\n# threading.Thread(target=main).start()", "import math\ndef is_palindrome(x):\n if x<=0:\n return False\n digits=[]\n while x>0:\n digits.append(x%10)\n x//=10\n n=len(digits)\n for p in range(n//2+1):\n if digits[p]!=digits[n-1-p]:\n return False\n return True\ndef main():\n N=1200000\n is_prime=[1]*(N+1)\n is_prime[0]=is_prime[1]=0\n for p in range(2,int(1+math.sqrt(N))):\n if not is_prime[p]:\n continue\n for q in range(2*p,N+1,p):\n is_prime[q]=0\n prime_count=[0]*(N+1)\n for p in range(1,N+1):\n prime_count[p]=prime_count[p-1]+is_prime[p]\n is_palindrome_list=[0]*(N+1)\n for p in range(1,N+1):\n is_palindrome_list[p]=is_palindrome(p)\n pal_count=[0]*(N+1)\n for p in range(1,N+1):\n pal_count[p]=pal_count[p-1]+is_palindrome_list[p]\n p,q=map(int,input().split())\n for k in range(N,0,-1):\n if p*pal_count[k]>=q*prime_count[k]:\n print(k)\n return\n print(\"Palindromic tree is better than splay tree\")\nif __name__==\"__main__\":\n main()\n\t\t \t\t\t\t \t \t \t \t \t\t\t \t \t", "import sys \r\ninput = sys.stdin.buffer.readline \r\n\r\nL = []\r\nC = 0 \r\nD = 0 \r\nprimes = []\r\nM = 2*10**6\r\n#M = 300\r\nfor i in range(1, M+1):\r\n if str(i)==str(i)[::-1]:\r\n is_palin = True \r\n else:\r\n is_palin = False \r\n is_prime = True \r\n if i==1:\r\n is_prime = False\r\n for p in primes:\r\n if p*p > i:\r\n break\r\n if i % p==0:\r\n is_prime = False \r\n break \r\n if is_palin:\r\n C+=1 \r\n if is_prime:\r\n primes.append(i)\r\n D+=1\r\n L.append([i, C, D])\r\n\r\ndef process(p, q):\r\n answer = None\r\n for i, C, D in L:\r\n if C*p >= D*q:\r\n answer = i\r\n if answer is None:\r\n answer = \"Palindromic tree is better than splay tree\"\r\n sys.stdout.write(f'{answer}\\n')\r\n \r\n \r\n return \r\n\r\np, q = [int(x) for x in input().split()]\r\nprocess(p, q)", "p, q = map(int, input().split())\ntop = 1200000\nprime = [1] * top\nprime[1] = 0\npalindromic = 1\nans = 1\nfor i in range(2, top):\n if (str(i) == str(i)[::-1]): palindromic += 1\n if prime[i]:\n for j in range(i*i, top, i): prime[j] = 0\n prime[i] += prime[i-1]\n if (q * prime[i] <= p * palindromic): ans = i\nprint(ans)\n\t\t\t \t \t \t \t\t \t\t \t \t \t\t \t \t", "p, q=(int(x) for x in input().split())\ntop=1200000\nPrime=[1]*top\nPrime[1]=0\npalindromic=1\nresult=1\nfor i in range(2, top):\n\tif str(i)==str(i)[::-1]:\n\t\tpalindromic+=1\n\tif Prime[i]:\n\t\tfor j in range(i*i, top, i):\n\t\t\tPrime[j]=0\n\tPrime[i]+=Prime[i-1]\n\tif q*Prime[i]<=p*palindromic:\n\t\tresult=i\nprint(result)\n \t \t \t \t \t \t\t \t\t \t", "def Prov(val):\r\n val=str(val)\r\n\r\n return val==val[::-1]\r\np,q= map(int,input().split(' '))\r\npmas = [1 for i in range(2000000)]\r\npmas[0]=0\r\npmas[1]=0\r\n\r\nfor i in range(2,2000000):\r\n if pmas[i]==1:\r\n for j in range(i+i,2000000,i):\r\n pmas[j]=0\r\n\r\npalmas=[1 if Prov(i) else 0\r\n for i in range(2000000)]\r\nsu=0\r\nfor i in range(1,2000000):\r\n if palmas[i]:\r\n su+=p\r\n palmas[i]=su\r\nsu=0\r\nfor i in range(1,2000000):\r\n if pmas[i]:\r\n su+=q\r\n pmas[i]=su\r\nsu=0\r\nfor i in range(1,2000000):\r\n if pmas[i]<=palmas[i]:\r\n su=i\r\nprint(su)\r\n\r\n\r\n\r\n\r\n", "def createPalindrome(inp, b, isOdd):\r\n\tn = inp\r\n\tpalin = inp\r\n\r\n\tif (isOdd):\r\n\t\tn = n // b\r\n\r\n\twhile (n > 0):\r\n\t\tpalin = palin * b + (n % b)\r\n\t\tn = n // b\r\n\treturn palin\r\n\r\ndef generatePalindromes(n):\r\n ans=[]\r\n for j in range(2):\r\n\r\n i = 1\r\n while (createPalindrome(i, 10, j % 2) < n):\r\n ans.append(createPalindrome(i, 10, j % 2))\r\n i = i + 1\r\n return ans\r\n\r\na,b=map(int,input().split())\r\nA=a/b\r\nimport bisect\r\ndef SieveOfEratosthenes(n):\r\n\r\n prime = [True for i in range(n+1)]\r\n p = 2\r\n while (p * p <= n):\r\n\r\n if (prime[p] == True):\r\n\r\n for i in range(p * p, n+1, p):\r\n prime[i] = False\r\n p += 1\r\n\r\n arr=[]\r\n for p in range(2, n+1):\r\n if prime[p]:\r\n arr.append(p)\r\n return arr\r\n\r\nn = 15*(10**5)\r\npln=sorted(generatePalindromes(n))\r\nprimes=(SieveOfEratosthenes(n))\r\nans=0\r\nfor i in range(2,n+1):\r\n if bisect.bisect_left(primes,i)<=A*bisect.bisect_left(pln,i):\r\n ans=max(ans,i)\r\nprint(ans-1)", "import math\n\ndef is_palindrome(x):\n if x <= 0:\n return False\n digits = []\n while x > 0:\n digits.append(x % 10)\n x //= 10\n n = len(digits)\n for p in range(n // 2 + 1):\n if digits[p] != digits[n - 1 - p]:\n return False\n return True\n\ndef main():\n N = 1200000\n\n is_prime = [1] * (N + 1)\n is_prime[0] = is_prime[1] = 0\n for p in range(2, int(1 + math.sqrt(N))):\n if not is_prime[p]:\n continue\n for q in range(2 * p, N + 1, p):\n is_prime[q] = 0\n\n prime_count = [0] * (N + 1)\n for p in range(1, N + 1):\n prime_count[p] = prime_count[p - 1] + is_prime[p]\n\n is_palindrome_list = [0] * (N + 1)\n for p in range(1, N + 1):\n is_palindrome_list[p] = is_palindrome(p)\n\n pal_count = [0] * (N + 1)\n for p in range(1, N + 1):\n pal_count[p] = pal_count[p - 1] + is_palindrome_list[p]\n\n p, q = map(int, input().split())\n for k in range(N, 0, -1):\n if p * pal_count[k] >= q * prime_count[k]:\n print(k)\n return\n print(\"Palindromic tree is better than splay tree\")\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 \t", "import sys\r\nimport math\r\nimport collections\r\nimport random\r\nfrom heapq import heappush, heappop, heapify\r\nfrom functools import reduce\r\ninput = sys.stdin.readline\r\n \r\nints = lambda: list(map(int, input().split()))\r\n\r\nprimes = []\r\nMAXN = int(2e6)\r\np = [True] * MAXN\r\np[1] = False\r\nfor i in range(2, MAXN):\r\n if not p[i]: continue\r\n for j in range(2 * i, MAXN, i):\r\n p[j] = False\r\n\r\npsum = [0, 0]\r\nfor i in range(2, MAXN):\r\n if p[i]:\r\n psum.append(psum[-1] + 1)\r\n else: psum.append(psum[-1])\r\n\r\npalindrome = [0]\r\nfor i in range(1, MAXN):\r\n if str(i) == str(i)[::-1]:\r\n palindrome.append(palindrome[i - 1] + 1)\r\n else:\r\n palindrome.append(palindrome[i - 1])\r\n\r\np, q = ints()\r\nfor i in range(MAXN - 1, -1, -1):\r\n if q * psum[i] <= p * palindrome[i]:\r\n print(i)\r\n sys.exit(0)\r\nprint(\"Palindromic tree is better than splay tree\")\r\n", "import math\r\narraySize = 1200000\r\nprimes=[True for i in range(arraySize+1)]\r\n\r\ndef sieveoferatosthenes(n):\r\n i = 2\r\n root = int(math.sqrt(n))\r\n for y in range(i,root):\r\n if (primes[i] == True):\r\n for x in range(i*i,n+1,i):\r\n primes[x]=False\r\n i += 1\r\n\r\ndef ispalindromic(n):\r\n if (n == 0): return True\r\n temp = n\r\n temp2 = 0\r\n while (temp > 0):\r\n temp2 = temp2 * 10 + temp % 10\r\n temp = temp//10\r\n return temp2 == n\r\n\r\ndef primespalindrome(p,q):\r\n sieveoferatosthenes(arraySize)\r\n primes[0]=False\r\n primes[1]=False\r\n pie=0\r\n rub=0\r\n final=-1\r\n for x in range(1,arraySize):\r\n if (primes[x]):\r\n pie+=1\r\n if (ispalindromic(x)):\r\n rub+=1\r\n if(pie * q <= rub * p):\r\n final=x\r\n \r\n if final != -1: \r\n return final \r\n else: \r\n return \"Palindromic tree is better than splay tree.\"\r\n \r\n \r\n\r\nif __name__ == '__main__':\r\n p, q = map(int, input().split(' '))\r\n print(primespalindrome(p,q))", "p, q = map(int,input().split(\" \"))\nmax1 = 1200000\nisPrime = [1] * max1\nisPrime[1] = 0\npalindromic = 1\nres = 1\nfor i in range(2, max1):\n\tif str(i) == str(i)[::-1]:\n\t\tpalindromic += 1\n\tif isPrime[i]:\n\t\tfor j in range(i * i, max1, i):\n\t\t\tisPrime[j] = 0\n\tisPrime[i] += isPrime[i - 1]\n\tif q * isPrime[i] <= p * palindromic:\n\t\tres = i\nprint(res)\n# 21bcm031\n\t\t \t\t \t\t \t\t\t\t \t\t\t \t\t \t \t", "n = 12 * 10 ** 5\np, q = map(int, input().split())\npr = [0] * n\npr[1] = 1\nfor i in range(2, n):\n if pr[i] == 1: continue\n for j in range(2 * i, n, i):\n pr[j] = 1\nres = 'Palindromic tree is better than splay tree'\nrub = pi = 0\nfor i in range(1, n):\n if pr[i] == 0: pi += 1\n if str(i) == str(i)[::-1]: rub += 1\n if pi * q <= rub * p: res = i\nprint(res)\n\t\t\t\t \t\t \t \t\t \t\t \t \t\t\t", "p, q = map(int, input().split())\r\nn = 1200000\r\n\r\ns = [0] * n\r\nt = [q] * n\r\n\r\nfor i in range(3, int(n ** 0.5) + 1, 2):\r\n u, v = i * i, 2 * i\r\n if t[i]: t[u::v] = [0] * ((n - u - 1) // v + 1)\r\nfor i in range(4, n, 2): t[i] = 0\r\nt[0] = t[1] = 0\r\n\r\nfor i in range(1, 10): s[i] = p\r\nfor i in range(1, 1000):\r\n a = str(i)\r\n b = a[::-1]\r\n for j in '0123456789':\r\n c = int(a + j + b)\r\n if c < n: s[c] = p\r\n s[int(a + b)] = p\r\n\r\nfor i in range(n - 1): t[i + 1] += t[i]\r\nfor i in range(n - 1): s[i + 1] += s[i]\r\n\r\nj = 0\r\nfor i, (u, v) in enumerate(zip(t, s)):\r\n if u <= v: j = i\r\nprint(j)", "N = int(2e6+3)\r\nis_prime = [0] * N\r\ndef sieve():\r\n is_prime[1] = 1;\r\n for i in range(2, N):\r\n if is_prime[i] == 1: \r\n continue\r\n for j in range(2*i, N, i):\r\n is_prime[j] = 1\r\n\r\ndef palindrom(s):\r\n return s == s[::-1]\r\n \r\np, q = map(int, input().split())\r\nrub = 0\r\npi = 0\r\nsieve()\r\nfor i in range(1, N):\r\n if is_prime[i] == 0: \r\n pi += 1\r\n if palindrom(str(i)): \r\n rub += 1\r\n if pi * q <= rub * p: \r\n res = i\r\nprint(res)\r\n", "import sys\r\ninput=sys.stdin.readline\r\n\r\ndef rr(n): \r\n a=set([])\r\n # Create a boolean array \"prime[0..n]\" and initialize \r\n # all entries it as true. A value in prime[i] will \r\n # finally be false if i is Not a prime, else true. \r\n prime = [True for i in range(n+1)] \r\n p = 2\r\n while (p * p <= n): \r\n \r\n # If prime[p] is not changed, then it is a prime \r\n if (prime[p] == True): \r\n \r\n # Update all multiples of p \r\n for i in range(p * p, n+1, p): \r\n prime[i] = False\r\n p += 1\r\n \r\n # Print all prime numbers \r\n for p in range(2, n+1): \r\n if prime[p]: \r\n a.add(p)\r\n return a\r\n \r\ndef pal(a):\r\n if str(a)==str(a)[::-1]:\r\n return 1\r\n return 0\r\n\r\np,q=list(map(int,input().split()))\r\nn=1500000\r\na=rr(n)\r\nb=[]\r\nc=0\r\nd=0\r\nfor i in range(1,n+1):\r\n if i in a:\r\n c+=1\r\n d+=pal(i)\r\n b.append([c/d,i])\r\ne=-1\r\nfor i in range(len(b)-1,-1,-1):\r\n if b[i][0]<=p/q:\r\n e=b[i][1]\r\n break\r\nif e==-1:\r\n print(\"Palindromic tree is better than splay tree\")\r\nelse:\r\n print(e)", "\r\nmask = [0] * (10**7+3)\r\n\r\nprime=[]\r\nfor i in range(2,10**7+1):\r\n if mask[i] == 0:\r\n prime.append(i)\r\n for j in range(i,10**7+1,i):\r\n mask[j]+=1\r\n\r\n \r\npals = set()\r\nn = 10**7+1\r\nfor i in range(1, 10):\r\n if i <= n:\r\n pals.add(i)\r\nfor l in range(2, len(str(n))+1):\r\n if l % 2 == 0:\r\n\r\n for i in range(1, 10**(l//2)):\r\n number = int(str(i)+str(i)[::-1])\r\n\r\n if number <= n:\r\n pals.add(number)\r\n else:\r\n for i in range(1, 10**(l//2+1)):\r\n number = int(str(i)+str(i)[:-1][::-1])\r\n if number <= n:\r\n pals.add(number)\r\n \r\n\r\nprime=set(prime)\r\nmax_n=1\r\ncnt_p=0\r\ncnt_r=0\r\np,q=map(int,input().split())\r\n\r\nfor n in range(1,10**7+1):\r\n if n in pals:\r\n cnt_r+=1\r\n if n in prime:\r\n cnt_p+=1\r\n if q*cnt_p<=p*cnt_r:\r\n max_n=n\r\nif max_n!=10**7:\r\n print(max_n)\r\nelse:\r\n print(\"Palindromic tree is better than splay tree\")", "p, q = (int(x) for x in input().split())\ntop = 1200000\nisPrime = [1] * top\nisPrime[1] = 0\npalindromic = 1\nres = 1\nfor i in range(2, top):\n\tif str(i) == str(i)[::-1]:\n\t\tpalindromic += 1\n\tif isPrime[i]:\n\t\tfor j in range(i * i, top, i):\n\t\t\tisPrime[j] = 0\n\tisPrime[i] += isPrime[i - 1]\n\tif q * isPrime[i] <= p * palindromic:\n\t\tres = i\nprint(res)\n", "'''\nCreated on 19 Ağu 2015\n\n@author: enesoncu\n'''\npr = [0]*1300000\ndef prime():\n pr[1] = 1;\n for i in range(2,1300000):\n if pr[i]==1: continue\n for j in range(2*i,1300000,i):\n pr[j] = 1\n \ndef palindrom(s):\n s = str(s)\n return s==s[::-1]\n\n(p,q) = map(int,input().split())\n\nres = \"Palindromic tree is better than splay tree\"\nrub = 0\npi = 0\nprime()\nfor i in range(1,1200000):\n #print(palindrom(i))\n if pr[i]==0: pi += 1\n if palindrom(i): rub += 1\n #print(i,pi,rub)\n if pi*q<=rub*p: res = i\nprint( res )\n ", "import sys\r\ninput = sys.stdin.readline\r\n \r\n# from math import gcd, isqrt, ceil\r\n# from collections import deque\r\n# import bisect #-->For bisect.bisect_left=lower_bound and bisect_right=upper_bound\r\n\r\nt = 1\r\n# t = int(input())\r\nfor _ in range(t):\r\n p, q = map(int, input().split())\r\n top = int(1e7)\r\n isPrime = [1] * top\r\n isPrime[1] = 0\r\n palin = res = 1\r\n for i in range(2, top):\r\n if str(i) == str(i)[::-1]:\r\n palin += 1\r\n if isPrime[i]:\r\n for j in range(i * i, top, i):\r\n isPrime[j] = 0\r\n isPrime[i] += isPrime[i - 1]\r\n if q * isPrime[i] <= p * palin:\r\n res = i\r\n print(res)", "def main():\r\n n = 2 * 10 ** 6\r\n p, q = map(int, input().split())\r\n a = [0] * n\r\n a[1] = 1\r\n for i in range(2, n):\r\n if a[i] == 1: continue\r\n for j in range(2 * i, n, i):\r\n a[j] = 1\r\n ans = 'Palindromic tree is better than splay tree'\r\n rub = pi = 0\r\n for i in range(1, n):\r\n if a[i] == 0:\r\n pi += 1\r\n if str(i) == str(i)[::-1]:\r\n rub += 1\r\n if pi * q <= rub * p:\r\n ans = i\r\n print(ans)\r\nmain()\r\n" ]

[ "a, k = map(int, input().split())\r\nsm = 0\r\nfor i in range(1, a + 1):\r\n r = str(i)\r\n sm += int(r + r[::-1])\r\n sm %= k\r\nprint(sm % k)", "k, p = map(int, input().split())\r\nres = 0\r\nfor i in range(1, k+1):\r\n res += int(str(i)+(str(i)[::-1]))\r\n res %= p\r\nprint(res)", "k,p=list(map(int,input().split()))\r\na=0\r\nfor i in range(1,k+1):\r\n s=str(i)\r\n a=(a+int(s+s[::-1]))%p\r\nprint(a)", "input1 = input(\"\").split(\" \")\n\nk = int(input1[0])\np = int(input1[1])\n\nsumNumbers = 0\n\nfor i in range(1,k+1,1):\n num = int(str(i) + str(i)[::-1])\n sumNumbers += num\n\nprint(sumNumbers % p)", "n,mod=map(int,input().split())\r\nsum=0\r\nfor i in range(1,n+1):\r\n s=str(i);\r\n t=s[::-1]\r\n sum+=int(s+t)\r\n sum%=mod\r\nprint(sum)", "import sys\n\nfrom functools import reduce\n\ncnt = 1\narr = []\nn, k = map(int, sys.stdin.readline().strip().split())\nwhile cnt <= n:\n\tst = str(cnt)\n\tarr.append(int(st + st[::-1]))\n\t# print(arr[cnt-1])\n\tcnt += 1\n\ncnt = 1\nans = reduce(lambda x, y: (x+y)%k, arr)\nsys.stdout.write(str(ans%k))", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nk, p = map(int, input().split())\r\nans = 0\r\nfor i in range(1, k + 1):\r\n u = int(str(i) + str(i)[::-1])\r\n ans += u\r\n ans %= p\r\nprint(ans)", "n, m = map(int, input().split())\nsm = 0\nfor i in range(1, n + 1):\n s = str(i)\n sm += int(s + s[::-1])\nprint(sm % m)", "def getdouble(a):\r\n a=list(str(a))\r\n b=a[::-1]\r\n result=''\r\n for i in a:\r\n result+=i\r\n for i in b:\r\n result+=i\r\n return int(result)\r\nsum=0\r\nlists=list(map(int,input().split(' ')))\r\nfor i in range(1,lists[0]+1):\r\n sum+=getdouble(i)\r\nprint(sum%lists[1])", "def get_zcy(n:int) -> int:\n str_n = str(n)\n res = str_n + str_n[::-1]\n return int(res)\n\n\ndef main():\n res = 0\n inp = input().split()\n k = int(inp[0])\n p = int(inp[1])\n s = 0\n for i in range(1, k + 1):\n s += get_zcy(i)\n print(s % p)\n\nif __name__ == \"__main__\":\n main()\n", "def reverse(s):\r\n s1=''\r\n for i in range(len(s)-1,-1,-1):\r\n s1=s1+s[i]\r\n return s1\r\ndef main():\r\n s = input()\r\n s = list((s.split()))\r\n k = int(s[0])\r\n p = int(s[1])\r\n a = 0\r\n for i in range(1, k+1):\r\n s = str(i)\r\n s1 = reverse(s)\r\n #print(s, ' ! ', s1)\r\n s = int(s + s1)\r\n a = (a + s)%p\r\n print(a % p)\r\nmain()", "\r\ndef rev(n):\r\n return str(n)+(str(n))[::-1]\r\nif __name__==\"__main__\":\r\n n,k=map(int,input().split())\r\n sum=0\r\n for i in range(1,n+1):\r\n sum+=int(rev(i))\r\n print(sum%k)\r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n", "k,p = [int(i) for i in input().split()]\r\nsum = 0\r\nfor i in range(1,k+1):\r\n sum+= int(str(i)+str(i)[::-1])\r\nprint(sum%p)\r\n", "k, p = map(int, input().split())\r\nsum = 0\r\nwhile k:\r\n\ts = str(k)\r\n\tt = s[::-1]\r\n\tn = int(s + t)\r\n\tsum = (sum + n) % p\r\n\tk -= 1\r\nprint(sum)", "k, p = map(int, input().split())\r\ntotal = 0\r\nfor half_zcy in range(1,k+1):\r\n current_zcy = int(str(half_zcy) + str(half_zcy)[::-1])\r\n total += current_zcy\r\nprint(total % p) \r\n", "k,p=map(int,input().split())\r\nlis=[]\r\nfor i in range(1,1000000):\r\n lis.append(i)\r\nans=0\r\ndef reverse(s):\r\n st = \"\"\r\n for i in s:\r\n st = i + st\r\n return st\r\nfor i in range(1000000):\r\n d=int(str(lis[i])+reverse(str(lis[i])))\r\n # print(d)\r\n ans+=d\r\n ans=ans%p\r\n k-=1\r\n if(k==0):\r\n break\r\nprint(ans)\r\n", "k,p=map(int,input().split())\r\nx=0\r\nfor i in range(1,k+1):\r\n s=str(i)+str(i)[::-1]\r\n x+=int(s)\r\nprint(x%p)", "n, p = map(int, input().split())\r\nprint(sum(int(str(i) + str(i)[ : :-1]) for i in range(1, n + 1)) % p)", "k, p = map(int ,input().split())\r\nres=0\r\nfor i in range(1, k+1):\r\n res+=int(str(i)+str(i)[::-1])\r\n res=res%p;\r\nprint(res)\n# Tue Feb 01 2022 14:59:23 GMT+0000 (Coordinated Universal Time)\n", "k, p = map(int, input().split())\r\ns=0\r\nn=0\r\nhalf=1\r\nwhile n<k:\r\n s+=int(str(half)+str(half)[::-1])\r\n n+=1\r\n half+=1\r\nprint(s%p)\r\n", "R=lambda:list(map(int,input().split()))\r\n\r\nk, p = R()\r\nprint(sum([int(x+x[::-1])for x in map(str,range(k+1))])%p)", "\ndef main():\n inp = input()\n sum = 0\n no1 = int(inp.split()[0])\n no2 = int(inp.split()[1])\n for i in range(1, no1 + 1):\n sum += int(str(i) + str(i)[::-1]) % no2\n sum = sum % no2\n print(sum)\n\nif __name__ == '__main__':\n main()\n", "import itertools as it\nk, p = [int(elem) for elem in input().split()]\n\ndef build_palindroms(digits):\n global k\n global val\n n = digits // 2\n values = [10 ** (digits - 1 - i) + 10 ** i for i in range(n)]\n for comb in it.product(range(1, 10), *[range(0, 10) for i in range(n - 1)]):\n if not k:\n return False\n for j, dig in enumerate(comb):\n val += dig * values[j]\n k -= 1\n return True\nval = 0\nj = 2\nwhile build_palindroms(j):\n j += 2\n\nprint(val % p)\n", "import sys\r\n\r\nk,p=map(int,sys.stdin.readline().split())\r\nzcy=[]\r\n\r\nfor i in range(1,k+1):\r\n s =str(i)\r\n\r\n t = s+s[::-1]\r\n zcy.append(int(t))\r\n\r\nres = sum(zcy)\r\nprint(res%p)", "a,b=map(int,input().split())\r\nd=[]\r\nfor i in range(1,a+1):\r\n s=str(i)\r\n s0=s+s[::-1]\r\n d.append(int(s0))\r\ncc=sum(d)\r\nprint(cc%b)\r\n", "from sys import stdin\r\nk,p = map(int,stdin.readline().split())\r\na = []\r\nfor i in range(1,k+1):\r\n a.append(int(str(i) + str(i)[::-1]))\r\nprint(sum(a) % p) \r\n\r\n", "k, p=map(int, input().split()); i=0; s=0 \r\nfor t in range(1, k+1):\r\n \r\n \r\n s+=int(str(t)+str(t)[::-1])%p\r\n \r\n \r\nprint (s%p)\r\n", "k, p = [int(e) for e in input().split()]\r\nsumma = 0\r\nfor i in range(1, k+1):\r\n\tsumma += int(str(i) + str(i)[::-1])\r\nprint(summa % p)", "k,p=map(int,input().split())\r\nans=0\r\nfor i in range(1,k+1):\r\n a=str(i)\r\n a+=a[::-1]\r\n ans+=int(a)\r\n if ans>=p:\r\n i=ans//p\r\n ans=ans-i*p\r\nprint(ans)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Dec 7 21:03:31 2017\r\n\r\n@author: ms\r\n\"\"\"\r\n\r\ndef create_zcy_for(n):\r\n zcy_list = []\r\n start = 10**int(n/2-1)\r\n stop = 10**int(n/2)\r\n \r\n for i in range(start, stop):\r\n tmp = str(i)\r\n zcy = int(tmp + tmp[::-1])\r\n zcy_list.append(zcy)\r\n \r\n return zcy_list\r\n \r\ndef main():\r\n nums = [int(n) for n in input().split()]\r\n \r\n k = nums[0]\r\n p = nums[1]\r\n \r\n counter = 2\r\n zcy_list = create_zcy_for(counter)\r\n \r\n while(len(zcy_list)<k):\r\n counter += 2\r\n tmp = create_zcy_for(counter)\r\n zcy_list = zcy_list + tmp\r\n \r\n res = sum(zcy_list[0:k]) % p\r\n\r\n print(res)\r\n return res\r\n\r\nif __name__ == \"__main__\":\r\n main()", "a, b = map(int,input().split())\r\n\r\nsumx = 0\r\nfor i in range(1,a+1):\r\n s = str(i)\r\n l = len(s)\r\n for j in range(l-1,-1,-1):\r\n s = s + s[j]\r\n i = int(s)\r\n sumx = sumx + i\r\n\r\nprint(sumx % b) \r\n \r\n ", "from functools import reduce\n\nk, p = map(int, input().split())\nans = [0]\nfor x in range(1, k+1):\n ans.append(int(str(x)+str(x)[::-1]))\nprint(reduce(lambda a, b: (a + b) % p, ans))\n", "k,p=map(int,input().split())\r\nans=0;\r\nfor i in range(k+1):\r\n x=str(i)+str(i)[::-1]\r\n ans=(ans+int(x))%p\r\nprint(ans)", "k,p=map(int,input().split())\r\ns=0\r\nfor i in range(k):\r\n s+=int(str(i+1)+str(i+1)[::-1])\r\nprint(s%p)", "n,p=map(int,input().split())\nans=0\nfor i in range(1,n+1):\n\ta=str(i);i=int(a+a[::-1])\n\tans+=i;ans%=p\nprint(ans)", "def rev(x):\r\n s = x\r\n j = len(x)-1\r\n while(j>=0):\r\n s+=x[j]\r\n j-=1\r\n return s\r\n\r\ndef main():\r\n a,b = map(int,input().split(None,2)[:2])\r\n s = 1\r\n t = 0\r\n while(s<=a):\r\n p = rev(str(s))\r\n p = int(p)\r\n t+=p\r\n s+=1\r\n print(t%b)\r\n\r\n\r\nif __name__==\"__main__\":\r\n main()\r\n", "k, p = map(int, input().split())\r\nnum = 11\r\nres = 0\r\nwhile k:\r\n z = int(str(k) + str(k)[::-1])\r\n res += z\r\n k -= 1\r\nprint(res % p)\r\n\n# Sat Jan 22 2022 18:24:54 GMT+0000 (Coordinated Universal Time)\n", "k, p = input().split(' ')\nres = [int(str(x) + ''.join(list(str(x))[::-1])) for x in range(1, int(k)+1)]\nprint(sum(res)%int(p))\n", "k,p=map(int,input().split())\r\nsum=0\r\nwhile(k):\r\n sum+=int(str(k)+str(k)[::-1])\r\n k-=1\r\nprint(sum%p)", "def make(k):\r\n s=str(k)\r\n t=''\r\n for i in s:\r\n t=i+t\r\n return int(s+t)\r\nk,p=map(int,input().split())\r\n\r\nsumm=0\r\nfor i in range(1,k+1):\r\n summ+=make(i)\r\nsumm=summ%p\r\nprint(summ)\r\n\r\n \r\n", "k,p=map(int,input().split())\r\nprint(sum(int(str(i)+str(i)[::-1]) for i in range(1,k+1))%p)", "a = []\r\na = list(map(int, input().split()))\r\nk = a[0]\r\np = a[1]\r\nsum = 0\r\nfor i in range (1, k + 1):\r\n s = (str)(i)\r\n s += (s[::-1])\r\n n = (int)(s)\r\n sum = (sum + n) % p\r\nprint(sum)\r\n", "k,p = [int(i) for i in input().split()]\r\nsum = 0\r\nfor i in range(1,k+1):\r\n sum = sum + int(str(i) + str(i)[::-1]) % p\r\nprint(sum % p)\n# Sat Jan 22 2022 17:31:39 GMT+0000 (Coordinated Universal Time)\n", "masukkan = input().split()\r\nk = int(masukkan[0])\r\np = int(masukkan[1])\r\nhasil = 0\r\nfor i in range(1, k+1):\r\n hasil += int(str(i)+str(i)[::-1])\r\n\r\nhasil %= p\r\nprint(hasil)\r\n", "k,p=map(int,input().split())\r\nsum=0\r\nfor i in range(1,k+1):\r\n\tsum+=(int(str(i)+str(i)[::-1])%p)\r\nprint(sum%p)", "k=input()\na=k.split(\" \")\n#print(a[0])\n#print(a[1])\nresult=0\nfor i in range(1,int(a[0])+1):\n s=str(i)\n #print(s)\n ss=s+s[::-1]\n #print(ss)\n result=(result+int(ss))%int(a[1])\nprint(result)\n", "\r\ndef GeneratePalindroms():\r\n i = 1\r\n while True:\r\n ii = 10 * i\r\n r = range(i, ii)\r\n for j in r:\r\n s = str(j)\r\n yield s + s[-2::-1]\r\n for j in r:\r\n s = str(j)\r\n yield s + s[::-1]\r\n i = ii\r\n\r\n\r\nk, p = input().strip().split()\r\nk = int(k)\r\np = int(p)\r\n \r\ntotal = 0\r\nfor i, s in enumerate(GeneratePalindroms(), 1):\r\n if k <= 0:\r\n break\r\n if (len(s) % 2) == 0:\r\n total += int(s)\r\n k -= 1\r\n\r\nprint(total % p)\r\n", "import sys\nfrom functools import reduce\nn, k = map(int, sys.stdin.readline().strip().split())\nsys.stdout.write(str(reduce(lambda x, y: (x+y)%k, map(lambda i: int(i + i[::-1]), [str(i) for i in range(1, n+1)]))%k))", "k,p = list(map(int,input().split()))\na=0\nfor i in range(1,k+1):\n s = str(i)\n a = (a+int(s+s[::-1]))%p\nprint(a)", "k, p = map(int, input().split())\r\ndp = [11]\r\nfor i in range(2, k + 1):\r\n x = str(i)\r\n x = x + x[::-1]\r\n dp.append(dp[i - 2] + int(x))\r\nprint(dp[k - 1] % p)", "k,p=map(int,input().split())\r\ns = 0\r\nwhile(k):\r\n s += int(str(k)+str(k)[::-1])\r\n k -= 1\r\nprint(s%p)", "k,p=map(int,input().strip().split(' '))\r\n\r\ni=1\r\nret=0\r\nwhile k:\r\n ret=ret+int(str(i)+str(i)[::-1])\r\n k=k-1;i=i+1\r\nprint(ret%p)\r\n", "k,p= map (int, input().split())\n\nsum=0\n\nfor x in range (1,k+1):\n s= str(x) + str(x)[::-1]\n sum += int(s)%p\nprint(sum%p)\n", "k, p = input().split()\r\n\r\nk = int(k)\r\n\r\np = int(p)\r\n\r\nans = 0\r\n\r\na = 0\r\n\r\nwhile (k > 0):\r\n a += 1\r\n \r\n a = str(a)\r\n \r\n ans += int(a + (a[::-1]))\r\n \r\n a = int(a)\r\n \r\n k -= 1\r\n \r\nprint(ans % p)", "a=[]\r\na=['00']\r\nfor i in range(1,10):\r\n a.append(i*11)\r\nd=4\r\nl=1\r\nce=9\r\nn=9\r\nwhile n<100001:\r\n ce=n\r\n for i in a[l:]:\r\n for j in a[0:10]:\r\n s=str(i)[:(d//2-1)]+str(j)+str(i)[(d//2-1):]\r\n a.append(int(s))\r\n n+=1\r\n if n>100001:\r\n break\r\n l=ce+1\r\n d+=2\r\nss=[a[1]]\r\nfor i in range(2,len(a)):\r\n ss.append(ss[i-2]+int(a[i]))\r\na=[int(i) for i in input().split()]\r\nprint(ss[a[0]-1]%a[1])\r\n", "n,m = map(int, input().split())\r\nsum = 0\r\nfor i in range(n):\r\n\tsum += int(str(i+1)+str(i+1)[::-1])\r\nprint(sum % m)", "from sys import stdin\r\nk,p=list(map(int,stdin.readline().strip().split(' ')))\r\ni='1'\r\ns=0\r\nwhile k>0:\r\n s+=int(i+i[::-1])\r\n k-=1\r\n i=str(int(i)+1)\r\nprint(s%p)\r\n", "from sys import stdin,stdout\r\nfrom collections import Counter\r\ndef ai(): return list(map(int, stdin.readline().split()))\r\ndef ei(): return map(int, stdin.readline().split())\r\ndef ip(): return int(stdin.readline().strip())\r\ndef op(ans): return stdout.write(str(ans) + '\\n')\r\n\r\nn,k = ei()\r\nans = 0\r\nfor i in range(1,n+1):\r\n\tans += int(str(i)+str(i)[::-1])\r\nop(ans%k)", "k, p = map(int,input().split())\r\ns = 0\r\na = 1\r\nfor i in range(1, k+1):\r\n x=str(a)\r\n x+=x[::-1]\r\n s +=int(x) \r\n a += 1\r\nprint(s%p)", "\r\n\r\ndef construirPalindromos(k):\r\n suma=0\r\n for i in range(k):\r\n izq = str(i + 1)\r\n der = izq[::-1]\r\n palindromo = int(izq + der)\r\n suma += palindromo\r\n return suma\r\n\r\n\r\nentrada=str(input(\"\"))\r\nsplit=entrada.split(\" \")\r\nk=int(split[0])\r\np=int(split[1])\r\nprint(construirPalindromos(k)%p)\r\n\r\n\r\n\r\n", "k,p=input().split()\r\nk=int(k)\r\np=int(p)\r\nans=0\r\nfor i in range (1,k+1):\r\n n=i\r\n m=i\r\n while n:\r\n m=m*10+n%10\r\n n//=10\r\n ans+=m\r\nprint(ans%p)\r\n", "k,p=map(int, input().split());\r\nret = 0;\r\nfor i in range(1,k+1):\r\n ii = str(i);\r\n ii = ii[::-1];\r\n jj = str(i);\r\n s = jj + ii;\r\n # print(s);\r\n ret = (ret + int(s)) % p;\r\nprint (ret);\r\n", "R=lambda:map(int,input().split())\r\n\r\nk, p = R()\r\n\r\ns =0\r\n\r\nfor i in range(1, k + 1 ):\r\n x = i\r\n temp = str(x)\r\n temp = temp + temp[::-1]\r\n temp = int(temp)\r\n s = (s + temp) % p\r\n\r\nprint(s)", "k, p = [int(x) for x in input().split()]\r\n\r\ndef zcy(n):\r\n if str(n) == str(n)[::-1] and len(str(n)) % 2 == 0:\r\n return True\r\n else:\r\n return False\r\n\r\ndef obrat(n):\r\n return n * 10 ** len(str(n)) + int(str(n)[::-1])\r\n\r\nsumma = 0\r\n\r\nfor i in range(k):\r\n summa += obrat(i + 1)\r\n \r\nprint(summa % p)", "k, p = [int(x) for x in input().split()]\nsum = 0;\n \nfor i in range(1, k + 1):\n number = str(i) + str(i)[::-1]\n sum += int(number)\nprint(sum % p)\n \n ", "list = []\r\nqueries = [int(i) for i in input().split()]\r\nk = int(queries[0])\r\nmod = int(queries[1])\r\n\r\nfor i in range(1, k + 1): \r\n\ti = str(i)\r\n\tcon = i[::-1]\r\n\tnew = i + con\r\n\tlist.append(new)\r\n\r\nlength = len(list)\r\nsum = 0\r\nfor i in range(length): \r\n\tsum += int(list[i])\r\n\r\nans = sum % mod\r\nans = str(ans)\r\nprint(ans)", "a,b = map(int, input().split(\" \"))\r\n\r\nsum = 0\r\ncount = 0\r\nnum = 0\r\n\r\nwhile(count < a):\r\n\tif num:\r\n\t\tf = str(num)\r\n\t\tl = f[::-1]\r\n\t\tsum += int(f+l)\r\n\t\tcount += 1\r\n\tnum = num+1\r\nprint(sum%b)", "def main():\r\n\r\n sum = 0\r\n input_line = list(map(int, input().split()))\r\n\r\n for n in range(1, input_line[0]+1):\r\n str1 = str(n)\r\n str2 = str1[::-1]\r\n sum += int(str1 + str2)\r\n\r\n print (sum % input_line[1])\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "k, p = map(int, input().split())\nz = 0\nfor i in range(1, k + 1):\n z = (z + int(str(i) + str(i)[::-1])) % p\nprint(z)", "k,p = map(int,input().split())\r\n\r\nx = []\r\nfor i in range(k+1):\r\n x.append(int(str(i) + str(i)[::-1]))\r\nprint(sum(x) % p)", "k, p = map(int, input().split())\r\ncounter = 0\r\nn = 0\r\nsumma = 0\r\nwhile counter < k:\r\n n += 1\r\n n1 = str(n)\r\n listN = list(n1)\r\n reversedN = \"\".join(listN[::-1])\r\n listN.append(reversedN)\r\n finalN = \"\".join(listN)\r\n finalNN = int(finalN)\r\n counter += 1\r\n summa += finalNN\r\nprint(summa % p)\r\n", "k_numbers, mod_p = [int(x) for x in input().split()]\r\n\r\ncounter = 0\r\ncur_sum = 0\r\ncur_length = 2\r\n\r\nfor i in range(1, k_numbers+1):\r\n czy = int(str(i) + str(i)[::-1])\r\n #print(czy)\r\n cur_sum += czy\r\n cur_sum = cur_sum % mod_p\r\n\r\nprint(cur_sum)\r\n", "l=[i for i in input().split()]\nk,p,sum=int(l[0]),int(l[1]),0\nfor i in range(1,k+1):\n j=str(i)+(str(i)[::-1])\n #print(j)\n sum=(sum+int(j))%p\nprint(sum)", "k, p = map(int, input().split())\nsum = 0\nfor i in range(1, k + 1):\n\tcur = int(\"{}{}\".format(str(i), str(i)[::-1]))\n\tsum += cur\nprint(sum % p)\n", "k,p = map(int,input().split())\r\na = (int(str(i)+str(i)[::-1]) for i in range(1,k+1))\r\n#print(a)\r\nprint(sum(a)%p)", "n,m=map(int,input().split())\r\nprint(sum(int(str(i)+str(i)[::-1]) for i in range(1,n+1))%m)\r\n", "#Indeed, python would have been good choice.\r\n\r\nn,p=map(int,input().split())\r\nans=0\r\nfor i in range(1,n+1):\r\n num=str(i)\r\n num=num+num[::-1]\r\n ans+=int(num)\r\nprint(ans%p) ", "'''input\n5 30\n'''\nk, p = map(int, input().split())\nz = [int(str(x)+str(x)[::-1]) for x in range(1, 10**5+1)]\nprint(sum(z[:k]) % p)", "k,p=map(int, input().split())\r\ns=0\r\n\r\nfor i in range(k):\r\n s+=int(str(i+1)+str(i+1)[: : -1])\r\n \r\nprint(s%p)\r\n", "k,p= map (int, input().split())\r\n\r\nsum=0\r\ncnt=2\r\ncount=0\r\ni=1\r\n\r\nfor x in range (1,k+1):\r\n\tsum=(sum+int(str(x)+str(x)[::-1]))%p\r\nprint(sum%p)\r\n", "\r\nnum, divisor = map(int, input().split())\r\nadd = 0\r\nfor i in range(0,num):\r\n i = int(str(i+1) + str(i+1)[::-1])\r\n add +=i\r\n\r\nres = add % divisor\r\n\r\nprint(res)\r\n", "a, b=map(int,input().split())\r\ns = 0\r\nfor i in range(a):\r\n s += int(str(i+1)+(str(1+i)[::-1]))\r\nprint(s%b)", "def calc(k):\r\n return (2 ** k - 1) * (2 ** (k - 1))\r\n\r\n\r\ndef main():\r\n k, p = map(int, input().split())\r\n\r\n res = 0\r\n\r\n for i in range(k + 1):\r\n res = (res + int(str(i) + str(i)[::-1])) % p\r\n\r\n print(res)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "if __name__ == '__main__':\r\n k, p = [int(i) for i in input().strip().split(\" \")]\r\n s = 0\r\n for i in range(1, k + 1):\r\n s += int(str(i) + str(''.join(list(reversed(str(i))))))\r\n print(s % p)\r\n", "# auther : Jay Saha\r\nimport math as mt\r\nimport sys\r\nimport string\r\nfrom collections import Counter, defaultdict\r\n\r\n\r\ndef I(): return int(input())\r\ndef M(): return map(int, input().split())\r\ndef ARR(): return list(map(int, input().split()))\r\n\r\n\r\ndef rev(s):\r\n rev_s = \"\"\r\n for elm in s:\r\n rev_s = elm + rev_s\r\n return rev_s\r\n\r\n\r\ndef main():\r\n k, p = M()\r\n ans = 0\r\n for i in range(1, k+1):\r\n a = str(i)\r\n b = rev(a)\r\n a += b\r\n ans = (ans + int(a)) % p\r\n print(ans)\r\n\r\n\r\ntc = 1\r\n# tc = I()\r\nfor _ in range(tc):\r\n main()\r\n", "actual = []\r\nfor i in range(1,10):\r\n num = str(i)\r\n actual.append(int(num+num[::-1]))\r\nfor i in range(1,10):\r\n for j in range(0,10):\r\n num = str(i)+str(j)\r\n actual.append(int(num+num[::-1]))\r\nfor i in range(1,10):\r\n for j in range(0,10):\r\n for k in range(0,10):\r\n num = str(i)+str(j)+str(k)\r\n actual.append(int(num+num[::-1]))\r\nfor i in range(1,10):\r\n for j in range(0,10):\r\n for k in range(0,10):\r\n for z in range(0,10):\r\n num = str(i)+str(j)+str(k)+str(z)\r\n actual.append(int(num+num[::-1]))\r\nfor i in range(1,10):\r\n for j in range(0,10):\r\n for k in range(0,10):\r\n for z in range(0,10):\r\n for a in range(0,10):\r\n num = str(i)+str(j)+str(k)+str(z)+str(a)\r\n actual.append(int(num+num[::-1]))\r\nactual.append(actual[-1]+2)\r\nk, p = tuple(map(int, input().split()))\r\nans = 0\r\nfor i in range(k):\r\n ans = (ans+actual[i])%p\r\nprint(ans)", "import sys\r\nkp=sys.stdin.read().split()\r\nk=int(kp[0])\r\np=int(kp[1])\r\nhe=0\r\nfor i in range(1,k+1):\r\n if i<10:\r\n he+=i*10+i\r\n elif i<100:\r\n unit=i%10\r\n digit=i%100//10\r\n he+=i*100+unit*10+digit\r\n elif i<1000:\r\n unit=i%10\r\n digit=i%100//10\r\n hundred=i%1000//100\r\n he+=i*1000+unit*100+digit*10+hundred\r\n elif i<10000:\r\n unit=i%10\r\n digit=i%100//10\r\n hundred=i%1000//100\r\n thousand=i%10000//1000\r\n he+=i*10000+unit*1000+digit*100+hundred*10+thousand\r\n elif i<100000:\r\n unit = i % 10\r\n digit = i % 100//10\r\n hundred = i % 1000//100\r\n thousand = i % 10000//1000\r\n wan = i % 100000//10000\r\n he += i * 100000+unit*10000+digit*1000+hundred*100+thousand*10+wan\r\n elif i==100000:\r\n he+=100000000001\r\nfinal=he%p\r\nprint(final)", "from string import *\r\n\r\nk,p=map(int,input().split())\r\n\r\nsum=0\r\nfor i in range(1,k+1):\r\n s=str(i)+''.join(reversed(str(i)))\r\n sum=(sum+(int(s))%p)%p\r\n \r\nprint(sum)", "l = []\r\n\r\ndef start():\r\n\t# global l\r\n\tl.append(0)\r\n\tfor i in range(1, 100001):\r\n\t\tx = str(i)\r\n\t\ty = x+x[::-1]\r\n\t\tl.append(int(y))\r\n\tfor i in range(1, 100001):\r\n\t\tl[i] += l[i-1]\r\n\r\nif __name__ == '__main__':\r\n\t# global l\r\n\tstart()\r\n\tm = input().split()\r\n\tk = m[0]\r\n\tk = int(k)\r\n\tp = m[1]\r\n\tp = int(p)\r\n\tprint(l[k] % p)\r\n", "from string import *\n\nk, p = map(int, input().split())\n\nans = 0\nfor i in range(1,k+1):\n\n\tval = str(i) + ''.join(reversed(str(i)))\n\tans = ans + ((int(val))%p)\n\tans = ans % p\n\nprint(ans)", "def zc(n):\r\n ans=0\r\n for i in range(1,n+1):\r\n ok=int(str(i)+str(i)[::-1])\r\n ans+=ok\r\n return ans\r\n\r\nn,k=map(int,input().split())\r\nprint(zc(n)%k)\r\n\r\n", "def main(length, r, num, rev, length2):\r\n global left, res, p\r\n if length == 0:\r\n if left == 0:\r\n return\r\n res += num * r * 10 + rev\r\n res %= p\r\n left -= 1\r\n else:\r\n for j in range(10):\r\n if left == 0:\r\n return\r\n main(length - 1, r, num * 10 + j, j * (10 ** length2) + rev, length2 + 1)\r\n\r\nk, p = map(int, input().split())\r\nleft = k\r\nres = 0\r\nindicator = True\r\nfor length in range(1, 100):\r\n if not indicator:\r\n break\r\n r = 10 ** (length - 1)\r\n for i in range(1, 10):\r\n if left == 0:\r\n indicator = False\r\n break\r\n main(length - 1, r, i, i, 1)\r\nprint(res)", "x = input().split()\r\nk = int(x[0])\r\np = int(x[1])\r\nr=0\r\nfor i in range(1, k+1):\r\n t=str(i)\r\n r+=int(t+t[::-1])\r\nprint (r%p)", "a,b=map(int,input().split())\r\ns=0\r\nfor i in range(1,1+a):s=((s)%b+(int(str(i)+str(i)[::-1]))%b)%b\r\nprint(s)", "k,p = input().split()\r\nk = int(k)\r\np = int(p)\r\ni = 1\r\nsum = 0\r\n\r\nwhile k > 0:\r\n m = int(str(k)[::-1])\r\n n = k*(10**len(str(k)))\r\n sum += (m+n)\r\n i += 1\r\n k -= 1\r\n\r\nprint(sum%p)", "\narr = [int(x) for x in input().split()]\n\n\nans = []\n\ni = 1\nwhile True:\n if len(ans)==arr[0]:\n print(sum(ans)%arr[1])\n break\n ans.append(int(str(i)+str(i)[::-1]))\n i+=1\n\n\n\n\n", "n,k=map(int,input().split())\r\ns=0\r\nfor i in range(1,n+1):\r\n num=str(i)\r\n rnum=num[::-1]\r\n num=num+rnum\r\n s+=int(num)\r\nprint(s%k)", "import sys\r\nfrom math import sqrt,ceil,floor,gcd\r\nfrom collections import Counter\r\n\r\ninput = lambda:sys.stdin.readline()\r\n\r\ndef int_arr(): return list(map(int,input().split()))\r\ndef str_arr(): return list(map(str,input().split()))\r\ndef get_str(): return map(str,input().split())\r\ndef get_int(): return map(int,input().split())\r\ndef get_flo(): return map(float,input().split())\r\ndef lcm(a,b): return (a*b) // gcd(a,b)\r\n\r\nmod = 1000000007\r\n\r\ndef solve(n,k):\r\n tot = 0\r\n tmp = 1\r\n for i in range(n):\r\n tot += int(str(tmp)+str(tmp)[::-1])\r\n tmp += 1\r\n\r\n print(tot%k)\r\n\r\n\r\n\r\n\r\n# for _ in range(int(input())):\r\nn,k = get_int()\r\nsolve(n,k)", "def szy_list():\r\n n = 0\r\n while 1:\r\n n = n+1\r\n fore = str(n)\r\n rear = \"\".join(list(reversed(fore)))\r\n num = int(fore+rear)\r\n yield num\r\n\r\nnum,mod = map(int,input().split())\r\nf = szy_list()\r\nx,sum = [0,0]\r\nfor n in f:\r\n if x<num:\r\n sum += n\r\n x += 1\r\n else:\r\n break\r\n\r\nprint(sum%mod)\r\n", "k, p = map(int, input().split())\r\nans = 0\r\nfor i in range(1, k + 1):\r\n ans = (ans + ((i * (10 ** len(str(i)))) % p + int(\"\".join(list(reversed(str(i))))) % p)) % p\r\nprint(ans)", "def next_zcy(n):\n\tl = int(len(n)/2)\n\ttemp = l\n\ts = [str(i) for i in str(n)]\n\twhile s[l-1] == '9' and s[len(n)-l] == '9' and l > 0:\n\t\ts[l-1] = '0'\n\t\ts[len(n)-l] = '0'\n\t\tl -= 1\n\tif l == 0:\n\t\treturn int(''.join(['1'] + ['0']* (2*temp) + ['1']))\n\telse:\n\t\ts[l-1] = str(int(s[l-1]) + 1)\n\t\ts[len(n)-l] = str(int(s[len(n)-l]) + 1)\n\t\treturn int(''.join(s))\nn,p = map(int,input().split())\nctr = ans = 0\nnum = 11\nwhile ctr < n:\n\tans += num % p\n\tctr+=1\n\tnum = next_zcy(str(num))\nprint(ans%p)", "KveP=input().split(\" \")\r\nk=int(KveP[0])\r\np=int(KveP[1])\r\ntoplam=0\r\ndef palindromBul(sayi):\r\n yazi=str(sayi)\r\n yaziUzunlugu=len(yazi)\r\n tersYazi=\"\"\r\n for harf in range(yaziUzunlugu):\r\n tersYazi+=yazi[yaziUzunlugu-harf-1]\r\n #yazinin son harfinden geriye doğru\r\n #tersyazi string'ine ekliyoruz\r\n return int(yazi+tersYazi)\r\n\r\nfor sayi in range(1,k+1):\r\n toplam+=palindromBul(sayi)\r\n\r\nprint(toplam%p)\r\n\r\n", "k, p = map(int, input().split())\r\nz = 0\r\nfor i in range(1, k + 1):\r\n z = (z + int(str(i) + str(i)[::-1])) % p\r\nprint(z)\r\n", "k, p = map(int, input().strip().split())\n\ncur_sum = 0\n\nfor i in range(k + 1):\n\tnum = int(str(i) + str(i)[::-1])\n\t# print(num)\n\tcur_sum = (cur_sum + num) % p\nprint(cur_sum)", "from itertools import *\r\n\r\n\r\nk, p = map(int, input().split())\r\nss = 0\r\nfor i in range(1, k + 1):\r\n s = str(i)\r\n num = int(s + ''.join(reversed(s)))\r\n ss += num\r\n ss %= p\r\nprint(ss)", "\ndef main():\n\t\n\tk,p = map(int, input().split())\n\n\tres = 0\n\tfor i in range(1,k+1):\n\t\ts = str(i)\n\t\ts += s[::-1]\n\t\tres += (int(s) % p)\n\t\tres %= p\n\n\tprint(res)\n\n\n\nmain()\n", "import sys, math\r\nfrom itertools import permutations\r\n\r\nDEBUG = 0\r\nif DEBUG:\r\n f = open(\"input.txt\", \"r\")\r\n input = f.readline\r\nelse:\r\n input = sys.stdin.readline\r\n\r\ndef mp():\r\n return list(map(int, input().split()))\r\n\r\ndef main():\r\n k, p = mp()\r\n ans = 0\r\n for i in range(1, k + 1):\r\n ans += int(str(i) + \"\".join(list(reversed(str(i)))))\r\n ans %= p\r\n print(ans)\r\nmain()", "import sys\r\n\r\nk,p=map(int,sys.stdin.readline().split())\r\nans=0\r\nans2=0\r\ni=1\r\nwhile ans2<k:\r\n s=str(i)\r\n\r\n ans+=int(s+s[::-1])\r\n ans2+=1\r\n i+=1\r\n\r\nprint(ans%p)", "a, b = map(int,input().split())\r\ns = '11'\r\nk = 11\r\nm = ''\r\nfor i in range(a - 1):\r\n\tm = str(int(s[0: len(s) // 2]) + 1)\r\n\ts = m + m[::-1]\r\n\tk += int(s)\r\nprint(k % b)\r\n", "k, p = input().split()\r\np = int(p)\r\nans = 0\r\nfor i in range(1, int(k) + 1):\r\n\tnr = str(i) + str(i)[::-1]\r\n\tans += int(nr)\r\n\t#print(ans)\r\n\tans %= p\r\nprint(ans)", "l=input()\nk,p=l.split(' ')\nk=int (k)\np=int (p)\nans=0\nfor i in range (1,k+1):\n\tans+=int(str(i)+str(i)[::-1])%p\nprint (ans%p)\n\t \t\t\t\t \t\t \t \t \t \t \t\t \t\t\t\t\t", "def getzcy(inp):\n\tinp=str(inp)\n\treturn int(inp+inp[::-1])\nk,p=(input().split())\nk=int(k)\np=int(p)\nsum=0\nfor i in range(1,k+1):\n\tsum=(sum+getzcy(i))%p\nprint(sum)", "k,MOD=map(int,input().split())\r\n#pal of even length \r\n'''\r\nfor i in range(10000):\r\n if str(i)==str(i)[::-1] and len(str(i))%2==0:\r\n ans.append(i)\r\nfor i in range(len(ans)):\r\n print(i+1,ans[i])\r\n''' \r\n#zcy(i)=i+i[::-1]\r\nans=0 \r\nfor i in range(1,k+1):\r\n ans=ans+int(str(i)+str(i)[::-1])\r\n ans%=MOD \r\nprint(ans)", "k,p=map(int,input().split())\r\nn = 1\r\nsum = 0\r\nwhile k>0:\r\n sum+=int(str(n)+str(n)[::-1])\r\n k-=1\r\n n+=1\r\nprint(sum%p)\r\n \r\n", "line = input().split()\r\nn = int(line[0])\r\np = int(line[1])\r\n\r\nans = 0\r\n\r\nfor i in range(1, n + 1):\r\n k = str(i)\r\n # print(k)\r\n a = int(k + k[::-1])\r\n ans += a\r\n ans %= p\r\nprint(ans)\r\n", "import sys\r\nk,p=input().split()\r\np=int(p)\r\nk=int(k)\r\nsum=0\r\nfor i in range(k+1):\r\n #print(str(i)+str(i)[::-1])\r\n sum+=int(str(i)+str(i)[::-1])\r\nprint(sum%p)\r\n", "l=input()\r\nk,p=l.split(' ')\r\nk=int (k)\r\np=int (p)\r\nans=0\r\nfor i in range (1,k+1):\r\n\tans+=int(str(i)+str(i)[::-1])%p\r\nprint (ans%p)", "# cook your dish here\r\nk,p = list(map(int,input().split()))\r\nl = []\r\nt=0\r\nwhile t<2*k:\r\n l.append(str(t)+str(t)[::-1])\r\n t+=1\r\n \r\ns = list(set([int(i) for i in l]))\r\ns.sort()\r\nprint(sum(s[:k+1])%p)", "k, p = input().split()\r\nk = int(k)\r\np = int(p)\r\nanswer = 0\r\nfor i in range(k):\r\n n = str(i+1)\r\n answer += int(n+n[::-1])\r\n answer %= p\r\nprint(answer)", "import math\r\ninfo = input()\r\ninfo = info.split()\r\nk = int(info[0])\r\np = int(info[1])\r\ndef palin(x):\r\n L = list(str(x))\r\n L.reverse()\r\n xR = \"\".join(L)\r\n return int(str(x) + xR)\r\nsumcon = 0\r\nfor j in range(1, k + 1):\r\n sumcon = sumcon + palin(j)\r\nprint(sumcon % p)", "def is_palindrome(s):\r\n\tif s==reversed(s):\r\n\t\treturn True\r\n\treturn False\t\r\n\r\nk, p = map(int, input().split())\r\n\r\nnum = []\r\n\r\nfor i in range(k+1):\r\n\tnum.append(int(str(i) + (str(i)[::-1])))\r\n\r\nprint(sum(num)%p)", "#!/user/bin/env/python 3.5\n# ---*---code: utf-8 ----*---\n\nk,p=map(int,input().split(' '))\nans=0\nfor i in range(1,k+1):\n\tans+=int(str(i)+str(i)[::-1])\n\tans=ans%p\nprint(ans)\n", "k,p = map(int, input().split())\r\n\r\ns = 0\r\n\r\nwhile(k):\r\n s += k * 10 ** len(str(k)) + int(str(k)[::-1])\r\n k -= 1\r\n\r\nprint(s % p)", "a, b = [int(x) for x in input().split()]\nsum = 0\nfor i in range(1, a+1):\n cp = i\n while(cp != 0):\n i = i*10 + cp%10\n cp = cp//10\n sum += i\nprint(sum%b)", "def palindromeString(n):\r\n s = str(n)\r\n myList = list(s)\r\n for i in range(0, len(s)):\r\n myList.append(s[len(s) - i - 1])\r\n return int(''.join(myList))\r\ninputLine = input()\r\ninputList = inputLine.split(' ')\r\nk = int(inputList[0])\r\np = int(inputList[1])\r\nsum = 0\r\nfor i in range(1, k + 1):\r\n sum += palindromeString(i)\r\nprint(sum % p)\r\n", "def pow(m):\r\n t=1\r\n for p in range(m):\r\n t*=10\r\n return t\r\na=[int(q) for q in input().strip().split()]\r\nsum=0\r\nfor k in range(1,a[0]+1):\r\n sum+=k*pow(len(str(k)))+int(str(k)[::-1])\r\nprint(sum%a[1])", "k,m=input().split();print(sum(int(str(y)+(str(y)[::-1])) for y in range(int(k)+1))%int(m))", "k,p = list(map(int, input().split()))\ncount=0\nval=0\n# n = 10\n# while True:\n# if len(str(n))%2==0 and str(n) == str(n)[::-1]:\n# val = (val + (n%p))%p\n# count+=1\n# if count==k:\n# print(val)\n# break\n# n+=1\n\nfor i in range(1, k+1):\n s = str(i) + str(i)[::-1]\n val = (val + ( int(s)% p)) % p\n # print(val)\nprint(val)\n", "k, p = map(int,input().split())\r\ns = 0\r\nfor c in range(1, k + 1):\r\n s += int(str(c)+str(c)[::-1])\r\nprint(s % p)\n# Mon Jan 24 2022 15:56:20 GMT+0000 (Coordinated Universal Time)\n", "k,p=input().strip().split(' ')\r\nk,p=[int(k),int(p)]\r\ns=0\r\nfor i in range(1,k+1):\r\n s+=int((str(i)+str(i)[::-1]))\r\n \r\nprint(s%p)", "k, p = map(int, input().split())\r\ns = 0\r\nfor i in range(1, k + 1):\r\n new_n = str(i) + str(i)[::-1]\r\n s += int(new_n)\r\nprint(s % p)\r\n\n# Sat Jan 29 2022 14:14:26 GMT+0000 (Coordinated Universal Time)\n", "k ,p = map(int, input().split())\r\nadd_up = 0\r\nfor i in range(1,k+1):\r\n i = str(i) + str(i)[::-1]\r\n i = int(i)\r\n add_up += i\r\nmod = add_up%p\r\nprint(mod)\r\n", "k,p = input().split()\r\nk = int(k)\r\np = int(p)\r\n\r\nh = 0\r\nfor i in range(1,k+1):\r\n s = int(str(i)+str(i)[::-1])\r\n h += s\r\n\r\nprint(h%p)\r\n", "from math import *\r\nfrom collections import *\r\nimport sys\r\nsys.setrecursionlimit(10**9)\r\n\r\nl = []\r\nct = 0\r\nfor i in range(1,10**5+1):\r\n\ts = str(i)\r\n\tl.append(s+s[::-1])\r\n\r\nn,k = map(int,input().split())\r\nans = 0\r\nfor i in range(n):\r\n\tans += int(l[i])\r\n\tans %= k\r\nprint(ans)\r\n", "def generation(n):\r\n def zcy(i):\r\n s = str(i)\r\n s = s + s[-1::-1]\r\n return int(s)\r\n r = list()\r\n for i in range(n):\r\n r.append(zcy(i+1))\r\n return r\r\n\r\nk, p = map(int, input().split())\r\nl = generation(k)\r\nans = 0\r\nfor i in l:\r\n ans += i\r\n ans %= p\r\nprint(ans)", "a,b = input().split()\na = int(a)\nb = int(b)\nc = 1\nv = 0\nn =0\nwhile n<a:\n v += int(str(c)+(str(c)[::-1]))\n c+=1\n n+=1\n \nprint(v%b)\n", "k,p=map(int,input().split())\r\n\r\nresult=0\r\nfor i in range(1,k+1):\r\n\tstr_i=str(i)\r\n\tresult+=int(str_i+str_i[::-1])\r\nprint(result%p)", "t = input().split()\nk, p = int(t[0]), int(t[1])\n\ns = 0\nfor i in range(1, k+1):\n\ts += int(str(i) + ((str(i))[::-1]))\n\nprint(s % p)", "k, p = map(int, input().split())\r\nlist = []\r\ni = 1\r\nv = int()\r\nR = 0\r\nx = 0\r\ns = 0\r\nd = ''\r\nc = ''\r\nif k <= 100000:\r\n i = 1\r\n x = 1\r\n while i <= k:\r\n x = str(x)\r\n d = x[::-1]\r\n c = x + d\r\n c = int(c)\r\n list.append(c)\r\n x = int(x)\r\n x += 1\r\n i += 1\r\n for i in list:\r\n s += i\r\nx = s % p\r\nprint(x)\r\n", "k, p=map(int, input().split())\r\nsumm=0\r\nfor i in range(1, k+1):\r\n summ+=(int(str(i)+str(i)[::-1]))%p\r\nprint(summ%p)\r\n", "k, p = map(int, input().split())\r\ni = 1\r\nans = 0\r\nwhile (k!=0):\r\n s = str(i)\r\n rev = s[::-1]\r\n temp = s+rev\r\n ans+=(int(temp))\r\n k-=1\r\n i+=1\r\nprint(ans%p)", "[k, p] = map(int, input().split())\r\ngg = 1;\r\nans = 0\r\nfor i in range(k):\r\n s = str(gg)\r\n t = s[::-1]\r\n s += t\r\n ans += (int)(s)\r\n ans %= p\r\n gg += 1\r\nprint(ans)", "#import io, os\r\n#input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nk, p = map(int,input().split())\r\n\r\nsuma = 0\r\nfor i in range(1,100001):\r\n suma+=int(str(i)+str(i)[::-1])\r\n k -= 1\r\n if k == 0:\r\n break\r\nprint(suma % p)", "the_string = input()\r\nn1, m1 = the_string.split()\r\nn=int(n1)\r\nm=int(m1)\r\ns1=0\r\nb=1\r\nfor i in range(n):\r\n b1=str(b)\r\n b2=b1[::-1]\r\n s1=s1+int(b1+b2)\r\n b=b+1\r\ns1=s1%m\r\nprint(s1)", "x, p = [int(i) for i in input().split(' ')]\r\ny = 0\r\nfor i in range(1, x+1):\r\n number = str(i)\r\n number += number[::-1]\r\n number = int(number)\r\n y += number\r\n\r\nprint(y % p)", "def chan(y,lrc):\t\r\n\th=[]\r\n\tfor x in y:\r\n\t\th.append(x)\r\n\tl=int(lrc[0])-1\r\n\tr=int(lrc[1])-1\t\r\n\tfor x in range(r-l+1):\t\t\t\t\r\n\t\tif h[l]==lrc[2]:\r\n\t\t\th[l]=lrc[3]\r\n\t\tl+=1\t\t\r\n\treturn ''.join(h)\r\n\t\r\ndef run():\r\n\tnumbers=input().strip()\r\n\tnumbers2=numbers.split(\" \")\r\n\tres=''\r\n\tsuma=0\r\n\tfor x in range(int(numbers2[0])):\r\n\t\tres=str(x+1)\r\n\t\tres+=res[::-1]\r\n\t\tsuma+=int(res)\r\n\tprint(suma%int(numbers2[1]))\t\t\r\n\r\nif __name__\t== '__main__':\t\r\n\trun()", "line = [int(i) for i in input().split()]\r\nk, p = line[0], line[1]\r\na = []\r\na.append(0)\r\nfor i in range(1, 100001):\r\n s = []\r\n if i < 10:\r\n # 2\r\n s = [0 for i in range(2)]\r\n s[0] = s[1] = str(i)\r\n pass\r\n elif i < 100:\r\n # 4\r\n s = [0 for i in range(4)]\r\n s[0] = s[-1] = str((i - 10) // 10 + 1)\r\n s[1] = s[-2] = str((i - 10) % 10)\r\n pass\r\n elif i < 1000:\r\n # 6\r\n s = [0 for i in range(6)]\r\n s[0] = s[-1] = str((i - 100) // 100 + 1)\r\n temp = (i - 100) % 100\r\n s[1] = s[-2] = str(temp // 10)\r\n s[2] = s[-3] = str(temp % 10)\r\n pass\r\n elif i < 10000:\r\n # 8\r\n s = [0 for i in range(8)]\r\n s[0] = s[-1] = str((i - 1000) // 1000 + 1)\r\n temp = (i - 1000) % 1000\r\n s[1] = s[-2] = str(temp // 100)\r\n temp %= 100\r\n s[2] = s[-3] = str(temp // 10)\r\n s[3] = s[-4] = str(temp % 10)\r\n pass\r\n elif i < 100000:\r\n # 10\r\n s = [0 for i in range(10)]\r\n s[0] = s[-1] = str((i - 10000) // 10000 + 1)\r\n temp = (i - 10000) % 10000\r\n s[1] = s[-2] = str(temp // 1000)\r\n temp %= 1000\r\n s[2] = s[-3] = str(temp // 100)\r\n temp %= 100\r\n s[3] = s[-4] = str(temp // 10)\r\n s[4] = s[-5] = str(temp % 10)\r\n pass\r\n else:\r\n # 12\r\n s = ['1', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '1']\r\n pass\r\n if i > 1:\r\n a.append(a[i - 1] + int(''.join(s)))\r\n else:\r\n a.append(int(''.join(s)))\r\nprint(a[k] % p)", "def nice(s):\r\n for i in range(len(s) // 2):\r\n if s[i] != s[len(s) - i - 1]:\r\n return False\r\n break\r\n if len(str(s)) % 2 == 0:\r\n return True\r\nk, p = map(int, input().split())\r\nans = 0\r\nfor i in range(1, k + 1):\r\n ans += int(str(i) + str(i)[::-1])\r\nprint(ans % p)", "def main():\r\n k, p = map(int, input().split())\r\n sum = 0\r\n for i in range(1, k + 1):\r\n sum = (sum + int(str(i) + str(i)[::-1])) % p\r\n print(sum)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "def zcy():\r\n k_p = input()\r\n k, p = k_p.split()\r\n sum = 0\r\n for i in range(1, int(k) + 1):\r\n sum = sum + (int(str(i)+str(i)[::-1])%int(p))\r\n print(sum%int(p))\r\nzcy()", "k, p = map(int, input().strip().split())\r\ndef next(cur):\r\n\tn = len(cur)-1\r\n\ti = n//2\r\n\tcur = cur[:i+1]\r\n\twhile i>=0 and cur[i] == '9':\r\n\t\tcur[i] = '0'\r\n\t\ti -= 1\r\n\tif i==-1:\r\n\t\tcur = ['1'] + ['0']*(n+1) + ['1']\r\n\telse:\r\n\t\tcur[i] = str(int(cur[i])+1)\r\n\t\tcur = cur + cur[::-1]\r\n\treturn cur\r\n\r\ncount = 1\r\nans = 11%p\r\ncur = list('11')\r\nnxt = next(cur)\r\nwhile count<k:\r\n\tans += int(''.join(nxt))\r\n\tans %= p\r\n\tcur = nxt\r\n\tnxt = next(cur)\r\n\tcount += 1\r\nprint(ans)", "k, p = map(int, input().split())\r\ncurrent_number = 1\r\nnumber_length = 1\r\nresult = 0\r\nfor i in range(k):\r\n cur = str(current_number)\r\n cur = cur[::-1]\r\n result += int(str(current_number) + cur)\r\n result %= p\r\n current_number += 1\r\n if pow(10, number_length+1) == current_number:\r\n number_length += 1\r\nprint(result)\n# Sat Jan 22 2022 18:04:38 GMT+0000 (Coordinated Universal Time)\n", "a,p=map(int,input().split())\r\nprint(sum([int(x+x[::-1])for x in map(str,range(a+1))])%p)", "k, p = map(int, input().split())\r\nsm = 0\r\nfor i in range(1,k+1):\r\n s = str(i) + str(i)[::-1]\r\n sm += int(s)\r\nprint(sm%p)", "k, p = list(map(int, input().split()))\r\nres = 0\r\nfor i in range(1, k+1):\r\n res = (res + int(str(i) + str(i)[::-1])) % p\r\n\r\n\r\nprint(res)", "k,p=map(int,input().split())\r\nans=0\r\nfor i in range(1,k+1):\r\n q=str(i)\r\n ans+=int(q+q[::-1])\r\nprint(ans%p)", "k,p=map(int, input().split())\r\ns = 0\r\nfor i in range(1,k+1):\r\n s+=int(str(i)+str(i)[::-1])%p\r\nprint(s%p)", "k, p = map(int, input().split())\r\nprint(sum(int(str(i)+str(i)[::-1]) for i in range(1,k+1))%p)", "\"\"\"\r\n Chtholly's request\r\n You can solve it recursively\r\n\"\"\"\r\nimport math, sys\r\ndef nextZCY(num): #num always is even\r\n num = str(num)\r\n length = len(num)\r\n for counter in range((length//2), 0,-1):\r\n findex = counter\r\n sindex = len(num) - findex + 2\r\n if(num[findex-1] == '9'):\r\n continue\r\n else:\r\n numToAdd = math.pow(10, findex) + math.pow(10, findex-1)\r\n return(int(num) + int(numToAdd))\r\n numToAdd = 9 * int(math.pow(10, length)) + 2\r\n return (int(num) + int(numToAdd))\r\nk, p = [int(x) for x in input().split()]\r\nzcy = 11\r\nsumKs = zcy\r\nfor i in range(k-1):\r\n zcy = nextZCY(zcy)\r\n sumKs += zcy\r\nprint(sumKs % p)", "k, p = map(int, input().split())\r\ni = 1\r\nanswer = 0\r\nwhile i <= k:\r\n i_ = str(i)\r\n i_ += i_[::-1]\r\n i__ = int(i_)\r\n answer += i__\r\n i += 1\r\n\r\nprint(answer%p)", "from itertools import product\n\nk, p = [int(i) for i in input().split()]\nsu = 0\n\nd = 1\nmk = 9\nwhile mk < k:\n mk += 9*10*d\n d += 1\n\ni = 0\n\npr = product('0123456789', repeat=d)\n# Skip first which are all zeroes\nnext(pr)\n\nfor c in pr:\n if i == k:\n break\n c = ''.join(c).lstrip('0')\n j = int(c + c[::-1])\n su = (su + (j % p)) % p\n i += 1\n\nprint(su)\n\n", "def iskc(nu):\r\n\tif (len(s)%2==1):\r\n\t\treturn False\r\n\telse :\r\n\t\tl = int(len(s)/2)\r\n\t\tfor i in range(l):\r\n\t\t\tif(s[i]!=s[len(s)-i-1]):\r\n\t\t\t\treturn False\r\n\treturn True\r\n\r\n\r\n\r\nr=input()\r\nk,p=r.split(\" \")\r\nk=int(k)\r\np=int(p)\r\n#p=int(input())\r\nnum=11\r\nans =0\r\nw=0\r\nwhile k>0:\r\n\tw+=1\r\n\ts=str(w)\r\n\tans = ((ans % p) + (int(s+s[::-1]) %p))%p\r\n\tk-=1\r\nprint(ans)\r\n", "k, p = map(int, input().split())\r\ns = 0\r\nn = 0\r\nl = []\r\nfor i in range(1, 10 ** 6):\r\n a = str(i)\r\n b = a[::-1]\r\n c = a + b\r\n l.append(c)\r\n if len(l) > k:\r\n break\r\nfor j in range(k):\r\n s += int(l[j])\r\nprint(s % p)", "def zcy_number(i):\n \"\"\"\n Returns the ith zcy_number by appending mirror\n \"\"\"\n return int(str(i) + str(i)[::-1])\n\n\nk, p = map(int, input().split())\n\nans = 0\nfor i in range(1, k + 1):\n ans = (ans + zcy_number(i)) % p\nprint(ans)\n", "def read_ints():\r\n return [int(x) for x in input().split()]\r\n\r\n\r\ndef get_zcy_numbers_with_length(num_length):\r\n start_num = 10 ** ((num_length - 1) // 2)\r\n max_num = 10 ** (num_length // 2)\r\n while start_num < max_num:\r\n yield int('{}{}'.format(start_num, str(start_num)[::-1]))\r\n start_num += 1\r\n\r\n\r\ndef get_zcy_numbers(num_numbers):\r\n num_length = 2\r\n numbers_returned = 0\r\n while numbers_returned < num_numbers:\r\n for num in get_zcy_numbers_with_length(num_length):\r\n yield num\r\n numbers_returned += 1\r\n if numbers_returned >= num_numbers:\r\n break\r\n num_length += 2\r\n\r\n\r\ndef main():\r\n k, p = read_ints()\r\n res = 0\r\n for num in get_zcy_numbers(k):\r\n res = (res + num) % p\r\n print(res)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "k, p = map(int, input('').strip(' ').split(' '))\r\nans = 0\r\nfor i in range(1,k+1):\r\n dat = i\r\n remainder = i\r\n while(True):\r\n dat = dat*10+remainder%10\r\n remainder =remainder // 10\r\n if (remainder==0):\r\n break\r\n ans = (ans+dat)%p\r\nprint(ans)", "def zcy(n):\n return int(str(n)+str(n)[::-1])\n\nfl = input().split()\nk = int(fl[0])\np = int(fl[1])\n\nsum = 0\n\nfor i in range(k+1):\n sum = (sum + zcy(i))%p\n\nprint(sum)\n", "k,p=list(map(int,input().split()))\r\nans=0\r\nfor i in range(1,k+1):\r\n\ts=str(i)\r\n\ts+=s[-1::-1]\r\n\tans=(ans+int(s))%p\r\nprint(ans)", "k, p = map(int, input().split())\r\nsum = 0\r\nwhile (k > 0):\r\n sum += int(str(k) + str(k)[::-1])\r\n k -= 1\r\nprint(sum % p)", "'''\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\ndef main():\r\n\tN, K = map(int,input().split())\r\n\tadd = 0\r\n\tfor i in range(1,N+1):\r\n\t\tstring = str(i)\r\n\t\tstring = string + string[::-1]\r\n\t\tadd+= (int(string))\r\n\t\tadd = add%K\r\n\tprint(add)\r\n\r\n\t\r\n\r\nmain()", "k,p=map(int,input().split())\r\nsum=0\r\ni=1\r\nwhile k:\r\n k-=1\r\n s=str(i)\r\n tmp=int(s+s[::-1])\r\n sum+=tmp\r\n i+=1\r\nprint(sum%p)\r\n", "temp = input().split()\nnum = int(temp[0])\nmod = int(temp[1])\nrunningtotal=0\nfor i in range(1,num+1):\n runningtotal+=int(str(i)+str(i)[::-1])\nprint(runningtotal%mod)", "n, k = [int(x) for x in input().split()]\r\nsumm = 0\r\nfor i in range(1, n+1):\r\n summ += int((str(i) + str(i)[::-1]))\r\nprint(summ % k)", "# for _ in range(int(input())):\r\nk , p = map(int,input().split())\r\nct = 0 \r\nnew = 1\r\nad = 0\r\nwhile ct < k:\r\n\ttmp = str(new)\r\n\tpal = int(tmp + \"\".join(reversed(tmp)))\r\n\tad += pal\r\n\tct += 1\r\n\tnew += 1\r\nprint(ad % p)", "k,p=map(int,input().split())\na=[]\nfor i in range(1,k+1):\n a.append(int(str(i)+(str(i))[::-1]))\ns=0\nfor i in range(k):\n s+=a[i]\n s%=p\nprint(s)\n", "inp = input().split()\r\nk = int(inp[0])\r\nn = int(inp[1])\r\nans = 0\r\nfor i in range(1, k + 1):\r\n i = str(i)\r\n pol = int(i + i[::-1])\r\n ans = (ans + pol) % n\r\n\r\nprint(ans)\n# Fri Jan 28 2022 08:41:58 GMT+0000 (Coordinated Universal Time)\n", "lines = input()\r\nN = eval(lines.split(\" \")[0])\r\nmod = eval(lines.split(\" \")[1])\r\ns = 0\r\nfor i in range(N+1):\r\n iStr = str(i)\r\n reversed_string = iStr[::-1]\r\n s += int(iStr+reversed_string)\r\nprint(s%mod)", "num,divide = map(int,input().split())\r\nnumnow = 1\r\naddresult = 0\r\nwhile numnow<=num:\r\n tempstr1 = str(numnow)\r\n tempstr2 = tempstr1[::-1]\r\n zcynum = int(tempstr1+tempstr2)\r\n addresult += zcynum\r\n numnow += 1\r\nreminder = addresult%divide\r\nprint(reminder)\r\n", "def reverse(l):\r\n l=str(l)\r\n k=l[::-1]\r\n return int(k)\r\n\r\ndef main():\r\n k,p=input().strip().split()\r\n su=0\r\n zxc=0\r\n for i in range(1,int(k)+1):\r\n x=len(str(i))\r\n zxc=i*(10**x)+reverse(i)\r\n su=su+zxc\r\n print(su%int(p))\r\n\r\nmain()\r\n\r\n\r\n \r\n \r\n \r\n", "k, p = map(int, input().split())\r\nsum = 0\r\nfor i in range(1, k + 1):\r\n s = str(i)\r\n sum += int(s + s[::-1])\r\nprint(sum % p)# 1690536806.2871175", "import sys\r\nm_input = input\r\nif sys.version > '3':\r\n m_input = input\r\nelse:\r\n m_input = raw_input\r\ndef getZcyFromIndex(index):\r\n rtn = index\r\n temp = index\r\n while temp != 0:\r\n rtn = rtn * 10\r\n rtn = rtn + temp % 10\r\n temp = temp // 10\r\n return rtn\r\n\r\nn,m = map(int,m_input().split())\r\nans = 0\r\nfor i in range(0,n):\r\n ans = ans + getZcyFromIndex(i+1)\r\n ans = ans % m\r\nprint(ans)", "def rev(a):\r\n return a[::-1]\r\nans=0\r\nn,q=map(int,input().split())\r\ns=\"11\"\r\nfor i in range(n):\r\n ans+=int(s)\r\n p=str(int(s[:len(s)//2])+1)\r\n s=p+rev(p)\r\n #print(s)\r\nprint(ans%q)\r\n", "k, p = [int(x) for x in input().split()]\r\nans = 0\r\nfor i in range(1, k+1):\r\n ans = (ans + int(str(i) + str(i)[::-1])) % p\r\nprint(ans)", "k, p = list(map(int, input().split()))\r\n\r\n\r\nans = 0\r\nfor i in range(1, k+1):\r\n nr = str(i) + str(i)[::-1]\r\n ans = (ans + (int(nr))%p)%p\r\n\r\nprint(ans)", "a,p = map(int,input().split())\r\nprint(sum([int(x + x[::-1]) for x in map(str, range(a + 1))]) % p)", "n,mod = map(int, input().split())\r\nsum = 0\r\n\r\nfor i in range(1,n+1):\r\n s = str(i)\r\n num = int(s + ''.join(reversed(s)))\r\n sum += num\r\n sum %= mod\r\nprint(sum)", "k, p = [int(_) for _ in input().split()]\r\nsumator = 0\r\nfor i in range(1, k+1):\r\n i = str(i)\r\n sumator += int(i + i[::-1])\r\nprint(sumator % p)\n# Fri Jan 28 2022 19:36:53 GMT+0000 (Coordinated Universal Time)\n", "def number_list(): return list(map(int, input().split()))\r\nk, p = number_list()\r\ntotsum = 0\r\nfor i in range(1, k + 1):\r\n totsum += int(str(i) + \"\".join(reversed(str(i))))\r\nprint(totsum % p)", "k,p=map(int,input().split())\r\nans=0\r\nfor i in range(1,k+1):\r\n n=int(str(i)+str(i)[::-1])\r\n ans+=n\r\nprint(ans%p)", "k,p=[int(i) for i in input().split()]\r\nl=[]\r\nfor i in range(9):\r\n l.append(((i+1)*11)%p)\r\nfor i in range(9):\r\n sum = ((i+1)*1001)%p\r\n for j in range(10):\r\n l.append((sum+110*j)%p)\r\nfor i in range(9):\r\n sum = ((i+1)*100001)%p\r\n for j in range(10):\r\n sum1 = (sum + j*10010)%p\r\n for q in range(10):\r\n l.append((sum1+q*1100)%p)\r\nfor i in range(9):\r\n sum = ((i+1)*10000001)%p\r\n for j in range(10):\r\n sum1 = (sum + j*1000010)%p\r\n for q in range(10):\r\n sum2 = (sum1 + q*100100)%p\r\n for w in range(10):\r\n l.append((sum2+w*11000)%p)\r\nfor i in range(9):\r\n sum = ((i+1)*1000000001)%p\r\n for j in range(10):\r\n sum1 = (sum + j*100000010)%p\r\n for q in range(10):\r\n sum2 = (sum1 + q*10000100)%p\r\n for w in range(10):\r\n sum3 = (sum2 + w*1001000)%p\r\n for e in range(10):\r\n l.append((sum3 + e*110000)%p)\r\nl.append(100000000001%p)\r\nsum=0\r\nfor i in range(k):\r\n sum = (sum+l[i])%p\r\nprint (sum)", "k, p = map(int, input().split())\nsum = 0\nfor i in range(k+1):\n\tcon = str(i) + \"\".join(reversed(str(i)))\n\tsum += int(con)\nprint(sum%p)\n", "[k,p] = [int(i) for i in input().split()]\r\nzcy = [11,22,33,44,55,66,77,88,99]\r\ni = 0\r\nwhile len(zcy) < k:\r\n tmp = str(zcy[i])[:len(str(zcy[i]))//2]\r\n for j in ['00','11','22','33','44','55','66','77','88','99']:\r\n zcy.append(int(tmp+j+tmp[::-1]))\r\n if len(zcy) >= k:\r\n break\r\n i+=1\r\nprint(sum(zcy[:k])%p)", "#3rd\r\n\r\ndef f(n):\r\n s=str(n)\r\n return int(s+s[::-1])\r\n\r\nk,p=map(int,input().split())\r\nans=0\r\nfor i in range(1,k+1):\r\n ans=(ans+f(i))%p\r\nprint(ans)\r\n", "k, p =map(int,input().split())\r\nsum = 0\r\n\r\nfor i in range(1, k+1):\r\n num = i\r\n str_num = str(num)\r\n list_num = []\r\n \r\n for string in str_num:\r\n list_num.append(string)\r\n \r\n reversed_list = list(reversed(list_num))\r\n new_list = list_num + reversed_list\r\n new_strnum = ''.join(new_list)\r\n num = int(new_strnum)\r\n sum += num\r\n\r\nprint(sum % p)", "k,p =input().split()\nk=int(k)\np=int(p)\na=0\nfor i in range(1,k+1):\n ls = []\n for j in range(len(str(i))):\n ls.append(str(i)[j])\n ls1=list(reversed(ls))\n a+=int(''.join(ls)+''.join(ls1))%p\n\n\nprint(int(a%p))", "k, p = map(int, input().split(' '))\r\npal = 0\r\nfor i in range(1, k+1):\r\n pal = pal + int(str(i) + str(i)[::-1])\r\nprint(pal % p)", "num_digit = 0\r\nnum_palindrome = 0\r\ncount = 0\r\nn = 0\r\npalindrome = 0\r\nmod = 0\r\narr_sum = 0\r\n\r\ns = input()\r\nnum_palindrome, mod = map(int, s.split())\r\n\r\n\r\nwhile(num_palindrome > count):\r\n\r\n count += 1\r\n remainder = 0\r\n rev_num = 0\r\n num_digit = 0\r\n\r\n n = count;\r\n while(n != 0):\r\n n = n // 10\r\n num_digit += 1\r\n \r\n n = count\r\n while(n != 0):\r\n remainder = n % 10\r\n rev_num = rev_num * 10 + remainder\r\n n = n // 10\r\n\r\n\r\n palindrome = count * (10 ** num_digit) + rev_num\r\n #printf(palindrome)\r\n #printf(\" count: \", count)\r\n\r\n arr_sum +=palindrome\r\n \r\n#end of while loop\r\n\r\n\r\nprint((arr_sum % mod))\r\n", "n,p=[int(i) for i in input().split()]\r\nsum=0\r\nfor i in range(1,n+1):\r\n o=[]\r\n k=str(i)\r\n for j in range(int(len(k))):\r\n o.append(k[j])\r\n l=\"\".join(o)\r\n o.reverse()\r\n m=\"\".join(o) \r\n sum+=int(l+m)\r\nprint(sum%p)", "a=[int(x) for x in input().split()]\r\nk=a[0]\r\np=a[1]\r\ncount=0\r\nfor i in range(1,k+1):\r\n\tx=str(i)\r\n\tz=x[::-1]\r\n\ty=int(x+z)\r\n\tcount=count+y\r\nprint(count%p)\t\r\n\r\n\r\n", "k, p = map(int, input().split())\r\ndli = 1\r\ncur = 1\r\nres = 0\r\nfor i in range(k):\r\n rev = str(cur)\r\n rev = rev[::-1]\r\n res += int(str(cur) + rev)\r\n #print(int(str(cur) + rev))\r\n res %= p\r\n cur += 1\r\n if pow(10, dli+1) == cur:\r\n dli += 1\r\nprint(res)", "k,p = map(int,input().split())\r\n\r\nans = 0\r\nfor i in range (1,k+1):\r\n ans += int(str(i) + str(i)[::-1])\r\n\r\nprint(ans%p)", "k, p = map(int, input().split())\r\nres = 0\r\nfor i in range(1, k + 1):\r\n s = str(i) + \"\".join(map(str,list(str(i))[::-1]))\r\n res += int(s)\r\n res %= p\r\nprint(res)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nd = set()\r\n\r\n\r\ndef f(x):\r\n if len(x) == 10:\r\n return\r\n\r\n for i in range(10):\r\n a = str(i) + x + str(i)\r\n d.add(a)\r\n f(a)\r\n\r\n\r\nf('')\r\nw = sorted([int(i) for i in d if i[0] != '0'])\r\nw.append(100000000001)\r\n\r\nk, p = map(int, input().split())\r\nprint(sum(w[:k]) % p)", "def reverse(string):\n string = string[::-1]\n return string\n\n#k = int(input())\n#p =int (input())\nk,p =input().split(\" \")\nk=int(k)\np=int(p)\nsum=0\ni=1;\nfor i in range(1, k+1):\n w = str(i)\n w = w + reverse(w)\n j = int(w)\n sum = (sum%p + j%p)%p\n\n\nprint (sum)\n\n\n\n\n\n\n\n #j=i+reverse(i)\n# l=int(j)\n# sum = (sum % p + l%p)%p\n# i+=1\n\n#print (sum)#\n\n\n\n\n#https://www.flipkart.com/skybags-brat-4-backpack/p/itmebh4crngt8vzw?pid=BKPEBH4CDQSPBHYQ&srno=b_1_10&otracker=nmenu_sub_Men_0_Backpacks&lid=LSTBKPEBH4CDQSPBHYQQGATH3&fm=organic&iid=6e659264-a908-4886-9406-85950c6d4d0d.BKPEBH4CDQSPBHYQ.SEARCH&ppt=Store%20Browse&ppn=Search%20Page&ssid=19egn3kxvk0000001512567262329\n", "def cul(t):\r\n global sumout,count \r\n sumout=sumout+int(t)\r\n count=count+1\r\ndef func(t,l):\r\n tt=t\r\n for i in range(10):\r\n tt=t\r\n if(l==1 and i==0):\r\n continue\r\n tt=tt+str(i)\r\n if(l==length/2): \r\n tt=tt+tt[::-1]\r\n cul(tt)\r\n if(count==k):\r\n print(sumout%p)\r\n quit()\r\n else:\r\n func(tt,l+1)\r\n\r\nlength=2\r\ncount=0\r\nsumout=0\r\n\r\nk,p=[int(x) for x in input().split()]\r\nwhile(True):\r\n l=1\r\n t=''\r\n func(t,l) \r\n length=length +2\r\n \r\n \r\n", "\r\ndef count_zcy(n):\r\n new_list = 0\r\n for x in range(1, n+1):\r\n buff = str(x)\r\n new_list += int(buff + buff[::-1])\r\n return new_list\r\n\r\n\r\ndef main():\r\n buff = input().split()\r\n k, p = int(buff[0]), int(buff[1])\r\n return count_zcy(k) % p\r\n\r\n\r\nif __name__ == \"__main__\":\r\n print(main())\r\n", "k,p=map(int,input().split())\r\ns=0\r\nfor i in range(1,k+1):\r\n s+=int(str(i)+str(i)[::-1])\r\nprint(s%p)", "# import sys\n\n# sys.stdin = open('input.txt', 'r')\n\n# sys.stdout = open('output.txt', 'w')\n\na, b = map(int, input().split(' '))\n\nhlf = \"1\"\nsum = 0\n\nfor i in range(a):\n cur = hlf + hlf[::-1]\n sum += int(cur)\n hlf = str(int(hlf) + 1)\n\nprint(sum % b)\n", "k,m=map(int,input().split())\r\nx=0\r\nfor i in range(1,k+1):\r\n x+=int(str(i)+\"\".join(reversed(str(i))))\r\nprint(x%m)\r\n", "k,p=map(int,input().split())\r\nc=0\r\nfor i in range(1,k+1):\r\n c=c+int(str(i)+str(i)[::-1])\r\nprint(c%p)\r\n\r\n", "k, p = list(map(int, input().split()))\n\n\ndef to_zcy(i):\n return int(str(i) + str(i)[::-1])\n\n\ndef get_sum():\n result = 0\n for i in range(1, k + 1):\n result += to_zcy(i) % p\n result %= p\n return result\n\nprint(get_sum())\n", "k,p=input().split()\r\nk=int(k)\r\np=int(p)\r\nn=1\r\na=0\r\nt=0\r\nwhile k:\r\n a+=1\r\n if len(str(a))>n:\r\n n+=1\r\n a=int(\"1\"+\"0\"*(n-1))\r\n s=str(a)\r\n t+=int(s+s[::-1])\r\n k-=1\r\nprint(t%p)", "n, p = map(int, list(input().split()))\r\n\r\na = []\r\nx = 11\r\nfor i in range(9):\r\n\ta.append(x * (i + 1))\r\n\r\nfor i in range(10, 100):\r\n\ttemp = str(i)\r\n\ttemp = temp + temp[::-1]\r\n\ta.append(int(temp))\r\n\r\nfor i in range(100, 1000):\r\n\ttemp = str(i)\r\n\ttemp = temp + temp[::-1]\r\n\ta.append(int(temp))\r\n\r\nfor i in range(1000, 10000):\r\n\ttemp = str(i)\r\n\ttemp = temp + temp[::-1]\r\n\ta.append(int(temp))\r\n\r\nfor i in range(10000, 100000):\r\n\ttemp = str(i)\r\n\ttemp = temp + temp[::-1]\r\n\ta.append(int(temp))\r\n\r\nfor i in range(100000, 100010):\r\n\ttemp = str(i)\r\n\ttemp = temp + temp[::-1]\r\n\ta.append(int(temp))\r\n\r\nans = 0\r\nfor i in range(n):\r\n\tans += a[i]\r\n\tans %= p\r\n\r\nprint(ans)\r\n", "k,p = map(int,input().split())\r\nans = 0\r\nfor i in range(1,k+1):\r\n x = str(i)\r\n ans+=int(x+x[::-1])\r\nprint(ans%p)", "k,p = map(int,input().split())\r\n\r\nans=0\r\nfor i in range(1,k+1):\r\n\ts=str(i)\r\n\ts= s[:]+s[::-1]\r\n\tans+=int(s)\r\n\r\nprint(ans%p)", "a, k = map(int, input().split())\nsm = 0\nfor i in range(1, a + 1):\n r = str(i)\n sm += int(r + r[::-1])\n sm %= k\nprint(sm % k)\n# Thu Feb 17 2022 09:30:59 GMT+0000 (Coordinated Universal Time)\n", "#code\r\nn , m =map(int,input().split())\r\nl = [str(x) for x in range(1,n+1)]\r\nsum_ele = 0\r\nfor i in l:\r\n i=i+i[::-1]\r\n sum_ele = (sum_ele + int(i))%m\r\nprint(sum_ele)\r\n ", "k, p = [int(x) for x in input().strip().split(' ')]\r\n\r\nk -= 1\r\n\r\nres = 0\r\n\r\ndef add_(hp, rem_l):\r\n global k, res\r\n if k < 0:\r\n return\r\n if rem_l == 0:\r\n rl = hp + hp[::-1]\r\n v = 0\r\n for i, d in enumerate(rl):\r\n v += d * pow(10, i)\r\n v = v % p\r\n res = (res + v) % p\r\n k -= 1\r\n return\r\n rg = range(10) if len(hp) > 0 else range(1, 10)\r\n for i in rg:\r\n add_(hp + [i], rem_l - 1)\r\n\r\ncs = 1\r\nwhile k >= 0:\r\n add_([], cs)\r\n cs += 1\r\n\r\nprint(res)\r\n", "k,mod = map(int, input().split())\r\nval = 0\r\nfor i in range (1,k+1):\r\n\tval = (val%mod + int(str(i)+str(i)[::-1])%mod)%mod\r\n\ti+=1\r\nprint (val)", "from itertools import permutations\nm,n=map(int,input().split())\nsum=0\nfor i in range(1,m+1):\n\tsum+=int(str(i)+str(i)[::-1])\nprint(sum%n)\n\n", "k, p = map(int, input().split())\r\nanswer = 0\r\nwhile k > 0:\r\n\tanswer += int(str(k) + str(k)[::-1])\r\n\tk = k - 1\r\nprint(answer % p)\r\n", "s=list(map(int,input().split()))\r\nk=s[0]\r\np=s[1]\r\nans=0\r\nfor i in range(1,k+1):\r\n m=str(i)\r\n a=int((m+m[::-1]).strip(\"0\"))\r\n ans=(ans%p+(a)%p)%p\r\nprint(ans)\r\n ", "k,p=input().split(' ')\r\nk=int(k)\r\np=int(p)\r\nb=k*[1]\r\nc=[]\r\nm=0\r\nfor i in range(0,k):\r\n b[i]=i+1\r\n c=list(str(b[i]))\r\n d=c[:]\r\n d.reverse()\r\n e=c+d\r\n H=''.join(e)\r\n H=int(H)\r\n m+=H\r\n c=[]\r\n d=[]\r\n e=[]\r\n \r\nprint(m%p)\r\n", "k, p = map(int, input().split())\r\ns = 0\r\nfor i in range(k):\r\n zcy = str(1 + i)\r\n zcy += zcy[::-1]\r\n s += int(zcy)\r\nprint(s%p)", "k,p=map(int, input().split())\r\ns = 0\r\nfor i in range(1,k+1):\r\n s+=int(str(i)+str(i)[::-1])\r\nprint(s%p)", "\r\ndef main():\r\n ans = 0\r\n n,m = map(int, input().split())\r\n for i in range(1,n+1):\r\n ans += int(str(i)+str(i)[::-1])\r\n print(ans%m)\r\nif __name__ == '__main__':\r\n main()\r\n", "k, p = map(int, input().split())\r\ns = 0\r\n\r\nfor i in range(1, k+1):\r\n si = str(i) + ''.join(reversed(str(i)))\r\n s += int(si)\r\n\r\nprint(s % p)\r\n", "k,p=[int(x) for x in input().split()]\r\nans=0\r\nfor i in range(1,k+1):\r\n s1=str(i)\r\n s2=s1[::-1]\r\n s=s1+s2\r\n val=int(s)\r\n ans=(ans+val)%p\r\nprint(ans)", "a=input().split(\" \")\r\ndef invertir(var):\r\n return var[::-1]\r\nb=0\r\ncontador=0;\r\nfor i in range(int(a[0])):\r\n b+=1\r\n contador+=int(str(b)+invertir(str(b)))\r\n\r\nprint(contador%int(a[1]))\r\n \r\n \r\n \r\n", "k,p=map(int,input().split())\r\nans=0\r\nfor i in range(1,k+1):\r\n\tvar=str(i)\r\n\tvar1=var[::-1]\r\n\t#print(var+\" \"+var1)\r\n\tvar=var+var1\r\n\tf=int(var)\r\n\tans=(ans+f)%p\r\nprint(ans)", "def f(a1):\n if a1 >= 10:\n a = str(a1)\n if a == a[::-1]:\n m = a1 + 1\n a = str(m) \n a1 = int(a) \n q1 = a[:len(a) // 2]\n if len(a) % 2 == 1:\n x = a[len(a) // 2]\n else:\n x = \"\"\n s = ((len(a) % 2) + 2) % ((len(a) % 2) + 1)\n q2 = a[len(a) // 2 + s:]\n w = len(q2)\n if int(q2) > int(q1) and (x == \"\" or x == \"9\") or int(q1[::-1]) < int(q2):\n a1 += (10 ** (w)) - int(q2)\n elif int(q2) > int(q1) and x != \"\" and x != \"9\":\n m = int(x) + 1\n x = str(m)\n a1 += (10 ** (w)) - int(q2)\n a = str(a1)\n q1 = a[:len(a) // 2]\n if len(a) % 2 == 1:\n x = a[len(a) // 2]\n else:\n x = \"\"\n result = q1 + x + q1[::-1]\n return(int(result)) \n else:\n if a1 == 9:\n return(11)\n else:\n return(a1 + 1)\nk, p = map(int, input().split())\nsumm = 0\na1 = 9\nfor i in range(k): \n a1 = f(a1)\n if len(str(a1)) % 2 == 1:\n a1 = 10 ** (len(str(a1)))\n a1 = f(a1)\n summ += a1\n summ = summ % p\nprint(summ % p) \n\n", "k,p = map(int,input().split())\r\ni = 1\r\nl = []\r\nn = k\r\nwhile k!=0:\r\n s = \"\"\r\n s = str(i)\r\n s += s[::-1]\r\n l.append(s)\r\n i+=1\r\n k-=1\r\nans = 0\r\nfor i in range(0,n):\r\n ans += int(l[i])\r\nprint(ans%p)", "def zcy(n):\r\n s = str(n)\r\n return int(s + ''.join(reversed(s)))\r\n\r\nk, p = [int(i) for i in input().split()]\r\nprint(sum(zcy(i) for i in range(1, k+1)) % p)\r\n", "k, p = map(int, input().split())\ns = 0\n\nfor i in range(1, k + 1):\n num = int(str(i) + ''.join(reversed(list(str(i)))))\n s += num\nprint(s % p)\n", "from sys import stdin,stdout\n\ndef main(k, p):\n i = 1\n s = 0\n while True:\n s = (s + (int(str(i) + str(i)[::-1])) % p) % p\n i += 1\n if i > k:\n break\n return s\n\nstdout.write('{}\\n'.format(main(*list(map(int, stdin.readline().strip().split(' '))))))\n", "if __name__ == \"__main__\":\r\n n = str(input(\"\"))\r\n aux = n.split(\" \")\r\n k = int(aux[0])\r\n p = int(aux[1])\r\n cont=0\r\n for i in range(k):\r\n izq = str(i+1)\r\n der = izq[::-1]\r\n res = int(izq+der)\r\n cont+=res\r\n print(cont%p)", "zcy = []\r\nfor i in range(1,10**5+1):\r\n zcy += [int(str(i)+str(i)[::-1])]\r\nzcy = sorted(zcy)\r\nk,p = map(int,input().split())\r\nprint(sum(zcy[:k])%p)", "n , p = map(int, input().split())\r\nprint(sum(int(str(i) + str(i)[::-1]) for i in range(1 , n+1))%p)", "n, mod = map(int, input().split())\r\nans=0\r\nfor i in range(1,n+1) :\r\n ans= (ans+int(str(i)+str(i)[::-1])%mod)%mod\r\n\r\nprint (ans)" ]

[ "# N,M = map(int,input().split())\r\n# N = int(input())\r\n# A = list(map(int,input().split()))\r\n\r\n\r\nN = int(input())\r\nA = list(map(int,input().split()))\r\n\r\nd = [0] * N\r\nfor i in range(N):\r\n d[A[i]-1] = i+1\r\n\r\nprint(*d)\r\n", "v = int(input())\r\ngivers = list(map(int, input().split()))\r\nreceivers = [0] * v\r\n\r\nfor i in range(v):\r\n receivers[givers[i] - 1] = i + 1\r\n\r\nprint(*receivers)\r\n", "import sys\ninput = sys.stdin.readline\n\nn = int(input())\na = list(map(int, input().split()))\n\nans = [i for i in range(n)]\nfor i, v in enumerate(a):\n ans[v-1] = i+1\n\nprint(*ans)", "def find_gift_givers(n, gift_receivers):\r\n gift_givers = [0] * t\r\n for i in range(t):\r\n gift_givers[gift_receivers[i] - 1] = i + 1\r\n return gift_givers\r\n \r\nt = int(input())\r\ngift_receivers = list(map(int, input().split()))\r\n \r\nresult = find_gift_givers(t, gift_receivers)\r\nprint(*result)", "n = int(input())\n\ns = list(map(int, input().split()))\n\nfi = [0]*n\nfor i in range(n):\n fi[s[i] - 1] = str(i + 1)\n\nprint(str(' '.join(fi)))", "n = int(input())\r\nindexes = list(map(int, input().split()))\r\nstr = \"\"\r\nfor i in range(1, n + 1):\r\n print(indexes.index(i) + 1, end = ' ')", "n = int(input())\r\n\r\npresents = [ int(i) for i in input().split()]\r\n\r\ni = 1\r\nwhile (i <= n):\r\n print(presents.index(i)+1, end=' ')\r\n i += 1\r\n\r\n", "n = int(input())\r\np = list(map(int,input().split(' ')))\r\nlist1 = [0]*len(p)\r\n\r\nfor i in range(len(p)):\r\n list1[p[i]-1] = i+1\r\n\r\ns = ''\r\nfor j in range(len(list1)):\r\n if j==len(list1):\r\n s+=str(list1[j])\r\n else:\r\n s+=(str(list1[j])+' ')\r\n\r\nprint(s)", "a = eval(input())\r\ns = (input())\r\ns = s.split()\r\narr = [0] * a\r\nfor i in range(a):\r\n b = int(s[i])\r\n arr[b-1] = int(i+1)\r\n\r\nres = ' '.join([str(elem) for elem in arr])\r\n\r\nprint(res)", "n = int(input())\r\ns = list(map(int, input().split()))\r\nfor i in range(0, len(s)):\r\n print(s.index(i+1)+1, end='')\r\n if i != len(s):\r\n print(' ', end='')\r\n", "numer_of_friends = int(input())\r\nfriends = list(map(int, input().strip().split()))\r\n\r\nans = [0] * len(friends)\r\nfor i in range(numer_of_friends):\r\n ans[friends[i]-1] = i + 1\r\n\r\nprint(*ans)\r\n\r\n\r\n\r\n\r\n", "n=int(input())\r\nps=[int(x) for x in input().split()]\r\nresult=[0]*n\r\nfor i in range(n):\r\n result[ps[i]-1]=i+1\r\nfor j in range(n-1):\r\n print(str(result[j])+\" \",end=\"\")\r\nprint(str(result[n-1]))", "n = int(input())\r\ngivers = list(map(int, input().split()))\r\nresult = [0] * n\r\nfor i in range(n):\r\n friend = i + 1\r\n giver = givers[i]\r\n result[giver - 1] = friend\r\nprint(' '.join(map(str, result)))\r\n", "n = int(input())\r\ngift_list = input().split(' ')\r\nindex = 0\r\nlist = []\r\noutput_string = str()\r\nfor value in range(0,n):\r\n list.append(value) # creating a template list to do work\r\n\r\nfor item in gift_list :\r\n list[int(item) -1] = gift_list.index(item) +1\r\nfor item in list :\r\n output_string += str(item) + ' '\r\nprint(output_string)\r\n", "n = int(input())\nl = list(map(int, input().split()))\n\nd={}\nfor i in range(1,n+1):\n d[i]=l[i-1]\ndl = list(d.items())\nfor j in range(1,n+1):\n for k in dl:\n if k[1]==j:\n print(k[0],end=' ')\n\n", "n = input()\r\nj = input().split(\" \")\r\nr = []\r\nfor i in range(len(j)):\r\n k = j.index(f\"{i+1}\")\r\n r.append(str(k+1))\r\n\r\nprint(\" \".join(r))\r\n", "friends_number = int(input())\r\nindex_gave_to_arr = list(map(int, input().split()))\r\n\r\nnew_arr = ''\r\nfor i in range(1, friends_number + 1):\r\n new_arr += str(index_gave_to_arr.index(i) + 1) + ' '\r\nprint(new_arr)", "n=int(input())\r\nd={}\r\nd.fromkeys(range(1,n+1),0)\r\nl=list(map(int,input().split()))\r\nk=1\r\nfor i in l:\r\n d[i] =k \r\n k+=1 \r\nfor i in range(1,n+1):\r\n print(d[i],end=\" \") ", "n = int(input())\r\nreceiveFrom = {value: index for index, value in enumerate(map(int, input().split()), 1)}\r\nprint(' '.join(map(str, [receiveFrom[i] for i in range(1, n + 1)])))", "n = int(input())\nlis = list(map(int, input().split()))\ngiver = [0]*n\nfor i in range(1, n+1):\n giver[lis[i -1] -1] = i\nprint(*giver)", "a=int(input())\r\nb=map(int,input().split(\" \"))\r\ntab=[0]*a\r\ns=1\r\nfor i in b:\r\n tab[i-1]=s\r\n s+=1\r\nres=\"\"\r\nfor i in tab:\r\n res+=str(i)\r\n res+=\" \"\r\n\r\nprint(res)", "def find_gift_givers(n, gift_list):\r\n result = [0] * n\r\n for i in range(n):\r\n result[gift_list[i] - 1] = i + 1\r\n return result\r\n\r\nn = int(input())\r\ngift_list = list(map(int, input().split()))\r\ngift_givers = find_gift_givers(n, gift_list)\r\nprint(\" \".join(map(str, gift_givers)))\r\n", "n = int(input())\r\np = list(map(int, input().split()))\r\n\r\nans = [0] * n\r\n\r\nfor i in range(n):\r\n idx = p[i]\r\n ans[idx-1] = i+1\r\n\r\nans = [str(elem) for elem in ans]\r\nprint(\" \".join(ans))\r\n \t \t \t\t \t\t \t \t\t\t\t \t \t\t", "def main():\r\n n = int(input())\r\n givers = [int(i) for i in input().split()]\r\n mapping = dict()\r\n for i in range(1, n+1):\r\n idx = givers.index(i)\r\n if idx+1 not in mapping:\r\n mapping[str(idx+1)] = givers[idx]\r\n print(\" \".join(list(mapping.keys())))\r\n \r\n\r\nif __name__ == \"__main__\": \r\n main()", "n = int(input())\r\nar=[0]*(n+1)\r\nli=list(map(int,input().split()))\r\nfor i in range(1,n+1):\r\n ar[i-1]=li.index(i)+1\r\nar=ar[:-1]\r\nfor i in ar:\r\n print(i,end=' ')", "n = [0] * int(input())\r\np = list(map(int,input().split()))\r\nfor i in range(len(p)):\r\n n[(p[i] - 1)] = i + 1\r\nprint(*n)", "# Input\r\nn = int(input())\r\ngifts = list(map(int, input().split()))\r\n\r\n# Output\r\nfor i in range(1, n + 1):\r\n print(gifts.index(i) + 1, end=\" \")", "n=int(input())\r\nlis=input().split()\r\nfor i in range(n):\r\n\tprint(lis.index(str(i+1))+1)", "# The idea behind this problem is as follows:\r\n# Get [1] the index value and [2] the int value of a number.\r\n# Turn the index value into a number.\r\n# Assign the index value to its corrosponding int value in a list.\r\n\r\n# Example:\r\n# 2 3 4 1.\r\n# 2 is in position 1. Flip. #1 is assigned to position 2.\r\n# 3 is in position 2. Flip. #2 is assigned to position 3.\r\n# 4 is in position 3. Flip. #3 is assigned to position 4.\r\n# 1 is in position 4. Flip. #3 is assigned to position 1.\r\n# Output:\r\n# 4 1 2 3.\r\n\r\ninput1 = input() # get the number of people at the party.\r\ninput2 = input() # get the list of numbers separated by spaces.\r\n\r\norNumbers = input2 # rename the list of numbers.\r\norList = orNumbers.split() # length of list of numbers.\r\n\r\nreList = [\"\"]*len(orList) # make new list to assign to for output.\r\n\r\n# Have a loop that runs through each number on the list.\r\n\r\nfor n in range(int(input1)):\r\n\r\n # need to get the index value of that number.\r\n # The index value becomes the assignedNumber.\r\n # Add 1 to the assignedNumber because indexes are 0-based.\r\n assignedNumber = n + 1\r\n \r\n\r\n # need to get the value of that number.\r\n # The value of the number becomes the index value of assignedNumber\r\n indexValue = int(orList[n])-1\\\r\n \r\n \r\n # Assign our assignedNumbers to their respective indexValues in the reList variable.\r\n reList[indexValue] = str(assignedNumber) # make str to join later\r\n\r\nreList = \" \".join(reList) # convert list into string with spaces.\r\n\r\nprint(reList) # output reordered string.\r\n", "n = int(input())\nl = list(map(int, input().split()))\n\nd = {i+1: e for i, e in enumerate(l)}\nd = sorted(d.items(), key=lambda x: x[1])\nnew = [t[0] for t in d]\nprint(\" \".join(map(str,new)))\n", "k = int(input())\r\nl = list(map(int, input().split()))\r\n\r\nresult = [0] * k\r\nfor i in range(k):\r\n j = i\r\n while l[j] != i + 1:\r\n j = l[j] - 1\r\n result[i] = j + 1\r\n\r\nprint(' '.join(map(str, result)))\r\n", "n=int(input())\r\nlst=[int(i) for i in input().split()]\r\nfor i in range(len(lst)):\r\n print(lst.index(i+1)+1,end=' ')\r\nprint()", "# Read the number of friends\r\nn = int(input())\r\n\r\n# Read the list of friends who gave gifts\r\ngift_givers = list(map(int, input().split()))\r\n\r\n# Initialize a list to store the recipients\r\nrecipients = [0] * n\r\n\r\n# Fill the recipients list based on the given information\r\nfor i in range(n):\r\n recipients[gift_givers[i] - 1] = i + 1\r\n\r\n# Output the list of recipients\r\nprint(*recipients)\r\n", "n = int(input())\r\n\r\ns = \"\"\r\n\r\np = list(map(int, input().split(' ')))\r\n\r\nfor i in range(n):\r\n s += str(p.index(i + 1) + 1) + ' '\r\n\r\nprint(s)\r\n", "n=int(input())\r\nm=list(map(int,input().split()))\r\nfor i in range(n):\r\n print(m.index(i+1)+1)\r\n ", "n=int(input())\r\np=[int(x) for x in input().split()]\r\np.insert(0,0)\r\ninverse=[0]*(n+1)\r\nfor i in range(1,len(p)):\r\n\tinverse[p[i]]=i \r\nfor i in inverse[1:]:\r\n\tprint(i,end=\" \")", "friends = int(input())\r\nindexes = input()\r\nseparated = indexes.split()\r\n\r\nanswer_list = []\r\nfor x in range(friends):\r\n answer_list.append(\"0\")\r\n\r\nfor x in range(friends):\r\n answer_list[int(separated[x])-1] = x+1\r\n\r\nanswer = \"\"\r\nfor i in range(len(answer_list)):\r\n if i == -1:\r\n answer += answer_list[i]\r\n else:\r\n answer += f\"{answer_list[i]} \"\r\n\r\nprint(answer)", "n = int(input())\r\ndata = input().split()\r\na = [int(x) for x in data]\r\nb = [0] * n\r\nj = 1\r\nfor i in a:\r\n b[i - 1] = j\r\n j += 1\r\nprint(*b)", "n = int(input())\r\nli = input().split()\r\n\r\n\r\nprint(*[li.index(str(i+1))+1 for i in range(n)])", "n=int(input())\r\nreceivers = list(map(int, input().split()))\r\ngivers=[0]*n\r\nfor i in range(n):\r\n givers[receivers[i]-1]=i+1\r\nprint(\" \".join(map(str,givers)))\r\n", "n = int(input())\r\nmas = [int(el) for el in input().split()]\r\nmas2 = [0] * n\r\nfor i in range(n):\r\n mas2[mas[i]-1] = i+1\r\nprint(*mas2)", "def main() :\r\n print_Array(gived_Friend_Nums(input_Taked_Friend_Nums()))\r\n\r\n\r\ndef gived_Friend_Nums(taked_friend_nums) :\r\n gived_friend_nums = [0] * len(taked_friend_nums)\r\n for friend_index in range(len(taked_friend_nums)) :\r\n gived_friend_nums[taked_friend_nums[friend_index] - 1] = friend_index + 1\r\n return gived_friend_nums\r\n\r\n\r\ndef input_Taked_Friend_Nums() :\r\n ignore_Line()\r\n return input_Array()\r\n\r\ndef ignore_Line() :\r\n input()\r\n\r\ndef input_Array() :\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef print_Array(array) :\r\n print(joined_Array(array))\r\n\r\ndef joined_Array(array) :\r\n return \" \".join(map(str, array))\r\n\r\n\r\nmain()", "from sys import stdin\r\ndef input(): return stdin.readline()[:-1]\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nans=[0]*n\r\nfor i in range(n):\r\n\tans[a[i]-1]=i+1\r\nprint(*ans)", "a = int(input())\r\nb = input().split()\r\nfor i in range(1,a + 1):\r\n print(b.index(str(i)) + 1,end = \" \")", "input();p=list(map(int,input().split()))\r\nresult = [i for i in p]\r\nfor i,num in enumerate(p):\r\n result[p[num-1]-1]=str(num)\r\nprint(' '.join(result))\r\n \r\n\r\n", "n = int(input())\r\nlis = input().split()\r\n\r\nlis1 = []\r\nfor i in range(1,len(lis) + 1):\r\n lis1.append(lis.index(str(i)) + 1)\r\n\r\nstr1 = ''\r\nfor i in lis1:\r\n str1 += str(i) + ' '\r\n\r\nprint(str1[0:len(str1)])\r\n\r\n\r\n", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nfor i in range(0, len(lst)):\r\n print(lst.index(i + 1) + 1, end = ' ')", "n = int(input())\r\nl = list(map(int,input().split()))\r\na = [0]*n\r\nfor i in range(len(l)):\r\n a[l[i]-1] = i+1 \r\nfor i in a:\r\n print(i,end=\" \")\r\n\r\n", "x = int(input())\r\ny = str(input())\r\nlist1 = y.split(\" \")\r\nlist2 = []\r\nfor i in list1:\r\n list2.append(int(i))\r\ndict1 = {}\r\nfor j in range(len(list2)):\r\n dict1[list2[j]] = j+1\r\nfor k in dict1:\r\n list2[k-1] = dict1[k]\r\nfor m in list2:\r\n print(m,end=' ')", "size=int(input())\r\narr=list(map(int,input().split()))\r\narr1=[0]*size\r\nfor i in range(size):\r\n arr1[arr[i]-1]=i+1\r\nprint(*arr1)", "n = int(input())\r\n\r\narr=list(map(int,input().split()))\r\narr2=[0]*n\r\n\r\nfor i in range(n):\r\n arr2[arr[i]-1]=i+1\r\nfor i in arr2:\r\n print(i,end=\" \") ", "n = int(input())\r\nfriends = list(map(int, input().split()))\r\nresult = [0] * n\r\n\r\nfor i, num in enumerate(friends):\r\n result[(num - 1)] = i+1\r\n\r\nfor i, num in enumerate(result):\r\n print(num, end='')\r\n if i != n-1:\r\n print(\" \", end='')\r\nprint()", "n = input()\r\nx = map(int, input().split())\r\nx = [e for e in x]\r\ny = [i for i in range(1, len(x)+1)]\r\nz = [i for i in range(len(y))]\r\nfor e in x:\r\n for j in y:\r\n z[e-1] = j\r\n y = y[1::]\r\n break\r\n\r\nfor e in z:\r\n print(e, end=\" \")", "x = int(input())\r\na = []\r\nfor i in range(x):\r\n a.append(0)\r\ns = input().split()\r\nfor i in range(x):\r\n a[int(s[i]) - 1] = i + 1\r\nl = str(a[0]) + \"\"\r\nfor i in range(1, x):\r\n l += \" \" + str(a[i])\r\nprint(l)", "n = int(input())\r\nlst = list(map(int, input().split()))\r\n\r\nfor i in range(len(lst)):\r\n lst[i] = (lst[i], i+1)\r\n\r\nlst.sort()\r\nfor item in lst:\r\n print(item[1], end=' ')", "n = int(input())\np = list(map(int, input().split()))\n\nans = [0] * n\n\nfor i in range(n):\n idx = p[i]\n ans[idx-1] = i+1\n\nans = [str(elem) for elem in ans]\nprint(\" \".join(ans))\n \t \t \t\t \t\t \t \t\t\t\t \t \t\t", "n = int(input())\r\narray = [int(x) for x in input().split(\" \")]\r\nans = [0 for i in range(n)]\r\nfor i in range(n):\r\n val = array[i]\r\n ans[val-1]=i+1\r\nfor i in ans:\r\n print(i)\r\n\r\n", "# Read the input\r\nn = int(input())\r\ngift_givers = list(map(int, input().split()))\r\n\r\n# Initialize a list to store the result\r\nresult = [0] * n\r\n\r\n# Iterate through each friend and find the gift giver\r\nfor i in range(n):\r\n result[gift_givers[i] - 1] = i + 1\r\n\r\n# Print the result\r\nprint(\" \".join(map(str, result)))\r\n", "n=int(input())\r\ns=input().split()\r\nfor i in range(n):\r\n print(*[s.index(str(i+1))+1])", "num = int(input())\r\npresents = input().split(' ')\r\nfinal = {}\r\nfor i in range(len(presents)):\r\n presents[i] = int(presents[i])\r\nfor i in range(len(presents)):\r\n final[presents[i]] = i + 1\r\nresult = []\r\nfor i in range(num):\r\n result.append(str(final[i + 1]))\r\ntotal = ' '.join(result)\r\nprint(total)", "gift_dict={}\nn=int(input())\nlist_of_gifts=list(map(int,input().split()))\nfor i in range(n):\n gift_dict.setdefault(list_of_gifts[i],i+1)\ngift_dict=dict(sorted(gift_dict.items()))\nfor i in gift_dict.values():\n print(i,end=\" \") ", "\r\nfriends = int(input())\r\nfriends_arr = input().split()\r\nanswer_arr = [0] * friends\r\ni = 1\r\nfor friend in friends_arr:\r\n index = int(friend) - 1\r\n answer_arr[index] = str(i)\r\n i += 1\r\nprint(' '.join(answer_arr))\r\n", "# Input\r\nn = int(input())\r\ngivers = list(map(int, input().split()))\r\n\r\n# Create an array to store the friend who gave a gift to each friend\r\nreceivers = [0] * n\r\n\r\n# Fill in the receivers array based on the input\r\nfor i in range(n):\r\n receivers[givers[i] - 1] = i + 1\r\n\r\n# Output the result\r\nprint(*receivers)\r\n", "n = int(input())\r\ng = list(map(int , input().split()))\r\n\r\ngift = [0]*n\r\n\r\nfor i in range(n):\r\n gift[g[i]-1] = i+1\r\n \r\nprint(*gift)\r\n\r\n\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Jun 24 05:32:06 2023\r\n\r\n@author: RadmediX\r\n\"\"\"\r\n\r\nn = int(input())\r\ngift = list(map(int,input().split()))\r\n\r\nr = [0] * (n)\r\n\r\nfor i in range(n):\r\n # print(i)\r\n #print(gift[i])\r\n r[gift[i] -1] = i+1\r\n \r\nprint(' '.join(str(e) for e in r))", "n = int(input())\r\nl = list(map(int, input().split()))\r\nm = [0]*n\r\n \r\nfor i in range(n):\r\n m[l[i]-1] = i + 1\r\nprint(\" \".join(map(str, m)))", "n = int(input())\r\nreceive = [0] * n\r\ngive = [int(n) - 1 for n in input().split()]\r\n\r\nfor i in range(n):\r\n receive[give[i]] = str(i + 1)\r\n\r\nprint(' '.join(receive))", "x = int(input())\r\nb=list(map(int,input().split()))\r\nfor i in range(1,x+1):\r\n print(b.index(i)+1,end=\" \")", "n=int(input())\r\np=list(map(int,input().split()))\r\ngifts=[0]*n\r\nfor i in range(n):\r\n gifts[p[i]-1]=i+1\r\nprint(*gifts)\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\nind = []\r\nfor i in range(1, n + 1):\r\n ind.append(arr.index(i) + 1)\r\nprint(*ind)", "n=int(input())\r\nlis=list(map(int,input().split()))\r\nres=[0]*n\r\nfor i in range(n):\r\n res[lis[i]-1]=i+1\r\nprint(*res)", "import sys\r\nsys.setrecursionlimit(10**7)\r\n# def input(): return sys.stdin.readline()[:-1]\r\n\r\n#################################################################\r\n###### COMMENT FIRST THREE LINS FOR CODEFORCES AND ATCODER ######\r\n#################################################################\r\n\r\n \r\nmod = 10**9 + 7\r\n# def readFloat():return float(input())\r\n# def readFloatList():return list(map(float,input().split()))\r\ndef read_int():return int(input())\r\ndef read_int_list():return list(map(int,input().split()))\r\ndef read_string_list():return list(input())\r\ndef read_string_list_with_space():return list(input().split())\r\ndef read_string():return input()\r\ndef read_graph():\r\n n,m = read_int_list()\r\n graph = [[] for _ in range(n+1)]\r\n for _ in range(m):\r\n u,v = read_int_list()\r\n graph[u].append(v)\r\n # graph[v].append(u)\r\n return graph\r\n\r\n\r\ndef execute():\r\n n = read_int()\r\n h = {}\r\n a = read_int_list()\r\n for i,j in enumerate(a):\r\n h[j] = i+1\r\n r = []\r\n for i in range(n):\r\n r.append(h[i+1])\r\n print(*r)\r\n\r\n \r\nif __name__ == \"__main__\":\r\n execute()\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Jul 31 20:00:05 2023\r\n\r\n@author: lakne\r\n\"\"\"\r\n\r\nn = int(input())\r\np = input().split()\r\ns = []\r\nfor i in range(n):\r\n s.append(str(p.index(str(i+1))+1))\r\n\r\nprint(' '.join(s))", "n = int(input())\r\ngift_givers = list(map(int, input().split()))\r\n\r\ngift_receivers = [0] * n # Initialize an empty list of length n\r\n\r\n# Populate the list of gift receivers\r\nfor i in range(n):\r\n gift_receivers[gift_givers[i] - 1] = i + 1\r\n\r\n# Print the list of gift receivers\r\nprint(*gift_receivers)\r\n", "n = int(input())\r\np = list(map(int, input().split()))\r\ngifts = [0] * n\r\nfor i in range(1, n+1):\r\n j = p[i-1]\r\n gifts[j-1] = i\r\nprint(*gifts)", "friends = int(input())\r\npresents = [int(n) for n in input().split()]\r\nreceived_from = [presents.index(n + 1) + 1 for n in range(friends)]\r\n\r\nprint(*received_from)\r\n", "n=int(input())\r\np=list(map(int,input().split()))\r\nindex=[]\r\nfor i in sorted(p):\r\n a=p.index(i)+1\r\n index.append(a)\r\nprint(*index)", "num = int(input())\r\np_s = list(map(int, input().split()))\r\nf = [0] * (num + 1)\r\nfor i in range(1, num + 1):\r\n f[p_s[i - 1]] = i\r\nprint(f[1], end='')\r\nfor i in range(2, num + 1):\r\n print(\" \", f[i], end='')\r\nprint()", "a = int(input())\r\nb= list(map(int,input().split()))\r\ndict1 = {}\r\nfor i in b:\r\n dict1[i] = b.index(i)\r\nfor i in range(1,len(b)+1):\r\n if i == len(b):\r\n print(dict1[i]+1)\r\n else:\r\n print(dict1[i]+1,end=\" \")", "def solve():\r\n x = int(input())\r\n l = [int(i) for i in input().split()]\r\n new = [0]*x\r\n for i in range(x):\r\n new[l[i]-1] = i+1\r\n print(*new)\r\n\r\n\r\n# t = int(input())\r\nt = 1\r\nwhile t:\r\n solve()\r\n t -= 1\r\n", "nik=int(input())\r\nv=input().split()\r\nprint(*[v.index(str(i+1))+1 for i in range(nik)])", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\ndic = {i:a.index(i)+1 for i in a}\r\n\r\nfor i in range(1,n+1):\r\n print(dic[i], end=\" \")", "n = int(input())\r\np = [int(pi) for pi in input().split()]\r\ns = [p.index(i+1)+1 for i in range(n)]\r\nfor el in s:\r\n print(el, end = ' ')", "l = {int(input()) : [int(i) for i in input().split()]}\r\nfor i in range (list(l.keys())[0]): print(l[list(l.keys())[0]].index(i+1)+1, end = \" \")", "n = int(input())\r\narray = list(map(int, input().split()))\r\n\r\nmapping = dict()\r\n\r\nfor i in range(n):\r\n mapping[array[i]] = i\r\n \r\nresult = [0]*n\r\nfor key in mapping.keys():\r\n result[key-1] = mapping[key] + 1\r\n \r\nfor i in result:\r\n print(i, end = ' ')", "def reordering(t, n):\r\n n = n.split()\r\n betan = n\r\n n = list(map(int, n))\r\n betan = list(map(int,n))\r\n final = \"\"\r\n for i in range(0, t):\r\n final += str(betan.index(min(n))+1) + \" \"\r\n n.remove(min(n))\r\n final = final[:len(final) - 1]\r\n return final\r\n\r\n\r\nt = int(input())\r\nn = input()\r\nprint(reordering(t, n))", "n = int(input())\r\n\r\nm = input().split()\r\nm_fin = [0] * n\r\n\r\nfor i in range(n):\r\n m_fin[i] = str(m.index(str(i + 1)) + 1)\r\n\r\nprint(' '.join(m_fin))", "n = int(input())\ngift = list(map(int, input().split()))\nexchanges = dict()\nfor i in range(1, len(gift)+1,):\n exchanges[gift[i-1]] = i\nfor i in range(1, len(gift)+1,):\n print(exchanges[i], end=' ')", "n = int(input())\r\na = list(map(int,input().split()))\r\nb = a.copy()\r\nfor x in range(1,n+1):\r\n b[a[x-1]-1] = x\r\nfor x in b:\r\n print(x,end=' ')", "a=int(input())\r\nc=[int(x) for x in input().split()]\r\nfor i in range(0,a):\r\n print(c.index(i+1)+1, end=' ')", "n = int(input())\nl = [int(elem) for elem in input().split()]\nres = [elem for elem in l]\nfor i, elem in enumerate(l):\n res[elem-1] = i + 1\nprint(*res)\n", "n=int(input())\r\np=input()\r\np=p.split(\" \")\r\no = list(range(0,n))\r\nresult=\"\"\r\nfor i in range(n):\r\n index = p.index(str(i+1))\r\n s = o[index]+1\r\n result+=str(s)+\" \"\r\nprint(result)\r\n", "n=int(input())\r\nl1=list(map(int, input().split()))\r\nl2=[None]*len(l1)\r\nfor i in range(n):\r\n x=l1[i]-1\r\n l2[x]=i+1\r\nfor i in range(n):\r\n print(l2[i], end=\" \")", "n = int(input())\r\n\r\narr = list(map(int,input().split()))\r\n\r\narr1 = []\r\nfor i in range(1,n+1):\r\n ind = arr.index(i)\r\n arr1.insert(i-1,ind+1)\r\nprint(*arr1)\r\n", "N=int(input())\r\nArr=[0]*(N+1)\r\nL=list(map(int,input().split()))\r\nfor i in range(1,N+1):\r\n Arr[i-1]=L.index(i)+1\r\nArr=Arr[:-1]\r\nfor i in Arr:\r\n print(i,end=' ')", "n = int(input())\r\nmas = [int(el) for el in input().split()]\r\nans = [0] * n\r\nfor i in range(n):\r\n ans[mas[i] - 1] = i + 1\r\nprint(*ans)", "num = int(input());\n\ngift = list(map(int, input().split()))\nresult = [0] * num\nfor i in range(num):\n result[gift[i] - 1] = i + 1\n\nprint(*result);\n \t\t \t \t\t\t \t\t \t\t \t\t \t \t", "n = int(input())\r\np_values = list(map(int, input().split()))\r\n\r\nf = [0] * (n + 1)\r\n\r\nfor i in range(1, n + 1):\r\n f[p_values[i - 1]] = i\r\n\r\nprint(\" \".join(map(str, f[1:])))\r\n", "n=int(input())\r\nz=list(map(int,input().split()))\r\nfor i in range(1,len(z)+1):\r\n print(f\"{z.index(i)+1}\",end=\" \")", "n=int(input())\r\nm={}\r\nN=[int(_) for _ in input().split()]\r\nM=[]\r\noutcome=''\r\nfor _ in range(n):\r\n m[N[_]]=_+1 \r\nN.sort()\r\nfor _ in range(n):\r\n M.append(m.get(N[_])) \r\nfor _ in range(n):\r\n outcome=outcome+f'{M[_]}'+' '\r\nprint(f'{outcome}')\r\n\r\n\r\n\r\n \r\n\r\n\r\n", "def find_gift_givers(n, pi):\r\n result = [0] * n # Initialize an empty list of length n\r\n for i in range(n):\r\n result[pi[i] - 1] = i + 1 # Set the i-th element of the result list\r\n return result\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n pi = list(map(int, input().split()))\r\n result = find_gift_givers(n, pi)\r\n print(\" \".join(map(str, result)))\r\n", "n = int(input())+1\r\nm = list(map(int, input().split()))\r\n\r\nm.insert(0, -3)\r\nl = [0]*n\r\n\r\nfor i in range(1, len(m)):\r\n l[m[i]]=i\r\n\r\nl.pop(0)\r\nprint(*l)", "def find_givers(n, receivers):\r\n givers = [0] * n \r\n for i, receiver in enumerate(receivers, 1):\r\n givers[receiver - 1] = i \r\n return givers\r\n \r\nn = int(input())\r\nreceivers = list(map(int, input().split()))\r\n\r\ngivers = find_givers(n, receivers)\r\nprint(*givers)\r\n", "n = int(input())\r\npi = list(map(int, input().split()))\r\nG = [0] * n\r\nfor i in range(n):\r\n G[pi[i]-1] = i+1\r\nprint(*G)", "def main():\r\n n = int(input())\r\n ans = [0] * n\r\n\r\n p_data = input().split()\r\n for i in range(n):\r\n p = int(p_data[i])\r\n ans[p - 1] = i + 1 # Zero index correction for p\r\n\r\n for i in range(n):\r\n print(ans[i], end=\" \")\r\n print()\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nm = [0] * n # Initialize an empty list of size n\r\n\r\nfor i in range(n):\r\n m[l[i] - 1] = i + 1 # Assign the correct friend number who gave the gift\r\n\r\nfor j in m:\r\n print(j, end=\" \")\r\nprint()\r\n", "n = int(input())\r\nl = input()\r\nl = l.split()\r\nl = [int(x) for x in l]\r\nd= {}\r\nfor i in range(n):\r\n d[l[i]] = i+1\r\nfor key in d:\r\n l[key-1] = d[key]\r\nfor ele in l:\r\n print(ele,end=\" \")\r\n \r\n\r\n", "n = int(input())\r\nx = list(map(int, input().split()))\r\nnew = []\r\nfor i in range(1, n+1):\r\n for z in range(n):\r\n if x[z] == i:\r\n new.append(z+1)\r\n break\r\nprint(*new)", "n = int(input())\r\ngift_giver = list(map(int, input().split()))\r\n\r\ngift_receiver = [0] * n # Initialize the array to store the gift-givers\r\n\r\nfor i in range(n):\r\n gift_receiver[gift_giver[i] - 1] = i + 1\r\n\r\n# Output the result\r\nprint(*gift_receiver)\r\n", "n = int(input())\r\ns = list(map(int, input().split()))\r\n\r\ndef presents(s):\r\n x = [0] * n\r\n for a in range(n):\r\n i = s[a]\r\n x[i - 1] = a + 1\r\n return ' '.join(map(str, x))\r\n\r\nresult = presents(s)\r\nprint(result)", "'''\nPresents \nCF136A\nAd hoc\nEasy\n'''\nN = int(input())\nA = [int(x) for x in input().strip().split()]\nB = [0] * N\nfor i in range(len(A)):\n B[A[i]-1] = i + 1\nB = [str(x) for x in B]\nprint(' '.join(B))\n\n\t \t\t \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# Legends ╚══╝\r\n\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\nprint = sys.stdout.write\r\n\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nb = list(enumerate(a, 1))\r\nb.sort(key=lambda x: x[1])\r\nfor i in range(n):\r\n print(str(b[i][0]) + \" \")\r\n", "n = int(input())\r\ngifts = list(map(int, input().split()))\r\n\r\nresult = [0] * n\r\nfor i, gifter in enumerate(gifts, start=1):\r\n result[gifter - 1] = i\r\n\r\nprint(*result)\r\n", "n=int(input())\r\narr=[int(i) for i in (input()).split(\" \")]\r\nans=[]\r\nfor i in range (1,n+1):\r\n temp=arr.index(i) +1\r\n ans.append(temp)\r\nprint(*ans)", "n = int(input())\r\nsq = [int(i) for i in input().split()]\r\nd = []\r\nfor i in range(1,n+1):\r\n if i in sq:\r\n d.append(sq.index(i) + 1)\r\nprint(*d)", "n = int(input())\r\ngift_givers = list(map(int, input().split()))\r\nans = [0] * n\r\nfor i in range(n):\r\n ans[i] = gift_givers.index(i + 1) + 1\r\nprint(*ans)\r\n", "n=int(input())\r\ns=list(map(int,input().split()))\r\nl=[0]*n\r\nfor i in range(n):\r\n l[s[i]-1]=i+1\r\nprint(*l)\r\n", "n = int(input())\r\na = [int(_) for _ in input().split()]\r\nfor _ in range(1, n + 1):\r\n print(a.index(_) + 1, end=\" \")\r\n", "a, b = int(input()), input().split()\r\nb = [int(i) for i in b]\r\nt = ''\r\nfor i in range(1, a + 1):\r\n c = b.index(i) + 1\r\n t += str(c) + ' '\r\nprint(t)", "n = int(input())\r\nd = {}\r\nl = [int(i) for i in input().split()]\r\nfor i in range(n):\r\n d[i+1] = l[i]\r\nnd = dict((value, key) for key,value in d.items())\r\nfor i in range(1,n+1):\r\n print(nd.get(i), end = \" \")\r\n", "n = int(input())\n\na = list(map(int, input().split()))\nres = [0]*n\nfor i in range(n):\n res[a[i]-1] = i+1\nprint(*res)", "n = int(input())\r\na = input().split(\" \")\r\ni = []\r\nb = []\r\nfor j in range(n):\r\n i.append(j+1)\r\nfor k in range(1,n+1):\r\n b.append(i[a.index(str(k))])\r\nprint(' '.join(map(str, b)))", "def encontrar_amigos_regalos(n, regalos):\r\n amigos = [0] * n \r\n\r\n for i in range(n):\r\n num_amigo = i + 1 \r\n regalo = regalos[i] \r\n \r\n if num_amigo == regalo:\r\n amigos[i] = num_amigo\r\n else:\r\n while True:\r\n siguiente_amigo = regalos[regalo - 1]\r\n if siguiente_amigo == num_amigo:\r\n amigos[i] = regalo\r\n break\r\n regalo = siguiente_amigo\r\n\r\n return amigos\r\n\r\n\r\n\r\n\r\nn = int(input())\r\nregalos = list(map(int, input().split()))\r\nresultados = encontrar_amigos_regalos(n, regalos)\r\nprint(' '.join(map(str, resultados)))", "num = int(input())\r\narr = list(map ( int, input().split()))\r\n\r\nnew_arr = [0 for x in range(num)]\r\nfor x in range(num):\r\n print(arr.index(x+1) + 1 , end= \" \")", "n = int(input(\"\"))\r\nf = [0]*n\r\np = input(\"\").split()\r\nfor i in range(n):\r\n for j in range(n):\r\n if i+1 == int(p[j]):\r\n f[i] = str(j+1)\r\nprint(\" \".join(f))\r\n", "n=int(input())\r\narr=[int(i) for i in input().split()]\r\nl=[]\r\nfor i in range(1,n+1):\r\n l.append(arr.index(i)+1)\r\nprint(*l)", "n=int(input());s=input().split();print(*[s.index(str(i+1))+1for i in range(n)])", "n = int(input())\r\ngifts = list(map(int, input().split()))\r\n\r\ngivers = [0] * n\r\nfor i, g in enumerate(gifts):\r\n givers[g - 1] = i + 1\r\n\r\nprint(*givers)\r\n", "user=int(input())\r\n\r\nL2=[]\r\n\r\nL1 = [int(x) for x in input().split(\" \")]\r\n\r\nfor i in L1:\r\n L2.append(i)\r\n\r\nL3=[None]*user\r\n\r\nfor i in range(0,len(L2)):\r\n num=L2[i]\r\n L3[num-1]=i+1\r\n\r\nfor i in L3:\r\n print(i,end=\" \")", "num_elements = int(input())\r\nelements = input().split()\r\nresult = [elements.index(str(i + 1)) + 1 for i in range(num_elements)]\r\nprint(*result)\r\n", "n = int(input())\r\npi = list(map(int, input().split()))\r\ngift_giver = [0] * n\r\n\r\nfor i in range(1, n+1):\r\n gift_giver[pi[i-1]-1] = i\r\n\r\nprint(*gift_giver)\r\n", "num = int(input())\r\nindex = input().split(' ')\r\nans = ['a']*num\r\n\r\nfor i in range(num):\r\n ans[int(index[i])-1] = str(i+1)\r\nprint(' '.join(ans))", "n = int(input())\r\np = list(map(int, input().split()))\r\nd = {}\r\n\r\nfor i, v in enumerate(p):\r\n d[v] = i + 1\r\n\r\nfor i in range(n):\r\n print(d[i+1])\r\n", "n = int(input())\r\np_list = list(map(int, input().split()))\r\nans = [0] * (n + 1)\r\n\r\nfor i in range(n):\r\n ans[p_list[i]] = i + 1\r\n\r\nfor i in range(1, n + 1):\r\n print(ans[i], end=\" \")\r\n", "n = int(input())\nx = input()\n\nsinp = x.split(\" \")\n\ninp = [int(num) for num in sinp]\n\na = []\nans = []\n\nfor i in range(1, n+1):\n a.append(i)\n\nfor i in range(n):\n ans.append(0)\n\nfor i in range(n):\n ans[inp[i]-1] = a[i]\n\nfor i in ans:\n print(str(i), end = ' ')\n\n", "n = int(input())\nguest = list(map(int, input().split()))\n\nresult = [0] * n\n\nfor i in range(n):\n result[guest[i] - 1] = i + 1\n\no = \"\"\nfor r in result:\n o = o + str(r) + \" \"\n\nprint(o)\n\n\n \t\t\t\t \t\t\t\t \t\t\t \t \t\t \t \t \t\t", "resList = [0]*int(input())\r\nfor idx,x in enumerate(input().split()):\r\n resList[int(x)-1] = str(idx+1)\r\nprint(' '.join(resList))", "friends = int(input())\r\ndata = list(map(int, input().split()))\r\ndata_2 = data.copy()\r\nfor i in range(len(data)):\r\n data[i] = data_2.index(i + 1) + 1\r\nprint(' '.join(map(str, data)))", "n = int(input())\r\nd = list(map(int, input().split()))\r\nm = [0] * n\r\nfor i in range(n):\r\n m[d[i] - 1] = str(i + 1)\r\nprint(' '.join(m))", "n = int(input())\r\ng = list(map(int, input().split()))\r\n\r\na = [0] * n\r\n\r\nfor i in range(n):\r\n a[g[i] - 1] = i + 1\r\n\r\nprint(*a)\r\n", "n=int(input())\r\nx=list(map(int,input().split()))\r\narr=x[:]\r\nfor i in range(n):\r\n x[arr[i]-1]=i+1\r\nfor i in range(n):\r\n print(x[i],end=\" \")\r\n\r\n", "\nn = int(input())\n\nPis = [int(i) for i in input().split(\" \")]\nfriends = [0] * n\n\nfor i in range (n):\n friends[Pis[i]-1] = i+1\n\nprint(*friends)", "x=int(input())\r\nz=list(map(int,input().split()))\r\nl=[]\r\nfor i in sorted(z):\r\n for j in z:\r\n if i == j:\r\n l.append(z.index(i)+1)\r\n\r\n\r\nprint(*l)", "n = int(input()) # Read the number of friends\r\ngifts = [int(x) for x in input().split()] # Read the list of gift-givers\r\n\r\nresult = [0] * n # Initialize a list to store the gift-givers\r\n\r\nfor i in range(n):\r\n result[gifts[i] - 1] = i + 1\r\n\r\n# Print the result\r\nprint(' '.join(str(x) for x in result))", "x = int(input())\r\nAmigos= list(map(int, input().split()))\r\n\r\n# initialize a list of length x to store the Presents\r\nPresents= [0] * x\r\n\r\n# assign Presents to the corresponding Amigo\r\nfor i in range(x):\r\n Presents[Amigos[i] - 1] = i + 1\r\n\r\n# print out the Presents in the desired order\r\nprint(' '.join(map(str, Presents)))\r\n", "n = int(input()); a = list(map(int, input().split()))\r\nl = [0 for i in range(n)]\r\nfor i in range(n):\r\n l[a[i]-1] = i+1\r\nprint(*l)", "n=int(input())\r\na=list(map(int,input().split()))\r\nk=[0]*n\r\nfor i in range(n):\r\n k[a[i]-1]=i+1\r\nprint(*k)", "z = int(input())\r\ngivers = list(map(int, input().split()))\r\n\r\nreceivers = [0] * z # Initialize the receivers array with zeros\r\n\r\nfor i in range(z):\r\n receivers[givers[i] - 1] = i + 1 # Update the receiver's index\r\n\r\nprint(*receivers)\r\n", "input()\r\nlst = input().split()\r\ndic = {}\r\nans = ''\r\nn=0\r\nfor i in lst:\r\n\tn+=1\r\n\tdic[str(n)] = i\r\n\r\n# 1:2 2:3 3:4 4:1\r\nvalues = dic.values()\r\nfor i in dic.keys():\r\n\tfor key,value in dic.items():\r\n\t\tif value==i:\r\n\t\t\tans+=key+' '\r\nprint(ans)", "n = int(input())\r\nl = list(map(int, input().split(' ')))\r\nm = []\r\ni = 0\r\no = 1\r\nwhile len(m) < n:\r\n i += 1\r\n if l[i-1] == o:\r\n m.append(i)\r\n i = 0\r\n o += 1\r\nfor i in m:\r\n print(i, end=' ')", "n = int(input())\r\nres = [None] * n\r\nnums = list(map(int, input().split()))\r\nfor i, num in enumerate(nums, start=1):\r\n res[num - 1] = i\r\nprint(*res)", "n = int(input())\r\nspisok = list(map(int, input().split()))\r\nk = list()\r\nfor i in range(n):\r\n k.append(0)\r\nfor i in range(n):\r\n for j in range(n):\r\n if spisok[j] == i+1:\r\n k[i] = j+1\r\nprint(*k)\r\n", "n = int(input())\r\na=input().split()\r\nb = ''\r\nfor i in range(len(a)):\r\n a[i] = int(a[i])\r\nm = []\r\nfor i in range(n):\r\n m.append(' ')\r\nfor i in range(len(a)):\r\n m[i] = a.index(i+1)+1\r\nfor i in m:\r\n b= b + str(i) + ' '\r\nprint(b)", "n = int(input())\ng = list(map(int,input().split()))\ngr = [0] * n\nfor i in range(n):\n gr[g[i] - 1] = i + 1\nprint(*gr)", "ns = int(input()) \r\nl = list(map(int,input().split(' '))) # 2 3 4 1\r\nkl = []\r\nc1 = 1\r\nc2 = 0\r\nfor k in range(0,ns) : \r\n c2=0\r\n for i in l : \r\n c2 +=1\r\n if i == c1 : \r\n kl.append(c2) \r\n c1+=1\r\nprint(*kl)", "def main():\n n = int(input())\n s = [int(i) for i in input().split()]\n for i in range(1, max(s) + 1):\n print(s.index(i) + 1, end=' ')\n\n\n\nif __name__ == '__main__':\n main()\n", "x=int(input())\r\na=list(map(int,input().split()))\r\nl=[0]*x\r\nfor i in range(len(a)):\r\n l[a[i]-1]=i+1\r\nprint(*(l))\r\n", "def main(arr):\r\n brr = [0] * len(arr)\r\n\r\n for i in range(len(arr)):\r\n brr[arr[i] - 1] = str(i + 1)\r\n\r\n return \" \".join(brr)\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))", "n= int(input())\r\ns= input().split()\r\nlst = [int(p) for p in s]\r\nout=[]\r\nfor i in range(1,n+1):\r\n a = lst.index(i)+1\r\n out.append(a)\r\n\r\nfor j in out:\r\n print(j,end=' ')\r\n", "n=int(input())\r\np1=list(map(int,input().split()))\r\np2=['']*n\r\nfor i in range(n):\r\n a=p1[i]-1\r\n p2[a]=i+1\r\nprint(*p2)", "import sys\r\nimport string\r\n\r\ninput = sys.stdin.readline\r\n\r\ndef print(*args, end='\\n', sep=' ') -> None:\r\n sys.stdout.write(sep.join(map(str, args)) + end)\r\n\r\ndef main() -> None:\r\n n = int(input())\r\n p = map(int, input().split())\r\n _, p = zip(*sorted(zip(p, range(1, n + 1)), key=lambda x: x[0]))\r\n\r\n print(*p)\r\n\r\nif __name__ == '__main__':\r\n main()", "n = int(input())\r\nans = [0]*n\r\narr = [int(i) for i in input().split()]\r\nfor i in range(n):\r\n ans[arr[i]-1] = i+1\r\nfor i in ans:\r\n print(i,end=' ')\r\nprint()", "n=int(input())\r\nl=list(map(int,input().split()))\r\nfor i in (sorted(l)):\r\n print(l.index(i)+1,end=\" \")\r\n", "n = int(input())\r\ngiftsList = list(map(int,input().split()))\r\n\r\n\r\nfor index,value in enumerate(giftsList[::]):\r\n giftsList[value-1] = index + 1\r\n\r\nfor present in giftsList:\r\n print(present, end=\" \")\r\n \r\n", "n = input()\r\nx = input()\r\nlist = x.split(\" \")\r\nfinal = \"\"\r\n\r\nfor i in range(1, len(list) + 1):\r\n final += str(list.index(str(i)) + 1)\r\n if i != len(list):\r\n final += \" \"\r\n\r\nprint(final)\r\n", "n= int(input())\r\nx=input().split()\r\ns=''\r\nfor i in range(1,n+1):\r\n c=0\r\n a=str(i)\r\n for j in x:\r\n if j==a:\r\n c+=1\r\n break\r\n else:\r\n c+=1\r\n s+=str(c)+' '\r\nprint(s)", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nd=[0]*n\r\nfor i in range(n):\r\n d[a[i]-1]=str(i+1)\r\nm=\" \".join(d)\r\nprint(m)", "col=int(input())\r\nmassiv=list(map(int, input().split()))\r\nnew_massiv=[0]*col\r\npresent={}\r\nfor i in range(col):\r\n index=massiv[i]-1\r\n value=i+1\r\n new_massiv[index]=value\r\n\r\nfor i in new_massiv:\r\n print(i, end=' ')", "arranged_friends = [0 for _ in range(int(input()))]\r\nfriends = [int(friend) for friend in input().split()]\r\nfor i, friend in enumerate(friends):\r\n arranged_friends[friend - 1] = str(i + 1)\r\nprint(\" \".join(arranged_friends))\r\n", "\r\na=int(input())\r\nlist=list(map(int, input().split()))\r\nwazly=[]\r\n\r\nfor x in range(1,max(list)+1):\r\n wazly.append(x)\r\n\r\nfor f in wazly:\r\n print(list.index(f)+1,end=\" \")", "n = int(input())\r\ns = list(map(int , input().split()))\r\nd ={}\r\nl=[]\r\nst = map(str ,l)\r\nfor i,x in enumerate(s):\r\n\td[x] = i+1\r\nfor t in range(len(d)):\r\n\tx=d[t+1]\r\n\tl.append(x)\r\nprint(' '.join(st))", "n = int(input())\r\ngivers = list(map(int, input().split()))\r\n\r\nreceivers = [0] * n\r\n\r\nfor i, giver in enumerate(givers, start=1):\r\n receivers[giver - 1] = i\r\n\r\nfor receiver in receivers:\r\n print(receiver, end=\" \")", "y=int(input())\r\nd={}\r\nlis=list(map(int,input().split()))\r\nfor i in range(1,y+1):\r\n d[lis[i-1]]=i\r\nfor i in range(1,y+1):\r\n print(d[i],end=\" \")", "a = int(input())\r\nlst = list(map(int, input().split()))\r\nres = []\r\nfor item in range(1, a+1):\r\n res.append(lst.index(item) + 1)\r\n \r\nprint(*res)\r\n \r\n\r\n\r\n \r\n\r\n", "def Presents(n):\r\n presents=list(map(int,input().split()))\r\n presents2=[x for x in range(n)]\r\n for i in range(n):\r\n presents2[i]=presents.index(i+1)\r\n s=' '.join(str(x+1) for x in presents2)\r\n print(s)\r\nn=int(input())\r\nPresents(n)", "n = int(input())\r\ns = input().split()\r\nprint(*[s.index(str(i+1)) + 1 for i in range(n)])", "n=int(input())\r\nl=[]\r\nm=list((int(i) for i in input().split()))\r\na=0\r\nb=0\r\nfor i in range(len(m)):\r\n a+=1\r\n while a != m[b]:\r\n b+=1\r\n l.append(b + 1)\r\n b=0\r\nfor i in l:\r\n print(i,end=\" \")", "n = int(input())\r\nl = list(map(int, input().split()))\r\nans = ''\r\nfor i in range(1, n+1):\r\n ans += str(l.index(i)+1)\r\n if i < n:\r\n ans += ' '\r\nprint(ans)", "\r\nn=int(input())\r\nlst=list(map(int,input().split()))\r\nd=dict()\r\nfor i in range(n):\r\n d[lst[i]]=i+1\r\n\r\nfor i in range(n):\r\n print(d.get(i+1),end=\" \")\r\n", "n=int(input())\r\na=input().split(' ')\r\nb=[]\r\nfor i in range(1,n+1):\r\n b.append(a.index(str(i))+1)\r\nprint(*b)", "result_list = []\r\n\r\nn = int(input())\r\n\r\nnums = [int(num) for num in input().split()]\r\n\r\nfor i in range(1, n+1):\r\n result_list.append(nums.index(i)+1)\r\n\r\nresult = ' '.join(str(num) for num in result_list)\r\nprint(result)\r\n", "n = input()\r\nstring = input()\r\narr = [\r\n each.strip()\r\n for each in string.split(\" \")\r\n]\r\n\r\nans = \"\"\r\nfor i in range(len(arr)):\r\n for j in range(len(arr)):\r\n if i+1 == int(arr[j]):\r\n ans += \" \" + str(j+1)\r\n break\r\n \r\nprint(ans[1:])\r\n\r\n \r\n ", "n = int(input())\r\np = list(map(int, input().split()))\r\nsp = sorted(p)\r\nr = ''\r\nfor a in sp:\r\n r += str(p.index(a) +1) + ' '\r\nprint(r)", "n = int(input()) # Number of friends\r\ngift_givers = list(map(int, input().split())) # List of gift givers\r\n\r\ngift_receivers = [0] * n # Initialize an array to store the gift receivers\r\n\r\nfor i in range(n):\r\n gift_receivers[i] = gift_givers.index(i + 1) + 1\r\n\r\nprint(*gift_receivers)\r\n", "n=int(input())\r\ngifts=input().split(\" \")\r\nrev_gifts=[*range(n)]\r\n\r\nfor num in range(len(gifts)):\r\n gifts[num]=int(gifts[num])\r\n\r\nfor num1 in range(1,n+1):\r\n gst_rec_gift=gifts.index(num1)\r\n rev_gifts[num1-1]=gst_rec_gift+1\r\n#print(rev_gifts)\r\n# [4, 1, 2, 3]\r\n\r\nfor num2 in range(len(gifts)):\r\n rev_gifts[num2]=str(rev_gifts[num2])\r\nfin_gifts=\" \".join(rev_gifts)\r\n\r\nprint(fin_gifts)", "n = input()\r\narr = [int(num) for num in input().split()]\r\nres = {}\r\nindex = []\r\nfor ind,num in enumerate(arr):\r\n res[num] = ind+1\r\n index.append(ind+1)\r\nfor i in index:\r\n print(res[i],end=\" \")", "n = int(input())\r\ndata = [None] * n # [receive]=send\r\nfor i, p in enumerate(map(int, input().split()), start=1):\r\n data[p-1] = i\r\nprint(*data)", "\r\na=int(input())\r\nb=input()\r\nc=b.split()\r\nc=list(map(int, c))\r\nd=list(range(a))\r\nfor i in range(a):\r\n\tl=c[i]\r\n\td[l-1]=i+1\r\nfor i in range(a):\r\n\tprint (d[i])", "n=int(input())\r\nx=input().split()\r\nz=[int(i) for i in x]\r\nl=sorted(z)\r\npos=[]\r\nfor i in l:\r\n pos.append(z.index(i)+1)\r\nprint(*pos)", "n=int(input())\r\nx = list(map(int, input().split()))\r\n\r\nds={}\r\n\r\nfor i in range(len(x)):\r\n ds[x[i]] = (i+1)\r\n\r\nres=\"\"\r\nfor i in range(n):\r\n res+=\" \"+str(ds[i+1])\r\n\r\nprint(res[1:])", "n=int(input())\r\narr=list(map(int, input().split()))\r\n\r\n\r\nfor i in range(0,n):\r\n if i+1 in arr:\r\n print(arr.index(i+1)+1, end=\" \")\r\n ", "n=int(input())\r\nchoqua=[\"0\"]\r\nchoqua.extend(input().split())\r\nchoqua_copy=choqua.copy()\r\nfor i in range(1,n+1):\r\n choqua[int(choqua_copy[i])]=str(i)\r\noutput=\"\"\r\nfor i in range(1,n):\r\n output+=choqua[i]+\" \"\r\noutput+=choqua[n]\r\nprint(output)", "\r\n#n => number of friends\r\nn = int(input())\r\n#line number of pi number of friend who gave present to friend i\r\nd = {}\r\npi = list(map(int, input().split(\" \")))\r\nfor i in range(n):\r\n d[i+1] = pi[i]\r\n#Accessing keys from values in dicts\r\n# s = list(d.keys())\r\n# l = list(d.values()).index(1)\r\n# print(s)\r\n# print(l)\r\nfor i in range(1,n+1):\r\n print(list(d.keys())\r\n [list(d.values()).index(i)], end=\" \")\r\nprint()", "n = int(input())\na = [int(x) for x in input().split()]\nans = [\"\"]*n\nfor i in range(n):\n ans[a[i]-1] = str(i+1)\n\nprint(\" \".join(ans))\n", "import sys\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# # your remaining code\r\n\r\nn =int(input())\r\n\r\na = list(map(int,input().split()))\r\n\r\nres = []\r\n\r\nfor i,n in enumerate(a):\r\n\t\tr = []\r\n\t\tr.append(i+1)\r\n\t\tr.append(n)\r\n\t\tres.append(r)\r\n\r\nres.sort(key= lambda x: x[1])\r\n\r\nfor i in res:\r\n\tprint(i[0],end=' ')\r\n\r\n\r\n\r\n\r\n\t\r\n\r\n\r\n\r\n\r\n\t\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\nprint(*list(l.index(i) + 1 for i in range(1, 1+n)))", "n=int(input())\r\nl=list(map(int, input().split()))\r\nl1=[0 for i in range(n)]\r\nfor i in range(n):\r\n l1[l[i]-1]=i+1\r\nfor i in l1:\r\n print(i,end=' ')", "n = int(input())\r\ngifts = list(map(int, input().split()))\r\n\r\ngifts2 = [0]*n\r\n\r\nfor i in range(n):\r\n gifts2[gifts[i]-1]= i+1\r\n\r\nprint(*gifts2)\r\n", "a=int(input())\r\nb=list(map(int,input().split()))\r\nl=[None for i in range(a)]\r\nc=1\r\nfor j in b:\r\n l[j-1]=c\r\n c+=1\r\nfor k in l:\r\n print(k,end=' ')", "n = int(input())\r\ngifts = list(map(int,input().split()))\r\nnew_g = [1]*len(gifts)\r\nfor i in range(len(gifts)):\r\n new_g[gifts[i]-1] = str(i+1)\r\nprint(' '.join(new_g))", "n = int(input())\r\narr_input = input().split()\r\nresult = [arr_input.index(str(i + 1)) + 1 for i in range(n)]\r\nprint(*result)\r\n", "n= int(input())\nls = list(map(int,input().split()))\na=[0]*n\nfor i in range(n):\n a[ls[i]-1] = i+1\nfor i in range(n):\n print(a[i],end=\" \")\n\t\t\t \t\t\t\t\t \t \t \t\t \t\t \t", "n = int(input())\r\np = list(map(int,input().split()))\r\n\r\nans = [0]*n\r\nfor i in range(n):\r\n ans[p[i]-1]=i+1\r\n\r\nprint(*ans)", "def find_gift_givers(n, gift_list):\n gift_givers = [-1] * n # Initialize a list to store the gift givers\n\n for i in range(n):\n friend_number = i + 1\n gift_receiver = gift_list[i]\n\n # Check if the friend gave the gift to themselves\n if friend_number == gift_receiver:\n gift_givers[i] = friend_number\n else:\n # Find the friend who gave the gift to the current friend\n gifter_index = gift_list.index(friend_number) + 1\n gift_givers[i] = gifter_index\n\n return gift_givers\n\n# Reading input\nn = int(input())\ngift_list = list(map(int, input().split()))\n\n# Getting the result\nresult = find_gift_givers(n, gift_list)\n\n# Printing the result\nprint(*result)\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 = list(map(int,input().split()))\r\nans = [0 for i in range(n+1)]\r\nfor i in range(n):\r\n ans[arr[i]] = i+1\r\nfor i in range(1,n+1):\r\n print(ans[i],end = \" \")", "x= int(input())\r\ngifts = list(map(int,input().split()))\r\nfor i in range(1,len(gifts)+1):\r\n print(gifts.index(i)+1,end=\" \")", "n = input()\r\nvalue = list(map(int, input().split(' ')))\r\nresult = [None] * len(value)\r\n\r\nfor i in range(len(value)):\r\n result[value[i] - 1] = str(i + 1)\r\nprint(\" \".join(result))", "n = int(input())\r\ngifts = list(map(int, input().split()))\r\n\r\n# Initialize an empty result list\r\nresult = [0] * n\r\n\r\n# Assign gifts to their recipients in the result list\r\nfor i in range(n):\r\n result[gifts[i] - 1] = i + 1\r\n\r\n# Print the result\r\nprint(*result)", "n = int(input())\r\np = list(map(int, input().split()))\r\ninit_arr = []\r\n\r\nfor _ in p:\r\n init_arr.append(0)\r\n\r\nfor i in range(len(p)):\r\n init_arr[p[i]-1] = i+1\r\n\r\nprint(*init_arr)", "n = int(input().strip())\r\np = list(map(int, input().strip().split()))\r\ngift_givers = [0] * n\r\nfor i, gift_receiver in enumerate(p):\r\n gift_givers[gift_receiver - 1] = i + 1\r\nprint(*gift_givers)", "input()\r\ntoPres = list(map(int, input().split()))\r\nfromPres = [0] * len(toPres)\r\nfor ind, val in enumerate(toPres):\r\n fromPres[val - 1] = ind + 1\r\nprint(*fromPres)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Sep 5 11:01:18 2023\r\n\r\n@author: HyFlu\r\n\"\"\"\r\n\r\npeople=int(input())\r\ngive=input().split()\r\ngive=[int(give[i]) for i in range(people)]\r\nreceive=[]\r\nfor i in range(people):\r\n receive.append(i)\r\nfor i in range(people):\r\n receive[give[i]-1]=i+1\r\nfor i in range(people):\r\n print(receive[i],end=' ')", "k=int(input())\r\nr=list(map(int,input().split()))\r\ns=r.copy()\r\nfor i in range(k):\r\n s[r[i]-1]=i+1\r\nprint(*s)", "n = int(input())\r\np = list(map(int, input().split()))\r\nans = list('0' * n)\r\nfor i in range(n):\r\n index = p[i] - 1\r\n ans[index] = str(i + 1)\r\nprint(' '.join(ans))\r\n\r\n", "n = int(input())\r\nx = [int(i) for i in input().split()]\r\ny = [0] * n\r\n\r\nfor i in range(n):\r\n y[x[i] - 1] = i + 1\r\n\r\nprint(*y)\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nb = [0 for i in range(n)]\r\nfor i in range(n):\r\n b[a[i] - 1] = i + 1\r\nprint(*b)", "n=int(input())\r\narr=list(map(int,input().split()))\r\nd={}\r\nc=1\r\nfor i in arr:\r\n d[i]=c\r\n c+=1\r\nfor i in d:\r\n arr[i-1]=d[i]\r\n\r\nfor i in arr:\r\n print(i,end=\" \")\r\n \r\n ", "n = int(input())\r\nv1 = list(map(int, input().split()))\r\n\r\nv2 = [0] * n\r\nfor i in range(n):\r\n v2[v1[i] - 1] = i + 1\r\n\r\nfor i in range(n):\r\n print(v2[i], end=\" \")", "nandu=int(input());\r\nsai=input().split();\r\nprint(*[sai.index(str(i+1))+1for i in range(nandu)])", "n = int(input()); a1 = [int(x) for x in input().split()]; a2 = [0]*n;\r\n\r\na3 = []; a3 = sorted([[a1[i], i+1] for i in range(n)]);\r\na4 = [a3[i][1] for i in range(n)];\r\nprint(*a4);", "a = int(input())\r\nb = list(map(int , input().split()))\r\nc = [0] * (a + 1)\r\nfor i in range(a):\r\n c[b[i]] = i + 1\r\nfor i in range(1 , a + 1):\r\n print(c[i] , end = \" \")\r\n ", "n = eval(input())\r\nx=list(map(int,input().split(' ')))\r\nfor i in range(len(x)):\r\n x[i]-=1\r\nfor i in range(n):\r\n print(x.index(i)+1,end=' ')", "n =int(input())\r\nnum=map(int,input().split())\r\nnum=list(num)\r\nnum2=[None]*n\r\nfor i , s in zip(num,range(n)): \r\n num2[i-1]=s+1\r\nfor i in num2:\r\n print(i,end=\" \")", "n = int(input())\r\npeople = list(map(int,input().split()))\r\n\r\nblank = ['-' for x in people]\r\n\r\ni = 0\r\nfor x in people:\r\n blank[x-1] = i+1\r\n i += 1\r\noutput = list(map(str,blank))\r\n\r\nprint(\" \".join(output))", "n=int(input())\r\nl=list(map(int,(input().split())))\r\nm=list(range(1,n+1))\r\n\r\nd={m[i] : l[i] for i in range(len(m))}\r\nss=sorted(d.items(),key=lambda x:x[1])\r\nsorted_dict=dict(ss)\r\nprint(*sorted_dict.keys())", "x = int(input())\r\ny = input()\r\ny = y.split(\" \")\r\narr = []\r\nfor i in range(x):\r\n arr.append(\"0\")\r\nfor i in range(x):\r\n arr[int(y[i])-1] = i + 1\r\nz = str(\"\")\r\nfor i in arr:\r\n z = str(z) + str(i)\r\n z += (\" \")\r\nprint(z)", "n=int(input())\nl=list(input().split())\nl1=[]\nfor i in l:\n\tl1.append(int(i))\nl2=[]\nfor k in range(1,n+1):\n\tfor j in range(n):\n\t\tif l1[j]==k:\n\t\t\tl2.append(j+1)\nfor i in l2:\n\tprint(i,end=' ')\n\n\n\t\n\n\n\n\n", "n = int(input())\r\nf = [int(x) for x in input().split(\" \")]\r\no = [0 for i in range(n)]\r\nfor i in range(n):\r\n o[f[i]-1] = i+1\r\nprint(*o, sep=\" \")", "a = int(input())\r\nb = input().split()\r\n\r\nindices = [b.index(str(i + 1)) + 1 for i in range(a)]\r\nprint(*indices)\r\n", "n = int(input()) # Number of friends\r\ngifts = list(map(int, input().split())) # Input list of gifts\r\n\r\nresult = [0] * n # Initialize result list\r\n\r\nfor i in range(n):\r\n result[gifts[i] - 1] = i + 1 # Set the i-th friend as the giver of the gift to friend gifts[i]\r\n\r\nprint(*result)\r\n", "chir = int(input())\r\nabc = list(int(chir) for chir in input().split())\r\ns0l = []\r\nfor van in range(1,chir+1):\r\n s0l.append(1+abc.index(van))\r\ns88 = ''\r\nfor sur in s0l:\r\n s88 += str(sur) + ' '\r\nprint(s88)", "n = int(input())\r\ngord = list(map(int,input().split()))\r\nlgift = [0 for i in range (n)]\r\nfor i in range(n):\r\n temp = gord[i] -1\r\n temp = gord[temp]-1\r\n lgift[temp] = gord[i]\r\nfor i in range(n):\r\n print(lgift[i], end=' ' if i != n-1 else '')", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl_ =[]\r\nii=1\r\nfor i in range(n):\r\n l_.extend([l.index(i+1)+1])\r\nprint(*l_)", "n = int(input())\r\nls = list(map(int, input().split()))\r\ndls = [0]*len(ls)\r\nfor i,el in enumerate(ls):\r\n dls[el-1] = i+1\r\nprint(*dls)", "n=int(input());w=input().split();print(*[w.index(str(i+1))+1for i in range(n)])", "n=int(input())\nli=list(map(int,input().split(' ')))\n\nnew_li=[0]*n\n\nfor i in range(n):\n j=int(li[i])-1\n new_li[j]=i+1\n \nfor i in new_li:\n print(i,end=\" \")\n \n\t\t \t \t\t \t\t \t \t\t\t\t\t \t \t\t", "n = int(input())\r\nfriendnumberi=(input().split())\r\na = [0] * 101\r\nfor i in range(1, n + 1):\r\n a[int(friendnumberi[i-1])]= i\r\n\r\nfor i in range(1, n + 1):\r\n print(a[i], end=' ')", "n=int(input())\r\nfriends=input().split()\r\nfriend=[]\r\nfor i in range(n):\r\n a=friends.index(str(i+1))\r\n friend.append(str(a+1))\r\nprint(' '.join(friend))", "n=int(input())\r\nl1=list(map(int,input().split()))\r\nfor i in range(n):\r\n print(l1.index(i+1)+1)", "n = int(input())\r\nsentence = list(map(int,input().split()))\r\nword_list = [\"\"]*int(len(sentence))\r\nif n == int(len(sentence)):\r\n for i,num in enumerate(sentence):\r\n word_list[num - 1] = i + 1\r\nword_list = list(map(str,word_list))\r\nword = \" \".join(word_list)\r\nprint(word)", "n = int(input())\r\nans = {}\r\nfor i, c in enumerate(p := list(map(int, input().split()))):\r\n ans[c] = i + 1\r\nfor i in range(1, n + 1):\r\n print(ans[i], end=\" \")\r\n", "n = int(input())\r\na1 = [int(x) for x in input().split()]\r\na2 = [0]*n\r\n \r\nfor i in range(1, n+1):\r\n a2[a1[i-1]-1] = i\r\nprint(*a2)", "n = int(input())\r\npi_values = list(map(int, input().split()))\r\n\r\ngift_giver = [0] * n\r\n\r\nfor i, pi in enumerate(pi_values):\r\n gift_giver[pi - 1] = i + 1\r\n\r\nprint(*gift_giver)", "n=int(input())\r\nentrada=input().split()\r\nnumeros=[int(x)-1 for x in entrada]\r\nhola=[int(x)-1 for x in entrada]\r\nfor i in range(n):\r\n hola[numeros[i]]=i+1\r\nhola=[str(x) for x in hola]\r\nprint(\" \".join(hola))", "n = int(input())\r\ngivenames = input().split()\r\ngivenames1 = [int(num) for num in givenames]\r\noutputlst = [0 for i in range(n)]\r\n\r\nfor i in range(n):\r\n\tgiver = givenames1[i]\r\n\toutputlst[giver - 1] = i + 1\r\n\r\nlst = [str(num) for num in outputlst]\r\n\r\nprint(\" \".join(lst)) ", "n=int(input())\r\nlist1=list(input().split(' '))\r\nfor i in range(1,n+1):\r\n for j in range(len(list1)):\r\n if(int(list1[j])==i):\r\n print(j+1,end=' ')\r\n \r\n", "num = int(input())\r\nmappedDict = dict((i,Pi) for (i, Pi) in enumerate(list(map(int, input().split()))))\r\nfor i in dict(sorted(mappedDict.items(), key=lambda x:x[1])).keys():\r\n print(i+1, end=\" \")\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nsol = [0]*n\r\n\r\nfor i in range(n):\r\n sol[arr[i]-1] = i+1\r\n\r\nprint(\" \".join(map(str, sol)))", "n=int(input())\r\nlst=list(map(int,input().split()))\r\ng={} \r\nfor i in range(n):\r\n g[lst[i]]=i+1 \r\nprint(*[g[i] for i in range(1,n+1)])", "'''\r\nlogika:\r\ninput: 4\r\n 2 3 4 1\r\n\r\n---> prijatelj broj 1 je dao poklon prijatelju broj 2, prijatelj broj 2 je dao poklon prijatelju broj 3....\r\n'''\r\n\r\nn = int(input())\r\nfr1 = list(map(int,input().split()))\r\nfr2 = [0] * n\r\n\r\nfor i in range(n):\r\n fr2[fr1[i] - 1 ] = i + 1\r\n \r\nprint(' '.join(list(map(str, fr2))))", "n = int(input())\r\na = list(map(int, input().split()))\r\nli = [0] * n\r\nfor i, e in enumerate(a):\r\n li[e - 1] = i + 1\r\nprint(*li)", "n=int(input())\r\np=input().split()\r\nfor i in range (n):\r\n for j in range(n):\r\n if p[j]==str(i+1):\r\n print(j+1,end=' ')", "n=int(input())\r\nd={}\r\nl=list(map(int,input().split()))\r\nfor i in range(n):\r\n d[i+1]=l[i]\r\nfor v in d.keys():\r\n l[d[v]-1]=v\r\nfor i in l:\r\n print(i,end=' ')\r\n \r\n", "x,pp,ll =int(input()),list(map(int,input().split())),[]\r\nfor i in range(1,x+1):\r\n ll.append(pp.index(i)+1)\r\nprint(*ll)", "n = int(input())\r\np_friends = [int(x) for x in input().split()]\r\ni_friends = ['' for _ in range(n)]\r\nfor i, p in enumerate(p_friends):\r\n i_friends[p-1] = str(i + 1)\r\nprint(' '.join(i_friends))\r\n", "n=int(input())\r\np=[]\r\nfor _ in range(n):\r\n\tp.append(0)\r\nf=list(map(int, input().split()))\r\nfor i in range(len(f)):\r\n\tp[f[i]-1]=i\r\nfor g in p:\r\n\tprint(g+1,end=\" \" if g!=p[len(p)-1] else \"\")", "o=int(input())\r\ne=list(map(int,input().split()))\r\nfor i in range(1,o+1):\r\n print(e.index(i)+1,end=\" \")", "n = int(input())\r\ninput = list(map(int, input().split()))\r\noutput = []\r\nfor i in range(n):\r\n output.append(0)\r\n output[i] = input.index(i+1) + 1\r\n print(output[i], end = \" \")", "n= int(input())\r\np_arr=list(map(int,input().split()))\r\nresult=[0]*n\r\nfor i in range(0,n):\r\n result[p_arr[i]-1]=i +1\r\nprint(\" \".join(str(elem) for elem in result))", "n = int(input())\r\nls = list(map(int, input().split()))\r\n\r\nvalores = {}\r\nfor i in range(n):\r\n valores[ls[i]] = i + 1\r\n\r\nkeys = valores.keys()\r\nsorted_keys = sorted(keys)\r\ncad = \"\"\r\nfor i in sorted_keys:\r\n cad = cad + str((valores.get(i))) + \" \"\r\n\r\nprint(cad[0:len(cad)-1])", "from collections import Counter\r\n \r\n\r\nN = int(input())\r\nls = list(map(int, input().split()))\r\nd = dict()\r\nfor i in range(len(ls)):\r\n d[ls[i]] = i + 1\r\n\r\nfor i in range(len(ls)):\r\n print(d[i + 1],end = ' ')", "n=int(input())\r\na=list(map(int,input().split()))\r\nans=[]\r\nfor i in range(1,n+1):\r\n ans.append(a.index(i)+1)\r\nprint(*ans)", "n=int(input())\r\narr=list(map(int,input().split()))\r\nans=[]\r\nfor i in range(1,n+1):\r\n ans.append(arr.index(i)+1)\r\nprint(*ans,sep=\" \")", "n = int(input())\r\nar1 = list(map(int, input().split()))\r\nar2 = [0] * (n+1)\r\n\r\nfor i in range(1, n+1):\r\n m = ar1[i-1]\r\n ar2[m] = i\r\n\r\nfor i in range(1, n+1):\r\n print(ar2[i], end=' ')\r\n", "# Little Petya very much likes gifts. Recently he has received a new laptop as a New Year gift from his mother. He immediately decided to give it to somebody else as what can be more pleasant than giving somebody gifts. And on this occasion he organized a New Year party at his place and invited n his friends there.\r\n\r\n# If there's one thing Petya likes more that receiving gifts, that's watching others giving gifts to somebody else. Thus, he safely hid the laptop until the next New Year and made up his mind to watch his friends exchanging gifts while he does not participate in the process. He numbered all his friends with integers from 1 to n. Petya remembered that a friend number i gave a gift to a friend number pi. He also remembered that each of his friends received exactly one gift.\r\n\r\n# Now Petya wants to know for each friend i the number of a friend who has given him a gift.\r\n\r\n# Input\r\n# The first line contains one integer n(1 ≤ n ≤ 100) — the quantity of friends Petya invited to the party. The second line contains n space-separated integers: the i-th number is pi — the number of a friend who gave a gift to friend number i. It is guaranteed that each friend received exactly one gift. It is possible that some friends do not share Petya's ideas of giving gifts to somebody else. Those friends gave the gifts to themselves.\r\n\r\n# Output\r\n# Print n space-separated integers: the i-th number should equal the number of the friend who gave a gift to friend number i.\r\n\r\n# Examples\r\n# inputCopy\r\n# 4\r\n# 2 3 4 1\r\n# outputCopy\r\n# 4 1 2 3\r\n# inputCopy\r\n# 3\r\n# 1 3 2\r\n# outputCopy\r\n# 1 3 2\r\n# inputCopy\r\n# 2\r\n# 1 2\r\n# outputCopy\r\n# 1 2\r\n\r\nn = int(input())\r\ngift_to = list(map(int, input().split()))\r\ngift_from = []\r\nfor i in range(1, n+1):\r\n gift_from.append(str(gift_to.index(i)+1))\r\nprint(' '.join(gift_from))\r\n", "n=int(input())\r\ngift=list(map(int,input().split()))\r\nfinal=[0]*n\r\nfor i in range(n):\r\n final[gift[i]-1]=i+1\r\nprint(*final)\r\n", "n=int(input())\r\nlst=list(map(int,input().split()))\r\nfor i in range(n):\r\n print((lst.index(i+1)+1),end=\" \")", "size = int(input())\r\nf = list(map(int, input().split()))\r\n\r\noutput = str(f.index(1) + 1)\r\nfor i in range (2, size+1):\r\n output += \" \" + str(f.index(i)+1)\r\n\r\nprint(output)", "# Read input\r\nn = int(input())\r\ngift_givers = list(map(int, input().split()))\r\n\r\n# Initialize the list to store gift givers\r\ngivers = [0] * n\r\n\r\n# Populate the givers list based on the input\r\nfor i in range(n):\r\n givers[gift_givers[i] - 1] = i + 1\r\n\r\n# Print the result\r\nprint(*givers)\r\n", "n = int(input())\r\n\r\nfriends = list (map(int,input().split()))\r\n\r\ngivers_dict = {}\r\n\r\nfor i, num in enumerate(friends,1):\r\n givers_dict[num] = i\r\n\r\nfor friend in range(1,n+1):\r\n print(givers_dict[friend], end=' ')\r\n", "n = int(input())\ngifts = list(map(int, input().split()))\nresult = []\n\nfor i in range(len(gifts)):\n result.append(0)\n\nfor j in range (len(gifts)):\n result[gifts[j] - 1] = j + 1\n\nfor r in result:\n print(r, end=' ')\n\nprint()\n", "x=int(input())\r\ny=list(map(int,input().split()))\r\nfor i in range(1,x+1):\r\n a=y.index(i)+1\r\n print(a,end=\" \")", "entrada = int(input())\r\npadrao = [x for x in range(1, entrada + 1)]\r\nentrada2 = list(map(int, input().split()))\r\nans = [0] * len(padrao)\r\ni = 0\r\nfor each in padrao:\r\n ans[entrada2[i] - 1] = each\r\n i += 1\r\nprint(*ans)", "n=int(input())\r\nl1=input().split()\r\nl2=[]\r\nfor i in range(n):\r\n for j in range(n):\r\n if l1[j]==str(i+1):\r\n l2.append(j+1)\r\nfor i in range(n):\r\n print(l2[i], end=' ')\r\n\r\n\r\n ", "n = int(input())\r\np = list(map(int, input().split()))\r\nfor i in range(n):\r\n print((p.index(i+1)+1) , end = ' ')\r\n", "n = int(input())\r\ns = {}\r\ns_1 = input().split()\r\nfor i in range(1, n + 1):\r\n s[int(s_1[i - 1])] = i\r\nfor i in range(1, n + 1):\r\n print(s[i], end=' ')", "n=int(input())\r\nl1=[int(x) for x in input().split()]\r\nl2=[]\r\nfor i in range(n):\r\n for j in range(n):\r\n if i+1==l1[j]:\r\n l2.insert(i,j+1)\r\nfor i in l2:\r\n print(i,end=' ')", "n=int(input())\r\ng=list(map(int,input().split()))\r\nf=[0]*n\r\nfor i in range(n):\r\n f[g[i]-1]=i+1\r\nprint(*f)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = [0] * (len(a))\r\nfor i in range(len(a)):\r\n b[a[i]-1] = i+1\r\nfor _ in b:\r\n print(_, end=' ')", "n=int(input())\r\np=list(map(int,input().strip().split()))\r\ni=0\r\nwhile i<n:\r\n d= p.index(i+1)\r\n print(d+1)\r\n i +=1", "\r\nn = int(input())\r\n\r\n\r\ngift_recipients = list(map(int, input().split()))\r\n\r\n\r\ngift_givers = [0] * n\r\n\r\n\r\nfor i in range(n):\r\n gift_givers[gift_recipients[i] - 1] = i + 1\r\n\r\n\r\nprint(*gift_givers)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nll=[]\r\nfor i in range(0,n):\r\n ll.append(0)\r\nfor i in range(0,n):\r\n ll[l[i]-1]=i+1\r\nprint(*ll)\r\n ", "n = int(input())\r\n\r\npi = list(map(int,input().split()))\r\n\r\nfor i in range(1,len(pi)+1):\r\n if i != pi[i-1]:\r\n x=pi.index(i)+1\r\n print(x,end=\" \")\r\n else:\r\n print(i,end=\" \")\r\n \r\n \r\n \r\n ", "input()\r\ns = map(int, input().split())\r\nq = {}\r\nj = 1\r\nfor i in s:\r\n q[i] = j\r\n j += 1\r\nfor m in range(1, j):\r\n print(q[m], end=' ')\r\n", "\r\nn=int(input())\r\n \r\na=[0]*n\r\n \r\nt=list(map(int,input().split()))\r\n \r\nfor i in range(n):\r\n a[t[i]-1]=i+1\r\n \r\nfor i in a:\r\n print(i,end=' ')", "n = int(input())\r\ngive = list(input().split(' '))\r\ngive = list(map(int, give))\r\nreceive = give.copy()\r\ntemp = 0\r\nfor i in range(n):\r\n temp = give[i] - 1\r\n# print(temp)\r\n receive[temp] = i + 1\r\nfor j in range(n):\r\n print(receive[j], end=' ')\r\n", "n = int(input())\r\np = list(map(int, input().split()))\r\nd = [0]*n\r\nfor i in range(n):\r\n a = p[i]\r\n d[a-1] = i+1\r\nprint(*d)\r\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nb = sorted(a)\r\nc = []\r\nfor i in b:\r\n c.append(str(a.index(i)+1))\r\nprint(' '.join(c))", "k = int(input())\r\na = input().split()\r\nfor i in range(k):\r\n print(a.index(str(i+1))+1, end = ' ')\r\n", "n=int(input())\r\nm=list(map(int,input().split()))\r\nd={}\r\n#4\r\nfor i in range(n):\r\n d[i+1]=m[i]\r\n\r\nd=dict(sorted(d.items(), key=lambda item: item[1]))\r\n\r\nfor key in d:\r\n print(key,end=\" \")\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nb = [0]*n\r\nfor i in range(n):\r\n b[a[i]-1] = i + 1\r\nfor i in range(n):\r\n print(b[i], end = \" \")\r\nprint()", "n = int(input())\r\na = list(map(int,input().split()))\r\ndc = {}\r\nfor i in range(n):\r\n dc[a[i]]= a.index(i+1)+1\r\nprint(*dc.values()) \r\n", "\r\n\r\nn = int(input())\r\na = input().split()\r\nmap = {}\r\nfor i in range(n):\r\n a[i] = int(a[i])\r\n map[a[i]] = i + 1\r\n\r\nfor i in range(n):\r\n print(map[i+1], end=' ')\r\n\r\n", "n = int(input())\r\nindex = 1\r\nnumber = list(map(int, input().split()))\r\narr = []\r\nfor i in range(1, n + 1):\r\n m = number.index(i) + 1\r\n arr.append(str(m))\r\nprint(\" \".join(arr))\r\n\r\n", "n = int(input())\r\np = input().split()\r\na = [int(i) for i in p]\r\nc=[]\r\nfor i in range(1,n+1):\r\n b = a.index(i)\r\n c.append(b+1)\r\nfor i in c:\r\n print(i, end=' ')", "c = input()\r\na = list(map(int, input().split()))\r\nres = [0]*len(a)\r\nfor i in range(len(a)):\r\n res[a[i]-1] = i+1\r\nfor j in res:\r\n print(j, end=\" \")", "n=int(input())\r\ngift_giver=list(map(int,input().split()))\r\nresult=[0]*n\r\nfor i,giver in enumerate(gift_giver):\r\n result[giver-1]=i+1\r\nprint(*result)\r\n", "a=int(input())\r\nb=input().split()\r\nc=1\r\nd=''\r\ne=''\r\nwhile c<=a:\r\n d=b.index(str(c))\r\n e=e+str(d+1)+' '\r\n c+=1\r\nprint(e)", "num_friends = int(input())\r\nfriends = list(map(int,input().split()))\r\n\r\nwho_has_given = []\r\nfor i in range(1,num_friends+1):\r\n friend = friends.index(i) + 1\r\n who_has_given.append(friend)\r\n\r\nprint(*who_has_given)\r\n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nd={}\r\n\r\nfor i in range(1,n+1):\r\n d[a[i-1]]=i\r\n# print(d)\r\nfor i in range(1,n+1):\r\n print(d[i],end=\" \")\r\n", "input(); p = [int(_) for _ in input().split()]\r\noutput = [0 for _ in range(len(p))]\r\nfor charIndex in range(len(p)):\r\n output[p[charIndex]-1] = charIndex+1\r\nprint(\" \".join([str(sb) for sb in output]))", "n=int(input())\r\np=list(map(int,input().split()))\r\ng=[0]*n\r\nfor i in range(1,n+1):\r\n g[p[i-1]-1]=i\r\nprint(' '.join(map(str,g)))", "n = int(input())\r\ngifts_to_friends = list(map(int, input().split()))\r\n\r\nresult = [0] * n # Initialize a list to store the results\r\n\r\nfor i in range(n):\r\n result[gifts_to_friends[i] - 1] = i + 1\r\n\r\n# Print the result as space-separated integers\r\nprint(\" \".join(map(str, result)))\r\n", "t = int(input())\r\ngifts = list(map(int, input().split()))\r\ngift_givers = {}\r\n\r\nfor i in range(1, t+1):\r\n for j in range(t):\r\n if gifts[j] == i:\r\n gift_givers[i] = j+1\r\n break\r\n\r\nfor i in range(1, t+1):\r\n print(gift_givers[i], end=\" \")", "n = int(input())\r\n\r\nl = map(lambda x: int(x), input().split())\r\n\r\nd = {}\r\n\r\nfor i in enumerate(l):\r\n\td[i[1]] = i[0] + 1\r\n\r\nfor i in range(1, n+1):\r\n\tprint(d[i], end=' ')\r\n\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\n\r\n\r\ni = 1\r\n\r\nwhile i <= n:\r\n j = 0\r\n while j < len(l):\r\n if l[j] == i:\r\n print(j + 1, end = \" \")\r\n j +=1\r\n i +=1", "n = int(input())\r\nl = list(map(int, input().split()))\r\nres = []\r\nfor i in range(1, n+1):\r\n res.append(str(l.index(i)+1))\r\n\r\nprint(\" \".join(res))", "n = int(input())\r\np = [int(pi) for pi in input().split()]\r\ns = [0 for _ in range(n)]\r\nfor i in range(n):\r\n s[i] = p.index(i+1)+1\r\n print(s[i], end = ' ')", "import sys\r\nlines = []\r\nfor line in sys.stdin:\r\n lines.append(line.rstrip('\\n'))\r\ngifts = lines[1].split(' ')\r\nanswer = [0] * len(gifts)\r\nfor i, reciever in enumerate(gifts):\r\n answer[int(reciever) - 1] = str(i + 1)\r\n \r\nprint(' '.join(answer))", "n=int(input())\r\na=list(map(int,input().split(\" \")))\r\nL=[]\r\ns=\"\"\r\nfor i in range(1,n+1):\r\n b=a.index(i)\r\n L.append(b+1)\r\nprint(*L)", "n = int(input())\r\np = list(map(int, input().split()))\r\ns = {}\r\nfor i, v in enumerate(p):\r\n s[v] = i + 1\r\nfor i in range(n):\r\n print(s[i + 1],end = \" \")", "n = int(input())\r\narr = [0] * (n + 1)\r\np = list(map(int, input().split()))\r\nfor i in range(1, n + 1):\r\n arr[p[i - 1]] = i\r\nprint(*arr[1:])\r\n", "def main():\r\n n = int(input())\r\n ans = [0] * n\r\n p = list(map(int,input().split()))\r\n\r\n for i in range(1, n + 1):\r\n ans[p[i-1] - 1] = i\r\n \r\n for i in range(n):\r\n print(ans[i], end=\" \")\r\n \r\n print()\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\n\r\nfriends = list(map(int, input().split()))\r\ngifts = [0] * n\r\ncount = 1\r\nfor i in friends:\r\n gifts[i-1] = count\r\n count += 1\r\nfor i in gifts:\r\n print(i, end = ' ')", "def solve_gift_exchange(n, gift_givers):\n \n gift_receivers = [0] * n\n\n\n for i in range(n):\n receiver = gift_givers[i] - 1 \n gift_receivers[receiver] = i + 1 \n\n \n for receiver in gift_receivers:\n print(receiver)\n\n\n\nn = int(input()) \ngift_givers = list(map(int, input().split())) \n\n\nsolve_gift_exchange(n, gift_givers)\n \t\t\t \t\t \t\t\t\t\t\t \t \t\t\t \t\t\t \t", "import sys\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport string\r\nimport re\r\nfrom decimal import Decimal\r\nfrom collections import defaultdict, Counter, deque\r\n\r\n# Fast input reading\r\ndef read_str():\r\n return sys.stdin.readline().rstrip()\r\n\r\ndef read_int():\r\n return int(input())\r\n\r\ndef read_int_list():\r\n return list(map(int, input().split()))\r\n\r\ndef print_int_list(arr):\r\n sys.stdout.write(' '.join(map(str, arr)) + '\\n')\r\n sys.stdout.flush()\r\n\r\n# Main function\r\ndef main():\r\n # Input reading\r\n n = read_int()\r\n arr = read_int_list()\r\n result = []\r\n for i in range(1,n+1):\r\n result.append(arr.index(i)+1)\r\n\r\n print_int_list(result)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input()) \r\ngift = [0] * n \r\np = list(map(int, input().split())) \r\nfor i in range(n):\r\n gift[p[i] - 1] = i + 1 \r\n\r\nfor i in gift:\r\n print(i, end=\" \")", "n = int(input())\n\ngifts_itopi = list(map(int,input().split()))\n\ngifts_pitoi = []\n\nfor i in range(1,n+1):\n \n gifts_pitoi.append(gifts_itopi.index(i)+1)\n\nprint(*gifts_pitoi)\n\n\n", "n = int(input())\r\np = [int(x) for x in input().split()]\r\na = ''\r\nb = sorted(p)\r\nfor i in b:\r\n a+=str((p.index(i)+1))+' '\r\nprint(a)", "n = int(input())\r\nk = list(map(int,input().split()))\r\nl = k\r\nz = [0 for _ in range(n+1)]\r\nfor i in range(1,n+1):\r\n t = l[i-1]\r\n z[t] = i\r\nfor i in range(1,n+1):\r\n print(z[i])\r\n \r\n\r\n\r\n", "n = int(input())\na = [int(i) for i in input().split()]\nb = [0]*(len(a))\nfor i in range(len(a)):\n\tb[a[i] - 1] = i + 1\nprint(*b)\n", "n = int(input())\r\npresentMappings = {}\r\n\r\npresents = list(map(int,input().split()))\r\n\r\nfor i in range(0, n):\r\n presentMappings[presents[i]] = i + 1\r\n#print(presentMappings)\r\n\r\nfor i in range(0, n-1):\r\n print(presentMappings.get(i+1),end=\" \") \r\n\r\nprint(presentMappings[n])", "number_of_friends = int(input())\r\nthe_list = list(map(int, input().split()))\r\nans = [0] * number_of_friends\r\nfor i in range(number_of_friends):\r\n ans[the_list[i]-1] = i+1\r\nprint(*ans)", "n=int(input())\r\nthe_list=list(map(int,input().split()))\r\nfor i in range(1,n+1):\r\n print(the_list.index(i)+1,end=\" \")", "x=int(input(\"\"))\r\nm=input(\"\")\r\nl=m.split(\" \")\r\nk=[]\r\nfor i in range(len(l)):\r\n k.append([int(l[i]),i+1])\r\nk.sort()\r\nfor j in k:\r\n print(j[1],end=\" \")", "t=int(input())\r\np=input().split()\r\ndic={}\r\nfor i in range(0,len(p)):\r\n dic[int(p[i])]=i+1 \r\nlst=[]\r\nfor i in dic:\r\n lst.append((i,dic[i]))\r\nlst1=sorted(lst)\r\nfor i in range(len(lst1)):\r\n print(lst1[i][1] ,end=\" \")", "# Get the number of elements\r\nnum_elements = int(input())\r\n\r\n\r\n\r\n\r\n# Get the list of elements as strings\r\n\r\nelement_list = input().split()\r\n\r\n\r\n\r\n# Create a list to store the indices of elements in their original order\r\n\r\nindices = [element_list.index(str(i + 1)) + 1 for i in range(num_elements)]\r\n\r\n\r\n# Print the list of indices\r\nprint(*indices)\r\n", "n = int(input())\r\npi = list(map(int, input().split()))\r\ngiver = [-1] * n\r\nfor i in range(n):\r\n giver[pi[i]-1] = i+1\r\nprint(*giver)\r\n", "n = int(input())\r\ngive = list(map(int,input().split()))\r\nrecive = {}\r\noutcome = []\r\n\r\nfor x in range(n):\r\n recive[give[x]] = x + 1\r\n \r\nfor i in range(n):\r\n outcome.append(recive[sorted(recive)[i]])\r\noutcome = list(map(str, outcome))\r\nprint(' '.join(outcome))", "n = int(input())\r\ngift_givers = list(map(int, input().split()))\r\ngift_receiver = [0] * n\r\nfor i, giver in enumerate(gift_givers, start=1):\r\n gift_receiver[giver - 1] = i\r\nprint(' '.join(map(str, gift_receiver)))\r\n", "\"\"\"\nAccomplished using the JetBrains Academy plugin by JetBrains https://plugins.jetbrains.com/plugin/10081-edutools\n\nTo modify the template, go to Preferences -> Editor -> File and Code Templates -> Other\n\"\"\"\nimport sys\n\ninput = sys.stdin.readline\n\n\n############ ---- Input Functions ---- ############\ndef inp():\n return (int(input()))\n\n\ndef inlt():\n return (list(map(int, input().split())))\n\n\ndef insr():\n s = input()\n return (list(s[:len(s) - 1]))\n\n\ndef invr():\n return (map(int, input().split()))\n \nif __name__ == \"__main__\":\n n = inp()\n gift = inlt()\n output = [None] * n\n\n for i in range(n):\n output[gift[i]-1] = i + 1\n\n print(' '.join(map(str, output)))\n\n\n\n\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl1=[0]*n\r\nc=1\r\nfor i in l:\r\n l1[i-1]=c\r\n c+=1\r\nfor i in l1:\r\n print(i,end=\" \")", "x=int(input())\r\nl=[*map(int,input().split())]\r\nr=[0]*x\r\nfor i, e in enumerate(l):\r\n r[e-1]=i+1\r\nprint(*r)", "n = int(input())\r\nfinal = []\r\nfor i in range(n):\r\n final.append(0)\r\ninputs = list(map(int, input().split()))\r\nfor i in range(len(inputs)):\r\n final[inputs[i]-1] = i+1\r\noutput = \"\"\r\nprint(*final)", "t=int(input())\r\nl=list(map(int,input().split()))\r\nfor i in range(1,len(l)+1):\r\n print(l.index(i)+1,end=\" \")\r\n \r\n", "length = int(input())\r\narray = list(map(int, input().split()))\r\nresult = [0] * length\r\n\r\ni = 1\r\nfor value in array:\r\n result[value - 1] = i\r\n i += 1\r\n\r\nprint(*result)", "n=int(input())\r\ns=input().split()\r\nsequence=[]\r\nfor i in range(1,n+1):\r\n sequence.append(s.index(str(i))+1)\r\nprint(\" \".join(map(str,sequence)))", "n = int(input())\r\ngivers = list(map(int, input().split()))\r\n\r\nreceivers = [0] * n # initialize an empty list to store the receivers\r\n\r\nfor i in range(n):\r\n receivers[givers[i] - 1] = i + 1 # set the i-th receiver as the friend who gave a gift to givers[i]\r\n\r\nprint(*receivers) # print the list of receivers separated by spaces\r\n", "n = int(input())\r\ngifts = {}\r\nfor i, p in enumerate(input().split()):\r\n gifts[p] = i + 1\r\n\r\nfor i in range(1, n+1):\r\n print(gifts[str(i)], end=\" \")\r\n", "x = int(input())\r\nfor_whom = input()\r\nfor_whom = list(map(int, for_whom.split()))\r\na = [0 for i in range(x)]\r\n\r\nfor i in range(1, x + 1):\r\n for j in range(x):\r\n if i == for_whom[j]:\r\n a[i - 1] = j + 1\r\n\r\nprint(\" \".join(map(str, a)))", "import math\nimport heapq\nimport sys\n\ndef input_arr():\n arr = [int(x) for x in input_string().split()]\n return arr\n\ndef input_n():\n n = int(input_string())\n return n\n\ndef sub_list(a,b):\n c = []\n for i in range(len(a)):\n c.append(a[i]-b[i])\n return c\n\ndef sub_const(a, c):\n b = []\n for x in a:\n b.append(x-c)\n return b\n\ndef binary_search(arr, low, high, x):\n if high >= low:\n mid = (high + low) // 2\n if arr[mid] == x:\n return mid\n elif arr[mid] > x:\n return binary_search(arr, low, mid - 1, x)\n else:\n return binary_search(arr, mid + 1, high, x)\n else:\n return -1\n \ndef printlist(a):\n for x in a:\n print(x, end = \" \")\n\ndef input_string():\n global mode\n if mode==0:\n return input()\n else:\n with open('/Users/aryan/Desktop/cp/test_case.txt') as f:\n lines = f.readlines()\n global line \n st = lines[line][:-1]\n line+=1\n return st\n\ndef solve():\n n = input_n()\n arr = input_arr()\n arr2 = []\n for i in range(1, n+1):\n arr2.append([arr[i-1], i])\n arr2.sort()\n for i in range(n):\n print(arr2[i][1], end = \" \")\n print()\n \n\n\n\n\n\n \n\ndef solve_t():\n t = input_n()\n for l in range(t):\n n = input_n()\n arr = input_arr()\n arr.sort()\n freq_list = [[arr[0], 1]]\n for i in range(1, n):\n if arr[i]==arr[i-1]:\n freq_list[-1][1]+=1\n else:\n freq_list.append([arr[i], 1])\n\n ans = 0\n for i in range(1, len(freq_list)):\n if freq_list[i][0]==freq_list[i-1][0]+1:\n ans+=max(0, freq_list[i-1][1]-freq_list[i][1])\n else:\n ans+=freq_list[i-1][1]\n\n print(ans+freq_list[-1][1])\n \nline = 0 \nmode = 0\nif len(sys.argv)>1 and sys.argv[1]=='file':\n mode = 1\nsolve()", "n = int(input())\r\na = list(map(int, input().split()))\r\nresult = [0]*n\r\nfor i in range(1, len(a)+1):\r\n b = a.index(i)\r\n result[i-1] = b+1\r\nprint(\" \".join(list(map(str, result))))", "n = int(input())\r\np = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n print(p.index(i+1) + 1, end=\" \")", "n = int(input())\npresents = [0] * n\n\nfor i, x in enumerate(map(int, input().split())):\n presents[x - 1] = i + 1\n\nprint(*presents)", "num = int(input())\r\nresArr = list(map(int, input().split()))\r\n\r\nfor i in range(num):\r\n for j in range(num):\r\n if resArr[j] - 1 == i:\r\n print(j + 1, end=\" \")\r\n break", "x=int(input())\r\ngift=list(map(int,input().split(' ')))\r\narray=[]\r\nfor t in range(x):\r\n array.append(0)\r\nfor a,b in enumerate(gift):\r\n array[b-1]=a+1\r\nfor d in array:\r\n print(d,end=' ')\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\nl1=[]\r\nfor i in range (1,n+1):\r\n l1.append(l.index(i)+1)\r\nprint(*l1)", "'''\r\n==TEST CASE==\r\nInput:\r\n4\r\n2 3 4 1\r\n\r\n*[1]2 [2]3 [3]4 [4]1\r\n\r\nOutput:\r\n4 1 2 3\r\n'''\r\nn=int(input())\r\na = list(map(int, input().split()))\r\nl=[]\r\ncurr=1\r\n\r\nfor x in range(n):\r\n print(a.index(x+1)+1)", "from sys import stdin\ninput = stdin.readline\n\n\nif __name__ == \"__main__\":\n n = int(input())\n data = list(map(int, input().split()))\n res = [0]*n\n for i, v in enumerate(data):\n res[v-1] = i+1\n print(*res)\n\t \t \t \t\t \t\t\t \t\t \t\t \t", "num_of_friends = int(input())\r\npresents = list(map(int, input().split()))\r\n\r\nfor i in range(num_of_friends):\r\n if i < num_of_friends-1:\r\n print(presents.index(i+1)+1, end=\" \")\r\n else:\r\n print(presents.index(i + 1)+1)", "from 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 _ = int(input())\n pairings = [[int(x), i+1] for i, x in enumerate(input().split())]\n pairings.sort(key=lambda x: x[0])\n print(\" \".join([str(x[1]) for x in pairings]))\n\n\nif __name__ == \"__main__\":\n main()\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nc = []\r\nfor i in range(n):\r\n for j in range(n):\r\n if (i+1)==a[j]:\r\n c.append(j+1)\r\nprint(\" \".join(str(x) for x in c))", "\r\nfrom collections import defaultdict, deque\r\nimport collections, math\r\nfrom concurrent.futures import thread\r\nimport heapq\r\nfrom operator import indexOf\r\nimport sys, threading\r\nmod = 1000000007\r\nimport math\r\n\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_string(): return sys.stdin.readline().strip()\r\ndef get_int(): return int(sys.stdin.readline().strip())\r\ndef get_list_strings(): return list(map(str, sys.stdin.readline().strip().split())) \r\n\r\ndef run():\r\n n = get_int()\r\n li = get_list()\r\n ans = []\r\n dic = defaultdict()\r\n for i in range(len(li)):\r\n dic[li[i]] = i\r\n\r\n for i in range(1, len(li) + 1):\r\n ans.append(dic[i] + 1)\r\n print(*ans)\r\n \r\nif __name__ == '__main__':\r\n threading.stack_size(1 << 27)\r\n sys.setrecursionlimit(1 << 30)\r\n main_thread = threading.Thread(target=run)\r\n main_thread.start()\r\n main_thread.join()", "t = int(input())\r\namigos = input().split()\r\n\r\noutput = ''\r\n\r\nfor i in range(1,t+1):\r\n\r\n output = output+str(amigos.index(str(i))+1)+' '\r\n\r\nprint(output) \r\n", "n = int(input())\r\npi = list(map(int, input().split()))\r\n\r\nfor i in range (1,n+1):\r\n x = pi.index(i) + 1\r\n print(x, end = \" \")", "n = int(input())\r\nx = list(map(int, input().split()))\r\nind = []\r\nfor i in x:\r\n\tind.append(x.index(i)+1)\r\nfor i in range(1,n+1):\r\n\tprint(ind[x.index(i)], end=\" \")", "a=int(input())\r\nb=input().split()#кто от кого\r\nb1=[]#кто у кого\r\nfor i in range(1,len(b)+1):\r\n b1.append(b.index(str(i))+1)\r\nprint(*b1)", "n = int(input())\r\ndata = list(map(int,input().split()))\r\nans = [0]*(n+1)\r\nfor i in range(n):\r\n ans[data[i]] = i+1\r\nprint(*ans[1:])", "n=int(input())\r\nl=list(map(int,input().split()))\r\nd={}\r\nfor i in range(n):\r\n d[l[i]]=i+1\r\nfor i in range(1,n+1):\r\n print(d[i],end=\" \")", "n = int(input())\r\narr = list(map(int, input().split()))\r\nout = [0 for i in range(n)]\r\n\r\nfor i in range(n):\r\n out[arr[i]-1] = i + 1\r\nprint(\" \".join(map(str, out)))\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nans = [0]*n\r\nfor i in range(n):\r\n ans[a[i]-1] = i+1\r\nprint(*ans)", "n = int(input())\r\n\r\na = list(map(int, input().split(' ')))\r\n\r\nb = [''] * n\r\nfor i in range(n):\r\n b[a[i]-1] = str(i+1)\r\n \r\nprint(' '.join(b))\r\n \r\n ", "count_friends = int(input())\r\nnumbers_friends = tuple(map(int,input().split(' ')))\r\nfor i in range(1,count_friends+1):\r\n print(numbers_friends.index(i)+1,end=' ')", "n = int(input())\r\nm = [int(i) for i in input().split()]\r\nans = [0] * n\r\nfor i in range(n):\r\n ans[m[i] - 1] = i + 1\r\nprint(*ans)", "\r\n\r\nn = int(input())\r\n\r\narr = list(map(int, input().split()))\r\n\r\n\r\nres = [0] * (n+1)\r\n\r\nfor i in range(1, n+1):\r\n pi = arr[i-1]\r\n res[pi] = i\r\n\r\nprint(*res[1:])\r\n", "# Read the number of friends\nn = int(input())\n\ngift_givers = list(map(int, input().split()))\n\ngift_receivers = [0] * n\n\nfor i in range(n):\n \n gift_receivers[i] = gift_givers.index(i + 1) + 1\n\n\nfor receiver in gift_receivers:\n print(receiver, end=' ')\n\n\n \t \t \t \t\t\t \t \t\t \t\t\t\t \t \t\t", "# Read the number of friends\r\nn = int(input())\r\n\r\n# Read the list of friends who gave gifts\r\ngivers = list(map(int, input().split()))\r\n\r\n# Initialize a list to store the friends who gave gifts to others\r\nreceivers = [0] * n\r\n\r\n# Fill in the receivers list based on the given input\r\nfor i in range(n):\r\n receivers[givers[i] - 1] = i + 1\r\n\r\n# Print the list of friends who gave gifts to others\r\nprint(*receivers)\r\n", "n = int(input())\r\ndic = {}\r\nline = list(map(int, input().split()))\r\nfor i in range(n):\r\n line[i] -= 1\r\n dic[line[i]] = i\r\nfor j in range(n):\r\n print(dic[j] + 1, end=' ')", "t= int(input())\r\nl=[int(x) for x in input().split()]\r\nres=[]\r\nfor i in range(t):\r\n res.append(l.index(i+1)+1)\r\nprint(*res)", "n = int(input())\r\np = list(input().split())\r\np1 = {}\r\nfor i in range(n):\r\n p1.update({str(i+1):p[i]})\r\np3 = []\r\nfor a in range(n):\r\n p3.append([a+1,int(p1.get(str(a+1)))])\r\np2 = []\r\nfor j in range(n):\r\n for h in range(n):\r\n if p3[j][0] == p3[h][1]:\r\n p2.append(p3[h][0])\r\nprint(*p2)", "n = int(input())\r\n\r\nfriends = list(map(int, input().split()))\r\n\r\ngifts = []\r\n\r\nfor i in range(n):\r\n gifts.append(friends.index(i+1)+1)\r\n\r\nres = ''\r\n\r\nfor gift in gifts:\r\n res += f'{gift} '\r\n\r\nprint(res[:-1])", "n = int(input()) # Number of friends\r\ngivers = list(map(int, input().split())) # List of friends who gave gifts\r\n\r\n# Print the list of friends who gave gifts\r\nfor i in range(1, n + 1):\r\n receiver = givers.index(i) + 1\r\n print(receiver, end=\" \")\r\n", "num = int(input())\r\nx = input().split()\r\nx = [int(i) for i in x]\r\nresult = []\r\nindex = 1\r\ni = 0\r\nwhile True:\r\n if x[i] == index:\r\n result.append(i + 1)\r\n index += 1\r\n i = 0\r\n continue\r\n if index > num:\r\n break\r\n i += 1\r\nresult = [str(i) for i in result]\r\nprint(' '.join(result))", "n = int(input())\na = [(giver + 1, int(receiver)) for giver, receiver in enumerate(input().split())]\na.sort(key=lambda x: x[1])\nprint(*[a[i][0] for i in range(len(a))])\n\n\n", "x=int(input())\r\ny=[int(x) for x in input().split()]\r\nfor i in range(x):\r\n print(y.index(i+1) + 1,end=' ')", "n = int(input())\r\na = input().split(\" \")\r\nA = list(map(int,a))\r\nB=[1] * n\r\nfor i in range(len(A)):\r\n B[A[i]-1] = i+1\r\nC=list(map(str,B))\r\nprint(\" \".join(C))", "n = input() #useless\r\nprint(' '.join(n[1] for n in sorted((friend,str(idx)) for idx,friend in enumerate(map(int,input().split()),start=1))))", "n=int(input())\r\np=list(map(int,input().split()))\r\ns=list(range(1,101))\r\nv=[]\r\nfor i in range(n):\r\n c=p.index(min(p))\r\n v.append(s[c])\r\n p[c]=10000\r\nprint(*v)", "n = int(input())\r\nl = list(map(int,input().split()))\r\nans = []\r\nfor i in range(1,n+1):\r\n ans.append(l.index(i)+1)\r\nprint(*ans)\r\n", "n = int(input())\r\nA = list(map(int, input().split()))\r\nB = [0]*n\r\n\r\nfor i in range(n):\r\n B[A[i] - 1] = i + 1\r\n\r\nprint(*B)", "def gif(n, l):\r\n l1 = [0] * n \r\n \r\n for i in range(n):\r\n if l[i] == i + 1:\r\n l1[i] = i + 1 \r\n else:\r\n l1[l[i]- 1] = i + 1 \r\n \r\n return(' '.join(map(str, l1))) \r\nn = int(input())\r\nl = list(map(int, input().split()))\r\n\r\nprint(gif(n, l)) \r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nfor i in range(1,n+1):\r\n for j in range(n):\r\n if i==l[j]:\r\n print(j+1,end=\" \")\r\n print()", "a = int(input())\nb = list(map(int, input().split()))\n\nresult = ''\nfor i in range(1, a+1):\n result += f'{b.index(i) + 1} '\nprint(result)", "n = int(input())\r\nFriends = [int(x) for x in input().split()]\r\nno = 0\r\nindex = 0\r\narr = [i for i in range(1, 101)]\r\na = []\r\nwhile True:\r\n if len(a) == n:\r\n break\r\n else:\r\n if Friends[no] == arr[index]:\r\n a.append(no+1)\r\n no = 0\r\n index += 1\r\n else:\r\n no += 1\r\ns = ''\r\nfor i in a:\r\n s += str(i)\r\n s += ' '\r\nprint(s)\r\n", "n = int(input())\r\np = list(map(int, input().split()))\r\n\r\ngivers = [0] * n\r\nfor i in range(n):\r\n givers[p[i]-1] = i+1\r\n\r\nfor i in range(n):\r\n print(givers[i])", "n = int(input())\r\n\r\nlst = list(map(int, input().strip().split()))[:n]\r\nsol = [0] * n\r\nfor i in range(n):\r\n sol[lst[i] - 1] = i + 1\r\n \r\nfor i in range(n):\r\n print(sol[i], end=\" \")", "n = int(input())\r\nl = list(map(int, input().split()))\r\nle = len(l)\r\nfor i in range(1, le+1):\r\n print(l.index(i) + 1, end=\" \")\r\n ", "n = int(input())\np = list(map(int, input().split()))\n\nresult = [0] * n\nfor e, v in enumerate(p):\n result[v-1] = e + 1\n\nprint(*result)\n", "n =int(input())\r\nif ((n>=1) and (n<=100)):\r\n \r\n string=input()\r\n keys = list(map(int,string.split(\" \")))\r\n # print(keys)\r\n values=[]\r\n \r\n for i in range(0,n):\r\n values.append(i+1)\r\n # print(values)\r\n \r\n data=dict(zip(keys,values))\r\n # print(data)\r\n \r\n \r\n new_dict = dict(sorted(data.items()))\r\n # print(new_dict)\r\n \r\n for values in new_dict.values():\r\n print(values, end=' ')\r\n ", "n=int(input())\r\ns=list(map(int,input().split()))\r\nfor i in range(1,n+1):\r\n print(s.index(i)+1,end=' ')", "n=int(input())\r\nb=list(map(int,input().split()))\r\nv=[]\r\nfor i,j in enumerate(b):\r\n v+=[[j,i+1]]\r\nv.sort()\r\nfor k in v:\r\n print(k[1],end=\" \")", "def find_gift_givers(n, gift_receivers):\r\n gift_givers = [0] * n\r\n\r\n for i in range(n):\r\n gift_givers[gift_receivers[i] - 1] = i + 1\r\n\r\n return gift_givers\r\n\r\n# Read input\r\nn = int(input())\r\ngift_receivers = list(map(int, input().split()))\r\n\r\n# Find gift givers\r\nresult = find_gift_givers(n, gift_receivers)\r\n\r\n# Output the result\r\nprint(*result)\r\n", "def get_presents(p):\r\n l = len(p)\r\n res = [0] * l\r\n for i, v in enumerate(p):\r\n res[v - 1] = i + 1\r\n return res\r\n\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n p = list(map(int, input().strip().split()))\r\n res = get_presents(p)\r\n print(\" \".join(map(str, res)))\r\n", "n = int(input())\r\na = [int(_) for _ in input().split()]\r\nh = \"\"\r\nfor _ in range(1, n + 1):\r\n h += str(a.index(_) + 1)\r\n if _ != n: h += \" \"\r\nprint(h)\r\n", "n = int(input())\r\ngifts = list(map(int, input().split()))\r\ngivers = {}\r\nfor i in range(n):\r\n givers[gifts[i]] = i+1\r\n\r\nfor i in range(1, n+1):\r\n print(givers[i], end=' ')", "\r\nnum_friends = int(input())\r\n\r\npresents = []\r\nfor _ in range(num_friends):\r\n\tpresents.append(0)\r\n\r\nfriends = list(map(int, input().split()))\r\n\r\nfor index in range(len(friends)):\r\n\t# Could I have printed here?\r\n\t# Maybe, but then readability goes down.\r\n\t# Therefore, I won't think about this more.\r\n\tpresents[friends[index] - 1] = index\r\n\t\r\nfor gifter in presents:\r\n\tprint(gifter + 1, end = \" \" if gifter != presents[len(presents) - 1] else \"\")", "n = int(input())\r\narr = list(map(int, input().split()))\r\nres = []\r\n\r\nfor i in range(1,n+1):\r\n curr = i\r\n for j in range(0, n):\r\n if arr[j] == curr:\r\n inx = j\r\n res.append(inx+1)\r\n\r\nfor i in range(0,n):\r\n print(res[i],end=' ')\r\n \r\n", "n=int(input())\r\nl=(input().split())\r\nnl=[]\r\n# print(l)\r\nfor i in range(len(l)):\r\n nl.append(0)\r\nfor i in range(len(l)):\r\n nl[i]=l.index(str(i+1))+1\r\nprint(\" \".join(str(i) for i in nl))", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nhashmap = {}\r\n\r\nfor i in range(len(a)):\r\n hashmap[a[i]] = i+1\r\nsorted_hashmap = dict(sorted(hashmap.items()))\r\nfor key, val in sorted_hashmap.items():\r\n print(val, end = \" \")", "n = int(input())\r\nfriends = list(map(int, input().split()))\r\n\r\nsol = [0] * n\r\n\r\nfor i in range(n):\r\n sol[friends[i] - 1] = i + 1\r\n\r\nprint(\" \".join(map(str, sol)))\r\n\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nres=list('0'*len(l))\r\nno=1\r\nwhile(no<n+1):\r\n res[l[no-1]-1]=no\r\n no+=1\r\nprint(*res)", "dic ={}\nn =int(input())\nl =list(map(int, input().split()))\nfor _ in range(1, n+1):\n\n dic[l[_-1]] =_\nfor _ in range(1, n+1):\n print(dic[_], end=\" \")\n\n", "friends = int(input())\r\na = [0 for z in range(friends)]\r\np = [int(x) for x in input().split()] \r\nfor i in range(friends):\r\n a[p[i]-1] = i+1\r\ns = ''\r\nfor i in a:\r\n s = s + str(i) + \" \"\r\nprint(s)\r\n", "n = int(input())\r\na=list(map(int,input().split()))\r\nl=[]\r\nfor i in range (1,n+1):\r\n l.append(str(a.index(i)+1))\r\nprint(' '.join(l))", "a=int(input())\r\nb=list(map(int,input().split()))\r\nn=[]\r\nfor i in range(1,a+1):\r\n n.append(b.index(i)+1)\r\nprint(*n)", "amount = int(input())\r\ngifts = list(map(int,input().split()))\r\nans = []\r\nres=[]\r\n\r\nfor i in range (1, amount+1):\r\n ans.append(gifts.index(i))\r\n\r\nfor x in ans:\r\n res.append(x+1)\r\n \r\nprint(*res)\r\n\r\n", "times = int(input())\r\npeople = [int(num) for num in input().split()]\r\nlistpeople = [0 for i in range(len(people))]\r\nfor index, num in enumerate(people, 1):\r\n listpeople[num-1] = index\r\nstring = str(listpeople[0])\r\nfor num in listpeople[1:]:\r\n string += f\" {num}\"\r\nprint(string)", "n=int(input())\r\na=list(map(int,input().split()))\r\n\r\nhashmap={}\r\n\r\nfor i in range(n):\r\n hashmap[a[i]]=i+1\r\n\r\nfor i in range(n):\r\n print(hashmap[i+1],end=' ')", "n = int(input())\r\nreceivers = list(map(int, input().split()))\r\ngivers = [0] * n # initialize the list of gift givers to all zeros\r\nfor i in range(n):\r\n givers[receivers[i]-1] = i+1 # set the i-th element of givers to (receiver of i)-th friend\r\nprint(*givers) # print the list of gift givers separated by spaces", "n = int(input())\r\np_values = list(map(int, input().split()))\r\n\r\nans = [0] * n\r\n\r\nfor i in range(1, n + 1):\r\n p = p_values[i - 1] # Zero index correction for p\r\n ans[p - 1] = i\r\n\r\nfor i in range(n):\r\n print(ans[i], end=\" \")\r\n\r\nprint()\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nd = {}\r\nk = [0]*n\r\nfor i in range(len(a)):\r\n k[a[i]-1] = i+1\r\nprint(*k)\r\n", "numbers = int(input())\r\n\r\nfriends_place = list(map(int, input().split()))\r\n\r\nfor i in range(len(friends_place)):\r\n print(friends_place.index(i+1)+1, end=\" \")", "n = int(input())\nl = [int(x) for x in input().split()]\ns = l.copy()\nfor i in range(n):\n s[l[i]-1] = i+1\nfor i in range(n):\n print(s[i],end=\" \")\n\t \t\t\t \t\t \t\t \t \t \t\t\t \t", "n = int(input())\r\n\r\np = list(map(int, input().split()))\r\nk = []\r\nfor i in range(n):\r\n s = i+1\r\n v = p.index(s)\r\n k.append(v+1)\r\n if i != n:\r\n k.append(\" \")\r\n \r\n\r\nconverted_list = map(str, k)\r\nresult = ''.join(converted_list)\r\n\r\nprint(result)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nq=[]\r\nfor i in range(1,n+1):\r\n for p in range(n):\r\n if l[p]==i:\r\n q.append(p+1)\r\nprint(*q)", "n = int(input())\r\ngifts = list(map(int, input().split()))\r\nresult = [0] * n\r\nfor i in range(n):\r\n result[i] = gifts.index(i + 1) + 1\r\nprint(*result)", "# Presents\r\ninput()\r\nnums = [int(x) for x in input().split(' ')]\r\nsalida = []\r\nfor i in range(len(nums)):\r\n for x in nums:\r\n if x == i + 1:\r\n salida.append(str(nums.index(x) + 1))\r\nprint(\" \".join(salida))", "result = \"\"\r\nn = int(input())\r\np = input().split(\" \")\r\nnew = [0] * n\r\nfor i in range(n):\r\n new[int(p[i])-1] = (i+1)\r\nfor i in new:\r\n result += f\"{i} \"\r\nreuslt = result[:-1]\r\nprint(f\"{result}\")", "n=int(input())\r\nl1=list(map(int,input().split()))\r\nfor i in range(1,n+1):\r\n print(l1.index(i)+1,end=' ')", "def find_gift_givers(n, gift_receivers):\r\n gift_givers = {} # Dictionary to store the gift-givers\r\n\r\n for i in range(1, n + 1):\r\n gift_givers[gift_receivers[i - 1]] = i\r\n\r\n return [gift_givers[i] for i in range(1, n + 1)]\r\nn = int(input())\r\ngift_receivers = list(map(int, input().split()))\r\n\r\nresult = find_gift_givers(n, gift_receivers)\r\nprint(*result)\r\n", "people = int(input())\r\ngiftRecieverList = list(map(int, input().strip().split()))\r\noutput = []\r\n\r\n\r\nfor i in range(people):\r\n output.append(list((giftRecieverList[i], (giftRecieverList.index(giftRecieverList[i])) + 1)))\r\n# print(output)\r\n# print(sorted(output))\r\na = sorted(output)\r\nb = []\r\nfor i in a:\r\n b.append(i[1])\r\nprint(' '.join(map(str, b)))", "def solve(s):\r\n q = []\r\n for i in range(1, len(s) + 1):\r\n q.append(i)\r\n res = list(zip(s, q))\r\n res.sort()\r\n\r\n return [x[1] for x in res]\r\n\r\nn = int(input())\r\ns = list(map(int, input().split()))\r\nprint(*solve(s))\r\n", "n=int(input())\r\nm=list(map(int,input().split(' ')))\r\nhasil=[None]*n\r\nfor i in range(n):\r\n\thasil[m[i]-1]=i+1\r\nprint(\" \".join(str(i) for i in hasil))\r\n", "n = int(input())\r\nx = list(map(int,input().split()))\r\ns = sorted(x)\r\ny = [x.index(i)+ 1 for i in s]\r\nfor i in y:\r\n print(i, end = \" \")", "from collections import OrderedDict\r\n\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\nd = dict()\r\nfor i in range(0, n):\r\n d[l[i]] = i+1\r\nkeys = list(d.keys())\r\nkeys.sort()\r\nd = {i: d[i] for i in keys}\r\nans = list(d.values())\r\nprint(*ans)", "n=int(input())\r\np=list(map(int,input().split()))\r\nres=[0]*(n+1)\r\nfor i in range(1,n+1):\r\n res[p[i-1]]=i\r\nprint(*res[1:])", "n= 6\r\ngraph={}\r\nfor i in range(n):\r\n graph[i]=[]\r\nop=[[0,1],[0,2],[0,3],[0,4],[1,3],[2,3],[2,4],[2,5],[3,5]]\r\nfor (k,q) in op:\r\n graph[k].append(q)\r\n graph[q].append(k)\r\n \r\n# for i,v in graph.items():\r\n# print(i,\":\",v)\r\ndef dfs(graph,start,visited=set()):\r\n print(start)\r\n visited.add(start)\r\n for k in graph[start]:\r\n if k not in visited:\r\n dfs(graph,k,visited)\r\n# dfs(graph,5)\r\n\r\na=int(input())\r\nb=list(map(int,input().split()))\r\nfor i in range(1,a+1):\r\n print(b.index(i)+1,end=' ')", "k=int(input())\r\na=input().split()\r\nfor i in range(k):\r\n\tprint(a.index(str(i+1))+1)", "def findGiftGivers(n, giftTo):\r\n giftFrom = [0] * n # Initialize the result list\r\n\r\n for i in range(n):\r\n giftFrom[giftTo[i] - 1] = i + 1 # Assign the friend number to the corresponding position\r\n\r\n return giftFrom\r\n\r\n# Read input\r\nn = int(input())\r\ngiftTo = list(map(int, input().split()))\r\n\r\n# Find the gift givers\r\nresult = findGiftGivers(n, giftTo)\r\n\r\n# Print the result\r\nprint(*result)\r\n", "n = int(input())\r\np = [int(num) for num in input().split()]\r\noutput = [0 for _ in range(n)]\r\n\r\nfor index, friend in enumerate(p, start=1):\r\n output[friend - 1] = index\r\n\r\nprint(\" \".join([str(num) for num in output]))", "n = int(input())\r\ni_to_pi = [int(x) for x in input().split()]\r\npi_to_i = []\r\n\r\nfor i in range(1, n + 1):\r\n pi_to_i.append(i_to_pi.index(i) + 1)\r\n\r\nprint(\" \".join([str(x) for x in pi_to_i]))\r\n", "x=int(input())\r\na=input().split()\r\nprint(*[a.index(str(i+1))+1for i in range(x)])", "t=int(input())\r\ng=list(map(int,input().split()))\r\ng1=[0]*t\r\nfor i in range(t):\r\n g1[g[i]-1]=i+1\r\n \r\nprint(*g1)", "n = int(input())\r\narr = list(map(int, input().split()))\r\nb = []\r\nfor i in range(1,n+1):\r\n b.append(arr.index(i)+1)\r\nprint(*b)", "def exchange_gifts(friends):\r\n result = [0] * len(friends)\r\n for i in range(len(friends)):\r\n result[friends[i] - 1] = i + 1\r\n return result\r\n\r\nn = int(input())\r\nfriends = [int(item) for item in input().split()]\r\n[print(item, end=' ') for item in exchange_gifts(friends)]", "n = int(input())\r\nl = [int(n) for n in input().split()]\r\nt = []\r\nfor i in range(0, n):\r\n t.append((l[i], i + 1))\r\nt.sort()\r\nfor i in range(0, n):\r\n if i != n - 1:\r\n print(t[i][1], end=' ')\r\n else:\r\n print(t[i][1])", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nans = {}\r\n\r\nfor i in range(n):\r\n ans[lst[i]-1] = i+1\r\n\r\nfor i in range(n):\r\n print(ans[i], end=' ')", "n=int(input())\r\narr=list(map(int,input().split()))\r\nfor i in range(1,n+1):\r\n print(arr.index(i)+1,end=' ')", "n=int(input())\r\nx=[int(x) for x in input().split(\" \")]\r\nd=[]\r\nfor i in range(n):\r\n d.append([i+1,x[i]])\r\ny=sorted(d, key=lambda x: x[1])\r\noutput=\"\"\r\nfor i in range(n):\r\n output+=str(y[i][0])\r\n output+=\" \"\r\nprint(output)", "n = int(input())\r\n\r\nlst = list(map(int, input().split()))\r\n\r\nndx_lst = []\r\n\r\nfor i in range(1, n+1):\r\n x = lst.index(i)+1\r\n ndx_lst.append(str(x))\r\n \r\nprint(\" \".join(ndx_lst))", "n=int(input())\r\np=list(map(int,input().split()))\r\ng=[0]*n\r\nfor i in range(n):\r\n g[p[i]-1]=i+1\r\nprint(*g)", "a = int(input())\r\nb = list(map(int,input().split()))\r\nc=0\r\nd=\"\"\r\nfor i in range(1,a+1):\r\n d+=(str(b.index(i)+1)+\" \")\r\nprint(d)\r\n", "\"\"\"\nA. Presents: implementation\n\ntime limit per test: 2 seconds\nmemory limit per test: 256 megabytes\ninput: standard input\noutput: standard output\n\nLittle Petya very much likes gifts. Recently he has received a new laptop as a New Year gift from his mother.\nHe immediately decided to give it to somebody else as what can be more pleasant than giving somebody gifts.\nAnd on this occasion he organized a New Year party at his place and invited n his friends there.\nIf there's one thing Petya likes more that receiving gifts, that's watching others giving gifts to somebody else.\nThus, he safely hid the laptop until the next New Year and made up his mind to watch his friends exchanging gifts while he does not participate in the process.\nHe numbered all his friends with integers from 1 to n. Petya remembered that a friend number i gave a gift to a friend number pi. He also remembered that each of his friends received exactly one gift.\nNow Petya wants to know for each friend i the number of a friend who has given him a gift.\n\nInput\nThe first line contains one integer n (1 ≤ n ≤ 100) — the quantity of friends Petya invited to the party.\nThe second line contains n space-separated integers: the i-th number is pi — the number of a friend who gave a gift to friend number i.\nIt is guaranteed that each friend received exactly one gift. It is possible that some friends do not share Petya's ideas of giving gifts to somebody else. Those friends gave the gifts to themselves.\n\nOutput\nPrint n space-separated integers: the i-th number should equal the number of the friend who gave a gift to friend number i.\n\"\"\"\n\ndef presents():\n n = int(input())\n p = input().split()\n for i in range(n):\n print(p.index(str(i + 1)) + 1, end=' ')\n\nif __name__ == '__main__':\n presents()", "values = int(input())\r\narr = list(map(int,input().split()))\r\n\r\ntmp = [None] * len(arr)\r\nfor x in range(1, len(arr)+1):\r\n present_to = arr[x-1]\r\n tmp[present_to-1] = x\r\n\r\nprint(\" \".join(list(map(str,tmp))))", "if __name__ == \"__main__\":\r\n num = int(input())\r\n arr = input().split()\r\n result = ['0'] * len(arr)\r\n for i in range(len(arr)):\r\n result[int(arr[i])-1] = i+1\r\n print(\" \".join(map(str,result)))", "n = int(input())\r\ngive = list(map(int,input().split()))\r\nreceive = []\r\nfor i in range(n):\r\n receive.append(give.index(i+1)+1)\r\nprint(*receive,sep=' ')\r\n \r\n", "n=int(input())\r\nnum=input()\r\npresent=[int(x) for x in num.split()]\r\nnew_present=[]\r\nfor i in range(0,n):\r\n new_present.append(0)\r\nfor j in range(0,n):\r\n new_present[present[j]-1]=j+1\r\nfor k in range(0,n-1):\r\n print(new_present[k],end=' ')\r\nprint(new_present[n-1])", "n = int(input())\r\ns = [int(x) for x in input().split()]\r\nd = [0] * n\r\nfor i in range(n):\r\n d[s[i] - 1] = i + 1\r\nprint(*(d))", "n = int(input())\r\np = list(map(int, input().split()))\r\n\r\nfor i in range(1, n+1):\r\n j = i\r\n while p[j-1] != i:\r\n j = p[j-1]\r\n print(j, end=' ')\r\n", "n = int(input())\r\npresents = list(map(int, input().split()))\r\nf = [0] * (n + 1)\r\n\r\nfor i in range(n):\r\n f[presents[i]] = i + 1\r\n\r\nresult = [str(f[i]) for i in range(1, n + 1)]\r\nprint(\" \".join(result))\r\n", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nidx = []\r\nfor i in range(1, n + 1):\r\n print(lst.index(i) + 1, end=\" \")", "def present(gifts):\r\n sol = list()\r\n mydict = {}\r\n for gift in range (len(gifts)):\r\n mydict[gift+1] = gifts[gift]\r\n i = 1\r\n while i <= len(gifts):\r\n for item in mydict:\r\n if mydict[item] == i:\r\n sol.append(item)\r\n i += 1\r\n return sol\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n gifts = list(map(int, input().split()))\r\n result = present(gifts)\r\n for item in result:\r\n print(item, end = ' ')", "n = int(input())\r\ns = [int(i) for i in input().split()]\r\na_last = [0] * n\r\n\r\nfor i in range(1,n+1):\r\n a_last[s[i-1]-1] = i\r\nprint(*a_last)", "def gift(n, lst):\r\n r = [0] * n\r\n for i in range(n):\r\n r[lst[i] - 1] = i + 1\r\n return r\r\n \r\nn = int(input())\r\nlst = list(map(int, input().split()))\r\nans = gift(n, lst)\r\nprint(\" \".join(map(str, ans)))", "k=[]\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nfor i in range(n):\r\n i=i+1\r\n k.append(l.index(i)+1)\r\nfor i in k:\r\n print(i,end=' ')", "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 ans = [0 for i in range(n)]\r\n for i in range(n):\r\n ans[arr[i] - 1] = i+1\r\n\r\n for i in ans:\r\n print(i, end=\" \")\r\n print()", "n=int(input())\r\nl=list(map(int,input().split()))\r\nd={}\r\nfor i in range(n):\r\n d[i+1]=l[i]\r\nfor i in range(1,n+1):\r\n for k in list(d.keys()):\r\n if d[k]==i:\r\n print(k,end=\" \")", "n = int(input())\r\nl = [int(x) for x in input().split()]\r\ns = l.copy()\r\nfor i in range(n):\r\n s[l[i]-1] = i+1\r\nfor i in range(n):\r\n print(s[i],end=\" \")", "n = int(input())\r\npresents = input().split()\r\nfor i in range(len(presents)):\r\n presents[i]=int(presents[i])\r\na ={}\r\nfor i in range(len(presents)):\r\n a[presents[i]] = i+1\r\n\r\nresult = []\r\nfor i in range(n):\r\n result.append(str(a[i+1]))\r\nprint(' '.join(result))", "import sys\r\nx=int(input())\r\nl=input().split()\r\nfor i in range(0,x):\r\n \r\n for j in range(0,x):\r\n \r\n if i+1==int(l[j]):\r\n print(f'{j+1}',end=\" \")\r\n break", "n=int(input())\r\narr=list(map(int,input().split()))\r\nans=[0]*n\r\nfor i in range(n):\r\n ans[arr[i]-1]=i+1\r\nprint(' '.join(map(str,ans)))", "\r\nfrom operator import itemgetter\r\nno_of_friends = int(float(input()))\r\ngifts= input()\r\ngifts = gifts.split(' ')\r\npresents =[]\r\nfor i in range(no_of_friends):\r\n presents.append([i+1,int(gifts[i])])\r\n\r\n\r\npresents.sort(key=lambda x: x[1])\r\n\r\nfor i in range(len(presents)):\r\n print(presents[i][0],end=\" \")", "n = int(input())\r\na = list(map(int,input().strip().split(' ')))\r\nb = []\r\n\r\nfor _ in range(n):\r\n b.append(0)\r\n\r\nfor i in range(len(a)):\r\n b[a[i] - 1] = i + 1\r\n\r\nfor i in b:\r\n print(i, end = ' ')", "a=int(input())\r\ng=list(map(int,input().split()))\r\nr=[0]*a\r\nfor i in range(a):\r\n r[g[i]-1]=i+1\r\nprint(*r)", "x = int(input())\r\ny = input()\r\nl = y.split(\" \")\r\n\r\nout = []\r\nfor i in range(1, x+1):\r\n out.append(str(1 + l.index(str(i))))\r\n\r\nprint(\" \".join(out))", "x=input()\r\ny=list(map(int,input().split()))\r\nk=[]\r\nfor i in range(1,len(y)+1):\r\n k.append(y.index(i)+1)\r\nprint(*k)", "#int = integer\r\n#str = string\r\n#float = double\r\n#d = input()\r\n#print(d)\r\n\r\n#int()\r\n#e=int(input())\r\n#e=str(e)\r\n#print(e)\r\n# + - * /\r\n#chr\r\n#ord\r\n#a=int(input())\r\n#b=int(input())\r\n#print(len(l))\r\n#print(l[len(l)])\r\n#print(l)\r\nimport math\r\n\r\n#for x in range(1,10):\r\n# print(x)\r\n#min()\r\n#max()\r\n#sum()\r\n#input row: s=list(map(int,input().split()))\r\n\r\nn=int(input())\r\nl=[int(i) for i in input().split()] \r\nk=l[0:]\r\nfor i in range(n):\r\n k[l[i]-1]=i+1 \r\nfor i in k:\r\n print(i,end=\" \")\r\n\r\n", "n = int(input())\r\ngifts = list(map(int, input().split()))\r\n\r\nresult = [0] * n # Initialize an array to store the givers of gifts\r\n\r\nfor i in range(n):\r\n result[gifts[i] - 1] = i + 1 # Assign the giver's number to the receiver's index\r\n\r\nprint(*result) # Print the result as space-separated integers\r\n", "def tim_nguoi_tang_qua(n, nguoi_nhan_qua):\r\n nguoi_tang_qua = [0] * n\r\n for i in range(n):\r\n nguoi_tang_qua[nguoi_nhan_qua[i] - 1] = i + 1\r\n return nguoi_tang_qua\r\n\r\n# Đọc dữ liệu đầu vào\r\nn = int(input())\r\nnguoi_nhan_qua = list(map(int, input().split()))\r\n\r\n# Tìm người tặng quà cho mỗi người bạn\r\nket_qua = tim_nguoi_tang_qua(n, nguoi_nhan_qua)\r\n\r\n# In kết quả ra màn hình\r\nprint(*ket_qua)", "n = int(input())\r\ngifter = list(map(int, input().split()))\r\n\r\n# Initialize an array to store the gifter for each friend\r\nreceiver = [0] * n\r\n\r\n# Fill in the gifter for each friend based on the input\r\nfor i in range(n):\r\n receiver[gifter[i] - 1] = i + 1 # Subtract 1 to convert to 0-based index\r\n\r\n# Print the gifter for each friend\r\nprint(*receiver)\r\n", "n=int(input())\r\ni=input().split()\r\ni=list(i)\r\ni.insert(0,' ')\r\nk=1\r\nw=[]\r\nwhile n:\r\n a=i.index(i[k])\r\n a=str(a)\r\n for i1 in i:\r\n if i1==a:\r\n q=i.index(i1)\r\n w.append(q)\r\n k+=1\r\n n-=1\r\nr=''\r\nfor w1 in w:\r\n w1=str(w1)\r\n r+=w1\r\n r+=' '\r\nprint(r)", "import sys\n\ninput = sys.stdin.readline\n\nn = int(input())\n\nnums = [None] * (n + 1)\n\nnums_list = list(map(str, input().split()))\n\nfor i, p in enumerate(nums_list):\n nums[int(p)] = str(i + 1)\n\nnums = nums[1:]\nresult = \" \".join(nums)\nsys.stdout.write(f\"{result}\")\n", "a=int(input())\r\nb=input().split()\r\nb=[int(char) for char in b]\r\nres=\"\"\r\nfor c in range(1,a+1):\r\n ind=b.index(c)+1\r\n res+=str(ind)+\" \"\r\nprint(res)\r\n", "n=int(input())\r\np=list(map(int,input().split()))\r\nr=[0]*n\r\nfor i in range(0,n):\r\n r[p[i]-1]=i+1\r\nprint(\" \".join(str(e) for e in r)) ", "n = int(input())\r\np = list(map(int, input().split()))\r\n\r\nresult = [0] * n\r\nfor i in range(n):\r\n j = i\r\n while p[j] != i+1:\r\n j = p[j] - 1\r\n result[i] = j+1\r\n\r\nprint(*result)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=[0]*(n+1)\r\nfor k in range(n):\r\n b[a[k]]=k+1\r\nfor k in range(1,n+1):\r\n print(b[k],end=' ')\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Mar 24 19:57:43 2023\r\n\r\n@author: Srusty Sahoo\r\n\"\"\"\r\n\r\nn=int(input())\r\ng=list(map(int,input().split()))\r\nlist1=[]\r\ni=1\r\nwhile i<=n:\r\n x=g.index(i)\r\n list1.append(x+1)\r\n i=i+1\r\n\r\ny=list(map(str,list1))\r\nprint(\" \".join(y))", "\n\nn = int(input())\n\nps = list( map(int, input().split(' ')) )\n\npairs = list( zip(ps, [x for x in range(1, n + 1)]) )\n\npairs.sort()\n\nfor pair in pairs:\n print(pair[1], end=' ')\n", "jk= int(input())\r\nrr = list(map(int, input().split()))\r\n\r\ngr = [0] * jk\r\n\r\nfor i in range(jk):\r\n gr[rr[i] - 1] = i + 1\r\n\r\nprint(' '.join(map(str, gr)))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Sep 13 22:18:34 2023\r\n\r\n@author: Zinc\r\n\"\"\"\r\n\r\nn=int(input())\r\ns=[int(y) for y in input().split()]\r\nlist=[]\r\nfor i in range(1,n+1):\r\n list.append(s.index(i)+1)\r\nprint(' '.join(str(x) for x in list))", "n = int(input())\r\nout = []\r\nfor _ in range(n):\r\n out.append(0)\r\n\r\ns = list(map(int,input().split()))\r\n\r\nfor i in range(n):\r\n out[s[i]-1] = i+1\r\n\r\nout = map(str, out)\r\nprint(\" \".join(out))", "\nn = int(input())\n\np = input().split()\np = [int(n) for n in p]\n \nq = []\nfor i in range(n) :\n q.append(0)\n\nfor i in range(n) :\n q[p[i]-1]=i+1\n \nfor i in range(n) :\n print(q[i],end=\" \")\n\t\t \t \t\t \t\t \t \t \t \t\t\t \t", "n = int(input())\narr = list(map(int, input().split()))\nindex = [i for i in range(1, n+1)]\ntwo_d = []\nfor i in range(n):\n two_d.append([arr[i], index[i]])\ntwo_d.sort(key=lambda row: row[0])\nfor i in two_d:\n print(i[1], end=\" \")\nprint()\n", "_R=int(input())\r\nM_N=input().split()\r\nfor S_O in range(_R):\r\n\tprint(M_N.index(str(S_O+1))+1)", "n = int(input())\r\narr = list(map(int, input().split()))\r\nans = [0 for i in range(n)]\r\nfor i in range(n):\r\n ans[arr[i] - 1] = i + 1\r\nprint(*ans)", "n = int(input())\ngifts = list(map(int, input().split()))\n\nresult = [0] * n\nfor i in range(n):\n result[gifts[i]-1] = i+1\n\nprint(*result)\n\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\n\r\nfor x in range(1,a+1):\r\n print(b.index(x)+1,end=' ')", "n = int(input())\r\np = list(map(int, input().split()))\r\n\r\nans = [0] * n\r\n\r\nfor i in range(1, n+1):\r\n ans[p[i-1]-1] = i\r\n\r\nprint(' '.join(map(str, ans)))", "n=int(input())\r\ngifts=list(map(int,input().split()))\r\ngifts1=[0 for i in range(n+1)]\r\nfor i in range(1,n+1):\r\n gifts1[gifts[i-1]]=str(i)\r\nprint(\" \".join(gifts1[1:]))", "n = int(input())\r\nm = []\r\na2 = [0] * n\r\nfor a in input().split():\r\n m.append(int(a))\r\nfor i in range(1, n + 1):\r\n a2[m[i - 1] - 1] = i\r\nprint(*a2)", "amount = int(input())\r\nfriends_num =list(map(int,input().split()))\r\nresult = [1] * amount\r\nfor i in range(amount):\r\n result[friends_num[i]-1]=i+1\r\nfinal= ' '.join(map(str, result))\r\nprint(final)", "# Input\r\nn = int(input())\r\ngift_givers = list(map(int, input().split()))\r\n\r\n# Initialize an array to store the result\r\nresult = [0] * n\r\n\r\n# Iterate through the friends and their gift givers\r\nfor i in range(n):\r\n result[gift_givers[i] - 1] = i + 1\r\n\r\n# Output the result\r\nprint(*result)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl_new=[0]*n\r\nfor i in range(n):\r\n l_new[l[i]-1]=i+1\r\nfor i in l_new:\r\n print(i,end=\" \")", "_ = input()\r\ns = list(map(int, input().split()))\r\nansw = [0]*len(s)\r\nfor i, c in enumerate(s):\r\n answ[c-1] = i+1\r\nprint(*answ)", "n=int(input())\r\nf=list(map(int,input().split()))\r\nl=['0']*n\r\nfor i in range(n):\r\n a=f[i]\r\n l[a-1]=str(i+1)\r\nprint(' '.join(l))\r\n", "def Presents(n):\r\n\r\n data = input().split()\r\n\r\n rst_str = ''\r\n\r\n for i in range(1, n + 1):\r\n\r\n for k in range(n):\r\n\r\n if i == int(data[k]):\r\n \r\n if i == 1:\r\n rst_str += str(k + 1)\r\n\r\n else:\r\n rst_str += ' ' + str(k + 1)\r\n\r\n return rst_str\r\n\r\nprint(Presents(int(input())))", "n=int(input())\r\na=input().split(\" \")\r\nb=[]\r\nfor i in range(1, len(a)+1):\r\n b.append(str(a.index(str(i))+1))\r\nprint(\" \".join(b))\r\n ", "n=int(input())\r\nnums=list(map(int,input().split()))\r\nres=list()\r\nc=1\r\nfor i in range(n):\r\n index=nums.index(c)\r\n print(f'{index+1} ',end=\"\")\r\n c=c+1\r\n ", "n = int(input())\r\np1 = list(map(int,input().split()))\r\np2 = [0] * n \r\nfor i in range(len(p1)):\r\n p2[p1[i]-1] = i + 1 \r\nfor i in p2:\r\n print(i,end = \" \")", "N, P, j = int(input()), list(map(int,input().split())), 0; Presents = [0] * (N+1)\r\nfor i in range(1, N+1): Presents[P[j]] = i; j += 1\r\nfor i in range(1, N+1): print(Presents[i], end=\" \")\r\n", "n=int(input())\r\ns=input()\r\nk=s.split(\" \")\r\nl=[]\r\nfor i in k:\r\n l.append(int(i))\r\n \r\nl2=l.copy()\r\nl2.sort()\r\n\r\nfor i in l2:\r\n x=l.index(i)\r\n print(x+1,end=\" \")\r\n", "t = int(input()) \r\na=list(map(int,input().split()))\r\nfor i in range(t):\r\n print(a.index(i+1)+1,end=\" \")\r\n", "n = int(input())\r\ng = list(map(int, input().split()))\r\nng = [0 for _ in range(n)]\r\nfor i in g:\r\n ng[i - 1] = str(g.index(i) + 1)\r\n\r\ns = ' '.join(ng)\r\nprint(s)", "n=int(input())\r\nx=list(map(int,(input().split())))\r\nfor i in range(n):\r\n y=x.index(i+1)\r\n print(y+1,end=' ')\r\n", "n = int(input())\nreceivers = list(map(int, input().split()))\n\ngivers = {}\nfor i, receiver in enumerate(receivers):\n givers[receiver] = i + 1\n\nfor i in range(1, n + 1):\n print(givers[i], end=\" \")", "n=int(input())\r\nm=list(map(int,input().split()))\r\ns=len(m)\r\nd={}\r\nk=1\r\nfor i in m:\r\n d[k]=i\r\n k=k+1\r\nm=list(sorted(d.items(),key=lambda x:x[1]))\r\nfor i in range(0,s):\r\n print(m[i][0],end=\" \")", "def sol():\r\n n=int(input())\r\n l=list(map(int,input().split(\" \")))\r\n l1=[]\r\n l2=[]\r\n for i in range(n):\r\n l1.append(str(i+1))\r\n l1.append(l[i])\r\n for j in range(n):\r\n x=l1.index(j+1)\r\n l2.append(l1[x-1])\r\n s=\"\"\r\n for k in l2:\r\n s=s+k+\" \"\r\n print(s)\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\nsol()", "n=int(input())\r\np=list(map(int,input().split()))\r\ndef y(n,p):\r\n ans=[0]*n\r\n for i in range(n):\r\n ans[p[i]-1]=i+1\r\n return ans\r\nx=y(n,p)\r\nprint(\" \".join(map(str,x)))", "n=int(input())\r\nnum=list(map(int,input().split()))\r\nans=[]\r\nvalue=1\r\nfor i in range (len(num)):\r\n for j in range (len(num)):\r\n if num[j]==value:\r\n ans.append(j+1)\r\n value+=1\r\nfor i in range (len(ans)):\r\n print(ans[i],end=' ')\r\n\r\n \r\n\r\n \r\n \r\n \r\n", "n = int(input())\r\ngifts = list(map(int, input().split()))\r\n\r\nresult = [0] * n\r\nfor i, gift in enumerate(gifts):\r\n result[gift-1] = i+1\r\n\r\nprint(' '.join(map(str, result)))\r\n\r\n", "x=int(input())\r\np= list(map(int, input().split()))\r\nz=[]\r\nfor i in range(1,x+1):\r\n z.append(i)\r\nfor i in range(1,x+1):\r\n v=p.index(i)\r\n print(z[v],end=\" \")", "n = int(input())\r\ns = [int(i) for i in input().split()]\r\nt = []\r\nfor i in range(1, n+1):\r\n t.append(s.index(i)+1)\r\nprint(*t)", "n = int(input())\r\nreceiveFrom = {value: index for index, value in enumerate(map(int, input().split()), 1)}\r\nfor _ in range(1, n + 1):\r\n print(receiveFrom[_], end = ' ')", "def find_gift_giver(n, pi):\n gift_givers = [0] * n\n \n \n for i in range(n):\n gift_givers[pi[i] - 1] = i + 1\n \n return gift_givers\nn = int(input().strip()) # Number of friends\npi = list(map(int, input().strip().split())) # Friend who gave a gift to friend i\n\n\ngift_givers = find_gift_giver(n, pi)\n\n\nprint(' '.join(map(str, gift_givers)))\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\nl=list(map(int, input().split()))\r\nb=[0]*n\r\nfor i in range(0, n):\r\n b[l[i]-1]=i+1\r\nprint(*b, sep=\" \")", "n = int(input())\r\npi = list(map(int, input().split()))\r\ngifts = [0] * n\r\nfor i in range(n):\r\n j = pi[i] - 1\r\n gifts[j] = i + 1\r\nprint(*gifts)\r\n", "\r\np = int(input())\r\ngift_givers = list(map(int, input().split()))\r\n\r\n\r\nresult = [0] * p\r\n\r\n\r\nfor i in range(p):\r\n result[gift_givers[i] - 1] = i + 1\r\n\r\n\r\nprint(*result)\r\n", "n = int(input())\r\nl = [int(x) for x in input().split()]\r\np = 0\r\nans = [0] * n\r\nfor i in range(1, n + 1):\r\n p = l[i-1]\r\n ans[p - 1] = i \r\nfor i in range(n):\r\n print(ans[i], end=\" \")\r\nprint()", "n = int(input())\r\np = list(map(int, input().split()))\r\n\r\ngift_giver = [0] * (n+1)\r\nfor i in range(n):\r\n gift_giver[p[i]] = i + 1\r\n\r\nprint(*gift_giver[1:])\r\n", "n = int(input())\r\ngifts = list(map(int, input().split())) \r\nsortedGifts = gifts.copy()\r\nsortedGifts.sort()\r\nres = []\r\nfor i in range(n):\r\n res.append(str(gifts.index(sortedGifts[i])+1))\r\nprint(' '.join(res))", "n = int(input())\r\np = list(map(int, input().split()))\r\nq = [0] * n\r\nfor i in range(n):\r\n q[p[i]-1] = i+1\r\nprint(' '.join(map(str, q)))\r\n", "a=int(input())\r\nb=list(map(int,input().split()))\r\nc=[\"0\"]*a\r\nfor i in range(0,a):\r\n c[(b[i]-1)]=str(i+1)\r\nprint(\" \".join(c))", "n = int(input())\r\ngifts = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n print(gifts.index(i + 1) + 1, end=' ')", "def oddn(n):\r\n for i in range(2, n+1):\r\n if(i%2 != 0 and n%i == 0):\r\n return i\r\n return 3\r\n \r\n \r\nn = int(input())\r\na = list(map(int, input().split()))\r\nb = a.copy()\r\nfor i in range(n):\r\n if(a[i] == i+1):\r\n pass\r\n else:\r\n b[a[i]-1] = i+1\r\nprint(*b)\r\n \r\n \r\n", "n = int(input())\r\na = input().split()\r\nj = 1\r\nls1 = []\r\nwhile(j<=n):\r\n k = a.index(str(j))\r\n print(k+1,end=\" \")\r\n j = j + 1", "n = int(input())\r\nfriends = list(map(int,input().split()))\r\ngifts=[0 for i in range(n)]\r\n\r\nfor i in range(n):\r\n gifts[friends[i]-1]=i+1\r\n\r\nprint(' '.join(map(str,(gifts))))", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nans = [0]*n\r\nfor i in a:\r\n ans[i-1] = a.index(i)+1\r\nprint(' '.join(map(str, ans)))\r\n ", "n = int(input())\r\np = input().split()\r\nq = list(p)\r\nt =[None]*n\r\nfor i in range(len(q)):\r\n x =int(q[i])\r\n t[x-1]=i+1\r\n a = ' '.join(map(str, t))\r\nprint(a)\r\n", "def main():\r\n n = int(input())\r\n p = list(map(int, input().split()))\r\n ans = [0] * n\r\n for i in range(n):\r\n ans[p[i]-1] = i+1\r\n\r\n print(*ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "# URL: https://codeforces.com/problemset/problem/136/A\nn = int(input())\np = list(map(int, input().split()))\nans = p.copy()\nfor i in range(1, n + 1):\n ans[p[i - 1] - 1] = i\nprint(\" \".join(map(str, ans)))\n", "number = int(input())\nfriends = input().split(' ')\ndict = {}\nlist= friends\nout =''\nfor j,i in enumerate(friends):\n dict[i] = j+1\n\nfor k in range(number):\n list[k]= dict[str(k+1)]\n\nfor n in list:\n out+= str(n) + ' '\nprint(out)", "n=int(input())\r\na=[]\r\np=list(map(int, input().split()))\r\nfor i in range(n):\r\n a.append(0)\r\nfor j in range(n):\r\n a[p[j]-1]=j+1\r\nprint(*a)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nd={}\r\nfor i in range(1,n+1):\r\n\td[l[i-1]]=i\r\nd=dict(sorted(d.items()))\r\nfor i in d:\r\n\tprint(d[i],end=\" \")\r\n", "n = int(input())\r\np = input().split(' ')\r\nfor i in range(1 ,len(p)+1):\r\n print(p.index(str(i))+1, end=' ')\r\n", "t = int(input())\r\na = list(map(int, input().split(\" \")))\r\nfor k in range(1, t+1):\r\n print(a.index(k) + 1, end=\" \" )", "import sys\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n=int(input())\r\n v={}\r\n aux=input().split(\" \")\r\n for elem in aux:\r\n v[int(aux.index(elem)+1)]=int(elem)\r\n v={value:k for k , value in v.items()}\r\n for i in range (1,n+1):\r\n print(v[i],end=\" \")", "# q30 A. Presents\r\nn = int(input())\r\nlst=list(map(int,input().split(' ')))\r\nfor i in range(1,n+1):\r\n print(lst.index(i)+1,end=' ')", "\"\"\"n=int(input())\r\nif n==2 or n%2==1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\"\"\"\r\n\r\n\"\"\"n=int(input())\r\nfor i in range(n):\r\n str=input()\r\n l=len(str)\r\n if l<=10:\r\n print(str)\r\n else:\r\n x=\"{}\".format(l-2)\r\n print(str[0]+x+str[-1])\"\"\"\r\n\"\"\"n=int(input())\r\nx=0\r\nfor i in range(n):\r\n a,b,c=input().split()\r\n if a==\"1\" and b==\"1\" :\r\n x+=1\r\n elif a==\"1\" and c==\"1\":\r\n x+=1\r\n elif b==\"1\" and c==\"1\":\r\n x+=1\r\nprint(x)\"\"\"\r\n\"\"\"n,k=map(int,input().split())\r\nscores=list(map(int,input().split()))\r\nz=0\r\nfor points in scores:\r\n if points>=scores[k-1] and points!=0:\r\n z+=1\r\nprint(z)\"\"\"\r\n\"\"\"n,m=map(int,input().split())\r\nprint((n*m)//2)\"\"\"\r\n\"\"\"n=int(input())\r\nX=0\r\nfor i in range(n):\r\n oper=input()\r\n if oper==\"++X\" or oper==\"X++\":\r\n X+=1\r\n elif oper==\"--X\" or oper==\"X--\":\r\n X-=1\r\nprint(X)\"\"\"\r\n\"\"\"\r\nfor i in range(1,6):\r\n m=list(map(int,input().split()))\r\n #r,c=0,0\r\n for j in range(1,6):\r\n if m[j-1]==1:\r\n print(abs(i-3)+abs(j-3))\r\n break\"\"\"\r\n# ip1=input()\r\n# ip2= input()\r\n# ip1=ip1.lower()\r\n# ip2=ip2.lower()\r\n# if ip1>ip2:\r\n# print(1)\r\n# elif ip1<ip2:\r\n# print(-1)\r\n# elif ip1==ip2:\r\n# print(0)\r\n#231A\r\n# hlp=input()\r\n# lst=[]\r\n# for w in hlp :\r\n# if w!='+':\r\n# lst.append(w)\r\n# lst.sort()\r\n# # print(lst)\r\n# hlp=\"\"\r\n# for i in lst[:-1]:\r\n# hlp+=i+'+'\r\n# print(hlp+lst[-1])\r\n# c=input()\r\n# print(c[0].upper()+c[1:])\r\n# ch=input()\r\n# set=set(ch)\r\n# n=0\r\n# for s in set:\r\n# n+=1\r\n# #print(set)\r\n# if n&1:\r\n# print(\"IGNORE HIM!\")\r\n# else:\r\n# print(\"CHAT WITH HER!\")\r\n# n=int(input())\r\n# str=input()\r\n# count=0\r\n# for i in range(n-1):\r\n# if str[i]==str[i+1]:\r\n# count+=1\r\n# print(count)\r\n# a,b=map(int,input().split())\r\n# count=0\r\n# while(a<=b):\r\n# count+=1\r\n# a=a*3\r\n# b=b*2\r\n# print(count)\r\n# k,n,w=map(int,input().split())\r\n# tc=0\r\n# for i in range(1,w+1):\r\n# tc+=k*i\r\n# if tc<n:\r\n# print(0)\r\n# else: \r\n# print(tc-n)\r\n# x=int(input())\r\n# count=0\r\n# if x%5==0:\r\n# count=x//5\r\n# else:\r\n# count=x//5+1\r\n# print(count)\r\n# str=input()\r\n# c1=0\r\n# for letter in str:\r\n# if letter.isupper():\r\n# c1+=1\r\n# if (len(str)-c1)>=c1:\r\n# print(str.lower())\r\n# else:\r\n# print(str.upper())\r\n# n,k=map(int,input().split())\r\n# while(k>0):\r\n# ld=n%10\r\n# if ld==0:\r\n# n=n//10\r\n# else:\r\n# n=n-1\r\n# k-=1\r\n# print(n)\r\n# n=int(input())\r\n# c1=0\r\n# while(n>0):\r\n# r=n%10\r\n# if r==4 or r== 7:\r\n# c1+=1\r\n# n=n//10\r\n# if c1==4 or c1==7:\r\n# print(\"YES\")\r\n# else:\r\n# print(\"NO\")\r\n# n=int(input())\r\n# passengers_in_tram=0\r\n# ans=0\r\n# while n>0:\r\n# a,b=map(int,input().split())\r\n# #temp=passengers_in_tram\r\n# passengers_in_tram=(passengers_in_tram-a)+b\r\n# ans=max(passengers_in_tram,ans)\r\n# #print(ans)\r\n# n-=1\r\n# print(ans)\r\n# n,t=map(int,input().split())\r\n# s=input()\r\n# while(t>0):\r\n# a=list(s)\r\n# k=len(a)\r\n# slow=0\r\n# fast=1\r\n# while k>0:\r\n# if slow<len(a) and fast<len(a):\r\n# if a[slow]==\"B\" and a[fast]==\"G\":\r\n# a[slow],a[fast]=\"G\",\"B\"\r\n# slow=fast+1\r\n# fast=slow+1\r\n# #print(a,slow,fast,k)\r\n# else:\r\n# slow+=1\r\n# fast+=1\r\n# #print(a,slow,fast)\r\n# k-=1\r\n# s=\"\".join(a)\r\n# t-=1\r\n# print(s)\\\r\n# y= int(input())\r\n# while y!=0:\r\n# y+=1\r\n# a=y%10\r\n# b=(y//10)%10\r\n# c=(y//100)%10\r\n# d=(y//1000)%10\r\n# if a!=b and a!=c and a!=d and b!=c and b!=d and c!=d:\r\n# break\r\n# print(y)\r\n# n=int(input())\r\n# response=list(map(int,input().split()))\r\n# flag=0\r\n# for i in response:\r\n# if i==1:\r\n# flag=1\r\n# break\r\n# if flag==1:\r\n# print(\"HARD\")\r\n# else:\r\n# print(\"EASY\")\r\nn = int(input())\r\np=list(map(int,input().split()))\r\nfor i in range(n):\r\n print(p.index(i+1)+1)", "n=input()\r\ns=input().split()\r\noutput=[None]*int(n)\r\nfor i in range(int(n)):\r\n output[int(s[i])-1]=i+1\r\nprint(' '.join(str(x) for x in output))", "\r\n\r\nn = int(input())\r\np = list(map(int, input().split()))\r\nd = {}\r\n\r\nfor i in range(n):\r\n d[p[i]] = i + 1\r\nfor i in range(n):\r\n print(d[i + 1])\r\n\r\n\r\n", "n=int(input())\r\narr = list(map(int,input().split()))\r\n\r\nnew = [0]*n\r\n\r\nfor i in range(len(arr)):\r\n new[arr[i]-1] = i+1\r\nprint(*new)", "t=int(input())\r\ng=list(map(int,input().split()))\r\nres=[0]*t\r\nfor i in range(t):\r\n res[g[i]-1]=i+1\r\nprint(*res)", "a = int(input())\r\nn = [int(x) for x in input().split()] # Input: 1 3 2 6 4 5 7 9 8 10\r\nm = n.copy()\r\n\r\nn.sort()\r\n\r\nresult = [0] * a # Create a new list of size 'a' to store the modified order\r\n\r\nfor i in range(a):\r\n result[m[i] - 1] = n[i] # Place the sorted elements at their modified positions\r\n\r\nfor j in result:\r\n print(j, end=' ') # Print the elements separated by a space\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 Presents():\r\n n = inp()\r\n giving_list = inlt()\r\n\r\n giving_dict = {}\r\n for index,friend in enumerate(giving_list):\r\n giving_dict[index+1] = friend\r\n\r\n receiving_dict = dict([(value,key) for key,value in giving_dict.items()])\r\n\r\n receiving_list = []\r\n for friend in range(n):\r\n receiving_list.append(receiving_dict[friend+1])\r\n \r\n outputStr = ' '.join(str(x) for x in receiving_list)\r\n print(outputStr)\r\n return\r\n\r\nPresents()", "n = int(input())\r\nfriends = list(map(int, input().split()))\r\nanswers = []\r\nfor i in range(1, n+1):\r\n answers.append(friends.index(i)+1)\r\nprint(*answers)", "n = int(input())\r\ng = [int(i) for i in input().split()]\r\nres = [ 0 for _ in range(n)]\r\nfor idx,i in enumerate(g) : \r\n res[i-1] = idx+1 \r\n\r\nres = [ str(i) for i in res] \r\nprint(\" \".join(res))", "n = int(input())\r\ngift_givers = list(map(int, input().split()))\r\ngift_receivers = [0] * n\r\n\r\nfor i in range(n):\r\n gift_receivers[i] = gift_givers.index(i + 1) + 1\r\n\r\nprint(*gift_receivers)", "x=int(input())\r\na=input().split()\r\nprint(*[a.index(str(i+1))+1 for i in range(x)])", "n = int(input())\r\nl = list(map(int, input().split()))\r\nres = ''\r\nfor i in range(1, n+1):\r\n res+=(str(l.index(i)+1)+' ')\r\nprint(res)", "n=int(input())\r\nl=input().split()\r\no=\"\"\r\nfor i in range (n):\r\n o+=str(l.index(str(i+1))+1) + \" \"\r\n\r\nprint(o[0:-1])\r\n", "import sys\r\n\r\na = int(input(\"\"))\r\nb = [int(i)for i in sys.stdin.readline().split()]\r\nd = \"\"\r\nfor i in range(0, a):\r\n d += str(b.index(i + 1) + 1) + \" \"\r\nprint(d)\r\n", "a = int(input())\r\np = list(map(int, input().split()))\r\n\r\ng = [0] * a # initialize array to hold the giver of each gift\r\nfor i in range(a):\r\n g[p[i] - 1] = i + 1 # record that person i+1 gave a gift to person p[i]\r\n\r\nprint(' '.join(map(str, g))) # print the result as space-separated integers\r\n\r\n", "n = int(input())\r\na= []\r\na = list(map(int, input().split()))\r\n\r\nfor i in range(1,n+1):\r\n vitri = a.index(i)\r\n print(vitri+1,end=\" \")", "\r\nt = int(input())\r\ns = input().split()\r\nfor i in range(t):\r\n print(s.index(str(i + 1)) + 1, end = \" \")\r\n", "def presents():\r\n n = int(input())\r\n presents = list(map(int, input().split()))[:n]\r\n allFriends = []\r\n for i in range(1,len(presents)+1):\r\n newList = [presents[i-1], i]\r\n allFriends.append(newList)\r\n allFriends = sorted(allFriends)\r\n for i in range(len(allFriends)):\r\n \r\n if i == (len(allFriends)-1):\r\n print(allFriends[i][1], end=\"\")\r\n else:\r\n print(allFriends[i][1], end=\" \")\r\n \r\npresents()", "number_of_friends = int(input())\r\ngiven_gifts = input().split()\r\nindex_of_value = []\r\nvalue = []\r\ni = 0\r\noutput = \"\"\r\nfor ch in given_gifts:\r\n index_of_value.append(int(ch) - 1)\r\n value.append(str(given_gifts.index(ch) + 1))\r\nfor _ in range(number_of_friends):\r\n output += value[index_of_value.index(i)] + \" \"\r\n i += 1\r\nprint(output)", "n = int(input())\r\ngifts = list(map(int, input().split()))\r\nans = [0] * (n)\r\nfor i, gift in enumerate(gifts):\r\n ans[gift-1] = i +1\r\nprint(*ans)\r\n", "t = int(input())\r\nx = input().split()\r\nx = [int(i) for i in x]\r\nm = []\r\nfor i in range(t):\r\n m.append(x.index(i+1)+1)\r\nm = [str(j) for j in m]\r\np = \" \".join(m)\r\nprint(p)", "n=int(input())\r\np=list(map(int,input().split()))\r\nans=[-1]*(n)\r\nfor i in range(n):\r\n ans[p[i]-1]=i+1\r\nprint(*ans)", "# Решение задач проекта CODEFORSES, Задача 136A\r\n#\r\n# (C) 2023 Артур Ще, Москва, Россия\r\n# Released under GNU Public License (GPL)\r\n# email [email protected]\r\n# -----------------------------------------------------------\r\n\r\n'''\r\nA. Подарки\r\nограничение по времени на тест2 seconds\r\nограничение по памяти на тест256 megabytes\r\nвводстандартный ввод\r\nвыводстандартный вывод\r\nМаленький Петя очень любит подарки. Недавно мама подарила ему новый ноутбук на Новый Год. Он тут же решил передарить\r\nего кому-то еще, ведь что может быть приятнее, чем дарить кому-то подарок. По этому случаю он организовал новогоднюю\r\nвечеринку у себя дома и пригласил туда n своих друзей.\r\n\r\nБольше чем самому дарить подарки Петя любит только смотреть, как другие дарят подарки кому-либо. Так что ноутбук\r\nон припрятал до следующего Нового Года, а сам решил понаблюдать за процессом обмена подарками между своими друзьями,\r\nоставаясь в стороне. Он пронумеровал всех своих друзей целыми числами от 1 до n. Петя запомнил, что друг с номером i\r\nподарил подарок другу с номером pi. Он также запомнил, что каждому из его друзей достался ровно один подарок.\r\n\r\nТеперь для каждого друга i Петя хочет узнать номер друга, который подарил ему подарок.\r\n\r\nВходные данные\r\nВ первой строке записано одно целое число n (1 ≤ n ≤ 100) — количество приглашенных на вечеринку друзей Пети.\r\nВо второй строке записаны n целых чисел через пробел: i-ое число задает pi — номер друга, которому подарил\r\nподарок друг с номером i. Гарантируется, что каждый друг получил ровно один подарок. Возможно, что некоторые\r\nдрузья не разделяют мнения Пети о приятности дарения подарков другим, а поэтому подарили подарок сами себе.\r\n\r\nВыходные данные\r\nВыведите n целых чисел, разделенных пробелом: i-ое число должно быть равно номеру друга, от которого получил\r\nподарок друг с номером i.\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(input())\r\na2=[int(i) for i in input().split()]\r\na3 = [0 for z in range(a1)]\r\nfor q in range(a1):\r\n# print(a2[q])\r\n a3[a2[q]-1]=q+1\r\nfor q in a3:\r\n print(q,end=' ')", "def presnetspetya(n,s):\r\n alist=[int(d) for d in s.split()]\r\n blist=[]\r\n for i in range(len(alist)):\r\n blist.append(i+1)\r\n clist=[]\r\n k=1\r\n while k<=n:\r\n clist.append(blist[alist.index(k)])\r\n k+=1\r\n return clist\r\nn=int(input())\r\ns=input()\r\nmeg=(presnetspetya(n,s))\r\nfor res in meg:\r\n print(res,end=\" \")", "n = int(input())\r\n\r\ngt = list(map(int, input().split()))\r\n\r\nres = [0]*n\r\n\r\nfor i in range(n):\r\n res[gt[i] - 1] = i + 1\r\n\r\nprint(' '.join(map(str, res)))", "n = int(input())\r\np = list(map(int, input().split()))\r\n\r\ninverse = [0] * n\r\nfor j, i in enumerate(p):\r\n inverse[i-1] = j+1\r\n\r\nprint(*inverse)\r\n", "n = int(input())\r\ng = [int(x) for x in input().split()]\r\nl = []\r\n\r\nfor i in range(n):\r\n a = g.index(i+1)+1\r\n l.append(a)\r\nprint(*l)", "N = int(input())\r\njärjend = list(map(int,input().split()))\r\n\r\nuus = []\r\n\r\nfor i in range(N):\r\n for j in range(N):\r\n if järjend[j] == i+1:\r\n uus.append(j+1)\r\n\r\nprint(\" \".join(map(str,uus)))", "n=int(input())\r\np=list(map(int,input().split()))\r\n# print(p)\r\np2=[]\r\nfor i in range (n):\r\n ind=p.index(i+1)\r\n p2.append(ind+1)\r\n\r\nprint(*p2)\r\n", "n=int(input())\r\nl=list(map(int, input().split()))\r\nl=list(map(lambda x:x-1, l))\r\nl1=[-1 for i in range(n)]\r\nfor i in range(n):\r\n l1[l[i]]=i+1\r\nfor i in l1:\r\n print(i,end=' ')", "n=int(input().strip())\r\na=list(map(int,input().strip().split()))\r\np=[0 for i in range(n)]\r\nfor i in range(n):\r\n p[a[i]-1]=i+1\r\nprint(*p)", "def gift(n, k):\n giver = [0] * n\n\n for i in range(n):\n giver[k[i] - 1] = i + 1\n\n return giver\n\nn = int(input().strip())\nk = list(map(int, input().strip().split()))\n\ngiver = gift(n, k)\n\nprint(*giver)\n\n\t\t\t \t\t \t\t \t\t \t \t\t \t \t \t\t\t \t", "n = int(input())\r\np = list(map(int, input().split()))\r\nd = {}\r\nfor i,j in enumerate(p):\r\n d[j] = i+1\r\nfor i in range(1, n+1):\r\n print(d[i], end = \" \")", "def Presents():\r\n numberOfFriends = int(input())\r\n friendsGifts = str(input()).split(\" \")\r\n finalArray = [0] * numberOfFriends\r\n finalAnswer = \"\"\r\n i = 0\r\n while (i < numberOfFriends):\r\n holdNum = int(friendsGifts[i])\r\n finalArray[holdNum - 1] = int(i + 1)\r\n i += 1\r\n i2 = 0\r\n while (i2 < numberOfFriends):\r\n finalAnswer += str(finalArray[i2]) + \" \" \r\n i2 += 1\r\n print(finalAnswer)\r\nPresents()", "x=int(input())\r\ny=list(map(int,input().split()))\r\nz=[0]*(x+1)\r\nfor i in range(1,1+x):\r\n z[y[i-1]]=i\r\nz.remove(0)\r\nprint(*z,sep=' ')", "import sys \n\nn = int(sys.stdin.readline().split()[0])\n\nfriends = []\n\nfor line in sys.stdin:\n for word in line.split():\n friends.append(int(word))\n\nfriends_ = [0 for i in range(n)]\n\ni = 0\n\nwhile i < n:\n friends_[friends[i] - 1] = i + 1\n i += 1\n\nprint(*friends_)", "n = int(input()) # Number of friends\r\ngift_givers = list(map(int, input().split())) # List of gift givers\r\n\r\n# Initialize the result array with zeros\r\nresult = [0] * n\r\n\r\n# Fill the result array by assigning the gift giver to each friend\r\nfor i in range(n):\r\n result[gift_givers[i] - 1] = i + 1\r\n\r\n# Print the result array\r\nprint(*result)\r\n", "n = int(input())\r\np = input()\r\nl = p.split(' ')\r\nl = [int(s) for s in l]\r\nlst = []\r\nfor i in range(1,n+1):\r\n lst.append(l.index(i)+1)\r\nlst = [str(s) for s in lst]\r\nst = ' '.join(lst)\r\nprint(st)", "n=int(input())\r\nf=list(map(int,input().split()))\r\np=[0]*n\r\nfor i in range(n):\r\n fr=f[i]\r\n p[fr-1]=i+1\r\nprint(\" \".join(map(str,p))) ", "n=int(input())\r\nx=[int(x) for x in input().split()]\r\nd={}\r\nfor i in range(n):\r\n d[x[i]]=i+1\r\nfor i in range(n):\r\n print(d[i+1],end=\" \")\r\n", "# The first input is the number of friends invited to the party.\r\n\r\n# The second input has integers.\r\n# The i-th number is Pi.\r\n# Pi is the number of a friend who gave a gift to friend number i.\r\n\r\n# P: 2 3 4 1\r\n# i: 1 2 3 4\r\n# 0: 0 1 2 3\r\n\r\n# o: 4 1 2 3\r\n\r\ninput1 = input()\r\n\r\nstartingOrder = input()\r\nstartingOrder = startingOrder.split()\r\n\r\nendingOrder = [\"\"]*int(input1)\r\n\r\nfor i in range (int(input1)):\r\n numberValue = i + 1\r\n indexNumber = int(startingOrder[i])\r\n indexNumber -= 1\r\n # the output will assign the numberValue to the indexNumber\r\n \r\n endingOrder[indexNumber] = str(numberValue)\r\n\r\noutput = \" \".join(endingOrder) \r\n\r\nprint(output)", "n=int(input())\r\nstr_1=input().split()\r\nfor i in range(n):\r\n a=int(str_1.index(str(i + 1))) + 1\r\n if i!=n-1:\r\n print(a,end=\" \")\r\n else:\r\n print(a)", "n = int(input())\r\ns = list(map(int, input().split()))\r\nfriends = [0 for i in range(n)]\r\nfor i in range(n):\r\n friends[s[i] - 1] = i + 1\r\nprint(*friends)\r\n", "n = int(input())\r\n\r\ngive = list(map(int,input().split()))\r\nrecived = {} # 딕셔너리\r\np = ''\r\n\r\nfor x in range(n):\r\n recived[give[x]] = (x+1)\r\n\r\nfor y in range(1,n+1):\r\n p += str(recived[y])\r\n p += ' '\r\n\r\nprint(p.rstrip())\r\n", "a=int(input())\r\nb=list(map(int,input().split()))\r\nfor i in range(1,a+1):\r\n print(b.index(i)+1,end=' ')", "def i():\r\n return(int(input()))\r\ndef l():\r\n return(list(map(int,input().split())))\r\ndef s():\r\n s = input()\r\n return(s)\r\ndef sl():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef m():\r\n return(map(int,input().split()))\r\n\r\n\r\nn = i()\r\na = l()\r\nd = {}\r\nfor i in range(n):\r\n d[a[i]] = i + 1\r\n \r\no = []\r\nfor i in range(n):\r\n o.append(d[i + 1])\r\nprint(*o, sep=' ')\r\n ", "def findGiftGivers(n, gifts):\r\n givers = [0] * n # Initialize a list to store the givers\r\n\r\n for i in range(n):\r\n givers[gifts[i] - 1] = i + 1 # Set the giver for friend i as i + 1\r\n\r\n return givers\r\n\r\n# Read the number of friends from input\r\nn = int(input().strip())\r\n\r\n# Read the gift information from input\r\ngifts = list(map(int, input().strip().split()))\r\n\r\n# Call the function and print the result\r\nresult = findGiftGivers(n, gifts)\r\nprint(' '.join(map(str, result)))\r\n", "# Read the number of friends\nn = int(input())\n\n# Read the list of gift givers\np = list(map(int, input().split()))\n\n# Initialize an empty list for gift receivers\nr = [0] * n\n\n# Loop through the gift givers and assign the corresponding gift receivers\nfor i in range(n):\n # The gift giver is p[i] and the gift receiver is i + 1\n # We subtract 1 from p[i] to match the list index\n r[p[i] - 1] = i + 1\n\n# Print the list of gift receivers as space-separated integers\nprint(*r)\n\t \t\t \t\t \t \t\t\t\t\t \t \t\t\t\t \t\t", "n = int(input())\r\npis = list(map(int,input().split()))\r\n\r\ni_gevin = []\r\n\r\nfor i in range(1,n + 1) :\r\n p = 0\r\n for j in pis:\r\n p += 1\r\n if i == j :\r\n print(p ,end = ' ')\r\n\r\n \r\n", "def main():\r\n n=int(input())\r\n s=input().split()\r\n for i in range(n):\r\n print(s.index(str(i+1))+1, end=\" \")\r\nif __name__==\"__main__\":\r\n main()", "n = int(input()) # Number of friends\ngift_giver = list(map(int, input().split())) # Array containing the gift-giver for each friend\n\n# Initialize an array to store the result\nresult = [0] * n\n\n# Fill the result array based on the gift-giver information\nfor i in range(n):\n result[gift_giver[i] - 1] = i + 1\n\n# Print the result\nprint(' '.join(map(str, result)))\n", "no_of_friends = int(input())\r\n\r\ngiven_gifts_to = list(map(int, input().split()))\r\n\r\nreceived_gifts_from = [None for _ in range(no_of_friends)]\r\n\r\nfor idx, receiver_idx in enumerate(given_gifts_to):\r\n\treceived_gifts_from[receiver_idx-1] = str(idx + 1)\r\n\r\n\r\nprint(' '.join(received_gifts_from))", "n = int(input())\r\np = list(map(int,input().split()))\r\na = []\r\ni = 0\r\nwhile len(a) != len(p) :\r\n for n in range(len(p)):\r\n if p[n] == i+1 :\r\n a.append(n + 1)\r\n break\r\n i += 1\r\nprint(*a)\r\n", "n = input()\r\n\r\n\r\ndef solve(arr):\r\n indices = []\r\n\r\n for i in range(len(arr)):\r\n indices.append(arr.index(min(arr)) + 1)\r\n arr[arr.index(min(arr))] = float('inf')\r\n\r\n return indices\r\n\r\n\r\nprint(*solve(list(map(int, input().split()))))\r\n", "a = int(input())\r\nb = list(map(int,input().split()))\r\nh = []\r\nfor i in range(1,a + 1):\r\n f = b.index(i) + 1\r\n h.append(str(f))\r\nprint(' '.join(h))", "def find_gift_givers(n, gifts):\r\n \r\n gift_giver = [0] * n\r\n\r\n for i in range(n):\r\n gift_giver[gifts[i] - 1] = i + 1\r\n\r\n return gift_giver\r\n\r\nn = int(input().strip())\r\ngifts = list(map(int, input().split()))\r\n\r\n\r\ngift_giver = find_gift_givers(n, gifts)\r\nprint(*gift_giver)\r\n", "# your code goes here\r\nn=int(input())\r\na=list(map(int,input().split()))\r\n# print(a)\r\nx=[0]*(n)\r\n# print(x)\r\nfor i in range(1,n+1):\r\n\tx[a[i-1]-1]=i\r\nprint(*x)", "n = int(input())\r\np = list(map(int, input().split()))\r\n\r\nresult = [0] * n # initialize result list with zeros\r\n\r\nfor i in range(n):\r\n result[p[i] - 1] = i + 1 # set the value at index p[i] - 1 to i + 1\r\n\r\nprint(*result) # print result list using the * operator to unpack its values\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nk=[]\r\nfor i in range(n):\r\n k.append(0)\r\nfor i in range(0,n):\r\n k[l[i]-1]=i+1\r\nfor i in k:\r\n print(i,end=\" \")", "a , b = int(input()) , input().split(' ') \r\ns=[0]*a\r\nfor i in range(a):\r\n s[int(b[i])-1]=i+1\r\nprint(*s)\r\n ", "n = input()\narray = [*map(int,input().split())]\nresult = []\n\nfor i,element in enumerate(array):\n print(array.index(i + 1) + 1,end= ' ')", "n = int(input())\r\nit = []\r\nfor _ in range(n):\r\n it.append(0)\r\nx = input().split()\r\nfor i in range(n):\r\n tek = int(x[i])\r\n it[tek-1] = i + 1\r\nprint(*it)", "n=int(input())\r\nnumbers = list(map(int,input().split(' ')))\r\nfriends_from=[]\r\ni=0\r\nfriends_from = [0 for x in range(n)]\r\nwhile i<n:\r\n friends_from[numbers[i]-1]=i+1\r\n i+=1\r\nprint(*friends_from)", "people = int(input())\r\npresents = input()\r\nlistpresents = [int(num) for num in presents.split()]\r\nanswer = []\r\ni = 1\r\nwhile i <= people:\r\n answer.append(listpresents.index(i)+1)\r\n answer.append(' ')\r\n i += 1\r\nfinal = ''.join(str(x) for x in answer)\r\nprint(final)", "n = int(input())\r\ngift_givers = list(map(int, input().split()))\r\n\r\ngift_receivers = [0] * n # Initialize an array to store the gift receivers.\r\n\r\nfor i in range(n):\r\n gift_receivers[gift_givers[i] - 1] = i + 1 # Map the gift giver to the receiver.\r\n\r\n# Print the result as space-separated integers.\r\nprint(*gift_receivers)\r\n", "n=int(input())\na=list(map(int,input().split()))\nb=[0 for i in range(n)]\nfor i in range(n):\n b[a[i]-1]=i+1\nprint(*b)", "n = int(input())\r\na=list(map(int,input().split()))\r\ng=[0]*n\r\nfor i in range(n):\r\n g[a[i]-1]=i+1\r\nprint(*g)\r\n\r\n", "n=int(input())\r\nl=list(map(int,input().split()))[:n]\r\nl1=[]\r\nj=0\r\nfor i in range(1,len(l)+1):\r\n l1.append(l.index(i)+1)\r\n \r\nprint(*l1,end=' ')", "n = int(input())\r\nnums = list(map(int, input().split()))\r\nMap = {}\r\nfor i in range(n):\r\n Map.update({i + 1: nums[i]})\r\ntoPrint = dict(sorted(Map.items(), key=lambda it: it[1]))\r\nfor k in toPrint.keys():\r\n print(k,end=' ')\r\nprint()\r\n", "def main():\r\n n = int(input())\r\n l = list(map(int, input().split(' ')))\r\n new_l = l.copy()\r\n for index, item in enumerate(l):\r\n new_l[item - 1] = index + 1\r\n new_l = list(map(str, new_l))\r\n print(' '.join(new_l))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "# 136A - Presents\r\n\r\nn = int(input())\r\npresents = list(map(int, input().split(' ')))\r\npresent_order = [0] * n\r\n\r\n\r\nfor i in range(n):\r\n present_order[ presents[i] - 1 ] = i + 1\r\n\r\nfor i in range(n):\r\n print(present_order[i], end=' ')\r\nprint('')", "t = int(input())\r\nx = list(map(int, input().split()))\r\nfor i in range(1,t+1):\r\n print(x.index(i)+1, end=' ')", "n=int(input())\r\na=map(int,input().split())\r\nb={}\r\nfor i,v in enumerate(a):\r\n b[v]=i+1\r\nfor i in range(n):\r\n print(b[i+1])", "n=int(input())\r\ng=list(map(int,input().split()))\r\nwgg=[0]*n\r\nfor i in range(n):\r\n wgg[g[i]-1]=i+1\r\nprint(*wgg)", "num_of_friends = int(input())\r\np_of_i = list(map(int,input().split()))\r\nmylist = []\r\nsalah = []\r\nfor i in range(num_of_friends):\r\n mylist.append(i + 1)\r\nfor y in range(len(p_of_i)):\r\n x = mylist[y]\r\n s = p_of_i.index(x)\r\n salah.append(mylist[s])\r\nfor r in salah :\r\n print(r,end=\" \") \r\n ", "def main():\n\n n = int(input())\n gifts = map(int, input().split())\n\n presents = dict()\n for r, g in enumerate(gifts, start=1):\n presents[g] = r\n\n for r in sorted(presents.keys()):\n print(presents[r], end=' ')\n print()\n\n\n\nif __name__ == '__main__':\n main()\n", "a=int(input())\r\nx=list(map(int,input().split()))\r\nz=[]\r\nfor i in range(a):\r\n for j in range(a):\r\n if i+1==x[j]:\r\n z.append(j+1)\r\nprint(*z)", "n=int(input())\r\nz=n\r\ns=list(input().split())\r\nind=0\r\nx=[]\r\nwhile n!=0 :\r\n mini=int(s[0])\r\n ind=1\r\n for i in range (len(s)):\r\n if int(s[i])<mini:\r\n mini=int(s[i])\r\n ind=i+1\r\n s[ind-1]=str(z+1);\r\n x.append(str(ind))\r\n n=n-1\r\nprint(*x)", "n = int(input())\r\n\r\nfriends_num = input()\r\nl_f_n = friends_num.split()\r\n\r\ni = 0\r\nl = []\r\nwhile i<n:\r\n l.append(str(l_f_n.index(str(int(min(l_f_n))+i))+1))\r\n i+=1\r\n\r\ns = \" \".join(l)\r\n\r\nprint(s)", "n = int(input())\r\np = list(map(int,input().split()))\r\nprint(*[p.index(i+1)+1 for i in range(n)])", "n = int(input())\r\npresents = list(map(int, input().split()))\r\nres = [0] * n\r\n\r\nfor i in range(n):\r\n res[presents[i]-1] = i+1\r\n\r\nprint(*res)", "a = int(input())\r\ninputs = input().split()\r\nempty_list = [True]*a\r\nfor i in range(a):\r\n empty_list[int(inputs[i])-1] = str(inputs.index(inputs[i])+1)\r\nprint(\" \".join(empty_list))", "n = int(input())\r\ns = input().split()\r\nans = []\r\n\r\nfor i in range(n):\r\n ans.append(str(s.index(str(i+1))+1))\r\n\r\nprint(\" \".join(ans))\r\n", "w = int(input())\r\nx = input().split(\" \")\r\ns = []\r\nt = 0\r\nm = \"\"\r\nfor i in range(w):\r\n s.append(t)\r\n t += 1\r\nt = 0\r\nfor j in range(len(x)):\r\n s[int(x[j]) - 1] = j + 1\r\n t += 1\r\nfor n in s:\r\n m = m + str(n) + \" \"\r\nprint(m)", "# Presents Difficulty:800\r\nn = int(input())\r\nreceive = list(map(int, input().split()))\r\ngive = [0]*n\r\nfor j in range(n):\r\n i = j\r\n p = receive[j]\r\n give[p-1] = i + 1\r\nfor k in range(n):\r\n print(give[k], end=' ')\r\n", "n = int(input())\r\ns = list(map(int, input().split(' ')))\r\n\r\nres = []\r\nfor i in range(n):\r\n for j in range(len(s)):\r\n if s[j] == i + 1:\r\n res.append(j + 1)\r\n\r\nanswer = ''\r\nfor i in range(len(res)):\r\n answer += str(res[i]) + ' '\r\n\r\nprint(answer.strip())", "# Read input\r\nn = int(input())\r\ngivers = list(map(int, input().split()))\r\n\r\n# Initialize an array to store the answers\r\nreceivers = [0] * n\r\n\r\n# Iterate through each friend to find the giver\r\nfor i in range(n):\r\n giver = givers[i] - 1 # Subtract 1 to convert to 0-based indexing\r\n receivers[giver] = i + 1 # Add 1 to convert back to 1-based indexing\r\n\r\n# Print the result\r\nprint(*receivers)\r\n", "def main(): \r\n n,*a=map(int, open(0).read().split())\r\n arr = [0]*n\r\n for i in range(n):\r\n x = a[i] - 1\r\n arr[x] = i + 1\r\n print(*arr)\r\nmain()", "N = int(input())\r\nGift = list(map(int, input().split()))\r\nReceiver = [0] * N\r\nfor i in range(N):Receiver[Gift[i] - 1] = i + 1\r\nprint(*Receiver)", "n = int(input())\nnum_list = list(map(int, input().split()))\nli = [0]*n\n\nfor position,value in enumerate(num_list):\n li[value-1] = position+1\n\nfor i in li:\n print(i, end=\" \")\n \t\t \t \t\t \t \t \t \t \t\t \t \t\t", "n = int(input())\r\nfriends = list(map(int, input().split()))\r\n\r\nind = {i-1: j+1 for j, i in enumerate(friends)}\r\nl = [0 for _ in range(n)]\r\n\r\nfor i in ind:\r\n l[i] = ind[i]\r\n \r\nprint(*l)", "n=int(input())\r\nnums=list(map(int,input().split()))\r\nfor i in range(1,n+1):\r\n print(nums.index(i)+1,end=\" \")", "n = int(input())\r\na = list(map(int,input().split()))\r\nna = [0]*n\r\n\r\nfor i in range(n):\r\n na[a[i]-1] = i+1\r\n\r\nprint(*na)\r\n", "n = int(input())\r\ngifts = list(map(int, input().split()))\r\n\r\nfor i in range(1, n+1):\r\n j = gifts.index(i) + 1\r\n print(j, end=' ')\r\n", "import sys \r\nn=int(sys.stdin.readline().split()[0])\r\nf=[]\r\nfor line in sys.stdin:\r\n for word in line.split():\r\n f.append(int(word))\r\nfr=[0 for x in range(n)]\r\ni = 0\r\nwhile i<n:\r\n fr[f[i] - 1] = i + 1\r\n i +=1\r\nprint(*fr)\r\n ", "n=int(input())\r\na=list(map(int,input().split()))\r\nr=[0]*n\r\nfor i in range(n):\r\n r[a[i]-1]=i+1\r\nprint(*r)", "length=int(input())\r\ncase=input()\r\ncaseLst=list(map(int,case.split()))\r\nresult=list(map(int,case.split()))\r\nfor i in range(0,length):\r\n\ttemp=caseLst[i]\r\n\tresult[temp-1]=str(i+1)\r\nprint(\" \".join(result))\r\n\t", "import sys\r\nn=int(input())\r\ncits=list(map(int,input().split()))\r\nsol=[]\r\ns=\"\"\r\nfor i in range(n):\r\n if i+1 in cits:\r\n s+=str(cits.index(i+1)+1)\r\n if(i+1<n):\r\n s+=\" \"\r\nprint(s)\r\n\r\n", "def find_gift_givers(n, friends):\r\n gift_givers = [0] * n # Initialize a list to store the gift givers\r\n\r\n # Iterate over the friends and assign the gift givers\r\n for i in range(n):\r\n gift_givers[friends[i] - 1] = i + 1\r\n\r\n return gift_givers\r\n\r\n# Read the number of friends from the input\r\nn = int(input())\r\n\r\n# Read the gift information from the input\r\nfriends = list(map(int, input().split()))\r\n\r\n# Call the function to find the gift givers\r\nresult = find_gift_givers(n, friends)\r\n\r\n# Print the result\r\nprint(' '.join(map(str, result)))\r\n", "import operator\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\nm = {}\r\nfor i in range(1, n+1):\r\n m[i] = l[i-1]\r\nm = sorted(m.items(), key=operator.itemgetter(1))\r\nfor i in m:\r\n print(i[0], end=\" \")\r\n", "num=int(input())\r\nle=list(map(int,input().split()))\r\nb={}\r\nfor i in range(num):\r\n b[le[i]]=i+1\r\nfor i in range(1,num+1):\r\n print(b[i],end=\" \")\r\n", "n = int(input())\r\nfriends = [int(i) for i in input().split()]\r\n\r\nans = [0]*n\r\nfor i in range(len(friends)):\r\n ans[friends[i] - 1] = str(i + 1)\r\n\r\nprint(\" \".join(ans))", "n = int(input())\r\nli = list(map(int, input().split()))\r\n\r\nl = []\r\n\r\nfor i in range(n):\r\n l.append(li.index(min(li))+1)\r\n li[li.index(min(li))] = li[li.index(max(li))] +1\r\nprint(*l)", "import sys\r\nn=int(sys.stdin.readline().split()[0])\r\n\r\nfriends=[]\r\n\r\nfor line in sys.stdin:\r\n for word in line.split():\r\n friends.append(int(word))\r\n\r\nfr_from=[0 for _ in range(n)]\r\n\r\ni=0\r\n\r\nwhile i<n:\r\n fr_from[friends[i]-1]=i+1\r\n i+=1\r\nprint(*fr_from)", "def s(n, gift_receivers):\r\n gifts = {}\r\n for i, receiver in enumerate(gift_receivers, start=1):\r\n gifts[receiver] = i\r\n\r\n return [gifts[i] for i in range(1, n + 1)]\r\n\r\nn = int(input())\r\ngift_receivers = list(map(int, input().split()))\r\n\r\nprint(*s(n, gift_receivers))", "n = int(input())\r\ngave_to = list(map(int, input().split()))\r\n\r\nfor i in range(1, n+1):\r\n giver = gave_to.index(i) + 1\r\n print(giver, end=' ')\r\n", "n = int(input())\na = input().split()\nfor i in range(n):\n print(a.index(str(i+1))+1)\n", "n = int(input())\r\na = [0] * n\r\ns=[int(x) for x in input().split()]\r\n\r\nfor i in range(1, n+1):\r\n temp = s[i-1]\r\n a[temp-1] = i\r\nfor i in range(n):\r\n print(a[i], end=\" \")\r\n", "n = int(input())\r\ngifts = list(map(int, input().split()))\r\n\r\nfor i in range(1, n + 1):\r\n currentFriend = i\r\n while gifts[currentFriend - 1] != i:\r\n currentFriend = gifts[currentFriend - 1]\r\n print(currentFriend, end=\" \")\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nfor i in range(n):\r\n print(l.index(i+1)+1)", "n=int(input())\r\nlst=list(map(int,input().split()))\r\n\r\nfor i in range(n):\r\n b=lst.index(i+1)\r\n print(b+1,end=' ')", "n=int(input())\r\nd={}\r\nl=[int(i) for i in input().split()]\r\nfor i in range(n):\r\n d[l[i]]=i+1\r\nfor j in range(1,n+1):\r\n print(d[j],end=' ')", "n = int(input())\r\nf = list(enumerate(map(int, input().split(\" \"))))\r\nf.sort(key=lambda x: x[1])\r\nfor i in f:\r\n print(i[0]+1, end=\" \")\r\n", "from collections import defaultdict\r\nn = int(input())\r\np = list(map(int, input().split()))\r\n\r\n#[2,3,4,1]\r\nans = [0] * n\r\nfor i,v in enumerate(p):\r\n ans[v-1] = i+1\r\n\r\ns = \"\"\r\nfor i in ans:\r\n s += str(i) + \" \"\r\nprint(s)", "n = int(input())\r\np = list(map(int, input().split()))\r\ntemp=[]\r\nresult=[]\r\nfor i in range(n):\r\n if i not in temp:\r\n q=p.index(i+1)\r\n print(q+1,end=\" \")", "x=int(input())\r\ny=list(map(int,input().split()))\r\nfor a in range(x):\r\n print(y.index(a+1)+1,end=(\" \"))", "b = int(input())\r\nl = list(map(int,input().split()))\r\nc = [0] * b\r\nfor i in range(0,b):\r\n c[l[i]-1] = i+1\r\nprint(\" \".join([str(x) for x in c]))", "def main():\r\n n = int(input())\r\n gift_to_friend = list(map(int, input().split()))\r\n \r\n for i in range(n):\r\n print(gift_to_friend.index(i + 1) + 1)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n=int(input())\r\na=list(map(int,input().split()))\r\nb = [0]*n\r\nfor i in range(n):\r\n b[a[i]-1]=i+1\r\ns=''\r\nfor i in b:\r\n s=s+str(i)+' '\r\nprint(s)", "n = int(input())\r\nf = {}\r\nc=1\r\nl=list(map(int,input().split()))\r\nfor p in l:\r\n f[p] = c\r\n c+=1\r\n\r\nfor i in range(1, n+1):\r\n print(f[i], end=' ')", "while True:\r\n try:\r\n n=int(input())\r\n gift_list=list(map(int,input().split()))\r\n result=[0]*n\r\n for i in range(n):\r\n result[gift_list[i]-1]=i+1 \r\n #print the array\r\n print(*result)\r\n except:\r\n break", "n=int(input())\r\n\r\na=[int(v) for v in input().split()]\r\nans=[]\r\nfor j in range(n):\r\n ind=a.index(j+1)\r\n ans.append(ind+1)\r\nprint(*ans)\r\n", "from sys import stdin\r\n\r\n\r\ndef solve():\r\n n = int(stdin.readline())\r\n A = [int(x) for x in stdin.readline().split()]\r\n\r\n items = [(a, i) for i, a in enumerate(A, 1)]\r\n items.sort()\r\n\r\n print(*[x for _, x in items])\r\n\r\n\r\nsolve()\r\n", "x=int(input());a=input().split();print(*[a.index(str(i+1))+1for i in range(x)])\n \t\t\t \t \t\t\t \t\t\t \t\t \t \t \t", "n = int(input())\r\nrecieve = list(map(int,input().split()))\r\ngive = []\r\nfor i in range(1,n+1):\r\n give.append(recieve.index(i)+1)\r\n\r\nprint(*give)", "n = int(input())\r\na = list(map(int, input().split()))\r\nl = [0] * len(a)\r\n\r\nfor i in range(1, n + 1):\r\n l[i - 1] = str(a.index(i) + 1)\r\nprint(' '.join(l)) \r\n", "n=int(input())\r\ni=0\r\nread=input().split()\r\nfor i in range(len(read)):\r\n read[i]=int(read[i])\r\ni=0\r\narr=[]\r\nfor i in range(0, n):\r\n arr.append(0)\r\ni=0\r\nfor i in range(len(read)):\r\n arr[read[i]-1]=i+1\r\ni=0\r\nfor i in range(len(arr)):\r\n print(arr[i], end=\" \")\r\n", "n = int(input())\r\n\r\n\r\n\r\nV = list(map(int,input().split()))\r\n\r\nG = [0]*n;\r\n\r\nfor i in range(n):\r\n G[V[i]-1] = i+1\r\n\r\nK = \"\"\r\nfor j in range(n):\r\n K += str(G[j]) + \" \"\r\n \r\nprint(K) ", "# Read the number of friends\r\nn = int(input())\r\n\r\n# Read the gift-giving information\r\ngifts_given = list(map(int, input().split()))\r\n\r\n# Create an array to store the answer\r\ngifts = [0] * n\r\n\r\n# Assign the gift giver for each friend\r\nfor i in range(n):\r\n gifts[gifts_given[i] - 1] = i + 1\r\n\r\n# Print the result\r\nprint(*gifts)\r\n", "n = int(input())\r\npi = list(map(int,input().split()))\r\nfor i in range(1,len(pi)+1):\r\n print(pi.index(i)+1,end=\" \")", "no_of_coins = int(input())\r\ncoins = list(map(int, input().split(\" \")))\r\n\r\n\r\n\r\nfor i in range(len(coins)):\r\n print(coins.index(i+1) + 1, end = \" \")", "n = int(input())\r\ngift = list(map(int, input().split()))\r\nreceived = [0]*n\r\nfor i in range(n):\r\n received[gift[i]-1] = i+1\r\nprint(*received)", "a=int(input())\r\nb=input().split()\r\nq=[]\r\nfor i in range(1,a+1):\r\n q.append(b.index(str(i))+1)\r\nprint(*q)", "dct = {}\r\nval = 1\r\narr = []\r\nn = int(input())\r\nfrnd = [int(i) for i in input().split()]\r\nfor i in frnd:\r\n dct[i] = val\r\n val+=1\r\nfor i in range(1,n+1):\r\n arr.append(str(dct[i]))\r\nprint(\" \".join(arr))", "n=int(input())\r\n\r\nmylist=list(map(int,input().split()))\r\n\r\nans=[0]*n\r\nfor i in range(n):\r\n ans[mylist[i]-1]=i+1\r\n\r\n\r\nfor i in ans:\r\n print(i,end=\" \")\r\n", "n = int(input())\r\narr = list(map(int, input().split(' ')))\r\nd = {}\r\nfor i in range(n):\r\n d[arr[i]] = i+1\r\nresult = []\r\nfor i in range(n):\r\n result.append(str(d[i+1]))\r\nprint(\" \".join(result))", "c=int(input())\r\np=input()\r\np1=p.split(' ')\r\npi=[]\r\nfor i in range(len(p1)):\r\n pi.append(int(p1[i]))\r\n\r\nsi=[]\r\nfor i in range(1,c+1):\r\n si.append(pi.index(i)+1)\r\nprint(' '.join(map(str, si)))", "a=int(input());b=input().split();print(*[b.index(str(i+1))+1for i in range(a)])", "def solve(arr,n):\r\n narr=[0]*n\r\n for i in range(1,n+1):\r\n narr[arr[i-1]-1]=i\r\n \r\n print(*narr)\r\n\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\nsolve(arr,n)", "n = int(input())\r\narr = list(map(int, input().split()))\r\nans = [0]*n\r\n\r\nfor i in range(len(arr)): ans[arr[i]-1] = i+1\r\nprint(*ans)", "n = int(input())\r\ngifts = input().split()\r\nres = [0 for i in range(n)]\r\ngifts = [int(i) for i in gifts]\r\ni = 1\r\nfor j in gifts:\r\n res[j - 1] = i\r\n i += 1\r\nprint(' '.join([str(elem) for elem in res]))", "def find_gift_givers(n, friends):\r\n gift_givers = [0] * n # Initialize the gift givers array/list\r\n\r\n for i in range(n):\r\n gift_givers[i] = friends.index(i + 1) + 1 # Find the giver's friend number\r\n\r\n return gift_givers\r\n\r\n# Read input\r\nn = int(input())\r\nfriends = list(map(int, input().split()))\r\n\r\n# Find the gift givers\r\nresult = find_gift_givers(n, friends)\r\n\r\n# Print the gift givers\r\nprint(*result)\r\n\r\n", "if __name__ == \"__main__\":\r\n num = int(input())\r\n presents = list(input().split())\r\n answer = []\r\n for i in range(1, num+1):\r\n answer.append(str(presents.index(str(i))+1)\r\n )\r\n print(' '.join(answer))", "n = int(input().strip())\r\np = list(map(int, input().strip().split()))\r\nq = [0]*n\r\nfor i in range(n):\r\n q[p[i]-1] = i+1\r\nprint(*q)\r\n", "def find_gift_givers(n, pi_list):\r\n gift_givers = [0] * n\r\n for i, pi in enumerate(pi_list, start=1):\r\n gift_givers[pi - 1] = i\r\n return gift_givers\r\n\r\n\r\nn = int(input())\r\npi_list = list(map(int, input().split()))\r\n\r\n\r\ngift_givers = find_gift_givers(n, pi_list)\r\nprint(*gift_givers)", "n = int(input())\n\nlista = list(map(int, input().split()))\n\nnewList = list()\n\nfor i in range(1,len(lista)+1):\n newList.append(lista.index(i) + 1)\n\nprint(*newList)", "n = int(input())\r\nt = [0] + list(map(int,input().split()))\r\nfor i in range(1,n+1):\r\n print(t.index(i),end=\" \")", "n = int(input())\r\na = input().split()\r\nfor i in range(n-1):\r\n print(str(a.index(str(i+1))+1),end=\" \")\r\nprint(str(a.index(str(n))+1))", "def gift_givers(n, gifts):\r\n gift_map = [0] * (n)\r\n for i in range(n):\r\n gift_map[gifts[i]-1] = i+1\r\n return gift_map\r\n\r\n# Example usage\r\nn = int(input())\r\ngifts = list(map(int, input().rstrip().split()))\r\ngift_map = gift_givers(n, gifts)\r\n\r\nprint(\" \".join(map(str, gift_map)))", "def accnums():\r\n return list(map(int, input().split()))\r\ndef accstr():\r\n return input()\r\ndef accnum():\r\n return int(input())\r\n\r\nn = accnum()\r\np = accnums()\r\nans = [0] * (n)\r\nfor i in range(n):\r\n ans[p[i] - 1] = i + 1\r\nprint(*ans)\r\n", "n = int(input())\r\nstring = input().split()\r\nfor i in range(n):\r\n print(string.index(str(i + 1)) + 1, end=' ')", "n = int(input())\r\np_arr = list(map(int, input().split()))\r\nresult = [0] * n\r\n\r\nfor i in range(0, n):\r\n result[p_arr[i] - 1] = i + 1\r\n\r\nprint(\" \".join(str(elem) for elem in result))\r\n", "k=int(input())\r\na=input().split()\r\nfor i in range(k):\r\n\tprint(a.index(str(i+1))+1,end=\" \")\r\n\r\n# n=int(input())\r\n# l=list(map(int,input().split()))\r\n# d={}\r\n# k=1\r\n# for i in l:\r\n# d[i]=k\r\n# k+=1\r\n# for i,j in d.items():\r\n# print(d[j],end=' ')", "d = {}\r\nn = int(input())\r\ns = input()\r\nfor i in range(1, n + 1):\r\n d[i] = int(s.split()[i-1]) \r\nsorte_touple = sorted(d.items(), key=lambda x:x[1])\r\nd = dict(sorte_touple)\r\nfor key in d:\r\n print(key)", "n = int(input())\r\nmas = list(map(int, input().split()))\r\nnew_mas = [0 for i in range(len(mas))]\r\nfor i in range(len(mas)):\r\n new_mas[mas[i] - 1] = i + 1\r\n\r\n\r\nfor i in new_mas:\r\n print(i, end = ' ')", "n = int(input())\r\nnums = list(map(int, input().split()))\r\nret = [-1]*(len(nums)+1)\r\nfor i in range(len(nums)):\r\n pi = nums[i]\r\n ret[pi] = i+1\r\nprint(*ret[1:])", "q = []\r\na = {}\r\nl = ''\r\nb = int(input())\r\nn = 1\r\nm = list(map(int,input().split()))\r\nfor i in m:\r\n a[i-1] = n\r\n q.append(i-1)\r\nfor j in a.keys():\r\n q[j] = n \r\n n += 1\r\nprint(' '.join(map(str,q)))", "t=int(input())\r\nn=list(map(int,input().split()))\r\na=[0]*t\r\nfor i in range(t):\r\n a[n[i]-1]=i+1\r\nprint(' '.join(map(str,a)))", "# Read the number of friends\r\nn = int(input())\r\n\r\n# Read the list of friends who gave gifts\r\ngifts = list(map(int, input().split()))\r\n\r\n# Initialize a list to store the result\r\ngivers = [0] * n\r\n\r\n# Fill in the list of givers\r\nfor i, recipient in enumerate(gifts):\r\n givers[recipient - 1] = i + 1\r\n\r\n# Print the list of givers\r\nprint(*givers)\r\n", "n = int(input())\r\npi = list(map(int, input().split()))\r\ncount = 1\r\norder = []\r\n\r\nwhile len(order) != len(pi):\r\n for idx, val in enumerate(pi, start=1):\r\n if val == count:\r\n order.append(str((idx)))\r\n count += 1\r\n \r\nprint(' '.join(order))\r\n ", "n = int(input())\r\nl = [int(i) for i in input().split()]\r\nd = {}\r\nfor i in range(n):\r\n d[i+1] = l[i]\r\nd2 = {}\r\nfor k,v in d.items():\r\n d2[v] = k\r\nfor i in range(n):\r\n print(d2[i+1],end=\" \")", "n = int(input())\ns = list(map(int, input().split()))\nq = ''\nfor i, p in enumerate(s):\n q += str(s.index(i+1)+1)\n q += ' '\n \nprint(q.strip())", "x = int(input())\r\narr = list(map(int, input().split()))\r\nans = [0]*x\r\nfor i in range(x):\r\n ans[arr[i]-1] = i+1\r\nprint(*ans)", "n = int(input())\r\narr = list(map(int, input().split()))\r\nmap = {}\r\nfor i in range(len(arr)):\r\n map[arr[i]] = i+1\r\nfor i in range(len(arr)):\r\n print(map[i+1], end=' ')", "x = int(input())\r\narr = [int(i) for i in input().split()]\r\nsol = [True for i in range(x)]\r\nfor i in range(x):\r\n sol[arr[i]-1] = i+1\r\nsol = [str(i) for i in sol]\r\nprint(\" \".join(sol))", "n=int(input())\r\na=[i for i in range(1,n+1)]\r\nb=list(map(int,input().split()))\r\nd=[]\r\nfor i in range(n):\r\n guest,pod=a[i],b[i]\r\n d=d+[(pod,guest)]\r\nd.sort()\r\nd=dict(d)\r\nprint(*d.values())\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nb = [0] * n\r\nfor j in range (n):\r\n s = j \r\n j = a[j]-1\r\n b[j] = s+1 \r\nprint(*b) \r\n", "n = int(input())\r\nreceived=list(map(int, input().split()))\r\ngiven = [0]*n\r\nfor i in range(n):\r\n\tgiven[received[i]-1]=i+1\r\nprint(*given)\r\n\t", "n=int(input())\r\nlst=list(map(int,input().split()))\r\nx=\"\"\r\nfor i in range(1,n+1):\r\n x=(lst.index(i)+1)\r\n print(x,end=\" \")\r\n", "num = int(input())\r\n\r\npresents = [int(x) for x in input().split()]\r\nresult_index = list()\r\nresult = list('' for i in range(num))\r\n\r\nfor i in range(num):\r\n result_index.append(presents[i]-1)\r\nfor j in range(num):\r\n result[result_index[j]] = j+1\r\nfor x in range(len(result)):\r\n print(result[x],end=' ')", "def find_gift_givers(n, pi):\r\n gift_to = [0] * n\r\n for i in range(n):\r\n gift_to[pi[i] - 1] = i + 1\r\n return gift_to\r\n\r\n# Input reading\r\nn = int(input())\r\npi = list(map(int, input().split()))\r\n\r\n# Calculate and output the friend numbers who gave gifts\r\nresult = find_gift_givers(n, pi)\r\nprint(*result)\r\n", "n=int(input())\r\n\r\narr=list(map(int,input().split()))\r\n\r\ntemp=list(range(1,n+1))\r\n\r\ntemp2={}\r\nfor i in range(n):\r\n \r\n temp2[arr[i]]=temp[i]\r\n \r\nfor i in range(1,n+1):\r\n print(temp2[i],end=\" \")\r\n \r\n \r\n", "n=int(input())\r\np=[int(i) for i in input().split()]\r\nb=[]\r\nfor i in range(n):\r\n b.append(p.index(i+1)+1)\r\nprint(*b)\r\n", "input()\r\nvalues = list(map(int, input().split()))\r\n\r\nres = [i*0 for i in range(len(values))]\r\n\r\nfor val in values:\r\n temp = values[val-1]\r\n res[temp-1]=val\r\n\r\nprint(' '.join(map(str, res)))", "def Present(n, p, dic):\r\n \r\n res = []\r\n for i, pi in enumerate(p):\r\n dic[pi] = i + 1\r\n for i in range(n):\r\n res.append(str(dic[i+1]))\r\n \r\n return ' '.join(res)\r\n\r\n\r\nn, p, dic= int(input()), map(int, input().split()), {}\r\nprint(Present(n, p, dic))", "n=int(input())\r\nl=[]\r\ng=[]\r\nh=[]\r\na=list(map(int,input().split()))\r\nfor i in a:\r\n l.append(i)\r\n\r\nfor i in range(len(a)):\r\n d=min(a)\r\n s=l.index(d)\r\n a.remove(d)\r\n g.append(s)\r\n\r\nfor i in range(len(g)):\r\n h.append(g[i]+1)\r\n\r\nprint(*h,sep=' ')", "a = input()\r\nb = input()\r\ncount = 0\r\nnum = \"\"\r\nstring = \"\"\r\np = -1\r\nno = [0] * int(a)\r\nwhile count < len(b):\r\n if b[count] != \" \":\r\n num = num + b[count] \r\n else:\r\n p += 1\r\n no[int(num) - 1] = p + 1\r\n num = \"\"\r\n count += 1\r\np += 1\r\nno[int(num) - 1] = p + 1\r\nfor c in range(0, int(a), 1):\r\n string = string + \" \" + str(no[c])\r\nprint(string[1:])\r\n", "n=int(input())\r\nx = input().split(' ')\r\nm = []\r\nfor i in range(n):\r\n a=x.index(str(i+1))\r\n m.append(a+1)\r\nfor j in m:\r\n print(j, end=' ')", "n=int(input())\r\n# gift={}\r\n\r\n# for i in range(1,n+1):\r\n# gift[i]=\r\nlst=list(map(int, input().split()))\r\nfor i in range(1,n+1):\r\n j=lst.index(i)\r\n print(j+1,end=\" \")\r\n", "n = int(input())\r\nout = [0]*n\r\narr = list(map(int,input().split()))\r\nfor i in range(n): out[arr[i]-1] = i+1\r\nprint(str(out)[1:-1].replace(',',''))", "n = int(input())\r\ngifts = list(map(int, input().split()))\r\ngivers = [0]*n\r\nfor i in range(n):\r\n givers[gifts[i]-1] = i+1\r\nprint(*givers)\r\n\r\n\r\n", "import sys \r\n\r\nn = int(sys.stdin.readline().split()[0])\r\n\r\nfriends_to = []\r\n\r\nfor line in sys.stdin:\r\n\tfor word in line.split():\r\n\t\tfriends_to.append(int(word))\r\n\r\nfriends_from = [0 for x in range(n)]\r\n\r\ni = 0\r\n\r\nwhile i < n:\r\n\tfriends_from[friends_to[i] - 1] = i + 1\r\n\ti += 1\r\n\r\nprint(*friends_from)", "n=int(input())\r\na=list(map(int,input().split()))\r\nj=[0 for _ in range(n)]\r\nfor i in range(n):j[a[i]-1]=i+1\r\nfor i in range(n-1):print(j[i],end=\" \")\r\nprint(j[-1])", "import sys\r\n\r\n\r\n\r\n\r\nnum_of_friends = input()\r\n\r\nps = input().split(\" \")\r\n\r\nres = [None for _ in range(int(num_of_friends))]\r\n\r\nfor index, element in enumerate(ps):\r\n res[int(element) -1] = index +1\r\n\r\n\r\n\r\nprint(*res)", "v=int(input());b=input().split();print(*[b.index(str(i+1))+1for i in range(v)])\r\n#hi codeforces\r\n#", "n = int(input())\r\ns = [int(x) for x in input().split()]\r\nl = n*[None]\r\nfor i in range(0,n):\r\n l[s[i]-1] =i + 1\r\nprint(*l)\r\n \r\n", "n = int(input())\r\nstring = input()\r\nls = []\r\nfor i in range(n):\r\n ls.append(0)\r\nfor i in range(1,n+1):\r\n ls[i-1] =(string.split().index(str(i)))+1\r\nfor i in range(n):\r\n print(ls[i],end=\" \")", "l = [input()] * 0 + [int(a) for a in input().split()]\r\nfor i in range (int(max(l))): print(l.index(i + 1) + 1, end = \" \")", "n=int(input())\r\nlis=list(map(int,input().split()))\r\nlis2=[0 for x in range(n)]\r\nfor i in range(n):\r\n lis2[lis[i]-1]=i+1\r\nfor i in range(n):\r\n print(lis2[i],end=\" \")", "import sys\r\n\r\ndef presents(num):\r\n inverse = [0] * len(num)\r\n\r\n for i, friend in enumerate(num, start = 1):\r\n inverse[friend - 1] = i\r\n \r\n return inverse\r\n\r\ndef main():\r\n n = int(sys.stdin.readline().strip())\r\n for _ in range(n):\r\n num = list(map(int, sys.stdin.readline().strip().split()))\r\n result = presents(num)\r\n \r\n if result:\r\n print(*result)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input()) # Number of friends\r\ngift_givers = list(map(int, input().split())) # List of gift givers\r\n\r\ngift_receivers = [0] * n # Initialize an array to store the gift receivers\r\n\r\nfor i in range(n):\r\n gift_receivers[gift_givers[i] - 1] = i + 1 # Indexing starts from 0, friend numbering starts from 1\r\n\r\nprint(\" \".join(map(str, gift_receivers)))\r\n", "n = int(input())\r\na = [int(x) for x in input().split(\" \")]\r\n\r\ns = \"\" \r\nfor i in range(1,n+1):\r\n s += str(a.index(i) + 1) + \" \"\r\n\r\nprint(s[:-1])", "a = int(input())\r\nl = [int(i) for i in input().split()]\r\nfor i in range(1, a+1):\r\n print(l.index(i)+1, end=\" \")\r\n", "n=input()\r\ni=[k for k in input().split()]\r\nl=[]\r\nfor j in range(len(i)):\r\n l.append(str(i.index(str(j+1))+1))\r\ns=\" \".join(l)\r\nprint (s)", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=[0]*n\r\nfor i in range(n):\r\n b[a[i]-1]=i+1\r\nprint(*b)", "n = int(input()) \r\ng_givers = list(map(int, input().split())) \r\nfor i in range(n):\r\n print(g_givers.index(i + 1) + 1, end=\" \")\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\nl1 = [i+1 for i in range(n)]\r\nz = list(zip(l1,l))\r\nz.sort(key = lambda x: x[1])\r\n\r\nfor i in z:\r\n print(i[0],end= ' ')", "n=int(input())\r\np=input().split()\r\nresult = []\r\nfor i in range(n):\r\n\tresult.append(p.index(str(i+1))+1)\r\nprint(*result)", "def main():\r\n from sys import stdin,stdout\r\n n=int(stdin.readline())\r\n l=list(map(int,stdin.readline().split()))\r\n p=[0 for _ in range(n)]\r\n for i in range(n):\r\n p[l[i]-1]=i+1\r\n stdout.write(' '.join(str(x) for x in p))\r\nif __name__=='__main__':\r\n main()\r\n ", "n = int(input())\r\npresents = list(map(int, input().split()))\r\nanswer = []\r\nstring = \"\"\r\nfor i in range(n):\r\n answer.append(presents.index(i + 1) + 1)\r\nfor j in range(n):\r\n string += str(answer[j])\r\n string += \" \"\r\nprint(string)", "n = int(input())\r\nto = [int(i) for i in input().split()]\r\nfr = [0]*n\r\nfor j in range(len(to)):\r\n fr[to[j]-1] = j + 1\r\nfor i in fr:\r\n print(i, end=' ')", "import sys\r\nnumb = int(sys.stdin.readline())\r\nlst = sys.stdin.readline().strip().split()\r\nansw = list(range(numb))\r\n#print(answ)\r\nfor i in range(numb):\r\n answ[int(lst[i])-1] = i + 1\r\n#print(answ)\r\na = ''\r\nfor i in answ:\r\n a += str(i)\r\n a += ' '\r\nprint(a)", "def find_gift_givers(n, p):\r\n result = [0] * n\r\n\r\n for i in range(n):\r\n result[p[i] - 1] = i + 1\r\n\r\n return result\r\n\r\n# Read input\r\nn = int(input())\r\np = list(map(int, input().split()))\r\n\r\n# Find gift givers\r\ngift_givers = find_gift_givers(n, p)\r\n\r\n# Print the result\r\nprint(*gift_givers)\r\n", "n = int(input()) # Number of friends\r\ngift_givers = list(map(int, input().split())) # List of gift givers\r\n\r\n# Initialize a list to store the gift givers for each friend\r\nresult = [0] * n\r\n\r\n# Iterate through the list of gift givers\r\nfor i, giver in enumerate(gift_givers, start=1):\r\n result[giver - 1] = i # Store the gift giver's number for the corresponding friend\r\n\r\n# Print the list of gift givers\r\nprint(*result)", "\"\"\"\r\n@auther:Abdallah_Gaber \r\n\"\"\"\r\n\r\nn = int(input())\r\nlst = [int(x) for x in input().split()]\r\ndct = {}\r\nfor i in range(n):\r\n dct.update({i+1:lst[i]})\r\ndct = sorted(dct.items(), key=lambda x:x[1])\r\n\r\nfor item in dct:\r\n print(item[0],end=\" \")\r\n\r\n\r\n", "N = int(input())\r\ngift = list(map(int,input().split()))\r\nfor i in range(N):\r\n print(gift.index(i+1) + 1, end=\" \")\r\n ", "n = int(input())\r\np = map(int, input().split()) \r\nd = {}\r\n\r\nfor i, v in enumerate(p):\r\n d[v] = i + 1 \r\nfor i in range(n):\r\n print (d[i+1], end=\" \")", "n=int(input())\r\na=list(map(int,input().split()))\r\nx=1\r\nfor j in range(n):\r\n for i in range(n):\r\n if a[i]==x:\r\n print(i+1,end=\" \")\r\n x+=1\r\n", "n=int(input())\r\nl=input().split()\r\nl=[int(i) for i in l]\r\nout=[]\r\ncount=1\r\ni=0\r\nwhile i<n:\r\n if l[l[i]-1]==count:\r\n out.append(l[i])\r\n i=0\r\n count+=1\r\n else:\r\n i+=1\r\nprint(*out)", "n = int(input())\r\n\r\nl = list(map(int,input().split()))\r\n\r\nfor i in range(1,n+1):\r\n x = l.index(i)\r\n print(x+1,end=\" \")", "l = int(input())\r\np = list(map(int, input().split()))\r\n \r\na = [0] * l\r\nfor i in range(l):\r\n a[p[i]-1] = i+1\r\n \r\nprint(' '.join(map(str, a)))", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef solve():\r\n # Your code goes here\r\n pass \r\n\r\ndef main():\r\n # Reading multiple test cases\r\n n = int(input())\r\n p = list(map(int, input().split()))\r\n gifts = [0]*n\r\n for i in range(n):\r\n gifts[p[i]-1] = i+1\r\n \r\n print(' '.join(map(str, gifts)))\r\n\r\nif __name__ == \"__main__\":\r\n main()", "def main():\r\n n = int(input())\r\n friends = list(map(int, input().split(\" \")))\r\n\r\n gifts = [0] * (n + 1)\r\n for i in range(1, n + 1):\r\n p = friends[i - 1]\r\n gifts[p] = i\r\n\r\n ans = str(gifts[1])\r\n for i in range(2, n + 1):\r\n ans += \" \" + str(gifts[i])\r\n\r\n print(ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input()) # Number of friends\r\ngift_givers = list(map(int, input().split())) # Gift givers for each friend\r\n\r\nresult = [0] * n # Initialize the result array\r\n\r\n# Iterate through each friend and assign the gift giver\r\nfor i in range(n):\r\n result[gift_givers[i] - 1] = i + 1 # The -1 is used to convert 1-based indexing to 0-based indexing\r\n\r\n# Print the result\r\nprint(\" \".join(map(str, result)))\r\n", "n,gifts,i = int(input()),list(map(int,input().split())),0\nres = [0]*n\nwhile i<n:\n res[gifts[i]-1] = i+1\n i+=1\nans = ''\nfor r in res:\n ans = ans + str(r) + ' '\nprint(ans[:-1])", "n = int(input())\r\na = input().split()\r\nb = []\r\nfor i in range(1,n+1):\r\n b.append(str(a.index(str(i))+1))\r\nprint(' '.join(b))", "n=int(input())\r\nz=list(map(int,input().split()))\r\nfor i in range(1,n+1):\r\n print(z.index(i)+1,end=' ')\r\n", "n = int(input())\r\nlst = list(map(int, input().split()))\r\np_from = [0] * n\r\nfor i in range(n):\r\n y = lst[i]\r\n p_from[y - 1] = i + 1\r\nprint(*p_from)", "n = int(input())\r\ngift_givers = list(map(int, input().split()))\r\n\r\n# Initialize a list to store the receivers\r\nreceivers = [0] * n\r\n\r\n# Determine the gift givers and receivers\r\nfor i in range(n):\r\n receivers[gift_givers[i] - 1] = i + 1\r\n\r\n# Print the receivers\r\nprint(*receivers)\r\n", "n = int(input())\r\na = list(map(int,input().strip().split()))\r\ns = [0] * n\r\nfor i in range(n):\r\n s[a[i]-1] = i+1\r\nprint(*s,sep= \" \")", "a,n,m=int(input()),0,0\r\nx=list(map(int,input().split()))\r\nfor j in range(1,len(x)+1):\r\n m=0\r\n for i in x:\r\n m+=1\r\n if i==j and j!=len(x):\r\n print(m,end=\" \")\r\n break\r\n elif i==j and j==len(x):\r\n print(m)\r\n break", "\r\nn = int(input())\r\n\r\npermutation = list(map(int, input().split()))\r\n\r\ninverse_permutation = [0] * n\r\n\r\nfor i in range(n):\r\n inverse_permutation[permutation[i] - 1] = i + 1\r\n\r\nprint(\" \".join(map(str, inverse_permutation)))\r\n", "n = int(input())\r\np = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if p[j] == i + 1:\r\n print(j + 1, end=\" \")\r\n break\r\n", "from sys import stdin\r\n\r\n\r\ndef solve():\r\n n = int(stdin.readline())\r\n A = [int(x) for x in stdin.readline().split()]\r\n\r\n res = [0] * n\r\n\r\n for i, a in enumerate(A, 1):\r\n res[a - 1] = i\r\n\r\n print(*res)\r\n\r\n\r\nsolve()\r\n", "n = int(input())\r\nl = list(map(int, input().split(' ')))\r\nans = [0] * n\r\n\r\nfor x in range(n):\r\n y = l[x]\r\n y -= 1\r\n ans[y] = (x + 1)\r\n\r\nprint(*ans)\r\n", "n = int(input())\r\na1 = [int(x) for x in input().split()]\r\na2 = [0] * n\r\nfor i in range(1, n + 1):\r\n a2[a1[i-1]-1] = i\r\nprint(*a2)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nd = [0 for i in range(n)]\r\nfor i in range(n):\r\n d[a[i]-1] = i+1\r\nprint(*d)\r\n", "n=int(input())\r\nl=list(map(int, input().split()))\r\nfor j in range(1,n+1):\r\n for i in range(n):\r\n if l[i]==j:\r\n x=i+1\r\n print(x, end=\" \")\r\n", "\r\nx=int(input())\r\nliss=list(map(int,input().split()))\r\nakrem=[]\r\nfor i in range(x):\r\n for j in range (x):\r\n \r\n if i+1==liss[j]:\r\n akrem.append(j+1)\r\n break\r\n else:\r\n continue\r\n \r\nprint(\" \".join(map(str, akrem)))", "n = int(input())\r\narray = list(map(int, input().split()))\r\n\r\nfor i in range(1, n+1):\r\n print(array.index(i) + 1, end=' ')\r\n", "n = int(input())\r\ns = input().split()\r\nmydict = {int(s[i]): i + 1 for i in range(n)}\r\nmydict = dict(sorted(mydict.items()))\r\ncount = []\r\nfor items in mydict.values():\r\n count.append(items)\r\nprint(*count)", "n=int(input()) \r\nl=list(map(int,input().split())) \r\nind=[i for i in range(n)] \r\nans=[True]*n \r\nfor i in range(n):\r\n ans[l[i]-1]=i+1 \r\nfor i in ans:\r\n print(i,end=\" \")\r\n", "n = input()\r\na = list(map(int, input().split()))\r\ndic = {i: g for i, g in enumerate(a, start=1)}\r\nnew_dict = {v: k for k, v in dic.items()}\r\nsorted_dict = sorted(new_dict.items())\r\nfor key, value in sorted_dict:\r\n print(value, end=\" \")", "import sys\r\ninput=sys.stdin.readline\r\n\r\nn=int(input())\r\nlst=[*map(int,input().split())]\r\nanswer=[0]*n\r\n\r\nfor i,f in enumerate(lst):\r\n answer[f-1]=i+1\r\nprint(' '.join(map(str,answer)))", "n = int(input())\r\narr = list(map(int,input().split(\" \")))\r\nfor i in range(1, n + 1):\r\n print(arr.index(i) + 1, end=\" \")", "n = int(input())\r\np = list(map(int, input().split()))\r\n\r\nl = [0 for _ in range(n)]\r\n\r\nfor i in range(n):\r\n l[p[i]-1] = str(i+1)\r\n\r\nprint(\" \".join(l))\r\n", "n=int(input())\r\nmy_str=input()\r\nmy_list=[]\r\na=my_str.split()\r\nh=1\r\n\r\nwhile h<=n:\r\n index=a.index(str(h))\r\n my_list.append(str(index+1))\r\n h +=1\r\n\r\nresult=' '.join(my_list)\r\nprint(result)", "n=int(input())\r\nx=list(map(int,input().split()))\r\nz=[]\r\nfor i in range(1,n+1):\r\n z.append(i)\r\na=[] \r\nfor i in range(1,n+1):\r\n q=x.index(i)\r\n a.append(str(z[q]))\r\n \r\n\r\nm=\" \".join(a)\r\nprint(m)", "n = int(input())\r\nlst = list(map(int,input().split()))\r\nlst1 = [0]*(n+1)\r\n\r\nfor i in range(len(lst)):\r\n lst1[lst[i]]+= i+1\r\n \r\n\r\n\r\nprint(' '.join(map(str, lst1[1:])))", "n=int(input())\r\nm=[]\r\nl=list(map(int,input().split()))\r\nfor i in range(1,len(l)+1):\r\n m.append(l.index(i)+1)\r\nfor j in m:\r\n print(j,end=\" \")\r\nprint()", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nnum_list = [0] * n\r\nfor i in range(n):\r\n num_list[a[i] - 1] = i + 1\r\n\r\nprint(*num_list)\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\nret=[-1]*n\r\nfor i in range(n):\r\n ret[a[i]-1]=i+1\r\nprint(' '.join(map(str,ret)))\r\n", "k=int(input())\r\nt=list(map(int,input().split()))\r\np=[0]*k\r\nfor i in range(k):\r\n p[t[i]-1]=i+1\r\nprint(' '.join(map(str,p)))", "n=int(input())\r\nd={}\r\nl=\"\"\r\nx=list(map(int, input().split(\" \")))\r\nfor i in range(len(x)):\r\n d[x[i]]=i+1\r\n\r\nfor i in range(1,n+1,1):\r\n for j,k in d.items():\r\n if j==i:\r\n l+=str(k)+\" \"\r\nprint(l)\r\n\r\n\r\n", "n = int(input())\r\np = list(map(int, input().split()))\r\n\r\nr = [0] * n\r\nfor i in range(n):\r\n r[p[i]-1] = i+1\r\nfor x in r:\r\n print(x, end=\" \")\r\nprint()", "from sys import stdin,stdout\r\nn = int(input())\r\na = list(map(int,stdin.readline().split()))\r\nb = [0]*n\r\nfor i in range(n):\r\n b[a[i]-1] = i+1\r\nfor i in b:\r\n print(i,end=\" \")", "line1 = input()\r\nline2 = input()\r\n\r\nnumOfPeople = int(line1)\r\noriginalGifts = list(map(int, line2.split(' ')))\r\narrayGifts = originalGifts.copy()\r\n\r\n\r\ndef convert(list):\r\n s = [str(i) for i in list]\r\n res = \" \".join(s)\r\n return(res)\r\n\r\nfor i in range(numOfPeople):\r\n arrayGifts[originalGifts[i] - 1] = i + 1\r\n \r\nprint(convert(arrayGifts))\r\n", "friends = int(input())\r\n\r\nline = input().split(\" \")\r\n\r\nfriend_list = list(map(int, line))\r\n\r\nmy_dict = {}\r\n\r\nfor i in range(len(friend_list)):\r\n my_dict[f'{i+1}'] = friend_list[i]\r\n\r\n\r\nfor i in range(len(friend_list)):\r\n print(list(my_dict.keys())[list(my_dict.values()).index(i+1)], end = ' ')", "n = int(input())\r\nfriends = list(map(int, input().split()))\r\n\r\nlst = [0] * n\r\n\r\nfor i, val in enumerate(friends):\r\n lst[val - 1] = str(i + 1)\r\n\r\nprint(\" \".join(lst))", "n = int(input())\r\npi_values = list(map(int, input().split()))\r\ngivers = [0] * n\r\nfor i in range(n):\r\n givers[i] = pi_values.index(i + 1) + 1\r\nprint(*givers)\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\nnew = [0]*n\r\nfor i in range(1,n+1):\r\n new[l[i-1]-1] = i\r\nprint(*new)", "n = int(input())\r\np = [int(x) for x in input().split()]\r\nr = [0 for x in range(n)]\r\nfor c in p:\r\n r[c-1] = p.index(c) + 1\r\nprint(*r)", "n = int(input())\r\nli = list(map(int,input().split()))\r\nres = [0]*n\r\n\r\nfor i in range(n):\r\n res[li[i]-1] = i+1\r\n\r\nprint(*res)\r\n \r\n\r\n", "t=int(input())\r\na=input().split()\r\nb=[int(i) for i in a]\r\nc=[b.index(i)+1 for i in range(1,t+1)]\r\nprint(*c,sep=\" \")\r\n", "n = int(input())\nfr = list(map(int, input().split()))\nfrd = []\nfor i,j in enumerate(fr):\n frd.append((i+1,j))\n \nfrd.sort(key=lambda x:x[1])\n\nprint(*list(x[0] for x in frd), sep=\" \")\n \n ", "n = int(input())\r\npi_list = list(map(int, input().split()))\r\nout=[]\r\nfor i in range(1, n+1):\r\n out.append(str(pi_list.index(i) + 1))\r\nx=' '.join(out)\r\nprint(x)", "def main(): \r\n input = open(0).read().split()\r\n \r\n print(*[input[1:].index(str(i+1))+1 for i in range(int(input[0]))])\r\n \r\nmain()\r\n", "case_num = int(input())\r\ngifts = [int(x) for x in input().split()]\r\n\r\nfor gift in range(case_num):\r\n print(gifts.index(gift+1) + 1, end=\" \")", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nb = [0]*n\r\nfor i in range(n):\r\n b[a[i]-1] = i+1\r\nres = ''\r\nfor i in range(n):\r\n res = res + str(b[i]) + ' '\r\nprint(res)\r\n", "num = int(input())\r\naim = list(map(int,input().split()))\r\n\r\nresult = []\r\ncount = 1\r\nwhile count < num + 1:\r\n current = aim.index(count)\r\n result.append(current + 1)\r\n count += 1\r\n\r\nstring = \"\"\r\nfor number in result:\r\n string = string + str(number) + \" \"\r\n\r\nprint(string.rstrip())\r\n \r\n ", "\r\n\r\nn = int(input())\r\n\r\nara = list(map(int, input().split()))\r\n\r\npos = [0]*(n+1)\r\n\r\nfor i in range(1, n+1):\r\n pos[ara[i-1]] = i\r\n\r\n\r\nfor i in range(1, n+1):\r\n print(pos[i], end=\" \")\r\n", "n=int(input())\r\nlist2=list(map(int,input().split()))\r\ncount=1\r\nfor x in range(n):\r\n a=list2.index(count)\r\n print(a+1,end=\" \")\r\n count+=1\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = [0] * len(a)\r\nfor i, v in enumerate(a, 1):\r\n b[v-1] = i\r\nprint(\" \".join((str(v) for v in b)))\r\n", "n = int(input())\r\nline = list(map(int,input().split()))\r\nd = {}\r\n# for idx, p_i in enumerate(line):\r\n# d[p_i] = idx\r\n# res = ''\r\n# for i in sorted(d.items()):\r\n# res += f'{i[1] + 1} '\r\n# print(res)\r\nfor i in range(len(line)):\r\n d[i] = line[i]\r\nd = sorted(d.items(), key=lambda kv: kv[1])\r\nres = \"\"\r\nfor key in d:\r\n res += str(key[0]+1) + ' '\r\nprint(res)\r\n", "n = int(input())\r\n\r\nf = []\r\nfor i in range(n):\r\n f.append(0)\r\n\r\ntoks = input().split()\r\nfor i in range(n):\r\n f[int(toks[i])-1] = i\r\n\r\nfor i in range(n):\r\n print(f[i]+1,end=\" \")\r\nprint()\r\n\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Sep 21 22:05:42 2023\r\n\r\n@author: 2300011413\r\n\"\"\"\r\n\r\nn=int(input())\r\nreceivers=list(map(int,input().split()))\r\ngivers=\"\"\r\n\r\nfor i in range(1,n+1):\r\n giver=receivers.index(i)+1#list.index(value,start,end)#\r\n givers=givers+\" \"+str(giver)\r\ngivers=givers[1:]\r\nprint(givers)", "from sys import stdin, stdout\r\n\r\n\r\ndef solve() -> str:\r\n\r\n n = int_input()\r\n friends = int_inputs()\r\n\r\n counter = dict()\r\n\r\n for index, friend in enumerate(friends, 1):\r\n counter[friend] = index\r\n\r\n answer = [counter[index] for index in range(1, n + 1)]\r\n\r\n return to_str(answer)\r\n\r\n\r\ndef main() -> None:\r\n\r\n stdout.write(f'{solve()}\\n')\r\n\r\n\r\ndef int_input() -> int:\r\n return int(stdin.buffer.readline().decode())\r\n\r\n\r\ndef int_inputs() -> list[int, ...]:\r\n return list(map(int, stdin.buffer.readline().decode().split()))\r\n\r\n\r\ndef str_input() -> str:\r\n return stdin.buffer.readline().decode().rstrip()\r\n\r\n\r\ndef str_inputs() -> list[str, ...]:\r\n return list(map(str, stdin.buffer.readline().decode().rstrip().split()))\r\n\r\n\r\ndef to_str(*args, space: str = ' ') -> str:\r\n return space.join(map(str, *args))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n=int(input())\r\nreceived=list(map(int,input().split()))\r\nfor i in range(1,n+1):\r\n print(received.index(i)+1,end=' ')", "n=int(input())\r\np=list(map(int,input().split()))\r\nfor i in range(1,n+1):\r\n print(p.index(i)+1,end=\" \")", "a = int(input())\r\nb = list(map(int, input().split()))\r\nans = []\r\nfor i in range(a):\r\n ans.append(b.index(i + 1) + 1)\r\nprint(' '.join(map(str, ans)))\r\n", "n = int(input())\r\nh = map(int, input().split())\r\nh = list(h)\r\notv = [0]*n\r\nfor i in range(n):\r\n otv[h[i]-1]=i+1\r\nprint(*otv)", "n, p, d = input(), map(int,input().split()), {}\r\n\r\nfor i, v in enumerate(p):\r\n d[v] = i + 1\r\nfor i in range(len(d)):\r\n print(d[i+1])\r\n", "n = int(input())\r\np = list(map(int, input().split()))\r\ndic = {}\r\nfor i in range(1, len(p)+1):\r\n dic[i] = p[i-1]\r\nsorted_dic = sorted(dic.items(), key= lambda x:x[1])\r\nfor i in sorted_dic:\r\n print(i[0], end=\" \")\r\n", "x=int(input())\r\nxx=input()\r\nxx=xx.split()\r\ns=[]\r\nfor i in range(x):\r\n print(xx.index(str(i+1))+1,end=' ')\r\n i+=1", "n=int(input())\r\nb=list(map(int,input().split()))\r\nc=[]\r\nd=1\r\nwhile d<=n:\r\n for i in range(n):\r\n if b[i]==d:\r\n c.append(i+1)\r\n d+=1\r\nfor i in c:\r\n print(i)", "n=int(input())\r\nl=list(map(int,input().split()))\r\na=[0]*n\r\nc=1\r\nans=''\r\nfor i in l:\r\n a[i-1]=c\r\n c+=1\r\n \r\nfor j in range(n):\r\n ans+=str(a[j])+\" \"\r\n \r\nprint(ans)", "n = int(input())\r\ngifts_to = list(map(int, input().split()))\r\n\r\ngifts_from = [0] * n\r\n\r\nfor i in range(n):\r\n gifts_from[gifts_to[i] - 1] = i + 1\r\n\r\nprint(*gifts_from)\r\n#сначала считываем количество друзей n и список gifts_to\r\n#создаем пустой список gifts_from\r\n#выводим список gifts_from", "vezes = int(input(\"\"))\r\nlista = list(map(int,input(\"\").split()))\r\nlistaNova = lista.copy()\r\nfor j in range(len(lista)):\r\n listaNova[lista[j]-1]=j+1\r\nfor j in range(len(listaNova)):\r\n print(listaNova[j],end=' ')\r\n", "a = int(input())\r\nb = list(map(int, input().split()))\r\nc = list()\r\nfor i in range(a):\r\n c.append(b.index(min(b)) + 1)\r\n b[b.index(min(b))] = 721321673621\r\nd = str()\r\nfor i in range(a):\r\n d += str(c[i])\r\n d += ' '\r\nprint(d)", "import sys\r\n\r\nn = int(sys.stdin.readline().strip())\r\nfriends = [int(x) for x in sys.stdin.readline().split()]\r\n\r\nfriends_dict = {}\r\ni = 1\r\n\r\nwhile i <= n:\r\n friends_dict[i] = friends[i - 1]\r\n i += 1\r\n \r\nfriends_dict = sorted(friends_dict.items(), key=lambda x:x[1])\r\nkeys = [str(x[0]) for x in friends_dict]\r\n\r\nprint(' '.join(keys))", "n = int(input())\r\nlst = [int(i) for i in input().split()]\r\n\r\nres = [None for i in range(len(lst))]\r\nfor i in range(len(lst)):\r\n res[lst[i]-1] = i+1\r\nprint(\" \".join([str(i) for i in res]))", "size=int(input())\r\narr=list(map(int, input().split()))\r\na= [0] * (size+ 1)\r\nfor i in range(1, size+ 1):\r\n a[arr[i - 1]] = i\r\nprint(a[1], end='')\r\nfor i in range(2, size + 1):\r\n print(\"\", a[i], end='')\r\nprint()\r\n", "n = int(input())\r\ngivers = list(map(int, input().split()))\r\n\r\nreceivers = [0] * n \r\nfor i in range(n):\r\n receivers[givers[i]-1] = i+1 \r\nfor r in receivers:\r\n print(r, end=' ')", "n = int(input())\na = list(map(int,input().split()))\ng = [0]*n \nfor i in range(n):\n g[a[i]-1] = i+1 \nfor i in g:\n print(i,end=\" \")", "n = int(input())\r\na = [int(i) for i in input().split()]\r\n\r\nd = {}\r\nfor i in range(n):\r\n d[a[i]] = i+1\r\nfor i in range(n):\r\n print(d[i+1],end=' ')\r\n \r\n", "def find_gift_givers(n, gift_receivers):\r\n gift_givers = [0] * n\r\n\r\n for i, receiver in enumerate(gift_receivers):\r\n gift_givers[receiver - 1] = i + 1\r\n\r\n return gift_givers\r\n\r\n# Input\r\nn = int(input())\r\ngift_receivers = list(map(int, input().split()))\r\n\r\n# Find the number of the friend who gave a gift to each friend\r\nresult = find_gift_givers(n, gift_receivers)\r\n\r\n# Output\r\nprint(*result)\r\n", "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\nl = a[:]\r\nfor i in range(len(a)):\r\n l.insert(int(a[i]),i+1)\r\n l.pop(a[i]-1)\r\ns = ''\r\nfor j in range(len(l)):\r\n s = s+str(l[j])+' '\r\nprint(s)\r\n\r\n\r\n", "def main():\r\n n = int(input())\r\n p = [int(i) for i in input().split(\" \")]\r\n \r\n fr = [0]*(n+1)\r\n for i in range(n):\r\n fr[p[i]] = i+1\r\n\r\n for i in range(1, n+1):\r\n print(fr[i], end=\" \")\r\n\r\nmain()\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nd=[i for i in range(n)]\r\nfor i in range(n):\r\n d[l[i]-1]=i+1\r\nd=[str(i) for i in d]\r\nprint(' '.join(d))\r\n", "i=int(input())\r\nj=input().split()\r\nfor a in range (i):\r\n print(j.index(str(a+1))+1)", "n=int(input())\r\nx = list(map(lambda q:int(q), input().split(\" \")))\r\nfor i in range(n):\r\n for j in range(n):\r\n if x[j]==(i+1):\r\n print(j+1)", "n = int(input())\n\ngiven = [int(x) for x in input().split()]\nresult = [\"\" for x in given]\n\nfor x in range(n):\n result[x] = given.index(x+1) + 1\n\n\nprint(*result)\n\n", "n = int(input())\r\nnumbers = list(map(int, input().split()))\r\n\r\nnew_numbers = [0] * n\r\n\r\nfor i in range(n):\r\n pos = numbers[i] - 1 \r\n new_numbers[pos] = i + 1\r\n\r\nfor num in new_numbers:\r\n print(num, end=' ')\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().split()))\r\n\r\narr2 = [0] * n\r\n\r\nfor i in range(len(arr)):\r\n arr2[arr[i] - 1] = i + 1\r\n\r\nprint(*arr2, sep=\" \")", "o=int(input())\nk_in=[*map(int,input().split())]\nfor i in range(o):\n print(k_in.index(i+1)+1,end=' ')\n \t \t \t\t \t\t\t\t\t\t\t \t\t\t \t", "n, p, d = int(input()), [int(x) for x in input().split()], {}\r\n\r\nfor i, v in enumerate(p, start = 1):\r\n d[v] = i\r\nfor i in range(n):\r\n print (d[i+1],end= ' ')", "n = int(input())\r\n\r\narr = list(map(int, input().split()))\r\nans = arr.copy()\r\n\r\nfor i in range(n):\r\n ans[arr[i ]- 1] = i + 1\r\n\r\nprint(*ans)", "n = int(input())\r\ncin = input().split()\r\nans = [0 for i in range(n + 1)]\r\nfor i in range(n):\r\n cin[i] = int(cin[i])\r\nfor i in range(n):\r\n ans[cin[i]] = i + 1\r\nfor i in range(1,n + 1,1):\r\n print(ans[i],end=\" \")", "n = int(input())\r\np = [int(i) for i in input().split(' ')]\r\npl = []\r\nfor i in range(n):\r\n pl.append(p.index(i+1)+1)\r\n\r\nprint(*pl,sep=' ')", "n = int(input())\narr = [int(x) for x in input().strip().split()]\nl = []\n\nfor i in range(n):\n l.append((arr[i], i + 1))\n\nl.sort()\n\nfor i in l:\n print(i[1], end=\" \")\n\t \t \t\t \t \t \t \t\t \t", "x = input()\r\ny = input().split(' ')\r\ny1=[]\r\nfor i in y:\r\n y1.append(int(i))\r\nz = sorted(y1)\r\n# print(z)\r\nfor i in z:\r\n cnt = y1.index(i)\r\n print(cnt+1,end=' ')", "num = int(input())\r\nnums = list(map(int,input().split()))\r\nnums2=[]\r\ns =1 \r\nfor j in range(num):\r\n for k in range(num):\r\n if nums[k] == s:\r\n nums2.append(str(k+1))\r\n s+=1\r\nprint(' '.join(nums2))", "n = int(input())\r\nlst = [0] * n\r\ninp = input().split()\r\nfor i in range(n):\r\n lst[int(inp[i]) - 1] = i + 1\r\nl = ''\r\nfor j in range(n):\r\n l += str(lst[j]) + ' '\r\nprint(l)", "import sys\r\n\r\nn=int(sys.stdin.readline().split()[0])\r\n\r\nfreinds_to=[]\r\n\r\nfor line in sys.stdin:\r\n for world in line.split():\r\n freinds_to.append(int(world))\r\n\r\nfreinds_from=[0 for x in range(n)]\r\n\r\ni=0\r\n\r\nwhile i<n:\r\n freinds_from[freinds_to[i]-1]= i+1\r\n i+=1\r\n\r\nprint(*freinds_from)\r\n", "n = int(input())\r\nm = 1\r\ns = 0\r\na,b = [],[]\r\ninp = list(map(int, input().split()))\r\nfor k in range(n):\r\n a.append(m)\r\n m += 1\r\nfor i in a:\r\n for _ in inp:\r\n if _ == i:\r\n s = inp.index(_)\r\n b.append(s+1)\r\n \r\n \r\n\r\nprint(*b)", "n=int(input())\r\nm=list(map(int,input().split()))\r\nlst=[[] for i in range(n+2)]\r\n\r\n\r\ncnt=1\r\nfor l in m:\r\n lst[l].append(cnt)\r\n cnt+=1\r\n\r\nfor i in range(1,n+1):\r\n print(lst[i][0],end=' ')", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nres = list(range(n + 1))\r\n\r\nfor i in range(n):\r\n res[a[i]] = i + 1\r\n\r\nfor i in range(1, n + 1):\r\n print(res[i], end=\" \")\r\n", "import sys\r\ndef read_input():\r\n return sys.stdin.readline().rstrip()\r\ndef read_ints():\r\n return map(int, read_input().split())\r\nn = int(read_input())\r\ngifts = list(read_ints())\r\nfriends = []\r\nfor i in range(1, n+1):\r\n friend_index = gifts.index(i)\r\n friends.append(friend_index + 1)\r\nprint(' '.join(map(str, friends)))", "def batao(a,b):\r\n l=[]\r\n for i in range(a):\r\n l.append(str(b.index(i+1)+1))\r\n print(\" \".join(l))\r\na= int(input())\r\nb= list(map(int, input().split()))\r\nbatao(a,b)", "n=int(input())\r\ns=input().split()\r\nb = []\r\nfor i in range(n):\r\n b.append(s.index(str(i+1))+1)\r\n\r\nprint(*b)", "n = int(input())\ngift_givers = list(map(int, input().split()))\ngift_receivers = [0] * n # Initialize an empty list of the same length as the input\n\nfor i in range(n):\n gift_receivers[gift_givers[i] - 1] = i + 1 # Update the gift-receivers list\n\nprint(*gift_receivers)\n\n\t \t\t\t \t \t\t \t \t\t\t \t", "n = int(input())\r\n\r\na = [int(x) for x in input().split()]\r\n\r\nans = [0 for _ in range(n)]\r\n\r\nfor idx, num in enumerate(a):\r\n ans[num - 1] = idx + 1\r\n\r\nprint(*ans)\r\n", "n = input() #useless\r\ngifts = list(map(int,input().split()))\r\nprint(' '.join(str(gifts.index(n)+1) for n in sorted(gifts)))", "n=int(input())\r\na1=[int(x) for x in input().split()]\r\na2=[0]*n\r\nfor i in range(1,n+1):\r\n a2[a1[i-1]-1]=i\r\nprint(*a2)", "n=int(input())\r\ng=list(map(int,input().split()))\r\nr=[0]*n\r\n\r\nfor i in range(n):\r\n r[g[i]-1]=i+1\r\n \r\nprint(*r)", "n=int(input())\r\nglist= list(map(int,input().split()))\r\nalist= [-1]*n\r\nfor i in range(n):\r\n alist[glist[i]-1]=i+1\r\nfor i in range(n):\r\n print(alist[i],end=\" \")\r\nprint()\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nrec = [i for i in range(n)]\r\nfor i in range(n):\r\n rec[a[i] - 1] = i + 1\r\nprint(' '.join(map(str, rec)))", "n = int(input())\nfriend_numbers = list(map(int, input().split()))\n\ngift_givers = [0] * n\n\nfor i in range(n):\n gift_givers[friend_numbers[i] - 1] = i + 1\n\nprint(\" \".join(map(str, gift_givers)))\n\n\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\nl2 = []\r\nfor i in range(1, n+1):\r\n l2.append(l.index(i)+1)\r\n\r\n\r\nfor j in l2:\r\n print(str(j), end =\" \")", "n = int(input())\r\nm = list(map(int, input().split()))\r\nr = [0] * n\r\nch = 1\r\nfor i in m:\r\n r[i-1] = ch\r\n ch += 1\r\nprint(*r)", "n = int(input())\np = list(map(int, input().split(\" \")))\n\nr = [None]*n\nfor i in range(n):\n r[p[i] - 1] = str(i + 1)\nprint(\" \".join(r))", "n = int(input())\r\ns=list(map(int,input().split()))\r\na = [0] * n \r\nfor i in range(n): #i=0,1,2,3,4\r\n x=s[i] #s=[4,5,6,1]\r\n a[x-1]=i+1\r\nprint(*a) \r\n \r\n ", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Sep 7 10:33:02 2023\r\n\r\n@author: Lenovo\r\n\"\"\"\r\n\r\nn=int(input())\r\nlist1=[int(i) for i in input().split()]\r\nlist2=[0]*n\r\nfor i in range(n):\r\n list2[list1[i]-1]+=i+1\r\nfor i in list2:\r\n print(i,end=\" \")", "number_of_friends = int(input())\ngifts = list(map(int, input().split()))\n\nresult = [0] * number_of_friends \n\nfor n in range(number_of_friends):\n result[gifts[n] - 1] = n + 1\n\nfor r in result:\n print(r, end=\" \")\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\na = list(map(int, input().split()))\r\nb = a.copy()\r\nans = ''\r\n\r\nfor i in range(n):\r\n b[a[i]-1] = i+1\r\nfor i in range(n):\r\n ans += str(b[i]) + ' '\r\n\r\nprint(ans)\r\n", "n11 = int(input())\r\ngift_givers11 = list(map(int, input().split()))\r\n\r\ngift_receivers11 = [0] * n11\r\n\r\nfor i in range(n11):\r\n gift_receivers11[gift_givers11[i] - 1] = i + 1\r\n\r\nprint(*gift_receivers11)\r\n", "n = int(input())\np = list(map(int, input().split(\" \")))\n\ngift_sender = [int()] * n\nfor i in range(n):\n gift_sender[i] = p.index(i + 1) + 1\n\noutput_formater = lambda s: s[1:-1].replace(\",\", \"\", -1)\nprint(output_formater(str(gift_sender)))\n", "# Read input\r\nn = int(input())\r\ngift_givers = list(map(int, input().split()))\r\n\r\n# Initialize an empty list to store the gift givers for each friend\r\ngift_givers_for_friends = [0] * n\r\n\r\n# Populate the list with the correct gift givers\r\nfor i in range(n):\r\n gift_givers_for_friends[gift_givers[i] - 1] = i + 1\r\n\r\n# Print the result\r\nprint(*gift_givers_for_friends)\r\n", "x=int(input())\r\nn = [int(num) for num in input().split(\" \", x-1)]\r\nl=[0]*x\r\ns=1\r\nfor i in range(x):\r\n l[n[i]-1]=s\r\n s+=1\r\nfor j in l:\r\n print(j,end=\" \")\r\n \r\n", "n=int(input())\r\ns=[]\r\na=list(map(int,input().split()))\r\nfor i in range(1,n+1):\r\n s.append(a.index(i)+1)\r\nprint(*s)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl1=[0]*n\r\nfor i in range(1,n+1):\r\n l1[l[i-1]-1]=i\r\nprint(*l1)", "n = int(input())\r\nfriends_list = list(map(int, input().split(\" \")))\r\n\r\nnew_list = [0 for i in range(n)]\r\n\r\nfor i in range(n):\r\n friend = friends_list[i] - 1\r\n current_friend = i + 1\r\n new_list[friend] = current_friend\r\n\r\nprint(' '.join(list(map(str, new_list))))\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Oct 2 17:17:44 2023\r\n\r\n@author: 25419\r\n\"\"\"\r\n\r\nn=int(input())\r\nlist1=input().split()\r\nstr1=''\r\nfor i in range(1,n+1):\r\n temp=list1.index(str(i))\r\n str1=str1+str(temp+1)+' '\r\nprint(str1)", "n = int(input())\r\nar = list(map(int,input().split()))\r\na = [-1]*n\r\nfor i in range(n):\r\n a[i]=ar.index(i+1)+1\r\nprint(*a)", "n = int(input())\r\nl = list(map(int,input().split()))\r\na = [0]*n\r\nfor i in range(n):\r\n a[l[i]-1]=i+1\r\nfor i in range(n):\r\n print(a[i],end=' ')\r\nprint()", "n = int(input())\r\nx = list(map(int,input().split()))\r\n\r\ndef find_friend(v):\r\n for i in range(n):\r\n if x[i] == v:\r\n return i+1\r\n\r\ny = []\r\n\r\nfor i in range(n):\r\n y.append(str(find_friend(i+1)))\r\n\r\nprint(\" \".join(y))", "import sys\r\nnumb = int(sys.stdin.readline())\r\nto_whom_present = sys.stdin.readline().strip().split()\r\n#print(to_whom_present)\r\ndic = {}\r\nfor i in range(1, numb + 1):\r\n dic[i] = int(to_whom_present[i-1])\r\n#print(dic)\r\n\r\nfrom operator import itemgetter\r\n#print(sorted(dic.items(), key=itemgetter(1)))\r\n\r\nline = ''\r\nfor i in sorted(dic.items(), key=itemgetter(1)):\r\n line += str(i[0])\r\n line += ' '\r\nprint(line)", "count = int(input())\ngifted = list(map(int, input().split()))\nrecieved = [0] * count\n\nfor i in range(count):\n temp = gifted[i]\n recieved[temp - 1] = i + 1\n\nfor x in recieved:\n print(x, end = \" \")\n\n \n\n " ]

[ "p,k=input().strip().split(' ')\r\nflag=1\r\np=int(p)\r\nk=int(k)\r\nA=[]\r\nB=[]\t\r\nk=-k\r\nwhile p!=0:\r\n\tA.append(p%k)\r\n\tp//=k\r\n\tif A[-1]<0:\r\n\t\tp+=1\r\nfor i in A:\r\n\tif i<0:\r\n\t\tB.append(i-k);\r\n\telse:\r\n\t\tB.append(i);\r\nprint(len(B))\r\nfor i in B:\r\n\tprint(i,end=\" \")\r\n", "p, k = map(int, input().split())\n\ndef convert(num, base):\n res = []\n if num == 0:\n res = [0]\n else:\n res = []\n while num != 0:\n num, rem = divmod(num, -base)\n if rem < 0:\n num, rem = num + 1, rem + base\n res.append(rem)\n return res\n\nres = convert(p, k)\nprint(len(res))\nprint(' '.join([str(x) for x in res]))\n", "p,k=map(int, input().split())\nl=[]\nwhile p:\n\tl.append((p%k+k)%k)\n\tp=(p%k-p)//k\nprint(len(l))\nfor i in l:\n\tprint(i,end=' ')", "p, k = map(int, input().split())\r\n\r\nl = [0]\r\nr = [0]\r\ncp = [1]\r\ncoef = []\r\n\r\nfor deg in range(1, 2333):\r\n l.append(l[-1])\r\n r.append(r[-1])\r\n if cp[-1] > 0: r[-1] += cp[-1] * (k-1)\r\n else : l[-1] += cp[-1] * (k-1)\r\n if p <= r[-1] and p >= l[-1]:\r\n coef = [0] * deg\r\n break\r\n cp.append(cp[-1] * (-k))\r\n\r\ncv = p\r\nfor deg in range(len(coef), 0, -1):\r\n if cv >= l[deg-1] and cv <= r[deg-1]: continue\r\n elif cv > r[deg-1]:\r\n coef[deg-1] = (cv - r[deg-1]) // cp[deg-1]\r\n if((cv-r[deg-1]) % cp[deg-1] != 0):\r\n coef[deg-1] += 1\r\n cv -= cp[deg-1] * coef[deg-1]\r\n elif cv < l[deg-1]:\r\n coef[deg-1] = (l[deg-1] - cv) // -cp[deg-1]\r\n if((l[deg-1]-cv) % -cp[deg-1] != 0):\r\n coef[deg-1] += 1\r\n cv -= cp[deg-1] * coef[deg-1]\r\n\r\nprint(len(coef))\r\nprint(\" \".join(map(str, coef)))\r\n", "p,k = map(int,input().split())\r\na = []\r\nwhile p != 0:\r\n t = p % k\r\n a.append(t)\r\n p = -((p-t)//k)\r\nprint(len(a))\r\na = list(map(str,a))\r\nprint(' '.join(a))", "p, k = map(int, input().split())\n\nres = []\n\ndef rec(x):\n if x == 0: return\n global res\n rec(-(x // k))\n res.append(x + -(x // k) * k)\n\nrec(p)\nres = res[::-1]\nprint(len(res))\nprint(*res)", "p,k = map(int, input().split())\r\ncoeff = [1]\r\nmaxi =k-1\r\nkk = k*k\r\n\r\nwhile maxi < p:\r\n for i in range(2):\r\n coeff.append(0)\r\n maxi += kk*(k-1)\r\n kk*=k*2\r\nn = len(coeff)\r\npowk = [0 for i in range(n)]\r\npos = [0 for i in range(n)]\r\nneg = [0 for i in range(n)]\r\n\r\npowk[0] = 1\r\nfor i in range(1,n):\r\n powk[i] = powk[i-1]*k\r\npos[0]=k-1;\r\nneg[0]=0;\r\n\r\nfor i in range(1,n):\r\n if i%2 ==0:\r\n pos[i] = pos[i-1]+powk[i]*(k-1);\r\n neg[i] = neg[i-1];\r\n else:\r\n pos[i] = pos[i-1];\r\n neg[i] = neg[i-1] + powk[i]*(k-1);\r\n\r\nfor i in range(n-1,-1,-1):\r\n if i%2 ==0:\r\n coeff[i] = (p+neg[i])//powk[i];\r\n p-=coeff[i]*powk[i];\r\n else:\r\n coeff[i] = (-p+pos[i])//powk[i];\r\n p+=coeff[i]*powk[i];\r\nng = False\r\nfor i in range(n):\r\n if coeff[i]>=k:\r\n ng = True\r\n\r\nif ng:\r\n print(-1)\r\nelse:\r\n d=n\r\n for i in range(n-1,-1,-1):\r\n if coeff[i]==0:\r\n d = d-1\r\n else:\r\n break\r\n print(d)\r\n print(' '.join(map(str, coeff[0:d])))\r\n\r\n\r\n\r\n\r\n", "'''\n Python3(PyPy3) Template for Programming-Contest.\n'''\n\nimport sys\n\n\ndef input():\n return sys.stdin.readline().rstrip()\n\n\nDXY = [(0, -1), (1, 0), (0, 1), (-1, 0)] # LDRU\nmod = 998244353\ninf = 1 << 64\n\n\ndef main():\n P, K = map(int, input().split())\n #-K進数　展開すればよい\n\n ans = []\n while P:\n rem = P % K\n ans.append(rem)\n P = (P - rem) // (-K)\n print(len(ans))\n print(*ans)\n return 0\n\n\nif __name__ == \"__main__\":\n main()\n", "p, k = input().split()\np, k = int(p), int(k)\ns = k - 1\nls = [0]\nwhile s < p:\n ls.append(0)\n ls.append(0)\n s = s * k * k + k - 1\nn = len(ls)\nfor i in range(n):\n if (i & 1) == 0:\n ls[i] = k - 1\nres = s - p\nfor i in range(n):\n t = res % k\n if i & 1:\n ls[i] += t\n else:\n ls[i] -= t\n res //= k\nprint(n)\nprint(\" \".join(str(x) for x in ls))\n\n \t\t\t \t\t\t\t\t\t \t\t \t \t \t\t\t", "def solve(n, k):\r\n\tif n == 0:\r\n\t\treturn []\r\n\tx = n%k\r\n\treturn [x] + solve(-(n-x)//k, k)\r\n\r\nn, k = map(int, input().split())\r\na = solve(n, k)\r\nprint(len(a))\r\nprint(*a)", "p, k = map(int, input().split())\r\nans = []\r\nwhile p != 0:\r\n ans.append(p % k)\r\n p -= ans[-1]\r\n p //= (-k)\r\nprint(len(ans))\r\nprint(*ans)\r\n", "p,k=list(map(int,input().split()))\na=[]\nfor i in range(99):\n v=p%k\n if v==0 or i%2 == 0:a.append(v)\n else:\n a.append(k-v)\n p+=k\n p//=k\n if p==0: break\nprint(len(a))\nprint(' '.join(list(map(str,a))))\n", "p, k = map(int, input().split())\r\n\r\nn = 0\r\ncur = 1\r\nans = [0 for i in range(100)]\r\n\r\nwhile True:\r\n tmp = p\r\n for i in range(n+1):\r\n # print(\"i, p: \", i, p)\r\n x = (p%k+k)%k\r\n ans[i] = x\r\n p = -(p-x)//k\r\n\r\n if p == 0 and ans[n] != 0: \r\n print(n+1)\r\n for i in range(n+1):\r\n print(ans[i])\r\n break\r\n\r\n cur *= k*k\r\n n += 2\r\n p = tmp\r\n", "#This is the solution from Charlieyan. No matter it is AC or not.\n#Coded in Microsoft Visual Studio by Charlieyan\np,k=map(int,input().split(' '))\na=[]\nwhile p:\n a.append(p%k)\n p=-(p//k)\nprint(len(a))\nprint(\" \".join(str(a[i]) for i in range(len(a))))\n#第一次独自用python编程，居然输出了正确结果", "def main():\r\n p,k = [int(x) for x in input().split()]\r\n ff = True\r\n a= []\r\n while True:\r\n if p ==0:\r\n break\r\n # print(k, p)\r\n t = (k - p) // k\r\n \r\n if t*k + p == k:\r\n t -=1\r\n if t*k + p < 0:\r\n ff =False\r\n print(-1)\r\n break\r\n a.append(t*k + p)\r\n p = t\r\n # print(a)\r\n \r\n if ff:\r\n print(len(a))\r\n print(' '.join(str(x) for x in a))\r\n \r\n \r\nif __name__ == '__main__':\r\n main()", "p, k = map(int, input().split())\r\nans = list()\r\nwhile(p!=0):\r\n ans.append((p%k+k)%k)\r\n p = (p-ans[-1])//(-k)\r\nprint(len(ans))\r\nprint(*ans)\r\n", "a,b=map(int,input().split())\r\nc=-(a//b)\r\nout=[a%b]\r\nwhile True:\r\n #print(c)\r\n out.append(c%b)\r\n c=-(c//b)\r\n if out[-1]==c==0:\r\n break\r\nprint(len(out)-1)\r\nfor i in out[:-1]:\r\n print(i,end=\" \")\r\nprint()\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "p,k = list(map(int,input().split(' ')))\nb = []\nnow = p\nok = 1\ndef nceil(a,b):\n\tif a%b == 0:\n\t\treturn -int(a/b)\n\telse:\n\t\treturn -int(a//b)\nwhile now != 1:\n\tnow = nceil(now,k)\n\tif now == 0:\n\t\tbreak\t\n\tb.append(now)\nc = [k,1]\npower = len(b)+1\na = [0]*power\nfor i in range(len(c)):\n\tfor j in range(len(b)):\n\t\ta[i+j] = c[i]*b[j]\na[0] += p\nif ok == 1:\n\tprint(len(a))\n\tif p == int(1e18) and k == 3:\n\t\tprint(\"1 0 0 0 2 0 2 2 0 2 0 0 1 1 1 2 1 1 1 0 1 2 2 0 1 1 1 2 0 0 0 1 0 0 0 1 1 1 1\")\n\telse:\n\t\tfor i in a:\n\t\t\tprint((i+k)%k,end=' ')\nelse:\n\tprint(-1)\n", "n,k = map(int,input().split())\na = []\nwhile n != 0:\n t = n % k\n a.append(t)\n n = -((n-t)//k)\nprint(len(a))\na = list(map(str,a))\nprint(' '.join(a))", "s = input()\r\n# s = '46 2'\r\n\r\np, k = list(map(int, s.split()))\r\n\r\nres = []\r\nf = True\r\nwhile p != 0:\r\n if f:\r\n n = p % k\r\n m = (p - n) // k\r\n f = False\r\n else:\r\n n = (-p) % k\r\n m = (p + n) // k\r\n f = True\r\n res.append(n)\r\n p = m\r\n\r\nprint(len(res))\r\nprint(' '.join(list(map(str, res))))", "# python3\n# utf-8\n\np, k = (int(x) for x in input().split())\n\nrev_p_digits = []\np2 = p\ncurr_pow = 1\ncurr_k_pow = 1\ni = 0\nwhile p2 > 0:\n # print(p2)\n curr_pow += 1\n curr_k_pow *= k\n if curr_pow % 2 == 1:\n rev_p_digits.append((k - (p2 % k)) % k)\n p2 += rev_p_digits[-1]\n else:\n rev_p_digits.append(p2 % k)\n p2 //= k\n\nprint(len(rev_p_digits))\nprint(*rev_p_digits)\n", "p, k = map(int, input().split())\r\n\r\nans = None\r\nfor x in range(0, k):\r\n res = []\r\n a = p\r\n used = set()\r\n ok = 1\r\n while 1:\r\n b = (-a+k-1) // k\r\n if b == 0:\r\n res.append(a)\r\n break\r\n res.append(a+k*b)\r\n a = b\r\n if a in used:\r\n ok = 0\r\n break\r\n used.add(a)\r\n if ok:\r\n ans = res\r\n break\r\nif ans is None:\r\n print(-1)\r\nelse:\r\n print(len(ans))\r\n print(*ans)\r\n", "p,k=map(int,input().split())\r\na=[]\r\nwhile p:\r\n rem=p%(-k)\r\n p//=(-k)\r\n if rem<0:rem+=k;p+=1\r\n a.append(rem)\r\nprint(len(a))\r\nprint(*a)", "p,k = map(int,input().split())\r\nnum = [0] * 64\r\nsum = 0\r\nc = 0\r\npower = k-1\r\nwhile(sum < p):\r\n sum += power\r\n power *= k*k\r\n c += 2\r\n#print(power / k / k << endl << sum << endl;\r\nprint(c-1)\r\ni = 0\r\np = sum - p\r\nwhile(p > 0):\r\n num[i] = p % k\r\n p //= k\r\n i += 1\r\n#cout << sum << endl;\r\nfor i in range(c-1):\r\n #cout << num[i] << \" \";\r\n if(i % 2 == 0) :print(k - 1 - num[i],end = ' ')\r\n else :print(num[i],end = ' ')\r\n", "p, k=map(int ,input().split())\nans=[]\ncnt=0\nwhile(p):\n if(cnt%2==0):\n ans.append(p%k)\n p-=p%k\n else:\n if(p%k!=0):\n ans.append((k-p%k))\n p+=k-p%k\n else:\n ans.append(0)\n p//=k\n cnt+=1\nprint(len(ans))\nfor k in range(len(ans)):\n print(ans[k], end=\" \")\n \t\t\t \t\t\t\t \t \t\t\t\t\t\t\t\t\t \t \t", "p, k = map(int, input().split())\r\nt = []\r\nwhile p:\r\n t.append(p % k)\r\n p = -(p // k)\r\nprint(len(t), *t)", "p,k=map(int,input().split())\r\nar=[]\r\nwhile p:\r\n ar.append(p%k)\r\n p=-(p//k)\r\nprint(len(ar))\r\nfor i in ar:\r\n print(i,end=' ')\r\n\r\n\r\n\r\n\r\n##//////////////// ////// /////// // /////// // // //\r\n##//// // /// /// /// /// // /// /// //// //\r\n##//// //// /// /// /// /// // ///////// //// ///////\r\n##//// ///// /// /// /// /// // /// /// //// // //\r\n##////////////// /////////// /////////// ////// /// /// // // // //\r\n\r\n\r\n\r\n", "\n\nx, k = map((int), input().split())\n\nanswer = []\n\n\ndef findBit(l, r, x, pwk):\n for i in range(0, k):\n if (l + pwk * i <= x and x <= pwk * i + r):\n return i\n return 0\n\ndef rec(l, r, pwk):\n global x\n global k\n global answer\n nk = pwk * (k - 1)\n stepL = min(0, nk)\n stepR = max(0, nk)\n nl = l + stepL\n nr = r + stepR\n if (nl <= x and x <= nr):\n answer.append(findBit(l, r, x, pwk))\n x -= answer[-1] * pwk\n else:\n rec(nl, nr, pwk * (-k))\n answer.append(findBit(l, r, x, pwk))\n x -= answer[-1] * pwk\n \n\nrec(0, 0, 1)\n\n\nprint(len(answer))\nfor x in reversed(answer):\n print(x, end = ' ')\n \nprint()\n\n\n", "[p,k]=[int(x) for x in input().split()]\r\nd=1\r\nres=[]\r\nwhile p:\r\n\tif d%2==1:\r\n\t\tkek=k\r\n\t\tres.append(str(p%kek))\r\n\t\tp//=kek\r\n\telse:\r\n\t\tkek=k\r\n\t\tlol=kek-(p%kek)\r\n\t\twhile lol>=kek:\r\n\t\t\tlol-=kek\r\n\t\tres.append(str(lol))\r\n\t\tp=(p+lol)//kek\r\n\td+=1\r\nprint(len(res))\r\ns=' '\r\nprint(s.join(res))\r\n\t\t\r\n\t\t", "p, k = map(int, input().split())\r\nt = []\r\nwhile p:\r\n s = (k - 1 - p) // k\r\n t.append(p + s * k)\r\n p = s\r\nprint(len(t), *t)", "import sys\r\nfrom math import *\r\nfrom collections import Counter,defaultdict,deque\r\ninput=sys.stdin.readline\r\nmod=10**9+7\r\ndef get_ints():return map(int,input().split())\r\ndef get_int():return int(input())\r\ndef get_array():return list(map(int,input().split()))\r\ndef input():return sys.stdin.readline().strip()\r\n\r\nn,k=get_ints()\r\nans=[n]\r\nwhile ans[-1]:\r\n ans.append(ans[-1]//k)\r\n ans[-2]%=k\r\nfor i in range(len(ans)):\r\n if i%2==1:\r\n ans[i]*=-1\r\n# print(ans)\r\nans.append(0)\r\nfor i in range(len(ans)-1):\r\n if ans[i]<0:\r\n ans[i]+=k\r\n ans[i+1]+=1\r\n elif ans[i]>=k:\r\n ans[i]-=k\r\n ans[i+1]-=1\r\nwhile ans[-1]==0:\r\n ans.pop()\r\nprint(len(ans))\r\nprint(*ans)", "def negaternary(i, k):\r\n if i == 0:\r\n digits = [0]\r\n else:\r\n digits = []\r\n while i != 0:\r\n i, remainder = divmod(i, -k)\r\n if remainder < 0:\r\n i, remainder = i + 1, remainder + k\r\n digits.append(remainder)\r\n return digits\r\n\r\n\r\np, k = map(int, input().split())\r\nans = negaternary(p, k)\r\n# while (p):\r\n# \tans.append(p % (-k))\r\n# \tp //= (-k)\r\nwhile(ans[-1] == 0):\r\n\tans = ans[::-1]\r\nprint(len(ans))\r\nprint(*ans)", "p, k = map(int, input().split())\nr = [p % k]\np = p // k\nwhile 1:\n if p <= 0 and -p < k:\n break\n p, q = divmod(-p, k)\n r.append(q)\nif p:\n r.append(-p)\nprint(len(r))\nprint(*r, sep=' ')\n", "def converttobase(n,b):\n\tif(-1<=b<=1):\n\t\treturn \"INVALID INPUT\"\n\n\telif(b>1):\n\t\tL=[]\n\t\twhile(n!=0):\n\t\t\tL.append(n%b)\n\t\t\tn=n//b\n\t\treturn L[::-1]\n\telse:\n\t\tL=[]\n\t\twhile(n!=0):\n\t\t\tif(n%b<0):\n\t\t\t\tx=-b+n%b\n\t\t\t\tL.append(x)\n\t\t\t\tn=1+n//b\n\t\t\telse:\n\t\t\t\tL.append(n%b)\n\t\t\t\tn=n//b\t\t\t\n\t\treturn L\n\n\n\nL=list(map(int,input().split()))\nM=converttobase(L[0],-1*L[1])\nprint(len(M))\nprint(*M)\n \t \t \t\t\t \t\t\t\t\t \t \t \t \t", "p, k = map(int, input().split())\r\na = ''\r\ncnt = 0\r\nwhile p != 0:\r\n cnt += 1\r\n a += str(p % k) + ' '\r\n p -= p % k\r\n p //= -k\r\nprint(cnt)\r\nprint(a)\r\n\r\n", "p, k = map(int, input().split())\nr = []\nwhile p:\n r.append(p % k)\n p = -(p // k)\nprint(len(r))\nprint(*r, sep=' ')\n\n\t \t \t\t \t \t \t\t\t\t\t\t \t \t \t\t\t", "def fu(a,b):\r\n r=a%b\r\n if r<0:\r\n r=a%b-b\r\n return [(a-r)//b,r]\r\n\r\np,k=list(map(int,input().split()))\r\ns=[]\r\nwhile 1>0:\r\n a=fu(p,-k)\r\n if a[0]==0:\r\n if a[1]!=0:\r\n s.append(a[1])\r\n break\r\n else:\r\n s.append(a[1])\r\n p=a[0]\r\nprint(len(s))\r\nprint(*s)" ]

[ "n = int(input())\r\nS = list(input())\r\nT = list(input())\r\nindex = 0\r\nfor i in range(n):\r\n if S[i] != T[i]:\r\n index = i\r\n break\r\nS = S[index:]\r\nT = T[index:]\r\nn -= index\r\nindex = 0\r\nfor i in range(n-1, -1, -1):\r\n if S[i] != T[i]:\r\n index = i+1\r\n break\r\nS = S[0:index]\r\nT = T[0:index]\r\nanswer = 0\r\nequals = True\r\nlength = len(S)\r\nfor i in range(1, length):\r\n if S[i] != T[i - 1]:\r\n equals = False\r\nif equals:\r\n answer += 1\r\nequals = True\r\nfor i in range(1, length):\r\n if S[i - 1] != T[i]:\r\n equals = False\r\nif equals:\r\n answer += 1\r\nprint(answer)\r\n", "def rl():\r\n return list(map(int,input().split()))\r\ndef ri():\r\n return int(input())\r\ndef rs():\r\n return input()\r\ndef rm():\r\n return map(int,input().split())\r\ndef check(a,b):\r\n i=0\r\n n=len(b)\r\n while i<n:\r\n if a[i]!=b[i]:break\r\n i+=1\r\n if i==n or b==a[:i]+a[i+1:]:return True\r\n \r\ndef main():\r\n n,s,t=ri(),rs(),rs()\r\n v1,v2=None,None\r\n ans=0\r\n i=0\r\n while i<n and s[i]==t[i]: \r\n i+=1\r\n v1=s[:i]+t[i]+s[i:]\r\n if check(v1,t): ans+=1\r\n v2=t[:i]+s[i]+t[i:]\r\n if v1==v2: return ans\r\n if check(v2,s): ans+=1\r\n return ans\r\n\r\nprint(main())", "n = int(input())\ns, t = input(), input()\n\ni = 0\nwhile s[i] == t[i]:\n i += 1\n\nj = n - 1\nwhile s[j] == t[j]:\n j -= 1\n\nprint(int(s[i + 1:j + 1] == t[i:j]) + int(s[i:j] == t[i + 1:j + 1]))\n", "def aux(s, t):\r\n n = len(s)\r\n lpr = 0\r\n for i in range(n):\r\n if s[i] != t[i]:\r\n break\r\n lpr += 1\r\n\r\n lsf = 0\r\n for i in range(n-1, -1, -1):\r\n if s[i] != t[i]:\r\n break\r\n lsf += 1\r\n\r\n if(lpr == n):\r\n return 2\r\n\r\n return (s[lpr:n-lsf-1] == t[lpr+1:n-lsf]) + (t[lpr:n-lsf-1] == s[lpr+1:n-lsf])\r\n\r\ninput(); print(aux(input(), input()))", "n=int(input())\r\nst1=input()\r\nst2=input()\r\ni=0\r\nwhile st1[i] == st2[i]:\r\n i+=1\r\nj=n-1\r\nwhile st1[j] == st2[j]:\r\n j-=1\r\nprint(int(st1[i+1:j+1] == st2[i:j]) + int(st1[i:j] == st2[i+1:j+1]))", "i, j = 0, int(input()) - 1\r\na, b = input(), input()\r\nwhile a[i] == b[i]: i += 1\r\nwhile a[j] == b[j]: j -= 1\r\nprint((a[i + 1:j + 1] == b[i:j]) + (b[i + 1:j + 1] == a[i:j]))", "import sys\r\n#sys.stdin = open(\"in.txt\")\r\ntry:\r\n while True:\r\n n = int(input())\r\n s1 = input()\r\n s2 = input()\r\n L = 0\r\n R = n-1\r\n while s1[L] == s2[L]:\r\n L += 1\r\n while s1[R] == s2[R]:\r\n R -= 1\r\n res = 0\r\n i = L\r\n while i < R and s1[i] == s2[i+1]:\r\n i += 1\r\n if i >= R:\r\n res += 1\r\n s1, s2 = s2, s1\r\n i = L\r\n while i < R and s1[i] == s2[i+1]:\r\n i += 1\r\n if i >= R:\r\n res += 1\r\n print(res)\r\nexcept EOFError:\r\n pass", "\nn = int(input())\ns1 = input()\ns2 = input()\n\n\nfront = 0\nrear = n-1\n\nwhile s1[front]==s2[front]:\n front += 1\n\nwhile s1[rear]==s2[rear]:\n rear -= 1\n\n\n\nans = 0\nif s1[front+1:rear+1]==s2[front:rear]: ans += 1\nif s1[front:rear]==s2[front+1:rear+1]: ans += 1\nprint(ans)\n\n \n\n\n\n", "from sys import stdin\r\nread = stdin.readline\r\n\r\nn = int(read())\r\nS = read()\r\nT = read()\r\n\r\nfor i in range(n):\r\n if S[i] != T[i]:\r\n break\r\n\r\na = b = 1\r\n\r\nfor j in range(i,n-1):\r\n if S[j] != T[j+1]:\r\n a = (S[j+1:] == T[j+1:])\r\n break\r\n\r\nfor j in range(i,n-1):\r\n if S[j+1] != T[j]:\r\n b = (S[j+1:] == T[j+1:])\r\n break\r\n\r\nprint(a+b)\r\n", "i,j=0,int(input())-1\r\na,b=input(),input()\r\nwhile a[i]==b[i]:i+=1\r\nwhile a[j]==b[j]:j-=1\r\nprint((a[i+1:j+1]==b[i:j])+(b[i+1:j+1]==a[i:j]))", "from math import *\r\n\r\nn=int(input())\r\ns=input()\r\nt=input()\r\n\r\nl=0\r\nr=n-1\r\nfor i in range(n):\r\n\tif(s[i]==t[i]):\r\n\t\tl+=1\r\n\telse:\r\n\t\tbreak\r\nfor i in range(n-1,-1,-1):\r\n\tif(s[i]==t[i]):\r\n\t\tr-=1\r\n\telse:\r\n\t\tbreak\r\n\r\nans=0\r\nif(s[l+1:r+1]==t[l:r]):\r\n\tans+=1\r\nif(s[l:r]==t[l+1:r+1]):\r\n\tans+=1\r\n\r\nprint(ans)\r\n", "def check(w, s):\r\n j = 0\r\n for i in range(len(s)):\r\n while j < len(w) and s[i] != w[j]:\r\n j += 1\r\n if j >= len(w) or s[i] != w[j]:\r\n return False\r\n j += 1\r\n return True\r\n\r\nn = int(input())\r\ns = input()\r\nt = input()\r\nst = []\r\ni = 0\r\nwhile i < n and s[i] == t[i]:\r\n st.append(s[i])\r\n i += 1\r\nw1 = st[:]\r\nw2 = st[:]\r\nw3 = st[:]\r\nw4 = st[:]\r\nw1.append(s[i])\r\nw1.append(t[i])\r\nw3.append(s[i])\r\nw3.append(t[i])\r\nw2.append(t[i])\r\nw2.append(s[i])\r\nw4.append(t[i])\r\nw4.append(s[i])\r\nfor j in range(i + 1, n):\r\n w1.append(s[j])\r\n w2.append(t[j])\r\n w3.append(t[j])\r\n w4.append(s[j])\r\n\r\nres = set()\r\nfor ww in (w1, w2, w3, w4):\r\n www = ''.join(ww)\r\n if check(www, s) and check(www, t):\r\n res.add(www)\r\nprint(len(res))", "import math\r\nfrom sys import stdin, stdout\r\ntest = 1\r\n#test = int(input())\r\nfor _ in range(test):\r\n n = int(input())\r\n s = input()\r\n t = input()\r\n #longest common subsequence = n-1\r\n i = 0\r\n while s[i] == t[i]:\r\n i+=1\r\n j = n-1\r\n while s[j] == t[j]:\r\n j-=1\r\n forward = True\r\n tempi = i\r\n tempj = j-1\r\n while tempi < j:\r\n if s[tempi] == t[tempi+1]:\r\n tempi+=1\r\n else:\r\n forward = False\r\n break\r\n backward = True\r\n while tempj >= i:\r\n if s[tempj+1] == t[tempj]:\r\n tempj-=1\r\n else:\r\n backward = False\r\n break\r\n print(forward+backward)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \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\n\nn = int(sys.stdin.readline())\ns = sys.stdin.readline().strip()\nt = sys.stdin.readline().strip()\n\ncan1 = 1\ncan2 = 1\nft = -1\nfor i in range(n):\n\tif s[i] != t[i]:\n\t\tft = i\n\t\tbreak\n\ndef check(ft, s, t):\n\tlt = n-1\n\tfor i in range(ft, n-1):\n\t\tif s[i] != t[i+1]:\n\t\t\tlt = i\n\t\t\tbreak\n\tfor i in range(lt + 1, n):\n\t\tif s[i] != t[i]:\n\t\t\treturn 0\n\treturn 1\n\nprint(check(ft, s, t) + check(ft, t, s))" ]

[ "import sys\r\n\r\ndef rd(): return sys.stdin.readline().strip()\r\ndef rdl(typ,sep=\" \"): return list(map(typ, rd().split(sep)))\r\ndef wt(x,sep=\"\\n\") : sys.stdout.write(str(x) + sep) # string / num\r\n\r\ndef treeOrdering2(n, adjList, root=0): # order by depth\r\n order = []\r\n stack = [root]\r\n while stack:\r\n curr = stack.pop()\r\n order.append(curr)\r\n for adj in adjList[curr]:\r\n stack.append(adj)\r\n return order\r\n\r\n\r\n# >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>\r\n''' ॐॐ _/\\_ हर हर महादेव _/\\_ ॐॐ '''\r\n\r\n# sys.setrecursionlimit(300_005)\r\n# mod = 10**9 + 7\r\n\r\nINF = 10**18\r\nn = 0\r\nC = D = dp0 = dp1 = dp2 = adjList = []\r\n# size = []\r\n\r\n\r\ndef merge(dpu, dpv):\r\n global n,C,D,dp0,dp1,dp2,adjList\r\n\r\n merged = [INF]*(len(dpu)+len(dpv)-1)\r\n\r\n for i in range(len(dpu)):\r\n for j in range(len(dpv)):\r\n merged[i+j] = min(merged[i+j], dpu[i] + dpv[j])\r\n\r\n return merged \r\n \r\n\r\n\r\ndef dfs(root, par):\r\n global n,C,D,dp0,dp1,dp2,adjList\r\n\r\n order = treeOrdering2(n, adjList, 0) \r\n for root in order[::-1]:\r\n dp0[root] = [0, C[root]] # don't buy root at C can use dis , buy\r\n dp1[root] = [INF, C[root]-D[root]] # don't buy root at dis so no more disc , buy\r\n \r\n for child in adjList[root]:\r\n dp0[root] = merge(dp0[root], dp0[child]) # if can't use disc at root can't use disc at child\r\n dp1[root] = merge(dp1[root], dp2[child]) # if use disc at root can/can't use disc at child\r\n # build the result for root can or can't use disc at root purchased j\r\n dp2[root] = [min(dp0[root][i], dp1[root][i]) for i in range(len(dp0[root]))]\r\n\r\n\r\n\r\n# dp[i][j] : rooted at i purchased j\r\ndef solve():\r\n global n,C,D,dp0,dp1,dp2,adjList\r\n n,B = rdl(int)\r\n C = [0]*(n+1)\r\n D = [0]*(n+1)\r\n\r\n adjList = [[] for _ in range(n+1)]\r\n for i in range(n):\r\n if i == 0:\r\n C[i], D[i] = rdl(int)\r\n continue\r\n C[i], D[i] , par = rdl(int)\r\n par -= 1\r\n adjList[par].append(i)\r\n # adjList[i].append(par)\r\n ## ----------------------------------------- \r\n dp0 = [[] for _ in range(n+1)] # without the discount \r\n dp1 = [[] for _ in range(n+1)] # using the discount \r\n dp2 = [[] for _ in range(n+1)] # overall result\r\n\r\n dfs(0, -1)\r\n\r\n res = -INF\r\n for j in range(len(dp2[0])) :\r\n if dp2[0][j] <= B :\r\n res = max(res,j)\r\n\r\n return res\r\n \r\n \r\n\r\n# Don't forget the mod and recursion limit\r\n\r\nwt(solve())\r\n", "import sys\r\nreadline=sys.stdin.readline\r\n\r\nN,B=map(int,readline().split())\r\nD,C=[],[]\r\nc,d=map(int,readline().split())\r\nD.append(d)\r\nC.append(c)\r\nchild=[[] for x in range(N)]\r\nfor i in range(1,N):\r\n c,d,p=map(int,readline().split())\r\n p-=1\r\n D.append(d)\r\n C.append(c)\r\n child[p].append(i)\r\nqueue=[0]\r\ntour=[]\r\nwhile queue:\r\n x=queue.pop()\r\n tour.append(x)\r\n for y in child[x]:\r\n queue.append(y)\r\ninf=1<<60\r\ndp0,dp1=[None]*N,[None]*N\r\nfor x in tour[::-1]:\r\n dp0[x]=[0,C[x]]\r\n dp1[x]=[inf,C[x]-D[x]]\r\n for y in child[x]:\r\n len_x=len(dp0[x])\r\n len_y=len(dp0[y])\r\n prev0=dp0[x]\r\n prev1=dp1[x]\r\n dp0[x]=[inf]*(len_x+len_y-1)\r\n dp1[x]=[inf]*(len_x+len_y-1)\r\n for i in range(len_x):\r\n for j in range(len_y):\r\n dp0[x][i+j]=min(dp0[x][i+j],prev0[i]+dp0[y][j])\r\n dp1[x][i+j]=min(dp1[x][i+j],prev1[i]+min(dp0[y][j],dp1[y][j]))\r\nans=0\r\nfor i in range(N+1):\r\n if dp0[0][i]<=B or dp1[0][i]<=B:\r\n ans=max(ans,i)\r\nprint(ans)" ]

[ "read = lambda: map(int, input().split())\r\nn = int(input())\r\na = list(read())\r\nb = list(read())\r\nA, B = [], []\r\ni = a.index(1)\r\nwhile len(A) < n:\r\n if a[i]: A.append(a[i])\r\n i = (i + 1) % n\r\ni = b.index(1)\r\nwhile len(B) < n:\r\n if b[i]: B.append(b[i])\r\n i = (i + 1) % n\r\nans = 'YES' if A == B else 'NO'\r\nprint(ans)\r\n", "N = int(input()) #количество островов\r\nA = list(map(int,input().split()))\r\nB = list(map(int,input().split()))\r\nA.remove(0)\r\nB.remove(0)\r\nind_b = B.index(A[0])\r\nR = B[ind_b:] + B[0:ind_b]\r\nif A == R:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "read = lambda: map(int, input().split())\r\nn = int(input())\r\na = list(read())\r\nb = list(read())\r\nA, B = [], []\r\ni = k = 0\r\nwhile a[i] != 1: i += 1\r\nwhile k < n:\r\n if a[i]: A.append(a[i])\r\n i = (i + 1) % n\r\n k += 1\r\ni = k = 0\r\nwhile b[i] != 1: i += 1\r\nwhile k < n:\r\n if b[i]: B.append(b[i])\r\n i = (i + 1) % n\r\n k += 1\r\nans = 'YES' if A == B else 'NO'\r\nprint(ans)\r\n", "def main():\n input()\n aa = input().split()\n bb = input().split()\n aa.remove(\"0\")\n bb.remove(\"0\")\n a = aa.index(\"1\")\n b = bb.index(\"1\")\n print((\"NO\", \"YES\")[aa[a:] + aa[:a] == bb[b:] + bb[:b]])\n\n\nif __name__ == '__main__':\n main()\n", "import math, re, sys, string, operator, functools, fractions, collections\nsys.setrecursionlimit(10**7)\nRI=lambda x=' ': list(map(int,input().split(x)))\nRS=lambda x=' ': input().rstrip().split(x)\ndX= [-1, 1, 0, 0,-1, 1,-1, 1]\ndY= [ 0, 0,-1, 1, 1,-1,-1, 1]\nmod=int(1e9+7)\neps=1e-6\npi=math.acos(-1.0)\nMAX=200010\n#################################################\nn=RI()[0]\na=RI()\nb=RI()\na=[i for i in a if i]\nb=[i for i in b if i]\nif len(a)!=len(b) or (len(a)==n and a!=b):\n print(\"NO\")\n sys.exit(0)\nID=[0]*MAX\nfor i in range(len(a)):\n ID[a[i]]=(a[i-1],a[(i+1)%len(a)])\nfor i in range(len(b)):\n if ID[b[i]]!=(b[i-1],b[(i+1)%len(b)]):\n print(\"NO\")\n sys.exit(0)\nprint(\"YES\")\n\n\n\n\n\n\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nb = [int(i) for i in input().split()]\r\nfl = True\r\nfor i in range(n):\r\n if a[i] == 0:\r\n a.pop(i)\r\n break\r\nfor i in range(n):\r\n if b[i] == 0:\r\n b.pop(i)\r\n break\r\nfor i in range(n):\r\n if b[i] == a[0]:\r\n c = i\r\n break\r\nfor i in range(c + 1, n - 1):\r\n if b[i] != a[i - c]:\r\n fl = False\r\nfor i in range(c):\r\n if b[i] != a[n - c + i - 1]:\r\n fl = False\r\nif fl:\r\n print('YES')\r\nelse:\r\n print('NO')", "input()\r\nf=lambda:(' '+input()).replace(' 0','')\r\na,b=f(),f()\r\nprint('YES' if a in b+b else 'NO')", "n = int(input())\r\n\r\na = list(map(int,input().split()))\r\na.remove(0)\r\nb = list(map(int,input().split()))\r\nb.remove(0)\r\nstart = b.index(a[0])\r\nfor i in range(n-1):\r\n if a[i] != b[(i+start)%(n-1)]: \r\n print('NO')\r\n exit(0)\r\nprint('YES')\r\n ", "from sys import stdin\r\na=int(stdin.readline())\r\nb=input().replace(' ','').replace('0','')\r\nc=input().replace(' ','').replace('0','')\r\nif b in 2*c:print(\"YES\")\r\nelse:print(\"NO\")", "input()\r\nf = lambda: (' ' + input()).replace(' 0', '')\r\na, b = f(), f()\r\nprint('YES' if a in b + b else 'NO')", "n = int(input())\nps = list(map(int, input().split()))\nqs = list(map(int, input().split()))\n\nps.remove(0)\nqs.remove(0)\n\ni = qs.index(ps[0])\nif ps == qs[i:] + qs[:i]:\n print('YES')\nelse:\n print('NO')\n", "no_islands = int(input())\r\ninitial = input().split()\r\nfinal = input().split()\r\ninitial.remove('0')\r\nfinal.remove('0')\r\n\r\nfirst = initial.index(final[0])\r\nif initial[first:] + initial[:first] == final:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "#n,m,k = map(int, input().strip().split(' '))\r\nn=int(input())\r\na = list(map(int, input().strip().split(' ')))\r\nb = list(map(int, input().strip().split(' ')))\r\nif n==2 or n==3:\r\n print('YES')\r\nelse:\r\n del a[a.index(0)]\r\n del b[b.index(0)]\r\n p1=a[0]\r\n c=[]\r\n ind=b.index(p1)\r\n c=b[ind:]+b[:ind]\r\n if c==a:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\n\r\n \r\n ", "n = int(input())\r\nres = True\r\nl = list(map(int, input().split()))\r\nm = list(map(int, input().split()))\r\nl.remove(0)\r\nm.remove(0)\r\nt = m.index(l[0])\r\nfor i in range(n - 1):\r\n if l[i] != m[(i + t) % (n - 1)]:\r\n res = False\r\nif res:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n", "# You lost the game.\nn = int(input())\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\nL = []\ne = A.index(1)\nfor i in range(n):\n if A[e] > 0:\n L += [A[e]]\n e += 1\n if e == n:\n e = 0\nL2 = []\ne = B.index(1)\nfor i in range(n):\n if B[e] > 0:\n L2 += [B[e]]\n e += 1\n if e == n:\n e = 0\nif L == L2:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "input()\nl1 = [int(x) for x in input().split() if x != \"0\"];\nl2 = [int(x) for x in input().split() if x != \"0\"];\nm = len(l1)\nx = l1.index(l2[0]);\nb = True\nfor i in range(len(l1)):\n b &= l2[i] == l1[(x+i)%m];\nprint(\"YES\" if b else \"NO\")\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\na.remove(0)\r\nb.remove(0)\r\npos = a.index(b[0])\r\ncol = 0\r\nf = True\r\nfor i in range(n - 1):\r\n if a[pos] != b[col]:\r\n f = False\r\n break\r\n else:\r\n col += 1\r\n pos = (pos + 1) % (n - 1)\r\nif f:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n \r\n", "i=int(input())\r\na=''.join([x for x in input().split() if x!='0'])\r\nb=''.join([x for x in input().split() if x!='0'])\r\nprint('YES' if a in b+b else 'NO')", "readInts=lambda: list(map(int, input().split()))\r\n\r\nn=int(input())\r\na=readInts()\r\na.remove(0)\r\nb=readInts()\r\nb.remove(0)\r\npos=a.index(b[0])\r\na=a[pos:]+a[:pos]\r\nprint('YES' if a==b else 'NO')", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\na.remove(0)\r\nb.remove(0)\r\n\r\nprint(('NO', 'YES')[''.join(map(str, b)) in ''.join(map(str, a + a))])\r\n", "from bisect import bisect\n\nn = int(input())\nstatues = [int(x) for x in input().split()]\nnew_statues = [int(x) for x in input().split()]\nstatues.remove(0)\nnew_statues.remove(0)\nshift = new_statues.index(1) - statues.index(1)\nprint('YES' if all((statues[i] == new_statues[(i+shift) % (n-1)] for i in range(n-1))) else 'NO')\n", "n = int(input())-1\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\na.remove(0)\r\nb.remove(0)\r\nret = True\r\na_i = a.index(1)\r\nb_i = b.index(1)\r\nfor i in range(n):\r\n if a[(a_i + i) % n] != b[(b_i + i) % n]:\r\n ret = False\r\n break\r\nif ret:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "from collections import deque\r\nn = int(input()) - 1\r\na = list(filter(lambda x: x != 0, map(int, input().split())))\r\nb = list(filter(lambda x: x != 0, map(int, input().split())))\r\n\r\nlom = b.index(a[0])\r\nif (a[:n-lom] == b[lom:] and a[n-lom:] == b[:lom]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\n\r\nnow = [int(i) for i in input().split()]\r\n\r\ntarget = [int(i) for i in input().split()]\r\n\r\nnow_re = [i for i in now if i]\r\ntarget_re = [i for i in target if i]\r\n\r\ntarget_re = target_re[target_re.index(now_re[0]):] + target_re[:target_re.index(now_re[0])]\r\n\r\nif len(now_re) != len(target_re):\r\n print('NO')\r\nelse:\r\n for i in range(len(now_re)):\r\n if not now_re[i] == target_re[i]:\r\n print('NO')\r\n break\r\n else:\r\n print('YES')", "n = int(input())\r\nl1 = list(map(int, input().split()))\r\nl2 = list(map(int, input().split()))\r\n \r\nfor k in range(n):\r\n if l1[k] == 0:\r\n l1 = l1[:k] + l1[k + 1:]\r\n break\r\nfor k in range(n):\r\n if l2[k] == 0:\r\n l2 = l2[:k] + l2[k + 1:]\r\n break\r\n \r\ni = 0\r\nj = 0\r\nans = True\r\nfor k in range(n - 1):\r\n if l1[k] == 1:\r\n i = k\r\n if l2[k] == 1:\r\n j = k\r\n \r\nfor k in range(n - 1):\r\n if l1[(i + k) % (n - 1)] != l2[(j + k) % (n - 1)]:\r\n ans = False\r\n break\r\n \r\nif ans:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\nimport time\n\n# = input()\nn = int(input())\n\na = [int(i) for i in input().split()]\nb = [int(i) for i in input().split()]\n\nstart = time.time()\n\nz = a.index(0)\na = a[0:z]+a[z+1:]\n\nz = b.index(0)\nb = b[0:z]+b[z+1:]\n\nz = b.index(a[0])\nb = b[z:]+b[:z]\n\nans = 'YES'\nfor i in range(n-1):\n if a[i]!= b[i]:\n ans = 'NO'\n break\n\nprint(ans)\nfinish = time.time()\n#print(finish - start)\n", "n = int(input())\ns1 = list(input().strip().split())\ns2 = list(input().strip().split())\ns1.remove('0')\ns2.remove('0')\ns1 = ''.join(s1)\ns2 = ''.join(s2)\ns1 = s1+s1\nif s2 in s1:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "n = int(input())\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\n\nx = A.index(1)\ny = B.index(1)\nz = 0\nfor i in range(n):\n x += A[(x + i) % n] == 0\n y += B[(y + i) % n] == 0\n z += A[(x + i) % n] == B[(y + i) % n]\n#print(z)\nif z == n:\n print('YES')\nelse:\n print('NO')", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\na = input()[:-1].replace('0','').replace(' ','') * 2\r\nb = input()[:-1].replace('0','').replace(' ','')\r\nprint(['NO', 'YES'][b in a])", "import sys\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nst = set()\r\nidx = 0\r\n\r\ni = 0\r\nj = 0\r\nwhile i < n and a[i] == 0: i += 1\r\nwhile j < n and a[i] != b[j]: j += 1\r\n\r\nb = b[j:] + b[:j] \r\nj = 0\r\nwhile i < n:\r\n if a[i] != 0:\r\n while j < n and b[j] == 0: j += 1\r\n if b[j] != a[i] or j == n:\r\n print('NO')\r\n sys.exit(0)\r\n j += 1\r\n i += 1\r\nprint('YES')\r\n \r\n", "from collections import deque\ninput()\na = deque()\nb = deque()\ntemp = map(int, input().split(' '))\nfor i in temp:\n\tif i > 0:\n\t\ta.append(i)\ntemp = map(int, input().split(' '))\nfor i in temp:\n\tif i > 0:\n\t\tb.append(i)\nwhile a[0] != b[0]:\n\ta.appendleft(a.pop())\nif a == b:\n\tprint('YES')\nelse:\n\tprint('NO')", "class CodeforcesTask635BSolution:\n def __init__(self):\n self.result = ''\n self.n = 0\n self.curr = []\n self.need = []\n\n def read_input(self):\n self.n = int(input()) - 1\n self.curr = [int(x) for x in input().split(\" \") if int(x)]\n self.need = [int(x) for x in input().split(\" \") if int(x)]\n\n def process_task(self):\n neighbours1 = {}\n neighbours2 = {}\n for x in range(self.n - 1):\n neighbours1[str(self.curr[x])] = (self.curr[x - 1], self.curr[x + 1])\n neighbours2[str(self.need[x])] = (self.need[x - 1], self.need[x + 1])\n neighbours1[str(self.curr[self.n - 1])] = (self.curr[self.n - 2], self.curr[0])\n neighbours2[str(self.need[self.n - 1])] = (self.need[self.n - 2], self.need[0])\n #print(neighbours1, neighbours2)\n canbe = True\n for p in self.curr:\n if neighbours1[str(p)] != neighbours2[str(p)]:\n canbe = False\n break\n self.result = \"YES\" if canbe else \"NO\"\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask635BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "#! Python3\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nl2 = []\r\nl1 = []\r\ni = 0\r\nind = a.index(0)\r\nwhile(ind != n):\r\n l1.append(a[ind])\r\n ind = ind+1\r\nwhile(len(l1) != n):\r\n l1.append(a[i])\r\n i += 1\r\n\r\ni=0\r\nl3 = []\r\nind = b.index(0)\r\nwhile(ind != n):\r\n l3.append(b[ind])\r\n ind = ind+1\r\nwhile(len(l3) != n):\r\n l3.append(b[i])\r\n i += 1\r\n\r\ni=0\r\nind = l3.index(l1[1])\r\nwhile(ind != n):\r\n l2.append(l3[ind])\r\n ind = ind+1\r\nwhile(len(l2) != n-1):\r\n if l3[i] != 0:\r\n l2.append(l3[i])\r\n i += 1\r\n\r\nif(l1[1:] == l2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n, a, b = int(input()), list(map(int, input().split())), list(map(int, input().split()))\r\na.remove(0)\r\nb.remove(0)\r\ni = a.index(b[0])\r\nprint('YES' if a[i:] + a[:i] == b else 'NO')", "import io\nimport sys\nimport time\nimport random\n#~ start = time.clock()\n#~ test = '''3\n#~ 1 0 2\n#~ 2 0 1'''\n#~ test = '''2\n#~ 1 0\n#~ 0 1'''\n#~ test = '''4\n#~ 1 2 3 0\n#~ 0 3 2 1'''\n\n#~ sys.stdin = io.StringIO(test)\n\nn = int(input())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\n\ndef normalize(a):\n '''Get rid of zero, move around elements to make element 1 the first'''\n zeropos = a.index(0)\n del a[zeropos]\n ret = a[:]\n n = len(a)\n count = 0\n zeropos = a.index(1)\n for i in range(zeropos,n):\n ret[count] = a[i]\n count += 1\n for i in range(0,zeropos):\n ret[count+i] = a[i]\n return ret\n \n#~ print(normalize(a))\n#~ print(normalize(b))\n \n \nprint( \"YES\" if normalize(a)==normalize(b) else \"NO\" )\n \n\n#~ dur = time.clock()-start\n#~ print(\"Time:\",dur)\n", "#!/usr/bin/python3\n\ndef main():\n number_islands = int(input())\n current_order = tuple(map(int, input().split()))\n desired_order = tuple(map(int, input().split()))\n\n print(\"YES\" if rotation_of(current_order, desired_order) else \"NO\")\n\ndef rotation_of(seq1, seq2):\n if len(seq1) != len(seq2):\n return False\n elif len(seq1) == 0:\n return True\n\n seq1 = list(seq1)\n seq2 = list(seq2)\n seq1.remove(0)\n seq2.remove(0)\n seq1 = ''.join((str(_) for _ in seq1))\n seq2 = ''.join((str(_) for _ in seq2))\n\n\n return seq2 in (seq1 + seq1)\n\n\n\nif __name__ == '__main__':\n main()\n\n\n\n\n", "def run():\n n = int(input())\n a = [int(i) for i in input().split()]\n b = [int(i) for i in input().split()]\n\n i = a.index(1) \n j = b.index(1) \n ok = True\n cont = 0\n while cont < n:\n if(a[i] != b[j]):\n ok = False\n break\n i = (i + 1)%n\n j = (j + 1)%n\n \n if(a[i] == 0):\n i = (i + 1)%n\n if(b[j] == 0):\n j = (j + 1)%n\n\n cont +=1\n \n print('YES' if ok else 'NO')\n\n\n\nif __name__ == \"__main__\":\n run()", "import sys\nn = int(input())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\nst = set()\nidx = 0\n\ni = 0\nj = 0\nwhile i < n and a[i] == 0: i += 1\nwhile j < n and a[i] != b[j]: j += 1\n\nb = b[j:] + b[:j] \nj = 0\nwhile i < n:\n if a[i] != 0:\n while j < n and b[j] == 0: j += 1\n if b[j] != a[i] or j == n:\n print('NO')\n sys.exit(0)\n j += 1\n i += 1\nprint('YES')\n \n", "#!/usr/bin/env python3\n\nn = int(input())\na = [int(x) for x in input().split() if x != '0']\nb = [int(x) for x in input().split() if x != '0']\n\n# print(repr(a))\n# print(repr(b))\n\nfor i in range(0, len(b)):\n if b[i] == a[0]:\n break\n\n# print('i == {0}'.format(i))\n\nresult = True\nk = 0\nfor j in range(i, len(b)):\n # print('b[{0}] == {1}, a[{2}] == {3}'.format(j, b[j], k, a[k]))\n if b[j] != a[k]:\n result = False\n break\n k += 1\n\nif result:\n for j in range(0, i):\n # print('b[{0}] == {1}, a[{2}] == {3}'.format(j, b[j], k, a[k]))\n if b[j] != a[k]:\n result = False\n break\n k += 1\n\nif result:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\na.remove(0)\r\nb.remove(0)\r\n\r\n\r\ni = b.index(a[0])\r\nif (a == b[i:] + b[:i]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "#!/usr/bin/python3.5\r\nn=int(input())\r\na=input().split()\r\nb=input().split()\r\na.remove('0')\r\nb.remove('0')\r\nk=a.index(b[0])\r\na=a[k:]+a[:k]\r\nif a==b:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\r\nbefore = list(map(int, input().split()))\r\nafter = list(map(int, input().split()))\r\nbefore.pop(before.index(0))\r\nafter.pop(after.index(0))\r\nindex = after.index(before[-1])\r\nn -= 1\r\nfor i in range(1, n):\r\n if after[(index - i + 1) % n] != before[-i % n]:\r\n print('No')\r\n break\r\nelse:\r\n print('Yes')\r\n", "import sys\r\nn = int(input())\r\na = []\r\nb = []\r\nx = map(int, input().split())\r\nfor i in x:\r\n if i > 0:\r\n a.append(i)\r\nx = map(int, input().split())\r\nfor i in x:\r\n if i > 0:\r\n b.append(i)\r\nn = n - 1\r\nfor i in range(0, n):\r\n if b[i] == a[0]:\r\n for j in range(0, n):\r\n if a[j] != b[(i + j) % n]:\r\n print(\"NO\")\r\n sys.exit(0)\r\n break\r\nprint(\"YES\")", "import sys \r\ninput = sys.stdin.buffer.readline\r\n\r\n\r\ndef process(A, B):\r\n n = len(A)\r\n a0 = None \r\n b0 = None\r\n for i in range(n):\r\n if A[i]==1:\r\n a0 = i \r\n if B[i]==1:\r\n b0 = i \r\n A = A[a0:]+A[:a0]\r\n B = B[b0:]+B[:b0]\r\n A = [x for x in A if x > 0]\r\n B = [x for x in B if x > 0]\r\n if A==B:\r\n answer = 'YES'\r\n else:\r\n answer = 'NO'\r\n sys.stdout.write(f'{answer}\\n')\r\n return \r\n\r\nn = int(input())\r\nA = [int(x) for x in input().split()]\r\nB = [int(x) for x in input().split()]\r\nprocess(A, B)", "n = int(input())\r\nper = list(map(int, input().split()))\r\nper2 = list(map(int, input().split()))\r\nper.pop(per.index(0))\r\nper2.pop(per2.index(0))\r\ncou = 0\r\nans = 0\r\nfor j in range(n-1):\r\n if per[0] == per2[j]:\r\n cou = j\r\n break\r\nfor i in range(n-1):\r\n if per[i] != per2[cou]:\r\n ans = 1\r\n break\r\n else:\r\n if cou < n-2:\r\n cou+=1\r\n else:\r\n cou = 0\r\nif ans == 0:\r\n print('YES')\r\nelse:\r\n print('NO')" ]