Datasets:

---

mlfoundations-dev

/

Codeforces-Python-Submissions_processed

like 0

Follow

ML Foundations Development 67

[ "import sys\n#sys.stdin = open(\"input.txt\", \"r\")\n\na = [-1]*91\nb = [0]*91\ni = 0\nfor c in input():\n c = ord(c)\n b[c] += a[c] < 0 or i != a[c]\n a[c] = i\n i ^= 1\nprint(max(b))\n ", "t = {}\nfor i, c in enumerate(input()):\n if c not in t: t[c] = (i, 1)\n elif (t[c][0] - i) & 1: t[c] = (i, t[c][1] + 1)\nprint(max(b for a, b in t.values()))" ]

[ "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef f(a):\r\n return a*(a-1)//2\r\n\r\n\r\nn, m = map(int, input().split())\r\nd = [[] for _ in range(n+1)]\r\nc = 0\r\nfor _ in range(m):\r\n a, b = map(int, input().split())\r\n d[a].append(b)\r\nfor i in range(1, n+1):\r\n q = dict()\r\n for j in d[i]:\r\n for l in d[j]:\r\n if l not in q:\r\n q[l] = 1\r\n else:\r\n q[l] += 1\r\n for j in q:\r\n if j != i:\r\n c += f(q[j])\r\nprint(c)", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom collections import defaultdict\r\nimport math\r\n\r\nN,M = map(int, input().split())\r\nP = [[] for _ in range(N)]\r\nfor _ in range(M):\r\n a,b = map(int, input().split())\r\n a-=1;b-=1\r\n P[a].append(b)\r\n \r\nlib = defaultdict(int)\r\n\r\ndef deal(idx):\r\n v = [(idx,-1,0)]\r\n while v:\r\n i,p,d = v.pop()\r\n if d==2:\r\n lib[(idx,i)]+=1\r\n continue\r\n \r\n for j in P[i]:\r\n if j==p:continue\r\n v.append((j,i,d+1))\r\n\r\nfor i in range(N):\r\n deal(i)\r\n \r\nans = 0\r\nfor v in lib.values():\r\n if v>1:\r\n ans+=math.comb(v,2)\r\nprint(ans)\r\n \r\n \r\n\r\n\r\n " ]

[ "n=int(input())\r\nstring = input()\r\nq1,q2,B,C=[],[],[],[]\r\nA=0\r\nfor i in range(n):\r\n if string[i] == \"D\":\r\n q1.append(i)\r\n else:\r\n q2.append(n-1-i)\r\n\r\nfor i in range(len(q1)):\r\n A+=(q1[i]-i)*2+1\r\n B.append(A)\r\n\r\nA=0\r\ntemp = []\r\nfor i in range(len(q2)):\r\n A+=(q2[len(q2)-1-i]-i)*2+1\r\n C.append(A)\r\nC.reverse()\r\n\r\nB=list(map(str,B+C))\r\nprint(\" \".join(B))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n" ]

[ "n=int(input())\r\nl=list(map(int,input().split()))\r\nif n==1 and l[0]!=15 and l[0]!=0 :\r\n print(-1)\r\nelse :\r\n if l[n-1]==15 :\r\n print('DOWN')\r\n if l[n-1]==0 :\r\n print('UP')\r\n if l[n-1]!=15 and l[n-1]!=0 and n!=1 :\r\n if l[n-1]-l[n-2]>0 :\r\n print('UP')\r\n else :\r\n print('DOWN')\r\n \r\n \r\n\r\n", "n = int(input())\r\nlst = [int(x) for x in input().split()]\r\nif lst[-1] is 15:\r\n print(\"DOWN\")\r\nelif lst[-1] is 0:\r\n print(\"UP\")\r\nelif n is 1:\r\n print(\"-1\")\r\nelif lst[-1] > lst[-2]:\r\n print(\"UP\")\r\nelse:\r\n print(\"DOWN\")", "from sys import exit\r\n\r\nn=int(input())\r\nd=[int(z) for z in input().split()]\r\nif d[-1]==0:\r\n print(\"UP\")\r\n exit(0)\r\nif d[-1]==15:\r\n print(\"DOWN\")\r\n exit(0)\r\nif n==1:\r\n print(-1)\r\n exit(0)\r\nif d[-1]>d[-2]:\r\n print(\"UP\")\r\n exit(0)\r\nprint(\"DOWN\")", "n=int(input())\r\nlst = list(map(int, input().strip().split(' ')))\r\nif lst[-1]==15:\r\n print('DOWN')\r\nelif lst[-1]==0:\r\n print('UP')\r\nelif n==1:\r\n print('-1')\r\nelse:\r\n if lst[-1]<lst[-2]:\r\n print('DOWN')\r\n else:\r\n print('UP')", "n=int(input())\r\na=list(map(int,input().split()))\r\nif n==1:\r\n if a[0]==15:print('DOWN')\r\n elif a[0]==0:print('UP')\r\n else:print(-1)\r\nelse:\r\n if a[n-1]>a[n-2]:\r\n if a[n-1]==15:print('DOWN')\r\n else:print('UP')\r\n else:\r\n if a[n-1]==0:print('UP')\r\n else:print('DOWN')\r\n", "n = int(input())\nday = [int(x) for x in input().split()][:n]\nif day[-1] == 0: print('UP')\nelif day[-1] == 15: print('DOWN')\nelif n == 1: print(-1)\nelif day[-1] > day[-2]: print('UP')\nelse: print('DOWN')\n\t\t\t \t\t \t \t \t \t \t\t \t", "a = int (input ());\r\nb = input ().split ();\r\nerror = 0;\r\nif (b [a - 1] == \"0\"):\r\n print (\"UP\");\r\n error = 1;\r\nif (b [a - 1] == \"15\"):\r\n print (\"DOWN\");\r\n error = 1;\r\nif ((a == 1) and (error == 0)):\r\n print (\"-1\");\r\n error = 1;\r\nif (error == 0):\r\n if (int (b [a - 1]) < int (b [a - 2])) :\r\n print (\"DOWN\");\r\n else:\r\n print (\"UP\");\r\n", "n = input()\r\nobsv = [int(x) for x in input().split()]\r\nif obsv[-1] == 15:\r\n print(\"DOWN\")\r\nelif obsv[-1] == 0:\r\n print(\"UP\")\r\nelif n == \"1\":\r\n print(-1)\r\nelif obsv[-1] > obsv[-2]:\r\n print(\"UP\")\r\nelse:\r\n print(\"DOWN\")", "arr = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1]\r\n\r\nn = int(input())\r\nprr = [int(x) for x in input().split()]\r\nif(n==1):\r\n a = prr[0]\r\n if(a==0):\r\n print('UP')\r\n elif(a==15):\r\n print('DOWN')\r\n else:\r\n print(-1)\r\nelse:\r\n a,b = prr[n-2],prr[n-1]\r\n c = b-a\r\n if(c==1):\r\n if(b!=15):\r\n print('UP')\r\n else:\r\n print('DOWN')\r\n else:\r\n if(b!=0):\r\n print('DOWN')\r\n else:\r\n print('UP')", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Dec 23 13:36:54 2017\r\n\r\n@author: admin\r\n\"\"\"\r\n\r\nn = int(input())\r\nrecord = [int(x) for x in input().split()]\r\nif record[-1] == 0:\r\n print('UP')\r\nelif record[-1]==15:\r\n print('DOWN')\r\nelif n == 1:\r\n print(-1)\r\nelif record[-1]>record[-2]:\r\n print('UP')\r\nelse:\r\n print('DOWN')\r\n ", "n = input()\r\nn = int(n)\r\n\r\narray = list(map(int,input().split()))\r\nup = \"UP\"\r\ndown = \"DOWN\"\r\nimpos = \"-1\"\r\n\r\nif(len(array) == 1):\r\n if(array[0] == 0):\r\n print(up)\r\n elif(array[0] == 15):\r\n print(down)\r\n else :\r\n print(impos)\r\nelse :\r\n if(array[-1] == 0):\r\n print(up)\r\n elif(array[-1] == 15):\r\n print(down)\r\n elif (array[-1] > array[-2]) :\r\n print(up)\r\n else :\r\n print(down)", "input()\r\nmoon = [int(z) for z in input().split()]\r\nmoon = moon [::-1]\r\nif(moon.__len__()<2):\r\n\tif(moon[0] == 0):\r\n\t\tprint('UP')\r\n\telif(moon[0] == 15):\r\n\t\tprint('DOWN')\r\n\telse:\r\n\t\tprint(-1)\r\nelse:\r\n\tif(moon[0] == 15):\r\n\t\tprint('DOWN')\r\n\telif(moon[0] == 0):\r\n\t\tprint('UP')\r\n\telif(moon[0] > moon[1]):\r\n\t\tprint('UP')\r\n\telif(moon[1] > moon[0]):\r\n\t\tprint('DOWN')\r\n", "I = lambda :map(int, input().split())\r\nn=int(input())\r\na=[int(x) for x in input().split()]\r\nif(n==1):\r\n if(a[0]==15):\r\n print(\"DOWN\")\r\n elif(a[0]==0):\r\n print(\"UP\")\r\n else:\r\n print(-1)\r\nelif(a[n-1]==0 and a[n-2]==1):\r\n print(\"UP\")\r\nelif(a[n-1]==15 and a[n-2]==14):\r\n print(\"DOWN\")\r\nelif(a[n-1]>a[n-2]):\r\n print(\"UP\")\r\nelse:\r\n print(\"DOWN\")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Aug 13 14:54:28 2020\r\n\r\n@author: Tanmay\r\n\"\"\"\r\ndef findi(n,a):\r\n if(a[-1]==15):\r\n return(\"DOWN\")\r\n elif(a[-1]==0):\r\n return(\"UP\")\r\n elif(len(a)==1):\r\n return(\"-1\")\r\n elif(a[-1]>a[-2]):\r\n return(\"UP\")\r\n else:\r\n return(\"DOWN\")\r\n\r\nn=int(input())\r\na=list(map(int,input().strip().split()))\r\nprint(findi(n,a))\r\n\r\n", "no_days = int(input())\r\nsamples = [int(inline) for inline in input().split()]\r\nif no_days == 1:\r\n if samples[0] == 0:\r\n print(\"UP\")\r\n elif samples[0] == 15:\r\n print(\"DOWN\")\r\n else:\r\n print(-1)\r\nelse:\r\n for i in range(no_days - 1, 0, -1):\r\n if (samples[i] > samples[i - 1]):\r\n\r\n if (samples[i] != 15):\r\n print(\"UP\")\r\n break\r\n\r\n else:\r\n print(\"DOWN\")\r\n break\r\n elif (samples[i] < samples[i - 1]):\r\n if samples[i] == 0:\r\n print(\"UP\")\r\n break\r\n else:\r\n print(\"DOWN\")\r\n break\r\n", "n=int(input())\r\nl1=list(map(int,input().split()))\r\nif(l1[n-1]==15):\r\n print(\"DOWN\")\r\nelif(l1[n-1]==0):\r\n print(\"UP\")\r\nelif(n==1):\r\n print(-1)\r\nelse:\r\n if(l1[n-2]>l1[n-1]):\r\n print(\"DOWN\")\r\n else:\r\n print(\"UP\")", "from sys import exit\nn = int(input())\nt = [int(x) for x in input().split()]\nif n == 1:\n if t[0] == 15:\n print(\"DOWN\")\n elif t[0] == 0:\n print(\"UP\")\n else:\n print(-1)\n exit()\n\nif t[n-1] - t[n-2] > 0:\n if t[n-1] == 15:\n print(\"DOWN\")\n else:\n print(\"UP\")\nelif t[n-1] - t[n-2] < 0:\n if t[n-1] == 0:\n print(\"UP\")\n else:\n print(\"DOWN\")\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nif a[-1] == 0:\r\n ans = \"UP\"\r\nelif a[-1] == 15:\r\n ans = \"DOWN\"\r\nelif n == 1:\r\n ans = -1\r\nelif a[-2] < a[-1]:\r\n ans = \"UP\"\r\nelse:\r\n ans = \"DOWN\"\r\nprint(ans)", "import sys\nfrom itertools import accumulate\n\n\namt = int(input())\n\nnums = [int(i) for i in input().split()]\n\nif nums[len(nums) - 1] == 0:\n\tprint(\"UP\")\nelif nums[len(nums) - 1] == 15:\n\tprint(\"DOWN\")\nelif amt == 1:\n\tprint(-1)\nelse:\n\tif nums[amt - 1] > nums[amt - 2]:\n\t\tprint(\"UP\")\n\telse:\n\t\tprint(\"DOWN\")\n", "n = int(input())\r\nal = list(map(int, input().split()))\r\nans = 0\r\nif n==1:\r\n if al[0]==0:\r\n ans=1\r\n elif al[0]==15:\r\n ans=2\r\nelse:\r\n if al[n-1]==15 or (al[n-1]<al[n-2] and al[n-1]>0):\r\n ans=2\r\n else:\r\n ans=1\r\n\r\n\r\nprint([-1,\"UP\",\"DOWN\"][ans])", "import math\r\nfrom collections import defaultdict\r\nml=lambda:map(int,input().split())\r\nll=lambda:list(map(int,input().split()))\r\nii=lambda:int(input())\r\nip=lambda:(input())\r\nips=lambda:input().split()\r\n\r\n\"\"\"========main code===============\"\"\"\r\n\r\nt=1\r\n#t=ii()\r\nfor _ in range(t):\r\n n=ii()\r\n a=ll()\r\n if(a[n-1]==15):\r\n print(\"DOWN\")\r\n elif(a[n-1]==0):\r\n print(\"UP\")\r\n else: \r\n if n==1:\r\n print(-1)\r\n else:\r\n if(a[n-1]>a[n-2]):\r\n print(\"UP\")\r\n else:\r\n print(\"DOWN\")", "def A():\r\n\tn = int(input())\r\n\t\r\n\tif n == 1:\r\n\t\titem = int(input())\r\n\t\tif item == 0:\r\n\t\t\tprint(\"UP\")\r\n\t\telif item == 15:\r\n\t\t\tprint(\"DOWN\")\r\n\t\telse:\r\n\t\t\tprint(\"-1\")\r\n\t\treturn 0\r\n\telse:\r\n\t\tlst = [int(x) for x in input().split()]\r\n\t\r\n\tif lst[-2] > lst[-1] and lst[-1] != 0:\r\n\t\tprint(\"DOWN\")\r\n\telif lst[-2] > lst[-1]:\r\n\t\tprint(\"UP\")\r\n\telif lst[-2] < lst[-1] and lst[-1] != 15:\r\n\t\tprint(\"UP\")\r\n\telse:\r\n\t\tprint(\"DOWN\")\r\n\treturn 0\r\n\t\r\nif __name__ == \"__main__\":\r\n\tA()\r\n\t\t", "import math\r\n\r\n\r\ndef get_primes(prime_supr):\r\n\r\n is_prime = [0]*2 + [1]*prime_supr\r\n\r\n for i in range(2,int(math.sqrt(prime_supr)) + 1):\r\n if is_prime[i]:\r\n for j in range(i * i, prime_supr + 1, i):\r\n is_prime[j] = 0\r\n\r\n return is_prime\r\n\r\nget_int = lambda: map(int, input().split())\r\n\r\nn = int(input())\r\nd = list(get_int())\r\n\r\nans = [\"DOWN\", \"-1\", \"UP\"]\r\n\r\nif d[-1] == 0:\r\n print(ans[2])\r\nelif d[-1] == 15:\r\n print(ans[0])\r\nelif n > 1:\r\n print(ans[d[-1]-d[-2]+1])\r\nelse:\r\n print(ans[1])\r\n\r\n\r\n", "# author: ankan2526\r\n\r\nimport math, bisect, heapq, random, sys, itertools\r\ninput=sys.stdin.readline\r\nints = lambda : list(map(int,input().split()))\r\n\r\np = 10**9+7\r\n\r\nn=int(input())\r\na=ints()\r\nif n==1:\r\n if a[0]==0:\r\n print(\"UP\")\r\n elif a[0]==15:\r\n print(\"DOWN\")\r\n else:\r\n print(\"-1\")\r\nelse:\r\n a=a[len(a)-2:]\r\n if a[1]==0:\r\n print(\"UP\")\r\n elif a[1]==15:\r\n print(\"DOWN\")\r\n else:\r\n if a[0]<a[1]:\r\n print(\"UP\")\r\n else:\r\n print(\"DOWN\")", "import math,sys,bisect,heapq\r\nfrom collections import defaultdict,Counter,deque\r\nfrom itertools import groupby,accumulate\r\n#sys.setrecursionlimit(200000000)\r\nint1 = lambda x: int(x) - 1\r\ninput = iter(sys.stdin.buffer.read().decode().splitlines()).__next__\r\nilele = lambda: map(int,input().split())\r\nalele = lambda: list(map(int, input().split()))\r\nilelec = lambda: map(int1,input().split())\r\nalelec = lambda: list(map(int1, input().split()))\r\ndef list2d(a, b, c): return [[c] * b for i in range(a)]\r\ndef list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]\r\n#MOD = 1000000000 + 7\r\ndef Y(c): print([\"NO\",\"YES\"][c])\r\ndef y(c): print([\"no\",\"yes\"][c])\r\ndef Yy(c): print([\"No\",\"Yes\"][c])\r\n\r\nN = int(input())\r\nA = alele()\r\nD = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12,13, 14, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1,0,1,2,3]\r\nif N == 1:\r\n if A[0] == 0:\r\n print('UP')\r\n elif A[0] == 15:\r\n print('DOWN')\r\n else:\r\n print(-1)\r\nelse:\r\n x = A[-2];y = A[-1]\r\n for i in range(len(D)-2):\r\n if D[i] == x and D[i+1] == y:\r\n if D[i+2] > y:\r\n print('UP')\r\n else:\r\n print('DOWN')\r\n exit(0)\r\n print(-1)\r\n ", "if __name__ == \"__main__\":\r\n\tn = int(input())\r\n\tres = list(map(int, input().split()))\r\n\r\n\tif len(res) != 1:\r\n\t\tif res[-1] == 15:\r\n\t\t\tprint('DOWN')\r\n\t\telif res[-1] == 0:\r\n\t\t\tprint('UP')\r\n\t\telse:\r\n\t\t\tif res[-1] > res[-2]:\r\n\t\t\t\tprint('UP')\r\n\t\t\telse:\r\n\t\t\t\tprint('DOWN')\r\n\telse:\r\n\t\tif res[-1] == 15:\r\n\t\t\tprint('DOWN')\r\n\t\telif res[-1] == 0:\r\n\t\t\tprint('UP')\r\n\t\telse:\r\n\t\t\tprint(-1)\r\n\r\n\r\n", "#!/usr/bin/env python3\n\nfrom sys import stdin\n\n\ndef main():\n n, = stdin_get_ints_from_line()\n x = stdin_get_ints_list_from_line()\n\n if x[-1] == 15:\n print('DOWN')\n exit()\n\n if x[-1] == 0:\n print('UP')\n exit()\n\n if n == 1:\n print('-1')\n exit()\n\n if x[-1] > x[-2]:\n print('UP')\n\n if x[-1] < x[-2]:\n print('DOWN')\n\n\n\ndef stdin_get_ints_from_line():\n return (int(x) for x in stdin.readline().strip().split(' '))\n\n\ndef stdin_get_ints_list_from_line():\n return list(int(x) for x in stdin.readline().strip().split(' '))\n\n\ndef stdin_get_string_from_line():\n return stdin.readline().strip()\n\n\nif __name__ == '__main__':\n main()\n", "import sys\r\n\r\nn = int(input())\r\narr = list(map(int,input().split()))\r\n\r\nif n == 1 and arr[-1] != 0 and arr[-1] != 15:\r\n print('-1')\r\nelif arr[-1] == 0:\r\n print('UP')\r\nelif arr[-1] == 15:\r\n print('DOWN')\r\nelse:\r\n if arr[-2] < arr[-1]:\r\n print('UP')\r\n else:\r\n print('DOWN')", "n = int(input())\r\nL = [int(X) for X in input().split()]\r\nif n == 1:\r\n if L[0] == 0:\r\n print(\"UP\")\r\n elif L[0] == 15:\r\n print(\"DOWN\")\r\n else:\r\n print(-1)\r\nelse:\r\n if L[-1] == 0:\r\n print(\"UP\")\r\n elif L[n-1] - L[n-2] == 1:\r\n if L[n-1] == 15:\r\n print(\"DOWN\")\r\n else:\r\n print(\"UP\")\r\n else:\r\n print(\"DOWN\")", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nif a[-1] == 15:\r\n print(\"DOWN\")\r\nelif a[-1] == 0:\r\n print(\"UP\")\r\nelif n < 2:\r\n print(-1)\r\nelif a[-2] < a[-1]:\r\n print(\"UP\")\r\nelse:\r\n print(\"DOWN\")", "n = int(input())\r\nlist = input().split()\r\nif(int(list[n-1])==15):\r\n print(\"DOWN\")\r\nelif(int(list[n-1])==0):\r\n print(\"UP\")\r\nelif(n==1):\r\n print(\"-1\")\r\nelse:\r\n if(int(list[n-1])>int(list[n-2])):\r\n print(\"UP\")\r\n else:\r\n print(\"DOWN\")\r\n", "maximum = 15\nminimum = 0\n\n\nn = int(input())\na = list(map(int, input().split()))\n\nif n == 1:\n if a[0] == minimum:\n print('UP')\n elif a[0] == maximum:\n print('DOWN')\n else:\n print(-1)\nelse:\n x1, x2 = a[-2:]\n if x1 < x2:\n if x2 < maximum:\n print('UP')\n else:\n print('DOWN')\n else:\n if x2 > minimum:\n print('DOWN')\n else:\n print('UP')\n", "import sys\nn =int(input())\ns =[int(x) for x in input().split()]\nif s[len(s)-1]==15:\n print(\"DOWN\")\n sys.exit()\nif s[len(s)-1]==0:\n print(\"UP\")\n sys.exit()\nif len(s)==1:\n print(-1)\n sys.exit()\nif s[len(s)-1]>s[len(s)-2]:\n print(\"UP\")\nif s[len(s)-1]<s[len(s)-2]:\n print(\"DOWN\")\n\n\n\n", "import sys\nn = input()\nn = int(n)\na = [int(x) for x in input().split()]\nif a[len(a)-1]==0:\n print(\"UP\")\n sys.exit(0)\nif a[len(a)-1]==15:\n print(\"DOWN\")\n sys.exit(0)\nif n<2:\n print(\"-1\")\n sys.exit(0)\nif a[len(a)-1]-a[len(a)-2]<0:\n print(\"DOWN\")\n sys.exit(0)\nif a[len(a)-1]-a[len(a)-2]>0:\n print(\"UP\")\n sys.exit(0)", "def main():\r\n n = int(input())\r\n days = list(map(int, input().split()))\r\n if n == 1:\r\n if days[0] == 15:\r\n print(\"DOWN\")\r\n elif days[0] == 0:\r\n print(\"UP\")\r\n else:\r\n print(-1)\r\n return\r\n moves = [1, -1]\r\n now = 0\r\n last = days[0]\r\n if days[1] < days[0]:\r\n now = (now + 1) % 2\r\n for i in range(1, n):\r\n last += moves[now]\r\n if last == 0 or last == 15:\r\n now = (now + 1) % 2\r\n if now == 1:\r\n print(\"DOWN\")\r\n else:\r\n print(\"UP\")\r\nmain()", "n = int(input())\r\ns = list(map(int,input().split()))\r\nc = 0\r\n \r\nif len(s)==1 or s[-1]==0 or s[-1]==15:\r\n\tif s[-1]==15:\r\n\t\tprint(\"DOWN\")\r\n\telif s[-1]==0:\r\n\t\tprint(\"UP\")\r\n\telse:\r\n\t\tprint(-1)\r\nelif s[-1]-s[-2]>0:\r\n\tprint(\"UP\")\r\nelse:\r\n\tprint(\"DOWN\")", "'''input\n1 \n15\n'''\nn = int(input())\ns = list(map(int, input().split()))\nif n == 1 and s != [15] and s != [0]:\n\tprint(-1)\nelse:\n\tif (sorted(s[-2:]) == s[-2:] and s[-1] != 15) or s[-1] == 0:\n\t\tprint(\"UP\")\n\telse:\n\t\tprint(\"DOWN\")\n\n", "'''\r\ndef main():\r\n from sys import stdin,stdout\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#372\r\n#1\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n n,c=map(int,stdin.readline().split())\r\n tup=tuple(map(int,stdin.readline().split()))\r\n counter=1\r\n for i in range(1,n):\r\n if tup[i]-tup[i-1]<=c:\r\n counter+=1\r\n else:\r\n counter=1\r\n stdout.write(str(counter))\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#2\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n s=stdin.readline().strip().lower()\r\n dic={}\r\n qcounter=0\r\n for i in 'qwertyuiopasdfghjklzxcvbnm':\r\n dic[i]=0\r\n if len(s)<26:\r\n stdout.write('-1')\r\n else:\r\n for i in s:\r\n if i=='?':\r\n qcounter+=1\r\n else:\r\n dic[i]+=1\r\n l=[]\r\n x=list(dic.values()).count(0)\r\n if qcounter==26 and x==26:\r\n stdout.write('qwertyuiopasdfghjklzxcvbnm'.upper())\r\n elif x==0 and qcounter==0:\r\n stdout.write(s.upper())\r\n elif qcounter>=x:\r\n for i in 'qwertyuiopasdfghjklzxcvbnm':\r\n if dic[i]==0:\r\n l.append(i.upper())\r\n m=len(l)\r\n i=0\r\n t=''\r\n for j in range(len(s)):\r\n if s[j]=='?':\r\n if i>=m:\r\n i=0\r\n t=t[:j]+l[i]\r\n i+=1\r\n else:\r\n t+=s[j].upper()\r\n stdout.write(t)\r\n else:\r\n stdout.write('-1')\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#373\r\n#1\r\ndef main():\r\n from sys import stdin,stdout\r\n n=int(stdin.readline())\r\n tup=tuple(map(int,stdin.readline().split()))\r\n if n==1:\r\n if tup[0]==0:\r\n stdout.write('UP')\r\n elif tup[0]==15:\r\n stdout.write('DOWN')\r\n else:\r\n stdout.write('-1')\r\n else:\r\n if tup[-1]-tup[-2]>0:\r\n if tup[-1]==15:\r\n stdout.write('DOWN')\r\n else:\r\n stdout.write('UP')\r\n else:\r\n if tup[-1]==0:\r\n stdout.write('UP')\r\n else:\r\n stdout.write('DOWN')\r\nif __name__=='__main__':\r\n main()\r\n\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nif n==1 and a[0]!=0 and a[0]!=15:\r\n print(-1)\r\nelif n>1:\r\n if a[-1]>a[-2] and a[-1]!=15 or a[-1]==0:\r\n print(\"UP\")\r\n elif a[-1]<a[-2] and a[-1]!=0 or a[-1]==15:\r\n print(\"DOWN\")\r\nelif a[0]==15:\r\n print(\"DOWN\")\r\nelif a[0]==0:\r\n print(\"UP\")\r\n\r\n", "n = int(input())\na = list(map(int, input().split()))\n\nif n == 1:\n\tif a[0] == 15:\n\t\tprint('DOWN')\n\t\traise SystemExit\n\telif a[0] == 0:\n\t\tprint('UP')\n\t\traise SystemExit\n\telse:\n\t\tprint(-1)\n\t\traise SystemExit\n\nif a[-1] > a[-2]:\n\tif a[-1] != 15:\n\t\tprint('UP')\n\t\traise SystemExit\n\telse:\n\t\tprint('DOWN')\n\t\traise SystemExit\nif a[-1] < a[-2]:\n\tif a[-1] != 0:\n\t\tprint('DOWN')\n\t\traise SystemExit\n\telse:\n\t\tprint('UP')\n\t\traise SystemExit\n\n\n\n", "__author__ = 'Администратор'\r\nn = int(input())\r\narr = list(map(int,input().split(' ')))\r\nl = arr.__len__();\r\nif(l==1):\r\n if arr[0]==0:\r\n print(\"UP\")\r\n exit()\r\n if arr[0]==15:\r\n print(\"DOWN\")\r\n exit()\r\n print(\"-1\")\r\n exit()\r\nelse:\r\n if arr[l-1]>arr[l-2]:\r\n if arr[l-1]!=15:\r\n print(\"UP\")\r\n exit()\r\n else:\r\n print(\"DOWN\")\r\n exit()\r\n if arr[l-1]<arr[l-2]:\r\n if arr[l-1]!=0:\r\n print(\"DOWN\")\r\n exit()\r\n else:\r\n print(\"UP\")\r\n exit()", "n = int(input())\na=list(map(int, input().split()))\nif a[n-1] == 0 :\n print(\"UP\")\nelif a[n-1] == 15 :\n print(\"DOWN\")\nelif n == 1 :\n print(\"-1\")\nelif a[n-2] > a[n-1] :\n print(\"DOWN\")\nelse :\n print(\"UP\")\n", "n = int(input())\r\na = list(map(int,input().split()))\r\ns='DOWN'\r\nif a[-1]==15:s='DOWN'\r\nelif a[-1]==0:s='UP'\r\nelif n==1:s=-1\r\nelif a[-1]>a[-2]:s='UP'\r\nprint(s)", "n = int(input())\r\narr = [int(x) for x in input().split()]\r\nu = 'UP'\r\nd = 'DOWN'\r\nif arr[-1] == 15:\r\n print(d)\r\nelif arr[-1]== 0:\r\n print(u) \r\nelif n == 1:\r\n print(-1)\r\nelse:\r\n if arr[-2] > arr[-1]:\r\n print(d)\r\n else:\r\n print(u) ", "n = int(input())\r\nline = list(map(int,input().split()))\r\nif line[-1] == 15:\r\n print('DOWN')\r\nelif line[-1] == 0:\r\n print('UP')\r\nelif n == 1:\r\n print(-1)\r\nelse:\r\n print(['UP','DOWN'][line[-1] < line[-2]])\r\n", "__author__ = 'Think'\r\nn=int(input())\r\nmoon=[int(i) for i in input().split()]\r\nmoon.reverse()\r\nif moon[0]==0:\r\n\tprint(\"UP\")\r\nelif moon[0]==15:\r\n\tprint(\"DOWN\")\r\nelif n==1:\r\n\tprint(-1)\r\nelif moon[1]<moon[0]:\r\n\tprint(\"UP\")\r\nelse:\r\n\tprint(\"DOWN\")\r\n", "n = int(input())\r\nt = list(map(int,input().split()))\r\nif t[n-1] == 15:\r\n print('DOWN')\r\nelif t[n-1] == 0:\r\n print(\"UP\")\r\nelif n==1:\r\n print(-1)\r\nelif t[n-1] > t[n-2]:\r\n print(\"UP\")\r\nelse:\r\n print(\"DOWN\")\r\n", "n = int(input())\r\nmone = list(map(int, input().split()))\r\nif len(mone) > 1:\r\n if mone[n - 1] > mone[n - 2]:\r\n if mone[n - 1] != 15:\r\n print(\"UP\")\r\n else:\r\n print(\"DOWN\")\r\n else:\r\n if mone[n - 1] == 0:\r\n print(\"UP\")\r\n else:\r\n print(\"DOWN\")\r\nelse:\r\n if mone[0] == 15:\r\n print(\"DOWN\")\r\n elif mone[0] == 0:\r\n print(\"UP\")\r\n else:\r\n print(-1)", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef solve(A):\r\n n = len(A)\r\n if n == 1:\r\n if A[0] == 0:\r\n return 'UP'\r\n elif A[0] == 15:\r\n return 'DOWN'\r\n else:\r\n return -1\r\n else:\r\n if A[-1] == 0:\r\n return 'UP'\r\n if A[-1] == 15:\r\n return 'DOWN'\r\n if A[-1] > A[-2]:\r\n return 'UP'\r\n if A[-1] < A[-2]:\r\n return 'DOWN'\r\n return None\r\n\r\ndef main():\r\n n = int(input())\r\n A = list(map(int, input().split()))\r\n print(solve(A))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "# print (\"Input n\")\nn = int(input())\n# print (\"Input the info, separated by spaces\")\ntheperm = list(int(x) for x in input().split())\n\nif theperm[-1] == 0:\n print(\"UP\")\nelif theperm[-1] == 15:\n print(\"DOWN\")\nelif len(theperm) == 1:\n print (-1)\nelif theperm[-2] < theperm[-1]:\n print (\"UP\")\nelse:\n print (\"DOWN\")\n \n", "n=int(input())\r\na=[int(n) for n in input().split(\" \")]\r\nn=n-1\r\nif a[n]==15:\r\n print(\"DOWN\")\r\nelif a[n]==0:\r\n print(\"UP\")\r\nelif n==0:\r\n print(\"-1\")\r\nelif n>0:\r\n if a[n-1]>a[n]:\r\n print(\"DOWN\")\r\n else:\r\n print(\"UP\")\r\n", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nif n == 1:\r\n one = lst[0] \r\n if one == 0: print(\"UP\")\r\n elif one == 15: print(\"DOWN\")\r\n else: print(-1)\r\nelse:\r\n a, b = lst[-2], lst[-1]\r\n if a < b:\r\n print([\"DOWN\",\"UP\"][b!=15])\r\n else:\r\n print([\"UP\",\"DOWN\"][b!=0])", "n = int(input())\nk = list(map(int, input().split()))\n\nUP = \"UP\"\nDOWN = \"DOWN\"\n\nif k[-1] == 15:\n print(DOWN)\nelif k[-1] == 0:\n print(UP)\nelif n == 1:\n print(-1)\nelse:\n if k[-2] > k[-1]:\n print(DOWN)\n else:\n print(UP)\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nif a[-1]==15: print('DOWN')\r\nelif a[-1]==0: print('UP')\r\nelif n==1: print(-1)\r\nelse:\r\n if a[-1]<a[-2]: print('DOWN')\r\n else: print('UP')", "import sys\r\nn=int(input())\r\ns=list(map(int,input().split()))\r\nif n==1 and s[0]!=15 and s[0]!=0:print(-1);sys.exit()\r\nif (n!=1 and s[-1]>s[-2] and s[-1]!=15)or s[len(s)-1]==0:print('UP')\r\nelse:print('DOWN')\r\n\r\n", "n=int(input())\r\ns=list(map(int,input().split()))\r\nif(n>=2):\r\n a=s[n-1]\r\n if(a==0):\r\n print(\"UP\")\r\n elif(a==15):\r\n print(\"DOWN\")\r\n elif(s[n-2]>a):\r\n print(\"DOWN\")\r\n elif(s[n-2]<a):\r\n print(\"UP\")\r\nelse:\r\n if(s[0]==0):\r\n print(\"UP\")\r\n elif(s[0]==15):\r\n print(\"DOWN\")\r\n else:\r\n print(-1)", "n = int(input())\r\na = list(map(int,input().split()))\r\nif(n==1):\r\n\tif(a[0] == 15):\r\n\t\tprint(\"DOWN\")\r\n\telif(a[0] == 0):\r\n\t\tprint(\"UP\")\r\n\telse:\r\n\t\tprint(\"-1\")\r\nelse:\r\n\tif(a[n-1] - a[n-2] > 0):\r\n\t\tif(a[n-1]!=15):\r\n\t\t\tprint(\"UP\")\r\n\t\telse:\r\n\t\t\tprint(\"DOWN\")\r\n\telse:\r\n\t\tif(a[n-1]!=0):\r\n\t\t\tprint(\"DOWN\")\r\n\t\telse:\r\n\t\t\tprint(\"UP\")", "n = int(input())\r\na = list(map(int, input().split()))\r\nans = -1\r\nif a[n - 1] == 0:\r\n ans = 'UP'\r\nelif a[n - 1] == 15:\r\n ans = 'DOWN'\r\nelse:\r\n if n > 1:\r\n if a[n - 2] > a[n - 1]:\r\n ans = 'DOWN'\r\n else:\r\n ans = 'UP'\r\nprint(ans) \r\n", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\nn=int(input())\ndays=list(map(int,input().split()))\n\nif days[-1] == 0:\n print(\"UP\")\nelif days[-1] == 15:\n print(\"DOWN\")\nelif n == 1:\n print(\"-1\")\nelse:\n if days[-1] - days[-2] > 0:\n print(\"UP\")\n else:\n print(\"DOWN\")\n\n", "def main():\n n = int(input())\n\n a = [int(s) for s in input().split()]\n\n if a[-1] == 15:\n print(\"DOWN\")\n return\n if a[-1] == 0:\n print(\"UP\")\n return\n if n == 1:\n print(-1)\n return\n if a[-2] < a[-1]:\n print(\"UP\")\n return\n else:\n print(\"DOWN\")\n return\n\nmain()\n", "n = int(input())\r\nmoon = list(map(int, input().split()))\r\nif moon[n-1] == 15:\r\n print(\"DOWN\")\r\nelif moon[n-1] == 0:\r\n print(\"UP\")\r\nelif n == 1:\r\n print(-1)\r\nelif moon[n-1] > moon[n-2]:\r\n print(\"UP\")\r\nelif moon[n-1] < moon[n-2]:\r\n print(\"DOWN\")\r\n", "input()\r\na = list(map(int, input().split()))\r\nif len(a) == 1:\r\n print(-1 if a[0] != 15 and a[0] != 0 else ('UP' if a[0] == 0 else 'DOWN'))\r\n exit()\r\nif a[-1] < 15 and (a[-1] == 0 or a[-1] > a[-2]):\r\n print('UP')\r\nelse:\r\n print('DOWN')", "n, A = int(input()), list(map(int, input().split()))\r\n\r\nif A[-1] == 0:\r\n print('UP')\r\nelif A[-1] == 15:\r\n print('DOWN')\r\nelif n == 1:\r\n print(-1)\r\nelif A[-1] > A[-2]:\r\n print('UP')\r\nelse:\r\n print('DOWN')", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nif n == 1 and a[0] != 15 and a[0] != 0:\r\n print(\"-1\")\r\nelif (a[-1] == 0) or (n > 1 and a[-1] > a[-2] and a[-1] != 15):\r\n print(\"UP\")\r\nelse:\r\n print(\"DOWN\")\r\n", "n = int(input())\nline = list(map(int, input().split()))\nif n == 1 and line[0] != 0 and line[0] != 15:\n print(-1)\nelif n == 1 and line[0] == 0:\n print(\"UP\")\nelif n == 1:\n print(\"DOWN\")\nelse:\n if line[-1] > line[-2] and line[-1] == 15:\n print(\"DOWN\")\n elif line[-1] > line[-2]:\n print(\"UP\")\n elif line[-1] == 0:\n print(\"UP\")\n else:\n print(\"DOWN\")\n ", "def solve(vet):\r\n \r\n if vet[-1]== 15: #ultima posicao 15, prox = 14\r\n return -1\r\n elif vet[-1] == 0: #ultima posicao 0, prox = 1\r\n return 1\r\n\r\n elif len(vet) <= 1: #n da pra saber\r\n return 0\r\n \r\n elif vet[-1] > vet[-2]: # ultimo maior que penultimo = crescendo\r\n return 1\r\n elif vet[-1] < vet[-2]: #ultimo menor que penultimo = decrescendo\r\n return -1\r\n \r\nquantidade = int(input())\r\nseqStr=input().split(\" \")\r\nseq=[]\r\nfor q in seqStr:\r\n seq.append(int(q))\r\n \r\nif solve(seq) == 1: #crescendo\r\n print(\"UP\")\r\nelif solve(seq) == -1: #decrescendo\r\n print(\"DOWN\")\r\nelif solve(seq) == 0 :#n da pra saber\r\n print(\"-1\")", "input()\r\nmat = list(map(int, input().split()))\r\nif(mat[-1]==15):\r\n print(\"DOWN\")\r\nelif(mat[-1]==0):\r\n print(\"UP\")\r\nelif len(mat)==1:\r\n print(-1)\r\nelse:\r\n print(\"UP\" if mat[-1]>mat[-2] else \"DOWN\")\r\n", "n = int(input())\r\nss = list(map(int, input().split()))\r\nif ss[-1] == 15: \r\n print(\"DOWN\")\r\nelif ss[-1] == 0:\r\n print(\"UP\")\r\nelif n == 1:\r\n print(-1)\r\nelif ss[-1] > ss[-2]:\r\n print(\"UP\")\r\nelse:\r\n print(\"DOWN\")", "from sys import stdin as fin\n# fin = open(\"cfr373a.in\")\n\nn = int(fin.readline())\n# n, m = map(int, fin.readline.split())\nnums = tuple(map(int, fin.readline().split()))\n\nans = {15: \"DOWN\", 0: \"UP\"}\nif nums[-1] in ans:\n print(ans[nums[-1]])\nelif len(nums) == 1:\n print(-1)\nelse:\n print(\"DOWN\" if nums[-1] < nums[-2] else \"UP\")", "b=int(input()) \r\na = [int(x) for x in input().split()] \r\nif a[b-1]==15:\r\n print(\"DOWN\")\r\nelif a[b-1]==0:\r\n print(\"UP\")\r\nelif b>1 and a[b-1]>a[b-2]:\r\n print(\"UP\")\r\nelif b>1 and a[b-1]<a[b-2]:\r\n print(\"DOWN\")\r\nelse:\r\n print(\"-1\")", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nif n == 1:\r\n if a[0] == 15:\r\n result = \"DOWN\"\r\n elif a[0] == 0:\r\n result = \"UP\"\r\n else:\r\n result = -1\r\nelse:\r\n if a[-1] == 15 or a[-2] > a[-1] and a[-1] != 0:\r\n result = \"DOWN\"\r\n else:\r\n result = \"UP\"\r\nprint(result)\r\n", "n=int(input())\r\na=list(map(int,input().strip().split()))\r\nif n==1:\r\n if a[0]==15:\r\n print(\"DOWN\")\r\n elif a[0]==0:\r\n print(\"UP\")\r\n else:\r\n print(-1)\r\nelse:\r\n if a[n-1]==15:\r\n print(\"DOWN\")\r\n elif a[n-1]==0:\r\n print(\"UP\")\r\n else:\r\n if a[n-1]>a[n-2]:\r\n print(\"UP\")\r\n else:\r\n print(\"DOWN\")", "l=[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1]\ninput()\ns=list(map(int,input().split()))\nif(len(s)==1):\n if(s[0]==15):\n print(\"DOWN\")\n elif(s[0]==0):\n print(\"UP\")\n else:\n print(\"-1\")\nelse:\n a=s[len(s)-2]\n b=s[len(s)-1]\n if(a==1 and b==0):\n print(\"UP\")\n elif(a==14 and b==15):\n print(\"DOWN\")\n elif(b>a):\n print(\"UP\")\n else:\n print(\"DOWN\")\n \t \t\t\t \t\t\t\t\t \t \t \t \t \t \t\t", "\n\nn = int(input())\nl = [int(x) for x in input().split()]\n\nans = -1\nif l[-1] == 15:\n ans = 'DOWN'\nelif l[-1] == 0:\n ans = 'UP'\nelif n == 1:\n pass\nelif n > 1:\n if l[-2] > l[-1]:\n ans = 'DOWN'\n else:\n ans = 'UP'\n\n\nprint(ans)\n", "x = int(input())\r\nls = list(map(int, input().split()))\r\n\r\nif ls[x - 1] == 0:\r\n print('UP')\r\nelif ls[x - 1] == 15:\r\n print('DOWN')\r\nelif x == 1:\r\n print(-1)\r\n exit()\r\nelse:\r\n diff = ls[x - 2] - ls[x - 1]\r\n if diff < 0:\r\n print('UP')\r\n else:\r\n print('DOWN')", "import logging\r\nimport copy\r\nimport sys\r\nimport math\r\n\r\nlogging.basicConfig(stream=sys.stderr, level=logging.DEBUG)\r\n\r\n#def solve(firstLine):\r\ndef solve(nums):\r\n if len(nums) < 1:\r\n return -1\r\n if len(nums) == 1:\r\n if nums[0] == 15:\r\n return \"DOWN\"\r\n elif nums[0] == 0:\r\n return \"UP\"\r\n return -1\r\n \r\n last = nums[len(nums) - 1]\r\n prev = nums[len(nums) - 2]\r\n if last > prev:\r\n if last != 15:\r\n return \"UP\"\r\n return \"DOWN\"\r\n\r\n if last == 0:\r\n return \"UP\"\r\n return \"DOWN\"\r\n \r\n \r\n\r\ndef main():\r\n firstLine = int(input())\r\n \r\n line = input().split()\r\n line = list(map(int, line))\r\n \r\n print(solve(line))\r\n \r\n\r\ndef log(*message):\r\n logging.debug(message)\r\n \r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n", "n = int(input())\r\nsize = [int(i) for i in input().split()]\r\nif size[-1] == 0:\r\n\tprint(\"UP\")\r\nelif size[-1] == 15:\r\n\tprint(\"DOWN\")\r\nelif n == 1:\r\n\tprint(\"-1\")\r\nelif size[-1] > size[-2]:\r\n\tprint(\"UP\")\r\nelse:\r\n\tprint(\"DOWN\")", "n=int(input())\r\na=list(map(int,input().split()))\r\nif n==1:\r\n if a[0]==0: print(\"UP\")\r\n elif a[0]==15: print(\"DOWN\")\r\n else: print(-1)\r\nelse:\r\n if a[n-1]==15: print(\"DOWN\")\r\n elif a[n-1]==0: print(\"UP\")\r\n else:\r\n if a[n-1]-a[n-2]<0: print(\"DOWN\")\r\n else: print(\"UP\")", "n = int(input() )\na = list(map(int, input().split() ) )\nup = down = False\nfor i in range(1, n):\n if a[i] > a[i-1]: up, down = True, False\n if a[i] < a[i-1]: up, down = False, True\nif a[-1] == 0:\n print('UP')\nelif a[-1] == 15:\n print('DOWN')\nelse:\n print('UP' if up else 'DOWN' if down else -1)\n", "counter=int(input())\na_list=list(map(int,input().split()))\nstate=\"DOWN\"\nif a_list[-1]==15:\n state=\"DOWN\"\nelif a_list[-1]==0:\n state=\"UP\"\nelif counter==1:\n state=-1\nelif a_list[-1]>a_list[-2]:\n state=\"UP\"\nprint(state)\n\n\n", "# -*- coding: utf-8 -*-\r\n\r\nimport math\r\nimport collections\r\nimport bisect\r\nimport heapq\r\nimport time\r\nimport random\r\nimport itertools\r\nimport sys\r\n\r\n\"\"\"\r\ncreated by shhuan at 2017/11/23 21:58\r\n\r\n\"\"\"\r\n\r\n\r\nMOON = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1]\r\n\r\nN = int(input())\r\n\r\nA = [int(x) for x in input().split()]\r\n\r\nans = 0\r\nfor start in range(len(MOON)):\r\n f = True\r\n for i in range(N):\r\n if MOON[(start+i) % len(MOON)] != A[i]:\r\n f = False\r\n break\r\n if f:\r\n m = MOON[(start+N) % len(MOON)]\r\n if m > A[-1]:\r\n if ans == -1:\r\n print(-1)\r\n exit(0)\r\n ans = 1\r\n elif m < A[-1]:\r\n if ans == 1:\r\n print(-1)\r\n exit(0)\r\n ans = -1\r\n\r\nif ans == 0:\r\n print(-1)\r\nelif ans == 1:\r\n print(\"UP\")\r\nelse:\r\n print(\"DOWN\")\r\n\r\n", "def vitya(n,array):\r\n if array[n-1]==15:\r\n return \"DOWN\"\r\n elif array[n-1]==0:\r\n return \"UP\"\r\n elif n==1:\r\n return -1\r\n elif array[n-1]>array[n-2]:\r\n return \"UP\"\r\n else:\r\n return \"DOWN\"\r\nt=int(input())\r\narray=list(map(int,input().split(\" \")))\r\nprint(vitya(t,array))", "n=int(input())\nm=[int(i) for i in input().split(' ')]\nif m[-1]==15:\n\tprint('DOWN')\nelif m[-1]==0:\n\tprint('UP')\nelif n==1:\n\tprint('-1')\nelse:\n\tif 0<m[-1]<15:\n\t\tif m[-1]>m[-2]:\n\t\t\tprint('UP')\n\t\telse:\n\t\t\tprint('DOWN')\n", "n=int(input())\nz=list(map(int,input().split()))\nif z[-1] == 15 :\n f=0\nelif z[-1] == 0 :\n f=1\nelif n==1:\n f=2\nelif z[-2] > z[-1]:\n f=0\nelse:\n f=1\nprint(['DOWN','UP','-1'][f]) \n\n \t\t\t\t\t \t \t \t \t \t\t\t", "n=int(input())\r\nli=list(map(int,input().split()))\r\nif li[-1]==0:\r\n\tprint(\"UP\")\r\nelif li[-1]==15:\r\n\tprint(\"DOWN\")\r\nelif n>1:\r\n\tif li[-1]-li[-2]>0:\r\n\t\tprint(\"UP\")\r\n\telse:\r\n\t\tprint(\"DOWN\")\r\nelse:\r\n\tprint(\"-1\")\r\n\t\t", "n = int(input())\r\narr = list(map(int, input().split()))\r\nif arr[n-1] == 15 :\r\n print (\"DOWN\")\r\nelif arr[n-1] == 0 :\r\n print ('UP')\r\nelif n== 1 :\r\n print (-1)\r\nelse :\r\n if arr[n-2] > arr[n-1] :\r\n print ('DOWN')\r\n else :\r\n print (\"UP\")", "n=int(input())\r\nx = list(map(int, input().split(\" \")))\r\nif x[-1]==15 or x[-1]==0 or n==1:print({15:\"DOWN\",0:\"UP\"}[x[-1]] if x[-1] in [0,15] else -1)\r\nelse:print(\"UP\" if x[-1]>x[-2] else \"DOWN\")", "n = int(input())\r\narr = [int(i) for i in input().split(' ')]\r\n\r\nif(n == 1 and (arr[0]==1 or arr[0] not in [0,15])):\r\n print(-1)\r\nelif(arr[n-1] == 15):\r\n print('DOWN')\r\nelif(arr[n-1] == 0):\r\n print('UP')\r\nelse:\r\n print('UP' if(arr[n-1] > arr[n-2]) else 'DOWN' if(arr[n-1] < arr[n-2]) else -1)", "n = int(input())\nif n==1:\n b = int(input())\n if b==15:\n print(\"DOWN\")\n elif b==0:\n print(\"UP\")\n else:\n print(-1)\nelse:\n x = [int(y) for y in input().split()]\n b = x[len(x)-1]\n a = x[len(x)-2]\n if b==15:\n print(\"DOWN\")\n elif b==0:\n print(\"UP\")\n elif a>b:\n print(\"DOWN\")\n else:\n print(\"UP\")\n\n", "# import sys\r\n# sys.stdin = open(\"#input.txt\", \"r\")\r\nn = int(input())\r\nls = list(map(int, input().split()))\r\n\r\nif n == 1:\r\n\tif ls[0] == 15: print(\"DOWN\")\r\n\telif not ls[0]: print(\"UP\")\r\n\telse: print(-1)\r\nelse:\r\n\tif ls[-2] > ls[-1]:\r\n\t\tif ls[-1]: print(\"DOWN\")\r\n\t\telse: print(\"UP\")\r\n\telse:\r\n\t\tif ls[-1] != 15: print(\"UP\")\r\n\t\telse: print(\"DOWN\")\r\n", "n = int(input())\r\ninp = map(int, input().split())\r\narr = []\r\nfor line in inp:\r\n arr.append(line)\r\nif arr[-1] == 15: print('DOWN')\r\nelif arr[-1] == 0: print(\"UP\")\r\nelif n == 1: print(-1)\r\nelif arr[-1] > arr[-2]: print(\"UP\")\r\nelse:\r\n print(\"DOWN\")", "n = int(input())\na = list(map(int, input().split()))\nif a[-1] == 0 or (n >= 2 and a[-1] > a[-2] and a[-1] != 15):\n print(\"UP\")\nelif n > 1 or a[-1] == 15:\n print(\"DOWN\")\nelse:\n print(-1)", "n = int(input())\na = list(map(int, input().split()))\n\nif n == 1:\n if a[0] == 0:\n print(\"UP\")\n elif a[0] == 15:\n print(\"DOWN\")\n else:\n print(-1)\nelse:\n ex_2 = a[-2]\n ex_1 = a[-1]\n if ex_1 == 15:\n print(\"DOWN\")\n elif ex_1 == 0:\n print(\"UP\")\n elif ex_2 < ex_1:\n print(\"UP\")\n else:\n print(\"DOWN\")\n", "n = int(input())\r\nL = list(map(int,input().split()))\r\ncnt = 0\r\nif n == 1 :\r\n if L[0] != 0 and L[0]!= 15:\r\n print(-1)\r\n elif L[0] == 0:\r\n print(\"UP\")\r\n elif L[0] == 15:\r\n print(\"DOWN\")\r\nelse:\r\n cnt = L.count(15)\r\n A = []\r\n for idx,elm in enumerate(L):\r\n if elm == 15:\r\n A.append(idx)\r\n if L[n-1] == 0:\r\n print(\"UP\")\r\n\r\n elif cnt != 0:\r\n l = len(A) - 1\r\n index = A[l]\r\n dif = n - index\r\n if L[index] == L[n-1]:\r\n print(\"DOWN\")\r\n exit(0)\r\n if L[n-2] > L[n-1]:\r\n print(\"DOWN\")\r\n elif L[n-2] < L[n-1]:\r\n print(\"UP\")\r\n elif cnt == 0:\r\n if L[n-2] > L[n-1]:\r\n print(\"DOWN\")\r\n elif L[n-2] < L[n-1]:\r\n print(\"UP\")\r\n elif L[n-1] == 15:\r\n print(\"DOWN\")", "n = int(input().strip())\r\narr = [int(x) for x in input().strip().split(' ')]\r\nif n == 1:\r\n if arr[0] == 0:\r\n print('UP')\r\n elif arr[0] == 15:\r\n print('DOWN')\r\n else:\r\n print(-1)\r\nelse:\r\n if arr[n-1] == 0:\r\n print('UP')\r\n elif arr[n-1] == 15:\r\n print('DOWN')\r\n else:\r\n print('UP' if arr[n-1] > arr[n-2] else 'DOWN')\r\n\r\n", "N = int(input())\r\nX = list(map(int, input().split()))\r\nif N == 1 or X[-1] in [0, 15]:\r\n print(\"DOWN\" if X[-1] == 15 else (\"UP\" if X[-1] == 0 else -1))\r\n exit()\r\nprint(\"UP\" if X[-1] - X[-2] > 0 and X[-1] != 15 else \"DOWN\")\r\n\r\n# UB_CodeForces\r\n# Advice: The best view comes after the hardest climb\r\n# Location: At home behind my desk\r\n# Caption: Should prepared for final exams but I am submitting codes\r\n# CodeNumber: 475\r\n", "\r\n# -*- coding: utf-8 -*-\r\n# @Date : 2019-01-24 13:20:52\r\n# @Author : raj lath ([email protected])\r\n# @Link : link\r\n# @Version : 1.0.0\r\n\r\nfrom sys import stdin\r\n\r\nmax_val=int(10e12)\r\nmin_val=int(-10e12)\r\n\r\ndef read_int() : return int(stdin.readline())\r\ndef read_ints() : return [int(x) for x in stdin.readline().split()]\r\ndef read_str() : return input()\r\ndef read_strs() : return [x for x in stdin.readline().split()]\r\n\r\n\r\nnb_days = int(input())\r\ndays = read_ints()\r\nlast = days[-1]\r\nif last == 15: print(\"DOWN\")\r\nelif last == 0: print(\"UP\")\r\nelif nb_days == 1: print(-1)\r\nelse:\r\n if last > days[-2]:\r\n print(\"UP\")\r\n else:\r\n print(\"DOWN\")\r\n", "n = int(input())\ndays = [int(x) for x in input().split()]\n\nif days[-1] == 15:\n print (\"DOWN\")\nelif days[-1] == 0:\n print (\"UP\")\nelif n == 1:\n print (-1)\nelif days[-2] > days[-1]:\n print (\"DOWN\")\nelse:\n print (\"UP\")\n\n\n\n", "n = int(input())\r\na = list(map(int, input().split(\" \")))\r\n\r\nl = a.pop()\r\nif l == 15:\r\n print(\"DOWN\")\r\nelif l == 0:\r\n print(\"UP\")\r\nelse:\r\n if n == 1:\r\n print(-1)\r\n else:\r\n p = a.pop()\r\n print(\"UP\" if p < l else \"DOWN\")", "#!/usr/bin/env\tpython\n#-*-coding:utf-8 -*-\nn=int(input())\nA=tuple(map(int,input().split()))\nif 1>A[-1]:print('UP')\nelif 14<A[-1]:print('DOWN')\nelif 2>n:print(-1)\nelse:print('DOWN'if A[-1]<A[-2]else'UP')\n", "n=int(input())\r\nrecords=[int(x) for x in input().split()]\r\nif records[-1]==15:\r\n print('DOWN')\r\nelif records[-1]==0:\r\n print('UP')\r\nelse:\r\n if n==1:\r\n print(-1)\r\n else:\r\n if records[-2]>records[-1]:\r\n print('DOWN')\r\n else:\r\n print('UP')\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nif(l[n-1]==0):\r\n print(\"UP\")\r\nelif(l[n-1]==15):\r\n print(\"DOWN\")\r\nelse:\r\n if(n==1):\r\n print(\"-1\")\r\n else:\r\n if(l[n-2]<l[n-1]):\r\n print(\"UP\")\r\n else:\r\n print(\"DOWN\")\r\n\r\n \r\n", "d = input()\r\nday = list(map(int,input().split()))\r\ndays = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1]\r\nif(day[-1] == 0):\r\n\tprint(\"UP\")\r\nelif(day[-1] == 15):\r\n\tprint(\"DOWN\")\r\nelse:\r\n\tif(len(day) == 1):\r\n\t\tprint(-1)\r\n\telse:\r\n\t\tr = day[-1]-day[-2]\r\n\t\tif(r == 1):\r\n\t\t\tprint(\"UP\")\r\n\t\telif(r == -1):\r\n\t\t\tprint(\"DOWN\")", "def ans(n, seq):\n if n == 1:\n if seq[0] == 0:\n return 'UP'\n elif seq[0] == 15:\n return 'DOWN'\n else:\n return -1\n elif seq[-1] == 15:\n return 'DOWN'\n elif seq[-1] == 0:\n return 'UP'\n elif seq[-1] > seq[-2] and seq[-1] != 15:\n return 'UP'\n elif seq[-1] < seq[-2] and seq[-1] != 0:\n return 'DOWN'\n\nn = int(input())\nseq = list(map(int, input().split()))\nprint(ans(n,seq))", "n = int(input())\r\nsizes = list(map(int, input().split()))\r\nif n == 1:\r\n if sizes[0] == 0:\r\n print('UP')\r\n elif sizes[0] == 15:\r\n print('DOWN')\r\n else:\r\n print(-1)\r\nelse:\r\n if sizes[n - 1] > sizes[n - 2]:\r\n if sizes[n - 1] < 15:\r\n print('UP')\r\n else:\r\n print('DOWN')\r\n else:\r\n if sizes[n - 1] > 0:\r\n print('DOWN')\r\n else:\r\n print('UP') \r\n", "n = int(input())\r\na = list(map(int, input().split()))*2\r\nif n==1 and a[-1]%15>0:\r\n print(-1)\r\nelse:\r\n print([\"UP\", \"DOWN\"][a[-1]<a[-2] and a[-1]>0 or a[-1]==15])\r\n", "n=int(input())\r\nd=input().split()\r\nd=[int(x) for x in d]\r\nif n==1 and int (d[0])!=15 and int (d[0])!=0:\r\n print(-1)\r\nelif n==1 and int(d[0])==0:\r\n print(\"UP\")\r\nelif n==1 and int(d[0])==15:\r\n print(\"DOWN\")\r\nelse:\r\n if (d[-1]>d[-2] and d[-1]!=15 )or d[-1]==0:\r\n print(\"UP\")\r\n elif ( d[-1]<d[-2] and d[-1]!=0) or d[-1]==15:\r\n print(\"DOWN\")\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nw = input()[:-1].split()\r\nif w[-1] == '0':\r\n print(\"UP\")\r\nelif w[-1] == '15':\r\n print(\"DOWN\")\r\nelse:\r\n if n == 1:\r\n print(-1)\r\n else:\r\n if int(w[-1]) - int(w[-2]) > 0:\r\n print(\"UP\")\r\n else:\r\n print(\"DOWN\")", "\r\ndef answer(n, a):\r\n if (n == 1) and (a[0] != 0) and (a[0] != 15):\r\n print(-1)\r\n return\r\n #now we know for sure.\r\n if (a[-1] == 0):\r\n print('UP')\r\n return\r\n if (a[-1] == 15):\r\n print('DOWN')\r\n return\r\n #n >= 2\r\n if a[-2] < a[-1]:\r\n print('UP')\r\n return\r\n else:\r\n print('DOWN')\r\n return\r\n\r\n return\r\n\r\ndef main():\r\n n = int(input())\r\n a = [int(i) for i in input().split()]\r\n answer(n, a)\r\n\r\n\r\n return\r\nmain()", "n=int(input())\r\nlst=[int(x) for x in input().split()]\r\n\r\nflg=0\r\n#0 up \r\n#1 down\r\n#-1 impossible\r\nln=len(lst)\r\nif ln==1:\r\n flg=-1\r\nelse:\r\n if lst[ln-1]>lst[ln-2]:\r\n flg=0\r\n else:\r\n flg=1 \r\n\r\nif lst[ln-1]==15:\r\n flg=1\r\nelif lst[n-1]==0:\r\n flg=0\r\n\r\nif flg==0:\r\n print(\"UP\")\r\nelif flg==1:\r\n print(\"DOWN\")\r\nelse:\r\n print(\"-1\")\r\n \r\n \r\n ", "import sys\nn = int(input())\na = list(map(int,sys.stdin.readline().split()))\nif a[-1] == 0:\n print('UP')\nelif a[-1] == 15:\n print('DOWN')\nelif len(a) == 1:\n print(-1)\nelif a[-1] > a[-2]:\n print('UP')\nelse:\n print('DOWN')\n", "n = int(input())\r\nL = list(map(int, input().split()))\r\nif L[-1] == 0:\r\n print('UP')\r\nelif L[-1] == 15:\r\n print('DOWN')\r\nelif n == 1:\r\n print(-1)\r\nelif L[-1] > L[-2]:\r\n print('UP')\r\nelse:\r\n print('DOWN')\r\n", "#-------------------------------#\r\n#INCLUDE <Amirhossein_Alimirzaei>\r\n#INCLUDE <HajLorenzo>\r\n#-------------------------------#\r\n\r\n_ANS0X1=[\"UP\",\"DOWN\",-1]\r\n_X01=int(input())\r\n_X02=list(map(int,input().split()))\r\n\r\nif(_X02[_X01-1]==15):print(_ANS0X1[1])\r\nelif(_X02[_X01-1]==0):print(_ANS0X1[0])\r\nelif(_X01==1):print(_ANS0X1[2])\r\nelse:print(_ANS0X1[0] if(_X02[_X01-1]>_X02[_X01-2]) else _ANS0X1[1])\r\n\r\n\r\n\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nif n <= 1:\r\n\tif n and a[0] in (0, 15):\r\n\t\tprint('UP' if a[0] == 0 else 'DOWN')\r\n\t\texit()\r\n\tprint('-1')\r\n\texit()\r\n\r\nif a[-1] - a[-2] >= 1:\r\n\tif a[-1] < 15:\r\n\t\tprint('UP')\r\n\telse:\r\n\t\tprint('DOWN')\r\nelse:\r\n\tif a[-1] <= 0:\r\n\t\tprint('UP')\r\n\telse:\r\n\t\tprint('DOWN')\r\n\r\n", "import sys, math\r\nn = int(input())\r\nz = list(map(int, input().split()))\r\nif n == 1:\r\n if z[0] == 0:\r\n print('UP')\r\n sys.exit(0)\r\n if z[0] == 15:\r\n print('DOWN')\r\n sys.exit(0)\r\n print(-1)\r\n sys.exit(0)\r\nif z[-1] == 0:\r\n print('UP')\r\n sys.exit(0)\r\nif z[-1] == 15:\r\n print('DOWN')\r\n sys.exit(0)\r\nz.append(z[-1] + z[-1] - z[-2])\r\nif z[-1] > z[-2]:\r\n print('UP')\r\nelse:\r\n print('DOWN')", "\r\nn=int(input())\r\ns = list(map(int,input().split()))[:n]\r\n\r\n\t\r\nk=-1\r\nif s[n-1]==0:\r\n print(\"UP\")\r\nelif s[n-1]==15 or s[n-2]>s[n-1]:\r\n\tprint(\"DOWN\")\r\nelif n==1:\r\n\tprint(k)\r\nelse:\r\n print(\"UP\")", "I=input\r\nn=int(I())\r\na=list(map(int,I().split()))\r\ns='DOWN'\r\nif a[-1]==15:s='DOWN'\r\nelif a[-1]==0:s='UP'\r\nelif n==1:s=-1\r\nelif a[-1]>a[-2]:s='UP'\r\nprint(s)", "if __name__ == '__main__':\r\n Y = lambda: list(map(int, input().split()))\r\n N = lambda: int(input())\r\n\r\n n = N()\r\n a = Y()\r\n k, ans = -1, -1\r\n\r\n for i in range(n, 0, -1):\r\n if a[i - 1] == 0:\r\n ans = 1\r\n break\r\n if a[i - 1] == 15:\r\n ans = 0\r\n break\r\n if k >= 0:\r\n ans = not (a[i - 1] > k)\r\n break\r\n else:\r\n k = a[i - 1]\r\n print([\"DOWN\", \"UP\", -1][ans if ans != -1 else 2])", "import math\r\n#s = input()\r\n#n= (map(int, input().split()))\r\n\r\n#(map(int, input().split()))\r\n\r\n\r\nn = int(input())\r\n\r\na = list(map(int, input().split()))\r\n\r\nif(a[len(a)-1])==0:\r\n print('UP')\r\nelif (a[len(a)-1])==15:\r\n print('DOWN')\r\nelse:\r\n if(len(a)==1):\r\n print(-1)\r\n else:\r\n if(a[len(a)-2]>a[len(a)-1]):\r\n print(\"DOWN\")\r\n else:\r\n print(\"UP\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "# Start writing your code here\r\n# your code goes here\r\nn = int(input()) \r\nmas = input().split()\r\nif n == 1:\r\n if int(mas[0]) == 15:\r\n print('DOWN')\r\n elif int(mas[0]) == 0:\r\n print('UP')\r\n elif True:\r\n print('-1')\r\nelse:\r\n # print(mas[n-1])\r\n # print(mas[n-2])\r\n if (int(mas[n-1]) != 15) and (int(mas[n-1]) != 0):\r\n if((int(mas[n-1]) - int(mas[n-2])) > 0):\r\n print('UP')\r\n else:\r\n print('DOWN')\r\n elif(int(mas[n-1]) == 15):\r\n print('DOWN')\r\n else:\r\n print('UP')\r\n \r\n ", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nif a[n-1] == 15:\r\n\tprint('DOWN')\r\nelif a[n-1] == 0:\r\n\tprint('UP')\r\nelif n == 1:\r\n\tprint(-1)\r\nelse:\r\n\tif a[n-2] > a[n-1]:\r\n\t\tprint('DOWN')\r\n\telse:\r\n\t\tprint('UP')\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nif a[n-1]==15:\r\n print(\"DOWN\")\r\nelif a[n-1]==0:\r\n print(\"UP\")\r\nelif n==1:\r\n print(\"-1\")\r\nelse:\r\n if a[n-2]>a[n-1]:\r\n print(\"DOWN\")\r\n else:\r\n print(\"UP\")", "n = int(input())\r\nx = lambda : list(map(int, input().split()))\r\nx = x()\r\nif (n == 1):\r\n if (x[-1] == 15):\r\n print(\"DOWN\")\r\n elif (x[-1] == 0):\r\n print(\"UP\")\r\n else:print(-1)\r\nelse:\r\n if (x[-1] == 15):\r\n print(\"DOWN\")\r\n elif (x[-1] == 0):\r\n print(\"UP\")\r\n elif (x[-1] < x[-2]):\r\n print(\"DOWN\")\r\n else:\r\n print(\"UP\")\r\n" ]

[ "from sys import stdin; inp = stdin.readline\r\nfrom math import dist, ceil, floor, sqrt, log\r\nfrom collections import defaultdict, Counter\r\ndef IA(sep=' '): return list(map(int, inp().split(sep)))\r\ndef FA(): return list(map(float, inp().split()))\r\ndef SA(): return inp().split()\r\ndef I(): return int(inp())\r\ndef F(): return float(inp())\r\ndef S(): return input()\r\ndef O(l:list): return ' '.join(map(str, l))\r\n\r\ndef main():\r\n n = I()\r\n s = S()\r\n lens = len(s)\r\n op = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\n for t in op:\r\n if len(t)==lens:\r\n match = True \r\n for i in range(lens):\r\n if s[i] != '.' and s[i] != t[i]:\r\n match = False \r\n if match:\r\n return t\r\n\r\nif __name__ == '__main__':\r\n print(main())", "ref = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\nn = int(input())\r\ns = str(input())\r\noutput = ''\r\nfor j in range(len(ref)):\r\n if len(ref[j]) != n:\r\n continue\r\n alpha, count = 0, 0\r\n for k in range(n):\r\n if s[k] >= 'a' and s[k] <= 'z':\r\n alpha += 1\r\n if s[k] == ref[j][k]:\r\n count += 1\r\n if count == alpha:\r\n output = ref[j]\r\n break\r\nprint(output)\r\n", "s=[\"vaporeon8\", \"jolteon7\", \"flareon7\", \"espeon6\", \"umbreon7\", \"leafeon7\", \"glaceon7\", \"sylveon7\"]\r\nk={8:[\"vaporeon\"],7:[\"jolteon\",\"flareon\",\"umbreon\",\"leafeon\",\"glaceon\",\"sylveon\"],6:[\"espeon\"]}\r\nn=int(input())\r\nl=input()\r\nif n==8:\r\n print(k[8][0])\r\nif n == 6 :\r\n print(k[6][0])\r\nm=dict()\r\nif n ==7:\r\n j=0\r\n for i in l:\r\n \r\n if i.islower():\r\n m[j]=i\r\n j+=1\r\n #print(m)\r\n\r\n p=list(m.keys())\r\n flag=0\r\n res=\"\"\r\n for i in k[7]:\r\n for j in range(len(p)):\r\n #print(i,m)\r\n if i[p[j]]==m[p[j]]:\r\n flag=1\r\n #print(i,m)\r\n else:\r\n flag=0\r\n break\r\n if flag ==1:\r\n res=i\r\n break\r\n print(res)\r\n \r\n \r\n \r\n", "ar=[\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\n\r\nn=int(input())\r\np=input()\r\nar1=[]\r\nfor t in ar:\r\n if len(t)==n:\r\n ar1.append(t)\r\n#print(ar1)\r\ns=list(p)\r\n#print(s)\r\ns1=[]\r\nfor j in ar1:\r\n if len(j)==n:\r\n c=0\r\n for i in range(n):\r\n if s[i]==j[i]:\r\n c+=1\r\n s1.append(c)\r\nprint(ar1[s1.index(max(s1))])", "\"\"\"\r\nproblem : https://codeforces.com/problemset/problem/452/A\r\nauther : Jay Saha\r\nhandel : ponder_\r\ndate : 15/07/2020\r\n\"\"\"\r\n\r\npokemons = ['vaporeon', 'jolteon', 'flareon', 'espeon', 'umbreon', 'leafeon', 'glaceon', 'sylveon']\r\nn = int(input())\r\nmaskedPM = input()\r\n\r\nfor p in pokemons:\r\n if n == len(p):\r\n isValid = True\r\n for i in range(n):\r\n if maskedPM[i] != '.':\r\n if maskedPM[i] != p[i]:\r\n isValid = False\r\n if isValid:\r\n print(p)\r\n break", "n=int(input())\r\ns=input().strip()\r\na=['vaporeon', 'jolteon', 'flareon', 'espeon', 'umbreon', 'leafeon', 'glaceon','sylveon']\r\nfor k in a:\r\n b=True\r\n if n==len(k):\r\n for i in range(n):\r\n if s[i]!='.' and s[i]!=k[i]:\r\n b=False\r\n if b:\r\n print(k)\r\n exit()", "def match(s, p):\r\n if len(s) != len(p):\r\n return False\r\n for chs, chp in zip(s, p):\r\n if chs != '.' and chs != chp:\r\n return False\r\n return True\r\n\r\nn = int(input())\r\ns = input()\r\nfor p in ['vaporeon', 'jolteon', 'flareon', 'espeon', 'umbreon', 'leafeon', 'glaceon', 'sylveon'\\\r\n]:\r\n if match(s, p):\r\n print(p)", "from difflib import SequenceMatcher\n\nevolutions = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\n\nn = int(input())\n\ns = input()\n\nanswer = \"\"\nmaxr = 0\n\nfor e in evolutions:\n if len(e) == n:\n r = SequenceMatcher(None, e, s).ratio()\n if r >= maxr: \n maxr = r\n answer = e\n \nprint(answer)\n\t \t\t\t\t \t\t \t \t \t \t \t \t\t\t\t", "s = [\"vaporeon\",\"jolteon\",\"flareon\",\"espeon\",\"umbreon\",\"leafeon\",\"glaceon\",\"sylveon\"]\r\nd = []\r\nn = int(input())\r\na = input()\r\n\r\nfor i in range(8):\r\n\tif len(s[i])==n:\r\n\t\tb = s[i]\r\n\t\tcnt = 0\r\n\t\tfor j in range(n):\r\n\t\t\tif a[j]==\".\":\r\n\t\t\t\tpass\r\n\t\t\telif a[j]!=b[j]:\r\n\t\t\t\tcnt+=1\r\n\t\tif cnt==0:\r\n\t\t\td.append(s[i])\r\n\r\nprint(*d)\r\n", "from collections import deque, defaultdict, Counter\r\nfrom itertools import product, groupby, permutations, combinations\r\nfrom math import gcd, floor, inf\r\nfrom bisect import bisect_right, bisect_left\r\nnames = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\n\r\ndef equal(word1, word2):\r\n if len(word1) != len(word2):\r\n return False\r\n for char1, char2 in zip(word1, word2):\r\n if char1.isalnum() and char2.isalnum() and char2 != char1:\r\n return False\r\n\r\n return True\r\n\r\nnum = int(input())\r\ns = input()\r\n\r\nfor word in names:\r\n if equal(word, s):\r\n print(word)\r\n break\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "a=int(input())\r\nb=input()\r\n\r\nl=[ \"jolteon\", \"flareon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\n\r\np=len(b)\r\nm=0\r\nd=[0 for i in range(6)]\r\n\r\nif p==8:\r\n print(\"vaporeon\")\r\nelif p==6:\r\n print(\"espeon\")\r\nelse:\r\n for i in range(4):\r\n s=b[i]\r\n for j in range(6):\r\n if s==l[j][i]:\r\n d[j]=d[j]+1\r\n \r\n m=max(d)\r\n n=d.index(m)\r\n\r\n print(l[n])", "import sys\nimport re\n\ninput()\nr = re.compile('^'+input()+'$')\nl = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\n\nfor i in l:\n if r.match(i):\n print(i)\n sys.exit(0)\n", "a = [\"vaporeon\", \"espeon\", \"jolteon\", \"flareon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\nn = int(input())\r\nif n == 6:\r\n print(a[1])\r\nelif n == 8:\r\n print(a[0])\r\nelse:\r\n s = input()\r\n for i in range(2, 8):\r\n t = a[i]\r\n f = 1\r\n for j in range(7):\r\n if s[j] != '.' and s[j] != t[j]:\r\n f = 0\r\n break\r\n if f == 1:\r\n print(t)\r\n break", "n = int(input())\r\ns = input()\r\npokemons = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\nfor p in [x for x in pokemons if len(x) == n]:\r\n ans = True\r\n for a, b in zip(s, p):\r\n if a != '.' and a != b:\r\n ans = False\r\n break\r\n if ans:\r\n print(p)\r\n break", "l = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\",\n \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\nlength = []\nmstr = []\n\nn = int(input())\n\nst = input()\n\nfor i in l:\n st2 = i\n ln = len(st)\n if(ln == len(st2)):\n match = sum(a==b for a, b in zip(st2, st))\n length.append(match)\n mstr.append(i)\n\nmaxLen = max(length)\nmaxIn = length.index(maxLen)\nprint(mstr[maxIn])\n\n\t \t \t\t\t \t \t \t\t \t \t \t\t", "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\n\r\nl6 = \"espeon\"\r\nl7 = [\"jolteon\", \"flareon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\nl8 = \"vaporeon\"\r\nn = int(input())\r\npsw = input()\r\nif n == 6:\r\n print(l6)\r\nelif n == 8:\r\n print(l8)\r\nelse:\r\n for s in l7:\r\n ans = 1\r\n for i in range(7):\r\n if s[i] != psw[i] and psw[i] != '.':\r\n ans = 0\r\n break\r\n if ans == 1:\r\n print(s)\r\n break\r\n", "a = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\n\r\n\r\ndef eevee(s):\r\n for elem in a:\r\n if len(elem) != len(s):\r\n continue\r\n flag = True\r\n for j in range(len(s)):\r\n if s[j] != '.' and elem[j] != '.' and s[j] != elem[j]:\r\n flag = False\r\n if flag:\r\n return elem\r\n return -1\r\n\r\n\r\nn = int(input())\r\nt = input()\r\nprint(eevee(t))\r\n\r\n", "import re\r\n\r\nn = int(input())\r\ns = input()\r\n\r\nreg_search = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\n\r\n\r\nfor i in reg_search :\r\n if len(i) == n and re.search(s , i):\r\n print(i)\r\n\r\n\r\n", "if __name__=='__main__':\n names = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\n N = int(input())\n nm = input()\n for x in names:\n if len(x) == N:\n st = True\n for i in range(N):\n if (nm[i]!='.') and (nm[i]!=x[i]):\n st = False\n if st:\n print(x)\n break\n \n", "import sys\r\nf = sys.stdin\r\n\r\nn = int(f.readline().strip())\r\n\r\ns = f.readline().strip()\r\n\r\nv = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\n\r\nfor vi in v:\r\n t = True\r\n if n!=len(vi):\r\n t = False\r\n continue\r\n \r\n for l in range(len(s)):\r\n if s[l] != '.' and vi[l] != s[l]:\r\n t = False\r\n break\r\n \r\n if t:\r\n res = vi\r\n break\r\n\r\nprint(res) ", "Pokemons=[\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\nP=[True,True,True,True,True,True,True,True]\r\nn=int(input())\r\ns=input()\r\nfor i,x in enumerate(Pokemons):\r\n if len(x)!=n:\r\n P[i]=False\r\n else:\r\n for j,c in enumerate(s):\r\n if c!=x[j] and c!='.':\r\n P[i]=False\r\nfor i,p in enumerate(P):\r\n if p==True:\r\n print(Pokemons[i])\r\n", "n=int(input())\r\ns=input()\r\nd=[\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\nfor y in d:\r\n p=True\r\n if len(s)==len(y):\r\n for i in range(len(s)):\r\n if s[i]!='.' and s[i]!=y[i]:\r\n p=False\r\n if p:\r\n print(y)\r\n\r\n", "def main():\n\n evol = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\n\n n = int(input())\n string: str = input()\n find: int\n\n for poke in evol:\n find = 1\n if len(poke) == n:\n for i in range(n):\n if not (poke[i] == string[i] or string[i] == '.'):\n find = 0\n break\n if find == 1:\n print(poke)\n\n\nif __name__ == '__main__':\n main()\n \t \t\t\t\t \t \t \t\t", "names = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\nposs = []\n\nlength = int(input())\nn = input()\n\nfor name in names:\n\tif len(name) != len(n):\n\t\tcontinue\n\tsuccess = True\n\tfor l in range(len(name)):\n\t\tletter = name[l]\n\t\totherLetter = n[l]\n\t\tif otherLetter != \".\" and letter != otherLetter:\n\t\t\tsuccess = False\n\t\t\tbreak\n\tif success:\n\t\tprint(name)\n\t\tbreak\n\n\t \t \t \t \t \t \t \t\t\t", "n=int(input())\r\ns=str(input())\r\nl=[\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\nfor e in l:\r\n if len(e) == len(s) and all(s[i] == '.' or s[i] == e[i] for i in range(n)):\r\n print(e)\r\n exit()", "n = int(input())\r\ns = input()\r\nl = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\nfor given in l:\r\n if len(given) != len(s):\r\n continue\r\n istrue = 1\r\n for i in range(0, n):\r\n if given[i] != s[i] and s[i] != '.':\r\n istrue = 0\r\n break\r\n if (istrue):\r\n print (given)", "def buscar(palavra, evolucao):\n x = 0\n for i in range(0, len(evolucao)):\n if palavra[i] == evolucao[i]:\n x += 1\n return x\n\nn = int(input())\npalavra = input()\n\nif n == 8:\n print(\"vaporeon\")\nelif n == 6:\n print(\"espeon\")\nelse:\n evolucoes = [\"jolteon\", \"flareon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\n tipo = [0, 0, 0, 0, 0, 0]\n\n for i in range(0, 6):\n tipo[i] = buscar(palavra, evolucoes[i])\n\n tmp = max(tipo)\n idx = tipo.index(tmp)\n print(evolucoes[idx])\n \t \t\t\t \t\t \t\t \t\t \t \t\t", "Evolution_Eevee = {\r\n 'Vaporeon' : '8',\r\n 'Jolteon' : '7',\r\n 'Flareon' : '7',\r\n 'Espeon': '6',\r\n 'Umbreon': '7',\r\n 'Leafeon': '7',\r\n 'Glaceon': '7',\r\n 'Sylveon': '7',\r\n}\r\nn = int(input())\r\nif 6 <= n <= 8:\r\n string = input()\r\n for key, val in Evolution_Eevee.items():\r\n if int(val) == n:\r\n count = 0\r\n value = len(string) - string.count('.')\r\n for i in range(n):\r\n if string[i].lower() == key[i].lower():\r\n count += 1\r\n if count == value:\r\n print(key.lower())", "a=[\"jolteon\", \"flareon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\nx=int(input())\r\nb=input()\r\npos=[]\r\nif(x==8):\r\n print('vaporeon')\r\nelif(x==6):\r\n print('espeon')\r\nelse:\r\n for q in range(7):\r\n if(b[q]=='.'):\r\n continue\r\n else:\r\n pos.append(q)\r\n for q in a:\r\n ass=True\r\n for w in pos:\r\n if(b[w]!=q[w]):\r\n ass=False\r\n break\r\n if(ass):\r\n print(q)\r\n\r\n\r\n\r\n", "#!/usr/bin/python3.5\r\npossible = [\"jolteon\", \"flareon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\nl = int(input())\r\npokemon = input()\r\npos = []\r\nif (l == 6):\r\n\tprint (\"espeon\")\r\nelif (l == 8):\r\n\tprint (\"vaporeon\")\r\nelse:\r\n\tfor i in range(6):\r\n\t\tb = 0\r\n\t\tpok = possible[i]\r\n\t\tfor j in range(7):\r\n\t\t\tfor l in pok[j]:\r\n\t\t\t\tif l in pokemon[j]:\r\n\t\t\t\t\tb = b + 1\r\n\t\tpos.append(b)\r\n\r\n\tprint (possible[pos.index(max(pos))])", "def get_key(d, value):\r\n for k, v in d.items():\r\n if v == value:\r\n return k\r\nn = int(input())\r\ns = input()\r\nd = {0:\"vaporeon\", 1:\"jolteon\", 2:\"flareon\", 3:\"espeon\", 4:\"umbreon\",\r\n 5:\"leafeon\", 6:\"glaceon\", 7:\"sylveon\"}\r\nd1 = {}\r\nfor i in d:\r\n if len(d[i]) != len(s):\r\n continue\r\n else:\r\n q = d[i]\r\n k = 0\r\n for j in range(0, n):\r\n if q[j] == s[j]:\r\n k += 1\r\n d1[d[i]] = k\r\np = max(d1.values())\r\nprint(get_key(d1,p))", "'''\nCreated on May 10, 2016\n\n@author: Md. Rezwanul Haque\n'''\nimport re \nn = int(input())\nw = input()\nl=[\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\nfor x in l:\n if len(x) == len(w) and re.match(''+ w, x):\n print(x)", "def match(s, t):\r\n if len(s) != len(t):\r\n return False\r\n return all(x == y or x == '.' for x, y in zip(s, t))\r\n\r\n\r\ninput()\r\npat = input()\r\n\r\na = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\nfor n in a:\r\n if match(pat, n):\r\n print(n)\r\n break\r\n", "S = set([\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"])\r\n\r\nn = int(input())\r\nSt = input()\r\n\r\nfor s in S:\r\n \r\n if len(St) != len(s):\r\n continue\r\n f = 1\r\n for i, v in enumerate(St):\r\n if v != '.' and v != s[i]:\r\n f = 0\r\n break\r\n if f == 1:\r\n print(s)\r\n break\r\n \r\n ", "def main():\r\n n=int(input())\r\n s=input()\r\n g=n-3\r\n if n == 6:\r\n return \"espeon\"\r\n elif n == 7:\r\n if check(s, \"jolteon\", g):\r\n return \"jolteon\"\r\n if check(s, \"flareon\", g):\r\n return \"flareon\"\r\n if check(s, \"umbreon\", g):\r\n return \"umbreon\"\r\n if check(s, \"leafeon\", g):\r\n return \"leafeon\"\r\n if check(s, \"glaceon\", g):\r\n return \"glaceon\"\r\n if check(s, \"sylveon\", g):\r\n return \"sylveon\"\r\n else:\r\n return \"vaporeon\"\r\n \r\n\r\ndef check(s, name, g):\r\n for i in range(g):\r\n if s[i] != name[i] and s[i] != \".\":\r\n return False\r\n return True\r\n \r\nprint(main())\r\n", "n = int(input())\ns = input()\npks = [\"jolteon\", \"flareon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\n\n\nif n == 6:\n\tprint(\"espeon\")\nelif n == 8:\n\tprint(\"vaporeon\")\nelse:\n\tfor pk in pks:\n\t\tentrou = False\n\t\tfor i in range(n):\n\t\t\tif s[i] != \".\" and s[i] != pk[i]:\n\t\t\t\tentrou = True\n\t\t\t\tbreak\n\t\t\t\t\t\n\t\tif not entrou:\n\t\t\tprint(pk)\n\t\t\tbreak\n\t\t \t\t\t\t\t \t \t\t \t\t \t\t \t \t", "import re\r\n\r\nn = int(input())\r\nregexp = re.compile(input())\r\n\r\nfor i in ['vaporeon', 'jolteon', 'flareon', 'espeon', 'umbreon', 'leafeon', 'glaceon', 'sylveon']:\r\n match = regexp.match(i)\r\n if match and match.group(0) == i:\r\n print(i)", "a=int(input())\r\nif a==8:\r\n print('vaporeon')\r\nelif a==6:\r\n print('espeon')\r\nelse:\r\n b=['jolteon','flareon','umbreon','leafeon','glaceon','sylveon']\r\n c=input()\r\n for i in b:\r\n d=True\r\n for j in range(7):\r\n if c[j]=='.':continue\r\n if c[j]!=i[j]:\r\n d=False\r\n break\r\n if d:\r\n e=i\r\n break\r\n print(e)\r\n", "length = int(input())\n\nname = input()\n\n\nnames = [\"jolteon\", \"flareon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\n\nind = []\n\nif length == 6:\n\tprint(\"espeon\")\nelif length == 8:\n\tprint(\"vaporeon\")\nelse:\n\tfor i in range(0, 7):\n\t\tif name[i] != '.':\n\t\t\tind.append(i)\n\t#print(ind)\n\n\tfor i in ind:\n\t\tindex = []\n\t\ttry:\n\t\t\tif(names[0][i] != name[i]):\n\t\t\t\t#print(names[0] , names[0][i] , name[i])\n\t\t\t\tindex.append(0)\n\t\texcept:\n\t\t\tx = 1\n\t\ttry:\n\t\t\tif(names[1][i] != name[i]):\n\t\t\t\t#print(names[1] , names[1][i] , name[i])\n\t\t\t\tindex.append(1)\n\t\texcept:\n\t\t\tx = 1\n\t\ttry:\n\t\t\tif(names[2][i] != name[i]):\n\t\t\t\t#print(names[2] , names[2][i] , name[i])\n\t\t\t\tindex.append(2)\n\t\texcept:\n\t\t\tx = 1\n\t\ttry:\n\t\t\tif(names[3][i] != name[i]):\n\t\t\t\t#print(names[3] , names[3][i] , name[i])\n\t\t\t\tindex.append(3)\n\t\texcept:\n\t\t\tx = 1\n\n\t\ttry:\n\t\t\tif(names[4][i] != name[i]):\n\t\t\t\t#print(names[4] , names[4][i] , name[i])\n\t\t\t\tindex.append(4)\n\t\texcept:\n\t\t\tx = 1\n\t\ttry:\n\t\t\tif(names[5][i] != name[i]):\n\t\t\t\t#print(names[5] , names[5][i] , name[i])\n\t\t\t\tindex.append(5)\n\t\texcept:\n\t\t\tx = 1\n\t\tindex.reverse()\n\t\t#print(index)\n\t\tfor j in index:\n\t\t\tdel names[j]\n\n\tprint(names[0])\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n", "#Davidson Lisboa Della Piazza, 169786\n\nx = int(input())\nn = input()\nn = list(n)\npok = ['vaporeon', 'jolteon', 'flareon', 'espeon', 'umbreon', 'leafeon', 'glaceon', 'sylveon']\n\naux = []\nfor i in range(len(pok)):\n aux.append(list(pok[i]))\n\nflag = 0\nfor i in range(len(pok)):\n for j in range(len(n)):\n if(len(n)!=len(pok[i])):\n break\n if(n[j]!='.' and n[j]!=aux[i][j]):\n break\n if(j==len(n)-1):\n print(pok[i])\n flag=1\n \n if(flag==1):\n break\n\n \t\t \t\t \t \t \t\t \t \t \t \t\t\t \t", "pokemons = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\n_ = input()\ncandidate = input()\nfor pok in pokemons:\n if len(pok) == len(candidate):\n check = True\n for i in range(0, len(candidate)):\n if (candidate[i] != '.') and (pok[i] != candidate[i]):\n check = False\n break;\n\n if check:\n ans = pok\n break\n\n\nprint(ans)\n\n \t\t\t \t \t \t \t\t\t \t\t", "n = int(input())-3\r\na = input()[:-3]\r\nif n == 3:\r\n print('espeon')\r\nelif n == 5:\r\n print('vaporeon')\r\n \r\nelse:\r\n l = 6\r\n words = ['jolt', 'flar', 'umbr', 'leaf', 'glac', 'sylv']\r\n for i in range(n):\r\n if a[i] != '.':\r\n j = 0\r\n while j < l:\r\n if words[j][i] != a[i]:\r\n words.pop(j)\r\n l -= 1\r\n else:\r\n j += 1\r\n if l == 1:\r\n print(words[0]+'eon')\r\n else:\r\n print('flareon')", "names = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"] \nn = int(input())\nuff=input()\nfor name in names:\n if n != len(name):\n continue\n flag = True\n for i in range(len(name)):\n if not uff[i] in ['.', name[i]]:\n flag = False\n if flag:\n print(name)\n\n\t \t \t \t\t\t \t\t\t\t\t \t\t\t\t", "pokemon = [\"jolteon\", \"flareon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\navail = [0, 0, 0, 0, 0, 0]\n\nn = int(input())\ncwd = input()\n\nif n == 6:\n print(\"espeon\")\n exit(0)\n\nif n == 8:\n print(\"vaporeon\")\n exit(0)\n\nfor i in range(n):\n\n if cwd[i] == '.':\n continue\n\n else:\n\n for j in range(6):\n\n if avail[j] is 0 and pokemon[j][i] is not cwd[i]:\n avail[j] = 1\n\n if avail.count(0) is 1:\n\n for j in range(6):\n if avail[j] is 0:\n print(pokemon[j])\n exit(0)\n", "n=int(input())\r\ns=input()\r\nl=['jolteon','flareon','umbreon','leafeon','glaceon','sylveon']\r\nif n==6: print('espeon')\r\nelif n==8: print('vaporeon')\r\nelse:\r\n for x in l:\r\n for i in range(n):\r\n if s[i]!='.' and s[i]!=x[i]: break\r\n else: print(x)", "import re\r\nsrc=input()\r\nsrc=input()\r\ndata=['Vaporeon', 'Jolteon', 'Flareon', 'Espeon', 'Umbreon', 'Leafeon', 'Glaceon', 'Sylveon']\r\n\r\nfor mon in data:\r\n mon=mon.lower()\r\n \r\n if(len(mon)!=len(src)):\r\n continue\r\n if re.match(src,mon):\r\n print(mon)\r\n break", "pokemon = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\nn = int(input())\na = input()\nword_found = []\nfor i in pokemon:\n sum = 0\n if len(a) == len(i):\n for x in range(len(i)):\n if a[x] == i[x]:\n sum+=1\n word_found+=[[sum,i]]\nprint(sorted(word_found)[-1][1])\n\n", "t = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\n\r\nn = int(input())\r\ns = input()\r\nans = ''\r\nfor i in range(len(t)):\r\n if len(t[i]) != len(s):\r\n continue\r\n\r\n else:\r\n find = True\r\n for j in range(n):\r\n if s[j] != '.' and s[j] != t[i][j] :\r\n find = False\r\n break\r\n\r\n\r\n if find :\r\n ans = t[i]\r\n break\r\n\r\nprint(ans)", "length = int(input())\r\neevee = input()\r\nif length == 6:\r\n\tprint(\"espeon\")\r\nelif length == 8:\r\n\tprint('vaporeon')\r\nelse:\r\n\tif (eevee[0] == 'j') or (eevee[1] == 'o') or (eevee[3] == 't'):\r\n\t\tprint('jolteon')\r\n\telif (eevee[0] == 'f') or ((eevee[1] == 'l') & (eevee[3] == 'r')) or ((eevee[2] == 'a') & (eevee[3] == 'r')):\r\n\t\tprint('flareon')\r\n\telif (eevee[0] == 'u') or (eevee[1] == 'm') or (eevee[2] == 'b') or (eevee[3] == 'r'):\r\n\t\tprint('umbreon')\r\n\telif (eevee[0] == 'l') or (eevee[1] == 'e') or (eevee[3] == 'f'):\r\n\t\tprint('leafeon')\r\n\telif (eevee[0] == 'g') or (eevee[1] == 'l') or (eevee[2] == 'a') or (eevee[3] == 'c'):\r\n\t\tprint('glaceon')\r\n\telse:\r\n\t\tprint('sylveon')", "def match(p, s):\r\n return len(p) == len(s) and all(d in ('.', c) for d, c in zip(p, s))\r\n\r\nl = ['vaporeon', 'jolteon', 'flareon', 'espeon',\r\n 'umbreon', 'leafeon', 'glaceon', 'sylveon']\r\n\r\ninput()\r\np = input()\r\nprint(next(s for s in l if match(p, s)))\r\n", "n = int(input())\r\nmemo = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\ndata = list(input())\r\n\r\nfor i in memo:\r\n if len(i) == n:\r\n flag = True\r\n for j in range(n):\r\n if data[j] != '.' and i[j] != data[j]:\r\n flag = False\r\n break\r\n if flag:\r\n print(i)\r\n break\r\n", "n = int(input())\r\ns = input()\r\na = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\nfor i in a:\r\n if (len(i) != len(s)):\r\n continue\r\n b = True\r\n for j in range(len(s)):\r\n if (s[j] != '.' and i[j] != '.' and s[j] != i[j]):\r\n b = False\r\n if b:\r\n print(i)\r\n exit(0)", "n=int(input())\r\ns=input()\r\na=['jolteon','flareon','umbreon','leafeon','glaceon','sylveon']\r\nif len(s)==6:\r\n print('espeon')\r\nelif len(s)==8:\r\n print('vaporeon')\r\nelse:\r\n lst=[]\r\n for i in range(4):\r\n if s[i]!='.':\r\n lst.append(i)\r\n res=[]\r\n for i in range(6):\r\n check=1\r\n for j in lst:\r\n if a[i][j]!=s[j]:\r\n check=0\r\n break\r\n if check==1:\r\n res.append(i)\r\n break\r\n print(a[res[0]])", "import sys\n\nn = int(sys.stdin.readline())\npokemon = sys.stdin.readline().strip()\n\npokemons = ['vaporeon', 'jolteon', 'flareon', 'espeon', 'umbreon', 'leafeon', 'glaceon', 'sylveon']\n\ndef whatPokemon(pokemon,pokemons):\n for name_pokemon in pokemons:\n if len(name_pokemon)==len(pokemon):\n goodPokemon = True\n for pos in range(len(pokemon)):\n if pokemon[pos] != '.':\n if pokemon[pos] != name_pokemon[pos]:\n goodPokemon = False\n break\n if goodPokemon:\n return name_pokemon\n \nprint(whatPokemon(pokemon,pokemons))", "n = int(input())\r\ns = input() \r\n\r\nif(n==6):\r\n print(\"espeon\")\r\nelif(n==8):\r\n print(\"vaporeon\")\r\nelse:\r\n l = [\"jolteon\", \"flareon\",\"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\n d = {}\r\n x = 0 \r\n for r in l:\r\n c = 0 \r\n for i in range(7):\r\n if(s[i]==r[i]):\r\n c=c+1 \r\n d[r]=c \r\n if(c>x):\r\n x = c \r\n \r\n for key in d.keys():\r\n if(d[key]==x):\r\n print(key)", "pokemons = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\nn = int(input())\r\ns = input()\r\nif n == 6:\r\n print(\"espeon\")\r\nelse:\r\n for pokemon in pokemons:\r\n oppor = True\r\n for i in range(len(s)):\r\n if len(s) == len(pokemon) and s[i] != '.' and s[i] != pokemon[i]:\r\n oppor = False\r\n if len(s) == len(pokemon) and oppor:\r\n print(pokemon)\r\n break\r\n", "import re\r\nn = input()\r\nlist = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\",\"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\ns = '^' + input() + '$'\r\nfor t in list:\r\n if re.match(s, t):\r\n print(t)\r\n break\r\n", "full = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\nn = int(input())\r\nstr = input()\r\nfor word in full:\r\n if(len(word) == n):\r\n status = True\r\n for i in range(n):\r\n if(str[i]=='.'):\r\n continue\r\n elif(str[i]==word[i]):\r\n continue\r\n else:\r\n status = False\r\n break\r\n if(status):\r\n print(word)", "pokemons = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\nnumero = int(input())\ncadena = input()\nfor pokemon in pokemons:\n if len(pokemon) == numero:\n i = 0\n found = True\n while i < numero and found:\n if cadena[i] != '.':\n if pokemon[i] != cadena[i]:\n found = False\n i += 1\n if found:\n print(pokemon)\n \t \t \t\t \t\t\t\t \t\t \t", "from re import match\r\n\r\ninput()\r\ns = input().strip()\r\nfor x in [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]:\r\n if match('^' + s + '$', x):\r\n print(x)\r\n exit(0)\r\n", "n = int(input())\r\ns = input()\r\nevol = ['vaporeon', 'jolteon', 'flareon', 'espeon', 'umbreon', 'leafeon', 'glaceon', 'sylveon']\r\n\r\nfor e in evol :\r\n if len(e) != n :\r\n continue\r\n for i in range(n):\r\n if s[i] != e[i] and s[i] != '.':\r\n break\r\n if i == n-1 :\r\n print(e)\r\n break\r\n\r\n", "import re\n\nn = int(input())\ns = input()\n\nl = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\n\nfor p in l:\n\tif len(p) != len(s):\n\t\tcontinue\n\tfor i in range(n):\n\t\tif s[i] != p[i] and s[i] != '.':\n\t\t\tbreak\n\telse:\n\t\tprint(p)\n", "import sys,re\r\nn=sys.stdin.readline().strip()\r\ns=sys.stdin.readline().strip()\r\npokemons=[\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\npokemons=list(filter(lambda x: len(x) == int(n), pokemons))\r\nd = {i: 0 for i in pokemons}\r\nfor i in range(int(n)):\r\n if s[i] == \".\":\r\n continue\r\n else:\r\n for j in pokemons:\r\n if j[i] == s[i]:\r\n d[j] += 1 \r\nprint(max(d, key=d.__getitem__))", "# Possible evolutions of Eevee\r\nevolutions = ['vaporeon', 'jolteon', 'flareon', 'espeon', 'umbreon', 'leafeon', 'glaceon', 'sylveon']\r\n\r\n# Read input\r\nn = int(input())\r\npattern = input()\r\n\r\n# Loop over evolutions and check each one against the pattern\r\nfor evo in evolutions:\r\n if len(evo) == n: # Check length\r\n match = True\r\n for i in range(n):\r\n if pattern[i] != '.' and pattern[i] != evo[i]: # Check letter\r\n match = False\r\n break\r\n if match: # If pattern matches, print evolution name and exit loop\r\n print(evo)\r\n break\r\n", "r = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\n\r\n\r\nn = int(input())\r\n\r\ns = str(input())\r\n\r\n\r\nfor el in range(8):\r\n if(n != len(r[el])):\r\n continue\r\n else:\r\n c = 0\r\n for j in range(len(r[el])):\r\n if(s[j] != '.'):\r\n if(s[j] != r[el][j]):\r\n c += 1\r\n break \r\n if(c == 0):\r\n print(r[el])\r\n break\r\n else:\r\n continue\r\n", "## I - Eevee\n\n# initial evolutions list\neevee_evolutions = [('vaporeon', 8), ('jolteon', 7),\n ('flareon', 7), ('leafeon', 7),\n ('espeon', 6), ('glaceon', 7),\n ('umbreon', 7), ('sylveon', 7)]\n\nstr_len = int(input())\n\ncrossword_str = [str(ch) for ch in input()]\n\nevolutions = [tup for tup in eevee_evolutions if tup[1] == str_len]\n\nfor idx, ch in enumerate(crossword_str):\n # print(evolutions)\n if ch != \".\":\n evolutions = [tup for tup in evolutions if tup[0][idx] == ch]\n\n# print(str_len)\n# print(crossword_str)\nprint(evolutions[0][0])\n \t \t\t \t\t \t\t \t \t \t \t \t\t \t \t", "import heapq\r\nfrom math import gcd,lcm\r\nfrom collections import Counter\r\n# Shortcut for input\r\ndef I(): return int(input())\r\ndef MI(): return map(int, input().split())\r\ndef MS(): return map(str, input().split())\r\ndef LI(): return list(map(int, input().split()))\r\ndef LI(): return list(map(int, input().split()))\r\ndef S(): return input()\r\n# Constants\r\nmod = 10**9 + 7\r\n\r\na = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\nn = I()\r\ns = S()\r\nans = []\r\nfor i in a:\r\n if len(i) == len(s):\r\n ans.append(i)\r\nfor i in ans:\r\n curr = i\r\n flag = 1\r\n for j in range(len(s)):\r\n if s[j].isalpha():\r\n if s[j] != curr[j]:\r\n flag = 0\r\n break\r\n if flag:\r\n print(i)\r\n break\r\n ", "evols = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\ndef agree(s,t):\r\n\tif len(s)!=len(t): return False\r\n\telse: return all([s[i]=='.' or s[i]==t[i] for i in range(len(s))])\r\nn = int(input())\r\ns = input()\r\nans = None\r\nfor evol in evols:\r\n\tif agree(s,evol):\r\n\t\tans = evol\r\nprint(ans)", "t = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\nn = int(input())\r\np = input()\r\nfor i in t:\r\n if n == len(i) and all(i[j] == p[j] for j in range(n) if p[j] != '.'): \r\n print(i)\r\n break ", "a = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\nn = int(input())\r\na = list(filter(lambda x: len(x) == n, a))\r\nb = input()\r\nc = a[:]\r\nfor i in range(len(a)):\r\n for j in range(n):\r\n if a[i][j] != b[j] and b[j] != '.':\r\n c.pop(c.index(a[i])); break\r\nprint(c[0])", "a = int(input())\npokemao = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\ns = input()\nfor i in range(8):\n flag =True\n for j in range(len(s)):\n # if(len(pokemao[i]) == len(s)):\n # flag = False\n if len(pokemao[i]) != len(s) or (s[j] != pokemao[i][j] and s[j] != '.'):\n flag = False\n if(flag == True):\n print(pokemao[i])\n break\n", "poks = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\n\r\nlength = input()\r\nunknown = input()\r\n\r\nlis = list(unknown)\r\nlisPossible = []\r\n\r\nfor pokie in poks:\r\n if len(lis) == len(pokie):\r\n lisPossible.append(pokie)\r\nctr = 0\r\nfor char in lis:\r\n lisRemove = []\r\n if char == '.':\r\n ctr+=1\r\n continue\r\n for pokie in lisPossible:\r\n if not char == pokie[ctr]:\r\n lisRemove.append(pokie)\r\n for poke in lisRemove:\r\n if poke in lisPossible:\r\n lisPossible.remove(poke)\r\n ctr+=1\r\n\r\nprint(lisPossible[0])\r\n\r\n", "six = [\"espeon\"]\nsix_v = [True]\nseven = [\"jolteon\", \"flareon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\nseven_v = [True]*6\neight = [\"vaporeon\"]\neight_v = [True]\n\nn = int(input())\noptions = []\noptions_v = []\nif n == 6:\n options = six\n options_v = six_v\nelif n == 7:\n options = seven\n options_v = seven_v\nelse:\n options = eight\n options_v = eight_v\n\ncrossword = input()\nfor i in range(len(crossword)):\n for j in range(len(options)):\n word = options[j]\n if crossword[i] != \".\" and crossword[i] != word[i]:\n options_v[j] = False\n\nfor i in range(len(options)):\n if options_v[i]:\n print(options[i])\n break\n\n\t\t \t\t\t \t \t \t \t \t\t \t\t\t \t", "arr = [[8,'vaporeon'],[7,'jolteon'],[7,'flareon'],[6,'espeon'],[7,'umbreon'],[7,'leafeon'],[7,'glaceon'],[7,'sylveon']]\r\ndef func(s,n):\r\n for i,k in arr:\r\n flag = True\r\n if n==i:\r\n for j in range(n):\r\n if s[j] != '.':\r\n if s[j] != k[j]:\r\n flag = False\r\n break\r\n if flag:\r\n return k\r\nn = int(input())\r\ns = input()\r\nprint(func(s,n))", "import re\r\ninput()\r\ns = input()\r\nx = None\r\nfor e in [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]:\r\n if re.fullmatch(s,e):\r\n x = e\r\nprint(x)", "choices = 'Vaporeon, Jolteon, Flareon, Espeon, Umbreon, Leafeon, Glaceon'.split(', ')\nchoices.append('Sylveon')\nchoices = list(map(lambda x: x.lower(), choices))\n\nn = int(input())\ns = input()\nfor can in choices:\n if n != len(can):\n continue\n isValid = True\n for i in range(n):\n if s[i] != '.' and s[i] != can[i]:\n isValid = False\n if isValid:\n print(can)\n break\n", "z = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\n\r\nn = int(input())\r\ns = input()\r\n\r\nz = [x for x in z if len(x) == n]\r\nfor x in z:\r\n for i in range(len(s)):\r\n if s[i] != \".\" and s[i] != x[i]:\r\n break\r\n elif i + 1 == len(s):\r\n print(x)\r\n quit()", "pokemons = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\n\r\nn = int(input())\r\n\r\nx = input()\r\n\r\ndef matches(pattern, word):\r\n if len(pattern) != len(word):\r\n return False\r\n for i in range(len(word)):\r\n if pattern[i] != '.' and pattern[i] != word[i]:\r\n return False\r\n return True\r\n\r\nfor pokemon in pokemons:\r\n if matches(x, pokemon):\r\n print(pokemon)\r\n break", "n = int(input())\nstring = input()\n\nif n == 6:\n print(\"espeon\")\n\nelif n == 7:\n\n if (\n (string[0] == 'j' or string[0] == '.')\n and ((string[1] == 'o' or string[1] == '.'))\n and ((string[2] == 'l' or string[2] == '.'))\n and ((string[3] == 't' or string[3] == '.'))\n ):\n print(\"jolteon\")\n\n elif(\n (string[0] == 'f' or string[0] == '.')\n and ((string[1] == 'l' or string[1] == '.'))\n and ((string[2] == 'a' or string[2] == '.'))\n and ((string[3] == 'r' or string[3] == '.'))\n ):\n print(\"flareon\")\n\n elif(\n (string[0] == 'u' or string[0] == '.')\n and ((string[1] == 'm' or string[1] == '.'))\n and ((string[2] == 'b' or string[2] == '.'))\n and ((string[3] == 'r' or string[3] == '.'))\n ):\n print(\"umbreon\")\n\n elif(\n (string[0] == 'l' or string[0] == '.')\n and ((string[1] == 'e' or string[1] == '.'))\n and ((string[2] == 'a' or string[2] == '.'))\n and ((string[3] == 'f' or string[3] == '.'))\n ):\n print(\"leafeon\")\n \n elif(\n (string[0] == 'g' or string[0] == '.')\n and ((string[1] == 'l' or string[1] == '.'))\n and ((string[2] == 'a' or string[2] == '.'))\n and ((string[3] == 'c' or string[3] == '.'))\n ):\n print(\"glaceon\")\n\n elif(\n (string[0] == 's' or string[0] == '.')\n and ((string[1] == 'y' or string[1] == '.'))\n and ((string[2] == 'l' or string[2] == '.'))\n and ((string[3] == 'v' or string[3] == '.'))\n ):\n print(\"sylveon\")\n \nelse:\n print(\"vaporeon\")\n\n\n \t \t\t\t \t\t \t\t \t\t\t\t \t\t \t \t\t\t", "def bestmatch(n, st):\r\n namelist = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\n for i in namelist[:]:\r\n if len(i) != n:\r\n namelist.remove(i)\r\n\r\n matchcount = []\r\n for name in namelist:\r\n c = 0\r\n for j in range(n):\r\n if st[j] == name[j]:\r\n c += 1\r\n matchcount.append(c)\r\n return(namelist[matchcount.index(max(matchcount))])\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n st = input()\r\n print(bestmatch(n, st))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n\r\n", "n = int(input())\r\ns = input()\r\na = ['vaporeon', 'jolteon', 'flareon', 'espeon', 'umbreon', 'leafeon', 'glaceon', 'sylveon']\r\nposs = []\r\nfor i in a:\r\n if len(i) == n:\r\n poss.append(i)\r\n\r\ncnt = 0\r\nsimilar = 0\r\nfor i in s:\r\n if i != '.':\r\n cnt += 1\r\n \r\nfor i in poss:\r\n for j in range(n):\r\n\r\n if s[j] == i[j]:\r\n similar += 1\r\n if similar == cnt:\r\n print(i)\r\n similar = 0\r\n", "names = ['vaporeon', 'jolteon', 'flareon', 'espeon',\r\n 'umbreon', 'leafeon', 'glaceon', 'sylveon']\r\n\r\nn, s = int(input()), input()\r\n\r\nfor name in names:\r\n if (len(name) == n and\r\n all(ch1 == '.' or ch1 == ch2 for ch1, ch2 in zip(s, name))):\r\n print(name)\r\n break", "se = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\ninput()\r\ns = input()\r\nfor i in se:\r\n if len(i) == len(s):\r\n res = False\r\n for j in range(len(s)):\r\n if s[j] != i[j] and s[j] != '.':\r\n res = True\r\n if not res: print(i)\r\n ", "import re\r\nl=(x+'eon' for x in ['vapor','jolt','flar','esp','umbr','leaf','glac','sylv'])\r\ninput()\r\nprint(next(filter(re.compile(input()).fullmatch, l)))\r\n", "import string\n\nevolutions = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\nn = int(input())\nevolutions = list(filter(lambda x: len(x) == n, evolutions))\nguess = input()\nletterGuess = list(filter(lambda x: x in string.ascii_lowercase, guess))\ncerto = False\nfor pokemon in evolutions:\n results = 0\n for i in range(len(guess)):\n if guess[i] in string.ascii_lowercase:\n if guess[i] == pokemon[i]:\n results += 1\n if results == len(letterGuess):\n print(pokemon)\n \t\t\t \t \t\t\t\t\t\t\t\t\t\t\t \t \t \t \t \t", "import re\r\np=[\"espeon\", \"jolteon\", \"flareon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\",\"vaporeon\"]\r\nn=input()\r\ns=input()\r\nx=[i for i in p if re.search(s,i)]\r\nprint(x[0])", "# coding: utf-8\npokemon = ['vaporeon', 'jolteon', 'flareon', 'espeon', 'umbreon', 'leafeon', 'glaceon', 'sylveon']\nn = int(input())\na = input()\nfor p in pokemon:\n if len(p) == n:\n for i in range(n):\n if a[i] != '.' and a[i] != p[i]:\n break\n else:\n print(p)\n exit()\n", "# /**\r\n# * author: brownfox2k6\r\n# * created: Tue 18 Apr 2023 at 21:04:41 UTC+7, Hanoi, Vietnam\r\n# **/\r\n\r\nfrom re import fullmatch\r\n\r\na = {\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"}\r\ninput()\r\ns = input()\r\n\r\nfor x in a:\r\n if fullmatch(s, x):\r\n print(x)\r\n exit()", "n=int(input())\r\nx=[\"jolteon\", \"flareon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\nmm=input()\r\nif n==6:\r\n print(\"espeon\")\r\nelif n==8:\r\n print(\"vaporeon\")\r\nelse:\r\n for i in range(len(x)):\r\n ff=1\r\n for j in range(len(x[i])):\r\n if mm[j]!='.' and x[i][j]!=mm[j]:\r\n ff=0\r\n break\r\n if ff==1:\r\n print(x[i])\r\n break", "'''input\n7\n.l.r.o.\n'''\nn = int(input())\ns = input()\nl = [i for i in [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"] if len(i) == n]\nfor x in l:\n\tfor y in range(n):\n\t\tif all(s[y] == x[y] for y in range(n) if s[y] != \".\"):\n\t\t\tprint(x)\n\t\t\tbreak", "import re\n\npokemons = ['vaporeon', 'jolteon', 'flareon', 'espeon', 'umbreon', 'leafeon', 'glaceon', 'sylveon']\n\nint(input())\n\npattern = input()\n\nif len(pattern) == 6:\n print(\"espeon\")\nelif len(pattern) == 8:\n print(\"vaporeon\")\nelse:\n for word in pokemons:\n if re.match(pattern, word):\n print(word)\n\n", "t= int(input())\r\neevee = input()\r\nindex = [ i for i in range(len(eevee)) if eevee[i] != '.']\r\n\r\nall_eevee = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\n\r\nfor i in all_eevee:\r\n if len(i)!=t:\r\n continue\r\n ans = True\r\n for j in index:\r\n if i[j]!=eevee[j]:\r\n ans= False\r\n if ans:\r\n print(i)", "n = int(input())\r\nword = input()\r\nnames = [\"jolteon\", \"flareon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\nnames2 = names[:]\r\nif n == 8:\r\n print('vaporeon')\r\nelif n == 6:\r\n print('espeon')\r\nelse:\r\n p = []\r\n for i in range(len(word)):\r\n if word[i] == '.':\r\n p.append(i)\r\n for i in range(len(names)):\r\n for j in range(len(names[i])):\r\n if j in p:\r\n names[i] = names[i][:j] + '.' + names[i][j + 1:]\r\n print(names2[names.index(word)])", "import re\r\nn = int(input())\r\npattern = input()\r\nnames = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\n\r\npossibles = list(filter(lambda x:len(x)==n, names))\r\n\r\nfor s in possibles:\r\n if re.match(pattern, s):\r\n print(s)\r\n break\r\n", "eevee_evolutions = {\n\t6: ['espeon'],\n\t7: ['flareon', 'jolteon', 'umbreon', 'leafeon', 'glaceon', 'sylveon'],\n\t8: ['vaporeon']\n}\n\nletters_count = int(input())\npossible_evolutions = eevee_evolutions[letters_count]\n\nknown_letters = input()\nfor index in range(len(known_letters)):\n\tif known_letters[index] != '.':\n\t\tfiltered = []\n\t\tfor pokemon in possible_evolutions:\n\t\t\tif known_letters[index] == pokemon[index]:\n\t\t\t\tfiltered.append(pokemon)\n\t\tpossible_evolutions = filtered\n\t\tif len(filtered) == 1:\n\t\t\tbreak\n\t\t\n\nprint(possible_evolutions[0])\n \t \t \t \t\t \t\t \t\t\t\t\t\t\t", "unl = int(input())\r\na = str(input())\r\nb = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\nx = 0\r\nwhile x < 8:\r\n if len(b[x]) == len(a):\r\n y = 0\r\n match = 0\r\n while y < unl:\r\n if a[y] == '.' or a[y] == b[x][y]:\r\n match += 1\r\n else:\r\n break\r\n y += 1\r\n if match == unl:\r\n print(b[x])\r\n break\r\n x += 1", "if __name__ == '__main__':\r\n book = ('vaporeon', 'jolteon', 'flareon', 'espeon', 'umbreon', 'leafeon', 'glaceon', 'sylveon')\r\n n = int(input())\r\n line = str(input())\r\n for it in book:\r\n if len(it) == n:\r\n flag = True\r\n for i, j in zip(line, it):\r\n if i != '.' and i != j:\r\n flag = False\r\n if flag:\r\n print(it)\r\n break\r\n", "import sys\r\ninput = sys.stdin.readline\r\nn = int(input())\r\ns = input().strip('\\n')\r\nname = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\nfor x in name:\r\n if len(x) == n:\r\n f = True\r\n for i in range(n):\r\n if s[i]!='.' and s[i]!=x[i]:\r\n f = False\r\n break\r\n if f:\r\n print(x)\r\n break\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Oct 16 14:01:26 2023\r\n\r\n@author: lakne\r\n\"\"\"\r\n\r\nn = int(input())\r\nstring = input()\r\n\r\npokemon_8 = [\"vaporeon\"]\r\npokemon_7 = [\"jolteon\", \"flareon\", \"umbreon\", \"leafeon\", \"sylveon\", \"glaceon\"]\r\npokemon_6 = [\"espeon\"]\r\n\r\n\r\nif n == 6:\r\n print(pokemon_6[0])\r\nelif n == 8:\r\n print(pokemon_8[0])\r\nelse:\r\n for j in range(6):\r\n for i in range(7):\r\n if string[i] == pokemon_7[j][i] or string[i] == \".\":\r\n x = 0\r\n else:\r\n x = 1\r\n break\r\n if x == 0:\r\n print(pokemon_7[j])\r\n break", "n = int(input())\r\ns = input()\r\nif(n==6):\r\n print(\"espeon\")\r\nelif(n==8):\r\n print(\"vaporeon\")\r\nelse:\r\n if((s[0]=='j' or s[0]=='.') and (s[1]=='o' or s[1]=='.') and (s[2]=='l' or s[2]=='.') and (s[3]=='t' or s[3]=='.') and n==7):\r\n print(\"jolteon\")\r\n elif((s[0]=='f' or s[0]=='.') and (s[1]=='l' or s[1]=='.') and (s[2]=='a' or s[2]=='.') and (s[3]=='r' or s[3]=='.') and n==7):\r\n print(\"flareon\")\r\n elif((s[0]=='u' or s[0]=='.') and (s[1]=='m' or s[1]=='.') and (s[2]=='b' or s[2]=='.') and (s[3]=='r' or s[3]=='.') and n==7):\r\n print(\"umbreon\")\r\n elif((s[0]=='l' or s[0]=='.') and (s[1]=='e' or s[1]=='.') and (s[2]=='a' or s[2]=='.') and (s[3]=='f' or s[3]=='.') and n==7):\r\n print(\"leafeon\")\r\n elif((s[0]=='g' or s[0]=='.') and (s[1]=='l' or s[1]=='.') and (s[2]=='a' or s[2]=='.') and (s[3]=='c' or s[3]=='.') and n==7):\r\n print(\"glaceon\")\r\n elif((s[0]=='s' or s[0]=='.') and (s[1]=='y' or s[1]=='.') and (s[2]=='l' or s[2]=='.') and (s[3]=='v' or s[3]=='.') and n==7):\r\n print(\"sylveon\")", "def main():\n n = int(input())\n evolve = input()\n\n tam = len(evolve)\n\n if(tam == 8):\n print(\"vaporeon\")\n elif(tam == 6):\n print(\"espeon\")\n else:\n if(evolve[0] == 'j' or evolve[1] == 'o' or evolve[3] == 't'):\n print(\"jolteon\")\n elif(evolve[0] == 'f' or ((evolve[1] == 'l' or 1) and evolve[2] == 'a' and evolve[3] == 'r') or (evolve[1] == 'l' and evolve[3] == 'r')):\n print(\"flareon\")\n elif(evolve[0] == 'u' or evolve[1] == 'm' or evolve[2] == 'b'):\n print(\"umbreon\")\n elif(evolve[0] == 'l' or evolve[1] == 'e' or evolve[3] == 'f'):\n print(\"leafeon\")\n elif(evolve[0] == 'g' or evolve[3] == 'c'):\n print(\"glaceon\")\n elif(evolve[0] == 's' or evolve[1] == 'y' or evolve[3] == 'v'):\n print(\"sylveon\")\n \nif __name__ == '__main__':\n main()\n \t \t\t \t\t\t \t\t\t \t \t \t \t\t\t \t", "import re\r\n\r\noptions = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\ninput()\r\nmatcher = re.compile('^' + input().strip() + '$')\r\nfor a in options:\r\n if matcher.search(a) is not None:\r\n print(a)\r\n break", "evolutions = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\nn = int(input())\ns = input()\nfor i in range(8):\n\tj = 0\n\tif len(evolutions[i]) == n:\n\t\twhile j < n:\n\t\t\tif evolutions[i][j] != s[j] and s[j] != '.':\n\t\t\t\tbreak\n\t\t\tj += 1\n\t\tif j == n:\n\t\t\tprint(evolutions[i])\n\t\t\tbreak\n", "def func(a, b):\r\n for i in a:\r\n if i != \".\" and b[a.index(i)] != i:\r\n return 0\r\n return 1\r\n\r\nn = int(input())\r\ns = input()\r\n\r\nl = [\"flareon\", \"jolteon\", \"vaporeon\", \"leafeon\", \"glaceon\", \"umbreon\", \"espeon\", \"sylveon\"]\r\n\r\nfor i in l:\r\n if func(s, i) == 1 and len(i) == n:\r\n print(i)", "import re\nn, p = int(input()), re.compile(input())\nprint(next(x for x in [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"] if len(x) == n and p.match(x)))\n", "import sys\na =\\\n ['vaporeon','jolteon','flareon','espeon','umbreon','leafeon','glaceon','sylveon']\nn = int(input())\ns = input()\nfor i in a:\n if len(i) == n:\n ss = 0\n for x in range(n):\n if s[x] == i[x]:\n ss+=1\n if ss == n-s.count('.'):\n print(i)\n\n", "# -- code beginning\nn = int(input())\ns = input()\nvrs = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"] \ndef match(a, b):\n if len(a) != len(b): return False\n for (ac, bc) in zip(a, b):\n if ac == '.' or bc == '.': continue\n elif ac != bc: return False\n return True\n\nfor i in vrs:\n if match(s, i):\n print(i)\n break\n\n# -- code end\n", "__author__ = 'Gleb'\nvar=['vaporeon','jolteon','flareon','espeon','umbreon','leafeon','glaceon','sylveon']\nn=int(input())\ns=input()\nfor i in range(8):\n if n==len(var[i]):\n flag=0\n for j in range(n):\n if not(s[j]=='.'):\n if s[j]==var[i][j]:\n flag+=1\n else:\n flag+=1\n if flag==n:\n print(var[i])\n", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-29 23:09:51\nLastEditTime: 2021-11-29 23:15:43\nDescription: Eevee\nFilePath: CF452A.py\n'''\n\n\ndef func():\n pokemons = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\",\n \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\n n = int(input())\n s = input().strip()\n for item in pokemons:\n if n == len(item):\n for i in range(n):\n if s[i] != \".\" and s[i] != item[i]:\n break\n else:\n print(item)\n break\n\n\nif __name__ == '__main__':\n func()\n", "n = int(input())\r\ns = input()\r\nb = n - s.count(\".\")\r\not = \"-\"\r\np =[\"vaporeon\",\"jolteon\",\"flareon\",\"espeon\",\"umbreon\",\"leafeon\",\"glaceon\",\"sylveon\"]\r\nfor name in p:\r\n if len(name) != n:\r\n continue\r\n cnt = 0\r\n for i in range(n):\r\n if s[i] == \".\":\r\n continue\r\n if name[i] == s[i]:\r\n cnt = cnt + 1\r\n else:\r\n break\r\n if cnt == b:\r\n ot = name\r\n\r\nprint(ot)", "#import sys\n#\n#count=0\n#\n#for line in sys.stdin:\n# count +=1\n# if count > 1:\n# if len(line.strip('\\n')) <= 10:\n# print(line.strip('\\n'))\n# if len(line.strip('\\n')) > 10:\n# print(line[0] + str((len(line.strip('\\n')))-2) + line[-2])\n\n#vowels = [\"A\", \"a\", \"O\", \"o\", \"Y\", \"y\", \"E\", \"e\", \"U\", \"u\", \"I\", \"i\"]\n#output = \"\"\n#\n#string = input()\n#for char in range(len(string)):\n# if string[char] in vowels:\n# pass\n# else:\n# output += \".\"\n# output += string[char].lower()\n#print(output)\n\n\n#import sys\n#\n#count=0\n#\n#for line in sys.stdin:\n# count +=1\n# if count == 2:\n# a = line.strip('\\n').split()\n# a.sort()\n# print(a)\n# if count == 3:\n# b = line.strip('\\n').split()\n# b.sort()\n# print(b)\n# if count == 4:\n# c = line.strip('\\n').split()\n# c.sort()\n# print(c)\n#\n#count=0\n#\n#def removeFirstDouble(a, b):\n# if a[0] == b[0]:\n# a.remove(a[0])\n# b.remove(b[0])\n#\n#removeFirstDouble(a,b)\n#print(a)\n\n\n\n#import sys\n#\n#count=0\n#\n#for line in sys.stdin:\n# count +=1\n# if count == 1:\n# a = line.strip('\\n')\n# if count == 2:\n# b = line.strip('\\n')\n#\n#if a == b[::-1]:\n# print(\"YES\")\n#else:\n# print(\"NO\")\n\n\n#class Stack:\n# def __init__(self):\n# self.items = []\n#\n# def isEmpty(self):\n# return self.items == []\n#\n# def push(self, item):\n# self.items.append(item)\n#\n# def pop(self):\n# return self.items.pop()\n#\n# def peek(self):\n# return self.items[len(self.items)-1]\n#\n# def size(self):\n# return len(self.items)\n#\n#s=Stack()\n#numbers = [\"1\", \"2\", \"3\", \"4\", \"5\", \"6\", \"7\", \"8\", \"9\", \"0\"]\n#operations = [\"+\", \"*\"]\n#\n#string = input()\n#for char in range(len(string)):\n# if string[char] in numbers:\n# print(string[char])\n# s.push(string[char])\n# else:\n# a = s.pop()\n# b = s.pop()\n# print(eval(a + string[char] + b))\n\n\n#import sys\n#\n#string = input()\n#result = (string.find(\"0\"*7) > -1) or (string.find(\"1\"*7) > -1)\n#\n#if result:\n# print(\"YES\")\n#else:\n# print(\"NO\")\n\n\n#import sys\n#\n#cachedInput = sys.stdin\n#count=0\n#totalNumberInLecture = 0\n#numberOfWordsInEachLanguage = 0\n#dictionary = {}\n#result = []\n#\n#def returnShortest(list):\n# if len(list[0]) <= len(list[1]):\n# return list[0]\n# else:\n# return list[1]\n#\n#line = input()\n#a = line.strip('\\n').split()\n#totalNumberInLecture = int(a[0])\n#numberOfWordsInEachLanguage = int(a[1])\n##print(totalNumberInLecture)\n##print(numberOfWordsInEachLanguage)\n#\n#\n#for line in cachedInput:\n# count +=1\n# if count <= numberOfWordsInEachLanguage:\n# currentLine = line.strip('\\n').split()\n# dictionary[currentLine[0]] = returnShortest(currentLine)\n## print(dictionary)\n# else:\n# lecture = line.strip('\\n').split()\n#\n#\n#\n##print(dictionary)\n#for word in lecture:\n# result.append(dictionary[word])\n#\n#print(\" \".join(result))\n\n\nimport sys\n\n\nnameList = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\n\nnameMap = {\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"}\n\nresultList = []\n\nline = input()\na = line.strip('\\n').split()\nlength = int(a[0])\n\n#print(length)\n\nline = input()\nmystring = line.strip('\\n')\nmylist = list(mystring)\n#print(mylist)\n\ncount = 0\n\nfor name in nameList:\n if length == len(name):\n count = 0\n for char in mylist:\n if char != \".\" and name[count] != char:\n break\n count += 1\n else:\n print(name)\n\n", "w = ['vaporeon', 'jolteon', 'flareon', 'espeon', 'umbreon', 'leafeon', 'glaceon', 'sylveon']\r\nn = int(input())\r\ns = input()\r\np = [w[i] for i in range(len(w)) if len(w[i]) == n]\r\n#print(p)\r\nfor i in range(n):\r\n if s[i] == '.': continue\r\n new_pos = []\r\n for j in p:\r\n if j[i] == s[i]: new_pos.append(j)\r\n p = new_pos[:]\r\nprint(p[0])", "from sys import stdin\r\n\r\ndef main():\r\n dic=[[\"j\",\"o\",\"l\",\"t\",\"e\",\"o\",\"n\"],[\"f\",\"l\",\"a\",\"r\",\"e\",\"o\",\"n\"],[\"u\",\"m\",\"b\",\"r\",\"e\",\"o\",\"n\"],[\"l\",\"e\",\"a\",\"f\",\"e\",\"o\",\"n\"],[\"g\",\"l\",\"a\",\"c\",\"e\",\"o\",\"n\"],[\"s\",\"y\",\"l\",\"v\",\"e\",\"o\",\"n\"]]\r\n inp=stdin\r\n numero=int(inp.readline().strip())\r\n secreto=inp.readline().strip()\r\n if numero == 6:\r\n print(\"espeon\")\r\n elif numero == 8:\r\n print(\"vaporeon\")\r\n else:\r\n coincidencia=(0,0)\r\n for i in range(0,len(dic)):\r\n coincide=0\r\n for t in range(0,7):\r\n if secreto[t]==dic[i][t]:\r\n coincide=coincide+1\r\n if coincidencia[1]<coincide:\r\n coincidencia=(i,coincide)\r\n \r\n print(''.join(dic[coincidencia[0]]))\r\n \r\nmain()", "evo = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\nt = int(input())\r\nname = input()\r\n \r\npos= []\r\nfor i in evo:\r\n if len(i)==t:\r\n pos.append(i)\r\n#print(pos)\r\nfinal = []\r\nfor j in pos:\r\n c=True\r\n for i in range(t):\r\n if(name[i]==\".\" or name[i]==j[i]):\r\n \r\n continue\r\n else:\r\n c= False\r\n if(c):\r\n print(j)\r\n break", "names = ['vaporeon', 'jolteon', 'flareon', 'espeon', 'umbreon', 'leafeon', 'glaceon', 'sylveon']\r\nn = int(input())\r\ns = input()\r\nfor name in names:\r\n flag = len(name) == len(s)\r\n if flag:\r\n for i in range(len(s)):\r\n if s[i] != '.' and s[i] != name[i]:\r\n flag = False\r\n if flag:\r\n print(name)\r\n break\r\n \r\n ", "def prov(s2):\r\n global s1\r\n if len(s1)!=len(s2):\r\n return False\r\n for i in range(len(s1)):\r\n if s1[i]!=s2[i] and s1[i]!='.':\r\n return False\r\n print(s2)\r\n exit(0)\r\nn=int(input())\r\ns1=input().strip()\r\nb=[\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\nfor i in b:\r\n prov(i)", "import re\ninput()\nprint(next(filter(re.compile(input() + '$').match, [x + 'eon' for x in ['vapor', 'jolt', 'flar', 'esp', 'umbr', 'leaf', 'glac', 'sylv']])))\n", "n=int(input())\r\ns=input()\r\na=[\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\nx=0\r\nfor i in range(8):\r\n if(len(s)==len(a[i])):\r\n for j in range(len(s)):\r\n if(s[j]!='.' and s[j]!=a[i][j]):\r\n x=1\r\n break\r\n if(x):\r\n x=0\r\n else:\r\n print(a[i])\r\n break", "pokemon = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\n\nlength = int(input())\nunknown_name = input()\n\nfor current_pokemon in pokemon:\n if len(current_pokemon) != length:\n continue\n\n for i, c in enumerate(unknown_name):\n if c == '.':\n continue\n\n if current_pokemon[i] != c:\n break\n else:\n print(current_pokemon)", "def isOk(s, t):\n if len(s) != len(t):\n return False\n for i in range(len(s)):\n if t[i] != '.' and s[i] != t[i]:\n return False\n return True\n\ndef main():\n A = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\n\n n = int(input())\n t = input()\n\n for s in A:\n if isOk(s, t):\n print(s)\n return\n\nmain()", "import re\r\ninput()\r\ni='^'+input()+'$'\r\nps = ['vaporeon', 'jolteon', 'flareon', 'espeon', 'umbreon', 'leafeon', 'glaceon', 'sylveon']\r\nfor p in ps:\r\n\tif re.match(i, p):\r\n\t\tprint(p)\r\n\t\tbreak\r\n", "n=int(input())\r\nclue=str(input())\r\nnamelist=[\"jolt\", \"flar\", \"umbr\", \"leaf\", \"glac\", \"sylv\"]\r\nnotname=[]\r\n\r\nif n==8:\r\n\tprint('vaporeon')\r\n\tquit()\r\nif n==6:\r\n\tprint('espeon')\r\n\tquit()\r\n\r\nclue=clue[:-3]\r\n\r\nfor i in range(4):\r\n\tfor name in namelist:\r\n\t\tif name not in notname:\r\n\t\t\tif clue[i]!='.' and clue[i]!=name[i]:\r\n\t\t\t\tnotname.append(name)\r\n\r\nfor name in namelist:\r\n\tif name not in notname:\r\n\t\tprint(name+'eon')\r\n\t\tquit()", "import re\r\n\r\nps = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\n\r\nn = int(input())\r\npat = re.compile(input())\r\n\r\nfor p in ps:\r\n if len(p) != n:\r\n continue\r\n if pat.match(p):\r\n print(p)\r\n exit(0)\r\n", "n=int(input())\r\ns=input()\r\nlist=[\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\ni=0\r\nwhile(i<8):\r\n if(len(list[i])==n):\r\n j=0\r\n while(j<n):\r\n if(s[j]!='.' and s[j]!=list[i][j]):\r\n break\r\n j+=1\r\n if(j==n):\r\n print(list[i])\r\n exit()\r\n i+=1\r\n ", "num = int(input())\r\nclue = str(input())\r\nnames = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\nfor evo in names:\r\n flag = True\r\n if len(evo) == num:\r\n for i in range(num):\r\n if clue[i] != '.' and clue[i] != evo[i]:\r\n flag = False\r\n break\r\n if flag == True:\r\n print(evo)", "eve = {\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"}\r\nn = int(input())\r\nword = input()\r\neve = eve.difference({s for s in eve if len(s) != n})\r\nfor i,c in enumerate(word):\r\n if c!='.': eve = eve.difference({s for s in eve if s[i] != c})\r\nprint(list(eve)[0])", "pokemons = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\n\nlength = int(input())\nmisspelled = input()\n\ncur_pok = list(filter(lambda x: len(x) == length, pokemons))\n\nfor c in range(0, len(misspelled)):\n if misspelled[c] != '.':\n cur_pok = list(filter(lambda x: x[c] == misspelled[c], cur_pok))\n\nprint(cur_pok[0])", "poke = [ \"jolteon\", \"flareon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\npoke2 = []\n\nsize = int(input())\nentrada = str(input())\n\nif(size == 8):\n print(\"vaporeon\")\n exit()\nif(size == 6):\n print(\"espeon\")\n exit()\n\n\nfor i,e in enumerate(entrada):\n if(e == '.'):\n continue\n for p in poke:\n if(p[i] == e):\n poke2.append(p)\n\n poke = poke2\n poke2 = []\n\nprint(poke[0])\n\n \t \t \t\t\t \t \t\t\t \t\t\t \t\t", "def eevee(n:int, pokemon: str) -> str:\n if (n == 6):\n return 'espeon'\n \n if (n == 8):\n return 'vaporeon'\n \n pok_seven = ['jolteon', 'flareon', 'umbreon', 'leafeon', 'glaceon', 'sylveon']\n\n count_letters = len(pokemon.replace('.', '', 6).strip())\n\n for i in range(6):\n count_eq_letter = 0\n for j in range(n):\n if pokemon[j] != '.':\n if (pok_seven[i][j] == pokemon[j]):\n count_eq_letter += 1\n \n if (count_eq_letter == count_letters):\n return pok_seven[i]\n\n# Inputs\nn = int(input())\npokemon = input()\n\nprint (eevee(n, pokemon))\n\n \t\t\t \t\t\t \t\t\t\t\t \t\t \t \t\t", "S = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\nn = int(input())\r\ns = input()\r\nfor x in S :\r\n if (len(x) == n) : \r\n for a, b in zip(x, s):\r\n if b != '.' and a != b :\r\n break;\r\n else :\r\n print(x);\r\n break;\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nl = [\"jolteon\", \"flareon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\n\r\nn = int(input())\r\nif n == 6:\r\n print(\"espeon\")\r\nelif n == 8:\r\n print(\"vaporeon\")\r\nelse:\r\n s = input()[:-1]\r\n\r\n m, d = 0, ''\r\n for j in l:\r\n c = 0\r\n for i in range(4):\r\n if j[i] == s[i]:\r\n c += 1\r\n if c > m:\r\n m = c\r\n d = j\r\n print(d)", "n=int(input())\r\ns=input()\r\nl=['vaporeon','jolteon','flareon','espeon','umbreon','leafeon','glaceon','sylveon']\r\nfor i in l:\r\n c=0\r\n if len(s)!=len(i):\r\n pass\r\n else:\r\n for j in range(len(s)):\r\n if s[j]==i[j] or s[j]=='.':\r\n c+=1\r\n if c==len(i):\r\n print(i)\r\n break\r\n ", "n = int(input())\r\ns = input()\r\nd = {\"vaporeon\", \"jolteon\", \"flareon\", 'espeon',\r\n 'umbreon', 'leafeon', 'glaceon', 'sylveon'}\r\nfor pokemon in d:\r\n if len(pokemon) != n:\r\n continue\r\n is_ok = True\r\n for i in range(n):\r\n if s[i] != '.':\r\n if pokemon[i] != s[i]:\r\n is_ok = False\r\n break\r\n if is_ok:\r\n print(pokemon)\r\n exit(0)", "\nd={}\n\ndef compute(s, i, root):\n if i>=len(root):\n d[s]=root\n return\n compute(s+root[i], i+1, root)\n compute(s+'.', i+1, root)\nn=int(input())\ns=input().strip()\nstore=['vaporeon', 'jolteon', 'flareon', 'espeon', 'umbreon', 'leafeon', 'glaceon', 'sylveon']\nfor x in d:\n print(x, d[x])\nfor x in store:\n compute('', 0, x)\nprint(d[s])", "import re\r\n\r\nn = int(input())\r\nm = re.compile(input())\r\ngueses = []\r\nevolves = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\n\r\nfor x in evolves:\r\n if m.match(x): gueses.append(x)\r\n \r\nfor x in gueses:\r\n if len(x) == n: print(x)", "names = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\n\nl = input()\nn = input()\n\nfor name in names:\n\tif len(name) != len(n):\n\t\tcontinue\n\tok = True\n\tfor i in range(len(name)):\n\t\tif n[i] == '.':\n\t\t\tcontinue\n\t\tif n[i] != name[i]:\n\t\t\tok = False\n\tif ok:\n\t\tprint(name)\n\t\tbreak\n", "def match(p, s):\r\n if len(p) != len(s):\r\n return False\r\n for d, c in zip(p, s):\r\n if d not in ('.', c):\r\n return False\r\n return True\r\n\r\nl = ['vaporeon', 'jolteon', 'flareon', 'espeon',\r\n 'umbreon', 'leafeon', 'glaceon', 'sylveon']\r\n\r\ninput()\r\np = input()\r\nprint(next(x for x in l if match(p, x)))\r\n", "a6 = ['espeon']\r\na7 = ['jolteon', 'flareon', 'umbreon', 'leafeon', 'glaceon', 'sylveon']\r\na8 = ['vaporeon']\r\nk = int(input())\r\nn = input()\r\nz = 0\r\nif k == 6:\r\n print('espeon')\r\nelif k == 8:\r\n print('vaporeon')\r\nelse:\r\n n1 = list(n)\r\n for i in a7:\r\n i1 = list(i)\r\n for j in range(len(i1)):\r\n if n[j] == '.' or n[j] == i1[j]:\r\n z+=1\r\n if z == 7:\r\n print(i)\r\n break\r\n z = 0", "n = int(input())\ns = input()\nl = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\n\nans = 0\nfor i in range(0, len(l)):\n if len(l[i]) != n:\n continue\n\n find = True\n for j in range(n):\n if l[i][j] != s[j] and s[j] != '.':\n find = False\n break\n\n if find:\n ans = i\n break\n\nprint(l[i])\n", "n, s = int(input()), input()\np = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\nres = next(c for c in p if len(c) == len(s) and all(i == j or j == \".\" for i, j in zip(c, s)))\nprint(res)\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\nimport re\r\ninput()\r\nprint(next(filter(re.compile(input()[:-3] + '$').match, ['vapor', 'jolt', 'flar', 'esp', 'umbr', 'leaf', 'glac', 'sylv'])) + 'eon')\r\n", "#-------------------------------------------------------------------------------\r\n# Name: Codeforces\r\n# Author: Gogol\r\n#-------------------------------------------------------------------------------\r\nimport sys\r\nfrom math import *\r\n\r\ndef solve():\r\n n = input()\r\n s = input()\r\n a = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\n x,y = -1,0\r\n for aa in a:\r\n k = 0\r\n if (len (aa) == len(s)):\r\n for i in range(len(aa)):\r\n if (aa[i] == s[i]):\r\n k+=1\r\n else:\r\n continue\r\n if ( k > x):\r\n x = k\r\n y = aa\r\n print(y) \r\nsolve()\r\n", "import re\r\nn = int(input())\r\nstr = input()\r\nstr = str.replace(\".\",\"\\D\")\r\npattern = re.compile(\"^\"+str+\"$\")\r\nfor s in {\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"}:\r\n if (pattern.search(s)):\r\n print(s)\r\n break", "import re\r\n\r\nlength = int(input())\r\npokemons = list(filter(lambda x: len(x) == length,\r\n [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]))\r\ns = input()\r\ncleaned_s = re.sub(r'\\.', '.*', s)\r\nfor i in pokemons:\r\n if re.findall(f'{cleaned_s}', i):\r\n print(i)\r\n", "import re\ninput()\ni='^'+input()+'$'\nps = ['vaporeon', 'jolteon', 'flareon', 'espeon', 'umbreon', 'leafeon', 'glaceon', 'sylveon']\nfor p in ps:\n\tif re.match(i, p):\n\t\tprint(p)\n\t\tbreak\n", "b=[\"vaporeon\", \"jolteon\", \"flareon\" , \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\nn=int(input())\r\na=input()\r\nc=0\r\n# for x in a:\r\n# for y in b:\r\n# for z in y:\r\n# if\r\nb=[x for x in b if len(x)==n]\r\nfor word in b:\r\n for x in range(n):\r\n if a[x]=='.':\r\n continue\r\n elif a[x]!=word[x]:\r\n break\r\n if x+1==n:\r\n print(word)\r\n\r\n", "a = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\nn = input()\r\ns = input()\r\nres = \"\"\r\nfor k in a:\r\n if len(k) == len(s):\r\n cnt = 0\r\n for i in range(len(s)):\r\n if (k[i] == s[i]) or (s[i] == '.'):\r\n cnt+=1\r\n if cnt == len(s):\r\n print(k) \r\n \r\n ", "import re\r\n\r\nt = int(input())\r\npat = input();\r\npat ='^'+pat+'$'\r\nif re.match( pat, \"vaporeon\", re.M|re.I):\r\n print (\"vaporeon\")\r\nelif re.match( pat, \"jolteon\", re.M|re.I):\r\n print (\"jolteon\")\r\nelif re.match( pat, \"flareon\", re.M|re.I):\r\n print (\"flareon\")\r\nelif re.match( pat, \"espeon\", re.M|re.I):\r\n print (\"espeon\")\r\nelif re.match( pat, \"umbreon\", re.M|re.I):\r\n print (\"umbreon\")\r\nelif re.match( pat, \"leafeon\", re.M|re.I):\r\n print (\"leafeon\")\r\nelif re.match( pat, \"glaceon\", re.M|re.I):\r\n print (\"glaceon\")\r\nelif re.match( pat, \"sylveon\", re.M|re.I):\r\n print (\"sylveon\")\r\n ", "def ok(x,y):\r\n if(len(x)!=len(y)):\r\n return False\r\n for i in range(len(x)):\r\n if(y[i]!='.' and x[i]!=y[i]):\r\n return False\r\n return True\r\n\r\nn=int(input())\r\n\r\ns=input()\r\n\r\nL=['Vaporeon', 'Jolteon', 'Flareon', 'Espeon', 'Umbreon', 'Leafeon','Glaceon','Sylveon']\r\n\r\n\r\nfor i in range(len(L)):\r\n L[i]=L[i].lower()\r\n\r\nfor item in L:\r\n if(ok(item,s)):\r\n print(item)\r\n break\r\n", "n = int(input())\r\ns = input()\r\nmasks = ['vaporeon', 'jolteon', 'flareon', 'espeon', 'umbreon', 'leafeon', 'glaceon', 'sylveon']\r\nfor mask in masks:\r\n if len(mask) == n:\r\n for i in range(n):\r\n if s[i] != '.' and s[i] != mask[i]:\r\n break\r\n else:\r\n print(mask)\r\n break", "iwannabethebest = [\"jolteon\", \"flareon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\nn, s = int(input()), str(input())\r\nif n != 7:\r\n print(\"vaporeon\" if n == 8 else \"espeon\")\r\nelse:\r\n for pikachu in iwannabethebest:\r\n testforthebest = True\r\n for i in range(n):\r\n if s[i] != '.' and s[i] != pikachu[i]:\r\n testforthebest = False\r\n if testforthebest:\r\n print(pikachu)\r\n break", "n = int(input())\ns = input().rstrip()\n\np = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\n\nfor i in range(len(p)):\n if len(s) != len(p[i]):\n continue\n k = 0\n for j in range(n):\n if s[j] != '.' and s[j] != p[i][j]:\n k += 1\n if k == 0:\n print(p[i])\n exit(0)", "# Eevee Challenge\n# http://codeforces.com/problemset/problem/452/A\n\n# Attempted: 2014-08-04\n\nerror_intro = \"\\nRuntime ERROR: \"\n\n# n = int(input(\"integer between 6 and 8 which is the length of the string: \"))\n# string = input(\"string of the above length, which has dots for unknown characters: \")\nn = int(input())\nstring = input()\n\n# print(\"n = \" + str(n))\n# print(\"string = \" + string)\n\nnames = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\n\nif 6 <= n <= 8:\n if n == len(string):\n for name in names:\n if len(name) == n:\n match = 0\n for l in range(0,n):\n if (name[l] == string[l]) or (string[l] == \".\"):\n match = match + 1\n if match == n:\n #print(\"\\nMatch Found!:\")\n print(name)\n else:\n print(error_intro + \"len(string) != n\")\nelif 6 > n:\n print(error_intro + \"value of 'n' is too low\")\nelse:\n print(error_intro + \"value of 'n' is too high\")\n", "n=int(input())\r\nname=input()\r\nif n==6:\r\n print(\"espeon\")\r\nelif n==8:\r\n print(\"vaporeon\")\r\nelse:\r\n names=[\"jolteon\",\"flareon\",\"umbreon\",\"leafeon\",\"glaceon\",\"sylveon\"]\r\n flag=[1]*6\r\n for i in range(6):\r\n for j in range(7):\r\n if names[i][j]!=name[j] and name[j]!=\".\":\r\n flag[i]=0\r\n for i in range(6):\r\n if flag[i]==1:\r\n print(names[i])\r\n break", "def main():\n n = int(input())\n s = input()\n for p in ('vaporeon', 'jolteon', 'flareon', 'espeon',\n 'umbreon', 'leafeon', 'glaceon', 'sylveon'):\n if len(p) == n and all(a == b or a == '.' for a, b in zip(s, p)):\n print(p)\n return\n\n\nif __name__ == '__main__':\n main()\n", "leng = int(input())\nname = str(input())\n\nresposta = \"\"\nVaporeon = \"vaporeon\"\nJolteon = \"jolteon\"\nFlareon = \"flareon\"\nEspeon = \"espeon\"\nUmbreon = \"umbreon\"\nLeafeon = \"leafeon\"\nGlaceon = \"glaceon\"\nSylveon = \"sylveon\"\n\nif leng == 6:\n print(Espeon)\nelif leng == 8:\n print(Vaporeon)\nelse:\n for i in range (len(name)-3):\n resposta = Jolteon\n if name[i] != \".\" and name[i] != Jolteon[i]:\n resposta = \"\"\n break\n \n if not(resposta):\n for i in range (len(name)-3):\n resposta = Flareon\n if name[i] != \".\" and name[i] != Flareon[i]:\n resposta = \"\"\n break\n \n if not(resposta):\n for i in range (len(name)-3):\n resposta = Umbreon\n if name[i] != \".\" and name[i] != Umbreon[i]:\n resposta = \"\"\n break\n\n if not(resposta):\n for i in range (len(name)-3):\n resposta = Leafeon\n if name[i] != \".\" and name[i] != Leafeon[i]:\n resposta = \"\"\n break\n \n if not(resposta):\n for i in range (len(name)-3):\n resposta = Glaceon\n if name[i] != \".\" and name[i] != Glaceon[i]:\n resposta = Sylveon\n break\n\n print(resposta)\n\n\t \t\t \t \t \t \t \t\t\t\t \t \t\t \t", "a6=[\"espeon\"]\r\na7=[\"jolteon\", \"flareon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\na8=[\"vaporeon\"]\r\nn=int(input())\r\ns=input()\r\ng=0\r\nif n==6: print(*a6)\r\nelif n==8: print(*a8)\r\nelse:\r\n for u in range(6):\r\n o=list(s)\r\n for i in range(n):\r\n if o[i]=='.': o[i]=list(a7[u])[i]\r\n if o==list(a7[u]): \r\n g=9\r\n print(a7[u])\r\n break\r\n if g==9: break\r\n", "import re\r\ninput()\r\nprint(next(filter(re.compile(input()[:-3] + '$').match, ['vapor', 'jolt', 'flar', 'esp', 'umbr', 'leaf', 'glac', 'sylv'])) + 'eon')\r\n", "pokemons = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\",\r\n\t\t\t\"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\nn = input()\r\ntransform = input()\r\nfor pokemon in pokemons:\r\n\tif len(pokemon) == len(transform) and all(pokemon[j] == transform[j] for j in range(len(transform)) if transform[j] != '.'):\r\n\t\tprint(pokemon)\r\n\t\texit()", "n = int(input())\r\ns = input().rstrip()\r\na = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\nfor i in range(len(a)):\r\n if len(a[i]) == n:\r\n k = 0\r\n for j in range(n):\r\n if s[j] != '.' and s[j] != a[i][j]:\r\n k += 1\r\n if k == 0:\r\n print(a[i])\r\n break\r\n\r\n\r\n\r\n\r\n\r\n", "import re\r\nE='eon'\r\nl=['vapor','jolt','flar','esp','umbr','leaf','glac','sylv']\r\ninput()\r\np=input()\r\nprint(next(s+E for s in l if re.fullmatch(p, s+E)))", "import sys\r\n\r\n\r\nSEVEN_WORDS = [\"jolteon\", \"flareon\", \"umbreon\", \"glaceon\", \"sylveon\", \"leafeon\"]\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 f.readline()\r\n return [f.readline().strip()]\r\n\r\n\r\ndef sol(line):\r\n if len(line) == 6:\r\n return ['espeon']\r\n if len(line) == 8:\r\n return ['vaporeon']\r\n\r\n for word in SEVEN_WORDS:\r\n is_match = True\r\n for c, w in zip(line, word):\r\n if c != '.' and c != w:\r\n is_match = False\r\n break\r\n if is_match:\r\n return [word]\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", "pokemon = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\nn = int(input())\r\nno_name = input()\r\nif n == 6: # или же len(no_name)\r\n print(\"espeon\")\r\nelif n == 8: # или же len(no_name)\r\n print(\"vaporeon\")\r\nelse:\r\n for i in pokemon:\r\n for el in range(n):\r\n if no_name[el] != i[el] and no_name[el] != \".\":\r\n break\r\n elif (no_name[el] == \".\" or no_name[el] == i[el]) and el < 4:\r\n continue\r\n elif el >= 4:\r\n print(i)\r\n exit()", "ls = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\nn = int(input())\ns = input()\nans = ''\nfor i in range(len(ls)):\n if len(ls[i]) == n:\n c = 0\n for j in range(len(s)):\n if s[j] == '.' :\n c += 1\n else :\n if s[j] == ls[i][j]:\n c += 1\n else:\n continue\n if c == len(s):\n print(ls[i])\n quit()\n else:\n continue\n else:\n continue\n\n\n", "names = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\n\nn = int(input())\nxx = input()\n\nfor name in names:\n if n != len(name):\n continue\n good = True\n for i in range(len(name)):\n if not xx[i] in ['.', name[i]]:\n good = False\n if good:\n print(name)\n \t\t\t\t\t\t\t\t \t\t \t \t\t\t \t \t\t", "def is_match(s, name):\r\n for i in range(len(s)):\r\n if not (s[i] == '.' or s[i] == name[i]):\r\n return False\r\n return True\r\n\r\n\r\nn = int(input())\r\ns = input()\r\nnames = [ \"jolteon\", \"flareon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\nif n == 8:\r\n print(\"vaporeon\")\r\nelif n == 6:\r\n print('espeon')\r\nelse:\r\n for name in names:\r\n if is_match(s, name):\r\n print(name)", "n = int(input().strip())\r\np = input().strip()\r\nif n==8:\r\n print(\"vaporeon\")\r\nelif n==6:\r\n print(\"espeon\")\r\nelse:\r\n pokes = set([\"jolteon\", \"flareon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"])\r\n for i in range(n):\r\n rem = set()\r\n if p[i]!='.':\r\n for l in pokes:\r\n if l[i]!=p[i]:\r\n rem.add(l)\r\n pokes = pokes - rem\r\n if len(pokes)==1:\r\n for x in pokes:\r\n print(x)\r\n break", "n=int(input())\r\n\r\ns=input()\r\nl1=[\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\n\r\n\r\n\r\nfor i in l1:\r\n flag=0\r\n flag1=0\r\n if(len(i)==n):\r\n flag1=1\r\n \r\n for j in range(n):\r\n if(s[j]!='.'):\r\n if(s[j]!=i[j]):\r\n flag=1\r\n \r\n \r\n if(flag==0 and flag1):\r\n print(i)\r\n break", "n = input()\r\nif n == '8':\r\n print('vaporeon')\r\n exit()\r\nif n == '6':\r\n print('espeon')\r\n quit()\r\n\r\nk=[\"jolteon\", \"flareon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\ns=input()\r\n\r\nfor p in k:\r\n for i in range(7):\r\n if s[i] != '.' and s[i] != p[i]:\r\n break\r\n if i == 5:\r\n print(p)\r\n quit()()", "P = ['vaporeon', 'jolteon', 'flareon', 'espeon', 'umbreon', 'leafeon', 'glaceon', 'sylveon']\r\nCheck = [True] * 8\r\nN, X = int(input()), input()\r\nfor i in range(N):\r\n if X[i] != '.':\r\n for j in range(len(P)):\r\n if len(P[j]) != N or X[i] != P[j][i]:\r\n Check[j] = False\r\nfor i in range(8):\r\n if len(P[i]) == N and Check[i]:\r\n print(P[i])\r\n exit()\r\n# Hope the best for Ravens\r\n# Never give up\r\n", "names = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]\r\ntemp = names[:]\r\nn = int(input())\r\nfor x in range(8):\r\n if len(temp[x]) != n:\r\n names.remove(temp[x])\r\ns = input()\r\nfor x in names:\r\n for y in range(n):\r\n if s[y] != \".\" and x[y] != s[y]:\r\n break\r\n else:\r\n print(x)\r\n break\r\n", "def main():\r\n n = int(input())\r\n s = input()\r\n st = ['vaporeon', 'jolteon', 'flareon', 'espeon', 'umbreon',\r\n 'leafeon', 'glaceon', 'sylveon']\r\n for pock in st:\r\n if len(pock) == len(s):\r\n bad = False\r\n for j in range(len(s)):\r\n if s[j] != '.' and s[j] != pock[j]:\r\n bad = True\r\n break\r\n if not bad:\r\n print(pock)\r\n return\r\nmain()\r\n" ]

[ "from sys import stdin, stdout\r\n\r\n\r\ndef solve():\r\n l3, l4, l5 = (int(s) for s in stdin.readline().split())\r\n v1 = l3*l3*l3*(2**0.5)*2\r\n v2 = l4*l4*l4*(2**0.5)*4\r\n v3 = l5*l5*l5*(2**0.5)*((15+5*(5**0.5))**0.5)\r\n ans = (v1+v2+v3)/24\r\n print(ans)\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n" ]

[ "n = int(input())\r\nlis = input().split()\r\n#print(lis)\r\nans=1\r\nzer=0\r\nfor i in lis:\r\n l=len(i)\r\n k=i.count('1')\r\n j=i.count('0')\r\n if k+j==l:\r\n if k>1:\r\n ans*=int(i)\r\n else:\r\n if j==l:\r\n print('0')\r\n exit()\r\n else:\r\n zer+=l-i.find('1')-1\r\n# print(i.find('1'),zer)\r\n else:\r\n ans*=i\r\np=''\r\nfor i in range(zer):\r\n p+='0'\r\nprint(str(ans)+p) \r\n\r\n\r\n", "# LUOGU_RID: 123536784\nn=int(input())\r\nans=1\r\nx=list(input().split());\r\nwhile n>0:\r\n n-=1\r\n ans*=int(x[n])\r\nprint(ans)", "\r\nn = input()\r\ns = input()\r\nlst = list(s.split(\" \"))\r\nl = len(lst)\r\nout = 1\r\n\r\nfor i in range(0,l):\r\n out *= int(lst[i])\r\n\r\nprint(out)", "\r\nimport math\r\nimport sys\r\nimport operator\r\nfrom collections import defaultdict\r\n\r\ndef main() -> None:\r\n read = sys.stdin.readline\r\n n = int(read())\r\n values = [int(i) for i in read().split()]\r\n min_val = min(values)\r\n if min_val == 0:\r\n print(0)\r\n else:\r\n total = 1\r\n for val in values:\r\n total *= val\r\n print(total)\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "import sys\r\nn=int(input())\r\narr = list(input().split())\r\nv=\"\"\r\nk=0\r\nfor i in range(n):\r\n p=len(arr[i])\r\n if(arr[i]==\"0\"):\r\n print(0)\r\n sys.exit()\r\n c=0\r\n po=0\r\n found=False\r\n for j in range(0,p):\r\n if(arr[i][j]==\"1\"):\r\n c+=1\r\n elif(arr[i][j]==\"0\"):\r\n po+=1\r\n else:\r\n found=True\r\n break\r\n if(c>1):\r\n found=True\r\n break\r\n if(found):\r\n v=arr[i]\r\n else:\r\n k+=po\r\nif(v==\"\"):\r\n v=\"1\"\r\ng=\"0\"*k\r\ns=f\"{v}{g}\"\r\nprint(s)", "# Dictionary == Hash Collision\r\n\r\nfrom sys import stdin\r\nfrom bisect import bisect_left as bl, bisect_right as br\r\nfrom collections import defaultdict, Counter, deque\r\n\r\n\r\ndef input():\r\n return stdin.readline().strip()\r\n\r\n\r\ndef read(default=int):\r\n return list(map(default, input().split()))\r\n\r\n\r\ndef solve():\r\n n = read()[0]\r\n ans = 1\r\n for i in read():\r\n ans *= i\r\n return ans\r\n\r\n\r\n# t = int(input())\r\nt = 1\r\nfor test in range(t):\r\n print(solve())\r\n", "input()\r\nprd=1\r\nfor i in map(int, input().split()):\r\n prd*=i\r\nprint(prd)", "\"Codeforces Round #339 (Div. 2)\"\n\"B. Gena's Code\"\ny=int(input())\n# a=list(map(int,input().split()))\na=list(input().split())\nnz=0\nnb=''\nz=0\n# print(len(str(z)))\nfor i in a:\n if i=='0':\n z=1\n break\n else:\n s='1'\n l=(len(i)-1)\n qz='0'*l\n s+=qz\n if s==i:\n nz+=l\n else:\n nb=i\nif nb=='':\n nb='1' \nans=nb+('0'*nz)\nif z==1:\n ans='0'\nprint(ans) ", "# ===================================\r\n# (c) MidAndFeed aka ASilentVoice\r\n# ===================================\r\n# import math, fractions, collections\r\n# ===================================\r\nn = int(input())\r\nans = \"1\"\r\nzc = 0\r\nnbn = 0\r\nfor x in list(map(str, input().split())):\r\n\tif x == \"0\":\r\n\t\tans = \"0\"\r\n\t\tzc = 0\r\n\t\tbreak\r\n\telse:\r\n\t\tif nbn:\r\n\t\t\tzc += x.count(\"0\")\r\n\t\telse:\r\n\t\t\tif x.count(\"1\") == 1 and all(c in \"01\" for c in x):\r\n\t\t\t\tzc += x.count(\"0\")\r\n\t\t\telse:\r\n\t\t\t\tnbn = 1\r\n\t\t\t\tans = x\r\nprint(ans + \"0\"*zc)\r\n\r\n\t", "n = int(input())\r\nnumbers = list(map(str, input().split()))\r\n\r\n# Initialize the product to 1\r\ncount = 0\r\nn = '1'\r\n# Count the number of '1's in each beautiful number\r\nfor num in numbers:\r\n if num == '0':\r\n break\r\n # Convert the number to a string and count '1's\r\n \r\n if \"1\"+\"0\"*(len(num)-1) == num:\r\n count += len(num)-1\r\n else:\r\n n = num\r\nif num == '0':\r\n print(\"0\")\r\nelse:\r\n res= str(n)\r\n count = int(count)\r\n print(res + '0'*count)\r\n", "n = int(input())\r\nl = input().split(\" \")\r\nans = 1\r\nfor i in l:\r\n ans = ans * int(i)\r\n\r\nprint(ans)", "from sys import stdin,stdout,setrecursionlimit\r\nsetrecursionlimit(10**5)\r\nfrom collections import defaultdict\r\nnmbr = lambda: int(stdin.readline())\r\nlst = lambda: list(map(int,stdin.readline().split()))\r\nfor _ in range(1):#nmbr()):\r\n n=nmbr()\r\n cnt=0;ans=10\r\n special=-1\r\n for wrd in input().split():\r\n if wrd=='0':\r\n ans=0\r\n break\r\n xx=len(wrd)\r\n if wrd[0]=='1' and wrd.count('0')==xx-1:\r\n cnt+=xx-1\r\n else:special=wrd\r\n if ans==0:\r\n print(0)\r\n elif special==-1:\r\n stdout.write('1')\r\n for i in range(cnt):stdout.write('0')\r\n else:\r\n stdout.write(special)\r\n for i in range(cnt): stdout.write('0')", "from math import prod\r\n\r\ninput()\r\nprint(prod(map(int, input().split())))\r\n", "def isbe(s):\n\tx = [0]*10\n\tfor i in range(len(s)):\n\t\tx[int(s[i])] += 1\n\tif(x[0]+x[1]==len(s) and x[1] <= 1):\n\t\treturn True\n\treturn False\n\nn = int(input())\nx = input().split()\nnum = \"1\"\nzeroes = 0\nzp = 0\nfor i in x:\n\tif(isbe(i)):\n\t\tzeroes += (len(i)-1)\n\telse:\n\t\tnum = i\n\tif(int(i)==0):\n\t\tzp = 1\nif(zp==1):\n\tprint(0)\nelse:\n\tprint(num, end = \"\")\n\tfor i in range(zeroes):\n\t\tprint(\"0\", end = \"\")\n\tprint()\n\n", "from collections import defaultdict, deque, Counter, OrderedDict\r\n\r\ndef main():\r\n n = int(input())\r\n zer,div,ans,iszero = 0, False,\"1\",False\r\n k = input().split()\r\n for i in range(n):\r\n s = k[i]\r\n iszero |= (s == '0')\r\n if div:\r\n zer += len(s) - 1\r\n continue\r\n check = s[0] == '1' and all(c == '0' for c in s[1:])\r\n if check:\r\n zer += len(s) - 1\r\n else:\r\n div = True\r\n ans = s\r\n\r\n if iszero:\r\n print(0)\r\n else:\r\n print(ans,end=\"\")\r\n print(\"\".join(['0' for i in range(zer)]))\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n \"\"\"sys.setrecursionlimit(400000)\r\n threading.stack_size(40960000)\r\n thread = threading.Thread(target=main)\r\n thread.start()\"\"\"\r\n main()", "n = int(input())\nans = 1\nl = [*map(int, input().split())]\nfor i in l: \n ans = ans * int(i)\n\nprint(ans)", "n=int(input())\r\nsum=1\r\nlst=list(map(int,input().split()))\r\nfor i in range(len(lst)):\r\n sum*=lst[i]\r\n if lst[i]==0:\r\n sum=0\r\n break\r\nprint(sum)", "n = int(input())\r\narr = list(map(int, input().split(' ')))\r\ntotal = 1\r\nfor x in arr:\r\n total *= x\r\nprint(total)", "\r\n\r\n\r\nn = int(input())\r\narr = input().split()\r\n\r\nzeros = 0\r\na = 0\r\n\r\nfor i in arr:\r\n x = i.count('0')\r\n y = i.count('1')\r\n if (i == '1'):\r\n continue\r\n\r\n elif (i == '0'):\r\n print(0)\r\n exit(0)\r\n\r\n elif (y == 1 and x == len(i) - 1 ):\r\n zeros += x\r\n\r\n else:\r\n a = i\r\n\r\n#print(a)\r\n\r\nif (a):\r\n ans = a + ('0' * zeros)\r\n print(ans)\r\n\r\nelse:\r\n ans = '1' + ('0' * zeros)\r\n print(ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input());\r\ntanks = input().split();\r\nz, not_b, zp = 0, '1', False;\r\nfor t in tanks:\r\n if(t == '0'):\r\n z, zp = 0, True;\r\n break;\r\n else:\r\n x, y = t.count('1'), t.count('0');\r\n if(x >= 2 or x == 0 or (x+y < len(t))):\r\n not_b = t;\r\n else:\r\n z += y;\r\nproduct = '0' if zp else not_b;\r\nfor i in range(0, z):\r\n product += '0';\r\nprint(product);", "input()\r\na=0\r\nc='1'\r\nb=input().split()\r\nfor i in b:\r\n d=i.count('1')\r\n if len(i)!=i.count('0')+d or d>1:\r\n c=i\r\n else:\r\n a+=len(i)-1\r\nif not '0' in b:\r\n print(c+'0'*a)\r\nelse:\r\n print(0)", "# LUOGU_RID: 123523094\nn=int(input())\r\npro=1\r\nx=list(input().split());\r\nwhile n>0:\r\n n-=1\r\n pro*=int(x[n])\r\nprint(pro)", "import sys\r\n\r\nfrom operator import mul\r\nfrom functools import reduce\r\n\r\n# sys.stdin = open(\"ivo.in\")\r\n\r\nn = int(sys.stdin.readline())\r\n\r\na = []\r\nnum = 0\r\nval = \"1\"\r\nfor s in sys.stdin.readline().split():\r\n good = True\r\n if s == \"0\":\r\n print(0)\r\n exit(0)\r\n\r\n if s[0] != '1':\r\n good = False\r\n else:\r\n for i in range(1, len(s)):\r\n if s[i] != '0':\r\n good = False\r\n break\r\n if good:\r\n num += len(s) - 1\r\n else:\r\n val = s\r\n\r\nval += \"0\" * num\r\n\r\nprint(val)\r\n\r\n", "n=int(input())\r\na=list(map(str,input().split()))\r\nz=0\r\nr='1'\r\nfor s in a:\r\n o=0\r\n c=0\r\n f=0\r\n if s=='0':\r\n print(0)\r\n exit()\r\n else:\r\n for i in range(len(s)):\r\n if s[i]=='1':\r\n o+=1\r\n if s[i]=='0':\r\n c+=1\r\n if o>=2:\r\n f=1\r\n r=s\r\n break\r\n if s[i]!='1' and s[i]!='0':\r\n f=1\r\n r=s\r\n break\r\n if f==0:\r\n z+=c\r\nprint(r,end='')\r\nfor i in range(z):\r\n print(0,end='')", "n=int(input())\nsum=1\nlst=list(map(int,input().split()))\nfor i in range(len(lst)):\n sum*=lst[i]\n if lst[i]==0:\n sum=0\n break\nprint(sum)\n \t\t\t \t\t \t \t \t \t\t\t \t \t \t", "n = int(input())\r\nans = 1 \r\nlst = list(map(int, input().split()))\r\nfor it in lst:\r\n ans = ans * it\r\nprint(ans)\r\n", "n=int(input()); r = 1\r\narr = list(map(int,input().split()))\r\nfor x in arr : r*=x\r\nprint(r)", "n = int(input())\r\ns = list(map(str, input().split()))\r\ncnt = 0\r\nfront = '1'\r\nfor c in s:\r\n f = 0\r\n if c[0] == '0':\r\n print(0)\r\n exit(0)\r\n else:\r\n if c[0] == '1':\r\n for i in c[1:]:\r\n if i != '0':\r\n f = 1\r\n else:\r\n f = 1\r\n if f:\r\n front = c\r\n else:\r\n cnt += len(c) - 1\r\n\r\nprint(f\"{front}{'0' * cnt}\")\r\n\r\n", "def main():\r\n n = int(input())\r\n A = list(map(int, input().split()))\r\n res = 1\r\n for i in range(n):\r\n res *= A[i]\r\n print(res)\r\n \r\n \r\nif __name__ == \"__main__\":\r\n main()\r\n ", "input()\r\na = 0; c = '1'\r\nb = input().split()\r\nfor i in b:\r\n d = i.count('1')\r\n if len(i) != i.count('0') + d or d > 1:\r\n c = i\r\n else :\r\n a += len(i) - 1\r\nif not '0' in b:\r\n print(c + '0' * a)\r\nelse:\r\n print(0)\r\n", "n = int(input())\r\np, s, t = 1, 0, \"1\"\r\nfor x in input().split():\r\n\tif x == \"0\":\r\n\t\tprint(0)\r\n\t\tquit()\r\n\telif x == \"1\" + \"0\" * (len(x) - 1):\r\n\t\ts += len(x) - 1\r\n\telse:\r\n\t\tt = str(x)\r\nprint(t + \"0\" * s)", "n = int(input())\r\nnums = list(map(int, input().split()))\r\nans = 1;\r\nfor i in range(n):\r\n ans *= nums[i]\r\nprint(ans)\r\n", "def arr_inp():\r\n return [str(x) for x in input().split()]\r\n\r\n\r\ndef beautiful(x):\r\n if x == '0':\r\n return '0'\r\n if x[0] != '1':\r\n return True\r\n for j in x[1:]:\r\n if j != '0':\r\n return True\r\n return False\r\n\r\n\r\nfrom collections import *\r\n\r\nn, a, ans = int(input()), arr_inp(), deque([])\r\nfor i in a:\r\n if beautiful(i) == '0':\r\n exit(print(0))\r\n elif beautiful(i):\r\n ans.appendleft(i)\r\n else:\r\n ans.append(i)\r\n\r\nout = ans[0]\r\n\r\nfor j in list(ans)[1:]:\r\n out += j[1:]\r\nprint(out)\r\n", "n = int (input ())\r\nans = '1'\r\nvalues = (input ().split ())\r\ncnt = 0\r\nfor i in values :\r\n if i.count ('1') > 1 or i.count('0') + i.count('1') < len (i) :\r\n ans = i\r\n else :\r\n cnt += (len (i) - 1)\r\nif '0' in values :\r\n print (0)\r\nelse :\r\n print (ans + '0' * cnt)", "import math\r\n\r\ninput()\r\nprint(math.prod(map(int, input().split())))\r\n", "import sys\npog=int(input())\ns=input().split(\" \")\nn0=0\nq=1\nfor x in s:\n if x.count('0')+1!=len(x) or x.count('1')!=1:\n q=x\n else:\n n0+=x.count('0')\n if x=='0':\n print('0')\n sys.exit(0)\nprint(str(q)+'0'*n0)\n", "input()\r\n\r\ninp_str=input()\r\n\r\narr=inp_str.split(' ')\r\n\r\ntotal_zero=0\r\nfound=False\r\nprod_zero=False\r\n\r\nfor num in arr:\r\n if num==\"0\":\r\n prod_zero=True\r\n break\r\n \r\n beaut=False\r\n one_cnt=0\r\n zero_cnt=0\r\n \r\n for ch in num:\r\n if(ch=='1'):\r\n one_cnt+=1\r\n elif(ch=='0'):\r\n zero_cnt+=1\r\n \r\n if one_cnt==1 and zero_cnt==len(num)-1:\r\n beaut=True\r\n total_zero+=zero_cnt\r\n \r\n if beaut==False:\r\n ans=num\r\n found=True\r\n\r\nif prod_zero:\r\n print(0)\r\nelif found:\r\n print(ans,end=\"\")\r\n for i in range(total_zero):\r\n print(0,end=\"\")\r\nelse:\r\n print(1,end=\"\")\r\n for i in range(total_zero):\r\n print(0,end=\"\")", "useless = input()\r\nnumbers = input().split(' ')\r\ndef result(numbers):\r\n result = 1\r\n for i in numbers:\r\n result = int(i) * int(result)\r\n return result\r\nprint(result(numbers))\r\n", "n=int(input())\r\na=[int(i)for i in input().split()]\r\nans=1\r\nfor i in range(n):\r\n ans*=a[i]\r\nprint(ans)\r\n ", "# LUOGU_RID: 113310514\nn=int(input())\r\na=input().split()\r\nans=1\r\nfor i in range(n):\r\n\tans*=int(a[i])\r\nprint(ans)\r\n", "import math\r\n\r\ninput()\r\na = map(int, input().split())\r\n\r\nprint(math.prod(a))\r\n", "ans=1\nn=int(input())\narr=input().split(' ')\nfor i in arr:\n ans*=int(i)\nprint(ans)\n\t\t\t \t\t\t\t \t \t\t\t\t \t\t \t \t", "x = int(input()) * 0 + 1\r\nfor i in list(map(int, input().split())):\r\n x *= i\r\nprint(x)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat May 12 14:16:58 2018\r\n\r\n@author: Arsanuos\r\n\"\"\"\r\n\r\ndef Beau(n):\r\n one = False\r\n for c in n:\r\n if c == '1':\r\n if one:\r\n return False\r\n one = True\r\n elif c != '0':\r\n return False\r\n return True\r\n\r\ndef main():\r\n n = int(input())\r\n store = 1\r\n flag = True\r\n cnt = 0\r\n for elem in input().split():\r\n if flag and not Beau(elem):\r\n store = elem\r\n flag = True\r\n else:\r\n if(len(elem) > 1):\r\n cnt += len(elem) - 1\r\n elif elem[0] == '0':\r\n print(0)\r\n return\r\n print(store, end = \"\")\r\n for i in range(cnt):\r\n print(0, end=\"\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\r\nL = input().split()\r\nc = \"1\"\r\nnbofzero = 0\r\nfor i in L:\r\n if len(i) != i.count('0') + i.count('1') or i.count('1') != 1:\r\n c = i\r\n else:\r\n nbofzero += len(i) - 1\r\nif not '0' in L:\r\n print(c + '0'*nbofzero)\r\nelse:\r\n print(0)", "n = int(input())\r\nans = 1\r\nx = input().split()\r\n\r\nfor i in range (n):\r\n ans *= int(x[i])\r\n \r\nprint(ans)", "int(input())\nx=''\nzero=0\nfor s in input().split():\n\tif s== '0':print(0),exit()\n\telif s=='1'+'0'*(len(s)-1):zero+=len(s)-1\n\telse: x=s\nprint(x+'0'*zero if len(x)>0 else '1'+'0'*zero)\t\n", "n = int(input())\r\nalist =input().split()\r\na=0\r\nc='1'\r\nfor i in alist:\r\n cnt=i.count('1')\r\n if len(i)!=i.count('0')+cnt or cnt>1:\r\n c=i\r\n else:\r\n a+=len(i)-1\r\nif not '0' in alist:\r\n print(c+'0'*a)\r\nelse:\r\n print(0)\r\n ", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\na = list(input().rstrip().decode().split())\r\nc = 0\r\nu = \"1\"\r\nfor b in a:\r\n if b[0] == \"0\" and len(b) == 1:\r\n c = -1\r\n break\r\n if b[0] == \"1\" and b.count(\"0\") == len(b) - 1:\r\n c += len(b) - 1\r\n else:\r\n u = b\r\nans = \"0\" if c == -1 else u + \"0\" * c\r\nprint(ans)", "n = int(input())\r\np,s,t = 1,0,\"1\"\r\nfor x in input().split():\r\n\tif x==\"0\":\r\n\t\tprint(0)\r\n\t\tquit()\r\n\telif x == \"1\" + \"0\" * (len(x) - 1):\r\n\t\ts+=len(x)-1\r\n\telse:\r\n\t\tt=str(x)\r\nprint(t+\"0\"*s)", "def gena(a):\n z = ['1']\n for ai in a:\n if ai == '0':\n return 0\n if ai[0] != '1' or any(ai[i] != '0' for i in range(1, len(ai))):\n z[0] = ai\n else:\n z.append(ai[1:])\n return ''.join(z)\n \n\n\n\nif __name__ == '__main__':\n n = int(input())\n a = input().split()\n assert len(a) == n\n print(gena(a))\n", "n = int(input())\r\narr = [int(i) for i in input().split()]\r\nans = 1\r\nfor i in range(n):\r\n ans = ans * arr[i]\r\nprint(ans)", "input();a=0;c='1';b=input().split()\r\nfor i in b:\r\n d=i.count('1')\r\n if len(i)!=i.count('0')+d or d>1:c=i\r\n else:a+=len(i)-1\r\nif not '0' in b:print(c+'0'*a)\r\nelse:print(0)\r\n", "n = int(input())\r\n \r\n# input the array\r\narr = [int(x) for x in input().split()]\r\n \r\n# initialize variable\r\nsummation = 1\r\n \r\n# calculate sum\r\nfor x in arr:\r\n summation *= x\r\n \r\n# print answer\r\nprint(summation)", "import operator\nfrom functools import reduce\nn = int(input())\nshu = 0\nans = 1\nfor x in input().split():\n if x[0] == '1' and reduce(operator.and_, map(lambda x: x == '0', x[1:]), True):\n shu += len(x) - 1\n elif x == '0':\n ans = 0\n shu = 0\n break\n else:\n ans = x\nprint(ans, end = '0' * shu)\n\n\t\t \t \t \t\t \t \t\t \t \t \t", "def solve():\n b = '1'\n count_zero = 0\n n = int(input())\n a = input().strip().split(' ')\n for i in range(n):\n count_zero_now = 0\n count_one = 0\n flag = False\n if a[i] == '0':\n print(0)\n return\n for e in a[i]:\n if e == '0':\n count_zero_now += 1\n elif e == '1':\n count_one += 1\n else:\n flag = True\n break \n if not flag and count_one == 1:\n count_zero += count_zero_now\n else:\n b = a[i]\n print(b + ''.join(['0'] * count_zero))\n return\n\n\nsolve()\n\t\t\t\t \t \t\t \t \t \t\t\t\t\t\t \t\t \t", "n = int(input())\r\np = 1\r\na = list(map(int , input().split()))\r\nfor i in range(n):\r\n p *= a[i]\r\nprint(p)", "# LUOGU_RID: 126625687\nn=int(input())\r\na=list(input().split())\r\nans=1\r\nfor i in a:\r\n ans*=int(i)\r\nprint(ans)\r\n", "from math import log10\nn=int(input())\nl=input().split()\n\nif '0' in l:\n print(0)\n exit()\n \nd=-1\nfor i in range(n):\n if l[i].count('1')+l[i].count('0')!=len(l[i]) or l[i].count('1')!=1:\n d=i\n print(l[i], end='')\n break\nif d==-1:\n print(1,end='')\nfor i in range(n):\n if i!=d:\n print(l[i][1:], end='')\n\nprint('')\n", "\r\nn = int(input())\r\nnum = input().split()\r\nfirst = 0\r\nfor i in range(n):\r\n if (num[i].count('1') + num[i].count('0') != len(num[i])) or (num[i].count('1') > 1):\r\n first = i\r\nans = num[first]\r\nfor i in range(n):\r\n if i != first:\r\n ans += num[i].count('0') * '0'\r\n \r\nif not num.count('0'):\r\n print(ans)\r\nelse:\r\n print('0')", "if __name__ == '__main__':\n\tn = int(input())\n\ta = input().split()\n\tz = False\n\tpr = '1'\n\tcount = 0\n\tfor k in a:\n\t\tif k == '0':\n\t\t\tz = True\n\t\t\tbreak\n\t\telif k == '1' + '0' * (len(k) - 1):\n\t\t\tcount += len(k) - 1\n\t\telse :\n\t\t\tpr = k\n\t\t\n\tif z:\n\t\tprint(0)\n\telse:\n\t\tprint(pr + '0' * count)", "from sys import stdin\r\nn = int(input())\r\nstring = map(str,stdin.readline().split())\r\nz = cnt = zero = good = 0\r\nres = \"\"\r\nfor ch in string:\r\n if(ch == '0'):\r\n z = 1\r\n res = '0'\r\n break\r\n else:\r\n l = len(ch)\r\n one = ch.count('1')\r\n zero = ch.count('0')\r\n if(one == 1 and one+zero == l):\r\n \"\"\"beautiful num\"\"\"\r\n cnt += zero\r\n else:\r\n \"\"\"non-beautiful num\"\"\"\r\n res = ch\r\n good = 1\r\nfor i in range(cnt):\r\n res += '0'\r\nif(z == 1):\r\n print('0')\r\nelse:\r\n if(good == 1):\r\n print(res)\r\n else:\r\n s2 = '1'\r\n s2 += res\r\n print(s2)\r\n\r\n\r\n\r\n", "n = int(input())\r\nls = list(input().split())\r\n\r\na = 0\r\nmn = '1'\r\n\r\nfor s in ls:\r\n\tif(s == '1' + '0'*(len(s) - 1)) : a += len(s) - 1\r\n\telif(s == '0'): print(0); exit(0)\r\n\telse: mn = s\r\n\r\nprint(mn,end=\"\")\r\nprint('0' * a)", "n=input()\r\na=input().split()\r\nr='1'\r\nfor i in a:\r\n if i!='0':\r\n L=len(i)\r\n s='0'*(L-1)\r\n if i[0]=='1' and i[1:L]==s:\r\n r=r+s\r\n else:\r\n r=i+r[1:]\r\n else:\r\n r='0'\r\n break \r\nprint(r)", "n = int(input())\r\nl = list(map(str, input().split()))[:n]\r\nif n == 1:\r\n print(l[0])\r\n exit(0)\r\nno = \"1\"\r\nt = 0\r\nfor i in l:\r\n if i == \"0\":\r\n print(\"0\")\r\n exit(0)\r\n elif i == \"1\":\r\n continue\r\n elif i.count('1') != 1 or i.count('0') != len(i) - 1:\r\n no = i\r\n else:\r\n t += (len(i) - 1)\r\noutput = no + ('0' * t)\r\nprint(output)", "import sys\r\ninput=sys.stdin.readline\r\nn = int(input())\r\na = input().split()\r\nzeros_count = 0\r\nto_multiple = ''\r\nfor i in a:\r\n if (i.count('1') != 1 or i.count('0') != len(i) - 1) and i != '0':\r\n to_multiple = i\r\n elif i == '0':\r\n print(0)\r\n exit(0)\r\n else:\r\n zeros_count += i.count('0')\r\n \r\nprint(to_multiple + '0' * (zeros_count) if to_multiple != '' else '1' + '0' * zeros_count)\r\n", "from functools import reduce\r\n\r\n\r\ndef 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('input.txt','r')\r\n# sys.stdout = open('output.txt','w')\r\n\r\nn = int(input())\r\nl = li()\r\n\r\nprint(reduce(lambda x,y: x*y,l))\r\n\r\n", "n = int(input())\r\narr = [i for i in input().split()]\r\nk, cnt = 1, 0\r\nfor i in arr:\r\n if i == '0':\r\n print(0)\r\n break\r\n elif (i.count('0') + i.count('1') == len(i) and i.count('1') == 1):\r\n cnt += i.count('0')\r\n else:\r\n k = i\r\nelse:\r\n print(str(k)+'0'*cnt)\r\n", "# LUOGU_RID: 112331020\na=int(input())\r\nb=input().split()\r\nc=1\r\nfor i in range(a):\r\n c*=int(b[i])\r\nprint(c)", "# https://codeforces.com/contest/614\r\n\r\nimport sys\r\n\r\ninput = lambda: sys.stdin.readline().rstrip() # faster!\r\n\r\nn = int(input())\r\na = list(input().split())\r\n\r\nf, z = \"1\", 0\r\nfor x in a:\r\n if x == \"0\":\r\n print(0)\r\n exit()\r\n else:\r\n i = len(x) - 1\r\n while i >= 0 and x[i] == \"0\":\r\n i -= 1\r\n z += 1\r\n if i > 0 or (i == 0 and x[0] != \"1\"):\r\n f = x[:i + 1]\r\nprint(str(f) + \"0\" * z)", "t = int(input())\r\nn = list(map(int,input().split()))\r\nres = 1\r\nfor i in range(t):\r\n if n[i]==0:\r\n res = 0\r\n break\r\n res*=n[i]\r\nprint(res)", "#!/bin/python3\r\n\r\nimport sys\r\nn = int(input())\r\ns =input().split()\r\nnum ='1'\r\nzeros = 0\r\nfor st in s:\r\n if st != '0':\r\n zc = st.count('0')\r\n if st.count('1') == 1 and zc== len(st) - 1:\r\n zeros += zc\r\n else:\r\n num = st\r\n else:\r\n num = '0'\r\n zeros = 0\r\n break\r\nprint(num + zeros *'0')", "n = int(input())\r\ntanks = list(map(int, input().split()))\r\nans = 1\r\nfor i in tanks:\r\n ans *= i\r\n\r\nprint(ans)", "# if __name__ == '__main__':\r\n# n = int(input())\r\n# L = list(map(int,input().split()))\r\n# M = 1\r\n# for itm in L:\r\n# M *= itm\r\n# print(M)\r\n\r\n# import operator\r\n# import functools\r\n# n = int(input())\r\n# L = list(map(int,input().split()))\r\n# print(functools.reduce(operator.mul, L, 1))\r\n\r\nn = input()\r\nA = input().split()\r\nzero = 0\r\nst = '1'\r\nfor s in A:\r\n if s == '0':\r\n print(0)\r\n exit(0)\r\n if s.count('1') != 1 or s.count('0') != len(s) - 1:\r\n st = s\r\n # print(st)\r\n else:\r\n zero += len(s) - 1\r\n\r\nprint(st + '0'*zero)\r\n", "n = int(input())\r\ntanks = list(input().split())\r\nz = '1'\r\nzeroes = 0\r\n\r\nfor each in tanks:\r\n ones = each.count('1')\r\n if len(each) != ones + each.count('0') or ones > 1:\r\n z = each\r\n else:\r\n zeroes += len(each) - 1\r\n\r\nif '0' not in tanks:\r\n print(z + '0' * zeroes)\r\nelse:\r\n print(0)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\n\r\nw = list(map(int, input().split()))\r\nd = []\r\n\r\nfor i in w:\r\n if i == 0:\r\n print(0)\r\n exit(0)\r\n elif i != 1:\r\n d.append(i)\r\n\r\nc = 1\r\nfor i in d:\r\n c *= i\r\nprint(c)", "from math import *\r\nfrom sys import *\r\nfrom decimal import *\r\n\r\nn=int(stdin.readline())\r\nk=[z for z in stdin.readline().split()]\r\nzer=0\r\nbad=-1\r\nfor i in range(n):\r\n if k[i] == \"0\":\r\n print(0)\r\n exit(0)\r\n cnt=0\r\n for j in k[i]:\r\n if j != \"0\":\r\n cnt += 1\r\n if j != \"1\":\r\n cnt += 2\r\n break \r\n if cnt<2:\r\n zer += len(k[i])-1\r\n else:\r\n bad = i\r\n#print(bad,k[bad])\r\nif bad != -1:\r\n stdout.write(k[bad]+\"0\"*zer+\"\\n\")\r\nelse:\r\n stdout.write(\"1\"+\"0\"*zer+\"\\n\")", "input();a=0;c='1';b=input().split()\nfor i in b:\n d=i.count('1')\n if len(i)!=i.count('0')+d or d>1:c=i\n else:a+=len(i)-1\nif not '0' in b:print(c+'0'*a)\nelse:print(0)\n \t \t\t \t\t \t \t \t\t\t\t \t\t \t \t\t\t", "def product(seq):\r\n ans = '1'\r\n num_zeros = 0\r\n for e in seq:\r\n zeros, ones = e.count('0'), e.count('1')\r\n if e == '0':\r\n return '0'\r\n elif ones != 1 or zeros != len(e) - 1:\r\n ans = e\r\n else:\r\n num_zeros += zeros\r\n \r\n ans += '0' * num_zeros\r\n return ans\r\n\r\n\r\ndef main():\r\n input()\r\n seq = input().split()\r\n ans = product(seq)\r\n print(ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n= (int)(input())\r\nlista = [int(x) for x in input().split()]\r\nmult = 1\r\nfor i in range(len(lista)):\r\n mult = mult*lista[i]\r\n\r\nprint(mult)\r\n ", "n=int(input());r=1\r\narr=list(map(int,input().split()))\r\nfor x in arr : r*=x\r\nprint(r)" ]

[ "n = int(input())\r\nnums = list(map(int, input().split()))\r\n# 存储以每个数字结尾的最长连续序列长度\r\nseq_len = {}\r\n# 构建连续序列长度的字典\r\nfor num in nums:\r\n seq_len[num] = seq_len.get(num - 1, 0) + 1\r\n# 寻找最长序列的结束数字和长度\r\nend, max_len = max(seq_len, key=seq_len.get), max(seq_len.values())\r\n# 回溯找到序列索引\r\nindices = []\r\nwhile n:\r\n if nums[n - 1] == end:\r\n indices.append(n)\r\n end -= 1\r\n n -= 1\r\n# 反转索引列表并输出\r\nprint(max_len)\r\nprint(*indices[::-1])\r\n", "n = int(input())\r\n\r\nnums = [int(x) for x in input().split()]\r\n\r\nn = len(nums)\r\ndp = [0]*n\r\nseen = {}\r\n\r\nfor i in range(n):\r\n num = nums[i]\r\n if num-1 in seen:\r\n idx = seen[num-1]\r\n dp[i] = 1 + dp[idx]\r\n else:\r\n dp[i] = 1\r\n \r\n seen[num] = i\r\n\r\nmmax = 0\r\nhigh = -1\r\nfor i in range(n):\r\n if dp[i] > mmax:\r\n mmax = dp[i]\r\n high = nums[i]\r\n\r\nprint(mmax)\r\nlow = high-mmax+1\r\n\r\nidxs = []\r\ncur = low\r\nfor i in range(n):\r\n if len(idxs) == mmax:\r\n break\r\n x = nums[i]\r\n if x == cur:\r\n cur+=1\r\n idxs.append(i+1)\r\nprint(*idxs)\r\n\r\n", "# ﷽\r\nfrom bisect import bisect_left\r\nfrom collections import defaultdict\r\nimport sys\r\ninput = lambda: sys.stdin.readline().strip()\r\ndef inlst():return [int(i) for i in input().split()]\r\noo=float('inf')\r\n\r\ndef solve():\r\n n=int(input())\r\n lst=inlst()\r\n dic=defaultdict(int)\r\n k=-1;val=-1\r\n for i in lst:\r\n dic[i]=dic[i-1]+1\r\n\r\n if dic[i]>val:\r\n k=i\r\n val=dic[i]\r\n\r\n \r\n values=[]\r\n for i in range(val):\r\n values.append(k-i)\r\n\r\n values=values[::-1]\r\n id=0\r\n ans=[]\r\n for i,j in enumerate(lst):\r\n if j==values[id]:\r\n ans.append(i+1)\r\n id+=1\r\n if id==len(values):break\r\n print(len(ans))\r\n print(*ans)\r\ndef main():\r\n # for i in range(int(input())):\r\n solve()\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n=int(input())\r\narr=[int(i) for i in input().split()]\r\ndata={}\r\nmaxi=0\r\nlast_val=0\r\nfor i,e in enumerate(arr):\r\n c=data.get(e-1,0)\r\n data[e]=c+1\r\n if c+1>maxi:\r\n maxi=c+1\r\n last_val=e\r\nprint(data[last_val])\r\nstart=last_val-data[last_val]+1\r\nfor i,e in enumerate(arr):\r\n if e==start:\r\n print(i+1,end=' ')\r\n start+=1", "n=int(input())\r\ng={}\r\ns=[*map(int,input().split())]\r\nfor i in s:g[i]=g.get(i-1,0)+1\r\ne=max(g,key=g.get)\r\nm=g[e]\r\na=[]\r\nwhile n:\r\n if s[n-1]==e:a+=n,;e-=1\r\n n-=1\r\nprint(m,*a[::-1])" ]

[ "import sys\r\nimport threading\r\nfrom sys import stdin, stdout\r\nfrom itertools import accumulate\r\ninput = stdin.readline\r\nprint = stdout.write\r\n\r\nif __name__ == \"__main__\":\r\n\r\n n = int(input().strip())\r\n\r\n arr = list(map(int, input().strip().split()))\r\n arr_sort = sorted(arr) #this is the t = O(nlogn) step\r\n\r\n cumulative_orig = list(accumulate(arr)) #this is t = O(n)\r\n cumulative_sort = list(accumulate(arr_sort))\r\n\r\n m = int(input().strip())\r\n\r\n for query in range(m):\r\n \r\n type, left_index, right_index = map(int, input().strip().split())\r\n\r\n left_index -= 1 #Our code assumes 0-indexing of lists but question expects 1-indexing (nonsense!)\r\n right_index -= 1\r\n \r\n if type == 1:\r\n print(f\"{cumulative_orig[right_index] - cumulative_orig[left_index] + arr[left_index]}\\n\")\r\n else:\r\n print(f\"{cumulative_sort[right_index] - cumulative_sort[left_index] + arr_sort[left_index]}\\n\")", "n = int(input())\r\nv = list(map(int,input().split()))\r\nu = sorted(v)\r\ndp = [0]\r\ndps = [0]\r\nfor i in range(n):\r\n dp.append(dp[-1]+v[i])\r\n dps.append(dps[-1]+u[i])\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nm = int(input())\r\nfor _ in range(m):\r\n type,l,r = map(int,input().split())\r\n if type == 1:\r\n print(dp[r]-dp[l-1])\r\n else:\r\n print(dps[r]-dps[l-1])\r\n", "n=int(input())\r\ncost=list(map(int,input().split()))\r\ninc_cost=list(cost)\r\ninc_cost.sort()\r\ncostps=[0]*len(cost)\r\ninc_costps=[0]*len(cost)\r\n\r\n\r\nfor i in range(len(cost)):\r\n if i==0:\r\n costps[i]+=cost[i]\r\n else:\r\n costps[i]+=costps[i-1]+cost[i]\r\n\r\nfor i in range(len(cost)):\r\n if i==0:\r\n inc_costps[i]+=inc_cost[i]\r\n else:\r\n inc_costps[i]+=inc_costps[i-1]+inc_cost[i]\r\n \r\nm=int(input())\r\n\r\nfor q in range(m):\r\n ques=list(map(int,input().split()))\r\n if ques[0]==1:\r\n if ques[1]==1:\r\n print(costps[ques[2]-1])\r\n else: \r\n print(costps[ques[2]-1]-costps[ques[1]-2])\r\n else: \r\n if ques[1]==1:\r\n print(inc_costps[ques[2]-1])\r\n else:\r\n print(inc_costps[ques[2]-1]-inc_costps[ques[1]-2])", "n = int(input())\nl1 = list(map(int, input().split()))\n\nsorted_l1 = sorted(l1)\nm = int(input())\npref1 = [0] * n\npref2 = [0] * n\n \npref1[0] = l1[0]\npref2[0] = sorted_l1[0]\nfor i in range(1, n):\n pref1[i] = pref1[i-1] + l1[i]\n pref2[i] = pref2[i-1] + sorted_l1[i]\n\nfor i in range(m):\n t, l, r = list(map(int, input().split()))\n l -= 1\n r -= 1\n\n if t == 1:\n if l == 0:\n print(pref1[r])\n else:\n print(pref1[r] - pref1[l-1])\n else:\n if l == 0:\n print(pref2[r])\n else:\n print(pref2[r] - pref2[l-1])", "n = int(input())\nstones = [int(num) for num in input().split()]\nm = int(input())\n\ndef aggregate_sum(array):\n sum_array = [array[0]]\n for i in range(1, len(array)):\n sum_array.append(array[i] + sum_array[i-1])\n return sum_array\n\nsum_array_non_ordered = aggregate_sum(stones)\nstones.sort()\nsum_array_ordered = aggregate_sum(stones)\n\nfor i in range(m):\n q = [int(num) for num in input().split()]\n l, r = q[1], q[2]\n\n if q[0] == 1:\n if l == 1:\n print(sum_array_non_ordered[r-1])\n else:\n print(sum_array_non_ordered[r-1] - sum_array_non_ordered[l-2])\n else:\n if l == 1:\n print(sum_array_ordered[r-1])\n else:\n print(sum_array_ordered[r-1] - sum_array_ordered[l-2])\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\nl = list(map(int, input().split()))\r\nl1 = sorted(l)\r\nlsum = []\r\nl1sum = []\r\nsum = 0\r\nsum1 = 0\r\nfor i in range(n):\r\n sum += l[i]\r\n lsum.append(sum)\r\nfor i in range(n):\r\n sum1 += l1[i]\r\n l1sum.append(sum1)\r\nfor i in range(int(input())):\r\n t, l, r = map(int, input().split())\r\n if t == 1:\r\n if l<=1:\r\n print(lsum[r-1])\r\n else:\r\n print(lsum[r-1] - lsum[l-2])\r\n else:\r\n if l<=1:\r\n print(l1sum[r-1])\r\n else:\r\n print(l1sum[r-1] - l1sum[l-2])", "n = int(input())\nv_list = list(map(int, input().split()))\nm = int(input())\nv_list_sorted = sorted(v_list)\n\nprefix_sum = [[0,v_list[0]],[0,v_list_sorted[0]]]\nfor i in range(1, n):\n sum_val = prefix_sum[0][i] + v_list[i]\n prefix_sum[0].append(sum_val)\n\nfor i in range(1, n):\n sum_val = prefix_sum[1][i] + v_list_sorted[i]\n prefix_sum[1].append(sum_val)\n\nfor i in range(m):\n type_question, l, r = map(int, input().split())\n print(str(prefix_sum[type_question-1][r] - prefix_sum[type_question-1][l-1]))", "n = int(input())\r\na = list(map(int,input().split()))\r\nprea = []\r\nprea.append(a[0])\r\nfor i in range(1,n):\r\n prea.append(prea[len(prea)-1]+a[i])\r\nprea2 = []\r\na.sort()\r\nprea2.append(a[0])\r\nfor i in range(1,n):\r\n prea2.append(prea2[len(prea2)-1]+a[i])\r\nt = int(input())\r\nfor _ in range(t):\r\n typ,l,r = map(int,input().split())\r\n if(typ == 1):\r\n if(l == 1):print(prea[r-1])\r\n else:print(prea[r-1]-prea[l-2])\r\n else:\r\n if(l == 1):print(prea2[r-1])\r\n else:print(prea2[r-1]-prea2[l-2])\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\npl=[0]\r\nfor i in range(n):\r\n\tpl.append(l[i]+pl[i])\r\nl.sort()\r\npsl=[0]\r\nfor i in range(n):\r\n\tpsl.append(l[i]+psl[i])\r\nfor i in range(int(input())):\r\n\ttype,l,r=map(int,input().split())\r\n\tif type==1:\r\n\t\tprint(pl[r]-pl[l-1])\r\n\telse:\r\n\t\tprint(psl[r]-psl[l-1])", "import sys\nn = int(sys.stdin.readline())\narr = [int(i) for i in sys.stdin.readline().split()]\nm = int(sys.stdin.readline())\npre_arr = []\npre_sort_arr = []\nsu = 0\nfor i in arr:\n su+=i\n pre_arr.append(su)\narr.sort()\nsu = 0\nfor i in arr:\n su+=i\n pre_sort_arr.append(su)\nfor i in range(m):\n type,l,r = [int(j) for j in sys.stdin.readline().split()]\n if type==1:\n if l!=1:\n print(pre_arr[r-1]-pre_arr[l-2])\n else:\n print(pre_arr[r-1])\n else:\n if l!=1:\n print(pre_sort_arr[r-1]-pre_sort_arr[l-2])\n else:\n print(pre_sort_arr[r-1])\n", "x = int(input())\ntotals = [0]\nstones = list(map(int, input().split()))\nfor i in range(len(stones)):\n totals.append(stones[i] + totals[i])\nstones.sort()\nothers = [0]\nfor i in range(len(stones)):\n others.append(stones[i] + others[i])\nfor i in range(int(input())):\n a, b, c = map(int, input().split())\n if a == 1: print(totals[c] - totals[b-1])\n elif a == 2: print(others[c] - others[b - 1])\n \t\t\t \t \t \t\t \t \t\t \t\t \t", "input()\narr = list(map(int, input().split()))\n\nsm = [0]\n\nfor v in arr:\n if not sm:\n sm.append(v)\n else:\n sm.append(sm[-1] + v)\n\narr.sort()\n\nsm_sorted = [0]\n\nfor v in arr:\n if not sm_sorted:\n sm_sorted.append(v)\n else:\n sm_sorted.append(sm_sorted[-1] + v)\n\nfor _ in range(int(input())):\n t, l, r = map(int, input().split())\n\n if t == 1:\n print(sm[r] - sm[l - 1])\n else:\n print(sm_sorted[r] - sm_sorted[l - 1])\n", "import collections\r\nimport math\r\nsums = lambda n: int(n * (n + 1) / 2) # sum from 1 to n\r\nsumsqur = lambda n: int( (n) * (n + 1) * (2*n +1)/6) # sum square from 1 to n\r\n\r\n\r\ndef im(): return map(int, input().split())\r\ndef il(): return list(map(int, input().split()))\r\ndef ii(): return int(input())\r\n\r\n# \"abcdefghijklmnopqrstuvwxyz\"\r\n\r\ndef isPalindrom(a):\r\n return True if a[::-1] == a else False\r\nxx=lambda n:int(n * (n - 1) / 2) # 2->1,3->3,4->6,5->10,6->15\r\n\r\ndef solve():\r\n n=ii()\r\n v=il()\r\n m=ii()\r\n dp=[0]*(n+1)\r\n s=sorted(v)\r\n pre=[0]*(n+1)\r\n for i in range(n):\r\n dp[i+1]=dp[i]+v[i]\r\n pre[i+1]=pre[i]+s[i]\r\n for i in range(m):\r\n t,l,r=im()\r\n if t==1:\r\n print(dp[r]-dp[l-1])\r\n else:\r\n print(pre[r]-pre[l-1])\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n #for i in range(ii()):\r\n solve()\r\n", "def DP(li, n):\r\n ans = []\r\n c = 0\r\n for i in range(n):\r\n c += li[i]\r\n ans.append(c)\r\n ans.append(0)\r\n return ans\r\n\r\nn = int(input())\r\nv = list(map(int, input().split()))\r\nli1 = DP(v, n)\r\nv.sort()\r\n#print(li1)\r\nli2 = DP(v, n)\r\n#print(li2)\r\nm = int(input())\r\nfor i in range(m):\r\n t, l, r = map(int, input().split())\r\n if t == 1:\r\n print(li1[r-1]-li1[l-2])\r\n else:\r\n print(li2[r-1]-li2[l-2])\r\n", "n = int(input())\r\nv = list(map(int, input().split()))\r\nm = int(input())\r\n\r\nvs = list(v)\r\nvs.sort()\r\n\r\ndpv = []\r\ndpvs = []\r\ndpv.append(v[0])\r\ndpvs.append(vs[0])\r\nfor i in range(1, len(v)):\r\n dpv.append(dpv[i - 1] + v[i])\r\n dpvs.append(dpvs[i - 1] + vs[i])\r\n\r\nfor j in range(m):\r\n t, l, r = map(int, input().split())\r\n l -= 2\r\n r -= 1\r\n \r\n if t == 1:\r\n print(dpv[r] - (0 if l == -1 else dpv[l]))\r\n else:\r\n print(dpvs[r] - (0 if l == -1 else dpvs[l]))\r\n \r\n", "n=input()\nv=list(map(int, input().split(' ')))\nw=sorted(v)\n\nfor k in range(1,len(v)):\n v[k]+=v[k-1]\n\nfor p in range(1,len(w)):\n w[p]=w[p-1] + w[p]\n\nm=int(input())\nfor i in range(m):\n t,l,r = list(map(int, input().split(' ')))\n if(t==1):\n if(l==1):\n print(v[r-1])\n else:\n print(v[r-1] -v[l-2])\n else:\n if(l==1):\n print(w[r-1])\n else:\n print(w[r-1]-w[l-2])\n \t \t \t\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 q = int(input())\r\n q_arr = [[] for i in range(q)]\r\n\r\n for i in range(q):\r\n type,l,r = map(int,input().split())\r\n q_arr[i].append(type)\r\n q_arr[i].append(l)\r\n q_arr[i].append(r)\r\n\r\n sort_arr = sorted((arr))\r\n pref_arr = [0 for _ in range(n+1)]\r\n pref_sort_arr = [0 for _ in range(n+1)]\r\n\r\n for i in range(n):\r\n pref_arr[i+1] = pref_arr[i] + arr[i]\r\n for i in range(n):\r\n pref_sort_arr[i+1] = pref_sort_arr[i] + sort_arr[i]\r\n\r\n for i in range(q):\r\n if(q_arr[i][0] == 1):\r\n print(pref_arr[q_arr[i][2]] - pref_arr[q_arr[i][1]-1])\r\n if(q_arr[i][0] == 2):\r\n print(pref_sort_arr[q_arr[i][2]] - pref_sort_arr[q_arr[i][1]-1])\r\nsolve()\r\n\r\n", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nans1=[0]*(n+1)\r\nans2=[0]*(n+1)\r\nfor i in range(1,n+1):\r\n ans1[i]=a[i-1]+ans1[i-1]\r\na.sort()\r\nfor i in range(1,n+1):\r\n ans2[i]=a[i-1]+ans2[i-1]\r\nfor _ in range(int(input())):\r\n t,l,r=map(int,input().split())\r\n if(t==1):\r\n print(ans1[r]-ans1[l-1])\r\n else:\r\n print(ans2[r]-ans2[l-1])", "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\nn=inp()\r\nl=inlt()\r\ns=l.copy()\r\ns.sort()\r\nv=[0 for i in range(n+1)]\r\nfor i in range(1,n+1):\r\n v[i]=v[i-1]+l[i-1]\r\nu=[0 for i in range(n+1)]\r\nfor i in range(1,n+1):\r\n u[i]=u[i-1]+s[i-1]\r\nm=inp()\r\nfor _ in range(m):\r\n a,b,c=invr()\r\n if a==1:\r\n print(v[c]-v[b-1])\r\n else:\r\n print(u[c]-u[b-1])", "q = int(input())\nc = [0]+[int(i) for i in input().split()]\nc1 = sorted(c)\ndef s(i):\n w = 0\n for j in range(q+1):\n w += i[j]\n i[j] = w\n return i\nc = s(c)\nc1 = s(c1)\nfor _ in range(int(input())):\n b, x1, x2 = [int(i) for i in input().split()]\n if b == 1:\n print(c[x2]-c[x1-1])\n else:\n print(c1[x2]-c1[x1-1])\n\n", "import sys\r\n\r\nn = int(input())\r\nv = list(map(int, sys.stdin.readline().split()))\r\nu = sorted(v)\r\nvcost = [v[0]] * n\r\nucost = [u[0]] * n\r\nfor i in range(n):\r\n if i == 0: continue\r\n vcost[i] = vcost[i - 1] + v[i]\r\n ucost[i] = ucost[i - 1] + u[i]\r\n\r\nfor i in range(int(input())):\r\n type, l, r = map(int, sys.stdin.readline().split())\r\n if type == 1:\r\n if l - 2 >= 0:\r\n print(vcost[r - 1] - vcost[l - 2])\r\n else:\r\n print(vcost[r - 1])\r\n else:\r\n if l - 2 >= 0:\r\n print(ucost[r - 1] - ucost[l - 2])\r\n else:\r\n print(ucost[r - 1])\r\n", "t = int(input())\r\nlst = list(map(int,input().split()))\r\nx = lst[:]\r\nx.sort()\r\nl_st = [0]\r\nlst1 = [0]\r\nk = 0\r\nk1 = 0\r\nfor i in range(t):\r\n k += lst[i]\r\n l_st.append(k)\r\n k1 += x[i]\r\n lst1.append(k1)\r\nn = int(input())\r\nfor i in range(n):\r\n t_pe , l , r = map(int,input().split())\r\n if(t_pe == 1):\r\n print(l_st[r] - l_st[l - 1])\r\n else:\r\n print(lst1[r] - lst1[l - 1])", "n = int(input())\r\nasum=0\r\nbsum=0\r\na = list( map( int , input().split()))\r\nb = sorted(a)\r\nasuml=[0]\r\nbsuml=[0]\r\nfor i in range(n):\r\n asum+=a[i]\r\n asuml.append(asum)\r\n\r\nfor i in range(n):\r\n bsum+=b[i]\r\n bsuml.append(bsum)\r\nfor t in range(int(input())):\r\n case,l,r = map(int , input().split())\r\n l-=1\r\n if case == 1:\r\n print(asuml[r] - asuml[l])\r\n else:\r\n print(bsuml[r] - bsuml[l])", "n = int(input())\r\na1 = list(map(int,input().split()))\r\na1.insert(0,0)\r\na2 = sorted(a1)\r\n\r\nfor i in range(1,n+1):\r\n a1[i]+=a1[i-1]\r\n a2[i]+=a2[i-1]\r\n\r\nm = int(input())\r\nwhile m > 0:\r\n type,l,r = list(map(int,input().split()))\r\n if type == 1:\r\n print (a1[r]-a1[l-1])\r\n else:\r\n print (a2[r]-a2[l-1])\r\n m-=1", "if __name__ == '__main__':\r\n n = int(input())\r\n a = list(map(int,input().split()))\r\n ps = [0 for _ in range(n+1)]\r\n for i in range(1,n+1):\r\n ps[i] = a[i-1] + ps[i-1]\r\n a.sort()\r\n psrt = [0 for _ in range(n+1)]\r\n for i in range(1,n+1):\r\n psrt[i] = a[i-1] + psrt[i-1]\r\n for _ in range(int(input())):\r\n t, l, r = map(int,input().split())\r\n if t == 1:\r\n print(ps[r] - ps[l-1])\r\n else:\r\n print(psrt[r] - psrt[l-1])", "\r\n\r\ndef solve():\r\n num_stone = int(input())\r\n in_c = list(map(int, input().split()))\r\n c = [0]\r\n c.extend(in_c)\r\n cs = sorted(c)\r\n\r\n for idx, _ in enumerate(c):\r\n if idx:\r\n c[idx] += c[idx - 1]\r\n cs[idx] += cs[idx - 1]\r\n\r\n num_queries = int(input())\r\n for _ in range(num_queries):\r\n q, l, r = list(map(int, input().split()))\r\n if q == 1:\r\n print(c[r] - c[l - 1])\r\n else:\r\n print(cs[r] - cs[l - 1])\r\n\r\n\r\ndef main():\r\n solve()\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "import itertools\r\n\r\nn = int(input())\r\nv = list(map(int, input().split()))\r\nu = v.copy()\r\nu.sort()\r\nvsums = [0] + list(itertools.accumulate(v))\r\nusums = [0] + list(itertools.accumulate(u))\r\n\r\nfor _ in range(int(input())):\r\n t, l, r = map(int, input().split())\r\n if t == 1:\r\n print(vsums[r]-vsums[l-1])\r\n else:\r\n print(usums[r]-usums[l-1])", "n=int(input())\n\narr=list(map(int,input().split()))\n\n\nsorted_arr=sorted(arr)\n#print(sorted_arr)\n\npref_arr=[0]*n\npref_sorted=[0]*n\n\n#Prefix sum calculation for main array\nfor i in range(n):\n if(i==0):\n pref_arr[i]=arr[i]\n else:\n pref_arr[i]=pref_arr[i-1]+arr[i]\n\n#Prefix sum calculation for sorted array\nfor i in range(n):\n if(i==0):\n pref_sorted[i]=sorted_arr[i]\n else:\n pref_sorted[i]=pref_sorted[i-1]+sorted_arr[i]\n\n#Take queries as input\n\nq=int(input())\n\nfor i in range(q):\n op,L,R=map(int,input().split())\n if(op==1):\n if(L==1):\n print(pref_arr[R-1])\n else:\n print(pref_arr[R-1]-pref_arr[L-2])\n else:\n if(L==1):\n print(pref_sorted[R-1])\n else:\n print(pref_sorted[R-1]-pref_sorted[L-2])\n\n\n \n\n \n\n\n\n\t \t \t \t \t\t\t \t \t \t\t \t \t\t", "n = int(input())\ncost = [int(x) for x in input().split()]\nm = int(input())\nsorted_cost = sorted(cost)\npre_sum = [0] * (n + 1)\npre_sorted_sum = [0] * (n + 1)\nfor i in range(1, n + 1):\n pre_sum[i] = pre_sum[i - 1] + cost[i - 1]\n pre_sorted_sum[i] = pre_sorted_sum[i - 1] + sorted_cost[i - 1]\nfor i in range(m):\n t, l, r = tuple(int(x) for x in input().split())\n if t == 1:\n print(pre_sum[r] - pre_sum[l - 1])\n else:\n print(pre_sorted_sum[r] - pre_sorted_sum[l - 1])\n \t \t \t\t \t\t \t \t\t\t \t \t\t \t \t\t", "from collections import deque\nfrom math import *\nimport sys\nimport random\nfrom bisect import *\nfrom functools import reduce\nfrom sys import stdin\nimport copy\n\nn = int(input())\narr = list(map(int,input().split()))\nnor = [0 for i in range(len(arr)+1)]\nsor_nor = [0 for i in range(len(arr)+1)]\nsor_arr = sorted(arr)\nfor i in range(0,len(arr)):\n sor_nor[i] = sor_nor[i-1]+sor_arr[i]\n nor[i] = nor[i-1]+arr[i]\nq = int(input())\nfor q in range(q):\n t,l,r = map(int,input().split())\n if t == 1:\n print(nor[r-1]-nor[l-2])\n else:\n print(sor_nor[r-1]-sor_nor[l-2])\n\n", "'''\r\n \r\n * author: unstoppableforce\r\n * created: 15.12.2022 12:15:58\r\n\r\n'''\r\nfrom itertools import *\r\n\r\ndef read(datatype: type, single=0):\r\n\tif not single:\r\n\t\treturn map(datatype, input().split())\r\n\telse:\r\n\t\treturn datatype(input())\r\n\t\t \r\n\r\nif __name__ == \"__main__\":\r\n\tn = read(int, 1)\r\n\tlst1 = list(read(int))\r\n\tlst2 = sorted(lst1)\r\n\tq = read(int, 1)\r\n\tprefix1 = list(accumulate(lst1, initial=0))\r\n\tprefix2 = list(accumulate(lst2, initial=0))\r\n\tfor _ in range(q):\r\n\t\tch, l, r = read(int)\r\n\t\tif ch == 1: print(prefix1[r] - prefix1[l - 1])\r\n\t\telse: print(prefix2[r] - prefix2[l - 1])\t\t", "n = int(input())\r\n\r\nx = [int(_) for _ in input().split()]\r\ny = x.copy()\r\ny.sort()\r\n\r\nfor i in range(1, n):\r\n x[i] += x[i-1]\r\n y[i] += y[i-1]\r\n\r\nm = int(input())\r\n\r\n\r\nfor _ in range(m):\r\n\r\n type, l,r = [int(_) for _ in input().split()]\r\n l -= 1\r\n r -= 1\r\n if type==1:\r\n if l==0:\r\n print(x[r])\r\n else:\r\n print(x[r]-x[l-1])\r\n \r\n else:\r\n if l ==0:\r\n print(y[r])\r\n else:\r\n print(y[r]-y[l-1])\r\n", "n = int(input())\r\narr = [0] + list(map(int, input().split()))\r\narr2 = sorted(arr)\r\nfor i in range(n):\r\n arr[i+1] += arr[i]\r\n arr2[i+1] += arr2[i]\r\n\r\nm = int(input())\r\nfor k in range(m):\r\n t, l, r = map(int, input().split())\r\n if t % 2:\r\n print(arr[r] - arr[l-1])\r\n else:\r\n print(arr2[r] - arr2[l-1])", "n = int(input())\r\nv = list(map(int,input().split()))\r\nu = sorted(v)\r\nfor i in range(1,n):\r\n v[i] += v[i-1]\r\n u[i] += u[i-1]\r\nm = int(input())\r\nfor i in range(m):\r\n t,l,r = map(int,input().split())\r\n if t == 1:\r\n if l == 1:\r\n print(v[r-1])\r\n else:\r\n print(v[r-1]-v[l-2])\r\n else:\r\n if l == 1:\r\n print(u[r-1])\r\n else:\r\n print(u[r-1]-u[l-2])", "n = int(input())\r\nl = list(map(int,input().split()))\r\nsortedL = sorted(l)\r\n\r\nlistSum = [0]\r\nsortedListSum = [0]\r\n\r\ns1 = 0\r\ns2 = 0\r\n\r\nfor i in range(n):\r\n s1 += l[i]\r\n s2 += sortedL[i]\r\n listSum.append(s1)\r\n sortedListSum.append(s2) \r\n\t\r\nfor j in range(int(input())):\r\n\ttyp, l, r = map(int, input().split())\r\n\t\r\n\tif(typ == 1):\r\n\t\tprint(listSum[r] - listSum[l-1])\r\n\telse:\r\n\t\tprint(sortedListSum[r] - sortedListSum[l-1])\r\n", "number_of_ele = int(input())\r\narr = list(map(int , input().split()))\r\nnumber_of_q = int(input())\r\ndate_unsorted = {\r\n '0': 0\r\n}\r\ndate_sort = {\r\n '0' : 0\r\n}\r\ndef sort(arr , word):\r\n counter = 0\r\n for i in range(0 , len(arr)):\r\n counter += arr[i]\r\n if word != 'sort' :\r\n date_unsorted[f\"{i+1}\"] = counter\r\n else :\r\n date_sort[f'{i+1}'] = counter\r\nsort(arr , 0)\r\narr.sort()\r\nsort(arr , 'sort')\r\nfor i in range(0 , number_of_q):\r\n x = list(map(int, input().split()))\r\n if x[0] == 1 :\r\n print(date_unsorted[f\"{x[2]}\"] - date_unsorted[f'{x[1]-1}'])\r\n else :\r\n print(date_sort[f\"{x[2]}\"] - date_sort[f\"{x[1]-1}\"])", "n = int(input())\narr = list(map(int, input().split()))\nsum = [0] * (n + 1)\nsum2 = [0] * (n + 1)\n\nfor i in range(1, n + 1):\n sum[i] = sum[i - 1] + arr[i - 1]\n\narr.sort()\n\nfor i in range(1, n + 1):\n sum2[i] = sum2[i - 1] + arr[i - 1]\n\nm = int(input())\n\nfor i in range(m):\n type, l, s = map(int, input().split())\n if type == 1:\n result = sum[s] - sum[l - 1]\n else:\n result = sum2[s] - sum2[l - 1]\n print(result)\n\n\t \t\t \t\t \t \t \t \t\t\t\t\t \t\t\t\t \t\t", "n, v = int(input()), list(map(int, input().split()))\r\nu = sorted(v)\r\nfor i in range(1, len(v)):\r\n v[i] += v[i - 1]\r\n u[i] += u[i - 1]\r\n \r\nfor _ in range(int(input())):\r\n k, l, r = map(int, input().split())\r\n s = 0\r\n if k == 1:\r\n s = v[r - 1] - (0 if l == 1 else v[l - 2])\r\n else:\r\n s = u[r - 1] - (0 if l == 1 else u[l - 2])\r\n print(s)", "n = int(input())\ncustos = [int(x) for x in input().split()]\nm = int(input())\n\nsums = {}\nfor i in range(len(custos)):\n if i == 0:\n sums[i] = custos[i]\n else:\n sums[i] = custos[i] + sums[i-1]\n\ncusto_ord = custos.copy()\ncusto_ord.sort()\nsoma_ord = {}\nfor i in range(len(custo_ord)):\n if i == 0:\n soma_ord[i] = custo_ord[i]\n else:\n soma_ord[i] = custo_ord[i] + soma_ord[i-1]\n\nwhile m > 0:\n t, l, r = [int(x) for x in input().split()]\n if t == 1:\n if l - 1 == 0:\n print(sums[r-1])\n else:\n print(sums[r-1] - sums[l - 2])\n else:\n if l - 1 == 0:\n print(soma_ord[r-1])\n else:\n print(soma_ord[r-1] - soma_ord[l - 2])\n m -= 1\n \t\t\t\t \t \t\t \t \t \t \t\t\t \t\t", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=sorted(a)\r\nfor i in range(1,n):\r\n a[i]+=a[i-1]\r\nfor i in range(1,n):\r\n b[i]+=b[i-1]\r\nfor i in range(int(input())):\r\n c=list(map(int,input().split()))\r\n d=0\r\n if c[0]==1:\r\n if c[1]==1:\r\n print(a[c[2]-1])\r\n else:\r\n print(a[c[2]-1]-a[c[1]-2])\r\n else:\r\n if c[1]==1:\r\n print(b[c[2]-1])\r\n else:\r\n print(b[c[2]-1]-b[c[1]-2])\r\n \r\n\r\n", "n = int(input())\r\n\r\n\r\nv = list(map(int, input().split()))\r\nsv = [0] * (n + 1)\r\nfor i in range(1, n + 1):\r\n\tsv[i] = sv[i - 1] + v[i - 1]\r\n\r\n\r\nu = sorted(v)\r\nsu = [0] * (n + 1)\r\nfor i in range(1, n + 1):\r\n\tsu[i] = su[i - 1] + u[i - 1]\r\n\r\n\r\nm = int(input())\r\nfor _ in range(m):\r\n\tt, l, r = map(int, input().split())\r\n\tif t == 1:\r\n\t\tprint(sv[r] - sv[l - 1])\r\n\telse:\r\n\t\tprint(su[r] - su[l - 1])", "def handle():\n n = int(input())\n vs = [int(x) for x in input().split()]\n\n v_sums = [0]\n for v in vs:\n v_sums.append(v_sums[-1] + v)\n\n q = int(input())\n us = None\n u_sums = None\n for i in range(q):\n t, l, r = [int(x) for x in input().split()]\n if t == 1:\n print(v_sums[r] - v_sums[l-1])\n else:\n if us is None:\n us = sorted(vs)\n u_sums = [0]\n for u in us:\n u_sums.append(u_sums[-1] + u)\n \n print(u_sums[r] - u_sums[l-1])\n\nhandle()\n", "# import sys\n# input = sys.stdin.readline\nar=lambda:list(map(int,input().split()))\nI=lambda:map(int,input().split())\nfrom collections import defaultdict\nimport bisect\nfrom collections import Counter\nfrom queue import PriorityQueue\n# def solve():\n#\n#\n#\n# if __name__ == \"__main__\":\n# t = int(input())\n# for _ in range(t):\n# solve()\n\nn=int(input())\narr=list(map(int,input().split()))\narr2=arr.copy()\narr2.sort()\nfor i in range(1,n):\n arr[i]+=arr[i-1]\nfor i in range(1,n):\n arr2[i]+=arr2[i-1]\nfor i in range(int(input())):\n x,l,r=map(int,input().split())\n l-=1;r-=1\n if x==1:\n if l>0:\n print(arr[r]-arr[l-1])\n else:\n print(arr[r])\n if x==2:\n if l>0:\n print(arr2[r]-arr2[l-1])\n else:\n print(arr2[r])\n\n\n\n\n\n\n\n\n\n\n\n\t\t\t\t\t\t\t\t \t \t\t\t \t \t \t \t \t\t \t\t", "# --- Algorithm --- #\ndef function(n, v, m, Q):\n v_prefix_sum = compute_prefix_sums(v, {})\n u_prefix_sum = compute_prefix_sums(sorted(v), {})\n\n # print(v_prefix_sum)\n # print(u_prefix_sum)\n A = []\n\n for q in Q:\n ty = q[0]\n start = int(q[1])\n end = int(q[2])\n\n if ty == \"1\":\n A.append(v_prefix_sum[end] - v_prefix_sum[start - 1])\n else:\n A.append(u_prefix_sum[end] - u_prefix_sum[start - 1])\n\n A[-1] = str(A[-1])\n\n return \"\\n\".join(A)\n \ndef compute_prefix_sums(a, d):\n d[0] = 0\n\n for i in range(len(a)):\n if i == 0:\n d[i + 1] = a[i]\n else:\n d[i + 1] = a[i] + d[i]\n\n return d\n \n\n\n \n\n\n# --- Run --- #\n\n# input vars\nn = int(input())\nv = list( map(int, input().split()) )\nm = int(input())\nQ = []\n\nfor i in range(m):\n Q.append(input().split())\n\n#print(times)\n# function output\nans = function(n, v, m, Q)\n\n# spit answer\nprint(ans)", "n = int(input())\r\na = list(map(int, input().split()))\r\na.insert(0, 0)\r\nb = sorted(a)\r\n\r\nfor i in range(1, len(a)):\r\n a[i] = a[i] + a[i-1]\r\n b[i] = b[i] + b[i-1]\r\n \r\nfor i in range(int(input())):\r\n t, l, r = map(int, input().split())\r\n if t == 1:\r\n print(a[r] - a[l-1])\r\n else:\r\n print(b[r] - b[l-1])\r\n\r\n", "len_ar = int(input())\n\nar = list(map(int,input().split(\" \")))\n\ncases = int(input())\n\nsort_ar = sorted(ar)\n\nprefix_sum_ar = []\nprefix_sum_ar_sorted = []\n\nsum_r = 0\nsum_sorted = 0\n\nfor r in range(len(ar)):\n sum_r += ar[r]\n sum_sorted += sort_ar[r]\n prefix_sum_ar.append(sum_r)\n prefix_sum_ar_sorted.append(sum_sorted)\n\n\nans = -1\n\nfor i in range(cases):\n type, l, r = map(int,input().split(\" \"))\n\n l -= 1\n r -=1\n if(type == 1):\n if(l != 0):\n ans = prefix_sum_ar[r] - prefix_sum_ar[l-1]\n else:\n ans = prefix_sum_ar[r]\n \n else:\n if(l != 0):\n ans = prefix_sum_ar_sorted[r] - prefix_sum_ar_sorted[l-1]\n else:\n ans = prefix_sum_ar_sorted[r]\n \n print(ans)\n\n\n \t \t\t \t\t \t\t \t \t \t \t\t\t\t\t \t\t", "from itertools import accumulate\r\n\r\nn = int(input())\r\nv = list(map(int, input().split()))\r\nm = int(input())\r\n\r\ntype, l, r = [], [], []\r\nu = sorted(v)\r\npre_sum_v = [0] + list(accumulate(v))\r\npre_sum_u = [0] + list(accumulate(u))\r\nfor _ in range(m):\r\n res = 0\r\n type, l, r = list(map(int, input().split()))\r\n if type == 2:\r\n res = pre_sum_u[r] - pre_sum_u[l-1]\r\n else:\r\n res = pre_sum_v[r] - pre_sum_v[l-1]\r\n print(res)", "from sys import stdin,stdout\r\ninput = stdin.readline\r\n\r\ndef main():\r\n #t = int(input())\r\n t = 1\r\n for z in range(t):\r\n #n = int(input())\r\n #a,b,c = map(int,input().split())\r\n #ai = list(map(int,input().split()))\r\n n = int(input())\r\n ai = list(map(int,input().split()))\r\n m = int(input())\r\n ai2 = [i for i in ai]\r\n ai2.sort()\r\n ar = [0]*(n+1)\r\n ar2 = [0]*(n+1)\r\n for i in range(n):\r\n ar[i+1] = ar[i] + ai[i]\r\n ar2[i+1] = ar2[i] + ai2[i]\r\n for i in range(m):\r\n t,l,r = map(int,input().split())\r\n if t == 1:\r\n print(ar[r] - ar[l-1])\r\n else:\r\n print(ar2[r] - ar2[l-1])\r\nmain()\r\n\r\n", "n=int(input())\nar=list(map(int,input().split()))\np1=[0]*(10**5+1)\np2=[0]*(10**5+1)\np1[0]=ar[0]\nfor i in range(1,n):\n p1[i]=p1[i-1]+ar[i]\nar.sort()\np2[0]=ar[0]\nfor i in range(1,n):\n p2[i]=p2[i-1]+ar[i]\n#print(p1,p2)\nk=int(input())\nfor i in range(k):\n t,a,b=map(int,input().split())\n if t==1:\n print(p1[b-1]-p1[a-2])\n else:\n print(p2[b-1]-p2[a-2])\n \t \t \t \t \t \t \t\t\t \t \t \t", "from itertools import accumulate as acc\r\nn = int(input())\r\nv = list(map(int, input().split()))\r\nu = sorted(v)\r\nv = [0]+list(acc(v))\r\nu = [0]+list(acc(u))\r\nfor _ in range(int(input())):\r\n t, l, r = map(int, input().split())\r\n if t == 1:\r\n print(v[r]-v[l-1])\r\n else:\r\n print(u[r]-u[l-1])\r\n", "n = int(input())\r\nv = [int(i) for i in input().split()]\r\nu = sorted(v)\r\npv = []\r\ns = 0\r\nfor i in range(n):\r\n s += v[i]\r\n pv.append(s)\r\npu = []\r\ns = 0\r\nfor i in range(n):\r\n s += u[i]\r\n pu.append(s)\r\nq = int(input())\r\nfor _ in range(q):\r\n type,l,r = map(int,input().split())\r\n s = 0\r\n if type==1:\r\n if l-2>=0:\r\n s = pv[r-1]-pv[l-2]\r\n else:\r\n s = pv[r-1]\r\n else:\r\n if l-2>=0:\r\n s = pu[r-1]-pu[l-2]\r\n else:\r\n s = pu[r-1]\r\n print(s)", "import sys\r\n\r\nx = int(sys.stdin.readline())\r\nl = [int(i) for i in sys.stdin.readline().split()]\r\nneed = [[0], [0]]\r\nsum1, sum2 = 0, 0\r\nfor i in range(x):\r\n sum1 += l[i]\r\n need[0].append(sum1)\r\nl.sort()\r\nfor i in range(x):\r\n sum2 += l[i]\r\n need[1].append(sum2)\r\nfor i in range(int(input())):\r\n t, l, r = map(int, sys.stdin.readline().split())\r\n print(need[t-1][r]-need[t-1][l-1])\r\n", "# n = int(input())\r\n# a = list(sorted(map(int, input().split())))\r\n# ok = True\r\n# for i in range(1, n - 1):\r\n# ok &= a[i] < a[i - 1] + a[i + 1]\r\n# # print(ok)\r\n# ok &= a[n - 1] < a[n - 2] + a[0]\r\n# print(\"YES\" if ok else \"NO\")\r\n# if ok:\r\n# a[n - 2], a[n - 1] = a[n - 1], a[n - 2]\r\n# print(\" \".join(map(str, a)))\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nb = list(sorted(a))\r\n\r\ndef pref(x):\r\n ret = [0] * len(x)\r\n ret[0] = x[0]\r\n for i in range(1, len(x)):\r\n ret[i] = ret[i-1] + x[i]\r\n return ret\r\n\r\npa = pref(a)\r\npb = pref(b)\r\n\r\nt = int(input())\r\nfor _ in range(t):\r\n typ, l, r = map(int, input().split())\r\n if typ == 1:\r\n if l == 1:\r\n print(pa[r - 1])\r\n else:\r\n print(pa[r - 1] - pa[l - 2])\r\n else:\r\n if l == 1:\r\n print(pb[r - 1])\r\n else:\r\n print(pb[r - 1] - pb[l - 2])\r\n", "n=int(input())\r\na=map(int,input().split())\r\na=list(a)\r\nv=[0]\r\nsorted_v=[0]\r\nfor i in range(n):\r\n v.append(v[i]+a[i])\r\na.sort()\r\nfor i in range(n):\r\n sorted_v.append(sorted_v[i]+a[i])\r\nfor i in range(int(input())):\r\n m= map(int,input().split())\r\n m=list(m)\r\n if m[0]==1:\r\n print(v[m[2]]-v[m[1]-1])\r\n else:\r\n print(sorted_v[m[2]]-sorted_v[m[1]-1])", "n = int(input())\narr = list(map(int,input().split()))\nsortedarray = [arr[0]]\nfor i in range(1,n):\n sortedarray.append(arr[i])\n arr[i] = arr[i-1] + arr[i]\nsortedarray = sorted(sortedarray)\n# print(arr,sortedarray)\nfor i in range(1,n):\n sortedarray[i] = sortedarray[i] + sortedarray[i-1]\nm = int(input())\nfor _ in range(m):\n t,l,r = map(int,input().split())\n if(t==1):\n if(l-1==0):\n print(arr[r-1])\n continue\n print(arr[r-1]-arr[l-2])\n else:\n if(l-1==0):\n print(sortedarray[r-1])\n continue\n print(sortedarray[r-1]-sortedarray[l-2])", "l = []\r\nl1 = []\r\nl2 = []\r\nn = int(input())\r\nsum = 0\r\nl = list(map(int, input().split(' ')))\r\nl.insert(0, 0)\r\ns = 0\r\nfor i in l:\r\n s += i\r\n l1.append(s)\r\n\r\n\r\ns = 0\r\nl.sort()\r\nfor i in l:\r\n s += i\r\n l2.append(s)\r\n\r\nm = int(input())\r\nfor i in range(m):\r\n temp = list(map(int, input().split(' ')))\r\n if temp[0] == 1:\r\n print(l1[temp[2]] - l1[temp[1]-1])\r\n else:\r\n print(l2[temp[2]] - l2[temp[1]-1])\r\n", "n = int(input())\r\n\r\ncosts = list(map(int, input().split()))\r\n\r\nquest = int(input())\r\n\r\n\r\narrange = sorted(costs)\r\nprefix = [0]*n\r\n\r\nprefix[0] = costs[0]\r\n\r\nprefix_arr = [0]*n\r\n\r\nprefix_arr[0] = arrange[0]\r\n\r\nfor i in range(1, n):\r\n prefix[i] = costs[i] + prefix[i - 1]\r\n \r\nfor i in range(1, n):\r\n prefix_arr[i] = arrange[i] + prefix_arr[i - 1]\r\n\r\n\r\nfor i in range(quest):\r\n ty, l, r = map(int, input().split())\r\n \r\n \r\n if ty == 1:\r\n print(prefix[r - 1] - prefix[l - 1] + costs[l - 1])\r\n \r\n else:\r\n print(prefix_arr[r - 1] - prefix_arr[l - 1] + arrange[l - 1])", "n = int(input())\norden = list(map(int,input().strip().split()))[:n]\npiedras = orden.copy()\norden.sort()\nacumulado = orden.copy()\nordenado = orden.copy()\nfor i in range(n):\n if (i==0):\n acumulado[i]=piedras[i]\n else:\n acumulado[i]=acumulado[i-1]+piedras[i]\n\nfor i in range(n):\n if (i==0):\n ordenado[i]=orden[i]\n else:\n ordenado[i]=ordenado[i-1]+orden[i]\n\nm = int(input())\nfor i in range(m):\n tlr = input()\n t=int(tlr.split()[0])\n l=int(tlr.split()[1])\n r=int(tlr.split()[2])\n if(t==1):\n if(l==1):\n print(acumulado[r-1])\n else:\n print(acumulado[r-1]-acumulado[l-2])\n else:\n if(l==1):\n print(ordenado[r-1])\n else:\n print(ordenado[r-1]-ordenado[l-2])\n \t \t \t \t \t \t \t \t", "def main():\n \n pre_v = []\n pre_v_ord = []\n \n pre_sum = 0\n pre_sum_ord = 0\n \n size = int(input())\n seq = list(map(int,input().split()))\n seq_ord = sorted(seq)\n \n \n for i in range (size):\n pre_sum += seq[i]\n pre_sum_ord += seq_ord[i]\n \n pre_v.append(pre_sum)\n pre_v_ord.append(pre_sum_ord)\n \n for _ in range(int(input())):\n line = list(map(int,input().split()))\n if line[0] == 2:\n if line[1] > 2:\n print(pre_v_ord[line[2] - 1] - pre_v_ord[line[1] - 2])\n elif line[1] == 2:\n print(pre_v_ord[line[2] - 1] - pre_v_ord[0]) \n else: \n print(pre_v_ord[line[2] - 1]) \n else: \n if line[1] > 2:\n print(pre_v[line[2] - 1] - pre_v[line[1] - 2])\n elif line[1] == 2: \n print(pre_v[line[2] - 1] - pre_v[0])\n else:\n print(pre_v[line[2] - 1]) \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", "from sys import stdin\r\nn = int(input())\r\nl = [int(x) for x in stdin.readline().split()]\r\nll = sorted(l)\r\npl = [0]*n\r\npl[0] = l[0]\r\nfor j in range(1,n):\r\n pl[j] = pl[j-1]+l[j]\r\npll = [0]*n\r\npll[0] = ll[0]\r\nfor k in range(1,n):\r\n pll[k] = pll[k-1]+ll[k]\r\nq = int(input())\r\nfor i in range(q):\r\n t,l,r = map(int,stdin.readline().split())\r\n if t==1:\r\n if l==1:\r\n print(pl[r-1])\r\n else:\r\n print(pl[r-1]-pl[l-2])\r\n elif t==2:\r\n if l==1:\r\n print(pll[r-1])\r\n else:\r\n print(pll[r-1]-pll[l-2])", "def getSum(arr, start, end):\r\n return arr[end] - arr[start-1]\r\n\r\nn = int(input())\r\nnums = [int(el) for el in input().split()]\r\nsorted_nums = sorted(nums)\r\n\r\nc = [0]*(len(nums)+1)\r\nc_sorted = [0]*(len(nums)+1)\r\nfor i in range(len(nums)):\r\n c[i+1] = nums[i] + c[i]\r\n c_sorted[i+1] = sorted_nums[i] + c_sorted[i]\r\n\r\nfor i in range(int(input())):\r\n type, left, right = input().split()\r\n if type == '1':\r\n print(getSum(c, int(left), int(right)))\r\n else:\r\n print(getSum(c_sorted, int(left), int(right)))\r\n", "n=int(input())\r\ns=list(map(int,input().split()))\r\na=s[:];a.sort();v=[0];u=[0];v0=0;u0=0\r\nfor i in range(n):\r\n v0+=s[i];u0+=a[i]\r\n v.append(v0);u.append(u0)\r\nfor i in range(int(input())):\r\n q=list(map(int,input().split()))\r\n if q[0]==1:\r\n print(v[q[2]]-v[q[1]-1])\r\n else:\r\n print(u[q[2]]-u[q[1]-1])", "a = int(input())\nb = [0] + list(map(int, input().split())) #b[a-1]\nc = int(input())\nb1 = sorted(b)\ng = []\nfor i in range(1,a+1):\n b[i] = b[i-1]+b[i]\n b1[i] = b1[i-1]+b1[i]\nfor _ in range(c):\n d,e,f = map(int, input().split())\n if d == 1:g.append(b[f]-b[e-1])\n else:g.append(b1[f]-b1[e-1])\nfor h in range(c):\n print(g[h])\n\n \t\t\t\t \t \t\t\t\t\t \t\t \t \t \t\t\t", "n = int(input())\r\ncosts = list(map(int,input().split()))\r\nm = int(input())\r\n\r\nsum_of_costs = [0]\r\nsorted_costs = sorted(costs)\r\nsorted_sum_of_costs = [0]\r\n\r\nsum=0\r\nfor i in range(n):\r\n sum = sum_of_costs[-1]+costs[i]\r\n sum_of_costs.append(sum)\r\n\r\nsum=0\r\nfor i in range(n):\r\n sum = sorted_sum_of_costs[-1]+sorted_costs[i]\r\n sorted_sum_of_costs.append(sum)\r\n\r\nfor i in range(m):\r\n type,l,r = list(map(int,input().split()))\r\n if type == 1:\r\n print(sum_of_costs[r-1]-sum_of_costs[l-1]+costs[r-1])\r\n else:\r\n print(sorted_sum_of_costs[r-1]-sorted_sum_of_costs[l-1]+sorted_costs[r-1])", "n=int(input())\r\nv=list(map(int,input().split()))\r\nv1=[v[0]]\r\nfor i in range(1,len(v)) :\r\n v1.append(v1[-1]+v[i])\r\nvs=[]\r\nfor i in v :\r\n vs.append(i)\r\nvs.sort()\r\nvs1=[vs[0]]\r\nfor i in range(1,len(vs)) :\r\n vs1.append(vs1[-1]+vs[i])\r\nm=int(input())\r\nfor i in range(m) :\r\n t,l,r=map(int,input().split())\r\n if t==1 :\r\n if l==1 :\r\n print(v1[r-1])\r\n else :\r\n print(v1[r-1]-v1[l-2])\r\n if t==2 :\r\n if l==1 :\r\n print(vs1[r-1])\r\n else :\r\n print(vs1[r-1]-vs1[l-2])", "class solve:\r\n def __init__(self):\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n m=int(input())\r\n if n==1:\r\n for i in range(m):\r\n typ,l,r=map(int,input().split())\r\n print(a[0])\r\n else:\r\n data=[a[0]]\r\n b=sorted(a)\r\n data2=[b[0]]\r\n for i in range(1,n):\r\n data.append(data[i-1]+a[i])\r\n data2.append(data2[i-1]+b[i])\r\n for i in range(m):\r\n typ,l,r=map(int,input().split())\r\n if l==1:\r\n if typ==1:\r\n print(data[r-1])\r\n else:\r\n print(data2[r-1])\r\n else:\r\n if typ==1:\r\n print(data[r-1]-data[l-2])\r\n else:\r\n print(data2[r-1]-data2[l-2])\r\n\r\nobj=solve()", "n = int(input())\n\nvsum = []\nusum = []\nstone_cost = list(map(int, input().split()))\ntotal = 0\nfor i in stone_cost:\n total += i\n vsum.append(total)\ntotal = 0\nfor i in sorted(stone_cost):\n total += i\n usum.append(total)\n\nm = int(input())\nfor i in range(m):\n question, l, r = map(int, input().split())\n if question == 1:\n if l == 1:\n print(vsum[r - 1])\n else:\n print(vsum[r - 1] - vsum[l - 2])\n else:\n if l == 1:\n print(usum[r - 1])\n else:\n print(usum[r - 1] - usum[l - 2])\n\n\t \t\t\t\t \t\t\t \t \t \t \t \t \t\t\t", "import math\nimport sys\nfrom itertools import accumulate\n\ndef rl():\n return sys.stdin.readline().strip()\n\n\ndef closest_power(x, k):\n return k**(math.ceil(math.log(x, k)))\n\n\nif __name__ == \"__main__\":\n n = int(rl())\n stones = list(map(int, rl().split()))\n s_stones = sorted(stones)\n pre_stones = list(accumulate(stones))\n pre_s_stones = list(accumulate(s_stones))\n\n for _ in range(int(rl())):\n t, s, e = map(int, rl().split())\n if t == 1:\n sn = 0 if s == 1 else pre_stones[s-2]\n en = pre_stones[e-1]\n print(en - sn)\n if t == 2:\n sn = 0 if s == 1 else pre_s_stones[s-2]\n\n en = pre_s_stones[e-1]\n print(en - sn)\n\n\n\n\n\n\n\n", "n = int(input())\r\n*lst, = map(int, input().split())\r\nu = sorted(lst)\r\nfor i in range(1, n):\r\n lst[i] += lst[i-1]\r\n u[i] += u[i-1]\r\nfor _ in range(int(input())):\r\n t, l, r = map(int, input().split())\r\n if t == 2:\r\n if l-1 != 0:\r\n print(u[r-1]-u[l-2])\r\n else:\r\n print(u[r-1])\r\n else:\r\n print(lst[r-1]-lst[l-2] if l-1 != 0 else lst[r-1])", "n = int(input())\r\n\r\narray = list(map(int, input().split()))\r\n\r\nm = int(input())\r\na2 = sorted(array)\r\n\r\nfor one in range(1, len(array)):\r\n array[one] += array[one - 1]\r\n\r\n\r\nfor two in range(1, len(array)):\r\n a2[two] += a2[two - 1]\r\n\r\nfor x in range(m):\r\n\r\n discounts = list(map(int, input().split()))\r\n\r\n if discounts[0] == 1:\r\n if discounts[1] == 1:\r\n print(array[discounts[2] - 1])\r\n else:\r\n print(array[discounts[2] - 1] - array[discounts[1] - 2])\r\n \r\n else:\r\n if discounts[1] == 1:\r\n print(a2[discounts[2] - 1])\r\n \r\n else:\r\n print(a2[discounts[2] - 1] - a2[discounts[1] - 2])\r\n\r\n \r\n", "\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\nm=int(input())\r\nbrr=arr\r\nbrr=sorted(brr)\r\nfor i in range(1,n):\r\n brr[i]=brr[i]+brr[i-1]\r\nbrr=[0]+brr\r\nfor i in range(1,n):\r\n arr[i]=arr[i]+arr[i-1]\r\narr=[0]+arr\r\n\r\nfor p in range(m):\r\n t=list(map(int,input().split()))\r\n if t[0]==1:\r\n print(arr[t[2]]-arr[t[1]-1])\r\n else:\r\n print(brr[t[2]]-brr[t[1]-1])\r\n", "# Fenwick Tree (Binary Indexed Tree) implementation\r\ndef build_fenwick_tree(values):\r\n fenwick_tree = [0] * (len(values) + 1)\r\n for i in range(len(values)):\r\n update_fenwick_tree(fenwick_tree, i, values[i])\r\n return fenwick_tree\r\n\r\ndef update_fenwick_tree(fenwick_tree, index, value):\r\n index += 1\r\n while index < len(fenwick_tree):\r\n fenwick_tree[index] += value\r\n index += index & -index\r\n\r\ndef query_fenwick_tree(fenwick_tree, index):\r\n index += 1\r\n result = 0\r\n while index > 0:\r\n result += fenwick_tree[index]\r\n index -= index & -index\r\n return result\r\n\r\n# Main function to solve the problem\r\nn = int(input())\r\nvalues = list(map(int, input().split()))\r\nsorted_values = sorted(values) # Sorted version of the stones\r\n\r\nfenwick_tree = build_fenwick_tree(values)\r\nsorted_fenwick_tree = build_fenwick_tree(sorted_values)\r\n\r\nanswer = []\r\n\r\nm = int(input())\r\nfor _ in range(m):\r\n query_type, l, r = map(int, input().split())\r\n if query_type == 1:\r\n answer.append(query_fenwick_tree(fenwick_tree, r - 1) - query_fenwick_tree(fenwick_tree, l - 2))\r\n else:\r\n answer.append(query_fenwick_tree(sorted_fenwick_tree, r - 1) - query_fenwick_tree(sorted_fenwick_tree, l - 2))\r\n\r\nfor i in answer:\r\n print(i)", "n = int(input())\r\na = list(map(int,input().split()))\r\nb = sorted(a)\r\nc,d = [0],[0]\r\nfor i in range(n):\r\n c.append(c[-1] + a[i])\r\n d.append(d[-1] + b[i])\r\nm = int(input())\r\nfor i in range(m):\r\n t,l,r = list(map(int,input().split()))\r\n if t == 1:\r\n print(c[r] - c[l-1])\r\n else:\r\n print(d[r] - d[l-1])", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Jul 28 17:34:49 2022\r\n\r\n@author: Conor\r\n\r\nCFSheet B Problem 17 - CF433-DIV2B\r\n\"\"\"\r\n\r\nfrom sys import stdin\r\n\r\nn = int(input())\r\nvar = [int(x) for x in stdin.readline().split()]\r\nuar = sorted(var)\r\n\r\nvPref = [0]*(n+1)\r\nuPref = [0]*(n+1)\r\nfor i in range(1,n+1):\r\n vPref[i] = vPref[i-1] + var[i-1]\r\n uPref[i] = uPref[i-1] + uar[i-1]\r\n\r\nm = int(input())\r\nfor i in range(m):\r\n typ, l, r = stdin.readline().split()\r\n if int(typ) == 1:\r\n print(vPref[int(r)] - vPref[int(l)-1])\r\n else:\r\n print(uPref[int(r)] - uPref[int(l)-1])", "n = int(input())\r\narr = list(map(int, input().split()))\r\na = [0 for i in range(n+1)]\r\nb = [0 for i in range(n+1)]\r\nfor i in range(n):\r\n a[i+1] = a[i] + arr[i]\r\narr.sort()\r\nfor i in range(n):\r\n b[i+1] = b[i] + arr[i]\r\nt = int(input())\r\nfor i in range(t):\r\n typ, l ,r = map(int, input().split())\r\n if typ == 1:\r\n print(a[r] - a[l-1])\r\n else:\r\n print(b[r] - b[l-1])", "n = int(input())\r\ncena = input().split()\r\ncena = list(map(int, cena))\r\nm = int(input())\r\ncenap = [0]\r\ncenasp = [0]\r\nmo = []\r\nfor i in range(n): cenap.append(cenap[-1] + cena[i])\r\ncena.sort()\r\nfor i in range(n): cenasp.append(cenasp[-1] + cena[i]) \r\nfor i in range(m):\r\n tip, l, r = map(int, input().split())\r\n if tip == 1: mo.append(cenap[r] - cenap[l - 1])\r\n if tip == 2: mo.append(cenasp[r] - cenasp[l - 1])\r\nfor i in mo: print(i)\r\n", "n = int(input())\r\nlista = list(map(int, input().split()))\r\nlista1 = sorted(lista)\r\nm = int(input())\r\nlista_sum = []\r\nposortowana = []\r\nliczba = 0\r\nliczba1 = 0\r\nfor _ in range(n):\r\n liczba+= lista[_]\r\n liczba1+=lista1[_]\r\n lista_sum.append(liczba)\r\n posortowana.append(liczba1)\r\n\r\nfor _ in range(m):\r\n wynik = 0\r\n rodzaj, l, r = list(map(int, input().split()))\r\n if rodzaj == 1:\r\n if l > 1:\r\n wynik = lista_sum[r-1] - lista_sum[l-2]\r\n else:\r\n wynik = lista_sum[r-1]\r\n else:\r\n if l > 1:\r\n wynik = posortowana[r-1] - posortowana[l-2]\r\n else:\r\n wynik = posortowana[r-1]\r\n print(wynik)\r\n", "def create_pref(arr):\n pref = []\n for i in range(len(arr)):\n if i == 0:\n pref.append(arr[0])\n else:\n pref.append(pref[i-1] + arr[i])\n return pref\n\nlength = int(input())\narr_1 = list(map(int, input().split()))\npref_1 = create_pref(arr_1)\npref_2 = create_pref(sorted(arr_1))\n\nm = int(input())\nfor _ in range(m):\n type, l, r = map(int, input().split())\n if type == 1:\n if l == 1:\n print(pref_1[r-1])\n else:\n print(pref_1[r-1] - pref_1[l-2])\n elif type == 2:\n if l == 1:\n print(pref_2[r-1])\n else:\n print(pref_2[r-1] - pref_2[l-2])\n\n \t\t \t\t \t\t \t\t \t\t \t \t \t \t", "n = int(input())\r\nstones = [int(i) for i in input().split()]\r\nm = int(input())\r\nprfxSum = [stones[0]]\r\nfor i in range(1, n) :\r\n prfxSum.append(prfxSum[i - 1] + stones[i])\r\nstones.sort()\r\nsortedPrefixSum = [stones[0]]\r\n\r\nfor i in range(1, n) :\r\n sortedPrefixSum.append(sortedPrefixSum[i - 1] + stones[i])\r\nfor _ in range(m) :\r\n typ, l, r = map(int, input().split())\r\n if typ == 1:\r\n print(prfxSum[r - 1] - (0 if l == 1 else prfxSum[l - 2]))\r\n else :\r\n print(sortedPrefixSum[r - 1] - (0 if l == 1 else sortedPrefixSum[l - 2]))\r\n", "from math import ceil, log2\n\n\nclass segment_tree:\n def __init__(self, array, merge=lambda x,y:x+y, basef=lambda x:x, basev = 0):\n self.merge = merge\n self.basef = basef\n self.basev = basev\n self.n = len(array)\n self.array = array\n self.tree = [0] * ( 2**ceil(log2(len(array))+1) - 1 )\n self.build(array)\n \n def __str__(self):\n return ' '.join([str(x) for x in self.tree])\n\n def _build_util(self, l, r, i, a):\n if(l==r):\n self.tree[i] = self.basef(a[l])\n return self.tree[i]\n mid = (l+r)//2\n self.tree[i] = self.merge(\n self._build_util(l,mid, 2*i+1, a),\n self._build_util(mid+1, r, 2*i+2, a)\n )\n return self.tree[i]\n\n def build(self, a):\n self._build_util(0, len(a)-1, 0, a)\n\n def _query_util(self, i, ln, rn, l, r):\n if ln>=l and rn<=r:\n return self.tree[i]\n if ln>r or rn<l:\n return self.basev\n return self.merge(\n self._query_util( 2*i+1, ln, (ln+rn)//2, l, r ),\n self._query_util( 2*i+2, (ln+rn)//2+1, rn, l, r )\n )\n\n def query(self, l, r):\n return self._query_util( 0, 0, self.n-1, l, r )\n\n def _update_util(self, i, ln, rn, x, v):\n if x>=ln and x<=rn:\n if ln != rn:\n self._update_util( 2*i+1, ln, (ln+rn)//2, x, v )\n self._update_util( 2*i+2, (ln+rn)//2 + 1, rn, x, v )\n self.tree[i] = self.merge(self.tree[2*i+1], self.tree[2*i+2])\n else:\n self.tree[i] = self.basef(v)\n\n def update(self, x, v):\n self._update_util( 0, 0, self.n-1, x, v ) \n self.array[x] =v \n\n\ndef main():\n n = int(input())\n elems = list(map(int, input().split(\" \")))\n\n one = segment_tree(elems)\n two = segment_tree(list(sorted(elems)))\n\n q = int(input())\n for _ in range(q):\n tp, l, r = list(map(int, input().split(\" \")))\n if tp == 1:\n print(one.query(l-1, r-1))\n else:\n print(two.query(l-1, r-1))\n\n\n\n \nif __name__ == \"__main__\":\n main()\n", "import sys\r\nimport math\r\nfrom collections import Counter\r\ninput = sys.stdin.readline\r\nN = 1000000007\r\n#use input().strip() \r\n\r\n\r\nn = int(input().strip())\r\nv = [int(j) for j in input().strip().split()]\r\nq = int(input().strip())\r\nu = sorted(v)\r\n#precomputation\r\nv1 = [0] * n\r\nu1 = [0] * n\r\nv1[0] = v[0]\r\nu1[0] = u[0]\r\nfor i in range(1, n):\r\n v1[i] = v1[i - 1] + v[i]\r\n u1[i] = u1[i - 1] + u[i]\r\nv1 , u1 = [0] + v1, [0] + u1\r\nfor i in range(q):\r\n type, l, r = [int(j) for j in input().strip().split()]\r\n if type == 1:\r\n print(v1[r] - v1[l - 1])\r\n else:\r\n print(u1[r] - u1[l - 1])", "input()\r\ns = input()\r\ns1 = list(map(int, s.split()))\r\ns2 = sorted(s1)\r\nfor i in range(1, len(s1)):\r\n s1[i] += s1[i - 1]\r\n s2[i] += s2[i - 1]\r\ns1 = [0] + s1\r\ns2 = [0] + s2\r\nfor _ in range(int(input())):\r\n case, left, right = map(int, input().split())\r\n print(s1[right] - s1[left - 1] if case == 1 else s2[right] -\r\n s2[left - 1])\r\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\nm = int(input())\r\narr1 = sorted(arr)\r\nN_arr = [0]*n\r\nfor i in range(n):\r\n if i == 0:\r\n N_arr[i] = arr[i]\r\n else:\r\n N_arr[i] = N_arr[i-1]+arr[i]\r\nN_arr1 = [0]*n\r\nfor i in range(n):\r\n if i == 0:\r\n N_arr1[i] = arr1[i]\r\n else:\r\n N_arr1[i] = N_arr1[i-1]+arr1[i]\r\nfor j in range(m):\r\n k,l,r = map(int,input().split())\r\n if k == 1:\r\n ans = N_arr[r-1]-N_arr[l-1] + arr[l-1]\r\n else:\r\n ans = N_arr1[r-1]-N_arr1[l-1] + arr1[l-1]\r\n print(ans)", "n = int(input())\r\nar = input()\r\narr = [int(i) for i in ar.split()]\r\nm = int(input())\r\n\r\nui = sorted(arr)\r\n\r\nsum_arr = [0] * (n + 1)\r\nsum_ui = [0] * (n + 1)\r\n\r\nfor i in range(1, n + 1):\r\n sum_arr[i] = sum_arr[i - 1] + arr[i - 1]\r\n sum_ui[i] = sum_ui[i - 1] + ui[i - 1]\r\n\r\ndef calcul(type, l, r):\r\n if type == 1:\r\n return sum_arr[r] - sum_arr[l - 1]\r\n else:\r\n return sum_ui[r] - sum_ui[l - 1]\r\n\r\nfor _ in range(m):\r\n type, l, r = map(int, input().split())\r\n sum_stone = calcul(type, l, r)\r\n print(sum_stone)# 1698692534.2524364", "import sys\r\ndef input(): return sys.stdin.readline().strip()\r\ndef getints(): return map(int,sys.stdin.readline().strip().split())\r\n\r\nn = int(input())\r\nv = list(getints())\r\nu = sorted(v)\r\n\r\nfor i in range(1,n):\r\n v[i] += v[i-1]\r\n u[i] += u[i-1]\r\nv.append(0)\r\nu.append(0)\r\n\r\nfor _ in range(int(input())):\r\n t,l,r = getints()\r\n print(v[r-1]-v[l-2] if t == 1 else u[r-1]-u[l-2])", "import itertools as itt\r\n\r\nnumElements = int(input())\r\ninputArray = [0] + [int(x) for x in input().split()]\r\ninputSums = list(itt.accumulate(inputArray))\r\ninArr = list(inputArray)\r\ninArr.sort()\r\ninSums = list(itt.accumulate(inArr))\r\nnumQuestions = int(input())\r\n\r\n\r\nfor i in range(numQuestions):\r\n info = [int(x) for x in input().split()]\r\n\r\n if info[0] == 1:\r\n print(inputSums[info[2]] - inputSums[info[1]-1])\r\n\r\n else:\r\n print(inSums[info[2]] - inSums[info[1]-1])\r\n", "n = int(input())\r\narray = list(map(int, input().split()))\r\nprefix_sum = [0] * (n + 1)\r\nsorted_prefix_sum = [0] * (n + 1)\r\n\r\nfor i in range(1, n + 1):\r\n prefix_sum[i] = prefix_sum[i - 1] + array[i - 1]\r\n\r\narray.sort()\r\n\r\nfor i in range(1, n + 1):\r\n sorted_prefix_sum[i] = sorted_prefix_sum[i - 1] + array[i - 1]\r\n\r\nm = int(input())\r\n\r\nfor i in range(m):\r\n query_type, l, r = map(int, input().split())\r\n if query_type == 1:\r\n print(prefix_sum[r] - prefix_sum[l - 1])\r\n else:\r\n print(sorted_prefix_sum[r] - sorted_prefix_sum[l - 1])\r\n", "n = int(input())\nv0 = list(map(int, input().split()))\nu0 = sorted(v0)\n\nv = [0 for i in range(n+1)]\nu = [0 for i in range(n+1)]\n\nfor i in range(1, n+1):\n v[i] = v0[i-1] + v[i-1]\n u[i] = u0[i-1] + u[i-1]\n\nm = int(input())\nfor i in range(m):\n tp, l, r = map(int, input().split())\n\n if tp == 1:\n print(v[r]-v[l-1])\n\n else:\n print(u[r]-u[l-1])\n", "n=int(input())\r\nb=list(map(int,input().split()))\r\nv=b.copy()\r\nv.sort()\r\nfor j in range(1,n):\r\n v[j]+=v[j-1]\r\n b[j]+=b[j-1]\r\nfor i in range(int(input())):\r\n typ,l,r=map(int,input().split())\r\n if typ==2:\r\n if l-2 <0:\r\n print(v[r-1]-0)\r\n else:\r\n print(v[r-1]-v[l-2])\r\n elif typ==1:\r\n if l-2 <0:\r\n print(b[r-1]-0)\r\n else:\r\n print(b[r-1]-b[l-2])", "n=int(input());l=list(map(int,input().split()));t1=[0,];s=0\r\nfor i in l:\r\n\ts+=i;t1.append(s)\r\nl.sort();s=0;t2=[0,]\r\nfor i in l:\r\n\ts+=i;t2.append(s)\r\nfor i in range(int(input())):\r\n\ta,l,r=map(int,input().split())\r\n\tif a==1:print(t1[r]-t1[l-1])\r\n\telse:print(t2[r]-t2[l-1])", "def c(a):\r\n n = len(a)\r\n r = [0] * (n + 1)\r\n p = 0\r\n for i, v in enumerate(a):\r\n r[i + 1] = a[i] + p\r\n p = r[i + 1]\r\n return r\r\n\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nca = c(a)\r\ncb = c(sorted(a))\r\nm = int(input())\r\nfor _ in range(m):\r\n t, l, r = map(int, input().split())\r\n cc = ca if t == 1 else cb\r\n print(cc[r] - cc[l - 1])\r\n", "n = int(input())\r\ndata = [int(i)for i in input().split()]\r\nsorted_data=data.copy()\r\nsorted_data.sort()\r\n\r\npreprocess_data = [data[0]]\r\npreprocess_sorted_data = [sorted_data[0]]\r\n\r\nfor i in range(1,n):\r\n preprocess_data.append(preprocess_data[i-1]+data[i])\r\n preprocess_sorted_data.append(preprocess_sorted_data[i-1]+sorted_data[i])\r\n\r\nm = int(input())\r\nanswers=[]\r\n\r\nfor _ in range(m):\r\n question_type, l, r = [int(i) for i in input().split()]\r\n l -= 1\r\n r -= 1\r\n take = 1\r\n if l > 0 :\r\n l -= 1\r\n \r\n else :\r\n take = 0\r\n\r\n if question_type == 1 :\r\n answers.append(preprocess_data[r]-preprocess_data[l]*take)\r\n else :\r\n answers.append(preprocess_sorted_data[r]-preprocess_sorted_data[l]*take)\r\n \r\nfor i in answers:\r\n print(i)\r\n", "arr_len = int(input())\r\narr = list(map(int, input().split()))\r\narr_prefix_sum = [arr[0]]\r\nfor i in range(1, len(arr)):\r\n arr_prefix_sum.append(arr_prefix_sum[i-1] + arr[i])\r\n\r\narr_copy = arr.copy()\r\narr_copy.sort()\r\narr_copy_prefix_sum = [arr_copy[0]]\r\nfor i in range(1, len(arr_copy)):\r\n arr_copy_prefix_sum.append(arr_copy_prefix_sum[i - 1] + arr_copy[i])\r\n\r\nnumber_of_questions = int(input())\r\n\r\nwhile number_of_questions:\r\n vals = list(map(int, input().split()))\r\n typ, l, r = vals[0], vals[1], vals[2]\r\n if typ != 1:\r\n if l-2 < 0: print(arr_copy_prefix_sum[r-1])\r\n else: print(arr_copy_prefix_sum[r-1] - arr_copy_prefix_sum[l-2])\r\n else:\r\n if l-2 < 0: print(arr_prefix_sum[r-1])\r\n else: print(arr_prefix_sum[r-1] - arr_prefix_sum[l-2])\r\n number_of_questions -= 1\r\n", "total=int(input())\ncost=list(map(int, input().split(\" \")))\nq=int(input())\nsort=sorted(cost)\ncost_l=[0]*(total+1)\nsort_l=[0]*(total+1)\nfor x in range(1,total+1):\n cost_l[x]=cost[x-1]+cost_l[x-1]\n sort_l[x]=sort[x-1]+sort_l[x-1]\nout=[]\nfor x in range(q):\n query=list(map(int, input().split(\" \")))\n if query[0]==1:\n out.append(cost_l[query[2]]-cost_l[query[1]-1])\n else:\n out.append(sort_l[query[2]]- sort_l[query[1]-1])\nfor x in out:\n print(x)\n\t\t \t \t \t\t \t \t\t \t\t \t\t \t", "# Rishabh Rao (https://github.com/rishabhrao)\r\n\r\nimport sys\r\nMOD = 1000000007\r\ndef inp(): return sys.stdin.readline().strip()\r\ndef ii(): return int(inp())\r\ndef iis(): return [int(i) for i in inp().split()]\r\n\r\n\r\nn = ii()\r\nv = iis()\r\nu = sorted(v)\r\n\r\npreV = [0]\r\npreU = [0]\r\nfor i in range(n):\r\n preV.append(preV[-1] + v[i])\r\n preU.append(preU[-1] + u[i])\r\n\r\nm = ii()\r\nfor _ in range(m):\r\n t, l, r = iis()\r\n if t == 1:\r\n print(preV[r] - preV[l - 1])\r\n else:\r\n print(preU[r] - preU[l - 1])\r\n", "\nn = int(input())\na = list(map(int,input().split()))\nb = sorted(a)\n\nv = [0]\nsum = 0\nfor i in range(len(a)):\n sum += a[i]\n v.append(sum)\n\nu = [0]\nsum2 = 0\nfor i in range(len(b)):\n sum2 += b[i]\n u.append(sum2)\n\nq = int(input())\n\nfor i in range(q):\n t, l, r = map(int,input().split())\n\n if t == 1:\n print(v[r]-v[l-1])\n\n else:\n print(u[r]-u[l-1])\n\t \t \t \t \t\t\t\t\t \t\t \t \t \t\t\t \t", "def presum(arr):\n # Pre-sum array\n out = []\n sum = 0\n for num in arr:\n sum += num\n out.append(sum)\n return out\n\n\ndef main():\n n = int(input())\n v = [int(x) for x in input().split()]\n # import pdb; pdb.set_trace()\n u = presum(sorted(v))\n v = presum(v)\n m = int(input())\n outs = []\n for i in range(m):\n type, l, r = [int(x) for x in input().split()]\n if type == 1:\n # outs.append(v[r-1] - v[l-2])\n if l == 1:\n outs.append(v[r-1])\n else:\n outs.append(v[r-1] - v[l-2])\n else:\n # outs.append(u[r-1] - u[l-2])\n if l == 1:\n outs.append(u[r-1])\n else:\n outs.append(u[r-1] - u[l-2])\n\n for out in outs: print(out)\n\n\nif __name__ == '__main__':\n main()\n\n \t\t\t\t \t \t\t \t \t\t\t\t\t \t\t \t\t \t\t", "n = int(input())\n\nstones = [int(items) for items in input().split()]\nstones_sums = [0]\nfor i in range(n):\n\tstones_sums.append(stones_sums[-1] + stones[i])\n\nstones_sorted = [i for i in stones]\nstones_sorted.sort()\nstones_sorted_sums = [0]\nfor i in range(n):\n\tstones_sorted_sums.append(stones_sorted_sums[-1] + stones_sorted[i])\n\ninstructions = int(input())\n\nfor i in range(instructions):\n\tmode, l, r = [int(items) for items in input().split()]\n\n\tif mode == 1:\n\t\tprint(stones_sums[r] - stones_sums[l - 1])\n\n\n\telif mode == 2:\n\t\tprint(stones_sorted_sums[r] - stones_sorted_sums[l - 1])\n \t\t \t\t\t\t \t \t \t\t\t \t\t \t\t", "n=int(input())\r\n\r\ncosts=list(map(int,input().split()))\r\ncum=[costs[0]]\r\nfor i in range(1,n):\r\n cum.append(costs[i]+cum[i-1])\r\n\r\n \r\ncosts.sort()\r\ncumsort=[costs[0]]\r\nfor i in range(1,n):\r\n cumsort.append(costs[i]+cumsort[i-1])\r\n \r\n \r\nm=int(input())\r\narr=[]\r\nfor i in range(m):\r\n arr.append(list(map(int,input().split())))\r\n\r\n\r\nfor i in arr:\r\n a=i[0]\r\n b=i[1]-1\r\n c=i[2]-1\r\n if a==1:\r\n if b==0 : print(cum[c])\r\n else: print(cum[c]-cum[b-1])\r\n else:\r\n if b==0:print(cumsort[c])\r\n else:print(cumsort[c]-cumsort[b-1])\r\n \r\n\r\n ", "n = int(input())\nl = list(map(int,input().split()))\nsortedL = sorted(l)\n\nlistSum = [0]\nsortedListSum = [0]\n\ns1 = 0\ns2 = 0\n\nfor i in range(n):\n s1 += l[i]\n s2 += sortedL[i]\n listSum.append(s1)\n sortedListSum.append(s2) \n\t\nfor j in range(int(input())):\n\ttyp, l, r = map(int, input().split())\n\t\n\tif(typ == 1):\n\t\tprint(listSum[r] - listSum[l-1])\n\telse:\n\t\tprint(sortedListSum[r] - sortedListSum[l-1])\n\n \t\t\t\t \t \t \t\t \t \t", "\r\n#from math import ceil\r\n\r\nimport io, os, sys\r\ninput = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\nprint = lambda x: sys.stdout.write(str(x) + \"\\n\")\r\n \r\nII = lambda: int(input())\r\nMII = lambda: map(int, input().split())\r\nLMII = lambda: list(MII())\r\n#SLMII = lambda: sorted(LMII())\r\n\r\nn = II()\r\nv1 = [0] + LMII()\r\nv2 = sorted(v1)\r\nv = (None, v1,v2)\r\nfor t in [1,2]:\r\n for i in range(n+1): # prefix sums\r\n v[t][i] += v[t][i-1]\r\n \r\nfor _ in range(II()):\r\n t, l, r = MII()\r\n print(v[t][r] - v[t][l-1])\r\n \r\n ", "import copy\r\nn = int(input())\r\nstones = list(map(int,input().split()))\r\nstones_new = copy.copy(stones)\r\nstones_new.sort()\r\ndp1 = [0]*(n+1) #第一个数一直是0，保护\r\ndp2 = [0]*(n+1) #第一个数一直是0，保护\r\nfor i in range(1,n+1):\r\n dp1[i] = dp1[i-1] + stones[i-1]\r\n dp2[i] = dp2[i-1] + stones_new[i-1]\r\nm = int(input())\r\nfor q in range(m):\r\n t,l,r = map(int,input().split())\r\n if t == 1:\r\n print(dp1[r]-dp1[l-1])\r\n elif t == 2:\r\n print(dp2[r]-dp2[l-1])", "n = int(input())\r\nv = list(map(int, input().split()))\r\nv.insert(0, 0)\r\nv2 = [0]\r\nfor i in range(1, n + 1):\r\n v2.append(v[i])\r\n v[i] = v[i - 1] + v[i]\r\nv2.sort()\r\nfor i in range(1, n + 1):\r\n v2[i] = v2[i - 1] + v2[i]\r\nm = int(input())\r\nfor _ in range(m):\r\n t, l, r = list(map(int, input().split()))\r\n if t == 1:\r\n print(v[r] - v[l - 1])\r\n else:\r\n print(v2[r] - v2[l - 1])", "from itertools import accumulate as am\r\nn=int(input())\r\nl=[*map(int,input().split())]\r\ns=[[0]+[*am(l)]]; l.sort()\r\ns+=[[0]+[*am(l)]]\r\nfor j in range(int(input())):\r\n x,l,r=map(int,input().split())\r\n print(s[x-1][r]-s[x-1][l-1])\r\n", "# 6\n# 6 4 2 7 2 7\n# 3\n# 2 3 6\n# 1 3 4\n# 1 1 6\n\n# [6, 4, 2, 7, 2, 7]\n\n# 2 3 6\n# [2, 2, 4, 6, 7, 7]\n# 4 + 6 + 7 + 7 = 24\n\n# 1 3 4\n# [6, 4, 2, 7, 2, 7]\n# 2 + 7 = 9\n\n# 1 1 6\n# [6, 4, 2, 7, 2, 7]\n# 6 + 4 + 2 + 7 + 2 + 7 = 28\n\n# n = 6\nn = int(input())\n\n# v1 = 6 4 2 7 2 7\nv1 = list(map(int, input().split(\" \")))\n\n# v2 = 2 2 4 6 7 7\nv2 = v1.copy()\nv2.sort()\n\n# ts1 = 0, 6, 10, 12, 19, 21, 28\nts1 = [0]\n# ts2 = 0, 2, 4, 8, 14, 21, 28\nts2 = [0]\n\nfor i in range(n):\n ts1 += [ts1[i]+v1[i]]\n ts2 += [ts2[i]+v2[i]]\n\n# print(ts1)\n# print(ts2)\n\n\n# m = 3\nm = int(input())\n\nans = None\n\nfor i in range(m):\n # t = 2, l = 3, r = 6\n [t, l, r] = map(int, input().split(\" \"))\n\n if t == 1:\n ans = ts1[r] - ts1[l-1]\n else:\n ans = ts2[r] - ts2[l-1]\n\n print(ans)\n", "quant_pedras = int(input())\nseq = [int(n) for n in input().split()]\nseq_ordenada = sorted(seq)\n\nsomas_seq = [0]\nsomas_seq_ordenada = [0]\nfor i in range(len(seq)):\n somas_seq.append(seq[i] + somas_seq[-1])\n somas_seq_ordenada.append(seq_ordenada[i] + somas_seq_ordenada[-1])\n\nquant_perguntas = int(input())\nfor c in range(quant_perguntas):\n tipo, l, r = [int(n) for n in input().split()]\n if tipo == 1:\n print(somas_seq[r] - somas_seq[l - 1])\n elif tipo == 2:\n print(somas_seq_ordenada[r] - somas_seq_ordenada[l - 1])\n\n\t \t \t\t\t\t\t \t\t\t \t \t\t \t \t\t\t\t\t", "a = int(input())\nb = [0] + list(map(int, input().split())) #b[a-1]\nb1 = sorted(b)\nfor i in range(1,a+1):\n b[i] = b[i-1]+b[i]\n b1[i] = b1[i-1]+b1[i]\nfor c in range(int(input())):\n d,e,f = map(int, input().split())\n if d == 1:print(b[f]-b[e-1])\n else:print(b1[f]-b1[e-1])\n\n\t\t\t \t \t\t \t \t\t \t\t\t \t\t\t \t", "n = int(input())\ncosts = list(map(int, input().split(' ')))\ncrescent = costs.copy()\ncrescent.sort()\n\nfor i in range(1,n,1):\n costs[i] += costs[i-1];\n crescent[i] += crescent[i - 1];\n\nm = int(input())\nfor idx in range(m):\n sum = 0\n tlr = list(map(int, input().split(' ')))\n if tlr[0] == 1:\n if tlr[1] == 1:\n sum = costs[tlr[2]-1]\n else:\n sum = costs[tlr[2]-1] - costs[tlr[1]-2]\n else:\n if tlr[1] == 1:\n sum = crescent[tlr[2] - 1]\n else:\n sum = crescent[tlr[2] - 1] - crescent[tlr[1] - 2]\n print(sum)\n \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\nsarr = sorted(arr)\r\nprefixarr = []\r\nsum = 0\r\nfor i in arr:\r\n sum += i\r\n prefixarr.append(sum)\r\nprefixsarr = []\r\nsum = 0\r\nfor i in sarr:\r\n sum += i\r\n prefixsarr.append(sum)\r\n\r\nfor i in range(int(input())):\r\n t, l, r = map(int, input().split())\r\n if t == 1:\r\n if l == 1:\r\n print(prefixarr[r-1])\r\n else:\r\n print(prefixarr[r-1] - prefixarr[l-2])\r\n else:\r\n if l == 1:\r\n print(prefixsarr[r - 1])\r\n else:\r\n print(prefixsarr[r-1] - prefixsarr[l-2])\r\n", "input()\r\nlst = []\r\nvn = list(map(int,input().split()))\r\nvs = sorted(vn)\r\nvs2 = [0]; vn2 = [0]\r\n\r\nfor i in range(len(vn)):\r\n vn2.append(vn2[i] + vn[i])\r\n\r\nfor i in range(len(vs)):\r\n vs2.append(vs2[i] + vs[i])\r\n\r\nfor i in range(int(input())):\r\n a,b,c = map(int,(input().split()))\r\n if a == 1: \r\n lst.append(vn2[c] - vn2[b-1])\r\n else:\r\n lst.append(vs2[c] - vs2[b-1])\r\n\r\nfor i in lst: print(i)", "# cook your dish here\r\nn = int(input())\r\narr = [int(x) for x in input().split()]\r\nm = int(input())\r\na = [0] * n\r\nb = [0] * n\r\na[0] = arr[0]\r\nfor i in range(1,n):\r\n a[i] = a[i - 1] + arr[i]\r\n\r\narr.sort()\r\nb[0] = arr[0]\r\nfor i in range(1,n):\r\n b[i] = b[i - 1] + arr[i]\r\n\r\nfor i in range(m):\r\n o,l,h = map(int,input().split())\r\n l -= 1\r\n h -= 1\r\n if o == 1:\r\n print(a[h] - (a[l - 1] if l > 0 else 0))\r\n else:\r\n print(b[h] - (b[l - 1] if l > 0 else 0))", "import sys;input=sys.stdin.readline;R=lambda:list(map(int,input().split()));I=lambda:int(input());II=lambda:input();P=lambda x:print(x);PP=lambda x:print(x,end=' ');\r\nn=I()\r\na=R()\r\nb=[0]\r\nc=[0]\r\nfor i in range(len(a)):\r\n b.append(b[i]+a[i])\r\na.sort()\r\nfor i in range(len(a)):\r\n c.append(c[i]+a[i])\r\nfor _ in range(I()):\r\n q,l,r=R()\r\n if q==1:\r\n print(b[r]-b[l-1])\r\n else:\r\n print(c[r]-c[l-1])", "def calc_sum(pref,a, l, r):\r\n return pref[r] - pref[l] + a[l]\r\n\r\ndef main():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n b = a.copy()\r\n b.sort()\r\n\r\n pref1, pref2 = [a[0]], [b[0]]\r\n for i in range(1, n):\r\n pref1.append(pref1[-1] + a[i])\r\n pref2.append(pref2[-1] + b[i])\r\n m = int(input())\r\n for i in range(m):\r\n cmd, l, r = list(map(int, input().split()))\r\n if cmd == 1:\r\n print(calc_sum(pref1, a, l-1, r-1))\r\n else:\r\n print(calc_sum(pref2, b, l-1, r-1))\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n=int(input())\r\nv=[0]+[*map(int,input().split())]\r\nu=sorted(v)\r\nfor i in range(1,n+1):\r\n v[i]+=v[i-1]\r\n u[i]+=u[i-1]\r\nfor i in range(int(input())):\r\n a,l,r=map(int,input().split())\r\n if a==1:print(v[r]-v[l-1])\r\n else:print(u[r]-u[l-1])\r\n", "\r\n\r\nn = int(input())\r\nl= list(map(int, input().split()))\r\n\r\npref = [0 for i in range(n)]\r\ns = 0\r\nfor i in range(n):\r\n s += l[i]\r\n pref[i] = s\r\n\r\nsPref = [0 for i in range(n)]\r\ns = 0\r\nl.sort()\r\nfor i in range(n):\r\n s += l[i]\r\n sPref[i] = s\r\n\r\nfor i in range(int(input())):\r\n k,a,b = list(map(int, input().split()))\r\n a -= 1\r\n b -= 1\r\n if k == 1:\r\n if a == 0:\r\n print(pref[b])\r\n else:\r\n print(pref[b]-pref[a-1])\r\n else:\r\n if a == 0:\r\n print(sPref[b])\r\n else:\r\n print(sPref[b]-sPref[a-1])\r\n\r\n", "import math\n\nn = int(input())\n\npedras = input()\npedras = pedras.split()\nnovas_pedras = []\n\nfor i in range(len(pedras)):\n pedras[i] = int(pedras[i])\n novas_pedras.append(pedras[i])\n\nnovas_pedras.sort()\n\nsomacumulada = [0]*len(pedras)\nsomacumulada[0] = pedras[0]\n\nsomasortada = [0]*len(pedras)\nsomasortada[0] = novas_pedras[0]\n\nfor i in range(1, len(pedras), 1):\n somacumulada[i] = pedras[i] + somacumulada[i - 1]\n somasortada[i] = novas_pedras[i] + somasortada[i - 1]\n\nm = int(input())\n\nfor i in range(m):\n x = input()\n x = x.split()\n\n type = int(x[0])\n l = int(x[1])\n r = int(x[2])\n\n if type == 1:\n if l == 1:\n print(somacumulada[r - 1])\n \n else:\n print(somacumulada[r - 1] - somacumulada[l - 2])\n\n elif type == 2:\n if l == 1:\n print(somasortada[r - 1])\n \n else:\n print(somasortada[r - 1] - somasortada[l - 2])\n\n\n \t\t\t\t \t \t \t \t \t \t\t \t\t \t\t \t\t", "stones = int(input())\ncosts = list(map(int, input().split()))\nsteps = sorted(costs)\nq_num = int(input())\nq1s, q2s = [0], [0]\nq1, q2 = 0, 0\n\nfor i in range(stones):\n q1 += costs[i]\n q1s.append(q1)\n q2 += steps[i]\n q2s.append(q2)\n\nfor i in range(q_num):\n q_type, first, second = map(int, input().split())\n if q_type == 1:\n ans1 = q1s[second] - q1s[first - 1]\n print(ans1)\n if q_type == 2:\n ans2 = q2s[second] - q2s[first - 1]\n print(ans2)\n \t \t \t\t \t\t\t\t\t \t \t\t \t\t \t", "from itertools import accumulate\r\nsz = int(input())\r\nl = [0] + list(map(int,input().split()))\r\nlo = list(accumulate(l));lt = list(accumulate(sorted(l)))\r\nq = int(input())\r\nfor i in range(q):\r\n t,s,e = map(int,input().split())\r\n if t == 1:\r\n print(lo[e]-lo[s-1])\r\n else:\r\n print(lt[e]-lt[s-1])", "n= int(input())\r\n\r\nVs= list(map(int,str.split(input())))\r\nm=int(input())\r\n\r\nVs_s=sorted(Vs)\r\ndef pr_sum(lst):\r\n rslt=[]\r\n sm=0\r\n for _ in lst:\r\n sm+=_\r\n rslt.append(sm)\r\n return(rslt)\r\npr_Vs=pr_sum(Vs)\r\npr_Vs_s=pr_sum(Vs_s)\r\n\r\nfor _ in range (m):\r\n ty,l,r= list(map(int,str.split(input())))\r\n if ty==1 and l > 1:\r\n print(pr_Vs[r-1]-pr_Vs[l-2])\r\n elif ty==2 and l > 1:\r\n print(pr_Vs_s[r-1]-pr_Vs_s[l-2])\r\n elif ty==1:\r\n print(pr_Vs[r-1])\r\n else:\r\n print(pr_Vs_s[r-1])\r\n\r\n \r\n \r\n\r\n", "import copy as c\r\n\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\ntemp=c.copy(arr)\r\ntemp.sort()\r\np1,p2=[],[]\r\nt1,t2=0,0\r\nfor i in range(n):\r\n t1+=arr[i]\r\n p1.append(t1)\r\n t2+=temp[i]\r\n p2.append(t2)\r\n\r\nm=int(input())\r\nfor i in range(m):\r\n a,b,c=list(map(int,input().split()))\r\n b-=1\r\n c-=1\r\n if(a==1):\r\n if(b==0):\r\n print(p1[c])\r\n else:\r\n print(p1[c]-p1[b-1])\r\n\r\n elif(a==2):\r\n if(b==0):\r\n print(p2[c])\r\n else:\r\n print(p2[c]-p2[b-1])\r\n\r\n\r\n\r\n", "# import numpy\n# a = int(input())\n# h = [int(po) for po in input().split()]\n# d = h.copy()\n# d.sort()\n# n = int(input())\n# res = []\n# for i in range(n):\n# b = [int(lo) for lo in input().split()]\n# if b[0] == 1:\n# res.append(numpy.sum([int(k) for k in h[b[1]-1:b[2]]]))\n# else:\n# res.append(numpy.sum([int(k) for k in d[b[1]-1:b[2]]]))\n# print(*res, sep=\"\\n\")\na = int(input())\nb = [int(qwekqw) for qwekqw in input().split()]\nf = [b[0]]\nfor i in range(1, a):\n f.append(b[i] + f[i-1])\nb.sort()\nf2 = [b[0]]\nfor j in range(1, a):\n f2.append(b[j] + f2[j-1])\ny = int(input())\nres = []\nf.insert(0, 0)\nf2.insert(0,0)\nfor k in range(y):\n n = input().split()\n if n[0] == \"1\":\n res.append((f[int(n[2])]) - (f[int(n[1]) - 1]))\n else:\n res.append((f2[int(n[2])]) - (f2[int(n[1]) - 1]))\nprint(*res, sep=\"\\n\")\n# 6 \n# 6 4 2 7 2 7\n\n# 5\n# 1 5 6 3 4 2", "no_stones = int(input())\r\nstones = list(map(int, input().split()))\r\nsorted_stones = sorted(stones)\r\nno_queries = int(input())\r\nif (no_stones != 1):\r\n prevSum = stones[0]\r\n for i in range(1, no_stones):\r\n curSum = stones[i] + prevSum\r\n stones[i] = curSum\r\n prevSum = curSum\r\n prevSum = sorted_stones[0]\r\n for i in range(1, no_stones):\r\n curSum = sorted_stones[i] + prevSum\r\n sorted_stones[i] = curSum\r\n prevSum = curSum\r\nqueries = []\r\nfor _ in range(no_queries):\r\n query = list(map(int, input().split()))\r\n queries.append(query)\r\nfor query in queries:\r\n qType = query[0]\r\n l = query[1]\r\n r = query[2]\r\n resL = l - 2\r\n if (qType == 1):\r\n if (resL < 0):\r\n print(stones[r-1])\r\n else:\r\n print(stones[r-1] - stones[resL])\r\n else:\r\n if (resL < 0):\r\n print(sorted_stones[r-1])\r\n else:\r\n print(sorted_stones[r-1] - sorted_stones[resL])\r\n", "n = int(input())\nl = list(map(int, input().split()))\nnew = sorted(l)\nfor i in range(1,n):\n\tl[i] += l[i-1]\nfor i in range(1,n):\n\tnew[i] += new[i-1]\nfor _ in range(int(input())):\n\ttype, low, high = map(int, input().split())\n\tlow -=1\n\thigh -=1\n\tif type == 1:\n\t\t##\n\t\tif low-1>=0:\n\t\t\tprint(l[high] - l[low-1])\n\t\telse:\n\t\t\tprint(l[high])\n\t\t\n\telse:\n\t\tif low-1>=0:\n\t\t\tprint(new[high] - new[low-1])\n\t\telse:\n\t\t\tprint(new[high])\n\t\t\n\t\t\n \t \t \t\t\t \t \t \t \t\t \t\t \t\t\t\t\t", "n = int(input())\nk = list(map(int, input().split()))\na = [0] + k\nfor i in range(1, n + 1):\n a[i] += a[i - 1]\nk.sort()\nk = [0] + k\nfor i in range(1, n + 1):\n k[i] += k[i - 1]\n\nfor i in range(int(input())):\n t, l, r = map(int, input().split())\n if t == 1:\n print(a[r] - a[l - 1])\n else:\n print(k[r] - k[l - 1])", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nx=sorted(a)\r\nfor i in range(1,n):\r\n a[i]=a[i]+a[i-1]\r\n x[i]=x[i]+x[i-1]\r\nfor i in range(m):\r\n q,l,r=list(map(int,input().split()))\r\n if q==1:\r\n if (l-2)!=-1:\r\n print(a[r-1]-a[l-1-1])\r\n else:\r\n print(a[r-1])\r\n else:\r\n if l-2!=-1:\r\n print(x[r-1]-x[l-1-1])\r\n else:\r\n print(x[r-1])", "def prefixSum(array, length):\r\n preSum = [0] * (length + 1) # [0,0,0,0,0......0,0]\r\n for i in range(length):\r\n if i == 0:\r\n preSum[i+1] = int(array[i])\r\n else:\r\n preSum[i+1] = array[i] + preSum[i]\r\n return preSum\r\n\r\ndef sumRange(prefix_array, start, end):\r\n st = prefix_array[start - 1]\r\n en = prefix_array[end]\r\n return en - st\r\n\r\n\r\nn = int(input())\r\nv = list(map(int, input().split()))\r\nvs = v.copy()\r\nvs.sort()\r\npresum_v = prefixSum(v, n) # [0,6,10,12,19,21,28]\r\npresum_vs = prefixSum(vs, n)\r\nm = int(input())\r\nfor i in range(m):\r\n type, l, r = map(int, input().split())\r\n if type == 1:\r\n print(sumRange(presum_v, l, r))\r\n else:\r\n print(sumRange(presum_vs, l, r))", "arr = int(input())\r\nnum = list(map(int,input().split(\" \")))\r\nnums=sorted(num)\r\n#print(nums)\r\nprefix=[0]\r\nsorprefix=[0]\r\nfor i in range(arr):\r\n prefix.append(prefix[-1] + num[i])\r\n sorprefix.append(sorprefix[-1] + nums[i])\r\n\r\n#print(prefix,sorprefix)\r\nfor x in range(int(input())):\r\n type,l,r=map(int,input().split(\" \"))\r\n if type==1:\r\n print(prefix[r] - prefix[l-1])\r\n else:\r\n print(sorprefix[r ] - sorprefix[l-1])", "n=int(input())\r\nlst1=list(map(int,input().split()))\r\nlst2=sorted(lst1)\r\nl1=[0]\r\ns1=0\r\nl2=[0]\r\ns2=0\r\nfor i in range(n):\r\n s1+=lst1[i]\r\n s2+=lst2[i]\r\n l1.append(s1)\r\n l2.append(s2)\r\nm=int(input())\r\nfor i in range(m):\r\n t,l,r= map(int,input().split())\r\n if t==1:\r\n print(l1[r]-l1[l-1])\r\n elif t==2:\r\n print(l2[r]-l2[l-1])\r\n", "z = int(input())\np = str(input()).split()\nv = int(input())\n\np1 = [int(i) for i in p]\np1 = sorted(p1)\n\nsp = [0]\nsp.append(int(p[0]))\nsp1 = [0]\nsp1.append(int(p1[0]))\n\nfor u in range(1,len(p)):\n sp.append( int(p[u]) + sp[u])\n \nfor o in range(1,len(p1)):\n sp1.append(int(p1[o] + sp1[o]))\nfor x in range(v):\n q = str(input()).split()\n q1 = int(q[0])\n q2 = int(q[1]) \n q3 = int(q[2])\n\n if q[0] == \"1\":\n print (sp[q3 ] - sp[q2 - 1])\n else:\n print (sp1[q3 ] - sp1[q2 -1])\n\t\t \t \t \t\t\t\t \t \t \t \t\t\t\t", "psum = [0]\nsorted_psum = [0]\nint(input())\nnums = list(map(int, input().split()))\n\nfor num in nums:\n psum.append(psum[-1] + num)\n\nfor num in sorted(nums):\n sorted_psum.append(sorted_psum[-1] + num)\n\nfor i in range(int(input())):\n t, l, r = map(int, input().split())\n lis = [psum, sorted_psum][t-1]\n print(lis[r] - lis[l-1])\n \t \t \t \t \t\t\t \t\t \t\t\t\t\t \t\t", "# https://codeforces.com/problemset/problem/433/B\r\n\r\ninput() \r\nseq = list(map(int, input().split()))\r\n\r\np_s = [0 for _ in range(len(seq))]\r\nsort_s = [0 for _ in range(len(seq))]\r\np_s[0] = seq[0]\r\nfor i in range(1, len(seq)):\r\n p_s[i] = p_s[i - 1] + seq[i]\r\nseq.sort()\r\nsort_s[0] = seq[0]\r\nfor i in range(1, len(seq)):\r\n sort_s[i] = sort_s[i - 1] + seq[i]\r\n\r\nfor _ in range(int(input())):\r\n t, l, r = map(int, input().split())\r\n if t == 1:\r\n if l == 1:\r\n print(p_s[r-1])\r\n else:\r\n print(p_s[r-1] - p_s[l-2])\r\n else:\r\n if l == 1:\r\n print(sort_s[r-1])\r\n else:\r\n print(sort_s[r-1] - sort_s[l-2])\r\n", "'''6\r\n6 4 2 7 2 7\r\n3\r\n2 3 6\r\n1 3 4\r\n1 1 6\r\n'''\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\npref_1=[0 for i in range(n)]\r\npref_2=[0 for j in range(n)]\r\npref_1[0]=l[0]\r\nfor i in range(1,n):\r\n pref_1[i]=pref_1[i-1]+l[i]\r\nl.sort()\r\npref_2[0]=l[0]\r\nfor j in range(1,n):\r\n pref_2[j]=pref_2[j-1]+l[j]\r\npref_1.insert(0,0)\r\npref_2.insert(0,0)\r\n\r\nq=int(input())\r\nfor i in range(q):\r\n r=list(map(int,input().split()))\r\n if(r[0]==1):\r\n ans=pref_1[r[2]]-pref_1[r[1]-1]\r\n else:\r\n ans=pref_2[r[2]]-pref_2[r[1]-1]\r\n print(ans)\r\n", "\n\nnum = int(input())\nstones = list(map(int, input().split()))\n\nsorted = sorted(stones)\n\npsa_stones = [0] * (num+1)\npsa_sorted = [0] * (num+1)\n\nfor i in range(num):\n psa_stones[i + 1] = psa_stones[i] + stones[i]\n psa_sorted[i + 1] = psa_sorted[i] + sorted[i]\n\n\n\nm = int(input())\nfor i in range(m):\n type, l, r = map(int, input().split())\n\n if type == 1:\n print(psa_stones[r] - psa_stones[l - 1])\n elif type == 2:\n print(psa_sorted[r] - psa_sorted[l - 1])\n \t\t \t\t \t \t \t\t \t \t\t\t \t\t\t", "n = int (input())\r\nele = list(map(int,input().split()))\r\n\r\npref_arr=[0]*(n+1)\r\npref_sort=[0]*(n+1)\r\nfor i in range(1,n+1):\r\n pref_arr[i] = ele[i-1]+pref_arr[i-1]\r\n\r\nele2=sorted(ele)\r\nfor i in range(1,n+1):\r\n pref_sort[i] = ele2[i-1]+pref_sort[i-1]\r\nfor i in range(int(input())):\r\n a,b,c = list(map(int,input().split()))\r\n if a==1:\r\n print(pref_arr[c]-pref_arr[b-1])\r\n else:\r\n print(pref_sort[c]-pref_sort[b-1])\r\n ", "n = int(input())\r\n\r\narr = list(map(int, input().split()))\r\narr_sort = sorted(arr)\r\n\r\nprefix_arr = [0]\r\nsum1 = 0\r\nfor i in arr:\r\n sum1 += i \r\n prefix_arr.append(sum1)\r\n\r\nprefix_arr_sort = [0]\r\nsum2 = 0\r\nfor i in arr_sort:\r\n sum2 += i \r\n prefix_arr_sort.append(sum2)\r\n \r\nq = int(input())\r\n\r\nfor i in range(q):\r\n type_q, l, r = map(int, input().split())\r\n if(type_q == 1):\r\n ans = prefix_arr[r]-prefix_arr[l-1]\r\n else:\r\n ans = prefix_arr_sort[r]-prefix_arr_sort[l-1]\r\n print(ans)\r\n \r\n \r\n \r\n ", "def main():\r\n n = int(input())\r\n costs = [int(x) for x in input().split()]\r\n m = int(input())\r\n\r\n sorted_costs = [x for x in costs]\r\n sorted_costs.sort()\r\n rs_costs = [0]\r\n rs_sorted = [0]\r\n rs = 0\r\n rss = 0\r\n for i in range(n):\r\n rs += costs[i]\r\n rs_costs.append(rs)\r\n rss += sorted_costs[i]\r\n rs_sorted.append(rss)\r\n for q in range(m):\r\n type, l, r = [int(x) for x in input().split()]\r\n if type == 1:\r\n print(rs_costs[r]-rs_costs[l-1])\r\n else:\r\n print(rs_sorted[r]-rs_sorted[l-1])\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "N = int(input())\r\nA=[int(i) for i in input().split()]\r\n\r\nB = [0]*N\r\nfor i in range(N):\r\n\tB[i]=A[i]\r\n\r\nB.sort()\r\n\r\nprefix_A = [A[0]]*N\r\nprefix_B = [B[0]]*N\r\n\r\n\r\nfor i in range(1,N):\r\n\tprefix_A[i] = prefix_A[i-1] + A[i]\r\n\tprefix_B[i] = prefix_B[i-1] + B[i]\r\n\r\nQ = int(input())\r\n\r\nfor i in range(Q):\r\n\tt,l,r = [int(i) for i in input().split()]\r\n\tif t == 1:\r\n\t\tif l==1:\r\n\t\t\tprint(prefix_A[r-1])\r\n\t\telse:\r\n\t\t\tprint(prefix_A[r-1] - prefix_A[l-2])\r\n\telse:\r\n\t\tif l==1:\r\n\t\t\tprint(prefix_B[r-1])\r\n\t\telse:\r\n\t\t\tprint(prefix_B[r-1] - prefix_B[l-2])\r\n", "n = int(input())\r\noriginal_costs = list(map(int, input().split()))\r\n\r\n# Create a sorted copy of the original costs\r\nsorted_costs = sorted(original_costs)\r\n\r\n# Precompute prefix sums for both original_costs and sorted_costs\r\nprefix_sum_original = [0] * (n + 1)\r\nprefix_sum_sorted = [0] * (n + 1)\r\n\r\nfor i in range(1, n + 1):\r\n prefix_sum_original[i] = prefix_sum_original[i - 1] + original_costs[i - 1]\r\n prefix_sum_sorted[i] = prefix_sum_sorted[i - 1] + sorted_costs[i - 1]\r\n\r\nm = int(input())\r\n\r\nfor _ in range(m):\r\n query = list(map(int, input().split()))\r\n type = query[0]\r\n l = query[1]\r\n r = query[2]\r\n\r\n if type == 1:\r\n # Query type 1: Original order\r\n answer = prefix_sum_original[r] - prefix_sum_original[l - 1]\r\n else:\r\n # Query type 2: Sorted order\r\n answer = prefix_sum_sorted[r] - prefix_sum_sorted[l - 1]\r\n\r\n print(answer)\r\n", "n=int(input())\r\narr1=[int(x) for x in input().split()] \r\narr2=arr1.copy()\r\narr2.sort()\r\nfor i in range(1,n):\r\n arr1[i]+=arr1[i-1]\r\n arr2[i]+=arr2[i-1]\r\nfor _ in range(int(input())):\r\n q,l,r=map(int,input().split())\r\n l-=1 \r\n r-=1\r\n if q==1:\r\n if l==0:\r\n print(arr1[r])\r\n else:\r\n print(arr1[r]-arr1[l-1])\r\n else:\r\n if l==0:\r\n print(arr2[r])\r\n else:\r\n print(arr2[r]-arr2[l-1])\r\n \r\n \r\n", "n = int(input())\r\nls = list(map(int, input().split()))\r\nord_l = ls.copy()\r\nord_l.sort()\r\n\r\nprefix_sum1 = [0]*n\r\nfor i in range(n):\r\n prefix_sum1[i] = prefix_sum1[i-1] + ls[i]\r\n \r\nprefix_sum2 = [0]*n\r\nfor i in range(n):\r\n prefix_sum2[i] = prefix_sum2[i-1] + ord_l[i]\r\nprefix_sum1 = [0]+prefix_sum1\r\nprefix_sum2 = [0]+prefix_sum2\r\nm = int(input())\r\n\r\nfor _ in range(m):\r\n tp, l, r = map(int, input().split())\r\n if tp == 1:\r\n print(prefix_sum1[r]-prefix_sum1[l-1])\r\n else:\r\n print(prefix_sum2[r]-prefix_sum2[l-1]) \r\n ", "n=int(input())\r\nv=[int(x) for x in input().split()]\r\nv2=sorted(v, reverse=False)\r\nm=int(input())\r\nG={}\r\nG2={}\r\ncount=0\r\ncount2=0\r\nfor i in range(0, len(v)):\r\n count+= v[i]\r\n count2+=v2[i]\r\n G[i]=count\r\n G2[i]=count2\r\nG[-1]=0 \r\nG2[-1]=0 \r\n# print(G)\r\n\r\nfor i in range(m):\r\n (tp, l, r)=input().split()\r\n tp=int(tp)\r\n l=int(l)\r\n r=int(r)\r\n if tp==2:\r\n print(G2[r-1]-G2[l-2])\r\n # print(G2[l-1])\r\n else:\r\n print(G[r-1]-G[l-2])\r\n ", "import copy\r\na=int(input())\r\nb=list(map(int,input().split()))\r\nbi=b.copy()\r\nbi.sort()\r\nfor i in range(1,a):\r\n b[i]+=b[i-1]\r\n bi[i]+=bi[i-1]\r\n\r\n\r\nc=int(input())\r\nfor _ in range(c):\r\n d=list(map(int,input().split()))\r\n if(d[0]==1):\r\n if(d[1]-2<0):\r\n print(b[d[2]-1])\r\n else:\r\n print(b[d[2]-1]-b[d[1]-2])\r\n else:\r\n if(d[1]-2<0):\r\n print(bi[d[2]-1])\r\n else:\r\n print(bi[d[2]-1]-bi[d[1]-2])\r\n", "input()\r\npedras = list(map(int, input().split()))\r\nsoma = 0\r\nacumulacao_natural = []\r\nfor pedra in pedras:\r\n soma += pedra\r\n acumulacao_natural.append(soma)\r\n\r\npedras.sort()\r\nsoma = 0\r\nacumulacao_ordenada = []\r\nfor pedra in pedras:\r\n soma += pedra\r\n acumulacao_ordenada.append(soma)\r\n\r\nfor _ in range(int(input())):\r\n opcao, inicio, fim = map(int, input().split())\r\n\r\n if opcao == 1:\r\n if inicio > 1:\r\n resultado = acumulacao_natural[fim - 1] - acumulacao_natural[inicio - 2]\r\n else:\r\n resultado = acumulacao_natural[fim - 1]\r\n else:\r\n if inicio > 1:\r\n resultado = acumulacao_ordenada[fim - 1] - acumulacao_ordenada[inicio - 2]\r\n else:\r\n resultado = acumulacao_ordenada[fim - 1]\r\n\r\n print(resultado)\r\n", "import sys, math\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\na = [int(x) for x in input().split()]\r\nb = sorted(a)\r\n\r\npre_a = [0, a[0]]\r\npre_b = [0, b[0]]\r\n\r\nfor i in range(1, n):\r\n pre_a.append(a[i] + pre_a[-1])\r\n pre_b.append(b[i] + pre_b[-1])\r\n\r\nfor i in range(int(input())):\r\n type, l, r = [int(x) for x in input().split()]\r\n \r\n if type == 1:\r\n print(pre_a[r] - pre_a[l - 1])\r\n else:\r\n print(pre_b[r] - pre_b[l - 1])", "n = int(input()) \r\nlist1 = [int(num) for num in input().split()]\r\nm = int(input())\r\npsum1 = [0]\r\nfor i in range(0,len(list1)):\r\n psum1.append(list1[i]+psum1[i])\r\nlist1.sort()\r\npsum2=[0]\r\nfor i in range(0,len(list1)):\r\n psum2.append(list1[i]+psum2[i])\r\nfor i in range(0,m):\r\n inputs = [int(num) for num in input().split()]\r\n ty = inputs[0]\r\n l = inputs[1]\r\n r = inputs[2]\r\n if(ty==1):\r\n print(psum1[r]-psum1[l-1])\r\n else:\r\n print(psum2[r]-psum2[l-1])\r\n ", "import sys\r\ninput=sys.stdin.readline\r\n\r\nn1=int(input())\r\nnumbers=list(map(int,input().split()))\r\nsorted_number=sorted(numbers)\r\n\r\nnumbers_pref=[0]*(len(numbers)+1)\r\nsorted_number_pref=[0]*(len(numbers)+1)\r\n\r\nfor i in range(1,len(numbers)+1):\r\n numbers_pref[i]+=numbers[i-1]+numbers_pref[i-1]\r\n sorted_number_pref[i]+=sorted_number[i-1]+sorted_number_pref[i-1]\r\n\r\n\r\ncases=int(input())\r\nfor i in range(cases):\r\n iff=list(map(int,input().split()))\r\n if iff[0]==1:\r\n print(numbers_pref[iff[2]] - numbers_pref[iff[1]-1])\r\n else:\r\n print(sorted_number_pref[iff[2]] - sorted_number_pref[iff[1]-1])", "n = int(input())\nls = list(map(int, input().split()))\nq = int(input())\ncp = ls.copy()\ncp.sort()\nls = [0] + ls\ncp = [0] + cp\nfor x in range(1,len(ls)):\n ls[x] +=ls[x-1]\n cp[x] +=cp[x-1]\nfor _ in range(q):\n lk = list(map(int, input().split()))\n l = lk[1]\n r = lk[2]\n if lk[0] == 1:\n print(ls[r] - ls[l-1])\n else:\n print(cp[r] - cp[l-1])\n\t \t \t \t\t \t\t\t\t\t\t \t \t\t\t \t\t", "from collections import deque\r\nt = 1# int(input())\r\nfor _ in range(t):\r\n n = int(input())\r\n d = list(map(int,input().split()))\r\n p = [i for i in d]\r\n p.sort()\r\n pref, pref1 = [0],[0]\r\n for i in range(n):\r\n pref += [pref[-1] + d[i]]\r\n pref1 += [pref1[-1] + p[i]]\r\n q = int(input())\r\n while q > 0:\r\n tp, l, r = map(int,input().split())\r\n if tp == 1:\r\n print(pref[r] - pref[l - 1])\r\n else:\r\n print(pref1[r] - pref1[l - 1]) \r\n q -= 1", "import math\n\ndef main():\n lent = int(input())\n inp = input()\n inp = inp.split()\n nums = []\n for i in inp:\n nums.append(int(i))\n sorts = sorted(nums)\n pref1 = [0]\n for i in range(len(nums)):\n pref1.append(pref1[-1] + nums[i])\n pref2 = [0]\n for i in range(len(nums)):\n pref2.append(pref2[-1] + sorts[i])\n\n goes = int(input())\n for i in range(goes):\n inp = input()\n inp = inp.split()\n i = 0\n sums = 0\n if int(inp[0]) == 1:\n sums = pref1[int(inp[2])]-pref1[int(inp[1])-1]\n else:\n sums = pref2[int(inp[2])]-pref2[int(inp[1])-1]\n\n print(sums)\n\n\n\n\n\n\n\nif __name__ == \"__main__\":\n main()\n \t \t \t\t \t \t\t\t \t\t \t\t\t\t \t \t", "def main():\r\n n = int(input())\r\n arr = list(map(int, input().split()))\r\n brr = sorted(arr)\r\n parr = [0]\r\n pbrr = [0]\r\n for e in arr:\r\n parr.append(parr[-1] + e)\r\n \r\n for e in brr:\r\n pbrr.append(pbrr[-1] + e)\r\n\r\n for i in range(int(input())):\r\n rule, l, r = map(int, input().split())\r\n if rule == 1:\r\n print(parr[r] - parr[l-1])\r\n else: \r\n print(pbrr[r] - pbrr[l-1])\r\n\r\n \r\n\r\n \r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "def sum_till_index(A):\r\n res = []\r\n sum = 0\r\n res.append(0)\r\n for i in A:\r\n sum +=i\r\n res.append(sum)\r\n return res\r\n\r\nn = int(input())\r\nV = list(map(int, input().split()))\r\nVs = list(V)\r\nVs.sort()\r\n\r\nres = []\r\n\r\nm = int(input())\r\nsum_V = sum_till_index(V)\r\nsum_Vs = sum_till_index(Vs)\r\n\r\nfor i in range(m):\r\n type, l, r = list(map(int, input().split()))\r\n if type == 1:\r\n res.append(sum_V[r] - sum_V[l - 1])\r\n else:\r\n res.append(sum_Vs[r] - sum_Vs[l - 1])\r\nprint(*res, sep=\"\\n\")\r\n ", "n = int(input())\r\n*v, = map(int, input().split())\r\nu = sorted(v)\r\nfor i in range(1, n):\r\n v[i] += v[i-1]\r\n u[i] += u[i-1]\r\nfor _ in range(int(input())):\r\n t, l, r = map(int, input().split())\r\n if t == 2:\r\n print(u[r-1]-u[l-2] if l-1 != 0 else u[r-1])\r\n else:\r\n print(v[r-1]-v[l-2] if l-1 != 0 else v[r-1])\r\n", "\r\nn=int(input())\r\narr=list(map(int, input().split()))\r\npref1=[0]\r\nfor x in range(len(arr)):\r\n pref1.append(pref1[-1]+arr[x])\r\npref2=[0] \r\narr2=sorted(arr)\r\n\r\nfor x in range( len(arr2)):\r\n pref2.append(pref2[-1]+arr2[x])\r\nq=int(input())\r\n\r\nfor x in range(q):\r\n qq,i,j=map(int, input().split())\r\n if qq==1:\r\n print(pref1[j]-pref1[i-1])\r\n else:\r\n print(pref2[j]-pref2[i-1])\r\n ", "n = int(input())\r\nv = [int(x) for x in input().split()]\r\nu = sorted(v)\r\n\r\nz = len(v) + 1\r\n\r\ncs_v = [0] * z\r\ncs_u = [0] * z\r\n\r\nfor i in range(1, z):\r\n cs_v[i] = v[i - 1] + cs_v[i - 1]\r\n cs_u[i] = u[i - 1] + cs_u[i - 1]\r\n\r\nq = int(input())\r\nfor qe in range(q):\r\n ques = [int(x) for x in input().split()]\r\n\r\n if ques[0] == 1:\r\n print(cs_v[ques[2]] - cs_v[ques[1] - 1])\r\n else:\r\n print(cs_u[ques[2]] - cs_u[ques[1] - 1])", "n = int(input())\r\n\r\nv = [int(x) for x in input().split()]\r\n\r\nu = sorted(v)\r\nucost = [0]*(n+1)\r\n\r\nvcost = [0]*(n+1)\r\n\r\nfor i in range(n-1,-1,-1):\r\n vcost[i] = vcost[i+1]+v[i]\r\n ucost[i] = ucost[i+1]+u[i]\r\n\r\nfor _ in range(int(input())):\r\n t,l,r = map(int,input().split())\r\n\r\n if t==1:\r\n print(vcost[l-1]-vcost[r])\r\n else:\r\n print(ucost[l-1]-ucost[r])\r\n\r\n", "n = int(input())\nv = list(map(int, input().split()))\no = sorted(v)\n\nfreqv = [0 for i in range(n)]\nfreqo = [0 for i in range(n)]\n\nfor i in range(n):\n if i == 0:\n freqv[i] = v[0]\n freqo[i] = o[0]\n else:\n freqv[i] = freqv[i-1] + v[i]\n freqo[i] = freqo[i-1] + o[i]\n\nm = int(input())\n\nfor i in range(m):\n t, l, r = list(map(lambda x: int(x)-1, input().split()))\n if t == 0:\n if l > 0:\n print(freqv[r] - freqv[l-1])\n else:\n print(freqv[r])\n else:\n if l > 0:\n print(freqo[r] - freqo[l-1])\n else:\n print(freqo[r])\n\t \t\t \t\t \t\t \t\t \t \t\t\t \t \t\t \t", "n = int(input())\nvalores = list(map(int, input().split()))\nm = int(input())\n\nordenado = valores.copy()\nordenado.sort()\n\nvalores_ac = [0]*(n+1)\nordenado_ac = [0]*(n+1)\n\nfor i in range(1, n+1):\n valores_ac[i] = valores_ac[i-1] + valores[i-1]\nfor i in range(1, n+1):\n ordenado_ac[i] = ordenado_ac[i-1] + ordenado[i-1]\n\nfor i in range(m):\n tipo, l, r = map(int, input().split())\n if(tipo == 1):\n print(valores_ac[r] - valores_ac[l-1])\n else:\n print(ordenado_ac[r] - ordenado_ac[l-1])\n \t \t\t\t\t \t \t\t\t \t \t\t \t\t", "n = int(input())\r\nv = list(map(int, input().split()))\r\nm = int(input())\r\na = [v[0]]\r\nfor i in range(1, n):\r\n a.append(a[-1]+ v[i])\r\n# print(a)\r\nv.sort()\r\nb = [v[0]]\r\nfor i in range(1, n):\r\n b.append(b[-1] + v[i])\r\n# print(b)\r\n\r\nfor _ in range(0, m):\r\n type, l, r = list(map(int, input().split()))\r\n r -= 1\r\n l -= 1\r\n if type == 1:\r\n if l == 0:\r\n print(a[r])\r\n else:\r\n print( a[r] - a[l-1])\r\n else:\r\n if l == 0:\r\n print(b[r])\r\n else:\r\n print( b[r] - b[l-1])", "from sys import stdin, stdout\n\nif __name__ == \"__main__\":\n n = int(stdin.readline())\n arr = list(map(int, stdin.readline().split()))\n\n pfsx1 = [0] * (n + 1)\n pfsx2 = [0] * (n + 1)\n for i in range(1, n + 1):\n pfsx1[i] = pfsx1[i - 1] + arr[i - 1]\n arr.sort()\n for i in range(1, n + 1):\n pfsx2[i] = pfsx2[i - 1] + arr[i - 1]\n\n q = int(stdin.readline())\n while q > 0:\n t, l, r = map(int, stdin.readline().split())\n if t == 1:\n stdout.write(str(pfsx1[r] - pfsx1[l - 1]) + \"\\n\")\n else:\n stdout.write(str(pfsx2[r] - pfsx2[l - 1]) + \"\\n\")\n q -= 1\n\t \t \t \t\t \t\t\t\t\t \t \t \t \t\t", "n=int(input())\r\n# a=input()\r\na=[int(x) for x in input().split()]\r\n# print(a)\r\nv=[]\r\nsum=0\r\nfor i in a:\r\n\tsum=sum+i\r\n\tv.append(sum)\r\n\r\n# v is non sorted sum list\r\n# u is sorted sum list\r\n\r\na.sort()\r\nsum=0\r\nu=[]\r\nfor i in a:\r\n\tsum=sum+i\r\n\tu.append(sum)\r\n\r\nu.append(0)\r\nv.append(0)\r\n# print(v)\r\n# print(u)\t\r\n\r\nm=int(input())\r\n\r\nfor i in range(m):\r\n\tt,l,r=map(int,input().split())\r\n\r\n\tif t==1:\r\n\t\tprint(v[r-1]-v[l-2])\r\n\tif t==2:\r\n\t\tprint(u[r-1]-u[l-2])\t\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n# a=[]\r\n# for i in range(n):\r\n# \ta.append([j for j in map(int,input().split())])\r\n# \t# a=a[0]\r\n\r\n\r\n\r\n", "\r\nfrom sys import maxsize, stdout, stdin,stderr\r\nmod = int(1e9 + 7)\r\n\r\ndef I(): return int(stdin.readline())\r\ndef lint(): return [int(x) for x in stdin.readline().split()]\r\ndef S(): return input().strip()\r\ndef grid(r, c): return [lint() for i in range(r)]\r\nfrom collections import defaultdict, Counter\r\nimport math\r\nimport heapq\r\nfrom heapq import heappop , heappush\r\nimport bisect\r\nfrom itertools import groupby\r\ndef gcd(a,b): \r\n while b:\r\n a %= b\r\n tmp = a\r\n a = b\r\n b = tmp\r\n \r\n return a\r\n\r\ndef lcm(a,b): \r\n return a / gcd(a, b) * b\r\n\r\ndef check_prime(n):\r\n for i in range(2, int(n ** (1 / 2)) + 1):\r\n if not n % i:\r\n return False\r\n return True\r\ndef Bs(a, x):\r\n i=0\r\n j=0\r\n left = 0\r\n right = len(a)\r\n flag=False\r\n while left<right:\r\n \r\n mi = (left+right)//2\r\n #print(smi,a[mi],x)\r\n \r\n if a[mi]<=x:\r\n left = mi+1\r\n i+=1\r\n \r\n else:\r\n\r\n right = mi\r\n j+=1\r\n #print(left,right,\"----\")\r\n #print(i-1,j)\r\n if left>0 and a[left-1]==x:\r\n return i-1, j\r\n else:\r\n return -1, -1\r\n\r\nfrom heapq import heappop , heappush\r\nn=I()\r\nv = lint()\r\nm = I()\r\n\r\nh=v.copy()\r\nh.sort()\r\n\r\n\r\nfor i in range(1,n):\r\n v[i]+=v[i-1]\r\n h[i]+=h[i-1]\r\n#print(*v)\r\n#print(*h)\r\nfor i in range(m):\r\n t,l,r=lint()\r\n if t==1:\r\n if l==1:\r\n print(v[r-1])\r\n else:\r\n print(v[r-1]-v[l-2])\r\n else:\r\n if l==1:\r\n print(h[r-1])\r\n else:\r\n print(h[r-1]-h[l-2])\r\n \r\n", "import sys\nfrom itertools import accumulate\n\namt = int(input())\nlst = [int(i) for i in input().split()]\n#prefixlst = lst\n#prefixsort = sorted(lst)\nprefixlst = list(accumulate(lst))\nprefixsort = list(accumulate(sorted(lst)))\n#print(lst)\n#print(prefixlst)\n#print(prefixsort)\n\namt = int(input())\nfor _ in range(amt):\n\tfos, l, r = [int(i) for i in input().split()]\n\tif l == 1:\n\t\tif fos == 1:\n\t\t\tprint(prefixlst[r - 1])\n\t\t\tcontinue\n\t\telse:\n\t\t\tprint(prefixsort[r - 1])\n\t\t\tcontinue\n\tif fos == 1:\n\t\t#print(prefixlst[l - 1: r])\n\t\t#print(sum(prefixlst[l - 1: r]))\n\t\tprint(prefixlst[r - 1] - prefixlst[l - 2])\n\telse:\n\t\t#print(prefixsort[l - 1: r])\n\t\t#print(sum(prefixsort[l - 1: r]))\n\t\t\n\t\tprint(prefixsort[r - 1] - prefixsort[l - 2])\n\t\t", "def buildPrefix(arr):\r\n n = len(arr)\r\n res = [0 for _ in range(n+1)]\r\n s = 0\r\n for i in range(1, n+1):\r\n s += arr[i-1]\r\n res[i] = s\r\n return res\r\n \r\n\r\ndp = []\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\ndp.append(buildPrefix(arr))\r\narr.sort()\r\ndp.append(buildPrefix(arr))\r\n\r\nm = int(input())\r\nfor _ in range(m):\r\n t, l, r = map(int, input().split())\r\n print(dp[t-1][r] - dp[t-1][l-1])", "import sys\n\nin_f = sys.stdin.read(-1).replace(\"\\r\\n\", \"\\r\")\nin_f = in_f.split()\n\nn = int(in_f[0])\nm = int(in_f[n + 1])\n\ncosts = [int(in_f[1 + i]) for i in range(n)]\ncosts_sorted = [int(in_f[1 + i]) for i in range(n)]\ncosts_sorted.sort()\n\ndp = [0 for i in range(n + 1)]\ndp_sorted = [0 for i in range(n + 1)]\n\nlist_sum = 0\nfor i in range(n):\n\tlist_sum += costs[i]\n\tdp[i + 1] = list_sum \nlist_sum = 0\nfor i in range(n):\n\tlist_sum += costs_sorted[i]\n\tdp_sorted[i + 1] = list_sum\n\nfor question in range(m):\n\tq_type = int(in_f[n + 2 + 3 * question])\n\tl = int(in_f[n + 3 + 3 * question])\n\tr = int(in_f[n + 4 + 3 * question])\n\tif q_type == 1: # SUM OF COSTS\n\t\tprint(dp[r] - dp[l - 1])\n\telse: # SUM OF COST SORTED\n\t\tprint(dp_sorted[r] - dp_sorted[l - 1])\n\n\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\nd=sorted(arr)\r\npre=[0]\r\np1=[0]\r\nfor el in arr:\r\n pre.append(pre[-1]+el)\r\nfor el in d:\r\n p1.append(p1[-1]+el)\r\nfor q in range(int(input())):\r\n d,l,r=map(int,input().split())\r\n if d==1:\r\n print(pre[r]-pre[l-1])\r\n else:\r\n print(p1[r]-p1[l-1])\r\n ", "\r\nn = int(input())\r\n\r\narray = tuple(map(int, input().split()))\r\narray_prefix = [0]\r\nfor i in range(n):\r\n array_prefix.append(array_prefix[i] + array[i])\r\n\r\narray_sorted = sorted(array)\r\narray_sorted_prefix = [0]\r\nfor i in range(n):\r\n array_sorted_prefix.append(array_sorted_prefix[i] + array_sorted[i])\r\n\r\nm = int(input())\r\nfor i in range(m):\r\n request, left, right = map(int, input().split())\r\n\r\n if request == 1:\r\n print(array_prefix[right] - array_prefix[left - 1])\r\n else:\r\n print(array_sorted_prefix[right] - array_sorted_prefix[left - 1])", "n = input()\r\nl = list(map(int, input().split()))\r\ns = sorted(l)\r\nll, ss = 0, 0\r\nl_sum, s_sum = [], []\r\n\r\nfor i, e in enumerate(l):\r\n ll += e\r\n l_sum.append(ll)\r\n ss += s[i]\r\n s_sum.append(ss)\r\n\r\nk = int(input())\r\nfor _ in range(k):\r\n t, i, r = map(int, input().split())\r\n if t == 1:\r\n if i >= 2:\r\n print(l_sum[r-1] - l_sum[i-2])\r\n else:\r\n print(l_sum[r-1])\r\n else:\r\n if i >= 2:\r\n print(s_sum[r-1] - s_sum[i-2])\r\n else:\r\n print(s_sum[r-1])\r\n", "input()\n\nv = list(map(int, input().split()))\nu = sorted(v)\n\nsv = [v[0]]\nfor i in range(1, len(v)):\n sv.append(sv[i - 1] + v[i])\n\nsu = [u[0]]\nfor i in range(1, len(u)):\n su.append(su[i - 1] + u[i])\n\n\ndef type1(l, r):\n if l - 1 >= 0:\n summation = int(sv[r] - sv[l - 1])\n print(summation)\n else:\n print(sv[r])\n\n\ndef type2(l, r):\n if l - 1 >= 0:\n summation = int(su[r] - su[l - 1])\n print(summation)\n else:\n print(su[r])\n\n\nm = int(input())\n\nfor q in range(m):\n type, l, r = map(int, input().split())\n l -= 1\n r -= 1\n\n if type == 1:\n type1(l, r)\n else:\n type2(l, r)\n", "n=int(input())\r\ncost=list(map(int,input().split()))\r\ncheapest=cost.copy()\r\ncheapest.sort()\r\n\r\nm=int(input())\r\n\r\nsum_cost=[0]*n\r\nsum_cost[0]=cost[0]\r\nsum_cheapest=[0]*n\r\nsum_cheapest[0]=cheapest[0]\r\nfor i in range(1,n):\r\n sum_cost[i]=sum_cost[i-1]+cost[i]\r\n sum_cheapest[i]=sum_cheapest[i-1]+cheapest[i]\r\n# print(sum_cost) \r\n# print(sum_cheapest) \r\nfor _ in range(m):\r\n Type,l,r=map(int,input().split())\r\n if Type==1:\r\n print(sum_cost[r-1]-sum_cost[l-1]+cost[l-1])\r\n else:\r\n print(sum_cheapest[r-1]-sum_cheapest[l-1]+cheapest[l-1])\r\n\r\n\r\n", "try:\r\n n = int(input(\"\"))\r\n v = input(\"\").split()\r\n for i in range(len(v)):\r\n v[i] = int(v[i])\r\n questions = int(input(\"\"))\r\n questionList = []\r\n for i in range(questions):\r\n a = input(\"\").split()\r\n for j in range(3):\r\n a[j] = int(a[j])\r\n questionList.append(a)\r\n u = v.copy()\r\n u.sort()\r\n \r\n vS = v.copy()\r\n vS.append(0)\r\n for i in range(n):\r\n vS[i+1] = vS[i]+v[i]\r\n\r\n uS = u.copy()\r\n uS.append(0)\r\n for i in range(n):\r\n uS[i+1] = uS[i]+u[i]\r\n for i in questionList:\r\n if i[0] == 1:\r\n print(vS[i[2]]-vS[i[1]-1])\r\n elif i[0] == 2:\r\n print(uS[i[2]]-uS[i[1]-1])\r\n #input(\"\")\r\nexcept Exception as e:\r\n print(e)\r\n input(\"\")", "\ndef accumulated_list(l):\n for i in range(1, len(l)):\n l[i] = l[i] + l[i - 1]\n return l\n \nn = int(input())\ncosts = input()\nm = int(input())\nq = []\n\nfor i in range(m):\n q.append(input().split())\n\ntemp_1 = accumulated_list(list(map(int, costs.split())))\ntemp_2 = accumulated_list(sorted(list(map(int, costs.split()))))\n \nfor i in q:\n l = int(i[1])\n r = int(i[2])\n \n if i[0] == '1':\n if l == 1:\n print(temp_1[r-1])\n else:\n print(temp_1[r - 1] - temp_1[l - 2])\n else:\n if l == 1:\n print(temp_2[r - 1])\n else:\n print(temp_2[r - 1] - temp_2[l - 2])\n \n \t \t\t \t \t \t \t \t \t", "# Input\r\n\r\nn = int(input())\r\nv = list(map(int, input().split()))\r\n# Sorting V\r\nsorted_v = sorted(v)\r\n\r\n# Prefix Sum Arrays\r\nprefix_v = [0]\r\nsorted_prefix = [0]\r\nsum_v = 0\r\nsums = 0\r\n\r\n# Prefix For Unsorted Values\r\nfor x in v:\r\n sums += x\r\n prefix_v.append(sums)\r\n\r\n# Prefix For Sorted Values\r\n\r\nfor x in sorted_v:\r\n sum_v += x\r\n sorted_prefix.append(sum_v)\r\n\r\nfor _ in range(int(input())):\r\n question = list(map(int, input().split()))\r\n q = question[0]\r\n\r\n # For Question 2\r\n if q == 2:\r\n\r\n point1 = question[1] - 1\r\n point2 = question[2]\r\n\r\n sums = 0\r\n print(sorted_prefix[point2] - sorted_prefix[point1])\r\n # For Question 1\r\n else:\r\n point1 = question[1] - 1\r\n point2 = question[2]\r\n\r\n print(prefix_v[point2] - prefix_v[point1])\r\n", "n = int(input())\r\ncost = list(map(int, input().split()))\r\n\r\nm = int(input())\r\nanswers = []\r\n\r\nsrtCost = sorted(cost)\r\n\r\nsumCost = [cost[0]]\r\nsumSrtCost = [srtCost[0]]\r\n\r\nfor i in range(1, n):\r\n sumCost.append(cost[i] + sumCost[i-1])\r\n sumSrtCost.append(srtCost[i] + sumSrtCost[i-1])\r\n\r\nsumCost.insert(0, 0)\r\nsumSrtCost.insert(0, 0)\r\n\r\nfor i in range(m):\r\n inp = list(map(int, input().split()))\r\n if inp[0] == 1:\r\n answers.append(sumCost[inp[2]] - sumCost[inp[1]-1])\r\n else:\r\n answers.append(sumSrtCost[inp[2]] - sumSrtCost[inp[1]-1])\r\n\r\nprint(*answers, sep = \"\\n\")", "import sys\r\nimport re\r\nimport math\r\ninput = sys.stdin.readline\r\n \r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\n \r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef inir(s,extrat):\r\n if extrat:\r\n return(list(map(int,s[:len(s) - 1])))\r\n else:\r\n return(list(map(int,s)))\r\n \r\ndef invr():\r\n return(map(int,input().split()))\r\n############ ---- Solution ---- ############\r\nn = inp()\r\ncase2 = inlt()\r\ncase1 = list(case2)\r\ncase2.sort()\r\nm = inp()\r\nprefix_sum_case1=[0]*n\r\nprefix_sum_case2=[0]*n\r\n#fill the prefix_sum arrays\r\ns = 0\r\nfor i in range(n):\r\n s+=case1[i]\r\n prefix_sum_case1[i] = s\r\ns = 0\r\nfor j in range(n):\r\n s+=case2[j]\r\n prefix_sum_case2[j] = s\r\n \r\n \r\nwhile(m):\r\n m-=1\r\n t,l,r = invr()\r\n if(t==1):\r\n if(l>=2):\r\n print(prefix_sum_case1[r-1]-prefix_sum_case1[l-2])\r\n else:\r\n print(prefix_sum_case1[r-1])\r\n else:\r\n if(l>=2):\r\n print(prefix_sum_case2[r-1]-prefix_sum_case2[l-2])\r\n else:\r\n print(prefix_sum_case2[r-1])", "from sys import stdin\r\ndef input(): return stdin.readline().rstrip(\"\\r\\n\")\r\nn = int(input())\r\nv = list(map(int,input().split()))\r\nu = sorted(v)\r\nfor i in range(1,n):\r\n v[i]+=v[i-1]\r\n u[i]+=u[i-1]\r\nm = int(input())\r\nfor i in range(m):\r\n type,l,r = map(int,input().split())\r\n l-=1\r\n r-=1\r\n if type == 1:\r\n if l == 0:\r\n print(v[r])\r\n else:\r\n print(v[r]-v[l-1])\r\n else:\r\n if l == 0:\r\n print(u[r])\r\n else:\r\n print(u[r]-u[l-1])", "n=int(input())\r\nv=[int(i) for i in input().split()]\r\n\r\nm=int(input())\r\n\r\nx=sorted(v)\r\nprefixsum_1=[]\r\nprefixsum_2=[]\r\ns=0\r\nfor i in range(len(x)):\r\n s+=x[i]\r\n prefixsum_2.append(s)\r\n\r\ns=0\r\nfor i in range(len(v)):\r\n s+=v[i]\r\n prefixsum_1.append(s)\r\n\r\nfor i in range(m):\r\n ty,l,r=[int(i) for i in input().split()]\r\n if(ty==1):\r\n if(l!=1):\r\n print(prefixsum_1[r-1]-prefixsum_1[l-2])\r\n else:\r\n #print(prefixsum_1[r-1],prefixsum_1[l-1])\r\n print(prefixsum_1[r-1])\r\n else:\r\n if(l!=1):\r\n print(prefixsum_2[r-1]-prefixsum_2[l-2])\r\n else:\r\n print(prefixsum_2[r-1])", "n = int(input())\r\nv1 = list(map(int,input().split()))\r\nv2 = sorted(v1)\r\nm = len(v1)\r\nsigma1 = [0] * (m + 1)\r\nsigma2 = [0] * (m + 1)\r\nsigma1[1] = v1[0]\r\nsigma2[1] = v2[0]\r\nans = []\r\nfor i in range(2,m + 1):\r\n sigma1[i] = v1[i - 1] + sigma1[i - 1]\r\n sigma2[i] = v2[i - 1] + sigma2[i - 1]\r\nfor _ in range(int(input())):\r\n t,l,r = map(int,input().split())\r\n if t == 1:\r\n ans.append(sigma1[r] - sigma1[l - 1])\r\n else:\r\n ans.append(sigma2[r] - sigma2[l - 1])\r\nprint('\\n'.join(map(str,ans)))", "n = int(input())\r\nv1 = [-10**10] + list(map(int, input().split()))\r\nv2 = sorted(v1)\r\nm = int(input())\r\n\r\npost1 = [0 for _ in range(len(v1))]\r\npost1[1] = v1[1]\r\nfor i in range(2,len(v1)):\r\n post1[i] = post1[i-1] + v1[i]\r\n\r\n\r\npost2 = [0 for _ in range(len(v2))]\r\npost2[1] = v2[1]\r\nfor i in range(2,len(v1)):\r\n post2[i] = post2[i-1] + v2[i]\r\n\r\nfor _ in range(m):\r\n t,l,r = list(map(int, input().split()))\r\n if t == 1:\r\n print(post1[r] - post1[l-1])\r\n if t == 2:\r\n print(post2[r] - post2[l-1])", "n=int(input())\r\na=list(map(int,input().strip().split()))\r\nm=int(input())\r\nb=sorted(a)\r\ndp1=[a[0]]\r\ndp2=[b[0]]\r\nfor i in range(1,n):\r\n dp1.append(dp1[-1]+a[i])\r\n dp2.append(dp2[-1]+b[i])\r\nfor _ in range(m):\r\n t,l,r=map(int,input().split())\r\n if t==1:\r\n if l==1:print(dp1[r-1])\r\n else:print(dp1[r-1]-dp1[l-2])\r\n else:\r\n if l==1:print(dp2[r-1])\r\n else:print(dp2[r-1]-dp2[l-2])\r\n ", "n1 = int(input())\r\nx = input().split()\r\nlist1 = []\r\nfor i in x:\r\n list1.append(int(i))\r\n \r\ndp1 = {}\r\ndp1[0] = list1[0]\r\nfor i in range(1,n1):\r\n dp1[i] = 0\r\n dp1[i] += (dp1[i-1]+list1[i])\r\n\r\nsorted1 = list1.copy()\r\nsorted1.sort()\r\n\r\ndp2 = {}\r\ndp2[0] = sorted1[0]\r\nfor i in range(1,n1):\r\n dp2[i] = 0\r\n dp2[i] += (dp2[i-1]+sorted1[i])\r\ndp1[-1] = 0\r\ndp2[-1] = 0\r\n\r\nn2 = int(input())\r\nlist2 = []\r\nfor i in range(n2):\r\n list2.append(input().split())\r\n\r\nk1 = 0\r\nb1 = False\r\nwhile b1==False:\r\n ref = list2[k1]\r\n type1 = int(ref[0])\r\n l = int(ref[1])-1\r\n r = int(ref[2])-1\r\n if type1 == 1:\r\n print(dp1[r]-dp1[l-1])\r\n else:\r\n print(dp2[r]-dp2[l-1])\r\n k1+=1\r\n if k1==len(list2):\r\n break\r\n \r\n \r\n ", "n = int(input())\r\na = list(map(int, input().split()))\r\nt = int(input())\r\nb = sorted(a)\r\nfor i in range(n-1):\r\n a[i+1] += a[i]\r\n b[i+1] += b[i]\r\na = [0] + a\r\nb = [0] +b\r\nfor i in range(t):\r\n type,l,r=map(int,input().split())\r\n print(b[r]-b[l-1] if type==2 else a[r]-a[l-1])", "n = int(input())\r\nl1=list(map(int,input().split()))\r\nl2=sorted(l1)\r\nrn=[l1[0]]\r\nrs=[l2[0]]\r\nfor x in range(1,n) : \r\n rn.append(rn[-1]+l1[x])\r\n rs.append(rs[-1]+l2[x])\r\nm = int(input())\r\nres=''\r\nfor x in range(m) : \r\n t,r,l=map(int,input().split())\r\n if t==1 :\r\n if r==1:print(rn[l-1])\r\n else:print(rn[l-1]-rn[r-2])\r\n else:\r\n if r==1:print(rs[l-1])\r\n else:print(rs[l-1]-rs[r-2])\r\n ", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Sep 26 16:21:32 2021\r\n\r\n@author: DELL\r\n\"\"\"\r\n\r\nn = int(input())\r\nv = list(map(int,input().split()))\r\nu = sorted(v)\r\nm = int(input())\r\nsumv = [];sumu = []\r\nt1 = 0;t2 = 0\r\nfor i in range(n+1):\r\n sumv.append(t1)\r\n sumu.append(t2)\r\n if i == n:\r\n break\r\n t1 += v[i];t2 += u[i]\r\nfor i in range(m):\r\n ans = 0\r\n t,l,r = map(int,input().split())\r\n if t == 1:\r\n ans = sumv[r] - sumv[l-1]\r\n else:\r\n ans = sumu[r] - sumu[l-1]\r\n print(ans)", "n=int(input())\r\ncosts=list(map(int,input().split()))\r\nsorted_costs=sorted(costs)\r\nfor i in range(1,n):\r\n costs[i]+=costs[i-1]\r\n sorted_costs[i]+=sorted_costs[i-1]\r\nm=int(input())\r\nfor _ in range(m):\r\n type,l,r=map(int,input().split())\r\n if type==1:\r\n if l==1:\r\n print(costs[r-1])\r\n else:\r\n print(costs[r-1]-costs[l-2])\r\n else:\r\n if l==1:\r\n print(sorted_costs[r-1])\r\n else:\r\n print(sorted_costs[r-1]-sorted_costs[l-2])\r\n", "import itertools\r\n\r\nn = int(input())\r\nv = list(map(int, input().split()))\r\nu = v.copy()\r\nu.sort()\r\nvsums = list(itertools.accumulate(v))\r\nusums = list(itertools.accumulate(u))\r\n\r\nfor _ in range(int(input())):\r\n t, l, r = map(int, input().split())\r\n if t == 1:\r\n if l == 1:\r\n print(vsums[r-1])\r\n else:\r\n print(vsums[r-1]-vsums[l-2])\r\n else:\r\n if l == 1:\r\n print(usums[r-1])\r\n else: \r\n print(usums[r-1]-usums[l-2])", "from itertools import accumulate\r\n\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nb = sorted(a)\r\nm = int(input())\r\n\r\nc = [\r\n [0] + list(accumulate(a)),\r\n [0] + list(accumulate(b))\r\n]\r\n\r\nopt = []\r\nfor _ in range(m):\r\n o, l, r = map(int, input().split()) \r\n opt.append(c[o - 1][r] - c[o - 1][l - 1])\r\n\r\nprint('\\n'.join(str(i) for i in opt))", "n = int(input())\nstones = list(map(int, input().split()))\nsuma = [0 for _ in range(n+1)]\nsuma2 = [0 for _ in range(n+1)]\nfor i in range(1, n+1):\n suma[i] = suma[i-1] + stones[i-1]\nstones.sort()\nfor i in range(1, n+1):\n suma2[i] = suma2[i-1] + stones[i-1]\nm = int(input())\nfor i in range(m):\n t, l, r = map(int, input().split())\n print(suma[r]-suma[l-1]) if t == 1 else print(suma2[r]-suma2[l-1])\n\n\t\t\t\t \t\t\t \t \t\t \t \t\t\t \t", "n = int(input())\r\nfirst = list(map(int, input().split()))\r\nsecond = first.copy()\r\nsecond.sort()\r\npref1 = [0]\r\npref2 = [0]\r\nfor i in range(n):\r\n pref1.append(pref1[-1]+first[i])\r\n pref2.append(pref2[-1]+second[i])\r\nfor i in range(int(input())):\r\n t, l, r = map(int, input().split())\r\n if t == 1:\r\n print(pref1[r]-pref1[l-1])\r\n else:\r\n print(pref2[r]-pref2[l-1])", "n=int(input())\narr=list(map(int,input().split()))\nm=int(input())\narr_sort=sorted(arr)\ntemp=0\nfor i in range(n):\n temp+=arr[i]\n arr[i]=temp\ntemp=0\nfor i in range(n):\n temp+=arr_sort[i]\n arr_sort[i]=temp\nfor _ in range(m):\n q,l,r=map(int,input().split())\n if(q==1):\n print(arr[r-1]-(arr[l-2] if l-2>=0 else 0))\n elif(q==2):\n print(arr_sort[r-1]-(arr_sort[l-2] if l-2>=0 else 0))", "n = int(input())\ncosts = list(map(int, input().split()))\ncosts_sorted = sorted(costs)\nm = int(input())\n\nfor i in range(1, len(costs_sorted)):\n costs_sorted[i] += costs_sorted[i - 1]\n\nfor i in range(1, len(costs)):\n costs[i] += costs[i - 1]\n\nfor _ in range(m):\n type, l, r = map(int, input().split())\n if type == 1:\n print(costs[r - 1] - costs[l - 2] if l > 1 else costs[r - 1])\n else:\n print(costs_sorted[r - 1] - costs_sorted[l - 2] if l > 1 else costs_sorted[r - 1])\n\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = [0] * n\r\nb[0] = a[0]\r\nc = [0] * n\r\nfor i in range(1, n):\r\n b[i] = b[i-1] + a[i]\r\nx = sorted(a)\r\nc[0] = x[0]\r\nfor i in range(1, n):\r\n c[i] = c[i-1] + x[i]\r\nm = int(input())\r\nfor i in range(m):\r\n q, r, s = map(int, input().split())\r\n if q == 1:\r\n if r != 1:\r\n print(b[s-1] - b[r-2])\r\n else: print(b[s-1])\r\n elif r != 1:\r\n print(c[s-1] - c[r-2])\r\n else:\r\n print(c[s-1])", "n = int(input())\r\nvi = [0] + list(map(int, input().split()))\r\nui = sorted(vi)\r\nfor i in range(1, n+1):\r\n vi[i] += vi[i-1]\r\n ui[i] += ui[i-1]\r\nfor _ in range(int(input())):\r\n typ, l , r = map(int, input().split())\r\n if typ == 1:\r\n print(vi[r] - vi[l-1])\r\n else:\r\n print(ui[r] - ui[l-1])\r\n \r\n", "import sys\r\nfrom itertools import accumulate\r\ninput = lambda:sys.stdin.readline()\r\n\r\nint_arr = lambda: list(map(int,input().split()))\r\nstr_arr = lambda: list(map(str,input().split()))\r\nget_str = lambda: map(str,input().split())\r\nget_int = lambda: map(int,input().split())\r\nget_flo = lambda: map(float,input().split())\r\n\r\nmod = 1000000007\r\n\r\ndef solve():\r\n pass\r\n\r\n# for _ in range(int(input())):\r\nn = int(input())\r\narr = int_arr()\r\n\r\ndp = [0]+list(accumulate(arr))\r\n\r\narr.sort()\r\n\r\ndp_sorted = [0]+list(accumulate(arr)) \r\n\r\nq = int(input())\r\nfor i in range(q):\r\n t,l,r = get_int()\r\n print(dp[r]-dp[l-1] if t == 1 else dp_sorted[r]-dp_sorted[l-1])\r\n\r\n\r\n\r\n", "a=int(input())\r\nkamni_1=[0]+[int(i) for i in input().split()]\r\nkamni_2=sorted(kamni_1)\r\nfor i in range(1,a+1):\r\n kamni_1[i]+=kamni_1[i-1]\r\n kamni_2[i] += kamni_2[i - 1]\r\nfor _ in range(int(input())):\r\n type_,start,finish=map(int,input().split())\r\n if type_==1:\r\n print(kamni_1[finish]-kamni_1[start-1])\r\n else:\r\n print(kamni_2[finish]-kamni_2[start-1])", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=a.copy()\r\nb.sort()\r\nf,k=[a[0]],[b[0]]\r\ns,p=a[0],b[0]\r\nfor i in range(1,n):\r\n s+=a[i]\r\n p+=b[i]\r\n f.append(s)\r\n k.append(p)\r\nfor p in range(int(input())):\r\n a=list(map(int,input().split()))\r\n if a[0]==1:\r\n if a[1]==1:\r\n print(f[a[2]-1])\r\n else:\r\n print(f[a[2]-1]-f[a[1]-2])\r\n else:\r\n if a[1]==1:\r\n print(k[a[2]-1])\r\n else:\r\n print(k[a[2]-1]-k[a[1]-2])", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nanother = arr.copy()\r\nanother.sort()\r\npref = [0]\r\npref1 = [0]\r\n\r\nfor i in range(n):\r\n pref.append(pref[-1] + arr[i])\r\n pref1.append(pref1[-1] + another[i])\r\n\r\nm = int(input())\r\nfor _ in range(m):\r\n type, l, r = map(int, input().split())\r\n if type == 1:\r\n print(pref[r] - pref[l - 1])\r\n elif type == 2:\r\n print(pref1[r] - pref1[l - 1])\r\n", "n = int(input())\n\nstones_costs = [int(i) for i in input().split(' ')]\n\nreal_cost_sums = [0]\n\nfor stone in stones_costs:\n if len(real_cost_sums) == 0:\n real_cost_sums.append(stone)\n else:\n real_cost_sums.append(real_cost_sums[-1] + stone)\n\nstones_costs.sort()\nsorted_sums = [0]\n\nfor stone in stones_costs:\n if len(sorted_sums) == 0:\n sorted_sums.append(stone)\n else:\n sorted_sums.append(sorted_sums[-1] + stone)\n\n\n\nm = int(input())\n\nresults = []\nfor i in range(m):\n line = input().split(' ')\n l = int(line[1])\n r = int(line[2])\n if line[0] == '1':\n results.append(real_cost_sums[r] - real_cost_sums[l-1])\n else:\n results.append(sorted_sums[r] - sorted_sums[l-1])\n\nfor r in results:\n print(r)\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\nw = list(map(int, input().split()))\r\nq = sorted(w)\r\nc = 0\r\nw1, q1 = [], []\r\nfor i in w:\r\n c += i\r\n w1.append(c)\r\nc = 0\r\nfor i in q:\r\n c += i\r\n q1.append(c)\r\n\r\nfor _ in range(int(input())):\r\n x, a, b = map(int, input().split())\r\n if x == 1:\r\n print(w1[b-1]-(w1[a-2] if a - 2 != -1 else 0))\r\n else:\r\n print(q1[b-1]-(q1[a-2] if a - 2 != -1 else 0))", "n=int(input())\r\ncosts=list(map(int,input().split(\" \")))\r\nm=int(input())\r\nquestions=[]\r\nfor i in range(m):questions.append(list(map(int,input().split(\" \"))))\r\ncostsS=list(costs)\r\ncostsS.sort()\r\nfor i in range(1,len(costsS)):\r\n costs[i]+=costs[i-1]\r\n costsS[i]+=costsS[i-1]\r\nfor i in questions:\r\n res=0\r\n if i[0]==1:\r\n res=costs[i[2]-1]-costs[i[1]-2] if i[1]-2>=0 else costs[i[2]-1]\r\n else:\r\n res=costsS[i[2]-1]-costsS[i[1]-2] if i[1]-2>=0 else costsS[i[2]-1]\r\n print(res)\r\n", "n=int(input())\r\nlst=[int(x) for x in input().split()]\r\nlsts=sorted(lst)\r\nfor i in range(1,n):\r\n lst[i]+=lst[i-1]\r\n lsts[i]+=lsts[i-1]\r\nm=int(input())\r\nfor i in range(m):\r\n t,l,r=map(int,input().split())\r\n if t==1:\r\n if l==1:print(lst[r-1])\r\n else:print(lst[r-1]-lst[l-2])\r\n elif t==2:\r\n if l==1:print(lsts[r-1])\r\n else:print(lsts[r-1]-lsts[l-2])\r\n", "n = int(input())\r\nxs = [int(x) for x in input().split()]\r\n\r\nys = sorted(xs)\r\n\r\n\r\ndef query(ys):\r\n N = len(ys)\r\n dp = [0]*N\r\n for i in range(N):\r\n dp[i] = dp[i-1] + ys[i]\r\n\r\n def _query(lo, hi):\r\n if lo == 0:\r\n return dp[hi]\r\n else:\r\n return dp[hi] - dp[lo-1]\r\n return _query\r\n\r\norig = query(xs)\r\nsort = query(ys)\r\n\r\nm = int(input())\r\nout = []\r\nfor _ in range(m):\r\n t, lo, hi = [int(x) for x in input().split()]\r\n if t == 1:\r\n x = orig(lo-1, hi-1)\r\n else:\r\n x = sort(lo-1, hi-1)\r\n out.append(str(x))\r\n\r\nprint(\"\\n\".join(out))\r\n", "n = int(input())\r\nv = list(map(int, input().split()))\r\nm = int(input())\r\n\r\n# Calculate prefix sum\r\npre1 = [0] * (n + 1)\r\nfor i in range(1, n + 1):\r\n pre1[i] = pre1[i - 1] + v[i - 1]\r\n\r\nv.sort()\r\npre2 = [0] * (n + 1)\r\nfor i in range(1, n + 1):\r\n pre2[i] = pre2[i - 1] + v[i - 1]\r\n\r\n# Answer the queries\r\nfor _ in range(m):\r\n typ, l, r = map(int, input().split())\r\n\r\n if typ == 1:\r\n answer = pre1[r] - pre1[l - 1]\r\n else:\r\n answer = pre2[r] - pre2[l - 1]\r\n\r\n print(answer)", "n=int(input())\r\nl=[0]+list(map(int,input().split()))\r\nl2=sorted(l)\r\nfor i in range(1,n+1):\r\n l[i]=l[i]+l[i-1]\r\n l2[i]=l2[i]+l2[i-1]\r\nfor j in range(int(input())):\r\n a,b,c=map(int,input().split())\r\n if a==2:\r\n print(l2[c]-l2[b-1])\r\n else:\r\n print(l[c]-l[b-1])", "import functools\r\n\r\nn = int(input())\r\nn+=1\r\n\r\ndef cumulative_sum(lst):\r\n for i in range(1, n):\r\n lst[i] = lst[i] + lst[i-1]\r\n return lst\r\n\r\ndef range_sum(lst, s, e):\r\n return lst[e] - lst[s-1] \r\n \r\nelems = [0]\r\ntemp = list(map(int,input().split()))\r\nelems.extend(temp)\r\ntemp = elems.copy()\r\nsummed_elems = cumulative_sum(elems)\r\n\r\nsorted_elems = sorted(temp)\r\n# print(sorted_elems)\r\nsummed_sorted_elems= cumulative_sum(sorted_elems)\r\n\r\nnumber_tests = int(input())\r\n\r\nfor i in range(number_tests):\r\n type, s, e = map(int,input().split())\r\n lst = summed_elems if type == 1 else summed_sorted_elems\r\n print(range_sum(lst,s,e))", "n = int(input())\r\nv = list(map(int, input().split()))\r\n\r\npref1 = [0] * (n + 1)\r\nfor k in range(1, n + 1):\r\n pref1[k] = pref1[k - 1] + v[k - 1]\r\n\r\nv.sort()\r\npref2 = [0] * (n + 1)\r\nfor k in range(1, n + 1):\r\n pref2[k] = pref2[k - 1] + v[k - 1]\r\n\r\nm = int(input())\r\nfor _ in range(m):\r\n type, l, r = map(int, input().split())\r\n if type == 1:\r\n res = pref1[r] - pref1[l - 1]\r\n print(res)\r\n else:\r\n res = pref2[r] - pref2[l - 1]\r\n print(res)\r\n", "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 = int(input())\n v = [int(x) for x in input().split()]\n u = sorted(v)\n vdp = [0] * (n + 1)\n udp = [0] * (n + 1)\n for i in range(1, n + 1):\n vdp[i] = v[i - 1] + vdp[i - 1]\n udp[i] = u[i - 1] + udp[i - 1]\n m = int(input())\n for _ in range(m):\n t, l, r = [int(x) for x in input().split()]\n c = udp if t - 1 else vdp\n print(c[r] - c[l - 1])\n\n\nif __name__ == \"__main__\":\n main()\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\np=sorted(l.copy())\r\nsl=[0]\r\nnsl=[0]\r\nfor i in range(n):\r\n sl.append(sl[-1]+p[i])\r\nfor i in range(n):\r\n nsl.append(nsl[-1]+l[i])\r\nfor _ in range(int(input())):\r\n ty,l,r=map(int,input().split())\r\n if ty==1:\r\n print(nsl[r]-nsl[l-1])\r\n else:\r\n print(sl[r]-sl[l-1])\r\n ", "n = int(input())\r\nprices = [x for x in map(int, input().split())]\r\nordered = sorted(prices)\r\nm = int(input())\r\n\r\npricesC = [prices[i] if i==0 else 0 for i in range(n)]\r\norderedC = [ordered[i] if i==0 else 0 for i in range(n)]\r\n\r\nfor i in range(1,n):\r\n pricesC[i] = prices[i] + pricesC[i-1]\r\n orderedC[i] = ordered[i] + orderedC[i-1]\r\n\r\nfor i in range(m):\r\n flag, l, r = map(int, input().split())\r\n if flag == 1:\r\n if l != 1:\r\n print (pricesC[r-1] - pricesC[l-2])\r\n else:\r\n print (pricesC[r-1])\r\n else:\r\n if l != 1:\r\n print (orderedC[r-1] - orderedC[l-2])\r\n else:\r\n print (orderedC[r-1])", "from itertools import accumulate\r\n\r\n\r\ninput()\r\narr = list(map(int, input().split()))\r\npre_normal = [0] + list(accumulate(arr))\r\narr.sort()\r\npre_sorted = [0] + list(accumulate(arr))\r\nfor _ in range(int(input())):\r\n t, l, r = map(int, input().split())\r\n if t == 1:\r\n print(pre_normal[r] - pre_normal[l - 1])\r\n else:\r\n print(pre_sorted[r] - pre_sorted[l - 1])\r\n", "n = int(input())\r\nv = list(map(int, input().split()))\r\nw = sorted(v)\r\nm = int(input())\r\n\r\n# Calculate prefix sums for both v and w\r\nprefix_sum_v = [0] * (n + 1)\r\nprefix_sum_w = [0] * (n + 1)\r\n\r\nfor i in range(n):\r\n prefix_sum_v[i + 1] = prefix_sum_v[i] + v[i]\r\n prefix_sum_w[i + 1] = prefix_sum_w[i] + w[i]\r\n\r\nfor _ in range(m):\r\n type, l, r = map(int, input().split())\r\n if type == 1:\r\n print(prefix_sum_v[r] - prefix_sum_v[l - 1])\r\n else:\r\n print(prefix_sum_w[r] - prefix_sum_w[l - 1])\r\n", "n = int(input())\n\narr = [int(i) for i in input().split(' ')]\nr = arr.copy()\nsorted_arr = sorted(r)\n#print(sorted_arr)\narr_sol = []\narr_sol.append(arr[0])\n\nfor i in range(1, n):\n k = arr[i] + arr_sol[i-1]\n arr_sol.append(k)\n\n#print(arr_sol)\n\nsorted_arr_sol = []\nsorted_arr_sol.append(sorted_arr[0])\n\nfor i in range(1, n):\n k = sorted_arr_sol[i-1] + sorted_arr[i]\n sorted_arr_sol.append(k)\n\n#print(sorted_arr_sol)\n\nnu = int(input())\n\nfor i in range(nu):\n a, b, c = [(int(i)-1) for i in input().split(' ')]\n #print(a, b, c)\n if a == 0:\n if b == 0:\n print(arr_sol[c])\n else:\n print(arr_sol[c] - arr_sol[b-1])\n else:\n if b == 0:\n print(sorted_arr_sol[c])\n else:\n print(sorted_arr_sol[c] - sorted_arr_sol[b-1])\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nb = sorted(a)\r\npre = [0]*(n+1)\r\ninc = [0]*(n+1)\r\n\r\nfor i in range(1,n+1):\r\n\tpre[i] = pre[i-1] + a[i-1]\r\n\tinc[i] = inc[i-1] + b[i-1]\r\n\r\nm = int(input())\r\n\r\nfor i in range(m):\r\n\tt,l,r = map(int,input().split())\r\n\tif t == 2:\r\n\t\tprint(inc[r]-inc[l-1])\r\n\telse :\r\n\t\tprint(pre[r]-pre[l-1])\r\n", "n = int(input())\r\nv = list(map(int, input().split()))\r\nvs = sorted(v)\r\npref_v = [0]\r\npref_vs = [0]\r\nfor i in range(n):\r\n pref_v.append(pref_v[-1] + v[i])\r\n pref_vs.append(pref_vs[-1] + vs[i])\r\n# print(pref_v, pref_vs)\r\nm = int(input())\r\nfor _ in range(m):\r\n tp, l, r = map(int, input().split())\r\n if tp == 1:\r\n print(pref_v[r] - pref_v[l-1])\r\n else:\r\n print(pref_vs[r] - pref_vs[l-1])\r\n", "'''\r\nfrom segment_tree import SegmentTree\r\n\r\nn = int(input())\r\nll = list(map(int, input().split()))\r\nt = ll.copy()\r\nt.sort()\r\nl1 = SegmentTree(ll)\r\nt1 = SegmentTree(t)\r\nq = int(input())\r\nfor i in range(q):\r\n ty, a, b = map(int, input().split())\r\n if ty == 1:\r\n print(l1.query(a-1, b-1, \"sum\"))\r\n else:\r\n print(t1.query(a-1, b-1, \"sum\"))\r\n'''\r\n\r\nn = int(input())\r\nll = list(map(int, input().split()))\r\nt = ll.copy()\r\nt.sort()\r\ns1 = [0]\r\nfor i in range(n):\r\n s1.append(s1[-1] + ll[i])\r\ns2 = [0]\r\nfor i in range(n):\r\n s2.append(s2[-1] + t[i])\r\nq = int(input())\r\nfor i in range(q):\r\n ty, a, b = map(int, input().split())\r\n if ty == 1:\r\n x = s1[b] - s1[a-1]\r\n print(x)\r\n else:\r\n x = s2[b] - s2[a-1]\r\n print(x)\r\n", "n = int(input())\ncosts = [int(x) for x in input().split()]\nm = int(input())\n\nsomacum = [0]\nsortcum = [0]\n\nfor i in range(n):\n somacum.append(somacum[i] + costs[i])\n\ncosts.sort()\n\nfor i in range(n):\n sortcum.append(sortcum[i] + costs[i])\n\n\nfor i in range(m):\n t,l,r = [int(x) for x in input().split()]\n\n if t == 1:\n print(somacum[r] - somacum[l - 1])\n \n elif t == 2:\n print(sortcum[r] - sortcum[l - 1])\n\n", "n = int(input())\n\nV = list(map(int, input().split()))\nV_sorted = sorted(V)\n\nprefix_1 = [0 for _ in range(n+1)]\nprefix_2 = [0 for _ in range(n+1)]\n\nfor i in range(1, n+1):\n prefix_1[i] = prefix_1[i-1] + V[i-1]\n prefix_2[i] = prefix_2[i-1] + V_sorted[i-1]\n\nm = int(input())\nfor _ in range(m):\n t, l, r = map(int, input().split())\n if t == 1:\n print(prefix_1[r] - prefix_1[l-1])\n else:\n print(prefix_2[r] - prefix_2[l-1])\n", "n=int(input())\r\nv=list(map(int,input().split()))\r\nu=sorted(v)\r\nm=int(input())\r\nfor i in range(1,len(v),1):\r\n v[i]+=v[i-1]\r\n u[i]+=u[i-1]\r\nv.insert(0,0)\r\nu.insert(0,0)\r\nfor j in range(m):\r\n type,l,r=map(int,input().split())\r\n sm=0\r\n if type ==1:\r\n sm=v[r]-v[l-1]\r\n else:\r\n sm = u[r] - u[l - 1]\r\n print(sm)\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\nv = list(map(int,input().split()))\r\nu = sorted(v)\r\nv_pre = [0]\r\nu_pre = [0]\r\nfor i in range(n):\r\n v_pre.append(v_pre[i]+v[i])\r\n u_pre.append(u_pre[i]+u[i])\r\n\r\nm = int(input())\r\nfor _ in range(m):\r\n t, l, r = map(int, input().split())\r\n if t==1:\r\n print(v_pre[r]-v_pre[l-1])\r\n else:\r\n print(u_pre[r]-u_pre[l-1])\r\n", "n = int(input())\nstones_costs = list(map(int, input().split()))\n\npartial_sum = []\ns = 0\nfor i in range(0, n):\n s += stones_costs[i]\n partial_sum.append(s)\n\nsorted_array = sorted(stones_costs)\npartial_sum2 = []\ns2 = 0\nfor i in range(0,n):\n s2 += sorted_array[i]\n partial_sum2.append(s2)\n\n\nm = int(input())\nfor i in range(m):\n q = list(map(int, input().split()))\n if (q[0] == 1):\n if (q[1] == 1):\n total_sum = partial_sum[q[2] - 1]\n else:\n total_sum = partial_sum[q[2] - 1] - partial_sum[q[1] - 2]\n print(total_sum)\n else:\n if (q[1] == 1):\n total_sum = partial_sum2[q[2] - 1]\n else:\n total_sum = partial_sum2[q[2] - 1] - partial_sum2[q[1] - 2]\n print(total_sum)\n \t \t\t\t \t\t \t \t\t \t \t\t\t \t", "n = int(input());\n \nv = [];\ns = [];\nfor word in input().split():\n nr = int(word);\n v.append(nr);\n s.append(nr);\n \ns.sort();\n \npsv = [0]*n;\npss = [0]*n;\n \nfor i in range(n):\n if (i == 0):\n psv[0] = v[0];\n pss[0] = s[0];\n else:\n psv[i] = psv[i-1] + v[i];\n pss[i] = pss[i-1] + s[i];\n \nq = int(input())\n \nfor i in range(q):\n z = [];\n for word in input().split():\n z.append(int(word));\n \n z[1] -= 1;\n z[2] -= 1;\n \n if (z[0] == 1):\n answer = psv[z[2]]-psv[z[1]] + v[z[1]];\n else:\n answer = pss[z[2]]-pss[z[1]] + s[z[1]];\n \n print(answer);\n\t\t\t\t \t\t\t \t\t\t \t \t \t\t\t\t \t\t\t \t", "# Username: maheshraju2020\r\n\r\nimport heapq\r\nfrom bisect import bisect_left, bisect_right\r\nfrom collections import Counter, deque\r\nfrom itertools import combinations, permutations\r\nfrom math import ceil, gcd, sqrt\r\nfrom sys import setrecursionlimit, stdin, stdout\r\n\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\nsetrecursionlimit(100000)\r\nmod = 1000000007\r\n\r\nn = ii1()\r\narr = iia()\r\narr_sum = [0]\r\nfor i in arr:\r\n arr_sum.append(i+arr_sum[-1])\r\nsorted_arr = sorted(arr)\r\nsorted_arr_sum = [0]\r\nfor i in sorted_arr:\r\n sorted_arr_sum.append(i+sorted_arr_sum[-1])\r\n\r\nm = ii1()\r\nfor i in range(m):\r\n t, l,r = iia()\r\n if t == 1:\r\n print(arr_sum[r]-arr_sum[l-1])\r\n else:\r\n print(sorted_arr_sum[r]-sorted_arr_sum[l-1])\r\n ", "#from collections import accumulate \r\nfrom itertools import accumulate\r\nn = int(input())\r\na = list(map(int,input().split()))\r\na1 = list(accumulate(a))\r\na.sort()\r\na2 = list(accumulate(a))\r\nm = int(input())\r\nfor _ in range(m):\r\n typ,l,r = map(int,input().split())\r\n if typ == 1:\r\n print(a1[r-1]-a1[l-2] if l>=2 else a1[r-1])\r\n else:\r\n print(a2[r-1]-a2[l-2] if l>=2 else a2[r-1])\r\n ", "n = int(input())\r\nls = list(map(int, input().split()))\r\nls_ = sorted(ls)\r\nm = int(input())\r\n\r\ns = 0\r\nsufsum = []\r\nsufsum.append(s)\r\nfor elem in reversed(ls):\r\n s += elem\r\n sufsum.append(s)\r\n\r\ns_ = 0\r\nsufsum_ = []\r\nsufsum_.append(s_)\r\nfor elem in reversed(ls_):\r\n s_ += elem\r\n sufsum_.append(s_)\r\n \r\nfor i in range(m):\r\n t, l, r = list(map(int, input().split()))\r\n if t == 1:\r\n print(sufsum[n-l+1] - sufsum[n-r])\r\n elif t == 2:\r\n print(sufsum_[n-l+1] - sufsum_[n-r])\r\n", "input()\r\na=list(map(int,input().split()))\r\nfor1=[]\r\nlast=0\r\nfor i in a:\r\n for1.append(i+last)\r\n last=last+i\r\na=sorted(a)\r\nlast=0\r\nfor2=[]\r\nfor i in a:\r\n for2.append(i+last)\r\n last=last+i\r\n#print(for1,for2)\r\nc=int(input())\r\nfor i in range(c):\r\n x,y,z=list(map(int,input().split()))\r\n if x==1:\r\n if y==1:\r\n print(for1[z-1])\r\n else:\r\n print(for1[z-1]-for1[y-2])\r\n elif x==2:\r\n if y==1:\r\n print(for2[z-1])\r\n else:\r\n print(for2[z-1]-for2[y-2])", "\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nn = int(input())\r\nv = list(map(int, input().split()))\r\nx = sorted(v)\r\n\r\n# Compute prefix sums for both v and x\r\nprefix_sum_v = [0] * (n + 1)\r\nprefix_sum_x = [0] * (n + 1)\r\n\r\nfor i in range(n):\r\n prefix_sum_v[i + 1] = prefix_sum_v[i] + v[i]\r\n prefix_sum_x[i + 1] = prefix_sum_x[i] + x[i]\r\n\r\nm = int(input())\r\nqueries = []\r\n\r\nfor _ in range(m):\r\n queries.append(list(map(int, input().split())))\r\n\r\nres = []\r\nfor q in queries:\r\n if q[0] == 1:\r\n res.append(prefix_sum_v[q[2]] - prefix_sum_v[q[1] - 1])\r\n elif q[0] == 2:\r\n res.append(prefix_sum_x[q[2]] - prefix_sum_x[q[1] - 1])\r\n\r\nfor r in res:\r\n print(r)\r\n", "import sys,math\r\n\r\nn=int(sys.stdin.readline())\r\ncost=list(map(int,sys.stdin.readline().split()))\r\nm=int(sys.stdin.readline())\r\n#######\r\n# Storing\r\n# cost.insert(0,0)\r\n# print(cost)\r\nans1=cost.copy()\r\nans1.insert(0,0)\r\nans2=cost.copy()\r\nans2.sort()\r\nans2.insert(0,0)\r\n# answer one\r\n# print(ans2)\r\n# print(ans1,ans2)\r\nfor i in range(1,n+1):\r\n ans1[i]+=ans1[i-1]\r\n ans2[i]+=ans2[i-1]\r\n# print(ans1,ans2)\r\n\r\nfor i in range(m):\r\n q,l,r=map(int,sys.stdin.readline().split())\r\n if q==1:\r\n print(ans1[r]-ans1[l-1])\r\n elif q==2:\r\n print(ans2[r]-ans2[l-1])", "import itertools\r\nn = int(input())\r\nlst = list(map(int, input().split()))\r\nlst2 = lst.copy()\r\nlst2.sort()\r\nq = int(input())\r\nprefix1 = list(itertools.accumulate(lst, initial=0))\r\nprefix2 = list(itertools.accumulate(lst2, initial=0))\r\nfor _ in range(q):\r\n x, a, b = map(int, input().split())\r\n if (x == 1): print(prefix1[b] - prefix1[a - 1])\r\n else: print(prefix2[b] - prefix2[a - 1])\r\n", "n = int(input())\ns = list(map(int, input().split()))\nm = int(input())\n\ns1 = sorted(s)\nsa = list()\nsa1 = list()\nx = 0\ny = 0\n\nfor i in range(n):\n x += s[i]\n y += s1[i]\n sa.append(x)\n sa1.append(y)\n\nfor q in range(m):\n type, l, r = list(map(int, input().split()))\n if type == 1:\n if l == 1:\n print(sa[r-1])\n else:\n print(sa[r-1] - sa[l-2])\n else:\n if l == 1:\n print(sa1[r-1])\n else:\n print(sa1[r-1] - sa1[l-2])\n \t \t\t \t\t\t\t\t\t\t\t \t \t\t\t \t \t\t", "from itertools import accumulate\r\ndef solve(n, v, typ, l, r):\r\n if typ == 1:\r\n return sumv[r] - sumv[l - 1]\r\n if typ == 2:\r\n return sumu[r] - sumu[l - 1]\r\n\r\n# print(solve(6, [0, 6, 4, 2, 7, 2, 7], 1, 1, 6))\r\n\r\nn = int(input())\r\nv = list(map(int, input().split()))\r\nm = int(input())\r\nsumv = [0] + [*accumulate(v)]\r\nsumu = [0] + [*accumulate(sorted(v))]\r\nfor i in range(m):\r\n typ, l, r = map(int, input().split())\r\n print(solve(n, v, typ, l, r))\r\n", "n=int(input())\r\nbase_array = []\r\nbase_array=[0]+list(map(int,input().split()))\r\nSorted=sorted(base_array)\r\nfor i in range(1,n+1):\r\n base_array[i] += base_array[i-1]\r\n Sorted[i] += Sorted[i-1]\r\nfor i in range(int(input())):\r\n t,l,r=map(int,input().split())\r\n if t == 1:\r\n print(base_array[r]-base_array[l-1])\r\n else:\r\n print(Sorted[r]-Sorted[l-1])\r\n", "\r\ndef main():\r\n n = int(fin())\r\n *v, = map(int, fin().split())\r\n m = int(fin())\r\n\r\n p1, p2 = [0]*(n+1), [0]*(n+1)\r\n for i in range(1, n+1):\r\n p1[i] = p1[i-1]+v[i-1]\r\n\r\n v.sort()\r\n for i in range(1, n+1):\r\n p2[i] = p2[i-1]+v[i-1]\r\n\r\n for i in range(m):\r\n tp, l, r = map(int, fin().split())\r\n\r\n fout(p1[r]-p1[l-1]) if tp == 1 else fout(p2[r]-p2[l-1])\r\n\r\n# FastIO\r\nfrom sys import stdin, stdout\r\ndef fin(): return stdin.readline().strip(\"\\r\\n\")\r\ndef fout(s=\"\", end=\"\\n\"): return stdout.write(str(s)+end)\r\nif __name__ == \"__main__\":\r\n t = 1 or int(fin())\r\n for i in range(t): main()\r\n", "n = int(input())\r\ncost = [int(x) for x in input().split()[:n]]\r\nm = int(input())\r\n\r\nsorted_cost = sorted(cost)\r\n\r\na = 0\r\nsum_cost = []\r\nsum_sorted_cost = []\r\nsum_sorted_cost.append(0)\r\nsum_cost.append(0)\r\nfor i in cost:\r\n a += i\r\n sum_cost.append(a)\r\na = 0\r\nfor i in sorted_cost:\r\n a += i \r\n sum_sorted_cost.append(a)\r\n\r\n\r\nfor i in range(m):\r\n type, l, r = map(int, input().split())\r\n \r\n if type == 1:\r\n print(sum_cost[r]-sum_cost[l-1])\r\n else:\r\n print(sum_sorted_cost[r]-sum_sorted_cost[l-1])\r\n", "def main():\r\n n = int(input())\r\n arr = list(map(int, input().split()))\r\n \r\n presum_arr1 = [0]\r\n for i in range(n):\r\n presum_arr1.append(presum_arr1[-1] + arr[i])\r\n \r\n arr.sort()\r\n presum_arr2 = [0]\r\n for i in range(n):\r\n presum_arr2.append(presum_arr2[-1] + arr[i])\r\n\r\n for _ in range(int(input())):\r\n type, l, r = list(map(int, input().split()))\r\n\r\n if type == 1:\r\n print(presum_arr1[r] - presum_arr1[l - 1])\r\n else:\r\n print(presum_arr2[r] - presum_arr2[l - 1])\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\ncost=arr[:]\r\ncost.sort()\r\nm=int(input())\r\ncases=[]\r\nfor i in range(m):\r\n cases.append(list(map(int,input().split())))\r\ncumar=[]\r\ncumco=[]\r\nc=0\r\nx=0\r\nfor i in range(n):\r\n c+=arr[i]\r\n cumar.append(c)\r\n x+=cost[i]\r\n cumco.append(x)\r\n \r\nfor i in cases:\r\n t=i[0]\r\n l=i[1]-1\r\n r=i[2]-1\r\n if t==1:\r\n if l==0:\r\n print(cumar[r])\r\n else:\r\n print(cumar[r]-cumar[l-1])\r\n else:\r\n if l==0:\r\n print(cumco[r])\r\n else:\r\n print(cumco[r]-cumco[l-1])\r\n \r\n\r\n\r\n ", "n = int(input())\nstones = list(map(int, input().split()))\nq = int(input())\n\nsorted_stones = stones.copy()\nsorted_stones.sort()\n\nfor i in range(n-1):\n stones[i+1] += stones[i]\n sorted_stones[i+1] += sorted_stones[i]\n\nfor _ in range(q):\n t, l, r = map(int, input().split())\n l -= 2\n r -= 1\n if t == 1:\n print(stones[r] if l < 0 else stones[r] - stones[l])\n else:\n print(sorted_stones[r] if l < 0 else sorted_stones[r] - sorted_stones[l])\n\n \t \t \t \t\t \t \t \t\t\t \t \t", "def perfix_sum(l):\r\n perfix = []\r\n perfix.append(l[0])\r\n for i in range(1, len(l)):\r\n perfix.append(perfix[i - 1] + l[i])\r\n return perfix\r\nn = int(input())\r\nns = [int(i) for i in input().split()]\r\nm = int(input())\r\nns_sorted = sorted(ns)\r\np = perfix_sum(ns)\r\np_sorted = perfix_sum(ns_sorted)\r\nfor i in range(m):\r\n q, l, r = [int(i) for i in input().split()]\r\n l -= 1\r\n r -= 1\r\n if q == 1:\r\n if l == 0:\r\n print(p[r])\r\n else:\r\n print(p[r] - p[l-1])\r\n\r\n elif q == 2:\r\n if l == 0:\r\n print(p_sorted[r])\r\n else:\r\n print(p_sorted[r] - p_sorted[l-1])\r\n\r\n\r\n", "n = int(input()) \r\nstones = list(map(int, input().split())) \r\nprefix_sum = [0] * ( n + 1) \r\nprefix_sum_sorted = [0] * (n + 1) \r\nstones_sorted = sorted(stones) \r\nfor i in range(n):\r\n prefix_sum[i + 1] = prefix_sum[i] + stones[i] \r\n prefix_sum_sorted[i + 1] = prefix_sum_sorted[i] + stones_sorted[i] \r\nm = int(input())\r\nfor i in range(m):\r\n t, l , r = list(map(int,input().split())) \r\n if t == 1:\r\n print(prefix_sum[r] - prefix_sum[l -1]) \r\n else:\r\n print(prefix_sum_sorted[r] - prefix_sum_sorted[l- 1]) \r\n", "n = int(input())\r\nstones = list(map(int, input().split()))\r\nsorted_stones = sorted(stones)\r\nfor idx in range(1, n):\r\n stones[idx] = stones[idx-1] + stones[idx]\r\n sorted_stones[idx] = sorted_stones[idx-1] + sorted_stones[idx]\r\nm = int(input())\r\nfor _ in range(m):\r\n type, l, r = map(int, input().split())\r\n if type == 1:\r\n print(stones[r-1] - stones[l-2] if l-2 >= 0 else stones[r-1])\r\n else:\r\n print(sorted_stones[r-1] - sorted_stones[l-2] if l-2 >= 0 else sorted_stones[r-1])", "n = int(input())\r\nV = list(map(int, input().split()))\r\nm = int(input())\r\nQ = [list(map(int, input().split())) for _ in range(m)]\r\n\r\nC1 = [0]\r\nfor v in V:\r\n C1.append(C1[-1] + v)\r\n \r\nV.sort()\r\nC2 = [0]\r\nfor v in V:\r\n C2.append(C2[-1] + v)\r\n\r\nfor t, l, r in Q:\r\n if t == 1:\r\n print(C1[r] - C1[l-1])\r\n else:\r\n print(C2[r] - C2[l-1])", "n = int(input())\r\nv = list(map(int, input().split()))\r\n\r\nv_prefix = [0] * (len(v) + 1)\r\nfor i in range(1, len(v)+1):\r\n v_prefix[i] = v_prefix[i-1] + v[i-1]\r\n#print(v_prefix)\r\n\r\nv.sort()\r\n\r\nu_prefix = [0] * (len(v) + 1)\r\nfor i in range(1, len(v)+1):\r\n u_prefix[i] = u_prefix[i-1] + v[i-1]\r\n#print(u_prefix) \r\n\r\nm = int(input())\r\nfor _ in range(m):\r\n type, l, r = map(int, input().split())\r\n \r\n if type == 1:\r\n print(v_prefix[r] - v_prefix[l-1])\r\n elif type == 2:\r\n print(u_prefix[r] - u_prefix[l-1])\r\n\r\n \r\n\r\n\r\n", "# https://codeforces.com/problemset/problem/433/B\n\nfrom itertools import accumulate\n\ninput()\nvalues = [int(s) for s in input().split(\" \")]\nvalues_sorted = sorted(values)\nqueries = int(input())\n\nprefix = list(accumulate([0] + values))\nprefix_sorted = list(accumulate([0] + values_sorted))\n\n\ndef handle() -> int:\n query_type, left, right = input().split(\" \")\n left = int(left)\n right = int(right)\n\n if query_type == \"1\":\n return prefix[right] - prefix[left - 1]\n return prefix_sorted[right] - prefix_sorted[left - 1]\n\n\nfor _ in range(queries):\n print(handle())\n", "import math\r\nimport string\r\n\r\ndef main_function():\r\n n = int(input())\r\n a = [int(i) for i in input().split(\" \")]\r\n g = a.copy()\r\n m = int(input())\r\n ops = []\r\n for i in range(m):\r\n ops.append([int(i) for i in input().split(\" \")])\r\n ans = []\r\n b = []\r\n starter = 0\r\n for i in a:\r\n starter += i\r\n b.append(starter)\r\n starter = 0\r\n a.sort()\r\n b_sorted = []\r\n for i in a:\r\n starter += i\r\n b_sorted.append(starter)\r\n for s, l, r in ops:\r\n if s == 1:\r\n listy = b\r\n listy_2 = g\r\n else:\r\n listy = b_sorted\r\n listy_2 = a\r\n ans.append(listy[r - 1] - listy[l - 1] + listy_2[l - 1])\r\n for i in ans:\r\n print(i)\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()", "def solve():\r\n n = int(input())\r\n stones = [int(x) for x in input().split(\" \", n)]\r\n total1 = [0] * (len(stones) + 1)\r\n for i in range(1, len(stones) + 1):\r\n total1[i] = stones[i - 1] + total1[i - 1]\r\n total2 = [0] * (len(stones) + 1)\r\n stones.sort()\r\n for i in range(1, len(stones) + 1):\r\n total2[i] = stones[i - 1] + total2[i - 1]\r\n m = int(input())\r\n for i in range(m):\r\n x = [int(x) for x in input().split(\" \", 3)]\r\n if x[0] == 1:\r\n print(total1[x[2]] - total1[x[1] - 1])\r\n else:\r\n print(total2[x[2]] - total2[x[1] - 1])\r\n\r\n\r\nsolve()\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nlst=sorted(l)\r\nfor i in range(1,n):\r\n l[i]+=l[i-1]\r\nfor i in range(1,n):\r\n lst[i]+=lst[i-1]\r\nfor _ in range(int(input())):\r\n c,a,b=map(int,input().split())\r\n if(c==1):\r\n if(a==1):\r\n print(l[b-1])\r\n else:\r\n print(l[b-1]-l[a-2])\r\n else:\r\n if(a==1):\r\n print(lst[b-1])\r\n else:\r\n print(lst[b-1]-lst[a-2])\r\n ", "arr_size = int(input())\n\narr = [0] + [int(x) for x in input().split()]\n\nsorted_arr = arr[:]\nsorted_arr.sort()\n\nfor i in range(1,arr_size+1):\n arr[i] += arr[i-1]\n sorted_arr[i] += sorted_arr[i-1]\n\nn_tasks = int(input())\n\nfor _ in range(n_tasks):\n quest, l, r = map(int, input().split())\n\n if quest == 1:\n print(arr[r]-arr[l-1])\n else:\n print(sorted_arr[r] - sorted_arr[l-1])\n \t\t\t\t \t \t\t \t \t \t \t\t\t\t\t\t \t \t\t", "a = int(input())\n\nb = [0] + list(map(int,input().split()))\n\nc = b.copy()\nc.sort()\n\nfor i in range(1,a+1):\n b[i] += b[i-1]\n c[i] += c[i-1]\n\nfor _ in range(int(input())):\n x,y,z = map(int,input().split())\n if x == 1:\n print(b[z]-b[y-1])\n else:\n print(c[z]-c[y-1])\n\n \t\t\t\t\t \t \t\t \t\t \t \t\t\t\t \t\t", "n = int(input())\r\nlst = []\r\nvn = list(map(int,input().split()))\r\nv2 = sorted(vn)\r\n\r\nfor i in range(1,n):\r\n vn[i] += vn[i-1]\r\n v2[i] += v2[i-1]\r\nvn.insert(0,0)\r\nv2.insert(0,0)\r\nfor i in range(int(input())):\r\n a,b,c = map(int,(input().split()))\r\n if a == 1: lst.append(vn[c]-vn[b-1])\r\n else: lst.append(v2[c]-v2[b-1])\r\nfor i in lst: print(i)", "n=int(input())\r\nlistm=list(map(int,input().split())) \r\nm=int(input())\r\nprefixsum=[0]\r\nfor i in range(n):\r\n prefixsum.append(prefixsum[-1]+listm[i])\r\nlistm.sort()\r\nsprefixsum=[0]\r\nfor i in range(n):\r\n sprefixsum.append(sprefixsum[-1]+listm[i])\r\nfor _ in range(m):\r\n totsum=0\r\n t,l,r=map(int,input().split())\r\n if t==1:\r\n print(prefixsum[r]-prefixsum[l-1])\r\n else:\r\n print(sprefixsum[r]-sprefixsum[l-1])\r\n\r\n", "n = int(input())\r\nstones = list(map(int, input().split()))\r\nm = int(input())\r\nqueries = [list(map(int, input().split())) for _ in range(m)]\r\n\r\nsorted_stones = sorted(stones)\r\n\r\nprefix_sum = [0] + stones[:]\r\nfor i in range(1, n + 1):\r\n prefix_sum[i] += prefix_sum[i - 1]\r\n\r\nprefix_sum_sorted = [0] + sorted_stones[:]\r\nfor i in range(1, n + 1):\r\n prefix_sum_sorted[i] += prefix_sum_sorted[i - 1]\r\n\r\nfor query in queries:\r\n t, l, r = query\r\n if t == 1:\r\n print(prefix_sum[r] - prefix_sum[l - 1])\r\n else:\r\n print(prefix_sum_sorted[r] - prefix_sum_sorted[l - 1])", "\"\"\"\r\nhttp://codeforces.com/contest/433/problem/B\r\n\"\"\"\r\n\r\n\r\ndef get_prefix_arr(array):\r\n prefix_arr = []\r\n for i in range(len(array)):\r\n prefix_arr.append(array[i] if i == 0 else array[i] + prefix_arr[i - 1])\r\n return prefix_arr\r\n\r\n\r\ndef sum_range(pre_arr, i, j):\r\n if i == 0:\r\n return pre_arr[j]\r\n return pre_arr[j] - pre_arr[i - 1]\r\n\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n s = input()\r\n arr = [int(i) for i in s.split()]\r\n arr_sorted = sorted(arr)\r\n\r\n arr = get_prefix_arr(arr)\r\n arr_sorted = get_prefix_arr(arr_sorted)\r\n q = int(input())\r\n for i in range(q):\r\n s = input().split()\r\n query = [int(i) for i in s]\r\n t = query[0]\r\n l, r = query[1] - 1, query[2] - 1\r\n if t == 1:\r\n print(sum_range(arr, l, r))\r\n else:\r\n print(sum_range(arr_sorted, l, r))\r\n", "n = int(input())\r\nm = list(map(int,input().split()))\r\nt = int(input())\r\na = [0]*n\r\nb = [0]*n\r\ntemp= 0\r\nfor i in range(n):\r\n temp = temp+m[i]\r\n a[i] = temp\r\nm.sort()\r\ntemp = 0\r\nfor i in range(n):\r\n temp = temp+m[i]\r\n b[i] = temp\r\nfor i in range(t):\r\n typ,l,r = map(int,input().split())\r\n if typ == 1:\r\n if l ==1:\r\n print(a[r-1])\r\n else:\r\n print(a[r-1]-a[l-2])\r\n elif typ == 2:\r\n if l == 1:\r\n print(b[r-1])\r\n else:\r\n print(b[r-1]-b[l-2])\r\n \r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\n\r\n\r\n \r\ndef stones(n,n_list, n_list_sorted, cum_n_list, cum_n_list_sorted, m_list):\r\n i, l, r = m_list[0], m_list[1], m_list[2]\r\n if i==1:\r\n if l == 1:\r\n return cum_n_list[r-1]\r\n return cum_n_list[r-1]-cum_n_list[l-2]\r\n else:\r\n if l==1:\r\n return cum_n_list_sorted[r-1]\r\n return cum_n_list_sorted[r-1]-cum_n_list_sorted[l-2]\r\n \r\nn = inp()\r\nn_list = inlt()\r\nm = inp()\r\n\r\nn_list_sorted = sorted(n_list)\r\ncum_n_list = []\r\ncum_n_list_sorted = []\r\nfor i in range(0,n):\r\n if i==0:\r\n cum_n_list.append(n_list[0])\r\n cum_n_list_sorted.append(n_list_sorted[0])\r\n else:\r\n cum_n_list.append(n_list[i]+cum_n_list[i-1])\r\n cum_n_list_sorted.append(n_list_sorted[i]+cum_n_list_sorted[i-1])\r\n\r\nm_list_of_list = []\r\nfor i in range(0,m):\r\n m_list_of_list.append(inlt())\r\nfor i in range(0, m):\r\n print(stones(n,n_list, n_list_sorted, cum_n_list, cum_n_list_sorted, m_list_of_list[i]))\r\n ", "import sys,random,bisect\r\nfrom collections import deque,defaultdict\r\nfrom heapq import heapify,heappop,heappush\r\n#from math import gcd\r\nmod = int(1e9 + 7)\r\ninf = int(1e20)\r\ninput = lambda :sys.stdin.readline().rstrip()\r\nmi = lambda :map(int,input().split())\r\nli = lambda :list(mi())\r\nii = lambda :int(input())\r\npy = lambda :print(\"YES\")\r\npn = lambda :print(\"NO\")\r\n\r\n\r\nn=ii()\r\n\r\narr=li()\r\n\r\np1=[0]\r\nfor a in arr:\r\n p1.append(p1[-1]+a)\r\np2=[0]\r\narr.sort()\r\nfor a in arr:\r\n p2.append(p2[-1]+a)\r\n\r\nm=ii()\r\nfor _ in range(m):\r\n s,l,r=li()\r\n if s==1:\r\n print(p1[r]-p1[l-1])\r\n else:\r\n print(p2[r]-p2[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\n", "quantidade = int(input())\nnumeros = input()\nnumeros = numeros.split()\nespecial = []\nsomaOrdem = [0]\natual = 0\nsoma = [0]\nordenado = 0\nfinal = 0\nfor b in range(len(numeros)):\n numeros[b] = int(numeros[b])\n atual += numeros[b]\n soma.append(atual)\n especial.append(int(numeros[b]))\n\n\n\nperguntas = int(input())\nespecial.sort()\n\nfor c in range(len(especial)):\n ordenado += especial[c]\n somaOrdem.append(ordenado)\n\n\n\nfor a in range(perguntas): \n perguntaAtual = input()\n perguntaAtual = perguntaAtual.split()\n\n if int(perguntaAtual[0]) == 1:\n \n final = soma[int(perguntaAtual[2])]-soma[int(perguntaAtual[1])-1]\n \n else:\n final = somaOrdem[int(perguntaAtual[2])]-somaOrdem[int(perguntaAtual[1])-1]\n \n \n \n print(final)\n\n\n \t \t\t\t\t \t\t\t\t\t \t \t\t \t", "n=int(input())\r\nnums=list(map(int,input().split()))\r\npre1=[0]\r\nfor i in range(n):\r\n pre1.append(pre1[-1]+nums[i])\r\npre2=[0]\r\nnums.sort()\r\nfor i in range(n):\r\n pre2.append(pre2[-1]+nums[i])\r\nm=int(input())\r\nfor i in range(m):\r\n t,l,r=map(int,input().split())\r\n if t==1:\r\n print(pre1[r]-pre1[l-1])\r\n else:\r\n print(pre2[r]-pre2[l-1])", "n=int(input())\r\nv=list(map(int,input().split()))\r\npv=[0]*(n+1)\r\nfor i in range(n):pv[i+1]=pv[i]+v[i]\r\nw=sorted(v)\r\npw=[0]*(n+1)\r\nfor i in range(n):pw[i+1]=pw[i]+w[i]\r\nm=int(input())\r\nfor _ in range(m):\r\n op,l,r=map(int,input().split())\r\n if op==1:\r\n print(pv[r]-pv[l-1])\r\n if op==2:\r\n print(pw[r]-pw[l-1])", "n = int(input())\r\nvs = list(map(int, input().split()))\r\nus = sorted(vs)\r\ncumvs = [0]\r\nfor v in vs:\r\n cumvs.append(cumvs[-1]+v)\r\ncumus = [0]\r\nfor u in us:\r\n cumus.append(cumus[-1]+u)\r\n \r\nm = int(input())\r\nfor _ in range(m):\r\n t, l, r = map(int, input().split())\r\n arr = cumvs if t == 1 else cumus\r\n print(arr[r] - arr[l-1])\r\n \r\n", "n=int(input())\r\nv=list(map(int,input().split()))\r\nm=int(input())\r\nu=sorted(v)\r\nv1=[v[0]]\r\nu1=[u[0]]\r\nfor i in range(1,n):\r\n v1.append(v[i]+v1[i-1])\r\n u1.append(u[i]+u1[i-1])\r\nv1.append(0)\r\nu1.append(0)\r\nv1=sorted(v1)\r\nu1=sorted(u1)\r\nfor i in range(m):\r\n typ,l,r=map(int,input().split())\r\n if typ==1:\r\n print(v1[r]-v1[l-1])\r\n else:\r\n print(u1[r]-u1[l-1])\r\n \r\n", "# m, n = map(lambda v: int(v), input().split())\r\n# n = int(input())\r\n\r\ndef pref_sum(a):\r\n li = [0,a[0]]\r\n for i in range(1, len(a)): li.append(li[i]+a[i])\r\n return li\r\n\r\nn = int(input())\r\na = list(map(lambda v: int(v), input().split()))\r\nasp = pref_sum(sorted(a))\r\nap = pref_sum(a)\r\n\r\n# print(ap)\r\n\r\nti=int(input())\r\n\r\nfor t in range(ti):\r\n typ,l,r=map(lambda v: int(v), input().split())\r\n if typ==1: print(ap[r]-ap[l-1])\r\n else: print(asp[r]-asp[l-1])\r\n\r\n\r\n\r\n\r\n\r\n", "n=int(input())\r\ns=list(map(int,input().split()))\r\ns=[0]+s\r\nq=s[:]\r\nq.sort()\r\nfor i in range(1,len(q)):\r\n q[i]+=q[i-1]\r\n s[i]+=s[i-1]\r\nfor _ in range(int(input())):\r\n type,l,r=map(int,input().split())\r\n if type==1:\r\n print(s[r]-s[l-1])\r\n else:\r\n print(q[r]-q[l-1])", "n = int(input());\nentrada = input().split(\" \");\npedras = [int(x) for x in entrada];\npedrasOrdenadas = pedras.copy();\npedrasOrdenadas.sort();\n\naux = [0];\nauxOrdenadas = [0];\n\nquest = int(input());\ntipos = [];\nesquerda = [];\ndireita = [];\nfor x in range(quest):\n tipo, l, r = input().split(\" \");\n tipos.append(int(tipo));\n esquerda.append(int(l)-1);\n direita.append(int(r)-1);\n\nfor x in range(n):\n aux.append(aux[x] + pedras[x]);\n auxOrdenadas.append(auxOrdenadas[x] + pedrasOrdenadas[x]);\n\nfor x in range(quest):\n if(tipos[x] == 1):\n soma = aux[direita[x]+1] - aux[esquerda[x]];\n print(soma);\n else:\n soma = auxOrdenadas[direita[x]+1] - auxOrdenadas[esquerda[x]];\n print(soma);\n\n\t\t \t \t\t \t \t\t\t \t \t\t\t \t \t \t", "from itertools import accumulate\n\nn = int(input())\nv = list(map(int, input().split()))\ntype1 = [0] + list(accumulate(v))\ntype2 = [0] + list(accumulate(sorted(v)))\n\nm = int(input())\nfor _ in range(m):\n t, l, r = map(int, input().split())\n if t == 1:\n print(type1[r] - type1[l-1])\n else:\n print(type2[r] - type2[l-1])", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=sorted(a)\r\nfor i in range(1,n):\r\n a[i]+=a[i-1]\r\n b[i]+=b[i-1]\r\nm=int(input())\r\nfor i in range(m):\r\n q,l,r=map(int,input().split())\r\n if q==2:\r\n ans= b[r-1]\r\n if l >1:\r\n ans-= b[l-2]\r\n else:\r\n ans= a[r-1]\r\n if l >1:\r\n ans-= a[l-2]\r\n print(ans)\r\n", "import time\nimport sys\nimport math\ndef get_primes(n):\n sieve = [True] * n\n for i in range(3,int(n**0.5)+1,2):\n if sieve[i]:\n sieve[i*i::2*i]=[False]*((n-i*i-1)//(2*i)+1)\n return [2] + [i for i in range(3,n,2) if sieve[i]]\nfrom bisect import bisect, bisect_left, bisect_right, insort, insort_left, insort_right\nfrom functools import reduce\ndef factors(n):\n return set(reduce(list.__add__,([i, n//i] for i in range(1, int(n**0.5) + 1) if n % i == 0)))\ninput = sys.stdin.readline\nmod, infi = 1000000007, sys.maxsize\nfrom collections import deque, Counter, defaultdict as dd\nfrom heapq import heappop, heappush, heapify\nfrom itertools import accumulate\nfrom functools import lru_cache, reduce\nfrom operator import mul, add, sub, truediv, floordiv, lt, le, eq, ne, gt, xor, concat, getitem, pow, lshift\ninty =lambda: int(input())\nstringy =lambda: input().strip()\nnormal =lambda: input().split()\nmappy =lambda: map(int,input().strip().split())\nfmappy =lambda: map(float,input().strip().split())\nlisty =lambda: list(map(int,input().strip().split()))\n#sys.setrecursionlimit(10**6)\ntick =lambda: time.perf_counter()\nlogg =lambda a, b: math.log2(a) / math.log2(b)\nacc =lambda x: list(accumulate(x))\nsign =lambda x, y: x >= 0 and y >= 0 or x < 0 and y < 0\n\nclass Fenwick_Tree(object):\n def __init__(self, freq):\n self.arr = freq\n self.n = len(freq)\n \n def get_sum(self, bit_tree, i):\n s = 0\n i = i+1\n while i > 0:\n s += bit_tree[i]\n i -= i & (-i) \n return s \n \n def update_bit(self, bit_tree, i, v):\n i += 1\n while i <= self.n:\n bit_tree[i] += v\n i += i & (-i) \n \n \n def construct(self):\n bit_tree = [0]*(self.n+1)\n for i in range(self.n):\n self.update_bit(bit_tree, i, self.arr[i])\n return bit_tree \n\nn = inty()\narr = listy()\nf1 = Fenwick_Tree(arr)\ntree1 = f1.construct()\nq = inty()\narr.sort()\nf2 = Fenwick_Tree(arr)\ntree2 = f2.construct()\nwhile q:\n a, l, r = mappy()\n l, r = l - 1, r - 1\n if a == 1:\n print(f1.get_sum(tree1, r) - f1.get_sum(tree1, l - 1))\n else:\n print(f2.get_sum(tree2, r) - f2.get_sum(tree2, l - 1))\n q -= 1", "n = int(input())\r\n\r\nv = list(map(int, input().split()))\r\n\r\ns = sorted(v)\r\n\r\npref1 = [0] * (n + 1)\r\npref2 = [0] * (n + 1)\r\n\r\nfor i in range(n):\r\n pref1[i] = pref1[i - 1] + v[i]\r\n pref2[i] = pref2[i - 1] + s[i]\r\n\r\nq = int(input())\r\n\r\nwhile q != 0:\r\n t, l, r = map(int, input().split())\r\n l -= 1\r\n r -= 1\r\n\r\n if t == 1:\r\n if l == 0 and r == n - 1:\r\n print(pref1[r])\r\n else:\r\n print(pref1[r] - pref1[l - 1])\r\n\r\n else:\r\n if l == 0 and r == n - 1:\r\n print(pref2[r])\r\n else:\r\n print(pref2[r] - pref2[l - 1])\r\n\r\n q -= 1\r\n", "from collections import defaultdict, Counter\nimport itertools as it\nimport random as rand\nimport math\n\nn = int(input())\na = list(map(int, input().split()))\n\nb = [x for x in a]\nb.sort()\n\nps1 = [0]\nps2 = [0]\nfor i in range(n):\n ps1.append( ps1[i]+a[i] )\n ps2.append( ps2[i]+b[i] )\n\nm = int(input())\nans = []\nfor _ in range(m):\n t, l, r = map(int, input().split())\n if t == 1:\n ans.append(ps1[r]-ps1[l-1])\n else:\n ans.append(ps2[r]-ps2[l-1])\n\nfor s in ans:\n print(s)", "n =int(input())\r\n\r\nv = list(map(int, input().split()))\r\n\r\np = [0] * (n)\r\np1= [0] * (n)\r\nl1= [0] * (n)\r\nfor i in range(n):\r\n p[i] = p[i - 1] + v[i]\r\n l1[i]=v[i] \r\nv.sort()\r\n\r\n\r\nfor i in range(n):\r\n p1[i] = p1[i - 1] + v[i]\r\n\r\nm =int(input())\r\nfor i in range(m):\r\n ans=0\r\n t,l,r= map(int, input().split())\r\n l-=1\r\n r-=1\r\n if t==1:\r\n print(p[r]-p[l]+l1[l])\r\n else:\r\n print(p1[r]-p1[l]+v[l])\r\n ", "n = int(input())\narray = list(map(int,input().split())) #6 4 2 7 2 7\nsort_array = sorted(array) #2 2 4 6 7 7\nsum = 0\nsum_s = 0\n#prefix for unsorted\nprefix_li = [0] # 0 6 10 12 19 21 28\nfor i in array:\n sum+=i\n prefix_li.append(sum)\n\n#prefix for sorted\nsortedPrefix_li = [0] #0 2 4 8 14 21 28\nfor i in sort_array:\n sum_s+=i\n sortedPrefix_li.append(sum_s)\n\nfor _ in range(int(input())):\n type,l,r = map(int,input().split()) #2, 3, 6\n if type == 1:\n updateL = prefix_li[l-1]\n updateR = prefix_li[r]\n print(updateR - updateL)\n else:\n updateL = sortedPrefix_li[l-1]\n updateR = sortedPrefix_li[r]\n print(updateR - updateL)\n\t\t\t \t\t \t\t\t\t \t\t \t\t\t\t\t\t\t\t \t\t\t\t", "# import bisect\r\n\r\n\r\n# input()\r\n# x=list(map(int,input().split()))\r\n# l=[]\r\n# for _ in range(int(input())):\r\n# l.append(int(input()))\r\n# 6 4 2 7 2 7\r\n# 2 2 4 6 7 7 \r\n# x.sort()\r\n# # return 0\r\n# for c in l: \r\n# res=bisect.bisect_right(x,c)\r\n# print(res)\r\n# # left,right=0,len(x)-1\r\n# # res=0\r\n# # if c>=x[-1]:\r\n# # res=len(x)\r\n# # print(res)\r\n# # continue\r\n \r\n# # while left<=right:\r\n# # mid=left+(right-left)//2\r\n# # if x[mid]==c: \r\n# # res=mid+1\r\n# # break\r\n# # elif x[mid]>c:\r\n# # res=s(mid,left)\r\n# # break\r\n# # else:\r\n# # left=mid+1\r\n# # if res==750:\r\n# # print(751)\r\n# # else:\r\n# # print(res)\r\n# # 3 6 8 10 11\r\n\r\n# # 5\r\n# # 3 10 8 6 11\r\n# # 4\r\n# # 1\r\n# # 10\r\n# # 24\r\n# # 11\r\n\r\n# # 5\r\n# # 868 987 714 168 123\r\n# # 10\r\n# # 424\r\n# # 192\r\n# # 795\r\n# # 873\r\n# # 117\r\n# # 914\r\n# # 735\r\n# # 158\r\n# # 631\r\n# # 471\r\n\r\ninput()\r\nx=list(map(int,input().split()))\r\ny=sorted(x)\r\nl=[]\r\nsums=[0] \r\nfor b in x: \r\n sums.append(sums[-1]+b)\r\nl=[0] \r\nfor b in y: \r\n l.append(l[-1]+b)\r\nsums=sums[1:]\r\nl=l[1:] \r\nfor _ in range(int(input())):\r\n a,b,c=list(map(int,input().split()))\r\n b=b-1\r\n c=c-1\r\n if a==2:\r\n if b==0:\r\n print(l[c])\r\n else:\r\n print(l[c]-l[b-1])\r\n else:\r\n if b==0:\r\n print(sums[c])\r\n else:\r\n print(sums[c]-sums[b-1])\r\n\r\n# 6\r\n# 6 4 2 7 2 7\r\n# 3\r\n# 2 3 6\r\n# 1 3 4\r\n# 1 1 6", "from itertools import accumulate\r\nn= int(input())\r\narr=list(map(int, input().split()))\r\n\r\nm= int(input())\r\na=sorted(arr)\r\nb= [i for i in accumulate(a)]\r\nc= [i for i in accumulate(arr)]\r\n\r\n# print(b, \"\\n\", c)\r\nfor i in range(m):\r\n type, l, r = map(int, input().split())\r\n l = l-1\r\n r= r-1\r\n if type==2:\r\n print(b[r]-b[l]+a[l])\r\n else:\r\n print(c[r]-c[l]+arr[l])\r\n", "n = int(input())\r\nv = [0]+[int(x) for x in input().split()]\r\nu = v.copy()\r\nu.sort()\r\nfor i in range(1,n+1):\r\n v[i]+=v[i-1]\r\n u[i]+=u[i-1]\r\nm = int(input())\r\nfor _ in range(m):\r\n t, l, r = [int(x) for x in input().split()]\r\n if t==1:\r\n print(v[r]-v[l-1])\r\n else:\r\n print(u[r]-u[l-1])\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\n\r\na_sort = sorted(a)\r\n\r\na.insert(0, 0)\r\nfor i in range(1, n+1):\r\n a[i] += a[i-1]\r\na_sort.insert(0, 0)\r\nfor i in range(1, n+1):\r\n a_sort[i] += a_sort[i-1]\r\n\r\nfor _ in range(int(input())):\r\n qType, l, r = map(int,input().split())\r\n if qType == 1:\r\n print(a[r] - a[l-1])\r\n else:\r\n print(a_sort[r] - a_sort[l-1])", "n=int(input())\r\nv=list(map(int,input().split()))\r\nk=v.copy()\r\nk.sort()\r\nk1=[0]*(n+1)\r\nv1=[0]*(n+1)\r\nfor i in range(1,n+1):\r\n if i==1:\r\n k1[i]=k[i-1]\r\n elif i>1:\r\n k1[i] = k1[i-1]+k[i-1]\r\nfor i in range(1,n+1):\r\n if i==1:\r\n v1[i]=v[i-1]\r\n elif i>1:\r\n v1[i] = v1[i-1]+v[i-1]\r\nm=int(input())\r\nfor i in range(m):\r\n t,l,r=map(int,input().split())\r\n if t==1:\r\n print(v1[r]-v1[l-1])\r\n else:\r\n print(k1[r]-k1[l-1])", "n = int(input())\r\narr = list(map(int, input().split()))\r\nprefix1 = [0]\r\nprefix2 = [0]\r\nfor i in range(n):\r\n prefix1.append(prefix1[-1] + arr[i])\r\narr.sort()\r\nfor i in range(n):\r\n prefix2.append(prefix2[-1] + arr[i])\r\n\r\nfor i in range(int(input())):\r\n t, l, r = map(int, input().split())\r\n if t == 1:\r\n print(prefix1[r] - prefix1[l-1])\r\n else:\r\n print(prefix2[r] - prefix2[l - 1])", "n=int(input().strip())\r\na=list(map(int,input().strip().split()))\r\nb=sorted(a)\r\npa=[0]\r\npb=[0]\r\nfor i in range(n):\r\n pa.append(pa[-1]+a[i])\r\nfor i in range(n):\r\n pb.append(pb[-1]+b[i])\r\nm=int(input().strip())\r\nfor i in range(m):\r\n c,l,r=list(map(int,input().strip().split()))\r\n if c==1:\r\n print(pa[r]-pa[l-1])\r\n else:\r\n print(pb[r]-pb[l-1])", "from sys import stdin\r\n\r\ndef add(arr,l,r):\r\n l-=1\r\n r-=1\r\n if l==0:\r\n return arr[r]\r\n \r\n return arr[r]-arr[l-1]\r\n\r\nn = int(stdin.readline().strip())\r\narr = list(map(int,stdin.readline().strip().split()))\r\n\r\nsorted_arr = sorted(arr)\r\n\r\ncum_sorted_arr = [0]*n\r\ncum_arr = [0]*n\r\n\r\ncum_arr[0] = arr[0]\r\ncum_sorted_arr[0] = sorted_arr[0]\r\n\r\nfor i in range(1,n):\r\n cum_arr[i] = cum_arr[i-1]+arr[i]\r\n cum_sorted_arr[i] = cum_sorted_arr[i-1]+sorted_arr[i]\r\n \r\nq = int(stdin.readline().strip())\r\nwhile q:\r\n ty,l,r = map(int,stdin.readline().strip().split())\r\n if ty==1:\r\n print(add(cum_arr,l,r))\r\n else:\r\n print(add(cum_sorted_arr,l,r))\r\n q-=1", "n = int(input())\r\nv = list(map(int, input().split()))\r\nu = sorted(v)\r\nfor i in range(0, n - 1):\r\n v[i + 1] += v[i]\r\n u[i + 1] += u[i]\r\nv = [0] + v\r\nu = [0] + u\r\nfor i in range(0, int(input())):\r\n ty, l, r = map(int, input().split())\r\n if ty == 1:\r\n print(v[r] - v[l - 1])\r\n else:\r\n print(u[r] - u[l - 1])", "def solve_queries(n, v, m, queries):\r\n sorted_v = sorted(v)\r\n prefix_sum_original = [0] * (n + 1)\r\n prefix_sum_sorted = [0] * (n + 1)\r\n\r\n for i in range(n):\r\n prefix_sum_original[i + 1] = prefix_sum_original[i] + v[i]\r\n prefix_sum_sorted[i + 1] = prefix_sum_sorted[i] + sorted_v[i]\r\n\r\n answers = []\r\n for query in queries:\r\n type_, l, r = query\r\n if type_ == 1:\r\n # Answer the first type of query\r\n answer = prefix_sum_original[r] - prefix_sum_original[l - 1]\r\n answers.append(answer)\r\n else:\r\n # Answer the second type of query\r\n answer = prefix_sum_sorted[r] - prefix_sum_sorted[l - 1]\r\n answers.append(answer)\r\n\r\n return answers\r\n\r\n# Input\r\nn = int(input())\r\nv = list(map(int, input().split()))\r\nm = int(input())\r\nqueries = [list(map(int, input().split())) for _ in range(m)]\r\n\r\n# Solve queries and print answers\r\nanswers = solve_queries(n, v, m, queries)\r\nfor answer in answers:\r\n print(answer)\r\n", "n = int(input())\r\nv = list(map(int, input().split()))\r\nu = v.copy()\r\nu.sort()\r\na = [0]\r\nb = [0]\r\nfor i in range(n):\r\n a.append(a[i]+v[i])\r\n b.append(b[i]+u[i])\r\nfor _ in range(int(input())):\r\n t,l,r = map(int, input().split())\r\n if t ==1:\r\n print(a[r]-a[l-1])\r\n else:\r\n print(b[r]-b[l-1])", "if __name__ == '__main__':\r\n n = int(input())\r\n v = list(map(int, input().split()))\r\n vHelp = [0] * (len(v) + 1)\r\n vHelp[0] = v[0]\r\n for i in range(1, len(v)):\r\n vHelp[i] = vHelp[i - 1] + v[i]\r\n\r\n sortedV = sorted(v)\r\n sortedVHelp = [0] * (len(sortedV) + 1)\r\n sortedVHelp[0] = sortedV[0]\r\n for i in range(1, len(sortedV)):\r\n sortedVHelp[i] = sortedVHelp[i - 1] + sortedV[i]\r\n\r\n m = int(input())\r\n for _ in range(m):\r\n type, l, r = map(int, input().split())\r\n if type == 1:\r\n print(vHelp[r - 1] - vHelp[l - 2])\r\n else:\r\n print(sortedVHelp[r - 1] - sortedVHelp[l - 2])\r\n", "n = int(input())\r\n\r\narr = [int(i) for i in input().split()]\r\n\r\nsrt = sorted(arr)\r\n\r\nfor i in range(1, len(arr)):\r\n arr[i] += arr[i-1]\r\nfor i in range(1, len(srt)):\r\n srt[i] += srt[i-1]\r\n\r\nm = int(input())\r\n\r\ndef fun():\r\n t, l, r = [int(i) for i in input().split()]\r\n res = 0\r\n if t == 1:\r\n res += arr[r-1]\r\n if l - 2 >= 0:\r\n res -= arr[l-2]\r\n return res\r\n else:\r\n res += srt[r-1]\r\n if l - 2 >= 0:\r\n res -= srt[l-2]\r\n return res\r\n\r\n\r\nfor i in range(m):\r\n print(fun())", "n = int(input())\r\na = [0] + list(map(int, input().split()))\r\nb = a.copy()\r\nb.sort()\r\nfor i in range(1, n + 1):\r\n\ta[i] += a[i - 1]\r\n\tb[i] += b[i - 1]\r\nT = int(input())\r\nfor _ in range(T):\r\n\tt, l, r = map(int, input().split())\r\n\tif t == 1:\r\n\t\tprint(a[r] - a[l - 1])\r\n\telif t == 2:\r\n\t\tprint(b[r] - b[l - 1])", "n=int(input())\r\nv=list(map(int,input().split()))\r\nv=[0]+v\r\nu=sorted(v)\r\nfor i in range(1,n+1):\r\n v[i] += v[i-1]\r\n u[i] += u[i-1]\r\nfor i in range(int(input())):\r\n t,l,r=map(int,input().split())\r\n if t == 1:\r\n print(v[r]-v[l-1])\r\n else:\r\n print(u[r]-u[l-1])", "n = int(input())\nvs = [int(x) for x in input().split()]\nv = [0]*n\nv[0] = vs[0]\nfor i in range(1, n):\n v[i] = vs[i] + v[i-1]\n\nvsSorted = sorted(vs)\ncheaps = [0]*n\nfor i in range(1, n):\n cheaps[i] = vsSorted[i] + cheaps[i-1]\n\nm = int(input())\nfor _ in range(m):\n type, l, r = map(int, input().split())\n l -= 1\n r -= 1\n total = 0\n\n if type == 1:\n total = v[r] - v[l] + vs[l]\n else:\n total = cheaps[r] - cheaps[l] + vsSorted[l]\n\n print(total)", "arrLen = int(input())\nstrArr = input().split()\narr = []\nsortedArr = []\nacumArr = [0]\nacumSor = [0]\nfor x in strArr:\n arr.append(int(x))\n sortedArr.append(int(x))\n acumArr.append(0)\n acumSor.append(0)\nsortedArr.sort()\n\nfor i in range(1, arrLen+1):\n acumArr[i] = acumArr[i-1] + arr[i-1]\n acumSor[i] = acumSor[i-1] + sortedArr[i-1]\n\nnumQ = int(input())\n\nfor _ in range(numQ):\n res = input().split()\n ans = 0\n selectedArr = []\n t, l, r = int(res[0]), int(res[1]), int(res[2])\n if t == 1:\n selectedArr = acumArr\n else:\n selectedArr = acumSor\n ans = selectedArr[r]-selectedArr[l-1]\n print(ans)\n \t\t \t\t\t\t \t \t \t\t \t \t \t\t", "n=int(input())\r\nl1=list(map(int,input().split()))\r\nl2=sorted(l1)\r\nprel1=[0]\r\nprel2=[0]\r\ns1=0\r\nfor i in l1:\r\n s1+=i\r\n prel1.append(s1)\r\ns1=0\r\nfor i in l2:\r\n s1+=i\r\n prel2.append(s1)\r\nfor Pythonic__Python in range(int(input())):\r\n t,l,r=map(int,input().split())\r\n if(t==1):\r\n print(prel1[r]-prel1[l-1])\r\n else:\r\n print(prel2[r]-prel2[l-1])", "n = int(input())\nx = list(map(int,input().strip().split()))[:n]\ny = int(input())\n\nAcU = [0]*n\nAcS = [0]*n\nAcU[0]=x[0]\n\nfor i in range (1,n):\n AcU[i] = AcU[i-1] + x[i]\n\nx.sort()\n\nAcS[0] = x[0]\n\nfor i in range (1,n):\n AcS[i] = AcS[i-1] + x[i]\n\nfor i in range(y):\n p = list(map(int,input().strip().split()))[:3]\n\n if p[0] == 1:\n a = p[1]-1\n b = p[2]-1\n \n if a == 0:\n print(AcU[b])\n \n else:\n print(AcU[b]-AcU[a-1])\n \n else:\n a = p[1]-1\n b = p[2]-1\n \n if a == 0:\n print(AcS[b])\n \n else:\n print(AcS[b]-AcS[a-1])\n \t \t \t \t \t \t \t\t\t \t\t \t\t\t \t\t", "n = int(input().strip())\nnormal_v = list(map(int, input().strip().split()))\nsorted_v = sorted(normal_v)\n\nprefix_sum_normal = [0] * (n + 1)\nprefix_sum_sorted = [0] * (n + 1)\n\nfor i in range(n):\n prefix_sum_normal[i + 1] = prefix_sum_normal[i] + normal_v[i]\n prefix_sum_sorted[i + 1] = prefix_sum_sorted[i] + sorted_v[i]\n\nm = int(input().strip())\n\nfor i in range(m):\n type, l, r = map(int, input().strip().split())\n if type == 1:\n print(prefix_sum_normal[r] - prefix_sum_normal[l - 1])\n else:\n print(prefix_sum_sorted[r] - prefix_sum_sorted[l - 1])\n\t\t\t\t \t\t \t\t\t \t\t \t \t\t\t \t\t \t\t", "n =int(input())\r\nl = list(map(int,input().split()))\r\nssl = [0]\r\nsl = [0]\r\nc = 0 \r\nfor i in range (n):\r\n c += l[i]\r\n sl.append(c)\r\nl = sorted(l)\r\nc = 0\r\nfor j in range (n):\r\n c += l[j]\r\n ssl.append(c)\r\n\r\n\r\nn =int(input())\r\nfor i in range (n):\r\n t,l,r = map(int,input().split())\r\n if t == 1:\r\n d = sl[r]-sl[l-1]\r\n print(d)\r\n else:\r\n d = ssl[r]-ssl[l-1]\r\n print(d)", "n = int(input())\r\nnumbers = input().split()\r\ncurrentArray = []\r\nfor i in range(len(numbers)):\r\n currentArray.append(int(numbers[i]))\r\n\r\nsortedArray = sorted(currentArray)\r\nprefixSum = []\r\nprefixSumSorted = []\r\ncurrentSum = 0\r\nfor num in currentArray:\r\n currentSum += num\r\n prefixSum.append(currentSum)\r\n\r\ncurrentSum = 0\r\n\r\nfor num in sortedArray:\r\n currentSum += num\r\n prefixSumSorted.append(currentSum)\r\nm = int(input())\r\nresult = []\r\nfor i in range(m):\r\n currentInput = input().split()\r\n type = int(currentInput[0])\r\n leftBound = int(currentInput[1]) - 1\r\n rightBound = int(currentInput[2]) - 1\r\n array = prefixSum if type == 1 else prefixSumSorted\r\n toBeSearched = currentArray if type == 1 else sortedArray\r\n result.append((array[rightBound] + toBeSearched[leftBound]) - array[leftBound]);\r\n\r\nfor res in result:\r\n print(res) ", "n = int(input())\r\nsl = list(map(int, input().split()))\r\nssl = sorted(sl)\r\nslp = []\r\nfor i in range(len(sl)):\r\n if i == 0:\r\n slp.append(sl[0])\r\n else:\r\n slp.append( slp[i-1] + sl[i] )\r\nsslp = []\r\nfor j in range(len(ssl)):\r\n if j == 0:\r\n sslp.append(ssl[0])\r\n else:\r\n sslp.append( sslp[j-1] + ssl[j] )\r\nfor k in range(int(input())):\r\n t, l, r = map(int, input().split())\r\n if t==1:\r\n if l==1:\r\n print(slp[r-1])\r\n else:\r\n print(slp[r-1]-slp[l-2])\r\n else:\r\n if l==1:\r\n print(sslp[r-1])\r\n else:\r\n print(sslp[r-1]-sslp[l-2])", " \r\ndef main():\r\n \r\n # Inputs\r\n n = int( input() )\r\n stones = [0] + [ int(stone) for stone in input().split(\" \")]\r\n m = int( input() )\r\n queries = [-1]*m\r\n for i in range(m):\r\n queries[i] = [ int(stone) for stone in input().split(\" \")] \r\n \r\n # Initialize the dp Array amd the necessary values\r\n sortedStones = sorted( stones )\r\n dpArr1 = [-1]*(n+1)\r\n dpArr1[0] = stones[0]\r\n \r\n dpArr2 = [-1]*(n+1)\r\n dpArr2[0] = sortedStones[0]\r\n \r\n # calculating dpArr\r\n for i in range(1, n+1):\r\n dpArr1[i] = dpArr1[i-1] + stones[i]\r\n dpArr2[i] = dpArr2[i-1] + sortedStones[i]\r\n \r\n # print(\"dp arrs\")\r\n # print(dpArr1)\r\n # print(dpArr2)\r\n \r\n for i in range(m):\r\n if queries[ i ][ 0 ] == 1:\r\n # print(\"testind dp1\")\r\n # print( queries[ i ][ 1 ], queries[ i ][ 2 ], dpArr1[ queries[ i ][ 2 ] ], dpArr1[ queries[ i ][ 1 ] ] )\r\n print( dpArr1[ queries[ i ][ 2 ] ] - dpArr1[ queries[ i ][ 1 ] - 1 ] )\r\n else:\r\n # print('testing dp2')\r\n # print( queries[ i ][ 1 ], queries[ i ][ 2 ], dpArr2[ queries[ i ][ 2 ] ], dpArr2[ queries[ i ][ 1 ] ] )\r\n print( dpArr2[ queries[ i ][ 2 ] ] - dpArr2[ queries[ i ][ 1 ] - 1 ] )\r\n\r\n \r\n\r\nif __name__ == \"__main__\":\r\n main()", "def prefixSum(test_list):\r\n res = [0]*len(test_list)\r\n res[0] = test_list[0]\r\n for i in range(1, len(test_list)):\r\n res[i] = res[i-1] + test_list[i]\r\n\r\n return res\r\n\r\nn = int(input())\r\nvi = [int(x) for x in input().split()]\r\nm = int(input())\r\npre1 = prefixSum(vi)\r\npre2 = prefixSum(sorted(vi))\r\nresults = []\r\nfor i in range(m):\r\n t,l,r = map(int,input().split())\r\n test = []\r\n if t == 1:\r\n test = pre1\r\n else:\r\n test = pre2\r\n if l != 1:\r\n result = test[r - 1] - test[l - 2]\r\n else:\r\n result = test[r - 1]\r\n\r\n results.append(result)\r\n\r\nfor r in results:\r\n print(r)", "n = int(input())\nstones = [0] + list(map(int,input().split()))\ns_stones = sorted(stones)\nanss = []\nfor i in range(1,n+1):\n stones[i] +=stones[i-1]\nfor i in range(1,n+1):\n s_stones[i] +=s_stones[i-1]\nfor j in range(int(input())):\n type,a,b = map(int,input().split())\n if type == 1:\n anss.append(stones[b]-stones[a-1])\n else :\n anss.append(s_stones[b]-s_stones[a-1])\n \n[print(r) for r in anss]", "import sys\ninput = sys.stdin.readline\n\nn = int(input())\nv = list(map(int, input().split()))\na = sorted(v)\nfor i in range(1, n):\n v[i] += v[i-1]\nfor i in range(1, n):\n a[i] += a[i-1]\n\nq = int(input())\nwhile q:\n q -= 1\n type, l, r = map(int, input().split())\n if type == 1:\n if l-2 >= 0:\n print(v[r-1] - v[l-2])\n else:\n print(v[r-1])\n else:\n if l-2 >= 0:\n print(a[r-1] - a[l-2])\n else:\n print(a[r-1])\n \t \t \t \t\t\t\t\t \t \t\t\t\t \t\t", "# Problem Link: https://codeforces.com/problemset/problem/433/B\r\n# Problem Status:\r\n# ------------------------------- SEPARATOR -------------------------------\r\ndef TheAmazingFunction(H, Array: list):\r\n # ----------------------------\r\n sumArray = []\r\n for i in range(len(Array)):\r\n sumArray.append(0)\r\n sumArray[-1] = Array[-1]\r\n for i in range(len(Array)-2, -1, -1):\r\n sumArray[i] = sumArray[i+1] + Array[i]\r\n # ----------------------------\r\n sortedArray = Array.copy()\r\n sortedArray.sort()\r\n sortedSumArray = []\r\n for i in range(len(sortedArray)):\r\n sortedSumArray.append(0)\r\n sortedSumArray[-1] = sortedArray[-1]\r\n for i in range(len(sortedArray)-2, -1, -1):\r\n sortedSumArray[i] = sortedSumArray[i+1] + sortedArray[i]\r\n # ----------------------------\r\n while H > 0:\r\n H -= 1\r\n T, L, R = list(map(int, input().split()))\r\n L -= 1\r\n R -= 1\r\n if T == 1:\r\n print(sumArray[L] - sumArray[R] + Array[R])\r\n else:\r\n print(sortedSumArray[L] - sortedSumArray[R] + sortedArray[R])\r\n\r\n\r\n# ------------------------------- SEPARATOR -------------------------------\r\nN = int(input())\r\nA = list(map(int, input().split()))\r\nM = int(input())\r\nTheAmazingFunction(M, A)\r\n# ------------------------------- SEPARATOR -------------------------------\r\n", "n = int(input())\r\nv = list(map(int, input().split()))\r\nw = v.copy()\r\nw.sort()\r\nvp, wp = [0], [0]\r\nfor i in range(n):\r\n vp.append(vp[i] + v[i])\r\n wp.append(wp[i] + w[i])\r\nm = int(input())\r\nfor i in range(m):\r\n t, l, r = map(int, input().split())\r\n if t == 1:\r\n print(vp[r] - vp[l - 1])\r\n else:\r\n print(wp[r] - wp[l - 1])\r\n", "n = int(input())\nlst = list(map(int, input().split()))\nl1 = []\nfor i in range(n):\n if i == 0:\n l1.append(lst[0])\n else:\n l1.append(l1[i-1] + lst[i])\nlst.sort()\nl2 = []\nfor i in range(n):\n if i == 0:\n l2.append(lst[0])\n else:\n l2.append(l2[i-1] + lst[i])\nfor i in range(int(input())):\n t,l,r = map(int, input().split())\n if t == 1:\n if l == 1:\n print(l1[r-1])\n else:\n print(l1[r-1] - l1[l-2])\n else:\n if l == 1:\n print(l2[r-1])\n else:\n print(l2[r-1] - l2[l-2])\n \t \t\t\t \t \t \t \t \t \t \t\t \t \t\t", "n = int(input())\r\nls = input().split(\" \")\r\ncost = [int(i) for i in ls]\r\nprefs = [cost[0]]\r\nfor i in range(1,n):\r\n prefs.append(prefs[-1] + cost[i])\r\nsorted_cost = sorted(cost)\r\nprefss = [sorted_cost[0]]\r\nfor i in range(1,n):\r\n prefss.append(prefss[-1] + sorted_cost[i])\r\nm = int(input())\r\nquest = []\r\nfor i in range(m):\r\n ls = input().split(\" \")\r\n typ = int(ls[0])\r\n l = int(ls[1])-1\r\n r = int(ls[2])-1\r\n quest.append((typ, l , r))\r\n\r\nfor i in range(m):\r\n typ = quest[i][0]\r\n l = quest[i][1]\r\n r = quest[i][2]\r\n if(typ == 1):\r\n print(prefs[r]-prefs[l]+cost[l])\r\n else:\r\n print(prefss[r]-prefss[l]+sorted_cost[l])", "import sys\r\nimport math\r\nimport bisect\r\nfrom sys import stdin, stdout\r\nfrom math import gcd, floor, sqrt, log\r\nfrom collections import defaultdict as dd\r\nfrom bisect import bisect_left as bl, bisect_right as br\r\nfrom collections import Counter\r\nfrom collections import defaultdict as dd\r\n\r\n# sys.setrecursionlimit(100000000)\r\n\r\nflush = lambda: stdout.flush()\r\nstdstr = lambda: stdin.readline()\r\nstdint = lambda: int(stdin.readline())\r\nstdpr = lambda x: stdout.write(str(x))\r\nstdmap = lambda: map(int, stdstr().split())\r\nstdarr = lambda: list(map(int, stdstr().split()))\r\n\r\nmod = 1000000007\r\n\r\n\r\nn = stdint()\r\n\r\nv = stdarr()\r\n\r\npref = [0]\r\n\r\nfor i in range(n):\r\n pref.append(pref[-1] + v[i])\r\n\r\nv.sort()\r\nsortPref = [0]\r\n\r\nfor i in range(n):\r\n sortPref.append(sortPref[-1] + v[i])\r\n\r\nm = stdint()\r\n\r\nfor _ in range(m):\r\n t,l,r = stdmap()\r\n\r\n if(t == 1):\r\n print(pref[r]-pref[l-1])\r\n else:\r\n print(sortPref[r]-sortPref[l-1])", "n = int(input())\nrocks = input().split()\nrocks = list(map(int, rocks))\nq = int(input())\n\nprefix_sum = []\nsoma = 0\n\nfor i in range(n):\n\tsoma += rocks[i]\n\tprefix_sum.append(soma)\n\nrocks.sort()\n\ncosts = []\nsoma = 0\nfor i in range(n):\n\tsoma += rocks[i]\n\tcosts.append(soma)\n\nfor i in range(q):\n\top, l, r = input().split()\n\top = int(op)\n\tl = int(l)\n\tr = int(r)\n\t\n\tif op == 1:\n\t\tif l == 1:\n\t\t\tprint(prefix_sum[r-1])\n\t\telse:\n\t\t\tprint(prefix_sum[r-1]-prefix_sum[l-2])\n\telse:\n\t\tif l == 1:\n\t\t\tprint(costs[r-1])\n\t\telse:\n\t\t\tprint(costs[r-1]-costs[l-2])\n\t\t\t\n\n\t \t\t\t\t \t\t \t\t\t \t\t \t\t \t\t\t", "x = int(input())\r\nl = list(map(int,input().split()))\r\nlsort = sorted(l)\r\n\r\np1 = [0]\r\nc1 = 0\r\n\r\nfor j in range(len(l)):\r\n c1+=l[j]\r\n p1.append(c1)\r\n\r\np2 = [0]\r\nc2 = 0\r\n\r\nfor j in range(len(l)):\r\n c2+=lsort[j]\r\n p2.append(c2)\r\n\r\n\r\nn = int(input())\r\nfor i in range(n):\r\n x,y,z = map(int,input().split())\r\n \r\n if x == 2:\r\n print(p2[z] - p2[y-1])\r\n else:\r\n print(p1[z] - p1[y-1])", " ###~~~LOTA~~~###\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nx1={0:0}\r\nx2={0:0}\r\ns,q=0,1\r\nfor i in a:\r\n\ts+=i\r\n\tx1[q]=s\r\n\tq+=1\r\na.sort()\r\ns,q=0,1\r\nfor i in a:\r\n\ts+=i\r\n\tx2[q]=s\r\n\tq+=1\r\nfor i in range(m):\r\n\tx,y,z=map(int,input().split())\r\n\tif x==1:\r\n\t\tprint(x1[z]-x1[y-1])\r\n\telse:\r\n\t\tprint(x2[z]-x2[y-1])", "\r\nn = int(input())\r\nv = [int(x) for x in input().split()]\r\nvSorted = sorted(v)\r\n\r\ncumV, cumVSorted = [0],[0]\r\nfor i in range(n):\r\n cumV.append(cumV[-1]+v[i])\r\n cumVSorted.append(cumVSorted[-1]+vSorted[i])\r\n\r\nm = int(input())\r\nfor _ in range(m):\r\n qType, l, r = [int(x) for x in input().split()]\r\n if qType == 1:\r\n print(cumV[r] - cumV[l-1])\r\n else:\r\n print(cumVSorted[r] - cumVSorted[l-1])", "n= int(input())\nt1 = [0] + list(map(int,input().split()))\nt2 = list(sorted(t1))\nfor i in range(1,n+1):\n t1[i] += t1[i-1] \n t2[i] += t2[i-1] \nfor i in range(int(input())):\n t,l,r = map(int,input().split())\n arr = t1 if t ==1 else t2 \n print(arr[r]-arr[l-1])", "from math import *\r\nn=int(input())\r\nm=list(map(int,input().split()))\r\nq=sorted(m.copy())\r\nm.append(0)\r\nq.append(0)\r\ns=sum(m)\r\nj=s\r\nk=s\r\ns_m={}\r\ns_q={}\r\nfor i in range(len(m)):\r\n s_m[i]=j\r\n s_q[i]=k\r\n j-=m[i]\r\n k-=q[i]\r\nfor i in range(int(input())):\r\n t,l,r=list(map(int,input().split()))\r\n if t==1:\r\n print(s_m[l-1]-s_m[r])\r\n else:\r\n print(s_q[l-1]-s_q[r])", "n = int(input())\nv = [int(x) for x in input().split()]\nu = sorted(v)\n\nvSum = 0\nuSum = 0\nvps = [0]\nups = [0]\nfor i in range(n):\n vSum += v[i]\n uSum += u[i]\n vps.append(vSum)\n ups.append(uSum)\n\nm = int(input())\nfor case in range(m):\n q = [int(x) for x in input().split()]\n ty = q[0]\n l = q[1]\n r = q[2]\n if ty == 1: \n print(vps[r]- vps[l-1])\n if ty == 2:\n print(ups[r]-ups[l-1])\n\n", "n = int(input())\r\nv = [int(s) for s in input().split()]\r\na = v.copy()\r\na.sort()\r\n\r\npref_v = [v[0]] + [0] * (n - 1)\r\npref_a = [a[0]] + [0] * (n - 1)\r\nfor i in range(1, n):\r\n pref_v[i] = pref_v[i - 1] + v[i]\r\n pref_a[i] = pref_a[i - 1] + a[i]\r\n \r\nk = int(input())\r\n\r\nfor j in range(k):\r\n t, l, r = [int(s) for s in input().split()]\r\n if t == 1:\r\n if l == 1:\r\n print(pref_v[r - 1])\r\n else:\r\n print(pref_v[r - 1] - pref_v[l - 2])\r\n else:\r\n if l == 1:\r\n print(pref_a[r - 1])\r\n else:\r\n print(pref_a[r - 1] - pref_a[l - 2])", "def T(): return int(input())\r\ndef V(): return map(int, input().split())\r\ndef L(): return list(map(int, input().split()))\r\n\r\n\r\ndef solve():\r\n n = T()\r\n cost = L()\r\n cumulativeCost = [cost[0]]\r\n sortedCost = sorted(cost)\r\n cumulativeSortedCost = [sortedCost[0]]\r\n for i in range(1, n):\r\n cumulativeCost.append(cumulativeCost[i-1]+cost[i])\r\n cumulativeSortedCost.append(cumulativeSortedCost[i-1]+sortedCost[i])\r\n q = T()\r\n for i in range(q):\r\n quesType, l, r = V()\r\n if quesType == 1:\r\n if l > 1:\r\n print(cumulativeCost[r-1] - cumulativeCost[l-2])\r\n else:\r\n print(cumulativeCost[r-1])\r\n else:\r\n if l > 1:\r\n print(cumulativeSortedCost[r-1] - cumulativeSortedCost[l-2])\r\n else:\r\n print(cumulativeSortedCost[r-1])\r\n\r\n\r\nif __name__ == \"__main__\":\r\n solve()\r\n", "n = int(input())\r\n\r\nstones = list(map(int, input().split(\" \")))\r\nstones_sort = stones.copy()\r\nstones_sort.sort()\r\n\r\nfor i in range(1,n):\r\n stones[i] += stones[i-1]\r\n stones_sort[i] += stones_sort[i-1]\r\n\r\nstones.insert(0, 0)\r\nstones_sort.insert(0, 0)\r\n\r\nm = int(input())\r\n\r\nfor _ in range(m):\r\n type, l, r = list(map(int, input().split(\" \")))\r\n if type == 1:\r\n cur = stones[r] - stones[l-1]\r\n print(cur)\r\n else:\r\n cur = stones_sort[r] - stones_sort[l-1]\r\n print(cur)", "n = int(input())\r\nl1 = list(map(int, input().split()))\r\nsum1 = [0]*(n+1) \r\nfor i in range(1, n+1):\r\n sum1[i] = sum1[i-1] + l1[i-1]\r\nl1 = sorted(l1)\r\nsum2 = [0]*(n+1) \r\nfor i in range(1, n+1):\r\n sum2[i] = sum2[i-1] + l1[i-1]\r\nfor i in range(int(input())):\r\n a,b,c = map(int,input().split())\r\n print(sum1[c]-sum1[b-1] if a==1 else sum2[c]-sum2[b-1])", "import sys, io, os\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport string\r\nfrom collections import defaultdict,Counter,deque\r\ninput = sys.stdin.readline\r\n \r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n\r\ndef WSNOPRINT(out):\r\n return ''.join(map(str, out))\r\n\r\n'''\r\n'''\r\ndef solve():\r\n n = II()\r\n a = LII()\r\n\r\n t1 = [0]\r\n for i in range(len(a)):\r\n t1.append(t1[-1] + a[i])\r\n\r\n t2 = [0]\r\n for num in sorted(a):\r\n t2.append(t2[-1] + num)\r\n\r\n m = II()\r\n # print(t2)\r\n for _ in range(m):\r\n t, l, r = MII()\r\n if t == 1:\r\n print(t1[r] - t1[l-1])\r\n else:\r\n print(t2[r] - t2[l-1])\r\n\r\nsolve()", "n = int(input())\r\nl = list(map(int, input().split()))\r\nt = l.copy()\r\nt.sort()\r\ns1 = [0]\r\nfor i in range(n):\r\n s1.append(s1[-1] + l[i])\r\ns2 = [0]\r\nfor i in range(n):\r\n s2.append(s2[-1] + t[i])\r\nfor _ in range(int(input())):\r\n r, a, b = map(int, input().split())\r\n if r == 1:\r\n ans = s1[b] - s1[a-1]\r\n print(ans)\r\n else:\r\n ans = s2[b] - s2[a-1]\r\n print(ans)", "num_stones = int(input())\r\nstone_costs = list(map(int, input().split()))\r\nprefix_normal = [0]\r\nfor i in range(len(stone_costs)):\r\n prefix_normal.append(stone_costs[i] + prefix_normal[-1])\r\n\r\nsorted_costs = sorted(stone_costs)\r\nprefix_sorted = [0]\r\nfor i in range(len(sorted_costs)):\r\n prefix_sorted.append(sorted_costs[i] + prefix_sorted[-1])\r\n\r\nnum_questions = int(input())\r\nfor _ in range(num_questions):\r\n t, index1, index2 = map(int, input().split())\r\n if t == 1:\r\n print(prefix_normal[index2] - prefix_normal[index1 - 1])\r\n else:\r\n print(prefix_sorted[index2] - prefix_sorted[index1 - 1])\r\n", "n = int(input())\r\nv1 = list(map(int, input().split()))\r\nv2 = v1[::]\r\nv2.sort()\r\ndp1 = [0] * (n + 1)\r\ndp2 = [0] * (n + 1)\r\ndp1[1], dp2[1] = v1[0], v2[0]\r\nfor i in range(1, n):\r\n dp1[i + 1] = dp1[i] + v1[i]\r\n dp2[i + 1] = dp2[i] + v2[i]\r\nm = int(input())\r\nfor i in range(m):\r\n t, l, r = map(int, input().split())\r\n if(t == 1):\r\n print(dp1[r] - dp1[l - 1])\r\n else:\r\n print(dp2[r] - dp2[l - 1])", "n=int(input())\r\nvalues=list(map(int,input().split()))\r\nvaluessorted=sorted(values)\r\n\r\nvalues=[0]+values\r\nvaluessorted=[0]+valuessorted\r\n\r\nfor i in range(1,n+1):\r\n values[i]+=values[i-1]\r\n valuessorted[i]+=valuessorted[i-1]\r\n\r\nfor i in range(int(input())):\r\n question=list(map(int,input().split()))\r\n if question[0]==1:\r\n print(values[question[2]]-values[question[1]-1])\r\n else:\r\n print(valuessorted[question[2]]-valuessorted[question[1]-1])", "def get_ints():\r\n return map(int, input().strip().split())\r\n\r\ndef get_list():\r\n return list(map(int, input().strip().split()))\r\n\r\ndef get_string():\r\n return input().strip()\r\n\r\nfor t in range(1):\r\n n = int(input().strip())\r\n arr = get_list()\r\n m = int(input().strip())\r\n arr_sorted = sorted(list(arr))\r\n \r\n for i in range(1,n):\r\n arr[i] += arr[i-1]\r\n arr_sorted[i] += arr_sorted[i-1]\r\n \r\n for i in range(m):\r\n query = input().strip().split()\r\n l, r = int(query[1]) - 1, int(query[2]) - 1\r\n ans = 0\r\n if query[0] == '1':\r\n if l == 0:\r\n ans = arr[r]\r\n else:\r\n ans = arr[r] - arr[l-1]\r\n else:\r\n if l == 0:\r\n ans = arr_sorted[r]\r\n else:\r\n ans = arr_sorted[r] - arr_sorted[l-1]\r\n print(ans)", "_, stones = input(), list(map(int, input().split(' ')))\r\nstones_sorted = sorted(stones)\r\nfor i in range(1, len(stones_sorted)):\r\n stones_sorted[i] += stones_sorted[i-1]\r\n stones[i] += stones[i-1]\r\nfor i in range(int(input())):\r\n t, l, r = list(map(lambda x: int(x)-1, input().split(' ')))\r\n print(\r\n stones[r] - (stones[l-1] if l-1 >= 0 else 0)\r\n if t == 0 else \r\n stones_sorted[r] - (stones_sorted[l-1] if l-1 >= 0 else 0))", "n = int(input().strip())\r\nv = []\r\nvv = [int(i) for i in input().strip().split()]\r\nv.extend(vv)\r\nu = sorted(v)\r\ndef makepresum(a):\r\n k = [0] \r\n for i in a:\r\n k.append(k[-1] + i)\r\n return k\r\nvp = makepresum(v)\r\nup = makepresum(u)\r\nm = int(input().strip())\r\nfor _ in range(m):\r\n t, l, r = map(int, input().strip().split())\r\n if t == 1:\r\n print(vp[r] - vp[l-1])\r\n if t == 2:\r\n print(up[r] - up[l-1])\r\n ", "n = int(input())\nif n>=1 and n<=10**5: \n x = list(map(int, input().split(' ')[:n]))\n\nm=int(input())\n\ns=[0]*(len(x)+1)\nfor i in range(len(x)):\n s[i+1]=s[i]+x[i]\n\na=sorted(x)\n\nX=[0]*(len(a)+1)\nfor i in range(len(a)):\n X[i+1]=X[i]+a[i]\n\nif n>=1 and n<=10**5:\n for i in range(m):\n t, l, r=[int(w) for w in input().split()]\n if (l>=1 and l<=r) and (r>=l and r<=n):\n if t==1:\n T=s[r]-s[l-1]\n \n if t==2:\n T=X[r]-X[l-1]\n print(T)\n \t\t \t \t\t\t \t\t\t \t\t\t \t\t \t\t \t\t \t", "###inputs\nssize = int(input())\nstones = [int(x) for x in input().split()]\n\nquick = sorted(stones)\nordered = [0]\nnon_ordered = [0]\naux = 0\n\n###Soma Acumulada\nfor i in range(len(quick)):\n aux += quick[i]\n ordered.append(aux)\n\naux = 0\n\nfor i in range(len(stones)):\n aux += stones[i]\n non_ordered.append(aux)\n\n###Operacoes\noperation = int(input())\n\nwhile operation:\n lista = [int(x) for x in input().split()]\n\n if lista[0] == 1:\n print(non_ordered[lista[2]] - non_ordered[lista[1]-1])\n else:\n print(ordered[lista[2]] - ordered[lista[1]-1])\n\n lista = []\n operation -= 1\n \t \t \t \t\t\t\t \t \t\t\t\t \t", "n = int(input())\narr = list(map(int, input().split(' ')))\na = [0]\nb = [0]\nsum = 0\nfor i in range(n):\n sum += arr[i]\n a.append(sum)\nsum = 0\narr.sort()\nfor j in range(n):\n sum+=arr[j]\n b.append(sum)\nm = int(input())\nfor _ in range(m):\n t, l, r = map(int, input().split(' '))\n l-=1\n if t == 1:\n print(a[r]-a[l])\n else:\n print(b[r]-b[l])\n\n", "def solution(n,V):\r\n V_sorted= sorted(V)\r\n prefix =[0]*(n+1)\r\n prefix_sorted= [0]*(n+1)\r\n for i in range(n) :\r\n prefix[i+1] = prefix[i] + V[i]\r\n prefix_sorted[i+1]=prefix_sorted[i] +V_sorted[i] \r\n return prefix , prefix_sorted\r\nif __name__ == \"__main__\":\r\n n =int(input())\r\n V = list(map(int,input().split()))\r\n res1,res2 = solution(n,V)\r\n m = int(input())\r\n for _ in range(m):\r\n t,l,r = map(int,input().split())\r\n if t == 1 :\r\n ans = res1[r]-res1[l-1]\r\n print(ans)\r\n else:\r\n ans = res2[r]-res2[l-1]\r\n print(ans) ", "n = int(input())\r\nL =[0] + [int(X) for X in input().split()]\r\nA= L.copy()\r\nA.sort()\r\nfor i in range(1,n+1):\r\n\tL[i] = L[i] + L[i-1]\r\n\tA[i] = A[i] + A[i-1]\r\nfor _ in range(int(input())):\r\n\tt,l,r = (int(X) for X in input().split())\r\n\tif t ==1:\r\n\t\tprint(L[r]-L[l-1])\r\n\telse:\r\n\t\tprint(A[r]-A[l-1])", "number = int(input())\nelements = list(map(int,input().split()))\nquestions = int(input())\n\nelements2 = elements[:]\nelements2.sort()\n\nsae1 = [0]\nsae2 =[0]\n\ns1 = 0\ns2 = 0\nfor a in range(len(elements)):\n\ts1 += elements[a]\n\ts2 += elements2[a]\n\tsae1.append(s1)\n\tsae2.append(s2)\n\n\nfor num in range(questions):\n\ttest = input().split()\n\tif int(test[0]) == 1:\n\t\tprint(sae1[int(test[2])] - sae1[int(test[1]) - 1])\n\telse:\n\t\tprint(sae2[int(test[2])] - sae2[int(test[1]) - 1])\n\t\t\t \t \t \t\t\t \t\t\t \t\t\t\t \t\t \t", "n, = map(int, input().split())\nV = list(map(int, input().split()))\nV_sorted = sorted(V)\nm, = map(int, input().split())\n\nps1 = [0]\nps2 = [0]\nfor i in range(n):\n ps1.append(ps1[-1] + V[i])\n ps2.append(ps2[-1] + V_sorted[i])\n\nfor _ in range(m):\n t,l,r = map(int, input().split())\n l,r = l-1,r-1\n if t == 1:\n print(ps1[r+1]-ps1[l])\n else:\n print(ps2[r+1]-ps2[l])\n \n", "#\ndef solve(sumV, sumU):\n tp, u, l = map(int, input().split())\n\n print(sumV[l] - sumV[u-1] if tp == 1\n else sumU[l] - sumU[u-1])\n\ndef main():\n n = int(input())\n order : list[int] = list(map(int, input().split()))\n\n def parcialSums(a: list[int]):\n res : list[int] = [0] * (n+1)\n for i in range(n):\n res[i+1] = order[i] + res[i]\n \n return res\n\n sumV : list[int] = parcialSums(order)\n sumU : list[int] = parcialSums(order.sort())\n\n qs = int(input())\n for i in range(qs):\n solve(sumV, sumU)\n\n\n\n\nif __name__ == '__main__':\n main()", "n = int(input())\r\na = list(map(int, input().split()))\r\nt = int(input())\r\nb = sorted(a)\r\nfor i in range(n - 1):\r\n a[i + 1] += a[i]\r\n b[i + 1] += b[i]\r\na = [0] + a\r\nb = [0] + b\r\nfor i in range(t):\r\n typ, l, r = map(int, input().split())\r\n if typ == 2:\r\n print(b[r] - b[l - 1])\r\n else:\r\n print(a[r] - a[l - 1])", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=sorted(a)\r\nd1={}\r\nd2={}\r\nk=0\r\nd1[1,0]=0\r\nd2[1,0]=0\r\nd1[1,1]=a[0]\r\nd2[1,1]=b[0]\r\nfor i in range(1,n):\r\n d1[1,i+1]=d1[1,i]+a[i]\r\n d2[1,i+1]=d2[1,i]+b[i]\r\nfor i in range(int(input())):\r\n x,y,z=map(int,input().split())\r\n if(x==1):\r\n if(y==z==1):\r\n print(d1[1,1])\r\n else:\r\n print(d1[1,z]-d1[1,y-1])\r\n else:\r\n if(y==z==1):\r\n print(d2[1,1])\r\n else:\r\n print(d2[1,z]-d2[1,y-1])", "n = int(input())\r\na = [int(i) for i in input().split(\" \")]\r\ns_a = sorted(a)\r\nv = [0] * (n+1)\r\nu = [0] * (n+1)\r\nfor i in range(n):\r\n u[i + 1] = u[i] + s_a[i]\r\n v[i + 1] = v[i] + a[i]\r\nm = int(input())\r\nfor _ in range(m):\r\n t, l, r = map(int, input().split(\" \"))\r\n l -=1\r\n if t == 1:\r\n print(v[r]-v[l])\r\n else:\r\n print(u[r]-u[l])\r\n", "from sys import stdin, stdout\r\ninput, print = stdin.readline, stdout.write\r\n\r\n\r\ndef str_input():\r\n s = input()\r\n return s[:len(s)-1]\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n b = a.copy()\r\n b.sort()\r\n prea = [0 for _ in range(n+1)]\r\n preb = [0 for _ in range(n+1)]\r\n for i in range(n):\r\n prea[i+1] = prea[i] + a[i]\r\n preb[i+1] = preb[i] + b[i]\r\n m = int(input())\r\n for _ in range(m):\r\n d, l, r = map(int, input().split())\r\n l -= 1\r\n r -= 1\r\n if d == 1:\r\n ans = prea[r+1]-prea[l]\r\n else:\r\n ans = preb[r+1]-preb[l]\r\n print(f\"{ans}\\n\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "#By Anan instagram: anan.ssw\r\nimport sys\r\ninp=lambda: sys.stdin.readline().strip()\r\ninparr=lambda : map(int,inp().split())\r\npr=lambda x: sys.stdout.write(f\"{x}\\n\")\r\nn=int(inp())\r\narr=[[0],[0],[0]]\r\na=[0]+list(inparr())\r\nb=sorted(a)\r\naa,bb=0,0\r\nfor x in range(1,n+1):\r\n aa+=a[x]\r\n bb+=b[x]\r\n arr[1].append(aa)\r\n arr[2].append(bb)\r\nm=int(inp())\r\nfor _ in range(m):\r\n ty,l,r=inparr()\r\n pr(arr[ty][r]-arr[ty][l-1]) ", "input()\r\nk = [int(x) for x in input().split()]\r\nk1 = sorted(k)\r\nkprime = [0]\r\nk1prime = [0]\r\nfor i in range(len(k)):\r\n kprime.append(kprime[-1]+k[i])\r\n k1prime.append(k1prime[-1]+k1[i])\r\nm = int(input())\r\nwhile m:\r\n m -= 1\r\n op,l,r = [int(x) for x in input().split()]\r\n if(op == 1):\r\n print(kprime[r] - kprime[l-1])\r\n else:\r\n print(k1prime[r] - k1prime[l-1])", "import sys\r\nimport math\r\nimport random\r\nimport collections\r\n\r\n# define input function\r\ndef input():\r\n return sys.stdin.readline().rstrip()\r\n\r\ndef helper(n, currency):\r\n pass\r\n\r\ndef uscln(a, b):\r\n if (b == 0):\r\n return a;\r\n return uscln(b, a % b)\r\n\r\ndef brute_force(n):\r\n for i in range(1, n + 1):\r\n if (i * (i + 1)) // 2 > n:\r\n # print(i - 1)\r\n return i - 1\r\n elif (i * (i + 1)) // 2 == n:\r\n # print(i)\r\n return i\r\n \r\ndef random_compare():\r\n for n in range(1, 1000000001):\r\n ans = brute_force(n)\r\n # Code here\r\n l = 1\r\n r = n\r\n def check(mid):\r\n if (mid * (mid + 1)) // 2 <= n:\r\n return True\r\n return False\r\n \r\n while r - l > 1:\r\n mid = (l + r) // 2\r\n if check(mid):\r\n l = mid\r\n else:\r\n r = mid\r\n res = l\r\n #----------\r\n if ans != res:\r\n print(n)\r\n break\r\n else:\r\n print(\"OK\")\r\n \r\n# main function\r\ndef main():\r\n n = int(input())\r\n v = list(map(int, input().split()))\r\n p_sum1 = [0]\r\n for i in range(0, n):\r\n p_sum1.append(p_sum1[-1] + v[i])\r\n # print(p_sum1)\r\n v = sorted(v)\r\n p_sum2 = [0]\r\n for i in range(0, n):\r\n p_sum2.append(p_sum2[-1] + v[i])\r\n # print(p_sum2)\r\n \r\n m = int(input())\r\n while m:\r\n m -= 1\r\n t, l, r = map(int, input().split())\r\n if t == 1:\r\n print(p_sum1[r] - p_sum1[l - 1])\r\n else:\r\n print(p_sum2[r] - p_sum2[l - 1])\r\n \r\n \r\n# run main function\r\nif __name__ == '__main__':\r\n # t = int(input())\r\n t = 1\r\n while t:\r\n main()\r\n t -= 1\r\n", "\r\n \r\ndef qn2(ar,l,r):\r\n s2=list(ar)\r\n s2.sort()\r\n return qn1(s2,l,r)\r\n\r\n\r\nn=int(input())\r\ns=input().split()\r\ns=[int(o) for o in s]\r\nt=list(s)\r\nt.sort()\r\nq=int(input())\r\n\r\n\r\nprefix1=[0]*(n)\r\nprefix1[0]=t[0]\r\nfor i in range(1,n):\r\n prefix1[i]=prefix1[i-1]+t[i]\r\n\r\n\r\nprefix=[0]*(n)\r\nprefix[0]=s[0]\r\nfor i in range(1,n):\r\n prefix[i]=prefix[i-1]+s[i]\r\n\r\nfor i in range(q):\r\n w=input().split()\r\n w=[int(ww) for ww in w]\r\n t,l,r=w[0],w[1],w[2]\r\n if t==1:\r\n if l==1 and r==1:\r\n print(prefix[l-1])\r\n else:\r\n if l-2<0:\r\n print(prefix[r-1])\r\n else:\r\n print(prefix[r-1]-prefix[l-2])\r\n else:\r\n if l==1 and r==1:\r\n print(prefix1[l-1])\r\n else:\r\n if l-2<0:\r\n print(prefix1[r-1])\r\n else:\r\n print(prefix1[r-1]-prefix1[l-2])\r\n\r\n \r\n\r\n", "total_stones = int(input())\r\nnumbered_stones = list(map(int , input().split()))\r\nsorted_stones = sorted(numbered_stones)\r\nprefix = []\r\nsorted_prefix = []\r\nsum = 0\r\n\r\nfor i in range(len(numbered_stones)):\r\n sum += numbered_stones[i]\r\n prefix.append(sum)\r\n\r\nsum = 0\r\nfor itm in sorted(numbered_stones):\r\n sum += itm\r\n sorted_prefix.append(sum)\r\n\r\n\r\nno_of_questions = int(input())\r\nfor q in range(no_of_questions):\r\n typ , l , r = map(int , input().split())\r\n if l == 1 and typ == 1:\r\n print(prefix[r - 1])\r\n continue\r\n elif l == 1 and typ != 1:\r\n print(sorted_prefix[r - 1])\r\n continue\r\n\r\n if typ == 1:\r\n print(prefix[r - 1] - prefix[l - 2])\r\n else:\r\n print(sorted_prefix[r - 1] - sorted_prefix[l - 2])", "R = lambda:map(int, input().split())\r\nn = int(input())\r\na = [0] + list(R())\r\ns = [a, sorted(a)]\r\nfor i in range(n):\r\n s[0][i + 1] += s[0][i]\r\n s[1][i + 1] += s[1][i]\r\nm = int(input())\r\nprint(\"\\n\".join(map(str, (s[t - 1][r] - s[t - 1][l - 1] for t, l, r in (R() for _ in range(m))))))", "def solution():\r\n n = int(input())\r\n a = list(map(int,input().split()))\r\n b = list(a)\r\n b.sort()\r\n prefix_a = [0] * (n + 1)\r\n prefix_b = [0] * (n + 1)\r\n for i in range(1,n+1):\r\n prefix_a[i] = prefix_a[i-1] + a[i-1]\r\n for i in range(1,n+1):\r\n prefix_b[i] = prefix_b[i-1] + b[i-1]\r\n m = int(input())\r\n ans = 0\r\n for i in range(m):\r\n typeo,l,r = map(int,input().split())\r\n if typeo == 1:\r\n ans = prefix_a[r] - prefix_a[l-1]\r\n print(ans)\r\n else:\r\n ans = prefix_b[r] - prefix_b[l-1]\r\n print(ans)\r\nsolution()", "#accumalated 2d matrix\r\n# listy=[list(accumulate(row)) for row in accumulate([[i for i in list(map(int,input().split()))] for j in range(n)])] \r\nfrom itertools import *\r\nimport sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nn=int(input())\r\nlisty=list(map(int,input().split()))\r\npref=[0]+list(accumulate(listy))\r\nspref=[0]+list(accumulate(sorted(listy)))\r\nt= int(input())\r\nfor i in range(t):\r\n type,l,r=map(int,input().split())\r\n if(type==1):\r\n n=pref[r]-pref[l-1]\r\n print(n)\r\n else:\r\n n=spref[r]-spref[l-1]\r\n # print(spref,spref[r],spref[l-1])\r\n print(n)\r\n pass\r\n", "n = int(input()) \n\nv = list(map(int,input().split())) \n\nm = int(input()) \n\n#type 1\nPSAv = [0] * len(v) #\nPSAv[0] = v[0]\nfor j in range(1,n):\n PSAv[j] = PSAv[j - 1] + v[j]\n\n\n#type 2\ns = sorted(v)\nPSAvSorted = [0] * len(s)\nPSAvSorted[0] = s[0]\nfor k in range(1,n):\n PSAvSorted[k] = PSAvSorted[k - 1] + s[k]\n\n\nfor i in range(m):\n perg = input().split()\n tipo , l , r = perg\n tipo = int(tipo)\n l = int(l)\n r = int(r)\n\n if tipo == 1 : \n if l == 1: \n res = PSAv[r - 1]\n else: \n res = PSAv[r - 1] - PSAv[l - 2]\n elif tipo == 2 : \n if l == 1:\n res = PSAvSorted[r - 1]\n else: \n res = PSAvSorted[r - 1] - PSAvSorted[l - 2]\n print(res) \n\n\n \t\t \t \t\t \t \t\t \t \t", "# import sys\n# sys.stdin=open(\"/Users/mohamed/Folders/Desktop/Problem-Solving/CPC/PY/input.txt\",\"r\")\n# sys.stdout=open(\"/Users/mohamed/Folders/Desktop/Problem-Solving/CPC/PY/output.txt\",\"w\")\n\nimport math\nfor _ in range(1):\n n=int(input())\n l1=[int(x) for x in input().split()]\n l2=sorted(l1)\n l3=[0]\n l4=[0]\n for i in range(n):\n l3.append(l3[i]+l1[i])\n l4.append(l4[i]+l2[i])\n \n\n m=int(input())\n for i in range(m):\n t,f,k=map(int,input().split())\n if t==1:\n print(l3[k]-l3[f-1])\n else:\n print(l4[k]-l4[f-1])\n\n\n \n\n\n\n\n\n\n \n\n\n", "\r\nif __name__ == '__main__':\r\n n = input()\r\n a = list(map(int, input().split()))\r\n\r\n prifOfA = [0] * (len(a)+1)\r\n for i in range(len(a)):\r\n prifOfA[i] = prifOfA[i-1] + a[i]\r\n \r\n a.sort()\r\n prifOfSortedA = [0] * (len(a)+1)\r\n for i in range(len(a)):\r\n prifOfSortedA[i] = prifOfSortedA[i-1] + a[i]\r\n \r\n n = int(input())\r\n for i in range(n):\r\n type, l, r = list(map(int, input().split()))\r\n l, r = l-1, r-1\r\n if type == 1:\r\n print(prifOfA[r]-prifOfA[l-1])\r\n else:\r\n print(prifOfSortedA[r]-prifOfSortedA[l-1])\r\n", "n = int(input())\narr = [int(x) for x in input().split()]\narr_s = sorted(arr)\n\narr_cumsum = [0] * n\narr_s_cumsum = [0] * n\nfor i in range(n):\n arr_cumsum[i] = arr[i] if i == 0 else arr[i] + arr_cumsum[i-1]\n arr_s_cumsum[i] = arr_s[i] if i == 0 else arr_s[i] + arr_s_cumsum[i-1]\narr_cumsum = [0] + arr_cumsum\narr_s_cumsum = [0] + arr_s_cumsum\n\nq = int(input())\nfor _ in range(q):\n tp, start, end = [int(x) for x in input().split()]\n if tp == 1:\n v = arr_cumsum[end] - arr_cumsum[start-1]\n else:\n v = arr_s_cumsum[end] - arr_s_cumsum[start - 1]\n print(v)\n\n\n\n", "from itertools import accumulate as am\r\nI=lambda:list(map(int,input().split()))\r\nn=I()\r\ns=I()\r\npre_sum=[0]+[*am(s)]\r\ns.sort()\r\npre_sum_sort=[0]+[*am(s)]\r\nfor _ in range(int(input())):\r\n t,l,r=I()\r\n if t ==1:\r\n print(pre_sum[r]-pre_sum[l-1])\r\n else:\r\n print(pre_sum_sort[r]-pre_sum_sort[l-1])", "import sys\n#sys.setrecursionlimit(10**6)\ninput = sys.stdin.readline\nI = lambda: int(input())\nS = lambda: input()\nL = lambda: list(map(int, input().split()))\n###################################################\n\n\n\nif __name__=='__main__':\n n = I()\n v = L()\n m = I()\n q = []\n for _ in range(m):\n q.append(L())\n \n pre_sum_1 = [0]*(n+1)\n for idx, el in enumerate(v):\n pre_sum_1[idx+1] = pre_sum_1[idx] + el\n\n v.sort()\n pre_sum_2 = [0]*(n+1)\n for idx, el in enumerate(v):\n pre_sum_2[idx+1] = pre_sum_2[idx] + el\n\n for idx in range(m):\n l = q[idx][1]\n r = q[idx][2] \n if q[idx][0]==1:\n print(pre_sum_1[r]-pre_sum_1[l-1])\n else:\n print(pre_sum_2[r]-pre_sum_2[l-1])\n", "def cm1(a1, b1, sbv):\r\n return sbv[b1] - sbv[a1 - 1]\r\n\r\n\r\ndef cm2(a1, b1, sbu):\r\n return sbu[b1] - sbu[a1 - 1]\r\n\r\n\r\nn = int(input())\r\n\r\nsv = [0]\r\nv = []\r\nprev = 0\r\nfor x in input().split():\r\n k = int(x)\r\n v.append(k)\r\n sv.append(prev + k)\r\n prev += k\r\n\r\nu = sorted(v)\r\nsu = [0]\r\nprev = 0\r\nfor x in u:\r\n su.append(prev + x)\r\n prev += x\r\n\r\n\r\nnk = int(input())\r\nm = 0\r\nwhile m < nk:\r\n cm, a, b = [int(x) for x in input().split()]\r\n if cm == 1:\r\n print(cm1(a, b, sv))\r\n elif cm == 2:\r\n print(cm2(a, b, su))\r\n m += 1\r\n", "n = int(input())\ncustos = str(input()).split()\ncustosOrdenados = []\nfor custo in custos:\n custosOrdenados.append(int(custo))\ncustosOrdenados.sort()\n\ncustosAcumuldos = [0]*(n+1)\ncustosOrdenadosAcumulados = [0]*(n+1)\nfor i in range(1, n+1):\n custosAcumuldos[i] = custosAcumuldos[i-1] + int(custos[i-1])\n custosOrdenadosAcumulados[i] = custosOrdenadosAcumulados[i-1] + custosOrdenados[i-1]\n\nqtdQuestoes = int(input())\nfor i in range(qtdQuestoes):\n type, l, r = str(input()).split()\n if type == \"1\":\n print(custosAcumuldos[int(r)] - custosAcumuldos[int(l)-1])\n else:\n print(custosOrdenadosAcumulados[int(r)] - custosOrdenadosAcumulados[int(l)-1])\n\n \t\t \t\t\t \t\t \t\t \t\t \t\t", "from itertools import accumulate as z\r\nn=int(input())\r\na=[*map(int,input().split())]\r\ns=[[0]+[*z(a)]]\r\na.sort()\r\ns+=[[0]+[*z(a)]]\r\nq=int(input())\r\nfor i in range(q):\r\n\tx,l,r=map(int,input().split())\r\n\tprint(s[x-1][r]-s[x-1][l-1])", "n = int(input())\r\narray = [int(x) for x in input().split()]\r\n\r\nlast = 0\r\nsummationArray = [0]\r\n\r\nlastSorted = 0\r\nsortedArray = []\r\nsumationSorted = []\r\n\r\nfor i in range(int(input())):\r\n type , l , r = [int(x) for x in input().split()]\r\n if type == 1:\r\n try:\r\n print(summationArray[r] - summationArray[l - 1])\r\n except:\r\n for i in range(last , r):\r\n summationArray.append(summationArray[-1] + array[i])\r\n print(summationArray[r] - summationArray[l - 1])\r\n last = r\r\n if type == 2:\r\n if sortedArray == []:\r\n sortedArray = sorted(array)\r\n sumationSorted = [0]\r\n try:\r\n print(sumationSorted[r] - sumationSorted[l - 1])\r\n except:\r\n for i in range(lastSorted , r):\r\n sumationSorted.append(sumationSorted[-1] + sortedArray[i])\r\n print(sumationSorted[r] - sumationSorted[l - 1])\r\n lastSorted = r\r\n", "input()\n\nv = list(map(int, input().split()))\n\ncum_sum = [v[0]]\nfor i in range(1,len(v)):\n cum_sum.append(cum_sum[i-1] + v[i])\n\nu = sorted(v)\ncum_sum_sorted = [u[0]]\n\nfor i in range(1,len(v)):\n cum_sum_sorted.append(cum_sum_sorted[i-1] + u[i])\n\nfor _ in range(int(input())):\n t, l, r = map(int, input().split())\n if t == 1:\n print(cum_sum[r-1] - (cum_sum[l-2] if l-2 >= 0 else 0))\n else:\n print(cum_sum_sorted[r-1] - (cum_sum_sorted[l-2] if l-2 >= 0 else 0))", "def solve():\r\n n=int(input());\r\n arr = list(map(int,input().split()));\r\n sorted_arr = sorted(arr);\r\n \r\n pre_norm = [arr[0]]*n;\r\n pre_sorted=[sorted_arr[0]]*n;\r\n \r\n for i in range(1,n):\r\n pre_norm[i] = pre_norm[i-1]+arr[i]\r\n pre_sorted[i] = pre_sorted[i-1]+sorted_arr[i]\r\n \r\n m = int(input())\r\n \r\n for i in range(m):\r\n q,l,r = map(int,input().split())\r\n if q == 1:\r\n print(pre_norm[r-1] - (pre_norm[l-2] if l>=2 else 0))\r\n else: \r\n print(pre_sorted[r-1] - (pre_sorted[l-2] if l>=2 else 0))\r\n \r\n \r\nif __name__ == '__main__':\r\n t = 1;\r\n # t = int(input());\r\n for _ in range(t):\r\n solve();", "piedras=int(input())\r\ncosas =input().split()\r\nvalorPiedras = [int(x)for x in cosas] #largo piedras\r\n \r\nvalorPiedrasAux =[] #prefix sum \r\nvalorPiedrasAux2 = sorted(valorPiedras)\r\n \r\nvalorPiedrasAux3 =[] #prefix sum \r\n \r\nx = 0\r\nz = 0\r\n \r\nfor i in range(len(valorPiedras)):\r\n x+= valorPiedras[i]\r\n valorPiedrasAux.append(x)\r\n z+= valorPiedrasAux2[i]\r\n valorPiedrasAux3.append(z)\r\nq= int(input())\r\nfor j in range(q):\r\n y=input().split()\r\n y=[int(x) for x in y]\r\n if y[0]==1:\r\n if(y[1]-1==0):\r\n print(valorPiedrasAux[y[2]-1])\r\n else:\r\n print(valorPiedrasAux[y[2]-1]-valorPiedrasAux[abs(y[1]-2)])\r\n \r\n if y[0] == 2:\r\n if(y[1]-1)==0:\r\n print(valorPiedrasAux3[y[2]-1])\r\n else:\r\n print(valorPiedrasAux3[y[2]-1]-valorPiedrasAux3[abs(y[1]-2)])", "n = int(input())\r\na = list(map(int,input().split()))\r\npresum = [a[0]]\r\n\r\nfor i in range(1,n):\r\n presum.append(presum[-1]+a[i])\r\n\r\nb = sorted(a)\r\npresum2 = [b[0]]\r\n\r\nfor i in range(1,n):\r\n presum2.append(presum2[-1]+b[i])\r\n\r\nm = int(input())\r\n#print(a,presum,b,presum2)\r\nfor i in range(m):\r\n type,l,r = map(int,input().split())\r\n if type == 1:\r\n print(presum[r-1] - presum[l-2] if l-2>=0 else presum[r-1])\r\n else:\r\n print(presum2[r-1] - presum2[l-2] if l-2>=0 else presum2[r-1])", "# توكلت على الله\r\n\r\nimport sys \r\ninput = sys.stdin.readline \r\n\r\ndef solve():\r\n num = int( input() )\r\n ston = list(map(int,input().split()))\r\n priv = []\r\n priu = []\r\n sm = 0\r\n for i in ston :\r\n sm += i\r\n priv.append( sm )\r\n priv.insert(0,0)\r\n ston.sort()\r\n sm = 0\r\n for i in ston :\r\n sm += i\r\n priu.append( sm )\r\n priu.insert(0,0) \r\n ques = int( input() )\r\n for i in range( ques ):\r\n typ,l,r = map(int,input().split()) \r\n if typ == 1:\r\n print(priv[r]-priv[l-1])\r\n else:\r\n print(priu[r]-priu[l-1])\r\n#for i in range(int(input())):\r\nsolve()", "# 输入石头的数量和它们的价值\r\nn = int(input())\r\ncosts = list(map(int, input().split()))\r\n\r\n# 创建一个排序后的石头价值列表\r\nsorted_costs = sorted(costs)\r\n\r\n# 初始化前缀和，但是从0开始，这样在后面的查询中可以避免额外的减法操作\r\ncosts = [0] + costs\r\nsorted_costs = [0] + sorted_costs\r\n\r\n# 计算前缀和\r\nfor i in range(1, n + 1):\r\n costs[i] += costs[i - 1]\r\n sorted_costs[i] += sorted_costs[i - 1]\r\n\r\n# 输入问题的数量\r\nm = int(input())\r\n\r\n# 处理每一个问题\r\nfor _ in range(m):\r\n type, l, r = map(int, input().split())\r\n\r\n # 根据问题的类型输出答案\r\n if type == 1:\r\n print(costs[r] - costs[l - 1])\r\n else:\r\n print(sorted_costs[r] - sorted_costs[l - 1])\r\n", "n = int(input())\r\nv = [int(x) for x in input().split()]\r\nu = sorted(v)\r\nm = int(input())\r\n\r\nprefixes_v = [v[0]]\r\nprefixes_u = [u[0]]\r\n\r\nfor i in range(1, n):\r\n prefixes_v.append(prefixes_v[-1] + v[i])\r\n\r\nfor i in range(1, n):\r\n prefixes_u.append(prefixes_u[-1] + u[i])\r\n\r\n\r\nfor _ in range(m):\r\n t, l, r = map(int, input().split())\r\n l -= 1\r\n r -= 1\r\n if t == 1:\r\n result = prefixes_v[r]\r\n if l > 0:\r\n result -= prefixes_v[l - 1]\r\n print(result)\r\n else:\r\n result = prefixes_u[r]\r\n if l > 0:\r\n result -= prefixes_u[l - 1]\r\n print(result)\r\n", "q_list = []\r\n\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\nl_s = sorted(l)\r\n\r\nt = int(input())\r\nfor _ in range(t):\r\n q_list.append(list(map(int, input().split())))\r\n\r\nprefix = [l[0]]\r\nfor i in range(1, n):\r\n prefix.append(prefix[-1]+l[i])\r\n# print(prefix)\r\n\r\nprefix_s = [l_s[0]]\r\nfor i in range(1, n):\r\n prefix_s.append(prefix_s[-1]+l_s[i])\r\n# print(prefix_s)\r\n\r\nfor i in range(len(q_list)):\r\n li = q_list[i]\r\n if li[0] == 1:\r\n if li[1]-2>=0:\r\n print(prefix[li[2]-1]-prefix[li[1]-2])\r\n else:\r\n print(prefix[li[2]-1])\r\n else:\r\n if li[1]-2>=0:\r\n print(prefix_s[li[2]-1]-prefix_s[li[1]-2])\r\n else:\r\n print(prefix_s[li[2]-1])\r\n", "from sys import stdin\r\n\r\nn = int(stdin.readline().strip())\r\narr = list(map(int, stdin.readline().strip().split()))\r\n\r\nnew_arr = sorted(arr)\r\npre1 = [0] * n\r\npre2 = [0] * n\r\n\r\npre1[0] = arr[0]\r\npre2[0] = new_arr[0]\r\n\r\nfor i in range(1, n):\r\n pre1[i] = arr[i] + pre1[i - 1]\r\n \r\nfor i in range(1, n):\r\n pre2[i] = new_arr[i] + pre2[i - 1]\r\n\r\nq = int(stdin.readline().strip())\r\n\r\nfor i in range(q):\r\n a, l, r = list(map(int, stdin.readline().strip().split()))\r\n l-=1\r\n r-=1\r\n if l == 0:\r\n if a == 1:\r\n print(pre1[r])\r\n else:\r\n print(pre2[r])\r\n continue\r\n if a == 1:\r\n print(pre1[r] - pre1[l - 1])\r\n else:\r\n print(pre2[r] - pre2[l - 1])\r\n\r\n\r\n", "import sys\r\nimport copy\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nc = list(map(int, input().split()))\r\nc2 = copy.deepcopy(c)\r\nc2.sort()\r\npre1 = [0]\r\npre2 = [0]\r\nfor i in range(n):\r\n pre1.append(pre1[i]+c[i])\r\n pre2.append(pre2[i]+c2[i])\r\nfor _ in range(int(input())):\r\n type,l,r = list(map(int, input().split()))\r\n if type == 1:\r\n print(pre1[r]-pre1[l-1])\r\n else:\r\n print(pre2[r]-pre2[l-1])", "n = int(input())\r\nv = list(map(int, input().split()))\r\nu = sorted(v)\r\nvs = [v[0]]\r\nus = [u[0]]\r\nfor i in range(1, n):\r\n vs.append(v[i] + vs[-1])\r\n us.append(u[i] + us[-1])\r\n\r\nfor _ in range(int(input())):\r\n t, l, r = map(int, input().split())\r\n if t == 1:\r\n if l >= 2:\r\n print(vs[r - 1] - vs[l - 2])\r\n else:\r\n print(vs[r - 1])\r\n else:\r\n if l >= 2:\r\n print(us[r - 1] - us[l - 2])\r\n else:\r\n print(us[r - 1])\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nm = int(input())\r\nps = [0 for i in range(n+1)]\r\npss = [0 for i in range(n+1)]\r\n\r\nfor i, v in enumerate(l):\r\n ps[i+1] = ps[i] + v\r\n\r\nfor i, v in enumerate(sorted(l)):\r\n pss[i+1] = pss[i] + v\r\n\r\n# print(l)\r\n# print(ps)\r\n# print(sorted(l))\r\n# print(pss)\r\n\r\nfor i in range(m):\r\n t, l, r = map(int, input().split())\r\n if t == 1:\r\n print(ps[r] - ps[l-1])\r\n else:\r\n print(pss[r] - pss[l-1])", "# https://codeforces.com/problemset/problem/433/B\r\n# two prefix sum array, one on sorted array\r\n\r\nn = int(input())\r\nv = list(map(int, input().split()))\r\naps = [0]\r\nfor x in v:\r\n aps.append(aps[-1] + x)\r\nv.sort()\r\nbps = [0]\r\nfor x in v:\r\n bps.append(bps[-1] + x)\r\n\r\nm = int(input())\r\nfor _ in range(m):\r\n t, lt, rt = map(int, input().split())\r\n if t == 1:\r\n print(aps[rt] - aps[lt-1])\r\n else:\r\n print(bps[rt] - bps[lt-1])\r\n", "n=int(input())\narr=list(map(int,input().split()))\narr2=arr.copy()\narr2.sort()\nfreq1=[0]\nfreq2=[0]\nfor i in range (n):\n freq1.append(freq1[-1]+arr[i])\n freq2.append(freq2[-1]+arr2[i])\nfor i in range (int(input())):\n a,l,r=map(int,input().split())\n if a==1:\n print(freq1[r]-freq1[l-1])\n else:\n print(freq2[r]-freq2[l-1])\n \t \t \t \t \t \t \t \t \t\t\t \t\t\t\t\t", "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\nfrom decimal import Decimal\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 main():\r\n n = II()\r\n a1 = I()\r\n a2 = list(sorted(a1))\r\n b1 = [0] * (n + 1)\r\n b2 = [0] * (n + 1)\r\n for i in range(n):\r\n b1[i + 1] = b1[i] + a1[i]\r\n b2[i + 1] = b2[i] + a2[i]\r\n\r\n for _ in range(II()):\r\n t, l, r = I()\r\n if t == 1:\r\n print(b1[r] - b1[l - 1])\r\n else:\r\n print(b2[r] - b2[l - 1])\r\n\r\n\r\nif __name__ == '__main__':\r\n # for _ in range(II()):\r\n # main()\r\n main()", "n = int(input())\r\narr = list(map(int, input().split()))\r\nbrr = sorted(arr)\r\n\r\nprra = [0]\r\nfor i in range(n):\r\n prra.append(prra[i] + arr[i])\r\nprrb = [0]\r\nfor i in range(n):\r\n prrb.append(prrb[i] + brr[i])\r\n\r\n\r\nq = int(input())\r\nfor _ in range(q):\r\n a, b, c = map(int, input().split())\r\n if a == 1:\r\n print(prra[c] - prra[b - 1])\r\n else:\r\n print(prrb[c] - prrb[b - 1])\r\n", "def solve(A):\r\n left=A[:]\r\n leftsorted=A[:]\r\n leftsorted.sort()\r\n for i in range(1,len(A)):\r\n left[i]+=left[i-1]\r\n leftsorted[i]+=leftsorted[i-1]\r\n return left,leftsorted\r\n\r\nn=int(input())\r\nlst=list(map(int,input().split()))[:n]\r\nm=int(input())\r\narr=[]\r\nfor _ in range(m):\r\n temp=list(map(int,input().split()))[:3]\r\n arr.append(temp)\r\nleft,leftsorted=solve(lst)\r\nfor r in arr:\r\n i,j=r[1]-1,r[2]-1\r\n m=r[0]\r\n if m==1:\r\n ans=left[j]-(left[i-1] if i>0 else 0)\r\n else:\r\n ans=leftsorted[j]-(leftsorted[i-1] if i>0 else 0)\r\n print(ans)\r\n", "n = int(input())\r\na = list(map(int,input().split(\" \")))\r\nb = sorted(a)\r\nfor i in range(0,n-1):\r\n a[i+1] += a[i]\r\n b[i+1] += b[i]\r\na = [0] + a\r\nb = [0] + b\r\nm = int(input())\r\nfor i in range(m):\r\n t,l,r = map(int,input().split(\" \"))\r\n if t == 1:\r\n print(a[r] - a[l-1])\r\n else:\r\n print(b[r] - b[l-1])", "n = int(input())\r\narr = list(map(int,input().split()))\r\narrs = []\r\nfor i in range(n) :\r\n arrs.append(arr[i])\r\narrs.sort()\r\nfor i in range(1,n) :\r\n arr[i] = arr[i]+arr[i-1]\r\nfor i in range(1,n) :\r\n arrs[i] = arrs[i]+arrs[i-1]\r\nm = int(input())\r\nfor i in range(m) :\r\n type,l,r = map(int,input().split())\r\n if(type == 1) :\r\n if(l == 1) :\r\n print(arr[r-1])\r\n else :\r\n print(arr[r-1]-arr[l-2])\r\n if(type == 2) :\r\n if(l == 1) :\r\n print(arrs[r-1])\r\n else :\r\n print(arrs[r-1]-arrs[l-2])\r\n\r\n", "n = int(input())\r\nv = list(map(int,input().split()))\r\nu = v[:]\r\nu.sort()\r\nm = int(input())\r\np1 = [0]*(n+1)\r\np2 = [0] * (n+1)\r\n\r\nfor i in range(1,n+1):\r\n p1[i] = p1[i-1] + v[i-1]\r\n p2[i] = p2[i-1] + u[i-1]\r\n\r\nfor i in range(m):\r\n a,l,r = map(int,input().split())\r\n if a == 1:\r\n print(p1[r] - p1[l-1])\r\n else:\r\n print(p2[r] - p2[l-1])\r\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\n\r\nb = [0]\r\nfor x in a :\r\n b.append(b[-1] + x)\r\na.sort()\r\nc = [0]\r\nfor x in a :\r\n c.append(c[-1] + x)\r\n\r\nm = int(input())\r\nfor _ in range(m) :\r\n t, l, r = map(int, input().split())\r\n if t == 1 :\r\n print(b[r] - b[l - 1])\r\n else :\r\n print(c[r] - c[l - 1])\r\n", "n = int(input())\r\ns = [0]+list(map(int,input().split()))\r\nss = sorted(s.copy())\r\nfor i in range(1,n+1):s[i]+=s[i-1];ss[i]+=ss[i-1]\r\nfor _ in range(int(input())):\r\n t,l,r = map(int,input().split())\r\n if t==1:\r\n print(s[r]-s[l-1])\r\n else:\r\n print((ss[r]-ss[l-1]))\r\n", "from itertools import accumulate\r\nn=int(input())\r\nstones=[0]+list(map(int,input().split()))\r\nV_stones=list(accumulate(stones))\r\nU_stones=list(accumulate(sorted(stones)))\r\nfor i in range(int(input())):\r\n a,b,c=map(int,input().split())\r\n if a == 1:\r\n print(V_stones[c]-V_stones[b-1])\r\n else:\r\n print(U_stones[c]-U_stones[b-1])\r\n", "def getSum(l: int, r: int, csum: list[int]):\r\n if l == 1:\r\n return csum[r - 1]\r\n\r\n return csum[r - 1] - csum[l-2]\r\n\r\n\r\ndef getCSum(arr: list[int]):\r\n csum = [arr[0]]\r\n for i in range(1, len(arr)):\r\n csum.append(csum[i - 1] + arr[i])\r\n\r\n return csum\r\n\r\n\r\nn = int(input())\r\nraw_input = input()\r\narr = list(map(int, raw_input.split()))\r\ncsum = getCSum(arr)\r\n\r\nsorted_arr = sorted(arr)\r\ncsum_sorted = getCSum(sorted_arr)\r\n\r\nt = int(input())\r\n\r\nwhile t:\r\n # print(\"hi\")\r\n raw_input = input()\r\n \r\n [type_, l, r] = list(map(int, raw_input.split()))\r\n\r\n if type_ == 1:\r\n print(getSum(l, r, csum))\r\n\r\n if type_ == 2:\r\n print(getSum(l, r, csum_sorted))\r\n\r\n t = t - 1\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nsrr = arr[:]\r\nsrr.sort()\r\n\r\nfor i in range(1, n) :\r\n arr[i] += arr[i-1]\r\n srr[i] += srr[i-1]\r\n \r\nfor i in range(int(input())) :\r\n x, l, r = map(int, input().split())\r\n \r\n if x == 1:\r\n print(arr[r-1]-(arr[l-2] if l > 1 else 0))\r\n else :\r\n print(srr[r-1]-(srr[l-2] if l > 1 else 0))\r\n ", "n = int(input())\nv = list(map(int, input().split()))\nv_sums = [0]\nfor i in range(n):\n v_sums.append(v[i] + v_sums[i])\nv.sort()\nsv_sums = [0]\nfor i in range(n):\n sv_sums.append(v[i] + sv_sums[i])\nm = int(input())\n\nfor _ in range(m):\n _type, l, r = map(int, input().split())\n if _type == 1:\n print(v_sums[r] - v_sums[l-1])\n else:\n print(sv_sums[r] - sv_sums[l-1])\n\n \t\t \t \t \t\t \t\t \t \t\t\t\t\t \t\t\t\t", "'''\n# https://www.jdoodle.com/python3-programming-online/\n#\n# 22.07.2021\n#\n# CF 248 B\n#\n'''\n\nn = int (input ())\nss = input ().split ()\n\na = [0]*n\nb = [0]*n\nfor i in range (n) :\n a [i] = int (ss [i])\n b [i] = a [i]\n\nb.sort ()\n\nfor i in range (1, n) :\n a [i] += a [i-1]\n b [i] += b [i-1]\n\nm = int (input ())\n\nfor i in range (m) :\n t, l, r = map (int, input ().split ())\n if t == 1 :\n if l == 1 :\n res = a [r-1]\n else :\n res = a [r-1] - a [l-2]\n else :\n if l == 1 :\n res = b [r-1]\n else :\n res = b [r-1] - b [l-2]\n\n print (res)\n", "n=int(input())\r\nnum=list(map(int,input().split()))\r\nnum1=num.copy()\r\nnum1.sort()\r\nsum1,sum2=[num[0]],[num1[0]]\r\nfor i in range(1,n):\r\n\tsum1.append(sum1[i-1]+num[i])\r\n\tsum2.append(sum2[i-1]+num1[i])\r\n# print(sum1,sum2)\r\nfor _ in range(int(input())):\r\n\tx,l,r=map(int,input().split())\r\n\tif(x==1):\r\n\t\tif(l==1):\r\n\t\t\tprint(sum1[r-1])\r\n\t\telse:\r\n\t\t\tprint(sum1[r-1]-sum1[l-2])\r\n\telse:\r\n\t\tif(l==1):\r\n\t\t\tprint(sum2[r-1])\r\n\t\telse:\r\n\t\t\tprint(sum2[r-1]-sum2[l-2])\r\n\r\n\r\n# 2 2 4 6 7 7 \r\n\r\n# 6 10 12 19 21 28\r\n# 2 4 8 14 21 28\r\n", "n = int(input())\r\nv = list(map(int,input().split()))\r\nm = int(input())\r\nvps = [0]\r\nfor x in v:\r\n vps.append(vps[-1]+x)\r\nv.sort()\r\nups = [0]\r\nfor x in v:\r\n ups.append(ups[-1]+x)\r\n\r\nfor _ in range(m):\r\n t,l,r = map(int,input().split())\r\n if t == 1:\r\n print(vps[r]-vps[l-1])\r\n else:\r\n print(ups[r]-ups[l-1])", "n = int(input())\nv = [int(x) for x in input().split()]\nm = int(input())\n\npref_sum = [0] * n\npref_sum[0] = v[0]\nfor i in range(1, n):\n pref_sum[i] = pref_sum[i - 1] + v[i]\n\nu = v.copy()\nu.sort()\n\npref_sum2 = [0] * n\npref_sum2[0] = u[0]\nfor i in range(1, n):\n pref_sum2[i] = pref_sum2[i - 1] + u[i]\n\nfor q in range(m):\n t, l, r = [int(x) for x in input().split()]\n l -= 1\n r -= 1\n if t == 1:\n s = 0\n if l == 0:\n s = pref_sum[r]\n else:\n s = pref_sum[r] - pref_sum[l - 1]\n print(s)\n elif t == 2:\n s = 0\n if l == 0:\n s = pref_sum2[r]\n else:\n s = pref_sum2[r] - pref_sum2[l - 1]\n print(s)", "n = int(input())\r\narr = list(map(int, input().split()))\r\nque = int(input())\r\n\r\narr2 = arr[:]\r\narr = [0]+arr+[0]\r\nfor idx in range(1, len(arr)):\r\n arr[idx] += arr[idx-1]\r\n\r\narr2.sort()\r\narr2 = [0]+arr2+[0]\r\nfor idx in range(1, len(arr2)):\r\n arr2[idx] += arr2[idx-1]\r\n\r\nfor _ in range(que):\r\n type, left, right = list(map(int, input().split()))\r\n if type==1:\r\n print(arr[right]-arr[left-1])\r\n else:\r\n print(arr2[right]-arr2[left-1])\r\n", "import copy\r\n\r\ndef solve():\r\n n = int(input())\r\n U = list(map(int,input().split()))\r\n V = copy.deepcopy(U)\r\n U.sort()\r\n VP,UP = [0],[0]\r\n Vk,Uk = 0,0\r\n for i in range(n):\r\n Vk+=V[i]\r\n VP.append(Vk)\r\n Uk+=U[i]\r\n UP.append(Uk)\r\n \r\n for _ in range(int(input())):\r\n type,l,r = map(int,input().split())\r\n if type==1:\r\n print(VP[r]-VP[l-1])\r\n else:\r\n print(UP[r]-UP[l-1])\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\nmain()", "n = int(input())\r\nlst = list(map(int, input().rstrip().split()))\r\nlst2 = sorted(lst)\r\nd1 = {}\r\nd2 = {}\r\nd1[1] = lst[0]\r\nd2[1] = lst2[0]\r\nfor i in range(1, n):\r\n d1[i + 1] = d1[i] + lst[i]\r\nfor i in range(1, n):\r\n d2[i + 1] = d2[i] + lst2[i]\r\nm = int(input())\r\nfor _ in range(m):\r\n qt, l, r = map(int, input().split())\r\n if qt == 1:\r\n if l != 1:\r\n print(d1[r] - d1[l - 1])\r\n else:\r\n print(d1[r])\r\n else:\r\n if l != 1:\r\n print(d2[r] - d2[l - 1])\r\n else:\r\n print(d2[r])\r\n", "n=int(input())\r\nuarray = list(map(int, input().rstrip().split()))\r\ncumulativeuarray=[0]\r\nfor i in range(n):\r\n cumulativeuarray.append(cumulativeuarray[-1]+uarray[i])\r\nvarray=sorted(uarray)\r\ncumulativevarray=[0]\r\nfor i in range(n):\r\n cumulativevarray.append(cumulativevarray[-1]+varray[i])\r\nm=int(input())\r\nfor i in range(m):\r\n type,l,r=map(int,input().split())\r\n if type==1:\r\n print(cumulativeuarray[r]-cumulativeuarray[l-1])\r\n else:\r\n print(cumulativevarray[r]-cumulativevarray[l-1])", "n = int(input())\nv = [int(x) for x in input().split()]\nps, s = [], 0\nfor x in v:\n s += x\n ps.append(s)\nsv, s, psv = sorted(v), 0, []\nfor x in sv:\n s += x\n psv.append(s)\nm = int(input())\nfor i in range(m):\n t, l, r = (int(x) for x in input().split())\n if t == 1:\n print(ps[r - 1] - ps[l - 1] + v[l - 1])\n else:\n print(psv[r - 1] - psv[l - 1] + sv[l - 1])\n", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nlst2 = sorted(lst)\r\nfor i in range(1, len(lst)):\r\n lst[i] = lst[i] + lst[i-1]\r\n lst2[i] = lst2[i] + lst2[i - 1]\r\nlst.insert(0, 0)\r\nlst2.insert(0, 0)\r\nq = int(input())\r\nfor _ in range(q):\r\n cmd = input().split()\r\n if cmd[0] == \"1\":\r\n print(lst[int(cmd[2])] - lst[int(cmd[1]) - 1])\r\n else:\r\n print(lst2[int(cmd[2])] - lst2[int(cmd[1]) - 1])", "import sys\r\n\r\ndef _input(): return map(int, input().split())\r\n \r\nn = int(input())\r\nlst = list(_input())\r\na = [0] + lst; i=1\r\nb = [0] + sorted(lst)\r\nwhile i<=n: \r\n a[i] += a[i-1] \r\n b[i] += b[i-1]\r\n i+=1\r\n \r\nm = int(input()); i = 0\r\nwhile i<m:\r\n type, l, r = _input()\r\n if type == 1: print(a[r] - a[l-1])\r\n else: print(b[r] - b[l-1])\r\n i+=1\r\n \r\n\r\n\r\n\r\n", "import time\r\nfrom itertools import accumulate\r\n# start_time = time.time()\r\nn = int(input())\r\ntemp = list(map(int, input().split(\" \")))\r\ncost_of_stones_type_1 = list(accumulate(temp))\r\ntemp2 = sorted(temp)\r\ncost_of_stones_type_2 = list(accumulate(temp2))\r\ntest_cases = int(input())\r\nwhile test_cases != 0:\r\n ans = 0\r\n type1, l, r = map(int, input().split(\" \"))\r\n if type1 == 1:\r\n ans += cost_of_stones_type_1[r-1]\r\n if l-1 > 0:\r\n ans -= cost_of_stones_type_1[l-2]\r\n else:\r\n ans += cost_of_stones_type_2[r-1]\r\n if l-1 > 0:\r\n ans -= cost_of_stones_type_2[l-2]\r\n print(ans)\r\n test_cases -= 1\r\n\r\n# print(\"--- %s seconds ---\" % (time.time() - start_time))\r\n", "#pylint:disable=W0622\nimport sys\ninput = sys.stdin.readline\n\ndef GetSubSumList(a) :\n\tsl = a.copy()\n\tfor i in range(1, len(sl)) : sl[i] += sl[i-1]\n\treturn sl\n\t\ndef GetSubSum(l, r, a) :\n\tif l == 0 : return a[r]\n\telse : return a[r] - a[l-1]\n\nL = int(input())\nA = list(map(int, input().split()))\n\nA_SS = GetSubSumList(A)\nSA_SS = GetSubSumList(sorted(A))\n\nresults = []\nfor _ in range(int(input())) :\n\tT, L, R = map(int, input().split())\n\tL, R = L-1, R-1\n\tif T == 1 : results.append(str(GetSubSum(L, R, A_SS)))\n\telse : results.append(str(GetSubSum(L, R, SA_SS)))\t\t\t\t\nprint(\"\\n\".join(results))", "t=int(input())\r\narr=list(map(int,input().split()))\r\ndp=[0]*t\r\ndp[0]=arr[0]\r\ndps=[0]*t\r\na=sorted(arr)\r\ndps[0]=a[0]\r\nfor i in range(1,t):\r\n dp[i]=dp[i-1]+arr[i]\r\n dps[i]=dps[i-1]+a[i]\r\n \r\nm=int(input())\r\nfor _ in range(m):\r\n typo,l,r=map(int,input().split())\r\n if(typo==1):\r\n if(l==1):\r\n print(dp[r-1])\r\n else:\r\n print(dp[r-1]-dp[l-2])\r\n else:\r\n if(l==1):\r\n print(dps[r-1])\r\n else:\r\n print(dps[r-1]-dps[l-2])", "n = int(input())\r\nv = list(map(int, input().strip().split()))\r\n\r\n# 使用v构造前缀数组，pre[i]代表前i个数字的和\r\npre_v = [0]\r\n_sum = 0\r\nfor i in range(len(v)):\r\n _sum += v[i]\r\n pre_v.append(_sum)\r\n\r\n\r\n# 使用u构造前缀数组\r\nu = sorted(v)\r\npre_u = [0]\r\n_sum = 0\r\nfor i in range(len(u)):\r\n _sum += u[i]\r\n pre_u.append(_sum)\r\n\r\nm = int(input())\r\nfor _ in range(m):\r\n _type, l, r = map(int, input().strip().split())\r\n\r\n if _type == 1:\r\n print(pre_v[r] - pre_v[l-1])\r\n else:\r\n print(pre_u[r] - pre_u[l-1])", "\r\n\r\n\r\ndef solve(arr,l): \r\n p=[] \r\n for i in range(l):\r\n if i==0:\r\n p.append(arr[i])\r\n else:\r\n p.append(arr[i]+p[i-1])\r\n x=sorted(arr) \r\n p_s=[] \r\n for i in range(l):\r\n if i==0:\r\n p_s.append(x[i])\r\n else:\r\n p_s.append(x[i]+p_s[i-1]) \r\n \r\n \r\n q=int(input())\r\n for i in range(q):\r\n \r\n t,l,r=map(int,input().split())\r\n \r\n if t==1:\r\n if l==1:\r\n print(p[r-1])\r\n else:\r\n l=l-2\r\n print(p[r-1]-p[l])\r\n else:\r\n\r\n if l==1:\r\n print(p_s[r-1])\r\n else:\r\n l=l-2\r\n print(p_s[r-1]-p_s[l]) \r\n\r\n \r\n \r\n \r\nl=int(input())\r\narr=input()\r\narr=[int(i) for i in arr.split()]\r\nx=solve(arr,l) ", "n=int(input())\r\nz=list(map(int,input().split()))\r\nm=int(input())\r\nx=sorted(z)\r\nfor i in range(1,n):\r\n\tx[i]=x[i-1]+x[i]\r\n\tz[i]=z[i-1]+z[i]\r\nfor i in range(m):\r\n\tt,l,r=map(int,input().split())\r\n\tif(t==1):\r\n\t\tif(l>1):\r\n\t\t\tprint(z[r-1]-z[l-2])\r\n\t\telse:\r\n\t\t\tprint(z[r-1])\r\n\telse:\r\n\t\tif(l>1):\r\n\t\t\tprint(x[r-1]-x[l-2])\r\n\t\telse:\r\n\t\t\tprint(x[r-1])\r\n", "n=int(input())\r\nv=[0]+list(map(int,input().split()))\r\nu=sorted(v)\r\nfor i in range(1,n):\r\n v[i+1],u[i+1]=v[i+1]+v[i],u[i+1]+u[i]\r\nfor _ in range(int(input())):\r\n t,l,r=map(int,input().split())\r\n print(v[r]-v[l-1] if t==1 else u[r]-u[l-1])", "n = int(input())\r\nx = list(map(int, input().split()))\r\ny = x.copy()\r\ny.sort()\r\nabc = []\r\ntotal_sum = [0]\r\ntotal_sum_b = [0]\r\na = 0\r\nb = 0\r\nfor _ in range(n):\r\n a += x[_]\r\n total_sum.append(a)\r\n b += y[_]\r\n total_sum_b.append(b)\r\nfor i in range(int(input())):\r\n t, l, r = map(int, input().split())\r\n if t == 1:\r\n print(total_sum[r] - total_sum[l - 1])\r\n else:\r\n print(total_sum_b[r] - total_sum_b[l - 1])\r\n", "n = int(input())\r\n\r\nnums = list(map(int,input().split()))\r\n\r\nsortedNums = nums[::]\r\nsortedNums.sort()\r\n\r\nnums.insert(0,0)\r\nsortedNums.insert(0,0)\r\n\r\n#prefixsum\r\nfor i in range(1,n + 1):\r\n nums[i] += nums[i - 1]\r\n sortedNums[i] += sortedNums[i - 1]\r\n\r\nfor _ in range(int(input())):\r\n type,l,r = list(map(int,input().split()))\r\n res = 0\r\n\r\n if type == 1:\r\n res = nums[r] - nums[l - 1]\r\n else:\r\n res = sortedNums[r] - sortedNums[l - 1]\r\n\r\n print(res)\r\n\r\n\r\n", "\r\n\r\n\r\n\r\nn=int(input());\r\na=list(map(int,input().split()));\r\n\r\nb=[0]*(n+1);\r\nfor i in range(1,n+1):\r\n\tb[i]=b[i-1]+a[i-1];\r\na.sort();\r\nc=[0]*(n+1);\r\n\r\nfor i in range(1,n+1):\r\n\tc[i]=c[i-1]+a[i-1];\r\n\r\nm=int(input());\r\nfor i in range(m):\r\n\tl=list(map(int,input().split()));\r\n\tif(l[0]==1):print(b[l[2]]-b[l[1]-1]);\r\n\telse:print(c[l[2]]-c[l[1]-1]);", "# fin = open('input.txt')\n\n# def input():\n# \treturn fin.readline().strip()\n\nn = int(input())\n\nstones = list(map(int, input().split(' ')))\n\nprefix = [0] * (n+1)\n\nfor i, x in enumerate(stones):\n\tprefix[i+1] = x + prefix[i]\n\n\nsorted_stones = sorted(stones)\n\nsorted_prefix = [0] * (n+1)\n\nfor i, x in enumerate(sorted_stones):\n\tsorted_prefix[i+1] = x + sorted_prefix[i]\n\n\nm = int(input())\n\nfor _ in range(m):\n\tt, l, r = tuple(map(int, input().split(' ')))\n\tif t == 1:\n\t\tprint(prefix[r] - prefix[l-1])\n\telse:\n\t\tprint(sorted_prefix[r] - sorted_prefix[l-1])\n\n", "numt = int(input())\nli = list(map(int, input().split()))\nli.insert(0, 0)\nlor = li.copy()\nlor.sort()\nfor i in range(numt):\n li[i + 1] += li[i]\nfor i in range(numt):\n lor[i + 1] += lor[i]\nn = int(input())\nfor i in range(n):\n il = list(map(int, input().split()))\n if il[0] == 1:\n print(li[il[2]] - li[il[1]-1])\n else:\n print(lor[il[2]] - lor[il[1] - 1])\n\n \t\t\t \t \t\t \t \t\t \t \t\t \t", "import sys\r\n\r\nn = int(sys.stdin.readline())\r\na = []\r\nwihOutSort = []\r\nwithSort = []\r\ntotal = 0\r\nb = sys.stdin.readline().split()\r\nfor i in range(n):\r\n total = total + int(b[i])\r\n wihOutSort.append(total)\r\n a.append(int(b[i]))\r\na.sort()\r\ntotal = 0\r\nfor i in range(n):\r\n total = total + a[i]\r\n withSort.append(total)\r\nq = int(sys.stdin.readline())\r\nfor _ in range(q):\r\n s = sys.stdin.readline().split(\" \")\r\n if int(s[0]) == 1:\r\n if int(s[1]) == 1:\r\n print(wihOutSort[int(s[2]) - 1])\r\n else:\r\n print(wihOutSort[int(s[2]) - 1] - wihOutSort[int(s[1]) - 2])\r\n else:\r\n if int(s[1]) == 1:\r\n print(withSort[int(s[2]) - 1])\r\n else:\r\n print(withSort[int(s[2]) - 1] - withSort[int(s[1]) - 2])\r\n", "input()\nlst = list(map(int,input().split()))\nlst_s = lst.copy()\nlst_s.sort()\n\npref = []\npref_s = []\n\n\ninx = 0\nfor elem in lst:\n if len(pref) == 0:\n pref.append(elem)\n pref_s.append(lst_s[inx])\n else:\n pref.append(pref[inx-1]+elem)\n pref_s.append(pref_s[inx-1]+lst_s[inx])\n inx += 1\n\ncmd = int(input())\nfor i in range(cmd):\n cmds = list(map(int,input().split()))\n typ = cmds[0]\n l = cmds[1] - 1\n r = cmds[2] - 1\n if typ == 1:\n print(pref[r]-pref[l]+lst[l])\n else:\n print(pref_s[r]-pref_s[l]+lst_s[l])\n\n\t\t\t\t \t \t \t\t \t \t\t \t\t\t\t\t\t \t", "import sys\ntoks = (token for token in sys.stdin.read().split())\nn = int(next(toks))\n\nstones = []\nfor _ in range(n):\n stones.append(int(next(toks)))\nnq = int(next(toks))\n#tmp\n#normal prefix sums\npsums = [0]\nacc = 0\nfor i in stones:\n acc += i\n psums.append(acc)\n#print(psums)\n#sorted prefix sums\nstones.sort()\nspsums = [0]\nacc = 0\nfor i in stones:\n acc += i\n spsums.append(acc)\n#print(spsums)\nfor _ in range(nq):\n n1 = int(next(toks))\n n2 = int(next(toks))\n n3 = int(next(toks))\n if n1 == 1:\n print(psums[n3] - psums[n2 - 1])\n else:\n print(spsums[n3] - spsums[n2 - 1])\n \n\n\t\t \t\t \t\t \t \t\t\t\t\t \t\t \t\t\t\t \t\t", "\r\nif __name__=='__main__':\r\n n = int(input())\r\n arr = [int(i) for i in input().split(' ')]\r\n s_arr = sorted(arr)\r\n \r\n s_type_1 = []\r\n s_type_1.append(arr[0])\r\n s_type_2 = []\r\n s_type_2.append(s_arr[0])\r\n \r\n for i in range(1, len(arr)):\r\n s_type_1.append(s_type_1[i-1]+arr[i])\r\n s_type_2.append(s_type_2[i-1]+s_arr[i])\r\n \r\n num = int(input())\r\n \r\n while num:\r\n line = [int(i) for i in input().split(' ')]\r\n typed = line[0]\r\n l = line[1]\r\n r = line[2]\r\n l-=1\r\n r-=1\r\n if typed == 1:\r\n print(s_type_1[r]-s_type_1[l]+arr[l])\r\n else:\r\n print(s_type_2[r]-s_type_2[l]+s_arr[l])\r\n \r\n num-=1", "n=int(input())\r\nnums=list(map(int,input().split()))\r\nnums2=nums.copy()\r\nnums2.sort()\r\nk=int(input())\r\nml=[0]\r\nml2=[0]\r\nval=0\r\nval2=0\r\nfor i in range(n):\r\n val+=nums[i]\r\n ml.append(val)\r\nfor j in range(n):\r\n val2+=nums2[j]\r\n ml2.append(val2)\r\nfor i in range(k):\r\n x,l,r=map(int,input().split())\r\n if x==1:\r\n print(ml[r]-ml[l-1])\r\n else:\r\n print(ml2[r]-ml2[l-1])", "# 433B - Kuriyama Mirai's Stones\r\nn, v = int(input()), list(map(int, input().split()))\r\nu = sorted(v)\r\nvo, uo = [0], [0]\r\nx = 0\r\nfor i in v:\r\n x += i\r\n vo.append(x)\r\nx = 0\r\nfor i in u:\r\n x += i\r\n uo.append(x)\r\nnn = int(input())\r\nm = [[]]*nn\r\nfor _ in range(nn):\r\n [t, l, r] = list(map(int, input().split()))\r\n if t == 1:\r\n print(vo[r]-vo[l-1])\r\n else:\r\n print(uo[r]-uo[l-1])\r\n", "n = int(input())\nsv = input().split()\n\nv = [0]*n\nfor i in range(n):\n v[i] = int(sv[i])\nvsort = v.copy()\nvsort.sort()\n#print(v)\n#print(vsort)\nps = [0]*(n+1)\npssort = [0]*(n+1)\nfor i in range(n):\n ps[i+1] = ps[i] + v[i]\n pssort[i+1] = pssort[i] + vsort[i]\n#print(ps)\n#print(pssort)\nm = int(input())\nfor i in range(m):\n typ, l, r = [int(num) for num in input().split()]\n if (typ == 1):\n print(ps[r] - ps[l-1])\n else:\n print(pssort[r] - pssort[l-1])", "# https://codeforces.com/problemset/problem/433/B\n\nif __name__ == '__main__':\n n = int(input())\n\n V = list(map(int, input().split()))\n sorted_V = sorted(V)\n\n q = int(input())\n\n L = [0]*n\n sorted_L = [0]*n\n\n R = [0]*n\n sorted_R = [0]*n\n\n elem_sum = sum(V)\n\n for i in range(1, n):\n L[i] = L[i-1] + V[i-1]\n sorted_L[i] = sorted_L[i-1] + sorted_V[i-1]\n\n R[n-i-1] = R[n-i] + V[n-i]\n sorted_R[n-i-1] = sorted_R[n-i] + sorted_V[n-i]\n\n\n for _ in range(q):\n type, l, r = map(int, input().split())\n\n if type == 1:\n print(elem_sum - L[l-1] - R[r-1])\n else:\n print(elem_sum - sorted_L[l-1] - sorted_R[r-1])\n\n", "\r\n\r\n\r\nn=int(input())\r\narr1=list(map(int,input().split()))\r\n\r\narr2=arr1.copy()\r\narr2.sort()\r\n\r\npre1=[0 for i in range(n)]\r\npre2=[0 for i in range(n)]\r\n\r\nsm1=0\r\nsm2=0\r\nfor i in range(n):\r\n sm1+=arr1[i]\r\n sm2+=arr2[i]\r\n\r\n pre1[i]=sm1\r\n pre2[i]=sm2\r\n\r\n\r\n\r\n\r\nQ=int(input())\r\nfor i in range(Q):\r\n x,a,b=map(int,input().split())\r\n if x==1:\r\n ans=pre1[b-1]-pre1[a-1]+arr1[a-1]\r\n else:\r\n ans=pre2[b-1]-pre2[a-1]+arr2[a-1]\r\n\r\n print(ans)\r\n", "n = int(input())\r\nv = list(map(int, input().split(\" \")))\r\nm = int(input())\r\n\r\ntypeOne = [v[0]]\r\nfor i in range(1, n):\r\n typeOne.append(typeOne[-1] + v[i])\r\n\r\nv.sort()\r\n\r\ntypeTwo = [v[0]]\r\nfor i in range(1, n):\r\n typeTwo.append(typeTwo[-1] + v[i])\r\n\r\nfor _ in range(m):\r\n type, l, r = map(int, input().split(\" \"))\r\n\r\n if type == 1:\r\n if l == 1:\r\n print(typeOne[r - 1])\r\n else:\r\n print(typeOne[r - 1] - typeOne[l - 2])\r\n else:\r\n if l == 1:\r\n print(typeTwo[r - 1])\r\n else:\r\n print(typeTwo[r - 1] - typeTwo[l - 2])\r\n", "n = int(input())\r\ncosts = [int(x) for x in input().split()]\r\nm = int(input())\r\n\r\nsums = {}\r\nfor i in range(len(costs)):\r\n if i == 0:\r\n sums[i] = costs[i]\r\n else:\r\n sums[i] = costs[i] + sums[i-1]\r\n\r\nordered_costs = costs.copy()\r\nordered_costs.sort()\r\nordered_sums = {}\r\nfor i in range(len(ordered_costs)):\r\n if i == 0:\r\n ordered_sums[i] = ordered_costs[i]\r\n else:\r\n ordered_sums[i] = ordered_costs[i] + ordered_sums[i-1]\r\n\r\nwhile m > 0:\r\n t, l, r = [int(x) for x in input().split()]\r\n if t == 1:\r\n if l - 1 == 0:\r\n print(sums[r-1])\r\n else:\r\n print(sums[r-1] - sums[l - 2])\r\n else:\r\n if l - 1 == 0:\r\n print(ordered_sums[r-1])\r\n else:\r\n print(ordered_sums[r-1] - ordered_sums[l - 2])\r\n m -= 1", "class Segment:\r\n\r\n def __init__(self, nums):\r\n self.data = [0 for _ in nums] + nums\r\n self.n = len(nums)\r\n \r\n for idx in reversed(range(1, self.n)):\r\n self.data[idx] = self.data[2*idx] + self.data[2*idx + 1]\r\n \r\n def update(self, i: int, val: int) -> None:\r\n idx = i + self.n\r\n self.data[idx] = val\r\n while idx > 1:\r\n idx //= 2\r\n self.data[idx] = self.data[2*idx] + self.data[2*idx + 1]\r\n \r\n\r\n def sumRange(self, i: int, j: int) -> int:\r\n #sum [i,j] = sum [i, j)\r\n left = i + self.n\r\n right = j + self.n +1\r\n sum_range = 0\r\n while left < right:\r\n if left%2:\r\n sum_range += self.data[left]\r\n left +=1\r\n if right %2:\r\n right -= 1\r\n sum_range += self.data[right]\r\n left //= 2\r\n right //= 2\r\n \r\n return sum_range\r\ndef binary(a,val,n):\r\n s=0\r\n end=n-1\r\n while s<=end:\r\n mid=s+(end-s)//2\r\n if val==a[mid]:\r\n return mid\r\n elif a[mid]<val:\r\n s=mid+1\r\n else:\r\n end=mid-1\r\n return -1\r\ndef fixedSliding(arr):\r\n # return minimum sum\r\n i=0\r\n j=0\r\n sum1=0\r\n mn=10000000000\r\n while j<n:\r\n sum1+=arr[j]\r\n if j-i+1<k:\r\n j+=1\r\n elif j-i+1==k:\r\n if mn>sum1:\r\n a=i\r\n mn=sum1\r\n sum1-=arr[i]\r\n i+=1\r\n j+=1\r\n return mn\r\ndef factor(val):\r\n cnt=0\r\n for i in range(1,int(val**(0.5))+1):\r\n if val%i==0:\r\n if val//i==i:\r\n cnt+=1\r\n else:\r\n cnt+=2\r\n return cnt\r\ndef SieveOfEratosthenes(n, prime,primesquare, a):\r\n # Create a boolean array \"prime[0..n]\"\r\n # and initialize all entries it as\r\n # true. A value in prime[i] will finally\r\n # be false if i is not a prime, else true.\r\n for i in range(2,n+1):\r\n prime[i] = True\r\n \r\n # Create a boolean array \"primesquare[0..n*n+1]\"\r\n # and initialize all entries it as false.\r\n # A value in squareprime[i] will finally be\r\n # true if i is square of prime, else false.\r\n for i in range((n * n + 1)+1):\r\n primesquare[i] = False\r\n \r\n # 1 is not a prime number\r\n prime[1] = False\r\n \r\n p = 2\r\n while(p * p <= n):\r\n # If prime[p] is not changed,\r\n # then it is a prime\r\n if (prime[p] == True):\r\n # Update all multiples of p\r\n i = p * 2\r\n while(i <= n):\r\n prime[i] = False\r\n i += p\r\n p+=1\r\n \r\n \r\n j = 0\r\n for p in range(2,n+1):\r\n if (prime[p]==True):\r\n # Storing primes in an array\r\n a[j] = p\r\n \r\n # Update value in primesquare[p*p],\r\n # if p is prime.\r\n primesquare[p * p] = True\r\n j+=1\r\ndef func(arr):\r\n return arr[1]\r\n# f=open(\"input.txt\",'r')\r\n# h=open(\"output.txt\",'w')\r\n# b,g=map(int,f.readline().split())\r\n# T=int(f.readline())\r\n# arr = [int(i)for i in f.readline().split()]\r\n# for _ in range(1,n+1):\r\nt=int(input())\r\n # n,a,b,c=map(int,input().split()) \r\n # s=input()\r\nvarr=list(map(int,input().split()))\r\n # s=list(map(int,input()))\r\n # mat=[input() for i in range(4)]\r\nuarr=sorted(varr)\r\nv= Segment(varr)\r\nu=Segment(uarr)\r\nm=int(input())\r\nquery=[list(map(int,input().split())) for i in range(m)]\r\nfor i in query:\r\n if i[0]==1:\r\n val=v.sumRange(i[1]-1,i[2]-1)\r\n print(val)\r\n elif i[0]==2:\r\n ual=u.sumRange(i[1]-1,i[2]-1)\r\n print(ual)\r\n", "n=int(input())\r\nli=list(map(int,input().split()))\r\nlic=list(li)\r\nlic.sort()\r\nlisum=[li[0]]\r\nlicsum=[lic[0]]\r\nfor i in range(1,n):\r\n lisum.append(lisum[i-1]+li[i])\r\n licsum.append(licsum[i-1]+lic[i])\r\nlisum.append(0)\r\nlicsum.append(0)\r\nm=int(input())\r\nfor i in range(m):\r\n typ,l,r=map(int,input().split())\r\n if typ==1:\r\n ans=lisum[r-1]-lisum[l-2]\r\n else:\r\n ans=licsum[r-1]-licsum[l-2]\r\n print(ans)\r\n", "\n\n\nif __name__ == '__main__':\n n = int(input())\n arr = [int(i) for i in input().split()]\n m = int(input())\n sorted_arr = sorted(arr)\n\n prefix_arr = [arr[0],]\n for i in range(n - 1):\n prefix_arr.append(prefix_arr[i] + arr[i+1])\n\n prefix_sorted_arr = [sorted_arr[0],]\n for i in range(n - 1):\n prefix_sorted_arr.append(prefix_sorted_arr[i] + sorted_arr[i+1])\n \n\n solution_array = []\n for j in range(m):\n t, l, r = [int(i) for i in input().split()]\n if t == 1:\n upper = prefix_arr[r-1]\n if l - 2 < 0:\n lower = 0\n else:\n lower = prefix_arr[l-2]\n x = upper - lower\n\n else: # t== 2\n upper = prefix_sorted_arr[r-1]\n if l - 2 < 0:\n lower = 0\n else:\n lower = prefix_sorted_arr[l-2]\n x = upper - lower\n\n solution_array.append(x)\n [print(i) for i in solution_array]\n\n\t \t \t \t \t\t\t\t \t\t\t\t\t\t \t\t \t\t", "n = int(input())\r\nstones = list(map(int, input().split()))\r\nstonesSum = [0] * n\r\ncheapStones = sorted(stones)\r\ncheapStonesSum = [0] * n\r\ntotal = 0\r\nfor i in range(n-1, -1, -1):\r\n total += stones[i]\r\n stonesSum[i] = total\r\nstonesSum.append(0)\r\ntotal = 0\r\nfor i in range(n-1, -1, -1):\r\n total += cheapStones[i]\r\n cheapStonesSum[i] = total\r\ncheapStonesSum.append(0)\r\nm = int(input())\r\nfor i in range(m):\r\n questionType, l, r = map(int, input().split())\r\n if questionType == 1:\r\n ans = stonesSum[l-1] - stonesSum[r]\r\n else:\r\n ans = cheapStonesSum[l-1] - cheapStonesSum[r]\r\n print(ans)", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef solve(L, pref, sorty_pref, t, l, r):\r\n l -= 1\r\n if t == 1: return pref[r] - pref[l]\r\n return sorty_pref[r] - sorty_pref[l]\r\n\r\nN = int(input())\r\nL = list(map(int, input().split()))\r\nsorty_L = sorted(L)\r\npref = [0]\r\nsorty_pref = [0]\r\nfor i in range(N):\r\n pref.append(pref[-1] + L[i])\r\n sorty_pref.append(sorty_pref[-1] + sorty_L[i])\r\nfor _ in range(int(input())):\r\n t, l, r = map(int, input().split())\r\n answer = solve(L, pref, sorty_pref, t, l, r)\r\n sys.stdout.write(str(answer) + '\\n')\r\n", "from itertools import accumulate\n\ninput()\nv = list(map(int, input().split()))\nu = sorted(v)\nav = list(accumulate(v, initial=0))\nau = list(accumulate(u, initial=0))\nfor _ in range(int(input())):\n t, l, r = map(int, input().split())\n a = av if t == 1 else au\n print(a[r] - a[l - 1])\n", "\n# Online Python - IDE, Editor, Compiler, Interpreter\nn=int(input())\n\n\nsum1=[]\nsum2=[]\norig=input().split(' ')\norig=[int(x) for x in orig]\n\nsum1.append(orig[0])\n\nfor i in range(1,n):\n sum1.append(sum1[i-1]+orig[i])\n\n\norig.sort()\n\nsum2.append(orig[0])\n\nfor i in range(1,n):\n sum2.append(sum2[i-1]+orig[i])\n \n \nq=int(input())\n\nfor _ in range(q):\n \n query=input().split(' ')\n query=[int(x) for x in query]\n l=query[1] -1\n r=query[2] -1\n \n if(query[0]==1):\n \n if(l==0):\n print(sum1[r])\n else:\n print(sum1[r]-sum1[l-1])\n else:\n \n if(l==0):\n print(sum2[r])\n else:\n print(sum2[r]-sum2[l-1])\n \n \n \n\n \t \t\t\t \t \t\t \t \t\t\t \t \t \t \t", "\r\ndef main():\r\n n=int(input())\r\n arr=list(map(int,input().rstrip().split()))\r\n brr=sorted(arr)\r\n for i in range(1,n):\r\n arr[i]+=arr[i-1]\r\n brr[i]+=brr[i-1]\r\n m=int(input())\r\n for _ in range(m):\r\n typ,l,r=map(int,input().rstrip().split())\r\n if typ==1:\r\n sm=arr[r-1]-arr[l-2] if l-2>=0 else arr[r-1]\r\n print(sm)\r\n else:\r\n sm=brr[r-1]-brr[l-2] if l-2>=0 else brr[r-1]\r\n print(sm)\r\nif __name__==\"__main__\":\r\n main()", "n = int(input())\r\nalist = list(map(int, input().split()))\r\nasort = sorted(alist)\r\n\r\nfor i in range(1, n):\r\n alist[i] += alist[i - 1]\r\n asort[i] += asort[i - 1]\r\n\r\nm = int(input())\r\nfor _ in range(m):\r\n t, l, r = map(int, input().split())\r\n \r\n if t == 2:\r\n print(asort[r-1] - asort[l - 2] if l - 1 != 0 else asort[r-1])\r\n else:\r\n print(alist[r-1] - alist[l - 2] if l - 1 != 0 else alist[r-1])", "\nn = int(input())\nserie = input().split()\nm = int(input())\n\nserie_ordenada = []\nfor i in range(n):\n\tserie[i] = int(serie[i])\n\tserie_ordenada.append(serie[i])\n\nserie_ordenada = sorted(serie)\n\nfor o in range(1, n):\n\tserie[o] = serie[o] + serie[o - 1]\n\tserie_ordenada[o] = serie_ordenada[o] + serie_ordenada[o - 1]\n\nfor e in range(m):\n\tcomando, inicio,fim = input().split()\n\tinicio = int(inicio) - 2\n\tfim = int(fim) - 1\n\tif comando == '1':\n\t\tif inicio == - 1: print(serie[fim])\n\t\telse: print(serie[fim] - serie[inicio])\n\telse:\n\t\tif inicio == - 1: print(serie_ordenada[fim])\n\t\telse: print(serie_ordenada[fim] - serie_ordenada[inicio])\n\n \t \t \t\t\t\t \t \t\t \t\t\t \t \t\t\t\t\t", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=sorted(a)\r\nfor i in range (1,(len(a))):\r\n a[i]+=a[i-1]\r\n b[i]+=b[i-1]\r\nm=int(input())\r\nfor i in range(m):\r\n t,l,r=map(int,input().split())\r\n l-=1\r\n r-=1\r\n if t==2:\r\n totalsum=b[r]-(b[l-1] if l-1>=0 else 0)\r\n print(totalsum)\r\n else:\r\n totalsum=a[r]-(a[l-1] if l-1>=0 else 0)\r\n print(totalsum)\r\n\r\n \r\n", "R = lambda: map(int, input().split())\r\nL = lambda: list(R())\r\n\r\nn,=R()\r\nl = L()\r\nq,=R()\r\nsl=sorted(l)\r\nfor i in range(1,n) :\r\n l[i]+=l[i-1]\r\nfor i in range(1,n) :\r\n sl[i]+=sl[i-1]\r\nfor i in range(q):\r\n t,left,right = R()\r\n if left != 1 :\r\n if t == 1 :print(l[right-1]-l[left-2])\r\n else :print(sl[right-1]-sl[left-2])\r\n else :\r\n if t == 1:\r\n print(l[right - 1])\r\n else:\r\n print(sl[right - 1])\r\n\r\n\r\n\r\n", "n = int(input())\r\nv = list(map(int, input().split()))\r\nm = int(input())\r\n\r\n# Precompute the prefix sums of v and sorted_v\r\nprefix_sum_v = [0] * (n + 1)\r\nprefix_sum_sorted_v = [0] * (n + 1)\r\nsorted_v = sorted(v)\r\nfor i in range(1, n + 1):\r\n prefix_sum_v[i] = prefix_sum_v[i - 1] + v[i - 1]\r\n prefix_sum_sorted_v[i] = prefix_sum_sorted_v[i - 1] + sorted_v[i - 1]\r\n\r\n# Answer each query\r\nfor i in range(m):\r\n q = list(map(int, input().split()))\r\n if q[0] == 1:\r\n print(prefix_sum_v[q[2]] - prefix_sum_v[q[1] - 1])\r\n else:\r\n print(prefix_sum_sorted_v[q[2]] - prefix_sum_sorted_v[q[1] - 1])", "l=int(input())\r\na=list(map(int,input().split()))\r\nn=int(input())\r\nb=list(a)\r\nb.sort()\r\nc,d=[0],[0]\r\nfor i in range(len(a)):\r\n c.append(c[-1]+a[i])\r\n d.append(d[-1]+b[i])\r\n# print(c,d)\r\nfor i in range(n):\r\n a=list(map(int,input().split()))\r\n if a[0]==1:\r\n print(c[a[2]]-c[a[1]-1])\r\n else:\r\n print(d[a[2]]-d[a[1]-1])", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\npreSum=[0]\r\ncurSum=0\r\nfor i in a:\r\n curSum+=i\r\n preSum.append(curSum)\r\nb=a.sort()\r\ncurSum=0\r\nsortSum=[0]\r\nfor i in a:\r\n curSum+=i\r\n sortSum.append(curSum)\r\nwhile m:\r\n m-=1\r\n p,l,r=list(map(int,input().split()))\r\n if p==1:\r\n print(preSum[r]-preSum[l-1])\r\n else:\r\n print(sortSum[r]-sortSum[l-1])\r\n\r\n\r\n\r\n ", "import sys\r\nimport math\r\n\r\n\r\nt = int(input())\r\n\r\narr = [int(x) for x in input().split()]\r\narr1 = []\r\narr1.append(0)\r\nfor i in arr:\r\n\tarr1.append(i)\r\n\r\n\r\n\r\n\r\nprefix_unsorted = [0]*(len(arr)+1)\r\nprefix_unsorted[0] = arr1[0]\r\n\r\nfor i in range(1,len(arr1)):\r\n \tprefix_unsorted[i] = prefix_unsorted[i-1] + arr1[i]\r\n\r\nprefix_sorted = [0]*(len(arr)+1)\r\narr1.sort()\t\r\nprefix_sorted[0] = arr1[0]\r\nfor i in range(1,len(arr1)):\r\n \tprefix_sorted[i] = prefix_sorted[i-1] + arr1[i]\r\n\r\nfor i in range(int(input())):\r\n\tq,l,r = map(int,input().split())\r\n\tif q == 1:\r\n\t\tprint(prefix_unsorted[r] - prefix_unsorted[l-1])\r\n\telse:\r\n\t\tprint(prefix_sorted[r] - prefix_sorted[l-1])", "n = int(input())\narr = list(map(int, input().split()))\narr2 = sorted(arr)\n\n# prefix sum algo\nfor i in range(1, n):\n arr[i] += arr[i-1]\n arr2[i] += arr2[i-1]\n\n\nfor _ in range(int(input())):\n t, l, r = map(int, input().split())\n if t == 1:\n print(arr[r-1]-(arr[l-2] if l-2 >= 0 else 0))\n else:\n print(arr2[r-1]-(arr2[l-2] if l-2 >= 0 else 0))\n", "n = int(input())\r\nv = list(map(int, input().split()))\r\nu = v.copy()\r\nu.sort()\r\na = [0]\r\nb = [0]\r\nfor i in range(n):\r\n a.append(a[i] + v[i])\r\n b.append(b[i] + u[i])\r\nfor _ in range(int(input())):\r\n t, l, r = map(int, input().split())\r\n if t == 1:\r\n print(a[r] - a[l - 1])\r\n else:\r\n print(b[r] - b[l - 1])", "n = int(input())\r\nv = list(map(int,input().split()))\r\nv.insert(0,0)\r\nu = sorted(v)\r\nfor x in range(1,n+1):\r\n v[x] += v[x-1]\r\n u[x] += u[x-1]\r\nfor _ in range(int(input())):\r\n typ, l, r = map(int,input().split())\r\n r-=1;l-=1\r\n if typ==1:\r\n print(v[r+1] - v[l])\r\n else:\r\n print(u[r+1] - u[l])", "n = int(input())\nstones = list(map(int, input().split()))\nordered_stones = sorted(stones)\nm = int(input())\n\nstone_list = [0]\nordered_stone_list = [0]\n\nx1, x2 = 0, 0\n\nfor _ in range(len(stones)):\n x1 += stones[_]\n x2 += ordered_stones[_]\n stone_list.append(x1)\n ordered_stone_list.append(x2)\n\n\nfor i in range(m):\n q, l, r = map(int, input().split())\n if q == 1:\n print(stone_list[r] - stone_list[l - 1])\n else:\n print(ordered_stone_list[r] - ordered_stone_list[l - 1])\n \t\t\t\t \t \t \t\t\t \t\t \t \t\t", "n = int(input())\nstones = [int(x) for x in input().split(' ')]\nsor_stones = sorted(stones)\n\npref = [0]\ns_pref = [0]\ns1= 0\ns2= 0\nfor i in range(n):\n s1 = s1 + stones[i]\n s2 = s2 + sor_stones[i]\n pref.append(s1)\n s_pref.append(s2)\n\nn2 = int(input())\nfor i in range(n2):\n q = [int(x) for x in input().split(' ')]\n if q[0] == 1:\n l = q[1]\n r = q[2]\n print(pref[r] - pref[l-1])\n elif q[0] == 2:\n l = q[1]\n r = q[2]\n print(s_pref[r] - s_pref[l-1])\n", "def solve():\n n = int(input())\n\n stones = list(map(int, input().split()))\n sorted_stones = sorted(stones) \n \n m = int(input())\n \n s = [stones[0]]\n sorted_s = [sorted_stones[0]]\n \n for i in range(1, len(stones)):\n s.append(s[i-1] + stones[i])\n\n for i in range(1, len(sorted_stones)):\n sorted_s.append(sorted_s[i-1] + sorted_stones[i])\n \n for i in range(m):\n typ, l, r = input().split()\n typ, l, r = map(int, (typ, l, r))\n if typ == 1:\n if l == 1:\n print(s[r-1])\n else:\n print(s[r-1] - s[l-2])\n elif typ == 2:\n if l == 1:\n print(sorted_s[r-1])\n else:\n print(sorted_s[r-1] - sorted_s[l-2])\n\ndef main():\n solve()\n\n\nif __name__ == '__main__':\n main()\n\n \t \t \t\t \t \t\t \t\t \t\t\t \t", "n = int(input())\r\nprice = list(map(int,input().split()))\r\n\r\nv = [0]\r\nfor i in range(n):\r\n v.append(v[-1]+price[i])\r\nprice.sort()\r\n\r\nu = [0]\r\nfor i in range(n):\r\n u.append(u[-1]+price[i])\r\n \r\nq = int(input())\r\nfor i in range(q):\r\n t,l,r = map(int,input().split())\r\n if t == 1:\r\n print(v[r]-v[l-1])\r\n else:\r\n print(u[r]-u[l-1])\r\n \r\n\r\n\r\n", "n = int(input())\nxlist = list(map(int, input().split()))\nsortedlist = sorted(xlist)\nxsum = [xlist[0]]\nsortedsum = [sortedlist[0]]\nfor v in range(len(xlist) - 1):\n xsum.append(xsum[v]+xlist[v+1])\n sortedsum.append(sortedsum[v]+sortedlist[v+1])\ndef type1(l, r):\n global xsum\n if l == 1:\n return(xsum[r-1])\n else:\n return(int(xsum[r-1]) - int(xsum[l-2]))\ndef type2(l, r):\n global sortedsum\n if l == 1:\n return(sortedsum[r-1])\n else:\n return(int(sortedsum[r-1]) - int(sortedsum[l-2]))\nfor i in range(int(input())):\n type, l, r = list(map(int, input().split()))\n if type == 1:\n print(type1(l, r))\n elif type == 2:\n print(type2(l, r))\n \n \t\t \t \t \t \t\t \t\t\t\t \t\t\t", "n=int(input())\nli=list(map(int,input().split()))\narr=[0,li[0]]\nnew=li.copy()\nnew.sort()\nnrr=[0,new[0]]\nfor i in range(1,n):\n nrr.append(nrr[-1]+new[i])\n arr.append(arr[-1]+li[i])\n\nfor i in range(int(input())):\n p,l,r=map(int,input().split())\n if p==2:\n print(nrr[r]-nrr[l-1])\n else:\n print(arr[r]-arr[l-1])", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=a.copy()\r\nb.sort()\r\ns,f,l,k=0,0,[],[]\r\nfor i in range(n):\r\n s+=a[i]\r\n l.append(s)\r\nfor i in range(n):\r\n f+=b[i]\r\n k.append(f)\r\nfor pratyush in range(int(input())):\r\n x,y,z=list(map(int,input().split()))\r\n if x==1:\r\n if y==1:\r\n print(l[z-1])\r\n else:\r\n print(l[z-1]-l[y-2])\r\n else:\r\n if y==1:\r\n print(k[z-1])\r\n else:\r\n print(k[z-1]-k[y-2])", "n = int(input())\r\na = [int(i) for i in input().split()]\r\na1 = sorted(a)\r\nb1 = [0] * (n + 1)\r\nb2 = [0] * (n + 1)\r\nfor i in range(n):\r\n b1[i + 1] = b1[i] + a[i]\r\n b2[i + 1] = b2[i] + a1[i]\r\nm = int(input())\r\nfor i in range(m):\r\n t, l, r = [int(i) for i in input().split()]\r\n if t == 1:\r\n print(b1[r] - b1[l - 1])\r\n else:\r\n print(b2[r] - b2[l - 1])", "import sys \r\nn=int(sys.stdin.readline())\r\na=[int(x) for x in sys.stdin.readline().split()]\r\nb=sorted(a)\r\nla=[0, a[0]]\r\nlb=[0, b[0]]\r\nfor i in range(1, n):\r\n la.append(a[i]+la[-1])\r\n lb.append(b[i]+lb[-1])\r\nfor i in range(int(sys.stdin.readline())):\r\n f,l,r=[int(x) for x in sys.stdin.readline().split()]\r\n if f==1:\r\n print(la[r]-la[l-1])\r\n else:\r\n print(lb[r]-lb[l-1])\r\n", "n = int(input())\nl = list(map(int, input().split()))\np = [0]\nps = [0]\n\nsum = 0\nfor i in range(n):\n sum += l[i]\n p.append(sum)\nl.sort()\nsum = 0\nfor i in range(n):\n sum += l[i]\n ps.append(sum)\n \nm = int(input())\n\nfor i in range(m):\n q, q1, q2 = map(int, input().split())\n if q == 1:\n print(p[q2]-p[q1-1])\n else:\n print(ps[q2]-ps[q1-1])\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\nprefix = [int(i) for i in input().split()]\r\nq = int(input())\r\nType = []\r\nl = []\r\nr = []\r\n\r\narray = sorted(prefix[:])\r\n\r\nfor i in range(q):\r\n x, y, z = input().split()\r\n Type.append(int(x))\r\n l.append(int(y))\r\n r.append(int(z))\r\n\r\nfor i in range(1, n):\r\n prefix[i] += prefix[i-1]\r\n\r\nfor i in range(1, n):\r\n array[i] += array[i-1]\r\n\r\nfor i in range(q):\r\n if Type[i] == 1:\r\n if l[i] != 1:\r\n print(prefix[r[i]-1] - prefix[l[i]-2])\r\n else:\r\n print(prefix[r[i]-1])\r\n else:\r\n if l[i] != 1:\r\n print(array[r[i]-1] - array[l[i]-2])\r\n else:\r\n print(array[r[i]-1])", "import sys\ninput = sys.stdin.readline\n\n############ ---- Input Functions ---- ############\ndef inp(): # int\n return(int(input()))\ndef inlt(): # list\n return(list(map(int,input().split())))\ndef insr(): # string as char list\n s = input()\n return(list(s[:len(s) - 1]))\ndef instr(): # string\n return input()\ndef invr(): # spaced ints\n return(map(int,input().split()))\n\n\nn = inp()\nv = list(invr())\nu = sorted(v)\npre = [0] * (n+1)\nfor i in range(1, n+1):\n pre[i] = pre[i-1] + v[i-1]\npre_sorted = [0] * (n + 1)\nfor i in range(1, n+1):\n pre_sorted[i] = pre_sorted[i-1] + u[i-1]\n\nm = inp()\nfor _ in range(m):\n type, l, r = list(invr())\n if type == 1:\n print(pre[r] - pre[l-1])\n else:\n print(pre_sorted[r] - pre_sorted[l-1])", "import sys, os\r\nfrom io import BytesIO, IOBase\r\nfrom math import floor, gcd, fabs, factorial, fmod, sqrt, inf, log\r\nfrom collections import defaultdict as dd, deque\r\nfrom heapq import merge, heapify, heappop, heappush, nsmallest\r\nfrom bisect import bisect_left as bl, bisect_right as br, bisect\r\n\r\nif os.path.exists('input.txt'):\r\n sys.stdin = open('input.txt', 'r')\r\n sys.stdout = open('output.txt', 'w')\r\n\r\nn=int(input())\r\nv=list(map(int,input().split()))\r\nu=sorted(v)\r\nv_sum=[0]\r\nu_sum=[0]\r\nfor i in range(1,n+1):\r\n v_sum.append(v_sum[i-1]+v[i-1])\r\n u_sum.append(u_sum[i-1]+u[i-1])\r\nq=int(input())\r\nwhile q>0:\r\n q-=1\r\n t,l,r=map(int,input().split())\r\n if t==1:\r\n print(v_sum[r]-v_sum[l-1])\r\n else:\r\n print(u_sum[r]-u_sum[l-1])", "n=int(input())\r\narr=list(map(int,input().split()))\r\nsum1=[]\r\nsum1.append(0)\r\nsum2=[]\r\nsum2.append(0)\r\nsum_1=0 \r\nsum_2=0\r\nfor i in range(1,n+1):\r\n sum1.append(sum1[i-1]+arr[i-1])\r\ntemp=sorted(arr)\r\nfor i in range(1,n+1):\r\n sum2.append(sum2[i-1]+temp[i-1])\r\nq=int(input())\r\nwhile(q>0):\r\n type,l,r=map(int,input().split())\r\n if(type==1):\r\n print(sum1[r]-sum1[l-1])\r\n else:\r\n print(sum2[r]-sum2[l-1])\r\n q=q-1", "length = int(input())\r\nv = list(map(int,input().split()))\r\nu = sorted(v)\r\n\r\npre_v = [0]\r\npre_u = [0]\r\n\r\nfor i in range(length):\r\n pre_sv = pre_v[i] + v[i]\r\n pre_su = pre_u[i] + u[i]\r\n pre_v.append(pre_sv)\r\n pre_u.append(pre_su)\r\nq = int(input())\r\nfor _ in range(q):\r\n t,l,r = list(map(int,input().split()))\r\n if t == 1:\r\n print(pre_v[r]-pre_v[l-1])\r\n else:\r\n print(pre_u[r] - pre_u[l-1])\r\n\r\n\r\n\r\n \r\n", "n = int(input())\r\nv = list(map(int,input().split()))\r\nm = int(input())\r\nsums=[0]\r\nsums2=[0]\r\nfor i in range(n):\r\n sums.append(sums[i]+v[i])\r\nsl=sorted(v)\r\nfor i in range(n):\r\n sums2.append(sums2[i]+sl[i])\r\nfor i in range(m):\r\n type,l,r = map(int,input().split())\r\n if type == 1 :\r\n print(sums[r] - sums[l - 1])\r\n else:\r\n print(sums2[r] - sums2[l - 1])", "n = int(input())\nstones = list(map(int, input().split()))\nquestions = int(input())\n\nsorted_stones = sorted(stones)\n\nacc = [stones[0]]\nsorted_acc = [sorted_stones[0]]\n\nfor i in range(1, len(stones)):\n acc.append(stones[i] + acc[i - 1])\n sorted_acc.append(sorted_stones[i] + sorted_acc[i - 1])\n\nfor i in range(questions):\n t, l, r = map(int, input().split())\n r-=1\n l-=1\n if t == 1:\n print(acc[r] - (0 if l < 1 else acc[l - 1]))\n else:\n print(sorted_acc[r] - (0 if l < 1 else sorted_acc[l - 1]))\n \t\t \t\t \t\t \t \t\t \t\t\t\t\t \t\t \t\t", "from sys import prefix\n\n\nn=int(input())\na=list(map(int,input().split()))\nq=int(input())\nprefix_sum=[0]*(n+1)\nb=sorted(a)\nfor i in range(n):\n prefix_sum[i+1]=prefix_sum[i]+a[i]\nprefix_sum2=[0]*(n+1)\nfor i in range(n):\n prefix_sum2[i+1]=prefix_sum2[i]+b[i]\nfor i in range(q):\n x,y,z=map(int,input().split())\n if x==1:\n print(prefix_sum[z]-prefix_sum[y-1])\n else:\n print(prefix_sum2[z]-prefix_sum2[y-1])", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Jan 25 20:52:47 2022\r\n\r\n@author: Dell\r\n\"\"\"\r\n\r\nn=int(input())\r\narrayinput=[int(i) for i in input().split()]\r\nl=[0]\r\nl1=[0]\r\nsum0=0\r\nsum1=0\r\nfor i in range(n):\r\n sum0+=arrayinput[i]\r\n l.append(sum0)\r\narrayinput.sort()\r\nfor i in range(n):\r\n sum1+=arrayinput[i]\r\n l1.append(sum1)\r\nt=int(input())\r\nwhile t>0:\r\n x,le,r=map(int,input().split()) \r\n if x==1:\r\n print(l[r]-l[le-1])\r\n else:\r\n print(l1[r]-l1[le-1])\r\n t-=1 ", "from typing import List, Union\r\nfrom collections import namedtuple\r\nimport sys\r\nimport traceback\r\nfrom datetime import datetime\r\nfrom time import perf_counter\r\n\r\n\r\n# Dynamic Programming Solution\r\nclass Soluiton:\r\n def __init__(self, nums: List[int]):\r\n self.nums = nums.copy()\r\n self.memo1 = [0 for _ in range(len(nums))]\r\n self.memo2 = [0 for _ in range(len(nums))]\r\n\r\n for i, n in enumerate(self.nums):\r\n if i == 0:\r\n self.memo1[i] = n\r\n else:\r\n self.memo1[i] = self.memo1[i - 1] + n\r\n\r\n self.nums.sort()\r\n\r\n for i, n in enumerate(self.nums):\r\n if i == 0:\r\n self.memo2[i] = n\r\n else:\r\n self.memo2[i] = self.memo2[i - 1] + n\r\n\r\n def mirais_stones(self, q_type: int, l: int, r: int):\r\n if q_type == 1:\r\n memo = self.memo1\r\n else:\r\n memo = self.memo2\r\n if l - 2 >= 0:\r\n result = memo[r - 1] - memo[l - 2]\r\n else:\r\n result = memo[r - 1]\r\n print(result)\r\n return result\r\n\r\n\r\nTestCase = namedtuple('TestCase', 'q_type l r correct')\r\n\r\n\r\ndef read_test_cases(in_file, out_file):\r\n test_cases = []\r\n nums = None\r\n try:\r\n with open(in_file) as in_f:\r\n with open(out_file) as out_f:\r\n num_len = int(in_f.readline())\r\n nums = in_f.readline().strip().split(' ')\r\n nums = [int(n) for n in nums]\r\n test_num = int(in_f.readline().strip())\r\n for _ in range(test_num):\r\n items = in_f.readline().strip().split(' ')\r\n items = [int(i) for i in items]\r\n correct = int(out_f.readline())\r\n t = TestCase(q_type=items[0], l=items[1], r=items[2], correct=correct)\r\n test_cases.append(t)\r\n # raise Exception('My Test Exception')\r\n except Exception as exc:\r\n exc_name = exc.__class__.__name__\r\n exc_msg = str(exc)\r\n exc_info = sys.exc_info()\r\n print('EXCEPTION:', exc_name, exc_msg)\r\n traceback.print_exception(*exc_info)\r\n return nums, test_cases\r\n\r\n\r\ndef run_test_cases(nums: List[int], test_cases: List[TestCase]):\r\n solution = Soluiton(nums)\r\n print('NUMS:', nums)\r\n for t in test_cases:\r\n result = solution.mirais_stones(t.q_type, t.l, t.r)\r\n print('TYPE:', t.q_type, 'LEFT:', t.l, 'RIGHT:', t.r, 'CORRECT:', t.correct,\r\n 'RESULT:', result, 'CHECK:', result == t.correct)\r\n\r\n\r\nif __name__ == '__main__':\r\n if len(sys.argv) > 1 and '--debug' in sys.argv:\r\n time_str = datetime.utcnow().strftime('%Y.%m.%d %H:%M:%S')\r\n print('STARTING:', time_str)\r\n nums, test_cases = read_test_cases('data/input.txt', 'data/output.txt')\r\n start_counter = perf_counter()\r\n run_test_cases(nums, test_cases)\r\n stop_counter = perf_counter()\r\n print('COUNTER:', stop_counter - start_counter)\r\n else:\r\n num_len = int(input().strip())\r\n nums = []\r\n for _ in range(num_len):\r\n n_list = []\r\n while True:\r\n c = sys.stdin.read(1).strip()\r\n if len(c) == 0:\r\n break\r\n n_list.append(c)\r\n nums.append(''.join(n_list))\r\n test_num = int(input().strip())\r\n nums = [int(n) for n in nums]\r\n solution = Soluiton(nums)\r\n for _ in range(test_num):\r\n items = input().strip().split(' ')\r\n items = [int(i) for i in items]\r\n solution.mirais_stones(items[0], items[1], items[2])\r\n", "def calculate_prefix_sum(arr):\n prefix_sum = [0]\n for num in arr:\n prefix_sum.append(prefix_sum[-1] + num)\n return prefix_sum\n\n# Input processing\nn = int(input())\nstone_costs = list(map(int, input().split()))\n\n# Preprocessing\noriginal_prefix_sum = calculate_prefix_sum(stone_costs)\nsorted_prefix_sum = calculate_prefix_sum(sorted(stone_costs))\n\n# Query processing\nq = int(input()) # Number of queries\nfor _ in range(q):\n type_query, l, r = map(int, input().split())\n if type_query == 1:\n # Original order sum\n print(original_prefix_sum[r] - original_prefix_sum[l-1])\n else:\n # Sorted order sum\n print(sorted_prefix_sum[r] - sorted_prefix_sum[l-1])\n\n\t \t \t\t\t\t\t\t \t\t\t\t \t \t\t\t \t", "def questionOne(n,array): #Tackles type 1 \n list1 = []\n total = 0\n for i in array:\n total += i\n list1.append(total)\n list1.append(0)\n return list1 \n\ndef questionTwo(n,array):\n list2 = []\n total = 0\n array = sorted(array)\n for i in array:\n total += i\n list2.append(total)\n list2.append(0)\n return list2\n\nn = int(input())\narray = list(map(int, input().split()))\narray_1 = questionOne(n,array)\narray_2 = questionTwo(n, array)\n#print(array_1)\nm = int(input())\nfor j in range(m):\n type, l, r = map(int, input().split())\n #print(type, l, r)\n if(type == 1): \n value = array_1[r-1] - array_1[l-2]\n print(value)\n else: \n value = array_2[r-1] - array_2[l-2]\n print(value)\n\n\t \t\t \t\t \t\t\t \t \t\t \t\t\t\t", "n = int(input())\nl1 = list(map(int, input().split()))\nsorted_l1 = sorted(l1)\n\nans1 = [0] * n\nans2 = [0] * n \nans1[0] = l1[0]\nans2[0] = sorted_l1[0]\nfor i in range(1, n):\n ans1[i] = ans1[i-1] + l1[i]\n ans2[i] = ans2[i-1] + sorted_l1[i]\n\nm = int(input())\nfor i in range(m):\n t, l, r = list(map(int, input().split()))\n l -= 1\n r -= 1\n\n if t == 1:\n if l == 0:\n print(ans1[r])\n else:\n print(ans1[r] - ans1[l-1])\n else:\n if l == 0:\n print(ans2[r])\n else:\n print(ans2[r] - ans2[l-1])", "n = int(input())\r\narr = list(map(int, input().split()))\r\nsorted_arr = sorted(arr)\r\n\r\npref = [0, arr[0]]\r\npref_sort = [0, sorted_arr[0]]\r\n\r\nfor i in range(1, n):\r\n pref += [pref[-1] + arr[i]]\r\n pref_sort += [pref_sort[-1] + sorted_arr[i]]\r\n\r\n# print(pref)\r\n# print(pref_sort)\r\nm = int(input())\r\nfor i in range(m):\r\n type, l, r = map(int, input().split())\r\n if type == 1:\r\n print(pref[r] - pref[l - 1])\r\n else:\r\n print(pref_sort[r] - pref_sort[l - 1])", "import sys\r\nfrom os import path\r\nif(path.exists('input.txt')):\r\n sys.stdin = open('input.txt', 'r')\r\n sys.stdout = open('output.txt', 'w')\r\n\r\n# input = sys.stdin.readline\r\n\r\nget_int = lambda: int(input())\r\nget_ints = lambda: map(int, input().split())\r\nget_ints_list = lambda: list(get_ints())\r\n\r\nn = get_int()\r\na = get_ints_list()\r\n\r\npre = [0] * n\r\nspre = [0] * n\r\npre[0] = a[0]\r\nfor i in range(1, n):\r\n pre[i] = a[i] + pre[i - 1]\r\n\r\nb = list(a)\r\nb.sort()\r\nspre[0] = b[0]\r\nfor i in range(1, n):\r\n spre[i] = b[i] + spre[i - 1]\r\nm = get_int()\r\nfor _ in range(m):\r\n t, l, r = get_ints()\r\n l -= 1\r\n r -= 1\r\n if t == 2:\r\n print(spre[r] - spre[l] + b[l])\r\n else:\r\n print(pre[r] - pre[l] + a[l])", "n=int(input())\r\nl1=[int(i) for i in input().split()]\r\nl2=l1.copy()\r\nl2.sort()\r\nc_l1=[0]\r\nc_l2=[0]\r\nfor x in range(n):\r\n c_l1.append(c_l1[x]+l1[x])\r\n c_l2.append(c_l2[x]+l2[x])\r\nm=int(input())\r\nfor j in range(m):\r\n t,l,r=[int(k) for k in input().split()]\r\n if t==1:\r\n print(c_l1[r]-c_l1[l-1])\r\n else :\r\n print(c_l2[r]-c_l2[l-1])", "a=int(input())\r\nx=list(map(int,input().split()))\r\ny=sorted(x)\r\nq=int(input())\r\nx1=[0,x[0]]\r\ny1=[0,y[0]]\r\nfor i in range(1,a):\r\n y1.append(y1[-1]+y[i])\r\n x1.append(x1[-1]+x[i])\r\nfor i in range(q):\r\n k,i,j=map(int,input().split())\r\n if k==1:\r\n print(x1[j]-x1[i-1])\r\n else:\r\n print(y1[j]-y1[i-1])", "n = int(input())\r\nl = [int(i) for i in input().split()]\r\ndp = [0 for i in range(n+1)]\r\ns = list(l)\r\ns.sort()\r\nimp = [0 for i in range(n+1)]\r\nfor j in range(1,n+1):\r\n dp[j] = dp[j-1] + l[j-1]\r\n imp[j] = imp[j-1] + s[j-1]\r\n\r\n\r\n\r\nq = int(input())\r\n\r\nfor e in range(q):\r\n t , left, right = map(int,input().split())\r\n if t == 1:\r\n print(str(dp[right]-dp[left-1]))\r\n else:\r\n print(str(imp[right]-imp[left-1]))\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\ncumulative_sum = [0] * n\r\ncumulative_sum[0] = a[0]\r\nfor i in range(1, n):\r\n cumulative_sum[i] = cumulative_sum[i - 1] + a[i]\r\n\r\nsorted_a = sorted(a)\r\nsorted_cumulative_sum = [0] * n\r\nsorted_cumulative_sum[0] = sorted_a[0]\r\nfor i in range(1, n):\r\n sorted_cumulative_sum[i] = sorted_cumulative_sum[i - 1] + sorted_a[i]\r\n\r\nm = int(input())\r\nfor i in range(m):\r\n type_, l, r = list(map(int, input().split()))\r\n l -= 1\r\n r -= 1\r\n if type_ == 1:\r\n print(cumulative_sum[r]) if l == 0 else print(cumulative_sum[r] - cumulative_sum[l - 1])\r\n else:\r\n print(sorted_cumulative_sum[r]) if l == 0 else print(sorted_cumulative_sum[r] - sorted_cumulative_sum[l - 1])", "n = int(input())\nstones = list(map(int, input().split()))\nsorted_stones = sorted(stones)\n\nanswer1 = [0] * n\nanswer2 = [0] * n \nanswer1[0] = stones[0]\nanswer2[0] = sorted_stones[0]\nfor i in range(1, n):\n answer1[i] = answer1[i-1] + stones[i]\n answer2[i] = answer2[i-1] + sorted_stones[i]\n\nm = int(input())\nfor i in range(m):\n t, l, r = list(map(int, input().split()))\n l -= 1\n r -= 1\n\n if t == 1:\n if l == 0:\n print(answer1[r])\n else:\n print(answer1[r] - answer1[l-1])\n else:\n if l == 0:\n print(answer2[r])\n else:\n print(answer2[r] - answer2[l-1])\n \t\t\t \t \t \t\t \t\t \t\t \t \t \t \t\t\t\t", "n=int(input())\r\nL=list(map(int,input().split()))\r\nL1=[0]\r\nsum=0\r\nfor i in range(n):\r\n sum+=L[i]\r\n L1.append(sum)\r\nL.sort()\r\nsum=0\r\nL2=[0]\r\nfor i in range(n):\r\n sum+=L[i]\r\n L2.append(sum)\r\nq=int(input())\r\nfor _ in range(q):\r\n t,l,r=map(int,input().split())\r\n if t-1:\r\n print(L2[r]-L2[l-1])\r\n else:\r\n print(L1[r]-L1[l-1])", "import sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n############ ---- Input Functions ---- ############\r\n\r\ndef Kuriyama_Mirai_Stones():\r\n n = inp()\r\n stoneSequence = inlt()\r\n stoneSequence_sorted = sorted(stoneSequence)\r\n\r\n stoneSequenceSum = []\r\n stoneSequence_sorted_sum = []\r\n\r\n runningSum = 0\r\n for stone in stoneSequence:\r\n runningSum += stone \r\n stoneSequenceSum.append(runningSum)\r\n\r\n runningSum = 0\r\n for stone in stoneSequence_sorted:\r\n runningSum += stone \r\n stoneSequence_sorted_sum.append(runningSum)\r\n\r\n m = inp()\r\n # print(stoneSequence_sorted_sum)\r\n # print(stoneSequenceSum)\r\n\r\n outputStr = ''\r\n for ques in range(m):\r\n type_of_ques,l,r = invr()\r\n\r\n if type_of_ques == 1:\r\n if l == 1:\r\n ans = stoneSequenceSum[r-1]\r\n else:\r\n ans = stoneSequenceSum[r-1] - stoneSequenceSum[l-2]\r\n else:\r\n if l == 1:\r\n ans = stoneSequence_sorted_sum[r-1]\r\n else:\r\n ans = stoneSequence_sorted_sum[r-1] - stoneSequence_sorted_sum[l-2]\r\n \r\n outputStr += str(ans) + '\\n'\r\n\r\n outputStr = outputStr.strip()\r\n print(outputStr)\r\n return \r\n\r\nKuriyama_Mirai_Stones() ", "n=int(input())\nv=list(map(int,input().split(' ')))\ntest=int(input())\na=v.copy()\na.sort()\n\nfor i in range(1,n):\n a[i]=a[i-1]+a[i]\nfor i in range(1,n):\n v[i]=v[i-1]+v[i]\n\n\n\nfor t in range(test):\n Type,l,r=map(int,input().split(' '))\n if l!=1:\n if Type==1:\n print(v[r-1]-v[l-2])\n else:\n print(a[r-1]-a[l-2])\n else:\n if Type==1:\n print(v[r-1])\n else:\n print(a[r-1])\n\n\n\n", "n = int(input())\r\nmas = list(map(int,input().split()))\r\nm = int(input())\r\ntemp = sorted(mas)\r\n\r\na = [0]*n\r\nb = [0]*n\r\nfor i in range(n):\r\n a[i] = mas[i] + a[i-1]\r\n b[i] = temp[i] + b[i-1]\r\n\r\nfor i in range(m):\r\n t,l,r = map(int,input().split())\r\n if t == 1:\r\n if l-2 == -1:\r\n print(a[r-1])\r\n else:\r\n print(a[r-1]-a[l-2])\r\n else:\r\n if l-2 == -1:\r\n print(b[r-1])\r\n else:\r\n print(b[r-1]-b[l-2])\r\n \r\n", "n=int(input())\r\n\r\na=list(map(int,input().split()))\r\n\r\nb=sorted(a)\r\n\r\nfor i in range(n-1):\r\n\ta[i+1]+=a[i]\r\n\tb[i+1]+=b[i]\r\n\r\n\r\na,b=[0]+a,[0]+b\r\n\r\nfor i in range(int(input())):\r\n\tty,l,r=map(int,input().split())\r\n\t\r\n\tprint(b[r]-b[l-1] if ty == 2 else a[r]-a[l-1])", "import sys\r\n \r\ndef miraiStones(cum_list, l, r, n):\r\n \r\n if l == 0:\r\n return cum_list[r]\r\n else:\r\n return cum_list[r] - cum_list[l-1]\r\n \r\n \r\n \r\n \r\nn = int(input())\r\nl = list(map(int, sys.stdin.readline().split()))\r\nm = int(input())\r\n\r\ncum = []\r\ncum.append(l[0])\r\nfor i in range(1,len(l),1):\r\n cum.append(cum[i-1] + l[i])\r\n\r\nsorted_l = sorted(l)\r\n\r\nsorted_cum = []\r\nsorted_cum.append(sorted_l[0])\r\nfor i in range(1,len(sorted_l),1):\r\n sorted_cum.append(sorted_cum[i-1] + sorted_l[i])\r\n\r\nfor i in range(m):\r\n req, l, r = map(int, sys.stdin.readline().split())\r\n ans = 0\r\n if req == 1:\r\n ans = miraiStones(cum, l-1, r-1, n)\r\n else:\r\n ans = miraiStones(sorted_cum, l-1, r-1, n)\r\n print(ans)", "number_of_stones = int(input())\r\ndef prefix_sum(array):\r\n for i in range(1,number_of_stones+1):\r\n array[i]+=array[i-1]\r\n return array\r\ndef output_result(l,r,array):\r\n return array[r]-array[l-1]\r\narray = [0]+list(map(int,input().split()))\r\narray_sorted = array.copy()\r\narray_sorted.sort()\r\narray = prefix_sum(array)\r\narray_sorted = prefix_sum(array_sorted)\r\nfor m in range(int(input())):\r\n type,l,r = map(int,input().split())\r\n print(output_result(l,r,[array_sorted,array][type==1]))", "a=int(input())\r\narr=[int(i) for i in input().split()]\r\narr2=[arr[0]]\r\nfor i in range(1,a):\r\n arr2.append((arr[i]+arr2[-1]))\r\narr3=sorted(arr)\r\narr4=[arr3[0]]\r\nfor i in range(1,a):\r\n arr4.append((arr3[i]+arr4[-1]))\r\narr=list(arr2)\r\narr2=list(arr4)\r\nfor i in range(int(input())):\r\n a,b,c=map(int, input().split())\r\n if(a==1):\r\n if(b==1):\r\n print(arr[c-1])\r\n else:\r\n print(arr[c-1]-arr[b-2])\r\n else:\r\n if(b==1):\r\n print(arr2[c-1])\r\n else:\r\n print(arr2[c-1]-arr2[b-2])", "n = int(input())\r\na = [int(i) for i in input().split()]\r\n\r\nv = [a[0]]\r\nfor i in range(1, n):\r\n v.append(v[i-1] + a[i])\r\nv = [0] + v\r\n\r\na.sort()\r\nu = [a[0]]\r\nfor i in range(1, n):\r\n u.append(u[i-1] + a[i])\r\nu = [0] + u\r\n\r\nfor _ in range(int(input())):\r\n inp = [int(i) for i in input().split()]\r\n\r\n if inp[0] == 1:\r\n print(v[inp[2]] - v[inp[1]-1])\r\n else:\r\n print(u[inp[2]] - u[inp[1]-1])\r\n\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\nfrom math import log2,floor\r\ndef main():\r\n n,l,k=rm()\r\n rb=[]\r\n for i in range(n):\r\n rb.append(rl())\r\n rb=[[rb[i][j] for i in range(len(rb))] for j in range(len(rb[0]))]\r\n m=floor(log2(n))+1\r\n tbs=[]\r\n for ii in range(l):\r\n tb=[[0 for _ in range(m)]for _ in range(n)]\r\n for i in range(n):\r\n tb[i][0]=rb[ii][i]\r\n for j in range(1,m):\r\n for i in range(n):\r\n if i+(1<<j)>n: break\r\n tb[i][j]=max(tb[i][j-1],tb[i+(1<<(j-1))][j-1])\r\n tbs.append(tb)\r\n def query(l,r,m):\r\n p=floor(log2(r+1-l))\r\n return max(tbs[m][l][p],tbs[m][r-(1<<p)+1][p])\r\n def ok(ln):\r\n for i in range(n-ln+1):\r\n rq=0\r\n for j in range(l):\r\n rq+=query(i,i+ln-1,j)\r\n if rq<=k: return True\r\n return False\r\n rs=[]\r\n if ok(n):\r\n for i in range(l):\r\n rs.append(query(0,n-1,i))\r\n return rs\r\n if not ok(1):\r\n return [0]*l\r\n lo,hi=1,n\r\n while lo<hi-1:\r\n md=(lo+hi)//2\r\n if ok(md): lo=md\r\n else: hi=md\r\n # print(lo)\r\n for i in range(n-lo+1):\r\n rq=[]\r\n for j in range(l):\r\n rq.append(query(i,i+lo-1,j))\r\n # print(rq)\r\n if sum(rq)<=k: return rq \r\nprint(*main())" ]

[ "n=int(input())\r\nx=int(n/2)\r\nfor i in range(1,n+1):\r\n\tprint(\"*\"*x+'D'*(n-(2*x))+'*'*x)\r\n\tif i <=int(n/2) :\r\n\t\tx-=1\r\n\telse :\t\r\n\t\tx+=1\r\n\t# print(x,i)", "q=lambda:map(int,input().split())\r\nqi=lambda:int(input())\r\nqs=lambda:input().split()\r\nn=qi()\r\nstar=n//2\r\nd=1\r\nfor i in range(n//2):\r\n print('*'*star+'D'*d+'*'*star)\r\n star-=1\r\n d+=2\r\nprint('D'*n)\r\nfor i in range(n//2):\r\n star+=1\r\n d-=2\r\n print('*'*star+'D'*d+'*'*star)", "n = int(input())\n\nfor i in range(1+(n)//2):\n num_D = 1 + ((i)*2)\n num_ast = (n-num_D)//2\n str_d = ''.join(['*']*(num_ast)+['D']*(num_D)+['*']*(num_ast))\n print(str_d)\n\nfor i in range((n)//2):\n num_D = n - ((i+1)*2)\n num_ast = (n-num_D)//2\n str_d = ''.join(['*']*(num_ast)+['D']*(num_D)+['*']*(num_ast))\n print(str_d)\n\n\t\t\t\t \t\t \t \t\t \t \t\t\t\t\t \t", "n = int(input())\r\nl = []\r\n\r\nfor i in range(1, n//2+2):\r\n s = ''\r\n for x in range((n//2+1)-i):\r\n s += '*'\r\n\r\n for y in range(i*2-1):\r\n s += 'D'\r\n\r\n for z in range((n//2+1)-i):\r\n s += '*' \r\n\r\n l.append(s)\r\n\r\nm = l[:len(l)-1]\r\nm.reverse()\r\nl += m\r\n\r\nfor j in l:\r\n print(j)", "import sys;sc = sys.stdin.readline;out=sys.stdout.write\r\n\r\nn=int(sc());o=0;oo=1;f=0\r\nfor i in range(1,n+1):\r\n for e in range((n//2)-o):\r\n out(\"*\")\r\n for e in range(0,oo):\r\n out(\"D\")\r\n for e in range((n//2)-o):out(\"*\")\r\n \r\n if (n//2)-o!=0 and f==0: \r\n o+=1\r\n oo+=2 \r\n else:o-=1;oo-=2;f+=1\r\n out(\"\\n\")", "n = int(input())\r\nfor i in range(1, n + 1, 2):\r\n print(\"*\" * ((n - i) // 2) + \"D\" * i + \"*\" * ((n - i) // 2))\r\n\r\nfor i in range(n - 2, -1, -2):\r\n print(\"*\" * ((n - i) // 2) + \"D\" * i + \"*\" * ((n - i) // 2))\r\n", "n=int(input())\r\nfor i in range(n//2+1):\r\n\tx=(2*i)+1\r\n\tprint(\"*\"*((n//2)-i),end='')\r\n\tprint(\"D\"*x,end='')\r\n\tprint(\"*\"*((n//2)-i))\r\nfor i in range(n//2-1,-1,-1):\r\n\tx=(2*i)+1\t\r\n\tprint(\"*\"*((n//2)-i),end='')\r\n\tprint(\"D\"*x,end='')\r\n\tprint(\"*\"*((n//2)-i))", "a = int(input())\r\ndef nor(n):\r\n for i in range(1, n, 2):\r\n f = '*'*int((n-i)/2)\r\n d = f+'D'*i+f\r\n print(d)\r\ndef rev(h):\r\n for i in range(h, 0, -2):\r\n q = '*'*int((h-i)/2)\r\n w = q+'D'*i+q\r\n print(w)\r\nnor(a)\r\nrev(a)\r\n \r\n", "n = int(input())\r\n\r\nfor i in range(int(n/2)):\r\n\tprint(('D'*((2*i)+1)).center(n,'*'))\r\n\r\nprint('D'*n)\r\n\r\nfor i in range(int(n/2),0,-1):\r\n\tprint(('D'*((2*i)-1)).center(n,'*'))", "\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\nn = get_single_int ()\nans = []\nmid = 'D'*n\n#print (mid)\nans.append (mid)\nfor i in range (n //2):\n #we are going to change (i + 1)*2 elements.i + 1 from the front and i + 1 from the back.\n #from the front: (i + 1)*'.'+mid [ i + 1:n - 1 - a -1] + (i + 1)*'.'\n tmp = (i + 1)*'*' + mid [i + 1:n -( i + 1)]+ (i + 1)*'*'\n #print (\"tmp: \", tmp)\n ans.append (tmp)\n ans.insert (0, tmp)\nfor i in range (n):\n print (ans [i])\n\n", "n = int(input())\r\nfor i in range(n):\r\n x = 2 * min(i + 1, n - i) - 1\r\n print(((n - x) // 2) * '*' + x * 'D' + ((n - x) // 2) * '*' )\r\n", "n=int(input())\r\ns=n//2\r\nfor i in range(s+1):\r\n print('*'*s,'D'*(n-s*2),'*'*s,sep=\"\")\r\n s-=1\r\ns=1\r\nfor i in range(n//2):\r\n print('*'*s,'D'*(n-s*2),'*'*s,sep=\"\")\r\n s+=1\r\n", "n = int(input())\r\ninc = d = 1\r\n\r\nfor _ in range(n):\r\n star = (n - d) // 2\r\n print(('*' * star) + ('D' * d) + ('*' * star))\r\n if d == n:\r\n inc = -1\r\n d += (2 * inc)\r\n", "n = int(input())\r\n\r\ni = 0\r\nk = n//2\r\nwhile (i < n//2):\r\n print(\"*\"*k + \"D\"*(2*i+1) + \"*\"*k)\r\n i += 1\r\n k -= 1\r\n\r\ni = n//2\r\nk = 0\r\nwhile (i >=0):\r\n print(\"*\"*k + \"D\"*(2*i+1) + \"*\"*k)\r\n i -= 1\r\n k += 1\r\n", "n=int(input())\r\nfor i in range(n):\r\n l=abs(n//2-i)\r\n print('*'*l+(n-l*2)*'D'+'*'*l)", "n=int(input())\r\na=n//2\r\nfor x in range(n):\r\n\tl='*'*n\r\n\tm=list(l)\r\n\tif x<=a:\r\n\t\tfor y in range(x+1):\r\n\t\t\tm[a+y]=\"D\"\r\n\t\t\tm[a-y]=\"D\"\r\n\t\tprint(\"\".join(m))\r\n\telse:\r\n\t\tfor y in range(n-x):\r\n\t\t\tm[a+y]=\"D\"\r\n\t\t\tm[a-y]=\"D\"\r\n\t\tprint(\"\".join(m))", "n = int(input())\r\nd = 1\r\nj = n//2\r\nfor i in range(1,n+1):\r\n print('*'*j,'D'*d,'*'*j,sep='')\r\n if i >= n//2+1:\r\n d-=2\r\n j+=1\r\n else:\r\n d+=2\r\n j-=1", "n = int(input())\r\n\r\nres = []\r\n\r\nfor i in range(n):\r\n res.append(['*'] * n)\r\n\r\nmiddle = n // 2\r\n\r\nfor i in range(n):\r\n if i <= middle:\r\n for j in range(middle-i, middle+i+1):\r\n res[i][j] = 'D'\r\n else:\r\n\r\n for j in range(i - middle, n - (i-middle)):\r\n res[i][j] = 'D'\r\n\r\n\r\nfor i in range(n):\r\n print(*res[i], sep=\"\")\r\n\r\n", "n = int(input())\r\nm = 1+(n-1)//2 \r\nlines = []\r\nfor k in range(1, m+1):\r\n m -= 1\r\n core = \"D\" * (2*k-1)\r\n preSuf = '*' * m\r\n lines.append(preSuf + core + preSuf)\r\nlines += reversed(lines[:-1])\r\nprint('\\n'.join(lines))", "def li():\r\n return list(map(int,input().split()))\r\ndef gi(n):\r\n return [list(map(int,input().split())) for _ in range(n)]\r\n\r\n# File input\r\n\r\n# import sys\r\n# sys.stdin = open('user.txt','r')\r\n\r\nn = int(input())\r\nd = 1\r\ndow = 1\r\nfor _ in range(n):\r\n print('*'*((n-d)//2)+'D'*d+'*'*((n-d)//2))\r\n d += 2 if dow else -2\r\n if d > n:\r\n dow = 0\r\n d -= 4\r\n \r\n", "n = int(input())\r\nrow = 1\r\nflag = False\r\nfor i in range(n):\r\n tmp = (n - row) // 2\r\n print(\"*\" * tmp + \"D\" * row + \"*\" * tmp)\r\n if not flag:\r\n row += 2\r\n else:\r\n row -= 2\r\n if row > n:\r\n row -= 4\r\n flag = True\r\n", "def main():\r\n n = int(input())\r\n\r\n start = n // 2\r\n rows = []\r\n\r\n while start >= 0:\r\n row = '*' * start\r\n row += 'D' * (n - 2 * start)\r\n row += '*' * start\r\n start -= 1\r\n rows.append(row)\r\n\r\n for e in rows:\r\n print(e)\r\n\r\n for e in reversed(rows[:-1]):\r\n print(e)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\ni = 0\nj = 1\nl = n//2 \nfor i in range(n):\n for k in range(l):\n print('*',end=\"\")\n for k in range(j):\n print('D',end='')\n for k in range(l):\n print('*',end=\"\")\n print()\n\n i+=1\n if i <=n//2:\n j+=2\n l -=1\n else :\n j-=2\n l+=1", "x = int(input())\r\ny = x//2\r\nz = 1\r\na = 2\r\nb = 1\r\nc = 0\r\nfor i in range(x):\r\n if y > 0:\r\n print('*'*y + \"D\"*z + '*'*y)\r\n z += 2\r\n y -= 1\r\n elif y == 0 and c == 0:\r\n print('D'*x)\r\n c = 1\r\n else:\r\n print('*'*(y+b) + 'D'*(z-a) + '*'*(y+b))\r\n a += 2\r\n b += 1\r\n", "import math\r\nn1 = int(input())\r\ncount1 = (n1-1)//2\r\ncount2 = 1\r\nfor i in range(math.ceil(n1/2)):\r\n print(count1 * \"*\" + count2 * \"D\"+count1 * \"*\")\r\n count1-=1\r\n count2+=2\r\n\r\ncount1 = 1\r\ncount2 = n1 - 2\r\nfor i in range(n1 - math.ceil(n1/2)):\r\n print(count1 * \"*\" + count2 * \"D\" + count1 * \"*\")\r\n count1 +=1\r\n count2 -= 2\r\n \r\n\r\n \r\n", "n = int(input())\nfor i in range(n // 2 + 1):\n for j in range(n // 2 - i): print('*',end='')\n for j in range(2 * i + 1): print('D', end='')\n for j in range(n // 2 - i): print('*',end='')\n print()\nfor i in range(n // 2 - 1, - 1, -1):\n for j in range(n // 2 - i): print('*',end='')\n for j in range(2 * i + 1): print('D', end='')\n for j in range(n // 2 - i): print('*',end='')\n print()\n \t \t\t\t\t \t \t \t \t \t\t \t\t \t\t", "n = int(input())\r\na =[]\r\nfor i in range(n//2+1):\r\n\tv=[]\r\n\tfor j in range(n//2-i):\r\n\t\tv.append(\"*\")\r\n\tfor j in range(i):\r\n\t\tv.append(\"D\")\r\n\tv.append(\"D\")\r\n\tfor j in range(i):\r\n\t\tv.append(\"D\")\r\n\tfor j in range(n//2-i):\r\n\t\tv.append(\"*\")\r\n\ta.append(v)\r\nb = a.copy()\r\nb.reverse()\r\nfor i in range(1,len(a)):\r\n\ta.append(b[i])\r\nfor i in a:\r\n\tprint(\"\".join(i))", "def draw_diamond(length, dia, emp):\r\n for i in range(length):\r\n print(abs(length // 2 - i) * emp + (length - 2*abs(length//2 - i)) * dia + abs(length // 2 - i) * emp)\r\n\r\n\r\ndraw_diamond(int(input()), 'D', '*')\r\n", "n = int(input()); m = n//2; k = 1\r\nfor i in range(n):\r\n if k<n:\r\n print('*'*m + 'D'*k + '*'*m)\r\n m-=1; k+=2\r\nk=n\r\nfor i in range(n):\r\n print('*'*m + 'D'*k + '*'*m)\r\n m+=1; k-=2\r\n if m>n//2: break", "b = int(input())\r\nc=0\r\nd=(b-1)/2\r\nwhile c*4 <= (b-1)*2-1:\r\n k=(b-(c*2)+1)/2\r\n k=int(k-1)\r\n print(\"*\"*k+\"D\"*int(c)+'D'+\"D\"*int(c)+k*\"*\")\r\n c+=1\r\nwhile d >= 0:\r\n h=(b-(d*2)+1)/2\r\n h=int(h-1)\r\n print(\"*\"*h+\"D\"*int(d)+\"D\"+\"D\"*int(d)+\"*\"*h)\r\n d-=1\r\n \r\n \r\n ", "n = int(input())\r\ns = \"\"\r\np1, p2 = 1, 1\r\nc = 1\r\nq = 2\r\nc2 = n - q\r\nk = (n-p1)//2\r\nfor i in range(n):\r\n if i < n//2:\r\n s += \"*\"*k+\"D\"*c+\"*\"*k\r\n s += \"\\n\"\r\n k -= 1\r\n c += 2\r\n elif i == n//2:\r\n s += \"D\"*n\r\n s += \"\\n\"\r\n else:\r\n s += \"*\"*p2+\"D\"*c2+\"*\"*p2\r\n p2 += 1\r\n c2 -= 2\r\n if i != n-1:\r\n s += \"\\n\"\r\nprint(s)", "# A. Little Pony and Crystal Mine\n\nn = int(input())\n\nnum_of_d = -1\nfor i in range(1, n+1):\n if i <= (n + 2 - 1) // 2:\n num_of_d += 2\n else:\n num_of_d -= 2\n stars = (n - num_of_d) // 2\n print(''.join([stars * '*', num_of_d * 'D', stars * '*']))\n", "n=int(input())\r\ns=\"\"\r\nx=int(n/2)\r\nfor i in range(x+1):\r\n s='*'*(x-i)\r\n s+='D'*(2*i+1)\r\n s+='*'*(x-i)\r\n print(s)\r\nfor i in reversed(range(x)):\r\n s='*'*(x-i)\r\n s+='D'*(2*i+1)\r\n s+='*'*(x-i)\r\n print(s)\r\n", "els = []\r\ni = 0\r\nn = int(input())\r\nfor _ in range(n//2+1):\r\n a = (n - (2*i) - 1)//2\r\n el = '*'*a + 'D'*(2*i+1) + '*'*a \r\n i += 1\r\n els.append(el)\r\n print(el)\r\nfor i in range(len(els) - 2, -1, -1):\r\n print(els[i])", "n = int(input())\r\narr =[]\r\nfor i in range(int(n/2)):\r\n s = \"*\"*int((n-(2*i+1))/2)+\"D\"*(2*i+1)+\"*\"*int((n-(2*i+1))/2)\r\n arr.append(s)\r\nprint('\\n'.join(arr))\r\nprint(\"D\"*n)\r\narr = reversed(arr)\r\nprint('\\n'.join(arr))\r\n", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef main():\r\n n = int(input())\r\n A = []\r\n for i in range(n):\r\n A.append(['*'] * n)\r\n cx = (n - 1) // 2\r\n cy = (n - 1) // 2\r\n for i in range(n):\r\n for j in range(n):\r\n delta = abs(i - cx) + abs(j - cy)\r\n if delta <= (n - 1) // 2:\r\n A[i][j] = 'D'\r\n for i in range(n):\r\n print(''.join(A[i]))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\nrow = ['*'] * n\ncenter = n // 2\nfor i in range(n):\n new_char = 'D' if i <= center else '*'\n index_to_change = center - min(i, n - i)\n row[index_to_change] = new_char\n index_to_change = center + min(i, n - i)\n row[index_to_change] = new_char\n print(''.join(row))\n", "n = int(input())\ntreshold = 0\nhalf = n // 2\n\nfor i in range(n):\n for j in range(n):\n if(j >= half - treshold and j <= half + treshold):\n print(\"D\", end=\"\")\n else:\n print(\"*\", end=\"\")\n\n if(i >= half):\n treshold -= 1\n else:\n treshold += 1\n print()\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(0, n):\r\n s = abs(n//2 - i)\r\n print(\"*\"*s + \"D\"*(n-2*s) + \"*\"*s)", "n = int(input())\r\n\r\nfor i in range(n // 2 + 1):\r\n print((n - 2 * i - 1) // 2 * \"*\" + (2 * i + 1) * \"D\" + (n - 2 * i - 1) // 2 * \"*\")\r\n\r\ncount = n - 2\r\n\r\nfor z in range(n // 2):\r\n print((n - count) // 2 * \"*\" + count * \"D\" + (n - count) // 2 * \"*\")\r\n count = count - 2", "n = int(input())\r\nfor i in range(0,n//2+1):\r\n print(\"*\"*((n-1)//2-i)+\"D\"*(2*i+1)+\"*\"*((n-1)//2-i))\r\nfor i in range(0,n//2):\r\n print(\"*\"*(i+1)+\"D\"*(n-2*(i+1))+\"*\"*(i+1))\r\n", "n = int(input())\r\nhalf = (n + 1) // 2\r\nstars = half - 1\r\nds = 1\r\nfor i in range(n//2):\r\n sTemp = '*' * stars\r\n sTemp += 'D' * ds\r\n sTemp += '*' * stars\r\n stars -= 1\r\n ds += 2\r\n print(sTemp)\r\nprint('D' * ds)\r\nstars = 1\r\nds = n - 2\r\nfor j in range(n//2):\r\n tempStr = '*' * stars\r\n tempStr += 'D' * ds\r\n tempStr += '*' * stars\r\n stars += 1\r\n ds -= 2\r\n print(tempStr)\r\n", "# for testCase in range(int(input())):\nn = int(input())\nans = \"\"\nfor i in range(1 ,(n+1)//2+1):\n cur = i*2-1\n ans += '*'*((n-cur)//2) + 'D'*(cur) + '*'*((n-cur)//2)\n ans += '\\n'\nfor i in range(1 ,(n+1)//2):\n cur = n-i*2\n ans += '*'*i + 'D'*cur + '*'*i + '\\n'\nprint(ans)\n", "n=int(input())\r\nfor i in range(n-(n//2)):\r\n for j in range((n//2)-i,0,-1):\r\n print(\"*\",end=\"\")\r\n for k in range (1,(2*i)+2):\r\n print(\"D\",end=\"\")\r\n for l in range((n//2)-i,0,-1):\r\n print(\"*\",end=\"\")\r\n print(\"\")\r\nfor i in range(1,n-(n//2)):\r\n for j in range(1,i+1):\r\n print(\"*\",end=\"\")\r\n for k in range (n-(2*i)):\r\n print(\"D\",end=\"\")\r\n for l in range(1,i+1):\r\n print(\"*\",end=\"\")\r\n print(\"\")\r\n \r\n", "n = int(input())\r\nfor i in range(1,n+1):\r\n k = min(i, n-i+1)\r\n row = '*'*((n+1)//2 - k) + 'D'*(2*k-1) + '*'*((n+1)//2 - k)\r\n print(row)", "n = int(input())\r\nhalf = n // 2\r\nstar = half\r\nD = 1\r\nfor i in range(1, half + 1):\r\n print(\"*\" * star, \"D\" * D, \"*\" * star, sep=\"\")\r\n D += 2\r\n star -= 1\r\nfor i in range(half, -1, -1):\r\n print(\"*\" * star, \"D\" * D, \"*\" * star, sep=\"\")\r\n star += 1\r\n D -= 2\r\n", "n = int(input())\r\nfor i in range(1, n + 1):\r\n if i % 2 != 0:\r\n print('*' * ((n - i) // 2) + 'D' * i + '*' * ((n - i) // 2))\r\n\r\nfor j in range(n - 1, 0, -1):\r\n if j % 2 != 0:\r\n print('*' * ((n - j) // 2) + 'D' * j + '*' * ((n - j) // 2))\r\n", "from math import sqrt, ceil\r\n\r\nn = int(input())\r\nfirst = ceil(n / 2)\r\n\r\nsecond = n - first\r\n\r\nfor i in range(first):\r\n \r\n for j in range(first - i - 1):\r\n print(\"*\", end=\"\")\r\n \r\n for x in range(i + 1):\r\n print(\"D\", end=\"\")\r\n \r\n for z in range(i):\r\n print(\"D\", end=\"\")\r\n \r\n for y in range(first - i - 1):\r\n print(\"*\", end=\"\")\r\n \r\n\r\n print()\r\n \r\n \r\nfor i in range(second):\r\n \r\n for j in range(i + 1):\r\n print(\"*\", end=\"\")\r\n \r\n for x in range(second - i):\r\n print(\"D\", end=\"\")\r\n \r\n for z in range(second - i - 1):\r\n print(\"D\", end=\"\")\r\n \r\n for y in range(i + 1):\r\n print(\"*\", end=\"\")\r\n \r\n print()\r\n \r\n ", "#print('hhhh',end=\"\") to print in same line \r\nn=int(input())\r\nl=[]\r\nstr=''\r\nfor i in range ((n//2)+1):\r\n for j in range (1,(n//2+1)-i):\r\n print('*',end=\"\")\r\n str+='*'\r\n for k in range((2*(i+1))-1):\r\n print('D',end=\"\") \r\n str+='D'\r\n for j in range (1,(n//2+1)-i):\r\n print('*',end=\"\")\r\n str+='*'\r\n l.append(str)\r\n str=''\r\n print()\r\nl=l[::-1]\r\nfor i in range (1,n//2+1):\r\n print(l[i])\r\n\r\n \r\n ", "n = int(input())\r\nfor i in range(n):\r\n s = abs(n // 2 - i)\r\n print(\"*\" * s + \"D\" * ((n // 2 - s) * 2 + 1) + \"*\" * s)\r\n", "n=int(input())\r\nl1=[]\r\nl2=[]\r\nfor i in range(n//2):\r\n x=(2*i)+1 \r\n p=n-x \r\n s='*'*(p//2)+'D'*x+'*'*(p//2)\r\n l1.append(s)\r\n l2.append(s)\r\nz=l1+['D'*n]+l2[::-1]\r\nfor i in z:\r\n print(i)", "import os # importing to use os.path.exists method to check for input file availability\r\nimport sys # sys.stdin would be replaced for our runtime using this\r\n\r\n# if os.path.exists(\"in\"):\r\n# sys.stdin = open(\"in\", \"r\")\r\n\r\n# t=int(input())\r\n\r\n#for _ in range(t):\r\n\r\nn = int(input())\r\nm = n//2\r\nstart = 1\r\ntemp = m\r\nfor i in range(1,m+1):\t\r\n\td = \"D\"*start\r\n\tstar = \"*\"*temp\r\n\tprint(\"%s%s%s\" %(star,d,star))\r\n\tstart += 2\r\n\ttemp -= 1\r\n\r\nd = \"D\"*start\r\nprint(\"%s\" %(d))\r\ntemp = 1\r\nstart -= 2\r\nfor i in range(1,m+1):\t\r\n\td = \"D\"*start\r\n\tstar = \"*\"*temp\r\n\tprint(\"%s%s%s\" %(star,d,star))\r\n\tstart -= 2\r\n\ttemp += 1\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\nk = []\r\nj = 1\r\nfor i in range(n//2):\r\n k.append(j)\r\n ret = ('D'*(j)).center(n, '*')\r\n j += 2\r\n print(ret)\r\nprint('D'*n)\r\nfor i in range(n//2):\r\n ret = ('D'*(k[~i])).center(n, '*')\r\n print(ret)", "\"\"\"\r\nAccomplished using the EduTools plugin by JetBrains https://plugins.jetbrains.com/plugin/10081-edutools\r\n\r\nTo modify the template, go to Preferences -> Editor -> File and Code Templates -> Other\r\n\"\"\"\r\nfrom collections import deque\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n s = 'D' * n\r\n D = deque()\r\n D.append(s)\r\n while len(D) < n:\r\n s = s[1:-1]\r\n t = s\r\n x = (n - len(t)) // 2\r\n x = '*' * x\r\n t = x + t + x\r\n D.appendleft(t)\r\n D.append(t)\r\n for i in D:\r\n print(i)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n # Write your solution here\r\n main()\r\n", "n=int(input())\r\nfor i in range(n):\r\n s,c='*'*n,i\r\n if(c>int(n/2)): c=n-1-c\r\n c=int(2*c+1)\r\n for j in range(int((n-c)/2)+1,int((n-c)/2)+c+1,1):s=s[:j-1]+'D'+s[j:]\r\n print(s)\r\n", "n=int(input())\r\nfor i in range(1,n//2+1):\r\n\ta=n//2-i+1\r\n\tprint(\"*\"*a + \"D\"*(2*i-1) + \"*\"*a)\r\n\r\nprint(\"D\"*n,)\r\n\r\nfor i in range(n//2,0,-1):\r\n\ta=n//2-i+1\r\n\tprint(\"*\"*a + \"D\"*(2*i-1) + \"*\"*a)\r\n\r\n", "n=int(input())\r\nm=[]\r\nl=n*['*']\r\nl[n//2]='D'\r\np=''.join(map(str,l))\r\nprint(p)\r\nfor i in range(1,(n//2)+1):\r\n l[(n//2)-i]='D'\r\n l[(n//2)+i]='D'\r\n x=''.join(map(str,l))\r\n print(x)\r\n m.append(x)\r\nm=m[::-1]\r\nfor i in range(1,n//2):\r\n print(m[i])\r\nprint(p)", "n=int(input())\r\nfor i in range(n):\r\n a=abs(n//2-i)\r\n c='*'*a\r\n b='D'*(n-2*a)\r\n print(c+b+c)\r\n \r\n ", "n = int(input())\r\nb = n //2\r\n\r\nfor i in range(n):\r\n val = abs(i - b)\r\n print(('*' * val) + ('D' * (n-2*val)) + ('*' * val) )\r\n", "n = int(input())\r\n\r\nstar = n//2\r\nwhile star != 0:\r\n print('*' * star + 'D' * (n-2 * star) + '*' * star)\r\n star -= 1\r\n \r\nprint('D' * n)\r\nstar = 1\r\n\r\nwhile star != n//2 + 1:\r\n print('*' * star + 'D' * (n-2 * star) + '*' * star)\r\n star += 1\r\n", "n=int(input())\r\na=[f'{\"D\"*i:*^{n}}'for i in range(1,n,2)]\r\nprint(*a,'D'*n,*a[::-1],sep='\\n')", "import sys\r\n\r\ndef main():\r\n n = int(sys.stdin.read().strip())\r\n return [('D'*i).center(n, '*') for i in list(range(1, n+1, 2)) + list(range(n-2, 0, -2))]\r\n\r\nprint(*main(), sep='\\n')\r\n", "n=int(input())\r\nfor i in range(n):\r\n for j in range(n):\r\n if(abs(i - n//2) + abs(j - n//2) > n//2):\r\n print(\"*\", end=\"\")\r\n else:\r\n print(\"D\", end=\"\")\r\n print(\"\")", "'''\nAuthor : knight_byte\nFile : A_Little_Pony_and_Crystal_Mine.py\nCreated on : 2021-04-19 12:14:54\n'''\n\n\ndef main():\n n = int(input())\n ans = []\n for i in range(1, n, 2):\n s = (n-i)//2\n temp = \"*\"*s+\"D\"*i+\"*\"*s\n ans.append(temp)\n ans.append(\"D\"*n)\n for i in reversed(ans[:-1]):\n\n ans.append(i)\n for i in ans:\n print(i)\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\r\nfor i in range(n):\r\n print('*' * abs(i - n // 2), end='')\r\n print('D' * (n - 2 * abs(i - n // 2)), end='')\r\n print('*' * abs(i - n // 2), end='')\r\n print()", "n=int(input())\r\ns=n//2\r\nd=1\r\nfor i in range(0,n):\r\n #Star\r\n for k in range(0,s):\r\n print('*',end=\"\")\r\n #D\r\n for k in range(0,d):\r\n print('D',end=\"\")\r\n #Star\r\n for k in range(0,s):\r\n print('*',end=\"\")\r\n if i<n//2:\r\n d+=2\r\n s-=1\r\n elif i>=n//2:\r\n d-=2\r\n s+=1\r\n print()\r\n\r\n ", "import math\r\nn=int(input())\r\nj=1\r\nk=[]\r\nfor i in range(1,n//2+2):\r\n k.append((\"*\"*((n-j)//2))+(\"D\"*j)+(\"*\"*((n-j)//2)))\r\n print((\"*\"*((n-j)//2))+(\"D\"*j)+(\"*\"*((n-j)//2)))\r\n j+=2\r\nk=k[::-1]\r\nfor i in range(len(k)-1):\r\n print(k[i+1])\r\n \r\n\r\n\r\n \r\n \r\n \r\n", "n=int(input())\r\nmid=n//2+1\r\nkd=1\r\nfor i in range(1,n+1):\r\n kz=(n-kd)//2\r\n print('*'*kz+'D'*kd+'*'*kz)\r\n if i<mid:\r\n kd+=2\r\n else:\r\n kd-=2", "n=int(input());k=[\"*\"*((n//2)-i)+\"D\"*((2*(i+1))-1)+\"*\"*((n//2)-i) for i in range(0,(n//2)+1)];[print(i) for i in k[:len(k)]+k[:len(k)-1][::-1]]", "n = int(input())\r\n\r\na = n-1\r\nb = 1\r\n\r\nfor i in range(n//2):\r\n print(\"*\"*(a//2)+\"D\"*b+\"*\"*(a//2))\r\n a -= 2\r\n b += 2\r\nprint(\"D\"*n)\r\nfor i in range(n//2):\r\n a += 2\r\n b -= 2\r\n print(\"*\"*(a//2)+\"D\"*b+\"*\"*(a//2))\r\n\r\n\r\n\r\n\r\n", "import math\r\nn=int(input())\r\nfor i in range(1,math.ceil(n/2)+1):\r\n for j in range(abs(math.ceil(n/2)-i)):\r\n print(\"*\",end=\"\")\r\n for j in range(1,2*i):\r\n print(\"D\",end=\"\")\r\n for j in range(abs(math.ceil(n/2)-i)):\r\n print(\"*\",end=\"\")\r\n print()\r\nfor i in range(1,math.ceil(n/2)):\r\n for j in range(1,i+1):\r\n print(\"*\",end=\"\")\r\n for j in range(1,2*(math.ceil(n/2)-i)):\r\n print(\"D\",end=\"\")\r\n for j in range(1,i+1):\r\n print(\"*\",end=\"\")\r\n print()\r\n\r\n\r\n\r\n", "# import sys\n# sys.stdin=open('input.in','r')\n# sys.stdout=open('output.out','w')\nn=int(input())\nk=(n//2)+1\nfor x in range(1,(n//2)+1):\n\tprint('*'*(k-x),end='')\n\tprint('D'*(2*x-1),end='')\n\tprint('*'*(k-x))\nprint('D'*n)\nfor x in range((n//2),0,-1):\n\tprint('*'*(k-x),end='')\n\tprint('D'*(2*x-1),end='')\n\tprint('*'*(k-x))\n", "import sys\r\nimport math\r\n\r\n#to read string\r\nget_string = lambda: sys.stdin.readline().strip()\r\n#to read list of integers\r\nget_list = lambda: list( map(int,sys.stdin.readline().strip().split()) )\r\n#to read non spaced string and elements are integers to list of int\r\nget_intList_from_str = lambda: list(map(int,list(sys.stdin.readline().strip())))\r\n#to read non spaced string and elements are character to list of character\r\nget_strList_from_str = lambda: list(sys.stdin.readline().strip())\r\n#to read integers\r\nget_int = lambda: int(sys.stdin.readline().strip())\r\n#to print faster\r\npt = lambda x: sys.stdout.write(str(x))\r\n\r\n#--------------------------------WhiteHat010--------------------------------------#\r\nn = get_int()\r\n\r\nmatrix = []\r\nfor i in range(n//2):\r\n str = '*'*(n//2 - i) + 'D'*(2*i + 1) + '*'*(n//2 - i)\r\n matrix.append(str)\r\n\r\nmatrix.append('D'*(n)) \r\n\r\nfor j in range(n//2,-1,-1):\r\n str = '*'*(n//2 - j + 1) + 'D'*(2*j - 1) + '*'*(n//2 - j + 1)\r\n matrix.append(str)\r\n\r\nfor _ in range(n):\r\n print(matrix[_])", "n = int(input())\r\nm = n//2\r\nfor i in range(n):\r\n val = abs(i-m)\r\n print((\"*\"*val) + (\"D\"*(n-2*val)) + (\"*\"*val))\r\n", "num=int(input())\r\ncount=1\r\nfor i in range(1,(num//2)+1):\r\n print(('D'*count).center(num,'*'))\r\n count+=2\r\n\r\n\r\nfor i in range((num//2)+1,num+1):\r\n print(('D'*count).center(num,'*'))\r\n count-=2", "n=int(input())\r\nstars=n//2\r\nd=1\r\nfor i in range(n//2):\r\n print(stars*'*'+'D'*d+stars*'*')\r\n d+=2\r\n stars-=1\r\nprint('D'*n)\r\nstars=1\r\nd=n-2\r\nfor i in range(n//2):\r\n print(stars*'*'+'D'*d+stars*'*')\r\n d-=2\r\n stars+=1\r\n", "n=int(input())\r\ny=int((n-1)/2)\r\nfor z in range(1,y+1):\r\n d=(2*z)-1\r\n s1=int((n-d)/2)\r\n print(\"*\"*s1+\"D\"*d+\"*\"*s1)\r\nprint(\"D\"*n)\r\nfor x in range(1,y+1):\r\n z=(y+1)-x\r\n d=(2*z)-1\r\n s1=int((n-d)/2)\r\n print(\"*\"*s1+\"D\"*d+\"*\"*s1)", "#9\r\nn = int(input())\r\ncrystal = []\r\nfor i in range(n // 2):\r\n x = n // 2 - i\r\n y = i*2+1\r\n crystal.append('*'*x + 'D'*y + '*'*x)\r\n\r\ns = 'D'*n\r\ncrystal.append(s)\r\n\r\nfor i in reversed(range(n // 2)):\r\n x = n // 2 - i\r\n y = i*2+1\r\n crystal.append('*'*x + 'D'*y + '*'*x)\r\n\r\nfor i in crystal:\r\n print(i)\r\n", "# https://codeforces.com/contest/454/problem/A\r\n\r\nn = int(input())\r\n\r\nj = 1\r\ni = n // 2\r\nk = 0\r\nwhile k < n:\r\n if k < n //2:\r\n print(\"*\"*i+\"D\"*j+\"*\"*i)\r\n j += 2\r\n i -= 1\r\n if j > n:\r\n j -= 2\r\n i += 1\r\n else:\r\n print(\"*\" * i + \"D\" * j + \"*\" * i)\r\n j -= 2\r\n i += 1\r\n k += 1\r\n\r\n", "#-------------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 z=n//2-min(i,n-i-1)\r\n d=n//2-z\r\n k=\"*\"*z+\"D\"*d\r\n print(k+\"D\"+k[::-1])", "n = int(input())\r\ncnt = 1\r\nfor i in range(n):\r\n stars = (n-cnt)//2\r\n answ = '*' * stars + 'D' * cnt + '*' * stars\r\n print(answ)\r\n if i >= n // 2:\r\n cnt -= 2\r\n else:\r\n cnt += 2\r\n \r\n", "n = int(input())\r\nq = 1\r\na = [] \r\nfor i in range((n-1)//2+1):\r\n a.append((n-q)//2*'*' + q*'D' + (n-q)//2*'*')\r\n q += 2\r\n\r\nq -= 2\r\nfor i in range((n-1)//2):\r\n q -= 2\r\n a.append((n-q)//2*'*' + q*'D' + (n-q)//2*'*')\r\n\r\nfor i in a:\r\n print(i)", "n = int(input())\nfor i in range(n):\n stars = '*' * (n // 2 - min(i, n - 1 - i))\n ds = 'D' * min(1 + i + i, n + n - i - i - 1)\n print(stars + ds + stars)\n", "n=int(input())\r\npoint = '*'*(n//2)\r\nd = 'D'\r\ncristal = ('{0}{1}{0}'.format(point,d))\r\nprint(cristal)\r\n\r\ne=n\r\nfor i in range (0,e//2):\r\n d+='D'*2\r\n point=point.replace(\"*\",\"\",1)\r\n cristal = ('{0}{1}{0}'.format(point, d))\r\n print(cristal)\r\n\r\nfor z in range (e//2+1,n):\r\n d=d.replace('D','',2)\r\n point+='*'\r\n cristal = ('{0}{1}{0}'.format(point, d))\r\n print(cristal)\r\n\r\n\r\n", "n = int(input())\r\nout = [''] * n\r\n\r\nm = 0\r\n\r\nfor i in range(n // 2):\r\n for j in range(n):\r\n out[i] += '*' if (j < n // 2 - m or j > n // 2 + m) else 'D'\r\n \r\n out[n - i - 1] = out[i]\r\n m += 1\r\n\r\nout[n // 2] = 'D' * n\r\n\r\nfor i in range(n):\r\n print(out[i])", "n = int(input())\r\nstar,D = n-1,1\r\nanswer = []\r\nfor i in range(int(n/2)):\r\n s = \"*\"*(star//2) + \"D\"*D + \"*\"*(star//2)\r\n print(s)\r\n answer.append(s)\r\n star -= 2\r\n D += 2\r\nprint(\"D\"*n)\r\nanswer = answer[::-1]\r\nfor i in answer: print(i)", "#!/usr/bin/env python\r\n\r\nimport math\r\nimport sys\r\nimport itertools\r\nimport fractions\r\n\r\nif __name__ == '__main__':\r\n wtf = sys.stdin.read()\r\n wtf = wtf.strip().split('\\n')\r\n n = int(wtf[0])\r\n A = [x for x in range(2*n+1) if x%2 !=0 and x<=n]\r\n ans = []\r\n for i in range(n//2):\r\n ans.append('*'*((n-A[i])//2)+'D'*A[i]+'*'*((n-A[i])//2))\r\n ans.append('D'*n)\r\n ans.extend(ans[n//2-1::-1])\r\n print('\\n'.join(ans))\r\n", "n=int(input())\r\nt=n//2\r\nfor i in range (1,t+2):\r\n print((t)*\"*\",end=\"\")\r\n print(\"D\"*((i*2)-1),end=\"\")\r\n print((t)*\"*\",end=\"\\n\")\r\n t=t-1\r\nt=n//2\r\nfor i in range (1,t+1):\r\n print((i)*\"*\",end=\"\")\r\n print(\"D\"*(n-2),end=\"\")\r\n print((i)*\"*\",end=\"\\n\")\r\n n=n-2", "n = int(input())\r\nj = n\r\nb = False\r\nfor i in range(1,n+1,2):\r\n print(j//2*'*'+i*'D'+j//2*'*')\r\n j -= 2\r\nj = 2\r\nfor i in range(n-2,0,-2):\r\n print(j//2*'*'+i*'D'+j//2*'*')\r\n j += 2 \r\n", "n=int(input())\r\ns=[\"D\"*n]\r\nfor i in range(1,n//2+1):\r\n a=\"*\"*i+\"D\"*(n-i-i)+\"*\"*i\r\n s=[a]+s+[a]\r\nprint(\"\\n\".join(i for i in s))\r\n ", "n=int(input())\r\ni=1\r\nk=0\r\nt=(n+1)/2\r\nwhile i<=n:\r\n if i<=t:\r\n k=k+1\r\n else:\r\n k=k-1\r\n j=1\r\n while j<=n:\r\n if j>=t+1-k and j<=t-1+k:\r\n print(\"D\",end=\"\")\r\n else:\r\n print(\"*\",end=\"\")\r\n j=j+1\r\n \r\n print()\r\n i=i+1", "n = int(input())\r\nans = []\r\ni = 0\r\nx = (n - 1) // 2\r\ny = 1\r\nwhile i < n:\r\n ls = ['*' * x + 'D' * y + '*' * x]\r\n ans.append(ls)\r\n if i >= n // 2:\r\n y -= 2\r\n x += 1\r\n if i < n // 2:\r\n x -= 1\r\n y += 2\r\n i += 1\r\nfor i in ans:\r\n print(*i)\r\n", "import math\ndef solve(n):\n arr = []\n for i in range(0,n,2):\n p = '*'*((n-i-1)//2) +'D'*(i+1)+'*'*((n-i-1)//2)\n print(p)\n if i != n-1:\n arr.append(p)\n print(*reversed(arr),sep='\\n')\n \n \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 solve(n)\n\nmain()", "a = int(input())\r\n\r\nfor i in range(a//2+1):\r\n print('*'*(a//2-i)+'D'*(2*i+1)+'*'*(a//2-i))\r\nfor i in range(a//2):\r\n print('*'*(i+1)+'D'*(a-i*2-2)+'*'*(i+1))", "a = int(input())\r\nfor i in range(a // 2,0,-1):\r\n print(\"*\" * i + \"D\" * (a - 2 * i) + \"*\" * i)\r\nprint(\"D\" * a)\r\nfor i in range(1,a // 2 + 1):\r\n print(\"*\" * i + \"D\" * (a - 2 * i) + \"*\" * i)\r\n", "if __name__ == \"__main__\":\r\n n = int(input())\r\n for i in range(n//2):\r\n print((n//2-i)*'*'+(i*2+1)*'D'+(n//2-i)*'*')\r\n for i in range(n//2, -1 , -1):\r\n print((n//2-i)*'*'+(i*2+1)*'D'+(n//2-i)*'*')", "\r\nn = int(input())\r\n\r\nfor i in range(n):\r\n\tl = ['*'] * n\r\n\tfor j in range(abs(n//2 - i), (n-abs(n//2- i))):\r\n\t\tl[j] = 'D'\r\n\tprint(*l, sep = '')", "n = int(input())\r\nfor i in range(0, n):\r\n a = abs(n//2 - i)\r\n print(\"*\"*a + \"D\"*(n-2*a) + \"*\"*a)", "n=int(input())\r\nfor i in range(n):\r\n s=abs((n-1)//2-i)\r\n d=n-2*s\r\n print('*'*s+'D'*d+'*'*s)\r\n", "row = ['*'] * int(input())\nfor i in range(len(row)):\n row[(len(row) // 2) - min(i, len(row) - i)], row[(len(row) // 2) + min(i, len(row) - i)] = 'D*'[i // ((len(row) + 1) // 2)], 'D*'[i // ((len(row) + 1) // 2)]\n print(''.join(row))\n\n", "n = int(input())\nchk = n // 2\nfor i in range(1, chk + 2):\n for j in range(chk + 1 - i): print('*', end = '')\n for j in range(2 * i - 1): print('D', end = '')\n for j in range(chk + 1 - i): print('*', end = '')\n print()\nfor i in range(chk, 0, -1):\n for j in range(chk + 1 - i): print('*', end = '')\n for j in range(2 * i - 1): print('D', end = '')\n for j in range(chk + 1 - i): print('*', end = '')\n print()\n \t \t \t \t \t \t \t\t\t\t \t", "x=int(input())\r\nd=1\r\ns=x//2\r\nfor i in range(1,x+1,2):\r\n print(s * \"*\" + d * \"D\" + s * \"*\")\r\n d += 2\r\n s -= 1\r\nf=1\r\nl=x-2\r\nfor i in range(1,x//2+1):\r\n print(f*\"*\"+l*\"D\"+f*\"*\")\r\n f+=1\r\n l-=2", "number=int(input(\"\"))\r\nn=(number//2)+1\r\nx = 1\r\nfor i in range(1,number+1):\r\n if i<=n:\r\n for col in range(1,number+1):\r\n start=(n-i)+1\r\n end=(n-1)+i\r\n if col<start or col>end:\r\n print(\"*\",end=\"\")\r\n else:\r\n print(\"D\",end=\"\")\r\n print()\r\n else:\r\n\r\n for col in range(1,number+1):\r\n start=(i-n)+1\r\n end=number-x\r\n if col<start or col>end:\r\n print(\"*\",end=\"\")\r\n else:\r\n print(\"D\",end=\"\")\r\n x+=1\r\n print()\r\n", "n=int(input())\r\nfor i in range(0,int(n/2)+1):\r\n print('*'*(int(n/2)-i),'D'*(2*i+1),'*'*(int(n/2)-i),sep=\"\")\r\nfor i in range(1,int(n/2)+1):\r\n print('*'*i,'D'*(n-2*i),'*'*i,sep=\"\")", "n=int(input())\r\nx=n//2\r\nfor i in range(x):\r\n\tprint((\"D\"*i).rjust(x,'*')+'D'+(\"D\"*i).ljust(x,'*'))\r\nprint(\"D\"*n)\r\nfor i in range(x):\r\n\tprint((\"D\"*(x-1-i)).rjust(x,'*')+'D'+(\"D\"*(x-1-i)).ljust(x,'*'))", "n = int(input())\r\na = ['*'] * n\r\nfor i in range(n // 2 + 1):\r\n a[n // 2 - i] = 'D'\r\n a[n // 2 + i] = 'D'\r\n print(*a, sep='')\r\nfor i in range(n // 2, 0, -1):\r\n a[n // 2 - i] = '*'\r\n a[n // 2 + i] = '*'\r\n print(*a, sep='')", "n = int(input())\r\ni = 1\r\nl = []\r\nfor _ in range(n//2):\r\n print((\"*\" * ((n-i)//2))+(\"D\"*i) + (\"*\" * ((n-i)//2)))\r\n l.append((\"*\" * ((n-i)//2))+(\"D\"*i) + (\"*\" * ((n-i)//2)))\r\n i+=2\r\nprint(\"D\"*n)\r\nfor e in l[::-1]:\r\n print(e)", "n = int(input())\r\nfor i in range(n):\r\n if i > n/2:\r\n k = (n-i-1)*2 + 1\r\n else:\r\n k = i*2 + 1\r\n m = int((n-k)/2)\r\n s = \"*\"*m + \"D\"*k + \"*\"*m\r\n print(s)", "n=int(input())\r\nt=n//2\r\nf=n//2+1\r\ns=[]\r\nfor i in range(1,f+1):\r\n s.append('*'*t+(2*i-1)*'D'+'*'*t)\r\n t-=1\r\nu=s[::-1]\r\ns+=u[1::]\r\nfor w in s:\r\n print(w)\r\n \r\n", "n = int(input())\r\n\r\ns = \"D\"\r\nj = 1\r\nfor i in range(1,(n//2)+1):\r\n print((s * j).center(n,\"*\"))\r\n j+=2\r\nprint(s*j)\r\nj-=2\r\nfor u in range((n//2)+2,n+1):\r\n print((s * j).center(n,\"*\"))\r\n j-=2 ", "n = int(input())\r\n\r\nfor i in range(n):\r\n spaces = abs(n // 2 - i)\r\n diamonds = n - 2 * spaces\r\n line = \"*\" * spaces + \"D\" * diamonds + \"*\" * spaces\r\n print(line)", "N = int(input())\r\nd = \"D\"\r\ns = \"*\"\r\nmatrix = []\r\nj = N//2\r\nk = 1\r\nfor i in range(N//2+1):\r\n matrix.append([f\"{s*j}{d*k}{s*j}\"])\r\n j-=1\r\n k+=2\r\ns = N//2-1\r\nfor j in range(N):\r\n if j >N//2:\r\n print(*matrix[s])\r\n s-=1\r\n else:\r\n print(*matrix[j])\r\n", "n = int(input())\r\nfor i in range(1,(n+1)//2):\r\n print(((n - (i * 2) + 1) // 2) * \"*\" + ((i * 2) - 1) * \"D\" + ((n - (i * 2) + 1) // 2) * \"*\")\r\nprint(n * \"D\")\r\nfor i in range((n-1)//2,0,-1):\r\n print(((n - (i * 2) + 1) // 2) * \"*\" + ((i * 2) - 1) * \"D\" + ((n - (i * 2) + 1) // 2) * \"*\")", "n=int(input())\r\nfor i in range(1,n+1):\r\n\tfor j in range(1,n+1):\r\n\t\tif (i+j)>=(n+3)//2 and (i+j)<=(n+1+(n//2)) and (j-i)<=(n-1)//2 and (i-j)<=(n-1)//2:\r\n\t\t\tprint('D',end=\"\")\r\n\t\telse:\r\n\t\t\tprint('*',end=\"\")\r\n\tprint()", "n = int(input())\r\nfor i in range(1,n + 2,2):\r\n print(('D'* i).center(n,'*'))\r\nfor i in range(n - 2,0,-2):\r\n print(('D'* i).center(n,'*'))", "n=int(input())\r\nfor i in range(1,n+1,2):\r\n k=(n-i)//2\r\n print(\"*\"*k,end=\"\")\r\n print(\"D\"*i,end=\"\")\r\n print(\"*\"*k)\r\nfor i in range(n-2,0,-2):\r\n k=(n-i)//2\r\n print(\"*\"*k,end=\"\")\r\n print(\"D\"*i,end=\"\")\r\n print(\"*\"*k)\r\n ", "l=[]\r\nn=int(input())\r\nfor i in range(0,(n>>1)+1):\r\n l.append('*'*((n>>1)-i)+'D'*(n-(((n>>1)-i)<<1))+'*'*((n>>1)-i))\r\nfor i in l:\r\n print(i)\r\nl=l[::-1]\r\nfor i in range(1,len(l)):\r\n print(l[i])\r\n", "n=int(input())\r\nc,g=1,True\r\nfor i in range(n):\r\n if (n-c)//2 > 0 and g:\r\n print(\"*\"*((n-c)//2)+\"D\"*c+\"*\"*((n-c)//2))\r\n c+=2\r\n else:\r\n g=False\r\n if not g:\r\n print(\"*\"*((n-c)//2)+\"D\"*c+\"*\"*((n-c)//2))\r\n c-=2", "from sys import stdin\r\ndef ip(): return [int(i) for i in stdin.readline().split()]\r\ndef sp(): return [str(i) for i in stdin.readline().split()]\r\ndef pp(A): \r\n for i in A: print(i)\r\n\r\n\r\ndef pl(A):\r\n for i in A:\r\n print(i, end=\"\")\r\n print()\r\n\r\ndef solve():\r\n n = int(input())\r\n m = int(n//2)\r\n A = ['*'] * n\r\n A[m] = \"D\"\r\n l,r = m,m\r\n pl(A)\r\n for _ in range(m):\r\n l -= 1\r\n r += 1\r\n A[l] = \"D\"\r\n A[r] = \"D\"\r\n pl(A)\r\n for _ in range(m):\r\n A[l] = \"*\"\r\n A[r] = \"*\"\r\n l += 1\r\n r -= 1\r\n pl(A)\r\n return 0\r\n\r\nsolve()", "n=int(input())\r\ns=''\r\na=''\r\nb=[]\r\nfor i in range(1,n+1):\r\n a+='D'\r\n if i==n//2+1:\r\n s+='D'\r\n else:\r\n s+='*'\r\nprint(s)\r\nb.append(s)\r\nfor k in range(1,n//2):\r\n s=(s[:n//2-k]+((k*2+1)*'D')+s[n//2+1+k:])\r\n b.append(s)\r\n print(s)\r\nprint(a)\r\nb=b[::-1]\r\nfor t in b:\r\n print(t)\r\n", "n=int(input())\r\nfor i in range(1,n+1,2):\r\n print('*'*((n-i)//2),end=\"\")\r\n print('D'*i,end=\"\")\r\n print('*'*((n-i)//2))\r\nfor i in range(n-2,0,-2):\r\n print('*'*((n-i)//2),end=\"\")\r\n print('D'*i,end=\"\")\r\n print('*'*((n-i)//2))", "n=int(input())\nl=[]\nc=1\nfor i in range(1,n//2+1):\n s=\"\"\n for j in range((n-c)//2):\n s+='*'\n for j in range(c):\n s+='D'\n for j in range((n-c)//2):\n s+='*'\n c+=2\n l.append(s)\nfor i in l:\n print(i)\nfor i in range(n):\n print('D',end=\"\")\nprint()\nl=l[::-1]\nfor i in l:\n print(i)", "'''\r\n# Submitted By M7moud Ala3rj\r\nDon't Copy This Code, CopyRight . [email protected] © 2022-2023 :)\r\n'''\r\n# Problem Name = \"Little Pony and Crystal Mine\"\r\n# Class: A\r\n\r\nimport sys\r\n#sys.setrecursionlimit(2147483647)\r\ninput = sys.stdin.readline\r\ndef print(*args, end='\\n', sep=' ') -> None:\r\n sys.stdout.write(sep.join(map(str, args)) + end)\r\n\r\ndef Solve():\r\n n = int(input())\r\n list_ = []\r\n x=1\r\n for i in range(1, n//2+1):\r\n list_.append(\"*\"*((n-x)//2)+\"D\"*x+\"*\"*((n-x)//2))\r\n x+=2\r\n list_.append(\"D\"*n)\r\n list_+=list_[:-1][::-1]\r\n print(*list_, sep=\"\\n\")\r\n \r\n \r\n \r\n\r\n\r\nif __name__ == \"__main__\":\r\n Solve()", "n=int(input())\r\nm=1\r\nk=n//2\r\nj=0\r\nl=[]\r\nwhile m<n:\r\n print(\"*\"*(k)+\"D\"*m+\"*\"*(k))\r\n l.append(\"*\"*(k)+\"D\"*m+\"*\"*(k))\r\n m+=2\r\n k-=1\r\n j+=1\r\nif m==n:\r\n print(\"D\"*m)\r\n m+=1\r\n j+=1\r\nwhile m>n and j<=n and l!=[]:\r\n print(l[-1])\r\n del l[-1]\r\n j+=1", "n = int(input())\r\n\r\nstars = n // 2 \r\nd = 1\r\nk = 1\r\n\r\nfor i in range(n):\r\n print('*' * stars + 'D' * d + '*' * stars)\r\n if i == n // 2:\r\n k = -1\r\n stars -= 1 * k\r\n d += 2 * k\r\n", "n=int(input())\r\nn2 = n//2\r\ns = ''\r\nfor i in range(n):\r\n for j in range(n):\r\n if abs(n2-i)<= j <= (n-1-abs(n2-i)):\r\n s += 'D'\r\n else:\r\n s += '*'\r\n s += '\\n'\r\nprint(s)\r\n", "n = int(input())\r\nGran = n//2\r\nd=1\r\nfor i in range(n):\r\n if d==n:\r\n s1=d*('D')\r\n d=d-2\r\n elif i<(n//2):\r\n kZv=(n-d)//2\r\n s1 = kZv*('*')+d*('D')+kZv*('*')\r\n d=d+2\r\n elif i>(n//2):\r\n kZv=(n-d)//2\r\n s1 = kZv*('*')+d*('D')+kZv*('*')\r\n d=d-2\r\n print(s1)\r\n \r\n\r\n\r\n", "x=int(input())\r\nm=[\"*\"]*x\r\nz=0\r\nwhile(z<=int(x/2)):\r\n mi=int(x/2)-z\r\n n=0\r\n while(n<(z*2)+1):\r\n m[mi]=\"D\"\r\n mi+=1\r\n n+=1\r\n f=0\r\n while(f<len(m)):\r\n print(m[f],end='')\r\n f+=1 \r\n print(\"\") \r\n z+=1 \r\nh=z\r\nz=x-2\r\nmi=1\r\nwhile(h<x):\r\n m=[\"*\"]*x \r\n n=mi\r\n q=0\r\n while(q<z):\r\n m[n]=\"D\"\r\n q+=1\r\n n+=1\r\n f=0\r\n while(f<x):\r\n print(m[f],end='')\r\n f+=1\r\n print(\"\")\r\n mi+=1\r\n z-=2\r\n h+=1 \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=[\"D\"*n]\r\nfor i in range(1,1+n//2):\r\n\tx=\"*\"*i+\"D\"*(n-i-i)+\"*\"*i\r\n\ts=[x]+s+[x]\r\nprint(\"\\n\".join(s))", "n = int(input())\r\ns_count, d_count = n//2, 1\r\nfor i in range(1, n//2+1):\r\n print((s_count * '*') + (d_count * 'D') + (s_count * '*'))\r\n s_count -= 1\r\n d_count += 2\r\nfor i in range(1, n//2+2):\r\n print((s_count * '*') + (d_count * 'D') + (s_count * '*'))\r\n s_count += 1\r\n d_count -= 2", "n=int(input());\r\nx=1;\r\nw=-1;\r\nwhile x<=n:\r\n q=int((n+1)/2);\r\n if(x<=q):\r\n w=w+2;\r\n print(\"*\"*(q-x),\"D\"*w,\"*\"*(q-x),sep='');\r\n else:\r\n w=w-2;\r\n print(\"*\"*(x-q),\"D\"*w,\"*\"*(x-q),sep='')\r\n x=x+1;\r\n \r\n", "n = int(input())\r\n\r\nfor i in range(n//2):\r\n a = (2*i) + 1\r\n out = \"*\"*((n-a)//2) + \"D\" * a + \"*\"*((n-a)//2)\r\n print(out)\r\n\r\nprint(\"D\"*n)\r\n\r\nfor i in range(n//2-1,-1,-1):\r\n a = (2*i) + 1\r\n out = \"*\"*((n-a)//2) + \"D\" * a + \"*\"*((n-a)//2)\r\n print(out)", "n = int(input())\r\nnumD = 1\r\nfor i in range(n):\r\n\tprint((n-numD)//2*'*'+numD*'D'+(n-numD)//2*'*')\r\n\tif i<n//2:\r\n\t\tnumD+=2\r\n\telse:\r\n\t\tnumD-=2", "#### it's just a o(n) \r\n\r\nn = int(input())\r\nfor i in range(1 , n+1 , 2):\r\n j = (n-i)//2\r\n print('*' *j , end='')\r\n print('D'*i , end='')\r\n print('*' *j)\r\nfor i in range(n-2 , 0 , -2):\r\n j = (n-i)//2\r\n print('*'*j,end='')\r\n print('D'*i,end='')\r\n print('*'*j)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nj = 1\r\nfor i in range(n // 2 + 1):\r\n\tprint((n - j) // 2 * '*' + j * 'D' + (n - j) // 2 * '*')\r\n\tj += 2\r\nj -= 2\r\nfor i in range(n // 2):\r\n\tj -= 2\r\n\tprint((n - j) // 2 * '*' + j * 'D' + (n - j) // 2 * '*')", "n = int(input())\r\n \r\nfor i in range(1, n+1, 2):\r\n print('*'*((n-i)//2), end = '')\r\n print('D'*i, end = '')\r\n print('*'*((n-i)//2))\r\n\r\nfor i in range(n-2, 0, -2):\r\n print('*'*((n-i)//2), end = '')\r\n print('D'*i, end = '')\r\n print('*'*((n-i)//2))", "crystalsize = int(input())\r\ncrystal = []\r\n\r\nfor i in range(crystalsize // 2):\r\n crystal.append('*' * ((crystalsize // 2 ) - i) + 'D' * ((i + 1) * 2 - 1) + '*' * ((crystalsize // 2 ) - i))\r\ncrystal += ['D' * crystalsize]\r\ncrystal += crystal[:-1][::-1]\r\n\r\nfor i in crystal:\r\n print(''.join(i))", "n = int(input())\r\nx = 1\r\nfor i in range(1, n+1):\r\n print((\"D\"*x).center(n, \"*\"))\r\n if i >= n // 2 + 1:\r\n x -= 2\r\n else:\r\n x += 2\r\n\r\n ", "x=int(input())\r\nn=x-1\r\nl=[]\r\ns=''\r\nfor i in range(x):\r\n s=''\r\n for j in range(int(n/2)):\r\n s+='*'\r\n for j in range(int(x-n)):\r\n s+='D'\r\n for j in range(int(n/2)):\r\n s+='*'\r\n n-=2\r\n l.append(s)\r\n if n<0:\r\n break\r\nfor i in range(len(l)):\r\n print(l[i])\r\nl.pop(len(l)-1)\r\nl.reverse()\r\nfor i in l:\r\n print(i)", "n=int(input())\r\nfor i in range((n//2),0,-1):\r\n print(\"*\"*i+\"D\"*(n-2*i)+\"*\"*i)\r\nfor i in range(1):\r\n print(\"D\"*n)\r\nfor i in range(1,(n//2)+1):\r\n print(\"*\"*i+\"D\"*(n-2*i)+\"*\"*i)\r\n \r\n", "n=int(input())\r\nfor i in range (n):\r\n if(i<int((n-1)/2)):\r\n print(\"*\"*(int((n-1)/2)-i)+\"D\"*(2*i+1)+\"*\"*(int((n-1)/2)-i))\r\n elif(i>int((n-1)/2)):\r\n print(\"*\"*(int((n-1)/2)-n+i+1)+\"D\"*(2*(n-i-1)+1)+\"*\"*(int((n-1)/2)-n+i+1))\r\n else:\r\n print(\"D\"*n)", "n = int(input())\r\n\r\nfor i in range(n//2 + 1):\r\n print(\"*\"*(n//2 - i) + \"D\"*(n - (n-i) + (i+1)) + \"*\"*(n//2 - i))\r\n\r\nfor i in range(n//2):\r\n print(\"*\"*(i + 1) + \"D\"*(n - 2*i - 2) + \"*\"*(i + 1))\r\n", "n = int(input())\r\nm = n//2 + 1\r\nk = 0\r\nfor i in range(1,n+1):\r\n if i<=m: #m = 3\r\n k+=1\r\n else:\r\n k-=1\r\n for j in range(1,n+1):\r\n if j>m-k and j<m+k:\r\n print('D',end='')\r\n else:\r\n print('*',end = '')\r\n print()\r\n", "n=int(input())\r\nfor i in range(1,n+1,2):\r\n\tprint(str(\"D\"*i).center(n,\"*\"))\r\nfor i in range(n-2,0,-2):\r\n\tprint(str(\"D\"*i).center(n,\"*\"))", "n=int(input())\r\nfor i in range(n):\r\n a=abs(n//2-i)\r\n print(a*(\"*\")+\"D\"*((n//2-a)*2+1)+a*\"*\")", "n = int(input())\r\nx = (n-1)//2\r\nfor i in range(x):\r\n print('*'*((n-1)//2-i) + 'D'*(i*2+1) + '*'*((n-1)//2-i))\r\nprint('D'*n)\r\nfor i in range(x-1, -1, -1):\r\n print('*'*((n-1)//2-i) + 'D'*(i*2+1) + '*'*((n-1)//2-i))\r\n\r\n\r\n\r\n", "n = int(input())\r\nx = n//2\r\ndef pr(x):\r\n if(x==0) :\r\n print(\"D\"*n)\r\n return \r\n print(\"*\"*x , end = \"\")\r\n print(\"D\"*(n-2*x),end = \"\")\r\n print(\"*\"*x )\r\n pr(x-1)\r\n print(\"*\"*x , end = \"\")\r\n print(\"D\"*(n-2*x),end = \"\")\r\n print(\"*\"*x )\r\npr(x)", "# LUOGU_RID: 101570010\nn = int(input())\r\nfor i in range(n):\r\n i = min(i, n - i - 1)\r\n print('*' * ((n - (i * 2 + 1)) // 2) + 'D' * (i * 2 + 1) + '*' * ((n - (i * 2 + 1)) // 2))", "n = int(input())\nfor i in range(n):\n buf = abs((n-1)//2-i)\n other = n-2*buf\n print('*'*buf+'D'*other+'*'*buf)\n", "n = int(input().strip())\r\nfor i in range (n):\r\n y = int(n/2)\r\n x = '*'* (abs(y-i)) + 'D'* ((n-2* (abs(y-i)))) + '*'* abs(y-i)\r\n print (x)", "def answer():\r\n # * * D * *\r\n # * D D D *\r\n # D D D D D \r\n # * D D D *\r\n # * * D * *\r\n\r\n n = int(input())\r\n stars=int(n/2)\r\n sp = 1\r\n i=0\r\n while stars>0:\r\n print(stars*\"*\"+sp*\"D\"+stars*\"*\")\r\n stars-=1\r\n sp+=2\r\n sp = n\r\n while stars<int(n/2)+1:\r\n print(stars*\"*\"+sp*\"D\"+stars*\"*\")\r\n stars+=1\r\n sp-=2\r\nanswer()\r\n \r\n", "num = int(input())\r\ns=(num//2)\r\n\r\nfor i in range(num):\r\n\tif i>(num//2):\r\n\t\tif s<0:\r\n\t\t\ts=0\r\n\t\ts+=1\r\n\t\tprint('*'*s+'D'*(num-(2*s))+'*'*s)\r\n\telse:\r\n\t\tprint('*'*s+'D'*(num-(2*s))+'*'*s)\r\n\t\ts-=1", "n = int(input())\r\nfor i in range(n):\r\n for j in range(n):\r\n if(i > n / 2):\r\n if(j >= i - n / 2 and n - 1 - j >= i - n / 2):\r\n print('D', end = '')\r\n else:\r\n print('*', end = '')\r\n else:\r\n if(j >= n / 2 - i - 1 and n - 1 - j >= n / 2 - i - 1):\r\n print('D', end = '')\r\n else:\r\n print('*', end = '')\r\n print()", "n =int(input())\nD = n//2\nB = 0\n\nfor i in range(n):\n for j in range(n):\n if j >= D - B and j <= D + B:\n print(\"D\", end=\"\")\n else:\n print(\"*\", end=\"\")\n\n if i >= D:\n B -= 1\n else:\n B += 1\n print()\n \t\t \t \t\t \t\t\t\t\t \t \t\t \t \t", "x = int(input())\r\n\r\ntext = \"D\"\r\ntimes = 1\r\nfor i in range(x):\r\n print((text*times).center(x,\"*\"))\r\n times+=2\r\n if i == int(x/2)-1 :\r\n print(\"D\"*x)\r\n break\r\nwhile times>1:\r\n times-=2\r\n print((text*times).center(x,\"*\"))", "if __name__ == '__main__':\r\n n = int(input())\r\n for i in range(n//2+1):\r\n print(\"*\" * (n//2 - i),end = \"\")\r\n print(\"D\" * (2*i + 1),end = \"\")\r\n print(\"*\" * (n//2 - i),end = \"\")\r\n print()\r\n for i in range(n//2-1,-1,-1):\r\n print(\"*\" * (n//2 - i),end = \"\")\r\n print(\"D\" * (2*i + 1),end = \"\")\r\n print(\"*\" * (n//2 - i),end = \"\")\r\n print()\r\n", "n=int(input())\r\n\r\nfor i in range(int(n/2) , -1 , -1):\r\n print(i*'*' , end=\"\")\r\n print((int(n)-i*2)*'D' , end=\"\")\r\n print(i*'*' , end=\"\")\r\n\r\n print(\"\")\r\n\r\nfor i in range(1, int(n/2)+1):\r\n print(i*'*' , end=\"\")\r\n print((int(n)-i*2)*'D' , end=\"\")\r\n print(i*'*' , end=\"\")\r\n\r\n print(\"\")", "#!/usr/bin/env/python\r\n# -*- coding: utf-8 -*-\r\nn = int(input())\r\nfor i in range(n):\r\n Ds = (min(i, n - i - 1)) * 2 + 1\r\n Ss = (n - Ds) // 2\r\n print('*' * Ss + 'D' * Ds + '*' * Ss)\r\n", "a=int(input())\r\nl=1\r\nd=a//2\r\np=0\r\nk=d\r\nwhile p!=k:\r\n d=a//2-(l//2)\r\n if l>0:\r\n print('*'*d + 'D'*l + '*'*d)\r\n else:\r\n print('*'*d + 'D' + '*'*d)\r\n l+=2\r\n p+=1\r\nprint('D'*a)\r\np+=1\r\nd=a//2\r\nl=a-2\r\nwhile p!=a:\r\n \r\n d=a//2-(l//2)\r\n if l>0:\r\n print('*'*d + 'D'*l + '*'*d)\r\n else:\r\n print('*'*d + 'D' + '*'*d)\r\n l-=2\r\n p+=1", "n=int(input())\r\ns=n//2\r\nb=0\r\nlst=[]\r\nfor i in range(1,n+1):\r\n if(i%2!=0):\r\n v='*'*(s-b)+'D'*i+'*'*(s-b)\r\n b=b+1\r\n lst.append(v)\r\nfor j in lst:\r\n print(j)\r\nlst.reverse()\r\nfor k in range(1,len(lst)):\r\n print(lst[k])\r\n", "#...START BY DOING WHAT IS NECESSARY, THEN WHAT IS POSSIBLE AND SUDDENLY YOU ARE DOING THE IMPOSSIBLE... \r\nimport math\r\n \r\nt = 1\r\n# t = int(input())\r\nfor _ in range(t):\r\n #arr = list(map(int,input().split()))\r\n n = int(input())\r\n l = []\r\n for i in range(n//2):\r\n s = '*'*(n//2-i) + 'D'*(2*i+1) + '*'*(n//2-i)\r\n l.append(s)\r\n print(s)\r\n print('D'*n)\r\n for i in range(len(l)-1,-1,-1):\r\n print(l[i])\r\n \r\n \r\n \r\n# Author : shivamSha_123\r\n ", "n = int(input())\narr = []\nfor i in range(n // 2):\n p = 2 * i + 1\n r = (n - p) // 2\n result = \"*\" * r + \"D\" * p + \"*\" * r\n arr.append(result)\n print(result)\nprint(\"D\" * n)\narr = arr[::-1]\nfor item in arr:\n print(item)\n", "n=int(input())\r\ns=(n-1)//2\r\nc=1\r\nfor i in range(n//2+1):\r\n for j in range(s):\r\n print('*',end='')\r\n for j in range(c):\r\n print('D',end='')\r\n for j in range(s):\r\n print('*',end='')\r\n s-=1\r\n c+=2\r\n print()\r\ns+=2\r\nc-=4\r\nfor i in range(n//2):\r\n for j in range(s):\r\n print('*',end='')\r\n for j in range(c):\r\n print('D',end='')\r\n for j in range(s):\r\n print('*',end='')\r\n s+=1\r\n c-=2\r\n print()\r\n \r\n", "n=int(input())\r\n\r\ni=1 \r\n\r\nwhile i<= n:\r\n\r\n if i <n/2:\r\n print(\"*\"*(n//2 + 1 -i),end=\"\")\r\n print(\"D\"*(2*i - 1),end=\"\")\r\n print(\"*\"*(n//2 + 1 -i))\r\n\r\n elif i==n//2 + 1:\r\n print(\"D\"*n)\r\n \r\n else:\r\n print(\"*\"*(i- n//2 -1), end=\"\")\r\n print(\"D\"*(n-2*(i-n//2-1)),end=\"\")\r\n print(\"*\"*(i-n//2-1))\r\n\r\n i+=1\r\n\r\n\r\n ", "# author: violist\n# created: 19.04.2021 07:52:27\n\nimport sys\ninput = sys.stdin.readline\n\nn = int(input())\nfor i in range(n):\n for j in range(n):\n if min(i, n - 1 - i) + min(j, n - 1 - j) < n // 2:\n print(\"*\", end = \"\")\n else:\n print(\"D\", end = \"\")\n print()\n", "n=int(input())\nif (n==1):\n print(\"D\")\nelse:\n a=n//2\n b=\"*\"\n c=\"D\"\n for j in range(0,a):\n print((a-j)*b,end=\"\")\n print((2*j+1)*c,end=\"\")\n print((a-j)*b)\n print(n*c)\n for j in range(0,a):\n print((j+1)*b,end=\"\")\n print((2*(a-j-1)+1)*c,end=\"\")\n print((j+1)*b)\n", "n = int(input())\r\nst,D = n-1,1\r\nans = []\r\nfor i in range(int(n/2)):\r\n s = \"*\"*(st//2) + \"D\"*D + \"*\"*(st//2)\r\n print(s)\r\n ans.append(s)\r\n st -= 2\r\n D += 2\r\n\r\nprint(\"D\"*n)\r\n\r\nans = ans[::-1]\r\nfor i in ans:\r\n print(i)", "n = int(input())\r\nlines = [None] * (n // 2)\r\nfor i, line in enumerate(lines):\r\n stars = '*' * (n // 2 - i)\r\n lines[i] = stars + 'D' * (2 * i + 1) + stars\r\n\r\nsh= '\\n'.join(lines) + '\\n'\r\nprint(sh + ('D' * n) + sh[::-1])\r\n", "def draw_crystal(n):\r\n for i in range(n):\r\n stars = abs(n // 2 - i)\r\n diamonds = n - 2 * stars\r\n \r\n print('*' * stars + 'D' * diamonds + '*' * stars)\r\n\r\nn = int(input().strip())\r\n\r\ndraw_crystal(n)", "def solve(n):\n for i in range(1, n+1, 2):\n print(\"*\"*((n - i)//2) + 'D'*i + \"*\"*((n - i)//2))\n\n for i in range(n-2, 0, -2):\n print(\"*\"*((n - i)//2) + 'D'*i + \"*\"*((n - i)//2))\n\n\ndef main():\n n = int(input())\n solve(n)\n\n\nmain()\n", "# Wadea #\r\n\r\n\r\nn1 = n2 = n3 = int(input())\r\nr = n1 - 1\r\nfor i in range(1,n2+1):\r\n if i < n1//2+1:\r\n print(\"*\"*(r//2)+\"D\"*(n1-r)+\"*\"*(r//2))\r\n r -= 2\r\n elif i == n1 // 2+1:\r\n print(\"D\"*n1)\r\n else:\r\n r += 2\r\n print(\"*\"*(r//2)+\"D\"*(n1-r)+\"*\"*(r//2))\r\n", "n=int(input())\r\nmi=n//2\r\nfor i in range(n):\r\n for j in range(n):\r\n if(i<mi+1):\r\n ii=i\r\n else:\r\n ii=(n-i-1)%(mi+1)\r\n if(mi-ii<=j and mi+ii>=j):\r\n print('D',end=\"\")\r\n else:\r\n print('*',end=\"\")\r\n print()\r\n", "# cf 454 A 800\nn = int(input())\n\na = n // 2\nb = 1\nac, bc = -1, 2\nfor i in range(n):\n r = \"*\" * a + \"D\" * b + \"*\" * a\n print(r)\n a += ac\n b += bc\n if a == 0:\n ac *= -1\n bc *= -1\n", "#!/bin/python3\r\nn = int(input())\r\nfor row in range(n):\r\n\tsym = 0\r\n\tif row < n - 1 - row:\r\n\t\tsym = row\r\n\telse:\r\n\t\tsym = (n - 1 - row)\r\n\tfor k in range(int((n - 1) / 2 - sym)):\r\n\t\tprint(\"*\", end=\"\")\r\n\tfor k in range(2 * sym + 1):\r\n\t\tprint(\"D\", end=\"\")\r\n\tfor k in range(int((n - 1) / 2 - sym)):\r\n\t\tprint(\"*\", end=\"\")\r\n\tprint()", "n = int(input())\r\na = (n - 1) // 2\r\nd = 1\r\nk = 1\r\nfor i in range(n):\r\n print('*' * a + 'D' * d + '*' * a)\r\n if d == n:\r\n k *= -1\r\n a = a - k\r\n d = d + 2 * k", "n = int(input())\r\nfor i in range(n//2 + 1):\r\n stars = '*' * (n//2 - i)\r\n diamonds = 'D' * (2*i + 1)\r\n print(stars + diamonds + stars)\r\nfor i in range(n//2):\r\n stars = '*' * (i+1)\r\n diamonds = 'D' * (n - 2*(i+1))\r\n print(stars + diamonds + stars)\r\n", "n=int(input())\r\na=int(n/2)\r\nb=1\r\nfor i in range(int(n/2)):\r\n for j in range(a):\r\n print(\"*\",end=\"\")\r\n for j in range(b):\r\n print('D',end=\"\")\r\n b=b+2\r\n for j in range(a):\r\n print(\"*\",end=\"\")\r\n a=a-1\r\n print()\r\nfor i in range(b):\r\n print(\"D\",end=\"\")\r\nprint()\r\na=a+1\r\nb=b-2\r\nfor i in range(int(n/2)):\r\n for j in range(a):\r\n print(\"*\",end=\"\")\r\n for j in range(b):\r\n print('D',end=\"\")\r\n b=b-2\r\n for j in range(a):\r\n print(\"*\",end=\"\")\r\n a=a+1\r\n print()\r\n", "n=int(input())\r\nfor i in range(n):\r\n s=(\"*\"*(int(n/2)-i if i<=(n/2) else i-int(n/2)))\r\n d=(\"D\"*(n-2*((int(n/2)-i if i<=(n/2) else i-int(n/2)))))\r\n print(s,d,s,sep=\"\")", "# import os\r\n\r\nn = int(input())\r\n\r\nmid = 'D'*n\r\n\r\nc = 0\r\nfor i in range(1, n-1,2):\r\n print(\"{}{}{}\".format('*'*((n-i)//2),'D'*i,'*'*((n-i)//2)))\r\n\r\nprint(mid)\r\nfor i in range(n-2, 0,-2):\r\n print(\"{}{}{}\".format('*'*((n-i)//2),'D'*i,'*'*((n-i)//2)))", "n=int(input())\r\na=n//2\r\nfor i in range(n//2+1):\r\n print((n//2-i)*'*'+(2*i+1)*'D'+(n//2-i)*'*')\r\nfor i in range(n//2):\r\n print((i+1)*'*'+(2*a-1)*'D'+(i+1)*'*')\r\n a-=1", "n = int(input())\nbatas_kiri = n // 2\nbatas_kanan = n//2\n\nfor i in range(n):\n for j in range(n):\n if j >= batas_kiri and j <= batas_kanan:\n print('D', end='')\n else:\n print('*', end='')\n if i < n//2:\n batas_kiri -=1\n batas_kanan +=1\n else:\n batas_kiri += 1\n batas_kanan -=1\n print()\n \t\t\t \t\t\t \t \t\t \t \t\t \t", "n=int(input())\r\na=n//2\r\nc=0\r\nfor i in range((n//2)+1):\r\n for j in range(0,a):\r\n print(\"*\",end=\"\") \r\n for k in range(0,c+1):\r\n print(\"D\",end=\"\")\r\n c=c+2\r\n for j in range(0,a):\r\n print(\"*\",end=\"\")\r\n print()\r\n a=a-1\r\nc=n-2\r\nb=1\r\nfor i in range(n//2):\r\n for j in range(0,b):\r\n print(\"*\",end=\"\") \r\n for k in range(0,c):\r\n print(\"D\",end=\"\")\r\n c=c-2\r\n for j in range(0,b):\r\n print(\"*\",end=\"\")\r\n print()\r\n b=b+1 \r\n", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-05 23:35:59\nLastEditTime: 2021-11-05 23:49:19\nDescription: Little Pony and Crystal Mine\nFilePath: CF454A.py\n'''\n\n\ndef func():\n n = int(input())\n for i in range(-n // 2 + 1, n // 2 + 1):\n print(\"*\" * abs(i), end=\"\")\n print(\"D\" * ((n//2 - abs(i)) * 2 + 1), end=\"\")\n print(\"*\" * abs(i))\n\n\nif __name__ == '__main__':\n func()\n", "import sys\r\n\r\nn = int(input())\r\nnum_d = 1\r\nfor line in range(n):\r\n num_empty = int((n - num_d) / 2)\r\n for i in range(num_empty):\r\n sys.stdout.write('*')\r\n for i in range(num_d):\r\n sys.stdout.write('D')\r\n for i in range(num_empty):\r\n sys.stdout.write('*')\r\n sys.stdout.write('\\n')\r\n if line < int(n / 2):\r\n num_d += 2\r\n else:\r\n num_d -= 2", "x = int(input())\r\n\r\nfor i in range(-x//2+1, x//2+1):\r\n print(\"*\" * abs(i) + 'D' * (x - abs(2 * i)) + \"*\" * abs(i))\r\n", "if __name__ == '__main__':\r\n n = int(input())\r\n for i in range(n):\r\n for j in range(n):\r\n if min(i, n - i - 1) + min(j, n - j - 1) < n // 2:\r\n print('*', end='')\r\n else:\r\n print('D', end='')\r\n print()\r\n", "c=int(input())\r\nf=1\r\nfor i in range(1,c+1,2):\r\n for k in range(0,(c+1)//2-f):\r\n print('*',end='')\r\n for j in range(i):\r\n print('D',end='')\r\n for k in range(0,(c+1)//2-f):\r\n print('*',end='')\r\n print()\r\n f=f+1\r\nf=1\r\nfor i in range(c-2,0,-2):\r\n for k in range(f):\r\n print('*',end='')\r\n for j in range(i):\r\n print('D',end='')\r\n for k in range(f):\r\n print('*',end='')\r\n print()\r\n f=f+1\r\n", "n=int(input())\r\nfor i in range(n//2+1):\r\n print((n-(2*i+1))//2*'*'+(2*i+1)*'D'+(n-(2*i+1))//2*'*')\r\nfor i in range(n//2-1,-1,-1):\r\n print((n-(2*i+1))//2*'*'+(2*i+1)*'D'+(n-(2*i+1))//2*'*')\r\n \r\n \r\n \r\n", "lenghtOfDimond = int(input())\r\noffsite = int(((lenghtOfDimond - 1) / 2))\r\nreversStart = int(((lenghtOfDimond - 1) / 2)) + 1\r\nrepate = 0\r\nfor i in range(0, lenghtOfDimond):\r\n repate = (i + 1) + i\r\n print(\"*\" * offsite + \"D\" * repate + \"*\" * offsite)\r\n offsite = offsite-1\r\n if offsite < 0:\r\n break\r\n\r\noffsite = 1\r\nfor i in range(0,lenghtOfDimond-reversStart):\r\n repate = (repate-2)\r\n print(\"*\" * offsite + \"D\" * repate + \"*\" * offsite)\r\n offsite = offsite + 1\r\n", "n=int(input())\r\nfor i in range(n):a=abs(n//2-i);print(a*'*'+((n//2-a)*2+1)*'D'+a*'*')", "n = int(input())\ns = []\nfor i in range(1, n + 1, 2):\n s.append(('*' * ((n - i) // 2)) + ('D' * i) + ('*' * ((n - i) // 2)))\nfor i in range(n - 2, 0, -2):\n s.append(('*' * ((n - i) // 2)) + ('D' * i) + ('*' * ((n - i) // 2)))\nprint(*s, sep='\\n')\n", "import math\r\ndef _input(): return map(int ,input().split())\r\n\r\nn = int(input())\r\ni = 1\r\nstep = 2\r\nwhile i<=n and i>=1:\r\n k = n\r\n star = (n-i)//2\r\n j = 0\r\n print(\"*\"*star + i*\"D\"+ \"*\"*star)\r\n if i==n: step = -2\r\n i+=step", "n = int(input())\nmy_list = []\n\nfor i in range(n//2):\n s = \"*\" * (n//2 - i) + \"D\" * (2 * i + 1) + \"*\" * (n//2 - i)\n my_list.append(s)\nmy_list.append(\"D\" * n)\nfor i in range(n//2):\n s = \"*\" * (i + 1) + \"D\" * (n- i*2 - 2) + \"*\" * (i + 1)\n my_list.append(s)\n\nfor s in my_list:\n print(s)\n\n\n\n", "n=int(input())\r\nfor i in range(n):\r\n a=abs(n//2-i)\r\n b='*'*a\r\n r='D'*(n-2*a)\r\n print(b+r+b)\r\n \r\n ", "def up(n,d):\r\n for i in range(n):\r\n print(\"*\",end='')\r\n for i in range(d):\r\n print(\"D\",end='')\r\n for i in range(n):\r\n print(\"*\",end='')\r\n print(\"\")\r\nn = int(input())\r\ntemp = 1\r\nfor i in range(n,0,-2):\r\n up(i//2,temp)\r\n temp+=2\r\ntemp-=4\r\nfor i in range(2,n,2):\r\n up(i//2,temp)\r\n temp-=2\r\n ", "n = int(input())\r\n\r\nfor i in range(1,n+1):\r\n for j in range(1,n+1):\r\n if (abs(i-(n//2+1))+abs(j-(n//2+1)) <= n//2): \r\n print('D',end='')\r\n else: \r\n print(\"*\",end='')\r\n print()", "def printDiamond(n):\r\n k = 0\r\n reverse = False\r\n mid = n // 2\r\n for i in range(n):\r\n for j in range(n):\r\n if j >= mid - k and j <= mid + k:\r\n print(\"D\", end = \"\")\r\n else:\r\n print(\"*\", end = \"\")\r\n print()\r\n if i == mid:\r\n reverse = True\r\n if reverse:\r\n k -= 1\r\n else:\r\n k += 1\r\n \r\nn = int(input())\r\n\r\nprintDiamond(n)", "n = int(input())\r\nnum_d = 1\r\nfor line in range(n):\r\n num_empty = (n - num_d) // 2\r\n print('*' * num_empty + 'D' * num_d + '*' * num_empty)\r\n if line < n // 2:\r\n num_d += 2\r\n else:\r\n num_d -= 2", "n =int(input())\r\nfor i in range(n):\r\n a = abs(n//2-i)\r\n print(a*'*'+((n//2-a)*2+1)*'D'+a*'*')", "i= int(input())\r\nl= (i+1)//2\r\n\r\nj=0\r\n\r\nk=i//2\r\nwhile j<l:\r\n print( k *'*'+ (2*j + 1) *'D'+ k *'*' )\r\n k=k-1\r\n j=j+1\r\nk=k+2\r\nj=j-2\r\nwhile j>=0:\r\n print( k *'*'+ (2*j + 1) *'D'+ k *'*' ) \r\n k=k+1\r\n j=j-1", "n = int(input())\r\n \r\nfor i in range(1,n,2):\r\n j = (n-i)//2\r\n print( ('*'*j)+('D'*i)+('*'*j) )\r\n \r\nprint('D'*n)\r\n \r\nfor i in range(n-2,0,-2):\r\n j = (n-i)//2\r\n print( ('*'*j)+('D'*i)+('*'*j) )", "n=int(input())\r\nfor i in range(n):\r\n\tif i<=n/2:\r\n\t\ta='*'*abs(int(n/2)-i)\r\n\t\tprint(a+'D'*(2*i+1)+a)\r\n\telse:\r\n\t\ti=(n-1)-i\t\r\n\t\ta='*'*abs(int(n/2)-i)\r\n\t\tprint(a+'D'*(2*i+1)+a)", "n=int(input())\r\nk=[]\r\ns=''\r\na=n-1\r\na=a//2\r\nb=1\r\np=(n//2)+1\r\nfor i in range(p):\r\n for j in range(a):\r\n s+='*'\r\n for j in range(b):\r\n s+='D'\r\n for j in range(a):\r\n s+='*'\r\n k.append(s)\r\n s=''\r\n b=b+2\r\n a=a-1\r\ns=''\r\na=1\r\nb=n-2\r\nfor i in range(p-1):\r\n for j in range(a):\r\n s+='*'\r\n for j in range(b):\r\n s+='D'\r\n for j in range(a):\r\n s+='*'\r\n k.append(s)\r\n s=''\r\n b=b-2\r\n a=a+1\r\nfor i in k:\r\n print(i)\r\n \r\n \r\n", "class CodeforcesTask454ASolution:\n def __init__(self):\n self.result = ''\n self.n = 0\n\n def read_input(self):\n self.n = int(input())\n\n def process_task(self):\n g = self.n // 2\n p = -1\n x = 0\n result = []\n while x < self.n:\n result.append(\"*\" * g + \"D\" * (self.n - 2 * g) + \"*\" * g)\n g += p\n if not g:\n p = -p\n x += 1\n self.result = \"\\n\".join(result)\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask454ASolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "import sys\r\ninput = sys.stdin.readline\r\nn= int(input())\r\nmid = int((n-1)/2)\r\nfor i in range(mid):\r\n print('%s%s%s' %('*'*(mid-i),'D'*(n-(mid-i)*2),'*'*(mid-i)))\r\nprint('D'*n)\r\nfor i in range(mid,n-1):\r\n print('%s%s%s' %('*'*(i-mid+1),'D'*(n-(i-mid+1)*2),'*'*(i-mid+1)))", "N = int(input())\r\nM = N\r\nk = 1\r\nwhile True:\r\n for i in range((N-1)//2):\r\n d = (N-1)//2\r\n print('*' * d + 'D' * k + '*' * d)\r\n N -= 2\r\n k += 2\r\n d -= 2\r\n d+=2\r\n k-=2\r\n print('D'*M)\r\n for i in range((M-1)//2):\r\n print('*' * d + 'D' * k + '*' * d)\r\n M += 2\r\n k -= 2\r\n d += 1\r\n break", "def sol():\r\n n=int(input())\r\n for i in range(int(n/2)):\r\n for j in range(int(n/2)-int(i),0,-1):\r\n print(\"*\",end=\"\")\r\n for j in range(0,i*2+1):\r\n print(\"D\",end=\"\")\r\n for j in range(int(n/2)-i,0,-1):\r\n print(\"*\",end=\"\")\r\n print()\r\n for i in range(n):\r\n print(\"D\",end=\"\")\r\n print()\r\n for i in range(int(n/2)):\r\n for j in range(i+1):\r\n print(\"*\",end=\"\")\r\n for j in range(0,n-2*i-2):\r\n print(\"D\",end=\"\")\r\n for j in range(i+1):\r\n print(\"*\",end=\"\")\r\n print()\r\nif(__name__=='__main__'):\r\n sol()\r\n", "n = int(input())\r\nfor i in range(n//2):\r\n print('*' * (n//2 - i) + 'D' * (i*2+1) + '*' * (n//2 - i))\r\n\r\nprint('D' * n)\r\n\r\nfor i in range(1, n//2+1):\r\n print('*' * i + 'D' * (n-2*i) + '*' * i)", "n = int(input())\r\nfor i in range(n // 2 + 1):\r\n k = n // 2 - i\r\n m = n - 2 * k\r\n print('*' * k + \"D\" * m + '*' * k)\r\nfor i in range(n // 2 - 1, -1, -1):\r\n k = n // 2 - i\r\n m = n - 2 * k\r\n print('*' * k + \"D\" * m + '*' * k)", "n = int(input())\r\nres=\"\"\r\nfor i in range(1,n,2):\r\n res+=('D'*i).center(n,'*')+'\\n'\r\nfor i in range(n,0,-2):\r\n res+=('D'*i).center(n,'*')+'\\n'\r\nprint(res)\r\n", "n = int(input())\r\ngiua = int(n / 2)\r\nd = 1\r\nfor i in range(0, n):\r\n line = \"\"\r\n side = \"\"\r\n diamond = \"\"\r\n diamond += \"D\" * (d)\r\n side = \"*\" * int((n - len(diamond)) / 2)\r\n line = side + diamond + side\r\n print(line)\r\n if i > giua - 1:\r\n d -= 2\r\n else:\r\n d += 2", "n=int(input())\r\ni,lst=1,[]\r\nwhile n-i>=0:\r\n s=(n-i)//2\r\n patt='*'*s+'D'*i+'*'*s\r\n if n!=i:\r\n lst.append(patt)\r\n print(patt)\r\n i+=2\r\nlst=lst[::-1]\r\nfor i in lst:\r\n print(i)", "n = int(input())\r\nfor i in range(1,n+1,2):\r\n print(('*'*((n-i)//2))+('D'*i)+('*'*((n-i)//2)))\r\nfor i in range(n-2,0,-2):\r\n print(('*'*((n-i)//2))+('D'*i)+('*'*((n-i)//2)))", "n=int(input());\r\na=[['*'for j in range(n)] for i in range(n)];\r\nh=0;\r\nwhile h<n:a[h][n//2]=a[n//2][h]='D'; h+=1; \r\nfor i in range(n//2+1):\r\n for j in range(n//2+1):\r\n if n//2<=i+j:a[i][j]='D'; \r\nfor i in range(n//2+1):\r\n for j in range(n//2,n):\r\n if abs(i-j)<=n//2:a[i][j]='D'; \r\nfor i in range(n//2,n):\r\n for j in range(n//2+1):\r\n if abs(i-j)<=n//2:a[i][j]='D'; \r\nfor i in range(n//2,n):\r\n for j in range(n//2,n):\r\n if i+j<n+n//2:a[i][j]='D'; \r\nfor i in range(n):\r\n for j in range(n):\r\n print(a[i][j],end='');\r\n print();\r\n", "n=int(input())\r\nfor i in range(1,(n+1)//2+1):\r\n print(((n+1)//2-i)*\"*\"+\"D\"*(n-2*((n+1)//2-i))+((n+1)//2-i)*\"*\")\r\nfor i in range((n+1)//2-1,0,-1):\r\n print(((n+1)//2-i)*\"*\"+\"D\"*(n-2*((n+1)//2-i))+((n+1)//2-i)*\"*\")\r\n", "n=int(input())\r\nn_s=n//2\r\nn_d=1\r\nfor i in range(n):\r\n s=\"*\"*n_s +\"D\"*n_d+\"*\"*n_s\r\n print(s)\r\n if(i<n//2):\r\n n_s-=1\r\n n_d+=2\r\n elif (i>=n//2): \r\n n_s+=1\r\n n_d-=2", "def main():\r\n n = int(input())\r\n\r\n for i in range(0, n // 2):\r\n s = [\"D\" for _ in range(n)]\r\n\r\n for j in range(0, n // 2 - i):\r\n s[j] = \"*\"\r\n\r\n for j in range(n // 2 + i + 1, n):\r\n s[j] = \"*\"\r\n print(\"\".join(s))\r\n\r\n for i in range(n // 2, -1, -1):\r\n s = [\"D\" for _ in range(n)]\r\n\r\n for j in range(0, n // 2 - i):\r\n s[j] = \"*\"\r\n\r\n for j in range(n // 2 + i + 1, n):\r\n s[j] = \"*\"\r\n\r\n print(\"\".join(s))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n=int(input())\r\nfor k in range(n):\r\n l=abs(n//2-k);print(l*'*'+((n//2-l)*2+1)*'D'+l*'*')", "import math\r\n\r\nn = int(input())\r\nfull = 1\r\ndiamond = []\r\n\r\nfor i in range(math.ceil(n/2)):\r\n diamond.append(f'{(n-full)//2 * \"*\"}{\"D\" * full}{(n-full)//2 * \"*\"}')\r\n print(diamond[i])\r\n full += 2\r\n\r\nfor i in range(n//2):\r\n print(diamond[-i - 2])", "n = int(input())\r\nn1 = int(n / 2 + 1)\r\nn2 = int(n / 2)\r\nfor i in range(n1):\r\n s = '' # string initialization\r\n total_diamonds = i * 2 + 1\r\n diamond_begin_location = n1 - i - 1\r\n diamond_end_location = diamond_begin_location + total_diamonds\r\n for j in range(n):\r\n if (j >= diamond_begin_location and j < diamond_end_location):\r\n s += 'D'\r\n else:\r\n s += '*'\r\n print(s)\r\n\r\n\r\nfor i in range(n2):\r\n s = ''\r\n total_diamonds = (n2 - i) * 2 - 1\r\n diamond_begin_location = i + 1\r\n diamond_end_location = diamond_begin_location + total_diamonds\r\n for j in range(n):\r\n if (j >= diamond_begin_location and j < diamond_end_location):\r\n s += 'D'\r\n else:\r\n s += '*'\r\n print(s)\r\n ", "x = int(input())\r\nfor i in range(-(x//2),(x//2)+1):\r\n print(\"*\"*abs(i)+'D'*(x-abs(2*abs(i)))+\"*\"*abs(i))", "\"\"\"\r\n3\r\n D\r\nDDD\r\n D\r\n\r\n5\r\n**D**\r\n*DDD*\r\nDDDDD\r\n*DDD*\r\n**D**\r\n\r\n\"\"\"\r\nimport sys\r\nimport math\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#\r\n\r\nn = inp()\r\n\r\nfor i in range(1, n + 1, 2):\r\n str = \"\"\r\n temp = int((n - i) / 2)\r\n for k in range(temp):\r\n str += \"*\"\r\n str += ('D' * i)\r\n for k in range(temp):\r\n str += \"*\"\r\n print(str)\r\n\r\n\r\nfor j in range(n-2, 0, -2):\r\n str = \"\"\r\n temp = int((n - j)/2)\r\n for k in range(temp):\r\n str += \"*\"\r\n str += (\"D\"*j)\r\n for k in range(temp):\r\n str += \"*\"\r\n print(str)", "n=int(input())\r\nfor i in range(1,(n+1)//2):\r\n print('*'*((n+1)//2-i)+'D'*(2*i-1)+'*'*((n+1)//2-i))\r\nprint('D'*n)\r\nfor i in range((n-1)//2,0,-1):\r\n print('*'*((n+1)//2-i)+'D'*(2*i-1)+'*'*((n+1)//2-i))", "n = int(input())\r\n\r\nfor i in range(1, n, 2):\r\n a = int((n-i)/2)\r\n print(\"*\"*a + \"D\"*i + \"*\"*a)\r\n\r\nprint(\"D\"*n)\r\n\r\nfor i in range(n-2, 0, -2):\r\n a = int((n-i)/2)\r\n print(\"*\"*a + \"D\"*i + \"*\"*a)\r\n \r\n \r\n\r\n", "n=int(input())\r\nx=n//2\r\nj=1\r\nfor i in range(x,0,-1):\r\n print('*'*i,end=\"\")\r\n print('D'*j,end=\"\")\r\n j+=2\r\n print('*'*i)\r\nprint(\"D\"*j)\r\nj-=2\r\nfor i in range(1,x+1):\r\n print('*'*i, end=\"\")\r\n print('D'*j,end=\"\")\r\n j-=2\r\n print(\"*\"*i)", "n=int(input())\r\nstring=[]\r\n# ''.join(map(str,string))\r\nc=int(n/2)\r\nfor i in range(c):\r\n str='*'*(c-i)+'D'*((2*i)+1)+'*'*(c-i)\r\n print(str)\r\n string.append(str)\r\nprint('D'*n)\r\nstring.reverse()\r\nprint('\\n'.join(string))", "if __name__ == '__main__':\n n = int(input())\n for i in range(1, (n + 1) // 2 + 1):\n for j in range((n + 1) // 2 - i):\n print(\"*\", end=\"\")\n for k in range((i * 2) - 1):\n print(\"D\", end=\"\")\n for l in range((n + 1) // 2 - i):\n print(\"*\", end=\"\")\n print()\n\n for i in range((n + 1) // 2 + 1, n + 1):\n for j in range(i - (n + 1) // 2):\n print(\"*\", end=\"\")\n for k in range((n + 1 - i) * 2 - 1):\n print(\"D\", end=\"\")\n for l in range(i - (n + 1) // 2):\n print(\"*\", end=\"\")\n print()\n\n \t \t \t\t \t\t \t \t \t\t\t\t\t", "crystal = []\r\n\r\nN = int(input())\r\n\r\nfor i in range(N):\r\n crystal.append([\"*\" for j in range(N)])\r\n\r\nmiddle = N // 2\r\n\r\nfor i in range(N):\r\n if i <= middle:\r\n for j in range(middle - i, middle + i + 1):\r\n crystal[i][j] = \"D\"\r\n else:\r\n for j in range(i - middle, N - i + middle):\r\n crystal[i][j] = \"D\"\r\n\r\nHeresSomeText = \"\"\r\n\r\nfor thing1 in crystal:\r\n for thing2 in thing1:\r\n HeresSomeText += str(thing2)\r\n print(HeresSomeText)\r\n HeresSomeText = \"\"\r\n\r\n'''stars = N // 7\r\n\r\nfor row in crystal:\r\n if crystal.index(row) > N // 7:\r\n row'''\r\n", "n=int(input())\r\nfor i in range(1,n,2):\r\n print(('D'*i).center(n,'*'))\r\nprint(\"D\"*n)\r\nfor i in range(n-2,0,-2):\r\n print(('D'*i).center(n,'*'))", "n = int(input())\r\nlist1 = []\r\nfor i in range(n//2+1):\r\n a = '*'*(n//2-i)+'D'*(2*i+1)+'*'*(n//2-i)\r\n list1.append(a)\r\nfor i in range(n//2):\r\n a = '*'*((n//2+1)-(n//2-i))+'D'*((n-1)-(2*i+1))+'*'*((n//2+1)-(n//2-i))\r\n list1.append(a)\r\nprint(*list1, sep='\\n')\r\n", "n = int(input())\r\nfor i in range(n//2):\r\n\tprint((\"*\"*((n//2)-i))+(\"D\"*i)+\"D\"+(\"D\"*i)+(\"*\"*((n//2)-i)))\r\nprint(\"D\"*n)\r\nfor j in range(n//2):\r\n\tprint(\"*\"+\"*\"*j+\"D\"*(n//2-j-1)+\"D\"+\"D\"*(n//2-j-1)+\"*\"*j+\"*\")\t\r\n\r\n", "n = int(input())\r\nfor i in range(n):\r\n for ii in range(n):\r\n if min(ii, n-ii-1) >= (abs(n//2-i)):\r\n print(\"D\", end=\"\")\r\n else:\r\n print(\"*\", end=\"\")\r\n print()\r\n", "n=int(input())\r\nd=[]\r\nfor i in range(1,n+1,2):\r\n\tl=[]\r\n\tfor j in range(i):\r\n\t\tl.append(\"D\")\r\n\tfor j in range((n-i)//2):\r\n\t\tl.insert(0,\"*\")\r\n\t\tl.append(\"*\")\r\n\tr=\"\".join(l)\r\n\tprint(r)\r\n\td.append(r)\r\nfor i in range(n//2-1,-1,-1):\r\n\tprint(d[i])", "n = int(input())\r\nfor i in range(n):\r\n\ts = ''\r\n\tfor j in range(n):\r\n\t\tif abs(i - n // 2) + abs(j - n // 2) <= n // 2:\r\n\t\t\ts += 'D'\r\n\t\telse:\r\n\t\t\ts += '*'\r\n\tprint(s)", "n=int(input())\r\nfor i in range(1,((n+1)//2)+1):\r\n for j in range(1,n+1):\r\n c=(n+1)//2\r\n if j>=c-(i-1) and j<=c+(i-1):\r\n print('D',end='')\r\n else:print('*',end='')\r\n print()\r\nfor i in range(((n+1)//2)+1,n+1):\r\n for j in range(1,n+1):\r\n c=(n+1)//2\r\n if j>=c-(n-i) and j<=c+(n-i):print('D',end='')\r\n else:print('*',end='')\r\n print()", "n=int(input())\r\nnn=n//2\r\nfor i in range(n):\r\n if i<=nn:\r\n m=(i+1)*2-1\r\n lr=(n-m)//2\r\n else:\r\n m=((n-i))*2-1\r\n lr=(n-m)//2\r\n print(lr*'*'+m*'D'+lr*'*')", "n = int(input())\na, b, d = (n-1)//2, 1, 1\nfor i in range(n):\n if a == 0:\n b = -1\n print('*' * a + 'D' * d + '*' * a)\n a -= b\n d += b * 2\n\n \t \t\t \t \t\t\t \t\t\t\t\t \t", "n = int(input())\r\nD = 1\r\nstars = (n - 1)//2\r\nfor i in range((n - 1)//2):\r\n print(\"*\"*stars + \"D\"*D + \"*\"*stars)\r\n D += 2\r\n stars -= 1\r\n \r\nprint(\"D\"*D)\r\n\r\nfor i in range((n - 1)//2):\r\n D -= 2\r\n stars += 1\r\n print(\"*\"*stars + \"D\"*D + \"*\"*stars)", "n = int(input())\r\n\r\nfor i in range(n//2 + 1):\r\n first = \"*\" * ((n//2) - i)\r\n med = \"D\" * ((2*i) + 1)\r\n last = \"*\" * ((n//2) - i)\r\n line = first + med + last\r\n print(line)\r\n\r\nfor i in range(n//2 -1, -1, -1):\r\n first = \"*\" * ((n//2) - i)\r\n med = \"D\" * ((2*i) + 1)\r\n last = \"*\" * ((n//2) - i)\r\n line = first + med + last\r\n print(line)", "import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,queue,copy\n\nsys.setrecursionlimit(10**7)\ninf=10**20\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 [int(x) for x in sys.stdin.readline().split()]\ndef LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]\ndef I(): return int(sys.stdin.readline())\ndef LS(): return sys.stdin.readline().split()\ndef S(): return input()\n\ndef main():\n n=I()\n\n l=[['D']*n for _ in range(-(-n//2))]\n\n a=b=n//2\n for i in range(-(-n//2)-1):\n for j in range(a):\n l[i][j]='*'\n a-=1\n for i in range(-(-n//2)-1):\n for j in range(b):\n l[i][-(j+1)]='*'\n b-=1\n\n for x in l:\n print(''.join(x))\n\n l.reverse()\n for x in l[1:]:\n print(''.join(x))\n\nmain()\n# print(main())\n", "def main():\r\n n = int(input())\r\n lines = []\r\n for i in range(n//2+1):\r\n x = 1+(i)*2\r\n d = (n-x)//2\r\n lines.append(\"*\"*d+'D'*x+\"*\"*d)\r\n\r\n for i in range(n//2+2, n+1):\r\n v = n//2-(i-n//2)+1\r\n x = 1+(v)*2\r\n d = (n-x)//2\r\n lines.append(\"*\" * d + 'D' * x + \"*\" * d)\r\n for l in lines:\r\n print(l)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\nk = 0\r\nc = 1\r\nb = n\r\nfor i in range(1, n+1):\r\n if i <= (n+1)//2:\r\n k = (n-c)//2\r\n print(\"*\"*k + \"D\"*(n-(2*k)) + \"*\"*k)\r\n c+=2\r\n else:\r\n b-=2\r\n print(\"*\"*((n-b)//2) + \"D\"*b + \"*\"*((n-b)//2))\r\n\r\n \r\n", "n = int(input())\r\nlst = ['*']*n\r\nmid = n//2\r\nlstn = []\r\nfor i in range(mid+1):\r\n lst[mid-i:mid+i+1] = ['D']*(2*i+1)\r\n lstn.append(''.join(lst))\r\nfor j in lstn:\r\n print(j)\r\nfor i in range(2, mid+2):\r\n print(lstn[-i])", "n = int(input())\r\na = ''\r\nd = 1\r\nz = n // 2\r\nf = 1\r\nh = n - 2\r\nfor i in range(n):\r\n if i <= n // 2:\r\n print('*' * z, 'D' * d, '*' * z, sep='')\r\n d += 2\r\n z -= 1\r\n else:\r\n print('*' * f, 'D' * h, '*' * f, sep='')\r\n f += 1\r\n h -= 2", "import random\r\n\r\n\r\n# def selection_sort(l: list, reverse: bool = False):\r\n# b = []\r\n# while len(l) > 0:\r\n# index = 0\r\n# m = float('-inf') if reverse else float('inf')\r\n# for i in range(len(l)):\r\n# if not reverse and l[i] < m:\r\n# m = l[i]\r\n# index = i\r\n# elif reverse and l[i] > m:\r\n# m = l[i]\r\n# index = i\r\n# a = l.pop(index)\r\n# b.append(a)\r\n# return b\r\n#\r\n#\r\n# print(selection_sort([5, 6, 8, 3, 9, 0, 17, 465]))\r\n\r\n\r\ndef qsort(l: list):\r\n if len(l) < 2:\r\n return l\r\n rand_num = random.choice(l)\r\n smaller = [i for i in l if i < rand_num]\r\n equal = [i for i in l if i == rand_num]\r\n bigger = [i for i in l if i > rand_num]\r\n return qsort(smaller) + equal + qsort(bigger)\r\n\r\n\r\n# s = []\r\n# for i in range(5):\r\n# s.append([int(j) for j in input().split()])\r\n# x, y = 0, 0\r\n# for i in range(5):\r\n# for j in range(5):\r\n# if s[i][j] == 1:\r\n# x, y = i, j\r\n# print(abs(x - 2) + abs(y - 2))\r\n\r\n# n, m = [int(i) for i in input().split()]\r\n# res = []\r\n# for i in range(n):\r\n# if i % 2 == 0:\r\n# res.append('#' * m)\r\n# elif i % 4 == 1:\r\n# res.append('.' * (m - 1) + '#')\r\n# elif i % 4 == 3:\r\n# res.append('#' + '.' * (m - 1))\r\n# print('\\n'.join(res))\r\n\r\n# res = []\r\n# for i in range(n):\r\n# res.append([1 for j in range(n)])\r\n# for i in range(1, n):\r\n# for j in range(1, n):\r\n# res[i][j] = res[i][j-1] + res[i-1][j]\r\n# print(res[-1][-1])\r\n\r\nn = int(input())\r\nk = 1\r\nres = []\r\nfor i in range(n):\r\n s = '*' * int(abs(n - k) / 2) + 'D' * (n - abs(n-k)) + '*' * int(abs(n - k) / 2)\r\n print(s)\r\n res += s\r\n k += 2", "x=int(input())\r\nm=[]\r\nfor i in range(1,x//2+1):\r\n s='*'*((x+1-2*i)//2)+'D'*(2*i-1)+'*'*((x+1-2*i)//2)\r\n m.append(s)\r\n\r\nfor i in m:\r\n print(i)\r\nprint(\"D\"*x)\r\nfor i in m[::-1]:\r\n print(i)", "n = int(input())\r\narray = [i%n for i in range((n-1) // 2, 0, -1)]\r\nfor i in range(0, (n-1) // 2+1):\r\n array.append(i)\r\nfor i in range(n):\r\n print('*'*array[i] + 'D'*(n-array[i]*2) + '*'*array[i])", "\r\nt=int(input())\r\nr=1\r\nuio=0\r\nfor i in range (t):\r\n\te=(t-r)//2\r\n\tfor j in range(e):\r\n\t\tprint(\"*\",end=\"\")\r\n\tfor k in range (r):\r\n\t\tprint(\"D\",end=\"\")\r\n\tfor l in range (e):\r\n\t\tprint(\"*\",end=\"\")\r\n\tif uio==0:\r\n\t\tr=r+2\r\n\tif r>t:\r\n\t\tuio=1\r\n\t\tr=t\r\n\tif uio==1:\r\n\t\tr=r-2\r\n\r\n\tprint()", "from math import ceil\n\nn = int(input())\nrows = []\n\nfor i in range(ceil(n/2)):\n\trow = '{b}{c}{b}'.format(b='*'*(ceil(n/2)-i-1), c='D'*(1 + 2*i))\n\trows.append(row)\n\nfor row in rows:\n\tprint(row)\n\nfor row in (rows[::-1])[1:]:\n\tprint(row)\n", "\r\nt = 1\r\n\r\nwhile t > 0:\r\n n = int(input())\r\n for i in range(n//2):\r\n for j in range(n):\r\n if n//2 - i <= j <= n//2 + i:\r\n print('D', end='')\r\n else:\r\n print('*', end='')\r\n print()\r\n print('D' * n)\r\n for i in range(n//2-1,-1,-1):\r\n for j in range(n):\r\n if n//2 - i <= j <= n//2 + i:\r\n print('D', end='')\r\n else:\r\n print('*', end='')\r\n print()\r\n t -= 1", "size = int(input())\r\n\r\nd = 1\r\nstar = size\r\n\r\nfor i in range(size):\r\n if i < size // 2:\r\n for j in range((star - d) // 2):\r\n print(\"*\", end=\"\")\r\n for j in range(d):\r\n print(\"D\", end=\"\")\r\n for j in range((star - d) // 2):\r\n print(\"*\", end=\"\")\r\n d += 2\r\n print()\r\n elif i == size // 2:\r\n for j in range(size):\r\n print(\"D\", end=\"\")\r\n print()\r\n else:\r\n d -= 2\r\n for j in range((star - d) // 2):\r\n print(\"*\", end=\"\")\r\n for j in range(d):\r\n print(\"D\", end=\"\")\r\n for j in range((star - d) // 2):\r\n print(\"*\", end=\"\")\r\n print()\r\n", "num = int(input())\r\ndCount = 1\r\nasteric = \"*\"\r\nfor i in range(num):\r\n strCount = num - dCount\r\n print(int((strCount/2))*asteric+ dCount*'D'+ int((strCount/2))*asteric)\r\n if i<int(num/2):\r\n dCount+=2\r\n continue\r\n dCount-=2", "# pattern\ndef solve(n):\n s = \"D\"\n flag = True\n for i in range(n):\n print(s.center(n, '*'))\n if len(s) == n:\n flag = False\n if flag == True:\n s = s + \"DD\"\n elif flag == False:\n s = s[1:-1]\n \n\nn = int(input())\nsolve(n)\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ncnt = 1\r\nfor i in range(n):\r\n tmp = '*' * ((n - cnt) // 2)\r\n print(tmp + 'D' * cnt + tmp)\r\n if i >= n // 2:\r\n cnt -= 2\r\n else:\r\n cnt += 2", "import math\r\n\r\nnumber = int(input())\r\nnew_number = math.floor(number / 2)\r\ncounter = new_number\r\nwhile counter != -1 :\r\n string = '*'*counter\r\n string2 = 'D'*(number - counter *2 )\r\n print(string + string2 + string)\r\n counter -=1\r\ncounter = 1\r\nwhile counter <= new_number :\r\n string = '*'*counter\r\n string2 = 'D'*(number - counter *2 )\r\n print(string + string2 + string)\r\n counter +=1", "n = int(input())\r\nfor i in range(n//2 + 1):\r\n print(('D'*((2*i)+1)).center(n, \"*\"))\r\nfor i in range(n//2):\r\n print(('D'*(n - (2*(i+1)))).center(n, \"*\"))\r\n", "n=int(input())\r\nfor i in range(-n//2+1, n//2+1):\r\n print(\"*\"*abs(i) + \"D\"*(n-abs(2*i)) + \"*\"*abs(i))", "n = int(input())\r\n\r\nans = []\r\ntemp = \"\"\r\nmd = n//2\r\nstar = 1\r\nfor i in range(1, (n+1)//2+1):\r\n temp = md * \"*\" + (i*2-1) * \"D\" + md * \"*\"\r\n ans.append(temp)\r\n md -= 1\r\nans = ans + ans[:-1][::-1]\r\nfor i in ans:\r\n print(i)\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\n\r\nh = n >> 1\r\n\r\na = []\r\n\r\nfor i in range(h):\r\n w = h - i\r\n wi = w * '*'\r\n a.append(wi + (1 + (i << 1)) * 'D' + wi)\r\n\r\nm = 'D' * n\r\n\r\nprint('\\n'.join(a) + '\\n' + m + '\\n' + '\\n'.join(reversed(a)))", "n=int(input())\nl=[]\np=n//2\nq=1\nfor i in range(1,n//2+1):\n l.append(\"*\"*(p)+\"D\"*(q)+\"*\"*(p))\n p-=1\n q+=2\nl.append(\"D\"*(n))\nl+=l[:-1][::-1]\nfor i in l:\n print(i)\n", "z = int(input())\r\ns='D'\r\nfor i in range((z+1)//2):\r\n print('*'*(z//2-i)+s+'*'*(z//2-i))\r\n s=s+'DD'\r\ns=s.join(s.split())[:-2]\r\n\r\nfor i in reversed(range((z+1)//2-1)):\r\n s=s.join(s.split())[:-2]\r\n print('*'*(z//2-i)+s+'*'*(z//2-i))", "i=int(input());j=i//2;k=i%2;s,m,x=[],[],[]\r\nfor m in range(i//2+1):\r\n\t\ts.append(\"*\"*j+\"D\"*k+\"*\"*j)\r\n\t\tk=k+2\r\n\t\tj=j-1\r\nm=s;s=s[:-1];x=m+s[::-1]\r\nfor i in x:\r\n\tprint(i)\r\n\r\n\r\n", "# author: violist\n# created: 19.04.2021 07:52:27\n\nimport sys\ninput = sys.stdin.readline\n\nn = int(input())\nfor i in range(1, n + 1):\n for j in range(1, n + 1):\n if (abs(i - (n // 2 + 1)) + abs(j - (n // 2 + 1)) <= n // 2):\n print(\"D\", end = \"\")\n else:\n print(\"*\", end = \"\")\n print()\n", "N = int(input())\nsamping_kiri = N//2 - 1\nsamping_kanan = N//2 + 1\n\nfor i in range(N):\n for j in range(N):\n if j>samping_kiri and j<samping_kanan:\n print(\"D\", end=\"\")\n else:\n print(\"*\", end=\"\")\n if i < N//2:\n samping_kiri -=1\n samping_kanan +=1\n elif i>= N//2:\n samping_kiri +=1\n samping_kanan -=1\n print()\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\nstep = 1\r\ni = 0\r\nfl = True\r\nfor i in range(n):\r\n cnt = (n - step) // 2\r\n print('*' * cnt, end='')\r\n print('D' * step, end='')\r\n print('*' * cnt)\r\n if step == n:\r\n fl = False\r\n if fl: step += 2\r\n else: step -= 2", "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=read_int()\r\n\tn//=2\r\n\tfor i in range(-n, n+1):\r\n\t\tprint(\"*\"*abs(i) + \"D\"*(2*n+1-2*abs(i)) + \"*\"*abs(i))\r\n\r\nsolve()\r\n", "n = int(input())\r\n\r\nx = 'D'\r\nz=''\r\nfor i in range(0,n+1):\r\n if i%2:\r\n print((x * i).center(n, '*'))\r\n\r\nfor i in range(n-1,0,-1):\r\n if i%2:\r\n print((x * i).center(n, '*'))", "import math\na=int(input())\narr=[a//2]\nans=[]\nfor i in range(math.ceil(a//2)+1):\n trr=[]\n for j in range(a):\n if(j in arr):\n trr.append('D')\n else:\n trr.append(\"*\")\n ans.append(trr)\n arr.append(arr[0]-1)\n arr.sort()\n arr.append(arr[len(arr)-1]+1)\nfor i in ans:\n print(''.join(i))\nans=ans[::-1]\nans.pop(0)\nfor i in ans:\n print(''.join(i))", "n = int(input())\r\n\r\nfor i in range(1, n + 1, 2):\r\n\tprint('*' * ((n - i) // 2), end='')\r\n\tprint('D' * i, end='')\r\n\tprint('*' * ((n - i) // 2), end='')\r\n\tprint()\r\n\r\nfor i in range(n - 2, 0, -2):\r\n\tprint('*' * ((n - i) // 2), end='')\r\n\tprint('D' * i, end='')\r\n\tprint('*' * ((n - i) // 2), end='')\r\n\tprint()", "def romb(n):\r\n final_list = []\r\n m_l = []\r\n for i in range(n):\r\n m_l.append(\"*\")\r\n mid = len(m_l) // 2\r\n reached_first = False\r\n k = 0\r\n for i in range(n):\r\n if len(m_l) - 1 >= i + mid and not reached_first:\r\n m_l[i + mid] = \"D\"\r\n m_l[mid - i] = \"D\"\r\n final_list.append(\"\".join(m_l))\r\n if len(m_l) - 1 < i + mid:\r\n reached_first = True\r\n if reached_first:\r\n m_l[-1 - k] = \"*\"\r\n m_l[0 + k] = \"*\"\r\n k += 1\r\n final_list.append(\"\".join(m_l))\r\n return \"\\n\".join(final_list)\r\n\r\n\r\ndef main_function():\r\n n = int(input())\r\n return romb(n)\r\n\r\nprint(main_function())", "n = int(input())\r\n# n // 2 stars * first line\r\n# decrease till 3 then increase \r\nans = n//2\r\nwoioi = n//2\r\nj = 0\r\nfor i in range(n):\r\n print('*'*ans + 'D'*(n-2*ans) + '*'*ans)\r\n j += 1\r\n if j <= woioi:\r\n ans -= 1\r\n continue\r\n if j <= n:\r\n ans += 1\r\n", "line = int(input())\r\nmid_pt = (line+1)//2\r\nfor i in range(1,line+1):\r\n if i<mid_pt:\r\n print(\"*\"*(mid_pt-i)+\"D\"*(2*i-1)+\"*\"*(mid_pt-i))\r\n\r\n else: \r\n print(\"*\"*(i-mid_pt)+\"D\"*(2*(line+1-i)-1)+\"*\"*(i-mid_pt))", "n = int(input())\r\nd = n//2\r\nfor i in range(n):\r\n D = min(i, n-1-i)\r\n s = d-D\r\n print(\"*\"*s+ \"D\"*(2*D+1) +\"*\"*s)\r\n", "n=int(input())\r\nl=[]\r\nfor i in range(1,(n+1)//2):\r\n pD=2*i-1\r\n p=(n-pD)//2\r\n \r\n s=('*'*p)+('D'*pD)+('*'*p)\r\n l+=[s]\r\n print(s)\r\n\r\nprint('D'*n)\r\nfor i in range(len(l)-1,-1,-1):\r\n print(l[i])\r\n \r\n", "n=int(input())\r\nfor i in range(1,(n+1)//2+1):\r\n print('*'*((n+1)//2-i),end='')\r\n print('D'*(2*i-1),end='')\r\n print('*'*((n+1)//2-i),end='')\r\n print()\r\nfor i in range((n-1)//2,0,-1):\r\n print('*'*((n+1)//2-i),end='')\r\n print('D'*(2*i-1),end='')\r\n print('*'*((n+1)//2-i),end='')\r\n print() \r\n ", "from sys import stdin; inp = stdin.readline\r\nfrom math import dist, ceil, floor, sqrt, log\r\ndef IA(): return list(map(int, inp().split()))\r\ndef FA(): return list(map(float, inp().split()))\r\ndef SA(): return inp().split()\r\ndef I(): return int(inp())\r\ndef F(): return float(inp())\r\ndef S(): return inp()\r\n\r\ndef main():\r\n n = I()\r\n d = 1\r\n stack = []\r\n while d <= n:\r\n stars = n-d \r\n s = '*'*(stars//2)\r\n s = s+('D'*d)\r\n s = s+'*'*(stars//2)\r\n print(s)\r\n if '*' in s:\r\n stack.append(s)\r\n d += 2 \r\n while stack:\r\n s = stack.pop()\r\n print(s)\r\n \r\nif __name__ == '__main__':\r\n main()", "n = int(input())\r\nfor x in range(1, n // 2 + 2): print(\"*\" * (n // 2 - x + 1) + \"D\" * (x * 2 - 1) + \"*\" * (n // 2 - x + 1))\r\nfor x in range(n // 2, 0, -1): print(\"*\" * (n // 2 - x + 1) + \"D\" * (x * 2 - 1) + \"*\" * (n // 2 - x + 1))", "n = int(input())\r\na = (n - 1) / 2\r\nq = 1\r\nw = False\r\nfor i in range(n):\r\n s = ''\r\n d = False\r\n cnt = 0\r\n for j in range(n):\r\n if (j + 1) == a + 1:\r\n d = True\r\n if cnt == q:\r\n d = False\r\n if d:\r\n s += \"D\"\r\n cnt += 1\r\n else:\r\n s += '*'\r\n print(s)\r\n if not w:\r\n q += 2\r\n a -= 1\r\n else:\r\n a += 1\r\n q -= 2\r\n if q > n:\r\n q = n - 2\r\n w = True\r\n a = 1\r\n", "n = int(input())\r\nm = 1\r\nlistt = []\r\nwhile m <= n:\r\n a = '*'*((n-m)//2) + 'D'*m + '*'*((n-m)//2)\r\n listt.append(a)\r\n m += 2\r\n \r\nm -= 2\r\n\r\nfor i in range(n//2):\r\n m -= 2\r\n a = '*'*((n-m)//2) + 'D'*m + '*'*((n-m)//2)\r\n listt.append(a)\r\n\r\nfor i in range(n):\r\n print(*listt[i], sep='')", "# import sys\r\n# sys.stdout = open('DSA/Stacks/output.txt', 'w')\r\n# sys.stdin = open('DSA/Stacks/input.txt', 'r')\r\n\r\nn = int(input())\r\nll=[]\r\nst=1\r\nif n==1:\r\n print(\"D\")\r\nelse:\r\n for i in range((n+1)//2):\r\n spaces = \"*\"*((n-st)//2)\r\n ss = spaces+\"D\"*st+spaces\r\n ll.append(ss)\r\n st+=2\r\n for el in ll:\r\n print(el)\r\n for j in range(len(ll)-2,-1,-1):\r\n print(ll[j])", "n = int(input())\r\nk = 0\r\nfor i in range(1, n+1):\r\n for j in range(1, n+1):\r\n if (j >= ((n // 2) + 1 - k)) and (j <= ((n // 2) + 1 + k)):\r\n print(\"D\", end = \"\")\r\n else:\r\n print(\"*\",end=\"\")\r\n if(i < n//2 + 1):\r\n k += 1\r\n else:\r\n k -= 1\r\n print()", "n = int(input())\r\nm = []\r\nfor i in range(n // 2):\r\n k = 2 * i + 1\r\n s = \"*\" * ((n - k) // 2) + 'D' * (k) + \"*\" * ((n - k) // 2)\r\n print(s)\r\n m.append(s)\r\nprint(\"D\" * n)\r\nfor i in m[::-1]:\r\n print(i)", "n = int(input())\r\n\r\nfor i in range(1, n, 2):\r\n t = n - i\r\n u = (t // 2) * '*'\r\n v = i * 'D'\r\n print(str(u) + str(v) + str(u))\r\nfor i in range(n, 1, -2):\r\n t = n - i\r\n u = (t // 2) * '*'\r\n v = i * 'D'\r\n print(str(u) + str(v) + str(u))\r\nprint(str((n-1)//2*'*')+ str('D') + str((n-1)//2*'*'))", "n = int(input())\r\nLength_of_one_string = n\r\nanswer = []\r\ndcounter = 1\r\nfor i in range(n//2):\r\n answer.append((Length_of_one_string-dcounter)//2 * '*')\r\n answer[i] += dcounter*'D'\r\n answer[i] += (Length_of_one_string - dcounter)//2 * '*'\r\n dcounter += 2\r\nanswer.append('D'*Length_of_one_string)\r\nprint('\\n'.join(answer) + '\\n' + '\\n'.join(answer[n//2 - 1::-1]))", "n = int(input())\r\nh = (n+1)//2\r\nc = 1\r\nli = []\r\nfor i in range(1, (n+1)//2):\r\n li.append(\"*\"*(h-i) + \"D\"*c + \"*\"*(h-i))\r\n print(li[-1])\r\n c += 2\r\n\r\nprint(\"D\"*n)\r\nfor i in li[::-1]:\r\n print(i)", "n = int(input())\r\nfor i in range(1, n + 1, 2):print((\"D\" * i).center(n).replace(\" \", \"*\"))\r\nfor i in range(n - 2, 0, -2):print((\"D\" * i).center(n).replace(\" \", \"*\"))", "n = int(input())\r\nmat = [['*' for j in range(n)] for i in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n center = n // 2\r\n if i <= center:\r\n if abs(j - center) <= i:\r\n mat[i][j] = 'D'\r\n else:\r\n if abs(j - center) <= n - 1 - i:\r\n mat[i][j] = 'D'\r\n\r\nfor i in range(n):\r\n print(''.join(mat[i]))", "n=int(input())\r\nj=n//2\r\nfor i in range(1,n+1,2):\r\n\tprint(j*\"*\"+i*\"D\"+j*\"*\")\r\n\tj-=1\r\nj=1\r\nfor i in range(n-2,0,-2):\r\n\tprint(j*\"*\"+i*\"D\"+j*\"*\")\r\n\tj+=1\r\n", "num = int(input())\r\nfor i in range(1,num//2+1):\r\n print(\"*\"*((num//2+1)-i)+(\"D\")*(i*2-1)+\"*\"*((num//2+1)-i))\r\nprint(\"D\"*num)\r\nfor j in range(1,num//2+1):\r\n print(\"*\"*j+(\"D\")*(num-(2*j))+\"*\"*j)\r\n ", "a=int(input())\r\nb=a//2\r\nfor i in range(1,a+1):\r\n if(i<=b):\r\n print(\"*\"*(b-i+1),end=\"\")\r\n print(\"D\"*(2*i-1),end=\"\")\r\n print(\"*\"*(b-i+1))\r\n elif(i==b+1):\r\n print(\"D\"*a)\r\n else:\r\n print(\"*\"*(i-b-1),end=\"\")\r\n print(\"D\"*((a-2)-2*(i-b-2)),end=\"\")\r\n print(\"*\"*(i-b-1))", "n = int(input())\r\nk = 0\r\nl = 1\r\nfor i in range(n // 2 + 1):\r\n for j in range(n):\r\n if (j + i) * 2 + 1 >= n and k < l:\r\n print(\"D\",end=\"\")\r\n k += 1\r\n else:\r\n print(\"*\",end=\"\")\r\n print()\r\n l += 2\r\n k = 0\r\nl = (2 * (n // 2)) - 1\r\nfor i in range(n // 2 - 1, -1, -1):\r\n for j in range(n):\r\n if (j + i) * 2 + 1 >= n and k < l:\r\n print(\"D\",end=\"\")\r\n k += 1\r\n else:\r\n print(\"*\",end=\"\")\r\n print()\r\n l -= 2\r\n k = 0", "n = int(input())\r\nind = 1\r\nfor i in range(n//2+1):\r\n count_star = (n-ind)//2\r\n print(\"*\"*count_star + \"D\"*ind+\"*\"*count_star)\r\n ind += 2\r\nind -= 2\r\nfor i in range(n//2):\r\n ind -= 2\r\n count_star = (n-ind)//2\r\n print(\"*\"*count_star + \"D\"*ind+\"*\"*count_star)\r\n", "n = int(input())\nfor i in range(n//2):\n a = (i*2+1)\n print('*'*((n-a)//2)+'D'*a+'*'*((n-a)//2))\nprint('D'*n)\nfor i in range(n//2-1,-1,-1):\n a = (i*2+1)\n print('*'*((n-a)//2)+'D'*a+'*'*((n-a)//2))", "c=int(input())\r\na=1\r\nb=c//2\r\nlst=[] \r\nfor t in range(c): \r\n z='*'*b+'D'*a+'*'*b\r\n lst.append(z)\r\n print(z)\r\n if a==c:\r\n break\r\n b-=1\r\n a+=2\r\ny=-2\r\nfor a in range(len(lst)):\r\n print(lst[y])\r\n if lst[y]==lst[0]:\r\n break\r\n y-=1", "a = int(input())\r\nl = ['D' * ((i*2) + 1) for i in range(0, (a)//2, 1)] + ['D' * a] + ['D' * ((i*2) + 1) for i in range(0, (a)//2, 1)][::-1]\r\nfor i in l:\r\n print('*' * (((a - len(i)) // 2)), end='')\r\n print(i, end='')\r\n print('*' * (((a - len(i)) // 2)))", "num = int(input())\r\ni,g,h=(0,1,num-2)\r\nx=int((num-1)/2)\r\ny=x\r\nfor i in range(0,x+1):\r\n print(\"*\"*(x) + \"D\"*g + \"*\"*(x))\r\n g+=2\r\n x-=1\r\ni,z=(0,1)\r\nfor i in range(0,y):\r\n print(\"*\"*(z) + \"D\"*h + \"*\"*(z))\r\n h-=2\r\n z+=1\r\n", "n=int(input())\r\nx=\"D\"\r\nfor i in range(1,n+1):\r\n if i==(n//2)+1:\r\n for j in range(i,0,-1):\r\n print(((2*j-1)*x).center(n,\"*\"))\r\n break\r\n print(((2*i-1)*x).center(n,\"*\"))", "n = int(input())\r\nd = 1\r\ndraw = []\r\ns = []\r\n\r\nfor k in range(n//2+1):\r\n s = []\r\n\r\n for j in range(d):\r\n s.append('D')\r\n for i in range((n-len(s))//2):\r\n s.insert(0, '*')\r\n s.insert(len(s), '*')\r\n\r\n d += 2\r\n draw.append(s)\r\nd -= 2\r\nfor k in range(n//2):\r\n d -= 2\r\n s = []\r\n\r\n for j in range(d):\r\n s.append('D')\r\n for i in range((n - len(s)) // 2):\r\n s.insert(0, '*')\r\n s.insert(len(s), '*')\r\n\r\n draw.append(s)\r\n\r\n\r\nfor i in draw:\r\n for j in i:\r\n print(j, end='')\r\n print()\r\n\r\n\r\n\r\n", "n =int(input())\r\nall='D'\r\nfor i in range(1,n+1,2):\r\n print((all*i).center(n,'*'))\r\n\r\nfor i in range(n-1,0,-1):\r\n if i%2:\r\n print((all*i).center(n,'*'))", "n=int(input())\r\nl=[]\r\ns=''\r\np=''\r\nfor j in range(n//2):\r\n s=''\r\n for k in range(n//2-j):\r\n s=s+'*'\r\n for k in range((2*j)+1):\r\n s=s+'D'\r\n for k in range(n//2-j):\r\n s=s+'*'\r\n l.append(s)\r\nfor i in range(n):\r\n p=p+'D'\r\nfor i in l:\r\n print(i)\r\nprint(p)\r\nl=l[::-1]\r\nfor i in l:\r\n print(i)", "s = int(input()) # crystal size\r\nc = ''\r\nfor y in range(0,s//2):\r\n x = y * 2 + 1\r\n x_e = (s - x) // 2\r\n c = x_e * '*' + x * 'D' + x_e * '*'\r\n print(c)\r\nprint(s * 'D')\r\nfor y in range(s//2,0,-1):\r\n x = (y - 1) * 2 + 1\r\n x_e = (s - x) // 2\r\n c = x_e * '*' + x * 'D' + x_e * '*'\r\n print(c)", "n=int(input())\r\n\r\nfor i in range(1,n+1,2):\r\n print(((n-i)//2)*\"*\"+i*\"D\"+((n-i)//2)*\"*\")\r\n\r\nfor i in range(n-2,0,-2):\r\n print(((n-i)//2)*\"*\"+i*\"D\"+((n-i)//2)*\"*\")\r\n ", "#\r\n# \"main\"\r\n#\r\n# \" . . . \"\r\n# \r\n# # Created by Sergey Yaksanov at 29.09.2019\r\n# Copyright © 2019 Yakser. All rights reserved.\r\n\r\nn = int(input())\r\n\r\na = []\r\ns=''\r\ntemp = 1\r\nfor i in range(n - 1):\r\n if temp <= n:\r\n print((n-temp)//2 * '*' + \"D\"*temp + (n-temp)//2 * '*' )\r\n temp += 2\r\ntemp -= 4\r\nfor i in range(n - 1):\r\n if temp > 0:\r\n print((n-temp)//2 * '*' + \"D\"*temp + (n-temp)//2 * '*' )\r\n temp -= 2\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\nres = []\nfor p in range(n // 2, -n // 2, -1):\n p = abs(p)\n res.append(\"*\" * p + \"D\" * (n - 2 * p) + \"*\" * p)\nres = \"\\n\".join(res)\nprint(res)", "n=int(input())\r\nfor i in range(n//2):\r\n for j in range(n//2-i):\r\n print(\"*\",end='')\r\n for j in range(2*i+1):\r\n print(\"D\",end='')\r\n for j in range(n//2-i):\r\n print(\"*\",end='')\r\n print()\r\nfor i in range(n):\r\n print('D',end='')\r\nprint()\r\nfor i in range(n//2-1,-1,-1):\r\n for j in range(n//2-i):\r\n print(\"*\",end='')\r\n for j in range(2*i+1):\r\n print(\"D\",end='')\r\n for j in range(n//2-i):\r\n print(\"*\",end='')\r\n print()", "n = int (input ())\r\nvalue = 1\r\nfor i in range (n // 2 + 1):\r\n print ('*' * ((n - value) // 2) + 'D' * value + '*' * ((n - value) // 2))\r\n value += 2\r\nvalue -= 4\r\nfor i in range (n // 2):\r\n print ('*' * ((n - value) // 2) + 'D' * value + '*' * ((n - value) // 2))\r\n value -= 2", "n = int(input())\r\n\r\nfor i in range(n//2 +1):\r\n print(\"*\"*(n//2-i) + \"D\"*(n-2*(n//2-i)) + \"*\"*(n//2-i))\r\n\r\nfor i in range(n//2 -1, -1, -1):\r\n print(\"*\"*(n//2-i) + \"D\"*(n-2*(n//2-i)) + \"*\"*(n//2-i))\r\n", "# input the crystal of size n\r\nn = int(input())\r\n\r\n# create a reverse flag\r\nreverse=False\r\n# assign the value of 'D' to one\r\nDCnt=1\r\n\r\n# loop over range of n\r\nfor i in range(0,n):\r\n #calm down, the middle term gives the count of 'D' while side terms give the count of '*'\r\n print('*'*int((n-DCnt)/2)+ 'D'*DCnt +'*'*int((n-DCnt)/2))\r\n # check if we reached the middle part where we print only D\r\n if i==int(n/2):\r\n reverse=True\r\n # this results in plus 2 if reverse is false and -2 if reverse is true\r\n DCnt+=(2-4*reverse)" ]

[ "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef get_segment(s, t):\r\n s, t = s + l1, t + l1\r\n ans = []\r\n while s <= t:\r\n if s & 1:\r\n ans.append(s)\r\n s += 1\r\n s >>= 1\r\n if not t & 1:\r\n ans.append(t)\r\n t -= 1\r\n t >>= 1\r\n return ans\r\n\r\nn = int(input())\r\nl1 = pow(2, (n + 1).bit_length())\r\nl2 = 2 * l1\r\ns0 = [0] * (l2 + 1)\r\ns0[1], s0[2] = 0, 3 * l1\r\nfor i in range(2, l2):\r\n u = (s0[(i >> 1) + 1] - s0[i >> 1]) >> 1\r\n s0[i + 1] = s0[i] + u\r\nz = s0[l2]\r\ninf = pow(10, 9) + 1\r\na, b, s = [0] * z, [0] * z, [inf] * z\r\nfor i in range(1, n + 1):\r\n x1, x2, y1, a0, b0, y2 = map(int, input().split())\r\n j = s0[i + l1]\r\n a[j + 1] = a0\r\n b[j], b[j + 1], b[j + 2] = y1, b0, y2\r\n s[j], s[j + 1] = x1, x2\r\nfor i in range(l1 - 1, 0, -1):\r\n u, v, w = s0[2 * i], s0[2 * i + 1], s0[i]\r\n ru, rv = s0[2 * i + 1], s0[2 * i + 2]\r\n while u < ru or v < rv:\r\n a[w], b[w] = a[u] + a[v], b[u] + b[v]\r\n k = min(s[u], s[v])\r\n if s[u] == k:\r\n u += 1\r\n if s[v] == k:\r\n v += 1\r\n s[w] = k\r\n if k == inf:\r\n break\r\n w += 1\r\npow2 = [1]\r\nfor _ in range(20):\r\n pow2.append(2 * pow2[-1])\r\nm = int(input())\r\nans = [0] * m\r\nlast, mod = 0, pow(10, 9)\r\nfor i in range(m):\r\n l, r, x = map(int, input().split())\r\n x = (x + last) % mod\r\n seg = get_segment(l, r)\r\n ans0 = 0\r\n for j in seg:\r\n k, r0 = s0[j], s0[j + 1]\r\n c = (k - r0).bit_length()\r\n for u in range(c, -1, -1):\r\n if k + pow2[u] < r0 and s[k + pow2[u]] < x:\r\n k += pow2[u]\r\n if s[k] < x and k < r0:\r\n k += 1\r\n ans0 += a[k] * x + b[k]\r\n ans[i] = ans0\r\n last = ans0\r\nsys.stdout.write(\"\\n\".join(map(str, ans)))" ]

[ "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, t0 = map(int, input().split())\r\na = list(map(int, input().split()))\r\nt = list(map(int, input().split()))\r\nl = pow(10, 6) + 1\r\nc = [0] * l\r\ns = 0\r\nfor i, j in zip(a, t):\r\n c[j] += i\r\n s += (j - t0) * i\r\nans = sum(a)\r\nif s < 0:\r\n u, v, w = 1, l, 1\r\nelif s > 0:\r\n u, v, w = l - 1, 0, -1\r\nif s:\r\n s = abs(s)\r\n for i in range(u, v, w):\r\n ci = c[i]\r\n x = abs(i - t0)\r\n if s - ci * x > 0:\r\n s -= ci * x\r\n ans -= ci\r\n else:\r\n ans -= s / x\r\n break\r\nprint(ans)", "n,T = [int(i) for i in input().strip().split()]\r\na = [int(i) for i in input().strip().split()]\r\nt = [int(i) for i in input().strip().split()]\r\na,t = zip(*sorted(zip(a,t), key=lambda x:x[1]))\r\nif T>t[-1] or T<t[0]:\r\n print(0)\r\nelif T==t[-1]:\r\n val = 0\r\n for i in range(n-1,-1,-1):\r\n if t[i]==T:\r\n val+=a[i]\r\n else:\r\n break\r\n print(val)\r\nelif T==t[0]:\r\n val = 0\r\n for i in range(n):\r\n if t[i]==T:\r\n val+=a[i]\r\n else:\r\n break\r\n print(val)\r\nelse:\r\n lo = 0\r\n hi = sum(a)\r\n num = 0\r\n for i in range(n):\r\n num+=a[i]*t[i]\r\n denom = hi\r\n ans = None\r\n check = False\r\n if num/denom>=T:\r\n a = a[::-1]\r\n t = t[::-1]\r\n for i in range(n):\r\n num-=a[i]*t[i]\r\n denom-=a[i]\r\n if num==0:\r\n check = True\r\n if check or num/denom<T:\r\n ans = denom+((num-denom*T)/(T-t[i]))\r\n break\r\n else:\r\n for i in range(n):\r\n num-=a[i]*t[i]\r\n denom-=a[i]\r\n if num==0:\r\n check = True\r\n if check or num/denom>T:\r\n ans = denom+((num-denom*T)/(T-t[i]))\r\n break\r\n print(ans)", "R=lambda:list(map(int,input().split()))\nn,t=R()\na=R()\nb=R()\nx=[[t-b[i],a[i]] for i in range(n)]\nx.sort()\nc,v=sum(a),sum(i*j for i,j in x)\nif v:\n f=2*(v<0)-1\n for i in range(n)[::f]:\n if f*(v-x[i][1]*x[i][0])>=0:\n c-=v/x[i][0]\n break\n c-=x[i][1]\n v-=x[i][0]*x[i][1]\nprint(c)\n \t\t\t \t \t \t\t\t \t\t\t \t \t\t \t \t\t" ]

[ "n = int(input())\n\nelements = {}\nelements = dict(elements)\nfor i in range(n): \n a, b = map(int, input().split())\n elements[a] = b\nm = int(input())\nfor i in range(m): \n a, b = map(int, input().split())\n if elements.get(a): \n elements[a] = max(elements[a], b)\n else: \n elements[a] = b\nprint(sum(elements.values()))\n\n", "a = int(input())\nb = {}\nfor i in range(a):\n c = list(map(int, input().split()))\n b[c[0]] = c[1]\n\nn = int(input())\nm = {}\nfor i in range(n):\n c = list(map(int, input().split()))\n m[c[0]] = c[1]\n\nt = []\n\nfor item in b.keys():\n if m.get(item):\n t.append(max(b[item], m[item]))\n else:\n t.append(b[item])\n\nfor item in m.keys():\n if b.get(item):\n continue\n else:\n t.append(m[item])\n\nprint(sum(t))\n", "n=int(input())\r\nd1={}\r\nd2={}\r\nfor i in range(n):\r\n a1,x1=map(int,input().split())\r\n d1[a1]=x1\r\nm=int(input())\r\nfor i in range(m):\r\n b1,y1=map(int,input().split())\r\n d2[b1]=y1\r\np=sum(d1.values())+sum(d2.values())\r\nfor ai in d1.keys():\r\n if ai in d2.keys():\r\n p-=min(d1[ai],d2[ai])\r\nprint(p)", "from collections import defaultdict as d\r\ndef solve():\r\n n = int(input())\r\n mp = d(int)\r\n for i in range(n):\r\n a, x = map(int, input().split())\r\n mp[a] = x\r\n m = int(input())\r\n ans = 0\r\n for i in range(m):\r\n b, y = map(int, input().split())\r\n ans += max(mp[b], y)\r\n del mp[b]\r\n for i in mp.values():\r\n ans += i\r\n return ans\r\n\r\n\r\nt = 1\r\nwhile t != 0:\r\n res = solve()\r\n print(res)\r\n t -= 1\r\n", "\r\n\r\n\r\nn = int(input())\r\nd={}\r\nfor _ in range(n):\r\n a,b = map(int,input().split())\r\n d[a] = b\r\n\r\ns=0\r\nm = int(input())\r\nfor _ in range(m):\r\n x,y = map(int,input().split())\r\n\r\n if x in d:\r\n d[x] = max(d[x],y)\r\n\r\n else:\r\n d[x] = y\r\n\r\nfor i in d:\r\n\r\n s+=d[i]\r\nprint(s)\r\n\r\n", "memo = {}\r\n\r\nn = int(input())\r\nfor _ in range(n):\r\n a, x = map(int, input().split())\r\n memo[a] = x\r\n\r\nm = int(input())\r\nfor _ in range(m):\r\n b, x = map(int, input().split())\r\n if b in memo:\r\n memo[b] = max(memo[b], x)\r\n else:\r\n memo[b] = x\r\n\r\nprint(sum(memo.values()))", "n = int(input())\ndict = {}\nfor i in range(n):\n a , b = list(map(int,input().split()))\n dict[a] = b\nm = int(input())\nfor i in range(m):\n a , b = list(map(int,input().split()))\n if a in dict:\n dict[a] = max(dict[a],b)\n else:\n dict[a] = b\nans = 0\nfor i in dict:\n ans = ans+dict[i]\nprint(ans)", "b = {}\r\nfor i in range(int(input())):\r\n x, y = map(int, input().split())\r\n b[x] = y\r\nfor i in range(int(input())):\r\n x, y = map(int, input().split())\r\n if x in b:\r\n b[x] = max(b[x], y)\r\n else:\r\n b[x] = y\r\nans = 0\r\nfor key in b:\r\n ans += b[key]\r\nprint(ans)\r\n", "cost=0\r\nn=int(input())\r\nnn={}\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n nn[x]=y\r\n cost+=y\r\nm=int(input())\r\nmm={}\r\nfor i in range(m):\r\n x,y=map(int,input().split())\r\n mm[x]=y\r\n cost+=y\r\nsame=list( set(list(nn.keys())) & set(list(mm.keys())) )\r\nfor i in same:\r\n if nn[i] > mm[i] :\r\n cost-=mm[i]\r\n else:\r\n cost-=nn[i]\r\nprint(cost)\r\n\r\n\r\n\r\n", "n=int(input())\r\nd=dict()\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n d[x]=y\r\nm=int(input())\r\nfor i in range(m):\r\n x,y=map(int,input().split())\r\n if x in d:\r\n d[x]=max(y,d.get(x))\r\n else:\r\n d[x]=y\r\nprint(sum(d.values()))", "n=int(input())\r\nd={}\r\nfor _ in range(n):\r\n a,x=map(int,input().split())\r\n if a in d:\r\n d[a][0]+=1\r\n d[a][1].append(x)\r\n else:\r\n d[a]=[1,[x]]\r\n \r\n \r\nm=int(input())\r\nfor _ in range(m):\r\n a,x=map(int,input().split())\r\n if a in d:\r\n d[a][0]+=1\r\n d[a][1].append(x)\r\n else:\r\n d[a]=[1,[x]]\r\n \r\ns=0\r\nfor x in d:\r\n if d[x][0]==1:\r\n s+=d[x][1][0]\r\n else:\r\n s+=max(d[x][1])\r\nprint(s)", "n = int(input())\r\nchem = {}\r\nfor i in range(n):\r\n x, y = [*map(int,input().split())]\r\n if not x in chem:\r\n chem[x] = y\r\n else:\r\n chem[x] = max(chem[x], y)\r\nm = int(input())\r\nfor i in range(m):\r\n x, y = [*map(int,input().split())]\r\n if not x in chem:\r\n chem[x] = y\r\n else:\r\n chem[x] = max(chem[x], y)\r\nans = 0\r\nfor i in chem:\r\n ans += chem[i]\r\nprint(ans)\r\n\r\n\r\n\r\n", "# take risk at the edge of Accepted\r\n\r\nfrom math import *\r\n\r\n\r\ndef main():\r\n Map = {}\r\n\r\n n = int(input())\r\n for i in range(n):\r\n a, b = map(int, input().split())\r\n Map[a] = b\r\n\r\n m = int(input())\r\n for i in range(m):\r\n a, b = map(int, input().split())\r\n if a in Map:\r\n Map[a] = max(Map[a], b)\r\n else:\r\n Map[a] = b\r\n\r\n ans = 0\r\n for i in Map:\r\n ans += Map[i]\r\n print(ans)\r\n\r\ntry:\r\n while True:\r\n main()\r\nexcept EOFError:\r\n pass", "a={}\r\nfor i in range (int(input())):\r\n p,q = map(int,input().split())\r\n a[p]=q\r\n\r\nfor i in range(int(input())):\r\n p,q = map(int,input().split())\r\n\r\n if p in a and a[p]<q:\r\n a[p]=q\r\n elif p not in a:\r\n a[p]=q\r\n\r\nprint (sum(a.values()))\r\n", "n = int(input())\r\n\r\nsum1,sum2=0,0\r\na=dict()\r\n\r\nfor i in range(n):\r\n s = list(map(int, input().split()))\r\n a[s[0]] = s[1]\r\n sum1+=s[1]\r\n\r\nm = int(input())\r\nb = dict()\r\n\r\nfor i in range(m):\r\n s = list(map(int, input().split()))\r\n b[s[0]] = s[1]\r\n sum2 += s[1]\r\n\r\nc = set(a.keys()).intersection(set(b.keys()))\r\n\r\nfor i in c:\r\n if(a[i]>b[i]):\r\n sum2 -= b[i]\r\n else:\r\n sum1-=a[i]\r\n\r\nprint(sum1+sum2)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = {}\r\nfor _ in range(int(input())):\r\n a, b = map(int, input().split())\r\n if a not in s:\r\n s[a] = b\r\n else:\r\n if b > s[a]:\r\n s[a] = b\r\nfor _ in range(int(input())):\r\n a, b = map(int, input().split())\r\n if a not in s:\r\n s[a] = b\r\n else:\r\n if b > s[a]:\r\n s[a] = b\r\nprint(sum(s.values()))", "n = int(input())\r\nmydict = dict()\r\nfor i in range(n):\r\n key, value = [int(k) for k in input().split()]\r\n mydict[key] = value\r\n\r\nm = int(input())\r\nfor i in range(m):\r\n key, value = [int(k) for k in input().split()]\r\n if key in mydict:\r\n mydict[key] = max(mydict[key], value)\r\n else:\r\n mydict[key] = value\r\n\r\nprint(sum(mydict.values()))", "res = {}\n\nfor _ in range(2):\n n = int(input())\n for i in range(n):\n a, x = map(int, input().split(' '))\n res[a] = max(res.get(a, 0), x)\n\nprint(sum(res.values()))", "dic=dict()\r\nfor i in range(int(input())):\r\n tst=input().split()\r\n dic[tst[0]]=max(dic.get(tst[0],0),int(tst[1]))\r\nfor i in range(int(input())):\r\n tst=input().split()\r\n dic[tst[0]]=max(dic.get(tst[0],0),int(tst[1]))\r\nprint(sum(list(dic.values())))\r\n", "n=int(input())\npov=dict()\nslo=dict()\nfor i in range(n):\n a, b=map(int, input().split())\n slo[a] = b \nm=int(input())\nfor f in range(m):\n x, y=map(int, input().split())\n if x in slo:\n if y<=slo[x]:\n pov[x] = y\n else:\n del slo[x]\n slo[x] = y\n else:\n slo[x] = y \nsumm=0\nfor k in slo:\n kk = slo[k]\n summ+=kk\nprint(summ)\n# Thu Jul 07 2022 13:23:35 GMT+0000 (Coordinated Universal Time)\n", "n=int(input())\r\na={}\r\nb={}\r\nfor _ in range(n):\r\n ai,xi=map(int,input().split())\r\n a[ai]=xi\r\nm=int(input())\r\nfor _ in range(m):\r\n bj,yj=map(int,input().split())\r\n if bj in a.keys():\r\n if yj>=a[bj]:\r\n a[bj]=0\r\n else:\r\n yj=0\r\n b[bj]=yj\r\ns=0\r\ns=sum(a.values())+sum(b.values())\r\nprint(s)", "lst = []\nelements_ChemForces = int(input())\nfor i in range(elements_ChemForces):\n (a, x) = map(int, input().split(' '))\n lst.append([a, x])\n\nelements_TopChemist = int(input())\nfor j in range(elements_TopChemist):\n (b, x) = map(int, input().split(' '))\n lst.append([b, x])\nlst.sort()\nlst.append([0, 0])\nmax_income = 0\n\nk = 0\nwhile k < len(lst) - 1:\n if lst[k][0] == lst[k + 1][0]:\n max_income += max(lst[k][1], lst[k + 1][1])\n k += 1\n else:\n max_income += lst[k][1]\n k += 1\n\nprint(max_income)\n", "n=int(input())\r\na={}\r\nb={}\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n a[x]=y\r\nm=int(input())\r\nfor i in range(m):\r\n x,y=map(int,input().split())\r\n if x in a.keys():\r\n if y>=a[x]:\r\n a[x]=y\r\n else:\r\n a[x]=y\r\ns=0\r\ns=sum(a.values())\r\nprint(s)\r\n \r\n", "n = int(input())\r\na = dict()\r\nsum = 0\r\nfor i in range(n):\r\n t1, t2 = [int(i) for i in input().split()]\r\n a[t1] = t2\r\n sum += t2\r\nm = int(input())\r\nfor j in range(m):\r\n t1, t2 = [int(i) for i in input().split()]\r\n if a.get(t1) == None:\r\n sum += t2\r\n else:\r\n if a[t1] < t2:\r\n sum = sum - a[t1] + t2\r\nprint(sum)", "n = int(input())\r\nprices = {}\r\ntotal = 0\r\n\r\nfor i in range(n):\r\n a, x = tuple(map(int, input().split()))\r\n prices[a] = x\r\n total += x\r\n\r\nm = int(input())\r\nfor j in range(m):\r\n b, y = tuple(map(int, input().split()))\r\n if b in prices and prices[b] < y:\r\n total -= prices[b]\r\n total += y\r\n elif b not in prices:\r\n total += y\r\n\r\nprint(total)", "n = int(input())\r\nd = {}\r\n\r\nans = 0\r\nfor i in range(n):\r\n curr,cost =map(int, input().split())\r\n if d.get(curr) is None:\r\n d[curr] = cost\r\n d[curr] = max(d[curr], cost)\r\n\r\nm = int(input())\r\nfor i in range(m):\r\n curr,cost =map(int, input().split())\r\n if d.get(curr) is None:\r\n d[curr] = cost\r\n d[curr] = max(d[curr], cost)\r\n\r\nfor el in d.values():\r\n ans +=el\r\n\r\nprint(ans)\r\n", "n = int(input())\r\nelements1 = {}\r\nprices = []\r\nfor i in range(n):\r\n data = input().split(' ')\r\n elements1[int(data[0])] = int(data[1])\r\n\r\nm = int(input())\r\nsum = 0\r\nelements2 = set()\r\nfor i in range(m):\r\n data = input().split(' ')\r\n e = int(data[0])\r\n p = int(data[1])\r\n elements2.add(e)\r\n if e in elements1:\r\n sum += max(elements1[e], p)\r\n else:\r\n sum += p\r\n\r\nfor e in elements1:\r\n if not e in elements2:\r\n sum += elements1[e]\r\n\r\nprint(sum)\r\n", "dic = dict()\nn = int(input())\nfor i in range(n):\n\ttmp = input().split()\n\tdic[tmp[0]] = int(tmp[1])\nm = int(input())\nfor j in range(m):\n\ttmp = input().split()\n\tif tmp[0] not in dic:\n\t\tdic[tmp[0]] = int(tmp[1])\n\telse:\n\t\tif dic[tmp[0]] < int(tmp[1]):\n\t\t\tdic[tmp[0]] = int(tmp[1])\nsum = 0\nfor k in dic:\n\tsum = sum + dic[k]\nprint(sum)", "n = int(input())\r\ndic = {}\r\nfor i in range(n):\r\n a = input().split()\r\n dic[int(a[0])]=int(a[1])\r\n\r\nm = int(input())\r\nfor j in range(m):\r\n b = input().split()\r\n if int(b[0]) in dic.keys():\r\n dic[int(b[0])]=max(dic[int(b[0])], int(b[1]))\r\n else:\r\n dic[int(b[0])] = int(b[1])\r\n\r\nprint(sum(dic.values()))", "n=int(input())\r\nfrom collections import defaultdict\r\na=defaultdict(list)\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n a[x].append(y)\r\nm=int(input())\r\nfor i in range(m):\r\n x,y=map(int,input().split())\r\n a[x].append(y)\r\nans=0\r\nfor i in a:\r\n ans+=max(a[i])\r\nprint(ans)\r\n", "from collections import defaultdict as dd\r\ndef solve():\r\n C = dd(int)\r\n N = int(input())\r\n for n in range(N):\r\n k,v = map(int, input().split())\r\n C[k] = v\r\n\r\n M = int(input())\r\n for m in range(M):\r\n k,v = map(int, input().split())\r\n C[k] = max(v, C[k])\r\n\r\n print(sum(C.values()))\r\n\r\nif __name__ == \"__main__\":\r\n try:\r\n local_input()\r\n except:\r\n pass\r\n solve()\r\n", "def BusinessmenProblems(uniqueSet,chemForcses,topChemist):\r\n\ttotalIncome=0\r\n\tfor s in uniqueSet:\r\n\t\tx = 0\r\n\t\ty = 0\r\n\t\tif s in chemForcses:\r\n\t\t\tx = chemForcses[s]\r\n\t\tif s in topChemist:\r\n\t\t\ty = topChemist[s]\r\n\r\n\t\tif x>y:\r\n\t\t\ttotalIncome+=x\r\n\t\telse:\r\n\t\t\ttotalIncome+=y\r\n\r\n\treturn totalIncome\r\n\r\nn = int(input())\r\nuniqueSet=set()\r\nchemForcses = {}\r\ni=0\r\nwhile i<n:\r\n\ta,x = [int(l) for l in input().split()]\r\n\tuniqueSet.add(a)\r\n\tchemForcses[a] = x\r\n\ti+=1\r\n\r\nm = int(input())\r\ntopChemist = {}\r\ni=0\r\nwhile i<m:\r\n\ta,x = [int(l) for l in input().split()]\r\n\tuniqueSet.add(a)\r\n\ttopChemist[a] = x\r\n\ti+=1\r\n\r\nprint(BusinessmenProblems(uniqueSet,chemForcses,topChemist))\r\n\r\n", "sl1=input()\r\nnt1={}\r\nfor i in range(int(sl1)):\r\n x,y=input().split()\r\n nt1[x]=y\r\nsl2=input()\r\nnt2={}\r\nfor i in range(int(sl2)):\r\n x,y=input().split()\r\n nt2[x]=y\r\nrs=0\r\nfor x in nt1:\r\n if x in nt2 and int(nt2[x])>int(nt1[x]):\r\n rs+=int(nt2[x])\r\n else:\r\n rs+=int(nt1[x])\r\nfor x in nt2:\r\n if not x in nt1:\r\n rs+=int(nt2[x])\r\nprint(rs)", "#!/usr/bin/env python3\n\nn = int(input().strip())\na = [tuple(map(int, input().strip().split())) for _ in range(n)]\nm = int(input().strip())\na.extend(tuple(map(int, input().strip().split())) for _ in range(m))\n\na.sort()\na.append((0, 0))\nres = 0\ni = 0\nwhile i < n + m:\n\tif a[i][0] == a[i + 1][0]:\n\t\tres += max(a[i][1], a[i + 1][1])\n\t\ti += 2\n\telse:\n\t\tres += a[i][1]\n\t\ti += 1\n\n\nprint (res)\n", "n = int(input())\r\nd = {}\r\ns = 0\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n try:\r\n if d[a] < b:\r\n s -= d[a]\r\n d[a] = b\r\n s += b\r\n except:\r\n d[a] = b\r\n s += b\r\nm = int(input())\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n try:\r\n if d[a] < b:\r\n s -= d[a]\r\n d[a] = b\r\n s += b\r\n except:\r\n d[a] = b\r\n s += b\r\nprint(s)\r\n", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n\ta.append([])\r\nfor i in range(n):\r\n\tai,xi=map(int,input().split())\r\n\ta[i].append(ai)\r\n\ta[i].append(xi)\r\nb=[]\r\nm=int(input())\r\nfor i in range(m):\r\n\tb.append([])\r\nfor i in range(m):\r\n\tbi,yi=map(int,input().split())\r\n\tb[i].append(bi)\r\n\tb[i].append(yi)\r\na=sorted(a)\r\nb=sorted(b)\r\ncommon1=[]\r\ncommon2=[]\r\nother=[]\r\ni=0\r\nj=0\r\nwhile i<n and j<m:\r\n\tif(a[i][0]==b[j][0]):\r\n\t\tcommon1.append(a[i])\r\n\t\tcommon2.append(b[j])\r\n\t\ti+=1\r\n\t\tj+=1\r\n\telif a[i][0]>b[j][0]:\r\n\t\tother.append(b[j])\r\n\t\tj+=1\r\n\telse:\r\n\t\tother.append(a[i])\r\n\t\ti+=1\r\nwhile i<n:\r\n\tother.append(a[i])\r\n\ti+=1\r\nwhile(j<m):\r\n\tother.append(b[j])\r\n\tj+=1\r\n#print(other)\r\nans=0\r\nfor i in range(len(other)):\r\n\tans+=other[i][1]\r\n\t#print(other[i][1])\r\n#print(ans)\r\nfor i in range(len(common1)):\r\n\tif common1[i][1]>common2[i][1]:\r\n\t\t#print(common1[i][1])\r\n\t\tans+=common1[i][1]\r\n\telse:\r\n\t\t#print(common2[i][1])\r\n\t\tans+=common2[i][1]\r\nprint(ans)", "# your code goes here\r\nn = int(input())\r\npair_n = []\r\nfor i in range(n):\r\n\telement = list(map(int,input().split()))\r\n\tpair_n.append(element)\r\n\r\nm = int(input())\r\npair_m = []\r\nfor i in range(m):\r\n\telement = list(map(int,input().split()))\r\n\tpair_m.append(element)\r\n\r\npair_n , pair_m = sorted(pair_n),sorted(pair_m)\r\n\r\nN,M = 0,0\r\nans = 0\r\nwhile N != n or M != m:\r\n\tif N==n:\r\n\t\tans += pair_m[M][1]\r\n\t\tM += 1\r\n\telif M==m:\r\n\t\tans += pair_n[N][1]\r\n\t\tN += 1\r\n\telif pair_n[N][0] < pair_m[M][0]:\r\n\t\tans += pair_n[N][1]\r\n\t\tN += 1\r\n\telif pair_n[N][0] > pair_m[M][0]:\r\n\t\tans += pair_m[M][1]\r\n\t\tM += 1\r\n\telse:\r\n\t\tans += max(pair_n[N][1],pair_m[M][1])\r\n\t\tN += 1\r\n\t\tM += 1\r\n\r\nprint(ans)\r\n\t", "#!/usr/bin/python3\r\n#Businessmen Problems\r\nans={}\r\nfor _ in range(int(input())):\r\n a,b=map(int,input().split())\r\n ans[a]=b\r\nfor _ in range(int(input())):\r\n a,b=map(int,input().split())\r\n if a in ans:\r\n ans[a]=max(ans[a],b)\r\n else:\r\n ans[a]=b\r\nprint(sum(ans.values()))\r\n", "n=int(input())\r\na=[];b=[]\r\nfor i in range(n):\r\n a.append(list(map(int,input().split())))\r\nm=int(input())\r\nfor i in range(m):\r\n b.append(list(map(int,input().split())))\r\ni=j=0\r\na=sorted(a)\r\nb=sorted(b)\r\nans=0\r\nwhile(i<n and j<m):\r\n if(a[i][0]<b[j][0]):\r\n ans+=a[i][1]\r\n i+=1\r\n elif(a[i][0]>b[j][0]):\r\n ans+=b[j][1]\r\n j+=1\r\n else:\r\n ans+=max(a[i][1],b[j][1])\r\n i+=1\r\n j+=1\r\nwhile(i<n):\r\n ans+=a[i][1]\r\n i+=1\r\nwhile(j<m):\r\n ans+=b[j][1]\r\n j+=1\r\nprint(ans)", "na = int(input())\r\na = {}\r\n\r\nfor i in range(na):\r\n x, y = input().split()\r\n a[int(x)] = int(y)\r\n\r\nnb = int(input())\r\nb = {}\r\n\r\nfor i in range(nb):\r\n x, y = input().split()\r\n b[int(x)] = int(y)\r\n\r\nt = 0\r\nfor k,v in a.items():\r\n if(k in b):\r\n t += max([b[k], v])\r\n else:\r\n t += v\r\n \r\nfor k,v in b.items():\r\n if(not k in a):\r\n t += v\r\n\r\nprint(t)", "n = int(input())\nelements = {}\n\nfor _ in range(n):\n ai, xi = map(int, input().split())\n elements[ai] = max(elements.get(ai, 0), xi)\n\nm = int(input())\n\nfor _ in range(m):\n bj, yj = map(int, input().split())\n elements[bj] = max(elements.get(bj, 0), yj)\ntotal_profit = sum(elements.values())\nprint(total_profit)\n# Tue Jul 11 2023 10:35:58 GMT+0300 (Moscow Standard Time)\n", "import collections\r\n\r\nd = collections.defaultdict(int)\r\nfor x in range(int(input())):\r\n a, b = list(map(int, input().split()))\r\n d[a] = b\r\nfor x in range(int(input())):\r\n a, b = list(map(int, input().split()))\r\n if d[a]<b:\r\n d[a]=b\r\nprint(sum(d.values()))", "from array import array\ndatabase = {}\nresult = 0\n\n\nn = int(input())\ni = 0\nwhile i < n:\n i += 1\n [a, x] = [int(x) for x in input().split()]\n result += x\n database[a] = x\n\nm = int(input())\ni = 0\nwhile i < m:\n i += 1\n [b, y] = [int(x) for x in input().split()]\n x = database.get(b, 0)\n if x < y:\n result += y - x\n\nprint(result)\n", "d = {}\r\nn = int(input())\r\nfor _ in range(n):\r\n\ta,x = map(int,input().split())\r\n\td[a] = x\r\nm = int(input())\r\nfor _ in range(m):\r\n\tb,y = map(int,input().split())\r\n\tif b in d:\r\n\t\td[b] = max(y,d[b])\r\n\telse:\r\n\t\td[b] = y\r\ncount = 0\r\nfor i in d:\r\n\tcount += d[i]\r\nprint(count)", "n = int(input())\r\nd = {}\r\nfor i in range(n):\r\n a,b = map(int,input().split())\r\n d[a] = b\r\nm = int(input())\r\nfor i in range(m):\r\n a,b = map(int,input().split())\r\n if d.get(a)==None:\r\n d[a] = b\r\n else:\r\n if b>d[a]:\r\n d[a] = b\r\nans = 0\r\nfor i in d:\r\n ans+=d[i]\r\nprint(ans)\r\n", "n = int(input())\ndic = {}\n\ns = 0\nfor i in range(n):\n [x, y] = list(map(int, input().split(\" \")))\n dic[x] = y\n s+=y\n\nm = int(input())\nfor i in range(m):\n [x, y] = list(map(int, input().split(\" \")))\n if(x in dic):\n if(dic[x]<y):\n s -= dic[x]\n s+=y\n else:\n s+=y\n\nprint(s)\n \t \t\t \t \t\t\t\t \t \t \t \t\t\t \t", "def prog():\r\n from sys import stdin\r\n n = int(stdin.readline())\r\n di = {}\r\n res = 0\r\n for i in range(n):\r\n a,x = map(int,stdin.readline().split())\r\n di[a]=x\r\n res+=x\r\n m = int(stdin.readline())\r\n for i in range(m):\r\n b,y = map(int,stdin.readline().split())\r\n res+=y\r\n if di.get(b)!=None:\r\n res-=min(y,di[b])\r\n print(res)\r\nprog()", "d={}\r\nfor _ in range(int(input())):\r\n a,b=map(int,input().split())\r\n d[a]=b\r\nfor _ in range(int(input())):\r\n a,b=map(int,input().split())\r\n if a in d.keys():\r\n if d[a]<b:\r\n d[a]=b\r\n else:\r\n d[a]=b\r\nprint(sum(d.values()))\r\n", "valueSum = 0\nused = {}\n\naNumElements = int(input())\nfor x in range(aNumElements):\n line = input()\n elem = int(line.split(' ')[0])\n price = int(line.split(' ')[1])\n valueSum += price\n used[elem] = price\n\nbNumElements = int(input())\nfor y in range(bNumElements):\n line = input()\n elem = int(line.split(' ')[0])\n price = int(line.split(' ')[1])\n if elem in used:\n if used[elem] < price:\n valueSum += price - used[elem]\n else:\n valueSum += price\n\nprint(valueSum)\n", "import sys\r\n\r\nn = int(sys.stdin.readline())\r\nd = []\r\nfor i in range(n):\r\n a = list(map(int, sys.stdin.readline().split()))\r\n d.append(a)\r\no = int(sys.stdin.readline())\r\nfor i in range(o):\r\n a = list(map(int, sys.stdin.readline().split()))\r\n d.append(a)\r\nd.sort()\r\nsum = 0\r\nfor i in range(n+o):\r\n if i == 0:\r\n sum += d[i][1]\r\n elif d[i][0] == d[i-1][0]:\r\n sum += d[i][1]-d[i-1][1]\r\n else:\r\n sum += d[i][1]\r\nprint(sum)", "import math\r\n\r\n\r\ndef binary_search(l, b_y):\r\n a = l[0]\r\n start = 0\r\n end = len(b_y) - 1\r\n while True:\r\n if start == end:\r\n if a == b_y[start][0]:\r\n return min(b_y[m][1], l[1])\r\n return -1\r\n else:\r\n m = math.ceil((start + end) / 2)\r\n if a == b_y[m][0]:\r\n return min(b_y[m][1], l[1])\r\n else:\r\n if a > b_y[m][0]:\r\n start = m\r\n else:\r\n end = m - 1\r\n\r\n\r\ndef main_function():\r\n n = int(input())\r\n dict = {}\r\n for i in range(n):\r\n a, x = [int(i) for i in input().split(\" \")]\r\n dict[a] = x\r\n m = int(input())\r\n for i in range(m):\r\n b, y = [int(i) for i in input().split(\" \")]\r\n if not b in dict:\r\n dict[b] = y\r\n else:\r\n if dict[b] < y:\r\n dict[b] = y\r\n sums = 0\r\n for i in dict:\r\n sums += dict[i]\r\n print(sums)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Apr 6 19:33:10 2020\r\n\r\n@author: alexi\r\n\"\"\"\r\n\r\n\r\n\r\n#https://codeforces.com/problemset/problem/981/B\r\n\r\n\r\ndef business_men():\r\n \r\n teamA = int(input())\r\n teamA_days = []\r\n teamA_dic = {}\r\n \r\n for i in range(teamA):\r\n teamA_days.append(list(map(int, input().split())))\r\n teamA_dic[teamA_days[i][0]] = teamA_days[i][1]\r\n \r\n teamB = int(input())\r\n teamB_days = []\r\n teamB_dic = {}\r\n \r\n for i in range(teamB):\r\n teamB_days.append(list(map(int, input().split())))\r\n teamB_dic[teamB_days[i][0]] = teamB_days[i][1]\r\n \r\n output = 0\r\n checked = {}\r\n for i in range(len(teamA_days)):\r\n if teamA_days[i][0] in teamB_dic:\r\n maximum = max(teamA_dic[teamA_days[i][0]],teamB_dic[teamA_days[i][0]])\r\n output += maximum\r\n teamA_dic.pop(teamA_days[i][0])\r\n teamB_dic.pop(teamA_days[i][0])\r\n checked[teamA_days[i][0]] = 1\r\n else:\r\n output += teamA_days[i][1]\r\n \r\n for i in range(len(teamB_days)):\r\n if teamB_days[i][0] not in checked:\r\n output += teamB_days[i][1]\r\n \r\n return output\r\n\r\nA = business_men()\r\nprint(A)\r\n \r\n ", "\nInput=lambda:map(int,input().split())\n\nTmp = dict()\nn = int(input())\nfor i in range(n):\n a ,x = Input()\n Tmp[a] = x\nans = 0\nm = int(input())\nfor i in range(m):\n b, x = Input()\n if Tmp.get(b,-1) == -1:\n Tmp[b] = x\n else:\n ans+= max(Tmp[b],x)\n Tmp[b] = 0\nfor i in Tmp.values():\n ans+=i\nprint(ans)\n\n\n\n", "n=int(input())\r\nd={}\r\nfor _ in range(n):\r\n a,x=map(int, input().split())\r\n d[a]=x\r\nm=int(input())\r\nfor _ in range(m):\r\n b,y=map(int, input().split())\r\n d[b]=max(y, d.get(b,0))\r\nprint(sum(d.values()))\r\n \r\n", "#ZadB\r\nans={}\r\nn=int(input())\r\nfor i in range(n):\r\n f=list(map(int,input().split()))\r\n if f[0] in ans:\r\n if f[1]>ans[f[0]]: ans[f[0]]=f[1]\r\n else:\r\n ans[f[0]]=f[1]\r\nn=int(input())\r\nfor i in range(n):\r\n f=list(map(int,input().split()))\r\n if f[0] in ans:\r\n if f[1]>ans[f[0]]: ans[f[0]]=f[1]\r\n else:\r\n ans[f[0]]=f[1]\r\nprint(sum(n for n in ans.values()))", "cnt=lambda s,i:s.count(i)\r\nii=lambda:int(input())\r\nsi=lambda:input()\r\nf=lambda:map(int,input().split())\r\nil=lambda:list(map(int,input().split()))\r\nn=ii()\r\np=0\r\nd={}\r\nfor i in range(n):\r\n a,b=f()\r\n d[a]=b\r\nm=ii()\r\nfor i in range(m):\r\n a,b=f()\r\n d[a]=max(d.get(a,0),b)\r\nprint(sum(d.values()))", "d = {}\r\nn = int(input())\r\nfor i in range(n):\r\n j, k = list(map(int, input().split()))\r\n d[j] = k\r\n\r\nm = int(input())\r\nfor i in range(m):\r\n j, k = list(map(int, input().split()))\r\n if j in d:\r\n d[j] = max(d[j], k)\r\n else:\r\n d[j] = k\r\n\r\nss = 0\r\nfor i, v in d.items():\r\n # print(i, v)\r\n ss += v\r\nprint(ss)", "n = int(input())\r\ndic = {}\r\nfor i in range(n):\r\n key,value = map(int,input().split())\r\n dic[key] = value\r\nm=int(input())\r\nfor i in range(m):\r\n key,value = map(int,input().split())\r\n if key in dic.keys():\r\n dic[key] = max(dic[key],value)\r\n else:\r\n dic[key] = value\r\ns=0\r\nfor val in dic.keys():\r\n # print(dic[val])\r\n s+=dic[val]\r\nprint(s)", "n=int(input())\r\nk={}\r\nsu=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n k[a]=b\r\nm=int(input())\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n if k.get(a)==None:\r\n k[a]=b\r\n else:\r\n if k[a]<b:\r\n k[a]=b\r\nprint(sum(k.values()))\r\n", "# // \"Author : Chinmay Jha\r\n# // @chinmayajha on Codeforces, Codechef, AtCoder, USACO, CSES.fi\r\n# // \r\n# // Problem: B. Businessmen Problems\r\n# // Contest: Codeforces - Avito Code Challenge 2018\r\n# // URL: https://codeforces.com/problemset/problem/981/B\r\n# // Date / Time: 15-04-2021 20:39:59\"\r\n# \r\nimport math\r\nfrom math import gcd,floor,sqrt,log\r\ndef iin(): return int(input())\r\ndef sin(): return input().strip()\r\ndef listin(): return list(map(int,input().strip().split()))\r\ndef liststr(): return list(map(str,input().strip().split()))\r\ndef ceill(x): return int(x) if(x==int(x)) else int(x)+1\r\ndef ceilldiv(x,d): x//d if(x%d==0) else x//d+1\r\ndef LCM(a,b): return (a*b)//gcd(a,b)\r\n\r\n\r\ndef solve():\r\n\tn = iin()\r\n\tcf = dict()\r\n\ttc = dict()\r\n\tfor i in range(n):\r\n\t\tz = listin()\r\n\t\tcf[z[0]] = z[1]\r\n\tm = iin()\t\r\n\tfor i in range(m):\r\n\t\tz = listin()\r\n\t\ttc[z[0]] = z[1]\r\n\t# print(cf)\r\n\t# print(tc)\r\n\tsett = set(list(cf.keys()) + list(tc.keys()))\r\n\t# print(sett)\r\n\tsumm = 0\r\n\tfor i in sett:\r\n\t\ttemp = 0\r\n\t\ttry:\r\n\t\t\ttemp = max(tc[i],cf[i])\r\n\t\texcept:\r\n\t\t\ttry:\r\n\t\t\t\ttemp = cf[i]\r\n\t\t\texcept:\r\n\t\t\t\ttemp = tc[i]\r\n\t\tsumm += temp\r\n\tprint(summ)\r\n\t\t\r\n\r\n\r\n\r\n\r\n\r\nt = 1 \r\n# t = int(input()) \r\nfor hula in range(t):\r\n\tsolve()\r\n\r\n\r\n", "n = int(input())\r\nA = {}\r\nans = 0\r\nfor i in range(n):\r\n\ta, b = input().split()\r\n\ta, b = [int(a), int(b)]\r\n\tA[a] = b\r\n\tans = ans + b\r\nm = int(input())\r\nfor i in range(m):\r\n\ta, b = input().split()\r\n\ta, b = [int(a), int(b)]\r\n\tif A.get(a)!=None:\r\n\t\tans -= A[a]\r\n\t\tans += max(A[a], b)\r\n\telse:\r\n\t\tans += b;\r\nprint(ans)", "n = int(input())\ndict = {}\nfor i in range(n):\n a , b = list(map(int,input().split()))\n dict[a] = b\nm = int(input())\nfor i in range(m):\n a , b = list(map(int,input().split()))\n dict[a] = max(dict[a],b) if a in dict else b\nprint(sum([dict[i] for i in dict]))", "n=int(input())\r\nd={}\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n d[a]=b \r\nm=int(input())\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n if a in d.keys():\r\n d[a]=max(d[a],b)\r\n else:\r\n d[a]=b \r\nprint(sum(d.values()))", "n = int(input())\r\na = [[int(x) for x in input().split()] for i in range(0,n)]\r\nm = int(input())\r\nb = [[int(x) for x in input().split()] for i in range(0,m)]\r\na = sorted(a, key=lambda x:x[0])\r\nb = sorted(b, key=lambda x:x[0]) \r\ns = 0\r\ni = 0\r\nj = 0\r\nwhile i < n and j < m:\r\n if a[i][0] < b[j][0]:\r\n s = s + a[i][1]\r\n i+=1\r\n elif a[i][0] > b[j][0]:\r\n s = s + b[j][1]\r\n j+=1\r\n else:\r\n s = s + max(a[i][1],b[j][1])\r\n i+=1\r\n j+=1\r\nif i == n:\r\n for k in range(j,m):\r\n s = s + b[k][1]\r\nelse:\r\n for p in range(i,n):\r\n s = s + a[p][1]\r\nprint(s)", "def makeDict(n):\r\n x = {}\r\n while n > 0:\r\n name, price = input().split()\r\n x[name] = int(price)\r\n n -= 1\r\n return x\r\nchem = int(input())\r\nchemForces= makeDict(chem)\r\ntopch = int(input())\r\ntopChemist = makeDict(topch)\r\n\r\ns = 0\r\nfor key, value in chemForces.items():\r\n if key in topChemist.keys():\r\n if value > topChemist[key]:\r\n topChemist[key] = 0\r\n s += value\r\n else:\r\n s += value\r\n\r\ns += sum(topChemist.values())\r\nprint(s)", "# import logging\n\n\n# fmt = '%(levelname)s - %(name)s (line:%(lineno)s) - %(message)s'\n# formatter = logging.Formatter(fmt)\n\n# ch = logging.StreamHandler()\n# ch.setLevel(logging.ERROR)\n# ch.setFormatter(formatter)\n\n# logger = logging.getLogger('businessmen_problems')\n# logger.setLevel(logging.ERROR)\n# logger.addHandler(ch)\n\n\ndef main():\n dct = {}\n\n n = int(input().strip())\n for _ in range(n):\n a, x = map(int, input().strip().split())\n dct[a] = x\n\n m = int(input().strip())\n for _ in range(m):\n b, y = map(int, input().strip().split())\n if b not in dct or (b in dct and y > dct[b]):\n dct[b] = y\n \n result = sum(v for v in dct.values())\n print(result)\n \n\nif __name__ == '__main__':\n main()\n", "n = int(input())\r\ndic1 = dict()\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n dic1[a] = b\r\nn = int(input())\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n if a in dic1:\r\n if b > dic1[a]:\r\n dic1[a] = b\r\n else:\r\n dic1[a] = b\r\nsum = 0\r\nfor i in dic1:\r\n sum += dic1[i]\r\nprint(sum)\r\n", "from sys import stdin\r\n\r\nall_in = stdin.read().splitlines()\r\n\r\nn = int(all_in[0])\r\n\r\na, x = list(), list()\r\nfor el in all_in[1: n + 1]:\r\n a_, x_ = map(int, el.split())\r\n\r\n a.append(a_)\r\n x.append(x_)\r\n\r\nm = int(all_in[n + 1])\r\n\r\nb, y = list(), list()\r\nfor el in all_in[n + 2: m + n + 2]:\r\n b_, y_ = map(int, el.split())\r\n\r\n b.append(b_)\r\n y.append(y_)\r\n\r\ns_a = set(a)\r\ns_b = set(b)\r\n\r\nand_ = s_a & s_b\r\n\r\nfirst = {a[i]: x[i] for i in range(n)}\r\nsecond = {b[j]: y[j] for j in range(m)}\r\n\r\nans = 0\r\n\r\nfor el in s_a | s_b:\r\n if el in and_:\r\n ans += max(first[el], second[el])\r\n\r\n elif el in s_a:\r\n ans += first[el]\r\n\r\n elif el in s_b:\r\n ans += second[el]\r\n\r\n else:\r\n exit(100500)\r\n\r\nprint(ans)\r\n", "n = int(input())\nans = {}\nfor i in range(n):\n a, x = map(int, input().split())\n if a not in ans:\n ans[a] = set()\n ans[a].add(x)\nm = int(input())\nfor i in range(m):\n a, x = map(int, input().split())\n if a not in ans:\n ans[a] = set()\n ans[a].add(x)\ncnt = 0\nfor j in ans:\n cnt += max(ans[j])\nprint(cnt)", "d1 = dict(map(int, input().split()) for i in range(int(input())))\r\nfor j in range(int(input())):\r\n key, value = map(int, input().split())\r\n if key in d1:\r\n if value < d1[key]:\r\n continue\r\n d1[key] = value\r\n\r\nprint(sum(d1.values()))", "from collections import defaultdict\r\nn=int(input())\r\na=defaultdict(int)\r\nfor i in range(n):\r\n x = list(map(int, input().split(\" \")))\r\n a[x[0]]=x[1]\r\nm=int(input())\r\nfor i in range(m):\r\n x = list(map(int, input().split(\" \")))\r\n if x[0] in a.keys():\r\n if a[x[0]]<x[1]:a[x[0]]=x[1]\r\n else:a[x[0]]=x[1]\r\nprint(sum(a.values()))", "d = dict()\r\nn = int(input())\r\nfor _ in range(n):\r\n element, price = list(map(int, input().split()))\r\n d[element] = price\r\n\r\nm = int(input())\r\nfor _ in range(m):\r\n element, price = map(int, input().split())\r\n if element in d:\r\n d[element] = max(d[element], price)\r\n else:\r\n d[element] = price\r\n\r\nprint(sum(d.values()))\r\n", "a_m = {}\r\n\r\nret = 0\r\nn = int(input())\r\nfor i in range(n):\r\n a, v = list(map(int, input().strip().split()))\r\n a_m[a] = v\r\n ret += v\r\n\r\nm = int(input())\r\nfor j in range(m):\r\n b, v = list(map(int, input().split()))\r\n if b in a_m:\r\n if v > a_m[b]:\r\n ret += v-a_m[b]\r\n else:\r\n ret += v\r\n\r\nprint(ret)", "if __name__ == '__main__':\r\n\tn = int(input())\r\n\tcf = {}\r\n\ttc = {}\r\n\ts = set()\r\n\tans = 0\r\n\tfor i in range (n):\r\n\t\ta,b = map(int, input().split()) \r\n\t\tcf[a]=b\r\n\t\ts.add(a)\r\n\tm = int(input())\r\n\tfor i in range (m):\r\n\t\ta,b = map(int, input().split()) \r\n\t\tif a in s:\r\n\t\t\tif cf[a] > b:\r\n\t\t\t\tans+=cf[a]\r\n\t\t\telse:\r\n\t\t\t\tans+=b\r\n\t\t\ts.remove(a)\r\n\t\telse:\r\n\t\t\ttc[a] = b\r\n\tfor i in s :\r\n\t\tans+=cf[i]\r\n\tfor q,v in tc.items():\r\n\t\tans+=v\r\n\tprint(ans)\r\n", "n=int(input())\r\ncount=0\r\ns1=dict()\r\nfor x in range(n):\r\n a=input().split()\r\n s1[int(a[0])]=int(a[1])\r\nm=int(input())\r\nfor x in range(m):\r\n a=input().split()\r\n if int(a[0]) in s1.keys():\r\n if int(a[1])>s1[int(a[0])]:\r\n count+=int(a[1])\r\n else:\r\n count+=s1[int(a[0])]\r\n del s1[int(a[0])]\r\n else:\r\n count+=int(a[1])\r\nfor i in s1.values():\r\n count+=i\r\nprint(count)", "import sys\r\nimport math\r\n\r\n#to read string\r\nget_string = lambda: sys.stdin.readline().strip()\r\n#to read list of integers\r\nget_int_list = lambda: list( map(int,sys.stdin.readline().strip().split()) )\r\n#to read integers\r\nget_int = lambda: int(sys.stdin.readline())\r\n#to print fast\r\n#pt = lambda x: sys.stdout.write(str(x)+'\\n')\r\n\r\n#--------------------------------WhiteHat010--------------------------------------#\r\ncf = {}\r\ntc = {}\r\n\r\nn = get_int()\r\nfor i in range(n):\r\n a,b = get_int_list()\r\n cf[a] = b\r\nn = get_int()\r\nfor i in range(n):\r\n a,b = get_int_list()\r\n tc[a] = b\r\ns = set(cf.keys()).union(set(tc.keys()))\r\ntotal = 0\r\nfor i in s:\r\n if i in cf and i in tc:\r\n if cf[i] > tc[i]:\r\n total += cf[i]\r\n else:\r\n total += tc[i]\r\n else:\r\n if i in cf:\r\n total += cf[i]\r\n else:\r\n total += tc[i]\r\nprint(total)", "n = int(input())\ndicta = {}\ndictb = {}\nfor i in range(n):\n a, x = map(int, input().split())\n dicta[a] = x\nm = int(input())\nfor i in range(m):\n b, y = map(int, input().split())\n dictb[b] = y\nans = 0\nfor i in dicta.keys():\n if i in dictb.keys():\n ans += max(dicta[i], dictb[i])\n del dictb[i]\n else :\n ans += dicta[i]\nfor i in dictb.values():\n ans += i\nprint(ans)\n", "# 981B\r\nn = int(input())\r\nadict = {}\r\nfor _ in range(n):\r\n p, q =map(int, input().split())\r\n adict.update({p:q})\r\nm = int(input())\r\nfor qw in range(m):\r\n r, s = map(int, input().split())\r\n if r in adict:\r\n adict.update({r:max(adict[r],s)})\r\n else:\r\n adict.update({r:s})\r\n\r\nprint(sum(adict.values()))\r\n\r\n", "d = dict()\r\nn = int(input())\r\nfor i in range(1,n+1):\r\n k, v = input().split()\r\n v = int(v)\r\n k = int(k)\r\n d[k] = v\r\np = int(input())\r\nfor i in range(1,p+1):\r\n k, t = input().split()\r\n k = int(k)\r\n t = int(t)\r\n if k in d:\r\n if t > d[k]:\r\n d[k] = t \r\n else:\r\n d[k] = t\r\n\r\ne = sum(d.values())\r\nprint(e)\r\n\n# Thu Jul 07 2022 14:34:32 GMT+0000 (Coordinated Universal Time)\n", "n= int(input())\r\nc=dict()\r\nsum=0\r\nfor i in range(n):\r\n a,cst=map(int,input().split())\r\n c[a]=[cst,0]\r\nm=int(input())\r\nfor i in range(m):\r\n a, cst = map(int, input().split())\r\n if a not in c:\r\n c[a]=[0,0]\r\n c[a][1] = cst\r\nfor i in c:\r\n sum+=max(c[i][0],c[i][1])\r\nprint(sum)", "n = int(input())\r\nch = {}\r\ne = set()\r\nfor i in range(n):\r\n\tk,v = input().split()\r\n\tch[k]=int(v)\r\n\te.add(k)\r\nm = int(input())\r\nth = {}\r\nfor i in range(m):\r\n\tk,v = input().split()\r\n\tth[k]=int(v)\r\n\te.add(k)\r\nans = 0\r\nfor i in e:\r\n\tif i in th:\r\n\t\tif i in ch:\r\n\t\t\tans+=max(th.get(i),ch.get(i))\r\n\t\telse:\r\n\t\t\tans+=th.get(i)\r\n\telse:\r\n\t\tans+=ch.get(i)\r\nprint(ans)\r\n", "n = int(input())\r\nc1 = {}\r\nset1 = set()\r\nfor _ in range(n):\r\n t1,t2 = map(int, input().split())\r\n c1[t1] = t2\r\n set1.add(t1)\r\nm = int(input())\r\nfor __ in range(m):\r\n t3,t4 = map(int, input().split())\r\n if t3 in set1:\r\n c1[t3] = max(c1[t3],t4)\r\n else:\r\n c1[t3] = t4\r\nres = 0\r\nfor i in c1:\r\n res+=c1[i]\r\nprint(res)", "t = {}\r\n\r\n\r\nfor _ in range(int(input())):\r\n a,x = map(int,input().split())\r\n t[a] = x\r\n \r\nfor _ in range(int(input())):\r\n b,y = map(int,input().split())\r\n if b in t:\r\n t[b] = max(t[b],y)\r\n else:\r\n t[b] = y\r\n \r\nprint(sum(t.values()))\r\n ", "\r\n\r\n\r\nfrom collections import defaultdict\r\nli1 = defaultdict(int)\r\n\r\nn=int(input())\r\n \r\nfor i in range(n):\r\n a,x= input().split(); a,x= int(a),int(x)\r\n li1[a]=x\r\n \r\n\r\n \r\nm=int(input())\r\nfor i in range(m):\r\n b,y= input().split(); b,y= int(b),int(y)\r\n li1[b]= max(li1[b],y)\r\n \r\n \r\n \r\n\r\n \r\nprint(sum(li1.values()))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "entrada = int(input())\r\narreglo = {}\r\n\r\nfor i in range(entrada):\r\n x,y = [int(x) for x in input().split()]\r\n arreglo[x] = y\r\n\r\nentrada2 = int(input())\r\n\r\nfor i in range(entrada2):\r\n x,y = [int(x) for x in input().split()]\r\n if x in arreglo:\r\n y2 = arreglo[x]\r\n arreglo[x] = max(y,y2)\r\n else:\r\n arreglo[x] = y\r\n\r\nprint(sum(arreglo.values()))", "n = int(input())\r\nd = dict()\r\ng = dict()\r\nfor i in range(n):\r\n c, k = map(int, input().split())\r\n d[c] = k\r\nk = int(input())\r\nfor i in range(k):\r\n c, k = map(int, input().split())\r\n g[c] = k\r\ncum = 0\r\nfor i in d:\r\n if i in g:\r\n if d[i] > g[i]:\r\n cum += d[i]\r\n else:\r\n cum += g[i]\r\n else:\r\n cum += d[i]\r\nfor i in g:\r\n if i not in d:\r\n cum += g[i]\r\nprint(cum)\n# Thu Jul 07 2022 09:51:47 GMT+0000 (Coordinated Universal Time)\n", "n = int(input())\n\ns={}\nfor i in range(n):\n ai,xi = input().strip().split()\n s[ai]=int(xi)\n\n\nn2 = int(input())\n\nfor i in range(n2):\n ai,xi = input().strip().split()\n if ai in s:\n if s[ai]<int(xi):\n s[ai] =int(xi)\n else:\n s[ai]=int(xi)\n\nprint(sum(list(s.values())))\n\t \t \t \t\t \t \t\t\t\t \t\t \t\t\t\t", "from collections import defaultdict as dd, deque\n\nE = set()\n\nn = int(input())\nC1 = dd(int)\nfor _ in range(n):\n i,c = map(int,input().split())\n C1[i] = c\n E.add(i)\n\nm = int(input())\nC2 = dd(int)\nfor _ in range(m):\n i,c = map(int,input().split())\n C2[i] = c\n E.add(i)\n\ne = 0\nfor el in E:\n e += max(C1[el],C2[el])\nprint(e)\n", "i = int(input())\nvalues = {}\n\nfor x in range(i):\n inp = input().split()\n element = inp[0]\n value = int(inp[1])\n values[element] = value\n\ni = int(input())\n\nfor x in range(i):\n inp = input().split()\n element = inp[0]\n value = int(inp[1])\n if element in values:\n if values[element] < int(value):\n values[element] = value\n else:\n values[element] = value\n\nprint(sum(values.values()))\n", "# link : https://codeforces.com/problemset/problem/981/B\r\n# sorting\r\n\r\nresult = {}\r\nn = int(input())\r\n\r\nfor i in range(n):\r\n a,x = input().split()\r\n result[a]=x\r\n\r\nm = int(input())\r\n\r\nfor i in range(m):\r\n b,x = input().split()\r\n if b in result:\r\n if int(result[b])>int(x):\r\n continue\r\n else:\r\n result[b]=x\r\n else:\r\n result[b]=x\r\n\r\n# print(result)\r\nprint(sum(map(int,result.values())))\r\n", "n=int(input())\r\nans=0\r\ncodechef={}\r\ntopcoder={}\r\nfor i in range(n):\r\n a,x=map(int, input().split())\r\n codechef[a]=x\r\n\r\nm=int(input())\r\nfor i in range(m):\r\n b,x=map(int, input().split())\r\n topcoder[b]=x\r\n \r\nfor item in codechef:\r\n if item in topcoder:\r\n ans+=max(codechef[item], topcoder[item])\r\n else:\r\n ans+=codechef[item]\r\n\r\nfor item in topcoder:\r\n if item not in codechef:\r\n ans+=topcoder[item]\r\n\r\nprint(ans)", "N1=int(input())\r\nbusi={}\r\nfor i in range (N1):\r\n name,value=map(int,input().split())\r\n busi[name]=value\r\nsum=0\r\nN2=int(input())\r\nfor i in range(N2):\r\n name, value = map(int, input().split())\r\n if name in busi:\r\n busi[name]=max(value,busi[name])\r\n else:\r\n busi[name]=value\r\nfor item in busi:\r\n sum+=busi[item]\r\nprint(sum)", "elA = dict()\r\nelAs = set()\r\nelB = dict()\r\nelBs = set()\r\ns = 0\r\nn = int(input())\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n elA[x] = y\r\n elAs.add(x)\r\nm = int(input())\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n elB[x] = y\r\n elBs.add(x)\r\nw = elAs & elBs\r\nfor k in w: s += max(elA[k], elB[k])\r\nfor k in elAs:\r\n if k not in w: s += elA[k]\r\nfor k in elBs:\r\n if k not in w: s += elB[k]\r\nprint(s)\r\n", "from collections import defaultdict\r\ne = defaultdict(set)\r\nn = int(input())\r\nfor i in range(n) :\r\n x,price = [int(x) for x in input().split()]\r\n e[x].add(price)\r\nm = int(input())\r\nfor i in range(m) :\r\n x,price = [int(x) for x in input().split()]\r\n e[x].add(price)\r\n\r\nsum = 0 \r\nfor i in e.values() :\r\n sum += max(i)\r\n\r\nprint(sum)\r\n\r\n", "#author : SanskarxRawat\r\no={}\r\nfor _ in range(2):\r\n for i in range(int(input())):\r\n a,x=map(int,input().strip().split())\r\n o[a]=max(o.get(a,0),x)\r\nprint(sum(o.values()))", "from collections import defaultdict\r\ndic = defaultdict(int)\r\nn = int(input())\r\nfor i in range(n):\r\n a, x = map(int, input().split())\r\n dic[a] = x\r\n\r\nm = int(input())\r\nfor i in range(m):\r\n b, y = map(int, input().split())\r\n t = dic[b]\r\n dic[b] = max(t, y)\r\n\r\nnum = 0\r\nfor i in dic.values():\r\n num += i\r\n\r\nprint(num)", "n1 = int(input())\r\nd1 = dict()\r\nfor i in range(n1):\r\n a, x = map(int, input().split())\r\n d1[a] = x\r\nn2 = int(input())\r\nd2 = dict()\r\nfor i in range(n2):\r\n a, x = map(int, input().split())\r\n d2[a] = x\r\n\r\ns1 = set(d1.keys())\r\ns2 = set(d2.keys())\r\ns_all = s1 | s2\r\ns_both = s1 & s2\r\n\r\nans = 0\r\nfor x in s_all:\r\n if x in s_both:\r\n ans += max(d1[x], d2[x])\r\n elif x in d1:\r\n ans += d1[x]\r\n elif x in d2:\r\n ans += d2[x]\r\nprint(ans)\n# Wed Jul 06 2022 23:48:00 GMT+0000 (Coordinated Universal Time)\n", "n=int(input())\r\nhash_map={}\r\nfor i in range(n):\r\n index,value=map(int,input().split())\r\n hash_map[index]=max(hash_map.get(index,0),value)\r\n\r\nm=int(input())\r\nfor i in range(m):\r\n index,value=map(int,input().split())\r\n hash_map[index]=max(hash_map.get(index,0),value)\r\n\r\nvalue=hash_map.values()\r\nsum1=0\r\nfor i in value:\r\n sum1+=i\r\nprint(sum1)", "m=int(input())\nd={}\nfor i in range(m):\n a,v=map(int,input().split())\n d[a]=v\nn=int(input())\nfor i in range(n):\n a,v=map(int,input().split())\n if(a in d):\n d[a]=max(d[a],v)\n else:\n d[a]=v\n#print(d)\nl=d.values()\nprint(sum(l))", "n=int(input())\r\nsum1=0\r\nfo=dict()\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n fo[x]=y\r\n sum1+=y\r\nto=dict()\r\nm=int(input())\r\nfor i in range(m):\r\n x,y=map(int,input().split())\r\n if(x in fo):\r\n if(fo[x]<y):\r\n sum1-=fo[x]\r\n sum1+=y\r\n else:\r\n sum1+=y\r\nprint(sum1)", "\r\nk={}\r\ns=0\r\n\r\nfor i in range(int(input())):\r\n\ta,x=map(int,input().split())\r\n\tk[a]=x\r\n\t\r\nfor j in range(int(input())):\r\n\tb,y=map(int,input().split())\r\n\tif b in k:\r\n\t\tk[b]=max(k[b],y)\r\n\t\t# print(k[b])\r\n\telse:\r\n\t\tk[b]=y\r\ns=0\r\nfor h in k.values():\r\n\r\n\ts+=h\r\nprint(s)\r\n\r\n", "n = int(input())\r\nd1 = {}\r\nfor _ in range(n):\r\n a, x = map(int, input().split())\r\n d1[a] = x\r\nd2 = {}\r\nm = int(input())\r\nfor _ in range(m):\r\n b, y = map(int, input().split())\r\n d2[b] = y\r\nans = 0\r\nfor key in set(d1.keys()) | set(d2.keys()):\r\n ans += max(d1.get(key, 0), d2.get(key, 0))\r\nprint(ans)", "n = int(input())\r\nchemicals = {}\r\nfor i in range(n):\r\n line = [int(el) for el in input().split()]\r\n chemicals.update({line[0]: [line[1], 0]})\r\nm = int(input())\r\nfor i in range(m):\r\n line = [int(el) for el in input().split()]\r\n if line[0] not in chemicals.keys():\r\n chemicals.update({line[0]: [0, line[1]]})\r\n else:\r\n chemicals[line[0]][1] = line[1]\r\nmax_sum = 0\r\nfor chemical in chemicals.keys():\r\n max_sum += max(chemicals[chemical])\r\nprint(max_sum)", "from collections import defaultdict as dd\nd = dd(int)\n\nn = int(input())\nfor _ in range(n):\n a, x = map(int, input().split())\n d[a] = x\nm = int(input())\nfor _ in range(m):\n b, y = map(int, input().split())\n if y > d[b]:\n d[b] = y\nprint(sum(d.values()))\n", "choosen = {}\r\nsoma = 0\r\n\r\nn = int(input())\r\ni=0\r\nwhile i < n:\r\n element,usage = [int(i) for i in input().split()]\r\n choosen[element] = usage\r\n i+=1\r\nm = int(input())\r\ni=0\r\nwhile i < m:\r\n element,usage = [int(i) for i in input().split()]\r\n if element not in choosen:\r\n choosen[element] = usage\r\n else:\r\n if choosen[element] < usage:\r\n choosen[element] = usage\r\n i+=1\r\n\r\nfor i in choosen:\r\n soma += choosen[i]\r\nprint(soma)\r\n", "I=lambda:[*map(int,input().split())]\r\nd={}\r\nexec(2*'for _ in[0]*I()[0]:\\n a,b=I()\\n if a in d:d[a]=max(d[a],b)\\n else:d[a]=b\\n')\r\nprint(sum(d.values()))", "a=int(input())\r\n\r\na1={}\r\na2={}\r\ns=0\r\nfor i in range(a):\r\n q,w=map(int,input().split())\r\n a1[q]=w\r\nb=int(input())\r\nfor i in range(b):\r\n q, w = map(int, input().split())\r\n a2[q] = w\r\nfor i in a1.keys():\r\n if i in a2.keys():\r\n s+=max(a1[i],a2[i])\r\n else:\r\n s+=a1[i]\r\nfor i in a2.keys():\r\n if i in a1.keys():\r\n continue\r\n else:\r\n s+=a2[i]\r\nprint(s)\r\n\r\n\r\n", "n=int(input())\r\nd={}\r\nfor i in range(n):\r\n a,x=map(int,input().split())\r\n d[a]=x\r\nm=int(input())\r\nfor i in range(m):\r\n b,x=map(int,input().split())\r\n try:\r\n d[b]=max(x,d[b])\r\n except:\r\n d[b]=x\r\nprint(sum(d.values()))", "n=int(input())\r\ndi={}\r\nfor i in range(n):\r\n a,b=(map(int,input().strip().split(' ')))\r\n try:\r\n p=di[a]\r\n di[a]=max(di[a],b)\r\n except KeyError:\r\n di[a]=b\r\nm=int(input())\r\nfor i in range(m):\r\n a,b=(map(int,input().strip().split(' ')))\r\n try:\r\n p=di[a]\r\n di[a]=max(di[a],b)\r\n except KeyError:\r\n di[a]=b\r\nans=0\r\nfor i in di:\r\n ans+=di[i]\r\nprint(ans)\r\n", "r = {}\r\nn = int(input())\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n r[x] = y\r\nk = int(input())\r\nfor i in range(k):\r\n x, y = map(int, input().split())\r\n if x in r:\r\n if r[x] < y:\r\n r[x] = y\r\n else:\r\n r[x] = y\r\nprint(sum(r.values()))\r\n", "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\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# -------------------------------------------------------------------- #\ndef main():\n c = {}\n t = {}\n\n cn = int(input())\n for i in range(cn):\n ai, xi = map(int, input().split())\n c[ai] = xi\n t[ai] = 0\n\n tn = int(input())\n for i in range(tn):\n bi, yi = map(int, input().split())\n t[bi] = yi\n\n total = 0\n for k in c.keys():\n if c[k] > t[k]:\n total += c[k]\n t[k] = 0\n else:\n c[k] = 0\n\n for k in t.keys():\n total += t[k]\n\n print(total)\n\n\nif __name__ == '__main__':\n main()\n\n\t \t \t \t \t \t \t\t\t\t \t\t", "d = dict()\r\n\r\nn = int(input())\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n d[x] = y\r\n\r\nm = int(input())\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n\r\n if(x not in d.keys()):\r\n d[x] = y\r\n else:\r\n d[x] = max(d[x], y)\r\n\r\nans = 0\r\nfor x in d.keys():\r\n ans += d[x]\r\n\r\nprint(ans)", "n=int(input())\r\na={}\r\nfor i in range(n):\r\n p,q=map(int,input().split())\r\n a[p]=q\r\nm=int(input())\r\nfor j in range(m):\r\n p,q=map(int,input().split())\r\n if p in a and a[p]<q:\r\n a[p]=q\r\n elif p not in a:\r\n a[p]=q\r\nprint(sum(a.values()))", "elements1 = {}\r\nelements2 = {}\r\n\r\nn = int(input())\r\nfor i in range(n):\r\n loc = list(map(int, input().split()))\r\n elements1[loc[0]] = loc[1]\r\n\r\nm = int(input())\r\nfor j in range(m):\r\n loc = list(map(int, input().split()))\r\n elements2[loc[0]] = loc[1]\r\n\r\nitems1 = elements1\r\nitems2 = elements2\r\nkeys1 = set(list(elements1.keys()))\r\nkeys2 = set(list(elements2.keys()))\r\n\r\nintersection = list(keys1.intersection(keys2))\r\n\r\nost = {}\r\nfor i in range(len(intersection)):\r\n if elements1[intersection[i]] > elements2[intersection[i]]:\r\n elements1[intersection[i]] = items1[intersection[i]]\r\n elements2[intersection[i]] = 0\r\n else:\r\n elements2[intersection[i]] = items2[intersection[i]]\r\n elements1[intersection[i]] = 0\r\n\r\nprint(sum(list(elements1.values())) + sum(list(elements2.values())))", "from collections import defaultdict\r\nn = int(input())\r\nl = defaultdict(list)\r\nm = defaultdict(list)\r\nx = []\r\nfor _ in range(n):\r\n a,k = map(int,input().split())\r\n l[a].append(k)\r\n m[a].append(-1)\r\n x.append(a)\r\nz = int(input())\r\nfor _ in range(z):\r\n a,k = map(int,input().split())\r\n m[a].append(k)\r\n l[a].append(-1)\r\n x.append(a)\r\nx = list(set(x))\r\nans = 0\r\nfor i in x:\r\n ans+=max(max(l[i]),max(m[i]))\r\nprint(ans)", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Sun May 27 20:07:20 2018\n\n@st0rmbring3r\n\"\"\"\n\ncost_dict = {}\n\na = int(input())\nfor i in range(a):\n x,y = [int(x) for x in input().split()]\n cost_dict[x] = y\n\nb = int(input())\nfor i in range(b):\n x,y = [int(x) for x in input().split()]\n if x in cost_dict:\n y2 = cost_dict[x]\n cost_dict[x] = max(y,y2)\n else:\n cost_dict[x] = y\n\nprint(sum(cost_dict.values()))", "dict1={}\r\nres=0\r\nn=int(input())\r\nfor i in range(n):\r\n a,b=[int(x) for x in input().split()]\r\n dict1[a]=b\r\n res+=b\r\nm=int(input())\r\nfor i in range(m):\r\n a,b=[int(x) for x in input().split()]\r\n if a in dict1:\r\n if b>dict1[a]:\r\n res+=b-dict1[a]\r\n else:\r\n res+=b\r\nprint(res)", "d1, s1, d2, s2 = dict(), set(), dict(), set()\r\nsum = 0\r\nfor _ in range(int(input())):\r\n a, b = map(int, input().split())\r\n d1[a] = b\r\n s1.add(a)\r\n sum += b\r\nfor _ in range(int(input())):\r\n a, b = map(int, input().split())\r\n d2[a] = b\r\n s2.add(a)\r\n sum += b\r\ns = s1 & s2\r\nfor i in s:\r\n sum -= min(d1[i], d2[i])\r\nprint(sum)", "incomes = {}\r\nfor _ in range(2):\r\n\tfor i in range(int(input())):\r\n\t\ta,b = map(int, input().split())\r\n\t\tincomes[a] = max(incomes.get(a, 0), b)\r\nprint(sum(incomes.values()))", "n=int(input())\r\nax=[list(map(int,input().split()))for _ in[0]*n]\r\nm=int(input())\r\nby=[list(map(int,input().split()))for _ in[0]*m]\r\nr={}\r\nfor(a,x)in ax:\r\n r[a]=x\r\nfor(b,y)in by:\r\n if b in r.keys():r[b]=max(r[b],y)\r\n else:r[b]=y\r\nprint(sum(r.values()))", "from sys import stdin\r\ninput = stdin.readline\r\nn = int(input())\r\na, s = [], set()\r\nans = 0\r\nfor i in range(n):\r\n j, x = [int(i) for i in input().split()]\r\n a.append((x, j))\r\nm = int(input())\r\nfor i in range(m):\r\n j, x = [int(i) for i in input().split()]\r\n a.append((x, j))\r\na.sort(reverse=True)\r\nfor t in a:\r\n if t[1] not in s:\r\n s.add(t[1])\r\n ans += t[0]\r\nprint(ans)\r\n", "n = int(input())\r\ns = set()\r\nd = dict()\r\ncounter = 0\r\nfor i in range(n):\r\n a, x = map(int, input().split())\r\n s.add(a)\r\n d[a] = x\r\n counter += x\r\nm = int(input())\r\nfor i in range(m):\r\n b, y = map(int, input().split())\r\n if b in s:\r\n if d[b] < y:\r\n counter -= d[b]\r\n counter += y\r\n else:\r\n counter += y\r\nprint(counter)\r\n\n# Tue Jul 11 2023 13:28:41 GMT+0300 (Moscow Standard Time)\n", "from sys import stdin\n\n\ndef main():\n l = stdin.read().splitlines()\n d, s, n = {}, 0, int(l[0])\n for i in range(1, n + 1):\n a, x = map(int, l[i].split())\n d[a] = x\n s += x\n for i in range(n + 2, n + 2 + int(l[n + 1])):\n a, y = map(int, l[i].split())\n x = d.get(a, 0)\n if x < y:\n s += y - x\n print(s)\n\n\nif __name__ == '__main__':\n main()\n", "a = dict()\r\nb = dict()\r\nfor i in range(int(input())):\r\n e, y = map(int, input().split())\r\n a[e] = y\r\nfor i in range(int(input())):\r\n e, y = map(int, input().split())\r\n b[e] = y\r\ns = dict()\r\nfor i in a:\r\n if i in b:\r\n s[i] = max(a[i], b[i])\r\n else:\r\n s[i] = a[i]\r\nfor i in b:\r\n if i in a:\r\n s[i] = max(a[i], b[i])\r\n else:\r\n s[i] = b[i]\r\ns1 = 0\r\nfor i in s:\r\n s1 += s[i]\r\nprint(s1)", "list1=[]\r\nlist2=[]\r\ndict1={}\r\ndict2={}\r\nans=0\r\nn = int(input())\r\nfor i in range(n):\r\n a,x = map(int,input().split())\r\n dict1[a]=x\r\n list1.append(a)\r\nm = int(input())\r\nfor i in range(m):\r\n a,x = map(int,input().split())\r\n dict2[a]=x\r\n list2.append(a)\r\n\r\nlistf =list(set(list1+list2))\r\nlistf.sort()\r\ndict1 = {k : v for k, v in sorted(dict1.items())}\r\ndict2 = {k : v for k, v in sorted(dict2.items())}\r\nfor i in listf:\r\n if (i in dict1) and (i in dict2):\r\n if dict1[i]>dict2[i]:\r\n ans+=dict1[i]\r\n else:\r\n ans+=dict2[i]\r\n elif (i in dict1):\r\n ans+=dict1[i]\r\n elif i in dict2:\r\n ans+=dict2[i]\r\n else:\r\n pass\r\nprint(ans)\r\n", "n = int(input())\r\ndict = {}\r\nfor i in range(n):\r\n key,value = map(int,input().split())\r\n dict[key] = value\r\nm=int(input())\r\nfor i in range(m):\r\n key,value = map(int,input().split())\r\n if key in dict.keys():\r\n dict[key] = max(dict[key],value)\r\n else:\r\n dict[key] = value\r\nans=0\r\nfor val in dict.keys():\r\n ans+=dict[val]\r\nprint(ans)", "\r\nn = int(input())\r\nm = {}\r\n\r\nfor i in range(0,n):\r\n x,y = map(int,input().split(' '))\r\n if m.get(x)==None:\r\n m.update({x:y})\r\n else:\r\n m[x] = max(m.get(x),y)\r\n\r\np = int(input())\r\n\r\nfor i in range(0,p):\r\n x,y = map(int,input().split(' '))\r\n if m.get(x)==None:\r\n m.update({x:y})\r\n else:\r\n m[x] = max(m.get(x),y)\r\n\r\nprint(sum(m.values()))\r\n", "profits = dict()\nfor x in range(2):\n\tn = int(input())\n\tfor i in range(n):\n\t\tiD, profit = map(int, input().split())\n\t\tif iD in profits:\n\t\t\tprofits[iD] = max(profits[iD], profit)\n\t\telse:\n\t\t\tprofits[iD] = profit\nprint(sum([b for a,b in profits.items()]))", "a_size = int(input())\r\nelements = {}\r\nfor _ in range(a_size):\r\n index, price = map(int, input().split())\r\n elements[index] = price\r\n \r\nb_size = int(input())\r\nfor _ in range(b_size):\r\n index, price = map(int, input().split())\r\n elements[index] = max(price, elements.get(index, 0))\r\n \r\nprint(sum(elements.values()))", "d = {}\r\nn = int(input())\r\nfor i in range(n):\r\n x, y = list(map(int, input().split()))\r\n if x in d:\r\n d[x] = max(d[x], y)\r\n else:\r\n d[x] = y\r\nn = int(input())\r\nfor i in range(n):\r\n x, y = list(map(int, input().split()))\r\n if x in d:\r\n d[x] = max(d[x], y)\r\n else:\r\n d[x] = y\r\ns = 0\r\nfor a in d:\r\n s += d[a]\r\nprint(s)", "profit = dict()\nn = int(input())\n\nfor i in range(n):\n x, p = [int(j) for j in input().split()]\n profit[x] = p\n\nn = int(input())\n\nfor i in range(n):\n x, p = [int(j) for j in input().split()]\n if x in profit:\n profit[x] = max(profit[x], p)\n else:\n profit[x] = p\n\nans = 0\nfor i in profit.values():\n ans += i\n\nprint(ans)\n", "n=int(input())\r\nlf=[]\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n lf.append([x,y])\r\nm=int(input())\r\nlt={}\r\ns=0\r\nse=set()\r\nfor i in range(m):\r\n x,y=map(int,input().split())\r\n lt[x]=y\r\n s+=y\r\n se.add(x)\r\nfor i in range(n):\r\n if lf[i][0] in se:\r\n \r\n if (lf[i][1]>lt[lf[i][0]]):\r\n s+=lf[i][1]-lt[lf[i][0]]\r\n \r\n \r\n else:\r\n s+=lf[i][1]\r\nprint(s) ", "n=int(input())\nd={}\ns=0\nfor i in range(n):\n x=list(int(v) for v in input().split())\n d[x[0]]=x[1]\n s+=x[1]\nm=int(input())\nfor i in range(m):\n x=list(int(v) for v in input().split())\n if(d.get(x[0])==None):\n s+=x[1]\n elif(x[1]>d[x[0]]):\n s+=x[1]-d[x[0]]\nprint(s)\n\n\t\t\t\t\t \t\t \t\t \t \t\t \t \t \t\t \t\t", "import math\r\nimport sys\r\n\r\n\r\ndef scan():\r\n return list(map(int, sys.stdin.readline().strip().split()))\r\n\r\n\r\ndef solution():\r\n # for _ in range(int(input())):\r\n n = int(input())\r\n a = []\r\n for i in range(n):\r\n a.append(scan())\r\n m = int(input())\r\n b = []\r\n a = sorted(a, key=lambda x: x[0])\r\n b = sorted(a, key=lambda x: x[0])\r\n for j in range(m):\r\n b.append(scan())\r\n c = {}\r\n for i in a:\r\n if i[0] in c:\r\n c[i[0]] = max(c[i[0]], i[1])\r\n else:\r\n c[i[0]] = i[1]\r\n for i in b:\r\n if i[0] in c:\r\n c[i[0]] = max(c[i[0]], i[1])\r\n else:\r\n c[i[0]] = i[1]\r\n s = 0\r\n for i in c:\r\n s += c[i]\r\n print(s)\r\n\r\n\r\nif __name__ == '__main__':\r\n solution()\r\n", "n = int(input())\r\na = {}\r\nfor i in range(n):\r\n b, c = map(int, input().split())\r\n if b in a:\r\n a[b] += [c]\r\n else:\r\n a[b] = [c]\r\nn1 = int(input())\r\nfor i in range(n1):\r\n b, c = map(int, input().split())\r\n if b in a:\r\n a[b] += [c]\r\n else:\r\n a[b] = [c]\r\nk = 0\r\nfor i in a.items():\r\n k += max(i[1])\r\nprint(k)\r\n\n# Thu Jul 07 2022 09:37:30 GMT+0000 (Coordinated Universal Time)\n", "a = {}\nb = {}\nfor i in range(int(input())):\n ID, val = [int(j) for j in input().split(' ')]\n a[ID] = val\nfor i in range(int(input())):\n ID, val = [int(j) for j in input().split(' ')]\n b[ID] = val\n\nbadA = []\nbadB = []\nfor k in a:\n if k in b and b[k] > a[k]:\n badA.append(k)\n elif k in b:\n badB.append(k)\n\nfor k in badA:\n del a[k]\nfor k in badB:\n del b[k]\n\ns = 0\nfor k in a:\n s += a[k]\nfor k in b:\n s += b[k]\nprint(s)", "n = int(input())\r\nChemForces = {}\r\nfor i in range(n):\r\n temp = input().strip().split(' ')\r\n ChemForces[temp[0]] = int(temp[1])\r\nm = int(input())\r\nTopChemist = {}\r\nfor j in range(m):\r\n temp = input().strip().split(' ')\r\n TopChemist[temp[0]] = int(temp[1])\r\nChemForces_k = set(ChemForces.keys())\r\nTopChemist_k = set(TopChemist.keys())\r\nChemForces_ku = ChemForces_k.difference(TopChemist_k)\r\nTopChemist_ku = TopChemist_k.difference(ChemForces_k)\r\nChemTop = ChemForces_k.intersection(TopChemist_k)\r\nsumChemForces_ku = 0\r\nsumTopChemist_ku = 0\r\nsumChemTop = 0\r\nfor i in ChemForces_ku:\r\n sumChemForces_ku += ChemForces[i]\r\nfor j in TopChemist_ku:\r\n sumTopChemist_ku += TopChemist[j]\r\nfor k in ChemTop:\r\n if ChemForces[k] > TopChemist[k]:\r\n sumChemTop += ChemForces[k]\r\n else:\r\n sumChemTop += TopChemist[k]\r\nmax_sum = sumChemForces_ku + sumTopChemist_ku + sumChemTop\r\nprint(max_sum)", "d = {}\r\nn = int(input())\r\nfor _ in range(n):\r\n a, x = map(int, input().split())\r\n d[a] = x\r\nn = int(input())\r\nfor _ in range(n):\r\n a, x = map(int, input().split())\r\n d[a] = max(x, d.get(a, 0))\r\nprint(sum(d.values())) ", "n=int(input())\r\nd={}\r\nfor _ in range(n):\r\n\ta,b=map(int,input().split())\r\n\ttry:\r\n\t\td[a].append(b)\r\n\texcept:\r\n\t\td.update({a:[]})\r\n\t\td[a].append(b)\r\nm=int(input())\r\nfor _ in range(m):\r\n\ta,b=map(int,input().split())\r\n\ttry:\r\n\t\td[a].append(b)\r\n\texcept:\r\n\t\td.update({a:[]})\r\n\t\td[a].append(b)\r\n\r\nl=list(d.keys())\r\nc=0\r\nfor i in l:\r\n\tc+=max(d[i])\t\r\nprint(c)", "import sys\r\n\r\ninput = sys.stdin.buffer.readline\r\n\r\nn = int(input())\r\ncoordinates = [list(map(int, input().split())) for _ in range(n)]\r\nm = int(input())\r\nadditional_coordinates = [list(map(int, input().split())) for _ in range(m)]\r\n\r\nmax_y = {}\r\n\r\nfor x, y in coordinates + additional_coordinates:\r\n if x in max_y:\r\n max_y[x] = max(max_y[x], y)\r\n else:\r\n max_y[x] = y\r\n\r\nres = sum(max_y.values())\r\nprint(res)", "n=int(input())\r\na,x,s=set(),{},0\r\nfor i in range(n):\r\n ai,xi=map(int,input().split())\r\n a.add(ai)\r\n x[ai]=xi\r\n s+=xi\r\nm=int(input())\r\nb,y=set(),{}\r\nfor i in range(m):\r\n bi,yi=map(int,input().split())\r\n b.add(bi)\r\n y[bi]=yi\r\n s+=yi\r\nsp=a&b\r\nfor i in sp:\r\n s-=min(x[i],y[i])\r\nprint(s)\r\n", "n = int(input())\r\nans = 0\r\ng = {}\r\nfor k in range(n):\r\n x, y = map(int, input().split())\r\n g[x] = y\r\n ans += y\r\nm = int(input())\r\nfor k in range(m):\r\n x, y = map(int, input().split())\r\n if x in g and g[x] > 0:\r\n ans -= g[x]\r\n ans += max(g[x], y)\r\n else:\r\n ans += y\r\nprint(ans)\n# Thu Jul 07 2022 09:05:17 GMT+0000 (Coordinated Universal Time)\n", "n = int(input())\r\na = {k: v for (k, v) in map(lambda line: tuple(int(c) for c in input().split()), range(n))}\r\n\r\nm = int(input())\r\nb = {k: v for (k, v) in map(lambda line: tuple(int(c) for c in input().split()), range(m))}\r\n\r\nkeys = set(a.keys())\r\nkeys |= b.keys()\r\n\r\ndef max_val(k):\r\n if (k in a) and (k in b):\r\n return max(a[k], b[k])\r\n if k in a:\r\n return a[k]\r\n return b[k]\r\n\r\nprint(sum(max_val(k) for k in keys))", "n = int(input())\r\na = {}\r\nfor _ in range(n):\r\n aa, xx = [int(v) for v in input().split()]\r\n a[aa] = xx\r\n\r\nm = int(input())\r\nb = {}\r\nfor _ in range(m):\r\n bb, yy = [int(v) for v in input().split()]\r\n b[bb] = yy\r\n\r\nsa = set(a.keys())\r\nsb = set(b.keys())\r\nboth = sa & sb\r\n\r\nprint(\r\n sum(max(a[v], b[v]) for v in both) +\r\n sum(a[v] for v in sa - both) +\r\n sum(b[v] for v in sb - both)\r\n)", "#https://codeforces.com/contest/981/problem/B\r\n\r\nn = int(input())\r\na = []\r\nx = []\r\n\r\nfor _ in range(n):\r\n i, j = map(int, input().split())\r\n a.append(i)\r\n x.append(j)\r\n\r\nm = int(input())\r\nb = []\r\ny = []\r\nb_index_lookup = {}\r\n\r\nk = 0\r\nfor _ in range(m):\r\n i, j = map(int, input().split())\r\n b.append(i)\r\n y.append(j)\r\n b_index_lookup[i] = k\r\n k += 1\r\n\r\nb_excluded = [False] * m\r\ns = 0\r\n\r\nfor idx_a in range(n):\r\n a_i = a[idx_a]\r\n x_i = x[idx_a]\r\n\r\n if a_i in b_index_lookup:\r\n i = b_index_lookup[a_i]\r\n if x_i >= y[i]:\r\n s += x_i\r\n b_excluded[i] = True\r\n else:\r\n s += x_i\r\n\r\nfor idk_b in range(m):\r\n if b_excluded[idk_b]:\r\n continue\r\n s += y[idk_b]\r\n\r\nprint(s)", "from operator import itemgetter\r\nn=int(input())\r\n\r\nnlist=[]\r\nfor i in range(n):\r\n inp=input().split()\r\n nlist.append([int(inp[0]),int(inp[1])])\r\nm=int(input())\r\nmlist=[]\r\nfor i in range(m):\r\n inp=input().split()\r\n mlist.append([int(inp[0]),int(inp[1])]) \r\ntotal=sorted(nlist+mlist,key=itemgetter(0))\r\ncurrent=-1\r\nmaxi=0\r\nres=0\r\nfor i in range(n+m):\r\n if current== total[i][0]:\r\n if total[i][1] > maxi :\r\n res=res-maxi\r\n res=res+ total[i][1]\r\n maxi=total[i][1]\r\n else :\r\n res=res+total[i][1]\r\n current=total[i][0]\r\n maxi=total[i][1]\r\nprint(res) \r\n ", "def solution():\n n = int(input())\n d1, d2 = dict(), dict()\n for _ in range(n):\n key, value = map(int, input().split())\n d1[key] = value\n m = int(input())\n for _ in range(m):\n key, value = map(int, input().split())\n d2[key] = value\n\n for key, value in d2.items():\n if key in d1:\n if d2[key] > d1[key]:\n d1[key] = value\n else:\n d1[key] = value\n print(sum(d1.values()))\n\n\n\nsolution()\n", "n = int(input())\nd1, d2 = {}, {}\nfor x in range(n):\n inp = input().split(\" \")\n d1[inp[0]] = int(inp[1])\nm = int(input())\nfor x in range(m):\n inp = input().split(\" \")\n d2[inp[0]] = int(inp[1])\ns = 0\nfor x in set(list(d1.keys()) + list(d2.keys())):\n if x in d1 and x not in d2:\n s += d1[x]\n elif x in d2 and x not in d1:\n s += d2[x]\n else:\n s += max(d1[x], d2[x])\nprint(s)\n\n# Sun Mar 05 2023 02:43:15 GMT+0300 (Moscow Standard Time)\n", "\r\ndef choose_sets(m,mseq,n,nseq) :\r\n sorted_mseq = sorted(mseq)\r\n sorted_nseq = sorted(nseq)\r\n \r\n total = 0\r\n \r\n index_mseq = 0\r\n index_nseq = 0\r\n \r\n while index_mseq < m and index_nseq < n :\r\n if sorted_mseq[index_mseq] > sorted_nseq[index_nseq] :\r\n total += nseq[sorted_nseq[index_nseq]]\r\n index_nseq += 1\r\n \r\n elif sorted_mseq[index_mseq] < sorted_nseq[index_nseq] :\r\n total += mseq[sorted_mseq[index_mseq]]\r\n index_mseq += 1\r\n \r\n else :\r\n total += max(mseq[sorted_mseq[index_mseq]],nseq[sorted_nseq[index_nseq]])\r\n index_nseq += 1\r\n index_mseq += 1\r\n \r\n if index_mseq == m :\r\n while index_nseq < n :\r\n total += nseq[sorted_nseq[index_nseq]]\r\n index_nseq += 1\r\n else :\r\n while index_mseq < m :\r\n total += mseq[sorted_mseq[index_mseq]]\r\n index_mseq += 1\r\n \r\n return total\r\n \r\nchem = int(input())\r\nmseq = {}\r\nfor x in range(chem) :\r\n index , value = list(map(int,input().split()))\r\n mseq[index] = value\r\n \r\ntop = int(input())\r\nnseq = {}\r\nfor y in range(top):\r\n index , value = list(map(int,input().split()))\r\n nseq[index] = value\r\n \r\nprint (choose_sets(chem,mseq,top,nseq))\r\n \r\n \r\n \r\n \r\n ", "n=int(input())\r\na={}\r\nans=0\r\nfor i in range(n):\r\n s=input().split()\r\n z=int(s[1])\r\n a[s[0]]=z\r\n ans+=z\r\nm=int(input())\r\nfor i in range(m):\r\n s=input().split()\r\n z=int(s[1])\r\n x=a.get(s[0],False)\r\n if x==False:\r\n ans+=z\r\n else:\r\n if z>x:\r\n ans-=x\r\n ans+=z\r\nprint(ans)\r\n", "from collections import defaultdict\r\nn=int(input())\r\ncount=defaultdict(int)\r\nprice=defaultdict(int)\r\nprofit=int\r\nprofit=0\r\nfor i in range(n):\r\n A=input().split()\r\n k=int(A[0])\r\n l=int(A[1])\r\n count[k]=1\r\n price[k]=l\r\nm=int(input())\r\nfor i in range(m):\r\n A=input().split()\r\n k=int(A[0])\r\n l=int(A[1])\r\n if l>price[k]:\r\n count[k]==-1\r\n price[k]=l\r\nfor i in price.keys():\r\n profit=profit+price[i]\r\nprint(profit)\r\n", "n=int(input())\r\nans={}\r\nfor i in range(n):\r\n a,x=map(int,input().split())\r\n ans[a]=x\r\nm=int(input())\r\nfor i in range(m):\r\n a,x=map(int,input().split())\r\n if a in ans:\r\n if ans[a]<x:\r\n ans[a]=x\r\n else:\r\n ans[a]=x\r\ns=0\r\nfor i in ans:\r\n s+=ans[i]\r\nprint(s)\r\n", "m = int(input())\na=[]\nfor i in range(m):\n t = (r,s) = [t(s) for t,s in zip((int,int), input().split())]\n a.append(t)\n\nn = int(input())\nb=[]\nfor i in range(n):\n t = (r,s) = [t(s) for t,s in zip((int,int), input().split())]\n b.append(t)\n\nal = sorted(a+b, key=lambda x: x[0])\n\n#print(a)\n#print(b)\n\nacc=0\nno=-1\npm=-1\nfor i in al:\n if i[0] != no:\n no = i[0]\n pm = i[1]\n acc+=i[1]\n else:\n if i[1] > pm:\n acc += -pm + i[1]\n pm = i[1]\n\nprint(acc)\n\n", "import collections\nimport heapq\nfrom bisect import bisect_right\nimport math\n\ndic = {}\nn = int(input())\nfor i in range(n):\n a, b = [int(x) for x in input().split()]\n dic.update({a : b})\n\nm = int(input())\nfor i in range(m):\n a, b = [int(x) for x in input().split()]\n if a in dic:\n dic[a] = max(dic[a], b)\n else:\n dic.update({a : b})\n\nval = 0\nfor i in dic:\n val += dic[i]\nprint(val)\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\nd={}\r\nfor i in range(n):\r\n p,q=map(int,input().split())\r\n if p in d.keys():\r\n if d[p]<q:\r\n d[p]=q\r\n else:\r\n d[p]=q\r\n\r\nm=int(input())\r\nfor i in range(m):\r\n p,q=map(int,input().split())\r\n if p in d.keys():\r\n if d[p]<q:\r\n d[p]=q\r\n else:\r\n d[p]=q\r\n\r\nsum=0\r\nfor i in d.keys():\r\n sum+=d[i]\r\n \r\nprint(sum)", "import sys\n\nn = int(sys.stdin.readline().strip())\nd = {}\nfor _ in range(n):\n\tai,xi = map(int,sys.stdin.readline().strip().split(' '))\n\tif ai in d:\n\t\td[ai] = max(d[ai],xi)\n\telse:\n\t\td[ai] = xi\nm = int(sys.stdin.readline().strip())\nfor _ in range(m):\n\tai,xi = map(int,sys.stdin.readline().strip().split(' '))\n\tif ai in d:\n\t\td[ai] = max(d[ai],xi)\n\telse:\n\t\td[ai] = xi\nans = 0\nfor ai,xi in d.items():\n\tans += xi\nprint(ans)", "n = int(input())\r\na = {}\r\nfor i in range(n):\r\n s,t = map(int, input().split())\r\n a[s] = t\r\n\r\nn = int(input())\r\nb = {}\r\nfor i in range(n):\r\n s,t = map(int, input().split())\r\n b[s] = t\r\n\r\nfor i in a.keys():\r\n if i in b.keys():\r\n if a[i]>b[i]:\r\n b[i] = 0\r\n else:\r\n a[i] = 0\r\n\r\nc = 0\r\nfor i in a.keys():\r\n c+=a[i]\r\nfor i in b.keys():\r\n c+=b[i]\r\nprint(c)", "n = int(input())\r\narr = []\r\nfor _ in range(n):\r\n\tarr.append(list(map(int,input().split())))\r\nm = int(input())\r\nfor _ in range(m):\r\n\tarr.append(list(map(int,input().split())))\r\narr.sort(key = lambda x:x[0])\r\nval = 0\r\ni = 0\r\nwhile(i < (len(arr)-1)):\r\n\tif(arr[i][0] == arr[i+1][0]):\r\n\t\tval += max(arr[i][1],arr[i+1][1])\r\n\t\ti += 2\r\n\telse: \r\n\t\tval += arr[i][1]\r\n\t\ti +=1\r\nif(len(arr)>1):\r\n\tif(arr[len(arr)-1][0] != arr[len(arr) - 2][0]):\r\n\t\tval += arr[len(arr)-1][1]\r\nelse:\r\n\tval += arr[0][1]\r\nprint(val)", "inc = {}\r\nfor i in range(2):\r\n n = int(input())\r\n for i in range(n):\r\n a, x = [int(s) for s in input().split(' ')]\r\n if a in inc:\r\n inc[a] = max(inc[a], x)\r\n else:\r\n inc[a] = x\r\n\r\nprint(sum(inc.values()))", "from collections import defaultdict\r\nd=defaultdict(int)\r\nn=int(input())\r\nfor i in range(n):\r\n\ta,b=map(int,input().split())\r\n\td[a]=b\r\n\r\nm=int(input())\r\nfor i in range(m):\r\n\ta,b=map(int,input().split())\r\n\tif d[a]<b:\r\n\t\td[a]=b\r\n\r\nprint(sum(d.values()))\r\n\r\n", "n=int(input())\r\ns={}\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n s[a]=b\r\nm=int(input())\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n s[a]=max(s.get(a,0),b)#used change max value\r\nprint(sum(s.values()))\r\n\r\n\r\n", "n = int(input())\r\nd1 = dict()\r\nfor i in range(n):\r\n c,d = map(int,input().split())\r\n d1[c] = d\r\nm = int(input())\r\nd2 = dict()\r\nfor i in range(m):\r\n c, d = map(int, input().split())\r\n d2[c] = d\r\n\r\nout = 0;\r\nfor i in d1:\r\n if d2.get(i,0) > 0:\r\n if d2[i] > d1[i]:\r\n d1[i] = 0\r\n else:\r\n d2[i] = 0\r\nfor i in d2:\r\n if d1.get(i,0) > 0:\r\n if d2[i] > d1[i]:\r\n d1[i] = 0\r\n else:\r\n d2[i] = 0\r\n\r\nfor i in d1:\r\n out += d1[i]\r\nfor i in d2:\r\n out += d2[i]\r\nprint(out)\r\n", "def maxInt(a, b):\r\n if a > b:\r\n return a\r\n else:\r\n return b\r\n\r\n\r\nn = int(input())\r\nmaxMap = {}\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n maxMap[a] = b\r\n\r\nm = int(input())\r\nfor j in range(m):\r\n a, b = map(int, input().split())\r\n if a in maxMap:\r\n maxMap[a] = maxInt(maxMap[a], b)\r\n else:\r\n maxMap[a] = b\r\n\r\nsol = 0\r\nfor key, value in maxMap.items():\r\n sol += value\r\n\r\nprint(sol)\r\n", "if __name__ == \"__main__\":\n chem = {} \n \n n = int(input())\n for i in range(n):\n x, y = map(int, input().split())\n if x in chem: chem[x] = max(chem[x], y) \n else: chem[x] = y\n\n n = int(input())\n for i in range(n):\n x, y = map(int, input().split())\n if x in chem: chem[x] = max(chem[x], y) \n else: chem[x] = y\n\n res = 0\n for _, x in chem.items():\n res += x\n\n print(res)\n", "n = int(input())\r\ns =set()\r\ns1 = set()\r\nd ={}\r\nd1={}\r\nsum=0\r\nfor i in range(n):\r\n a1,x1 = input().split()\r\n d[int(a1)]=int(x1)\r\n s.add(int(a1))\r\nm = int(input())\r\nfor i in range(m):\r\n a1,x1 = input().split()\r\n d1[int(a1)]=int(x1)\r\n s1.add(int(a1))\r\ns2= s&s1\r\ns = s - s2\r\ns1 = s1 - s2\r\nfor i in s:\r\n sum+=d[i]\r\nfor i in s1:\r\n sum+=d1[i]\r\nfor i in s2:\r\n sum+=max(d[i],d1[i])\r\nprint(sum)\r\n ", "from collections import defaultdict\r\n\r\nn = int(input())\r\ncost = defaultdict(int)\r\nfor _ in range(n):\r\n a, x = [int(x) for x in input().split()]\r\n cost[a] = max(cost[a], x)\r\n\r\nm = int(input())\r\n\r\nfor _ in range(m):\r\n a, x = [int(x) for x in input().split()]\r\n cost[a] = max(cost[a], x)\r\n\r\nprint(sum(cost.values()))\r\n", "from collections import defaultdict\r\n\r\nn = int(input())\r\na = defaultdict(int)\r\nfor i in range(n):\r\n u, v = [int(item) for item in input().split()]\r\n a[u] = v\r\nm = int(input())\r\nb = defaultdict(int)\r\nfor j in range(m):\r\n u, v = [int(item) for item in input().split()]\r\n b[u] = v\r\n\r\naa = sorted(a.keys(), reverse = True)\r\nbb = sorted(b.keys(), reverse = True)\r\n\r\naaa = []\r\nbbb = []\r\nanswer = 0\r\nfor i in range(n):\r\n if aa[i] not in b:\r\n answer += a[aa[i]]\r\n\r\nfor i in range(m):\r\n answer += max(a[bb[i]], b[bb[i]])\r\n\r\nprint(answer)\r\n", "import sys, collections\r\n\r\nres = dict()\r\nn = int(sys.stdin.readline())\r\nfor _ in range(n):\r\n a, b = map(int, sys.stdin.readline().split())\r\n res[a] = b\r\nm = int(sys.stdin.readline())\r\nfor _ in range(m):\r\n a, b = map(int, sys.stdin.readline().split())\r\n if a in res:\r\n res[a] = max(res[a], b)\r\n else:\r\n res[a] = b\r\nans = 0\r\nfor i in res:\r\n ans += res[i]\r\nprint(ans)", "n = int(input())\na, x = [None] * n, [None] * n\nfor i in range(n):\n a[i], x[i] = (int(i) for i in input().split())\nm = int(input())\nb, y = [None] * m, [None] * m\nfor i in range(m):\n b[i], y[i] = (int(i) for i in input().split())\nfirst = sorted(range(n), key=lambda i: (x[i], a[i]), reverse=True)\nsecond = sorted(range(m), key=lambda i: (y[i], b[i]), reverse=True)\nf = s = 0\nres, used = 0, set()\nwhile f < len(first) or s < len(second):\n if f < len(first) and s < len(second):\n if x[first[f]] >= y[second[s]]:\n i = first[f]\n if a[i] not in used:\n used.add(a[i])\n res += x[i]\n f += 1\n else:\n j = second[s]\n if b[j] not in used:\n used.add(b[j])\n res += y[j]\n s += 1\n elif f < len(first):\n i = first[f]\n if a[i] not in used:\n used.add(a[i])\n res += x[i]\n f += 1\n else:\n j = second[s]\n if b[j] not in used:\n used.add(b[j])\n res += y[j]\n s += 1\nprint(res)\n", "first_line = list(map(int, input().split()))\r\nn = first_line[0]\r\nchem_f_tuple = []\r\nfor i in list(range(n)):\r\n line = list(map(int, input().split()))\r\n chem_f_tuple.append((line[0], line[1]))\r\nfirst_line = list(map(int, input().split()))\r\nm = first_line[0]\r\n\r\nfor i in list(range(m)):\r\n line = list(map(int, input().split()))\r\n chem_f_tuple.append((line[0], line[1]))\r\n\r\nchem_f_tuple.sort(reverse=True)\r\nprevious_number = 0\r\nans = 0\r\nfor a, b in chem_f_tuple:\r\n if a != previous_number:\r\n ans += b\r\n previous_number = a\r\nprint(ans)", "n = int(input())\r\na, b = dict(), dict()\r\nfor _ in range(n):\r\n\tkey, value = map(int, input().split())\r\n\ta[key] = value\r\nm = int(input())\r\nfor _ in range(m):\r\n\tkey, value = map(int, input().split())\r\n\tb[key] = value\r\n\r\nfor key, value in b.items():\r\n\tif key in a:\r\n\t\tif b[key] > a[key]:\r\n\t\t\ta[key] = value\r\n\telse:\r\n\t\ta[key] = value\r\nprint(sum(a.values()))", "allchem = set()\r\nprices = dict()\r\nn = int(input())\r\nfor i in range(n):\r\n\ta, b = input().split(' ')\r\n\ta = int(a); b = int(b)\r\n\tallchem.add(a)\r\n\tprices[a] = b\r\nn = int(input())\r\nfor i in range(n):\r\n\ta, b = input().split(' ')\r\n\ta = int(a); b = int(b)\r\n\tallchem.add(a)\r\n\tif a in prices:\r\n\t\tprices[a] = max(prices[a], b)\r\n\telse:\r\n\t\tprices[a] = b\r\nsuma = 0\r\nallchem = list(allchem)\r\nfor i in range(len(allchem)):\r\n\tsuma += prices[allchem[i]]\r\nprint(suma)\r\n", "n = int(input())\r\ndictionary = {}\r\n\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n dictionary[x] = y\r\n\r\nn = int(input())\r\n\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n dictionary[x] = max(y, dictionary.get(x, 0))\r\n\r\nprint(sum(dictionary.values()))", "def main():\n dict_elements = {}\n\n for _ in range(int(input())):\n [element, price] = map(int, input().split())\n dict_elements[element] = price\n\n for _ in range(int(input())):\n [element, price] = map(int, input().split())\n dict_elements[element] = max(dict_elements.get(element, 0), price)\n\n print(sum(dict_elements.values()))\n\n\nif __name__ == '__main__':\n main()\n", "d1, d2 = {}, {}\r\n\r\nn = int(input())\r\n\r\nfor i in range(n):\r\n\tx = input().split()\r\n\t\r\n\td1[x[0]] = int(x[1])\r\n\r\ns1 = set(d1)\r\n\t\r\nm = int(input())\r\n\r\nfor i in range(m):\r\n\ty = input().split()\r\n\t\r\n\tif len(s1 & {y[0]}) != 1 or int(y[1]) > d1[y[0]]:\r\n\t\td2[y[0]] = int(y[1])\r\n\r\nd1.update(d2)\t\t\r\np = 0\r\n\r\nfor i in d1.values():\r\n\tp += i\r\n\t\r\nprint(p)\t", "daf = dict()\r\n\r\nn = int(input())\r\n\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n if a not in daf.keys():\r\n daf[a] = b\r\n else:\r\n daf[a] = max(daf[a], b)\r\n\r\nn = int(input())\r\n\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n if a not in daf.keys():\r\n daf[a] = b\r\n else:\r\n daf[a] = max(daf[a], b)\r\n\r\nhas = sum(list(daf.values()))\r\nprint(has)\r\n", "m = {}\r\nfor _ in range(2):\r\n for i in range(int(input())):\r\n a, b = map(int, input().split())\r\n m[a] = max(m.get(a, -1), b)\r\nprint(sum(m.values()))", "import sys\r\n#sys.stdin = open(\"2.in\") # COMMENT THIS BEFORE SUBMIT\r\ninput = sys.stdin.readline\r\n\r\nN = int(input())\r\nA = set()\r\nX = {}\r\nfor i in range(N):\r\n\ta,x = map(int,input().split())\r\n\tA.add(a)\r\n\tX[a] = x\r\nM = int(input())\r\nB = set()\r\nY = {}\r\nfor i in range(M):\r\n\tb,y = map(int,input().split())\r\n\tB.add(b)\r\n\tY[b] = y\r\n\r\ns1 = sum([X[x] for x in A - B])\r\ns2 = sum([Y[y] for y in B - A])\r\ns3 = sum([max(X[x],Y[x]) for x in A & B])\r\nprint(s1+s2+s3)", "from collections import defaultdict\n\n\nclass CodeforcesTask981BSolution:\n def __init__(self):\n self.result = ''\n self.n = 0\n self.first = []\n self.m = 0\n self.second = []\n\n def read_input(self):\n self.n = int(input())\n for _ in range(self.n):\n self.first.append([int(y) for y in input().split(\" \")])\n self.m = int(input())\n for _ in range(self.m):\n self.second.append([int(y) for y in input().split(\" \")])\n\n def process_task(self):\n top_income = defaultdict(int)\n income = 0\n for a in self.first + self.second:\n top_income[a[0]] = max(top_income[a[0]], a[1])\n income = sum(top_income.values())\n self.result = str(income)\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask981BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "def main():\n d = {}\n n = int(input())\n answer = 0\n for _ in range(n):\n a, b = [int(x) for x in input().split()]\n d[a] = b\n answer += b\n \n m = int(input())\n for _ in range(m):\n a, b = [int(x) for x in input().split()]\n if a in d:\n if b > d[a]:\n answer += b - d[a]\n else:\n answer += b\n \n print(answer)\n\n\nif __name__ == '__main__':\n main()", "import sys\nimport filecmp\nimport math\nFILE_IO = False\n\n\nif FILE_IO:\n input_stream = open('input_test.txt')\n sys.stdout = open('current_output2.txt', 'w')\nelse:\n input_stream = sys.stdin\n\nmap = {}\nn = int(input_stream.readline())\nfor _ in range(n):\n input_list = input_stream.readline().split()\n a , x = input_list\n map[int(a)] = int(x)\n\nm = int(input_stream.readline())\nfor _ in range(m):\n input_list = input_stream.readline().split()\n b , y = input_list\n exists = map.get(int(b)) \n if exists is not None:\n if exists < int(y):\n map[int(b)] = int(y)\n else:\n map[int(b)] = int(y)\n\n\nsum = 0\nfor key, val in map.items(): \n sum += val\n\n\nprint(sum)\n\n# if FILE_IO:\n # assert filecmp.cmp('current_output.txt','expected_output.txt',shallow=False) == True ", "n=int(input())\r\nlf={}\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n lf[x]=[]\r\n lf[x].append(y)\r\nm=int(input())\r\ns=0\r\nfor i in range(m):\r\n x,y=map(int,input().split())\r\n try:\r\n lf[x].append(y)\r\n except:\r\n lf[x]=[]\r\n lf[x].append(y)\r\n#print(lf)\r\nfor i in lf:\r\n s+=max(lf[i])\r\nprint(s)\r\n \r\n\r\n ", "import sys\r\n\r\ninput = sys.stdin.buffer.readline\r\n\r\nn = int(input())\r\na = [list(map(int, input().split())) for i in range(n)]\r\nm = int(input())\r\na += [list(map(int, input().split())) for j in range(m)]\r\na.sort()\r\nres = 0\r\nfor i in range(n+m-1):\r\n if a[i][0] == a[i+1][0]:\r\n continue\r\n else:\r\n res += a[i][1]\r\nres += a[-1][1]\r\nprint(res)", "d = {}\r\n\r\nn = int(input())\r\nfor i in range(n):\r\n num,pro = map(int,input().split())\r\n try:\r\n d[num] = max(d[num],pro)\r\n except:\r\n d[num]=pro\r\nm = int(input())\r\nfor i in range(m):\r\n num,pro = map(int,input().split())\r\n try:\r\n d[num] = max(d[num],pro)\r\n except:\r\n d[num]=pro\r\nans = 0 \r\nfor ele in d:\r\n ans+=d[ele]\r\nprint(ans)", "n=int(input())\r\nd={}\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n d[a]=b\r\nm=int(input())\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n if a in d:\r\n if d[a]<b:\r\n d[a]=b\r\n else:\r\n d[a]=b\r\ns=0\r\nfor i in d:\r\n s+=d[i]\r\nprint(s)", "# -*- coding: utf - 8 -*-\r\n\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\r\n| author: mr.math - Hakimov Rahimjon |\r\n| e-mail: [email protected] |\r\n| created: 27.05.2018 20:20 |\r\n\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\r\n# inp = open(\"input.txt\", \"r\"); input = inp.readline; out = open(\"output.txt\", \"w\"); print = out.write\r\nTN = 1\r\n\r\n\r\n# ===========================================\r\n\r\n\r\ndef solution():\r\n n = int(input())\r\n lst = []\r\n ax = {}\r\n for i in range(n):\r\n ai, x = map(int, input().split())\r\n lst.append(ai)\r\n ax[ai] = x\r\n m = int(input())\r\n by = {}\r\n for i in range(m):\r\n bi, y = map(int, input().split())\r\n lst.append(bi)\r\n by[bi] = y\r\n lst = set(lst)\r\n c = 0\r\n lst = list(lst)\r\n for i in lst:\r\n try:\r\n by[i]\r\n except:\r\n c += ax[i]\r\n else:\r\n try:\r\n ax[i]\r\n except:\r\n c += by[i]\r\n else:\r\n c += max(ax[i], by[i])\r\n print(c)\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\ndict1={}\r\nfor i in range(n):\r\n\ta,x=map(int,input().split())\r\n\tdict1[a]=[x]\r\nm=int(input())\r\nfor i in range(m):\r\n\ta,x=map(int,input().split())\r\n\ttry:\r\n\t\tdict1[a].append(x)\r\n\texcept:\r\n\t\tKeyError\r\n\t\tdict1[a]=[x]\r\nans=0\r\nfor i in dict1:\r\n\tans+=max(dict1[i])\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n=int(input())\nCF={}\nfor i in range(n):\n\tx=list(map(int,input().split()))\n\tCF[x[0]]=x[1]\nm=int(input())\nTC={}\nfor i in range(m):\n\tx=list(map(int,input().split()))\n\tTC[x[0]]=x[1]\nkeys_Tc=set(TC.keys())\nkeys_Cf=set(CF.keys())\ncommon=keys_Cf&keys_Tc\ns=0\nfor x in TC:\n\tif x not in common:\n\t\ts+=TC[x]\nfor x in CF:\n\tif x not in common:\n\t\ts+=CF[x]\nfor x in common:\n\ts+=max(CF[x],TC[x])\nprint(s)", "cforce_count = int(input())\n\nc_dic = {}\nfor _ in range(cforce_count):\n arr = input().split()\n c_dic[int(arr[0])] = int(arr[1])\n\ntchem_count = int(input())\n\nt_dic = {}\nfor _ in range(tchem_count):\n arr = input().split()\n t_dic[int(arr[0])] = int(arr[1])\n\ntotal = 0\n\nfor key, val in c_dic.items():\n if key in t_dic and t_dic[key] > val:\n continue\n elif key in t_dic and t_dic[key] <= val:\n del(t_dic[key])\n total += val\n else:\n total += val\n\nfor key, val in t_dic.items():\n total += val\n\nprint(\"%d\" %(total))\n", "n = int(input())\r\ncf = {}\r\nsum = 0\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n cf[a] = b\r\n sum += b\r\nm = int(input())\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n if a in cf:\r\n if cf.get(a) < b:\r\n sum -= cf.get(a)\r\n cf[a] = b\r\n sum += b\r\n else:\r\n cf[a] = b\r\n sum += b\r\nprint(sum)", "n=int(input())\r\ndic={}\r\nfor k in range(n):\r\n a=[int(q) for q in input().strip().split()]\r\n dic[a[0]]=a[1]\r\nn=int(input())\r\nfor k in range(n):\r\n a=[int(q) for q in input().strip().split()]\r\n if a[0] in dic:\r\n if dic[a[0]]<a[1]:\r\n dic[a[0]]=a[1]\r\n else:\r\n dic[a[0]]=a[1]\r\nsum=0\r\nfor k in dic:\r\n sum+=dic[k]\r\nprint(sum)", "from bisect import bisect_left as bs\r\nif __name__ == \"__main__\":\r\n d1, d2 = {}, {}\r\n total = 0\r\n for _ in range(int(input().strip())):\r\n x, y = [int(i) for i in input().strip().split()]\r\n total += y\r\n d1[x] = y\r\n for _ in range(int(input().strip())):\r\n x, y = [int(i) for i in input().strip().split()]\r\n total += y\r\n d2[x] = y\r\n for i in d1:\r\n if i in d2:\r\n total -= min(d1[i], d2[i])\r\n print(total)\r\n", "d={}\r\nn=int(input())\r\nfor _ in range(n):\r\n a,b=map(int,input().split())\r\n d[a]=b\r\nm=int(input())\r\nfor _ in range(m):\r\n a,b=map(int,input().split())\r\n if(a in d and b>d[a]):\r\n d[a]=b\r\n elif(a not in d):\r\n d[a]=b\r\ns=0\r\nfor i in d:\r\n s+=d[i]\r\nprint(s)\r\n", "first=int(input())\r\nfirstval=dict()\r\nfor i in range(first):\r\n set=(input()).split()\r\n set=[int(q) for q in set]\r\n firstval[set[0]]=set[1]\r\nsecond=int(input())\r\nsecval=dict()\r\nfor i in range(second):\r\n set=(input()).split()\r\n set=[int(q) for q in set]\r\n if set[0] in firstval:\r\n if firstval[set[0]]<set[1]:\r\n secval[set[0]]=set[1]\r\n firstval[set[0]]=0\r\n else:\r\n secval[set[0]]=set[1]\r\nres=0\r\nfor i in firstval:\r\n res+=firstval[i] \r\nfor j in secval:\r\n res+=secval[j] \r\nprint(res)", "e = {}\r\nn = int(input())\r\nsum = 0\r\nfor i in range(n) :\r\n x,price = [int(x) for x in input().split()]\r\n e[x]= price\r\n sum += price\r\n\r\nm = int(input())\r\nfor i in range(m) :\r\n x,price = [int(x) for x in input().split()]\r\n a = e.get(x , False ) \r\n if a :\r\n if e[x] < price :\r\n sum -= e[x]\r\n sum += price\r\n else :\r\n sum += price\r\n\r\nprint(sum)\r\n\r\n", "MyDict = {}\r\nX = int(input())\r\nfor i in range(X):\r\n Temp = list(map(int, input().split()))\r\n MyDict[Temp[0]] = Temp[1]\r\nX = int(input())\r\nfor i in range(X):\r\n Temp = list(map(int, input().split()))\r\n MyDict[Temp[0]] = max(Temp[1], MyDict[Temp[0]]) if Temp[0] in MyDict.keys() else Temp[1]\r\nprint(sum(MyDict.values()))\r\n\r\n# UB_CodeForces\r\n# Advice: Every person have some powers that he might not know yet,\r\n# try to find your powers\r\n# Location: Under the shadow of God\r\n# Caption: Loving my life\r\n", "n = int(input())\r\nax = dict()\r\nfor i in range(n):\r\n d = (input().split())\r\n ax[d[0]] = d[1]\r\nans = ax\r\nm = int(input())\r\nby = dict()\r\nfor i in range(m):\r\n d = (input().split())\r\n by[d[0]] = d[1]\r\n try:\r\n if int(ans[d[0]]) < int(d[1]):\r\n ans[d[0]] = d[1]\r\n except:\r\n ans[d[0]] = d[1]\r\ns = 0\r\nfor _ in ans.keys():\r\n s += int(ans[_])\r\nprint(s)\n# Thu Jul 07 2022 09:19:14 GMT+0000 (Coordinated Universal Time)\n", "n=int(input())\r\nk=0\r\nd={}\r\nfor i in range(n) :\r\n a,b=map(int,input().split())\r\n d[a]=b\r\nm=int(input())\r\nfor i in range(m) :\r\n a,b=map(int,input().split())\r\n d[a]=max( d.get(a,0),b)\r\nfor x in d :\r\n k+=d[x]\r\nprint(k)\r\n\r\n \r\n \r\n", "n = int(input())\r\n\r\na = {}\r\nb = {}\r\n\r\na_sum = 0\r\nb_sum = 0\r\n\r\nfor i in range(0,n):\r\n s = input().split()\r\n a[s[0]] = int(s[1])\r\n a_sum += int(s[1])\r\n\r\nm = int(input())\r\n\r\nfor i in range(0,m):\r\n s = input().split()\r\n b[s[0]] = int(s[1])\r\n b_sum += int(s[1])\r\n\r\nintersect = set(a.keys()).intersection(b.keys())\r\n\r\nfor el in intersect:\r\n if a[el] > b[el]:\r\n b_sum = b_sum - b[el]\r\n elif b[el] > a[el]:\r\n a_sum = a_sum - a[el]\r\n elif a[el] == b[el]:\r\n a_sum = a_sum - a[el]\r\n\r\nprint(a_sum+b_sum)", "n = int(input())\nc = []\ncc = []\nfor i in range(n):\n lee = input().split(\" \")\n c.append(int(lee[0]))\n cc.append(int(lee[1]))\nj = 0\nm = int(input())\nd = []\ndd = []\nfor i in range(m):\n lee = input().split(\" \")\n d.append(int(lee[0]))\n dd.append(int(lee[1]))\nlista= sorted(zip(c+d, cc+dd))\nsum = 0\ni =0\nwhile i < len(lista):\n if i < len(lista)-1:\n if lista[i][0] ==lista[i+1][0]:\n if (lista[i][1]>lista[i+1][1]):\n sum = sum + lista[i][1]\n else:\n sum = sum + lista[i+1][1]\n i = i+1\n else:\n sum = sum + lista[i][1]\n else:\n sum = sum + lista[len(lista)-1][1]\n i = i+1\nprint(sum)\n\t \t \t \t\t\t\t \t\t \t\t \t\t\t \t\t \t\t", "se = set()\r\nn = int(input())\r\ncf = {}\r\nfor i in range(n):\r\n a,x = [int(s) for s in input().split()]\r\n cf[a] = x\r\n se.add(a)\r\nm = int(input())\r\ntc = {}\r\nfor i in range(m):\r\n b,y = [int(s) for s in input().split()]\r\n tc[b] = y\r\n se.add(b)\r\n\r\nsum = 0\r\nfor e in se:\r\n sum += max(cf.get(e, 0), tc.get(e, 0))\r\n\r\nprint(sum)", "n1 = int(input())\r\ncf ={}\r\nresult = 0\r\nfor i in range(0,n1):\r\n str_in = input()\r\n num = [int(n) for n in str_in.split()]\r\n cf[num[0]] = num[1]\r\n result += num[1]\r\nn2 = int(input())\r\nfor i in range(0,n2):\r\n str_in = input()\r\n num = [int(n) for n in str_in.split()]\r\n if num[0] in cf:\r\n if num[1] > cf[num[0]]:\r\n result = result + num[1] - cf[num[0]]\r\n del cf[num[0]]\r\n continue\r\n result += num[1]\r\nprint(result)\r\n", "t1=int(input())\r\nl=[]\r\ncost=[]\r\ncount=0\r\ndata={}\r\nfor i in range(t1):\r\n n,k = map(int,input().strip().split())\r\n if n not in data:\r\n count=count+1\r\n data.update({n:k})\r\n else:\r\n if k>data[n]:\r\n data[n]=k\r\n\r\nt2=int(input())\r\nfor i in range(t2):\r\n n,k = map(int,input().strip().split())\r\n if n not in data:\r\n count=count+1\r\n data.update({n:k})\r\n else:\r\n if k>data[n]:\r\n data[n]=k\r\n\r\nfor r in data.keys():\r\n l.append(data[r])\r\n\r\nprint(sum(l))\r\n", "I=lambda:map(int,input().split())\r\nt={}\r\n\r\nfor _ in range(int(input())):\r\n a,x=I()\r\n t[a]=x\r\n\r\nfor _ in range(int(input())):\r\n b,y=I()\r\n if b in t:\r\n t[b]=max(t[b],y)\r\n else:\r\n t[b]=y\r\n\r\nprint(sum(t.values()))", "I = lambda: map(int, input().split())\r\n\r\nh = {}\r\n\r\nfor _ in range(int(input())):\r\n a, x = I()\r\n h[a] = x\r\n\r\nfor _ in range(int(input())):\r\n b, y = I()\r\n h[b] = max(h[b], y) if b in h else y\r\n\r\nprint(sum(h.values()))", "def solve(num_a, num_b, a_map, b_map):\r\n\ta_indices = list(a_map.keys())\r\n\ta_indices.sort()\r\n\tb_indices = list(b_map.keys())\r\n\tb_indices.sort()\r\n\r\n\ta_idx = 0\r\n\tb_idx = 0\r\n\taval_subset = []\r\n\tbval_subset = []\r\n\twhile (a_idx < len(a_indices) and b_idx < len(b_indices)):\r\n\r\n\t\t# If they are equal put the larger value and increment both of indices.\r\n\t\tif (a_indices[a_idx] == b_indices[b_idx]):\r\n\r\n\t\t\tif (a_map[a_indices[a_idx]] > b_map[b_indices[b_idx]]):\r\n\t\t\t\t#put A\r\n\t\t\t\taval_subset.append(a_map[a_indices[a_idx]])\r\n\t\t\telse:\r\n\t\t\t\t#put B\r\n\t\t\t\tbval_subset.append(b_map[b_indices[b_idx]])\r\n\t\t\ta_idx += 1\r\n\t\t\tb_idx += 1\r\n\r\n\t\telif (a_indices[a_idx] < b_indices[b_idx]):\r\n\t\t\t# put a and increment its idx.\r\n\t\t\taval_subset.append(a_map[a_indices[a_idx]])\r\n\t\t\ta_idx += 1\r\n\r\n\t\telse:\r\n\t\t\t#put b and increment its idx.\r\n\t\t\tbval_subset.append(b_map[b_indices[b_idx]])\r\n\t\t\tb_idx += 1\r\n\r\n\t#Put remainig values.\r\n\twhile (a_idx < len(a_indices)):\r\n\t\taval_subset.append(a_map[a_indices[a_idx]])\r\n\t\ta_idx += 1\r\n\r\n\twhile (b_idx < len(b_indices)):\r\n\t\tbval_subset.append(b_map[b_indices[b_idx]])\r\n\t\tb_idx += 1\r\n\r\n\treturn sum(aval_subset) + sum(bval_subset)\r\n\r\n\r\n\r\n\r\nnum_discovered_a = int(input())\r\na_mapping = {}\r\nfor x1 in range(num_discovered_a):\r\n\tidx, val = map(int, input().split())\r\n\ta_mapping[idx] = val\r\n\r\n\r\nnum_discovered_b = int(input())\r\nb_mapping = {}\r\nfor x2 in range(num_discovered_b):\r\n\tidx, val = map(int, input().split())\r\n\tb_mapping[idx] = val\r\n\r\n\r\nprint(solve(num_discovered_a, num_discovered_b, a_mapping, b_mapping))\r\n\r\n\r\n", "def main():\n n = int(input())\n a = set()\n x = dict()\n for _ in range(n):\n ele, inc = map(int, input().split())\n a.add(ele)\n x[ele] = inc\n\n m = int(input())\n b = set()\n y = dict()\n for _ in range(m):\n ele, inc = map(int, input().split())\n b.add(ele)\n y[ele] = inc\n\n both = a & b\n only_a = a - both\n only_b = b - both\n\n income = 0\n income += sum((x[ele] for ele in only_a))\n income += sum((y[ele] for ele in only_b))\n income += sum((max(x[ele], y[ele]) for ele in both))\n\n print(income)\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\r\nd = {}\r\nfor _ in range(n):\r\n a, x = map(int, input().split())\r\n d[a] = x\r\nm = int(input())\r\nfor _ in range(m):\r\n b, y = map(int, input().split())\r\n d[b] = max(d.get(b, 0), y)\r\nprint(sum(d.values()))", "d1={}\nd2={}\ns=set()\nsumm=0\n\nn = int(input())\nfor i in range(n):\n c, v=map(int, input().split())\n d1[c]=v\n s.add(c)\n\nn = int(input())\nfor i in range(n):\n c, v=map(int, input().split())\n d2[c]=v\n s.add(c)\n\nfor i in s:\n if d1.get(i,0)>d2.get(i,0):\n summ+=d1[i]\n else:\n summ+=d2[i]\n\nprint(summ)\n\n# Sun Dec 11 2022 18:52:13 GMT+0300 (Moscow Standard Time)\n", "R=lambda:list(map(int,input().split()))\r\nd={}\r\nfor i in range(int(input())):\r\n\tn,m=R();d[n]=m\r\nfor i in range(int(input())):\r\n\tk,l=R()\r\n\tif k in d:d[k]=max(d[k],l)\r\n\telse:d[k]=l\r\nprint(sum(d.values()))", "n = int(input())\r\nd = {}\r\nfor i in range(n):\r\n\ta,x = map(int,input().split())\r\n\td[a] = x\r\nm = int(input())\r\nfor i in range(m):\r\n\tb,y = map(int,input().split())\r\n\tif(b in d):\r\n\t\tif(d[b]<y):\r\n\t\t\td[b] = y\r\n\telse:\r\n\t\td[b] = y\r\nans = 0\r\nfor key,value in d.items():\r\n\tans += value\r\nprint(ans)\r\n\r\n", "import sys, math, os.path\r\n\r\nFILE_INPUT = \"B.in\"\r\nDEBUG = os.path.isfile(FILE_INPUT)\r\nif DEBUG: \r\n sys.stdin = open(FILE_INPUT) \r\n\r\ndef ni():\r\n return map(int, input().split(\" \"))\r\n\r\ndef nia(): \r\n return list(map(int,input().split()))\r\n\r\ndef log(x):\r\n if (DEBUG):\r\n print(x)\r\n\r\nn, = ni()\r\nll = {}\r\nfor i in range(n):\r\n a, x = ni()\r\n ll[a] = x \r\n\r\nm, = ni()\r\nfor j in range(m):\r\n b,y = ni()\r\n if (b in ll):\r\n ll[b] = max(ll[b], y) \r\n else:\r\n ll[b] = y \r\n\r\ns = 0\r\n\r\nfor v in ll.values():\r\n s += v\r\n\r\nprint(s)" ]

[ "R = lambda: map(int, input().split())\nn = int(input())\na = list(R())\nm = int(input())\nb = list(R())\nst = i = j = 0\nres = ''\nwhile i < m:\n psum = 0\n while j < n and psum < b[i]:\n psum += a[j]\n j += 1\n if psum != b[i]:\n print('NO')\n exit(0)\n mi = st if a[st] > a[j - 1] else j - 1\n for k in range(st, j - 1):\n if (a[k] > a[k - 1] or a[k] > a[k + 1]) and a[k] >= a[mi]:\n mi = k\n psum = a[mi]\n l, r = mi - 1, mi + 1\n while psum != b[i]:\n if l >= st and psum > a[l]:\n res += str(i + l - st + 2) + ' L\\n'\n psum += a[l]\n l -= 1\n elif r < j and psum > a[r]:\n res += str(i + l - st + 2) + ' R\\n'\n psum += a[r]\n r += 1\n else:\n print('NO')\n exit(0)\n st = j\n i += 1\nif i != m or j != n:\n print('NO')\nelse:\n print('YES')\n print(res)", "import math,sys,bisect,heapq\r\nfrom collections import defaultdict,Counter,deque\r\nfrom itertools import groupby,accumulate\r\n#sys.setrecursionlimit(200000000)\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\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\n\r\nN = int(input())\r\nA = alele()\r\nkk = int(input())\r\nB = alele()\r\nAns =[]\r\nif sum(A) != sum(B):\r\n Y(0)\r\nelse:\r\n for i in range(kk):\r\n x = B[i]\r\n j = i;tot= 0\r\n while j < len(A) and tot < x:\r\n tot += A[j]\r\n j += 1\r\n if tot != x:\r\n Y(0);exit(0)\r\n for k in range(j-i-1):\r\n m = max(A[i:j-k])\r\n for l in range(i,j-k):\r\n if A[l] == m:\r\n if l > i and A[l] > A[l-1]:\r\n Ans.append((l+1,'L'))\r\n A[l] += A[l-1]\r\n A= A[:l-1] +A[l:]\r\n break\r\n elif l < j-k-1 and A[l] > A[l+1]:\r\n Ans.append((l+1,'R'))\r\n A[l] += A[l+1]\r\n A = A[:l+1] + A[l+2:]\r\n break\r\n if len(Ans) ==N-kk:\r\n Y(1)\r\n for i,j in Ans:\r\n print(i,j)\r\n else:\r\n Y(0)\r\n \r\n \r\n ", "f = lambda: list(map(int, input().split()))\r\n\r\ndef g(i, j, k):\r\n z = y = i\r\n for x in range(i, j):\r\n if a[x] > a[y]: y = x\r\n if y > i: z = y\r\n else:\r\n while a[y] == a[i]:\r\n y += 1\r\n if y == j: return []\r\n y -= 1\r\n l = [str(k + y - x) + ' L' for x in range(i, y)]\r\n r = [str(k + y - z) + ' R' for x in range(y + 1, j)]\r\n return r + l if z == i else l + r\r\n\r\nn, a, m, b = f()[0], f(), f()[0], f()\r\nd = ['YES']\r\n\r\ns = i = k = 0\r\nfor j, q in enumerate(a, 1):\r\n s += q\r\n if k < m and s == b[k]:\r\n d += g(i, j, k + 1)\r\n s, i, k = 0, j, k + 1\r\n\r\nprint('\\n'.join(d) if len(d) + m > n and k == m else 'NO')" ]

[ "#!/usr/bin/env python3\nfrom sys import stdin, stdout\n\ndef rint():\n return map(int, stdin.readline().split())\n#lines = stdin.readlines()\n\n\nt = int(input())\n\nfor _ in range(t):\n n = int(input())\n lb, rb = 0, 0\n ct = 0\n ans = []\n for __ in range(n):\n lc, rc = rint()\n if lc >= ct:\n ans.append(lc)\n ct = lc+1\n elif ct <= rc:\n ans.append(ct)\n ct += 1\n else:\n ans.append(0)\n\n print(*ans)\n", "tc = int(input())\r\nfor tid in range(tc):\r\n\tn = int(input())\r\n\ta = []\r\n\tfor i in range(n):\r\n\t\ta.append(tuple(map(int, input().split())))\r\n\tb = []\r\n\tp = 0\r\n\tfor t in range(1, int(5e3 + 1)):\r\n\t\twhile (p < n and a[p][1] < t):\r\n\t\t\tb.append(0)\r\n\t\t\tp += 1\r\n\t\tif (p == n):\r\n\t\t\tbreak\r\n\t\tif (a[p][0] > t):\r\n\t\t\tcontinue\r\n\t\tb.append(t)\r\n\t\tp += 1\r\n\tprint(' '.join(map(str, b)))", "t=int(input())\n\nfor i in range(t):\n\n\tn=int(input())\n\n\ta=[None]*n\n\n\tsec=a[0]=int(input().split()[0])\n\n\tfor j in range(1,n):\n\n\t\tl,r=map(int,input().split())\n\n\t\tif sec<r:\n\n\t\t\ta[j]=sec=max(sec+1,l)\n\n\t\telse:\n\n\t\t\ta[j]=0\n\n\tprint(' '.join(list(map(str,a))))\n\n\n\n# Made By Mostafa_Khaled", "t=int(input())\r\nf=0\r\nfor o in range(0,t):\r\n q=int(input())\r\n s=[]\r\n for oo in range(0,q):\r\n l,r=map(int,input().split())\r\n if f>=r:\r\n s.append(0)\r\n else:\r\n f=max([f+1,l])\r\n s.append(f)\r\n f=0\r\n for i in s:\r\n print(i,end=\" \")", "import heapq\n\ndef tea_list(students):\n teatimes = [0] * len(students)\n events = []\n for i, (a, l) in enumerate(students):\n events.append((a, 0, (a, i, l)))\n heapq.heapify(events)\n queue_len = 0\n while events:\n t, etype, e = heapq.heappop(events)\n if etype == 0:\n a, i, l = e\n if a + queue_len <= l:\n heapq.heappush(events, (a + queue_len, 1, i))\n queue_len += 1\n elif etype == 1:\n queue_len -= 1\n teatimes[e] = t\n return teatimes\n\n \n\ndef main():\n T = int(input())\n for _ in range(T):\n N = int(input())\n students = [tuple(int(x) for x in input().split()) for _ in range(N)]\n print(*tea_list(students))\n\nif __name__ == '__main__':\n main()\n", "import queue\r\nt = int(input())\r\nfor i in range(t):\r\n n = int(input())\r\n q = queue.Queue()\r\n answer = []\r\n current_sec = 1\r\n for j in range(n):\r\n s = input().split(\" \")\r\n l = int(s[0])\r\n r = int(s[1])\r\n\r\n while l > current_sec:\r\n if not q.empty():\r\n time = q.get()\r\n if time >= current_sec:\r\n answer.append(str(current_sec))\r\n current_sec += 1\r\n else:\r\n answer.append(\"0\")\r\n else:\r\n current_sec = l\r\n\r\n\r\n if l == current_sec:\r\n q.put(r)\r\n\r\n while not q.empty():\r\n time = q.get()\r\n if time >= current_sec:\r\n answer.append(str(current_sec))\r\n current_sec += 1\r\n else:\r\n answer.append(\"0\")\r\n\r\n\r\n res = \" \".join(answer)\r\n print(res)", "for _ in range(int(input())):\r\n n = int(input())\r\n q = []\r\n time = 0\r\n for i in range(n):\r\n s,e = map(int,input().split())\r\n q.append([s,e])\r\n\r\n\r\n\r\n while q:\r\n\r\n if q[0][1] >= time:\r\n x,y = q.pop(0)\r\n time = max(time + 1, x)\r\n print(time,end=' ')\r\n\r\n \r\n while q and q[0][1] <= time:\r\n q.pop(0)\r\n print(0,end=' ')\r\n\r\n\r\n \r\n print()\r\n \r\n ", "class Queue:\r\n def __init__(self):\r\n self.queue = []\r\n\r\n def push(self, dado):\r\n self.queue.append(dado)\r\n\r\n def pop(self):\r\n self.queue.pop(0)\r\n\r\n def top(self):\r\n return self.queue[0]\r\n \r\n def isEmpty(self):\r\n return len(self.queue) == 0\r\n\r\n\r\nt = int(input())\r\nfor testes in range(t):\r\n n = int(input())\r\n fila = Queue()\r\n for i in range(n):\r\n li, ri = map(int, input().split())\r\n fila.push((li, ri))\r\n\r\n tempo_atual = fila.top()[0]\r\n while not fila.isEmpty():\r\n aluno = fila.top()\r\n fila.pop()\r\n saiu = False\r\n if tempo_atual < aluno[0]:\r\n tempo_atual = aluno[0]\r\n\r\n if tempo_atual > aluno[1]:\r\n saiu = True\r\n print(0, end= \" \")\r\n else:\r\n print(tempo_atual, end= \" \")\r\n\r\n if not saiu:\r\n tempo_atual += 1\r\n \r\n print()\r\n", "test_cases = int(input())\r\nfor i in range(test_cases):\r\n number_students = int(input())\r\n resp = [None]*number_students\r\n lista = []\r\n for j in range(number_students):\r\n position, waiting_time = [int(x) for x in input().split()]\r\n tupla = tuple((position,j, waiting_time))\r\n lista.append(tupla)\r\n lista.sort()\r\n time = 1\r\n for valor in lista:\r\n if time <= valor[0]:\r\n time = valor[0] + 1\r\n resp[valor[1]] = time -1\r\n elif time > valor[2]:\r\n resp[valor[1]] = 0\r\n else:\r\n time += 1\r\n resp[valor[1]] = time - 1\r\n for e in resp:\r\n print(e, end= ' ')\r\n\r\n", "t = int(input())\r\n# a = [0]*300\r\nwhile t > 0:\r\n t -= 1\r\n n = int(input())\r\n nowt = 1\r\n for i in range(n):\r\n l, r = map(int, input().split())\r\n if l > nowt:\r\n nowt = l\r\n if r >= nowt:\r\n print('%d ' % nowt, end='')\r\n nowt += 1\r\n else:\r\n print('0 ', end='')\r\n print()\r\n", "t = int(input())\r\n\r\nfor _ in range(t):\r\n n = int(input())\r\n lims = [tuple(int(v) for v in input().split()) for _ in range(n)]\r\n ctime = 0\r\n ans = []\r\n for l, r in lims:\r\n if l >= ctime:\r\n ans.append(l)\r\n ctime = l + 1\r\n elif r < ctime:\r\n ans.append(0)\r\n else:\r\n ans.append(ctime)\r\n ctime += 1\r\n print(' '.join(str(v) for v in ans))\r\n", "n=int(input())\r\nfor i in range(n):\r\n m=int(input())\r\n t=0\r\n d=[]\r\n for i in range(m):\r\n a,b=map(int,input().split())\r\n t=max(t+1,a)\r\n if t>b:\r\n d.append(0)\r\n t-=1\r\n else:\r\n d.append(t)\r\n print(*d)", "def main():\n cases = int(input())\n for i in range(cases):\n students = int(input())\n x, g = 0, 0\n result = list()\n for j in range(students):\n left, right = list(map(int, str(input()).split(\" \")))\n if g < left:\n g = left + 1\n x = left\n elif g <= right:\n x = g\n g += 1\n else:\n x = 0\n result.append(x)\n print(*result)\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", "def sol():\r\n n = int(input())\r\n a = []\r\n x, y = map(int, input().split())\r\n a.append(x)\r\n p = x\r\n for i in range(n-1):\r\n x, y = map(int, input().split())\r\n k = max(p+1, x)\r\n if k > y:\r\n a.append(0)\r\n else:\r\n a.append(k)\r\n p = k\r\n print(*a)\r\n\r\n\r\nt = int(input())\r\nfor i in range(t):\r\n sol()", "from collections import defaultdict\r\nimport math\r\nfrom sys import stdin\r\n\r\ncasenumber = int(stdin.readline())\r\nmydict=defaultdict(list)\r\noutput=[]\r\nfor i in range(casenumber):\r\n n_student = int(stdin.readline())\r\n outputlist=[]\r\n l=[]\r\n r=[]\r\n for n in range(n_student):\r\n string1 = stdin.readline().strip().split()\r\n l_n=int(string1[0])\r\n r_n=int(string1[1])\r\n if l_n>len(l):\r\n for count in range(l_n-len(l)):\r\n l.append(0)\r\n l.append(r_n)\r\n \r\n else:\r\n l.append(r_n)\r\n if (len(l)-1)<=(r_n):\r\n outputlist.append(len(l)-1)\r\n else:\r\n outputlist.append(0)\r\n l.pop()\r\n output.append(outputlist)\r\n\r\nfor i in range(casenumber):\r\n for j in range(len(output[i])):\r\n print(output[i][j],end=\" \")\r\n print('')\r\n\r\n\r\n", "t = int(input())\r\nfor i in range(t):\r\n n = int(input())\r\n students = []\r\n for i in range(n):\r\n students.append(list(map(int, input().split()))) \r\n time = 0\r\n ans = []\r\n for i in students:\r\n l = i[0]\r\n r = i[1]\r\n if r < time:\r\n ans.append(0)\r\n continue\r\n else:\r\n ans.append(max(time, l))\r\n time = max(time + 1, l + 1)\r\n print(*ans)", "class Queue:\n def __init__(self):\n self.items = []\n\n # colocar elementos na fila\n def enqueue(self, item):\n self.items.insert(0,item)\n\n # retirar elementos da fila\n def dequeue(self):\n self.items.pop()\n\n # retorna o tamanho da fila\n def size(self):\n return len(self.items)\n \n # verifica se a fila esta vazia ou nao\n def empty(self):\n return self.size() == 0\n\n # retorna o primeiro elemento da fila\n def front(self):\n return self.items[self.size() - 1]\n \nt = int(input())\nfor caso_teste in range(t):\n n = int(input())\n\n # cria a fila\n fila = Queue()\n\n for estudante in range(n):\n li,ri = map(int, input().split())\n # coloca na fila a tupla (tempo de chegada, tempo de saida)\n fila.enqueue((li,ri))\n\n #vetor de resposta\n ans = []\n\n tempo = 1\n while not fila.empty():\n # pegua o i-esimo estudante\n entrada, saida = fila.front()\n # tira da fila\n fila.dequeue()\n\n # verifica se o tempo esta \"desatualizado\" com sua chegada\n if tempo < entrada: tempo = entrada\n\n # verifica se o estudante ja saiu da fila ou nao\n if tempo > saida: ans.append(0)\n else:\n # caso contrario adiociona o tempo em que foi atendido\n ans.append(tempo)\n\n # aumenta o tempo\n tempo += 1\n\n # printa a resposta\n print(*ans)\n", "t = int(input())\nwhile(t):\n\tn = int(input())\n\tbeg = [None] * n\n\ten = [None] * n\n\tfor i in range (n):\n\t\tbeg[i], en[i] = map(int, input().split())\n\tst = 1;\n\tfor i in range (n):\n\t\tif(en[i]>=st):\n\t\t\tif(beg[i]>st):\n\t\t\t\tprint(beg[i], end = ' ')\n\t\t\t\tst=beg[i]\n\t\t\telse:\n\t\t\t\tprint(\"{}\".format(st), end = ' ')\n\t\t\tst+=1\n\t\telse:\n\t\t\tprint('0', end = ' ')\n\tprint(\"\")\n\tt-=1\n\t \t \t \t \t \t \t \t\t\t\t \t\t \t\t", "# Imports\r\n\r\n\r\n##############################################\r\n# Input\r\n\r\nt = int(input())\r\n##############################################\r\n# Timer start\r\nfrom time import time\r\nstart_time = time()\r\n##############################################\r\n# Main code\r\n\r\n\r\nfor tt in range(t):\r\n n = int(input())\r\n\r\n stud = []\r\n for nn in range(n):\r\n s = tuple(map(lambda x:int(x), input().split()))\r\n stud.append(s)\r\n\r\n res = 0\r\n for i in range(n):\r\n (l, r) = stud[i]\r\n if i == 0:\r\n res = l + 1\r\n print(l, end=\" \")\r\n continue\r\n\r\n newres = max(l, res)\r\n if newres > r: # go out\r\n res = newres\r\n print(0, end=\" \")\r\n else:\r\n print(newres, end=\" \")\r\n res = newres + 1\r\n\r\n print()\r\n\r\n\r\n\r\n\r\n\r\n", "import io, os\r\ninput = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\nfrom sys import stdout\r\nprint = stdout.write\r\n\r\n\r\nfor _ in range(int(input())):\r\n\tans = []\r\n\tt = 1\r\n\tfor _ in range(int(input())):\r\n\t\tl, r = map(int, input().split())\r\n\t\tif l <= t:\r\n\t\t\tif r >= t:\r\n\t\t\t\tans.append(str(t))\r\n\t\t\t\tt += 1\r\n\t\t\telse:\r\n\t\t\t\tans.append('0')\r\n\t\telse:\r\n\t\t\tans.append(str(l))\r\n\t\t\tt = l+1\r\n\tprint(' '.join(ans) + '\\n')", "t=int(input())\r\nfor i in range(t):\r\n n=int(input())\r\n tm=1\r\n x=0\r\n l1=[]\r\n while(x<n):\r\n l,r=input().split()\r\n l=int(l)\r\n r=int(r)\r\n if(l>tm):\r\n tm=l\r\n elif(tm>r):\r\n l1.append(0)\r\n x=x+1\r\n continue\r\n l1.append(tm)\r\n tm=tm+1\r\n x=x+1\r\n c=0\r\n while(c<n):\r\n print(l1[c],end=\" \")\r\n c=c+1\r\n", "n=int(input())\r\nt=0\r\nfor x in range(n):\r\n p=int(input())\r\n ol=[]\r\n sl=[]\r\n na=[]\r\n ki=[]\r\n pi=[]\r\n t=0\r\n for y in range(p):\r\n v,c=list(map(int,input().split()))\r\n ol.append(v)\r\n sl.append(c)\r\n for z in range(p):\r\n sam=min(ol)\r\n kp=ol.index(sam)\r\n pi.append(kp)\r\n if t<min(ol):\r\n t=min(ol)+1\r\n ki.append(min(ol))\r\n ol[kp]=5555555\r\n elif t==min(ol):\r\n t+=1\r\n ki.append(min(ol))\r\n ol[kp]=55555555\r\n else:\r\n if sl[kp]>=t:\r\n ki.append(t)\r\n t+=1\r\n ol[kp]=555555555\r\n else:\r\n ki.append(0)\r\n ol[kp]=55555555\r\n for r in range(0,p):\r\n oll=pi.index(r)\r\n na.append(ki[oll])\r\n print(*na)", "from collections import deque\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nt = int(input())\r\nm = 5000\r\nfor _ in range(t):\r\n n = int(input())\r\n x = [[] for _ in range(m + 1)]\r\n for i in range(n):\r\n l, r = map(int, input().split())\r\n x[l].append((r, i))\r\n ans = [0] * n\r\n q = deque()\r\n for l in range(1, m + 1):\r\n for r, i in x[l]:\r\n q.append((r, i))\r\n while q:\r\n r, i = q.popleft()\r\n if l <= r:\r\n ans[i] = l\r\n break\r\n print(*ans)", "for j in range(int(input())):\n timeLastPour = 0\n result = []\n for i in range(int(input())):\n l, r = [int(f) for f in input().split(' ') if f]\n if timeLastPour <= r:\n timeLastPour = max(timeLastPour, l)\n result.append(timeLastPour)\n timeLastPour += 1\n else:\n result.append(0)\n print(*result)\n", "read = lambda: map(int, input().split())\nT = int(input())\nfor ____ in range(T):\n n = int(input())\n a = []\n for _ in range(n):\n a.append(list(read()))\n t = 0\n while a:\n b = a[0][0]\n if b >= t:\n t = b\n print('%d ' % t, end='')\n else:\n if t > a[0][1]:\n print('0 ', end='')\n del a[0]\n continue\n else:\n print('%d ' % t, end='')\n t += 1\n del a[0]\n print()\n", "def solve(students):\r\n k = 1\r\n for s in students:\r\n if s[1] < k:\r\n print(0, end=\" \")\r\n else:\r\n print(max(s[0], k), end=\" \")\r\n if k < s[0]:\r\n k = s[0] + 1\r\n else:\r\n k += 1\r\n print()\r\n\r\n\r\ntests = int(input())\r\nwhile tests:\r\n tests -= 1\r\n n = int(input())\r\n st = []\r\n for _ in range(n):\r\n st.append(list(map(int, input().split())))\r\n solve(st)\r\n", "t=int(input())\r\nfor i in range(t):\r\n n=int(input())\r\n l=[]\r\n \r\n c=0\r\n for j in range(n):\r\n li,ri = map(int, input().strip().split(' '))\r\n if j==0:\r\n if li<=ri:\r\n l.append(li)\r\n c+=li\r\n else:\r\n l.append(0)\r\n c=0\r\n else:\r\n if ri<=c:\r\n l.append(0)\r\n else:\r\n c=max(c+1,li)\r\n l.append(c)\r\n for j in range(n): \r\n print(l[j],end=\" \")\r\n print()", "t = input()\r\nfor kase in range(int(t)):\r\n n = input()\r\n cur = 0\r\n res = [0 for i in range(int(n))]\r\n for i in range(int(n)):\r\n pr = input()\r\n l, r = map(int, pr.split(\" \"))\r\n if cur <= l:\r\n cur = l + 1\r\n res[i] = l\r\n elif cur <= r:\r\n res[i] = cur\r\n cur = cur + 1\r\n\r\n for j in res:\r\n print(j, end = \" \")\r\n print(\"\")", "tb=int(input())\nfor i in range(tb):\n\tn=int(input())\n\tl,r=map(int,input().split())\n\tarr=[l]\n\tt=l+1\n\tfor j in range(n-1):\n\t\tl,r=map(int,input().split())\n\t\t#print(\"t=\",t)\n\t\tif t<=r:\n\t\t\tif t>=l:\n\t\t\t\tt+=1\n\t\t\telse:\n\t\t\t\tt=l+1\n\t\t\tarr.append(t-1)\n\t\telse:\n\t\t\tarr.append(0)\n\tprint(*arr)", "t = int(input())\r\nfor rep in range(t):\r\n n = int(input())\r\n s = 1\r\n for i in range(n):\r\n l, r = map(int, input().split())\r\n if(s<l):\r\n s = l;\r\n if(s>=l and s<=r):\r\n print(s, end = \" \")\r\n s+=1\r\n else:\r\n print(\"0\", end = \" \")\r\n print(\"\")", "from collections import deque\ndef main():\n n = int(input())\n intervals = []\n t = 1\n taken = [False] * 5003\n res = [0] * n\n for i in range(n):\n l, r = map(int, input().split())\n intervals.append((l, r))\n p = l\n while taken[p] and p < r:\n p += 1\n\n if not taken[p]:\n taken[p] = True\n res[i] = p\n\n print(' '.join(map(str, res)))\n\nT = int(input())\nfor _ in range(T):\n main()\n", "from sys import stdin, stdout\r\nfrom collections import deque\r\n\r\nt = int(stdin.readline())\r\nqueue = deque()\r\n\r\nfor i in range(t):\r\n n = int(stdin.readline())\r\n challengers = []\r\n \r\n for i in range(n):\r\n l, r = map(int, stdin.readline().split())\r\n challengers.append((l, r))\r\n \r\n time = 1\r\n \r\n for v in challengers:\r\n l, r = v\r\n \r\n queue.append((l, r))\r\n \r\n time = max(time, queue[0][0])\r\n \r\n while queue[0][0] < l:\r\n time = max(time, queue[0][0])\r\n \r\n if time > queue[0][1]:\r\n stdout.write('0 ')\r\n queue.popleft()\r\n else:\r\n stdout.write(str(time) + ' ')\r\n time += 1\r\n queue.popleft()\r\n \r\n while queue:\r\n time = max(time, queue[0][0])\r\n \r\n if time > queue[0][1]:\r\n stdout.write('0 ')\r\n queue.popleft()\r\n else:\r\n stdout.write(str(time) + ' ')\r\n time += 1\r\n queue.popleft()\r\n \r\n \r\n stdout.write('\\n')", "for _ in range(int(input())):\r\n n = int(input())\r\n now = -1\r\n for i in range(n):\r\n l, r = map(int,input().split())\r\n if now <= l:\r\n print(l,end=' ')\r\n now = l+1\r\n elif now <= r:\r\n print(now,end=' ')\r\n now += 1\r\n else:\r\n print(0,end=' ')\r\n print()", "for _ in range(int(input())):\r\n c=0\r\n a=[]\r\n for i in range(int(input())):\r\n l,r=map(int,input().split())\r\n if c>r:a+=[0]\r\n else:\r\n c=l+1 if c<=l else c+1\r\n a+=[c-1]\r\n print(' '.join(map(str,a)))", "t = int(input())\r\nfor i in range(t):\r\n n = int(input())\r\n t = 0\r\n for j in range(n):\r\n a, b = [int(x) for x in input().split()]\r\n if a > t:\r\n t = a\r\n print(t, end=' ')\r\n elif a <= t < b:\r\n t += 1\r\n print(t,end=' ')\r\n else:\r\n print(0, end=' ')\r\n print()\r\n", "t = int(input())\r\n\r\nfor _ in range(t):\r\n n = int(input())\r\n lst = [0] * n\r\n tmp = 0\r\n\r\n for i in range(n):\r\n l, r = map(int, input().split())\r\n if l > tmp:\r\n lst[i] = l\r\n tmp = l + 1\r\n elif tmp <= r:\r\n lst[i] = tmp\r\n tmp += 1\r\n\r\n print(' '.join(map(str, lst)))\r\n", "t = int(input())\r\nfrom collections import deque\r\nfor _ in range(t):\r\n n = int(input())\r\n T = 5050\r\n L = [[] for i in range(T)]\r\n R = [[] for i in range(T)]\r\n for i in range(n):\r\n l, r = map(int, input().split())\r\n L[l].append(i)\r\n R[r].append(i)\r\n q = deque([])\r\n out = set()\r\n ans = [0]*n\r\n for i in range(T):\r\n for idx in L[i]:\r\n q.append(idx)\r\n while q:\r\n v = q.popleft()\r\n if v not in out:\r\n ans[v] = i\r\n break\r\n for idx in R[i]:\r\n out.add(idx)\r\n print(*ans)\r\n", "t=int(input())\r\nfor _ in range(t):\r\n n=int(input())\r\n ls=[]\r\n now=-1\r\n last=-1\r\n for __ in range(n):\r\n l,r=map(int,input().split())\r\n if l>now:\r\n now=l\r\n if r>=last:\r\n last=now+1\r\n ls.append(now)\r\n now+=1\r\n else:\r\n ls.append(0)\r\n print(*ls)", "t = int(input())\r\nfor i in range(t):\r\n n = int(input())\r\n q = []\r\n for i in range(n):\r\n l, r = map(int, input().split())\r\n v = l, r\r\n q.append(v)\r\n last = 0\r\n for i in range(len(q)):\r\n if q[i][1] <= last:\r\n if i != len(q) - 1:\r\n print('0', end = \" \")\r\n else:\r\n print('0')\r\n else:\r\n last = max(last + 1, q[i][0])\r\n if i != len(q) - 1:\r\n print(last, end = \" \")\r\n else:\r\n print(last)", "import sys,math,itertools\r\nfrom collections import Counter,deque,defaultdict\r\nfrom bisect import bisect_left,bisect_right \r\nfrom heapq import heappop,heappush,heapify, nlargest\r\nfrom copy import deepcopy\r\nmod = 10**9+7\r\nINF = float('inf')\r\ndef inp(): return int(sys.stdin.readline())\r\ndef inpl(): return list(map(int, sys.stdin.readline().split()))\r\ndef inpl_1(): return list(map(lambda x:int(x)-1, sys.stdin.readline().split()))\r\ndef inps(): return sys.stdin.readline()\r\ndef inpsl(x): tmp = sys.stdin.readline(); return list(tmp[:x])\r\ndef err(x): print(x); exit()\r\n\r\nfor _ in range(inp()):\r\n n = inp()\r\n data = []\r\n for i in range(n):\r\n l,r = inpl()\r\n data.append((l,r))\r\n res = [0]*n\r\n idx = 0\r\n q = deque()\r\n for t in range(1,5010):\r\n while idx<n:\r\n if data[idx][0] <= t:\r\n q.append(idx)\r\n idx += 1\r\n else: break\r\n while q:\r\n i = q.popleft()\r\n if t <= data[i][1]:\r\n res[i] = t\r\n break\r\n print(*res)", "t = int(input())\r\n\r\nfor x in range(t):\r\n n = int(input())\r\n lst = []\r\n d = {}\r\n for y in range(n):\r\n (l, r) = map(int, input().split())\r\n lst.append((l, r))\r\n p = 0\r\n for (l, r) in lst:\r\n if p + 1 > r:\r\n print(0, end = ' ')\r\n else: \r\n print(max(p + 1, l), end = ' ')\r\n p = max(p + 1, l)\r\n print()\r\n \r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nfor _ in range(int(input())):\r\n d = []\r\n c = 0\r\n for i in range(int(input())):\r\n l, r = map(int, input().split())\r\n if c > r:\r\n d.append(0)\r\n else:\r\n c = l + 1 if c <= l else c + 1\r\n d.append(c-1)\r\n print(' '.join(map(str, d)))", "t = int(input())\r\nfor i in range(t):\r\n cnt = 0\r\n ans = []\r\n n = int(input())\r\n for k in range(n):\r\n a, b = list(map(int, input().split()))\r\n if cnt < a:\r\n cnt = a\r\n if cnt <= b:\r\n ans.append(cnt)\r\n cnt += 1\r\n else:\r\n ans.append(0)\r\n print(' '.join(map(str, ans)))", "t=int(input())\r\nfor _ in range(t):\r\n n=int(input())\r\n a=[]\r\n for i in range(n):\r\n l,r=list(map(int,input().split()))\r\n a.append([l,r])\r\n b=1\r\n c=[]\r\n i=0\r\n while i<n:\r\n if a[i][0]<=b and b<=a[i][1]:\r\n c.append(b)\r\n b=b+1\r\n i=i+1\r\n elif a[i][0]<=b:\r\n c.append(0)\r\n i=i+1\r\n else:\r\n b=b+1\r\n print(*c)", "for _ in \" \"*int(input()):\r\n s=0\r\n for _ in \" \"*int(input()):\r\n a,b=map(int,input().split())\r\n if s>b:print(0,end=\" \")\r\n else:\r\n s= a+1 if s<=a else s+1\r\n print(s-1,end=\" \")\r\n print()", "t = int(input())\r\nfor _ in range(t):\r\n n = int(input())\r\n s = 0\r\n a = []\r\n for i in range(n):\r\n l, r = map(int, input().split())\r\n if s > r:\r\n a.append(0)\r\n elif s <= l:\r\n a.append(l)\r\n s = l + 1\r\n else:\r\n a.append(s)\r\n s += 1\r\n\r\n print(\" \".join(map(str, a)))", "t=int(input())\r\nfor i in range(t):\r\n n=int(input())\r\n l=[]\r\n r=[]\r\n for i in range(n):\r\n l1,r1=map(int,input().split())\r\n l.append(l1)\r\n r.append(r1)\r\n temp=1\r\n m=max(r)\r\n for j in range(n):\r\n if temp > r[j]:\r\n print(0, end=\" \")\r\n elif temp <=l[j]:\r\n print(l[j], end=\" \")\r\n temp=l[j]+1\r\n else:\r\n print(temp,end=\" \")\r\n temp+=1\r\n print()", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Feb 2 20:29:32 2018\r\n\r\n@author: Lenovo Ideapad\r\n\"\"\"\r\n\r\nT=int(input())\r\nfor _ in range(T):\r\n n=int(input())\r\n stu=[(0,0)]*n\r\n for z in range(n):\r\n stu[z]=tuple(map(int,input().split(\" \")))\r\n stu.sort(key=lambda x:x[0])\r\n time=1\r\n result=[0]*n\r\n for i in range(n):\r\n a,b=stu[i]\r\n if a>time:\r\n time=a\r\n if b>=time:\r\n result[i]=time\r\n time+=1\r\n for i in result:\r\n print(i,end=\" \")\r\n \r\n \r\n ", "# https://codeforces.com/problemset/problem/920/B\r\n\r\nt = int(input())\r\n\r\noutput = []\r\nfor test in range(t):\r\n n = int(input())\r\n students = []\r\n for _ in range(n):\r\n students.append([int(_) for _ in input().split()])\r\n \r\n time = 1\r\n output.append([])\r\n for l, r in students:\r\n time = max(time, l)\r\n if time <= r:\r\n output[test].append(str(time))\r\n time += 1\r\n else:\r\n output[test].append('0')\r\n\r\nfor test_output in output:\r\n print(' '.join(test_output))\r\n \r\n", "from collections import deque\r\nt = int(input())\r\n\r\ndef solve():\r\n n = int(input())\r\n ans = [0] * n\r\n i = 0\r\n currentTime = 0\r\n while i < n:\r\n lr = input().split(\" \")\r\n li = int(lr[0])\r\n ri = int(lr[1])\r\n if currentTime < li:\r\n currentTime = li\r\n if currentTime == li:\r\n ans[i] = currentTime\r\n currentTime += 1\r\n else:\r\n if currentTime <= ri:\r\n ans[i] = currentTime\r\n currentTime += 1\r\n i += 1\r\n print(\" \".join(str(ai) for ai in ans))\r\n\r\ncount = 0\r\nwhile count < t:\r\n solve()\r\n count += 1\r\n\r\n", "import queue\n\nt = int(input())\nfor test in range(t):\n n = int(input())\n\n ql = queue.Queue()\n qr = queue.Queue()\n for i in range(n):\n li, ri = map(int, input().split())\n ql.put(li)\n qr.put(ri)\n\n time = 0\n resp = list()\n while ql.empty() is False:\n li = ql.get()\n ri = qr.get()\n\n if time < li:\n time = li\n\n if li <= time <= ri:\n print(time, end=' ')\n time = time + 1\n else:\n print(0, end=' ')\n\n print()\n\n\n#t = int(input())\n#\n#for test in range(t):\n# n, k = map(int, input().split())\n# x = [False for i in range(n)]\n#\n# for xi in map(int, input().split()):\n# x[xi-1] = True\n# n = n - 1\n#\n# time = 1\n# while n > 0:\n#\n# x2 = x.copy()\n# for i in range(len(x)):\n# if x[i] is True:\n# if i > 0 and x2[i-1] is False:\n# x2[i-1] = True\n# n = n - 1\n# if i + 1 < len(x) and x2[i+1] is False:\n# x2[i+1] = True\n# n = n - 1\n# x = x2.copy()\n# time = time + 1\n#\n# print(time)\n\n", "import sys\r\n\r\nfor _ in range(int(sys.stdin.buffer.readline().decode('utf-8'))):\r\n n = int(sys.stdin.buffer.readline().decode('utf-8'))\r\n time = 1\r\n ans = [0]*n\r\n for i, (l, r) in enumerate(map(int, sys.stdin.buffer.readline().decode('utf-8').split()) for _ in range(n)):\r\n if time < l:\r\n time = l\r\n if time <= r:\r\n ans[i] = time\r\n time += 1\r\n\r\n print(*ans)\r\n", "t = int(input())\nfor i in range(t):\n n = int(input())\n a, ans = [], []\n for j in range(n):\n x = list(map(int, input().split()))\n a.append(x)\n #print(a)\n cur_sec = a[0][0]\n for p in range(n):\n if a[p][0] <= cur_sec <= a[p][1]:\n ans.append(cur_sec)\n cur_sec += 1\n elif a[p][0] >= cur_sec:\n ans.append(a[p][0])\n cur_sec = a[p][0] + 1\n else:\n ans.append(0)\n #cur_sec += 1\n print(*ans)\n", "# cook your dish here\r\n# from math import * \r\nfor _ in range(int(input().strip())):\r\n n=int(input())\r\n t=1 \r\n l=[]\r\n for __ in range(n):\r\n l.append(list(map(int,input().split())))\r\n i=0\r\n ans=[]\r\n t=1\r\n while t<=5002:\r\n if l[i][0]>t:\r\n t+=1\r\n continue\r\n if l[i][0]<=t and l[i][1]>=t:\r\n ans.append(t)\r\n t+=1\r\n i+=1 \r\n else:\r\n ans.append(0)\r\n i+=1\r\n if i==n:\r\n break\r\n print(*ans) \r\n \r\n ", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\ninput=sys.stdin.readline\r\nt=int(input())\r\nfor w in range(t):\r\n n=int(input())\r\n c=0\r\n l=[]\r\n for i in range(n):\r\n l1,r=(int(i) for i in input().split())\r\n if(c<=r):\r\n if(c>l1):\r\n l.append(c)\r\n c+=1\r\n else:\r\n l.append(l1)\r\n c=l1+1\r\n else:\r\n l.append(0)\r\n print(*l)", "t = int(input())\r\nbo = []\r\nfor i in range(t):\r\n n = int(input())\r\n mr = 0\r\n b = [-2] * n\r\n l = []\r\n r = []\r\n for j in range(n):\r\n x, y = map(int, input().split())\r\n if y > mr:\r\n mr = y\r\n l.append(x)\r\n r.append(y)\r\n j = 1\r\n k = 0\r\n h = 0\r\n while j <= mr:\r\n if k < n and l[k] == j:\r\n b[k] = -1\r\n k += 1\r\n continue\r\n for o in range(n):\r\n if b[o] == -1:\r\n b[o] = j\r\n break\r\n for o in range(n):\r\n if r[o] == j and b[o] == -1:\r\n b[o] = 0\r\n j += 1\r\n bo.append(b)\r\nfor i in range(t):\r\n print(' '.join(map(str, bo[i])))", "def solve():\r\n n = int(input())\r\n q = []\r\n for i in range(n):\r\n l, r = [int(x) for x in input().split(' ')]\r\n q.append((l, i, r))\r\n q.sort(reverse=True)\r\n u = 0\r\n s_time = {}\r\n while q:\r\n x = q.pop()\r\n if x[2] <= u:\r\n s_time[x[1]] = 0\r\n else:\r\n u = max(x[0], u + 1)\r\n s_time[x[1]] = u\r\n s_times = [s_time[i] for i in range(n)]\r\n return s_times\r\n\r\nt = int(input())\r\nfor case in range(t):\r\n print(*solve())\r\n\r\n\r\n", "for _ in range(int(input())):\r\n t=int(input())\r\n ar=[]\r\n for i in range(t):\r\n n,m=[int(a) for a in input().split()]\r\n ar.append([n,m])\r\n result = sorted(ar, key=lambda ar:ar[0])\r\n s=0\r\n b=[]\r\n for i in result:\r\n if(i[1]<s):\r\n b.append(0)\r\n else:\r\n s=max(i[0],s)\r\n b.append(s)\r\n s=s+1\r\n print(*b)\r\n ", "t = int(input())\r\nfor test_index in range(t):\r\n n = int(input())\r\n list_of_students = []\r\n for i in range(n):\r\n l, r = map(int, input().split())\r\n list_of_students.append((i, l, r))\r\n sorted_list = sorted(list_of_students, key = lambda x: (x[1], x[0]), reverse=True)\r\n# print(sorted_list)\r\n current_time = 1\r\n answer = [0 for i in range(n)]\r\n while (len(sorted_list) > 0):\r\n current_customer = sorted_list.pop()\r\n if current_time < current_customer[1]:\r\n current_time = current_customer[1]\r\n# print(current_time, current_customer)\r\n if current_time > current_customer[2]:\r\n continue\r\n answer[current_customer[0]] = current_time\r\n current_time += 1\r\n for x in answer:\r\n print(x, end=\" \")\r\n print()\r\n", "from collections import deque\r\ndef solve(X):\r\n\r\n waiting = deque()\r\n res = [None]*len(X)\r\n t = 0\r\n X.append((10000,10000))\r\n for i,(l,r) in enumerate(X):\r\n while waiting and t < l:\r\n j,b = waiting.popleft()\r\n if t <= b:\r\n res[j] = t\r\n t += 1\r\n else:\r\n res[j] = 0 \r\n waiting.append((i,r))\r\n t = l\r\n\r\n return res\r\n\r\nT = int(input())\r\nfor _ in range(T):\r\n n = int(input())\r\n X = [tuple(map(int,input().split())) for _ in range(n)]\r\n res = solve(X)\r\n print(' '.join(map(str,res)))", "for _ in range(int(input())):\r\n n = int(input())\r\n l = []\r\n for i in range(n):\r\n x, y = map(int, input().split())\r\n l.append((x, y))\r\n start = 0\r\n # l.sort()\r\n ans = []\r\n for st, ed in l:\r\n if start+1 <= ed:\r\n ans.append(max(start+1, st))\r\n start = max(st, start+1)\r\n else:\r\n ans.append(0)\r\n print(*ans)\r\n", "t = int(input())\r\nwhile t:\r\n t -= 1\r\n n = int(input())\r\n wait = []\r\n time = 1\r\n leave = []\r\n for i in range(n):\r\n a, b = input().split(\" \")\r\n wait.append((int(a), int(b)))\r\n for i in wait:\r\n if i[1] < time:\r\n leave.append(0)\r\n else:\r\n if i[0] <= time:\r\n leave.append(time)\r\n time += 1\r\n else:\r\n leave.append(i[0])\r\n time = i[0] + 1\r\n for i in leave:\r\n print(i, end=\" \")\r\n print(\"\")\r\n", "import sys\ncases = int(sys.stdin.readline())\nfor x in range(0, cases):\n people = int(sys.stdin.readline())\n times = []\n for i in range(0, people):\n cur = [int(x) for x in sys.stdin.readline().strip().split(\" \")]\n times.append(cur)\n \n time = 1\n to_print = []\n for t in times:\n if(time < t[0]):\n time = t[0]\n if(time > t[1]):\n to_print.append(\"0\")\n else:\n to_print.append(str(time))\n time += 1\n print(\" \".join(to_print))\n \n \n \n \n \n\t \t\t\t \t\t\t \t\t \t\t\t\t \t\t \t \t \t\t", "t = int(input())\r\nr = []\r\nl = []\r\nfor i in range(t):\r\n n = int(input())\r\n for j in range(n):\r\n lcurr, rcurr = map(int, input().split())\r\n if j == 0:\r\n t = lcurr + 1\r\n print(t - 1, end=' ')\r\n else:\r\n if t > lcurr:\r\n if rcurr >= t:\r\n t += 1\r\n print(t - 1, end=' ')\r\n else:\r\n print(0, end=' ')\r\n else:\r\n t = lcurr + 1\r\n print(t - 1, end=' ')\r\n print()\r\n", "t = int(input())\r\nans1 = []\r\nfor i in range(t):\r\n n=int(input())\r\n st=[]\r\n for i in range(n):\r\n l,r = map(int,input().split())\r\n st.append((l,r,i))\r\n st = sorted(st, key=lambda x: (x[0], x[2]))\r\n ans = []\r\n f = -1\r\n for s in st:\r\n if s[1] < f:\r\n ans.append(0)\r\n else:\r\n ans.append(max(f, s[0]))\r\n f = ans[-1]+1\r\n ans1.append(ans)\r\nfor ans2 in ans1:\r\n print(' '.join([str(i) for i in ans2]))", "t = int(input())\r\nfor i in range(t):\r\n\tn = int(input())\r\n\ta = [[int(i) for i in input().split()] for j in range(n)]\r\n\tcurr = 0\r\n\ttime = 1\r\n\tfor i in range(n):\r\n\t\tif(a[i][1]>=time):\r\n\t\t\tprint(max(time,a[i][0]),end = ' ')\r\n\t\t\ttime = max(time,a[i][0])\r\n\t\t\ttime+=1\r\n\t\telse:\r\n\t\t\tprint(0, end = ' ')\r\n\tprint()", "reps = int(input())\n\nfor _ in range(reps):\n n = int(input())\n t = 1\n for _ in range(n):\n l, r = list(map(int, input().split()))\n if l > t:\n t = l\n if t <= r:\n print(t)\n t += 1\n else:\n print(0)\n", "t = int(input())\nfor i in range(t):\n people = []\n q = []\n x = 0\n s = ''\n n = int(input())\n ans = [None] * n\n for j in range(n):\n aux = input().split()\n l = int(aux[0])\n r = int(aux[1])\n people.append((j, l, r))\n\n time = 0\n for k in range(0,n,1):\n time = max(time+1, people[k][1])\n #print('time {}'.format(time))\n if people[k][1] <= time:\n q.append((people[k][0], people[k][2]))\n #print(q)\n\n if q:\n if q[0][1] < time:\n ans[q[0][0]] = 0\n time -= 1\n else:\n ans[q[0][0]] = time\n q.remove(q[0])\n \n for a in ans:\n s += str(a) + ' '\n print(s)\n \t\t\t \t \t\t \t \t\t \t \t\t\t\t \t \t", "import collections\r\n\r\nt = int(input())\r\nfor i in range(t):\r\n n = int(input())\r\n res = [\"0\"] * n\r\n queue = collections.deque()\r\n\r\n for j in range(n):\r\n l, r = map(int, input().split())\r\n queue.append((l, r, j))\r\n\r\n time = 0\r\n while queue:\r\n l, r, index = queue.popleft()\r\n if time <= l:\r\n res[index] = str(l)\r\n time = l + 1\r\n elif l < time <= r:\r\n res[index] = str(time)\r\n time += 1\r\n print(\" \".join(res))", "for _ in range(int(input())):\r\n n = int(input())\r\n\r\n ar = []\r\n for i in range(n):\r\n x, y = map(int, input().split())\r\n ar.append([x, i, y])\r\n\r\n ar.sort()\r\n\r\n ans = [0 for i in range(n)]\r\n cur = 1\r\n for i in range(n):\r\n cur = max(cur, ar[i][0])\r\n if(cur <= ar[i][2]):\r\n ans[ar[i][1]] = cur\r\n cur += 1\r\n else:\r\n ans[ar[i][1]] = 0\r\n\r\n print(*ans)\r\n", "n = int(input())\r\n#n, m = map(int, input().split())\r\n#s = input()\r\n#c = list(map(int, input().split()))\r\nfor j in range(n):\r\n m = int(input())\r\n a = []\r\n t = 0\r\n for i in range(m):\r\n x, y = map(int, input().split())\r\n if t <= x:\r\n t = x + 1\r\n a.append(t - 1)\r\n elif t > y:\r\n a.append(0)\r\n else:\r\n a.append(t)\r\n t += 1\r\n print(*a)\r\n", "import collections\r\n\r\nt = int(input())\r\nfor i in range(t):\r\n n = int(input())\r\n l = []\r\n r = []\r\n for i in range(n):\r\n (ll, rr) = map(int, input().split())\r\n l.append(ll)\r\n r.append(rr)\r\n q = collections.deque()\r\n \r\n cur_t = 1\r\n cur_student = 0\r\n while cur_student < n or len(q):\r\n while cur_student < n and l[cur_student] == cur_t:\r\n q.append(cur_student)\r\n cur_student += 1\r\n while len(q):\r\n i = q.popleft()\r\n if cur_t > r[i]:\r\n print(0, end = ' ')\r\n continue\r\n print(cur_t, end = ' ')\r\n break\r\n cur_t += 1\r\n print()" ]

[ "# i'm from jasnah, do not ban me\r\ns = input()\r\nn = len(s)\r\na = 0\r\ni = 0\r\n\r\nwhile i < n:\r\n if s[i] != s[(i + 1) % n]:\r\n if s[i] != s[(i + 2) % n]:\r\n a += 1\r\n elif s[i] != s[(i + 3) % n]:\r\n i += 1\r\n a += 1\r\n i += 1\r\n\r\nprint(a)\r\n" ]

[ "import bisect\r\nN=int(input())\r\nx=sorted(list(map(int,input().split())))\r\nfor i in range(int(input())):\r\n print(bisect.bisect(x,int(input())))", "n = int(input())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\nfor _ in range(int(input())):\r\n c = int(input())\r\n low, high = 0, n - 1\r\n ans = -1\r\n while low <= high:\r\n mid = (low + high) // 2\r\n if arr[mid] > c:\r\n ans = mid\r\n high = mid - 1\r\n else:\r\n low = mid + 1\r\n print(ans if ans != -1 else n)", "import bisect as b\r\n\r\ninput()\r\nx = sorted(map(int, input().split()))\r\n\r\nfor i in range(int(input())):\r\n\tprint(b.bisect_right(x, int(input())))", "from sys import stdin\r\ninput = lambda: stdin.readline().strip()\r\nn = int(input())\r\nx = sorted(list(map(int,input().split())))\r\nfor _ in range(int(input())):\r\n q = int(input())\r\n if q < x[0]:\r\n print(0)\r\n continue\r\n l,r = 0, n - 1\r\n while l <= r:\r\n mid = (l + r) // 2\r\n if x[mid] > q:\r\n r = mid - 1\r\n else:\r\n l = mid + 1\r\n print(r + 1)\r\n", "n_shops = int(input())\r\nshops = [int(num) for num in input().split()]\r\ndays = int(input())\r\n\r\nvetor = [0]*(100001)\r\n\r\nfor s in shops:\r\n vetor[s] += 1\r\n\r\ni = 1\r\n\r\nwhile i < len(vetor):\r\n vetor[i] += vetor[i-1]\r\n i+=1\r\n\r\nfor _ in range(days):\r\n coin = int(input())\r\n\r\n if coin >= len(vetor):\r\n print(vetor[-1])\r\n else:\r\n print(vetor[coin])", "import math\r\nimport bisect\r\nn=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nq=int(input())\r\nfor i in range(q):\r\n m=int(input())\r\n print(bisect.bisect_right(a,m))", "import bisect\r\nn=int(input())\r\nlst_price=list(map(int,input().split()))\r\nlst_price.sort()\r\nq=int(input())\r\nfor i in range(q):\r\n coins=int(input())\r\n print(bisect.bisect(lst_price,coins))", "import bisect\r\nn=int(input())\r\nprice=list(map(int,input().split()));price.sort()\r\nq=int(input())\r\nfor i in range (q):\r\n coin=int(input())\r\n position=bisect.bisect(price,coin)\r\n print(position)", "import bisect\r\nlenn = int(input())\r\nprices = list(map(int, input().split()))\r\nprices.sort()\r\nfor _ in range(int(input())):\r\n num = int(input())\r\n print(bisect.bisect(prices, num))", "n = int(input())\r\nnn = list(map(int,input().split()))\r\nm = int(input())\r\nmm = [int(input()) for _ in range(m)]\r\nnn.sort()\r\nfor i in mm:\r\n left, right = 0, n\r\n while left < right:\r\n mid = (left + right) // 2\r\n if nn[mid] <= i: \r\n left = mid + 1\r\n else:\r\n right = mid\r\n print(left)", "from bisect import bisect_right\n\n# Shops count\ninput()\n \n# Prices\nx = sorted(map(int, input().split()))\n \n# Days count\nq = int(input())\n \nfor i in range(q):\n m = int(input())\n result = bisect_right(x, m)\n print(result)", "import math\ndef error(*n):\n print(\"[Err]\",end=\" \")\n for i in n:\n print(i,end=\" \")\n print()\n\nn = [int(i) for i in input().split()]\nif type(n) == list:\n n = n[0]\n\nshop = [int(i) for i in input().split()]\nshop.sort()\n\nfor i in range(int(input())):\n q = int(input())\n l=0\n r=n-1\n ret=-1\n while l<=r:\n mid = int((l+r)/2)\n if (shop[mid]<=q):\n ret=mid\n l=mid+1\n else:\n r=mid-1\n print(ret+1)\n\n \t\t \t \t \t \t \t\t \t \t\t\t", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Nov 13 22:31:05 2023\r\n\r\n@author: 刘婉婷 2300012258\r\n\"\"\"\r\n\r\ndef binary_search(arr, target):\r\n left, right = 0, len(arr) - 1\r\n while left <= right:\r\n mid = (left + right) // 2\r\n if arr[mid] <= target:\r\n left = mid + 1\r\n else:\r\n right = mid - 1\r\n return left\r\n\r\nn=int(input())\r\nbeecola_price=list(map(int,input().split()))\r\nbeecola_price.sort()\r\nq=int(input())\r\nfor i in range(q):\r\n m=int(input())\r\n num=binary_search(beecola_price, m)\r\n print(num)", "import bisect\r\nn = int(input())\r\nx = [int(_) for _ in input().split()]\r\nx.sort()\r\nfor _ in range(int(input())):\r\n m = int(input())\r\n print(bisect.bisect_right(x, m))", "from bisect import bisect\r\nint(input())\r\na = sorted([int(_) for _ in input().split()])\r\nn = int(input())\r\nfor _ in range(n):\r\n print(bisect(a, int(input())))\r\n", "#罗景轩2300012610\r\nimport bisect\r\nn = int(input())\r\nl = sorted(list(map(int, input().split())))\r\nq = int(input())\r\nfor _ in range(q):\r\n print(bisect.bisect_right(l,int(input())))", "from bisect import bisect_right\r\n\r\ndef find_shops(shop_prices, days, coins):\r\n shop_prices.sort()\r\n res = []\r\n for coin in coins:\r\n res.append(bisect_right(shop_prices, coin)) \r\n return res\r\n\r\nn = int(input().strip())\r\nprices = list(map(int, input().strip().split()))\r\nq = int(input().strip())\r\ncoins = [int(input().strip()) for _ in range(q)]\r\n\r\nres = find_shops(prices, q, coins)\r\nfor r in res:\r\n print(r)\r\n", "def binary_search(arr, x):\r\n left, right = 0, len(arr) - 1\r\n while left <= right:\r\n mid = (left + right) // 2\r\n if arr[mid] <= x:\r\n left = mid + 1\r\n else:\r\n right = mid - 1\r\n return left\r\n\r\nn = int(input()) \r\na = sorted(list(map(int, input().split())))\r\nq = int(input())\r\n\r\nfor _ in range(q):\r\n query = int(input())\r\n index = binary_search(a, query)\r\n print(index)\r\n", "import bisect\nn = int(input())\na = [int(i) for i in input().split()]\na.sort()\nq = int(input())\nfor i in range(q):\n d = int(input())\n m = bisect.bisect(a, d)\n print(m)\n \t \t \t\t \t \t\t\t\t \t \t \t", "from bisect import bisect_left, bisect_right\r\nfrom heapq import heappush, heappop, heapify\r\nfrom math import *\r\nfrom collections import defaultdict, Counter, deque\r\nfrom functools import lru_cache\r\nfrom sys import stdin, stdout\r\nimport random\r\nimport io, os\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\nRANDOM = random.randrange(2**62)\r\nninput = lambda: int(input())\r\nsinput = lambda: input().decode().strip() \r\nainput = lambda: list(map(int, input().split()))\r\nprintt = lambda *x: stdout.write(\" \".join(map(str, x)) + '\\n')\r\nceil = lambda a, b: a // b if (a >= 0) ^ (b > 0) else (abs(a) + abs(b) - 1) // abs(b)\r\nWrapper = lambda x: x ^ RANDOM\r\n\r\ndef main():\r\n for _ in range(1):\r\n n = ninput()\r\n x = ainput()\r\n q = ninput()\r\n x.sort()\r\n for _ in range(q):\r\n m = ninput()\r\n ans = -1\r\n l, r = 0, n-1\r\n while l <= r:\r\n mid = (l+r) // 2\r\n if x[mid] <= m: l = mid + 1; ans = mid\r\n else: r = mid - 1\r\n printt(ans + 1)\r\n\r\n\r\n \r\n \r\nif __name__ == '__main__':\r\n main()", "import bisect\r\n\r\n# Read input\r\nn = int(input())\r\nprices = list(map(int, input().split()))\r\nprices.sort() # Sort the prices in ascending order\r\n\r\nq = int(input())\r\ndays = [int(input()) for _ in range(q)]\r\n\r\n# Initialize a list to store the number of shops for each day\r\nshop_counts = []\r\n\r\n# Iterate through the days\r\nfor day in days:\r\n # Use binary search to find the rightmost shop where Vasiliy can buy a bottle\r\n index = bisect.bisect_right(prices, day)\r\n shop_counts.append(index)\r\n\r\n# Print the results\r\nfor count in shop_counts:\r\n print(count)\r\n", "N = int(1e5) + 5\r\ncost = [0] * N\r\ndp = [0] * N\r\n\r\nn = int(input())\r\nx = map(int, input().split())\r\nfor i in x:\r\n cost[i] += 1\r\n\r\nfor i in range(1, N):\r\n dp[i] = dp[i - 1] + cost[i]\r\n# print(dp)\r\nq = int(input())\r\nfor i in range(q):\r\n m = int(input())\r\n if m > (N - 1):\r\n print(n)\r\n else:\r\n print(dp[m])\r\n", "import bisect\r\nn=int(input())\r\nxi=[i for i in map(int,input().split())]\r\nxi.sort()\r\nq=int(input())\r\nfor _ in range(q):\r\n m=int(input())\r\n print(bisect.bisect_right(xi,m))", "import bisect\r\n\r\ndef num_shops(l, q):\r\n return bisect.bisect_right(l, q)\r\n\r\nn = int(input())\r\nprices = [int(x) for x in input().split(\" \")]\r\nprices.sort()\r\ndays = int(input())\r\nbuy = []\r\n\r\nfor i in range(days):\r\n q = int(input())\r\n buy.append(num_shops(prices, q))\r\n\r\nprint(*buy, sep=\"\\n\")", "_ = input()\r\nQ = [0] * 100100\r\nW = map(int, input().split())\r\nfor i in W:\r\n Q[i] += 1\r\nt = int(input())\r\nfor i in range(1, 100100):\r\n Q[i] += Q[i - 1]\r\nfor _ in range(t):\r\n h = min(100000, int(input()))\r\n print(Q[h])", "import bisect\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\narr.sort()\r\nq=int(input())\r\nfor _ in range (q):\r\n m=int(input())\r\n b=bisect.bisect_right(arr,m)\r\n print(b)", "import bisect\r\nn = int(input())\r\n*prices, = map(int, input().split())\r\nprices.sort()\r\nq = int(input())\r\nbudgets = [int(input()) for _ in range(q)]\r\nfor budget in budgets:\r\n print(bisect.bisect_right(prices, budget))", "import bisect\r\n\r\nn=int(input())\r\nlist1=list(map(int,input().split()))\r\nlist1.sort()\r\nq=int(input())\r\nfor i in range(q):\r\n mi=int(input())\r\n print(bisect.bisect_right(list1,mi))", "n = int(input())\r\nx = list(map(int, input().split()))\r\nq = int(input())\r\nm = []\r\nans = []\r\n\r\nx.sort()\r\n\r\nfor _ in range(q):\r\n m.append(int(input()))\r\n\r\nfor i in m:\r\n l, r = -1, n\r\n while(r - l > 1):\r\n a = int((l + r) / 2)\r\n if i < x[a]:\r\n r = a\r\n else:\r\n l = a\r\n ans.append(l + 1)\r\n\r\nfor i in ans:\r\n print(i)", "import bisect\r\ninput()\r\ncosts = sorted([int(i) for i in input().split()])\r\nfor _ in range(int(input())):\r\n money = int(input())\r\n print(bisect.bisect_right(costs, money))", "def find_first_higher_index_recursive(arr, target, left, right):\r\n if left <= right:\r\n mid = left + (right - left) // 2\r\n\r\n if arr[mid] > target:\r\n if mid == 0 or arr[mid - 1] <= target:\r\n return mid\r\n else:\r\n return find_first_higher_index_recursive(arr, target, left, mid - 1)\r\n else:\r\n return find_first_higher_index_recursive(arr, target, mid + 1, right)\r\n\r\n return -1\r\n\r\nlength = int(input())\r\narr = sorted(list(map(int,input().split())))\r\ndrinks = int(input())\r\nfor i in range(drinks):\r\n target = int(input())\r\n index = find_first_higher_index_recursive(arr, target, 0, len(arr) - 1)\r\n if index != -1:\r\n print(index)\r\n else:\r\n print(len(arr))", "n = int(input())\r\nll = list(map(int,input().split())) \r\nll.sort()\r\nq = int(input())\r\n\r\nfor _ in range(q):\r\n x = int(input())\r\n right = n - 1\r\n left = 0\r\n ans = 0\r\n \r\n while(left<=right):\r\n mid = left + (right - left) // 2\r\n \r\n if x >= ll[mid]:\r\n left = mid + 1\r\n ans = mid + 1\r\n else:\r\n right = mid - 1\r\n\r\n print(ans) \r\n\r\n", "def find_shops(n, prices, q, coins):\r\n # Sort the prices array in ascending order\r\n prices.sort()\r\n \r\n # Function to perform binary search and find the number of shops Vasiliy can buy from\r\n def binary_search(target):\r\n left, right = 0, n - 1\r\n while left <= right:\r\n mid = (left + right) // 2\r\n if prices[mid] <= target:\r\n left = mid + 1\r\n else:\r\n right = mid - 1\r\n return left\r\n \r\n # Find the number of shops Vasiliy can buy from for each day\r\n result = []\r\n for i in range(q):\r\n coins_i = coins[i]\r\n shops = binary_search(coins_i)\r\n result.append(shops)\r\n return result\r\n\r\n# Read input\r\nn = int(input())\r\nprices = list(map(int, input().split()))\r\nq = int(input())\r\ncoins = [int(input()) for _ in range(q)]\r\n\r\n# Find and print the number of shops Vasiliy can buy from for each day\r\nresult = find_shops(n, prices, q, coins)\r\nfor shops in result:\r\n print(shops)\r\n", "# 李城岳 生命科学学院 2300012106\r\nx = int(input())\r\nprice = list(map(int, input().split()))\r\nprice.sort()\r\ntime = int(input())\r\nji = {}\r\nfor i in range(1,price[0]):\r\n ji[i] = 0\r\nfor i in range(1,x):\r\n for e in range(price[i-1],price[i]+1):\r\n ji[e] = i\r\n\r\nfor i in range(time):\r\n money = int(input())\r\n if money >= price[-1]:\r\n print(x)\r\n elif money < price[0]:\r\n print(0)\r\n else:\r\n print(ji[money])\r\n\r\n", "def findAns(n,money,priceBtl):\r\n ans = []\r\n for money in money:\r\n l,r = 0,n-1\r\n while l<=r:\r\n mid = (l+r)//2\r\n if money >= priceBtl[mid]:\r\n l = mid + 1\r\n elif money < priceBtl[mid]:\r\n r = mid - 1\r\n ans.append(r+1)\r\n return ans \r\n\r\n\r\n\r\nnumSh = int(input())\r\npriceBtl = sorted(list(map(int,input().split())))\r\nnumDay = int(input())\r\nmoney = []\r\nfor i in range(numDay):\r\n n = int(input())\r\n money.append(n)\r\n\r\nshops = findAns(numSh,money,priceBtl)\r\nfor i in shops:\r\n print(i)\r\n", "n = int(input()) \r\nprices = list(map(int, input().split())) \r\nq = int(input()) \r\nprices.sort()\r\n\r\ndef binary_search(arr, target):\r\n left = 0\r\n right = len(arr) - 1\r\n\r\n while left <= right:\r\n mid = (left + right) // 2\r\n\r\n if arr[mid] <= target:\r\n left = mid + 1\r\n else:\r\n right = mid - 1\r\n\r\n return right\r\n\r\nfor _ in range(q):\r\n mi = int(input()) \r\n max_index = binary_search(prices, mi)\r\n if max_index < 0:\r\n print(0)\r\n else:\r\n print(max_index + 1)", "n=int(input())\r\nprice=list(map(int,input().split()))\r\nprice.append(0)\r\nprice.sort()\r\nq=int(input())\r\nc=[None]*price[-1]\r\nk=0\r\nfor j in range(n):\r\n for i in range(price[j],price[j+1]):\r\n c[i]=k\r\n k+=1 \r\nfor i in range(q):\r\n coin=int(input())\r\n if coin<price[-1]:\r\n print(c[coin])\r\n else:\r\n print(n)\r\n", "from bisect import bisect_right\r\ndef main():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n m = int(input())\r\n a.sort()\r\n\r\n for _ in range(m):\r\n k = int(input())\r\n ans = bisect_right(a, k)\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=[0]*100001\r\nfor i in l:\r\n s[i]+=1\r\nfor i in range(1,100001):\r\n s[i]+=s[i-1]\r\nm=int(input())\r\nfor i in range(m):\r\n q=int(input())\r\n if q>100000:\r\n print(s[-1])\r\n else:\r\n print(s[q])", "def bin_search(x, prices):\r\n l = 0\r\n r = len(prices)\r\n\r\n while l != r:\r\n m = (l+r) // 2\r\n if prices[m] <= x:\r\n l = m + 1\r\n else:\r\n r = m\r\n\r\n return r\r\n\r\n\r\nn = int(input())\r\nprices = list(map(int, input().split()))\r\nprices.sort()\r\n\r\nq = int(input())\r\nfor _ in range(q):\r\n x = int(input())\r\n print(bin_search(x, prices))", "n = int(input())\r\nprices = list(map(int, input().split()))\r\nq = int(input())\r\nprices.sort()\r\nfor _ in range(q):\r\n coins = int(input())\r\n left, right = 0, n - 1\r\n count = 0\r\n while left <= right:\r\n mid = (left + right) // 2\r\n if prices[mid] <= coins:\r\n count = mid + 1\r\n left = mid + 1\r\n else:\r\n right = mid - 1\r\n print(count)", "n=int(input())\r\nshops=sorted(list(map(int,input().split())))\r\nans=[0]*1000001\r\nj=0\r\nfor i in range(1,1000001):\r\n ans[i]=ans[i-1]\r\n while j<n and shops[j]<=i:\r\n ans[i]+=1\r\n j+=1\r\nfor _ in range(int(input())):\r\n m=int(input())\r\n if m>1000000:\r\n print(n)\r\n else:\r\n print(ans[m])", "#2000016913\r\nn=int(input())\r\ns=[int(x) for x in input().split()]\r\ns.sort()\r\nq=int(input())\r\nfor _ in range(q):\r\n m=int(input())\r\n left=0\r\n right=n-1\r\n while left<=right:\r\n mid=(left+right)//2\r\n if s[mid]<=m:\r\n left=mid+1\r\n else:\r\n right=mid-1\r\n print(left)\r\n\r\n\r\n\r\n", "n=int(input())\r\nx=list(map(int,input().split()))\r\nx=sorted(x)\r\nq=int(input())\r\nimport bisect\r\nwhile q>0:\r\n q-=1\r\n m=int(input())\r\n print(bisect.bisect_right(x,m))", "def binary_search(arr, target):\r\n left, right = 0, len(arr)\r\n while left < right:\r\n mid = (left + right) // 2\r\n if arr[mid] <= target:\r\n left = mid + 1\r\n else:\r\n right = mid\r\n return left\r\n\r\nMAX = 100000\r\nx = [0] * MAX\r\n\r\nn = int(input())\r\nx = list(map(int, input().split()))\r\nx.sort()\r\n\r\nm = int(input())\r\nfor i in range(m):\r\n d = int(input())\r\n result = binary_search(x, d)\r\n print(result)", "shop_num=int(input())\r\nsaleprices=[int(x) for x in input().split()]\r\nsaleprices.sort()\r\nthe_di=[0]*(saleprices[-1]-saleprices[0])\r\nfor i in range(shop_num-1):\r\n for j in range(saleprices[i]-saleprices[0],saleprices[i+1]-saleprices[0]):\r\n the_di[j]=i+1\r\n\r\ntest_time=int(input())\r\nfor _ in range(test_time):\r\n test_num = int(input())\r\n if test_num >= saleprices[-1]:\r\n print(shop_num)\r\n elif test_num < saleprices[0]:\r\n print(0)\r\n else:\r\n print(the_di[test_num - saleprices[0]])", "# Read input values\r\nn = int(input())\r\nprices = list(map(int, input().split()))\r\nq = int(input())\r\n\r\n# Sort the prices to make it easier to find suitable shops\r\nprices.sort()\r\n\r\n# Initialize a list to store the number of shops for each day\r\nnum_shops = []\r\n\r\n# Process each day\r\nfor i in range(q):\r\n m = int(input())\r\n \r\n # Use binary search to find the number of shops where Vasiliy can buy a bottle\r\n left, right = 0, n-1\r\n while left <= right:\r\n mid = (left + right) // 2\r\n if prices[mid] <= m:\r\n left = mid + 1\r\n else:\r\n right = mid - 1\r\n \r\n num_shops.append(left)\r\n\r\n# Print the results for each day\r\nfor shops in num_shops:\r\n print(shops)\r\n", "import bisect\r\n\r\ndef B706(day:int, costs:list)->int:\r\n return bisect.bisect_right(costs, day)\r\n\r\nif __name__ =='__main__':\r\n nbShops = int(input())\r\n costs = sorted([int(x) for x in input().split()])\r\n nbDays = int(input())\r\n wealth = [int(input()) for _ in range(nbDays)]\r\n print(*[B706(day, costs) for day in wealth], sep=\"\\n\")", "n=int(input())\r\nx=list(map(int,input().split()))\r\nmm=max(x)\r\nnum=[0]*(mm+1)\r\nfor i in x:\r\n num[i]+=1\r\nfor i in range(2,mm+1):\r\n num[i]+=num[i-1]\r\nfor i in range(int(input())):\r\n m=int(input())\r\n if m<mm:\r\n print(num[m])\r\n else:\r\n print(n)", "import bisect\r\nn=int(input())\r\np=sorted(list(map(int,input().split())))\r\nq=int(input())\r\nres=[]\r\nfor _ in range(q):\r\n res.append(bisect.bisect_right(p,int(input())))\r\nfor i in res:\r\n print(i)", "def binary_search(budget):\r\n l,r=0,n-1\r\n while l<=r:\r\n m=(l+r)//2\r\n if price[m]<=budget:\r\n l=m+1\r\n else:\r\n r=m-1\r\n return r\r\nn=int(input())\r\nprice=list(map(int,input().split()))\r\nprice.sort()\r\ndays=int(input())\r\nfor _ in range(days):\r\n budget=int(input())\r\n print(binary_search(budget)+1)", "import bisect\r\nn = int(input())\r\nx = sorted(map(int, input().split()))\r\nq = int(input())\r\nfor _ in range(q):\r\n m = int(input())\r\n print(bisect.bisect(x, m))", "from bisect import bisect_right\r\n\r\nn = int(input())\r\n*x, = map(int, input().split())\r\nx.sort()\r\nfor _ in range(q:=int(input())):\r\n m = int(input())\r\n print(bisect_right(x, m))", "import bisect;R=input;R();A=sorted(map(int,R().split()))\r\nfor _ in range(int(R())):print(bisect.bisect(A,int(R())))", "n = int(input())\r\nprices = list(map(int, input().split()))\r\nq = int(input())\r\n\r\n# Sort the prices to easily find the shops where Vasiliy can buy the drink\r\nsorted_prices = sorted(prices)\r\n\r\n# Create a list to store the cumulative number of shops with prices less than or equal to mi\r\ncumulative_shops = [0] * (n + 1)\r\nfor i in range(n):\r\n cumulative_shops[i + 1] = cumulative_shops[i] + sorted_prices[i]\r\n\r\nresults = []\r\n\r\nfor _ in range(q):\r\n mi = int(input())\r\n \r\n # Use binary search to find the number of shops where Vasiliy can buy the drink with mi coins\r\n left, right = 0, n\r\n while left < right:\r\n mid = (left + right) // 2\r\n if sorted_prices[mid] <= mi:\r\n left = mid + 1\r\n else:\r\n right = mid\r\n \r\n results.append(left)\r\n\r\n# Print the results\r\nfor res in results:\r\n print(res)\r\n", "import bisect\r\nn,a=input(), sorted(list(map(int,input().split())))\r\nfor _ in range(int(input())):\r\n print(bisect.bisect(a,int(input())))", "import bisect\r\n\r\nn = int(input())\r\nmoney_needed = list(map(int, input().split()))\r\nmoney_needed.sort()\r\n\r\nt = int(input())\r\nfor _ in range(t):\r\n money = int(input())\r\n i = bisect.bisect_right(money_needed, money)\r\n print(i)", "import bisect\r\nn = int(input())\r\nprices = [int(x) for x in input().split()]\r\nq = int(input())\r\nallowances = []\r\nfor i in range(q):\r\n allowances.append(int(input()))\r\nnum_shops = [0 for i in range(q)]\r\ni = 0\r\nprices.sort()\r\nfor allowance in allowances:\r\n index = bisect.bisect_left(prices, allowance + 1)\r\n if index > n - 1:\r\n num_shops[i] = n\r\n elif index < 0:\r\n num_shops[i] = 0\r\n else:\r\n num_shops[i] = index\r\n i += 1\r\n\r\nfor num in num_shops:\r\n print(num)", "import bisect\r\nn=int(input())\r\nl=[int(x) for x in input().split()]\r\nk=int(input())\r\nl.sort()\r\nfor i in range(k):\r\n p=int(input())\r\n cnt = bisect.bisect_right(l, p)\r\n print(cnt)\r\n", "from bisect import bisect\r\ninput()\r\na=sorted(map(int,input().split()))\r\nfor i in range(int(input())):\r\n print(bisect(a,int(input())))", "def binSearch(arr, i):\r\n low = 0\r\n high = len(arr) - 1\r\n\r\n if i < arr[0]:\r\n return 0\r\n elif i >= arr[high]:\r\n return high + 1\r\n \r\n while low != high:\r\n mid = int((low + high) / 2)\r\n\r\n if (arr[mid] == i and arr[mid + 1]) > i or (i > arr[mid] and i < arr[mid + 1]):\r\n return mid + 1\r\n elif arr[mid] <= i:\r\n low = mid\r\n else:\r\n high = mid\r\n return low\r\n\r\n\r\nn = int(input())\r\nprices = list(map(int, input().split()))\r\nq = int(input())\r\ncoins = []\r\n\r\nfor coin in range(q):\r\n coins.append(int(input()))\r\n\r\nprices.sort()\r\n\r\nfor coin in coins:\r\n print(binSearch(prices, coin))", "n = int(input())\r\nx = [int(i) for i in input().split()]\r\nx.sort()\r\nq = int(input())\r\nfor i in range(q):\r\n c = 0\r\n m = int(input())\r\n if m < x[0]:\r\n print(0)\r\n else:\r\n j1, j2 = 0, n-1\r\n while j1 < j2:\r\n j = (j1 + j2 + 1)//2\r\n if x[j] <= m:\r\n j1 = j\r\n else:\r\n j2 = j - 1\r\n print(j1 + 1)\r\n", "n = int(input())\r\nprices = list(map(int, input().split()))\r\nq = int(input())\r\n\r\n# Sort the prices in ascending order\r\nprices.sort()\r\n\r\n# Initialize a list to store the cumulative number of shops he can buy from\r\ncumulative_shops = [0] * n\r\ncumulative_shops[0] = 1\r\n\r\n# Calculate the cumulative number of shops he can buy from\r\nfor i in range(1, n):\r\n cumulative_shops[i] = cumulative_shops[i - 1] + 1\r\n\r\nresults = []\r\n\r\nfor _ in range(q):\r\n m = int(input())\r\n \r\n # Use binary search to find the index of the last shop with price <= m\r\n left, right = 0, n - 1\r\n while left <= right:\r\n mid = (left + right) // 2\r\n if prices[mid] <= m:\r\n left = mid + 1\r\n else:\r\n right = mid - 1\r\n \r\n # The number of shops he can buy from is the cumulative shops at index 'right'\r\n if right >= 0:\r\n results.append(cumulative_shops[right])\r\n else:\r\n results.append(0)\r\n\r\n# Print the results\r\nfor res in results:\r\n print(res)\r\n", "n = int(input())\r\nx = sorted(list(map(int, input().split())))\r\nq = int(input())\r\nfor i in range(q):\r\n mi = int(input())\r\n j = -1\r\n low = 0\r\n high = n-1\r\n while low <= high:\r\n mid = (low+high)//2\r\n if x[mid] <= mi:\r\n j = mid\r\n low = mid + 1\r\n else:\r\n high = mid - 1\r\n print(j+1)", "n = int(input())\r\nx = list(map(int,input().split()))\r\nx.sort()\r\ndef binarySearch(m,x):\r\n start = 0\r\n end = n\r\n if m < x[0] :return 0\r\n if m>100000 or m>=x[-1]: return n\r\n while start<=end:\r\n mid = (end+start)//2\r\n if m>=x[mid-1] and m<x[mid]:\r\n return mid\r\n elif m>=x[mid]:\r\n start = mid+1\r\n else:\r\n end = mid-1\r\nfor i in range(int(input())):\r\n m = int(input())\r\n print(binarySearch(m,x))", "import sys\r\nimport bisect\r\n#from collections import Counter\r\n\r\ninput = sys.stdin.readline\r\nMOD=10**9+7\r\n\r\nif __name__ == '__main__':\r\n \r\n T=1#int(input())\r\n for _ in range(T):\r\n n=int(input())\r\n shops=list(map(int, input().split()))\r\n shops.sort()\r\n \r\n m=int(input())\r\n \r\n for i in range(m):\r\n print(bisect.bisect_right(shops,int(input())))\r\n \r\n\r\n \r\n \r\n \r\n\r\n ", "import sys \r\ninput = sys.stdin.buffer.readline \r\n\r\ndef finder(A, x):\r\n n = len(A)\r\n if x < A[0]:\r\n return 0 \r\n if x >= A[-1]:\r\n return len(A)\r\n s = 0 \r\n e = n-1 \r\n while s+1 < e:\r\n m = (s+e)//2 \r\n if A[m] <= x:\r\n s, e = m, e \r\n else:\r\n s, e = s, m \r\n return e \r\n \r\nn = int(input())\r\nA = [int(x) for x in input().split()]\r\nA.sort()\r\nq = int(input())\r\nfor i in range(q):\r\n m = int(input())\r\n sys.stdout.write(f'{finder(A, m)}\\n')", "n = int(input())\r\n\r\nprice = list(map(int, input().split()))\r\nprice = sorted(price)\r\nprice.insert(0, 0)\r\n\r\nq = int(input())\r\n\r\nfor i in range(1, q + 1):\r\n m = int(input())\r\n\r\n l = 0\r\n r = len(price)\r\n\r\n while r - l > 1:\r\n mid = (l + r) // 2\r\n\r\n if price[mid] > m:\r\n r = mid\r\n else:\r\n l = mid\r\n\r\n print(l)\r\n", "import bisect\r\nn=int(input())\r\nx=sorted(list(map(int,input().split())))\r\nq=int(input())\r\nans=0\r\nfor i in range(q):\r\n m=int(input())\r\n print(bisect.bisect(x,m))\r\n", "n=int(input())\r\np=list(map(int,input().split()))\r\nl=[]\r\nfor i in range(0,100000+1):\r\n\tl.append(0)\r\nfor i in range(0,n):\r\n\tl[p[i]]+=1\r\nans=[l[0]]\r\nfor i in range(1,100000+1):\r\n\tans.append(ans[i-1]+l[i])\r\nm=int(input())\r\nfor j in range(0,m):\r\n\tq=int(input())\r\n\tif q>1e5:\r\n\t\tq=100000\r\n\tprint(ans[q])\r\n", "import bisect\r\n\r\n\r\ndef solve():\r\n n = int(input())\r\n l = sorted([int(i) for i in input().split()])\r\n k = int(input())\r\n for i in range(k):\r\n q = int(input())\r\n print(bisect.bisect(l, q))\r\n\r\n\r\n# t = int(input())\r\nt = 1\r\nwhile t:\r\n solve()\r\n t -= 1\r\n", "def b(a,l,h,t):\r\n if l<=h:\r\n m=(l+h)//2\r\n if a[m]>t:\r\n if m==0 or a[m-1]<=t: return m\r\n else: return b(a,l,m-1,t)\r\n else:return b(a,m+1,h,t)\r\n else:return -1\r\nn=int(input())\r\nx=sorted(list(map(int,input().split())))\r\ny=int(input())\r\nfor i in range(y):\r\n q=int(input())\r\n s=b(x,0,len(x)-1,q)\r\n if s!=-1:print(s)\r\n else:print(len(x))", "import bisect\r\nt=int(input())\r\nr=list(map(int,input().split(\" \")))\r\nq=int(input())\r\nr.sort()\r\nj=0\r\nwhile(j<q):\r\n m=int(input())\r\n l=0\r\n count=bisect.bisect_right(r,m)\r\n print(count)\r\n j+=1\r\n \r\n \r\n \r\n \r\n", "def binary_search(prices, x):\r\n \r\n l, r = 0, len(prices) - 1\r\n pos = -1\r\n while l <= r:\r\n mid = (l + r) // 2\r\n if prices[mid] <= x:\r\n pos = mid\r\n l = mid + 1\r\n else:\r\n r = mid - 1\r\n return pos + 1 \r\n\r\nn = int(input())\r\nprices = list(map(int, input().split()))\r\nprices.sort()\r\n\r\nq = int(input())\r\nfor _ in range(q):\r\n mi = int(input())\r\n print(binary_search(prices, mi))", "def bins(arr, x, l, r):\n\tif l == r:\n\t\tif arr[l] <= x: return l+1\n\t\telse: return l\n \n\tif l < r:\n\t\tmid = (l+r) // 2\n \n\t\tif arr[mid] <= x:\n\t\t\treturn bins(arr, x, mid+1, r)\n\t\telse:\n\t\t\treturn bins(arr, x, l, mid)\n\t\t\t\n\treturn 0\n \nn = int(input())\np = [int(x) for x in input().split()]\np.sort()\nq = int(input())\nfor i in range(q):\n\tm = int(input())\n\tprint(bins(p, m, 0, n-1))\n \t\t\t\t\t \t\t \t\t \t \t\t", "from bisect import *\n\nN = int(input())\na = sorted(list(map(int, input().split())))\nQ = int(input())\nfor _ in range(Q):\n budget = int(input())\n print(bisect_right(a, budget))\n", "n = int(input())\r\nprice = list(map(int, input().split()))\r\nq = int(input())\r\ncoins = []\r\nfor i in range(q):\r\n coins.append(int(input()))\r\nprice.sort()\r\n\r\n\r\nfor i in range(q):\r\n len = n\r\n add = 0\r\n while add<len:#如果add>len,说明需要调整的范围小于等于1，此时mid就是答案\r\n mid = (add+len)//2\r\n if coins[i] >= price[mid]: \r\n add = mid+1#如果n>M，len进一步缩小\r\n else:#n<=M时，len增大\r\n len = mid#mid过小，需要增大为3/2mid，+1防止有小数出现时循环往下取整而无法继续\r\n print(add)", "import bisect\r\nn = int(input())\r\nx = sorted([int(i) for i in input().split()])\r\nq = int(input())\r\nfor i in range(q):\r\n\t\tm = int(input())\r\n\t\tprint(bisect.bisect_right(x, m))\r\n ", "import bisect\n\nn = int(input())\nprices = sorted(list(map(int, input().split())))\n\nq = int(input())\n\nfor _ in range(q):\n coins = int(input())\n idx = bisect.bisect_right(prices, coins)\n print(idx)\n\t\t\t\t \t\t\t \t \t\t\t\t\t\t \t \t \t\t", "n = int(input())\r\nbar = list(map(int, input().split()))\r\nbar = sorted(bar)\r\nq = int(input())\r\n\r\nfor _ in range(q):\r\n s = 0 #start\r\n e = len(bar) #end\r\n i = int(input())\r\n while s < e:\r\n mid = (e+s)//2\r\n if i < bar[mid]:\r\n e = mid\r\n elif i >= bar[mid]:\r\n s = mid + 1\r\n print(s)\r\n ", "n = int(input()) # Number of shops\nprices = [0] + list(map(int, input().split())) # List of prices at each shop\nprices.sort()\nprices.append(float('inf')) # Buffer left and right of prices\nq = int(input()) # Number of days\n\n\ndef binary_search(num_coins) -> int:\n l, r = 1, len(prices) - 2\n while l <= r:\n m = (l + r) // 2\n if prices[m] <= num_coins and prices[m+1] > num_coins:\n return m # Return value shifted by 1 due to buffering on prices.\n elif num_coins >= prices[m+1]:\n l = m + 1\n else:\n r = m - 1\n return 0\n\n\nfor i in range(q):\n # print(\"input: \", input[3 + i])\n # print(\"result: \", binary_search(int(input[3 + i])))\n print(binary_search(int(input())))\n \t\t \t \t\t \t \t\t \t\t\t\t \t\t \t\t\t", "n=int(input())\r\nll=list(map(int,input().split()))\r\nll.sort()\r\n\"\"\"t,y=ll[0],ll[-1]\"\"\"\r\nfor _ in range(int(input())):\r\n x=int(input())\r\n u,d=n,0\r\n \"\"\" if x<t:\r\n print(0)\r\n continue\r\n elif x>y:\r\n print(n)\r\n continue\"\"\"\r\n while d<u:\r\n m=(u+d)//2\r\n if ll[m]<=x:\r\n d=m+1\r\n else:\r\n u=m\r\n print(u)\r\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nshops = list(map(int, input().split()))\r\nshops.sort()\r\ndays = int(input())\r\n\r\ndaysmoney = []\r\nfor i in range(days):\r\n x = int(input())\r\n daysmoney.append(x)\r\n\r\ndef binary_search(mi, x, head, tail):\r\n if head == tail-1:\r\n return (head+tail)//2\r\n if x[(head+tail)//2] <= mi:\r\n head = (head+tail)//2\r\n tail = tail\r\n return binary_search(mi, x, head, tail)\r\n else:\r\n head = head\r\n tail = (head+tail)//2\r\n return binary_search(mi, x, head, tail)\r\n\r\nfor i in range(days):\r\n mi = daysmoney[i]\r\n qi = 0;\r\n\r\n qi = binary_search(mi,shops,0,n)\r\n if shops[qi] <= mi:\r\n qi += 1;\r\n print(qi)", "from bisect import bisect_right\r\n\r\nn = int(input())\r\nprices = list(map(int , input().split()))\r\nq = int(input())\r\nprices.sort()\r\n\r\nfor i in range(q):\r\n coins = int(input())\r\n ans = bisect_right(prices,coins)\r\n print(ans)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Nov 9 16:30:11 2023\r\n\r\n@author: 苏柔德 2300011012\r\n\"\"\"\r\nn=int(input())\r\np=sorted(list(map(int, input().split())))\r\nq=int(input())\r\nimport bisect\r\nfor i in range(q):\r\n x=int(input())\r\n print(bisect.bisect(p,x))", "n=int(input())\nl=list(map(int,input().split()))\ns=[0]*100001\nfor i in l:\n s[i]+=1\nfor i in range(1,100001):\n s[i]+=s[i-1]\nm=int(input())\nfor i in range(m):\n q=int(input())\n if q>100000:\n print(s[-1])\n else:\n print(s[q])\n# Wed Jul 12 2023 13:56:25 GMT+0300 (Moscow Standard Time)\n", "from bisect import *\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nfor _ in range(int(input())):\r\n print(bisect_right(l,int(input())))", "import bisect\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nfor _ in range(int(input())):\r\n k=int(input())\r\n print(bisect.bisect(l,k))\r\n\r\n ", "from bisect import bisect_right\n\nn, x = int(input()), sorted(int(i) for i in input().split())\nq = int(input())\nfor _ in range(q):\n m = int(input())\n res = bisect_right(x, m)\n print(res)\n", "def binary_search(arr, target):\r\n left, right = 0, len(arr)\r\n \r\n while left < right:\r\n mid = (left + right) // 2\r\n \r\n if arr[mid] <= target:\r\n left = mid + 1\r\n else:\r\n right = mid\r\n \r\n return left\r\n\r\nn = int(input())\r\nx = list(map(int, input().split()))\r\nnum = int(input())\r\nd = []\r\n\r\nx.sort() # Sort the prices for binary search\r\n\r\nfor i in range(num):\r\n c = int(input())\r\n counter = binary_search(x, c)\r\n d.append(counter)\r\n\r\nfor z in d:\r\n print(z)\r\n", "def solution():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n const1 = 100010\r\n pr = [0] * const1\r\n for i in a:\r\n pr[i] += 1\r\n for i in range(1, const1):\r\n pr[i] += pr[i - 1]\r\n q = int(input())\r\n for i in range(q):\r\n x = int(input())\r\n if x > const1:\r\n print(pr[-1])\r\n else:\r\n print(pr[x])\r\n\r\n\r\nsolution()\r\n# простенькая задача на префиксы", "n = int(input())\r\nprices = list(map(int, input().split()))\r\nq = int(input())\r\nprices.sort()\r\ncumulative_prices = [0] * (n + 1)\r\nfor i in range(1, n + 1):\r\n cumulative_prices[i] = cumulative_prices[i - 1] + prices[i - 1]\r\nresult = []\r\nfor _ in range(q):\r\n m = int(input())\r\n left = 0\r\n right = n\r\n while left < right:\r\n mid = (left + right) // 2\r\n if prices[mid] <= m:\r\n left = mid + 1\r\n else:\r\n right = mid\r\n result.append(left)\r\nfor r in result:\r\n print(r)\r\n", "n=int(input())\r\nprice=[int(x) for x in input().split()]\r\nprice.sort()\r\nans=[0]*(price[n-1]+1)\r\nfor i in range(n):\r\n ans[price[i]]=i+1\r\nfor i in range(1,price[n-1]+1):\r\n if ans[i]==0:\r\n ans[i]=ans[i-1]\r\nfor _ in range(int(input())):\r\n m=int(input())\r\n if m<price[0]:\r\n print(0)\r\n elif m>price[n-1]:\r\n print(n)\r\n else:\r\n print(ans[m])", "n = int(input())\r\nx = sorted(map(int, input().split()))\r\nq = int(input())\r\n\r\nfor i in range(q):\r\n m = int(input())\r\n lo, hi = 0, n - 1\r\n while lo <= hi:\r\n mid = (lo + hi) // 2\r\n if x[mid] <= m:\r\n lo = mid + 1\r\n else:\r\n hi = mid - 1\r\n print(lo)\r\n", "n = int(input())\r\n\r\nx = list(map(int, input().split()))\r\n\r\nx.sort()\r\n\r\ntc = int(input())\r\n\r\nfor i in range(tc):\r\n\r\n count = 0\r\n\r\n left = 0\r\n right = n - 1\r\n\r\n m = int(input())\r\n\r\n max = 0\r\n\r\n while left <= right:\r\n\r\n middle = (left + right) // 2\r\n\r\n if x[middle] <= m:\r\n\r\n left = middle + 1\r\n count = middle + 1\r\n\r\n else:\r\n\r\n right = middle - 1\r\n\r\n print(count)", "def count_shops(n, prices, q, budget):\r\n # Sort the prices of bottles in ascending order\r\n prices.sort()\r\n\r\n result = []\r\n for b in budget:\r\n left, right = 0, n - 1\r\n count = 0\r\n\r\n while left <= right:\r\n mid = (left + right) // 2\r\n if prices[mid] <= b:\r\n count = mid + 1\r\n left = mid + 1\r\n else:\r\n right = mid - 1\r\n\r\n result.append(count)\r\n\r\n return result\r\n\r\n# Input\r\nn = int(input())\r\nprices = list(map(int, input().split()))\r\nq = int(input())\r\nbudget = [int(input()) for _ in range(q)]\r\n\r\n# Calculate and print the result\r\nresult = count_shops(n, prices, q, budget)\r\nfor res in result:\r\n print(res)\r\n", "import bisect\r\nn = int(input())\r\nprices = sorted(list(map(int, input().split())))\r\nq = int(input())\r\n\r\nfor _ in range(q):\r\n money = int(input())\r\n pos = bisect.bisect(prices, money)\r\n print(pos)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Aug 10 23:25:29 2023\r\n\r\n@author: dell\r\n\"\"\"\r\n\r\nimport bisect\r\n\r\nn=int(input())\r\nx=list(map(int,input().split()))\r\nq=int(input())\r\nm=[]\r\nfor i in range(q):\r\n m.append(int(input()))\r\nx.sort()\r\nfor i in range(q):\r\n print(bisect.bisect(x,m[i]))", "from bisect import bisect_right\r\ninput()\r\nla = list(map(int, input().split()))\r\nlb = [int(input()) for _ in range(int(input()))]\r\nla.sort()\r\nfor b in lb:\r\n print(bisect_right(la, b))\r\n", "import bisect \r\np=input;p();a=sorted(map(int,p().split()))\r\nb=int(p())\r\nfor i in range(b):\r\n c=int(p())\r\n print(bisect.bisect_right(a,c))\r\n \r\n", "# Ввод данных\r\nn = int(input())\r\nprices = list(map(int, input().split()))\r\nq = int(input())\r\nmoney = [int(input()) for _ in range(q)]\r\n\r\n# Сортировка массива с ценами\r\nprices.sort()\r\n\r\n# Поиск количества магазинов для каждого дня\r\nresult = []\r\nfor m in money:\r\n left = 0\r\n right = len(prices) - 1\r\n while left <= right:\r\n mid = (left + right) // 2\r\n if prices[mid] <= m:\r\n left = mid + 1\r\n else:\r\n right = mid - 1\r\n result.append(left)\r\n\r\n# Вывод результата\r\nfor r in result:\r\n print(r)", "n = int(input())\r\nprice = sorted(list(map(int,input().split())))\r\nm = int(input())\r\nfor _ in range(m):\r\n money = int(input())\r\n if money >= price[-1]:\r\n print(len(price))\r\n elif money < price[0]:\r\n print(0)\r\n else:\r\n l, r = 0, len(price)-1\r\n while l < r:\r\n mid = (l + r) // 2\r\n if (price[mid] <= money) and (price[mid+1] > money):\r\n print(mid+1)\r\n break\r\n if price[mid] > money:\r\n r = mid\r\n if price[mid+1] <= money:\r\n l = mid+1\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Nov 13 22:31:05 2023\r\n\r\n@author: 刘婉婷 2300012258\r\n\"\"\"\r\n\r\nn = int(input())\r\nbeecola_price = list(map(int, input().split()))\r\nbeecola_price.sort()\r\nq = int(input())\r\n\r\ndef binary_search(arr, target):\r\n left, right = 0, len(arr) - 1\r\n while left <= right:\r\n mid = (left + right) // 2\r\n if arr[mid] <= target:\r\n left = mid + 1\r\n else:\r\n right = mid - 1\r\n return left\r\n\r\nfor _ in range(q):\r\n m = int(input())\r\n num = binary_search(beecola_price, m)\r\n print(num)\r\n", "import bisect\r\nnum=int(input())\r\nprice=list(map(int,input().split()))\r\nday=int(input())\r\nprice.sort()\r\nfor i in range(day):\r\n print(bisect.bisect_left(price,float(input())+0.5))", "#23n2300011853 zhuangchuyue ccme\r\nn=int(input())\r\nx=list(map(int,input().split()))\r\na=[0]*100005\r\nmm=-1\r\nfor i in range(n):\r\n a[x[i]]+=1\r\n mm=max(mm,x[i])\r\nfor i in range(1,mm):\r\n a[i]=a[i-1]+a[i]\r\nq=int(input())\r\nfor lrgt in range(q):\r\n m=int(input())\r\n if(m>=mm):\r\n print(n)\r\n else:\r\n print(a[m])", "n = int(input())\r\nprices = list(map(int, input().split()))\r\nq = int(input())\r\ncoins = []\r\nfor _ in range(q):\r\n coins.append(int(input()))\r\n\r\nprices.sort() \r\n\r\nresult = []\r\nfor c in coins:\r\n left = 0\r\n right = n - 1\r\n while left <= right:\r\n mid = (left + right) // 2\r\n if prices[mid] <= c:\r\n left = mid + 1\r\n else:\r\n right = mid - 1\r\n result.append(left)\r\n\r\nfor res in result:\r\n print(res)", "from bisect import bisect_left, bisect_right\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\ndays = int(input())\r\nmoney = []\r\nfor i in range(days):\r\n money.append(int(input()))\r\narr.sort()\r\nl, r = 0, n-1\r\n\r\nfor i in range(days):\r\n print(bisect_right(arr,money[i]))", "import bisect\r\n\r\nn = int(input())\r\nprices = sorted(list(map(int, input().split())))\r\nq = int(input())\r\n\r\nfor _ in range(q):\r\n budget = int(input())\r\n index = bisect.bisect_right(prices, budget)\r\n print(index)\r\n", "import bisect\nn = int(input())\nprices = sorted(list(map(int, input().split())))\nq = int(input())\nfor tle in range(q):print(bisect.bisect_right(prices, int(input())))\n\t\t\t\t \t \t\t\t \t \t\t\t \t \t", "# Interesting drink Difficulty:1100\r\nimport math\r\n\r\n\r\ndef binary_search(num):\r\n left, right = 0, n-1\r\n count = 0\r\n if num < prices[0]:\r\n return 0\r\n while left <= right:\r\n mid = math.ceil((left + right) / 2)\r\n if num >= prices[mid]:\r\n left = mid\r\n else:\r\n right = mid-1\r\n if left == right:\r\n count = left+1\r\n break\r\n return count\r\n\r\n\r\nn = int(input())\r\nprices = list(map(int, input().split()))\r\nprices.sort()\r\nq = int(input())\r\nans = []\r\nfor j in range(q):\r\n m = int(input())\r\n answer = binary_search(m)\r\n ans.append(answer)\r\nfor k in range(q):\r\n print(ans[k])\r\n", "\r\ndef trouver(a, m):\r\n low = 0\r\n high = len(a) - 1\r\n result = -1 \r\n\r\n while low <= high:\r\n mid = (low + high) // 2 \r\n\r\n if m >= a[mid]:\r\n result = mid \r\n low = mid + 1 \r\n else:\r\n high = mid - 1 \r\n\r\n return result\r\n\r\n\r\n\r\nn=int(input())\r\nx=sorted(list(map(int,input().split())))\r\nq=int(input())\r\nfor _ in range(q):\r\n m=int(input())\r\n result=trouver(x,m)\r\n print(result+1)\r\n ", "#任晓宇 2300015809\r\nn=int(input())\r\nprices=[int(_) for _ in input().split()]\r\nprices.sort()\r\n\r\nimport bisect\r\n\r\nq=int(input())\r\nlist1=[]\r\nfor _ in range(q):\r\n x=int(input())\r\n index=bisect.bisect_right(prices, x)\r\n list1.append(index)\r\n\r\nprint(\"\\n\".join(map(str,list1)))", "n = int(input()) # the number of shops in the city that sell Vasiliy's favourite drink\r\nx = list(map(int,input().split())) # prices of the bottles of the drink in the i-th shop.\r\nx.sort()\r\nq = int(input()) # the number of days Vasiliy plans to buy the drink.\r\n\r\ndef binary_search(mi, x, head, tail): # 不大于 mi 的索引\r\n if head == tail-1:\r\n return (head+tail)//2\r\n if x[(head+tail)//2] <= mi:\r\n head = (head+tail)//2\r\n tail = tail\r\n return binary_search(mi, x, head, tail)\r\n else:\r\n head = head\r\n tail = (head+tail)//2\r\n return binary_search(mi, x, head, tail)\r\n\r\nfor i in range(q):\r\n mi = int(input()) # the number of coins Vasiliy can spent on the i-th day.\r\n qi = 0 # The i-th of them should be equal to the number of shops where Vasiliy will be able to buy a bottle of the drink on the i-th day.\r\n\r\n qi = binary_search(mi, x, 0, n)\r\n if x[qi] <= mi:\r\n qi += 1\r\n \r\n print(qi)", "# 读取输入值\r\nn = int(input())\r\nprices = list(map(int, input().split()))\r\nq = int(input())\r\ndays = [int(input()) for _ in range(q)]\r\n\r\n# 将价格按升序排序\r\nprices.sort()\r\n\r\n# 定义一个函数，用于找到Vasiliy在某一天能够购买饮料的商店数量\r\ndef find_shops(coins):\r\n # 使用二分查找找到价格小于等于给定硬币数的商店的最右边位置\r\n left, right = 0, n - 1\r\n while left <= right:\r\n mid = (left + right) // 2\r\n if prices[mid] <= coins:\r\n left = mid + 1\r\n else:\r\n right = mid - 1\r\n return left\r\n\r\n# 输出每一天的结果\r\nfor i in range(q):\r\n coins_on_day_i = days[i]\r\n # 找到Vasiliy在第i天能够购买饮料的商店数量\r\n result = find_shops(coins_on_day_i)\r\n print(result)", "n = int(input())\r\nprice = list(map(int, input().split()))\r\nday = int(input())\r\nprice = sorted(price)\r\n\r\n\r\ndef find(x, l, r):\r\n if l == r:\r\n return l\r\n if l == r - 1:\r\n if price[r] <= x:\r\n return r\r\n else:\r\n return l\r\n mid = (l + r) // 2\r\n if price[mid] <= x:\r\n return find(x, mid, r)\r\n else:\r\n return find(x, l, mid)\r\n\r\n\r\nfor i in range(day):\r\n h = int(input())\r\n if h < price[0]:\r\n print(0)\r\n else:\r\n print(find(h, 0, n - 1) + 1)", "t=1\r\nfrom collections import Counter\r\nwhile t:\r\n n=int(input())\r\n li=list(map(int,input().strip().split()))\r\n # s=set(li)\r\n dii=Counter(li)\r\n di={}\r\n c=0\r\n lv=10**5+1\r\n for i in range(1,lv):\r\n if i in dii:\r\n c+=dii[i]\r\n di[i]=c\r\n nn=int(input())\r\n while nn:\r\n nnn=int(input())\r\n if nnn>lv-1:\r\n nnn=lv-1\r\n print(di[nnn])\r\n nn-=1\r\n t-=1", "n = int(input())\r\ns = sorted(list(map(int, input().split())))\r\nm = 10\r\ndef check(x):\r\n l, r = 0, n\r\n while l < r:\r\n c = (r - l) // 2 + l\r\n if s[c] <= x:\r\n l = c + 1\r\n elif s[c] > x:\r\n r = c\r\n\r\n\r\n return l\r\n\r\n\r\nfor j in range(int(input())):\r\n m = int(input())\r\n print(check(m))", "def binary_search(prices, x):\n low = 0\n high = len(prices)\n while low < high:\n mid = (low + high) // 2\n if prices[mid] > x:\n high = mid\n else:\n low = mid + 1\n return low\n\nn = int(input())\nprices = sorted(list(map(int, input().split())))\nq = int(input())\n\nfor _ in range(q):\n x = int(input())\n print(binary_search(prices, x))\n", "n = int(input())\r\nshop_prices = list(map(int, input().split()))\r\nshop_prices_sorted = sorted(shop_prices)\r\nanswers = []\r\nq = int(input()) \r\nfor j in range(q):\r\n price = int(input())\r\n left, right = 0, n - 1\r\n while left <= right:\r\n mid = (left + right) // 2\r\n if shop_prices_sorted[mid] <= price:\r\n left = mid + 1\r\n else:\r\n right = mid - 1\r\n answers.append(left)\r\nfor answer in answers:\r\n print(answer)", "\r\ndef count_shops(prices,coins):\r\n shops=0\r\n low,high=0,len(prices)\r\n\r\n while low<high:\r\n mid=(low+high)//2\r\n if prices[mid]<=coins:\r\n low=mid+1\r\n shops=low\r\n else:\r\n high=mid\r\n\r\n return shops\r\n\r\nn=int(input())\r\nprices=list(map(int, input().split()))\r\nprices.sort()\r\n\r\nd=int(input())\r\n\r\nfor _ in range(d):\r\n coins=int(input())\r\n answer=count_shops(prices, coins)\r\n print(answer)\r\n", "from bisect import bisect_right\r\nn=int(input())\r\nprice=list(map(int,input().split()))\r\nq=int(input())\r\n\r\nprice.sort()\r\nfor i in range(q):\r\n coin=int(input())\r\n print(bisect_right(price,coin)) ", "import bisect\r\n\r\nn = int(input())\r\nli = list(map(int, input().split()))\r\nli.sort()\r\n#print(li)\r\n\r\nk = int(input())\r\nfor i in range(k):\r\n a = int(input())\r\n \r\n print(bisect.bisect(li, a))\r\n\r\n\"\"\"\r\n4\r\nabacaba\r\nacaba\r\nabacaba\r\nacab\r\n\r\n\r\n\"\"\"", "n = int(input())\nprice = input().split()\nprices = [int(i) for i in price]\nprices.sort()\ndays = int(input())\n\nfor i in range(days):\n\tcoin = int(input())\n\tcount = n\n\tlow = 0\n\thigh = n - 1\n\twhile low <= high:\n\t\tmid = (low + high) // 2\n\t\tif coin >= prices[mid]:\n\t\t\tlow = mid + 1\n\t\telse:\n\t\t\thigh = mid - 1\n\t\t\tcount = mid \n\n\tprint(count)\n", "from collections import defaultdict\r\nn = int(input())\r\n*x, = map(int, input().split())\r\nx.sort()\r\nd = defaultdict(lambda : n)\r\ncnt = 0\r\nfor i in range(x[-1]):\r\n\tif i >= x[cnt]:\r\n\t\twhile i >= x[cnt]:\r\n\t\t\tcnt += 1\r\n\td[i] = cnt\r\nans = []\r\nfor _ in range(int(input())):\r\n\ti = int(input())\r\n\tans.append(d[i])\r\nprint(*ans, sep='\\n')", "n = int(input())\r\na = sorted([int(i) for i in input().split()])\r\nt = [0] * a[-1]\r\nj = -1\r\nfor i in range(a[-1]):\r\n while j + 1 < n and a[j + 1] <= i + 1:\r\n j += 1\r\n if j != -1:\r\n t[i] = j + 1\r\nfor i in range(int(input())):\r\n b = int(input())\r\n if b > a[-1]:\r\n print(n)\r\n else:\r\n print(t[b - 1])", "import bisect\r\nn=input()\r\np=sorted(map(int,input().split()))\r\nq=int(input())\r\nfor i in range(q): \r\n\tprint (bisect.bisect(p,int(input())))", "def count_shops(n, xi, q, mi):\n xi.sort() \n\n result = []\n for coins in mi:\n low = 0\n high = n - 1\n shops = 0\n\n while low <= high:\n mid = (low + high) // 2\n if xi[mid] <= coins:\n shops = mid + 1\n low = mid + 1\n else:\n high = mid - 1\n\n result.append(shops)\n\n return result\n\nn = int(input())\nxi = list(map(int, input().split()))\nq = int(input())\nmi = []\nfor _ in range(q):\n mi.append(int(input()))\n\nresult = count_shops(n, xi, q, mi)\nfor shops in result:\n print(shops)\n\n \t\t \t \t\t \t\t\t\t\t \t\t \t \t\t", "'''\n${1:title}\n${2:url}\n'''\nimport math\nfrom collections import defaultdict, deque\n\ndef input_str():\n return input()\n\ndef input_int():\n return int(input())\n\ndef input_ints(sep=' '):\n return list(map(int, input().split(sep)))\n\ndef input_strs(sep=' '):\n return input().split(sep)\n\n'''\n0 1 2 3 4\n3 6 8 10 11\n\n0\n'''\ndef main():\n n = input_int()\n arr = input_ints()\n days = input_int()\n\n arr.sort()\n\n for _ in range(days):\n coins = input_int()\n left = 0\n right = n - 1\n cand = -1\n while left <= right:\n mid = (right - left) // 2 + left\n\n if arr[mid] > coins:\n right = mid - 1\n else:\n cand = mid\n left = mid + 1\n\n print(cand+1)\n\nif __name__ == '__main__':\n main()\n", "import bisect\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\nl.sort()\r\nday=int(input())\r\nfor _ in range(day):\r\n money = int(input())\r\n print(bisect.bisect(l, money))", "from sys import stdin \nfrom bisect import bisect_right\n\n\nn = int(stdin.readline())\nprices = list(map(int, stdin.readline().split()))\n\ndays = int(stdin.readline())\nbudgets = [int(stdin.readline()) for _ in range(days)]\n\nprices = sorted(prices)\n\nfor b in budgets:\n idx = bisect_right(prices, b)\n print(idx)", "shops = int(input())\r\nprices = list(map(int, input().split()))\r\ndays_buying_drink = int(input())\r\n\r\ncoins_spent_on_ith_day = []\r\nfor _ in range(days_buying_drink):\r\n coins_spent_on_ith_day.append(int(input()))\r\n\r\nprices.sort()\r\nfor coin in coins_spent_on_ith_day:\r\n # find the smallest prices > coin\r\n # or just find count\r\n l, r = 0, len(prices) - 1\r\n while l < r:\r\n mid = (l + r) // 2\r\n if prices[mid] <= coin:\r\n l = mid + 1\r\n elif prices[mid] > coin:\r\n r = mid\r\n\r\n if l == len(prices) - 1 and prices[l] <= coin:\r\n print(l + 1)\r\n else:\r\n print(l)", "def binarySearch(prices, x, low, high):\n\n \n\n mid = (low + high) // 2\n\n # DEBUG print(f'x: {x}, low: {low}, high: {high}, mid: {mid}')\n\n \n\n # Handle the two base cases first:\n\n # 1. Found x\n\n # 2. Didn't find it and nowhere else to look\n\n if int(prices[mid]) == x:\n\n # Check if this is the last time x appears; we want the last one\n\n if mid != high and int(prices[mid + 1]) == x:\n\n # There are more instances of x to the right, so recurse there\n\n return binarySearch(prices, x, mid + 1, high)\n\n else: # This is the last occurrence of x\n\n return mid + 1 # mid is an index, but we want a count of values\n\n elif low == high: # Haven't found it, but nowhere else to look (x is absent)\n\n if int(prices[low]) > x: # Cannot include this store\n\n return low\n\n else: # Include this store\n\n return low + 1\n\n elif int(prices[mid]) < x:\n\n return binarySearch(prices, x, mid + 1, high)\n\n elif mid > low: # Due to int division, they might be equal\n\n return binarySearch(prices, x, low, mid - 1)\n\n else:\n\n return binarySearch(prices, x, low, mid)\n\n \n\nn = int(input()) # Amount of shops\n\nprices = [int(j) for j in input().split()] # Prices of bottles in integer format\n\ndays = int(input()) # Amount of days that I will buy a nice healthy drink ;)\n\n \n\n# Sorting\n\nprices.sort()\n\n#print(prices)\n\n \n\nfor i in range(days):\n\n coin = int(input())\n\n print(binarySearch(prices, coin, 0, len(prices) - 1))\n \t\t\t\t \t\t \t\t\t\t \t\t \t\t \t \t", "import sys\r\nimport bisect\r\n\r\n_ = input()\r\np = sorted([int(x) for x in sys.stdin.readline().split()])\r\n\r\nfor _ in range(int(input())):\r\n m = int(sys.stdin.readline())\r\n print(bisect.bisect_right(p, m))", "'''\r\n2300015897\r\n吴杰稀\r\n光华管理学院\r\n'''\r\nchoices = int(input())\r\nshops = list(map(int,input().split()))\r\nshops.sort()\r\nt = max(shops)\r\n\r\nj = 0\r\nbudgets = []\r\nwhile j <= choices - 1:\r\n if j == 0:\r\n budgets += [j] * shops[j]\r\n else:\r\n budgets += [j] * (shops[j] - shops[j - 1])\r\n j += 1\r\nbudgets.append(choices)\r\n\r\ncases = int(input())\r\nfor i in range(cases):\r\n money = int(input())\r\n if money > t:\r\n print(choices)\r\n else:\r\n print(budgets[money])", "n=int(input())\r\na=list(map(int,input().split()))\r\nq=int(input())\r\na.sort()\r\nfor x in range(q):\r\n m=int(input())\r\n if a[n-1]<=m:\r\n print(n)\r\n elif a[0]>m:\r\n print(0)\r\n else:\r\n l=0\r\n r=n-1\r\n while l!=r:\r\n sr=(l+r)//2\r\n if a[sr]<=m:\r\n l=sr+1\r\n else:\r\n r=sr\r\n print(l)", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nb={}\r\nfor i in a:\r\n if i not in b:\r\n b[i]=1\r\n else:\r\n b[i]+=1\r\nc=[0]\r\nfor i in range(1,a[-1]+1):\r\n if i in b:\r\n c.append(b[i])\r\n else:\r\n c.append(0)\r\nfor i in range(1,a[-1]+1):\r\n c[i]+=c[i-1]\r\n\r\nq=int(input())\r\n\r\nfor i in range(q):\r\n m=int(input())\r\n if m>=a[-1]:\r\n print(n)\r\n else:\r\n print(c[m])\r\n ", "from collections import Counter\r\n\r\nx = int(input())\r\nshops = list(map(int,input().split()))\r\nshop_dict = dict(Counter(shops))\r\nma = max(shops)\r\nans = {}\r\nfor money in range(1,ma+1):\r\n ans[money] = shop_dict.get(money,0) + ans.get(money-1,0)\r\n\r\nfor _ in range(int(input())):\r\n try:\r\n print(ans[int(input())])\r\n except:\r\n print(x)\r\n", "import bisect;c=int;p=input;p();x=sorted(map(c,p().split()))\r\nfor i in' '*c(p()):print(bisect.bisect(x,c(p())))", "n = int(input())\r\nx = list(map(int, input().split()))\r\nq = int(input())\r\nx.sort()\r\npri = [0]*(x[-1]-x[0])\r\nfor i in range(n-1):\r\n for j in range(x[i]-x[0],x[i+1]-x[0]):\r\n pri[j]=i+1\r\nfor _ in range(q):\r\n i = int(input())\r\n if i>=x[-1]:\r\n print(n)\r\n elif i<x[0]:\r\n print(0)\r\n else:\r\n print(pri[i-x[0]])", "from bisect import bisect_right\r\n\r\nn = int(input())\r\nprices = list(map(int, input().split()))\r\nprices.sort()\r\ndays = int(input())\r\ncoins = []\r\nfor _ in range(days):\r\n m = int(input())\r\n coins.append(m)\r\n\r\noutput = []\r\nfor m in coins:\r\n result = bisect_right(prices, m)\r\n output.append(result)\r\n\r\nfor i in output:\r\n print(i)\r\n\r\n\r\n", "def count_shops(n, prices, q, budgets):\r\n prices.sort()\r\n result = []\r\n \r\n for budget in budgets:\r\n low, high = 0, n - 1\r\n while low <= high:\r\n mid = (low + high) // 2\r\n if prices[mid] <= budget:\r\n low = mid + 1\r\n else:\r\n high = mid - 1\r\n result.append(low)\r\n \r\n return result\r\n\r\nn = int(input())\r\nprices = list(map(int, input().split()))\r\nq = int(input())\r\nbudgets = [int(input()) for _ in range(q)]\r\n\r\nresult = count_shops(n, prices, q, budgets)\r\nfor res in result:\r\n print(res)", "def binary_search(arr, target):\r\n left, right = 0, len(arr) - 1\r\n result = -1\r\n\r\n while left <= right:\r\n mid = (left + right) // 2\r\n if arr[mid] <= target:\r\n result = mid\r\n left = mid + 1\r\n else:\r\n right = mid - 1\r\n\r\n return result\r\n\r\nn = int(input())\r\nx = list(map(int, input().split()))\r\nq = int(input())\r\nx = sorted(x)\r\n\r\nfor i in range(q):\r\n m = int(input())\r\n s = binary_search(x, m)\r\n print(s + 1)\r\n", "#1^2 + 2^2 + 3^3 + ... + n^2 = n*(n + 1)*(2*n + 1) // 6\r\n#1*(1 + 1) + 2*(2 + 1) + 3*(3 + 1) + ... + n*(n + 1) = n*(n + 1)*(n + 2) // 3\r\nfrom bisect import bisect_right, bisect_left\r\nfrom math import inf, gcd, sqrt, ceil, log2\r\nfrom heapq import heappush, heappop\r\nfrom collections import defaultdict, Counter, deque\r\nfrom itertools import accumulate\r\nfrom functools import lru_cache\r\nfrom string import ascii_lowercase\r\nrvar = lambda: map(int, input().split())\r\nrarr = lambda: list(map(int, input().split()))\r\nrstr = lambda: input().strip()\r\nrint = lambda: int(input())\r\n\r\n'''Speed up input'''\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn = rint()\r\narr = rarr()\r\narr.sort()\r\n\r\nfor i in range(rint()):\r\n m = rint()\r\n l = -1\r\n r = n\r\n while r > l + 1:\r\n mid = (l + r) // 2\r\n if arr[mid] <= m:\r\n l = mid\r\n else:\r\n r = mid\r\n print(l + 1)\r\n\r\n\r\n", "import bisect\r\ninput()\r\nx=sorted(map(int,input().split()))\r\nfor i in range(int(input())):\r\n\tm=int(input())\r\n\tprint(bisect.bisect_right(x,m))", "def binary_search(prices, m):\n l, r = 0, len(prices) - 1\n while l <= r:\n mid = l + (r - l) // 2\n if prices[mid] == m:\n if mid < len(prices) - 1 and prices[mid + 1] == m:\n while prices[r] > m:\n r -= 1\n mid = r\n return mid + 1\n elif prices[mid] < m:\n l = mid + 1\n else:\n r = mid - 1\n return r + 1\n\ndef solve():\n n = int(input())\n prices = list(map(int, input().split()))\n prices.sort()\n q = int(input())\n for _ in range(q):\n m = int(input())\n print(binary_search(prices, m))\n\nif __name__ == \"__main__\":\n solve()\n", "from bisect import bisect\r\n\r\n\r\nshops = int(input())\r\nprices = sorted(list(map(int, input().split())))\r\n\r\nfor _ in range(int(input())): print(bisect(prices, int(input())))", "n = int(input())\nx = list(map(int, input().split()))\nx.sort()\n\nm = int(input())\nfor i in range(m):\n mi = int(input())\n l = 0\n r = n\n while l < r:\n mid = (l + r) // 2\n if x[mid] <= mi:\n l = mid + 1\n else:\n r = mid\n print(l)\n \t \t\t \t \t\t\t \t \t\t \t\t\t\t", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Nov 7 16:25:51 2023\r\n\r\n@author: He'Bing'Ru\r\n\"\"\"\r\n\r\nimport bisect\r\n\r\nn = int(input())\r\nxs = list(map(int,input().split()))\r\nxs.sort()\r\nfor j in range(n) :\r\n xs[j] -= 0.1\r\nq = int(input())\r\nend = []\r\nfor i in range(q) :\r\n m = int(input())\r\n if m < xs[0] :\r\n end.append(0)\r\n else:\r\n end.append(bisect.bisect_left(xs,m))\r\nfor _ in end :\r\n print(_)", "from bisect import bisect_left, bisect_right\r\n\r\nshops_num = int(input())\r\npre_shops = input().split(\" \")\r\nshops = list(int(x) for x in pre_shops)\r\nshops = sorted(shops)\r\ndays_wanted = int(input())\r\ndays = []\r\ndays_dict = {}\r\n\r\nfor i in range(days_wanted):\r\n days.append(int(input()))\r\n\r\nfor day in days:\r\n output = 0\r\n if day not in days_dict:\r\n i = bisect_right(shops, day)\r\n output += i\r\n days_dict[day] = output\r\n else:\r\n output += days_dict[day]\r\n \r\n print(output)\r\n", "\"\"\"\r\n author: Adham0 \r\n created: 05.08.2023 23:53:20\r\n ### I was here ###\r\n \r\n █████ ██████ ██ ██ █████ ███ ███\r\n ██ ██ ██ ██ ██ ██ ██ ██ ████ ████\r\n ███████ ██ ██ ███████ ███████ ██ ████ ██\r\n ██ ██ ██ ██ ██ ██ ██ ██ ██ ██ ██ \r\n ██ ██ ██████ ██ ██ ██ ██ ██ ██\r\n\"\"\"\r\n\r\ndef b(arr, target):\r\n l = 0\r\n h = len(arr) - 1\r\n while l <= h:\r\n m = l + (h - l) // 2\r\n if arr[m] <= target:\r\n l = m + 1\r\n else:\r\n h = m - 1\r\n return l\r\n\r\nn = int(input())\r\nlst = sorted([int(i) for i in input().split()])\r\nq = int(input())\r\nfor i in range(q):\r\n m = int(input())\r\n \r\n print(b(lst, m))", "def binary_search(n,array):\r\n right,left = len(array)-1, 0\r\n res = len(array)\r\n while left <= right:\r\n mid = (right+left)//2\r\n if array[mid] > n:\r\n right = mid - 1\r\n res = mid\r\n else:\r\n left = mid + 1\r\n return res\r\n \r\n\r\nn = int(input())\r\nprices = [int(x) for x in input().split()]\r\nprices.sort()\r\nq = int(input())\r\nfor i in range(q):\r\n coins = int(input())\r\n res = binary_search(coins, prices)\r\n print(res)", "n = int(input())\r\nprices = sorted(list(map(int, input().split())))\r\nfor _ in range(int(input())):\r\n m = int(input())\r\n if m < prices[0]:\r\n print(0)\r\n elif m >= prices[-1]:\r\n print(n)\r\n else:\r\n l, r = 0, n - 1\r\n while r - l > 1:\r\n mid = int((l + r)/2)\r\n if prices[mid] <= m:\r\n l = mid\r\n else:\r\n r = mid\r\n print([r, r + 1][m == prices[r]])", "from bisect import bisect_right\r\n\r\n\r\ndef find_shops(shop_prices, coins):\r\n res = []\r\n for coin in coins:\r\n res.append(bisect_right(shop_prices, coin))\r\n return res\r\n\r\n\r\nn = int(input().strip())\r\nprices = list(map(int, input().split()))\r\nprices.sort()\r\nm = int(input())\r\ncoins_ = [int(input().strip()) for i in range(0, m)]\r\nanswers = find_shops(prices, coins_)\r\nfor answer in answers:\r\n print(answer)\r\n# 化院 荆屹然 2300011884\r\n", "import sys\r\nsys.setrecursionlimit(2000)\r\n\r\n\r\ndef binary_search(l,t):\r\n def _binary_search(s,l,r,m):\r\n \r\n if r-l==1:\r\n return l if s[l]<=m else l-1\r\n \r\n else:\r\n mid = (l+r)//2\r\n if m>=s[mid]:\r\n return _binary_search(s,mid,r,m)\r\n else:\r\n return _binary_search(s,l,mid,m)\r\n return _binary_search(l,0,len(l),t)\r\n\r\n\r\nn = int(input())\r\ncost = sorted(list(map(int,input().split())))\r\ndays = int(input())\r\n\r\nfor _ in range(days):\r\n budget = int(input())\r\n if budget<cost[0]:\r\n print(0)\r\n else:\r\n res = binary_search(cost,budget)\r\n print(res+1)\r\n\r\n\r\n", "'''n = int(input())\r\nxtuple = tuple(sorted(map(int, input().split())))\r\nq = int(input())\r\nfor i in range(q):\r\n mi = int(input())\r\n print(len([x for x in xtuple if x <= mi]))'''\r\ndef binary_search(arr, target):\r\n low = 0\r\n high = len(arr) - 1\r\n while low <= high:\r\n mid = (low + high) // 2\r\n if arr[mid] <= target:\r\n low = mid + 1\r\n else:\r\n high = mid - 1\r\n return high\r\n\r\nn = int(input())\r\nxi = list(map(int, input().split()))\r\nxi.sort()\r\n\r\nq = int(input())\r\n\r\nfor _ in range(q):\r\n mi = int(input())\r\n index = binary_search(xi, mi)\r\n shop_count = index + 1\r\n print(shop_count)", "n = int(input())\r\nprices = list(map(int, input().split()))\r\nq = int(input())\r\n\r\n# Сортируем массив цен\r\nprices.sort()\r\n\r\nfor _ in range(q):\r\n m = int(input())\r\n \r\n # Используем бинарный поиск для нахождения количества магазинов, в которых можно купить\r\n left, right = 0, n - 1\r\n shops_count = 0\r\n while left <= right:\r\n mid = (left + right) // 2\r\n if prices[mid] <= m:\r\n shops_count = mid + 1\r\n left = mid + 1\r\n else:\r\n right = mid - 1\r\n \r\n print(shops_count)\r\n", "def binary_search(arr, x):\r\n low = 0\r\n high = len(arr) - 1\r\n mid = 0\r\n while low <= high:\r\n mid = (high + low) // 2\r\n if arr[mid] <= x:\r\n if arr[mid + 1] > x:\r\n return mid\r\n else:\r\n low = mid + 1\r\n else:\r\n high = mid - 1\r\n \r\nn=int(input())\r\nx=[0] + list(map(int,input().split()))\r\nx.append(1e9+1)\r\nx=sorted(x)\r\nq=int(input())\r\nfor i in range(q):\r\n c=int(input())\r\n print(binary_search(x,c))\r\n", "#蒋世刚2300016304\r\nR=lambda :int(input())\r\nn=R()\r\ns=sorted(list(map(int, input().split())))\r\nday=R()\r\ndef p():\r\n money=R()\r\n l = 0\r\n r = len(s) - 1\r\n while l <= r:\r\n mid = (l + r) // 2\r\n if s[mid] > money:\r\n r = mid - 1\r\n else:\r\n l = mid + 1\r\n return (l)\r\nfor _ in range(day):\r\n print(p())\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\nprices = list(map(int, input().split()))\nq = int(input())\nbudgets = [int(input()) for _ in range(q)]\nprices.sort()\nresults = []\nfor budget in budgets:\n left, right = 0, n - 1\n count = 0\n while left <= right:\n mid = left + (right - left) // 2\n if prices[mid] <= budget:\n count = mid + 1 \n left = mid + 1\n else:\n right = mid - 1 \n results.append(count)\nfor result in results:\n print(result)\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())\nprices = sorted(list(map(int, input().split())))\nall_prices = [0 for _ in range(100001)]\nfor price in prices:\n all_prices[price] += 1\n\npartial_sum = [0 for _ in range(100001)]\npartial_sum[0] = all_prices[0]\nfor i in range(1, 100001):\n partial_sum[i] = partial_sum[i - 1] + all_prices[i]\n\nq = int(input())\nfor _ in range(q):\n m = int(input())\n if m >= 100000:\n print(n)\n else:\n print(partial_sum[m])\n", "n = int(input())\r\na = sorted(list(map(int,input().split())))\r\nm = int(input())\r\nfor _ in range(m):\r\n x = int(input())\r\n lo = 0\r\n hi = len(a)\r\n while lo < hi:\r\n mid = (lo + hi) // 2\r\n if x < a[mid]:\r\n hi = mid\r\n else:\r\n lo = mid + 1\r\n print(lo)", "n = int(input())\r\nshop = sorted(list(map(int,input().split())))\r\nm = int(input())\r\nfor i in range(m):\r\n a = int(input()) \r\n l=0\r\n r = n-1\r\n while l<=r:\r\n mid = (l+r)//2\r\n if a < shop[mid]:\r\n r = mid-1\r\n elif a >= shop[mid]:\r\n l = mid + 1\r\n print(r+1)", "def sol():\r\n n = int(input())\r\n ls = list(map(int, input().split()))\r\n ls.sort()\r\n days = int(input())\r\n\r\n def binary_search(arr, target):\r\n left = 0\r\n right = len(arr) - 1\r\n\r\n while left <= right:\r\n mid = (left + right) // 2\r\n\r\n if arr[mid] <= target:\r\n left = mid + 1\r\n else:\r\n right = mid - 1\r\n\r\n return left\r\n\r\n for _ in range(days):\r\n num = int(input())\r\n count = binary_search(ls, num)\r\n print(count)\r\n\r\nsol()\r\n", "from bisect import bisect_right\r\nn = int(input())\r\nx = list(map(int, input().split()))\r\nx.sort()\r\nq = int(input())\r\nfor t in range(q):\r\n m = int(input())\r\n print(bisect_right(x, m))\r\n", "def main():\n\tn = int(input())\n\tx = sorted([int(i) for i in input().split()])\n\tq = int(input())\n\t\n\tfor i in range(q):\n\t\tm = int(input())\n\t\tprint(binarysearch(x, n, m))\n\ndef binarysearch(x, n, m):\n\tlow = 0\n\thigh = n - 1\n\twhile low <= high:\n\t\tmid = low + (high - low) // 2\n\t\tif (mid == n - 1 or x[mid + 1] > m) and x[mid] <= m:\n\t\t\treturn mid + 1\n\t\telif m < x[mid]:\n\t\t\thigh = mid - 1\n\t\telse:\n\t\t\tlow = mid + 1\n\treturn 0\n\nif __name__ == \"__main__\":\n\tmain()\n \t \t\t\t\t \t\t\t\t\t\t\t\t\t \t \t \t\t \t\t\t", "from bisect import bisect_right\r\nfrom sys import stdin\r\ndef input(): return stdin.readline()[:-1]\r\nn=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nq=int(input())\r\nfor i in range(q):\r\n\tqry=int(input())\r\n\tprint(bisect_right(a,qry))", "def binary_search(arr, x):\r\n left, right = 0, len(arr) - 1\r\n while left <= right:\r\n mid = (left + right) // 2\r\n if arr[mid] <= x:\r\n left = mid + 1\r\n else:\r\n right = mid - 1\r\n return left\r\n\r\nn = int(input())\r\nlist0 = list(map(int, input().split()))\r\nlist0.sort() # 对列表进行排序\r\nm = int(input())\r\nfor _ in range(m):\r\n x = int(input())\r\n count = binary_search(list0, x)\r\n print(count)", "import bisect \n \nn = int(input())\nx = list(map(int, input().split()))\nx.sort() # Sort the list of shop strengths\n\nq = int(input())\nm = []\n\nfor i in range(q):\n m.append(int(input()))\n\nfor i in range(q):\n shops = bisect.bisect_right(x, m[i]) # Use binary search to find the count of shops\n print(shops)\n\t\t \t\t \t\t \t \t\t \t \t\t \t\t\t\t\t", "ln = int(input())\r\nlst = [int(x) for x in input().split()]\r\nlst.sort()\r\nfor _ in range(int(input())):\r\n p = int(input())\r\n c = -1\r\n\r\n low = 0\r\n hi = ln-1\r\n while hi >= low:\r\n mid = int((low + hi)/2)\r\n if lst[mid] > p:\r\n hi = mid -1\r\n else:\r\n low = mid +1\r\n c = mid\r\n print(c+1)", "from bisect import bisect_right\r\n\r\ninp = int(input())\r\ninp1 = sorted(map(int, input().split()))\r\ninp2 = int(input())\r\n\r\nfor _ in range(inp2):\r\n inp3 = int(input())\r\n print(bisect_right(inp1, inp3))\r\n", "n=int(input())\r\nx=list(map(int,input().split()))\r\nq=int(input())\r\nx.sort()\r\nfor i in range(q):\r\n m = int(input())\r\n import bisect\r\n num=bisect.bisect_right(x,m)\r\n print(num)", "\r\ndef count_shops(prices, coins):\r\n shops = 0\r\n low, high = 0, len(prices)\r\n\r\n while low < high:\r\n mid = (low + high) // 2\r\n if prices[mid] <= coins:\r\n low = mid + 1\r\n shops = low\r\n else:\r\n high = mid\r\n\r\n return shops\r\n\r\nn = int(input())\r\nprices = list(map(int, input().split()))\r\nprices.sort()\r\n\r\nq = int(input())\r\n\r\nfor _ in range(q):\r\n coins = int(input())\r\n result = count_shops(prices, coins)\r\n print(result)\r\n", "from bisect import bisect_right\r\n\r\nn = int(input())\r\nprices = list(map(int, input().split()))\r\nprices.sort() \r\n\r\nq = int(input())\r\nfor _ in range(q):\r\n m = int(input())\r\n\r\n num_shops = bisect_right(prices, m)\r\n print(num_shops)", "import bisect\r\n\r\nn=int(input())\r\ncosts=list(map(int,input().split()))\r\ncosts.sort()\r\nq=int(input())\r\nfor _ in range(q):\r\n m = int(input())\r\n if m >= costs[-1]:\r\n print(n)\r\n elif m < costs[0]:\r\n print(0)\r\n else:\r\n print(bisect.bisect_right(costs,m))", "def find_insertion_index(lst, x):\r\n left, right = 0, len(lst) - 1\r\n insertion_index = len(lst) \r\n highest_repeated_index = -1\r\n\r\n while left <= right:\r\n mid = (left + right) // 2\r\n\r\n if lst[mid] == x:\r\n highest_repeated_index = mid\r\n left = mid + 1 \r\n elif lst[mid] < x:\r\n left = mid + 1\r\n else:\r\n insertion_index = mid\r\n right = mid - 1\r\n\r\n if highest_repeated_index != -1:\r\n return highest_repeated_index + 1\r\n else:\r\n return insertion_index\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\nn=int(input())\r\np=list(map(int, input().split()))\r\nq=int(input())\r\np.sort()\r\nfor _ in range(q):\r\n m=int(input())\r\n print(find_insertion_index(p,m))", "# https://codeforces.com/problemset/problem/706/B\r\n\r\nn = int(input())\r\nx = list(map(int, input().split()))\r\nx.sort()\r\nq = int(input())\r\nfor _ in range(q):\r\n m = int(input())\r\n l, r = 0, n-1\r\n while l <= r:\r\n mid = (l+r)//2\r\n if x[mid] <= m:\r\n l = mid+1\r\n else:\r\n r = mid-1\r\n print(l)", "def binary_search(n, array, left, right):\r\n if left > right:\r\n return left # 将左侧索引作为结果返回\r\n \r\n mid = (left + right) // 2\r\n \r\n if array[mid] <= n:\r\n return binary_search(n, array, mid + 1, right)\r\n else:\r\n return binary_search(n, array, left, mid - 1)\r\n\r\nn = int(input())\r\nprices = [int(x) for x in input().split()]\r\nprices.sort()\r\nq = int(input())\r\nfor i in range(q):\r\n coins = int(input())\r\n res = binary_search(coins, prices, 0 , n-1)\r\n print(res)", "import bisect\r\nn = int(input())\r\nprice = list(map(int, input().split()))\r\nprice.sort()\r\nq = int(input())\r\nfor i in range(q):\r\n quest = int(input())\r\n print(bisect.bisect_right(price, quest))\r\n", "answer = []\r\nn = int(input())\r\nprice = list(map(int, input().split()))\r\nprice.sort()\r\nlenth = len(price)\r\nnumber = [0]\r\nnum = -1\r\nfor i in price:\r\n num += 1\r\n while len(number) < i:\r\n number.append(num)\r\nmax_p = price[lenth-1]\r\n\r\nq = int(input())\r\nfor _ in range(q):\r\n money = int(input())\r\n answer.append(number[money] if money<max_p else lenth)\r\nprint('\\n'.join(map(str, answer)))", "while True:\n try:\n n = int(input())\n a = list(map(int, input().split()))\n a.sort()\n m = int(input())\n for _ in range(m):\n x = int(input())\n if x < a[0]:\n ans = 0\n elif x >= a[n - 1]:\n ans = n\n else:\n l = 0\n r = n - 1\n while l <= r:\n mid = (l + r) // 2\n if a[mid] <= x:\n ans = mid + 1\n l = mid + 1\n else:\n r = mid - 1\n print(ans)\n except EOFError:\n break\n\n\t\t\t \t \t\t\t \t \t \t \t\t \t\t\t\t \t \t \t", "n = int(input())\r\nx = [int(x) for x in input().split()]\r\nmaxx = max(x)\r\na = [0]*maxx\r\nfor i in range(n):\r\n a[x[i]-1] += 1\r\nb = [0]*maxx\r\nb[0] = a[0]\r\nfor i in range(1, maxx):\r\n b[i] = b[i-1]+a[i]\r\nfor _ in range(int(input())):\r\n print(b[min(int(input()), maxx)-1])", "n = int(input())\nl1 = list(map(int,input().split()))\nq = int(input())\nl1.sort()\n\n\nimport bisect\n\nfor i in range(q):\n x = int(input())\n index = bisect.bisect_left(l1,x+1)\n\n print(index)", "n=int(input())\r\nx=list(map(int,input().split()))\r\nmm=max(x)\r\nnum=[0]*mm\r\nfor i in x:\r\n num[i-1]+=1\r\nfor i in range(1,mm):\r\n num[i]+=num[i-1]\r\nq=int(input())\r\nfor i in range(q):\r\n m=int(input())\r\n if m<mm:\r\n print(num[m-1])\r\n else:\r\n print(n)", "import math\r\n# Shortcut for input\r\ndef I(): return int(input())\r\ndef MI(): return map(int, input().split())\r\ndef LI(): return list(map(int, input().split()))\r\ndef S(): return input()\r\n# Constants\r\nmod = 10**9 + 7\r\n\r\nn = I()\r\na = LI()\r\nq = I()\r\na.sort()\r\n\r\ndef binary(b):\r\n l = 0 \r\n r = len(a)-1\r\n res = 0\r\n while l <= r:\r\n mid = (l+r)//2\r\n if a[mid] == b:\r\n res = mid\r\n l =mid+1\r\n \r\n elif a[mid] > b:\r\n r = mid-1\r\n elif a[mid] < b:\r\n l =mid+1\r\n if res != 0:\r\n return res+1\r\n else:\r\n return l\r\n\r\n \r\nwhile q:\r\n b = I()\r\n print(binary(b))\r\n q-=1", "from bisect import bisect_right\r\n\r\nn = int(input())\r\nx = list(map(int,input().split()))\r\nx.sort()\r\nfor i in range(int(input())):\r\n print(bisect_right(x, int(input())))", "n = int(input())\r\nprices1 = list(map(int, input().split()))\r\nq = int(input())\r\nprices1.sort()\r\nres = 0\r\nflag = False\r\nfor i in range(q):\r\n m = int(input())\r\n low = 0\r\n high = len(prices1) - 1\r\n res = 0\r\n while high >= low and not flag:\r\n middle = (low + high) // 2\r\n guess = prices1[middle]\r\n if guess > m:\r\n high = middle - 1\r\n else:\r\n res += middle-low+1\r\n low = middle + 1\r\n print(res)", "def bi(q,x,l,r):\n n0=n=r-l+1\n if n%2:\n n-=1\n n//=2\n else:\n n//=2\n if n0==2:#得到最后的小数指针l和大数指针r\n return l+1\n else:\n if q >= x[l + n ]:\n ind = bi(q, x, l + n, r)\n else:\n ind = bi(q, x, l, l + n)\n return ind\n\nn=int(input())\nx=list(map(int,input().split()))\nx=sorted(x)\nm=int(input())\nfor i in range(m):\n q=int(input())\n if n>1:\n ind = bi(q, x, 0, n - 1)\n if q < x[0]: ind -= 1\n if q >= x[-1]: ind += 1\n print(ind)\n else:\n print([0,1][q>=x[0]])\n", "import bisect\r\ninput()\r\nA=sorted(list(map(int, input().split())))\r\nfor _ in range(int(input())):\r\n print(bisect.bisect(A,int(input())))\r\n", "n=int(input())\r\naa=list(map(int,input().split()))\r\naa.sort()\r\nbb=[0]*aa[-1]\r\nt=0\r\nfor i in range(0,n-1):\r\n for t in range(aa[i],aa[i+1]):\r\n bb[t]=i+1\r\n#print(bb)\r\nq=int(input())\r\nfor i in range(0,q):\r\n m=int(input())\r\n if m>=aa[-1]:\r\n print(n)\r\n else:\r\n print(bb[m])", "\r\n\r\nn = int(input())\r\nx = list(map(int,input().split()))\r\nx.sort()\r\n\r\ndef binarySearch():\r\n start = 0\r\n end = n\r\n if m < x[0] :return 0\r\n if m>100000 or m>=x[-1]: return n\r\n while start<=end:\r\n mid = (end+start)//2\r\n if m>=x[mid-1] and m<x[mid]:\r\n return mid\r\n elif m>=x[mid]:\r\n start = mid+1\r\n else:\r\n end = mid-1\r\n\r\nfor i in range(int(input())):\r\n m = int(input())\r\n c = 0\r\n print(binarySearch())", "import bisect\n\nn = int(input())\nprices = sorted(list(map(int, input().split())))\nq = int(input())\n\nfor tle in range(q):\n temp = int(input())\n ans = bisect.bisect_right(prices, temp)\n print(ans)\n \t\t \t\t\t \t \t \t \t\t \t", "input()\r\nx = [int(_) for _ in input().split()]\r\nnm = max(x)\r\nc = [0]*(nm+1)\r\nfor i in x:\r\n c[i] += 1\r\nfor i in range(2, nm+1):\r\n c[i] += c[i-1]\r\n#ans = []\r\nfor _ in range(int(input())):\r\n m = int(input())\r\n if m > nm:\r\n print(c[nm])\r\n else:\r\n print(c[m])", "n = int(input())\r\nx = sorted(list(map(int,input().split())))\r\nq = int(input())\r\nfor i in range(q):\r\n m = int(input())\r\n l = 0\r\n r = n-1\r\n while l <= r:\r\n mid = (l+r)//2\r\n if m < x[mid]:\r\n r = mid - 1\r\n elif m >= x[mid]:\r\n l = mid + 1\r\n print(r+1)", "n = int(input())\r\nx = list(int(num) for num in input().split())\r\n\r\nsorted_x = [0] * 10 ** 5\r\nfor xi in x:\r\n sorted_x[xi - 1] += 1\r\n\r\naffordable = [0] * 10 ** 5\r\naffordable[0] = sorted_x[0]\r\nfor i in range(1, 10 ** 5):\r\n affordable[i] = affordable[i - 1] + sorted_x[i]\r\n\r\nq = int(input())\r\nans = [0] * q\r\nfor i in range(q):\r\n mi = int(input())\r\n if mi >= 10 ** 5:\r\n ans[i] = n\r\n else:\r\n ans[i] = affordable[mi - 1]\r\n\r\nprint(*ans, sep = '\\n')", "n=int(input())\r\narr=list(map(int,input().split()))\r\nd=int(input())\r\narr.sort()#[3,6,8,10,11]\r\nfor _ in range(d):\r\n x=int(input())\r\n start=0;end=n-1;ans=0\r\n while(start<=end):\r\n mid=(start+end)//2\r\n if arr[mid]>x:\r\n end=mid-1\r\n \r\n else:\r\n start=mid+1 \r\n ans=start \r\n print(ans) ", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Nov 11 22:31:10 2023\r\n\r\n@author: ZHAO XUDI\r\n\"\"\"\r\n\r\nshop_num = int(input())\r\ndrink_price = list(map(int,input().split()))\r\nsorted_price = sorted(drink_price)\r\n\r\ndays = int(input())\r\nfor n in range(days):\r\n coins = int(input())\r\n left, right = 0,shop_num-1 \r\n while left<=right:\r\n mid = (left+right)//2\r\n if coins>=sorted_price[mid]:\r\n left = mid+1\r\n else:\r\n right = mid-1\r\n print(left)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Nov 7 17:04:52 2023\r\n\r\n@author: gzk16\r\n\"\"\"\r\n\r\nn = int(input())\r\nshops = list(map(int,input().split()))\r\nshops.sort()\r\nq = int(input())\r\ncoins = []\r\nfor _ in range(q):\r\n coins.append(int(input()))\r\nmax_sh = max(shops)\r\n\r\ndp = [0]*(max_sh)+[n]\r\nfor i in range(n-1):\r\n dp[shops[i]:shops[i+1]] = [i+1]*(shops[i+1]-shops[i])\r\n\r\nfor coin in coins:\r\n if coin > max_sh:\r\n print(n)\r\n else:\r\n print(dp[coin])", "n = int(input())\n\nprices = sorted(map(int, input().split()))\n\nq = int(input())\n\nfor i in range(q):\n\tm = int(input())\n\tans = 0\n\tlow = 0\n\thigh = n - 1\n\twhile low <= high:\n\t\tmid = (low + high) // 2\n\t\tif prices[mid] <= m:\n\t\t\tans = mid + 1\n\t\t\tlow = mid + 1\n\t\telse:\n\t\t\thigh = mid - 1\n\tprint(ans)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Nov 7 11:14:24 2023\r\n\r\n@author: ghp\r\n\"\"\"\r\n\r\nn=int(input())\r\nshop=list(map(int,input().split()))\r\nshop.sort()\r\nq=int(input())\r\nfor i in range(q):\r\n m=int(input())\r\n maxm=n-1\r\n minm=0\r\n while True:\r\n if m<shop[0]:\r\n h=-1\r\n break\r\n elif m>=shop[n-1]:\r\n h=n-1\r\n break\r\n else:\r\n h=(maxm+minm)//2\r\n if shop[h]<=m and shop[h+1]>m:\r\n break\r\n elif shop[h+1]<=m:\r\n minm=h\r\n elif shop[h]>m:\r\n maxm=h\r\n \r\n print(h+1)\r\n ", "def re(a,n,m):\r\n l=0\r\n h=m-1\r\n while l<=h:\r\n mid=(l+h)//2\r\n if a[mid]<=n:\r\n l=mid+1\r\n else:\r\n h=mid-1\r\n return l\r\nm=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nfor i in range(int(input())):\r\n n=int(input())\r\n print(re(a,n,m))", "import sys\r\nimport bisect\r\ninput = sys.stdin.readline\r\n\r\ndef main() -> None :\r\n bottlePrices:list[int] = []\r\n dailyCoins:list[int] = []\r\n #region userInputs() -> None\r\n input()\r\n bottlePrices = list(map(int, input().split()))\r\n dailyCoins = [int(input()) for _ in range(int(input()))]\r\n #endregion\r\n\r\n dailyPossibleBottles:list[int] = []\r\n #region dailyPossibleBottles(bottlePrices: list[int], dailyCoins: list[int]) -> list[int]\r\n SORTED_BOTTLE_PRICES:list[int] = sorted(bottlePrices)\r\n for dailyCoin in dailyCoins :\r\n dailyPossibleBottle:int = -1\r\n #region dailyPossibleBottls(sortedBottlePrices: list[int], dailyCoin: int) -> int\r\n dailyPossibleBottle = bisect.bisect_right(SORTED_BOTTLE_PRICES, dailyCoin)\r\n #endregion\r\n dailyPossibleBottles.append(dailyPossibleBottle)\r\n #endregion\r\n\r\n #region printDailyPossibleBottles(dailyPossibleBottles: list[int]) -> None\r\n print(\"\\n\".join(map(str, dailyPossibleBottles)))\r\n #endregion\r\n\r\nmain()", "import bisect\n\nn = int(input())\na = list(map(int, input().split()))\nm = int(input())\na.sort()\n\nfor _ in range(m):\n k = int(input())\n ans = bisect.bisect_right(a, k)\n print(ans)\n \t\t\t\t \t\t\t\t\t\t \t \t \t \t \t", "import bisect\r\nx=int(input())\r\na=[int(i) for i in input().split()]\r\na.sort()\r\nn=int(input())\r\nfor i in range(n):\r\n num=int(input())\r\n mid=len(a)//2\r\n Index=bisect.bisect_right(a,num)\r\n print(Index)", "number_of_shops = int(input())\r\nbeecola_prices = list(map(int, input().split()))\r\n\r\nbeecola_prices.sort()\r\n\r\nnumber_of_day_vasily_plan_to_buy = int(input())\r\n\r\nfor _ in range(number_of_day_vasily_plan_to_buy) :\r\n\tbudget = int(input())\r\n\r\n\tl, r = 0, number_of_shops - 1\r\n\tres = -1\r\n\r\n\twhile l<=r:\r\n\t\tmid = (l+r)//2\r\n\t\tif beecola_prices[mid] <= budget :\r\n\t\t\tres=mid\r\n\t\t\tl=mid+1\r\n\t\telse :\r\n\t\t\tr=mid-1\r\n\r\n\tprint(res+1)\r\n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nmx=max(a)\r\nx=[0]*(mx+1)\r\nfor i in a:x[i]+=1\r\nfor i in range(1,mx+1):\r\n x[i]+=x[i-1]\r\nq=int(input())\r\nfor i in range(q):\r\n m=int(input())\r\n print(n if m>mx else x[m])", "n=int(input())\r\np=list(map(int,input().split()))\r\np.sort()\r\nm=int(input())\r\nindex,d=0,[]\r\nfor _ in range(m):\r\n d.append([int(input()),index,0])\r\n index+=1\r\nd.sort()\r\nfor j in range(n):\r\n if d[0][0]>=p[j]:\r\n d[0][2]+=1\r\n else:\r\n break\r\nfor i in range(1,m):\r\n d[i][2]+=d[i-1][2]\r\n for j in range(d[i-1][2],n):\r\n if d[i][0]>=p[j]:\r\n d[i][2]+=1\r\n else:\r\n break\r\nd.sort(key=lambda x:x[1])\r\nfor _ in d:\r\n print(_[2])", "n = int(input())\r\nprices = list(map(int, input().split()))\r\nprices.sort()\r\nq = int(input())\r\nmoney = []\r\nresult = []\r\n\r\nfor x in range(q):\r\n money.append(int(input()))\r\n\r\nfor y in money:\r\n low = 0\r\n high = n - 1\r\n while low <= high:\r\n mid = (low + high) // 2\r\n if prices[mid] <= y:\r\n low = mid + 1\r\n else:\r\n high = mid - 1\r\n result.append(low)\r\n\r\nfor j in result:\r\n print(j)\r\n", "n = int(input()) \r\narray = sorted(list(map(int,input().split())))\r\nd = int(input())\r\nfor b in range(d):\r\n coin = int(input())\r\n l,r = 0,n-1\r\n flag = True\r\n while l<=r:\r\n mid = (l+r)//2\r\n if array[mid]==coin:\r\n l = mid+1\r\n flag = False\r\n elif array[mid]<coin:\r\n l = mid+1\r\n flag = False\r\n elif array[mid]>coin:\r\n r = mid-1\r\n else:\r\n print(0 if flag else l)", "def count_shops(n, prices, q, coins):\r\n prices.sort()\r\n num_shops = [0] * q\r\n\r\n for i in range(q):\r\n num_shops[i] = bisect_right(prices, coins[i])\r\n\r\n return num_shops\r\n\r\nif __name__ == \"__main__\":\r\n from bisect import bisect_right\r\n\r\n n = int(input()) \r\n prices = list(map(int, input().split())) \r\n q = int(input()) \r\n coins = []\r\n for _ in range(q):\r\n coins.append(int(input())) \r\n\r\n result = count_shops(n, prices, q, coins)\r\n print(*result)\r\n", "from bisect import bisect_right\r\nn = int(input())\r\nx = sorted(map(int, input().split()))\r\nq = int(input())\r\nfor _ in range(q):\r\n print(bisect_right(x, int(input())))\r\n ", "n = int(input())\r\na = sorted(list(map(int,input().split())))\r\n\r\nstore = []\r\nfor j in range(a[0]):\r\n store.append(0)\r\ni = 1\r\nwhile i<n:\r\n if a[i] == a[i-1]:\r\n i+=1\r\n else:\r\n for j in range(a[i-1],a[i]):\r\n store.append(i)\r\n i+=1\r\n\r\nmax_price = len(store) - 1\r\nfor _ in range(int(input())):\r\n q = int(input())\r\n if q > max_price:\r\n print(n)\r\n else:\r\n print(store[q])", "n = int(input())\r\n\r\nprices = [int(_) for _ in input().split()]\r\n\r\nprices.sort()\r\n\r\nq = int(input())\r\n\r\ndef bs(query):\r\n\r\n l = 0\r\n r = n-1\r\n\r\n while l<=r:\r\n\r\n m = (l+r)//2\r\n\r\n if prices[m] > query:\r\n r = m-1\r\n else:\r\n l = m+1\r\n \r\n return l\r\n\r\nfor _ in range(q):\r\n\r\n print(bs(int(input())))", "import sys\r\nimport bisect\r\n\r\nn = int(sys.stdin.readline())\r\nprices = list(map(int, sys.stdin.readline().split()))\r\nprices.sort()\r\n\r\nq = int(sys.stdin.readline())\r\nfor _ in range(q):\r\n print(bisect.bisect_right(prices, int(sys.stdin.readline().strip())))\r\n", "\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nm=int(input())\r\nimport bisect\r\nfor j in range(m):\r\n s=int(input())\r\n index=bisect.bisect(l,s)\r\n print(index)", "class knot:\r\n def __init__(self, array, baseorder=1):\r\n # print(f'init array:{array}')\r\n # if not array:\r\n # self.value = None\r\n # return\r\n n = len(array)\r\n m = (n - 1) // 2\r\n # print(f\"m:{m}\")\r\n self.value = array[m]\r\n if array[0:m]:\r\n self.left = knot(array[0:m], baseorder)\r\n else:\r\n self.left = None\r\n if array[m + 1:n]:\r\n self.right = knot(array[m + 1:n], m + baseorder + 1)\r\n else:\r\n self.right = None\r\n self.order = m + baseorder\r\n # print(m)\r\n\r\n def __repr__(self):\r\n return f\"[{self.order}: {self.value},\\nleft->{self.left},\\nright->{self.right}]\"\r\n\r\n def search_maximun_leq(self, value):\r\n knots = self\r\n while True:\r\n if knots.value > value:\r\n if knots.left is not None:\r\n knots = knots.left\r\n else:\r\n return knots.order - 1\r\n else:\r\n if knots.right is not None:\r\n knots = knots.right\r\n else:\r\n return knots.order\r\n\r\n\r\n# print(knot(list(range(10))).search_maximun_leq(-100))\r\n\r\nn = int(input())\r\npricelist = sorted(list(map(int, input().split())))\r\n\r\ntree = knot(pricelist)\r\n\r\nfor i in range(int(input())):\r\n money = int(input())\r\n print(tree.search_maximun_leq(money))", "#变动上下界，相当于夹逼\r\ndef search(t):\r\n a = 0\r\n b = n\r\n while a != b-1:\r\n temp = (a+b)//2\r\n if x[temp] > t:\r\n b = temp\r\n else:\r\n a = temp\r\n return a\r\nn = int(input())\r\nx = [int(x) for x in input().split()]\r\nq = int(input())\r\nx.sort()\r\nx.insert(0, 0)\r\nfor i in range(q): \r\n p = int(input()) \r\n if p >= x[n]: \r\n print(n) \r\n else:\r\n print(search(p))", "n=int(input())\r\nshops=list(map(int,input().split()))\r\nshops.sort()\r\nq=int(input())\r\nfor i in range(q):\r\n money=int(input())\r\n count=0\r\n left,right=0,n-1\r\n while left<=right:\r\n mid=(left+right)//2\r\n if money>=shops[mid]:\r\n count=mid+1\r\n left=mid+1\r\n else:\r\n right=mid-1\r\n print(count)", "def count_shops(n, x, q, m):\r\n sorted_x = sorted(x)\r\n result = []\r\n \r\n for cost in m:\r\n left = 0\r\n right = n - 1\r\n position = n\r\n \r\n while left <= right:\r\n mid = (left + right) // 2\r\n \r\n if sorted_x[mid] <= cost:\r\n left = mid + 1\r\n else:\r\n position = mid\r\n right = mid - 1\r\n \r\n result.append(position)\r\n \r\n return result\r\n\r\nn = int(input())\r\nx = list(map(int, input().split()))\r\nq = int(input())\r\nm = [int(input()) for _ in range(q)]\r\n\r\noutput = count_shops(n, x, q, m)\r\nfor o in output:\r\n print(o)\r\n", "n = int(input())\r\nprices = list(map(int, input().split()))\r\nq = int(input())\r\n\r\nprices.sort() # Sort the prices in ascending order\r\n\r\nfor _ in range(q):\r\n m = int(input())\r\n # Use binary search to find the number of shops where Vasiliy can buy the drink\r\n left, right = 0, n\r\n while left < right:\r\n mid = (left + right) // 2\r\n if prices[mid] <= m:\r\n left = mid + 1\r\n else:\r\n right = mid\r\n print(left)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Nov 12 19:18:49 2023\r\n\r\n@author: 20311\r\n\"\"\"\r\ndef check(a):\r\n if a<=prices[-1]-1:\r\n return ans[a]\r\n else:\r\n return n\r\nn=int(input())\r\nprices=list(map(int,input().split()))\r\nprices.append(0)\r\nprices.sort()\r\nans=[]\r\nfor i in range(n):\r\n for j in range(prices[i],prices[i+1]):\r\n ans.append(i)\r\n \r\nans=tuple(ans)\r\nq=int(input())\r\nfor i in range(q):\r\n a=int(input())\r\n print(check(a))", "import bisect\r\nn=int(input())\r\nprices=list(map(int,input().split()))\r\nprices.sort()\r\nq=int(input())\r\nfor i in range(q):\r\n coins=int(input())\r\n shops=bisect.bisect_right(prices,coins)\r\n print(shops)", "n=int(input())\r\nprices=list(map(int,input().split()))\r\nprices.sort()\r\nq=int(input())\r\nfor _ in range(q):\r\n l=0\r\n r=len(prices)-1\r\n m=int(input())\r\n if prices[0]>m:\r\n print(0)\r\n continue\r\n if prices[n-1]<=m:\r\n print(n)\r\n continue\r\n while (l<=r):\r\n if r-l==1:\r\n break\r\n if r==l:\r\n break\r\n now=(r+l)//2\r\n if (m<prices[now]):\r\n r=now-1\r\n else:\r\n l=now\r\n if prices[r]<=m:\r\n print(r+1)\r\n else:\r\n print(l+1)", "n = int(input())\r\nprices = [int(i) for i in input().split()]\r\nprices.sort()\r\nq = int(input())\r\nfor _ in range(q):\r\n coins = int(input())\r\n #two-divide search\r\n list = prices\r\n a, b = 0, len(list) - 1\r\n while True:\r\n if a == b:\r\n if coins >= list[a]:\r\n a += 1\r\n break\r\n index = int((a + b + 1) / 2)\r\n compare = list[index]\r\n if coins >= compare:\r\n a = index\r\n else:\r\n b = index - 1\r\n print(a)\r\n\r\n\r\n\r\n\r\n", "import bisect\r\nn=int(input())\r\nlst=sorted(list(map(int,input().split())))\r\nm=int(input())\r\nw=[]\r\nfor i in range(m):\r\n q=int(input())\r\n print(bisect.bisect_right(lst,q))", "\r\nfrom bisect import bisect_right\r\n\r\nn = int(input())\r\nX = list(map(int, input().split()))\r\nq = int(input())\r\nM=[]\r\nfor _ in range(q):\r\n M.append(int(input()))\r\n\r\nX.sort()\r\n\r\nfor m in M:\r\n # ...\r\n print(bisect_right(X, m))\r\n", "import bisect\r\n\r\nn = int(input())\r\nprices = list(map(int, input().split()))\r\nq = int(input())\r\nprices.sort()\r\nfor _ in range(q):\r\n coins = int(input())\r\n index = bisect.bisect_right(prices, coins)\r\n print(index)", "import bisect as bis\nn = int(input())\nmagazine = list(map(int, input().split()))\nmagazine.sort()\nday = int(input())\nfor i in range(day):\n money = int(input())\n print(bis.bisect_right(magazine, money))", "import sys\r\nfrom bisect import bisect_right\r\n\r\nshops = int(input())\r\nprices = list(map(int, input().split()))\r\ndays = int(input())\r\nmoney = sys.stdin.read().splitlines()\r\n\r\nprices.sort()\r\nfor day in range(days):\r\n print(bisect_right(prices, int(money[day])))\r\n", "#罗誉城 化学与分子工程学院 2300011776\r\ninput()\r\nimport bisect\r\nshops=sorted([i for i in map(int,input().split())])\r\nfor i in range(int(input())):\r\n print(bisect.bisect(shops,int(input())))", "#-*- coding: utf-8 -*\n'''\nCreated on Fri Nov 10\nauthor 钱瑞 2300011480\n'''\nimport bisect\nn=int(input())\nl_x=list(map(int,str(input()).split(' ')))\nl_x=sorted(l_x)\nl_an=[]\nq=int(input())\nfor i in range(q):\n m=int(input())\n l_an.append(bisect.bisect_right(l_x,m))\nfor i in range(q):\n print(l_an[i])", "n = int(input())\nx = sorted(list(map(int, input().split())))\nq = int(input())\nfor _ in range(q):\n k = int(input())\n lo, hi = 0, len(x)\n while lo < hi:\n mid = (lo + hi) // 2\n if k < x[mid]:\n hi = mid\n else:\n lo = mid + 1\n print(lo)", "import math\r\nn = int(input())\r\narr = [int(x) for x in input().split()]\r\nq = int(input())\r\n\r\narr.sort()\r\n\r\ndef greatest(start, end, arr, m):\r\n if end - start == 1:\r\n print(start + 1)\r\n\r\n else:\r\n mid = (end + start)//2\r\n\r\n if arr[mid] > m:\r\n if arr[mid - 1] <= m:\r\n print(mid)\r\n else:\r\n greatest(start, mid, arr, m)\r\n else:\r\n if arr[mid + 1] > m:\r\n print(mid + 1)\r\n else:\r\n greatest(mid, end, arr,m)\r\n \r\nfor a in range(q):\r\n m = int(input())\r\n\r\n if m < arr[0]:\r\n print(0)\r\n\r\n elif m >= arr[n - 1]:\r\n print(n)\r\n else:\r\n greatest(0, n - 1, arr, m)\r\n", "#M\r\nimport bisect\r\nn = int(input())\r\nx = [int(x) for x in input().split()]\r\nx.sort()\r\nq = int(input())\r\nfor i in range(q):\r\n m = int(input())\r\n print(bisect.bisect(x, m))", "import math,sys,bisect\r\ndef solve():\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n a.sort()\r\n days=int(input())\r\n for _ in range(days):\r\n price=int(input())\r\n index=bisect.bisect_right(a,price)\r\n print(index)\r\n \r\n \r\nif __name__==\"__main__\":\r\n solve()\r\n ", "q = int(input())\r\nr = list(sorted(map(int, input().split())))\r\nt = int(input())\r\nfor _ in range(t):\r\n p = int(input())\r\n x = 0\r\n y = len(r)\r\n while x < y:\r\n m = x + (y - x) // 2\r\n if r[m] > p:\r\n y = m\r\n else:\r\n x = m+1\r\n print(y)\r\n ", "\n\nshops = int(input())\nprices = list(map(int, input().split()))\nprices.sort()\ndays = int(input())\nfor _ in range(days):\n money = int(input())\n def binary_search(money):\n left, right = 0, len(prices) - 1\n while left <= right:\n mid = (left + right) // 2\n if prices[mid] <= money:\n left = mid + 1\n else:\n right = mid - 1\n return left\n count = binary_search(money)\n print(count)", "n = int(input())\r\nprices = list(map(int,input().split()))\r\nq = int(input())\r\n\r\nprices.sort()\r\n\r\nfor i in range(q):\r\n m = int(input())\r\n cnt = 0\r\n l = 0\r\n r = n-1\r\n \r\n while (l<=r):\r\n mid = l + (r-l)//2\r\n if(prices[mid] <= m) :\r\n cnt = mid+1 \r\n l = mid +1 \r\n \r\n else:\r\n r = mid-1\r\n \r\n \r\n \r\n print(cnt)", "import bisect\nn=int(input())\nans=[]\nprice=list(map(int,input().split()))\nprice.sort()\nm=int(input())\nfor i in range(m):\n coin=int(input())\n ans.append(bisect.bisect_right(price,coin))\nfor i in ans:\n print(i)", "from bisect import bisect_right\r\nfrom 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 q = int(stdin.readline())\r\n\r\n A.sort()\r\n\r\n for _ in range(q):\r\n m = int(stdin.readline())\r\n print(bisect_right(A, m))\r\n\r\n\r\nsolve()\r\n", "n=int(input())\r\nimport bisect\r\nx=sorted(map(int,input().split()))\r\nq=int(input())\r\nfor i in range(q):\r\n print(bisect.bisect(x,int(input())))", "def find_shops_to_buy_drink(n, prices, q, days):\r\n prices.sort()\r\n \r\n result = []\r\n \r\n for day in days:\r\n left, right = 0, n - 1\r\n count = 0\r\n while left <= right:\r\n mid = (left + right) // 2\r\n if prices[mid] <= day:\r\n count = mid + 1\r\n left = mid + 1\r\n else:\r\n right = mid - 1\r\n result.append(count)\r\n return result\r\nn = int(input())\r\nprices = list(map(int, input().split()))\r\nq = int(input())\r\ndays = [int(input()) for _ in range(q)]\r\nresult = find_shops_to_buy_drink(n, prices, q, days)\r\nfor count in result:\r\n print(count)", "n = int(input())\r\nx = input().split()\r\nnums = [int(i) for i in x]\r\nq = int(input())\r\nqueries = []\r\nfor i in range(q):\r\n x = input()\r\n queries.append(int(x))\r\nnums.sort()\r\nfrom bisect import bisect_right\r\nfor i in queries:\r\n print(bisect_right(nums,i))", "def binary_search(a,m):\r\n low = 0\r\n high = len(a)\r\n while low < high:\r\n mid = (low+high)//2\r\n if a[mid] > m:\r\n high = mid\r\n else:\r\n low = mid+1\r\n return low\r\n \r\nn = int(input())\r\na = sorted(map(int,input().split()))\r\nq = int(input())\r\nfor i in range(q):\r\n m = int(input())\r\n print(binary_search(a,m))", "n = int(input())\r\nlst = [int(i) for i in input().split()]\r\nlst.sort()\r\n\r\nfor q in range(int(input())):\r\n x = int(input())\r\n l = 0\r\n r = n - 1\r\n while (r - l) >= 2:\r\n mid = (r + l) >> 1\r\n if x < lst[mid]:\r\n r = mid\r\n else:\r\n l = mid\r\n m = -1\r\n for i in range(l, r + 1):\r\n if lst[i] <= x:\r\n m = i\r\n print(m + 1)\r\n", "def search(n, i, j):\r\n global l\r\n if j-i <= 1:\r\n return i\r\n else:\r\n k = (i+j)//2\r\n if l[k] <= n:\r\n return search(n, k, j)\r\n else:\r\n return search(n, i, k)\r\n\r\n\r\nn = int(input())\r\nl = sorted([0]+list(map(int, input().split())))\r\nq = int(input())\r\nfor i in range(q):\r\n m = int(input())\r\n if m >= l[-1]:\r\n print(n)\r\n elif m < l[1]:\r\n print(0)\r\n else:\r\n print(search(m, 0, n))\r\n", "n=int(input())\r\nx=list(map(int,input().split()))\r\nx.sort()\r\n\r\nnum_shop=[]\r\nfor i in range(0,n):\r\n if i==0:\r\n num_shop+=[i]*x[i]\r\n else:num_shop+=[i]*(x[i]-x[i-1])\r\n\r\nq=int(input())\r\ncoins=[]\r\nfor _ in range(q):\r\n mi=int(input())\r\n if mi<len(num_shop):\r\n print(num_shop[mi])\r\n else:print(n)", "n = int(input())\r\nprices = list(map(int, input().split()))\r\nq = int(input())\r\nbudgets = [int(input()) for _ in range(q)]\r\n\r\nprices.sort()\r\n\r\nanswer = []\r\nfor budget in budgets:\r\n left = 0\r\n right = n - 1\r\n count = 0\r\n while left <= right:\r\n mid = (left + right) // 2\r\n if prices[mid] <= budget:\r\n count = mid + 1\r\n left = mid + 1\r\n else:\r\n right = mid - 1\r\n answer.append(count)\r\n\r\nfor ans in answer:\r\n print(ans)", "import bisect\r\nn = int(input())\r\nxlist = sorted(map(int, input().split()))\r\nq = int(input())\r\nmlist = []\r\nfor _ in range(q):\r\n m = int(input())\r\n mlist.append(m)\r\n\r\noutput = []\r\nfor m in mlist:\r\n count = bisect.bisect_right(xlist, m)\r\n output.append(str(count))\r\nprint('\\n'.join(output))", "n = int(input())\r\nprices = sorted(list(map(int, input().split())))\r\nq = int(input())\r\ncoins = [int(input()) for _ in range(q)]\r\n\r\n# 创建DP数组并初始化\r\ndp = [0] * 100001\r\nfor price in prices:\r\n dp[price] += 1\r\nfor i in range(1, len(dp)):\r\n dp[i] += dp[i-1]\r\n\r\n# 处理并输出每一天的结果\r\nfor coin in coins:\r\n if coin >= len(dp):\r\n print(dp[-1])\r\n else:\r\n print(dp[coin])", "from bisect import bisect_right\r\n\r\nn = int(input())\r\nx = list(map(int, input().split()))\r\nx.sort()\r\nq = int(input())\r\nfor _ in range(q):\r\n print(bisect_right(x, int(input())))", "#23n2200017708\nn = int(input())\na = list(map(int, input().split()))\na.sort()\nq = int(input())\n\ndef find(x):\n l, r = 0, n\n while l < r:\n mid = (l + r) // 2\n if a[mid] > x:\n r = mid\n else:\n l = mid + 1\n return l\n\nfor _ in range(q):\n b = int(input())\n print(find(b))", "n = int(input())\ncosts = list(map(int, input().split()))\ncosts.sort()\nk = int(input())\n\nfor _ in range(k):\n x = int(input())\n l = 0\n r = n-1\n ans = 0\n while l<=r:\n mid = l+(r-l)//2\n if costs[mid]<=x:\n ans = mid+1\n l = mid+1\n else:\n r = mid-1\n print(ans)\n\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\n\r\nq = int(input())\r\n\r\nfor _ in range(q):\r\n target = int(input())\r\n\r\n left, right = 0, len(arr) - 1\r\n lower_bound_index = -1 # Initialize to -1\r\n\r\n while left <= right:\r\n mid = left + (right - left) // 2\r\n\r\n # if arr[mid] == target:\r\n # lower_bound_index = mid\r\n # right = mid - 1 Continue searching in the left half for the lower bound\r\n if arr[mid] <= target:\r\n lower_bound_index = mid\r\n left = mid + 1\r\n else:\r\n right = mid - 1\r\n\r\n # Print the position (1-based) or 0 if not found\r\n if lower_bound_index == -1:\r\n print(0)\r\n else:\r\n print(lower_bound_index + 1)\r\n", "def counter(arr, t):\r\n l = 0\r\n r = len(arr)\r\n t += 1\r\n \r\n while (l<r):\r\n mid = l + (r-l)//2\r\n \r\n if (arr[mid]<t):\r\n l = mid+1\r\n else:\r\n r = mid\r\n \r\n return l\r\n \r\n\r\nn = int(input())\r\nxarr = input().split()\r\nxarr = [int(x) for x in xarr]\r\nxarr.sort()\r\nq = int(input())\r\nfor _ in range(q):\r\n m = int(input())\r\n print(counter(xarr, m))", "n = int(input())\r\nx_lst = sorted(list(map(int,input().split())))\r\nnum = x_lst[-1]\r\nq = int(input())\r\nresult = []\r\nfor _ in range(q):\r\n m = int(input())\r\n low = 0\r\n high = n - 1\r\n if m >= num:\r\n result.append(n)\r\n else:\r\n low = 0\r\n high = n - 1\r\n count = 0\r\n while low <= high:\r\n middle = (low + high)//2\r\n middle_value = x_lst[middle]\r\n if m >= middle_value:\r\n count = middle + 1\r\n low = middle + 1\r\n else:\r\n high = middle - 1\r\n result.append(count)\r\nfor letter in result:\r\n print(letter)", "from os import path\r\nimport sys\r\nfrom collections import Counter\r\nfrom math import gcd , sqrt\r\nmod = 10**9 + 7 \r\n#::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::\r\nif(path.exists('INPUT.txt')):\r\n sys.stdin = open(\"input.txt\",\"r\")\r\n sys.stdout = open(\"output.txt\",\"w\")\r\n#::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::\r\n\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\ndef tc():\r\n return int(input())\r\n\r\ndef ni():\r\n return int(input())\r\n\r\ndef si():\r\n return str(input())\r\n\r\ndef mii():\r\n return map(int,input().split())\r\n\r\ndef msi():\r\n return map(str,input().split())\r\n\r\ndef lsti():\r\n return list(map(int,input().split()))\r\n\r\ndef lssi():\r\n return list(map(str,input().split()))\r\n\r\ni2c = lambda n: chr(ord('a') + n)\r\nc2i = lambda c: ord(c) - ord('a')\r\n\r\n#::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::\r\n\r\ndef binary_search(lst, n):\r\n left, right = 0, len(lst) - 1\r\n result = -1\r\n\r\n while left <= right:\r\n mid = (left + right) // 2\r\n\r\n if lst[mid] <= n:\r\n result = mid\r\n right = mid - 1\r\n else:\r\n left = mid + 1\r\n\r\n return result\r\n\r\ndef main():\r\n a = ni()\r\n lst = lsti()\r\n lst.sort(reverse = True)\r\n q = ni()\r\n\r\n for j in range(q):\r\n n = int(input())\r\n index = binary_search(lst, n)\r\n\r\n if index == -1:\r\n cnt = 0\r\n else:\r\n cnt = len(lst) - index \r\n\r\n print(cnt)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "#王铭健，工学院 2300011118\r\ncoin_list = []\r\nresult_dict = {}\r\nindex = 0\r\nn = int(input())\r\nprice_list = sorted(list(map(int, input().split())))\r\nq = int(input())\r\nfor i in range(q):\r\n coin_list.append(int(input()))\r\ncoin_list_new = sorted(coin_list)\r\nfor j in range(q):\r\n for k in range(index, n):\r\n if price_list[k] <= coin_list_new[j]:\r\n index += 1\r\n else:\r\n break\r\n result_dict[coin_list_new[j]] = index\r\nfor t in range(q):\r\n print(result_dict[coin_list[t]])", "s = int(input())\r\nli = sorted(map(int, input().split()))\r\nd = int(input())\r\nfor i in range(d):\r\n n = int(input())\r\n low = 0\r\n high = s - 1\r\n while low <= high:\r\n mid = (low + high) // 2\r\n if li[mid] <= n:\r\n low = mid + 1\r\n else:\r\n high = mid - 1\r\n\r\n print(low)", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef lower_bound(arr, x):\r\n n = len(arr)\r\n left = -1\r\n right = n\r\n while left + 1 < right:\r\n mid = (left + right)\r\n if x >= arr[mid]:\r\n left = mid\r\n else:\r\n right = mid\r\n return left\r\n\r\n\r\ndef main():\r\n n = int(input().strip())\r\n arr = list(map(int, input().strip().split()))\r\n nn = max(arr) + 1\r\n c = [0] * nn\r\n q = int(input().strip())\r\n for ci in arr:\r\n c[ci] += 1\r\n p = [0] * nn\r\n for i in range(nn - 1):\r\n p[i + 1] = p[i] + c[i + 1]\r\n for _ in range(q):\r\n m = int(input().strip())\r\n if m >= nn - 1:\r\n sys.stdout.write(f'{n}\\n')\r\n else:\r\n sys.stdout.write(f'{p[m]}\\n')\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "from bisect import bisect_right\n\ndef count_shops(n, prices, q, coins):\n prices.sort() # Sort the prices in ascending order\n result = []\n \n for c in coins:\n count = bisect_right(prices, c) # Find the index to the right of c \n result.append(count)\n \n return result\n \n# Read the input\nn = int(input())\nprices = list(map(int, input().split()))\nq = int(input())\ncoins = [int(input()) for _ in range(q)]\n\n# Calculate and print the number of shops for each day\nresult = count_shops(n, prices, q, coins)\nfor count in result:\n print(count)\n\t\t\t\t\t \t \t \t\t\t \t\t \t\t \t\t \t\t\t \t", "n=int(input())\r\nprices=[int(_) for _ in input().split()]\r\n\r\nprices.sort()\r\nq=int(input())\r\n\r\ndef bs(query):\r\n \r\n l=0\r\n r=n-1\r\n \r\n while l<=r:\r\n \r\n m=(l+r)//2\r\n if prices[m]>query:\r\n r=m-1\r\n else:\r\n l=m+1 \r\n \r\n \r\n return l \r\n \r\n \r\nfor _ in range(q):\r\n \r\n print(bs(int(input())))", "n=int(input())\r\nl=sorted(list(map(int,input().split())))\r\nt=int(input())\r\nwhile t:\r\n k=int(input())\r\n j=-1\r\n q,w=0,n-1\r\n while q<=w:\r\n m=(q+w)//2\r\n if l[m]<=k:\r\n j=m\r\n q=m+1\r\n else:\r\n w=m-1\r\n print(j+1)\r\n t-=1", "import bisect\r\nb=[]\r\nn=int(input())\r\nprice=list(map(int,input().split()))\r\nprice.sort()\r\nq=int(input())\r\nfor _ in range(q):\r\n m=int(input())\r\n b.append(bisect.bisect(price,m))\r\nfor _ in range(q):\r\n print(b[_])", "n = int(input())\r\npricelist = sorted(list(map(int,input().split())))\r\nm = int(input())\r\nfor i in range(m):\r\n a = int(input())\r\n l = 0\r\n r = n-1\r\n if pricelist[0] <= a < pricelist[-1]:\r\n while l < r -1:\r\n mid = (l + r) // 2\r\n if pricelist[mid] <= a:\r\n l = mid\r\n else:\r\n r = mid\r\n print(l+1)\r\n elif a < pricelist[0]:\r\n print(0)\r\n else:\r\n print(n)", "import bisect\r\ninput()\r\nx=sorted(map(int, input().split()))\r\n\r\nfor i in ' ' * int(input()):\r\n print(bisect.bisect(x, int(input())))", "n = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\ndp = [0]*(a[-1]+1)\r\nfor x in a:\r\n dp[x] += 1\r\nfor i in range(1, len(dp)):\r\n dp[i] += dp[i-1]\r\nq = int(input())\r\nb = [0 for _ in range(q)]\r\nfor i in range(q):\r\n c = int(input())\r\n if c > a[-1]:\r\n b[i] = n\r\n else:\r\n b[i] = dp[c]\r\nfor i in range(len(b)):\r\n print(b[i]) \r\n ", "import bisect\r\nn=int(input())\r\nxs=list(map(int,input().split()))\r\nxs.sort()\r\nq=int(input())\r\nms=[]\r\nfor i in range(q):\r\n m=int(input())\r\n a=bisect.bisect_right(xs,m)\r\n print(a)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Nov 9 17:29:47 2023\r\n\r\n@author: 2300011376\r\n\"\"\"\r\nn=int(input())\r\nB=[i for i in map(int, input().split())]\r\nB.sort()\r\nL=len(B)\r\nMax=B[-1]\r\nC=[0]*(Max+1)\r\npt=0\r\nfor k in range(Max+1):\r\n if k>=B[pt]:\r\n while True:\r\n pt+=1\r\n if pt==L:\r\n break\r\n if B[pt]!=B[pt-1]:\r\n break\r\n C[k]=pt\r\n\r\nq=int(input())\r\n\r\nfor _ in range(q):\r\n m=int(input())\r\n if m>=Max:\r\n print(L)\r\n else:\r\n print(C[m])\r\n", "def bin(li, n, t):\r\n low = 0\r\n high = n\r\n while(low != high):\r\n mid = (low+high)//2\r\n if li[mid] > t:\r\n high = mid\r\n else:\r\n low = mid+1\r\n return low\r\n\r\ndef merge(li, l1, gi, l2):\r\n i,j = 0,0\r\n arr = []\r\n while i<l1 and j<l2:\r\n if li[i] > gi[j]:\r\n arr.append(gi[j])\r\n j += 1\r\n else:\r\n arr.append(li[i])\r\n i+=1\r\n while i<l1:\r\n arr.append(li[i])\r\n i+=1\r\n while j<l2:\r\n arr.append(gi[j])\r\n j+=1\r\n return arr\r\n\r\ndef merge_sort(li, n):\r\n if len(li) < 2:\r\n return li\r\n elif len(li) == 2:\r\n if li[0] > li[1]:\r\n li[0], li[1] = li[1], li[0]\r\n return li\r\n if n%2 != 0:\r\n mid = n//2+1\r\n else:\r\n mid = n//2\r\n\r\n return merge(merge_sort(li[:mid], mid), mid, merge_sort(li[mid:], n-mid), n-mid)\r\n\r\nn = int(input())\r\nli = merge_sort(list(map(int, input().split())), n)\r\nk = int(input())\r\n\r\nfor i in range(k):\r\n c = int(input())\r\n g = bin(li, n, c)\r\n print(g)", "import bisect\r\n\r\nn = int(input())\r\nx = list(map(int, input().split()))\r\nx.sort()\r\nq = int(input())\r\n\r\nfor i in range(q):\r\n m = int(input())\r\n count = bisect.bisect_right(x, m)\r\n print(count)", "n=int(input())\r\nprice=sorted([int(x)for x in input().split()])\r\nq=int(input())\r\nanswers={i:n for i in range(q)}\r\nday=[]\r\nfor i in range(q):\r\n day.append([i,int(input())])\r\nday.sort(key=lambda s:s[1])\r\nanswers[day[0][0]]=0\r\ni,j=0,0\r\nwhile j < n:\r\n if day[i][1] >= price[j]:\r\n answers[day[i][0]]+=1\r\n j+=1\r\n else:\r\n if i == q-1:\r\n break\r\n else:\r\n answers[day[i+1][0]]=answers[day[i][0]]\r\n i+=1\r\nfor a in answers.values():\r\n print(a)", "def read_arr():\r\n return list(map(int, input().split()))\r\n\r\ndef Bsearch(arr, val):\r\n l = 0\r\n r = len(arr)\r\n while l != r:\r\n m = (r+l)//2\r\n if arr[m] > val:\r\n r = m\r\n else:\r\n l = m+1\r\n return l\r\n \r\n\r\nn = int(input())\r\nxi = read_arr()\r\nq = int(input())\r\nmi = []\r\nfor i in range(q):\r\n mi.append(int(input()))\r\n\r\nxi.sort()\r\n\r\nfor m in mi:\r\n print(Bsearch(xi, m))\r\n \r\n\r\n\r\n\r\n", "from bisect import bisect_left, bisect_right\r\nn = int(input())\r\npr = list(map(int,input().split(' ')))\r\npr.sort()\r\nq = int(input())\r\nfor _ in range(q):\r\n bud = int(input())\r\n print(bisect_right(pr,bud))\r\n\r\n \r\n ", "def greatestlesser(low, high, key, a):\r\n ans = -1;\r\n while (low <= high):\r\n mid = low + ((high - low + 1) // 2);\r\n midVal = a[mid];\r\n\r\n if (midVal < key):\r\n\r\n # if mid is less than key, all elements\r\n # in range [low, mid - 1] are < key\r\n # we note down the last found index, then\r\n # we search in right side of mid\r\n # so we now search in [mid + 1, high]\r\n ans = mid;\r\n low = mid + 1;\r\n\r\n elif (midVal > key):\r\n\r\n # if mid is greater than key, all elements\r\n # in range [mid + 1, high] are > key\r\n # then we search in left side of mid\r\n # so we now search in [low, mid - 1]\r\n high = mid - 1;\r\n\r\n elif (midVal == key):\r\n\r\n # if mid is equal to key, all elements\r\n # in range [mid + 1, high] are >= key\r\n # then we search in left side of mid\r\n # so we now search in [low, mid - 1]\r\n high = mid - 1;\r\n\r\n return ans;\r\n\r\n\r\ndef contains(low, high, key, a):\r\n ans = False;\r\n while (low <= high):\r\n mid = low + ((high - low) // 2);\r\n midVal = a[mid];\r\n\r\n if (midVal < key):\r\n\r\n # if mid is less than key, all elements\r\n # in range [low, mid] are also less\r\n # so we now search in [mid + 1, high]\r\n low = mid + 1;\r\n\r\n elif (midVal > key):\r\n\r\n # if mid is greater than key, all elements\r\n # in range [mid + 1, high] are also greater\r\n # so we now search in [low, mid - 1]\r\n high = mid - 1;\r\n\r\n elif (midVal == key):\r\n\r\n # comparison added just for the sake\r\n # of clarity if mid is equal to key, we\r\n # have found that key exists in array\r\n ans = True;\r\n break;\r\n\r\n return ans;\r\n\r\n\r\ndef last(low, high, key,a):\r\n ans = -1;\r\n\r\n while (low <= high):\r\n mid = low + ((high - low + 1) // 2);\r\n midVal = a[mid];\r\n\r\n if (midVal < key):\r\n\r\n # if mid is less than key, then all elements\r\n # in range [low, mid - 1] are also less\r\n # so we now search in [mid + 1, high]\r\n low = mid + 1;\r\n\r\n elif (midVal > key):\r\n\r\n # if mid is greater than key, then all\r\n # elements in range [mid + 1, high] are\r\n # also greater so we now search in\r\n # [low, mid - 1]\r\n high = mid - 1;\r\n\r\n elif (midVal == key):\r\n\r\n # if mid is equal to key, we note down\r\n # the last found index then we search\r\n # for more in right side of mid\r\n # so we now search in [mid + 1, high]\r\n ans = mid;\r\n low = mid + 1;\r\n\r\n return ans;\r\n\r\n\r\nn = int(input())\r\nnums = list(map(int, input().split()))\r\nnums.sort()\r\nq = int(input())\r\nfor i in range(q):\r\n m = int(input())\r\n if contains(0,n-1,m,nums):\r\n print(last(0,n-1,m,nums)+1)\r\n \r\n else:\r\n print(greatestlesser(0,n-1,m,nums)+1)\r\n\r\n\r\n\r\n", "import bisect #list la iruka <= 'x' elements oda count return panum\r\n\r\nN, S, Q = int(input()), sorted(map(int, input().split())), int(input())\r\nfor _ in range(Q): M = int(input()); print(bisect.bisect_right(S, M))\r\n", "#Coder_1_neel\r\nn = int(input())\r\nprices = list(map(int, input().split()))\r\nq = int(input())\r\nspending_limits = [int(input()) for _ in range(q)]\r\n\r\nprices.sort()\r\n\r\nresults = []\r\n\r\ndef binary_search(limit):\r\n left, right = 0, n - 1\r\n while left <= right:\r\n mid = (left + right) // 2\r\n if prices[mid] <= limit:\r\n left = mid + 1\r\n else:\r\n right = mid - 1\r\n return left\r\n\r\nfor limit in spending_limits:\r\n count = binary_search(limit)\r\n results.append(count)\r\n\r\nfor count in results:\r\n print(count)\r\n", "n = int(input())\r\nx = [int(a) for a in input().split()]\r\nx.sort()\r\nq = int(input())\r\n\r\ndef check(m):\r\n left = 0\r\n right = len(x) - 1\r\n\r\n while left <= right:\r\n mid = (left + right) // 2\r\n\r\n if x[mid] <= m:\r\n left = mid + 1\r\n else:\r\n right = mid - 1\r\n return right\r\n\r\nfor i in range(q):\r\n m = int(input())\r\n ans = check(m) + 1\r\n print(ans)", "import bisect\r\nN = int(input())\r\nA = list(map(int,input().split()))\r\nA.sort()\r\nq = int(input())\r\nfor _ in range(q):\r\n temp = int(input())\r\n index = bisect.bisect_right(A,temp)\r\n print(index)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Sep 8 16:51:51 2023\r\n\r\n@author: mac\r\n\"\"\"\r\n\r\nn = int(input())\r\nx = list(map(int,input().split()))\r\nx.sort()\r\nq = int(input())\r\nfor i in range(q):\r\n m = int(input())\r\n low, high = 0, n\r\n while low < high:\r\n medium = (low + high) // 2\r\n if x[medium] > m:\r\n high = medium\r\n else:\r\n low = medium + 1\r\n print(high)", "n = int(input())\r\nshop = list(map(int, input().split()))\r\nshop = sorted(shop)\r\nmo = int(input())\r\nmoney = [int(input()) for i in range(mo)]\r\nfor current in money:\r\n r = n - 1\r\n l = 0\r\n while r >= l:\r\n m = l + (r - l) // 2\r\n if shop[m] <= current:\r\n l = m + 1\r\n else:\r\n r = m - 1\r\n print(l)", "n = int(input())\r\nx = input().split()\r\nfor i in range(len(x)):\r\n x[i] = int(x[i])\r\nq = int(input())\r\nm = []\r\nfor j in range(q):\r\n m.append(int(input()))\r\n\r\ndef merge(left, right):\r\n result = []\r\n i,j = 0,0\r\n while i<len(left) and j<len(right):\r\n if left[i]<right[j]:\r\n result.append(left[i])\r\n i+=1\r\n else:\r\n result.append(right[j])\r\n j+=1\r\n while i<len(left):\r\n result.append(left[i])\r\n i+=1\r\n while j<len(right):\r\n result.append(right[j])\r\n j+=1\r\n return result\r\n\r\ndef merge_sort(L):\r\n if len(L)<2:\r\n return L[:]\r\n else:\r\n middle = len(L)//2\r\n left = merge_sort(L[:middle])\r\n right = merge_sort(L[middle:])\r\n return merge(left, right)\r\n\r\ndef bisect_search(L, e, low, high):\r\n if high==low:\r\n if L[low]<=e:\r\n return low+1\r\n else:\r\n return low\r\n mid = (low+high)//2\r\n if L[mid]<=e:\r\n return bisect_search(L, e, mid+1, high)\r\n else:\r\n return bisect_search(L,e,low,mid)\r\n\r\nx = merge_sort(x)\r\n\r\nfor k in range(q):\r\n print(bisect_search(x,m[k],0,len(x)-1))\r\n\r\n", "from bisect import bisect_right\n\nn = int(input())\nprices = list(map(int, input().split()))\nq = int(input())\nprices.sort()\nfor _ in range(q):\n m = int(input())\n count = bisect_right(prices, m)\n print(count)\n\n# Wed Jul 12 2023 11:42:10 GMT+0300 (Moscow Standard Time)\n", "def check(n,x,q,m):\r\n x = sorted(x)\r\n ls = []\r\n for i in m:\r\n left = 0\r\n right = n - 1\r\n p = n\r\n while left <= right:\r\n mid = (left + right ) // 2\r\n if x[mid] <= i:\r\n left = mid + 1\r\n else:\r\n p = mid\r\n right = mid - 1\r\n ls.append(p)\r\n return ls\r\nn = int(input())\r\nx = list(map(int,input().split()))\r\nq = int(input())\r\nm = [int(input()) for i in range(q)]\r\noutput = check(n, x, q, m)\r\nfor o in output:\r\n print(o)\r\n", "n = int(input())\n\nx = [int(i) for i in input().split()]\n\nq = int(input())\n\nm=[]\n\nfor i in range(q):\n m.append(int(input()))\n\nnums = [0]*(max(x)+1)\nfor i in x:\n nums[i]+=1\n\nfor i in range(1, len(nums)):\n nums[i] += nums[i-1]\n\nmx = max(x)\nfor i in m:\n if i > mx:\n print(nums[-1])\n else:\n print(nums[i])\n" ]

[ "'''\r\npacman->food\r\npacman->food->food :hmmge:\r\nlarges smaller val\r\nsmallest larger val\r\n'''\r\ndef check(mid,p,f):\r\n\tu=0\r\n\tfor i in range(len(p)):\r\n\t\tleft=p[i]-f[u]\r\n\t\tleft=max(0,left)\r\n\t\tif mid<left:\r\n\t\t\treturn 0\r\n\t\tright=max(mid-2*left,0)\r\n\t\tright=max(right,(mid-left)//2)\r\n\t\twhile u<len(f) and (f[u]<=p[i]+right): #bich mai fas ra\r\n\t\t\tu+=1\r\n\t\tif u==len(f):\r\n\t\t\treturn 1\r\n\treturn 0\r\ndef f(s,n):\r\n\tp=[]\r\n\tf=[]\r\n\tfor i in range(n):\r\n\t\tif s[i]==\"*\":\r\n\t\t\tf.append(i)\r\n\t\tif s[i]==\"P\":\r\n\t\t\tp.append(i)\r\n\tlo=0\r\n\thi=10**9\r\n\twhile lo<=hi:\r\n\t\tmid=(lo+hi)//2\r\n\t\tif check(mid,p,f):\r\n\t\t\thi=mid-1\r\n\t\telse:\r\n\t\t\tlo=mid+1\r\n\treturn lo\r\n\r\nn=int(input())\r\ns=list(input().strip())\r\nprint(f(s,n))", "from bisect import bisect_right,bisect_left\r\n\r\ndef check(t):\r\n pt=0\r\n contain_t=0\r\n pt1,pt2=0,0\r\n contain_t1,contain_t2=0,0\r\n for i in range(l_p):\r\n contain_t1,contain_t2=t,t\r\n if pt>=l_s:\r\n return 1\r\n if ash[pt]<pokemon[i] and t<pokemon[i]-ash[pt]:\r\n return 0\r\n if ash[pt]<pokemon[i]:\r\n contain_t1=(contain_t1-(pokemon[i]-ash[pt]))//2\r\n contain_t2=max(0,(contain_t2-(pokemon[i]-ash[pt])*2))\r\n pt=bisect_right(ash,pokemon[i]+max(contain_t1,contain_t2))\r\n if pt>=l_s:\r\n return 1\r\n return 0\r\n\r\n\r\nn=int(input())\r\nst=input()\r\na=[]\r\nfor i in range(n):\r\n a.append(st[i])\r\nans1,ans2=0,0\r\nash=[]\r\npokemon=[]\r\nfor i in range(n):\r\n if a[i]==\"*\":\r\n ash.append(i)\r\n elif a[i]==\"P\":\r\n pokemon.append(i)\r\nl_p=len(pokemon)\r\nl_s=len(ash)\r\ni=0\r\nj=10**10\r\nwhile i<j:\r\n m=(i+j)//2\r\n if check(m):\r\n j=m-1\r\n else:\r\n i=m+1\r\nif check(i):\r\n print(i)\r\nelse:\r\n print(i+1)", "from sys import stdin, stdout\r\n\r\nn = int(stdin.readline())\r\ns = stdin.readline().strip()\r\n\r\nmins = []\r\npacks = []\r\n\r\nfor i in range(len(s)):\r\n if s[i] == '*':\r\n mins.append(i)\r\n elif s[i] == 'P':\r\n packs.append(i)\r\n\r\nl, r = -1, 2 * len(s) + 1\r\nwhile r - l > 1:\r\n m = (l + r) >> 1\r\n \r\n test1 = mins[:]\r\n test2 = packs[:]\r\n \r\n \r\n while test2 and test1:\r\n cnt = m\r\n pos = test2.pop()\r\n \r\n if pos > test1[-1]:\r\n while test1 and abs(pos - test1[-1]) <= cnt:\r\n cnt -= abs(pos - test1[-1])\r\n pos = test1[-1]\r\n test1.pop()\r\n else:\r\n cntl, cntr = 0, 0\r\n \r\n if abs(test1[-1] - pos) > m:\r\n break\r\n \r\n lpos = (m + pos - test1[-1]) // 2\r\n rpos = m - 2 * abs(test1[-1] - pos)\r\n \r\n lb, rb = -1, len(test1)\r\n while rb - lb > 1:\r\n mb = (lb + rb) >> 1\r\n \r\n if pos - test1[mb] <= lpos:\r\n rb = mb\r\n else:\r\n lb = mb\r\n \r\n cntl = len(test1) - rb\r\n \r\n lb, rb = -1, len(test1)\r\n while rb - lb > 1:\r\n mb = (lb + rb) >> 1\r\n \r\n if pos - test1[mb] <= rpos:\r\n rb = mb\r\n else:\r\n lb = mb\r\n \r\n cntr = len(test1) - rb\r\n \r\n cnt = max(cntl, cntr)\r\n while test1 and cnt:\r\n test1.pop()\r\n cnt -= 1\r\n \r\n \r\n if not test1:\r\n r = m\r\n else:\r\n l = m\r\n \r\nstdout.write(str(r))", "n = int(input())\r\ns = input()\r\n\r\ndef check(mid) :\r\n left = -1\r\n curr = -1\r\n for i in range(0, n) :\r\n if (s[i] == '*' and left == -1 and i > curr) : left = i\r\n elif (s[i] == 'P') :\r\n if (left == -1) : curr = i + mid\r\n elif ((i-mid) > left) : return False\r\n elif (left < i) : curr = max(left*2 + mid - i, i + (mid-i+left)/2)\r\n else : curr = i + mid \r\n if (left <= curr) : left = -1\r\n return left == -1\r\n\r\nl = 0\r\nr = 2*n\r\nres = 0\r\n\r\nwhile (l <= r) :\r\n mid = (l+r)//2\r\n if (check(mid)) :\r\n r = mid-1\r\n res = mid \r\n else : l = mid + 1\r\n\r\nprint(res)", "from collections import deque\r\n\r\nN = int(input())\r\nst = input()\r\niapos, ppos = [], []\r\nfor i in range(N):\r\n if st[i] == '*':\r\n iapos.append(i)\r\n elif st[i] == \"P\":\r\n ppos.append(i)\r\n\r\n\r\niapos = iapos[::-1]\r\n\r\ndef works(n):\r\n apos = iapos.copy()\r\n\r\n for pac in ppos:\r\n if not apos:\r\n return True\r\n mustreach = apos[-1]\r\n if mustreach > pac:\r\n endpos = pac + n\r\n elif abs(mustreach - pac) > n:\r\n return False\r\n else:\r\n turnsl = n\r\n turnsl -= abs(mustreach - pac)\r\n endposl = max(pac, mustreach+turnsl)\r\n endposr = pac + (n - abs(mustreach - pac))//2\r\n endpos = max(endposl, endposr)\r\n while apos and apos[-1] <= endpos:\r\n apos.pop()\r\n\r\n return len(apos) == 0\r\n\r\nlo = 0\r\nhi = 10**6\r\nwhile lo < hi:\r\n mid = (lo+hi)//2\r\n\r\n if works(mid):\r\n hi = mid\r\n else:\r\n lo = mid+1\r\n\r\nprint(lo)", "'''\r\npacman->food\r\npacman->food->food :hmmge:\r\nlarges smaller val\r\nsmallest larger val\r\n'''\r\ndef check(mid,p,f):\r\n\tptr=0\r\n\tfor x in p:\r\n\t\tFrom=x\r\n\t\tTo=x\r\n\t\twhile ptr<len(f):\r\n\t\t\tFrom=min(From,f[ptr])\r\n\t\t\tTo=max(To,f[ptr])\r\n\t\t\tneed=To-From+min(To-x,x-From)\r\n\t\t\tif need>mid:\r\n\t\t\t\tbreak\r\n\t\t\tptr+=1\r\n\t\tif ptr==len(f):\r\n\t\t\treturn 1\r\n\treturn 0\r\ndef f(s,n):\r\n\tp=[]\r\n\tf=[]\r\n\tfor i in range(n):\r\n\t\tif s[i]==\"*\":\r\n\t\t\tf.append(i)\r\n\t\tif s[i]==\"P\":\r\n\t\t\tp.append(i)\r\n\tlo=0\r\n\thi=10**9\r\n\twhile lo<=hi:\r\n\t\tmid=(lo+hi)//2\r\n\t\tif check(mid,p,f):\r\n\t\t\thi=mid-1\r\n\t\telse:\r\n\t\t\tlo=mid+1\r\n\treturn lo\r\n\r\nn=int(input())\r\ns=list(input().strip())\r\nprint(f(s,n))", "n = int(input())\r\nstring = input()\r\nplayer = []\r\nfood = []\r\nfor i in range(len(string)):\r\n if string[i] == \"*\":\r\n food.append(i)\r\n elif string[i] == \"P\":\r\n player.append(i)\r\n\r\n\r\ndef check(t):\r\n idx = 0\r\n for i in range(len(player)):\r\n loc = player[i]\r\n if idx == len(food):break\r\n l = food[idx]\r\n while idx!=len(food):\r\n r = food[idx]\r\n if (((abs(loc-l)+abs(l-r))<=t) or ((abs(l-r)+abs(loc-r))<=t)):\r\n idx+=1\r\n else:\r\n break \r\n return idx>=len(food)\r\n \r\n\r\n\r\nl = 0\r\nh = pow(10,18)\r\nwhile l<=h:\r\n mid = l+(h-l)//2\r\n if check(mid):\r\n ans = mid \r\n h = mid-1\r\n else:\r\n l= mid+1\r\nprint(ans)" ]

[ "n = int(input())\r\np = list(map(float, input().split()))\r\nif n == 1:\r\n print(p[0])\r\n quit()\r\nM = [0.0] * n\r\nf = [0.0] * n\r\nf[0] = 1.0\r\nfor i in range(1, n):\r\n f[i] = p[i] * f[i - 1] + 1 - p[i]\r\nres = p[0] * p[1]\r\nans = res\r\nfor i in range(2, n):\r\n temp = (1 - p[i - 1]) + p[i - 1] * (1 - p[i - 2])\r\n res = p[i] * p[i - 1] * (1 - p[i - 2]) + p[i] * (res + 1 - temp)\r\n ans += res\r\nprint(sum(p) + 2 * ans)", "n = int(input())\na = list(map(float,input().split()))\n\nx,y = 0.0,0.0\nfor e in a:\n x += e*(1+2*y)\n y = e*(y+1)\nprint(x)", "n=int(input())\r\np=list(map(float,input().split()))\r\nval=[0.0]\r\nfor j in range(n):\r\n val.append((val[-1]+1.0)*p[j])\r\n\r\ndp=[0 for i in range(n+1)]\r\nfor i in range(1,n+1):\r\n dp[i]=p[i-1]*(1.0+dp[i-1]+2*val[i-1])+(1-p[i-1])*(dp[i-1])\r\n\r\nprint(dp[-1])\r\n\r\n\r\n\r\n", "t1=t2=0.0\r\nA=[0.0]*100005\r\nn=int(input())\r\nA=list(map(float,input().split()))\r\nfor i in range(n):\r\n\tt2+=(t1*2+1)*A[i]\r\n\tt1=(t1+1)*A[i]\r\nprint(\"{:.15f}\".format(t2))", "n=input()\r\nlst = list(map(float, input().split()))\r\n \r\nds = []\r\nds.append(0)\r\n \r\nfor i, elem in enumerate(lst[1:]):\r\n ds.append(ds[i] * elem + lst[i]*elem)\r\n \r\nans = 2 * sum(ds) + sum(lst)\r\nprint(ans)", "n = int(input())\r\np = list(map(float, input().split()))\r\np.append(0)\r\ns=[p[0]]*3\r\ns[2]=0\r\nans = (2*s[2]+s[1])*(1-p[1])\r\nfor i in range(1,n):\r\n s[0] += 1 - p[i-1]\r\n for j in range(2,0,-1):\r\n s[j] += s[j-1]\r\n for j in range(3):\r\n s[j] *= p[i]\r\n ans += (2*s[2]+s[1])*(1-p[i+1])\r\nprint(ans)\r\n\r\n ", "from __future__ import division, print_function\r\n\r\nimport os,sys\r\nfrom io import BytesIO, IOBase\r\n\r\nif sys.version_info[0] < 3:\r\n from __builtin__ import xrange as range\r\n from future_builtins import ascii, filter, hex, map, oct, zip\r\n\r\nfrom bisect import bisect_left as lower_bound, bisect_right as upper_bound \r\ndef so(): return int(input())\r\ndef st(): return input()\r\ndef mj(): return map(int,input().strip().split(\" \"))\r\n\r\ndef msj(): return (map(str,input().strip().split(\" \")))\r\ndef le(): return list(map(float,input().split()))\r\ndef rc(): return map(float,input().split())\r\ndef lebe():return list(map(str,input().split()))\r\n\r\ndef dmain():\r\n sys.setrecursionlimit(1000000)\r\n threading.stack_size(1024000)\r\n thread = threading.Thread(target=main)\r\n thread.start()\r\ndef joro(L):\r\n return(''.join(map(str, L)))\r\ndef joron(L):\r\n return('\\n'.join(map(str, L)))\r\n\r\ndef decimalToBinary(n): return bin(n).replace(\"0b\",\"\")\r\n\r\n\r\ndef isprime(n):\r\n for i in range(2,int(n**0.5)+1):\r\n if n%i==0:\r\n return False\r\n return True\r\ndef npr(n, r):\r\n return factorial(n) // factorial(n - r) if n >= r else 0\r\n \r\n \r\ndef ncr(n, r):\r\n return factorial(n) // (factorial(r) * factorial(n - r)) if n >= r else 0\r\n \r\n \r\ndef lower_bound(li, num):\r\n answer = -1\r\n start = 0\r\n end = len(li) - 1\r\n \r\n while (start <= end):\r\n middle = (end + start) // 2\r\n if li[middle] >= num:\r\n answer = middle\r\n end = middle - 1\r\n else:\r\n start = middle + 1\r\n return answer # min index where x is not less than num\r\n \r\n \r\ndef upper_bound(li, num):\r\n answer = -1\r\n start = 0\r\n end = len(li) - 1\r\n \r\n while (start <= end):\r\n middle = (end + start) // 2\r\n \r\n if li[middle] <= num:\r\n answer = middle\r\n start = middle + 1\r\n \r\n else:\r\n end = middle - 1\r\n return answer # max index where x is not greater than num\r\ndef tir(a,b,c):\r\n if(0==c):\r\n return 1\r\n if(len(a)<=b):\r\n return 0\r\n \r\n if(c!=-1):\r\n return (tir(a,1+b,c+a[b]) or tir(a,b+1,c-a[b]) or tir(a,1+b,c)) \r\n \r\n \r\n else:\r\n return (tir(a,1+b,a[b]) or tir(a,b+1,-a[b]) or tir(a,1+b,-1))\r\n \r\n \r\ndef abs(x):\r\n return x if x >= 0 else -x\r\n \r\n \r\ndef binary_search(li, val, lb, ub):\r\n # print(lb, ub, li)\r\n ans = -1\r\n while (lb <= ub):\r\n mid = (lb + ub) // 2\r\n # print('mid is',mid, li[mid])\r\n if li[mid] > val:\r\n ub = mid - 1\r\n elif val > li[mid]:\r\n lb = mid + 1\r\n else:\r\n ans = mid # return index\r\n break\r\n return ans\r\n \r\n \r\ndef kadane(x): # maximum sum contiguous subarray\r\n sum_so_far = 0\r\n current_sum = 0\r\n for i in x:\r\n current_sum += i\r\n if current_sum < 0:\r\n current_sum = 0\r\n else:\r\n sum_so_far = max(sum_so_far, current_sum)\r\n return sum_so_far\r\n\r\n \r\ndef pref(li):\r\n pref_sum = [0]\r\n for i in li:\r\n pref_sum.append(pref_sum[-1] + i)\r\n return pref_sum\r\n \r\n\r\n \r\n \r\ndef SieveOfEratosthenes(n):\r\n prime = [True for i in range(n + 1)]\r\n p = 2\r\n li = []\r\n while (p * p <= n):\r\n if (prime[p] == True):\r\n for i in range(p * p, n + 1, p):\r\n prime[i] = False\r\n p += 1\r\n \r\n for p in range(2, len(prime)):\r\n if prime[p]:\r\n li.append(p)\r\n return li\r\n \r\n \r\ndef primefactors(n):\r\n factors = []\r\n while (n % 2 == 0):\r\n factors.append(2)\r\n n //= 2\r\n for i in range(3, int(sqrt(n)) + 1, 2): # only odd factors left\r\n while n % i == 0:\r\n factors.append(i)\r\n n //= i\r\n if n > 2: # incase of prime\r\n factors.append(n)\r\n return factors\r\n \r\n \r\ndef read():\r\n sys.stdin = open('input.txt', 'r') \r\n sys.stdout = open('output.txt', 'w') \r\ndef tr(n):\r\n return n*(n+1)//2\r\nboi=int(1e9+7)\r\ndoi=int(1e9+7)\r\nhoi=int(1e6+5)\r\npoi=int(1e7+1)\r\n\r\n \r\ny=\"yes\"\r\nn=\"no\"\r\n\r\ndef bulli(x):\r\n return bin(x).count('1')\r\n\r\nimport sys\r\n\r\n\r\nf=[0]*(hoi)\r\nr=[0]*(hoi)\r\n\r\nfrom heapq import heappush,heappop,heapify\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n\r\ndef ty(a,b):\r\n rr=1\r\n while(b):\r\n if(b%2):\r\n rr=(rr*a)%boi\r\n b=b//2\r\n a=a*a%boi\r\n return rr\r\ndef inv(a):\r\n re=1\r\n for i in range(1,1+a):\r\n re=(re*i)%boi\r\n re=ty(re,boi-2)\r\n return re\r\ndef ncr(m,k):\r\n if(m<0 or k<0 or k>m):\r\n return 0\r\n return f[m]*r[k]%boi*r[m-k]%boi\r\ndef gosa(a,b):\r\n if(0!=b):\r\n return gosa(b,a%b)\r\n return a\r\n\r\n\r\n\r\nfrom collections import deque, defaultdict\r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n\r\ndef iu():\r\n import sys\r\n import math as my\r\n import functools\r\n import random\r\n import bisect\r\n input=sys.stdin.readline\r\n from collections import deque, defaultdict\r\n m=so()\r\n L=le()\r\n z=0\r\n zz=0\r\n for i in L:\r\n z=i*(1+z)\r\n zz=2*z-i+zz\r\n print(round(zz,10))\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\ndef main():\r\n '''f[0]=1\r\n for i in range(1,hoi):\r\n f[i]=(f[i-1]*i)%boi\r\n r[hoi-1]=ty(f[hoi-1],boi-2)\r\n for i in range(hoi-2,-1,-1):\r\n r[i]=r[i+1]*(i+1)%boi'''\r\n \r\n for i in range(1):\r\n \r\n #print(\"Case #\"+str(i+1)+\": \",end=\"\")\r\n iu()\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n# region fastio\r\n# template taken from https://github.com/cheran-senthil/PyRival/blob/master/templates/template.py\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\ndef print(*args, **kwargs):\r\n \"\"\"Prints the values to a stream, or to sys.stdout by default.\"\"\"\r\n sep, file = kwargs.pop(\"sep\", \" \"), kwargs.pop(\"file\", sys.stdout)\r\n at_start = True\r\n for x in args:\r\n if not at_start:\r\n file.write(sep)\r\n file.write(str(x))\r\n at_start = False\r\n file.write(kwargs.pop(\"end\", \"\\n\"))\r\n if kwargs.pop(\"flush\", False):\r\n file.flush()\r\n\r\n\r\nif sys.version_info[0] < 3:\r\n sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)\r\nelse:\r\n sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n# endregion\r\n\r\n\r\nif __name__ == \"__main__\":\r\n #read()\r\n main()\r\n #dmain()\r\n\r\n# Comment Read()", "n=int(input().strip())\r\n\r\np=[0]+list(map(float,input().split()))\r\n\r\na=[0]*(n+1)\r\nb=[0]*(n+1)\r\n\r\n\r\nfor i in range(1,n+1):\r\n b[i]=(b[i-1]+1)*p[i]\r\n a[i]=(a[i-1]+2*b[i-1]+1)*p[i]+a[i-1]*(1-p[i])\r\n\r\nprint(a[-1])\r\n\r\n", "n = eval(input())\r\nread = input()\r\np = []\r\nfor x in read.split():\r\n p.append((float)(x))\r\n \r\nv = 0.0\r\nl = 0.0\r\nfor item in p:\r\n v = v*(1-item) + item*(v + 2*l + 1)\r\n l = (l + 1)*item\r\nprint(v)\r\n", "if __name__ == \"__main__\":\n n = int(input())\n nums = input().split(\" \")\n a = 0.0\n sol = 0\n \n for i in range(n):\n a = a * float(nums[i])\n sol += 2 * a + float(nums[i])\n a += float(nums[i])\n \n print(sol)\n\t \t\t\t \t\t\t \t \t \t\t \t\t \t\t \t", "n,a,b=int(input()),0,0\r\nfor i in map(float,input().split()):a,b=a+i*(1+b*2),i*(b+1)\r\nprint(a)", "n = input()\nx = map(float, input().split())\nresult = 0\nPj = 0\nfor p in x:\n result += (Pj*2 + 1)*p\n Pj = (Pj + 1)*p\nprint(result)", "n = eval(input())\r\nread = input()\r\np = []\r\nfor x in read.split():\r\n p.append((float)(x))\r\n \r\nv = 0.0\r\nl = 0.0\r\nfor u in p:\r\n v = v * (1 - u) + u * (v + 2 * l + 1)\r\n l = (l + 1) * u\r\nprint(v)\r\n", "n = int(input())\np = list(map(float, input().split()))\n\nscore = 0\nlength = 0\nfor i in p:\n score += (2*length + 1)*i\n length = (length+1)*i\n \nprint(\"%.15f\" % score)\n\n\t \t\t \t \t\t\t \t\t\t\t\t\t\t\t \t \t \t" ]

[ "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, r1, r2 = map(int, input().split())\r\nadj = [[] for _ in range(n + 1)]\r\nv = 1\r\nfor u in map(int, input().split()):\r\n if v == r1:\r\n v += 1\r\n adj[v].append(u)\r\n adj[u].append(v)\r\n v += 1\r\n\r\nans = [0] * (n + 1)\r\nans[r2] = -1\r\nstack = [r2]\r\nwhile stack:\r\n v = stack.pop()\r\n for dest in adj[v]:\r\n if ans[dest] != 0:\r\n continue\r\n ans[dest] = v\r\n stack.append(dest)\r\n\r\nans = [x for x in ans if x > 0]\r\nprint(*ans)\r\n", "# Rishabh Rao (https://github.com/rishabhrao)\r\n\r\nimport sys\r\nMOD = 1000000007\r\ndef inp(): return sys.stdin.readline().strip()\r\ndef ii(): return int(inp())\r\ndef iis(): return [int(i) for i in inp().split()]\r\n\r\n\r\nn, r1, r2 = iis()\r\nmp = iis()\r\nidx = 0\r\ngraph = [[] for _ in range(n + 1)]\r\nfor i in range(1, n + 1):\r\n if i == r1:\r\n continue\r\n par = mp[idx]\r\n idx += 1\r\n graph[par].append(i)\r\n graph[i].append(par)\r\n\r\nparents = [-1 for _ in range(n + 1)]\r\n\r\nstack = [r2]\r\nwhile stack:\r\n curr = stack.pop()\r\n for child in graph[curr]:\r\n if child != r2 and parents[child] == -1:\r\n parents[child] = curr\r\n stack.append(child)\r\n\r\nprint(\" \".join([str(el) for el in parents if el != -1]))\r\n", "\r\nimport sys\r\n\r\nnative_input = input\r\ninput = lambda: sys.stdin.readline().strip()\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\ndef solve():\r\n n, r1, r2 = map(int, input().split())\r\n\r\n a = list(map(int, input().split()))\r\n\r\n dd = {}\r\n\r\n i = 0\r\n\r\n while i < n:\r\n if i + 1 >= r1:\r\n if i + 1 > r1:\r\n dd[i + 1] = a[i - 1]\r\n else:\r\n dd[i + 1] = a[i]\r\n i += 1\r\n\r\n\r\n\r\n parent = r2\r\n key = dd[r2]\r\n dd.pop(parent)\r\n\r\n while True:\r\n if key != r1:\r\n t = dd[key]\r\n dd[key] = parent\r\n parent = key\r\n key = t\r\n else:\r\n dd[key] = parent\r\n break\r\n\r\n ans = []\r\n\r\n for k in sorted(dd.keys()):\r\n ans.append(dd[k])\r\n\r\n print(*ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nsolve()", "n,r1,r2=map(int,input().split())\r\n\r\nP=list(map(int,input().split()))\r\n\r\nE=[[] for i in range(n+1)]\r\n\r\nx=1\r\nfor i in range(n-1):\r\n if x==r1:\r\n x+=1\r\n p=P[i]\r\n E[x].append(p)\r\n E[p].append(x)\r\n\r\n x+=1\r\n\r\n#print(E)\r\n\r\nP2=[-1]*(n+1)\r\n\r\nQ=[r2]\r\n\r\nwhile Q:\r\n x=Q.pop()\r\n for to in E[x]:\r\n if P2[to]==-1:\r\n P2[to]=x\r\n Q.append(to)\r\n\r\nANS=P2[1:r2]+P2[r2+1:n+1]\r\nprint(*ANS)\r\n", "def put():\r\n return map(int, input().split())\r\n\r\ndef dfs(r1, r2):\r\n p = -1\r\n curr = r2\r\n while p!=r1:\r\n tmp = parent[curr]\r\n parent[curr]=p\r\n p = curr\r\n curr = tmp\r\n \r\n\r\nn,r1,r2 = put()\r\nparent = [0]\r\nparent.extend(list(put()))\r\nparent.insert(r1, -1)\r\ndfs(r1,r2)\r\nparent.remove(0)\r\nparent.remove(-1)\r\nprint(*parent)", "n,r,r1 = map(int,input().split())\r\ncapt,ind= [0]*(n+1),1;ig= r1; capt[0] = r\r\nfor u,v in enumerate(map(int,input().split())):\r\n ind += (u+1==r); capt[ind] = v; ind+=1\r\nr0 = capt[r1]\r\nwhile 1:\r\n temp = capt[r0]\r\n if temp == r1: break\r\n capt[r0] = r1; r1 = r0; r0 = temp\r\nfor x in range(1,n+1):\r\n if x!=ig: print(capt[x], end = \" \")", "def do_full_map(old_capital, _map):\r\n _map.insert(old_capital - 1, -1)\r\n return _map\r\n\r\n\r\ndef DFS(new_capital, full_map):\r\n way = []\r\n i = new_capital\r\n while full_map[i - 1] != -1:\r\n tmp = full_map[i-1]\r\n way.append(tmp)\r\n i = tmp\r\n return way\r\n\r\n\r\ndef change_map_for_way(old_capital, new_capital, way, full_map):\r\n prev = new_capital\r\n for i in way:\r\n full_map[i - 1] = prev\r\n prev = i\r\n if way == []:\r\n full_map[old_capital - 1] = prev\r\n return delete_new_capital(full_map, new_capital)\r\n\r\n\r\ndef delete_new_capital(full_map, new_capital):\r\n del full_map[new_capital - 1]\r\n return full_map\r\n\r\n\r\ndef find_new_map(n: int, old_capital: int, new_capital: int,\r\n old_map: list) -> list:\r\n \"\"\"\r\n Parameters:\r\n :n (int): number of cities\r\n :old_capital (int): old capital's number\r\n :new_capital (int): new capital's number\r\n :old_map (list): old road map representation\r\n :return: new road map representation\r\n \"\"\"\r\n full_map = do_full_map(old_capital, old_map)\r\n way = DFS(new_capital, full_map)\r\n return change_map_for_way(old_capital, new_capital, way, full_map)\r\nn, old, new = map(int,input().split())\r\nm = list(map(int,input().split()))\r\n\r\nprint(\" \".join(str(x) for x in find_new_map(n,old,new,m)))", "from collections import deque\r\n\r\n\r\nvisited = [False] * 100001\r\narr = [0] * 100001\r\n\r\n\r\ndef solve(graph, start):\r\n stack = deque()\r\n stack.append(start)\r\n while stack:\r\n v = stack.pop()\r\n if visited[v]:\r\n continue\r\n visited[v] = True\r\n for i in graph[v]:\r\n if not visited[i]:\r\n arr[i] = v\r\n stack.append(i)\r\n\r\n\r\ndef main():\r\n graph = {}\r\n n, r1, r2 = map(int, input().split())\r\n str_ = list(map(int, input().split()))\r\n for i in range(n - 1):\r\n m = str_[i]\r\n j = i + 1\r\n if j >= r1:\r\n j += 1\r\n if j not in graph:\r\n graph[j] = set()\r\n graph[j].add(m)\r\n if m not in graph:\r\n graph[m] = set()\r\n graph[m].add(j)\r\n\r\n solve(graph, r2)\r\n ans = ''\r\n for i in range(1, n + 1):\r\n if arr[i] != 0:\r\n ans += str(arr[i]) + ' '\r\n return ans\r\n\r\n\r\nprint(main())\r\n", "n, r1, r2 = map(int, input().split())\nold = list(map(int, input().split()))\nparent = r2\npath = []\nclean_old = old[:r1-1]\nclean_old.append(0)\nclean_old += old[r1-1:]\n\nwhile parent != r1:\n path.append(parent)\n parent = clean_old[parent-1]\n\npath.append(parent)\n\nfor i in range(1, len(path)):\n clean_old[path[i]-1] = path[i-1]\n\nnew = clean_old[:r2-1]\nnew += clean_old[r2:]\nfor i in new:\n print(i, end=\" \")\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, r1, r2 = map(int, input().split())\r\nw = list(map(int, input().split()))\r\nd = [[] for i in range(n+1)]\r\nfor i, j in enumerate(w):\r\n if i < r1-1:\r\n d[j].append(i+1)\r\n d[i+1].append(j)\r\n else:\r\n d[j].append(i+2)\r\n d[i+2].append(j)\r\nx = [0]*(n+1)\r\nq = [(r2, -1)]\r\nwhile q:\r\n a, b = q.pop()\r\n x[a] = b\r\n for i in d[a]:\r\n if i != b:\r\n q.append((i, a))\r\nprint(' '.join(map(str, x[1:r2])), ' '.join(map(str, x[r2+1:])))", "def find_new_map(n: int, old_capital: int, new_capital: int,\r\n old_map: list) -> list:\r\n \"\"\"\r\n Parameters:\r\n :n (int): number of cities\r\n :old_capital (int): old capital's number\r\n :new_capital (int): new capital's number\r\n :old_map (list): old road map representation\r\n :return: new road map representation\r\n \"\"\"\r\n new_map = old_map.copy()\r\n new_map.insert(old_capital - 1, -1)\r\n\r\n parent = -1\r\n node = new_capital\r\n\r\n while True:\r\n next_node = new_map[node - 1]\r\n new_map[node - 1] = parent\r\n parent = node\r\n\r\n if node == old_capital:\r\n break\r\n\r\n node = next_node\r\n\r\n new_map.pop(new_capital - 1)\r\n\r\n return new_map\r\nn, old, new = map(int,input().split())\r\nmap = list(map(int,input().split()))\r\n\r\nprint(\" \".join(str(x) for x in find_new_map(n,old,new,map)))", "n, ro, rk = map(int, input().split())\r\nt = [0] + list(map(int, input().split()))\r\nt.insert(ro, 0)\r\nr, p = [], rk\r\nwhile p:\r\n r.append(p)\r\n p = t[p]\r\nfor i in range(1, len(r)): t[r[i]] = r[i - 1]\r\nt.pop(rk)\r\nprint(' '.join(map(str, t[1: ])))" ]

[ "# https://codeforces.com/contest/959\n\nimport sys\n\ninput = lambda: sys.stdin.readline().rstrip() # faster!\n\n\nclass PrimesUtil:\n def __init__(self, mx):\n assert 1 <= mx\n self.mx = mx\n self.prime_numbers = []\n self.prime = [False] * 2 + [True] * (mx - 1)\n self.factor = [0] * (mx + 1)\n self._run_sieve()\n\n def _run_sieve(self):\n \"\"\"Runs the sieve of Eratosthenes (fast version from stackoverflow).\"\"\"\n if self.mx >= 2: # 2\n self.prime_numbers += [2]\n self.prime[4::2] = [False] * ((self.mx - 4) // 2 + 1)\n self.factor[2] = 2\n self.factor[4::2] = [2] * ((self.mx - 4) // 2 + 1)\n for i in range(3, self.mx + 1, 2): # 3 onwards\n if self.prime[i]:\n self.prime_numbers += [i]\n self.prime[i * i::2 * i] = [False] * (((self.mx + 1) - i * i - 1) // (2 * i) + 1)\n self.factor[i] = i\n self.factor[i * i::2 * i] = [i] * (((self.mx + 1) - i * i - 1) // (2 * i) + 1)\n\n def is_prime(self, n):\n \"\"\"Checks whether a number is prime. For numbers larger than self.mx, the Miller-Rabin test is used.\"\"\"\n assert 1 <= n < 3_317_044_064_679_887_385_961_981\n return self.prime[n] if n <= self.mx else PrimesUtil.is_prime_miller_rabin(n)\n\n @classmethod\n def is_prime_miller_rabin(cls, n):\n \"\"\"Checks whether a number is prime according to the Miller–Rabin primality test.\"\"\"\n assert 1 <= n < 3_317_044_064_679_887_385_961_981\n if n <= 4:\n return n == 2 or n == 3\n\n d, pow2 = n - 1, 0\n while d % 2 == 0:\n d //= 2\n pow2 += 1\n\n if n < 2_152_302_898_747:\n bases = [2, 3, 5, 7, 11]\n elif n < 341_550_071_728_321:\n bases = [2, 3, 5, 7, 11, 13, 17]\n else:\n bases = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41]\n\n for b in bases:\n x = pow(b, d, n)\n if x == 0 or x == 1 or x == n - 1:\n continue\n for _ in range(1, pow2):\n x = (x * x) % n\n if x == 1:\n return False\n if x == n - 1:\n break\n if x != n - 1:\n return False\n return True\n\n def factorise(self, n):\n \"\"\"Returns a list of tuples (prime, exponent) representing the prime factorisation of n.\n Performance depends on whether the number is from [1, self.mx] or from [self.mx+1, self.max**2].\"\"\"\n assert 1 <= n <= self.mx ** 2\n prime_factorisation = []\n if n <= self.mx:\n while n > 1:\n prime_number, exp = self.factor[n], 0\n while n % prime_number == 0:\n exp += 1\n n //= prime_number\n prime_factorisation += [(prime_number, exp)]\n else:\n for prime_number in self.prime_numbers:\n if prime_number ** 2 > n:\n break\n if n % prime_number == 0:\n exp = 0\n while n % prime_number == 0:\n exp += 1\n n //= prime_number\n prime_factorisation += [(prime_number, exp)]\n if n > 1:\n prime_factorisation += [(n, 1)]\n return prime_factorisation\n\n def divisors(self, n):\n \"\"\"Returns all divisors of a number as an unsorted list.\n Performance depends on whether number is from [1, self.mx] or from [self.mx+1, self.max**2].\"\"\"\n assert 1 <= n <= self.mx ** 2\n from itertools import product\n from math import prod\n div = []\n prime_factorisation = self.factorise(n)\n exp_ranges = [list(range(exp + 1)) for (_, exp) in prime_factorisation]\n for exponents in product(*exp_ranges):\n div += [prod(prime_factorisation[i][0] ** exponents[i] for i in range(len(prime_factorisation)))]\n return div\n\n\nn = int(input()) # 1 <= n <= 10**5\na = list(map(int, input().split())) # 2 <= n <= 10**5\n\nb = [0] * n\nPU = PrimesUtil(10 ** 6)\nprimes_used = set()\nlarger = False\nnext_number = 1\nfor i, v in enumerate(a):\n if not larger:\n pf = PU.factorise(v)\n ok = all(p not in primes_used for p, _ in pf)\n if ok:\n b[i] = v\n primes_used |= {p for p, _ in pf}\n else:\n x = v\n while True:\n x += 1\n pf = PU.factorise(x)\n ok = all(p not in primes_used for p, _ in pf)\n if ok:\n b[i] = x\n larger = True\n primes_used |= {p for p, _ in pf}\n break\n\n else:\n while True:\n next_number += 1\n pf = PU.factorise(next_number)\n ok = all(p not in primes_used for p, _ in pf)\n if ok:\n b[i] = next_number\n primes_used |= {p for p, _ in pf}\n break\n\nprint(*b)\n", "def get_primes(n):\n sieve = [True] * n\n p = []\n for i in range(2, n):\n if sieve[i]:\n p.append(i)\n for j in range(i * i, n, i):\n sieve[j] = False\n return p\n\n\ndef prime_factors(a, p):\n f = []\n for x in p:\n if x * x > a:\n break\n if a % x == 0:\n f.append(x)\n while a % x == 0:\n a //= x\n if a > 1:\n f.append(a)\n return f\n\n\np = get_primes(1310000)\nn = int(input())\nfactors = set()\nb = []\nfor i, x in enumerate(map(int, input().split())):\n f = prime_factors(x, p)\n if factors.isdisjoint(f):\n b.append(x)\n factors.update(f)\n continue\n x += 1\n while not factors.isdisjoint(f := prime_factors(x, p)):\n x += 1\n b.append(x)\n factors.update(f)\n for f in factors:\n p.remove(f)\n b += p[: n - len(b)]\n break\nprint(\" \".join(str(x) for x in b))\n", "import sys\r\nfrom array import array\r\n\r\ninput = lambda: sys.stdin.buffer.readline().decode().rstrip()\r\ninp = lambda dtype: [dtype(x) for x in input().split()]\r\ndebug = lambda *x: print(*x, file=sys.stderr)\r\nceil_ = lambda a, b: (a + b - 1) // b\r\nsum_n = lambda n: (n * (n + 1)) // 2\r\nget_bit = lambda x, i: (x >> i) & 1\r\nMint, Mlong, out = 2 ** 30 - 1, 2 ** 62 - 1, []\r\n\r\n\r\ndef count_prime(n):\r\n prim = array('i', [0] * (n + 1))\r\n\r\n for i in range(2, n + 1):\r\n if not prim[i]:\r\n for j in range(i, n + 1, i):\r\n prim[j] = i\r\n return prim\r\n\r\n\r\ndef prime_factor(x):\r\n fac = set()\r\n while x > 1:\r\n div = prim[x]\r\n fac.add(div)\r\n\r\n while x % div == 0:\r\n x //= div\r\n return fac\r\n\r\n\r\ndef solve(i):\r\n global primes\r\n while True:\r\n cfacs = prime_factor(ans[i])\r\n for j in cfacs:\r\n if j in primes: break\r\n else:\r\n primes |= cfacs\r\n break\r\n ans[i] += 1\r\n\r\n\r\ndef finish(ix):\r\n cur = 2\r\n for i in range(ix, n):\r\n ans.append(cur)\r\n solve(i)\r\n cur = ans[-1] + 1\r\n\r\n\r\nprim = count_prime(10 ** 7)\r\nfor _ in range(1):\r\n n, a = int(input()), array('i', inp(int))\r\n primes, ans = set(), array('i')\r\n\r\n for i in range(n):\r\n ans.append(a[i])\r\n solve(i)\r\n\r\n if a[i] < ans[i]:\r\n finish(i + 1)\r\n break\r\n\r\n out.append(' '.join(map(str, ans)))\r\nprint('\\n'.join(map(str, out)))\r\n", "class SegTree():\r\n\r\n def __init__(self, N, function=max, basement=0):\r\n self.n = N\r\n self.K = (self.n-1).bit_length()\r\n self.f = function\r\n self.b = basement\r\n self.seg = [basement]*(1 << (self.K+1)+1)\r\n\r\n def all_update(self, LIST):\r\n # a[i] -> LIST[i] for all i\r\n assert len(LIST) < self.n\r\n X = 1 << (self.K)\r\n for i, v in enumerate(LIST):\r\n self.seg[i + X] = v\r\n for i in range(X - 1, 0, - 1):\r\n self.seg[i] = self.f(self.seg[i << 1], self.seg[i << 1 | 1])\r\n\r\n def update(self, k, value):\r\n # a[i] -> value\r\n X = 1 << (self.K)\r\n k += X\r\n self.seg[k] = value\r\n while k:\r\n k = k >> 1\r\n self.seg[k] = self.f(self.seg[k << 1], self.seg[(k << 1) | 1])\r\n\r\n def get_value(self, I):\r\n # a[i]\r\n return self.seg[I + (1 << (self.K))]\r\n\r\n def query(self, L, R):\r\n # f [L,R)\r\n num = 1 << (self.K)\r\n L += num\r\n R += num\r\n vL = self.b\r\n vR = self.b\r\n while L < R:\r\n if L & 1:\r\n vL = self.f(vL, self.seg[L])\r\n L += 1\r\n if R & 1:\r\n R -= 1\r\n vR = self.f(self.seg[R], vR)\r\n L >>= 1\r\n R >>= 1\r\n return self.f(vL, vR)\r\n\r\n def find_min_index(self, L, R, X):\r\n return self.fmi(L, R, X, 1, 0, 1 << (self.K))\r\n\r\n def fmi(self, a, b, x, k, l, r):\r\n if self.seg[k] < x or r <= a or b <= l:\r\n return -1\r\n else:\r\n if k >= (1 << self.K):\r\n return k-(1 << self.K)\r\n else:\r\n vl = self.fmi(a, b, x, k << 1, l, (l+r)//2)\r\n if vl != -1:\r\n return vl\r\n return self.fmi(a, b, x, k << 1 | 1, (l+r)//2, r)\r\n\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nMAX = 1500000\r\nSTILL_EQUAL = True\r\nBASE = [1]*(MAX + 1)\r\nQ = SegTree(MAX + 10)\r\nQ.all_update(BASE)\r\nb = []\r\nSEEN = [False]*(MAX + 1)\r\nSUBSTRACTED = [False]*(MAX + 1)\r\n\r\nPRIMES = [[] for _ in range(MAX + 1)]\r\nisprime = [True]*(MAX + 1)\r\nisprime[1] = False\r\nfor i in range(2, MAX + 1):\r\n if isprime[i] == False:\r\n continue\r\n PRIMES[i].append(i)\r\n for j in range(2*i, MAX + 1, i):\r\n isprime[j] = False\r\n PRIMES[j].append(i)\r\n\r\n\r\nfor i, v in enumerate(a):\r\n\r\n if STILL_EQUAL:\r\n pos = Q.find_min_index(v, MAX+1, 1)\r\n Q.update(pos, 0)\r\n b.append(pos)\r\n if pos > v:\r\n STILL_EQUAL = False\r\n else:\r\n pos = Q.find_min_index(2, MAX+1, 1)\r\n Q.update(pos, 0)\r\n b.append(pos)\r\n\r\n if pos > 1 and SEEN[pos] == False:\r\n SEEN[pos] = True\r\n for p in PRIMES[pos]:\r\n if SUBSTRACTED[p] == False:\r\n for num in range(p, MAX + 1, p):\r\n if SUBSTRACTED[num] == False:\r\n SUBSTRACTED[num] = True\r\n Q.update(num, 0)\r\n\r\nprint(*b)\r\n\r\n" ]

[ "n,m=map(int,input().split())\r\ncounter=-1\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n if(m*100>=(x*100)+y):\r\n counter=max(counter,(100-y)%100)\r\n\r\nprint(counter)", "a,b=map(int,input().split())\r\nsum=-1\r\nb=b*100\r\nwhile a:\r\n a-=1\r\n s,t=map(int,input().split())\r\n c=100 *s +t\r\n if b<c:\r\n continue\r\n sum = max(sum, (b - c) % 100)\r\n\r\nprint(sum)", "if __name__ == '__main__':\r\n cin = input\r\n n, s = map(int, cin().split())\r\n mx = -1\r\n\r\n for i in range(n):\r\n x, y = map(int, cin().split())\r\n if x <= s:\r\n mx = max(mx, not((s - x) >= 0)) if not y else max(mx, 100 - y) if x + 1 <= s else mx\r\n print(int(mx))", "n, s = map(int, input().split())\nans = -1\nfor _ in range(n):\n x, y = map(int, input().split())\n if x*100+y <= s*100:\n ans = max(ans, (100*s-x*100-y)%100)\nprint(ans)", "# Author: SaykaT\r\n# Problem: 463A\r\n# Time Created: July 21(Tuesday) 2020 || 02:59:52\r\n\r\n#>-------------------------<#\r\n\r\n# Helper Functions. -> Don't cluster your code.\r\n\r\n# IO Functions. -> Input output\r\ndef io():\r\n n, s = map(int, input().split())\r\n sugar = []\r\n for _ in range(n):\r\n x, y = map(int, input().split())\r\n dollar = x*100 + y\r\n sugar.append(dollar)\r\n return [n, s*100, sugar]\r\n\r\n# Main functions. -> Write the main solution here\r\ndef solve():\r\n n, s, sugar = io()\r\n ans = -1\r\n for i in sugar:\r\n if s >= i:\r\n change = (s - i) % 100\r\n ans = max(change, ans)\r\n print(ans)\r\n# Multiple test cases. -> When you have T test cases.\r\nsolve()\r\n \r\n", "import sys \r\ninput = sys.stdin.readline \r\n\r\nn, s = map(int, input().split())\r\nans = 100 \r\nf = 0\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n if(x < s):\r\n if(y):\r\n ans = min(ans, y)\r\n \r\n if(x < s or (x == s and y == 0)):\r\n f = 1\r\n \r\nif(f):\r\n print(100 - ans)\r\nelse:\r\n print(-1)\r\n", "n,s = list(map(int,input().split()))\r\nres = 100\r\ncnt = 0\r\narr = []\r\nfor i in range(n):\r\n x,y = list(map(int,input().split()))\r\n\r\n\r\n\r\n if x<s:\r\n if y:\r\n res = min(res,y)\r\n if x<s or (x==s and y==0):\r\n cnt=1\r\n\r\n\r\n # arr.append((x,y))\r\nif not cnt:\r\n print(-1)\r\nelse:\r\n print(100-res)\r\n\r\n\r\n", "a=list(map(int,input().split()))\r\ne=-1\r\nfor i in range(a[0]):\r\n b=list(map(int,input().split()))\r\n if float(str(b[0])+'.'+str(b[1]))<=a[1]:\r\n if e<abs(-b[1]+100) and b[1]!=0:\r\n e=abs(100-b[1])\r\n if b[1]==0 and e<0:\r\n e=0\r\nprint(e)", "sugar_type_amount_and_dollars = input().split(' ')\r\nn = int(sugar_type_amount_and_dollars[0])\r\ns = int(sugar_type_amount_and_dollars[1])\r\ns_cents = s * 100\r\nsweets = []\r\n\r\nfor _ in range(n):\r\n price = input().split(' ')\r\n dollars = int(price[0])\r\n cents = int(price[1])\r\n total = dollars * 100 + cents\r\n\r\n if s_cents >= total:\r\n diff = s_cents - total\r\n sweets.append(diff % 100)\r\n\r\nprint(max(sweets) if len(sweets) else -1)\r\n", "t, m = input(\"\").split()\nc = 0\nflag = 0\nt = int(t)\nm = int(m)\nfor i in range(0,t):\n\tp, q = input(\"\").split()\n\tp = int(p)\n\tq = int(q)\n\tif (p<m) or (p==m and q ==0):\n\t\tflag = 1\n\t\tif q > 0:\n\t\t\tif (100 - q > c):\n\t\t\t\tc = 100 - q\nif ( flag == 0):\n\tprint(-1)\nelse:\n\tprint(c)\t\t\n", "n, s = map(int, input().split())\nans = -1\nwhile n:\n n -= 1\n x, y = map(int, input().split())\n val = s * 100\n if x * 100 + y <= val:\n val -= x * 100 + y\n val %= 100\n ans = max(ans, val)\n\nprint(ans)\n\n\n\n\n\t \t\t\t \t \t\t\t \t \t\t \t\t \t", "r=lambda:map(int,input().split())\r\nn,s=r()\r\nans=-1\r\ns*=100\r\nwhile n:\r\n n-=1\r\n x,y=r()\r\n x=x*100+y\r\n if x<=s:\r\n ans=max(ans,(s-x)%100)\r\nprint(ans)\r\n", "def 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\nn,s = invr()\ntotal = -1\nfor i in range(n):\n x,y = invr()\n if x*100 + y <= s*100:\n total = max(total,((x+1)*100 - x*100 - y)%100)\n\nprint(total)\n\t\t\t \t\t\t\t\t \t \t\t \t \t \t\t \t", "def main():\r\n n, s = map(int, input().split())\r\n s *= 100\r\n result = -1\r\n for _ in range(n):\r\n x, y = map(int, input().split())\r\n p = x * 100 + y\r\n if p > s:\r\n continue\r\n d = s - p\r\n result = max(result, d % 100)\r\n print(result)\r\n\r\n\r\nmain()\r\n", "n,m=map(int,input().split())\r\ni=0\r\nct=0\r\nmx=0\r\nfor _ in range(n):\r\n p,q = map(int, input().split())\r\n if p>m : ct=ct+1\r\n elif p==m and q>0: ct=ct+1\r\n elif q>0:\r\n mx=max(mx,100-q)\r\nif ct==n: print(-1)\r\nelse: print(mx)", "import math\r\n\r\n\r\ndef main_function():\r\n n, s = [int(i) for i in input().split(\" \")]\r\n is_found = False\r\n max_val = 0\r\n for i in range(n):\r\n x, y = [int(j) for j in input().split(\" \")]\r\n if x == s and y == 0:\r\n is_found = True\r\n elif x < s:\r\n is_found = True\r\n if y > 0 and max_val < 100 - y:\r\n max_val = 100 - y\r\n if is_found:\r\n print(max_val)\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\r\n\r\n\r\n\r\n\r\nmain_function()", "n,s=map(int,input().split())\r\nr,t=100,0\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n if s>x or (s==x and y==0):\r\n t=1\r\n if y!=0:r=min(r,y)\r\nprint(100-r if t else -1)", "if __name__ == '__main__':\r\n cin = input\r\n n, s = map(int, cin().split())\r\n mx = -1\r\n\r\n for i in range(n):\r\n x, y = map(int, cin().split())\r\n if x + min(1, y) <= s:\r\n mx = max(mx, (100 - y) % 100)\r\n print(mx)", "n , s = map(int,input().split())\r\n\r\nans = -1\r\n\r\nfor i in range(n):\r\n x , y = map(int,input().split())\r\n\r\n if s >= x and y == 0 :\r\n ans = max(ans , (100 - y) % 100)\r\n elif s > x and y > 0:\r\n ans = max(ans , (100 - y) % 100)\r\n\r\nprint(ans)", "# s dollar for sugar\r\nn,s=map(int,input().split())\r\nans=-1\r\nfor _ in range(n):\r\n\ta,b=map(int,input().split())\r\n\tif a<s:\r\n\t\tif b!=0:\r\n\t\t\tans=max(ans,100-b)\r\n\tif a<=s and b==0:\r\n\t\tans=max(ans,b)\r\nprint(ans)", "n,s=map(int,input().split())\r\ncent=0; f=0\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n if x<s and y>0 and 100-y>cent:\r\n f=1; cent=100-y\r\n elif x<=s and y==0: f=1\r\nprint(cent if f else -1)", "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, s=read_ints()\r\n\tans=-1\r\n\tfor i in range(n):\r\n\t\tx,y=read_ints()\r\n\t\tif x*100+y > s*100:\r\n\t\t\tcontinue\r\n\t\tans=max(ans, (100-y)%100)\r\n\tprint(ans)\r\n\r\nsolve()\r\n", "''' Caisa и сахар 1200'''\r\n#n = int(input())\r\nch = input()\r\nch = ch.split()\r\nch = [int(x) for x in ch]\r\nn, s = ch\r\ns = s * 100\r\nmx = 0\r\nf = False\r\nfor i in range(n):\r\n x = input()\r\n x = x.split()\r\n c = eval(x[0] + '* 100 +'+x[1]);# print(c)\r\n if s >= c:\r\n sda4a = (s - c) % 100 # ; print(sda4a)\r\n f = True\r\n if mx < sda4a:\r\n mx = sda4a\r\n\r\n\r\nif f:\r\n print(mx)\r\nelse:\r\n print(-1)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, s = map(int, input().split())\r\nc = -1\r\nd = 0\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n if x + (y>0) <= s:\r\n c = max(c, 100 - y if y != 0 else 0)\r\n\r\nprint(c)", "n, s = map(int,input().split())\r\nans = -1\r\ns*=100\r\nfor _ in range(n):\r\n x,y = map(int,input().split())\r\n x = y+(x*100)\r\n if x <= s:\r\n ans = max(ans, (s-x)%100)\r\nprint(ans)", "n,s=map(int,input().split())\r\narr=[]\r\ns=s*100\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n arr.append(x*100+y)\r\nans=-1\r\nfor i in range(n):\r\n if s>=arr[i]:\r\n sdacha=(s-arr[i])%100\r\n ans=max(sdacha,ans)\r\nprint(ans)", "n,s=map(int,input().split())\r\nm=-1\r\nfor i in range(n):\r\n l,x=map(int,input().split())\r\n if(l<s):\r\n if(x>0):\r\n m=max(m,100-x)\r\n else:\r\n m=max(m,0)\r\n elif(l==s):\r\n if(x==0):\r\n m=max(m,0)\r\nprint(m)\r\n", "n, s = map(int, input().split())\r\nmn, alt = 100, 0\r\nfor i in range(n):\r\n d, c = map(int, input().split())\r\n if (d > s) or (d == s and c != 0): continue\r\n if c: mn = min(c, mn)\r\n else: alt = 1\r\nif mn == 100 and alt == 1: mn = 0\r\nprint(100 - mn - int(mn == 100) - 100 * int(mn == 0))\r\n", "from collections import deque, defaultdict, Counter\r\nfrom itertools import product, groupby, permutations, combinations, accumulate, zip_longest, \\\r\n combinations_with_replacement\r\nfrom math import gcd, floor, inf, log2, sqrt, log10, factorial\r\nfrom bisect import bisect_right, bisect_left\r\nfrom statistics import mode\r\nfrom string import ascii_lowercase, ascii_uppercase\r\nfrom heapq import heapify, heappop, heappush, heappushpop, heapreplace, nlargest, nsmallest, \\\r\n merge\r\nfrom copy import deepcopy\r\n\r\ncases, avail = map(int, input().split())\r\nans = 0\r\nbought = False\r\nfor _ in range(cases):\r\n dol, cent = map(int, input().split())\r\n\r\n if (dol + cent/100) <= avail:\r\n bought = True\r\n if dol >= avail or cent == 0:\r\n continue\r\n ans = max(ans, 100-cent)\r\nif not bought:\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\r\n\r\n\r\n\r\n\r\n\r\n", "n, m = map(int, input().split())\r\nmaxe=-1\r\nfor i in range(n):\r\n dol, cent = map(int, input().split())\r\n dol_new = dol*100 +cent\r\n if m *100 >= dol_new:\r\n maxe = max(maxe, (m*100-dol*100-cent)%100)\r\nprint(maxe)", "n,s = map(int,input().split())\nans = []\nfor _ in range(n):\n dollars, cents = map(int,input().split())\n cost = dollars * 100 + cents\n money = s * 100\n if money >= cost:\n ans.append((money - cost) % 100)\nif len(ans) == 0:\n print(-1)\nelse:\n print(max(ans))\n\t\t\t\t \t \t\t \t \t \t\t\t\t \t\t", "n,s=list(map(int,input().split()))\r\ns=s*100\r\nc=-1\r\nfor i in range(n):\r\n x,y=list(map(int,input().split()))\r\n if x*100 + y<=s:\r\n c=max(c,(100-y)%100)\r\n\r\nprint(c)", "''' A. Caisa and Sugar\nhttps://codeforces.com/contest/463/problem/A\n'''\n\nimport io, os, sys\ninput = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline # decode().strip() if str\noutput = sys.stdout.write\n\nDEBUG = os.environ.get('debug') not in [None, '0']\n\nif DEBUG:\n from inspect import currentframe, getframeinfo\n from re import search\n\ndef debug(*args):\n if not DEBUG: return\n frame = currentframe().f_back\n s = getframeinfo(frame).code_context[0]\n r = search(r\"\\((.*)\\)\", s).group(1)\n vnames = r.split(', ')\n var_and_vals = [f'{var}={val}' for var, val in zip(vnames, args)]\n prefix = f'{currentframe().f_back.f_lineno:02d}: '\n print(f'{prefix}{\", \".join(var_and_vals)}')\n\n# for int dict key\nfrom random import randrange\nRAND = randrange(1 << 62)\ndef conv(x): return x ^ RAND\n\nINF = float('inf')\n\n# -----------------------------------------\n\ndef solve(N, S, costs):\n mx = -1\n for x, y in costs:\n if x * 100 + y > S * 100: continue\n if y == 0: mx = max(mx, 0)\n else: mx = max(mx, 100 - y)\n return mx\n\n\ndef main():\n N, S = list(map(int, input().split()))\n costs = [list(map(int, input().split())) for _ in range(N)]\n out = solve(N, S, costs)\n print(out)\n\n\nif __name__ == '__main__':\n main()\n\n", "n, s = map(int, input().split())\r\nmn = 1000\r\nans = 0\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n cost = x + y / 100\r\n if cost <= s:\r\n mn = min(mn, x)\r\n if y == 0:\r\n continue\r\n ans = max(ans, min(99, 100-y))\r\nif mn == 1000:\r\n ans = -1\r\nprint(ans)\r\n", "n,s=map(int,input().split(\" \"))\r\nans=-1\r\nfor _ in range(n):\r\n a,b=map(int,input().split(\" \"))\r\n if a<s:\r\n if (b!=0):\r\n ans=max(ans,100-b)\r\n if a<=s and b==0:\r\n ans=max(ans,0)\r\nprint(ans)", "n, s = map(int, input().split())\ns *= 100\nmaxim = -1\nfor _ in range(n):\n x, y = map(int, input().split())\n cost = x * 100 + y\n if cost <= s:\n maxim = max((s - cost) % 100, maxim)\nprint(maxim)\n\t\t\t \t \t\t \t\t \t\t\t \t \t \t" ]

[ "r = lambda: list(map(int, input().split()))\r\nri = lambda: int(input())\r\nn, a, m, b = ri(), r(), ri(), r()\r\nc = [0] * n\r\nfor e in b: c[e - 1] += 1\r\nc[0] *= 2; c[-1] *= 2\r\nd = 0\r\ndf= 0\r\nr = max(e // 2 for e in c)\r\nc = [e - r * 2 for e in c]\r\nif any(c):\r\n for i in range(n - 1):\r\n de = a[i+1] - a[i]\r\n d += min(c[i], c[i+1]) * de\r\n df += de \r\n print(d + r * 2 * df)\r\nelse:\r\n de = a[1] - a[0]\r\n for i in range(1, n - 1):\r\n if a[i + 1] - a[i] != de: print(-1); break\r\n else: print(r * de * 2 * (n - 1) - de)" ]

[ "sln = [75]\r\nfor i in range(80):\r\n\tsln.append(min(10**18 + 10, 68 + 2 * sln[-1]))\r\n\r\nf0 = 'What are you doing at the end of the world? Are you busy? Will you save us?'\r\nf1_1 = 'What are you doing while sending \"'\r\nf1_2 = '\"? Are you busy? Will you send \"'\r\nf1_3 = '\"?'\r\n\r\ndef getAns(n, k):\r\n\twhile True:\r\n\t\tif n <= 80 and k >= sln[n]:\r\n\t\t\treturn '.'\r\n\t\telif n == 0:\r\n\t\t\treturn f0[k]\r\n\t\telif k < 34:\r\n\t\t\treturn f1_1[k]\r\n\t\telif n > 80 or k < 34 + sln[n - 1]:\r\n\t\t\tk -= 34\r\n\t\t\tn -= 1\r\n\t\telif k < 34 + sln[n - 1] + 32:\r\n\t\t\treturn f1_2[k - 34 - sln[n - 1]]\r\n\t\telif k < 34 + sln[n - 1] + 32 + sln[n - 1]:\r\n\t\t\tk -= 34 + sln[n - 1] + 32\r\n\t\t\tn -= 1\r\n\t\telif k - 34 - sln[n - 1] - 32 - sln[n - 1] < 2:\r\n\t\t\treturn f1_3[k - 34 - sln[n - 1] - 32 - sln[n - 1]]\r\n\t\telse:\r\n\t\t\treturn '.'\r\n\r\nq = int(input())\r\nfor qq in range(q):\r\n\tn, k = list(map(int, input().split()))\r\n\tprint(getAns(n, k - 1), end='')", "f0 = \"What are you doing at the end of the world? Are you busy? Will you save us?\"\r\nstart = 'What are you doing while sending \"'\r\nmid = '\"? Are you busy? Will you send \"'\r\nkonec = '\"?'\r\n\r\nmemo = dict()\r\n\r\ndef size(n):\r\n if n > 60:\r\n return 10**18\r\n if n == 0:\r\n return len(f0)\r\n if n in memo:\r\n return memo[n]\r\n ALL = 0\r\n ALL += len(start) + size(n-1) + len(mid) + size(n-1) + len(konec)\r\n memo[n] = ALL\r\n return ALL\r\n\r\ndef letter(n,k):\r\n while True:\r\n while True:\r\n if n == 0:\r\n if k < len(f0):\r\n return f0[k]\r\n else:\r\n return '.'\r\n acc = len(start)\r\n if acc > k:\r\n return start[k]\r\n adding = size(n-1)\r\n if acc + adding > k:\r\n k -= acc\r\n n -= 1\r\n break\r\n acc += adding\r\n adding = len(mid)\r\n if acc + adding > k:\r\n return mid[k-acc]\r\n acc += adding\r\n adding = size(n-1)\r\n if acc + adding > k:\r\n k -= acc\r\n n -= 1\r\n break\r\n acc += adding\r\n adding = len(konec)\r\n if acc + adding > k:\r\n return konec[k-acc]\r\n return '.'\r\n\r\n##def letter2(n,k):\r\n## while True:\r\n## if n == 0:\r\n## if k < len(f0):\r\n## return f0[k]\r\n## acc = len(start)\r\n## if acc > k:\r\n## return \r\n\r\nniz = ''\r\nq = int(input())\r\nfor _ in range(q):\r\n n,k = list(map(int, input().strip().split()))\r\n crka = letter(n,k-1)\r\n niz += crka\r\nprint(niz)\r\n \r\n", "from functools import lru_cache\r\nimport sys\r\nsys.setrecursionlimit(100004)\r\ninput=sys.stdin.readline\r\n\r\n \r\nif __name__=='__main__':\r\n s=\"What are you doing at the end of the world? Are you busy? Will you save us?\"\r\n # print(len(s0))\r\n head='What are you doing while sending \"'\r\n # print(len(head))\r\n mid='\"? Are you busy? Will you send \"'\r\n # print(len(mid))\r\n tail='\"?'\r\n # print(len(tail))\r\n @lru_cache(None)\r\n def getlength(n):\r\n if n>55:return 10**20\r\n return 75 if n==0 else getlength(n-1)*2+34+32+2\r\n \r\n @lru_cache(None)\r\n def found(n,k):\r\n if n==0:\r\n return s0[k] if k<=75 else '.'\r\n s1,s2,s3,s4,s5=split(n)\r\n if k<s1:\r\n return head[k]\r\n elif k<s2:\r\n return found(n-1,k-s1)\r\n elif k<s3:\r\n return mid[k-s2]\r\n elif k<s4:\r\n return found(n-1,k-s3)\r\n elif k<s5:\r\n return tail[k-s4]\r\n else:\r\n return '.'\r\n \r\n t=int(input())\r\n for _ in range(t):\r\n n,k=map(int,input().split())\r\n k-=1\r\n l=getlength(n)\r\n if k>=l:\r\n print('.',end='')\r\n continue\r\n while True:\r\n if n==0:\r\n print(s[k],end='')\r\n break\r\n if k<34:\r\n print(head[k],end='')\r\n break\r\n k-=34\r\n pre=getlength(n-1)\r\n if k<pre:\r\n n-=1\r\n continue\r\n k-=pre\r\n if k<32:\r\n print(mid[k],end='')\r\n break\r\n k-=32\r\n if k<pre:\r\n n-=1\r\n continue\r\n k-=pre\r\n if k<2:\r\n print(tail[k],end='')\r\n break\r\n k-=2\r\n n-=1", "f0 = 'What are you doing at the end of the world? Are you busy? Will you save us?'\nft1, ft2, ft3 = 'What are you doing while sending \"', '\"? Are you busy? Will you send \"', '\"?'\n\nflen = [2 * 10 ** 18] * (10 ** 5 + 1)\nflen[0] = len(f0)\nfor i in range(1, 56):\n flen[i] = len(ft1) + len(ft2) + len(ft3) + 2 * flen[i-1]\n\ndef ans(n, k):\n while True:\n if n == 0:\n return f0[k]\n if k < len(ft1):\n return ft1[k]\n k -= len(ft1)\n if k < flen[n-1]:\n n -= 1\n continue\n k -= flen[n-1]\n if k < len(ft2):\n return ft2[k]\n k -= len(ft2)\n if k < flen[n-1]:\n n -= 1\n continue\n k -= flen[n-1]\n return ft3[k]\n\nq = int(input())\na = ''\nfor _ in range(q):\n n, k = map(int, input().split())\n k -= 1\n if k >= flen[n]:\n a += '.'\n continue\n a += ans(n, k)\nprint(a)\n", "s = [\n \"What are you doing at the end of the world? Are you busy? Will you save us?\",\n \"What are you doing while sending \\\"\",\n \"\\\"? Are you busy? Will you send \\\"\",\n \"\\\"?\"\n]\n\nl = list(map(len, s))\nls = [l[0]]\nwhile ls[-1] <= int(1e18):\n ls.append(2 * ls[-1] + sum(l[1:]))\n\nans = \"\"\nq = int(input())\nfor _ in range(q):\n n, k = map(int, input().split())\n c = ''\n while c == '':\n if n < len(ls) and ls[n] < k:\n c = '.'\n elif n == 0:\n c = s[0][k - 1]\n elif k <= l[1]:\n c = s[1][k - 1]\n elif l[1] < k and (len(ls) <= n or k <= l[1] + ls[n - 1]):\n k -= l[1]\n n -= 1\n elif l[1] + ls[n - 1] < k <= l[1] + ls[n - 1] + l[2]:\n c = s[2][k - l[1] - ls[n - 1] - 1]\n elif l[1] + ls[n - 1] + l[2] < k <= l[1] + ls[n - 1] + l[2] + ls[n - 1]:\n k -= l[1] + ls[n - 1] + l[2]\n n -= 1\n else:\n c = s[3][k - ls[n] - 1]\n ans += c\nprint(ans)\n", "## Seasonals ##\r\nmy_str = \"What are you doing at the end of the world? Are you busy? Will you save us?\"\r\n\r\nstr1 = 'What are you doing while sending \"'\r\nstr2 = '\"? Are you busy? Will you send \"'\r\nsuffix = '\"?'\r\n\r\nc = len(str1) + len(str2) + len(suffix)\r\n\r\n\r\ndef len_f_n(n):\r\n if n == 0:\r\n return len(my_str)\r\n else:\r\n return (2 ** n) * (len(my_str) + c) - c\r\n\r\n\r\ndef g(n, k):\r\n while n >= 0:\r\n if n == 0:\r\n if k < len(my_str):\r\n return my_str[k]\r\n else:\r\n # print('my_str ., k: {}'.format(k))\r\n return '.'\r\n\r\n if k < len(str1):\r\n return str1[k]\r\n\r\n if n > 75:\r\n k = k - len(str1)\r\n else:\r\n l_f_n = len_f_n(n - 1)\r\n if k < len(str1) + l_f_n:\r\n k = k - len(str1)\r\n elif k < len(str1) + l_f_n + len(str2):\r\n return str2[k - len(str1) - l_f_n]\r\n elif k < len(str1) + l_f_n + len(str2) + l_f_n:\r\n k = k - l_f_n - len(str1) - len(str2)\r\n elif k < len(str1) + l_f_n + len(str2) + l_f_n + len(suffix):\r\n return suffix[int(k - len(str1) - l_f_n - len(str2) - l_f_n)]\r\n else:\r\n # print('f_{} .'.format(n))\r\n return '.'\r\n\r\n n -= 1\r\n\r\n\r\nq = int(input())\r\ns = ''\r\n\r\nfor _ in range(q):\r\n args = input().split()\r\n n, k = int(args[0]), int(args[1])\r\n s += g(n, k - 1)\r\n\r\nprint(s)", "import sys\n\n\nf0 = \"What are you doing at the end of the world? Are you busy? Will you save us?\"\npart1 = \"What are you doing while sending \\\"\"\npart2 = \"\\\"? Are you busy? Will you send \\\"\"\npart3 = \"\\\"?\"\na = len(part1)\nb = len(part2)\nc = len(part3)\nbiggest = 10**18+2\nlen_fn = [0]*(10**5+10)\nlen_fn[0] = len(f0)\nfor i in range(1,10**5+1):\n len_fn[i] = a+b+c+2*len_fn[i-1]\n if len_fn[i]>biggest:\n len_fn[i] = biggest\n\n\nq = int(input())\nfor _ in range(q):\n n,k = [int(x) for x in input().split()]\n k-=1\n while n>0:\n if k<a:\n sys.stdout.write(part1[k])\n break\n elif k<a+len_fn[n-1]:\n k -= a\n n -= 1\n\n elif k<a+len_fn[n-1] + b:\n sys.stdout.write(part2[k-a-len_fn[n-1]])\n break\n elif k<a+2*len_fn[n-1] + b:\n k-= a + len_fn[n-1] + b\n n-=1\n elif k<a+2*len_fn[n-1] + b + c:\n sys.stdout.write(part3[k-a-2*len_fn[n-1]-b])\n break\n else:\n sys.stdout.write('.')\n break\n else:\n if k<len(f0):\n sys.stdout.write(f0[k])\n else:\n sys.stdout.write('.')\n", "tmp = [\"\"] * 3\r\ntmp[0] = \"What are you doing while sending \\\"\"\r\ntmp[1] = \"\\\"? Are you busy? Will you send \\\"\"\r\ntmp[2] = \"\\\"?\"\r\n\r\n\r\ndef fun(s):\r\n return tmp[0] + s + tmp[1] + s + tmp[2]\r\n\r\n\r\nMAX = 60\r\nf = [\"\"] * 3\r\nf[0] = \"What are you doing at the end of the world? Are you busy? Will you save us?\"\r\nf[1] = fun(f[0])\r\nf[2] = fun(f[1])\r\nl = [0] * (MAX + 1)\r\nl[0] = len(f[0])\r\nl[1] = len(f[1])\r\nl[2] = len(f[2])\r\nfor i in range(3, MAX + 1):\r\n l[i] = l[i - 1] * 2 + 68\r\n\r\n\r\ndef solve(n, k):\r\n if n <= MAX and l[n] < k:\r\n return \".\"\r\n\r\n if n <= 2:\r\n return f[n][k - 1]\r\n\r\n if n > MAX:\r\n if k > 34 * (n - MAX):\r\n return solve(MAX, k - 34 * (n - MAX))\r\n return tmp[0][(k - 1) % 34]\r\n\r\n if k <= 34:\r\n return tmp[0][k - 1]\r\n k -= 34\r\n\r\n if k <= l[n - 1]:\r\n return solve(n - 1, k)\r\n k -= l[n - 1]\r\n\r\n if k <= 32:\r\n return tmp[1][k - 1]\r\n k -= 32\r\n\r\n if k <= l[n - 1]:\r\n return solve(n - 1, k)\r\n k -= l[n - 1]\r\n\r\n return tmp[2][k - 1]\r\n\r\n\r\nq = int(input())\r\nfor i in range(q):\r\n nn, kk = map(int, input().split())\r\n print(solve(nn, kk), end=\"\")\r\nprint()\r\n", "s = \"What are you doing at the end of the world? Are you busy? Will you save us?\"\n\n#fmt = 'What are you doing while sending \"{}\"? Are you busy? Will you send \"{}\"?'\n\n\ndef L(n):\n return 143*2**n-68 if n < 55 else 10**18\n\nbeg = 'What are you doing while sending \"'\nmid = '\"? Are you busy? Will you send \"'\nend = '\"?'\nbeglen = len(beg)\nmidlen = len(mid)\nendlen = len(end)\n\ndef f(n,k):\n while True:\n if n == 0:\n if k < len(s):\n return s[k]\n return '.'\n n -= 1\n\n if k < beglen:\n return beg[k]\n k -= beglen\n if k < L(n):\n continue\n k -= L(n)\n if k < midlen:\n return mid[k]\n k -= midlen\n if k < L(n):\n continue\n k -= L(n)\n if k < endlen:\n return end[k]\n return '.'\n\n\n\nq = int(input())\n\nans = []\nfor _ in range(q):\n n,k = map(int,input().split())\n k -= 1\n ans.append(f(n,k))\nprint(''.join(ans))\n\n\n", "def func(n, i):\r\n while True:\r\n if n == 0:\r\n if i < N1:\r\n return f0[i]\r\n else:\r\n return '.'\r\n l = lenf[n - 1] if n <= len(lenf) else lenf[-1]\r\n if i < N2:\r\n return f10[i]\r\n elif i < N2 + l:\r\n # return func(n - 1, i - 34)\r\n n -= 1\r\n i -= N2\r\n elif i < N2 + l + N3:\r\n return f11[i - (N2 + l)]\r\n elif i < N2 + l + N3 + l:\r\n n -= 1\r\n i -= (N2 + l + N3)\r\n # return func(n - 1, i - (34 + l + 32))\r\n elif i < N2 + l + N3 + l + N4:\r\n return f12[i - (N2 + l + N3 + l)]\r\n else:\r\n return '.'\r\n\r\n\r\nif __name__ == '__main__':\r\n q = int(input())\r\n ans = ''\r\n f0 = \"What are you doing at the end of the world? Are you busy? Will you save us?\"\r\n f10 = \"What are you doing while sending \\\"\"\r\n f11 = \"\\\"? Are you busy? Will you send \\\"\"\r\n f12 = \"\\\"?\"\r\n N1, N2, N3, N4 = len(f0), len(f10), len(f11), len(f12)\r\n\r\n lenf = [N1]\r\n while lenf[-1] < 1e18:\r\n lenf.append(N2 + N3 + N4 + 2 * lenf[-1])\r\n # print(len(lenf))\r\n\r\n for i in range(q):\r\n n, k = [int(i) for i in input().split(' ')]\r\n # print(n, k)\r\n res = func(n, k - 1)\r\n ans += res\r\n print(ans)\r\n", "# What are you doing while sending \" \"? Are you busy? Will you send \" \"?\r\n\r\n\r\nlastl = len('What are you doing at the end of the world? Are you busy? Will you save us?')\r\nls = [lastl]\r\nfor i in range(1, 100086):\r\n l = lastl * 2 + 68 if lastl <= 1e18 else lastl\r\n ls.append(l)\r\n lastl = l\r\n\r\n\r\ndef get(n, k):\r\n if k >= ls[n]:\r\n return '.'\r\n while True:\r\n ll = ls[n-1]\r\n if n == 0:\r\n return 'What are you doing at the end of the world? Are you busy? Will you save us?'[k]\r\n if k < 34:\r\n return 'What are you doing while sending \"'[k]\r\n elif k < 34 + ll:\r\n n -= 1\r\n k -= 34\r\n elif k < 34 + ll + 32:\r\n return '\"? Are you busy? Will you send \"'[k - ll - 34]\r\n elif k < 34 + ll + 32 + ll:\r\n n -= 1\r\n k -= (34 + 32 + ll)\r\n else:\r\n return '\"?'[k-ll-ll-34-32]\r\n\r\naaa = []\r\nqc = int(input())\r\nqs = [tuple(int(i) for i in input().split()) for _ in range(qc)]\r\nfor n, k in qs:\r\n aaa.append(get(n,k-1))\r\n\r\nprint(''.join(aaa))\r\n " ]

[ "from collections import defaultdict, deque\r\n\r\ndef find_eulerian_path(graph):\r\n in_degree = defaultdict(int)\r\n out_degree = defaultdict(int)\r\n for u in graph:\r\n for v in graph[u]:\r\n out_degree[u] += 1\r\n in_degree[v] += 1\r\n\r\n start = None\r\n end = None\r\n for node in set(in_degree.keys()) | set(out_degree.keys()):\r\n if in_degree[node] == out_degree[node]:\r\n continue\r\n elif in_degree[node] == out_degree[node] + 1:\r\n if end is not None:\r\n return None\r\n end = node\r\n elif in_degree[node] + 1 == out_degree[node]:\r\n if start is not None:\r\n return None\r\n start = node\r\n else:\r\n return None\r\n\r\n if start is None:\r\n start = next(iter(graph))\r\n\r\n stack = [start]\r\n path = []\r\n while stack:\r\n u = stack[-1]\r\n if not graph[u]:\r\n path.append(stack.pop())\r\n else:\r\n v = graph[u].pop()\r\n stack.append(v)\r\n\r\n if len(path) != sum(out_degree.values()) + 1:\r\n return None\r\n\r\n return path[::-1]\r\n\r\nn = int(input())\r\nedges = [input().strip() for _ in range(n)]\r\n\r\ngraph = defaultdict(list)\r\nfor edge in edges:\r\n u, v = edge[:2], edge[1:]\r\n graph[u].append(v)\r\n\r\npath = find_eulerian_path(graph)\r\nif path is None:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n password = path[0]\r\n for node in path[1:]:\r\n password += node[-1]\r\n print(password)\r\n", "from collections import defaultdict\r\n\r\nn = int(input())\r\nsubs = [input() for i in range(n)]\r\n\r\nin_degree = defaultdict(int)\r\nout_degree = defaultdict(int)\r\nadj = defaultdict(list)\r\nnodes = set()\r\n\r\nfor sub in subs:\r\n a = sub[:2]\r\n b = sub[1:]\r\n\r\n nodes.add(a)\r\n nodes.add(b)\r\n\r\n out_degree[a] += 1\r\n in_degree[b] += 1\r\n adj[a].append(b)\r\n\r\n# check if can euler trail\r\nstart = None\r\nend = None\r\nfor node in nodes:\r\n net_deg = out_degree[node]-in_degree[node]\r\n\r\n if net_deg == 0:\r\n # not end or start if it is a trail but fine\r\n pass\r\n elif net_deg == -1:\r\n # can be end if start doesn't already exist else impossible\r\n if end:\r\n print(\"NO\")\r\n quit()\r\n else:\r\n end = node\r\n elif net_deg == 1:\r\n # can be start if start doesn't already exist else impossible\r\n if start:\r\n print(\"NO\")\r\n quit()\r\n else:\r\n start = node\r\n else:\r\n print(\"NO\")\r\n quit()\r\n\r\nif (start is None) ^ (end is None):\r\n # has a start but no end or end but no start\r\n print(\"NO\")\r\n quit()\r\n\r\nif not start:\r\n start = list(nodes)[0] # arbitrary node\r\n\r\n# do euler circuit or trail\r\neuler_trail = []\r\ns = [start]\r\nwhile s:\r\n if len(adj[s[-1]]):\r\n s.append(adj[s[-1]].pop())\r\n else:\r\n euler_trail.append(s.pop())\r\n\r\nif len(euler_trail) != n+1:\r\n print('NO')\r\n quit()\r\n\r\n# restore original string\r\ns = [euler_trail.pop()]\r\nwhile euler_trail:\r\n node = euler_trail.pop()\r\n s.append(node[-1])\r\n\r\nprint('YES')\r\nprint(''.join(s))" ]

[ "import sys \r\nn, m = map(int, sys.stdin.readline().split())\r\nstr = [sys.stdin.readline() for _ in range(n)]\r\nqw = [[0, 0] for _ in range(m)]\r\nasd = [[0, 0] for _ in range(n)]\r\nfor i in range(n):\r\n for j in range(m):\r\n if str[i][j] != '.':\r\n x = int(str[i][j]) - 1\r\n asd[i][(x < 2) ^ (j & 1)] = 1\r\n qw[j][(x > 0 and x < 3) ^ (i & 1)] = 1\r\nres = 1\r\nfor i in range(n):\r\n res = (res * (2 - asd[i][0] - asd[i][1])) % 1000003\r\nfor i in range(m):\r\n res = (res * (2 - qw[i][0] - qw[i][1])) % 1000003\r\nprint(res)# 1692403576.122683" ]

[ "n,k,l,c,d,p,nl,np = tuple(map(int,input().split()))\r\ndrink = (k*l)//(nl)\r\nslice = c*d\r\nsalt = p//np\r\nprint(min(drink,slice,salt)//n)", "a = list(map(int, input().split()))\r\ntotal_drink = a[1] * a[2]\r\ntotal_slice = a[3] * a[4]\r\ntotal_salt = a[5] // a[7]\r\nprint(min(total_drink//a[6], total_slice, total_salt) // a[0])", "n,k,l,c,d,p,nl,dp = map(int,input().strip().split())\r\ntoasts = (k*l) // nl\r\nlimes = c * d\r\nsalt = p // dp\r\nprint(min(toasts,min(limes,salt)) // n)", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\nres = min(((k*l)//nl), (c*d), (p//np))//n\r\nprint(int(res))", "a,b,c,d,e,f,g,h=map(int,input().split())\nq=b*c\nw=q//g\ne=d*e\nr=f//h\nprint(int(min(w,e,r)/a))\n\n\t\t \t\t \t\t\t\t \t \t \t\t \t \t\t\t \t", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\nDrink = k * l\r\nmaxDrink = Drink // nl\r\nlime = c*d\r\nsalt = p//np\r\nprint(min(maxDrink,lime,salt)//n)", "# -*- coding: utf-8 -*-\r\nl = [int(i) for i in input().split(' ')]\r\npeople = l[0]\r\nv_bottle = l[1]*l[2]\r\nd_lime = l[3]*l[4]\r\nsolt = l[5]\r\nprint(int(min((v_bottle/l[6]/people),(d_lime/people),(solt/l[7]/people))))", "inp = [int(i) for i in input().split()]\nn,k,l,c,d,p,nl,np=inp[0],inp[1],inp[2],inp[3],inp[4],inp[5],inp[6],inp[7]\nprint(min(k*l//nl,c*d, p//np)//n)\n", "z=[int(i) for i in input().split()]\r\nn=z[0]\r\nk=z[1]\r\nl=z[2]\r\nc=z[3]\r\nd=z[4]\r\np=z[5]\r\nnl=z[6]\r\nnp=z[7]\r\nt=(k*l)//nl\r\nslic=c*d\r\nsalt=p//np\r\nprint(min(t,slic,salt)//n)", "n,k,l,c,d,p,nl,np = tuple(map(int,input().strip(\" \").split(\" \")))\r\n\r\nklbynl = (k*l)/nl\r\n\r\ncd = c * d\r\n\r\nnpl = p / np\r\n\r\nprint(int(min(klbynl,cd,npl)/n))", "n, k, l, c, d, p, nl, np = [int(p) for p in input(\"\").split()]\r\nbruh = (k*l) // nl\r\nlmao = p / np\r\nmomen = c*d\r\nprint(int(min(bruh, lmao, momen) // n))\r\n", "import math\r\nn, k, l, c, d, p, nl, np=[int(x) for x in input().split()]\r\nprint(int(min(math.floor(k*l/nl),c*d,math.floor(p/np))/n))", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\nml_drink = k*l/n\r\nlime_slice = c*d\r\nsal = p/n\r\nif (ml_drink < nl) or (lime_slice < n) or (sal<np) :\r\n print(0)\r\nelse :\r\n nb = ml_drink/nl\r\n print(int(min(nb,lime_slice/n,sal/np)))", "n, k, l, c, d, p, nl, np = map(int,input().split())\r\ntotal_drink = k*l\r\ntotal_slice = c*d\r\ntotal_salt = p\r\ntoasts = 0\r\n\r\nwhile(total_slice>=n and total_salt>=n*np and total_drink>=n*nl):\r\n toasts+=1\r\n total_slice-=n\r\n total_salt-=n*np\r\n total_drink-=n*nl\r\n\r\n \r\nprint(toasts)\r\n\r\n\r\n", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\nprint(min((k*l)//nl,(c*d),p//np)//n)", "n, k, l, c, d, p, nl, np=map(int,input().split())\r\nres=min(k*l//nl,c*d,p//np)\r\nprint(res//n)", "import sys\r\n\r\nn, k, l, c, d, p, nl, np = map(int, sys.stdin.readline().split())\r\nc = c * d\r\np = p // np\r\nk = k * l // nl\r\nprint(min(c, p, k) // n)", "l = list(map(int, input().split()))\r\ndrink = l[1]*l[2]\r\nlime = l[3]*l[4]\r\nsalt = l[5]\r\nmin_drink = drink//l[6]\r\nmin_salt = salt//l[7]\r\ntoast = min(lime, min_drink, min_salt)\r\nprint(toast//l[0])", "import math\r\nfrom sys import stdin\r\ninput = stdin.readline\r\n# for _ in range(int(input())):\r\nn, k, l, c, d, p, nl, np = [int(i) for i in input().split()]\r\n\r\nmn = min(k*l//nl, c*d, p//np)\r\n\r\nprint(mn//n)\r\n \r\n\r\n", "n,k,l,c,d,p,nl,np = list(map(int,input().split()))\r\n\r\nk = k*l\r\n\r\nx = (c*d) # final amount of lime slice\r\nx = x//n\r\n\r\ny = (k//nl) #final amount of drink\r\ny = y//n\r\n\r\nz = (p//np) #final amount of salt\r\nz = z//n\r\n\r\nprint(min(x,y,z))\r\n", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\nm = min((k*l)//nl, c*d, p//np)\r\nprint(m//n)", "n, k, l, c, d, p, nl, np = list(map(int, input().split(\" \")))\r\nprint(int((min(c*d,k*l//nl,p/np)//n)))", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\nDRINK = (k * l) // nl\r\nLIMES = c * d\r\nSALT = p // np\r\nprint(min(DRINK, LIMES, SALT) // n)", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\ndrink = k*l \r\ntoast_d = drink//nl\r\ntoast_c = c*d // 1\r\ntoast_s = p // np \r\n\r\nans = min(toast_d, toast_c, toast_s)//n \r\nprint(ans)", "line=input().split()\r\nline=list(map(int,line))\r\nn,k,l,c,d,p,nl,np=line[0],line[1],line[2],line[3],line[4],line[5],line[6],line[7]\r\ndrink=(k*l)/nl\r\nlime=(c*d)\r\nsalt=(p/np)\r\nvalue=min(drink,lime,salt)/n\r\nprint(int(value))", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\nm=min((k*l)//nl,c*d)\r\nm=min(m,p//np)\r\nprint(m//n)", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\ndrinks = (k * l) // nl\r\nlimes = c * d\r\nsalt = p // np\r\n\r\ntoasts = min(drinks, limes, salt)\r\nanswer = toasts // n\r\n\r\nprint(answer)\r\n", "inp = input()\r\narr = [int(item) for item in inp.split(\" \")]\r\n# print(arr)\r\nn, k, l, c, d, p, nl, np = arr\r\nans = min(min(int((k*l)/nl), c*d), int(p/np))\r\nprint(int(ans/n))\r\n", "myList = [int(x) for x in input().split()]\r\nn = myList[0]\r\nk = myList[1]\r\nl = myList[2]\r\nc = myList[3]\r\nd = myList[4]\r\np = myList[5]\r\nnl = myList[6]\r\nnp = myList[7]\r\n\r\ndrink = (k * l) // nl\r\nlime = (c * d)\r\nsalt = p // np\r\nminVal = min(drink, lime, salt)\r\nresult = minVal // n\r\nprint(result)", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\nml=(k*l)/nl\r\nlim=c*d\r\nsalt=p/np\r\nprint(int(min(ml,lim,salt)/n))", "\"\"\"\nn friends\nk bottles l milliliters\nc limes d slices\np grams\neach\n nl milliliters\n np grams\n\n\"\"\"\n# 3 4 5 10 8 100 3 1\nn, k, l, c, d, p, nl, np = map(int, input().split())\nmls = int(k*l/nl)\nlsm = int(c*d)\npp = int(p/np)\nprint(int(min(mls, lsm, pp)/n))\n", "n,k,l,c,d,p,nl,np = map(int,input().split())\r\ndrink = (k*l) // nl\r\nlime = c*d\r\nsalt = p//np\r\nprint(min(drink,lime,salt)//n)", "n,k,l,c,d,p,nl,np = map(int,input().split())\r\nvsego_ml = k*l\r\nvsego_dol = c*d\r\nkol_tost = min(vsego_ml/nl/n,vsego_dol/n,p/np/n)\r\nprint(round(kol_tost//1))\r\n", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\nmax_toasts_drink = (k * l) // nl\r\nmax_toasts_lime = (c * d) // 1\r\nmax_toasts_salt = p // np\r\n\r\nmax_toasts = min(max_toasts_drink, max_toasts_lime, max_toasts_salt)\r\ntoasts_per_friend = max_toasts // n\r\n\r\nprint(toasts_per_friend)\r\n", "n,k,l,c,d,p,nl,ml = map(int,input().split())\r\ns = (k * l) // nl \r\nm = c * d \r\nr = p//ml \r\nprint(min(s,m,r)//n)", "n, k, l, c, d, p, nl, np = map(int, input().split(' '))\r\n\r\n\r\nng = k * l // nl\r\n\r\nnlaim = c * d \r\n\r\ns = p // np\r\n\r\nprint(int(min(ng, nlaim, s) / n))\r\n", "n, k, l, c, d, p, nl, np = map(int,input().split())\r\n\r\ndrink=(k*l)//nl\r\nlime=c*d\r\nsalt=p//np\r\ntemp=min(drink,lime,salt)\r\nprint(temp//n)", "ar = [int(i) for i in input().split()]\n\nn = ar[0]\nnl = ar[6]\nnp = ar[7]\nsoft_drink = (ar[1]*ar[2]) // nl\nlimes = ar[3]*ar[4]\nsalt = ar[5] // np\n\nans = min(soft_drink, min(limes, salt)) // n\n\nprint(ans)\n", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\nprint(min(min(k*l//nl,c*d),p//np)//n)", "\nn,k,l,c,d,p,nl,np = map(int,input().split())\na = (k * l) / nl\naa = p / np\naaa = c * d\nans = min(a, min(aa, aaa)) / n\n\nprint(int(ans))\n\t\t \t \t\t\t\t \t\t\t \t\t\t\t\t \t", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\nprint(min((k*l)//(n*nl), p//(n*np), c*d//n))", "n,k,l,c,d,p,nl,np=map(int, input().split())\r\nx=k*l\r\nf=x//nl\r\ne=c*d\r\ny=p//np\r\nprint(min(f,e,y)//n)\r\n", "n, k, l, c, d, p, nl, np=map(int,input().split())\r\ntoast=(k*l)//nl \r\nlimes=c*d \r\nsalt=p//np\r\nprint(min(toast,limes,salt)//n)", "l=list(map(int,input().split()))\r\nm=[(l[1]*l[2])//l[6],l[3]*l[4],l[5]//l[7]]\r\n#print(m)\r\nprint(min(m)//l[0])", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\nprint(int(min(k*l//nl,c*d,p//np)/n))", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\n \r\ntotal_ml = k * l\r\ntotal_slices = c * d\r\n \r\ndrinks_counter = total_ml // nl\r\nsalt_counter = p // np\r\n \r\nprint(int(min(drinks_counter, salt_counter, total_slices)/n))", "n, k, l, c, d, p, nl, np=map(int,input().split(\" \"))\r\nprint(min(k*l//(nl*n),c*d//n,p//(np*n)))", "mas = list(map(int, input().split()))\r\nprint(min(mas[1]*mas[2]//mas[0]//mas[6], mas[5]//mas[0]//mas[7], mas[3]*mas[4]//mas[0]))", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\n# Calculate the maximum number of toasts based on bottles, limes, and salt\r\nmax_toasts_bottles = (k * l) // (n * nl)\r\nmax_toasts_limes = (c * d) // n\r\nmax_toasts_salt = p // (n * np)\r\n\r\n# Calculate the minimum of the three maximums\r\nmax_toasts = min(max_toasts_bottles, max_toasts_limes, max_toasts_salt)\r\n\r\n# Print the maximum number of toasts each friend can make\r\nprint(max_toasts)\r\n", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\nmd = (k * l) // (n * nl)\r\nml= (c * d) // n\r\nms = p // (n * np)\r\n\r\nmt = min(md, ml, ms)\r\nprint(mt)\r\n", "q, w, e, r, t, y, u, i = map(int, input().split())\r\nw = w * e\r\nr = r * t\r\nw //= u\r\ny //= i\r\nprint(min(w, y, r) // q)", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\ntoasts_with_drink = (k * l) // (n * nl)\r\ntoasts_with_lime = (c * d) // n\r\ntoasts_with_salt = p // (n * np)\r\n\r\nmax_toasts = min(toasts_with_drink, toasts_with_lime, toasts_with_salt)\r\n\r\nprint(max_toasts)\r\n", "n,k,l,c,d,p,nl,np=input().split()\nn,k,l,c,d,p,nl,np=int(n),int(k),int(l),int(c),int(d),int(p),int(nl),int(np)\ntd=k*l\nts=c*d\nx=td//(n*nl)\ny=ts//(n)\nz=p//(n*np)\nt=min(x,y,z)\nprint(t)\n\n\n\n\n\n", "# Read input values\r\nn, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\n# Calculate the total milliliters of the drink, slices of lime, and grams of salt available\r\ntotal_milliliters = k * l\r\ntotal_slices = c * d\r\ntotal_salt = p\r\n\r\n# Calculate the number of toasts each friend can make\r\ntoasts_drink = total_milliliters // (n * nl)\r\ntoasts_lime = total_slices // (n)\r\ntoasts_salt = total_salt // (n * np)\r\n\r\n# Find the minimum number of toasts possible\r\nmin_toasts = min(toasts_drink, toasts_lime, toasts_salt)\r\n\r\n# Print the result\r\nprint(min_toasts)\r\n", "(n,k,l,c,d,p,nl,np)=map(int,input().split())\r\ntoast1=(k*l)//nl\r\ntoast2=(c*d)\r\ntoast3=(p)//np\r\nprint(min(toast1,toast2,toast3)//n)\r\n\r\n\r\n\r\n", "n, k, l, c, d, p, nl, np = map(int,input().split())\r\nt1 = k*l\r\nt1 = int(t1/nl)\r\nt2 = c*d\r\nt3 = int(p/np)\r\nres = min(t1,t2,t3)\r\nprint(int(res/n))", "def drinking(n, k, l, c, d, p, nl, np):\r\n total_drink_volume = k*l\r\n total_lime_slice = c*d\r\n drink_per_person = total_drink_volume//n\r\n lime_per_person = total_lime_slice//n\r\n salt_per_person = p//n\r\n lst = [drink_per_person//nl, lime_per_person, salt_per_person//np]\r\n return min(lst)\r\n\r\nif __name__ == \"__main__\":\r\n n, k, l, c, d, p, nl, np = map(int, input().split())\r\n print(drinking(n, k, l, c, d, p, nl, np))", "n,k,l,c,d,p,nl,np = input().split()\r\nn,k,l,c,d,p,nl,np = int(n),int(k),int(l),int(c),int(d),int(p),int(nl),int(np)\r\nmili = k*l\r\nlime = c*d\r\ncheers = 0\r\nwhile True:\r\n p-=n*np\r\n mili-=n*nl\r\n lime -= n\r\n if p<0 or mili<0 or lime<0:\r\n break\r\n else:\r\n cheers+=1\r\nprint(cheers)", "n,k,l,c,d,p,nl,np = map(int,input().split())\r\nq = 0\r\nkl = k*l\r\ncd = c*d\r\nkl = (kl/nl)\r\np = (p/np)\r\nprint(int(min(kl,cd,p))//n)", "n,k,l,c,d,p,nl,np = map(int,input().split())\r\nkl=k*l\r\ncd=c*d\r\nprint(min(kl//nl,cd,p//np)//n)\r\n", "n,k,l,c,d,p,nl,np = map(int,input().split())\r\ndrink = k*l\r\nslices= d*c\r\nmin_a = min(drink//nl,slices,p//np)\r\nprint(min_a//n)", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\ningredients = []\r\ningredients.append(n)\r\ningredients.append(k)\r\ningredients.append(l)\r\ningredients.append(c)\r\ningredients.append(d)\r\ningredients.append(p)\r\ningredients.append(nl)\r\ningredients.append(np)\r\ntotal = 0\r\ntotalSlices = ingredients[3] * ingredients[4] # 19\r\ntotalSalt = int(ingredients[5] / np) # 90\r\ntotalMlDrink = int((ingredients[1] * ingredients[2]) / nl) # 1000\r\n# 3gm of salt 4 ml of drink 1 slice of lime\r\nif totalSlices <= totalSalt and totalSlices <= totalMlDrink:\r\n total = int(totalSlices / n)\r\n\r\nelif totalMlDrink <= totalSalt and totalMlDrink <= totalSlices:\r\n total = int(totalMlDrink / n)\r\n\r\nelse:\r\n total = int(totalSalt / n)\r\n\r\nprint(total)", "t=input(\"\")\r\nl=t.split(\" \")\r\ns=[]\r\nfor i in l:\r\n s.append(int(i))\r\na=(s[1]*s[2])//s[-2]\r\nb=(s[3]*s[4])\r\nc=s[-3]//s[-1]\r\nprint(min(a,b,c)//s[0])", "m=list(map(int,input().split()))\r\na=m[1]*m[2]//m[-2]\r\nb=m[3]*m[4]\r\nc=m[-3]//m[-1]\r\nprint(min(a,b,c)//m[0])\r\n", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\nres1 = int((k*l)/nl)\r\nres2 = int(c*d)\r\nres3 = int(p/np)\r\n\r\nmin_toast = min(res2, res3, res1)\r\n\r\nprint(int(min_toast/n) if min_toast >= n else 0)", "m = list(map(int, input().split(\" \")))\r\nn = m[0] \r\nk = m[1] \r\nl = m[2] \r\nc = m[3] \r\nd = m[4] \r\np = m[5] \r\nnl = m[6] \r\nnp = m[7]\r\n\r\ndrink = int((k*l)/nl)\r\nlimes = c*d\r\nsalt = int(p/np)\r\n\r\nans = int((min(drink,limes,salt)/n))\r\nprint(ans)", "import sys\r\nimport math\r\ninput = sys.stdin.readline\r\n\r\nif __name__ == '__main__':\r\n n, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\n print(min(l * k // (n * nl), c * d // n, p // (n * np)))", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\ntoast_per_friend = min((k * l) // (n * nl), (c * d) // n, p // (n * np))\r\nprint(toast_per_friend)", "N,K,l,c,d,p,nl,np=map(int,input().split())\r\n\r\ne=(K*l)//nl\r\nf=c*d\r\ng=p//np\r\nx=min(e,g)\r\n\r\nprint(min(x,f)//N)", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Mon Sep 18 09:41:41 2023\n\n@author: huangxiaoyuan\n\"\"\"\nn,k,l,c,d,p,nl,np=map(int, input().split())\nif max(n,k,l,c,d,p,nl,np)<=1000 and min(n,k,l,c,d,p,nl,np)>=1:\n a1=(k*l-(k*l)%nl)/nl\n a2=c*d\n a3=(p-p%np)/np\n a4=min(a1, a2, a3)\n a5=(a4-a4%n)/n\nprint(int(a5))\n ", "b = input()\r\na = b.split()\r\nn = int(a[0])\r\nk = int(a[1])\r\nl = int(a[2])\r\nc = int(a[3])\r\nd = int(a[4])\r\np = int(a[5])\r\nnl = int(a[6])\r\nnp = int(a[7])\r\ne = []\r\ne.append(k*l/nl)\r\ne.append(c*d)\r\ne.append(p/np)\r\nh = min(e)//n\r\nprint(int(h))", "n,k,l,c,d,p,n1,np=map(int,input().split())\r\nprint(min(min((k*l)//n1,c*d),p//np)//n)", "# LUOGU_RID: 113642709\na,b,c,d,e,f,g,h=list(map(int,input().split()));print(min(min(b*c//g,d*e),f//h)//a)", "n, k, l, c, d, p, nl, np = map(int,input().split())\r\n# friends = (k*l)//nl\r\n# limes = (c*d)//n\r\n# salt = p//(np*n)\r\nprint( min(min(k * l // nl, c * d), p // np) // n)", "n, k, l, c, d, p, nl, np = map(int, input(\"\").split())\r\n\r\n# calculate total amount of drink, lime slices, and salt\r\ntotal_drink = k * l\r\ntotal_lime = c * d\r\n\r\n# calculate the number of toasts each friend can make\r\ntoasts = min(total_drink // (nl * n), total_lime // n, p // (np * n))\r\n\r\nprint(toasts)\r\n", "l = list(map(int, input().split()))\r\n\r\njuice = (l[1]*l[2])//l[6]\r\npeice = l[3]*l[4]\r\nsalts = l[5]//l[7]\r\n\r\nprint(min(juice, peice, salts)//l[0])", "n,k,l,c,d,p,nl,np = map(int,input().split())\r\ns = k*l\r\nprint(int(min(s/nl,c*d,p/np)/n))", "#a = int(input())\r\nn, k, l, c, d, p, nl, np = map(int, input().split())\r\nt1 = int((k*l)/nl)\r\nt2 = c*d\r\nt3 = int(p/np)\r\nprint(int(min(t1,t2,t3)/n))", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\n# Calculate how many toasts each friend can make based on available ingredients\r\ntoasts_with_drink = (k * l) // (n * nl)\r\ntoasts_with_lime = (c * d) // n\r\ntoasts_with_salt = p // (n * np)\r\n\r\n# Find the minimum of the three values\r\nresult = min(toasts_with_drink, toasts_with_lime, toasts_with_salt)\r\nprint(result)\r\n", "import math\nn,k,l,c,d,p,nl,np=map(int, input().split())\ns=math.floor(c*d)\nm=math.floor(k*l/nl)\no=math.floor(p/np)\nprint(math.floor(min(s,m,o)/n))\n \t\t\t \t\t\t\t \t\t\t\t\t \t \t", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\ndrink_toast = (k * l) / nl\r\nlime_toast = c * d\r\nsalt_toast = p / np\r\n\r\nprint(int(min(drink_toast, lime_toast, salt_toast) / n))", "n, k, l, c, d, p, nl, np = list(map(int, input().split(' ')))\r\n\r\ntotal_mililiters = k * l\r\ntotal_lime_slices = c * d\r\n\r\ntoasts = min(total_mililiters // (n * nl), total_lime_slices // n, p // (n * np))\r\n\r\nprint(toasts)", "n,k,l,c,d,p,nl,np=input().split(' ')\r\nn=int(n)\r\nk=int(k)\r\nl=int(l)\r\nc=int(c)\r\nd=int(d)\r\np=int(p)\r\nnl=int(nl)\r\nnp=int(np)\r\nr1=(k*l)//nl\r\nr2=c*d\r\nr3=p//np\r\nprint(min(r1,r2,r3)//n)\r\n", "import math\r\ndef number():\r\n return(list(map(int,input().split())))\r\ndef strinp():\r\n return(list(input().split()))\r\n\r\n\r\nc=0\r\nsum=0\r\ni=0\r\nnn=number()\r\nn=nn[0]\r\nk=nn[1]\r\nl=nn[2]\r\nc=nn[3]\r\nd=nn[4]\r\np=nn[5]\r\nnl=nn[6]\r\nnp=nn[7]\r\nlim=[0,0,0]\r\nlim[0]=((k*l)//(n*nl))\r\nlim[1]=((p)//(n*np))\r\nlim[2]=((c*d)//n)\r\nmmm=min(lim)\r\nprint(mmm)", "n, k, l, c, d, p, nl, np = map(int, input().split(\" \"))\r\ntotal_soft = k*l/nl\r\ntotal_lime = c*d\r\ntotal_slt = p/np\r\nprint(int(min(total_soft, total_lime, total_slt)/n))\r\n", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\nmax_drink = (k * l) // (n * nl)\r\nmax_limes = c * d // n\r\nmax_salt = p // (n * np)\r\nmax_toasts = min(max_drink, max_limes, max_salt)\r\nprint(max_toasts)\r\n", "n, k, l, c, d, p, nl, np = map(int,input().split())\r\nprint(min(k*l//nl,p//np,c*d)//n)", "def main():\n n, k, l, c, d, p, nl, np = [int(i) for i in input().split()]\n n1 = k * l // nl\n n2 = c * d\n n3 = p // np\n print(min(n1, n2, n3) // n)\n\nif __name__ == \"__main__\":\n main()\n", "list = input().split()\r\nnumOfMil = int(list[1]) * int(list[2])\r\nmaxShot = numOfMil / int(list[6])\r\nnumOflime = int(list[3]) * int(list[4])\r\nnumOfSaltGrams = int(list[5]) / int(list[7])\r\nprint(int(min(maxShot, numOflime, numOfSaltGrams) / int(list[0])))", "nums = str(input())\r\nlists = nums.split(\" \")\r\nn = int(lists[0])\r\nk = int(lists[1])\r\nl = int(lists[2])\r\nc = int(lists[3])\r\nd = int(lists[4])\r\np = int(lists[5])\r\nnl = int(lists[6])\r\nnp = int(lists[7])\r\n\r\na = (k*l)//(nl*n)\r\nb = (c*d)//(n)\r\nc = (p) // (np*n)\r\n\r\nprint(min(a,b,c))", "import math\r\n\r\nn, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\nml_of_drink = k * l #1\r\nno_of_toasts = ml_of_drink // nl #2\r\nlimes_for_toasts = c * d #3\r\nsalt_for_toasts = p // np #4\r\n\r\nToasts = min(no_of_toasts, limes_for_toasts, salt_for_toasts) / n\r\n\r\nToasts = math.floor(Toasts)\r\n\r\nprint(Toasts)", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\ngas = k * l // (n * nl)\r\nlime = c * d // n\r\nsalt = p // (n * np)\r\ntoasts = min(gas, lime, salt)\r\nprint(toasts)", "import math\r\nn, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\nmillie_toasts = math.floor((k*l) / nl)\r\nmillie_limes = c * d\r\nmille_salt = p / np\r\n\r\n\r\nprint(math.floor(min(mille_salt,millie_limes,millie_toasts)/n))", "n , k , l , c , d , p , nl , np = list(map(int , input().split()))\r\nprint(min((k * l) // (n * nl) , (c * d) // n , p // (n * np)))", "\r\none, two, three, four, five, sex, seve, eight = map(int, input().split())\r\n\r\nresult1 = int(two*three)\r\nresult11 = result1/seve\r\nresult2 = int(four*five)\r\nresult3 = int(sex/eight)\r\noutput = min(int(result11)/one, int(result2)/one, int(result3)/one)\r\nprint(int(output))\r\n", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\ndrink_ml = k * l\r\nlimes = c * d\r\nsalt = p\r\n\r\nmax_drinks = min(drink_ml // nl, limes, salt // np) // n\r\n\r\nprint(max_drinks)", "n,k,l,c,d,salt,nl,np = map(int,input().split())\r\ndrink = ((k*l)//n)//nl\r\nlime = (c*d)//n\r\nsalt = (salt//n)//np\r\nprint(min(drink,salt,lime))", "n, k, l, c, d, p, nl, np = [int(x) for x in input().split()]\r\ncou = 0\r\nkl = n*nl; cd = n; nnp = n*np\r\nwhile kl <= k*l and cd <= c*d and nnp <= p:\r\n kl += n*nl; cd += n; nnp += n*np\r\n cou += 1\r\nprint(cou)", "n, k, l, c, d, p, nl, np = map(int,input().split())\r\nxl = k*l//nl\r\nxd = c*d\r\nxp = p//np\r\nprint(min(xl,xd,xp)//n)", "#https://codeforces.com/problemset/problem/151/A\r\n\r\n(n, k, l, c, d, p, nl, np) = (int(x) for x in input().split(\" \"))\r\ntotal_drink, total_limes, total_salt = k*l, c*d, p\r\nprint(min([total_drink//(n*nl), total_limes//n, total_salt//(n*np)]))", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\na=(k*l)//nl\r\nb=c*d\r\ne=p//np\r\nprint(min(a,b,e)//n)", "ingredients = list(map(int,input().split()))\r\ndrink = ingredients[1]*ingredients[2]//ingredients[-2]\r\nslices = ingredients[3]*ingredients[4]\r\nsalt = ingredients[-3]//ingredients[-1]\r\nminIngredient = min(drink,slices,salt)\r\nprint(minIngredient//ingredients[0])\r\n", "str1 = input().split()\r\nstr1 =[int(x) for x in str1]\r\nn1 = ((str1[1]*str1[2])//str1[0])//str1[6]\r\nn2 = (str1[3]*str1[4])//str1[0]\r\nn3 = (str1[5]//str1[0])//str1[7]\r\nlest = [n1,n2,n3]\r\nprint(min(lest))", "a,b,c,d,e,f,g,h=map(int,input().split())\r\nk=(b*c)//g\r\nq=(d*e)\r\nm=f//h\r\nprint(min(k,q,m)//a)", "n, k, l, c, d, p, nl, np = list(map(int,input().split()))\r\n\r\nTL = k*l\r\nTL_E = TL//nl\r\nTS_E = p//np\r\nTS = c*d\r\nNT = min(TS,TL_E,TS_E)//n\r\nprint(NT)\r\n\r\n", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\na1 = k * l // nl\r\na2 = c * d\r\na3 = p // np\r\nprint(min(a1, a2, a3) // n)\r\n", "a = input().split()\r\nn = int(a[0])\r\nk = int(a[1])\r\nl = int(a[2])\r\nc = int(a[3])\r\nd = int(a[4])\r\np = int(a[5])\r\nnl = int(a[6])\r\nnp = int(a[7])\r\nx = k*l//nl\r\ny = c*d\r\nz = p//np\r\nif x < y and x < z:\r\n print(x//n)\r\nelif y < z and y < x:\r\n print(y//n)\r\nelse:\r\n print(z//n)", "\r\nn, k, l, c, d, p, nl, np = [int(x) for x in input().split()]\r\ntotalMlPerToast = (k*l) // nl\r\ntotalLimesPerToast = c*d\r\ntotalGramsPerToast = p // np\r\nprint(min(totalMlPerToast, totalLimesPerToast, totalGramsPerToast) // n)\r\n\r\n\r\n \r\n\r\n", "def main():\r\n n, k, l, c, d, p, nl, np = list(map(int, input().split()))\r\n stock = []\r\n stock.append(k*l)\r\n stock.append(c*d)\r\n stock.append(p)\r\n \r\n # print(stock)\r\n requirement = []\r\n requirement.append(nl)\r\n requirement.append(1)\r\n requirement.append(np)\r\n # print(requirement)\r\n zipped = zip(stock,requirement)\r\n \r\n result = []\r\n for i in zipped:\r\n result.append(i[0]//i[1])\r\n # print(result)\r\n print(min(result)//n)\r\n \r\nmain()", "j=lambda:map(int , input().split())\r\nk=(list(j()));print(int(min(k[1]*k[2]/k[-2] ,k[3]*k[4] , k[5]/k[-1])/k[0]))", "n, k, l, c, d, p, nl, np = list(map(int, input().split()))\r\nlitrage = (k * l) // nl\r\ndolki = c * d\r\nsol = p // np\r\nprint(min(litrage, dolki, sol) // n)", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\nx=(k*l)//nl\r\ny=c*d\r\nz=p//np\r\nprint(min(x,y,z)//n)", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\ndrink_quantity = k * l # Available quantity of the drink\r\nlime_slices = c * d # Number of lime slices\r\nsalt_amount = p # Amount of salt\r\n\r\ntoasts_drink = drink_quantity // nl # Maximum number of toasts based on the drink quantity\r\ntoasts_lime = lime_slices // 1 # Maximum number of toasts based on the lime slices\r\ntoasts_salt = salt_amount // np # Maximum number of toasts based on the salt amount\r\n\r\nmax_toasts = min(toasts_drink, toasts_lime, toasts_salt) # Minimum value among the three factors\r\n\r\nresult = max_toasts // n # Number of toasts each friend can make\r\n\r\nprint(result)", "n, k, l, c, d, p, nl, np = map(int,input().split())\r\na = (k*l)//nl\r\nb = c*d\r\nz = p//np\r\nfinal = min(a,b,z)//n\r\nprint(final)", "n, k, l, c, d, p, nl, np = map(int, input().split(\" \"))\r\nml = k * l\r\nlime = c * d\r\nsoda = ml / nl\r\nsalt = p / np\r\nlis = [lime, soda, salt]\r\nlis = sorted(lis)\r\ntoast = int(lis[0]//n)\r\nprint(toast)", "def calculate_toasts(n, k, l, c, d, p, nl, np):\n total_drink = k * l # Total milliliters of the drink available\n total_limes = c * d # Total slices of lime available\n\n # Calculate how many toasts each friend can make\n max_toasts_drink = total_drink // (n * nl)\n max_toasts_lime = total_limes // n\n max_toasts_salt = p // (n * np)\n\n # Return the minimum of the three calculations\n return min(max_toasts_drink, max_toasts_lime, max_toasts_salt)\n\n# Input: Parse the input string into individual integers\ninput_str = input()\nn, k, l, c, d, p, nl, np = map(int, input_str.split())\n\n# Calculate and output the result\ntoasts_per_friend = calculate_toasts(n, k, l, c, d, p, nl, np)\nprint(toasts_per_friend)\n", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\nd_toasts = (k*l)//nl\r\nl_toasts = c*d\r\ns_toasts = p//np\r\nprint(min(d_toasts, l_toasts, s_toasts)//n)", "# Accepted Bug #\r\n\r\nperson,bottel,liter,lime,slices,salt,nl,np = map(int,input().split())\r\n\r\ndrink = bottel * liter #20\r\nn_drink = drink / nl #20\r\nnum_lime = lime * slices #15\r\nsalt /= np #10\r\nans = min(num_lime,n_drink,salt) / person\r\nprint(int(ans))", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\na=(k*l)// nl\r\nb=c*d\r\nw=p//np\r\nprint(min(a,b,w)//n)", "n,k,l,c,d,p,nl,np=tuple(map(int,input().split()))\r\nobiem=(k*l)//nl\r\nlime=c*d\r\nsalt=p//np\r\ncount=min(obiem//n,lime//n,salt//n)\r\nprint(count)\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "a,b,c,d,e,f,g,h=map(int,input().split())\r\nl=[]\r\nl.append((b*c)//g)\r\nl.append(d*e)\r\nl.append(f//h)\r\nx=min(l)\r\nprint(x//a)\r\n", "n,k,l,c,d,p,nl,np = [int(i) for i in input().split()]\r\n\r\ncountBasedOnLiquid = (k * l) // nl\r\ncountBasedOnLime = c * d\r\ncountBasedOnSalt = p // np\r\n\r\nprint (min(countBasedOnLiquid,countBasedOnLime,countBasedOnSalt) // n)\r\n", "# ◇─◇────────────────────────────────────────◇─◇\r\nimport os\r\nimport atexit\r\nfrom io import BytesIO\r\nfrom sys import stdin\r\n_output = BytesIO()\r\n_readline = stdin.readline\r\n_write = _output.write\r\n_output.write = lambda *args: (_write(b' '.join(map(lambda s: str(s).encode(), args))), _write(b'\\n'))\r\natexit.register(lambda: os.write(1, _output.getvalue()))\r\nprint = _output.write\r\ninput = lambda: _readline().rstrip('\\r\\n')\r\nread = lambda: input()\r\nread_int = lambda: int(input())\r\nread_ints = lambda: [int(_) for _ in input().split()]\r\n# ◇─◇────────────────────────────────────────◇─◇\r\n\r\n\r\ndef solve():\r\n n, k, l, c, d, p, nl, np = read_ints()\r\n res = min(\r\n c * d,\r\n p // np,\r\n k * l // nl,\r\n )\r\n res //= n\r\n return res\r\n\r\n\r\nprint(solve())", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\ntoast = []\r\n\r\ntoast.append((k * l) // nl)\r\n\r\ntoast.append(c * d)\r\n\r\ntoast.append(p // np)\r\n\r\nprint(min(toast) // n)\r\n", "def SoftDrink(n, k, l, c, d, p, nl, np):\r\n\r\n x = min((int(k * l) / nl), (c * d) , (int(p / np)))\r\n\r\n return int(x / n)\r\n\r\nn, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\nprint(SoftDrink(n, k, l, c, d, p, nl, np))", "n, k, l, c, d, p, nl, np = map(int,input().split())\r\n\r\nlemonade = k*l/nl\r\nlime = c*d\r\nsalt = p/np\r\n\r\nprint(int(min(lemonade,lime,salt)//n))", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\ndrink_ml = k*l\r\nlime_slices = c*d\r\ntotal_toasts = min(drink_ml // nl, lime_slices, p // np)\r\n\r\nprint(total_toasts // n)\r\n", "import math\r\n\r\nif __name__=='__main__':\r\n line = input()\r\n elements = line.split(\" \")\r\n n = int(elements[0])\r\n k = int(elements[1])\r\n l = int(elements[2])\r\n c = int(elements[3])\r\n d = int(elements[4])\r\n tot_p = int(elements[5])\r\n nl = int(elements[6])\r\n np = int(elements[7])\r\n \r\n tot_l = k*l\r\n tot_slice = c*d\r\n \r\n each_toast_l = n*nl\r\n each_toast_salt = n*np\r\n each_toast_lime = n\r\n \r\n # print(tot_l, each_toast_l, math.floor(tot_l/each_toast_l))\r\n # print(tot_p, each_toast_salt, math.floor(tot_p/each_toast_salt))\r\n # print(tot_slice, each_toast_lime, math.floor(tot_slice/each_toast_lime))\r\n \r\n print(min(math.floor(tot_l/each_toast_l), math.floor(tot_p/each_toast_salt), math.floor(tot_slice/each_toast_lime)))", "s = input()\r\nn, k, l, c, d, p, nl, np = [int(i) for i in s.split(\" \")]\r\n\r\n\r\nprint(min(p // (np*n) , (k*l) // (n*nl), (c*d) // n))", "import math\r\n\r\n\r\nn, k, l, c, d, p, nl, np = list(map(int, input().split()))\r\nres = 0\r\n\r\n\r\nmil_drink = math.trunc(k * l)\r\nlimes = math.trunc(c * d)\r\nsalt = math.trunc(p / np)\r\ntoast = math.trunc(mil_drink / nl)\r\n\r\nminim = math.trunc(min(toast, salt, limes)/ n)\r\n\r\nprint(minim)", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\nt1=k*l//nl\r\nt2=c*d\r\nt3=p//np\r\nmn=min(t1,t2,t3)\r\nprint(mn//n)", "(n,k,l,c,d,p,nl,np)=map(int,input().split(' '))\r\na =((k*l)//nl)//n\r\nb=(c*d)//n\r\nc=(p//np)//n\r\nprint(min(a,b,c))", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\nprint(int(min((k*l/n)//nl,(c*d//n),(p/n)//np)))\r\n", "\r\ndef solve():\r\n n, k, l, c, d, p, nl, np = map(int, input().split())\r\n mililiters = k * l\r\n toasts = mililiters // nl\r\n slices = c * d\r\n salt = p // np\r\n return min(toasts, slices, salt) // n\r\n\r\n\r\nprint(solve())\r\n", "s=input().split()\r\nn=int(s[0])\r\nk=int(s[1])\r\nl=int(s[2])\r\nc=int(s[3])\r\nd=int(s[4])\r\np=int(s[5])\r\nnl=int(s[6])\r\nnp=int(s[7])\r\nv=min(((k*l)//nl),(c*d),(p//np))\r\nprint(v//n)", "a=list(map(int,input().split()))\r\nx=a[1]*a[2]//a[6]\r\ny=a[3]*a[4]\r\nz=a[5]//a[7]\r\nl=[x,y,z]\r\nl.sort()\r\nprint(l[0]//a[0])", "n, k, l, c, d, p, nl, np=map(int,input().split())\r\nkl=k*l\r\ncd=c*d\r\nq=kl//nl\r\nw=p//np\r\nprint(min(q,w,cd)//n)", "n, k, l, c, d, p, nl, np = list(map(int, input().split()))\r\n\r\ntotal_ml = k * l\r\n\r\ntotal_l = c * d\r\n\r\ntoasts = 0\r\n\r\nwhile True:\r\n\r\n if total_ml >= nl and p >= np and total_l > 0:\r\n\r\n toasts += 1 \r\n\r\n total_ml -= nl\r\n p -= np\r\n total_l -= 1\r\n\r\n else:\r\n\r\n print(toasts // n)\r\n break", "n, k, l, c, d, p, nl, np =map(int,input().split())\r\ntotalDrink=k*l\r\ndrinkToast=totalDrink//nl\r\nlimeToast=c*d\r\nsaltToast=p//np\r\nprint((min(drinkToast,saltToast,limeToast))//n)", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\nresult = min(k*l//nl, c*d, p//np) // n\r\nprint(result)", "from math import *\r\nn, k, l, c, d, p, nl, np=map(int,input().split())\r\nlitr=(k*l)/nl\r\nlime=c*d\r\ndorost=p/np\r\nprint(int(min(litr,lime,dorost)/n))\r\n", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\nr=(k*l)//nl\r\nr2=c*d\r\nr3=p//np\r\nprint(min(r,r2,r3)//n)", "#https://codeforces.com/problemset/problem/151/A\r\nn, k, l, c, d, p, nl, np=map(int,input().split())\r\ndrinks=((k*l)//nl)//n\r\nlimes=(c*d)//n\r\nsalt=(p//np)//n\r\n#print(drinks,limes,salt)\r\narr=[]\r\narr.append(drinks)\r\narr.append(limes)\r\narr.append(salt)\r\n\r\nresult=min(arr)\r\nprint(result)", "import math, os, sys\r\nfrom collections import defaultdict\r\nif(os.path.exists('input.txt')):\r\n sys.stdin = open(\"input.txt\",\"r\")\r\n sys.stdout = open(\"output.txt\",\"w\")\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\n# Main code here.\r\ndef solve():\r\n n, k, l, c, d, p, nl, np = map(int, input().split())\r\n r1, r2, r3 = (k*l)//nl, c*d, p//np\r\n res = min(r1, r2, r3) // n\r\n print(res)\r\n\r\n\r\n# for _ in range(int(input())):\r\n# solve()\r\nsolve()\r\n\r\nsys.stdout.close() \r\nsys.stdin.close()", "from collections import deque\r\nimport math\r\nfrom random import randint as rand\r\nfrom functools import lru_cache\r\nimport string\r\nalph_l = string.ascii_lowercase\r\nalph_u = string.ascii_uppercase\r\n\r\n\r\nsimp = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\r\ndef main():\r\n n, k, l, c, d, p, nl, np = list(map(int, input().split()))\r\n gas = k * l\r\n dol = c * d\r\n potr_g = n * nl\r\n potr_s = n * np\r\n potr_d = n\r\n print(min(gas // potr_g, dol // potr_d, p // potr_s))\r\nif __name__ == \"__main__\":\r\n main()", "n, k, l, c, d, p, nl, np = map(int,input().split())\r\ngas = k * l // nl // n\r\nlime = c * d // n\r\nsalt = p // np // n\r\nprint(min(gas, lime, salt))\r\n", "n, k, l, c, d, p, nl, np = map(int, input().split(\" \"))\n\ndrink = (k * l) // nl\nsalt = p / np\nlimes = c * d\n\nprint(int(min(drink, salt, limes) // n))\n\n\n\n", "a=list(map(int,input().split()))\r\nprint(min(((a[1]*a[2])//a[6])//a[0],(a[3]*a[4])//a[0],(a[5]//a[7])//a[0] ))", "p,q,r,s,t,u,v,w=map(int,input().split());\r\nprint(min(q*r//v,s*t,u//w)//p)", "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 in_int():\r\n return int(sys.stdin.readline())\r\n\r\n\r\ndef in_str():\r\n return sys.stdin.readline().rstrip()\r\n\r\n\r\ndef in_map_int():\r\n return map(int, sys.stdin.readline().split())\r\n\r\n\r\ndef in_arr_int():\r\n return list(map(int, sys.stdin.readline().split()))\r\n\r\n\r\ndef in_arr_str():\r\n return sys.stdin.readline().split()\r\n\r\n\r\ndef is_prime(n):\r\n for i in range(2, int(n ** (1/2)) + 1):\r\n if n % i == 0:\r\n return True\r\n return False\r\n\r\n\r\ndef solve(n, k, l, c, d, p, nl, np):\r\n a = (k * l) // nl\r\n b = c * d\r\n c = p // np\r\n return min(a, b, c) // n\r\n\r\n\r\ndef main():\r\n n, k, l, c, d, p, nl, np = in_map_int()\r\n print(solve(n, k, l, c, d, p, nl, np))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n\r\n# трамвай - 1\r\n# n = 38\r\n", "list = [int(i) for i in input().split()]\r\n\r\nn = list[0]\r\nk = list[1]\r\nl = list[2]\r\nc = list[3]\r\nd = list[4]\r\np = list[5]\r\nnl = list[6]\r\nnp = list[7]\r\n\r\nt1 = (k * l) // nl\r\nt2 = c * d\r\nt3 = p // np\r\nprint(min([t1, t2, t3]) // n)", "n, k, l, c, d, p, nl, np=map(int,input().split())\r\nt= k*l//nl\r\nh= c*d\r\ny= p//np\r\nx=min(t,h,y)//n\r\nprint(x)", "amount = input('')\r\namount = amount.split(' ')\r\nn = int(amount[0])\r\ndrink = int(amount[1])*int(amount[2])\r\nlime = int(amount[3])*int(amount[4])\r\nsalt = int(amount[5])\r\nnl = int(amount[6])\r\nnp = int(amount[7])\r\ndt = drink//nl\r\nst = salt//np\r\nprint(min(dt, st, lime)//n)", "num_friend, bottles, mililiters, limes, limes_cuts, \\\r\nsalts_grams, mililiters_per_drink, salt_per_drink = [int(x) for x in input().split()]\r\n\r\nnum_drinks = min(bottles * mililiters // mililiters_per_drink, limes * limes_cuts, salts_grams // salt_per_drink) // num_friend\r\nprint(num_drinks)", "n, k, l, c, d, p, nl, np = map(int,input().split(\" \"))\r\nprint(min((k*l)//nl,c*d,p//np)//n)", "a = input().split()\r\nn, k, l, c, d, p, nl, np = int(a[0]), int(a[1]), int(a[2]), int(a[3]), int(a[4]), int(a[5]), int(a[6]), int(a[7])\r\nprint(int(min([int(c * d), int((k * l) / nl), int(p / np)]) / n))", "from sys import stdin, stdout \r\nfrom math import log2, log10, log, ceil, floor, sqrt\r\n\r\ndef rs(): return stdin.readline().strip()\r\ndef ri(): return int(rs())\r\ndef rn(): return map(int, rs().split())\r\ndef rl(): return list(rn())\r\n\r\ndef solve(): \r\n n, k, l, c, d, p, nl, np = rn()\r\n a = k * l \r\n print(min((d * c) // n, (k * l) // (n * nl), p // (n * np)))\r\n return None\r\n\r\ndef main():\r\n for _ in range(ri()):\r\n solve()\r\n\r\nsolve()\r\n", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\nll=k*l\r\ndd=c*d\r\nprint(min(ll//nl,dd,p//np)//n)", "ind = input().split()\r\nn = int(ind[0])\r\nk = int(ind[1])\r\nl = int(ind[2])\r\nc = int(ind[3])\r\nd = int(ind[4])\r\np = int(ind[5])\r\nnl = int(ind[6])\r\nnp = int(ind[7])\r\n\r\ngas_lim = k * l / nl\r\nlime_lim = c * d\r\nsile_lim = p / np\r\n\r\nprint( int(min(gas_lim,lime_lim,sile_lim) / n))", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\nres1=min(k*l/nl,c*d)\r\nres2=min(res1,p/np)\r\nprint(int(res2/n))", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\nprint(int((min(int(k*l/nl),c*d,int(p/np))/n)))", "#n=number of friends\r\n#k=numbers of bottles\r\n#l=ml for bottles\r\n#c=limes\r\n#d=slices of limes\r\n#p= grams of salt\r\n#friends needs-------------------\r\n#nl, = ml of drinks\r\n# np= grams of salt\r\n#a slice of limes\r\nlistx=list(map(int,input().split(' ')))\r\nn,k,l,c,d,p,nl,np=listx[0],listx[1],listx[2],listx[3],listx[4],listx[5],listx[6],listx[7]\r\nlisty=[]\r\n\r\na=k*l\r\nb=c*d\r\ng=p//np\r\nlisty.append(a//nl)\r\nlisty.append(b)\r\nlisty.append(g)\r\n#print(listy)\r\nfinal_list=[]\r\nfor x in listy:\r\n final_list.append(x//n\r\n )\r\n#sorted(final_list)\r\nprint(sorted(final_list)[0])", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\nml = k*l \r\nlime_slices = c*d\r\nsalt = p\r\nprint(min([ml//nl, lime_slices, salt//np]) //n)", "n, k, l, c, d, p, nl, np = map(int, input().split() )\nif np != 0 and nl != 0:\n number_of_toast = min( (k*l)//nl, p//np, c*d) // n\nelse:number_of_toast = 0\n\nprint(number_of_toast)\n\t \t\t \t\t \t\t\t \t \t\t\t \t \t \t", "def main():\r\n n, k, l, c, d, p, nl, np = map(int, input().split())\r\n total_drink = k * l\r\n total_lime = c * d\r\n total_salt = p\r\n\r\n toasts = min(total_drink // nl, total_lime, total_salt // np)\r\n print(toasts // n)\r\n\r\nif __name__ == '__main__':\r\n main()", "n, k, l, c, d, p, nl, np = map(int,input().split())\r\nprint(min(((k*l)//nl),(c*d),(p//np))//n)", "def number_of_toasts(n, k, l, c, d, p, nl, np):\r\n # Calculate the maximum number of toasts each friend can make\r\n toasts_per_drink = (k * l) // nl\r\n toasts_per_lime = c * d\r\n toasts_per_salt = p // np\r\n\r\n # Find the minimum of the above three quantities\r\n return min(toasts_per_drink, toasts_per_lime, toasts_per_salt) // n\r\n\r\n# Read input values\r\nn, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\n# Call the function and print the result\r\nresult = number_of_toasts(n, k, l, c, d, p, nl, np)\r\nprint(result)\r\n", "a,b,c,d,e,f,g,h=map(int,input().split())\r\nx=min(min((b*c)/g,d*e),f/h)/a\r\nprint(int(x))", "v=list(map(int, input().split()))\r\nr=((v[1]*v[2])//v[6])//v[0];\r\nrx=((v[3]*v[4])//v[0]);\r\nif(rx<r): r=rx;\r\nrx=(v[5]//v[7])//v[0];\r\nif(rx<r): r=rx;\r\nprint(r)", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\nkl=k*l\r\ncd=c*d\r\np=p\r\nm=min(kl/nl,cd/1,p/np)\r\nprint(int(m//n))\r\n", "n, k, l, c, d, p, a, b = map(int, input().split())\r\nprint(min(k * l // a, c * d, p // b) // n)", "n, k, l, c, d, p, nl, np = map(int,input().split())\r\n\r\n\r\nprint(min(k*l//nl//n, c*d//n, p//np//n))\r\n \r\n", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\nprint(min(((k*l)//(n*nl), (c*d)//(n), p//(n*np))))", "x = list(map(int, input().split()))\r\nn, k, l, c, d, p, nl, np = x[0], x[1], x[2], x[3], x[4], x[5], x[6], x[7]\r\nprint(min((k*l)//nl, c*d, p//np)//n)", "v1, v2, v3, v4, v5, v6, v7, v8 = map(int, input().split())\r\n\r\na1 = (v2 * v3) //( v1*v7)\r\na2 = (v4 * v5)//v1\r\na3 = v6 // (v8*v1)\r\n\r\ncc = min(a1,a2,a3) \r\n\r\nprint(cc)\r\n", "n, k, l, c, d, p, nl, np = (int(x) for x in input().split())\r\ndrink_condition = k*l//(n*nl)\r\nlime_condition = c*d//n\r\nsalt_condition = p//(n*np)\r\nprint(min(drink_condition, salt_condition, lime_condition))", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\nlimit= (k*l)//(n*nl)\r\nlimes = c*d//n\r\nsalt= p//(n*np)\r\nans=min(limit,limes,salt)\r\nprint(ans)", "def main():\n take = input().split()\n num_friends = int(take[0])\n milliliters = int(take[1]) * int(take[2]) / int(take[6])\n num_limes = int(take[3]) * int(take[4])\n salt = int(take[5]) / int(take[7])\n print(int(min(milliliters, min(num_limes, salt)) / num_friends))\nmain()\n", "from math import ceil\r\n\r\ndef lstStrRd():\r\n return list(input())\r\ndef intRd():\r\n return int(input())\r\n\r\n\r\ndef lstRd():\r\n return list(map(int, input().split()))\r\n\r\n\r\nn, k, l, c, d, p, nl, np = lstRd()\r\n\r\nprint(min((k * l) // (n * nl),(c*d) // n, p // (np*n)))\r\n", "n,k,l,c,d,p,nl,np = map(int, input().split())\r\nprint(int(min((k*l/nl), (c*d), (p / np)) / n))", "output = []\r\n\r\ndata = [int(x) for x in input().split()]\r\n\r\ndrink = data[6]\r\nslices = 1\r\nsalt = data[7]\r\n\r\navslices = data[3] * data[4]\r\navdrink = data[1] * data[2]\r\navslices = data[3] * data[4]\r\navsalt = data[5]\r\n\r\n\r\n\r\noutput.append(avdrink//drink)\r\noutput.append(avslices//slices)\r\noutput.append(avsalt//salt)\r\n\r\nif 0 in output:\r\n print('0')\r\nelse:\r\n print(min(output)//data[0])", "n,k,l,c,d,p,nl,np = map(int,input().split())\r\n\r\ndrink = (k*l)/nl\r\nlime = (c*d)/1\r\nsalt = p/np\r\n\r\ntotal = int(min(drink,lime,salt)/n)\r\nprint(total)", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\ntoasts_drink = (k * l) // nl\r\ntoasts_lime = c * d\r\ntoasts_salt = p // np\r\n\r\nmin_toasts = min(toasts_drink, toasts_lime, toasts_salt)\r\n\r\nprint(min_toasts // n)\r\n", "min = []\r\nn, k, l, c, d, p, nl, np = list(map(int, input().split()))\r\ndrink = (k*l)//nl\r\nmin.append(drink)\r\nlimes = c*d\r\nmin.append(limes)\r\nsalt = p//np\r\nmin.append(salt)\r\nmin.sort()\r\npop_min = min.pop(0)\r\nprint(pop_min//n)", "a,b,c,d,e,f,g,h=map(int,input().split())\r\nk=b*c\r\nk=k//g\r\nr=d*e\r\ns=f//h\r\nprint(min(k,r,s)//a)", "##### now this problem is about finding the threshold\r\n\r\nn,k,l,c,d,p,nl,np=[int(x) for x in input().split(' ')]\r\n\r\nwine=(k*l)//nl \r\nlimes=c*d \r\nsalt=p//np \r\n\r\nprint(min(wine,limes,salt)//n)\r\n", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\nprint(min((k*l)//nl,(c*d),(p//np))//n)", "n,k,l,c,d,p,nl,np = map(int,input().split())\ndm = k*l \nls = c*d \ntd = dm// (n*nl)\ntl = ls // n \nts = p // (n*np) \nnt = min(td,tl,ts)\nprint(nt)\n", "n,k,l,c,d,p,nl,np=map(int, input().split())\r\n\r\nml = (k * l)//nl\r\nslices = c * d\r\nsalt = p // np\r\n\r\nprint(min(ml, slices, salt)//n)", "n, k, l, c, d, p, nl, np = map(int,input().split())\r\nprint(min((k *l)//nl, c*d, p//np) // n)", "n, k, l, c, d, p, nl, np = input().split(' ')\nx = int(k) * int(l)\ny = int(c) * int(d)\nz = int(x) // int(nl)\na = int(p) // int(np)\nprint(min(z, y, a)//int(n))\n\t \t \t \t\t \t \t \t\t\t\t\t \t", "n,k,l,c,d,p,nl,np= map(int, input().split())\r\ntoast_from_ml = k*l/nl\r\nto_from_lime = c*d\r\nto_from_salt = p/np\r\n\r\nprint(int(min(toast_from_ml,to_from_salt,to_from_lime)/n))", "def main():\r\n n, k, l, c, d, p, nl, np = [int(i) for i in input().split()]\r\n # Loop and compute\r\n drink_toasts = (k*l) // nl\r\n lime_toasts = (c * d)\r\n salt_toasts = p // np\r\n print(min(drink_toasts, lime_toasts, salt_toasts) // n)\r\n \r\n\r\nif __name__ == \"__main__\":\r\n main()", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\ntotal_milliliters = k * l\r\ntotal_limes = c * d\r\n\r\ntoasts_with_drink = total_milliliters // (n * nl)\r\ntoasts_with_lime = total_limes // n\r\ntoasts_with_salt = p // (n * np)\r\n\r\n# Find the minimum number of toasts possible\r\nmin_toasts = min(toasts_with_drink, toasts_with_lime, toasts_with_salt)\r\n\r\nprint(min_toasts)", "n, k, l, c, d, p, nl, np = map(int,input().split())\r\nmax1 = k*l//(nl*n)\r\nmax2 = c*d//n\r\nmax3 = p//(n*np)\r\nprint(min(max1, max2, max3))", "# LUOGU_RID: 122316837\nn, k, l, c, d, p, nl, np = map(int, input().split())\n\ndrink = k * l\nn_l = c * d\n\nn_d = int(drink/nl)\nn_s = int(p/np)\n\nnum = min(n_d, n_s, n_l)\nprint(num//n)", "a, b, c, d, e, f, g, h = list(map(int,input().split()))\r\nx = int((b * c) / g)\r\ny = d * e\r\nz = int(f / h)\r\nmini = min(x,y,z)\r\nprint(int(mini / a))", "s = input().split()\r\nn = int(s[0])\r\nk = int(s[1])\r\nl = int(s[2])\r\nc = int(s[3])\r\nd = int(s[4])\r\np = int(s[5])\r\nnl = int(s[6])\r\nnp = int(s[7])\r\nx = (k * l)//nl\r\ny = (c * d)\r\nz = p // np\r\nprint(min(x,y,z)//n)", "n, k, l, c, d, p, nl, np=map(int,input().split())\r\nx=(k*l)//nl\r\nl=c*d\r\ns=p/np\r\nprint(int(min(x,l,s)/n))", "def main():\r\n a = input().split()\r\n a = [int(i) for i in a]\r\n print(min((a[1]*a[2])//a[-2], a[3] * a[4], a[-3]//a[-1]) // a[0])\r\nmain()", "n,k,l,c,d,p,nl,np = map(int,input().split())\r\nnumber = []\r\ntotaldrink = k*l\r\ndrink = totaldrink // nl\r\nlimes = c*d\r\nsalt = p // np\r\nres = min(drink, limes, salt)//n\r\nprint(res)", "import math\r\n\r\nl=list(map(int,input().split()))\r\na=min(l[2]*l[1]/l[6],l[3]*l[4],l[5]/l[7])\r\nprint(math.floor(a/l[0]))\r\n", "li=list(map(int,input().split()))\r\na=(li[1]*li[2])//li[6]\r\nb=li[3]*li[4]\r\nc=li[5]//li[7]\r\nprint(min(a,b,c)//li[0])", "n,k,l,c,d,p,a,b = map(int,input().split())\r\nprint(min(k*l//a,c*d,p//b)//n)", "n,k,l,c,d,p,nl,np= map(int,input().split())\r\na1=(k*l)//nl\r\na2=c*d\r\na3=p//np\r\nm=(min(min(a1,a2),a3))\r\nprint(m//n)", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\nprint(min(k*l//nl, c*d, p//np)//n)\r\n\r\n'''\r\nk = int(input())\r\nm = 0\r\ny = 0\r\n\r\nwhile k > 0:\r\n k -= 1\r\n number = input()\r\n n = int(number)\r\n if len(number) == 5:\r\n m = 1\r\n print(m)\r\n print(number)\r\n if len(number) == 4:\r\n m = 0\r\n m += 1\r\n if n % 1000 == 0:\r\n print(m)\r\n print(n)\r\n else:\r\n x = n // 1000\r\n x = x * 1000\r\n y = n - x\r\n print(y)\r\n if len(number) == 3:\r\n m += 1\r\n if y % 100 == 0:\r\n print(m)\r\n print(y)\r\n else:\r\n x1 = y // 100\r\n x1 = x1 * 100\r\n z = y - x1\r\n print(z)\r\n if len(number) == 2:\r\n m += 1\r\n if z % 10 == 0:\r\n print(m)\r\n print(z)\r\n else:\r\n x2 = z // 10\r\n x2 = x2 * 10\r\n c = z - x2\r\n print(c)\r\n'''", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\nprint(int(min(int((k*l)/nl),d*c,int(p/np))/n))", "# -*- coding: utf-8 -*-\n\"\"\"151A.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1ozXHmwxL2ZY-NEg-V_vU6Soay8LW0f8V\n\"\"\"\n\nn, k, l, c, d, p, nl, np = map(int, input().split())\n\n\ntoasts_drink = (k * l) // nl # Maximum number of toasts based on the drink\ntoasts_lime = c * d # Maximum number of toasts based on the limes\ntoasts_salt = p // np # Maximum number of toasts based on the salt\n\nmax_toasts = min(toasts_drink, toasts_lime, toasts_salt)\n\n# Calculate the number of toasts each friend can make\nnum_toasts_per_friend = max_toasts // n\n\nprint(num_toasts_per_friend)", "friends, bottles, mill, limes, slices, salt, nl, np = map(int, input().split())\r\nprint(min((bottles * mill) // (nl*friends), salt//(np*friends), (limes*slices)//friends))", "n, k, l, c, d, p, nl, np = list(map(int, input().split()))\r\nprint(int(min(k*l/nl, c*d, p/np)/n))\r\n", "n,k,l,c,d,p,nl,np=list(map(int,input().split()))\r\nprint(min(p//np,(k*l)//nl,c*d)//n)", "from sys import stdin\r\n\r\ninput = stdin.readline\r\n\r\nn, k, l, c, d, p, nl, np = map(int, input().split())\r\nliter = k*l\r\ncup = liter // nl\r\nlime = c*d\r\nsalt = p // np\r\n\r\nprint(min(cup, lime, salt) // n)", "n, k, l, c, d, p, nl, np = [int(x) for x in input().split()]\r\n\r\nprint(int(min(int((k*l)/nl),c*d,int(p/np))/n))\r\n\r\n", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\nt = k*l\r\nt /= nl\r\nc *= d\r\np /= np\r\nprint(int(min(t, c, p)/n))", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\n\r\nt1 = (k*l)//nl\r\nt2 = c*d\r\nt3 = p//np\r\n\r\ntoast = [t1, t2, t3]\r\n\r\nt = min(toast)//n\r\nprint(t)\r\n\r\n", "[n,k,l,c,d,p,nl,np] = list(map(int,input().split(' ')))\r\n\r\nmillis = k * l\r\nlimes = c * d\r\n\r\nshots_drink = millis // nl\r\nshots_salt = p // np\r\n\r\nprint(min(shots_drink // n,shots_salt // n,limes // n))", "while True:\r\n try:\r\n n,k,l,c,d,p,nl,np,=map(int,input().split())\r\n drink=(k*l)//nl\r\n lime=c*d\r\n salt=p//np\r\n toast=min(drink,lime,salt)//n\r\n print(toast)\r\n\r\n except:\r\n break", "import sys\r\n\r\nn, k, l, c, d, p, nl, np = map(int, sys.stdin.readline().split())\r\n\r\na = k*l\r\nb = c*d\r\nprint(min(p//np, a//nl, b) // n)", "n1=list(map(int, input().split(\" \")))\r\nlmao=n1[2]//n1[-2]\r\ntdrinks=(n1[1]*n1[2])//n1[-2]\r\ntslice=n1[3]*n1[4]\r\nremslice=tslice//n1[0]\r\nremsalt=n1[5]//n1[-1]\r\nlis=[tdrinks,tslice,remsalt]\r\ntotal=[]\r\nfor i in lis:\r\n\r\n total.append(i//n1[0])\r\n\r\nprint(min(total))", "a=list(map(int,input().split())); print(min(a[1]*a[2]//a[6],a[3]*a[4],a[5]//a[7])//a[0])", "a=[]\r\na=list(map(int,input().split()))\r\nprint(min((a[1]*a[2])//a[-2],min((a[3]*a[4]),a[5]//a[-1]))//a[0])", "import math\r\n\r\nn,k,l,c,d,p,nl,np= map(int,input().split())\r\n\r\ndr=(k*l)/nl\r\nt=c*d\r\ns=p/np\r\nprint(math.floor(min(dr,t,s)/n))\r\n\r\n\r\n\r\n\r\n\r\n", "softdrink = list(map(int, input().split()))\r\nn = softdrink[0]\r\nk = softdrink[1]\r\nl = softdrink[2]\r\nc = softdrink[3]\r\nd = softdrink[4]\r\np = softdrink[5]\r\nnl = softdrink[6]\r\nnp = softdrink[7]\r\n\r\nlimit1 = k*l/nl\r\nlimit2 = c*d\r\nlimit3 = p/np\r\n\r\nlimit = min(limit1,limit2,limit3)\r\n\r\nprint(int(limit/n))", "a,i,x,c,d,p,nl,np=list(map(int,input().split()))\r\nnb=(i*x)//(a*nl)\r\nnlimesf=c*d//a\r\nngf=p//(np*a)\r\nm=min(nb,nlimesf,ngf)\r\nprint(m)", "friends, drinks, volume, limes, slices, salt, drink_need, salt_need = input().split()\r\nfriends, drinks, volume, limes, slices, salt, drink_need, salt_need = int(friends), int(drinks), int(volume), int(limes), int(slices), int(salt), int(drink_need), int(salt_need)\r\ndrink_num = (drinks * volume) // drink_need\r\nsalt_num = salt // salt_need\r\nlime_num = (limes * slices)\r\na = min(drink_num, lime_num, salt_num)\r\nprint(a // friends)\r\n", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\ntdri = (k * l) // nl \r\ntli = c * d\r\ntis = p // np\r\ntmin = min(tdri, tli, tis)\r\nprint(tmin // n)\r\n", "x = [int(x) for x in input().split(\" \")]\r\nn = x[0]\r\nk = x[1]\r\nl = x[2]\r\nc = x[3]\r\nd = x[4]\r\np = x[5]\r\nnl = x[6]\r\nnp = x[7]\r\n\r\nx = k*l // nl\r\ny = c*d\r\nz = p // np\r\n\r\nprint(min(x,min(y,z)) // n)", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\na=l*k\r\nb=c*d\r\na1=int(a/nl)\r\na2=int(p/np)\r\n \r\nprint(min(a1,a2,b)//n)", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\nkiu1 = int((k*l)/nl)\r\nkiu2 = int(c*d)\r\nkiu3 = int(p/np)\r\nprint(int(min(kiu1, kiu2, kiu3)/n))", "import sys\r\ninput=sys.stdin.readline\r\nn,k,l,c,d,p,nl,np=map(int,input().split())\r\nprint( min ( (k*l)//nl , c*d, p//np ) // n)", "a,b,c,d,e,f,g,h=list(map(int,input().split()))\r\nprint(int(min(min(b*c/g,d*e),f/h)/a));", "n,k,l,c,d,p,nl,np = map(int,input().split())\r\n\r\na = (k*l)//nl\r\nb = c*d\r\nz = p//np\r\n\r\nresult = (min(a,b,z))//n\r\n\r\nprint(result)", "n,k,l,c,d,p,nl,np=map(int,input().split());\r\nprint(int(min((k*l)//nl,c*d,(p/np))/n))", "n, k, l, c, d, p, nl, np = list(map(int, input().split()))\r\n\r\ntotML = k * l\r\ntotLP = c * d\r\n\r\ntoastML = totML // nl\r\ntotSalt = p // np\r\n\r\nprint(min(toastML, totLP, totSalt) // n)", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\ntotal_drink_liters = k*l\r\ntotal_lime_slices = c*d\r\ntotal_salt_grams = p\r\n\r\navaliable = []\r\navaliable.append(total_drink_liters // nl)\r\navaliable.append(total_lime_slices)\r\navaliable.append(total_salt_grams // np)\r\n\r\nprint(min(avaliable) // n)\r\n", "n,k,l,c,d,p,nl,np=map(int, input().split())\r\nz=k*l\r\nx=z//nl\r\nv=c*d\r\nb=p//np\r\nprint(min(x,v,b)//n)", "import math\nn,k,l,c,d,p,nl,np=map(int, input().split())\ns=math.floor(c*d)\nm=math.floor(k*l/nl)\no=math.floor(p/np)\nprint(math.floor(min(m,s,o)/n))\n\t\t \t \t \t\t\t\t \t \t \t\t\t \t \t", "# Problem: \r\n# Answer:\r\n\r\n# ********************\r\n\r\n# I had to simplify the variable names down to letters because the answer got too verbose.\r\n\r\n# To make a toast, each friend needs:\r\n\r\n # - a specified amount to drink: (l*k) // nl\r\n # - a single slice of lime\r\n # - a specified amount of salt: p // np\r\n\r\n# ********************\r\n\r\nvariables = [int(i) for i in input().split()]\r\n\r\nn = variables[0]\r\nk = variables[1]\r\nl = variables[2]\r\nc = variables[3]\r\n\r\nd = variables[4]\r\np = variables[5]\r\nnl = variables[6]\r\nnp = variables[7]\r\n\r\nnum1 = (k*l)//nl\r\nnum2 = (c*d)\r\nnum3 = (p//np)\r\n\r\nnumbers = [num1, num2, num3]\r\nnumbers.sort()\r\nanswer = numbers[0] // n\r\n\r\nprint(answer)", "import math\r\n\r\nn, k, l, c, d, p, nl, np=map(int,input().split())\r\nltrs=math.floor((k*l)/nl)\r\nslc= c*d\r\nslt=p/np\r\nprint(math.floor(min(ltrs,slc,slt)/n))\r\n", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\ntotal_drink = k * l\r\ntotal_slices = c * d\r\ntotal_salt = p\r\ndrink_toasts = total_drink // nl\r\nlime_toasts = total_slices\r\nsalt_toasts = total_salt // np\r\ntoasts = min(drink_toasts, lime_toasts, salt_toasts) // n\r\nprint(toasts)\r\n", "Input = input().split()\r\nnumbers = [int(x) for x in Input]\r\n\r\nliquid = numbers[1]*numbers[2]/numbers[6]\r\nslice = numbers[3]*numbers[4]/1\r\nsalt = numbers[5]/numbers[7]\r\n\r\nprint(int(min(liquid,slice,salt)/numbers[0]))", "n,k,l,c,d,p,nl,np = map(int, input().split())\r\nres = min(min(k*l // nl, c*d), p // np) // n\r\nprint(res)", "friends, softdrink, ml, limes, slice, salt, mlneeded, saltneeded = [int(i) for i in input().split()]\r\n\r\ncount = 0\r\n\r\nlimeslice = limes*slice\r\n\r\nsoftdrinkml = softdrink*ml\r\n\r\n\r\nwhile limeslice > 0 and softdrinkml >= mlneeded and salt >= saltneeded:\r\n count += 1\r\n limeslice -= 1\r\n softdrinkml -= mlneeded\r\n salt -= saltneeded\r\n\r\nprint(count//friends)", "n, i, l, q, d, p, nl, np = map(int, input().split())\r\nmax_toasts_drink = (i * l) // nl\r\nmax_lime = q * d\r\nmax_salt = p // np\r\n\r\ntoasts_per_friend = min(max_toasts_drink, max_lime, max_salt) // n\r\nprint(toasts_per_friend)\r\n", "\r\n\r\nn,k,l,c,d,p,nl,np=map(int,input().split())\r\ndrink=k*l//nl\r\nlime=c*d\r\nsalt=p//np\r\nprint(min(drink,lime,salt)//n)", "n, k, l, c, d, p, nl, np=map(int,input().split())\r\ngaz=(k*l)//nl \r\nlime=c*d \r\nsalt=p//np \r\na=[gaz,lime,salt]\r\nprint(min(a)//n)\r\n\r\n", "n, k, l, c, d, p, nl, np =map(int,input().split())\r\ng=(k*l)//(n*nl)\r\nu=c*d//n\r\ni=p//(np*n)\r\nprint(min(u,g,i))", "n,k,l,c,d,p,nl,np=input().split(\" \")\r\nn=int(n)\r\nk=int(k)\r\nl=int(l)\r\nc=int(c)\r\nd=int(d)\r\np=int(p)\r\nnl=int(nl)\r\nnp=int(np)\r\ntotaldrink=k*l\r\ntotalpiece=c*d\r\nprint(min(int((k*l)/(n*nl)), int((c*d)/(n)),int(p/(n*np))))\r\n", "n,k,l,c,d,p,nl,np=list(map(int,input().split()))\r\nx=min((k*l)//nl,c*d,p//np)\r\nprint(x//n)", "str1 = input()\r\nstr2 = str1.split()\r\nstr2 = [int(i) for i in str2]\r\nn = str2[0]\r\nk = str2[1]\r\nl = str2[2]\r\nc = str2[3]\r\nd = str2[4]\r\np = str2[5]\r\nnl = str2[6]\r\nnp = str2[7]\r\n\r\n\r\ntoasts = min(k * l / nl, c * d, p / np) // n\r\nprint(int(toasts))", "n,k,l,c,d,p,nl,np = map(int, input().split())\r\nprint(min(k * l // nl // n, c * d // n, p // np // n))", "n,k,l,c,d,p,nl,np = map(int,input().split())\r\nmili = k*l//(n*nl)\r\nsli = c*d//n\r\nsalt = p//(np*n)\r\nprint(min(mili,sli,salt))", "n, k, l, c, d, p, nl, np = [int(i) for i in input().split()]\r\ntotalDrink = k * l\r\ntotalLime = c * d\r\ntemp = [totalDrink // nl, totalLime, p // np]\r\nprint(min(temp) // n)", "a,b,c,d,e,f,g,h=map(int,input().split())\r\nb=b*c\r\nu=b//g\r\nv=d*e\r\ni=f//h\r\nprint(min(u,v,i)//a)", "a1, a2, a3, a4, a5, a6, a7, a8 = input().split()\r\nn = int(a1)\r\nk = int(a2)\r\nl = int(a3)\r\nc = int(a4)\r\nd = int(a5)\r\np = int(a6)\r\nnl = int(a7)\r\nnp = int(a8)\r\ndrink = (k*l)//nl//n\r\nlime = (c*d)//n\r\nsalt = p//np//n\r\nm = drink\r\nif lime<m:\r\n m = lime\r\nif salt<m:\r\n m = salt\r\nprint(m)\r\n", "a,b,c,d,e,f,g,h=map(int,input().split())\r\nprint(min(b*c//(a*g),d*e//a,f//(h*a)))", "n, k, l, c, d, p, nl, np=map(int,input().strip().split())\r\nv1=(k*l)//nl\r\nv2=p//np\r\nv3=c*d\r\nv=min(v1,v2,v3)\r\nprint(v//n)", "v=list(map(int,input().split()))\r\nw=(v[1]*v[2]);w1=(v[3]*v[4]);w2=v[5]//v[-1]\r\nprint(min(int(w/v[-2]),w1,w2)//v[0])", "import math\r\n\r\ndef min_of_three(a, b, c):\r\n return min(a, min(b, c))\r\n\r\ndef main():\r\n n, k, l, c, d, p, nl, np = map(int, input().split())\r\n result = min_of_three(k * l / nl, c * d, p / np) / n\r\n print(math.floor(result))\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\n#n - количество друзей k - количество бутылок l - объем c - количество лаймов d - количество долек nl - мл на тост np - соли на тост\r\n\r\nvolume = (k * l) // nl\r\nlimes = c * d\r\nsalt = p // np\r\nans = min(volume, limes, salt) // n\r\nprint(ans)", "def main():\r\n tosts = 0\r\n\r\n n, k, l, c, d, p, nl, np = map(int, input().split()) # n - кол-во человек\r\n # k - кол-во бутылок газировки\r\n # l - объём бутылки\r\n # c - кол-во лаймов\r\n # d - кол-во долек лайма\r\n # p - купили граммов соли\r\n # nl - требуется миллилитров газировки для 1 тоста\r\n # np - требуется граммов соли для 1 тоста\r\n # Каждому требуется одна долька лайма для 1 тоста\r\n\r\n tosts += (l*k)//(nl*n)\r\n\r\n if ((c*d)//n) >= tosts:\r\n pass\r\n else:\r\n tosts = (c*d)//n\r\n\r\n if (p//(np*n)) >= tosts:\r\n pass\r\n else:\r\n tosts = p//(np*n)\r\n\r\n return tosts\r\n\r\n\r\nif __name__ == '__main__':\r\n print(main())\r\n\r\n\r\n", "inputt = input()\ninputt = inputt.split()\nfor n in range(len(inputt)) :\n inputt[n] = int(inputt[n])\nn, k, l, c, d, p, nl, np = inputt\nnumbs = []\nnumbs.append(k*l//nl)\nnumbs.append(c*d)\nnumbs.append(p//np)\nprint(min(numbs)//n)\n", "l=list(map(int,input().split()))\r\na=(l[1]*l[2])//l[-2]\r\nb=(l[3]*l[4])\r\nc=(l[-3])//l[-1]\r\nr=min(a,b,c)//l[0]\r\nprint(r)", "n, k, l, c, d, p, nl, np = [int(x) for x in input().split()]\r\nprint(min((k*l)//(nl*n), (c*d)//n, p//(np*n)))", "ing = list(map(int, input().split()))\r\n\r\ndrink, limes, salt = (ing[1] * ing[2]) // ing[-2], ing[3] * ing[4], ing[-3] // ing[-1]\r\n\r\nprint(min(drink, limes, salt) // ing[0])\r\n\r\n", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\ntotalDrink = (k*l)//nl\r\ntotalSlice = c*d\r\ntotalSalt = (p)//np\r\n\r\nprint(min(totalDrink, totalSalt, totalSlice)//n)\r\n", "lst = list(map(int, input().split()))\r\nkl = lst[1] * lst[2]\r\ntoast = kl // lst[6]\r\ncd = lst[3] * lst[4]\r\ntoasts = lst[5] // lst[7]\r\nresult = min(toast,cd,toasts) // lst[0]\r\nprint(result)\r\n", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\n\r\nkl = k*l\r\npkl = kl//nl\r\ncd = c*d\r\npsp = p // np\r\n\r\nans = min(pkl, psp, cd)\r\nprint(ans//n)", "n, k, l, c, d, p, nl, np = [int(i) for i in input().split()]\r\nt1 = (k*l)//nl\r\nt2 = c*d\r\nt3 = p//np\r\nprint(min(t1, t2, t3)//n)\r\n", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\nnum_toast_drink = (k*l) // nl\r\nnum_toast_limes = c*d\r\nnum_toast_salt = p // np\r\n\r\nprint(min(num_toast_drink, num_toast_limes, num_toast_salt)//n)", "a = list(map(int, input().split()))\r\nn = a[0]\r\ng=a[1]*a[2]\r\nd=a[3]*a[4]\r\ns=a[5]\r\nk=(min(g//a[6], d, s//a[7]))\r\n\r\nprint(k//n)\r\n", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\nkkr = k*l//nl//n\r\nccr = c*d//n\r\nppr = p//np//n\r\n\r\na = [kkr, ccr, ppr]\r\na.sort()\r\n\r\nprint(a[0]//1)", "n,k,l,c,d,p,nl,np = map(int,input().split())\r\nw = k * l\r\nx = w // nl\r\ny = c * d\r\nz = p // np\r\nresult = min(x,y,z) // n\r\nprint(result)", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\nmililitrosTo=k*l\r\nslidesTo=c*d\r\nTostadasnl=mililitrosTo//nl\r\nsal=p//np\r\ntoastTO=min(slidesTo,min(Tostadasnl,sal))//n\r\nprint(toastTO)", "n, k, l, c, d, p, nl, np = map(int, input().split())\n\ntoasts = (k * l) // nl\nlimes = c * d\nsalt = p // np\n\n\nprint(min(toasts, limes, salt)//n)\n", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\nsu=k*l//nl\r\nlaym=c*d\r\ntuz=p//np\r\nprint(min(su,laym,tuz)//n)\r\n", "(n, k, l, c, d, p, nl, np) = map(int, input().split())\r\ntotal_drink_ml = k * l\r\ntotal_toasts_drink = total_drink_ml // nl\r\ntotal_toasts_lime = (c * d) \r\ntotal_toasts_salt = p // np\r\nmin_toasts = min(total_toasts_drink, total_toasts_lime, total_toasts_salt)\r\nmax_toasts_per_friend = min_toasts // n\r\nprint(max_toasts_per_friend)", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\nmax_toasts_drink = (k * l) // (n * nl)\r\nmax_toasts_lime = (c * d) // n\r\nmax_toasts_salt = p // (n * np)\r\nmin_toasts = min(max_toasts_drink, max_toasts_lime, max_toasts_salt)\r\n\r\nprint(min_toasts)\r\n", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\ndrink = int((k*l)//nl)\r\nlime = c*d\r\nsalt = int(p//np)\r\n\r\nprint(int(min(drink, lime, salt)//n))\r\n", "n, k, l, c, d, p, nl, np = map(int, input().split()) \r\ntost = (k * l) // nl \r\nlime = c * d\r\nsalt = p // np\r\nprint(min(tost, lime, salt) // n)", "n,k,l,c,d,p,nl,np=map(int,(input().split()))\r\na=(k*l)//nl\r\nb=c*d\r\nf=p//np\r\nans=(min(a,b,f))//n\r\nprint(ans)", "\r\ndef mai():\r\n n,k,l,c,d,p,nl,np = [int(x) for x in input().split()]\r\n first = ((k*l)//nl)\r\n second = (d*c)\r\n third = (p//np)\r\n print(min(first,second,third)//n) \r\nmai()", "A=[int(x) for x in input().split()]\r\nell=A[1]*A[2]\r\ntest=ell//A[6]\r\nlime=A[3]*A[4]\r\nsol = A[5] // A[7]\r\nprint(min(test, lime, sol)//A[0])", "def li():\r\n return list(map(int,input().split()))\r\ndef gi(n):\r\n return [list(map(int,input().split())) for _ in range(n)]\r\n\r\n# File input\r\n\r\n# import sys\r\n# sys.stdin = open('user.txt','r')\r\n\r\nn,k,l,c,d,p,nl,np = li()\r\n\r\nprint(min((k*l)//nl,c*d,p//np) // n)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Jan 12 17:14:24 2023\r\n\r\n@author: R I B\r\n\"\"\"\r\n\r\nimport sys\r\nL=[]\r\nfor i in sys.stdin:\r\n L.append(i)\r\nK=[line.rstrip('\\n') for line in L if line]\r\nK=[int(K[0].split(' ')[i]) for i in range(len(K[0].split(' '))) ]\r\nprint(min([(K[1]*K[2])//(K[6]*K[0]),(K[3]*K[4])//(K[0]),K[5]//(K[7]*K[0])]))", "a,b,c,d,e,f,g,h=map(int,input().split())\nq=b*c\nw=q/g\ne=d*e\nsafo=f/h\nprint(int(min(w,e,safo)/a))\n\n \t \t \t\t \t\t \t\t \t \t \t \t\t \t\t", "n, k, l, c, d, p, nl, np = map(int,input().split())\r\nans = min({((k*l)/nl), (p/np), (c*d)})/n\r\nprint(int(ans))", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\nans_k = (k * l) // nl\r\nans_c = c * d\r\nans_p = p // np\r\nt = min(ans_k, ans_c, ans_p)\r\nprint(t // n)", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\na = []\r\nx = (k*l) // nl\r\n\r\ny = d*c\r\n\r\nz = p // np\r\n\r\na.append(x)\r\na.append(y)\r\na.append(z)\r\n\r\n\r\nprint(min(a) // n)", "numFriends, bottles, ml, limes, cutsPerLimes, weightSalt, necessaryML, necessaryGram = map(int, input().split())\r\n\r\ntotalML = (bottles * ml) // necessaryML\r\ncutLimes = limes * cutsPerLimes\r\nsaltedDrinks = weightSalt // necessaryGram\r\n\r\nminTer = min(totalML, cutLimes, saltedDrinks);\r\n\r\nprint(minTer // numFriends)\r\n", "x=list(map(int,input().split()))\r\n\r\np1=(x[1]*x[2])//x[6]\r\np2=x[3]*x[4]\r\np3=x[5]//x[7]\r\nprint(min(p1,p2,p3)//x[0])", "n, k, l, c, d, p, nl, np=map(int,input().split())\r\ntotal_drink=k*l\r\ntotal_slice_for_toast=c*d\r\ntotal_drink_for_toast=total_drink//nl\r\ntotal_salt_for_toast=p//np\r\nprint((min(total_salt_for_toast,total_drink_for_toast,total_slice_for_toast))//n)", "'''\r\nThis winter is so cold in Nvodsk! A group of n friends decided to buy k bottles of a soft drink called \"Take-It-Light\" to warm up a bit. Each bottle has l milliliters of the drink. Also they bought c limes and cut each of them into d slices. After that they found p grams of salt.\r\n\r\nTo make a toast, each friend needs nl milliliters of the drink, a slice of lime and np grams of salt. The friends want to make as many toasts as they can, provided they all drink the same amount. How many toasts can each friend make?\r\n\r\nInput\r\nThe first and only line contains positive integers n, k, l, c, d, p, nl, np, not exceeding 1000 and no less than 1. The numbers are separated by exactly one space.\r\n\r\nOutput\r\nPrint a single integer — the number of toasts each friend can make.\r\n\r\nExamples\r\ninputCopy\r\n3 4 5 10 8 100 3 1\r\noutputCopy\r\n2\r\n'''\r\nn, k, l, c, d, p, nl, np=map(int,input().split())\r\nwater=(k*l)//nl\r\nlime=c*d\r\nsalt=p//np\r\nprint(min(water,lime,salt)//n)", "s=str(input()).split(' ')\r\nn=int(s[0])#friends\r\nk=int(s[1])#number of bottles\r\nl=int(s[2])#ml in each bottle\r\nc=int(s[3])#numb of limes\r\nd=int(s[4])#number into which each lime is sliced\r\np=int(s[5])#grams of salt\r\nnl=int(s[6])\r\nnp=int(s[7])\r\ntotal_lime_slices=c*d\r\ntotal_ml_drink=k*l\r\ntoasts=min(total_ml_drink//nl,total_lime_slices,p//np)//n\r\nprint(toasts)", "n,k,l,c,d,p,nl,np = map(int,input().split())\r\nprint(min((k*l)//nl , c*d , p//np)//n)", "# # count=int(input())\r\n# # while count>0:\r\n# # ab=list(map(int,input().split()))\r\n# # # a.sort()\r\n# # # print(a)\r\n# # b=list(map(int,input().split()))\r\n# # ce=list(map(int,input().split()))\r\n# # d=list(map(int,input().split()))\r\n# # # d=asd+b+c\r\n# # # d.sort()\r\n# # # print(d)\r\n# # c,e,f,g=0,0,0,0\r\n# # l=[]\r\n# # while c!=ab[1]:\r\n# # temp1,temp2,temp3=(99999,8888),(99999,8888),(99999,8888)\r\n# # if e<len(d):temp1=c^b[e],1\r\n# # if f<len(d):temp2=c^ce[f],2\r\n# # if g<len(d):temp3=c^d[g],3\r\n# # if temp1[0]==ab[1] or temp2[0]==ab[1] or temp3[0]==ab[1]:\r\n# # c=ab[1]\r\n# # break\r\n# # if e>len(d) or f>len(d) or g>len(d):\r\n# # break\r\n# # # print(temp1+temp2+temp3)\r\n# # k=min((temp1[0]-ab[1]),(temp2[0]-ab[1]),(temp3[0]-ab[1]))\r\n# # # print((temp1[0]-ab[1]),(temp2[0]-ab[1]),(temp3[0]-ab[1]))\r\n# # if k==(temp1[0]-c):\r\n# # # e+=1\r\n# # if c>temp1[0]:\r\n# # a=min(temp2[0],temp3[0])\r\n# # if a==temp2[0]:\r\n# # if c>a:\r\n# # a=temp3[0]\r\n# # if c>a:\r\n# # break\r\n# # else:\r\n# # c=a\r\n# # g+=1\r\n# # else:\r\n# # c=a\r\n# # f+=1\r\n# # elif a==temp3[0]:\r\n# # if c>a:\r\n# # a=temp2[0]\r\n# # if c>a:\r\n# # break\r\n# # else:\r\n# # c=a\r\n# # f+=1\r\n# # else:\r\n# # c=temp1[0]\r\n# # e+=1\r\n# # elif k==(temp2[0]-c):\r\n# # f+=1\r\n# # if c>temp2[0]:\r\n# # a=min(temp1[0],temp3[0])\r\n# # if a==temp1[0]:\r\n# # if c>a:\r\n# # a=temp3[0]\r\n# # if c>a:\r\n# # break\r\n# # else:\r\n# # c=a\r\n# # else:\r\n# # c=a\r\n# # elif a==temp3[0]:\r\n# # if c>a:\r\n# # a=temp1[0]\r\n# # if c>a:\r\n# # break\r\n# # else:\r\n# # c=a\r\n# # else:\r\n# # c=temp2[0]\r\n# # else:\r\n# # g+=1\r\n# # if c>temp3[0]:\r\n# # a=min(temp2[0],temp1[0])\r\n# # if a==temp2[0]:\r\n# # if c>a:\r\n# # a=temp1[0]\r\n# # if c>a:\r\n# # break\r\n# # else:\r\n# # c=a\r\n# # else:\r\n# # c=a\r\n# # elif a==temp1[0]:\r\n# # if c>a:\r\n# # a=temp2[0]\r\n# # if c>a:\r\n# # break\r\n# # else:\r\n# # c=a\r\n# # else:\r\n# # c=temp3[0]\r\n# # # l.append(c)\r\n# # # print(l)\r\n# # print(\"Yes\") if c==ab[1] else print(\"No\")\r\n# # count-=1\r\n\r\n# # import math\r\n\r\n\r\n# # def solve():\r\n# # ab=list(map(int,input().split()))\r\n# # l,m=list(map(int,input().split()))\r\n# # ji=[[l,m]]\r\n# # e=0\r\n# # for i in range(ab[0]-1):\r\n# # k,q=list(map(int,input().split()))\r\n# # o,p=ji[0]\r\n# # e+=math.sqrt((k-o)**2+(q-p)**2)\r\n# # ji=[]\r\n# # ji.append([k,q])\r\n# # print(e*ab[1]/50)\r\n\r\n# # solve()\r\n\r\n\r\n# # def soln():\r\n# # count=int(input())\r\n# # while count>0:\r\n# # a=int(input())\r\n# # ab=list(map(int,input().split()))\r\n# # # ba=[x for x in ab if x>=0]\r\n# # # print(min(ba))\r\n# # c={x:ab.count(x) for x in ab }\r\n# # c=sorted(c.items(),key=lambda x:x[1],reverse=True)\r\n# # print(c)\r\n# # temp=c[0][1]\r\n# # ans=c[0][0]\r\n# # for i in range(len(c)):\r\n# # if c[i][1]==temp:\r\n# # if c[i][0]<ans:\r\n# # ans=c[i][0]\r\n# # else:\r\n# # break\r\n# # print(ans)\r\n\r\n# # count-=1\r\n# # soln()\r\n\r\n# #1844A\r\n\r\n\r\n# # a=input()\r\n# # b=input()\r\n# # c=''\r\n# # for i in range(len(a)):\r\n# # if a[i]!=b[i]:\r\n# # c+='1'\r\n# # else:\r\n# # c+='0'\r\n# # print(c)\r\n\r\n\r\n# #1771C\r\n# # import math\r\n\r\n\r\n# # def is_prime(n):\r\n# # if n <= 1:\r\n# # return False\r\n# # for i in range(2, int(n ** 0.5) + 1):\r\n# # if n % i == 0:\r\n# # return False\r\n# # return True\r\n\r\n# # a=int(input())\r\n# # for i in range(a):\r\n# # b=int(input())\r\n# # ab=list(map(int,input().split()))\r\n\r\n# # fg=0\r\n# # for i in range(b):\r\n# # if fg:break\r\n# # for j in range(i,b):\r\n# # if i!=j:\r\n# # # if int(str(b[i])[-1])%2==0\r\n# # if math.gcd(ab[i],ab[j])>1:\r\n# # print(\"YES\")\r\n# # fg=1\r\n# # break\r\n# # else:\r\n# # print(\"NO\")\r\n\r\n# # import math\r\n# # def is_successful_pair(a, b):\r\n# # if math.gcd(a,b)>1:\r\n# # return True\r\n# # return False\r\n\r\n# # def solve(t):\r\n# # for _ in range(t):\r\n# # n = int(input())\r\n# # a = list(map(int, input().split()))\r\n# # if any(is_successful_pair(a[i], a[j]) for i in range(n) for j in range(i + 1, n)):\r\n# # print(\"YES\")\r\n# # else:\r\n# # print(\"NO\")\r\n\r\n# # if __name__ == \"__main__\":\r\n# # t = int(input())\r\n# # solve(t)\r\n# def sol(c,n):\r\n# k=1\r\n# for i in c:\r\n# k*=i\r\n# # print(k)\r\n# if k%(2**n)==0:return 1\r\n# else: return 0\r\n\r\n# # a=int(input())\r\n# # for i in range(a):\r\n# # b=int(input())\r\n# # n=0\r\n# # k=1\r\n# # c=list(map(int,input().split()))\r\n# # c.sort()\r\n# # for i in c:\r\n# # k*=i\r\n# # cnt=1\r\n# # fg=0\r\n# # for i in range(len(c)):\r\n# # while cnt!=len(c)-1:\r\n# # if k%(2**a):\r\n# # print(n)\r\n# # fg=1\r\n# # break\r\n# # else:\r\n# # k*=cnt\r\n# # cnt+=1\r\n# # n+=1\r\n# # if fg:\r\n# # break\r\n# # else:\r\n# # print(-1)\r\n\r\n# #1841B\r\n\r\n\r\n# # a=int(input())\r\n# # for i in range(a):\r\n# # b=int(input())\r\n# # ans=''\r\n# # c=list(map(int,input().split()))\r\n# # d,e=[],[]\r\n# # for j in c:\r\n# # d.append(j)\r\n# # # e.append(j)\r\n# # # e.sort()\r\n# # if sorted(d)==d:\r\n# # ans+='1'\r\n# # else:\r\n# # d.pop()\r\n# # d.insert(0,j)\r\n# # if sorted(d)==d:\r\n# # ans+='1'\r\n# # d.pop(0)\r\n# # d.append(j)\r\n \r\n# # else:\r\n# # d.pop(0)\r\n# # ans+='0'\r\n# # print(d)\r\n# # print(ans)\r\n\r\n\r\n# # n = int(input())\r\n# # a = list(map(int, input().split()))\r\n\r\n# # min_operations = float('inf')\r\n\r\n# # for diff in range(-100, 101): # Iterate over possible common differences\r\n# # operation_count = 0\r\n# # prev = a[0]\r\n# # for i in range(1, n):\r\n# # expected = prev + diff # Calculate expected value based on common difference\r\n# # operation_count += abs(a[i] - expected)\r\n# # prev = expected\r\n# # min_operations = min(min_operations, operation_count)\r\n\r\n# # print(min_operations)\r\n\r\n\r\n\r\n# # a=list(input())\r\n# # # print(a.count('a'))\r\n# # # print(len(a))\r\n# # for i in range(len(a)):\r\n# # try:\r\n# # if a.count('a')>len(a)/2:\r\n# # print(len(a))\r\n# # break\r\n# # else:\r\n# # for j in range(len(a)):\r\n# # if a[j]!='a':\r\n# # a.pop(j)\r\n# # break\r\n# # except:\r\n# # continue\r\n\r\n\r\n\r\n\r\n# # # a=list(map(int,input().split()))\r\n# # # b=list(map(int,input().split()))\r\n\r\n# # # b.sort()\r\n# # # c=0\r\n# # # for i in range(a[1]):\r\n# # # if b[i]<=0:c+=b[i]*(-1)\r\n# # # print(c)\r\n# # # l=[0,1,2,]\r\n# # def minheap(n):\r\n# # # for i in range(n):\r\n# # c=0\r\n# # while n>0:\r\n# # c+=n\r\n# # n=n//2\r\n# # return c\r\n# # a=int(input())\r\n# # for i in range(a):\r\n# # b=int(input())\r\n# # print(minheap(b))\r\n\r\n\r\n# # a=int(input())\r\n# # for i in range(4,a+1):\r\n# # if a%i==0:\r\n# # # print(\"HI\")\r\n# # if len(str(i))==str(i).count('4')+str(i).count('7'):\r\n# # # print(len(str(i)))\r\n# # # print(str(a).count('4')+str(a).count('7'))\r\n# # # print(i)\r\n# # print(\"YES\")\r\n# # break\r\n# # else:\r\n# # print(\"NO\")\r\n\r\n# # a=list(map(int,input().split()))\r\n# # b=list(input())\r\n# # fg=1\r\n# # for i in range(a[1]):\r\n# # fg=1\r\n# # for j in range(len(b)-1):\r\n# # # print(j)\r\n# # if b[j]=='B' and b[j+1]=='G' and fg:\r\n# # temp=b[j]\r\n# # b[j]=b[j+1]\r\n# # b[j+1]=temp\r\n# # fg=0\r\n# # else:\r\n# # fg=1\r\n# # for i in b:\r\n# # print(i,end='')\r\n\r\n\r\n\r\n# # def power(x, n):\r\n# # if n == 0:\r\n# # return 1\r\n# # if n % 2 == 0:\r\n# # pow_h = power(x, n // 2)\r\n# # return pow_h * pow_h\r\n# # else:\r\n# # pow_h = power(x, (n - 1) // 2)\r\n# # return x * pow_h * pow_h\r\n\r\n\r\n# # print(power(3,1))\r\n# # a=list(map(int,input().split()))\r\n# # b=list(map(int,input().split()))\r\n# # c=int(input())\r\n# # for i in range(c):\r\n# # vi=1\r\n# # k=list(map(int,input().split()))\r\n# # k[0]-=1\r\n# # k[1]-=1\r\n# # ho=b[k[0]:k[1]+1]\r\n# # if k[0]==k[1]:\r\n# # print(ho[0])\r\n# # else:\r\n# # ho.reverse()\r\n# # for ji in ho:\r\n# # vi=power(ji,vi)\r\n# # print(vi%a[1])\r\n\r\n# # a=int(input())\r\n# # for i in range(a):\r\n# # b=int(input())\r\n# # l=[]\r\n# # if b==1:\r\n# # print(1)\r\n# # print(*[1,3])\r\n# # else:\r\n# # print(b-1)\r\n# # for i in range(1,b):\r\n# # l.append(3*i)\r\n# # l.append(3*i+1)\r\n# # print(*l,end='')\r\n# # c = 0\r\n# # for _ in range(int(input())):\r\n# # a = int(input())\r\n# # numbers = list(map(int, input().split()))\r\n# # max_xor = 0\r\n# # c += 1\r\n# # if c == 78:\r\n# # print(numbers)\r\n# # for i in numbers:\r\n# # for j in numbers:\r\n# # xor = i ^ j\r\n# # if xor > max_xor:\r\n# # max_xor = xor\r\n# # print(max_xor)\r\n\r\n# # def get(a, b, c):\r\n# # return max(0, (a + b + c) * (a + b - c) * (a + c - b) * (b + c - a))\r\n\r\n# # def query(i, j, k):\r\n# # print(f\"? {i} {j} {k}\")\r\n# # res = int(input())\r\n# # return res\r\n\r\n# # n = int(input())\r\n# # a = [0] * (n + 1)\r\n\r\n# # if n < 9:\r\n# # mp = [[[0] * (n + 1) for _ in range(n + 1)] for _ in range(n + 1)]\r\n# # for i in range(1, n - 1):\r\n# # for j in range(i + 1, n):\r\n# # for k in range(j + 1, n + 1):\r\n# # mp[i][j][k] = query(i, j, k)\r\n\r\n# # cnt = 0\r\n# # v = [0] * (n + 1)\r\n\r\n# # def dfs(s):\r\n# # global cnt\r\n# # if cnt == 2:\r\n# # return\r\n# # if s > n:\r\n# # cnt += 1\r\n# # for i in range(1, n + 1):\r\n# # a[i] = v[i]\r\n# # return\r\n# # for t in range(1, 5):\r\n# # v[s] = t\r\n# # if s >= 3:\r\n# # for i in range(1, s - 1):\r\n# # for j in range(i + 1, s):\r\n# # if mp[i][j][s] != get(v[i], v[j], v[s]):\r\n# # goto_nx1 = True\r\n# # break\r\n# # if goto_nx1:\r\n# # break\r\n# # else:\r\n# # goto_nx1 = False\r\n# # if not goto_nx1:\r\n# # dfs(s + 1)\r\n# # goto_nx1 = False\r\n\r\n# # dfs(1)\r\n\r\n# # if cnt == 1:\r\n# # print(\"!\", end=\" \")\r\n# # for i in range(1, n + 1):\r\n# # print(a[i], end=\" \")\r\n# # else:\r\n# # print(\"! -1\")\r\n# # else:\r\n# # cur, p1, p2 = 0, 0, 0\r\n# # mp = {}\r\n# # for i in range(1, 5):\r\n# # mp[get(i, i, i)] = i\r\n\r\n# # for i in range(1, 8):\r\n# # for j in range(i + 1, 9):\r\n# # for k in range(j + 1, 10):\r\n# # t = query(i, j, k)\r\n# # if mp.get(t):\r\n# # a[i] = a[j] = a[k] = cur = mp[t]\r\n# # p1, p2 = i, j\r\n# # break\r\n# # if cur:\r\n# # break\r\n\r\n# # if cur == 1:\r\n# # for i in range(2, 5):\r\n# # mp[get(1, i, i)] = i\r\n# # v = []\r\n# # for i in range(1, n + 1):\r\n# # if not a[i]:\r\n# # t = query(p1, p2, i)\r\n# # if t:\r\n# # a[i] = 1\r\n# # else:\r\n# # v.append(i)\r\n# # if len(v) >= 4:\r\n# # break\r\n# # if len(v) == 1:\r\n# # print(\"! -1\")\r\n# # exit(0)\r\n# # if len(v) >= 2:\r\n# # for i in range(len(v) - 1):\r\n# # for j in range(i + 1, len(v)):\r\n# # t = query(p1, v[i], v[j])\r\n# # if mp.get(t):\r\n# # a[v[i]] = a[v[j]] = cur = mp[t]\r\n# # p1, p2 = v[i], v[j]\r\n# # break\r\n# # if cur:\r\n# # break\r\n# # if cur == 1:\r\n# # print(\"! -1\")\r\n# # exit(0)\r\n# # if cur != 1:\r\n# # for i in range(1, 5):\r\n# # mp[get(i, cur, cur)] = i\r\n# # for i in range(1, n + 1):\r\n# # if not a[i]:\r\n# # a[i] = mp[query(p1, p2, i)]\r\n# # print(\"!\", end=\" \")\r\n# # for i in range(1, n + 1):\r\n# # print(a[i], end=\" \")\r\n\r\n\r\n# # a=int(input())\r\n# # for _ in range(a):\r\n# # ab=list(map(int,input().split()))\r\n# # bb=list(map(int,input().split()))\r\n# # l=[]\r\n# # for i in range(ab[2]):\r\n# # l.append(list(map(int,input().split())))\r\n# # for i in l:\r\n# # # print(i)\r\n# # # print(abs(ab[1]))\r\n# # if ((abs(bb[0]-i[0])-abs(bb[1]-i[1])))%2==0:\r\n# # print(\"NO\")\r\n# # break\r\n# # else:\r\n# # print(\"Yes\")\r\n\r\n# # a=int(input())\r\n# # for _ in range(a):\r\n# # ab=list(map(int,input().split()))\r\n# # # print(ab[1],ab[2])\r\n# # if ab[1]>=1 and ab[2]!=1:\r\n# # print(\"YES\")\r\n# # print(ab[0])\r\n# # print('1 '*ab[0])\r\n# # else:\r\n# # if ab[0]%2==0 and ab[1]>=2 and ab[2]!=2:\r\n# # print(\"YES\")\r\n# # print(ab[0]//2)\r\n# # print('2 '*(int(ab[0]//2)))\r\n# # elif ab[1]>=2 and ab[0]%2!=0 and ab[2]!=2 and ab[2]!=1:\r\n# # print(\"YES\")\r\n# # print((ab[0]//2)+1)\r\n# # print('2 '*(int((ab[0]-1)//2))+' 1')\r\n# # else:\r\n# # print(\"NO\")\r\n\r\n\r\n\r\n# # a=list(input())\r\n# # # print(a)\r\n# # gf=0\r\n# # cnt=0\r\n# # for i in range(len(a)):\r\n# # if len(a)==1:\r\n# # break\r\n# # if str(9-int(a[i]))!='0':\r\n# # gf=1\r\n# # if a[i]>='5' and (gf or cnt>=1):\r\n# # a[i]=str(9-int(a[i]))\r\n# # cnt+=1\r\n# # fg=0\r\n# # # print(a)\r\n# # for i in a:\r\n# # if fg:print(i,end='')\r\n# # else:\r\n# # if i!='0':\r\n# # print(i,end='')\r\n# # fg=1\r\n# # if a.count('0')==len(a):\r\n# # print(0)\r\n\r\n# # l=[]\r\n# # for i in range(3):\r\n\r\n# # a=int(input())\r\n# # b=list(input())\r\n# # ans=[x for x in b]\r\n# # fg=1\r\n# # if a%2!=0:\r\n# # ans[a//2]=b[0]\r\n# # c=a//2-1\r\n# # d=a//2+1\r\n# # else:\r\n# # ans[a//2-1]=b[0]\r\n# # c=a//2-2\r\n# # d=a//2\r\n# # for i in b[1::]:\r\n# # # if a==2:\r\n# # # ans=[x for x in b]\r\n# # # break\r\n# # if fg:\r\n# # ans[c]=i\r\n# # c-=1\r\n# # fg=0\r\n# # else:\r\n# # ans[d]=i\r\n# # d+=1\r\n# # fg=1\r\n# # for i in ans:\r\n# # print(i,end='')\r\n\r\n\r\n# # a=list(map(int,input().split()))\r\n# # b=c=0\r\n# # fg=0\r\n# # for i in range(a[2]):\r\n# # if fg:\r\n# # break\r\n# # for j in range(a[2]):\r\n# # if a[0]*i+a[1]*j==a[2]:\r\n# # print(\"Yes\")\r\n# # fg=1\r\n# # break\r\n# # else:\r\n# # print(\"No\")\r\n\r\n\r\n# # a=input()\r\n# # b='CODEFORCES'\r\n# # j=0\r\n# # fg=0\r\n# # KP=0\r\n# # for i in a:\r\n# # if i==b[j]:\r\n# # j+=1\r\n# # if fg!=1:\r\n# # fg=1\r\n# # KP=0\r\n# # elif KP:\r\n# # break\r\n# # else:\r\n# # KP=1\r\n# # print(\"YES\") if j==len(b) else print(\"NO\")\r\n\r\n\r\n\r\n# # a=input().split()\r\n# # # cnt=0\r\n# # ans=a[0][0]\r\n# # for i in a[0][1::]:\r\n# # if i<a[1][0]:\r\n# # ans+=i\r\n# # print(ans+a[1][0])\r\n\r\n# # a=list(input())\r\n# # fg,gf=0,0\r\n# # for i in range(len(a)-1):\r\n# # if a[i]=='A':\r\n# # if a[i+1]=='B':\r\n# # fg=1\r\n# # a[i+1]='F'\r\n# # a[i]='G'\r\n# # break\r\n# # if fg:\r\n# # for i in range(len(a)-1):\r\n# # if a[i]=='B':\r\n# # if a[i+1]=='A':\r\n# # gf=1\r\n# # a[i+1]='F'\r\n# # a[i]='G'\r\n# # break\r\n# # if fg and gf:\r\n# # print(\"YES\")\r\n# # else:\r\n# # print(\"NO\")\r\n\r\n\r\n\r\n# # a,b=list(map(int,input().split()))\r\n# # c=0\r\n# # for i in range(max(a,b)*2):\r\n# # for j in range(max(a,b)*2):\r\n# # if i**2+j==a and i+j**2==b:\r\n# # c+=1\r\n# # print(c)\r\n\r\n\r\n\r\n# # def mod_inverse(num, mod):\r\n# # return pow(num, mod - 2, mod)\r\n\r\n# # def factspl(n, mod):\r\n# # tmp = 1\r\n# # for i in range(1, n + 1):\r\n# # tmp *= i\r\n# # tmp %= mod\r\n# # return tmp\r\n\r\n# # a = int(input())\r\n# # while a > 0:\r\n# # b = int(input())\r\n# # ans = factspl(2 * b, 10**9 + 7)\r\n# # ans = (ans * mod_inverse(2, 10**9 + 7)) % (10**9 + 7)\r\n# # print(ans)\r\n# # a -= 1\r\n\r\n\r\n# # b=list(map(int,input().split()))\r\n# # a=abs(b[0]-b[1])\r\n# # c=abs(b[1]-b[2])\r\n# # d=abs(b[0]-b[2])\r\n\r\n# # l=[a,c,d]\r\n# # l.sort()\r\n# # print(l[0]+l[1])\r\n\r\n\r\n# # n,a,b,c=list(map(int,input().split()))\r\n# # l=[a,b,c]\r\n# # l.sort()\r\n# # ans=0\r\n# # cnt=0\r\n# # while cnt<=2 and n-l[cnt]>=0:\r\n# # # print(l)\r\n# # # print(cnt)\r\n# # n-=l[cnt]\r\n# # cnt+=1\r\n# # print(cnt)\r\n\r\n# # a=int(input())\r\n# # b=list(map(int,input().split()))\r\n\r\n# # fg=0\r\n# # ans=0\r\n# # for i in b:\r\n# # if fg==0 and i==-1:\r\n# # ans+=1\r\n# # elif i==-1 and fg!=0:\r\n# # fg-=1\r\n# # if i!=-1:\r\n# # fg+=i\r\n# # print(ans)\r\n\r\n\r\n# # def fact(n):\r\n# # if n==1 or n==0:\r\n# # return 1\r\n# # else:\r\n# # return n*fact(n-1)\r\n\r\n# # print(fact(5))\r\n\r\n\r\n# # a=int(input())\r\n# # b=list(map(int,input().split()))\r\n# # b.sort()\r\n# # c=0\r\n# # for i in range(len(b)):\r\n# # if b[i]==b[0]:\r\n# # c+=1\r\n# # b.reverse()\r\n# # for i in range(len(b)):\r\n# # if b[i]==b[-1]:\r\n# # c+=1\r\n# # print(a-c)\r\n\r\n\r\n# # def count_simple_cycles(n, edges):\r\n# # graph = {i: [] for i in range(1, n+1)}\r\n# # for a, b in edges:\r\n# # graph[a].append(b)\r\n# # graph[b].append(a)\r\n\r\n# # def dfs(node, path):\r\n# # count = 0\r\n# # for neighbor in graph[node]:\r\n# # if neighbor not in path:\r\n# # count += dfs(neighbor, path.union({neighbor}))\r\n# # elif neighbor == path_start and len(path) == n:\r\n# # count += 1\r\n# # return count\r\n\r\n# # total_cycles = 0\r\n# # for start_node in range(1, n+1):\r\n# # path_start = start_node\r\n# # total_cycles += dfs(start_node, {start_node})\r\n\r\n# # return total_cycles // 2 # Divide by 2 to account for symmetric cycles\r\n\r\n# # # Read input\r\n# # n, m = map(int, input().split())\r\n# # edges = [tuple(map(int, input().split())) for _ in range(m)]\r\n\r\n# # # Calculate and print the number of simple cycles\r\n# # print(count_simple_cycles(n, edges))\r\n\r\n\r\n# # a=int(input())\r\n# # b=list(map(int,input().split()))\r\n# # c,d=0,0\r\n# # for i in b:\r\n# # if i==25:\r\n# # c+=1\r\n# # elif i==50:\r\n# # d+=1\r\n# # c-=1\r\n# # elif i==100:\r\n# # if c>=1 and d>=1:\r\n# # c-=1\r\n# # d-=1\r\n# # elif c>=3:\r\n# # c-=3\r\n# # else:\r\n# # print(\"NO\")\r\n# # break\r\n# # if c<0 or d<0:\r\n# # print(\"NO\")\r\n# # break\r\n# # else:\r\n# # print(\"YES\")\r\n\r\n\r\n# # a=int(input())\r\n# # b=list(map(int,input().split()))\r\n# # c=0\r\n# # for i in range(len(b)-2):\r\n# # if b[i]==1==b[i+2] and b[i+1]==0:\r\n# # b[i]=b[i+2]=0\r\n# # c+=1\r\n# # print(c)\r\n\r\n\r\n# # # a=int(input())\r\n# # import math\r\n\r\n# # fg=0\r\n# # # print(math.gcd(1,56)+math.lcm(1,56))\r\n# # for _ in range(int(input())):\r\n# # a=int(input())\r\n# # print('1 '+str(a-1))\r\n\r\n\r\n# # a=list(map(int,input().split()))\r\n# # b=list(map(int,input().split()))\r\n# # # b.sort()\r\n# # c=a[1]-a[0]\r\n\r\n# # l=[max(b)-min(b)]\r\n# # for i in range(c):\r\n# # k=b[i:i+a[0]]\r\n# # # print(k)\r\n# # l.append(max(k)-min(k))\r\n# # print(min(l))\r\n\r\n# from collections import defaultdict\r\n\r\n\r\n# def dfs(u, par, adj, dp, s):\r\n# s[u] = 1\r\n# for v in adj[u]:\r\n# if v == par:\r\n# continue\r\n# dfs(v, u, adj, dp, s)\r\n# s[u] += s[v]\r\n# dp[u] += dp[v] + s[v]\r\n\r\n# def reroot(u, par, adj, dp, s, ans, n):\r\n# ans[u] = dp[u]\r\n# for v in adj[u]:\r\n# if v == par:\r\n# continue\r\n# rem, rems = dp[v], s[v]\r\n# dp[v] = dp[v] + dp[u] - s[v] - dp[v] + s[u] - s[v]\r\n# s[v] = n\r\n# reroot(v, u, adj, dp, s, ans, n)\r\n# dp[v] = rem\r\n# s[v] = rems\r\n\r\n# def solve():\r\n# MOD = 1000000007\r\n\r\n# n, k = map(int, input().split())\r\n# adj = defaultdict(list)\r\n\r\n# for i in range(n - 1):\r\n# u, v = map(int, input().split())\r\n# u -= 1\r\n# v -= 1\r\n# adj[u].append(v)\r\n# adj[v].append(u)\r\n\r\n# if k == 1:\r\n# print(1)\r\n# return\r\n\r\n# if k == 2:\r\n# dp = [0] * n\r\n# s = [0] * n\r\n# ans = [0] * n\r\n# dfs(0, -1, adj, dp, s)\r\n# reroot(0, -1, adj, dp, s, ans, n)\r\n# ansgot = sum(ans)\r\n# ansgot //= 2\r\n# ansgot += n * (n - 1) // 2\r\n# pr = ((ansgot % MOD) * pow((n * (n - 1) // 2) % MOD, MOD - 2, MOD)) % MOD\r\n# print(pr)\r\n# elif k == 3:\r\n# print(1)\r\n\r\n# if __name__ == \"__main__\":\r\n# t = 1\r\n# # t = int(input())\r\n# for _ in range(t):\r\n# solve()\r\n\r\n\r\n# for _ in range(int(input())):\r\n# a=input()\r\n# l=[x for x in a if x==a[0]]\r\n# if len(l)==len(a):\r\n# print(-1)\r\n# else:\r\n# print(len(a)-1)\r\n\r\n\r\n# for _ in range(int(input())):\r\n# a=list(map(int,input().split()))\r\n# b=list(map(int,input().split()))\r\n# c=[]\r\n# d=[]\r\n# for i in b:\r\n# d=[]\r\n# for j in b:\r\n# d.append(i-j)\r\n# c.append(sum(d))\r\n# print(max(c))\r\n\r\na=list(map(int,input().split()))\r\nb=(a[1]*a[2])//a[-2]\r\nc=a[3]*a[4]\r\nd=a[-3]//a[-1]\r\nprint(min(b,c,d)//a[0])", "\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, k, l, c, d, p, nl, np = get_ints()\r\n drink = (k * l) // nl\r\n lime = (c * d) \r\n salt = p // np\r\n \r\n print(min(drink, lime, salt) // n)\r\n \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()", "n , k , l, c , d, p , nl,np = map(int , input().split()) \r\ntoasts_number_per_litre = (k * l) / nl \r\ntoast_number_per_slice = (c * d) \r\ntoast_number_per_salt = (p / np) \r\nprint(int((min(toast_number_per_salt , toast_number_per_slice , toasts_number_per_litre))//n))", "n,k,l,c,d,p,nl,np = map(int,input().split())\r\nprint(int(min(int((k*l)/nl),c*d,int(p/np))/n))", "n,k,l,c,d,p,nl,np = [int(x) for x in input().split()]\r\ndrink = l*k\r\nslices = c*d\r\nsalt = p\r\ndirnk_req = drink//nl\r\nsalt_requied = salt//np\r\nprint(min(dirnk_req,salt_requied,slices)//n)", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\nx = k*l // nl\r\ny = c * d\r\nz = p//np\r\n\r\nprint(min(x,y,z)//n)", "a1,a2,a3,a4,a5,a6,a7,a8=map(int,input().split())\r\na=(a2*a3)//a7\r\nb=a4*a5\r\nc=a6//a8\r\nprint(min(a,b,c)//a1)\r\n\r\n", "a=list(map(int,input().split()))\r\nn=a[0]\r\nk=a[1]\r\nl=a[2]\r\nc=a[3]\r\nd=a[4]\r\np=a[5]\r\nnl=a[6]\r\nnp=a[7]\r\n\r\nbottle_each=int(k*l/nl)\r\nlime_each=int(d*c)\r\nsalt_each=int(p/np)\r\n\r\nprint(int((min(bottle_each,lime_each,salt_each))/n))", "def main() -> None :\r\n print(each_Toast_Count(input_Ingredients()))\r\n\r\n\r\ndef each_Toast_Count(ingredients: list[int]) -> int :\r\n return total_Toast_Count(ingredients) // ingredients[0]\r\n\r\ndef total_Toast_Count(ingredients: list[int]) -> int :\r\n return min(\r\n toast_Count_By_Soft_Drink(ingredients),\r\n toast_Count_By_Lime(ingredients),\r\n toast_Count_By_Salt(ingredients)\r\n )\r\n\r\ndef toast_Count_By_Soft_Drink(ingredients: list[int]) -> int :\r\n return (ingredients[1]*ingredients[2]) // ingredients[6]\r\n\r\ndef toast_Count_By_Lime(ingredients: list[int]) -> int :\r\n return (ingredients[3]*ingredients[4]) // 1\r\n\r\ndef toast_Count_By_Salt(ingredients: list[int]) -> int :\r\n return (ingredients[5]) // ingredients[7]\r\n\r\n\r\ndef input_Ingredients() -> list[int] :\r\n return input_Array()\r\n\r\ndef input_Array() -> list[int] :\r\n return list(map(int, input().split()))\r\n\r\n\r\nmain()", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\ngaz = (k * l) // (n * nl)\r\nlime = (c * d) // n\r\nsol = p // (n * np)\r\n\r\nprint(min(gaz, lime, sol))\r\n", "dat = list(map(int, input().split()))\r\nn, k, l, c, d, p, nl, np = dat\r\n\r\nx = min((k*l)//nl, c*d, p//np)\r\nprint(x // n)\r\n\r\n", "s=input()\r\nf=s.split()\r\nn=int(f[0]) \r\nk=int(f[1])\r\nl=int(f[2])\r\nc=int(f[3])\r\nd=int(f[4])\r\np=int(f[5])\r\nnl=int(f[6])\r\nnp=int(f[7])\r\nprint(min((k*l)//(nl*n),(c*d)//(n),(p)//(np*n)))", "import sys\r\ndef input(): return sys.stdin.readline().strip()\r\ndef getints(): return map(int,sys.stdin.readline().strip().split())\r\n\r\nn,k,l,c,d,p,nl,np = getints()\r\nprint(min((k*l)//(n*nl),(c*d)//n,p//(n*np)))", "n, k, l, c, d, p, nl, np = map(int,input().split())\r\na = k * l\r\n#drink\r\nb = c * d\r\n#lemons\r\ne = n * nl\r\n#drinkneed\r\nt = n * np\r\n#saltneed\r\ng = 1 * n\r\n#lemonneed\r\nr = []\r\nif np > p or nl > a :\r\n print(0)\r\nelse :\r\n r.append(a // e )\r\n r.append( b // g )\r\n r.append( p // t)\r\n print(min(r))", "# 코드포스 151A Soft Drinking\r\nimport sys\r\nput = sys.stdin.readline\r\n\r\nn, k, l, c, d, p, nl, np = map(int, put().split())\r\n\r\ndrinks = l * k // nl\r\nlime = c * d\r\nsalt = p // np\r\n\r\nprint(min(drinks, lime, salt) // n)", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\nx=(k*l)/nl\r\ny=c*d\r\nz=p/np\r\nprint(int((min(x,y,z))/n))\r\n", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\nprint(min(p//(n*np),(k*l)//(nl*n),(c*d)//n))", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\ndrink = (k * l) // nl\r\nlime = (c * d) // 1\r\nsalt = p // np\r\n\r\nmax_toasts = min(drink, lime, salt)\r\ntoasts = max_toasts // n\r\n\r\nprint(toasts)\r\n", "n, k, l, c, d, p, nl, np = map(int,input().split())\r\ns1 = (k * l)//nl\r\ns2 = c * d\r\ns3 = p // np\r\nprint(min(s1, s2, s3)//n )", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\ntoasts_with_drink = (k * l) // nl\r\ntoasts_with_lime = (c * d) // 1\r\ntoasts_with_salt = p // np\r\n\r\nmin_toasts = min(toasts_with_drink, toasts_with_lime, toasts_with_salt)\r\n\r\ntoasts_per_friend = min_toasts // n\r\n\r\nprint(toasts_per_friend)\r\n", "n, k, l, c, d, p, nl, np=list(map(int,input().split()))\r\nx=(k*l)/nl\r\ny=c*d\r\nz=p/np\r\nnum=int(min(x,y,z)/n)\r\nprint(num)\r\n", "#FILLER_TEXT___FILLER_TEXT___FILLER_TEXT___FILLER_TEXT___FILLER_TEXT___FILLER_TEXT___FILLER_TEXT___FILLER_TEXT\n\n\nn, k, l, c, d, p, nl, np = map(int, input().split())\n\ndrinks = (k * l) // nl\nlimes = c * d\nsalt = p // np\n\ntoasts = min(drinks, limes, salt) // n\n\nprint(toasts)\n \t \t \t \t\t \t\t\t\t \t \t \t", "if __name__ == '__main__':\n a = input()\n (b, c, d, e, f, g, h, i) = map(int, a.split())\n # b: number of persons\n # c: number of bottles of soft drink\n # d: ml of soft drink in each bottle\n # e: number of limes\n # f: number of slices from each lime\n # g: grams of salt\n # h: ml of drink per person for a toast\n # i: grams of salt per toast\n j = c * d # total amount of soft drink\n k = j // (b * h) # number of toasts supported by soft drink only\n l = (e * f) // b # number of toasts supported by limes only \n m = g // (b * i) # number of toasts supported by salt only\n n = min(k, l, m)\n print(n)\n", "n, k, l, c, d, p, nl, np = [int(x) for x in input().split()]\r\nml = k * l\r\nslices = c * d\r\npml = int(ml/nl)\r\npgr = int(p/np)\r\n\r\nprint(int(min([slices, pml, pgr])/n))", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\n\r\n\r\nprint((min(((k*l)//nl),(c*d),(p//np)))//n)", "i = [int(x) for x in input().split(' ')]\r\nn = i[0]\r\n#n, k, l, c, d, p, nl, np\r\nk = i[1]\r\nl = i[2]\r\nc = i[3]\r\nd = i[4]\r\np = i[5]\r\nnl = i[6]\r\nnp = i[7]\r\n\r\nti = min([int(x) for x in[(k*l)/(n*nl),(c*d)/n,p/(np*n)]])\r\nprint(ti)", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\nml_drink = k * l\r\nslices_lime = c * d\r\n\r\n# Calculate the limiting factor\r\nlimiting_factor = min(ml_drink // nl, slices_lime, p // np)\r\n\r\n# Calculate the number of toasts each friend can make\r\ntoasts_per_friend = limiting_factor // n\r\n\r\nprint(toasts_per_friend)\r\n", "n,k,l,c,d,p,nl,np=map(int, input().split())\r\n\r\ntotal_drk= k*l\r\n\r\nno_drk=total_drk//nl\r\n\r\nlime_slices= c*d\r\n\r\nreq_salt= p//np\r\n\r\nprint(min(no_drk,lime_slices,req_salt)//n)", "#SOFT DRINKING-TO FIND NUMBER TOASTS EACH FRIEND CAN MAKE\r\n\r\nn,k,l,c,d,p,nl,np = list(map(int,input().split()))\r\ntot_ml = k*l\r\nt1 = int(tot_ml/nl)\r\nt2 = c*d\r\nt3 = int(p/np)\r\nprint(int(min(t1,t2,t3)/n))\r\n\r\n", "s = [int(i) for i in input().split()]\r\nn = s[0]\r\nk = s[1]\r\nl = s[2]\r\nk = k * l\r\nc = s[3]\r\nd = s[4]\r\nc = c * d\r\np = s[5]\r\nnl = s[6]\r\nnp = s[7]\r\ni = 0\r\nwhile k > 0 and c > 0 and p > 0:\r\n if nl * n <= k and c >= n and p >= np * n:\r\n i += 1\r\n k -= nl * n\r\n c -= n\r\n p -= np * n\r\nprint(i)\r\n\r\n", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\nvolumeToast = (k * l) // nl\r\nslicesToast = c * d\r\nsaltToast = p // np\r\nif(volumeToast < slicesToast and volumeToast < saltToast): toasts = volumeToast // n\r\nelif(slicesToast < volumeToast and slicesToast < saltToast): toasts = slicesToast // n\r\nelse: toasts = saltToast // n\r\nprint(toasts)", "\"\"\"\nA. Soft Drinking: implementation, math\n\ntime limit per test: 2 seconds\nmemory limit per test: 256 megabytes\ninput: standard input\noutput: standard output\n\nThis winter is so cold in Nvodsk! A group of n friends decided to buy k bottles of a soft drink called \"Take-It-Light\" to warm up a bit.\nEach bottle has l milliliters of the drink. Also they bought c limes and cut each of them into d slices. After that they found p grams of salt.\nTo make a toast, each friend needs nl milliliters of the drink, a slice of lime and np grams of salt.\nThe friends want to make as many toasts as they can, provided they all drink the same amount. How many toasts can each friend make?\n\nInput\nThe first and only line contains positive integers n, k, l, c, d, p, nl, np, not exceeding 1000 and no less than 1. The numbers are separated by exactly one space.\n\nOutput\nPrint a single integer — the number of toasts each friend can make.\n\"\"\"\n\ndef soft_drinking():\n n, k, l, c, d, p, nl, np = map(int, input().split(' '))\n drink = k * l // nl\n lime = c * d\n salt = p // np\n print(min(drink, lime, salt) // n)\n\nif __name__ == '__main__':\n soft_drinking()", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\ntotal_drink = k * l\r\ntotal_lime_slices = c * d\r\ntotal_salt = p\r\ntoasts_per_drink = total_drink // nl\r\ntoasts_per_lime = total_lime_slices\r\ntoasts_per_salt = total_salt // np\r\ntoasts_per_friend = min(toasts_per_drink, toasts_per_lime, toasts_per_salt) // n\r\nprint(toasts_per_friend)\r\n", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\na=k*l\r\nt=a/nl\r\nl=c*d\r\ns=p/np\r\nprint(int(min(t,l,s)/n))", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\ndrinks = (k*l) //nl\r\nlimes = c*d\r\nsalt = p // np\r\nresult = min(drinks, limes, salt) // n\r\nprint(result)", "n, k, l, c, d, p, nl, np = list(map(int, input().split()))\n\ntotal_mL = k * l\nnum_drinks = total_mL // nl\ntotal_limes = c * d\n\nif total_limes < num_drinks:\n num_drinks = total_limes\n\nmax_salted_cups = p // np\nif max_salted_cups < num_drinks:\n num_drinks = max_salted_cups\n\nprint(num_drinks//n)\n\t \t \t \t\t \t \t \t\t \t \t \t\t\t", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\namount_drink:int=k*l\r\namount_salt:int=p\r\namount_slices:int=c*d\r\ncount:int=0\r\nwhile(amount_drink>0 and amount_slices>0 and amount_slices>0):\r\n amount_drink=amount_drink-nl*n\r\n\r\n amount_salt=amount_salt-np*n\r\n\r\n amount_slices=amount_slices-n\r\n\r\n if(amount_drink>=0 and amount_slices>=0 and amount_salt>=0):\r\n count+=1\r\nprint(count)\r\n ", "from sys import stdin\r\ndef input(): return stdin.readline()[:-1]\r\nn,k,l,c,d,p,nl,np=map(int,input().split())\r\ntotal_drink=k*l\r\nslices=c*d\r\nsalt=p\r\nprint(min(total_drink//nl,slices,p//np)//n)", "n,k,l,c,d, p, nl, np = map(int,input().split(\" \"))\r\na= (k*l) // nl\r\nb = c*d\r\ne = p // np\r\nprint(min(a,b,e) // n)", "l=list(map(int,input().split()))\r\na=[]\r\ns=int((l[1]*l[2])/l[-2])\r\na.append(s)\r\na.append(l[3]*l[4])\r\na.append(int(l[5]/l[-1]))\r\nprint(int(min(a)/l[0]))", "n , k,l,c ,d,p,nl ,np =map(int,input().split())\r\n\r\ntoast = (k*l)/nl\r\nslices = c*d\r\nsalts = p/np\r\nsum = min(toast,slices,salts)/n\r\nprint(int(sum))", "n,k,l,c,d,p,nl,np = input().split()\r\nn, k, l, c, d, p, nl, np = int(n), int(k), int(l), int(c), int(d), int(p), int(nl), int(np)\r\nt1 = (k*l)//nl\r\nt2 = c*d\r\nt3 = p//np\r\nout = min(t1, t2, t3)//n\r\nprint(out)\r\n", "n, k, l, c, d, p, nl, np = input().split()\r\nprint(int(min(min(int(k) * int(l) / int(nl), int(c) * int(d)), int(p)/int(np))//int(n)))", "n, k, l, c, d, p, nl, np = [int(elem) for elem in input().split()]\ntotal_liquid, total_lime= k * l, c * d\nrashod_liquid, rashod_solt, rashod_lime = nl * n, np * n, n\nres = 0\nwhile total_liquid >= rashod_liquid and total_lime >= rashod_lime and p >= rashod_solt:\n res += 1\n total_liquid -= rashod_liquid\n total_lime -= rashod_lime\n p -= rashod_solt\nprint(res)\n", "lst=list(map(int,input().split()))\nfinal=[]\nfinal.append((lst[1]*lst[2])//lst[6])\nfinal.append(lst[3]*lst[4])\nfinal.append(lst[5]/lst[7])\nprint(int(min(final)/lst[0]))", "a,b,c,d,e,f,g,h=list(map(int,input().split()))\r\nk=(b*c)//g\r\nj=d*e\r\nq=f//h\r\nprint(min(k,j,q)//a)\r\n ", "n, k, l, c, d, p, nl, np = map(int,input().split())\r\nmililiters_per_toats = (k*l)//nl\r\nlimes_per_toast = c*d\r\nsalt_per_toast = p//np\r\ntoasts = min(mililiters_per_toats, limes_per_toast, salt_per_toast) //n\r\nprint(toasts)", "n, k, l, c, d, p, nl, np = input().split()\nn = int(n)\nk = int(k)\nl = int(l)\nc = int(c)\nd = int(d)\np = int(p)\nnl = int(nl)\nnp = int(np)\n\noverall = k*l//nl\nlem = c*d\nsalt = p//np\nprint(min(overall,lem,salt)//n)", "def task1(cond):\r\n n = int(cond[0])\r\n nums = list(map(int, cond[1].split()))\r\n start_mx = nums[0]\r\n start_mn = nums[0]\r\n nums = nums[1:]\r\n cnt = 0\r\n for el in nums:\r\n if el > start_mx:\r\n cnt += 1\r\n start_mx = el\r\n elif el < start_mn:\r\n cnt += 1\r\n start_mn = el\r\n return str(cnt)\r\n\r\ndef task2(cond):\r\n n, k, l, c, d, p, nl, np = map(int, cond[0].split())\r\n return str(min(k * l // nl, c * d, p // np) // n)\r\n\r\ns = input().split('/n')\r\nprint(task2(s))", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\ngaz=(k*l)//nl\r\nlaym=c*d\r\nsol=p//np\r\ntost=min(gaz,laym,sol)//n\r\nprint(tost)\r\n", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\nmax_toasts = min(k*l//nl, c*d, p//np)\r\nnum_toasts_per_friend = max_toasts // n\r\n\r\nprint(num_toasts_per_friend)\r\n", "from sys import stdin\n \nstream = None\ntry:\n stream = open('file.txt', 'r')\nexcept:\n stream = stdin\n \nn, k, l, c, d, p, nl, np = [int(i) for i in stream.readline().split()]\ncola = k*l\nlime_p = c*d\ncola_p = int(cola/nl)\nsalt_p = int(p/np)\nmine = min(lime_p, cola_p, salt_p)\nprint(int(mine/n))\n\n\n", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\nslices = c*d\r\ndrink = k*l\r\nprint(min({drink//nl, p//np, slices})//n)", "from sys import stdin\r\ninput = stdin.readline\r\n\r\ndef main():\r\n n, k, l, c, d, p, nl, np = [int(n) for n in input().split()]\r\n print(int(min(min(k * l / nl, c * d), p / np) / n))\r\n\r\nmain()", "\r\ndef solution(m):\r\n c1 = (m['k']*m['l'])//m['nl']\r\n c2 = m['p']//m['np']\r\n c3 = (m['c']*m['d'])\r\n return min(c1, c2, c3)//m['n']\r\n\r\ndef driver():\r\n keys = ['n', 'k', 'l', 'c', 'd', 'p', 'nl', 'np']\r\n ip = list(map(int, input().split()))\r\n hmap = {}\r\n for i in range(8):\r\n hmap[keys[i]] = ip[i]\r\n ans = solution(hmap)\r\n print(ans)\r\n\r\ndriver()", "n,k,l,c,d,p,a,b=map(int,input().split())\nopt1=(k*l)//a\nopt2=c*d\nopt3=p//b\nprint(min(opt1,opt2,opt3)//n)\n\t\t\t \t\t\t\t \t\t\t \t\t\t \t \t\t\t \t", "l = input().split()\r\nfor i in range(len(l)):\r\n l[i] = int(l[i])\r\nprint(int(int(min(l[1]*l[2]/l[6], l[3]*l[4], l[5]/l[7]))/l[0]))\r\n", "n, k, l, c, d, p, nl, np=map(int,input().split())\r\na=k*l \r\nb=a//nl \r\nr=c*d \r\ns=p//np \r\nprint(min(b,r,s)//n)", "import math\r\n\r\nn, k, l, c, d, p, nl, np = list(map(int, input().split(' ')))\r\n\r\nmLDrink = k * l\r\nlimeSlices = c * d\r\n\r\ndrinkPerPerson = math.floor(mLDrink / nl / n)\r\nsaltPerPerson = math.floor(p / np / n)\r\nlimePerPerson = math.floor(limeSlices / n)\r\n\r\nprint(min(drinkPerPerson, saltPerPerson, limePerPerson))\r\n", "n, k, l, c, d, p, nl, np=map(int,input().split())\r\n\r\na=(k*l)//nl\r\nb=c*d\r\nc=p//np\r\n\r\n\r\nprint(min(a,b,c)//n)", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\n# Calculate the maximum number of toasts based on the available resources\r\nmax_toasts_drink = (k * l) // (n * nl) # Maximum number of toasts based on the drink\r\nmax_toasts_lime = c * d // n # Maximum number of toasts based on the lime\r\nmax_toasts_salt = p // (n * np) # Maximum number of toasts based on the salt\r\n\r\n# The minimum of the three values represents the maximum number of toasts each friend can make\r\nmax_toasts = min(max_toasts_drink, max_toasts_lime, max_toasts_salt)\r\n\r\n# Print the result\r\nprint(max_toasts)\r\n", "\r\nn,k,l,c,d,p,nl,np=map(int,input().split())\r\na=(k*l)//nl\r\nb=c*d\r\nc=p//np\r\nd=min(a,b,c)//n\r\nprint(d)", "n,k,l,c,d,p,nl,np = map(int, input().split())\r\nprint(min((k*l)//(nl*n), (c*d)//n, p//(np*n)))", "n , k, l, c, d, p, nl, np = map(int,input().split())\nans = min((k*l)//nl,c*d, p//np)\nprint(ans//n)\n", "s = input().split(' ')\r\nn = int(s[0])\r\ntotal_ml = int(s[1])*int(s[2])\r\ntotal_lime = int(s[3])*int(s[4])\r\ntotal_gram = int(s[5])\r\nnl = total_ml // int(s[-2])\r\nnp = total_gram // int(s[-1])\r\nprint(min(nl, np, total_lime)//n)", "n, k, l, c, d, p, a, b = map(int, input ().split ())\r\nprint (min (k * l // a , c * d , p // b ) // n)\r\n", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\nx=k*l\r\ny=x//nl\r\nz=c*d \r\nm=p//np\r\nmi=min(y,z,m)\r\nprint(mi//n)", "m,n,o,c,f,p,a,b=map(int,input().split())\r\nprint(min(n*o//a,c*f,p//b)//m)", "x=list(map(int,input().split()))\r\nmilli=x[1]*x[2]\r\ntoasts=milli//x[6]\r\nlimes=x[3]*x[4]\r\nsalt=x[5]//x[7]\r\nprint(min(toasts,limes,salt)//x[0])", "x = [int(x) for x in input().split()]\na = (x[1]*x[2])//x[6]\nb=x[3]*x[4]\nc=x[5]//x[7]\nif a<b and a<c:\n s=a\nelif b<a and b<c:\n s=b\nelse:\n s=c\nprint(s//x[0]) \n \t\t \t \t\t\t\t \t \t\t\t \t\t\t \t", "n, k, l, c, d, p, nl, np =map(int,input().split())\r\ntoasts=k*l//nl\r\nlime=c*d\r\nsalt=p/np\r\nprint(int(min(min(toasts,lime),salt)/n))\r\n\r\n", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\ng=k*l/nl\r\nlim=c*d\r\ns=p/np\r\nprint(int(min(g,lim,s)/n))\r\n", "n, k, l, c, d, p, nl, np = list(map(int, input().split()))\r\n\r\namount_of_drinks_per_toast = (k * l) // nl\r\nnumber_of_slices = c * d\r\ngrams_of_salt_per_toast = p//np\r\n\r\nprint(min(amount_of_drinks_per_toast, number_of_slices, grams_of_salt_per_toast)//n)\r\n", "n,k,l,c,d,p,nl,np = map(int,input().split())\r\na = (k*l)//nl\r\nb = c*d\r\nv = p//np\r\nprint(min(a,b,v)//n)\r\n", "l1=[int(i)for i in input().split()]\r\nprint(min(l1[1]*l1[2]//l1[6],l1[3]*l1[4],l1[5]//l1[7])//l1[0])", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\nall_ml = k * l\r\nall_slices = c * d\r\n\r\navailable_ml = all_ml // nl\r\navailable_salt = p//np\r\n\r\nprint((min(all_slices, available_ml, available_salt))//n)", "n,k,l,c,d,p,nl,np = map(int, input().split())\nlist1=[]\nlist1.append((k*l)//nl)\nlist1.append(c*d)\nlist1.append(p//np)\nprint(min(list1)//n)\n\t\t \t \t \t \t \t \t \t\t\t \t\t \t \t\t\t\t\t", "n, k, l, c, d, p, nl, np = list(map(int, input().split()))\r\n\r\ntotal_ml = k * l\r\n \r\nmax_limes = c * d\r\n\r\nprocess1 = int(total_ml / nl)\r\nprocess2 = max_limes\r\nprocess3 = int(p / np)\r\n\r\n\r\n\r\ndef min_total(process1, process2, process3):\r\n return int(min(process1, process2, process3) / n)\r\n\r\nprint(min_total(process1, process2, process3)) ", "n,k,l,c,d,p,nl,np= map(int, input().split())\r\ntotal_drink = k*l//nl\r\ntotal_slice = c*d\r\nsalt = p//np\r\ntoast= min(total_drink,total_slice,salt)//n\r\nprint(toast)", "N,K,l,c,d,p,nl,np=map(int,input().split())\r\ne=(K*l)//nl\r\nf=c*d\r\ng=p//np\r\na=min(e,g)\r\nprint(min(a,f)//N)", "a1,a2,a3,a4,a5,a6,a7,a8=map(int,input().split())\r\nb1=a2*a3\r\nb2=b1//a7\r\nb3=a4*a5\r\nb4=a6//a8\r\nprint(min(b2,b3,b4)//a1)\r\n", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\nkl=(k*l)//nl\r\ncd=c*d\r\npnp=p//np\r\nrestNum=min(kl,cd,pnp)\r\nprint(restNum//n)\r\n", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\ntl=k*l//nl\r\nnol=c*d\r\nts=p//np\r\nprint(min(tl,nol,ts)//n)", "numbers = [int(i) for i in input().split()]\r\nlitr = numbers[1] * numbers[2]\r\ndol = numbers[3] * numbers[4] // numbers[0]\r\nsalt = numbers[5]\r\nnl = numbers[6]\r\nnp = numbers[7]\r\nlitr //= nl\r\nlitr //= numbers[0]\r\nsalt //= np\r\nsalt //= numbers[0]\r\nprint(min(litr, salt, dol))", "x,y,l,c,d,p,a,b=map(int,input().split());print(min(y*l//a,c*d,p//b)//x)", "n,k,l,c,d,p,nl,np=map(int,input().split(' ',7))\r\narray=[]\r\nx1=(l*k)//nl\r\narray.append(x1)\r\nx2=(c*d)/1\r\narray.append(x2)\r\nx3=p//np\r\narray.append(x3)\r\nprint(int(min(array)//n))", "from math import floor\nf, k, l, c, d, p, nl, np = map(int,input().split())\nmg = k*l\nd = d*c\ndr = floor(mg/nl)\nsal = floor(p/np)\n\nprint(floor(min(d,dr,sal)/f))", "q=[int(x) for x in input().split()]\r\nll=[((q[1]*q[2])/q[6]),(q[3]*q[4]),(q[5]/q[7])]\r\nprint(int(min(ll)/q[0]))", "\r\ndef beautiful():\r\n n, k, l, c, d, p, nl, np = list(map(int,input().split()))\r\n return int(min((k*l)/nl,c*d,p/np)/n)\r\nprint(beautiful())\r\n\r\n", "y=input()\r\ng=list(y.split())\r\nng=[eval(i) for i in g]\r\nn,k,l,c,d,p,nl,np=ng\r\ntotal_drink_toast=(k*l)//nl\r\ntotal_limes=c*d\r\ntotal_salt=p//np\r\nprint(min(total_drink_toast,total_limes,total_salt)//n)\r\n", "n, k, l, c, d, p, nl, np = [int(j) for j in input().split()]\r\n\r\none_round_limes = n\r\none_group_toast_mili = n*nl\r\none_group_toast_salt = n*np\r\n\r\ntotal_mili = k*l\r\ntotal_salt = p\r\ntotal_slices = d*c\r\n\r\nmili_rounds, salt_rounds, lime_rounds = total_mili // one_group_toast_mili, total_salt // one_group_toast_salt, total_slices // one_round_limes\r\n\r\nprint(min(mili_rounds, salt_rounds, lime_rounds))", "import math\r\nimport os\r\n\r\n# n = input()\r\n# n = int(n)\r\nn, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\nsol = int(p/np)\r\ngas = int((k*l)/nl)\r\nprint(int(min(sol,gas,int(c*d))/n))\r\n\r\n# for _ in range(int(input())):\r\n # grid = [list(map(int, input().split())) for _ in range(3)]\r\n # result = [[1] * 3 for _ in range(3)]\r\n # n, s, r = map(int, input().split())\r\n # arr = list(map(int, input().split()))\r\n # n = input()\r\n # n = int(n)11 13 ", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\ndrink_quantity = k * l // nl\r\nlime_slices = c * d\r\nsalt_quantity = p // np\r\n\r\ntoasts = min(drink_quantity, lime_slices, salt_quantity) // n\r\nprint(toasts)\r\n", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\n# Calculate the maximum number of toasts based on available resources\r\ntoasts_drink = (k * l) // (n * nl)\r\ntoasts_lime = c * d // n\r\ntoasts_salt = p // (n * np)\r\n\r\n# Find the minimum number of toasts among the three resources\r\nmax_toasts = min(toasts_drink, toasts_lime, toasts_salt)\r\n\r\nprint(max_toasts)\r\n", "from math import floor\r\n\r\nn, k, l, c, d, p, nl, np = list(map(int, input().split()))\r\n\r\np = p/np #sal\r\nk = int(floor((k*l)/nl)) #bebida\r\nc = c*d #lima\r\n\r\nprint(int(min([p,k,c])/n))", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\nx = k * l\r\ny = c * d\r\n\r\nresult = 0\r\n\r\nwhile True:\r\n if (x - nl < 0 or y - 1 < 0 or p - np < 0):\r\n print(result // n)\r\n break\r\n x -= nl\r\n y -= 1\r\n p -= np\r\n result += 1", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\nprint(min((k*l)//nl,p//np,c*d)//n)", "n,k,l,c,d,p,ll,pp=map(int,input().split())\r\nprint (min((c*d),((k*l)//ll),(p//pp))//n)", "n,k,l,c,d,p,nl,np = list(map(int,input().split()))\n\nz = min(k*l//nl,c*d,p//np)\nt = z//n\nprint(t)\n\n\n", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\na1 = k*l\r\nb1 = c*d\r\nc1 = p\r\narr = [(a1/nl), (b1), (p/np)]\r\nprint(int(min(arr))//n)\r\n", "n , k, l, c, d, p, nl, np = list(map(int,input().split()))\r\n\r\nfriend = n\r\ndrinks = (k * l) // nl\r\nlimes = c * d\r\nsalt = p // np\r\n\r\nprint(min([drinks , limes , salt]) // friend)", "a = input().split()\nn,k,l,c,d,p,nl,np = a\n\ndrink = int(k)*int(l) //int(nl)\nlime = int(c)*int(d)\nsalt = int(p)//int(np)\n\nhasil = min(drink,lime,salt)//int(n)\nprint(hasil)\n\t \t\t \t\t \t\t \t \t\t \t \t\t\t \t \t\t \t\t", "n,k,l,c,d,p,nl,np=map(int, input().split())\r\nkl=k*l \r\ncd=c*d \r\nnnl=nl*n\r\nnnp=np*n\r\nans1=kl//nnl\r\nans2=p//nnp\r\nans3=cd//n\r\nl=[]\r\nl.append(ans1)\r\nl.append(ans2)\r\nl.append(ans3)\r\nl.remove(max(l))\r\nl.remove(max(l))\r\nprint(*l)\r\n\r\n", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\nprint(int(min((k*l)/nl,(c*d),(p/np))/n))", "\r\nn,k,l,c,d,p,nl,np=map(int,input().split())\r\nml_per_friend=((k*l)/n)//nl\r\nlime_per_friend=(c*d)//n\r\nsalt_per_friend=(p/n)//np\r\nprint(int(min(ml_per_friend,lime_per_friend,salt_per_friend)))\r\n\r\n \r\n\r\n \r\n\r\n\r\n ", "ll=(list(map(int,input().split(' '))))\r\nt1=ll[-3]//ll[-1]\r\nt2=ll[1]*ll[2]//ll[-2]\r\nt3=ll[3]*ll[4]\r\nprint(min(t1,t2,t3)//ll[0])\r\n", "n, k, l, c, d, p, nl, np=map(int,input().split())\r\na=k*l\r\nb=c*d\r\nc=p//np\r\na=a//nl\r\nm=min(a,b,c)//n\r\nprint(m)", "n, k, l, c, d, p, nl, np = map(int,input().split())\nk*=l\nk//=nl\nc*=d\np//=np\nprint(min(k,c,p)//n)\n\n'''\nw = int(input())\nfor _ in range(w):\n input()\n a = sorted(set(map(int,input().split())))\n for i in range(1,len(a)):\n if a[i]-a[i-1]>1:\n print('NO')\n break\n else:\n print('YES')\n'''\n", "n, k, l, c, d, p, nl, np = [int(x) for x in input().split()]\n\ndrink_toasts = (k * l) // nl\nlime_toasts = c * d\nsalt_toasts = p // np\n\nprint(min(drink_toasts, lime_toasts, salt_toasts) // n)\n", "a = input()\r\na = a.split()\r\na = [int(x) for x in a]\r\nprint(int(min((a[1]*a[2])/a[6],a[3]*a[4],a[5]/a[7])/a[0]))", "n, k, l, c, d, p, nl, np= [int(i) for i in input().rstrip().split()] \r\ntotalml=k*l\r\ndrink=totalml//(n*nl)\r\nsalt=p//(n*np)\r\nlime=(c*d)//n\r\nprint(min(drink,salt,lime))", "\r\nif __name__ == \"__main__\":\r\n n, k, l, c, d, p, nl, np = map(int, input().split())\r\n ans = min(min(k * l // nl, c * d), p // np) // n\r\n print(ans)\r\n", "def readint():\r\n return int(input())\r\n\r\ndef readarray(typ: str):\r\n return list(map(typ, input().split()))\r\n\r\nn, k, l, c, d, p, nl, np = readarray(int)\r\n\r\ndrink = k*l // nl\r\nlimes = c*d\r\nsalt = p // np\r\n\r\nprint(min(drink, limes, salt)//n)", "n,k,l,c,d,p,nl,np = tuple(map(int, input().split(' ')))\nprint(min(k*l//nl, c*d, p//np)//n)\n \t \t \t\t\t\t\t \t \t \t \t \t", "import math\r\nn1=list(map(int,input().split()))\r\nk1=(n1[1]*n1[2])//n1[6]\r\nk2=n1[3]*n1[4]\r\nk3=n1[5]//n1[7]\r\nprint(min(k1,k2,k3)//n1[0])", "n, k, l, c, d, p, nl, np = [int(i) for i in input().split()]\r\nshots = l*k //nl\r\nlimes = c*p // n\r\nsalts = p // np\r\nprint(min(shots // n, limes // n, salts // n))\r\n\r\n", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\ntemp1 = (k*l)/nl\r\ntemp2 = (c*d)\r\ntemp3 = p/np\r\nprint(int(min(temp1,temp2,temp3)//n))\r\n", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\ntotalMilimiter = k * l\r\ntotalLime = c * d\r\nnp *= n\r\nnl *= n\r\n\r\nresult = 0\r\n\r\nwhile(p >= np and totalMilimiter >= nl and p >= np and totalLime >= n):\r\n result += 1\r\n totalLime -= n\r\n totalMilimiter -= nl\r\n p -= np\r\n\r\nprint(result)", "a,b,c,d,e,f,g,h=map(int,input().split())\r\nx=(b*c)//g\r\ny=d*e\r\nz=(f/h)\r\nprint(int(min(x,y,z)/a))", "x=list(map(int,input().split()))\r\na1=(x[1]*x[2])//x[6]\r\na2=x[3]*x[4]\r\na3=x[5]//x[7]\r\nmn=min(a1,a2,a3)\r\nprint(mn//x[0])", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\nprint(int((min((k * l)/nl, c * d, p / np)/n) // 1))", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\nx, y, z = int((k * l) / nl), c * d, int(p / np)\r\nprint(int(min(x, y, z) / n))", "n,k,l,c,d,p,nl,np = map(int,input(\"\").split())\r\np = [(k*l)//nl, c*d, p//np]\r\nprint(int(min(p)//n))", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\nresult=min((k*l)//nl,min(c*d,p//np))//n\r\nprint(result)", "n,k,l,c,d,p,nl,np = input().split()\r\n\r\na = int(k)*int(l)//int(nl)\r\nb = int(c)*int(d)\r\nc = int(p)//int(np)\r\nz = min(a//int(n),b//int(n),c//int(n))\r\nprint(z)", "n, k, l, c, d, p, nl, np = [int(x) for x in input().split()]\r\n\r\ndrinkFactor = k * l // nl\r\nsaltFactor = p // np\r\nlemonFactor = c * d\r\n\r\nprint(min([drinkFactor , saltFactor , lemonFactor])//n)", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\n# Calculate the maximum number of toasts that can be made\r\ntoasts_from_drink = (k * l) // n // nl\r\ntoasts_from_lime = (c * d) // n\r\ntoasts_from_salt = p // n // np\r\nmax_toasts = min(toasts_from_drink, toasts_from_lime, toasts_from_salt)\r\n\r\nprint(max_toasts)", "# 3 4 5 10 8 100 3 1\r\nn, k, l, c, d, p, nl, np = list(map(int, input().split()))\r\nc = c * d\r\ntotal_liter = k * l\r\n\r\nindividual_lime = c // n\r\nindividual_liter = (total_liter // n) // nl\r\nindividual_salt = (p // n) // np\r\n\r\nprint(min(individual_liter, individual_salt, individual_lime))\r\n\r\n", "data = input().split(\" \")\n[n, k, l, c, d, p, nl, np] = map(int, data)\ntotalDrink = k * l / n\ntotalSliceOfLime = c * d / n\ntotalSalt = p / n\nprint(min(int(totalDrink/nl), int(totalSliceOfLime), int(totalSalt/np)))\n", "abc,bca,cab,de,ef,fg,gh,hi=map(int,input().split())\r\nprint(min(bca*cab//gh,de*ef,fg//hi)//abc)\r\n", "number_of_friends, number_of_bottles, bottle_volume, number_of_limes, lime_slices, grams_of_salt, needed_water, needed_salt = input().split()\r\nnumber_of_friends, number_of_bottles, bottle_volume, number_of_limes, lime_slices, grams_of_salt, needed_water, needed_salt = int(number_of_friends), int(number_of_bottles), int(bottle_volume), int(number_of_limes), int(lime_slices), int(grams_of_salt), int(needed_water), int(needed_salt)\r\nno_of_toast = [(number_of_bottles*bottle_volume)/needed_water, number_of_limes*lime_slices, grams_of_salt/needed_salt]\r\nno_of_toast.sort()\r\nprint(int(no_of_toast[0]/number_of_friends))", "n, k, l, c, d, p, nl, np = input().split()\r\nn = int(n)\r\nk = int(k)\r\nl = int(l)\r\nc = int(c)\r\nd = int(d)\r\np = int(p)\r\nnl = int(nl)\r\nnp = int(np)\r\n\r\nk = k * l\r\nc = c * d\r\nk = int(k / nl)\r\np = int(p / np)\r\n\r\nprint (int(min(k, p, c) / n))\r\n", "n,k,l,c,d,p,nl,np = map(int, input().split())\r\n#print(n,k,l,c,d)\r\n\r\nk1 = (k*l//nl)\r\nk2 = c*d\r\nk3 = p//np\r\nprint(min(k1,k2,k3)//n)", "import math\r\n\r\n\r\ndef inp(): # int inputs\r\n return (int(input()))\r\n\r\n\r\ndef inlt(): # list inputs\r\n return (list(map(int, input().split())))\r\n\r\n\r\ndef insr(): # string inputs\r\n s = input()\r\n return (list(s[:len(s)]))\r\n\r\n\r\ndef invr(): # space sepreated intergel varibales\r\n return (map(int, input().split()))\r\n\r\ncurr = inlt()\r\nn = curr[0]\r\nk = curr[1]\r\nl = curr[2]\r\nc = curr[3]\r\nd = curr[4]\r\np = curr[5]\r\nnl = curr[6]\r\nnp = curr[7]\r\n\r\nprint(min(int((c*d) / n), int((k * l) / (nl * n)), int( p / (n * np)) ))", "n, k, l, c, d, p, nl, np = map(int,input().split())\r\na = int(k*l/nl)\r\nb = c*d \r\nc = int(p/np) \r\nprint(int(min(a,b,c)/n))\r\n \r\n", "n,k,l,c,d,p,nl,np=list(map(int,input().split()))\r\nk*=l\r\nk//=nl\r\np//=np\r\nc*=d\r\nprint(min(k,p,c)//n)\r\n", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\ntotal_drink = k * l\r\ntotal_lime_slices = c * d\r\n\r\nmax_toasts_drink = total_drink // nl\r\nmax_toasts_lime = total_lime_slices\r\nmax_toasts_salt = p // np\r\n\r\npossible_toasts = [max_toasts_drink, max_toasts_lime, max_toasts_salt]\r\nanswer = min(possible_toasts) // n\r\n\r\nprint(answer)\r\n", "def calculate_toasts(n, k, l, c, d, p, nl, np):\r\n toasts_by_drink = k * l // (n * nl)\r\n toasts_by_lime = c * d // n\r\n toasts_by_salt = p // (n * np)\r\n\r\n return min(toasts_by_drink, toasts_by_lime, toasts_by_salt)\r\n\r\ndef main():\r\n n, k, l, c, d, p, nl, np = map(int, input().split())\r\n result = calculate_toasts(n, k, l, c, d, p, nl, np)\r\n print(result)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n,k,l,c,d,p,nl,np = map(int,input().split())\r\nprint(min((k*l)//nl,c*d,p//np)//n)\r\n", "n, k, l, c, d, p, nl, np = map(int, input().split())\ntl = c * d\ntp = p // np\ntd = (l * k) // nl\nprint(min(tl, tp, td) // n)", "import math\r\nn=list(map(int,input().split()))\r\ns1=(n[1]*n[2])//n[6]\r\ns2=n[3]*n[4]\r\ns3=n[5]//n[7]\r\nprint(min(s1,s2,s3)//n[0])", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\na=(k*l)//nl\r\nm=c*d\r\ns=p//np\r\nprint(min(a,s,m)//n)\r\n", "input_list=list(map(int,input().split()))\r\nno_of_friends=input_list[0]\r\nno_of_bottles=input_list[1]\r\nno_of_mls=input_list[2]\r\nno_of_limes=input_list[3]\r\nno_of_slices=input_list[4]\r\nno_of_salt=input_list[5]\r\nno_of_drinks=input_list[6]\r\nno_of_gms_of_salt=input_list[7]\r\ntotal_no_of_mls = no_of_bottles*no_of_mls\r\ntotal_no_of_slices = no_of_limes*no_of_slices\r\nmin_no_of_tosts_from_drinks = int(total_no_of_mls/no_of_drinks)\r\nmin_no_of_tosts_from_lemon_slices = total_no_of_slices\r\nmin_no_of_tosts_from_salt = int(no_of_salt/no_of_gms_of_salt)\r\nMin_Tosts = min(min_no_of_tosts_from_salt,min_no_of_tosts_from_lemon_slices,min_no_of_tosts_from_drinks)\r\nprint(int(Min_Tosts/no_of_friends))", "n, k, l, c, d, p, nl, np = map(int,input().split())\r\neach_ml = (k*l)//nl\r\neach_slices = (c*d)\r\neach_salt = p//np\r\nprint(min(each_ml,each_slices,each_salt)//n)\r\n\r\n \r\n ", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\na=k*l\r\nb=c*d\r\na2=a//nl\r\np2=p//np\r\nif a2<=b and a2<=p2:\r\n print(a2//n)\r\nelif b<=a2 and b<=p2:\r\n print(b//n)\r\nelse:\r\n print(p2//n)", "n,k,l,c,d,p,nl,np=[int(x) for x in input().split()]\ntotal_slices_of_lime_available=c*d\ntotal_mililitres_of_drink_available=k*l\ntotal_salt_available=p\ntotal_slices_required=n\ntotal_salt_required=n*np\ntotal_drink_required=n*nl\nprint(min((total_slices_of_lime_available//total_slices_required),(total_mililitres_of_drink_available//total_drink_required),(total_salt_available//total_salt_required)))", "def main():\r\n n, k, l, c, d, p, nl, np = map(int, input().split())\r\n slcs = c*d\r\n lts = k*l\r\n\r\n ml = lts//nl\r\n mp = p//np\r\n m = min(ml, slcs, mp)\r\n print(m//n)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "(n, k, l, c, d, p, nl, np) = map(int, input().split())\r\n\r\nmilliliters = k*l\r\ntoast_drink = int(milliliters//nl)\r\ntoast_salt = int((p/np))\r\ntoast_lemon = int((c*d))\r\n\r\nprint(int(min(toast_drink, toast_salt, toast_lemon)/n))\r\n\r\n", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\ngas = (k*l)//nl\r\nlaim = (c*d)\r\nsol = p // np\r\nres = min(gas, laim, sol)\r\nprint(res//n)", "n,k,l,c,d,p,nl,np=map(int,input().split())\ntoast=0;t1=0;t2=0;t3=0\nt1=(k*l)//nl \nt2=c*d \nt3=p//np\nif t1<t2 and t1<t3:\n toast=t1//n \nelif t2<t1 and t2<t3:\n toast=t2//n \nelse:\n toast=t3//n \nprint(toast)\n\t \t\t\t \t\t\t\t \t \t \t\t \t", "a,b,c,d,e,f,g,h= map(int, input().split()) \r\nans=min(min(b*c //g,d* e),f//h) //a\r\nprint(ans)\r\n\r\n", "a = input().split()\r\nn = int(a[0])\r\nk = int(a[1])\r\nl = int(a[2])\r\nc = int(a[3])\r\nd = int(a[4])\r\np = int(a[5])\r\nnl = int(a[6])\r\nnp = int(a[7])\r\nprint(min(k*l//nl,c*d,p//np)//n)", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\nmax_toasts_drink = (k * l) // (n * nl)\r\nmax_toasts_lime = (c * d) // n\r\nmax_toasts_salt = p // (n * np)\r\nmax_toasts = min(max_toasts_drink, max_toasts_lime, max_toasts_salt)\r\nprint(max_toasts)\r\n", "n, k, l, c, d, p, nl, np = map(int,input().split())\r\nkl = k * l \r\ncd = c * d \r\nnnl = n * nl \r\nnnp = np * n \r\ntoast = nnl + nnp + n\r\nhave = kl + cd + p\r\nif have < toast:\r\n print(0)\r\ntoast = [ nnl, nnp, n]\r\nhave = [kl, p, cd]\r\nH = 3\r\ni = 0\r\nsoft = []\r\nwhile H > 0:\r\n H -= 1\r\n t1 = have[i] // toast[i]\r\n soft.append(t1)\r\n i += 1\r\nprint(min(soft))", "def main(): \r\n n, k, l, c, d, p, nl, np = map(int, open(0).read().split())\r\n print((min(k*l//nl, c*d, p//np))//n)\r\n \r\n\r\nmain()", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\nml = k*l//(nl*n)\r\n\r\nmlem = c*d//n\r\n\r\nms = p//(np * n)\r\n\r\nprint(min(ml, mlem, ms))", "n,k,l,c,d,p,a,b=map(int,input().split());print(min(k*l//a,c*d,p//b)//n)", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\ntoasts_drink = (k * l) // nl\r\ntoasts_lime = c * d\r\ntoasts_salt = p // np\r\ntoasts_per_friend = min(toasts_drink, toasts_lime, toasts_salt) // n\r\n\r\nprint(toasts_per_friend)\r\n", "n, k, l, c, d, p, nl, np = list(map(int, input().split()))\r\n\r\nprint(min(k*l//(nl*n), c*d//n, p//(np*n)))", "def main():\r\n n, k, l, c, d, p, nl, np = map(int, input().split())\r\n total_drink = k * l\r\n total_limes = c * d\r\n total_salt = p\r\n total_toasts = min(total_drink // nl, total_limes, total_salt // np)\r\n print(total_toasts // n)\r\n\r\nmain()", "# https://codeforces.com/problemset/problem/151/A\r\n\r\nn_friends, k_bottles, l_ml, c_limes, d_slices, p_grams, nl_ml, np_salt = map(int, input().split())\r\n\r\ntotal_mililitres = k_bottles * l_ml\r\n\r\n\r\ntotal_lime_slices_toasts = c_limes * d_slices\r\ndrinks_toasts = total_mililitres // nl_ml\r\nsalt_toasts = p_grams // np_salt\r\n\r\nresult = min(salt_toasts, drinks_toasts, total_lime_slices_toasts) // n_friends\r\n\r\nprint(result)\r\n", "n, k, l, c, d, p, nl, np = list(map(int,input().split()))\r\n\r\nans = min(k*l//nl,c*d,p//np)//n\r\n\r\nprint(ans)", "n,k,l,c,d,p,nl,np = list(map(int, input().split()))\r\nprint(min((k*l)//nl,c*d , p//np )//n)", "n, k, l, c, d, p, nl, np = map(int,input().split())\r\n\r\nlit = k*l\r\nslic = c*d\r\n\r\nnuml = lit//nl\r\nnump = p//np\r\n\r\nprint(min(numl,slic,nump)//n)", "y=input()\r\nx=y.split(\" \")\r\na=[]\r\na.append((int(x[1])*int(x[2]))//int(x[6]))\r\na.append(int(x[3])*int(x[4]))\r\na.append(int(x[5])//int(x[7]))\r\nprint(min(a)//int(x[0]))", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\ntotal_drink = k * l\r\ntotal_lime_slices = c * d\r\ntotal_salt = p\r\n\r\nmax_toasts = min(total_drink // nl, total_lime_slices, total_salt // np)\r\ntoasts_per_friend = max_toasts // n\r\n\r\nprint(toasts_per_friend)\r\n", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\nr1=k*l\r\nr2=r1//nl\r\nr3=c*d\r\nr4=p//np\r\nprint(min(r2,r3,r4)//n)\r\n", "nPeople, kBottkes, lmili, cLimes, dSlices, pGrams, nlmili, npgrams=list(map(int,input().split()))\r\n\r\n\r\n\r\ntotalML= kBottkes* lmili\r\ntoasts= totalML/nlmili\r\nlimes= cLimes*dSlices\r\nsalt= pGrams/ npgrams\r\nans=min(toasts,limes,salt)//nPeople\r\n\r\nprint(int(ans))", "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, k, l, c, d, p, nl,np = map(int,input().split())\r\n\r\nprint(int(min(k*l/nl,c*d,p/np)/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,c,d,e,f,g,h=map(int,input().split())\r\nprint(min((b*c)//g,d*e,f//h)//a)", "arr = list(map(int, input().split()))\n\nprint(min((arr[1]*arr[2])//arr[-2], arr[3]*arr[4], arr[-3]//arr[-1])//arr[0])\n\t \t \t\t\t \t \t\t\t\t\t \t\t\t\t\t\t \t \t", "import math\r\nn = list(map(int, list(input().split())))\r\nprint(math.floor(min((n[1]*n[2])/n[6], n[3]*n[4], n[5]/n[7])/n[0]))", "n, k, l, c, d, p, nl, np = map(int, input().split(' '))\r\nk *= l\r\nc *= d\r\nprint(min(k // nl, p // np, c) // n)\r\n", "items=input().split(' ')\r\nn_drink=(int(items[1])*int(items[2]))//int(items[-2])\r\nn_salt=int(items[-3])//int(items[-1])\r\nn_lime=int(items[4])*int(items[3])\r\nl=[n_drink,n_salt,n_lime]\r\nl.sort()\r\nprint(int(int(l[0])//int(items[0])))", "\r\n\r\ndef solve():\r\n n, k, l, c, d, p, nl, np = map(int, input().split())\r\n drink = (k * l) // nl\r\n limes = (c * d)\r\n salt = p // np\r\n mn = min(drink, min(limes, salt))\r\n print(mn // n)\r\n\r\ndef main():\r\n test = 1\r\n for _ in range(test):\r\n solve()\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\nn1=(k*l)//nl\r\nn2=(c*d)\r\nn3=(p//np)\r\nprint(min(n1,n2,n3)//n)", "n, k, l, c, d, p, nl, np = map(int,input().split())\r\n\r\ndrink = k*l\r\nlime_slices = c*d\r\nsalt = p\r\n\r\nprint(int(min(drink/n/nl,lime_slices/n,salt/np/n)))", "from sys import stdin, stdout\r\n\r\nN, K, L, C, D, P, NL, NP = map(int, stdin.readline().strip().split())\r\n\r\nTOTAL_LIQUOR = K*L \r\nTOTAL_LIME_SLICES = C*D \r\nTOTAL_SALT = P\r\n\r\nX = TOTAL_LIQUOR//N\r\nY = TOTAL_LIME_SLICES//N\r\nZ = TOTAL_SALT//N \r\n\r\nstdout.write(f\"{min(X//NL, Y, Z//NP)}\\n\")\r\n", "num_friends, num_bottles, milliliters_per_bottle, num_limes, \\\r\nslices_per_lime, grams_of_salt, ml_needed_per_toast, grams_of_salt_needed_per_toast = map(int, input().split())\r\n\r\nmax_toasts = (min((num_bottles * milliliters_per_bottle) // ml_needed_per_toast,\r\n num_limes * slices_per_lime,\r\n grams_of_salt // grams_of_salt_needed_per_toast)) // num_friends\r\n\r\nprint(max_toasts)\r\n", "n = []\r\nn += map(int, input().split())\r\ndrink = n[1] * n[2] / n[-2]\r\nlime = n[3] * n[4]\r\nsalt = n[5]/n[-1]\r\nprint(int(min(drink,lime,salt)/n[0]))\r\n", "a,b,c,d,e,f,ac,af=map(int,input().split())\r\nx=(b*c)//ac\r\ny=d*e\r\nz=f//af\r\nprint(min(x,y,z)//a)", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\nzz=k*l\r\nff=zz//nl\r\nmm=c*d\r\nrr=p//np\r\nprint(int(min(ff,mm,rr))//n)\r\n\r\n\r\n \r\n ", "n,k,l,c,d,p,nl,np = map(int,input().split())\r\nx = k*l//nl\r\ny = c*d\r\nz = p//np\r\nprint(min(x,y,z)//n)\r\n", "(n, k, l, c, d, p, nl, np) = map(int, input().split())\r\ntml = k * l\r\nttd = tml // nl\r\nttl = (c * d) \r\ntts = p // np\r\nmin = min(ttd, ttl, tts)\r\nmax = min// n\r\nprint(max)", "n,k,l,c,d,p,nl,np=map(int, input().split())\r\ndrink=(k*l)//(n*nl)\r\nlime=(c*d)//n\r\nsalt=p//(n*np)\r\nres=min(drink, lime, salt)\r\nprint(res)", "n, k, l, c, d, p, nl, np = map(int, input().split())\n\ntotal = k * l\nlaimodolki = c * d\n\nprint(min(total//nl, laimodolki, p // np) // n) ", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\nreq=min([(k*l)//nl,c*d,p//np])\r\nprint(req//n)", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\nkl=k*l\r\ncd=c*d\r\nv=[cd//1,kl//nl,p//np]\r\nprint(min(v)//n)\r\n\r\n\r\n", "lista = input().split()\r\nn = int(lista[0]) # 3\r\nk = int(lista[1]) # 4 \r\nl = int(lista[2]) # 5\r\nc = int(lista[3]) # 10\r\nd = int(lista[4]) # 8\r\np = int(lista[5]) # 100\r\nnl = int(lista[6]) # 3\r\nnp = int(lista[7]) # 1\r\n\r\nlista_wynik = [0] * 3\r\n\r\n# militry napoju\r\nlista_wynik[0] = k * l // nl # 4 * 5 // 3 = 6\r\n# plasterki\r\nlista_wynik[1] = c * d # 80\r\n# sól\r\nlista_wynik[2] = p // np # 100\r\n\r\nprint(min(lista_wynik) // n) # 6", "a,b,c,d,e,f,al,af=map(int,input().split())\r\nx1=(b*c)//al\r\nx2=(d*e)\r\nx3=f/af\r\nprint(int(min(x1,x2,x3)/a))", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\ntd = k * l // nl\r\ntl = c * d\r\nts = p // np\r\nmx_t = min(td, tl, ts)\r\nmx_p = mx_t // n\r\nprint(mx_p)\r\n", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\nk_coce=k*l\r\nk_limes=c*d\r\nprint(min( (k_coce)//(nl),p//np,k_limes)//n)\r\n\r\n\r\n", "n, k, l, c, d, p, nl, np= map(int,input().split())\r\nst=(k*l)//nl\r\ndol=c*d\r\nsp=p//np\r\nst=min(st,dol,sp)\r\nprint(st//n)", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\nslices = c*d\r\ndrink_mili_litres = k*l\r\nsalt = p\r\nnum1 = drink_mili_litres//(nl*n)\r\nnum2 = slices//n\r\nnum3 = p//(np*n)\r\nprint(min([num1, num2, num3]))", "l = list(map(int,input().split()))\r\nprint(int(min( (l[1]*l[2])/l[6] , l[3]*l[4] , l[5]/l[7])/l[0]))", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\nml=k*l\r\nno_of_toast=ml//nl\r\nno_of_slices=c*d\r\ngrams_of_salt=p//np\r\nx=min(no_of_toast,no_of_slices,grams_of_salt)//n\r\nprint(x)", "import sys\r\nLI=lambda:list(map(int,sys.stdin.readline().split()))\r\nMI=lambda:map(int,sys.stdin.readline().split())\r\nSI=lambda:sys.stdin.readline().strip('\\n')\r\nII=lambda:int(sys.stdin.readline())\r\n\r\nn, k, l, c, d, p, nl, np = MI()\r\nprint(min(k*l//nl, c*d, p//np)//n)", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\nprint(int(min(k * l / nl / n, c * d / n, p / np / n)))\r\n\r\n", "def solve():\r\n n, k, l, c, d, p, nl, np = map(int, input().split())\r\n print(min(k*l//nl, c*d, p//np)//n)\r\n\r\n\r\n# t = int(input())\r\nt = 1\r\nwhile t:\r\n solve()\r\n t -= 1\r\n", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\nm = (k * l) // nl\r\nz = c * d\r\ns = p // np\r\n\r\ny = min(m, z, s)\r\nx= y // n\r\n\r\nprint(x)", "n, k, l, c, d, p, nl, np = map(int,input().split())\r\nll = []\r\nmilliliters = (k*l)//nl\r\nlimes = c*d\r\nsalt = p/np\r\nll.append(milliliters)\r\nll.append(limes)\r\nll.append(salt)\r\nminn = min(ll)\r\nprint(int(minn/n))", "nf,nb,dq,nl,ls,sq,fd,fs=map(int,input().split())\r\ntd=(nb*dq)//fd\r\ntl=(nl*ls)\r\nts=sq//fs\r\nprint(min(td,tl,ts)//nf)", "n, k, l, c, d, p, nl, np = map(int,input().split())\r\nml = k*l\r\nt1 = ml/nl\r\nt2 = c*d\r\nt3 = p/np\r\nprint(int(min(t1,t2,t3)//n))", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\nprint(int(min(k*l/nl, c*d, p/np)//n))\r\n", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\npl=k*l/nl;cc=c*d;pp=p/np\r\nprint(int(min(pl,cc,pp)/n))", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\nx=(k*l)//nl\r\ny=c*d\r\nz=p//np\r\naa=min(x,y)\r\nprint(min(aa,z)//n)", "l = list(map(int, input().split()))\nprint(min((l[1]*l[2])//l[6], l[3]*l[4], l[5]//l[7])//l[0])", "n, k, l, c, d, p, nl, np = list(map(int, input().split()))\r\ndrink_toasts = k * l // (n * nl)\r\nlime_toasts = c * d // n\r\nsalt_toasts = p // (n * np)\r\nprint(min(drink_toasts, lime_toasts, salt_toasts))\r\n\r\n", "n_friends, n_bottle, volue, limes, dolek_in_1_lime, salt, water_for_one_tost, salt_for_one_tost = [int(x) for x in input().split()]\r\n\r\nwater = n_bottle * volue\r\nall_dolek = limes * dolek_in_1_lime\r\nwater_for_one = water // n_friends\r\ndolek_for_one = all_dolek // n_friends\r\nsalt_for_one = salt // n_friends\r\ntostes = [water_for_one // water_for_one_tost, dolek_for_one, salt_for_one // salt_for_one_tost]\r\nprint(min(tostes))", "import math\r\nn,k,l,c,d,p,nl,np=map(int,input().split())\r\na=math.floor(k*l/nl)\r\nb=c*d\r\ng=math.floor(p/np)\r\nq=min(a,b,g)\r\nprint(math.floor(q/n))", "n, k, l, c, d, p, nl, np = map(int,input().split())\r\na = (k*l)//nl\r\nb = c*d\r\ns = p//np\r\ne = min(a,b,s)//n\r\nprint(e)", "n,k,l,c,d,p,nl,np=map(int,input().split())\nprint(min((min(k*l//nl,c*d),p//np))//n)\n \t\t\t \t \t \t \t \t \t \t\t \t\t\t", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\nk=int((k*l)/nl); c*=d; p=int(p/np)\r\nprint(int(min([k, c, p])/n))", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\ni=(k*l)//nl\r\nj=(c*d)\r\nk=p/np\r\np=min(i,j,k)\r\nprint(int(p/n))", "n, k, l, c, d, p, nl, np = [int(num) for num in input().split(\" \")]\r\np1 = (k*l)//nl\r\np2 = c*d\r\np3 = p//np\r\nprint(min(p1, p2, p3)//n)\r\n", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\na=k*l\r\nb=c*d\r\na2=a//nl\r\np2=p//np\r\n\r\nprint(min(a2, b, p2) // n)", "x = input().split()\r\nx = list(map(int, x))\r\nn, k, l, c, d, p, nl, np = x[0], x[1], x[2], x[3], x[4], x[5], x[6], x[7]\r\nit = min(k * l // nl, c * d, p // np)\r\nprint(it // n)", "n,k,l,c,d,p,nl,np = map(int,input().split())\r\nmd = (k*l)// nl\r\nml = c* d\r\nms = p // np\r\nlf = min(md,ml,ms)\r\ntf = lf // n\r\nprint(tf)", "n,k,l,c,d,p,nl,np = map(int, input().split())\ndu = k*l\nlc = c*d\nlm = min(du//nl,lc,p//np)\nprint(lm//n)\n\t\t\t\t \t \t \t \t\t\t \t \t\t \t\t\t\t", "n, k, l, c, d, p, nl, np = map(int,input().split())\r\nliter_toast = int((k * l) / nl) \r\nlimes_toast = int(c * d )\r\nsalt_toast = int(p / np)\r\n\r\nif liter_toast < limes_toast and liter_toast < salt_toast :\r\n print(int(liter_toast/n))\r\nelif limes_toast < liter_toast and limes_toast < salt_toast:\r\n print(int(limes_toast/n))\r\nelse: print(int(salt_toast/n))\r\n", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\nmil = k * l // nl\r\nsli = c * d\r\nsal = p // np\r\n\r\nprint(min(mil, sli, sal) // n)\r\n", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\ng = k * l // nl\r\na = c * d\r\ns = p // np\r\nprint(min(g, a, s) // n)\r\n", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\nml_drink = k*l\r\nml_toasts_enough = ml_drink // nl\r\nlimes_enough = c*d\r\nsalt_enough = p//np\r\nans = min(ml_toasts_enough,limes_enough,salt_enough) // n\r\nprint(ans)", "#Keshika Patwari\r\n#Indian Institute Of Technology, Jodhpur\r\n# 2022\r\n# import sys\r\n# input=sys.stdin.readline\r\ndef exe():\r\n return min(c*d,p//np,(k*l)//nl)//n\r\n \r\nn,k,l,c,d,p,nl,np=map(int,input().split())\r\nprint(exe())", "'''\r\n ************************ বিসমিল্লাহির রাহমানির রাহিম\r\n\r\n بِسْمِ ٱللَّٰهِ ٱلرَّحْمَٰنِ ٱلرَّحِيمِ *********************\r\n\r\n ********************************************* Bismillahir Rahmanir Rahim\r\n'''\r\n\r\n'''************************************************************************\r\n\r\n PROBLEM :A. Soft Drinking\r\n SOLUTATOIN....\r\n\r\n ************************************************************************\r\n'''\r\n\r\nn,k,l,c,d,p,nl,np=map(int,input().split())\r\nprint(min(k*l//nl,c*d,p//np)//n)", "l=list(map(int,input().split()))\r\na=l[1]*l[2]//l[-2]\r\nb=l[3]*l[4]\r\nc=l[-3]//l[-1]\r\nprint(min(a,b,c)//l[0])", "n, k, l, c, d, p, nl, np = map(int, input().split(' ')); print(int(min(int(k * l / nl), c * d, int(p / np)) / n))", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\nx = k *l // nl\r\ny = c * d \r\na = p // np \r\nprint(min(x,y,a)//n)", "lst=list(map(int,input().split()))\r\na=lst[1]*lst[2]\r\na=a//lst[6]\r\nb=lst[3]*lst[4]\r\nc=lst[5]//lst[7]\r\nprint(min(a,b,c)//lst[0])", "n, k, l, c,d,p,x, y = map(int, input().split())\r\ntoast = k*l//x; limes = c*d; salt = p//y\r\nprint(min(toast,limes,salt)//n)", "n,k,l,c,d,p,nl,np=map(int, input().split())\r\nif 0<n>1000 or 0<k>1000 or 0<l>1000 or 0<c>1000 or 0<d>1000 or 0<p>1000 or 0<nl>1000 or 0<np>1000 :\r\n print(0)\r\nelse:\r\n a=(k*l) ; b=(a//nl) ; e=(c*d) ; f=(p//np)\r\n z=min((b//n),(e//n),(f//n))\r\n print(z)\r\n", "import math\r\nn, k, l, c, d, p, nl, np = map(int, input().split())\r\ntotal_soft_drink = k * l\r\ntotal_lime_slices = c * d\r\n\r\nbest = float('inf')\r\n\r\nbest = min(best, (total_soft_drink / n) / nl)\r\nbest = min(best, total_lime_slices // n)\r\nbest = min(best, (p // n) / np)\r\nprint(math.floor(best))\r\n", "n,k,l,c,d,p,nl,np = map(int,input().split())\r\nprint(int(min(k*l/nl , c*d , p/np)/n))", "n, k, l, c, d, p, nl, np = (int(x) for x in input().split())\r\n\r\nvol = k*l\r\n\r\nslices = c*d\r\n\r\nper_all_vol = vol//nl\r\n\r\nper_all_salt = p//np\r\n\r\na = min(slices,per_all_salt,per_all_vol)\r\n\r\nprint(a//n)", "n, k, l, c, d, p, nl, np = map(int,input().split())\r\nk*=l; c*=d\r\nk//=nl; p//=np\r\nprint(min(k,c,p)//n)", "n,k,l,c,d,p,nl,np = map(int,input().split())\r\njuiceqty = k*l\r\nnjuice = juiceqty//nl\r\nlimeslices = c*d\r\nnsalt = p//np\r\nprint(min(njuice,limeslices,nsalt)//n)", "n, k, l, c, d, p, nl, np = list(map(int,input().split()))\r\na1= k*l//nl\r\na2= c*d//1\r\na3= p//np\r\n\r\nprint(min(a1,a2,a3)//n)", "n, k, l, c, d, p, nl, np = input().split()\nn = int(n)\nk = int(k)\nl = int(l)\nc = int(c)\nd = int(d)\np = int(p)\nnl = int(nl)\nnp = int(np)\n\n\ndrink = 0\n\nif n*l >= nl and d >= 1 and n*p >= np:\n drink += 1\n\nm1 = int((k*l)/nl)\nm2 = int(c*d)\nm3 = int(p/np)\n\nprint(int(min(m1,m2,m3)/n))", "n, k, l, c, d, p, nl, np = [int(_) for _ in input().split()]\r\n\r\nnumber_of_toasts = min((k * l) // (n * nl), (c * d) // n, p // (n * np))\r\n\r\nprint(number_of_toasts)\r\n\r\n\r\n'''\r\nTotal amount of drink: k * l milliliters\r\nTotal number of lime slices: c * d\r\nTotal amount of salt: p grams\r\n\r\nMaximum number of toasts based on the amount of drink: (k * l) / (n * nl)\r\nMaximum number of toasts based on the number of lime slices: (c * d) / n\r\nMaximum number of toasts based on the amount of salt: p / (n * np)\r\n\r\n'''", "\r\nimport sys\r\nimport math\r\nfrom collections import defaultdict, deque,Counter\r\nimport random\r\nfrom functools import lru_cache \r\n\r\n\r\n \r\n# Multi \r\n \r\nout = lambda x,end='\\n' : sys.stdout.write(str(x)+end)\r\nSI = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\nMI = lambda: map(int,SI().split())\r\nII = lambda: int(SI())\r\nLI = lambda: list(MI())\r\nlcm = lambda x,y:abs(x * y) // math.gcd(x,y)\r\nFCT = lambda x:eval('*'.join([str(i) for i in range(1,x+1)])) if x>1 else 1\r\nINF = float(\"inf\")\r\n\r\n\r\ndef binary_search(n,arr):\r\n start = 0\r\n end = len(arr) - 1\r\n while start<=end:\r\n mid = (start+end) // 2\r\n if arr[mid] > n:\r\n end = mid - 1\r\n elif arr[mid] <n:\r\n start = mid + 1\r\n else :\r\n return mid\r\n return -1\r\n\r\n\r\ndef isPrime(n):\r\n for i in range(2,int(n**(1/2))+1):\r\n if n%i == 0:\r\n return False\r\n return True\r\n\r\n\r\n\r\nn,k,l,c,d,p,nl,np = MI()\r\nprint(min(k*l//nl,c*d,p//np)//n)\r\n\r\n\r\n\r\n\r\n \r\n\r\n \r\n\r\n ", "n, k,l, c, d, p, nl, np = list(map(int, input().split()))\r\ndrink = int(k * l / nl)\r\nlime = d * c\r\nsalt = int(p / np)\r\nprint(int(min(drink, lime, salt)/n))\r\n", "# Read input\r\nn, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\n# Calculate the maximum number of toasts each friend can make\r\ntoasts_drink = (k * l) // (n * nl)\r\ntoasts_lime = (c * d) // n\r\ntoasts_salt = p // (n * np)\r\n\r\n# Find the minimum of the three values\r\nresult = min(toasts_drink, toasts_lime, toasts_salt)\r\n\r\n# Print the result\r\nprint(result)\r\n", "class Solution():\r\n\tdef solve(self, n, k, l, c, d, p, nl, np):\r\n\t\tdrink_per_toast = n * nl\r\n\t\tsalt_per_toast = n * np\r\n\t\tlime_per_toast = n * 1\r\n\r\n\t\trequired_drink_per_toast = k * l // drink_per_toast \r\n\t\trequired_salt_per_toast = p // salt_per_toast\r\n\t\trequired_lime_per_toast = c * d // lime_per_toast\r\n\r\n\t\tans = min(required_lime_per_toast,\r\n\t\t\trequired_salt_per_toast,\r\n\t\t\trequired_drink_per_toast)\r\n\t\treturn ans\r\n\r\n\r\nclass Driver():\r\n\tdef __init__(self):\r\n\t\tself._solver = Solution()\r\n\r\n\tdef drive(self):\r\n\t\tn, k, l, c, d, p, nl, np = map(int, input().strip().split(\" \"))\r\n\t\tans = self._solver.solve(n, k, l, c, d, p, nl, np)\r\n\t\tprint(ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\tDriver().drive()", "n, k, l, c, d, p, nl, np = map(int,input().split())\r\nml = k*l\r\nsl = c*d\r\nprint(min(ml//nl, sl, p//np)//n)\r\n \r\n", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\nservings = min(k*l//nl, c*d, p//np) // n\r\nprint(servings)\r\n", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\n \r\na = k*l\r\nslices = c*d\r\n \r\ndrink = a//(nl*n)\r\nlemons = slices//n\r\nsalt = p//(np*n)\r\n \r\nres_list = [drink,lemons,salt]\r\nprint(min(res_list))\r\n ", "n, k, l, c, d, p, nl, np = map(int,input().split())\r\n\r\ndrinks = (k*l)//nl\r\nlimes = c*d\r\nsalt = p//np\r\n\r\nprint(min(drinks,limes,salt)//n)", "n,k,l,c,d,p,nl,np=list(map(int,input().split()))\r\ny=[]\r\ny.append(int((k*l)/nl))\r\ny.append(c*d)\r\ny.append(p/np)\r\nprint(int(min(y)/n))", "n,k,l,c,d,p,nl,np = map(int,input().split())\r\nmilk = (k*l)//nl\r\nslices = (c*d)\r\nsalt = (p//np)\r\nprint(min(milk,slices,salt)//n)", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\nkol_gaz=k*l\r\nkol_limon=c*d\r\nkol_s=kol_gaz//nl//n\r\nvsego_s=kol_s#*n\r\nkol_sol=p//n//np\r\nvsego_sol=kol_sol#*n\r\nkol_limon=kol_limon//n\r\n#kol_limon*=n\r\nprint(min(kol_limon,vsego_s,vsego_sol))", "n,k,l,c,d,p,nl,np = map(int,input().split())\r\ngazirovka = k*l\r\nlime = c*d\r\nall_tosts = min(gazirovka//nl,lime,p//np)\r\nprint(all_tosts//n)", "n, k, l, c, d, p, nl, np = map(int, input().split())\n\nml = (k * l)//nl\nslices = c * d\nsalt = p // np\n\nprint(min(ml, slices, salt)//n)\n\t\t\t\t \t\t \t\t \t\t \t\t \t\t\t \t \t\t", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\nt=(k*l)//nl\r\nlimes=c*d\r\nsalt=p//np\r\nans=min(t,limes,salt)\r\nprint(ans//n)\r\n \r\n", "\r\nn,k,l,c,d,p,nl,np = map(int,input().split())\r\nres1 = (k*l/nl)\r\nres2 = c*d\r\nres3 = (p/np)\r\nres =int (min(res1,res2,res3)/n)\r\nprint(res)", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\nk *= l\r\nc *= d\r\nnl*=n\r\nnp*=n\r\nprint(min(k//nl, c//n, p//np))\r\n", "n, k, l, c, d, p, nl, np = map(int,input().split(\" \"))\r\ndrink = ((k*l)//n)//nl\r\nlime = (c*d)//n\r\nsalt = (p//n)//np\r\nprint(min(drink,lime,salt))", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\ne=(k*l)//nl\r\nf=c*d\r\ng=p//np\r\na=min(e,g)\r\nprint(min(a,f)//n)\r\n", "def main():\r\n n, k, l, c, d, p, nl, np = map(int, input().split(\" \"))\r\n drink = (k * l) // (n * nl)\r\n limes = (c * d) // n\r\n salt = p // (n * np)\r\n\r\n ans = min(drink, limes, salt)\r\n print(ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "a,b,c,d,e,f,g,h=map(int,input().split())\r\nt=(b*c)//g\r\nr=d*e\r\nw=f//h\r\nprint(min(t,r,w)//a)\r\n\r\n", "n, k, l, c, d, p, nl, np = list(map(int, input().split()))\r\na = []\r\na.append((k*l)//nl)\r\na.append(c*d)\r\na.append(p//np)\r\nprint(min(a)//n)", "n, k, l, c, d, p, nl, np = map(int, input().split())\n\n\nprint(int(min((k*l)/nl, (c*d), p/np)/n))", "data = input()\r\ndata_arr = [\r\n int(each.strip())\r\n for each in data.split()]\r\n\r\nn = data_arr[0]\r\nk = data_arr[1]\r\nl = data_arr[2]\r\nc = data_arr[3]\r\nd = data_arr[4]\r\np = data_arr[5]\r\nnl = data_arr[6]\r\nnp = data_arr[7]\r\nmini_ans =min(k * l // nl, c * d)\r\nans = min(mini_ans, p//np)\r\nprint(ans//n)\r\n", "n, k, l, c, d, p, nl, np = list(map(int, input().strip().split()))\r\n\r\nt_nl = k * l\r\nlime = c * d\r\n\r\ntoast = 0\r\nwhile(t_nl >= n*nl and lime >= n and p >= n*np):\r\n\tt_nl -= n*nl\r\n\tlime -= n\r\n\tp -= n * np\r\n\ttoast += 1\r\nprint(toast)", "n,k,l,c,d,p,nl,np = map(int,input().split())\nprint(min(c*d//n,k*l//(nl*n),p//(np*n)))", "n, k, l, c, d, p, nl, np = map(int, input().split())\n\nprint(int(min(k * l / nl, c * d, p / np)/n))\n", "n, k, l, c, d, p, nl, np = list(map(int, input().split()))\r\ndrink = k * l\r\nlimes = c * d\r\ncount = 0\r\nwhile p > 0 and drink > 0 and limes > 0:\r\n p -= (np * n)\r\n drink -= (nl * n)\r\n limes -= n\r\n count += 1\r\nif p < 0 or drink < 0 or limes < 0:\r\n count -= 1\r\nprint(count)", "data_input = input().split(\" \")\r\nn = int(data_input[0]) # friends\r\nk = int(data_input[1]) # bottles\r\nl = int(data_input[2]) # milimiters\r\nc = int(data_input[3]) # limes\r\nd = int(data_input[4]) # slices\r\np = int(data_input[5]) # salt\r\nnl = int(data_input[6]) # toast: quantity of milimiters of drink\r\nnp = int(data_input[7]) # toast: quantity of salt\r\n\r\n# toast = (k*l) / nl, (c*d), (p/np)\r\nvalue1 = (k*l) / nl\r\nvalue2 = c*d\r\nvalue3 = p/np\r\nprint(int(min(value1, value2, value3) // n))", "'''\n\n Online Python Compiler.\n Code, Compile, Run and Debug python program online.\nWrite your code in this editor and press \"Run\" button to execute it.\n\n'''\n\nn,k,l,c,d,p,nl,np=map(int,input().split())\nml=(k*l)//nl\nlime=c*d\nsalt=p//np\nprint(min(ml,lime,salt)//n)\n", "n,k,l,c,d,p,nl,np=list(map(int,input().split()))\r\ndri=k*l\r\nlem=c*d\r\nr_d=dri//nl\r\nr_s=p//np\r\nprint(min(r_d,r_s,lem)//n)", "n, k, l, c, d, p, nl, np = [int(i) for i in input().split()]\r\nmill = k * l\r\nmill_tost = mill // nl\r\nlime_slices = c * d\r\nsolt_tost = p // np\r\nreal_tost = min(mill_tost, lime_slices, solt_tost) // n\r\nprint(real_tost)", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\nm1=(k*l)//nl\r\nm2=c*d\r\nm3=p//np\r\nm4=min(m1,m2,m3)\r\nprint(m4//n)", "x,k,l,o,d,p,a,b=map(int,input().split());print(min(k*l//a,o*d,p//b)//x)", "n, k, l, c, d, p, nl, np=map(int,input().split())\r\na=k*l/nl\r\nb=c*d\r\ng=p/np\r\nprint(int(min(a,b,g)//n))", "inputs = list(map(int,input().split()))\r\n'''the number of drinks that can be provided \r\n are determined by three factors 1limes 2salt 3drinks'''\r\n#variable abbrivation \r\n#n_l needed lime || a_d available drink \r\nn_l = inputs[0]\r\n\r\na_d = inputs[1]*inputs[2]\r\na_l = inputs[3]*inputs[4]\r\na_s = inputs[5]\r\n\r\n\r\n'''total number of times people who can drink \r\nsoftdrink alone'''\r\nd = (a_d//inputs[6])//inputs[0]\r\n'''total number oftimes people who eat salt\r\n alone'''\r\ns = (a_s//inputs[7])//inputs[0]\r\n'''total number of times people eat limes alone'''\r\nl = a_l//inputs[0]\r\n# print(d)\r\n# print(s)\r\n# print(l)\r\nif d<=s and d<=l:\r\n print(d)\r\nelif s<=d and s<=l:\r\n print(s)\r\nelse:\r\n print(l)", "s=input()\r\ns=s.split()\r\nl=list(s)\r\nfor i in range(0,len(l)):\r\n l[i]=int(l[i])\r\nt1=(l[1]*l[2])/l[6]\r\nt2=l[3]*l[4]\r\nt3=l[5]/l[7]\r\n\r\nk=[]\r\nk.append(t1)\r\nk.append(t2)\r\nk.append(t3)\r\nmini=min(k)\r\ntoast=0\r\ntoast=mini/l[0]\r\n\r\nprint(int(toast))", "n,k,l,c,d,p,nl,np = [int(a) for a in input().split()]\r\nprint((min(((k*l)//nl), (c*d), (p//np)))//n)\r\n\r\n", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\nout= min(min(k * l // nl, c * d), p // np) // n \r\nprint(out)", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\n# Calculate the maximum number of toasts that can be made with the available resources\r\nml = k * l # total milliliters of the drink\r\nslices = c * d # total number of lime slices\r\nsalt = p # total grams of salt\r\ntoasts = min(ml // nl, slices, salt // np)\r\n\r\n# Divide the number of toasts by the number of friends to get the answer\r\nprint(toasts // n)\r\n", "n, k, l, c, d, p, nl, np = map(int, input().split(' '))\r\n\r\na = l*k\r\n\r\nb = a//nl\r\nlime = c*d\r\nsolt = p//np\r\n\r\n\r\nretult = min(b,lime,solt)\r\nprint(retult//n)", "\r\nline = [int(i) for i in input().split()]\r\n\r\nn, k, l, c, d, p, nl, np = tuple(line)\r\n\r\ndrink = k*l\r\nlimonSlices = c*d\r\ntostdrink = drink//nl\r\ntostlimon = limonSlices\r\ntostsalt = p//np\r\nprint((min(tostsalt, tostdrink, tostlimon))//n)", "def f(polygon):\r\n drinkml = data[1]*data[2]//data[6]\r\n sandw = data[3]*data[4]\r\n salt = data[5]//data[7]\r\n return min(drinkml//data[0],sandw//data[0],salt//data[0])\r\n \r\n\r\n\r\ndata = input()\r\ndata = [int(i) for i in data.split(\" \")]\r\nprint(f(data))", "xo,ko,lo,oo,do,po,ao,bo=map(int,input().split());print(min(ko*lo//ao,oo*do,po//bo)//xo)", "arr = list(map(int,input().split()))\r\n\r\nn1 = int((arr[1]*arr[2])/arr[6])\r\nn2 = int(arr[3]*arr[4])\r\nn3 = int(arr[5]/arr[7])\r\n\r\nprint(int(min(n1,n2,n3)/arr[0]))", "# https://codeforces.com/problemset/problem/151/A\r\n\r\ndef main():\r\n n, k, l, c, d, p, nl, np = map(int, input().split(' '))\r\n a1 = k * l // nl\r\n a2 = c * d\r\n a3 = p // np\r\n print(min(a1, a2, a3) // n)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n, k, a, c, d, p, nl, np=map(int,input().split())\r\nl=[]\r\nl.append(k*a//nl)\r\nl.append(c*d)\r\nl.append(p//np)\r\n# print(l)\r\nprint(min(l)//n)", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\ntost = (k * l) // nl\r\nlaim = c * d\r\nsol = p // np\r\nprint(min(tost, laim, sol) // n)\r\n", "def main(n, k, l, c, d, p, nl, np):\r\n return min(k * l // nl, c * d, p // np) // n\r\n\r\nif __name__ == \"__main__\":\r\n n, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\n print(main(n, k, l, c, d, p, nl, np))", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\nprint(int(min(int((k*l)/nl),(c*d),(p/np))/n))\r\n", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\n# Calculate how many milliliters of drink are available\r\ndrink_ml = k * l\r\n\r\n# Calculate how many slices of lime are available\r\nlime_slices = c * d\r\n\r\n# Calculate how much salt is available\r\nsalt_g = p\r\n\r\n# Calculate how many toasts can be made based on drink_ml, lime_slices, and salt_g\r\ntoasts = min(drink_ml // (n * nl), lime_slices // n, salt_g // (n * np))\r\n\r\nprint(toasts)\r\n", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\nL=c*d#no of limes\r\nQ=k*l#ml of drink\r\nA=L#lime rounds\r\nB=Q/nl#drink rounds\r\nC=p/np#salt rounds\r\nprint(int(min(A,B,C)/n))\r\n\r\n", "k = list(map(int,input().split()))\r\ntdrink = k[1]*k[2]\r\ntslice = k[3]*k[4]\r\ntsalt = k[5]\r\nnl = k[6]\r\nnp = k[7]\r\n\r\nprint( min(tsalt // np ,tdrink //nl, tslice) // k[0])", "n, k, l, c, d, p, nl, np = map(int,input().strip().split())\r\nprint(min((k*l)//(n * nl),(c*d)//n,p//(n*np)))", "[n,k,l,c,d,p,nl,np]=list(map(int,input().split(\" \")))\r\na=(k*l)//nl\r\nb=c*d\r\ns=p//np\r\nprint(min(a,b,s)//n)\r\n\r\n\r\n\r\n", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\n# calculate the number of toasts that can be made\r\ntoasts = min(k*l // nl, c*d, p // np)\r\n\r\nprint(toasts // n)", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\na=k*l\r\nb=(a)//(nl)\r\ne=c*d\r\nf=p//np\r\nh=min(b,e,f)//n\r\nprint(h)\r\n", "n,k,l,c,d,p,nl,np=map(int,input().split())\nprint(int(min(min(k*l/nl,c*d),p/np)/n))\n\t \t \t \t\t \t \t\t \t", "# This winter is so cold in Nvodsk! A group of n friends decided to buy k bottles of a soft drink called\r\n# \"Take-It-Light\" to warm up a bit. Each bottle has l milliliters of the drink. Also they bought c limes\r\n# and cut each of them into d slices. After that they found p grams of salt.\r\n# To make a toast, each friend needs nl milliliters of the drink, a slice of lime and np grams of salt. The friends\r\n# want to make as many toasts as they can, provided they all drink the same amount. How many toasts can each friend\r\n# make?\r\n#\r\n# Input\r\n# n -- number of friends\r\n# k -- number of bottles\r\n# l -- milliliter per bottle\r\n# c -- number of limes\r\n# d -- slices per lime\r\n# p -- grams of salt\r\n# (nl -- milliliter per friend , 1 slice of lime , np grams of salt ) per toast\r\n#\r\n# The first and only line contains positive integers n, k, l, c, d, p, nl, np, not exceeding 1000 and no less than 1.\r\n# The numbers are separated by exactly one space.\r\n#\r\n# Output\r\n# Print a single integer — the number of toasts each friend can make.\r\nList = [int(x) for x in input().split()]\r\nn, k, l, c, d, p, nl, np = List\r\nprint(int(min(k*l/nl, c*d/1, p/np)/n))\r\n", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\n# Calculate the limiting factor among drink, limes, and salt\r\ntoasts_by_drink = (k * l) // nl\r\ntoasts_by_limes = (c * d)\r\ntoasts_by_salt = p // np\r\n\r\n# Find the minimum of the limiting factors\r\nmin_limiting_factor = min(toasts_by_drink, toasts_by_limes, toasts_by_salt)\r\n\r\n# Calculate the number of toasts each friend can make\r\nresult = min_limiting_factor // n\r\n\r\nprint(result)\r\n\r\n", "n, k, l, c, d, p, nl, np = list(map(int, input().split()))\ndrink = ((k * l)//nl)//n\nlime = (c * d)//n\nsalt = (p//np)//n\nresult = []\nresult.append(drink)\nresult.append(lime)\nresult.append(salt)\nresult = sorted(result)\nprint(result[0])", "l=list(map(int,input().split()))\r\na = (l[1]*l[2])//l[-2]\r\nprint(min(a,l[3]*l[4],l[-3]//l[-1])//l[0])\r\n \r\n", "n, k, l, c, d, p,nl, np = map(int, input().split())\r\nx = (k * l) // nl\r\ny = (c * d) \r\nz = p // np\r\na = min(x, y, z)\r\nprint(int(a // n))", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\nnlForTosts = (k * l) // nl // n\r\ndForTosts = c * d // n\r\nnpForTosts = p // np // n\r\nprint(min(nlForTosts, dForTosts, npForTosts))\r\n", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\nresult = min(p // (n * np), min((k * l) // (n * nl), (c * d) // n))\r\nprint(result)\r\n", "s = [int(x) for x in input().split()]\r\nprint(int(min(((s[1]*s[2])//s[6]), (s[3]*s[4]), (s[5]/s[7]))/s[0]))", "# A - Soft Drinking\r\n\r\nn, k, l, c, d, p, nl, np = [int(i) for i in input().split()]\r\nprint(int(min(k*l/nl,c*d,p/np)/n))", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\na=k*l\r\nb=a//nl\r\ne=c*d\r\nf=p//np\r\nprint(min(b,e,f)//n)", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\nans1=(k*l)/nl\r\nans2=c*d\r\nans3=p/np\r\nprint(int(min(ans1,ans2,ans3)//n))", "n, k, l, c, d, p, nl, np=map(int,input().split())\r\nh=(k*l)//nl\r\nf=c*d\r\nq=p//np\r\na=min(h,f,q)\r\na=a//n\r\nprint(a)", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\ntoast = k*l//nl\r\nlimes = c*d\r\nsalt = p//np\r\nprint(min(toast, limes, salt)//n)", "h, k, l, c, d, p, hl, hp = map(int, input().split())\r\ndr = (k * l) // hl\r\nli = (c * d)\r\nsa= p // hp\r\nop = min(dr,li,sa) // h\r\nprint(op)", "inputs = [int(i) for i in input().split(\" \")]\r\n\r\nn = inputs[0]\r\nk = inputs[1]\r\nl = inputs[2]\r\nc = inputs[3]\r\nd = inputs[4]\r\np = inputs[5]\r\nnl = inputs[6]\r\nnp = inputs[7]\r\n\r\nmlToasts = (k * l) // nl\r\nlimeToasts = c * d\r\nsaltToasts = p // np\r\n\r\ntotalToasts = min(mlToasts, limeToasts, saltToasts) // n\r\nprint(totalToasts)", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\npl = c * d\r\nmls = l * k\r\npd = mls // nl\r\nps = p // np\r\ntoasts = min(pl, min(ps, pd))\r\nprint(toasts // n)", "n,k,l,c,d,p,nl,np=list(map(int,input().split()))\r\na=k*l//nl\r\nb=c*d\r\nc=p//np\r\nprint(min(a,b,c)//n)", "n, k, l, c, d, p, nl, np = [int(x) for x in input().split()]\r\n\r\ndrink = k * l\r\nt = [drink // nl, c * d, p // np]\r\nt.sort()\r\nres = t[0]//n\r\nprint(res)\r\n\r\n\r\n", "n, k, l, c, d, p, nl, np = map(int ,input() .split())\nq1 = k * l\nq2 = q1 / nl\nq3 = c * d\nq4 = p / np\nprint(int(min(q2 ,q3 ,q4) / n))\n\n \t \t \t\t \t \t\t\t \t\t \t \t", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\nr1=(k*l)//nl\r\nr2=(c*d)\r\nr3=p//np\r\nr=[r1,r2,r3]\r\nr.sort()\r\nres=r[0]\r\nprint(res//n)\r\n\r\n", "# -*- coding: utf-8 -*-\n\"\"\"1409A.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1YAcE_C3NXDvEY0NY_rHyte8StemSWBIK\n\"\"\"\n\nn,k,l,c,d,p,nl,np=map(int,input().split())\ndrink=(k*l)//(n*nl)\nlime=c*d//n\nsalt=p//(n*np)\ntoasts=min(drink,lime,salt)\nprint(toasts)", "n,k,l,c,d,p,nl,np=list(map(int,input().strip().split()))\r\nprint(min((k*l)//(nl*n),(c*d)//n,p//(n*np)))", "#n, k, l, c, d, p, nl, np = map(int,input().split())\r\n\r\n#print(min(l * k // n,c * d,p // np) // n)\r\n\r\nn, k, l, c, d, p, nl, np = map(int, input().split())\r\n \r\nans = 0\r\n \r\nprint(min(l*k//nl, c*d, p//np)//n)\r\n\r\n", "l=list(map(int,input().split()))\r\na=(l[1]*l[2])//l[-2]\r\nb=l[3]*l[4]\r\nc=l[-3]//l[-1]\r\nx=min(a,b,c)\r\nprint(x//l[0])\r\n", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\namount = (k * l) / nl\r\nlimes = (c * d)\r\nsalt = (p / np)\r\nanswer = int(min(amount, limes, salt) // n)\r\nprint(answer)\r\n", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\nq=c*d\r\nw=(k*l)/nl\r\ny=p/np\r\nans=(min(q,w,y))/n\r\nprint(int(ans))", "\r\ninp = list(map(int, input().split()))\r\nprint(min(inp[1]*inp[2]//inp[6],inp[3]*inp[4],inp[5]//inp[7])//inp[0])\r\n\r\n", "import math\r\nn,k,l,c,d,p,nl,np = map(int,input().split())\r\ntotal_volume_of_drink = k*l\r\ndrink_to_each_friend = math.floor(total_volume_of_drink/n)\r\nif drink_to_each_friend < nl:\r\n print(0)\r\nelse:\r\n no_of_toast_by_drink = math.floor(drink_to_each_friend/nl)\r\n lime_slices = c*d\r\n no_of_toast_by_lime_slices = math.floor(lime_slices/n)\r\n salt_to_each_friend= math.floor(p/n)\r\n if salt_to_each_friend<np:\r\n print(0)\r\n else:\r\n no_of_toast_by_salt = math.floor(salt_to_each_friend/np)\r\n no_of_toasts = min(no_of_toast_by_drink,no_of_toast_by_lime_slices,no_of_toast_by_salt)\r\n print(no_of_toasts)", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\ntotal_drink_in_ml = k*l\r\ntotal_lime_slices = c*d\r\ntotal_salt_in_gram = p\r\none_salt = np\r\none_drink = nl\r\none_slice = 1\r\ntotal_list = [total_drink_in_ml, total_lime_slices, total_salt_in_gram]\r\none_list = [one_drink, one_slice, one_salt]\r\neach_person_list = [i//n for i in total_list]\r\nans_list = []\r\nfor i in range(len(one_list)):\r\n ans_list.append(each_person_list[i]//one_list[i])\r\nprint(min(ans_list))\r\n\r\n", "a,b,c,d,e,f,g,h=map(int,input().split())\nq=b*c\nw=q/g\ne=d*e\nr=f/h\nprint(int(min(w,e,r)/a))\n\n\t \t \t \t\t \t\t\t\t \t\t\t\t \t \t\t\t", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\nm1=(k*l)//nl//n\r\nm2=c*d//n\r\nm3=p//np//n\r\nprint(min(m1,m2,m3))", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\ntdrink=(k*l)//(n*nl)\r\ntlime=(c*d)//n\r\ntsalt=p//(n*np)\r\nmin_t=min(tdrink,tlime,tsalt)\r\nprint(min_t)\r\n", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\ndrink=(k*l)//(n*nl)\r\nlime=c*d//n\r\nsalt=p//(n*np)\r\ntoasts=min(drink,lime,salt)\r\nprint(toasts)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Mar 29 18:10:09 2023\r\n\r\n@author: Srusty Sahoo\r\n\"\"\"\r\n\r\nn,k,l,c,d,p,nl,np=num=map(int,input().split())\r\nx=(k*l)//(n*nl)\r\ny=(c*d)//n\r\nz=(p)//(np*n)\r\nprint(min(x,y,z))", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\nnum_drinks = (k * l) // nl\r\nnum_slices = c * d\r\nnum_salt = p // np\r\nnum_toasts = min(num_drinks, num_slices, num_salt)\r\n\r\nprint(num_toasts // n)\r\n", "n, k, l, c, d, p, nl, np = list(map(int, input().split()))\n\na = k * l\nb = a // nl\nprint(min(b, c * d, p // np) // n)\n", "# Whoever made this question was high on vibranium..............\r\n\r\n# A group of 'n friends'\r\n\r\n# Decided to buy 'k bottles'\r\n# Each bottle has 'l milliliters'\r\n\r\n# They bought 'c limes' \r\n# Cut each of them into 'd slices' \r\n\r\n# They found 'p grams of salt'\r\n\r\n# To make a toast = Each friend needs nl milliliters of the drink, a slice of lime and np grams of salt.\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n import math\r\n\r\n n, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\n bottleToast = (k*l)/nl\r\n limeToast = (c*d)\r\n saltToast = (p)/np\r\n\r\n print(math.floor(min(bottleToast, limeToast, saltToast)/n))\r\n\r\n", "n, k, l, c, d, p, nl, np = list(map(int, input().split()))\r\n\r\ndrink_toasts = (k*l)//nl\r\nlime_toasts = c * d\r\nsalt_toasts = p//np\r\n\r\nprint( min([drink_toasts,lime_toasts, salt_toasts])//n)", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\nt1 = k * l\r\nt2 = c * d\r\nt3 = p\r\nt = min(t1 // nl, t2, t3 // np)\r\nprint(t // n)\r\n\r\n\r\n\r\n\r\n", "n,k,l,c,d,p,nl,np = list(map(int,input().split()))\r\nmc = c*d\r\nmp = p/n\r\nml = k*l/n\r\nll = ml//nl\r\ncc = mc//n\r\npp = mp//np\r\nprint(int(min(ll,cc,pp)))", "#SoftDrink\r\n\r\nn, k, l, c, d, p, nl, np = map(int,input().split())\r\n\r\nResult_list = []\r\nSecondResultList = []\r\n\r\nFirst_value = k * l // nl\r\nResult_list.append(First_value)\r\nSecond_value = c * d\r\nResult_list.append(Second_value)\r\nThird_value = p // np\r\nResult_list.append(Third_value)\r\n\r\nfor value in Result_list:\r\n SecondResultList.append(value//n)\r\n\r\nprint(min(SecondResultList))\r\n\r\n\r\n", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\nll=[((k*l/nl)//1),c*d,(p/np)//1]\r\nprint(int(min(ll)/n))", "import math\r\narr = list((int(x) for x in (input().split(\" \"))))\r\nif(arr[0] == 0 ):\r\n print(0)\r\nelse:\r\n drink_toast =(arr[1]*arr[2])/arr[6]\r\n lime_toast = (arr[3]*arr[4])\r\n if(lime_toast == 0 or drink_toast==0):\r\n print(0)\r\n else:\r\n if (arr[7] == 0):\r\n ans = min(math.floor(drink_toast),lime_toast)/arr[0]\r\n print(math.floor(ans))\r\n else:\r\n salt_toast = arr[5]/arr[7]\r\n ans = min(math.floor(drink_toast),lime_toast,math.floor(salt_toast))/arr[0]\r\n print(math.floor(ans))", "import math\n\n[n, k, l, c, d, p, nl, np] = list(map(int, input().split(\" \")))\n\nmilliliters = k*l #20\nslices = c * d # 10 * 8\nsalt = p # 100\n\nmilliliters_needed = nl\nslices_needed = 1\nsalt_needed = np\n\nmaterials = [milliliters / milliliters_needed, slices / slices_needed, salt / salt_needed]\n\nprint(int(math.floor(min(materials)) / n))\n", "n, k, l, c, d, p, nl, np = map(int,input().split())\r\n\r\na = p // np\r\nb = c*d\r\ne = k*l // nl\r\n\r\nprint(min(a, b, e)//n)", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\nsoda = k * l / nl\r\nlaim = c * d\r\nsalt = p / np\r\nans = min(soda // n, laim // n, salt // n)\r\nprint(int(ans))", "nums = list(map(int,input().split()))\r\n\r\nlitter = (nums[1] * nums[2]) // nums[6]\r\n\r\nlime = nums[3] * nums[4]\r\n\r\nsalt = nums[5] // nums[7]\r\n\r\nprint(min(litter,lime,salt) // nums[0])", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\na=c*d\r\nb=(k*l)//nl\r\nc=p//np\r\nm=min(a,b,c)\r\nprint(m//n)", "lst = input().split()\r\nlst= [eval(i) for i in lst]\r\nn, k, l, c, d, p, nl, np = lst\r\nml = k*l/nl\r\nlemona = c * d\r\np = p / np\r\nprint(int((min(p, lemona, ml)) / n))\r\n", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\nq = (k * l) // nl\r\nw = (c * d)\r\ne = (p // np)\r\nprint (min(q, w, e) // n)", "import math\r\nn,k,l,c,d,p,nl,np = input().split()\r\nn = int(n)\r\nk = int(k)\r\nl = int(l)\r\nc = int(c)\r\nd = int(d)\r\np = int(p)\r\nnl = int(nl)\r\nnp = int(np)\r\nx = (k*l)/nl\r\ny = (c*d)\r\nz =(p/np)\r\nif x < y and x < z:\r\n print(math.floor(x/n))\r\nelif y < x and y < z:\r\n print(math.floor(y/n))\r\nelse:\r\n print(math.floor(z/n))", "person, bottle, litr, lime, slice, gram, litrofdrink,grofsalt = map(int, input().split())\r\na1=int(bottle*litr)\r\na=int(a1/litrofdrink)\r\nb=int(lime*slice)\r\nc=int(gram/grofsalt)\r\nprint(int(min(a,b,c)/person))", "n,k,l,c,d,p,nl,np=tuple(map(int,input().split()))\r\ntoast=min((k*l)//nl,c*d,p//np)\r\nprint(toast//n)", "n, k, l, c, d, p, nl, nd = map(int, input().split())\r\n\r\ntoasts_with_drink = (k * l) // (n * nl)\r\ntoasts_with_lime = (c * d) // n\r\ntoasts_with_salt = p // (n * nd)\r\nmax_toasts = min(toasts_with_drink, toasts_with_lime, toasts_with_salt)\r\n\r\nprint(max_toasts)", "# import math\r\n# import re\r\n# import random\r\ndef solve():\r\n t=1\r\n # t = int(input())\r\n while(t):\r\n t-=1\r\n #n = int(input())\r\n n, k, l, c, d, salt, nl, np = [int(x) for x in input().split()]\r\n # s = input()\r\n slice_of_lime = c * d\r\n mili_drink = k * l\r\n toast_by_lime = int(slice_of_lime/1) \r\n toast_by_drinks = int(mili_drink/nl) \r\n toast_by_salt = int(salt/np) \r\n print(int(min(toast_by_drinks, toast_by_lime, toast_by_salt)/n))\r\n\r\n\r\n\r\n\r\n\r\nsolve()", "n, k, l, c, d, p, nl, np = [int(i) for i in input().split(\" \")]\n\nprint(min(k*l//nl, c*d, p//np)//n)\n \t\t \t \t\t \t\t \t \t \t\t", "n = list(map(int,input().split()))\r\nx = (n[1]*n[2])/n[6]\r\ny = n[3]*n[4]\r\nz = n[5]/n[7]\r\na = min(x,y,z)\r\nprint(int(a/n[0]))", "#Coder_1_neel\r\na=list(map(int,input().split()))\r\nx=min((a[1]*a[2])/a[6],a[3]*a[4],a[5]/a[7])\r\nprint(int(x/a[0]))", "n, k, l, c, d, p, nl, np = map(int,input().split())\r\ndrink = k * l \r\nlimes = c * d\r\nans = min(drink // nl , limes , p // np) // n \r\nprint(ans)", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\nr=min((k*l)/nl,c*d,p/np)\r\nprint(int(r/n))", "#151A\r\nn=list(map(int,input().split()))\r\nnuoc=int(n[1]*n[2]/(n[0]*n[6]))\r\nchanh=int(n[3]*n[4]/(n[0]*1))\r\nmuoi=int(n[5]/(n[0]*n[7]))\r\n\r\nprint(min(nuoc,chanh,muoi))\r\n", "n, k, l, c, d, p, nl, np=map(int,input().split())\r\nx1=(k*l)//nl\r\nx2=c*d\r\nx3=p//np\r\nprint(min(x1,x2,x3)//n)\r\n", "friends,bottles,mililiters,limes,slices,salt,nl,np=map(int,input().split())\r\ndrink = bottles*mililiters\r\ndrink = int(drink/nl)\r\nlimes = limes*slices\r\nsalt = salt/np\r\ntoast = min(drink, limes, salt)\r\nprint(int(toast/friends))\r\n", "a = list(map(int, input().split()))\r\n\r\nn, k, l, c, d, p, nl, np = a[0], a[1], a[2], a[3], a[4], a[5], a[6], a[7]\r\n\r\nq = k*l // nl\r\nw = c*d\r\ne = p // np\r\nprint(min(q,w,e)//n)", "n, k, l, c, d, p, nl, np=map(int,input().split())\r\nf1=(k*l)//nl\r\nf2=(c*d)\r\nf3=p/np\r\nprint(int(min(f1,f2,f3)/n))", "n,k,l,c,d,p,nl,np=[ int(i) for i in input().split(\" \")]\r\nx=(l*k/nl)/n\r\ny=c*d/n\r\nz=p/(np*n)\r\n\r\nif x<=y and x<=z:\r\n print(int(x))\r\nelif y<=x and y<=z:\r\n print(int(y))\r\nelse:\r\n print(int(z))", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\nf = k * l // nl\r\ns = c * d\r\nt = p // np\r\n\r\nprint(min(f, s, t) // n)\r\n", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\nprint(min(min(k * l // nl, c * d), p // np) // n)", "n, k, l, c, d, p, nl, np = map(int, input().split())\n\ndrink = (k * l) // nl\nlimes = c * d\nsalt = p // np\n\nprint(min(drink, limes, salt) // n)", "z = []\r\nw = []\r\nz[0:] = map(int,input().split())\r\nw.append((z[1] * z[2] // z[6]) // z[0])\r\nw.append((z[3] * z[4]) // z[0])\r\nw.append((z[5] // z[7]) // z[0])\r\nprint(min(w))", "x,k,l,q,d,p,a,b=map(int,input().split())\r\nprint(min(k*l//a,q*d,p//b)//x)", "n, k, l, c, d, p, nl, np=map(int,input().split())\r\n\r\nml=(k*l)//nl\r\nlimes=(c*d)\r\nsalt=p//np\r\n\r\nans=min(ml,limes,salt)\r\n\r\nprint(ans//n)\r\n\r\n", "z,uu,l,c,d,p,vv,b=map(int,input().split(\" \"))\r\nprint(min(uu*l//vv,c*d,p//b)//z)", "n, k, l, c, d, p, nl, np = map(int, input().split())\ntotal_drink = k * l # ml\nlimes = c * d\ntoasts = total_drink // nl\nmax_salt_toasts = p // np\n\nprint(min(toasts, limes, max_salt_toasts)//n)\n", "n, k, l, c, d, p, nl, np = tuple(map(int,input().split()))\nprint(min((k*l)//nl,c*d, p//np)//n)", "\r\n\r\nch=input()\r\nnb=1\r\nfor i in range(len(ch)):\r\n if ch[i]==\" \":\r\n nb=nb+1\r\n \r\nch=ch+\" \"\r\nt=[]\r\nfor i in range(nb):\r\n t.append(int(ch[:ch.find(\" \")]))\r\n ch=ch[ch.find(\" \")+1:]\r\ns1=(t[1]*t[2])//t[6]\r\ns2=t[3]*t[4]\r\ns3=t[5]//t[7]\r\nprint( min(s1,s2,s3)//t[0])\r\n \r\n \r\n\r\n", "elements = [int(el) for el in input().split(\" \")]\r\nall = elements[1] * elements[2] // elements[6]\r\nlimes = elements[3] * elements[4]\r\nsalt = elements[5] // elements[7]\r\nans = min(all, limes, salt) // elements[0]\r\nprint(ans)", "'''\r\n#list(map(int,input().split()))'''\r\nn,k,l,c,d,p,nl,np=list(map(int,input().split()))\r\nprint(min([((k*l)//nl)//n,(c*d)//n,(p//np)//n]))\r\n", "import sys, threading\r\nimport math\r\nfrom math import log2,floor\r\nimport heapq\r\nfrom collections import defaultdict,deque\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\nn, k, l, c, d, p, nl, np = invr()\r\nbottel = (k*l)//nl\r\nlime = c*d\r\nsalt = p//np\r\nprint(min(bottel,lime,salt)//n)\r\n \r\n# def main(): \r\n# threading.stack_size(1 << 27)\r\n# sys.setrecursionlimit(1 << 30)\r\n# main_thread = threading.Thread(target=main)\r\n# main_thread.start()\r\n# main_thread.join()", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\ntoasts_drink = (k * l) // (n * nl)\r\ntoasts_lime = (c * d) // n\r\ntoasts_salt = p // (n * np)\r\nmax_toasts = min(toasts_drink, toasts_lime, toasts_salt)\r\nprint(max_toasts)\r\n", "def toasts_per_friend(n, k, l, c, d, p, nl, np):\r\n \r\n max_toasts_drink = k * l // (n * nl)\r\n max_toasts_lime = c * d // n\r\n max_toasts_salt = p // (n * np)\r\n\r\n \r\n return min(max_toasts_drink, max_toasts_lime, max_toasts_salt)\r\n\r\n\r\nn, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\nprint(toasts_per_friend(n, k, l, c, d, p, nl, np))\r\n", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\nx = k * l\r\ny = c * d\r\ns = p\r\nt = min(x // nl, y // 1, s // np) // n\r\nprint(t)", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\na = (k*l)//nl\r\nb = p//np\r\nm = c*d\r\nans = min(a, min(b, m))//n\r\nprint(ans)", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, k, l, c, d, p, nl, np = map(int, input().split())\r\nx = k * l // nl\r\ny = c * d\r\nz = p // np\r\nans = min(x, y, z) // n\r\nprint(ans)", "L1= [int(x) for x in input().split(\" \")]\r\n\r\nn=L1[0] # no of friends\r\nb=L1[1] # no of bottles\r\nbl=L1[2] # amount of daru in one bottle\r\nnimbu=L1[3]\r\nslices=L1[4] # each lime slices\r\nsugar=L1[5]\r\n\r\nnbl=L1[6]\r\nnsugar=L1[7]\r\n\r\ntbl=bl*b # total daru available\r\nnum1=tbl//nbl\r\nnum2=sugar//nsugar\r\nnum3=nimbu*slices\r\nL2=[num1,num2,num3]\r\n#print(min(L2))\r\nprint(min(L2)//n)\r\n", "n,k,l,c,d,p,nl,np=(map(int,input().split()))\r\n\r\nt=k*l\r\ntoast=k*l/nl\r\nlimes=c*d\r\nsalt=p/np\r\n\r\nans=min(min(toast,limes),salt)/n\r\n\r\nprint(int(ans))", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\nk=k*l\r\nk=k//nl\r\nc=c*d\r\np//=np\r\nprint(min(k,c,p)//n)", "import math\r\nn, k, l, c, d, p, nl, np =map(int, input().split())\r\nfirst = (k*l)//nl\r\nsecond = c*d\r\nthird = (p//np)\r\nprint(min(first,second,third)//n)\r\n", "var = input().split()\r\n# var = \"5 100 10 1 19 90 4 3\".split()\r\n\r\ndrinks = (int(var[1]) * int(var[2]))//int(var[6])\r\n\r\nlimes = int(var[3]) * int(var[4])\r\n\r\nsalt = int(var[5])//int(var[7])\r\n\r\nmyList = [drinks,limes,salt]\r\nmin_toast = myList[0]\r\nfor i in myList:\r\n if i < min_toast:\r\n min_toast = i\r\n\r\nprint(int(min_toast//int(var[0])))", "n, k, l, c, d, p, nl, np=map(int,input().split())\r\na=(k*l)//nl\r\nb=c*d\r\ns=p//np\r\nans=min(a,b,s)\r\nres=ans//n\r\nprint(res)", "import math\r\nmin = 1000\r\narray = []\r\nd = input()\r\nnum = \"\"\r\nfor count in range(0, len(d), 1):\r\n if d[count] != \" \":\r\n num = num + d[count]\r\n else:\r\n array.append(int(num))\r\n num = \"\"\r\narray.append(int(num))\r\nif array[1] * array[2] / array[6] < min:\r\n min = array[1] * array[2] / array[6]\r\nif array[3] * array[4] < min:\r\n min = array[3] * array[4]\r\nif array[5] / array[7] < min:\r\n min = array[5] / array[7]\r\nprint(math.floor(min / array[0]))", "import math\r\narr = input()\r\nn,k,l,c,d,p,nl,np=[int(x) for x in arr.split()]\r\nans = math.floor(min(math.floor(k*l/nl),c*d,p/np)/n)\r\nprint(ans)\r\n", "a,b,c,d,e,f,g,h=map(int,input().split())\r\nx=b*c\r\ny=x//g\r\nz=d*e\r\nq=f//h\r\nprint(min(y,z,q)//a)", "a,b,c,d,e,f,g,h=map(int,input().split())\r\nx=(b*c)/g\r\ny=d*e\r\nz=f/h\r\nm=min(x,y,z)\r\nprint(int(m//a))", "# BOOGEYMAN >>> Version 11.0\nimport os, sys, math, itertools, bisect\nfrom string import ascii_lowercase, ascii_uppercase\nfrom collections import deque, defaultdict, OrderedDict, Counter\nii,si = lambda : int(input()), lambda : input() \nmi, msi = lambda : map(int,input().strip().split(\" \")), lambda : map(str,input().strip().split(\" \")) \nli, lsi = lambda : list(mi()), lambda : list(msi())\n\ndef BoogeyMan() -> None:\n '''\n Query\n '''\n def kangaroo(x1, v1, x2, v2):\n if x1 < x2 and v1 < v2:\n return 'NO'\n else:\n if v1!=v2 and (x2-x1)%(v2-v1)==0:\n return 'YES' \n else:\n return 'NO'\n \n \n a,b,c,d,e,f,g,h = mi()\n overall = b*c\n enough = overall//g\n limes = d*e\n salt = f//h\n ans = min(enough,limes, salt)//a\n print(f\"{ans}\",end=\"\\n\")\n \n \n \nif __name__ == \"__main__\":\n try:\n from baba_yaga import cmdIO, _generator_\n def _BoogeyMan_() -> None : yield cmdIO(); yield BoogeyMan(); yield _generator_()\n master = _BoogeyMan_()\n try:\n while True: assert not next(master)\n except StopIteration: pass\n except (FileNotFoundError,ModuleNotFoundError): BoogeyMan()\n\t\t\t \t\t\t \t\t \t \t \t\t\t\t\t\t\t\t \t\t \t\t", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\nans=(min((k*l)//nl,(c*d),p//np))//n\r\nprint(ans)", "n, k, l, c, d, p, nl, np = map(int, input().split())\nlync = k*l//nl\nlatchanh = c*d\nmuoi = p//np\nprint(min(lync, latchanh, muoi)//n)\n\t \t \t\t \t \t \t\t\t\t \t\t \t \t\t\t", "import math\r\nn, k, l, c, d, p, nl, np = map(int, input().split())\r\nprint(math.floor(min(math.floor((k * l) / nl), c * d, math.floor(p / np)) / n))", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\nprint( int(min( (k*l/nl), c*d, p/np) // n) )\r\n", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\nl = k * l\r\nc = c * d\r\nl = l // nl\r\np = p // np\r\nprint(min(c, min(l, p)) // n)", "# n = int(input())\na = list(map(int, input().split()))\nd = a[1] * a[2]\ne = int(d / a[6])\nf = a[3] * a[4]\ng = int(a[5] / a[7])\nans = int((min(min(e, f), g)) / a[0])\nprint(ans)\n# while n != 0:\n# n -= 1\n", "n,k,l,c,d,p,nl,np = list(map(int,input().split()))\r\ntd = k*l # total drink in mls\r\ntl = c*d # total slices\r\n\r\nans = min(td//nl,tl,p//np)//n\r\nprint(ans)", "n, k, l, c, d, p, nl, np = (int(_) for _ in input().split())\r\n\r\nmilliliter = k * l\r\ntotal_slices = c * d\r\n\r\ntoasts = min( milliliter // (n * nl), total_slices // n, p // (n * np))\r\nprint(toasts)", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\ns=(k*l)//nl\r\nh=c*d\r\npablo=p//np\r\nprint(min(s,h,pablo)//n)\r\n", "n,k,l,c,d,p,nl,np = map(int,input().split())\r\nprint(int(min(((k*l /nl),p/np,c*d))/n))", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\ns = k*l\r\ntoast = s//nl\r\nlime = c*d\r\nsalt = p//np\r\nprint(int(min(toast,lime,salt)/n))", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\nx = k * l\r\ny = x // nl\r\nz = c * d\r\nm = p // np; \r\nprint((min(min(y, z), m)) // n)\r\n", "X,Y,L,C,D,P,A,B=map(int,input().split());print(min(Y*L//A,C*D,P//B)//X)\r\n#HI CODEFORCES\r\n#", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\n# Calculate the maximum number of toasts based on three factors\r\nmax_toasts = min((k * l) // nl, (c * d), p // np)\r\n\r\n# Divide the maximum number of toasts by the number of friends (n)\r\nresult = max_toasts // n\r\n\r\nprint(result)", "def max_toasts(n, k, l, c, d, p, nl, np):\r\n available_drink = k * l\r\n available_lime = c * d\r\n available_salt = p\r\n\r\n max_toasts_drink = available_drink // nl\r\n max_toasts_lime = available_lime // 1\r\n max_toasts_salt = available_salt // np\r\n\r\n return min(max_toasts_drink, max_toasts_lime, max_toasts_salt) // n\r\n\r\nn, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\nresult = max_toasts(n, k, l, c, d, p, nl, np)\r\nprint(result)\r\n", "n, k, l, c, d, p, nl, np=[int(x) for x in input().split()]\r\nx=k*l//(nl*n)\r\ny=c*d//n\r\nz=p//(np*n)\r\nprint(min(x,y,z))", "n, k, l, c, d, p, nl, np=map(int,input().split())\r\nprint(min(((k*l)//nl),(c*d),p//np)//n)\r\n", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\na=min((k*l)//nl,(c*d))\r\nb=(p)//np\r\nprint(min(a,b)//n)", "n,k,l,c,d,p,nl,np = map(int,input().split())\r\nt = 0\r\nkl = k*l\r\ncd= c*d\r\ns=p\r\nwhile True:\r\n if kl>= n*nl and cd>= n and s>=n*np:\r\n t=t+1\r\n kl = kl- (n*nl)\r\n cd = cd- n\r\n s = s - (n*np)\r\n else:\r\n break\r\nprint(t)\r\n", "# N = int(input())\r\n# N,M = map(int,input().split())\r\n# A = list(map(int,input().split()))\r\n\r\n\"\"\"\r\nk - bottles => l - ml\r\nc - limes => d - slices\r\np - salt\r\n\r\nneeds - nl, 1 slice, np\r\n\r\nn = 3\r\nl = 20 , nl = 3 => 6\r\n80 => 80\r\np = 100, np = 100\r\n\r\n\"\"\"\r\n\r\nn,k,l,c,d,p,nl,np = map(int,input().split())\r\n\r\nprint(min( (k*l)//nl, (c*d), p//np ) // n)\r\n\r\n", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\nprint(min(c * d, k * l // nl, p // np) // n)", "n, k, l, c, d, p, nl, np = list(map(int,input().split()))\r\na = n, k, l, c, d, p, nl, np\r\n# print(a)\r\n\r\nx = k*l\r\nn1 = x//nl\r\nn2 = c*d\r\nn3 = p//np\r\nn4 = min(n1,n2,n3)\r\nprint(n4//n)", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\na = (k * l) // nl\r\nb = c * d\r\nc = p // np\r\nprint(min(a, b, c) // n)", "def toasts(n, k, l, c, d, p, nl, np):\r\n \"\"\"\r\n This function calculates the number of toasts that a group of friends can make.\r\n\r\n Args:\r\n n: The number of friends.\r\n k: The number of bottles of soft drink.\r\n l: The milliliters of soft drink in each bottle.\r\n c: The number of limes.\r\n d: The number of slices in each lime.\r\n p: The grams of salt.\r\n nl: The milliliters of soft drink needed for each toast.\r\n np: The grams of salt needed for each toast.\r\n\r\n Returns:\r\n The number of toasts that each friend can make.\r\n \"\"\"\r\n\r\n total_milliliters = k * l\r\n total_slices = c * d\r\n total_grams_of_salt = p\r\n\r\n number_of_toasts = min(\r\n total_milliliters // nl,\r\n total_slices,\r\n total_grams_of_salt // np,\r\n )\r\n\r\n return number_of_toasts // n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n # Get the input from the user.\r\n n, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\n # Calculate the number of toasts that each friend can make.\r\n number_of_toasts_per_friend = toasts(n, k, l, c, d, p, nl, np)\r\n\r\n # Print the result.\r\n print(number_of_toasts_per_friend)\r\n", "n,k,l,c,d,p,nl,np=map(int,input().split())\r\ntotal_juice=k*l\r\nindivi_juice=total_juice//nl\r\nindivi_salt=p//np\r\ncheck_for_enough_tosts=c*d\r\nif p<nl:\r\n print(0)\r\nelse:\r\n print(min(indivi_juice,indivi_salt,check_for_enough_tosts)//n)", "n,k,l,c,d,p,nl,np = map(int, input().split()); print(min(p//np, k*l//nl, c*d)//n)", "n, k, l, c, d, p, nl, np = map(int, input().split())\r\n\r\ndrink_ml = k * l\r\nlime_slices = c * d\r\n\r\n# Calculate the minimum number of toasts possible\r\ntoasts = min(drink_ml // nl, lime_slices, p // np)\r\n\r\n# Divide the number of toasts by the number of friends\r\nresult = toasts // n\r\n\r\nprint(result)\r\n" ]

[ "n = int(input())\r\na = input().split()\r\nb = input().split()\r\n\r\nor_a = 0\r\nor_b = 0\r\nfor i in range(n):\r\n or_a |= int(a[i])\r\n or_b |= int(b[i])\r\n\r\nprint(or_a + or_b)\r\n", "import sys\r\nimport math\r\n\r\n#to read string\r\nget_string = lambda: sys.stdin.readline().strip()\r\n#to read list of integers\r\nget_int_list = lambda: list( map(int,sys.stdin.readline().strip().split()) )\r\n#to read integers\r\nget_int = lambda: int(sys.stdin.readline())\r\n\r\n#--------------------------------WhiteHat010--------------------------------------#\r\nn = get_int()\r\nlst1 = get_int_list()\r\nlst2 = get_int_list()\r\na = b = 0\r\nfor i in range(n):\r\n a = a|lst1[i]\r\n b = b|lst2[i]\r\n\r\nprint(a+b)\r\n", "n = int(input())\na = list(map(int,input().split()))\nb = list(map(int,input().split()))\n\nl_a = []\nl_b = []\nl_sum = []\nfor i in range(n):\n x = a[i]\n for j in range(n - i):\n x = x | a[j]\n l_a.append(x)\n\nfor i in range(n):\n x = b[i]\n for j in range(n - i):\n x = x | b[j]\n l_b.append(x)\n\n# print(l_a)\nfor i in range(len(l_a)):\n l_sum.append(l_a[i] + l_b[i])\n\n# sort(l_sum, reverse = \"True\")\nl_sum.sort(reverse = True)\n\nprint(l_sum[0])\n", "n=int(input())\nip1=list(map(int,input().split()))\nip2=list(map(int,input().split()))\nans=0\nans2=0\nfor i in range(n):\n ans=ans|ip1[i]\nfor j in range(n):\n ans2=ans2|ip2[j]\nprint(ans+ans2)\n", "class Solution:\r\n def Interview(self, n, a, b):\r\n topVal = 0\r\n bottomVal = 0\r\n \r\n for t, b in zip(a, b):\r\n topVal |= t \r\n bottomVal |= b\r\n \r\n return topVal + bottomVal\r\n \r\n\r\nsol = Solution()\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n \r\nprint(sol.Interview(n, a, b))", "n = int(input())\nx = input()\na = list(map(int, x.split(' ')))\nx = input()\nb = list(map(int, x.split(' ')))\n\nf1 = 0\nf2 = 0\nfor i in a:\n f1 = f1 | i\nfor i in b:\n f2 = f2 | i\nprint(f1+f2)\n", "from functools import reduce\r\n \r\nn = int(input())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nprint(reduce(lambda x, y: x | y, a) + reduce(lambda x, y: x | y, b))", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl2=list(map(int,input().split()))\r\nc=c1=0\r\nfor i in l:\r\n\tc=c | i\r\nfor i in l2:\r\n\tc1= c1 | i\r\nprint(c+c1)", "n = int(input())\r\narr1 = list(map(int,input().split()))[:n]\r\narr2 = list(map(int,input().split()))[:n]\r\nsum1 = 0\r\nsum2=0\r\nfor i in range(0,n):\r\n sum1 |= arr1[i]\r\n sum2 |= arr2[i]\r\nprint(sum1+sum2)", "a = int(input())\nb = [int(i) for i in input().split()]\nc = [int(i) for i in input().split()]\n\nB = 0\nfor i in b:\n\tB = B | i\nC = 0\nfor i in c:\n\tC = C | i\nprint(B+C)\n\t \t\t \t \t \t\t \t\t\t\t \t\t \t\t\t", "n=int(input());l=list(map(int,input().split()));y=list(map(int,input().split()));a,b=l[0],y[0]\r\nfor i in range(1,n):\r\n\ta|=l[i];b|=y[i]\r\nprint(a+b)", "a=int(input())\r\nx=0\r\ny=0\r\n\r\nl1=list(map(int,input().split(\" \")))\r\nl2=list(map(int,input().split(\" \")))\r\n\r\nfor e1 in l1:\r\n x|=e1\r\n\r\nfor e2 in l2:\r\n y|=e2\r\n\r\nprint(x+y)", "x = int(input())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nOR1 = a[0]\r\nOR2 = b[0]\r\nfor i in range(1,x):\r\n\tOR1 = OR1|a[i]\r\n\tOR2 = OR2|b[i]\r\nprint(OR1+OR2)", "# HEY STALKER\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\nk = list(map(int, input().split()))\r\nans = 0\r\nfor t in range(n):\r\n z = 0\r\n w = 0\r\n for j in range(t, n):\r\n z = z | l[j]\r\n w = w | k[j]\r\n ans = max(ans, z+w)\r\nprint(ans)\r\n", "n = int(input())\r\na, b = [], []\r\nA, B = 0, 0\r\n\r\nr = input().split()\r\ns = input().split()\r\n\r\nfor i in range(0, n):\r\n a.append(int(r[i]))\r\n b.append(int(s[i]))\r\n A |= a[i]\r\n B |= b[i]\r\n\r\nprint(A + B)", "n = int(input())\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\n\nans1 = A[0]\nans2 = B[0]\nfor i in range(1, n):\n ans1 = ans1 | A[i]\n ans2 = ans2 | B[i]\nprint(ans1 + ans2)", "n = int(input())\na = list(map(int,input().split(\" \")))\nb = list(map(int,input().split(\" \")))\n\ns1 = a[0]\ns2 = b[0]\n\nfor i in range(n):\n\ts1|=a[i]\n\ts2|=b[i]\n\nprint(s1+s2)\n", "def orTwo(a,b):\r\n s1,s2=bin(a),bin(b)\r\n s1=s1[2:]\r\n s2=s2[2:]\r\n s=''\r\n res=0\r\n if len(s1)<len(s2):\r\n s1='0'*(len(s2)-len(s1))+s1\r\n else:\r\n s2='0'*(len(s1)-len(s2))+s2\r\n for i in range(len(s1)):\r\n if s1[i]=='1' or s2[i]=='1':\r\n s+='1'\r\n else:\r\n s+='0'\r\n for i in range(len(s)):\r\n if s[i]=='1':\r\n res+=2**(len(s1)-1-i)\r\n return res\r\nn=int(input())\r\na=[int(x) for x in input().split()]\r\nb=[int(x) for x in input().split()]\r\nres1,res2=a[0],b[0]\r\nfor i in range(1,n):\r\n res1=orTwo(res1,a[i])\r\n res2=orTwo(res2,b[i])\r\nprint(res1+res2)", "t,a1,a2=int(input()),0,0\r\nx=list(map(int, input().split()))\r\ny=list(map(int, input().split()))\r\nfor i in range(t):\r\n a1,a2=a1|x[i],a2|y[i]\r\nprint(a1+a2)", "n = int(input())\r\narr1 = list(map(int, input().split()))\r\narr2 = list(map(int, input().split()))\r\n\r\nv1 = v2 = 0\r\n\r\nfor idx in range(n):\r\n v1 = v1 | arr1[idx]\r\n v2 = v2 | arr2[idx]\r\n\r\nprint(v1 + v2)\r\n", "def f(x, l, r):\r\n\tresult = x[l]\r\n\tfor i in x[l+1:r+1]:\r\n\t\tresult |= i\r\n\treturn result\r\n\r\ndef foo(a, b, n):\r\n max_a = max(a)\r\n max_b = max(b)\r\n a, max_a, b, max_b = (a, max_a, b, max_b) if max_a > max_b else (b, max_b, a, max_a)\r\n l = r = a.index(max_a)\r\n while r < n and f(a, l, r) + f(b, l, r) <= f(a, l, r + 1) + f(b, l, r + 1):\r\n r += 1\r\n while l > 0 and f(a, l, r) + f(b, l, r) <= f(a, l - 1, r) + f(b, l - 1, r):\r\n l -= 1\r\n return f(a, l, r) + f(b, l, r)\r\n\r\nn = int(input())\r\na = [int(n) for n in input().split()]\r\nb = [int(n) for n in input().split()]\r\nmax_a = max(a)\r\nmax_b = max(b)\r\na, max_a, b, max_b = (a, max_a, b, max_b) if max_a > max_b else (b, max_b, a, max_a)\r\nl = r = a.index(max_a)\r\nwhile r < n and f(a, l, r) + f(b, l, r) <= f(a, l, r + 1) + f(b, l, r + 1):\r\n r += 1\r\nwhile l > 0 and f(a, l, r) + f(b, l, r) <= f(a, l - 1, r) + f(b, l - 1, r):\r\n l -= 1\r\nprint(f(a, l, r) + f(b, l, r))", "n = int(input())\r\na = map(int, input().split())\r\nb = map(int, input().split())\r\n\r\nx = 0; y = 0\r\n\r\nfor i in a:\r\n x |= i\r\n\r\nfor i in b:\r\n y |= i\r\n\r\nprint(x + y)", "n = int(input())\r\nl1 = list(map(int,input().split()))\r\nl2 = list(map(int,input().split()))\r\n\r\na_or = 0\r\nb_or = 0\r\n\r\nfor i in l1 :\r\n a_or |= i\r\n \r\n\r\nfor i in l2 :\r\n b_or |= i\r\n\r\nprint(a_or + b_or)\r\n", "n = int(input())\r\na = eval(input().replace(\" \", \"|\"))\r\nb = eval(input().replace(\" \", \"|\"))\r\nprint(a + b)", "# Interview\n\nsize = int(input())\nnum1 = list(map(int,input().split()))\nnum2 = list(map(int,input().split()))\nop1,op2 = 0,0\nfor x in range(size):\n\top1 |= num1[x]\n\top2 |= num2[x]\nprint(op1+op2)\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\n\r\nl=0\r\nr=0\r\nfor i in range(n):\r\n l = a[i]|l\r\n r = b[i]|r\r\nprint(l+r)", "n = int(input())\r\none = list(map(int, input().split()))\r\ntwo = list(map(int, input().split()))\r\n\r\na, b = 0, 0\r\nfor i in range(n):\r\n a |= one[i]\r\n b |= two[i]\r\nprint(a + b)", "# aadiupadhyay\r\nimport os.path\r\nfrom math import gcd, floor, ceil\r\nfrom collections import *\r\nimport sys\r\nmod = 1000000007\r\nINF = float('inf')\r\ndef st(): return list(sys.stdin.readline().strip())\r\ndef li(): return list(map(int, sys.stdin.readline().split()))\r\ndef mp(): return map(int, sys.stdin.readline().split())\r\ndef inp(): return int(sys.stdin.readline())\r\ndef pr(n): return sys.stdout.write(str(n)+\"\\n\")\r\ndef prl(n): return sys.stdout.write(str(n)+\" \")\r\n\r\n\r\nif os.path.exists('input.txt'):\r\n sys.stdin = open('input.txt', 'r')\r\n sys.stdout = open('output.txt', 'w')\r\n\r\nans = 0\r\nn = inp()\r\na = li()\r\nb = li()\r\nfor i in range(n):\r\n x, y = 0, 0\r\n for j in range(i, n):\r\n x |= a[j]\r\n y |= b[j]\r\n ans = max(ans, x+y)\r\npr(ans)\r\n", "n=int(input())\r\n\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nans=0\r\nfor i in a:\r\n ans=ans|i\r\nansb=0\r\nfor i in b:\r\n ansb=ansb|i\r\nprint(ans+ansb)", "from operator import or_\r\nfrom functools import reduce\r\n\r\nn = int(input())\r\nxs = [int(r) for r in input().split()]\r\nys = [int(r) for r in input().split()]\r\n\r\nprint(reduce(or_, xs) + reduce(or_, ys))\r\n", "n = int(input())\r\nl1=list(map(int,input().split()))\r\nl2=list(map(int,input().split()))\r\na1=0\r\na2=0\r\nfor x in l1:\r\n a1|=x\r\nfor x in l2:\r\n a2|=x\r\nprint(a1+a2)", "maxi=0\r\nn = int(input())\r\na = [int(x) for x in input().split()]\r\nb = [int(x) for x in input().split()]\r\nfor i in range(n):\r\n opa = opb = 0\r\n for j in range(i,n):\r\n opa = opa|a[j]\r\n opb = opb|b[j]\r\n if maxi<opa+opb:\r\n maxi = opa+opb\r\nprint(maxi)", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(int(input()))\r\n\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nf = a[0]\r\ns = b[0]\r\nfor i in range(1, n):\r\n f = f | a[i]\r\n s = s | b[i]\r\n\r\nprint(f + s)", "def maximize(arr1,arr2):\r\n value1 = 0\r\n value2= 0\r\n \r\n for num in arr1:\r\n value1|=num \r\n for num in arr2:\r\n value2 |= num\r\n return value2 + value1\r\nn = int(input())\r\narr1 = list(map(int,input().split()))\r\narr2 = list(map(int,input().split()))\r\nprint(maximize(arr1,arr2))\r\n", "z=int(input())\r\nx1=list(map(int,input().split()))\r\nx2=list(map(int,input().split()))\r\na1=x1[0];a2=x2[0]\r\nfor i in range(1,z):\r\n a1|= x1[i]\r\nfor i in range(1,z):\r\n a2|= x2[i] \r\nprint(a1+a2)\r\n", "read = lambda: map(int, input().split())\r\nn = int(input())\r\na = list(read())\r\nb = list(read())\r\nf1 = 0\r\nfor i in a:\r\n f1 |= i\r\nf2 = 0\r\nfor i in b:\r\n f2 |= i\r\nprint(f1 + f2)\r\n", "n = int(input())\r\n\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\ndef OR(nums):\r\n ans = 0\r\n for num in nums:\r\n ans|=num\r\n return ans\r\n \r\nprint(OR(a) + OR(b))", "def arr_inp():\r\n return [int(x) for x in input().split()]\r\n\r\n\r\nn, a, b = int(input()), arr_inp(), arr_inp()\r\na1,b1=0,0\r\nfor i in range(n):\r\n a1|=a[i]\r\n b1|=b[i]\r\nprint(a1+b1)\r\n", "n = int(input())\nx = list(map(int,input().split()))\ny = list(map(int,input().split()))\nsum1 = 0\nsum2 =0\nfor i in x:\n sum1= sum1|i\n\nfor i in y:\n sum2=sum2|i\n\nprint(sum1+sum2)\n\n\n", "input()\r\nprint(eval(input().replace(' ', '|'))+eval(input().replace(' ','|')))", "n = int(input())\r\na = list(map(int, input().split(' ')))\r\nb = list(map(int, input().split(' ')))\r\ntotala=0\r\ntotalb=0\r\nfor i in range(n):\r\n totala|=a[i]\r\n totalb|=b[i]\r\nprint(totala+totalb)\r\n", "from functools import reduce\r\nimport time\r\n# start = time.time()\r\nn = int(input())\r\narr1 = list(map(int, input().split()))\r\narr2 = list(map(int, input().split()))\r\nmaxx = 0\r\nres1 = reduce(lambda x, y: x | y, arr1)\r\nres2 = reduce(lambda x, y: x | y, arr2)\r\nprint(res1+res2)", "from operator import ior\r\nimport functools\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nprint(functools.reduce(ior, a) + functools.reduce(ior, b))", "\r\nfrom functools import reduce\r\n\r\nR = lambda:map(int,input().split())\r\nn, = R()\r\narr = list(R())\r\narr_two = list(R())\r\n\r\nprint(reduce(lambda a,b:a|b, arr) + reduce(lambda a,b:a|b, arr_two))", "n = int(input())\r\n\r\ndef work():\r\n val = 0\r\n raw = input()\r\n raw = raw.split()\r\n raw = [int(num) for num in raw]\r\n for num in raw:\r\n val = val | num\r\n return val\r\n\r\nprint(work() + work())", "x=int(input())\r\ns=[int(n) for n in input().split()]\r\nz=[int(n) for n in input().split()]\r\nm=k=0\r\nfor n in s:\r\n\tm=m|n\r\nfor n in z:\r\n\tk=k|n\r\nprint(m+k)", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nans=0\r\nfor i in range(n):\r\n tmp_a=0\r\n tmp_b=0\r\n for j in range(i,n):\r\n tmp_a=tmp_a|a[j]\r\n tmp_b=tmp_b|b[j]\r\n ans=max(ans,tmp_b+tmp_a)\r\nprint(ans)", "n = int(input())\r\na= list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nres = 0\r\nfor i in a:\r\n res = res |i\r\nres2=0\r\nfor i in b:\r\n res2 = res2 | i\r\nprint(res+res2)\r\n", "t = int(input())\r\n\r\narr1 = list(map(int, input().split(\" \")))\r\narr2 = list(map(int, input().split(\" \")))\r\n\r\nbit = 0\r\nfor num in arr1:\r\n bit |= num\r\n\r\n_sum = bit\r\nbit = 0\r\n\r\nfor num in arr2:\r\n bit |= num\r\n\r\nprint(_sum + bit)", "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\n\r\nn = ii()\r\na = li()\r\nb = li()\r\nma = 0\r\nmb = 0\r\nfor i in range(n):\r\n ma = ma | a[i]\r\n mb = mb | b[i]\r\nprint(ma + mb)\r\n", "size = int(input())\r\narr1 = list(map(int, input().split()))\r\narr2 = list(map(int, input().split()))\r\nnum1 = 0\r\nnum2 = 0\r\nfor i in range(size):\r\n num1 = num1 | arr1[i]\r\n num2 = num2 | arr2[i]\r\nprint(num1 + num2)", "n = int(input())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\na_sum, b_sum = 0,0\r\nfor i in range(n):\r\n a_sum |= a[i]\r\n b_sum |= b[i]\r\nprint(a_sum+b_sum)", "'''input\n10\n13 2 7 11 8 4 9 8 5 1\n5 7 18 9 2 3 0 11 8 6\n'''\nn = int(input())\na, b = list(map(int, input().split())), list(map(int, input().split()))\ns1, s2 = a[0], b[0]\nfor x in range(1, n):\n\ts1 = s1 | a[x]\nfor y in range(1, n):\n\ts2 = s2 | b[y]\n\nprint(s1 + s2)", "#!/usr/bin/env python3\nimport functools\nimport operator\n\n\nif __name__ == '__main__':\n N = int(input())\n a = list(map(int, input().split()))\n b = list(map(int, input().split()))\n print(functools.reduce(operator.or_, a) + functools.reduce(operator.or_, b))\n\n\n", "input()\na = list(map(int, input().split(' ')))\nb = list(map(int, input().split(' ')))\na1 = a[0]\nfor i in a[1:]:\n\ta1 = a1|i\nb1 = b[0]\nfor i in b[1:]:\n\tb1 = b1|i\n\nprint(a1+b1)\n", "import functools\r\n\r\ndef riku(lst):\r\n #lst = [list1, list2]\r\n lst1=lst[0]\r\n lst2=lst[1]\r\n ans=functools.reduce(lambda x, y: x | y, lst1) + functools.reduce(lambda x, y: x | y, lst2)\r\n return ans\r\n\r\nn=int(input())\r\nlst1=list(map(int,input().split()))\r\nlst2=list(map(int,input().split()))\r\nprint(riku([lst1,lst2]))\r\n#print(reduce(lambda x, y: x | y, a) + reduce(lambda x, y: x | y, b))\r\n", "import sys\r\nimport math\r\n#import random\r\n#sys.setrecursionlimit(100000000)\r\ninput = sys.stdin.readline\r\n \r\n############ ---- USER DEFINED INPUT FUNCTIONS ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inara():\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############ ---- THE ACTUAL CODE STARTS BELOW ---- ############\r\n\r\nn=inp()\r\na=inara()\r\nb=inara()\r\n\r\nasum=0\r\n\r\nfor i in range(n):\r\n\tans=0\r\n\tfor j in range(i,n):\r\n\t\tans|=a[j]\r\n\t\tasum=max(asum,ans)\r\n\r\nbsum=0\r\n\r\nfor i in range(n):\r\n\tans=0\r\n\tfor j in range(i,n):\r\n\t\tans|=b[j]\r\n\t\tbsum=max(bsum,ans)\r\n\r\nprint(asum+bsum)\r\n\t\r\n", "def main():\r\n\tn = int(input())\r\n\ta = [int(x) for x in input().split()]\r\n\tb = [int(x) for x in input().split()]\r\n\tprint(solver(a, b))\r\n\r\ndef solver(a, b):\r\n\tn = len(a)\r\n\tbest = 0\r\n\tfor l in range(n):\r\n\t\tbitwiseA = a[l]\r\n\t\tbitwiseB = b[l]\r\n\t\ttotal = bitwiseA + bitwiseB\r\n\t\tif total >= best:\r\n\t\t\tbest = total\r\n\t\tfor r in range(l + 1, n):\r\n\t\t\tbitwiseA |= a[r]\r\n\t\t\tbitwiseB |= b[r]\r\n\t\t\ttotal = bitwiseA + bitwiseB\r\n\t\t\tif total >= best:\r\n\t\t\t\tbest = total\r\n\treturn best\r\n\r\n#a = [1, 2, 4, 3, 2]\r\n#b = [2, 3, 3, 12, 1]\r\n#print(solver(a, b))\r\nmain()", "import itertools\r\nimport math\r\nn = int(input())\r\na = [int(x) for x in input().split()]\r\nb = [int(x) for x in input().split()]\r\nmax1 = -1\r\nfor i in range(n):\r\n last_or_a = 0\r\n last_or_b = 0\r\n for j in range(i,n):\r\n last_or_a|=a[j]\r\n last_or_b|=b[j]\r\n max1 = max(max1, last_or_b+last_or_a)\r\n\r\nprint(max1)", "l = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nm = 0\r\nn = 0\r\nfor i in a:\r\n m |= i\r\nfor i in b:\r\n n |= i\r\n\r\nprint(m+n)", "from functools import reduce\r\nn=int(input())\r\nk=list(map(int,input().split()))\r\nk1=list(map(int,input().split()))\r\nprint(reduce(lambda x,y:x|y,k)+reduce(lambda x,y:x|y,k1))\r\n\r\n \r\n\r\n \r\n \r\n\r\n", "n,t1,t2=int(input()),0,0\r\na=list(map(int, input().split()))\r\nb=list(map(int, input().split()))\r\nfor i in range(n):t1,t2=t1|a[i],t2|b[i]\r\nprint(t1+t2)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nma = 0\r\nfor i in range(n):\r\n aor = 0\r\n bor = 0\r\n for j in range(i, n):\r\n aor |= a[j]\r\n bor |= b[j]\r\n ma = max(ma, aor + bor)\r\nprint(ma)\r\n", "n=int(input())\r\nlist1=list(map(int, input().split()))\r\nlist2=list(map(int, input().split()))\r\nans1=0\r\nans2=0\r\nfor x in list1:\r\n ans1=ans1|x\r\nfor x in list2:\r\n ans2=ans2|x\r\nprint(ans1+ans2) ", "from functools import reduce\n\n\nn = int(input())\nA = [int(x) for x in input().split()]\nB = [int(x) for x in input().split()]\na, b = reduce(lambda x, y: x | y, A), reduce(lambda x, y: x | y, B)\nprint(a + b)\n", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nb=[int(x) for x in input().split()]\r\nc=0\r\nd=0\r\nfor i in range(0,n):\r\n c=c|a[i]\r\n d=d|b[i]\r\nprint(c+d)\r\n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nb=[int(i) for i in input().split()]\r\norA=0\r\norB=0\r\nfor i in a:\r\n orA|=i \r\nfor i in b:\r\n orB|=i \r\nprint(orA+orB)", "n = int(input())\nx = list(map(int ,input().split()))\ny = list(map(int ,input().split()))\nsummix = 0 \nfor num in range(len(x)):\n summix = summix | x[num] \nsummiy = 0 \nfor num in range(len(y)):\n summiy = summiy | y[num] \nprint(summix + summiy)\n\n", "n = int(input())\r\nlst1 = list(map(int, input().split()))\r\nlst2 = list(map(int, input().split()))\r\n\r\nmax1,max2 = 0,0\r\nfor i in range(n):\r\n max1 |= lst1[i]\r\n max2 |= lst2[i]\r\n\r\nprint(max1+max2)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nm1=0\r\ns1=0\r\ns2=0\r\nm2=0\r\nfor i in range(n):\r\n s1=m1|a[i]\r\n s2=m2|b[i]\r\n if s1+s2>a[i]+b[i]:\r\n m1=s1\r\n m2=s2\r\n else:\r\n m1=a[i]\r\n m2=b[i]\r\n \r\nprint(m1+m2)\r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n", "from functools import reduce\r\ninput()\r\na = list(map(int, input().split(\" \")))\r\nb = list(map(int, input().split(\" \")))\r\nprint(reduce(lambda x,y:x|y,a)+reduce(lambda x,y:x|y,b))", "n=input()\r\na=input().split(\" \")\r\nb=input().split(\" \")\r\nans1=0\r\nans2=0\r\nfor i in range(len(a)):\r\n ans1|=int(a[i])\r\n ans2|=int(b[i])\r\nprint(ans2+ans1)", "from functools import reduce\nfrom operator import ior\n\nn = int(input())\na = (int(i) for i in input().split())\nb = (int(i) for i in input().split())\na = reduce(ior, a)\nb = reduce(ior, b)\nres = a + b\nprint(res)\n", "def sobesedovanie(lst1, lst2):\r\n sum1, sum2 = 0, 0\r\n for i in range(len(lst1)):\r\n sum1 |= lst1[i]\r\n sum2 |= lst2[i]\r\n return sum1 + sum2\r\n\r\n\r\nn = int(input())\r\na = [int(j) for j in input().split()]\r\nb = [int(x) for x in input().split()]\r\nprint(sobesedovanie(a, b))\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nfa, fb = 0, 0\r\nfor i in range(n):\r\n fa |= a[i]\r\n fb |= b[i]\r\nprint(fa + fb)", "input()\r\nX = list(map(int, input().split()))\r\nY = list(map(int, input().split()))\r\nSUM1, SUM2 = list(reversed(bin(max(X))[2:])), list(reversed(bin(max(Y))[2:]))\r\nfor i in X:\r\n if SUM1.count('1') == len(SUM1):\r\n break\r\n Temp = list(reversed(bin(i)[2:]))\r\n for j in range(len(Temp)):\r\n if Temp[j] == '1':\r\n SUM1[j] = '1'\r\nfor i in Y:\r\n if SUM2.count('1') == len(SUM2):\r\n break\r\n Temp = list(reversed(bin(i)[2:]))\r\n for j in range(len(Temp)):\r\n if Temp[j] == '1':\r\n SUM2[j] = '1'\r\nprint(int(\"\".join(reversed(SUM1)), 2) + int(\"\".join(reversed(SUM2)), 2))\r\n", "from functools import reduce\r\nfrom operator import or_\r\n\r\nI = lambda: map(int, input().split())\r\n\r\nI()\r\n\r\nprint(reduce(or_, I()) + reduce(or_, I()))", "n = int(input())\r\ndef f(x):\r\n res = 0\r\n for el in x:\r\n res |= el\r\n return res\r\na = (list(map(int,input().split())))\r\nb = (list(map(int,input().split())))\r\nprint(f(a[0:n+1]) + f(b[0:n+1])) \r\n \r\n", "from functools import reduce\r\ninput()\r\nprint(reduce(lambda x,y:x|y,list(map(int,input().split())))+reduce(lambda x,y:x|y,list(map(int,input().split()))))", "if __name__ == '__main__':\r\n n = int(input())\r\n a = map(int, input().split())\r\n b = map(int, input().split())\r\n va = vb = 0\r\n for i in a:\r\n va |= i\r\n for i in b:\r\n vb |= i\r\n print(va + vb)\r\n", "import sys\r\nimport math\r\nfrom collections import Counter\r\nfrom collections import OrderedDict\r\nfrom collections import defaultdict\r\nfrom functools import reduce\r\nsys.setrecursionlimit(10**6)\r\ndef inputt():\r\n return sys.stdin.readline().strip()\r\ndef printt(n):\r\n sys.stdout.write(str(n)+'\\n')\r\ndef listt():\r\n return [int(i) for i in inputt().split()]\r\n \r\ndef gcd(a,b): \r\n return math.gcd(a,b) \r\n \r\ndef lcm(a,b): \r\n return (a*b) // gcd(a,b) \r\n\r\ndef factors(n):\r\n step = 2 if n%2 else 1\r\n return set(reduce(list.__add__,([i, n//i] for i in range(1, int(math.sqrt(n))+1, step) if n % i == 0)))\r\n\r\ndef comb(n,k):\r\n factn=math.factorial(n)\r\n factk=math.factorial(k)\r\n fact=math.factorial(n-k)\r\n ans=factn//(factk*fact)\r\n return ans\r\n\r\ndef is_prime(n): \r\n if n <= 1: \r\n return False\r\n if n == 2: \r\n return True\r\n if n > 2 and n % 2 == 0: \r\n return False\r\n\r\n max_div = math.floor(math.sqrt(n)) \r\n for i in range(3, 1 + max_div, 2): \r\n if n % i == 0: \r\n return False\r\n return True\r\n\r\n\r\n\r\n#t=int(inputt())\r\nt=1\r\nfor _ in range(t):\r\n n=int(inputt())\r\n l=listt()\r\n l1=listt()\r\n k=l[0]\r\n q=l1[0]\r\n for i,j in zip(l[1:],l1[1:]):\r\n k=k|i\r\n q=q|j\r\n print(k+q) \r\n", "from functools import reduce as r\r\na=input()\r\nb=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\nprint(r(lambda q,w:q|w,b)+r(lambda q,w:q|w,c))", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nf1=0\r\nf2=0\r\nfor i in range(n):\r\n f1=f1|a[i]\r\n f2=f2|b[i]\r\nprint(f1+f2)", "n = int(input())\r\na = list(map(int,input().split(\" \")))\r\nb = list(map(int,input().split(\" \")))\r\nx = 0\r\ny = 0\r\nfor i in a:\r\n x = x | i\r\nfor i in b:\r\n y = y | i\r\nprint(x + y)", "# print(\"Input n\")\nn = int(input())\n# print(\"Input array a\")\na = [int(x) for x in input().split()]\n# print(\"Input array b\")\nb = [int(x) for x in input().split()]\nasum = 0\nbsum = 0\nfor i in range(n):\n asum = asum | a[i]\n bsum = bsum | b[i]\nprint(asum + bsum)\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nans = 0\r\nfor l in range(n):\r\n for r in range(l, n):\r\n fa, fb = 0, 0\r\n for k in range(l, r + 1):\r\n fa |= a[k]\r\n fb |= b[k]\r\n ans = max(ans, fa + fb)\r\nprint(ans)", "n = int(input())\r\n*a, = map(int, input().split())\r\n*b, = map(int, input().split())\r\nor1 = a[0]\r\nor2 = b[0]\r\nfor i in range(1, n):\r\n or1 |= a[i]\r\n or2 |= b[i]\r\nprint(or1 + or2)\r\n", "n = int(input())\r\ns1 = list(map(int, input().split()))\r\ns2 = list(map(int, input().split()))\r\nanswer1 = 0\r\nanswer2 = 0\r\nfor i in range(n):\r\n answer1 |= s1[i]\r\n answer2 |= s2[i]\r\nprint(answer1 + answer2)", "n = int(input())\r\nmas1 = (input()).split(' ')\r\nmas2 = (input()).split(' ')\r\n\r\n\r\nmx = 0\r\n\r\n\r\n# for a in mas1:\r\n# r = l \r\n# for b in mas2:\r\n# c = (int(a)|int(mas1[l])|int(mas2[r]) + (int(b)|l|r)\r\n# r+=1\r\n# if c > mx:\r\n# mx = c\r\n# ll = l\r\n# rr = r\r\n\r\n# l +=1\r\nai = int(mas1[0])\r\nbi = int(mas2[0])\r\nfor a in range(n):\r\n for b in range(a,n):\r\n ai |=int(mas1[a])\r\n bi |=int(mas2[b])\r\n c = ai + bi\r\n if c > mx:\r\n mx = c \r\n\r\nprint(mx)\r\n\r\n", "n = int(input())\r\na = list(map(int,input().split(' ')))\r\nb = list(map(int,input().split(' ')))\r\nans = 0\r\ndef ORSUM(l):\r\n m = 0\r\n for i in l:\r\n m = m | i\r\n return m\r\nprint(ORSUM(a)+ORSUM(b))\r\n", "n = int(input())\r\n\r\ndata1 = [int(x) for x in input().split()]\r\ndata2 = [int(x) for x in input().split()]\r\n\r\nk = 0\r\nfor i in range(len(data2)):\r\n k = k | data2[i]\r\n\r\nk1 = 0\r\nfor i in range(len(data1)):\r\n k1 = k1 | data1[i]\r\n\r\nprint(k1 + k)", "n = int(input())\r\nlist1 = [int(num) for num in input().split()]\r\nlist2 = [int(num) for num in input().split()]\r\nx1=0\r\nx2=0\r\nfor i in range(0,len(list1)):\r\n x1=x1|list1[i]\r\n x2 = x2|list2[i]\r\nprint(x1+x2)", "# int(input())\r\n# [int(s) for s in input().split()]\r\n# input()\r\nfrom functools import reduce\r\n\r\n\r\ndef solve():\r\n n = int(input())\r\n a = reduce(lambda a0,a1: a0|a1, [int(s) for s in input().split()])\r\n b = reduce(lambda a0,a1: a0|a1, [int(s) for s in input().split()])\r\n print(a+b)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n solve()", "from functools import reduce\r\nf=lambda:reduce(int.__or__,map(int,input().split()))\r\ninput()\r\nprint(f()+f())", "leng = int(input())\na = [int(x) for x in input().split(\" \")]\nb = [int(x) for x in input().split(\" \")]\ndef f(arr,leng):\n\thsl = 0\n\tfor i in range(leng): hsl |= arr[i]\n\treturn hsl\ntot = f(a,leng) + f(b,leng)\nprint(tot)\n\t\t\t \t\t \t\t \t\t\t\t\t\t \t\t\t\t \t \t", "# cook your dish here\r\nfrom functools import *\r\nn=int(input())\r\ns=ss=0\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nfor i in range(0,len(a),1):\r\n s|=a[i]\r\nfor i in range(0,len(b),1):\r\n ss|=b[i] \r\n\r\nprint(s+ss) ", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nbitwise_or=0\r\noperator_or=0\r\nfor m in range(n):\r\n bitwise_or=bitwise_or|a[m]\r\n operator_or=operator_or|b[m]\r\nprint(bitwise_or+operator_or)", "n = int(input())\nps = list(map(int, input().split()))\nqs = list(map(int, input().split()))\n\nmaxi = 0\ns_a, s_b = 0, 0\nfor l in range(n):\n s_a = ps[l]\n s_b = qs[l]\n for r in range(l, n):\n s_a = s_a | ps[r]\n s_b = s_b | qs[r]\n maxi = max(maxi, s_a + s_b)\n\nprint(maxi)\n", "n = int(input())\r\nn1 = input().split(' ')\r\nn2 = input().split(' ')\r\n\r\nsum1 = 0\r\nloops = 0\r\nfor i in n1:\r\n sum1 = sum1 | int(n1[loops])\r\n loops += 1\r\n\r\nsum2 = 0\r\nloops = 0\r\nfor i in n2:\r\n sum2 = sum2 | int(n2[loops])\r\n loops += 1\r\n\r\nprint(sum1 + sum2)\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nb = [int(i) for i in input().split()]\r\nabit = 0\r\nbbit = 0\r\nfor i in range(n):\r\n abit |= a[i]\r\n bbit |= b[i]\r\n \r\nprint(abit+bbit)", "a = int(input())\nx1 = list(map(int, input().split()))\nx2 = list(map(int, input().split()))\ny1 = 0\ny2 = 0\nfor i in range(a):\n y1 |= x1[i]\n y2 |= x2[i]\nprint(y1 + y2)\n \t\t\t\t \t \t \t\t\t\t \t \t\t \t \t", "n=int(input())\r\nlist_1=list(map(int,input().split()))\r\nlist_2=list(map(int,input().split()))\r\na1=0\r\na2=0\r\nfor x in list_1:\r\n a1=a1|x\r\nfor u in list_2:\r\n a2=a2|u\r\nprint(a1+a2) ", "n = int(input())\r\na = [int(s) for s in input().split(' ')]\r\nb = [int(s) for s in input().split(' ')]\r\n\r\nx = 0\r\nfor u in a:\r\n x = x | u\r\ny = 0\r\nfor v in b:\r\n y = y | v\r\nprint(x + y)\r\n\r\n\r\n", "from functools import reduce\r\nfrom sys import stdin, stdout\r\n\r\nn = int(stdin.readline().strip())\r\nprint(\r\n reduce(lambda x, y: x | y, map(int, stdin.readline().split()))\r\n + reduce(lambda x, y: x | y, map(int, stdin.readline().split()))\r\n)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nres1 = 0\r\nres2 = 0\r\nfor j in range(n):\r\n res1 |= a[j]\r\n res2 |= b[j]\r\n\r\nprint(res1 + res2)\r\n", "t = int(input())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\n\r\na1 = a2 = 0\r\nfor i in range(t):\r\n a1 |= a[i]\r\n a2 |= b[i]\r\n\r\nprint(a1+a2)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nc1=c2=0\r\nfor i in a:\r\n\tc1=c1 | i\r\n\r\nfor i in b:\r\n\tc2=c2 | i\r\nprint(c1+c2)", "n = int(input())\r\n\r\ntmp1 = list(map(int,input().split()))\r\n\r\ntmp2 = list(map(int,input().split()))\r\n\r\nx1=0\r\nx2=0\r\n\r\nfor i in tmp1:\r\n x1|=i\r\n\r\nfor i in tmp2:\r\n x2|=i\r\n\r\nans = x1+x2\r\nprint(ans)\r\n", "\r\nn = int(input())\r\n\r\nl_i1 = list(map(int, input().split()))\r\nl_i2 = list(map(int, input().split()))\r\n\r\no1 = 0\r\no2 = 0\r\n\r\nfor i in range(n):\r\n o1 |= l_i1[i]\r\n o2 |= l_i2[i]\r\n \r\nprint(o1 + o2)", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nr = 0\r\nfor i in range(n):\r\n fa = a[i]\r\n fb = b[i]\r\n for j in range(i, n):\r\n fa |= a[j]\r\n fb |= b[j]\r\n r = max(r, fa+fb)\r\nprint(r)\r\n", "n=int(input())\r\nmaxf = -9999;\r\np=input().rstrip().split(' ')\r\nq=input().rstrip().split(' ')\r\nS=0;\r\nD=0;\r\nF=0;\r\nfor k in range(0,len(p)):\r\n S=S|int(p[k])\r\n D=D|int(q[k])\r\nF=S+D;\r\nprint(F)\r\n\r\n", "n = int(input())\na = [int(x) for x in input().split()]\nb = [int(x) for x in input().split()]\ns = [a[i] + b[i] for i in range(n)]\n\nmax = None\nfor l in range(0, n):\n aa = a[l]\n bb = b[l]\n for r in range(l, n):\n aa |= a[r]\n bb |= b[r]\n if not max or max < aa+bb:\n max = aa + bb\nprint(max)\n", "a=0\r\nb=0\r\nn=int(input())\r\n\r\nx=[int(q) for q in input().split()]\r\ny=[int(q) for q in input().split()]\r\n\r\nfor i in range(n):\r\n a=a|x[i]\r\n b=b|y[i]\r\nprint(a+b)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nd=list(map(int,input().split()))\r\nx,y=0,0\r\nfor i in range(n):\r\n x=x|l[i]\r\n y=y|d[i]\r\nprint(x+y)\r\n", "n = int(input())\r\ns = input()\r\na = s.split(' ')\r\ns = input()\r\nb = s.split(' ')\r\nfor i in range(n):\r\n a[i],b[i] = int(a[i]),int(b[i])\r\n \r\nres = a[0] + b[0] \r\nfor l in range(n):\r\n sumA = 0\r\n sumB = 0\r\n for r in range(l,n):\r\n sumA |= a[r]\r\n sumB |= b[r]\r\n sum = sumA + sumB\r\n res = max(res,sum) \r\nprint(res)", "n=int(input())\r\nans=0\r\nfor i in input().split():\r\n ans|=int(i)\r\ntemp=0\r\nfor i in input().split():\r\n temp|=int(i)\r\nprint(temp+ans)", "def f(array, left, right):\r\n left -= 1\r\n result = 0\r\n for each in array[left:right]:\r\n result = result | each\r\n return result\r\n\r\nn = int(input())\r\na = [int(each) for each in input().split()]\r\nb = [int(each) for each in input().split()]\r\n\r\nprint(f(a,1,n) + f(b,1,n))", "n=int(input())\r\ntot=bot=0\r\nfor i in input().split():tot|=int(i)\r\nfor i in input().split():bot|=int(i)\r\nprint(tot+bot)\r\nexit()", "#!/usr/bin/python3\n\nn = int(input())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\n# n = 5\n# a = [1,2,4,3,2]\n# b = [2,3,3,12,1]\n\ndef f(x, l, r):\n\tres = 0\n\tfor i in range(l, r+1):\n\t\tres |= x[i]\n\treturn res\n\nt = [None]*n\nsum_a = 0\nsum_b = 0\nmax_sum = 0\nfor i in range(n):\n\tsum_a |= a[i]\n\tsum_b |= b[i]\n\tt[i] = sum_a + sum_b\n\n\tmax_sum = max(max_sum, t[i])\n\nprint(max_sum)\n", "from functools import reduce\n\nn = int(input())\na = map(int, input().split(' '))\nb = map(int, input().split(' '))\n\nprint(reduce(lambda x,y: x|y, a)+reduce(lambda x,y: x|y, b))\n", "from functools import reduce\r\nfrom operator import ior\r\n\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\nm = list(map(int, input().split()))\r\nres = reduce(ior, l)\r\nres1 = reduce(ior, m)\r\nprint(res+res1)", "n=int(input())\r\na=[int(z) for z in input().split()]\r\nb=[int(z) for z in input().split()]\r\ns1,s2=0,0\r\nfor i in range(n):\r\n s1|=a[i]\r\n s2|=b[i]\r\nprint(s1+s2)", "n = int(input())\r\nlist_1 = list(map(int,input().split()))\r\nlist_2 = list(map(int,input().split()))\r\nmax_1 =0\r\nmax_2 = 0\r\nfor i in range(n):\r\n max_1 |= list_1[i]\r\n max_2 |= list_2[i]\r\nprint(max_1 + max_2)", "n = int(input().split()[0])\r\na = input().split()\r\nb = input().split()\r\n\r\na_bit = 0\r\nb_bit = 0\r\n\r\nfor i in range(n):\r\n a_bit |= int(a[i])\r\n b_bit |= int(b[i])\r\n\r\nprint(a_bit + b_bit)\r\n", "n=int(input())\r\narr1=list(map(int,input().split()))\r\narr2=list(map(int,input().split()))\r\nor1=0\r\nor2=0\r\nfor i in arr1:\r\n or1=or1|i \r\nfor i in arr2:\r\n or2=or2|i \r\nprint(or1+or2)", "def OR(l):\r\n z=l[0]\r\n for i in l:\r\n z=z|i\r\n return z\r\n\r\nn=int(input())\r\nprint(OR(list(map(int,input().split())))+OR(list(map(int,input().split()))))", "# LUOGU_RID: 101607255\n(n,), a, b = [[*map(int, s.split())] for s in open(0)]\r\nt = ans = 0\r\nfor x in a:\r\n t |= x\r\nans += t\r\nt = 0\r\nfor x in b:\r\n t |= x\r\nans += t\r\nprint(ans)", "import sys\nfrom functools import reduce\n\ndef main(arrs):\n first = reduce(lambda x, y: x | y, arrs[0], 0)\n second = reduce(lambda x, y: x | y, arrs[1], 0)\n print(first + second)\n\nif __name__ == \"__main__\":\n arrs = []\n for e, line in enumerate(sys.stdin.readlines()):\n if e == 0:\n continue\n arrs.append(list(map(int, line.strip().split())))\n main(arrs)\n", "li=[]\nn=int(input())\na=list(map(int,input().split()))\nb=list(map(int,input().split()))\nfor i in range(n):\n\tx=a[i]\n\ty=b[i]\n\tli+=[x+y]\n\tfor j in range(i+1,n):\n\t\tx|=a[j]\n\t\ty|=b[j]\n\t\tli+=[x+y]\nprint(max(li))\n", "from functools import reduce\r\nn = int(input())\r\nmass_a = list(map(int, input().split()))\r\nmass_b = list(map(int, input().split()))\r\n#print(mass_a, mass_b)\r\nmax_sum = 0\r\n#x = mass_a[0]\r\n#y = mass_b[0]\r\nfor i in range(n):\r\n x = mass_a[i]\r\n y = mass_b[i]\r\n for j in range(i+1, n):\r\n x = x | mass_a[j]\r\n y = y | mass_b[j]\r\n if max_sum < x + y:\r\n max_sum = x + y\r\n\r\nif n == 1:\r\n print(mass_a[0] + mass_b[0])\r\nelse:\r\n print(max_sum)\r\n", "n = int(input())\r\na = input().strip('\\n').split(' ')\r\nb = input().strip('\\n').split(' ')\r\n\r\nares = bres = 0\r\n\r\nfor i in range(n):\r\n ares = ares | int(a[i])\r\n bres = bres | int(b[i])\r\n\r\nres = ares + bres\r\n\r\nprint(res)", "from functools import reduce; input()\na = reduce(lambda x, y: int(x) | int(y), input().split())\nb = reduce(lambda x, y: int(x) | int(y), input().split())\nprint(int(a) + int(b))", "def read():\r\n return [int(c) for c in input().split()]\r\n\r\nn, = read()\r\na = read()\r\nb = read()\r\n\r\nx = y = 0\r\nfor aa, bb in zip(a, b):\r\n x |= aa\r\n y |= bb\r\n\r\nprint(x + y)\r\n\r\n", "n = int(input())\r\nans = 0\r\na = [int(i) for i in input().split()]\r\nfor i in a:\r\n ans |= i\r\nn, ans = ans, 0\r\na = [int(i) for i in input().split()]\r\nfor i in a:\r\n ans |= i\r\nprint(n + ans)", "import sys\r\nfrom heapq import heapify, heappush, heappop\r\nfrom math import floor, log2\r\nfrom collections import defaultdict, deque\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\nn = inp()\r\n\r\narr = inlt()\r\narr2 = inlt()\r\n\r\nt1, t2 = 0,0\r\n\r\nfor i in arr:\r\n t1 = t1|i \r\nfor j in arr2:\r\n t2 = t2|j \r\n\r\nprint(t1 + t2)\r\n\r\n\r\n", "\nInput=lambda:map(int,input().split())\n\nn = int(input())\nans = 0\nans1 = 0\nfor i in input().split():\n ans|=int(i)\nfor i in input().split():\n ans1|=int(i)\nprint(ans+ans1)\n\n", "input()\na = input().replace(\" \", \"|\")\nb = input().replace(\" \", \"|\")\nprint(eval(a)+eval(b))\n\n \t\t \t \t \t \t\t \t\t\t\t\t \t \t\t \t\t", "n,a,b=input(),0,0\r\nfor i in input().split():a|=int(i)\r\nfor i in input().split():b|=int(i)\r\nprint(a+b)", "l=lambda:eval(input().replace(' ','|'));l();print(l()+l())", "n = input()\r\na,b = 0,0\r\nfor i in input().split():\r\n a |= int(i)\r\nfor i in input().split():\r\n b |= int(i)\r\nprint(a+b)", "from functools import reduce\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nans = reduce(lambda x,y: x|y, a) + reduce(lambda x,y: x|y, b) \r\nprint(ans)", "n = int(input()) \r\na = sorted(list(map(int , input().split())) , reverse= True)\r\nb = sorted(list(map(int , input().split())) ,reverse= True)\r\nmxa= max(a) \r\nmxb= max(b) \r\nmx1 = 0\r\nfor i in a: \r\n t = mx1 | i \r\n mx1 = t\r\nmx2 = 0 \r\nfor i in b: \r\n t = mx2 | i \r\n mx2 = t\r\nprint(mx1 + mx2) \r\n", "x = int(input())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nans1 = 0\nans2 = 0\nfor i in range(x):\n ans1 |= a[i]\n ans2 |= b[i]\nprint(ans1 + ans2)\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nans = 0\r\nfor i in range(n):\r\n A = 0\r\n B = 0\r\n for j in range(i, n):\r\n A |= a[j]\r\n B |= b[j]\r\n ans = max(ans, A + B)\r\n\r\nprint(ans)\r\n", "a= int(input())\nF = input().split()\nsumF = 0\nfor x in F:\n sumF = sumF | int(x) \nG = input().split()\nsumG = 0\nfor y in G:\n sumG = sumG | int(y)\nprint(sumF + sumG)\n\t \t \t \t\t \t\t \t\t\t \t \t\t \t", "import math\nimport io, os, sys\n\ndef main():\n n = inint()\n a = inlis_map(int)\n b = inlis_map(int)\n oa = 0\n ob = 0\n for e in a:\n oa |= e\n for e in b:\n ob |= e\n\n print(oa + ob)\n\n\n\ndef inlis_map(fnc):\n return list(map(fnc, fastin().split()))\n\ndef in_map(fnc):\n return map(fnc, fastin().split())\n\ndef inint():\n return int(fastin())\n\ndef instr():\n return fastin().strip()\n\n__instrm = io.BytesIO(os.read(0, os.fstat(0).st_size))\n\ndef fastin():\n global __instrm\n return __instrm.readline().decode()\n\ndef put(f):\n if type(f) is str:\n sys.stdout.write(f)\n else:\n sys.stdout.write(str(f))\n\ndef puts(f):\n put(f)\n sys.stdout.write(\"\\n\")\n\ndef outnl():\n sys.stdout.write(\"\\n\")\n\ndef outsp():\n sys.stdout.write(\" \")\n\nmain()\n\n", "n = int(input())\r\na = [int(s) for s in input().split()]\r\nb = [int(s) for s in input().split()]\r\nfa = a[0]\r\nfb = b[0]\r\nfor i in a[1:]:\r\n fa = fa | i\r\nfor i in b[1:]:\r\n fb = fb | i \r\nprint(fa + fb)", "n=int(input())\r\nR=lambda:list(map(int,input().split()))\r\na=R()\r\nb=R()\r\nx=a[0]\r\ny=b[0]\r\nfor i in range(1,n):\r\n\tx=x|a[i]\r\n\ty=y|b[i]\r\nprint(x+y)", "t = int(input())\r\nx = list(map(int, input().split()))\r\ny = list(map(int, input().split()))\r\na = b = i = 0\r\nfor i in range(t):\r\n a |= x[i]\r\n b |= y[i]\r\nprint(a + b)", "from functools import reduce\nI=lambda: reduce(lambda x, y: x|y, map(int, input().split()))\ninput()\nprint(I()+I())\n", "n = int(input())\r\na = b = 0\r\nfor i in input().split():\r\n a |= int(i)\r\nfor i in input().split():\r\n b |= int(i)\r\nprint(a + b)", "def doit(n, a, b):\r\n\trv = 0\r\n\taor = 0\r\n\tbor = 0\r\n\t\r\n\tfor i in a:\r\n\t\taor = aor | i\r\n\t\t\r\n\tfor i in b:\r\n\t\tbor = bor | i\r\n\t\t\r\n\trv = aor + bor\t\r\n\t\r\n\treturn rv\r\n\r\nif __name__ == '__main__':\r\n\tn = int(input())\r\n\ta = list(map(int, input().split()))\r\n\tb = list(map(int, input().split()))\r\n\tprint(doit(n, a, b))", "from functools import reduce\nn = int(input())\nx = reduce(lambda a,b:a|b , map(int,input().split()))\ny = reduce(lambda a,b:a|b , map(int,input().split()))\nprint(x+y)\n", "n = int(input())\r\nA = list(map(int,input().split()))\r\nB = list(map(int,input().split()))\r\nansA = 0\r\nansB = 0\r\nfor a in A:\r\n ansA |= a\r\nfor b in B:\r\n ansB |= b\r\nprint(ansA+ansB) ", "q = int(input());k = list(map(int,input().split()));l = list(map(int,input().split()))\r\nw = 0;r = 0\r\nfor i in range(q):w|=k[i];r|=l[i]\r\nprint(w+r)\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nb = [int(i) for i in input().split()]\r\nc = a[0]\r\nc1 = b[0]\r\nfor i in range(1, n):\r\n c |= a[i]\r\n c1 |= b[i]\r\nprint(c + c1)", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nb=[int(x) for x in input().split()]\r\ntot=bot=0\r\nfor i in range(0,n):\r\n tot|=a[i]\r\n bot|=b[i]\r\nprint(tot+bot)\r\nexit()", "n=int(input())\r\nli=list(map(int,input().split()))\r\nli1=list(map(int,input().split()))\r\na=0\r\nb=0\r\nfor i in range(n):\r\n a=a|li[i]\r\n b=b|li1[i]\r\nprint(a+b)", "import sys\r\n\r\n# sys.stdin = open(\"ivo.in\")\r\n\r\nn = int(sys.stdin.readline())\r\n\r\na = list(map(int, sys.stdin.readline().split()))\r\nb = list(map(int, sys.stdin.readline().split()))\r\n\r\nans = 0\r\nfor beg in range(len(a)):\r\n max1 = 0\r\n max2 = 0\r\n cur1 = 0\r\n cur2 = 0\r\n for e in range(beg, len(a)):\r\n cur1 |= a[e]\r\n cur2 |= b[e]\r\n if cur1 + cur2 > max1 + max2:\r\n max1 = cur1\r\n max2 = cur2\r\n ans = max([ans, max1 + max2])\r\n\r\nprint(ans)", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nmaxx = 0\r\nfor i in range(n):\r\n res1 = 0\r\n res2 = 0\r\n for j in range(i, n):\r\n res1 |= a[j]\r\n res2 |= b[j]\r\n\r\n maxx = max(maxx, res1 + res2)\r\n\r\nprint(maxx)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nresA, resB = 0, 0\r\nfor i in range(n):\r\n resA |= a[i]\r\n resB |= b[i]\r\nprint(resA + resB)\r\n", "n = int(input())\r\na = 0\r\nfor x in input().split():\r\n a |= int(x)\r\nb = 0\r\nfor x in input().split():\r\n b |= int(x)\r\nprint(a+b)", "n = int(input())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\ndef f(x,l,r):\n\tt = 0\n\tfor i in x[l:r]:\n\t\tt |= i\n\n\treturn t\n\nms = 0\nfor s in range(n,0,-1):\n\tfor l in range(0,s):\n\t\tr = l + s\n\t\tif r > n:\n\t\t\tbreak\n\t\telse:\n\t\t\tif (f(a,l,r) + f(b,l,r)) > ms:\n\t\t\t\tms = f(a,l,r) + f(b,l,r)\n\nprint(ms)\n\t\t\t\n\n", "from functools import reduce\r\n\r\n\r\nn = int(input())\r\n\r\nli1 = list(map(int, input().split(\" \")))\r\nli2 = list(map(int, input().split(\" \")))\r\n\r\nval1 = reduce(lambda x,a=0 : a|x, li1)\r\nval2 = reduce(lambda x,a=0 : a|x, li2)\r\n\r\nprint(val1 + val2)", "import sys\r\n\r\n\r\nn = int(sys.stdin.readline())\r\na = [int(x) for x in sys.stdin.readline().strip().split()]\r\nb = [int(x) for x in sys.stdin.readline().strip().split()]\r\nA = a[0]\r\nfor x in a:\r\n A |= x\r\nB = b[0]\r\nfor x in b:\r\n B |= x\r\n\r\nprint(A + B)\r\n", "n = int(input())\r\n\r\ndaf1 = list(map(int, input().split()))\r\ndaf2 = list(map(int, input().split()))\r\n\r\nsum_1 = 0\r\nsum_2 = 0\r\n\r\nfor i in range(n):\r\n sum_1 = sum_1 | daf1[i]\r\n sum_2 = sum_2 | daf2[i]\r\n\r\nprint(sum_1 + sum_2)\r\n", "n = int(input())\r\na = [*map(int, input().split())]\r\nb = [*map(int, input().split())]\r\nres = [0, 0]\r\nfor e in a:\r\n res[0] |= e\r\nfor e in b:\r\n res[1] |= e\r\nprint(sum(res))", "n=int(input())\r\na=eval(input().replace(\" \",\"|\"))\r\nb=eval(input().replace(\" \",\"|\"))\r\nprint(a+b)\r\n", "def f(a, l, r):\r\n if l == r:\r\n return a[l]\r\n x = a[l] | a[l + 1]\r\n for i in range(l + 2, r + 1):\r\n x = x | a[i]\r\n return x\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nx = f(a, 0, n - 1)\r\ny = f(b, 0, n - 1)\r\nprint(x + y)", "#!/usr/bin/python3.5\r\nn=int(input())\r\na=b=0\r\nfor i in input().split():\r\n a|=int(i)\r\nfor i in input().split():\r\n b|=int(i)\r\nprint(a+b)", "n=int(input())\nprint(eval('|'.join(input().split()))+eval('|'.join(input().split())))\n\t \t \t\t \t \t \t\t\t\t\t\t\t \t\t", "x=lambda:eval(input().replace(' ', '|'));x();print(x()+x())", "input()\r\nx=lambda:eval(input().replace(' ', '|'))\r\nprint(x()+x())", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\ninput()\r\na = map(int, input().split())\r\nb = map(int, input().split())\r\nc,d =0,0\r\nfor i in a:\r\n c |= i\r\nfor i in b:\r\n d |= i\r\nprint(c+d)\r\n", "n = int(input())\na = [int(i) for i in input().split()]\nb = [int(i) for i in input().split()]\ns1 = 0\ns2 = 0\nfor i in range(n):\n\ts1|=a[i]\n\ts2|=b[i]\nprint(s1+s2)\n", "import sys, io, os\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport string\r\nfrom collections import defaultdict,Counter,deque\r\ninput = sys.stdin.readline\r\n \r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n\r\n'''\r\nx x x x x x x x x x\r\nx x x x x x x x x x\r\nx x x x x x x ! x x\r\nx x x x x x x x x x\r\n'''\r\ndef solve():\r\n t = II()\r\n a = LII()\r\n b = LII()\r\n\r\n ans = 0\r\n tmp = 0\r\n for num in a:\r\n tmp |= num\r\n ans += tmp\r\n\r\n tmp = 0\r\n for num in b:\r\n tmp |= num\r\n ans += tmp\r\n\r\n print(ans)\r\n\r\nsolve()", "from functools import reduce\r\ndef calc():\r\n return reduce(lambda x,y: x|y, map(int,input().split()))\r\nn=int(input())\r\nprint(calc()+calc())\r\n", "from functools import reduce\r\ninput()\r\na=0\r\nfor _ in[0,0]:a+=reduce(lambda x,y:x|y,map(int,input().split()))\r\nprint(a)", "n, a, b, s1, s2 = int(input()), list(map(int, input().split())), list(map(int, input().split())), 0, 0\r\nfor x in a: s1 |= x\r\nfor x in b: s2 |= x\r\nprint(s1 + s2)", "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=1010\n#################################################\nn=RI()\na=RI()\nb=RI()\na1=functools.reduce(lambda x,y : x|y ,a)\nb1=functools.reduce(lambda x,y : x|y ,b)\nprint(a1+b1)\n\n\n", "n=int(input())\na=[int(x)for x in input().split()]\nb=[int(x)for x in input().split()]\nmxa=0\nfor i in range(n):\n cur=a[i]\n for j in range(i,n):cur|=a[j]\n mxa=max(mxa,cur)\nmxb=0\nfor i in range(n):\n cur=b[i]\n for j in range(i,n):cur|=b[j]\n mxb=max(mxb,cur)\nprint(mxa+mxb)", "if __name__ == \"__main__\":\n\tn = int(input())\n\ta = list(map(int,input().split()))\n\tb = list(map(int,input().split()))\n\tx,y = 0,0\n\tfor i in range(n):\n\t\tx|=a[i]\n\t\ty|=b[i]\n\tprint(x+y)\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nc = a[0]\r\nfor x in a:\r\n\tc = c | x\r\nd = b[0]\r\nfor x in b:\r\n\td = d | x\r\nprint(c+d)", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nu = 0\r\nfor i in a:\r\n u |= i\r\nv = 0\r\nfor i in b:\r\n v |= i\r\nans = u + v\r\nprint(ans)", "n = int(input())\na = map(int, input().split())\nta = 0\nfor i in a:\n ta |= i\nb = map(int, input().split())\ntb = 0\nfor i in b:\n tb |= i\nprint(ta + tb)\n", "#!/usr/bin/env python3\n\nn = int(input())\na = 0\nfor i in input().split():\n a |= int(i)\nb = 0\nfor i in input().split():\n b |= int(i)\nprint(a + b)\n", "from functools import reduce\ndef solve(n,a,b):\n return reduce(lambda x,y: x | y , a)+reduce(lambda x,y: x | y ,b)\n\n\n\n \n \n\ndef main() :\n # na,nb = list(map(int, input().split(' ')))\n # k,m = list(map(int, input().split(' ')))\n # a = list(map(int, input().split(' ')))\n # b = list(map(int, input().split(' ')))\n # s = input()\n # res=''\n # n = int(input())\n # arr = []\n # for _ in range(n):\n # i = list(map(int, input().split(' ')))\n # arr.append(i)\n # # for i in arr:\n n = int(input())\n a = list(map(int, input().split(' ')))\n b = list(map(int, input().split(' ')))\n # s = input()\n print(solve(n,a,b))\n\nmain()\n\n\n" ]

[ "from collections import deque\r\nimport sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef bfs(s):\r\n q = deque()\r\n q.append(s)\r\n dp = [inf] * (n + 1)\r\n dp[s] = s\r\n while q:\r\n i = q.popleft()\r\n for j in G[i]:\r\n if dp[j] ^ inf:\r\n continue\r\n dp[j] = min(j, dp[i])\r\n q.append(j)\r\n return dp\r\n\r\nn, q = map(int, input().split())\r\nG = [[] for _ in range(n + 1)]\r\nfor _ in range(n - 1):\r\n x, y = map(int, input().split())\r\n G[x].append(y)\r\n G[y].append(x)\r\nlast = 0\r\ninf = pow(10, 9) + 1\r\n_, z = map(int, input().split())\r\ns = (z + last) % n + 1\r\ndp = bfs(s)\r\nans = []\r\nmi = inf\r\nfor _ in range(q - 1):\r\n t, z = map(int, input().split())\r\n x = (z + last) % n + 1\r\n if t == 1:\r\n mi = min(mi, dp[x])\r\n else:\r\n ans0 = min(mi, dp[x])\r\n ans.append(ans0)\r\n last = ans0\r\nsys.stdout.write(\"\\n\".join(map(str, ans)))", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef bfs(s):\r\n q, k = [s], 0\r\n dp = [inf] * (n + 1)\r\n dp[s] = s\r\n while len(q) ^ k:\r\n i = q[k]\r\n for l in range(u[i], u[i + 1]):\r\n j = G[l]\r\n if dp[j] ^ inf:\r\n continue\r\n dp[j] = min(j, dp[i])\r\n q.append(j)\r\n k += 1\r\n return dp\r\n\r\ndef make_graph(n, m):\r\n G = []\r\n for _ in range(m):\r\n u, v = map(int, input().split())\r\n G.append(u * (n + 1) + v)\r\n G.append(v * (n + 1) + u)\r\n G.sort()\r\n m *= 2\r\n s = [m] * (n + 2)\r\n for i in range(m):\r\n u = G[i] // (n + 1)\r\n if s[u] == m:\r\n s[u] = i\r\n G[i] %= n + 1\r\n return G, s\r\n\r\nn, q = map(int, input().split())\r\nG, u = make_graph(n, n - 1)\r\nlast = 0\r\ninf = pow(10, 9) + 1\r\n_, z = map(int, input().split())\r\ns = (z + last) % n + 1\r\ndp = bfs(s)\r\nans = []\r\nmi = inf\r\nfor _ in range(q - 1):\r\n t, z = map(int, input().split())\r\n x = (z + last) % n + 1\r\n if t == 1:\r\n mi = min(mi, dp[x])\r\n else:\r\n ans0 = min(mi, dp[x])\r\n ans.append(ans0)\r\n last = ans0\r\nsys.stdout.write(\"\\n\".join(map(str, ans)))" ]

[ "n,m=map(int,input().split())\r\nif n==0:\r\n if m==0:\r\n print(0,0)\r\n else:\r\n print('Impossible')\r\nelse:\r\n if m==0:\r\n print(n,n)\r\n else:\r\n best=m+n-min(m,n)\r\n worst=m+(n-1)\r\n print(best,worst)", "n,m=map(int,input().split())\r\nif(n==0 and m>0):\r\n\tprint('Impossible')\r\nelse:\r\n\tif(n>=m):\r\n\t\tif(m>0):\r\n\t\t\tprint(n,n+m-1)\r\n\t\telse:\r\n\t\t\tprint(n,n+m)\r\n\telse:\r\n\t\tm1=m-n\r\n\t\tmini=n+m1\r\n\t\tmaxi=n+m\r\n\t\tif(m>0):\r\n\t\t\tprint(mini,maxi-1)\r\n\t\telse:\r\n\t\t\tprint(mini,maxi)", "n, m = map(int, input().split())\r\nif n == 0 and m > 0:\r\n print('Impossible')\r\nelif m == 0:\r\n print(n, n)\r\nelse:\r\n print(max(n,m), n+m-1)", "n,m = map(int,input().split())\r\nif m == 0:\r\n print(n,n)\r\nelif n == 0:\r\n print('Impossible')\r\nelse:\r\n print(max(n,m),n + m - 1)", "import sys\r\n\r\nParent, Childs = map(int, input().split())\r\n\r\nif Parent < 1 and Childs > 0:\r\n print('Impossible')\r\n sys.exit()\r\n\r\nmin = Parent\r\nif Childs - Parent > 0:\r\n min += Childs - Parent\r\n\r\nmax = Parent\r\nif Childs > 0:\r\n max += Childs - 1\r\n\r\nprint(min, max)", "def solve():\r\n\tn, m = map(int, input().split())\r\n\tif n == 0:\r\n\t\tif m == 0:\r\n\t\t\tprint(0, 0)\r\n\t\t\treturn\r\n\t\tprint(\"Impossible\")\r\n\t\treturn\r\n\t\r\n\tprint(max(n,m), n+max(0, m-1))\r\n\r\nsolve()", "\r\n\r\nn,m=list(map(int,input().split()))\r\nif n==0 and m!=0:\r\n print(\"Impossible\")\r\nelif n==0 and m==0:\r\n print(\"0 0\")\r\nelse:\r\n if m==0:\r\n print(n,n)\r\n else:\r\n if n<=m:\r\n print(n+(m-n),n+m-1)\r\n else:\r\n print(n,n+m-1)\r\n", "n,m=map(int,input().split())\r\nif n==0:\r\n if m==0:\r\n print(0,0)\r\n else:\r\n print('Impossible')\r\nelif n!=0 and m!=0:\r\n print(n+m-min(n,m),n+m-1)\r\nelse:\r\n print(n,n)\r\n\r\n", "n, m = map(int, input().split())\r\n\r\nif n==0 and m>0:\r\n print(\"Impossible\")\r\nelse:\r\n max_rev = n + max(m-1, 0)\r\n min_rev = n + max(m-n, 0)\r\n \r\n print(min_rev, max_rev)", "a,b=map(int,input().split(' '))\r\nif(b==0):\r\n print(a,a)\r\nelif(a==0):\r\n print(\"Impossible\")\r\nelif(a>=b):\r\n print(a,a+b-1)\r\nelif(b>a):\r\n print(b,a+b-1)", "#3.5.2 | RexTester.Com & 3.6 | CodeForces.Com\r\ngrown_ups, children = map(int, input().split())\r\n\r\nif grown_ups < 1 and children > 0:\r\n print('Impossible');\r\n import sys;\r\n sys.exit()\r\n\r\nMax = grown_ups + children - 1 if children != 0 else grown_ups;\r\n\r\nprint(max(grown_ups, children), Max)", "a,b = map(int,input().split())\r\nif a == 0 and b != 0:\r\n print(\"Impossible\")\r\nelif a == 0:\r\n print(0,0)\r\nelse:\r\n if b == 0:\r\n print(a,a)\r\n else:\r\n print(max(a,b),a+b-1)", "from sys import stdin\r\ndef main():\r\n E=stdin.readline().split()\r\n n=int(E[0])\r\n m=int(E[1])\r\n if n==0 and m==0:\r\n print(\"0\",\"0\")\r\n elif n==0 and m>0:\r\n print(\"Impossible\")\r\n elif n>0 and m==0:\r\n print(n,n)\r\n else: \r\n mini=n+m-min(n,m)\r\n maxi=n+m-1\r\n print(mini,maxi)\r\nmain()", "a,b=map(int,input().split())\r\nif not a:\r\n if not b:print(0,0)\r\n else:print('Impossible')\r\nelse:\r\n if a>=b:\r\n t = a\r\n else:\r\n t = b\r\n \r\n print(t,a+b-bool(b))", "# https://codeforces.com/contest/190\n\nimport sys\n\ninput = lambda: sys.stdin.readline().rstrip() # faster!\n\nn, m = map(int, input().split())\n\nif n == 0 and m > 0:\n print(\"Impossible\")\nelse:\n mn = n + max(0, m - n)\n mx = n + max(0, m - 1)\n print(mn, mx)\n", "#codeforces.com:3.2.5(2.4.0)\r\na,b=[int(a) for a in input().split()]\r\nif a<1 and b:print('Impossible');exit()\r\nprint(max(a,b),a+max(b-1,0))", "a=input()\r\na=a.split()\r\na[0]=int(a[0])\r\na[1]=int(a[1])\r\nif a[0]==0 and a[1]!=0:\r\n print(\"Impossible\")\r\nelse:\r\n\r\n n=(a[1]-a[0])\r\n if (n<0):\r\n n=0\r\n menor=a[0]+n\r\n\r\n m=a[1]-1\r\n if m<0:\r\n m=0\r\n \r\n mayor=a[0]+m\r\n print(menor,mayor)\r\n", "n, m = [int(i) for i in input().split()]\r\nif n:\r\n print(n + m - min(m,n), n + m - min(m,1))\r\nelif n <= 0 and m > 0:\r\n print('Impossible')\r\nelif n == 0 and m == 0:\r\n print(0, 0)\r\n", "def f(l):\r\n n,m = l\r\n if n==0:\r\n return ['Impossible'] if m>0 else [0,0]\r\n return [max(m,n), n+m-1 if m>0 else n+m]\r\n\r\nl = list(map(int,input().split()))\r\nprint(*f(l))\r\n", "n,m=map(int,input().split())\r\nprint(*[[max(m, n), [n,m+n-1][m>0]],['Impossible']][n==0 and m>0])\r\n", "params = list(map(int, input().split()))\na, c = params[0], params[1]\n\nif a == 0:\n if c > 0:\n print(\"Impossible\")\n else:\n print('0 0')\nelse:\n min_pay = max(a,c)\n if c == 0:\n max_pay = a\n else:\n max_pay = a + c - 1\n \n print(str(min_pay) + ' ' + str(max_pay))\n\n\n\t \t\t\t \t\t \t \t \t \t\t\t \t", "import math\r\nn,m=map(int,input().split())\r\nif n==0 and m==0:\r\n print(0,0)\r\nelif n==0:\r\n print(\"Impossible\")\r\nelif m==0:\r\n print(n,n)\r\nelif n>m:\r\n print(n,(n+m)-1)\r\nelse:\r\n print(m,(n+m)-1)", "n,m = map(int,input().split())\n# hagga :/\nif n==0 and m:\n\tprint(\"Impossible\")\nelif n==m and not n:\n\tprint(0,0)\nelif m==0 and n:\n\tprint(n,n)\nelse:\n\tx = m+n-1\n\ty = n*(m//n)+m%n\n\tif not m//n :\n\t\ty = n\n\tprint(y,x)\n", "a,b=input().split()\r\na=int(a)\r\nb=int(b)\r\nif (a==0 and b>0):\r\n print(\"Impossible\")\r\nelse:\r\n c=int(max(0,int(b)-int(a))+int(a))\r\n d=int(max(0,int(b)-1)+int(a))\r\n print(c,d)", "def buses(n, m):\r\n if n == 0 and m != 0:\r\n return \"Impossible\",\r\n if m == 0:\r\n return n, n\r\n return max(n, m), m - 1 + n\r\n\r\n\r\nN, M = [int(i) for i in input().split()]\r\nprint(*buses(N, M))\r\n", "def solve():\r\n n, m = map(int, input().split())\r\n if n <= 0 and m > 0:\r\n print(\"Impossible\")\r\n return\r\n # min\r\n r = n\r\n if m - n > 0:\r\n r += m - n\r\n # max\r\n r2 = n\r\n if m - 1 > 0:\r\n r2 += m - 1\r\n\r\n print(f\"{r} {r2}\")\r\n\r\n\r\nsolve()\r\n", "n,m=map(int,input().split())\r\nif m==0:\r\n print(n,n)\r\nelif n==0:\r\n print('Impossible')\r\nelse:\r\n print(max(n,m),n+m-1)", "#-------------------------------#\r\n#INCLUDE <Amirhossein_Alimirzaei>\r\n#INCLUDE <HajLorenzo>\r\n#-------------------------------#\r\n\r\n#Vasya and the bus\r\n_=[0,0] #min/max\r\n_Point=1\r\na=list(map(int,input().split()))\r\nif(a[1]==0):\r\n _Point=0\r\nif(a[0]==0 and a[1]>0):print(\"Impossible\")\r\nelse:\r\n _[1]=a[0]+a[1]-_Point #this means that all kids are for just one guy and we have just one free ticket\r\n if (a[0] < a[1]):_[0]=a[0]+(abs(a[0]-a[1]))\r\n else:_[0]=a[0]\r\n print(*(_),sep=\" \")", "#3.5 (6.0.0) | CodeForces.Com\r\ngrown_ups, children = map(int, input().split())\r\n\r\nif grown_ups < 1 and children:\r\n print('Impossible')\r\n exit()\r\n\r\nprint(max(grown_ups, children), grown_ups + max(children - 1, 0))", "n, m = map(int, input().split())\nmi = n + max(m - n, 0)\nma = n + max(0, m - 1)\n\nif n == 0 and m == 0:\n print(\"0 0\")\n exit(0)\n\nif n == 0:\n print(\"Impossible\")\n exit(0)\n\nprint(mi, ma)\n", "a,b=map(int,input().split())\r\nif a<1and b>0:print('Impossible');import sys;sys.exit()\r\nc=a+b-1if b!=0else a;print(max(a,b),c)", "m,n=map(int,input().split())\r\nk2=max(n,m)\r\n\r\nif m>0 and n>0:\r\n\tprint(k2,n+m-1)\r\nelif n==0:\r\n\tprint(k2,n+m)\r\nelse:\r\n\tprint(\"Impossible\")", "#http://codeforces.com pypy 3.2.5 (2.4.0)\r\na,b=[int(a) for a in input().split()]\r\nif a<1 and b>0:print('Impossible');exit()\r\nc=a+b-1\r\nif b==0:c=a\r\nprint(max(a,b),c)", "n, m = (int(x) for x in input().split())\nif n == 0:\n\tif m == 0:\n\t\tprint(0, 0)\n\telse:\n\t\tprint('Impossible')\nelse:\n\tprint(n + max(0, m - n), n + max(0, m - 1))\n", "a,b=map(int,input().split())\r\nif a==0 and b>0:\r\n print('Impossible')\r\nelif b==0:\r\n print(a,a)\r\nelse:\r\n if b-a<0:\r\n print(a,a+(b-1))\r\n else:\r\n print(a+(b-a),a+(b-1))", "n, m = map(int, input().split())\r\nif not n and m:\r\n ans = \"Impossible\"\r\n print(ans)\r\n exit()\r\nmi, ma = max(n, m), max(n + m - 1, n)\r\nprint(mi, ma)", "n,m=map(int,input().split())\r\na1=0\r\na2=0\r\nif m==0:\r\n a1=a2=n\r\nelif n>=m:\r\n a1=m+n-1\r\n a2=m+n-m\r\nelif n<m:\r\n a1=m+n-1\r\n a2=n-1+m-(n-1)\r\nif n==0 and m>0:\r\n print(\"Impossible\")\r\nelse:\r\n print(a2,a1)\r\n", "a,b=map(int,input().split())\r\nif a<1 and b:print('Impossible');exit()\r\nprint(max(a,b),a+max(b-1,0))", "n, m = map(int, input().split())\r\nprint(*[[n+m-min(m, n), [n,m+n-1][m>0]],['Impossible']][n==0 and m>0])", "g,c=map(int,input().split(' '))\r\nif(c==0):\r\n print(g,g)\r\nelif(g==0):\r\n print('Impossible')\r\nelif(g>=c):\r\n print(g,g+c-1)\r\nelif(g<c):\r\n print(c,g+c-1)", "\r\nn,m=map(int,input().split())\r\n\r\nif n==0 and m!=0:\r\n print(\"Impossible\")\r\nelse:\r\n print(n+max(0,m-n), n+max(0,m-1))\r\n" ]

[ "#!/usr/bin/env python3\r\n\r\ntry:\r\n while True:\r\n n, m, q = map(int, input().split())\r\n cmds = [tuple(map(int, input().split())) for i in range(q)]\r\n a = [[0] * m for i in range(n)]\r\n for t in reversed(cmds):\r\n if t[0] == 1:\r\n i = t[1] - 1\r\n x = a[i][-1]\r\n for j in range(m - 1, 0, -1):\r\n a[i][j] = a[i][j - 1]\r\n a[i][0] = x\r\n elif t[0] == 2:\r\n j = t[1] - 1\r\n x = a[-1][j]\r\n for i in range(n - 1, 0, -1):\r\n a[i][j] = a[i - 1][j]\r\n a[0][j] = x\r\n elif t[0] == 3:\r\n a[t[1] - 1][t[2] - 1] = t[3]\r\n\r\n for row in a:\r\n print(' '.join(map(str, row)))\r\n\r\nexcept EOFError:\r\n pass\r\n", "import sys\r\ninput = sys.stdin.readline\r\nsys.setrecursionlimit(100000)\r\nfrom collections import defaultdict, deque\r\nfrom itertools import permutations\r\nfrom queue import PriorityQueue\r\np = print\r\nr = range\r\ndef I(): return int(input())\r\ndef II(): return list(map(int, input().split()))\r\ndef S(): return input()[:-1]\r\ndef M(n): return [list(map(int, input().split())) for ___ in r(n)]\r\ndef pb(b): print('Yes' if b else 'No')\r\ndef INF(): return float('inf')\r\n# -----------------------------------------------------------------------------------------------------\r\n#\r\n# 　　　　　　　　　　　 ∧＿∧\r\n# 　　　　　 ∧＿∧ 　 （´<_｀ ）　 Welcome to My Coding Space !\r\n# 　　　　 （ ´_ゝ`）　/　 ⌒i Free Hong Kong !\r\n# 　　　　／　　　＼　 　 |　| Free Tibet !\r\n# 　　　 /　　 /￣￣￣￣/　|　 |\r\n# 　 ＿_(__ﾆつ/　 ＿/ .| .|＿＿＿＿\r\n# 　 　　　＼/＿＿＿＿/　（u　⊃\r\n#\r\n# 再帰関数ですか？　SYS!!!!\r\n# BINARY SEARCH ?\r\n# -----------------------------------------------------------------------------------------------------\r\nn, m, q = II()\r\ngrid = M(q)\r\nres = [[0 for i in r(m)] for j in r(n)]\r\nfor i in reversed(r(q)):\r\n if grid[i][0] == 3:\r\n t, x, y, d = grid[i]\r\n res[x-1][y-1] = d\r\n elif grid[i][0] == 1:\r\n t = grid[i][1] - 1\r\n res[t] = [res[t][-1]] + res[t][:-1]\r\n else:\r\n t = grid[i][1] - 1\r\n temp = res[-1][t]\r\n for j in reversed(r(n-1)):\r\n res[j+1][t] = res[j][t]\r\n res[0][t] = temp\r\nfor x in res:\r\n p(\" \".join(map(str,x)))", "import sys\nimport math\nimport itertools as it\nimport operator as op\nimport fractions as fr\n\n\nn,m,q = map(int, sys.stdin.readline().split())\n\nA = [[r * m + c for c in range(m)] for r in range(n)]\nV = [0 for i in range(n*m)]\n\nfor _ in range(q):\n L = list(map(int, sys.stdin.readline().split()))\n if L[0] == 1:\n r = L[1]\n r-=1\n A[r] = A[r][1:] + A[r][:1]\n elif L[0] == 2:\n c = L[1]\n c-=1\n e = A[0][c]\n for i in range(1,n):\n A[i-1][c] = A[i][c]\n A[n-1][c] = e\n else:\n r,c,v = L[1:]\n r-=1\n c-=1\n V[A[r][c]] = v\n\nfor r in range(n):\n print(' '.join(map(str, V[r*m:(r+1)*m])))\n", "n, m, q = map(int, input().split())\r\nqueries = [tuple(map(lambda x: int(x) - 1, input().split())) for i in range(q)]\r\nmatrix = [[0]*m for i in range(n)]\r\nwhile queries:\r\n query = queries.pop()\r\n if query[0] == 0:\r\n row = [matrix[query[1]][-1]]\r\n row.extend(matrix[query[1]][:-1])\r\n matrix[query[1]] = row\r\n elif query[0] == 1:\r\n cell = matrix[n-1][query[1]]\r\n for i in range(n):\r\n matrix[i][query[1]], cell = cell, matrix[i][query[1]]\r\n else:\r\n matrix[query[1]][query[2]] = query[3] + 1\r\n[print(*row) for row in matrix]\r\n", "from queue import LifoQueue\r\n\r\nparse_int = lambda: list(map(int, input().split()))\r\n\r\nn,m,q = parse_int()\r\n\r\nmtx = [ [0 for _2 in range(m)] for _1 in range(n)]\r\n\r\ndef shift(l):\r\n return [ l[_%len(l)] for _ in range(-1,len(l)-1) ]\r\n\r\n#print(shift([1,2,3,4,5,]))\r\n\r\ndef col_shift(col):\r\n global mtx\r\n col-=1\r\n COL = shift([ mtx[row][col] for row in range(n) ])\r\n for row in range(n):\r\n mtx[row][col] = COL[row]\r\n\r\ndef row_shift(row):\r\n global mtx\r\n row -=1\r\n mtx[row] = shift(mtx[row])\r\n\r\ndef assign(row,col,value):\r\n row, col = row-1, col-1\r\n mtx[row][col] = value\r\n\r\ncom = {\r\n 1: lambda a: row_shift(a),\r\n 2: lambda b: col_shift(b),\r\n 3: lambda x,y,z: assign(x,y,z),\r\n}\r\n\r\nstack = LifoQueue()\r\nfor _ in range(q):\r\n stack.put(parse_int())\r\n\r\nfor _ in range(q):\r\n inp = stack.get()\r\n if len(inp)==2:\r\n com[inp[0]](inp[1])\r\n else:\r\n com[inp[0]](inp[1], inp[2], inp[3])\r\n\r\n'''\r\nfor i in range(m):\r\n for j in range(n):\r\n print(mtx[j][i], end=' ')\r\n print()\r\n#'''\r\n\r\nfor row in mtx:\r\n for elem in row:\r\n print(elem, end=' ')\r\n print()\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m, q = map(int, input().split())\r\n\r\nd = [[0]*m for i in range(n)]\r\ns = [list(map(int, input().split())) for _ in range(q)]\r\nfor w in reversed(s):\r\n if w[0] == 1:\r\n a = w[1] - 1\r\n d[a] = [d[a][-1]] + d[a][:-1]\r\n elif w[0] == 2:\r\n a = w[1] - 1\r\n x = d[n-1][a]\r\n for i in range(n-1, 0, -1):\r\n d[i][a] = d[i-1][a]\r\n d[0][a] = x\r\n else:\r\n a, b, c = w[1]-1, w[2]-1, w[3]\r\n d[a][b] = c\r\nfor i in d:\r\n print(' '.join(map(str, i)))", "n, m, q = [int(i) for i in input().split()]\ns = [[0 for i in range(m)] for i in range(n)]\na = []\nb = []\nc = []\nd = []\nfor i in range(q):\n\to = [int(i) for i in input().split()]\n\td.append(o[0])\n\tif o[0] == 1:\n\t\ta.append(o[1]-1)\n\tif o[0] == 2:\n\t\tb.append(o[1]-1)\n\tif o[0] == 3:\n\t\tc.append(o[1:])\nfor i in d[::-1]:\n\tif i == 3:\n\t\ts[c[-1][0]-1][c[-1][1]-1] = c[-1][2]\n\t\tc.pop()\n\tif i == 2:\n\t\ty = s[-1][b[-1]]\n\t\tfor j in range(n-1, 0, -1):\n\t\t\ts[j][b[-1]] = s[j-1][b[-1]]\n\t\ts[0][b[-1]] = y\n\t\tb.pop()\n\tif i == 1:\n\t\ts[a[-1]]=[s[a[-1]][-1]] + s[a[-1]][:-1]\n\t\ta.pop()\nfor i in range(n):\n\tprint(*s[i])\n\t\n", "#!/usr/bin/env python3\n# 669C_matrix.py - Codeforces.com/problemset/problem/669/C by Sergey 2016\n\nimport unittest\nimport sys\n\n###############################################################################\n# Matrix Class (Main Program)\n###############################################################################\n\n\nclass Matrix:\n \"\"\" Matrix representation \"\"\"\n\n def __init__(self, test_inputs=None):\n \"\"\" Default constructor \"\"\"\n\n it = iter(test_inputs.split(\"\\n\")) if test_inputs else None\n\n def uinput():\n return next(it) if it else sys.stdin.readline().rstrip()\n\n # Reading single elements\n [self.n, self.m, self.q] = map(int, uinput().split())\n\n # Reading a single line of multiple elements\n self.nums = []\n for i in range(self.q):\n self.nums.append(list(map(int, uinput().split())))\n\n def calculate(self):\n \"\"\" Main calcualtion function of the class \"\"\"\n\n matrix = []\n for r in range(self.n):\n row = [0] * self.m\n matrix.append(row)\n\n for cmd in reversed(self.nums):\n if cmd[0] == 3:\n matrix[cmd[1]-1][cmd[2]-1] = cmd[3]\n elif cmd[0] == 1:\n rep = matrix[cmd[1]-1][-1]\n for i in range(self.m):\n matrix[cmd[1]-1][i], rep = rep, matrix[cmd[1]-1][i]\n elif cmd[0] == 2:\n rep = matrix[-1][cmd[1]-1]\n for i in range(self.n):\n matrix[i][cmd[1]-1], rep = rep, matrix[i][cmd[1]-1]\n\n rows = [\" \".join(map(str, row)) for row in matrix]\n result = \"\\n\".join(rows)\n\n return str(result)\n\n###############################################################################\n# Unit Tests\n###############################################################################\n\n\nclass unitTests(unittest.TestCase):\n\n def test_single_test(self):\n \"\"\" Matrix class testing \"\"\"\n\n # Constructor test\n test = \"2 2 6\\n2 1\\n2 2\\n3 1 1 1\\n3 2 2 2\\n3 1 2 8\\n3 2 1 8\"\n d = Matrix(test)\n self.assertEqual(d.n, 2)\n self.assertEqual(d.m, 2)\n self.assertEqual(d.q, 6)\n self.assertEqual(d.nums[0], [2, 1])\n\n # Sample test\n self.assertEqual(Matrix(test).calculate(), \"8 2\\n1 8\")\n\n # Sample test\n test = \"3 3 2\\n1 2\\n3 2 2 5\"\n self.assertEqual(Matrix(test).calculate(), \"0 0 0\\n0 0 5\\n0 0 0\")\n\n # Sample test\n test = \"\"\n # self.assertEqual(Matrix(test).calculate(), \"0\")\n\n # My tests\n test = \"\"\n # self.assertEqual(Matrix(test).calculate(), \"0\")\n\n # Time limit test\n # self.time_limit_test(5000)\n\n def time_limit_test(self, nmax):\n \"\"\" Timelimit testing \"\"\"\n import random\n import timeit\n\n # Random inputs\n test = str(nmax) + \" \" + str(nmax) + \"\\n\"\n numnums = [str(i) + \" \" + str(i+1) for i in range(nmax)]\n test += \"\\n\".join(numnums) + \"\\n\"\n nums = [random.randint(1, 10000) for i in range(nmax)]\n test += \" \".join(map(str, nums)) + \"\\n\"\n\n # Run the test\n start = timeit.default_timer()\n d = Matrix(test)\n calc = timeit.default_timer()\n d.calculate()\n stop = timeit.default_timer()\n print(\"\\nTimelimit Test: \" +\n \"{0:.3f}s (init {1:.3f}s calc {2:.3f}s)\".\n format(stop-start, calc-start, stop-calc))\n\nif __name__ == \"__main__\":\n\n # Avoiding recursion limitaions\n sys.setrecursionlimit(100000)\n\n if sys.argv[-1] == \"-ut\":\n unittest.main(argv=[\" \"])\n\n # Print the result string\n sys.stdout.write(Matrix().calculate())\n", "f=lambda: map(int,input().split())\r\nn,m,q=f()\r\np=[[0]*m for j in range(n)]\r\nfor t in [list(f()) for k in range(q)][::-1]:\r\n j=t[1]-1\r\n if t[0]==1: p[j].insert(0,p[j].pop())\r\n elif t[0]==2: \r\n s=p[-1][j]\r\n for i in range(n-1,0,-1): p[i][j]=p[i-1][j]\r\n p[0][j]=s\r\n else: p[j][t[2]-1]=t[3]\r\nfor d in p: print(*d)", "from copy import copy\nn, m, q = map(int, input().split())\nmat = [[1 for i in range(m+1)] for j in range(n+1)]\nop = []\nfor i in range(q):\n op.append(list(map(int, input().split())))\nfor i in range(q-1, -1, -1):\n __type = op[i][0]\n if __type == 1:\n row = op[i][1]\n row -= 1\n temp = copy(mat[row][m-1])\n for j in range(m-1, 0, -1):\n mat[row][j] = copy(mat[row][j-1])\n mat[row][0] = copy(temp)\n elif __type == 2:\n col = op[i][1]\n col -= 1\n temp = copy(mat[n-1][col])\n for j in range(n-1, 0, -1):\n mat[j][col] = copy(mat[j-1][col])\n mat[0][col] = copy(temp)\n elif __type == 3:\n row, col, val = op[i][1:4]\n row -= 1\n col -= 1\n mat[row][col] = val\n #for i in range(n):\n # s = \"\"\n # for j in range(m):\n # s += str(mat[i][j])+\" \"\n #print(s)\n #print(\"----------\")\nfor i in range(n):\n s = \"\"\n for j in range(m):\n s += str(mat[i][j])+\" \"\n print(s)\n", "nmq = input().split(' ')\r\nn, m, q = int(nmq[0]), int(nmq[1]), int(nmq[2])\r\nmt = []\r\nfor i in range(0, n):\r\n mt.append([])\r\n for j in range(0, m):\r\n mt[-1].append((i, j))\r\nres = []\r\nfor i in range(0, n):\r\n res.append([])\r\n for j in range(0, m):\r\n res[-1].append(0)\r\nfor i in range(0, q):\r\n ins = input().split(' ')\r\n if ins[0] == '1':\r\n r = int(ins[1]) - 1\r\n b = mt[r][0]\r\n for j in range(0, m-1):\r\n mt[r][j] = mt[r][j+1]\r\n mt[r][m-1] = b\r\n if ins[0] == '2':\r\n c = int(ins[1]) - 1\r\n b = mt[0][c]\r\n for j in range(0, n-1):\r\n mt[j][c] = mt[j+1][c]\r\n mt[n-1][c] = b\r\n if ins[0] == '3':\r\n r = int(ins[1]) - 1\r\n c = int(ins[2]) - 1\r\n x = int(ins[3])\r\n p = mt[r][c]\r\n res[p[0]][p[1]] = x\r\nfor i in range(0, n):\r\n for j in range(0, m-1):\r\n print(res[i][j],' ', end='')\r\n print(res[i][-1])\r\n \r\n", "n,m,q=(int(z) for z in input().split())\r\ns=[]\r\nres=[]\r\nfor i in range(n):\r\n\tres.append([0]*m)\r\nfor i in range(q):\r\n\ts.append([int(z) for z in input().split()])\r\nwhile len(s)>0:\r\n\tif s[-1][0]==3:\r\n\t\tres[s[-1][1]-1][s[-1][2]-1]=s[-1][3]\r\n\telif s[-1][0]==2:\r\n\t\tr=res[-1][s[-1][1]-1]\r\n\t\tfor i in range(n-1,0,-1):\r\n\t\t\tres[i][s[-1][1]-1]=res[i-1][s[-1][1]-1]\r\n\t\tres[0][s[-1][1]-1]=r\r\n\telse:\r\n\t\tr=res[s[-1][1]-1][-1]\r\n\t\tfor i in range(m-1,0,-1):\r\n\t\t\tres[s[-1][1]-1][i]=res[s[-1][1]-1][i-1]\r\n\t\tres[s[-1][1]-1][0]=r\r\n\ts.pop()\r\nfor i in range(n):\r\n\tprint(' '.join(map(str,res[i])))", "from collections import *\ndef main():\n n,m,q=map(int, input().split())\n qq=[]\n for test in range(q):\n pp=list(map(int, input().split()))\n qq.append(pp)\n qq.reverse()\n mat=[]\n for i in range(n):\n mat.append([0]*m)\n for i in range(q):\n lst = qq[i]\n if lst[0] == 3:\n mat[lst[1]-1][lst[2]-1] = lst[3]\n elif lst[0] == 2:\n d = deque([])\n for k in range(n):\n d.append(mat[k][lst[1]-1])\n d.appendleft(d.pop())\n for k in range(n):\n mat[k][lst[1]-1]=d[k]\n else:\n d = deque([])\n for k in range(m):\n d.append(mat[lst[1]-1][k])\n d.appendleft(d.pop())\n for k in range(m):\n mat[lst[1]-1][k] = d[k]\n for i in range(n):\n print(*mat[i])\n\nmain()\n", "def w(ind):\r\n global mtx, n, m\r\n box = mtx[ind][-1]\r\n for i in range(m - 1 - 1, -1, -1):\r\n mtx[ind][i + 1] = mtx[ind][i]\r\n mtx[ind][0] = box\r\n \r\ndef h(ind):\r\n global mtx, n, m\r\n box = mtx[-1][ind]\r\n for i in range(n - 1 - 1, -1, -1):\r\n mtx[i + 1][ind] = mtx[i][ind]\r\n mtx[0][ind] = box\r\n\r\nglobal mtx, n, m\r\nn, m, q = [int(i) for i in input().split()]\r\nmtx = [[0 for i in range(m)] for j in range(n)]\r\ndata = [[] for i in range(q)]\r\nfor i in range(q):\r\n data[q - i - 1] = [int(j) for j in input().split()]\r\np = 0\r\nfor i in data:\r\n cmd = i[0]\r\n ind = 0\r\n x, y = 0, 0\r\n box = 0\r\n if p and cmd == 1:\r\n ind = i[1] - 1\r\n w(ind)\r\n elif p and cmd == 2:\r\n ind = i[1] - 1\r\n h(ind)\r\n elif cmd == 3:\r\n x, y = i[1] - 1, i[2] - 1\r\n box = i[3]\r\n mtx[x][y] = box\r\n p = 1\r\nfor i in mtx:\r\n for j in i:\r\n print(j, end = ' ')\r\n print()\r\n \r\n\r\n ", "def main():\n n, m, q = map(int, input().split())\n nm = [\"0\"] * (m * n)\n qq = [input() for _ in range(q)]\n for s in reversed(qq):\n k, *l = s.split()\n if k == \"3\":\n nm[(int(l[0]) - 1) * m + int(l[1]) - 1] = l[2]\n elif k == \"2\":\n j = int(l[0]) - 1\n x = nm[j - m]\n for i in range((n - 1) * m + j, j, -m):\n nm[i] = nm[i - m]\n nm[j] = x\n else:\n j = (int(l[0]) - 1) * m\n x = nm[j + m - 1]\n for i in range(j + m - 1, j, -1):\n nm[i] = nm[i - 1]\n nm[j] = x\n for i in range(0, n * m, m):\n print(' '.join(nm[i:i + m]))\n\n\nif __name__ == \"__main__\":\n main()\n", "def solve(n, m, data):\r\n res = []\r\n for x in range(n):\r\n res.append([0]*m)\r\n data2 = reversed(data)\r\n for y in data2:\r\n if y[0]==1:\r\n tmp = res[y[1] - 1][-1]\r\n del res[y[1] - 1][-1]\r\n res[y[1] - 1].insert(0, tmp)\r\n elif y[0]==2:\r\n k = y[1] - 1\r\n tmp = res[-1][k]\r\n for j in range(n-1):\r\n res[-j-1][k] = res[-j-2][k]\r\n res[0][k] = tmp\r\n else:\r\n res[y[1] - 1][y[2] - 1] = y[3]\r\n return res\r\n \r\n(n, m, q) = [int(x) for x in input().split()]\r\ndata = []\r\nfor i in range(q):\r\n data.append([int(x) for x in input().split()])\r\n \r\nsol = solve(n, m, data)\r\nfor x in sol:\r\n for y in x[:-1]:\r\n print(y, end = ' ')\r\n print(x[-1])", "n, m, q = map(int,input().split())\nmat = [[(i, j) for j in range(m)] for i in range(n)]\nM = [[0 for j in range(m)] for i in range(n)]\n\nfor _ in range(q):\n qry = list(map(int,input().split()))\n if qry[0] == 1:\n i = qry[1] - 1\n mat[i] = mat[i][1:] + [mat[i][0]]\n elif qry[0] == 2:\n j = qry[1] - 1\n fst = mat[0][j]\n for i in range(n - 1):\n mat[i][j] = mat[i + 1][j]\n mat[n - 1][j] = fst\n else:\n x = qry[1]-1\n y = qry[2]-1\n M[mat[x][y][0]][mat[x][y][1]] = qry[3]\n\nfor row in M:\n print(' '.join(list(map(str, row))))\n", "def rotate_r(ar, row, n):\n\tar[row] = ar[row][-n:] + ar[row][:-n]\n\treturn ar\n\ndef rotate_c(ar, m, col):\n\t#c = ar[col][0]\n\tc = ar[m - 1][col]\n\tfor i in range(m - 1, 0, -1):\n\t#for i in range(m - 1):\n\t\tar[i][col] = ar[i - 1][col]\n\t#ar[col][m - 1] = c\n\tar[0][col] = c\n\treturn ar\n\ndef print_matr(ar, n):\n\tfor i in range(n):\n\t\tprint(*ar[i])\t\t\n\nar2 = []\t\n\nn, m, q = map(int, input().split())\n#for i in range(n):\n#\tar = list(map(int, input().split()))\n#\tar2.append(ar)\n\n\nquery = [0 for i in range(q)]\nrows = [0 for i in range(q)]\ncols = [0 for i in range(q)]\nnums = [0 for i in range(q)]\n\nfor i in range(q):\n\tar = list(map(int, input().split()))\n\tquery[i] = ar[0]\n\tif ar[0] == 3:\n\t\trows[i] = ar[1] - 1\n\t\tcols[i] = ar[2] - 1\n\t\tnums[i] = ar[3]\n\telif ar[0] == 1:\n\t\trows[i] = ar[1] - 1\n\telse:\n\t\tcols[i] = ar[1] - 1\n\n#print(query)\nans = [[0] * m for i in range(n)]\n\nfor i in range(q - 1, -1, -1):\n\tif query[i] == 3:\n\t\tans[rows[i]][cols[i]] = nums[i]\n\t\t#print('\\n')\n\t\t#print_matr(ans, n)\n\t\t#print(\"l\", rows[i] + 1, cols[i] + 1)\n\t\t#print(i, nums[i])\n\telif query[i] == 1:\n\t\tans = rotate_r(ans, rows[i], 1)\n\t\t#print('\\n')\n\t\t#print_matr(ans, n)\n\telse:\n\t\tans = rotate_c(ans, n, cols[i])\n\t\t#print('\\n')\n\t\t#print_matr(ans, n)\n\n#row, n = map(int, input().split())\n\n#print(rotate_r(ar2, 0, n))\nprint_matr(ans, n)\n#ans = rotate_c(ans, n, 0)\n#print_matr(ans, n)\n", "f = lambda: map(int, input().split())\r\nn, m, q = f()\r\np = [[0] * m for j in range(n)]\r\nfor t in [list(f()) for k in range(q)][::-1]:\r\n j = t[1] - 1\r\n if t[0] == 1: p[j].insert(0, p[j].pop())\r\n elif t[0] == 2: \r\n s = p[-1][j]\r\n for i in range(n - 1, 0, -1): p[i][j] = p[i - 1][j]\r\n p[0][j] = s\r\n else: p[j][t[2] - 1] = t[3]\r\nfor d in p: print(*d)", "a, b, c = map(int, input().split())\r\narr = []\r\nmat = [[0 for j in range(b)] for i in range(a)]\r\nfor i in range(c):\r\n arr.append(input())\r\narr = arr[::-1]\r\nfor command in arr:\r\n arra = [int(i) for i in command.split()]\r\n if arra[0] == 1:\r\n swp = mat[arra[1] - 1][b - 1]\r\n for i in range(b):\r\n mat[arra[1] - 1][i], swp = swp, mat[arra[1] - 1][i]\r\n elif arra[0] == 2:\r\n swp = mat[a - 1][arra[1] - 1]\r\n for i in range(a):\r\n mat[i][arra[1] - 1], swp = swp, mat[i][arra[1] - 1]\r\n else:\r\n mat[arra[1] - 1][arra[2] - 1] = arra[3]\r\nfor i in mat:\r\n for j in i:\r\n print(j, end=\" \")\r\n print()", "import sys\nimport time\nfrom pprint import pprint\nfrom sys import stderr\nfrom itertools import combinations\n\nINF = 10 ** 18 + 3\nEPS = 1e-10\nMAX_CACHE = 10 ** 9\n\n\n# Decorators\ndef time_it(function, output=stderr):\n def wrapped(*args, **kwargs):\n start = time.time()\n res = function(*args, **kwargs)\n elapsed_time = time.time() - start\n print('\"%s\" took %f ms' % (function.__name__, elapsed_time * 1000),\n file=output)\n return res\n\n return wrapped\n\n\n@time_it\ndef main():\n n, m, q = map(int, input().split())\n matrix = [[(x, y) for x in range(m)]\n for y in range(n)]\n init_matrix = [[0] * m for _ in range(n)]\n\n for _ in range(q):\n args = list(map(int, input().split()))\n t = args[1] - 1\n if args[0] == 1:\n matrix[t] = matrix[t][1:] + matrix[t][:1]\n elif args[0] == 2:\n first = matrix[0][t]\n for i in range(n - 1):\n matrix[i][t] = matrix[i + 1][t]\n matrix[n - 1][t] = first\n else:\n r = args[2] - 1\n x = args[3]\n init_matrix[matrix[t][r][1]][matrix[t][r][0]] = x\n\n for row in init_matrix:\n print(*row)\n\n\ndef set_input(file):\n global input\n input = lambda: file.readline().strip()\n\n\ndef set_output(file):\n global print\n local_print = print\n\n def print(*args, **kwargs):\n kwargs[\"file\"] = kwargs.get(\"file\", file)\n return local_print(*args, **kwargs)\n\n\nif __name__ == '__main__':\n set_input(open(\"input.txt\", \"r\") if \"MINE\" in sys.argv else sys.stdin)\n set_output(sys.stdout)\n main()\n", "n, m, q = map(int, input().split())\r\nmass = []\r\nfor i in range(q):\r\n mass.insert(0,(list(map(int, input().split()))))\r\n#print(mass)\r\nmatrix = [[0] * m for i in range(n)]\r\n#print(matrix)\r\nfor i in range(q):\r\n if mass[i][0] == 3:\r\n matrix[mass[i][1]-1][mass[i][2]-1] = mass[i][3]\r\n elif mass[i][0] == 1:\r\n tmp = matrix[mass[i][1]-1][m-1]\r\n for j in range(m-1, 0, -1):\r\n matrix[mass[i][1]-1][j] = matrix[mass[i][1]-1][j-1]\r\n #print(matrix[mass[i][1]-1])\r\n matrix[mass[i][1]-1][0] = tmp\r\n else:\r\n tmp = matrix[n-1][mass[i][1]-1]\r\n for k in range(n-1, 0, -1):\r\n matrix[k][mass[i][1]-1] = matrix[k-1][mass[i][1]-1]\r\n matrix[0][mass[i][1]-1] = tmp\r\nfor i in range(n):\r\n print(' '.join(list(map(str, matrix[i]))))\r\n \r\n", "\ndef C():\n d = input().split(\" \")\n n = int(d[0])\n m = int(d[1])\n s = int(d[2])\n z = []\n matr = []\n for i in range(n):\n cur = []\n for j in range(m):\n cur.append(0)\n matr.append(cur)\n\n\n for i in range(s):\n zapr = []\n cur = input().split(\" \")\n zapr = list(map(int,cur))\n z.append(zapr)\n\n for i in range(s):\n a = z[s - i -1]\n if(a[0] == 1):\n matr = shift_r(matr, a[1]-1,m)\n if(a[0] == 2):\n matr = shift_d(matr,a[1]-1,n)\n if(a[0] == 3):\n matr[a[1]-1][a[2]-1] = a[3]\n for i in range(n):\n cur = \"\"\n for j in range(m):\n cur += str(matr[i][j]) + \" \"\n print(cur)\n\n\n\ndef shift_r(mm, pos = 0, n = 0):\n curr = int(mm[pos][-1])\n for i in range(n -1):\n mm[pos][n - i - 1] = mm[pos][n - i - 2]\n mm[pos][0] = curr\n return mm\n\ndef shift_d(mm, pos = 0, n = 0):\n curr = int(mm[-1][pos])\n for i in range(n - 1):\n mm[n - i - 1][pos] = mm[n - i - 2][pos]\n mm[0][pos] = curr\n return mm\n\n\n\nC()", "import sys\nsys.stderr = sys.stdout\n\n\ndef matrix(n, m, q, O):\n V = [0] * (n * m)\n M = [list(range(i0, i0+m)) for i0 in range(0, n*m, m)]\n for o in O:\n if o[0] == 1:\n t, r = o\n r -= 1\n p = M[r][0]\n for j in reversed(range(m)):\n p, M[r][j] = M[r][j], p\n elif o[0] == 2:\n t, c = o\n c -= 1\n p = M[0][c]\n for i in reversed(range(n)):\n p, M[i][c] = M[i][c], p\n else:\n t, r, c, x = o\n r -= 1\n c -= 1\n V[M[r][c]] = x\n return [V[i0:i0+m] for i0 in range(0, n*m, m)]\n\n\ndef main():\n n, m, q = readinti()\n O = readinttl(q)\n M = matrix(n, m, q, O)\n print('\\n'.join(' '.join(map(str, M_i)) for M_i in M))\n\n##########\n\ndef readint():\n return int(input())\n\n\ndef readinti():\n return map(int, input().split())\n\n\ndef readintt():\n return tuple(readinti())\n\n\ndef readintl():\n return list(readinti())\n\n\ndef readinttl(k):\n return [readintt() for _ in range(k)]\n\n\ndef readintll(k):\n return [readintl() for _ in range(k)]\n\n\ndef log(*args, **kwargs):\n print(*args, **kwargs, file=sys.__stderr__)\n\n\nif __name__ == '__main__':\n main()\n", "#I = lambda: [int(i) for i in input().split()]\r\n#import io, os, sys\r\n#input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\n\r\n\r\n# n = int(input())\r\n# l1 = list(map(int,input().split()))\r\n# n,x = map(int,input().split())\r\n# s = input()\r\nmod = 1000000007\r\n# print(\"Case #\"+str(_+1)+\":\",)\r\n\r\nfrom collections import Counter,defaultdict\r\nimport sys\r\nimport math\r\n#import bisect\r\n\r\nn,m,q = map(int,input().split())\r\nx = [[[i,j] for j in range(m)] for i in range(n)]\r\nans = [[0 for i in range(m)] for i in range(n)]\r\nfor i in range(q):\r\n l = list(map(int,input().split()))\r\n \r\n if l[0]==1:\r\n l[1]-=1\r\n t = x[l[1]][0]\r\n for j in range(m-1):\r\n x[l[1]][j]=x[l[1]][j+1]\r\n x[l[1]][-1]=t\r\n elif l[0]==2:\r\n l[1]-=1\r\n t = x[0][l[1]]\r\n for j in range(n-1):\r\n x[j][l[1]]=x[j+1][l[1]]\r\n x[-1][l[1]]=t\r\n else:\r\n a=l[1];b=l[2]\r\n a-=1;b-=1\r\n ans[x[a][b][0]][x[a][b][1]]=l[3]\r\nfor i in range(n):\r\n print(*ans[i])\r\n \r\n\r\n \r\n \r\n" ]

[ "l = [[],[],[],[],[],[]];\r\ny = [[3, 3, 4, 4, 3, 3],\r\n [3, 3, 4, 4, 3, 3],\r\n [2, 2, 3, 3, 2, 2],\r\n [2, 2, 3, 3, 2, 2],\r\n [1, 1, 2, 2, 1, 1],\r\n [1, 1, 2, 2, 1, 1]]\r\nfor i in range(6):\r\n s = input()\r\n for j in s:\r\n if (j != '-'):\r\n l[i].append(j)\r\nmaxm = 0\r\nmaxi = 0\r\nmaxj = 0\r\nfor i in range(6):\r\n for j in range(6):\r\n if (l[i][j] == '.'):\r\n if (y[i][j] > maxm):\r\n maxm = y[i][j]\r\n maxi = i\r\n maxj = j\r\nl[maxi][maxj] = 'P'\r\nfor i in range(6):\r\n print(l[i][0], l[i][1], '-', l[i][2], l[i][3], '-',l[i][4], l[i][5], sep = '')", "matrix = []\r\n\r\ndef findEmpty(rs, re, cs, ce):\r\n for i in range(cs, ce):\r\n for j in range(rs, re):\r\n if(matrix[j][i] != '*'):\r\n matrix[j][i] = 'P'\r\n return True\r\n return False\r\n\r\ndef findFour():\r\n return findEmpty(0, 2, 3, 5)\r\n\r\ndef findThree():\r\n re = findEmpty(0, 2, 0, 2)\r\n if (re):\r\n return True\r\n re = findEmpty(0, 2, 6, 8)\r\n if (re):\r\n return True\r\n re = findEmpty(2, 4, 3, 5)\r\n return re\r\n\r\ndef findTwo():\r\n re = findEmpty(2, 4, 0, 2)\r\n if (re):\r\n return True\r\n re = findEmpty(2, 4, 6, 8)\r\n if (re):\r\n return True\r\n re = findEmpty(4, 6, 3, 5)\r\n return re\r\n\r\ndef findOne():\r\n re = findEmpty(4, 6, 0, 2)\r\n if (re):\r\n return True\r\n re = findEmpty(4, 6, 6, 8)\r\n return re\r\n\r\nfor i in range(6):\r\n a = list(input())\r\n matrix.append(a)\r\n\r\ndef printMatrix():\r\n for i in range(6):\r\n print(''.join(matrix[i]))\r\n\r\nif (findFour()):\r\n printMatrix()\r\nelif (findThree()):\r\n printMatrix()\r\nelif (findTwo()):\r\n printMatrix()\r\nelif (findOne()):\r\n printMatrix()\r\n ", "\r\ndef pick_any(line1, line2):\r\n if \".\" not in (line1 + line2):\r\n return None\r\n if line1[3] == \".\":\r\n return 3\r\n if line1[4] == \".\":\r\n return 4\r\n if line2[3] == \".\":\r\n return 11\r\n if line2[4] == \".\":\r\n return 12\r\n return (line1 + line2).index(\".\")\r\n\r\n\r\nplaces = [input() for _ in range(0, 6)]\r\n\r\noffset = 0\r\n\r\nfor i in range(0, 6, 2):\r\n a, b = places[i:i + 2]\r\n res = pick_any(a, b)\r\n if res is not None:\r\n if res >= 8:\r\n res %= 8\r\n offset += 1\r\n line = list(places[offset])\r\n line[res] = \"P\"\r\n places[offset] = \"\".join(line)\r\n print(*places, sep='\\n')\r\n break\r\n offset += 2\r\n\r\n", "a, b, x, y, m = [list(input()) for i in range(6)], [3, 3, 0, 4, 4, 0, 3, 3], 0, 0, 0\r\nfor i in range(6):\r\n for j in range(8):\r\n c = b[j] - i // 2\r\n if a[i][j] == '.' and c > m:\r\n x, y, m = i, j, c\r\na[x][y] = 'P'\r\nprint('\\n'.join(''.join(x) for x in a))\r\n", "a = []\r\nfor i in range(6):\r\n\ttmp = input()\r\n\ta.append(tmp)\r\n\r\nb = [[3,3,-1,4,4,-1,3,3],\r\n [3,3,-1,4,4,-1,3,3], \r\n [2,2,-1,3,3,-1,2,2],\r\n [2,2,-1,3,3,-1,2,2],\r\n [1,1,-1,2,2,-1,1,1],\r\n [1,1,-1,2,2,-1,1,1],]\r\n\r\nr = -1\r\nc = -1\r\nval = -2\r\n\r\nfor i in range(6):\r\n\tfor j in range(8):\r\n\t\tif a[i][j]=='.' and b[i][j] > val:\r\n\t\t\tval = b[i][j]\r\n\t\t\tr = i\r\n\t\t\tc = j\r\n\r\ntmp = ''\r\nfor i in range(c):\r\n tmp += a[r][i]\r\ntmp += 'P'\r\nfor i in range(c+1,8):\r\n tmp += a[r][i]\r\n \r\na[r] = tmp\r\n\r\nfor i in range(6):\r\n\tprint(a[i])\r\n\r\n", "arr = [[3, 3, 4, 4, 3, 3],\r\n[3, 3, 4, 4, 3, 3],\r\n[2, 2, 3, 3, 2, 2],\r\n[2, 2, 3, 3, 2, 2],\r\n[1, 1, 2, 2, 1, 1],\r\n[1, 1, 2, 2, 1, 1]]\r\n\r\nbestX = -1\r\nbestY = -1\r\nbestI = -1\r\n\r\nlines = [''] * 6\r\nfor i in range(6):\r\n lines[i] = input()\r\n cnt = 0\r\n for j in range(8):\r\n if lines[i][j] == '.':\r\n if bestX == -1 or arr[bestY][bestX] < arr[i][cnt]:\r\n bestY, bestX, bestI = i, cnt, j\r\n\r\n if j != 2 and j != 5:\r\n cnt += 1\r\n\r\nlines[bestY] = lines[bestY][:bestI] + 'P' + lines[bestY][bestI + 1:]\r\n\r\n\r\nfor i in range(6):\r\n print(lines[i])\r\n", "table = [[3, 3, 0, 4, 4, 0, 3, 3],\r\n [3, 3, 0, 4, 4, 0, 3, 3],\r\n [2, 2, 0, 3, 3, 0, 2, 2],\r\n [2, 2, 0, 3, 3, 0, 2, 2],\r\n [1, 1, 0, 2, 2, 0, 1, 1],\r\n [1, 1, 0, 2, 2, 0, 1, 1]]\r\n\r\n\r\n\r\nl = []\r\nfor i in range(6):\r\n s = input();\r\n ll = [] \r\n for c in s:\r\n ll.append(c)\r\n l.append(ll) \r\n\r\nfor k in [4, 3, 2, 1]:\r\n for i in range(6):\r\n for j in range(8):\r\n if (table[i][j] == k and l[i][j] == \".\"):\r\n l[i][j] = 'P';\r\n for ll in l:\r\n s = \"\"\r\n for c in ll:\r\n s = s + c \r\n print(s) \r\n exit()", "a = []\n\ndef printgrid():\n for i in range(6):\n for j in range(len(a[i])):\n print(a[i][j], end=\"\")\n print()\n\ndef solve():\n for i in range(6):\n x = list(input())\n a.append(x)\n\n\n for i in [0, 1]: \n for j in [3, 4]: \n if a[i][j] == '.':\n a[i][j] = 'P'\n printgrid()\n return\n\n\n for i in [0, 1]: \n for j in [0, 1, 6, 7]: \n if a[i][j] == '.':\n a[i][j] = 'P'\n printgrid()\n return\n\n for i in [2, 3]: \n for j in [3, 4]: \n if a[i][j] == '.':\n a[i][j] = 'P'\n printgrid()\n return\n\n\n for i in [2, 3]: \n for j in [0, 1, 6, 7]: \n if a[i][j] == '.':\n a[i][j] = 'P'\n printgrid()\n return\n\n for i in [4, 5]: \n for j in [3, 4]: \n if a[i][j] == '.':\n a[i][j] = 'P'\n printgrid()\n return\n\n\n for i in [4, 5]: \n for j in [0, 1, 6, 7]: \n if a[i][j] == '.':\n a[i][j] = 'P'\n printgrid()\n return\n\nsolve();\n", "from collections import defaultdict\r\n\r\nfor _ in range(1):\r\n # n = int(input())\r\n # n,k = map(int,input().split())\r\n l = []\r\n for i in range(6):\r\n s = list(input())\r\n l.append(s)\r\n d = defaultdict(lambda : [])\r\n d[4].extend([(0,3),(0,4),(1,3),(1,4)])\r\n d[3].extend([(0,0),(0,1),(1,0),(1,1),(0,6),(0,7),(1,6),(1,7),(2,3),(2,4),(3,3),(3,4)])\r\n d[2].extend([(2,0),(2,1),(3,0),(3,1),(2,6),(2,7),(3,6),(3,7),(4,3),(4,4),(5,3),(5,4)])\r\n d[1].extend([(4,0),(4,1),(5,0),(5,1),(4,6),(4,7),(5,6),(5,7)])\r\n c = 4\r\n while c > 0:\r\n can = False\r\n for i in d[c]:\r\n if (l[i[0]][i[1]] == '.'):\r\n l[i[0]][i[1]] = 'P'\r\n can = True\r\n break\r\n if can:\r\n break\r\n c -= 1\r\n for i in l:\r\n print(''.join(i))\r\n \r\n", "mas = [3,3,0,4,4,0,3,3,3,3,0,4,4,0,3,3,2,2,0,3,3,0,2,2,2,2,0,3,3,0,2,2,1,1,0,2,2,0,1,1,1,1,0,2,2,0,1,1]\r\ns1 = input()\r\ns2 = input()\r\ns3 = input()\r\ns4 = input()\r\ns5 = input()\r\ns6 = input()\r\nf = -1\r\ned = -1\r\ns = s1 + s2 + s3 + s4 + s5 + s6\r\nfor i in range(48):\r\n if s[i] != '*' and s[i] != '-':\r\n if int(mas[i]) > ed:\r\n ed = int(mas[i])\r\n f = i\r\ns = list(s)\r\ns[f] = 'P'\r\ns = ''.join(s)\r\nfor i in range(6):\r\n print(s[i*8: i*8 + 8])", "\r\n\r\ndef main():\r\n\r\n data = ''\r\n for _ in range(6):\r\n data += input()\r\n\r\n parts = list(data)\r\n\r\n idxs = [3, 4, 11, 12, 0, 1, 6, 7, 8, 9, 14, 15, 19, 20, 27, 28, 16,\r\n 17, 22, 23, 24, 25, 30, 31, 35, 36, 43, 44, 32, 33, 38, 39,\r\n 40, 41, 46, 47]\r\n\r\n for i in idxs:\r\n if parts[i] == '.':\r\n parts[i] = 'P'\r\n break\r\n\r\n result = ''\r\n c = 0\r\n for i in parts:\r\n result += i\r\n c += 1\r\n if c == 8:\r\n c = 0\r\n result += '\\n'\r\n\r\n print(result)\r\n\r\n\r\nmain()\r\n", "m = [\r\n [3,3,4,4,3,3],\r\n [3,3,4,4,3,3],\r\n [2,2,3,3,2,2],\r\n [2,2,3,3,2,2],\r\n [1,1,2,2,1,1],\r\n [1,1,2,2,1,1]\r\n]\r\nmx = 0\r\nk = [list(input().replace('-', '')) for i in range(6)]\r\nfor y in range(6):\r\n for x in range(6):\r\n if k[y][x] == '.':\r\n if m[y][x] > mx:\r\n mx = max(m[y][x], mx)\r\n maxpos = (y, x)\r\nk[maxpos[0]][maxpos[1]] = 'P'\r\nk = [l[:2]+['-']+l[2:4]+['-']+l[4:] for l in k]\r\nfor l in k:\r\n print(*l,sep='')", "import sys\r\n\r\ndef getw(i, j):\r\n res = 0\r\n if j == 3 or j == 4:\r\n res = 2\r\n else:\r\n res = 1\r\n if i < 4:\r\n res = res + 1\r\n if i < 2:\r\n res = res + 1\r\n return res\r\n\r\nid = 0\r\nw = 0\r\nkek = []\r\n\r\nfor line in sys.stdin:\r\n kek.append(line)\r\n\r\nfor i in range(6):\r\n for j in range(8):\r\n if j == 2 or j == 5:\r\n continue\r\n if kek[i][j] == '*':\r\n continue\r\n w = max(w, getw(i, j))\r\n \r\nwas = False\r\nfor i in range(6):\r\n out = \"\"\r\n for j in range(8):\r\n if j == 2 or j == 5:\r\n out = out + kek[i][j]\r\n continue\r\n if was == True:\r\n out = out + kek[i][j]\r\n continue\r\n if kek[i][j] == '*':\r\n out = out + kek[i][j]\r\n continue\r\n if getw(i, j) == w:\r\n was = True\r\n out = out + 'P'\r\n else:\r\n out = out + kek[i][j]\r\n print(out)", "lst = [input().strip() for _ in range(6)]\r\n\r\nind4 = ((0, 3), (0, 4), (1, 3), (1, 4))\r\nind3 = ((0, 0), (0, 1), (0, 6), (0, 7), (1, 0), (1, 1), (1, 6), (1, 7), (2, 3), (2, 4), (3, 3), (3, 4))\r\nind2 = ((2, 0), (2, 1), (2, 6), (2, 7), (3, 0), (3, 1), (3, 6), (3, 7), (4, 3), (4, 4), (5, 3), (5, 4))\r\nind1 = ((4, 0), (4, 1), (4, 6), (4, 7), (5, 0), (5, 1), (5, 6), (5, 7))\r\n\r\nif any(lst[i][j] == '.' for i, j in ind4):\r\n for i, j in ind4:\r\n if lst[i][j] == '.':\r\n lst[i] = lst[i][:j] + 'P' + lst[i][j + 1:]\r\n break\r\nelif any(lst[i][j] == '.' for i, j in ind3):\r\n for i, j in ind3:\r\n if lst[i][j] == '.':\r\n lst[i] = lst[i][:j] + 'P' + lst[i][j + 1:]\r\n break\r\nelif any(lst[i][j] == '.' for i, j in ind2):\r\n for i, j in ind2:\r\n if lst[i][j] == '.':\r\n lst[i] = lst[i][:j] + 'P' + lst[i][j + 1:]\r\n break\r\nelse:\r\n for i, j in ind1:\r\n if lst[i][j] == '.':\r\n lst[i] = lst[i][:j] + 'P' + lst[i][j + 1:]\r\n break\r\n\r\nfor row in lst: print(row)", "room = []\r\n\r\nvalues = [[3,3,0,4,4,0,3,3],[3,3,0,4,4,0,3,3],[2,2,0,3,3,0,2,2],[2,2,0,3,3,0,2,2],[1,1,0,2,2,0,1,1],[1,1,0,2,2,0,1,1]]\r\n\r\nfor i in range(6):\r\n room.append(input())\r\n\r\npx, py = -1, -1\r\nbest = -1\r\nfor i in range(6):\r\n for j in range(8):\r\n if room[i][j] == '.' and best < values[i][j]:\r\n px, py = i, j\r\n best = values[i][j]\r\nans = []\r\nfor i in range(6):\r\n if px != i:\r\n ans.append(room[i])\r\n else:\r\n ans.append((room[i])[:py] + 'P' + (room[i])[py+1:])\r\nfor i in range(6):\r\n print(ans[i])", "a = [[3, 3, 4, 4, 3, 3],\r\n [3, 3, 4, 4, 3, 3],\r\n [2, 2, 3, 3, 2, 2],\r\n [2, 2, 3, 3, 2, 2],\r\n [1, 1, 2, 2, 1, 1],\r\n [1, 1, 2, 2, 1, 1]]\r\n\r\nb = []\r\ngo = True\r\nfor i in range(6):\r\n b.append(input())\r\nfor x in range(4, 0, -1):\r\n for i in range(6):\r\n for j in range(6):\r\n if a[i][j] == x:\r\n if b[i][j + j // 2] == '.':\r\n b[i] = b[i][:j + j // 2] + 'P' + b[i][j + j // 2 + 1:]\r\n go = False\r\n break\r\n if not go:\r\n break\r\n if not go:\r\n break\r\n[print(i) for i in b]", "def f(x, y) :\r\n return 3 - y + (x == 1)\r\n\r\ndef g(y) :\r\n return y // 2\r\nS = list()\r\nans = 0\r\nfor i in range(0, 6) :\r\n s = input()\r\n for j in range(0, len(s)) :\r\n if (s[j] == '.') :\r\n ans = max(ans, f(j // 3, g(i)))\r\n S.append(s)\r\nflag = True;\r\nfor i in range(0, 6) :\r\n s = S[i]\r\n if flag :\r\n for j in range(0, len(s)) :\r\n if (s[j] == '.' and f(j // 3, g(i)) == ans) :\r\n if (j == 0) :\r\n s = 'P' + s[1:]\r\n else :\r\n s = s[0:j] + 'P' + s[(j + 1):]\r\n flag = False\r\n break\r\n print(s)", "a = [[3, 3, 4, 4, 3, 3], [3, 3, 4, 4, 3, 3], [2, 2, 3, 3, 2, 2], [2, 2, 3, 3, 2, 2], [1, 1, 2, 2, 1, 1], [1, 1, 2, 2, 1, 1]]\r\nb = [\"\".join(input().split('-')) for i in range(6)]\r\nans = []\r\nfor i in range(6):\r\n\tfor j in range(6):\r\n\t\tif b[i][j] == '.':\r\n\t\t\tans.append([a[i][j], i, j])\r\nans.sort(reverse=True)\r\nfor i in range(6):\r\n\tfor j in range(6):\r\n\t\tif i == ans[0][1] and j == ans[0][2]:\r\n\t\t\tprint('P', end='')\r\n\t\telse:\r\n\t\t\tprint(b[i][j], end='')\r\n\t\tif j == 1 or j == 3:\r\n\t\t\tprint('-', end='')\r\n\tprint('')", "def main():\n score = [[3, 3, 0, 4, 4, 0, 3, 3],\n [3, 3, 0, 4, 4, 0, 3, 3],\n [2, 2, 0, 3, 3, 0, 2, 2],\n [2, 2, 0, 3, 3, 0, 2, 2],\n [1, 1, 0, 2, 2, 0, 1, 1],\n [1, 1, 0, 2, 2, 0, 1, 1]]\n grid = [input() for _ in range(6)]\n\n ans = (0, 0)\n mx = 0\n for i in range(len(grid)):\n for j in range(len(grid[i])):\n if grid[i][j] == '_':\n continue\n\n if grid[i][j] == '.' and score[i][j] > mx:\n mx = score[i][j]\n ans = (i, j)\n\n for i in range(len(grid)):\n line = ''\n for j in range(len(grid[i])):\n if i == ans[0] and j == ans[1]:\n line += 'P'\n else:\n line += grid[i][j]\n print(line)\n\nif __name__ == \"__main__\":\n main()\n", "scores = [[3, 3, 4, 4, 3, 3],\r\n [3, 3, 4, 4, 3, 3],\r\n [2, 2, 3, 3, 2, 2],\r\n [2, 2, 3, 3, 2, 2],\r\n [1, 1, 2, 2, 1, 1],\r\n [1, 1, 2, 2, 1, 1]]\r\n\r\nplaces = []\r\n\r\noriginal = []\r\ndef fill():\r\n for i in range(6):\r\n places.append([False]*6)\r\ndef main():\r\n fill()\r\n for y in range(6):\r\n rzad = (input().strip()).split(\"-\")\r\n original.append(rzad)\r\n sumed = (rzad[0] + rzad[1]) + rzad[2]\r\n #print(sumed)\r\n for x in range(6):\r\n if (sumed[x] == '*'):\r\n #print(x, y)\r\n places[x][y] = True\r\n #print(places[0][2], \"<----\")\r\n najw = -1\r\n koor = (-1, -1)\r\n for x in range(6):\r\n for y in range(6):\r\n if (not places[x][y]):\r\n #print((x, y), scores[y][x])\r\n if (scores[y][x] >= najw):\r\n najw = scores[y][x]\r\n koor = (x, y)\r\n if (koor[0]%2 == 0):\r\n original[koor[1]][koor[0]//2] = 'P' + original[koor[1]][koor[0]//2][1]\r\n\r\n if (koor[0]%2 == 1):\r\n original[koor[1]][koor[0]//2] = original[koor[1]][koor[0]//2][0] + 'P'\r\n \r\n for ele in original:\r\n print(\"-\".join(ele))\r\n\r\nmain()\r\n", "\r\nar = [\r\n [3, 3, -1, 4, 4, -1, 3, 3],\r\n [3, 3, -1, 4, 4, -1, 3, 3],\r\n [2, 2, -1, 3, 3, -1, 2, 2],\r\n [2, 2, -1, 3, 3, -1, 2, 2],\r\n [1, 1, -1, 2, 2, -1, 1, 1],\r\n [1, 1, -1, 2, 2, -1, 1, 1],\r\n]\r\n\r\nstd = []\r\n\r\ndef main():\r\n mx = -1\r\n mq = -1\r\n mi = -1\r\n for q in range(6):\r\n s = input()\r\n std.append(s)\r\n for i in range(8):\r\n if( s[i] == '.' and ar[q][i] > mx):\r\n mx = ar[q][i]\r\n mq = q\r\n mi = i\r\n for q in range(6):\r\n s = \"\"\r\n for i in range(8):\r\n if(q == mq and i == mi):\r\n s += \"P\"\r\n else:\r\n s += std[q][i]\r\n print(s)\r\n\r\nmain()\r\n", "import math\r\nimport sys\r\nimport queue\r\nfrom heapq import heappop, heappush\r\nimport random\r\n\r\n\r\n# ..-**-..\r\n# ..-**-..\r\n# ..-..-..\r\n# ..-..-..\r\n# ..-..-..\r\n# ..-..-..\r\n\r\ndef solve():\r\n x, y = 0, 0\r\n mx = 0\r\n\r\n p = [[3, 4, 3], [2, 3, 2], [1, 2, 1]]\r\n\r\n f = []\r\n\r\n for row in range(6):\r\n s = list(str(input()))\r\n f.append(s)\r\n for i in range(0, len(s), 3):\r\n for j in range(2):\r\n if s[i + j] == \".\":\r\n if p[row // 2][i // 3] > mx:\r\n mx = p[row // 2][i // 3]\r\n x, y = row, i + j\r\n f[x][y] = \"P\"\r\n for i in range(6):\r\n print(\"\".join(f[i]))\r\n\r\n\r\nif __name__ == '__main__':\r\n multi_test = 0\r\n\r\n if multi_test:\r\n t = int(input())\r\n for _ in range(t):\r\n solve()\r\n else:\r\n solve()\r\n", "conv = [[3,3,-1,4,4,-1,3,3],\r\n [3,3,-1,4,4,-1,3,3],\r\n [2,2,-1,3,3,-1,2,2],\r\n [2,2,-1,3,3,-1,2,2],\r\n [1,1,-1,2,2,-1,1,1],\r\n [1,1,-1,2,2,-1,1,1]]\r\n\r\nroom = []\r\nfor i in range(6):\r\n row = input()\r\n row = list(row)\r\n room.append(row)\r\n\r\nmax_conv=-1\r\nmax_i=-1\r\nmax_j=-1\r\n\r\nfor i in range(6):\r\n for j in range(8):\r\n if (room[i][j] == '.'):\r\n if (conv[i][j] > max_conv):\r\n max_conv=conv[i][j]\r\n max_i = i\r\n max_j = j\r\n\r\nfor i in range(6):\r\n for j in range(8):\r\n if (i == max_i and j == max_j):\r\n print('P',end='')\r\n else:\r\n print(room[i][j],end='')\r\n print()\r\n", "n = 6\r\nm = 8;\r\na = [];\r\nb = [];\r\nfor i in range(n) :\r\n a.append(list(input()))\r\nb.append([3, 3, 0, 4, 4, 0, 3, 3])\r\nb.append([3, 3, 0, 4, 4, 0, 3, 3])\r\nb.append([2, 2, 0, 3, 3, 0, 2, 2])\r\nb.append([2, 2, 0, 3, 3, 0, 2, 2])\r\nb.append([1, 1, 0, 2, 2, 0, 1, 1])\r\nb.append([1, 1, 0, 2, 2, 0, 1, 1])\r\nii=0\r\njj=0\r\nx=0\r\nfor i in range(n) :\r\n for j in range(m) :\r\n if a[i][j] == '.' and x < b[i][j]:\r\n ii = i\r\n jj = j\r\n x = b[i][j]\r\na[ii][jj] = 'P'\r\nfor i in range(n) :\r\n for j in range (m) :\r\n print (a[i][j], end = '')\r\n print ()\r\n\r\n", "cost = [\r\n [3, 3, 0, 4, 4, 0, 3, 3],\r\n [3, 3, 0, 4, 4, 0, 3, 3],\r\n [2, 2, 0, 3, 3, 0, 2, 2],\r\n [2, 2, 0, 3, 3, 0, 2, 2],\r\n [1, 1, 0, 2, 2, 0, 1, 1],\r\n [1, 1, 0, 2, 2, 0, 1, 1]]\r\n\r\narr = []\r\nans = 0\r\n\r\nfor row in range(6):\r\n arr.append(input())\r\n for col in range(8):\r\n if cost[row][col] > ans and arr[row][col] == '.':\r\n ans = cost[row][col]\r\n\r\nfor row in range(6):\r\n for col in range(8):\r\n if cost[row][col] == ans and arr[row][col] == '.':\r\n arr[row] = arr[row][:col] + 'P' + arr[row][col + 1:]\r\n ans = -1\r\n break\r\n print(arr[row])\r\n", "def good(i, j):\n x = i // 2\n y = j // 2\n return (3 - x) + (y == 1)\n\n\nb = [0] * 6\nfor i in range(6):\n b[i] = input().split('-')\n b[i] = [b[i][0][0], b[i][0][1], b[i][1][0], b[i][1][1], b[i][2][0], b[i][2][1]]\nmx = 0\nmi = 0\nmj = 0;\nfor i in range(6):\n for j in range(6):\n if b[i][j] == '.':\n if (good(i, j) > mx):\n mx = good(i, j)\n mi = i\n mj = j\nb[mi][mj] = 'P'\nfor i in range(6):\n print(b[i][0] + b[i][1] + '-' + b[i][2] + b[i][3] + '-' + b[i][4] + b[i][5])\n\n \n\n", "txt = []\na =''\nfor i in range(6):\n a = input()\n txt.append(a)\n\nb = [[3,3,0,4,4,0,3,3], [3,3,0,4,4,0,3,3], [2,2,0,3,3,0,2,2], [2,2,0,3,3,0,2,2], [1,1,0,2,2,0,1,1], [1,1,0,2,2,0,1,1]]\n\nmax = 0\nmaxi =0\nmaxj = 0\nfor i in range(6):\n for j in range(8):\n if (txt[i][j] == '.'):\n if(b[i][j] > max):\n max = b[i][j]\n maxi = i\n maxj = j\n\nfor i in range(6):\n if (i == maxi):\n print(txt[i][:maxj] + 'P' + txt[i][maxj+1:])\n continue\n print(txt[i])\n", "l=[input() for i in range(6)]\r\nans,ansi,ansj=int(),int(),int()\r\nfor i in range(len(l)):\r\n for j in range(len(l[i])):\r\n c=l[i][j]\r\n if c=='-' or c=='*':\r\n continue\r\n k=6-i-1\r\n cc=k//2+1\r\n if j==3 or j==4:\r\n cc+=1\r\n if cc>=ans:\r\n ansi=i\r\n ansj=j\r\n ans=cc\r\nl[ansi]=l[ansi][:ansj]+'P'+l[ansi][(ansj+1):]\r\nfor i in l:\r\n print(i)\r\n", "def main():\r\n strings = []\r\n for i in range(6):\r\n s = input()\r\n strings.append(s)\r\n matrix = [[3, 3, 0, 4, 4, 0, 3, 3], [3, 3, 0, 4, 4, 0, 3, 3], [2, 2, 0, 3, 3, 0, 2, 2],\r\n [2, 2, 0, 3, 3, 0, 2, 2], [1, 1, 0, 2, 2, 0, 1, 1], [1, 1, 0, 2, 2, 0, 1, 1]]\r\n count = 0\r\n i_global = 5\r\n j_global = 5\r\n for i in range(6):\r\n j = 0\r\n while j < 8:\r\n if strings[i][j] == '.':\r\n if matrix[i][j] > count:\r\n count = matrix[i][j]\r\n i_global = i\r\n j_global = j\r\n if j == 1 or j == 4:\r\n j += 2\r\n else:\r\n j += 1\r\n if j_global == 0:\r\n strings[i_global] = 'P' + strings[i_global][1:]\r\n elif j_global == 5:\r\n strings[i_global] = strings[i_global][:j_global] + 'P'\r\n else:\r\n strings[i_global] = strings[i_global][:j_global] + 'P' + strings[i_global][j_global + 1:]\r\n\r\n for i in range(6):\r\n print(strings[i])\r\n\r\nmain()", "a = [\r\n [3, 3, -1, 4, 4, -1, 3, 3],\r\n [3, 3, -1, 4, 4, -1, 3, 3],\r\n [2, 2, -1, 3, 3, -1, 2, 2],\r\n [2, 2, -1, 3, 3, -1, 2, 2],\r\n [1, 1, -1, 2, 2, -1, 1, 1],\r\n [1, 1, -1, 2, 2, -1, 1, 1]\r\n]\r\n\r\ns = []\r\nfor i in range(6):\r\n s.append(input())\r\n\r\nmx = -1\r\nx = -1\r\ny = -1\r\nfor i in range(6):\r\n for j in range(8):\r\n if s[i][j] == '-': continue\r\n elif s[i][j] == '.':\r\n if a[i][j] > mx:\r\n x = i\r\n y = j\r\n mx = a[i][j]\r\nfor i in range(6):\r\n k = ''\r\n for j in range(8):\r\n if i == x and j == y:\r\n k += 'P'\r\n else:\r\n k += s[i][j]\r\n print(k)\r\n", "s = []\r\nc = []\r\nc += [3 , 3 , 0 , 4 , 4 , 0 , 3 , 3]\r\nc += [3 , 3 , 0 , 4 , 4 , 0 , 3 , 3]\r\nc += [2 , 2 , 0 , 3 , 3 , 0 , 2 , 2]\r\nc += [2 , 2 , 0 , 3 , 3 , 0 , 2 , 2]\r\nc += [1 , 1 , 0 , 2 , 2 , 0 , 1 , 1]\r\nc += [1 , 1 , 0 , 2 , 2 , 0 , 1 , 1]\r\n\r\nfor i in range(6):\r\n\ts.append(input())\r\n\r\np = 0\r\npos = 0\r\n\r\nfor i in range(6):\r\n\tfor j in range(8):\r\n\t\tif s[i][j] == '.':\r\n\t\t\tif c[8 * i + j] > p:\r\n\t\t\t\tp = c[8 * i + j]\r\n\t\t\t\tpos = (i , j)\r\n\r\nfor i in range(6):\r\n\tfor j in range(8):\r\n\t\tif pos == (i , j):\r\n\t\t\tprint('P',end=\"\")\r\n\t\telse:\r\n\t\t\tprint(s[i][j],end=\"\")\r\n\tprint()", "def pr(u):\r\n for i in range(6):\r\n s = ''\r\n for j in range(8):\r\n s += u[i][j]\r\n print(s)\r\n\r\np = []\r\nfor i in range(6):\r\n s = input()\r\n p.append(list(s))\r\n\r\npriority = [[0,3],[0,4],[1,3],[1,4],[0,0],[0,1],[0,6],[0,7],[1,0],[1,1],[1,6],[1,7],[2,3],[2,4],[3,3],[3,4],[2,0],[2,1],[2,6],[2,7],[3,0],[3,1],[3,6],[3,7],[4,3],[4,4],[5,3],[5,4],[4,0],[4,1],[4,6],[4,7],[5,0],[5,1],[5,6],[5,7]]\r\nfor a in priority:\r\n if p[a[0]][a[1]] == '.':\r\n p[a[0]][a[1]] = 'P'\r\n pr(p)\r\n break\r\n\r\n \r\n\r\n", "a=[]\r\nfor i in range(0,6):\r\n a.append(input())\r\nb=[[3,3,4,4,3,3],[3,3,4,4,3,3],[2,2,3,3,2,2],[2,2,3,3,2,2],[1,1,2,2,1,1],[1,1,2,2,1,1]]\r\nfor i in range(0,6):\r\n if(a[i][0]=='*'):\r\n b[i][0]=0\r\n if(a[i][1]=='*'):\r\n b[i][1]=0\r\n if(a[i][3]=='*'):\r\n b[i][2]=0\r\n if(a[i][4]=='*'):\r\n b[i][3]=0\r\n if(a[i][6]=='*'):\r\n b[i][4]=0\r\n if(a[i][7]=='*'):\r\n b[i][5]=0\r\nc=0\r\nd=0\r\ne=0\r\nfor i in range(0,6):\r\n for j in range(0,6):\r\n if(b[i][j]>c):\r\n c=b[i][j]\r\n d=i\r\n e=j\r\nif(e==2 or e==3):\r\n e=e+1\r\nelif(e==4 or e==5):\r\n e=e+2\r\nif(e!=7):\r\n a[d]=a[d][0:e]+'P'+a[d][e+1:8]\r\nelse:\r\n a[d]=a[d][0:e]+'P'\r\nfor i in range(0,6):\r\n print(a[i])", "n=6\r\nm=8;\r\na=[];\r\nb=[];\r\nfor i in range(n) :\r\n a.append(list(input()))\r\nb.append([3,3,0,4,4,0,3,3])\r\nb.append([3,3,0,4,4,0,3,3])\r\nb.append([2,2,0,3,3,0,2,2])\r\nb.append([2,2,0,3,3,0,2,2])\r\nb.append([1,1,0,2,2,0,1,1])\r\nb.append([1,1,0,2,2,0,1,1])\r\nii=0\r\njj=0\r\nx=0\r\nfor i in range(n) :\r\n for j in range(m) :\r\n if a[i][j]=='.' and x<b[i][j]:\r\n ii=i\r\n jj=j\r\n x=b[i][j]\r\na[ii][jj]='P'\r\nfor i in range(n) :\r\n for j in range (m) :\r\n print(a[i][j],end='')\r\n print ()", "cc = [[3,3,0,4,4,0,3,3],[3,3,0,4,4,0,3,3], [2,2,0,3,3,0,2,2] , [2,2,0,3,3,0,2,2],[1,1,0,2,2, 0,1,1],[1,1,0,2,2,0,1,1]]\r\nm = 0\r\nmi = -1\r\nmj = -1\r\nss=[]\r\nfor i in range(6):\r\n s = list(input())\r\n ss.append(s)\r\n for j in range(8):\r\n if s[j] == '.':\r\n if cc[i][j] > m:\r\n m = cc[i][j]\r\n mi = i\r\n mj = j\r\nif mi != -1 and mj != -1:\r\n ss[mi][mj] = 'P'\r\nfor i in range(6):\r\n print(''.join(ss[i]))", "n = 6\r\nm = 8\r\ndesk = []\r\nstat = []\r\nstat.append(\"33-44-33\")\r\nstat.append(\"33-44-33\")\r\nstat.append(\"22-33-22\")\r\nstat.append(\"22-33-22\")\r\nstat.append(\"11-22-11\")\r\nstat.append(\"11-22-11\")\r\nfor i in range(n):\r\n desk.append(input())\r\nflag = 0\r\nval = 4\r\nwhile flag == 0 :\r\n for i in range(n) :\r\n for j in range(m) : \r\n if (desk[i][j] == '.') :\r\n if (flag == 0 and val == 4 and stat[i][j] == '4') :\r\n desk[i] = desk[i][:j] + 'P' + desk[i][j+1:]\r\n flag = 1\r\n if (flag == 0 and val == 3 and stat[i][j] == '3') :\r\n desk[i] = desk[i][:j] + 'P' + desk[i][j+1:]\r\n flag = 1\r\n if (flag == 0 and val == 2 and stat[i][j] == '2') :\r\n desk[i] = desk[i][:j] + 'P' + desk[i][j+1:]\r\n flag = 1\r\n if (flag == 0 and val == 1 and stat[i][j] == '1') :\r\n desk[i] = desk[i][:j] + 'P' + desk[i][j+1:]\r\n flag = 1\r\n val = val - 1\r\n\r\nfor i in desk :\r\n print(i)\r\n \r\n \r\n \r\n ", "\r\nfrom sys import stdin\r\n\r\narr = [stdin.readline().strip() for i in range(6)]\r\n\r\nprice = [\r\n [3, 3, 4, 4, 3, 3],\r\n [3, 3, 4, 4, 3, 3],\r\n [2, 2, 3, 3, 2, 2],\r\n [2, 2, 3, 3, 2, 2],\r\n [1, 1, 2, 2, 1, 1],\r\n [1, 1, 2, 2, 1, 1]\r\n]\r\n\r\nbest = 0\r\nfor i in range(6):\r\n for j in range(2, 4):\r\n if (arr[i][j + 1] == '.'):\r\n best = max(best, price[i][j])\r\n for j in range(0, 2):\r\n if (arr[i][j] == '.'): \r\n best = max(best, price[i][j])\r\n for j in range(4, 6): \r\n if (arr[i][j + 2] == '.'):\r\n best = max(best, price[i][j])\r\n\r\n#print(best)\r\n\r\nfor i in range(6):\r\n for j in range(2, 4):\r\n if (arr[i][j + 1] == '.' and price[i][j] == best):\r\n arr[i] = arr[i][:j + 1] + 'P' + arr[i][j + 2:]\r\n print('\\n'.join(arr))\r\n exit(0)\r\n for j in range(0, 2):\r\n if (arr[i][j] == '.' and price[i][j] == best):\r\n arr[i] = arr[i][:j] + 'P' + arr[i][j + 1:]\r\n print('\\n'.join(arr))\r\n exit(0)\r\n for j in range(4, 6):\r\n if (arr[i][j + 2] == '.' and price[i][j] == best):\r\n arr[i] = arr[i][:j + 2] + 'P' + arr[i][j + 3:]\r\n print('\\n'.join(arr))\r\n exit(0)\r\n ", "val =[\r\n [3,3,-1,4,4,-1,3,3],\r\n [3,3,-1,4,4,-1,3,3],\r\n [2,2,-1,3,3,-1,2,2],\r\n [2,2,-1,3,3,-1,2,2],\r\n [1,1,-1,2,2,-1,1,1],\r\n [1,1,-1,2,2,-1,1,1],\r\n ]\r\nmap = [ input() for _ in range(6) ]\r\nbest = 0\r\npos = []\r\nfor i in range(6):\r\n for j in range(8):\r\n if map[i][j] == '.' and val[i][j] > best:\r\n best = val[i][j]\r\n pos = [i,j]\r\nmap[pos[0]] = map[pos[0]][:pos[1]] + 'P' + map[pos[0]][pos[1]+1:]\r\nfor i in range(6):\r\n print(map[i])" ]

[ "memo = {}\r\ndef solve(a, b):\r\n if (a,b) in memo:\r\n return memo[a,b]\r\n if len(a)%2 == 1:\r\n return a == b\r\n \r\n half = len(a)//2\r\n a1, a2 = a[:half], a[half:]\r\n b1, b2 = b[:half], b[half:]\r\n\r\n memo[a,b] = (solve(a1, b1) and solve(a2, b2)) or (solve(a1, b2) and solve(a2, b1))\r\n return memo[a,b]\r\n\r\ns1 = input()\r\ns2 = input() \r\nans = solve(s1, s2)\r\nprint(\"YES\" if ans else \"NO\")", "def generate_partition(s):\r\n length = len(s)\r\n return sorted([ generate_partition( s[:length//2] ), generate_partition( s[length//2:] ) ]) if length % 2 == 0 else s\r\n\r\nstring1 = input()\r\nstring2 = input()\r\n\r\nif generate_partition(string1) == generate_partition(string2):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "def comparadorDePalavras(palavra1, palavra2):\r\n if(palavra1 == palavra2):\r\n return True\r\n if(len(palavra1) != len(palavra2)):\r\n return False\r\n if(len(palavra1) % 2 == 1):\r\n return False\r\n metade = len(palavra1)//2\r\n \r\n palavra1_1 = palavra1[:metade]\r\n \r\n palavra2_1 = palavra2[:metade]\r\n palavra1_2 = palavra1[metade:]\r\n palavra2_2 = palavra2[metade:]\r\n \r\n return (comparadorDePalavras(palavra1_1, palavra2_2) and comparadorDePalavras(palavra1_2, palavra2_1)) or (comparadorDePalavras(palavra1_1, palavra2_1) and comparadorDePalavras(palavra1_2, palavra2_2))\r\n \r\n \r\npalavra1 = input()\r\npalavra2 = input()\r\n \r\nif (comparadorDePalavras(palavra1, palavra2)):\r\n print('YES') \r\nelse:\r\n print('NO')", "def lhalf(txt):\r\n return txt[0:len(txt)//2]\r\n\r\ndef rhalf(txt):\r\n return txt[len(txt)//2:]\r\n\r\ndef rsort(txt):\r\n if len(txt)%2 == 1:\r\n return txt\r\n else:\r\n subtxt1 = rsort(lhalf(txt))\r\n subtxt2 = rsort(rhalf(txt))\r\n return ''.join(sorted([subtxt1,subtxt2]))\r\n\r\ntxt1 = input()\r\ntxt2 = input()\r\nif rsort(txt1) == rsort(txt2):\r\n print('YES')\r\nelse:\r\n print('NO')", "def compS(s):\n t = len(s)\n if t%2 == 1:\n return s\n t//=2\n a = compS(s[0:t])\n b = compS(s[t::])\n return a+b if a<b else b+a\na,b = input(),input()\nprint(\"YES\" if compS(a) == compS(b) else \"NO\")\n\t\t\t\t\t \t\t\t \t \t\t \t\t\t \t\t\t\t\t\t", "def equiv(dp, s1, s2):\n if (s1, s2) in dp.keys():\n return (dp[(s1,s2)])\n if s1 == s2:\n dp[(s1, s2)] = True\n dp[(s2, s1)] = True \n return True\n if len(s1) % 2 == 1 or (len(s1) == 1 and len(s2) == 1):\n dp[(s1, s2)] = False\n dp[(s2, s1)] = False\n return False\n\n a1, a2 = s1[:len(s1)//2], s1[len(s1)//2:]\n b1, b2 = s2[:len(s2)//2], s2[len(s2)//2:]\n \n\n if equiv(dp, a1, b1) and equiv(dp, a2, b2):\n dp[(s1, s2)] = True\n dp[(s2, s1)] = True \n return True\n\n if equiv(dp, a1, b2) and equiv(dp, a2, b1):\n dp[(s1, s2)] = True\n dp[(s2, s1)] = True \n return True\n\n dp[(s1, s2)] = False\n dp[(s2, s1)] = False \n return False\n\n#s1 = \"cda\"\n#s2 = \"cfg\"\ndp = dict()\ns1 = input()\ns2 = input()\nprint(\"YES\" if equiv(dp, s1, s2) else \"NO\") ", "a = input()\nb = input()\n\ndef check_equivalent(entrada):\n\n if len(entrada) % 2:\n return entrada\n \n a1 = check_equivalent(entrada[:len(entrada)//2])\n a2 = check_equivalent(entrada[len(entrada)//2:])\n \n if a1 < a2:\n\t return a1+a2\n else:\n\t return a2+a1\n\nif check_equivalent(a) == check_equivalent(b):\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "def isep(s):\n if (len(s) % 2 != 0):\n return s\n s1 = isep(s[:int(len(s)/2)])\n s2 = isep(s[int(len(s)/2):])\n if s1 > s2:\n return s2 + s1\n else:\n return s1 + s2\n\na = input()\nb = input()\n\nif isep(a) == isep(b):\n print(\"YES\")\nelse:\n print(\"NO\")\n\t \t\t\t \t \t \t\t \t\t\t \t \t \t \t", "def divid(s):\n n = len(s)\n if n % 2:\n return s\n \n n = int(n / 2)\n s1 = divid(s[:-n])\n s2 = divid(s[n:])\n \n if s1 > s2:\n return s1 + s2\n else:\n return s2 + s1\n\n\na = input()\nb = input()\n\nif divid(a) == divid(b):\n print(\"YES\")\nelse:\n print(\"NO\")\n \t \t \t\t \t\t \t \t \t \t \t\t\t", "s1=input()\r\ns2=input()\r\nlenn=len(s1)\r\nif s1==s2 :print(\"YES\")\r\nelif lenn%2==1 and lenn!=1:\r\n print(\"NO\")\r\nelse :\r\n\r\n def calc( str1,str2):\r\n l=len(str1) \r\n # print(l)\r\n \r\n if l==1 or str1==str2 :\r\n if str1==str2 :\r\n # print (1) \r\n return 1 \r\n else: return 0 \r\n if l%2==1 :return 0 \r\n str11=str1[0:l//2]\r\n str12=str1[l//2:l]\r\n str21=str2[:l//2:]\r\n str22=str2[l//2:l:]\r\n # print(str11 , str12,str21,str22)\r\n # print(calc(str11,str22))\r\n if calc(str11,str22) and calc(str12,str21):return 1\r\n elif calc(str11,str21) and calc(str12,str22) :return 1\r\n else :return 0 \r\n if calc(s1,s2) :print(\"YES\")\r\n else : print(\"NO\")\r\n", "def getmin(s):\r\n l = len(s)\r\n if l % 2 == 1: return s\r\n else:\r\n a = getmin(s[0:l//2])\r\n b = getmin(s[l//2:l])\r\n if a < b:\r\n return a + b\r\n else:\r\n return b + a\r\n \r\ns1 = input()\r\ns2 = input()\r\na1 = getmin(s1)\r\na2 = getmin(s2)\r\nif a2 == a1: print('YES')\r\nelse: print('NO')\r\n ", "def si(a,b):\r\n if a==b:\r\n return True\r\n longitud=max(len(a),len(b))\r\n if longitud%2==1:\r\n if a==b:\r\n return True\r\n else:\r\n return False\r\n media=longitud//2\r\n if si(a[0:media],b[0:media]) and si(a[media:],b[media:]):\r\n return True\r\n if si(a[media:],b[0:media]) and si(a[0:media],b[media:]):\r\n return True\r\n return False\r\n \r\nprimero=input()\r\nsegundo=input()\r\n\r\nif si(primero,segundo):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def compara(string):\n if len(string)%2: \n return string\n aux1 = compara(string[:len(string)//2])\n aux2 = compara(string[len(string)//2:])\n if aux1 < aux2:\n return(aux2 + aux1)\n else:\n return(aux1 + aux2)\nentrada1 = input()\nentrada2 = input()\nif compara(entrada1) == compara(entrada2):\n print(\"YES\")\nelse:\n print(\"NO\")", "def equivalent_string(s):\r\n size = len(s)\r\n if (size % 2 != 0):\r\n return s\r\n \r\n t1 = equivalent_string(s[:size//2])\r\n t2 = equivalent_string(s[size//2:])\r\n\r\n if (t1 < t2):\r\n return t1 + t2\r\n return t2 + t1\r\n\r\na = equivalent_string(input())\r\nb = equivalent_string(input())\r\nif (a == b):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def check(a):\r\n le=len(a)\r\n if le%2:\r\n return a\r\n l=check(a[:le//2])\r\n r=check(a[le//2:])\r\n if l<r:\r\n return l+r\r\n else:\r\n return r+l\r\na=check(input())\r\nb=check(input())\r\nif a==b:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\ndef equivalent(lhs, rhs):\n if lhs == rhs:\n return True\n if len(lhs) % 2 == 1:\n return lhs == rhs\n length = len(lhs)\n mid = length // 2\n lhs1 = lhs[0:mid]\n lhs2 = lhs[mid:length]\n rhs1 = rhs[0:mid]\n rhs2 = rhs[mid:length]\n if equivalent(lhs1, rhs2) and equivalent(lhs2, rhs1):\n return True\n else:\n return equivalent(lhs1,rhs1) and equivalent(rhs2, lhs2)\n\ns1 = input()\ns2 = input()\nif equivalent(s1, s2):\n print('YES')\nelse:\n print('NO')\n\n\n\"\"\"def igual(cadena1, cadena2, l):\n if cadena1 == cadena2:\n return True\n\n hl = int(l / 2)\n if l % 2 == 1: # Verificar longitud de la cadena\n return cadena1 == cadena2 # Si es una cadena de una letra regresa la comparacion\n else:\n # Se parten las cadenas a la mitad para poder analizarlas\n a1 = cadena1[0:hl]\n b1 = cadena2[0:hl]\n a2 = cadena1[hl:l]\n b2 = cadena2[hl:l]\n # Se llama de nuevo a la funcion para que realice la comparacion con las divisiones (Comparacion curzada)\n if (igual(a1, b2, hl) and igual(a2, b1, hl)):\n return True\n else:\n # Se hace la comparacion de partes\n return (igual(a1, b1, hl) and igual(a2, b2, hl))\n\n\n# Inputs\ncadena1 = input()\ncadena2 = input()\n\n# If para imprimir\nif igual(cadena1, cadena2, len(cadena1)):\n print('YES')\nelse:\n print('NO')\"\"\"", "def sortString(s):\n if (len(s) % 2 != 0):\n return s \n else:\n s1, s2 = [sortString(s[:len(s)//2]), sortString(s[len(s)//2:])]\n return sorted([s1, s2])\n\na = input()\nb = input()\n\nif (sortString(a) == sortString(b)):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "def sortOnHalf(st):\r\n if len(st) % 2 == 1:\r\n return st\r\n start = sortOnHalf(st[0:int(len(st)/2)])\r\n end = sortOnHalf(st[int(len(st)/2):len(st)])\r\n if(start < end):\r\n return end+start\r\n return start+end\r\n\r\n\r\ns1 = input()\r\ns2 = input()\r\nif sortOnHalf(s1) == sortOnHalf(s2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def equivalente(a,b):\r\n if a == b:\r\n return True\r\n m = len(a)\r\n if m % 2 == 1:\r\n return False\r\n \r\n n = int(m/2)\r\n a1 = a[0:n]\r\n a2 = a[n:m]\r\n b1 = b[0:n]\r\n b2 = b[n:m]\r\n \r\n return (equivalente(a1,b2) and equivalente(a2,b1)) or (equivalente(a1,b1) and equivalente(a2,b2))\r\n \r\na = input()\r\nb = input()\r\n \r\nif(equivalente(a,b)):\r\n print('YES')\r\nelse:\r\n print('NO')", "def f(s):\r\n if len(s) % 2 == 1:\r\n return s\r\n p = f(s[:len(s) // 2])\r\n q = f(s[len(s) // 2:])\r\n if p < q:\r\n return p + q\r\n return q + p\r\n\r\n\r\ns = input()\r\nt = input()\r\nif f(s) == f(t):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "def isEquivalent(a_total, b_total):\n if(a_total == b_total):\n return True\n if(len(a_total) != len(b_total)):\n return False\n if(len(a_total) % 2 == 1):\n return False\n half = len(a_total)//2\n \n a_part1 = a_total[:half]\n \n b_part1 = b_total[:half]\n a_part2 = a_total[half:]\n b_part2 = b_total[half:]\n \n return (isEquivalent(a_part1, b_part2) and isEquivalent(a_part2, b_part1)) or (isEquivalent(a_part1, b_part1) and isEquivalent(a_part2, b_part2))\n \n \na_total = input()\nb_total = input()\n \nif (isEquivalent(a_total, b_total)):\n print('YES') \nelse:\n print('NO')\n", "from functools import lru_cache\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nfirst = input().strip()\r\nsecond = input().strip()\r\n\r\n# lru_cache(None)\r\ndef recursion(s):\r\n if len(s) % 2:\r\n return s\r\n mid = len(s) // 2\r\n s1 = recursion(s[:mid])\r\n s2 = recursion(s[mid:])\r\n if s1 < s2: return s1 + s2\r\n return s2 + s1\r\n\r\n\r\n \r\n\r\ns1 = recursion(first)\r\ns2 = recursion(second)\r\n\r\nprint(['NO', 'YES'][s1 == s2])", "def ordena(string):\r\n z = int(len(string)/2)\r\n if len(string) % 2 == 1:\r\n return string\r\n x = ordena(string[:z])\r\n y = ordena(string[z:])\r\n if (x < y):\r\n return x + y\r\n else:\r\n return y + x\r\n \r\na = ordena(input())\r\nb = ordena(input())\r\n \r\nif a == b:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def func(a):\r\n if(len(a) % 2):\r\n return a\r\n \r\n a1 = func(a[ : len(a) // 2])\r\n a2 = func(a[len(a) // 2 : ])\r\n if(a1 < a2):\r\n return a1 + a2 \r\n else:\r\n return a2 + a1\r\n \r\n\r\na = input()\r\nb = input()\r\nif(func(a) == func(b)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# Dividir pra conquistar? \r\n\r\ndef equi(s):\r\n n = len(s)\r\n if n % 2 == 1: \r\n return s\r\n n = int(n/2)\r\n s1, s2 = equi(s[:n]), equi(s[n:])\r\n return s1 + s2 if s1 > s2 else s2 + s1\r\n\r\n\r\ndef main():\r\n a, b = input(), input()\r\n result = \"YES\" if equi(a) == equi(b) else \"NO\"\r\n print(result)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "def X(A, B, size):\r\n if A == B:\r\n return True\r\n if size%2 == 1:\r\n return False\r\n A1 = A[:size//2]\r\n A2 = A[size//2:]\r\n B1 = B[:size//2]\r\n B2 = B[size//2:]\r\n if X(A1, B2, size//2):\r\n return X(A2, B1, size//2)\r\n if X(A1, B1, size//2):\r\n return X(A2, B2, size//2)\r\n else:\r\n return False\r\na = input()\r\nb = input()\r\ny = X(a,b, len(a))\r\nif y:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "def equivalent(s):\r\n\r\n if(len(s) == 1):\r\n return s \r\n if(len(s) % 2 == 1):\r\n return s\r\n\r\n mid = len(s)//2\r\n\r\n left_part = s[0:mid]\r\n right_part = s[mid:len(s)]\r\n\r\n x = equivalent(left_part)\r\n y = equivalent(right_part)\r\n\r\n if(x < y):\r\n return x+y\r\n else:\r\n return y+x\r\n \r\nfirst_string = input()\r\nsecond_string = input()\r\n\r\nif(equivalent(first_string) == equivalent(second_string)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "x = input()\r\ny = input()\r\n\r\ndef f(x, y):\r\n if x == y:\r\n return True\r\n if len(x)%2 == 1:\r\n return False\r\n mid = len(x)//2\r\n if f(x[:mid], y[mid:]) and f(x[mid:], y[:mid]):\r\n return True\r\n if f(x[mid:], y[mid:]) and f(x[:mid], y[:mid]):\r\n return True\r\n return False\r\n\r\nif f(x, y):\r\n print(\"YES\")\r\n quit()\r\n\r\nprint(\"NO\")", "from sys import setrecursionlimit\nsetrecursionlimit(10**5)\n\ndef _print(res):\n print(\"YES\") if res else print(\"NO\")\n\ndef split(a):\n r,q = (a[0:int(len(a)/2)], a[int(len(a)/2):len(a)])\n return r,q\n\ndef check(string):\n if len(string)%2 == 0:\n substring1, substring2 = split(string)\n substring1 = check(substring1)\n substring2 = check(substring2)\n return substring1+substring2 if substring1 < substring2 else substring2+substring1\n else:\n return string\n\ndef equivalence(a,b):\n if check(a) == check(b):\n print('YES')\n else:\n print('NO')\n\na = input()\nb = input()\nequivalence(a,b)\n\t\t \t \t\t\t\t\t\t\t\t\t\t \t \t \t", "def stringPass(palavra):\r\n\r\n if len(palavra) % 2 != 0: return palavra\r\n\r\n corte1 = slice(0, int(len(palavra)/2), 1)\r\n corte2 = slice(int(len(palavra)/2), len(palavra), 1)\r\n\r\n p1 = stringPass(palavra[corte1])\r\n p2 = stringPass(palavra[corte2])\r\n\r\n if p1 < p2: return p1+p2\r\n else: return p2+p1\r\n\r\na = input()\r\nb = input() \r\n\r\nif stringPass(a) == stringPass(b): print(\"YES\")\r\nelse: print(\"NO\")", "def fu(s):\n lens=len(s)\n if lens%2:\n return s\n return sorted([fu(s[:lens//2]),fu(s[lens//2:])])\nif fu(input())==fu(input()):\n print(\"YES\")\nelse:\n print(\"NO\")\n \t \t \t\t \t \t \t \t \t\t\t \t\t\t\t", "def leastLexiString(s):\r\n \r\n if (len(s) & 1 != 0):\r\n return s\r\n x = leastLexiString(s[0:int(len(s) / 2)])\r\n y = leastLexiString(s[int(len(s) / 2):len(s)])\r\n \r\n return min(x + y, y + x)\r\n \r\ndef areEquivalent(a,b):\r\n return (leastLexiString(a) == leastLexiString(b))\r\n\r\nif __name__ == '__main__':\r\n a = input()\r\n b = input()\r\n if (areEquivalent(a, b)):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "word1 = input()\r\nword2 = input()\r\n\r\ndef check(word):\r\n if(len(word) % 2 != 0):\r\n return word\r\n\r\n half = int(len(word)/2)\r\n first_half = check(word[:half])\r\n last_half = check(word[half:])\r\n\r\n if first_half < last_half:\r\n return first_half + last_half\r\n else:\r\n return last_half + first_half\r\n\r\nif check(word1) == check(word2):\r\n print('YES')\r\nelse:\r\n print('NO')", "def is_equivalent(s):\n if len(s) % 2: return s\n \n a = is_equivalent(s[:len(s)//2])\n b = is_equivalent(s[len(s)//2:])\n \n return a + b if a < b else b + a\n \n \na = str(input())\nb = str(input())\nprint('YES' if is_equivalent(a) == is_equivalent(b) else 'NO')", "s1=input()\r\ns2=input()\r\n\r\ndef equalSort(s):\r\n if len(s)%2:\r\n return s\r\n s1=equalSort(s[:len(s)//2])\r\n s2=equalSort(s[len(s)//2:])\r\n\r\n if s1<s2:\r\n return s1+s2\r\n return s2+s1\r\nif equalSort(s1)==equalSort(s2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def split(x):\r\n end = len(x)\r\n if(end % 2 == 0):\r\n stra = split(x[0:int(end/2)])\r\n strb = split(x[int(end/2):])\r\n if(stra > strb):\r\n return [strb,stra]\r\n else:\r\n return [stra,strb]\r\n else:\r\n return x\r\n\r\n\r\na = str(input())\r\nb = str(input())\r\nif(split(a) == split(b)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\n\ndef solve(a):\n\tsys.setrecursionlimit(sys.getrecursionlimit() + 1)\n\n\tif (len(a) & 1):\n\t\treturn a\n\n\ts1 = solve(a[:len(a) // 2])\n\ts2 = solve(a[len(a) // 2:])\n\n\treturn s1 + s2 if s1 < s2 else s2 + s1\n\na, b = input(), input()\n\nprint('YES' if solve(a) == solve(b) else 'NO')", "input_a = input()\ninput_b = input()\n\ndef isEquivalent(custom_input): \n valid = len(custom_input) & 1 != 0\n \n if valid: \n return custom_input \n\n i = isEquivalent(custom_input[0:int(len(custom_input) / 2)]) \n j = isEquivalent(custom_input[int(len(custom_input) / 2):len(custom_input)])\n\n return min(i + j, j + i)\n\n\nis_input_equivalent = isEquivalent(input_a) == isEquivalent(input_b)\n\ncustom_output = \"NO\"\n\nif is_input_equivalent == True: \n custom_output = \"YES\" \n\nprint (custom_output)\n\t \t \t\t \t \t \t \t \t\t \t\t", "import sys\r\ninput = sys.stdin.buffer.readline\r\n\r\n\r\ndef process(A, B):\r\n if A==B:\r\n return 'YES'\r\n n = len(A)\r\n m = 0\r\n while n % 2==0:\r\n m+=1\r\n n = n//2\r\n d = {}\r\n d2 = {}\r\n d3 = {}\r\n I = 0\r\n \"\"\"\r\n original n = n*m\r\n m is a power of 2\r\n \"\"\"\r\n new_A = []\r\n new_B = []\r\n for i in range(2**m):\r\n string1 = []\r\n string2 = []\r\n for j in range(n):\r\n string1.append(A[n*i+j])\r\n string2.append(B[n*i+j])\r\n string1 = ''.join(string1)\r\n string2 = ''.join(string2)\r\n if string1 not in d:\r\n d[string1] = [[], []]\r\n d2[string1] = I\r\n I+=1\r\n if string2 not in d:\r\n d[string2] = [[], []]\r\n d2[string2] = I\r\n I+=1\r\n I1 = d2[string1]\r\n I2 = d2[string2]\r\n new_A.append(I1)\r\n new_B.append(I2)\r\n for j in range(m+1):\r\n if i % (2**j)==2**j-1:\r\n c1 = tuple(sorted(new_A[i-2**j+1:i+1]))\r\n c2 = tuple(sorted(new_B[i-2**j+1:i+1]))\r\n if c1 not in d3:\r\n d3[c1] = [0, 0]\r\n if c2 not in d3:\r\n d3[c2] = [0, 0]\r\n d3[c1][0]+=1\r\n d3[c2][1]+=1\r\n for x in d3:\r\n if d3[x][0] != d3[x][1]:\r\n return 'NO'\r\n return 'YES'\r\n \r\nA = input().decode()[:-2]\r\nB = input().decode()[:-2]\r\nprint(process(A, B))\r\n ", "def le(s):\r\n if len(s) % 2 != 0:\r\n return s\r\n l = len(s)\r\n l1 = l//2\r\n t = le(s[:l1])\r\n t1 = le(s[l1:])\r\n if t < t1:\r\n return t + t1\r\n else:\r\n return t1 + t\r\n\r\ns = input()\r\ns1 = input()\r\nif s == s1:\r\n print(\"YES\")\r\nelse:\r\n x = le(s)\r\n y = le(s1)\r\n if x == y:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n ", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef f(q):\r\n n = len(q)\r\n if n % 2:\r\n return q\r\n a = f(q[:n//2])\r\n b = f(q[n//2:])\r\n if a < b:\r\n a, b = b, a\r\n return a+b\r\n\r\n\r\ns = list(input()[:-1])\r\nw = list(input()[:-1])\r\nif f(s) == f(w):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "import sys\r\nimport math\r\n\r\ndef functie(x,y):\r\n \r\n #print(x,y)\r\n adev=-1\r\n \r\n if x==y:\r\n adev=1\r\n \r\n else:\r\n lungime=len(x)\r\n half=lungime//2\r\n if lungime%2==1:\r\n adev=0\r\n \r\n else:\r\n \r\n x1=x[0:half]\r\n x2=x[half:lungime]\r\n \r\n y1=y[0:half]\r\n y2=y[half:lungime]\r\n \r\n if (functie(x1,y2)==1 and functie(x2,y1)==1) or (functie(x1,y1)==1 and functie(x2,y2)==1):\r\n adev=1\r\n \r\n return(adev)\r\n \r\n#z=int(input()) \r\nfor contorr in range(1):\r\n #n=int(input()) \r\n \r\n #n,m,k= map(int, sys.stdin.readline().split())\r\n\r\n #vector=list(map(int, sys.stdin.readline().split()))\r\n \r\n a=input()\r\n b=input()\r\n \r\n if functie(a,b)==1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "def solution(s1, s2):\n if(s1 == s2):\n return True\n if(len(s1) % 2 == 1):\n return False\n \n mid = int(len(s1) / 2)\n left = solution(s1[:mid], s2[:mid])\n if (left):\n right = solution(s1[mid:], s2[mid:])\n return right\n cross_left = solution(s1[mid:], s2[:mid])\n\n if (cross_left):\n cross_right = solution(s1[:mid], s2[mid:])\n return cross_right\n\n return False\n\ns1 = input()\ns2 = input()\n\nif (solution(s1, s2)):\n print('YES')\nelse:\n print('NO')", "def check(s):\n if len(s)%2:\n return s\n\n s1=check(s[:len(s)//2])\n s2=check(s[len(s)//2:])\n \n if s1 >s2:\n return s2+s1\n else:\n return s1+s2\n\na = input()\nb = input()\nif check(a)==check(b):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "def equivalent_strings(string):\n if (len(string) % 2 != 0):\n return string\n\n n = len(string) // 2\n s1, s2 = equivalent_strings(string[:n]), equivalent_strings(string[n:])\n if (s1 > s2):\n return s1+s2\n else:\n return s2+s1\n\n\nstring_a = input()\nstring_b = input()\n\nprint('YES' if equivalent_strings(string_a) ==\n equivalent_strings(string_b) else 'NO')\n\n# aaba\n# aa ba\n# a a b a caso base: retorna string\n# aa ba\n# baaa\n\n# abaa\n# ab aa\n# a b a a caso base: retorna string\n# ba aa\n# baaa\n\n \t\t\t \t\t\t\t\t \t\t \t \t\t\t\t \t \t\t", "def equiv_strings(a, b):\r\n if a == b:\r\n return True\r\n\r\n sz = len(a)\r\n\r\n if sz % 2 == 1:\r\n return False\r\n\r\n a1, a2 = a[:sz // 2], a[sz // 2:]\r\n b1, b2 = b[:sz // 2], b[sz // 2:]\r\n\r\n if (equiv_strings(a1, b2) and equiv_strings(a2, b1)) or (equiv_strings(a1, b1) and equiv_strings(a2, b2)):\r\n return True\r\n return False\r\n\r\na = input()\r\nb = input()\r\n\r\nif equiv_strings(a, b):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a = input()\r\nb = input()\r\n\r\ndef dividir(string):\r\n if(len(string) % 2 != 0):\r\n return string\r\n return sorted([dividir(string[:len(string)//2]), dividir(string[len(string)//2 :])])\r\n \r\nif(dividir(a) == dividir(b)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def lexSmaller(s):\r\n x = len(s)\r\n if x%2==1:\r\n return s\r\n x//=2\r\n a = lexSmaller(s[0:x])\r\n b = lexSmaller(s[x::])\r\n return a+b if a<b else b+a\r\na,b = input(),input()\r\nprint(\"YES\" if lexSmaller(a)==lexSmaller(b) else \"NO\")", "string1 = input()\r\nstring2 = input()\r\n\r\n# ordena a string\r\ndef smallest(s):\r\n if len(s) % 2 == 1 or s == \"\":\r\n return s\r\n\r\n meio = len(s) // 2\r\n s1 = smallest(s[:meio])\r\n s2 = smallest(s[meio:])\r\n\r\n if (s1 < s2): \r\n return s1 + s2\r\n else:\r\n return s2 + s1\r\n\r\nstring1 = smallest(string1)\r\nstring2 = smallest(string2)\r\n\r\nif string1 == string2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "A = input()\r\nB = input()\r\ndef smallest(strng):\r\n if len(strng) % 2 == 1:\r\n return strng\r\n s1 = smallest(strng[0:len(strng)//2])\r\n s2 = smallest(strng[len(strng)//2: ])\r\n if s1 < s2:\r\n return s1+s2\r\n else:\r\n return s2+s1\r\nif smallest(A) == smallest(B):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "#Este algoritmo esta usando Divide and conquer debido a que se necesita comparar dos cadenas de letras.\n#El problema se divide en subproblemas lo que permite analizar los pedazos como lo dice el problema al principio, se divide tantas veces sea necesario para poder encontrar soluciones y despues solo añadirlas.\n#Me parece que es el approach necesario debido a como se deben realizar las comparaciones de las cadenas ingresadas.\npalabras={}\ndef equivalente(ca1,ca2):#Esta funcion permitira el uso de las multiples divisiones de cadena de ser necesario\n if (ca1,ca2) in palabras:\n #Inserta las palabras escritas en palabras\n return palabras[(ca1,ca2)]\n #Verifica que ambas palabras tengan la misma longitud\n if ca1==ca2:\n return True\n #divide ambas palabras a la mitad\n if(len(ca1)%2==1 or len(ca2)%2==1):\n return False\n #la funcion len devuelve la longitud de una cadena de caracteres\n #los cuatro pares de palabras se acomodan\n #Esto es para colocar de donde a donde van a ir las cadenas, colocandolas a la mitad de la longitud o a la inversa\n a1=ca1[:len(ca1)//2]\n a2=ca1[len(ca1)//2:]\n b1=ca2[:len(ca2)//2]\n b2=ca2[len(ca2)//2:]\n\n #Revisa si existe equilavencia entre los cuatro pares\n palabras[(ca1,ca2)]= (equivalente(a1,b1)and equivalente(a2,b2)) or (equivalente(a1,b2) and equivalente(a2,b1))\n return palabras[(ca1,ca2)]\n\na=input()\nb=input()\n\nif equivalente(a,b):\n print(\"YES\")\nelse:\n print(\"NO\")\n \t\t \t\t \t \t\t \t \t \t\t\t \t\t \t", "def sortString(str):\n length = len(str)\n if (length % 2 != 0):\n return str\n length //= 2\n left = sortString(str[:length])\n right = sortString(str[length:])\n if left < right:\n return left + right\n else:\n return right + left\n\n\na = input()\nb = input()\nprint(\"YES\" if sortString(a) == sortString(b) else \"NO\")\n", "def minimize(st):\r\n\r\n tam = len(st)\r\n if tam % 2 == 1:\r\n return st\r\n\r\n mid1 = (tam)//2\r\n\r\n s1 = minimize(st[:mid1])\r\n s2 = minimize(st[mid1:])\r\n\r\n return min(s1+s2, s2+s1)\r\n\r\nn = 2\r\n \r\ndc = dict()\r\n\r\nA = []\r\n\r\nfor i in range(n):\r\n s = input().strip()\r\n A.append(s)\r\n\r\n s2 = minimize(s)\r\n if s2 in dc:\r\n dc[s2] += 1\r\n else:\r\n dc[s2] = 1\r\n\r\nans = 0\r\n\r\nfor k in dc:\r\n ans += dc[k]*(dc[k]-1)//2\r\n\r\nif ans > 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n ", "def equiv(s):\r\n if len(s) % 2 == 1:\r\n return s\r\n a = equiv(s[:len(s) // 2])\r\n b = equiv(s[len(s) // 2:])\r\n return a + b if a < b else b + a\r\n\r\n\r\na, b = input(), input()\r\nprint(('NO', 'YES')[equiv(a) == equiv(b)])\r\n", "def split_string(string):\r\n if (len(string) & 1 != 0):\r\n return string\r\n \r\n tam = int(len(string) / 2)\r\n esq = split_string(string[:tam])\r\n dir = split_string(string[tam:])\r\n \r\n return min(esq + dir, dir + esq)\r\n\r\n \r\na = input()\r\nb = input()\r\nif split_string(a) == split_string(b):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def equivalent_str(str):\r\n if len(str) & 1: return str\r\n a = equivalent_str(str[ : len(str) >> 1])\r\n b = equivalent_str(str[len(str) >> 1 : ])\r\n \r\n return a + b if a < b else b + a\r\nprint('YES' if equivalent_str(input()) == equivalent_str(input()) else 'NO')", "def find_small(s):\n s_len = len(s)\n if s_len % 2 == 1:\n return s\n a1 = find_small(s[0 : s_len//2])\n a2 = find_small(s[s_len//2 : s_len])\n if a1 < a2:\n return a1 + a2\n else:\n return a2 + a1\n\nfirst = str(input())\nsecond = str(input())\n\nres_1 = find_small(first)\nres_2 = find_small(second)\n\nif res_1 == res_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", "def arranged(s):\r\n n = len(s)\r\n if n&1:\r\n return s\r\n s1 = arranged(s[0:n//2])\r\n s2 = arranged(s[n//2:n])\r\n if s1 < s2:\r\n return s1+s2\r\n return s2+s1\r\n\r\n\r\na = input()\r\nb = input()\r\n\r\nprint(\"YES\") if(arranged(a) == arranged(b)) else print(\"NO\")", "def solve(str):\r\n n = len(str)\r\n if n % 2 == 1:\r\n return str\r\n x = solve(str[:n//2])\r\n y = solve(str[n//2:])\r\n return x + y if x < y else y + x\r\n \r\n \r\nstr = input()\r\nt = input()\r\n \r\nprint(\"YES\" if solve(str) == solve(t) else \"NO\")", "def equals(a, b):\r\n if (a == b):\r\n return True\r\n \r\n len_a, len_b = len(a), len(b)\r\n\r\n if (len_a & 1 or len_b & 1):\r\n return False\r\n \r\n if (len_a == 1):\r\n return False\r\n\r\n as1 = a[0:len_a//2]\r\n as2 = a[len_a//2:(len_a//2)*2]\r\n bs1 = b[:len_b//2]\r\n bs2 = b[len_b//2:(len_b//2)*2]\r\n\r\n return (equals(as1, bs2) and equals(as2, bs1)) or (equals(as1, bs1) and equals(as2, bs2))\r\n\r\ns1 = input()\r\ns2 = input()\r\n\r\nif (equals(s1, s2)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def equivalent(s):\n n = len(s)\n if n % 2:\n return s\n a = equivalent(s[:n//2])\n b = equivalent(s[n//2:])\n if a < b:\n return a + b\n else:\n return b + a\n\na = equivalent(input())\nb = equivalent(input())\nif a == b:\n print('YES')\nelse: \n print('NO')\n\t \t \t \t\t\t \t\t\t \t\t\t\t\t\t\t\t\t \t", "def rec(s1):\r\n if(len(s1)%2): return s1\r\n a = rec(s1[:len(s1)//2])\r\n b = rec(s1[len(s1)//2:])\r\n if(a<b): return a+b\r\n else : return b+a\r\n\r\n\r\n\r\ns1 = input()\r\ns2 = input()\r\n\r\nif(rec(s1)==rec(s2)): print(\"YES\")\r\nelse: print(\"NO\")", "\r\n# Essa Funcao tem o objetivo de encontrar a string lexicográfica minima que é \r\n# equivalente a string fornecida no inicio\r\ndef verify(s):\r\n \r\n # Se a string for impar retornamos, pois nao da pra dividir mais\r\n\tif len(s)%2 == 1: return s\r\n\r\n\tmid = int(len(s)/2)\r\n\t\r\n\t# Testando a primeira metade\r\n\tleft = verify(s[:mid])\r\n\t\r\n\t# Testando a segunda metade\r\n\tright = verify(s[mid:])\r\n\t\r\n\t# Reordena a string\r\n\treturn (left+right) if left < right else (right+left)\r\n\r\n\r\na = input()\r\nb = input()\r\n\r\nprint(\"YES\" if verify(a) == verify(b) else \"NO\" )\r\n\r\n", " \r\ns1 = input()\r\ns2 = input()\r\ndef check(s1, s2):\r\n if s1 == s2:\r\n return True\r\n if len(s1)%2:\r\n return False\r\n if check(s1[:len(s1)//2], s2[:len(s2)//2]) and check(s1[len(s1)//2:], s2[len(s2)//2:]):\r\n return True\r\n if check(s1[:len(s1)//2], s2[len(s2)//2:]) and check(s1[len(s1)//2:], s2[:len(s2)//2]):\r\n return True\r\n return False\r\n \r\ndef gen_min(s):\r\n if len(s)%2:\r\n return s\r\n n = len(s)//2\r\n \r\n s1 = gen_min(s[n:])\r\n s2 = gen_min(s[:n])\r\n if s1 + s2 < s2 + s1:\r\n return s1 + s2\r\n return s2 + s1\r\n\r\nif gen_min(s1) == gen_min(s2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def asc(string):\n if len(string) % 2: return string\n middle = len(string) // 2\n half_a = asc(string[:middle])\n half_b = asc(string[middle:])\n return half_a + half_b if half_a < half_b else half_b + half_a\n\nprint('YES' if asc(input()) == asc(input()) else 'NO')\n", "def minimize(st):\r\n\r\n tam = len(st)\r\n if tam % 2 == 1:\r\n return st\r\n\r\n mid1 = (tam)//2\r\n\r\n s1 = minimize(st[:mid1])\r\n s2 = minimize(st[mid1:])\r\n\r\n return min(s1+s2, s2+s1)\r\na = input()\r\nb = input()\r\n\r\na = minimize(a)\r\nb = minimize(b)\r\n\r\nif a == b:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def eq(s1, s2) :\r\n if s1 == s2 :\r\n return 1\r\n elif len(s1) == 1 or (len(s1) % 2 != 0 and s1 != s2) :\r\n return 0\r\n mid = len(s1)//2\r\n return ((eq(s1[:mid], s2[mid:]) and eq(s1[mid:], s2[:mid])) or (eq(s1[:mid], s2[:mid]) and eq(s1[mid:], s2[mid:])))\r\ns1, s2 = input(), input()\r\nprint(\"YES\" if eq(s1, s2) == 1 else \"NO\")\r\n", "from heapq import merge\ndef f(s):\n l = len(s)\n return sorted([f(s[:l>>1]),f(s[l>>1:])]) if l & 1 == 0 else s \nprint('YES' if f(input()) == f(input()) else 'NO')", "import sys\nimport os.path\n\n\ndef judge(strA, strB):\n if strA == strB:\n return True\n length = len(strA)\n half_len = length >> 1\n if length & 1 == 0:\n a1 = strA[:half_len]\n a2 = strA[half_len:]\n b1 = strB[:half_len]\n b2 = strB[half_len:]\n return (judge(a1, b1) and judge(a2, b2)) or (judge(a2, b1) and judge(a1, b2))\n return False\n\n\nif __name__ == '__main__':\n if os.path.isfile(\"in.txt\"):\n sys.stdin = open(\"in.txt\", \"r\", encoding=\"utf-8\")\n if judge(input(), input()):\n print(\"YES\")\n else:\n print(\"NO\")\n\n \t \t\t \t\t \t \t \t \t\t \t\t\t \t", "s1 = input()\r\ns2 = input()\r\n\r\ndef split(s1, s2):\r\n if len(s1) != len(s2):\r\n return False\r\n\r\n if s1 == s2:\r\n return True\r\n\r\n if len(s1) % 2 != 0:\r\n return False\r\n\r\n if len(s1) == 2:\r\n return (s1[0] == s2[1] and s2[0] == s1[1]) or (s1[0] == s2[0] and s1[1] == s2[1])\r\n\r\n\r\n mid = len(s2) // 2\r\n a1, a2 = s1[:mid], s1[mid:]\r\n b1, b2 = s2[mid:], s2[:mid]\r\n\r\n return (split(a1, b1) and split(a2, b2)) or (split(a1, b2) and split(a2,b1))\r\n\r\n\r\nif split(s1, s2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a = input()\nb = input()\n\ndef checkStr(a):\n if (len(a) % 2 > 0):\n return a\n else:\n left = checkStr(a[:len(a)//2])\n right = checkStr(a[len(a)//2:])\n return min(left + right, right + left)\n\nprint(\"YES\" if (checkStr(a) == checkStr(b)) else \"NO\")\n \t\t\t\t \t \t \t \t \t \t \t\t", "a, b = \"\", \"\"\ndef equi(s):\n n = len(s)\n if n%2 : return s\n n = int(n/2)\n s1, s2 = equi(s[:-n]), equi(s[n:])\n if s1>s2 : return s1+s2\n else : return s2+s1\n\na, b = input(), input()\nif (equi(a)==equi(b)) : print(\"YES\")\nelse : print(\"NO\")\n\t \t \t \t\t\t\t\t \t\t\t \t\t \t \t\t", "def equivalency(s):\r\n s_lenght = len(s)\r\n\r\n if s_lenght % 2 != 0:\r\n return s\r\n\r\n s_half_lenght = s_lenght // 2\r\n s1 = equivalency(s[0:s_half_lenght])\r\n s2 = equivalency(s[s_half_lenght:s_lenght])\r\n\r\n if s1 < s2:\r\n return s1 + s2\r\n else:\r\n return s2 + s1\r\n\r\n\r\nl1 = input()\r\nl2 = input()\r\n\r\nif equivalency(l1) == equivalency(l2):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "def equal(s):\r\n if len(s)%2==1 : return s\r\n m = len(s)//2\r\n a=equal(s[:m])\r\n b=equal(s[m:])\r\n return a+b if a<b else b+a\r\nprint(\"YES\" if equal(input())==equal(input()) else 'NO')", "# coding:utf-8\r\n# Equivalent Strings\r\n\r\nx = input()\r\ny = input()\r\n\r\ndef substring(word):\r\n\tsize = len(word)\r\n\tif(size % 2 == 1):\r\n\t\treturn word\r\n\tword_a = substring(word[0:int(size/2)])\r\n\tword_b = substring(word[int(size/2):size])\r\n\tif(word_a < word_b):\r\n\t\treturn word_a + word_b\r\n\telse:\r\n\t\treturn word_b + word_a\r\n\t\r\n\r\nif(substring(x) == substring(y)):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n\t\r\n\t\r\n", "def check(s):\r\n if len(s) % 2: return s\r\n\r\n a = check(s[:len(s)//2])\r\n b = check(s[len(s)//2:])\r\n \r\n return a + b if a < b else b + a\r\n\r\n\r\na = str(input())\r\nb = str(input())\r\nif(check(a) == check(b)): print(\"YES\")\r\nelse: print('NO')\r\n", "def lexmin(s):\n if len(s)&1:\n return s\n h = len(s)>>1\n s1 = lexmin(s[:h])\n s2 = lexmin(s[h:])\n if s1<s2:\n return s1+s2\n return s2+s1\n\na=input()\nb=input()\nif len(a)&1:\n if a==b:\n print(\"YES\")\n else:\n print(\"NO\")\nelse:\n if lexmin(a)==lexmin(b):\n print(\"YES\")\n else:\n print(\"NO\")\n", "def funcc(s):\r\n l=len(s);\r\n return sorted([funcc(s[:l//2]),funcc(s[l//2:])]) if l%2==0 else s\r\n\r\nprint('YES' if funcc(input())==funcc(input()) else'NO')", "a = input()\r\nb = input()\r\n\r\ndef solve(a, b):\r\n\tif a == b:\r\n\t\treturn True\r\n\telif len(a) % 2 == 0:\r\n\t\tmid = int(len(a) / 2)\r\n\t\treturn (solve(a[:mid], b[mid:]) and solve(a[mid:], b[:mid])) or (solve(a[:mid], b[:mid]) and solve(a[mid:], b[mid:]))\r\n\telse:\r\n\t\treturn False\r\n\r\nres = \"YES\" if solve(a, b) else \"NO\"\r\nprint(res) ", "\r\ndef equivalent(string):\r\n if len(string)%2==1:\r\n return string\r\n \r\n str1 = equivalent(string[:len(string)//2])\r\n str2 = equivalent(string[len(string)//2:])\r\n if str1 < str2:\r\n return str1 + str2\r\n else:\r\n return str2 + str1\r\n\r\na = input()\r\nb = input()\r\nif equivalent(a) == equivalent(b):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def Equiv(a):\r\n if(len(a)%2==1): return a\r\n n = len(a)//2\r\n a1 = Equiv(a[:n])\r\n a2 = Equiv(a[n:])\r\n if a1<a2: return a1+a2\r\n return a2+a1\r\n\r\na = input()\r\nb = input()\r\n\r\nif Equiv(a)==Equiv(b):\r\n print(\"YES\")\r\nelse:\r\n print(\"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\ndef solve(s):\r\n if len(s) & 1:\r\n return s\r\n\r\n s1, s2 = solve(s[:len(s) >> 1]), solve(s[len(s) >> 1:])\r\n return s1 + s2 if s1 <= s2 else s2 + s1\r\n\r\n\r\ns, t = input().rstrip(), input().rstrip()\r\nif solve(s) == solve(t):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "dc={}\r\ndef equiv(a,b):\r\n if (a,b) in dc:\r\n return dc[(a,b)]\r\n if a==b:\r\n return True\r\n if(len(a)%2==1 or len(b)%2==1):\r\n return False\r\n a1=a[:len(a)//2]\r\n a2=a[len(a)//2:]\r\n b1=b[:len(b)//2]\r\n b2=b[len(b)//2:]\r\n dc[(a,b)]= (equiv(a1,b1)and equiv(a2,b2)) or (equiv(a1,b2) and equiv(a2,b1))\r\n return dc[(a,b)]\r\na=input()\r\nb=input()\r\nif equiv(a,b):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def equal(a, b):\r\n def msort(s):\r\n length = len(s)\r\n if length % 2:\r\n return s\r\n s1 = msort(s[:length // 2])\r\n s2 = msort(s[length // 2:])\r\n if s1 < s2:\r\n return s1 + s2\r\n else:\r\n return s2 + s1\r\n if msort(a) == msort(b):\r\n return True\r\n else:\r\n return False\r\na = input()\r\nb = input()\r\n\r\nprint('YES' if equal(a, b) else 'NO')", "def solve(s):\n\tmiddle = len(s) // 2\n\tif len(s) % 2 != 0:\n\t\treturn s\n\ts1 = solve(s[0:middle]);\n\ts2 = solve(s[middle:len(s)])\n \n\tif s1 < s2:\n\t\treturn s1+s2\n\telse:\n\t\treturn s2+s1\n \ns = input()\nt = input()\n \nif solve(s) == solve(t):\n print('YES')\nelse:\n print('NO')", "a= input()\r\nb=input()\r\ndef smallestStrng(s):\r\n if len(s)%2==1:\r\n return s\r\n s1= smallestStrng(s[:len(s)//2])\r\n s2= smallestStrng(s[len(s)//2:])\r\n if(s1<s2):\r\n return s1+s2\r\n else:return s2+s1\r\ns1= smallestStrng(a)\r\ns2 = smallestStrng(b)\r\nprint('YES' if s1==s2 else 'NO')", "def f(s):\r\n if len(s) % 2 == 1:\r\n return s\r\n a = f(s[:len(s) // 2])\r\n b = f(s[len(s) // 2:])\r\n if a < b:\r\n return a+b\r\n else:\r\n return b+a\r\n \r\nstring1 = input()\r\nstring2 = input()\r\n\r\nif f(string1) == f(string2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "first_string = input()\r\nsecond_string = input()\r\n\r\n\r\ndef prepare_string(s):\r\n if(len(s) % 2 != 0):\r\n return s\r\n\r\n str1 = prepare_string(s[0:int(len(s)/2)])\r\n str2 = prepare_string(s[int(len(s)/2):len(s)])\r\n\r\n if(str1 < str2):\r\n return str1+str2\r\n else:\r\n return str2+str1\r\n\r\n\r\nif(prepare_string(first_string) == prepare_string(second_string)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from sys import stdin\nmemo = dict()\ndef equiv(s1, s2):\n #print(s1, s2)\n if s1 == s2:\n #print(True)\n return True\n if len(s1) % 2 == 1: #odd true-equivalency considered in above clause\n return False\n #print(False)\n if (s1, s2) in memo:\n return memo[(s1, s2)]\n if equiv(s1[:int(len(s1)/2)], s2[:int(len(s2)/2)]) and equiv(s1[int(len(s1)/2):], s2[int(len(s2)/2):]):\n memo[(s1, s2)] = True\n #print(True)\n return True\n if equiv(s1[:int(len(s1)/2)], s2[int(len(s2)/2):]) and equiv(s1[int(len(s1)/2):], s2[:int(len(s2)/2)]):\n memo[(s1, s2)] = True\n #print(True)\n return True\n memo[(s1, s2)] = False\n #print(False)\n return False\na = stdin.readline().rstrip('\\n')\nb = stdin.readline().rstrip('\\n')\nif equiv(a, b):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "def func(s):\r\n size = len(s)\r\n if size % 2:\r\n return s\r\n\r\n a = func(s[:size // 2])\r\n b = func(s[size // 2:])\r\n\r\n return a + b if a < b else b + a\r\n\r\n\r\na = input()\r\nb = input()\r\nprint('YES' if func(a) == func(b) else 'NO')\r\n", "\ndef canonical(s):\n n = len(s)\n if n % 2 == 1:\n return s\n x = canonical(s[:n//2])\n y = canonical(s[n//2:])\n return x + y if x < y else y + x\n\n\ns = input()\nt = input()\n\nprint(\"YES\" if canonical(s) == canonical(t) else \"NO\")", "def equal(stra,strb):\r\n if (stra == strb):\r\n return True\r\n size = len(stra) \r\n if (size%2):\r\n return False\r\n n = size//2\r\n stra_1 = stra[:n]\r\n stra_2 = stra[n:]\r\n strb_1 = strb[:n]\r\n strb_2 = strb[n:]\r\n return (equal(stra_1,strb_2) and equal(strb_1,stra_2)) or (equal(stra_1,strb_1) and equal(strb_2,stra_2))\r\n \r\nstra = input()\r\nstrb = input()\r\n \r\nif(equal(stra,strb)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def equ(s):\n l = len(s)\n return sorted([equ(s[:l // 2]), equ(s[l // 2:])]) if l % 2 == 0 else s\nprint('YES' if equ(input()) == equ(input()) else 'NO')", "import math\r\na=input()\r\nb=input()\r\ndef equivalent(a,b):\r\n if a==b:\r\n return True\r\n elif len(a)%2!=0:\r\n return False\r\n else:\r\n x=len(a)\r\n x=x//2\r\n a1=a[:x]\r\n a2=a[x:]\r\n b1=b[:x]\r\n b2=b[x:]\r\n return (equivalent(a1,b1) and equivalent(a2,b2)) or (equivalent(a2,b1) and equivalent(a1,b2))\r\nif equivalent(a,b):\r\n print('YES')\r\nelse:\r\n print('NO')", "def equivalencia(letras):\r\n if len(letras) % 2: \r\n return letras\r\n letras_1 = equivalencia(letras[:len(letras)//2])\r\n letras_2 = equivalencia(letras[len(letras)//2:])\r\n \r\n if letras_1 < letras_2:\r\n retorno = letras_1 + letras_2 \r\n else:\r\n retorno = letras_2 + letras_1\r\n\r\n return retorno\r\n\r\nletras_1 = str(input())\r\nletras_2 = str(input())\r\nequivalentes = equivalencia(letras_1) == equivalencia(letras_2)\r\n\r\nif equivalentes:\r\n print(\"Yes\")\r\nelse:\r\n print(\"NO\")", "#!/usr/bin/env python\n# -*- coding: utf-8 -*-\n\nimport unittest\n\n\ndef solve(a, b):\n def msort(s):\n l = len(s)\n if l % 2:\n return s\n mid_idx = l // 2\n s1 = msort(s[:mid_idx])\n s2 = msort(s[mid_idx:])\n return s1 + s2 if s1 < s2 else s2 + s1\n return msort(a) == msort(b)\n\n\ndef getinput():\n def getints_line():\n return list(map(int, input().split(' ')))\n return input(), input()\n\n\ndef test():\n art = Assert()\n art.equal(solve('aaba', 'abaa'), True)\n art.equal(solve('aabb', 'abab'), False)\n\n\ndef main():\n # test()\n print('YES' if solve(*getinput()) else 'NO')\n # print('\\n'.join(map(str, solve(*getinput()))))\n\n\nclass Assert(unittest.TestCase):\n def equal(self, a, b):\n self.assertEqual(a, b)\n\nif __name__ == '__main__':\n main()\n\n", "def half(string):\r\n n = int(len(string) / 2)\r\n return string[:n], string[n:]\r\n\r\ndef equal(string):\r\n if len(string) % 2 == 1:\r\n return string\r\n \r\n a, b = half(string)\r\n a = equal(a)\r\n b = equal(b)\r\n return a + b if a <= b else b + a\r\n\r\na = input()\r\nb = input()\r\n\r\nif len(a) != len(b):\r\n print(\"NO\")\r\n exit()\r\n\r\nprint(\"YES\") if equal(a) == equal(b) else print(\"NO\")", "def f(l,r,a):\n\tif((r-l)%2==0):\n\t\treturn a[l:r+1]\n\telse:\n\t\ts1=f(l,int((l+r)/2),a)\n\t\ts2=f(int((l+r)/2)+1,r,a)\n\t\treturn min(s1,s2)+max(s1,s2)\na=input()\nb=input()\nn=len(a)\nif f(0,n-1,a)==f(0,n-1,b):\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n", "def arrumar(s):\r\n if len(s) % 2: return s\r\n a = arrumar(s[:len(s) // 2])\r\n b = arrumar(s[len(s) // 2:])\r\n return a + b if a > b else b + a\r\n \r\n\r\npalavra1 = str(input())\r\npalavra2 = str(input())\r\ntamanho = len(palavra1)\r\ntemp1 = \"\"\r\nif arrumar(palavra1) == arrumar(palavra2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\na1 = palavra1[0 :int(tamanho/2)]\r\na2 = palavra1[int(tamanho/2) : ]\r\nb1 = palavra2[0 :int(tamanho/2)]\r\nb2 = palavra2[int(tamanho/2) : ]\r\nresultado = False\r\n \r\n\r\nif tamanho % 2 == 1 :\r\n if palavra1 == palavra2:\r\n temp1 = \"YES\"\r\n else:\r\n temp1 = \"NO\"\r\n\r\nelse: \r\n ele = [a1, b1, a2, b2]\r\n for x in range(len(ele)):\r\n sorted_characters = sorted(ele[x])\r\n ele[x] = \"\".join(sorted_characters)\r\n \r\n \r\n if ((ele[0] == ele[1] and ele[2] == ele[3]) or (ele[0] == ele[3] and ele[2] == ele[1])):\r\n resultado = True\r\n \r\n if resultado:\r\n temp1 = \"YES\"\r\n else:\r\n temp1 = \"NO\"\r\n\r\n'''palavra1 = str(input())\r\npalavra2 = str(input())\r\ntamanho = len(palavra1)\r\na1 = palavra1[0 :int(tamanho/2)]\r\na2 = palavra1[int(tamanho/2) : ]\r\nb1 = palavra2[0 :int(tamanho/2)]\r\nb2 = palavra2[int(tamanho/2) : ]\r\nresultado = False\r\n \r\n\r\nif tamanho % 2 == 1 :\r\n if palavra1 == palavra2:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\nelse: \r\n ele = [a1, b1, a2, b2]\r\n for x in range(len(ele)):\r\n sorted_characters = sorted(ele[x])\r\n ele[x] = \"\".join(sorted_characters)\r\n \r\n \r\n if ((ele[0] == ele[1] and ele[2] == ele[3]) or (ele[0] == ele[3] and ele[2] == ele[1])):\r\n resultado = True\r\n\r\n \r\n print(\" \")\r\n ele2 = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','x','y','w','z']\r\n for x in range(len(ele)):\r\n print(\" \")\r\n for y in range(len(ele2)):\r\n \r\n print('occurrence of letter a:', ele2[y])\r\n print( ele[x].count(ele2[y]))\r\n \r\n \r\n if resultado:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n'''\r\n", "#Kamila\r\n#118210525\r\n\r\ndef div(palavra):\r\n tam = len(palavra)\r\n if tam%2 == 1:\r\n return palavra\r\n tam = tam // 2\r\n esq = div(palavra[:tam])\r\n dir = div(palavra[tam:])\r\n if esq < dir:\r\n return esq + dir \r\n else:\r\n return dir + esq\r\n \r\npalavra1, palavra2 = input(), input()\r\nprint('YES' if div(palavra1) == div(palavra2) else \"NO\")", "firstString = input()\r\nsecondString = input()\r\n\r\ndef sortedStr (word):\r\n if (len(word) % 2 == 1):\r\n return word\r\n mid = int(len(word)/2)\r\n left = sortedStr(word[mid:])\r\n right = sortedStr(word[:mid])\r\n if (left > right):\r\n return right + left\r\n else:\r\n return left + right\r\n\r\nvalid = sortedStr(firstString) == sortedStr(secondString)\r\n\r\nprint(\"YES\" if valid else \"NO\")", "import sys\r\nfrom collections import Counter\r\n\r\na, b = input(), input()\r\n\r\nsys.setrecursionlimit(100)\r\n\r\n\r\ndef solve(a, b):\r\n def is_eq(l, a, b):\r\n if a == b:\r\n return True\r\n if l % 2 == 1:\r\n return a == b\r\n l //= 2\r\n a1, a2 = a[:l], a[l:]\r\n b1, b2 = b[:l], b[l:]\r\n return (is_eq(l, a1, b1) and is_eq(l, a2, b2)) or (is_eq(l, a1, b2) and is_eq(l, a2, b1))\r\n\r\n l = len(a)\r\n if Counter(a) != Counter(b):\r\n return False\r\n return is_eq(l, a, b)\r\n\r\n\r\nprint('YES' if solve(a, b) else 'NO')\r\n", "def check(s):\r\n l = len(s)\r\n if l % 2:\r\n return s\r\n lef = check(s[:l//2])\r\n rig = check(s[l//2:])\r\n ans = lef+rig if lef > rig else rig+lef\r\n return ans\r\ns = input()\r\ns2 = input()\r\n\r\ns_2 = check(s)\r\ns2_2 = check(s2)\r\nif s_2 == s2_2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def equiv(a, b):\r\n if a == b:\r\n return True\r\n if len(a) % 2:\r\n return False\r\n n = len(a)\r\n a1 = a[:n//2]\r\n a2 = a[n//2:]\r\n b1 = b[:n//2]\r\n b2 = b[n//2:]\r\n return (equiv(a1, b2) and equiv(a2, b1)) or (equiv(a1, b1) and equiv(a2, b2))\r\n\r\na = input()\r\nb = input()\r\n\r\nprint(\"YES\" if equiv(a, b) else \"NO\")", "def equal(s1,s2,size):\n \n if s1 == s2:\n return True\n \n half = int(size/2)\n if size % 2 == 1: \n return s1 == s2\n else:\n a1 = s1[0:half]\n b1 = s2[0:half]\n a2 = s1[half:size]\n b2 = s2[half:size]\n \n if (equal(a1,b2,half) and equal(a2,b1,half)):\n return True\n else:\n return (equal(a1,b1,half) and equal(a2,b2,half))\n \ns1 = input()\ns2 = input()\n \nif equal(s1, s2, len(s1)):\n print('YES')\nelse:\n print('NO')\n##Básicamente fue separar los 2 strings y partirlos cada uno en 2 partes iguales tal y como lo plantea el problema, de esta manera pude realizar la comparación de las partes cruzadas de los strings y asi determinar si la partes son iguales o no\n \t\t \t \t \t\t \t \t\t\t", "# Mateus Brito de Sousa Rangel - 117110914\r\n\r\na = input()\r\nb = input()\r\n \r\ndef half_str(s):\r\n return s[:len(s)//2], s[len(s)//2:]\r\n \r\ndef compare(a,b):\r\n if a == b:\r\n return True\r\n \r\n elif len(a) % 2 == 1:\r\n return False\r\n \r\n else:\r\n a1, a2 = half_str(a)\r\n b1, b2 = half_str(b)\r\n \r\n return compare(a1,b2) and compare(a2,b1) or compare(a1,b1) and compare(a2,b2)\r\n \r\ndef solve(a,b):\r\n equivalent = compare(a,b)\r\n \r\n if equivalent:\r\n print(\"YES\")\r\n \r\n else:\r\n print(\"NO\")\r\n \r\nsolve(a,b)", "def eqv_s(s):\r\n if len(s) % 2:\r\n return s\r\n\r\n h1 = eqv_s(s[0:int(len(s)/2)])\r\n h2 = eqv_s(s[int(len(s)/2):])\r\n\r\n if h1 < h2:\r\n return h1+h2\r\n else:\r\n return h2+h1\r\n\r\na = input()\r\nb = input()\r\n\r\nif eqv_s(a) == eqv_s(b):\r\n print('YES')\r\nelse:\r\n print('NO')", "def equivalentStrings(string):\r\n if len(string) & 1: return string\r\n a = equivalentStrings(string[ : len(string) >> 1])\r\n b = equivalentStrings(string[len(string) >> 1 : ])\r\n \r\n return a + b if a < b else b + a\r\nprint('YES' if equivalentStrings(input()) == equivalentStrings(input()) else 'NO')", "def fin(s):\r\n if len(s)%2:return s\r\n a=fin(s[:len(s)//2])\r\n b=fin(s[len(s)//2:])\r\n if a<b:\r\n return a+b\r\n else:\r\n return b+a\r\ns1 = input()\r\ns2 = input()\r\nif(fin(s1)==fin(s2)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") ", "# @author Matheus Alves dos Santos\n\ndef slice_halves(string, length):\n half = length // 2\n return string[ : half], string[half : ]\n\n\ndef sort_substrings(string):\n length = len(string)\n \n if (length % 2 == 0):\n half_1, half_2 = slice_halves(string, length)\n a, b = sort_substrings(half_1), sort_substrings(half_2)\n \n return min(f'{a}{b}', f'{b}{a}')\n else:\n return string\n\n\ndef is_equivalent(a, b):\n return (sort_substrings(a) == sort_substrings(b))\n\n\na, b = input(), input()\nprint('YES' if (is_equivalent(a, b)) else 'NO')\n", "def equi(ans):\n if (len(ans) % 2) == 1:\n return ans\n \n val1 = equi(ans[:len(ans)//2])\n val2 = equi(ans[len(ans)//2:])\n \n if(val1 < val2):\n return val1 + val2\n else:\n return val2 + val1\n \nif(equi(input()) == equi(input())):\n print(\"YES\")\nelse:\n print(\"NO\")\n\n", "def check(s):\r\n l = len(s)\r\n return sorted([check(s[:l // 2]), check(s[l // 2:])]) if l % 2 == 0 else s\r\nprint('YES' if check(input()) == check(input()) else 'NO')", "def g(s):\r\n l=len(s)\r\n return sorted([g(s[:l//2]),g(s[l//2:])])if l%2==0 else s\r\ni=input\r\nprint('YES'if g(i())==g(i())else'NO')", "def equivalent(string):\n if(len(string)%2!=0):\n return string\n \n s1=equivalent(string[len(string)//2:])\n s2=equivalent(string[:len(string)//2])\n \n # concat at the orden.\n if(s1<s2):\n return s1+s2\n else:\n return s2+s1\n\n\nstr_1 = input()\nstr_2 = input()\n\nif(equivalent(str_1) == equivalent(str_2)):\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\n", "# submission version \n\na_str=input()\nb_str=input()\n\n# snippet from code forces tutorial \ndef smallest( a_str):\n if (len(a_str) % 2 == 1):\n return a_str\n s1 = smallest(a_str[0: int(len(a_str)/2)])\n s2 = smallest(a_str[int(len(a_str)/2): len(a_str)])\n if (s1 < s2):\n return s1 + s2\n else:\n return s2 + s1\n\nans = smallest(a_str) == smallest(b_str)\n\nif ans:\n print(\"YES\")\nelse:\n print(\"NO\")", "def rec(s):\r\n if len(s)&1:\r\n return s\r\n l=rec(s[:len(s)//2])\r\n r=rec(s[len(s)//2:])\r\n l,r=sorted([l,r])\r\n return l+r\r\na=input()\r\nb=input()\r\na=rec(a)\r\nb=rec(b)\r\nprint([\"NO\",\"YES\"][a==b])\r\n", "def divide(givenString):\n lengthOfStr = len(givenString)\n if (lengthOfStr % 2 == 0):\n firstHalf = divide(givenString[:(lengthOfStr // 2)])\n secondHalf = divide(givenString[(lengthOfStr // 2):])\n combA = f'{firstHalf}{secondHalf}'\n combB = f'{secondHalf}{firstHalf}'\n if(combA < combB):\n return combA\n else:\n return combB\n else:\n return givenString\n\n\na = input()\nb = input()\nif (divide(a) == divide(b)):\n print('YES')\nelse:\n print('NO')\n\t \t \t\t \t \t\t \t \t \t \t", "def f(s):\n if(len(s) %2 !=0):\n return s\n s1=f(s[int(len(s)/2):])\n s2=f(s[:int(len(s)/2)])\n if(s1<s2):\n return s1+s2;\n else:\n return s2+s1;\n\ns = input()\nt = input()\nif(f(s)==f(t)):\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 divideSort(string):\r\n if len(string) % 2:\r\n return string\r\n\r\n a = divideSort(string[:len(string)//2])\r\n b = divideSort(string[len(string)//2:])\r\n\r\n if (a < b):\r\n return a + b\r\n else:\r\n return b + a\r\n\r\nif __name__ == '__main__':\r\n a = input()\r\n b = input()\r\n\r\n if divideSort(a) == divideSort(b):\r\n print('YES')\r\n else:\r\n print('NO')", "def equivalent_strings(string1, string2,tam):\n if(string1 == string2):\n return True\n\n if(tam % 2 == 1):\n return False\n\n metade = tam//2\n a1 = string1[:metade]\n a2 = string1[metade:]\n\n b1 = string2[:metade]\n b2 = string2[metade:]\n\n if (equivalent_strings(a1,b2,metade)):\n return equivalent_strings(a2,b1,metade)\n\n elif (equivalent_strings(a1,b1,metade)):\n return equivalent_strings(a2,b2,metade)\n\n else:\n return False\n\n\nstring1 = input()\nstring2 = input()\ntam = len(string1)\n\nprint(\"YES\" if equivalent_strings(string1,string2,tam) else \"NO\")\n", "def solucao(string):\n if len(string) % 2 : \n return string\n substring_a = solucao(string[:len(string)//2])\n substring_b = solucao(string[len(string)//2:])\n \n if (substring_a < substring_b):\n return substring_a + substring_b\n else:\n return substring_b + substring_a\n\nprint('YES' if solucao(input()) == solucao(input()) else 'NO')", "def leastLexiString(s): \n\n if (len(s) & 1 != 0): \n return s \n\n x = leastLexiString(s[0:int(len(s) / 2)]) \n y = leastLexiString(s[int(len(s) / 2):len(s)])\n\n return min(x + y, y + x)\n\na = input()\nb = input()\n\nif (leastLexiString(a) == leastLexiString(b)): \n print(\"YES\") \nelse: \n print(\"NO\") \n\t\t \t \t \t \t\t \t\t \t\t\t \t", "def cek(x):\r\n m = len(x)\r\n if m%2==1:\r\n return x\r\n m//=2\r\n a = cek(x[:m])\r\n b = cek(x[m:])\r\n if a<b:\r\n return a+b\r\n else:\r\n return b+a\r\na= input()\r\nb=input()\r\nif cek(a)==cek(b):\r\n print(\"YES\" )\r\nelse:\r\n print(\"NO\")\r\n", "def solve(a,b):\r\n length = len(a)\r\n half_length = length//2\r\n '''if len(a):\r\n print(a)\r\n print(b)'''\r\n if (a==b):\r\n return True\r\n elif (len(a)%2)==0:\r\n a1=a[:half_length]\r\n a2=a[half_length:]\r\n b1=b[:half_length]\r\n b2=b[half_length:]\r\n return ((solve(a1, b2) and solve(a2, b1)) or (solve(a1, b1) and solve(a2, b2)))\r\n else:\r\n return False\r\n \r\na = input()\r\nb = input()\r\nif solve(a, b):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def mins(s):\r\n if len(s) & 1:\r\n return s\r\n x = mins(s[len(s)//2:])\r\n y = mins(s[:len(s)//2])\r\n\r\n return min(x, y)+max(x, y)\r\n\r\n\r\na = input()\r\nb = input()\r\n\r\nif mins(a) == mins(b):\r\n print('YES')\r\n exit()\r\nprint('NO')\r\n", "\ndef orderStr(a:str):\n if len(a)%2!=0:\n return a\n a1 = orderStr(a[0:int(len(a)/2)])\n a2 = orderStr(a[int(len(a)/2):len(a)])\n if a1<a2:\n return a1+a2\n else:\n return a2+a1\n \naa = input()\nbb = input()\nif orderStr(aa)== orderStr(bb):\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", "from functools import lru_cache\r\n\r\na = input()\r\nb = input()\r\n\r\n@lru_cache(maxsize=1<<12)\r\ndef check_equ(a, b):\r\n if a == b:\r\n return True\r\n if len(a) % 2 > 0 or len(b) % 2 > 0 or len(a) != len(b):\r\n return False\r\n a1, a2 = a[:len(a)//2], a[len(a)//2:]\r\n b1, b2 = b[:len(a)//2], b[len(a)//2:]\r\n #print(a1, a2, b1, b2)\r\n return (check_equ(a1, b1) and check_equ(a2, b2)) or (check_equ(a1, b2) and check_equ(a2, b1))\r\n\r\nprint(\"YES\" if check_equ(a, b) else \"NO\")\r\n#print(check_equ.cache_info())\r\n", "def equivalent(x):\r\n end = len(x)\r\n if(end % 2 == 0):\r\n stra = equivalent(x[0:int(end/2)])\r\n strb = equivalent(x[int(end/2):])\r\n if(stra > strb):\r\n return [strb,stra]\r\n else:\r\n return [stra,strb]\r\n else:\r\n return x \r\n \r\na = str(input())\r\nb = str(input())\r\nif(equivalent(a) == equivalent(b)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def solution(string):\r\n l = len(string)\r\n return sorted([solution(string[:int(l/2)]), solution(string[int(l/2):])]) if l%2==0 else string\r\nif solution(input()) == solution(input()):\r\n print('YES')\r\nelse: \r\n print('NO')\r\n", "def rec(str):\n if(len(str)%2):\n return str\n le = len(str)\n le //= 2\n dp1 = rec(str[:le])\n dp2 = rec(str[le:])\n if(dp1<dp2):\n return dp1+dp2\n return dp2+dp1\na,b = input(),input()\nstr1 = rec(a)\nstr2 = rec(b)\nif str1==str2:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "\"\"\"\r\nB. Equivalent Strings\r\ntime limit per test2 seconds\r\nmemory limit per test256 megabytes\r\ninputstandard input\r\noutputstandard output\r\nToday on a lecture about strings Gerald learned a new definition of string equivalency. Two strings a and b of equal\r\nlength are called equivalent in one of the two cases:\r\nThey are equal.\r\nIf we split string a into two halves of the same size a1 and a2, and string b into two halves of the same size b1\r\nand b2, then one of the following is correct:\r\na1 is equivalent to b1, and a2 is equivalent to b2\r\na1 is equivalent to b2, and a2 is equivalent to b1\r\nAs a home task, the teacher gave two strings to his students and asked to determine if they are equivalent.\r\nGerald has already completed this home task. Now it's your turn!\r\nInput\r\nThe first two lines of the input contain two strings given by the teacher. Each of them has the length\r\nfrom 1 to 200 000 and consists of lowercase English letters. The strings have the same length.\r\nOutput\r\nPrint \"YES\" (without the quotes), if these two strings are equivalent, and \"NO\" (without the quotes) otherwise.\r\n\"\"\"\r\n\r\n\r\ndef lexical_smaller(s):\r\n if len(s) % 2 == 1:\r\n return s\r\n left = lexical_smaller(s[: len(s) // 2])\r\n right = lexical_smaller(s[len(s) // 2:])\r\n return left + right if left < right else right + left\r\n\r\n\r\ndef equivalent(s1, s2):\r\n return lexical_smaller(s1) == lexical_smaller(s2)\r\n\r\n\r\nif __name__ == '__main__':\r\n a = input()\r\n b = input()\r\n if equivalent(a, b):\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "def func(string):\r\n tamanho = len(string)\r\n if tamanho%2 == 1:\r\n return string\r\n else:\r\n tamanho = tamanho//2\r\n string1 = func(string[:tamanho])\r\n string2 = func(string[tamanho:])\r\n if string1<string2: \r\n return string1+string2\r\n else:\r\n return string2+string1\r\n\r\na = input()\r\nb = input()\r\nif func(a) == func(b):\r\n print('YES')\r\nelse:\r\n print('NO') \r\n", "a = input()\r\nb = input()\r\n\r\ndef split_sort(s):\r\n if len(s) % 2:\r\n return s\r\n mid = len(s) // 2\r\n a,b = split_sort(s[:mid]), split_sort(s[mid:])\r\n\r\n return a+b if a<b else b+a\r\n\r\nif split_sort(a) == split_sort(b):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def check(s):\r\n n = len(s)\r\n if n & 1:\r\n return s\r\n else:\r\n s1 = check(s[:n//2])\r\n s2 = check(s[n//2:])\r\n if s1 >s2:\r\n return s2+s1\r\n else:\r\n return s1+s2\r\n\r\na = input()\r\nb = input()\r\nif check(a)==check(b):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def function(s):\r\n lens=len(s)\r\n if lens%2:\r\n return s\r\n return sorted([function(s[:lens//2]),function(s[lens//2:])])\r\nif function(input())==function(input()):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def is_equivalent(a, b):\n if a == b:\n return True\n s_len = len(a)\n if s_len%2 != 0:\n return False\n a1 = a[:s_len//2]\n a2 = a[s_len//2:]\n b1 = b[:s_len // 2]\n b2 = b[s_len // 2:]\n return (is_equivalent(a1, b2) and is_equivalent(a2, b1)) or (is_equivalent(a1, b1) and is_equivalent(a2, b2))\n\na = input()\nb = input()\n\nprint('YES') if is_equivalent(a, b) else print('NO')\n \t \t\t \t\t\t \t \t \t\t\t \t\t \t\t\t\t", "def lex_small(s):\r\n\tn = len(s)\r\n\tif(n%2==1):\r\n\t\treturn s\r\n\ta1 = lex_small(s[:n//2])\r\n\ta2 = lex_small(s[n//2:])\r\n\tif(a1<a2):\r\n\t\treturn a1+a2\r\n\treturn a2+a1\r\n\r\nif(lex_small(input())==lex_small(input())):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "def equivalent_string(a, b):\r\n memory = {}\r\n\r\n def equal(a, b):\r\n if (a, b) in memory:\r\n return memory[(a, b)]\r\n\r\n # BASE CASE\r\n if a == b:\r\n memory[(a, b)] = True\r\n return True\r\n\r\n if len(a) % 2 == 1:\r\n memory[(a, b)] = False\r\n return False\r\n\r\n # RECURRENT CASE\r\n mid = len(a) // 2\r\n a1, a2 = a[:mid], a[mid:]\r\n b1, b2 = b[:mid], b[mid:]\r\n\r\n result = (equal(a1, b1) and equal(a2, b2)) or (equal(a1, b2) and equal(a2, b1))\r\n memory[(a, b)] = result \r\n return result\r\n\r\n return equal(a, b)\r\n\r\n\r\nif __name__ == '__main__':\r\n a = input().strip()\r\n b = input().strip()\r\n\r\n if equivalent_string(a, b):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "#include <bits/stdc++.h>\r\n#define SYNC ios_base::sync_with_stdio(0);\r\n#define IO STD std_enable = 1; cin.tie(0);\r\n#define STD /*\r\nfrom sys import (\r\nstdin, stdout, exit as sys_ret)\r\n\"\"\"****************************\r\n\r\n Interactive Tasks:\r\n\r\n / Python: / \"\"\"\r\nf_input, f_print, f_flush = (\r\n stdin.readline,\r\n stdout.write,\r\n stdout.flush)\r\n\r\n\"\"\" / C++ /\r\n #import <cstdio>\r\n fflush(stdout);\r\n or\r\n #import <iostream>\r\n cout << endl;\r\n\r\n —————————————————————————\r\n Don't raise your voice,\r\n improve your argument.\r\n —————————————————————————\r\n\r\n cat /dev/ass > /dev/head\r\n Ctrl+C\r\n cat /knowledge > /dev/head\r\n\r\n © Jakov Gellert\r\n frvr.ru\r\n\r\n****************************\"\"\"\r\n# */ using namespace std; int\r\n#define boost_stream(); IO SYNC\r\n\r\ndef equilibrium(current):\r\n length = len(current)\r\n if length % 2 == 1:\r\n return current\r\n new1 = equilibrium(current[:length // 2])\r\n new2 = equilibrium(current[length // 2:])\r\n if new1 < new2:\r\n return (new1 + new2)\r\n else:\r\n return (new2 + new1)\r\n\r\nstring1 = equilibrium(f_input().replace('\\n', ''))\r\nstring2 = equilibrium(f_input().replace('\\n', ''))\r\nf_print(\"YES\" if string1 == string2 else \"NO\")", "def compara(s):\n if len(s)%2: \n return s\n \n s1 = compara(s[:len(s)//2])\n s2 = compara(s[len(s)//2:])\n \n if s1 < s2:\n return(s2+s1)\n else:\n return(s1+s2)\n \na = input()\nb = input()\nif compara(a) == compara(b):\n print(\"YES\")\nelse:\n print(\"NO\")", "def resc(s):\r\n if len(s) % 2: return s\r\n a = resc(s[:len(s)//2])\r\n b = resc(s[len(s)//2:])\r\n\r\n return a+b if a < b else b+a\r\ns1 = input()\r\ns2 = input()\r\nprint(\"YES\" if resc(s1) == resc(s2) else \"NO\" )", "def getString(s, n):\r\n if n % 2 != 0:\r\n return s\r\n firstPart = getString(s[:n//2], n//2)\r\n lastPart = getString(s[n//2:], n//2)\r\n if firstPart > lastPart:\r\n return lastPart + firstPart\r\n return firstPart + lastPart\r\ns1 = input()\r\ns2 = input()\r\nn = len(s1)\r\ns_1 = getString(s1, n)\r\ns_2 = getString(s2, n)\r\n\r\nif s_1 == s_2:\r\n print('YES')\r\nelse:\r\n print('NO')", "#tle\r\n##def dnccompare(a,b):\r\n## if a == b:\r\n## return 1\r\n## if len(a) % 2 == 0:\r\n## mid = int(len(a)/2)\r\n## a1 = a[:mid]\r\n## a2 = a[mid:]\r\n## b1 = b[:mid]\r\n## b2 = b[mid:]\r\n## a = min(a1,a2)+max(a1,a2)\r\n## b = min(b1,b2)+max(b1,b2)\r\n## if a == b:\r\n## return 1\r\n## else:\r\n#### cek1 = dnccompare(a1,b2) and dnccompare(a2,b1)\r\n#### cek2 = dnccompare(a1,b1) and dnccompare(a2,b2)\r\n## return dnccompare(min(a1,a2),min(b1,b2)) and dnccompare(max(a1,a2),max(b1,b2))\r\n## else:\r\n#### if a == b:\r\n#### return 1\r\n#### else:\r\n## return 0\r\n#inti fungsi berikut sama seperti merge sort, tetapi perbedaanya terletak pada saat conquer\r\n#jika merge sort akan membandingkan masing-masing elemen, fungsi ini hanya melihat keseluruhannya\r\n#contoh: aa dan ab, dia hanya melihat apakah aa < ab sebelum di-conquer dan jika iya akan di-conquer menjadi aaab\r\ndef dnc(a):\r\n if len(a) % 2 == 0: #hanya akan di-divide jika bisa dibagi menjadi 2 bagian yang sama panjangnya\r\n mid = int(len(a)/2) #proses divide berdasarkan titik tengah\r\n a1 = dnc(a[:mid])\r\n a2 = dnc(a[mid:])\r\n return min(a1,a2) + max(a1,a2)\r\n else:\r\n return a\r\n#fungsi ini digunakan agar pada saat perbandingan tidak perlu membandingkan kiri dengan kiri atau kiri dengan kanan\r\n#akan selalu membandingkan keseluruhan kata karena sudah di sort\r\n\r\na = str(input())\r\nb = str(input())\r\n\r\ncek = 0 #inisialisasi untuk pengecekan\r\n\r\nif a == b:\r\n cek = 1\r\nelif dnc(a) == dnc(b): #membandingkan kata setelah di-sort\r\n cek = 1\r\n\r\nif cek:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def smallest(s):\r\n s_len = len(s)\r\n if s_len % 2 == 1:\r\n return s\r\n s1 = smallest(s[0 : s_len//2])\r\n s2 = smallest(s[s_len//2 : s_len])\r\n if s1 < s2:\r\n return s1 + s2\r\n else:\r\n return s2 + s1\r\n\r\nfirst = str(input())\r\nsecond = str(input())\r\n\r\nres_1 = smallest(first)\r\nres_2 = smallest(second)\r\n\r\nif res_1 == res_2:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "def eqv(a, b):\r\n if(a == b):\r\n return True\r\n if(len(a) != len(b)):\r\n return False\r\n if(len(a) % 2 == 1):\r\n return False\r\n metade = len(a)//2\r\n \r\n a1 = a[:metade]\r\n \r\n b1 = b[:metade]\r\n a2 = a[metade:]\r\n b2 = b[metade:]\r\n \r\n return (eqv(a1, b2) and eqv(a2, b1)) or (eqv(a1, b1) and eqv(a2, b2))\r\n \r\na = input()\r\nb = input()\r\n \r\nif (eqv(a, b)):\r\n print('YES') \r\nelse:\r\n print('NO')", "def mini(s):\r\n x = len(s)\r\n if x%2==1:\r\n return s\r\n x//=2\r\n a = mini(s[0:x])\r\n b = mini(s[x::])\r\n return a+b if a<b else b+a\r\na,b = input(),input()\r\nprint(\"YES\" if mini(a)==mini(b) else \"NO\")", "a,b = \"\",\"\"\r\ndef equi(s):\r\n n = len(s)\r\n if n%2: \r\n return s\r\n n = int(n/2)\r\n s1, s2 = equi(s[:-n]),equi(s[n:])\r\n if s1 > s2 : return s1+s2\r\n else : return s2+s1\r\n \r\na, b = input(), input()\r\nprint(\"YES\") if equi(a)==equi(b) else print(\"NO\")", "def parte(s):\n\tif(len(s)%2):\n\t\treturn s\n\telse:\n\t\tm1 = parte(s[:len(s)//2]) \n\t\tm2 = parte(s[len(s)//2:])\n\treturn m1 + m2 if m1 < m2 else m2 + m1\n\t\na = input()\nb = input()\nif(parte(a) == parte(b)):\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n\n\t\t\t\t", "# https://codeforces.com/problemset/problem/559/B\ndef dc(string):\n if len(string) % 2 != 0:\n return string\n s1 = dc(string[0:len(string)//2])\n s2 = dc(string[len(string)//2:len(string)])\n \n if s1 < s2:\n return s1 + s2\n else:\n return s2 + s1\n\n\nstring1 = input()\nstring2 = input()\nif dc(string1) == dc(string2):\n print(\"YES\")\nelse:\n print(\"NO\")", "def equivalent(string):\n end = len(string)\n if (end % 2 == 0):\n stra = equivalent(string[0:int(end/2)])\n strb = equivalent(string[int(end/2):])\n if (stra > strb):\n return [strb,stra]\n else:\n return [stra,strb]\n else:\n return string\n \n \na = str(input())\nb = str(input())\n\nif(equivalent(a) == equivalent(b)):\n print(\"YES\")\nelse:\n print(\"NO\")", "def min_order(s):\r\n n = len(s)\r\n if n % 2 != 0:\r\n return s\r\n\r\n left_s = min_order(s[:n // 2])\r\n right_s = min_order(s[n // 2:])\r\n\r\n if left_s < right_s:\r\n return left_s + right_s\r\n return right_s + left_s\r\n\r\n\r\nif __name__ == '__main__':\r\n a = input()\r\n b = input()\r\n if min_order(a) == min_order(b):\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "def equivalent_strings(first_string, second_string,tamanho):\n if(first_string == second_string):\n return True\n\n if(tamanho % 2 == 1):\n return False\n\n metade = tamanho//2\n a1 = first_string[:metade]\n a2 = first_string[metade:]\n\n b1 = second_string[:metade]\n b2 = second_string[metade:]\n\n if (equivalent_strings(a1,b2,metade)):\n return equivalent_strings(a2,b1,metade)\n\n elif (equivalent_strings(a1,b1,metade)):\n return equivalent_strings(a2,b2,metade)\n\n else:\n return False\n\n\nfirst_string = input()\nsecond_string = input()\ntamanho = len(first_string)\n\nprint(\"YES\" if equivalent_strings(first_string,second_string,tamanho) else \"NO\")\n", "a = input()\r\nb = input()\r\n\r\ndef equals(a, b):\r\n if a == b:\r\n return True\r\n elif len(a) == 1:\r\n return False\r\n elif len(a) % 2 == 1:\r\n return False\r\n d = len(a) // 2\r\n \r\n return ((equals(a[:d], b[d:]) and equals(a[d:], b[:d]))\r\n or\r\n (equals(a[:d], b[:d]) and equals(a[d:], b[d:])))\r\n \r\n \r\nprint('YES' if equals(a, b) else 'NO')", "def equivalent(string):\n n = len(string)\n if n % 2:\n return string #if the number cannot be divided in half, we return the original string unchanged\n n = int(n / 2)\n s1, s2 = equivalent(string[:-n]), equivalent(string[n:]) #s1 and s2 will be recursively split until they cannot be divided by 2. ex you need to split aabb into aa bb, and then those into a+a and b+b\n #a is the smallest letter, b the biggest. This will concatenate our string in the same order so we can compare them later when we use the function\n if s1 > s2:\n return s1 + s2\n else:\n return s2 + s1\n\n\na, b = str(input()), str(input())\nn = len(a) // 2\n\n#we will take each string and pass it through the function to process. If they are equivalent the function will return equal strings since they are ordered in the last step. \n# if they are equal then the strings are equivalent\nif (equivalent(a) == equivalent(b)):\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 = input()\r\nb = input()\r\n\r\n\r\ndef equal(x: str, y: str):\r\n length = len(x)\r\n if x == y:\r\n return True\r\n elif length % 2 == 0:\r\n length = int(length/2)\r\n if equal(x[:length], y[length:]) and equal(x[length:], y[:length]):\r\n return True\r\n else:\r\n return equal(x[:length], y[:length]) and equal(x[length:], y[length:])\r\n else:\r\n return False\r\n\r\n\r\nif equal(a, b):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def encode(s):\n n = len(s)\n if n % 2 == 0:\n l = encode(s[:n//2])\n r = encode(s[n//2:])\n return l + r if l < r else r + l\n return s\n\ns = input()\nt = input()\nprint(\"YES\" if encode(s) == encode(t) else \"NO\")\n\n\t \t \t\t \t\t\t \t\t\t\t\t \t\t\t \t\t \t\t", "def smallest(s):\n if len(s)%2==1:\n return s\n s1 = smallest(s[0:len(s)//2])\n s2 = smallest(s[len(s)//2:])\n if s1<s2:\n return s1+s2\n else:\n return s2+s1\n\na = input()\nb = input()\nif smallest(a) == smallest(b):\n print('YES')\nelse:\n print('NO')\n", "import math\r\n\r\ndef f(a):\r\n l = int(len(a))\r\n if(len(a)%2):\r\n return a\r\n a1 = a[0:int(l/2)]\r\n a2 = a[int(l/2):]\r\n s1 = f(a1)\r\n s2 = f(a2)\r\n if s1<s2:\r\n return s1+s2\r\n else:\r\n return s2+s1\r\n \r\ns1 = input()\r\ns2 = input()\r\nif f(s1) == f(s2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "lista = {}\r\ndef verificar(sa,sb):\r\n \r\n if(sa+sb in lista):\r\n return lista[sa+sb]\r\n \r\n if(len(sa) == 0 or len(sb) == 0): return False\r\n \r\n if(len(sa)%2 == 1 or len(sb)%2 == 1): return sa == sb\r\n \r\n if(len(sa) == len(sb) and len(sa) == 2):\r\n sa = \"\".join(sorted(sa))\r\n sb = \"\".join(sorted(sb))\r\n if(sa == sb):\r\n lista[sa+sb] = True\r\n return True\r\n else:\r\n lista[sa+sb] = False\r\n return False\r\n \r\n la = len(sa)//2\r\n lb = len(sb)//2\r\n \r\n if((verificar(sa[:la:],sb[:lb:]) and verificar(sa[la::],sb[lb::]))\r\n or (verificar(sa[:la:],sb[lb::]) and verificar(sa[la::],sb[:lb:]))):\r\n \r\n lista[sa+sb] = True\r\n return True\r\n else:\r\n lista[sa+sb] = False\r\n return False\r\n \r\n \r\nsa = input()\r\nsb = input()\r\n \r\nif(verificar(sa,sb)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def check(a, b):\r\n\tif a == b:\r\n\t\treturn True\r\n\telif len(a) % 2 == 0:\r\n\t\taa, ab, ba, bb = a[0:len(a)//2], a[len(a)//2:len(a)], b[0:len(b)//2], b[len(b)//2:len(b)]\r\n\t\treturn (check(aa, bb) and check(ab, ba)) or (check(aa, ba) and check(ab, bb))\r\n\telse:\r\n\t\treturn False\r\n \r\nabc, bbc = input(), input()\r\nif (check(abc, bbc)):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "def compare(s):\n if len(s) % 2:\n return s\n a = compare(s[: len(s) // 2])\n b = compare(s[len(s) // 2 :])\n return a + b if a < b else b + a\n\n\nfirst_string = compare(input())\nsecond_string = compare(input())\n\nprint(\"YES\" if first_string == second_string else \"NO\")\n", "def dividir(palavra):\n tamanho = len(palavra)\n if tamanho%2 == 1:\n return palavra\n tamanho = tamanho // 2\n lado_esquerdo = dividir(palavra[:tamanho])\n lado_direito = dividir(palavra[tamanho:])\n if lado_esquerdo < lado_direito:\n return lado_esquerdo + lado_direito \n else:\n return lado_direito + lado_esquerdo\n\npalavra1, palavra2 = input(), input()\nprint('YES' if dividir(palavra1) == dividir(palavra2) else \"NO\")", "def equivalent(s):\n if len(s) % 2: return s\n a = equivalent(s[:len(s) // 2])\n b = equivalent(s[len(s) // 2:])\n return a + b if a < b else b + a\nprint('YES' if equivalent(input()) == equivalent(input()) else 'NO')\n", "def solve2(s, l):\r\n if l % 2:\r\n return s\r\n mid = l // 2\r\n s1 = solve2(s[:mid], mid)\r\n s2 = solve2(s[mid:], mid)\r\n return s1 + s2 if s1 < s2 else s2 + s1\r\n \r\n \r\ns1 = input()\r\ns2 = input()\r\nn = len(s1)\r\nres1 = solve2(s1, n)\r\nres2 = solve2(s2, n)\r\nif res1 == res2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "def fun(s):\n\tif len(s) % 2:\n\t\treturn s\n\ta = fun(s[:len(s)//2])\n\tb = fun(s[len(s)//2:])\n\treturn a+b if a < b else b + a\na = input()\nb = input()\nif fun(a) == fun(b):\n\tprint('YES')\nelse:\n\tprint('NO')", "def equivalente(s):\n if len(s) % 2: \n return s\n\n a = equivalente(s[:len(s)//2])\n b = equivalente(s[len(s)//2:])\n \n return a + b if a < b else b + a\nprint('YES' if equivalente(input()) == equivalente(input()) else 'NO')", "memo = {}\r\ndef is_equal(a, b):\r\n if (a,b) in memo: return memo[a,b]\r\n if len(a) == 1: return a == b\r\n if len(a)%2 == 1: return a == b\r\n\r\n a1, a2 = a[:len(a)//2], a[len(a)//2:]\r\n b1, b2 = b[:len(a)//2], b[len(a)//2:]\r\n \r\n if (a1 == b1 and a2 == b2) or (a1 == b2 and a2 == b1): \r\n memo[a, b] = True\r\n return True\r\n memo[a,b] = (is_equal(a1, b1) and is_equal(a2, b2)) or (is_equal(a1, b2) and is_equal(a2, b1))\r\n return memo[a, b]\r\n\r\n\r\n\r\na = input()\r\nb = input()\r\nif is_equal(a,b): print(\"YES\")\r\nelse: print(\"NO\")", "\r\ndef divide_letras(palavra):\r\n tamanho = len(palavra)\r\n\r\n if (tamanho % 2 == 1):\r\n return palavra\r\n\r\n tamanho = tamanho // 2 \r\n esquerda = divide_letras(palavra[:tamanho])\r\n direita = divide_letras(palavra[tamanho:])\r\n \r\n if (esquerda < direita):\r\n return (esquerda + direita) \r\n else:\r\n return (direita + esquerda)\r\n \r\n\r\na = input()\r\nb = input()\r\n\r\nif(divide_letras(a) == divide_letras(b)):\r\n print('YES ')\r\nelse:\r\n print('NO')\r\n", "a = input()\r\nb = input()\r\n\r\n\r\ndef equivalent_strings(string):\r\n len_string = len(string)\r\n\r\n if (len_string % 2 == 0):\r\n n = int(len_string / 2)\r\n string_1, string_2 = equivalent_strings(\r\n string[:n]), equivalent_strings(string[n:])\r\n return sorted([string_1, string_2])\r\n else:\r\n return string\r\n\r\n\r\nif (equivalent_strings(a) == equivalent_strings(b)):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "def main():\n def f(lo, hi):\n if not ((hi - lo) & 1):\n mi = (hi + lo) // 2\n f(lo, mi)\n f(mi, hi)\n if a[mi:hi] < a[lo:mi]:\n a[lo:mi], a[mi:hi] = a[mi:hi], a[lo:mi]\n if b[mi:hi] < b[lo:mi]:\n b[lo:mi], b[mi:hi] = b[mi:hi], b[lo:mi]\n\n a, b = list(input()), list(input())\n f(0, len(a))\n print((\"NO\", \"YES\")[a == b])\n\n\nif __name__ == '__main__':\n main()\n", "def divide(value):\n length = len(value)\n if (length % 2 == 0):\n firstHalf = value[ 0 : (length // 2)]\n secondHalf = value[(length // 2) : length]\n a = divide(firstHalf)\n b = divide(secondHalf)\n \n return min(f'{a}{b}', f'{b}{a}')\n else:\n return value\n\na = input()\nb = input()\nif (divide(a) == divide(b)):\n print('YES') \nelse:\n print('NO')\n\t\t \t\t \t\t \t \t\t\t \t \t\t\t\t", "def verifica(string):\r\n\r\n tamanho = len(string)\r\n\r\n if(tamanho % 2 == 1):\r\n return string\r\n\r\n aux1 = verifica(string[:tamanho // 2])\r\n aux2 = verifica(string[tamanho // 2:])\r\n\r\n if(aux1 < aux2):\r\n return aux1 + aux2\r\n\r\n return aux2 + aux1\r\n\r\n\r\nentradaA = input()\r\nentradaB = input()\r\n\r\nif(verifica(entradaA) == verifica(entradaB)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def reorganizeStr(string):\n if len(string) % 2 == 1: \n return string\n \n mid = len(string) // 2\n \n part1 = reorganizeStr(string[:mid])\n part2 = reorganizeStr(string[mid:])\n \n if part1 < part2:\n return part1 + part2\n \n return part2 + part1\n\ndef isEquivalent(a, b, tam):\n a = reorganizeStr(a)\n b = reorganizeStr(b)\n\n return a == b\n \ndef run():\n str1 = input()\n str2 = input()\n\n if (isEquivalent(str1, str2, len(str1))):\n print('YES')\n else:\n print('NO')\n\nrun()\n\t \t\t\t \t\t \t\t \t \t \t \t \t\t\t", "import sys\r\ninput=sys.stdin.readline\r\na=input().rstrip()\r\nb=input().rstrip()\r\ndef small_s(s):\r\n if len(s)%2==1:\r\n return s\r\n s1=small_s(s[:len(s)//2])\r\n s2=small_s(s[len(s)//2:])\r\n if s1<s2:\r\n return s1+s2\r\n else:\r\n return s2+s1\r\nif small_s(a)==small_s(b):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def g(s):l=len(s);return sorted([g(s[:l//2]),g(s[l//2:])])if l%2==0 else s\r\nprint('YES'if g(input())==g(input())else'NO')\r\n", "def reorder(string):\n half = int(len(string)/2)\n if len(string) % 2 == 1:\n return string\n first_half = reorder(string[:half])\n second_half = reorder(string[half:])\n if (first_half < second_half):\n return first_half + second_half\n else:\n return second_half + first_half\n\na = reorder(input())\nb = reorder(input())\n\nif a == b:\n print(\"YES\")\nelse:\n print(\"NO\")", "a = input(\"\")\nb = input(\"\")\n\n\ndef findEqual(a):\n\n\tif len(a) % 2:\n\t\treturn a\n\n\ta1 = findEqual(a[:len(a)//2])\n\ta2 = findEqual(a[len(a)//2:])\n\n\tif a1 < a2:\n\t\treturn a1+a2\n\telse:\n\t\treturn a2+a1\n\n\nif findEqual(a) == findEqual(b):\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n", "a = input()\r\nb = input()\r\n\r\n\r\ndef split(s):\r\n length = len(s)\r\n if (length % 2 == 0):\r\n s1 = split((s[:int(length / 2)]))\r\n s2 = split(s[int(length / 2):])\r\n if (s1 < s2):\r\n return s1 + s2\r\n else:\r\n return s2 + s1\r\n else:\r\n return s\r\n\r\n\r\nif (split(a) == split(b)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def solucao(string):\r\n def myslice(_string, index, size):\r\n return _string[index:index+size]\r\n \r\n string_size = len(string)\r\n if (string_size % 2):\r\n return string\r\n\r\n string_left = solucao(string[0:string_size//2])\r\n string_right = solucao(myslice(string, string_size//2, string_size//2))\r\n string[string_size//2:string_size//2]\r\n return (string_left + string_right) if string_left < string_right else (string_right + string_left)\r\n\r\nstring1 = input() \r\nstring2 = input()\r\nprint(\"YES\" if solucao(string1) == solucao(string2) else \"NO\") ", "a,b = list(input()),list(input())\r\nn = len(a)\r\n\r\nchunk_size, count = n, 0\r\nwhile not chunk_size & 1: chunk_size >>= 1; count += 1\r\n\r\nfor _ in range(count):\r\n new_chunk_size = chunk_size << 1\r\n for i in range(0, n, new_chunk_size):\r\n start = i\r\n mid = start + chunk_size\r\n end = min(i + new_chunk_size, n)\r\n\r\n a_part1,a_part2 = a[start:mid], a[mid:end]\r\n b_part1,b_part2 = b[start:mid], b[mid:end]\r\n\r\n if a_part1 > a_part2: a[start:mid],a[mid:end] = a_part2, a_part1\r\n\r\n if b_part1 > b_part2: b[start:mid],b[mid:end] = b_part2, b_part1\r\n\r\n chunk_size = new_chunk_size\r\n\r\nprint('YES' if a == b else 'NO')", "def equiStrings(a, b):\r\n if len(a) % 2 != 0:\r\n return a == b\r\n if a == b:\r\n return True\r\n \r\n mid = int(len(a)/2)\r\n a1 = a[:mid]\r\n a2 = a[mid:]\r\n b1 = b[:mid]\r\n b2 = b[mid:]\r\n \r\n if (equiStrings(a1, b2) and equiStrings(a2, b1)):\r\n return True\r\n if (equiStrings(a1, b1) and equiStrings(a2, b2)):\r\n return True\r\n \r\n return False\r\n \r\n \r\na = input()\r\nb = input()\r\n \r\nif equiStrings(a, b):\r\n print('YES')\r\n \r\nelse:\r\n print('NO')", "# -*- coding: utf-8 -*-\r\n\r\ndef lex_sort(a: str) -> str:\r\n if len(a) % 2:\r\n return a\r\n\r\n half = len(a) // 2\r\n left = lex_sort(a[:half])\r\n right = lex_sort(a[half:])\r\n\r\n if left < right:\r\n return left + right\r\n return right + left\r\n\r\n\r\na = input()\r\nb = input()\r\nif lex_sort(a) == lex_sort(b):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s1=input()\r\ns2=input()\r\ndef check(s1,s2):\r\n if s1==s2:\r\n return 1\r\n if len(s1)==1 or (len(s1)%2!=0 and s1!=s2):\r\n return 0\r\n return (check(s1[len(s1)//2:],s2[0:len(s2)//2]) and check(s1[:len(s1)//2],s2[len(s2)//2:])) or (check(s1[len(s1)//2:],s2[len(s2)//2:]) and check(s1[:len(s1)//2],s2[:len(s2)//2]))\r\nif check(s1,s2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "print((lambda a,b:\"YES\"if((lambda f:lambda x:f(f,x))(lambda f,x:x if len(x)%2==1 else (lambda a,b:a+b if a<b else b+a)(f(f,x[:len(x)>>1]),f(f,x[len(x)>>1:])))(a)==(lambda f:lambda x:f(f,x))(lambda f,x:x if len(x)%2==1 else (lambda a,b:a+b if a<b else b+a)(f(f,x[:len(x)>>1]),f(f,x[len(x)>>1:])))(b))else\"NO\")(input(),input()))\r\n", "def divide_letras(palavra):\r\n tamanhoPalavra = len(palavra)\r\n\r\n if (tamanhoPalavra % 2 == 1):\r\n return palavra\r\n\r\n tamanhoPalavra = tamanhoPalavra // 2 \r\n esquerda = divide_letras(palavra[:tamanhoPalavra])\r\n direita = divide_letras(palavra[tamanhoPalavra:])\r\n \r\n if (direita > esquerda):\r\n return (direita + esquerda) \r\n else: \r\n return (esquerda + direita)\r\n \r\n\r\n\r\ndef stringsEquivalentes(palavraA, palavraB):\r\n if(divide_letras(palavraA) == divide_letras(palavraB)): \r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\npalavraA = input()\r\npalavraB = input()\r\n\r\nstringsEquivalentes(palavraA, palavraB)", "import math\r\ndef menor(palavra):\r\n if(len(palavra)%2 == 1):\r\n return palavra\r\n a = menor(palavra[0:math.ceil(len(palavra)/2)])\r\n b = menor(palavra[math.ceil(len(palavra)/2):len(palavra)])\r\n if(a < b):\r\n return a+b\r\n else:\r\n return b + a\r\n\r\npalavra1 = input()\r\npalavra2 = input()\r\nif(menor(palavra1) == menor(palavra2)):\r\n print('YES')\r\nelse:\r\n print('NO')", "def divideString(s):\r\n if (len(s) & 1 != 0):\r\n return s\r\n\r\n x = divideString(s[0:int(len(s) / 2)])\r\n y = divideString(s[int(len(s) / 2):len(s)])\r\n\r\n \r\n\r\n return min(x + y, y + x)\r\n\r\n \r\n\r\ndef compare(a,b):\r\n return (divideString(a) == divideString(b))\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n a = input()\r\n b = input()\r\n\r\n if (compare(a, b)):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "def check(str):\n if len(str) % 2 != 0:\n return str\n return sorted([check(str[:len(str) // 2]), check(str[len(str) // 2:])])\n\n\na = input()\nb = input()\nif check(a) == check(b):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "def f(s):\r\n if len(s) % 2:\r\n return s\r\n s1 = f(s[:len(s) // 2])\r\n s2 = f(s[len(s) // 2:])\r\n if s1 < s2:\r\n return s1 + s2\r\n else:\r\n return s2 + s1\r\n\r\n\r\na = input()\r\nb = input()\r\nif f(a) == f(b):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "str1 = input()\r\nstr2 = input()\r\n\r\ndef compare(s):\r\n if (len(s) % 2 == 1):\r\n return s\r\n \r\n half = int(len(s) / 2)\r\n s1 = compare(s[0:half])\r\n s2 = compare(s[half:len(s)])\r\n\r\n if (s1 < s2):\r\n return s1 + s2\r\n else:\r\n return s2 + s1\r\n\r\nif (compare(str1) == compare(str2)):\r\n print('YES')\r\nelse:\r\n print('NO')", "def sort_string(x):\n size = len(x)\n if size % 2 != 0:\n return x\n mid = size // 2\n x1 = sort_string(x[:mid])\n x2 = sort_string(x[mid:])\n if x1 > x2: return x2 + x1\n return x1 + x2\n\nx = input()\ny = input()\n\nis_equivalent = sort_string(x) == sort_string(y)\n\nif is_equivalent: print(\"YES\")\nelse: print(\"NO\")", "def equivalent(string):\r\n n = len(string)\r\n if n % 2:\r\n return string\r\n n = int(n / 2)\r\n s1, s2 = equivalent(string[:-n]), equivalent(string[n:])\r\n if s1 > s2:\r\n return s1 + s2\r\n else:\r\n return s2 + s1\r\n \r\n \r\na, b = input(), input()\r\nif (equivalent(a) == equivalent(b)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def equivalent(s):\r\n l = len(s)\r\n return sorted([equivalent(s[:l // 2]), equivalent(s[l // 2:])]) if l % 2 == 0 else s\r\nprint('YES' if equivalent(input()) == equivalent(input()) else 'NO')\r\n", "a = input()\r\nb = input()\r\n\r\ndef solve(string):\r\n if len(string) % 2 != 0:\r\n return string\r\n mid = len(string)//2\r\n l_string = solve(string[:mid])\r\n r_string = solve(string[mid:])\r\n if l_string + r_string > r_string + l_string:\r\n return l_string + r_string\r\n else:\r\n return r_string + l_string\r\n\r\nif solve(a) == solve(b): print('YES')\r\nelse: print('NO')", "from math import inf\r\nfrom collections import *\r\nimport math, os, sys, heapq, bisect, random\r\nfrom functools import lru_cache\r\nfrom itertools import *\r\ndef inp(): return sys.stdin.readline().rstrip(\"\\r\\n\")\r\ndef out(var): sys.stdout.write(str(var)) # for fast output, always take string\r\ndef inpu(): return int(inp())\r\ndef lis(): return list(map(int, inp().split()))\r\ndef stringlis(): return list(map(str, inp().split()))\r\ndef sep(): return map(int, inp().split())\r\ndef strsep(): return map(str, inp().split())\r\ndef fsep(): return map(float, inp().split())\r\nM,M1=1000000007,998244353\r\n\r\ndef main():\r\n how_much_noob_I_am=1\r\n #how_much_noob_I_am=inpu()\r\n for _ in range(how_much_noob_I_am):\r\n a=inp()\r\n b=inp()\r\n def fun(s):\r\n if len(s)%2==1:\r\n return s\r\n mid=len(s)//2\r\n s1=fun(s[:mid])\r\n s2=fun(s[mid:])\r\n if s1<s2:\r\n return s1+s2\r\n return s2+s1\r\n if fun(a)==fun(b):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nif __name__ == '__main__':\r\n main()", "def func(s):\r\n\r\n ls = len(s)\r\n if ls % 2: return s\r\n\r\n a = func(s[:ls//2])\r\n b = func(s[ls//2:])\r\n\r\n return a + b if a < b else b + a\r\n\r\n\r\na = input()\r\nb = input()\r\nprint('YES' if func(a) == func(b) else 'NO')", "s1 = input()\r\ns2 = input()\r\n\r\ndef equiv(string1, string2):\r\n taman = len(string1)\r\n\r\n if string1 == string2:\r\n return True\r\n\r\n elif taman % 2 == 0:\r\n taman = int(taman/2)\r\n\r\n if equiv(string1[:taman], string2[taman:]) and equiv(string1[taman:], string2[:taman]):\r\n return True\r\n\r\n else:\r\n return equiv(string1[:taman], string2[:taman]) and equiv(string1[taman:], string2[taman:])\r\n\r\n else:\r\n return False\r\n\r\nif equiv(s1, s2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "#João Vitor Patricio Romão - 118211058\r\n\r\ndef isEqual(a, b):\r\n\tfor i in range(0, len(a)):\r\n\t\tif (a[i] != b[i]):\r\n\t\t\treturn False\r\n\treturn True\r\n \r\n \r\ndef lexicographic_minimal_string(s):\r\n\tif (len(s) % 2 == 1):\r\n\t\treturn s\r\n\thalf = int(len(s) /2)\r\n\ts1 = lexicographic_minimal_string(s[:half])\r\n\ts2 = lexicographic_minimal_string(s[half:])\r\n\tif s1 < s2:\r\n\t\treturn s1 + s2\r\n\treturn s2 + s1\r\n \r\na = input()\r\nb = input()\r\na = lexicographic_minimal_string(a)\r\nb = lexicographic_minimal_string(b)\r\nif(isEqual(a,b)):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "def sm(s):\r\n if len(s) % 2 == 1:\r\n return s\r\n s1 = sm(s[:len(s) // 2])\r\n s2 = sm(s[len(s) // 2:])\r\n if s1 < s2:\r\n return s1 + s2\r\n else:\r\n return s2 + s1\r\n \r\nif sm(input()) == sm(input()):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def dividir(cadena):\r\n if(len(cadena) % 2 == 1):\r\n return cadena\r\n a1 = dividir(cadena[ :len(cadena)//2])\r\n a2 = dividir(cadena[len(cadena)//2: ])\r\n \r\n if(a1 > a2):\r\n return a2 + a1\r\n else:\r\n return a1 + a2;\r\n\r\ndef main():\r\n \r\n a = input()\r\n b = input()\r\n \r\n respuesta = \"NO\"\r\n \r\n if(a == b):\r\n respuesta = \"YES\"\r\n elif(dividir(a) == dividir(b)):\r\n respuesta = \"YES\"\r\n \r\n print(respuesta)\r\n \r\nif __name__ == \"__main__\":\r\n main()", "inp_s1 = str(input())\ninp_s2 = str(input())\n\ndef solver(x):\n if len(x) % 2 == 1:\n return x\n else:\n return sorted([solver(x[:len(x)//2]), solver(x[len(x)//2:])])\n\nif solver(inp_s1) == solver(inp_s2):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "def equiv(a,b):\n if((a,b) in memo.keys()):\n return memo[(a,b)]\n if(len(a) % 2 == 1):\n return a == b\n mid = len(a)//2\n a1, a2 = a[:mid], a[mid:]\n b1, b2 = b[:mid], b[mid:]\n memo[(a,b)] = (equiv(a1,b1) and equiv(a2,b2)) or (equiv(a1,b2) and equiv(a2,b1))\n return memo[(a,b)]\n\na = input()\nb = input()\nmemo={}\nif(equiv(a,b)):\n print('YES')\nelse:\n print('NO')\n \t\t\t\t \t\t \t\t\t\t \t\t\t \t \t \t", "def smallest(s):\r\n if len(s) % 2 == 1:\r\n return s\r\n s1 = smallest(s[:len(s)//2])\r\n s2 = smallest(s[len(s)//2:])\r\n if s1 < s2:\r\n return s1 + s2\r\n else:\r\n return s2 + s1\r\n\r\na = input()\r\nb = input()\r\nif smallest(a) == smallest(b):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "def merge(s):\r\n if len(s)%2 == 1:\r\n return s\r\n else:\r\n left = merge(s[:len(s)//2])\r\n right = merge(s[len(s)//2:])\r\n if left < right:\r\n return left + right\r\n else:\r\n return right+left\r\n \r\na = input()\r\nb = input()\r\na = merge(a)\r\nb = merge(b)\r\nc = (a==b)\r\nif c:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def permut(str):\n if len(str) % 2 != 0:\n return str\n n = len(str)\n s1 = permut(str[:n//2])\n s2 = permut(str[n//2:])\n if s1 + s2 > s2 + s1:\n return s1 + s2\n else:\n return s2 + s1\ns = input()\nt = input()\nif permut(s) == permut(t):\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 igual(cadena1, cadena2, l):\r\n \r\n if cadena1 == cadena2:\r\n return True\r\n \r\n hl = int(l/2)\r\n if l % 2 == 1: #Verificar longitud de la cadena\r\n return cadena1 == cadena2#Si es una cadena de una letra regresa la comparacion\r\n else:\r\n #Se parten las cadenas a la mitad para poder analizarlas\r\n a1 = cadena1[0:hl]\r\n b1 = cadena2[0:hl]\r\n a2 = cadena1[hl:l]\r\n b2 = cadena2[hl:l]\r\n #Se llama de nuevo a la funcion para que realice la comparacion con las divisiones (Comparacion curzada)\r\n if (igual(a1, b2, hl) and igual(a2, b1, hl)):\r\n return True\r\n else:\r\n #Se hace la comparacion de partes\r\n return (igual(a1, b1, hl) and igual(a2, b2, hl))\r\n \r\n#Inputs\r\ncadena1 = input()\r\ncadena2 = input()\r\n \r\n#If para imprimir\r\nif igual(cadena1, cadena2, len(cadena1)):\r\n print('YES')\r\nelse:\r\n print('NO')", "\r\n\r\nmemo = {}\r\ndef equivalent(a, b):\r\n if (a, b) in memo: return memo[a,b]\r\n if len(a) == 1: return a == b\r\n if len(a) % 2 == 1: return a == b\r\n\r\n a1, a2 = a[:len(a)//2], a[len(a)//2:]\r\n b1, b2 = b[:len(a)//2], b[len(a)//2:]\r\n\r\n if (a1 == b1 and a2 == b2) or (a1 == b2 and a2 == b1):\r\n memo[a, b] = True\r\n return True\r\n\r\n\r\n memo[a, b] = (equivalent(a1, b1) and equivalent(a2, b2)) or (equivalent(a1, b2) and equivalent(a2, b1))\r\n return memo[a, b]\r\n\r\n\r\na = input()\r\nb = input()\r\n\r\nif equivalent(a, b): print(\"YES\")\r\nelse: print(\"NO\")", "def equiv(s):\n\tif(len(s)%2):\n\t\treturn s\n\telse:\n\t\tm1 = equiv(s[:len(s)//2]) \n\t\tm2 = equiv(s[len(s)//2:])\n\treturn m1 + m2 if m1 < m2 else m2 + m1\n\t\na = input()\nb = input()\nif(equiv(a) == equiv(b)):\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "import math\r\nimport random\r\nfrom collections import Counter, deque\r\nfrom sys import stdout\r\nimport time\r\nfrom math import factorial, log, gcd\r\nimport sys\r\nfrom decimal import Decimal\r\nimport heapq\r\nfrom copy import deepcopy\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 a = IS()\r\n b = IS()\r\n\r\n def smallest(s):\r\n if len(s) % 2 == 1:\r\n return s\r\n s1 = smallest(s[:len(s) // 2])\r\n s2 = smallest(s[len(s) // 2:])\r\n\r\n if s1 < s2:\r\n return s1 + s2\r\n return s2 + s1\r\n\r\n ass = smallest(a)\r\n bss = smallest(b)\r\n if ass == bss:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n # for _ in range(II()):\r\n # main()\r\n main()", "def compare(s):\r\n if len(s)%2: \r\n return s\r\n \r\n s1 = compare(s[:len(s)//2])\r\n s2 = compare(s[len(s)//2:])\r\n \r\n if s1 < s2:\r\n return(s2 + s1)\r\n else:\r\n return(s1 + s2)\r\n \r\na = input()\r\nb = input()\r\n\r\nif compare(a) == compare(b):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def equalString(A, B, size):\r\n if A == B:\r\n return True\r\n if size%2 == 1:\r\n return False\r\n A1 = A[:size//2]\r\n A2 = A[size//2:]\r\n B1 = B[:size//2]\r\n B2 = B[size//2:]\r\n if equalString(A1, B2, size//2) == True:\r\n return equalString(A2, B1, size//2)\r\n if equalString(A1, B1, size//2) == True:\r\n return equalString(A2, B2, size//2)\r\n else:\r\n return False\r\na = input()\r\nb = input()\r\ny = equalString(a,b, len(a))\r\nif y == True:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "M = 1000000007\r\ndef gethash(s):\r\n n = len(s)\r\n if n%2==1:\r\n return hash(s)%M\r\n m = n//2\r\n h0 = gethash(s[:m])\r\n h1 = gethash(s[m:])\r\n return ((h0+h1)**2)%M\r\n \r\n \r\ndef main():\r\n s1 = input()\r\n s2 = input()\r\n if gethash(s1)==gethash(s2):\r\n print('YES')\r\n else:\r\n print('No')\r\n \r\nif __name__=='__main__':\r\n main()", "def check(t1,t2):\n l=len(t1);\n if(t1==t2): return True;\n if(l%2==0 and (((check(t1[:l//2],t2[l//2:]) and check(t2[:l//2],t1[l//2:]))) or ((check(t1[:l//2],t2[:l//2]) and check(t2[l//2:],t1[l//2:]))))):\n return True; \n return False;\na=str(input());\nb=str(input());\nif(check(a,b)): print(\"YES\");\nelse: print(\"NO\");\n\t\t\t\t\t\t \t\t\t\t\t \t\t\t \t\t \t\t\t\t", "def solve(s):\r\n if len(s) % 2: return s\r\n a = solve(s[:len(s) // 2])\r\n b = solve(s[len(s) // 2:])\r\n return a + b if a < b else b + a\r\nprint('YES' if solve(input()) == solve(input()) else 'NO')", "def check(s):\n if len(s) % 2 == 1: return s\n \n m = int(len(s)/2)\t\n l = check(s[:m])\n r = check(s[m:])\n if (l < r):\n return (l + r)\n else:\n return (r + l) \n \na = input()\nb = input()\n \nif (check(a) == check(b)):\n print(\"YES\")\nelse:\n print(\"NO\")", "a = input()\nb = input()\n\ndef smallest(s):\n if len(s)%2 == 1:\n return s\n s1 = smallest(s[0:len(s) // 2])\n s2 = smallest(s[len(s)//2:len(s)])\n if s1 < s2:\n return s1+s2\n else:\n return s2 + s1\n\nif smallest(a) == smallest(b):\n print('YES')\nelse:\n print('NO')\n", "# Equivalent Strings\n\n# Today on a lecture about strings Gerald learned a new definition of string equivalency. \n# Two strings a and b of equal length are called equivalent in one of the two cases:\n# 1. They are equal.\n# 2. If we split string a into two halves of the same size a1 and a2, and string b into two halves of the same size b1 and b2, then one of the following is correct:\n# 2.1. a1 is equivalent to b1, and a2 is equivalent to b2\n# 2.2. a1 is equivalent to b2, and a2 is equivalent to b1\n# As a home task, the teacher gave two strings to his students and asked to determine if they are equivalent.\n\ndef mergeSort(string):\n if(len(string) % 2 == 1):\n return string\n else:\n middle = round(len(string) / 2)\n stringA = mergeSort(string[0: middle])\n stringB = mergeSort(string[middle:])\n if(stringA < stringB):\n return (stringA + stringB)\n else:\n return (stringB + stringA)\n\nstringA = input()\nstringB = input()\n\nif(mergeSort(stringA) == mergeSort(stringB)):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "def d(a):\r\n if len(a) % 2 == 0: \r\n mid = int(len(a)/2) \r\n a1 = d(a[:mid])\r\n a2 = d(a[mid:])\r\n return min(a1,a2) + max(a1,a2)\r\n else:\r\n return a\r\n\r\na = str(input())\r\nb = str(input())\r\n \r\ncek = 0 #initialization for checking\r\n \r\nif a == b:\r\n cek = 1\r\nelif d(a) == d(b): #comparing words after sorting\r\n cek = 1\r\n \r\nif cek:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from heapq import merge\r\ndef f(s):\r\n l = len(s)\r\n return [list(merge(f(s[:l>>1]),f(s[l>>1:])))] if l & 1 == 0 else [s] \r\nprint('YES' if f(input()) == f(input()) else 'NO')", "def div(s):\r\n lenght = len(s)\r\n if (lenght % 2 == 1):\r\n return s\r\n \r\n s1 = div(s[0:int(lenght/2)])\r\n s2 = div(s[int(lenght/2):lenght])\r\n if s1 < s2:\r\n return s1 + s2 \r\n else:\r\n return s2 + s1\r\n \r\n \r\ns1 = input()\r\ns2 = input()\r\n \r\nprint('YES') if div(s1) == div(s2) else print('NO')", "def equivalent(a,b):\r\n if len(a)%2 != 0:\r\n return a == b\r\n \r\n if (a == b):\r\n return True\r\n \r\n l = len(a)//2\r\n a1 = a[:l]\r\n a2 = a[l:]\r\n b1 = b[:l]\r\n b2 = b[l:]\r\n\r\n if (equivalent(a1,b2) and equivalent(a2,b1)):\r\n return True\r\n\r\n if (equivalent(a1,b1) and equivalent(a2,b2)):\r\n return True\r\n \r\n return False\r\n \r\na = input()\r\nb = input()\r\n \r\nif equivalent(a,b):\r\n print('YES')\r\nelse:\r\n print('NO')", "import itertools\r\nimport sys\r\n\r\ndef binSearch(str):\r\n if len(str) % 2 != 0:\r\n return str\r\n nr = len(str) // 2\r\n left = binSearch(str[:nr])\r\n right = binSearch(str[nr:])\r\n if left < right:\r\n return left + right\r\n else:\r\n return right + left\r\nif __name__ == '__main__':\r\n s1 = input()\r\n s2 = input()\r\n if binSearch(s1) == binSearch(s2):\r\n print('YES')\r\n else:\r\n print('NO')", "def equivalent(a, b):\r\n if a == b:\r\n return True\r\n if len(a) % 2:\r\n return False\r\n n = len(a)\r\n a1 = a[:n // 2]\r\n a2 = a[n // 2:]\r\n b1 = b[:n // 2]\r\n b2 = b[n // 2:]\r\n return (equivalent(a1, b2) and equivalent(a2, b1)) or (equivalent(a1, b1) and equivalent(a2, b2))\r\n\r\na = input()\r\nb = input()\r\n\r\nprint(\"YES\" if equivalent(a, b) else \"NO\")\r\n", "def fun(s):\r\n\tif len(s) % 2:\r\n\t\treturn s\r\n\ta = fun(s[:len(s)//2])\r\n\tb = fun(s[len(s)//2:])\r\n\treturn a+b if a < b else b + a\r\n\r\nif fun(input()) == fun(input()):\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "def equiv(s):\r\n if len(s) % 2 == 1:\r\n return s\r\n n = len(s) // 2\r\n a = equiv(s[:n])\r\n b = equiv(s[n:])\r\n\r\n return a + b if a < b else b + a\r\n\r\n\r\na = input()\r\nb = input()\r\nprint(\"YES\" if equiv(a) == equiv(b) else \"NO\")\r\n", "def compareStr(string):\n\tlenStr = len(string)\n\thalf = lenStr // 2\n\tif lenStr % 2 == 0:\n\t\ta = compareStr(string[:half])\n\t\tb = compareStr(string[half:])\n\t\treturn min(f'{a}{b}', f'{b}{a}')\n\telse:\n\t\treturn string\n\n\n\nstr1 = input()\nstr2 = input()\n\nif compareStr(str1) == compareStr(str2):\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n\t\t\t \t\t\t\t\t\t\t\t\t \t\t \t", "first = input()\nsecond = input()\n\n\ndef equals(first, second):\n if first == second:\n return True\n elif len(first) == 1:\n return False\n elif len(first) % 2 == 1:\n return False\n d = len(first) // 2\n\n return ((equals(first[:d], second[d:]) and equals(first[d:], second[:d]))\n or\n (equals(first[:d], second[:d]) and equals(first[d:], second[d:])))\n\n\nprint('YES' if equals(first, second) else 'NO')\n\n \t\t\t \t\t\t\t \t \t \t \t\t \t \t\t\t\t", "def isEqual(a_total, b_total):\r\n if(a_total == b_total):\r\n return True\r\n if(len(a_total) != len(b_total)):\r\n return False\r\n if(len(a_total) % 2 == 1):\r\n return False\r\n half = len(a_total)//2\r\n \r\n a_part1 = a_total[:half]\r\n \r\n b_part1 = b_total[:half]\r\n a_part2 = a_total[half:]\r\n b_part2 = b_total[half:]\r\n \r\n return (isEqual(a_part1, b_part2) and isEqual(a_part2, b_part1)) or (isEqual(a_part1, b_part1) and isEqual(a_part2, b_part2))\r\n \r\n \r\na_total = input()\r\nb_total = input()\r\n \r\nif (isEqual(a_total, b_total)):\r\n print('YES') \r\nelse:\r\n print('NO')", "import sys\nsys.setrecursionlimit(10*6)\ndef l(s):return s[0:len(s)//2]\ndef r(s):return s[len(s)//2:]\n\ndp = {}\ndef solve(a,b):\n m = (a,b)\n if m in dp:\n return dp[m]\n if a == b:\n dp[(a,b)] = True\n dp[(b,a)] = True\n return True\n if len(a) == 1 or len(a)%2 == 1:\n dp[(a,b)] = False\n dp[(b,a)] = False\n return False\n\n la = l(a)\n ra = r(a)\n lb = l(b)\n rb = r(b)\n if solve(la,lb):\n res = solve(ra,rb)\n dp[(a,b)] = res\n dp[(b,a)] = res\n return res\n elif solve(la,rb):\n res = solve(ra,lb)\n dp[(a,b)] = res\n dp[(b,a)] = res\n return res\n\nm = input()\nn = input()\nif solve(m,n):\n print(\"YES\")\nelse:print(\"NO\")", "string1 = input()\nstring2 = input()\n\n\ndef equals(string1, string2):\n if string1 == string2:\n return True\n elif len(string1) == 1:\n return False\n elif len(string1) % 2 == 1:\n return False\n d = len(string1) // 2\n\n return ((equals(string1[:d], string2[d:]) and equals(string1[d:], string2[:d]))\n or\n (equals(string1[:d], string2[:d]) and equals(string1[d:], string2[d:])))\n\n\nprint('YES' if equals(string1, string2) else 'NO')\n ", "a = input();\r\nb = input();\r\n\r\n\r\ndef solve(a, b):\r\n if(recursiveSolve(a,b)):\r\n return \"YES\"\r\n return \"NO\"\r\ndef recursiveSolve(a,b):\r\n if (a == b):\r\n return True\r\n if(len(a) % 2):\r\n return False;\r\n\r\n meio = int((len(a) / 2));\r\n fim = len(a);\r\n a1 = (a[0:meio]);\r\n a2 = (a[meio:fim]);\r\n b1 = (b[0:meio]);\r\n b2 = (b[meio:fim]);\r\n\r\n return ((recursiveSolve(a1,b2) and recursiveSolve(a2,b1)) or (recursiveSolve(a1,b1) and recursiveSolve(a2,b2)))\r\n\r\n\r\nprint(solve(a, b));\r\n", "s=input()\r\nt=input()\r\ndef smallest(st):\r\n if len(st)%2:\r\n return st\r\n s1=smallest(st[:len(st)//2])\r\n s2=smallest(st[len(st)//2:])\r\n if s1<s2:\r\n return s1+s2\r\n else:\r\n return s2+s1\r\nif smallest(s)==smallest(t):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def isEq(a,b,la,lb):\r\n if (la + lb ==2) or la%2 == 1 or lb%2 == 1:\r\n if a == b:\r\n return True\r\n else:\r\n return False\r\n else:\r\n a1 = a[:la//2]\r\n a2 = a[la//2:]\r\n b1 = b[:lb//2]\r\n b2 = b[lb//2:]\r\n res1 = isEq(a1,b1,la//2,lb//2)\r\n res2 = isEq(a2,b2,la-la//2,lb-lb//2)\r\n\r\n if (res1 and res2):\r\n return True\r\n else:\r\n return False\r\n\r\ndef merge(s):\r\n if len(s)%2 == 1:\r\n return s\r\n else:\r\n left = merge(s[:len(s)//2])\r\n right = merge(s[len(s)//2:])\r\n if left < right:\r\n return left + right\r\n else:\r\n return right+left\r\n\r\na = input()\r\nb = input()\r\na = merge(a)\r\nb = merge(b)\r\nc = isEq(a,b,len(a),len(b))\r\nif c:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def solve(s):\r\n sz = len(s)\r\n if(sz % 2 == 1):\r\n return s\r\n \r\n a = solve(s[:int(sz / 2)])\r\n b = solve(s[int(sz / 2):])\r\n\r\n if a < b:\r\n return a + b\r\n else:\r\n return b + a\r\n\r\ndef main():\r\n a = input()\r\n b = input()\r\n\r\n resa = solve(a)\r\n resb = solve(b)\r\n if resa == resb:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nmain()", "def equa(s):\r\n if len(s)%2!=0:\r\n return s\r\n else:\r\n s1=equa(s[:len(s)//2])\r\n s2=equa(s[len(s)//2:])\r\n if s1>s2:\r\n return s2+s1\r\n else:\r\n return s1+s2\r\na=input()\r\nb=input()\r\n# print(equa(a))\r\n# print(equa(b))\r\nif (equa(a) == equa(b)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def smallest(s):\n\n if len(s) % 2 == 1:\n return s\n \n s1 = smallest(s[0:(len(s)//2)])\n s2 = smallest(s[(len(s)//2):len(s)])\n\n return s1 + s2 if s1 < s2 else s2 + s1\n\na = input()\nb = input()\n\nprint(\"YES\") if smallest(a) == smallest(b) else print(\"NO\")" ]

[ "import itertools\n\nn, m = map(int, input().rstrip().split())\nmas = []\nstart = [0, 0]\nend = [0, 0]\nfor i in range(n):\n s = input()\n for j in range(len(s)):\n if s[j] == 'S':\n start = [i, j]\n elif s[j] == 'E':\n end = [i, j]\n mas.append(s)\nk = input()\n\ncou = 0\nfor i1, i2, i3, i4 in itertools.permutations(([0, 1], [1, 0], [-1, 0], [0, -1])):\n x, y = start\n for i in k:\n if i == '0':\n x += i1[0]\n y += i1[1]\n elif i == '1':\n x += i2[0]\n y += i2[1]\n elif i == '2':\n x += i3[0]\n y += i3[1]\n elif i == '3':\n x += i4[0]\n y += i4[1]\n if x >= n or x < 0 or y >= m or y < 0 or mas[x][y] == '#':\n break\n elif [x, y] == end:\n cou += 1\n break\n\nprint(cou)", "from itertools import permutations\r\nn,m=map(int,input().split())\r\nlab=\"#\"*(m+2)\r\nfor n in range(n):\r\n lab+=\"#\"+input()+\"#\"\r\nlab+=\"#\"*(m+2)\r\ns=input()\r\ncmd=[ord(x)-48 for x in s]\r\n\r\npers=permutations([1,-1,m+2,-m-2])\r\n\r\nans=0\r\nfor per in pers:\r\n where=lab.find(\"S\")\r\n for c in cmd:\r\n where+=per[c]\r\n if lab[where]==\"E\":\r\n ans+=1\r\n break\r\n if lab[where]==\"#\":\r\n break\r\nprint(ans)\r\n \r\n", "from itertools import permutations\r\nd = [[0, 1], [0, -1], [1, 0], [-1, 0]]\r\nn, m = map(int, input().split())\r\nmatrix = []\r\nfor i in range(n):\r\n matrix.append(input())\r\nx0, y0, x1, y1 = 0, 0, 0, 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if matrix[i][j] == 'S':\r\n x0, y0 = i, j\r\n if matrix[i][j] == 'E':\r\n x1, y1 = i, j\r\ns = input()\r\nans = 0\r\nfor it in permutations(d):\r\n f = True\r\n x, y = x0, y0\r\n c = -1\r\n for i in s:\r\n c += 1\r\n k = it[int(i)]\r\n ax, by = k[0], k[1]\r\n if 0 <= ax + x < n and 0 <= by + y < m and matrix[ax + x][by + y] != '#':\r\n x += ax\r\n y += by\r\n if matrix[x][y] == 'E':\r\n break\r\n else:\r\n f = False\r\n break\r\n if f and matrix[x][y] == 'E':\r\n ans += 1\r\nprint(ans)", "import itertools\n\nd = [(-1, 0), (1, 0), (0, -1), (0, 1)]\nn, m = map(int, input().split())\ns = [input() for i in range(n)]\na = input()\nfor i in range(n):\n for j in range(m):\n if s[i][j] == 'S':\n sx = i\n sy = j\n\n\ndef inside(x, y):\n return x >= 0 and x < n and y >= 0 and y < m\n\n\ndef check(p):\n x = sx\n y = sy\n for i in a:\n id = p[int(i)]\n x += d[id][0]\n y += d[id][1]\n if not inside(x, y) or s[x][y] == '#':\n return 0\n if s[x][y] == 'E':\n return 1\n return 0\n\n\nprint(sum(check(i) for i in itertools.permutations([0, 1, 2, 3])))\n", "\r\ndef STR(): return list(input())\r\ndef INT(): return int(input())\r\ndef MAP(): return map(int, input().split())\r\ndef LIST(): return list(map(int, input().split()))\r\ndef STRING(): return input()\r\n\r\nfrom heapq import heappop , heappush\r\nfrom bisect import *\r\nfrom collections import deque\r\nfrom math import *\r\nfrom itertools import permutations\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\r\ndef valid(i , j):\r\n if i >= 0 and i <= n - 1 and j >= 0 and j <= m - 1:\r\n return True\r\n return False\r\n\r\nn , m = MAP()\r\ng = []\r\nfor i in range(n):\r\n g.append(STRING())\r\n#print(g)\r\ns = STRING()\r\ns1 , s2 = 0 , 0\r\ne1 , e2 = 0 , 0\r\nf = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if g[i][j] == 'S':\r\n s1 = i\r\n s2 = j\r\n f = 1\r\n break\r\n if f == 1 :\r\n break\r\nstart = (s1,s2)\r\nf = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if g[i][j] == 'E':\r\n e1 = i\r\n e2 = j\r\n f = 1\r\n break\r\n if f == 1 :\r\n break\r\nend = (e1 , e2)\r\nmapping = ((0, -1), (0, 1), (-1, 0), (1, 0))\r\ncnt = 0\r\n\r\nfor i in permutations(mapping, 4):\r\n now = start\r\n for j in s:\r\n k = i[int(j)]\r\n x = now[0] + k[0]\r\n y = now[1] + k[1]\r\n if valid(x , y) == False:\r\n break\r\n now = (x , y)\r\n if now == end:\r\n cnt += 1\r\n break\r\n elif g[x][y] == '#':\r\n break\r\n\r\nprint(cnt)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "from collections import namedtuple\r\nimport itertools\r\nn, m = map(int, input().split())\r\nPoint = namedtuple('Point', 'i j')\r\nstart = None\r\nend = None\r\n\r\n\r\nisObs = [[False for x in range(m)] for y in range(n)]\r\nfor i in range(n):\r\n line = input()\r\n for j in range(m):\r\n if line[j] == '#':\r\n isObs[i][j] = True\r\n if line[j] == \"S\":\r\n start = Point(i, j)\r\n if line[j] == \"E\":\r\n end = Point(i, j)\r\n\r\ninstructions = input()\r\nnums = ['0','1','2','3']\r\ndirs = itertools.permutations(['u','l', 'r', 'd'])\r\nways = 0\r\nfor perm in dirs:\r\n dirDict = dict(zip(nums, perm))\r\n i, j = start[0], start[1]\r\n for ins in instructions:\r\n mov = dirDict[ins]\r\n if mov == 'u':\r\n i -= 1\r\n if mov == 'd':\r\n i += 1\r\n if mov == 'l':\r\n j -= 1\r\n if mov == 'r':\r\n j += 1\r\n if i < 0 or j < 0 or i >= n or j >= m or isObs[i][j]:\r\n break\r\n if i == end[0] and j == end[1]:\r\n ways += 1\r\n break\r\nprint(ways)", "from itertools import permutations\r\ndirs = ((1,0),(-1,0),(0,1),(0,-1))\r\nper = permutations(dirs)\r\nr,c = map(int,input().split())\r\n\r\ngrid = [input() for _ in range(r)]\r\npath = input()\r\n\r\n\r\npos_start = [i for i,x in enumerate(grid) if 'S' in x][0]\r\nstart = (pos_start,grid[pos_start].index('S'))\r\npos_end = [i for i,x in enumerate(grid) if 'E' in x][0]\r\nend = (pos_end,grid[pos_end].index('E'))\r\n\r\ntotal = 0\r\nfor p in per:\r\n x,y = start\r\n for move in path:\r\n dir_x,dir_y = p[int(move)]\r\n x += dir_x\r\n y += dir_y\r\n \r\n if x<0 or y<0 or x>=r or y>=c or grid[x][y] == '#':break\r\n if grid[x][y] == 'E':\r\n total +=1\r\n break\r\n \r\n\r\nprint (total)", "def check(perm) :\n\tglobal sx, sy, dx, dy, m, n, instr\n\t\n\tx = sx\n\ty = sy\n\t\n\tfor d in instr :\n\t\tdir = perm[ord(d) - ord('0')]\n\t\tx = x + dx[dir]\n\t\ty = y + dy[dir]\n\t\t\n\t\t#if perm == [2, 3, 0, 1] :\n\t\t#\tprint(x, y)\n\t\t\n\t\tif x < 0 or x >= m or y < 0 or y >= n :\n\t\t\treturn 0\n\t\t\n\t\tif s[x][y] == '#' :\n\t\t\treturn 0\n\t\t\n\t\tif s[x][y] == 'E' :\n\t\t\t#print(perm)\n\t\t\treturn 1\n\t\n\treturn 0\n\nm, n = map(int, input().split())\n\nsx = sy = 0\nex = ey = 0\n\ns = []\nfor i in range(0, m) :\n\ts.append(input())\n\tfor j in range(0, len(s[i])) :\n\t\tif s[i][j] == 'S' :\n\t\t\tsx = i\n\t\t\tsy = j\n\t\telif s[i][j] == 'E' :\n\t\t\tex = i\n\t\t\tey = j\n\ninstr = input()\n\ndx = [-1, 0, 1, 0]\ndy = [0, 1, 0, -1]\n\nans = 0\nperm = [0] * 4\nfor i in range(0, 4) :\n\tfor j in range(0, 4) :\n\t\tfor k in range(0, 4) :\n\t\t\tfor l in range(0, 4) :\n\t\t\t\tif i != j and i != k and i != l and j != k and j != l and k != l :\n\t\t\t\t\tperm[0] = i\n\t\t\t\t\tperm[1] = j\n\t\t\t\t\tperm[2] = k\n\t\t\t\t\tperm[3] = l\n\t\t\t\t\t\n\t\t\t\t\tif check(perm) :\n\t\t\t\t\t\tans = ans + 1\n\nprint(ans)\n", "#!/usr/bin/env python3\n\nimport itertools\n\ninf = float('inf')\nread_ints = lambda : list(map(int, input().split()))\n\ndef findS(maze, n, m):\n for i in range(n):\n for j in range(m):\n if maze[i][j] == 'S':\n return i, j\n\ndef f(maze, n, m, si, sj, dirs, path):\n i, j = si, sj\n for p in path:\n i += dirs[p][0]\n j += dirs[p][1]\n if not (0 <= i < n and 0 <= j < m):\n return False\n if maze[i][j] == 'E':\n return True\n if maze[i][j] == '#':\n return False\n return False\n\nif __name__ == '__main__':\n n, m = read_ints()\n maze = [input() for _ in range(n)]\n path = [int(c) for c in input()]\n\n si, sj = findS(maze, n, m)\n\n dirs = [(0,0) for _ in range(4)]\n cnt = 0\n for ds in itertools.permutations(range(4)):\n for d, move in zip(ds, [(0, 1), (0, -1), (1, 0), (-1, 0)]):\n dirs[d] = move\n\n if f(maze, n, m, si, sj, dirs, path):\n cnt += 1\n print(cnt)\n", "n, m = map(int, input().split())\r\np = [list(input()) for _ in range(n)]\r\nx, y = 0, 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if p[i][j] == 'S':\r\n x = i\r\n y = j\r\n\r\nst = input()\r\ncommand = ('D', 'L', 'U', 'R')\r\nd_x = {\r\n 'D': lambda x: x,\r\n 'L': lambda x: x - 1,\r\n 'R': lambda x: x + 1,\r\n 'U': lambda x: x,\r\n}\r\n\r\nd_y = {\r\n 'D': lambda y: y + 1,\r\n 'L': lambda y: y,\r\n 'R': lambda y: y,\r\n 'U': lambda y: y - 1,\r\n}\r\ncount = 0\r\nfor el1 in command: # 0\r\n for el2 in command: # 1\r\n for el3 in command: # 2\r\n for el4 in command: # 3\r\n if len({el1, el2, el3, el4}) == 4:\r\n command_d = {\r\n '0': el1,\r\n '1': el2,\r\n '2': el3,\r\n '3': el4,\r\n }\r\n p1, p2 = x, y\r\n for el in st:\r\n p1 = d_x[command_d[el]](p1)\r\n p2 = d_y[command_d[el]](p2)\r\n if not(0 <= p1 < n) or not(0 <= p2 < m) or p[p1][p2] == '#':\r\n break\r\n if p[p1][p2] == 'E':\r\n count += 1\r\n break\r\nprint(count)", "from itertools import permutations\r\na=[]\r\nfor i in permutations(\"EWNS\"):\r\n a.append(\"\".join(i))\r\n# print(len(a))\r\nans=0\r\nn,m=map(int,input().split())\r\narr=[]\r\nfor i in range(n):\r\n arr.append(input())\r\n if \"S\" in arr[-1]:\r\n indx=i\r\n indy=arr[-1].index(\"S\")\r\n \r\n\r\ndef check(x,y,sign):\r\n x1=x\r\n y1=y\r\n if sign==\"E\":\r\n x1+=1\r\n elif sign==\"W\":\r\n x1-=1\r\n elif sign==\"N\":\r\n y1+=1\r\n else:\r\n y1-=1\r\n return (x1,y1) \r\n \r\np=input() \r\n \r\nfor dir in range(24):\r\n cx=indx\r\n cy=indy\r\n for i in p:\r\n cx,cy=check(cx,cy,a[dir][int(i)])\r\n if cx>=n or cy>=m or cx<0 or cy<0:\r\n break\r\n elif arr[cx][cy]==\"#\":\r\n break\r\n elif arr[cx][cy]==\"E\":\r\n ans+=1\r\n break\r\nprint(ans) \r\n \r\n", "from itertools import permutations\r\n\r\nn, m = map(int, input().split())\r\ng = [input() for _ in range(n)]\r\np = tuple(map(int, input()))\r\n\r\ns = [(i, j) for i in range(n) for j in range(m) if g[i][j] == 'S'][0]\r\n\r\nans = 0\r\nfor var in permutations(((-1, 0), (0, -1), (0, 1), (1, 0))):\r\n i, j = s\r\n for c in p:\r\n i, j = i + var[c][0], j + var[c][1]\r\n if i < 0 or i >= n or j < 0 or j >= m or g[i][j] == '#':\r\n break\r\n if g[i][j] == 'E':\r\n ans += 1\r\n break\r\nprint(ans)", "from itertools import permutations\r\n \r\nn, m = (int(c) for c in input().split())\r\ns = '#'*(m+2)\r\nfor i in range(n):\r\n s += '#'+input().strip()+'#'\r\ns += '#'*(m+2)\r\nins = ['0123'.find(c) for c in input().strip()]\r\n \r\nc = 0\r\nfor d in permutations([1, -1, m+2, -m-2]):\r\n p = s.find('S')\r\n for i in ins:\r\n p += d[i]\r\n if s[p]=='E': c += 1\r\n if s[p] in 'E#': break\r\n \r\nprint(c)", "n, m = map(int, input().split())\r\nmatrix = [list(input()) for i in range(n)]\r\nline = list(input())\r\ns = [0, 0]\r\nfor i in range(n):\r\n out = False\r\n for j in range(m):\r\n if matrix[i][j] == 'S':\r\n s = [i, j]\r\n out = True\r\n break\r\n if out:\r\n break\r\n\r\nsteps = [(-1, 0), (0, -1), (1, 0), (0, 1)]\r\ncounter = 0\r\n\r\nfor el1 in steps:\r\n for el2 in steps:\r\n for el3 in steps:\r\n for el4 in steps:\r\n se = {el1, el2, el3, el4}\r\n if len(se) != 4:\r\n continue\r\n ma = {'0': el1, '1': el2, '2': el3, '3': el4}\r\n\r\n current_x = s[0]\r\n current_y = s[1]\r\n for el in line:\r\n current_x += ma[el][0]\r\n current_y += ma[el][1]\r\n if 0 <= current_x < n and 0 <= current_y < m:\r\n if matrix[current_x][current_y] == '#':\r\n break\r\n if matrix[current_x][current_y] == 'E':\r\n counter += 1\r\n break\r\n else:\r\n break\r\nprint(counter)\r\n\r\n\r\n", "def process(field, code, dictionary):\r\n\tx, y = 0, 0\r\n\tfor i in range(len(field)):\r\n\t\tfor j in range(len(field[i])):\r\n\t\t\tif field[i][j] == 'S':\r\n\t\t\t\tx, y = i, j\r\n\tdx = [1, 0, -1, 0]\r\n\tdy = [0, 1, 0, -1]\r\n\tfor command in code:\r\n\t\tx += dx[dictionary[command]]\r\n\t\ty += dy[dictionary[command]]\r\n\t\tif x < 0 or x >= len(field) or y < 0 or y >= len(field[x]) or field[x][y] == '#':\r\n\t\t\treturn False\r\n\t\tif field[x][y] == 'E':\r\n\t\t\treturn True\r\n\treturn False\r\n\r\ndef main():\r\n\tn, m = map(int, input().split())\r\n\tfield = [ input() for i in range(n) ]\r\n\tcode = input()\r\n\tans = 0\r\n\tfor U in range(4):\r\n\t\tfor D in range(4):\r\n\t\t\tif U == D:\r\n\t\t\t\tcontinue\r\n\t\t\tfor L in range(4):\r\n\t\t\t\tif L == U or L == D:\r\n\t\t\t\t\tcontinue\r\n\t\t\t\tfor R in range(4):\r\n\t\t\t\t\tif R == U or R == L or R == D:\r\n\t\t\t\t\t\tcontinue\r\n\t\t\t\t\tif process(field, code, { '0' : U, '1' : D, '2' : L, '3' : R }):\r\n\t\t\t\t\t\tans += 1\r\n\tprint(ans)\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "import math\r\n\r\ndef is_correct_map(maps, start_index, movers_index, list, sequence):\r\n current_position = start_index.copy()\r\n for i in range(len(sequence)):\r\n #print(\"japan\")\r\n #print(current_position)\r\n current_position[0] += movers_index[list[int(sequence[i])]][0]\r\n current_position[1] += movers_index[list[int(sequence[i])]][1]\r\n #print(current_position)\r\n if maps[current_position[0]][current_position[1]] == \"#\":\r\n #print(\"korea\")\r\n return False\r\n if maps[current_position[0]][current_position[1]] == \"E\":\r\n return True\r\n #print(\"a\")\r\n return False\r\n\r\n\r\n\r\n\r\n\r\n\r\ndef recursive_function(list, s, e, map, start, instruc, seq, collector):\r\n if s == e:\r\n #print(list)\r\n #print(start)\r\n if is_correct_map(map, start, instruc, list, seq):\r\n collector.append(1)\r\n #print(list)\r\n else:\r\n for i in range(s, e + 1):\r\n list[i], list[s] = list[s], list[i]\r\n recursive_function(list, s + 1, e, map, start, instruc, seq, collector)\r\n list[i], list[s] = list[s], list[i]\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\ndef main_function():\r\n n, m = [int(i) for i in input().split(\" \")]\r\n map = []\r\n for i in range(n):\r\n s = [\"#\"] + list(input()) + [\"#\"]\r\n map.append(s)\r\n map = [[\"#\" for i in range(m + 2)]] + map + [[\"#\" for i in range(m + 2)]]\r\n s = input()\r\n moves = [[1, 0], [-1, 0], [0, 1], [0, -1]]\r\n for i in range(len(map)):\r\n for j in range(len(map[i])):\r\n if map[i][j] == \"S\":\r\n start = [i, j]\r\n initial_list = [0, 1, 2, 3]\r\n #print(start)\r\n collector = []\r\n #print()\r\n #for i in map:\r\n # print(i)\r\n recursive_function(initial_list, 0, 3, map, start, moves, s, collector)\r\n print(len(collector))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()\r\n", "from itertools import permutations\r\n\r\nn, m = [int(i) for i in input().split()]\r\nfield = []\r\nstart = None\r\n\r\nfor i in range(n):\r\n cur = []\r\n for j, c in enumerate(list(input())):\r\n if c == 'S':\r\n start = (i, j)\r\n cur.append('.')\r\n else:\r\n cur.append(c)\r\n field.append(cur)\r\n\r\nprogram = input()\r\ndta = permutations([[1, 0], [0, 1], [-1, 0], [0, -1]])\r\n\r\n\r\ndef game(pth):\r\n i, j = start\r\n try:\r\n for c in program:\r\n p = pth[int(c)]\r\n i += p[0]\r\n j += p[1]\r\n\r\n if i < 0 or i >= n or j < 0 or j >= m:\r\n return False\r\n\r\n if field[i][j] == 'E':\r\n return True\r\n elif field[i][j] == '#':\r\n return False\r\n except IndexError:\r\n pass\r\n\r\n return False\r\n\r\n\r\nres = 0\r\nfor paths in dta:\r\n if game(paths):\r\n res += 1\r\nprint(res)", "n, m = map(int, input().split())\nd = []\nfor i in range(n):\n\td.append(input())\n\tif 'S' in d[-1]:\n\t\ts = [i, d[-1].index('S')]\n\tif 'E' in d[-1]:\n\t\te = [i, d[-1].index('E')]\np = input()\ndic = {'n': [-1, 0], 'e':[0,1], 's':[1, 0], 'w':[0,-1]}\nimport itertools as it\nz = it.permutations('news', 4)\nres = 0\nfor i in z:\n\tst = s\n\tet = e\n\tq = {'0123'[j]:dic[i[j]] for j in range(4)}\n\tfor j in p:\n\t\tcur = q[j]\n\t\tst = [st[0] + cur[0], st[1] + cur[1]]\n\t\tif st[0] < 0 or st[0] >= n or st[1] < 0 or st[1] >= m or d[st[0]][st[1]] == '#':\n\t\t\tbreak\n\t\tif st == et:\n\t\t\tbreak\n\tif st == et:\n\t\tres += 1\nprint(res)\n\n \t\t \t\t \t \t\t \t \t \t\t", "n ,m = map(int, input().split())\r\na = []\r\nk = 0\r\ns1, s2, e1, e2 = 0, 0 , 0, 0\r\nfor i in range(n):\r\n h = input()\r\n a.append(h)\r\n if 'S' in h:\r\n s1 = i\r\n s2 = h.index('S')\r\n if 'E' in h:\r\n e1 = i\r\n e2 = h.index('E')\r\nd = input()\r\nd1 = s1\r\nd2 = s2\r\nd3 = ['0', '1', '2', '3']\r\nfor j0 in d3:\r\n for j1 in d3:\r\n for j2 in d3:\r\n for j3 in d3:\r\n if j0 != j1 and j0 != j2 and j0 != j3 and j1 != j2 and j1 != j3 and j2 != j3:\r\n #1\r\n s1 = d1\r\n s2 = d2\r\n g = 0\r\n for i in range(len(d)):\r\n \r\n if d[i] == j0:\r\n s1 -= 1\r\n elif d[i] == j1:\r\n s1 += 1\r\n elif d[i] == j2:\r\n s2 -= 1\r\n elif d[i] == j3:\r\n s2 += 1\r\n if s1 < n and s1 >= 0 and s2 >= 0 and s2 < m and a[s1][s2] == 'E':\r\n k += 1\r\n break\r\n elif (s1 >= n or s1 < 0 or s2 < 0 or s2 >= m) or (s1 < n and s1 >= 0 and s2 >= 0 and s2 < m and a[s1][s2] == '#'):\r\n break\r\n \r\n \r\n\r\n\r\nprint(k)", "(n, m) = map(int, input().split())\r\nlab = [input() for i in range(n)]\r\ncommands = input()\r\n\r\nfor rowi, row in enumerate(lab):\r\n if 'S' in row:\r\n startposx = rowi\r\n startposy = row.index('S')\r\n break\r\n\r\ncombinations = []\r\nnc = 4\r\ncombination = [0] * nc\r\ndef fill_combinations(i):\r\n if i == nc:\r\n combinations.append(combination[:])\r\n \r\n for j in range(nc):\r\n if j not in combination[:i]:\r\n combination[i] = j\r\n fill_combinations(i + 1)\r\n\r\nfill_combinations(0)\r\n\r\nans = 0\r\ndirections = [(-1, 0), (1, 0), (0, -1), (0, 1)]\r\nfor correspondence in combinations: # перебираем все возможные соответствия\r\n x = startposx\r\n y = startposy\r\n exit_reached = False\r\n for command in commands:\r\n dir = directions[correspondence[int(command)]]\r\n x += dir[0]\r\n y += dir[1]\r\n if x < 0 or y < 0 or x == n or y == m:\r\n break\r\n if lab[x][y] == '#':\r\n break\r\n if lab[x][y] == 'E':\r\n exit_reached = True\r\n break\r\n if exit_reached:\r\n ans += 1\r\n\r\nprint(ans)", "from itertools import permutations\n\ndef main():\n N, M = map(int, input().split())\n T = tuple(input() for _ in [0] * N)\n S = input()\n\n for i, j in enumerate(T):\n k = j.find('S')\n if k > -1:\n start = (i, k)\n k = j.find('E')\n if k > -1:\n end = (i, k)\n\n mapping = ((0, -1), (0, 1), (-1, 0), (1, 0))\n cnt = 0\n for i in permutations(mapping, 4):\n now = start\n for j in S:\n p = i[int(j)]\n x = now[0] + p[0]\n y = now[1] + p[1]\n if not 0 <= x < N or not 0 <= y < M:\n break\n now = (x, y)\n if now == end:\n cnt += 1\n break\n elif T[x][y] == '#':\n break\n\n print(cnt)\n\nmain()\n", "n,m=map(int, input().split())\na=[]\nfor i in range(n):\n\ttemp=input()\n\ta.append(temp)\ns=input()\nlst=[0,1,2,3]\ndef permutation(lst):\n\tif len(lst)==0:\n\t\treturn []\n\tif len(lst)==1:\n\t\treturn [lst]\n\tl=[]\n\tfor i in range(len(lst)):\n\t\tm=lst[i]\n\t\tremLst=lst[:i]+lst[i+1:]\n\t\tfor p in permutation(remLst):\n\t\t\tl.append([m]+p)\n\treturn l\nans=0\nfor i in range(n):\n\tflag=1\n\tfor j in range(m):\n\t\tif a[i][j]=='S':\n\t\t\tflag=0\n\t\t\tbreak\n\tif not flag:\n\t\tbreak\np1=i\np2=j\nperms=permutation(lst)\nfor i in perms:\n\tflag=False\n\tstart=[p1,p2]\n\tfor j in s:\n\t\tif int(j)==i[0]:\n\t\t\tif start[1]==0:\n\t\t\t\tbreak\n\t\t\tstart[1]-=1\n\t\t\tif a[start[0]][start[1]]=='E':\n\t\t\t\tflag=True\n\t\t\t\tbreak\n\t\t\telif a[start[0]][start[1]]=='#':\n\t\t\t\tbreak\n\t\telif int(j)==i[1]:\n\t\t\tif start[1]==m-1:\n\t\t\t\tflag=0\n\t\t\t\tbreak\n\t\t\tstart[1]+=1\n\t\t\tif a[start[0]][start[1]]=='E':\n\t\t\t\tflag=True\n\t\t\t\tbreak\n\t\t\telif a[start[0]][start[1]]=='#':\n\t\t\t\tbreak\n\t\telif int(j)==i[2]:\n\t\t\tif start[0]==0:\n\t\t\t\tbreak\n\t\t\tstart[0]-=1\n\t\t\tif a[start[0]][start[1]]=='E':\n\t\t\t\tflag=True\n\t\t\t\tbreak\n\t\t\telif a[start[0]][start[1]]=='#':\n\t\t\t\tbreak\n\t\telif int(j)==i[3]:\n\t\t\tif start[0]==n-1:\n\t\t\t\tbreak\n\t\t\tstart[0]+=1\n\t\t\tif a[start[0]][start[1]]=='E':\n\t\t\t\tflag=True\n\t\t\t\tbreak\n\t\t\telif a[start[0]][start[1]]=='#':\n\t\t\t\tbreak\n\tif flag:\n\t\tans+=1\nprint(ans)", "from itertools import permutations\r\nn,m=list(map(int,input().split()))\r\na=[]\r\nfor i in range(n):\r\n\ta.append(input())\r\ns=input()\r\nb=[[1,0],[0,1],[-1,0],[0,-1]]\r\nans=0\r\ndef f(s,l,n,m):\r\n\ttemp=0\r\n\tfor i in range(n):\r\n\t\tfor j in range(m):\r\n\t\t\tif a[i][j]=='S':\r\n\t\t\t\tp=[i,j]\r\n\t\t\t\ttemp=1\r\n\t\t\t\tbreak\r\n\t\tif temp:\r\n\t\t\tbreak\r\n\tfor i in s:\r\n\t\tp[0]+=l[int(i)-1][0]\r\n\t\tp[1]+=l[int(i)-1][1]\r\n\t\tif p[0]<0 or p[0]>=n:\r\n\t\t\treturn 0\r\n\t\tif p[1]<0 or p[1]>=m:\r\n\t\t\treturn 0\r\n\t\tif a[p[0]][p[1]]=='#':\r\n\t\t\treturn 0\r\n\t\tif a[p[0]][p[1]]=='E':\r\n\t\t\treturn 1\r\n\treturn 0\r\nfor i in permutations(b):\r\n\tans+=f(s,list(i),n,m)\r\nprint(ans)", "def trace (maze, sol, cur):\r\n try:\r\n if cur[0] < 0 or cur[1] < 0: return False\r\n elif maze[cur[0]][cur[1]] == '#': return False\r\n elif maze[cur[0]][cur[1]] == 'E' : return True\r\n elif sol == []: return False\r\n nxt = sol[0]\r\n if nxt == 'u': return trace(maze, sol[1:], [cur[0]-1, cur[1]])\r\n elif nxt == 'd': return trace(maze, sol[1:], [cur[0]+1, cur[1]])\r\n elif nxt == 'l': return trace(maze, sol[1:], [cur[0], cur[1]-1])\r\n elif nxt == 'r': return trace(maze, sol[1:], [cur[0], cur[1]+1])\r\n except IndexError:\r\n return False\r\n \r\n \r\n[n,m] = [int(i) for i in input().split()]\r\nmaze = []\r\nstart = [0,0]\r\nfor i in range(n):\r\n maze.append(list(input()))\r\n if 'S' in maze[-1]: start = [i, maze[-1].index('S')]\r\nd = [int(i) for i in list(input())]\r\nc = 0\r\np = ['dlur', 'ruld', 'uldr', 'udrl', 'ulrd', 'rlud', 'urdl', 'rldu', 'lurd', 'dulr', 'ldur', 'rdlu', 'lrdu', 'drlu', 'lrud', 'ldru', 'udlr', 'durl', 'drul', 'dlru', 'rdul', 'ludr', 'rudl', 'urld']\r\nfor i in p:\r\n if trace(maze, [i[char] for char in d], start): c+=1\r\nprint(c)", "import itertools\r\n\r\nn, m = map(int, input().split())\r\nmaze = [\"#\"*(m+2)] + [\"#\"+input()+\"#\" for _ in range(n)] + [\"#\"*(m+2)]\r\nmoves = list(map(int, list(input())))\r\n\r\nx, y = None, None\r\nfor i, row in enumerate(maze):\r\n if row.count(\"S\"):\r\n x, y = i, row.index(\"S\")\r\n\r\ndef traverse(x, y, mapping):\r\n for move in moves:\r\n x += mapping[move][0]\r\n y += mapping[move][1]\r\n if maze[x][y] == \"#\":\r\n return False\r\n if maze[x][y] == \"E\":\r\n return True\r\n return False\r\n\r\nmappings = list(itertools.permutations([[0,1],[0,-1],[1,0],[-1,0]]))\r\nprint(sum([traverse(x, y, mapping) for mapping in mappings]))", "from itertools import permutations\n\ndef index_2d(myList, v):\n for i, x in enumerate(myList):\n if v in x:\n return [i, x.index(v)]\n\ndef check_valid(D,L,U,R,s,a,n,m):\n start_pos=index_2d(a,'S')\n end_pos=index_2d(a,'E')\n curr_pos=start_pos\n for i in s:\n if i==D:\n curr_pos[0]+=1\n if curr_pos[0] >= n or a[curr_pos[0]][curr_pos[1]] == '#':\n return 0\n if i==L:\n curr_pos[1]-=1\n if curr_pos[1] < 0 or a[curr_pos[0]][curr_pos[1]] == '#':\n return 0\n if i==U:\n curr_pos[0]-=1\n if curr_pos[0] < 0 or a[curr_pos[0]][curr_pos[1]] == '#':\n return 0\n if i==R:\n curr_pos[1]+=1\n if curr_pos[1] >= m or a[curr_pos[0]][curr_pos[1]] == '#':\n return 0\n if curr_pos == end_pos:\n return 1\n return 0\n\ndef robo(a,s,n,m):\n l=list(permutations(range(4)))\n c=0\n for i in l:\n D,L,U,R=i\n c+=check_valid(D,L,U,R,s,a,n,m)\n return c\n\nn,m=list(map(int, input().split()))\na=[]\nfor i in range(n):\n a.append(list(input()))\ns=list(map(int,input()))\nprint(robo(a,s,n,m))\n", "from itertools import permutations\r\nrows, cols = [int(x) for x in input().split()]\r\ngrid = [input() for _ in range(rows)]\r\nroute= input()\r\ndirections = [[0, 1],[-1, 0],[0, -1],[1, 0]]\r\nbegin_exit = [[-1, -1],[-1, -1]]\r\n\r\n#get start and exit\r\nfor i in range(rows):\r\n for j in range(cols):\r\n if grid[i][j] == \"S\":\r\n begin_exit[0][0] = i\r\n begin_exit[0][1] = j\r\n elif grid[i][j] == \"E\":\r\n begin_exit[1][0] = i\r\n begin_exit[1][1] = j\r\n\r\nans = 0\r\n\r\nfor d in permutations(directions):\r\n x, y = begin_exit[0][0], begin_exit[0][1]\r\n for r in route:\r\n dr = d[int(r)]\r\n x += dr[0]\r\n y += dr[1]\r\n if x == begin_exit[1][0] and y == begin_exit[1][1]:\r\n ans += 1\r\n break\r\n if not 0 <= x < rows or not 0 <= y < cols or grid[x][y] == \"#\":\r\n break\r\n\r\nprint(ans)", "from itertools import permutations\n\np = ['d', 'l', 'r', 'u']\nn, m = map(int, input().split())\na = []\nans = 0\nfor i in range(n):\n s = input()\n _ = s.find('S')\n if _ != -1:\n S = (i, _)\n a.append(list(s))\n\ns = input()\nfor i in permutations(p):\n y, x = S\n for j in s:\n if i[int(j)] == 'u':\n y -= 1\n elif i[int(j)] == 'd':\n y += 1\n elif i[int(j)] == 'r':\n x += 1\n else:\n x -= 1\n if x < 0 or y < 0 or x == m or y == n or a[y][x] == '#':\n break\n if a[y][x] == 'E':\n ans += 1\n break\nprint(ans)\n\n \t\t \t \t\t \t\t \t\t \t", "from itertools import permutations\r\nperm=permutations(['L','R','U','D'])\r\nd=[]\r\nfor i in perm:\r\n d.append(i)\r\nn,m=map(int,input().split())\r\na=[]\r\nsco=[]\r\neco=[]\r\nfor i in range(n):\r\n a.append(list(input()))\r\n if 'S' in a[i]:\r\n sco.append(i)\r\n sco.append(a[i].index('S'))\r\n if 'E' in a[i]:\r\n eco.append(i)\r\n eco.append(a[i].index('E'))\r\nb=list(map(int,list(input())))\r\nc=[]\r\nfor i in range(24):\r\n ref=d[i]\r\n x1,y1=sco[0],sco[1]\r\n x2,y2=eco[0],eco[1]\r\n for j in b:\r\n try:\r\n if ref[j]=='U':\r\n x1-=1\r\n if x1<0 or y1<0:\r\n c.append(False)\r\n break\r\n elif a[x1][y1]=='#':\r\n c.append(False)\r\n break\r\n elif a[x1][y1]=='E':\r\n c.append(True)\r\n break\r\n elif a[x1][y1]=='.':\r\n continue\r\n elif ref[j]=='D':\r\n x1+=1\r\n if x1<0 or y1<0:\r\n c.append(False)\r\n break\r\n elif a[x1][y1]=='#':\r\n c.append(False)\r\n break\r\n elif a[x1][y1]=='E':\r\n c.append(True)\r\n break\r\n elif a[x1][y1]=='.':\r\n continue\r\n elif ref[j]=='L':\r\n y1-=1\r\n if x1<0 or y1<0:\r\n c.append(False)\r\n break\r\n elif a[x1][y1]=='#':\r\n c.append(False)\r\n break\r\n elif a[x1][y1]=='E':\r\n c.append(True)\r\n break\r\n elif a[x1][y1]=='.':\r\n continue\r\n elif ref[j]=='R':\r\n y1+=1\r\n if x1<0 or y1<0:\r\n c.append(False)\r\n break\r\n elif a[x1][y1]=='#':\r\n c.append(False)\r\n break\r\n elif a[x1][y1]=='E':\r\n c.append(True)\r\n break\r\n elif a[x1][y1]=='.':\r\n continue\r\n except:\r\n #print(i)\r\n c.append(False)\r\n break\r\n#print(*sco)\r\n#print(*d)\r\n#print(*c)\r\nprint(c.count(True))\r\n \r\n", "n, m = map(int, input().split())\r\ng = [input() for i in range(n)]\r\ns, e = (0, 0), (n-1, m-1)\r\nd = list(map(int, list(input())))\r\nfor i in range(n):\r\n for j in range(m):\r\n if g[i][j]=='S': s = (i, j)\r\n if g[i][j]=='E': e = (i, j)\r\nt = 0\r\nfor d2 in range(4):\r\n for d3 in range(4):\r\n for d4 in range(4):\r\n for d5 in range(4):\r\n p = [d2, d3, d4, d5]\r\n if sorted(p)==[0, 1, 2, 3]:\r\n x, y = s\r\n i = 0\r\n while i<len(d) and 0<=x<n and 0<=y<m and g[x][y] not in ['E', '#']:\r\n r = p[d[i]]\r\n x += 1 if r==0 else -1 if r==1 else 0\r\n y += 1 if r==2 else -1 if r==3 else 0\r\n i += 1\r\n if 0<=x<n and 0<=y<m and g[x][y]=='E':\r\n t += 1\r\nprint(t)", "import itertools\n\nstart = [-1,-1]\nymax, xmax = [int(i) for i in input().split(' ')]\nmaze = [[]]*ymax\n\nfor y in range(ymax):\n\tmaze[y] = input()\n\ttry:\n\t\tstart = [maze[y].index('S'), y]\n\texcept:\n\t\tpass\n\npath = [int(d) for d in input()]\ncount = 0\n\nfor mapping in list(itertools.permutations([(0,1), (0,-1), (1,0), (-1,0)])):\n\tx, y = start\n\tfor p in path:\n\t\tx += mapping[p][0]\n\t\ty += mapping[p][1]\n\n\t\tif x<0 or x>=xmax or y<0 or y>=ymax or maze[y][x]=='#':\n\t\t\tbreak\n\t\tif maze[y][x]=='E':\n\t\t\tcount+=1\n\t\t\tbreak\n\nprint(count)\n", "import itertools\n\nn, m = map(int, input().split())\ndata = [input().strip() for i in range(n)]\nmove = list(map(int, list(input().strip())))\n\ndef valid(data, moves):\n\n x, y = 0, 0\n for i, row in enumerate(data):\n for j, ch in enumerate(row):\n if ch == 'S':\n x, y = i, j\n \n for m in moves:\n if m == 'N': x -= 1\n if m == 'E': y -= 1\n if m == 'W': y += 1\n if m == 'S': x += 1\n\n if not(0 <= x < len(data) and 0 <= y < len(data[0])):\n return False\n \n if data[x][y] == '#':\n return False\n \n if data[x][y] == 'E':\n return True\n\n return False\n\nans = 0\nfor x in itertools.permutations(range(4)):\n\n direction = {a:b for a, b in zip(x, list(\"NEWS\"))}\n moves = list(map(lambda x: direction[x], move))\n if valid(data, moves):\n ans += 1\n\nprint (ans)\n", "import bisect\r\nimport collections\r\nimport copy\r\nimport functools\r\nimport heapq\r\nimport itertools\r\nimport math\r\nimport sys\r\nimport string\r\nimport random\r\nfrom typing import List\r\nsys.setrecursionlimit(99999)\r\n\r\n\r\nn,m = map(int,input().split())\r\narr = []\r\nd = []\r\ndf = [[-1,0],[1,0],[0,1],[0,-1]]\r\nst = []\r\ns = \"\"\r\ndef check():\r\n x=st[0]\r\n y=st[1]\r\n for c in s:\r\n ind = d.index(c)\r\n x+= df[ind][0]\r\n y+=df[ind][1]\r\n if x<0 or x>=n or y<0 or y>=m or arr[x][y]=='#':\r\n return 0\r\n if arr[x][y]=='E':\r\n return 1\r\n return 0\r\n\r\n\r\nfor i in range(n):\r\n arr.append(input())\r\n if \"S\" in arr[-1]:\r\n st = [i,arr[-1].index(\"S\")]\r\ns = input()\r\nans= 0\r\nfor k in itertools.permutations([\"0\",\"1\",\"2\",\"3\"]):\r\n d = list(k)\r\n ans+=check()\r\nprint(ans)", "from itertools import permutations\r\n\r\ndef inside(x, y, n, m):\r\n return 0 <= x < n and 0 <= y < m\r\n \r\nn, m = list(map(int, input().split()))\r\nmaze = []\r\nfor i in range(n):\r\n maze.append(input())\r\ncmd = list(map(int, input()))\r\n\r\nDX = [1, 0, -1, 0]\r\nDY = [0, 1, 0, -1]\r\nCMD2DIR = list(permutations(range(4)))\r\n\r\ny0, x0 = max([(maze[x].find('S'), x) for x in range(n)])\r\n\r\nans = 0\r\nfor cmd2dir in CMD2DIR:\r\n x, y = x0, y0\r\n for c in cmd:\r\n x += DX[cmd2dir[c]]\r\n y += DY[cmd2dir[c]]\r\n if not inside(x, y, n, m) or maze[x][y] == '#':\r\n break\r\n if maze[x][y] == 'E':\r\n ans += 1\r\n break\r\n \r\nprint(ans)\r\n", "from itertools import permutations\n\ndirs = 'UDLR'\nperms = [''.join(p) for p in permutations(dirs)]\n\nchange = {'U': (-1, 0), 'D': (1, 0), 'L': (0, -1), 'R': (0, 1)}\n\nn, m = list(map(int, input().split()))\ngrid = []\nfor _ in range(n):\n\tgrid.append(list(input().rstrip()))\n\nins = list(map(int, list(input().rstrip())))\n\nfor i in range(n):\n\tfor j in range(m):\n\t\tif grid[i][j] == 'S':\n\t\t\tstart = (i, j)\n\t\telif grid[i][j] == 'E':\n\t\t\tend = (i, j)\n\nans = 0\nfor p in perms:\n\tcurr = start\n\tfor i in ins:\n\t\td = change[p[i]]\n\t\tnxt = (curr[0] + d[0], curr[1] + d[1])\n\t\tif nxt[0] < 0 or nxt[0] >= n or nxt[1] < 0 or nxt[1] >= m or grid[nxt[0]][nxt[1]] == '#':\n\t\t\tbreak\n\t\telif nxt == end:\n\t\t\tans += 1\n\t\t\tbreak\n\t\telse:\n\t\t\tcurr = nxt\n\nprint(ans)\n", "def check(robot_commands, start):\r\n y = start[0]\r\n x = start[1]\r\n for i in command:\r\n y += robot_commands[i][0]\r\n x += robot_commands[i][1]\r\n if labyrinth[y][x] == '#':\r\n return False\r\n if labyrinth[y][x] == 'E':\r\n return True\r\n return False\r\n\r\n\r\n# https://algoprog.ru/material/pc908pB\r\n\r\nN, M = map(int, input().split())\r\n\r\nlabyrinth = [['#'] * (M + 2)]\r\n\r\nfor i in range(1, N + 1):\r\n line = ['#'] + list(input()) + ['#']\r\n for j in range(1, M + 1):\r\n if line[j] == 'S':\r\n st_pos = (i, j)\r\n labyrinth.append(line)\r\nlabyrinth.append(['#'] * (M + 2))\r\n\r\ncommand = list(map(int, list(input())))\r\n\r\nans = 0\r\ndirections = [(1, 0), (-1, 0), (0, 1), (0, -1)]\r\n\r\nfor d1 in directions:\r\n used_d = {d1}\r\n robot_commands = {0: d1}\r\n for d2 in directions:\r\n used_d = {d1}\r\n if d2 not in used_d:\r\n used_d = {d1, d2}\r\n robot_commands[1] = d2\r\n for d3 in directions:\r\n used_d = {d1, d2}\r\n if d3 not in used_d:\r\n used_d = {d1, d2, d3}\r\n robot_commands[2] = d3\r\n for d4 in directions:\r\n used_d = {d1, d2, d3}\r\n if d4 not in used_d:\r\n robot_commands[3] = d4\r\n if check(robot_commands, st_pos):\r\n ans += 1\r\n\r\nprint(ans)", "import itertools\r\nimport 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 * m + v\r\n\r\nn, m = map(int, input().split())\r\na = []\r\nfor _ in range(n):\r\n b = list(input().rstrip())\r\n for i in b:\r\n a.append(i)\r\ns = list(input().rstrip())\r\nsx, sy = divmod(a.index(83), m)\r\ngx, gy = divmod(a.index(69), m)\r\nans = 0\r\nfor v0 in itertools.permutations([(1, 0), (-1, 0), (0, 1), (0, -1)]):\r\n v = list(v0)\r\n x, y = sx, sy\r\n for i in s:\r\n dx, dy = v[i - 48]\r\n x, y = x + dx, y + dy\r\n if not 0 <= x < n or not 0 <= y < m:\r\n break\r\n u = f(x, y)\r\n if a[u] ^ 46 and a[u] ^ 83:\r\n break\r\n if x == gx and y == gy:\r\n ans += 1\r\nprint(ans)", "import itertools\r\ndir = [(1,0), (0,1), (0, -1), (-1,0)]\r\nn,m=map(int, input().split())\r\nmap = [input() for _ in range (n)]\r\nd = input()\r\ns_i,s_j=-1,-1\r\nfor i in range(n):\r\n for j in range(m):\r\n if (map[i][j] == 'S'):\r\n s_i = i;\r\n s_j = j;\r\n\r\ndef go(p):\r\n si = s_i\r\n sj = s_j\r\n for c in d:\r\n id = p[int(c)]\r\n si += dir[id][0]\r\n sj += dir[id][1]\r\n if (si < 0 or si >= n or sj < 0 or sj >= m or map[si][sj]=='#' ):\r\n return 0\r\n if (map[si][sj] == 'E'):\r\n return 1\r\n return 0\r\n\r\nprint (sum(go(p) for p in itertools.permutations([0, 1, 2, 3])))\r\n ", "from itertools import permutations\r\n\r\ny,x =map(int, input().split())\r\nM=[\"\" for i in range(y)]\r\nfor i in range(y):\r\n M[i]=input()\r\npath=input()\r\n\r\nfor i in range(y):\r\n for j in range(x):\r\n if M[i][j]==\"S\":\r\n starty=i\r\n startx=j\r\n\r\nmappings=permutations(\"0123\")\r\ndirection_x=[0,1,0,-1]\r\ndirection_y=[1,0,-1,0]\r\n\r\nans=0\r\n\r\nfor mapping in mappings:\r\n mappath=[mapping[int(c)] for c in path]\r\n posy=starty\r\n posx=startx\r\n\r\n for direction in mappath:\r\n direction=int(direction)\r\n posy+=direction_y[direction]\r\n posx+=direction_x[direction]\r\n\r\n if not(posy>=0 and posy<y):\r\n break\r\n if not(posx>=0 and posx<x):\r\n break\r\n if M[posy][posx] == \"#\":\r\n break\r\n if M[posy][posx]==\"E\":\r\n ans+=1\r\n break\r\nprint(ans)\r\n\"\"\"from itertools import permutations\r\n \r\ny, x = map(int, input().split())\r\nM = [\"\" for i in range(y)]\r\nfor i in range(y):\r\n M[i] = input()\r\npath = input()\r\n \r\nfor i in range(y):\r\n for j in range(x):\r\n if M[i][j] == \"S\":\r\n starty = i\r\n startx = j\r\n \r\nmappings = permutations(\"0123\")\r\n \r\ndirection_y = [1, 0, -1, 0]\r\ndirection_x = [0, 1, 0, -1]\r\n \r\nans = 0\r\n#print([i for i in mappings])\r\nfor mapping in mappings:\r\n mappath = [mapping[int(c)] for c in path]\r\n #print(mappath)\r\n posy = starty\r\n posx = startx\r\n for direction in mappath:\r\n direction = int(direction)\r\n #print(posy, posx)\r\n posy += direction_y[direction]\r\n posx += direction_x[direction]\r\n if not (posy >= 0 and posy < y) :\r\n break\r\n if not (posx >= 0 and posx < x) :\r\n break\r\n if M[posy][posx] == '#' :\r\n break\r\n if M[posy][posx] == 'E' :\r\n ans += 1\r\n #print(\"yrah\")\r\n break\r\n \r\n \r\nprint(ans)\"\"\"\r\n", "# -*- coding: utf-8 -*-\n\"\"\"\nBob programmed a robot to navigate through a 2d maze.\n\nThe maze has some obstacles. Empty cells are denoted by the character '.', where obstacles are denoted by '#'.\n\nThere is a single robot in the maze. Its start position is denoted with the character 'S'. This position has no obstacle\nin it. There is also a single exit in the maze. Its position is denoted with the character 'E'. This position has no\nobstacle in it.\n\nThe robot can only move up, left, right, or down.\n\nWhen Bob programmed the robot, he wrote down a string of digits consisting of the digits 0 to 3, inclusive.\nHe intended for each digit to correspond to a distinct direction, and the robot would follow the directions in order to\nreach the exit. Unfortunately, he forgot to actually assign the directions to digits.\n\nThe robot will choose some random mapping of digits to distinct directions. The robot will map distinct digits to\ndistinct directions. The robot will then follow the instructions according to the given string in order and chosen\nmapping. If an instruction would lead the robot to go off the edge of the maze or hit an obstacle,\nthe robot will crash and break down. If the robot reaches the exit at any point,\nthen the robot will stop following any further instructions.\n\nBob is having trouble debugging his robot, so he would like to determine the number of mappings of digits to directions\nthat would lead the robot to the exit.\n\nInput\nThe first line of input will contain two integers n and m (2 ≤ n, m ≤ 50), denoting the dimensions of the maze.\n\nThe next n lines will contain exactly m characters each, denoting the maze.\n\nEach character of the maze will be '.', '#', 'S', or 'E'.\n\nThere will be exactly one 'S' and exactly one 'E' in the maze.\n\nThe last line will contain a single string s (1 ≤ |s| ≤ 100) — the instructions given to the robot. Each character of s\nis a digit from 0 to 3.\n\nOutput\nPrint a single integer, the number of mappings of digits to directions that will lead the robot to the exit.\n\"\"\"\nimport sys\n# sys.stdin = open(\"908B.test3\", \"r\")\n\n\ndef data_input():\n mazedim = tuple(map(int, sys.stdin.readline().strip().split()))\n ## mazedim = (rows, columns)\n maze = []\n for r in range(mazedim[0]):\n line = sys.stdin.readline()\n maze.append(line.strip())\n if \"S\" in line:\n starting_point = (r, line.index(\"S\"))\n if \"E\" in line:\n end_point = (r, line.index(\"E\"))\n\n instruction = [int(x) for x in sys.stdin.readline().strip()]\n return maze, mazedim, instruction, starting_point, end_point\n\n\ndef direction():\n direc = list(\"UDLR\")\n direc_possible = []\n c = [0 for _ in range(len(direc))]\n direc_possible.append(direc[:])\n\n i = 0\n while i < len(direc):\n if c[i] < i:\n if i % 2 == 0:\n direc[0], direc[i] = direc[i], direc[0]\n else:\n direc[c[i]], direc[i] = direc[i], direc[c[i]]\n direc_possible.append(direc[:])\n c[i] += 1\n i = 0\n else:\n c[i] = 0\n i += 1\n return direc_possible\n\n\ndef move(ins, x, y):\n if ins == \"U\":\n return x-1, y\n if ins == \"D\":\n return x+1, y\n if ins == \"L\":\n return x, y-1\n if ins == \"R\":\n return x, y+1\n\n\ndef solve(m, mdim, inst, st, end):\n directions = direction()\n counter = 0\n for d in directions:\n curpos = st\n for ins in inst:\n curpos = move(d[ins], *curpos)\n if curpos[0] < 0 or curpos[0] >= mdim[0]:\n break\n if curpos[1] < 0 or curpos[1] >= mdim[1]:\n break\n if m[curpos[0]][curpos[1]] == \"#\":\n break\n if curpos == end:\n counter += 1\n break\n return counter\n\nprint(solve(*data_input()))\n\n\n\n\n\n", "import itertools\r\n\r\n\r\ndef processing(maze, row, col, path):\r\n n, m = len(maze), len(maze[0])\r\n for i in range(len(path)):\r\n if path[i] == 'U':\r\n row -= 1\r\n elif path[i] == 'R':\r\n col += 1\r\n elif path[i] == 'D':\r\n row += 1\r\n elif path[i] == 'L':\r\n col -= 1\r\n if not (0 <= row < n and 0 <= col < m) or maze[row][col] == '#':\r\n return False\r\n elif maze[row][col] == 'E':\r\n return True\r\n\r\n return False\r\n\r\n\r\ndef transform_path(orig_path, dir):\r\n return [dir[int(orig_path[k])] for k in range(len(orig_path))]\r\n\r\n\r\nn, m = map(int, input().split())\r\n\r\nmaze = []\r\nfor i in range(n):\r\n maze.append(input())\r\n if maze[-1].count('S') != 0:\r\n pos = [i, maze[-1].index('S')]\r\n\r\ncnt = 0\r\ndir = ['U', 'R', 'D', 'L']\r\norig_path = input()\r\nfor d in itertools.permutations(['U', 'R', 'D', 'L']):\r\n if processing(maze, *pos, transform_path(orig_path, d)):\r\n cnt += 1\r\n\r\nprint(cnt)\r\n", "from itertools import permutations\n\nn, m = map(int, input().split())\nmaze = [list(input()) for _ in range(n)]\ns = list(map(int, list(input())))\ndxy = [(1, 0), (0, 1), (-1, 0), (0, -1)]\nsx = sy = ex = ey = 0\nfor y in range(n):\n for x in range(m):\n if maze[y][x] == 'S':\n sx = x\n sy = y\n elif maze[y][x] == 'E':\n ex = x\n ey = y\nans = 0\nfor p in permutations(range(4)):\n x = sx\n y = sy\n for i in s:\n x += dxy[p[i]][0]\n y += dxy[p[i]][1]\n if x == ex and y == ey:\n ans += 1\n break\n elif x == -1 or x == m or y == -1 or y == n or maze[y][x] == '#':\n break\n\nprint(ans)\n", "from itertools import *\r\nn, m = map(int, input().split())\r\np = [[0] * (m + 1) for i in range(n)] + [[0] * m]\r\nfor i in range(n):\r\n for j, q in enumerate(input()):\r\n if q == 'S': a, b = i, j\r\n p[i][j] = '#E'.find(q)\r\ns = list(map(int, input()))\r\ndef f(d):\r\n x, y = a, b\r\n for k in s:\r\n i, j = d[k]\r\n x += i\r\n y += j\r\n if p[x][y] + 1: return p[x][y]\r\n return 0\r\nt = [(1, 0), (-1, 0), (0, 1), (0, -1)]\r\nprint(sum(f(d) for d in permutations(t)))", "n,k=map(int,input().strip().split(' '))\r\nM=[]\r\nfor i in range(n):\r\n M.append(input())\r\nA=[[0,1,2,3],[0,1,3,2],[0,2,1,3],[0,2,3,1],[0,3,1,2],[0,3,2,1],[1,0,2,3],[1,0,3,2],[1,2,0,3],[1,2,3,0],[1,3,0,2],[1,3,2,0],[2,1,0,3],[2,1,3,0],[2,0,1,3],[2,0,3,1],[2,3,1,0],[2,3,0,1],[3,1,2,0],[3,1,0,2],[3,2,1,0],[3,2,0,1],[3,0,1,2],[3,0,2,1]]\r\nL=list(input())\r\nfor i in range(len(L)):\r\n L[i]=int(L[i])\r\n \r\nsi=0\r\nsj=0\r\nei=0\r\nej=0\r\nfor i in range(n):\r\n for j in range(k):\r\n if M[i][j]=='S':\r\n si=i\r\n sj=j\r\n if M[i][j]=='E':\r\n ei=i\r\n ej=j\r\n \r\n\r\ndef count(a,b,c,d,L):\r\n i=si\r\n j=sj\r\n for e in range(len(L)):\r\n \r\n if L[e]==a:\r\n i=i-1\r\n if i<0 or M[i][j]=='#':\r\n return False\r\n if L[e]==b:\r\n i=i+1\r\n if i>=n or M[i][j]=='#':\r\n return False\r\n if L[e]==c:\r\n j=j+1\r\n if j>=k or M[i][j]=='#':\r\n return False\r\n if L[e]==d:\r\n j=j-1\r\n if j<0 or M[i][j]=='#':\r\n return False\r\n \r\n if i==ei and j==ej:\r\n return True\r\n return False\r\nsum=0\r\nfor r in range(24):\r\n a=A[r][0]\r\n b=A[r][1]\r\n c=A[r][2]\r\n d=A[r][3]\r\n if count(a,b,c,d,L)==True:\r\n sum=sum+1 \r\nprint(sum)\r\n\r\n \r\n \r\n ", "def f(s):\r\n global pi\r\n if len(s)==4:\r\n pi+=g(s)\r\n else:\r\n for i in range(1,4+1):\r\n if str(i) not in s:\r\n f(s+str(i))\r\ndef g(x):\r\n q=qq\r\n w=ww\r\n op=[('u',x[0]),('l',x[1]),('d',x[2]),('r',x[3])]\r\n op.sort(key=lambda x:x[1])\r\n ty=1\r\n for i in p:\r\n if op[int(i)][0]=='u':\r\n q-=1\r\n elif op[int(i)][0]=='l':\r\n w-=1\r\n elif op[int(i)][0]=='r':\r\n w+=1\r\n else:\r\n q+=1\r\n if not(0<=q<n and 0<=w<m and s[q][w]!='#'):\r\n ty=0\r\n break\r\n elif s[q][w]=='E':\r\n break\r\n if 0<=q<n and 0<=w<m and s[q][w]=='E':\r\n return ty\r\n else:\r\n return 0\r\nn,m=map(int,input().split())\r\ns=[input() for i in range(n)]\r\nfor i in range(n):\r\n for j in range(m):\r\n if s[i][j]=='S':\r\n qq=i\r\n ww=j\r\n break\r\np=input()\r\npi=0\r\nf('')\r\nprint(pi)", "n, m = map(int, input().split())\r\n\r\nl = [input() for i in range(n)]\r\ns = input()\r\n\r\nst = []; finish = []\r\n\r\nfor i in range(n) :\r\n if l[i].find(\"S\") != -1 : st = [i, l[i].find(\"S\")]\r\n if l[i].find(\"E\") != -1 : finish = [i, l[i].find(\"E\")]\r\n\r\ndef per(a) :\r\n if len(a) == 0 : return [[]]\r\n else :\r\n res = []\r\n for i in range(len(a)) :\r\n x = a[i]; a.pop(i)\r\n for y in per(a):\r\n res += [[x] + y]\r\n a.insert(i, x)\r\n return res\r\n\r\nmove = per([0, 1, 2, 3])\r\n\r\nans = 0\r\n\r\nfor x in move :\r\n L = x[0]; R = x[1]\r\n U = x[2]; D = x[3]\r\n ok = True; start = [st[i] for i in range(2)]\r\n for i in range(len(s)) :\r\n k = int(s[i])\r\n if k == L : start[1] -= 1\r\n elif k == R : start[1] += 1\r\n elif k == U : start[0] -= 1\r\n else : start[0] += 1\r\n if start[0] < 0 or start[0] >= n or start[1] < 0 or start[1] >= m or l[start[0]][start[1]] == \"#\" :\r\n ok = False; break\r\n elif l[start[0]][start[1]] == \"E\" : break\r\n if ok and start == finish : ans += 1\r\n\r\nprint(ans)", "import sys\r\ninput = sys.stdin.readline\r\nfrom itertools import permutations\r\n\r\nn, m = map(int, input().split())\r\ng = [input()[:-1] for _ in range(n)]\r\n\r\ns = input()[:-1]\r\n\r\na1, b1 = 0, 0\r\nc1, d1 = 0, 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if g[i][j] == 'S':\r\n a1 = i\r\n b1 = j\r\n if g[i][j] == 'E':\r\n c1 = i\r\n d1 = j\r\n\r\nq = '0123'\r\nq = list(permutations(q))\r\n\r\nans = 0\r\nfor (i1,i2,i3,i4) in q:\r\n a, b, c, d = a1, b1, c1, d1\r\n for i in s:\r\n if i == i1:\r\n a += 1\r\n if i == i2:\r\n a -= 1\r\n if i == i3:\r\n b += 1\r\n if i == i4:\r\n b -= 1\r\n if a == c and b == d:\r\n ans += 1\r\n break\r\n if a < 0 or a >= n or b < 0 or b >= m:\r\n break\r\n if g[a][b] == '#':\r\n break\r\nprint(ans)", "import itertools\r\nimport collections\r\n\r\ndef outside(x,y):\r\n if x<0 or x>=r or y<0 or y>=c:\r\n return True\r\n else:\r\n return False\r\n\r\ndx=(0,0,1,-1)\r\ndy=(1,-1,0,0)\r\n\r\ns=input().split()\r\nr,c=map(int,s)\r\n\r\nm=[]\r\nfor i in range(r):\r\n m.append(input())\r\n\r\nS=[0,0]\r\nfor i in range(r):\r\n if m[i].find('S')!=-1:\r\n S=[i, m[i].find('S')]\r\n break\r\n\r\nstep=input()\r\n\r\nans=0\r\nfor d in itertools.permutations([0,1,2,3]):\r\n x,y=S\r\n for j in step:\r\n k=int(j)\r\n x+=dx[d[k]]\r\n y+=dy[d[k]]\r\n\r\n if outside(x,y) or m[x][y]==\"#\":\r\n break\r\n\r\n if m[x][y]==\"E\":\r\n ans+=1\r\n break\r\n\r\nprint(ans)\r\n", "import itertools\r\n\r\nn, m = list( map( int, input().split() ) )\r\n\r\na = []\r\n\r\nfor i in range(n):\r\n x = input()\r\n a.append( x )\r\n\r\noper = list( map( int, input() ) )\r\n\r\n#print( a )\r\n\r\ns_x, s_y, e_x, e_y = 0, 0, 0, 0\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j] == 'S':\r\n s_x, s_y = i, j\r\n elif a[i][j] == 'E':\r\n e_x, e_y = i, j\r\n\r\ndef valid( x, y ):\r\n if ( x < 0 or y < 0 or x >= n or y >= m ):\r\n return ( False )\r\n if a[x][y] == '#':\r\n return ( False )\r\n return ( True )\r\n\r\ndx = [-1,1,0,0]\r\ndy = [0,0,-1,1]\r\n\r\nans = 0\r\n\r\nfor i in itertools.permutations( [0,1,2,3] ):\r\n\r\n fl = True\r\n\r\n tmp_x, tmp_y = s_x, s_y\r\n\r\n for j in range( len(oper) ):\r\n\r\n #print( oper )\r\n\r\n next_x = tmp_x + dx[ i[ oper[j] ] ]\r\n next_y = tmp_y + dy[ i[ oper[j] ] ]\r\n\r\n if not valid( next_x, next_y ):\r\n fl = False\r\n break\r\n\r\n tmp_x, tmp_y = next_x, next_y\r\n\r\n if tmp_x == e_x and tmp_y == e_y:\r\n ans += 1\r\n break\r\n\r\nprint( ans )\r\n", "def Diff(li1, li2):\r\n li_dif = [i for i in li1 + li2 if i not in li1 or i not in li2]\r\n return li_dif\r\nn,m=list(map(int,input().split()))\r\ng=[]\r\nfor i in range(n):\r\n g.append(input())\r\np=input()\r\nx,y,f=0,0,0\r\nfor i in range(n):\r\n for j in range(m):\r\n if g[i][j]=='S':\r\n x,y=i,j\r\n f=1\r\n break\r\n if f:\r\n break\r\nans=0\r\nd={}\r\nl=['l','r','u','d']\r\nfor i in l:\r\n d['0']=i\r\n l1=Diff(l,[i])\r\n for j in l1:\r\n d['1']=j\r\n l2=Diff(l,[i,j])\r\n for k in l2:\r\n d['2']=k\r\n l3=Diff(l,[i,j,k])\r\n for t in l3:\r\n d['3']=t\r\n f=0\r\n a,b=x,y\r\n for pt in p:\r\n if d[pt]=='l':\r\n a=a-1\r\n elif d[pt]=='r':\r\n a=a+1\r\n elif d[pt]=='u':\r\n b=b+1\r\n elif d[pt]=='d':\r\n b=b-1\r\n if (a<0) or (a>=n) or (b<0) or (b>=m):\r\n break\r\n elif g[a][b]=='#':\r\n break\r\n elif g[a][b]=='E':\r\n f=1\r\n break\r\n if f:\r\n ans=ans+1\r\nprint(ans)", "def list_output(s): \r\n print(' '.join(map(str, s)))\r\n \r\ndef list_input(s='int'):\r\n if s == 'int':\r\n return list(map(int, input().split())) \r\n elif s == 'float':\r\n return list(map(float, input().split()))\r\n return list(map(str, input().split()))\r\n\r\nn, m = map(int, input().split())\r\nM = list()\r\nfor i in range(n):\r\n M.append(input())\r\ntmp = input().rstrip()\r\nseq = list()\r\nfor x in tmp:\r\n seq.append(ord(x)-ord('0'))\r\n\r\nsx, sy = -1, -1\r\ngx, gy = -1, -1\r\nfor i in range(n):\r\n for j in range(m):\r\n if M[i][j] == 'S':\r\n sx, sy = i, j\r\n elif M[i][j] == 'E':\r\n gx, gy = i, j\r\n\r\nfrom itertools import permutations\r\ndx = [-1, 0, 1, 0]\r\ndy = [0, 1, 0, -1]\r\nres = 0\r\nfor p in permutations([0, 1, 2, 3]):\r\n x, y = sx, sy \r\n for s in seq:\r\n x += dx[p[s]]\r\n y += dy[p[s]] \r\n if x < 0 or x >= n or y < 0 or y >= m:\r\n break \r\n if M[x][y] == '#':\r\n break\r\n if x == gx and y == gy:\r\n res += 1\r\n break\r\nprint(res)\r\n", "from itertools import permutations\r\nn,m=(int(c)for c in input().split())\r\ns='#'*(m+2)\r\nfor i in range(n):s+='#'+input().strip()+'#'\r\ns+='#'*(m+2)\r\nins=['0123'.find(c)for c in input().strip()]\r\nc=0\r\nfor d in permutations([1,-1,m+2,-m-2]):\r\n p=s.find('S')\r\n for i in ins:\r\n p+=d[i]\r\n if s[p]=='E':c+=1\r\n if s[p]in'E#':break\r\nprint(c)", "from itertools import permutations\r\n\r\ndirs = [(-1, 0), (1, 0), (0, 1), (0, -1)]\r\n\r\nn, m = map(int, input().split())\r\ns = [input() for _ in range(n)]\r\n\r\nspos = (0, 0)\r\nfor i in range(n):\r\n for j in range(m):\r\n if s[i][j] == 'S':\r\n spos = (j, i)\r\n\r\nt = input()\r\n\r\nans = 0\r\nfor p in permutations(dirs):\r\n x, y = spos\r\n for c in t:\r\n dr = p[int(c)]\r\n x += dr[0]\r\n y += dr[1]\r\n if not 0 <= x < m or not 0 <= y < n:\r\n break\r\n if s[y][x] == '#':\r\n break\r\n if s[y][x] == 'E':\r\n ans += 1\r\n break\r\n\r\nprint(ans)", "from itertools import permutations\r\n\r\n\r\ndef check(cmd):\r\n global c, field, pos\r\n x, y = pos[0], pos[1]\r\n for cm in c:\r\n if cmd[0] == cm:\r\n x += 1\r\n elif cmd[1] == cm:\r\n x -= 1\r\n elif cmd[2] == cm:\r\n y -= 1\r\n else:\r\n y += 1\r\n if x < 0 or y < 0 or x >= n or y >= m or field[x][y] == \"#\":\r\n return False\r\n if field[x][y] == \"E\":\r\n return True\r\n\r\n\r\np = [\"0\", \"1\", \"2\", \"3\"]\r\nn, m = map(int, input().split())\r\nfield = []\r\npos = (0, 0)\r\nfor i in range(n):\r\n ss = input()\r\n if ss.find(\"S\") != -1:\r\n pos = (i, ss.find(\"S\"))\r\n field.append(ss)\r\nc = input()\r\nanswer = 0\r\nfor per in permutations(p):\r\n if check(per):\r\n answer += 1\r\nprint(answer)", "def do_step(x: int, y: int, type: int):\r\n if type == 0:\r\n return x, y + 1\r\n elif type == 1:\r\n return x + 1, y\r\n elif type == 2:\r\n return x, y - 1\r\n else:\r\n return x - 1, y\r\n\r\n\r\nn, m = map(int, input().split())\r\ngr = []\r\nsx, sy = 0, 0\r\nex, ey = 0, 0\r\nfor i in range(n):\r\n gr.append(list(input()))\r\n for j in range(m):\r\n if gr[i][j] == 'S':\r\n sx = (i,)\r\n sy = (j,)\r\n if gr[i][j] == 'E':\r\n ex = i\r\n ey = j\r\ns = list(map(int, list(input())))\r\nans = 0\r\nfor zero in range(4):\r\n for one in range(4):\r\n if one != zero:\r\n for two in range(4):\r\n if one != two and two != zero:\r\n for three in range(4):\r\n if three != one and three != zero and three != two:\r\n steps = [zero, one, two, three]\r\n # print(steps)\r\n x, y = sy[0], sx[0]\r\n for i in s:\r\n x, y = do_step(x, y, steps[i])\r\n if x == m or x == -1 or y == n or y == -1 or gr[y][x] == '#':\r\n break\r\n if x == ey and y == ex:\r\n ans += 1\r\n break\r\nprint(ans)\r\n", "# 0 - вверх, 1 - вправо, 2 - вниз, 3 - влево\ndef goField(field, rule, dirs, start):\n pos = start\n # while field[pos[0]][pos[1]] != \"E\":\n for i in rule:\n i = int(i)\n if dirs[i] == 0:\n pos[0] -= 1\n\n if dirs[i] == 1:\n pos[1] += 1\n\n if dirs[i] == 2:\n pos[0] += 1\n\n if dirs[i] == 3:\n pos[1] -= 1\n\n if pos[0] < 0 or pos[1] < 0 or pos[0] >= len(field) or pos[1] >= len(field[0]) \\\n or field[pos[0]][pos[1]] == \"#\":\n return 0\n if field[pos[0]][pos[1]] == \"E\":\n return 1\n\n return 0\n\n\ndef main():\n import itertools\n\n n, m = [int(i) for i in input().split()]\n field = []\n start = [0, 0]\n for i in range(n):\n s = input()\n field.append(s)\n if \"S\" in s:\n start = [i, s.index(\"S\")]\n\n rule = input()\n dirs = [0, 1, 2, 3]\n\n amount = 0\n for dir in list(itertools.permutations(dirs)):\n amount += goField(field, rule, dir, start.copy())\n\n print(amount)\n\nmain()", "n, m = map(int, input().split())\r\n\r\nk = [[] * m for i in range(n)]\r\n\r\nfor i in range(n):\r\n k[i] = input()\r\n if 'S' in k[i]:\r\n y = k[i].index('S')\r\n x = i\r\n if 'E' in k[i]:\r\n y1 = k[i].index('E')\r\n x1 = i\r\n\r\ns = input()\r\n\r\nschet = 0\r\n\r\nj = 'dlur'\r\n\r\nc = 0\r\n\r\n\r\nfor i in j:\r\n u = j[:]\r\n u = u.replace(i, '')\r\n for o in u:\r\n t = u[:]\r\n t = t.replace(o, '')\r\n for q in t:\r\n g = t[:]\r\n g = g.replace(q, '')\r\n l = {'0': i, '1': o, '2': q, '3': g}\r\n lookx = x\r\n looky = y\r\n c += 1\r\n for w in s:\r\n if l[w] == 'd':\r\n lookx += 1\r\n if lookx >= n:\r\n break\r\n elif l[w] == 'l':\r\n looky -= 1\r\n if looky < 0:\r\n break\r\n elif l[w] == 'r':\r\n looky += 1\r\n if looky >= m:\r\n break\r\n elif l[w] == 'u':\r\n lookx -= 1\r\n if lookx < 0:\r\n break\r\n if k[lookx][looky] == '#':\r\n break\r\n if looky == y1 and lookx == x1:\r\n schet += 1\r\n break\r\n\r\nprint(schet)\r\n", "import itertools\r\n\r\nmov = {'U':[0,-1],'D':[0,1],'L':[-1,0],'R':[1,0]}\r\n\r\ndef is_valid(x,y, grid, n, m):\r\n ans = (x >= 0 and x < n) and (y >= 0 and y < m) and grid[x][y] != '#'\r\n return ans\r\n\r\ndef check(per, dirs, grid, n, m, ci, cj):\r\n for step in dirs:\r\n if is_valid(ci + mov[per[step]][1], cj + mov[per[step]][0],grid, n, m):\r\n \r\n ci += mov[per[step]][1]\r\n cj += mov[per[step]][0]\r\n \r\n #print(per, end=' ')\r\n #print(str(step) + \" \" + str(mov[per[step]][0]) + \" \" + str(mov[per[step]][1])+\" \"+ str(grid[ci][cj])+\" \"+str(ci)+\" \"+str(cj))\r\n if grid[ci][cj] == 'E':\r\n return 1\r\n else:\r\n return 0\r\n return 0\r\n\r\n\r\nn, m = map(int, input().split())\r\ngrid = []\r\nfor i in range(n):\r\n grid.append(input())\r\nfor i in range(n):\r\n for j in range(m):\r\n if grid[i][j] == 'S':\r\n ci, cj = i, j\r\n break\r\n \r\ndirs = [int(ch) for ch in input()]\r\n\r\nperms = [list(ob) for ob in list(itertools.permutations(['U','D','L','R']))]\r\n\r\nans = 0\r\nfor per in perms:\r\n tci,tcj = ci,cj\r\n if check(per, dirs, grid, n, m, tci, tcj) > 0:\r\n ans += 1\r\nprint(ans)", "m, n = map(int, input().split())\r\narr = []\r\nnum = 0\r\nfor i in range(m):\r\n a = input()\r\n if 'S' in a:\r\n xs = a.index('S')\r\n ys = i\r\n if 'E' in a:\r\n xe = a.index('E')\r\n ye = i\r\n arr.append(a)\r\ndirect = [[1, 0], [-1, 0], [0, 1], [0, -1]]\r\nnums = [int(i) for i in input()]\r\nfor i in direct:\r\n di = direct.index(i)\r\n direct1 = direct[:di] + direct[di+1:]\r\n for j in direct1:\r\n dj = direct1.index(j)\r\n direct2 = direct1[:dj] + direct1[dj+1:]\r\n for k in direct2:\r\n dk = direct2.index(k)\r\n direct3 = direct2[:dk] + direct2[dk+1:]\r\n l = direct3[0]\r\n numDict = {0:i, 1:j, 2:l, 3:k}\r\n\r\n # Здесь основной код\r\n\r\n x1, y1 = xs, ys\r\n for z in nums:\r\n p = numDict[z]\r\n x1, y1 = x1 + p[0], y1 + p[1]\r\n if -1 < x1 < n and -1 < y1 < m:\r\n a = arr[y1][x1]\r\n if a == 'E':\r\n num += 1\r\n break\r\n elif a == '#':\r\n break\r\n else:\r\n break\r\n# print(arr)\r\nprint(num)\r\n", "from itertools import *\nu=[(-1,0),(1,0),(0,1),(0,-1)]\nn,m=map(int,input().split())\ns=[input()for _ in range(n)]\nspos=(0,0)\nfor i in range(n):\n for j in range(m):\n if s[i][j]=='S':\n spos=(j,i)\nt=input()\nans=0\nfor p in permutations(u):\n x,y=spos\n for c in t:\n z=p[int(c)]\n x+=z[0]\n y+=z[1]\n if not 0<=x<m or not 0<=y<n:break\n if s[y][x]=='#':break\n if s[y][x]=='E':\n ans+=1\n break\nprint(ans)\n", "import itertools\ndir = [[-1, 0], [1, 0], [0, -1], [0, 1]]\nn, m = list(map(int, input().split()))\ns = list()\nsy = -1\nsx = -1\ney = -1\nex = -1\nfor i in range(0, n):\n\ta = input()\n\ts.append(a)\n\tfor j in range(0, m):\n\t\tif a[j] == 'S':\n\t\t\tsy = i\n\t\t\tsx = j\n\t\telif a[j] == 'E':\n\t\t\tey = i\n\t\t\tex = j\nc = input()\nans = 0\nfor i in list(itertools.permutations(['0', '1', '2', '3'])):\n\tuy = sy\n\tux = sx\n\tok = 0\n\tfor j in range(0, len(c)):\n\t\tidx = i.index(c[j])\n\t\tuy += dir[idx][0]\n\t\tux += dir[idx][1]\n\t\tif uy < 0 or uy > n-1 or ux < 0 or ux > m-1 or s[uy][ux] == '#':\n\t\t\tbreak\n\t\telif s[uy][ux] == 'E':\n\t\t\tok = 1;\n\t\t\tbreak\n\tans += ok\nprint(ans)", "from itertools import permutations\r\nmaze = []\r\nn, m = [int(i) for i in input().split(\" \")]\r\nfor i in range(n):\r\n maze.append(list(str(input())))\r\np = list(permutations([0, 1, 2, 3]))\r\n# print(p)\r\nins = list(str(input()))\r\nstart = [0, 0]\r\nend = [0, 0]\r\nresult = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if maze[i][j] == 'S':\r\n start = [i, j]\r\n elif maze[i][j] == 'E':\r\n end = [i, j]\r\n# print(start, end)\r\nfor k in range(24):\r\n l, r, u, d = p[k][0], p[k][1], p[k][2], p[k][3]\r\n cur = start[:]\r\n action = 0\r\n # print('This is trial', k)\r\n # print('beginning', cur)\r\n for x in ins:\r\n if x == '0':\r\n action = l\r\n elif x == '1':\r\n action = r\r\n elif x == '2':\r\n action = u\r\n elif x == '3':\r\n action = d\r\n if action == 0:\r\n cur[0] += 1\r\n elif action == 1:\r\n cur[0] -= 1\r\n elif action == 2:\r\n cur[1] += 1\r\n elif action == 3:\r\n cur[1] -= 1\r\n # print(cur)\r\n if cur == end:\r\n result += 1\r\n break\r\n elif cur[0] < 0 or cur[1] < 0 or cur[0] >= n or cur[1] >= m:\r\n break\r\n elif maze[cur[0]][cur[1]] == '#':\r\n break\r\n # print(result)\r\nprint(result)\r\n", "# python3\n# utf-8\n\nfrom itertools import permutations\nrows_nr, cols_nr = (int(x) for x in input().split())\nr_c___val = []\nstart_r_c = [-1, -1]\nfor r in range(rows_nr):\n c___val = input()\n if 'S' in c___val:\n start_r_c[0] = r\n for c, val in enumerate(c___val):\n if val == 'S':\n start_r_c[1] = c\n break\n r_c___val.append(list(c___val))\ncommands = list(input())\nans = 0\nstart_arrange = [(1, 0), (-1, 0), (0, 1), (0, -1)]\nfor permutation in permutations(start_arrange):\n curr_pos = start_r_c.copy()\n flag = True\n for sym in commands:\n command = int(sym)\n curr_pos[0] += permutation[command][0]\n curr_pos[1] += permutation[command][1]\n if curr_pos[0] < 0 or curr_pos[1] < 0:\n flag = False\n if curr_pos[0] >= rows_nr or curr_pos[1] >= cols_nr:\n flag = False\n if not flag:\n break\n if r_c___val[curr_pos[0]][curr_pos[1]] == '#':\n flag = False\n break\n if r_c___val[curr_pos[0]][curr_pos[1]] == 'E':\n break\n if flag and r_c___val[curr_pos[0]][curr_pos[1]] == 'E':\n ans += 1\nprint(ans)\n", "def check(a, b, c, d):\r\n dx = {a: 1, b: 0, c: -1, d: 0}\r\n dy = {a: 0, b: 1, c: 0, d: -1}\r\n x = startx\r\n y = starty\r\n for i in direction:\r\n x += dx[i]\r\n y += dy[i]\r\n if (0 <= x < n) and (0 <= y < m):\r\n if map[x][y] == \"#\":\r\n return False\r\n if map[x][y] == \"E\":\r\n return True\r\n continue\r\n else:\r\n return False\r\n return False\r\n\r\nn, m = map(int, input().split())\r\nmap = []\r\nfor i in range(n):\r\n map.append(list(input()))\r\n if \"S\" in map[i]:\r\n startx = i\r\n starty = map[i].index(\"S\")\r\ndirection = [int(i) for i in list(input())]\r\nans = 0\r\nfor i in range(4):\r\n for j in range(4):\r\n if i != j:\r\n for k in range(4):\r\n if i != k and k != j:\r\n for l in range(4):\r\n if l != i and l != j and l != k:\r\n if check(i, j, k, l):\r\n ans += 1\r\nprint(ans)", "import itertools\r\nd = [[-1, 0], [1, 0], [0, -1], [0, 1]]\r\nn, m = map(int, input().split())\r\ng, si, sj = [input() for i in range(n)], -1, -1\r\nfor i, gi in enumerate(g):\r\n if 'S' in gi:\r\n si, sj = i, gi.find('S')\r\ns = input()\r\ndef f(p):\r\n i, j = si, sj\r\n for x in s:\r\n di = p[int(x)]\r\n i, j = i + d[di][0], j + d[di][1]\r\n if i < 0 or i >= n or j < 0 or j >= m or g[i][j] == '#':\r\n return 0\r\n elif g[i][j] == 'E':\r\n return 1\r\n return 0\r\nprint(sum(f(p) for p in itertools.permutations([0, 1, 2, 3])))", "def check(point:list, obstacles:list, x, y):\n if point[0] > x or point[1] > y or point[0] < 0 or point[1] < 0:\n return False\n if tuple(point) in obstacles:\n return False\n return True \n\ndef test_path(start:list, end:list, path:str, direction:list, obstacles:list, x, y):\n\n for i in path:\n i = int(i)\n if direction[i] == 'left':\n start[0] -= 1\n elif direction[i] == 'right':\n start[0] += 1\n elif direction[i] == 'up':\n start[1] -= 1\n elif direction[i] == 'down':\n start[1] += 1\n \n # print(f'{start} : {direction[i]}')\n if not check(start, obstacles, x, y):\n return False\n\n if start == end:\n return True\n return False\n\ny, x = [int(s) for s in input().split()] \nobstacles = set()\nstart = list()\nend = list()\nfor i in range(y):\n raw = input()\n for j in range(x):\n if raw[j] == 'S':\n start = [j, i]\n elif raw[j] == 'E':\n end = [j, i]\n elif raw[j] == '#':\n obstacles.add((j, i))\n\npath = input()\n\n\ns = ['left', 'right', 'up', 'down']\ndirections = []\nfor i in range(len(s)):\n for j in range(len(s)):\n for k in range(len(s)):\n for l in range(len(s)):\n if len(set([i,j,k,l])) == 4:\n directions.append([s[i], s[j], s[k], s[l]])\n\n\ncounter = 0\nfor i in directions:\n is_valid = test_path(start.copy(), end, path, i, obstacles, x-1, y-1)\n if is_valid:\n counter += 1\n # print(f'--------------------{is_valid}')\nprint(counter)", "from collections import defaultdict as dd\r\nfrom collections import deque\r\nimport bisect\r\nimport heapq\r\nfrom itertools import permutations as perms\r\n\r\ndef ri():\r\n return int(input())\r\n\r\ndef rl():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef solve():\r\n n, m = rl()\r\n grid = []\r\n for i in range(n): grid.append(input())\r\n moves = input()\r\n\r\n sx, sy = 0, 0\r\n for i in range(n):\r\n for j in range(m):\r\n if grid[i][j] == \"S\":\r\n sx = i\r\n sy = j\r\n break\r\n \r\n def test(d):\r\n nonlocal sx, sy, moves, n, m, grid\r\n x, y = sx, sy\r\n for move in moves:\r\n dx, dy = d[move]\r\n nx, ny = x + dx, y + dy\r\n if (nx < 0 or ny < 0 or nx >= n or ny >= m) or (grid[nx][ny] == \"#\"):\r\n return 0\r\n x, y = nx, ny\r\n if grid[x][y] == \"E\":\r\n return 1\r\n return 0\r\n\r\n\r\n ans = 0\r\n delta = [[1,0],[-1,0],[0,1],[0,-1]] \r\n for p in perms(delta):\r\n d = {}\r\n for i, c in enumerate(\"0123\"):\r\n d[c] = p[i]\r\n ans += test(d)\r\n\r\n print (ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\nmode = 's'\r\n\r\nif mode == 'T':\r\n t = ri()\r\n for i in range(t):\r\n solve()\r\nelse:\r\n solve()\r\n", "l = ['0123','0132','0213','0231','0312','0321','1023','1032','1203','1230','1302','1320','2013','2031','2103','2130','2301','2310','3012','3021','3102','3120','3201','3210']\r\n\r\nn,m = map(int, input().split())\r\n\r\ngrid = [0]*n\r\n\r\nfor i in range(n):\r\n grid[i] = list(input())\r\n if 'S' in grid[i]:\r\n sx = i\r\n sy = grid[i].index('S')\r\n\r\ndirec = list(map(int, list(input())))\r\n\r\nans = 0\r\n\r\nsxog = sx\r\nsyog = sy\r\n\r\nfor i in l:\r\n sx = sxog\r\n sy = syog\r\n# print(i, sx, sy)\r\n found = 0\r\n for j in range(len(direc)):\r\n# print('direc: ', direc[j])\r\n if i[direc[j]] == '0':\r\n sx += 1\r\n if i[direc[j]] == '1':\r\n sx -= 1\r\n# print('sx: ',sx)\r\n if i[direc[j]] == '2':\r\n sy += 1\r\n if i[direc[j]] == '3':\r\n sy -= 1\r\n if sx < 0 or sy < 0 or sx >= n or sy >= m:\r\n break\r\n new = grid[sx][sy]\r\n if new == '#':\r\n break\r\n if new == 'E':\r\n found = 1\r\n break\r\n if found == 1:\r\n# print(i)\r\n ans += 1\r\nprint(ans)\r\n", "from itertools import permutations\ngetInputList = lambda : list(input().split())\ngetInputIntList = lambda : list(map(int,input().split()))\n\n\na = list(permutations(range(4)))\ncount = 0\n\nn,m = getInputIntList()\ngrid = []\n\nfor i in range(n):\n\tgrid.append(list(input()))\n\tif \"S\" in grid[i]:\n\t\ts_pos = [i,grid[i].index(\"S\")]\t\t\n\tif \"E\" in grid[i]:\n\t\te_pos = [i,grid[i].index(\"E\")]\t\t\n\ninstruction = list(map(int,list(input())))\n\n#print(s_pos,e_pos)\nfor i in a:\n\tdirection = {i[0]:\"u\",i[1]:\"d\",i[2]:\"l\",i[3]:\"r\"}\n\t#direction = {0: 'u', 1: 'r', 2: 'l', 3: 'd'}\n\tstart = [s_pos[0],s_pos[1]]\n\tfor j in instruction:\n\t\tif direction[j] == 'u':\n\t\t\tstart[0] -= 1\n\t\tif direction[j] == 'd':\n\t\t\tstart[0] += 1\n\t\tif direction[j] == 'l':\n\t\t\tstart[1] -= 1\n\t\tif direction[j] == 'r':\n\t\t\tstart[1] += 1\n\t\tif start[0] < 0 or start[1] < 0 or start[0] >= n or start[1] >= m or grid[start[0]][start[1]] == \"#\":\n\t\t\tbreak\n\t\t\n\t\tif start[0] == e_pos[0] and start[1] == e_pos[1]:\n\t\t\tcount += 1\n\t\t\tbreak\n\t\t\t\nprint(count)\t\t\t\t\n\t\t\t\t\t\t\n\t\n\n\n\n", "import itertools\r\n\t\t\r\nn = input().split(\" \")\r\nn = list(map(int, n))\r\nborder = [\"#\"] * (n[1] + 2)\r\nmaze = []\r\nmaze.append(border)\r\nfor i in range(0, n[0]):\r\n\tpath = input()\r\n\tpath = list(path)\r\n\tpath.insert(0, \"#\")\r\n\tpath.extend(\"#\")\t\r\n\tmaze.append(path)\r\n\ttry:\r\n\t\tsy = path.index(\"S\")\r\n\t\tsx = i+1\r\n\texcept ValueError:\r\n\t\tpass\r\n\r\nmaze.append(border)\r\norder = input()\r\norder = list(map(int, order))\r\ncont = 0\r\n\r\nwalks = [(-1, 0), (1, 0), (0, 1), (0, -1)]\r\nfor i in itertools.permutations(walks):\r\n\tx = sx\r\n\ty = sy\r\n\tfor k in order:\r\n\t\tdr = i[k]\r\n\t\tx += dr[0]\r\n\t\ty += dr[1]\r\n\t\tif maze[x][y] == 'E':\r\n\t\t\tcont += 1\r\n\t\t\tbreak\r\n\t\telif maze[x][y] == '#':\r\n\t\t\tbreak\r\n\r\n\r\nprint(cont)\r\n\r\n\t\t\r\n\r\n", "def judge():\r\n x, y = stx, sty\r\n for ch in s:\r\n u = ord(ch) - ord('0')\r\n x += loca[u][0]\r\n y += loca[u][1]\r\n if x < 0 or x >= n or y < 0 or y >= m or tu[x][y] == '#':\r\n return False\r\n if tu[x][y] == 'E':\r\n return True\r\n return False\r\n\r\nR = lambda : map(int, input().split())\r\nn, m = R()\r\ntu = tuple(input() for _ in range(n))\r\nfor i in range(n):\r\n for j in range(m):\r\n if tu[i][j] == 'S':\r\n stx, sty = i, j\r\ns, ans = input(), 0\r\nfrom itertools import permutations\r\nfor loca in permutations([(0, -1), (0, 1), (-1, 0), (1, 0)], 4):\r\n if judge(): ans += 1\r\nprint(ans)", "get=lambda:list(map(int,input().split()))\nn,m=get()\nM=[]\nfrom itertools import permutations\ndef follow(x,s,start): \n pos=start\n for i in s:\n pos+=x[int(i)]\n\n if not( 0<=pos.real <m and 0<=pos.imag<n) :\n return False\n q=M[int(pos.imag)][int(pos.real)]\n if q=='E':\n return True\n if q=='#':\n return False\n\n\n\nfor i in range(n):\n M.append(input())\n tmp=M[i].find('S')\n tmq=M[i].find('E')\n if tmp!=-1:\n start=complex(tmp,i)\n if tmq!=-1:\n end=complex(tmq,i)\ns= input()\nans=0\nfor i in permutations([1,-1,1j,-1j]):\n if follow(dict(zip(range(4),i)),s,start):\n ans+=1\nprint(ans)\n", "\r\ndef STR(): return list(input())\r\ndef INT(): return int(input())\r\ndef MAP(): return map(int, input().split())\r\ndef LIST(): return list(map(int, input().split()))\r\ndef STRING(): return input()\r\nfrom heapq import heappop , heappush\r\nfrom bisect import *\r\nfrom collections import deque\r\nfrom math import *\r\nfrom itertools import permutations\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\r\nn , m = MAP()\r\ng = []\r\nfor i in range(n):\r\n g.append(STRING())\r\ns = STRING()\r\ns1 , s2 = 0 , 0\r\ne1 , e2 = 0 , 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if g[i][j] == 'S':\r\n s1 , s2 = i , j\r\n\r\n if g[i][j] == 'E':\r\n e1 , e2 = i , j\r\nstart = (s1 , s2)\r\nend = (e1 , e2)\r\ndirections = ((0 , 1) , (1 , 0) , (0 , -1) , (-1, 0))\r\ncnt = 0\r\nfor i in permutations(directions , 4):\r\n k = start\r\n for j in s :\r\n h = i[int(j)]\r\n x = k[0] + h[0]\r\n y = k[1] + h[1]\r\n if not 0<=x<n or not 0<=y<m :\r\n break\r\n\r\n k = (x , y)\r\n if k == end :\r\n cnt += 1\r\n break\r\n elif g[x][y] == '#':\r\n break\r\n\r\nprint(cnt)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n" ]

[ "import math\nwhile True:\n try:\n a,b=map(int,input().split())\n except:\n break\n n=math.sqrt(a)\n n=int(n)\n bt=(n+1)*n\n if b>=bt:\n print(\"Vladik\")\n else:\n print(\"Valera\")\n", "def main():\r\n\ta , b = map(int,input().split())\r\n\ti = 1\r\n\twhile 1:\r\n\t\tif(i&1):\r\n\t\t\tif(a >= i):\r\n\t\t\t\ta -= i\r\n\t\t\telse :\r\n\t\t\t\tprint(\"Vladik\")\r\n\t\t\t\tbreak \r\n\t\telse :\r\n\t\t\tif( b >= i):\r\n\t\t\t\tb -= i\r\n\t\t\telse :\r\n\t\t\t\tprint(\"Valera\")\r\n\t\t\t\tbreak \r\n\t\ti +=1 \r\nif __name__ == '__main__':\r\n\tmain()", "vladiks_candies, valeras_candies = map(int, input().split())\r\ncandies = 1\r\n\r\nwhile True:\r\n # VLADIKS TURN\r\n if vladiks_candies >= candies:\r\n vladiks_candies -= candies\r\n else:\r\n print(\"Vladik\")\r\n break\r\n\r\n candies += 1\r\n\r\n # VALERAS TURN\r\n if valeras_candies >= candies:\r\n valeras_candies -= candies\r\n else:\r\n print(\"Valera\")\r\n break\r\n candies += 1\r\n", "a,b=map(int,input().split())\r\nt=1\r\nc=1\r\nwhile c==1 :\r\n a=a-t\r\n if a<0 :\r\n print('Vladik')\r\n break\r\n t=t+1\r\n b=b-t\r\n if b<0 :\r\n print('Valera')\r\n break\r\n t=t+1\r\n \r\n", "def main():\n from math import floor, sqrt\n [vladik, valera] = [int(_) for _ in input().split()]\n\n times_vladik = floor(sqrt(vladik))\n times_valera = next(i for i in range(floor(sqrt(valera)) + 2) if i * (i + 1) > valera)\n times_valera -= 1\n\n print('Valera' if times_vladik > times_valera else 'Vladik')\n\n\nif __name__ == '__main__':\n main()\n", "a,b = map(int,input().rstrip().split())\n\nt = True\ni = 0\nwhile True:\n i += 1\n if t:\n a -= i\n if a < 0:\n break\n else:\n b -= i\n if b < 0:\n break\n t = not t\n\nif t:\n print(\"Vladik\")\nelse:\n print(\"Valera\")\n", "a, b = [int(x) for x in input().split()]\r\nn = 0\r\ns = 0\r\nm = 0\r\ni = 1\r\nwhile s + i <= a:\r\n s += i\r\n i += 2\r\n n += 1\r\ns = 0\r\ni = 2\r\nwhile s + i <= b:\r\n s += i\r\n i += 2\r\n m += 1\r\nif n > m:\r\n print(\"Valera\")\r\nelse:\r\n print(\"Vladik\")\r\n", "v,v1=map(int,input().split())\r\ni=1\r\nwhile(v>=0 and v1>=0):\r\n\tif(i%2!=0):\r\n\t\tv=v-i\r\n\telif(i%2==0):\r\n\t\tv1=v1-i\r\n\ti=i+1\r\nif(v<0):\r\n\tprint(\"Vladik\")\r\nelse:\r\n\tprint(\"Valera\")\r\n\r\n", "import sys\r\n\r\na, b = (int(el) for el in input().split())\r\naa, bb = 1, 2\r\nfor i in range(1000_000_000):\r\n if i % 2 == 0:\r\n a -= aa\r\n if a < 0:\r\n print(\"Vladik\")\r\n sys.exit()\r\n aa += 2\r\n else:\r\n b -= bb\r\n if b < 0:\r\n print(\"Valera\")\r\n sys.exit()\r\n bb += 2\r\n \r\n ", "a, b = map(int, input().split())\r\n\r\nfor i in range(1, int(1e9 + 1)):\r\n if i % 2 == 0:\r\n if i > b:\r\n print(\"Valera\")\r\n quit()\r\n else:\r\n b -= i\r\n else:\r\n if i > a:\r\n print(\"Vladik\")\r\n quit()\r\n else:\r\n a -= i", "a, b = map(int, input().split())\r\nN = 100005\r\nrec = [0] * N\r\nrec[1] = 1\r\nrec[2] = 2\r\nfor i in range(3, N):\r\n rec[i] = rec[i - 2] + i\r\n\r\nfor i in range(1, 100005):\r\n if i % 2 != 0:\r\n if a - rec[i] < 0:\r\n print('Vladik')\r\n exit()\r\n else:\r\n if b - rec[i] < 0:\r\n print('Valera')\r\n exit()\r\n", "a,b=list(map(int,input().split()))\r\ns=1\r\naa=1\r\nbb=2\r\nfor x in range(555555555):\r\n if a-aa>=0 and b-bb>=0:\r\n if s==1:\r\n a-=aa\r\n aa+=2\r\n s=0\r\n else:\r\n b-=bb\r\n bb+=2\r\n s=1\r\n else:\r\n break\r\nif s==1:\r\n if a-aa<0:\r\n print(\"Vladik\")\r\n else:\r\n print(\"Valera\")\r\nelse:\r\n if b-bb<0:\r\n print(\"Valera\")\r\n else:\r\n print(\"Vladik\")\r\n", "s = input().split()\r\na, b = int(s[0]), int(s[1])\r\nan = int(a ** 0.5)\r\nbn = int(b ** (1/3))\r\nwhile True:\r\n if bn*(bn+1) == b:\r\n break\r\n elif bn*(bn+1) > b:\r\n bn -= 1\r\n break\r\n bn += 1\r\nprint('Vladik' if an <= bn else 'Valera')\r\n\r\n", "Vladik, Valera = map(int,input().split())\r\nVladik, Valera = int(Vladik**0.5), int((-1 + (1 + 4*Valera)**0.5)/2)\r\nprint(['Valera','Vladik'][Vladik<=Valera])", "a,b = map(int,input().split())\r\ns = int(a**(1/2))\r\nt = int((-1+(1+4*b)**(1/2))/2)\r\nif s>t:\r\n\tprint(\"Valera\")\r\nelse:\r\n\tprint(\"Vladik\")\r\n", "a ,b = map(int, input().split())\r\nc = 1\r\nwhile a>=0 and b>=0:\r\n a-=c\r\n c+=1\r\n b-=c\r\n c+=1\r\nif a<0: print('Vladik')\r\nelse: print('Valera')\r\n\r\n", "\r\nimport math\r\n\r\na,b=map(int,input().split())\r\ntemp=int(math.sqrt(2*(a+b)))\r\n\r\nn=0\r\nna=0\r\nnb=0\r\nsuma=0\r\nsumb=0\r\ni=1\r\nna=0\r\nwhile(suma<=(a)):\r\n na+=1\r\n suma+=i\r\n i+=2\r\nna-=1\r\ni=2\r\nwhile(sumb<=b):\r\n sumb+=i\r\n i+=2\r\n nb+=1\r\nnb-=1\r\n\r\nif(na>nb):\r\n print('Valera')\r\nelse:\r\n print('Vladik')\r\n\r\n\r\n\r\n ", "x = input().split()\r\na = int(x[0])\r\nb = int(x[1])\r\n\r\nb1 = False\r\nk1 = 1\r\nwhile b1==False:\r\n a-= k1\r\n k1+=1\r\n if b<k1:\r\n print(\"Valera\")\r\n break\r\n b-=k1\r\n k1+=1\r\n if a<k1:\r\n print(\"Vladik\")\r\n break\r\n ", "\na,b = map(int,input().split())\n\nacc = 1\nwhile True:\n if a - acc >= 0:\n a -=acc\n else:\n print('Vladik')\n exit(0)\n acc += 1\n if b - acc >= 0:\n b -= acc\n else:\n print('Valera')\n exit(0)\n acc += 1\n\n", "a, b = map(int, input().split())\r\nn = 1\r\nwhile a>=0 and b>=0:\r\n a-=n\r\n n+=1\r\n b-=n\r\n n+=1\r\nif a<0:\r\n print(\"Vladik\")\r\nelse:\r\n print(\"Valera\")\r\n", "vladik,valera = map(int,input().split())\r\ni=1\r\nwhile(1):\r\n if i > vladik:\r\n print('Vladik')\r\n break\r\n else:\r\n vladik-=i\r\n i+=1\r\n if i > valera:\r\n print('Valera')\r\n break\r\n else:\r\n valera-=i\r\n i+=1", "v,c=map(int,input().strip().split()[:2])\r\nk=0\r\nwhile True:\r\n\tk+=1\r\n\tif k%2!=0:\r\n\t\tif v>=k:\r\n\t\t\tv-=k\r\n\t\telse:\r\n\t\t\tprint('Vladik')\r\n\t\t\tbreak\r\n\telse:\r\n\t\tif c>=k:\r\n\t\t\tc-=k\r\n\t\telse:\r\n\t\t\tprint('Valera')\r\n\t\t\tbreak", "a,b=list(map(int,input().split()))\r\ni=1\r\nwhile True:\r\n #print(a,b,i)\r\n if i%2:\r\n a=a-i\r\n if a<0:\r\n print('Vladik')\r\n break\r\n else:\r\n b=b-i\r\n if b<0:\r\n print('Valera')\r\n break\r\n i+=1", "a,b=map(int,input().split())\r\n\r\nfor i in range(1,int(1e9),2):\r\n a-=i\r\n if a<0:\r\n print(\"Vladik\")\r\n break\r\n b-=i+1\r\n if b<0:\r\n print(\"Valera\")\r\n break\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun May 26 01:48:04 2019\r\n\r\n@author: avina\r\n\"\"\"\r\n\r\nn,m = map(int, input().split())\r\ni = 1\r\nu = False;q = False \r\nwhile True: \r\n if n < i and i%2 !=0:\r\n u = True\r\n break\r\n if m < i and i%2 ==0:\r\n q = True\r\n break\r\n if i%2 != 0:\r\n n -= i\r\n else:\r\n m-= i\r\n \r\n i+=1\r\nif q:\r\n print('Valera')\r\nif u:\r\n print('Vladik')\r\n \r\n ", "\r\na, b = map(int, input().split())\r\ni = 1\r\nf = 0\r\nwhile a >= 0 and b >= 0:\r\n if i % 2 == 1:\r\n a -= i\r\n if a < 0:\r\n print('Vladik')\r\n else:\r\n b -= i\r\n if b < 0:\r\n print('Valera')\r\n i += 1\r\n\r\n# CodeForcesian\r\n# ♥\r\n# Red Heart\r\n# خدایااااااااااا عاشقتممممممم\r\n\r\n", "a, b = map(int, input().split())\r\n\r\nrounds = 0\r\nwhile a >= 0 and b >= 0:\r\n rounds += 1\r\n if rounds % 2 == 1:\r\n a -= rounds\r\n else:\r\n b -= rounds\r\n\r\nif a < 0:\r\n print(\"Vladik\")\r\nelse:\r\n print(\"Valera\")\r\n", "n, m = map(int,input().split())\r\nt = 0\r\nwhile n>=0 and m>=0:\r\n t+=1\r\n if t%2 == 0:\r\n m = m-t\r\n else:\r\n n = n-t\r\nprint('Valera' if t%2==0 else 'Vladik')\r\n", "T = [int(x) for x in input().split()]\r\ni = 1\r\nwhile(1):\r\n if i%2 == 1:\r\n if T[0] < 0:\r\n print(\"Vladik\")\r\n break\r\n T[0] -= i\r\n i += 1\r\n \r\n else: \r\n if T[1] < 0:\r\n print(\"Valera\")\r\n break\r\n T[1] -= i\r\n i += 1\r\n \r\n \r\n \r\n\r\n", "def candies(a, b):\r\n vladik = True\r\n to_give = 1\r\n while True:\r\n if vladik:\r\n if a >= to_give:\r\n a -= to_give\r\n else:\r\n return 'Vladik'\r\n vladik = False\r\n else:\r\n if b >= to_give:\r\n b -= to_give\r\n else:\r\n return 'Valera'\r\n vladik = True\r\n to_give += 1\r\n return 'Vladik'\r\n \r\na, b = map(int, input().split())\r\nprint(candies(a, b))\r\n ", "import math\n\ndef solve():\n\ts = input()\n\ttokens = s.split()\n\ta = int(tokens[0])\n\tb = int(tokens[1])\n\tn = int(math.sqrt(a))\n\n\tapprox = n*(n + 1)\n\tif approx == b:\n\t\treturn \"Equal\"\n\telif approx > b:\n\t\treturn \"Valera\"\n\treturn \"Vladik\"\n\nresult = solve()\nif result == \"Valera\":\n\tprint(result)\nelse:\n\tprint(\"Vladik\")\n\n\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\nfrom sys import stdin, stdout\r\n\r\ndef main():\r\n\ta, b = [int(_) for _ in input().split()]\r\n\r\n\tmoveA = 0\r\n\tn = 1\r\n\twhile a >= n:\r\n\t\ta -= n\r\n\t\tn += 2\r\n\t\tmoveA += 1\r\n\r\n\tmoveB = 0\r\n\tn = 2\r\n\twhile b >= n:\r\n\t\tb -= n\r\n\t\tn += 2\r\n\t\tmoveB += 1\r\n\r\n\tif moveA <= moveB:\r\n\t\tstdout.write('Vladik' + '\\n')\r\n\telse:\r\n\t\tstdout.write('Valera' + '\\n')\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n ", "a,b=map(int,input().split())\r\ni=1\r\nc=1\r\nd=2\r\nwhile True:\r\n if i%2!=0:\r\n a-=c\r\n c+=2\r\n elif i%2==0:\r\n b-=d\r\n d+=2\r\n if a<0:\r\n print(\"Vladik\")\r\n break\r\n if b<0:\r\n print(\"Valera\")\r\n break\r\n i+=1\r\n", "a, b = map(int, input().split())\nl = 2\nk = 1\nwhile True:\n\tif a - k >= 0:\n\t\ta -= k\n\t\tk += 2\n\telse:\n\t\tprint('Vladik')\n\t\tbreak\n\tif b - l >= 0:\n\t\tb -= l\n\t\tl += 2\n\telse:\n\t\tprint('Valera')\n\t\tbreak\n", "a , b = map(int,input().split())\n\ni=0\n\nwhile 1:\n\ti+=1\n\tif a - i <0 :\n\t\tprint('Vladik')\n\t\tbreak\n\telse :\n\t\ta-=i\n\t\ti+=1\n\tif b-i < 0 :\n\t\tprint('Valera')\n\t\tbreak\n\telse : \n\t\tb-= i\n\n", "a, b = map(int, input().split())\r\ni = 1\r\nt = True\r\nwhile True:\r\n if t:\r\n a -= i\r\n if a < 0:\r\n print (\"Vladik\")\r\n break\r\n else:\r\n b -= i\r\n if b < 0:\r\n print (\"Valera\")\r\n break\r\n t = not t\r\n i += 1\r\n", "a,b= [int(x) for x in input().split()]\r\ni=1\r\nvladik=True\r\nnoResult=True\r\nwhile noResult:\r\n\tif vladik:\r\n\t\tif a>=i:\r\n\t\t\ta-=i\r\n\t\t\tvladik=False\r\n\t\telse:\r\n\t\t\tprint(\"Vladik\")\r\n\t\t\tnoResult=False\r\n\telse:\r\n\t\tif b>=i:\r\n\t\t\tb-=i\r\n\t\t\tvladik=True\r\n\t\telse:\r\n\t\t\tprint(\"Valera\")\r\n\t\t\tnoResult=False\r\n\t\r\n\ti+=1", "def main():\r\n a,b = map(int, input().split())\r\n\r\n dif = 1\r\n while True:\r\n if dif%2 == 1:\r\n if a >= dif:\r\n a -= dif\r\n else:\r\n print(\"Vladik\")\r\n return\r\n else:\r\n if b >= dif:\r\n b -= dif\r\n else:\r\n print(\"Valera\")\r\n return\r\n dif += 1\r\n\r\n\r\nif __name__ == \"__main__\":\r\n # global stime\r\n # stime = time.clock()\r\n main()\r\n\r\n", "a, b = map(int, input().split())\r\n\r\nx = 1\r\n\r\nwhile(True):\r\n if x > a:\r\n print(\"Vladik\")\r\n exit(0)\r\n else:\r\n a -= x\r\n x+=1\r\n if x> b:\r\n print(\"Valera\")\r\n exit(0)\r\n else:\r\n b -= x\r\n x+=1 ", "import math\r\na,b =map(int,input().split())\r\n\r\nn=int(math.sqrt(a))\r\n\r\nres=0\r\n\r\nfor i in range(1,b):\r\n if(i*i+i>b):\r\n break\r\n else :\r\n res+=1\r\n \r\nif(n<=res):\r\n print(\"Vladik\")\r\n \r\nelse:\r\n print(\"Valera\")\r\n", "a,b = map(int,input().split())\r\ncount = 0\r\na1 = 1\r\nb1 = 2\r\nwhile(True):\r\n a-=a1\r\n if(a<0):\r\n print(\"Vladik\")\r\n break\r\n b-=b1\r\n if(b<0):\r\n print(\"Valera\")\r\n break\r\n a1+=2\r\n b1+=2", "from math import floor\r\na,b=map(int,input().split())\r\nprint('VVallaedriak'[b>=int(a**0.5)*(int(a**0.5)+1)::2])", "a,b=map(int,input().split())\nflag=0\ncount=1\ndif=0\ntemp=0\nwhile temp==0:\n if flag==0:\n a=a-count\n flag=1\n count +=1\n if a<0:\n print(\"Vladik\")\n\n break\n if flag==1:\n b=b-count\n count += 1\n flag=0\n if b<0:\n print(\"Valera\")\n\n break\n\n# print(a)\n# print(b)\n# print(flag)", "t= list(map(int, input().split()))\r\ni=1\r\nwhile i>-1:\r\n t[0]= t[0]-i\r\n t[1]= t[1]-(i+1)\r\n i= i+2\r\n if t[0]<0:\r\n print(\"Vladik\")\r\n break\r\n elif t[1]<0:\r\n print(\"Valera\")\r\n break\r\n \r\n\r\n", "a, b = [int(x) for x in input().split()]\nnum = 0\ngive = 1\nwhile True:\n if num % 2 == 0:\n if a - give >= 0:\n a -= give\n give += 1\n num += 1\n else:\n print(\"Vladik\")\n break\n else:\n if b - give >= 0:\n b -= give\n give += 1\n num += 1\n else:\n print(\"Valera\")\n break\n", "ans = -1\r\na, b = map(int, input().split())\r\ni = 1\r\nwhile(a >= 0 and b >= 0):\r\n if(i%2):\r\n if(a - i >= 0):a -= i\r\n else:ans = 0;break\r\n else:\r\n if(b - i >= 0):b -= i\r\n else:ans = 1;break\r\n i += 1\r\nif(ans) :print(\"Valera\")\r\nelse: print(\"Vladik\")", "a,b=map(int,input().split())\r\ny=True\r\ni=0\r\nwhile y:\r\n if i%2==0:\r\n a-=i+1\r\n if a<0:\r\n y=False\r\n else:\r\n b-=i+1\r\n if b<0:\r\n y=False\r\n i+=1\r\nelse:\r\n if (i-1)%2==0:\r\n print(\"Vladik\")\r\n else:\r\n print(\"Valera\")", "a, b = map(int, input().split())\r\ni = 1\r\nj = 2\r\nwhile a>=0 and b>=0:\r\n a -= i\r\n b -= j\r\n i += 2\r\n j += 2\r\n\r\nif a<0:\r\n print(\"Vladik\")\r\nelse:\r\n print(\"Valera\")", "n ,m = map(int, input().split())\r\ni = 1\r\nwhile n>=0 and m>=0:\r\n n=n-i\r\n i=i+1\r\n m=m-i\r\n i=i+1\r\nif n<0:\r\n print('Vladik')\r\nelse:\r\n print('Valera')", "a, b = map(int, input().split(\" \"))\nstep = 1\nwhile True:\n if a < step:\n print(\"Vladik\")\n exit()\n a -= step\n if b < step+1:\n print(\"Valera\")\n exit()\n b -= step+1\n step += 2\n", "l=input().split()\r\na=int(l[0])\r\nb=int(l[1])\r\ncurr=1\r\ncount=0\r\nwhile(a>=0):\r\n a-=curr\r\n curr+=2\r\n count+=1\r\ncurr=2\r\ncounter=0\r\nwhile(b>=0):\r\n b-=curr\r\n curr+=2\r\n counter+=1\r\nif(count<=counter):\r\n print(\"Vladik\")\r\nelse:\r\n print(\"Valera\")\r\n", "vd, vl=map(int, input().split())\r\n#print(vd, vl)\r\ni=1\r\nwhile(1):\r\n if(i%2):\r\n vd=vd-i\r\n i=i+1\r\n if(vl<i):\r\n print(\"Valera\")\r\n break\r\n \r\n \r\n \r\n else:\r\n vl=vl-i\r\n i=i+1\r\n if(vd<i):\r\n print(\"Vladik\")\r\n break", "R = lambda: map(int,input().split())\r\na,b = R()\r\np = 0\r\nwhile True:\r\n if p % 2 != 0:\r\n if a >= p:\r\n a -= p\r\n p += 1\r\n else:\r\n exit(print('Vladik'))\r\n else:\r\n if b >= p:\r\n b -= p\r\n p += 1\r\n else:\r\n exit(print('Valera'))\r\n\r\n", "a, b = input().split(\" \")\r\na = int(a)\r\nb = int(b)\r\n\r\ntemp = 0\r\nturn = True\r\nwhile True:\r\n temp += 1\r\n if turn:\r\n a -= temp\r\n else:\r\n b -= temp\r\n \r\n if a < 0:\r\n print(\"Vladik\")\r\n break\r\n if b < 0:\r\n print(\"Valera\")\r\n break\r\n turn = not turn", "import math\r\n\r\n\r\nl1=[int(i) for i in input().split()]\r\na=l1[0] #vladik\r\nb=l1[-1] #valera\r\nna=int(math.floor(a**0.5))\r\nnb=int(((((4*b)+1)**0.5)-1)/2)\r\nif na<=nb:\r\n print(\"Vladik\")\r\nelse :\r\n print(\"Valera\")", "a , b = list(map(int,input().split()))\r\nv1 = (int)(a**0.5)\r\nv2 = (-1 + (int)((1 + 4*b)**0.5))//2\r\nif v1 > v2:\r\n print('Valera')\r\nelse:\r\n print('Vladik')\r\n", "a , b = map(int, input().split())\r\nfor i in range(1 , max(a,b) + 2):\r\n if i % 2 == 0:\r\n if i > b:\r\n print(\"Valera\")\r\n break\r\n else: b -= i\r\n else:\r\n if i > a:\r\n print(\"Vladik\")\r\n break\r\n else: a -= i\r\n", "import math\r\na,b=map(int,input().split())\r\nk=math.ceil(b**0.5)\r\nif (k-1)*k>b:\r\n w=2*k-1\r\nelif k*(k+1)>b:\r\n w=2*k\r\nif (w//2)**2-a>0:\r\n print('Vladik')\r\nelse:\r\n print('Valera')\r\n", "a, b = map(int, input().split())\r\ncurr = 1\r\nwhile True:\r\n if curr % 2 == 1:\r\n a -= curr\r\n if curr % 2 == 0:\r\n b -= curr\r\n curr += 1\r\n if a < 0:\r\n print(\"Vladik\")\r\n exit()\r\n if b < 0:\r\n print(\"Valera\")\r\n exit()\r\n", "a, b = map(int, input().split())\r\n\r\nn1 = int(a ** 0.5)\r\nn2 = (-1 + (1 + 4 * b) ** 0.5) // 2\r\n\r\n##print(n1, n2)\r\n\r\nprint('Valera' if n1 > n2 else 'Vladik')\r\n", "a,b = map(int,input().split())\r\ncur = 1\r\nwhile a >= 0 and b >= 0:\r\n if a < cur:\r\n print(\"Vladik\")\r\n break\r\n a -= cur\r\n cur += 1\r\n if b < cur:\r\n print(\"Valera\")\r\n break\r\n b -= cur\r\n cur += 1\r\n \r\n", "def do(a,b):\r\n step=0\r\n #print(a,b)\r\n while True:\r\n if step&1:\r\n if a-step<0:\r\n return \"Vladik\"\r\n else:\r\n a=a-step\r\n if step&1==0:\r\n if b-step<0:\r\n return \"Valera\"\r\n else:\r\n b=b-step\r\n #print(step,a,b)\r\n step=step+1\r\n \r\na,b=map(int,input().split())\r\nprint(do(a,b))", "import math\r\n\r\ninp = input()\r\ninp = inp.split(' ')\r\na = int(inp[0])\r\nb = int(inp[1])\r\n\r\nleft = 0\r\nright = 100000\r\nwhile left < right:\r\n mid = (left + right + 1) // 2\r\n if mid**2 <= a:\r\n left = mid\r\n else:\r\n right = mid - 1\r\na = left\r\nleft = 0\r\nright = 100000\r\nwhile left < right:\r\n mid = (left + right + 1) // 2\r\n if (mid * (mid + 1) // 2) - int(math.ceil(mid // 2))**2 <= b:\r\n left = mid\r\n else:\r\n right = mid - 1\r\nb = left // 2\r\nif a <= b:\r\n print(\"Vladik\")\r\nelse:\r\n print(\"Valera\")\r\n", "vladik, valera = [int(x) for x in input().split()]\r\ni = 1\r\nwhile 1:\r\n vladik -= i\r\n if vladik < 0:\r\n print(\"Vladik\")\r\n exit()\r\n valera -= i+1\r\n if valera < 0:\r\n print(\"Valera\")\r\n exit()\r\n i+= 2", "a,b=map(int,input().split())\r\nx=1\r\nwhile True:\r\n a-=x\r\n x+=1\r\n if a<0:\r\n print('Vladik')\r\n quit()\r\n b-=x\r\n x+=1\r\n if b<0:\r\n print('Valera')\r\n quit()\r\n \r\n", "a, b = map(int, input().strip().split())\r\n\r\nvla_times = int(a**0.5)\r\n\r\nval_times = int(((4*b+1)**0.5 - 1)/2)\r\n\r\nif vla_times > val_times:\r\n print('Valera')\r\nelse:\r\n print('Vladik')\r\n", "a, b = map(int, input().split())\r\nprint('Valera' if int(a ** .5) > int(((4 * b + 1) ** .5 - 1) / 2) else 'Vladik')", "a,b=map(int,input().split())\r\ni=1\r\nwhile i<=a or i<=b:\r\n\tif a>=i:\r\n\t\ta-=i\r\n\telse:\r\n\t\tprint(\"Vladik\")\r\n\t\tbreak\r\n\ti+=1\r\n\tif b>=i:\r\n\t\tb-=i\r\n\telse:\r\n\t\tprint(\"Valera\")\r\n\t\tbreak\r\n\ti+=1\r\n\tif a<i:\r\n\t\tprint(\"Vladik\")\r\n\t\tbreak\r\n", "'''input\n7 6\n'''\na, b = map(int, input().split())\nn = int(a**0.5)\nprint(\"Vladik\" if n*(n+1) <= b else \"Valera\")\n\n", "a, b = map(int, input().split())\r\nc = t = 1\r\nwhile 1:\r\n if t == 1:\r\n if a < c:\r\n print('Vladik')\r\n break\r\n a -= c\r\n else:\r\n if b < c:\r\n print('Valera')\r\n break\r\n b -= c\r\n c += 1\r\n t ^= 1", "import itertools\r\na, b = map(int, input().split())\r\nc1, c2 = 0, 0\r\ni1, i2 = 0, 0\r\nfor i in itertools.count(1, 2):\r\n c1 += i\r\n if c1 > a:\r\n break\r\n i1 += 1\r\nfor i in itertools.count(2, 2):\r\n c2 += i\r\n if c2 > b:\r\n break\r\n i2 += 1\r\nprint('Valera' if c1>=c2 else 'Vladik')", "a,b=map(int,input().split())\nprint('VVlaaldeirka'[((4*b+1)**.5-1)//2<a**.5//1::2])\t", "l=list(map(int,input().split()))\r\n \r\nvl=l[0]\r\nva=l[1]\r\nk=1\r\nwhile(True):\r\n if k>vl:\r\n print(\"Vladik\")\r\n break\r\n else:\r\n vl-=k\r\n k+=1\r\n if k>va:\r\n print(\"Valera\")\r\n break\r\n else:\r\n va-=k\r\n k+=1\r\n \r\n", "#python3\r\n#utf-8\r\n\r\nvladiks_nr, valeras_nr = (int(x) for x in input().split())\r\n\r\ncurr_player = 0\r\ncurr_nr = vladiks_nr\r\ncurr_bet = 1\r\n\r\nwhile curr_nr >= curr_bet:\r\n if curr_player == 0:\r\n vladiks_nr -= curr_bet\r\n curr_bet += 1\r\n curr_player = 1\r\n curr_nr = valeras_nr\r\n elif curr_player == 1:\r\n valeras_nr -= curr_bet\r\n curr_bet += 1\r\n curr_player = 0\r\n curr_nr = vladiks_nr\r\nif curr_player == 0:\r\n print('Vladik')\r\nelse:\r\n print('Valera')\r\n", "a, b=map(int,input().split())\r\nprint(\"Vladik\" if int(a**0.5)*(int(a**0.5)+1)<=b else \"Valera\") ", "a,b=[int(i) for i in input().split()]\r\ncount=1\r\nwhile(True):\r\n if(count%2==1):\r\n if(a>=count):\r\n a-=count\r\n count+=1\r\n else:\r\n print(\"Vladik\")\r\n break\r\n else:\r\n if(b>=count):\r\n b-=count\r\n count+=1\r\n else:\r\n print(\"Valera\")\r\n break\r\n \r\n \r\n \r\n", "import sys\n\na, b = map(int, sys.stdin.readline().split())\n\npersions = ['Vladik', 'Valera']\nturn = True\nnum = 1\n\nwhile True:\n if turn:\n if a < num:\n break\n a -= num\n turn = False\n else:\n if b < num:\n break\n b -= num\n turn = True\n\n num += 1\n\nif turn:\n print(persions[0])\nelse:\n print(persions[1])\n\n", "vla,val=(int(x) for x in input().split())\n\ncan=1\nwhile True:\n\tif vla<can:\n\t\tprint(\"Vladik\")\n\t\tbreak\n\tvla-=can\n\tcan+=1\n\tif val<can:\n\t\tprint(\"Valera\")\n\t\tbreak\n\tval-=can\n\tcan+=1\n", "vla, val = map(int,input().split())\r\n\r\nc1 = 1\r\nc2 = 2\r\nct = 1\r\nwhile True:\r\n if ct % 2 == 1:\r\n if vla < c1:\r\n print(\"Vladik\")\r\n break\r\n vla -= c1\r\n c1 += 2 \r\n else:\r\n if val < c2:\r\n print(\"Valera\")\r\n break\r\n val -= c2\r\n c2 += 2\r\n ct += 1", "import itertools\r\nfrom math import sqrt\r\n\r\n\r\ndef main():\r\n n,m = [int(v) for v in input().split()]\r\n\r\n a1 = int(sqrt(n))\r\n\r\n if a1*a1+a1>m:\r\n print(\"Valera\")\r\n else:\r\n print(\"Vladik\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "# encoding: utf-8\r\nvl, va = list(map(int, input().split()))\r\n\r\nn1 = int(vl**0.5)\r\nd = 1 + 4*va\r\nn2 = int((-1 + d**0.5)/2)\r\nif n1 > n2:\r\n print('Valera')\r\nelse:\r\n print('Vladik')\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\ndef ari_sum(n:int, a:int, d:int): return int(n/2 * (2*a+(n-1)*d))\r\n\r\n\r\ndef main():\r\n a, b = IA()\r\n i = j = 1 \r\n while ari_sum(i, 1, 2) <= a:\r\n i += 1\r\n if ari_sum(i, 1, 2) > a:\r\n i -= 1 \r\n while ari_sum(j, 2, 2) <= b:\r\n j += 1\r\n if ari_sum(j, 2, 2) > b:\r\n j -= 1 \r\n res = 'Valera' if i > j else 'Vladik'\r\n return res\r\n\r\nif __name__ == '__main__':\r\n print(main())", "a,b = map(int,input().split())\r\ni = 0\r\nd = 0\r\nwhile a>=0 and b>=0:\r\n if i%2 == 0 and i>0:\r\n if b-d>=0:\r\n b-=d\r\n i+=1\r\n d+=1\r\n else:\r\n print('Valera')\r\n break\r\n elif a-d>=0:\r\n a-=d\r\n i+=1\r\n d+=1\r\n else:\r\n print('Vladik')\r\n break\r\n \r\n \r\n\r\n \r\n", "a, b = map(int, input().split())\r\ni = 1\r\nwhile a >= 0 and b >= 0:\r\n a -= i\r\n i += 1\r\n b -= i\r\n i += 1\r\nif a < 0:\r\n print(\"Vladik\")\r\nelse:\r\n print(\"Valera\")", "a = list(map(int, input().split()))\r\nd, i = 1, 0\r\n\r\nwhile a[i] >= d:\r\n a[i] -= d\r\n i = (i + 1) % 2\r\n d += 1\r\n\r\nif i == 0:\r\n print(\"Vladik\")\r\nelse:\r\n print(\"Valera\")\r\n", "a,b=map(int,input().split())\nl=1\nr=10**9\ndef s(n): return n*(n+1)//2\nwhile r-l>1:\n m=(l+r)//2\n x=2*s((m+1)//2)-(m+1)//2\n y=2*s(m//2)\n if x<=a and y<=b:\n l=m\n else:\n r=m\nprint(\"Valera\" if l%2==1 else \"Vladik\")\n", "a,b=map(int, input().split())\r\nx=True;i=1\r\nwhile x==True:\r\n if i%2==1: a-=i\r\n else: b-=i\r\n i+=1\r\n if a<0 or b<0:\r\n print('Vladik' if a<0 else 'Valera')\r\n x=False\r\n ", "naman, vidit = map(int, input().split())\r\nn = 1\r\nn1 = 0\r\nv = 2\r\nv1 = 0\r\nwhile(naman >= 0):\r\n\tnaman-=n \r\n\t# vidit-=v\r\n\tn+=2\r\n\tn1+=1\r\n\t# v+=2\r\nwhile(vidit>=0):\r\n\tvidit-=v\r\n\tv+=2\r\n\tv1+=1\r\nif(n1>v1):\r\n\tprint(\"Valera\")\r\nelse:\r\n\tprint(\"Vladik\")", "a,b = input().split()\r\na = int(a)\r\nb = int(b)\r\n\r\ni=1\r\nl=0\r\nctr1=0\r\nwhile True:\r\n l += i\r\n i += 2\r\n if l > a:\r\n break\r\n ctr1 += 1\r\n \r\n \r\ni=2\r\nr=0\r\nctr2=0\r\nwhile True:\r\n r += i\r\n i += 2\r\n if r > b:\r\n break\r\n ctr2 += 1\r\n \r\nif ctr1>ctr2:\r\n print(\"Valera\")\r\nelse:\r\n print(\"Vladik\")", "#n = int(input())\nn, m = map(int, input().split())\n#s = input()\n#c = list(map(int, input().split()))\ni = 1\nwhile True:\n n -= i\n if n < 0:\n print('Vladik')\n break\n i += 1\n m -= i\n if m < 0:\n print('Valera')\n break\n i += 1", "def main_function():\r\n a, b = [int(i) for i in input().split(\" \")]\r\n a_minus = 1\r\n b_minus = 2\r\n while True:\r\n if a < a_minus:\r\n return \"Vladik\"\r\n a -= a_minus\r\n if b < b_minus:\r\n return \"Valera\"\r\n b -= b_minus\r\n a_minus, b_minus = a_minus + 2, b_minus + 2\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nprint(main_function())", "n, m = [int(i) for i in input().split()]\r\nfor i in range(1, 1000000000):\r\n if i%2 == 0:\r\n m -= i\r\n else:\r\n n -= i\r\n if m < 0:\r\n print(\"Valera\")\r\n break\r\n if n < 0:\r\n print(\"Vladik\")\r\n break", "import math\r\narr = input().split()\r\na = int(arr[0])\r\nb = int(arr[1])\r\n\r\ni = 1\r\nwhile a >= 0 and b >= 0:\r\n\tif i % 2 == 0:\r\n\t\tb -= i\r\n\telse:\r\n\t\ta -= i\r\n\ti += 1\r\n\r\nif a < 0:\r\n\tprint('Vladik')\r\nelse:\r\n\tprint('Valera')", "a,b=map(int,input().split())\r\ni=1\r\nwhile(1):\r\n if a-i<0:\r\n print(\"Vladik\")\r\n break\r\n else:\r\n a=a-i\r\n if b-(i+1)<0:\r\n print(\"Valera\")\r\n break\r\n else:\r\n b=b-(i+1)\r\n i=i+2 ", "a,b=map(int,input().split())\r\nc=0\r\nwhile(True):\r\n c+=1\r\n a=a-c\r\n if(a<0):\r\n print(\"Vladik\")\r\n exit()\r\n c+=1\r\n b=b-c\r\n if(b<0):\r\n print(\"Valera\")\r\n exit()\r\n \r\n", "a, b=map (int, input (). split ()) \nn1, n2=0,0\nup=10**9\nlow=0\nwhile up>low:\n m=(up+low)//2\n last=2*m-1\n tot=(1+last)*m//2\n if tot>a:\n up=m\n elif tot<a :\n low=m+1\n n1=max(n1, m) \n else :\n n1=m\n break \nup=10**9\nlow=0 \nwhile up>low:\n m=(up+low)//2\n last=2*m\n tot=(2+last)*m//2\n if tot>b:\n up=m\n elif tot<b:\n low=m+1\n n2=max(n2,m)\n else :\n n2=m\n break \nif n1>n2:\n print (\"Valera\") \nelse :\n print (\"Vladik\") ", "a,b=[int(i) for i in input().split(\" \")]\r\nc=0\r\nwhile True:\r\n if c%2==0:\r\n c+=1\r\n if (a-c)>=0:\r\n a-=c\r\n else:\r\n print(\"Vladik\")\r\n break\r\n else:\r\n c+=1\r\n if (b-c)>=0:\r\n b-=c\r\n else:\r\n print(\"Valera\")\r\n break\r\n \r\n\r\n\r\n", "a,b=[int(i) for i in input().split()]\r\nt=1\r\np=2\r\nwhile True:\r\n if a>=t:\r\n a-=t\r\n t+=2\r\n else:\r\n print('Vladik')\r\n break\r\n if b>=p:\r\n b-=p\r\n p+=2\r\n else:\r\n print('Valera')\r\n break\r\n", "string = input()\r\nnumbers = string.split()\r\na = int(numbers[0])\r\nb = int(numbers[1])\r\nn = 0\r\nwhile True:\r\n n += 1\r\n if n % 2 == 0:\r\n b -= n\r\n if b < 0:\r\n print(\"Valera\")\r\n break\r\n else:\r\n a -= n\r\n if a < 0:\r\n print(\"Vladik\")\r\n break", "a,b = map(int,input().split())\r\ni =1\r\nwhile a>=0 and b>=0:\r\n\tif i%2!=0:\r\n\t\ta-=i\r\n\telse:\r\n\t\tb-=i\r\n\ti+=1\r\nif a<0:print(\"Vladik\")\r\nelse:print(\"Valera\")", "s = input().split()\r\na = int(s[0])\r\nb = int(s[1])\r\n\r\ni = 1\r\nwhile i:\r\n if i % 2 > 0:\r\n if a < i:\r\n print(\"Vladik\")\r\n break\r\n else:\r\n a -= i\r\n else:\r\n if b < i:\r\n print(\"Valera\")\r\n break\r\n else:\r\n b -= i\r\n i += 1\r\n", "a,b=[int(i) for i in input().split(\" \")]\r\nx=0\r\nwhile x*x<=a:\r\n x+=1\r\nmovesa=x-1\r\nx=0\r\nwhile x*x+x<=b:\r\n x+=1\r\nmovesb=x-1\r\nif(movesb<movesa):\r\n print('Valera')\r\nelse:\r\n print('Vladik')\r\n", "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\nfor i in range(100000):\r\n a -= 2 * i + 1\r\n if a < 0:\r\n ans = \"Vladik\"\r\n break\r\n b -= 2 * i + 2\r\n if b < 0:\r\n ans = \"Valera\"\r\n break\r\nprint(ans)", "\"\"\"\r\n7 6\r\n\r\n6 6\r\n6 4\r\n3 4\r\n3 0\r\n\r\nodd = n * n\r\neven = n * (n + 1)\r\n10 15\r\n\r\n9 12\r\n1 3\r\n\r\n2*n-1\r\n\r\n9 15 -1\r\n9 13 -2\r\n6 13 -3\r\n6 9 -4\r\n1 9 -5\r\n1 3 - 6\r\n\r\n3 2\r\n2 2 ->1\r\n2 0 ->2\r\n\r\n1 3 5 7 => 16\r\n2 4 6 8 => 20\r\n\r\nodd = n * n\r\neven = n * (n + 1)\r\n7 6\r\n\r\n4 6\r\n3 0\r\n5 8\r\n\r\n\r\n\r\n\r\n6 6 -1\r\n6 4 -2\r\n3 4 -3\r\n3 0 -4\r\n\r\n\r\n\"\"\"\r\nimport sys\r\nimport math\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#\r\na, b = invr()\r\n\r\ni = 1\r\n\r\nwhile True:\r\n a -= i\r\n b -= i+1\r\n i += 2\r\n if a < 0:\r\n print(\"Vladik\")\r\n break\r\n if b < 0:\r\n print(\"Valera\")\r\n break\r\n", "import math\r\na,b = map(int,input().split())\r\nstepa = math.floor(math.sqrt(a))\r\nn = 0\r\nwhile n*(n+1)<=b:\r\n n+=1\r\nn = n-1\r\nif n>=stepa:\r\n print('Vladik')\r\nelse:\r\n print('Valera')", "import sys\r\nfrom math import sqrt\r\n\r\ndef main():\r\n a,b=list(map(int,sys.stdin.readline().split()))\r\n \r\n nvladik=int(sqrt(a))\r\n nvalera=int((-1+sqrt(1+4*b))/2)\r\n \r\n if nvladik<=nvalera: result='Vladik'\r\n else: result='Valera'\r\n \r\n sys.stdout.write(result+'\\n')\r\n \r\nmain()\r\n\r\n", "# print(\"Input a and b\")\na,b = [int(x) for x in input().split()]\n\nn = 1\nwhile True:\n if n%2 == 1:\n if a - ((n-1)//2) * ((n-1)//2) < 0:\n print(\"Vladik\")\n break\n elif b - ((n//2)*(n//2)) + n//2 < 0:\n print(\"Valera\")\n break\n n += 1\n \n", "import math\r\n\r\ndef quadratic_formula(a, b, c):\r\n answer = ((b * -1) + math.sqrt((b*b) - (4 * a * c))) / (2 * a)\r\n return answer\r\n\r\ndef find_n_arithmetic_sum(total, first, difference = 2):\r\n n = quadratic_formula(difference, (2*first)-difference, 2*total*-1)\r\n n = n // 1\r\n return n\r\n\r\ndef main():\r\n a = b = 0\r\n an = bn = 0\r\n \r\n a,b = map(int, input().split())\r\n \r\n an = find_n_arithmetic_sum(a,1)\r\n bn = find_n_arithmetic_sum(b,2)\r\n \r\n if an > bn:\r\n print(\"Valera\")\r\n else:\r\n print(\"Vladik\")\r\n \r\n return\r\n\r\nmain()", "a,b=map(int,input().split())\r\nn=int(a**0.5)\r\n#print(n)\r\nif n*(n+1)<=b:\r\n print(\"Vladik\")\r\nelse:\r\n print(\"Valera\")\r\n", "\r\na,b=map(int,input().split())\r\nres1=int(a**.5)\r\nres2=int(((b+.25)**.5)-.5)\r\nif(res1==res2):\r\n print('Vladik')\r\nelif(res1>res2):\r\n print('Valera')\r\nelse:\r\n print('Vladik')", "n, v = [int(i) for i in input().split()]\r\ni=0\r\nj=1\r\nwhile True:\r\n if i%2==0:\r\n if n>=j:\r\n n-=j\r\n j+=1\r\n i=(i+1)%2\r\n else:\r\n print('Vladik')\r\n break\r\n else:\r\n if v>=j:\r\n v-=j\r\n j+=1\r\n i=(i+1)%2\r\n else:\r\n print('Valera')\r\n break", "vladik,valera=map(int, input().split())\r\nn=1\r\nwhile 1:\r\n\tif n%2==1:\r\n\t\tvladik-=n\r\n\t\tif vladik<0:\r\n\t\t\tprint (\"Vladik\")\r\n\t\t\tbreak\r\n\telse:\r\n\t\tvalera-=n\r\n\t\tif valera<0:\r\n\t\t\tprint (\"Valera\")\r\n\t\t\tbreak\r\n\tn+=1\r\n", "a ,b = map(int, input().split())\r\nd = 1\r\nwhile a>=0 and b>=0:\r\n a=a-d\r\n d=d+1\r\n b=b-d\r\n d=d+1\r\nif a<0: \r\n print('Vladik')\r\nelse: \r\n print('Valera')", "#!/usr/bin/env python3\n# coding=utf-8\nans=[\"Vladik\",\"Valera\"]\ns=input()\ns=s.split()\ns[0]=int(s[0])\ns[1]=int(s[1])\np=1;\nwhile 1:\n s[(p+1)%2]-=p\n if s[(p+1)%2]<0:\n print(ans[(p+1)%2])\n break\n p+=1\n\n", "a, b = [int(s) for s in input().split()]\r\ni = 1\r\nwhile a >= 0 and b >= 0:\r\n if i % 2 == 0:\r\n b -= i\r\n else:\r\n a -= i\r\n if a < 0:\r\n print('Vladik')\r\n if b < 0:\r\n print('Valera')\r\n i -=- 1\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\na, b = rint()\n\nfor i in range(1, 10**9):\n if i%2:\n a -= i\n else:\n b -= i\n\n if a < 0:\n print(\"Vladik\")\n exit()\n if b < 0:\n print(\"Valera\")\n exit()\n", "inp = input().split(' ')\r\nvladik = int(inp[0])\r\nvalera = int(inp[1])\r\nsub = 1\r\nwhile(vladik>=0 and valera>=0):\r\n\tif sub%2!=0:\r\n\t\tvladik-=sub\r\n\t\tsub+=1\r\n\telif sub%2==0:\r\n\t\tvalera-=sub\r\n\t\tsub+=1\r\n\tif(valera<0):\r\n\t\tprint(\"Valera\")\r\n\t\tbreak\r\n\telif(vladik<0):\r\n\t\tprint(\"Vladik\")\r\n\t\tbreak", "\nfrom math import sqrt, floor\n\na, b = map(int, input().split())\n\nx = sqrt(a)\ny = (-1 + sqrt(1 + 4*b)) / 2\n\nx = floor(x)\ny = floor(y)\n\nif x <= y:\n print('Vladik')\nelse:\n print('Valera')\n", "candy=[int(i) for i in input().split()]\r\ni=0\r\nkov=0\r\nwhile True:\r\n i+=1\r\n if candy[kov] < i:\r\n print(\"Vladik\" if kov==0 else \"Valera\")\r\n break\r\n candy[kov]-=i\r\n kov=1-kov", "a, b = map(int, input().split())\r\n \r\ndiff=1;count=0\r\nwhile True:\r\n\tif not count%2:\r\n\t\ta-=diff\r\n\t\tdiff+=1\r\n\telse:\r\n\t\tb-=diff\r\n\t\tdiff+=1\r\n\tif a<0:\r\n\t\tbreak\r\n\telif b<0:\r\n\t\tbreak\r\n\tcount+=1\r\nif count%2:\r\n\tprint(\"Valera\")\r\nelse:\r\n\tprint(\"Vladik\")", "import math\r\nx,y=map(int,input().split());m=round(math.sqrt(x)-math.sqrt(x)%1);n=y-round(math.sqrt(y)-math.sqrt(y)%1);a=round(math.sqrt(n)-math.sqrt(n)%1);n=a\r\nprint('Vladik' if m==n or n>m else 'Valera')", "vladik, valera = map(int, input().split())\r\ni = 1\r\nj = 1\r\nwhile True:\r\n if j % 2 == 1:\r\n if vladik < i:\r\n print(\"Vladik\")\r\n break\r\n else:\r\n vladik -= i\r\n else:\r\n if valera < i:\r\n print(\"Valera\")\r\n break\r\n else:\r\n valera -= i\r\n i += 1\r\n j += 1\r\n", "##n = int(input())\r\n##a = list(map(int, input().split()))\r\n##print(' '.join(map(str, res)))\r\n\r\n[a, b] = list(map(int, input().split()))\r\nx = 1\r\nwhile True:\r\n if x%2 == 1:\r\n if a < x:\r\n print('Vladik')\r\n exit(0)\r\n a -= x\r\n else:\r\n if b < x:\r\n print('Valera')\r\n exit(0)\r\n b -= x\r\n x += 1", "a, b = [int(i) for i in input().split()]\r\nc = 1\r\n\r\nwhile True:\r\n if (c % 2 == 0):\r\n b -= c\r\n\r\n if (b < 0):\r\n print(\"Valera\")\r\n break\r\n else:\r\n a -= c\r\n\r\n if (a < 0):\r\n print(\"Vladik\")\r\n break\r\n \r\n c += 1", "a, b = map(int, input().split())\r\nn = 1\r\nwhile True:\r\n if a < n:\r\n print(\"Vladik\")\r\n exit()\r\n else:\r\n a -= n\r\n n += 1\r\n if b < n:\r\n print(\"Valera\")\r\n exit()\r\n else:\r\n b -= n\r\n n += 1", "line1 = list(map(lambda x: int(x), input().split()))\r\namt = 1\r\nwho = 0\r\nwhile line1[0] >= 0 and line1[1] >= 0:\r\n line1[who] -= amt\r\n who = not who\r\n amt += 1\r\nprint(\"Vladik\" if line1[0] < 0 else \"Valera\")", "import math as mt \r\nimport sys,string,bisect\r\ninput=sys.stdin.readline\r\nimport random\r\nfrom collections import deque,defaultdict\r\nL=lambda : list(map(int,input().split()))\r\nLs=lambda : list(input().split())\r\nM=lambda : map(int,input().split())\r\nI=lambda :int(input())\r\nn,m=M()\r\ni=0\r\nwhile(True):\r\n if(i%2==0):\r\n n-=(i+1)\r\n if(n<0):\r\n print(\"Vladik\")\r\n break\r\n else:\r\n m-=(i+1)\r\n if(m<0):\r\n print(\"Valera\")\r\n break\r\n i+=1\r\n", "import math\r\na, b = map(int, input().split())\r\nc1 = int(math.sqrt(a))\r\ndiff = ((-1 + (math.sqrt(1-4*1*-b))) / 2)\r\ndiff1 = ((-1 - (math.sqrt(1-4*1*-b))) / 2)\r\nif diff > 0:\r\n final = diff\r\nelse:\r\n final = diff1\r\nif c1 > diff:\r\n print('Valera')\r\nelse:\r\n print('Vladik')\r\n", "\nvlad, val = 0, 0\n\ndef get_input():\n\tglobal vlad, val\n\tfirst_arr = [int(x) for x in input().split()]\n\tvlad, val = first_arr[0], first_arr[1]\n\n\ndef main():\n\tget_input()\n\tglobal vlad, val\n\tgiven = 1\n\twhile 1:\n\t\tif given % 2 == 1:\n\t\t\tvlad = vlad - given\n\t\telse:\n\t\t\tval = val - given\n\t\tgiven = given + 1\n\t\tif vlad < 0:\n\t\t\tprint(\"Vladik\")\n\t\t\treturn\n\t\telif val < 0:\n\t\t\tprint(\"Valera\")\n\t\t\treturn\n\nif __name__ == '__main__':\n\tmain()\n", "m=input()\r\nm=m.split(\" \")\r\na=int(m[0])\r\nb=int(m[1])\r\ncounter=1\r\nwhile(a>=0 and b>=0):\r\n a=a-counter\r\n #print(a)\r\n if a<0 and b>=0:\r\n ans=\"Vladik\"\r\n counter=counter+1\r\n b=b-counter\r\n # print(b)\r\n counter=counter+1\r\n if b<0 and a>=0:\r\n ans=\"Valera\"\r\nprint(ans)", "x = list(map(int, input().split()))\r\npos = 0\r\nc = 1\r\nwhile True:\r\n if x[pos] >= c:\r\n x[pos]-=c\r\n else:\r\n print(\"Vladik\" if pos%2==0 else \"Valera\")\r\n exit(0)\r\n c += 1\r\n pos = (pos+1)%2\r\n", "a,b=[int(i) for i in input().split()]\r\ni=1\r\nj=2\r\nwhile True:\r\n a=a-i\r\n if a<0:\r\n print('Vladik')\r\n break\r\n b=b-j\r\n if b<0:\r\n print('Valera')\r\n break\r\n i+=2\r\n j+=2\r\n", "a, b=map(int,input().split())\r\nn=int(a**0.5)\r\nprint(\"Vladik\" if n*(n+1)<=b else \"Valera\") ", "a,b=map(int,input().split())\r\n\r\ni=0\r\n\r\nwhile True:\r\n i=i+1\r\n a=a-i\r\n \r\n if a<0:\r\n \r\n print('Vladik')\r\n break\r\n \r\n i+=1\r\n b=b-i\r\n \r\n if b<0:\r\n print('Valera')\r\n break\r\n", "a,b = map(int, input().split())\r\nk = 1\r\nm = 1\r\nwhile 1==1:\r\n if m == 1:\r\n if a-k>=0:\r\n a=a-k\r\n k=k+1\r\n m=2\r\n else:\r\n print (\"Vladik\")\r\n exit(0)\r\n else:\r\n if b-k>=0:\r\n b=b-k\r\n k =k+1\r\n m=1\r\n else:\r\n print (\"Valera\")\r\n exit(0)\r\n ", "n,m=map(int,input().split())\r\ni=1\r\nwhile 1:\r\n if i&1==1:\r\n if n-i<0:\r\n print(\"Vladik\")\r\n break\r\n else:\r\n n-=i\r\n else:\r\n if m-i<0:\r\n print(\"Valera\")\r\n break\r\n else:\r\n m-=i\r\n i+=1\r\n\r\n \r\n \r\n \r\n", "a, b =list(map(int, input().split()))\r\ncount = 1\r\nwhile True:\r\n if (a - count < 0):\r\n print(\"Vladik\")\r\n break\r\n a -= count\r\n count += 1\r\n if (b - count < 0):\r\n print(\"Valera\")\r\n break\r\n b -= count\r\n count += 1\r\n \r\n ", "Vladik, Valera = map(int,input().split())\r\nvla = True\r\nval = True\r\nturn = 0\r\nwhile vla and val:\r\n turn += 1\r\n if turn %2 != 0:\r\n Vladik -= turn\r\n else:\r\n Valera -= turn\r\n if Vladik < 0:\r\n vla = False\r\n elif Valera < 0:\r\n val = False\r\nif vla:\r\n print(\"Valera\")\r\nelse:\r\n print(\"Vladik\")", "a,b=map(int,input().split())\r\ni=1\r\nj=1\r\nc1=c2=0\r\nwhile(a-c1>=2*i-1):\r\n c1 += 2*i-1\r\n i+=1\r\n\r\nwhile(b-c2>=2*j):\r\n c2+=2*j\r\n j+=1\r\n \r\nif i>j:\r\n print(\"Valera\")\r\nelse:\r\n print('Vladik')\r\n ", "vladik, valera = map(int,input().split())\r\ni=0\r\nwhile True:\r\n i+=1\r\n if i%2==0:\r\n if valera<i:\r\n print('Valera')\r\n break\r\n valera-=i\r\n else:\r\n if vladik<i:\r\n print('Vladik')\r\n break\r\n vladik-=i\r\n \r\n \r\n \r\n", "who = [int(x) for x in input().split()]\r\nturn = 0\r\no = 1\r\nwhile o <= who[turn]:\r\n who[turn] = who[turn] - o\r\n o = o + 1\r\n turn = turn ^ 1\r\n\r\nif turn == 1:\r\n print(\"Valera\")\r\n \r\nelse:\r\n print(\"Vladik\")\r\n", "a, b = map(int, input().split())\r\nfor i in range(40000):\r\n a -= i*2+1\r\n if a<0:\r\n print(\"Vladik\")\r\n break\r\n b -= i*2+2\r\n if b<0:\r\n print(\"Valera\")\r\n break", "import math\r\na,b = map(int, input().split())\r\nn = int(math.sqrt(a))\r\nif b >= n * (n+1):\r\n print(\"Vladik\")\r\nelse:\r\n print(\"Valera\")\r\n", "a,b = map(int, input().split())\r\nn = int(a**0.5)\r\na -= n**2\r\nb -= n*(n+1)\r\n\r\nif b>=0:\r\n print(\"Vladik\")\r\nelse:\r\n print(\"Valera\")", "def switch(A):\r\n if(A):\r\n return False\r\n return True\r\n[lad,ale]=input().split()\r\n[lad,ale]=[int(lad),int(ale)]\r\ncheck=True\r\nturn=False#lad's turn, tru=ale\r\ni=1\r\nwhile check:\r\n if turn:\r\n ale=ale-i\r\n if(ale<0):\r\n check=False\r\n else:\r\n lad=lad-i\r\n if(lad<0):\r\n check=False\r\n turn=switch(turn)\r\n i=i+1\r\nif not turn:\r\n print(\"Valera\")\r\nelse:\r\n print(\"Vladik\")\r\n", "n,m=map(int,input().split())\r\nx=1\r\nwhile 1:\r\n if x%2==0:\r\n if x>m:\r\n print(\"Valera\")\r\n break\r\n m=m-x\r\n else:\r\n if x>n:\r\n print(\"Vladik\")\r\n break\r\n n=n-x\r\n x+=1\r\n", "a=list(map(int,input().split()))\nfor i in range(99999):\n a[i%2]-=i+1\n if a[i%2]<0: break\nprint('Vladik'if a[0]<0 else'Valera')\n", "vladik, valera = [int(x) for x in input().split()]\r\nodd, even = 1, 2\r\n\r\nwhile(True):\r\n vladik -= odd\r\n\r\n if (vladik < 0):\r\n print(\"Vladik\")\r\n break\r\n \r\n valera -= even\r\n\r\n if (valera < 0):\r\n print(\"Valera\")\r\n break\r\n \r\n odd += 2\r\n even += 2\r\n", "import sys\r\nl = list(map(int, sys.stdin.readline().rstrip().split()))\r\ncur = 1\r\nt = 0\r\nwhile True:\r\n if l[t] < cur:\r\n if t:\r\n sys.stdout.write('Valera')\r\n break\r\n else:\r\n sys.stdout.write('Vladik')\r\n break\r\n else:\r\n l[t] -= cur\r\n cur += 1\r\n if t:\r\n t = 0\r\n else:\r\n t += 1", "a, b = list(map(int, input().split()))\r\n\r\ni = 1\r\ncur = 0\r\nwhile (1 - cur)*a + cur*b >= i:\r\n\tif cur == 0:\r\n\t\ta -= i\r\n\telse:\r\n\t\tb -= i\r\n\ti += 1\r\n\tcur = 1 - cur\r\n\r\nif cur == 0:\r\n\tprint('Vladik')\r\nelse:\r\n\tprint('Valera')", "vladikS, valeraS = input(\"\").split()\r\nvladik = int(vladikS)\r\nvalera = int(valeraS)\r\n\r\ndar = True\r\ni = 1\r\nwhile dar == True:\r\n if vladik >= i:\r\n vladik -= i\r\n i += 1\r\n else:\r\n dar = False\r\n print(\"Vladik\")\r\n break\r\n \r\n if valera >= i:\r\n valera -= i\r\n i += 1\r\n else:\r\n dar = False\r\n print(\"Valera\")\r\n", "a,b=map(int,input().split())\r\nfor n in range(1,10**40):\r\n \r\n if (n)%2!=0:\r\n \r\n a=a-n\r\n \r\n elif (n)%2==0:\r\n \r\n b=b-n\r\n \r\n if a<0:\r\n print(\"Vladik\")\r\n break\r\n if b<0:\r\n print(\"Valera\")\r\n break", "x,y=map(int,input().split())\r\nka=1\r\nwhile True:\r\n if(ka%2==0):\r\n y=y-ka\r\n if(y<0):\r\n print(\"Valera\")\r\n break\r\n else:\r\n x=x-ka\r\n if(x<0):\r\n print(\"Vladik\")\r\n break\r\n ka=ka+1", "a, b = list(map(int, input().split(\" \") ))\r\ni=1\r\nd=0\r\nwhile((a >= 0) and (b >= 0)):\r\n if(d==0):\r\n a-=i\r\n d=1\r\n else:\r\n b-=i\r\n d=0\r\n i+=1\r\nif(d==1):\r\n print(\"Vladik\")\r\nelse:\r\n print(\"Valera\")", "from math import *\r\na,b=map(int,input().split())\r\nans=1\r\nflag=0\r\nturn=1\r\nwhile(flag==0):\r\n if(turn==1):\r\n if(a-ans>=0):\r\n a-=ans\r\n turn=2\r\n ans+=1\r\n else:\r\n flag=1\r\n break\r\n else:\r\n if(b-ans>=0):\r\n b-=ans\r\n turn=1\r\n ans+=1\r\n else:\r\n flag=1\r\n break\r\nif(turn==1):\r\n print('Vladik')\r\nelse:\r\n print('Valera')", "a, b = map(int , input().split())\r\ng = 1\r\nt = 0\r\n\r\nwhile True:\r\n t += 1\r\n if t % 2 != 0:\r\n if a < g:\r\n break\r\n else:\r\n a -= g\r\n else:\r\n if b < g:\r\n break\r\n else:\r\n b -= g\r\n\r\n g += 1\r\n \r\nif t % 2 == 0:\r\n print(\"Valera\")\r\nelse:\r\n print(\"Vladik\") ", "n,m=map(int,input().split())\r\ni=1\r\nflag=0\r\nwhile(n>=0 and m>=0):\r\n if flag==0:\r\n n-=i\r\n flag=1\r\n else:\r\n m-=i\r\n flag=0\r\n i+=1\r\nif flag==0:\r\n print(\"Valera\")\r\nelse:\r\n print(\"Vladik\")\r\n\r\n \r\n \r\n", "v = list(map(int,input().split()))#Vladik and Valera\r\n\r\nv.insert(0,0)\r\n# vla = v[1]\r\n# val = v[-1]\r\n\r\nflag=1\r\ni=1\r\n\r\nwhile(v[-flag] >= 0):\r\n \r\n v[flag]-=i\r\n \r\n flag = -flag\r\n i +=1\r\n \r\nif v[1] < 0:\r\n print(\"Vladik\")\r\nelse:\r\n print(\"Valera\")", "a, b = [int(x) for x in input().split()]\n\ndec = 1\nwhile True:\n if dec%2 == 1:\n a -= dec\n else:\n b -= dec\n if a < 0:\n print('Vladik')\n break\n elif b < 0:\n print('Valera')\n break\n dec += 1\n", "# import sys\r\n# sys.stdin=open(\"input1.in\",\"r\")\r\n# sys.stdout=open(\"output2.out\",\"w\")\r\nX,Y=map(int,input().split())\r\nfor i in range(1,100000000):\r\n\tif i%2==0:\r\n\t\tY=Y-i\r\n\tif i%2!=0:\r\n\t\tX=X-i\r\n\tif X<0:\r\n\t\tprint(\"Vladik\")\r\n\t\tbreak\r\n\tif Y<0:\r\n\t\tprint(\"Valera\")\r\n\t\tbreak\r\n", "a,b=map(int,input().split())\r\ncnt = 1\r\ni=0\r\nwhile True:\r\n if i==0:\r\n if a < cnt:\r\n print('Vladik')\r\n break\r\n a-=cnt\r\n i=1\r\n else:\r\n if b < cnt:\r\n print('Valera')\r\n break\r\n b-=cnt\r\n i=0\r\n cnt+=1\r\n", "n, m = map(int, input().split())\r\npn = int(n ** 0.5)\r\npm = int(m ** 0.5)\r\nif m < pm**2 + pm:\r\n\tpm-=1\r\nif pn > pm or m < 2 and n > 0:\r\n\tprint('Valera')\r\nelse:\r\n\tprint('Vladik')\r\n", "a,b=map(int,input().split())\r\nfor i in range(99999999999999):\r\n if i%2==1:\r\n a=a-i\r\n else:\r\n b=b-i\r\n if a<0:\r\n print('Vladik')\r\n \r\n break\r\n if b<0:\r\n print('Valera')\r\n break\r\n", "n1='Vladik'\r\nn2='Valera'\r\n\r\nconst=0\r\na, b = map(int, input().split())\r\nwhile True:\r\n const+=1\r\n a=a-const\r\n if a < 0:\r\n print(n1)\r\n break\r\n const+=1\r\n b-=const\r\n if b < 0:\r\n print(n2)\r\n break\r\n ", "a,b = map(int,input().split())\r\nflag = True\r\nfor i in range(1,1000000):\r\n\tif(flag==True):\r\n\t\tflag = False\r\n\t\tif(a<i):\r\n\t\t\tprint('Vladik')\r\n\t\t\texit(0)\r\n\t\ta-=i\r\n\telse:\r\n\t\tflag = True\r\n\t\tif(b<i):\r\n\t\t\tprint('Valera')\r\n\t\t\texit(0)\r\n\t\tb-=i", "#n = int(input())\nm,n = map(int,input().split())\n#s = input()\n#arr = [int(x) for x in input().split()]\nval = int(m**(1/2))\nval += 1\ntemp = val*(val-1)\nif n>=temp:\n\tprint(\"Vladik\")\nelse:\n\tprint(\"Valera\")\n", "import math;\r\n\r\na,b=(int(i) for i in input().split(\" \"));\r\n\r\nvladik=math.floor(math.sqrt(a));\r\nvalera=0;\r\n\r\nl=1;\r\nh=math.floor(math.sqrt(b)+1);\r\nwhile(l<=h):\r\n mid=(l+h)>>1;\r\n t=mid*mid+mid;\r\n if(t<=b):\r\n valera=max(valera,mid);\r\n l=mid+1;\r\n else:\r\n h=mid-1;\r\n\r\nif(vladik>valera): print(\"Valera\");\r\nelse: print(\"Vladik\");\r\n", "vlad, valer = map(int,input().split())\r\nmincrement = 1\r\nwhile 1:\r\n vlad -= mincrement\r\n if vlad < 0:\r\n print(\"Vladik\")\r\n break\r\n mincrement += 1\r\n \r\n valer -= mincrement\r\n if valer < 0:\r\n print(\"Valera\")\r\n break\r\n mincrement += 1", "a,b = map(int, input().split())\r\n\r\nmx =max(a,b)\r\n\r\nfor i in range(1, mx + 2):\r\n if i&1:\r\n if i > a:\r\n print(\"Vladik\")\r\n break\r\n a -= i\r\n else:\r\n if i > b:\r\n print(\"Valera\")\r\n break\r\n b -= i", "a,b=map(int,input().split())\r\nif int(a**(1/2))**2<=b-int(a**(1/2)):\r\n print(\"Vladik\")\r\nelse:\r\n print(\"Valera\")", "import math\r\nn, k = map(int, input().split())\r\n\r\nx = math.floor(math.sqrt(n))\r\ny = x*(x+1)\r\n\r\nif y<=k:\r\n print(\"Vladik\")\r\n \r\nelse:\r\n print(\"Valera\")", "if __name__ == \"__main__\":\r\n v = list(map(int, input().split()))\r\n x = 0\r\n for i in range(1, 10 ** 9):\r\n v[x] -= i\r\n if v[x] < 0:\r\n print(\"Vladik\" if x == 0 else \"Valera\")\r\n break\r\n x = 0 if x == 1 else 1", "a = list(map(int,input().split()))\r\nodd = int(a[0]**(1/2))\r\neven = int((((1+4*a[1])**(1/2))-1)//2)\r\nif odd > even:\r\n print('Valera')\r\nelse:\r\n print('Vladik')", "vl,va=map(int,input().split())\r\nc=1\r\nwhile vl>=0 and va>=0:\r\n\tvl-=c\r\n\tif vl<0:\r\n\t\tprint(\"Vladik\")\r\n\t\tbreak\r\n\tva-=(c+1)\r\n\tif va<0:\r\n\t\tprint(\"Valera\")\r\n\t\tbreak\r\n\tc+=2", "a, b = [int(x) for x in input().split(' ')]\nturn = True\nc = 1\n\nwhile(True):\n if(turn):\n if(a - c >= 0):\n a -= c\n turn = False\n else:\n print('Vladik')\n break\n else:\n if(b - c >= 0):\n b -= c\n turn = True\n else:\n print('Valera')\n break\n c += 1\n\n\n", "(vladik, valera) = map(int, input().split(' '))\n\ni = 0\n\nwhile True:\n i += 1\n if i % 2 == 1:\n if vladik < i:\n print('Vladik')\n break\n vladik -= i\n\n else:\n if valera < i:\n print('Valera')\n break\n valera -= i\n\n\n", "def solve(vladik, valera):\r\n i = 1\r\n while True:\r\n if vladik - i < 0:\r\n return \"Vladik\"\r\n else:\r\n vladik -= i\r\n i += 1\r\n if valera - i < 0:\r\n return \"Valera\"\r\n else:\r\n valera -= i\r\n i += 1\r\n\r\nn, m = map(int, input().split())\r\nprint(solve(n, m))", "import math \r\ns = input().strip().split()\r\na=int(s[0])\r\nb=int(s[1])\r\nka=int(math.sqrt(a))\r\n\r\nif ka*(ka+1)>b :\r\n print(\"Valera\")\r\nelse:\r\n \r\n print('Vladik')\r\n\r\n", "a, b = map(int, input().split())\r\n\r\ndif1 = 1\r\ndif2 = 2\r\nwhile a >= 0 and b >= 0:\r\n a -= dif1\r\n b -= dif2\r\n dif1 += 2\r\n dif2 += 2\r\n\r\nif a < 0:\r\n print('Vladik')\r\nelse:\r\n print('Valera')\r\n ", "from sys import stdin,stdout\r\nimport math\r\nfrom collections import Counter,deque\r\nL=lambda:list(map(int, stdin.readline().strip().split()))\r\nM=lambda:map(int, stdin.readline().strip().split())\r\nI=lambda:int(stdin.readline().strip())\r\nS=lambda:stdin.readline().strip()\r\nC=lambda:stdin.readline().strip().split()\r\nmod=1000000007\r\ndef pr(a):return(\"\".join(list(map(str,a))))\r\n#______________________-------------------------------_____________________#\r\n\r\ndef solve():\r\n n, m = M()\r\n i=1\r\n while 1:\r\n n-=i\r\n if n<0:\r\n print(\"Vladik\")\r\n return\r\n i+=1\r\n m-=i\r\n if m<0:\r\n print(\"Valera\")\r\n return\r\n i+=1\r\nfor _ in range(1):\r\n solve()\r\n\r\n", "import sys\r\n\r\ninf = 1<<30\r\n\r\ndef solve():\r\n a, b = map(int, input().split())\r\n\r\n top = inf\r\n btm = 0\r\n\r\n while top - btm > 1:\r\n mid = (top + btm) // 2\r\n\r\n if mid**2 <= a:\r\n btm = mid\r\n else:\r\n top = mid\r\n\r\n aout = top\r\n\r\n top = inf\r\n btm = 0\r\n\r\n while top - btm > 1:\r\n mid = (top + btm) // 2\r\n\r\n if mid * (mid + 1) <= b:\r\n btm = mid\r\n else:\r\n top = mid\r\n\r\n bout = top\r\n\r\n # print(aout, bout)\r\n\r\n if aout <= bout:\r\n print('Vladik')\r\n else:\r\n print('Valera')\r\n\r\nif __name__ == '__main__':\r\n solve()", "def READ():\r\n return map(int, input().split())\r\n\r\nvladikTurn = True\r\nvaleraTurn = False\r\n\r\nvladik = True\r\nvalera = True\r\n\r\na, b = READ()\r\n\r\nfor f in range(1, 10**9+1, 1):\r\n if vladikTurn :\r\n a -= f\r\n \r\n if a<0:\r\n vladik = False\r\n break\r\n \r\n vladikTurn = False\r\n valeraTurn = True\r\n \r\n elif valeraTurn:\r\n b -= f\r\n \r\n if b<0:\r\n valera = False\r\n break\r\n \r\n valeraTurn = False\r\n vladikTurn = True\r\n\r\nif vladik:\r\n print(\"Valera\")\r\n\r\nelse:\r\n print(\"Vladik\")", "a, b = map(int, input().split())\r\nfor i in range(1,a+b+1):\r\n if(i%2 == 0):\r\n if(b-i >= 0):\r\n b -= i\r\n else:\r\n print(\"Valera\")\r\n break\r\n else:\r\n if(a-i >= 0):\r\n a -= i\r\n else:\r\n print(\"Vladik\")\r\n break\r\n", "a, b = [int(i) for i in input().split()]\r\ni = 1\r\nflag_vlad = True\r\nflag_val = True\r\nwhile flag_vlad and flag_val:\r\n if a < i:\r\n flag_vlad = False\r\n else:\r\n a -= i\r\n i += 1\r\n if flag_vlad:\r\n if b < i:\r\n flag_val = False\r\n else:\r\n b -= i\r\n i += 1\r\nif flag_val:\r\n print('Vladik')\r\nelse:\r\n print('Valera')", "vl,va=map(int,input().split())\ni=1\nwhile vl!=0 or va!=0:\n if i%2==1:\n vl-=i\n else:\n va-=i\n if i%2==0 and vl<i+1:\n print('Vladik')\n break\n if i%2==1 and va<i+1:\n print('Valera')\n break\n i+=1\n \t\t \t\t \t\t \t\t \t \t \t\t", "a, b = map(int, input().split())\r\ncount = 1\r\nwhile a >= 0 and b >= 0:\r\n if count % 2 != 0:\r\n a -= count\r\n else:\r\n b -= count\r\n # print(a, b, turn)\r\n count+=1\r\n\r\nif a < 0:\r\n print(\"Vladik\")\r\nelse:\r\n print(\"Valera\")\r\n", "a, b = [int(x) for x in input().split()]\r\n\r\nn = max(a, b)\r\nfor i in range(n+1): \r\n a_given = i*i\r\n b_given = i*(i+1)\r\n # print(i, a_given, b_given)\r\n if a_given <= a and b_given <= b:\r\n continue\r\n\r\n # print(i, a_given, b_given)\r\n if a_given > a and b_given > b:\r\n print(\"Vladik\")\r\n elif a_given > a and b_given <= b:\r\n print(\"Vladik\")\r\n elif a_given <= a and b_given > b:\r\n print(\"Valera\")\r\n break", "from math import sqrt, floor\n\na, b = map(int, input().split())\n\nq = floor(sqrt(a))\nw = floor((sqrt(4*b+1) - 1) / 2)\n\nprint('Vladik' if q <= w else 'Valera')\n", "a = list(map(int, input().split(' ')))\ni = 0\nx = 1\nwhile True:\n if a[i] < x:\n print(['Vladik', 'Valera'][i])\n break\n\n a[i] -= x\n\n if i == 1:\n i = 0\n else:\n i = 1\n x += 1\n", "m,n=map(int,input().split())\r\ni=1\r\nwhile True:\r\n if i>m:\r\n print(\"Vladik\")\r\n break\r\n else:\r\n m=m-i\r\n i+=1\r\n \r\n if i>n:\r\n print(\"Valera\")\r\n break\r\n else:\r\n n=n-i\r\n i+=1\r\n ", "(a, b) = (int(i) for i in input().split())\r\nam = ((4*a)**(1/2))//2\r\nbm = ((1+4*b)**(1/2)-1)//2\r\nif am>bm:\r\n\tprint('Valera')\r\nelse:\r\n\tprint('Vladik')", "a = input().split()\r\ns = int(a[0])\r\nd = int(a[1])\r\ng = 0\r\nfor i in range(int(1e+50)):\r\n g += 1\r\n if i % 2 == 0:\r\n s -= g\r\n if s < 0:\r\n print(\"Vladik\")\r\n break\r\n else:\r\n d -= g\r\n if d < 0:\r\n print(\"Valera\")\r\n break\r\n", "a,b=map(int,input().split())\r\nc=a+b\r\na1=0\r\nb1=0\r\nfor i in range(1,c,2):\r\n if(a>=i):\r\n a1+=1\r\n a-=i\r\n else:\r\n break\r\nfor i in range(2,c,2):\r\n if(b>=i):\r\n b1+=1\r\n b-=i\r\n else:\r\n break\r\nif(a1<=b1):\r\n print(\"Vladik\")\r\nelse:\r\n print(\"Valera\")", "a, b = list(map(int, input().strip().split()))\r\n\r\na_times = int(a ** 0.5)\r\nb_times = int((-1 + (1+4*b) ** 0.5) / 2)\r\n\r\nif a_times > b_times:\r\n print(\"Valera\")\r\n\r\nelse:\r\n print(\"Vladik\")", "a, b = map(int, input().split())\nflag = True\nfor step in range(1, 200000):\n if flag:\n a -= step\n else:\n b -= step\n if a < 0 or b < 0:\n break\n flag = not flag\nif flag:\n print('Vladik')\nelse:\n print('Valera')", "string=input()\r\ns=string.split()\r\na=int(s[0])\r\nb=int(s[1])\r\ni=1\r\nz=1\r\nwhile(z==1):\r\n if(i%2!=0):\r\n a=a-i\r\n if(a<0):\r\n print(\"Vladik\")\r\n break\r\n else:\r\n b=b-i\r\n if(b<0):\r\n print(\"Valera\")\r\n break\r\n i=i+1", "import sys\r\nfrom itertools import count\r\n\r\ndef main():\r\n a, b = map(int, sys.stdin.read().strip().split())\r\n for i in count(1, 2):\r\n a -= i\r\n if a < 0: return 'Vladik'\r\n b -= i + 1\r\n if b < 0: return 'Valera'\r\n \r\nprint(main())\r\n", "a,b = map(int, input().split())\r\nf=[b,a]\r\nc = 1\r\nwhile True:\r\n if f[c%2] < c:\r\n break\r\n else:\r\n f[c%2] -= c\r\n c += 1\r\n\r\nprint([\"Valera\", \"Vladik\"][c%2])", "a, b = map(int, input().split())\r\nn1 = int(a**0.5)\r\nn2 = int(((1+4*b)**0.5-1)/2)\r\nif n2 >= n1:\r\n print(\"Vladik\")\r\nelse:\r\n print(\"Valera\")\r\n", "from math import floor, sqrt\n\na, b = (int(i) for i in input().split())\n# a = (2*1 + (vl - 1)*2)*vl/2 => a = vl + vl^2 - vl => vl = sqrt(a)\n# b = (2*2 + (va - 1)*2)*va/2 => b = 2va + va^2 - va => va^2 + va - b = 0 => va = (-1 + sqrt(1 + 4b))/2\nvladik = floor(sqrt(a))\nvalera = floor((sqrt(4*b + 1) - 1)/2)\nres = \"Vladik\" if valera >= vladik else \"Valera\"\nprint(res)\n", "a, i, c = list(map(int, input().split())), 1, 0\r\nwhile a[c] >= i:\r\n a[c], i, c = a[c] - i, i + 1, 1 - c\r\nprint('Valera' if c else 'Vladik')", "a,b = map(int,input().split())\r\nk=0\r\nwhile(a>=0):\r\n a-=(2*k+1)\r\n b-=(2*k+2)\r\n if a<0:\r\n print(\"Vladik\")\r\n break;\r\n if b<0:\r\n print(\"Valera\")\r\n break;\r\n k+=1\r\n\r\n\r\n\r\n", "ls = list(map(int, input().split()))\r\ni = 1\r\nflag = 0\r\nwhile True:\r\n if i>ls[flag]: break\r\n ls[flag]-=i\r\n i+=1\r\n flag = 1-flag\r\nif flag==0: print('Vladik')\r\nelse: print('Valera')\r\n", "a, b = map(int, input().split())\r\nif int(a ** 0.5) <= int((-0.5 + (1 + 4 * b)**0.5 / 2)):\r\n print(\"Vladik\")\r\nelse:\r\n print(\"Valera\")", "a,b = list(map(int, input().split()))\r\n\r\n# d = 1\r\n# while True:\r\n# \tif d%2==1:\r\n# \t\tif a>0 and b>0:\r\n# \t\t\ta -=d\r\n# \t\telse:\r\n# \t\t\tbreak\r\n# \telse:\r\n# \t\tif b>0 and a>0:\r\n# \t\t\tb-=d\r\n# \t\telse:\r\n# \t\t\tbreak\r\n# \td+=1\r\n#\r\n# if a>= d:\r\n# \tprint(\"Valera\")\r\n# elif b>=d:\r\n# \tprint(\"Vladik\")\r\n# elif a == 0:\r\n# \tprint(\"Valera\")\r\n# elif b == 0:\r\n# \tprint(\"Vladik\")\r\n\r\ni = 1\r\nwhile True:\r\n\tif i>a:\r\n\t\tprint(\"Vladik\")\r\n\t\tbreak\r\n\telse:\r\n\t\ta-=i\r\n\t\ti+=1\r\n\r\n\tif (i>b):\r\n\t\tprint(\"Valera\")\r\n\t\tbreak\r\n\telse:\r\n\t\tb-=i\r\n\t\ti+=1\r\n", "a, b=map(int,input().split())\r\ns=int(a**0.5)\r\nif(s*(s+1)>b):\r\n print(\"Valera\")\r\nelse:\r\n print(\"Vladik\")\r\n", "a,b=map(int,input().split(\" \"))\r\ni=0\r\nwhile(a>=0 and b>=0):\r\n i+=1\r\n if(i%2==0):\r\n b-=i\r\n else:\r\n a-=i\r\nif(i%2==0):\r\n print(\"Valera\")\r\nelse:\r\n print(\"Vladik\")", "a, b = map(int, input().split())\r\nan = int(a ** 0.5)\r\nprint([\"Valera\",\"Vladik\"][b >= an**2 + an])", "# A. Vladik and Courtesy\n\na, b = map(int, input().split())\n\nvladik = True\ni = 1\nwhile a > -1 and b > -1:\n if vladik:\n a -= i\n else:\n b -= i\n i += 1\n vladik = not vladik\n\nif vladik:\n print(\"Valera\")\nelse:\n print(\"Vladik\")\n", "candy=[int(i) for i in input().split()]\r\ng=0\r\ni=0\r\nkov=0\r\nwhile g < 1:\r\n i+=1\r\n if candy[kov] >= i:\r\n candy[kov]-=i\r\n kov=1-kov\r\n else:\r\n g+=1\r\n if kov==0:\r\n print(\"Vladik\")\r\n else:\r\n print(\"Valera\")\r\n", "import math\r\n\r\na, b = map(int, input().split())\r\nif int(math.sqrt(a)) <= int(math.sqrt(b + 0.25) - 0.5):\r\n print('Vladik')\r\nelse:\r\n print('Valera')\r\n", "# coding: utf-8\n\nimport math\n\n\nvs = [\"Vladik\", \"Valera\"]\na, b = map(int, input().split(\" \"))\n\nan = math.floor(math.sqrt(a))\nbn = 0\nwhile True:\n bn += 1\n if b < bn * (bn + 1):\n bn -= 1\n break\n\nprint(vs[an > bn])\n", "a, b = map(int, input().split())\r\nj = 1\r\ni = 1\r\nwhile True:\r\n if i == 1:\r\n if a >= j:\r\n a -= j\r\n else:\r\n break\r\n else:\r\n if b >= j:\r\n b -= j\r\n else:\r\n break\r\n i *= (-1)\r\n j += 1\r\nprint(\"Vladik\" if i == 1 else \"Valera\")", "vladik, valera = [int(x) for x in input().split()]\r\ncomp = int(vladik ** 0.5)\r\nprint([\"Valera\", \"Vladik\"][comp * (comp + 1)<= valera])\r\n", "a,b=map(int,input().split())\r\nflag=False\r\ni=1\r\nwhile(1):\r\n if(i&1):\r\n a-=i\r\n else:\r\n b-=i\r\n i+=1\r\n if(a<0):\r\n flag=True\r\n if(a<0 or b<0):\r\n break\r\nif(flag):\r\n print('Vladik')\r\nelse:\r\n print('Valera')\r\n", "import math\r\na1,a2=input().split()\r\na1=int(a1)\r\na2=int(a2)\r\nif(a1<1):\r\n print(\"Vladik\")\r\nelif(a2<2):\r\n print(\"Valera\")\r\nelif(a1==1 and a2==2):\r\n print(\"Vladik\")\r\nelse:\r\n k1=int(math.sqrt(a1))\r\n i=1\r\n while(a2-i*(i+1)>=0):\r\n i=i+1\r\n k2=i-1\r\n \r\n if(k1>k2):\r\n print(\"Valera\")\r\n else:\r\n print(\"Vladik\")\r\n", "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\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# -------------------------------------------------------------------- #\ndef main():\n a, b = map(int, input().split())\n for i in range(1, 10**9):\n if i % 2 == 0:\n b -= i\n if b < 0:\n print(\"Valera\")\n break\n\n if i % 2 == 1:\n a -= i\n if a < 0:\n print(\"Vladik\")\n break\n\n\nif __name__ == '__main__':\n main()\n\n\t\t\t \t\t\t \t \t\t \t\t\t\t \t \t", "from math import pow\r\nx,y = (map(int, input().split()))\r\na = int(pow(x,0.5)) + 1\r\nb = int( (-1+ pow((1+4*y),0.5))/2)+1\r\nif a<=b: print(\"Vladik\")\r\nelse: print(\"Valera\")", "\n# coding: utf-8\n\n# In[5]:\n\nvect1= input()\nvect1=vect1.split(\" \")\ntam=len(vect1)\n\ncont1 = 1\ncontador1 = 2\nx = 0\naux11 = int(vect1[0])\naux22 = int(vect1[1])\nwhile(True):\n aux11 = aux11-cont1\n aux22 = aux22-contador1\n \n if(aux11<0):\n print(\"Vladik\")\n break\n if(aux22<0):\n print(\"Valera\")\n break\n \n cont1 = cont1+2\n contador1 = contador1+2\n\n \n\n\n# In[ ]:\n\n\n\n", "a,b =(int(x) for x in input().split(' '))\r\nk=1;\r\nwhile(b>=0) :\r\n a-=k\r\n k+=1\r\n if a<0 :\r\n break\r\n b-=k\r\n k+=1\r\nif a<0 :\r\n print(\"Vladik\")\r\nelse :\r\n print(\"Valera\")", "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\na,b=map(int,input().strip().split())\r\nsub=1\r\nwhile 1:\r\n if a>=sub:\r\n a-=sub\r\n else:\r\n print(\"Vladik\")\r\n break\r\n if b>=(sub+1):\r\n b-=(sub+1)\r\n \r\n else:\r\n print(\"Valera\")\r\n break\r\n sub+=2\r\n\r\n\r\n\r\n", "#!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\na, b = read_int_array()\nstep = 1\nwhile a >= 0 and b >= 0:\n if step % 2 == 1:\n a -= step\n else:\n b -= step\n step += 1\nprint('Vladik' if a < 0 else 'Valera')\n\n\n\n", "a,b=map(int,input().split())\r\np=int(a**0.5)\r\nq=int((-1+(1+4*b)**0.5)/2)\r\nprint('Valera' if p>q else' Vladik' )\r\n", "# -*- coding: utf-8 -*-\nfrom sys import stdin\n\nfor line in stdin:\n entrada = line.splitlines()\n break\n\ni=0\ncant_dulces=[int(entrada[0].split()[0]),int(entrada[0].split()[1])]\ncont=1\n\nwhile cant_dulces[i]>=cont:\n if i==0:\n cant_dulces[i]=cant_dulces[i]-cont\n cont+=1\n i=1\n else:\n cant_dulces[i]=cant_dulces[i]-cont\n cont+=1\n i=0\n\n\n\n\n\nif i==0:\n print(\"Vladik\")\nelse:\n print(\"Valera\")\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\na, b = map(int, input().split())\r\nfor i in range(1, 10000000000):\r\n if i % 2 == 0:\r\n if i > b:\r\n print(\"Valera\")\r\n break\r\n else:\r\n b -= i\r\n else:\r\n if i > a:\r\n print(\"Vladik\")\r\n break\r\n else:\r\n a -= i\r\n", "import sys\r\nimport math\r\n\r\na, b = map(int, input().split())\r\nfor i in range(10000000):\r\n if( i % 2 == 0):\r\n a -= (i+1)\r\n if a < 0:\r\n print(\"Vladik\")\r\n break;\r\n \r\n else:\r\n b -= (i+1)\r\n if b < 0:\r\n print(\"Valera\")\r\n break\r\n ", "a, b = list(map(int, input().split(' ')))\r\ns = int(a ** .5)\r\nprint('Valera') if (s * (s + 1) > b) else print('Vladik')", "def v_v(a, b):\r\n count = 1\r\n while True:\r\n if count % 2 == 1:\r\n a -= count\r\n if a < 0:\r\n return \"Vladik\"\r\n else:\r\n b -= count\r\n if b < 0:\r\n return \"Valera\"\r\n count += 1\r\n\r\n\r\nA, B = [int(j) for j in input().split()]\r\nprint(v_v(A, B))\r\n", "a,b=list(map(int,input().split()))\r\nx=int(a**(0.5))\r\ny=int((-1+(1+4*b)**(0.5))/2)\r\nif y>=x:\r\n print(\"Vladik\")\r\nelse:\r\n print(\"Valera\")", "cnt = list(map(int, input().split()))\n\nnxt = 1\nwho = 0\n\nwhile cnt[who] >= nxt:\n cnt[who] -= nxt\n nxt += 1\n who ^= 1\n\nprint('Vladik' if who == 0 else 'Valera')\n", "a, b= map(int, input().split()) \nflag = 0\nwhile a >= 0 and b >= 0:\n\tflag = flag + 1\n\tif flag % 2 == 0:\n\t\tb = b - flag\n\telse:\n\t\ta = a - flag\nif flag % 2 == 0:\n\tprint(\"Valera\")\nelse:\n\tprint(\"Vladik\")", "a, b=map(int, input().split())\r\ncnt=0\r\nwhile a>=0 and b>=0:\r\n cnt+=1\r\n if cnt%2==0:\r\n b=b-cnt\r\n else:\r\n a=a-cnt\r\nif cnt%2==0:\r\n print(\"Valera\")\r\nelse:\r\n print(\"Vladik\")\r\n ", "a,b=list(map(int,input().split()))\r\nstrt=1 \r\ni=1 \r\nwhile(1):\r\n if i%2!=0:\r\n if a-strt>=0:\r\n a=a-strt\r\n strt+=1\r\n else:\r\n print('Vladik')\r\n break\r\n else:\r\n if b-strt>=0:\r\n b=b-strt\r\n strt+=1\r\n else:\r\n print('Valera')\r\n break\r\n i+=1 \r\n\r\n \r\n ", "a, b = [int(x) for x in input().split()]\r\ni = 1\r\nwhile True:\r\n if i % 2 == 1:\r\n a -= i\r\n else:\r\n b -= i\r\n i += 1\r\n if a < 0 or b < 0:\r\n print(\"Vladik\" if a < 0 else \"Valera\")\r\n exit()\r\n", "a,b=map(int,input().split())\r\ni=1\r\nwhile a >= 0 and b >= 0:\r\n if i%2==1:\r\n a-=i\r\n else:\r\n b-=i\r\n i+=1\r\n if a < 0:\r\n print(\"Vladik\")\r\n if b < 0:\r\n print(\"Valera\")", "x,y=map(int,input().split())\r\na=0\r\nb=1\r\nwhile x>=0 and y>=0:\r\n if a==0:\r\n x-=b\r\n else:\r\n y-=b\r\n a=1-a\r\n b+=1\r\nif x<0:\r\n print(\"Vladik\")\r\nelse:\r\n print(\"Valera\")\r\n", "x, y = map(int, input().split())\ni = 1\nwhile True:\n if i % 2 == 1:\n x -= i\n if x < 0:\n print(\"Vladik\")\n break\n else:\n y -= i\n if y < 0:\n print(\"Valera\")\n break\n i += 1\n", "x,y=map(int,input().split())\r\nans=0\r\ni=1\r\nwhile(x>=0 and y>=0):\r\n x-=i\r\n i+=1\r\n if x<0:\r\n print(\"Vladik\")\r\n break\r\n y-=i\r\n i+=1\r\n if y<0:\r\n print(\"Valera\")\r\n break", "n,m = map(int,input().split())\r\ni=1\r\nwhile(n>=0 and m>=0):\r\n\tn-=i\r\n\ti+=1\r\n\tif(n<0):\r\n\t\tprint(\"Vladik\")\r\n\t\tbreak\r\n\tm-=i\r\n\ti+=1\r\n\tif(m<0):\r\n\t\tprint(\"Valera\")\r\n\t\tbreak\r\n\r\n\r\n", "a,b=map(int,input().split())\r\nk=1\r\np=1\r\nq=2\r\nwhile a>=0 and b>=0:\r\n if k==1:\r\n a-=p\r\n k=0\r\n p+=2\r\n else:\r\n b-=q\r\n k=1\r\n q+=2\r\n if a<0:\r\n print(\"Vladik\")\r\n exit()\r\n if b<0:\r\n print(\"Valera\")\r\n exit()\r\n", "a,b=(int(i) for i in input().split(\" \"));\r\ni=0;\r\nwhile(a>=0 and b>=0):\r\n i=i+1;\r\n if(i%2==0):\r\n b=b-i;\r\n else:\r\n a=a-i;\r\nif(a<0):\r\n print('Vladik');\r\nelif(b<0):\r\n print('Valera');", "a, b = map(int, input().split())\n\ns = 0\ncnt = 1\nwhile True:\n if s % 2 == 0:\n if a < cnt:\n break\n a -= cnt\n else:\n if b < cnt:\n break\n b -= cnt\n cnt += 1\n s = 1 - s\n\nprint([\"Vladik\", \"Valera\"][s])\n", "a,b = map(int,input().split())\r\nturn = \"Vladik\"\r\ni=1\r\nwhile True:\r\n if turn == \"Vladik\":\r\n if i > a:\r\n print(\"Vladik\")\r\n break\r\n a-=i\r\n turn = \"Valera\"\r\n else:\r\n if i > b:\r\n print(\"Valera\")\r\n break\r\n b-=i\r\n turn = \"Vladik\"\r\n i+=1", "a, b = map(int, input().split())\r\ni = 1\r\nwhile a>=0 and b>=0:\r\n a=a-i\r\n i=i+1\r\n b=b-i\r\n i=i+1\r\nif a<0:\r\n print('Vladik')\r\nelse:\r\n print('Valera')\r\n", "a,b = input().split()\r\na =int(a)\r\nb = int(b)\r\nstep =1\r\ntries = 1\r\nflag = False\r\nwhile flag == False:\r\n if tries %2!=0:\r\n if a < step: \r\n print(\"Vladik\")\r\n flag = True\r\n a-=step\r\n step+=1\r\n tries +=1\r\n elif tries %2==0:\r\n if b < step:\r\n print(\"Valera\")\r\n flag = True\r\n b-=step\r\n step+=1\r\n tries+=1\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "from sys import stdin, stdout\r\n\r\n\r\na, b = map(int, stdin.readline().split())\r\ncnt = 1\r\n\r\nwhile (True):\r\n a -= cnt\r\n cnt += 1\r\n b -= cnt\r\n cnt += 1\r\n \r\n if a < 0:\r\n stdout.write('Vladik')\r\n break\r\n \r\n if b < 0:\r\n stdout.write('Valera')\r\n break\r\n ", "vladik, valera = list(map(int, input().split(\" \")))\ntbg = 1\ncount = 0\nwhile True:\n if vladik<tbg and count % 2 ==0:\n print(\"Vladik\")\n break;\n if valera < tbg:\n print(\"Valera\")\n break;\n if count %2 == 0:\n vladik -= tbg\n tbg += 1\n else:\n valera -= tbg\n tbg += 1\n count += 1\n \n", "# -*- coding: utf-8 -*-\nfrom sys import stdin\n\n\ndef regalar_dulces(dulces_vladik, dulces_valera):\n cantidad_dulces = 1\n dona_vladik = True\n dona_valera = False\n\n while True:\n if dona_vladik is True:\n if dulces_vladik >= cantidad_dulces:\n dulces_vladik -= cantidad_dulces\n dona_vladik = False\n dona_valera = True\n cantidad_dulces += 1\n else:\n print(\"Vladik\")\n break\n\n if dona_valera is True:\n if dulces_valera >= cantidad_dulces:\n dulces_valera -= cantidad_dulces\n dona_valera = False\n dona_vladik = True\n cantidad_dulces += 1\n else:\n print(\"Valera\")\n break\n\n# Inicio del Programa\nfor line in stdin:\n cant = line.splitlines()\n break\n\na = cant[0].split()[0]\nb = cant[0].split()[1]\n\n\nregalar_dulces(int(a), int(b))\n", "n, k = map(int, input().split())\r\nd = 1\r\nwhile True:\r\n if n-d >= 0:\r\n n = n -d\r\n d += 1\r\n else:\r\n s = \"Vladik\"\r\n break\r\n if k-d >= 0:\r\n k = k -d\r\n d += 1\r\n else:\r\n s = \"Valera\"\r\n break\r\nprint(s)", "a,b=map(int,input().split())\r\nn=1\r\ni=0\r\nwhile(a>=0 and b>=0):\r\n if n%2==0:\r\n b-=n\r\n n+=1\r\n else:\r\n a-=n\r\n n+=1\r\n\r\nprint(\"Vladik\") if a<0 else print(\"Valera\")", "a, b = map(int, input().split())\r\n\r\ntemp = int(b ** 0.5)\r\n\r\nA = int(a ** 0.5)\r\nB = temp - (temp * (temp + 1) > b)\r\n\r\nprint(('Vladik', 'Valera')[A > B])\r\n", "\r\na , b = map(int,input().split())\r\ni = 1\r\nwhile 1:\r\n if(i&1):\r\n if(a >= i):\r\n a -= i\r\n else :\r\n print(\"Vladik\")\r\n break \r\n else :\r\n if( b >= i):\r\n b -= i\r\n else :\r\n print(\"Valera\")\r\n break \r\n i +=1 ", "import sys \r\ninput = sys.stdin.buffer.readline \r\n\r\ndef process(a, b):\r\n for x in range(1, 10**5):\r\n if x*x > a:\r\n a_fail = x \r\n break \r\n for x in range(1, 10**5):\r\n if x*(x+1) > b:\r\n b_fail = x \r\n break\r\n if b_fail < a_fail:\r\n sys.stdout.write('Valera\\n')\r\n else:\r\n sys.stdout.write('Vladik\\n')\r\n return \r\n\r\na, b = [int(x) for x in input().split()]\r\nprocess(a, b)", "r = ('Vladik' ,'Valera')\r\n\r\n\r\na,b = map(int,input().split())\r\nc = 1 \r\nwhile True:\r\n if c%2:\r\n a -= c\r\n else:\r\n b -= c\r\n c += 1\r\n if a < 0 or b < 0:break\r\nprint (r[c%2])\r\n", "a,b = map(int,input().split())\r\nna = int(pow(a,0.5))\r\nnb = int((pow(1+4*b,0.5)-1)/2)\r\nif na>nb:\r\n print('Valera')\r\nelse:\r\n print('Vladik')", "a, b = map(int, input().split())\r\ncur = 1\r\nwhile True:\r\n if a - cur < 0:\r\n print(\"Vladik\")\r\n exit()\r\n a -= cur\r\n cur += 1\r\n if b - cur < 0:\r\n print(\"Valera\")\r\n exit()\r\n b -= cur\r\n cur += 1\r\n", "a, b = map(int, input().split())\r\nstep = True\r\nk = 1\r\n\r\nwhile True:\r\n if step:\r\n a -= k\r\n if a < 0:\r\n print(\"Vladik\")\r\n break\r\n step = False\r\n k += 1\r\n else:\r\n b -= k\r\n if b < 0:\r\n print(\"Valera\")\r\n break\r\n step = True\r\n k += 1\r\n", "from math import sqrt\r\na, b = map(int, input().split())\r\nla = max(1, int(sqrt(a))-1)\r\nlb = max(1, int((-1-sqrt(1+4*b))/2)-1)\r\nwhile la*la <= a:\r\n la += 1\r\nla -= 1\r\nwhile lb*(lb+1) <= b:\r\n lb += 1\r\nlb -= 1\r\nif la <= lb:\r\n print('Vladik')\r\nelse:\r\n print('Valera')\r\n", "vd,va=map(int,input().split())\r\ndef sm(n):\r\n return n*n+n \r\nfrom math import sqrt as S \r\na=int(S(vd))\r\nb=0 \r\nlo=0\r\nhi=10**(9)\r\nwhile lo<=hi:\r\n mid=(lo+hi)//2 \r\n if sm(mid)<=va:\r\n ans=mid\r\n lo=mid+1 \r\n else:\r\n hi=mid-1 \r\nb=ans\r\nif a>b:\r\n print('Valera')\r\nelse:\r\n print('Vladik')", "vladik,valera=map(int, input().split())\nn=1\nwhile 1:\n\tif n%2==1:\n\t\tvladik-=n\n\t\tif vladik<0:\n\t\t\tprint (\"Vladik\")\n\t\t\tbreak\n\telse:\n\t\tvalera-=n\n\t\tif valera<0:\n\t\t\tprint (\"Valera\")\n\t\t\tbreak\n\tn+=1\n\n\n\t\t\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n", "n,m=map(int,input().split())\r\ni=1\r\nj=2\r\nwhile(1):\r\n if(i%2!=0):\r\n n=n-i\r\n i=i+1\r\n else:\r\n m=m-i\r\n i=i+1\r\n if(n<0):\r\n print('Vladik')\r\n break\r\n if(m<0):\r\n print('Valera')\r\n break\r\n \r\n \r\n ", "# Rishabh Rao (https://github.com/rishabhrao)\r\n\r\nimport sys\r\nMOD = 1000000007\r\ndef inp(): return sys.stdin.readline().strip()\r\ndef ii(): return int(inp())\r\ndef iis(): return [int(i) for i in inp().split()]\r\n\r\n\r\na, b = iis()\r\ngiving = 1\r\ncurr = 1\r\nwhile True:\r\n if curr and a - giving >= 0:\r\n a -= giving\r\n giving += 1\r\n curr = 1 - curr\r\n continue\r\n if not curr and b - giving >= 0:\r\n b -= giving\r\n giving += 1\r\n curr = 1 - curr\r\n continue\r\n break\r\nprint(\"Vladik\" if curr else \"Valera\")\r\n", "# for testCase in range(int(input())):\na ,b = map(int ,input().split())\ni = 1\nwhile True:\n if(i*i > a):\n print(\"Vladik\")\n break;\n elif(i*(i+1) > b):\n print(\"Valera\")\n break;\n else:\n i += 1\n", "a,b=map(int,input().split())\r\ni=1\r\nwhile a>=0 and b>=0:\r\n if i%2!=0:\r\n a-=i \r\n else:\r\n b-=i \r\n i+=1\r\nif (a<0):\r\n print(\"Vladik\")\r\nelse:\r\n print(\"Valera\")", "from math import sqrt, floor\n\n\ndef main():\n a, b = map(float, input().split())\n print(('Vladik', 'Valera')[floor(sqrt(a)) > floor(sqrt(b + .25) - .5)])\n\n\nif __name__ == '__main__':\n main()\n", "a,b = map(int,input().split())\r\nk = [a,b]\r\nf = 0\r\nct = 1\r\nwhile True:\r\n if k[f]>=ct:\r\n k[f]-=ct\r\n elif f:\r\n print(\"Valera\")\r\n break\r\n else:\r\n print(\"Vladik\")\r\n break;\r\n f^=1\r\n ct+=1", "import sys\r\n\r\ndef solve():\r\n a, b = map(int, input().split())\r\n\r\n for i in range(10**9):\r\n if 2*i + 1 > a:\r\n print('Vladik')\r\n return\r\n else:\r\n a -= 2*i + 1\r\n\r\n if 2*i + 2 > b:\r\n print('Valera')\r\n return\r\n else:\r\n b -= 2*i + 2\r\n\r\nif __name__ == '__main__':\r\n solve()", "a, b = list(map(int, input().split()))\nd1 = int(a**0.5)\nd2 = int(((1+4*b)**0.5 - 1)/2)\nif d1>d2:\n print(\"Valera\")\nelse:\n print(\"Vladik\")\n", "a, b = map(int, input().split())\ni = 1\nt = 1\nwhile t and i <= a or not t and i <= b:\n if t:\n a -= i\n t = 0\n else:\n b -= i\n t = 1\n i += 1\nprint('Vladik' if t else 'Valera')", "a, b = map(int, input().split())\r\ncnt = 0\r\nwhile True:\r\n cnt += 1\r\n a -= cnt\r\n if a < 0:\r\n print('Vladik')\r\n break\r\n cnt += 1\r\n b -= cnt\r\n if b < 0:\r\n print('Valera')\r\n break\r\n", "l=[int(e) for e in input().split()]\r\na=l[0]\r\nb=l[1]\r\ni=0\r\nwhile(1):\r\n if i%2==0:\r\n if b<0:\r\n print(\"Valera\")\r\n break\r\n b-=i\r\n else:\r\n if a<0:\r\n print(\"Vladik\")\r\n break\r\n a-=i \r\n i+=1 \r\n \r\n ", "def bin_search(calc, n):\r\n hi = n + 1\r\n lo = ans = 0\r\n while (hi - lo) > 1:\r\n mid = (hi + lo) // 2\r\n if calc(mid) <= n:\r\n lo = ans = mid\r\n else:\r\n hi = mid\r\n return ans\r\n\r\n\r\n[vl, va] = [int(x) for x in input().split()]\r\n[vl, va] = [bin_search(lambda x: x * x, vl), bin_search(lambda x: x * (x + 1), va)]\r\nprint('Valera') if vl > va else print('Vladik')\r\n", "vl,va=map(int,input().split())\r\nc=0\r\nf=1\r\nwhile vl>=0 and va>=0:\r\n if c%2==0:\r\n vl=vl-f\r\n else:\r\n va=va-f\r\n f=f+1\r\n c=c+1\r\nif vl<0:\r\n print('Vladik')\r\nelse:\r\n print('Valera')\r\n", "x,y=map(int,input().split())\r\ni=0\r\nwhile 1:\r\n if i%2==0:y-=i\r\n else:x-=i\r\n if x<0:\r\n print(\"Vladik\")\r\n exit()\r\n if y<0:\r\n print(\"Valera\")\r\n exit()\r\n i+=1", "import math\r\na,b = map(int,input().split())\r\nvladik = int(math.sqrt(a))\r\nhigh = int(math.sqrt(b))\r\nwhile True:\r\n\tif pow(high,2)+high <= b:\r\n\t\tbreak\r\n\thigh-=1\t\r\nvalera = high\t\r\nif vladik>valera:\r\n\tprint(\"Valera\")\r\nelse:\r\n\tprint(\"Vladik\")", "import math\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\na, b = map(int, input().split())\r\nf = int(math.sqrt(a))\r\ns = int(math.sqrt(b))\r\nif s * (s + 1) > b:\r\n s -= 1\r\n\r\nprint(\"Vladik\" if f <= s else \"Valera\")", "a=input().split(' ')\r\nc1=int(a[0])\r\nc2=int(a[1])\r\n\r\nx=int(c1**(1.0/2))\r\ny=(x)*(x+1)\r\nif y>c2:\r\n\tprint ('Valera')\r\nelse:\r\n\tprint ('Vladik')", "vl,va=list(map(int,input().strip().split()))\r\nfor i in range(vl+va):\r\n if i%2==0:\r\n vl=vl-(i+1)\r\n if vl<0:\r\n print(\"Vladik\")\r\n break\r\n else:\r\n va=va-(i+1)\r\n if va<0:\r\n print(\"Valera\")\r\n break\r\n", "a,b=map(int,input().split())\r\n\r\nad=1\r\nbd=2\r\n\r\nwhile a>=0 and b>=0:\r\n if a>=ad:\r\n a-=ad\r\n ad+=2\r\n else:\r\n print('Vladik')\r\n break\r\n\r\n if b>=bd:\r\n b-=bd\r\n bd+=2\r\n else:\r\n print('Valera')\r\n break\r\n", "import sys\r\nimport math\r\n\r\n#to read string\r\nget_string = lambda: sys.stdin.readline().strip()\r\n#to read list of integers\r\nget_int_list = lambda: list( map(int,sys.stdin.readline().strip().split()) )\r\n#to read non spaced string and elements are integers to list of int\r\nget_intList_from_str = lambda: list(map(int,list(sys.stdin.readline().strip())))\r\n#to read non spaced string and elements are character to list of character\r\nget_charList_from_str = lambda: list(sys.stdin.readline().strip())\r\n#get word sepetared list of character\r\nget_char_list = lambda: sys.stdin.readline().strip().split() \r\n#to read integers\r\nget_int = lambda: int(sys.stdin.readline())\r\n#to print faster\r\npt = lambda x: sys.stdout.write(str(x))\r\n\r\n#--------------------------------WhiteHat010--------------------------------#\r\na,b = get_int_list()\r\n\r\n#vladik give 1 3 5 7 ....n if a is total then he can make sqrt(a) chances\r\n#valera give 2 4 6 8 ....m if b is total then she can make m(m+1) chances\r\n\r\nn = int(math.sqrt(a)) #chances vladik can play\r\nm = n*(n+1) #for each chance of vladik valera need to play 1 chance \r\n #thus for n chances of valera she need m as total\r\nif m > b:\r\n print('Valera') #required sum more than she had, she lose\r\nelse:\r\n print('Vladik')", "a, b = map(int, input().split())\r\nt_v = int(a ** 0.5)\r\nprint(\"Vladik\" if t_v * (t_v + 1) <= b else \"Valera\")\r\n", "a,b=map(int,input().split())\r\nfor i in range(1,max(a,b)+1):\r\n if i%2!=0:\r\n a-=i\r\n else:\r\n b-=i\r\n if a-(i+1)<0 and i%2==0:\r\n f=1\r\n break\r\n elif b-(i+1)<0 and i%2!=0:\r\n f=2\r\n break\r\nif f==1:\r\n print(\"Vladik\")\r\nelif f==2:\r\n print(\"Valera\")", "a,b=map(int,input().split())\r\ni=1\r\nwhile(True):\r\n if(a>=i):\r\n a-=i\r\n i+=1\r\n else:\r\n print(\"Vladik\")\r\n exit(0)\r\n if(b>=i):\r\n b-=i\r\n i+=1\r\n else:\r\n print(\"Valera\")\r\n exit(0)\r\n" ]

[ "n , m = list(map (int, input().split()))\r\n\r\ncList = [0]*n\r\n\r\nfor i in range(m) :\r\n x, y, z = list(map (int, input().split()))\r\n\r\n r, s, t = cList[x -1], cList[y -1], cList[z -1]\r\n if r > 0 :\r\n s = (r + 1) % 3\r\n t = (r + 2) % 3\r\n if s == 0:\r\n s = 3\r\n elif t == 0:\r\n t = 3\r\n \r\n elif s > 0 :\r\n r = (s + 1) % 3\r\n t = (s + 2) % 3\r\n if r == 0:\r\n r = 3\r\n elif t == 0:\r\n t = 3\r\n \r\n elif t > 0 :\r\n r = (t + 1) % 3\r\n s = (t + 2) % 3\r\n if s == 0:\r\n s = 3\r\n elif r == 0:\r\n r = 3\r\n\r\n elif r == 0 :\r\n r, s, t = 1, 2, 3\r\n\r\n cList[x -1], cList[y -1], cList[z -1] = r, s, t\r\n \r\n\r\nfor i in range(n - 1):\r\n print(cList[i], end= \" \")\r\nprint(cList[n - 1])", "d={}\r\nn,m=map(int,input().split())\r\nfor i in range(m):\r\n k=[3,2,1]\r\n l=list(map(int,input().split()))\r\n temp=4\r\n for i in range(len(l)):\r\n if l[i] in d:\r\n temp=i\r\n k.remove(d[l[i]])\r\n break\r\n for i in range(len(l)):\r\n if i!=temp:\r\n d[l[i]]=k[-1]\r\n k.pop()\r\n \r\n \r\n\r\ns=list(d.keys())\r\ns.sort()\r\nfor i in s:\r\n print(d[i],end=\" \")", "n, m = map(int, input().split())\r\ncol = [0]*n\r\nused= set()\r\nd = {1:[2,3],\r\n 2:[1,3],\r\n 3:[1,2]\r\n }\r\nfor i in range(m):\r\n t1, t2, t3 = map(int, input().split())\r\n if t1 in used:\r\n col[t2-1] = d[col[t1-1]][0]\r\n col[t3-1] = d[col[t1-1]][1]\r\n elif t2 in used:\r\n col[t1 - 1] = d[col[t2-1]][0]\r\n col[t3 - 1] = d[col[t2-1]][1]\r\n elif t3 in used:\r\n col[t2-1] = d[col[t3-1]][0]\r\n col[t1-1] = d[col[t3-1]][1]\r\n else :\r\n col[t1-1]=1\r\n col[t2 - 1] = d[col[t1-1]][0]\r\n col[t3 - 1] = d[col[t1-1]][1]\r\n used.add(t1)\r\n used.add(t2)\r\n used.add(t3)\r\nprint(*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, insort\r\nfrom time import perf_counter\r\nfrom fractions import Fraction\r\nimport copy\r\nfrom copy import deepcopy\r\nimport time\r\nstarttime = time.time()\r\nmod = int(pow(10, 9) + 7)\r\nmod2 = 998244353\r\n\r\ndef data(): return sys.stdin.readline().strip()\r\ndef out(*var, end=\"\\n\"): sys.stdout.write(' '.join(map(str, var))+end)\r\ndef L(): return list(sp())\r\ndef sl(): return list(ssp())\r\ndef sp(): return map(int, data().split())\r\ndef ssp(): return map(str, data().split())\r\ndef l1d(n, val=0): return [val for i in range(n)]\r\ndef l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\r\ntry:\r\n # sys.setrecursionlimit(int(pow(10,6)))\r\n sys.stdin = open(\"input.txt\", \"r\")\r\n # sys.stdout = open(\"output.txt\", \"w\")\r\nexcept:\r\n pass\r\ndef pmat(A):\r\n for ele in A: print(*ele,end=\"\\n\")\r\n\r\n\r\n\r\nn,m=L()\r\nA=[L() for i in range(m)]\r\n\r\nf=[0 for i in range(n+1)]\r\nfor x,y,z in A:\r\n if f[x] or f[y] or f[z]:\r\n if f[x]:\r\n s=set([1,2,3])\r\n s.remove(f[x])\r\n f[y],f[z]=list(s)\r\n elif f[y]:\r\n s=set([1,2,3])\r\n s.remove(f[y])\r\n f[x],f[z]=list(s)\r\n elif f[z]:\r\n s=set([1,2,3])\r\n s.remove(f[z])\r\n f[y],f[x]=list(s)\r\n else:\r\n f[x],f[y],f[z]=1,2,3\r\nprint(*f[1:])\r\n", "n,m = map(int, input().split())\r\narr = [0]*(n+1)\r\n\r\nfor i in range(m):\r\n a,b,c = map(int, input().split())\r\n if arr[a]==0 and arr[b]==0 and arr[c]==0:\r\n arr[a] = 1\r\n arr[b] = 2\r\n arr[c] = 3\r\n else:\r\n brr = [1,2,3]\r\n if arr[a]!=0:\r\n brr.remove(arr[a])\r\n if arr[b]!=0:\r\n brr.remove(arr[b])\r\n if arr[c]!=0:\r\n brr.remove(arr[c])\r\n if arr[a]==0:\r\n arr[a] = brr[0]\r\n brr.remove(brr[0])\r\n if arr[b]==0:\r\n arr[b] = brr[0]\r\n brr.remove(brr[0])\r\n if arr[c]==0:\r\n arr[c] = brr[0]\r\n brr.remove(brr[0])\r\n\r\n\r\nprint(*arr[1:])\r\n \r\n \r\n", "n,m=map(int,input().split())\r\nli=[]\r\nfor i in range(m):\r\n li.append([int(x) for x in input().split()])\r\nd={}\r\nfor i in range(m):\r\n x=li[i]\r\n use=[True]*3\r\n l=[]\r\n for ele in x:\r\n if d.get(ele,0)!=0:\r\n use[d.get(ele)-1]=False\r\n for i in range(3):\r\n if use[i]==True:\r\n l.append(i)\r\n for ele in x:\r\n if d.get(ele,0)==0:\r\n d[ele]=l.pop()+1\r\n\r\nfor ele in sorted(d):\r\n print(d[ele],end=\" \")", "n,m=map(int,input().split())\r\n\r\nd1={x:0 for x in range(1,n+1) }\r\n# print(d1)\r\n\r\nwhile(m):\r\n\tlst=[1,2,3]\r\n\r\n\tx,y,z=map(int,input().split())\r\n\tif d1[x] !=0:\r\n\t\tlst.remove(d1[x])\r\n\r\n\tif d1[y] !=0:\r\n\t\tlst.remove(d1[y])\r\n\t\r\n\tif d1[z] !=0:\r\n\t\tlst.remove(d1[z])\r\n\r\n\tif d1[x]==0:\r\n\t\td1[x]=lst[0]\r\n\t\tlst.remove(lst[0])\r\n\tif d1[y]==0:\r\n\t\td1[y]=lst[0]\r\n\t\tlst.remove(lst[0])\r\n\tif d1[z]==0:\r\n\t\td1[z]=lst[0]\r\n\t\tlst.remove(lst[0])\t\t\r\n\r\n\r\n\r\n\r\n\r\n\tm-=1\r\n\r\n\r\nfor key,value in d1.items():\r\n\tprint(value)\r\n\r\n# print(d1)\r\n\r\n\r\n# a=[]\r\n\r\n", "n,m=map(int,input().split())\r\n \r\nans=[-1]*(n+1)\r\n \r\n \r\nfor k in range(m):\r\n \r\n\tdancers=list(map(int,input().split()))\r\n \r\n\tneed=[1,2,3]\r\n \r\n\tfor i in dancers:\r\n\t\tif(ans[i]!=-1):\r\n\t\t\tneed.remove(ans[i])\r\n\t\r\n\tfor i in dancers:\r\n\t\tif(ans[i]==-1):\r\n\t\t\tans[i]=need.pop(-1)\r\n\t\r\nprint(*ans[1:])", "n, m = map(int, input().split())\r\nmat = [(input().split()) for _ in range(m)]\r\ncol = [-1 for _ in range(n)]\r\ncol[int(mat[0][0]) - 1] = 1\r\nfor d in mat:\r\n cols = [1, 2, 3]\r\n for x in d: \r\n if col[int(x) - 1] != -1:\r\n cols.remove(col[int(x) - 1])\r\n for x in d: \r\n if col[int(x) - 1] == -1:\r\n col[int(x) - 1] = cols[0]\r\n cols.remove(cols[0])\r\n prev = d\r\nprint(' '.join(map(str, col)))\r\n", "import sys\r\nsys.setrecursionlimit(10**7)\r\nn,m=map(int,input().split())\r\n# graph=[[] for _ in range(n)]\r\nvis=[0]*(n+1)\r\nfor _ in range(m):\r\n x,y,z=map(int,input().split())\r\n took=[0]*(4)\r\n took[vis[x]]=1\r\n took[vis[y]]=1\r\n took[vis[z]]=1\r\n for ind in [x,y,z]:\r\n if vis[ind]==0:\r\n for i in range(1,4):\r\n if not took[i]:\r\n vis[ind]=i\r\n took[i]=1\r\n break\r\n # print(vis)\r\nprint(*vis[1:])", "\r\n\"\"\"\r\nint(input())\r\nmap(int,input().split())\r\nlist(map(int,input().split()))\r\n\r\n\"\"\"\r\n\r\n\r\n\r\nn,m=map(int,input().split())\r\nd=[0 for i in range(n)]\r\nfor i in range(m):\r\n x,y,z=map(int,input().split())\r\n x-=1\r\n y-=1\r\n z-=1\r\n \r\n s=[[d[x],x],[d[y],y],[d[z],z]]\r\n s.sort()\r\n # print(d,x,y,z,s)\r\n if(s[2][0]==0):\r\n # print(\"1\")\r\n d[x]=1\r\n d[y]=2\r\n d[z]=3\r\n elif(s[1][0]==0):\r\n # print(\"2\")\r\n a=[s[2][0]]\r\n b=[s[2][1]]\r\n for j in [x,y,z]:\r\n for k in [1,2,3]:\r\n if(j not in b and k not in a and d[j]==0):\r\n # print(j,k)\r\n d[j]=k\r\n a.append(k)\r\n b.append(j)\r\n elif(s[0][0]==0):\r\n # print(\"3\")\r\n a=[s[2][0],s[1][0]]\r\n b=[s[2][1],s[1][1]]\r\n for j in [x,y,z]:\r\n for k in [1,2,3]:\r\n if(j not in b and k not in a and d[j]==0):\r\n d[j]=k\r\n a.append(k)\r\n b.append(j)\r\n else:\r\n continue\r\nfor i in range(n):\r\n print(d[i],end=\" \")\r\n \r\n \r\n ", "s = input().split()\r\n(n,m) = (int(i) for i in s)\r\nres = [0 for i in range(0,n+1)]\r\n\r\nfor i in range(m):\r\n\ts = input().split()\r\n\ts = [int(i) for i in s]\r\n\tp = set([res[i] for i in s])\r\n\tfor i in range(3):\r\n\t\tif(res[s[i]] == 0):\r\n\t\t\tif(1 not in p):\r\n\t\t\t\tres[s[i]] = 1\r\n\t\t\t\tp.add(1)\r\n\t\t\telif(2 not in p):\r\n\t\t\t\tres[s[i]] = 2\r\n\t\t\t\tp.add(2)\r\n\t\t\telse:\r\n\t\t\t\tres[s[i]] = 3\r\n\t\t\t\tp.add(3)\r\n\r\nfor i in range(1,n+1):\r\n\tprint(res[i],end = ' ')\r\n\r\n", "n,k=map(int,input().split())\r\nl=[0]*n;\r\nfor i in range(k):\r\n\ta,b,c=map(int,input().split())\r\n\tx=[1,2,3]\r\n\tif (l[a-1]!=0):\r\n\t\tx.remove(l[a-1])\r\n\t\tl[b-1]=x[0]\r\n\t\tl[c-1]=x[1]\r\n\telif(l[b-1]!=0):\r\n\t\tx.remove(l[b-1])\r\n\t\tl[a-1]=x[0]\r\n\t\tl[c-1]=x[1]\r\n\telif(l[c-1]!=0):\r\n\t\tx.remove(l[c-1])\r\n\t\tl[a-1]=x[0]\r\n\t\tl[b-1]=x[1]\r\n\telse:\r\n\t\tl[a-1]=x[0]\r\n\t\tl[b-1]=x[1]\r\n\t\tl[c-1]=x[2]\r\nprint(*l)", "n,m = map(int,input().split())\r\n\r\ngroup = [list(map(int,input().split())) for _ in range(m)]\r\n\r\ncolours = [0]*(n+1)\r\nvisited = [False]*(n+1)\r\n\r\ncolours[group[0][0]]=1\r\ncolours[group[0][1]]=2\r\ncolours[group[0][2]]=3\r\n\r\nvisited[group[0][0]]=visited[group[0][1]]=visited[group[0][2]]=True\r\n\r\nfor i in range(1,m):\r\n curr = group[i]\r\n cset = set()\r\n for j in curr:\r\n if visited[j]:\r\n cset.add(colours[j])\r\n\r\n for j in curr:\r\n if visited[j]:\r\n continue\r\n \r\n if 1 not in cset:\r\n colours[j]=1\r\n cset.add(1)\r\n elif 2 not in cset:\r\n colours[j]=2\r\n cset.add(2)\r\n else:\r\n colours[j]=3\r\n cset.add(3)\r\n visited[j]=True\r\n\r\nprint(*colours[1:])\r\n\r\n \r\n\r\n\r\n", "n,m=map(int,input().split())\r\nlis=[]\r\nans=[0 for x in range(n+1)]\r\n \r\nfor x in range(m):\r\n a,b,c=list(map(int,input().split()))\r\n if ans[a]==0 and ans[b]==0 and ans[c]==0: ans[a]=1;ans[b]=2;ans[c]=3\r\n elif ans[a]!=0:\r\n if ans[a]==1:ans[b]=2;ans[c]=3\r\n if ans[a]==2:ans[b]=1;ans[c]=3\r\n if ans[a]==3:ans[b]=1;ans[c]=2\r\n elif ans[b]!=0:\r\n if ans[b]==1:ans[a]=2;ans[c]=3\r\n if ans[b]==2:ans[a]=1;ans[c]=3\r\n if ans[b]==3:ans[a]=1;ans[c]=2\r\n elif ans[c]!=0:\r\n if ans[c]==1:ans[a]=2;ans[b]=3\r\n if ans[c]==2:ans[a]=1;ans[b]=3\r\n if ans[c]==3:ans[a]=1;ans[b]=2\r\nfor x in ans[1:]:print(x,end=\" \")", "c = lambda:list(map(int, input().split()))\r\nn, m = c()\r\na = [0] * (n + 1)\r\nfor i in range(m):\r\n\tx = c()\r\n\tif any(a[i] for i in x):\r\n\t\td = [0] * 4\r\n\t\td[sum(a[i] for i in x)] = 1\r\n\t\tfor k in range(3):\r\n\t\t\tif not a[x[k]]:\r\n\t\t\t\tfor j in range(1, 4):\r\n\t\t\t\t\tif not d[j]:\r\n\t\t\t\t\t\ta[x[k]] = j\r\n\t\t\t\t\t\td[j] = 1\r\n\t\t\t\t\t\tbreak\r\n\telse:\r\n\t\tfor j in range(3):\r\n\t\t\ta[x[j]] = j + 1\r\nprint (*a[1:])\r\n", "n,m = map(int,input().split())\r\ndance_form = []\r\nfor _ in range (n+1):\r\n dance_form.append(-1)\r\nfor _ in range(m):\r\n sets ={1,2,3}\r\n a = list(map(int,input().split()))\r\n notwhom=-1;\r\n for person in a:\r\n if not dance_form[person]==-1:\r\n sets.discard(dance_form[person])\r\n notwhom=person\r\n for person in a:\r\n if not person == notwhom:\r\n dance_form[person] = sets.pop() \r\n \r\n[print(dance_form[person],end=\" \") for person in range(1,n+1)]\r\n\r\n\r\n\r\n", "iin = lambda: list(map(int, input().split(\" \")))\r\n\r\nn, m = iin()\r\n\r\nval = [0] * (n + 1)\r\n\r\nfor i in range(m):\r\n a, b, c = iin()\r\n\r\n used = val[a] or val[b] or val[c]\r\n\r\n for i in range(1, 4):\r\n if i == used:\r\n continue\r\n if not val[a]:\r\n val[a] = i\r\n elif not val[b]:\r\n val[b] = i\r\n elif not val[c]:\r\n val[c] = i\r\n\r\nfor i in range(1, n + 1):\r\n print(val[i], end=\" \")\r\n", "import os, sys\r\nfrom io import IOBase, BytesIO\r\npy2 = round(0.5)\r\nif py2:\r\n from future_builtins import ascii, filter, hex, map, oct, zip\r\n range = xrange\r\nBUFSIZE = 8192\r\nclass FastIO(BytesIO):\r\n newlines = 0\r\n \r\n def __init__(self, file):\r\n self._file = file\r\n self._fd = file.fileno()\r\n self.writable = 'x' in file.mode or 'w' in file.mode\r\n self.write = super(FastIO, self).write if self.writable else None\r\n \r\n def _fill(self):\r\n s = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.seek((self.tell(), self.seek(0,2), super(FastIO, self).write(s))[0])\r\n return s\r\n \r\n def read(self):\r\n while self._fill(): pass\r\n return super(FastIO,self).read()\r\n \r\n def readline(self):\r\n while self.newlines == 0:\r\n s = self._fill(); self.newlines = s.count(b'\\n') + (not s)\r\n self.newlines -= 1\r\n return super(FastIO, self).readline()\r\n \r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.getvalue())\r\n self.truncate(0), self.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 if py2:\r\n self.write = self.buffer.write\r\n self.read = self.buffer.read\r\n self.readline = self.buffer.readline\r\n else:\r\n self.write = lambda s:self.buffer.write(s.encode('ascii'))\r\n self.read = lambda:self.buffer.read().decode('ascii')\r\n self.readline = lambda:self.buffer.readline().decode('ascii')\r\n \r\n \r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip('\\r\\n')\r\n \r\n# Cout implemented in Python\r\nimport sys\r\nclass ostream:\r\n def __lshift__(self,a):\r\n sys.stdout.write(str(a))\r\n return self\r\ncout = ostream()\r\nendl = '\\n'\r\n\r\n\r\n\r\n\r\ndef solve():\r\n n, m = map(int, input().split())\r\n\r\n dncs = []\r\n for _ in range(m):\r\n a, b, c = map(int, input().split())\r\n dncs.append((a, b, c))\r\n\r\n res = [0] * (n + 1)\r\n\r\n for i in range(len(dncs)):\r\n a, b, c = dncs[i]\r\n c_taken = [1, 2, 3]\r\n n_taken = {1: False, 2: False, 3: False}\r\n if res[a] != 0:\r\n c_taken.remove(res[a])\r\n n_taken[1] = True\r\n if res[b] != 0:\r\n c_taken.remove(res[b])\r\n n_taken[2] = True\r\n if res[c] != 0:\r\n c_taken.remove(res[c])\r\n n_taken[3] = True\r\n\r\n # print(a, b, c, c_taken)\r\n\r\n if not n_taken[1]:\r\n res[a] = c_taken.pop(0)\r\n if not n_taken[2]:\r\n res[b] = c_taken.pop(0)\r\n if not n_taken[3]:\r\n res[c] = c_taken.pop(0)\r\n \r\n cout<<\" \".join(map(str, res[1:]))<<endl\r\n\r\n\r\n\r\ndef main():\r\n solve()\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n,m=map(int,input().split())\r\nd={}\r\nfor i in range(m):\r\n nc=[]\r\n c=[]\r\n l=list(map(int,list(input().split())))\r\n for j in range(3):\r\n if l[j] not in d.keys():\r\n nc.append(l[j])\r\n else:\r\n c.append(l[j])\r\n d1={}\r\n for u in c:\r\n d1[u]=d[u]\r\n for b in nc:\r\n for v in range(1,4):\r\n if v not in d1.values():\r\n d[b]=v\r\n d1[b]=v\r\n break\r\nfor i in sorted(d.items()):\r\n print(i[1],end=\" \")", "from sys import stdin,stdout\r\nfrom math import gcd\r\nii1 = lambda: int(stdin.readline().strip())\r\nis1 = lambda: stdin.readline().strip()\r\niia = lambda: list(map(int, stdin.readline().strip().split()))\r\nisa = lambda: stdin.readline().strip().split()\r\nmod = 1000000007\r\n\r\nn, m = iia()\r\narr = []\r\nfor _ in range(m):\r\n arr.append(iia())\r\ncol = [0] * (n)\r\nfor i in arr:\r\n cur = set([1,2,3])\r\n for j in i:\r\n if col[j - 1] > 0:\r\n cur.remove(col[j - 1])\r\n for j in i:\r\n if col[j - 1] == 0:\r\n col[j - 1] = cur.pop()\r\nprint(*col)\r\n\r\n ", "while True:\r\n try:\r\n n, m = map(int, input().split())\r\n color = {}\r\n\r\n for i in range(m):\r\n a, b, c = map(int, input().split())\r\n \r\n if a not in color and b not in color and c not in color:\r\n color[a] = 1\r\n color[b] = 2\r\n color[c] = 3\r\n elif a in color:\r\n if color[a] == 1:\r\n color[b] = 2\r\n color[c] = 3\r\n elif color[a] == 2:\r\n color[b] = 3\r\n color[c] = 1\r\n else:\r\n color[b] = 1\r\n color[c] = 2\r\n elif b in color:\r\n if color[b] == 1:\r\n color[a] = 2\r\n color[c] = 3\r\n elif color[b] == 2:\r\n color[a] = 3\r\n color[c] = 1\r\n else:\r\n color[a] = 1\r\n color[c] = 2\r\n elif c in color:\r\n if color[c] == 1:\r\n color[b] = 2\r\n color[a] = 3\r\n elif color[c] == 2:\r\n color[b] = 3\r\n color[a] = 1\r\n else:\r\n color[b] = 1\r\n color[a] = 2\r\n\r\n for i in range(1, n + 1):\r\n print(color[i], end=' ')\r\n print()\r\n \r\n except EOFError:\r\n break\r\n", "ds={}\na,b=[int(x) for x in input().split(' ')]\nfor i in range(b):\n d=[int (x) for x in input().split(' ')]\n for j in range(3):\n if d[j] not in ds:\n ds[d[j]]=j\n else:\n ds[d[(j+1)%3]]=(ds[d[j]]+1)%3\n ds[d[(j+2)%3]]=(ds[d[j]]+2)%3\n break\nprint(*[x + 1 for x in ds.values()])\n\n \t \t\t \t \t\t \t\t \t\t\t\t\t\t \t \t", "n, m = map(int, input().split())\r\ndances = []\r\nfor _ in range(m):\r\n dances.append([int(x) - 1 for x in input().split()])\r\n\r\nans = [0] * n\r\nfor dance in dances:\r\n for i in range(len(dance)):\r\n if ans[dance[i]] == 0:\r\n for col in range(1, 4):\r\n ok = True\r\n for j in range(len(dance)):\r\n if ans[dance[j]] == col:\r\n ok = False\r\n if ok:\r\n ans[dance[i]] = col\r\n break\r\n\r\nprint(*ans)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Oct 16 20:35:46 2013\r\n\r\n@author: Praveen Kumar\r\n\"\"\"\r\nimport sys\r\n\r\nx,n = map(int, input().split())\r\nd = {}\r\nfor i in range(n):\r\n a = list(map(int, input().split()))\r\n b = [1,2,3]\r\n rf = bf = wf = 0\r\n for j in a:\r\n if j in d:\r\n b.remove(d[j])\r\n a.remove(j)\r\n if len(b) != 0:\r\n for j in range(len(a)):\r\n d[a[j]] = b[j]\r\n\r\nfor i in range(1,len(d)+1):\r\n sys.stdout.write(str(d[i])+\" \")\r\n ", "n,m = map(int,input().split())\r\nl=[0]*(n+1)\r\nfor _ in range(m):\r\n p={1,2,3}\r\n arr = list(map(int,input().split()))\r\n for i in arr:\r\n if l[i]!=0:\r\n p.discard(l[i])\r\n for i in arr:\r\n if l[i]==0:\r\n l[i]=p.pop()\r\n #print(l)\r\nfor i in range(1,n+1):\r\n print(l[i],end=\" \")\r\n\r\n", "def readln():\n return tuple(map(int, input().split()))\n\nn, m = readln()\nans = [0] * (n + 1)\nfor _ in range(m):\n a = readln()\n for i in range(3):\n if ans[a[i]] == 1:\n ans[a[(i + 1) % 3]] = 2\n ans[a[(i + 2) % 3]] = 3\n break\n elif ans[a[i]] == 2:\n ans[a[(i + 1) % 3]] = 1\n ans[a[(i + 2) % 3]] = 3\n break\n elif ans[a[i]] == 3:\n ans[a[(i + 1) % 3]] = 1\n ans[a[(i + 2) % 3]] = 2\n break\n if not ans[a[0]]:\n ans[a[0]] = 1\n ans[a[1]] = 2\n ans[a[2]] = 3\nprint(' '.join(map(str, ans[1:])))\n", "n, m = list(map(int, input().split()))\r\ndances = [list(map(int, input().split())) for _ in range(m)]\r\ncolors = [None for _ in range(n+1)]\r\nfor dance in dances:\r\n available_colors = [3, 2, 1]\r\n for dancer in dance:\r\n color = colors[dancer]\r\n if color is not None:\r\n available_colors.remove(color)\r\n\r\n for dancer in dance:\r\n color = colors[dancer]\r\n if color is None:\r\n colors[dancer] = available_colors[-1]\r\n available_colors.pop()\r\nfor color in colors[1:]:\r\n print(color, end=' ')\r\n", "from sys import *\r\ninput = lambda:stdin.readline()\r\n\r\nint_arr = lambda : list(map(int,stdin.readline().strip().split()))\r\nstr_arr = lambda :list(map(str,stdin.readline().split()))\r\nget_str = lambda : map(str,stdin.readline().strip().split())\r\nget_int = lambda: map(int,stdin.readline().strip().split())\r\nget_float = lambda : map(float,stdin.readline().strip().split())\r\n\r\n\r\nmod = 1000000007\r\nsetrecursionlimit(1000)\r\n\r\n\r\n\r\nn,m = get_int()\r\narr = []\r\nfor i in range(m):\r\n arr.append(sorted(int_arr()))\r\n\r\ndic = {}\r\nflag = 0\r\nct = 0\r\nfor i in range(len(arr)):\r\n ct = 0\r\n if arr[i][0] in dic.keys():\r\n ct = 1\r\n if dic[arr[i][0]] == 1:\r\n flag = 1\r\n elif dic[arr[i][0]] == 2:\r\n flag = 2\r\n else:\r\n flag = 0\r\n elif arr[i][1] in dic.keys():\r\n ct = 2\r\n if dic[arr[i][1]] == 1:\r\n flag = 1\r\n elif dic[arr[i][1]] == 2:\r\n flag = 2\r\n else:\r\n flag = 0\r\n elif arr[i][2] in dic.keys():\r\n ct = 3\r\n if dic[arr[i][2]] == 1:\r\n flag = 1\r\n elif dic[arr[i][2]] == 2:\r\n flag = 2\r\n else:\r\n flag = 0\r\n if ct == 0:\r\n dic[arr[i][0]] = 1\r\n dic[arr[i][1]] = 2\r\n dic[arr[i][2]] = 3\r\n elif ct == 1:\r\n if flag == 0:\r\n dic[arr[i][1]] = 2\r\n dic[arr[i][2]] = 1\r\n elif flag == 1:\r\n dic[arr[i][1]] = 2\r\n dic[arr[i][2]] = 3\r\n else:\r\n dic[arr[i][1]] = 1\r\n dic[arr[i][2]] = 3\r\n elif ct == 2:\r\n if flag == 0:\r\n dic[arr[i][0]] = 2\r\n dic[arr[i][2]] = 1\r\n elif flag == 1:\r\n dic[arr[i][0]] = 2\r\n dic[arr[i][2]] = 3\r\n else:\r\n dic[arr[i][0]] = 1\r\n dic[arr[i][2]] = 3\r\n else:\r\n if flag == 0:\r\n dic[arr[i][1]] = 2\r\n dic[arr[i][0]] = 1\r\n elif flag == 1:\r\n dic[arr[i][1]] = 2\r\n dic[arr[i][0]] = 3\r\n else:\r\n dic[arr[i][1]] = 1\r\n dic[arr[i][0]] = 3\r\n\r\n\r\nfor i in range(1,n+1):\r\n print(dic[i],end = ' ')", "def main():\r\n\tn,m = map(int,input().split())\r\n\ta = [ 0 for i in range(n)]\r\n\tfor _ in range(m):\r\n\t\tdp = []\r\n\t\tm,n,p = map(int,input().split())\r\n\t\tm,n,p=m-1,n-1,p-1\r\n\t\tfor i in range(1,4):\r\n\t\t\tif a[m]!=i and a[n]!=i and a[p]!=i:\r\n\t\t\t\tdp.append(i)\r\n\t\tindex = 0\r\n\t\tif a[m]==0:\r\n\t\t\ta[m]=dp[index]\r\n\t\t\tindex+=1\r\n\t\tif a[n]==0:\r\n\t\t\ta[n]=dp[index]\r\n\t\t\tindex+=1\r\n\t\tif a[p]==0:\r\n\t\t\ta[p]=dp[index]\r\n\t\t\tindex+=1\r\n\tfor x in a:\r\n\t\tprint(x,end=' ')\r\n\r\n\r\n\r\n\r\nmain()\r\n", "#! /usr/bin/env python\n\nn, m = [int(x) for x in input().split()]\ndancers = {}\nfor i in range(m):\n dance = [int (x) for x in input().split()]\n for j in range(3):\n if dance[j] not in dancers:\n dancers[dance[j]] = j\n else:\n dancers[dance[(j + 1) % 3]] = (dancers[dance[j]] + 1) % 3\n dancers[dance[(j + 2) % 3]] = (dancers[dance[j]] + 2) % 3\n break\n\nprint(*[x + 1 for x in dancers.values()])\n", "n,m=map(int,input().split())\r\nclrd=[-1]*(n+1)\r\nfor i in range(m):\r\n dancers=[int(i) for i in input().split()]\r\n color=[1,2,3]\r\n for da in dancers:\r\n if clrd[da]!=-1:\r\n color.remove(clrd[da])\r\n for da in dancers:\r\n if clrd[da]==-1:\r\n clrd[da]=color.pop()\r\nprint(*(clrd[1:]))", "# ========= /\\ /| |====/|\r\n# | / \\ | | / |\r\n# | /____\\ | | / |\r\n# | / \\ | | / |\r\n# ========= / \\ ===== |/====| \r\n# code\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n,m = map(int,input().split())\r\n color = [0]*(n+1)\r\n i = m\r\n while i > 0:\r\n i -= 1\r\n a,b,c = map(int,input().split())\r\n if color[a] != 0:\r\n if color[a] == 1:\r\n color[b] = 2\r\n color[c] = 3\r\n if color[a] == 2:\r\n color[b] = 1\r\n color[c] = 3\r\n if color[a] == 3:\r\n color[b] = 2\r\n color[c] = 1\r\n elif color[b] != 0:\r\n if color[b] == 1:\r\n color[a] = 2\r\n color[c] = 3\r\n if color[b] == 2:\r\n color[a] = 1\r\n color[c] = 3\r\n if color[b] == 3:\r\n color[a] = 2\r\n color[c] = 1\r\n elif color[c] != 0:\r\n if color[c] == 1:\r\n color[b] = 2\r\n color[a] = 3\r\n if color[c] == 2:\r\n color[b] = 1\r\n color[a] = 3\r\n if color[c] == 3:\r\n color[b] = 2\r\n color[a] = 1\r\n else:\r\n color[a] = 1\r\n color[b] = 2\r\n color[c] = 3\r\n i = 1\r\n while i <= n:\r\n print(color[i],end=\" \")\r\n i += 1\r\n print()", "ls = input().split(\" \")\r\nn = int(ls[0])\r\nm = int(ls[1])\r\ndances = []\r\n\r\nfor i in range(m):\r\n inp = input().split(\" \")\r\n dances.append([int(inp[0]),int(inp[1]),int(inp[2])])\r\n\r\ncolors = [0]*(n)\r\nfor i in range(m):\r\n d1 = dances[i][0]-1\r\n d2 = dances[i][1]-1\r\n d3 = dances[i][2]-1\r\n \r\n if(colors[d1] == 0 and colors[d2] == 0 and colors[d3] == 0):\r\n colors[d1] = 1\r\n colors[d2] = 2\r\n colors[d3] = 3\r\n else:\r\n if(colors[d1] != 0 ):\r\n if(colors[d1] == 1):\r\n colors[d2] = 2\r\n colors[d3] = 3\r\n elif(colors[d1] == 2):\r\n colors[d2] = 1\r\n colors[d3] = 3\r\n elif(colors[d1] == 3):\r\n colors[d2] = 1\r\n colors[d3] = 2\r\n \r\n elif(colors[d2] != 0 ):\r\n if(colors[d2] == 1):\r\n colors[d1] = 2\r\n colors[d3] = 3\r\n elif(colors[d2] == 2):\r\n colors[d1] = 1\r\n colors[d3] = 3\r\n elif(colors[d2] == 3):\r\n colors[d1] = 1\r\n colors[d3] = 2\r\n \r\n elif(colors[d3] != 0 ):\r\n if(colors[d3] == 1):\r\n colors[d2] = 2\r\n colors[d1] = 3\r\n elif(colors[d3] == 2):\r\n colors[d2] = 1\r\n colors[d1] = 3\r\n elif(colors[d3] == 3):\r\n colors[d2] = 1\r\n colors[d1] = 2\r\nfor i in colors:\r\n print(i)", "while True:\n\ttry:\n\t\tdef find(a):\n\t\t\tarr = [1,2,3]\n\t\t\tfor i in range(3):\n\t\t\t\tif arr[i] != a:\n\t\t\t\t\treturn arr[i]\n\t\t\t\t\n\t\t\n\t\tdef solution(n, m, a):\n\t\t\tres = [0]*(n)\n\t\t\tfor i in range(m):\n\t\t\t\tif res[a[i][0]-1] > 0:\n\t\t\t\t\tres[a[i][1]-1] = find(res[a[i][0]-1])\n\t\t\t\t\tres[a[i][2]-1] = 6 - (res[a[i][1]-1] + res[a[i][0]-1])\n\t\t\t\t\tcontinue\n\t\t\t\tif res[a[i][1]-1] > 0:\n\t\t\t\t\tres[a[i][0]-1] = find(res[a[i][1]-1])\n\t\t\t\t\tres[a[i][2]-1] = 6 - (res[a[i][1]-1] + res[a[i][0]-1])\n\t\t\t\t\tcontinue\n\t\t\t\tif res[a[i][2]-1] > 0:\n\t\t\t\t\tres[a[i][1]-1] = find(res[a[i][2]-1])\n\t\t\t\t\tres[a[i][0]-1] = 6 - (res[a[i][1]-1] + res[a[i][2]-1])\n\t\t\t\t\tcontinue\n\t\t\t\telse:\n\t\t\t\t\tres[a[i][1]-1] =2\n\t\t\t\t\tres[a[i][2]-1] = 3\n\t\t\t\t\tres[a[i][0]-1] = 1\n\t\t\tprint(*res)\n\t\t\t\t\n\t\tdef read():\n\t\t\tn, m = map(int, input().split())\n\t\t\ta = list()\n\t\t\tfor i in range(m):\n\t\t\t\tb = list(map(int, input().split()))\n\t\t\t\ta.append(b)\n\t\t\t\tdel b\n\t\t\tsolution(n, m, a)\n\t\n\t\t\t\n\t\tif __name__ == \"__main__\":\n\t\t\tread()\n\texcept EOFError:\n\t\tbreak", "n,m=map(int,input().split())\r\ndancers={'auther':'wanglizhi'}\r\nfor i in range(m):\r\n a,b,c=map(int,input().split())\r\n if(a in dancers):\r\n color=dancers[a]\r\n dancers[b]=(color+1)%3\r\n dancers[c]=(color+2)%3\r\n elif(b in dancers):\r\n color=dancers[b]\r\n dancers[a]=(color+1)%3\r\n dancers[c]=(color+2)%3\r\n elif(c in dancers):\r\n color=dancers[c]\r\n dancers[a]=(color+1)%3\r\n dancers[b]=(color+2)%3\r\n else:\r\n dancers[a]=0\r\n dancers[b]=1\r\n dancers[c]=2\r\nfor i in range(n-1):\r\n print((dancers[i+1]+1),end=' ')\r\nprint(dancers[n]+1)\r\n\r\n", "n,m = map(int, input().split())\r\narr = [0]*(n+1)\r\nfor i in range(m):\r\n\ta,b,c = map(int, input().split())\r\n\ttemp = [arr[a], arr[b], arr[c]]\r\n\tif temp == [0,0,0]:\r\n\t\tarr[a] = 1\r\n\t\tarr[b] = 2\r\n\t\tarr[c] = 3\r\n\telse:\r\n\t\tremain = list(set([1,2,3]) - set(temp))\r\n\t\tif arr[a] == 0:\r\n\t\t\tarr[a] = remain.pop()\r\n\t\tif arr[b] == 0:\r\n\t\t\tarr[b] = remain.pop()\r\n\t\tif arr[c] == 0:\r\n\t\t\tarr[c] = remain.pop()\r\nprint(*arr[1:])", "n, m = map(int, input().split())\ndances = []\ncolors = [0] * (n + 1)\nfor _ in range(m):\n temp1, temp2, temp3 = map(int, input().split())\n dances.append([temp1, temp2, temp3])\ni = 0\n# print(dances)\nwhile i < len(dances):\n check = ['w', 'r', 'b']\n for j in range(len(check)):\n if colors[dances[i][0]] == check[j]:\n check[j] = -1\n break\n elif colors[dances[i][1]] == check[j]:\n check[j] = -1\n break\n elif colors[dances[i][2]] == check[j]:\n check[j] = -1\n break\n for j in range(len(dances[i])):\n # print(dances[i][j])\n if colors[dances[i][j]] == 0:\n if check[0] != -1:\n colors[dances[i][j]] = check[0]\n check[0] = -1\n elif check[1] != -1:\n colors[dances[i][j]] = check[1]\n check[1] = -1\n else:\n colors[dances[i][j]] = check[2]\n check[2] = -1\n # print(check)\n i += 1\n\n\nfor i in range(1, len(colors)):\n if colors[i] == 'w':\n print(1, end=' ')\n elif colors[i] == 'r':\n print(2, end=' ')\n else:\n print(3, end=' ')\n", "\r\nn,m = map(int,input().split())\r\n\r\nhash = {}\r\nseti = set()\r\nfor i in range(m):\r\n a,b,c = map(int,input().split())\r\n\r\n if a not in seti and b not in seti and c not in seti:\r\n hash[a] = 1\r\n hash[b] = 2\r\n hash[c] = 3\r\n seti.add(a)\r\n seti.add(b)\r\n seti.add(c)\r\n elif a in seti:\r\n if hash[a] == 1:\r\n hash[b] = 2\r\n hash[c] = 3\r\n\r\n if hash[a] == 2:\r\n hash[b] = 1\r\n hash[c] = 3\r\n if hash[a] == 3:\r\n hash[b] = 1\r\n hash[c] = 2\r\n seti.add(a)\r\n seti.add(b)\r\n seti.add(c)\r\n elif b in seti:\r\n if hash[b] == 1:\r\n hash[a] = 2\r\n hash[c] = 3\r\n if hash[b] == 2:\r\n hash[a] = 1\r\n hash[c] = 3\r\n if hash[b] == 3:\r\n hash[a] = 1\r\n hash[c] = 2\r\n seti.add(a)\r\n seti.add(b)\r\n seti.add(c)\r\n elif c in seti:\r\n if hash[c] == 1:\r\n hash[b] = 2\r\n hash[a] = 3\r\n if hash[c] == 2:\r\n hash[b] = 1\r\n hash[a] = 3\r\n if hash[c] == 3:\r\n hash[b] = 1\r\n hash[a] = 2\r\n seti.add(a)\r\n seti.add(b)\r\n seti.add(c)\r\n\r\nl = list(sorted(hash.keys()))\r\nfor i in l:\r\n print(hash[i],end = ' ')\r\n", "a = list(map(int,input().strip().split()))\r\nn=a[0]\r\nm=a[1]\r\nb=[0]*n\r\n\r\nfor _ in range(m):\r\n c=[1,2,3]\r\n a = list(map(int,input().strip().split()))\r\n for i in a:\r\n if b[i-1]!=0:\r\n c.pop(c.index(b[i-1]))\r\n for i in a:\r\n if b[i-1]==0:\r\n b[i-1]=c[0]\r\n c.pop(0)\r\nfor i in b:\r\n print(i,end=' ')\r\nprint()", "n, m = map(int, input().split())\ncolor = [0] * (n + 5)\nwhile m:\n m += -1\n l = list(map(int, input().split()))\n w, r, b = 0, 0, 0\n for i in range(3):\n if color[l[i]] == 1:\n w = 1\n if color[l[i]] == 2:\n r = 1\n if color[l[i]] == 3:\n b = 1\n if w != 1: \n for i in range(3):\n if color[l[i]] == 0: \n color[l[i]] = 1\n break\n if r != 1: \n for i in range(3):\n if color[l[i]] == 0: \n color[l[i]] = 2\n break\n if b != 1: \n for i in range(3):\n if color[l[i]] == 0: \n color[l[i]] = 3\n break\nfor i in range(1, n + 1): print(color[i], end = \" \")\n\t\t \t\t\t \t\t \t\t \t \t\t\t \t \t \t\t", "def main():\r\n n, m = list(map(int, input().split()))\r\n ans = [0] * n\r\n for i in range(m):\r\n t1, t2, t3 = list(map(int, input().split()))\r\n if ans[t1-1] != 0:\r\n if ans[t1-1] == 1:\r\n ans[t2-1] = 2\r\n ans[t3-1] = 3\r\n elif ans[t1-1] == 2:\r\n ans[t2-1] = 1\r\n ans[t3-1] = 3\r\n else:\r\n ans[t2-1] = 1\r\n ans[t3-1] = 2\r\n\r\n elif ans[t2 - 1] != 0:\r\n if ans[t2 - 1] == 1:\r\n ans[t1 - 1] = 2\r\n ans[t3 - 1] = 3\r\n elif ans[t2 - 1] == 2:\r\n ans[t1 - 1] = 1\r\n ans[t3 - 1] = 3\r\n else:\r\n ans[t1 - 1] = 1\r\n ans[t3 - 1] = 2\r\n\r\n elif ans[t3 - 1] != 0:\r\n if ans[t3 - 1] == 1:\r\n ans[t2 - 1] = 2\r\n ans[t1 - 1] = 3\r\n elif ans[t3 - 1] == 2:\r\n ans[t2 - 1] = 1\r\n ans[t1 - 1] = 3\r\n else:\r\n ans[t2 - 1] = 1\r\n ans[t1 - 1] = 2\r\n else:\r\n ans[t1-1] = 1\r\n ans[t2-1] = 2\r\n ans[t3-1] = 3\r\n\r\n print(*ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n, m = map(int, input().split())\r\ncolors = {}\r\nfor i in range(m):\r\n dancers = list(map(int, input().split()))\r\n avCols = {1, 2, 3}\r\n ans = 0\r\n for j in range(3):\r\n if dancers[j] in colors:\r\n avCols.remove(colors[dancers[j]])\r\n dancers.pop(j)\r\n break\r\n for j in range(len(dancers)):\r\n colors[dancers[j]] = avCols.pop()\r\n\r\nfor i in range(n):\r\n print(colors[i+1], end=' ')", "n,m=map(int,input().split())\r\nd={}\r\nfor _ in range(m):\r\n h=[1,2,3]\r\n l=list(map(int,input().split()))\r\n for i in l:\r\n x=d.get(i,-1)\r\n if x!=-1:\r\n l.remove(i)\r\n h.remove(x)\r\n else:\r\n # print(d)\r\n # print(l,h)\r\n for j in range(len(l)):\r\n d[l[j]]=h[j]\r\n# print(d)\r\nfor i in sorted(d.keys()):\r\n print(d[i],end=' ')\r\n\r\n\r\n\r\n \r\n\r\n ", "n,m = map(int,input().split())\r\nans=[0]*(n+1)\r\nx=[1,2,3]\r\nfor i in range(m):\r\n q=0\r\n a,b,c=map(int,input().split())\r\n if(ans[a]==0 and ans[b]==0 and ans[c]==0):\r\n ans[a]=1\r\n ans[b]=2\r\n ans[c]=3\r\n elif(ans[a]!=0 or ans[b]!=0 or ans[c]!=0):\r\n r=list(set(x)-set([ans[a],ans[b],ans[c]]))\r\n if(ans[a]==0):\r\n ans[a]=r[q]\r\n q+=1\r\n if(ans[b]==0):\r\n ans[b]=r[q]\r\n q+=1\r\n if(ans[c]==0):\r\n ans[c]=r[q]\r\n q+=1\r\nprint(*ans[1:])\r\n", "def main():\r\n n, m = map(int, input().split())\r\n\r\n result = [0] * n\r\n\r\n for _ in range(m):\r\n a, b, c = map(int, input().split())\r\n a -= 1\r\n b -= 1\r\n c -= 1\r\n\r\n if result[a] != 0:\r\n result[b] = result[a] % 3 + 1\r\n result[c] = result[b] % 3 + 1\r\n elif result[b] != 0:\r\n result[a] = result[b] % 3 + 1\r\n result[c] = result[a] % 3 + 1\r\n elif result[c] != 0:\r\n result[a] = result[c] % 3 + 1\r\n result[b] = result[a] % 3 + 1\r\n else:\r\n result[a] = 1\r\n result[b] = 2\r\n result[c] = 3\r\n\r\n print(*result)\r\n\r\n\r\nmain()\r\n", "n,m=map(int,input().split(\" \"))\r\ncl=[0]*(n+1)\r\nfor i in range(m):\r\n x,y,z=list(map(int,input().split(\" \")))\r\n if i==0 or (cl[x]==0 and cl[y]==0 and cl[z]==0):\r\n cl[x]=1\r\n cl[y]=2\r\n cl[z]=3\r\n else:\r\n if cl[x]!=0:\r\n if cl[x]==1:\r\n cl[y],cl[z]=2,3\r\n elif cl[x]==2:\r\n cl[y],cl[z]=1,3\r\n else:\r\n cl[y],cl[z]=1,2\r\n elif cl[y]!=0:\r\n if cl[y]==1:\r\n cl[x],cl[z]=2,3\r\n elif cl[y]==2:\r\n cl[x],cl[z]=1,3\r\n else:\r\n cl[x],cl[z]=1,2\r\n elif cl[z]!=0:\r\n if cl[z]==1:\r\n cl[y],cl[x]=2,3\r\n elif cl[z]==2:\r\n cl[y],cl[x]=1,3\r\n else:\r\n cl[y],cl[x]=1,2\r\ncl = [str(i) for i in cl]\r\nprint(\" \".join(cl[1:]))\r\n", "import sys\r\nfrom collections import Counter\r\ndef fmax(n,m,a):\r\n c = [0]*m\r\n b = [0]*n\r\n\r\n if n ==3*m:\r\n for i in range(n//3):\r\n for j in range(3):\r\n b[a[i][j]-1]= j+1\r\n \r\n for i in range(m):\r\n flag =1\r\n for j in range(3):\r\n if b[a[i][j]-1] != 0 :\r\n index = b[a[i][j]-1]\r\n if j==0 and index==1:\r\n continue\r\n b[a[i][index-1]-1] = j+1\r\n continue\r\n b[a[i][j]-1] = j+1\r\n \r\n return b \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 m = data[1]\r\n l = 0\r\n a = []\r\n for i in range(m):\r\n a.append(list(map(int,(data[l+2:l+5]))))\r\n l = l+3\r\n \r\n print(*fmax(n,m,a))", "import sys;\n\nnbDancers, nbDances = map(int, sys.stdin.readline().split(' '));\ndancers = [0]*(nbDancers+1);\n\nfor line in sys.stdin:\n\ttaken = [False, False, False, False];\n\n\tds = list(map(int, line.split(' ')));\n\n\tfor d in ds:\n\t\ttaken[dancers[d]] = True;\n\n\tfor d in ds:\n\t\tif dancers[d] == 0:\n\t\t\tiCurr = 1;\n\t\t\twhile iCurr <= 3 and taken[iCurr]:\n\t\t\t\tiCurr += 1;\n\n\t\t\tdancers[d] = iCurr;\n\t\t\ttaken[iCurr] = True;\n\nprint(' '.join(map(str, dancers[1:])));\n", "n,m=map(int,input().split())\r\nL=[0]*n\r\nA=[1,2,3]\r\nfor i in range(m):\r\n a,b,c=map(int,input().split())\r\n if L[a-1] in A or L[b-1] in A or L[c-1] in A:\r\n if L[a-1] in A:\r\n x=L[a-1]\r\n A.remove(x)\r\n L[b-1]=A[0]\r\n L[c-1]=A[1]\r\n A.append(x)\r\n elif L[b-1] in A:\r\n x=L[b-1]\r\n A.remove(x)\r\n L[a-1]=A[0]\r\n L[c-1]=A[1]\r\n A.append(x)\r\n elif L[c-1] in A:\r\n x=L[c-1]\r\n A.remove(x)\r\n L[a-1]=A[0]\r\n L[b-1]=A[1]\r\n A.append(x)\r\n else:\r\n L[a-1]=A[0]\r\n L[b-1]=A[1]\r\n L[c-1]=A[2]\r\nprint(*L)\r\n ", "n, m = map(int, input().split())\r\na = []\r\nfor _ in range(m):\r\n a.append(list(map(int, input().split())))\r\n\r\n\r\n\r\no = {}\r\nfor item in a:\r\n e = [1, 2, 3];valid = []\r\n for _item in item:\r\n if o.get(_item):e.remove(o[_item])\r\n \r\n\r\n else:valid.append(_item)\r\n \r\n\r\n for i, item in enumerate(valid):\r\n o[item] = e[i]\r\n \r\nu = [0 for i in range(n)]\r\nfor key, value in o.items():\r\n u[key-1] = value\r\nprint(*u)", "n,m=map(int,input().split())\r\nclrd=[-1]*(n+1)\r\nfor i in range(m):\r\n dancers=[int(i) for i in input().split()]\r\n hua=[1,2,3]\r\n for da in dancers:\r\n if clrd[da]!=-1:\r\n hua.remove(clrd[da])\r\n for da in dancers:\r\n if clrd[da]==-1:\r\n clrd[da]=hua.pop()\r\nprint(*(clrd[1:]))\r\n\r\n\r\n\r\n\r\n'''\r\n-1 3 2 1 -1 -1 -1 -1\r\n'''", "n,m = map(int, input().split())\narr = [0]*(n+1)\nfor i in range(m):\n\ta,b,c = map(int, input().split())\n\ttemp = [arr[a], arr[b], arr[c]]\n\tif temp == [0,0,0]:\n\t\tarr[a] = 1\n\t\tarr[b] = 2\n\t\tarr[c] = 3\n\telse:\n\t\trem = list(set([1,2,3]) - set(temp))\n\t\tif arr[a] == 0:\n\t\t\tarr[a] = rem.pop()\n\t\tif arr[b] == 0:\n\t\t\tarr[b] = rem.pop()\n\t\tif arr[c] == 0:\n\t\t\tarr[c] = rem.pop()\nprint(*arr[1:])\n \t \t \t \t \t \t\t \t\t\t \t\t \t\t\t\t\t", "from collections import defaultdict, deque\nfrom functools import lru_cache\nfrom heapq import heappush, heappop\nfrom bisect import bisect_right, bisect_left\n\nimport math\nhpop = heappop\nhpush = heappush\nMOD = 10**9 + 7\n\ndef solution():\n\n n,m = map(int, input().split())\n color = defaultdict(int)\n for _ in range(m):\n a,b,c = map(int, input().split())\n\n avoid = color[a] + color[b] + color[c]\n cloth = (i for i in range(1,4) if i != avoid)\n for node in [a,b,c]:\n if color[node] == 0:\n color[node] = next(cloth)\n\n for node in range(1,n+1):\n print(color[node],end=\" \")\n\ndef main():\n t = 1\n #t = int(input())\n for _ in range(t):\n solution() \n#import sys\n#import threading\n#sys.setrecursionlimit(1 << 30)\n#threading.stack_size(1 << 27)\n#thread = threading.Thread(target=main)\n#thread.start(); thread.join()\nmain()\n \n \n \n \n\"\"\"\n\"\"\"\n", "n,m=map(int,input().split(\" \"))\r\nb=[0]*(n+1)\r\nb[0]=99\r\n# print(b)\r\nfor i in range(m):\r\n a=list(map(int,input().split(\" \")))\r\n k=1\r\n for i in range(len(a)):\r\n # print(b[a[i]])\r\n if(b[a[i]]==0):\r\n b[a[i]]=k\r\n k=k+1\r\n if(b[a[i]]==b[a[i-1]] or b[a[i]]==b[a[i-2]]):\r\n # print(b[a[i]])\r\n b[a[i]]=k\r\n k+=1\r\nb=b[1:]\r\nprint(*b)\r\n ", "num_dancers,num_dances=map(int,input().split())\r\ndance=list()\r\ncolors=[-1]*num_dancers\r\nfor i in range(0,num_dances):\r\n dance=(list(map(int,input().split())))\r\n col=[1,2,3] \r\n for j in dance:\r\n if colors[j-1] != -1:\r\n col.remove(colors[j-1])\r\n for j in dance:\r\n if colors[j-1] == -1:\r\n colors[j-1]=col.pop()\r\nprint(*colors,sep=' ')", "n, m = map(int, input().split())\r\n\r\n# Initialize lists to keep track of dancers available for each color\r\nwhite_dancers = list(range(1, n + 1))\r\nred_dancers = list(range(1, n + 1))\r\nblue_dancers = list(range(1, n + 1))\r\n\r\n# Initialize a list to store the assigned colors for each dancer\r\ncolors = [0] * (n+1)\r\n\r\nfor i in range(m):\r\n a, b, c = map(int, input().split())\r\n\r\n if colors[a] == 0 and colors[b] == 0:\r\n if colors[c] == 0:\r\n colors[a] = 1\r\n colors[b] = 2\r\n colors[c] = 3\r\n continue\r\n elif colors[c] == 1:\r\n colors[a] = 2\r\n colors[b] = 3\r\n continue\r\n elif colors[c] == 2:\r\n colors[a] = 1\r\n colors[b] = 3\r\n continue\r\n elif colors[c] == 3:\r\n colors[a] = 1\r\n colors[b] = 2\r\n continue\r\n \r\n if colors[a] == 0 and colors[c] == 0:\r\n if colors[b] == 0:\r\n colors[a] = 1\r\n colors[b] = 2\r\n colors[c] = 3\r\n continue\r\n elif colors[b] == 1:\r\n colors[a] = 2\r\n colors[c] = 3\r\n continue\r\n elif colors[b] == 2:\r\n colors[a] = 1\r\n colors[c] = 3\r\n elif colors[b] == 3:\r\n colors[a] = 1\r\n colors[c] = 2\r\n \r\n if colors[c] == 0 and colors[b] == 0:\r\n if colors[a] == 0:\r\n colors[a] = 1\r\n colors[b] = 2\r\n colors[c] = 3\r\n continue\r\n elif colors[a] == 1:\r\n colors[c] = 2\r\n colors[b] = 3\r\n continue\r\n elif colors[a] == 2:\r\n colors[c] = 1\r\n colors[b] = 3\r\n elif colors[a] == 3:\r\n colors[c] = 1\r\n colors[b] = 2\r\n \r\n \r\ncolors = colors[1:]\r\n# Print the assigned colors for each dancer\r\nprint(*colors)\r\n", "n,m=list(map(int,input().split()))\r\ncount=[0]*(n+1)\r\nflag=0\r\nfor ii in range(m):\r\n if ii==0:\r\n a=list(map(int,input().rstrip().split()))\r\n prev1=a[0]\r\n prev2=a[1]\r\n prev3=a[2]\r\n count[a[0]],count[a[1]],count[a[2]]=1,2,3\r\n else:\r\n a=list(map(int,input().rstrip().split()))\r\n toassign=[a[0],a[1],a[2]]\r\n avail=[1,2,3]\r\n if count[a[0]]>0:\r\n avail.pop(avail.index(count[a[0]]))\r\n toassign.pop(toassign.index(a[0]))\r\n if count[a[1]]>0:\r\n avail.pop(avail.index(count[a[1]]))\r\n toassign.pop(toassign.index(a[1]))\r\n \r\n if count[a[2]]>0:\r\n avail.pop(avail.index(count[a[2]]))\r\n toassign.pop(toassign.index(a[2]))\r\n l=0\r\n \r\n for i in toassign:\r\n count[i]=avail[l]\r\n l+=1\r\ncount.pop(0)\r\nprint(*count)\r\n \r\n \r\n ", "n,m=map(int,input().split())\r\nD=[0]*(10**5+1)\r\nDancers=[]\r\ndiff=[0]*(10**5+1)\r\nfor i in range(m):\r\n a,b,c=map(int,input().split())\r\n if i==0:\r\n D[a]=1\r\n D[b]=2\r\n D[c]=3\r\n else:\r\n if D[a]==0 : \r\n if 1 not in [D[b],D[c]]:\r\n D[a]=1\r\n elif 2 not in [D[b],D[c]]:\r\n D[a]=2\r\n else:\r\n D[a]=3 \r\n if D[b]==0 : \r\n if 1 not in [D[a],D[c]]:\r\n D[b]=1\r\n elif 2 not in [D[a],D[c]]:\r\n D[b]=2\r\n \r\n else:\r\n D[b]=3 \r\n if D[c]==0 : \r\n if 1 not in [D[b],D[a]]:\r\n D[c]=1\r\n elif 2 not in [D[b],D[a]]:\r\n D[c]=2\r\n else:\r\n D[c]=3\r\n diff[a],diff[b],diff[c]=1,1,1\r\n Dancers.append([a,b,c])\r\n\r\nfor i in range(len(diff)):\r\n if diff[i]!=0:\r\n print(D[i],end=' ')\r\n \r\n", "n,m=list(map(int,input().split()))\ndic=dict(zip(range(1,n+1),[0]*n))\n\ndef work(arr):\n s1=set([1,2,3])\n s=set()\n for item in arr:\n s.add(dic[item])\n s1=s1-s\n for item in arr:\n if dic[item]==0:\n dic[item]=s1.pop()\n \n\nfor i in range(m):\n arr=list(map(int,input().split()))\n work(arr)\n\nfor item in sorted(dic):\n\tprint(dic[item],end=\" \")\n", "n,m=map(int,input().split())\r\nx=[]\r\nfor i in range(m):\r\n x.append(list(map(int,input().split())))\r\nd={}\r\nfor i,j in enumerate(x):\r\n y = [1, 2, 3]\r\n if i==0:\r\n d[j[0]]=1\r\n d[j[1]]=2\r\n d[j[2]]=3\r\n continue\r\n for k in j:\r\n if k in d:\r\n y.remove(d[k])\r\n c=0\r\n for k in j:\r\n if k not in d:\r\n d[k]=y[c]\r\n c+=1\r\nx=sorted(d)\r\nfor i in x:\r\n print(d[i],end=\" \")", "import sys\r\ndef input():\r\n return sys.stdin.readline().strip()\r\n \r\n \r\ndef iinput():\r\n return int(input())\r\n \r\n \r\ndef tinput():\r\n return input().split()\r\n \r\n \r\ndef rinput():\r\n return map(int, tinput())\r\n \r\n \r\ndef rlinput():\r\n return list(rinput())\r\n\r\nn,m = rinput()\r\nA = []\r\nfor _ in range(m):\r\n A.append(rlinput())\r\nans = [0]*(n+1)\r\nfor i in range(m):\r\n array = [ans[A[i][0]],ans[A[i][1]],ans[A[i][2]]]\r\n if array.count(0) == 3:\r\n ans[A[i][0]] = 1\r\n ans[A[i][1]] = 2\r\n ans[A[i][2]] = 3\r\n else:\r\n for j in range(3):\r\n if array[j] != 0:\r\n break\r\n p = set([1,2,3]) - set([array[j]])\r\n p = list(p)\r\n index = 0\r\n for k in range(3):\r\n if array[k] == 0:\r\n ans[A[i][k]] = p[index]\r\n index += 1\r\nprint(*ans[1:])\r\n\r\n", "def zip_sorted(a,b):\n\n\t# sorted by a\n\ta,b = zip(*sorted(zip(a,b)))\n\t# sorted by b\n\tsorted(zip(a, b), key=lambda x: x[1])\n\n\treturn a,b\n\nimport sys\ninput = sys.stdin.readline\nI = lambda : list(map(int,input().split()))\nS = lambda : list(map(str,input().split()))\n\n\nn,m=I()\nw = [0]*m\nr = [0]*m\nb = [0]*m\nw1 = [0]*(n+1)\nfor i in range(m):\n\tw[i],r[i],b[i] = I() \n\tif w1[w[i]]==0:\n\t\tfor j in range(1,4):\n\t\t\tif w1[w[i]]==j or w1[r[i]]==j or w1[b[i]]==j:\n\t\t\t\tpass\n\t\t\telse:\n\t\t\t\tw1[w[i]] = j\n\t\t\t\tbreak\n\tif w1[r[i]]==0:\n\t\tfor j in range(1,4):\n\t\t\tif w1[w[i]]==j or w1[r[i]]==j or w1[b[i]]==j:\n\t\t\t\tpass\n\t\t\telse:\n\t\t\t\tw1[r[i]] = j\n\t\t\t\tbreak\n\tif w1[b[i]]==0:\n\t\tfor j in range(1,4):\n\t\t\tif w1[w[i]]==j or w1[r[i]]==j or w1[b[i]]==j:\n\t\t\t\tpass\n\t\t\telse:\n\t\t\t\tw1[b[i]] = j\n\t\t\t\tbreak\nprint(*w1[1:])\n", "n,m=map(int,input().split())\r\nl=[0]*(n+1)\r\nfor i in range(m):\r\n a,b,c=map(int,input().split())\r\n if(l[a]!=0):\r\n if(l[a]==1):\r\n l[b]=2\r\n l[c]=3\r\n elif(l[a]==2):\r\n l[b]=3\r\n l[c]=1\r\n else:\r\n l[b]=1\r\n l[c]=2\r\n elif(l[b]!=0):\r\n if(l[b]==1):\r\n l[c]=2\r\n l[a]=3\r\n elif(l[b]==2):\r\n l[c]=3\r\n l[a]=1\r\n else:\r\n l[c]=1\r\n l[a]=2\r\n elif(l[c]!=0):\r\n if(l[c]==1):\r\n l[a]=2\r\n l[b]=3\r\n elif(l[c]==2):\r\n l[a]=3\r\n l[b]=1\r\n else:\r\n l[a]=1\r\n l[b]=2\r\n else:\r\n l[a]=1\r\n l[b]=2\r\n l[c]=3\r\nfor i in range(1,n+1):\r\n print(l[i],end=' ')\r\n", "n, d = [int(i) for i in input().split()]\r\n\r\narr = [-1]*n\r\nfor i in range(d):\r\n a, b, c = [int(i) for i in input().split()]\r\n color = 0\r\n if arr[a-1] != -1:\r\n color = arr[a-1]\r\n arr[b-1] = (color+1)%3\r\n arr[c-1] = (color+2)%3\r\n elif arr[b-1] != -1:\r\n color = arr[b-1]\r\n arr[a-1] = (color+1)%3\r\n arr[c-1] = (color+2)%3\r\n elif arr[c-1] != -1:\r\n color = arr[c-1]\r\n arr[b-1] = (color+1)%3\r\n arr[a-1] = (color+2)%3\r\n else:\r\n arr[a-1] = 0\r\n arr[b-1] = 1\r\n arr[c-1] = 2\r\n\r\nfor i in arr:\r\n print(i+1, end = \" \")", "from sys import stdin,stdout\r\ninput=stdin.readline \r\nimport math,bisect\r\n\r\nn,m=map(int,input().split())\r\nl=[0]*(n+1)\r\nfor i in range(m):\r\n\ta,b,c=map(int,input().split())\r\n\tif l[a]==0 and l[b]==0 and l[c]==0:\r\n\t\tl[a]=1\r\n\t\tl[b]=2\r\n\t\tl[c]=3\r\n\telif l[a]!=0:\r\n\t\tif l[a]==1:\r\n\t\t\tl[b],l[c]=2,3\r\n\t\telif l[a]==2:\r\n\t\t\tl[b],l[c]=1,3\r\n\t\telif l[a]==3:\r\n\t\t\tl[b],l[c]=1,2\r\n\telif l[b]!=0:\r\n\t\tif l[b]==1:\r\n\t\t\tl[a],l[c]=2,3\r\n\t\telif l[b]==2:\r\n\t\t\tl[a],l[c]=1,3\r\n\t\telif l[b]==3:\r\n\t\t\tl[a],l[c]=1,2\r\n\telif l[c]!=0:\r\n\t\tif l[c]==1:\r\n\t\t\tl[a],l[b]=2,3\r\n\t\telif l[c]==2:\r\n\t\t\tl[a],l[b]=1,3\r\n\t\telif l[c]==3:\r\n\t\t\tl[a],l[b]=1,2\r\nfor i in range(1,n+1):\r\n\tprint(l[i],end=\" \")\r\nprint()\r\n\r\n\r\n\r\n", "n, m = list(map(int, input().split()))\ndancers = [0] * n\nfor _ in range(m):\n a, b, c = list(map(lambda x: int(x) - 1, input().split()))\n colors = set([1, 2, 3])\n if dancers[a] != 0:\n colors.remove(dancers[a])\n dancers[b] = colors.pop()\n dancers[c] = colors.pop()\n elif dancers[b] != 0:\n colors.remove(dancers[b])\n dancers[a] = colors.pop()\n dancers[c] = colors.pop()\n elif dancers[c] != 0:\n colors.remove(dancers[c])\n dancers[a] = colors.pop()\n dancers[b] = colors.pop()\n else:\n dancers[a] = 1\n dancers[b] = 2\n dancers[c] = 3\nprint(*dancers)\n", "n,m=map(int,input().split())\r\narr=[0]*n\r\nfor h in range(m):\r\n a,b,c=map(int,input().split())\r\n x=[1,2,3]\r\n if arr[a-1]!=0:\r\n x.remove(arr[a-1])\r\n arr[b-1]=x[0]\r\n arr[c-1]=x[1]\r\n elif arr[b-1]!=0:\r\n x.remove(arr[b-1])\r\n arr[a-1]=x[0]\r\n arr[c-1]=x[1]\r\n elif arr[c-1]!=0:\r\n x.remove(arr[c-1])\r\n arr[a-1]=x[0]\r\n arr[b-1]=x[1]\r\n else:\r\n arr[a-1]=x[0]\r\n arr[b-1]=x[1]\r\n arr[c-1]=x[2]\r\nprint(*arr)", "def solve():\n ans=[0 for i in range(n)]\n for i in range(m) :\n for j in arr[i] :\n if ans[j-1]!=0 :\n skip=ans[j-1]\n break\n else:\n skip=0\n\n for j in [1,2,3] :\n if j==skip :\n continue\n if ans[arr[i][0]-1]==0:\n ans[arr[i][0]-1]=j\n elif ans[arr[i][1]-1]==0:\n ans[arr[i][1]-1]=j\n else :\n ans[arr[i][2]-1]= j\n\n return ''.join(str(x)+' ' for x in ans).strip()\n\n\n\n \n\n\n\n\n\n \n \n \nfrom sys import stdin\ninput = stdin.readline\n \n\nn,m= [int(x) for x in input().split()]\narr=[]\nfor i in range(m):\n arr.append([int(x) for x in input().split()])\nprint(solve())", "n, m = map(int, input().split())\r\nres = [0] * (n + 1)\r\nfor _ in range(m):\r\n arr = list(map(int, input().split()))\r\n for i in range(3):\r\n if res[arr[i]] == 1:\r\n res[arr[(i + 1) % 3]] = 2\r\n res[arr[(i + 2) % 3]] = 3\r\n break\r\n elif res[arr[i]] == 2:\r\n res[arr[(i + 1) % 3]] = 1\r\n res[arr[(i + 2) % 3]] = 3\r\n break\r\n elif res[arr[i]] == 3:\r\n res[arr[(i + 1) % 3]] = 1\r\n res[arr[(i + 2) % 3]] = 2\r\n break\r\n if not res[arr[0]]:\r\n res[arr[0]], res[arr[1]], res[arr[2]] = 1, 2, 3\r\nprint(*res[1:])\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 islst():\r\n return list(map(str,input().split()))\r\n \r\ndef inum():\r\n return map(int,input().split())\r\n \r\ndef freq(l):\r\n d = {}\r\n for i in l:\r\n d[i] = d.get(i,0)+1\r\n return d\r\n \r\nn,m = inum()\r\n\r\nl = []\r\n\r\nfor i in range(m):\r\n l.append(ilst())\r\n \r\nd = {}\r\n\r\nd[l[0][0]] = 1\r\nd[l[0][1]] = 2 \r\nd[l[0][2]] = 3\r\n\r\nfor i in range(1,m):\r\n td = {}\r\n rem = []\r\n for j in range(3):\r\n if l[i][j] in d:\r\n td[d[l[i][j]]] = True\r\n else:\r\n rem.append(l[i][j])\r\n p = 0\r\n for k in range(1,4):\r\n if k not in td:\r\n d[rem[p]] = k\r\n p += 1\r\nans = []\r\nfor i in d:\r\n ans.append([i,d[i]])\r\n \r\nans.sort()\r\n\r\nfor i in range(n):\r\n ans[i] = ans[i][1]\r\n \r\nprint(*ans)\r\n \r\n", "n,m=map(int,input().split())\r\ncolor=[-1 for i in range(n+1)]\r\n\r\ndcol=[-1 for i in range(4)]\r\nfor i in range(m):\r\n a,b,c=map(int,input().split())\r\n if(color[a]==color[b]==color[c]==-1):\r\n color[a]=1\r\n color[b]=2\r\n color[c]=3\r\n else:\r\n cnt=0\r\n if(color[a]!=-1):\r\n dcol[color[a]]=1\r\n for i in range(1,4):\r\n if(dcol[i]==-1):\r\n if(cnt==0):\r\n color[b]=i\r\n dcol[i]=1\r\n cnt+=1\r\n else:\r\n color[c]=i\r\n dcol[i]=1\r\n elif(color[b]!=-1):\r\n dcol[color[b]]=1\r\n for i in range(1,4):\r\n if(dcol[i]==-1):\r\n if(cnt==0):\r\n color[a]=i\r\n dcol[i]=1\r\n cnt+=1\r\n else:\r\n color[c]=i\r\n dcol[i]=1\r\n #if(color[c]!=-1):\r\n else:\r\n dcol[color[c]]=1\r\n for i in range(1,4):\r\n if(dcol[i]==-1):\r\n if(cnt==0):\r\n color[a]=i\r\n dcol[i]=1\r\n cnt+=1\r\n else:\r\n color[b]=i\r\n dcol[i]=1 \r\n \r\n dcol=[-1 for i in range(4)] \r\n\r\nfor i in range(1,n+1):\r\n print(color[i],end=\" \")", "#imgur.com/Pkt7iIf.png\r\n\r\n#n, m = map(int, input().split())\r\n#n = int(input())\r\n#d = list(map(int, input().split()))\r\n\r\nn, m = map(int, input().split())\r\ncolor = [0]*(n+1)\r\n\r\nfor i in range(m):\r\n s = {1, 2, 3}\r\n a, b, c = map(int, input().split())\r\n s = s.difference({color[a],color[b],color[c]})\r\n for j in [a,b,c]:\r\n if color[j] == 0:\r\n color[j] = s.pop()\r\n\r\n[print(c, end = ' ') for c in color[1:]]\r\n \r\n", "\nif __name__ == \"__main__\" :\n n, m = map(int, input().split() ) \n color = dict() \n for i in range(m): \n d = list(map(int, input().split()))\n temp = dict() \n for j in range(3) :\n if d[j] in color: \n temp[color[d[j]]] =1 \n for j in range(3) : \n if d[j] not in color : \n for k in range(3):\n if k+1 not in temp:\n color[d[j]] = k+1 \n temp[k+1] =1 \n break \n for i in range(n) :\n print(color[i+1],end=' ') \n print() \n", "n,m=map(int,input().split())\na=[]\nfor i in range(m):\n\ta.append(list(map(int,input().split())))\n\n# l=[]\n# for i in range(m-1):\n# \tl+=list(set(a[i])&set(a[i+1]))\n\nc=[0]*(n+1)\n\nfor k in range(m):\n for i in range(3):\n if c[a[k][i]]==1:\n c[a[k][(i+1)%3]]=2\n c[a[k][(i+2)%3]]=3\n break\n elif c[a[k][i]]==2:\n c[a[k][(i+1)%3]]=1\n c[a[k][(i+2)%3]]=3\n break\n elif c[a[k][i]]==3:\n c[a[k][(i+1)%3]]=1\n c[a[k][(i+2)%3]]=2\n break\n if not c[a[k][0]]:\n c[a[k][0]],c[a[k][1]],c[a[k][2]]=1,2,3\n\nprint(' '.join(map(str,c[1:])))", "def main():\r\n n, m = [int(i) for i in input().split()]\r\n \r\n colors = [0 for i in range(n + 1)]\r\n for i in range(m):\r\n arr = [int(i) for i in input().split()]\r\n early = colors[arr[0]] or colors[arr[1]] or colors[arr[2]]\r\n l = [1, 2, 3]\r\n if early: l.remove(early)\r\n for i in arr:\r\n if colors[i] == 0:\r\n colors[i] = l.pop()\r\n \r\n print(' '.join(str(colors[i]) for i in range(1, n + 1)))\r\n \r\nmain()\r\n", "\nn, m = map(int, input().split())\n\nmp = {}\n\nfor _ in range(m):\n a, b, c = map(int, input().split())\n\n if b in mp:\n a, b = b, a\n elif c in mp:\n a, c = c, a\n \n if a in mp and mp[a] == 1:\n mp[b] = 2\n mp[c] = 3\n elif a in mp and mp[a] == 2:\n mp[b] = 1\n mp[c] = 3\n elif a in mp and mp[a] == 3:\n mp[b] = 1\n mp[c] = 2\n else:\n mp[a] = 1\n mp[b] = 2\n mp[c] = 3\n\nfor i in range(1, n + 1):\n print(mp[i], end=\" \")", "n, m = map(int, input().split())\n\ncolors = {}\n\nfor i in range(m):\n\ta, b, c = map(int, input().split())\n\tif a not in colors and b not in colors and c not in colors:\n\t\tcolors[a] = 1\n\t\tcolors[b] = 2\n\t\tcolors[c] = 3\n\telse:\n\t\tl = [1, 2, 3]\n\t\tif a in colors:\n\t\t\tl.remove(colors[a])\n\t\t\tcolors[b], colors[c] = l[0], l[1]\n\t\telif b in colors:\n\t\t\tl.remove(colors[b])\n\t\t\tcolors[a], colors[c] = l[0], l[1]\n\t\telse:\n\t\t\tl.remove(colors[c])\n\t\t\tcolors[a], colors[b] = l[0], l[1]\n\nfor i in colors:\n\tprint(colors[i], end=' ')\n", "R = lambda : map(int, input().split() ) \nn, m = R() \ncolor = dict() \nfor i in range(m): \n d = list(R())\n temp =0 \n for j in d :\n if j in color: \n temp = temp | ( 1 << color[j] ) \n for j in range(3) : \n if d[j] not in color : \n for k in range(3):\n if not ( (1 << (k+1) ) & temp ) :\n color[d[j]] = k+1 \n temp = temp | ( 1 << k+1 ) \n break \nfor i in range(n): \n print(color[i+1],end = ' ') \nprint() \n", "n,m=map(int,input().split())\r\nlist1=[0]*(n+1)\r\nfor i in range(m):\r\n a,b,c=map(int,input().split())\r\n if(list1[a]==0):\r\n if(list1[b]==0 and list1[c]==0):\r\n list1[a]=1\r\n elif(list1[b]==0 or list1[c]==0):\r\n s=list1[b]+list1[c]\r\n ss=5-s\r\n if(ss==4):\r\n list1[a]=2\r\n else:\r\n list1[a]=ss\r\n elif(list1[b]!=0 and list1[c]!=0):\r\n list1[a]=6-(list1[c]+list1[b])\r\n \r\n \r\n if(list1[b]==0):\r\n if(list1[c]==0 and list1[a]==0):\r\n list1[b]=1\r\n elif(list1[a]==0 or list1[c]==0):\r\n s=list1[a]+list1[c]\r\n ss=5-s\r\n if(ss==4):\r\n list1[b]=2\r\n else:\r\n list1[b]=ss\r\n elif(list1[a]!=0 and list1[c]!=0):\r\n list1[b]=6-(list1[a]+list1[c])\r\n \r\n if(list1[c]==0):\r\n if(list1[b]==0 and list1[a]==0):\r\n list1[c]=1\r\n elif(list1[b]==0 or list1[a]==0):\r\n s=list1[b]+list1[a]\r\n ss=5-s\r\n if(ss==4):\r\n list1[c]=2\r\n else:\r\n list1[c]=ss\r\n elif(list1[b]!=0 and list1[a]!=0):\r\n list1[c]=6-(list1[a]+list1[b])\r\nfor i in range(1,n+1):\r\n print(list1[i],end=\" \")", "def main():\n n, m = map(int, input().split())\n r = [0] * (n + 1)\n for _ in range(m):\n a, b, c = map(int, input().split())\n r[a], r[b], r[c] = {\n (0, 0, 0): (1, 2, 3), (0, 0, 1): (2, 3, 1), (0, 0, 2): (1, 3, 2), (0, 0, 3): (1, 2, 3),\n (0, 1, 0): (2, 1, 3), (0, 1, 2): (3, 1, 2), (0, 1, 3): (2, 1, 3), (0, 2, 0): (1, 2, 3),\n (0, 2, 1): (3, 2, 1), (0, 2, 3): (1, 2, 3), (0, 3, 0): (1, 3, 2), (0, 3, 1): (2, 3, 1),\n (0, 3, 2): (1, 3, 2), (1, 0, 0): (1, 2, 3), (1, 0, 2): (1, 3, 2), (1, 0, 3): (1, 2, 3),\n (1, 2, 0): (1, 2, 3), (1, 2, 3): (1, 2, 3), (1, 3, 0): (1, 3, 2), (1, 3, 2): (1, 3, 2),\n (2, 0, 0): (2, 1, 3), (2, 0, 1): (2, 3, 1), (2, 0, 3): (2, 1, 3), (2, 1, 0): (2, 1, 3),\n (2, 1, 3): (2, 1, 3), (2, 3, 0): (2, 3, 1), (2, 3, 1): (2, 3, 1), (3, 0, 0): (3, 1, 2),\n (3, 0, 1): (3, 2, 1), (3, 0, 2): (3, 1, 2), (3, 1, 0): (3, 1, 2), (3, 1, 2): (3, 1, 2),\n (3, 2, 0): (3, 2, 1), (3, 2, 1): (3, 2, 1)}[r[a], r[b], r[c]]\n print(' '.join((None, \"1\", \"2\", \"3\")[x] for x in r[1:]))\n\n\nif __name__ == '__main__':\n main()\n", "import sys;\n\nnbDancers, nbDances = map(int, sys.stdin.readline().split(' '));\ndancers = [0]*(nbDancers+1);\n\nfor line in sys.stdin:\n\ttaken = [False, False, False, False];\n\n\tds = list(map(int, line.split(' ')));\n\n\tfor d in ds:\n\t\ttaken[dancers[d]] = True;\n\n\tfor d in ds:\n\t\tif dancers[d] == 0:\n\t\t\tif not taken[1]:\n\t\t\t\tdancers[d] = 1;\n\t\t\t\ttaken[1] = True;\n\t\t\telif not taken[2]:\n\t\t\t\tdancers[d] = 2;\n\t\t\t\ttaken[2] = True;\n\t\t\telif not taken[3]:\n\t\t\t\tdancers[d] = 3;\n\t\t\t\ttaken[3] = True;\n\nprint(' '.join(map(str, dancers[1:])));\n", "n, m = map(int, input().split())\r\n\r\ncolors = [0] * n\r\nfor dance in range(m):\r\n a, b, c = map(int, input().split())\r\n a -= 1\r\n b -= 1\r\n c -= 1\r\n if colors[a] == colors[b] == colors[c] == 0:\r\n colors[a] = 1\r\n colors[b] = 2\r\n colors[c] = 3\r\n continue\r\n\r\n for i in [a, b, c]:\r\n if colors[i]:\r\n bh = i\r\n\r\n choices = [1, 2, 3]\r\n choices.remove(colors[bh])\r\n h = 0\r\n for i in [a, b, c]:\r\n if i == bh:\r\n continue\r\n else:\r\n colors[i] = choices[h]\r\n h += 1\r\n\r\nprint(*colors)\r\n\r\n", "def intinp():\r\n return list(map(int,input().split()))\r\nn,m = intinp()\r\nColor = [0 for i in range(n+1)]\r\nfor i in range(m):\r\n u=[0]\r\n u=u+intinp()\r\n if Color[u[1]]:\r\n u[Color[u[1]]],u[1]=u[1],u[Color[u[1]]]\r\n if Color[u[2]]:\r\n u[Color[u[2]]],u[2]=u[2],u[Color[u[2]]]\r\n if Color[u[3]]:\r\n u[Color[u[3]]],u[3]=u[3],u[Color[u[3]]]\r\n Color[u[1]]=1\r\n Color[u[2]]=2\r\n Color[u[3]]=3\r\nprint(\" \".join(list(map(str,Color[1:]))))", "n, m = map(int, input().split())\nd = [-1 for i in range(n + 1)]\nfor _ in range(m):\n\tp = {1, 2, 3}\n\tt = list(map(int, input().split()))\n\tfor i in t:\n\t\tif d[i] != -1:\n\t\t\tp.discard(d[i])\n\tfor i in t:\n\t\tif d[i] == -1:\n\t\t\td[i] = p.pop()\nfor j in range(1, n + 1):\n\tprint(d[j], end=' ')\n", "n,m=map(int,input().split())\r\narr=[0 for i in range(n+1)]\r\nfor i in range(m):\r\n x,y,z=map(int,input().split())\r\n if([arr[x],arr[y],arr[z]]==[0,0,0]):\r\n arr[x],arr[y],arr[z]=1,2,3\r\n else:\r\n ans=[1,2,3]\r\n if(arr[x]!=0):\r\n ans.remove(arr[x])\r\n elif(arr[y]!=0):\r\n ans.remove(arr[y])\r\n elif(arr[z]!=0):\r\n ans.remove(arr[z])\r\n if(arr[x]==0):\r\n arr[x]=ans[0]\r\n ans.remove(ans[0])\r\n if(arr[y]==0):\r\n arr[y]=ans[0]\r\n ans.remove(ans[0])\r\n if(arr[z]==0):\r\n arr[z]=ans[0]\r\n ans.remove(ans[0])\r\nprint(*arr[1:])", "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\nimport copy\r\nimport time\r\n# import numpy as np\r\nstarttime = time.time()\r\n# import numpy as np\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\ntry:\r\n sys.setrecursionlimit(int(pow(10,6)))\r\n sys.stdin = open(\"input.txt\", \"r\")\r\n # sys.stdout = open(\"../output.txt\", \"w\")\r\nexcept:\r\n pass\r\n\r\nn,m=L()\r\nA=[L() for i in range(m)]\r\ncol=[-1 for i in range(n+1)]\r\nfor x,y,z in A:\r\n cur=[col[x],col[y],col[z]]\r\n if cur.count(-1)==3:\r\n col[x]=1\r\n col[y]=2\r\n col[z]=3\r\n elif cur.count(-1)==2:\r\n for pres in [1,2,3]:\r\n if pres in cur:\r\n continue\r\n for i in range(3):\r\n if i==0 and cur[i]==-1:\r\n col[x]=pres\r\n cur[i]=pres\r\n break\r\n elif i==1 and cur[i]==-1:\r\n col[y]=pres\r\n cur[i]=pres\r\n break\r\n elif i==2 and cur[i]==-1:\r\n col[z]=pres\r\n cur[i]=pres\r\n break\r\n\r\n elif cur.count(-1)==1:\r\n rem=sum(cur)+1\r\n if cur[0]==-1:\r\n col[x]=6-rem\r\n elif cur[1]==-1:\r\n col[y]=6-rem\r\n else:\r\n col[z]=6-rem\r\nfor i in range(1,n+1):\r\n if col[i]==-1:\r\n col[i]=1\r\nprint(*col[1:])\r\n\r\n\r\n\r\n\r\n\r\nendtime = time.time()\r\n# print(f\"Runtime of the program is {endtime - starttime}\")\r\n\r\n\r\n\r\n", "\r\n # n=int(input())\r\nn,m=(map(int,input().split()))\r\nv=[]\r\nfor i in range(n+1):\r\n v.append(0)\r\nt=[1,2,3]\r\nfor i in range(m):\r\n sub=list(map(int,input().split()))\r\n x=[]\r\n t=[1,2,3]\r\n if(v[sub[0]]+v[sub[1]]+v[sub[2]]==0):\r\n v[sub[0]]=1\r\n v[sub[1]]=2\r\n v[sub[2]]=3\r\n continue\r\n for j in sub:\r\n \r\n if(v[j]!=0):\r\n r=v[j]\r\n for j in sub:\r\n if(v[j]==0):\r\n if(t[0]==r):\r\n v[j]=t[1]\r\n \r\n if(t[1]==r):\r\n v[j]=t[0]\r\n if(t[2]==r):\r\n v[j]=t[0]\r\n y=v[j]\r\n break\r\n for j in sub:\r\n if(v[j]==0):\r\n v[j]=6-r-y\r\nv.pop(0)\r\nprint(*v)\r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n ", "n,m=list(map(int,input().split()))\r\nl=[]\r\nfor i in range(m):\r\n l.append(list(map(int,input().split())))\r\nd={}\r\nfor i in range(m):\r\n for j in range(3):\r\n d[l[i][j]]=0\r\nfor i in range(m):\r\n for j in range(3):\r\n if d[l[i][0]]+d[l[i][1]]+d[l[i][2]]==0:\r\n d[l[i][j]]=j+1\r\n else:\r\n x=[1,2,3]\r\n for j in range(3):\r\n if d[l[i][j]]:\r\n x.remove(d[l[i][j]])\r\n c=0\r\n for j in range(3):\r\n if not d[l[i][j]]:\r\n d[l[i][j]]=x[c]\r\n c=c+1\r\n break\r\n \r\nfor i in range(1,n):\r\n print(d[i],end=' ')\r\nprint(d[n])", "n,m = map(int,input().split())\r\na = [0]*(n+1)\r\nfor _ in range(m):\r\n\tl = []\r\n\tm,n,p = map(int,input().split())\r\n\tfor i in range(1,4):\r\n\t\tif a[m]!=i and a[n]!=i and a[p]!=i:\r\n\t\t\tl.append(i)\r\n\tindex = 0\r\n\tif a[m]==0:\r\n\t\ta[m]=l[index]\r\n\t\tindex+=1\r\n\tif a[n]==0:\r\n\t\ta[n]=l[index]\r\n\t\tindex+=1\r\n\tif a[p]==0:\r\n\t\ta[p]=l[index]\r\n\t\tindex+=1\r\nfor x in range (1,len(a)):\r\n\tprint(a[x],end=' ')", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\n\r\nd = [0]*(n+1)\r\nfor _ in range(m):\r\n a, b, c = map(int, input().split())\r\n x = [1, 2, 3]\r\n for i in [a,b,c]:\r\n if d[i] != 0:\r\n x.remove(d[i])\r\n break\r\n for i in [a, b, c]:\r\n if d[i] == 0:\r\n d[i] = x[-1]\r\n x.pop()\r\nprint(' '.join(map(str, d[1:])))", "'''\ndef main():\n\tfrom sys import stdin,stdout\nif __name__=='__main__':\n\tmain()\n'''\n#357B\ndef main():\n\tfrom sys import stdin,stdout\n\tn,m=map(int,stdin.readline().split())\n\tarr = [0 for x in range(n)]\n\ta,b,c = map(int,stdin.readline().split())\n\tarr[a-1]=1\n\tarr[b-1]=2\n\tarr[c-1]=3\n\tfor _ in range(m-1):\n\t\ta,b,c = map(int,stdin.readline().split())\n\t\tlset = set()\n\t\tfor i in (a,b,c):\n\t\t\tlset.add(arr[i-1])\n\t\tfor i in range(1,4):\n\t\t\tif i not in lset:\n\t\t\t\tif arr[a-1]:\n\t\t\t\t\tif arr[b-1]:\n\t\t\t\t\t\tarr[c-1]=i\n\t\t\t\t\telse:\n\t\t\t\t\t\tarr[b-1]=i\n\t\t\t\telse:\n\t\t\t\t\tarr[a-1]=i\n\t\t\n\tfor i in range(n):\n\t\tstdout.write(str(arr[i])+' ')\n\nif __name__=='__main__':\n\tmain()\n\n", "n,m=map(int,input().split())\r\nd=[0]*(n+1)\r\nfor i in range(m):\r\n a,b,c=map(int,input().split())\r\n l=[1,2,3]\r\n if d[a]!=0:\r\n l.pop(d[a]-1)\r\n if d[b]!=0:\r\n l.pop(d[b]-1)\r\n if d[c]!=0:\r\n l.pop(d[c]-1)\r\n if d[a]==0:\r\n d[a]=l.pop()\r\n if d[b]==0:\r\n d[b]=l.pop()\r\n if d[c]==0:\r\n d[c]=l.pop()\r\nd.pop(0)\r\nprint(*d)", "def mi():\r\n return map(int, input().split())\r\nn,m = mi()\r\nc = [0]*n\r\nfor _ in range(m):\r\n q,w,e = mi()\r\n q-=1\r\n w-=1\r\n e-=1\r\n if c[q]+c[w]+c[e]==0:\r\n c[q],c[w],c[e]=1,2,3\r\n elif c[q]+c[w]==0:\r\n if c[e]==1:\r\n c[q],c[w]=2,3\r\n elif c[e]==2:\r\n c[q],c[w]=1,3\r\n else:\r\n c[q],c[w]=1,2\r\n elif c[e]+c[w]==0:\r\n if c[q]==1:\r\n c[e],c[w]=2,3\r\n elif c[q]==2:\r\n c[e],c[w]=1,3\r\n else:\r\n c[e],c[w]=1,2\r\n elif c[q]+c[e]==0:\r\n if c[w]==1:\r\n c[q],c[e]=2,3\r\n elif c[w]==2:\r\n c[q],c[e]=1,3\r\n else:\r\n c[q],c[e]=1,2\r\n elif c[q]==0:\r\n c[q]=6-c[w]-c[e]\r\n elif c[w]==0:\r\n c[w]=6-c[q]-c[e]\r\n elif c[e]==0:\r\n c[e]=6-c[q]-c[w]\r\nprint (*c)\r\n", "n, m = map(int, input().split())\r\nt = [0] * (n + 1)\r\nfor i in range(m):\r\n a, b, c = map(int, input().split())\r\n if t[a]:\r\n if t[a] == '1': t[b], t[c] = '2', '3'\r\n elif t[a] == '2': t[b], t[c] = '1', '3'\r\n else: t[b], t[c] = '1', '2'\r\n elif t[b]:\r\n if t[b] == '1': t[a], t[c] = '2', '3'\r\n elif t[b] == '2': t[a], t[c] = '1', '3'\r\n else: t[a], t[c] = '1', '2'\r\n elif t[c]:\r\n if t[c] == '1': t[a], t[b] = '2', '3'\r\n elif t[c] == '2': t[a], t[b] = '1', '3'\r\n else: t[a], t[b] = '1', '2'\r\n else: t[a], t[b], t[c] = '1', '2', '3'\r\nprint(' '.join(t[1:]))", "from collections import defaultdict\r\nimport cmath\r\n\r\nn, m = map(int , input().split())\r\nvalues = {}\r\nc = 1\r\nfor i in range(m):\r\n nums = list(map(int, input().split()))\r\n temp = {'3':1, '2': 1, '1': 1}\r\n for num in nums:\r\n if num in values and str(values[num]) in temp:\r\n # print(f\"{num} is in values\")\r\n temp.pop(str(values[num]))\r\n for num in nums:\r\n if num not in values:\r\n values[num] = int(temp.popitem()[0])\r\n # print(f\"current values is {values}\")\r\nfor i in range(1, n+1):\r\n print(values[i], end = \" \")\r\n \r\n\r\n\r\n ", "n, m = list(map(int, input().split()))\r\ncolors = [0]*n\r\n\r\nfor i in range(m):\r\n choices = [1, 2, 3]\r\n dancers = list(map(int, input().split()))\r\n for a in dancers:\r\n try:\r\n choices.remove(colors[a-1])\r\n except:\r\n pass\r\n for a in dancers:\r\n if (colors[a-1] == 0):\r\n colors[a-1] = choices[0]\r\n choices.remove(colors[a-1])\r\nprint(*colors)", "def dance(arr, n):\r\n ans = [None] * (n + 1)\r\n for i in range(len(arr)):\r\n color = [1, 2, 3]\r\n flag = False\r\n bad = None\r\n for j in range(3):\r\n if ans[arr[i][j]] != None:\r\n color.remove(ans[arr[i][j]])\r\n bad = j\r\n for x in range(3):\r\n if x != bad:\r\n ans[arr[i][x]] = color[0]\r\n color.pop(0)\r\n print(*ans[1:])\r\n return \"\"\r\n\r\na, b = map(int, input().strip().split())\r\nblanck = []\r\nfor i in range(b):\r\n lst = list(map(int, input().strip().split()))\r\n blanck.append(lst)\r\nprint(dance(blanck, a))\r\n", "n,m=map(int,input().split())\r\nlst=[0 for i in range(n+1)]\r\nfor j in range(m):\r\n dancers=list(map(int,input().split()))\r\n color=[lst[dancers[0]],lst[dancers[1]],lst[dancers[2]]]\r\n for i in range(3):\r\n if(lst[dancers[i]]!=0):\r\n continue\r\n else:\r\n if(1 not in color):\r\n lst[dancers[i]]=1\r\n color[i]=1\r\n continue\r\n if(2 not in color):\r\n lst[dancers[i]]=2\r\n color[i]=2\r\n continue\r\n if(3 not in color):\r\n lst[dancers[i]]=3\r\n color[i]=3\r\n \r\n\r\nfor k in range(1,n+1):\r\n print(lst[k],end=' ')\r\n\r\n", "\"\"\"http://codeforces.com/problemset/problem/357/B\"\"\"\n\ndef solve(n, dances):\n k = {}\n for d in dances:\n s = {1, 2, 3}\n for i in d:\n try:\n s.remove(k.get(i))\n except:\n pass\n for i in d:\n if k.get(i):\n continue\n k[i] = s.pop()\n return ' '.join([str(k.get(i, 1)) for i in range(1, n+1)])\n\nif __name__ == '__main__':\n f = lambda: list(map(int, input().split()))\n n, m = f()\n res = solve(n, [f() for _ in range(m)])\n print(res)\n", "import sys\r\nsys.setrecursionlimit(10000)\r\nn,m= [int(x) for x in input().strip().split()]\r\n\r\ns = []\r\nfor i in range(m):\r\n\ta,b,c= [int(x) for x in input().strip().split()]\r\n\ts.append([a,b,c])\r\nc = [0]*(n+2)\r\nalpha = [1,2,3]\r\nfor i in range(m):\r\n\talpha = [1,2,3]\r\n\tk = s[i]\r\n\tindex=-1\r\n\tfor j in range(3):\r\n\t\tif c[k[j]]!=0:\r\n\t\t\tindex = j\r\n\t\t\tbreak\r\n\tif index!=-1:\r\n\t\talpha.pop(c[k[index]]-1)\r\n\tfor j in range(3):\r\n\t\tif j!=index :\r\n\t\t\tc[k[j]]=alpha.pop(0)\r\n\r\nprint(\" \".join([str(x) for x in c[1:-1]]))", "n, m = map(int, input().split())\n\ndancers = {}\nfor _ in range(m):\n dance = list(map(int, input().split()))\n not_took = set([1,2,3])\n for d in dance:\n if d in dancers:\n not_took.remove(dancers[d])\n \n for d in dance:\n if d not in dancers:\n dancers[d] = not_took.pop()\n\nprint(\" \".join(str(dancers[i]) for i in range(1, n+1)))\n\n\n\n", "from collections import defaultdict\r\nn,m=map(int,input().split())\r\nk=defaultdict(lambda :0)\r\nfor _ in range(m):\r\n t=[3,2,1]\r\n people= list(map(int, input().split()))\r\n ans=[]\r\n for i in people:\r\n if i in k:\r\n t.remove(k[i])\r\n people.remove(i)\r\n\r\n for i in people:\r\n k[i]=t.pop()\r\nfor i in sorted(k.keys()):\r\n print(k[i],end=\" \")\r\n", "n,m=map(int,input().split())\r\na=[]\r\nd={}\r\nfor i in range(m):\r\n a.append(list(map(int,input().split())))\r\nfor i in range(m):\r\n ex=n+1\r\n f=n+1\r\n for j in range(3):\r\n if a[i][j] in d:\r\n ex=a[i][j]\r\n f=d[a[i][j]]\r\n break\r\n t=1\r\n #print(\"ex \"+str(ex)+str(a[i][j]))\r\n for j in range(3):\r\n if ex==a[i][j]:\r\n continue\r\n if t==f:\r\n t=(t+1)%4\r\n d[a[i][j]]=t\r\n t=(t+1)%4\r\n#print(d)\r\nfor i in range(0,n):\r\n print(d[i+1],end=\" \")\r\n ", "import sys\nn,m=map(int,sys.stdin.readline().split())\n\nColors=[0]*(n+1)\n\nfor i in range(m):\n a,b,c=map(int,sys.stdin.readline().split())\n Z=[a,b,c]\n Q=[1,2,3]\n if(Colors[a]!=0):\n Z.remove(a)\n Q.remove(Colors[a])\n if(Colors[b]!=0):\n Z.remove(b)\n Q.remove(Colors[b])\n if(Colors[c]!=0):\n Z.remove(c)\n Q.remove(Colors[c])\n for i in range(len(Z)):\n Colors[Z[i]]=Q[i]\n\n\nAns=\"\"\nAns+=str(Colors[1])\nfor i in range(2,n+1):\n Ans+=\" \"+str(Colors[i])\nsys.stdout.write(Ans)\n \n", "n,m=map(int,input().split())\r\nd={}\r\nfor i in range(m):\r\n x,y,z=list(map(int,input().split()))\r\n if i==0:\r\n d[x]=1\r\n d[y]=2\r\n d[z]=3\r\n else:\r\n if x in d:\r\n t1=d[x]\r\n if t1==1:\r\n d[y]=2\r\n d[z]=3\r\n elif t1==2:\r\n d[y]=1\r\n d[z]=3\r\n elif t1==3:\r\n d[y]=1\r\n d[z]=2\r\n elif y in d:\r\n t1=d[y]\r\n if t1==1:\r\n d[x]=2\r\n d[z]=3\r\n elif t1==2:\r\n d[x]=1\r\n d[z]=3\r\n elif t1==3:\r\n d[x]=1\r\n d[z]=2\r\n elif z in d:\r\n t1=d[z]\r\n if t1==1:\r\n d[y]=2\r\n d[x]=3\r\n elif t1==2:\r\n d[y]=1\r\n d[x]=3\r\n elif t1==3:\r\n d[y]=1\r\n d[x]=2\r\n else:\r\n d[x]=1\r\n d[y]=2\r\n d[z]=3\r\nfor i in range(n):\r\n print(d[i+1],end=\" \")\r\n", "'''input\r\n7 3\r\n1 2 3\r\n1 4 5\r\n4 6 7\r\n\r\n'''\r\nimport sys\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\nn,m = getints()\r\narr = [-1 for i in range(n)]\r\nfor i in range(m):\r\n\ta,b,c = getints()\r\n\ta,b,c=a-1,b-1,c-1\r\n\tx = [1,2,3]\r\n\r\n\tif arr[a]==-1 and arr[b]==-1 and arr[c]==-1:\r\n\t\tarr[a], arr[b], arr[c] = x\r\n\telif arr[a]==-1 and arr[b]==-1:\r\n\t\tx.remove(arr[c])\r\n\t\tarr[a], arr[b] = x\r\n\telif arr[a]==-1 and arr[c]==-1:\r\n\t\tx.remove(arr[b])\r\n\t\tarr[a], arr[c] = x\r\n\telif arr[b]==-1 and arr[c]==-1:\r\n\t\tx.remove(arr[a])\r\n\t\tarr[b], arr[c] = x\r\n\telif arr[a]==-1:\r\n\t\tx.remove(arr[b])\r\n\t\tx.remove(arr[c])\r\n\t\tarr[a] = x[0]\r\n\telif arr[b]==-1:\r\n\t\tx.remove(arr[a])\r\n\t\tx.remove(arr[c])\r\n\t\tarr[b] = x[0]\r\n\telif arr[c]==-1:\r\n\t\tx.remove(arr[a])\r\n\t\tx.remove(arr[c])\r\n\t\tarr[c] = x[0]\r\nprint(*arr)", "n,m=map(int,input().split())\r\nl=[0 for i in range(n)]\r\nques=[]\r\nfor i in range(m):\r\n temp=list(map(int,input().split()))\r\n ques.append(temp)\r\n\r\nfor i in ques:\r\n a,b,c=i[0],i[1],i[2]\r\n if not l[a-1] and not l[b-1] and not l[c-1]:\r\n l[a-1]=1\r\n l[b-1]=2\r\n l[c-1]=3\r\n elif l[a-1]:\r\n if l[a-1]==1: l[b-1]=2;l[c-1]=3\r\n elif l[a-1]==2: l[b-1]=3;l[c-1]=1\r\n elif l[a-1]==3: l[b-1]=1;l[c-1]=2\r\n elif l[b-1]:\r\n if l[b-1]==1: l[a-1]=2;l[c-1]=3\r\n elif l[b-1]==2: l[a-1]=3;l[c-1]=1\r\n elif l[b-1]==3: l[a-1]=1;l[c-1]=2\r\n elif l[c-1]:\r\n if l[c-1]==1: l[b-1]=2;l[a-1]=3\r\n elif l[c-1]==2: l[b-1]=3;l[a-1]=1\r\n elif l[c-1]==3: l[b-1]=1;l[a-1]=2\r\nfor i in l:\r\n print(i,end=\" \")\r\n\r\n\r\n", "n, m = map(int, input().split())\r\ncolors = [0] * n\r\n\r\ndef setColors(a):\r\n for i in a:\r\n if colors[i - 1] == 0:\r\n for c in range(1, 4):\r\n for j in a:\r\n if i != j and c == colors[j - 1]:\r\n break\r\n else:\r\n colors[i - 1] = c\r\n break\r\n\r\nfor i in range(m):\r\n setColors(list(map(int, input().split())))\r\n\r\nprint(' '.join(map(str, colors)))", "n, m = map(int, input().split())\r\nd = [1] * n\r\ns = set()\r\nfor i in range(m):\r\n a, b, c = map(int, input().split())\r\n if a - 1in s:\r\n if d[a - 1] == 1:\r\n d[b - 1] = 2\r\n d[c - 1] = 3\r\n \r\n if d[a - 1] == 2:\r\n d[b - 1] = 1\r\n d[c - 1] = 3\r\n \r\n if d[a - 1] == 3:\r\n d[b - 1] = 1\r\n d[c - 1] = 2\r\n \r\n if b - 1 in s:\r\n if d[b - 1] == 1:\r\n d[a - 1] = 2\r\n d[c - 1] = 3\r\n \r\n if d[b - 1] == 2:\r\n d[a - 1] = 1\r\n d[c - 1] = 3\r\n \r\n if d[b - 1] == 3:\r\n d[a - 1] = 1\r\n d[c - 1] = 2\r\n \r\n if c - 1 in s:\r\n if d[c - 1] == 1:\r\n d[b - 1] = 2\r\n d[a - 1] = 3\r\n \r\n if d[c - 1] == 2:\r\n d[b - 1] = 1\r\n d[a - 1] = 3\r\n \r\n if d[c - 1] == 3:\r\n d[b - 1] = 1\r\n d[a - 1] = 2\r\n if a - 1 not in s and b - 1not in s and c - 1 not in s:\r\n d[a - 1] = 1\r\n d[b - 1] = 2\r\n d[c - 1] = 3\r\n s.add(a - 1)\r\n s.add(b - 1)\r\n s.add(c - 1)\r\n \r\nprint(*d) \r\n \r\n \r\n \r\n", "n, m = map(int, input().split())\r\nt = [0] * (n + 1)\r\nfor j in range(m):\r\n a, b, c = map(int, input().split())\r\n x = t[a] | t[b] | t[c]\r\n for i in (a, b, c):\r\n if not t[i]:\r\n if not x & 1: t[i] = 1; x += 1;\r\n elif not x & 2: t[i] = 2; x += 2;\r\n else: t[i] = 4\r\np = {0: '1 ', 1: '1 ', 2: '2 ', 4: '3 '}\r\nprint(''.join(p[i] for i in t[1:]))", "dic = {}\r\nn, m = (int(x) for x in input().split()) \r\n\r\nfor ioup in range(0,m):\r\n s = [1,2,3]\r\n l = [int(x) for x in input().split()]\r\n for a in l:\r\n if a in dic:\r\n s.remove(dic[a])\r\n l.remove(a)\r\n for i in range(0,len(l)):\r\n dic.update({l[i]:s[i]})\r\n \r\nsol = [None] * n\r\n\r\nfor i in range(0,n):\r\n sol[i] = dic[i+1]\r\nprint(*sol)", "\"\"\"http://codeforces.com/problemset/problem/357/B\"\"\"\n\ndef solve(n, dances):\n k = [0] * (n + 1)\n for d in dances:\n s = [1, 2, 3]\n for i, x in enumerate(d):\n color = k[x]\n if color != 0:\n s[i], s[color -1] = s[color-1], s[i]\n for i in range(3):\n k[d[i]] = s[i]\n return ' '.join([str(k[i]) for i in range(1, n+1)])\n\nif __name__ == '__main__':\n f = lambda: list(map(int, input().split()))\n n, m = f()\n res = solve(n, [f() for _ in range(m)])\n print(res)\n" ]

[ "\r\nn,x,y=map(int,input().split())\r\nimport math\r\nan=n-1\r\nif(x<=n-1):\r\n if(y>=n):\r\n for i in range(n):\r\n print(1)\r\n else:\r\n print(-1)\r\nelse:\r\n me=math.sqrt(x-an)\r\n if(me==int(me)):\r\n me=int(me)\r\n if(me+an<=y):\r\n for i in range(n-1):\r\n print(1)\r\n print(me)\r\n else:\r\n print(-1)\r\n else:\r\n me=int(me)\r\n me+=1\r\n if(me+an<=y):\r\n for i in range(n-1):\r\n print(1)\r\n print(me)\r\n else:\r\n print(-1)\r\n", "n, x, y = map(int,input().split())\r\nif n > y :\r\n print(-1)\r\nelse :\r\n ans = (n-1)*1+(y-n+1)**2\r\n if ans < x :\r\n print(-1)\r\n else :\r\n for i in range(n-1):\r\n print(1)\r\n print(y-n+1)", "n, x, y = [int(i) for i in input().split()]\r\nn -= 1\r\nt = y - n\r\nprint(['1\\n' * n + str(t), -1][t < 1 or t * t + n < x])\r\n", "n,x,y=list(map(int,input().split()))\r\np=y-n+1\r\nif(p*p + n-1 < x):\r\n print(-1)\r\nelif(n-1 >= y):\r\n print(-1)\r\nelse:\r\n for i in range(n-1):\r\n print(1)\r\n print(p)\r\n ", "n,x,y=map(int,input().split())\r\nn-=1\r\nt=y-n\r\nprint(['1\\n'*n+str(t),-1][t<1 or t*t+n<x])", "import math\nn, x, y = map(int, input().split())\nl = [1] * n\nif y < n:\n print(-1)\n exit()\nleft = y - n + 1\nif (left * left + n - 1) < x:\n print(-1)\nelse:\n l[0] = left\n for x in l:\n print(x)", "n, x, y = map(int, input().split())\n\nprint(-1 if n > y or (y-n+1)**2+(n-1) < x else '1\\n' * (n-1) + str(y-n+1))\n \t\t \t\t\t\t\t \t\t \t \t\t \t\t \t\t\t\t", "n, x, y = map(int,input().split())\r\nres1 = y - (n - 1)\r\nsum_ = n - 1 + res1 ** 2\r\n\r\nif res1 <= 0 or sum_ < x:\r\n print(-1)\r\nelse:\r\n for i in range(n-1):\r\n print(1)\r\n print(res1)\r\n \r\n ", "import sys\r\nimport math\r\n\r\nn, x, y = [int(x) for x in (sys.stdin.readline()).split()]\r\n\r\nt = y - (n - 1)\r\n\r\nif(t < 0 or ((t ** 2) + (n - 1) < x) or n > y):\r\n print(-1)\r\n exit()\r\n\r\nprint(t)\r\nfor i in range(n - 1):\r\n print(1)\r\n ", "n, x, y = map(int, input().split())\r\nprint(-1 if n > y or (y - n + 1) ** 2 + (n - 1) < x else '1\\n' * (n - 1) + str(y - n + 1))", "n, x, y = [int(i) for i in input().split()]\r\nif (n > y):\r\n print(-1)\r\nelse:\r\n oneofthem = y - n + 1\r\n others = 1\r\n firstInequality = n - 1 + oneofthem * oneofthem\r\n if (firstInequality >= x):\r\n print(oneofthem)\r\n for i in range(n-1):\r\n print(1)\r\n else:\r\n print(-1)", "\r\n\r\n\r\nn,x,y = map(int,input().split())\r\n\r\n\r\nt=[]\r\n\r\n\r\nfor k in range(n-1):\r\n t.append(1)\r\n\r\ns = y-(n-1)\r\n\r\nif s>0:\r\n if n-1+(s)**2>=x:\r\n for si in t:\r\n print(si)\r\n print(s)\r\n else:print(-1)\r\nelse:\r\n print(-1)\r\n", "n, x, y = map(int, input().split())\r\nif n > y:\r\n print(-1)\r\nelse:\r\n z = y - (n - 1)\r\n if z ** 2 + (n - 1) < x:\r\n print(-1)\r\n else:\r\n print('1\\n' * (n - 1) + str(z))", "n, x, y = map(int, input().split())\r\narr = [1] * (n - 1) + [y + 1 - n]\r\ns = 0\r\nif n > y:\r\n print(-1)\r\n exit()\r\nfor i in arr:\r\n s += i ** 2\r\nif s >= x:\r\n for i in arr:\r\n print(i)\r\nelse:\r\n print(-1)\r\n", "n,x,y=map(int,input().split())\r\nsl=y-(n-1)\r\nsm=n-1+sl**2\r\n\r\nif sl<=0 or sm<x:\r\n print(-1)\r\nelse:\r\n for i in range(n-1):\r\n print(1)\r\n print(sl)\r\n", "n,x,y=map(int,input().split())\nn-=1\nt=y-n\nprint(['1\\n'*n+str(t),-1][t<1 or t*t+n<x])\n \t \t\t \t \t\t\t\t\t\t\t\t\t \t\t\t\t\t \t \t", "n, x, y=map(int, input().split())\r\nif y<n:\r\n print(-1)\r\nelse:\r\n temp=(y+1-n)**2+(n-1)\r\n if temp<x:\r\n print(-1)\r\n else:\r\n for i in range(n-1):\r\n print(1)\r\n print(y+1-n)", "n,x,y = map(int, input().strip().split(' '))\r\nif y//n==0:\r\n print(-1)\r\nelse:\r\n p1=y-(n-1)\r\n if p1**2 + (n-1) < x:\r\n print(-1)\r\n else:\r\n print(p1)\r\n for j in range(n-1):\r\n print(1)", "import sys\r\nfor line in sys.stdin:\r\n\tar = line.split(\" \");\r\n\tn = int(ar[0])\r\n\tx = int(ar[1])\r\n\ty = int(ar[2])\r\n\tmaxi = y - n + 1\r\n\tif maxi <= 0:\r\n\t\tprint(\"-1\")\r\n\telif maxi*maxi + n - 1 >= x:\r\n\t\tfor i in range(n - 1):\r\n\t\t\tprint(\"1\")\r\n\t\tprint(maxi)\r\n\telse:\r\n\t\tprint(\"-1\")\r\n\t\t\t\r\n\t\t\t\r\n\t", "#!/usr/bin/env python3\n\nfrom math import sqrt\n\nn, x, y = map(int, input().split())\n\nif y < n:\n print(-1)\n exit(0)\n\nok = False\nif x - n + 1 <= 0:\n ok = True\nelse:\n v = x - n + 1\n sqrt_v = int(sqrt(v))\n if sqrt_v * sqrt_v < v:\n sqrt_v += 1\n if y - n + 1 >= sqrt_v:\n ok = True\n\nif ok:\n for _ in range(n-1):\n print(1)\n print(y-n+1)\nelse:\n print(-1)\n", "n,x,y=map(int,input().split())\r\nfor i in range(1,y-n+2):\r\n if i**2+n-1>=x:exit(print(str(i)+\"\\n1\"*(n-1)))\r\nprint(-1)", "n, x, y = map(int, input().split(' '))\nif(y < n):\n\tprint(-1)\nelse:\n\tval = (y - n + 1)**2 + (n-1)\n\tif(val < x):\n\t\tprint(-1)\n\telse:\n\t\tfor i in range(n-1):\n\t\t\tprint(1)\n\t\tprint(y - n + 1)", "from math import ceil, sqrt\r\nx,y,z = map(int, input().split())\r\nt = x-1\r\nif x > z:\r\n\tprint(-1)\r\nelif y >= z and t + (ceil(sqrt(y -t)) ** 2) >= y and t + ceil(sqrt(y -t)) <= z:\r\n\tk = ceil(sqrt(y-t))\r\n\tfor c in range(x-1):\r\n\t\tprint(1)\r\n\tprint(k)\r\nelif z >= y and t + (ceil(sqrt(z - t)) ** 2) >= y and t + ceil(sqrt(z - t)) <= z:\r\n\tk = ceil(sqrt(z-t))\r\n\tfor c in range(x-1):\r\n\t\tprint(1)\r\n\tprint(k)\r\nelse:\r\n\tprint(-1)", "n, x, y = map(int, input().split())\r\n\r\nif (n <= y and (y-n+1)**2 + n-1 >= x):\r\n for i in range(n-1):\r\n print(1)\r\n print(y - n + 1)\r\nelse:\r\n print(-1)", "n,x,y=map(int,input().split())\r\nif n>y or (y-n+1)*(y-n+1)+(n-1)<x:\r\n print(-1)\r\nelse:\r\n print(y-n+1)\r\n for i in range(n-1):\r\n print(1)", "n, x, y = map(int, input().split())\r\ncurr = y - n + 1\r\nif curr <= 0:\r\n print(-1)\r\nelse:\r\n if curr ** 2 + (n - 1) < x:\r\n print(-1)\r\n else:\r\n for i in range(n-1):\r\n print(1)\r\n print(y - n + 1)" ]

[ "N = 1000\nn = int(input())\nx = []\ny = []\nf = [[0 for x in range(3*N)] for y in range(3*N)]\ns = 0\nfor i in range(n):\n\tu, v = map(int, input().split())\n\tx.append(u)\n\ty.append(v)\n\tf[u+N][v+N] = 1\nfor i in range(n):\n\tfor j in range(i+1, n):\n\t\tu = x[i]+x[j]\n\t\tv = y[i]+y[j]\n\t\ts += not(u % 2 or v % 2) and f[u//2+N][v//2+N]\nprint(s)\n\n\t\t\t\t\t \t \t \t\t\t\t \t\t\t \t \t", "p = [[False] *2001 for i in range(2001)]\r\nn = int(input())\r\npoints = [0] * n\r\nkoor=[]\r\nfor i in range(n):\r\n x, y = list(map(int, input().split()))\r\n x += 1000\r\n y += 1000\r\n koor.append([x,y])\r\n p[x][y] = True\r\notvet = 0\r\n\r\nfor i in range(n-1):\r\n for j in range(i + 1, n):\r\n x0, y0 = koor[i]\r\n x1, y1 = koor[j]\r\n if (x0 + x1) % 2 == 0:\r\n if (y0 + y1) % 2 == 0:\r\n if p[(x0 + x1) // 2][(y0 + y1) // 2]:\r\n otvet +=1\r\nprint(otvet)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nd = [[0]*2000 for _ in range(2000)]\r\nn = int(input())\r\nw = []\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n w.append((a,b))\r\n d[a][b] = 1\r\n\r\nc = 0\r\nfor i in range(n):\r\n for j in range(i+1, n):\r\n x = (w[i][0] + w[j][0])/2\r\n y = (w[i][1] + w[j][1])/2\r\n if x == int(x) and y == int(y):\r\n c += d[int(x)][int(y)]\r\n\r\nprint(c)\r\n", "import sys\nn = int(sys.stdin.readline())\ns = set()\nl = []\nfor i in range(n):\n\ta, b = map(int, input().split())\n\t# t = str(a) + \" \" + str(b)\n\ts.add((a,b))\n\tl.append((a,b))\nres = 0\n\nfor i in range(n-1):\n\txi, yi = l[i][0], l[i][1]\n\tfor j in range(i+1, n):\n\t\txj, yj = l[j][0], l[j][1]\n\t\t# xi, yi = map(int, l[i].split())\n\t\t# xj, yj = map(int, l[j].split())\n\t\tif (xi+xj)%2 ==0 and (yi + yj)%2==0:\n\t\t\tif ((xi+xj)//2 , (yi+yj)//2) in s:\n\t\t\t\tres+=1\nsys.stdout.write( str(res)+\"\\n\")\n\t\t\n\t\t\t \t \t\t \t \t \t\t \t \t \t\t\t", "class Point:\r\n def __init__(self, coord_x, coord_y):\r\n self.coord_x = coord_x\r\n self.coord_y = coord_y\r\n\r\n def info(self):\r\n return self.coord_x, self.coord_y\r\n\r\np = [[False] *2001 for i in range(2001)]\r\nn = int(input())\r\npoints = [0] * n\r\nfor i in range(n):\r\n x, y = list(map(int, input().split()))\r\n x += 1000\r\n y += 1000\r\n points[i] = Point(x, y)\r\n p[x][y] = True\r\notvet = 0\r\n\r\nfor i in range(n-1):\r\n for j in range(i + 1, n):\r\n x0, y0 = points[i].info()\r\n x1, y1 = points[j].info()\r\n if (x0 + x1) % 2 == 0:\r\n if (y0 + y1) % 2 == 0:\r\n if p[(x0 + x1) // 2][(y0 + y1) // 2]:\r\n otvet +=1\r\nprint(otvet)", "import sys\r\nfrom collections import *\r\nsys.setrecursionlimit(10**5)\r\nitr = (line for line in sys.stdin.read().strip().split('\\n'))\r\nINP = lambda: next(itr)\r\ndef ni(): return int(INP())\r\ndef nl(): return [int(_) for _ in INP().split()]\r\n\r\n\r\n\r\n\r\ndef solve(t, p):\r\n #sorted by x coordinate\r\n a2 = [[0 for _ in range(2002)] for _ in range(2002)]\r\n \r\n for i in range(t):\r\n x1, y1 = p[i][0], p[i][1]\r\n a2[x1 + 1000][y1+1000] = 1\r\n \r\n seg = 0\r\n for p1 in range(t-1):\r\n for p2 in range(p1+1, t):\r\n x1, y1 = p[p1]\r\n x2, y2 = p[p2]\r\n if (x1 + x2) % 2 == 0 and (y1 + y2) % 2 == 0:\r\n x = (x1 + x2) //2\r\n y = (y1 + y2) // 2\r\n if a2[x+1000][y+1000]:\r\n #print(x1, y1, x2, y2, x, y)\r\n seg += 1\r\n \r\n print(seg)\r\n \r\n \r\n\r\n\r\n\r\nt = ni()\r\np = []\r\nfor case in range(t):\r\n x, y = nl()\r\n p.append((x,y))\r\nsolve(t, p)", "n = int(input())\n\npoints_array = []\n\n\ncords = []\nfor i in range(2001):\n\tcords.append([False] * 2001)\n\t\nfor i in range(n):\n x, y = [a for a in input().split()]\n points_array.append([int(x), int(y)])\n cords[int(x)+1000][int(y)+1000] = True\n\n\ncount = 0\nfor i in range(n):\n for j in range(i+1, n):\n x1, y1 = points_array[i]\n x3, y3 = points_array[j]\n x2 = int((x1 + x3)/2)\n y2 = int((y1 + y3)/2)\n\n # print(p, q, r, s)\n if ((x1 + x3)%2 == 0 and (y1+y3)%2 == 0) and cords[x2+1000][y2+1000]:\n count += 1\n\nprint(count)\n", "def answer():\n\n ans=0\n\n for i in range(n):\n for j in range(i + 1 ,n):\n\n if(((x[i]+x[j]) & 1)==0 and ((y[i]+y[j]) & 1)==0):\n xcoor=(x[i]+x[j])//2\n ycoor=(y[i]+y[j])//2\n \n\n try:\n d[xcoor,ycoor]\n ans+=1\n except:pass\n return ans\n\n\nn=int(input())\n\nx,y=[],[]\nd=dict()\n\nfor i in range(n):\n\n a,b=map(int,input().split())\n x.append(a)\n y.append(b)\n\n d[a,b]=True\n\nprint(answer())\n\n \t\t\t\t \t \t\t\t\t\t\t \t \t\t\t\t \t\t \t", "import sys\nimport fractions\ndef solve():\n n , res = int(input()), 0\n xs, ys = list(), list()\n mem = set()\n for i in range(n):\n x, y = map(int, input().split())\n xs.append(x)\n ys.append(y)\n mem.add((x, y))\n for i in range(n):\n for j in range(i + 1, n):\n sumx, sumy = (xs[i] + xs[j]), (ys[i] + ys[j])\n if sumx % 2 == 0 and sumy % 2 == 0:\n wantx, wanty = sumx//2, sumy //2\n if (wantx, wanty) in mem: res+=1\n print(res)\n\n\nif sys.hexversion == 50594544 : sys.stdin = open(\"test.txt\")\nsolve()", "# O(N^2 log N)\r\nN = int(input())\r\nA = []\r\n\r\ndef found(i, j):\r\n L, R = 0, N-1\r\n while L <= R:\r\n M = L + (R - L) // 2\r\n if A[M] == (i, j):\r\n return True\r\n if A[M] < (i, j):\r\n L = M+1\r\n else:\r\n R = M-1\r\n return False\r\n\r\nfor i in range(N):\r\n X, Y = map(int, input().split())\r\n A.append((X, Y))\r\nA.sort()\r\n \r\nans = 0\r\nfor i in range(N):\r\n for j in range(i+1, N):\r\n X = A[i][0] + A[j][0]\r\n Y = A[i][1] + A[j][1]\r\n if X % 2 == 0 and Y % 2 == 0 and found(X//2, Y//2):\r\n ans += 1\r\n \r\nprint(ans)", "def get_input():\r\n return tuple(map(int, input().split()))\r\n\r\n\r\ndef median(p1: tuple, p2: tuple):\r\n return tuple(((p1[0] + p2[0]) / 2, (p1[1] + p2[1]) / 2))\r\n\r\n\r\nn = int(input())\r\n\r\npoints = set()\r\npoints_list = []\r\nfor i in range(n):\r\n points.add(pos := get_input())\r\n points_list.append(pos)\r\n\r\ncnt = 0\r\n\r\nfor first in range(len(points_list) - 1):\r\n for second in range(first + 1, len(points_list)):\r\n if median(points_list[first], points_list[second]) in points:\r\n cnt += 1\r\n\r\nprint(cnt)\r\n", "mod = 1000000007\r\nii = lambda : int(input())\r\nsi = lambda : input()\r\ndgl = lambda : list(map(int, input()))\r\nf = lambda : map(int, input().split())\r\nil = lambda : list(map(int, input().split()))\r\nls = lambda : list(input())\r\nn=ii()\r\ns=set()\r\nxs=[]\r\nys=[]\r\nfor _ in range(n):\r\n x,y=f()\r\n xs.append(x)\r\n ys.append(y)\r\n s.add((x,y))\r\nc=0\r\nfor i in range(n-1):\r\n for j in range(i+1,n):\r\n smx=xs[i]+xs[j]\r\n smy=ys[i]+ys[j]\r\n if smx%2==0 and smy%2==0 and (smx//2,smy//2) in s:\r\n c+=1\r\nprint(c)\r\n", "'''\r\n3\r\n1 1\r\n2 2\r\n3 3\r\n'''\r\nn = int(input())\r\nxMap = {}\r\npoints = []\r\ncounter = 0\r\n\r\nfor i in range(n):\r\n x,y = map(int, input().split())\r\n if not x in xMap:\r\n xMap[x] = set()\r\n p = (x, y)\r\n xMap[x].add(y)\r\n points.append(p)\r\n\r\nfor i in range(n-1):\r\n for j in range(i+1, n):\r\n x1,y1 = points[i]\r\n x2, y2 = points[j]\r\n if (x1 + x2) % 2 == 0 and (y1+y2) % 2 == 0:\r\n \r\n midX = (x1+x2)//2\r\n midY = (y1+y2)//2\r\n if midX in xMap:\r\n if midY in xMap[midX]:\r\n counter+=1\r\n\r\nprint(counter)", "import operator as op\nfrom io import BytesIO\nimport os\ninput = BytesIO(os.read(0, os.fstat(0).st_size)).readline\nfrom collections import defaultdict\n\ndef isOdd(num):\n return num % 2 != 0\n\ndef main():\n space = defaultdict(set)\n cases = int(input())\n points = []\n for _ in range(cases):\n a, b = map(int, input().split())\n space[a].add(b)\n points.append((a,b))\n\n answer = 0\n points.sort(key=op.itemgetter(0,1))\n for left in range(cases-2):\n for right in range(left+2, cases):\n start = points[left]\n end = points[right]\n\n x = start[0] + end[0]\n y = start[1] + end[1]\n \n if isOdd(x) or isOdd(y): continue\n if x//2 in space and y//2 in space.get(x//2): answer += 1\n\n print(answer)\n\n\nif __name__ == \"__main__\":\n main()\n", "N = int(input())\r\nA = []\r\nB = [[False for _ in range(2001)] for _ in range(2001)]\r\n\r\nfor i in range(N):\r\n X, Y = map(int, input().split())\r\n X += 1000\r\n Y += 1000\r\n A.append((X, Y))\r\n B[X][Y] = True\r\n \r\nans = 0\r\nfor i in range(N):\r\n for j in range(i+1, N):\r\n X = A[i][0] + A[j][0]\r\n Y = A[i][1] + A[j][1]\r\n if X % 2 == 0 and Y % 2 == 0 and B[X // 2][Y // 2]:\r\n ans += 1\r\n \r\nprint(ans)", "n = int(input())\r\n \r\npoints = []\r\ncnt = 0\r\ncheck= []\r\nfor c in range(2001):\r\n l = [0]*2001\r\n check.append(l)\r\nfor i in range(n):#data input\r\n xy = list(map(int, input().split()))\r\n couple = (xy[0],xy[1])\r\n points.append(couple)\r\n check[xy[0]+1000][xy[1]+1000] = 1\r\n \r\nfor i in range(n):\r\n for j in range(i+1, n):\r\n if ((points[i][0] + points[j][0]) % 2 == 0 )and ((points[i][1] + points[j][1]) % 2 == 0):\r\n x = (points[i][0] + points[j][0])//2 \r\n y = (points[i][1] + points[j][1])//2\r\n if check[x+1000][y+1000]:\r\n cnt +=1\r\nprint(cnt)", "n = int(input())\ndata = []\na = []\nfor j in range(2001):\n data.append(2001 * [0])\nfor _ in range(n):\n x, y = map(int, input().split())\n data[x + 1000][y + 1000] = 1\n a.append((x + 1000, y + 1000))\nans = 0\nfor i in range(n - 1):\n for j in range(i + 1, n):\n diff_x = a[i][0] + a[j][0]\n diff_y = a[i][1] + a[j][1]\n if diff_x / 2 != diff_x // 2 or diff_y / 2 != diff_y // 2:\n continue\n if data[int(diff_x / 2)][int(diff_y / 2)] == 1:\n ans += 1\nprint(ans)\n", "'''1dL1nG'''\r\nn = int(input())\r\nl = []\r\nd = set()\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n l.append([x, y])\r\n d.add((x, y))\r\nc = 0\r\nfor i in range(n):\r\n for j in range(i+1, n):\r\n if (l[i][0]+l[j][0]) % 2 == 0 and (l[i][1]+l[j][1]) % 2 == 0:\r\n x1 = (l[i][0]+l[j][0])//2\r\n y1 = (l[i][1]+l[j][1])//2\r\n if (x1, y1) in d:\r\n c += 1\r\nprint(c)\r\n", "s, n = 0, int(input())\r\na = [0] * n\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n a[i] = 4000 * x + y\r\na.sort()\r\nb = set(2 * k for k in a)\r\nfor i, u in enumerate(a, 2): \r\n for v in a[i: ]:\r\n if v + u in b: s += 1 \r\nprint(s)", "points = set()\r\nx_cor,y_cor = [],[]\r\nfor _ in range(int(input())):\r\n x,y = list(map(int,input().split()))\r\n x_cor.append(x)\r\n y_cor.append(y)\r\n points.add((x,y))\r\nans = 0\r\nfor i in range(len(points)):\r\n for j in range(i+1,len(points)):\r\n x,y = x_cor[i],y_cor[i]\r\n u,v = x_cor[j],y_cor[j]\r\n sx,sy = x+u,y+v\r\n if sx%2==0 and sy%2==0:\r\n wx,wy = sx//2,sy//2\r\n if (wx,wy) in points:\r\n ans+=1\r\nprint(ans)", "n = int(input())\r\nl = []\r\ns = set()\r\nfor _ in range(n):\r\n x, y = map(int, input().split())\r\n l.append((x, y))\r\n s.add((x, y))\r\n\r\nans = 0\r\n\r\nfor i in range(n-1):\r\n for j in range(i+1, n):\r\n t_x = l[i][0]+l[j][0]\r\n t_y = l[i][1]+l[j][1]\r\n if not(t_x%2) and not(t_y%2) and (t_x//2, t_y//2) in s:\r\n ans += 1\r\nprint(ans)\r\n\"\"\"\r\ncounter = 0\r\n\r\nfor i in c(l, 3):\r\n if (i[0][0]+i[1][0]) == i[2][0]*2 and (i[0][1]+i[1][1]) == i[2][1]*2:\r\n counter += 1\r\n if (i[0][0]+i[2][0]) == i[1][0]*2 and (i[0][1]+i[2][1]) == i[1][1]*2:\r\n counter += 1\r\n if (i[2][0]+i[1][0]) == i[0][0]*2 and (i[2][1]+i[1][1]) == i[0][1]*2:\r\n counter += 1\r\n\r\nprint(counter)\r\n\"\"\"\r\n", "n = int(input())\r\nxys = set([tuple(map(int,input().split())) for i in range(n)])\r\nxy = list(xys)\r\n\r\nans = 0\r\nfor i in range(n-1):\r\n for j in range(i+1, n):\r\n x = (xy[i][0] + xy[j][0])/2\r\n y = (xy[i][1] + xy[j][1])/2\r\n if (x,y) in xys:\r\n ans += 1\r\n\r\nprint(ans)", "n=int(input())\r\nlst=[]\r\nd = set()\r\nfor i in range(n):\r\n x,y=map(int, input().split())\r\n lst.append([x,y])\r\n d.add((x,y))\r\nans=0\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n if (lst[i][0]+lst[j][0])%2==0 and (lst[i][1]+lst[j][1])%2==0:\r\n x1 = (lst[i][0]+lst[j][0])//2\r\n y1 = (lst[i][1]+lst[j][1])//2\r\n if (x1,y1) in d:\r\n ans+=1\r\nprint(ans)" ]

[ "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-30 23:20:25\nLastEditTime: 2021-11-30 23:22:04\nDescription: INTERCALC\nFilePath: CF784C.py\n'''\n\n\ndef func():\n n = int(input())\n lst = list(map(int, input().strip().split()))\n print(max(lst) ^ lst[-1])\n\n\nif __name__ == '__main__':\n func()\n", "n,a=input(),list(map(int,input().split()))\r\nprint(max(a)^a[-1])", "n = int(input())\nl = tuple(map(int, input().split()))\nprint(max(l) ^ l[len(l) - 1])", "def intercalc(lst):\r\n return max(lst) ^ lst[-1]\r\n\r\n\r\nn = int(input())\r\na = [int(i) for i in input().split()]\r\nprint(intercalc(a))\r\n", "i=input\r\ni()\r\na=list(map(int, i().split()))\r\nprint(max(a)^a[-1])", "input()\r\na=list(map(int,input().split()))\r\nprint(a[-1]^max(a))", "n=int(input())\r\nL=[int(_) for _ in input().split()]\r\nprint(L[n-1]^max(L))\r\n", "# LUOGU_RID: 101670491\nn, *a = map(int, open(0).read().split())\r\nprint(max(a) ^ a[-1])", "n=int(input())\r\nlis=[*map(int,input().split())]\r\nprint(max(lis)^lis[-1])", "n = int(input())\r\na1 = input().split()\r\na = [int(a1[i]) for i in range(len(a1))]\r\nprint(max(a) ^ a[-1])", "n = int(input())\nA = [int(x) for x in input().split()]\nprint(A[-1]^max(A))\n", "input()\r\nl = list(map(int,input().split()))\r\nx = max(l) ^ l[-1]\r\nprint(x)", "_=input()\r\nn=list(map(int,input().split()))\r\nprint(n[-1]^max(n))\r\n#print(' '.join([str(i) for i in a]))", "n = int(input())\r\nm = list(map(int, input().split()))\r\nprint(max(m) ^ m[-1])", "a=int(input())\r\nl=list(map(int,input().split()))\r\nprint(max(l)^l[-1])", "def mp():\n return map(int, input().split())\n\nn = int(input())\na = list(mp())\nprint(max(a) ^ a[-1])" ]

[ "import shlex\r\nfor s in shlex.split(input()):\r\n print('<' + s + '>')", "def main():\r\n string = input()\r\n\r\n answer_arr = []\r\n temp_string = \"\"\r\n open_quote = False\r\n for character in string:\r\n if character == '\"':\r\n if open_quote:\r\n open_quote = False\r\n answer_arr.append(temp_string)\r\n temp_string = \"\"\r\n else:\r\n open_quote = True\r\n else:\r\n if open_quote:\r\n temp_string += character\r\n else:\r\n if not character == \" \":\r\n temp_string += character\r\n else:\r\n if temp_string != \"\":\r\n answer_arr.append(temp_string)\r\n temp_string = \"\"\r\n\r\n if temp_string != \"\":\r\n answer_arr.append(temp_string)\r\n\r\n for element in answer_arr:\r\n print(f\"<{element}>\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import shlex\r\ns=input();\r\na=shlex.split(s)\r\nfor x in a:\r\n print('<'+x+'>')", "def printtag(s):\r\n print(\"<\" + s + \">\")\r\n\r\ns = input()\r\nl = s.split(\"\\\"\")\r\nnon_modify = 0\r\nfor s in l:\r\n if non_modify:\r\n printtag(s)\r\n else:\r\n tmp_lst = s.split(\" \")\r\n for st in tmp_lst:\r\n if len(st):\r\n printtag(st)\r\n non_modify = 1 - non_modify", "# from dust i have come dust i will be\r\n\r\nimport shlex\r\n\r\ns=input();\r\na=shlex.split(s)\r\n\r\nfor x in a:\r\n print('<'+x+'>')\r\n", "import re\nfrom collections import Counter\n\nclass Task:\n\tanswer = []\n\tstr = \"\"\n\t\n\tdef getData(self):\n\t\tx = 0\n\t\tself.str = input()\n\t\n\tdef solve(self):\n\t\tlist = re.findall(\"\\\".*?\\\"|[^ ]+\", self.str)\n\t\tself.answer = [\"<\" + x.replace(\"\\\"\", \"\") + \">\" for x in list]\n\t\n\tdef printAnswer(self):\n\t\tfor x in self.answer:\n\t\t\tprint(x)\n\ntask = Task();\ntask.getData();\ntask.solve();\ntask.printAnswer();\n", "import re\nimport sys\n\nINF = 10 ** 18 + 3\n\n\ndef main():\n s = input()\n pattern = re.compile(r\"\"\"(\"[^\"]*\"|\\S+)\"\"\")\n\n for item in pattern.findall(s):\n print(\"<%s>\" % item.strip(\"\\\"\"))\n\n\ndef set_input(file):\n global input\n input = lambda: file.readline().rstrip()\n\n\ndef set_output(file):\n global print\n lprint = print\n\n def print(*args, **kwargs):\n kwargs[\"file\"] = kwargs.get(\"file\", file)\n return lprint(*args, **kwargs)\n\n\nif __name__ == '__main__':\n is_mine = \"MINE\" in sys.argv\n set_input(open(\"input.txt\", \"r\") if is_mine else sys.stdin)\n set_output(sys.stdout if is_mine else sys.stdout)\n main()\n", "import sys\n# f = sys.stdin\n# f = open(\"input.txt\", \"r\")\na = input()\ni = 0\nwhile i < len(a):\n if a[i] == '\"':\n end = a.index('\"', i+1)\n print(\"<\", a[i+1:end], \">\", sep=\"\")\n i = end+1\n elif a[i] != \" \" != '\"' and (a[i-1] == \" \" or i-1 < 0):\n try:\n end = a.index(\" \", i+1)\n except:\n end = len(a)\n print(\"<\", a[i:end], \">\", sep=\"\")\n i = end+1\n else:\n i += 1", "l=input().strip()\r\nr=[]\r\nu=l.split('\"')\r\nif l[-1]=='\"':\r\n u.pop()\r\n\r\nv=len(u)\r\n\r\nfor i in range(v):\r\n if i%2:\r\n r.append(u[i])\r\n else:\r\n x=u[i].split()\r\n for j in x:\r\n r.append(j)\r\n\r\nfor u in r:\r\n print('<',u,'>',sep='')\r\n", "def main(s):\r\n type = 0\r\n temp = ''\r\n answer = []\r\n\r\n #type:\r\n #0 - обычный поиск\r\n #1 - внутри кавычек\r\n\r\n for c in s:\r\n if type==0:\r\n if c==' ':\r\n if temp!='':\r\n answer.append(temp)\r\n temp=''\r\n elif c=='\\\"':\r\n if temp!='':\r\n answer.append(temp)\r\n temp = ''\r\n type = 1\r\n else:\r\n temp+=c\r\n elif type==1:\r\n if c=='\\\"':\r\n type = 0\r\n answer.append(temp)\r\n temp = ''\r\n else:\r\n temp+=c\r\n\r\n if type==0 and temp!='':\r\n answer.append(temp)\r\n\r\n q = ''\r\n for item in answer:\r\n q+='<'+item+'>\\n'\r\n\r\n return q[:-1]\r\n\r\ndef init():\r\n s = input()\r\n\r\n print(main(s))\r\n\r\ninit()", "def main():\n res = []\n for i, s in enumerate(input().split('\"')):\n if i & 1:\n res += [\"<\", s, \">\\n\"]\n else:\n for t in s.split():\n res += [\"<\", t, \">\\n\"]\n print(''.join(res), end='')\n\n\nif __name__ == '__main__':\n main()\n", "import shlex\r\n\r\ninputString = input()\r\nresult = shlex.split(inputString)\r\nfor res in result:\r\n print(\"<{}>\".format(res))", "c, s = list(), input().split('\"')\nfor i in range(len(s)):\n\tif i&1:\n\t\tc.append(s[i])\n\telse:\n\t\tc.extend(s[i].split())\nprint(*['<'+e+'>' for e in c],sep='\\n')\n" ]

[ "from collections import Counter\r\ninp= lambda:list(map(int, input().split()))\r\nn,scientist, i,audio,sbt = int(input()), inp(), int(input()), inp(), inp()\r\ncounter = Counter(scientist)\r\nmovies = list(zip(audio,sbt))\r\nresult = sorted(movies, key=lambda x: (counter[x[0]], counter[x[1]]), reverse= True)[0]\r\nprint(movies.index(result)+1)\r\n\r\n\r\n", "import sys\nsys.stderr = sys.stdout\n\nfrom collections import Counter\n\n\ndef cinema(n, A, m, B, C):\n L = Counter(A)\n return max(range(m), key=lambda i: (L[B[i]], L[C[i]])) + 1\n\n\ndef main():\n n = readint()\n A = readintl()\n m = readint()\n B = readintl()\n C = readintl()\n print(cinema(n, A, m, B, C))\n\n##########\n\ndef readint():\n return int(input())\n\n\ndef readinti():\n return map(int, input().split())\n\n\ndef readintt():\n return tuple(readinti())\n\n\ndef readintl():\n return list(readinti())\n\n\ndef readinttl(k):\n return [readintt() for _ in range(k)]\n\n\ndef readintll(k):\n return [readintl() for _ in range(k)]\n\n\ndef log(*args, **kwargs):\n print(*args, **kwargs, file=sys.__stderr__)\n\n\nif __name__ == '__main__':\n main()\n", "from collections import defaultdict\n\ndef choose_movie(n, scientist_languages, m, movie_audio_languages, movie_subtitles_languages):\n scores = defaultdict(lambda: [0, 0])\n max_satisfied_count = 0\n max_almost_satisfied_count = 0\n max_movie = -1\n\n for i in range(n):\n lang = scientist_languages[i]\n scores[lang][0] += 1\n\n for i in range(m):\n audio_lang = movie_audio_languages[i]\n subtitles_lang = movie_subtitles_languages[i]\n satisfied_count = scores[audio_lang][0]\n almost_satisfied_count = scores[subtitles_lang][0]\n scores[audio_lang][1] += 1\n\n if satisfied_count + 1 > max_satisfied_count or (satisfied_count + 1 == max_satisfied_count and almost_satisfied_count > max_almost_satisfied_count):\n max_satisfied_count = satisfied_count + 1\n max_almost_satisfied_count = almost_satisfied_count\n max_movie = i + 1\n\n return max_movie\n\nn = int(input())\nscientist_languages = list(map(int, input().split()))\nm = int(input())\nmovie_audio_languages = list(map(int, input().split()))\nmovie_subtitles_languages = list(map(int, input().split()))\n\nresult = choose_movie(n, scientist_languages, m, movie_audio_languages, movie_subtitles_languages)\nprint(result)\n\n \t\t \t\t\t \t\t \t \t \t\t \t \t \t \t", "s = int(input(\"\"))\r\narr = list(map(int, input().split()))\r\nm = int(input(\"\"))\r\nlang = list(map(int, input().split()))\r\nsub = list(map(int, input().split()))\r\nmaxl = -1\r\nmaxs = -1\r\nc = 0\r\nict = {}\r\nfor i in arr:\r\n if ict.get(i) != None:\r\n ict[i] += 1\r\n else:\r\n ict[i] = 1\r\nfor i in range(m):\r\n if(ict.get(lang[i]) != None):\r\n a = ict[lang[i]]\r\n else:\r\n a = 0\r\n if(ict.get(sub[i]) != None):\r\n b = ict[sub[i]]\r\n else:\r\n b = 0\r\n\r\n if a > maxl:\r\n maxl = a\r\n maxs = b\r\n c = i+1\r\n continue\r\n\r\n if a == maxl and b > maxs:\r\n maxs = b\r\n c = i+1\r\n continue\r\nprint(c)", "from collections import Counter\r\nfrom itertools import count\r\nfrom os import path\r\nfrom random import getrandbits\r\nfrom sys import stdin, stdout\r\n\r\n\r\nfilename = \"../templates/input.txt\"\r\nif path.exists(filename):\r\n stdin = open(filename, 'r')\r\n\r\n\r\ndef input():\r\n return stdin.readline().rstrip()\r\n\r\n\r\ndef print(*args, sep=' ', end='\\n'):\r\n stdout.write(sep.join(map(str, args)))\r\n stdout.write(end)\r\n\r\n\r\nRANDOM = getrandbits(32)\r\n\r\n\r\nclass Int(int):\r\n def __hash__(self):\r\n return super().__hash__() ^ RANDOM\r\n\r\n\r\ndef solution():\r\n n = int(input())\r\n cnt = Counter(Int(num) for num in input().split())\r\n m = int(input())\r\n b = [int(num) for num in input().split()]\r\n c = [int(num) for num in input().split()]\r\n print(max(range(m), key=lambda i: (cnt[Int(b[i])], cnt[Int(c[i])])) + 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 collections\nimport math\nimport copy\ndef main():\n n = int(input())\n s = list(map(int,input().split()))\n m = int(input())\n a = list(map(int,input().split()))\n b = list(map(int,input().split()))\n #a = list(map(int,input().split()))\n solution(n,m,s,a,b) \n\ndef solution(n,m,s,a,b):\n lan_count = collections.Counter(s)\n movies = dict()\n for i in range(m):\n movies[i] = (lan_count[a[i]],lan_count[b[i]])\n ans = sorted(movies.items(),reverse=True,key=lambda x:x[1])\n print(ans[0][0]+1)\n \n \n\n \n\n\n \n \n\n \n \n\n\nmain()", "from collections import Counter\r\n\r\nn = int(input())\r\nC = Counter(map(int, input().split()))\r\n\r\nm = int(input())\r\naudio = list(map(int,input().split()))\r\nsubs = list(map(int,input().split()))\r\nmerge = [(C.get(a, 0), C.get(b, 0)) for a, b in zip(audio, subs)]\r\nprint(merge.index(max(merge))+1)", "\r\nfrom sys import stdin, stdout\r\nimport math, bisect\r\nfrom collections import Counter, deque, defaultdict\r\n\r\nL = lambda: list(map(int, stdin.readline().strip().split()))\r\nI = lambda: int(stdin.readline().strip())\r\nS = lambda: stdin.readline().strip()\r\nC = lambda: stdin.readline().strip().split()\r\n\r\n\r\ndef pr(a): print(\" \".join(list(map(str, a))))\r\n\r\n\r\nn = I()\r\na = L()\r\nm = I()\r\nb = L()\r\nc = L()\r\nmp = {}\r\nmp=defaultdict(int)\r\nfor item in a:\r\n if item not in mp:\r\n mp[item] = 1\r\n else:\r\n tmp=int(mp[item])\r\n tmp+=1\r\n mp[item] = tmp\r\nans=1\r\nmx = 0\r\nfor i in range(m):\r\n sums = 0\r\n if b[i] in mp: sums += mp[b[i]]\r\n if mx < sums:\r\n ans=i+1\r\n mx=sums\r\nmx2=0\r\nfor i in range(m):\r\n sums=0\r\n if c[i] in mp: sums += mp[c[i]]\r\n if mx2 < sums and mp[b[i]]==mx:\r\n ans=i+1\r\n mx2=sums\r\nprint(ans)\r\n", "from collections import defaultdict\r\ndef z_():\r\n return 0\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nm=int(input())\r\nal=list(map(int,input().split()))\r\nsl=list(map(int,input().split()))\r\nd=defaultdict(z_) \r\nfor i in l:\r\n d[i]+=1\r\nau=al[0]\r\nsb=sl[0]\r\nc=0\r\nfor i in range(1,m):\r\n if d[al[i]]>d[au]:\r\n au=al[i]\r\n sb=sl[i]\r\n c=i\r\n elif d[al[i]]==d[au]:\r\n if d[sl[i]]>d[sb]:\r\n sb=sl[i]\r\n c=i\r\nprint(c+1)\r\n ", "from sys import stdin\r\n\r\ndef inp(): return input()\r\n\r\n\r\ndef iinp(): return int(inp())\r\n\r\n\r\ndef mp(): return map(int, inp().split())\r\n\r\n\r\ndef lmp(): return list(mp())\r\n\r\n\r\ndef solve():\r\n n = iinp()\r\n a = lmp()\r\n m = iinp()\r\n b, c = lmp(), lmp()\r\n s = {}\r\n for i in a:\r\n if i in s:\r\n s[i] += 1\r\n else:\r\n s[i] = 1\r\n d = []\r\n for i in range(m):\r\n first = b[i]\r\n second = c[i]\r\n t = [0, 0, i]\r\n if first in s:\r\n t[0] = s[first]\r\n if second in s:\r\n t[1] = s[second]\r\n d.append(t)\r\n d.sort()\r\n print(d[-1][-1] + 1)\r\n\r\nif __name__ == \"__main__\":\r\n tt = 1\r\n multi = False\r\n if multi: tt = iinp()\r\n for i in range(tt):\r\n solve()", "from collections import Counter\nfrom operator import itemgetter\n\nn = int(input())\n\nlanguages = list(map(int, input().split()))\nm = int(input())\naudios = list(map(int, input().split()))\nsubs = list(map(int, input().split()))\n\nmovies = list(zip(audios, subs))\ncounter = Counter(languages)\n# print(counter[])\n\nbest = sorted(movies, key=lambda a: (counter[a[0]], counter[a[1]]))[-1]\nprint(movies.index(best) + 1)\n", "from collections import defaultdict\r\nimport sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\ncnt = defaultdict(lambda : 0)\r\nfor i in sorted(a):\r\n cnt[i] += 1\r\nm = int(input())\r\nb = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\nu, v = 0, 0\r\nans = 1\r\nfor i in range(m):\r\n bi, ci = b[i], c[i]\r\n if u < cnt[bi] or (u == cnt[bi] and v < cnt[ci]):\r\n u, v = cnt[bi], cnt[ci]\r\n ans = i + 1\r\nprint(ans)", "from collections import *\r\nn=int(input())\r\nb=Counter(map(int,input().split()))\r\nm=int(input())\r\nprint(sorted((b[int(l[0])],b[int(l[1])],z+1)for z,l in enumerate(zip(input().split(),input().split())))[-1][2])", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nw = list(map(int, input().split()))\r\nm = int(input())\r\nv = list(map(int, input().split()))\r\nt = list(map(int, input().split()))\r\n\r\nd = dict()\r\nfor i in w:\r\n d[i] = d.get(i, 0) + 1\r\n\r\nans = [-1, -1]\r\nc = -1\r\n\r\nfor i in range(m):\r\n x = [d.get(v[i], 0), d.get(t[i], 0)]\r\n if ans < x:\r\n ans = x\r\n c = i\r\n\r\nprint(c+1)", "from collections import Counter as C\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\nmp=C(arr)\r\nm=int(input())\r\nb=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\nlst=list()\r\narr=list()\r\nfor i in range(m):\r\n x,y=b[i],c[i]\r\n lst.append((mp[x],mp[y],x,y))\r\n arr.append((x,y))\r\nlst=sorted(lst,reverse=True)\r\nfor i in range(m):\r\n if arr[i][0]==lst[0][2] and arr[i][1]==lst[0][3]:print(i+1); quit()", "from collections import Counter\r\nI=lambda:[*map(int,input().split())]\r\nn=I()[0]\r\nc=Counter(I())\r\nm=I()[0]\r\nb=sorted(zip(I(),I(),range(m)),key=lambda x:[c[x[0]],c[x[1]]])\r\nprint(b[-1][-1]+1)", "from collections import defaultdict\r\nn = int(input())\r\nlang = list(map(int, input().split()))\r\nm = int(input())\r\nB = list(map(int,input().split()))\r\nC = list(map(int, input().split()))\r\nind = [i for i in range(m)]\r\nmovies = [list(x) for x in zip(B,C,ind)]\r\n\r\nlcount = defaultdict(int)\r\nfor i in lang:\r\n lcount[i] += 1\r\n\r\nmovies.sort(key=lambda x:(lcount[x[0]], lcount[x[1]]), reverse=True)\r\n\r\nprint(movies[0][2]+1)", "from collections import Counter\n\nn = int(input())\nlanguages = Counter()\nsc = list(map(int, input().split(' ')))\nfor lang in sc:\n languages[lang] += 1\nm = int(input())\nb = list(map(int, input().split(' ')))\nc = list(map(int, input().split(' ')))\nresult = []\nfor i in range(m):\n result.append((languages[b[i]], languages[c[i]], i))\nresult.sort()\nprint(result[-1][2] + 1)\n\n\n \t\t \t\t\t\t \t\t \t \t\t\t \t", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\ninput=sys.stdin.readline\r\nn=int(input())\r\nl=[int(i) for i in input().split()]\r\nm=int(input())\r\nb=[int(i) for i in input().split()]\r\nc=[int(i) for i in input().split()]\r\nd1=collections.Counter(l)\r\nm1,m2,ind=-1,-1,-1\r\nfor i in range(m):\r\n if(d1[b[i]]>m1):\r\n m1=d1[b[i]]\r\nfor i in range(m):\r\n if(d1[b[i]]==m1):\r\n if(d1[c[i]]>m2):\r\n m2=d1[c[i]]\r\n ind=i+1\r\nprint(ind)" ]

[ "import sys\r\nfrom array import array # noqa: F401\r\nfrom collections import defaultdict\r\n\r\n\r\ndef input():\r\n return sys.stdin.buffer.readline().decode('utf-8')\r\n\r\n\r\nk, n, m, q = map(int, input().split())\r\nbasic = [input().rstrip() for _ in range(n)]\r\ncomposite = defaultdict(list)\r\nfor _ in range(m):\r\n name, desc = input().split(':')\r\n for item in desc.split(','):\r\n pair = item.split()\r\n pair[1] = int(pair[1])\r\n composite[name].append(pair)\r\n\r\nbackpack = [defaultdict(int) for _ in range(k + 1)]\r\nfor _ in range(q):\r\n f, name = input().split()\r\n f = int(f)\r\n backpack[f][name] += 1\r\n\r\n for key, recipe in composite.items():\r\n if all(backpack[f][base] >= cnt for base, cnt in recipe):\r\n for base, cnt in recipe:\r\n backpack[f][base] -= cnt\r\n backpack[f][key] += 1\r\n\r\n\r\nfor i in range(1, k + 1):\r\n ans = [f'{name} {cnt}' for name, cnt in backpack[i].items() if cnt > 0]\r\n ans.sort()\r\n print(len(ans))\r\n if ans:\r\n print('\\n'.join(ans))\r\n", "k,m,n,q = map(int, input().split())\r\nbasic = [input() for _ in range(m)]\r\nfrom collections import Counter, defaultdict\r\nrecipes, accounts = defaultdict(Counter), defaultdict(Counter)\r\nfor _ in range(n):\r\n composite, components = input().split(': ')\r\n for unit in components.split(', '):\r\n x, y = unit.split()\r\n recipes[composite][x] += int(y)\r\nfor _ in range(q):\r\n player, artifact = input().split()\r\n p = int(player)\r\n accounts[p][artifact] += 1\r\n for composite, recipe in recipes.items():\r\n if all(num <= accounts[p][a] for a, num in recipe.items()):\r\n for basic, num in recipe.items():\r\n accounts[p][basic] -= num\r\n accounts[p][composite] += 1\r\n break\r\nfor player in range(1, k+1):\r\n artifacts = sorted((+accounts[player]).keys())\r\n print(len(artifacts))\r\n for artifact in artifacts:\r\n num = accounts[player][artifact]\r\n print(artifact, num)" ]

[ "n, d = map(int, input().split())\r\nli = list(map(int, input().split()))\r\nc = 2\r\nfor i in range(1, n):\r\n if (li[i] - li[i-1]) == 2*d:\r\n c = c + 1\r\n if (li[i] - li[i-1]) > 2*d:\r\n c = c + 2\r\nprint(c)", "n,k = map(int, input().split())\r\nk *= 2\r\nl = input().split()\r\nsumi = 2\r\nfor x in range(len(l)-1):\r\n y = int(l[x+1])-int(l[x])\r\n if y == k:\r\n sumi += 1\r\n elif y > k:\r\n sumi += 2\r\nprint(sumi)\r\n", "n,d=map(int,input().split())\r\nm=list(map(int,input().split()))\r\nk,c = 0,2\r\nfor i in range(n-1):\r\n\tk = abs(m[i]-m[i+1])\r\n\tif k > 2*d:\r\n\t\tc+=2\r\n\tif k==2*d:\r\n\t\tc+=1\r\nprint(c)", "n,d=map(int,input().split())\r\na=list(map(int,input().split()))\r\nans=2\r\nfor i in range(n-1):\r\n z=a[i+1]-a[i]\r\n if z>2*d:\r\n ans+=2\r\n else:\r\n if z==2*d:\r\n ans+=1\r\nprint(ans)\r\n \r\n", "n, d = map(int, input().split())\r\nhotels = list(map(int, input().split()))\r\n\r\ncount = 2 # initialize the count with 2, for the first and last possible positions\r\n\r\nfor i in range(1, n):\r\n if hotels[i] - hotels[i-1] == 2 * d: # if the distance between the i-th and (i-1)-th hotels is 2d\r\n count += 1 # add a new possible position\r\n elif hotels[i] - hotels[i-1] > 2 * d: # if the distance between the i-th and (i-1)-th hotels is greater than 2d\r\n count += 2 # add two new possible positions\r\n\r\nprint(count)\r\n", "n, d = map(int, input().split())\r\na = [int(x) for x in input().split()]\r\n\r\ntest = set()\r\nfor x in a:\r\n\tfi = x + d\r\n\tse = x - d\r\n\tif min(abs(coord - fi) for coord in a) == d:\r\n\t\ttest.add(fi)\r\n\tif min(abs(coord - se) for coord in a) == d:\r\n\t\ttest.add(se)\r\nprint(len(test))", "n,d=map(int,input().split())\r\nlist=[int(i) for i in input().split()]\r\noutput=1\r\nif(n==1):\r\n print(\"2\")\r\n exit()\r\nif((list[0]+d)<=(list[1]-d)):\r\n output+=1\r\nfor i in range(1,n-1):\r\n if((list[i]+d)<=(list[i+1]-d)):\r\n output+=1\r\n if((list[i]-d)>(list[i-1]+d)):\r\n output+=1 \r\nif((list[n-1]-d)>(list[n-2]+d)):\r\n output+=1 \r\noutput+=1\r\nprint(output)", "x, y = map(int, input().split())\r\na = list(map(int, input().split()))\r\nans = 2\r\nfor i in range(x-1):\r\n if a[i] + y <= a[i+1] - y:\r\n ans += 1\r\n if a[i+1] - y > a[i] + y:\r\n ans += 1\r\nprint(ans)", "n,d=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nk=set()\r\nfor i in range(n):\r\n if i==0:\r\n k.add(l[i]-d)\r\n first=l[i]+d\r\n try:\r\n if l[i+1]-d>=first:\r\n k.add(l[i]+d)\r\n continue\r\n except:\r\n k.add(l[i]+d)\r\n continue\r\n if i==(n-1):\r\n k.add(l[i]+d)\r\n first=l[i]-d\r\n if l[i-1]+d<=first:\r\n k.add(l[i]-d)\r\n continue\r\n first=l[i]-d\r\n if l[i-1]+d<=first:\r\n k.add(l[i]-d)\r\n second=l[i]+d\r\n if l[i+1]-d>=second:\r\n k.add(l[i]+d)\r\nprint (len(k))\r\n\r\n", "# \r\nimport 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\nimport math\r\nimport sys\r\ndef getIntList():\r\n return list(map(int, input().split())) \r\n\r\nimport bisect \r\ntry :\r\n import numpy\r\n dprint = print\r\n dprint('debug mode')\r\nexcept ModuleNotFoundError:\r\n def dprint(*args, **kwargs):\r\n pass\r\ndef makePair(z):\r\n return [(z[i], z[i+1]) for i in range(0,len(z),2) ]\r\ndef memo(func): \r\n cache={} \r\n def wrap(*args): \r\n if args not in cache: \r\n cache[args]=func(*args) \r\n return cache[args] \r\n return wrap\r\n\r\n@memo\r\ndef comb (n,k):\r\n if k==0: return 1\r\n if n==k: return 1\r\n return comb(n-1,k-1) + comb(n-1,k)\r\n\r\nn,d = getIntList()\r\n\r\nzx = getIntList()\r\n\r\nres = set()\r\n\r\nfor x in zx:\r\n res.add(x-d)\r\n res.add(x+d)\r\n\r\ntot = 0\r\nfor x in res:\r\n flag = True\r\n for y in zx:\r\n if abs(x-y)<d:\r\n flag = False\r\n if flag:tot+=1\r\nprint(tot)\r\n", "n,m=map(int,input().split())\r\na=[int(y) for y in input().split()]\r\nd=2\r\nfor i in range (1,n):\r\n x=a[i]-a[i-1]\r\n if x==2*m:\r\n d+=1\r\n if x>2*m:\r\n d+=2\r\nprint(d)", "import math\r\n\r\n\r\ndef main_function():\r\n n, d = [int(i) for i in input().split(\" \")]\r\n cities = [int(i) for i in input().split(\" \")]\r\n count = 2\r\n current_city = cities[0]\r\n for i in cities:\r\n if (i - current_city) - 2 * d == 0:\r\n count += 1\r\n elif (i - current_city) - 2 * d > 0:\r\n count += 2\r\n current_city = i\r\n return count\r\n\r\n\r\n\r\n\r\n\r\n\r\nprint(main_function())", "m,n=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\na=2\r\nfor i in range(1,m):\r\n\tif (l[i]-l[i-1])>2*n:\r\n\t\ta+=2\r\n\telif (l[i]-l[i-1])==2*n:\r\n\t\ta+=1\t\r\nprint(a)", "import os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\nfrom collections import Counter, defaultdict\r\nfrom sys import stdin, stdout\r\nimport io\r\nimport math\r\nimport heapq\r\ndef gcd(x, y):\r\n while (y):\r\n x, y = y, x % y\r\n return x\r\nimport bisect\r\nimport collections\r\ndef ceil(a, b):\r\n return (a + b - 1) // b\r\ninf = float('inf')\r\ndef get():\r\n return stdin.readline().rstrip()\r\ndef lcm(a, b):\r\n return (a * b) // math.gcd(a, b)\r\nmod = 10 ** 5 + 7\r\n# for _ in range(int(get())):\r\n# n=int(get())\r\n# l=list(map(int,get().split()))\r\n# = map(int,get().split())\r\n#####################################################################\r\nn,m= map(int,get().split())\r\nl=list(map(int,get().split()))\r\nl.sort()\r\nans=0\r\n# print(l)\r\nfor i in range(n-1):\r\n if l[i]+m==l[i+1]-(m):\r\n ans+=1\r\n if l[i]+m<l[i+1]-m:\r\n ans+=2\r\n # print(l[i]+m,l[i+1]-m,ans)\r\nprint(ans+2)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n, d = map(int, input().split())\ndata = list(map(int, input().split()))\n\npos = set([x - d for x in data] + [x + d for x in data])\n\nisValid = lambda x: min(abs(x-p) for p in data) == d\nans = len(list(filter(isValid, list(pos))))\n\nprint (ans)\n\n", "n, k = map(int, input().split())\nl = list(map(int, input().split()))\ns = set()\n\nfor i in range(0, n):\n x = l[i] - k\n y = l[i] + k\n\n if i <n-1:\n if y <= (l[i+1] -k):\n s.add(y)\n \n if i >0:\n if x >= (l[i-1] +k):\n s.add(x)\n\nprint(len(s)+2)\n", "n,d = map(int,input().split())\r\na=list(map(int,input().split()))\r\nr,c = 0,2\r\nfor i in range(n-1):\r\n\tr = abs(a[i]-a[i+1])\r\n\tif r > 2*d:\r\n\t\tc+=2\r\n\tif r==2*d:\r\n\t\tc+=1\r\nprint(c)", "n,d = map(int,input().split())\r\na = (list(map(int,input().split())))\r\na.append(10000000000)\r\na.insert(0,-10000000000)\r\nans = 0\r\nfor i in range(1,len(a)):\r\n l = a[i] - a[i - 1]\r\n if(l > 2 * d):\r\n ans = ans + 2\r\n elif (l == 2 * d):\r\n ans = ans + 1\r\nprint(ans - 2)\r\n", "n, k = map(int, input().split(\" \"))\r\npositions = [int(i) for i in input().split(\" \")]\r\n\r\npossible = 2\r\nfor i in range(n - 1):\r\n if positions[i + 1] - positions[i] == k * 2:\r\n possible += 1\r\n elif positions[i + 1] - positions[i] > k * 2:\r\n possible += 2\r\n\r\nprint(possible)", "def scanf(t=int):\r\n return list(map(t, input().split()))\r\nimport math\r\nn, d = scanf()\r\nm = scanf()\r\nans = sum([ 2 - (m[i] - m[i-1] == 2 * d) for i in range(1, n) \r\n if m[i] - m[i-1] >= 2 * d])\r\nprint(ans + 2)", "n,d=map(int,input().split())\r\ncities=list(map(int,input().split()))\r\nans=2\r\nfor i in range(n-1):\r\n if cities[i]+d<cities[i+1]-d:\r\n ans+=2\r\n elif cities[i]+d==cities[i+1]-d:\r\n ans+=1\r\nprint(ans)", "R=lambda:map(int,input().split())\r\nn,d=R()\r\nh=2\r\na=R()\r\np=next(a)\r\nfor x in a:\r\n h+=(x-p>=d*2)+(x-p>d*2);p=x\r\nprint(h)", "n,d = map(int,input().split())\r\nhotels = list(map(int,input().split()))\r\ncount = 2\r\nfor i in range(n - 1):\r\n dis = hotels[i + 1] - hotels[i]\r\n if dis > d * 2:count+=2\r\n elif dis == d * 2:count+=1\r\nprint(count)", "n = [*map(int, input().split())]\r\nx = [*map(int, input().split())]\r\n\r\nsux = 0\r\nbux = 0\r\ns = []\r\nfor i in range(len(x)):\r\n sux = x[i] + n[1]\r\n if i == len(x)-1:\r\n if sux not in s:\r\n s.append(sux)\r\n elif x[i+1] - sux < n[1]:\r\n continue\r\n else:\r\n if sux not in s:\r\n s.append(sux)\r\n\r\nfor i in range(len(x)):\r\n bux = x[i] - n[1]\r\n if i == 0:\r\n if bux not in s:\r\n s.append(sux)\r\n elif bux - x[i-1] < n[1]:\r\n continue\r\n else:\r\n if bux not in s:\r\n s.append(sux)\r\n\r\nprint(len(s))", "n, d = map(int, input().split(' '))\r\narr = input().split(' ')\r\nfor i in range(n):\r\n arr[i]=int(arr[i])+1\r\narr.sort()\r\ncount=2\r\nfor i in range(n):\r\n if (arr[i]-arr[i-1]<2*d):\r\n continue\r\n if (arr[i]-arr[i-1]==2*d):\r\n count+=1\r\n continue\r\n count+=2\r\nprint(count)\r\n", "n, d = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\nans = 2\r\nfor i in range(1, n):\r\n dif = abs(arr[i] - arr[i-1])\r\n if dif % d ==0 and dif //d == 2:\r\n ans += 1\r\n elif dif //d >= 2:\r\n ans +=2\r\n\r\nprint(ans)\r\n\r\n", "# cook your dish here\r\nn, d = map(int, input().split())\r\nx = list(map(int, input().split()))\r\nres = 2\r\nfor i in range(n-1):\r\n if x[i+1]-x[i]==2*d:\r\n res+=1\r\n if x[i+1]-x[i]>2*d:\r\n res+=2\r\nprint(res)", "R=lambda:map(int,input().split())\r\nn,d=R()\r\nr=2\r\na=R()\r\np=next(a)\r\nfor x in a:\r\n r+=(x-p>=d*2)+(x-p>d*2);p=x\r\nprint(r)", "n, d = map(int, input().split())\na = list(map(int, input().split()))\nb = set(map(d.__rsub__, a))\nb.update(map(d.__add__, a))\n\nc = set(filter(lambda x: min(map(lambda y: abs(x - y), a)) == d, b))\nprint(len(c))\n", "n, d = (int(x) for x in input().split())\r\nx = [int(x) for x in input().split()]\r\n\r\nr = 2\r\nfor i in range(1, len(x)):\r\n if x[i] - x[i - 1] > 2 * d:\r\n r += 2\r\n elif x[i] - x[i - 1] == 2 * d:\r\n r += 1\r\n\r\nprint(r)\r\n", "n,q=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nct=0\r\narr.sort()\r\nfor i in range(1,n):\r\n\tdif=arr[i]-arr[i-1]\r\n\tif (dif)/q==2:\r\n\t\tct+=1\r\n\telif dif/q>2:\r\n\t\tct+=2\r\n\t#print(dif,ct)\r\nprint(ct+2)\r\n\r\n\r\n\r\n\r\n", "n, d = [int(i) for i in input().split()]\r\nlist1 = [int(i) for i in input().split()]\r\ntotal = []\r\ncount = 2\r\nfor i in range(n-1):\r\n #print(count, i, list1[i])\r\n if list1[i+1] - list1[i] == 2*d:\r\n count+=1\r\n elif list1[i + 1] - list1[i] > 2*d:\r\n count+=2\r\n\r\nprint(count)", "n,d = map(int,input().split())\r\nl=list(map(int,input().split()))\r\nk,c = 0,2\r\nfor i in range(n-1):\r\n\tk = abs(l[i]-l[i+1])\r\n\tif k > 2*d:\r\n\t\tc+=2\r\n\tif k==2*d:\r\n\t\tc+=1\r\nprint(c)", "s = input().split()\r\nn, d = int(s[0]), int(s[1])\r\nl = list(map(int, input().split()))\r\nls = set()\r\nif n >= 2:\r\n ls.add(l[0]-d)\r\n if l[0]+d <= l[1]-d:\r\n ls.add(l[0]+d)\r\n for i in range(1, n-1):\r\n if l[i]-d >= l[i-1]+d:\r\n ls.add(l[i]-d)\r\n if l[i]+d <= l[i+1]-d:\r\n ls.add(l[i]+d)\r\n if l[n-1]-d >= l[n-2]+d:\r\n ls.add(l[n-1]-d)\r\n ls.add(l[n-1]+d)\r\nelse:\r\n ls.add(l[0]-d)\r\n ls.add(l[0]+d)\r\nprint(len(ls))\r\n\r\n", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl2=[]\r\nl=sorted(l)\r\nc=2\r\nfor i in range(len(l)-1):\r\n if(l[i+1]-l[i]==2*k):\r\n c+=1\r\n elif(l[i+1]-l[i]>2*k):\r\n c+=2\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\r\n\r\n\r\n", "n,d = map(int,input().split())\r\nl = list(map(int,input().split()))\r\ncount = 2\r\nfor i in range(1,n):\r\n if abs(l[i-1]-l[i]) > 2*d:\r\n count += 2\r\n elif abs(l[i]-l[i-1]) == 2*d:\r\n count+= 1\r\n else:\r\n pass\r\nprint(count)\r\n \r\n ", "n,d = map(int,input().split())\r\nli = list(map(int,input().split()))\r\nans = 0\r\nfor i in range(n):\r\n r = li[i]\r\n if(i!=0):\r\n if r-d > l+d:\r\n ans+=2\r\n l = r\r\n elif r-d == l+d:\r\n ans+=1\r\n l=r\r\n l=r\r\nprint(ans+2)", "def forbiddenrange(range, x):\n\n for a, b in range:\n if x > a and x < b:\n return False\n return True\n\n\nline1 = input()\n\nline2 = input()\n\nn,d=[int(x) for x in line1.split(' ')]\ncities=[int(x) for x in line2.split(' ')]\n\nrange=[(x-d,x+d) for x in cities]\nx = 0\nnewcities={}\nfor a in cities:\n if forbiddenrange(range,a+d):\n if not a+d in newcities:\n newcities[a+d]=True\n x+=1\n if forbiddenrange(range,a-d):\n if not a-d in newcities:\n newcities[a-d]=True\n x+=1\n\nprint(x)\n\n", "n, d = map(int, input().split())\r\n*x, = map(int, input().split())\r\nans = 2\r\nd *= 2\r\nfor i in range(n - 1):\r\n a = x[i + 1] - x[i]\r\n if a > d:\r\n ans += 2\r\n else:\r\n ans += a == d\r\nprint(ans)\r\n", "def solve():\r\n n,d=map(int,input().split());a=list(map(int,input().split()));c=2;d*=2\r\n for i in range(n-1):c+=min(2,(max(0,abs(a[i]-a[i+1])-d+1)))\r\n print(c)\r\nsolve()", "n,d=map(int,input().split())\r\na=list(map(int,input().split()))\r\nc=0\r\nfor i in range(n):\r\n\tif a[i]-a[i-1]>2*d:\r\n\t\tc+=2\r\n\telif a[i]-a[i-1]==2*d:\r\n\t\tc+=1\r\nprint(2+c)", "class CodeforcesTask1004ASolution:\n def __init__(self):\n self.result = ''\n self.n_d = []\n self.locations = []\n\n def read_input(self):\n self.n_d = [int(x) for x in input().split(\" \")]\n self.locations = [int(x) for x in input().split(\" \")]\n\n def process_task(self):\n positions = 2\n locked = []\n for x in range(self.n_d[0] - 1):\n locked.append(self.locations[x + 1] - self.locations[x])\n unlocked = [x for x in locked if x >= self.n_d[1] * 2]\n positions += sum([1 if x == self.n_d[1] * 2 else 2 for x in unlocked])\n self.result = str(positions)\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask1004ASolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "n, m = [int(el) for el in input().split()]\r\ncol = 2\r\na = [int(el) for el in input().split()]\r\nfor i in range(n - 1):\r\n if a[i + 1] - a[i] == m * 2:\r\n col += 1\r\n if a[i+1] - a[i] > m*2:\r\n col += 2\r\nprint(col)\r\n", "rd = lambda: list(map(int, input().split()))\nn, d = rd()\na = rd()\nr = 2\nfor x, y in zip(a, a[1:]):\n p = y - x - 2 * d\n if p >= 0:\n r += 1 + (p > 0)\nprint(r)\n", "n, d = list(map(int, input().split()))\r\nlst = list(map(int, input().split()))\r\n\r\ncnt = 2\r\nfor i in range(len(lst)-1):\r\n if lst[i+1] - lst[i] > 2*d:\r\n cnt+=2\r\n elif lst[i+1] - lst[i] == 2*d:\r\n cnt+=1\r\nprint(cnt)", "n,d=map(int,input().split())\r\na=[int(_) for _ in input().split()]\r\nc=2\r\nfor i in range(n-1):\r\n if (a[i+1]-a[i])/d>2:\r\n c+=2\r\n elif (a[i+1]-a[i])/d==2:\r\n c+=1\r\nprint(c)", "if __name__ == '__main__':\r\n first_line = input().split()\r\n n = int(first_line[0])\r\n d = int(first_line[1])\r\n coordinates = []\r\n for char in input().split():\r\n coordinates.append(int(char))\r\n number = 2\r\n for i in range(0, n - 1):\r\n if coordinates[i] + 2 * d == coordinates[i + 1]:\r\n number += 1\r\n elif coordinates[i] + 2 * d < coordinates[i + 1]:\r\n number += 2\r\n print(number)", "n, d = input().split(\" \")\r\nn = int(n)\r\nd = int(d)\r\nx = input().split(\" \")\r\nfor i in range(n):\r\n x[i] = int(x[i])\r\ncounter = 2\r\nfor i in range(n - 1):\r\n start = x[i]\r\n end = x[i + 1]\r\n if end - start < 2 * d:\r\n counter += 0\r\n elif end - start == 2 * d:\r\n counter += 1\r\n else:\r\n counter += 2\r\nprint(counter)", "n,d = map(int, input().split())\r\nm = list(map(int, input().split()))\r\nq = 2*n\r\nfor i in range(n - 1):\r\n if(not(m[i+1] - m[i] > 2*d)):\r\n q-=2\r\n if(m[i+1] - m[i] == 2*d):\r\n q+=1\r\nprint(q)\r\n", "#n, k = map(int, input().split(\" \")) # read multiple integers into different variables\r\n#L = [int(x) for x in input().split()] # read multiple integers into a list\r\n#print(' '.join(map(str, L))) # print multiple integers in one line\r\n\r\nn, d = map(int, input().split(\" \")) # read multiple integers into different variables\r\nL = [int(x) for x in input().split()] # read multiple integers into a list\r\nr = set([x + d for x in L]) | set([x - d for x in L])\r\nans = []\r\nfor x in r :\r\n if (min(abs(x - y) for y in L) == d) : ans.append(x)\r\n\r\nprint(len(ans))\r\n\r\n\r\n \r\n\r\n\r\n", "# ANSHUL GAUTAM\n# 2017024\n\nn,d = map(int, input().split())\nl = list(map(int, input().split()))\n\nif(n == 1):\n\tprint(2)\nelse:\n\tans = 2\n\tfor i in range(n-1):\n\t\tdiff = l[i+1] - l[i]\n\t\tif(diff > 2*d):\n\t\t\tans += 2\n\t\telif(diff == 2*d):\n\t\t\tans += 1\n\tprint(ans)\n\n\n\n", "n,d = map(int,input().split())\r\nyes = list(map(int,input().split()))\r\nctr = 2\r\nfor i in range(n-1):\r\n if abs(yes[i+1]-yes[i]) == d*2:\r\n ctr+=1 \r\n if abs(yes[i+1]-yes[i]) > d*2:\r\n ctr+=2\r\nprint(ctr) ", "n , d = map(int,input().split())\r\nl = []\r\nl = sorted(list(map(int,input().split())))\r\nc = 2\r\nfor _ in range(1,len(l)):\r\n if l[_] - l[_ - 1] >= 2*d:\r\n c = c + 1 + (l[_] - l[_ - 1] > 2*d)\r\n \r\n \r\n \r\nprint(c)", "inp = input()\r\nn,k = inp.split(\" \")\r\nn,k = int(n),int(k)\r\na = input()\r\na = [int(i) for i in a.split()]\r\ncount=2\r\nfor i in range(n-1):\r\n\tif a[i]+k<a[i+1]-k:\r\n\t\tcount+=2\r\n\telif a[i]+k==a[i+1]-k:\r\n\t\tcount+=1\r\nprint(count)", "n,d=[int(x) for x in input().split()]\r\na=[int(x) for x in input().split()]\r\nif n==1:\r\n print(2)\r\nelif n==2:\r\n if a[1]-a[0]<2*d:\r\n print(2)\r\n elif a[1]-a[0]==2*d:\r\n print(3)\r\n else:\r\n print(4)\r\nelse:\r\n res=2\r\n for i in range(1,n):\r\n if a[i]-a[i-1]==2*d:\r\n res+=1 \r\n elif a[i]-a[i-1]>2*d:\r\n res+=2 \r\n print(res)", "n,k = input().split()\r\nn=int(n)\r\nk=int(k)\r\nlis=list(map(int,input().split()))\r\nplaces=[]\r\nans=0\r\nfor i in range(0,n):\r\n if(i!=0):\r\n if(lis[i-1]<=lis[i]-2*k):\r\n if (lis[i]-k) not in places:\r\n ans+=1\r\n places.append(lis[i]-k)\r\n else:\r\n ans+=1\r\n if(i!=n-1):\r\n if(lis[i+1]>=lis[i]+2*k):\r\n if(lis[i]+k) not in places:\r\n ans+=1\r\n places.append(lis[i]+k)\r\n else:\r\n ans+=1\r\nprint(ans)\r\n#print(places)", "#import math\r\n#import itertools\r\n#from collections import defaultdict, Counter, deque\r\n\r\ndef f(arr, n, d):\r\n \r\n existing = set(arr)\r\n cnt = 0\r\n for i,c in enumerate(arr):\r\n city1 = c - d\r\n if city1 not in existing:\r\n if i == 0 or (i > 0 and abs(arr[i-1] - city1) >= d):\r\n existing.add(city1)\r\n cnt += 1\r\n city2 = c + d\r\n if city2 not in existing:\r\n if (i == n-1) or (i < n - 1 and abs(city2 - arr[i+1]) >= d):\r\n existing.add(city2)\r\n cnt += 1 \r\n return cnt\r\n \r\nn, d = [int(i) for i in input().split()]\r\narr = [int(i) for i in input().split()]\r\nprint(f(arr, n, d))", "n, d = (int(x) for x in input().split())\nhotels = sorted([int(x) for x in input().split()])\n\nhotels = [-(10 ** 10)] + hotels + [10 ** 10]\ncities = set()\n\nfor hotel_idx in range(1, n + 1):\n if hotels[hotel_idx] - hotels[hotel_idx - 1] >= 2 * d:\n cities.add(hotels[hotel_idx] - d)\n if hotels[hotel_idx + 1] - hotels[hotel_idx] >= 2 * d:\n cities.add(hotels[hotel_idx] + d)\n\nprint(len(cities))\n", "n, d = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nans = 2\r\nfor i in range(n - 1):\r\n if l[i + 1] - l[i] > 2 * d:\r\n ans += 2\r\n elif l[i + 1] - l[i] == 2 * d: \r\n ans += 1\r\nprint(ans)", "l1=list(map(int,input().split()))\r\nn=l1[0]\r\nd=l1[1]\r\nl=list(map(int,input().split()))\r\ncount=2\r\nfor i in range(n-1):\r\n if(l[i+1]-l[i]==(2*d)):\r\n count+=1\r\n elif(l[i+1]-l[i]>2*d):\r\n count+=2\r\nprint(count)\r\n", "n,d=[int(x) for x in input().split(\" \")]\r\na=[int(x) for x in input().split(\" \")]\r\npos=2\r\nfor i in range(n-1):\r\n l=a[i]+d\r\n r=a[i+1]-d\r\n if l==r:\r\n pos+=1\r\n elif l<r:\r\n pos+=2\r\nprint(pos)\r\n", "[n, d] = [int(x) for x in input().split()]\r\nA = [int(x) for x in input().split()]\r\nc = 2\r\nfor i in range(len(A) - 1):\r\n temp = A[i+1] - A[i]\r\n if temp == 2*d:\r\n c += 1\r\n elif temp > 2*d:\r\n c += 2\r\nprint(c)", "from sys import stdin\r\nfrom collections import defaultdict\r\n\r\n\r\nn, d = [int(x) for x in input().split()]\r\nc = [int(x) for x in input().split()]\r\n\r\nres = set()\r\nfor i in range(n):\r\n l = c[i] - d\r\n r = c[i] + d\r\n if i == 0 or abs(c[i-1] - l) >= d:\r\n res.add(l)\r\n if i == n - 1 or abs(c[i+1] - r) >= d:\r\n res.add(r)\r\n\r\nprint(len(res))", "# cook your dish here\nn,d=input().split()\nn=int(n)\nd=int(d)\na=[int(n) for n in input().split()]\no=[]\nr=0\nfor i in range(len(a)-1):\n o.append(a[i+1]-a[i])\n \nfor j in range(len(o)):\n if o[j]>(2*d):\n r+=2\n elif o[j]==(2*d):\n r+=1\n \nprint(r+2)", "n, d = [int(i) for i in input().split()]\r\nx = sorted([int(i) for i in input().split()])\r\npossible = set([i-d for i in x]+[i+d for i in x])\r\ntotal = 0\r\nfor i in possible:\r\n if min([abs(i-j) for j in x]) == d:\r\n total += 1\r\n\r\nprint(f\"{total}\\n\")", "n,d=list(map(int,input().split()))\r\nx=list(map(int,input().split()))\r\ncounter=2\r\nfor k in range(n):\r\n if k==0:\r\n continue\r\n cont=abs(-(x[k]) + x[k - 1]) // d\r\n if abs(-(x[k]) + x[k - 1])==d*2:\r\n counter+=1\r\n elif abs(-(x[k]) + x[k - 1])>d*2:\r\n counter+=2\r\n else:\r\n continue\r\nprint(counter)", "# import sys\r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"out.out\",'w')\t\r\nn,d=map(int,input().split())\r\nx=list(map(int,input().split()))\r\na=2\r\nfor i in range(1,n):\r\n\tif x[i]-x[i-1]>2*d:\r\n\t\ta+=2\r\n\telif x[i]-x[i-1]==2*d:\r\n\t\ta+=1\r\nprint(a)\r\n", "n, d = map(int, input().split())\r\na = list(map(int, input().split()))\r\nc = 2 \r\nfor i in range(1, n):\r\n if(a[i] - d == a[i - 1] + d):\r\n c += 1 \r\n elif(a[i] - d > a[i - 1] + d):\r\n c += 2\r\n \r\nprint(c)", "n,d=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=set()\r\nfor i in range(n):\r\n\tif i!=n-1:\r\n\t\ta=l[i]+d\r\n\t\tif d<=abs(l[i+1]-a):\r\n\t\t\ts.add(a)\t\r\n\t\t# print(a,d<=abs(l[i+1]-a))\r\n\tif i!=0:\r\n\t\ta=l[i]-d\r\n\t\tif d<=abs(l[i-1]-a):\r\n\t\t\ts.add(a)\r\n\t\t# print(a,d<=abs(l[i-1]-a))\r\nprint(len(s)+2)", "R=lambda:map(int,input().split())\r\nn,d=R()\r\na=[*R()]\r\nprint(2+sum((y-x>=d*2)+(y-x>d*2)for x,y in zip(a,a[1:])))", "n, d = map(int, input().split())\r\nx = list(sorted(map(int, input().split())))\r\n\r\npositions = set()\r\n\r\nfor i in range(len(x)):\r\n if i == 0 or x[i] - d >= x[i - 1] + d:\r\n positions.add(x[i] - d)\r\n if i == n - 1 or x[i] + d <= x[i + 1] - d:\r\n positions.add(x[i] + d)\r\n\r\nprint(len(positions))\r\n", "n,d=map(int,input().split())\r\narr=sorted(list(map(int,input().split())))\r\ncount=0\r\nfor i in range(n-1):\r\n if arr[i]+d==arr[i+1]-d:\r\n count+=1\r\n elif arr[i]+d<arr[i+1]-d:\r\n count+=2\r\ncount+=2\r\nprint(count)", "n,d = map(int,input().split())\r\nn1 = list(map(int,input().split()))\r\nk,c = 0,2\r\nfor i in range(n-1):\r\n\tk = abs(n1[i]-n1[i+1])\r\n\tif k > 2*d:\r\n\t\tc+=2\r\n\tif k==2*d:\r\n\t\tc+=1\r\nprint(c)", "n,d = map(int,input().split())\nl=[*map(int,input().split())]\nans=2\ntmp={}\nfor i in range(n):\n # right\n if i+1 !=n and l[i+1]-(l[i]+d) >=d and tmp.get(l[i]+d,-1)==-1:\n ans+=1\n tmp[l[i]+d]=1\n # left\n if i-1!=-1 and l[i]-d-l[i-1] >=d and tmp.get(l[i]-d,-1)==-1:\n ans+=1\n tmp[l[i]-d]=1\nprint(ans)", "n,d=map(int,input().split())\r\nc=list(map(int,input().split()))\r\ncpt=0\r\nfor k in range(1,n):\r\n r=c[k]-c[k-1]\r\n if(r-2*d==0):cpt+=1\r\n elif(r-2*d>0):cpt+=2\r\nprint(cpt+2)\r\n ", "import sys\r\nimport math\r\n\r\nn,d=map(int,input().split())\r\nif(d%2==0):\r\n a=2*d\r\n b=2*d+1\r\nelse:\r\n a=2*d\r\n b=2*d-1\r\nlista=[int(x) for x in input().strip().split()]\r\ndista=[0 for i in range(n-1)]\r\ncnt=2\r\nfor i in range(1,n):\r\n dista[i-1]=lista[i]-lista[i-1]\r\n if(dista[i-1]>=2*d+1):\r\n cnt+=2\r\n elif(dista[i-1]==2*d):\r\n cnt+=1\r\n#print(dista)\r\nprint(cnt)", "n, d = map(int, input().split())\narr = list(map(int, input().split()))\ns = set()\nans = 2\nfor i in range(1, n):\n\tif arr[i]-arr[i-1]>2*d:\n\t\tans += 2\n\telif arr[i]-arr[i-1] == 2*d:\n\t\tans += 1\nprint(ans)\n", "n, d = list(map(int, input().split()))\r\nX = list(map(int, input().split()))\r\nans = []\r\nfor i in range(n):\r\n if i == 0:\r\n ans.append(X[i] - d)\r\n elif ans[-1] > X[i] - d:\r\n ans.pop()\r\n elif X[i] - d > X[i - 1] + d:\r\n ans.append(X[i] + d)\r\n ans.append(X[i] + d)\r\nprint(len(ans))", "a,b=input().split()\r\na=int(a)\r\nb=int(b)\r\n\r\nc=input().split()\r\nc=list(map(int,c))\r\n\r\nd={}\r\n\r\nd[c[0]-b]=0\r\nk=[]\r\n\r\nfor i in range(a-1):\r\n if(c[i+1]-(c[i]+b) >=b ):\r\n d[c[i]+b]=0\r\n if(c[i+1] -b -c[i]>=b):\r\n d[c[i+1]-b]=0\r\nd[c[a-1]]=0\r\nprint(len(d.keys()))\r\n \r\n \r\n \r\n \r\n", "arr = list(input().split(' '))\r\nn, d = int(arr[0]), int(arr[1])\r\narr = list(input().split(' '))\r\narr = list(int(x) for x in arr)\r\nplus = [-d, d]\r\nres = set()\r\nfor i in range(len(arr)):\r\n for adder in plus:\r\n cur = arr[i] + adder\r\n flag = True\r\n for j in range(len(arr)):\r\n if i == j:\r\n continue\r\n if cur == arr[j]:\r\n flag = False\r\n new_flag = True\r\n for j in range(len(arr)):\r\n if i == j:\r\n continue\r\n if abs(arr[j] - cur) < d:\r\n new_flag = False\r\n if flag and new_flag and cur not in res:\r\n res.add(cur)\r\nprint(len(res))\r\n#print(res)\r\n \r\n \r\n", "n, d = map(int, input().split())\r\nx = list(map(int, input().split()))\r\nans = 2\r\nfor i in range(n - 1):\r\n if x[i + 1] - x[i] > 2 * d: ans += 2\r\n elif x[i + 1] - x[i] == 2 * d: ans += 1\r\nprint(ans)", "x,y = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nans = 0\r\nfor i in range(0,x-1):\r\n d = l[i+1] - l[i] - 1\r\n e = 2*(y-1)\r\n if d > e:\r\n if d-e > 2:\r\n ans = ans + 2\r\n else:\r\n ans = ans + (d-e)\r\nprint(ans+2)", "n, d = map(int, input().split())\r\nx = list(map(int, input().split()))\r\nans = 2\r\nfor i in range(n - 1):\r\n if (x[i + 1] - x[i]) / d > 2:\r\n ans += 2\r\n elif (x[i + 1] - x[i]) / d == 2:\r\n ans += 1\r\nprint(ans)\r\n", "def go():\n n, d = [int(i) for i in input().split(' ')]\n a = [int(i) for i in input().split(' ')]\n if n == 1:\n return 2\n total = 2\n for i in range(0, n - 1):\n if a[i] + d == a[i + 1] - d:\n total += 1\n elif a[i] + d < a[i + 1] - d:\n total += 2\n return total\n\nprint(go())\n", "n, d = map(int, input().split())\nxis = list(map(int, input().split()))\nans = 2\nfor i in range(n):\n\tif i < n-1 and xis[i] + d <= xis[i+1] - d:\n\t\tans += 1\n\tif i > 0 and xis[i] - d > xis[i-1] + d:\n\t\tans += 1\nprint(ans)\n\n", "n, d = map(int, input().split())\r\nx = sorted([*map(int, input().split())])\r\ns = {None, *x}\r\nr = 0\r\n\r\nfor i in x:\r\n for j in ((i + d) if min(map(lambda y: abs(y - (i + d)), x)) == d else None, (i - d) if min(map(lambda y: abs(y - (i - d)), x)) == d else None):\r\n if j not in s:\r\n s.add(j)\r\n r += 1\r\n \r\n\r\nprint(r)\r\n", "n, d=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ncounter=2\r\nfor i in range(len(l)):\r\n try:\r\n t0=l[i]+d\r\n t1=l[i+1]-d\r\n if l[i+1]-t0>=d:\r\n counter+=1\r\n if t1-l[i]>=d and t0!=t1:\r\n counter+=1\r\n except:\r\n pass\r\nprint(counter)\r\n \r\n\r\n", "# cook your dish here\r\nN,d=[int(x) for x in input().split()]\r\na=[int(x) for x in input().split()]\r\nans=2\r\nfor i in range(len(a)-1):\r\n if(abs(a[i+1]-a[i])==2*d):\r\n ans+=1\r\n elif(abs(a[i+1]-a[i])>2*d):\r\n ans+=2\r\nprint(ans)", "\ndef near(w, x):\n t = x[0]\n for i in range(len(x)):\n if abs(w - x[i]) < abs(w -t):\n t = x[i]\n return t\ndef find(w,x):\n if w < x[0]:\n return 0\n n = len(x) - 1\n if w > x[n]:\n return n\n for i in range(len(x)):\n if x[i] <= w < x[i+1]:\n return i+1 \n\nst = input()\nn = int(st.split()[0])\nd = int(st.split()[1])\nst = input()\ns = 2\nx = []\nfor i in range(n):\n x.append(int(st.split()[i]))\nk = x[0]+d\nfor i in range(len(x)-1):\n if (x[i+1]-x[i]) > 2*d:\n s+=2\n if (x[i+1]-x[i]) == 2*d:\n s+=1\n\n \nprint(s)\n", "\ndef main():\n [n,d] = list(map(int, input().split(\" \")))\n x = list(map(int, input().split(\" \")))\n answer = 0\n for i in range(n-1):\n if (x[i] + d < x[i+1] - d):\n answer += 2\n if (x[i]+d == x[i+1] -d ):\n answer += 1\n print(answer+2)\n\nmain()\n\n", "n,d=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ncount=0\r\nfor ele in range(len(l)-1):\r\n if (l[ele+1]-l[ele])-2*d>0:\r\n count=count+2\r\n elif (l[ele+1]-l[ele])-2*d==0:\r\n count=count+1\r\nprint(count+2)", "# cook your dish here\r\nn,d = map(int,input().split()) \r\nl = list(map(int,input().split())) \r\ncount = 2\r\nfor i in range(0,n-1):\r\n difference = l[i+1] - l[i]\r\n difference = abs(difference)\r\n if( difference <= d ):\r\n count = count\r\n elif(difference < 2*d+1 and difference >=2*d):\r\n count += 1\r\n elif(difference >= 2*d+1):\r\n count += 2\r\nprint(count) ", "# @Chukamin \n\ndef main():\n n, d = map(int, input().split())\n data = list(map(int, input().split()))\n ans = 2\n for i in range(n - 1):\n if data[i + 1] - data[i] > 2 * d:\n ans += 2\n elif data[i + 1] - data[i] == 2 * d:\n ans += 1\n print(ans)\n \nif __name__ == '__main__':\n main()\n \t \t\t\t \t\t \t \t \t \t \t \t \t \t\t\t", "n,d=input().split()\r\nn,d=int(n),int(d)\r\narr=input().split()\r\nfor i in range(len(arr)):\r\n arr[i]=int(arr[i])\r\ncount=0\r\npoints=[]\r\nif len(arr)>=1:\r\n count=count+2\r\nfor i in range(1,len(arr)):\r\n if arr[i]-arr[i-1]>(d*2):\r\n count=count+2\r\n if arr[i]-arr[i-1]==d*2:\r\n count=count+1\r\n\r\nprint(count)", " \r\n'''\r\nn,k=input().split(); n,k=int(n),int(k)\r\nli1=list(map(int,input().split()))\r\nm=n-k\r\nlim=[]\r\nfor i in range(m+1):\r\n for j in range(k+i,n+1):\r\n li= li1[i:j]\r\n kikrmu= sum(li)/len(li)\r\n lim.append(kikrmu)\r\n \r\nans= max(lim)\r\nprint(ans)'''\r\n\r\n\r\n\r\nn,d=input().split()\r\nn,d= int(n),int(d)\r\nli1= list(map(int, input().split()))\r\n\r\nleg= len(li1); coun=2\r\nfor i in range(leg-1):\r\n a= (abs(li1[i]-li1[i+1])-1)-((d-1)*2)\r\n if a>0 and a<2: coun+=1\r\n elif a>0 and a>=2: coun+=2\r\n \r\nprint(coun)", "nd = list(map(int,input().split(\" \")))\r\nd = nd[1]\r\ny = list(map(int,input().split(\" \")))\r\ntt = 0\r\nif len(y)>1:\r\n for a in range(len(y)):\r\n m = y[a] - y[a-1] -2*d \r\n if m < 0:\r\n continue\r\n elif m == 0:\r\n tt +=1\r\n else:\r\n tt += 2\r\n#if y[0] - d >= -10**9:\r\n# tt+=1\r\n#if y[len(y)-1] +d <= 10**9:\r\n# tt+=1\r\n\r\nprint(tt+2)\r\n", "n,d=map(int,input().split())\r\nr=[*map(int,input().split())];t=2\r\nfor i in range(n-1):t+=(r[i+1]-r[i]>=2*d)+(r[i+1]-r[i]>2*d)\r\nprint(t)\r\n", "import bisect\nn, d = map(int, input().split())\na = [-(10 ** 10)] + list(map(int, input().split())) + [10 ** 10]\nb = list()\nans = 0\nfor i in range(1, n + 1):\n\tx = a[i]\n\tif ((x - d) not in a) and ((x - d) not in b) and (a[i - 1] <= x - 2 * d):\n\t\tb.append(x - d)\n\t\tans += 1\n\tif ((x + d) not in a) and ((x + d) not in b) and (a[i + 1] >= x + 2 * d):\n\t\tb.append(x + d)\n\t\tans += 1\nprint(ans)\n", "n, d = map(int, input().split())\r\narr = [int(i) for i in input().split()]\r\nans = 0\r\nfor i in range(1, n):\r\n\tif (arr[i] - arr[i - 1] == 2 * d):\r\n\t\tans += 1\r\n\tif (arr[i] - arr[i - 1] > 2 * d):\r\n\t\tans += 2\r\nprint(ans + 2)", "\r\nn, d = map(int, input().split())\r\nx = list(map(int, input().split()))\r\ncounter = 2\r\nfor i in range(len(x) - 1):\r\n if x[i+1] - x[i] == d * 2:\r\n counter += 1\r\n elif x[i+1] - x[i] > d * 2:\r\n counter += 2\r\nprint(counter)\r\n\r\n# CodeForcesian\r\n# ♥\r\n# Red Heart\r\n# کخ\r\n\r\n", "def hotels(lst, d):\r\n kol = 2\r\n x, y = 0, 0\r\n for i in range(len(lst) - 1):\r\n x = lst[i] + d\r\n y = lst[i + 1] - d\r\n if x < y:\r\n kol += 2\r\n elif x == y:\r\n kol += 1\r\n return kol\r\n\r\n\r\nN, D = [int(j) for j in input().split()]\r\na = [int(z) for z in input().split()]\r\nprint(hotels(a, D))\r\n", "n, d = map(int,input().split())\r\ncity = list(map(int,input().split()))\r\ncity.sort()\r\ncount = 2\r\nfor i in range(n-1):\r\n if city[i+1] - city[i] > 2 * d:\r\n count += 2\r\n elif city[i + 1] - city[i] == 2 * d:\r\n count += 1\r\nprint(count)", "n, d = map(int, input().split())\r\ncities = list(map(int, input().split()))\r\ncounter = 2\r\nfor i in range(1, n):\r\n if (cities[i] - cities[i - 1]) > 2 * d:\r\n counter += 2\r\n elif (cities[i] - cities[i - 1]) == 2 * d:\r\n counter += 1\r\nprint(counter)\r\n", "a=list(map(int,input().split()))\r\nt=a[0]\r\nd=a[1]\r\narr=list(map(int,input().split()))\r\ncount=0\r\nfor i in range(t-1):\r\n if(arr[i+1]-arr[i]==2*d):\r\n count+=1\r\n elif(arr[i+1]-arr[i]>2*d):\r\n count+=2\r\nprint(count+2)", "n,d=input().split()\r\nn,d=[int(n),int(d)]\r\na=[int(i) for i in input().split()]\r\nc=0\r\nb=[]\r\nfor i in range(0,n):\r\n m1=(a[i]+d)\r\n m2=(a[i]-d)\r\n flag1=0\r\n flag2=0\r\n j=0\r\n while j<n:\r\n l1=abs(a[j]-m1)\r\n l2=abs(a[j]-m2)\r\n #print(l1,l2,m1,m2)\r\n if l1<d:\r\n #print(l1)\r\n flag1=1\r\n if l2<d:\r\n flag2=1\r\n j+=1\r\n if flag1==0 and flag2==0:\r\n b.append(a[i]+d)\r\n b.append(a[i]-d)\r\n c+=2\r\n elif flag1==0:\r\n c+=1\r\n b.append(a[i]+d)\r\n elif flag2==0:\r\n c+=1\r\n b.append(a[i]-d)\r\n#print(b)\r\nprint(len(set(b)))", "n, d = map(int, input().split())\r\nkoord = list(map(int, input().split()))\r\nans = 2\r\nsums = []\r\nfor i in range(1, n):\r\n sums.append(koord[i] - koord[i - 1])\r\nfor i in sums:\r\n if i > 2 * d:\r\n ans += 2\r\n elif i == 2 * d:\r\n ans += 1\r\nprint(ans)\r\n \r\n", "from sys import stdin,stdout\r\nnmbr=lambda:int(stdin.readline())\r\nlst=lambda:list(map(int,stdin.readline().split()))\r\nfor _ in range(1):#nmbr())\r\n n,d=lst()\r\n a=sorted(lst())\r\n s=set()\r\n for i in range(n):\r\n x=a[i]-d\r\n left=a[i-1] if i>=1 else float('inf')\r\n if abs(x-left)>=d:s.add(x)\r\n x=a[i]+d\r\n right=a[i+1] if i+1<n else float('inf')\r\n if abs(x-right)>=d:s.add(x)\r\n print(len(s))", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn, d = map(int, input().split())\r\ndata = list(map(int, input().split()))\r\n\r\ncnt = 2\r\nfor i in range(n - 1):\r\n if data[i] + d == data[i + 1] - d:\r\n cnt += 1\r\n elif data[i] + d < data[i + 1] - d:\r\n cnt += 2\r\n\r\nprint(cnt)\r\n", "n, d = list(map(int, input().split()))\r\nX = list(map(int, input().split()))\r\ncount = 2\r\ndd = 2*d\r\nfor i in range(n-1):\r\n if X[i+1] - X[i] == dd:\r\n count += 1\r\n if X[i + 1] - X[i] > dd:\r\n count += 2\r\nprint(count)", "n, d = map(int, input().split(' '))\r\na = input().split(' ')\r\nfor i in range(n):\r\n a[i] = int(a[i])\r\na.insert(0, a[0]-2*d)\r\na.append(a[n]+2*d)\r\ncount = 0\r\nfor i in range(1, n+2):\r\n if a[i] - a[i-1] == 2*d:\r\n count += 1\r\n elif a[i] - a[i-1] > 2*d:\r\n count += 2\r\nprint(count)", "n, d = map(int, input().split())\nx = sorted(list(map(int, input().split())))\nres = 2\nfor i in range(len(x) - 1):\n\ta, b = x[i], x[i + 1]\n\tif b - a >= 2 * d:\n\t\tres += 1\n\tif b - a > 2 * d:\n\t\tres += 1\nprint(res)\n", "end = pow(10, 9)\n\ndef main():\n n, d = [int(x) for x in input().split()]\n hotels = [int(x) for x in input().split()]\n c = 0\n last = 0\n for i in range(n):\n if i == 0:\n c += 1\n last = hotels[i] - d\n if i == n - 1:\n c += 1\n if i != 0 and hotels[i] - hotels[i-1] >= 2*d and hotels[i] - d > last:\n c += 1\n last = hotels[i] - d\n if i != n-1 and hotels[i] + 2*d <= hotels[i+1]:\n last = hotels[i] + d\n c += 1\n\n print(c)\n\n\nif __name__ == '__main__':\n main()\n", "# problem Name : Sonya and Hotels \r\n# problem Link : https://codeforces.com/problemset/problem/1004/A\r\n# Input Operation\r\nimport sys\r\nn,d=map(int,sys.stdin.readline().split())\r\narr=list(map(int,sys.stdin.readline().split()))\r\n# Input Operation End\r\n# Solution Start\r\nhotels=2\r\nfor i in range(1,n):\r\n if abs(arr[i]-arr[i-1])==2*d:\r\n hotels+=1\r\n if abs(arr[i]-arr[i-1])>2*d:\r\n hotels+=2\r\nprint(hotels)", "import math\nx, k = map(int, input().split())\nv = [int(i) for i in input().split()]\n\nma = 0\nfor i in range(x-1):\n if (v[i+1] - v[i]) == k*2:\n ma+=1\n elif (v[i+1] - v[i]) > k*2:\n ma+=2\n\nprint(ma+2)\n", "x = input()\r\nx = x.split(' ')\r\nn = int(x[0])\r\nd = int(x[1])\r\na = input()\r\na = [int(i) for i in a.split()]\r\ncnt = 0\r\nd += d\r\nfor i in range(1, n):\r\n ans = abs(a[i - 1] - a[i])\r\n if ans == d:\r\n cnt += 1\r\n elif ans > d:\r\n cnt += 2\r\nprint(cnt+2)\r\n# str_in = input('用空格分隔多个数据:')\r\n# num = [int(n) for n in str_in.split()]\r\n# print(num)\r\n\r\n", "n,k=[int(x) for x in input().split()]\r\na=list(map(int,input().split()))\r\nans=2\r\nfor i in range(0,n-1):\r\n dif=a[i+1]-a[i]\r\n if dif==2*k:\r\n ans+=1\r\n elif dif>2*k:\r\n ans+=2\r\n \r\nprint(ans)", "n,d=(int(i) for i in input().split())\r\na=[int(i) for i in input().split()]\r\nsorted(a)\r\nx=0\r\nfor i in range(1,n):\r\n if a[i]-a[i-1]>2*d:\r\n x+=2\r\n elif a[i]-a[i-1]==2*d:\r\n x+=1\r\nx+=2\r\nprint(x)\r\n", "n, d = map(int, input().split())\na = list(map(int, input().split()))\n\n\ncands = set()\nfor x in a:\n cands.add(x - d)\n cands.add(x + d)\n\nans = 0\nfor x in cands:\n mn_dist = min(map(lambda t: abs(t - x), a))\n ans += mn_dist == d\n\nprint(ans)\n", "n,d = map(int,input().split())\r\na = list(map(int,input().split()))\r\nl = []\r\nfor i in a:\r\n if(i-d not in a):\r\n l.append(i-d)\r\n if(i+d not in a):\r\n l.append(i+d)\r\nans = 0\r\nl = list(set(l))\r\nfor i in l:\r\n x = 10**10\r\n for j in a:\r\n x = min(x,abs(i-j))\r\n if(x==d):\r\n ans+=1\r\nprint(ans)", "n, d = [int(item) for item in input().split()]\r\nx = [int(item) for item in input().split()]\r\n\r\np = []\r\n\r\nfor i in range(n):\r\n p.append([x[i] - d, x[i] + d])\r\n\r\nans = 2\r\n\r\nfor i in range(n - 1):\r\n if p[i][1] == p[i + 1][0]:\r\n ans += 1\r\n elif p[i][1] < p[i + 1][0]:\r\n ans += 2\r\n\r\nprint(ans)\r\n", "n,d=map(int,(input().split()))\r\n\r\nx=list(map(int,input().split()))\r\n\r\n\r\ncount=2\r\n\r\nif n>1:\r\n for i in range(1,n):\r\n temp=x[i]-x[i-1]\r\n if temp==(2*d):\r\n count=count+1\r\n if temp>2*d:\r\n count=count+2\r\n\r\nprint(count)", "n,d = map(int,input().split())\r\nA = list(map(int,input().split()))\r\nB = set()\r\nfor i in A:\r\n a = i-d;b=i+d\r\n f=0;g=0\r\n for j in range(n):\r\n if(A[j]==i):\r\n continue\r\n if(abs(A[j]-a)<d):\r\n f=-1\r\n if(abs(A[j]-b)<d):\r\n g=-1\r\n if(f==0):\r\n B.add(i-d)\r\n if(g==0):\r\n B.add(i+d)\r\nprint(len(B))\r\n\r\n ", "n, d = map(int, input().strip().split(\" \"))\nvalues = [int(n) for n in input().split(\" \")]\n\ncounter = 2\n\nfor i in range(len(values) - 1):\n if (values[i] + d < values[i + 1] - d):\n counter += 2\n elif (values[i] + d == values[i + 1] - d):\n counter += 1 \n else:\n continue\n \nprint(counter)", "CT,d=map(int, input().split(\" \"))\r\nordinates=list(map(int, input().split(\" \")))\r\ni=0\r\nx=0\r\nwhile(CT):\r\n if(ordinates[i]==ordinates[-1]):\r\n break\r\n if((ordinates[i+1]-ordinates[i])>2*d):\r\n x+=2\r\n elif ((ordinates[i+1]-ordinates[i])==2*d):\r\n x+=1 \r\n else:\r\n pass\r\n\r\n i+=1\r\n CT-=1\r\nprint(x+2)\r\n\r\n\r\n ", "n, d = map(int, input().split())\r\nu = list(map(int, input().split()))\r\nans = 2\r\nd *= 2\r\nfor i in range(1, n):\r\n if u[i] - u[i - 1] == d:\r\n ans += 1\r\n elif u[i] - u[i - 1] > d:\r\n ans += 2\r\nprint(ans)\r\n", "n,a = map(int, input().split())\r\nar=[]\r\ncount=0\r\nar=list(map(int,input().split()))\r\n\r\nfor i in range(0,n-1):\r\n if((ar[i+1]-ar[i])==2*a):\r\n count=count+1\r\n \r\n elif(ar[i+1]-ar[i]>2*a):\r\n count=count+2\r\n \r\ncount=count+2\r\nprint(count)\r\n \r\n ", "n,d=map(int,input().split())\r\na=list(map(int,input().split()))\r\nx=2\r\nfor i in range(n-1):\r\n if a[i]+d<a[i+1]-d:\r\n x+=2\r\n elif a[i]+d==a[i+1]-d:\r\n x+=1\r\nprint(x)\r\n", "n,d=map(int,input().strip().split())\r\ncity=list(map(int,input().strip().split()))\r\ncount=2\r\nfor i in range(1,n):\r\n\tif city[i]-city[i-1]==2*d:\r\n\t\tcount=count+1\r\n\telif city[i]-city[i-1]>2*d:\r\n\t\tcount=count+2\r\n\telse:\r\n\t\tcontinue\r\nprint (count)", "n,d=map(int,input().split())\r\nls=list(map(int,input().split()))\r\nc=2\r\n#print(n,d)\r\nif n==1:\r\n\tprint(2)\r\nelse:\r\n\tfor i in range(1,len(ls)):\r\n\t\tif abs(ls[i]-ls[i-1])==d*2:\r\n\t\t\tc+=1\r\n\t\telif abs(ls[i]-ls[i-1])>d*2:\r\n\t\t\tc+=2\r\n\t\telse:\r\n\t\t\tcontinue\r\n\tprint(c)", "a, b = map(int, input().split())\r\nList = list(map(int, input().split()))\r\n\r\ncount = 0\r\nfor i in range(a-1):\r\n x = abs(List[i+1]-(List[i]+b))\r\n if x == b:\r\n count = count + 1\r\n elif x>b:\r\n count = count + 2\r\nprint(count+2)\r\n", "d=int(input().split()[1])\r\nh=input().split()\r\nfor i in range(len(h)):\r\n h[i]=int(h[i])\r\nwy=2\r\nfor i in range(len(h)-1):\r\n if h[i+1]-h[i]==d*2:\r\n wy+=1\r\n elif h[i+1]-h[i]>d*2:\r\n wy+=2\r\nprint(wy)\r\n", "n, d = map(int, input().split())\r\nx = list(map(int, input().split()))\r\ncount = 2\r\nfor i in range(n-1):\r\n\tif x[i]+d<x[i+1]-d:\r\n\t\tcount+=2\r\n\telif x[i]+d==x[i+1]-d:\r\n\t\tcount+=1\r\nprint(count)", "n, d = map(int, input().split())\r\nX = [int(i) for i in input().split()]\r\nX.sort()\r\nhotel_number = 2\r\ncnt = 0\r\nfor i in range(1, len(X)):\r\n if X[i] - X[i-1] > 2*d:\r\n hotel_number += 2\r\n elif X[i] - X[i-1] == 2*d:\r\n hotel_number += 1\r\n\r\nprint(hotel_number)", "n, d = map(int, input().split())\r\na = list(map(int, input().split()))\r\ns = set()\r\ndef check(x):\r\n global d\r\n mind = 10000000000\r\n for i in a:\r\n mind = min(mind, abs(i - x))\r\n return mind == d\r\nfor i in a:\r\n if check(i - d):\r\n s.add(i - d)\r\n if check(i + d):\r\n s.add(i + d)\r\nprint(len(s))", "d = int(input().split()[-1])\r\n\r\nhotels = list(map(int, input().split()))\r\n\r\n \r\ndef new_hotel_location(d, hotels):\r\n spacing = []\r\n for i in range(len(hotels)-1):\r\n spacing.append(hotels[i+1] - hotels[i])\r\n dd = d*2\r\n counting = 0\r\n for item in spacing:\r\n if item == dd:\r\n counting += 1\r\n elif item > dd:\r\n counting += 2\r\n return counting + 2\r\n \r\nprint(new_hotel_location(d, hotels))", "n, d = input().split()\r\nn = int(n)\r\nd = int(d)\r\na = [int(x) for x in input().split()]\r\ncount = 2\r\nfor i in range(n-1):\r\n if a[i+1] - a[i] > 2 * d:\r\n count += 2\r\n elif a[i+1] - a[i] == 2*d:\r\n count += 1\r\nprint(count)\r\n", "n, d = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = []\r\nfor i in a:\r\n b.append(i)\r\n if i+d not in b and i+d not in a:\r\n b.append(i+d)\r\n if i-d not in b and i-d not in a:\r\n b.append(i-d)\r\nb.sort()\r\nfor i in range(n):\r\n val = b[b.index(a[i])]\r\n z = b[b.index(a[i]) - 1]\r\n while abs(val - z) != d and z not in a:\r\n b.remove(z)\r\n z = b[b.index(a[i]) - 1]\r\n z = b[b.index(a[i]) + 1]\r\n while abs(z - val) != d and z not in a:\r\n b.remove(z)\r\n z = b[b.index(a[i]) + 1]\r\nprint(len(b) - len(a))\r\n", "# https://codeforces.com/problemset/problem/1004/A\n# 900\n\nn, k = map(int, input().split())\nl = list(map(int, input().split()))\n\no = 2\nfor i in range(n):\n if i+1 == n:\n break\n\n d = abs(l[i] - l[i+1]) / k\n if d == 2:\n o += 1\n elif d > 2:\n o += 2\n\nprint(o)", "n, d = [int(x) for x in input().split()]\r\nlst = [int(x) for x in input().split()]\r\ns = 2\r\nfor i in range(n-1):\r\n if abs(lst[i]-lst[i+1])> 2*d:\r\n s+=2\r\n #print('1')\r\n elif abs(lst[i]-lst[i+1])==2 * d:\r\n s+=1\r\n #print('2')\r\n \r\nprint(s)\r\n", "n, d = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nA.sort()\r\nres_set = set()\r\nx = (A[0] + d)\r\nif len(A) >= 2:\r\n if abs(A[1] - x) >= d:\r\n res_set.add(x)\r\nfor i in range(1, n - 1):\r\n x1, x2 = A[i] + d, A[i] - d\r\n if abs(A[i - 1] - x2) >= d:\r\n res_set.add(x2)\r\n \r\n if abs(A[i + 1] - x1) >= d:\r\n res_set.add(x1)\r\nx = A[-1] - d\r\nif len(A) >= 2:\r\n if abs(A[-2] - x) >= d:\r\n res_set.add(x)\r\nprint(len(res_set) + 2)\r\n", "n,d =input().split()\nn=int(n)\nd=int(d)\ncnt=2\ncnt=int(cnt)\narr=list(map(int,input().split()))\narr=sorted(arr)\nfor i in range (1,n):\n if arr[i]-arr[i-1]==2*d:\n cnt+=1 \n if arr[i]-arr[i-1]>2*d:\n cnt+=2\n\n \n \n \n \nprint(cnt)", "n, d = map(int, input().split())\r\na = list(map(int, input().split()))\r\nans = 2\r\na.sort()\r\nfor i in range(n-1):\r\n ans+=(a[i+1]-a[i]>2*d)*2+(a[i+1]-a[i]==2*d)\r\nprint(ans)", "n,d=map(int,input().split())\r\na=list(map(int,input().split()))\r\nc=2\r\nfor i in range(n-1):\r\n if a[i+1]-a[i]==2*d:\r\n c=c+1\r\n elif a[i+1]-a[i]>2*d:\r\n c=c+2\r\nprint(c)\r\n", "n,d = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nans = 2\r\nfor i in range(n-1):\r\n if abs(l[i]-l[i+1]) > 2 * d:\r\n ans += 2\r\n if abs(l[i]-l[i+1]) == 2 * d:\r\n ans += 1\r\nprint(ans)", "(n, k) = list(map(int, input().split()))\r\nd = list(map(int, input().split()))\r\n\r\nresult = 2\r\n\r\nfor i in range(len(d) - 1):\r\n if d[i+1] - d[i] == k * 2:\r\n result += 1\r\n elif d[i+1] - d[i] > k * 2:\r\n result += 2\r\nprint(result)", "n,d=map(int,input().split())\r\na=(list(map(int,input().split())))\r\nco=0\r\nfor i in range(n-1):\r\n if a[i+1]-a[i]>2*d:\r\n co+=2\r\n elif a[i+1]-a[i]==2*d:\r\n co+=1\r\nprint(co+2)", "from bisect import bisect_left as bl, bisect_right as br\r\n\r\ndef readList(converter = str):\r\n return [converter(x) for x in input().strip().split()]\r\n\r\nn, d = readList(int)\r\nl = readList(int)\r\n\r\ncount = 0\r\nfor i,el in enumerate(l):\r\n if i > 0:\r\n lower = abs(l[i-1]-(el-d))\r\n if d <= lower:\r\n #print(el-d)\r\n count += 0.5 if lower == d else 1\r\n else:\r\n #print(el-d)\r\n count += 1 \r\n\r\n if i+1 < n:\r\n upper = abs(l[i+1] - (el+d))\r\n if d <= upper:\r\n #print(el+d)\r\n count += 0.5 if upper == d else 1\r\n else:\r\n #print(el+d)\r\n count += 1\r\n\r\nprint(int(count))", "c_count, dest = input().split(' ')\r\ncoord = list(input().split(' '))\r\nres = 0\r\n\r\nx_vst = 0\r\n\r\n\r\nfor i in range(int(c_count)):\r\n if i == 0:\r\n x_vst = int(coord[i]) - int(dest)\r\n res += 1\r\n \r\n\r\n if i != 0 and (int(coord[i]) - 2 * int(dest) > int(coord[i - 1])): #слева\r\n if int(coord[i]) > x_vst:\r\n x_vst = int(coord[i]) - int(dest)\r\n res += 1\r\n if i != int(c_count) - 1 and int(coord[i]) + 2 * int(dest) <= int(coord[i + 1]): #справа\r\n x_vst = int(coord[i]) + int(dest)\r\n res += 1\r\n \r\n if i == int(c_count) - 1:\r\n x_vst = int(coord[i]) + int(dest)\r\n res += 1\r\n\r\nprint(res)", "n,d=map(int,input().split())\r\nl=list(map(int,input().split()))\r\n# l2=[]\r\nc=2\r\nfor i in range(n-1):\t\r\n\tif abs(l[i]-l[i+1])>d*2:\r\n\t\tc+=2\r\n\tif abs(l[i]-l[i+1])==d*2:\r\n\t\tc+=1\r\n# l2+=l\r\n# l2=set(l2)\r\n# print(*l2)\r\nprint(c)", "n, d = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\ncnt = 2\r\n\r\nfor i in range(len(arr) - 1):\r\n if arr[i] + d < arr[i + 1] - d:\r\n cnt += 2\r\n elif arr[i] + d <= arr[i + 1] - d:\r\n cnt += 1\r\n\r\nprint(cnt)\r\n", "n, d = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nans = 2\r\nfor i in range(n - 1):\r\n q = arr[i+1] - arr[i]\r\n if q == 2 * d:\r\n ans += 1\r\n elif q > 2 * d:\r\n ans += 2\r\nprint(ans)\r\n", "s=2\r\na,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nfor x in range(a-1):\r\n\td=l[x+1]-l[x]\r\n\tif d==2*b:s+=1\r\n\telif d>2*b:s+=2\r\nprint(s)", "n,d = [int(i) for i in input().split(\" \")]\narr = [int(i) for i in input().split(\" \")]\nans = 0\nfor i in range(n-1) :\n\tif arr[i+1] - arr[i] - 2*d == 0:\n\t\tans += 1\n\telif arr[i+1] - arr[i] - 2*d > 0:\n\t\tans += 2 \nprint(ans+2)", "n, d = list(map(int, input().split()))\r\na = list(map(int,input().split()))\r\ncount = 2\r\nfor i in range(1,len(a)):\r\n if (a[i] - a[i-1])/2 == d:\r\n count+=1\r\n elif (a[i] - a[i-1])/2 > d:\r\n count+=2\r\nprint(count)", "n,d=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=2\r\nfor i in range(len(l)-1):\r\n if(l[i+1]-l[i]>d*2):\r\n c+=2\r\n elif(l[i+1]-l[i]==d*2):\r\n c+=1\r\nprint(c)\r\n", "n, d=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\nx=2\r\nfor i in range(n-1):\r\n if a[i]+d<a[i+1]-d:\r\n x+=2\r\n elif a[i]+d==a[i+1]-d:\r\n x+=1\r\nprint(x)", "import sys\r\nimport math\r\nfrom collections import defaultdict,deque\r\n\r\ninput = sys.stdin.readline\r\ndef inar():\r\n return [int(el) for el in input().split()]\r\ndef main():\r\n n,d=inar()\r\n arr=inar()\r\n arr.sort()\r\n ans=0\r\n check=set()\r\n for i in range(n):\r\n\r\n lol=arr[i]+d\r\n if lol not in check and i+1<n and lol<arr[i+1] and arr[i+1]-lol>=d:\r\n ans+=1\r\n check.add(lol)\r\n\r\n lol=arr[i]-d\r\n if lol not in check and i-1>-1 and lol>arr[i-1] and lol-arr[i-1]>=d:\r\n ans+=1\r\n check.add(lol)\r\n print(ans+2)\r\n\r\nif __name__ == '__main__':\r\n main()\r\n\r\n\r\n\r\n", "n,d=[int(i) for i in input().split()]\r\nt=[int(i) for i in input().split()]\r\ng=2\r\nfor i in range(n-1):\r\n if t[i+1]-t[i] > 2*d:\r\n g+=2\r\n elif t[i+1] - t[i] == 2*d:\r\n g+=1\r\nprint(g)", "n,d=tuple(map(int,input().split()))\r\nhot=list(map(int,input().split()))\r\n\r\nans=2\r\n\r\nfor i in range(n-1):\r\n curr=hot[i];next=hot[i+1]\r\n dum=abs(next-curr)\r\n if dum>2*d :ans+=2\r\n elif dum==2*d: ans+=1\r\nprint(ans)", "input3=input()\r\nn,d=input3.split(' ')\r\nn=(int)(n)\r\nd=(int)(d)\r\ninput2=input()\r\nln=input2.split(' ')\r\nln2=[]\r\nfor i in ln:\r\n ln2.append((int)(i))\r\n\r\ncount=2\r\n\r\nc=0\r\nc2=1\r\n\r\nl=list()\r\n\r\nwhile c<n-1:\r\n if ln2[c]+d<ln2[c2]-d:\r\n \r\n count+=1\r\n if ln2[c2]-d > ln2[c]+d:\r\n count+=1\r\n \r\n if ln2[c] + d== ln2[c2]-d:\r\n count+=1\r\n\r\n c+=1\r\n c2+=1\r\nprint(count)\r\n", "def main():\n n, d = map(int, input().split())\n aa = sorted(map(int, input().split()))\n res,i = set(),0\n for x in aa[1:]:\n while aa[i] < x:\n i += 1\n if min(x - d - aa[i - 1], aa[i] - x + d) == d:\n res.add(x - d)\n i = n - 1\n for x in aa[-2::-1]:\n while aa[i] > x:\n i -= 1\n if min(x + d - aa[i], aa[i + 1] - x - d) == d:\n res.add(x + d)\n print(len(res) + 2)\n\n\nif __name__ == '__main__':\n main()\n", "n, d = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\n\r\ncount = 2\r\nfor i in range(n-1):\r\n if a[i+1] - a[i] > 2 * d:\r\n count += 2\r\n elif a[i+1] - a[i] == 2 * d:\r\n count += 1\r\nprint(count)", "n,l=map(int,input().split())\r\nli=list(map(int,input().split()))\r\ncount=0\r\nfor i in range(1,n):\r\n k= li[i]-li[i-1]\r\n if k-(2*l)==0:\r\n count+=1\r\n if k-(2*l)>0:\r\n count+=2\r\nprint(count+2)\r\n\r\n", "n,k=map(int,input().split())\r\ns=list(map(int,input().split()))\r\ncount=1\r\nl=[]\r\nfor i in range(1,n):\r\n l+=[s[i]-s[i-1]]\r\nfor i in l:\r\n if i>2*k:\r\n count+=2\r\n elif i==2*k:\r\n count+=1\r\ncount+=1\r\nprint(count)", "I=input\r\nn,d=map(int,I().split())\r\nd*=2\r\nv=list(map(int,I().split()))\r\nx=2\r\nfor i in range(n-1):\r\n r=v[i+1]-v[i]\r\n if r==d:x+=1\r\n elif r>d:x+=2\r\nprint(x)", "n,d = [int(x) for x in input().split()]\r\n\r\nL = [int(x) for x in input().split()]\r\n\r\ns = 0\r\n\r\nfor i in range(n-1):\r\n if L[i+1]-L[i] == 2*d:\r\n s += 1\r\n elif L[i+1]-L[i] > 2*d:\r\n s += 2\r\n\r\ns += 2\r\n\r\nprint(s)", "n, d = map(int, input().split())\r\n\r\nlocations = list(map(int, input().split()))\r\n\r\nnew_hotel = []\r\n\r\nnew_hotel.append(locations[0] - d)\r\nnew_hotel.append(locations[n-1] + d)\r\n\r\nfor i in range (0, n-1):\r\n if locations[i+1] - locations[i] >= 2*d :\r\n new_hotel.append(locations[i] + d)\r\n new_hotel.append(locations[i+1] - d)\r\n \r\n \r\nnew_hotel = set(new_hotel)\r\nprint (len(new_hotel))", "n, d = map(int, input().split())\n\nans = []\n\nx = list(map(int, input().split()))\n\nfor xi in x:\n ans.append(xi-d)\n ans.append(xi+d)\n \nreal_ans = []\n\nfor a in set(ans):\n if not any(abs(xi-a) < d for xi in x):\n real_ans.append(a)\nprint(len(real_ans))\n", "n,k=list(map(int,input().split()))\r\nkx=list(map(int,input().split()))\r\nco=0\r\nfor x in range(len(kx)-1):\r\n ifs=abs(kx[x]-kx[x+1])\r\n ta=ifs/k\r\n if ta==2:\r\n co+=1\r\n elif ta>2:\r\n co+=2\r\n else:\r\n pass\r\nprint(co+2)", "n,d=map(int,input().split())\r\na=list(map(int,input().split()))\r\nc=2\r\nfor i in range(0,n-1):\r\n if (a[i+1]-a[i])>(2*d):\r\n c+=2\r\n elif (a[i+1]-a[i])==(2*d):\r\n c+=1\r\nprint(c)\r\n ", "n,d=map(int, input().split())\r\nA=[0 for _ in range(n-1)]\r\nX=list(map(int, input().split()))\r\n\r\nfor i in range(n-1):\r\n\tA[i]=X[i+1]-X[i]\r\n\r\na=2\r\nfor x in A:\r\n\tif x==2*d:\r\n\t\ta+=1\r\n\telif x>2*d:\r\n\t\ta+=2\r\n\r\nprint(a)", "from sys import stdin\r\n\r\ndef solve(x,d):\r\n x.sort()\r\n res = 2\r\n for i in range(1,len(x)):\r\n if x[i] - x[i-1] > 2*d: res += 2\r\n elif x[i] - x[i-1] == 2*d: res += 1\r\n print(res)\r\n\r\nwhile True:\r\n try:\r\n n,d = map(int,input().split())\r\n x = list(map(int,input().split()))\r\n solve(x,d)\r\n except:\r\n break\r\n\r\n", "n,m=[int(x) for x in input().split()]\r\na=[int(x) for x in input().split()]\r\na=sorted(a)\r\nk=[a[0]-m,a[-1]+m]\r\n\r\nfor i in range(1,n):\r\n if(a[i-1]+m<a[i]-m):\r\n k.append(a[i-1]+m)\r\n k.append(a[i]-m)\r\n elif(a[i-1]+m==a[i]-m):\r\n k.append(a[i]-m)\r\n\r\nprint(len(set(k)))\r\n \r\n \r\n \r\n", "n, d = map(int, input().split(' '))\r\n\r\nnl = list(map(int, input().split(' ')))\r\ncnt = 2\r\nfor i in range(n-1):\r\n if nl[i+1] - nl[i] > 2*d:\r\n cnt += 2\r\n elif nl[i+1] - nl[i] == 2*d:\r\n cnt += 1\r\n\r\nprint(cnt)", "from operator import itemgetter\r\n#int(input())\r\n#map(int,input().split())\r\n#[list(map(int,input().split())) for i in range(q)]\r\n#print(\"YES\" * ans + \"NO\" * (1-ans))\r\nn, d = map(int,input().split())\r\nxi = list(map(int,input().split()))\r\nans = 2\r\nnum = xi[0] + d\r\nif n > 1 and min(abs(num - xi[0]),abs(num - xi[1])) == d:\r\n ans += 1\r\nif num != xi[-1] - d:\r\n num = xi[-1] - d \r\n if n > 1 and min(abs(num - xi[-2]),abs(num - xi[-1])) == d:\r\n ans += 1\r\nnum = xi[0] + d\r\nfor i in range(1,n-1):\r\n if num != xi[i] - d:\r\n num = xi[i] - d\r\n if min(abs(num - xi[i-1]),abs(num - xi[i])) == d:\r\n ans += 1\r\n num = xi[i] + d\r\n if min(abs(num - xi[i+1]),abs(num - xi[i])) == d:\r\n ans += 1\r\nif n > 2 and xi[-1] - d == xi[-2] + d:\r\n ans -= 1\r\nprint(ans)\r\n", "if __name__ == '__main__':\n [n, d] = [int(i) for i in input().strip().split()]\n hotels = [int(i) for i in input().strip().split()]\n ans = 0\n built = set()\n for hotel in hotels:\n newHotel = hotel + d\n minDist = d\n for h in hotels:\n minDist = min(minDist, abs(h - newHotel))\n if minDist == d and newHotel not in built:\n ans += 1\n built.add(newHotel)\n\n newHotel = hotel - d\n minDist = d\n for h in hotels:\n minDist = min(minDist, abs(h - newHotel))\n if minDist == d and newHotel not in built:\n ans += 1\n built.add(newHotel)\n\n print(ans)\n", "n , d = map(int , input().split())\r\nl=2\r\na=list(input().split())\r\nfor i in range(len(a)):\r\n a[i]=int(a[i])\r\nfor i in range(len(a)-1):\r\n x=a[i]+d\r\n y=a[i+1]-d\r\n if y==x:\r\n l+=1\r\n elif y>x:\r\n l+=2 \r\nprint(l)", "n,d = map(int, input().split())\r\na = [int(x) for x in input().split()]\r\ncnt = 2\r\nfor i in range(1,n):\r\n if a[i] - a[i-1] == 2*d:\r\n cnt += 1\r\n elif a[i] -a[i-1] > 2*d:\r\n cnt += 2\r\nprint(cnt)\r\n", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nk=[]\r\nfor i in range(n-1):\r\n\t\tr=abs(l[i+1]-l[i])\r\n\t\tif r/m>2:\r\n\t\t\tk.append(int(2))\r\n\t\telif int(r/m)==2:\r\n\t\t\tk.append(int(1))\r\nprint(sum(k)+2)", "n, d = map(int, input().split())\r\n\r\nx = list(map(int, input().split()))\r\n\r\nl, r = [x[i] - d for i in range(n)], [x[i] + d for i in range(n)]\r\n\r\nlr = set(l) | set(r)\r\n\r\nans = 0\r\n\r\nfor lri in lr:\r\n if min(list(map(lambda y: abs(lri - y), x))) == d:\r\n ans += 1\r\n\r\nprint(ans)\r\n", "read=lambda:map(int,input().split())\r\nn,d=read()\r\nx=sorted(list(read()))\r\nans=2\r\nfor i in range(0,n-1):\r\n if x[i+1]-x[i]>2*d:\r\n ans+=2\r\n if x[i+1]-x[i]==2*d:\r\n ans+=1\r\nprint(ans)\r\n", "n,d=input().split()\r\nn=int(n)\r\nd=int(d)\r\na=list(map(int,input().split()))\r\nt=2\r\nfor i in range(n-1):\r\n if a[i+1]-a[i]>2*d:\r\n t+=2\r\n elif a[i+1]-a[i]==2*d:\r\n t+=1\r\nprint(t)\r\n ", "import sys\n#import pdb\n#pdb.set_trace()\n\n\nn_and_c = input()\n\nnc = n_and_c.split()\nn = int(nc[0])\nc = int(nc[1])\n\n\"\"\"\nn = int(input())\nc = int(input())\n\"\"\"\nv = []\n\nsolution = 0\n\nvstr = input()\n\nvstr = vstr.split(' ')\n\n\n\nfor i in range(0,n):\n v.append(int(vstr[i]))\n\n# V.append(int(input()))\n\nv.sort()\n\n\n\nfor i in range(0,int(n - 1)):\n if v[i + 1] - v[i] - 2*c >= 1:\n solution += 2\n if v[i + 1] - v[i] - 2*c == 0:\n solution += 1\n\n\nprint(solution + 2)\n", "cities_to_build = []\n\ndef check_city_asc(city_asc, cities, i, d):\n if not city_asc in cities and city_asc not in cities_to_build:\n if i + 1 < len(cities) and cities[i + 1] - city_asc >= d:\n cities_to_build.append(city_asc)\n return True\n elif i + 1 < len(cities) and cities[i + 1] - city_asc < d:\n return False\n elif i - 1 >= 0 and city_asc - cities[i - 1] > d:\n cities_to_build.append(city_asc)\n return True\n elif i - 1 >= 0 and city_asc - cities[i - 1] > d:\n return False\n elif i - 1 < 0 and cities[i + 1] - city_asc >= d:\n cities_to_build.append(city_asc)\n return True\n elif i + 1 >= len(cities):\n cities_to_build.append(city_asc)\n return True\n return False\n\ndef check_city_dsc(city_dsc, cities, i, d):\n if not city_dsc in cities and city_dsc not in cities_to_build:\n if i - 1 >= 0 and city_dsc - cities[i - 1] >= d:\n cities_to_build.append(city_dsc)\n return True\n elif i - 1 >= 0 and city_dsc - cities[i - 1] < d:\n return False\n elif i + 1 < len(cities) and cities[i + 1] - city_dsc > d:\n cities_to_build.append(city_dsc)\n return True\n elif i + 1 < len(cities) and cities[i + 1] - city_dsc < d:\n return False\n elif i + 1 >= len(cities) and city_dsc - cities[i - 1] >= d:\n cities_to_build.append(city_dsc)\n return True\n elif i - 1 < 0:\n cities_to_build.append(city_dsc)\n return True\n return False\n\ndef main():\n n, d = map(int, input().split())\n cities = list(map(int, input().split()))\n ans = 0\n\n if n == 1:\n print(2)\n return\n\n for i in range(0, len(cities)):\n city_asc = cities[i] + d\n city_dsc = cities[i] - d\n\n if check_city_asc(city_asc, cities, i, d):\n ans += 1\n\n if check_city_dsc(city_dsc, cities, i, d):\n ans += 1\n\n print(ans)\n\nif __name__ == \"__main__\":\n main()\n", "n, d = map(int, input().strip().split())\nx = list(map(int, input().strip().split()))\ncount = 2\nfor i in range(n-1):\n diff = x[i+1] - x[i]\n if diff > 2 * d:\n count = count + 2\n elif diff == 2 * d:\n count = count + 1\nprint(count)\n", "n, d = [int(x) for x in input().split()]\narr = [int(x) for x in input().split()]\narr_diff = [arr[i+1] - arr[i] for i in range(len(arr)-1)]\ncount = 2\nfor diff in arr_diff:\n\tif(diff == d*2):\n\t\tcount += 1\n\telif(diff > d*2):\n\t\tcount += 2\nprint(count)", "a, b = map(int, input().split())\r\nk = list(map(int, input().split()))\r\nc = 2\r\nfor i in range(1, len(k)):\r\n if k[i] - k[i - 1] > 2 * b:\r\n c += 2\r\n elif k[i] - k[i - 1] == 2 * b:\r\n c += 1\r\nprint(c)", "n, d = map(int, input().split())\r\nans = 2\r\na = [int(i) for i in input().split()]\r\nfor i in range(n - 1):\r\n if a[i + 1] - a[i] >= 2 * d:\r\n ans += 1\r\n if a[i + 1] - a[i] > 2 * d:\r\n ans += 1\r\nprint(ans)", "n, d = map(int, input().split())\r\ns = list(map(int, input().split()))\r\nans = 2\r\nfor i in range(n-1):\r\n # print(abs(s[i+1] - s[i]))\r\n if abs(s[i+1] - s[i]) == d*2:\r\n ans += 1\r\n elif abs(s[i+1] - s[i]) > d*2:\r\n ans += 2\r\nprint(ans)", "# A. Sonya and Hotels\r\nn,d=map(int,input().split())\r\na=list(map(int,input().split()))\r\nc=2\r\nfor i in range(n-1):\r\n if a[i+1]-a[i]>d*2:\r\n c+=2\r\n elif a[i+1]-a[i]==d*2:\r\n c+=1\r\nprint(c)\r\n", "\r\na,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.append(999999999999)\r\ne=0\r\nfor i in range (a):\r\n\tw=l[i+1]\r\n\tr=l[i]\r\n\tif w-r>2*b :\r\n\t\te+=2\r\n\tif w-r==2*b:\r\n\t\te+=1\r\nprint(e)\r\n", "# -*- coding: utf - 8 -*-\r\n\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\r\n| author: mr.math - Hakimov Rahimjon |\r\n| e-mail: [email protected] |\r\n| created: 01.01.1980 01:11 |\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, d = map(int, input().split())\r\n x = list(map(int, input().split()))\r\n ans = 2\r\n for i in range(n-1):\r\n if x[i]+d < x[i+1]-d: ans += 2\r\n elif x[i]+d == x[i+1]-d: ans += 1\r\n print(ans)\r\n\r\n\r\n\r\n# ===========================================\r\nwhile TN != 0:\r\n solution()\r\n TN -= 1\r\n# ===========================================\r\n# inp.close()\r\n# out.close()\r\n", "#-------------Program--------------\r\n#----Kuzlyaev-Nikita-Codeforces----\r\n#-------------Training-------------\r\n#----------------------------------\r\n\r\nn,d=map(int,input().split())\r\nx=list(map(int,input().split()))\r\nx.sort();E=2\r\nfor i in range(n-1):\r\n if x[i+1]-x[i]>2*d:\r\n E+=2\r\n elif x[i+1]-x[i]==2*d:\r\n E+=1\r\nprint(E)\r\n", "n, d = list(map(int, input().split()))\r\n \r\nlst = list(map(int, input().split()))\r\n# ------\r\n# ------\r\nans = int(2)\r\nfor i in range(len(lst) - 1):\r\n\tif lst[i + 1] - lst[i] == 2 * d:\r\n\t\tans += 1\r\n\telif lst[i + 1] - lst[i] > 2 * d:\r\n\t\tans += 2\r\n \r\nprint(ans)\t\t\r\n ", "c = 2\r\nn, k = map(int, input().split())\r\nli = list(map(int, input().split()))\r\nfor i in range(n-1):\r\n if abs(li[i] - li[i+1]) > (2*k):\r\n c += 2\r\n elif abs(li[i] - li[i+1]) == (2*k):\r\n c += 1\r\nprint(c)", "n, d = list(map(int, input().split()))\na = list(map(int, input().split()))\n\nans = 2\ni = 0\nwhile i < n-1:\n if a[i+1]-d > a[i] + d:\n ans += 2\n if a[i+1]-d == a[i] + d:\n ans += 1\n i += 1\nprint(ans)\n", "n, d = [int(x) for x in input().split()]\nx = [int(w) for w in input().split()]\nx.sort()\nres = 1\nfor i in range(n):\n if i != 0 and x[i] - x[i-1] >= 2 * d:\n if x[i] - x[i-1] == 2 * d:\n res += 1\n else:\n res += 2\nres += 1\nprint(res)", "n, d = map(int, input().split())\r\np = None\r\nr = 2\r\nfor i in map(int, input().split()):\r\n\tif p != None:\r\n\t\tif i - p > 2*d:\r\n\t\t\tr += 2\r\n\t\telif i - p == 2*d:\r\n\t\t\tr += 1\r\n\tp = i\r\nprint(r)\r\n", "def solve(n: int, d: int, l: list) -> int:\r\n ans = 2\r\n for i in range(n - 1):\r\n if l[i + 1] - l[i] > 2 * d:\r\n ans += 2\r\n elif l[i + 1] - l[i] == 2 * d: \r\n ans += 1\r\n return (ans)\r\n\r\n\r\nn, d = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nprint(solve(n, d, l))", "from sys import stdin, stdout\r\nfrom collections import deque\r\n\r\nn, d = map(int, stdin.readline().split())\r\nvalues = list(map(int, stdin.readline().split()))\r\nans = set()\r\n\r\nfor i in range(n):\r\n cur = values[i] - d\r\n mn = 10 ** 10\r\n \r\n for j in range(n):\r\n if abs(cur - values[j]) < mn:\r\n mn = abs(cur- values[j])\r\n \r\n if mn == d:\r\n ans.add(cur)\r\n \r\n \r\n cur = values[i] + d\r\n mn = 10 ** 10\r\n \r\n for j in range(n):\r\n if abs(cur - values[j]) < mn:\r\n mn = abs(cur- values[j])\r\n \r\n if mn == d:\r\n ans.add(cur) \r\n\r\nstdout.write(str(len(ans)))", "n, d = map(int, input().split())\nxs = list(map(int, input().split()))\nds = [j - i for i, j in zip(xs, xs[1:])]\nprint(2 * n - sum((a < 2*d) + (a <= 2*d) for a in ds))\n", "n,d=input().split()\r\nn=int(n)\r\nd=int(d)\r\n\r\nl=input().split()\r\n\r\nelem2=\"a\"\r\nk=False\r\nans=0\r\n\r\nfor elem in l:\r\n if k:\r\n if int(elem)-int(elem2)>2*d:\r\n ans=ans+2\r\n else:\r\n if int(elem)-int(elem2)==2*d:\r\n ans=ans+1\r\n k=True\r\n elem2=elem\r\n\r\nprint (ans+2)\r\n", "import math\r\nn,d=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nans=2\r\nfor i in range(1,n):\r\n if l[i]-l[i-1]==2*d:\r\n ans+=1\r\n elif l[i]-l[i-1]>2*d:\r\n ans+=2\r\nprint(ans)\r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n", "n, d = list(map(int, input().split(\" \")))\nx = list(map(int, input().split(\" \")))\n\nr = 0\nfor i in range(0, n - 1):\n dif = x[i + 1] - x[i]\n if dif == 2 * d:\n r += 1\n elif dif > 2 * d:\n r += 2\n\nprint(r + 2)", "n, d = map(int, input().split())\r\nx = list(map(int, input().split()))\r\nans = 0\r\nres = set()\r\n\r\nfor el in x:\r\n xx = el + d\r\n r = 10 ** 10\r\n for ell in x:\r\n r = min(r, abs(xx - ell))\r\n if r == d:\r\n res |= {xx}\r\n xx = el - d\r\n r = 10 ** 10\r\n for ell in x:\r\n r = min(r, abs(xx - ell))\r\n if r == d:\r\n res |= {xx}\r\n\r\nprint(len(res))", "\r\nn, d = map(int, input().split())\r\nl = list(map(int, input().split()))\r\n\r\nco = 2\r\nfor i in range(n -1):\r\n\tp = l[i + 1] - l[i]\r\n\tif p > d * 2:\r\n\t\tco += 2\r\n\telif p == d * 2:\r\n\t\tco += 1\r\n\r\nprint(co)\r\n", "n,d=map(int,input().split())\r\na=list(map(int,input().split()))\r\ncnt=0\r\na=[a[0]-2*d]+a+[a[-1]+2*d+1]\r\n#print(a)\r\nfor i in range(1,n+1):\r\n if(a[i]+d<=a[i+1]-d):\r\n cnt+=1\r\n if(a[i]-d>=a[i-1]+d):\r\n cnt+=1\r\n if(a[i]+d==a[i+1]-d):\r\n cnt-=1\r\nprint(cnt)\r\n", "n,k=map(int,input().split())\r\nl=[int(i) for i in input().split()]\r\nc=2\r\nfor i in range(1,n):\r\n if l[i]-l[i-1]>2*k:\r\n c+=2\r\n elif l[i]-l[i-1]==2*k:\r\n c+=1\r\nprint(c)\r\n", "n, d = map(int, input().split())\r\nl = list(map(int, input().split()))\r\ncount, d = 2, 2 * d\r\nfor i in range(n - 1):\r\n count += 2 * (l[i + 1] - l[i] > d) + (l[i + 1] - l[i] == d)\r\nprint(count)\r\n", "n,d = list(map(int, input().split() ) )\r\nl = list(map(int, input().split() ) )\r\nk=0\r\nfor i in range(n-1):\r\n if l[i+1]-l[i]==2*d:\r\n k+=1\r\n elif l[i+1]-l[i]>2*d:\r\n k+=2\r\nprint(k+2)", "n,d=input().split()\r\nn=int(n)\r\nd=int(d)\r\na=[int(i) for i in input().split()]\r\ns=2\r\nfor i in range(n-1):\r\n if a[i+1]-a[i]>2*d:\r\n s=s+2\r\n if a[i+1]-a[i]==2*d:\r\n s=s+1\r\nprint(s) ", "n,d = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\nnumber = 2\r\nfor i in range(0, n-1):\r\n sub = arr[i+1]-arr[i]\r\n if sub == 2*d: number += 1\r\n elif sub > 2*d: number += 2\r\n\r\nprint(number)\r\n ", "n, d =map(int,input().split())\r\nA=list(map(int,input().split()))\r\nA.sort()\r\nan = 2\r\nfor i in range(len(A) - 1):\r\n s=A[i+1] - A[i]\r\n if s> 2 *d:\r\n an += 2\r\n elif s == 2*d:\r\n an += 1\r\nprint(an) ", "n, d = [int(i) for i in input().split()]\na = [int(i) for i in input().split()]\na.sort()\na = [a[0] - 2 * d - 1] + a + [a[-1] + 2 * d + 1]\nans = 0\nfor i in range(1, n + 1):\n\tif a[i] - d >= a[i - 1] + d:\n\t\tans += 1\n\tif a[i] + d < a[i + 1] - d:\n\t\tans += 1\nprint(ans)\n", "m,n = map(int,input().split())\na = list(map(int,input().split()))\na.sort()\ncount = 2\nfor i in range(m-1):\n if a[i+1]-a[i] > 2*n:\n count+=2\n elif a[i+1]-a[i] == 2*n:\n count+=1\nprint(count)\n", "n,d = map(int,input().split())\r\nm = list(map(int,input().split()))\r\nans = 2\r\nfor i in range(n-1):\r\n if(m[i+1]-m[i]>2*d):\r\n ans += 2\r\n elif(m[i+1]-m[i]==2*d):\r\n ans += 1\r\nprint(ans)", "n, d = map(int, input().split())\r\nx = list(map(int, input().strip().split()))\r\nc = 2\r\nfor i in range(0, n-1):\r\n if (x[i + 1] - x[i]) > (2*d):\r\n c = c + 2\r\n elif (x[i + 1] - x[i]) == (2*d):\r\n c = c + 1\r\n else:\r\n continue\r\nprint(c)", "[n, d] = list(map(int, input().split())) \r\nX = list(map(int, input().split()))\r\n\r\nnb = 0\r\nlast = X[0] -d -1\r\n\r\nfor i in range(n):\r\n if i != 0:\r\n if X[i] - d - X[i-1] >= d and X[i]-d > last:\r\n nb += 1\r\n last = X[i] -d\r\n \r\n else:\r\n nb += 1\r\n \r\n if i != n-1:\r\n if -X[i] - d + X[i+1] >= d and X[i]+d > last:\r\n nb += 1\r\n last = X[i] +d\r\n else:\r\n nb += 1\r\n\r\nprint(nb)", "n,d=map(int,input().strip().split())\r\nl=list(map(int,input().strip().split()))\r\nl1=[]\r\nfor i in range(n):\r\n l1.extend([l[i]+d,l[i]-d])\r\nl1=list(set(l1))\r\nl1.sort()\r\nct=0\r\nfor j in range(len(l1)):\r\n ct1=0\r\n for i in range(n):\r\n if(abs(l1[j]-l[i])<d):\r\n ct1=1\r\n break\r\n if(ct1==0):\r\n ct+=1\r\nprint(ct)", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\nn,d=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=2\r\nfor i in range(n-1):\r\n\tif abs(l[i]-l[i+1])>2*d:\r\n\t\tc+=2\r\n\tif abs(l[i]-l[i+1])==2*d:\r\n\t\tc+=1\r\nprint(c)", "n,d=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+1]-a[i])>(2*d):\r\n\t\ts=s+2\r\n\tif (a[i+1]-a[i])==(2*d):\r\n\t\ts=s+1\r\nprint(s+2)", "n, d = map(int, input().split())\r\nx = list(map(int, input().split()))\r\ncities = 0\r\n\r\nfor i in range(n-1):\r\n if x[i+1]-x[i] >= 2*d:\r\n cities += 2 if x[i+1]-x[i] > 2*d else 1\r\n\r\nprint(2+cities)\r\n", "#43\r\n\r\nn,d=map(int,input().split())\r\nls=list(map(int,input().rstrip().split()))\r\ns=ls[0]\r\ne=ls[-1]\r\nc=1\r\nfor i in range(len(ls)-1):\r\n if(ls[i+1]-ls[i]>2*d):\r\n c=c+2\r\n elif(ls[i+1]-ls[i]==2*d):\r\n c=c+1\r\nc=c+1\r\nprint(c)", "n, d = map(int, input().split())\r\na = list(map(int, input().split()))\r\nhotels = 2\r\nif n == 1:\r\n print(hotels)\r\nelse:\r\n for i in range(n - 1):\r\n dis = (a[i + 1] - a[i]) // 2\r\n if dis >= d:\r\n l = a[i] + d\r\n r = a[i + 1] - d\r\n if l == r:\r\n hotels += 1\r\n else:\r\n hotels += 2\r\n print(hotels)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, d = map(int, input().split())\r\nw = list(map(int, input().split()))\r\nc = 0\r\nfor i in range(n-1):\r\n if w[i+1]-w[i] == d*2:\r\n c += 1\r\n elif w[i+1]-w[i] > d*2:\r\n c += 2\r\nprint(c+2)", "n, d = map(int, input().split())\r\ns = [int(elem) for elem in input().split()]\r\ns = [-10 ** 9] + s\r\ns.append(10 ** 9)\r\nans = 0\r\nfor i in range(1, n):\r\n if s[i + 1] - s[i] == 2 * d:\r\n ans = ans + 1\r\n elif s[i + 1] - s[i] > 2 * d:\r\n ans = ans + 2\r\nprint(ans + 2)\r\n ", "class sonyaAndHotels:\r\n def __init__(self, n, d):\r\n self.n = n\r\n self.d = d\r\n self.calculateHotels(self.n, self.d)\r\n\r\n def calculateHotels(self, n, d):\r\n str1 = input()\r\n listOriginalHotels = []\r\n listNewHotels = []\r\n listOriginalHotels[:0] = str1.split(\" \")\r\n listNewHotels.append(int(listOriginalHotels[0]) - d)\r\n listNewHotels.append(int(listOriginalHotels[-1]) + d)\r\n\r\n for x in range(0, len(listOriginalHotels)-1):\r\n if((int(listOriginalHotels[x+1]) - int(listOriginalHotels[x])) > 2*d):\r\n listNewHotels.append(int(listOriginalHotels[x+1]) - d)\r\n listNewHotels.append(int(listOriginalHotels[x]) + d)\r\n if((int(listOriginalHotels[x+1]) - int(listOriginalHotels[x])) == 2*d):\r\n listNewHotels.append(int(listOriginalHotels[x]) + d)\r\n print(len(listNewHotels))\r\n\r\n if(len(str1) == n):\r\n pass\r\n else:\r\n exit()\r\n\r\n\r\nn, d = map(int, input().split())\r\nsonyaAndHotelsObj = sonyaAndHotels(n, d)", "n, d = map(int, input().split())\na = list(map(int, input().split()))\n\ncnt = 2\nfor i in range(1, len(a)):\n if (a[i] - a[i - 1] == 2 * d):\n cnt += 1\n elif (a[i] - a[i - 1] > 2 * d):\n cnt += 2\nprint(cnt)\n", "'''input\n4 3\n-3 2 9 16\n\n\n'''\n\nn ,d = map(int, input().split())\nnl = list(map(int, input().split()))\n\ndists = []\n\nfor i in range(n):\n\tdists.append(nl[i]-d)\n\tdists.append(nl[i]+d)\n\nres = []\nfor i in range(len(dists)):\n\tflag = []\n\tfor j in range(n):\n\t\tif abs(dists[i] - nl[j]) >= d:\n\t\t\tflag.append(True)\n\t\telse:\n\t\t\tflag.append(False)\n\tif False not in flag:\n\t\tres.append(dists[i])\n\nres = list(set(res))\n\n# print(res)\nprint(len(res))", "from sys import stdin, stdout\r\nfrom collections import deque, Counter\r\ndef main():\r\n lprint=lambda *args:stdout.write(\" \".join(map(str,args)) + '\\n')\r\n\r\n n, d = map(int, stdin.readline().split())\r\n l = [int(i) for i in stdin.readline().split()]\r\n k = 0\r\n l = [abs(l[i]-l[i+1]) for i in range(len(l)-1)]\r\n for i in l:\r\n if i > 2 * d:\r\n k += 2\r\n elif i == 2 * d:\r\n k += 1\r\n print(k + 2)\r\n\r\n\r\n\r\n\r\n'''\r\nn, m, a = map(int, stdin.readline().split())\r\nl = [int(i) for i in stdin.readline().split()]\r\nn = int(stdin.readline())\r\ns = stdin.readline()\r\nl = [[int(i) for i in stdin.readline().split()] for i in range(n)]\r\n'''\r\nmain()", "#int(input())\r\n#list(map(int, input().split(' ')))\r\n\r\n\r\nn,d = map(int, input().split(' '))\r\narr = list(map(int, input().split(' ')))\r\n\r\nc = 0\r\n\r\nfor i in range(1,n):\r\n if arr[i]-arr[i-1]==2*d:\r\n c+=1\r\n elif arr[i]-arr[i-1]>2*d:\r\n c+=2\r\n #print(c)\r\n \r\n\r\nprint(c+2)\r\n", "# difficulty 900\n\nn, d = map(int, input().split())\nhotels = list(map(int, input().split(maxsplit=n)))\nopts = 2\n\nfor i in range(n-1):\n if hotels[i] + d == hotels[i+1] - d: opts+=1\n elif hotels[i] + d < hotels[i+1] - d: opts+=2\n\nprint(opts)\n", "n,d = map(int,input().split())\r\nx= list(map(int,input().split()))\r\nb=[]\r\nc=[]\r\ne=[]\r\nfor i in x:\r\n b.append(i-d)\r\n b.append(i+d)\r\n c.append(b)\r\n b=[]\r\ny=[x for bb in c for x in bb]\r\nz=sorted(y)\r\nfor i in range(0,len(z)):\r\n if y[i]==z[i]:\r\n e.append(y[i])\r\nv=set(e)\r\nprint (len(v))", "# import sys \r\n# sys.stdin=open(\"input1.in\",\"r\")\r\n# sys.stdout=open(\"output2.out\",\"w\")\r\nN,K=map(int,input().split())\r\nL=list(map(int,input().split()))\r\nans=2\r\nfor i in range(N-1):\r\n\tdiff=L[i+1]-L[i]-1-(2*(K-1))\r\n\tif diff==1:\r\n\t\tans=ans+diff\r\n\telif diff>1:\r\n\t\tans=ans+2\r\nprint(ans)", "n,k = input().split()\r\nls = list(map(float,input().split()))\r\nn = (int)(n)\r\nk = (int)(k)\r\nans = 2\r\nfor i in range(1,n):\r\n if ls[i]-k > ls[i-1]+k:\r\n ans += 2\r\n elif ls[i]-k == ls[i-1]+k:\r\n ans += 1\r\nprint(ans)", "n,m =list(map(int,input().split()))\r\nl=list(map(int,input().split()))\r\nans=2\r\nfor i in range(n-1):\r\n\tif(l[i+1]-l[i]>2*m):\r\n\t\tans+=2\r\n\telif(l[i+1]-l[i]==2*m):\r\n\t\tans+=1\r\nprint(ans)", "n, d = map(int, input().split())\nls = list(map(int, input().split()))\ncount = 2\nfor i in range(n - 1):\n dist = ls[i + 1] - ls[i]\n if dist == d + d:\n count += 1\n elif dist > d + d:\n count += 2\nprint(count)\n", "import math as ma\r\nfrom sys import exit\r\nfrom decimal import Decimal as dec\r\ndef li():\r\n\treturn list(map(int , input().split()))\r\ndef num():\r\n\treturn map(int , input().split())\r\ndef nu():\r\n\treturn int(input())\r\n\r\nn,d=num()\r\na=li()\r\ncount=2\r\nfor i in range(len(a)-1):\r\n\tif((a[i+1]-a[i])>=2*d):\r\n\t\tif((a[i+1]-a[i])==2*d):\r\n\t\t\tcount+=1\r\n\t\telse:\r\n\t\t\tcount+=2\r\nprint(count)", "n, d = map(int, input().split())\nxi = list(map(int, input().split()))\n\ncount = 2;\n\nfor i in range(0,n-1):\n\ta=xi[i]+d;\n\tb=xi[i+1]-d;\n\n\tif b>a :\n\t\tcount +=2;\n\n\tif b==a :\n\t\tcount +=1;\n\nprint(count)\n", "a=list(map(int,input().split()))\r\nn=a[0]\r\nd=a[1]\r\nx=list(map(int,input().split()))\r\n\r\ncount=2\r\n\r\nfor i in range(len(x)-1):\r\n #print(x[i+1]-x[i])\r\n if(x[i+1]-x[i]==2*d):\r\n count+=1\r\n elif(x[i+1]-x[i]>2*d):\r\n count+=2\r\n \r\nprint(count)", "n, d = map(int, input().split())\r\nhotels = list(map(int, input().split()))\r\n\r\nanswer = 2\r\nfor (i, hotel) in enumerate(hotels, 0):\r\n if i:\r\n if hotels[i] - hotels[i - 1] > 2 * d:\r\n answer += 2\r\n elif hotels[i] - hotels[i - 1] == 2 * d:\r\n answer += 1\r\n\r\nprint(answer)", "n, d = map(int, input().split())\na = list(map(int, input().split()))\nans = []\nfor i in range(n):\n x = a[i] - d\n m = d\n for j in range(n):\n m = min(abs(a[j] - (a[i] - d)), m)\n if x not in a and x not in ans and m == d:\n ans.append(x)\n x = a[i] + d\n m = d\n for j in range(n):\n m = min(abs(a[j] - (a[i] + d)), m)\n if x not in a and x not in ans and m == d:\n ans.append(x)\nprint(len(ans))", "a=[int(q) for q in input().strip().split()]\r\nb=[int(q) for q in input().strip().split()]\r\nct=2\r\nfor k in range(len(b)-1):\r\n if (b[k+1]-b[k])==(2*a[1]):\r\n ct+=1\r\n elif (b[k+1]-b[k])>(2*a[1]):\r\n ct+=2\r\nprint(ct)", "n, d = [int(v) for v in input().split()]\r\na = {int(v) for v in input().split()}\r\n\r\nb1 = {v - d for v in a}\r\nb2 = {v + d for v in a}\r\ns = (b1 | b2) - a\r\n\r\ns = {v for v in b1 | b2 if min(abs(v - vv) for vv in a) == d}\r\n\r\nprint(len(s))\r\n", "n, d = input().split(\" \")\r\nn = int(n)\r\nd = int(d)\r\ninp = list(map(lambda x:int(x), input().split(\" \")))\r\ncount = 2\r\nfor i in range(n-1):\r\n\tif -inp[i]+inp[i+1]>2*d:\r\n\t\tcount+=2\r\n\telif -inp[i]+inp[i+1]==2*d:\r\n\t\tcount+=1\r\nprint(count)\r\n", "n,k=map(int,input().split())\r\narr=list(map(int,input().split()))\r\narr.sort()\r\nans=2\r\nfor i in range(n-1):\r\n if(arr[i+1]-arr[i]>2*k):\r\n ans+=2\r\n elif(arr[i+1]-arr[i]==2*k):\r\n ans+=1\r\nprint(ans)\r\n", "n, d = map(int,input().split())\r\na = list(map(int,input().split()))\r\ncount = 0\r\nfor i in range(n-1):\r\n if a[i + 1] - a[i] == 2 * d:\r\n count +=1\r\n elif a[i + 1] - a[i] > 2 * d:\r\n count += 2\r\nprint(count + 2)\r\n ", "n,d=(map(int,input().split()))\r\ncnt=2\r\na=[int(y) for y in input().split()]\r\nif n==1:\r\n\tprint(\"2\")\r\nelse:\r\n\tfor i in range(1,n):\r\n\t\tif(a[i]-a[i-1]==d*2):\r\n\t\t\tcnt+=1\r\n\t\telif(a[i]-a[i-1]>d*2):\r\n\t\t\tcnt+=2\r\n\tprint(cnt)", "td=list(map(int,input().split()))\r\nt=td[0]\r\nd=td[1]\r\narr=list(map(int,input().split()))\r\ncount=2\r\nfor i in range(t-1):\r\n if(arr[i+1]-arr[i]==2*d):\r\n count+=1\r\n elif(arr[i+1]-arr[i]>2*d):\r\n count+=2\r\nprint(count)", "n,d=map(int,input().split())\r\nx=list(map(int,input().split()))\r\ns=set()\r\nc=2\r\nfor i in range(0,n-1):\r\n if(x[i+1]-x[i]>2*d):\r\n c+=2\r\n elif(x[i+1]-x[i]==2*d):\r\n c+=1\r\nprint(c)\r\n", "from collections import defaultdict\ndef f(a,k):\n\tans=0\n\ta=[a[0]-2*k]+a+[a[-1]+2*k]\n\tfor i in range(1,len(a)):\n\t\tif abs(a[i]-a[i-1])>2*k:\n\t\t\tans+=2\n\t\telif abs(a[i]-a[i-1])==2*k:\n\t\t\tans+=1\n\treturn ans\na,b=map(int,input().strip().split())\nl=list(map(int,input().strip().split()))\nprint(f(l,b))\n\t \t \t \t\t\t\t\t\t\t\t \t\t \t \t \t \t", "n, d = map(int, input().split())\r\nx = list(map(int, input().split()))\r\nprint( len( set(x[i] + d for i in range(0, n-1) if x[i+1] - x[i] >= 2*d).union(set(x[i] - d for i in range(1, n) if x[i] - x[i-1] >= 2*d)) ) + 2 )\r\n\r\n", "n,d = map(int,input().split())\r\na = list(map(int,input().split()))\r\nans = 2\r\nfor i in range(len(a)-1):\r\n if a[i]+d == a[i+1]-d: ans += 1\r\n elif a[i]+d<a[i+1]-d: ans += 2\r\nprint(ans)", "n, d = map(int, input().split())\r\nX = list(map(int, input().split()))\r\n\r\nprint(2 + sum(0 if x2 - x1 < 2 * d else 2 if x2 - x1 > 2 * d else 1\r\n for x1, x2 in zip(X, X[1:])))", "def input_int():\r\n return list(map(int, input().split()))\r\n\r\n\r\nn, k = input_int()\r\narr = input_int()\r\n\r\nfrom collections import defaultdict\r\n\r\nvis = defaultdict(int)\r\n\r\nans = 2\r\nfor i in range(1, n):\r\n for d in [-1, 1]:\r\n if d == -1:\r\n cur = arr[i-1] + k\r\n else:\r\n cur = arr[i] - k\r\n if abs(cur - arr[i-1]) >= k and abs(cur - arr[i]) >= k:\r\n if vis[cur] == 0:\r\n vis[cur] = 1\r\n ans += 1\r\n\r\nprint(ans)\r\n\r\n\r\n", "b=list(map(int,input().split()))\r\nn=b[0]\r\nd=b[1]\r\na=list(map(int,input().split()))\r\nx=2\r\nfor i in range(0,n-1):\r\n c=a[i]-a[i+1]\r\n c=abs(c)\r\n if c>(2*d):\r\n x=x+2\r\n elif c==(2*d):\r\n x=x+1\r\n else:\r\n continue\r\nprint(x)\r\n", "n, d = map(int, input().split())\nhotels = list(map(int, input().split()))\nans = 2\nfor i in range(1, n):\n dist = hotels[i] - hotels[i - 1]\n if dist > 2 * d:\n ans += 2\n elif dist == 2 * d:\n ans += 1\nprint(ans)\n", "n, d = map(int, input().split())\r\na = list(map(int, input().split()))\r\nbad = a.copy()\r\nanswer = 0\r\nfor v in a:\r\n for x in v - d, v + d:\r\n if x not in bad:\r\n bad.append(x)\r\n min_dist = min(abs(y - x) for y in a)\r\n if min_dist == d:\r\n answer += 1\r\nprint(answer)", "n, d = map(int, input().split())\r\na = list(map(int, input().split()))\r\na = sorted(a)\r\n\r\npre = a[0]\r\nnum = 0\r\nfor i in range(1, n):\r\n if abs(a[i] - pre) == 2 * d:\r\n num += 1\r\n elif abs(a[i] - pre) > 2 * d:\r\n num += 2\r\n\r\n pre = a[i]\r\n\r\nprint(num + 2)\r\n", "n,d = map(int, input().split())\nhotels = list(map(int, input().split()))\n\ncount = 0\n\nfor i in range(1,n):\n back = hotels[i-1] + d\n front = hotels[i] - d\n if front > back :\n count += 2\n elif front == back:\n count += 1\n\nprint(count + 2)\n", "s=input().split()\r\nn=int(s[0])\r\nd=int(s[1])\r\nt=input().split()\r\nans=0\r\nans=ans+2\r\nl=len(t)\r\nfor i in range(l):\r\n t[i]=int(t[i])\r\nq=0\r\nd2=2*d\r\nfor i in range(1,l):\r\n q=t[i]-t[i-1]\r\n if q > d2:\r\n ans+=2\r\n elif q == d2:\r\n ans+=1\r\nprint(ans)", "#!/usr/bin/env python3\n\nn, d = [int(i) for i in input().split()]\n\nx = [int(i) for i in input().split()]\n\nans = 2\nfor i in range(1, len(x)):\n if x[i] - x[i - 1] == 2 * d:\n ans += 1\n if x[i] - x[i - 1] > 2 * d:\n ans += 2\nprint(ans)\n\n", "n, d = map(int, input().split())\r\nlst = list(map(int, input().split()))\r\nlst.sort()\r\nAns = 2\r\nfor i in range(1, n):\r\n if lst[i] - lst[i - 1] > 2 * d:\r\n Ans += 2\r\n elif lst[i] - lst[i - 1] == 2 * d:\r\n Ans += 1\r\nprint(Ans)\r\n", "n,d = map(int, input().split())\n\nhotels = list(map(int, input().strip().split()))\n\ncurr = 0\nprev = hotels[0]\nres = 2\n\nfor i in range(1,n):\n\tcurr = hotels[i]\n\tdiff = curr - prev\n\tdist = 2*d\n\n\tif diff == dist:\n\t\tres+=1\n\telif diff > dist:\n\t\tres+=2\n\telse:\n\t\tpass\n\n\tprev = curr\n\nprint(res)\n", "import sys\r\nimport os\r\n\r\ndef sonyaAndHotels(n, d, points):\r\n result = 1\r\n first = True\r\n for pt in points:\r\n if not first:\r\n if pt - d == now:\r\n result += 1\r\n now = pt + d\r\n elif pt - d > now:\r\n result += 2\r\n now = pt + d\r\n first = False\r\n\r\n return result + 1\r\n\r\ndef main():\r\n n, d = (int(x) for x in input().split())\r\n points = [int(x) for x in input().split()]\r\n print(sonyaAndHotels(n, d, points))\r\n\r\nif __name__ == '__main__':\r\n main()", "a, d = map(int, input().split())\nmass = list(map(int, input().split()))\ncnt = 2\nfor i in range(0, a-1):\n if mass[i+1] - mass[i] > 2*d:\n cnt += 2\n elif mass[i+1] - mass[i] == 2*d:\n cnt += 1\nprint(cnt)", "n,d = map(int,input().split())\r\nL = list(map(int, input().split()))\r\nc = 0\r\nfor i in range(1,n):\r\n if L[i]-L[i-1] == 2*d :\r\n c += 1\r\n elif L[i]-L[i-1] > 2*d :\r\n c += 2\r\nprint(c+2)", "import math\r\nn,d = map(int,input().split())\r\nx = list(map(int,input().split()))\r\ncnt = 2\r\nfor i in range(n-1):\r\n dif = abs((x[i])-(x[i+1]))\r\n #print(\"dif: \",dif,\" x[i]+d: \",x[i]+d,\" x[i+1]: \",x[i+1])\r\n if(dif==2*d):\r\n cnt+=1\r\n elif(dif>2*d):\r\n cnt+=2\r\n #print(\"cnt: \",cnt)\r\nprint(cnt)\r\n \r\n \r\n", "n, d = [int(s) for s in input().split(\" \")]\r\nnumbers = [int(s) for s in input().split(\" \")]\r\nanswer = 2\r\nfor i in range(0,len(numbers)-1):\r\n x = (numbers[i+1] - numbers[i])-2*d\r\n if x>0:\r\n answer+=2\r\n elif x==0:\r\n answer+=1\r\nprint(answer)\r\n\r\n", "input1 = input()\nn = int(input1.split()[0])\nd = int(input1.split()[1])\ncoor = [int(num) for num in input().split()]\nsum = 0\nfor i in range(n-1):\n\tif(coor[i+1]-coor[i] == 2*d):\n\t\tsum = sum+1\n\tif(coor[i+1]-coor[i] > 2*d):\n\t\tsum = sum+2\nprint(sum+2)", "n, d = map(int, input().split())\r\na = list(map(int, input().split()))\r\ns = set()\r\ns.add(a[0] - d)\r\ns.add(a[-1] + d)\r\nfor i in range(1, n):\r\n if a[i-1] + d + d <= a[i]:\r\n s.add(a[i-1] + d)\r\n s.add(a[i] - d)\r\nprint(len(s))", "import sys\r\n\r\nn = (input().split())\r\nnumber_of_hotels = int(n[0])\r\ndistance = int(n[1])\r\n\r\nhotel_coordinates = [int(x) for x in input().split()]\r\nhotel_coordinates_length = len(hotel_coordinates)\r\n\r\nsorted(hotel_coordinates)\r\n\r\npossible_cities = 2 \r\ni=0\r\nfor i in range(hotel_coordinates_length-1):\r\n if abs(hotel_coordinates[i] - hotel_coordinates[i+1]) == 2*distance:\r\n possible_cities += 1\r\n elif abs(hotel_coordinates[i] - hotel_coordinates[i+1]) > 2*distance:\r\n possible_cities += 2\r\n \r\nprint(possible_cities)", "import sys\r\n\r\ndef check(a, d, v):\r\n min_dist = 400000000000\r\n\r\n for i in a:\r\n min_dist = min(min_dist, abs(i - v))\r\n \r\n if min_dist == d:\r\n return True\r\n \r\n return False\r\n \r\nif __name__ == \"__main__\":\r\n n, d = (int(x) for x in sys.stdin.readline().split())\r\n a = [int(x) for x in sys.stdin.readline().split()]\r\n ans = set()\r\n \r\n for v in a:\r\n if check(a, d, v - d):\r\n \tans.add(v - d)\r\n \r\n if check(a, d, v + d):\r\n \tans.add(v + d)\r\n \r\n print(len(ans))\r\n", "import sys\r\nn,d=map(int,sys.stdin.readline().split())\r\nl=list(map(int,input().strip().split(\" \")))\r\n\r\n#p=[]\r\ncount=0\r\ni=1\r\nfor j in range(n-1):\r\n \r\n val=l[i]-l[i-1]\r\n \r\n #print(l[i],\"-\",l[i-1],\" so val=\",val)\r\n if (val>=2*d):\r\n \r\n # print(\"val>=2*d\")\r\n count+=1\r\n #if (val==2*d):\r\n # print(\"val is 2*d so count++\",count+1)\r\n # count+=1\r\n \r\n if(val>2*d):\r\n # print(\"val>2*d so count++\",count+1)\r\n count+=1\r\n \r\n else:\r\n pass\r\n \r\n \r\n #print(\"\\n\\n\")\r\n i+=1\r\n \r\ncount+=2 \r\nprint(count)\r\n \r\n \r\n \r\n", "n, d = map(int, input().split())\nx = list(map(int, input().split()))\n\nans = 2\nfor i in range(n - 1):\n if x[i + 1] - x[i] == 2 * d:\n ans += 1\n elif x[i + 1] - x[i] > 2 * d:\n ans += 2\nprint(ans)\n", "n,d=list(map(int,input().split()))\r\narr=list(map(int,input().split()))\r\ncount=2\r\nfor i in range(n-1):\r\n if arr[i+1]-arr[i]>2*d:\r\n count+=2\r\n elif arr[i+1]-arr[i]==2*d:\r\n count += 1\r\n\r\nprint(count)", "# Hydro submission #615475606f84bc7c1bfa551f@1632925024181\na = input().split()\r\nb = input().split()\r\nn = int(a[0])\r\nk = int(a[1])\r\narr=[]\r\nfor i in b:\r\n arr.append(int(i))\r\n pass\r\nres=0\r\nres=+2\r\nfor i in range(1,n):\r\n if arr[i]-arr[i-1]==k*2:\r\n res+=1\r\n elif arr[i]-arr[i-1]>k*2:\r\n res+=2\r\nprint(res)", "n,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=2\r\nfor x in range(n-1):\r\n\td=l[x+1]-l[x]\r\n\tif d==2*b:\r\n\t s+=1\r\n\telif d>2*b:\r\n\t s+=2\r\nprint(s)", "nd = [int(x) for x in input().split()]\r\n\r\nlist = [int(x) for x in input().split()]\r\n\r\nn=nd[0]\r\nd=nd[1]\r\n\r\ninitialSize = n \r\nmin = 2 \r\ni=0\r\nfor i in range (n-1):\r\n if list[i+1]-list[i]-2*d >0 :\r\n min+= 2\r\n elif list[i+1]-list[i]-2*d == 0: \r\n min+=1\r\n\r\n\r\nprint (min)", "n,d=[int(i) for i in input().split()]\r\nx=[int(i) for i in input().split()]\r\nt=2\r\nfor i in range(n-1):\r\n z=x[i+1]-x[i]\r\n if z>=2*d:\r\n if z==2*d:\r\n t+=1\r\n else:\r\n t+=2\r\nprint(t)\r\n", "n, d = map(int, input().split())\r\nhotels = list(map(int, input().split()))\r\ncount = 2\r\nfor i in range(0, n - 1):\r\n q = 0\r\n if (int(hotels[i]) + d) <= (int(hotels[i + 1]) - d):\r\n if (int(hotels[i]) + d == int(hotels[i + 1]) - d):\r\n count += 1\r\n else:\r\n count += 2\r\nprint(count)", "temp = [int(x) for x in input().split()]\r\nx, d = temp[0], temp[1]\r\narr = [int(x) for x in input().split()]\r\ntotal_points = 2\r\nfor i in range(1, len(arr)):\r\n if(arr[i] - arr[i-1] > 2*d):\r\n total_points += 2\r\n elif(arr[i] - arr[i-1] >= 2*d):\r\n total_points += 1\r\nprint(total_points)", "a,b=map(int,input().split())\r\nc=[int(c) for c in input().split()]\r\nd=0\r\nfor i in range(a-1):\r\n if(abs(c[i]-c[i+1])<2*b):\r\n d+=0\r\n elif(abs(c[i]-c[i+1])==2*b):\r\n d+=1\r\n else:\r\n d+=2\r\nd+=2\r\nprint(d)\r\n", "n,d = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = []\r\ncount = 2\r\nfor i in range(1,len(a)):\r\n dis = (a[i])-(a[i-1]) \r\n if dis > 2*d:\r\n count +=2\r\n elif dis == 2*d:\r\n count += 1\r\nprint(count)", "n,d=map(int,input().split())\r\ns=list(map(int,input().split()))\r\nans=2\r\nfor i in range(n-1):\r\n x=s[i]+d\r\n y=s[i+1]-d\r\n if abs(x-s[i+1])>=d:\r\n ans+=1\r\n if abs(y-s[i])>=d and x!=y:\r\n ans+=1\r\nprint(ans)\r\n", "n,d=map(int,input().split())\r\nl=sorted(list(map(int,input().split())))\r\ncount=0\r\nfor i in range(0,n-1):\r\n\tif l[i+1]-l[i]>(2*d-1) and l[i+1]-l[i]<(2*d+1):\r\n\t\tcount+=1\r\n\telif l[i+1]-l[i]>=(2*d+1):\r\n\t\tcount+=2\r\ncount+=2\r\nprint(count)", "# import sys\r\n# sys.stdin=open('F:\\\\C\\\\Script\\\\input.txt','r')\r\n# sys.stdout=open('F:\\\\C\\\\Script\\\\output.txt','w')\r\n# sys.stdout.flush()\r\n\r\ndef I():\r\n\treturn [int(i) for i in input().split()]\r\n\r\nn , d = I()\r\nl = I()\r\n\r\ncount = 2\r\nfor i in range(n - 1):\r\n\tif l[i] + d <= l[i+1] - d:\r\n\t\tcount += 1 \r\n\tif l[i + 1] - d > l[i] + d:\r\n\t\tcount += 1 \r\nprint (count)\r\n", "n,m = map(int,input().split())\r\na = [int(x) for x in input().split()]\r\nt = 2\r\nfor i in range(1,n):\r\n f = a[i] - a[i-1]\r\n if(f == 2*m):\r\n t+=1\r\n if(f > 2*m):\r\n t+=2\r\nprint(t)", "import sys\ninput = sys.stdin.readline\n\nn, d = [int(i) for i in input().split()]\nx = [int(i) for i in input().split()]\nc = 2\nfor i in range(1, n):\n if x[i] - x[i - 1] > 2 * d:\n c += 2\n elif x[i] - x[i - 1] == 2 * d:\n c += 1\nprint(c)\n", "nd = list(map(int, input().strip().split()))\r\nn = nd[0]\r\nd = nd[1]\r\nlst = list(map(int, input().split()))\r\ncount = 2\r\nif n != 1:\r\n for i in range(n - 1):\r\n #print(lst[i])\r\n if (lst[i+1] - lst[i]) == 2 * d:\r\n count += 1\r\n elif (lst[i+1] - lst[i]) > 2 * d:\r\n count += 2\r\nprint(count)", "l=input().split()\r\nn=int(l[0])\r\nd=int(l[1])\r\na=input().split()\r\nlis=[]\r\ncount=0\r\nfor i in range(0,len(a)-1):\r\n\ttemp1=-1*(int(a[i])-int(a[i+1]))\r\n\ttemp1=temp1-1\r\n\ttemp1=temp1-2*(d-1)\r\n\tif(temp1==1):\r\n\t\tcount=count+temp1\r\n\tif(temp1>=2):\r\n\t\tcount=count+2\r\ncount=count+2\r\n\r\n\r\nprint(count)", "n, k = map(int, input().split())\n\nv = [int(i) for i in input().split()]\n\nres = 2\nfor i in range(1, n):\n if (v[i] - v[i-1])/2 > k:\n res += 2\n elif (v[i] - v[i-1])/2 == k:\n res += 1\n\nprint(res)\n", "i=lambda:[*map(int,input().split())]\r\nd=i()[1]\r\na=i()\r\nprint(len(set([x+y for y in[-d,d]for x in a if min(abs(x+y-z) for z in a)==d])))", "n, d = [int(i) for i in input().split()]\r\ns = [int(i) for i in input().split()]\r\n\r\nt = 2\r\n#print(s[0] - d)\r\n#print(s[n-1] + d)\r\n\r\n\r\nfor i in range(1, n):\r\n if(s[i] - s[i-1] >= 2*d):\r\n if(s[i] - s[i-1] == 2*d):\r\n t+=1\r\n #print(s[i-1] + d)\r\n else:\r\n t+=2\r\n #print(s[i-1] + d)\r\n #print(s[i] - d)\r\nprint(t)\r\n", "import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools\nimport random\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 [list(map(int, l.split())) for l in sys.stdin.readlines()]\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)\ndef pe(s): return print(str(s), file=sys.stderr)\n\n\ndef main():\n n,d = LI()\n a = sorted(LI())\n r = 2\n for i in range(n-1):\n t = a[i+1] - a[i]\n if t > d*2:\n r += 2\n elif t == d*2:\n r += 1\n\n return r\n\n\nprint(main())\n\n\n", "n, dist = map(int, input().split())\nlocs = list(map(int, input().split()))\n\ndef f(A):\n c = 0\n for i, k in enumerate(A):\n if i == 0 or k - dist >= A[i - 1] + dist:\n c += 1\n if i == len(A) - 1 or k + dist < A[i + 1] - dist:\n c += 1\n return c\n\nans = f(locs)\nprint(ans)\n", "line = input().split()\r\nn = int(line[0])\r\nd = int(line[1])\r\n\r\nx = [int(xi) for xi in input().split()]\r\n\r\nres = 2\r\nfor i in range(0, n - 1):\r\n if x[i + 1] - x[i] == 2 * d:\r\n res += 1\r\n elif x[i + 1] - x[i] > 2 * d:\r\n res += 2\r\n\r\nprint(res)\r\n", "n,k = map(int,input().split(' '))\r\na = list(map(int,input().split(' ')))\r\n\r\nc = 2\r\nz = {}\r\nfor i in range(0,n-1):\r\n if a[i]+k < a[i+1]-k:\r\n c = c+2\r\n if a[i]+k == a[i+1]-k:\r\n c = c+1\r\nprint(c)\r\n", "def main():\r\n #string input()\r\n #strList input().split()\r\n #integer int(input())\r\n n, d = map(int, input().split())\r\n x = list(map(int, input().split()))\r\n ret = 2\r\n for i in range(n - 1):\r\n if x[i + 1] - x[i] >= 2 * d:\r\n ret += 1 + (x[i + 1] - x[i] >= 2 * d + 1)\r\n print(ret)\r\n return 0\r\nmain()\r\n", "n, d = map(int, input().split(' '))\ns = list(map(int, input().split(' ')))\n\nres = 0\n\nfor i in range(1,n):\n x = s[i] - s[i-1]\n if x > 2*d:\n res += 2\n elif x == 2*d:\n res += 1\n\nprint(res+2)", "R=lambda:map(int,input().split())\nn,d=R()\nr=2\na=R()\np=next(a)\nfor x in a:\n r+=(x-p>=d*2)+(x-p>d*2);p=x\nprint(r)", "n, d = map(int, input().split())\r\nx = list(map(int, input().split()))\r\n\r\nans = 2\r\n\r\nfor i in range(n - 1):\r\n if x[i+1] - x[i] == 2*d:\r\n ans += 1\r\n elif x[i+1] - x[i] > 2*d:\r\n ans += 2\r\n \r\nprint(ans)", "\r\nn, d = map(int,input().split())\r\n\r\ndata = list(map(int,input().split()))\r\n\r\nans = 1\r\n\r\nfor i in range(n):\r\n if i == 0:\r\n ans += 1\r\n continue\r\n if (data[i] - data[i - 1] >= 2*d):\r\n if data[i] - data[i - 1] != 2 * d:\r\n ans += 2\r\n else:\r\n ans +=1\r\n \r\nprint(ans)\r\n", "a,b=map(int,input().split());k=list(map(int,input().split()));c=2\r\nfor i in range(a-1):z=abs(k[i]-k[i+1]);c+=2 if z>2*b else 1 if z==2*b else 0\r\nprint(c)", "n,d=input().split(); n,d= int(n),int(d); li1= list(map(int, input().split()))\r\n\r\n\r\npagol= len(li1); coun=2\r\nfor i in range(pagol-1):\r\n aa= (abs(li1[i]-li1[i+1])-1)-((d-1)*2)\r\n if aa>0 and aa<2: coun+=1\r\n elif aa>0 and aa>=2: coun+=2\r\n \r\nprint(coun)", "inputs = [int(num) for num in input().split()]\r\nn = inputs[0]\r\nd = inputs[1]\r\nlist1 = [int(num) for num in input().split()]\r\nc=0\r\nflag1=0\r\nflag2=0\r\nfor i in range(0,len(list1)):\r\n p1 = list1[i]+d\r\n p2 = list1[i]-d\r\n if(i+1<len(list1) ):\r\n if(list1[i+1]>=p1+d):\r\n c+=1\r\n \r\n else:\r\n c+=1\r\n \r\n if(i-1>=0):\r\n if(list1[i-1]<p2-d):\r\n c+=1\r\n \r\n else:\r\n c+=1\r\n \r\nprint(c)", "n, d = [int(x) for x in input().split()]\r\nhotels = [int(x) for x in input().split()]\r\n\r\nk = 2\r\n\r\nfor i in range(len(hotels) - 1):\r\n g = hotels[i + 1] - hotels[i]\r\n if g - d >= d:\r\n if hotels[i + 1] - d == hotels[i] + d:\r\n k += 1\r\n else:\r\n k += 2\r\n\r\nprint(k)", "n, d = list(map(int, input().split()))\r\ns = list(map(int, input().split()))\r\nt = 2\r\nfor i in range(n-1):\r\n if s[i+1] - s[i] == 2*d:\r\n t += 1\r\n if s[i+1] - s[i] > 2*d:\r\n t += 2\r\nprint(t)\r\n", "def solve():\r\n n, d = map(int, input().split())\r\n x = list(map(int, input().split()))\r\n # we can always build hotel to left of left-most hotel and right of right-most hotel\r\n ans = 2\r\n\r\n # loop from 0 to n characters\r\n for i in range(n-1):\r\n # compare i and i+1th character in string\r\n right_val = x[i+1]\r\n left_val = x[i]\r\n if right_val - left_val >= 2*d:\r\n ans += 2\r\n if right_val - left_val == 2*d:\r\n ans -= 1\r\n\r\n print(ans)\r\n\r\nsolve()", "n, d = [int(x) for x in input().strip().split()]\r\nx = [int(x) for x in input().strip().split()]\r\n\r\nd *= 2\r\nx.sort()\r\n\r\nans = 2\r\nfor i in range(len(x) - 1):\r\n diff = x[i+1] - x[i]\r\n if diff == d:\r\n ans += 1\r\n elif diff > d:\r\n ans += 2\r\n\r\nprint(ans)\r\n", "n, d=map(int,input().split())\na=input().split()\nfor i in range (n):\n a[i]=int(a[i])\nk=2\nfor i in range (n-1):\n if a[i+1]-a[i]>2*d:\n k+=2\n elif a[i+1]-a[i]==2*d:\n k+=1\nprint (k)\n", "n,x = map(int, input().split())\na = list(map(int, input().split()))\n\n\nd1 = [a[i+1]-a[i] for i in range(n-1) if a[i+1]-a[i] >= 2*x]\nd1 = 2 + sum([1 if di == 2*x else 2 for di in d1])\nprint(d1)", "n,d=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nans=2\r\nfor i in range(n-1):\r\n\tif a[i+1]-a[i]==2*d:\r\n\t\tans+=1\r\n\telif a[i+1]-a[i]>2*d:\r\n\t\tans+=2\r\nprint(ans)", "n,d = map(int, input().split())\r\nl = list(map(int,input().split()))\r\nif(n==len(l)):\r\n ans=[]\r\n for i in range(0,len(l)-1):\r\n ans.append(abs(l[i]-l[i+1]))\r\n #print(ans)\r\n d_new = 2*d\r\n count=0\r\n for i in ans:\r\n if(i-d_new>0):\r\n count=count+2\r\n elif(i-d_new==0):\r\n count=count+1\r\n else:\r\n count=count\r\n print(count+2)", "# n=int(input())\r\n# ns=[int(x) for x in input().split()]\r\nn,d=[int(x)for x in input().split()]\r\nns=[int(x)for x in input().split()]\r\nans=2*n\r\nfor i in range(1,n-1):\r\n if ns[i]-ns[i-1]<=2*d:\r\n # print(ns[i],' left')\r\n ans-=1\r\n if ns[i+1]-ns[i]<2*d:\r\n # print(ns[i],' right')\r\n ans-=1\r\nif n>=2:\r\n if ns[1]-ns[0]<2*d:\r\n ans-=1\r\n if ns[-1]-ns[-2]<=2*d:\r\n ans-=1\r\nprint(ans)", "a,d= map(int,input().split())\nc = list(map(int,input().split()))\nl = []\nk = 0\nfor i in range(0,a):\n if i+1 < a:\n l.append(abs(c[i]-c[i+1]))\nd = 2*d\nfor i in range(0,len(l)):\n if l[i]>=d:\n k += 1\n if l[i]>d:\n k +=1\nprint(k + 2)\n \n \n", "n,k = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nans = 2\r\nfor i in range(n-1):\r\n if(l[i+1]-l[i]==2*k):\r\n ans+=1\r\n elif(l[i+1]-l[i]>2*k):\r\n ans+=2\r\nprint(ans)", "# -*- coding: utf-8 -*-\r\nimport math\r\n\r\ndef problem(in1, in2):\r\n inp1 = list(map(int, in1.split()))\r\n n = inp1[0]\r\n min_dist = inp1[1]\r\n\r\n points = list(map(int, in2.split()))\r\n \r\n result = 2\r\n \r\n min_gap = min_dist * 2 - 1\r\n \r\n for i, point in enumerate(points[1:]):\r\n dist = point - points[i]\r\n \r\n possible = dist - min_gap\r\n\r\n if possible == 1:\r\n result += 1\r\n if possible >= 2:\r\n result += 2\r\n \r\n return result;\r\n\r\nif __name__ == '__main__':\r\n in1 = input()\r\n in2 = input()\r\n\r\n result = problem(in1, in2)\r\n\r\n print(result)\r\n\r\n", "n,distance = input().split()\r\nn = int(n)\r\ndistance = int(distance)\r\nlst=list(map(int,input().split()))\r\ni=0\r\ncount=2\r\nwhile i < len(lst)-1:\r\n diff=abs(lst[i]-lst[i+1])\r\n if diff // 2 >= distance:\r\n if diff % 2 == 0:\r\n diff1=diff/2\r\n if diff1 == distance:\r\n count+=1\r\n else:\r\n count+=2\r\n else:\r\n count+=2\r\n i+=1\r\nprint(count)\r\n\r\n", "total, diff = [int(x) for x in input().split(\" \")]\r\n\r\nhotel = [int(x) for x in input().split(\" \")]\r\n\r\nout = 1\r\npast = hotel[0]\r\nfor x in range(1, total):\r\n curr = hotel[x]\r\n d = curr-past-2*diff+1\r\n past = curr\r\n if(d>0 and d<=2):\r\n out+=d\r\n elif(d>2):\r\n out+=2\r\nprint(out+1)", "import math\r\nn,d=map(int,input().split())\r\np=list(map(int,input().split()))\r\nq=[]\r\nfor i in range(len(p)-1):\r\n q.append(abs(p[i+1]-p[i]))\r\ncount=0\r\n##print(q)\r\nfor k in q:\r\n if k==2*d:\r\n count+=1\r\n elif k>=2*d:\r\n count+=2\r\n## print(k,\"-\",count)\r\n## print(count,math.floor(k/2),math.floor((k/2)/d)*2)\r\n \r\nprint(count+2)\r\n", "X = list(map(int, input().split()))\r\nHouses = list(map(int, input().split()))\r\nNUM = 0\r\nfor i in range(len(Houses) - 1):\r\n if abs(Houses[i + 1] - Houses[i]) >= 2 * X[1]:\r\n NUM += (1 if abs(Houses[i + 1] - Houses[i]) == 2 * X[1] else 2)\r\nprint(NUM + 2)\r\n", "n, m = input().split()\r\na = [int(i)for i in input().split()]\r\nd = int(m)\r\nd+=d\r\nans = 2\r\nfor i in range(0,int(n)-1):\r\n if a[i+1]-a[i]==d:\r\n ans+=1\r\n elif a[i+1]-a[i]>d:\r\n ans+=2\r\nprint(ans)", "a=input().split()\r\nn=int(a[0])\r\nd=int(a[1])\r\nb=input().split()\r\ncount=2\r\nfor i in range(n-1):\r\n if(int(b[i])+d <= int(b[i+1])-d):\r\n count+=1\r\n if(int(b[i+1])-d > int(b[i])+d):\r\n count+=1\r\nprint(count)", "n, d = map(int, input().split())\r\nhotels = list(map(int, input().split()))\r\ncount = 2\r\nfor i in range(n - 1):\r\n if (hotels[i + 1] - hotels[i]) / (2 * d) == 1:\r\n count += 1\r\n elif (hotels[i + 1] - hotels[i]) / (2 * d) > 1:\r\n count += 2\r\nprint(count)\r\n", "n, d = map(int, input().split())\r\nx = list(map(int, input().split()))\r\n\r\ndd = 2 * d\r\nans = 2\r\nfor i, el in enumerate(x[:-1], 1):\r\n t = x[i] - el\r\n\r\n if t == dd:\r\n ans += 1\r\n\r\n elif t > dd:\r\n ans += 2\r\n\r\nprint(ans)\r\n", "n ,d=map(int,input().split())\r\n\r\nli = list(map(int,input().split()))\r\n\r\nans=2\r\nlength=len(li)\r\nfor i in range(0,length-1):\r\n dif=li[i+1]-li[i]\r\n if dif==2*d:\r\n ans+=1\r\n elif dif>2*d:\r\n ans+=2\r\n \r\n \r\n\r\n\r\nprint(ans)\r\n", "info = input().split()\r\nn = int(info[0])\r\nd = int(info[1])\r\n\r\nprev = input().split()\r\nprevlist = [int(i) for i in prev]\r\n\r\nnew = 2\r\nnewlist = list(map(lambda x,y:y-x, prevlist, prevlist[1:]))\r\ndoubleresult = list(filter(lambda x: x > 2*d, newlist))\r\nsingleresult = list(filter(lambda x: x == 2*d, newlist))\r\n\r\nnew += (len(doubleresult) * 2) + len(singleresult)\r\nprint(new)\r\n", "n, d = [int(i) for i in input().split()]\na = [int(i) for i in input().split()]\ncnt = 2\nfor i in range(n):\n\tif i != n - 1 and a[i] + d <= a[i + 1] - d:\n\t\tcnt += 1\n\t\t#print(a[i], end=' ')\n\tif i != 0 and a[i] - d > a[i - 1] + d:\n\t\tcnt += 1\n\t\t#print(a[i], end=' ')\nprint(cnt)\t", "n,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nt = 2\r\nfor i in range(1,n):\r\n di = a[i]-a[i-1]\r\n if(di==2*m):t+=1\r\n if(di>2*m):t+=2\r\nprint(t)\r\n", "def solve():\n n, d = map(int, input().strip().split())\n hotels = list(map(int, input().strip().split()))\n ans = 0\n for i in range(n - 1):\n if hotels[i + 1] - hotels[i] > 2 * d:\n ans += 2\n elif hotels[i + 1] - hotels[i] == 2 * d:\n ans += 1\n print(ans + 2)\n \n\nsolve()\n", "list0 = [int(a) for a in input(\"\").split()]\nn = list0[0]\nd = list0[1]\nD = input(\"\")\nnum = 2\nlist1 = [int(b) for b in D.split()]\nfor i in range(0, n-1):\n if list1[i+1] - list1[i] == d * 2:\n num += 1\n elif list1[i+1] - list1[i] > d * 2:\n num += 2\nprint(num)\n\n", "n,d = input().split(\" \")\r\na = input().split(\" \")\r\nj = 2\r\nn = int(n)\r\nd = int(d)\r\nz = 2*d\r\ns = set()\r\nfor i in range(n-1):\r\n if int(a[i+1]) - int (a[i]) >= z:\r\n s.add (str(int(a[i]) + d))\r\n s.add (str(int(a[i+1]) - d))\r\nprint (len(s) + 2)\r\n", "n, d = map(int, input().split())\narr = list(map(int, input().split()))\nans = 2\nfor i in range(1, n):\n diff = arr[i] - arr[i-1] - 2*d\n if not diff:\n ans += 1\n elif diff > 0:\n ans += 2\nprint(ans)\n", "n,k=[int(j) for j in input().split()]\r\nh=[int(j) for j in input().split()]\r\nhp=[j+k for j in h]\r\nhs=[j-k for j in h]\r\nx=[]\r\n# print(h)\r\n# print(hp)\r\n# print(hs)\r\nfor i in range(n-1):\r\n if abs(hp[i]-h[i+1])>=k:\r\n x.append(hp[i])\r\nx.append(hp[n-1])\r\nx.append(hs[0])\r\nfor i in range(n-1):\r\n if abs(hs[i+1]-h[i])>=k:\r\n x.append(hs[i+1])\r\n# print(x)\r\nprint(len(set(x)))\r\n", "n, d = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = []\r\nc = 2\r\nfor i in range(n - 1):\r\n dis = abs(a[i] - a[i + 1]) - 1\r\n if dis % 2 == 0:\r\n if dis // 2 >= d:\r\n c += 2\r\n else:\r\n if d > (dis + 1) // 2:\r\n c += 0\r\n continue\r\n c = c + 2 if (dis + 1)//2 > d else c + 1\r\nprint(c)", "n1,d1=input().split(\" \")\r\nn=int(n1)\r\nd=int(d1)\r\na1=[0]*n\r\na=[0]*n\r\ns=2\r\na1=input().split(\" \")\r\nfor i in range(n):\r\n a[i]=int(a1[i])\r\n if i>0 and i<n:\r\n if a[i-1]+d*2==a[i]:\r\n s+=1\r\n elif a[i-1]+d*2<a[i]:\r\n s+=2\r\nprint(s)\r\n", "n,d=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=2\r\nfor i in range(1,n):\r\n if l[i]-l[i-1]>=(d*2):\r\n if (l[i]-l[i-1])/(d*2)==1:\r\n c=c+1\r\n else:\r\n c=c+2\r\nprint(c)", "import sys\r\n\r\nn, d = (map(int, sys.stdin.readline().split()))\r\nhotel = list((map(int, sys.stdin.readline().split())))\r\nt = 2\r\nfor loop in range(n):\r\n if loop != 0 and hotel[loop]-d > hotel[loop-1]+d:\r\n t+=1\r\n if loop != n-1 and hotel[loop]+d <= hotel[loop+1]-d:\r\n t+=1\r\n\r\nprint(t)", "import sys\r\nimport math\r\n\r\n#to read string\r\nget_string = lambda: sys.stdin.readline().strip()\r\n#to read list of integers\r\nget_int_list = lambda: list( map(int,sys.stdin.readline().strip().split()) )\r\n#to read non spaced string and elements are integers to list of int\r\nget_intList_from_str = lambda: list(map(int,list(sys.stdin.readline().strip())))\r\n#to read non spaced string and elements are character to list of character\r\nget_charList_from_str = lambda: list(sys.stdin.readline().strip())\r\n#get word sepetared list of character\r\nget_char_list = lambda: sys.stdin.readline().strip().split() \r\n#to read integers\r\nget_int = lambda: int(sys.stdin.readline())\r\n#to print faster\r\npt = lambda x: sys.stdout.write(str(x))\r\n\r\n#--------------------------------WhiteHat010--------------------------------#\r\nn,d = get_int_list()\r\nlst = get_int_list()\r\ncount = 2\r\nfor i in range(1,n):\r\n if lst[i] - lst[i-1] == 2*d:\r\n count += 1\r\n elif lst[i] - lst[i-1] >= 2*d:\r\n count += 2\r\nprint(count)\r\n", "n, d = map(int, input().split())\r\nh, count = list(map(int, input().split())), 0\r\nfor i in range(n - 1):\r\n if h[i] + d == h[i + 1] - d:\r\n count += 1\r\n if h[i] + d < h[i + 1] - d:\r\n count += 2\r\nprint(count + 2)\r\n", "n, d = map(int, input().split())\n*a, = map(int, input().split())\ncounter = 2\nfor i in range(n - 1):\n if a[i + 1] - a[i] > 2 * d:\n counter += 2\n elif a[i + 1] - a[i] == 2 * d:\n counter += 1\nprint(counter)", "nd = input().split()\r\nn = int(nd[0])\r\nd = int(nd[1])\r\n\r\nhotels = sorted([int(i) for i in input().split()])\r\n\r\ncount = 2\r\n\r\nfor i in range(len(hotels) - 1):\r\n count += min(max(hotels[i+1] - hotels[i] - 2*d + 1, 0), 2)\r\n\r\n\r\nprint(count)\r\n", "n, d = [int(i) for i in input().split()]\r\n\r\nx = [int(i) for i in input().split()]\r\ncount = 0\r\nfor i in range(n):\r\n\r\n if i - 1 >= 0:\r\n\r\n if (x[i] - d) > x[i - 1] + d:\r\n count += 1\r\n if i + 1 < n:\r\n\r\n if (x[i] + d) <= x[i + 1] - d:\r\n count += 1\r\n\r\nprint(count + 2)\r\n", "a=[int(i) for i in input().split()]\r\nn=a[0]\r\nd=a[1]\r\na=[int(i) for i in input().split()]\r\na.sort()\r\ndiff=[]\r\nfor i in range(1,n):\r\n\tdiff.append(abs(a[i]-a[i-1]))\r\ncount=2\r\nfor i in range(n-1):\r\n\tif(diff[i]==2*d):\r\n\t\tcount+=1\r\n\tif(diff[i]>2*d):\r\n\t\tcount+=2\r\nprint(count)", "# cook your dish here\r\nn,d=input().split()\r\nn=int(n)\r\nd=int(d)\r\na=list(map(int,input().split()))\r\nb=[]\r\nb.append(a[0]-d)\r\nfor i in range(len(a)):\r\n if i!=0:\r\n if a[i]-2*d>=a[i-1]:\r\n b.append(a[i]-d)\r\n if i!=len(a)-1:\r\n if a[i]+2*d<=a[i+1]:\r\n b.append(a[i]+d)\r\nb.append(a[len(a)-1]+d)\r\nans=1\r\n#print(b)\r\nfor i in range(1,len(b)):\r\n if b[i]!=b[i-1]:\r\n ans+=1\r\nprint(ans)", "n, d = map(int, input().split())\narr = list(map(int, input().split()))\nif n == 1:\n ans = 2\nelse:\n s = set()\n s.add(arr[0] - d)\n s.add(arr[-1] + d)\n for i in range(n):\n if i == 0:\n if arr[i + 1] - arr[i] - d >= d:\n s.add(arr[i] + d)\n elif i == n - 1:\n if arr[i] - d - arr[i - 1] >= d:\n s.add(arr[i] - d)\n else:\n if arr[i + 1] - arr[i] - d >= d:\n s.add(arr[i] + d)\n if arr[i] - d - arr[i - 1] >= d:\n s.add(arr[i] - d)\n ans = len(s)\nprint(ans)\n", "import functools\r\nimport time\r\n\r\ndef timer(func):\r\n @functools.wraps(func)\r\n def wrapper(*args, **kwargs):\r\n stime = time.perf_counter()\r\n res = func(*args, **kwargs)\r\n elapsed = time.perf_counter() - stime\r\n print(f\"{func.__name__} in {elapsed:.4f} secs\")\r\n return res\r\n return wrapper\r\n\r\nclass solver:\r\n # @timer\r\n def __init__(self): \r\n n, d = map(int, input().strip().split())\r\n x = list(map(int, input().strip().split()))\r\n ans = set()\r\n for i in range(n):\r\n for z in [-d, d]:\r\n y = x[i] + z\r\n dmin = min(abs(y - xi) for xi in x)\r\n if dmin == d:\r\n ans.add(y)\r\n print(len(ans))\r\n\r\nsolver()", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Aug 29 20:14:03 2020\r\n\r\n@author: MridulSachdeva\r\n\"\"\"\r\n\r\nn, d = map(int, input().split())\r\ns = list(map(int, input().split()))\r\n\r\nplaces = 2\r\n\r\nfor i in range(len(s) - 1):\r\n if s[i + 1] - s[i] >= 2 * d:\r\n a1 = s[i + 1] - d\r\n a2 = s[i] + d\r\n if a1 == a2:\r\n places += 1\r\n else:\r\n places += 2\r\nprint(places)", "yoar= list(map(int,input().split()))\nn=yoar[0]\nd=yoar[1]\narr= list(map(int,input().split()))\narr.sort()\nans=2\nfor i in range(1,n):\n\tx1=arr[i-1]\n\tx2=arr[i]\n\tif x2-x1>2*(d):\n\t\tans+=2\n\telif x2-x1==2*d:\n\t\tans+=1\nprint(ans)\t\t\t", "n,d = [int(i) for i in input().split()]\r\nh = [int(i) for i in input().split()]\r\nh.sort()\r\n\r\nha = 0\r\nlc = []\r\n\r\nwhile ha != len(h):\r\n if ha == 0: #INICIO\r\n lc += [h[ha]-d]\r\n\r\n if ha > 0: #ATRAS\r\n if h[ha]-d > h[ha-1]+d:\r\n lc += [h[ha]-d]\r\n \r\n if ha+1 < len(h): #FRENTE\r\n if h[ha] + d <= h[ha+1]-d:\r\n lc += [h[ha] + d]\r\n \r\n if ha == len(h)-1: # FINAL\r\n lc += [h[ha]+d]\r\n\r\n ha += 1\r\n \r\nprint(len(lc))\r\n#print(lc)\r\n", "import sys\n\nn, d = [int(x) for x in input().split()]\nx = [int(x) for x in input().split()]\n\nres = 2\n\nfor i in range(len(x)):\n if i > 0 and abs(x[i] - d - x[i-1]) >= d:\n res += 1\n if i < len(x) - 1 and abs(x[i] + d - x[i+1]) > d:\n res += 1\n\nprint(res)\n", "n,d=map(int,input().split())\r\na=list(map(int,input().split()))\r\nc=2\r\nfor i in range(n-1):\r\n\tif a[i]+d<a[i+1]-d:\r\n\t\tc+=2\r\n\tif a[i]+d==a[i+1]-d:\r\n\t\tc+=1\r\nprint(c)\r\n", "def hotels(x,d):\r\n x=sorted(x)\r\n k = [x[0]-d]\r\n for i in range(1,len(x)):\r\n if x[i]-x[i-1]>2*d:\r\n k.append(x[i-1]+d)\r\n k.append(x[i]-d)\r\n elif x[i]-x[i-1]==2*d:\r\n k.append(x[i]+d)\r\n return len(k)+1\r\nn,d=map(int,input().split())\r\nx=[int(i) for i in input().split()]\r\nprint(hotels(x,d))", "n, d = map(int, input().split())\r\nx = list(map(int, input().split()))\r\n\r\nans = 2\r\n\r\nfor i in range(1, n):\r\n if x[i] - x[i-1] > 2*d:\r\n ans += 2\r\n elif x[i] - x[i-1] == 2*d:\r\n ans += 1\r\n else:\r\n continue\r\n\r\nprint(ans)", "n,d=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+1]-a[i]-(2*d)>0:\r\n\t\ts+=2\r\n\telif a[i+1]-a[i]-(2*d)==0:\r\n\t s+=1\r\nprint(s+2)\t", "q, w = map(int, input().split())\ne = list(map(int, input().split()))\nd = 0\nfor i in range(len(e) - 1):\n if e[i + 1] - e[i] > w * 2:\n d += 2\n elif e[i + 1] - e[i] == w * 2:\n d += 1\nprint(d + 2)\n", "def main():\r\n [n, d] = [int(_) for _ in input().split()]\r\n hotels = [int(_) for _ in input().split()]\r\n result = 2\r\n\r\n for i in range(n - 1):\r\n left = hotels[i] + d\r\n right = hotels[i + 1] - d\r\n\r\n result += 1 if left == right else 2 if left < right else 0\r\n\r\n print(result)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "a=input()\r\nb=a.split()\r\nn=int(b[0])\r\ndd=int(b[1])\r\nc=input()\r\nd=c.split()\r\nfor i in range(n):\r\n\td[i]=int(d[i])\r\nc=2\r\nfor j in range(1,n):\r\n\tif (d[j]-d[j-1]>2*dd):\r\n\t\tc+=2\r\n\telif (d[j]-d[j-1]==2*dd):\r\n\t\tc+=1\r\n\r\nprint (c)\r\n", "n, b = map(int, input().split())\r\nlst = [*map(int, input().split())]\r\nsum = 2\r\nfor x in range(n - 1):\r\n d = lst[x + 1] - lst[x]\r\n if d == 2 * b:\r\n sum += 1\r\n elif d > 2 * b:\r\n sum += 2\r\nprint(sum)\r\n", "n,d = map(int,input().split())\r\narr = list(map(int,input().split()))\r\narr.sort()\r\n\r\ncount = 2\r\n\r\nfor i in range(n):\r\n\tif i < n-1:\r\n\t\tif arr[i]+d <= arr[i+1]-d:\r\n\t\t\tcount += 1\r\n\tif i > 0 :\r\n\t\tif arr[i] - d > arr[i-1] + d:\r\n\t\t\tcount += 1\r\nprint(count)\r\n", "n, d = input().split()\r\nn=int(n)\r\nd=int(d)\r\narr=[int(x) for x in input().split()]\r\ncount = 2\r\nused = []\r\nfor i in range(0, n-1):\r\n distance = arr[i+1]-arr[i]\r\n if(distance>2*d):\r\n count+=2\r\n elif(distance==2*d):\r\n count+=1\r\nprint(count)", "n,d=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=set(l)\r\nans=2\r\nfor i in range(n-1):\r\n if l[i+1]-l[i]>2*d:\r\n ans+=2\r\n elif l[i+1]-l[i]==2*d:\r\n ans+=1\r\nprint(ans)\r\n \r\n ", "n, d = map(int, input().split())\r\nX = [-(10**10)] + list(map(int, input().split())) + [10**10]\r\nans = 0\r\np = 0\r\nfor i in range(1, n + 1):\r\n if abs(X[i - 1] - (X[i] - d)) > d:\r\n ans += 1\r\n if abs(X[i + 1] - (X[i] + d)) > d:\r\n ans += 1\r\n if abs(X[i - 1] - (X[i] - d)) == d:\r\n p += 1\r\n ans += 1\r\n if abs(X[i + 1] - (X[i] + d)) == d:\r\n p += 1\r\n ans += 1\r\np = p // 2\r\nans -= p\r\nprint(ans)", "def process(X, d):\r\n n = len(X)\r\n S = set([])\r\n for x in X:\r\n for hotel in [x-d, x+d]:\r\n min_dist = float('inf')\r\n for z in X:\r\n d2 = abs(hotel-z)\r\n min_dist = min(min_dist, d2)\r\n if min_dist==d:\r\n S.add(hotel)\r\n return len(S)\r\n\r\nn, d = [int(x) for x in input().split()]\r\nX= [int(x) for x in input().split()]\r\nprint(process(X, d))", "# Link: http://codeforces.com/contest/1004/problem/A\n# py3\n\nfrom __future__ import print_function\nimport sys\nimport math\nimport os.path\nimport random\nfrom copy import deepcopy\nfrom functools import reduce\n\n\nfrom collections import Counter, ChainMap, defaultdict\nfrom itertools import cycle, chain\nfrom queue import Queue, PriorityQueue\nfrom heapq import heappush, heappop, heappushpop, heapify, heapreplace, nlargest, nsmallest\nimport bisect\n\nfrom statistics import mean, mode, median, median_low, median_high\n\n\n# CONFIG\nsys.setrecursionlimit(10**9)\n\n# LOG \ndef log(*args, **kwargs):\n print(*args, file=sys.stderr, **kwargs)\n\n\n# INPUT\ndef ni():\n return map(int, input().split())\n\n\ndef nio(offset):\n return map(lambda x: int(x) + offset, input().split())\n\n\ndef nia():\n return list(map(int, input().split()))\n\n\n# CONVERT\ndef toString(aList, sep=\" \"):\n return sep.join(str(x) for x in aList)\n\n\ndef toMapInvertIndex(aList):\n return {k: v for v, k in enumerate(aList)}\n\n\n# SORT\ndef sortId(arr):\n return sorted(range(arr), key=lambda k: arr[k])\n\n\n# MAIN\n\nn, d = ni()\na = nia()\n\ns = set([])\n\nfor ai in a:\n s.add(ai-d)\n s.add(ai+d)\n\ndef check(x):\n for ai in a:\n if abs(ai - x) < d:\n return False\n return True\n\ncount = 0\nfor si in s:\n if check(si):\n count += 1\n\nprint(count)", "from collections import defaultdict\n\ndef solve():\n\ttotal = 2\n\tfor i in range(n-1):\n\t\tdistance = abs(coords[i] - coords[i+1])\n\t\tif distance > 2*d:\n\t\t\ttotal += 2\n\t\telif distance == 2*d:\n\t\t\ttotal += 1\n\t\telse:\n\t\t\tcontinue\n\treturn total\n\n\n\n\nn, d = [int(x) for x in input().split(' ')]\ncoords = [int(x) for x in input().split(' ')]\nhotels = defaultdict(int)\n\nfor i in range(n):\n\thotels[coords[i]] = 1\n# n = int(input())\n\nprint(solve())\n# print(hotels)\n\n", "x,y=map(int,input().split());a=list(map(int,input().split()))\r\nn=[0 if i<1 else 1 if i==1 else 2 for i in [a[i+1]-a[i]-2*y+1 for i in range(x-1)]]\r\nprint(sum(n)+2)", "n,d=list(map(int,input().split()))\r\na=sorted(list(map(int,input().split())))\r\nans=2\r\nfor i in range(1,n):\r\n if(a[i]-a[i-1]-2*d>0):\r\n ans+=2\r\n elif(a[i]-a[i-1]-2*d==0):\r\n ans+=1\r\nprint(ans)", "a,b = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nz = 2\r\nfor i in range(len(l)-1):\r\n\tif l[i+1]-l[i]>(2*b):z+=2\r\n\telif l[i+1]-l[i]==(2*b):z+=1\r\n\telse:pass\r\nprint(z)", "n, d = map(int, input().split())\r\nb = [int(x) for x in input().split()]\r\nans = 2\r\nfor i in range(1, n):\r\n if b[i] - b[i-1] == 2*d: ans += 1\r\n elif b[i] - b[i-1] > 2*d: ans += 2\r\nprint(ans)", "n,d=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ncount=2\r\nz=[l[0]-d,l[-1]+d]\r\nfor i in range(1,n):\r\n\tif (l[i-1]+d)<=(l[i]-d):\r\n\t\tz.append(l[i-1]+d)\r\n\t\tz.append(l[i]-d)\r\n# print(z)\r\nprint(len(set(z)))", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nka=2\r\nfor i in range(n-1):\r\n if(l[i+1]-l[i]==2*k):\r\n ka=ka+1\r\n elif(l[i+1]-l[i]>2*k):\r\n ka+=2\r\nprint(ka)", "n, d = map(int, input().split())\r\nalist = list(map(int, input().split()))\r\ncount = 2\r\n\r\nfor i in range(n - 1):\r\n if alist[i + 1] - alist[i] > 2*d:\r\n count += 2\r\n elif alist[i + 1] - alist[i] == 2*d:\r\n count += 1\r\n \r\nprint(count)", "n,d=map(int,input().split())\r\nu=0\r\nl=sorted(list(map(int,input().split())))\r\nfor i in range(n-1):\r\n k=l[i+1]-l[i]\r\n if k%2==0 and k//2==d:\r\n u=u+1\r\n \r\n elif k/2>d:\r\n u=u+2\r\n \r\nprint(u+2)", "n, d = map(int, input().split())\r\nx = list(map(int, input().split()))\r\nans = 2\r\nfor i in range(n - 1):\r\n if x[i] + d == x[i + 1] - d:\r\n ans += 1\r\n elif x[i] + d < x[i + 1] - d:\r\n ans += 2\r\nprint(ans)", "read = lambda: map(int, input().split())\r\nn, d = read()\r\nx = sorted(read())\r\nans = 2\r\nfor i in range(1, n):\r\n dx = x[i] - x[i - 1]\r\n if dx == 2 * d:\r\n ans += 1\r\n elif dx > 2 * d:\r\n ans += 2\r\nprint(ans)", "n,d=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=2\r\nif n>1:\r\n for i in range(1,n):\r\n if l[i]-l[i-1]==2*d:\r\n c+=1\r\n if l[i]-l[i-1]>2*d:\r\n c+=2\r\nprint(c)\r\n", "n,d=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\nct=2\r\nfor i in range(len(a)-1):\r\n if(a[i]+d<a[i+1]-d):\r\n ct+=2\r\n elif a[i]+d == a[i+1] - d:\r\n ct+=1\r\nprint(ct)\r\n", "def ii():\r\n return int(input())\r\ndef mi():\r\n return map(int, input().split())\r\ndef li():\r\n return list(mi())\r\n\r\nn, d = mi()\r\na = li()\r\na.sort()\r\nans = set()\r\nfor i in range(n):\r\n x = a[i] - d\r\n y = a[i] + d\r\n if i == 0 or a[i - 1] <= x - d:\r\n ans.add(x)\r\n if i == n - 1 or y + d <= a[i + 1]:\r\n ans.add(y)\r\nprint(len(ans))", "n, d = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nl = set()\r\nfor i in a:\r\n x = i + d\r\n r = 100000000000\r\n for j in a:\r\n r = min(abs(x - j), r)\r\n if r == d:\r\n l.add(x)\r\n x = i - d\r\n r = 100000000000\r\n for j in a:\r\n r = min(abs(x - j), r)\r\n if r == d:\r\n l.add(x)\r\nprint(len(l))", "n,d=[*map(int,input().split())]\r\nlo=[*map(int,input().split())]\r\nlo=sorted(lo)\r\nans=2\r\nlo1=[]\r\nfor i in range(n-1):\r\n\tlo1.append(lo[i+1]-lo[i])\r\nfor i in lo1:\r\n\tif i>2*d:\r\n\t\tans+=2\r\n\telif i>=2*d:\r\n\t\tans+=1\r\n\telse:\r\n\t\tpass\r\nprint(ans)\t", "n, d = map(int, input().split())\r\nhot = [int(x) for x in input().split()]\r\ntot = 2\r\nfor i in range(1,n):\r\n if hot[i]-hot[i-1] >= 2*d:\r\n tot+=2\r\n if hot[i] - hot[i-1] == 2*d:\r\n tot-=1\r\nprint(tot)\r\n" ]

[ "n = int(input())\nt, c = [], []\n\nfor _ in range(n):\n ti, ci = map(int, input().split())\n t.append(ti + 1)\n c.append(ci)\n\ndp = [[float('inf') for _ in range(n + 1)] for _ in range(n + 1)]\n\nfor i in range(n + 1):\n dp[i][0] = 0\n\nfor i in range(1, n + 1):\n for j in range(1, n + 1):\n dp[i][j] = min(dp[i - 1][j], c[i - 1] + (dp[i - 1][j - t[i - 1] if j - t[i - 1] >= 0 else 0]))\n\nprint(dp[n][n])\n \t\t \t\t \t\t \t \t\t \t\t \t \t \t\t", "def main():\r\n n = int(input())\r\n dp1 = [float('inf') for _ in range(n + 1)]\r\n dp1[0] = 0\r\n for i in range(n):\r\n ti, ci = map(int, input().split())\r\n dp2 = [0 for _ in range(n + 1)]\r\n ti += 1\r\n for j in range(n, 0, -1):\r\n if ti < j:\r\n dp2[j] = min(dp1[j - ti] + ci, dp1[j])\r\n else:\r\n dp2[j] = min(dp1[0] + ci, dp1[j])\r\n dp1 = dp2\r\n\r\n print(dp1[-1])\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\nt = [0]*(n+1)\nc = [0]*(n+1)\nv = 0\n\nfor i in range(1, n+1):\n t[i], c[i] = map(int, input().split())\n v = max(v, t[i])\n \nv += n\ndp = [float('inf')]*(v+1)\ndp[0] = 0\n\nfor i in range(1, n+1):\n for j in range(v, t[i]-1, -1):\n dp[j] = min(dp[j], dp[j-t[i]-1]+c[i])\n\nans = float('inf')\nfor i in range(n, v+1):\n ans = min(ans, dp[i])\n\nprint(ans)", "n = int(input())\ndp = [float('inf')] * (n+1)\ndp[0] = 0\nfor i in range(n):\n t, c = tuple(int(x) for x in input().split())\n for j in range(n)[::-1]:\n dp[min(n,j+t+1)] = min(dp[min(n,j+t+1)],dp[j]+c)\nprint(dp[n])\n\t\t \t \t \t \t \t\t\t \t\t \t\t\t\t", "n=int(input())\r\n\r\nDP=[1<<60]*(2*n+2)\r\nDP[n+1]=0\r\n\r\nfor i in range(n):\r\n t,c=map(int,input().split())\r\n NDP=[1<<60]*(2*n+2)\r\n\r\n for j in range(2*n+2):\r\n if j+1<2*n+2:\r\n NDP[j+1]=min(DP[j],NDP[j+1])\r\n NDP[max(0,j-t)]=min(NDP[max(0,j-t)],DP[j]+c)\r\n\r\n DP=NDP\r\n\r\nANS=min(DP[:n+2])\r\n\r\nprint(ANS)\r\n", "# LUOGU_RID: 99512327\n# Problem: Checkout Assistant\r\n# Contest: Luogu\r\n# URL: https://www.luogu.com.cn/problem/CF19B\r\n# Memory Limit: 250 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 math import sqrt, gcd, inf\r\nfrom array import *\r\nfrom functools import lru_cache\r\nfrom types import GeneratorType\r\nfrom heapq import *\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://www.luogu.com.cn/problem/CF19B\r\n输入n(1≤n≤2000)代表n件商品,\r\n然后输入n行t(0<=t<=2000),c(1<=c<=1e9)代表扫描时间和商品花费\r\n当你花费c购买一件商品时，可以偷走尚未购买的其它t件商品。\r\n求最少花多少钱可以买完n件商品。\r\n\r\n输入\r\n4\r\n2 10\r\n0 20\r\n1 5\r\n1 3\r\n输出\r\n8 \r\n\"\"\"\r\n\"\"\"01背包\r\n对于每件已购买商品，他实际能提供t+1件贡献。\r\n假设我们最终实际花钱买了k件商品，我们需要这k件商品总贡献>=n。\r\n把贡献看做体积V，我们从商品里选择，看看超过n的体积下最少花费是多少。\r\n体积上限应该是n+max(t),即超过n的部分不用再接着算了，但这个没超的还要\r\n\"\"\"\r\n\r\n\r\n# ms\r\ndef solve():\r\n n, = RI()\r\n a = []\r\n v = 0\r\n for _ in range(n):\r\n a.append(RILST())\r\n if a[-1][0] > v:\r\n v = a[-1][0]\r\n v += n\r\n f = [0]+[inf]*v\r\n for t,c in a:\r\n for j in range(v,t,-1):\r\n f[j] = min(f[j],f[j-t-1]+c)\r\n print(min(f[n:]))\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "from math import inf\r\n\r\nn = int(input())\r\nF = [inf]*(n+1)\r\nF[0] = 0\r\nfor i in range(n):\r\n t, c = map(int, input().split())\r\n for j in range(n-1, -1, -1):\r\n w = min(j+t+1, n)\r\n F[w] = min(F[w], F[j]+c)\r\nprint(F[n])\r\n\r\n # F[i][j] = min(F[i][j], F[i][j-t-1])\r\n\r\n", "n=int(input())\nar=[float('inf')]*(n+1)\nar[0]=0\nfor i in range(n):\n t,c=map(int,input().split())\n for j in range(n-1,-1,-1):\n w=min(j+t+1,n)\n ar[w]=min(ar[w],ar[j]+c)\nprint(ar[n])\n \t \t \t\t \t\t\t\t \t\t \t \t\t \t\t\t", "inf = float(\"inf\")\r\nn=int(input())\r\ntime, val =[0], [0]\r\nans=[inf for i in range(n+1)]\r\nans[0]=0\r\nfor i in range(n):\r\n timeInp,valInp= [int(x) for x in input().split()]\r\n timeInp+=1#timeInp+=2\r\n time.append(timeInp)\r\n val.append(valInp)\r\nfor i in range(1,n+1):\r\n for j in range(n,0,-1):\r\n ans[j]=min(ans[j],ans[max(0,j-time[i])]+val[i])#(manter, pagarval[i] e liberar espaco)\r\nprint(ans[n])\r\n \r\n", "\r\nn = int(input())\r\nt, c = [], []\r\nfor i in range(n):\r\n tt, cc = list(map(int, input().split()))\r\n t.append(tt)\r\n c.append(cc)\r\n\r\ndef find(i: int, cnt: int) -> int:\r\n if cnt >= n: return 0\r\n if i == n: return int(1e18)\r\n return min(find(i + 1, cnt), c[i] + find(i + 1, cnt + 1 + t[i]))\r\n\r\nf = [int(1e18)] * (n + 1)\r\nf[0] = 0\r\n# f(n) - min price for n goods\r\n# for every ITEM(c, t) do:\r\n# f(i) = f(i - t[i] - 1) + c[i]\r\nfor i in range(n):\r\n for j in range(len(f))[::-1]:\r\n f[j] = min(f[j], f[max(0, j - t[i] - 1)] + c[i])\r\n\r\nprint(f[-1])\r\n# min: (i + 1, cnt) || c + (i + 1, cnt + t + 1)" ]

[ "import math\r\nn = int(input())\r\nsum=n\r\nx = n\r\nwhile (x!=1):\r\n f = True\r\n for i in range(2,int(math.sqrt(x))+1):\r\n if x%i==0:\r\n x=x//i\r\n f = False\r\n break\r\n if f:\r\n x = 1\r\n sum+=x\r\nprint(sum)", "def min_div(num):\r\n\tfor i in range(2,int(num**0.5)+1):\r\n\t\tif num % i == 0:\r\n\t\t\treturn i\r\n\t\r\n\treturn 1\r\n\r\nn = int(input())\r\ncount = n\r\n\r\n\r\nwhile min_div(n)!=1:\r\n\tn = n//min_div(n)\r\n\tcount += n\r\ncount += 1\r\n\r\nprint(count)", "def sieve(x):\r\n\ti=2\r\n\twhile(i*i<=x):\r\n\t\tif(x%i==0):\r\n\t\t\treturn x//i\r\n\t\ti+=1\r\n\telse:\r\n\t\treturn 1\r\n\r\n\r\n\r\nn=int(input())\r\nc=n\r\nans=c\r\nwhile(c!=1):\r\n\tc= sieve(c)\r\n\tans+=c\r\nprint(ans)\r\n", "\r\ndef STR(): return list(input())\r\ndef INT(): return int(input())\r\ndef MAP(): return map(int, input().split())\r\ndef MAP2():return map(float,input().split())\r\ndef LIST(): return list(map(int, input().split()))\r\ndef STRING(): return input()\r\nimport string\r\nimport sys\r\nimport datetime\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# primes = [2,11,101,1009,10007,100003,1000003,10000019,102345689]\r\n#months = [31 , 28 , 31 , 30 , 31 , 30 , 31 , 31 , 30 , 31, 30 , 31]\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#arr.sort(key=lambda x: (-d[x], x)) Sort with Freq\r\n\r\n#Code\r\n\r\n\r\ndef solve(n):\r\n d = [n]\r\n i = 2\r\n while i * i <= n :\r\n if n % i == 0 :\r\n if n // i == i :\r\n d.append(i)\r\n else:\r\n d.append(i)\r\n d.append(n // i )\r\n i +=1\r\n\r\n return d\r\n\r\nn = INT()\r\nm = n\r\nsm = 0\r\n\r\nwhile True :\r\n k1 = solve(n)\r\n k2 = min(k1)\r\n k3 = n // k2\r\n sm += k3\r\n n//= k2\r\n if n == 1 :\r\n break\r\n\r\nprint(sm + m )\r\n\r\n\r\n\r\n", "n = int(input())\n\nanswer = [n]\n\nwhile(answer[-1] != 1):\n for i in range(2, answer[-1]+1):\n if(answer[-1]%i == 0):\n answer.append(answer[-1]//i)\n break\n\nprint(sum(answer))\n \t\t\t \t\t \t\t \t \t \t", "#!/usr/bin/env pypy3\n\nimport math\n\nclass Sieve:\n def __init__(self, n=10**7):\n self.N = n\n\n s = [-1] * n\n for i in range(2, int(n**0.5)+1):\n if s[i] != -1: continue\n for j in range(i, n, i): \n if j > i: s[j] = i\n self.s = s\n\n self.PRIMES = self.primes()\n \n def primes(self):\n return [i for i, e in enumerate(self.s) if e == -1 and i >= 2]\n\n # stack overflow\n def dumbfactorize(self, n):\n j = 2\n while n > 1:\n for i in range(j, int(math.sqrt(n+0.05)) + 1):\n if n % i == 0:\n n /= i ; j = i\n yield i\n break\n else:\n if n > 1:\n yield n; break\n\n def fastfactorize(self, n):\n assert(n <= self.N)\n\n ret = []\n\n while self.s[n] != -1:\n ret += [self.s[n]]\n n = n // self.s[n]\n\n ret += [n]\n\n return ret\n\n def isprime(self, n):\n if n < self.N:\n return self.s[n] == -1\n for p in self.PRIMES:\n if p*p > n:\n return True\n if n % p == 0:\n return False\n\n def factorize(self, n):\n if n < self.N:\n return self.fastfactorize(n)\n \n for p in self.PRIMES:\n if p*p > n:\n break\n if n % p == 0:\n return [p] + self.factorize(n // p)\n\n return [n]\n\nsieve = Sieve()\n\nn = int(input())\n\ndef ans(n):\n f = sorted(sieve.factorize(n))\n if len(f) == 1:\n return n+1\n else:\n return n + ans(n // f[0])\n\nprint(ans(n))", "__author__ = 'Esfandiar'\nimport sys\ninput = sys.stdin.readline\nn = int(input())\nres = n\nwhile n:\n f=1\n for i in range(2,int(n**.5)+1):\n if n % i == 0:\n res+= n // i\n n//=i\n f=0\n break\n if f:res+=1;break\nprint(res)\n\n\n", "n = int(input())\r\nmaxd = 0\r\ns = n\r\nwhile n!=1:\r\n for i in range(1, n//2 + 1):\r\n if (n%i==0) and (i>maxd):\r\n maxd = i\r\n n = maxd\r\n maxd=0\r\n s += n\r\nprint(s)", "def isprime(num1 :int)->int:\r\n q=0\r\n for i in range(2, int(num1/2)+1):\r\n if (num1 % i) == 0:\r\n return 0\r\n break\r\n else:\r\n q+=1 \r\n if q==int(num1/2)-2:\r\n return 1\r\n \r\n\r\nn=int(input())\r\nx=n\r\nfor i in range(2,n+1):\r\n while n%i==0:\r\n x+=int(n/i)\r\n n=int(n/i)\r\n if isprime(n)==1:\r\n x+=1 \r\n break\r\nprint(x) ", "\r\nnum=int(input())\r\n\r\ndef magic(var):\r\n iterations=num\r\n counter=2\r\n while var>1:\r\n if var%counter==0:\r\n var=var//counter\r\n iterations+=var\r\n else:\r\n counter+=1\r\n return iterations\r\n \r\n \r\nprint(magic(num))", "def isPrime(num):\n if num > 1:\n for i in range(2,num):\n if (num % i) == 0:\n return False\n \n break\n else:\n return True\n \n else:\n return False\n \ndef RectangularGame(n):\n sum = n\n if n==1:\n return 1\n else:\n if isPrime(n):\n return n+1\n else:\n for i in range(2,n):\n if n%i == 0:\n sum = sum + RectangularGame(n//i)\n return sum\n else:\n continue\n\nnumber = int(input())\nprint(RectangularGame(number))\n", "n = int(input())\r\nsum = n\r\nwhile n%2 == 0:\r\n n = n//2\r\n sum = sum + n\r\n\r\ni = 3\r\nwhile i<=int(n**0.5):\r\n while n%i == 0:\r\n n=n//i\r\n sum = sum + n\r\n i = i + 2\r\nif n > 2:\r\n sum = sum + 1\r\nprint(sum)\r\n", "def max_factor(n):\r\n for j in range(n-1,0,-1):\r\n if n%j == 0:\r\n return j\r\n \r\nn = int(input())\r\nans = n\r\nwhile n != 1:\r\n temp = max_factor(n)\r\n ans += temp\r\n n = temp\r\nprint(ans)\r\n ", "n = int(input())\r\nt = n\r\n\r\ndef search_simple(n):\r\n '''ищет первый протой множитель числа n'''\r\n i = 2\r\n while i*i <= n:\r\n if n % i == 0:\r\n return i\r\n i += 1\r\n return n\r\n\r\nA = []\r\ns = 1\r\nwhile s != n:\r\n a = int(search_simple(t))\r\n t /= a\r\n s *= a\r\n A.append(a)\r\n\r\nV = n\r\nd = n\r\nfor i in range(len(A)):\r\n V += int(d/A[i])\r\n d /= A[i]\r\n\r\nprint(V)", "# from sympy import factorint\r\n# from functools import reduce\r\nfrom math import sqrt\r\n\r\ndef factor(n):\r\n ans = []\r\n for i in range(1,int(sqrt(n))+2):\r\n if n%i == 0:\r\n ans.append(i)\r\n ans.append(n) \r\n return(sorted(ans)) \r\n# print(factors(16))\r\na=int(input())\r\nsum=a\r\n# print(sum)\r\nwhile a!=1:\r\n # print(1)\r\n if a%2==0:\r\n sum+=a//2\r\n a=a//2\r\n else:\r\n b=factor(a)\r\n # print(b)\r\n # list(b)\r\n keys=list(b)\r\n # print(keys)\r\n # keys.sort()\r\n # c=keys[0]\r\n if keys[1]==a:\r\n sum+=1\r\n a=1\r\n else:\r\n sum+=a//keys[1]\r\n a=a//keys[1]\r\n # print(sum)\r\nprint((sum))", "def pfs(n):\r\n p = []\r\n i = 2\r\n while i * i <= n:\r\n if n % i == 0:\r\n p.append(i)\r\n n = n // i\r\n else:\r\n i += 1\r\n if n > 1:\r\n p.append(n)\r\n return p\r\n\r\ndef score(n):\r\n p = pfs(n)\r\n score = n\r\n for q in p:\r\n n = n // q\r\n score += n\r\n return score\r\n\r\nn = int(input())\r\n\r\nprint(score(n))", "import sys\r\n\r\nimport math\r\n# Below function will print the\r\n# all prime factor of given number\r\n\r\n\r\ndef find(num):\r\n l = []\r\n while num % 2 == 0:\r\n l.append(2)\r\n num = num / 2\r\n\r\n for i in range(3, int(math.sqrt(num)) + 1, 2):\r\n\r\n while num % i == 0:\r\n l.append(i)\r\n num = num / i\r\n if num > 2:\r\n l.append(int(num))\r\n\r\n return l\r\n\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef solve():\r\n n = int(input())\r\n ans = find(n)\r\n ans.sort()\r\n m = 1\r\n for i in ans:\r\n m *= i\r\n\r\n s = m\r\n for i in ans:\r\n s += m//i\r\n m //= i\r\n\r\n print(s)\r\n\r\n\r\nfor _ in range(1):\r\n solve()\r\n", "from collections import defaultdict\nimport math\ndef solve(n):\n sq = math.ceil(n ** 0.5)\n ans = 0\n for i in range(2, sq + 1):\n while n%i == 0:\n ans += n\n n //= i\n return ans + n + (n > 1)\n\nprint(solve(int(input())))\n", "from sys import *\r\n\r\n\r\ndef solve(n):\r\n i = 2\r\n s = n\r\n while(i*i <= n):\r\n if(n % i == 0):\r\n n = n//i\r\n s += n\r\n else:\r\n i += 1\r\n return s\r\n pass\r\n\r\n\r\ntest = 1\r\n# test = int(input())\r\nfor t in range(0, test):\r\n # brr = [list(map(int,input().split())) for i in range(rows)] # 2D array row-wise input\r\n n = int(input())\r\n # n, x = list(map(int, input().split()))\r\n # arr = [int(x) for x in input().split()]\r\n ans = solve(n)\r\n print(ans+1)\r\n\r\n\r\n'''\r\nrows, cols = (5, 5)\r\narr = [[0]*cols for j in range(rows)] # 2D array initialization\r\nb=input().split() # list created by spliting about spaces\r\nbrr = [[int(b[cols*i+j]) for j in range(cols)] for i in range(rows)] # 2D array Linear Input\r\nrows,cols=len(brr),len(brr[0]) # no of rows/cols for 2D array\r\narr.sort(key = lambda x : x[1]) # sort list of tuples by 2nd element, Default priority - 1st Element then 2nd Element\r\ns=set() # empty set\r\na=maxsize # initializing infinity\r\nb=-maxsize # initializing -infinity\r\nmapped=list(map(function,input)) # to apply function to list element-wise\r\ntry: # Error handling\r\n #code 1\r\nexcept: # ex. to stop at EOF\r\n #code 2 , if error occurs\r\n'''\r\n", "n = int(input())\r\ni=2\r\nsum = n\r\nP = [0 for i in range(n+1)]\r\nwhile True:\r\n\tif n==1 :\r\n\t\tbreak\r\n\telif P[i]==1 :\r\n\t\ti+=1\r\n\telif n%i == 0:\r\n\t\tn = n//i\r\n\t\tsum += n\r\n\t\ti=2\r\n\telse :\r\n\t\tj=i\r\n\t\twhile j < n :\r\n\t\t\tP[j] = 1\r\n\t\t\tj+=i\r\n\t\ti+=1\r\nprint(sum)", "n = int(input())\r\nans = n\r\nwhile n != 1:\r\n i = 2\r\n while n % i != 0:\r\n i += 1\r\n n //= i\r\n ans += n\r\nprint(ans)", "n=int(input())\r\nb = 0\r\nsum=n\r\nwhile b!=1:\r\n for i in range(2,n+1):\r\n if i==n:\r\n b=1\r\n break\r\n if n%i==0:\r\n a=i\r\n b=int(n/a)\r\n break\r\n sum=sum+b\r\n n=b\r\nprint(sum)\r\n\r\n", "n=int(input())\r\nc=n\r\nwhile n>1:\r\n if n%2==0:\r\n c+=n//2\r\n n=n//2\r\n else:\r\n x=n//2\r\n while True:\r\n if n%x==0:\r\n c+=x\r\n n=x\r\n break\r\n else:\r\n x-=1\r\nprint(c) ", "def factors(N):\r\n ans = []\r\n cur = 2\r\n B = int(N ** (1/2)) + 1\r\n while N != 1 and cur < B:\r\n while N % cur == 0:\r\n N //= cur\r\n ans += [cur]\r\n \r\n cur += 1\r\n if N != 1:\r\n ans += [N]\r\n ans.sort()\r\n return ans\r\n\r\nN = int(input())\r\nfs = factors(N)\r\n#print(fs)\r\nans = N\r\ncur = N\r\nind = 0\r\nwhile ind < len(fs):\r\n N //= fs[ind]\r\n ans += N\r\n ind += 1\r\nprint(ans)", "def prime(n):\r\n res = n\r\n for i in range(2,int(n**0.5)+1):\r\n if(n%i==0):\r\n while(n%i==0):\r\n n = n//i \r\n res = res + n \r\n if(n>1):\r\n res = res +1 \r\n \r\n return res \r\nn = int(input())\r\nprint(prime(n)) ", "__author__ = 'Esfandiar'\nn = int(input())\nres = n\nwhile n:\n f=1\n for i in range(2,n//2+1):\n if n % i == 0:\n res+= n // i\n n//=i\n f=0\n break\n if f:res+=1;break\nprint(res)\n\n\n", "lower = 1\r\nupper = 10**9\r\nn=int(input())\r\na=n\r\nwhile(n!=1):\r\n for num in range(lower, upper + 1):\r\n if num > 1:\r\n for i in range(2, num):\r\n if (num % i) == 0:\r\n break\r\n else:\r\n b=num\r\n if(n%b==0):\r\n a=a+int(n/b)\r\n n=int(n/b)\r\n break\r\n \r\nprint(a)", "def get_Least_Prime(n):\n\tif n == 1 or n == 2: # base Conditions \n\t\treturn n\n\tif n%2==0:\n\t\treturn 2\n\tfor i in range(3, int(n**0.5)+1, 2): # Get theleast Prime factor of N\n\t\tif n%i == 0:\n\t\t\treturn i\n\treturn n # denotes the Number is Prime\n\ndef solve(n):\n\tif n == 1:\n\t\treturn 1\n\tc = n\n\twhile n!=1:\n\t\tdivisor = get_Least_Prime(n)\n\t\t# print(divisor, n//divisor)\n\t\tn = n//divisor\n\t\tc+=n\n\treturn c\n\nn = int(input())\nprint(solve(n))\n \t\t \t \t \t \t \t \t\t\t\t\t\t", "#177B1 (80No. Problem B)\r\n\r\np = int(input())\r\nprime = [2,3,5,7]\r\nans = p\r\nwhile p > 1:\r\n for i in prime:\r\n if (p%i == 0):\r\n t = p//i\r\n p = t\r\n ans+= t\r\n break\r\n else:\r\n ans+= 1\r\n break \r\n # print(t) \r\nprint(ans) ", "from math import gcd\r\nfrom random import randint\r\nfrom functools import reduce\r\n\r\n\r\ndef brent(N):\r\n if N % 2 == 0: return 2\r\n y, c, m = randint(1, N - 1), randint(1, N - 1), randint(1, N - 1)\r\n g, r, q = 1, 1, 1\r\n while g == 1:\r\n x = y\r\n for i in range(r):\r\n y = ((y * y) % N + c) % N\r\n k = 0\r\n while (k < r and g == 1):\r\n ys = y\r\n for i in range(min(m, r - k)):\r\n y = ((y * y) % N + c) % N\r\n q = q * (abs(x - y)) % N\r\n g = gcd(q, N)\r\n k = k + m\r\n r = r * 2\r\n if g == N:\r\n while True:\r\n ys = ((ys * ys) % N + c) % N\r\n g = gcd(abs(x - ys), N)\r\n if g > 1: break\r\n return g\r\n\r\n\r\ndef factorize(n1):\r\n if n1 == 0: return []\r\n if n1 == 1: return [1]\r\n n = n1\r\n b = []\r\n p = 0\r\n mx = 1000000\r\n while n % 2 == 0: b.append(2);n //= 2\r\n while n % 3 == 0: b.append(3);n //= 3\r\n i = 5\r\n inc = 2\r\n while i <= mx:\r\n while n % i == 0: b.append(i); n //= i\r\n i += inc\r\n inc = 6 - inc\r\n while n > mx:\r\n p1 = n\r\n while p1 != p:\r\n p = p1\r\n p1 = brent(p)\r\n b.append(p1);\r\n n //= p1\r\n if n != 1: b.append(n)\r\n return sorted(b)\r\n\r\n\r\ndef solve(n):\r\n li = factorize(n)\r\n # print(li)\r\n totalSum = reduce(lambda x, y: x * y, li)\r\n # print(totalSum)\r\n ans = totalSum\r\n for i in range(len(li)):\r\n toAdd = totalSum // li[i]\r\n # print(toAdd)\r\n ans += toAdd\r\n totalSum = toAdd\r\n\r\n print(ans)\r\n\r\n\r\ntc = 1\r\nfor _ in range(tc):\r\n solve(int(input()))\r\n", "import sys\r\nimport math\r\n\r\n#to read string\r\nget_string = lambda: sys.stdin.readline().strip()\r\n#to read list of integers\r\nget_int_list = lambda: list( map(int,sys.stdin.readline().strip().split()) )\r\n#to read integers\r\nget_int = lambda: int(sys.stdin.readline())\r\n\r\n#--------------------------------WhiteHat010--------------------------------------#\r\ndef factors(n):\r\n i = 2\r\n s = set()\r\n while i*i <= n:\r\n if n%i == 0:\r\n s.add(i)\r\n s.add(n//i)\r\n i += 1\r\n s.add(1)\r\n return s\r\n\r\nn = get_int()\r\ncount = n\r\n\r\nwhile n != 1:\r\n m = max(factors(n))\r\n count += m\r\n n = m\r\nprint(count)", "n=int(input())\r\nsum=n\r\ni=2\r\nwhile n>1:\r\n\tif n%i!=0:\r\n\t\ti+=1\r\n\telse:\r\n\t\tn=n//i\r\n\t\tsum+=n\r\nprint(sum)", "n = int(input())\r\n\r\ndef isPrime(n) : \r\n if (n <= 1) : \r\n return False\r\n if (n <= 3) : \r\n return True\r\n \r\n if (n % 2 == 0 or n % 3 == 0) : \r\n return False\r\n \r\n i = 5\r\n while(i * i <= n) : \r\n if (n % i == 0 or n % (i + 2) == 0) : \r\n return False\r\n i = i + 6\r\n \r\n return True\r\n\r\n\r\nc = n + 1\r\nwhile n > 1:\r\n\tif n % 2 == 0:\r\n\t\tn //= 2\r\n\t\tif n != 1:\r\n\t\t\tc += n\r\n\telse:\r\n\t\tif isPrime(n):\r\n\t\t\tn = 1\r\n\t\telse:\r\n\t\t\tj = 3\r\n\t\t\twhile n % j > 0:\r\n\t\t\t\tj += 1\r\n\t\t\tn //= j\r\n\t\t\tc += n\r\n\r\nprint(c)", "s = n = int(input())\r\n\r\nwhile n > 1:\r\n for d in range(2, int(n**.5)+1):\r\n if n % d == 0:\r\n n //= d\r\n s += n\r\n break\r\n else:\r\n break\r\n\r\nprint(s + (n>1))", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nc = n\r\nfor i in range(2, int(n**0.5)+1):\r\n while n % i == 0:\r\n n//= i\r\n c += n\r\n if n == 1 or n < i:\r\n break\r\nprint(c + (n!=1))", "n = int(input())\r\ns = n\r\ndiv = 2\r\nwhile n > 1:\r\n if n % div == 0:\r\n n = n // div\r\n else:\r\n for i in range(div + 1, n + 1):\r\n if n % i == 0:\r\n div = i\r\n n = n // div\r\n break\r\n s += n\r\nprint(s)\r\n", "n = int(input())\r\nans = n\r\nk = n//2\r\nif n ==1:\r\n ans =1\r\nelse: \r\n while True:\r\n if k == 1:\r\n ans+=1\r\n break\r\n while k>1: \r\n if (n%k) == 0:\r\n ans += k\r\n n = k\r\n k -= 1\r\n else:\r\n k-=1\r\nprint(ans)", "def sol(n, count):\r\n count = n\r\n max_factor = 1\r\n i = 2\r\n while i*i <= n:\r\n if n % i == 0:\r\n max_factor = n//i\r\n break\r\n i += 1\r\n \r\n add = 0\r\n if max_factor != 1:\r\n add = sol(max_factor, count)\r\n else:\r\n return max_factor\r\n \r\n max_factor += add\r\n return max_factor\r\n\r\n\r\nn = int(input())\r\nprint(sol(n, n) + n)", "import sys,math,string,bisect\ninput=sys.stdin.readline\nfrom collections import deque\nL=lambda : list(map(int,input().split()))\nLs=lambda : list(input().split())\nM=lambda : map(int,input().split())\nI=lambda :int(input())\nn=I()\nc=n\nwhile(n!=1):\n p=2\n k=n\n while(p<n**0.5+1):\n if(n%p==0):\n c+=n//p\n n=n//p\n break\n p+=1\n if(n==k):\n c+=1\n n=1\nprint(c)\n", "\r\nn = int(input())\r\ncount = n \r\n\r\nwhile n > 1:\r\n\r\n for i in range(2, n+1):\r\n if n%i == 0: # find lowest divisor\r\n n = int(n/i) # divide n by divisor\r\n count += n # add result to count\r\n break # exit loop and repeat for new n\r\n\r\nprint(count)\r\n\r\n\r\n", "n=int(input())\r\ndef stone(n):\r\n\tfor i in range(n,1,-1):\r\n\t\tif n%i==0:\r\n\t\t\tq=n//i\r\n\treturn q\r\ndef result(n):\r\n\ts=n\r\n\twhile n>1:\r\n\t\ts=s+stone(n)\r\n\t\tn=stone(n)\r\n\treturn s\r\nprint(result(n))\r\n", "def pebble(n):\r\n\tif(n==1):\r\n\t\treturn 1\r\n\telse:\r\n\t\tfor i in range(2,int(n**0.5)+1):\r\n\t\t\tif(n%i==0):\r\n\t\t\t\treturn n+pebble(n//i)\r\n\t\treturn n+1\r\n\r\nn=int(input())\r\nprint(pebble(n))", "import math\r\n\r\nn = int(input())\r\n\r\nans = n\r\n\r\nwhile n%2 == 0:\r\n n = n//2\r\n ans += n \r\n #print(n)\r\n\r\nfor i in range(3, math.ceil(math.sqrt(n))+1, 2):\r\n if n%i == 0:\r\n while n%i == 0:\r\n n = n//i\r\n ans += n\r\n #print(n)\r\n\r\nif n != 1:\r\n ans += 1\r\n\r\nprint(ans)", "from math import sqrt\r\ndef f(n):\r\n global count\r\n for i in range(2,int(sqrt(n))+2):\r\n if n%i==0 and n/i!=1:\r\n count+=n/i\r\n return(f(n/i))\r\n return count+1\r\nn=int(input())\r\ncount=n\r\nprint(int(f(n)))\r\n", "n = int(input())\r\nres = n\r\n\r\nwhile n != 1:\r\n i = 2\r\n while i*i <= n:\r\n if not(n%i):\r\n break\r\n i += 1\r\n if i*i > n:\r\n n = 1\r\n else:\r\n n //= i\r\n res += n\r\n\r\nprint(res)\r\n", "n = int(input())\r\n\r\nfrom math import sqrt\r\nans = n\r\n\r\nwhile n != 1:\r\n # find minimal divisor\r\n divisor = 1\r\n for i in range(2, int(sqrt(n)) + 1):\r\n if n % i == 0:\r\n divisor = i\r\n break\r\n \r\n if divisor == 1:\r\n ans += 1\r\n break\r\n ans += n // divisor\r\n n = n //divisor\r\n\r\nprint(ans)", "n=int(input())\r\na=0\r\nb=2\r\nans=n\r\nwhile(b>1):\r\n for z in range(2,n+1):\r\n if z==n:\r\n b=1\r\n ans+=b\r\n break\r\n elif n%z==0:\r\n b=int(n/z)\r\n ans+=b\r\n n=b\r\n break\r\nprint(ans)", "n = int(input())\r\nans = n\r\nwhile n != 1:\r\n if n % 2 == 0:\r\n n = n//2\r\n else:\r\n t = 1\r\n for i in range(2,int(n**(1/2))+1):\r\n if n % i == 0:\r\n n = n // i\r\n t = 0\r\n break\r\n if t: n = 1\r\n ans += n\r\nprint(ans)\r\n", "n = int(input())\r\nans=n\r\nwhile (n!=1):\r\n for i in range(2,n+1):\r\n if n%i==0: \r\n ans += n//i\r\n n=n//i\r\n break\r\nprint(ans)", "from math import *\r\nn=int(input())\r\ndef func(n):\r\n if n%2==0:\r\n return n//2\r\n else:\r\n i=3\r\n while i<=int(sqrt(n)):\r\n if n%i==0:\r\n return n//i\r\n break\r\n else:\r\n i+=2\r\n return 1\r\ns=0 \r\nwhile n>1:\r\n s+=n\r\n n=func(n)\r\nprint(s+1)\r\n ", "def flag(x):\r\n \r\n # First x in the below expression\r\n # is for the case when x is 0\r\n return (x and (not(x & (x - 1))) )\r\n#print(pow(2,22))\r\nimport math\r\ndef big(n):\r\n z=int(math.sqrt(n))\r\n for i in range(2,z+1):\r\n if n%i==0:\r\n return n//i\r\n return 1\r\n\r\ndef solve(n):\r\n if flag(n):\r\n return n+(n-1)\r\n else:\r\n ans=0\r\n while(n%2==0): \r\n ans+=n\r\n n=n//2\r\n ans+=n\r\n #print(n)\r\n while(n!=1):\r\n #print(big(n))\r\n z=big(n)\r\n n=z\r\n #print(z)\r\n ans+=z\r\n return ans\r\n\r\nn=int(input())\r\nprint(solve(n))", "def recgame(n):\r\n\ta = n\r\n\tsum = a\r\n\twhile a != 1:\t\r\n\t\tfor i in range(int(2),int(a+1)):\r\n\t\t\tif a%(i) == 0:\r\n\t\t\t\ta = a/(i)\r\n\t\t\t\tsum += a\r\n\t\t\t\tbreak\r\n\treturn int(sum)\r\nn = int(input())\r\nprint(recgame(n))", "n=int(input())\r\ncount=0\r\ndef pebbles(n,count):\r\n\tcount+=n\r\n\tif n==1:\r\n\t\treturn count\r\n\telse:\r\n\t\tfor i in range(n//2):\r\n\t\t\tif int(n/((n//2)-i))==n/((n//2)-i):\r\n\t\t\t\ta=(n//2)-i\r\n\t\t\t\tb=n/((n//2)-i)\r\n\t\t\t\treturn pebbles(a,count)\r\nprint(pebbles(n,count))\r\n", "import sys\r\nimport math\r\n\r\n\r\n# 9, 1 -> 8, 2 -> 6, 1 -> 5, 1 -> 4, 1\r\ndef main():\r\n N = int(input())\r\n total = N\r\n curr = N\r\n\r\n while curr != 1:\r\n fact_found = False\r\n for i in range(2, int(math.sqrt(N)) + 1):\r\n if N % i == 0:\r\n curr = i\r\n N = N // i\r\n fact_found = True\r\n break\r\n if not fact_found:\r\n print(total + 1)\r\n return\r\n total += N\r\n print(total + 1)\r\n return\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "N = int(input())\r\n\r\nans = N\r\n\r\nlastD = 2\r\n\r\nwhile N > 1:\r\n nextD = None\r\n for i in range(lastD, int(N ** (1/2)) + 1):\r\n if N % i == 0:\r\n nextD = i\r\n break\r\n \r\n if nextD != None:\r\n ans += N // nextD\r\n N //= nextD\r\n else:\r\n ans += 1\r\n N = 1\r\n \r\nprint(ans)\r\n", "import math\nc=int(input())\nsum=c\nwhile c>1:\n\tsignal=False\n\tfor i in range(2, int(math.sqrt(c))+1):\n\t\tif c%i==0:\n\t\t\tc=c//i\n\t\t\tsignal=True\n\t\t\tbreak\n\tif signal==False:\n\t\tc=1\n\tsum+=c\nprint(sum)", "cnt = lambda s, i: s.count(i)\r\nii = lambda: int(input())\r\nsi = lambda : input()\r\nf = lambda : map(int,input().split())\r\nil = lambda : list(map(int,input().split()))\r\nn=ii()\r\ns=n\r\nm=int(n**0.5)+1\r\ni=2\r\nwhile n>=1 and i<m:\r\n if n%i:i+=1\r\n else:\r\n n//=i\r\n s+=n\r\nprint(s+(n>1))\r\n", "def sol(n, count):\r\n count = n\r\n min_factor = 1\r\n i = 2\r\n while i*i <= n:\r\n if n % i == 0:\r\n min_factor = n//i\r\n break\r\n i += 1\r\n \r\n add = 0\r\n if min_factor != 1:\r\n add = sol(min_factor, count)\r\n else:\r\n add = 1\r\n count += add\r\n return count\r\n\r\n\r\nn = int(input())\r\nprint(sol(n, n))", "n = int(input())\r\ni=2\r\nSum = n\r\nwhile True:\r\n\r\n\tif i**2 > n:\r\n\t\tSum+=1\r\n\t\tbreak\r\n\telif n%i == 0:\r\n\t\tn = n//i\r\n\t\tSum += n\r\n\telse :\r\n\t\ti+=1\r\nprint(Sum)", "a=int(input())\r\n\r\nb=2\r\ncontador=a\r\nwhile a>1:\r\n \r\n if a%b==0:\r\n a=a//b\r\n contador+=a\r\n else:\r\n b+=1\r\n\r\nprint(contador)\r\n \r\n", "n = int(input())\r\ni, s = 2, n\r\nm = int(n ** 0.5) + 1\r\nwhile n > 1 and i < m:\r\n if n % i: i += 1\r\n else:\r\n n //= i\r\n s += n\r\nprint(s + (n > 1))", "n = int(input())\r\n\r\na = {}\r\n\r\ndef search(k):\r\n\tif k not in a:\r\n\t\tt = 1\r\n\t\ti = 2\r\n\t\twhile i * i <= k:\r\n\t\t\tif k % i == 0:\r\n\t\t\t\tt = max(t, search(i), search(k // i))\r\n\t\t\ti += 1\r\n\t\ta[k] = k + t\r\n\treturn a[k]\r\n\r\nprint(search(n))\r\n", "n=int(input())\r\ng=n\r\nwhile n!=1:\r\n for i in range(2,n+1):\r\n if n%i==0:\r\n g+=n/i\r\n n=int(n/i)\r\n break\r\nprint(int(g))\r\n", "import math\n\ndef f(n):\n for i in range(2, int(math.sqrt(n)) + 1):\n if n % i == 0:\n return n // i\n return 1\n\nn = int(input())\nans, b = n, n\nwhile b != 1:\n b = f(b)\n ans += b\nprint(ans)", "import math\r\nnn=input()\r\nn=int(nn)\r\ncnt=1\r\nwhile (n>1):\r\n if(n%2)==1 and (n%3)==0:\r\n cnt += n\r\n n = n / 3\r\n elif (n % 2) == 1 and (n % 3) != 0 and (n%5)==0:\r\n cnt+=n\r\n n=n/5\r\n elif (n % 2) == 1 and (n % 3) != 0 and (n % 5) != 0 and (n%7)==0:\r\n cnt+=n\r\n n=n/7\r\n elif (n % 2) == 1 and (n % 3) != 0 and (n%5)!=0 and (n%7)!=0:\r\n cnt+=n\r\n break\r\n else:\r\n cnt += n\r\n n=n/2\r\nprint(round(cnt))", "n, i, s = int(input()), 2, 1\r\nwhile n > 1:\r\n if n % i: i += 1\r\n else:\r\n s += n\r\n n //= i\r\nprint(s)", "n=int(input())\r\n#count=n\r\n\r\ndef pebbles(n,count):\r\n\t'''\r\n\tif n==1:\r\n\t\tcount+=1\r\n\t\treturn count\r\n\t'''\r\n\t#print(n)\r\n\tmaxi=0\r\n\r\n\tfor a in range(2,n):\r\n\t\tb=n/a\r\n\t\t#print(b)\r\n\t\tif b%1==0 and b>maxi:\r\n\t\t\tmaxi=b\r\n\tcount+=maxi\r\n\t#print(n)\r\n\t#print(maxi,count)\r\n\tif maxi==0:\r\n\t\tcount+=1\r\n\t\tprint(count)\r\n\t\treturn\r\n\tpebbles(int(maxi),int(count))\r\n\r\nif n==1:\r\n\tprint(1)\r\nelse:\r\n\tpebbles(n,n)\r\n\r\n", "from math import sqrt\r\nn=int(input())\r\nlim=int(sqrt(n)) \r\ni=2\r\nans=n\r\nwhile i<=lim:\r\n if n%i!=0:\r\n lim=int(sqrt(n))\r\n i+=1\r\n else:\r\n n=n//i\r\n ans+=n\r\nif n>1:\r\n print(ans+1)\r\nelse: \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", "n=int(input())\r\nd,ans=2,0\r\nwhile d*d<=n:\r\n while n%d==0:\r\n ans+=n\r\n n//=d\r\n d+=1\r\nif n==1:\r\n print(ans+n)\r\nelse:\r\n print(ans+n+1)\r\n", "n = int(input())\ni = 2\ns = 1\nwhile n > 1:\n if n % i != 0:\n i += 1\n else:\n s += n\n n //= i\nprint(s)", "n=int(input())\r\nsum=n\r\nwhile n!=1:\r\n for i in range(2,n+1):\r\n if n%i==0:\r\n n//=i\r\n break\r\n sum+=n\r\nprint(sum)", "def smallest_factor(n):\r\n i=2\r\n #INV:(2<=i<=[sqrt(n)]+1) ^ (No number in [2..i-1] divides n)\r\n while(((i*i)<=n) and (n%i != 0)):\r\n i = i + 1\r\n if((n%i)==0):\r\n return i\r\n else:\r\n return n\r\n\r\ndef max_number_in_row(n):\r\n return (n // smallest_factor(n))\r\n\r\ndef max_sum(n):\r\n if(n==1):\r\n return 1\r\n else:\r\n return(n + max_sum(max_number_in_row(n)))\r\n\r\nn = int(input())\r\nprint(max_sum(n))", "s = int(input())\r\nresult = s\r\ndef smallestDivisor(n):\r\n divisor = n\r\n i = 2\r\n while(i*i <= n):\r\n if(n%i == 0):\r\n divisor = i\r\n break\r\n i+=1\r\n return divisor\r\nwhile(s!=1):\r\n rows = smallestDivisor(s)\r\n s/=rows\r\n result += s\r\nprint(int(result))", "def largest_divisor(X):\n\tA = []\n\tfor i in range(1,X):\n\t\tif X%i==0:\n\t\t\tA.append(i)\n\treturn(max(A))\n\nn = int(input())\nans = n\nwhile largest_divisor(n)>1:\n\tans = ans+largest_divisor(n)\n\tn =largest_divisor(n)\n\nprint(ans+1)\n", "def sol(n, count):\r\n count = n\r\n min_factor = -1\r\n while min_factor != 1:\r\n i = 2\r\n min_factor = -1\r\n while i*i <= n:\r\n if n % i == 0:\r\n min_factor = n//i\r\n count += min_factor\r\n n = min_factor\r\n break\r\n else:\r\n min_factor = -1\r\n i += 1\r\n if i*i >= n and min_factor == -1:\r\n min_factor = 1\r\n count += min_factor\r\n \r\n return count\r\n \r\n \r\n \r\nn = int(input())\r\nprint(sol(n, n))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Jun 5 12:26:37 2020\r\n\r\n@author: Anmol Singla\r\n\"\"\"\r\n\r\nfrom math import sqrt\r\nn=int(input())\r\nsum=n\r\nwhile(n>1): \r\n x=int(sqrt(n))\r\n true=0\r\n for i in range(2,x+1):\r\n if(n%i==0):\r\n true=1\r\n break\r\n if(true):\r\n n=int(n/i)\r\n sum+=n\r\n else:\r\n break\r\nsum+=1\r\nprint(sum)\r\n \r\n ", "n = int(input())\r\nr = n\r\nk = n - 1\r\nwhile(n != 1):\r\n if(n % k == 0):\r\n n = k\r\n r += k\r\n k -= 1\r\nprint(int(r))", "n = int(input())\nres = 1 # always ends with 1\nwhile n > 1:\n res += n\n n = next(i for i in range(n // 2, 0, -1) if n % i == 0)\nprint(res)\n", "def maxsum(n):\r\n ans = 0\r\n while(n>1):\r\n ans+=n\r\n for i in range(2,n+1):\r\n if n%i == 0:\r\n n = n//i\r\n break\r\n return ans+1\r\n \r\nn = int(input())\r\nprint(maxsum(n))", "n = int(input())\r\nans = n\r\nwhile n != 1:\r\n for i in range(n // 2, -1, -1):\r\n if n % i == 0:\r\n ans += i\r\n n -= i * (n // i - 1)\r\n break\r\nprint(ans)", "import sys\r\nimport math\r\nn = int(input())\r\na, b, t = 0, 0, n\r\nf2 = [1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8192, 16384, # factors of 2.\r\n 32768, 65536, 131072, 262144, 524288, 1048576, 2097152, 4194304, 8388608,\r\n 16777216, 33554432, 67108864, 134217728, 268435456, 536870912, 1073741824]\r\nif n in f2:\r\n print(int(2*2**math.log(n, 2)-1))\r\n sys.exit()\r\nwhile n > 1:\r\n if n in f2:\r\n print(int(t + 2*2**math.log(n, 2)-1))\r\n sys.exit()\r\n if n % 2 == 0:\r\n t += n/2\r\n n -= n/2\r\n else:\r\n a = 3\r\n b = n/a\r\n while b % 1 != 0:\r\n a += 2\r\n b = n/a\r\n n = b\r\n t += b\r\nprint(int(t))\r\n", "def isprime(n):\r\n if n==1:\r\n return False\r\n if n==2 or n==3:\r\n return True\r\n if n%2==0 or n%3==0:\r\n return False\r\n r=int(n**0.5)\r\n f=5\r\n while f<=r:\r\n if n%f==0 or n%(f+2)==0:\r\n return False\r\n f+=6\r\n return True\r\n\r\n\r\nn=int(input())\r\nif isprime(n):\r\n print(n+1)\r\nelse:\r\n c=n\r\n while n!=1:\r\n for i in range(2,n+1):\r\n if n%i==0:\r\n c+=n//i\r\n n=n//i \r\n break\r\n print(c)", "\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nstr_inp=lambda:input()\r\nn=int(input())\r\nsum=n\r\ni=2\r\nwhile n>1:\r\n\tif n%i!=0:\r\n\t\ti+=1\r\n\telse:\r\n\t\tn=n//i\r\n\t\tsum+=n\r\nprint(sum)", "n = int(input())\r\ns = 0\r\n\r\nwhile True:\r\n s += n\r\n flag = False\r\n for i in range(2, n // 2 + 1):\r\n if n % i == 0:\r\n flag = True\r\n n //= i\r\n break\r\n if not flag:\r\n s += 1\r\n break\r\n\r\nprint(s)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ns = n\r\ni = 2\r\nwhile n != 1:\r\n while n % i == 0:\r\n n//= i\r\n s += n\r\n i += 1\r\n\r\nprint(s)", "n=int(input())\r\nsum=n\r\nb=0\r\nwhile(b!=1):\r\n for i in range(2,n+1):\r\n if(n%i==0):\r\n b=n//i\r\n \r\n break\r\n sum=sum+b\r\n n=b\r\nprint(sum)\r\n ", "import sys\r\n\r\nn = int(sys.stdin.readline())\r\n\r\nans = 0\r\n\r\nwhile n>1:\r\n startMn = 2\r\n founded = False\r\n while startMn<=(n**0.5):\r\n #print(n,startMn)\r\n if n%startMn==0:\r\n ans+=n\r\n n = n//startMn\r\n founded = True\r\n break\r\n startMn+=1\r\n if not founded:\r\n ans = ans+n\r\n n = 1\r\nans = ans+n\r\nprint(ans)\r\n", "arr = []\r\np = 2\r\nwhile True:\r\n x = p*p\r\n if x<=10**9:\r\n arr.append(p)\r\n else:\r\n break\r\n p+=1\r\nn = int(input())\r\nans = n\r\nwhile True:\r\n f = -1\r\n for i in arr:\r\n if n%i==0:\r\n f = i\r\n break\r\n if f==-1:\r\n break\r\n else:\r\n ans+=(n//f)\r\n n = n//f\r\nprint(ans)", "\r\nn = int(input().strip())\r\nans = n\r\nfor i in range(2, int(n**0.5)+1):\r\n while(n%i == 0):\r\n n //= i\r\n ans += n\r\nif n > 1:\r\n ans += 1\r\n\r\nprint(ans)", "def minDivider(n):\r\n for d in range(2, int(n ** 0.5) + 2):\r\n if not (n % d):\r\n return d\r\n \r\n else:\r\n return n\r\n \r\n\r\ndef solve():\r\n n = result = int(input())\r\n \r\n while n > 1:\r\n n //= minDivider(n)\r\n \r\n result += n * (n > 1)\r\n \r\n print(result + 1)\r\n \r\n \r\nif __name__ == \"__main__\":\r\n solve()\r\n ", "from collections import Counter\r\n\r\ndef factors(n):\r\n if n == 1:\r\n return [1]\r\n \r\n i = 2\r\n factors = []\r\n while i * i <= n:\r\n if n % i == 0:\r\n while n % i == 0:\r\n factors.append(i)\r\n n //= i\r\n i += 1\r\n \r\n if n != 1:\r\n factors.append(n)\r\n return factors\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n res = n\r\n for e in factors(n):\r\n n //= e\r\n res += n\r\n \r\n print(res)\r\n \r\nif __name__ == '__main__':\r\n main()\r\n", "import math as m\r\nn = int(int(input()))\r\na =n+1\r\nwhile n%2==0 and n>2:\r\n\ta+=n//2\r\n\tn//=2\r\nfor i in range(3,int(m.sqrt(n))+1):\r\n\tif n%i==0 and n>i:\r\n\t\ta+=n//i\r\n\t\tn//=i\r\nprint(a)", "n = int(input())\r\n\r\nx, s = n, 0\r\n\r\nwhile x != 1:\r\n\tif x <= 3:\r\n\t\tx = 1\r\n\telse:\t\t\r\n\t\tfor i in range(2, int(x ** 0.5) + 1):\r\n\t\t\tif x % i == 0:\r\n\t\t\t\tx = x / i\r\n\t\t\t\tbreak\r\n\t\t\t\t\r\n\t\t\telif i == int(x ** 0.5):\r\n\t\t\t\tx = 1\r\n\t\r\n\ts += x\r\n\t\r\nprint(int(s + n))", "def prime_test(n) :\r\n for i in range(2, int(n**(1/2)) + 1 ) :\r\n if n % i == 0 :\r\n return False\r\n return True\r\n\r\ndef function( n ) :\r\n count = 0\r\n ans = n\r\n m = 2\r\n while m <= n :\r\n if n % m == 0 :\r\n ans += n//m\r\n n = n//m\r\n else :\r\n m += 1\r\n count += 1\r\n if count >= 10 ** 6 :\r\n if prime_test(n) :\r\n ans += 1\r\n break \r\n return ans \r\n\r\n\r\nif __name__ == \"__main__\" :\r\n n = int(input())\r\n print( function( n ) )\r\n \r\n", "import math\r\nn=int(input())\r\nc=n\r\nwhile(c>1):\r\n z=0\r\n for i in range(2,int(math.sqrt(n))+1):\r\n if(n%i==0):\r\n c+=(n//i)\r\n n=n//i\r\n z=1\r\n break\r\n if(z==0):\r\n c+=1\r\n break\r\nprint(c)\r\n \r\n", "def fun(n):\r\n h=int(n**0.5)+1\r\n for i in range(2,h):\r\n if n%i==0:return i\r\n return n\r\nn=int(input())\r\nc=n\r\nwhile n>1:\r\n k=fun(n)\r\n c+=n//k\r\n n=n//k\r\nprint(c)\r\n", "n=int(input())\r\nd=2\r\nr=1\r\nwhile d*d<=n:\r\n while n%d<1:r+=n;n//=d\r\n d+=1\r\nif n>1:r+=n\r\nprint(r)", "def largestDivisor(n):\r\n if (n==1):\r\n return 1\r\n i=n-1\r\n while i>=1:\r\n if (n%i==0):\r\n return i\r\n i-=1\r\ndef gameResult(n):\r\n points = n\r\n while n>1:\r\n points = points +largestDivisor(n)\r\n n = largestDivisor(n)\r\n return points\r\nx = int(input())\r\nprint(gameResult(x))", "a=int(input())\r\nc=a\r\nwhile(a>1):\r\n for i in range(1000000000):\r\n if(a%(i+2)==0):\r\n c+=(a/(i+2))\r\n a=a/(i+2)\r\n break\r\nc=int(c)\r\nprint(c)", "n = int(input())\r\nres = n\r\n\r\nwhile n != 1:\r\n i = 2\r\n while n%i != 0:\r\n i += 1\r\n n //= i\r\n res += n\r\n\r\nprint(res)\r\n", "\r\ndef greatestFactor(x):\r\n i = 2\r\n while i*i <= x:\r\n if x % i == 0:\r\n return int(x/i)\r\n else:\r\n i = i + 1\r\n if i*i > x:\r\n return 1\r\n \r\n \r\n \r\n\r\n\r\nx = int(input())\r\nc = x\r\nwhile x != 1:\r\n c = c + greatestFactor(x)\r\n x = greatestFactor(x)\r\n \r\nprint(c)", "n=int(input( ))\r\nsum=n\r\ncol=[]\r\nwhile n>1:\r\n\tfor i in range(2,n+1):\r\n\t\tfor j in range(1,n):\r\n\t\t\tif i*j==n:\r\n\t\t\t\tcol.append(j)\t\t\t\t\r\n\tsum=sum+max(col)\r\n\tn=max(col)\r\n\tcol=[]\r\nprint(sum)\r\n", "n = int(input())\ntotal = n\nwhile(n != 1):\n\tfor i in range(2, 40000):\n\t\tif(n % i == 0):\n\t\t\tn = n // i\n\t\t\ttotal += n\n\t\t\tbreak\nprint(total)", "def prime(n):\r\n if n == 2 or n == 3:\r\n return True\r\n elif n%2 == 0:\r\n return False\r\n else:\r\n for i in range (3,int(n**0.5)+1,2):\r\n if n%i == 0:\r\n return False\r\n return True\r\n \r\ndef factors(n):\r\n l = []\r\n for i in range (2,int(n**0.5)+1):\r\n if n%i == 0:\r\n l.append(i)\r\n if i != n**0.5:\r\n l.append(n//i)\r\n return l\r\n \r\ndef solution(n):\r\n if prime(n):\r\n return n+1\r\n else:\r\n ans = n\r\n l = factors(n)\r\n x = min(l)\r\n y = n//x\r\n ans = ans + y\r\n n = y\r\n while not prime(n):\r\n l = factors(n)\r\n x = min(l)\r\n y = n//x\r\n ans = ans + y\r\n n = y\r\n ans = ans + 1\r\n return ans \r\n \r\n \r\nn = int(input())\r\nprint(solution(n))\r\n \r\n \r\n \r\n ", "def f1(x):\r\n for i in range(2,x):\r\n if(x%i==0):\r\n return(i)\r\n return(1)\r\nn = int(input())\r\nm = n\r\nwhile(1):\r\n if(f1(n)==1):\r\n break\r\n n = int(n/f1(n))\r\n m = m + n\r\nprint(m+1)", "num=int(input())\r\ndiv=2\r\ntotal=1\r\nwhile(num>1):\r\n if(div*div>num):\r\n total+=num\r\n break\r\n else:\r\n if(num%div==0):\r\n total+=num\r\n num/=div\r\n else:\r\n div+=1\r\nprint(int(total))\r\n", "n=int(input())\r\nk=n\r\nt=n\r\nwhile t!=1:\r\n\tl=[]\r\n\tfor i in range(1,t):\r\n\t\tif t%i==0:\r\n\t\t\tl.append(i)\r\n\tk+=max(l)\r\n\tt=max(l)\t\t\r\nprint(k)", "\r\nn = int(input())\r\nfrom math import sqrt\r\nans = n\r\nwhile n > 1:\r\n\tfor i in range(2, int(sqrt(n)) + 1):\r\n\t\tif n % i == 0:\r\n\t\t\tans += n // i\r\n\t\t\tn //= i\r\n\t\t\tbreak\r\n\telse:\r\n\t\tans += 1\r\n\t\tbreak\r\n\r\n\r\nprint(ans)", "import sys,math,io,os,time,itertools,collections\r\nmod=10**9+7\r\nsys.setrecursionlimit(10000)\r\ni=sys.stdin.readline\r\np=sys.stdout.write\r\n#use sys.stdout.write() (remember to convert to str b4 and concatenate \"\\n\")\r\nglobal start,end\r\n\r\ndef primefac(n):\r\n l=[]\r\n while n%2==0:\r\n l.append(2)\r\n n=n//2\r\n p=3\r\n while p*p<=n:\r\n while n%p==0:\r\n l.append(p)\r\n n=n//p\r\n p+=2\r\n if n>2:\r\n l.append(n)\r\n return l\r\n\r\ndef main():\r\n n=int(i())\r\n tot=n\r\n for el in primefac(n):\r\n n=n//el\r\n tot+=n\r\n p(str(tot)+\"\\n\")\r\n\r\nt=1\r\n#t=int(i())\r\nstart=time.perf_counter()\r\nfor _ in range(t):\r\n main()\r\nend=time.perf_counter()\r\n#print(end-start)", "n=int(input())\r\nr=n+1\r\ni=2\r\ns=n**0.5\r\nwhile i<=s:\r\n if n%i==0:\r\n r+=n//i\r\n n//=i\r\n s=n**0.5\r\n i=1\r\n i+=1\r\nprint(r)", "def function( n ) :\r\n ans = n\r\n m = 2\r\n while m <= n :\r\n if n % m == 0 :\r\n ans += n//m\r\n n = n//m\r\n else :\r\n m += 1\r\n return ans\r\n\r\nif __name__ == \"__main__\" :\r\n n = int(input())\r\n print( function( n ) )\r\n \r\n", "import math\r\nprimes=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,\r\n 61,67,71,73,79,83,89,97,101,103,107,109,113,127,\r\n 131,137,139,149,151,157,163,167,173,179,181,191,\r\n 193,197,199,211,223,227,229,233,239,241,251,257,\r\n 263,269,271]\r\n \r\n \r\nn=int(input())\r\n\r\ntot=n\r\n\r\nfor i in range(len(primes)):\r\n while n%primes[i]==0:\r\n\t tot+=n//primes[i]\r\n\t n=n//primes[i]\r\n\r\nprint(tot)\r\n\r\n", "n=int(input())\r\ni=2\r\ns=1+n\r\nwhile i<n//2+1:\r\n i=i+1\r\n if n%(i-1)==0:\r\n n=n//(i-1)\r\n s=s+n\r\n i=2\r\nprint(s)", "\r\nn = int(input())\r\n\r\nans = n\r\nwhile n > 1:\r\n\tfor i in range(2, n + 1):\r\n\t\tif n % i == 0:\r\n\t\t\tans += n // i\r\n\t\t\tn //= i\r\n\t\t\tbreak\r\n\r\n\r\nprint(ans)\r\n", "n = int(input())\ncount = n\n\nwhile True:\n if n == 1:\n break\n\n for i in range(2, n+1):\n if n % i == 0:\n n = int(n / i)\n count += n\n break\n\n\nprint(count)\n\n", "import math\r\nprimes=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,\r\n 61,67,71,73,79,83,89,97,101,103,107,109,113,127,\r\n 131,137,139,149,151,157,163,167,173,179,181,191,\r\n 193,197,199,211,223,227,229,233,239,241,251,257,\r\n 263,269,271,277,281,293,\t307,\t311,\t313,\t317,\t331,\t337,\t347,\t349,\r\n353,359\t,367,373,379,383,389,397,401,409,419,\t421,\t431\t,433\t,439\t,443\t,449\t,457\t,461\t,463\r\n,467\t,479\t,487\t,491\t,499\t,503\t,509\t,521\t,523\t,541\r\n,547\t,557\t,563\t,569\t,571\t,577\t,587\t,593\t,599\t,601\r\n,607\t,613\t,617\t,619\t,631\t,641\t,643\t,647\t,653\t,659\r\n,661\t,673\t,677\t,683\t,691\t,701\t,709\t,719\t,727\t,733\r\n,739\t,743\t,751\t,757\t,761\t,769\t,773\t,787\t,797\t,809\r\n,811\t,821\t,823\t,827\t,829\t,839\t,853\t,857\t,859\t,863\r\n,877\t,881\t,883\t,887\t,907\t,911\t,919\t,929\t,937\t,941\r\n,947\t,953\t,967\t,971\t,977\t,983\t,991\t,997\t,1009\t,1013\r\n,1019\t,1021\t,1031\t,1033\t,1039\t,1049\t,1051\t,1061\t,1063,\t1069\r\n,1087,\t1091,\t1093,\t1097,\t1103,\t1109,\t1117,\t1123,\t1129,\t1151\r\n,1153,\t1163,\t1171,\t1181,11897,36709,\t1187,\t1193,\t1201,\t1213,\t1217,31607]\r\n \r\n \r\nn=int(input())\r\n\r\ntot=n\r\n\r\nfor i in range(len(primes)):\r\n while n%primes[i]==0:\r\n\t tot+=n//primes[i]\r\n\t n=n//primes[i]\r\n\t \r\n\t \r\nif n==1:\r\n\tprint(tot)\r\nelse:\r\n\tprint(tot+1)\r\n\t", "n = int(input())\r\nd = 2\r\nr = 1\r\nwhile d * d <= n:\r\n while n % d < 1:\r\n r += n\r\n n //= d\r\n d += 1\r\nif n > 1:\r\n r += n\r\nprint(r)\r\n", "import math\r\n\r\nn = int(input())\r\ni = 2\r\nans = n\r\nwhile (n>1):\r\n while (n%i==0):\r\n n = n//i\r\n ans+=n\r\n i+=1\r\nprint(ans)\r\n\r\n \r\n", "n = int(input())\r\nm = n\r\nwhile n > 1:\r\n div = 2\r\n while n % div != 0:\r\n div += 1\r\n m += n // div\r\n n = n // div\r\n\r\nprint(m)\r\n", "m = int(input())\r\nn = int(m**0.5)\r\nprime = [2]\r\nnumbers = {i : True for i in range(3, n+1,2)}\r\np = 3\r\nwhile numbers and p <= n:\r\n if p in numbers:\r\n prime.append(p)\r\n i = 1\r\n while numbers and i*p < n+1:\r\n if i*p in numbers:\r\n del numbers[i*p]\r\n i += 1\r\n p += 2\r\nans = m\r\nwhile m > 1:\r\n for pn in prime:\r\n if m%pn == 0:\r\n ans += m//pn\r\n m //= pn\r\n break\r\n else:\r\n ans += 1\r\n m = 1\r\nprint(ans)", "import math\r\nn=int(input())\r\ns=n\r\ni=n\r\nwhile(i!=1):\r\n j=2\r\n f=0\r\n while(j<=int(math.sqrt(i))):\r\n if i%j==0:\r\n s+=i//j\r\n i=i//j\r\n f=1\r\n break\r\n else:\r\n j+=1\r\n if f==0:\r\n s+=1\r\n break\r\nprint(s)\r\n \r\n ", "import math\r\nn = int(input())\r\n\r\nresult = 0\r\nnum = 2\r\nsqrt_n = math.sqrt(n)\r\nresult += n\r\nwhile num <= sqrt_n:\r\n\tif n % num == 0:\r\n\t\tresult += n // num\r\n\t\tn //= num\r\n\t\tsqrt_n = math.sqrt(n)\r\n\t\tnum = 1\r\n\tnum += 1\r\nresult += 1\r\nprint(result)\r\n\t\t\r\n\t\t", "from sys import *\r\n\r\ndef calc(n):\r\n z=n\r\n c=0\r\n x=n//2\r\n while(x>0):\r\n if(n%x==0):\r\n c=c+x;\r\n n=x;\r\n x=x//2;\r\n \r\n else:\r\n x-=1;\r\n \r\n print(c+z);\r\n \r\nn=int(input())\r\ncalc(n);\r\n", "from sys import*\r\nimport math\r\ndef next_c(c):\r\n\tx = int(math.sqrt(c))\r\n\ti = 2\r\n\twhile(i<=x):\r\n\t\tif((c%(i)) == 0):\r\n\t\t\treturn int(c/i)\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\ti = i+1\r\n\tif(i > x):\r\n\t\treturn 1\r\ndef game(n):\r\n\tsum = n\r\n\tr =next_c(n)\r\n\twhile(r != 1):\r\n\t\tsum = sum + r\r\n\t\tr = next_c(r)\r\n\treturn sum+1\r\nn = int(input())\r\nprint(game(n))", "from math import sqrt\r\n\r\nn = int(input())\r\nresult = n\r\nfor i in range(2, int(sqrt(n)) + 1):\r\n while n % i == 0:\r\n result += n // i\r\n n //= i\r\n if n == i:\r\n n //= i\r\n result += 1\r\n break\r\nif n > 1:\r\n result += 1\r\nprint(result)\r\n\r\n", "def f(n):\r\n if n==1:\r\n return 1\r\n l=[]\r\n i=2\r\n while i*i<=n:\r\n if n%i==0:\r\n l.append(i)\r\n g=n//i\r\n if not f in l:\r\n l.append(g)\r\n i+=1\r\n if len(l)==0:\r\n return n+1\r\n list2=list(map(f,l))\r\n return n+max(list2)\r\n \r\nn=int(input())\r\nprint(f(n))", "n = int(input())\r\ntotal = n\r\nwhile(n != 1):\r\n\tfor i in range(2, 40000):\r\n\t\tif(n % i == 0):\r\n\t\t\tn = n // i\r\n\t\t\ttotal += n\r\n\t\t\tbreak\r\nprint(total)", "n = int(input())\r\nL = [n]\r\n\r\ndef prime_list(x):\r\n Lprem = [2,3,5]\r\n if x >= 6:\r\n candidates = [1,3,7,9]\r\n for k in range(6,x+1) :\r\n last_digit = int(str(k)[-1])\r\n if last_digit not in candidates :\r\n continue\r\n else :\r\n Lk=[(k/i).is_integer() for i in Lprem]\r\n if True not in Lk:\r\n Lprem.append(k)\r\n else:\r\n for i in range(2):\r\n if x >= Lprem[i] and x < Lprem[i+1]:\r\n Lprem = Lprem[:i+1]\r\n break\r\n return Lprem\r\n\r\nprimes = prime_list(n)\r\n\r\nwhile n != 1:\r\n if n in primes:\r\n n = 1\r\n L.append(n)\r\n else:\r\n for prime in primes:\r\n if n%prime == 0:\r\n n = n//prime\r\n L.append(n)\r\n break\r\n \r\nprint(sum(L))", "def calc(n):\r\n j=int(n//2)\r\n c=1\r\n while j>1:\r\n if n%j==0:\r\n c=j\r\n break\r\n j=j-1\r\n return c\r\nn=int(input())\r\nsm=0\r\nwhile n>1:\r\n sm=sm+n\r\n n=calc(n)\r\nprint(sm+1)", "def ld(n):\r\n k = int(n**0.5)\r\n for i in range(2, k+2):\r\n if i == k+1:\r\n return 1\r\n elif n % i == 0:\r\n return n // i\r\n\r\n\r\nn = int(input())\r\nans = 1\r\nwhile n != 1:\r\n ans += n\r\n n = ld(n)\r\nprint(ans)\r\n\r\n", "n=int(input())\r\ny=int(n)\r\nh=int(0)\r\nc=int(0)\r\nwhile y!=0 :\r\n c=c+y\r\n # print(y)\r\n for i in range (1,y+1) :\r\n if y % i == 0 and i!=1 :\r\n h=i\r\n # print(i,\"-\")\r\n break\r\n if h == 0 :\r\n h=1 \r\n y=y//h\r\nprint(c) \r\n\r\n", "def biggest_divider(a):\r\n n = 2\r\n end = a // n\r\n while True:\r\n if a % n == 0:\r\n return n\r\n else:\r\n n += 1\r\n end = a // n\r\n if end < n:\r\n return 1\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\ndef main_function():\r\n n = int(input())\r\n counter = n\r\n while True:\r\n if n == 2:\r\n counter += 1\r\n break\r\n elif biggest_divider(n) == 1:\r\n counter += 1\r\n break\r\n else:\r\n counter += n // biggest_divider(n)\r\n n = n // biggest_divider(n)\r\n print(counter)\r\n\r\n\r\n\r\n\r\n\r\nmain_function()", "n = int(input())\r\ni, s = 2, n \r\nwhile n > 1:\r\n if n % i: i += 1\r\n else:\r\n n //= i\r\n s += n\r\nprint(s)", "n=int(input())\r\nt=2\r\nc=0\r\nwhile (n!=1):\r\n if (n%t==0):\r\n c=c+n\r\n n=n/t\r\n t=2\r\n else:\r\n t=t+1\r\n\r\nc=c+1\r\nprint(int(c))\r\n", "#from tqdm import tqdm\nn = int(input())\ntotal = n\nprev_result = 2\nwhile(n != 1):\n\t#print(\"n = %d\"%(n))\n\ta = 0\n\t#for i in tqdm(range(prev_result, 40000)):\n\tfor i in range(prev_result, 40000):\n\t\tif(n % i == 0):\n\t\t\ta = 1\n\t\t\tn = n // i\n\t\t\ttotal += n\n\t\t\tprev_result = i\n\t\t\tbreak\n\tif(a == 0):\n\t\ttotal += 1\n\t\tbreak\nprint(total)", "def checkPrime(n):\r\n c = 0\r\n for i in range(2, int(n ** (0.5)) + 1):\r\n if n % i == 0:\r\n return n // i\r\n return 1\r\n\r\n\r\nn = int(input())\r\ns = n\r\nwhile n > 1:\r\n n = checkPrime(n)\r\n s += n\r\nprint(s)\r\n", "X, SUM = int(input()), 0\r\nwhile X != 1:\r\n Found, SUM = False, SUM + X\r\n for i in range(2, X + 1):\r\n if X % i == 0:\r\n X = X // i\r\n break\r\nprint(SUM + 1)\r\n\r\n# UB_CodeForces\r\n# Advice: Just remember this \" Your the most important person in the world \"\r\n# Location: Under the sunshine\r\n# Caption: Happy because of \"EXCITE\"\r\n" ]

[ "# from dust i have come, dust i will be\r\n\r\nn = int(input())\r\na = []\r\n\r\nfor i in range(n):\r\n x = input()\r\n a.append(x)\r\n\r\narr = []\r\nfor i in range(26):\r\n arr.append(chr(i + ord('a')))\r\n\r\nfor i in range(26):\r\n for j in range(26):\r\n arr.append(arr[i] + chr(j + ord('a')))\r\n\r\nfor i in range(len(arr)):\r\n cnt = 0\r\n for j in range(n):\r\n if arr[i] not in a[j]:\r\n cnt += 1\r\n if cnt == n:\r\n print(arr[i])\r\n exit(0)\r\n", "import math\r\n \r\n \r\ndef functie_divizori(numar):\r\n \r\n \r\n dictionar={}\r\n \r\n matrice=[]\r\n if numar==1:\r\n a=[1]*2\r\n a.append(0)\r\n a.append(0)\r\n matrice.append(a)\r\n else: \r\n for j in range(1,math.floor(numar**(1/2))+1):\r\n # print(\"j=\",j)\r\n \r\n if numar%j==0:\r\n tupleta=[]\r\n # print(dictionar)\r\n \r\n \r\n \r\n \r\n \r\n \r\n tupleta.append(j)\r\n tupleta.append(numar//j)\r\n tupleta.append(0)\r\n tupleta.append(0)\r\n matrice.append(tupleta)\r\n tupleta=[]\r\n \r\n if numar//j!=j:\r\n tupleta=[]\r\n tupleta.append(numar//j)\r\n tupleta.append(j)\r\n tupleta.append(0)\r\n tupleta.append(0)\r\n \r\n \r\n matrice.append(tupleta)\r\n return matrice\r\n \r\n#n,m,k=list(map(int, input().split()))\r\nalfabet = {'a': 1, 'b': 2,'c': 3,'d': 4,'e': 5,'f': 6,'g': 7,'h': 8,'i': 9,'j': 10,'k': 11,'l': 12,'m': 13,'n': 14,'o': 15,'p': 16,'q': 17,'r': 18,'s': 19,'t': 20,'u': 21,'v': 22,'w': 23,'x': 24,'y': 25,'z': 26}\r\nalfabet_2={'1':\"a\", '2':\"b\", '3':\"c\", '4':\"d\", '5':\"e\", '6':\"f\", '7':\"g\", '8':\"h\", '9':\"i\", '10':\"j\", '11':\"k\", '12':\"l\", '13':\"m\", '14':\"n\", '15':\"o\", '16':\"p\", '17':\"q\", '18':\"r\", '19':\"s\", '20':\"t\", '21':\"u\", '22':\"v\", '23':\"w\", '24':\"x\", '25':\"y\", '26':\"z\"} \r\n\r\ndictionar_1={}\r\ndictionar_2={}\r\n\r\ndictionar_1=alfabet\r\n\r\nfor i in range(1,27):\r\n for j in range(1,27):\r\n element=alfabet_2[str(i)] + alfabet_2[str(j)]\r\n dictionar_2[element]=(i-1)*26+j\r\n \r\ndictionar_unu=dict(dictionar_1)\r\ndictionar_doi=dict(dictionar_2)\r\n\r\n#print(dictionar_1)\r\n#print(dictionar_2)\r\n \r\n\r\n\r\n\r\ncazuri=int(input())\r\n \r\n#vector_a=list(map(int,input().split()))\r\n#vector_b=list(map(int,input().split()))\r\n \r\n#print(functie_divizori(2))\r\n \r\nfor tt in range(cazuri):\r\n #print(\"tt=\",tt)\r\n #n,x=map(int,input().split())\r\n# bloc=list(map(int, input().split()))\r\n#bloc.sort()\r\n# bloc=bloc[::-1]\r\n#print(functie_divizori(9))\r\n \r\n s=input()\r\n for i in dictionar_1:\r\n if i in s:\r\n if i in dictionar_unu:\r\n del dictionar_unu[i]\r\n \r\n \r\n for x in dictionar_2:\r\n if x in s:\r\n if x in dictionar_doi:\r\n del dictionar_doi[x]\r\n \r\nmaximul=1000 \r\nansw=''\r\nif len(dictionar_unu)>0:\r\n for j in dictionar_unu:\r\n if dictionar_unu[j]<maximul:\r\n maximul=dictionar_unu[j]\r\n answ=j\r\n \r\nelse:\r\n for j in dictionar_doi:\r\n if dictionar_doi[j]<maximul:\r\n maximul=dictionar_doi[j]\r\n answ=j\r\n \r\nprint(answ) ", "import string\r\ns=' '.join(input()for i in range(int(input())))\r\nalph= string.ascii_lowercase\r\nfor i in alph:\r\n if i not in s:print(i);exit()\r\nfor i in alph:\r\n for j in alph:\r\n if i+j not in s:print(i+j);exit()", "n = int(input())\nall = set()\nfor w in range(n):\n\ts = input()\n\tfor i in range(len(s) + 1):\n\t\tfor j in range(i):\n\t\t\tall.add(s[j:i])\ncnt = 0\nlimit = 26\nl = 1\nwhile True:\n\ts = ''\n\ttmp = cnt\n\tfor i in range(l):\n\t\ts = chr(ord('a') + tmp % 26) + s\n\t\ttmp //= 26\n\tif s not in all:\n\t\tprint(s)\n\t\tbreak\n\tcnt += 1\n\tif cnt == limit:\n\t\tcnt = 0\n\t\tlimit *= 26\n\t\tl += 1\n", "import re\nimport itertools\nfrom collections import Counter\n\nclass Task:\n strings = []\n answer = \"\"\n\t\n def getData(self):\n numberOfStrings = int(input())\n for i in range(0, numberOfStrings):\n self.strings += [input()]\n\t\n def solve(self):\n badStrings = set()\n for current in self.strings:\n for left in range(0, len(current)):\n for right in range(left + 1, len(current) + 1):\n badStrings.add(current[left : right])\n alphabet = []\n for character in range(ord('a'), ord('z') + 1):\n alphabet += [chr(character)]\n \n for answerLength in range(1, 21 + 1):\n for p in itertools.product(alphabet, repeat = answerLength):\n string = re.sub(\"[^\\w]\", \"\", str(p));\n if string not in badStrings:\n self.answer = string\n return\n\n def printAnswer(self):\n print(self.answer)\n\ntask = Task();\ntask.getData();\ntask.solve();\ntask.printAnswer();\n", "n = int(input())\r\narr = []\r\nfor i in range(n):\r\n\tarr += [input()]\r\ns = '+'.join(arr)\t\r\nq = 'abcdefghijklmnopqrstuvwxyz'\r\nfor i in q:\r\n if i not in s:\r\n print(i)\r\n break\r\nelse:\r\n for i in q:\r\n for j in q:\r\n if i+j not in s:\r\n print(i+j)\r\n exit()\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nN = int(input())\r\nS = []\r\nfor _ in range(N):\r\n S.append(input())\r\nm = 26\r\nd1,d2,d3=[0]*m,[0]*(m**2),[0]*(m**3)\r\nfor s in S:\r\n for c in s:\r\n d1[ord(c)-ord('a')] = 1\r\n for i in range(len(s)-1):\r\n t = s[i:i+2]\r\n t1 = ord(t[0])-ord('a')\r\n t2 = ord(t[1])-ord('a')\r\n d2[t1*m+t2] = 1\r\n for i in range(len(s)-2):\r\n t = s[i:i+3]\r\n t1 = ord(t[0])-ord('a')\r\n t2 = ord(t[1])-ord('a')\r\n t3 = ord(t[2])-ord('a')\r\n d3[t1*m*m+t2*m+t3] = 1\r\n\r\nfor i in range(m):\r\n if d1[i]==0:\r\n exit(print(chr(i+ord('a'))))\r\n\r\nfor i in range(m*m):\r\n if d2[i]==0:\r\n t1 = i//26\r\n t2 = i%26\r\n exit(print(chr(t1+ord('a'))+chr(t2+ord('a'))))\r\n \r\nfor i in range(m*m*m):\r\n if d3[i]==0:\r\n t3 = i%26\r\n i//=26\r\n t1 = i//26\r\n t2 = i%26\r\n exit(print(chr(t1+ord('a'))+chr(t2+ord('a'))+chr(t3+ord('a'))))\r\n \r\n ", "n = int(input())\r\nt = ' '.join(input() for i in range(n))\r\nans = 0\r\nfor i in 'abcdefghijklmnopqrstuvwxyz':\r\n if not i in t:\r\n ans = i\r\n break\r\nif not ans:\r\n for i in 'abcdefghijklmnopqrstuvwxyz':\r\n for j in 'abcdefghijklmnopqrstuvwxyz':\r\n if not i + j in t:\r\n ans = i + j\r\n break\r\n if ans: break\r\nprint(ans)", "n = int(input())\r\nlis=[]\r\nss='abcdefghijklmnopqrstuvwxyz'\r\nfor i in range(n):\r\n s=input()\r\n lis.append(s)\r\nk=1 \r\nfor i in range(26):\r\n ser=ss[i]\r\n k=0\r\n for j in lis:\r\n if ser not in j:\r\n k+=1 \r\n if k==n:\r\n print(ser)\r\n exit()\r\nfor i in range(26):\r\n for j in range(26):\r\n ser=ss[i]+ss[j]\r\n k=0\r\n for t in lis:\r\n if ser not in t:\r\n k+=1\r\n if k==n:\r\n print(ser)\r\n exit()\r\n\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\nall = set()\r\ndef subs(s):\r\n\tfor i in range(len(s)):\r\n\t\tfor j in range(i+1,len(s)+1):\r\n\t\t\tall.add(s[i:j])\r\n\r\nn = mint()\r\nfor i in range(n):\r\n\tsubs(minp())\r\n\r\ndef rec(s,n):\r\n\tif n == 0:\r\n\t\tif s not in all:\r\n\t\t\tprint(s)\r\n\t\t\texit(0)\r\n\t\treturn\r\n\tfor i in range(ord('a'),ord('z')+1):\r\n\t\trec(s+chr(i),n-1)\r\n\r\nfor i in range(1,100):\r\n\trec('',i)\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import deque\r\n\r\nn = int(input())\r\na = set()\r\nfor _ in range(n):\r\n s = input()[:-1]\r\n for i in range(1, 4):\r\n for j in range(len(s)+1-i):\r\n a.add(s[j:j+i])\r\n\r\nq = deque([''])\r\nwhile q:\r\n x = q.popleft()\r\n for i in range(97, 123):\r\n if x + chr(i) not in a:\r\n print(x+chr(i))\r\n exit()\r\n q.append(x+chr(i))", "import abc\r\nimport itertools\r\nimport math\r\nfrom math import gcd as gcd\r\nimport sys\r\nimport queue\r\nimport itertools\r\nfrom heapq import heappop, heappush\r\nimport random\r\n\r\n\r\ndef solve():\r\n def F(a, b):\r\n if len(a) != len(b):\r\n if len(a) < len(b):\r\n return a\r\n return b\r\n else:\r\n return min(a, b)\r\n\r\n n = int(input())\r\n\r\n f = set()\r\n for i in range(n):\r\n s = str(input())\r\n for l in range(0, len(s)):\r\n for st in range(0, len(s) - l):\r\n f.add(s[st:st + l + 1])\r\n\r\n res = \"zzzzzzzzzzzzzzzzzzzzz\"\r\n a = \"#qwertyuiopasdfghjklzxcvbnm\"\r\n for i1 in range(27):\r\n for i2 in range(27):\r\n for i3 in range(27):\r\n for i4 in range(27):\r\n e = a[i1] + a[i2] + a[i3] + a[i4]\r\n ne = \"\"\r\n for k in e:\r\n if k != \"#\":\r\n ne += k\r\n if ne != \"\" and ne not in f:\r\n res = F(res, ne)\r\n\r\n print(res)\r\n\r\n\r\nif __name__ == '__main__':\r\n multi_test = 0\r\n\r\n if multi_test == 1:\r\n t = int(sys.stdin.readline())\r\n for _ in range(t):\r\n solve()\r\n else:\r\n solve()\r\n", "class CodeforcesTask278BSolution:\n def __init__(self):\n self.result = ''\n self.n = 0\n self.names = []\n\n def read_input(self):\n self.n = int(input())\n for x in range(self.n):\n self.names.append(input())\n\n def process_task(self):\n used = {}\n for name in self.names:\n for x in range(len(name)):\n for y in range(x, len(name)):\n sub = name[x:y + 1]\n used[sub] = True\n cd = False\n for a in \" abcdefghijklmnopqrstuvwxyz\":\n for b in \" abcdefghijklmnopqrstuvwxyz\":\n for c in \"abcdefghijklmnopqrstuvwxyz\":\n l1 = \"\" if a == \" \" else a\n l2 = \"\" if b == \" \" else b\n l3 = c\n nn = l1 + l2 + l3\n if nn not in used:\n cd = True\n break\n if cd:\n break\n if cd:\n break\n\n self.result = nn\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask278BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "from itertools import product\r\n\r\ndef generate_name(S):\r\n for i in range(1, 9):\r\n for letters in product('abcdefghijklmnopqrstuvwxyz', repeat=i):\r\n name = ''.join(letters)\r\n if all(name not in s for s in S):\r\n return name\r\n\r\n\r\nprint(generate_name([input() for _ in range(int(input()))]))", "cs1 = {chr(x) for x in range(ord('a'), ord('z') + 1)}\r\ncs2 = {x + y for x in cs1 for y in cs1}\r\nfor i in range(int(input())):\r\n s = input()\r\n for i in range(len(s) - 1):\r\n cs1.discard(s[i:i + 1])\r\n cs2.discard(s[i:i + 2])\r\n cs1.discard(s[len(s) - 1:len(s)])\r\nprint(min(cs1) if cs1 else min(cs2))", "from itertools import product\n\n\nn = int(input())\nalls = set()\nfor _ in range(n):\n s = input()\n for i in range(len(s)):\n for j in range(i, len(s)):\n alls.add(s[i:j + 1])\nalphabet = [chr(x) for x in range(97, 123)]\n\nfor z in range(1, 21):\n for x in product(alphabet, repeat=z):\n new_string = ''.join(x)\n if new_string not in alls:\n print(new_string)\n exit()\n", "n=int(input())\r\nalph=\"abcdefghijklmnopqrstuvwxyz\"\r\nL=[]\r\nfor x in range(n):\r\n L.append(input())\r\n \r\ni=0\r\nj=0\r\nk=-1\r\nch=alph[0]\r\nwhile 1:\r\n if ch not in L[i]:\r\n i=i+1\r\n else:\r\n j=j+1\r\n if (j>=26):\r\n if (j>0) and (j%26 ==0):\r\n k=k+1\r\n ch=alph[k]+alph[j%26]\r\n else:\r\n ch=alph[j]\r\n i=0\r\n if i==n:\r\n break\r\nprint(ch)\r\n \r\n", "import string\r\nn = int(input());\r\ns = '.'.join(input() for _ in range(n))\r\na = string.ascii_lowercase\r\nfor i in a:\r\n if i not in s:\r\n print(i);exit()\r\nfor i in a:\r\n for j in a:\r\n if i+j not in s:\r\n print(i+j);exit()\r\n", "#!/usr/bin/python3\n\nn = int(input())\nlst = [input() for _ in range(n)]\nalf = [chr(ord('a') + _) for _ in range(26)]\nans = None\nfor a in alf:\n if not [1 for w in lst if w.find(a) != -1]:\n ans = a\n break\nif ans is not None:\n print(ans)\nelse:\n for a in alf:\n for b in alf:\n t = a + b\n if not [1 for w in lst if w.find(t) != -1]:\n ans = t\n break\n if ans is not None:\n print(ans)\n break\n", "n=int(input())\r\ns=\"\"\r\nfor i in range(n): s+=input()+\"|\"\r\na=\"\"\r\nfor i in range(26): a+=chr(ord(\"a\")+i)\r\nfor c in a:\r\n if not(c in s):\r\n print(c)\r\n exit()\r\nfor c1 in a:\r\n for c2 in a:\r\n if not(c1+c2 in s):\r\n print(c1+c2)\r\n exit()\r\n", "n=int(input())\r\nch=\"\"\r\nwhile(n):\r\n sh=input()\r\n ch+=' ' +sh\r\n n-=1\r\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']\r\nt=False\r\nfor x in l:\r\n if x not in ch:\r\n t=True\r\n print(x)\r\n break\r\nif not t:\r\n for i in range(len(l)):\r\n if not t:\r\n for j in range(len(l)):\r\n s=l[i]+l[j]\r\n if s not in ch :\r\n print (s)\r\n t=True\r\n break\r\n", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n\tl+=[input()]\r\ns=\"+\".join(l)\t\r\nq=\"abcdefghijklmnopqrstuvwxyz\"\r\n \r\nfor i in q:\r\n\tif i not in s:\r\n\t\tprint(i)\r\n\t\tbreak\r\nelse:\t\t\r\n\tfor i in q:\r\n\t\tfor j in q:\r\n\t\t\tif i+j not in s:\r\n\t\t\t\tprint(i+j)\r\n\t\t\t\texit()", "from itertools import *\r\nalphabet=\"abcdefghijklmnopqrstuvwxyz\";\r\n\r\ndef isValid(s, names):\r\n for name in names:\r\n if name.find(s)!=-1:\r\n return False\r\n return True\r\n\r\ndef newProblem(names):\r\n for i in range(1,3):\r\n for s in product(alphabet, repeat=i):\r\n st=\"\"\r\n for c in s:\r\n st+=c\r\n if isValid(st, names):\r\n return st\r\n\r\nn=int(input())\r\nnames=[]\r\nfor i in range(0,n):\r\n name= input()\r\n names.append(name)\r\nprint(newProblem(names))\r\n\r\n\r\n\r\n", "ans=[]\r\nfor i in range(27):\r\n for j in range(27):\r\n for t in range(27):\r\n \r\n tempa=[i,j,t]\r\n s=''\r\n for q in range(len(tempa)):\r\n if(tempa[q]==26):\r\n continue;\r\n else:\r\n s+=chr(tempa[q]+97)\r\n ans.append([len(s),s])\r\n\r\nans.sort()\r\npg=[]\r\n\r\nx=int(input())\r\nfor i in range(x):\r\n s=input()\r\n pg.append(s)\r\n \r\nfor i in range(len(ans)):\r\n flag=0\r\n for j in range(len(pg)):\r\n if(ans[i][1] in pg[j]):\r\n flag+=1\r\n \r\n if(flag==0):\r\n print(ans[i][1])\r\n exit()\r\n \r\n\r\n\r\n\r\n \r\n \r\n", "alpha = \"abcdefghijklmnopqrstuvwxyz\"\r\nn = int(input())\r\ns = \"\"\r\nfor _ in range(n):\r\n s += input() + \" \"\r\nfor x in alpha:\r\n if x not in s:\r\n print(x)\r\n break\r\nelse:\r\n for i in alpha:\r\n for j in alpha:\r\n if i+j not in s:\r\n print(i+j)\r\n quit()", "n = int(input())\r\nsingle = []\r\ndouble = []\r\ntitlesingle = []\r\ntitledouble= []\r\nfor i in range(n):\r\n x = input()\r\n l = list(x)\r\n titlesingle.extend(l)\r\n if len(x) > 1:\r\n for j in range(1, len(x)):\r\n s = x[j - 1] + x[j]\r\n titledouble.append(s)\r\nsets = set(titlesingle)\r\nsetd = set(titledouble)\r\nfor i in range(26):\r\n s = chr(ord('a') + i)\r\n single.append(s)\r\nfor i in range(26):\r\n for j in range(26):\r\n s = chr(ord('a') + i) + chr(ord('a') + j)\r\n double.append(s)\r\nif len(sets) < 26:\r\n ls = list(set(single) - sets)\r\n ls.sort()\r\n print(ls[0])\r\nelse:\r\n ls = list(set(double) - setd)\r\n ls.sort()\r\n print(ls[0])\r\n\r\n\r\n", "n=int(input())\r\nalph=\"abcdefghijklmnopqrstuvwxyz\"\r\nch=\"\"\r\nfor x in range(n):\r\n ch+=\" \"+input()\r\n\r\ndef f():\r\n ch1=\"\"\r\n j=0\r\n for k in range(26):\r\n for i in range(26):\r\n if ch1+alph[i] not in ch:\r\n print(ch1+alph[i])\r\n return\r\n ch1=alph[j]\r\n j+=1\r\n\r\nf()\r\n", "from itertools import *\r\nalphabet=\"abcdefghijklmnopqrstuvwxyz\";\r\n\r\ndef newProblem(names):\r\n for i in range(1,3):\r\n for s in product(alphabet, repeat=i):\r\n st=\"\".join(s)\r\n if names.find(st)==-1:\r\n return st\r\n\r\nn=int(input())\r\nnames=[]\r\nfor i in range(0,n):\r\n name= input()\r\n names.append(name)\r\nnamesstr=\" \".join(names)\r\nprint(newProblem(namesstr))", "import itertools\r\nn = int(input())\r\nd = set()\r\nfor i in range(n):\r\n s = input()\r\n for j in s:\r\n d.add(j)\r\n for j in range(len(s) - 1):\r\n d.add(s[j:j + 2])\r\n\r\n for j in range(len(s) - 2):\r\n d.add(s[j:j + 3])\r\n\r\nR = [i for i in range(26)]\r\n\r\nD = [[] for i in range(3)]\r\na = ord('a')\r\nfor i in range(26):\r\n D[0].append(chr(i + a))\r\n\r\nfor i, j in itertools.product(R, R):\r\n D[1].append(chr(i + a) + chr(j + a))\r\n\r\nfor i, j, k in itertools.product(R, R, R):\r\n D[2].append(chr(i + a) + chr(j + a) + chr(k + a))\r\n\r\nfor i in range(3):\r\n D[i] = sorted(D[i])\r\n for k in D[i]:\r\n if k not in d:\r\n print(k)\r\n exit()", "import string\r\n\r\nn = int(input())\r\n\r\nd = {}\r\ns = \"\"\r\n\r\nfor _ in range(n):\r\n s += input() + \" \"\r\n#print(s)\r\na = string.ascii_lowercase\r\nfor x in a:\r\n if x not in s:\r\n print(x)\r\n exit()\r\n\r\nfor x in a:\r\n for y in a:\r\n if x + y not in s:\r\n print(x+y)\r\n exit()\r\n", "n = int(input())\r\na = []\r\nm = 0\r\nfor i in range(n):\r\n a.append(input())\r\n m = max(m, len(a[i]))\r\nfor i in range(26):\r\n t = chr(97 + i)\r\n possible = True\r\n for k in range(n):\r\n if not possible:\r\n break\r\n for l in range(len(a[k])):\r\n if a[k][l] == t:\r\n possible = False\r\n break\r\n if possible:\r\n print(t)\r\n exit()\r\nfor i in range(26):\r\n for j in range(26):\r\n t = chr(97 + i) + chr(97 + j)\r\n possible = True\r\n for k in range(n):\r\n if not possible:\r\n break\r\n for l in range(len(a[k]) - 1):\r\n if a[k][l:l + 2] == t:\r\n possible = False\r\n break\r\n if possible:\r\n print(t)\r\n exit()\r\n", "n=int(input())\r\nl=set()\r\nfor i in range(n):\r\n s=input()+\"0\"\r\n for i in range(len(s)-1):\r\n l.add(s[i])\r\n l.add(s[i]+s[i+1])\r\nm=\"abcdefghijklmnopqrstuvwxyz\"\r\nk=[*m]\r\nfor i in m:\r\n for j in m:\r\n k+=[i+j]\r\nfor i in k:\r\n if i not in l:\r\n exit(print(i))", "n = int(input())\r\nl = []\r\nogstr = \"abcdefghijklmnopqrstuvwxyz\"\r\nwhile n :\r\n n -= 1\r\n s = input()\r\n l.append(s)\r\nans = \"\"\r\nwhile True :\r\n for i in ogstr :\r\n for s in l :\r\n if i in s :\r\n break\r\n else :\r\n print(i)\r\n exit()\r\n for i in ogstr :\r\n for j in ogstr :\r\n var = i + j\r\n for s in l :\r\n if var in s :\r\n break\r\n else :\r\n print(var)\r\n exit()", "n = int(input())\r\nl = []\r\nfor i in range(n):\r\n l += [input()]\r\ns = \"+\".join(l)\r\nq = \"abcdefghijklmnopqrstuvwxyz\"\r\nfor i in q:\r\n if i not in s:\r\n print(i)\r\n break\r\nelse:\r\n for i in q:\r\n for j in q:\r\n if i + j not in s:\r\n print(i + j)\r\n exit()\r\n", "# from math import *\r\nfrom collections import *\r\nfrom functools import *\r\nfrom bisect import *\r\nfrom itertools import *\r\nfrom heapq import *\r\nimport sys\r\ninf = float('inf')\r\nninf = -float('inf')\r\nip = sys.stdin.readline\r\nalphal = \"abcdefghijklmnopqrstuvwxyz\"\r\nalphau = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\nmod = (10 ** 9) + 7\r\ndef ipl(): return list(map(int, ip().split()))\r\ndef ipn(): return int(ip())\r\ndef ipf(): return float(ip())\r\n\r\n\r\ndef solve():\r\n n = ipn()\r\n l = \"\"\r\n for _ in range(n):\r\n l += ip() + \"_\"\r\n for i in alphal:\r\n if i not in l:\r\n print(i)\r\n break\r\n else:\r\n for i in alphal:\r\n for j in alphal:\r\n if i + j not in l:\r\n print(i + j)\r\n return\r\n\r\n\r\nt = 1 # ipn()\r\nfor _ in range(t):\r\n solve()\r\n", "I=input\r\ns=' '.join(I()for _ in '0'*int(I()))\r\nR=list(map(chr,range(122,96,-1)))\r\nfor i in R:\r\n\tfor j in R:\r\n\t\tif s.count(i+j)==0:r=i+j\r\nfor i in R:\r\n\tif s.count(i)==0:r=i\r\nprint(r)" ]

[ "input=__import__('sys').stdin.readline\r\nn,q,c=map(int,input().split())\r\ndp= [[[0 for i in range(101)] for j in range(101)]for k in range(c+1)]\r\nfor i in range(n):\r\n x,y,s = map(int,input().split())\r\n dp[s][x][y]+=1\r\nfor i in range(c+1):\r\n for j in range(1,101):\r\n for k in range(1,101):\r\n dp[i][j][k] += dp[i][j-1][k]+dp[i][j][k-1]-dp[i][j-1][k-1]\r\nfor _ in range(q):\r\n t,x1,y1,x2,y2 = map(int,input().split())\r\n ans=0\r\n for i in range(c+1):\r\n bright = (i+t)%(c+1)\r\n amt = dp[i][x2][y2] - dp[i][x1-1][y2] - dp[i][x2][y1-1] + dp[i][x1-1][y1-1]\r\n ans+=(bright*amt)\r\n print(ans) ", "import sys\r\ninput = sys.stdin.buffer.readline\r\ndef print(val):\r\n sys.stdout.write(str(val) + '\\n')\r\ndef prog():\r\n n,q,c = map(int,input().split())\r\n initial_sky = [[[] for j in range(101)] for i in range(101)]\r\n sky = [[[0]*101 for j in range(101)] for i in range(c + 1)]\r\n for i in range(n):\r\n x,y,s = map(int,input().split())\r\n initial_sky[x][y].append(s)\r\n \r\n for t in range(c + 1):\r\n for i in range(101):\r\n for j in range(101):\r\n for star in initial_sky[i][j]:\r\n sky[t][i][j] += (star + t)%(c + 1)\r\n \r\n for t in range(c + 1):\r\n for i in range(1,101):\r\n for j in range(1,101):\r\n sky[t][i][j] += sky[t][i-1][j] + sky[t][i][j-1] - sky[t][i-1][j-1]\r\n\r\n for i in range(q):\r\n t,x1,y1,x2,y2 = map(int,input().split())\r\n t %= (c + 1)\r\n print(sky[t][x2][y2] - (sky[t][x2][y1-1] + sky[t][x1-1][y2] - sky[t][x1-1][y1-1]))\r\nprog()\r\n\r\n \r\n \r\n", "from sys import stdin\r\ninput=stdin.readline\r\nimport heapq\r\nimport string\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,deque,Counter\r\nfrom bisect import bisect_left as bl, bisect_right as br\r\nfrom random import randint\r\nfrom math import gcd, ceil, floor,log2\r\nrandom = randint(1, 10 ** 9)\r\nclass wrapper(int):\r\n def __hash__(self):\r\n return super(wrapper, self).__hash__() ^ random\r\n'''\r\nl=t+orignianl\r\nl%(c+1) answer hona chahie\r\n'''\r\nn,q,C=rd()\r\ndx=[[[0]*(11) for i in range(101)] for j in range(101)]\r\ndp=[[[0]*(11) for i in range(101)] for j in range(101)]\r\nfor i in range(n):\r\n x,y,c=rd()\r\n dx[x][y][c]+=1\r\n\r\nfor i in range(1,101):\r\n for j in range(1,101):\r\n dp[i][j]=list(map(lambda a,b,c,d:a+b+c-d,dx[i][j],dp[i-1][j],dp[i][j-1],dp[i-1][j-1]))\r\n\r\n# print(dx[:10])\r\nfor _ in range(q):\r\n base,x1,y1,x2,y2=rd()\r\n # X=list(map(lambda x,y:x-y,dx[x2],dx[x1-1]))\r\n # y=list(map(lambda x,y:x-y,dy[y2],dy[y1-1]))\r\n t=list(map(lambda a,b,c,d:a-b-c+d,dp[x2][y2],dp[x1-1][y2],dp[x2][y1-1],dp[x1-1][y1-1]))\r\n ans=0\r\n # print(t)\r\n for i in range(11):\r\n # print((base+i)%(c+1)\r\n ans+=((base+i)%(C+1))*(t[i])\r\n print(ans)\r\n\r\n", "n,q,c = map(int,input().split())\r\nsky = [[[0] * 11 for j in range(101)] for i in range(101)]\r\nc += 1\r\nfor i in range(n):\r\n x,y,s = map(int,input().split())\r\n sky[y][x][s % c] += 1\r\n \r\nfor k in range(11):\r\n i = 1\r\n while i < 101:\r\n j = 1\r\n while j < 101:\r\n sky[i][j][k] += (sky[i-1][j][k] + sky[i][j-1][k] - sky[i-1][j-1][k])\r\n j += 1\r\n i += 1\r\nreq = [list(map(int,input().split())) for i in range(q)]\r\nfor i in range(q):\r\n t,x,y,x2,y2 = req[i]\r\n ans = 0\r\n j = 0\r\n while j < c:\r\n ans += (sky[y2][x2][j] - sky[y2][x-1][j] - sky[y-1][x2][j] + sky[y-1][x-1][j]) * ((j + t) % c)\r\n j += 1\r\n print(ans)", "\r\nn,q,c=map(int,input().split())\r\nc+=1\r\ncnt=[[[0]*(101) for _ in range(101)] for _ in range(c)]\r\nfor _ in range(n):\r\n x,y,p=map(int,input().split())\r\n cnt[p][x][y]+=1\r\nfor k in range(c):\r\n for i in range(1,101):\r\n for j in range(1,101):\r\n cnt[k][i][j]+=cnt[k][i-1][j]+cnt[k][i][j-1]-cnt[k][i-1][j-1]\r\ndef helper(k,x1,y1,x2,y2):\r\n return cnt[k][x2][y2]+cnt[k][x1][y1]-cnt[k][x1][y2]-cnt[k][x2][y1]\r\nfor _ in range(q):\r\n t,x1,y1,x2,y2=map(int,input().split())\r\n x1-=1\r\n y1-=1\r\n ans=0\r\n for i in range(c):\r\n ans+=helper(i,x1,y1,x2,y2)*((i+t)%c)\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\nfrom __future__ import print_function # for PyPy2\r\nfrom itertools import permutations as perm\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\nmod = int(1e9)+7\r\ninf = float(\"inf\")\r\n\r\nn, q, c = gil()\r\n\r\nf = [ [[0 for _ in range(101)] for _ in range(101)] for _ in range(c+1) ]\r\n\r\nfor _ in range(n):\r\n\tx, y, s = gil()\r\n\tf[s][x][y] += 1\r\n\r\n# pre computation\r\nfor y in range(1, 101):\r\n\tfor x in range(1, 101):\r\n\t\tfor ci in range(c+1):\r\n\t\t\tf[ci][x][y] += f[ci][x][y-1] + f[ci][x-1][y] - f[ci][x-1][y-1] \r\n\r\nfor _ in range(q):\r\n\t\tt, x1, y1, x2, y2 = gil()\r\n\t\tstore = t\r\n\t\t# t %= (c+1)\r\n\t\tval = 0\r\n\t\tfor ci in range(c+1):\r\n\t\t\tfi = f[ci][x2][y2] + f[ci][x1-1][y1-1] - f[ci][x2][y1-1] - f[ci][x1-1][y2] \r\n\t\t\t# if fi:print(\"at time\", store, \"seeing stars with brightness\", ci, ' > ', (t+ci)%(c+1), \" : \", fi)\r\n\t\t\tval += fi*( (t+ci)%(c+1) )\r\n\t\tprint(val)\r\n\t\t# print(\"*************\")\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, q, c = map(int, input().split())\r\nM = 101\r\nw = [[[] for j in range(M)] for i in range(M)]\r\nfor _ in range(n):\r\n a, b, c1 = map(int, input().split())\r\n w[a][b].append(c1)\r\nd = [[[0]*M for j in range(M)] for i in range(c+1)]\r\n\r\nfor j in range(1, M):\r\n for i in range(1, M):\r\n for l in range(c + 1):\r\n d[l][j][i] = d[l][j][i-1] + d[l][j-1][i] - d[l][j-1][i-1]\r\n for k in w[i][j]:\r\n d[l][j][i] += (k + l)%(c+1)\r\n\r\nfor _ in range(q):\r\n t, a1, a2, a3, a4 = map(int, input().split())\r\n t %= (c+1)\r\n print(d[t][a4][a3] - d[t][a4][a1-1] - d[t][a2-1][a3] + d[t][a2-1][a1-1])\r\n\r\n", "from sys import stdin\r\ninput = stdin.readline\r\nadd_mod = lambda a, b: (a % c + b % c) % c\r\nN = 101\r\n\r\nn, q, c = map(int, input().split())\r\nc += 1\r\nstar = [list(map(int, input().split())) for _ in range(n)]\r\nview = [list(map(int, input().split())) for _ in range(q)]\r\ndp = [[[0 for _ in range(N)] for _ in range(N)] for _ in range(11)] \r\n\r\nfor mod in range(11):\r\n for i, j, k in star:\r\n dp[mod][i][j] += add_mod(k, mod)\r\n\r\nfor mod in range(11):\r\n for i in range(1, N):\r\n for j in range(1, N):\r\n dp[mod][i][j] += dp[mod][i][j - 1]\r\n\r\nall_res = []\r\nfor t, x1, y1, x2, y2 in view:\r\n tem = 0\r\n for i in range(x1, x2+1):\r\n tem += dp[t%c][i][y2] - dp[t%c][i][y1-1]\r\n all_res.append(str(tem))\r\n \r\nprint('\\n'.join(all_res))\r\n", "# n,q,c=map(int, input().split())\r\n\r\n# dp=[[[0 for _ in range(11)] for _ in range(101)] for _ in range(101)]\r\n# for i in range(n):\r\n# a,b,s=map(int, input().split())\r\n# dp[a][b][0]=s\r\n# for j in range(1,11):\r\n# dp[a][b][j]=(dp[a][b][j-1]+1)%(c+1)\r\n# # for x in range(1,101):\r\n# # for y in range(1,101):\r\n# # for s in range(1,11):\r\n# # if dp[x][y][s-1]!=-1:\r\n# # dp[x][y][s]=(dp[x][y][s-1]+1 )%(c+1)\r\n \r\n# # for i in range(101):\r\n# # for j in range(101):\r\n# # for k in range(11):\r\n# # if dp[i][j][k]==-1:\r\n# # dp[i][j][k]=0\r\n# for s in range(11):\r\n# for x in range(1,101):\r\n# for y in range(1,101):\r\n# dp[x][y][s]+=dp[x-1][y][s]+dp[x][y-1][s]-dp[x-1][y-1][s]\r\n\r\n# for _ in range(q):\r\n# t,x1,y1,x2,y2=map(int, input().split())\r\n# t=t%(c+1)\r\n# # if n==5000:\r\n# # print(t,x1,y1,x2,y2)\r\n# print(dp[x2][y2][t]-dp[x2][y1-1][t]-dp[x1-1][y2][t]+dp[x1-1][y1-1][t]) \r\n \r\n \r\nn, q, c = map(int,input().split())\r\n\r\nstars = [ list( map(int,input().split()) ) for i in range(n)]\r\nqueries = [ list( map(int,input().split()) ) for i in range(q)]\r\n\r\nprec = [[[0 for y in range(101)]for x in range(101)] for i in range(c+1)] #0, c\r\nfor x, y, s in stars:\r\n for t in range(c+1):\r\n prec[t][x][y] += s+t if s+t <= c else s+t-(c+1)\r\n\r\nfor s in range(len(prec)):\r\n for x in range(len(prec[s])):\r\n for y in range(len(prec[s][x])):\r\n if x and y:\r\n prec[s][x][y] += prec[s][x-1][y]+prec[s][x][y-1]-prec[s][x-1][y-1]\r\n\r\n\r\n\r\nfor t, x1, y1, x2, y2 in queries:\r\n s = t%(c+1)\r\n res = ( prec[s][x2][y2]-prec[s][x1-1][y2]-prec[s][x2][y1-1]+prec[s][x1-1][y1-1] )\r\n print(res)\r\n\r\n\r\n", "import random, math\nfrom copy import deepcopy as dc\n\nMAXX = 101\nMAXY = 101\n\n\n# Function to take input\ndef input_test():\n\tn, q, c = map(int, input().strip().split(\" \"))\n\tst = [[[0 for i in range(MAXX)] for j in range(MAXY)] for k in range(c+1)]\n\t\n\t# Taking Input and marking the values in the \n\t# Frequency array and the grid that the star is present\n\tfor _ in range(n):\n\t\tx, y, s = map(int, input().strip().split(\" \"))\n\t\tfor t in range(c+1):\n\t\t\tst[t][x][y] += (s+t) % (c+1)\n\n\tfor k in range(c + 1):\n\t\tfor i in range(1,MAXX):\n\t\t\tfor j in range(1,MAXY):\n\t\t\t\tst[k][i][j] = st[k][i][j] + st[k][i-1][j] + st[k][i][j-1] - st[k][i-1][j-1]\n\t\n\n\tcomp = st\n\t# for i in comp:\n\t# \tfor j in i:\n\t# \t\tprint(j)\n\t# \tprint(\"Done\")\n\n\t# Taking the Queries\n\tfor _ in range(q):\n\t\tt, x1, y1, x2, y2 = map(int, input().strip().split(\" \"))\n\t\t# t = t % (c+1)\n\t\tt = t % (c+1)\n\t\tto_be_add = comp[t][x1-1][y1-1]\n\t\ttot = comp[t][x2][y2] - comp[t][x2][y1-1] - comp[t][x1-1][y2] + to_be_add\n\t\tprint(tot)\n\n\n\n\n# Function to check test my code\ndef test():\n\tpass\n\n\ninput_test()\n# test()", "import sys\r\ninput = lambda : sys.stdin.readline().rstrip(\"\\r\\n\")\r\nn,q,c = map(int,input().split())\r\nd = [[[0 for _ in range(c+1)] for _ in range(101)] for _ in range(101)]\r\nfor i in range(n):\r\n x,y,s = map(int,input().split())\r\n d[x][y][s] += 1\r\n\r\nfor i in range(101):\r\n for j in range(101):\r\n for k in range(c+1):\r\n d[i][j][k] += d[i-1][j][k] + d[i][j-1][k] - d[i-1][j-1][k]\r\n \r\nfor _ in range(q):\r\n t,x1,y1,x2,y2 = map(int,input().split())\r\n ans = 0\r\n for i in range(c+1):\r\n ans += ((i+t)%(c+1))*(d[x2][y2][i] - d[x1-1][y2][i] - d[x2][y1-1][i] + d[x1-1][y1-1][i])\r\n \r\n sys.stdout.write(str(ans))\r\n sys.stdout.write(\"\\n\")", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn,q,c = list(map(int,input().split()))\r\nd = [[[0 for _ in range(17)] for _ in range(108)] for _ in range(108)]\r\n\r\nfor i in range(0,n):\r\n x,y,s = list(map(int,input().split()))\r\n d[x][y][s] += 1\r\n \r\nfor x in range(1,101):\r\n for y in range(1,101):\r\n for p in range(0,c+1):\r\n d[x][y][p] += d[x-1][y][p] + d[x][y-1][p] - d[x-1][y-1][p]\r\n\r\nfor i in range(0,q):\r\n t,x1,y1,x2,y2 = list(map(int,input().split()))\r\n ans = 0\r\n \r\n for p in range(0,c+1):\r\n ans += ((p+t)%(c+1))*(d[x2][y2][p]-d[x2][y1-1][p]-d[x1-1][y2][p]+d[x1-1][y1-1][p])\r\n \r\n print(ans)", "import sys\r\ninput=sys.stdin.readline\r\nn,q,c=map(int,input().split())\r\ndp=[]\r\nfor i in range(101):\r\n k=[]\r\n for j in range(101):\r\n k.append([0]*(11))\r\n dp.append(k)\r\nfor i in range(n):\r\n x,y,s=map(int,input().split())\r\n dp[x][y][s]+=1\r\nfor i in range(1,101):\r\n for s in range(11):\r\n dp[i][0][s]+=dp[i-1][0][s]\r\nfor i in range(1,101):\r\n for s in range(11):\r\n dp[0][i][s]+=dp[0][i-1][s]\r\nfor j in range(101):\r\n for i in range(101):\r\n if i>0 and j>0:\r\n for s in range(11):\r\n dp[i][j][s]+=(dp[i-1][j][s]+dp[i][j-1][s]-dp[i-1][j-1][s])\r\nfor j in range(q):\r\n p,x1,y1,x2,y2=map(int,input().split())\r\n k=[0]*(11)\r\n ans=0\r\n for i in range(11):\r\n if x1>0 and y1>0:\r\n k[i]=(dp[x2][y2][i]-dp[x2][y1-1][i]-(dp[x1-1][y2][i]-dp[x1-1][y1-1][i]))\r\n elif x1>0 and y1==0:\r\n k[i] = (dp[x2][y2][i] - (dp[x1 - 1][y2][i]))\r\n elif y1>0 and x1==0:\r\n k[i] = (dp[x2][y2][i]-dp[x2][y1-1][i])\r\n else:\r\n k[i]=dp[x2][y2][i]\r\n if i>=c:\r\n if p==0:\r\n r=i\r\n else:\r\n r=(p-1)%(c+1)\r\n else:\r\n if p>(c-i):\r\n r=(p-1-(c-i))%(c+1)\r\n else:\r\n r=(p+i)\r\n ans+=(k[i])*(r)\r\n print(ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "import sys\r\ninput=sys.stdin.buffer.readline\r\n\r\nn,q,bright=map(int,input().split())\r\ndp=[[[0 for j in range(11)] for i in range(100+3)] for k in range(100+3)]\r\nfor i in range(n):\r\n a,b,c=map(int,input().split())\r\n dp[a][b][c]+=1\r\n\r\nfor i in range(1,101):\r\n for j in range(1,101):\r\n for k in range(11):\r\n dp[i][j+1][k]+=dp[i][j][k]\r\n\r\nfor i in range(1,101):\r\n for j in range(1,101):\r\n for k in range(11):\r\n dp[j+1][i][k]+=dp[j][i][k]\r\nfor i in range(q):\r\n t,l_x,l_y,h_x,h_y=map(int,input().split())\r\n l_x-=1\r\n l_y-=1\r\n arr=[]\r\n a=dp[h_x][h_y]\r\n b=dp[h_x][l_y]\r\n c=dp[l_x][h_y]\r\n d=dp[l_x][l_y]\r\n for i in range(11):\r\n arr.append(a[i]-b[i]-c[i]+d[i])\r\n ans=0\r\n for j in range(11):\r\n ans+=((j+t)%(bright+1)) * arr[j]\r\n print(ans)", "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 * l + v\r\n\r\nn, q, c = map(int, input().split())\r\nc += 1\r\nl = 101\r\nl2 = l * l\r\nm = l2 * c\r\ndp = [0] * m\r\nfor _ in range(n):\r\n x, y, s = map(int, input().split())\r\n u = f(x, y)\r\n for i in range(u, m, l2):\r\n dp[i] += s\r\n s = (s + 1) % c\r\nfor j in range(1, l):\r\n for k in range(1, l):\r\n u, x, y, z = f(j, k), f(j - 1, k), f(j, k - 1), f(j - 1, k - 1)\r\n for i in range(0, m, l2):\r\n dp[u + i] += dp[x + i] + dp[y + i] - dp[z + i]\r\nans = []\r\nfor _ in range(q):\r\n t, x1, y1, x2, y2 = map(int, input().split())\r\n t = (t % c) * l2\r\n u, z = f(x2, y2) + t, f(x1 - 1, y1 - 1) + t\r\n x, y = f(x1 - 1, y2) + t, f(x2, y1 - 1) + t\r\n ans0 = dp[u] - dp[x] - dp[y] + dp[z]\r\n ans.append(ans0)\r\nsys.stdout.write(\"\\n\".join(map(str, ans)))", "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\ndp = {}\r\n\r\ndef fun(A):\r\n B = list2d(101,101,0)\r\n for j in range(101):\r\n B[0][j] = A[0][j]\r\n for i in range(1,101):\r\n for j in range(101):\r\n B[i][j] = A[i][j] + B[i-1][j]\r\n for i in range(101):\r\n for j in range(1,101):\r\n B[i][j] = B[i][j] + B[i][j-1]\r\n return B\r\n\r\nn,q,c = ilele()\r\nG = defaultdict(list)\r\nfor i in range(n):\r\n a,b,s = ilele()\r\n G[(a,b)].append(s)\r\n#print(G)\r\nfor i in range(c+1):\r\n #print(i,c)\r\n A = list2d(101,101,0)\r\n for j in range(1,101):\r\n for k in range(1,101):\r\n x = G.get((j,k),[])\r\n for l in x:\r\n r = (l + i)%(c+1)\r\n #print(j,k,r,l,i)\r\n A[j][k] += r\r\n B = fun(A)\r\n dp[i] = B\r\n\r\nfor i in range(q):\r\n t,x1,y1,x2,y2 = ilele()\r\n t %= (c+1)\r\n #print(dp[t][x2][y2],dp[t][x2][y1])\r\n ans = dp[t][x2][y2]\r\n ans -= dp[t][x2][y1-1]\r\n ans -= dp[t][x1-1][y2]\r\n ans += dp[t][x1-1][y1-1]\r\n print(ans)", "import sys\r\nfrom collections import defaultdict \r\ninput=sys.stdin.readline\r\nn,q,c=map(int,input().split())\r\nd=defaultdict(lambda:[0]*11)\r\nfor _ in range(n):\r\n\tx,y,s=map(int,input().split())\r\n\tif (x,y) not in d:\r\n\t\td[(x,y)]=[0]*11\r\n\td[(x,y)][s]+=1\r\ng=[[[0]*11 for i in range(101)] for i in range(101)]\r\ng[1][1]=d[(1,1)]\r\nfor i in range(1,101):\r\n\tfor j in range(1,101):\r\n\t\tif i==1 and j==1:continue\r\n\t\tfor k in range(11):\r\n\t\t\tif i==1:\r\n\t\t\t\tg[i][j][k]=g[i][j-1][k]+d[(i,j)][k]\r\n\t\t\telif j==1:\r\n\t\t\t\tg[i][j][k]=g[i-1][j][k]+d[(i,j)][k]\r\n\t\t\telse:\r\n\t\t\t\tg[i][j][k]=g[i-1][j][k]+g[i][j-1][k]-g[i-1][j-1][k]+d[(i,j)][k]\r\nfor _ in range(q):\r\n\tt,x1,y1,x2,y2=map(int,input().split())\r\n\tans=0\r\n\tfor k in range(11):\r\n\t\tcnt=g[x2][y2][k]-g[x1-1][y2][k]-g[x2][y1-1][k]+g[x1-1][y1-1][k]\r\n\t\tans+=((t+k)%(c+1))*cnt\r\n\tprint(ans)" ]

[ "n,t=map(int,input().split())\r\nai=list(map(int,input().split()))\r\nai.insert(0,0)\r\nvisited=False\r\ncurrentcell=1\r\nwhile currentcell<=t:\r\n currentcell=currentcell+ai[currentcell]\r\n if currentcell==t:\r\n visited=True\r\n break\r\nif visited:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n", "n, t = [*map(int,input().split())]\r\nportal = [*map(int,input().split())]\r\nposition,i = 1, 0\r\nans = \"NO\"\r\nwhile i < n:\r\n position += portal[i]\r\n i += portal[i]\r\n if position == t:\r\n ans = \"YES\"\r\n break\r\n elif position > t:\r\n break\r\nprint(ans)", "aandi = input().split(\" \")\r\nn = int(aandi[0])\r\ni = int(aandi[1])\r\ncells = input().split(\" \")\r\ncells = list(map(int, cells))\r\nend = False\r\ncell = 1\r\nwhile end == False:\r\n if i == cell:\r\n print(\"YES\")\r\n end = True\r\n elif cell > i:\r\n print(\"NO\")\r\n end = True\r\n else:\r\n a = cells[cell - 1]\r\n cell = cell +a", "\nn,s=map(int,input().split())\na=list(map(int,input().split()))\ni=0\ns-=1\nwhile i<s:\n i+=a[i]\nprint(\"yes\"if i==s else\"no\")\n\t \t \t\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\nn,m=map(int,input().split())\r\nx=list(map(int,input().split()))\r\nl=1\r\nk='NO'\r\nfor i in range(n):\r\n if l>n-1:\r\n break\r\n elif x[l-1]+l==m:\r\n k='YES'\r\n break\r\n l+=x[l-1]\r\nprint(k)", "n, t = map(int, input().split())\r\na = list(map(int, input().split()))\r\nres = 0\r\nwhile res < t-1:\r\n res += a[res]\r\n \r\nif res == t-1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n", "def can_reach_cell(n, t, a):\n current_cell = 1\n visited_cells = set()\n while current_cell <= t:\n if current_cell == t:\n return \"YES\"\n if current_cell in visited_cells:\n return \"NO\"\n visited_cells.add(current_cell)\n current_cell += a[current_cell - 1]\n return \"NO\"\n\n\nn, t = map(int, input().split())\na = list(map(int, input().split()))\n\n\nprint(can_reach_cell(n, t, a))\n\n \t\t\t\t \t \t \t\t\t\t\t\t\t\t\t \t\t \t\t\t", "#!/usr/bin/env python3\r\n\r\nimport math\r\nimport sys\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n\r\ndef test_case():\r\n n, t = map(int, input().split())\r\n t -= 1\r\n a = list(map(int, input().split()))\r\n a.append(0)\r\n ans = [False for _ in range(n)]\r\n ans[0] = True\r\n for i in range(n):\r\n if ans[i]:\r\n ans[i+a[i]] = True\r\n if ans[t]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\ndef main():\r\n t = 1\r\n# t = int(input())\r\n for _ in range(t):\r\n test_case()\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n, t = map(int, input().split())\n\npos = list(map(int, input().split()))\n\n\ndef dfs(h):\n if h == t:\n return True\n if h > t:\n return False\n return dfs(h + pos[h - 1])\n\n\ndef infer(h):\n cur = h\n while cur < t:\n cur += pos[cur - 1]\n if cur == t:\n return True\n else:\n return False\n\n\n# if dfs(1):\nif infer(1):\n print('YES')\nelse:\n print(\"NO\")\n", "n, t = list(map(int, input().split()))\nx = list(map(int, input().split()))\nans = 1+x[0]\nwhile True:\n if(ans==t):\n print(\"YES\")\n break\n elif(ans>=n or ans>=t):\n print(\"NO\")\n break\n ans+=x[ans-1]", "from collections import defaultdict\r\n\r\ndef main():\r\n n , t = map(int,input().split())\r\n nums = list(map(int,input().split()))\r\n portals = defaultdict()\r\n for i,n in enumerate(nums):\r\n portals[i+1] = i + n + 1\r\n \r\n cur = 1\r\n def dfs(nums):\r\n nonlocal cur\r\n while cur <= t:\r\n if cur==t:\r\n print('YES')\r\n return\r\n cur = portals[cur] \r\n print('NO')\r\n dfs(nums)\r\nmain()", "n, t = [int(x) for x in input().split()]\na = [int(x) for x in input().split()]\ncurrent = 0\npossible = False\nwhile current <= t - 1:\n # print(f\"we are currently at {current+1}\")\n if current == t - 1:\n print(\"YES\")\n possible = True\n break\n current += a[current]\n\nif not possible:\n print(\"NO\")\n\n \t \t \t \t \t\t \t \t \t\t\t\t \t", "n, t = map(int, input().split())\r\nsp = list(map(int, input().split()))\r\nt -= 1\r\ni = 0\r\nwhile i < t:\r\n i += sp[i]\r\nif i == t:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,t=map(int,input().split())\r\na=list(map(int,input().split()))\r\nk=0\r\ne=0\r\nfor i in range(n):\r\n try:\r\n k+=a[k]\r\n except:\r\n break\r\n if k+1==t:\r\n e=1\r\n break\r\nprint('YES' if e==1 else 'NO')", "c,d = map(int,input().split())\r\nt = list(map(int,input().split()))\r\n\r\ncurr = 1\r\ni = 0\r\nwhile curr < d and i < len(t):\r\n curr += t[i]\r\n i = curr-1\r\nif curr == d:\r\n print('YES')\r\nelse:\r\n print(\"NO\")", "def can_reach_cell(n, t, a):\n current_cell = 1\n while current_cell < t:\n current_cell += a[current_cell - 1]\n return \"YES\" if current_cell == t else \"NO\"\n\n# Read input\nn, t = map(int, input().split())\na = list(map(int, input().split()))\n\n# Call the function and print the result\nprint(can_reach_cell(n, t, a))\n", "line1 = input()\nargs1 = line1.split(' ')\nn = int(args1[0])\nt = int(args1[1])\n\nline2 = input()\nsequence_a = line2.split(' ')\nsequence_a = [int(x) for x in sequence_a]\n\nportals = dict()\nfor cell_id, jump_val in enumerate(sequence_a):\n cell_num = cell_id + 1\n portals[cell_num] = cell_num + jump_val\n\nactual_cell = 1\ntarget_cell = t\n\nwhile actual_cell != target_cell:\n if actual_cell == n:\n break\n actual_cell = portals[actual_cell]\n\nif actual_cell == target_cell:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "from queue import Queue\r\nlistAdj = []\r\n\r\nn,t = map(int, input().split())\r\nlistaent = list(map(int, input().split()))\r\n\r\ndist = []\r\n\r\ncount = 0\r\nfor ai in listaent:\r\n lista = [count + ai]\r\n listAdj.append(lista)\r\n count += 1\r\n dist.append(-1)\r\n\r\nlistAdj.append([])\r\ndist.append(-1)\r\ndef busca(u):\r\n fila = Queue()\r\n fila.put(u)\r\n dist[u] = 0\r\n while(not fila.empty()):\r\n v = fila.get()\r\n for vertex in listAdj[v]:\r\n fila.put(vertex)\r\n dist[vertex] = dist[v] + 1\r\n \r\n \r\n\r\nbusca(0)\r\nif(dist[t-1] == -1):\r\n print('NO')\r\nelse:\r\n print('YES')", "n,t=map(int,input().split())\r\na=list(map(int,input().split()))\r\ns=1\r\nwhile s<t:\r\n s+=a[s-1]\r\nif s==t:\r\n print('YES')\r\nelse: print('NO')", "n, t = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\n\r\nt -= 1\r\n\r\nb = True\r\nd = 0\r\ne = 0\r\n\r\nwhile (d < len(a)):\r\n e = d + a[d]\r\n if e == t:\r\n b = True\r\n break\r\n else:\r\n d = e\r\n b = False\r\n\r\n\r\nif b:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, m = map(int,input().split())\nb = list(map(int,input().split()))\nc = 0\nwhile c < m - 1:\n c += b[c]\nprint('YNEOS'[c >= m::2])\n\t\t \t\t\t \t \t \t \t \t \t \t", "def main():\n n, t = map(int, input().strip().split())\n a = list(map(int, input().strip().split()))\n i = 0\n t -= 1\n while t > i:\n i += a[i]\n if t == i:\n print(\"YES\")\n else:\n print(\"NO\")\n\n\nif __name__ == '__main__':\n main()", "n, t = map(int, input().split())\r\na = list(map(int, input().split()))\r\ni = 0\r\nwhile i < n-1:\r\n # print(i+1)\r\n i+=a[i]\r\n if i == t-1:\r\n # print(i+1, '!')\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')", "num_of_cells, index_of_cell = map(int, input().split())\nportals = list(map(int, input().split()))\n\ncurrent_pos = 1\nwhile current_pos < index_of_cell:\n current_pos += portals[current_pos - 1]\n\nif current_pos == index_of_cell:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t \t \t\t\t \t\t \t\t \t\t \t\t \t\t", "N,M = map(int, input().split())\r\nL = list(map(int, input().split()))\r\nctr = 1\r\nwhile ctr < M:\r\n ctr += L[ctr-1]\r\nprint(\"YES\" if ctr == M else \"NO\")", "n, t =map(int,input().split())\r\na=list(map(int,input().split()))\r\ng={}\r\nfor i in range(1, n):\r\n if i not in g:\r\n g[i]=set()\r\n g[i].add(i+a[i-1])\r\nused=set()\r\ndef dfs(u):\r\n global used\r\n p=[u]\r\n while len(p)>0:\r\n v=p.pop()\r\n if v==n:\r\n return 'no'\r\n if v not in used:\r\n used.add(v)\r\n for w in g[v]:\r\n if w==t:\r\n return 'yes'\r\n if w not in used:\r\n p.append(w)\r\nif dfs(1)=='yes':\r\n print('YES')\r\nelse:\r\n print('NO')", "n, t = [int(_) for _ in input().split()]\r\na = [int(_) for _ in input().split()]\r\nt = t-1\r\nc = 0\r\nwhile c < t:\r\n c += a[c]\r\n\r\nif c == t:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "n,t=map(int,input().split())\na=list(map(int,input().split()))\ni=1\nwhile i<t:\n i+=a[i-1]\nif i==t:\n print(\"YES\")\nelse:\n print(\"NO\")\n\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", "n, t = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\ni = 1\r\nwhile i < t:\r\n i += a[i-1]\r\n if i == t:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "def dfs(u):\r\n while u < t - 1:\r\n x = graphs[u]\r\n u = x\r\n if u == t - 1:\r\n return \"Yes\"\r\n else:\r\n return \"No\"\r\n\r\n\r\nn, t = map(int, input().split())\r\na = list(map(int, input().split()))\r\ngraphs = []\r\nfor i in range(n - 1):\r\n x = a[i]\r\n graphs.append(i + x)\r\nused = [False] * n\r\nprint(dfs(0))\r\n\r\n\r\n\r\n\r\n\r\n", "n, t = map(int, input().split())\na = list(map(int, input().split()))\n\nx = 0\nwhile x < n - 1:\n x += a[x]\n if x == t - 1:\n print(\"YES\")\n exit()\nprint(\"NO\")\n", "n, t = map(int, input().split())\r\nt -= 1\r\na = list(map(int, input().split()))\r\nk = 0\r\nwhile k < t:\r\n k += a[k]\r\nprint([\"NO\", \"YES\"][k == t])\r\n\r\n", "num1, num2 = map(int, input().split())\nlista = list(map(int, input().split()))\nindice = 0\n\nwhile indice < num2 - 1:\n indice += lista[indice]\n\nif indice == num2 - 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", "n, t = map(int, input().split())\r\na = list(map(int, input().split()))\r\na = [0] + a\r\nvisit = [0] * (n+1)\r\nx = 1\r\nwhile x < t:\r\n x += a[x]\r\n\r\nif t == x:\r\n print(\"YES\") \r\n\r\nelse:\r\n print(\"NO\")", "def helper():\r\n a, b = list(map(int, input().split()))\r\n arr = list(map(int, input().split()))\r\n curr = 0\r\n while curr < a - 1:\r\n curr = curr + arr[curr]\r\n if curr == b - 1:\r\n print(\"YES\")\r\n return\r\n print(\"NO\")\r\n\r\n\r\nhelper()", "n, t = map(int,input().split())\r\n\r\nportals = list(map(int,input().split()))\r\n\r\nnext_c = 1\r\n\r\npossible_cells = [0]*n\r\n\r\nwhile True:\r\n cur_c = next_c\r\n possible_cells[cur_c-1] = 1\r\n if cur_c == n:\r\n break\r\n next_c = cur_c + portals[cur_c-1]\r\n if possible_cells[next_c-1]:\r\n break\r\n\r\nif possible_cells[t-1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "# '''\r\n# shelby70\r\n# '''\r\n\r\nn, t= map(int, input().split())\r\nm= list(map(int, input().split()))\r\nm.insert(0,0)\r\n\r\ni= 1\r\nwhile i<n:\r\n i= m[i]+i\r\n if i== t:\r\n print(\"YES\")\r\n break\r\nelse: print(\"NO\")", "import sys\r\n\r\ndef data_input(): # collects the information about the world and its teleports\r\n\r\n n, t = map(int, sys.stdin.readline().split()) # n - number of cells, t - the cell I want to go to\r\n\r\n telecode = list(map(int, sys.stdin.readline().split())) # a telecode is (n - 1) of integer numbers for the teleport\r\n\r\n return n, t, telecode\r\n\r\n\r\ndef check_teleport(end_pos, telecode): # checks if the voyage is available\r\n\r\n start_pos = 0 # my start position is in the cell 0 + 1 = 1\r\n curr_pos = start_pos # I am NOW in start position\r\n\r\n while curr_pos < end_pos - 1: # I move through the world while I am lower than I want to be\r\n curr_pos = curr_pos + telecode[curr_pos]\r\n\r\n if curr_pos == end_pos - 1: # get the decision\r\n decision = 'YES'\r\n else:\r\n decision = 'NO'\r\n\r\n return decision\r\n\r\n\r\ndef main():\r\n\r\n n, t, telecode = data_input()\r\n decision = check_teleport(t, telecode)\r\n print(decision)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "def NewYear(n,t,a):\r\n j = 1\r\n while not (a[j-1] + j == t):\r\n j = j + a[j-1]\r\n if j >= n:\r\n break\r\n if j >= n:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n\r\nN,T = input().split()\r\nn = int(N)\r\nt = int(T)\r\na = list(map(int,input().split()))\r\nNewYear(n,t,a)", "def main():\r\n # input\r\n n, t = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n\r\n # soln\r\n i = 0\r\n fl = False\r\n while i < n:\r\n if i+1 == t:\r\n fl = True\r\n break\r\n if i+1 > t:\r\n break\r\n i = i+a[i]\r\n if fl:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "# https://codeforces.com/problemset/problem/500/A\r\n\r\ndef main():\r\n n, t = map(int, input().split(' '))\r\n a = tuple(map(int, input().split(' ')))\r\n i = 1\r\n while i < t:\r\n i += a[i - 1]\r\n # print(i)\r\n if i == t:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "m,n=map(int,input().split())\r\nb=list(map(int,input().split()))\r\ni=1\r\nwhile i<n:\r\n i=i+b[i-1]\r\nif i == n:\r\n print('YES')\r\nelse:\r\n print('NO')", "t,n=map(int,input().split())\r\na=list(map(int,input().split()))\r\ni=0\r\nwhile i<n-1:\r\n i=a[i]+i\r\nif n==i+1:\r\n print('YES')\r\nelse:\r\n print('NO')", "# Online Python compiler (interpreter) to run Python online.\r\n# Write Python 3 code in this online editor and\r\nn, dest = map(int,input().split())\r\nportals = list(map(int,input().split()))\r\ni = 1\r\nwhile(i<n):\r\n if(dest == i + portals[i-1]):\r\n print(\"YES\")\r\n break\r\n elif(i + portals[i-1]> dest):\r\n print(\"NO\")\r\n break\r\n i += portals[i-1]\r\n \r\n ", "# -*- coding: utf-8 -*-\n\nfrom unicodedata import decomposition\n\n\n[n, t] = [int(_) for _ in input().split(' ')]\ncells = [int(_) for _ in input().split(' ')]\n\nvisited = [False for _ in range(n + 1)]\n\ni = 1\ntransportation_is_possible = False\n\nwhile True:\n if visited[i]:\n break\n destiny = i + cells[i - 1]\n if destiny == t:\n transportation_is_possible = True\n break\n elif destiny == n:\n break\n visited[i] = True\n i = destiny\n\nif transportation_is_possible:\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\n##k = 0\r\n##for i in range(1,n+1):\r\n## if i % 2 == 0:\r\n## k += i\r\n## else:\r\n## k -= i\r\n##print(k)\r\n\r\n\r\n##n = input()\r\n##m = input()\r\n##h = []\r\n##for i in range(len(n)):\r\n## if n[i] + m[i] == '11' or n[i] + m[i] == '00':\r\n## h.append(0)\r\n## else:\r\n## h.append(1)\r\n##print(*h, sep=\"\")\r\n\r\n##a, b =map(int, input(). split())\r\n##h = []\r\n##for i in range(1,a+1):\r\n## h.append(i)\r\n##hh = h[::2]+h[1::2]\r\n##print(hh[b-1])\r\n\r\n##n = int(input())\r\n##arr = list(map(int,input().split()))\r\n##count =0 \r\n##dep = 1\r\n##res = []\r\n##for i in range(len(arr)-1):\r\n## if arr[count] <= arr[count+1]:\r\n## dep +=1\r\n## count +=1\r\n## else:\r\n## res.append(dep)\r\n## dep = 1\r\n## count +=1\r\n##res.append(dep)\r\n## \r\n##print(max(res))\r\n\r\nn, t = map(int, input().split())\r\nportals = list(map(int, input().split()))\r\nportals = [0] + portals \r\n \r\np = 1\r\n \r\nwhile p <= t:\r\n if p == t:\r\n print('YES')\r\n break\r\n p = p + portals[p]\r\n \r\nif p != t:\r\n print('NO')\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Sep 9 13:46:09 2023\r\n\r\n@author: mac\r\n\"\"\"\r\n\r\nn, t = map(int, input().split())\r\na = list(map(int, input().split()))\r\ni = 1\r\nwhile i < t:\r\n i += a[i-1]\r\nif i == t:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "data = []\r\nwhile True:\r\n\ttry:\r\n\t\tline = [int(i) for i in input().split()]\r\n\texcept EOFError:\r\n\t\tbreak\r\n\tdata.append(line)\r\n\r\nn, t = data.pop(0)\r\ncell = 1\r\nwhile cell < t:\r\n\ti = data[0][cell-1]\r\n\tcell += i\r\n\r\nprint(\"YES\" if cell == t else \"NO\")", "n, m = map(int, input().split())\r\ns = list(map(int, input().split()))\r\ni = 1\r\nx = 'NO'\r\nwhile i < m:\r\n i += s[i-1]\r\n if i==m:\r\n x = 'YES'\r\nprint(x)", "n , m = [int(x) for x in input().split()]\r\narr = [int(x) for x in input().split()]\r\n\r\nm -= 1\r\nsumm = 0\r\n\r\nwhile summ < m:\r\n summ += arr[summ]\r\n\r\nif summ == m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def inp():\r\n g = []\r\n for i in range(7):\r\n l = list(map(int, input().strip().split()))\r\n g.append(l)\r\n\r\ndef bfs(s):\r\n while len(q):\r\n s=q[0]\r\n q.pop(0)\r\n vist[s]=1\r\n for i in g[s]:\r\n if vist[i]==0:\r\n vist[i]=1\r\n q.append(i)\r\n\r\n\r\n\r\n\r\n#g=[[1], [0, 2, 6], [1, 5], [5], [2, 6], [3], [1, 4]]\r\nn,m=map(int,input().split())\r\nn=n-1\r\ng=[[] for i in range(n+1)]\r\nlt=list(map(int,input().split()))\r\nfor i in range(n):\r\n g[i].append(i+lt[i])\r\nq=[]\r\nvist=[0]*(n+1)\r\nq.append(0)\r\nbfs(0)\r\nif(vist[m-1]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, t = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nc = 1\r\n\r\nwhile True:\r\n if c == t:\r\n print(\"YES\")\r\n break\r\n elif c > t:\r\n print(\"NO\")\r\n break\r\n else:\r\n c += a[c-1]", "n,m=map(int,input().split())\r\na=[int(i) for i in input().split()]\r\nz=[]\r\ni=0\r\nwhile i<m-1:\r\n i=i+a[i]\r\nif i==m-1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n, b = map(int,input().split())\nc = list(map(int,input().split()))\ni=0\nout = 'NO'\nwhile True:\n if i > b -1:\n break\n if i== b-1:\n out = 'YES'\n break\n i += c[i]\nprint(out)\n \t\t \t \t \t \t\t \t\t\t\t \t \t \t \t\t", "k=lambda:map(int,input().split())\r\nN,T=k();a=*k(),;n=1\r\nwhile n<T:n+=a[n-1]\r\nprint(\"YNEOS\"[n>T::2])", "n, t = map(int, input().split())\r\nlst = list(map(int, input().split()))\r\n\r\nc = 1\r\n\r\nfor i in range(n):\r\n if c == t:\r\n print(\"YES\")\r\n exit()\r\n if (c > n - 1):\r\n print(\"NO\")\r\n exit()\r\n c += lst[c - 1]", "n,t = map(int,input().split())\r\nl = list(map(int,input().split()))\r\ni = 0\r\nwhile i <= n-1:\r\n if i == t:\r\n print(\"YES\")\r\n break\r\n elif i > t:\r\n print(\"NO\")\r\n break\r\n i = i + l[i-1]\r\nelse:\r\n if i == t:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n,t = map(int,input().split())\r\na = list(map(int,input().split()))\r\nx = 0\r\nt -= 1\r\nwhile(x < t):\r\n x += a[x]\r\nif(x == t):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\na=[0]*n\r\na[t-1]=1\r\nfor i in range(t-2,-1,-1):\r\n if a[i+l[i]]==1:\r\n a[i]=1\r\nif a[0]==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, b = map(int, input().split())\r\na=list(map(int,input().split()))\r\not = [0]*(n)\r\not[0] = 1\r\nfor x in range(len(a)):\r\n if ot[x] == 1:\r\n ot[x+a[x]] = 1\r\nif ot[b-1] == 1:\r\n print('YES')\r\nelse:\r\n print('NO')", "n, t = map(int, input().split())\r\na = tuple(map(int, input().split()))\r\npos = 1\r\n\r\nwhile pos < t:\r\n pos += a[pos-1]\r\n\r\nprint(\"YNEOS\"[pos != t::2])\r\n", "n, t = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\ni = 0\r\nflag = False\r\nwhile i < len(a) and not flag:\r\n i += a[i]\r\n if i + 1 == t:\r\n flag = True\r\nprint(\"YES\" if flag else \"NO\")\r\n", "n,s=map(int,input().split())\r\na=list(map(int,input().split()))\r\ni=0\r\ns-=1\r\nwhile i<s:\r\n i+=a[i]\r\nprint(\"YES\"if i==s else\"NO\")", "n,s=map(int,input().split())\r\na=list(map(int,input().split()))\r\n\r\n\r\ni=0\r\ns-=1\r\n\r\n\r\nwhile i<s:\r\n i+=a[i]\r\n \r\n \r\nif i == s:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn, t = map(int, input().split())\r\nportals = list(map(int, input().split()))\r\ntotal, pos = 0, 0\r\nwhile True:\r\n total += portals[pos]\r\n pos += portals[pos]\r\n if total + 1 > t:\r\n print(\"NO\")\r\n break\r\n elif total + 1 == t:\r\n print(\"YES\")\r\n break", "n_cells, target_index = list(map(int, input().split()))\nboard = list(map(int, input().split()))\n\ncurrent_index = board[0] + 1\n\nwhile current_index < target_index:\n current_index += board[current_index - 1]\n\nif current_index == target_index:\n print(\"YES\")\nelse:\n print(\"NO\")", "def solve():\r\n\tn, t = map(int, input().strip().split())\r\n\ta = list (map(int, input().strip().split()))\r\n\r\n\ta.append(1)\r\n\tt -= 1\r\n\tcurrentPos = 0\r\n\twhile currentPos < n:\r\n\t\tif currentPos == t:\r\n\t\t\tprint('YES')\r\n\t\t\treturn\r\n\t\telse:\r\n\t\t\tcurrentPos += a[currentPos]\r\n\r\n\tprint('NO')\r\n\r\nsolve()", "l1=[int(x) for x in input().split()]\r\nl=[int(x) for x in input().split()]\r\nadd=1\r\nflag=0\r\nwhile(1):\r\n add=l[add-1]+add\r\n if add==l1[1]:\r\n flag=1\r\n break\r\n elif add>l1[1]:\r\n flag=0\r\n break\r\nif flag==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "n,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\ni=0\r\nwhile i<x-1:\r\n i=a[i]+i\r\nif x==i+1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import math\nimport bisect\n\ndef main():\n n,t = (map(int, input().split()))\n a = list(map(int, input().split()))\n \n t -= 1\n curr = 0\n found = False\n\n while curr < t:\n curr = curr + a[curr]\n if curr == t:\n found = True\n break\n \n if found:\n print(\"YES\")\n else:\n print(\"NO\")\n\n return\n\nif __name__ == \"__main__\":\n main()", "def can_i_find(t, a):\r\n t -= 1\r\n i = 0\r\n while i <= t:\r\n if i == t:\r\n return \"YES\"\r\n else:\r\n i += a[i]\r\n return \"NO\"\r\nn, t = map(int, input().split())\r\na = list(map(int, input().split()))\r\nprint(can_i_find(t, a))", "def can_reach_target(n, t, portals):\n current_cell = 1\n\n while current_cell < t:\n current_cell += portals[current_cell - 1] # Move to the next cell using the portal connection\n\n if current_cell == t: # If we reach the target cell, return \"YES\"\n return \"YES\"\n\n return \"NO\" # If we go beyond the target cell, return \"NO\"\n\n# Read input\nn, t = map(int, input().split())\nportals = list(map(int, input().split()))\n\n# Check if it is possible to reach the target cell\nresult = can_reach_target(n, t, portals)\n\n# Print the result\nprint(result)\n\n \t \t\t\t\t \t \t\t \t\t\t \t \t\t\t", "import sys\r\nn, t = map(int, sys.stdin.readline().strip().split())\r\na = [0] + list(map(int, sys.stdin.readline().strip().split()))\r\narrived = False\r\ncurrent_cell = 1\r\nwhile True:\r\n current_cell = current_cell + a[current_cell]\r\n if current_cell == t :\r\n arrived = True\r\n break\r\n if current_cell == n :\r\n break\r\n\r\nprint( \"YES\" if arrived else \"NO\")", "n, t = map(int, input().split())\nportals = list(map(int, input().split()))\nportals = [0] + portals\n\npos = 1\n\nwhile pos <= t:\n\tif pos == t:\n\t\tprint(\"YES\")\n\t\tbreak\n\tpos = pos + portals[pos]\t\n\nif pos != t:\n\tprint(\"NO\")\n \t \t \t \t \t\t \t\t \t \t \t\t \t", "def solve(n, dest, portals):\r\n\r\n i = 0\r\n while i < n:\r\n\r\n if i+1 == dest: \r\n return (\"YES\")\r\n elif i+1 > dest: \r\n return (\"NO\")\r\n else:\r\n i += portals[i]\r\n\r\n return (\"NO\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\r\n n, dest = map(int,input().split())\r\n portals = list(map(int,input().split()))\r\n print (solve(n, dest, portals))\r\n", "x = lambda:map(int,input().split())\nN,T=x();a=*x(),;n=1\nwhile n<T:n+=a[n-1]\nprint(\"YNEOS\"[n>T::2])\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\nl=list(map(int,input().split()))\r\nn=len(l)\r\ni=1\r\nver=True\r\nwhile i<m and ver==True:\r\n i+=l[i-1]\r\n if i>m:\r\n ver=False\r\nif ver==True:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "num_cells, wanted_cell = map(int, input().split())\r\nportals = list(map(int, input().split()))\r\n\r\ncur_cell = 1\r\n\r\n# while we have not passed the cell we want\r\nwhile cur_cell < wanted_cell:\r\n cur_cell += portals[cur_cell - 1]\r\n \r\nprint(\"YES\" if cur_cell == wanted_cell else \"NO\")", "n, k = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\nk = k - 1\r\nc = 0\r\nwhile c < k:\r\n c += a[c]\r\n\r\nprint('YES') if c == k else print('NO')\r\n", "n, t = map(int, input().split())\r\na = list(map(int, input().split()))\r\ni = 1\r\nwhile i < t:\r\n i += a[i - 1]\r\nprint('YES' if i == t else 'NO')", "n,t=map(int,input().split())\r\narr=list(map(int,input().split()))\r\n\r\nans=1\r\n\r\nwhile ans<t:\r\n ans=ans+arr[ans-1]\r\n\r\nif ans==t:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "T=lambda:map(int,input().split())\r\nn,t=T()\r\nX=list(T())\r\nc=0\r\nwhile c<t-1:c+=X[c]\r\nprint('YNEOS'[c>=t::2])\r\n", "nm=input().split()\r\nn=int(nm[0])\r\nmizani=int(nm[1])\r\nSIA=input().split()\r\nsia=[int(i) for i in SIA]\r\nans=0\r\ni=0\r\nwhile i<mizani :\r\n if i==mizani-1 :\r\n ans=1\r\n break\r\n else:\r\n j=i\r\n elem=sia[i]\r\n sia[i]=-1\r\n i=j+elem\r\nif ans==1 :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, m = map(int, input().split())\r\ntrans = list(map(int, input().split()))\r\nans = \"NO\"\r\ni = 1\r\n\r\nwhile i < m:\r\n i += trans[i-1]\r\n if i == m:\r\n ans = \"YES\"\r\n\r\nprint(ans)", "n, go = map(int, input().split())\n\nportais = list(map(int, input().split()))\n\n\nsum = 0\ncheck = False\ncount = 1\nwhile sum < go:\n sum = count + portais[count-1]\n count = sum\n\n if (sum == go):\n check = True\n\nif (check):\n print('YES')\nelse:\n print('NO')\n", "def newYearTransportation():\r\n (n, target) = map(int, input().split())\r\n arr = [int(x) for x in input().split()]\r\n location = 1\r\n while(location < target):\r\n location += arr[location-1]\r\n if(location == target):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n return\r\nnewYearTransportation()", "def solution():\n cell_count, target_index = [int(x) for x in input().split()]\n portals = [int(x) for x in input().split()]\n\n possible = False\n current_index = 0\n while current_index < cell_count - 1 and current_index < target_index:\n if current_index + portals[current_index] == target_index - 1:\n possible = True\n break\n\n current_index += portals[current_index]\n\n if possible:\n print(\"YES\")\n else:\n print(\"NO\")\n\n\nif __name__ == \"__main__\":\n solution()\n", "n, t = map(int, input().split())\r\na = list(map(int, input().split()))\r\nt -= 1\r\npos = 0\r\nwhile pos < t:\r\n pos += a[pos]\r\nprint('YNEOS'[pos>t::2])", "def dothi(a,t):\r\n i = 0\r\n while i < t:\r\n i += a[i]\r\n if i == t:\r\n return \"YES\"\r\n return \"NO\"\r\nn,t = map(int,input().split())\r\na = [int(x) for x in input().split()]\r\nprint(dothi(a,t-1))", "q=lambda:list(map(int,input().split()))\nN,T=q();a=q();n=1\nwhile n<T:n+=a[n-1]\nprint(\"YNEOS\"[n!=T::2])\n \t\t\t \t\t\t \t \t\t\t \t\t \t\t", "def solve():\r\n n = [int(n) for n in input().split(\" \", 2)]\r\n x = [int(x) for x in input().split(\" \", n[0]-1)]\r\n\r\n visit = 0\r\n find = False\r\n while visit + 1 < n[0]:\r\n visit = x[visit] + visit\r\n if visit + 1 == n[1]:\r\n find = True\r\n break\r\n if find:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n\r\n\r\nprint(solve())\r\n", "n,t= map(int, input().split())\r\nx = input().split()\r\ni = 1\r\np = 0\r\nwhile i<=t:\r\n p = i\r\n try:\r\n i += int(x[i-1])\r\n except:\r\n break\r\nif p == t:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,x = map(int,input().split())\r\n# s = input()\r\nl = list(map(int,input().split()))\r\nc=1\r\ni=1\r\nwhile(c<x and i<n):\r\n c+=l[i-1]\r\n i+=l[i-1]\r\n # print(c,i-1,l[i-1])\r\nprint([\"NO\",\"YES\"][c==x])", "import sys\r\n\r\ndef read_strings():\r\n return list(sys.stdin.readline().split())\r\n\r\ndef read_inline_ints():\r\n return list(map(int, sys.stdin.readline().split()))\r\n\r\ndef read_multiline_ints():\r\n return list(map(int, sys.stdin.readlines()))\r\n\r\nyes, no = \"YES\", \"NO\"\r\n\r\n# -------------------- solution code below --------------------\r\n\r\nn, t = read_inline_ints()\r\nportals = read_inline_ints()\r\n\r\nt -= 1\r\ncur = 0\r\n\r\nwhile cur < t:\r\n cur += portals[cur]\r\n\r\nif cur == t:\r\n print(yes)\r\nelse:\r\n print(no)", "n, m = map(int,(input()).split())\r\na = list(map(int,(input()).split()))\r\nans = []\r\nc = 1\r\ntem = 0\r\nfor i in range(n-1):\r\n if i + 1 >= c:\r\n ans.append(c+a[i])\r\n c = c+a[i]\r\n\r\nif m in ans:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nx=0\r\nwhile x!=k-1 and x<n-1:\r\n x+=a[x]\r\nif x==k-1:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,s=map(int,input().split())\na=list(map(int,input().split()))\ni=0\ns-=1\nwhile i<s:\n i+=a[i]\nprint(\"YES\"if i==s else\"NO\")", "I=lambda:map(int,input().split())\nn,t=I()\na=list(I())\nc=0\nwhile c<t-1:c+=a[c]\nprint(['YES','NO'][c>=t])\n\t \t \t \t\t\t \t \t \t \t\t \t\t\t\t\t\t", "v = lambda: map(int,input().split())\nk,l=v()\na=*v(),;n=1\nwhile n<l:\n n+=a[n-1]\nif n>l:\n print('NO')\nelse:\n print('YES')", "l1=[int(i) for i in input().split()]\r\nl2=[int(j) for j in input().split()]\r\nn=l1[0]\r\nt=l1[-1]\r\nl3=[]\r\ncell=1\r\nl3.append(cell)\r\nwhile cell<n:\r\n cell=cell+l2[cell-1]\r\n l3.append(cell)\r\nif l3.count(t)==1:\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "m,k=map(int,input().split())\r\ni=0\r\nk=k-1\r\na=list(map(int,input().split()))\r\ns=0\r\nwhile(i<=k):\r\n if(k==i):\r\n print(\"YES\")\r\n s=1\r\n break\r\n i+=a[i]\r\n if(k==i):\r\n print(\"YES\")\r\n s=1\r\n break\r\nif(s==0):\r\n print(\"NO\")\r\n", "p=lambda:map(int,input().split())\nN,T=p();a=*p(),;n=1\nwhile n<T:n+=a[n-1]\nprint(\"YNEOS\"[n>T::2])\n \t\t\t \t \t \t\t\t\t\t \t \t\t\t\t\t\t\t \t \t", "# Nyveon (Eric K)\n# T2 CC4005\n# Problem A - Aprendiendo el BFS\n\n# Data structure\nfrom collections import defaultdict, deque\nneighborhood = defaultdict(set)\n\n\ndef bfs(graph, start, target, size):\n \"\"\"\n Breadth first search\n \"\"\"\n visited = [False] * (size + 1)\n visited[start] = True\n\n queue = deque([start])\n\n while queue:\n s = queue.popleft()\n\n for vertex in graph[s]:\n if not visited[vertex]:\n visited[vertex] = True\n queue.append(vertex)\n if vertex == target:\n return True\n\n return False\n\n\n# Input\nn, t = [int(x) for x in input().split()]\nhouse_powers = [int(x) for x in input().split()]\n\nfor index, house_power in enumerate(house_powers):\n neighborhood[index + 1].add(index + 1 + house_power)\n\n\n# Processing & Output\npossible = bfs(neighborhood, 1, t, n)\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", "n=[int(i) for i in input().split()]\r\nm=[int(i) for i in input().split()]\r\nx=1\r\ni=0\r\nwhile x<n[1]:\r\n b=m[i]+i+1\r\n x=b\r\n if x==n[1]:\r\n print(\"YES\")\r\n break\r\n i=x-1\r\nif x!=n[1]:\r\n print(\"NO\")", "l = list(map(int, input().split()))\nn = l[0]\nt = l[1]\nA = list(map(int, input().split()))\nadj = {}\nfor i in range(n-1):\n if i+1 in adj :\n adj[i+1].append(A[i]+i+1)\n else :\n adj[i+1] = [A[i]+i+1]\n# run bfs\nq = [1]\nvisited = [0 for i in range(n+1)]\nvisited[1] = 1\nwhile q:\n node = q.pop(0)\n if node in adj :\n for neigh in adj[node]:\n if visited[neigh]==0 :\n q.append(neigh)\n visited[neigh] = 1\nif visited[t]==1 :\n print('YES')\nelse :\n print('NO')", "n, t = map(int, input().split())\r\nportal = list(map(int, input().split()))\r\n\r\ni = 0\r\nwhile i < t - 1:\r\n i += portal[i]\r\n\r\nif i == t - 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n, t = map(int, input().split())\r\ncells = list(map(int, input().split()))\r\n\r\ncurrent_cell = 1\r\n\r\nwhile current_cell < t:\r\n current_cell += cells[current_cell - 1]\r\n\r\n if current_cell == t:\r\n print(\"YES\")\r\n break\r\n if current_cell > t:\r\n print(\"NO\")\r\n break\r\n\r\n", "n, t = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\ni = 0\r\nelem = 1\r\nwhile elem < t:\r\n elem += a[i]\r\n i += a[i]\r\nif elem == t: print(\"YES\")\r\nelse: print(\"NO\")", "n , m =map(int,input().split())\r\na =list(map(int,input().split()))\r\ni = 0\r\nl = 1\r\nwhile True:\r\n l += a[i]\r\n i = l-1\r\n if l == m:\r\n print(\"YES\")\r\n break\r\n elif l > m:\r\n print(\"NO\")\r\n break\r\n", "n,t = map(int,input().split())\r\na = list(map(int,input().split()))\r\nz = 1\r\nwhile z<t:\r\n z+=a[z-1]\r\nprint(\"YES\") if z==t else print(\"NO\")", "n,t = map(int,input().split())\r\nd = list(map(int,input().split()))\r\ni = 1\r\ncnt = 1\r\nwhile i <= n:\r\n if cnt == t:\r\n print('YES')\r\n break\r\n cnt += d[i-1]\r\n i = cnt\r\n if cnt > t:\r\n print('NO')\r\n break \r\n", "import sys\r\ndef print(a):\r\n sys.stdout.write(str(a)+'\\n')\r\ndef input():\r\n return sys.stdin.readline().strip()\r\nfrom collections import deque as dek \r\ndef getM(n):\r\n l=list(map(int,input().split()))\r\n m={}\r\n for i in range(n-1):\r\n m[i]=[i+l[i]]\r\n m[n-1]=[]\r\n return m\r\ndef bfs(s,e,m):\r\n q=dek()\r\n q.append(s)\r\n x=set()\r\n x.add(s)\r\n while q:\r\n z=q.popleft()\r\n for i in m[z]:\r\n if i not in x:\r\n q.append(i)\r\n x.add(i)\r\n return e in x\r\n \r\nn,e=map(int,input().split())\r\ne-=1\r\nm=getM(n)\r\nprint(['NO','YES'][bfs(0,e,m)])", "a=int(input().split()[1])\r\nb=[0]+list(map(int,input().split()))\r\ni=1 \r\nwhile i<a:\r\n i=i+b[i]\r\nprint('YES'if i==a else'NO')", "import sys\r\nfrom types import GeneratorType\r\n\r\n\r\ndef bootstrap(f, stack=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n if stack:\r\n return f(*args, **kwargs)\r\n else:\r\n to = f(*args, **kwargs)\r\n while True:\r\n if type(to) is GeneratorType:\r\n stack.append(to)\r\n to = next(to)\r\n else:\r\n stack.pop()\r\n if not stack:\r\n break\r\n to = stack[-1].send(to)\r\n return to\r\n\r\n return wrappedfunc\r\n@bootstrap\r\ndef dfs(x):\r\n b = 0\r\n if (x==t):\r\n yield 1 \r\n if (vis[x]==1):\r\n yield 0\r\n if (x>=n):\r\n yield 0\r\n vis[x]=1 \r\n for i in d[x]:\r\n b = b + (yield dfs(i))\r\n yield b\r\n \r\n \r\n\r\n\r\n\r\nn,t = map(int,input().split())\r\na = list(map(int,input().split())) \r\nlst=[ ]\r\nsys.setrecursionlimit(3*(10**4)+1)\r\nfor i in range(1,n): \r\n lst.append([i,i+a[i-1]]) \r\n# print(lst)\r\nd = dict() \r\nvis=[0]*(n+1) \r\nfor i in range(1,n): \r\n d[i]=[ ]\r\nfor i in range(n-1):\r\n d[lst[i][0]].append(lst[i][1]) \r\n# print(d)\r\nif (dfs(1)>0):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n", "import sys\r\n#f=open(\"C:/Users/MAHAMUD MATIN/Desktop/input.txt\", \"r\")\r\nf=sys.stdin\r\ns=list(map(int, f.readline().split()))\r\na=list(map(int, f.readline().split()))\r\nflag=0\r\nl=[]\r\ni=1\r\nwhile i<s[1]:\r\n i=i+a[i-1]\r\n l.append(i)\r\nif s[1] in l:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n#print(l)", "n, t = map(int, input().split())\ndests = list(map(int, input().split()))\n\nposition = 1\n\nindex = 0\nwhile index < n:\n position += dests[index]\n index += dests[index]\n if position >= t:\n break\n\n\nif position == t:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "a , b = map(int , input().split())\r\narr = list(map(int , input().split()))\r\ni = 0\r\nwhile i < b - 1:\r\n i += arr[i]\r\nif i == b - 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, t = map(int, input().split())\n\na = list(map(int, input().split()))\n\ncell = 0\n\nwhile (cell < t-1):\n cell += a[cell]\n if (cell == t-1):\n print('YES')\n break\n\nif (cell>=t):\n print('NO')\n \t\t \t\t\t \t\t\t\t \t \t\t \t\t\t \t", "a,b = input().split(\" \")\r\na = int (a)\r\nb = int(b)\r\nD = {int(i)+1:int(i)+int(z)+1 for i,z in enumerate(input().split(\" \"))}\r\nc = 1\r\nCheck = False\r\nwhile c < a:\r\n c = D[c]\r\n if c ==b:\r\n Check = True\r\n break\r\nif Check == True:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, t = map(int, input().split())\nv = list(map(int, input().split()))\n\nv.insert(0, 0)\n\ncurrent_st = 1\n\ncurrent_pos = 1\n\nwhile current_pos <= n:\n if current_st == t:\n print(\"YES\")\n break\n current_st += v[current_pos]\n current_pos = current_st\n if current_st > t:\n print(\"NO\")\n break\n\n\t\t \t \t \t\t\t \t\t \t\t\t \t\t\t\t\t\t\t", "\r\nfor h in range(1):\r\n n,t=map(int,input().split(' '))\r\n lst=list(map(int,input().split(' ')))\r\n i=1\r\n curr=0\r\n while (i<t):\r\n i+=lst[curr]\r\n curr+=lst[curr]\r\n if (i==t):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n \r\n \r\n", "import sys\r\nfrom collections import defaultdict\r\n\r\n\r\nfin = lambda: sys.stdin.readline().strip()\r\nfout = lambda s: sys.stdout.write(str(s) + '\\n')\r\narray = lambda f: list(map(f, fin().split()))\r\n\r\n\r\ndef main():\r\n for _ in range(int(fin())):\r\n solve()\r\n\r\n\r\ndef solve():\r\n n, t = map(int, fin().split())\r\n a = array(int)\r\n\r\n cur = 1\r\n while cur < t:\r\n cur += a[cur-1]\r\n\r\n if cur == t:\r\n fout('YES')\r\n else:\r\n fout('NO')\r\n\r\nsolve()\r\n", "n,m=map(int,input().split());x=1\r\nl=list(map(int,input().split()))\r\nwhile x<m:\r\n x+=l[x-1]\r\nif x==m:\r\n print('YES')\r\nelse:\r\n print('NO')", "t, pos, cur = int(input().split()[1]), list(map(int, input().split())), 1\n\nwhile cur < t: cur += pos[cur - 1]\nprint(\"YES\" if cur == t else \"NO\")\n", "a,b = map(int,input().split())\r\nl = list(map(int,input().split()))\r\ni = 0\r\nwhile i<b:\r\n i+=l[i-1]\r\nif i==b:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = input()\r\nb = a.split()\r\nb = list(map(int, b))\r\nc = input()\r\nd = c.split()\r\nd = list(map(int, d))\r\ni = 0\r\nwhile i < b[1] - 1:\r\n i += d[i]\r\nif i == (b[1] - 1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "# Step 1: read n, t and a\r\nn, t = map(int, input().split())\r\na = list(map(int, input().split()))\r\n# Step 2: preprocess t to fit 0-indexed Python convention\r\nt = t - 1\r\n# Step 3: start from position 1, jump a_i at position i. If t is reached any time in this process, print True; otherwise print False.\r\ncurrent_position = 0\r\nreached_t = False\r\nwhile current_position < n - 1:\r\n current_position += a[current_position]\r\n if current_position == t:\r\n reached_t = True\r\n break\r\nprint('YES' if reached_t else 'NO', flush=True)\r\n", "n,k = map(int,input().split())\r\nns = list(map(int,input().split()))\r\ni=1\r\nflag=0\r\nwhile i<n:\r\n i+=ns[i-1]\r\n if i==k:\r\n print('YES')\r\n break\r\nelse:\r\n print(\"NO\")", "import sys\r\nn, t = map(int, input().split())\r\na = list(map(int, input().split()))\r\nk = 0\r\ni = 0\r\nj = 1\r\nwhile k <= t:\r\n k = j + a[i]\r\n j = k\r\n i = k - 1\r\n if k == t:\r\n print('YES')\r\n sys.exit()\r\nprint('NO')\r\n", "n , t = map(int,input().split(' '))\r\ncells = list(map(int,input().split(' ')))\r\nposition = 1\r\nwhile True:\r\n if position==t:\r\n print(\"YES\")\r\n break\r\n elif position>t:\r\n print(\"NO\")\r\n break\r\n\r\n position = cells[position-1]+position\r\n", "n, t = tuple(int(i) for i in input().split())\r\nt -= 1\r\nnumbers = tuple(int(i) for i in input().split())\r\ni = 0\r\n\r\nwhile i < t:\r\n i += numbers[i]\r\n \r\nprint(('NO', 'YES')[i == t])", "n, t = map(int, input().split())\nportals = list(map(int, input().split()))\n\ncurrent_cell = 1\n\nwhile current_cell < t:\n current_cell += portals[current_cell - 1]\n\nif current_cell == t:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n \t \t \t \t \t\t\t\t\t \t\t\t \t", "n, t = map(int,input().split())\n\ncells = list(map(int,input().split()))\n\ni = 0\nout = 'NO'\nwhile True:\n if i > t -1:\n break\n if i == t-1:\n out = 'YES'\n break\n i += cells[i]\n\nprint(out)\n \t\t \t \t\t\t\t\t\t \t\t \t\t\t\t", "# https://codeforces.com/problemset/problem/500/A\r\n\r\nn, t = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\n\r\npos = 1\r\nwhile pos < t:\r\n pos += a[pos - 1]\r\n\r\nif pos == t:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "numLevels, totalTime = map(int, input().split())\r\ntimePerLevel = list(map(int, input().split()))\r\ncurrentLevel = 0\r\n\r\nwhile currentLevel < totalTime - 1:\r\n currentLevel += timePerLevel[currentLevel]\r\n\r\nif currentLevel == totalTime - 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n, target = map(int, input().split())\nportals = list(map(int, input().split()))\n\nvisited_index = 0\nwhile 1:\n visited_index += portals[visited_index]\n if visited_index == target-1:\n print(\"YES\")\n break\n if visited_index > target-1:\n print(\"NO\")\n break\n \t\t\t\t \t\t\t \t \t \t \t \t \t \t\t", "\nfrom queue import Queue\n\ndef bfs(graph, src, dst):\n q = Queue()\n used = {k:False for k in graph.keys()}\n q.put(src)\n used[src] = True\n while not q.empty():\n current = q.get()\n for node in graph[current]:\n if node == dst:\n return 'YES'\n if node != len(graph.keys()) and not used[node]:\n used[node] = True\n q.put(node)\n return 'NO'\n\n\nn, t = list(map(int, input().split()))\na = list(map(int, input().split()))\n\ngraph = dict()\nfor i in range(n-1):\n graph[i] = [i + a[i]]\n\nprint(bfs(graph, 0, t-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, t = map(int, input().split())\n a = [int(x) for x in input().split()]\n graph = build_graph(a)\n current = 1\n while current < t:\n current = graph[current - 1]\n if current == t:\n print(\"YES\")\n return\n print(\"NO\")\n\n\ndef build_graph(a):\n graph = [None] * len(a)\n for i in range(len(a)):\n graph[i] = a[i] + i + 1\n return graph\n\n\nif __name__ == \"__main__\":\n main()\n", "n, k = map(int,input().split())\nd = list(map(int,input().split()))\ni = 1 \nwhile i <= n :\n try:\n if i == k :\n print(\"YES\")\n exit()\n i = i + d[i-1]\n except IndexError:\n print(\"NO\")\n exit()\n break\nelse:\n print(\"NO\")\n \n", "n,t=[int(x) for x in input().split()]\r\na=[int(x) for x in input().split()]\r\n\r\ni=0\r\nwhile True:\r\n i+=a[i]\r\n if t==i+1:\r\n print(\"YES\")\r\n break\r\n if t<i+1:\r\n print(\"NO\")\r\n break", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Apr 3 18:51:40 2023\r\n\r\n@author: Srusty Sahoo\r\n\"\"\"\r\n\r\nn,t=map(int,input().split())\r\ncell=list(map(int,input().split()))\r\nstart,i=1,1\r\nwhile i<=(n-1):\r\n d=start+cell[start-1]\r\n if d==t:\r\n print(\"YES\")\r\n break\r\n if d>t:\r\n print(\"NO\")\r\n break\r\n else:\r\n start=d\r\n\r\n\r\n ", "nn,ss=map(int,input().split())\na=list(map(int,input().split()))\ni=0\nss-=1\nwhile i<ss:\n i+=a[i]\nprint(\"YES\"if i==ss else\"NO\")\n \t \t \t\t\t\t\t \t\t \t \t\t \t\t\t", "# https://codeforces.com/problemset/problem/500/A\r\nt, a, c = int(input().split()[1]) - 1, list(map(int, input().split())), 0\r\nwhile c < t: \r\n c += a[c]\r\nprint('YNEOS'[c > t::2])\r\n", "x, y = list(map(int, input().split())) # x é o tamanho do line world e y é o índice desejado.\ncells = list(map(int, input().split())) # células do line world\nportal = 1\nwhile portal < y:\n portal = portal + cells[portal - 1]\n\nif portal == y:\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", "def solve():\r\n n, t = map(int, input().split())\r\n arr = list(map(int, input().split()))\r\n\r\n cell = 1 # currently standing\r\n while cell < t:\r\n cell += arr[cell-1]\r\n\r\n print(\"YES\" if cell == t else \"NO\")\r\n\r\nif __name__ == '__main__':\r\n solve()", "a,b=list(map(int,input().split()))\r\nl=list(map(int,input().split()))\r\ndic={}\r\nfor i in range(1,a):\r\n dic[i]=i+l[i-1]\r\na=1\r\nwhile True:\r\n if a not in dic:\r\n print('NO')\r\n break\r\n else:\r\n a=dic[a]\r\n if a==b:\r\n print('YES')\r\n break\r\n", "a,b = map(int, input().split())\r\nls = list(map(int, input().split()))\r\nj = 1\r\nportal = 1\r\nwhile(j<b):\r\n portal = portal + ls[j-1]\r\n j = portal\r\nif j==b:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "[n,k] = [int(j) for j in str(input()).split(' ')]\r\na = [int(j) for j in str(input()).split(' ')]\r\ni = 1\r\nwhile i < k:\r\n i = i + a[i-1]\r\n # print(i)\r\nif i == k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a, b = map(int, input().split())\nl = list(map(int, input().split()))\np = 0\n\nwhile p < b - 1:\n p += l[p]\n\nif p == b - 1:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t \t \t\t \t \t\t\t\t\t\t\t \t\t", "# 输入n和t\r\nn, t = map(int, input().split())\r\n# 输入a数组\r\na = list(map(int, input().split()))\r\n\r\n# 开始的位置\r\npos = 1\r\n\r\n# 迭代直到pos超出或等于t\r\nwhile pos < t:\r\n pos += a[pos - 1] # 跳到下一个位置\r\n # 若跳到下一个位置后等于t，则输出YES并退出循环\r\n if pos == t:\r\n print(\"YES\")\r\n break\r\nelse: # 如果循环正常结束，意味着没能到达t\r\n print(\"NO\")\r\n", "# t = int(input())\nt = 1\nfrom math import log2\n\n\ndef cp():\n # code here\n n,t = tuple(map(int,input().split()))\n arr = list(map(int,input().split()))\n start = 1\n while start < t:\n start += arr[start-1]\n if start == t:\n print('YES')\n else:\n print('NO')\n\n\n\n\nfor i in range(t):\n cp()\n", "n, t = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\ni = 0\r\nwhile i < len(a):\r\n if i == t-1:\r\n print('YES')\r\n exit()\r\n i += a[i]\r\nif t == n:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "def solution(cells, go_to, a):\n\n cur = 1 # Indicador de indice\n i = 1\n\n while i <= cells:\n\n # Si ya está en el destino\n if cur == go_to:\n print(\"YES\")\n break\n\n cur += a[i] # Muevete a i + a[i]\n i = cur\n\n # El cur debe ser más chico siempre que el destino porque no hay forma de regresar\n if cur > go_to:\n print(\"NO\")\n break\n\ndef main():\n # Recibimos entradas\n entries = input().split(\" \") \n cells = int(entries[0])\n go_to = int(entries[1])\n\n # Recibimos números\n nums_str = input().split(\" \")\n nums = []\n for char in nums_str:\n nums.append(int(char))\n\n # Tenemos que insertar al inicio un número para lidiar con que los inices del problema empiezan en 1\n nums.insert(0,0)\n\n solution(cells, go_to, nums)\n\nmain()\n\t\t \t\t\t \t \t\t\t \t\t\t\t \t\t\t", "def main():\n\tn, t = list(int(x) for x in input().split())\n\tt-=1\n\tcells_portals = list(int(x) for x in input().split())\n\tcells_portals.append(0)\n\n\ti=0\n\twhile(i < n - 1):\n\t\ti = i + cells_portals[i]\n\t\tif i == t:\n\t\t\tprint(\"YES\")\n\t\t\treturn\n\n\tprint(\"NO\")\n\treturn\n\nmain()\n\n \t \t \t\t\t \t\t \t\t \t\t\t \t\t", "d=[1]\r\nn,t = map(int, input().split())\r\ns=[0]\r\nfor _ in input().split():\r\n s.append(int(_))\r\ni = 0\r\nwhile d[i] < n:\r\n d.append(d[i]+s[d[i]])\r\n i += 1\r\nif t in d:\r\n print('YES')\r\nelse:\r\n print('NO')", "import sys\r\nimport threading\r\n \r\ndef get_numbers():\r\n return map(int, sys.stdin.readline().strip().split())\r\n\r\ndef find_path(graph, start, vis):\r\n vis[start] = 1\r\n if not start in graph:\r\n return []\r\n if not vis[graph[start]]:\r\n find_path(graph, graph[start], vis)\r\n\r\n\r\ndef main():\r\n n, destination = get_numbers()\r\n numbers = list(get_numbers())\r\n\r\n graph = {}\r\n\r\n for ind,num in enumerate(numbers):\r\n graph[ind+1] = ind+1+num\r\n vis = [0] * (n+1)\r\n find_path(graph,1,vis)\r\n if vis[destination]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\nsys.setrecursionlimit(1 << 30) # or try 10**6\r\nthreading.stack_size(1 << 27) # or try 10**8\r\nmain_thread = threading.Thread(target=main)\r\nmain_thread.start()\r\nmain_thread.join()", "n,t=map(int,input().split())\r\ns=[0]+[int(i) for i in input().split()]\r\nd=[]\r\ni=1\r\nwhile i<t:\r\n i=i+s[i]\r\n d.append(i)\r\nprint('NYOE S'[d[-1]==t::2])", "n, t = map(int, input().split())\na = list(map(int, input().split()))\n\ncurrent = 1\ni = 0\n\nwhile current < t:\n current += a[current - 1]\n\nif current == t:\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, t = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\ni = 0\r\nwhile i < n-1:\r\n if i == t-1:\r\n print('YES')\r\n exit()\r\n i = i + arr[i]\r\n\r\nif i == t-1:\r\n print('YES')\r\nelse:\r\n print('NO')", "n, t = map(int, input().split())\r\na = list(map(int, input().split()))\r\nme = 1\r\nfor i in range(len(a)):\r\n if me < n:\r\n me = me+a[me-1]\r\n if me == t:\r\n print('YES')\r\n break\r\n elif i == len(a)-1:\r\n print('NO')\r\n break", "cell_count, destination = [int(i) for i in input().split()]\r\ncells = [int(elem) for elem in input().split()]\r\n\r\ncurrent = 1\r\nwhile current <= destination:\r\n if current == destination:\r\n print(\"YES\")\r\n break\r\n else:\r\n current += cells[current-1]\r\nelse:\r\n print(\"NO\")\r\n", "n, end=list(map(int, input().split()))\r\na=list(map(int, input().split()))\r\ns=1\r\nwhile s<end:\r\n # print(s)\r\n s+=a[s-1]\r\n# print(s)\r\nif s==end:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "inl = lambda: list(map(int, input().split()))\r\n\r\nn, t = inl()\r\na = inl()\r\n\r\nc = 0\r\ng = \"NO\"\r\nwhile c < t - 1:\r\n c = c + a[c]\r\n if c == t - 1:\r\n g = \"YES\"\r\n\r\nprint(g)\r\n", "n, t = map(int, input().split())\ncells = list(map(int, input().split()))\ni = 0\nout = 'NO'\nwhile True:\n if i > t - 1:\n break\n if i == t - 1:\n out = 'YES'\n break\n i += cells[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", "# t = int(input())\n# ans = t # initial t to find first button\n# for i in range(1,t):\n# ans += (t-i)*i # every iteration i previous buttons need\n# # to be represed for each remaining t-i possible buttons \n# # to find the sequence we want\n# print(ans)\n\nfrom cmath import inf\n\n\nn,t = map(int,input().split())\na = list(map(int,input().split()))\nans = \"NO\"\n\ncur = 1\nwhile cur<n and cur!=t:\n cur += a[cur-1]\n\nprint(\"YES\" if cur==t else \"NO\")", "n,t = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nnxt = 0\r\npos = 1\r\n\r\nwhile (pos < t):\r\n nxt = pos + a[pos - 1]\r\n pos = nxt\r\n\r\nif pos == t:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "import sys,bisect\r\nleft = lambda l,a : bisect.bisect_left(l,a) #returns index of value>=a\r\nright = lambda l,a : bisect.bisect_right(l,a) #returns index of value >a\r\ndef input(): return sys.stdin.readline().strip()\r\ndef getints(): return map(int,sys.stdin.readline().strip().split())\r\n\r\nn,j = getints()\r\nl = list(getints())\r\nans = 1\r\nwhile ans <= n:\r\n if ans == j:\r\n print('YES')\r\n break\r\n if ans < n:\r\n ans += l[ans-1]\r\n elif ans == j and j == n:\r\n print('YES')\r\n break\r\n else:\r\n print('NO')\r\n break", "m,n=map(int,input().split())\r\nb=list(map(int,input().split()))\r\ni=1\r\nwhile i<n:\r\n i=i+b[i-1]\r\nprint('YES'if i==n else'NO')", "num,k=map(int,input().split())\na=list(map(int,input().split()))\nx=1\n\nwhile x < k:\n x=x+a[x-1]\nprint(\"YES\" if x==k else\"NO\")\n \t\t \t\t\t\t \t \t \t\t \t \t\t", "n,d=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ni=0\r\nf=0\r\nwhile i<n:\r\n if i==d-1:\r\n print(\"YES\")\r\n f=1\r\n break\r\n try:\r\n i+=l[i]\r\n except:\r\n break\r\nif f!=1:\r\n print(\"NO\")", "n, d = map(int, input().split())\na= list (map(int, input().split()))\na.insert(0,0)\nc = 1\ni=1\nwhile i<=n:\n if c == d:\n print(\"YES\")\n break\n c+=a[i]\n i = c\n if c > d:\n print(\"NO\")\n break\n\n\t\t \t \t \t\t \t \t\t \t \t\t \t\t", "n, m = map(int, input().split())\r\n\r\ncells = list(map(int, input().split()))\r\n\r\nindice = 0\r\nwhile indice != m - 1 and indice < n-1:\r\n\tindice += cells[indice]\r\n\r\nif indice == m - 1:\r\n\tprint('YES')\r\n\t\r\nelse:\r\n\tprint('NO')\r\n", "import math\n\nn, t = [int(i) for i in input().split()]\n\ncell=[0 for i in range(n+1)]\n\ni=1\nfor item in input().split():\n cell[i]=i+int(item)\n i+=1\n\nhead_to=1\nwhile 1:\n head_to=cell[head_to]\n if head_to>t:\n print('NO')\n break\n elif head_to==t:\n print('YES')\n break\n\n\t\t \t\t\t \t \t\t \t \t \t \t\t", "n,t=map(int,input().split());e=list(map(int,input().split()));t0=1\r\nwhile (t0<t):\r\n t0+=e[t0-1]\r\n if t0==t:print(\"YES\");exit(0)\r\nprint(\"NO\")", "n, m = map(int, input().split())\r\np = list(map(int, input().split()))\r\nc = 1\r\nwhile c < m:\r\n c += p[c - 1]\r\nprint(\"YES\" if c == m else \"NO\")", "\r\n\r\ndef new_year_transport():\r\n\r\n\r\n n,t = map(int,input().split())\r\n\r\n\r\n transports = map(int,input().split())\r\n\r\n \r\n\r\n graph = {}\r\n for i,transport in enumerate(transports,1):\r\n graph[i] = i + transport\r\n\r\n \r\n \r\n current_node = 1\r\n while current_node < t:\r\n\r\n\r\n current_node = graph[current_node]\r\n\r\n\r\n print('YES' if current_node == t else 'NO')\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nnew_year_transport()\r\n\r\n", "a=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nc=[]\r\nfor i in range(a[0]-1):\r\n c.append([i+1,b[i]+i+1])\r\nd=1\r\nf=0\r\nfor i in c:\r\n if i[0]==d:\r\n d=i[1]\r\n if d==a[1]:\r\n f=1\r\n break\r\nif f==1:\r\n print('YES')\r\nelse:\r\n print('NO')", "n, t = map(int, input().split())\r\nloop = list(map(int, input().split()))\r\nt -= 1\r\nme = 0\r\nwhile me < t:\r\n me += loop[me]\r\nif me == t:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n,t=map(int,input().split())\r\na=list(map(int,input().split()))\r\ni=1\r\nwhile True:\r\n e=a[i-1]+i\r\n if t==e:\r\n print('YES')\r\n break\r\n elif t<e:\r\n print('NO')\r\n break\r\n elif t>e:\r\n i=e", "def dfs(dest):\r\n if dest == 1:\r\n return \"YES\"\r\n stack = [1]\r\n visited = [1]\r\n while stack != []:\r\n key = stack.pop()\r\n if key == dest:\r\n return \"YES\"\r\n if key in d:\r\n stack.append(d[key])\r\n return \"NO\"\r\n\r\nn, t = map(int, input().split())\r\na = list(map(int, input().split()))\r\nd = {}\r\nfor i in range(0, n - 1):\r\n d[i + 1] = i + 1 + a[i]\r\nprint(dfs(t))", "n, casa = map(int, input().split())\nnums = list(map(int, input().split()))\nresp = False\ni = 1\nwhile i <= n-1:\n if casa == i:\n resp = True\n break\n i += nums[i-1]\nif casa == i:\n resp = True\nif resp:\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", "\"\"\"\nA. New Year TransportationL: dfs and similar, graphs, implementation\n\ntime limit per test: 2 seconds\nmemory limit per test: 256 megabytes\ninput: standard input\noutput: standard output\n\nNew Year is coming in Line World! In this world, there are n cells numbered by integers from 1 to n, as a 1 × n board.\nPeople live in cells. However, it was hard to move between distinct cells, because of the difficulty of escaping the cell.\nPeople wanted to meet people who live in other cells.\nSo, user tncks0121 has made a transportation system to move between these cells, to celebrate the New Year.\nFirst, he thought of n - 1 positive integers a1, a2, ..., an - 1.\nFor every integer i where 1 ≤ i ≤ n - 1 the condition 1 ≤ ai ≤ n - i holds.\nNext, he made n - 1 portals, numbered by integers from 1 to n - 1.\nThe i-th (1 ≤ i ≤ n - 1) portal connects cell i and cell (i + ai), and one can travel from cell i to cell (i + ai) using the i-th portal.\nUnfortunately, one cannot use the portal backwards, which means one cannot move from cell (i + ai) to cell i using the i-th portal.\nIt is easy to see that because of condition 1 ≤ ai ≤ n - i one can't leave the Line World using portals.\nCurrently, I am standing at cell 1, and I want to go to cell t. However, I don't know whether it is possible to go there.\nPlease determine whether I can go to cell t by only using the construted transportation system.\n\nInput\nThe first line contains two space-separated integers n (3 ≤ n ≤ 3 × 10^4) and t (2 ≤ t ≤ n) — the number of cells, and the index of the cell which I want to go to.\n\nThe second line contains n - 1 space-separated integers a1, a2, ..., an - 1 (1 ≤ ai ≤ n - i).\nIt is guaranteed, that using the given transportation system, one cannot leave the Line World.\n\nOutput\nIf I can go to cell t using the transportation system, print \"YES\". Otherwise, print \"NO\".\n\n\n\"\"\"\n\ndef new_year_transportation():\n n, t = map(int, input().split(' '))\n a = list(map(int, input().split(' ')))\n q = 1\n while q < t:\n q += a[q - 1]\n print('YES' if q == t else 'NO')\n\nif __name__ == '__main__':\n new_year_transportation()", "n , m = [int(x) for x in input().split()]\r\narr =[int(x) for x in input().split()]\r\nvisited = set()\r\n\r\ndef dfs(value):\r\n stack =[value]\r\n while stack:\r\n temp = stack.pop()\r\n visited.add(temp)\r\n if temp <=len(arr):\r\n stack.append(temp + arr[temp-1])\r\ndfs(1)\r\nif m in visited:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "integers = [int(x) for x in input().split()]\r\n\r\nn = integers[0]\r\n\r\nt = integers[1]\r\n\r\ni = 1\r\n\r\na = [int(x) for x in input().split()]\r\n\r\nans = \"NO\"\r\n\r\nwhile True:\r\n\r\n\tif i == t:\r\n\r\n\t\tans = \"YES\"\r\n\r\n\t\tbreak\r\n\r\n\telif i == n:\r\n\r\n\t\tbreak\r\n\r\n\ti = i + a[i - 1]\r\n\r\nprint(ans)", "def main():\r\n n, t = (int(value) for value in input().split(' '))\r\n array = [int(value) for value in input().split(' ')]\r\n\r\n next_cell = 1\r\n while next_cell < n:\r\n next_cell = next_cell + array[next_cell - 1]\r\n if next_cell == t:\r\n print(\"YES\")\r\n return\r\n elif next_cell > t:\r\n print(\"NO\")\r\n return\r\n print(\"NO\")\r\n return\r\n \r\n\r\nif __name__ == \"__main__\":\r\n main()", "n, t = map(int, input().split())\r\narr = [0] + [int(i) for i in input().split()]\r\ntemp = 1\r\nwhile temp < t:\r\n temp += arr[temp]\r\nprint(\"YES\" if temp == t else \"NO\")\r\n\r\n\r\n\r\n", "def solve():\r\n n, t = [int(i) for i in input().split()]\r\n a = [int(i) for i in input().split()]\r\n i = 1\r\n while i < t:\r\n i += a[i-1]\r\n return i == t\r\n\r\n\r\n# for _ in range(int(input())):\r\n# print(\"YES\" if solve() else \"NO\")\r\nprint(\"YES\" if solve() else \"NO\")\r\n", "n,t = map(int,input().split())\r\nA = list(map(int,input().split()))\r\n\r\nnow = 0\r\nf = 1\r\nwhile now < n:\r\n\t\r\n\tif now >= n-1:\r\n\t\tf = 0\r\n\t\tbreak\r\n\tnow = now + A[now]\r\n\tif now == t-1:\r\n\t\tbreak\r\n\t\t\r\nif f:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n\t\t\r\n", "n, t = [int(x) for x in input().split()]\nq = [int(x) for x in input().split()]\ncurrent = 1\nflag = 0\nwhile(current < n):\n\tcurrent += q[current-1]\n\tif current == t:\n\t\tflag = 1\n\t\tbreak\nprint(\"YES\" if flag else \"NO\")\n \t\t \t \t\t \t \t \t\t\t \t \t", "n, t = list(map(int, input().split(\" \")))\r\na = list(map(int, input().split(\" \")))\r\n\r\nl = 1\r\nwhile l < t:\r\n\tl += a[l - 1]\r\n\r\nif l == t:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\") ", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nai = 1\r\nf = 0\r\nwhile ai <= m:\r\n if ai == m:\r\n f = 1\r\n break\r\n ai += a[ai - 1]\r\nif f:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,t = map(int,input().split())\r\na = list(map(int,input().split()))\r\nx = 1\r\ny = 0\r\nwhile x < t:\r\n x+=a[y]\r\n y += a[y]\r\nif x == t:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "u=input;i=int\r\nv=lambda:map(i,u().split())\r\nn, t = v()\r\ns=list(v())\r\ni=1\r\nwhile i<t:i+=s[i-1]\r\nprint('YNEOS'[i>t::2])", "n, t = list(map(int, input().split()))\na = list(map(int, input().split()))\nx = 0\nwhile (True):\n if x + 1 == t:\n print(\"YES\")\n break\n elif x + 1 > t:\n print(\"NO\")\n break\n else:\n x += a[x]\n \t\t\t\t\t\t \t \t\t\t \t \t \t \t \t\t", "n, t = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\ni = 0\r\n\r\nwhile i < t-1:\r\n i += a[i]\r\n # print(i)\r\n \r\nif i == t-1:\r\n print('YES')\r\nelse: \r\n print('NO')", "n, t = map(int, input().split())\r\nlst = list(map(int, input().split()))\r\nx = 1\r\nwhile x != t and x<n:\r\n x += lst[x-1]\r\nif x == t:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n,t=map(int,input().split())\r\na=list(map(int,input().split()))\r\nc=1\r\nwhile c<t:\r\n c+=a[c-1]\r\nif c==t:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def Codeforces_500_A():\r\n n, cell = map(int, input().split())\r\n numbers = list(map(int, input().split()))\r\n index = 1\r\n while True:\r\n index = numbers[index - 1] + index\r\n if index > cell:\r\n print(\"NO\")\r\n break\r\n elif index == cell:\r\n print(\"YES\")\r\n break\r\n\r\n\r\nif __name__ == '__main__':\r\n Codeforces_500_A()", "n, t = map(int, input().split())\ncells = list(map(int, input().split()))\n\nsaida = 'NO'\ncell = 1\nwhile cell < t:\n cell += cells[cell - 1]\n if cell == t: \n saida = 'YES'\n\nprint(saida)\n\n\n\t \t \t \t\t\t \t \t \t\t\t \t \t\t \t\t", "\r\nn, t = map(int,input().split())\r\n\r\na_values = list(map(int,input().split()))\r\n\r\ngraph = {}\r\nfor cell in range(1, n):\r\n graph[cell] = [cell+ a_values[cell-1]]\r\n#print(graph)\r\n\r\nexplore = []\r\nexplore.append(1)\r\nmark = set()\r\nflag = 1\r\n\r\nwhile len(explore)>0:\r\n current = explore.pop(0)\r\n if current not in mark and current in graph.keys():\r\n mark.add(current)\r\n for j in graph[current]:\r\n if j!=t:\r\n explore.append(j)\r\n else:\r\n flag = 0\r\n print(\"YES\")\r\n break\r\nif flag != 0:\r\n print(\"NO\")", "n,t=map(int,input().split())\r\nk=list(map(int,input().split()))\r\nl=1\r\nwhile l<=t:\r\n l=k[l-1]+l\r\n if l==t:print(\"YES\");break\r\nelse:print(\"NO\")", "n, t = map(int, input().split())\r\na = list(map(int, input().split()))\r\nvis = []\r\n\r\ni = 0\r\ntry:\r\n while True:\r\n vis.append(i+1)\r\n i += a[i]\r\nexcept IndexError:\r\n pass\r\n\r\nprint(\"YES\" if t in vis else \"NO\")\r\n\r\n#########################################\r\n## ##\r\n## Implemented by brownfox2k6 ##\r\n## ##\r\n#########################################\r\n", "import sys\r\n\r\nn, t = map(int, input().split())\r\n\r\nb = list(map(int, input().split()))\r\na = [0]\r\na = n*a\r\na[1:] = b.copy()\r\nx = 1\r\n\r\nwhile (x < t):\r\n x += a[x]\r\n\r\nif (x == t):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a,b=map(int,input().split())\r\nl=list(map(int, input().split()))\r\nm=0\r\nx=0\r\nwhile(m<b):\r\n m+=l[m]\r\n if m==b-1:\r\n x=1\r\n break\r\nif x==0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\") ", "import sys\nfrom collections import namedtuple\n\n\nif not __debug__:\n sys.stdin = open(\"hack.txt\")\n\ninput = sys.stdin.readline\n\ndef solve():\n n, target = list(map(int, input().split(' ')))\n arr = list(map(int, input().split(' ')))\n target -= 1\n\n\n cur = 0\n while cur < target:\n cur += arr[cur]\n print(\"YES\") if cur == target else print(\"NO\")\n\nif __name__ == \"__main__\":\n solve()\n", "# 500A\r\n''' Author : Kunj Gandhi '''\r\n\r\n'''Libraries and Modules'''\r\n#import sys\r\n#import math\r\n#from math import gcd,floor,ceil,sqrt,log\r\n#from sys import stdin,stdout\r\n\r\n'''Functions'''\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\n\r\n'''Code'''\r\nn,t = sp_inp()\r\nl = arr_inp()\r\ncurr = 1 # currently at cell 1 , want to go to cell t\r\nwhile(curr<t):\r\n curr = curr + l[curr-1]\r\nif(curr == t):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,x=list(map(int,input().split()))\r\nele=list(map(int,input().split()))\r\ni=0\r\nwhile i<len(ele):\r\n i+=ele[i]\r\n if i==x-1:\r\n print('YES')\r\n break\r\nelse:print('NO')", "n,t=list(map(int,input().split()))\r\nn=list(map(int,input().split()[:n-1]))\r\np=0\r\nwhile(p<t-1):\r\n p=p+n[p]\r\nif p==t-1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,e = map(int,input().split())\r\nl = list(map(int,input().split()))\r\ni=1\r\nflag= -1\r\nwhile(i<n):\r\n i += l[i-1]\r\n if(i==e):\r\n print('YES')\r\n flag=10\r\n break\r\nif(flag==-1):\r\n print('NO')\r\n\r\n\r\n", "n, k = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\ni = 1\r\nwhile i < k:\r\n i = a[i - 1] + i\r\nif i == k:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,t = map(int,input().split())\r\na = list(map(int,input().split()))\r\ni=0\r\nwhile i < t -1:\r\n\ti += a[i]\r\nif i==(t-1):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "n, t = map(int, input().split())\r\na = list(map(int, input().split()))\r\nx = 0\r\nwhile x < t - 1:\r\n x += a[x]\r\nprint(\"YES\" if x == t - 1 else \"NO\") \r\n", "n,t = [int(i) for i in input().strip().split()]\r\nt-=1\r\na = [int(i) for i in input().strip().split()]\r\nG = [None for i in range(n)]\r\nfor i in range(n-1):\r\n G[i] = i+a[i]\r\nvisited = set()\r\ncurr = 0\r\nwhile curr!=None and curr!=t and curr not in visited:\r\n visited.add(curr)\r\n curr = G[curr]\r\nif curr==t:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "x=input().split()\r\nx=int(x[-1])\r\na=[int(i) for i in input().split()]\r\nt=1\r\nf=False\r\nfor i in range(len(a)):\r\n t+=a[t-1]\r\n if t==x:\r\n f=True\r\n break\r\n if t>x or t-1>len(a):\r\n break\r\nif f:\r\n print('YES')\r\nelse:\r\n print('NO')", "n, t = map(int,input().split())\ncells = list(map(int,input().split()))\nd=0\nout = 'NO'\nwhile True:\n if d > t -1:\n break\n if d== t-1:\n out = 'YES'\n break\n d += cells[d]\nprint(out)\n \t \t \t \t \t \t \t \t", "a = list(map(int, input().split(' ')))\r\nass = list(map(int, input().split(' ')))\r\nlast = 1\r\nflag = False\r\nwhile last <= a[1]:\r\n last = last + ass[last - 1]\r\n if a[1] == last:\r\n flag = True\r\n break\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n, t = map(int, input().split())\ni = 1\nentrada = list(map(int, input().split()))\nresultado = \"NO\"\nwhile i != t and i < n:\n i += entrada[i - 1]\n if i == t:\n resultado = 'YES'\n break\nprint(resultado)\n", "n, g = map(int, input().split())\nl = list(map(int, input().split()))\n\ni = 0\nwhile True:\n if i == g-1:\n print(\"YES\")\n break\n elif i >= n-1:\n print(\"NO\")\n break\n else:\n i += l[i]", "n, t = map(int, input().split())\r\na = list(map(int, input().split()))\r\noutput = \"NO\"\r\ni = 1\r\nwhile i < n:\r\n if a[i - 1] + i == t:\r\n output = \"YES\"\r\n break\r\n i += a[i - 1]\r\nprint(output)", "Number=list(map(int,input().split()))\r\nlistNumber=list(map(int,input().split()))\r\ni=0\r\nwhile i<Number[1]-1:\r\n i+=listNumber[i]\r\nif i==(Number[1]-1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n \r\n", "def main():\r\n n, k = list(map(int, input().split()))\r\n arr = list(map(int, input().split()))\r\n\r\n portal_arr = []\r\n for i in range(1, n):\r\n portal_arr.append(i + arr[i - 1])\r\n\r\n current_positon = 1\r\n while current_positon != n:\r\n new_position = portal_arr[current_positon - 1]\r\n if new_position == k:\r\n print(\"YES\")\r\n return\r\n current_positon = new_position\r\n print(\"NO\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "#50A - New Year Transportation\r\n[n,m],x,p,y=list(map(int,input().split())),list(map(int,input().split())),1,[]\r\nwhile True:\r\n if p==m:\r\n print(\"YES\")\r\n break\r\n elif p in y or p>=n:\r\n print(\"NO\")\r\n break\r\n else:\r\n y.append(p)\r\n p+=x[p-1]", "n, t = [int(i) for i in input().split()]\r\n\r\na = [0]\r\na.extend([int(i) for i in input().split()])\r\n\r\ni = 1\r\nwhile i < t:\r\n i += a[i]\r\n\r\nprint('YES') if i == t else print('NO')", "s1=input().split()\r\nn=int(s1[0])\r\nt=int(s1[1])\r\ns2=input().split()\r\na=0\r\nflag=True\r\nwhile flag:\r\n p=int(s2[a])\r\n a+=p\r\n if a==t-1:\r\n print(\"YES\")\r\n break\r\n elif a>t-1:\r\n print(\"NO\")\r\n break", "def trans(n, t, portals):\r\n i = 1\r\n portals.insert(0, 0)\r\n while i<=n:\r\n if i+portals[i]==t:\r\n return \"YES\"\r\n i += portals[i]\r\n if i>t:\r\n break\r\n return \"NO\"\r\n\r\nn, t = list(map(int, input().split()))\r\nportals = list(map(int, input().split()))\r\nprint(trans(n, t, portals))", "n,t=map(int,input().split())\r\na=list(map(int,input().split()))\r\ni=1\r\nwhile i<=n:\r\n if i+a[i-1]<t:\r\n i=i+a[i-1]\r\n elif i+a[i-1]==t:\r\n print(\"YES\")\r\n break\r\n else:\r\n print(\"NO\")\r\n break\r\n", "n, t = map(int,input().split())\ncells = list(map(int,input().split()))\ni = 0\nout = 'NO'\nwhile True:\n\tif i > t - 1:\n\t\tbreak\n\tif i == t - 1:\n\t\tout = 'YES'\n\t\tbreak\n\ti += cells[i]\nprint(out)\n\t \t \t \t\t \t \t\t \t \t\t \t", "n,t = map(int, input().split())\r\nl = [0]+list(map(int, input().split()))\r\ni=1\r\nwhile i<t:\r\n i+=l[i]\r\nprint(\"YES\" if i==t else \"NO\")", "x = input().split()\r\nn = int(x[0])\r\nt = int(x[1])\r\nx = input().split()\r\nlist1 = []\r\nfor i in x:\r\n list1.append(int(i))\r\n\r\nb1 = False\r\nstart = 0\r\n\r\nwhile b1==False:\r\n if start == t-1:\r\n print(\"YES\")\r\n break\r\n elif start > t-1:\r\n print(\"NO\")\r\n break\r\n start = list1[start]+start\r\n ", "temp = [int(x)-1 for x in input().split()]\r\nsomething = [int(x) for x in input().split()]\r\ni = 0\r\nyes = 1\r\nwhile 1:\r\n if i == temp[1]:\r\n break\r\n i += something[i]\r\n if i > temp[1]:\r\n yes = 0\r\n break\r\nif yes:\r\n print('YES')\r\nelse:\r\n print('NO')", "n, t = map(int, input().split())\r\ncells = list(map(int, input().split()))\r\ni = 0\r\nwhile i < t:\r\n i += cells[i-1]\r\nif i == t:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "I=lambda:map(int,input().split())\r\nn,t=I()\r\na=list(I())\r\nc=0\r\nwhile c<t-1:c+=a[c]\r\nprint('YNEOS'[c>=t::2])", "n,t=map(int,input().split())\r\na=list(map(int,input().split()))\r\np=1\r\nwhile p<t:\r\n p=p+a[p-1]\r\n if p==t:\r\n print(\"YES\")\r\n break\r\nelse:print(\"NO\")", "n,t= map(int,input().split())\r\nl=list(int(q) for q in input().split())\r\na=1\r\ns=0\r\nwhile a<t:\r\n a+=l[a-1]\r\nif a==t:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "p=lambda:map(int,input().split())\r\nN,T=p();a=*p(),;n=1\r\nwhile n<T:n+=a[n-1]\r\nprint(\"YNEOS\"[n>T::2])", "def fn(arr,n,t):\n i = 1\n while i<=t:\n if i==t:\n return True\n i+=arr[i]\n return False\n# n = 8\n# t = 5\n# arr = [0,1,2,1,2,1,1,1]\n# print(fn(arr,n,t))\nif __name__==\"__main__\":\n n,t = map(int,input().split())\n arr = list(map(int,input().split()))\n arr.insert(0,0)\n if fn(arr,n,t):\n print(\"YES\")\n else:\n print(\"NO\")", "a, b = list(map(int, input().split()))\nn = list(map(int, input().split()))\nt = 0\n\nwhile t < b - 1:\n t += n[t]\n\nif t == (b - 1):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "n,t=map(int, input().split())\r\na=list(map(int,input().split()))\r\ni=1\r\nl=[]\r\nwhile i<n:\r\n if a[i-1]>(n-i):\r\n break\r\n l.append(i)\r\n i+=a[i-1]\r\n if i==n:\r\n l.append(i)\r\n break\r\nif t in l:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") ", "n, t = map(int, input().split())\r\narr = [int(i) for i in input().split()]\r\n\r\ncurr = 0\r\nj = 0\r\nwhile(curr < n):\r\n if(curr == t - 1):\r\n print(\"YES\")\r\n break\r\n if(curr > t - 1):\r\n print(\"NO\")\r\n break\r\n curr = curr + arr[curr]\r\n j = j + 1", "n, target = [int(x) for x in input().split()]\r\n\r\nportals = {}\r\n\r\narr = [int(y) for y in input().split()]\r\n\r\nfor i, e in enumerate(arr, 1):\r\n portals[i] = i+e\r\n\r\ncurr = 1\r\nwhile True:\r\n if curr == target:\r\n print(\"YES\")\r\n break\r\n elif curr > target:\r\n print(\"NO\")\r\n break\r\n else:\r\n curr = portals[curr]", "def check(pos, a, n, t):\r\n i = 0\r\n if t == 1:\r\n return \"YES\"\r\n while i < n:\r\n i += a[i]\r\n if i == t - 1:\r\n return \"YES\"\r\n elif i > t - 1:\r\n return \"NO\"\r\n\r\n\r\nn, t = map(int, input().split())\r\na = list(map(int, input().split()))\r\npos = 1\r\nprint(check(pos, a, n, t))", "N_MAX = 3*10**4\r\n\r\nn, t = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nr = [False for _ in range(n)]\r\nr[0] = True\r\n\r\nfor i in range(n-1):\r\n if r[i]: r[i+a[i]]=True\r\n\r\nprint(\"YES\" if r[t-1] else \"NO\")\r\n", "n, t = tuple(map(int, input().split()))\r\narr = list(map(int, input().split()))\r\ni = 0\r\nwhile i < t-1:\r\n i += arr[i]\r\nprint('YES' if i == t-1 else 'NO')", "from sys import stdin, stdout\r\ninput = stdin.readline\r\n\r\nn, t = map(int, input().split())\r\nl = list(map(int, input().split()))\r\ni = 1; c = 0\r\nwhile True:\r\n c = l[i-1] + i\r\n if c == t:\r\n print(\"YES\"); break\r\n elif c > t:\r\n print(\"NO\"); break\r\n i = c", "n, t = map(int,input().split())\r\na = [*map(int,input().split())]\r\np = 1\r\nwhile p<t:\r\n p+=a[p-1]\r\nprint('YNEOS'[p>t::2])", "if __name__ == '__main__':\r\n n, t = map(int, input().split())\r\n\r\n portals = dict()\r\n for idx, elem in enumerate(input().split(), 1):\r\n portals[idx] = int(elem)\r\n\r\n x = 1\r\n while x < t:\r\n x += portals[x]\r\n\r\n print(\"YES\") if x == t else print(\"NO\")\r\n ", "used = set()\r\ndef dfs(u):\r\n ans = 'NO'\r\n p = [u]\r\n while len(p) > 0:\r\n v = p.pop()\r\n if v not in used:\r\n used.add(v)\r\n if v in G:\r\n for w in G[v]:\r\n if w == t:\r\n ans = 'YES'\r\n break\r\n if w not in used:\r\n p.append(w)\r\n print(ans)\r\n\r\nn, t = map(int, input().split())\r\na = list(map(int, input().split()))\r\nG = {}\r\nfor i in range(len(a)):\r\n if i+1 not in G:\r\n G[i+1] = set()\r\n G[i+1].add(i+1+a[i])\r\ndfs(1)\r\n", "import sys\r\nn,t=map(int,input().split())\r\ns=list([int(x) for x in input().split()])\r\ncurrent_cell=0\r\nwhile current_cell<=t:\r\n current_cell+=s[current_cell-1]\r\n if current_cell==t:\r\n print(\"YES\")\r\n sys.exit()\r\n else:\r\n continue\r\nprint(\"NO\")", "n,t = [int(x) for x in input().split()]\r\ncells = [int(x) for x in input().split()]\r\n\r\nt = t-1 #change to 0 based indexing\r\npos = 0\r\nwhile pos<n:\r\n pos += cells[pos]\r\n if pos == t:\r\n print(\"YES\")\r\n break\r\n elif pos > t:\r\n print(\"NO\")\r\n break", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\n\r\ni=1\r\nwhile i<n:\r\n if m==1:\r\n print('YES')\r\n break\r\n i+=l[i-1]\r\n if i==m:\r\n print('YES')\r\n break\r\n \r\nelse:\r\n print('NO')", "n, t=map(int, input().split(' '))\r\na=list(map(int, input().split(' ')))\r\ni=1\r\nwhile i<t:\r\n i+=a[i-1]\r\nprint(\"YES\") if i==t else print(\"NO\")", "n,t=list(map(int,input().split()))\r\narr=list(map(int,input().split()))\r\ni=0\r\nwhile i+arr[i]+1!=t:\r\n i+=arr[i]\r\n if i>=n-1:\r\n print(\"NO\")\r\n exit(0)\r\nelse:\r\n print(\"YES\")\r\n exit(0)\r\nprint(\"NO\")", "n,t=map(int,input().split())\r\nll=list(map(int,input().split()))\r\ncount=1\r\nwhile count!=t and count<t:\r\n count+=ll[count-1]\r\n\r\nif count>t:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n , t = map(int,input().split())\r\nmyarr = list(map(int,input().split()))\r\ni = 0\r\nwhile i < n - 1:\r\n i += myarr[i]\r\n if i == t - 1:\r\n print(\"YES\")\r\n break\r\n\r\nelse:print(\"NO\")\r\n\r\n", "\r\nn,t=map(int,input().split())\r\nAi=list(map(int,input().split()))\r\n#Ai.append(0)\r\ni=1\r\nh=0\r\nans=0\r\n# print(Ai)\r\nwhile i<=t and h<=len(Ai)-1:\r\n i+=Ai[h]\r\n # h+=Ai[h]\r\n # print(h)\r\n # print(Ai[h])\r\n if i==t:\r\n ans=1\r\n h += Ai[h]\r\nif ans==0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "I=lambda:map(int,input().split())\r\nn,t=I()\r\na=*I(),\r\nx=0\r\nwhile x<t-1:x+=a[x]\r\nprint('YNEOS'[x>=t::2])", "def solve():\r\n n,t = map(int,input().split())\r\n l = list(map(int,input().split()))\r\n t = t-1\r\n p = 0\r\n while p<t:\r\n p += l[p]\r\n if p == t:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()", "n,m = [int(x) for x in input().split()]\r\ncell = [int(x) for x in input().split()]\r\npos = 1\r\nnum = 0\r\nwhile pos < n:\r\n pos = pos + cell[pos-1]\r\n if pos == m:\r\n num += 1\r\nif num > 0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n ", "n , t = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nl = [0] + l\r\ni = 1\r\nwhile(i<=t):\r\n if(i==t):\r\n print(\"YES\")\r\n break\r\n else:\r\n i = i+l[i]\r\nelse:\r\n print(\"NO\")", "n, t = map(int, input().split())\r\nstart = 1\r\nlst = [0]+[int(i) for i in input().split()]\r\nwhile start < t:\r\n start += lst[start]\r\nprint('YES' if start == t else 'NO')", "#number of cells and cell want to visit\r\n#portals traveled\r\ncells, visit = input().split(); cells = int(cells); visit = int(visit)\r\nportals = list(map(int, input().split()))\r\n\r\nvisited = False #was cell visited\r\n\r\ncurr = 1 #current start cell\r\nfor i in range(cells - 1):\r\n if curr == cells: break\r\n move = curr + portals[curr - 1] #next cell visited\r\n if move == visit:\r\n visited = True\r\n break\r\n curr = move\r\n \r\nif visited: print(\"YES\")\r\nelse: print(\"NO\")", "#!/usr/bin/env python\r\n\r\n''' \r\n -------------\r\n # जय श्री गणेश\r\n -------------\r\n Name : cyberkid05 | Country : India\r\n Language : Python3\r\n email : [email protected]\r\n'''\r\n\r\n#INTRODUCTION\r\n# ''' Meet my Codechef Doggie\r\n# |\\_/| \r\n# | @ @ Woof! \r\n# | <> _ \r\n# | _/\\------____ ((| |))\r\n# | `--' | \r\n# ____|_ ___| |___.' \r\n# /_/_____/____/_______|\r\n# I am here to guard this code, woof!\r\n# '''\r\n\r\n#--MODULES BEGINS--\r\n''' --python 2 and pypy begins-- # Comment this line for Python 2\r\nfrom __future__ import division, print_function\r\nif sys.version_info[0] < 3:\r\n from __builtin__ import xrange as range\r\n from future_builtins import ascii, filter, hex, map, oct, zip\r\n# --python 2 and pypy ends-- '''\r\nimport io, os, re, sys, time\r\nfrom io import BytesIO, IOBase\r\nimport math, functools, collections\r\n# import bisect, heapq, numpy, statistics \r\n# from contextlib import contextmanager\r\n# from jinja2 import Template\r\n#--MODULES ENDS--\r\n\r\n#--SHORTHANDS BEGINS--\r\n# input = raw_input\r\n# input = sys.stdin.readline\r\n# sys.stdout.flush()\r\n# alphabets = \"abcdefghijklmnopqrstuvwxyz\"\r\n# from statistics import mode\r\n# from functools import reduce\r\n# from bisect import bisect\r\n# from collections import defaultdict, Counter\r\n# hp = defaultdict(lambda: 0)\r\n# hp = collections.defaultdict(int, collections.Counter(lis))\r\n# lis = sorted(hp.items(), key = lambda kv:(kv[1], kv[0]))\r\n# lis = sorted(lis, key = lambda ele: (ele[1], ele[0]))\r\n# lis = list(filter(lambda a: a[1] != min(hp.values()), lis))\r\ninput = sys.stdin.readline\r\nistr = lambda: input().strip()\r\ninum = lambda: int(input().strip())\r\nimap = lambda: map(int,input().strip().split())\r\nilist = lambda: list(map(int, input().strip().split()))\r\n# sys.stdout.write(str(ans) + \"\\n\")\r\n# for line in sys.stdin\r\n# except: print(f'Unknown Error: {sys.exc_info()[1]}')\r\n# w = int(input()); print(\"YNEOS\"[(w > 2 and not w % 2)::2])\r\n# return self.inorderTraversal(root.left) + [root.val] + self.inorderTraversal(root.right) if root else list()\r\n#--SHORTHANDS ENDS--\r\n\r\n#---- CODE BEGINS ----->\r\n\r\ndef squareMatrix(n):\r\n grid = [[0] * n for _ in range(n)]\r\n return grid\r\n\r\ndef Matrix2D(rows, cols):\r\n grid = [[0 for j in range(cols)] for i in range(rows)]\r\n return grid\r\n\r\nclass LinkedListNode:\r\n # __slots__ = ['data', 'next',]\r\n def __init__(self, data):\r\n self.data = data\r\n self.next = None\r\n\r\nclass LinkedList:\r\n # __slots__ = ['head', 'size',]\r\n def __init__(self):\r\n self.head = None\r\n self.size = 0\r\n\r\nclass Node:\r\n def __init__(self, data):\r\n self.left = None\r\n self.right = None\r\n self.val = data\r\n\r\n#--GLOBAL VALUES BEGINS--\r\n\r\nclass ConstantMod:\r\n ''' Constant Values for Competitive Programming '''\r\n # __slots__ = ['_modd', '_maxx', ] # for fixed number of attributes in __dict__ of the class's instance object\r\n def __init__(self, n = None, *args, **kwargs):\r\n self._modd = n\r\n # self.minn = -(n)\r\n self._maxx = kwargs['maxvalue'] if 'maxvalue' in kwargs else int(1e9 + 7)\r\n self._maxx *= -1 if 'negative' in kwargs and kwargs['negative'] == True else 1\r\n # def __str__(self): # DEBUG\r\n # return f'The value of the modulo is {self._maxx}'\r\n def value(self, vv=None):\r\n if vv: self._modd = vv\r\n try: return self._modd\r\n except AttributeError: return None\r\n\r\n# @contextmanager\r\n# def simple_context_manager(obj):\r\n# try:\r\n# obj.maxx = INF\r\n# obj.minn = -(INF)\r\n# yield\r\n# finally:\r\n# obj.maxx = 10 ** 9 + 7\r\n# obj.minn = -(10 ** 9 + 7)\r\n# StartTime = time.time()\r\n# print(\"\\nExecution Time: \",time.time()-StartTime)\r\n# input = lambda : sys.stdin.readline()\r\n# alp = \"abcdefghijklmnopqrstuvwxyz\"\r\n# modobj = ConstantMod()\r\n# modobj = ConstantMod(negative = True)\r\n# modobj = ConstantMod(maxvalue = 10 ** 5 + 9)\r\n# INF = 10 ** 15 # Change as per need\r\n#--GLOBAL VALUES ENDS--\r\n\r\n#--FUNCTIONS BEGINS--\r\n\r\n\r\ndef solve():\r\n # YOUR CODE HERE\r\n # global modobj\r\n # print(modobj.value(int(1e15))) #setting modobj._modd from None to given param\r\n try:\r\n queries = 1\r\n # queries = int(input())\r\n # while True:\r\n for query in range(queries):\r\n try:\r\n n, r = list(map(int, input().split()))\r\n h = list(map(int, input().split()))\r\n flag = False\r\n nxt, i = 0, 0\r\n while(True):\r\n if i == r-1:\r\n flag = True\r\n break\r\n if nxt == n-1:\r\n break\r\n i= i + h[nxt]\r\n nxt = i\r\n if flag:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n except EOFError as e1: #end of input file\r\n # print(\"Error_inner: \", e1)\r\n break\r\n finally:\r\n pass\r\n except Exception as e2:\r\n # print(\"ERROR_outer: \", e2)\r\n pass\r\n # os.write(1,\"%d\"%ans)\r\n # sys.stdout.write(str(ans))\r\n # print(\"YES\" if ans else \"NO\")\r\n # sys.stdout.write(\"{}\".format(ans))\r\n # pass\r\n\r\ndef main():\r\n tcs = 1\r\n # tcs = int(input())\r\n for tc in range(tcs):\r\n # with simple_context_manager(modobj): # temporary environment\r\n solve()\r\n\r\n # OUTPUT - GOOGLE KICKSTART\r\n # if solve():\r\n # print('Case #{}: {}'.format(tc, \"YES\"))\r\n # else:\r\n # print('Case #{}: {}'.format(tc, \"NO\"))\r\n#--FUNCTIONS ENDS--\r\n\r\n# # REGION FASTIO\r\nBUFSIZE = 8192\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 sys.version_info[0] < 3:\r\n sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)\r\nelse:\r\n sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n# # END REGION\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n#<----- CODE ENDS ----\r\n\r\n\r\n'''\r\n\r\n#----INPUT----\r\n\r\n# INPUT DATA HERE\r\n\r\n#----OUTPUT----\r\n\r\n# OUTPUT DATA HERE\r\n\r\n'''\r\n\r\n''' SHORTER CODE - comment this line to run the below code\r\n\r\n# YOUR NOTES HERE\r\n\r\n# ''' \r\n", "\nn,t=map(int,input().split())\nl=list(map(int,input().split()))\ns=0\nwhile s<t-1:\n s+=l[s]\nif s==t-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", "from sys import stdin\r\ndef input(): return stdin.readline()[:-1]\r\nn,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\ni=0\r\nwhile i+1<m:\r\n\ti+=a[i]\r\nif i+1==m:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "from sys import stdin\r\n\r\n# from sys import setrecursionlimit\r\n# import resource\r\ninput = stdin.readline\r\n\r\n\r\n# setrecursionlimit(int(1e9))\r\n# resource.setrlimit(resource.RLIMIT_STACK, (2**29,-1))\r\n\r\ndef ii():\r\n return int(input())\r\n\r\n\r\ndef li():\r\n return list(map(int, input().split()))\r\n\r\nn,t=li()\r\na=li()\r\npos=1\r\nc=0\r\nwhile pos<=(t):\r\n if pos==(t):\r\n c=1\r\n print('YES')\r\n break\r\n pos += a[pos-1]\r\nif c==0:\r\n print('NO')\r\n", "class Solution:\r\n\tdef __init__(self):\r\n\t\tpass\r\n\r\n\tdef solve(self):\r\n\t\tn, t = map(int, input().split())\r\n\t\tarr = list(map(int, input().split()))\r\n\t\tpos = 0\r\n\t\tflag = False\r\n\r\n\t\twhile pos < n:\r\n\t\t\tpos += arr[pos]\r\n\r\n\t\t\tif pos == t - 1:\r\n\t\t\t\tflag = True\r\n\t\t\t\tbreak\r\n\t\t\telif pos > t - 1:\r\n\t\t\t\tbreak\r\n\r\n\t\tif flag:\r\n\t\t\tprint(\"YES\")\r\n\t\telse:\r\n\t\t\tprint(\"NO\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\tsol = Solution()\r\n\tsol.solve()\r\n", "n, t = map(int,input().split())\r\ncells = list(map(int,input().split()))\r\ni = 0\r\nout = 'NO'\r\nwhile True:\r\n\tif i > t - 1:\r\n\t\tbreak\r\n\tif i == t - 1:\r\n\t\tout = 'YES'\r\n\t\tbreak\r\n\ti += cells[i]\r\nprint(out)", "def solve():\r\n n, t = map(int, input().split())\r\n portals = list(map(int, input().split()))\r\n visits = [1]\r\n for i in range(n-1):\r\n val = visits[i] + portals[visits[i]-1]\r\n visits.append(val)\r\n if val >= n:\r\n break\r\n if t in visits:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\ndef main():\r\n print(solve())\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n, t = map(int, input().split())\r\n*a, = map(int, input().split())\r\nindex = 0\r\nt -= 1\r\nwhile index < t:\r\n index = a[index] + index\r\nprint(\"YES\" if index == t else \"NO\")\r\n", "n,t=map(int, input().split())\r\nl=list(map(int, input().split()))\r\ni=1\r\nflag=0\r\nwhile(i<=t):\r\n if i==t:\r\n print(\"YES\")\r\n flag=1\r\n break\r\n i+=l[i-1]\r\nif flag==0:\r\n print(\"NO\")\r\n\r\n\r\n", "n,t = map(int, input().split())\r\na= list(input().split())\r\na = [int(i) for i in a]\r\n\r\nidx = 1\r\n\r\nwhile idx < t:\r\n idx+= a[idx-1]\r\n #print(a[idx-1])\r\n\r\n\r\n\r\n\r\nif idx == t:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "n, need_portal = map(int, input().split())\r\nportals = list(map(int, input().split()))\r\nstart = 1\r\n\r\nwhile True:\r\n if start == need_portal:\r\n print('YES')\r\n break\r\n if start == n:\r\n print('NO')\r\n break\r\n start += portals[start - 1]\r\n", "from collections import deque\r\nimport math\r\nfrom collections import OrderedDict\r\nimport heapq\r\ndef sol(arr,t):\r\n i=0\r\n while i<=t-1:\r\n i=i+arr[i]\r\n if i==t-1:\r\n return \"YES\"\r\n return \"NO\"\r\n \r\ndef main():\r\n n,t=map(int,input().rstrip().split())\r\n arr=list(map(int,input().rstrip().split()))\r\n print(sol(arr,t))\r\nif __name__==\"__main__\":\r\n main()", "n,t = map(int,input().split())\r\ns = input()\r\ntemp = '0 '+s\r\na = list(map(int,temp.split()))\r\npos = 1\r\nwhile pos<=len(a):\r\n pos = pos+a[pos]\r\n if pos == t:\r\n print('YES')\r\n break\r\n if pos>t:\r\n print('NO')\r\n break\r\n \r\n \r\n \r\n\r\n", "size, casa = [int(x) for x in input().split()]\r\nlista = [int(x) for x in input().split()]\r\n\r\ncasa -= 1\r\n\r\nans = False\r\ni = 0 \r\nwhile i <= casa:\r\n atual = lista[i]\r\n i+= atual\r\n \r\n if i == casa:\r\n print(\"YES\")\r\n ans = True\r\n break\r\n\r\nif not ans:\r\n print(\"NO\")", "n, t = map(int, input().split())\r\nt = t-1\r\ns = [x for x in map(int,input().split())]\r\ni = 0\r\nwhile i<=t:\r\n i = i+s[i]\r\n if i==t:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")", "import math\r\n#f = open(\"test.txt\")\r\n\r\nn, t = map(int, input().split())\r\ncells = list(map(int, input().split()))\r\n \r\ni = 1\r\nres = False\r\nwhile i <= len(cells):\r\n\ti = i + cells[i-1]\r\n\tif i == t:\r\n\t\tres = True\r\n\t\tbreak\r\n \r\nprint(\"YES\" if res else \"NO\")", "n, m = [int(i) for i in input().split()]\r\nk = [int(i) for i in input().split()]\r\np = 0\r\nwhile p < m-1:\r\n p += k[p]\r\nif p == m-1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,t = map(int,input().split())\r\na = list(map(int,input().split()))\r\n\r\nportallar=[]\r\nfor i in range(1,n):\r\n if i ==1:\r\n portallar.append((i,i+a[i-1]))\r\n else:\r\n if portallar[-1][1]==i:\r\n portallar.append((i,i+a[i-1]))\r\n\r\nfor i in portallar:\r\n if i[1]==t:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "A=input().split()\r\nt=int(A[1])-1\r\nB=list(map(int, input().split()))\r\na=0\r\nwhile a<t:\r\n a+=B[a]\r\nif a==t:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, t = [int(i) for i in input().split()]\r\na = [0]\r\na.extend([int(i) for i in input().split()])\r\n\r\ni = 1\r\nwhile i < len(a):\r\n i += a[i]\r\n if i == t:\r\n print('YES')\r\n exit()\r\nprint('NO')", "n, t = map(int,input().split())\r\nscore = list(map(int,input().split(' ')))\r\ni=1\r\na=0\r\nwhile i<t:\r\n i=score[i-1]+i\r\n\r\nprint('YES' if i==t else 'NO')", "from collections import defaultdict\n\ndef dfs(cur, dest, graph, visited):\n if cur == dest:\n return True\n\n if cur in visited:\n return False\n\n visited.add(cur)\n for nbr in graph[cur]:\n if dfs(nbr, dest, graph, visited):\n return True\n return False\n\n\ndef solution():\n n, t = map(int, input().split())\n arr = list(map(int, input().split()))\n graph = defaultdict(list)\n\n for i, val in enumerate(arr, 1):\n graph[i].append(val + i)\n \n res = dfs(1, t, graph, set())\n if res:\n print(\"YES\")\n else:\n print(\"NO\")\n \n\n \n\nimport sys\nimport threading\nsys.setrecursionlimit(1 << 30)\nthreading.stack_size(1 << 27)\nthread = threading.Thread(target=solution)\nthread.start(); thread.join()\n \n \n", "n, t = map(int, input().split())\r\ncells = list(map(int, input().split()))\r\ncounter = 1\r\nans = \"NO\"\r\nif t == 1:\r\n ans = \"YES\"\r\nwhile counter < n:\r\n counter += cells[counter-1]\r\n if counter == t:\r\n ans = \"YES\"\r\nprint(ans)", "from sys import stdin, stdout\r\nn, cell = map(int, stdin.readline().strip().split())\r\narray = list(map(int, stdin.readline().strip().split()))\r\npossible = False;cell-=1;\r\nj = 0\r\nwhile(possible==False):\r\n j = j + array[j] \r\n if j==cell:\r\n possible = True\r\n elif j>cell:\r\n break;\r\nif possible:\r\n stdout.write(\"YES\\n\") \r\nelse:\r\n stdout.write(\"NO\\n\")\r\n ", "n,t=tuple(map(int,input().split()))\r\ntrans=list(map(int,input().split()))\r\nutrans=[i+1+trans[i] for i in range(n-1)]\r\ncurrent=1\r\nwhile current<t:\r\n current=utrans[current-1]\r\nif current==t:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = [int(_) for _ in input().split()]\narr = [int(_) for _ in input().split()]\ni, flag = 0, 0\nwhile i < n[0]:\n i += arr[i-1]\n if i == n[-1]:\n flag = 1\n break\nif flag == 1:\n print('YES')\nelse:\n print('NO')\n\n", "n,t = map(int,input().split())\r\narr = list(map(int,input().split()))\r\ninit = 1\r\nif t == init:\r\n print('YES')\r\nelse:\r\n b = False\r\n while init <n:\r\n init += arr[init-1]\r\n if init == t:\r\n print('YES')\r\n b = True\r\n break\r\n if not b:\r\n print('NO')", "i=0;\nn,t=[int(x) for x in input().split(\" \",2)];\nt-=1;\nstep=[int(x) for x in input().split(\" \",n-1)];\n\n\nwhile i<n-1:\n if(i==t):\n break;\n i+=step[i];\n \n\nif i==t:\n print(\"YES\");\nelse:\n print(\"NO\");\n \t \t\t\t\t \t \t\t\t \t \t \t \t", "n, t = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\ni = 0\r\n\r\nwhile i < t - 1:\r\n i += a[i]\r\n\r\nprint('YES' if i == t - 1 else 'NO')\r\n\r\n\r\n", "def main():\r\n a,b = map(int,input().split())\r\n ways= list(map(int,input().split()))\r\n b-=1\r\n t=0\r\n while(b>t):\r\n t+=ways[t]\r\n if(t==b):\r\n print('YES')\r\n return\r\n print('NO')\r\nmain()\r\n", "#https://codeforces.com/problemset/problem/500/A\r\n\r\n(n, t) = (int(x) for x in input().split(\" \"))\r\ntransporter = [int(x) for x in input().split(\" \")]\r\nstarting_position = 1\r\nposition = starting_position\r\nwhile position < t:\r\n position += transporter[position-1]\r\nif(position == t):\r\n answer=\"YES\"\r\nelse:\r\n answer = \"NO\"\r\nprint(answer)", "n, t = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\nk = 1\r\nflag = False\r\nwhile k<n and k<t:\r\n k = k+arr[k-1]\r\n if k == t:\r\n flag = True\r\n break\r\n\r\nprint(\"YES\" if flag else \"NO\")", "def getTarget(vet, t):\n position = 0\n while position<n-1:\n if(position==t-1):\n return True\n else:\n position+=vet[position]\n \n if(position==t-1):\n return True\n return False\n\n\nn, t = map(int, input().split())\nvet = [int(i) for i in input().split()]\n\nif(getTarget(vet, t)):\n print('YES')\nelse: \n print('NO')\n\t \t\t \t \t \t \t", "from sys import stdin\n\ndef line(): return stdin.readline().strip()\ndef rd(converter): return converter(line())\ndef rl(converter, delimeter = None): return list(map(converter, line().split(delimeter)))\ndef rls(num_lines, converter): return [rd(converter) for i in range(num_lines)]\ndef rg(num_lines, converter, delimeter = None): return [rl(converter,delimeter) for i in range(num_lines)]\n\nMULTIPLE_CASES = 0\n\ndef main():\n N,T = rl(int)\n A = rl(int)\n\n i = 0\n while i not in [N-1,T-1]: i += A[i]\n\n print([\"NO\",\"YES\"][i == T-1])\n\nfor i in range(rd(int) if MULTIPLE_CASES else 1): main()", "import sys\n# sys.stdin = open(\"input.txt\", \"r\")\n# sys.stdout = open(\"output.txt\", \"w\")\n# sys.stderr = open(\"error.txt\", \"w\")\n\n\n'''\nbaabbbeeee\ni=0 b\ni =1 a\n\n'''\n\nn, t = map(int,input().split())\narr = list(map(int,input().split()))\n\np = 0\nwhile p < t-1 :\n\tp+=arr[p]\n\nif p == t-1 : \n\tprint(\"YES\")\nelse :\n\tprint(\"NO\")\n", "if __name__ == '__main__':\r\n n, t = [int(x) for x in input().split()]\r\n portal = [int(x) for x in input().split()]\r\n valido = []\r\n k=1\r\n\r\n while True:\r\n valido.append(k)\r\n k = k + portal[k-1]\r\n if k > len(portal):\r\n valido.append(k)\r\n break\r\n\r\n if t in valido:\r\n print(\"YES\")\r\n else: \r\n print(\"NO\")", "length , cell = map(int,input().split())\r\nnums = list(map(int,input().split()))\r\nindex = 0\r\nwhile index < cell :\r\n if index == cell - 1 : quit(print(\"YES\"))\r\n index += nums[index]\r\nprint(\"NO\")", "# list(map(int,input().split()))\r\nimport math\r\ninp=list(map(int,input().split()))\r\nn=inp[0]\r\nt=inp[1]\r\na= list(map(int,input().split()))\r\ni=1\r\nwhile(i<t):\r\n i=i+a[i-1]\r\nprint('YES') if i==t else print('NO')", "n, t = map(int, input().split())\r\nar = list(map(int, input().split()));i=1\r\nwhile i<t:i+=ar[i-1]\r\nprint(\"YNEOS\"[i>t::2])", "n,s=map(int,input().split())\nb=list(map(int,input().split()))\ni=0\ns-=1\nwhile i<s:\n i+=b[i]\nprint(\"YES\"if i==s else\"NO\")\n\t\t\t\t\t\t\t\t\t\t \t \t \t\t \t\t\t\t \t \t", "import sys\r\nn, t = map(int, input().split())\r\nai = [0] + [int(_) for _ in input().split()]\r\nc = 1\r\nwhile c < t:\r\n c = c + ai[c]\r\n if c == t:\r\n print('YES')\r\n sys.exit(0)\r\nelse:\r\n print('NO')", "n,t=map(int,input().split())\r\na=list(map(int,input().split()))\r\ni=0\r\narr=[]\r\npos=0\r\nwhile i<len(a):\r\n arr.append(i+1)\r\n i+=a[i]\r\narr.append(i+1)\r\nif t in arr:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, t = map(int, input().split())\r\nl = [int(i) for i in input().split()]\r\nres = []\r\nteleport = 0\r\nres.append(1)\r\nb = 1\r\nflag = False\r\nfor i in range(n-1):\r\n if b > n-1:\r\n break\r\n s = (b + l[teleport])\r\n b = s\r\n teleport = s-1\r\n res.append(s)\r\n if t in res:\r\n flag = True\r\n break\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,t=map(int,input().split())\r\na=list(map(int,input().split()))\r\ni=0\r\nwhile i<n-1: \r\n i+=a[i]\r\n if i==t-1:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "# Ahmed_Abdelrazik\r\n\r\nn,t = map(int,input().split())\r\na = list(map(int,input().split()))\r\n\r\ni = 1\r\nflag = False\r\nfor _ in range(n):\r\n if i > n-1 :\r\n break\r\n if i+a[i-1] == t:\r\n flag = True\r\n print(\"YES\")\r\n i = i + a[i-1]\r\nif flag ==False:\r\n print(\"NO\")", "N, t = map(int, input().split())\r\nS = list(map(int, input().split()))\r\ncurrent = 1\r\nwhile current < N and current != t:\r\n current += S[current - 1]\r\nif current == t:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, t = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\npos = 1\r\nwhile pos != t and pos != n:\r\n pos += a[pos - 1]\r\n if pos == t:\r\n print (\"YES\")\r\n exit()\r\nprint (\"NO\")", "n,t=map(int,input().split())\na=list(map(int,input().split()))\n\ni=0\nt=t-1\nwhile i<t:\n i+=a[i]\n \nif i==t:\n print('YES')\n\nelse:\n print('NO')\n \t \t \t\t\t\t \t \t\t \t \t \t\t", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nans=0\r\ni=0\r\nans2=\"NO\"\r\nwhile i<m:\r\n if i==m-1:\r\n ans2=\"YES\"\r\n break\r\n elif i>m-1:\r\n ans2=\"NO\"\r\n break\r\n else:\r\n i+=l[i]\r\nprint(ans2)", "\r\n\r\n\r\nn,t=map(int,input().split())\r\ns=input().split()\r\nm=[1]\r\np=1\r\nwhile p<=n-1:\r\n p+=int(s[p-1])\r\n m.append(p)\r\nprint('YES' if t in m else 'NO')\r\n", "# 500A\r\n# new year transportation\r\n\r\ndef solve(n,t,lst):\r\n for i in range(1,n):\r\n # print(i)\r\n # print(lst[i-1])\r\n lst[i-1] = lst[i-1] + i\r\n # print(lst)\r\n \r\n dest = lst[0]\r\n while dest <= t:\r\n if dest == t:\r\n return \"YES\"\r\n dest = lst[(dest-1)] \r\n return \"NO\"\r\nn,t = [int(x) for x in input().split()]\r\nlst = [int(x) for x in input().split()]\r\nprint(solve(n,t,lst))", "from collections import defaultdict\r\n \r\nn , indx = map(int, input().split())\r\n \r\ncells = list(map(int , input().split()))\r\n \r\ndict_ = defaultdict(int)\r\ncell = [i for i in range(1, n+1)]\r\nfor i in range(len(cells)):\r\n dict_[i+1] = cells[i]\r\n\r\nsets= set()\r\nsets.add(1)\r\nsum_ = 0\r\n\r\nfor keys in dict_:\r\n\r\n if keys == 1 and sum_ == 0:\r\n sum_ += (keys + dict_[keys])\r\n sets.add(sum_)\r\n \r\n else:\r\n while sum_ < n:\r\n \r\n sum_+=(dict_[sum_])\r\n sets.add(sum_)\r\n \r\n \r\n \r\n \r\n \r\nprint('YES' if indx in sets else \"NO\")\r\n", "length, target = [int(x) for x in input().split()]\r\narray = [int(x) for x in input().split()]\r\n\r\ncell_index = 1\r\n\r\nwhile True:\r\n\tif target == cell_index:\r\n\t\tprint('YES')\r\n\t\tbreak\r\n\telif target < cell_index:\r\n\t\tprint('NO')\r\n\t\tbreak\r\n\r\n\t\r\n\tcell_index = cell_index + array[cell_index - 1] \r\n\t", "n,t=list(map(int,input().split()))\r\n\r\npath=list(map(int,input().split()))\r\n\r\nfor i in range(n-1):\r\n path[i]+=i+1\r\n\r\nind=1\r\nwhile(path[ind-1]!=t and path[ind-1]!=n):\r\n ind=path[ind-1]\r\n\r\nif(t==n or path[ind-1]==t):\r\n print('YES')\r\nelse:\r\n print('NO')", "n, t = map(int, input().split())\ni = 1\nv = list(map(int, input().split()))\nwhile i != t and i < n:\n i += v[i - 1]\nprint([\"NO\", \"YES\"][i == t])\n", "def solve(): \r\n n, t = map(int, input().split())\r\n a = list(map(int, input().split())) \r\n flag = False \r\n transport = []\r\n \r\n for i in range(n-1): \r\n val = (i+1) + a[i] \r\n transport.append(val)\r\n \r\n check = transport[0]\r\n while True: \r\n if check == t: \r\n flag = True \r\n break \r\n elif check == n: \r\n break \r\n else: \r\n check = transport[check-1] \r\n\r\n if flag: print(\"YES\")\r\n else: print(\"NO\")\r\n\r\nsolve() ", "def solve(a: int, b: int, arr: list) -> str:\r\n curr = 0\r\n while curr < a - 1:\r\n curr = curr + arr[curr]\r\n if curr == b - 1:\r\n return(\"YES\")\r\n return (\"NO\")\r\n \r\na, b = list(map(int, input().split()))\r\narr = list(map(int, input().split()))\r\nprint(solve(a, b, arr))\r\n ", "n,t=map(int,input().split())\r\narr=list(map(int,input().split()))\r\narr_=list()\r\nfor i in range(n-1):\r\n arr_.append(arr[i]+i+1)\r\npos=1\r\nwhile(pos<t):\r\n pos=arr_[pos-1]\r\nif pos==t:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def function(parm1, parm2, parm3):\n casinha = 1\n while casinha < parm2:\n casinha += parm3[casinha - 1]\n if casinha == parm2:\n return True\n return False\n\nparm1, parm2 = map(int, input().split())\nparm3 = list(map(int, input().split()))\nif function(parm1, parm2, parm3):\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", "\r\ndef main():\r\n n,t=map(int,input().split())\r\n arr=list(map(int,input().split()))\r\n \r\n def dfs(target,current)->bool:\r\n if target==current:\r\n return True\r\n if current>len(arr):\r\n return False\r\n if current>target:\r\n return False\r\n \r\n return dfs(target,current+arr[current-1])\r\n \r\n \r\n if dfs(t,1):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\nimport sys, threading\r\n\r\ninput = lambda: sys.stdin.readline().strip()\r\n\r\nif __name__ == '__main__':\r\n \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\n", "n, t = map(int, input().split())\na_list = list(map(int, input().split()))\n\nportals = [0] * n\nfor i in range(1, len(a_list) + 1):\n portals[i - 1] = i + a_list[i-1]\n\nresult = 'NO'\n\ncurrent_cell = portals[0]\nfor i in range(n):\n if current_cell == t:\n result = \"YES\"\n break\n else:\n current_cell = portals[current_cell - 1]\n\n\nprint(result)\n\n\t \t\t\t\t \t \t \t\t\t\t \t\t \t \t\t \t", "n,destiny = map(int,input().split())\r\na = list(map(int,input().split()))\r\na.insert(0,0)\r\n \r\ncurrent = 1\r\ni = 1\r\nwhile i <= n:\r\n if current == destiny:\r\n print(\"YES\")\r\n break\r\n current += a[i]\r\n i = current\r\n if current > destiny:\r\n print(\"NO\")\r\n break\r\n", "n,m = map(int,input().split())\r\narr = list(map(int,input().split()))\r\n\r\ni=1\r\nwhile(i!=m and i<n):\r\n i+=arr[i-1]\r\nif(i==m):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\nn, t = map(int, input().split())\nl1 = list(map(int, input().split()))\ni = 1\ncurrent = 1\nans = False\n\nwhile current < t:\n current = l1[current-1] + current\n\nif current == t:\n ans = True\n\nif ans:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "n, t = map(int, input().split())\r\nseq = tuple(int(i) for i in input().split())\r\ncnt = 0\r\n\r\nwhile cnt < t - 1:\r\n cnt += seq[cnt]\r\n\r\nif cnt == t - 1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n", "n, t = input().split(\" \")\r\nn, t = int(n), int(t)\r\np = input().split(\" \")\r\np = list(map(int, p))\r\ncurr = 1\r\nwhile curr < t and curr < n:\r\n curr += p[curr-1]\r\nif curr == t:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "n, t = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nflag = False\r\ncount = 1\r\nif t == 1:\r\n print(\"YES\")\r\ni = 1\r\nwhile i < n:\r\n count = a[i-1]+i\r\n if count == t:\r\n flag = True\r\n break\r\n if count > t:\r\n break\r\n i = count\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n,m=list(map(int,input().split()))\r\n\r\na=list(map(int,input().split()))\r\np=0\r\nans=\"NO\"\r\nwhile p < m - 1:\r\n p += a[p]\r\nif p==m-1:\r\n ans=\"YES\"\r\nprint(ans)", "n, t = map(int, input().split())\r\nl = [0]+[int(x) for x in input().split()]\r\npos = 1\r\nwhile pos < t:\r\n pos += l[pos]\r\nif pos == t: print('YES')\r\nelse: print('NO')\r\n", "numofcells,index= map(int, input().split())\r\nli =list(map(int, input().split()))\r\nres=0\r\n\r\nwhile res<index-1:\r\n res+=li[res]\r\nif res==index-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 ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ ⠀⣶⣾⣿⣿⣿⣿⣿⡿⠟\r\n ⠀⠀⠀⠀⠀⠀⠀⠀ ⠀⣀⣾⣿⣿⣿⣿⣿⣿⠋⠁\r\n ⠀⠀⢸⣿⣿⣿⣤⠀⣤⣿⣿⣿⣿⣿⣿⠛\r\n ⠀⠀⠸⢿⣿⣿⣿⣿⣿⣿⣿⣿⢿⠏⠉\r\n ⠀⠀⠀⠸⠿⣿⣿⣿⣿⣿⣿⣏⣤⣀\r\n ⠀⠀⠀⣤⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿\r\n ⢰⣶⣾⣿⣿⣿⡟⠃⠛⠛⢻⡿⠿⠛\r\n ⢸⣿⣿⣿⣿⠏\r\n ⠈⠛⠛⠉⠉\r\n\r\n⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n\"\"\"\r\nn, t = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\npos = 1\r\nc = 0\r\nwhile pos <= (t):\r\n if pos == (t):\r\n c = 1\r\n print('YES')\r\n break\r\n pos += a[pos - 1]\r\nif c == 0:\r\n print('NO')\r\n", "m,t = map(int,input().split())\r\nlst = list(map(int,input().split()))\r\n\r\nb1 = False\r\ncnt = 0\r\n\r\nwhile b1==False:\r\n if cnt == t-1:\r\n print(\"YES\")\r\n break\r\n elif cnt > t-1:\r\n print(\"NO\")\r\n break\r\n cnt = lst[cnt]+cnt", "n, t = map(int, input().split())\r\na = [int(x) for x in input().split()]\r\nposition = 1\r\nwhile position < t:\r\n\tposition += a[position - 1]\r\nif position == t:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "\r\na, b = [int(num) for num in input().split()]\r\nlst = [int(num) for num in input().split()]\r\nlct = 1\r\nwhile(lct < b):\r\n lct += lst[lct-1]\r\nif lct == b:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n, t = [ int(x) for x in input().split() ]\r\nmyList = [ int(x) for x in input().split() ]\r\nmyList.insert(0, 0)\r\nx = 1\r\nFLAG = 0\r\nwhile True:\r\n x += myList[x]\r\n if x == t :\r\n FLAG = 1\r\n break\r\n if x == n :\r\n break\r\nprint([\"NO\", \"YES\"][FLAG])", "num,t =map(int,input().split())\r\nls=list(map(int,input().split()))\r\ntest=ls[0]+1\r\nwhile test<t:\r\n test+=ls[test-1]\r\nprint(\"YES\" if test==t else \"NO\")\r\n ", "n, t = map(int, input().split(' '))\narr = list(map(int, input().split(' ')))\ndef transportation(arr, n, t):\n pos = 1\n while pos < n:\n pos = pos + arr[pos-1]\n if pos == t:\n print(\"YES\")\n return\n print(\"NO\")\n return\ntransportation(arr, n, t)\n", "# New Year Transportation\r\nx = input().split(\" \")\r\nt = int(x[1])\r\ns = input().split(\" \")\r\ns = [int(i) for i in s]\r\ni = 0\r\nsum = s[i]\r\nwhile i <= t:\r\n sum = i + 1 + s[i]\r\n i = sum - 1\r\n if sum == t:\r\n print(\"YES\")\r\n break\r\n elif sum > t:\r\n print(\"NO\")\r\n break ", "n,t=map(int, input().strip().split())\r\na=list(map(int, input().strip().split()))\r\ni=1\r\nflag=False\r\nwhile i<t:\r\n if i+a[i-1]==t:\r\n flag=True \r\n break\r\n else:\r\n i=i+a[i-1]\r\n continue\r\nif flag:\r\n print('YES')\r\nelse:\r\n print('NO') \r\n", "a, b = input().split()\na = int(a)\nb = int(b)\nc = [int(x) for x in input().split()]\n\nx = 0\nb = b - 1\n\n\nwhile x < b:\n x += c[x]\n\nif x == b:\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, t = map(int, input().split())\r\nlst = [int(x) for x in input().split()]\r\nlst.insert(0, 0)\r\ncurrent = 1\r\ni = 1\r\n\r\nwhile i <= n:\r\n if current == t:\r\n print('YES')\r\n break\r\n i = current\r\n current += lst[i]\r\n if current > t:\r\n print('NO')\r\n break\r\n \r\n \r\n# for i in range(1, n - 1):\r\n# if current == t:\r\n# print(\"YES\")\r\n# break\r\n\r\n# current += lst[i]\r\n# if current > t:\r\n# print(\"NO\")\r\n# break\r\n\r\n", "a = input().split(\" \")\nb = input().split(\" \")\n \nline = 1\n \nwhile line < int(a[0]) and line < int(a[1]):\n line = line + int(b[line -1])\n \n \nif line != int(a[1]):\n print(\"NO\")\n \nif line == int(a[1]):\n print(\"YES\")\n \t \t\t\t \t\t \t\t\t \t\t \t\t\t", "n = list(map(int, input().split()))\r\nt = n[1]\r\nn = n[0]\r\na = list(map(int, input().split()))\r\nm = []\r\nfor i in range(1, n):\r\n m.append(i)\r\nk = 1\r\nl = set()\r\nfor i in range(n-1):\r\n if i+1 == k:\r\n l.add(i+1+a[i])\r\n k = i+1+a[i]\r\n if k >= t:\r\n break\r\n i = k - 1\r\n\r\nif t in l:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n,t=map(int,input().split())\r\na=list(map(int,input().split()))\r\ni=0\r\nk=0\r\nh=1\r\nwhile(h<=t):\r\n if(h==t):\r\n k=1\r\n print(\"YES\")\r\n break\r\n else:\r\n h=h+a[i]\r\n i=i+a[i]\r\nif(k==0):\r\n print(\"NO\")", "# -*- coding: utf-8 -*-\r\nteleport = []\r\n \r\nvalues = input().split()\r\nn_cells = int(values[0])\r\ngoal = int (values[1]) -1\r\n \r\nvalues = input().split()\r\n \r\nfor i in range(n_cells-1):\r\n num = int(values[i])\r\n teleport.append(num)\r\n \r\npos = 0\r\nwhile pos < goal:\r\n pos += teleport[pos]\r\n\r\nif pos == goal:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, t = list(map(lambda x: int(x), input().split()))\nnumbers = list(map(lambda x: int(x), input().split()))\ncurrent_pos = 1\n\nwhile True:\n if current_pos == t:\n print(\"YES\")\n break\n if current_pos > t:\n print(\"NO\")\n break\n current_pos += numbers[current_pos-1]\n\n", "# Here I just need to sum the number to see in which cell I am, if I pass the cell I can't, if I reach the cell I can\nnCells, targetCell = map(int, input().split())\ncellsPortals = list(map(int, input().split()))\nactualCell = 1\nwhile(2 == 2):\n if(actualCell > targetCell):\n print('NO')\n exit()\n if(actualCell == targetCell):\n print('YES')\n exit()\n actualCell = cellsPortals[actualCell - 1] + actualCell\n\t \t \t \t \t \t \t\t\t \t\t \t \t\t", "# Dictionary == Hash Collision\r\n\r\nfrom sys import stdin\r\nfrom bisect import bisect_left as bl, bisect_right as br\r\nfrom collections import defaultdict, Counter, deque\r\n\r\ninput = stdin.readline\r\n\r\n\r\ndef read(default=int):\r\n return list(map(default, input().strip().split()))\r\n\r\n\r\ndef solve():\r\n n, k = read()\r\n k -= 1\r\n lst = read()\r\n i = 0\r\n while i < k:\r\n i += lst[i]\r\n return [\"NO\", \"YES\"][i == k]\r\n\r\n\r\n# t = int(input())\r\nt = 1\r\nfor test in range(t):\r\n print(solve())\r\n", "# https://codeforces.com/problemset/problem/500/A\n\n\nlength, t = map(int, input().split())\na = list(map(int, input().split()))\n\nn = 1\nwhile n < t:\n n+=a[n-1]\nif n > t:\n print('No')\nelse:\n print('Yes')\n\n", "def transportation(t, a):\r\n currcell = 1\r\n while currcell < t:\r\n currcell += a[currcell - 1]\r\n return \"YES\" if currcell == t else \"NO\"\r\n\r\nn, t = map(int, input().split())\r\na = list(map(int, input().split()))\r\nprint(transportation(t, a))", "n,t=input().split(' ')\r\nn=int(n)\r\nt=int(t)\r\nsteps=input().split()\r\nfor i in range(len(steps)):\r\n steps[i]=int(steps[i])\r\n\r\njestem_w=1\r\nwhile not(jestem_w==t or jestem_w==n):\r\n krok=steps[jestem_w-1]\r\n jestem_w+=krok\r\nif(jestem_w==t):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, t = list(int(num) for num in input().split())\r\na = list(int(num) for num in input().split())\r\n\r\nlocation = 1\r\nwhile location < t:\r\n location = location + a[location - 1];\r\n\r\nif location == t:\r\n print('YES')\r\nelse:\r\n print('NO')", "n, t = map(int, input().split())\na = list(map(int, input().split()))\n\ncurrent_cell = 1\nwhile current_cell < t:\n current_cell += a[current_cell-1]\n if current_cell == t:\n print(\"YES\")\n break\nelse:\n print(\"NO\")\n \t \t \t\t\t \t\t \t \t", "\n\n\n\nn,t = map(int, input().split())\n\n\n\na= list(map(int, input().split()))\n\n\np = 1\nwhile p<t:\n p+= a[p-1]\nif p ==t:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "I=lambda:map(int,input().split())\nn,t=I()\na=*I(),\nx=0\nwhile x<t-1:x+=a[x]\nprint('YNEOS'[x>=t::2])\n \t \t\t \t\t\t \t \t\t\t \t \t\t\t \t \t\t", "\r\nn,m = map(int,input().split())\r\n\r\narr = [int(x) for x in input().split()]\r\nflag = False\r\ni = 1\r\nj = 0\r\nwhile i < m:\r\n i += arr[i - 1]\r\n\r\nprint(\"YES\" if i == m else \"NO\")", "import sys\r\nimport math\r\n\r\ninputs = []\r\nfor line in sys.stdin:\r\n inputs.append(line)\r\n\r\nresult = False\r\ngiven = inputs[0].strip().split()\r\nn = int(given[0])\r\nt = int(given[1])\r\nline = inputs[1].strip().split()\r\nfor i in range(0,n-1):\r\n line[i] = int(line[i])\r\n\r\ncurrIndex = 0\r\nj = 0\r\nwhile j < n-1:\r\n cellVal = line[j]\r\n currIndex = (j+1)+cellVal\r\n if currIndex == t:\r\n result = True\r\n break\r\n j+=cellVal\r\n\r\nprint(\"YES\") if result else print(\"NO\")", "def find_path(n, t, portals):\n stack = []\n visited = []\n\n visited.append(1)\n stack.append(1 + portals[0])\n #print('Visited: ', visited)\n #print('Stack: ', stack)\n\n while len(stack) != 0:\n current = stack.pop()\n visited.append(current)\n #print('Visited: ', visited)\n if(current == t):\n return 'YES'\n \n if(current <= len(portals)):\n stack.append(current + portals[current-1])\n\n #print('Stack: ', stack)\n \n return 'NO'\n\nflist = [int(f) for f in input().split()]\nn = flist[0]\nt = flist[1]\nportals = [int(f) for f in input().split()]\n\nprint(find_path(n, t, portals))\n \t \t\t\t\t\t \t\t \t \t \t \t \t\t \t\t\t", "n, t = map(int, input().split())\r\na = list(map(int, input().split()))\r\ncurrent_cell = 1\r\nwhile True:\r\n if current_cell == t: \r\n print(\"YES\")\r\n break\r\n elif current_cell > t:\r\n print(\"NO\")\r\n break\r\n else: \r\n current_cell += a[current_cell - 1]\r\n", "n,t=map(int,input().split())\r\na=list(map(int,input().split()))\r\ni=1\r\nx=\"NO\"\r\nwhile i<t:\r\n i=i+a[i-1]\r\n if(i==t):\r\n x=\"YES\"\r\nprint(x)\r\n\r\n", "def dfs(graph,start):\r\n visited = set()\r\n visited.add(start)\r\n stack = [start]\r\n while stack:\r\n x = stack.pop()\r\n for i in graph[x]:\r\n visited.add(i)\r\n stack.append(i)\r\n return visited\r\n\r\nn,t = map(int,input().split())\r\na = list(map(int,input().split()))\r\ng = [set() for i in range(n+1)]\r\nfor i in range(len(a)):\r\n g[i+1].add(a[i]+i+1)\r\nif t in dfs(g,1):\r\n print('YES')\r\nelse:\r\n print('NO')", "n,t=map(int,input().split())\r\na= list(map(int, input().split()))\r\na=[1]+a\r\ntarget=0\r\nans='NO'\r\ni=0\r\nwhile i<n:\r\n target=i+a[i]\r\n if target ==t:\r\n ans ='YES'\r\n break\r\n else:\r\n i = i + a[i]\r\nprint(ans)\r\n\r\n", "# Read input\r\nn, t = map(int, input().split())\r\nportals = list(map(int, input().split()))\r\n\r\n# Simulate movement through the transportation system\r\nc = 1\r\nwhile c < t:\r\n c += portals[c - 1]\r\n if c == t:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "n,total = map(int, input().split())\na = list(map(int, input().split()))\ni = 0\n\nwhile(i < total-1):\n i += a[i]\nif (i==total-1):\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\t", "n, t = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nr = 1\r\nwhile r < n:\r\n r += l[r-1]\r\n if r == t:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "import sys\r\ninp1=input()\r\ninp1=inp1.split(\" \")\r\nN=int(inp1[0])\r\nending=int(inp1[1])\r\ncells=input()\r\ncells=cells.split(\" \")\r\nstart=1\r\ni=0\r\nwhile i<N:\r\n if start>ending:\r\n print(\"NO\")\r\n sys.exit()\r\n elif start==ending:\r\n print(\"YES\")\r\n sys.exit()\r\n else:\r\n k=i+1+int(cells[i])\r\n start=k\r\n i=k-1\r\nprint(\"NO\")", "entrada=input().split()\nn=int(entrada[0])\nt=int(entrada[1])\nentrada=input().split()\ni=0\nwhile i<t-1:\n i+=int(entrada[i])\nif i==t-1:\n print(\"YES\")\nelse:\n print(\"NO\")\n \n\t\t\t \t\t\t\t \t \t \t\t \t \t\t", "n, t = (int(i) for i in input().split())\na = [int(i) for i in input().split()]\nres, i = \"NO\", 0\nwhile True:\n i += a[i]\n if i == t - 1:\n res = \"YES\"\n break\n if i == len(a):\n break\nprint(res)\n", "n,t = map(int,input().split())\r\nl = list(map(int,input().split()))\r\ni = 0\r\nf = False\r\nwhile i<n:\r\n i = i+l[i-1]\r\n if i == t:\r\n f = True\r\n break\r\nif f:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,i=map(int,input().split())\r\na=list(map(int,input().split()))\r\nj=0\r\nwhile j<i:\r\n j=j+a[j]\r\n if i==1:\r\n print('YES')\r\n elif (j+1)>i:\r\n print('NO')\r\n break\r\n elif (j+1)==i:\r\n print('YES')\r\n break\r\n", "n, t = map(int, input().split())\nc = list(map(int, input().split()))\npos = 0\n\nwhile pos < t - 1:\n pos += c[pos]\n\nif pos == t - 1:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n \t\t \t\t \t \t \t \t \t\t \t\t\t", "a, b = map(int, input().split())\r\nc = list(map(int, input().split()))\r\nd = []\r\ni = 1\r\nwhile i:\r\n if i >= a:\r\n break\r\n d.append(i + c[i-1])\r\n i = i + c[i-1]\r\nprint(\"YES\" if b in d else \"NO\")", "n, t = map(int, input().split())\nli = list(map(int, input().split()))\nl = 0\nwhile l < t-1:\n l += li[l]\nif l==t-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", "nnodes, target = map(int, input().split())\nportals = list(map(int, input().split()))\ntarget -= 1\n\ncurrent = 0\nwhile current < nnodes:\n if current > target:\n break\n if current == target:\n print(\"YES\")\n exit()\n current += portals[current]\nprint(\"NO\")\n \n\t \t \t \t \t\t \t \t\t\t\t\t\t\t \t\t", "n, t = [int(i) for i in input().split()]\r\nnums = [int(i) for i in input().split()]\r\n\r\ni = 1\r\nwhile i < t and i:\r\n i = i + nums[i-1]\r\nprint(\"YES\" if i == t else \"NO\")\r\n", "from collections import deque\nimport io, os\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\n\ndef get_input():\n return input().decode().rstrip(\"\\n\\r\")\n\n\ndef main():\n _, req = [int(x) for x in get_input().split()]\n data = [int(x) for x in get_input().split()]\n print(solve(data, req))\n\ndef solve(data: list ,req):\n ## Helper functions\n def construct_graph(data):\n return {k+1:v+k+1 for k,v in enumerate(data)}\n \n def DFS(graph, start_node, end_node):\n stack = deque()\n stack.append(start_node)\n while stack:\n cur = stack.pop()\n if cur == end_node: return True\n try: stack.append(graph[cur])\n except KeyError: return False\n\n graph = construct_graph(data)\n if DFS(graph, 1, req) == True:\n return \"YES\"\n else:\n return \"NO\"\n \nmain()", "n, t = map(int, input().split())\r\ncells = list(map(int, input().split()))\r\nvisited = dict()\r\ncells.append(0)\r\ncells.insert(0,0)\r\n\r\n\r\ndef dfs(i):\r\n stack = []\r\n stack.append(i)\r\n visited[i] = 1\r\n while stack:\r\n cur = stack.pop()\r\n j = cur + cells[cur]\r\n if j not in visited:\r\n visited[j] = 1\r\n stack.append(j)\r\n\r\n\r\n\r\n\r\ndfs(1)\r\nprint(\"YES\" if t in visited else \"NO\")\r\n", "n, t = map(int, input().split())\r\nl = [int(x) for x in input().split()]\r\nx = 0\r\nwhile x < t - 1 and l[x] != 0:\r\n x += l[x]\r\nif x == t - 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "def inlt():\r\n return(list(map(int, input().split())))\r\n \r\nn,t=inlt()\r\narr=inlt()\r\n\r\nans=\"NO\"\r\n\r\ni=0\r\n\r\nwhile i<n:\r\n if t-1<i:\r\n break\r\n if t-1==i:\r\n ans=\"YES\"\r\n break\r\n i=i+arr[i]\r\n\r\nprint(ans)\r\n ", "n, t = map(int, input().split())\n\ncells = list(map(int, input().split()))\n\nsaida = 'NO'\ncelula = 1\nwhile celula < t:\n\tcelula += cells[celula - 1]\n\tif celula == t: saida = 'YES'\n\nprint(saida)\n\n \t\t \t\t \t\t\t\t\t\t \t \t\t\t \t \t \t\t \t\t", "n, t = map(int, input().split())\r\na = input().split()\r\ni = 1\r\nwhile i < t:\r\n i = i + int(a[i - 1])\r\nif i == t:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from cmath import inf\r\nfrom re import T, X\r\nimport math\r\nfrom tkinter import N\r\n\r\n\r\ndef swap(a,b):\r\n a = a^b\r\n b = a^b\r\n a = a^b\r\n return a,b\r\n # call using a,b = swap(a,b)\r\ndef even(a):\r\n if a&1:\r\n return False\r\n return True\r\ndef gcd(x, y):\r\n while(y):\r\n x, y = y, x % y\r\n return x\r\n\r\ndef lcm(x, y):\r\n lcm = (x*y) // gcd(x,y)\r\n return lcm\r\n\r\n# it will return index of \"key\" in \"sorted list\". \r\ndef BS_elemPosi(low, high, key, li): \r\n while low<high:\r\n mid = (low+high)//2\r\n if li[mid]<=key:\r\n low = mid+1\r\n else:\r\n high = mid\r\n return low\r\n \r\n###########################(CODE)##################################\r\n# n CELLS 1,2,3,....n\r\n# a[n-1] 1...n-1\r\n# can travel from ith cell ==> i+a[i] cell \r\n# no backportal\r\n# can i go from 1-->t\r\n# Input:\r\n# n t n>=3 t>=2, t<=n\r\n# a[n-1]\r\nn,t = map(int, input().split())\r\nli = list(map(int, input().split()))\r\nf = 0\r\nx = 1\r\nwhile x<=t:\r\n # print(x)\r\n if x==t:\r\n f = 1\r\n print(\"YES\")\r\n break\r\n x+=li[x-1]\r\nif f==0:\r\n print(\"NO\")\r\n\r\n\r\n#####################################################################", "def test(n: int, t: int, a: list) -> bool:\r\n i = 0\r\n while i < n - 1:\r\n i += a[i]\r\n if i == t - 1:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\n\r\nn, t = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\nprint(test(n, t, a))\r\n", "n,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\npos=1\r\nwhile pos<t:\r\n pos+=l[pos-1]\r\nif pos==t:\r\n print('YES')\r\nelse:\r\n print('NO')", "n, t = map(int, input().split())\r\nx = list(map(int, input().split()))\r\ni = 1\r\n\r\nwhile True:\r\n if i == n:\r\n break\r\n z = i+x[i-1]\r\n i = z - 1\r\n if (z == t):\r\n print(\"YES\")\r\n break\r\n elif (i >= t):\r\n print(\"NO\")\r\n break\r\n i += 1\r\n", "def func(n,t,a):\r\n if t == 1:\r\n return \"YES\"\r\n\r\n c = 1+a[0]\r\n\r\n while c < t:\r\n c = c+a[c-1]\r\n\r\n if c == t: \r\n return \"YES\"\r\n return \"NO\"\r\n \r\ndef main():\r\n \"\"\"Run code.\"\"\"\r\n \r\n n, t = list(map(int, input().split()))\r\n\r\n a = list(map(int, input().split()))\r\n\r\n print(func(n,t,a))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n,t=list(map(int,input().split()))\r\narr=list(map(int,input().split()))\r\nc=0\r\nflag=0\r\npath=1\r\nwhile c<n:\r\n path+=arr[c]\r\n c=path-1\r\n if path==t:\r\n flag=1\r\n break\r\n elif path>t:\r\n break\r\n else:\r\n continue\r\nif flag==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "\na, b = list(map(int, input().split(' ')))\nport_int = list(map(int, input().split(' ')))\n\nvisited = set()\ncurrentIndex = 1\nwhile True:\n visited.add(currentIndex)\n if currentIndex == a:\n break\n currentIndex = currentIndex + port_int[currentIndex - 1]\n\n\nif b in visited:\n print('YES')\nelse:\n print('NO')\n\n\n", "a,b = map(int,input().split())\r\ny = list(map(int,input().split()))\r\nc= 0\r\nwhile c<a-1:\r\n c = c+y[c]\r\n if c==b-1:\r\n print(\"YES\")\r\n break\r\n else:\r\n pass\r\nelse:\r\n print(\"NO\")", "n , t = map(int, input().split())\r\ndat = list(map(int, input().split()))\r\ndat = [0] + dat\r\ni = 1\r\nwhile i < t:\r\n i = i + dat[i]\r\n if i == t:\r\n bool = \"YES\"\r\n if i > t: bool = \"NO\"\r\nprint(bool)\r\n", "#nums = list(map(int, input().split()))\r\n\r\n# from collections import defaultdict,deque\r\n\r\nn,target =map(int,input().split())\r\nnums = list(map(int, input().split()))\r\n\r\ncanReach = False\r\ncurrent = 1\r\n\r\n\r\nwhile current <= target:\r\n current += nums[current-1]\r\n if current == target :\r\n canReach = True\r\n break\r\n \r\n \r\nif canReach:\r\n print('YES')\r\nelse:\r\n print('NO')", "l = input().split()\r\nn = int(l[0])\r\nt = int(l[1])\r\n\r\nl1 = input().split()\r\nfor i in range(len(l1)):\r\n l1[i] = int(l1[i])\r\n\r\npos = 1\r\nwhile pos<=n:\r\n if pos ==t:\r\n print(\"YES\")\r\n break\r\n elif pos>t:\r\n print(\"NO\")\r\n break\r\n pos=pos+l1[pos-1]\r\n\r\n\r\n\r\n \r\n", "n,t = (input().split())\r\nn=int(n)\r\nt=int(t)\r\n\r\na = input().split()\r\nl=1\r\nbreaker=0\r\nwhile l<t:\r\n l=l+int(a[l-1])\r\nif l==t:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, t = list(map(int, input().split()))\r\nnums = list(map(int, input().split()))\r\ncurr = 1\r\nwhile curr < t:\r\n curr += nums[curr - 1]\r\nif curr == t:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,t = map(int, input().split())\r\ns = list(map(int, input().split()))\r\nl = 0\r\ni = 0\r\nif n==t:\r\n while i != n:\r\n if i + 1 == t:\r\n print('YES')\r\n l = 1\r\n break\r\n if i + 1 != t:\r\n i += s[i]\r\nelse:\r\n while i + 1 != n:\r\n if i + 1 == t:\r\n print('YES')\r\n l = 1\r\n break\r\n if i + 1 != t:\r\n i += s[i]\r\nif l == 0:\r\n print('NO')\r\n", "n, t = tuple(int(i) for i in input().split())\r\nt -= 1\r\nnumbers = tuple(int(i) for i in input().split())\r\nflag = True\r\ni = 0\r\n\r\nwhile flag and i < n:\r\n i += numbers[i]\r\n if i >= t:\r\n flag = False\r\n \r\nprint(('NO', 'YES')[i == t])", "n, t = map(int, input().split())\na = list(map(int, input().split()))\n\nq = 1\nwhile q < t:\n q = q + a[q - 1]\n\nif q == t:\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, m = map(int, input().split())\r\nA = list(map(int, input().split()))\r\n\r\n# Initialize a list to store the positions that can be reached from each cell\r\nreachable = [0] * n\r\nreachable[0] = 1\r\n\r\n# Fill in the reachable list\r\nfor i in range(n - 1):\r\n if reachable[i] == 1:\r\n j = i + A[i]\r\n if j < n:\r\n reachable[j] = 1\r\n\r\nif reachable[m - 1] == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "# https://codeforces.com/problemset/problem/500/A\r\n\r\nn, t = map(int, input().split())\r\nseq = tuple(map(int, input().split()))\r\n\r\ncnt = 1\r\nwhile cnt < t:\r\n cnt += seq[cnt - 1]\r\n \r\nif cnt == t:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nf={}\r\nfor i in range(n-1):\r\n if i not in f:\r\n f[i] = set()\r\n f[i].add(a[i]+i)\r\n if i not in f:\r\n f[i]=[]\r\nf[n-1]=[]\r\nlev=[-1]*n\r\n#print(f)\r\ndef bfs(k1):\r\n lev[k1] = 0\r\n q = [k1]\r\n while q:\r\n v = q.pop(0)\r\n for w in f[v]:\r\n if lev[w] == -1:\r\n lev[w] = lev[v] + 1\r\n q.append(w)\r\nbfs(0)\r\n#print(lev)\r\nprint(\"YES\") if lev[m-1]!=-1 else print(\"NO\")", "def main() -> None :\r\n _, TARGET_INDEX = map(int, input().split())\r\n ARRAY:list[int] = list(map(int, input().split()))\r\n\r\n isGoTargetIndex:bool = False\r\n isVisited:list[bool] = [False] * len(ARRAY)\r\n currentIndex:int = 1\r\n isVisited[currentIndex-1] = True\r\n while True :\r\n currentIndex = ARRAY[currentIndex-1] + currentIndex\r\n if currentIndex == TARGET_INDEX :\r\n isGoTargetIndex = True\r\n break\r\n\r\n if not (1 <= currentIndex <= len(isVisited)) : break\r\n if isVisited[currentIndex-1] : break\r\n isVisited[currentIndex-1] = True\r\n\r\n print([\"NO\", \"YES\"][isGoTargetIndex])\r\n \r\nmain()", "# 500A\r\nnt = str(input()).split()\r\nn = int(nt[0])\r\nt = int(nt[1])\r\na = str(input()).split()\r\n\r\nc = 1\r\ntmp = []\r\nfor i in a:\r\n tmp.append(int(i))\r\n\r\ncan = [1]\r\nwhile c < n:\r\n c+=tmp[c-1]\r\n can.append(c)\r\n \r\nif t in can: print(\"YES\")\r\nelse: print(\"NO\")", "n, t = map(int,input().split())\r\nconnect = {}\r\nfor i in range(1,n+1):\r\n connect[i] = 0\r\ni = 1\r\nfor a in list(map(int,input().split())):\r\n connect[i] = i + a\r\n i += 1\r\nans = 0\r\nii = 1\r\nwhile ii:\r\n ii = connect[ii]\r\n if ii == t:\r\n ans = 1\r\n break\r\nprint([\"NO\",\"YES\"][ans])\r\n", "n, t = map(int, input().split())\nportals = list(map(int, input().split()))\nportals = [0] + portals\n\np = 1\n\nwhile p <= t:\n\tif p == t:\n\t\tprint(\"YES\")\n\t\tbreak\n\tp = p + portals[p]\t\n\nif p != t:\n\tprint(\"NO\")\n\t \t \t \t\t \t\t \t \t\t\t \t \t \t \t", "controles = list(map(int, input().split()))\nfinal = [1]\nlista = list(map(int, input().split()))\nsoma = 1\nwhile soma <= controles[0]:\n \n if lista[soma-1] + soma < controles[0]:\n final.append(lista[soma-1] + soma)\n soma = lista[soma-1] + soma\n elif lista[soma-1] + soma > controles[0]:\n break\n elif lista[soma-1] + soma == controles[0]:\n final.append(lista[soma-1] + soma)\n soma = lista[soma-1] + soma\n break\nif controles[1] not in final:\n print(\"NO\")\nelse:\n print(\"YES\")\n\n\n\n \t \t\t \t \t \t \t \t\t\t \t \t \t \t\t", "\r\nMII = lambda: map(int, input().split())\r\nLMII = lambda: list(MII())\r\n\r\nn, t = MII()\r\na = [0] + LMII()\r\n\r\ni = 1\r\nwhile i < t:\r\n i += a[i]\r\n \r\nprint('YES' if i == t else 'NO')\r\n\r\n", "from sys import stdin\r\ninp = stdin.readline\r\n\r\nn, t = map(int, inp().split())\r\narr = [int(x) for x in inp().split()]\r\ndone = 0\r\ni = 0\r\n\r\nwhile True:\r\n i += arr[i]\r\n if i + 1 == t:\r\n done = 1\r\n break\r\n elif i + 1 > t or i + 1 >= n:\r\n break\r\n\r\nprint([\"NO\", \"YES\"][done])\r\n\r\n", "a=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\n\r\ni=0\r\nwhile i < a[1]-1:\r\n\ti+=b[i]\r\nif i==(a[1]-1):\r\n\tprint (\"YES\")\r\nelse:\r\n\tprint( \"NO\")", "n,t=[int(i) for i in input().split()]\r\nl=list(map(int,input().split()))\r\nt-=1\r\ncurr=0\r\nwhile(curr<t):\r\n curr+=l[curr]\r\n\r\nprint(\"YES\") if(t==curr) else print(\"NO\")\r\n", "def f():\n n, t = map(int, input().split())\n nums = [0] + [int(c) for c in input().split()]\n cur = 1\n while cur < t:\n cur += nums[cur]\n if cur == t:\n return \"YES\"\n return \"NO\"\n\n\nprint(f())\n", "n, t = map(int, input().split())\nt -= 1\n\na = list(map(int, input().split()))\n\nvisited = [False for i in range(n)]\n\nstack = [0]\nvisited[0] = True\n\nwhile stack:\n\tb = stack[-1]\n\tstack.pop()\n\tif b < n - 1:\n\t\tnextb = b + a[b]\n\t\tif not visited[nextb]:\n\t\t\tvisited[nextb] = True\n\t\t\tstack.append(nextb)\n\nprint(\"YES\" if visited[t] else \"NO\")\n\n", "n,t=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nf=1\r\ni=0\r\nwhile f<t:\r\n f+=a[i]\r\n i=f-1\r\nif f==t:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "n, b = map(int,input().split())\r\nli = list(map(int, input().split()))\r\n\r\nc = 1\r\nwhile c < b:\r\n c = c + li[c-1]\r\n \r\nif c == b:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "p=lambda:list(map(int,input().split()))\r\nn,t=p();a=p(); i=1\r\nwhile i<t : i+=a[i-1]\r\nprint(\"YNEOS\"[i>t::2])", "class Graph:\n def __init__(self, V):\n\n self.V = V\n self.graph = {}\n\n for i in range(1, V+1):\n self.graph[i] = []\n\n def __str__(self):\n return str(self.graph)\n\n def addEdge(self, u, v):\n self.graph[u].append(v)\n\n def DFS(self, v):\n visited = set()\n stack = [v]\n visited.add(v)\n\n while stack:\n current = stack[-1]\n stack.pop()\n\n for neighbour in self.graph[current]:\n if neighbour not in visited:\n stack.append(neighbour)\n visited.add(neighbour)\n return visited\n\nif __name__ == \"__main__\":\n n, t = list(map(int, input().split()))\n\n g = Graph(n)\n\n portals = list(map(int, input().split()))\n\n for i in range(1, n):\n g.addEdge(i, i+portals[i-1])\n\n vis = g.DFS(1)\n\n if t in vis:\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,b = map(int,input().split())\r\nlest = list(map(int,input().split()))\r\nans = []\r\ns = 1\r\nwhile s < a :\r\n ans.append(s+lest[s-1])\r\n s+=lest[s-1]\r\nprint(\"YES\" if b == 1 or b in ans else \"NO\")", "n, t = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nc = 1\r\nwhile c < t:\r\n c += a[c - 1]\r\n\r\nif c == t:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "n,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=1\r\nans=\"NO\"\r\nwhile c!=n:\r\n c+=l[c-1]\r\n if c==t:\r\n ans=\"YES\"\r\n break\r\nprint(ans)", "n,t=map(int,input().split())\r\nl=input().split()\r\ntemp=1\r\nl=[int(i) for i in l]\r\nwhile(temp!=t):\r\n k=l[temp-1]+temp\r\n if k==t:\r\n print(\"YES\")\r\n exit()\r\n elif k>t:\r\n break\r\n else:\r\n temp=k\r\n\r\nprint(\"NO\")", "C,T=map(int,input().split())\nP=list(map(int,input().split()))\nS=1\nwhile S<C:\n S+=P[S-1]\n if S==T:print(\"YES\");exit(0)\nprint(\"NO\")\n", "n , t = map(int,input().split())\r\na = list(map(int,input().split()))\r\nm = 1\r\nwhile True :\r\n if m < t :\r\n m+=a[m-1]\r\n elif m == t :\r\n print(\"YES\")\r\n break\r\n else :\r\n print(\"NO\")\r\n break", "n, t = map(int, input().split())\r\na = list(map(int, input().split()))\r\nt -= 1\r\nx = 0\r\nwhile x < n-1 and x != t:\r\n x += a[x]\r\n\r\nif x == t:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n", "n, t = [int(e) for e in input().split()]\r\nstations = [int(e) for e in input().split()]\r\n\r\nt -= 1\r\nnow = 0\r\n\r\nwhile now < t:\r\n now += stations[now]\r\n\r\nif now == t:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "#──────▄▀▄─────▄▀▄\r\n#─────▄█░░▀▀▀▀▀░░█▄\r\n#─▄▄──█░░░░░░░░░░░█──▄▄\r\n#█▄▄█─█░░▀░░┬░░▀░░█─█▄▄█\r\nn,z = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nm = []\r\nfor i in range(n-1):\r\n m.append(i+l[i])\r\nbeen = [False]*n\r\nfrom collections import deque\r\nd = deque()\r\nd.append(m[0])\r\nbeen[0] = True\r\nwhile len(d) != 0:\r\n a = d.popleft()\r\n if been[a] == False:\r\n been[a] = True\r\n if a == n-1:\r\n pass\r\n else:\r\n d.append(m[a])\r\nif been[z-1]:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n", "n, t = map(int, input().split())\r\na = list(map(int, input().split()))\r\ncur = 1\r\nwhile cur < t:\r\n cur += a[cur - 1]\r\nif cur == t:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import math\r\nimport sys\r\n\r\n# s,n=map(int,input().split())\r\n# t=True\r\n\r\n# for m in range(int(input())):\r\n# n=int(input()) \r\n# s=input() \r\nn,k=map(int,input().split()) \r\n# ar=[a,b]\r\narr=list(map(int,input().split()))\r\nans=0\r\nwhile(ans<k-1):\r\n ans+=arr[ans]\r\nif(ans==k-1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") ", "n, t = map(int, input().split())\r\n\r\ndata = input().split()\r\n\r\ni = 1\r\nc = 0\r\nwhile i <= n-1:\r\n i += int(data[i-1])\r\n if i > t:\r\n print('NO')\r\n break\r\n if i == t:\r\n print('YES')\r\n c += 1\r\n break\r\n", "from collections import deque\r\nn, t = map(int, input().split())\r\nportal = list(map(int, input().split()))\r\nochrd = deque()\r\nochrd.append(1 + portal[0])\r\nprm = ochrd.popleft()\r\n\r\nwhile prm <= t:\r\n if prm == t:\r\n print ('YES')\r\n break\r\n ochrd.append(prm + portal[prm - 1])\r\n prm = ochrd.popleft()\r\nelse:\r\n print ('NO')\r\n ", "from sys import stdin\n\ndef main():\n\n n,t = [int(x) for x in stdin.readline().split()]\n c = [int(x) for x in stdin.readline().split()]\n\n p = 0\n\n while(p < (t - 1)):\n p += c[p]\n\n if(p == (t - 1)):\n print(\"YES\")\n else:\n print(\"NO\")\n\n\nmain()\n\t\t \t \t \t \t \t \t \t\t\t\t", "n, t = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\ni=0\r\nis_result_found = False\r\nwhile(i<t):\r\n if i < len(arr): \r\n i += arr[i]\r\n if i == t-1:\r\n print('YES')\r\n is_result_found = True\r\n break\r\nif is_result_found == False:\r\n print('NO')", "n,t=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\ni=1\r\nwhile i<t:\r\n i+=a[i-1]\r\nif i==t:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n ", "import sys\r\nfrom collections import Counter, defaultdict\r\n\r\ninput = lambda: sys.stdin.buffer.readline().decode().strip()\r\ninl = lambda: list(map(int, input().split()))\r\n\r\nn, t = inl()\r\na = inl()\r\n\r\nc = 0\r\nans = \"NO\"\r\nwhile c < t - 1:\r\n c = c + a[c]\r\n if c == t - 1:\r\n ans = \"YES\"\r\n\r\nprint(ans)\r\n", "n,m = map(int, input().split())\na = list(map(int, input().split()))\ni = 1\nwhile i<n and i!=m:\n i += a[i-1]\nif i == m :\n print('YES')\nelse :\n print('NO')\n \t\t\t \t\t \t\t \t\t \t\t \t \t", "n, t=map(int, input().split())\r\na=list(map(int,input().split()))\r\npos=1\r\nfor i in range(n-1):\r\n\tpos+=a[pos-1]\r\n\tif pos==t:\r\n\t\tprint(\"YES\")\r\n\t\tbreak\r\n\tif pos > t:\r\n\t\tprint(\"NO\")\r\n\t\tbreak", "import sys\r\nimport math\r\n\r\n\r\nn, t = map(int, input().split())\r\na = list(map(int, input().split()))\r\ncurrentPos = 1\r\nreach = 'NO'\r\nwhile (currentPos < n):\r\n currentPos = currentPos + a[currentPos-1]\r\n if currentPos == t: \r\n reach = 'YES'\r\n break\r\n\r\nprint(reach)", "a,b=map(int,input().split())\r\nc=list(map(int,input().split()))\r\nk=1\r\nt=0\r\ni=0\r\nwhile(i<a-1):\r\n k+=c[i]\r\n if(k==b):\r\n print('YES')\r\n t=11\r\n break\r\n elif(k>b):\r\n break\r\n i=k-1\r\nif(t==0):\r\n print('NO')\r\n", "m,s=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nx=1\r\nans='NO'\r\nwhile True:\r\n\tx+=l[x-1]\r\n\tif x==s:\r\n\t\tans='YES'\r\n\t\tbreak\r\n\telif x>s-1:\r\n\t\tbreak\r\nprint(ans)", "n, t = map(int, input().split())\r\na = list(map(int, input().split()))\r\nk = 1\r\nx = 'YES'\r\ni = 0\r\nwhile k != t:\r\n k = i + 1 + a[i]\r\n i = k - 1\r\n if k > t:\r\n x = 'NO'\r\n break\r\nprint(x)\r\n\r\n", "p=lambda:list(map(int,input().split()))\r\nN,T=p();a=p();n=1\r\nwhile n<T:n+=a[n-1]\r\nprint(\"YNEOS\"[n!=T::2])", "\r\nn=input().split(\" \")\r\nsum=0\r\nj=0\r\na=input().split(\" \")\r\nwhile sum<int(n[1])-1 :\r\n sum+=int(a[sum])\r\nif sum==int(n[1])-1 :\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")\r\n", "n,m = list(map(int,input().split()))\r\narr = list(map(int,input().split()))\r\ni = 1\r\nans = 0\r\nwhile(i<=m):\r\n\tif i==m:\r\n\t\tans=1\r\n\t\tprint('YES')\r\n\t# i+=arr[i]\r\n\t\tbreak\r\n\ti+=arr[i-1]\r\n\r\nif ans==0:\r\n\tprint('NO')\r\n# else:\r\n# \tprint('YES')", "def solve():\n n, t = map(int, input().strip().split())\n a = list(map(int, input().strip().split()))\n a.append(1)\n t -= 1\n currentPosition = 0\n while currentPosition < n:\n if currentPosition == t:\n print('YES')\n return\n else:\n currentPosition += a[currentPosition]\n print('NO')\nsolve()\n", "# 38 New Year Transportation\r\n\r\nn, t = map(int, input().split())\r\nls = list(map(int, input().split()))\r\n\r\nans = []\r\nj = 1\r\n\r\nwhile j < n:\r\n j += ls[j - 1]\r\n ans.append(j)\r\nprint('YES' if t in ans else 'NO')\r\n", "n,t=[int(x) for x in input().split()]\r\na=[int(x) for x in input().split()]\r\npos=1\r\nres='NO'\r\nwhile pos<t:\r\n pos+=a[pos-1]\r\n if pos==t:\r\n res='YES'\r\n break\r\nprint(res)", "n,t=map(int,input().split())\r\na=list(map(int,input().split()))\r\nk=1\r\nwhile k<t:\r\n k+=a[k-1]\r\nif k==t:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,t = map(int,input().split())\r\na = list(map(int,input().split()))\r\ni = 1\r\nwhile i < t :\r\n\ti += a[i-1]\r\nif i == t:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "def reach_cell(n, t, nums):\r\n curr = 1\r\n while curr < t:\r\n curr += nums[curr - 1]\r\n \r\n return \"YES\" if curr == t else \"NO\"\r\n \r\n\r\nn, t = map(int, input().split())\r\nnums = list(map(int, input().split()))\r\n \r\nprint(reach_cell(n, t, nums))", "n, t = [int(x) for x in input().split()]\r\nportal = [int(x) for x in input().split()]\r\ntransport = []\r\nfor i in range(1, n):\r\n transport.append(i+portal[i-1])\r\nif t not in transport:\r\n print(\"NO\")\r\n quit()\r\ntemp = 1\r\nwhile True:\r\n if temp == t:\r\n print(\"YES\")\r\n quit()\r\n elif temp > t:\r\n print(\"NO\")\r\n quit()\r\n else:\r\n temp = transport[temp-1]", "n, t = map(int, input().split())\r\n\r\na_arr = list(map(int, input().split()))\r\n\r\ncell = 1\r\n\r\nwhile (cell < t):\r\n cell = a_arr[cell-1] + cell\r\n\r\nprint(\"YES\" if cell == t else \"NO\") ", "if __name__ == '__main__':\r\n n, t = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n\r\n pq = [1]\r\n\r\n while len(pq) > 0:\r\n current = pq.pop()\r\n if current > t:\r\n continue\r\n if current == t:\r\n print(\"YES\")\r\n exit()\r\n pq.append(current + a[current - 1])\r\n print(\"NO\")", "a, b = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\nd = 0\r\nb = b-1\r\nwhile d < a:\r\n d += c[d]\r\n if d == b:\r\n print(\"YES\")\r\n break\r\n elif d > b:\r\n print(\"NO\")\r\n break\r\n\r\n", "n, objetivo = map(int, input().split(\" \"))\r\nsalas = list(map(int, input().split(\" \")))\r\n\r\nposicionActual = 1\r\nwhile posicionActual < n and posicionActual != objetivo:\r\n posicionActual = (posicionActual + salas[posicionActual - 1])\r\nprint(\"YES\" if posicionActual == objetivo else \"NO\")", "n, m = map(int, input(). split())\r\na = list(map(int, input(). split()))\r\nans = 1\r\nwhile True:\r\n if m >= ans:\r\n ans += a[ans - 1]\r\n if ans == m:\r\n print('YES')\r\n break\r\n if ans > m:\r\n print('NO')\r\n break\r\n", "def main():\r\n n, t = [int(x) for x in input().split(\" \")]\r\n a = [int(x) for x in input().split(\" \")]\r\n a.append(1)\r\n \r\n curr = 0\r\n while curr < n:\r\n curr = curr + a[curr]\r\n if curr == t - 1:\r\n print(\"YES\")\r\n return\r\n\r\n print(\"NO\")\r\n\r\nmain()\r\n", "n,t=map(int,input().split())\na=list(map(int,input().split()))\nj=1\nwhile j<t:\n j+=a[j-1]\nif j==t:\n print(\"YES\")\nelse:\n print(\"NO\")\n\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", "cells = input().split()\na_is = input().split()\ncollection = []\ninitial = 1\nwhile initial < int(cells[0]):\n current = int(a_is[initial-1]) + initial\n if current == int(cells[1]):\n print('YES')\n break\n elif current > int(cells[1]):\n print('NO')\n break\n else:\n initial = current\n", "n, t = [int(x) for x in input().split()]\ncells = [int(x) for x in input().split()]\n\nres = \"NO\"\ni = 1\nwhile i < t:\n i += cells[i-1]\n if i == t:\n res = \"YES\"\nprint(res)\n", "n, target = [int(thing) for thing in input().split()]\r\nportals = [int(thing) for thing in input().split()]\r\ncount = 0\r\nwhile count < target - 1:\r\n count = portals[count] + count\r\nif count == target-1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, t = list(map(int, input().split()))\r\npath = list(map(int, input().split()))\r\n\r\nposition = 1 \r\n\r\nwhile position < t: \r\n position += path[position - 1] \r\n\r\nif position == t:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "if __name__ == '__main__':\n lst = list(map(int,input().strip().split()))[:2]\n n = lst[0]\n t = lst[1]\n\n lst = list(map(int,input().strip().split()))[:n-1]\n lst.reverse()\n lst.append(0)\n lst.reverse()\n\n cur = 1\n goal = t\n checkgoal = False\n while cur < t:\n cur = lst[cur] + cur\n if cur == t:\n checkgoal = True\n break\n\n if checkgoal == True:\n print(\"YES\")\n else:\n print(\"NO\")", "def main():\n\tn, t = [int(x) for x in input().split()]\n\ta = [int(x) for x in input().split()]\n\n\tvisited = set()\n\tstart = 0\n\tt = t -1\n\tres = False\n\twhile True:\n\t\tvisited.add(start)\n\t\tif start == t:\n\t\t\tres = True\n\t\t\tbreak\n\t\tif start >= (n-1) or (start + a[start]) in visited:\n\t\t\tres = False\n\t\t\tbreak\n\t\tstart = start + a[start]\t\n\tprint(\"YES\" if res else \"NO\")\n\nmain()\n\n", "n,t = [int(x) for x in input().split()]\r\ntemp = [int(x) for x in input().split()]\r\n\r\n\r\ncur = 0\r\nwhile cur+1 < t:\r\n cur += temp[cur]\r\n\r\nif cur+1 == t:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "a,b = map(int,input().split())\r\nlis = list(map(int,input().split()))\r\nr = [0]\r\nfor i in lis:\r\n r.append(i)\r\nx = 1\r\nwhile(x<b):\r\n x+=r[x]\r\nif x == b:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, t = map(int, input().split())\r\ncells = list(map(int, input().split()))\r\ni = 0\r\nfound = False\r\nwhile i <= t - 1:\r\n if i == t - 1:\r\n found = True\r\n break\r\n i += cells[i]\r\nif found:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,t = map(int,input().split())\r\nc = [int(x) for x in input().split()]\r\np = 0\r\nwhile(p < t - 1):p += c[p]\r\nprint(\"YES\" if p == t-1 else \"NO\")", "n,t=map(int,input().split())\r\na=[int(i) for i in input().split()]\r\ni=0\r\nwhile i<t-1:\r\n i+=a[i]\r\nif i+1==t:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "import sys\r\ndef print(a):\r\n sys.stdout.write(str(a)+'\\n')\r\ndef input():\r\n return sys.stdin.readline().strip()\r\n#main\r\na,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=1\r\ni=1\r\nwhile c<a:\r\n c=c+l[c-1]\r\n if c==b:\r\n print(\"YES\")\r\n exit(0)\r\n if c>b:\r\n break\r\nprint(\"NO\")", "# import sys\r\n# sys.stdin= (open('input.txt','r'))\r\n# sys.stdout = (open('output.txt','w'))\r\n\r\nn,t = map(int,input().split())\r\narr = list(map(int,input().split()))\r\npos = 0 \r\nwhile(pos< t) :\r\n nxt = pos + arr[pos-1] \r\n pos = nxt\r\nprint(\"YES\") if pos==t else print(\"NO\")\r\n\r\n", "\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\nw = list(map(int, input().split()))\r\na = 1\r\nfor i in range(n-1):\r\n if i+1 == a:\r\n a += w[i]\r\n if m == a:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "n,t=map(int,input().split())\r\na=list(map(int,input().split()))\r\ni=1\r\nwhile i<t:\r\n i += a[i-1]\r\nif i == t :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# Miguel Arriaga y Karla Mondragón\n\nn, t = map(int, input().split())\na = list(map(int, input().split()))\n\ncurrent_pos = 1\nwhile current_pos < t:\n current_pos += a[current_pos-1]\n if current_pos == t:\n print(\"YES\")\n break\nelse:\n print(\"NO\")\n\n \t \t \t \t \t \t\t\t \t\t \t \t \t", "n, t = map(int, input().split())\r\nc = list(map(int, input().split()))\r\np = 0\r\n\r\nwhile p < t - 1:\r\n p += c[p]\r\n\r\nif p == t - 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n,t=map(int,input().strip().split())\r\nli=list(map(int,input().strip().split()))\r\n\r\npos=1\r\nwhile pos<t:\r\n nex=pos+li[pos-1]\r\n pos=nex\r\nif pos==t:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "n, t = map(int, input().split())\r\nnums = list(map(int, input().split()))\r\n#print(nums)\r\ninitial = 1\r\nfound = 0\r\n\r\nwhile initial < t:\r\n initial += nums[initial-1]\r\n #print(initial)\r\n if initial == t:\r\n print(\"YES\")\r\n found = 1\r\n break\r\nif found == 0:\r\n print(\"NO\")", "def solve():\r\n n, t = map(int, input().split())\r\n arr = list(map(int, input().split()))\r\n\r\n cell = 1 # currently standing\r\n while cell < n:\r\n cell += arr[cell-1]\r\n if cell == t:\r\n print(\"YES\")\r\n return\r\n print(\"NO\")\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()", "#sol\nn, t = map(int,input().split())\ncells = list(map(int,input().split()))\nsee=0\nout = 'NO'\nwhile True:\n if see > t -1:\n break\n if see== t-1:\n out = 'YES'\n break\n see += cells[see]\nprint(out)\n \t\t\t \t\t\t \t\t \t\t \t \t\t", "n, t = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\ncurrent_cell = 1\r\nwhile current_cell < t:\r\n current_cell += a[current_cell - 1]\r\n\r\nif current_cell == t:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n, t = map(int,input().split())\r\narr = list(map(int,input().split()))\r\ni = 0\r\nwhile i<t-1:\r\n i += arr[i]\r\n \r\nprint(\"YES\" if i==t-1 else \"NO\")\r\n" ]

[ "x, y = map(int, input().split())\r\nif ((x == y) or ((x == 2) and (y == 4)) or ((x == 4) and (y == 2))) : print('=')\r\nelse :\r\n if (((x == 2) and (y == 3)) or (x == 1)) : print('<')\r\n else :\r\n if (((x == 3) and (y == 2)) or (y == 1)) : print('>')\r\n else :\r\n if (x < y) : print('>')\r\n else :\r\n if (x > y) : print('<')", "from math import log\r\nx, y = map(int, input().split())\r\nif(x == 1):\r\n if(y == 1):\r\n print('=')\r\n else:\r\n print('<')\r\n exit()\r\nif(y / x < log(y) / log(x)):\r\n print('<')\r\nelif(y / x > log(y) / log(x)):\r\n print('>')\r\nelse:\r\n print('=')", "import math\na,b = map(int, input().split())\nx = a * (math.log(b)); \ny = b * (math.log(a));\nif y > x:\n print(\">\")\nelif x > y:\n print(\"<\")\nelif x == y:\n print(\"=\")\n\t \t\t \t \t \t \t\t\t \t \t\t \t \t\t\t", "import math\n\nlistt = [ int(x) for x in input().split()]\nx = listt[0]\ny = listt[1]\nx1 = y*math.log(x)\ny1 = x*math.log(y)\nif abs( x1 - y1 ) < 1e-11 :\n print(\"=\")\nelif x1 - y1 < 0 :\n print(\"<\")\nelif y1 - x1 < 0 :\n print(\">\")\n\t\t\t \t\t \t\t\t\t\t\t \t \t \t", "import math\r\n\r\nx,y = map(int,input().split())\r\na = math.log(x)\r\nb = math.log(y)\r\nif y*a > x*b :\r\n\tprint(\">\")\r\nelif y*a < x*b :\r\n\tprint(\"<\")\r\nelse : print(\"=\")", "import math\r\n\r\nx, y = map(int, input().split())\r\n\r\na = math.log(x)/x\r\nb = math.log(y)/y\r\n\r\nif (a>b):\r\n print('>')\r\nelif(a<b):\r\n print('<')\r\nelse:\r\n print('=') \r\n\r\n\r\n", "a,b = map(int,input().split())\r\nimport math as m\r\nc,d = b*m.log(a),a*m.log(b)\r\nif c<d:print(\"<\")\r\nelif c>d:print(\">\")\r\nelse:print(\"=\")", "params = list(map(int,list(input().split())))\nx, y = params[0],params[1]\nif x == y:\n print('=')\nelif x == 1:\n print('<')\nelif y == 1:\n print('>')\nelif x + y == 6:\n print('=')\nelif x + y < 6:\n if x**y < y**x:\n print('<')\n else:\n print('>')\nelse:\n if x > y:\n print('<')\n else:\n print('>')\n\t \t \t \t \t \t \t\t\t\t\t \t \t \t\t \t\t\t", "from math import log\r\nn,m=map(int,input().split())\r\nc=m*log(n);d=n*log(m)\r\nif c<d:print('<')\r\nelif c>d:print('>')\r\nelse:print('=')\r\n", "n,m=map(int,input().split())\r\nflag=0\r\nif n==m or n==2 and m==4 or m==2 and n==4:\r\n print('=')\r\nelif n==2 and m==3:\r\n print('<')\r\nelif n==3 and m==2:\r\n print('>')\r\nelif n==1 or m==1:\r\n if n==1:\r\n print('<')\r\n else:\r\n print('>')\r\nelse:\r\n if m>n:\r\n print('>')\r\n else:\r\n print('<')\r\n ", "from math import log10\r\n\r\ndef solve():\r\n (x, y) = map(int, input().split())\r\n\r\n X = eval('y*log10(x) - x*log10(y)')\r\n\r\n if X > 0:\r\n return '>'\r\n elif X < 0:\r\n return '<'\r\n else:\r\n return '='\r\n\r\n return \"42069\"\r\n\r\n\r\nt = 1\r\nfor _ in range(t):\r\n print(solve())", "from sys import stdin,stdout\r\nfrom math import log2\r\nnmbr=lambda:int(stdin.readline())\r\nlst=lambda:list(map(int,stdin.readline().split()))\r\nfor _ in range(1):#nmbr()):\r\n x,y=lst()\r\n ylx=y*log2(x)\r\n xly=x*log2(y)\r\n if ylx>xly:print('>')\r\n elif ylx<xly:print('<')\r\n else:print('=')", "a,b=map(int,input().split())\r\nimport math\r\ns1=b*math.log(a)\r\ns2=a*math.log(b)\r\n\r\nif s1<s2:\r\n print(\"<\")\r\nelif s1>s2:\r\n print(\">\")\r\nelse:\r\n print(\"=\")", "x, y = map(int, input().split())\r\nxp, yp = x, y\r\nwhile xp / 2 > 10 or yp / 2 > 10:\r\n xp /= 2\r\n yp /= 2\r\n \r\nif x**yp > y**xp:\r\n print('>')\r\nelif x**yp < y**xp:\r\n print('<')\r\nelse:\r\n print('=')\r\n ", "from math import log\r\nx, y = input().split(' ')\r\nx = int(x)\r\ny = int(y)\r\nif y*log(x) > x*log(y):\r\n print('>')\r\nelif y*log(x) < x*log(y):\r\n print('<')\r\nelse:\r\n print('=')", "from math import log\r\n\r\ndef compare(x, y):\r\n if x==y:\r\n return '='\r\n elif x==1:\r\n return '<'\r\n elif y==1:\r\n return '>'\r\n else:\r\n a=y/x\r\n b=log(y)/log(x)\r\n if a==b:\r\n return '='\r\n elif a<b:\r\n return '<'\r\n else:\r\n return '>'\r\n\r\nx, y = tuple(map(int, input().split(' ')))\r\nprint(compare(x,y))", "import math\na, b = map(int, input().split())\nif a * math.log2(b) < b * math.log2(a):\n print('>')\n pass\nelif a * math.log2(b) == b * math.log2(a):\n print('=')\n pass\nelse :\n print('<')\n pass\n\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\nif b*math.log(a)>a*math.log(b):\r\n print(\">\")\r\nelif b*math.log(a)<a*math.log(b):\r\n print(\"<\")\r\nelse:\r\n print(\"=\")", "import math\r\nx,y=map(lambda x:math.log(int(x))/int(x),input().split())\r\nprint('<=>'[(x>=y)+(x>y)])", "import math\nx, y = list(map(int, input().split()))\nleft = y * math.log(x)\nright = x * math.log(y)\nif abs(left -right ) < 1e-8:\n print('=')\nelif left < right:\n print('<')\n\nelse:\n print('>')\n\n \t\t \t \t \t \t\t \t \t\t \t\t \t\t\t\t", "x, y = map(int,input().split())\r\nfrom math import log2\r\nif (x,y)==(2,4) or (x,y)==(4,2) or x == y:\r\n print('=')\r\nelif y * log2(x) > x * log2(y):\r\n print('>')\r\nelse:\r\n print('<')\r\n", "import sys\r\ninpu = sys.stdin.readline\r\nprin = sys.stdout.write\r\nfrom math import log\r\nx, y = map(int, inpu().split())\r\nif x == 1 or y == 1:\r\n x, y = x**y, y**x\r\nelse :\r\n x, y = y, x*log(y, x)\r\nif x > y :\r\n prin(\">\\n\")\r\nelif x < y :\r\n prin(\"<\\n\")\r\nelse :\r\n prin(\"=\\n\")", "a,b = map(int,input().split())\r\nfrom math import log\r\nx,y=b*log(a),a*log(b)\r\nprint('<'if x<y else '>'if x>y else '=')", "from math import log\r\n\r\nx,y=list(map(int,input().split()))\r\n\r\nres_x=y*log(x)\r\nres_y=x*log(y)\r\n\r\nif res_x>res_y:\r\n print('>')\r\nelif res_x<res_y:\r\n print('<')\r\n\r\nelse:\r\n print('=')", "from math import log2\r\ni,j=map(int,input().split())\r\nx=j*log2(i)\r\ny=i*log2(j)\r\n\r\nif x>y:\r\n print('>')\r\nelif x<y:\r\n print('<')\r\nelse:\r\n print('=')\r\n \r\n", "from math import log\r\nx, y = map(int, input().split(\" \"))\r\n\r\ntmp1 = y * log(x)\r\ntmp2 = x * log(y)\r\nif tmp1 > tmp2:\r\n print('>')\r\nelif tmp1 < tmp2:\r\n print('<')\r\nelse:\r\n print('=')", "import math\n\ni = input().split()\nx,y = int(i[0]), int(i[1])\nxey = y*math.log(x)\nyex = x*math.log(y)\n\nif(xey == yex): print(\"=\")\nelif(xey<yex): print(\"<\")\nelse: print(\">\")", "#For fast I/O\r\nimport sys\r\ninput = lambda: sys.stdin.readline().strip()\r\n\r\nHomura = [int(i) for i in input().split()]\r\nx = Homura[0]\r\ny = Homura[1]\r\n\r\ndef compare(a,b):\r\n\tif a < b:\r\n\t\tprint('<')\r\n\telif a == b:\r\n\t\tprint('=')\r\n\telif a > b:\r\n\t\tprint('>')\r\n\r\nif min(x,y) > 2:\r\n\tcompare (y,x)\r\nelif min(x,y) == 1:\r\n\tcompare(x,y)\r\nelif max(x,y) > 4:\r\n\tcompare(y,x)\r\nelse:\r\n\tcompare(x**y,y**x)\r\n", "import math\r\nx,y = map(int, input().split())\r\na = y * math.log(x)\r\nb = x * math.log(y)\r\nif abs(a-b) < 1e-9:\r\n print('=')\r\nelse:\r\n print('<' if a < b else '>')", "from math import log\n\nentrada = input()\nentrada_float = list(map(float, entrada.split(\" \")))\n\na = entrada_float[0]\nb = entrada_float[1]\n\nx = b * log(a, 10)\ny = a * log(b, 10)\n\nif x == y:\n print(\"=\")\nelif x < y:\n print(\"<\")\nelse:\n print(\">\")\n \t \t\t \t\t\t\t \t \t \t \t \t", "from math import log\r\n\r\na, b = map(int, input().split())\r\n\r\ny = a * log(b)\r\nx = b * log(a)\r\nprint(\">\" if (x > y) else \"<\" if (x < y) else \"=\")", "xx=str(input())\r\nxx=(xx.split(\" \"))\r\nfor i in range(0,2):\r\n xx[i]=int(xx[i])\r\nx=xx[0]\r\ny=xx[1]\r\nif x == y or ( x==2 and y==4) or (x== 4 and y == 2):\r\n print(\"=\")\r\n exit()\r\nif x > y and x>=5:\r\n if y == 1:\r\n print(\">\")\r\n else:\r\n print(\"<\")\r\n exit()\r\nif x < y and y>=5:\r\n if x == 1 :\r\n print(\"<\")\r\n else:\r\n print(\">\")\r\n exit()\r\nif x==3:\r\n print(\">\")\r\nif y==3:\r\n print(\"<\")\r\nif x==1:\r\n print(\"<\")\r\nif y==1:\r\n print(\">\")\r\n", "import math\r\nx,y=map(int,input().split())\r\nif(x==y):\r\n print(\"=\")\r\nelif(x==1 or y==1):\r\n if(x>y):\r\n print(\">\")\r\n elif(x<y):\r\n print(\"<\")\r\n else:\r\n print(\"=\")\r\nelse:\r\n if(y/x)>((math.log(y))/(math.log(x))):\r\n print(\">\")\r\n elif(y/x)<((math.log(y))/(math.log(x))):\r\n print(\"<\")\r\n else:\r\n print(\"=\")", "import math\r\n\r\nx, y = map(int, input().split())\r\nx, y = y*math.log(x), x*math.log(y)\r\nif x>y:\r\n\tprint('>')\r\nelif x<y:\r\n\tprint('<')\r\nelse:\r\n\tprint('=')", "import math\nx,y = map(int, input().split())\n\nn1 = y*math.log(x)\nn2 = x*math.log(y)\n\nif abs(n1-n2) < 1e-8:\n print(\"=\")\nelif n1 < n2:\n print(\"<\")\nelse:\n print(\">\")\n", "from math import *;a,b=map(int,input().split());c=b*log(a);d=a*log(b);print(\"=\" if c==d else \">\" if c>d else \"<\")", "from math import log\r\nx,y = map(int,input().split())\r\np = y*log(x)\r\nq = x*log(y)\r\nif p>q:\r\n print(\">\")\r\nelif p<q:\r\n print(\"<\")\r\nelse:\r\n print(\"=\")", "import math\r\ndef _input(): return map(int, input().split())\r\n\r\nx, y = _input()\r\nprint( '>' if y*math.log(x) > x*math.log(y) else '<' if y*math.log(x) < x*math.log(y) else '=') \r\n ", "import math\nx, y = map(int, input().split())\nx1 = math.log(x) * y\nx2 = math.log(y) * x\n\nif x1 > x2:\n\tprint(\">\")\nelif x1 < x2:\n\tprint(\"<\")\nelse:\n\tprint(\"=\")\n \t\t\t\t \t\t\t\t \t \t \t \t \t \t\t\t", "from math import log\r\nx,y=map(int,input().split())\r\nif x==y or(x==2 and y==4) or (y==2 and x==4):\r\n print('=')\r\nelse:\r\n u,v=y*log(x),x*log(y)\r\n if u>v:\r\n print('>')\r\n else:\r\n print('<')\r\n", "def main():\r\n\tx, y = map(int, input().split())\r\n\tif x == y:\r\n\t\tprint('=')\r\n\t\treturn\r\n\tif x == 1:\r\n\t\tprint('<')\r\n\t\treturn\r\n\tif y == 1:\r\n\t\tprint('>')\r\n\t\treturn\r\n\tif x + y == 6:\r\n\t\tprint('=')\r\n\t\treturn\r\n\tif x == 3:\r\n\t\tprint('>')\r\n\t\treturn\r\n\tif y == 3:\r\n\t\tprint('<')\r\n\t\treturn\r\n\tif x < y:\r\n\t\tprint('>')\r\n\telse:\r\n\t\tprint('<')\r\n \r\nmain()\r\n", "import math\r\nx,y=[int(x) for x in input().split(' ')]\r\na=y*math.log(x)\r\nb=x*math.log(y)\r\nif (abs(a-b)< 1e-8):\r\n print(\"=\")\r\nelif (a<b):\r\n print(\"<\")\r\nelse:\r\n print(\">\")\r\n \r\n", "x,y=map(int,input().split())\r\nif(x==y or (x==2 and y==4) or (x==4 and y==2)):\r\n print(\"=\")\r\nelif(x==1 or (x==2 and y==3)):\r\n print(\"<\")\r\nelif(y==1 or (x==3 and y==2)):\r\n print(\">\")\r\nelif(x<y):\r\n print(\">\")\r\nelse:\r\n print(\"<\")", "def main_function():\r\n x, y = [int(i) for i in input().split(\" \")]\r\n if x == y:\r\n print(\"=\")\r\n else:\r\n if x < y:\r\n if x == 1:\r\n print(\"<\")\r\n elif x == 2 and y == 3:\r\n print(\"<\")\r\n elif x == 2 and y == 4:\r\n print(\"=\")\r\n else:\r\n print(\">\")\r\n else:\r\n if y == 1:\r\n print(\">\")\r\n elif y == 2 and x == 3:\r\n print(\">\")\r\n elif y == 2 and x == 4:\r\n print(\"=\")\r\n else:\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\n\r\n\r\n\r\nmain_function()", "from math import *\r\nx,y=map(int,input().split())\r\nxx=log(x)*y\r\nyy=log(y)*x\r\nif(xx>yy):\r\n print(\">\")\r\nelif(xx<yy):\r\n print(\"<\")\r\nelse:\r\n print('=')\r\n", "import math as mm\nx, y = map(int, input().split(\" \"))\na = y * mm.log(x)\nb = x * mm.log(y)\nif a > b:\n print(\">\")\nelif b > a:\n print(\"<\")\nelse:\n print(\"=\")\n", "import math\r\nx, y = map(int, input().split())\r\nif x==y:\r\n print(\"=\")\r\nelif x==1:\r\n print(\"<\")\r\nelif y==1:\r\n print(\">\")\r\nelse:\r\n xy = y*math.log(x)\r\n yx = x*math.log(y)\r\n if (xy < yx):\r\n print(\"<\")\r\n elif (xy>yx):\r\n print(\">\")\r\n else:\r\n print(\"=\")\r\n", "import math\r\nx,y=map(int, input().split())\r\nif (x*math.log(y)==y*math.log(x)):\r\n print('=')\r\nelif x*math.log(y)>y*math.log(x):\r\n print('<')\r\nelse:\r\n print('>')", "import math\r\na,b=map(int,input().split())\r\nX=b*math.log(a)\r\nY=a*math.log(b)\r\nif X>Y:\r\n print(\">\")\r\nelif X<Y:\r\n print(\"<\")\r\nelse:\r\n print(\"=\")", "import sys\r\nfrom math import*\r\ninput=sys.stdin.buffer.readline\r\n\r\nx,y=map(int,input().split())\r\nv1=y*(log(x))\r\nv2=x*(log(y))\r\nif v1<v2:\r\n\tprint(\"<\")\r\nelif v1>v2:\r\n\tprint(\">\")\r\nelse:\r\n\tprint(\"=\")", "import math\r\na, b = map(int, input().split())\r\nl_x = b * math.log(a,10)\r\nl_y = a * math.log(b,10)\r\n\r\nif abs(l_x-l_y) == 0:\r\n print(\"=\")\r\nelif l_x > l_y:\r\n print(\">\")\r\nelse:\r\n print(\"<\")", "from math import log2\r\nx,y = map(int, input().split())\r\na = y * log2(x)\r\nb = x * log2(y)\r\nprint('=' if a == b else '>' if a > b else '<')", "import math\r\nx,y=map(int,input().split())\r\nc=y*math.log(x)\r\nd=x*math.log(y)\r\nif c>d:\r\n print(\">\")\r\nelif c<d:\r\n print(\"<\")\r\nelse:\r\n print(\"=\")\r\n \r\n", "import math\r\nx,y = map(int,input().split())\r\n\r\na = y * math.log(x)\r\nb = x * math.log(y)\r\n\r\nif abs(a-b)<1e-8:\r\n print('=')\r\nelif a<b:\r\n print('<')\r\nelse:\r\n print('>')", "# import sys \r\n# sys.stdin = open('input.txt', 'r') \r\n# sys.stdout = open('output.txt', 'w')\r\nimport math\r\n# import re\r\ngg=\"abcdefghijklmnopqrstuvwxyz\"\r\n# a=ord('a')\r\n# print(chr(a), end=\"\")\r\n#sys.setrecursionlimit(int(1e6))\r\n# n, m = map(int, input().split())\r\n# graph = [[] for i in range(n)]\r\n# for i in range(m):\r\n# \ta,b = map(int, input().split())\r\n# \tgraph[a-1].append(b-1)\r\n# \tgraph[b-1].append(a-1)\r\n\r\n# def dfs(node, count, visited):\r\n# \tvisited[node] = 1\r\n# \tcount[0]+=1\r\n# \tfor i in graph[node]:\r\n# \t\tif not visited[i]:\r\n# \t\t\tdfs(i, count, visited)\r\n\r\n\r\n# visited = [0]*n\r\n# t = 0\r\n# node = None\r\n# for i in range(n):\r\n# \tif not visited[i]:\r\n# \t\tcount = [0]\r\n# \t\tdfs(i, count, visited)\r\n# \t\tif t<count[0]:\r\n# \t\t\tt = max(t, count[0])\r\n# \t\t\tnode = i\r\n# visited = [0]*n\r\n# e = [0]\r\n# dfs(node, e, visited)\r\n# print(t)\r\n# print(*visited)\r\nn,m=map(int,input().split())\r\n# a=math.pow(n,m)\r\na=m*math.log(n)\r\n# b=math.pow(m,n)\r\nb=n*math.log(m)\r\n\r\n# print(a,b)\r\nif(a>b):\r\n\tprint(\">\")\r\nif(a==b):\r\n\tprint(\"=\")\r\nif(a<b):\r\n\tprint(\"<\")", "def haha(x,y):\r\n if(x==y):\r\n return \"=\"\r\n elif(x==2 and y==3):\r\n return \"<\"\r\n elif(x==3 and y==2):\r\n return \">\"\r\n elif(x==2 and y==4):\r\n return \"=\"\r\n elif(x==4 and y==2):\r\n return \"=\"\r\n elif(x==1):\r\n return \"<\"\r\n elif(y==1):\r\n return \">\"\r\n elif(x>y):\r\n return \"<\"\r\n else:\r\n return \">\"\r\n \r\n\r\na,b=map(int,input().split())\r\nt=haha(a,b)\r\nprint(t)", "a, b = map(int, input().split())\r\nfrom math import log\r\nx, y = b*log(a), a*log(b)\r\nprint('<' if x<y else '>' if x>y else '=')", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nx, y = map(int, input().split())\r\nif max(x, y) <= 8:\r\n if pow(x, y) < pow(y, x):\r\n ans = \"<\"\r\n elif pow(x, y) > pow(y, x):\r\n ans = \">\"\r\n else:\r\n ans = \"=\"\r\nelse:\r\n if x < y:\r\n ans = \">\" if x ^ 1 else \"<\"\r\n elif x > y:\r\n ans = \"<\" if y ^ 1 else \">\"\r\n else:\r\n ans = \"=\"\r\nprint(ans)", "import math\r\nx, y = input().split(' ')\r\nx, y = int(x), int(y)\r\nif x*math.log10(y)<y*math.log10(x):\r\n print('>')\r\nelif x*math.log10(y)==y*math.log10(x):\r\n print('=')\r\nelse:\r\n print('<')", "import math\r\nx,y=map(int,input().split())\r\nlx=math.log(x)\r\nly=math.log(y)\r\nif lx*y>ly*x:\r\n print(\">\")\r\nelif lx*y<ly*x:\r\n print(\"<\")\r\nelse:\r\n print(\"=\")", "import math\r\nx,y=map(int,input().split())\r\na=y*math.log(x)\r\nb=x*math.log(y)\r\nif a>b:\r\n print(\">\")\r\nelif a<b:\r\n print(\"<\")\r\nelse:\r\n print(\"=\")\r\n ", "import math\n\naux = input().split(\" \")\nx = int(aux[0])\ny = int(aux[1])\n\nif x == y:\n print(\"=\")\nelse:\n x2 = y * math.log(x)\n y2 = x * math.log(y)\n if(x2 == y2):\n print(\"=\")\n elif(x2 > y2):\n print(\">\")\n else:\n print(\"<\")\n \t \t \t\t\t\t \t \t\t\t \t\t\t \t\t", "import math\r\nx,y = map(int, input().strip().split(' '))\r\nif math.log(x)/x > math.log(y)/y:\r\n print('>')\r\nelif math.log(x)/x < math.log(y)/y:\r\n print('<')\r\nelse:\r\n print('=')\r\n \r\n#p = list(map(int, input().strip().split(' ')))\r\n", "# author: violist\n# created: 06.03.2022 20:59:46\n\nimport sys\nfrom math import log\ninput = sys.stdin.readline\n\nx, y = map(int, input().split())\na = y * log(x)\nb = x * log(y)\nif (a == b):\n print(\"=\")\nelif (a < b):\n print(\"<\")\nelse:\n print(\">\")\n", "import math\r\nx, y = map(int, input().split())\r\nc1 = y * math.log(x)\r\nc2 = x * math.log(y)\r\nif c1<c2:\r\n print(\"<\")\r\nelif c1==c2:\r\n print(\"=\")\r\nelse:\r\n print(\">\")", "import math\r\n \r\nx,y=map(int,input().split())\r\na=math.log(x)/x\r\nb=math.log(y)/y\r\nif a>b:\r\n print(\">\")\r\nelif a<b:\r\n print(\"<\")\r\nelse:\r\n print(\"=\")", "from math import log\nx,y = map(int,input().split())\np = y*log(x)\nq = x*log(y)\nif p>q:\n print(\">\")\nelif p<q:\n print(\"<\")\nelse:\n print(\"=\")\n\t \t \t\t\t \t \t \t \t\t \t \t \t\t\t\t", "import sys, math\r\n\r\nn, m = map(int, sys.stdin.readline().split())\r\nif m * math.log2(n) > n * math.log2(m):\r\n print('>')\r\nelif m * math.log2(n) < n * math.log2(m):\r\n print('<')\r\nelse:\r\n print('=')", "import math\r\n \r\nx , y = map ( int , input (). split ())\r\na = y * math . log ( x )\r\nb = x * math . log ( y )\r\nif abs ( a - b ) < 1e-8 : \r\n\tprint ( '=' )\r\nelif a < b :\r\n\tprint ( '<' )\r\nelse :\r\n\tprint ( '>' )", "import math ,sys\r\nx,y=map(int,input().split())\r\nif y==1:\r\n if x==1:\r\n print('=')\r\n else:\r\n print('>')\r\n sys.exit()\r\nans=(y*math.log(x,y))/x\r\nif ans>1:\r\n print('>')\r\nelif ans==1:\r\n print('=')\r\nelse:\r\n print('<')", "import math as M\r\nx,y=map(int,input().split())\r\na=M.log(x)*y\r\nb=M.log(y)*x\r\nprint('>' if a>b else ('<' if a<b else '='))", "from math import log\r\n\r\nX = list(map(int, input().split()))\r\nX[0], X[1] = X[1] * log(X[0]), X[0] * log(X[1])\r\nprint(\"<\" if X[1] > X[0] else (\"=\" if X[1] == X[0] else \">\"))\r\n", "import math\r\nx, y = map(int, input().split())\r\na = y*math.log(x)\r\nb = x*math.log(y)\r\nif abs(a-b) < 1e-8:\r\n print('=')\r\nelif a<b:\r\n print('<')\r\nelse:\r\n print('>')", "def akash(a,b):\r\n res=1\r\n while b>0:\r\n if b&1:\r\n res*=a\r\n a=a*a\r\n b>>=1\r\n return res\r\nimport math\r\na,b=list(map(int,input().split()))\r\nx=b*math.log(a) \r\ny=a*math.log(b)\r\nif x>y:\r\n print(\">\")\r\nelif x==y:\r\n print(\"=\")\r\nelse:\r\n print(\"<\")\r\n", "import math\r\nl=input().split()\r\nx=int(l[0])\r\ny=int(l[1])\r\na=math.log(x)/x\r\nb=math.log(y)/y\r\nif a>b:\r\n\tprint(\">\")\r\nelif a<b:\r\n\tprint(\"<\")\r\nelse:\r\n\tprint(\"=\")\r\n", "from math import log\r\n\r\nx,y = map(int,input().split())\r\n\r\na = y*log(x)-x*log(y)\r\n\r\nif a<0:\r\n\tprint(\"<\")\r\nelif a>0:\r\n\tprint(\">\")\r\nelse:\r\n\tprint(\"=\")", "def f(l):\r\n g = lambda x: 1/x if x>2 else [0,1/4][x-1]\r\n r = list(map(g,l))\r\n if r[0]>r[1]:\r\n return '>'\r\n if r[0]<r[1]:\r\n return '<'\r\n return '='\r\n\r\nl = list(map(int,input().split()))\r\nprint(f(l))\r\n", "x, y = list(map(int, input().split()))\r\n\r\nif x == y:\r\n print('=')\r\nelif min(x, y) == 1:\r\n if x > y:\r\n print(\">\")\r\n else:\r\n print(\"<\")\r\nelif min(x, y) == 2:\r\n if max(x, y) == 3:\r\n if x == 2:\r\n print(\"<\")\r\n else:\r\n print(\">\")\r\n elif max(x, y) == 4:\r\n print(\"=\")\r\n else:\r\n if x == 2:\r\n print(\">\")\r\n else:\r\n print(\"<\")\r\nelse:\r\n if x == min(x, y):\r\n print(\">\")\r\n else:\r\n print(\"<\")\r\n\r\n", "import math\r\nx, y = map(int, input().split())\r\nif y*math.log(x) > x*math.log(y):\r\n print(\">\")\r\nelif y*math.log(x) < x*math.log(y):\r\n print(\"<\")\r\nelif y*math.log(x) == x*math.log(y):\r\n print(\"=\")\r\n", "from math import log\r\nx,y=map(int,input().split())\r\na,b=y*log(x), x*log(y)\r\nprint('=' if a==b else '<' if a<b else '>')", "import math\n\nentrada = input().split()\nx = int(entrada[0])\ny = int(entrada[1])\n\nn = 0; m = 0; i = 0; j = 0; k = 0;\n\nif x == y:\n print(\"=\")\nelse:\n\n a = y * math.log10(x)\n b = x * math.log10(y)\n\n if a == b:\n print(\"=\")\n elif a > b:\n print(\">\")\n else:\n print(\"<\")\n \t \t \t \t\t \t\t\t \t \t \t \t \t\t\t\t", "import math\r\ntry:\r\n x,y = map(int, input().split())\r\n z = y*(math.log(x))\r\n w = x*(math.log(y))\r\n if w>z:\r\n print(\"<\")\r\n elif w == z:\r\n print(\"=\")\r\n else:\r\n print(\">\")\r\nexcept:\r\n pass", "from math import log\r\n\r\nx,y = map(int, input().split())\r\nans1 = y*log(x)\r\nans2 = x*log(y)\r\nif ans1 == ans2:\r\n print('=')\r\nelif ans1 < ans2:\r\n print('<')\r\nelse:\r\n print('>')", "import math\r\nx,y=map(int,input().split())\r\n#a,b=x**y,y**x\r\nif x==1 and y==1:\r\n print('=')\r\nelif x==1:\r\n print(\"<\")\r\nelif y==1:\r\n print(\">\")\r\nelif [2,4]==sorted([x,y]):\r\n print(\"=\")\r\nelif x==2 and y==3:\r\n print(\"<\")\r\nelif x==3 and y==2:\r\n print(\">\")\r\nelse:\r\n if x==y:\r\n print(\"=\")\r\n elif x>y:\r\n print(\"<\")\r\n elif x<y:\r\n print(\">\")", "import math\r\n\r\n\r\ndef main():\r\n x, y = get_list_int()\r\n\r\n ylogx = y * math.log(x)\r\n xlogy = x * math.log(y)\r\n\r\n if ylogx > xlogy:\r\n print(\">\")\r\n elif ylogx < xlogy:\r\n print(\"<\")\r\n else:\r\n print(\"=\")\r\n\r\n\r\ndef get_int() -> int:\r\n return int(input())\r\n\r\n\r\ndef get_list_int() -> list[int]:\r\n return [int(x) for x in input().split(\" \")]\r\n\r\n\r\ndef get_list_str() -> list[str]:\r\n return input().split(\" \")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "from math import log\r\n\r\nx, y = a = list(map(int, input().split()))\r\n\r\nb = x * log(y)\r\na = y * log(x)\r\n\r\nif a < b:\r\n print('<')\r\nelif a > b:\r\n print('>')\r\nelse:\r\n print('=')", "from sys import stdin, stdout\r\nfrom math import log\r\n\r\nx, y = list(map(int,stdin.readline().split(' ')))\r\nif y*log(x) < x*log(y):\r\n stdout.write('<')\r\nelif y*log(x) > x*log(y):\r\n stdout.write('>')\r\nelse:\r\n stdout.write('=')", "from math import log\na,b=map(int,input().split())\nx=b*log(a)\ny=a*log(b)\nif x==y:\n print('=')\nelif x>y:\n print('>')\nelse:\n print('<')\n\n \t \t \t \t \t \t \t\t \t \t \t \t\t \t", "from math import *\r\nx, y=map(int,input().split())\r\na=y*log(x)\r\nb=x*log(y)\r\nif(a<b):\r\n print('<')\r\nelif(a>b):\r\n print('>')\r\nelse:\r\n print('=')", "from math import log10\r\n\r\nxy = list(map(int,input().split()))\r\nx = xy[0]\r\ny = xy[1]\r\n\r\nxlog = y*log10(x)\r\nylog = x*log10(y)\r\n\r\nif(xlog > ylog):\r\n print(\">\")\r\n\r\nelif(xlog < ylog):\r\n print(\"<\")\r\n\r\nelse :\r\n print(\"=\")", "import math\r\na,b=map(int,input().split())\r\nc=b*math.log(a)\r\nd=a*math.log(b)\r\nif(c>d):\r\n print(\">\")\r\nelif c<d:\r\n print(\"<\")\r\nelse:\r\n print(\"=\")", "s = input().split()\r\nx, y = int(s[0]), int(s[1])\r\n\r\nflp = False\r\nif x > y:\r\n x, y = y, x\r\n flp = True\r\n\r\nif x == y:\r\n print('=')\r\nelif x == 1:\r\n if flp:\r\n print('>')\r\n else:\r\n print('<')\r\nelif x == 2:\r\n if y == 4:\r\n print('=')\r\n elif y == 3:\r\n if flp:\r\n print('>')\r\n else:\r\n print('<')\r\n else:\r\n if not flp:\r\n print('>')\r\n else:\r\n print('<')\r\nelse:\r\n if not flp:\r\n print('>')\r\n else:\r\n print('<')\r\n", "x,y = list(map(int,input().split()))\r\nimport math\r\np = math.log2(x)\r\nq = math.log2(y)\r\nif p*y<q*x:\r\n print('<')\r\nelif p*y>q*x:\r\n print('>')\r\nelse:\r\n print('=')\r\n", "import math\r\na,b=input().split()\r\na,b = int(a), int(b)\r\nla, lb = math.log(a), math.log(b)\r\nif a*lb==b*la:\r\n print('=')\r\nelif a*lb>b*la:\r\n print('<')\r\nelse:\r\n print('>')", "# cook your dish here\r\nimport math\r\nx , y = map(int,input().split()) \r\n\r\nv1 = y*math.log(x,10) \r\nv2 = x*math.log(y,10)\r\n\r\nif(v1 < v2):\r\n print(\"<\")\r\nelif(v1 > v2):\r\n print(\">\")\r\nelse:\r\n print(\"=\")\r\n\r\n", "import math\r\nx,y = list(map(int,input().split()))\r\na = y*(math.log(x,10))\r\nb = x*(math.log(y,10))\r\nif a==b:\r\n\tprint('=')\r\nelif a>b:\r\n\tprint('>')\r\nelse:\r\n\tprint('<')", "import math\r\nx,y=input().split()\r\nx,y=int(x),int(y)\r\na=y*(math.log(x))\r\nb=x*(math.log(y))\r\nif a>b:\r\n print('>')\r\nelif a<b:\r\n print('<')\r\nelse:\r\n print('=')\r\n", "import math\r\nx, y = [ int(i) for i in input().strip().split(' ')]\r\nx = math.log2(x)/x\r\ny = math.log2(y)/y\r\nif x<y:\r\n\tprint('<')\r\nelif x==y:\r\n\tprint('=')\r\nelse:\r\n\tprint('>')", "import math\r\nfrom bisect import bisect_left, bisect_right\r\n\r\nInf = int(1e18) + 7\r\n\r\ndef tuple_input(type):\r\n return map(type, input().strip().split())\r\n\r\ndef prime_fact(x):\r\n res = list()\r\n d = 2\r\n while d * d <= x:\r\n if x % d == 0: \r\n r = 0\r\n while x % d == 0: \r\n x /= d\r\n r += 1\r\n res.append([d, r])\r\n d += 1\r\n if x > 1:\r\n res.append([x, 1])\r\n return res\r\n\r\nx, y = map(int, input().strip().split())\r\n\r\nfx = prime_fact(x)\r\nfy = prime_fact(y)\r\nfor e in fx:\r\n e[1] *= y\r\nfor e in fy:\r\n e[1] *= x\r\nif fx == fy:\r\n print('=')\r\n exit(0)\r\n\r\nxy = y * math.log(x)\r\nyx = x * math.log(y)\r\nif xy < yx:\r\n print('<')\r\nelse:\r\n print('>')", "import math\r\nx,y=map(int,input().split())\r\na=math.log(x)*y\r\nb=math.log(y)*x\r\nif a>b:\r\n\tprint('>')\r\nelif a<b:\r\n\tprint('<')\r\nelse:\r\n\tprint('=')\r\n", "import math\r\n\r\na,b = input().split()\r\na = int(a)\r\nb = int(b)\r\nif (math.log(a)/a) == (math.log(b)/b):\r\n print(\"=\")\r\nelif (math.log(a)/a) > (math.log(b)/b):\r\n print(\">\")\r\nelse:\r\n print(\"<\")", "x, y = map(int, input().split())\r\nif x == y:\r\n print('=')\r\nelif x > y:\r\n if y > x ** (y/x):\r\n print('<')\r\n elif y < x ** (y/x):\r\n print('>')\r\n else:\r\n print('=')\r\nelse:\r\n if x > y ** (x/y):\r\n print('>')\r\n elif x < y ** (x/y):\r\n print('<')\r\n else:\r\n print('=')", "import math\nx, y = map(int, input().split())\nif x == 1 and y != 1:\n print('<')\nelif x == 1 and y == 1:\n print('=')\nelif y / x > math.log(y, x):\n print('>')\nelif y / x < math.log(y, x):\n print('<')\nelse:\n print('=')\n", "from sys import *\r\nfrom math import *\r\nfrom bisect import *\r\na,b=map(int,stdin.readline().split())\r\nx=b*log(a)\r\ny=a*log(b)\r\nif x>y:\r\n print(\">\")\r\nelif x<y:\r\n print(\"<\")\r\nelse:\r\n print(\"=\")", "import math\r\na,b=map(int,input().split())\r\nif(a==b):\r\n print('=')\r\nelse:\r\n x=b*(math.log(a))\r\n y=a*(math.log(b))\r\n if(x==y):\r\n print('=')\r\n elif(x>y):\r\n print('>')\r\n else:\r\n print('<')", "import math\nx, y = (float(x) for x in input().split())\n\nxval = math.log(x)/x\nyval = math.log(y)/y\nif x == y:\n print(\"=\")\nelif xval == yval:\n print(\"=\")\nelif xval > yval:\n print(\">\")\nelif xval < yval:\n print(\"<\")\n\n", "import sys\r\nfrom math import log\r\n\r\ndef input(): return sys.stdin.readline().strip()\r\ndef list2d(a, b, c): return [[c] * b for i in range(a)]\r\ndef list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]\r\ndef list4d(a, b, c, d, e): return [[[[e] * d for k in range(c)] for j in range(b)] for i in range(a)]\r\ndef ceil(x, y=1): return int(-(-x // y))\r\ndef INT(): return int(input())\r\ndef MAP(): return map(int, input().split())\r\ndef LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]\r\ndef Yes(): print('Yes')\r\ndef No(): print('No')\r\ndef YES(): print('YES')\r\ndef NO(): print('NO')\r\nINF = 10**18\r\nMOD = 10**9 + 7\r\nEPS = 10**-10\r\n\r\nx, y = MAP()\r\n\r\nxy = log(x)*y\r\nyx = log(y)*x\r\nif xy < yx-EPS:\r\n print('<')\r\nelif xy-EPS > yx:\r\n print('>')\r\nelse:\r\n print('=')\r\n", "from math import log\n\nx, y = map(int, input().split())\nif log(y)*x == log(x)*y:\n print('=')\nelse:\n print('<' if log(y)*x > log(x)*y else '>')\n", "from math import log \r\nx,y = map(int,input().split())\r\na = y*log(x)\r\nb = x*log(y)\r\nif a==b:\r\n print(\"=\")\r\nelif a>b:\r\n print(\">\")\r\nelse:\r\n print(\"<\")", "# https://codeforces.com/contest/987/problem/B\n\nfrom math import log\nx,y = map(int, input().split())\n\na,b = y*log(x), x*log(y)\n\nprint('>' if a>b else '<' if a<b else '=')", "import math\r\n\r\n\r\nx,y = map(int,input().split())\r\nif x==y:\r\n print('=')\r\nelif (x==2 and y==4) or (y==2 and x==4):\r\n print('=')\r\nelif x==1 and y!=1:\r\n print('<')\r\nelif y==1 and x!=1:\r\n print('>') \r\nelse:\r\n if x/math.log(x) - y/math.log(y) >0:\r\n print('<')\r\n elif x/math.log(x) - y/math.log(y)<0:\r\n print('>')\r\n else:\r\n print('=')\r\n \r\n\r\n ", "from math import log\r\nx,y=map(int,input().split())\r\nn1=log(x)/x\r\nn2=log(y)/y\r\nif(n1==n2):\r\n print(\"=\")\r\nelif(n1<n2):\r\n print(\"<\")\r\nelse:\r\n print(\">\")", "import math\r\n\r\nx , y = tuple(map(int,input().split()))\r\n\r\nleft = y * math.log(x)\r\nright = x * math.log(y)\r\n\r\nif left < right :\r\n print(\"<\")\r\nelif left > right :\r\n print(\">\")\r\nelse:\r\n print(\"=\")", "from math import log\r\nx,y=map(int,input().split())\r\na,b=x*log(y),y*log(x)\r\nprint('<'if a>b else'>'if a<b else'=')", "from math import log\r\nx, y = map(int, input().strip().split(\" \"))\r\n\r\nc, d = y*log(x), x*log(y)\r\n# print(c, d)\r\nif c < d:print(\"<\")\r\nelif c > d:print(\">\")\r\nelse:print(\"=\")\r\n ", "import math\nx, y = map(int, input().split())\nif min(x, y) == 1:\n if x > y:\n t = 1.1\n elif x == y:\n t = 1\n else:\n t = 0.9\nelse:\n t = (y / x) * (math.log10(x) / math.log10(y))\nif t < 1:\n print(\"<\")\nelif t == 1:\n print(\"=\")\nelse:\n print(\">\")", "\r\nx,y = map(int,input().split())\r\n\r\n\r\n\r\nfrom math import log\r\n\r\n\r\n\r\nt = y*log(x)\r\ny = x*log(y)\r\n\r\n\r\nif t>y:\r\n print('>')\r\nelif y>t:\r\n print('<')\r\nelse:\r\n print('=')", "x, y = map(int, input().split())\r\nif x == y:\r\n print('=')\r\n exit()\r\n\r\nif max(x, y) == 2:\r\n if x < y:\r\n print('<')\r\n else:\r\n print('>')\r\nelse:\r\n if min(x, y) <= 2 and max(x, y) > 2:\r\n if min(x, y) == 1:\r\n if x < y:\r\n print('<')\r\n else:\r\n print('>')\r\n else:\r\n if min(x, y) == 2 and max(x,y) == 3:\r\n if x < y:\r\n print('<')\r\n else:\r\n print('>')\r\n elif min(x, y) == 2 and max(x,y) == 4:\r\n print('=')\r\n else:\r\n if x < y:\r\n print('>')\r\n else:\r\n print('<')\r\n else:\r\n if x < y:\r\n print('>')\r\n else:\r\n print('<')\r\n", "from math import log\nxy=input()\nxy=xy.split()\nx=int(xy[0])\ny=int(xy[1])\nx1=log(x)/x\ny1=log(y)/y\nif x1==y1:\n print(\"=\")\nelif x1>y1:\n print(\">\")\nelse:\n print(\"<\")", "import sys \r\nfrom math import log\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\nx,y = map(int,input().split())\r\na = (y/x)\r\nif log(x):b = (log(y)/log(x))\r\nelif log(y)==0:b=1\r\nelse: b=10**100\r\nif a>b:print('>')\r\nelif a<b:print('<')\r\nelse:print('=')", "import math\r\nx, y = map(int, input().split())\r\na = math.log(x, math.e)/x\r\nb = math.log(y, math.e)/y\r\nif a>b:\r\n print('>')\r\nelif a<b:\r\n print('<')\r\nelse:\r\n print('=')", "import math\r\nx,y = list(map(int,input().split()))\r\nif x*math.log(y)>y*math.log(x):\r\n print(\"<\")\r\nelif x*math.log(y)==y*math.log(x):\r\n print(\"=\")\r\nelse:\r\n print(\">\")", "x,y=map(int,input().split())\r\nif x==1 and y==1:\r\n print(\"=\")\r\nelif x==1 and y>1:\r\n print(\"<\")\r\nelif x>1 and y==1:\r\n print(\">\")\r\nelif x==2 and y==3:\r\n print(\"<\")\r\nelif x==3 and y==2:\r\n print(\">\")\r\nelif x==2 and y==4:\r\n print(\"=\")\r\nelif x==4 and y==2:\r\n print(\"=\")\r\nelif x==y:\r\n print(\"=\")\r\nelse:\r\n if x>y:\r\n print(\"<\")\r\n else:\r\n print(\">\")", "import math\r\n\r\nx, y = map(int, input().split())\r\nc1, c2 = math.log(x) / x, math.log(y) / y\r\n\r\nprint('<' if c1 < c2 else '>' if c1 > c2 else '=')", "import math\r\n\r\n\r\nx,y=map(int,input().split())\r\na=y*math.log(x)\r\nb=x*math.log(y)\r\n\r\nif(a==b):\r\n\tprint(\"=\")\r\nelif (a<b):\r\n\tprint(\"<\")\r\nelse:print(\">\")\t\r\n\t", "from math import log10 as log\r\n\r\na , b = map(int , input().split())\r\nx = b * log(a)\r\ny = a * log(b)\r\n\r\nif x == y:\r\n print(\"=\")\r\nelse:\r\n print(\">\" if x > y else \"<\")" ]

[ "m, n = map(int, input().split())\r\nls = []\r\nfor i in range(m):\r\n ls1 = (str(i + 1), '1')\r\n ls.append(ls1)\r\nfor j in range(1, n):\r\n ls1 = ('1', str(j + 1))\r\n ls.append(ls1)\r\n\r\nprint(len(ls))\r\nfor i in ls:\r\n print(' '.join(i))", "b,g=map(int,input().split());g-=1\r\nprint(b+g)\r\nfor i in range(1,b+1):print(i,1)\r\nfor i in range(2,g+2):print(b,i)", "n,m=map(int,input().split())\r\nprint(m+n-1)\r\nfor i in range(1,m+1):\r\n print(1,i)\r\nfor i in range(2,n+1):\r\n print(i,1)\r\n ", "n,m=map(int,input().split(' '))\r\narr=[]\r\nfor j in range(m):\r\n arr.append([1,j+1])\r\nfor j in range(n-1):\r\n arr.append([j+2,1])\r\nprint(len(arr))\r\nfor i in range(len(arr)):\r\n print(arr[i][0],end=\" \")\r\n print(arr[i][1])\r\n", "boys,girls=input().split()\n\nboys=int(boys)\ngirls=int(girls)\n\nprint(boys+girls-1)\n\nfor i in range(1,girls+1):\n print(1,i)\n\nfor i in range(2,boys+1):\n print(i,girls)\n\n", "n,m = list(map(int, input().split()))\r\nprint(n+m-1)\r\n\r\nfor i in range(1,m+1):\r\n print(1, i)\r\n\r\nfor i in range(2,n+1):\r\n print(i, 1)", "n, m = map(int, input().split())\r\n\r\ntotal = (n - 1) + (m - 1) + 1\r\n\r\nprint(total)\r\n\r\nprint(\"1 1\")\r\nfor i in range(n - 1):\r\n print(i + 2, end=' ')\r\n print(1)\r\n\r\nfor i in range(m - 1):\r\n print(1, end= ' ')\r\n print(i + 2)", "sez = [int(i) for i in input().split()]\r\na = []\r\nif sez[0] > sez[1]:\r\n for i in range(sez[1]):\r\n a.append([1,i+1])\r\n for j in range(1, sez[0]):\r\n a.append([j+1, 1])\r\nelse:\r\n for i in range(sez[0]):\r\n a.append([i+1,1])\r\n for j in range(1, sez[1]):\r\n a.append([1, j+1])\r\nprint(len(a))\r\nfor i in a:\r\n print(\" \".join([str(j) for j in i]))\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\nans = []\r\nA, B = set(), set()\r\nfor i in range(1, n + 1):\r\n for j in range(1, m + 1):\r\n if i not in A or j not in B:\r\n ans.append((i, j))\r\n A.add(i)\r\n B.add(j)\r\n\r\nprint(len(ans))\r\nfor a, b in ans:\r\n print(a, b)\r\n", "\r\n\r\n\r\nn,m = map(int,input().split())\r\n\r\nf=[]\r\n\r\na=[]\r\nb=[]\r\nfor k in range(1,n+1):\r\n for j in range(1,m+1):\r\n if k not in a:\r\n if j not in b:\r\n a.append(k)\r\n b.append(j)\r\n f.append([k,j])\r\n else:\r\n a.append(k)\r\n f.append([k,j])\r\n if j not in b:\r\n if k in a:\r\n b.append(j)\r\n f.append([k,j])\r\n else:\r\n a.append(k)\r\n b.append(j)\r\n f.append([k,j])\r\n\r\n\r\n\r\n\r\n\r\nprint(len(f))\r\nfor k in f:\r\n print(*k)\r\n", "n ,m=input().split()\r\nn=int(n)\r\nm=int(m)\r\nprint (n+m-1)\r\nfor i in range (m) :\r\n print(\"1 \"+str(i+1))\r\nfor i in range (n-1) :\r\n print (str(i+2)+\" 1\")\r\n \r\n", "a,b=map(int,input().split())\r\naa=[]\r\nbb=[]\r\nans=[]\r\nlis=[]\r\nliss=[]\r\nfor t in range(1,a+1):\r\n aa.append(t)\r\nfor t in range(1,b+1):\r\n bb.append(t)\r\nfor m in range(len(aa)):\r\n mm=aa[m]\r\n for n in range(len(bb)):\r\n nn=bb[n]\r\n if mm+nn not in ans:\r\n ans.append(mm+nn)\r\n lis.append(mm)\r\n liss.append(nn)\r\nprint(len(ans))\r\nfor t in range(len(lis)):\r\n v=lis[t]\r\n vv=liss[t]\r\n print(v,vv)", "n,m=map(int,input().split())\r\nl=[]\r\nr=[]\r\nfor j in range(1,2):\r\n\tfor k in range(1,m+1):\r\n\t\tl.append([j,k])\r\nfor k in range(2,n+1):\r\n\tl.append([k,1])\r\nprint(len(l))\r\nfor j in range(len(l)):\r\n\tprint(*l[j])", "a, b = map(int, input().split())\r\nprint (a + b - 1)\r\nprint (1, 1)\r\nfor i in range (2, b + 1):\r\n print (1, i)\r\nfor i in range (2, a + 1):\r\n print (i, 1)\r\n \r\n", "\r\nn,m=list(map(int,input().split()))\r\nprint(n+m-1)\r\nfor i in range(m):print(1,i+1)\r\nfor i in range(1,n):print(i+1,m)\r\n", "n,m = map(int, input().split())\r\nprint (n+m-1)\r\nfor i in range(m):print(\"1 \" + str(i + 1))\r\nfor i in range(1, n):print(str(i + 1) + \" 1\")", "n, m = map(int, input().split())\r\n\r\nprint(n + m - 1)\r\n\r\nfor i in range(n):\r\n print(i + 1, 1)\r\n\r\nfor j in range(1, m, 1):\r\n print(1, j + 1)\r\n", "n, m = map(int, input().split())\nres = []\ndb = set()\ndg = set()\nfor i in range(n):\n for j in range(m):\n if i not in db or j not in dg:\n res += [\"%d %d\" % (i+1, j+1)]\n dg.add(j)\n db.add(i)\n\n\nprint(len(res))\nprint(\"\\n\".join(res))\n", "n,m = map(int,input().split())\r\nprint(n+m-1)\r\nif n==max(n,m):\r\n\tfor i in range(1,n+1):\r\n\t\tprint(i,1)\r\n\tfor i in range(2,m+1):\r\n\t\tprint(n,i)\r\nelse:\r\n\tfor i in range(1,m+1):\r\n\t\tprint(1,i)\r\n\tfor i in range(2,n+1):\r\n\t\tprint(i,m)", "# a[-1]last element in array # map(int,input().split()) for more inputs\r\na,b=map(int,input().split())\r\nm=b+a-1\r\nprint(m)\r\nfor i in range(m):\r\n while a>0:\r\n print(a,\"\",b)\r\n a-=1\r\n b -= 1\r\n while b>0:\r\n print(1,\"\",b)\r\n b-=1", "b, g = (int(i) for i in input().split())\nres = []\nwhile b > 0 and g > 0:\n res.append((b, g))\n if b > g:\n b -= 1\n else:\n g -= 1\nprint(len(res))\nfor b, g in res:\n print(b, g)\n", "n,m = map(int,input().split())\r\nx=n+m \r\nif x>1:\r\n c= 1 \r\n x=x-2\r\n while x:\r\n x-=1 \r\n c+=1 \r\n print(c)\r\n for i in range(1,m+1):\r\n print(1,i)\r\n for j in range(2,n+1):\r\n print(j,1)\r\nelse:\r\n print(0)\r\n\r\n", "n, m = map(int, input().split())\r\nprint(n+m-1)\r\nfor i in range(1,m+1):\r\n print(1,i)\r\nfor j in range(2,n+1):\r\n print(j,1)\r\n\r\n", "n , m = map(int , input().split())\r\nl=[]\r\nfor i in range(1, m+1):\r\n l.append(1)\r\n l.append(i)\r\nfor i in range(2, n+1):\r\n l.append(i)\r\n l.append(1)\r\ni=0\r\nprint(len(l)//2)\r\nwhile i+1<len(l):\r\n print(l[i], l[i+1])\r\n i = i+2", "def solve(n, m):\r\n print(n+m-1)\r\n for i in range(1, m + 1):\r\n print(\"1\" + \" \" + str(i))\r\n for i in range(2, n + 1):\r\n print(str(i) + \" \" + \"1\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n, m = map(int, input().split())\r\n solve(n, m)\r\n", "# import sys\r\n# sys.stdin=open('Python\\input.txt','r')\r\n# sys.stdout=open('Python\\output.txt','w')\r\n\r\nn,m=map(int,input().split())\r\nprint(m+n-1)\r\nfor i in range(m):\r\n print(1,i+1)\r\nfor j in range(n-1):\r\n print(j+2,m)", "n, m = map(int, input().split())\r\ngirls = set()\r\nboys = set()\r\nans = []\r\n\r\nfor i in range(1, n+1):\r\n for j in range(1, m+1):\r\n if i not in girls:\r\n ans.append((i, j))\r\n girls.add(i)\r\n elif j not in boys:\r\n ans.append((i, j))\r\n boys.add(j)\r\n\r\nprint(len(ans))\r\nfor i in ans:\r\n print(*i)\r\n", "import sys\r\nfrom math import *\r\nfrom collections import Counter,defaultdict,deque\r\nfrom bisect import bisect_left,bisect_right\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\n# for _ in range(int(input())):\r\nn,k=get_ints()\r\n\r\nprint(n-1+k)\r\nfor i in range(k):\r\n print(1,i+1)\r\nfor i in range(n-1):\r\n print(i+2,k)\r\n ", "n, m = [int(x) for x in input().split()]\r\nprint(n + m - 1)\r\nfor i in range(1, n+1):\r\n print(i, 1)\r\nif m > 1:\r\n for i in range(2, m+1):\r\n print(1, i)", "from itertools import combinations\r\ndef solve(n,m):\r\n print(n + m - 1)\r\n for i in range(1,m+1):\r\n print(1,\" \",i)\r\n for i in range(2,n+1):\r\n print(i,\" \",1)\r\n\r\n\r\nn,m = map(int,input().split(\" \"))\r\nsolve(n,m)", "n , m = map(int,input().split())\r\n\r\nr1 = n + m - 1\r\n\r\nprint(r1)\r\n\r\nfor i in range(1 , n + 1):\r\n for j in range(1 , m+1):\r\n print(i , j)\r\n if i > 1 :\r\n break\r\n\r\n", "n, m = map(int, input().split())\r\n\r\nprint(n + m - 1)\r\n\r\nfor i in range(n):\r\n print(i + 1, 1)\r\n \r\nfor i in range(1, m):\r\n print(1, i + 1)\r\n", "n, m = map(int, input().split())\r\nprint(n + m - 1)\r\nl, r = 1, 1\r\nfor i in range(n + m - 1):\r\n print(l, r)\r\n r += 1\r\n if r > m:\r\n r = min(r, m)\r\n l += 1\r\n", "def main():\r\n n, m = list(map(int, input().split()))\r\n\r\n answer_arr = []\r\n for i in range(1, m + 1):\r\n answer_arr.append((1, i))\r\n for i in range(2, n + 1):\r\n answer_arr.append((i, m))\r\n\r\n print(len(answer_arr))\r\n for element in answer_arr:\r\n print(*element)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, m = map(int, input().split())\r\nprint(n + m - 1)\r\nfor i in range (1, n + 1): print(i, 1)\r\nfor i in range (1, m): print(1, i + 1)", "# 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, m = map(int, input().split())\r\nprint(n + m - 1)\r\nfor i in range(1, n + 1):\r\n print(i, 1)\r\nfor i in range(2, m + 1):\r\n print(1, i)\r\n", "n,m = map(int,input().split())\r\nk = n+m-1\r\ni = j = 1\r\nprint(k)\r\nif n == m:\r\n\twhile i<n and j<m:\r\n\t\tprint(i,j)\r\n\t\tprint(i,j+1)\r\n\t\ti+=1\r\n\t\tj+=1\r\n\tprint(i,j)\r\nelse:\r\n\tprint(i,j)\r\n\ti+=1\r\n\tj+=1\r\n\twhile i<=n and j<=m:\r\n\t\tprint(i-1,j)\r\n\t\tprint(i,j)\r\n\t\ti+=1\r\n\t\tj+=1\r\n\twhile i<=n:\r\n\t\tprint(i,j-1)\r\n\t\ti+=1\r\n\twhile j<=m:\r\n\t\tprint(i-1,j)\r\n\t\tj+=1", "a,b = [int(i) for i in input().split(' ')]\r\nprint(a+b-1)\r\nfor i in range (1,b+1):\r\n print(1,i)\r\nif a > 1:\r\n for i in range(2,a+1):\r\n print(i,1)\r\n\r\n\r\n \r\n", "#190 div 2 A. Ciel and Dancing\r\n\r\ndata = input().split(\" \")\r\nboys = int(data[0])\r\ngirls = int(data[1])\r\n\r\ntotal = boys + (girls-1)\r\nprint(total)\r\n\r\nfor g in range(girls):\r\n\tprint(\"1 %s\" %(g+1))\r\n\r\nfor b in range(1, boys):\r\n\tprint(\"%s %s\" %(b+1, girls))", "n, m = [int(i) for i in input().split()]\r\nprint(n + m - 1)\r\nprint(1, 1)\r\nfor i in range(2, n + 1):\r\n print(i, 1)\r\nfor i in range(2, m + 1):\r\n print(1, i)\r\n", "from random import *\r\nn, m = map(int,input().split())\r\nprint(m+n-1)\r\nfor i in range(m):\r\n\tprint(1,i+1)\r\nfor i in range(n-1):\r\n\tprint(i+2,randint(1,m))", "n,m=map(int,input().split())\r\nprint(m+(n-1))\r\nfor i in range(m):\r\n print(1,i+1)\r\nfor j in range(2,n+1):\r\n print(j,m)\r\n ", "n,m=[int(x) for x in input().split()]\r\n\r\na=min(n,m)\r\nb=abs(n-m)\r\nk=2*a-1+b\r\nprint(k)\r\nif a==1:\r\n\tprint(1,1)\r\n\ti=1\r\nelse:\r\n\tfor i in range(1,a):\r\n\t\tprint(i,i)\r\n\t\tprint(i+1,i)\r\n\tprint(i+1,i+1)\r\n\r\nif n<m:\r\n\tfor i in range(a+1,m+1):\r\n\t\tprint(a,i)\r\nelif n>m:\r\n\tfor i in range(a+1,n+1):\r\n\t\tprint(i,a)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\nprint(n+m-1)\r\nprint(1, 1)\r\nfor i in range(2, m+1):\r\n print(1, i)\r\nfor i in range(2, n+1):\r\n print(i, 1)", "n, m = map(int, input().split())\r\nprint(n + m - 1)\r\nfor i in range(m):\r\n print(1, i + 1)\r\nfor j in range(2, n + 1):\r\n print(j, 1)", "# n = int(input())\r\n# l=list(map(int,input().split()))\r\n# n, m, k = [int(x) for x in input().split()]\r\nn, m = [int(x) for x in input().split()]\r\nprint(n + m - 1)\r\nfor i in range(1, m + 1):\r\n print(1, i)\r\nfor i in range(2, n + 1):\r\n print(i, 1)", "\r\ndef main():\r\n nm=input().split(\" \")\r\n n=int(nm[0])\r\n m=int(nm[1])\r\n nos=0\r\n pairs=[]\r\n for i in range(1):\r\n for j in range(m):\r\n pairs.append([i+1,j+1]);\r\n nos+=1\r\n for j in range(1,n):\r\n pairs.append([j+1,1])\r\n nos+=1\r\n print (nos)\r\n for i in pairs:\r\n pair=str(i[0])+\" \"+str(i[1])\r\n print (pair)\r\nif __name__ == \"__main__\": main()\r\n\r\n", "L = [int(it) for it in input().split()]\r\nn = L[0]\r\nm = L[1]\r\ni, j, k = 1, 1, 0\r\nout = []\r\nwhile i <= n or j <= m:\r\n s = str(i) + ' ' + str(j)\r\n out.append(s)\r\n if i < n and j < m:\r\n if k % 2 == 0:\r\n j += 1\r\n else:\r\n i += 1\r\n elif i < n:\r\n i += 1\r\n elif j < m:\r\n j += 1\r\n else:\r\n break\r\n k += 1\r\nprint(len(out))\r\nfor item in out:\r\n print(item)\r\n ", "#nice problem almost finished https://codeforces.com/contest/771/problem/A\r\nimport math\r\n\r\nn, m = map(int, input().split())\r\n\r\nmen_d = []\r\nwom_d = []\r\nofficial = []\r\nfor i in range(n):\r\n for j in range(m):\r\n if i not in men_d or j not in wom_d:\r\n official.append(f'{i+1} {j+1}')\r\n men_d.append(i)\r\n wom_d.append(j)\r\n\r\nprint(len(official))\r\n[print(_str) for _str in official]\r\n", "numbers = input().split()\r\nn = int(numbers[0])\r\nm = int(numbers[1])\r\nprint(n+m-1)\r\ni = 1\r\nwhile i <= m:\r\n print(\"1 \" + str(i))\r\n i = i + 1;\r\ni = 2\r\nwhile i <= n:\r\n print(str(i) + \" 1\")\r\n i = i + 1\r\n", "n,m=map(int,input().split())\r\nprint(n+m-1)\r\nfor i in range(1,m+1):\r\n print('1 %d' % i)\r\nfor i in range(2,n+1):\r\n print('%d 1' % i)", "import sys\r\n\r\ndef input(): return sys.stdin.readline().strip()\r\ndef iinput(): return int(input())\r\ndef rinput(): return map(int, sys.stdin.readline().strip().split()) \r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split())) \r\n\r\n\r\nn,m=rinput()\r\n\r\nprint(n+m-1)\r\ns=[]\r\nfor i in range(n):\r\n print(i+1,1)\r\nfor i in range(m-1):\r\n print(1,i+2)\r\n\r\n", "n,m=input().split()\nn=int(n)\nm=int(m)\nprint(n+m-1)\nfor i in range(1,m+1):\n print(1,i)\nfor i in range(2,n+1):\n print(i,1)\n\t \t\t\t \t \t\t \t\t\t \t \t \t", "import math\r\n\r\ndef main_function():\r\n n, m = [int(i) for i in input().split(\" \")]\r\n total_dances = n + m - 1\r\n print(total_dances)\r\n for i in range(1, n + 1):\r\n print(str(i) + \" \" + str(m))\r\n for i in range(1, m):\r\n print(str(n) + \" \" + str(i))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()\r\n", "n, m = map(int, input().split())\r\nprint(n + m - 1)\r\nfor i in range(m):\r\n print(1, i + 1)\r\nfor i in range(1, n):\r\n print(i + 1, 1)", "n,m=list(map(int,input().split()))\r\nres=[]\r\nfor j in range (m):\r\n res.append([1,j+1])\r\nfor j in range(2,n+1):\r\n res.append([j,1])\r\nprint(len(res))\r\nfor i in res:\r\n for j in i:\r\n print(j,end=' ')\r\n print()\r\n", "__copyright__ = ''\r\n__author__ = 'Son-Huy TRAN'\r\n__email__ = \"[email protected]\"\r\n__doc__ = ''\r\n__version__ = '1.0'\r\n\r\n\r\ndef main() -> int:\r\n (n, m) = map(int, input().split())\r\n\r\n print(n + m - 1)\r\n\r\n for i in range(1, m + 1):\r\n print('1 %d' % i)\r\n\r\n for i in range(2, n + 1):\r\n print('%d 1' % i)\r\n\r\n return 0\r\n\r\n\r\nif __name__ == '__main__':\r\n exit(main())", "a,b=map(int,input().split())\r\nprint(a+b-1)\r\nfor i in range(1,a+b):\r\n print (max(1,i-b+1),min(i,b))", "v,m = [int(i) for i in input().split()]\r\nvm = v > m;\r\nt = v+m;\r\niv=1\r\nim=1\r\nprint(t-1)\r\nfor i in range(1,t):\r\n print(iv,im)\r\n if vm: \r\n iv += 1 if ( i < v ) else 0\r\n im += 1 if ( i >= v ) else 0\r\n else:\r\n iv += 1 if ( i >= m ) else 0\r\n im += 1 if ( i < m ) else 0\r\n", "n , m = map(int,input().split())\r\n\r\nr = n + m - 1\r\n\r\nprint(r)\r\nif n == m :\r\n for i in range(1 , n+1):\r\n if i == 1 :\r\n for j in range(1 , m + 1):\r\n print(i , j)\r\n\r\n else:\r\n for j in range(2 , m + 1):\r\n if i == j :\r\n print(i , j)\r\n\r\n\r\nelse:\r\n for i in range(1 , n + 1):\r\n for j in range(1 , m + 1):\r\n print(i , j)\r\n if i > 1 :\r\n break\r\n\r\n", "n, m = [int(x) for x in input().split()]\r\nprint(n + m - 1)\r\nfor i in range(m):\r\n print(1, i + 1)\r\nfor i in range(1, n):\r\n print(i + 1, 1)", "n , m = list(map(int , input().split()))\r\na = []\r\nfor el in range(1 ,m+1):\r\n a.append(str(1) + ' ' + str(el))\r\n\r\nfor elem in range(2 , n + 1):\r\n a.append(str(elem) + ' ' + str(1))\r\n\r\n\r\nprint(len(a))\r\nfor i in a : \r\n print(i)", "import sys\nf = sys.stdin\n#f = open(\"input.txt\", \"r\")\nm, l = map(int, f.readline().split())\nprint(m+l-1)\nfor i in range(1, l+1):\n print(1, i)\nfor i in range(2, m+1):\n print(i, 1)", "n,m = map(int,input().split())\r\ncount = (n+m)-1\r\nn1 = 1\r\nm1 = 0\r\nif n > m:\r\n n1 = 1\r\n m1 = 0\r\nelif n == m:\r\n n1 = 1\r\n m1 = 0\r\nelse:\r\n n1 = 0\r\n m1 = 1\r\nprint(count)\r\ni = 0\r\nif n1 == 1:\r\n while i != count:\r\n i+=1\r\n if m1 == m:\r\n n1+=1\r\n else:\r\n m1+=1\r\n print(n1,m1)\r\nelse:\r\n while i != count:\r\n i+=1\r\n if n1 == n:\r\n m1+=1\r\n else:\r\n n1+=1\r\n print(n1,m1)", "n,m=[int(i) for i in input().split()]\r\nprint(n+m-1)\r\nfor i in range(m):\r\n print(1,i+1)\r\nfor j in range(2,n+1):\r\n print(j,1)\r\n ", "n,m = map(int, input().split())\r\nprint(str(n+m-1))\r\nfor i in range(1,m+1):\r\n\tprint('1 '+str(i))\r\nfor i in range(2,n+1):\r\n\tprint(str(i)+' 1')", "n, m = map(int,input().split())\r\nn_bool = []\r\nm_bool = []\r\nindexs = []\r\nsong = 0\r\nfor i in range(n):\r\n n_bool.append(True)\r\nfor j in range(m):\r\n m_bool.append(True)\r\n\r\nfor a in range(n):\r\n for b in range(m):\r\n if n_bool[a] == True or m_bool[b] == True :\r\n song += 1\r\n indexs.append(str(a+1) + ' ' + str(b+1))\r\n n_bool[a] = False\r\n m_bool[b] = False\r\nprint(song)\r\nfor c in range(len(indexs)):\r\n print(indexs[c])", "def Comp(n,m):\r\n count = n+m-1\r\n print(str(count))\r\n print(\"1 1\")\r\n for i in range(2,m+1):\r\n print(\"1 \"+str(i))\r\n for i in range(2,n+1):\r\n print(str(i)+\" 1\")\r\n\r\n\r\nComp(*map(int,input().split()))\r\n", "def ciel_dance(b,g):\r\n total=b+g-1\r\n print(total)\r\n for i in range(b):\r\n print(i+1,1)\r\n for i in range(2,g+1):\r\n print(1,i)\r\nb,g=map(int,input().split())\r\nciel_dance(b,g)\r\n", "from math import ceil\r\ndef solve():\r\n n,m=map(int,input().split())\r\n print(n+(m-1))\r\n for i in range(n):\r\n if i==0:\r\n for j in range(m):\r\n print(i+1,j+1)\r\n continue\r\n print(i+1,m)\r\nsolve()", "x,y=map(int,input().split())\r\nz,x1,y1=[],[],[]\r\nfor i in range(1,x+1):\r\n\tfor j in range(1,y+1):\r\n\t\tif (i not in x1) or (j not in y1):\r\n\t\t\tx1.append(i)\r\n\t\t\ty1.append(j)\r\n\t\t\tz.append((i,j))\r\nprint(len(z))\r\nfor i in z:print(*i)", "n, m = map(int, input().split())\r\nprint(n + m - 1)\r\nif n + m == 1: print(1, 1)\r\nelif m > 1:\r\n for i in range(1, n + 1): print(i, 1)\r\n for i in range(2, m + 1): print(1, i)\r\nelse:\r\n for i in range(2, n + 1): print(i, 1)\r\n for i in range(1, m + 1): print(1, i)\r\n ", "import sys\r\nimport math\r\n\r\nn, m = [int(x) for x in (sys.stdin.readline()).split()]\r\n\r\nprint(n + m - 1)\r\nfor i in range(1, m + 1):\r\n print(str(1) + \" \" + str(i))\r\n \r\nfor j in range(2, n + 1):\r\n print(str(j) + \" \" + str(m))", "\r\nb,g=map(int,input().split())\r\nprint(b-1+g)\r\nfor i in range(g):\r\n print(1,i+1)\r\nfor i in range(1,b):\r\n print(i+1,1)", "n, m = map(int, input().split())\r\n\r\nc = n + m - 1\r\nprint(c)\r\n\r\nprint(1, 1)\r\nfor i in range(n - 1):\r\n print(i + 2, 1)\r\n\r\nfor i in range(m - 1):\r\n print(1, i + 2)", "class CielandDancing:\r\n n = 0\r\n m = 0\r\n def solve(self):\r\n print(self.n + self.m - 1)\r\n for i in range(1,self.m+1):\r\n print(1,\" \",i)\r\n for i in range(2,self.n+1):\r\n print(i,\" \",1)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n c = CielandDancing()\r\n c.n,c.m = map(int,input().split())\r\n c.solve()", "n,m=[int(i) for i in input().split()]\r\nsum=m\r\nif(n>1):\r\n sum=sum+(n-1)\r\nprint(sum) \r\nfor i in range(1,m+1):\r\n print(1,i)\r\nif(n>1):\r\n for i in range(2,n+1):\r\n print(i,1)", "m,n=map(int,input().split())\r\nprint(m+n-1)\r\nfor i in range(1,n+1):\r\n print(1,i)\r\nfor j in range(2,m+1):\r\n print(j,1)\r\n\r\n", "n, m = list(map(int, input().split()))\r\n#a = list(map(int, input().split()))\r\n#b = list(map(int, input().split()))\r\n\r\nprint(n+m-1)\r\nfor i in range(n):\r\n print(i+1, 1)\r\n \r\nfor j in range(1, m):\r\n print(1, j+1)", "n, m = map(int, input().split())\n\nprint(m+n-1)\n\nfor i in range(m):\n print(1, i+1)\n\nfor i in range(n-1):\n print(i+2, m)\n\n\t\t\t\t \t\t \t\t \t \t \t\t \t\t\t \t\t", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Jan 19 15:57:58 2023\r\n\r\n@author: Lenovo\r\n\"\"\"\r\n\r\nh,m=map(int,input().split())\r\nprint(m+h-1)\r\nfor i in range(1,m+1):\r\n print(1,i)\r\nfor j in range(2,h+1):\r\n print(j,1)\r\n", "def main():\r\n x,y = map(int,input().split())\r\n cx = [0]*x\r\n cy = [0]*y\r\n \r\n print(x+y-1)\r\n for i in range(x):\r\n for j in range(y):\r\n if cx[i] == 0 or cy[j] == 0:\r\n print(i+1,j+1)\r\n cx[i] = 1\r\n cy[j] = 1\r\n \r\nmain()", "n,m = map(int,input().split(\" \"))\n\nprint(n+m-1)\n\nfor i in range(1,m+1):\n\tprint(\"1\"+\" \"+str(i))\nfor i in range(2,n+1):\n\tprint(str(i)+\" \"+\"1\")\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\nn,m=map(int,input().split())\r\nprint(n+m-1)\r\nfor i in range(n):print(i+1,1)\r\nfor i in range(m-1):print(1,i+2)", "t = input().split()\r\nn,m = int(t[0]),int(t[1])\r\nres = []\r\nfor i in range(1,m+1):\r\n res.append([1,i])\r\n\r\nif n> 1 :\r\n for i in range(2,n+1):\r\n res.append([i,1])\r\nprint(len(res))\r\nfor i in res:\r\n print(i[0],i[1])", "from collections import deque, defaultdict, Counter\r\nfrom itertools import product, groupby, permutations, combinations\r\nfrom math import gcd, floor, inf\r\nfrom bisect import bisect_right, bisect_left\r\n\r\nn, m = map(int, input().split())\r\nans = []\r\ni = 1\r\nwhile m:\r\n ans.append([1,i])\r\n i += 1\r\n m -= 1\r\ni = 2\r\nn -= 1\r\nwhile n:\r\n ans.append([i, 1])\r\n i += 1\r\n n -= 1\r\nprint(len(ans))\r\n\r\nfor i, j in ans:\r\n print(i,j)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "b, g = map(int, input().split())\r\n\r\nprint(b + g - 1)\r\n\r\nfor i in range(1, g + 1):\r\n print(\"%d %d\" % (1, i))\r\n\r\nfor i in range(2, b + 1):\r\n print(\"%d %d\" % (i, 1))", "n, m = map(int, input().split())\nprint(n+m-1)\nfor i in range(1, n+1):\n print(\"%d 1\" % i)\nfor i in range(2, m+1):\n print(\"1 %d\" % i)\n\n", "def A():\r\n \r\n n , m = map( int, input().split())\r\n \r\n print(m+n-1)\r\n \r\n for i in range(1,m+1):\r\n print(1,i)\r\n \r\n for j in range(2,n+1):\r\n print(j,1)\r\n \r\nA()", "n,m=map(int,input().split())\r\nprint(n+m-1)\r\nfor i in range(1,m+1):\r\n print(1,i)\r\nfor i in range(2,n+1):\r\n print(i,m)\r\n", "n,m = map(int,input().split())\r\nprint(m+n-1)\r\nfor i in range(1,n+1):\r\n\tif i == 1:\r\n\t\tfor j in range(1,m+1):\r\n\t\t\tprint(i,\" \",j)\r\n\telse:\r\n\t\tprint(i, \" \", 1)", "a,b = map(int,input().split())\r\nx = (a+b)-1\r\nprint(x)\r\nfor i in range(1, b + 1):\r\n print(1,i)\r\nfor i in range(2, a + 1):\r\n print(i,1)", "lista = []\ndef menines(m, n, meninos, meninas):\n cont = 0\n for i in meninas:\n lista.append(str(str(meninos[0]) + ' ' + str(i) ))\n #print(meninos[0], i)\n cont+=1\n return cont\n\ndef meninxs(m, n, meninos, meninas):\n cont = 0\n for i in range(1, len(meninos)):\n lista.append(str(str(meninos[i]) + ' ' + str(meninas[0])))\n #print(meninos[i], meninas[0])\n cont+=1\n return cont\n\n\n\n\nn, m = map(int, input().split()) \nmeninos = []\nmeninas = []\n\nfor i in range(1, n+1):\n meninos.append(i)\n\nfor i in range(1, m+1):\n meninas.append(i)\n\na = menines(m, n, meninos, meninas)\nb = meninxs(m, n, meninos, meninas)\n\nprint(a+b)\nprint(*lista, sep = '\\n')\n \t\t\t\t\t \t\t\t \t\t \t\t\t\t\t\t\t\t", "n,m=map(int,input().split())\r\nprint(n+m-1)\r\nfor i in range(m):\r\n print(1,i+1)\r\nfor i in range(2,n+1):\r\n print(i,1)", "class CodeforcesTask322ASolution:\n def __init__(self):\n self.result = ''\n self.n_m = []\n\n def read_input(self):\n self.n_m = [int(x) for x in input().split(\" \")]\n\n def process_task(self):\n res = []\n res.append(str(sum(self.n_m) - 1))\n res.append(\"1 1\")\n for x in range(2, self.n_m[0] + 1):\n res.append(f\"{x} 1\")\n for x in range(2, self.n_m[1] + 1):\n res.append(f\"1 {x}\")\n\n self.result = \"\\n\".join(res)\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask322ASolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "__author__ = 'Ol4a'\r\nm, d = list(map(int, input().split()))\r\nk=m+d-1\r\nprint(k)\r\nfor i in range(1, d+1):\r\n print(1, i)\r\nfor j in range(2, m+1):\r\n print(j, 1)\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n, m = [int(x) for x in input().split()]\nprint(m + n - 1)\nfor i in range(1, n + 1):\n print(i, 1)\nfor i in range(2, m + 1):\n print(1, i)", "n, m = map(int, input().split())\n\nsongs = n + m - 1\nprint(songs)\n\nfor i in range(m):\n print(1, i+1)\n\nfor i in range(1,n):\n print(i+1,1)\n \t\t\t\t\t\t\t\t \t \t\t \t\t \t\t\t\t\t \t \t", "b, g = map(int, input().split())\r\ndances = b + g - 1\r\nprint(dances)\r\n\r\nfor i in range(1, b+1):\r\n print(i,1)\r\n\r\nfor i in range(2, g+1):\r\n print(1,i)", "# coding: utf-8\nn, m = [int(i) for i in input().split()]\nprint(n+m-1)\nprint(1,1)\nfor i in range(2,m+1):\n print(1,i)\nfor i in range(2,n+1):\n print(i,1)\n", "n, m = map(int, input().split())\r\n\r\nprint(n + m - 1)\r\n\r\nprint(1, 1)\r\n\r\nfor i in range(2, m+1):\r\n print(1, i)\r\n\r\nfor i in range(2, n+1):\r\n print(i, 1)\r\n", "if __name__==\"__main__\":\r\n n,m = map(int, input().split())\r\n print(n+m-1)\r\n x=y=1\r\n for i in range(n+m-1):\r\n print(x,y)\r\n if y==m: x += 1\r\n else: y += 1\r\n ", "if __name__ == '__main__':\r\n a, b = str(input()).split()\r\n a = int(a)\r\n b = int(b)\r\n min_v = min(a, b)\r\n max_v = max(a, b)\r\n print(a + b - 1)\r\n lines = list()\r\n print('1 1')\r\n for i in range(2, a + 1):\r\n print(str(i) + ' 1')\r\n for i in range(2, b + 1):\r\n print('1 ' + str(i))\r\n", "n, m = [int(x) for x in input().split()]\r\nprint(n+m-1)\r\nfor i in range(1, m+1):\r\n print(1, i)\r\nfor i in range(2, n+1):\r\n print(i, 1)\r\n", "a=list(map(int,input().split()))\r\nprint(sum(a)-1)\r\nfor i in range(a[0]):\r\n print(i+1,1)\r\nfor i in range(a[1]-1):\r\n print(1,i+2)\r\n", "boy, girl = map(int, input().split(\" \"))\n\nprint(boy + girl -1)\n\nif(boy > girl):\n for i in range(boy):\n print(f\"{i+1} 1\")\n for i in range(1, girl):\n print(f\"{i+1} {i+1}\")\nelse:\n for i in range(girl):\n print(f\"1 {i+1}\")\n for i in range(1, boy):\n print(f\"{i+1} {i+1}\")\n\t \t \t\t\t\t\t\t \t \t \t\t\t\t \t\t \t\t\t \t \t", "n,m=map(int,input().split())\r\nx,y=[0]*(n+1),[0]*(m+1)\r\nl=[]\r\nfor i in range(1,n+1):\r\n for j in range(1,m+1):\r\n if(x[i]==0):\r\n if([i,j] not in l and [j,i] not in l):\r\n l.append([i,j])\r\n x[i]+=1\r\n y[j]+=1\r\n elif(y[j]==0):\r\n if([i,j] not in l and [j,i] not in l):\r\n l.append([i,j])\r\n x[i]+=1\r\n y[j]+=1\r\nprint(len(l))\r\nfor i in l:\r\n print(*i)\r\n", "n,m = list(map(int,input().split()))\r\n\r\nans = []\r\nfor i in range(2,n+1):\r\n ans.append((i,1))\r\nfor i in range(2,m+1):\r\n ans.append((1,i))\r\nprint(len(ans)+1)\r\nprint(1,1)\r\nfor i in ans:\r\n print(*i)", "n, m = map(int, input().split())\r\nprint(n + m - 1)\r\nfor i in range(1, m + 1):\r\n print(\"{} {}\".format(1, i))\r\nfor i in range(2, n + 1):\r\n print(\"{} {}\".format(i, 1))\r\n", "n,m=map(int,input().split())\r\nprint(n+m-1)\r\nt=[]\r\nt=[str(i)+\" \"+\"1\" for i in range(1,n+1)]+[str(n)+\" \"+str(i) for i in range(2,m+1)]\r\nprint(\"\\n\".join(t))", "(n, m) = map(int, input().split())\nprint(m + n-1)\nfor i in range(1, m+1):\n print(1, i)\nfor i in range(2, n+1):\n print(i, 1)\n", "n,m=map(int,input().split())\r\nans=[]\r\nfor x in range(1,m+1):\r\n ans+=[['1',str(x)]]\r\nfor x in range(2,n+1):\r\n ans+=[[str(x),'1']]\r\nprint(len(ans))\r\nprint('\\n'.join(map(' '.join,ans)))", "n,m = [int(x) for x in input().split()]\r\nk = m + (n-1)\r\nprint(k)\r\nfor i in range(1,m+1):\r\n print(1,i)\r\nif n<=m:\r\n for j in range(2,n+1):\r\n print(j,j)\r\nelse:\r\n for j in range(2,n+1):\r\n print(j,1)\r\n", "l=list(map(int,input().split()))\r\nn,m=l[0],l[1]\r\nprint(n+m-1)\r\nfor i in range(1,m+1):\r\n print(1,i)\r\nfor i in range(2,n+1):\r\n print(i,1)", "import sys\n\nn, m = map(int, sys.stdin.readline().split())\nprint(n+m-1)\nfor i in range(m):\n print(1, i+1)\nfor i in range(1, n):\n print(i+1, 1)\n", "n,m = map(int,input().split())\r\nii = set()\r\njj = set()\r\n\r\nans = []\r\nfor i in range(1,n+1):\r\n for j in range(1,m+1):\r\n if i not in ii or j not in jj:\r\n ans.append ((i,j))\r\n ii.add(i)\r\n jj.add(j)\r\nprint(len(ans))\r\nfor a,b in ans:\r\n print(a,b)", "n,m = map(int, input().split(' '))\nprint(n+m-1)\n\nfor i in range(1, m+1):\n print(str(1) + \" \" + str(i))\n\nfor j in range(2, n+1):\n print(str(j) + \" \" + str(1))\n\n\t \t\t\t \t\t\t\t \t \t \t\t \t\t \t\t", "import sys\n\n\ndef get_string(): return sys.stdin.readline().strip()\n\n\ndef get_ints_as_list(char=' '): return list(map(int, sys.stdin.readline().strip().split(char)))\n\n\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\n\n\n# def print(str): sys.stdout.write(str)\n\n\ndef main():\n n, m = get_ints()\n\n males = [0] * n\n females = [0] * m\n\n results = list()\n\n for i in range(n):\n for j in range(m):\n if males[i] and females[j]:\n continue \n\n results.append((i+1,j+1))\n males[i] = females[j] = 1\n \n print(len(results))\n [print(i,j) for (i,j) in results]\n\n# call the main method\nif __name__ == \"__main__\":\n main()\n", "def takeinput():\n b,g = map(int,input().split())\n boy = [0]*b\n girl = [0]*g\n ans = [] \n sum = -1\n for i in range(b):\n for j in range(g):\n if boy[i]==0 or girl[j]==0:\n temp = i+j\n if temp>sum:\n boy[i]=1\n girl[j]=1\n sum=temp\n ans.append((i+1,j+1))\n return ans\n\nif __name__=='__main__':\n res = takeinput()\n print(len(res))\n for val in res:\n print(val[0],val[1])\n\n", "n, m = map(int,input().split())\r\nprint(n + m - 1)\r\nfor i in range(1,m + 1):\r\n print(1,i)\r\nfor j in range(2,n + 1):\r\n print(j,1)\r\n", "n,m=map(int,input().split())\nprint(n+m-1)\nfor i in range(1,m+1):\n\tprint(1,i)\nfor i in range(2,n+1):\n\tprint(i,m)\n \t \t\t\t\t\t \t \t\t \t \t \t\t \t \t\t\t", "b,g = map(int,input().split())\r\nprint(b+g-1)\r\nfor i in range(1, g+1):\r\n print(1, i)\r\n\r\nfor i in range(2, b+1):\r\n print(i, 1)", "X = list(map(int, input().split()))\r\nAnswers = []\r\nfor i in range(X[1]):\r\n Answers.append('1' + \" \" + str(i + 1))\r\nfor i in range(1, X[0]):\r\n Answers.append(str(i + 1) + \" \" + '1')\r\nprint(len(Answers))\r\nprint(*Answers, sep=\"\\n\")\r\n\r\n# UB_CodeForces\r\n# Advice: Falling down is an accident, staying down is a choice\r\n# Location: Here in Bojnurd\r\n# Caption: Being followed by my friend ESSI\r\n# CodeNumber: 623\r\n", "n,m=map(int,input().split())\r\nif(n>=m):\r\n print(n+m-1)\r\n for i in range(1,n+1):\r\n print(i,1)\r\n for i in range(2,m+1):\r\n print(n,i)\r\nelse:\r\n print(n+m-1)\r\n for i in range(1,m+1):\r\n print(1,i)\r\n for i in range(2,n+1):\r\n print(i,m)", "def solution(n,m):\r\n print(m+n-1)\r\n if n>=m:\r\n\r\n for i in range(1,m+1):\r\n print(1,i)\r\n \r\n\r\n for i in range(2,n+1):\r\n print(i,1)\r\n \r\n else:\r\n \r\n for i in range(1,n+1):\r\n print(i,1)\r\n\r\n \r\n for i in range(2,m+1):\r\n print(1,i)\r\n \r\n\r\n\r\n\r\n\r\n\r\na=list(map(int,input('').split()))\r\nsolution(a[0],a[1])", "def main():\n n, m = map(int, input().strip().split())\n print(n + m - 1)\n for i in range(1, n + 1):\n print(i, 1)\n for i in range(2, m + 1):\n print(n, i)\n\n\nmain()", "from typing import List\n\n\nclass Solution:\n def main(self):\n # l = []\n # l = input()\n # n = int(l[0])\n # k = int(l[-1])\n # l = []\n # l = input()\n # l = l.split()\n # answer = self.next_round(n,k, l)\n # answer = self.a_bit_plusplus()\n # answer = self.petya_and_strings()\n # answer = self.beautiful_matrix()\n # answer = self.young_physicist()\n answer = 0\n self.ciel_and_dancing()\n return answer\n \n def watermelon(self,n: int) -> int:\n return (n % 2 == 0 and n!=2)\n \n def way_too_long_words(self,n: int, s: List[str]) -> List[str]:\n ret_list = []\n for i in range(n):\n cur = s[i]\n ret = \"\"\n if(len(s[i]) <= 10):\n ret_list.append(cur)\n else:\n ret += cur[0]\n ret += str(len(cur[1:len(cur)-1]))\n ret += cur[-1]\n ret_list.append(ret)\n return ret_list\n \n def a_team(self, n: int, list: List[List[int]]) -> List[List[int]]:\n ret_list = 0\n for i in range(n):\n current = list[i]\n ret = int(current[0]) ^ int(current[1]) ^ int(current[2])\n if(current[0] == current[1] and current[1] == current[2] and current[0] == 1):\n ret = 0\n elif(current[0] == current[1] and current[1] == current[2] and current[0] == 0):\n ret = 1\n if(ret == 0):\n ret_list += 1\n return ret_list\n \n def next_round(self, n: int, k: int, list:List[int]) -> int:\n ret = 0;\n print(\"length: \"+str(len(list)))\n for i in range(len(list)):\n if(int(list[i]) >= int(list[k-1]) and int(list[i]) >= 1):\n ret += 1\n return ret\n \n def a_bit_plusplus(self):\n n = int(input())\n x = 0\n while(n > 0):\n str = input()\n if(\"+\" in str):\n x += 1\n else:\n x -= 1\n n -= 1\n return x\n \n def petya_and_strings(self):\n str1 = input()\n str2 = input()\n length = len(str1)\n i = 0\n str1 = str1.lower()\n str2 = str2.lower()\n isDone = False\n ret = 0\n while(i < length and isDone == False):\n if(str1[i] < str2[i]):\n isDone = True\n ret = -1\n elif(str1[i] > str2[i]):\n isDone = True\n ret = 1\n i += 1\n return ret\n \n def beautiful_matrix(self):\n i = 5\n matrix = []\n while(i>0):\n matrix.append(input().replace(\" \", \"\"))\n i -= 1\n for k in range(0,5):\n for j in range(0,5):\n if(matrix[k][j] == \"1\"):\n ret = abs(j-2) + abs(k-2)\n break\n return ret\n\n def helpful_maths(self):\n stri = input()\n splitt = stri.split(\"+\")\n for i in range(len(splitt)):\n splitt[i] = int(splitt[i])\n splitt = sorted(splitt, key=lambda x: x)\n ret = \"\"\n for i in range(len(splitt)):\n x = str(splitt[i])\n if(i == len(splitt) - 1):\n ret += \"\"+x\n else:\n ret += \"\"+x+\"+\"\n return ret\n\n def word_capitalization(self):\n s = input()\n ret = \"\"\n ret += s[0].upper() + s[1:]\n return ret\n\n def stones_on_the_table(self):\n count = 0\n n = int(input())\n s = input()\n for i in range(1,len(s)):\n if(s[i] == s[i-1]):\n count += 1\n return count\n\n def boy_or_girl(self):\n ret = \"CHAT WITH HER!\"\n s = input()\n sett = set()\n count = 0\n for i in range(len(s)):\n if(s[i] not in sett):\n count += 1\n sett.add(s[i])\n if(count % 2 != 0):\n ret = \"IGNORE HIM!\"\n return ret\n\n def football(self):\n ret = \"NO\"\n i = 0\n j = 0\n s = input()\n for k in range(len(s)):\n if(s[k] == s[j]):\n i += 1\n else:\n j = k\n i = k\n if(i-j == 6):\n ret = \"YES\"\n break\n return ret\n\n def hq9_plus(self):\n ret = \"NO\"\n s = input()\n n = len(s)\n sett = set(['H', 'Q', '9'])\n for i in range(n):\n if(s[i] in sett):\n ret = \"YES\"\n break\n return ret\n\n def even_odds(self):\n ret = 0\n s = input()\n n, k = s.split(\" \")\n n, k = int(n), int(k)\n if (k <= (n + 1) // 2):\n ret = k * 2 - 1\n else:\n ret = (k - (n + 1) // 2) * 2\n return int(ret)\n \n def string_task(self):\n ret = \"\"\n s = input()\n n = len(s)\n s = s.lower()\n vowels = set(['a','e','i','o','u','y','A','E','I','O','U','Y'])\n for i in range(n):\n if(s[i] not in vowels):\n ret += \".\" + s[i]\n return ret\n \n def young_physicist(self):\n ret = \"NO\"\n n = int(input())\n i = n\n a = []\n x,y,z = 0,0,0\n while(i > 0):\n s = input()\n a = s.split(\" \")\n a[0], a[1], a[2] = int(a[0]), int(a[1]), int(a[2])\n x += a[0]\n y += a[1]\n z += a[2]\n i -= 1\n if(x==y and y==z and x==0):\n ret = \"YES\"\n return ret\n\n def ciel_and_dancing(self):\n s = input()\n n, m = s.split(\" \")\n n,m = int(n), int(m)\n print(n+m-1)\n for i in range(1, m+1):\n print(\"1 \"+str(i))\n for i in range(2, n+1):\n print(str(i)+\" 1\")\n\nx = Solution()\nanswer = x.main()\n# print(answer)", "def solve():\n a, b = map(int, input().split())\n\n print(a + b - 1)\n for i in range(a):\n print(i + 1, 1)\n for i in range(2, b + 1):\n print(1, i)\n\n\ndef main():\n case = 1\n # case = int(input())\n for tt in range(case):\n solve()\n\n\nif __name__ == '__main__':\n main()\n", "n, m = map(int, input().split())\r\nsongs = []\r\ncnt = 0\r\n\r\nfor i in range(1, n + 1):\r\n for j in range(1, m + 1):\r\n if i == 1 or j == 1:\r\n songs.append((i, j))\r\n cnt += 1\r\n\r\nprint(cnt)\r\nfor i, j in songs:\r\n print(i, j)\r\n", "import sys\r\n\r\ngot = list(map(int, input().split()))\r\nboys = got[0]\r\ngirls = got[1]\r\nsys.stdout.write(str(boys + girls -1) + \"\\n\")\r\nfor i in range(1, girls+1):\r\n sys.stdout.write(\"1 \" + str(i) + \"\\n\")\r\nfor i in range(2, boys + 1):\r\n sys.stdout.write(str(i) + \" 1\\n\")\r\n", "from itertools import zip_longest\r\nboys, girls = [int(x) for x in input().split()]\r\nsongsNo = boys + girls -1\r\nprint(songsNo)\r\nfor gindex in range(1,girls+1):\r\n print(\"1 \",gindex)\r\nfor bindex in range(2,boys+1):\r\n print(bindex,\" 1\")" ]

[ "from sys import exit\r\nreqhi = int(input())\r\nlst = list(map(int,input().split()))\r\ngrohi,count = 0,0\r\nwhile grohi<reqhi:\r\n if len(lst)==0:\r\n print(-1)\r\n exit()\r\n x = max(lst)\r\n grohi += x\r\n lst.pop(lst.index(x))\r\n count+=1\r\nprint(count)\r\n", "k = int(input())\ncards = list(map(int, input().split()))\ncards.sort(reverse=True)\ni = 0\nwhile k > 0 and i < 12:\n k -= cards[i]\n i += 1\nif k > 0:\n print(-1)\nelse:\n print(i)\n\t \t \t \t \t \t\t \t \t \t \t\t\t\t", "num=int(input())\nlis=list(map(int,input().split()))\nlis.sort(reverse=True)\nsap=0\ncap=0\nfor i in range(12):\n if sap>=num:\n break\n sap+=lis[i]\n cap+=1\nif sap<num:\n print(-1)\nelse:\n print(cap)\n\n \t\t \t \t \t \t \t\t \t", "n = int(input())\r\nv = sorted(map(int, input().split()))[::-1]\r\nfor i in range(13):\r\n if sum(v[:i]) >= n:\r\n print(i)\r\n exit(0)\r\nprint(-1)", "# LUOGU_RID: 101469757\nn, *a = map(int, open(0).read().split())\r\na.sort(reverse=True)\r\nfor i in range(13):\r\n if sum(a[:i]) >= n:\r\n exit(print(i))\r\nprint(-1)\r\n", "n=int(input())\narr=[int (x) for x in input().split()]\narr.sort()\narr.reverse()\nif(n==0):\n print(0)\nelse:\n s=0\n for i in range(len(arr)):\n s=s+arr[i]\n if(s>=n):\n a=i+1\n break\n if(s<n):\n print(\"-1\")\n else:\n print(a)\n\n \t\t \t\t \t\t \t\t\t\t \t \t\t\t\t\t\t", "a=int(input())\nb=list(map(int,input().split()))\nb.sort(reverse=True)\nx=0\ny=0\nfor i in range(12):\n if x>=a:\n break\n x+=b[i]\n y+=1\nif x<a:\n print(-1)\nelse:\n print(y)\n\t\t \t \t \t\t\t \t\t\t \t\t \t\t\t\t \t \t\t\t", "a=int(input())\r\nb=sorted(list(map(int, input().split())))\r\ntry:\r\n while a>0:\r\n a-=b[-1]\r\n b.pop()\r\n print(12-len(b))\r\nexcept:\r\n print(-1)", "t = int(input())\r\nx = list(map(int, input().split()))\r\nx.sort(reverse=True)\r\ntotal = 0\r\ncount = 0\r\nfor i in range(len(x)):\r\n if total < t:\r\n total += x[i]\r\n count += 1\r\nif total >= t:\r\n print(count)\r\nelse:\r\n print(-1)", "k = int(input())\r\nmonths = list(map(int,input().split()))\r\n\r\nmonths.sort(reverse=True)\r\ncount = 0\r\nresult = 0\r\n\r\nfor i in months:\r\n if sum(months) < k:\r\n count = -1\r\n break\r\n if k == 0:\r\n break\r\n result +=i\r\n if result >= k:\r\n count += 1\r\n break\r\n else:\r\n count +=1\r\n continue\r\n\r\nprint(count)\r\n\r\n \r\n", "k = int(input())\r\nl = list(map(int, input().split()))\r\nans = int()\r\ns = int()\r\nif sum(l) < k:\r\n ans = -1\r\nelse:\r\n while s < k:\r\n s += max(l)\r\n l.remove(max(l))\r\n ans += 1\r\nprint(ans)\r\n", "n=int(input())\nb=list(map(int,input().split()))\nb.sort(reverse=True)\nr=0\nd=0\nfor i in range(12):\n if r>=n:\n break\n r+=b[i]\n d+=1\nif r<n:\n print(-1)\nelse:\n print(d)\n\t \t\t\t\t\t\t\t \t\t\t \t\t \t \t\t\t", "p1=int(input())\nl1=list(map(int,input().split()))\nl1.sort(reverse=True)\ns1=0\nc1=0\nfor i in range(12):\n if s1>=p1:\n break\n s1+=l1[i]\n c1+=1\nif s1<p1:\n print(-1)\nelse:\n print(c1)\n \t\t \t \t\t\t\t \t\t\t\t\t\t \t\t\t\t\t\t", "k = int (input())\r\n\r\narr = list(map(int,input().split()))\r\n\r\narr.sort()\r\n\r\ncounter = 0\r\n\r\nfor month in arr[::-1]:\r\n if (k <= 0):\r\n break\r\n counter+=1\r\n k-=month\r\n\r\nprint(-1 if k > 0 else counter)", "k = int(input())\r\nx = 0\r\nz = 0\r\na = list(map(int, input().split()))\r\nai = sorted(a)\r\nif sum(a) < k:\r\n print(\"-1\")\r\n\r\nelif k > 0: \r\n while x < k:\r\n x += max(ai)\r\n ai.pop()\r\n z += 1\r\n print(z)\r\n \r\nelse:\r\n print(0)\r\n", "k = int(input())\r\na = sorted(list(map(int, input().split())))\r\ni = 11\r\nsumma = 0\r\nwhile i > -1 and k > summa:\r\n summa += a[i]\r\n i -= 1\r\nif k > summa:\r\n print(-1)\r\nelse:\r\n print(11-i)\r\n", "k = int(input())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\n\r\ncount = 0\r\ncurrent = 0\r\n\r\nfor index in range(len(arr) - 1, -1, -1):\r\n if current < k:\r\n current += arr[index]\r\n count += 1\r\n else:\r\n break\r\n\r\nprint(count if current >= k else -1)", "k = int(input())\r\nA = list(map(int, input().split()))\r\n\r\nA.sort(reverse=True)\r\n\r\nc = 0\r\ncount = 0\r\nfor i in range(len(A)):\r\n if c >= k:\r\n break\r\n c += A[i]\r\n count += 1\r\n\r\nif c < k:\r\n count = -1\r\n\r\nprint(count)", "s=int(input())\narr=list(map(int,input().split()))\narr.sort(reverse=True)\nc=0\nr=0\nfor i in range(len(arr)):\n if(c>=s):\n break\n c+=arr[i]\n r+=1\nif(c<s):\n print(\"-1\")\nelse:\n print(r)\n \t\t \t\t \t\t\t\t \t\t \t\t \t \t", "n=int(input())\na=sorted(map(int,input().split()))[::-1]\nfor i in range(13):\n if sum(a[:i])>=n:\n print(i)\n exit(0)\nprint(-1)\n \t \t\t \t\t\t \t\t \t \t \t \t \t", "k=int(input())\r\na=sorted(list(map(int,input().split())))[::-1]\r\ns=0\r\nans=0\r\nwhile ans<12 and s<k:\r\n s+=a[ans]\r\n ans+=1\r\nif s<k: ans=-1\r\nprint(ans)\r\n \r\n", "k, a = int(input()), (int(i) for i in input().split())\na = sorted(a, reverse=True)\nres = 0\nwhile res < len(a) and k > 0:\n k -= a[res]\n res += 1\nres = res if k <= 0 else -1\nprint(res)\n", "n = int(input())\r\nnums = sorted(list(map(int,input().split(' '))))\r\nnums = nums[::-1]\r\nz = 0\r\ni = 0\r\nfor num in nums:\r\n if z >= n:\r\n break\r\n z+=num\r\n i+=1\r\nif z < n:\r\n print(-1)\r\nelse:\r\n print(i)", "k = int(input())\r\nlistA = list(map(int,input().split(\" \")))\r\nif k == 0:\r\n print(0)\r\nelse:\r\n listA.sort()\r\n ans = 0\r\n count = 0\r\n listA = listA[::-1]\r\n for item in listA:\r\n ans +=item\r\n count += 1\r\n if (ans>=k):\r\n print(count)\r\n break\r\n else:\r\n print(-1)", "n = int(input())\r\ns = sorted(map(int, input().split()), reverse=True)\r\ni = 0\r\nif n == 0:\r\n print(0)\r\nelse:\r\n while n > 0 and i < len(s):\r\n n -= s[i]\r\n i += 1\r\n if n > 0:\r\n print(-1)\r\n else:\r\n print(i)\r\n\r\n", "n= int(input())\r\nl = list(map(int,input().split()))\r\nl.sort()\r\nl = l[::-1]\r\nnow = 0\r\nif n == 0:\r\n print(0)\r\n exit()\r\nfor i in range(12):\r\n if now + l[i] >= n: \r\n print(i+1)\r\n break\r\n now += l[i]\r\nelse:\r\n print(-1)", "n = int(input())\r\narr = [int(x) for x in input().split()]\r\narr = sorted(arr)[::-1]\r\n# print(arr)\r\ni = 0\r\nsum = 0\r\nwhile(sum < n and i < len(arr)):\r\n sum += arr[i]\r\n i+=1\r\nif sum >= n : \r\n print(i)\r\nelse:\r\n print ('-1') ", "n = int(input())\r\na = sorted(map(int,input().split()))[::-1]\r\n\r\nfor i in range(13):\r\n if (sum(a[:i])) >=n:\r\n print(i)\r\n exit()\r\nprint(-1)", "import math\r\ndef petyaflowers(k,s):\r\n alist=[int(d) for d in s.split()]\r\n alist.sort(reverse=True)\r\n if k==0:\r\n return 0\r\n elif max(alist)>k:\r\n return 1\r\n elif sum(alist)<k:\r\n return -1\r\n else:\r\n f=0\r\n while sum(alist[:f])<k and f<=len(alist):\r\n f+=1\r\n return f\r\nk=int(input())\r\ns=input()\r\nprint(petyaflowers(k,s))", "K = int(input())\r\nA = list(map(int, input().split()))\r\nA.sort()\r\ni = 11\r\nwhile K > 0 and i >= 0:\r\n\tK -= A[i]\r\n\ti -= 1\r\nif K > 0:\r\n\tprint(-1)\r\nelse:\r\n\tprint(11 - i)", "from sys import stdin\t\r\nfrom collections import Counter\r\n\r\n\r\ndef readarray(typ):\r\n return list(map(typ, stdin.readline().split()))\r\n\r\ndef readint():\r\n return int(input())\r\n\r\n\r\nk = readint()\r\narr = sorted(readarray(int))\r\n\r\nif k == 0:\r\n print(0)\r\nelse:\r\n\r\n ans = 0\r\n while arr and k > 0:\r\n k -= arr.pop()\r\n ans += 1\r\n\r\n print(ans if k <= 0 else -1)\r\n\r\n\r\n", "k=int(input())\r\na=sorted(map(int,input().split()))[::-1]\r\nfor j in range(13):\r\n if sum(a[:j])>=k:\r\n print(j)\r\n exit(0)\r\nprint(-1)\r\n", "k=int(input())\narr=list(map(int,input().split()))\nx=arr\nx.sort()\ns=0\nc=0\nx=x[::-1]\nfor i in x:\n if s>=k:\n break\n else:\n s=s+i\n c=c+1\nif s>=k:\n print(c)\nelse:\n print(-1)\n\t \t \t \t\t\t \t \t \t \t \t\t", "k = int(input())\r\ngrowth = sorted(map(int, input().split()))\r\ndays = 0\r\nif sum(growth) <k:\r\n print('-1')\r\nelse:\r\n while k > 0:\r\n days += 1\r\n k -= growth.pop(-1)\r\n print(days)\r\n", "k=int(input())\r\nlis=list(map(int,input().split()))\r\nlis.sort(reverse=True)\r\na=0\r\nwhile(k>0 and a<len(lis)):\r\n k-=lis[a]\r\n a+=1\r\nif(k>0):\r\n print(-1)\r\nelse:\r\n print(a)\r\n", "k = int(input())\r\na = list(map(int, input().split()))\r\na = sorted(a, reverse = True)\r\n\r\ntsum = sum(a)\r\nif(tsum < k):\r\n print(-1)\r\nelse:\r\n j = 0\r\n sm = 0\r\n count = 0\r\n\r\n while(sm < k):\r\n sm += a[j]\r\n count += 1\r\n j += 1\r\n\r\n print(count)", "n=int(input())\nl=[ int (x) for x in input().split()]\nl.sort(reverse=True)\n\ns=0\ncount=0\nwhile(count<len(l)and s<n):\n s+=l[count]\n count+=1\nif(s<n):\n print(-1)\nelse:\n print(count)\n #this is pavan submission\n \t \t \t\t \t \t\t\t \t\t \t\t\t \t\t \t", "req_h_of_flower = int(input(\"\"))\nmonths = [int(x) for x in input(\"\").split(\" \")]\nmonths.sort(reverse=True)\n\ncounter = 0\nif req_h_of_flower != 0:\n for month in months:\n req_h_of_flower -= month\n counter += 1\n if req_h_of_flower <= 0:\n break\n if counter == 12 and req_h_of_flower > 0:\n counter = -1\nprint(counter)\n", "k=int(input())\r\nmonths=list(map(int,input().split()))\r\nmonths.sort(reverse=True)\r\ns=0\r\ncount=0\r\n\r\nfor elements in months:\r\n if(s<k):\r\n s=s+elements\r\n count=count+1\r\nif(s>=k):\r\n print(count)\r\nelse:\r\n print(-1)", "k = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nif k == 0:\r\n print(k)\r\nelse:\r\n arr.sort(reverse=True)\r\n total = 0\r\n i = 0\r\n while i < 12:\r\n total += arr[i]\r\n i += 1\r\n if total >= k:\r\n break\r\n\r\n if i == 12 and total < k:\r\n print(-1)\r\n else:\r\n print(i)\r\n", "k=int(input())\narr=[int(x) for x in input().split()]\narr.sort()\ns=0\nif k==0:\n print(0)\nelse:\n f=0\n for i in range(11,-1,-1):\n s+=arr[i]\n if s>=k:\n print(12-i)\n f=1\n break\n if f==0:\n print(-1)\n\n\t\t \t\t\t\t \t \t\t \t \t \t \t\t\t\t \t", "k = int(input())\r\n\r\nmonths = [int(i) for i in input().split()]\r\ncount_height = 0\r\ncount_months = 0\r\nif sum(months) < k:\r\n print(-1)\r\nelif k == 0:\r\n print(0)\r\nelse:\r\n months = sorted(months)[::-1]\r\n for i in range(12):\r\n count_height += months[i]\r\n count_months += 1\r\n if count_height >= k:\r\n break\r\n print(count_months)\r\n", "k = int(input())\r\nz= sorted(list(map(int,input().split())),reverse = True)\r\n\r\ndef bt(k,z):\r\n x = 0\r\n if k == 0 :\r\n return x\r\n else :\r\n for i in z :\r\n k -= i\r\n x+=1\r\n if k<=0 :\r\n return(x)\r\n\r\n return -1\r\n\r\n\r\nprint(bt(k,z))\r\n", "n = int(input())\r\nk = [int(i) for i in input().split()]\r\nk.sort(reverse=True)\r\nc = 0\r\nh = 0\r\nfor i in k:\r\n if h < n:\r\n h += i\r\n c += 1\r\nif h < n:\r\n print(-1)\r\nelse:\r\n print(c)", "n=int(input())\nl=list(map(int,input().split()))\nl.sort(reverse=True)\ns=0\nc=0\nwhile c<=11 and s<n:\n s+=l[c]\n c+=1\nif s<n:\n print(-1)\nelse:\n print(c)\n \t\t\t \t\t \t\t\t\t\t \t \t \t\t \t", "k=int(input())\r\narr=[int(x) for x in input().split()]\r\narr.sort()\r\ns=0\r\nif k==0:\r\n print(0)\r\nelse:\r\n f=0\r\n for i in range(11,-1,-1):\r\n s+=arr[i]\r\n if s>=k:\r\n print(12-i)\r\n f=1\r\n break\r\n if f==0:\r\n print(-1)\r\n", "'''// Problem: A. Business trip\r\n// Contest: Codeforces - Codeforces Round #106 (Div. 2)\r\n// URL: https://codeforces.com/problemset/problem/149/A\r\n// Memory Limit: 256 MB\r\n// Time Limit: 2000 ms\r\n// \r\n// Powered by CP Editor (https://cpeditor.org)'''\r\n\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\ni=len(l)-1\r\nc=0\r\nd=0\r\nwhile(c<n and i>=0 ):\r\n\tc=c+l[i]\r\n\ti=i-1\r\n\td=d+1\r\nif(c<n):\r\n\tprint(-1)\r\nelse:\r\n\tprint(d)\r\n\r\n\t\r\n", "k=int(input())\r\na=list(map(int,input().split()))\r\nif k==0:\r\n print(0)\r\nelse:\r\n a.sort(reverse=True)\r\n s=0\r\n j=0\r\n for i in a:\r\n if s<k:\r\n s+=i\r\n j+=1\r\n else:\r\n break\r\n if s>=k:\r\n print(j)\r\n else:\r\n print(-1)", "a = int(input())\r\nr = 0\r\nfor x in sorted(map(int, input().split()))[::-1]:\r\n if a > 0:\r\n a -= x\r\n r += 1\r\nprint(r if a <= 0 else -1)", "k=int(input())\r\na=[int(n) for n in input().split()]\r\na=sorted(a, reverse=True)\r\nm=x=0\r\nfor i in range(12):\r\n m+=a[i]\r\n x+=1\r\n if m>=k: break\r\nif m<k: x=-1\r\nif k==0: x=0\r\nprint(x)\r\n", "from itertools import combinations\r\n\r\n\r\nif __name__ == '__main__':\r\n k = int(input())\r\n a = list(map(int, input().split()))\r\n if sum(a) < k:\r\n print(-1)\r\n else:\r\n a.sort()\r\n c = 0\r\n x = 0\r\n while x < k:\r\n x += a[11 - c]\r\n c += 1\r\n print(c)\r\n\r\n", "n = int(input())\r\nnums = list(map(int,input().split()))\r\nif n==0: print(0)\r\nelif n>sum(nums): print(-1)\r\nelse:\r\n s_nums = sorted(nums)[::-1]\r\n months = 0\r\n tot_amount = 0\r\n for i in range(12):\r\n tot_amount += s_nums[i]\r\n months+=1\r\n if tot_amount >= n:\r\n break\r\n print(months)", "num = int(input())\r\nli = list(map(int,input().split()))\r\nres = 0\r\nif num == 0:\r\n print(0)\r\nelse:\r\n li.sort(reverse=True)\r\n for i in li:\r\n num -= i\r\n res += 1\r\n if num <= 0:\r\n break\r\n if num <= 0:\r\n print(res)\r\n else:\r\n print(-1)", "a=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nc=0\r\nd=0\r\nif a>sum(l):print(-1)\r\nelse:\r\n for i in l[::-1]:\r\n if d<a:d=d+i;c+=1\r\n else:break\r\n print(c)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort(reverse=True)\r\ns=0\r\ni=0\r\nwhile s<n and i<12:\r\n s+=l[i]\r\n i+=1\r\n \r\nif s>=n:\r\n print(i)\r\nelse:\r\n print(-1)", "k = int(input())\r\na = [int(x) for x in input().split()]\r\na.sort(reverse=True)\r\nm = 0\r\nwhile m<12 and k>0:\r\n k=k-a[m] \r\n m+=1\r\n\r\nif k<1: \r\n print(m)\r\nelse: \r\n print('-1')", "IN = lambda type = int:list(map(type, input().split()))\r\n\r\nk = int(input())\r\nm = sorted(IN(), reverse = True)\r\ngrew = 0\r\ngrown = False\r\nif k != 0:\r\n for x in range(12):\r\n grew += m[x]\r\n if grew >= k: print(x+1); grown = True; break\r\n if not grown: print(-1)\r\nelse: print(0)", "\r\nn=int(input())\r\nt=list(map(int,input().split()))\r\nt.sort(reverse=True)\r\nc=0\r\na=0\r\nfor i in t:\r\n a+=i\r\n c+=1\r\n if a>=n:\r\n break\r\nif n==0:\r\n print(0)\r\nelif a<n:\r\n print(-1)\r\nelse:\r\n print(c)\r\n", "k = int(input())\r\na = list(map(int, input().split()))\r\na.sort(reverse=True)\r\nm=0\r\nif k == 0:\r\n print(0)\r\nelse:\r\n for i in a:\r\n k -= i\r\n m += 1\r\n if k<=0:\r\n break\r\n if k>0:\r\n print(-1)\r\n else:\r\n print(m)", "k = int(input())\r\na = sorted(list(map(int , input().split())))\r\ncount = 0\r\ncen = 0\r\n\r\nif k == 0:\r\n count = 0\r\nelif sum(a) < k:\r\n count = -1\r\nelse:\r\n if a[-1] >= k:\r\n count = 1\r\n else:\r\n for i in range(len(a)):\r\n cen = cen + a[-1-i]\r\n count = count + 1\r\n if cen >= k:\r\n break\r\nprint(count)", "k = int(input())\na = list(map(int, input().split(\" \")))\na.sort(reverse=True)\ni = 0\nwhile k > 0 and i < 12:\n k -= a[i]\n i += 1\nif k <= 0:\n print(i)\nelse:\n print(-1)", "\r\nk=int(input())\r\nf=0\r\na=sorted(map(int,input().split()))\r\na.reverse()\r\ni=0\r\nwhile f<k and i<12:\r\n f+=a[i]\r\n i+=1\r\nif f<k:\r\n i=-1\r\nprint(i)", "k = int(input())\r\narr = list(map(int,input().split()))\r\narr.sort(reverse=True)\r\nres = 0\r\ns = 0\r\nfor i in range(12):\r\n if s>=k: break\r\n else:\r\n s+=arr[i]\r\n res+=1\r\n\r\nif s<k: print(-1)\r\nelse: print(res)\r\n", "k =int(input(\"\"))\r\ninp = list(map(int,input().split()))\r\ninp = sorted(inp,reverse=True)\r\nday = 0\r\nif k == 0 :\r\n day = 0\r\n \r\ni=0\r\nwhile k>0:\r\n if i==len(inp) and k>0:\r\n day = -1\r\n break\r\n else:\r\n k=k-inp[i]\r\n day+=1\r\n i+=1\r\n \r\n\r\nprint(day)", "n= int(input());m=(list(map(int,input().split())));c=0;c1=0\r\nif sum(m)<n:\r\n print(-1)\r\nelse:\r\n while c<n:\r\n c1+=1\r\n c+=max(m)\r\n m.remove(max(m))\r\n print(c1)", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-12-02 23:41:36\nLastEditTime: 2021-12-03 22:14:12\nDescription: Bussiness trip\nFilePath: CF149A.py\n'''\n\n\ndef func():\n k = int(input())\n month = list(sorted((map(int, input().strip().split())), reverse=True))\n if k == 0:\n return 0\n else:\n for i in range(12):\n if sum(month[:(i + 1)]) >= k:\n return i + 1\n else:\n return -1\n\nif __name__ == '__main__':\n ans = func()\n print(ans)\n", "k = int(input())\nA = sorted(list(map(int, input().split())), reverse=True)\n\ndef solve(k,A):\n ans, x = 0, 0\n if k == 0:\n return ans\n for a in A:\n ans += 1\n x += a\n if x >= k:\n return ans\n return -1\n \nprint(solve(k,A)) \n", "n = int(input())\r\ns = list(map(int, input().split()))\r\ns.sort(reverse=True)\r\ncnt = 0\r\ntotal = 0\r\nwhile total < n and cnt < len(s):\r\n total += s[cnt]\r\n cnt += 1\r\nif total >= n:\r\n print(cnt)\r\nelse:\r\n print('-1')\r\n", "n = int(input())\nl = list(map(int,input().split()))\nl.sort(reverse=True)\nc=0\nans=0\nfor i in range(len(l)):\n if (c>=n):\n break\n c+=l[i]\n ans+=1 \nif(c<n):\n print(\"-1\")\nelse:\n print(ans)\n \t \t\t \t\t\t \t \t \t \t \t", "k=int(input())\ns=list(map(int,input().split()))\ns.sort(reverse=True)\ncount=0\ntemp=0\nfor i in s:\n\tif temp<k:\n\t\ttemp+=i\n\t\tcount+=1\n\telse:\n\t\tbreak\nif temp<k:\n\tcount=-1\nprint(count)\n\t", "k = int(input())\r\n\r\ngrowth = list(map(int, input().split()))\r\n\r\ndef dp(i = 0, n = k):\r\n if n < 1:\r\n return 0\r\n if i >= 12:\r\n return float(\"inf\") \r\n \r\n return min(1 + dp(i + 1, n - growth[i]), dp(i + 1, n))\r\n\r\nstatus = dp()\r\n\r\nif status == float(\"inf\"):\r\n print(-1)\r\nelse:\r\n print(status)\r\n \r\n\r\n", "k=int(input())\r\nl=list(map(int,input().split(\" \")))\r\nl.sort()\r\ndef rem(k,l):\r\n if k<=0:\r\n return 0\r\n if len(l)==0:\r\n if k>0:\r\n return 1\r\n else:\r\n return 0\r\n else:\r\n return 1+rem(k-l[-1],l[:len(l)-1])\r\nif rem(k,l)<=12:\r\n print(rem(k,l))\r\nelse:\r\n print(-1)", "t=int(input())\nn=list(map(int,input().split()))\nsum=0\nn.sort()\nn.reverse()\ni=0\nh=1\nwhile(sum<t):\n if(i==12):\n print(-1)\n h=0\n break\n sum=sum+n[i]\n i+=1\nif(h):\n print(i)\n", "h = int(input())\r\nv = list(map(int,input().split()))\r\n\r\nv = sorted(v, reverse=True)\r\nsoma = 0\r\ncount = 0\r\nfor i in v:\r\n if(h == 0):\r\n break\r\n count+=i\r\n soma+=1\r\n \r\n if(count >= h):\r\n break\r\n\r\nif(count < h):\r\n print(-1)\r\nelse:\r\n print(soma)\r\n\r\n", "k = int(input())\na = sorted(list(map(int, input().split())))\nres = 0\nwhile a and k > 0:\n res += 1\n k -= a.pop()\nprint(-1 if k > 0 else res)\n", "k = int(input())\r\nm = list(map(int, input().split()))\r\ns = 0\r\nc = 0\r\nif k == 0:\r\n print(0)\r\nelse:\r\n for i in range(12):\r\n s += max(m)\r\n m.remove(max(m))\r\n if s >= k:\r\n print(i+1)\r\n break\r\n else:\r\n print(-1)", "k=int(input())\r\na=[int(i) for i in input().split()]\r\nc=0\r\nwhile k>0 and c<12:\r\n z=max(a)\r\n k-=z\r\n z1=a.index(z)\r\n a.pop(z1)\r\n c+=1\r\nif k<=0:\r\n print(c)\r\nelse :\r\n print(-1)", "k=int(input())\na=list(map(int,input().split()))\nb=sorted(a,reverse=True)\n\nif sum(a)<k:\n print(-1)\nelse:\n suma=0\n br=0\n for i in b:\n if suma<k:\n suma+=i\n br+=1\n if suma>=k:\n break\n\n print(br)\n\n\t\t\t \t\t \t \t \t \t\t\t\t \t \t\t \t", "k = int(input())\r\nm = sorted([int(i) for i in input().split()])[::-1]\r\n\r\ni= 0\r\nwhile i<12 and k>0:\r\n k-=m[i]\r\n i+=1\r\n\r\nif k>0:\r\n print(-1)\r\nelse:\r\n print(i)\r\n\r\n\r\n\r\n", "def solve():\r\n k = int(input())\r\n ai = [int(i) for i in input().split()]\r\n if sum(ai) < k:\r\n print(-1)\r\n return\r\n ai = sorted(ai, reverse=True)\r\n sm = 0\r\n cnt = 0\r\n while sm < k:\r\n sm = sm + ai[cnt]\r\n cnt = cnt + 1\r\n print(cnt)\r\n \r\n \r\nsolve()", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort(reverse=True)\r\ns=0\r\na=0\r\nwhile(s<n and a<len(l)):\r\n s+=l[a]\r\n a+=1\r\nif(s<n):\r\n print(-1)\r\nelse:\r\n print(a)", "def main():\n minimum_length_to_grow = int(input())\n monthly_growth = input().split()\n for i in range(len(monthly_growth)):\n monthly_growth[i] = int(monthly_growth[i])\n monthly_growth.sort()\n total = 0\n months = 0\n while monthly_growth != [] and total < minimum_length_to_grow:\n total += monthly_growth.pop()\n months += 1\n if total >= minimum_length_to_grow:\n print(months)\n else:\n print(-1)\nmain()\n", "k=int(input())\r\nli=list(map(int,input().strip().split()))\r\nli.sort(reverse=True)\r\ni=0\r\nn=len(li)\r\ns=0\r\nwhile i<n and s<k:\r\n s+=li[i]\r\n i+=1\r\nif i==n and s<k:\r\n print(-1)\r\nelse:\r\n print(i)\r\n\r\n", "\n\nn = int(input())\n\ns = list(map(int, input().split()))\ns.sort()\ns= s[::-1]\n\nans =0\n\nwhile n>0 and ans<len(s):\n n-= s[ans]\n ans+=1\nif n<=0:\n print(ans)\nelse:\n print(-1)\n", "k=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort(reverse=True)\r\nc=0\r\nflag=0\r\nwhile k>0:\r\n k-=l.pop(0)\r\n c+=1\r\n if len(l)==0:\r\n flag=1\r\n break\r\nif flag==0 or k<=0:\r\n print (c)\r\nif flag==1 and k>0:\r\n print (-1)", "k = int(input())\r\na = list(map(int, input().split()))\r\na = sorted(a)\r\na = a[::-1]\r\nif sum(a) < k:\r\n\tprint(-1)\r\nelif k == 0:\r\n\tprint(0)\r\nelse:\r\n\ts = 0\r\n\tc = 0\r\n\tfor i in range(12):\r\n\t\ts += a[i]\r\n\t\tc += 1\r\n\t\tif s >= k:\r\n\t\t\tprint(c)\r\n\t\t\tbreak\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nk = int(input())\r\na = list(map(int, input().split()))\r\na.sort(reverse = True)\r\nans, s = 0, 0\r\nfor i in a:\r\n if s >= k:\r\n break\r\n s += i\r\n ans += 1\r\nif s < k:\r\n ans = -1\r\nprint(ans)", "k = int(input())\r\narr = sorted(list(map(int, input().split())), reverse=True)\r\ncount = 0\r\nans = 0\r\ni = 0\r\nwhile i < 12 and count < k:\r\n count += arr[i]\r\n ans += 1\r\n i += 1\r\nif count >= k:\r\n print(ans)\r\nelse:\r\n print(-1)\r\n ", "n = int(input())\r\nif n == 0:\r\n print(0)\r\nelse:\r\n cnt = 0\r\n a = list(sorted(map(int, input().split()),reverse=True))\r\n idx = 1\r\n for i in a:\r\n cnt += i\r\n if cnt >= n:\r\n print(idx)\r\n break\r\n idx += 1\r\n else:\r\n print(-1)", "a=int(input())\np=list(map(int,input().split()))\np.sort(reverse=True)\ns=0\nc=0\nfor i in range(12):\n if s>=a:\n break\n s+=p[i]\n c+=1\nif s<a:\n print(-1)\nelse:\n print(c)\n\t\t\t\t \t\t \t\t \t \t\t\t\t \t\t\t\t\t \t", "m=int(input())\r\nlst=list(map(int,input().split()))\r\nlst.sort(reverse=True)\r\ncount=0\r\nres=0\r\nfor i in range(len(lst)):\r\n if(count>=m):\r\n break\r\n count+=lst[i]\r\n res+=1\r\nif(count<m):\r\n print(\"-1\")\r\nelse:\r\n print(res)", "a=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\ni=11\r\nsum=0\r\nwhile i>=0 and sum<a :\r\n sum=sum+l[i]\r\n i=i-1\r\nif sum<a:\r\n print(-1)\r\nelse:\r\n print(11-i) \r\n\r\n\r\n", "k = int(input())\r\narr = list(map(int,input().split()))\r\n\r\nsort = sorted(arr,reverse=True)\r\n\r\nif sum(arr)<k:\r\n\tprint(-1)\r\nelif k==0:\r\n\tprint(0)\r\nelse:\r\n\tans = 0\r\n\tres = 0\r\n\tfor i in sort:\r\n\t\tans+=i\r\n\t\tres+=1\r\n\t\tif ans>=k:\r\n\t\t\tbreak\r\n\tprint(res)", "k = int(input())\r\nl = list(map(int,input().split()))\r\n\r\nl.sort(reverse=True)\r\n\r\n\r\nif k==0:\r\n print(0)\r\nelif sum(l)<k:\r\n print(-1)\r\n\r\nelse:\r\n sumx = 0\r\n\r\n for i in range(len(l)):\r\n sumx+= l[i]\r\n if sumx>=k:\r\n print(i+1)\r\n break\r\n\r\n", "k=int(input())\r\nm=input().split(\" \")\r\nmonths=[]\r\na=0\r\nb=0\r\nfor i in m:\r\n months.append(int(i))\r\nmonths.sort(reverse=True)\r\nif k>sum(months):\r\n print(-1)\r\nelse:\r\n for i in months:\r\n if k>a:\r\n a+=i\r\n b+=1\r\n else:\r\n break\r\n print(b)", "# LUOGU_RID: 114828740\nk=int(input())\r\nif k==0:\r\n print(0)\r\n exit(0)\r\nalist=list(map(int,input().split()))\r\nalist.sort(reverse=True)\r\ncount=0\r\nfor i in alist:\r\n k=k-i\r\n count+=1\r\n if k<=0:\r\n print(count)\r\n break\r\nelse:\r\n print(-1)\r\n", "k=int(input())\r\nl=list(map(int,input().split()))\r\nl=sorted(l)\r\nc=0\r\ns=0\r\nif(k==0):\r\n print(0)\r\n exit()\r\nfor i in range(1,len(l)+1):\r\n s+=l[-i]\r\n c+=1\r\n if(s>=k):\r\n print(c)\r\n exit()\r\nprint(-1)\r\n", "k = int(input())\r\na = sorted(map(int, input().split()), reverse=True)\r\ncount = 0\r\nfor x in a:\r\n if k <= 0:\r\n break\r\n k -= x\r\n count += 1\r\nif k > 0:\r\n print(-1)\r\nelse:\r\n print(count)\r\n", "n=int(input())\nl=[int(x) for x in input().split()]\nl.sort()\ns=0\nc=0\nwhile(s<n and len(l)>0):\n s=s+l.pop()\n c=c+1 \nif(s>=n):\n print(c)\nelse:\n print(\"-1\")\n\t\t\t \t \t\t\t\t\t\t \t \t \t", "n=int(input())\r\nlst=list(map(int,input().split()))\r\nlst.sort(reverse=True)\r\ncount=0\r\nres=0\r\nfor i in range(len(lst)):\r\n if(count>=n):\r\n break\r\n count+=lst[i]\r\n res+=1\r\nif(count<n):\r\n print(\"-1\")\r\nelse:\r\n print(res)", "N=int(input())\nc=0\nli=list(map(int,input().split()))\nli.sort(reverse=True)\ni=0\nsum=0\nwhile sum<N and i<len(li):\n\tsum=sum+li[i]\n\ti+=1\nif sum<N:\n\tprint(-1)\nelse:\n\tprint(i)\n \t\t \t \t\t\t\t\t\t\t \t\t \t \t\t\t\t \t", "k = int(input())\r\na = list(map(int, input().split()))\r\na.sort(reverse=True)\r\n\r\nadd = 0\r\ncount = 0\r\n\r\nfor i in a:\r\n if add < k:\r\n add += i\r\n count += 1\r\n if add >= k:\r\n break\r\n elif count == len(a) and add < k:\r\n count = -1\r\n\r\nprint(count)\r\n", "x = int(input())\r\ny = list(map(int,input().split()))\r\nl = len(y)\r\ny.sort(reverse = True)\r\ni = 0\r\nj = 0\r\nwhile(j<x and i<l):\r\n j = j+y[i]\r\n i = i+1\r\n\r\nif (j>=x):\r\n print(i)\r\nelse:\r\n print(\"-1\")", "k=int(input())\r\nm=map(int,input().split())\r\nl = []\r\nfor x in m :\r\n l.append(x)\r\nl.sort()\r\nl.reverse()\r\nc = 0\r\nres=0\r\nif sum(l)<k : \r\n res=-1\r\nelse: \r\n for x in l : \r\n if c<k : \r\n c+=x\r\n res+=1\r\n else : \r\n break\r\n\r\nprint(res)\r\n \r\n \r\n ", "k = int(input())\r\n\r\nmonths = sorted([int(thing) for thing in input().split()])\r\ninitlen = len(months)\r\ncount = 0\r\nsums = 0\r\nwhile sums < k and count < initlen:\r\n count += 1\r\n sums += months.pop(-1)\r\nif sums >= k:\r\n print(count)\r\nelse:\r\n print(-1)", "z=int(input())\na=list(map(int,input().split()))\na.sort(reverse=True)\nx=0\ny=0\nfor i in range(12):\n\tif x>=z:\n\t\tbreak\n\tx+=a[i]\n\ty+=1\nif x<z:\n\tprint(-1)\nelse:\n\tprint(y)\n\t \t \t \t \t \t\t \t\t \t \t\t \t", "nee=int(input())\nlaa=list(map(int,input().split()))\nlaa.sort(reverse=True)\nx=0\ncoo=0\nfor i in range(12):\n\tif x>=nee:\n\t\tbreak\n\tx+=laa[i]\n\tcoo+=1\nif x<nee:\n\tprint(-1)\nelse:\n\tprint(coo)\n\t \t \t\t\t\t \t\t\t\t\t\t \t\t\t \t \t \t", "k=int(input())\r\na=list(map(int,input().split()))\r\nans=0\r\nan=0\r\nl=sorted(a,reverse=True)\r\nindex=0\r\nif sum(a)<k:\r\n print(-1)\r\nelse:\r\n\r\n while an<k:\r\n\r\n an+=l[index]\r\n index+=1\r\n ans+=1\r\n print(ans)\r\n\r\n\r\n\r\n\r\n", "k=int(input())\r\nlst=list(map(int,input().split()))\r\nlst.sort()\r\nn=len(lst)\r\nans=0\r\ns=0\r\nfor i in range(n-1,-1,-1):\r\n if s>=k:\r\n break\r\n s+=lst[i]\r\n ans+=1\r\nif s>=k:\r\n print(ans)\r\nelse:\r\n print(-1)", "k=int(input())\r\na = list(map(int, input().split()))\r\nm=0\r\nx=0\r\na=sorted(a,reverse=True)\r\nfor i in range(12):\r\n m+=a[i]\r\n x+=1\r\n if m>=k:\r\n break\r\nif m<k:\r\n x=-1\r\nif k==0:\r\n x=0\r\nprint(x)\r\n", "#n, m = (input().split())\r\n#n, m = int(n), int(m)\r\nn = int(input())\r\na = input()\r\na = a.split()\r\na = [int(x) for x in a] \r\na.sort(reverse = True)\r\ni = 0\r\nwhile n > 0:\r\n n -= a[i]\r\n i += 1\r\n if i == 12 and n > 0:\r\n print(-1)\r\n exit()\r\n \r\n \r\n\r\n \r\n\r\n \r\nprint(i)", "k=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort(reverse=True)\r\nsum=0\r\nm=0\r\n\r\nfor i in l:\r\n\r\n if sum>=k:\r\n break\r\n elif sum<k:\r\n sum+=i\r\n m+=1\r\n \r\nif (m==12 and sum<k):\r\n m=-1\r\nprint(m)", "k=int(input())\na=list(map(int,input().split()))\na.sort(reverse=True)\ns=0\nif k>sum(a):\n count=-1\nelse:\n count=0 \n for i in range(len(a)):\n if s<k:\n s=s+a[i]\n count=count+1\nprint(count)\n\n \n \n\n \t\t\t \t \t \t\t \t \t \t \t \t", "m = int(input())\ncds = list(map(int, input().split()))\ncds.sort(reverse=True)\nb = 0\nwhile m > 0 and b < 12:\n m -= cds[b]\n b += 1\nif m > 0:\n print(-1)\nelse:\n print(b)\n\t \t \t\t \t \t \t \t \t \t\t \t\t\t\t\t", "n=int(input())\n\nlst=[int(i) for i in input().split()]\nflag=0\nlst.sort(reverse=True)\nif(n==0):\n print(0)\nelse:\n x=0\n for i in range(12):\n for j in range(12):\n y=0\n z=0\n for k in range(i,j+1):\n y=y+lst[k]\n if(y>=n):\n print(z+1)\n flag=1\n break\n else:\n x=1\n z+=1\n if(flag==1):\n break\n if(flag==1):\n break\n \n \n if(flag!=1 and x==1):\n print(-1)\n\t\t \t\t \t \t\t \t\t \t\t\t \t \t", "k = int(input())\r\na = list(map(int, input().split()))\r\nans = 0\r\nif k != 0:\r\n a.sort(reverse=True)\r\n i = 0\r\n while k > 0 and i < len(a):\r\n ans += 1\r\n k -= a[i]\r\n i += 1\r\n if k > 0:\r\n ans = -1\r\nprint(ans) ", "k=int(input())\r\narr=list(map(int,input().split()))\r\n\r\narr.sort(reverse=True)\r\n\r\nmonths=0\r\ntotal=0\r\nfor i in range(12):\r\n if total>=k:\r\n break\r\n total+=arr[i]\r\n months+=1\r\n\r\n\r\nif k==0:\r\n print(0)\r\nelif sum(arr)<k:\r\n print(-1)\r\nelse:\r\n print(months)", "a = int(input())\r\nb = list(map(int, input().split()))\r\nb.sort(reverse=True)\r\nx = 0\r\ni = 0\r\n\r\nwhile i < len(b) and x < a:\r\n x += b[i]\r\n i += 1\r\n\r\nif x >= a:\r\n print(i)\r\nelse:\r\n print(\"-1\")", "k=int(input())\r\ns=list(map(int,input().split()))\r\ns.sort(reverse=True)\r\ncount=0\r\ntemp=0\r\nfor i in s:\r\n\tif temp<k:\r\n\t\ttemp+=i\r\n\t\tcount+=1\r\n\telse:\r\n\t\tbreak\r\nif temp<k:\r\n\tcount=-1\r\nprint(count)", "n = int(input())\n\narr = list(map(int, input().split(\" \")))\narr.sort()\nif(sum(arr)<n):\n print(-1)\nelse:\n min = 0\n i = len(arr)-1\n count = 0\n while min<n:\n min+=arr[i]\n i-=1\n count+=1\n \n print(count)", "k=int(input())\r\na=sorted(list(map(int,input().split())))\r\ni=11\r\nj=0\r\nsum=0\r\nwhile(sum<k and i>=0):\r\n sum=sum+a[i]\r\n i-=1\r\n j+=1\r\nif sum<k:\r\n print(-1)\r\nelse:\r\n print(j)\r\n \r\n", "k=int(input())\r\narray=list(map(int ,input().split()))\r\ncount=0\r\nif(k==0):\r\n print(0)\r\nelse:\r\n array.sort()\r\n array.reverse()\r\n for i in array:\r\n k-=i\r\n count+=1\r\n if(k<=0):\r\n print(count)\r\n break\r\n else:\r\n print(-1) ", "def ii(): return int(input())\r\ndef si(): return input()\r\ndef mi(): return map(int,input().split())\r\ndef msi(): return map(str,input().split())\r\ndef li(): return list(mi())\r\n\r\nk=ii()\r\nmo=li()\r\n\r\nif sum(mo)<k:\r\n print(-1)\r\n \r\nelse:\r\n mo.sort(reverse=True)\r\n cnt=0\r\n i=0\r\n \r\n while k>0:\r\n cnt+=1\r\n \r\n if k>mo[i]:\r\n k-=mo[i]\r\n i+=1\r\n \r\n else:\r\n k=0\r\n \r\n print(cnt)\r\n ", "k = int(input())\r\nlis = list(map(int,input().split()))\r\nlis.sort()\r\nsum = 0\r\nmonth = 0\r\nfor i in range(11,-1,-1):\r\n if sum >=k:\r\n break\r\n sum += lis[i]\r\n month += 1\r\nif sum>=k:\r\n print(month)\r\nelse:\r\n print(-1)", "k = int(input())\r\nif k == 0:\r\n print(0)\r\nelse:\r\n a = list(map(int, input().split()))\r\n a.sort(reverse=True)\r\n growth = 0\r\n months = 0\r\n for height in a:\r\n growth += height\r\n months += 1\r\n if growth >= k:\r\n print(months)\r\n break\r\n else:\r\n print(\"-1\")\r\n", "k=int(input())\na=list(map(int,input().split()))\na=list(sorted(a))\na=list(reversed(a))\nflag=0\nsum1=0\nc=0\nif k==0:\n print(0)\nelse:\n for i in range(len(a)):\n sum1+=a[i]\n c+=1\n if sum1>=k:\n flag=1\n break\n if flag==1:\n print(c)\n else:\n print(-1)\n\n \t\t \t \t \t\t\t \t \t \t\t\t", "k=int(input())\na=list(map(int,input().split()))\na.sort(reverse=True)\nx=0\ny=0\nfor i in range(12):\n\tif x>=k:\n\t\tbreak\n\tx+=a[i]\n\ty+=1\nif x<k:\n\tprint(-1)\nelse:\n\tprint(y)\n \t \t \t \t\t\t\t\t \t \t \t \t\t \t\t", "def check(a, n):\n for i in range(12):\n for j in range(12):\n s = c = 0\n for k in range(i, j+1):\n s += a[k]\n if s >= n:\n return c+1\n else:\n c += 1\n return -1\n\n\nn = int(input())\na = list(map(int, input().split()))\na.sort(reverse=True)\nprint(0 if n == 0 else check(a, n))\n\n \t \t\t \t \t\t\t \t \t \t\t", "k=int(input())\r\nli=list(map(int,input().split()))\r\nli.sort(reverse=True)\r\ncount=0\r\ni=0\r\nsu=sum(li)\r\nif su<k:\r\n print(-1)\r\nelse:\r\n while k>0 and i<12:\r\n count+=1\r\n k-=li[i]\r\n i+=1\r\n print(count)\r\n", "k = int(input())\r\na = list(map(int, input().split()))\r\na.sort(reverse=True)\r\ns = 0\r\ncnt = 0\r\nwhile s < k and cnt < 12:\r\n s += a[cnt]\r\n cnt += 1\r\nif s < k:\r\n print(-1)\r\nelse:\r\n print(cnt)\r\n", "import sys \r\ninput = sys.stdin.readline \r\nk = int(input())\r\nl = sorted(map(int, input().split()), reverse= True )\r\nnumber = 1\r\nif k == 0 :\r\n print(0)\r\nelse : \r\n for i in range(12):\r\n if k > l[i] : \r\n number += 1\r\n else :\r\n print(number)\r\n break\r\n k -= l[i]\r\n else : \r\n print(-1)", "k = int(input())\nmonths = sorted(map(int,input().split()),reverse=1)\nc = 0 \nfor m in months:\n if k <1 :\n break\n k-=m\n c+=1\nprint(c if k <1 else -1)\n", "k = int(input())\r\na = list(map(int,input().split(\" \")))\r\nx = sorted(a,reverse=True)\r\ncount = 0\r\nsumm = 0\r\nfor i in range(0,len(x)):\r\n summ += x[i]\r\n count += 1\r\n if(summ>=k):break\r\nif(summ<k):\r\n print(\"-1\")\r\nelif(k==0):\r\n print(\"0\")\r\nelse:\r\n print(count)", "k = int(input())\r\nnumbers = tuple(sorted(int(i) for i in input().split())) \r\ntotal = 0\r\ni = len(numbers) - 1\r\n\r\nwhile k > 0 and i > -1:\r\n k -= numbers[i]\r\n total += 1\r\n i -= 1\r\n \r\nif k > 0:\r\n print(-1)\r\nelse:\r\n print(total)\r\n \r\n ", "n = int(input())\r\nLST = list(sorted(map(int, input().split()), reverse=True))\r\n \r\nSUM = 0\r\ni = 0\r\nwhile i < 12 and SUM < n:\r\n SUM += LST[i]\r\n i += 1\r\n \r\nif SUM >= n:\r\n print(i)\r\nelse:\r\n print(-1) ", "n=int(input())\r\narr=list(map(int,input().split()))\r\narr=sorted(arr)[::-1]\r\nif sum(arr)<n:\r\n print(-1)\r\nelse:\r\n c=0\r\n i=0\r\n while c<n:\r\n c+=arr[i]\r\n i+=1\r\n print(i)", "k = int(input())\r\n\r\ns = list(map(int,input().split()))\r\n\r\ns.sort(reverse = True)\r\n\r\nc = 0\r\np = 0\r\nwhile(p<k and c<len(s)):\r\n\tp += s[c]\r\n\tc += 1\r\nif(p<k):\r\n\tprint(-1)\r\nelse:\r\n\tprint(c)\r\n\r\n", "k=int(input())\na=list(map(int,input().split()))\nif(k==0):\n print(0)\nelif(sum(a)<k):\n print(-1)\nelse:\n a.sort()\n s1=0\n for i in range(11,-1,-1):\n s1+=a[i]\n if(s1>=k):\n break\n print(12-i)\n \n\t \t\t\t \t \t\t\t\t\t \t \t\t\t\t", "x = int(input())\nl = list(map(int, input().split()))\nl = sorted(l, reverse=True)\nc, k = 0, 0\nif(x==0):\n\tprint(0)\nelse:\n\tfor i in range(len(l)):\n\t\tc += l[i]\n\t\tif(c>=x):\n\t\t\tk += 1\n\t\t\tprint(k)\n\t\t\tf = 0\n\t\t\tbreak\n\t\telse:\n\t\t\tk += 1\n\t\t\tf = 1\n\tif(f):\n\t\tprint(-1)\n\t\t\n\t\t \t\t \t\t\t \t \t \t \t \t", "n=int(input())\nl=list(map(int,input().split()))\nl.sort(reverse=True)\ns=0\nx=0\nwhile(s<n and x<len(l)):\n s+=l[x]\n x+=1\nif(s<n):\n print(-1)\nelse:\n print(x)\n \t \t\t \t \t\t\t\t \t\t \t\t \t \t\t\t\t\t", "a=int(input())\r\nl=[int(i) for i in input().split()]\r\nl.sort()\r\nl=l[-1::-1]\r\ns=0\r\ni=0\r\nwhile a>s and i<len(l):\r\n s+=l[i]\r\n i+=1\r\nif a>s:\r\n print(\"-1\")\r\nelse:\r\n print(i)", "inp=lambda:map(int,input().split())\nt = int(input())\nl = list(inp())\n\ns = sorted(l)\nsr = s[::-1]\n\nsum,count = 0, 0\n\nfor i in range(0,12):\n if sum>=t:\n break\n else:\n sum += sr[i]\n count += 1\n continue\nif t>sum:\n print(-1)\nelse:\n print(count)\n\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\ns=0\r\nc=0\r\nif(n==0):\r\n print(0)\r\n exit()\r\narr.sort(reverse=True)\r\nfor i in range(len(arr)):\r\n s+=arr[i]\r\n c+=1\r\n if(s>=n):\r\n break \r\nif(s<n):\r\n print(-1)\r\nelse:\r\n print(c)", "#149A - Business trip\r\nx,y,a,k=int(input()),sorted(list(map(int,input().split())))[::-1],0,True\r\nfor i in range(12):\r\n a+=y[i]\r\n if a>=x:\r\n k=False\r\n if x==0:\r\n print(0)\r\n break\r\n print(i+1)\r\n break\r\nif k==True:\r\n print(-1)", "k = int(input())\r\na = list(map(int, input().split()))\r\nans = False\r\ntotal = 0\r\np = 0\r\na = sorted(a)\r\na = a[::-1]\r\nfor i in a:\r\n\ttotal = total + i\r\n\tp = p + 1\r\n\tif total >= k:\t\r\n\t\tans = True\r\n\t\tbreak\r\nif k == 0:\r\n\tprint(0)\r\nelse:\r\n\tif ans == True:\r\n\t\tprint(p)\r\n\telse:\r\n\t\tprint(-1)\r\n\r\n", "number=int(input())\na=list(map(int,input().split()))\na.sort(reverse=True)\ns=0\nc=0\nfor i in range(12):\n if s>=number:\n break\n s+=a[i]\n c+=1\nif s<number:\n print(-1)\nelse:\n print(c)\n \t\t\t\t \t \t \t\t \t \t \t \t\t \t\t\t\t", "import sys\r\n \r\ndef LI(): return list(map(int, sys.stdin.readline().strip().split()))\r\n\r\ndef main():\r\n k = int(input())\r\n a = sorted(LI(), reverse=True)\r\n ans = 0\r\n accum = 0\r\n for x in a:\r\n if accum >= k:\r\n break\r\n ans += 1\r\n accum += x\r\n \r\n print(\"-1\" if accum < k else str(ans))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "k = int(input())\r\nlst = list(map(int, input().split()))\r\nht = 0\r\nlst.sort(reverse=True)\r\ni = 0\r\nif sum(lst) < k:\r\n print(-1)\r\nelse:\r\n while ht < k and i < 12:\r\n ht += lst[i]\r\n i += 1\r\n print(i)", "\r\na = int(input())\r\nl = list(map(int,input().split()))\r\nl.sort()\r\nre = l[::-1]\r\nr = 0\r\nfor i in re:\r\n if a > 0:\r\n a-= i\r\n r += 1\r\nif a <= 0:\r\n print(r)\r\nelse:\r\n print(-1)\r\n ", "k = int(input())\narr = [int(i) for i in input().split()]\narr.sort(reverse = True)\nsums = 0\ni = 0\nwhile i < 12:\n sums += arr[i]\n if sums >= k:\n break \n i += 1 \nif i >= 12:\n print(-1)\nelif k == 0:\n print(0)\nelse:\n print(i + 1)\n \t\t \t \t\t\t \t \t\t \t \t\t\t\t", "k = int(input())\ncard_quantities = list(map(int, input().split()))\n\n# Sort the card quantities in descending order\ncard_quantities.sort(reverse=True)\n\ntotal_cards = 0\nnum_months = 0\n\nif k == 0:\n print(0)\nelse:\n for quantity in card_quantities:\n total_cards += quantity\n num_months += 1\n\n if total_cards >= k:\n print(num_months)\n break\n\n if total_cards < k:\n print(-1)\n\n \t\t\t \t \t \t\t\t \t \t \t\t\t \t", "n=int(input())\ncount=0\n\nl=list(map(int,input().split()))\nl.sort(reverse=True)\ni=0\n\nsum=0\nwhile sum<n and i<len(l):\n\tsum=sum+l[i]\n\ti+=1\n\nif sum<n:\n\tprint(-1)\nelse:\n\tprint(i)\n\t \t\t\t\t\t \t \t\t \t\t\t \t\t\t\t \t \t", "a1=int(input())\nb1=list(map(int,input().split()))\nb1=list(sorted(b1))\nb1=list(reversed(b1))\nc1,d1=0,0\nx1=0\nif a1==0:\n print(0)\nelse:\n for i in range(len(b1)):\n d1+=b1[i]\n x1+=1\n if d1>=a1:\n c1=1\n break\n if c1==1:\n print(x1)\n else:\n print(-1)\n\t\t \t\t \t \t \t\t \t\t\t\t \t \t\t", "k = int(input())\r\nl = sorted(list(map(int,input().split())))[::-1]\r\ns = 0\r\ni = 0\r\nwhile(s < k and i < 12):\r\n s += l[i]\r\n i += 1\r\nif(s < k):\r\n print(-1)\r\nelse:\r\n print(i)", "n = int(input())\r\na = sorted(list(map(int, input(). split())))[::-1]\r\nans = 0\r\nkol = 0\r\nfor i in range(len(a)):\r\n if ans >= n:\r\n break\r\n else:\r\n ans += a[i]\r\n kol += 1\r\nif ans < n:\r\n print(-1)\r\nelse:\r\n print(kol)\r\n", "def solve(arr, k):\r\n for i in range(12):\r\n k-=arr[i]\r\n if k<=0:\r\n return i+1\r\n if k>0:\r\n return -1\r\n return 12\r\n \r\n\r\nk=int(input())\r\narr=list(map(int, input().split()))\r\nif k==0:\r\n print(0)\r\nelse:\r\n print(solve(sorted(arr, reverse=True), k))", "k=int(input())\r\ns=sorted(map(int,input().split()))[::-1]\r\nfor i in range(13):\r\n if sum(s[:i])>=k:\r\n print(i)\r\n exit(0)\r\nprint(-1)", "n = int(input())\r\nar = sorted(list(map(int, input().split())))\r\ncnt = 0\r\nwhile n > 0:\r\n if not ar and cnt:\r\n cnt = -1\r\n break\r\n n -= ar.pop()\r\n cnt += 1\r\nprint(cnt)\r\n", "k = int(input())\r\na = input()\r\n\r\n\r\na = a.split(\" \")[0:12]\r\na = [int(x) for x in a]\r\n\r\ncount = 0\r\ntotal = 0\r\n\r\nwhile total < k and len(a) > 0:\r\n maxa = -1\r\n j = 0\r\n for i in range(len(a)):\r\n if a[i] > maxa:\r\n j = i\r\n maxa = a[i]\r\n \r\n del a[j]\r\n \r\n total += maxa\r\n count += 1\r\n\r\nif total < k:\r\n print(-1)\r\nelse:\r\n print(count)", "k=int(input())\r\nb = list(map(int,input().split()))\r\nb.sort(reverse=True)\r\nj=0\r\nfor i in b:\r\n if k>0:\r\n k=k-i\r\n j=j+1\r\nif k>0:\r\n print(-1)\r\nelse:\r\n print(j)\r\n", "from collections import deque\r\nimport math\r\nfrom random import randint as rand\r\nfrom functools import lru_cache\r\nimport string\r\nalph_l = string.ascii_lowercase\r\nalph_u = string.ascii_uppercase\r\n\r\n\r\n\r\n\r\ndef main():\r\n k = int(input())\r\n a = list(map(int, input().split()))\r\n a.sort(reverse=True)\r\n cnt = 0\r\n curr_sum = 0\r\n if k == 0:\r\n print(0)\r\n elif k > sum(a):\r\n print(-1)\r\n else:\r\n for i in range(12):\r\n curr_sum += a[i]\r\n cnt += 1\r\n if curr_sum >= k:\r\n break\r\n print(cnt)\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "num=int(input())\nar=list(map(int,input().split()))\ncount=0\ncount1=0\nar.sort()\nfor i in reversed(range(12)):\n if count<num:\n count+=ar[i]\n count1+=1\nif count<num:\n count1=0\nif count1==0 and num!=0:\n print(-1)\nelse:\n print(count1)\n\t\t \t \t\t \t\t \t \t \t \t\t\t\t\t \t\t", "k = int (input ())\r\narray = sorted (tuple (map (int, input ().split (' '))))\r\ngrowth = 0\r\nn = 0\r\nwhile growth < k:\r\n if n == 12:\r\n n = -1\r\n break\r\n growth += array [11 - n]\r\n n += 1\r\nprint (n)\r\n", "k = int(input())\r\na = sorted(list(map(int,input().split())),reverse=True)\r\nn= len(a)\r\nres = 0\r\nif k==0:\r\n print(0)\r\n quit()\r\n\r\nfor i in range(n):\r\n res+=a[i]\r\n if res>=k:\r\n print(i+1)\r\n quit()\r\n\r\nprint(-1)\r\n", "k = int(input())\ngrowth = list(map(int, input().split()))\ngrowth.sort(reverse=True)\n\ntotal_growth = 0\ncounter = 0\nwhile counter < 12 and total_growth < k:\n total_growth += growth[counter]\n counter += 1\n\nif total_growth < k:\n print(-1)\nelse:\n print(counter)\n", "e=int(input())\nl=list(map(int,input().split()))\nl.sort(reverse=True)\nk=0 \nf=0 \nfor i in range(12):\n if k>=e:\n break\n k+=l[i]\n f+=1 \nif k<e:\n print(\"-1\")\nelse:\n print(f)\n \n \t \t\t\t \t\t \t\t\t \t \t \t\t\t\t", "n=int(input())\nl=list(map(int,input().split()))\nl.sort(reverse=True)\ns=0\na=0\nwhile(s<n and a<len(l)):\n s+=l[a]\n a+=1\nif(s<n):\n print(-1)\nelse:\n print(a)\n\t\t\t \t\t \t \t \t\t \t\t\t\t\t \t\t", "k = int(input())\r\na = sorted(map(int,input().split()),reverse=True)\r\ns = 0 \r\ni = 0\r\nwhile s<k and i<12:\r\n s += a[i]\r\n i += 1\r\nif s<k:\r\n print('-1')\r\nelse:\r\n print(i)", "xG=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort(reverse=True)\r\na=0\r\nb=0\r\nfor i in range(12):\r\n if a>=xG:\r\n break\r\n a+=l[i]\r\n b+=1\r\nif a<xG:\r\n print(\"-1\")\r\nelse:\r\n print(b)", "n = int(input())\r\na = list(map(int, input().split()))\r\nksum = 0\r\nk = 0\r\nsum = 0\r\nfor i in range(len(a)):\r\n sum+=a[i]\r\nif n > sum:\r\n print(\"-1\")\r\nelse:\r\n a.sort(reverse = True)\r\n while ksum < n:\r\n ksum+=a[k]\r\n k+=1\r\n print(k)", "v=int(input())\nl=list(map(int,input().split()))\nl.sort(reverse=True)\ns=0\nd=0\nfor i in range(12):\n if s>=v:\n break\n s+=l[i]\n d+=1\nif s<v:\n print(-1)\nelse:\n print(d)\n\n\t\t\t \t\t \t \t\t\t\t\t \t \t \t\t\t\t \t\t \t", "k = int(input())\ncards = list(map(int, input().split()))\n\ncards.sort(reverse=True) # Sort in descending order\n\nmonths = 0\ntotalCards = 0\nfor i in range(12):\n if totalCards >= k:\n break\n\n totalCards += cards[i]\n months += 1\n\nif totalCards >= k:\n print(months)\nelse:\n print(-1)\n\n\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\nif(sum(l)<n):\r\n\tprint(\"-1\")\r\nelse:\r\n\tl.sort()\r\n\tl.reverse()\r\n\tfor i in range(0,13):\r\n\t\tif sum(l[0:i])>=n:\r\n\t\t\tprint(i)\r\n\t\t\tbreak", "k = int(input())\nl = sorted(list(map(int, input().split())))[::-1]\ns = 0\nif sum(l) < k:\n print(\"-1\")\nelif k == 0:\n print(0)\nelse:\n for i in range(12):\n s = s + l[i]\n if s >= k:\n print(i + 1)\n break\n\t\t \t\t\t \t \t \t \t\t\t\t\t \t\t \t \t", "k=int(input())\r\na=sorted([*map(int,input().split())])\r\ni=11\r\nwhile k>0 and i>-1:\r\n k-=a[i]\r\n i-=1\r\nprint([11-i,-1][k>0])", "k = int(input())\r\na=list(map(int,input().split()))\r\na1=sorted(a)[::-1]\r\ncount=0\r\nfor i in a1:\r\n if k > 0:\r\n k -= i\r\n count += 1\r\nif(k<=0):\r\n print(count)\r\nelse:\r\n print(-1)", "k = int(input())\r\nl = list(map(int, input().split()))\r\n\r\nl.sort()\r\nl.reverse()\r\n\r\ns, x = 0, 0\r\n\r\nfor i in range(12):\r\n\tif s >= k:\r\n\t\tbreak\r\n\t\t\r\n\ts += l[i]\r\n\tx += 1\r\n\t\r\nif s < k:\r\n\tprint(-1)\r\nelse:\r\n\tprint(x)", "k=int(input())\na=[int(x) for x in input().split(' ')]\na.sort()\na=a[::-1]\ns=0\nf=0\nsu=0\nkk=0\nfor i in a:\n if(su<k):\n su+=i\n s=s+1\n \nif(su<k):\n s=0\nif s==0 and k!=0:\n print(-1)\nelse:\n print(s)\n\t \t\t \t \t\t \t \t \t \t\t \t \t", "k=int(input())\r\nar=sorted(list(map(int,input().split())))\r\nsum,c=0,0\r\nfor i in ar[::-1]:\r\n if(sum<k):\r\n sum+=i\r\n c+=1\r\nprint(c if sum>=k else -1)", "def ans(a,k):\r\n if sum(a) < k:\r\n return -1\r\n ans,curr = 0,0\r\n while curr < k:\r\n curr += a[ans]\r\n ans += 1\r\n return ans\r\nk = int(input())\r\na = list(map(int,input().split()))\r\nprint(ans(sorted(a)[::-1],k))", "k = int(input())\n \nl = list(map(int,input().split()))\nl.sort()\nl = l[::-1]\n \nsum=0\nused = False\nfor i in range(12):\n if(sum>=k):\n used = False\n break\n else:\n used = True\n sum+=l[i]\n\nif(i==11 and used):\n i+=1\n \nif(sum<k):\n print(-1)\nelse:\n print(i)\n", "a=int(input())\r\nb=list(map(int,input().split()))\r\nb.sort()\r\nb.reverse()\r\no=0\r\nif sum(b)>=a:\r\n while a>0:\r\n a-=b[o]\r\n o+=1\r\nelse:\r\n print(-1)\r\n exit()\r\nprint(o)\r\n", "k = int(input())\na_lst = list(map(int,input().split()))\nb_lst = sorted(a_lst)[::-1]\ncount = 0\ngrowth = 0\nfor i in b_lst:\n if growth>=k:\n break\n else:\n growth+=i\n count+=1\nif growth<k:\n print(-1)\nelse:\n print(count)\n\n", "k = int(input())\r\narr = sorted(list(map(int, input().split())))\r\nt = 0\r\na = 0\r\nfor i in range(12):\r\n if a>=k:\r\n break\r\n a += arr[~i]\r\n t += 1\r\n if a>=k:\r\n break\r\nif a<k:\r\n print(-1)\r\nelse:\r\n print(t)", "k=int(input())\r\nl=list(map(int,input().split()))\r\nleng=0\r\ncount=0\r\nl=sorted(l,reverse=True)\r\ni=0\r\nwhile(leng<k and i<len(l)):\r\n leng+=l[i]\r\n \r\n i+=1\r\n count+=1\r\n \r\nif(leng>=k):\r\n print(count)\r\nelse:\r\n print(-1)", "k = int(input())\na = [int(i) for i in input().split()]\n\na.sort()\na.reverse()\n\ncnt = 0\ns = 0\nwhile cnt < len(a) and s < k:\n s += a[cnt]\n cnt += 1\n\nprint(-1 if s < k else cnt)\n", "def Solution(n):\n if n==0:\n return(0)\n \n elif n!=0:\n arr=list(map(int,input().split()))\n s,c=0,0\n arr.sort(reverse=True)\n for j in range (len(arr)):\n s = s+arr[j]\n if s >= n:\n return (j+1)\n break\n return(-1)\n\nif __name__==\"__main__\":\n n=int(input())\n print(Solution(n))\n\t\t \t\t\t \t\t\t \t \t \t \t \t\t \t \t\t\t \t", "n=int(input())\nl=list(map(int,input().split()))\nl.sort(reverse=True)\nlength=0\nno_of_months=0\nfor i in range(12):\n if length>=n:\n break\n length+=l[i]\n no_of_months+=1\nif length<n:\n print(-1)\nelse:\n print(no_of_months)\n\t \t\t\t \t \t\t\t\t \t\t \t\t \t\t", "b=int(input())\r\nx=sorted(list(map(int,input().split())))\r\nc=0\r\nk=0\r\nfor i in range(len(x)-1,-1,-1):\r\n k+=x[i]\r\n c+=1\r\n if b==0:\r\n print(0)\r\n break\r\n elif sum(x)<b:\r\n print(-1)\r\n break\r\n elif k>=b:\r\n print(c)\r\n break", "k=int(input())\r\nimport heapq\r\nl=list(map(int,input().split()))\r\nres=0\r\ntot=0\r\nheap=[]\r\nfor i in l:\r\n heapq.heappush(heap,-1*i)\r\nfor i in range(12):\r\n if tot>=k:\r\n break\r\n tot+=(-1*heapq.heappop(heap))\r\n res+=1\r\nprint(res) if tot>=k else print(-1)", "k = int(input())\r\nmes = sorted(list(map(int,input().split())),reverse=True)\r\nif sum(mes)<k:print(-1)\r\nelse:\r\n n = 0\r\n while sum(mes[:n])<k:\r\n n+=1\r\n print(n)", "k = int(input())\r\nl = [int(i) for i in input().split()]\r\nl.sort()\r\nl.reverse()\r\nsum = 0\r\nno=0\r\nflag = 0\r\nfor i in l:\r\n if (sum >= k):\r\n print(no)\r\n flag = 1\r\n break\r\n sum+=i\r\n no+=1\r\n \r\nif (sum >= k and flag==0):\r\n print(no)\r\n flag = 1\r\nif(flag==0):\r\n print(\"-1\")", "k=int(input())\r\nlst=[int(x) for x in input().split()]\r\nif k==0:print(0)\r\nelse:\r\n lst.sort(reverse=True)\r\n for i in range(12):\r\n k-=lst[i]\r\n if k<=0:\r\n print(i+1)\r\n break\r\n else:print(-1)\r\n", "k = int(input())\nl = [int(x) for x in input().split()]\nl.sort(reverse=True)\ns = 0\nif k == 0:\n print(s)\nelse:\n for i in range(len(l)):\n s += l[i]\n if s >= k:\n print(i+1)\n break\n if s < k:\n print(-1)", "m=int(input())\nl=list(map(int,input().split()))\nl.sort(reverse=True)\ng=0\nf=0\nfor i in range (12):\n if g>=m:\n break\n g+=l[i]\n f+=1\nif g<m:\n print(\"-1\")\nelse:\n print(f)\n\t \t \t \t \t\t\t \t\t\t \t \t\t\t \t\t \t", "k=int(input())\r\na=list(map(int,input().split()))\r\nif sum(a)<k:\r\n print(-1)\r\nelse:\r\n a.sort(reverse=True)\r\n l=0\r\n while sum(a[0:l])<k:\r\n l+=1\r\n print(l)", "import sys\nk = int(sys.stdin.readline())\nmonthly = sorted(sys.stdin.readline().split(), key=int, reverse=True)\nn = 0\nwateredK = 0\nfor i in range(len(monthly)):\n if wateredK >= k: break\n wateredK += int(monthly[i])\n n += 1\nprint (n if wateredK >= k else -1)\n\t\t\t \t\t\t\t\t\t\t \t\t\t \t \t\t\t \t\t\t", "from math import*\r\nj=int(input())\r\nm=sorted(list(map(int,input().split())),reverse=True)\r\nu=0\r\nc=0\r\nfor i in range(len(m)):\r\n if u>=j:\r\n print(c)\r\n break\r\n u+=m[i]\r\n c+=1\r\nelse:\r\n if u>=j:print(c)\r\n else:print(-1)", "k = int(input())\r\na = list(map(int, input().split()))\r\na.sort(reverse=True)\r\nsum = 0\r\ncount = 0\r\nfor i in range(12):\r\n if sum >= k:\r\n break\r\n sum += a[i]\r\n count += 1\r\nif sum < k:\r\n print(-1)\r\nelse:\r\n print(count)", "k = int(input())\n \nl = list(map(int,input().split()))\nl.sort()\nl = l[::-1]\n \nsm=0\ni=0\n\nwhile(i<12 and sm<k):\n sm += l[i]\n i+=1\n\nif(sm<k):\n print(-1)\nelse:\n print(i)\n\n", "n = int(input())\nl1= list(map(int,input().split()))\nl1.sort(reverse = True)\nans= 0\ntotal = 0\nif n != 0:\n i = 0\n while total < n and i < 12:\n ans = i+1\n total += l1[i]\n i += 1\n\n if total < n:\n ans = -1\nprint(ans)", "numofcenti=int(input())\r\nmonths=list(map(int,input().split()))\r\ncounter=0\r\nif (sum(months)<numofcenti):\r\n print(-1)\r\nelse:\r\n months.sort()\r\n months.reverse()\r\n for i in range(13):\r\n sum1=sum(months[0:i])\r\n if sum1>=numofcenti:\r\n print(i)\r\n break", "k=int(input())\r\nlst=list(map(int,input().split()))\r\nlst.sort(reverse=True)\r\nmonth=0\r\nif k<1:\r\n print(0)\r\nelif sum(lst)<k:\r\n print(-1)\r\nelse:\r\n sum=0\r\n for ele in lst:\r\n sum+=ele\r\n month+=1\r\n if sum>=k:\r\n break\r\n print(month)", "#By Anan instagram: anan.ssw\r\nk=int(input())\r\narr=list(map(int,input().split()))\r\narr.sort()\r\narr.reverse()\r\ns=0\r\ni=0\r\nwhile s<k and i<12:\r\n s+=arr[i]\r\n i+=1\r\nprint([i,-1][s<k])", "import sys\r\nimport math\r\nimport copy\r\nfrom collections import deque\r\nfrom collections import *\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n\r\ndef ll(): return list(map(int, input().split()))\r\n\r\n\r\ndef lf(): return list(map(float, input().split()))\r\n\r\n\r\ndef ls(): return list(map(str, input().split()))\r\n\r\n\r\ndef mn(): return map(int, input().split())\r\n\r\n\r\ndef nt(): return int(input())\r\n\r\n\r\ndef ns(): return input()\r\nk=nt()\r\nl=ll()\r\nl.sort(reverse=True)\r\nans=0\r\nif k==0:\r\n print(0)\r\n exit(0)\r\nfor x in range(len(l)):\r\n if k>0:\r\n k-=l[x]\r\n ans+=1\r\n else:\r\n break\r\nif k>0:\r\n print(-1)\r\nelse:\r\n print(ans)\r\n\r\n\r\n\r\n", "\nt=int(input())\ns=[int(x) for x in input().split()]\ns=sorted(s)\ns=s[::-1]\nres=0\nc=0\nflag=0\nfor i in range(12):\n res+=s[i]\n c+=1\n if(res>=t):\n z=c\n flag=1\n break\nif(t==0):\n print(0)\nelse:\n if(flag==1):\n print(z)\n else:\n print(-1)\n \n\n\t\t\t\t \t \t \t\t\t \t\t \t\t\t \t \t\t\t", "w=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort(reverse=True)\r\ns=0\r\ni=0\r\nwhile i<len(l) and s<w:\r\n s+=l[i]\r\n i+=1\r\nif s>=w:\r\n print(i)\r\nelse:\r\n print(\"-1\")", "k = int(input())\r\na = sorted(list(map(int, input().split())), reverse = True)\r\nsum = 0\r\nif k == 0:\r\n\tprint(0)\r\n\texit()\r\nfor i in range(12):\r\n\tsum += a[i]\r\n\tif sum >= k:\r\n\t\tprint(i + 1)\r\n\t\texit()\r\nprint(-1)", "k=int(input())\r\na=list(map(int,input().split()))\r\nc=0\r\nif (sum(a) < k):\r\n print(\"-1\")\r\nelse:\r\n a.sort()\r\n a.reverse()\r\n for i in range(13):\r\n ss=sum(a[0:i])\r\n if ss >= k:\r\n print(i)\r\n break", "k=int(input())\r\na=list(map(int,input().split()))\r\nif sum(a)<k:\r\n print(-1)\r\nelse:\r\n a.sort(); a.reverse()\r\n count=0\r\n s=0\r\n for i in a:\r\n if s<k:\r\n s+=i\r\n count+=1\r\n else:\r\n break\r\n print(count)\r\n ", "# Business trip\r\nk=int(input())\r\na=list(map(int, input().split()))\r\na.sort(reverse=True)\r\ns=0\r\ni=0\r\nwhile s<k and i<12:\r\n s=s+a[i]\r\n i=i+1\r\nif s<k:\r\n print('-1')\r\nelse:\r\n print(i)", "x = int(input())\ncard_quantities = list(map(int, input().split()))\n\ncard_quantities.sort(reverse=True)\n\ntotal_card = 0\nnum_months = 0\n\nif x == 0:\n print(0)\nelse:\n for quantity in card_quantities:\n total_card += quantity\n num_months += 1\n\n if total_card >= x:\n print(num_months)\n break\n\n if total_card < x:\n print(-1)\n\n \t\t\t\t \t \t \t \t \t \t \t", "import collections\r\nfrom math import log2, log10, ceil\r\n\r\ndef pow2(n):\r\n t = 0\r\n while not(n&1):\r\n n = n//2\r\n t += 1\r\n return t\r\n\r\ndef solve():\r\n k = int(input())\r\n a = list(map(int, input().split()))\r\n a.sort(reverse=True)\r\n\r\n cm = 0\r\n if cm>=k:\r\n print(0)\r\n else:\r\n months = 0\r\n for i in a:\r\n cm += i\r\n months += 1\r\n if cm>=k:\r\n break\r\n if cm>=k:\r\n print(months)\r\n else:\r\n print(-1)\r\ndef main():\r\n t = 1\r\n while t:\r\n t -= 1\r\n solve()\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "k = int(input())\r\na =list(map(int,input().split()))\r\n\r\na.sort(reverse = True)\r\ncnt = 0\r\niteration = 0\r\n\r\nfor i in range(len(a)):\r\n if cnt >= k:\r\n break\r\n else:\r\n cnt +=a[i]\r\n iteration +=1\r\n\r\nif sum(a)<k:\r\n print(\"-1\")\r\nelse:\r\n print(iteration)\r\n\r\n\r\n\r\n\r\n", "k = int(input())\r\nl = list(map(int,input().split()))\r\ns = 0\r\nl.sort(reverse=True)\r\ni = 0\r\nwhile(s<k and i<len(l)):\r\n s+=l[i]\r\n i+=1\r\n\r\nif s<k:\r\n print(-1)\r\nelse:\r\n print(i)\r\n \r\n", "import sys\r\nk = int(sys.stdin.readline())\r\nmonthi = sorted(sys.stdin.readline().split(), key=int, reverse=True)\r\nn = 0\r\nwateredK = 0\r\nfor i in range(len(monthi)):\r\n if wateredK >= k: break\r\n wateredK += int(monthi[i])\r\n n += 1\r\nprint (n if wateredK >= k else -1)", "n = int(input())\r\nif n == 0:\r\n print(0)\r\nelse:\r\n a = list(map(int, input().split()))\r\n a.sort(reverse=True)\r\n r = 0\r\n for i, x in enumerate(a):\r\n r += x\r\n if r >= n:\r\n print(i+1)\r\n break\r\n else:\r\n print(-1)", "k=int(input())\narr=[int(i) for i in input().split()]\narr=sorted(arr)\narr=arr[::-1]\ncount=0\nflag=0\nif(k==0):\n print(0)\nelif(k>0):\n for j in range(len(arr)):\n ele=arr[j]\n count+=ele\n if(count>=k):\n flag=1\n break\n if(flag==1):\n print(j+1)\n else:\n print(-1)\n\n\t \t\t \t \t\t \t \t\t\t \t\t \t\t\t\t \t\t", "k = int(input())\r\n\r\narr= list(map(int, input().split()))\r\ns = 0\r\nif k==0:\r\n print(0)\r\nelse: \r\n arr.sort(reverse = True)\r\n for i in range(len(arr)):\r\n s +=arr[i]\r\n if s >= k:\r\n print(i+1)\r\n break\r\n else:\r\n print(-1)\r\n \r\n\r\n", "import sys\r\n\r\nk = int(sys.stdin.readline())\r\nA = sorted(map(int, sys.stdin.readline().split()), reverse=True)\r\n\r\ncumsum = 0\r\nnum_water = 0\r\n\r\nif k == 0:\r\n print(0)\r\n sys.exit(0)\r\n\r\nfor i in range(12):\r\n cumsum += A[i]\r\n if cumsum >= k:\r\n print(i + 1)\r\n sys.exit(0)\r\n\r\nprint(-1)", "x=int(input())\r\ny=list(map(int,input().split()))\r\ny.sort(reverse=True)\r\nres=0\r\ni=0\r\ntry:\r\n while res<x:\r\n res+=y[i]\r\n i+=1\r\n print(i)\r\nexcept:\r\n print('-1')", "n=int(input())\nlst=list(map(int,input().split()))\nlst.sort(reverse=True)\ncount=0\nres=0\nfor i in range(len(lst)):\n if(count>=n):\n break\n count+=lst[i]\n res+=1\nif(count<n):\n print(\"-1\")\nelse:\n print(res)\n \t\t\t\t\t \t\t \t \t \t\t\t\t\t\t \t", "w = int(input())\r\nl = list(map(int, input().split()))\r\nl.sort(reverse=True)\r\ns = 0\r\ni = 0\r\nwhile i < len(l) and s < w:\r\n s += l[i]\r\n i += 1\r\nif s >= w:\r\n print(i)\r\nelse:\r\n print(\"-1\")", "n=int(input())\nm=list(map(int,input().split()))\nm.sort(reverse=True)\ns=0\na=0\nwhile(s<n and a<len(m)):\n s+=m[a]\n a+=1\nif(s<n):\n print(-1)\nelse:\n print(a)\n\n\t\t \t\t\t\t\t\t \t \t \t \t \t\t\t \t \t\t \t", "K = int(input())\r\nif K==0:\r\n print(0)\r\nelse:\r\n sum_grow = 0\r\n count = 0\r\n grow_month = list(map(int,input().split(' ')))\r\n grow_month.sort(reverse=True)\r\n if sum(grow_month) < K:\r\n print(-1)\r\n else:\r\n for i in grow_month:\r\n sum_grow+=i\r\n count+=1\r\n if sum_grow>=K:\r\n print(count)\r\n break\r\n", "length = int(input())\r\nmonth = list(map(int, input().split()))\r\nmonth.sort(reverse=True)\r\nbig = month[0]\r\ndays = 1\r\nif length == 0:\r\n print(0)\r\n exit()\r\nfor i in range(1, 12):\r\n if big >= length:\r\n break\r\n else:\r\n big += month[i]\r\n days += 1\r\n\r\n\r\nif big >= length:\r\n print(days)\r\nelse:\r\n print(-1)\r\n", "def sol(a,k):\r\n if k ==0:\r\n return 0\r\n a = sorted(a)\r\n a = a[::-1]\r\n i = 0\r\n count = 0\r\n while k>0 and i<len(a):\r\n k-=a[i]\r\n i+=1 \r\n count+=1 \r\n if k<=0:\r\n return count \r\n elif k>0:\r\n return -1\r\n\r\nk = int(input())\r\na = [int(x) for x in input().split()]\r\nans = sol(a,k)\r\nprint(ans)", "n = int(input())\r\nlst = list(map(int,input().split()))\r\nres = 0\r\nif n == 0:\r\n print(0)\r\nelse:\r\n lst.sort(reverse=True)\r\n for i in lst:\r\n n -= i\r\n res += 1\r\n if n <=0:\r\n break\r\n if n <=0:\r\n print(res)\r\n else:\r\n print(-1)", "from sys import stdin, stdout\r\ninput, print = stdin.readline, stdout.write\r\n\r\n\r\ndef str_input():\r\n s = input()\r\n return s[:len(s)-1]\r\n\r\n\r\ndef list_input():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef map_input():\r\n return map(int, input().split())\r\n\r\n\r\ndef main():\r\n k = int(input())\r\n a = list_input()\r\n a.sort(reverse=True)\r\n if k == 0:\r\n print(\"0\\n\")\r\n return\r\n ans = -1\r\n sum = 0\r\n for i in range(12):\r\n sum += a[i]\r\n if sum >= k:\r\n ans = i+1\r\n break\r\n print(f\"{ans}\\n\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "k = int(input())\r\nsps = list(map(int, input().split()))\r\ntt = 0\r\namn = 0\r\nsps.sort()\r\n\r\nfor j in range (11, -1, -1):\r\n amn += 1\r\n tt += sps [j]\r\n if tt >= k:\r\n break\r\n \r\nif k == 0:\r\n print (0)\r\nelif tt >= k:\r\n print (amn)\r\nelif tt < k:\r\n print (-1)\r\nelse:\r\n pass", "limit = int(input())\r\nwhole_year = [*map(lambda x: int(x), input().split())]\r\n\r\ndef min_watering(year_list, limit):\r\n sorted_list = sorted(year_list, reverse=True)\r\n if sum(sorted_list) < limit:\r\n print(-1)\r\n else:\r\n i = 0\r\n total = 0\r\n test = []\r\n while i < len(sorted_list) and total < limit:\r\n total += sorted_list[i]\r\n test.append(1)\r\n i += 1\r\n print(len(test))\r\n \r\n \r\n \r\nmin_watering(whole_year, limit)", "k = int(input())\r\n\r\na = list(map(int, input().split()))\r\na.sort(reverse = True)\r\n\r\nif(sum(a) < k):\r\n print(-1)\r\n \r\nelse:\r\n cnt = 0\r\n i = 0\r\n while cnt < k:\r\n cnt += a[i]\r\n i+=1\r\n print(i)", "n = int(input())\r\nl = list(map(int,input().split()))\r\nl.sort(reverse=True)\r\nc=0\r\nans=0\r\nfor i in range(len(l)):\r\n if (c>=n):\r\n break\r\n c+=l[i]\r\n ans+=1 \r\nif(c<n):\r\n print(\"-1\")\r\nelse:\r\n print(ans)", "def f(ind,arr,temp,k,min_len):\r\n if ind==len(arr):\r\n return min_len\r\n if sum(temp)>=k:\r\n # print(temp)\r\n min_len=min(min_len,len(temp))\r\n return min_len\r\n \r\n \r\n temp.append(arr[ind])\r\n pick=f(ind+1,arr,temp,k,min_len)\r\n temp.pop()\r\n not_pick=f(ind+1,arr,temp,k,min_len)\r\n return min(pick,not_pick)\r\n\r\n\r\n\r\nk=int(input())\r\narr=list(map(int,input().split()))\r\nif k==0:\r\n print(0)\r\nelif sum(arr)<k:\r\n print(-1)\r\nelse:\r\n arr.append(0)\r\n print(f(0,arr,[],k,15))\r\n", "k=int(input())\r\nac=list(map(int,input().split()))\r\nac=sorted(ac,reverse=True)\r\ntinker,count=0,0\r\nfor x in ac:\r\n if tinker<k:\r\n tinker+=x\r\n count+=1\r\nif tinker>=k:\r\n print(count)\r\nelse:\r\n print(-1)", "k = int(input())\r\nm = sorted(map(int, input().split()), reverse=True)\r\nif k > sum(m):\r\n print(-1)\r\nelif k == 0:\r\n print(0)\r\nelse:\r\n for i in range(12):\r\n k -= m[i]\r\n if k<1:\r\n print(i+1)\r\n break", "k=int(input())\r\na=list(map(int,input().split()))\r\nif sum(a)<k:\r\n print(-1)\r\n exit()\r\na.sort(reverse=True)\r\ns=0\r\ncount=0\r\ni=0\r\nwhile s<k:\r\n s+=a[i]\r\n i+=1\r\n count+=1\r\nprint(count)\r\n\r\n", "n=int(input())\nl=list(map(int,input().split()))\nl.sort(reverse=True)\nx=0\nc=0\nfor i in range(12):\n\tif x>=n:\n\t\tbreak\n\tx+=l[i]\n\tc+=1\nif x<n:\n\tprint(-1)\nelse:\n\tprint(c)\n\t \t \t\t \t\t\t\t \t \t\t \t\t \t\t", "k=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort(reverse=1)\r\nc,i,ans=0,0,0\r\nfor i in range(12):\r\n if ans<k:\r\n ans+=l[i]\r\n c+=1\r\n else:\r\n break\r\nif ans<k:\r\n print(-1)\r\nelse:\r\n print(c)", "\n\ndef solution(l,n):\n l.sort(reverse=True)\n s = 0\n c = 0\n for i in range(len(l)):\n if s>=n:\n break\n s+=l[i]\n c+=1\n if s<n:\n return -1\n return c\n\n\nn = int(input())\nl = list(map(int,input().split()))\nprint(solution(l,n))\n\t \t\t\t \t \t \t\t \t \t\t\t", "k = int(input())\r\ngrowth = sorted([int(x) for x in input().split()], reverse=True)\r\n\r\nplant_cm = 0\r\nmonths = 0\r\n\r\nfor i in range(12):\r\n\tif plant_cm < k:\r\n\t\tplant_cm += growth[i]\r\n\t\tmonths += 1\r\n\telse:\r\n\t\tbreak\r\n\r\nprint(months if plant_cm >= k else -1) \r\n\r\n", "def main():\n k = int(input())\n months = list(reversed(sorted(map(int, input().split(' ')))))\n\n if k == 0:\n print(0)\n return\n\n total_sum = 0\n result = 0\n\n for x in months:\n total_sum += x\n result += 1\n if total_sum >= k:\n break\n\n if total_sum < k:\n print(-1)\n return\n\n print(result)\n\n \nif __name__ == \"__main__\":\n main()\n", "k = int(input())\r\na = list(map(int, input().split()))\r\na.sort(reverse=True)\r\ncount = 0\r\nif k == 0:\r\n print(0)\r\nelse:\r\n for i in range(12):\r\n count += a[i]\r\n if count >= k:\r\n break\r\n if count < k:\r\n print(-1)\r\n else:\r\n print(i+1)", "k=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort(reverse=True)\r\np=0\r\nj=0\r\ni=0\r\nflag=True\r\nwhile p<k :\r\n p+=l[i]\r\n j+=1\r\n if i==len(l)-1 and p<k :\r\n print(-1)\r\n flag=False\r\n break\r\n i+=1\r\nif flag==True :\r\n print(j)", "#!/usr/bin/env python\r\n\r\nimport math\r\nimport sys\r\nimport itertools\r\nimport fractions\r\n\r\nif __name__ == '__main__':\r\n wtf = sys.stdin.read()\r\n wtf = wtf.strip().split('\\n')\r\n k = int(wtf[0])\r\n A = sorted(map(int, wtf[1].split()), reverse=True)\r\n ans = 0\r\n z = 0\r\n for a in A:\r\n if z >= k:\r\n break\r\n ans += 1\r\n z += a\r\n if z < k:\r\n ans = -1\r\n print(ans)\r\n", "minHeight = int(input())\ngrowthPerMonth = list(map(int,input().split()))\ngrowthPerMonth.sort(reverse=True)\nwateredMonths = 0\ngrownAmount = 0\ni = 0\nwhile grownAmount < minHeight:\n if(i == 12):\n wateredMonths = -1\n break\n grownAmount += growthPerMonth[i]\n i += 1\n wateredMonths += 1\nprint(wateredMonths)\n", "k = int(input())\r\nmonths = list(map(int,input().split()))\r\nmonths.sort()\r\nc = 0\r\ns = 0\r\nfor i in reversed(range(len(months))):\r\n if s>=k:\r\n break\r\n else:\r\n s+=months[i]\r\n c+=1\r\nif s>=k:\r\n print(c)\r\nelse:\r\n print(-1)", "k = int(input())\r\nheights = list(map(int, input().split()))\r\nheights.sort(reverse=True)\r\n\r\nheight_sum = 0\r\ncount = 0\r\nwhile count < len(heights) and height_sum < k:\r\n height_sum += heights[count]\r\n count += 1\r\n\r\nif height_sum >= k:\r\n print(count)\r\nelse:\r\n print(-1)", "k = int(input())\r\n\r\narr = list(map(int,input().split()))\r\n\r\nwat = 0\r\nmnth = 0\r\n\r\nwhile wat < k and len(arr) > 0:\r\n mnth += 1\r\n wat += max(arr)\r\n arr.remove(max(arr))\r\n\r\nif wat < k:\r\n print(-1)\r\nelse:\r\n print(mnth)", "n = int(input())\r\narr = sorted(list(map(int, input().split())))\r\nc = 0\r\nmin = []\r\nif n == 0:\r\n print(0)\r\nelse:\r\n for i in range(-1, -len(arr) - 1, -1):\r\n min.append(arr[i])\r\n c += 1\r\n if sum(min) >= n:\r\n\r\n break\r\n\r\n if c == len(arr) and sum(min) < n:\r\n print(-1)\r\n else:\r\n print(len(min))\r\n", "n=int(input())\r\nx=n\r\na=[int(x) for x in input().split()]\r\nb=sorted(a,reverse=True)\r\n#print(b)\r\ni=0\r\nwhile i<12:\r\n if n<=0:break\r\n n=n-b[i]\r\n i=i+1\r\n\r\nprint(i if sum(a)>=x else -1)\r\n\r\n\r\n", "k=int(input())\r\na=list(map(int,input().split()))\r\na.sort(reverse=True)\r\nmonths=0\r\ni=0\r\nwhile k>0 and i<12:\r\n k=k-a[i]\r\n months+=1\r\n i+=1\r\nif k<=0:\r\n print(months)\r\nelse:\r\n print(-1)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef main() -> None :\r\n TARGET_HEIGHT:int = int(input())\r\n MONTH_GROW_HEIGHTS:list[int] = list(map(int, input().split()))\r\n\r\n minMonths:int = 0\r\n byGrowHeight:int = 0\r\n for monthGrowHeight in sorted(MONTH_GROW_HEIGHTS, reverse=True) :\r\n if byGrowHeight >= TARGET_HEIGHT : break\r\n byGrowHeight += monthGrowHeight\r\n minMonths += 1\r\n if byGrowHeight < TARGET_HEIGHT : minMonths = -1\r\n \r\n print(minMonths)\r\n\r\nmain()", "k = int(input())\r\na = list(map(int, input().split()))\r\na.sort(reverse = True)\r\nt = 0\r\nc = 0\r\nfor i in range(len(a)):\r\n if t >= k:\r\n break\r\n t += a[i]\r\n c += 1\r\nif t < k:\r\n c = -1\r\nprint(c)", "def solve():\r\n n=int(input())\r\n l=list(map(int,input().split()))\r\n l.sort(reverse=True)\r\n if(n==0):\r\n print(0)\r\n return\r\n for i in range(12):\r\n n-=l[i]\r\n if(n<=0):\r\n print(i+1)\r\n return\r\n print(-1)\r\n \r\n \r\nif __name__=='__main__':\r\n solve()", "n = int(input())\nl = list(map(int,input().split()))\nl.sort(reverse=True)\ns = 0\nx = 0\nwhile(s<n and x<len(l)):\n s+=l[x]\n x+=1\nif(s<n):\n print(-1)\nelse:\n print(x)\n \t\t\t\t \t \t\t \t \t \t\t\t \t \t\t", "a=int(input())\nl=list(map(int,input().split()))\nc=0\nl.sort(reverse=True)\nX=0\nsum=0\nwhile sum<a and X<len(l):\n sum+=l[X]\n X+=1\nif sum<a:\n print(-1)\nelse:\n print(X)\n \n \t\t\t\t \t \t \t\t \t\t\t\t \t \t", "\r\n\r\n\r\n\r\ndef business():\r\n l = int(input())\r\n\r\n numbers = list(map(int,input().split()))\r\n\r\n\r\n height = 0\r\n\r\n\r\n numbers.sort(reverse=True)\r\n\r\n\r\n\r\n cum_sum = 0\r\n index = 0\r\n months=0\r\n while index < len(numbers) and height < l:\r\n months += 1\r\n height += numbers[index]\r\n index+=1\r\n\r\n\r\n if height>=l:\r\n print(months)\r\n else:\r\n print(-1)\r\n\r\n\r\n\r\nbusiness()\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "k=int(input())\r\na=list(map(int,input().split()))\r\nif sum(a)<k:\r\n print(-1)\r\nelse:\r\n a.sort()\r\n a.reverse()\r\n c,x=0,0\r\n while c<k:\r\n c+=a[x]\r\n x+=1\r\n print(x)", "k=int(input())\r\nl1=list(map(int,input().split()))\r\nl1.sort(reverse=True)\r\nht,i=0,0\r\nwhile k>ht and i<12:\r\n ht+=l1[i]\r\n i+=1\r\nprint(i) if ht>=k else print(-1)", "n = int(input())\r\nvls = list(map(int, input().split()))\r\n\r\nif sum(vls) < n:\r\n print(-1)\r\nelse:\r\n vls.sort()\r\n r = t =0\r\n for v in vls[::-1]:\r\n if t >= n:\r\n break\r\n t += v\r\n r += 1\r\n print(r)\r\n", "n=int(input())\r\ns,c,i=0,0,11\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nif n==0:\r\n print(0)\r\nelif sum(l)<n:\r\n print(-1)\r\nelse:\r\n while s+l[i]<n:\r\n s+=l[i]\r\n i-=1\r\n c+=1\r\n print(c+1)", "k = int(input())\r\narr = list(map(int, input().split()))\r\nif sum(arr) < k:\r\n print(-1)\r\nelif k == 0:\r\n print(0)\r\nelse:\r\n arr.sort(reverse=True)\r\n length = len(arr)\r\n su = 0\r\n for i in range(length):\r\n su += arr[i]\r\n if su >= k:\r\n print(i+1)\r\n break", "k = int(input())\r\na = list(map(int,input().split()))\r\ncount = 0\r\nif k == count:\r\n print(count)\r\nelse:\r\n a.sort()\r\n for i in range(11,-1,-1):\r\n k -= a[i]\r\n count += 1\r\n if k <= 0:\r\n break\r\n print(count if k <= 0 else -1)", "n=int(input())\r\nl=[ int (x) for x in input().split()]\r\nl.sort(reverse=True)\r\n\r\ns=0\r\ncount=0\r\nwhile(count<len(l)and s<n):\r\n s+=l[count]\r\n count+=1\r\nif(s<n):\r\n print(-1)\r\nelse:\r\n print(count)\r\n #this is pavan submission", "k=int(input())\r\narr=[int(i) for i in input().split(\" \")]\r\narr.sort()\r\ncount=0\r\nif(k==0):\r\n print(\"0\")\r\nelse:\r\n for i in range(11,-1,-1):\r\n k-=arr[i]\r\n count+=1\r\n if(k<=0):\r\n break\r\n if(k>0): print(\"-1\")\r\n else: print(count)", "n = int(input())\r\ns = sorted(list(map(int, input().split())))[::-1]\r\nif sum(s)<n:\r\n print(-1)\r\nelif n==0:\r\n print(0)\r\nelse:\r\n c=0\r\n for i in range(len(s)):\r\n c+=s[i]\r\n if c>=n:\r\n print(i+1)\r\n break", "# https://codeforces.com/problemset/problem/149/A\r\n\r\n\r\nm = int(input())\r\nseq = list(map(int, input().split()))\r\nseq.sort()\r\n\r\ncnt = 0\r\nsm = 0\r\ni = len(seq) - 1\r\nwhile sm < m and i >= 0:\r\n sm += seq[i]\r\n i -= 1\r\n cnt += 1\r\nif sm >= m:\r\n print(cnt)\r\nelse:\r\n print(-1)", "def func2(k,a):\r\n a.sort()\r\n ans = 0\r\n i = 11\r\n c = 0\r\n while k>0 and i>=0:\r\n k-=a[i]\r\n c+=1\r\n i-=1\r\n if k<=0:\r\n return c\r\n else:\r\n return -1 \r\nk = int(input())\r\na = list(map(int,input().split()))\r\nprint(func2(k,a))", "k=int(input())\r\nm=[int(i) for i in input().split()]\r\nm.sort(reverse=True)\r\nans=0\r\nt=0\r\nfor i in m:\r\n\tif t>=k:\r\n\t\tprint(ans)\r\n\t\texit()\r\n\tans+=1\r\n\tt+=i\r\nif t>=k:\r\n\tprint(12)\r\n\texit()\r\nprint(-1)", "k=int(input())\nls=list(map(int,input().split()))\ncount=0\ntemp=0\nnewls=sorted(ls, reverse=True)\n# print(newls)\nfor i in newls:\n temp+=i\n count+=1\n if temp>=k:\n break\nif k==0:\n print(0)\nelif sum(ls)<k:\n print(-1)\nelse:\n print(count)", "k=int(input())\r\nn, q=0, 0\r\na=list(map(int,input().split()))\r\na.sort()\r\na.reverse()\r\nfor i in range(12):\r\n if n<k:\r\n n=n+a[i]\r\n q=q+1\r\nif n<k:\r\n print(-1)\r\nelse:\r\n print(q)\r\n", "'''\r\n >>>>>>>>>>>>>>>>>>>>>>>>>>> বিসমিল্লাহির রাহমানির রাহিম\r\n\r\n بِسْمِ ٱللَّٰهِ ٱلرَّحْمَٰنِ ٱلرَّحِيمِ <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<\r\n\r\n >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Bismillahir Rahmanir Rahim\r\n'''\r\n\r\n'''::::::::::_^_;;;;;;;;;;;;;;;;;;;;_^_%%%%%%%%%%%%%%%%_^_@@@@@@@@@@@@@@\r\n''::::::::::_^_;;;;;;;;;;;;;;;;;;;;_^_%%%%%%%%%%%%%%%%_^_@@@@@@@@@@@@@@@\r\n\r\n PROBLEM :A. Business trip\r\n SOLUTATOIN:........\r\n\r\n ========================================================================\r\n ========================================================================\r\n '''\t\t\t\r\nk=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nl.reverse()\r\ni=0\r\nwhile(k>0 and i<len(l)):\r\n k-=l[i]\r\n i+=1\r\nif k<=0:\r\n print(i)\r\nelse:\r\n print(-1)\r\n", "y=int(input())\nl=list(map(int,input().split()))\nl.sort(reverse=True)\ns=0\ncount=0\nfor i in range(12):\n if s>=y:\n break\n s+=l[i]\n count+=1\nif s<y:\n print(-1)\nelse:\n print(count)\n \t\t\t\t\t \t \t\t\t \t \t \t \t\t\t\t", "x=int(input())\nc=list(map(int,input().split()))\nc=list(sorted(c))\nc=list(reversed(c))\nk,d=0,0\ny=0\nif x==0:\n print(0)\nelse:\n for i in range(len(c)):\n d=d+c[i]\n y=y+1\n\n if d>=x:\n\n k=1\n\n break\n\n if k==1:\n print(y)\n else:\n print(-1)\n\n \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", "k = int(input())\ntotal = 0\nfor i, n in enumerate(sorted(map(int, input().split()), reverse=True)):\n if total >= k:\n print(i)\n quit()\n total += n\nif total >= k:\n print(i+1)\nelse:\n print(-1)", "#****************************************\r\n\r\n#** Solution by BAZOOKA **\r\n\r\n#** Sponsored by RED BULL**\r\n\r\n#** I love ❤Kateryna Gret❤ **\r\n\r\n#****************************************/\r\n\r\nk=int(input())\r\n\r\nm=sorted(map(int,input().split()))[::-1]\r\n\r\nfor i in range(13):\r\n\r\n if sum(m[:i])>=k:\r\n\r\n print(i)\r\n\r\n exit(0)\r\n\r\nprint(-1)\r\n\r\n#****************************************\r\n\r\n#** Solution by BAZOOKA **\r\n\r\n#** Sponsored by RED BULL**\r\n\r\n#** I love ❤Kateryna Gret❤ **\r\n\r\n#****************************************/", "k = int(input())\nlis = sorted(list(map(int, input().split())))[::-1]\ns =0\nm =0\nflag=0\nif k==0:\n print(0)\nelse:\n for i in lis:\n s+=i\n m+=1\n if s>=k:\n flag=1\n break\n if flag==1:\n print(m)\n else:\n print(-1)\n\n \t \t \t\t\t\t\t\t\t\t \t \t \t \t \t\t\t\t", "k=int(input())\r\nwaters=[int(i) for i in input().split()]\r\nwaters=sorted(waters)\r\nheight=0;i=0\r\nwhile(height<k and i<12):\r\n height+=waters[11-i]\r\n i+=1\r\nif(height<k):\r\n print(-1)\r\nelse:\r\n print(i)", "k = int(input())\r\nalist = sorted([*map(int, input().split())])\r\nfor i, value in enumerate(reversed(alist)):\r\n if k <= 0:\r\n break\r\n k -= value\r\n i += 1\r\nprint(i if k <= 0 else \"-1\")", "o=int(input())\nl=list(map(int,input().split()))\nl.sort(reverse=True)\nx=0\nc=0\nfor i in range(12):\n\tif x>=o:\n\t\tbreak\n\tx+=l[i]\n\tc+=1\nif x<o:\n\tprint(-1)\nelse:\n\tprint(c)\n\t\t\t \t\t \t\t \t\t \t\t \t\t\t\t\t\t \t\t\t", "k=int(input())\r\na=[int(i) for i in input().split()]\r\na.sort(reverse=True)\r\nd=0\r\nif sum(a)<k:\r\n d=-1\r\nelse:\r\n for i in range(len(a)):\r\n if k>0:\r\n k-=a[i]\r\n d+=1\r\nprint(d)\r\n", "k = int(input())\r\na = list(map(int, input().split()))\r\na.sort(reverse=True)\r\nfuture_h = 0\r\ncount = 0\r\n\r\nfor h in a:\r\n if future_h >= k: break\r\n future_h += h\r\n count += 1\r\n\r\nif future_h < k:\r\n print(-1)\r\nelse:\r\n print(count)\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nc = 0\r\na.sort()\r\nfl = 0\r\nif n==0 :\r\n print(0)\r\nelse :\r\n for i in range(len(a)-1,-1,-1) :\r\n c += a[i]\r\n if c>=n :\r\n print(12-i)\r\n fl = 1\r\n break\r\n if fl==0 :\r\n print(-1)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nj=-1\r\nif n==0:\r\n print(0)\r\nelse:\r\n l.sort(reverse=True)\r\n for i in range(12):\r\n n-=l[i]\r\n if n<=0:\r\n j=i+1\r\n break\r\n print(j)", "k = int(input())\nmonths = [int(x) for x in input().split()]\nmonths.sort(reverse=True)\n\nif sum(months) < k:\n print(-1)\n exit()\nelif k == 0:\n print(0)\n exit()\nelse:\n num = 0\n count = 0\n for x in range(12):\n num += months[x]\n count += 1\n if num >= k:\n print(count)\n exit()\n", "k = int(input())\r\nlst = list(map(int, input().split()))\r\nif sum(lst) < k:\r\n print(-1)\r\nelse:\r\n lst.sort(reverse=True)\r\n c = 0\r\n for i in lst:\r\n if k>0:\r\n k -= i\r\n c += 1\r\n else:\r\n break\r\n print(c)", "k = int(input())\r\na = list(map(int,input().split()))\r\na.sort(reverse=True)\r\nc = 0\r\nfor i in range(12):\r\n if c >= k:\r\n print(i)\r\n break\r\n c += a[i]\r\nelse:\r\n if c >= k:\r\n print(12)\r\n else:\r\n print(-1)\r\n", "k = int(input())\r\na = list(map(int, input().split()))\r\n\r\na = sorted(a, reverse = True)\r\n\r\ncount = 0\r\ni = 0\r\nwhile (count < k and i < len(a)):\r\n count += a[i]\r\n i += 1\r\n \r\nif (count >= k):\r\n print(i)\r\nelif (count < k):\r\n print(-1)", "n=int(input())\r\na=[int(x) for x in input().split()]\r\na.sort(reverse=True)\r\nif n==0:\r\n print(0)\r\nelse:\r\n res,check=0,0\r\n for i in range(0,len(a)):\r\n res+=a[i]\r\n if res>=n:\r\n print(i+1)\r\n check=1\r\n break\r\n if check==0:\r\n print(-1)", "k=int(input())\r\nlis = list(map(int,input().split()))[:12]\r\nlis=sorted(lis,reverse=True)\r\nm=0\r\nc=0\r\n#print(lis)\r\nfor i in lis:\r\n if(m<k):\r\n m += i\r\n c += 1\r\n #print(c)\r\nif(m<k): print(\"-1\")\r\nelse: print(c)\r\n \r\n \r\n", "k=int(input());a=list(map(int,input().split()));a.sort(reverse=True);i=0\r\nif sum(a)<k:print(-1)\r\nelse:\r\n while k>0:k-=a[i];i+=1\r\n print(i)", "k = int(input())\r\nl = list(map(int,input().split()))\r\nl.sort(reverse = True)\r\nsm = 0\r\nc = 0\r\nif sum(l) >= k:\r\n \r\n while(k>sm and c<len(l)):\r\n sm+=l[c]\r\n c+=1\r\n print(c)\r\nelse:\r\n print(-1)\r\n", "a=int(input())\nl=list(map(int,input().split()))\nl.sort(reverse=True)\nsum1=0\ncount=0\nfor i in range(len(l)):\n if(sum1<a):\n sum1+=l[i]\n count+=1\nif(sum1>=a):\n print(count)\nelse:\n print(-1)\n \t\t\t \t \t\t \t\t\t \t \t\t\t\t \t \t", "k=int(input())\r\na=list(map(int,input().split()))\r\na.sort(reverse = True)\r\nc=0\r\ns=0\r\nif k==0:\r\n print(0) \r\n \r\n \r\nelif k>sum(a):\r\n print(-1)\r\n \r\nelse:\r\n for i in range(12):\r\n s=s+a[i]\r\n if s<k:\r\n c=c+1\r\n else:\r\n c=c+1\r\n break\r\n \r\n print(c)\r\n\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort(reverse=True)\r\nc=0\r\ns=0\r\ni=0\r\nwhile ((s<n) and (i<=(len(l)-1))):\r\n s=s+l[i]\r\n c=c+1\r\n i=i+1\r\nif (s>=n):\r\n print(c)\r\nelse:\r\n print('-1')\r\n", "k = int(input())\r\nmonths = list(map(int, input().split()))\r\nmonths.sort(reverse=1)\r\ncm = 0\r\ni = 0\r\ncounter = 0\r\nif sum(months) < k:\r\n print(-1)\r\nelse:\r\n while cm < k:\r\n cm += months[i]\r\n i += 1\r\n counter += 1\r\n print(counter)\r\n", "w = int(input())\r\nJ = list(map(int, input().split()))\r\nJ.sort(reverse=True)\r\nK = 0\r\nL = 0\r\n\r\nwhile L < len(J) and K < w:\r\n K += J[L]\r\n L += 1\r\n\r\nif K >= w:\r\n print(L)\r\nelse:\r\n print(\"-1\")", "a = int(input())\r\ns = list(map(int, input().split(' ')))\r\nq = 0\r\nwhile a > 0:\r\n if len(s) > 0:\r\n a -= max(s)\r\n q += 1\r\n s.remove(max(s))\r\n else:\r\n q = -1\r\n break\r\nprint(q)\r\n", "n = int(input())\r\nm = [int(x) for x in input().split()]\r\ncnt =0\r\nif n>0:\r\n while(n>0):\r\n if m==[] and n>0:\r\n print(-1)\r\n break\r\n n-=max(m)\r\n m.remove(max(m))\r\n cnt+=1\r\n if n<=0:\r\n print(cnt)\r\nelif n==0:\r\n print(0)", "a=int(input())\nl=list(map(int,input().split()))\nc=0\nl.sort(reverse=True)\nx=0\nsum=0\nwhile sum<a and x<len(l):\n sum+=l[x]\n x+=1\nif sum<a:\n print(-1)\nelse:\n print(x)\n \n\n\t\t\t\t \t\t \t\t\t\t\t\t\t \t \t \t\t \t\t\t", "s = int(input())\nlst = list(map(int,input().split()))\nlst.sort(reverse=True)\nd=0\na=0\nfor i in range(len(lst)):\n if (d>=s):\n break\n d+=lst[i]\n a+=1 \nif(d<s):\n print(\"-1\")\nelse:\n print(a)\n \t\t\t\t\t\t\t \t \t\t\t\t \t\t \t \t", "k=int(input())\r\nnums=list(map(int,input().split()))\r\nnums.sort(reverse=True)\r\nsum=0\r\nfor i in range(len(nums)):\r\n if(sum>=k):\r\n print(i)\r\n break\r\n sum+=nums[i]\r\n if(sum>=k):\r\n print(i+1)\r\n break\r\nif(sum<k):\r\n print(-1)\r\n", "k=int(input())\r\nm=sorted(map(int,input().split()))[::-1]\r\nfor i in range(13):\r\n if sum(m[:i])>=k:\r\n print(i)\r\n exit(0)\r\nprint(-1)", "#https://codeforces.com/problemset/problem/149/A\r\n\r\nk = int(input())\r\na = [int(x) for x in input().split()]\r\na.sort(reverse = True)\r\nif(sum(a) >= k):\r\n answer = 0\r\n while k > 0:\r\n k -= a.pop(0)\r\n answer += 1\r\n if(k<=0):\r\n break\r\nelse:\r\n answer = -1\r\nprint(answer)", "k = int(input())\r\narr = list(map(int, input().split()))\r\n\r\narr.sort(reverse=True)\r\nmin_months = 0\r\ni = 0\r\n\r\nwhile min_months < k and i < 12:\r\n min_months += arr[i]\r\n i += 1\r\n\r\nif min_months < k:\r\n print(-1)\r\nelse:\r\n print(i)\r\n", "k=int(input())\r\na=[int(x) for x in input().split()]\r\ngrowth=0\r\nct=0\r\nwhile(growth<k):\r\n if len(a)==0:\r\n break\r\n else:\r\n growth+=max(a)\r\n ct+=1\r\n a.remove(max(a))\r\n \r\nif growth>=k:\r\n print(ct)\r\nelse:\r\n print(-1)", "#t = int(input())\r\n\r\ndef qSort(listt,start,end):\r\n if start >= end:\r\n return\r\n l = start\r\n r = end\r\n x = listt[(l+r)//2]\r\n\r\n while r > l:\r\n while listt[l] > x: l+=1\r\n while listt[r] < x: r-=1\r\n if r >=l:\r\n listt[l],listt[r] = listt[r],listt[l]\r\n r-=1\r\n l+=1\r\n qSort(listt,start,r)\r\n qSort(listt,l,end)\r\n\r\nk = int(input())\r\na = [int(i) for i in input().split()]\r\nif k == 0:\r\n print(0)\r\nelse:\r\n qSort(a,0,11)\r\n summation = 0\r\n for index in range(12):\r\n current = a[index]\r\n summation+=current\r\n if summation >= k:\r\n print(index+1)\r\n break\r\n else:\r\n print(-1)\r\n \r\n#for _ in range(t):\r\n \r\n \r\n", "k=int(input())\r\narr=list(map(int,input().split(\" \")))\r\narr.sort(reverse=True)\r\nsum=0\r\ncount=0\r\nif(k==0):\r\n print(0)\r\n exit()\r\nfor item in arr:\r\n sum+=item\r\n count+=1\r\n if(sum>=k):\r\n print(count)\r\n exit()\r\nprint(-1)\r\n", "minLength = int(input())\r\nmonths = input()\r\n#monthGrowth = []\r\naux = 0\r\ntotalLength = 0\r\ncount = 0\r\n\r\nmonthGrowth = [int(i) for i in months.split() if i.isdigit()]\r\n\r\nfor i in range(len(monthGrowth)):\r\n for k in range(len(monthGrowth)):\r\n if(k < len(monthGrowth) - 1):\r\n if(monthGrowth[k] < monthGrowth[k+1]):\r\n aux = monthGrowth[k+1]\r\n monthGrowth[k+1] = monthGrowth[k]\r\n monthGrowth[k] = aux\r\n\r\nfor i in range(len(monthGrowth)):\r\n if(totalLength < minLength):\r\n totalLength = totalLength + monthGrowth[i]\r\n count = count + 1\r\n\r\nif(totalLength >= minLength):\r\n print(count)\r\nelse:\r\n print(-1)", "k=int(input())\r\na=list(map(int,input().split()))\r\na.sort(reverse=True)\r\nans=-1\r\ncnt=0\r\nfor i in a:\r\n if k>0:\r\n k-=i\r\n cnt+=1\r\n\r\nif k<=0:\r\n ans=cnt\r\n\r\nprint(ans)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort(reverse=True)\r\nsum=0\r\nx=0\r\nwhile(sum<n and x<len(l)):\r\n sum+=l[x]\r\n x+=1\r\nif(sum<n):\r\n print(-1)\r\nelse:\r\n print(x)#gbn,", "k=int(input())\r\nl=[int(x) for x in input().split()]\r\nl.sort()\r\nt=0\r\nfor i in range(12):\r\n if (k<=0):\r\n break\r\n k-=l[11-i]\r\n t+=1\r\nif (k>0):\r\n print(\"-1\")\r\nelse:\r\n print(t)", "n = int(input())\r\nl = [int(i) for i in input().split()]\r\nl.sort(reverse=True)\r\nsum, count = 0, 0\r\nfor i in l:\r\n sum += i\r\n count += 1\r\n if sum >= n:\r\n break\r\nif sum < n:\r\n count = -1\r\nprint(count if n else 0)", "def flower(k,months):\r\n if sum(months)<k:\r\n return -1\r\n months=sorted(months)\r\n months.reverse()\r\n h=0\r\n j=0\r\n while h<k:\r\n h+=months[j]\r\n j+=1\r\n return j\r\nk=int(input())\r\nm=[int(i) for i in input().split()]\r\nprint(flower(k,m))\r\n", "a = int(input())\ncards = list(map(int, input().split()))\ncards.sort(reverse=True)\ni = 0\nwhile a > 0 and i < 12:\n a -= cards[i]\n i += 1\nif a > 0:\n print(-1)\nelse:\n print(i)\n \t\t \t \t\t\t\t\t \t \t \t \t" ]

[ "n, m, k = map(int, input().split())\r\nd = [-1 for i in range(m)]\r\n \r\nfor i in range(n):\r\n r, c = map(int, input().split())\r\n r -= 1\r\n d[r] = c if d[r] == -1 else min(d[r], c)\r\n \r\nans = 0\r\nfor i in d:\r\n ans += i\r\n \r\nprint(min(ans, k))", "n,m,k = map(int,input().split())\r\n\r\nviable = dict()\r\nfor i in range(n):\r\n row,meals = map(int,input().split())\r\n if row not in viable: viable[row]=meals\r\n else: viable[row] = min(viable[row],meals)\r\ntotal= sum([viable[i] for i in viable])\r\nprint(min(total,k))\r\n", "n, m, k = map(int, input().split())\r\na = [99999999] * (m)\r\nfor i in range(n):\r\n\tnom, j = map(int, input().split())\r\n\ta[nom - 1] = min(a[nom - 1], j)\r\ns = sum(a)\r\nprint(min(s, k))\r\n", "n, m, k = map(int, input().split())\r\na = [1000000]*m\r\nfor i in range(n):\r\n r, c = map(int, input().split())\r\n a[r - 1] = min(a[r - 1], c)\r\nprint(min(sum(a), k))", "n, m, k = [int(i) for i in input().split()]\r\nteeth = dict()\r\ncount = 0\r\n\r\nfor i in range(n):\r\n x, y = [int(i) for i in input().split()]\r\n if x in teeth:\r\n y = min(teeth[x],y)\r\n teeth[x] = y\r\n else:\r\n teeth[x] = y\r\n\r\nfor key in teeth:\r\n count += teeth[key]\r\n\r\nprint(min(count, k))\r\n", "class CodeforcesTask33ASolution:\r\n def __init__(self):\r\n self.result = ''\r\n self.n_m_k = []\r\n self.teeth = []\r\n\r\n def read_input(self):\r\n self.n_m_k = [int(x) for x in input().split(\" \")]\r\n self.teeth = [[] for x in range(self.n_m_k[1])]\r\n for x in range(self.n_m_k[0]):\r\n t = [int(x) for x in input().split(\" \")]\r\n self.teeth[t[0] - 1].append(t[1])\r\n\r\n def process_task(self):\r\n self.result = str(min(sum([min(x) for x in self.teeth]), self.n_m_k[2]))\r\n\r\n def get_result(self):\r\n return self.result\r\n\r\n\r\nif __name__ == \"__main__\":\r\n Solution = CodeforcesTask33ASolution()\r\n Solution.read_input()\r\n Solution.process_task()\r\n print(Solution.get_result())\r\n", "n, m, k = map(int, input().split())\nmin_teeth = [10**6 for i in range(m)]\nfor i in range(n):\n r, c = map(int, input().split())\n r -= 1\n min_teeth[r] = min(min_teeth[r], c)\nprint(min(k, sum(min_teeth)))\n", "I=[int(i) for i in input().split()]\r\nn, m, k = I[0], I[1], I[2]\r\nMin=[10**6 for i in range(m)]\r\nfor i in range(n):\r\n I=[int(j) for j in input().split()]\r\n r, c = I[0], I[1]\r\n if c<Min[r-1]: Min[r-1]=c\r\nans=sum(Min)\r\nif ans>k: print(k)\r\nelse: print(ans)", "from math import inf\r\n\r\nI = lambda: map(int, input().split())\r\n\r\nn, m, k = I()\r\nC = [inf]*m\r\n\r\nfor _ in range(n):\r\n r, c = I()\r\n C[r-1] = min(c, C[r-1])\r\n\r\nprint(min(k, sum(C)))", "n,m,k = map(int,input().split())\r\nmas = [10**7]*m\r\nfor i in range(n):\r\n a,b = map(int,input().split())\r\n mas[a-1] = min(mas[a-1], b)\r\nans = sum(mas)\r\nprint(min(ans, k))\r\n", "import poplib\r\nimport string\r\nimport math\r\n\r\n\r\ndef main_function():\r\n n, m, k = [int(i) for i in input().split(\" \")]\r\n rows = [[] for i in range(m)]\r\n for i in range(n):\r\n x, y = [int(i) for i in input().split(\" \")]\r\n rows[x - 1].append(y)\r\n c = 0\r\n for row in rows:\r\n c += min(row)\r\n print(min(c, k))\r\n\r\n\r\nif __name__ == '__main__':\r\n main_function()", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Apr 1 12:07:04 2022\r\n\r\n@author: gupta\r\n\"\"\"\r\n\r\n#What is for Dinner\r\nt=list(map(int,input().split()))\r\nn=t[0]\r\nm=t[1]\r\nk=t[2]\r\nd={}\r\nfor i in range(n):\r\n q=list(map(int,input().split()))\r\n r=q[0]\r\n v=q[1]\r\n if r in d:\r\n if v<d[r]:\r\n d[r]=v\r\n else:\r\n d[r]=v\r\nr=0\r\nfor i in d:\r\n r+=d[i]\r\nif r>k:\r\n print(k)\r\nelse:\r\n print(r)", "n,m,k=map(int,input().split())\r\nd={}\r\nfor i in range(1,m+1):\r\n d[i]=[]\r\nfor i in range(0,n):\r\n r,c=map(int,input().split())\r\n d[r].append(c)\r\ndef min(l):\r\n m=l[0]\r\n for i in range(0,len(l)):\r\n if l[i]<m:\r\n m=l[i]\r\n return(m)\r\nfor i in range(1,m+1):\r\n d[i]=min(d[i])\r\ns=0\r\nfor i in range(1,m+1):\r\n s=s+d[i]\r\nif s<k:\r\n print(s)\r\nelse:\r\n print(k)\r\n\r\n", "temp = [int(item) for item in input().split(' ')]\r\nn, m, k = temp[0], temp[1], temp[2]\r\ndict = {}\r\n\r\nfor i in range(n):\r\n temp = [int(item) for item in input().split(' ')]\r\n row_num, health = temp[0], temp[1]\r\n\r\n if row_num in dict and health < dict[row_num]:\r\n dict[row_num] = health\r\n elif row_num not in dict:\r\n dict[row_num] = health\r\n\r\n\r\nksum = sum(dict.values())\r\n\r\nprint(ksum if ksum <= k else k)\r\n", "n, m, k = list(map(int, input().split(' ')))\r\nmy_dict = {}\r\nwhile n > 0:\r\n r, c = list(map(int, input().split(' ')))\r\n if r in my_dict and my_dict[r] > c or r not in my_dict:\r\n my_dict[r] = c\r\n n -= 1\r\n\r\nsm = 0\r\nfor value in my_dict.values():\r\n sm += value\r\n\r\nprint(sm if sm <= k else k)\r\n\r\n'''\r\nn, m, k = [int(item) for item in input().split(' ')]\r\nmy_dict = dict()\r\nfor i in range(n):\r\n r, c = [int(item) for item in input().split(' ')]\r\n if r in my_dict and my_dict[r] > c or r not in my_dict:\r\n my_dict[r] = c\r\n\r\nsm = sum(my_dict.values())\r\nprint(sm if sm <= k else k)\r\n'''\r\n", "if __name__ == \"__main__\":\r\n n, m, k = map(int, input().split())\r\n min_c = [10 ** 6 for _ in range(m)]\r\n for _ in range(n):\r\n r, c = map(int, input().split())\r\n min_c[r - 1] = min(min_c[r - 1], c)\r\n \r\n sum_c = sum(min_c)\r\n print(min(sum_c, k))", "lst = [w.rstrip() for w in open(0).readlines()]\r\nn, m, k = map(int, lst[0].split())\r\n\r\ndc = dict()\r\nfor line in lst[1:]:\r\n r, c = map(int, line.split())\r\n if r in dc:\r\n dc[r] = min(dc[r], c)\r\n else:\r\n dc[r] = c\r\nprint(min(k, sum(dc.values())))", "n,m,k=input().split()\r\nn=int(n)\r\nm=int(m)\r\nk=int(k)\r\nl=[]\r\nh=[]\r\ns=0\r\nfor i in range(n):\r\n l.insert(i,input())\r\nfor i in range(1,m+1,1):\r\n d=k\r\n for j in l:\r\n a,b=j.split()\r\n a=int(a)\r\n b=int(b)\r\n if(a==i):\r\n if(d>b):\r\n d=b\r\n s=s+d \r\n\r\nif(s>k):\r\n print(k)\r\nelse:\r\n print(s)\r\n", "n, m, k = [int(item) for item in (input().split(' '))]\r\n_sum = 0\r\n_dict = {}\r\nfor i in range(n):\r\n _row, health = [int(item) for item in (input().split(' '))]\r\n if _row in _dict and _dict[_row] > health or _row not in _dict:\r\n _dict[_row] = health\r\n\r\n# for key in _dict:\r\n# _sum += _dict[key]\r\n\r\nfor item in _dict.values():\r\n _sum += item\r\n\r\n\r\nprint(k if _sum > k else _sum)", "n,m,k=map(int,input().split(' '))\r\nar=[0]*(n+1)\r\nvia=[1000001]*(n+1)\r\ns=0\r\nfor i in range(n):\r\n v1,v2=map(int,input().split(' '))\r\n ar[v1]=v1\r\n via[v1]=min(via[v1],v2)\r\nfor i in range(n+1):\r\n if(via[i]<1000001):\r\n s+=via[i]\r\nprint(min(s,k))\r\n \r\n", "n,m,k = map(int, input().split())\r\ntotlist = [ [] for i in range(m)]\r\nc = 0\r\nfor i in range(0,n):\r\n x,y = map(int, input().split())\r\n totlist[x-1].append(y)\r\nfor i in range(len(totlist)):\r\n c += min(totlist[i])\r\nif c > k:\r\n print(k)\r\n exit()\r\nprint(c)\r\n ", "def main():\r\n n_teeth, n_rows, n_food = map(int, input().split())\r\n rows = dict()\r\n for i in range(n_teeth):\r\n row, val = map(int, input().split())\r\n if row in rows:\r\n rows[row] = min(val, rows[row])\r\n else:\r\n rows[row] = val\r\n c_sum = 0\r\n for row in rows:\r\n c_sum += rows[row]\r\n print(c_sum if c_sum <= n_food else n_food)\r\n\r\nmain()", "n,m,k=list(map(int,input().split()))\r\na=[[] for i in range(m)]\r\nfor i in range(n):\r\n r,c=list(map(int,input().split()))\r\n a[r-1].append(c)\r\nb=0\r\nfor i in range(m):\r\n d=-1\r\n for j in a[i]:\r\n if d==-1 or j<d:\r\n d=j\r\n b+=d\r\nprint(min(b,k))", "n, m, k = list(map(int,input().split()))\r\ntooth = [[0,True]] * n\r\nfor i in range(n):\r\n r, c = list(map(int,input().split()))\r\n if tooth[r-1][0] > c or tooth[r-1][1] == True:\r\n tooth[r-1] = [c,False]\r\nad = 0\r\nfor i in tooth:\r\n ad += i[0]\r\nprint(min(ad,k))", "n,m,k = map(int,input().split())\r\nA = {}\r\nfor i in range(n):\r\n r,c = map(int,input().split())\r\n if r in A:\r\n if c < A[r]:\r\n A[r] = c\r\n else:\r\n continue\r\n else:\r\n A[r] = c\r\n\r\na = A.items()\r\na = list(a)\r\nres = 0\r\nfor i in range(len(a)):\r\n res = res + a[i][1]\r\n\r\nif res < k:\r\n print(res)\r\nelse:\r\n print(k)", "n, m, k = [int(item) for item in input().split(' ')]\r\nmy_dict = dict()\r\nfor i in range(n):\r\n rows, health = [int(item) for item in input().split(' ')]\r\n if(rows in my_dict and my_dict[rows] > health or rows not in my_dict):\r\n my_dict[rows] = health\r\n\r\nanswer = sum(my_dict.values())\r\nprint(answer if answer < k else k)", "n, m, k = map(int, input().split(\" \"))\nc_array = [[] for i in range(m)]\nteeth = []\n\nfor i in range(n):\n r, c = map(int, input().split(\" \"))\n teeth.append((r, c))\n c_array[teeth[i][0]-1].append(teeth[i][1])\n\ndef deploy_algorithm():\n max_crucians = 0\n for i in range(len(c_array)):\n current_min_c = min(c_array[i])\n max_crucians += current_min_c\n \n if max_crucians >= k:\n max_crucians = k\n break\n print(max_crucians)\n\ndeploy_algorithm()", "'''\r\nn, m, k = list(map(int, input().split(' ')))\r\nmy_dict = {}\r\nwhile n > 0:\r\n r, c = list(map(int, input().split(' ')))\r\n key = r\r\n value = c\r\n if key in my_dict:\r\n if my_dict[key] > value:\r\n my_dict[key] = value\r\n else:\r\n my_dict[key] = value\r\n n -= 1\r\nans = 0\r\nfor key, value in my_dict.items():\r\n ans += my_dict[key]\r\nif ans > k:\r\n print(k)\r\nelse:\r\n print(ans)\r\n'''\r\n\r\nn, m, k = [int(item) for item in input().split(' ')]\r\nmy_dict = dict()\r\nfor i in range(n):\r\n r, c = [int(item) for item in input().split(' ')]\r\n if r in my_dict and my_dict[r] > c or r not in my_dict:\r\n my_dict[r] = c\r\n\r\nsm = sum(my_dict.values())\r\nprint(sm if sm <= k else k)\r\n\r\n", "n, m, k = map(int,input().split())\r\na = [200000000]*m\r\nfor i in range(n):\r\n r, c=map(int,input().split())\r\n a[r-1] = min(a[r-1], c)\r\nprint(min(sum(a), k))", "n,m,k=map(int,input().split())\r\nX=[1<<30]*m\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n X[a-1]=min(X[a-1],b)\r\n\r\nprint(min(sum(X),k))\r\n", "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\nn,m,k=map(int,input().split())\r\ns=[10**100 for i in range(m)]\r\nq=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n if b<s[a-1]:\r\n s[a-1]=b\r\nfor x in s:\r\n q+=x\r\nif q>k:\r\n print(k)\r\nelse:\r\n print(q)\r\n", "from collections import defaultdict\r\n\r\nn, m, k = map(int, input().split())\r\nt = dict()\r\n\r\nfor i in range(n):\r\n row, capacity = map(int, input().split())\r\n\r\n if t.get(row) is not None:\r\n current = t.get(row)\r\n if current > capacity:\r\n t[row] = capacity\r\n else:\r\n t[row] = capacity\r\n\r\nres = 0\r\nfor items in t.values():\r\n res += items\r\nif res > k:\r\n print(k)\r\nelse:\r\n print(res)", "n, m, k = map(int, input().split())\r\nrows =[float('inf') for _ in range(m)]\r\nfor _ in range(n):\r\n r, c = map(int, input().split())\r\n rows[r - 1] = min(rows[r - 1], c)\r\n \r\nprint(min(sum(rows), k))", "# https://codeforces.com/problemset/problem/33/A\r\n\r\ndef func_sol(raw_data):\r\n lines = raw_data.split('\\n')[:-1]\r\n n, m, k = map(int, lines[0].split(' '))\r\n data = [list(map(int, line.split(' '))) for line in lines[1:]]\r\n rows = {}\r\n for row, viability in data:\r\n rows[row] = min(rows.get(row, viability), viability)\r\n return str(min(k, sum(rows.values())))\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, m, k = [int(x) for x in input().split()]\na = [1000000] * m\nfor i in range(n):\n\tr, c = [int(x) for x in input().split()]\n\ta[r - 1] = min(a[r - 1], c)\nprint(min(k, sum(a)))\n", "def main():\r\n n, m, k = map(int, input().split())\r\n rows = [float('inf')] * m\r\n\r\n for _ in range(n):\r\n r, c = map(int, input().split())\r\n r -= 1\r\n rows[r] = min(rows[r], c)\r\n\r\n print(min(sum(rows), k))\r\n\r\n\r\nmain()\r\n", "n, m, k = map(int, input().split())\r\nrows_of_teeth = {}\r\nfor i in range(n):\r\n r, t = map(int, input().split())\r\n if r not in rows_of_teeth:\r\n rows_of_teeth[r] = [t]\r\n else:\r\n rows_of_teeth[r].append(t)\r\nj = sum(min(rows_of_teeth[i]) for i in rows_of_teeth)\r\nprint(min(j, k))\r\n", "n, m, k = [int(item) for item in input().split()]\r\n\r\ncont = {}\r\nfor i in range(n):\r\n row, health = [int(item) for item in input().split()]\r\n if row in cont and health < cont[row] or \\\r\n row not in cont:\r\n cont[row] = health\r\n\r\n'''\r\nsumOfHealth = 0\r\nfor val in cont.values():\r\n sumOfHealth += val\r\n'''\r\nsumOfHealth = sum(cont.values())\r\nprint(sumOfHealth if sumOfHealth<=k else k)\r\n", "n,m,k=map(int,input().strip().split())\r\narr=[float(\"inf\")]*m\r\nfor i in range(n):\r\n r,c=map(int,input().strip().split())\r\n arr[r-1]=min(arr[r-1],c)\r\nprint(min(k,sum(arr)))", "n,m,k=map(int,input().split());T=[0]+[-1 for j in range(m)]\r\nfor i in range(n):\r\n row,h=map(int, input().split())\r\n if T[row]>h or T[row]<0:T[row]=h\r\nprint(min(sum(T),k))", "n,m,k=map(int,input().split())\r\nun=[]\r\nfor i in range(m):\r\n un.append(1000001)\r\nfor i in range(n):\r\n q,w=map(int,input().split())\r\n un[q-1]=min(un[q-1],w)\r\nans=0\r\nfor i in range(m):\r\n ans+=un[i]\r\nprint(min(ans,k))\r\n", "n, m, k = [int(item) for item in input().split(' ')]\r\nmy_dict = dict()\r\nfor i in range(n):\r\n r, health = [int(item) for item in input().split(' ')]\r\n if r in my_dict and my_dict[r] > health or r not in my_dict:\r\n my_dict[r] = health\r\n\r\nsummary = sum(my_dict.values())\r\nprint(summary if summary <= k else k)", "n, m, k = [int(item) for item in input().split()]\r\nsum = 0\r\ncont = {}\r\n\r\nfor _len in range(0, n, 1):\r\n row, health = [int(item) for item in input().split()]\r\n if(cont.get(row) != None and cont[row] >= health or cont.get(row) == None):\r\n cont[row] = health\r\n\r\nfor [key, val] in cont.items():\r\n sum += val\r\n\r\nprint((lambda: sum, lambda: k)[sum > k]())\r\n# (sum < k)? cout << sum: cout << k;\r\n", "import math\r\nimport collections\r\nn,m,k=(int(i) for i in input().split())\r\ns=0\r\nd={}\r\nfor i in range(n):\r\n r,c=(int(i) for i in input().split())\r\n if(r in d):\r\n d[r]=min(d[r],c)\r\n else:\r\n d[r]=c\r\nfor i in d:\r\n s+=d[i]\r\nprint(min(k,s))", "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, m, k = map(int, input().split())\r\na = {}\r\nfor _ in range(n) :\r\n r, c = map(int, input().split())\r\n if r in a :\r\n a[r] = min(a[r], c)\r\n else :\r\n a[r] = c\r\nprint(min(sum(a.values()), k))\r\n\r\n \r\n \r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n\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\nl=[]\r\nfor _ in range(n):\r\n a,b = map(int,input().split())\r\n t=False\r\n for i in l:\r\n if i[0]==a:\r\n i.append(b)\r\n t=True\r\n if not t:\r\n l.append([a,b]) \r\ns=0\r\nfor j in l:\r\n s+=min(j[1:])\r\nif s>=k:\r\n print(k)\r\nelse:\r\n print(s)", "n, m, k = list(map(int, input().split(' ')))\r\nteeth = {}\r\n\r\nfor i in range(n):\r\n r, c = list(map(int, input().split(' ')))\r\n if r in teeth and teeth[r] > c or r not in teeth:\r\n teeth[r] = c\r\n\r\n_sum = sum(teeth.values())\r\n\r\nprint(_sum if _sum <= k else k)\r\n", "n,m,k=map(int,input().split())\r\nun=[1000001]*m\r\nfor i in range(n):\r\n q,w=map(int,input().split())\r\n un[q-1]=min(un[q-1],w)\r\nans=0\r\nfor i in range(m):\r\n ans+=un[i]\r\nprint(min(ans,k))\r\n", "from math import *\r\nfrom collections import *\r\nfrom itertools import *\r\nfrom sys import *\r\n\r\n\r\nfrom math import *\r\nfrom collections import *\r\nfrom itertools import *\r\nfrom sys import *\r\nfrom heapq import heappush, heappop\r\nimport bisect\r\nfrom collections import defaultdict\r\n\r\n \r\n\r\n\r\nn, m, k = map(int, input().split())\r\nv = [10**6] * m\r\nfor i in range(n):\r\n r, c = map(int, input().split())\r\n v[r - 1] = min(v[r - 1], c)\r\nprint(min(sum(v), k))\r\n", "n, m, k = map(int, input().rstrip().split(\" \"))\r\nl = [9999999]*m\r\nfor i in range(n):\r\n r, c = map(int, input().rstrip().split(\" \"))\r\n r = r- 1\r\n if l[r] > c:\r\n l[r] = c\r\n\r\ns = sum(l)\r\nif s >= k:\r\n print(k)\r\nelse:\r\n print(s)", "n,m,k = map(int,input().split())\r\n\r\nv = dict()\r\nfor i in range(n):\r\n row,meal = map(int,input().split())\r\n if row not in v: v[row]=meal\r\n else: v[row] = min(v[row],meal)\r\ntotal= sum([v[i] for i in v])\r\nprint(min(total,k))", "cont = list(map(int, input().split()))\r\nn=cont[0]\r\nrows=cont[1]\r\ncrucians=cont[2]\r\n\r\njaws=[]\r\njaws=[crucians]*rows\r\nfor i in range(n):\r\n\r\n temp = list(map(int, input().split()))\r\n indexofRow=temp[0]\r\n viability=temp[1]\r\n\r\n if jaws[indexofRow-1]>viability:\r\n jaws[indexofRow-1]=viability\r\n\r\nresult=0\r\nfor item in jaws:\r\n result+=item\r\n if(result>crucians):\r\n result=crucians\r\n break\r\n\r\nprint(result)", "n, m, k = [int(num) for num in input().split(' ')]\r\nrows = []\r\nfor i in range(m):\r\n rows.append([])\r\nfor i in range(n):\r\n teeth_inp = input().split(' ')\r\n rows[int(teeth_inp[0]) - 1].append(int(teeth_inp[1]))\r\ntotal_viable = 0\r\nfor row in rows:\r\n total_viable += min(row)\r\n\r\nif total_viable < k:\r\n print(total_viable)\r\nelse:\r\n print(k)\r\n", "import sys\r\n \r\n \r\nn,c,b = map(int,input().split())\r\nm = [10000000]*c\r\nmi= 0\r\n\r\nfor i in range(n):\r\n s , k=map(int,sys.stdin.readline().split())\r\n if m[s-1] > k:\r\n m[s-1] = k\r\n\r\nfor i in range(c):\r\n if m[i] != 10000000:\r\n mi+=m[i]\r\n \r\nif mi > b:\r\n print(b)\r\nelse:\r\n print(mi)\r\n ", "n, m, k = map(int, input().split())\nv = [1000000] * m\nfor i in range(n):\n r, c = map(int, input().split())\n v[r - 1] = min(v[r - 1], c)\nprint(min(sum(v), k))\n", "inf=list(map(int,input().split()))\nt,r,c=inf[0],inf[1],inf[2]\nrow=[999999999]*r\nfor i in range(t):\n inf=list(map(int,input().split()))\n row[inf[0]-1]=min(row[inf[0]-1],inf[1])\nans=0\nfor i in row:\n ans+=i\nprint(min(ans,c))\n \n\n \t \t\t\t \t\t\t\t \t\t\t \t\t \t", "n, m, k = list(map(int, input().strip().split(' ')))\r\nminArr = [10**7 for _ in range(m+1)]\r\nminArr[0] = 0\r\n\r\nfor _ in range(n):\r\n row, viability = list(map(int, input().strip().split(' ')))\r\n minArr[row] = min(minArr[row], viability)\r\n \r\nprint(min(sum(minArr), k))", "rows = {}\r\ncount = 0\r\n\r\nn, m, k = map(int, input().split())\r\n\r\nfor i in range(m):\r\n rows[i] = 1000000\r\n\r\nfor i in range(n):\r\n r, c = map(int, input().split())\r\n if rows[r-1] >= c:\r\n rows[r-1] = c\r\n \r\nfor value in rows.values():\r\n count += value\r\n\r\nprint(min(count, k))", "n, m, k = [int(x) for x in input().split()]\n\nteeth_rows = {}\n\nfor i in range(n):\n r, c = [int(x) for x in input().split()]\n if r in teeth_rows:\n if teeth_rows[r] > c:\n teeth_rows[r] = c\n else:\n teeth_rows[r] = c\n\n#print(teeth_rows)\nanswer = sum(teeth_rows.values())\nif answer > k:\n print(k)\nelse:\n print(answer)\n", "n, m, k = [int(item) for item in input().split(\" \")]\r\ntotal = 0\r\ncont = dict()\r\n\r\nfor i in range(n):\r\n row, viability = [int(item) for item in input().split(\" \")]\r\n #if row in cont:\r\n # if cont[row] > viability:\r\n # cont[row] = viability\r\n #if not row in cont:\r\n # cont[row: viability]\r\n if row in cont and cont[row] > viability or row not in cont:\r\n cont[row] = viability\r\n\r\n#for i in range(1, len(cont) + 1):\r\n# total += cont[i]\r\n\r\nfor item in cont:\r\n total += cont[item]\r\n#print(cont)\r\n#total = sum(list(cont.items()))\r\n#print(f'type {type(list(cont.items()))}')\r\n\r\n#if total > k:\r\n# print(k)\r\n#else:\r\n# print(total)\r\nprint(k if total > k else total)\r\n\r\n'''\r\n4 3 18\r\n2 3\r\n1 2\r\n3 6\r\n2 3\r\n'''", "n,m,k = list(map(int,input().split()))\r\na = []\r\nb = []\r\nd = []\r\nl = []\r\nfor i in range(0,n):\r\n r,c = list(map(int,input().split()))\r\n a.append(r)\r\n b.append(c)\r\n#print(a)\r\n#print(b)\r\nfor i in range(1,m+1):\r\n d = []\r\n for j in range(0,len(a)):\r\n if a[j] == i:\r\n d.append(b[j])\r\n if len(d)>0:\r\n l.append(min(d))\r\nf = sum(l)\r\nif k>f:\r\n print(f)\r\nelse:\r\n print(k)", "n,m,k=map(int,input().split())\r\ndic={}\r\nsum=0\r\nfor i in range(n):\r\n r,c=map(int,input().split())\r\n if r not in dic:\r\n dic[r]=c\r\n else:\r\n dic[r]=min(c,dic[r])\r\n\r\nfor i in dic:\r\n sum+=dic[i]\r\n\r\nif sum>=k:\r\n print(k)\r\nelse:\r\n print(sum)", "n, m, k = [int(i) for i in input().split()]\r\nlst = [1000000] * m\r\nfor j in range(n):\r\n r, c = [int(y) for y in input().split()]\r\n lst[r - 1] = min(lst[r - 1], c)\r\nprint(min(sum(lst), k))\r\n", "n,m,k = map(int,input().split())\r\ndiction = {}\r\nfor i in range(n):\r\n nums = list(map(int,input().split()))\r\n if nums[0] not in diction.keys():\r\n diction[nums[0]] = nums[1]\r\n elif nums[0] in diction.keys():\r\n if nums[1] > diction[nums[0]]:\r\n pass\r\n else:\r\n diction[nums[0]] = nums[1]\r\ns = sum(diction.values())\r\nif s >= k:\r\n print(k)\r\nelse:\r\n print(s)", "n,m,k=map(int,input().split())\r\na=[0]+[10**6]*m\r\nfor _ in range(n):\r\n x,y=map(int,input().split())\r\n if a[x]>y:a[x]=y\r\n\r\nprint(min(sum(a),k))\r\n", "import sys\r\nimport math\r\nimport bisect\r\nimport re\r\n\r\ndef solve(A, m):\r\n n = len(A)\r\n A.sort()\r\n ans = 0\r\n for i in range(n):\r\n if i < m and A[i] < 0:\r\n ans += -A[i]\r\n return ans\r\n\r\ndef main():\r\n n, m, k = map(int, input().split())\r\n A = [10 ** 18] * m\r\n for i in range(n):\r\n a, b = map(int, input().split())\r\n A[a-1] = min(A[a-1], b)\r\n print(min(k, sum(A)))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n,m,k = map(int,input().split(' '))\nbz = [1000000]*(m+1)\nwhile n:\n r,c = map(int,input().split(' '))\n bz[r] = min(bz[r],c)\n n-=1\nsum = 0\nfor i in bz[1:]:\n sum += i\nprint(min(sum,k))\n\t\t \t \t\t\t \t \t \t\t\t\t \t\t\t \t\t \t", "import sys\r\nimport math\r\n\r\nn, m, k = [int(x) for x in (sys.stdin.readline()).split()]\r\n\r\nt = [1000000] * (m)\r\nfor i in range(n):\r\n r, c = [int(x) for x in (sys.stdin.readline()).split()]\r\n if(c < t[r - 1]):\r\n t[r - 1] = c\r\n \r\nvsum = sum(t)\r\nif(vsum <= k):\r\n print(vsum)\r\nelse:\r\n print(k)\r\n ", "n, m, k = map(int, input().split())\r\nteeth = {}\r\nfor _ in range(n):\r\n r, c = map(int, input().split())\r\n if r not in teeth:\r\n teeth[r] = c\r\n else:\r\n teeth[r] = min(c, teeth[r])\r\n\r\nans = 0\r\nfor el in teeth:\r\n ans += teeth[el]\r\nprint(min(ans, k))\r\n", "import sys\ndef geti(a):\n return int(float(a))\nx=input().split()\nn=geti(x[0])\nm=geti(x[1])\nk=geti(x[2])\ncnt=[]\nfor i in range(0,m+100):\n cnt.append(2147483648)\nfor i in range(0,n):\n x=input().split()\n a=geti(x[0])\n b=geti(x[1])\n cnt[a]=min(cnt[a],b)\nans=0\nfor i in range(1,m+1):\n ans+=cnt[i]\nprint(min(ans,k))\nsys.exit()", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m, k = map(int, input().split())\r\n\r\nd = [1e7]*m\r\nfor i in range(n):\r\n r, c = map(int, input().split())\r\n d[r-1] = min(d[r-1], c)\r\nprint(min(sum(d), k))\r\n", "n,m,k = map(int,input().split())\r\nA = {}\r\nfor i in range(n):\r\n r,c = map(int,input().split())\r\n if r in A:\r\n if c < A[r]:\r\n A[r] = c\r\n else:\r\n continue\r\n else:\r\n A[r] = c\r\n\r\nres = sum(A.values())\r\n\r\n\r\nif res < k:\r\n print(res)\r\nelse:\r\n print(k)", "# 33A\r\n\r\nfrom sys import stdin\r\n\r\n__author__ = 'artyom'\r\n\r\n\r\ndef read_int_ary():\r\n return map(int, stdin.readline().strip().split())\r\n\r\n\r\nn, m, k = read_int_ary()\r\nrows = [1000001] * m\r\nfor i in range(n):\r\n r, c = read_int_ary()\r\n rows[r - 1] = min(rows[r - 1], c)\r\n\r\nprint(min(sum(rows), k))" ]

[ "b=input()\r\na=[int(i) for i in b]\r\nl=len(a)\r\nflag=0\r\ns=0\r\nf=0\r\nif l%2==1:\r\n flag=1\r\n\r\nelse:\r\n for i in range(l):\r\n if a[i]>7:\r\n flag=1\r\n if(s==l//2 or s==i+1):\r\n break\r\n for j in range(i,-1,-1):\r\n if a[j]==4:\r\n a[j]=7\r\n f-=1\r\n s+=1\r\n flag=0\r\n i=j\r\n break\r\n break\r\n\r\n elif a[i]==7:\r\n s+=1\r\n\r\n elif a[i]>4:\r\n a[i]=7\r\n s+=1\r\n if s<=l//2:\r\n break\r\n\r\n elif a[i]==4:\r\n f+=1\r\n\r\n else:\r\n a[i]=4\r\n f+=1\r\n if f<=l//2:\r\n break\r\n\r\n if s>l//2:\r\n flag=1\r\n for j in range(i-1,-1,-1):\r\n f-=1\r\n if a[j]==7:\r\n f+=1\r\n if a[j-1]==4:\r\n a[j-1]=7\r\n f-=1\r\n s+=1\r\n flag=0\r\n i=j-1\r\n break\r\n s-=1\r\n break\r\n\r\n elif f>l//2:\r\n a[i]=7\r\n s+=1\r\n f-=1\r\n break\r\n\r\n\r\nif flag:\r\n for i in range(l//2+1):\r\n print(4,end='')\r\n for i in range(l//2+1):\r\n print(7,end='')\r\n\r\nelse:\r\n for j in range(i+1):\r\n print(a[j],end='')\r\n for j in range(i+1,l):\r\n if f<l//2:\r\n print(4,end='')\r\n f+=1\r\n else:\r\n print(7,end='') \r\n", "def f(i,c,n4,n7):return s[:i]+c+'4'*n4+'7'*n7\r\nP=print;s=input();n=len(s);n4=n7=n//2;z=(0,'4',n4,n7+1)\r\nif n&1==1:exit(P(f(*z)))\r\nfor i,c in enumerate(s):\r\n if c>'7':break\r\n if c == \"7\":\r\n if n7 == 0:break\r\n n7 -= 1;continue\r\n if n7 > 0:z = (i, \"7\", n4, n7 - 1)\r\n if c > \"4\":break\r\n if c == \"4\":\r\n if n4 == 0:break\r\n n4 -= 1;continue\r\n if n4 > 0:z = (i, \"4\", n4 - 1, n7)\r\n break\r\nelse:z=(n,'',0,0)\r\nP(f(*z))", "def nextLuckyNumber(digits: str) -> str:\r\n n = len(digits)\r\n halfLen = n >> 1\r\n if n & 1 or digits > f\"{'7' * halfLen}{'4' * halfLen}\":\r\n halfLen += 1\r\n return f\"{'4' * halfLen}{'7' * halfLen}\"\r\n\r\n result = [0 for i in range(n)]\r\n remaining = [halfLen, halfLen] # number of 4s and 7s to add in result\r\n for i in range(n):\r\n add4 = False\r\n if remaining[0]:\r\n if digits[i] < '4':\r\n add4 = True\r\n elif digits[i] == '4':\r\n lastIdx = i + remaining[1] # last index that can be replaced with 7\r\n for j in range(i + 1, n):\r\n d = '7' if j <= lastIdx else '4'\r\n if digits[j] < d:\r\n add4 = True\r\n break\r\n elif digits[j] > d:\r\n add4 = False\r\n break\r\n elif j == n - 1:\r\n add4 = True\r\n if add4:\r\n result[i] = '4'\r\n remaining[0] -= 1\r\n else:\r\n result[i] = '7'\r\n remaining[1] -= 1\r\n if result[i] > digits[i] or remaining[1] == 0:\r\n # append remaining 4s and 7s\r\n for k in range(i + 1, i + 1 + remaining[0]):\r\n result[k] = '4'\r\n for k in range(i + 1 + remaining[0], i + 1 + remaining[0] + remaining[1]):\r\n result[k] = '7'\r\n break\r\n\r\n return ''.join(result)\r\n\r\nif __name__ == \"__main__\":\r\n print(nextLuckyNumber(input()))\r\n", "from sys import stdin, stdout\r\n\r\nfrom collections import deque\r\n\r\n\r\n\r\nMOD = 10 ** 9 + 7\r\n\r\nINF = float('inf')\r\n\r\nsze = 10 ** 4 + 1\r\n\r\nEPS = 10 ** -6\r\n\r\n\r\n\r\ns = stdin.readline().strip()\r\n\r\nchallenger = []\r\n\r\n\r\n\r\nfor i in range(len(s)):\r\n\r\n if s[i] in '47':\r\n\r\n challenger.append(s[i])\r\n\r\n elif s[i] in '89':\r\n\r\n update = []\r\n\r\n \r\n\r\n for j in range(1, len(challenger) + 1):\r\n\r\n if challenger[-j] == '4':\r\n\r\n update += ['7'] + challenger[:-j][::-1]\r\n\r\n break\r\n\r\n else:\r\n\r\n update.append('4')\r\n\r\n else:\r\n\r\n update.append('4')\r\n\r\n \r\n\r\n challenger = update[::-1] + ['4' for j in range(len(s[i:]))]\r\n\r\n break\r\n\r\n elif s[i] < '4':\r\n\r\n challenger += ['4' for j in range(len(s[i:]))]\r\n\r\n break\r\n\r\n else:\r\n\r\n challenger += ['7'] + ['4' for j in range(len(s[i:]) - 1)]\r\n\r\n break\r\n\r\n\r\n\r\nwhile True:\r\n\r\n if challenger.count('4') == challenger.count('7'):\r\n\r\n break\r\n\r\n \r\n\r\n if len(challenger) % 2:\r\n\r\n challenger = ['4' for i in range((len(challenger) + 1) // 2)] + ['7' for i in range((len(challenger) + 1) // 2)]\r\n\r\n elif challenger.count('4') > challenger.count('7'):\r\n\r\n cnt = challenger.count('4') - challenger.count('7')\r\n\r\n \r\n\r\n for i in range(len(challenger) - 1, -1, -1):\r\n\r\n if challenger[i] == '4':#1\r\n\r\n challenger[i] = '7'\r\n\r\n cnt -= 2\r\n\r\n \r\n\r\n if not cnt:\r\n\r\n break\r\n\r\n else:\r\n\r\n cnt = [0 for i in range(len(challenger))]\r\n\r\n \r\n\r\n cnt[-1] = challenger[-1] == '7'\r\n\r\n for i in range(2, len(challenger) + 1):\r\n\r\n cnt[-i] = cnt[-i + 1] + (challenger[-i] == '7')\r\n\r\n \r\n\r\n if not challenger[:len(challenger) // 2].count('4'):\r\n\r\n challenger = ['4' for i in range((len(challenger) + 2) // 2)] + ['7' for i in range((len(challenger) + 2) // 2)]\r\n\r\n else:\r\n\r\n first, second = challenger.count('4'), challenger.count('7')\r\n\r\n for j in range(len(challenger) - 2, -1, -1):\r\n\r\n if challenger[j] == '4' and cnt[j + 1] * 2 + first >= second:\r\n\r\n challenger[j] = '7'\r\n\r\n \r\n\r\n for z in range(j + 1, len(challenger)):\r\n\r\n challenger[z] = '4'\r\n\r\n \r\n\r\n break\r\n\r\n\r\n\r\nstdout.write(''.join(challenger))\r\n\r\n\r\n\r\n# Made By Mostafa_Khaled" ]

[ "answer = {\n \"7\": [7],\n \"8\": [7, 2, 2, 2],\n \"9\": [7, 3, 3, 2],\n \"6\": [5, 3],\n \"5\": [5],\n \"4\": [3, 2, 2],\n \"3\": [3],\n \"2\": [2],\n \"1\": [],\n \"0\": []\n}\ndef main():\n _ = input()\n inp = str(input())\n ans = []\n for i in inp:\n ans += answer[i]\n\n ans.sort()\n for i in reversed(ans):\n print(i, end=\"\")\nmain()\n", "x = int(input())\nn = input()\n\nfactorial = {\n 2:[2],\n 3:[3],\n 4:[3,2,2],\n 5:[5],\n 6:[3,5],\n 7:[7],\n 8:[7,2,2,2],\n 9:[7,3,3,2]\n}\n\nres = []\nfor i in n:\n num = int(i)\n if num != 1 and num != 0:\n res += factorial[num]\n\nres = sorted(res,reverse = True)\ns = \"\"\nfor i in res:\n s+=str(i)\n\nprint(int(s))\n \t\t \t\t \t \t \t \t \t\t \t\t\t", "n,s,f=int(input()),input(),\"\"\r\nfor i in s:\r\n a=int(i)\r\n if a==2: g=2\r\n elif a==3: g=3\r\n elif a==4: g=322\r\n elif a==5: g=5\r\n elif a==6: g=53\r\n elif a==7: g=7\r\n elif a==8: g=7222\r\n elif a==9: g=7332\r\n else: continue\r\n f+=str(g)\r\nh=sorted(f,reverse=True)\r\nfor i in h: print(i,end=\"\")", "import sys\r\nimport math\r\ninput = sys.stdin.readline\r\n\r\ndef primefactors(n):\r\n l = []\r\n while n % 2 == 0:\r\n l.append(2)\r\n n = n // 2\r\n\r\n for i in range(3, int(math.sqrt(n)) + 1, 2):\r\n while n % i == 0:\r\n l.append(i)\r\n n = n // i\r\n\r\n if n > 2:\r\n l.append(n)\r\n\r\n return l\r\n\r\nq = int(input())\r\nn = int(input())\r\nd = {}\r\ns = str(n)\r\nfor i in s:\r\n x = int(i)\r\n r = 1\r\n while x > 1:\r\n r = r*x\r\n x -= 1\r\n\r\n l = primefactors(r)\r\n for i in l:\r\n if i in d:\r\n d[i] +=1\r\n\r\n else:\r\n d[i] = 1\r\n\r\nans = []\r\ne = []\r\n# print(d)\r\nfor i in d:\r\n e.append(i)\r\n\r\ne.sort(reverse = True)\r\nfor i in e:\r\n v = d[i]\r\n for j in range(i-1,1,-1):\r\n h = primefactors(j)\r\n for k in h:\r\n d[k] -= v\r\n\r\n while v > 0:\r\n ans.append(i)\r\n v -= 1\r\n\r\nw = []\r\nfor i in ans:\r\n w.append(str(i))\r\n\r\nprint(\"\".join(w))", "def descompunere(nr):\n ls = []\n while nr % 2 == 0:\n ls.append(2)\n nr //= 2\n for i in range(3, nr + 1, 2):\n while nr % i == 0:\n nr //= i\n ls.append(i)\n return ls\n\n\ndef factorial(nr):\n l = []\n for i in range(2, nr + 1):\n l.extend(descompunere(i))\n return l\n\n\ndef refactorizare(l):\n def remake(nr):\n s = descompunere(nr)\n for i in s:\n l.pop(l.index(i))\n\n v = []\n while len(l) > 0:\n v.append(l[0])\n for i in range(l[0], 1, -1):\n try:\n l.pop(l.index(i))\n except ValueError:\n remake(i)\n return v\n\n\ns = input()\ns = input()\n\nv = []\nfor i in s:\n v.extend(factorial(int(i)))\nv.sort(reverse=True)\ns = refactorizare(v)\nfor i in s:\n print(i, end=\"\")\n", "input()\r\na=input()\r\nb=['','','2','3','223','5','35','7','2227','2337']\r\nprint(''.join(sorted(''.join([b[int(i)]for i in a]),reverse=True)))", "input()\r\nprint(''.join(sorted(''.join(['' if int(i) < 2 else ['2','3','322','5','53','7','7222','7332'][int(i)-2] for i in input()])))[::-1])", "input()\r\nss = input()\r\ns = [int(i) for i in ss]\r\nc = []\r\nans = ''\r\nfact = 1\r\n\r\nfrom math import factorial\r\nfor i in s:\r\n fact *= factorial(i)\r\nfirst = [7 , 5 , 3 , 2]\r\nfor i in first:\r\n while fact%factorial(i) == 0:\r\n c.append(i)\r\n fact //= factorial(i)\r\nc.sort(reverse=True)\r\nfor i in c:\r\n ans += str(i)\r\nprint(ans)", "def printl(l: list):\r\n for x in l:print(x,end=' ')\r\n print()\r\n\r\ndef printd(d: dict):\r\n for k,v in d.items():print(k,v)\r\n#========================\r\n\r\n\r\n\r\ndef solve():\r\n d=[\r\n [],\r\n [],\r\n [2],\r\n [3, 2],\r\n [2,2, 3,2],\r\n [5, 2,2,3,2],\r\n [3,2, 5,2,2,3,2],\r\n [7, 3,2,5,2,2,3,2],\r\n [2,2,2, 7,3,2,5,2,2,3,2],\r\n [3,3, 2,2,2,7,3,2,5,2,2,3,2],\r\n ]\r\n dd = [[d[i].count(j) for j in range(10)] for i in range(10)]\r\n\r\n n=int(input())\r\n s=input()\r\n\r\n l=[0 for i in range(10)]\r\n for x in s:\r\n for i in range(10):\r\n l[i]+=dd[int(x)][i]\r\n \r\n if l[6]<l[7]:\r\n l[2]-=l[7]-l[6]\r\n l[3]-=l[7]-l[6]\r\n l[6]=l[7]\r\n \r\n if l[4]<l[5]:\r\n l[2]-=2*(l[5]-l[4])\r\n l[4]=l[5]\r\n\r\n d=0\r\n for i in range(9,1,-1):\r\n print(str(i)*(l[i]-d), end='') \r\n d=l[i]\r\n \r\n\r\n\r\ntt=1\r\nif not tt:\r\n tt=int(input())\r\nfor _ in range(tt):\r\n solve()", "import sys\r\n\r\n\r\ndef convert(digit_string):\r\n prime_replacement = {2: [2], 3: [3], 4: [2, 2, 3], 5: [5], 6: [3, 5],\r\n 7: [7], 8: [2, 2, 2, 7], 9: [2, 3, 3, 7]}\r\n converted_digits = []\r\n for dig in digit_string:\r\n if int(dig) not in (0, 1):\r\n converted_digits.extend(prime_replacement[int(dig)])\r\n return converted_digits\r\n\r\n\r\ninput_file = sys.stdin.read(-1).replace(\"\\r\\n\", \"\\r\")\r\ninput_file = input_file.split()\r\n\r\nnum_digits = int(input_file[0])\r\ndigits = input_file[1]\r\n\r\nnew_digits = convert(digits)\r\nnew_digits.sort(reverse=True)\r\n\r\nnum = \"\"\r\nfor new_digit in new_digits:\r\n num += str(new_digit)\r\nprint(num)\r\n", "# cook your dish here\nimport math\nl=int(input())\nn=input()\ns=[]\nfor i in range(l):\n if(n[i]=='2' or n[i]=='3' or n[i]=='5' or n[i]=='7'):\n s.append(int(n[i]))\n elif(n[i]=='4'):\n s.append(3)\n s.append(2)\n s.append(2)\n elif(n[i]=='6'):\n s.append(5)\n s.append(3)\n elif(n[i]=='8'):\n s.append(7)\n s.append(2)\n s.append(2)\n s.append(2)\n elif(n[i]=='9'):\n s.append(7)\n s.append(3)\n s.append(3)\n s.append(2)\n else:\n continue\ns=sorted(s)\nln=len(s)\nfor i in range(ln):\n print(s[ln-i-1],end=\"\")\nprint()", "# _\r\n#####################################################################################################################\r\n\r\nfrom math import sqrt, ceil\r\n\r\n\r\ndef main():\r\n nDigits = input()\r\n number = input().replace('0', '').replace('1', '')\r\n return maximumValueBuiltFrom(number)\r\n\r\n\r\ndef maximumValueBuiltFrom(number):\r\n digitsFrom = {'2': ('2',), '3': ('3',), '4': ('3', '2', '2'),\r\n '5': ('5', ), '6': ('5', '3'), '7': ('7', ),\r\n '8': ('7', '2', '2', '2'), '9': ('7', '3', '3', '2')}\r\n newDigits = []\r\n for oldDigit in number:\r\n newDigits.extend(digitsFrom[oldDigit])\r\n\r\n newDigits.sort(reverse=True)\r\n return ''.join(newDigits)\r\n\r\n\r\nif __name__ == '__main__':\r\n print(main())\r\n # main()\r\n", "# cook your dish here\r\ndef counter(n):\r\n if n == 2:\r\n arr[n] += 1\r\n elif n == 3:\r\n arr[n] += 1\r\n elif n == 4:\r\n arr[2] += 2\r\n elif n == 5:\r\n arr[5] += 1\r\n elif n == 6:\r\n arr[2] += 1\r\n arr[3] += 1\r\n elif n == 7:\r\n arr[7] += 1\r\n elif n == 8:\r\n arr[2] += 3\r\n elif n == 9:\r\n arr[3] += 2\r\n\r\n\r\ndef reducer(n):\r\n if n == 7:\r\n arr[2] -= 4\r\n arr[3] -= 2\r\n arr[5] -= 1\r\n elif n == 5:\r\n arr[2] -= 3\r\n arr[3] -= 1\r\n elif n == 3:\r\n arr[2] -= 1\r\n\r\n\r\narr = [0] * 10\r\nt = int(input())\r\nf = input()\r\nfor i in f:\r\n for j in range(int(i) + 1):\r\n counter(int(j))\r\nst = ''\r\nfor i in reversed(range(10)):\r\n while arr[i]:\r\n st = st + str(i)\r\n reducer(i)\r\n arr[i] -= 1\r\nprint(st)\r\n", "m = [\"\", \"\", \"2\", \"3\", \"322\", \"5\", \"53\", \"7\", \"7222\", \"7332\"]\r\nn = int(input())\r\ns = input()\r\nx = \"\"\r\nfor c in s:\r\n x += m[int(c)]\r\nprint(\"\".join(reversed(sorted(x))))\r\n", "n= int(input())\r\na = input()\r\nsim_fact = [[],[],[2],[3],[2,2,3],[5],[5,3],[7],[7,2,2,2],[7,3,3,2],[7,5,3],[11],[11,3,2],[13],[14],[15]]\r\nresult= []\r\nfor i in a:\r\n result= result+(sim_fact[int(i)])\r\nresult.sort(reverse=True)\r\nprint(\"\".join(map(str,result)))\r\n\r\n\r\n\r\n", "n=int(input())\r\ns=input()\r\nst=\"\"\r\nl=[\"2\",\"3\",\"223\",\"5\",\"53\",\"7\",\"2227\",\"2337\"]\r\nfor i in s:\r\n\tif i==\"1\" or i==\"0\":\r\n\t\tcontinue\r\n\telse:\r\n\t\tj=i\r\n\t\ta=int(j)\r\n\t\tst=st+l[a-2]\r\nres=''.join(sorted(st,reverse=True))\r\nprint(res)", "n = int(input())\ns = input()\nf = ['', '', '2', '3', '223', '5', '53', '7', '7222', '7332']\nres = ''\nfor i in s:\n res += f[int(i)]\nprint(''.join(sorted(res, reverse=True)))\n\n\t\t\t\t \t\t \t \t \t \t \t \t", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nIarr = lambda: list(map(int,input().split()))\r\nSarr = lambda: list(map(str,input().split()))\r\n\r\ndef main():\r\n dic = {\r\n \"2\": \"2\" ,\"3\": \"3\",\r\n \"4\": \"322\" ,\"5\": \"5\",\r\n \"6\": \"53\" ,\"7\": \"7\",\r\n \"8\": \"7222\" ,\"9\": \"7332\",\r\n }\r\n n = int(input())\r\n s = list(input())\r\n \r\n ans =\"\"\r\n for x in s:\r\n ans += (\"\" if int(x)<2 else dic[x])\r\n print(\"\".join(sorted(ans,reverse=True)))\r\n \r\n\r\nif __name__ == '__main__':\r\n main()", "n=input()\r\nn=int(n)\r\ns=input()\r\na=[]\r\nfor i in range(10):\r\n a.append(0)\r\nfor i in range(n):\r\n if s[i]=='2':\r\n a[2]+=1\r\n elif s[i]=='3':\r\n a[3]+=1\r\n elif s[i]=='4':\r\n a[3]+=1\r\n a[2]+=2\r\n elif s[i]=='5':\r\n a[5]+=1\r\n elif s[i]=='6':\r\n a[5]+=1\r\n a[3]+=1\r\n elif s[i]=='7':\r\n a[7]+=1\r\n elif s[i]=='8':\r\n a[7]+=1\r\n a[2]+=3\r\n elif s[i]=='9':\r\n a[7]+=1\r\n a[2]+=1\r\n a[3]+=2\r\n \r\nfor i in range(9,-1,-1):\r\n if a[i]>0:\r\n while a[i]>0:\r\n print(i,end='')\r\n a[i]-=1\r\n", "# from math import factorial\n\n# n = int(input())\n# a = list(map(int,input()))\n# sum = 1\n# for i in range(n):\n# sum *= factorial(int(a[i]))\n# # print(sum)\n# b = []\n# for i in range(max(a)-1,1,-1):\n# while (sum % factorial(i) == 0):\n# sum = sum // factorial(i)\n# b.append(i)\n# if sum == 1:\n# for x in b:\n# print(x,end='')\n# else:\n# for x in a:\n# print(x,end='')\n \n \nn = int(input())\na = list(input())\ndic = {\"2\" : '2', \"3\":\"3\", \"4\": \"322\", \"5\":\"5\",\"6\":\"53\",\"7\":\"7\",\"8\":\"7222\",\"9\":\"7332\"}\nwhile(a.count('0') > 0):\n a.remove('0')\nwhile(a.count('1') > 0):\n a.remove('1')\nfor i in range(len(a)):\n if a[i] in dic:\n a[i] = dic[a[i]]\nans = \"\"\nfor i in range(len(a)):\n ans += a[i]\n# print(ans)\nans_list = list(ans)\nans_list.sort(reverse = True)\nfor x in ans_list:\n print(x, end=\"\")", "import math\r\nimport bisect\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\nl=I()\r\nn=input()\r\na=[]\r\nfor i in range(l):\r\n if n[i]==\"2\":a+=[2]\r\n elif n[i]==\"3\":a+=[3]\r\n elif n[i]==\"4\":a+=[3,2,2]\r\n elif n[i]==\"5\":a+=[5]\r\n elif n[i]==\"6\":a+=[5,3]\r\n elif n[i]==\"7\":a+=[7]\r\n elif n[i]==\"8\":a+=[7,2,2,2]\r\n elif n[i]==\"9\":a+=[7,3,3,2]\r\na.sort(reverse=True)\r\nfor i in a:\r\n print(i,end=\"\")\r\n\r\n\r\n", "import math,sys,bisect,heapq\r\nfrom collections import defaultdict,Counter,deque\r\nfrom itertools import groupby,accumulate\r\n#sys.setrecursionlimit(200000000)\r\nint1 = lambda x: int(x) - 1\r\ninput = iter(sys.stdin.buffer.read().decode().splitlines()).__next__\r\nilele = lambda: map(int,input().split())\r\nalele = lambda: list(map(int, input().split()))\r\nilelec = lambda: map(int1,input().split())\r\nalelec = lambda: list(map(int1, input().split()))\r\ndef list2d(a, b, c): return [[c] * b for i in range(a)]\r\ndef list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]\r\n#MOD = 1000000000 + 7\r\ndef Y(c): print([\"NO\",\"YES\"][c])\r\ndef y(c): print([\"no\",\"yes\"][c])\r\ndef Yy(c): print([\"No\",\"Yes\"][c])\r\n\r\n \r\nd = {0:[], 1:[], 2: [2],3:[3],4:[2,2,3],5:[5],6:[3,5],7:[7],8:[7,2,2,2],9:[3,3,2,7]}\r\n\r\n# for i,j in d.items():\r\n# print(math.factorial(i))\r\n# l = 1\r\n# for k in j:\r\n# l*=math.factorial(k)\r\n# print(l)\r\n\r\nn = int(input())\r\ns = input()\r\nA = []\r\nfor i in s:\r\n A += d[int(i)]\r\nprint(\"\".join(map(str,sorted(A,reverse = True))))", "import math\r\ninput()\r\na = input()\r\ncheat = ['', '', '2', '3', '322', '5', '53', '7', '7222', '7332']\r\nres = ''\r\nfor i in a:\r\n res+=cheat[int(i)]\r\nprint(''.join(sorted(res, reverse=True)))", "input()\r\nres=[]\r\nfor x in input():\r\n if x=='1' or x=='0':\r\n pass\r\n elif x=='2' or x=='3' or x=='5' or x=='7' :\r\n res.append(int(x))\r\n elif x=='4' :\r\n res.append(3)\r\n res.append(2)\r\n res.append(2)\r\n elif x=='8':\r\n res.append(7)\r\n res.append(2)\r\n res.append(2)\r\n res.append(2)\r\n elif x=='6':\r\n res.append(3)\r\n res.append(5)\r\n elif x=='9':\r\n res.append(2)\r\n res.append(3)\r\n res.append(3)\r\n res.append(7)\r\n\r\nres.sort(reverse=True)\r\nfor x in res:\r\n print(x,end=\"\")\r\n", "A=['0','1','2','3','322','5','53','7','7222','7332']\r\nn=int(input())\r\nm=input()\r\nans=[]\r\nfor i in range(n):\r\n for j in A[int(m[i])]:\r\n if j!='0' and j!='1':\r\n #print(j)\r\n ans.append(j)\r\nans=sorted(ans,reverse=True)\r\nprint(int(''.join(ans)))\r\n\r\n \r\n \r\n", "def drazil(n,s):\r\n dic={\"2\":0,\"3\":0,\"5\":0,\"7\":0}\r\n\r\n for i in range(n):\r\n if s[i]==\"1\" or s[i]==\"0\":\r\n continue\r\n elif s[i]==\"2\":\r\n dic[\"2\"]+=1\r\n elif s[i]==\"3\":\r\n dic[\"3\"]+=1\r\n elif s[i]==\"4\":\r\n dic[\"3\"]+=1\r\n dic[\"2\"]+=2\r\n elif s[i]==\"5\":\r\n dic[\"5\"]+=1\r\n elif s[i]==\"6\":\r\n dic[\"5\"]+=1\r\n dic[\"3\"]+=1\r\n elif s[i]==\"7\":\r\n dic[\"7\"]+=1\r\n elif s[i]==\"8\":\r\n dic[\"7\"]+=1\r\n dic[\"2\"]+=3\r\n elif s[i]==\"9\":\r\n dic[\"7\"]+=1\r\n dic[\"3\"]+=2\r\n dic[\"2\"]+=1\r\n ans=\"7\"*dic[\"7\"]+\"5\"*dic[\"5\"]+\"3\"*dic[\"3\"]+\"2\"*dic[\"2\"]\r\n return ans\r\n\r\nn=int(input())\r\ns=input()\r\nprint(drazil(n,s))", "n=int(input())\r\na=input()\r\ncount=[0]*10\r\nans=\"\"\r\nfor k in a:\r\n i=int(k)\r\n if i==2:\r\n ans+=\"2\"\r\n if i==3:\r\n ans+=\"3\"\r\n if i==4:\r\n ans+=\"322\"\r\n if i==6:\r\n ans+=\"53\"\r\n if i==5 or i==7:\r\n ans+=k\r\n if i==8:\r\n ans+=\"7222\"\r\n if i==9:\r\n ans+=\"7332\"\r\nans=sorted(list(ans))[::-1]\r\nprint(''.join(ans))\r\n", "from math import factorial as f\r\nn=int(input())\r\na=input()\r\nans=''\r\nfor i in a:\r\n i=int(i)\r\n if i not in [0,1]:\r\n if i in [2,3,5,7]: ans+=str(i)\r\n elif i==4: ans+='223'\r\n elif i==6: ans+='35'\r\n elif i==8: ans+='2227'\r\n elif i==9: ans+='2337'\r\nprint(''.join(reversed(sorted(ans))))\r\n ", "from math import prod\n\nFACTORIALS = [1]\nfor i in range(1, 10):\n FACTORIALS.append(FACTORIALS[-1] * i)\ninput()\np = prod(FACTORIALS[ord(x) - 48] for x in input())\nans = []\nfor i in [7, 5, 3, 2]:\n while p % FACTORIALS[i] == 0:\n p //= FACTORIALS[i]\n ans.append(i)\nprint(\"\".join(map(str, ans)))\n", "n = int(input())\r\ns = input()\r\nf = ['0', '1', '2', '3', '223', '5', '35', '7', '2227', '2337']\r\nt = ''\r\nfor c in s:\r\n if c == '0' or c == '1':\r\n continue\r\n t = t + f[int(c)]\r\n\r\nt = sorted(t, reverse = True)\r\nprint(''.join(t))\r\n", "if __name__ == \"__main__\":\r\n num = int(input())\r\n digits = input()\r\n temp = \"\"\r\n result = \"\"\r\n for i in range(0, num):\r\n # 0 or 1\r\n if (digits[i] == \"0\" or digits[i] == \"1\"):\r\n temp += \"\"\r\n # prime numbers\r\n elif (digits[i] == \"2\" or digits[i] == \"3\" or digits[i] == \"5\" or digits[i] == \"7\"):\r\n temp += digits[i]\r\n # composit numbers\r\n else:\r\n if (digits[i] == \"4\"):\r\n temp += \"322\"\r\n elif (digits[i] == \"6\"):\r\n temp += \"53\"\r\n elif (digits[i] == \"8\"):\r\n temp += \"7222\"\r\n elif (digits[i] == \"9\"):\r\n temp += \"7332\"\r\n tempStr = str(temp)\r\n result = ''.join(sorted(tempStr, reverse = True)) \r\n print(result)", "def factorial(n, d):\n res = ''\n result_list = [None, None, 2, 3, 322, 5, 53, 7, 7222, 7332]\n\n for i in d: \n\t if i != '0' and i != '1':\n\t res += str(result_list[int(i)])\n\n res = int(''.join(sorted(list(res),reverse = True)))\n return res\n\nn = int(input())\nd = list(input())\nprint(factorial(n, d))\n", "n = int(input())\r\na = input()\r\na = a.replace(\"9\",\"3372\")\r\na = a.replace(\"8\",\"2227\")\r\na = a.replace(\"7\",\"7\")\r\na = a.replace(\"6\",\"35\")\r\na = a.replace(\"5\",\"5\")\r\na = a.replace(\"4\",\"322\")\r\na = a.replace(\"1\",\"\")\r\na = a.replace(\"0\", \"\")\r\nb = sorted(a)\r\nprint(\"\".join(b[::-1]))\r\n", "n=int(input())\r\na=input()\r\nb=[0,0,0,0,0,0,0,0,0,0]\r\nfor i in range(n):\r\n b[int(a[i])]+=1\r\nc=[]\r\nfor j in range(10):\r\n for k in range(b[j]):\r\n if j==4:\r\n c.append(3)\r\n c.append(2)\r\n c.append(2)\r\n elif j==6:\r\n c.append(5)\r\n c.append(3)\r\n elif j==8:\r\n c.append(7)\r\n c.append(2)\r\n c.append(2)\r\n c.append(2)\r\n elif j==9:\r\n c.append(7)\r\n c.append(3)\r\n c.append(3)\r\n c.append(2)\r\n elif j<2:\r\n pass\r\n else:\r\n c.append(j)\r\nc.sort()\r\nc.reverse()\r\nfor l in range(len(c)):\r\n print(c[l],end='')", "x = int(input())\r\ny = input()\r\nct = {0:[0, 0, 0, 0], 1:[0, 0, 0, 0], 2:[1, 0, 0, 0], 3:[1, 1, 0, 0], 4:[3, 1, 0, 0], 5:[3, 1, 1, 0], 6:[4, 2, 1, 0], 7:[4, 2, 1, 1], 8:[7, 2, 1, 1], 9:[7, 4, 1, 1]}\r\nreal = {2:[1, 0, 0, 0], 3:[1, 1, 0, 0], 4:[3, 1, 0, 0], 5:[3, 1, 1, 0], 6:[4, 2, 1, 0], 7:[4, 2, 1, 1], 8:[7, 2, 1, 1], 9:[7, 4, 1, 1]}\r\nut = {2:[1, 0, 0, 0], 3:[1, 1, 0, 0], 5:[3, 1, 1, 0], 7:[4, 2, 1, 1]}\r\nlx = [0, 0, 0, 0]\r\nfor i in y:\r\n i = int(i)\r\n bad = ct[i]\r\n lx[0] += bad[0]\r\n lx[1] += bad[1]\r\n lx[2] += bad[2]\r\n lx[3] += bad[3]\r\n\r\ns = ''\r\nif lx[-1] >= 1:\r\n copies = lx[-1]\r\n lx[0] -= 4*copies\r\n lx[1] -= 2*copies\r\n lx[2] -= copies\r\n lx[3] -= copies\r\n s += '7' * copies\r\n\r\nif lx[-2] >= 1:\r\n copies = lx[-2]\r\n lx[0] -= 3*copies\r\n lx[1] -= copies\r\n lx[2] -= copies\r\n s += '5' * copies\r\n\r\nif lx[-3] >= 1:\r\n copies = lx[-3]\r\n lx[0] -= copies\r\n lx[1] -= copies\r\n s += '3' * copies\r\n\r\nif lx[-4] >= 1:\r\n copies = lx[-4]\r\n lx[0] -= copies\r\n s += '2' * copies\r\n\r\n\r\nprint(s)\r\n", "'''\r\nimport sys\r\ntry:\r\n sys.stdin = open('in.txt', 'r')\r\nexcept:\r\n pass\r\n'''\r\nimport math\r\n\r\nT = int(input())\r\nst = input(); bd = []\r\nfor i in range(len(st)):\r\n if int(st[i]) in [0, 1]: continue\r\n if int(st[i]) in [2, 3, 5, 7]: bd.append(int(st[i]))\r\n if int(st[i]) == 4: bd.extend([2, 2, 3])\r\n if int(st[i]) == 6: bd.extend([5, 3])\r\n if int(st[i]) == 8: bd.extend([2, 2, 2, 7])\r\n if int(st[i]) == 9: bd.extend([2, 3, 3, 7])\r\nbd.sort(reverse = True)\r\nprint(\"\".join([str(x) for x in bd]))", "import sys\r\ninput = lambda:sys.stdin.readline()\r\n\r\nint_arr = lambda: list(map(int,input().split()))\r\nstr_arr = lambda: list(map(str,input().split()))\r\nget_str = lambda: map(str,input().split())\r\nget_int = lambda: map(int,input().split())\r\nget_flo = lambda: map(float,input().split())\r\n\r\nmod = 1000000007\r\n\r\ndef solve(n,s):\r\n pre = [\"\",\"\",\"2\",\"3\",\"322\",\"5\",\"35\",\"7\",\"7222\",\"7233\"]\r\n ans = \"\"\r\n for i in range(n):\r\n ans += pre[s%10]\r\n s //= 10\r\n\r\n ans = sorted(ans)[::-1]\r\n print(''.join(ans))\r\n\r\n# for _ in range(int(input())):\r\nn = int(input())\r\ns = int(input())\r\nsolve(n,s)", "import math\r\nnumdigits = int(input())\r\narrstring = input()\r\narr = [int(element) for element in arrstring]\r\nproduct = 1\r\nfactorialfactors = {2: 0, 3: 0, 5: 0, 7: 0}\r\ndivisors = [2, 3, 5, 7]\r\n\r\nfor digit in arr:\r\n toadd = math.factorial(digit)\r\n for divi in reversed(divisors):\r\n while toadd % math.factorial(divi) == 0:\r\n factorialfactors[divi] += 1\r\n toadd /= math.factorial(divi)\r\n\r\n\r\n\r\n\r\nfinalanswer = []\r\n\r\nfor x in divisors:\r\n for j in range(factorialfactors[x]):\r\n finalanswer.append(x)\r\n\r\nfinalanswer.reverse()\r\nfor x in range(len(finalanswer)):\r\n print(finalanswer[x], end='')\r\n\r\nprint()", "n = int(input())\r\ns = input()\r\n\r\nf = ['', '', '2', '3', '223', '5', '35', '7', '2227', '2337']\r\n\r\nsol = ''\r\n\r\nfor i in range(n):\r\n sol += f[int(s[i])]\r\n\r\nprint(int(''.join(sorted(sol, reverse=True))))\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\nnum = input()\r\nhm = {'1':'','0':'','2':'2','3':'3','4':'322','5':'5','6':'53','7':'7','8':'7222','9':'7332'}\r\nans = ''\r\nfor d in num:\r\n ans+=hm[d]\r\nans = sorted(ans,reverse=True)\r\nprint(''.join(ans))\r\n", "temp=input()\r\ninp=list(input())\r\ndict_inp={'0':\"\",'1':\"\",'2':\"2\",'3':\"3\",'4':\"322\",'5':\"5\"\r\n ,'6':\"53\",'7':\"7\",'8':\"7222\",'9':\"7332\"}\r\nfor n in range(0,len(inp)):\r\n inp[n]=dict_inp[inp[n]]\r\nprint(\"\".join( ( sorted( \"\".join(inp),reverse=True) ) ) )\r\n\r\n \r\n \r\n ", "n = int(input())\r\na = input()\r\nx = []\r\nfor cifra in a:\r\n if cifra == '2':\r\n x.append(2)\r\n if cifra == '3':\r\n x.append(3)\r\n if cifra == '4':\r\n x.append(2)\r\n x.append(2)\r\n x.append(3)\r\n if cifra == '5':\r\n x.append(5)\r\n if cifra == '6':\r\n x.append(3)\r\n x.append(5)\r\n if cifra == '7':\r\n x.append(7)\r\n if cifra == '8':\r\n x.append(2)\r\n x.append(2)\r\n x.append(2)\r\n x.append(7)\r\n if cifra == '9':\r\n x.append(2)\r\n x.append(3)\r\n x.append(3)\r\n x.append(7)\r\nx.sort(reverse=True)\r\nx = \"\".join(map(str, x))\r\nx = int(x)\r\nprint(x)\r\n", "n=int(input())\ns=input()\nans=''\n\ndic={'1':'','0':'','2':'2','3':'3','4':'322','5':'5','6':'35','7':'7','8':'2227','9':'3327'}\nfor i in s:\n ans+=dic[i]\nans=list(ans)\nans.sort(reverse=True)\nprint(\"\".join(ans))\n", "# aadiupadhyay\r\nimport os.path\r\nfrom math import gcd, floor, ceil\r\nfrom collections import *\r\nimport sys\r\nmod = 1000000007\r\nINF = float('inf')\r\ndef st(): return list(sys.stdin.readline().strip())\r\ndef li(): return list(map(int, sys.stdin.readline().split()))\r\ndef mp(): return map(int, sys.stdin.readline().split())\r\ndef inp(): return int(sys.stdin.readline())\r\ndef pr(n): return sys.stdout.write(str(n)+\"\\n\")\r\ndef prl(n): return sys.stdout.write(str(n)+\" \")\r\n\r\n\r\nif os.path.exists('input.txt'):\r\n sys.stdin = open('input.txt', 'r')\r\n sys.stdout = open('output.txt', 'w')\r\n\r\nn = inp()\r\ns = st()\r\nd = {'4': '322', '6': '53', '8': '7222', '9': '7332'}\r\nans = ''\r\nfor i in s:\r\n if i == '1' or i == '0':\r\n continue\r\n a = i\r\n if i in d:\r\n a = d[i]\r\n ans += a\r\nans = list(ans)\r\nans.sort(reverse=True)\r\npr(''.join(ans))\r\n", "# Drazil and Factorial\r\nn = int(input())\r\ns = input()\r\nsum = 1\r\nfor i in s:\r\n for j in range(1,int(i)+1):\r\n sum *= j\r\ns = \"\"\r\nwhile sum % 5040 == 0:\r\n s +=\"7\"\r\n sum //= 5040\r\nwhile sum % 120 == 0:\r\n s += \"5\"\r\n sum //= 120\r\nwhile sum % 6 == 0:\r\n s += \"3\"\r\n sum //= 6\r\nwhile sum % 2 == 0:\r\n s += \"2\"\r\n sum //= 2\r\nprint(s)", "import math\r\n#n,m=map(int,input().split())\r\nfrom collections import Counter\r\n#for i in range(n):\r\nimport math\r\n#for _ in range(int(input())):\r\n#n = int(input())\r\n#for _ in range(int(input())):\r\n#n = int(input())\r\nimport bisect\r\n'''for _ in range(int(input())):\r\n\r\n n=int(input())\r\n\r\n n,k=map(int, input().split())\r\n\r\n arr = list(map(int, input().split()))'''\r\n#n, m, k = [int(x) for x in input().split()]\r\n#n,m=map(int,input().split())\r\nn=int(input())\r\ns=list(input())\r\n#s.sort(reverse=True)\r\nd={}\r\nd[2]=2\r\nd[3]=3\r\nd[4]=322\r\nd[5]=5\r\nd[6]=53\r\nd[7]=7\r\nd[8]=7222\r\nd[9]=7332\r\nans=\"\"\r\nfor i in s:\r\n if i!=\"0\" and i!=\"1\":\r\n ans+=str(d[int(i)])\r\nans=list(ans)\r\nprint(\"\".join(sorted(ans))[::-1])\r\n\r\n\r\n", "n = int(input())\r\ndic = {\r\n 2:2,3:3,4:322,5:5,6:53,7:7,8:7222,9:7332\r\n}\r\nnum = list(map(int,list(input())))\r\nout = []\r\nfor i in num:\r\n if i not in [0,1]:\r\n out.append(dic[i])\r\nout.sort(reverse = True)\r\nnew = \"\".join(map(str,out))\r\nnum = list(map(int,new))\r\nnum.sort(reverse=True)\r\nprint(\"\".join(map(str,num)))", "n=int(input())\r\na=list(map(int,input()))\r\nans=[]; oof=[0,0,[2],[3],[2,2,3],[5],[3,5],[7],[2,2,2,7],[2,3,3,7]]\r\nfor item in a:\r\n if item==1 or item==0: continue\r\n ans+=oof[item]\r\nans.sort(reverse=True)\r\nprint(''.join(str(item) for item in ans))", "n=int(input())\r\ns=input()\r\nans=[]\r\nfor i in s:\r\n if i in ['0','1']:\r\n continue\r\n elif i in [ '2','3','5','7']:\r\n ans.append(i)\r\n elif i=='4':\r\n ans.extend(['3','2','2'])\r\n elif i=='6':\r\n ans.extend(['5','3'])\r\n elif i=='8':\r\n ans.extend(['7','2','2','2'])\r\n elif i=='9':\r\n ans.extend(['7','3','3','2'])\r\n\r\nans.sort(reverse=True)\r\nprint(''.join(ans))\r\n \r\n", "y, x, biggest = input(), input(), ''\r\nfor i in x:\r\n if i == '0' and i == '1': continue\r\n elif i == '2' or i == '3' or i == '5' or i == '7': biggest += i\r\n elif i == '4': biggest += '322'\r\n elif i == '6': biggest += '53'\r\n elif i == '8': biggest += '7222'\r\n elif i == '9': biggest += '7332'\r\nbiggest = [int(i) for i in biggest]\r\nbiggest = sorted(biggest)[::-1]\r\nbiggest = [str(i) for i in biggest]\r\nprint(\"\".join(biggest))", "n = int(input())\r\nm = str(input())\r\ndef f(k):\r\n if k < 2:\r\n return 1\r\n return k*f(k-1)\r\nans = 1\r\nfor i in range(n):\r\n ans *= f(int(m[i]))\r\na = []\r\nwhile ans % 7 == 0:\r\n a.append(7)\r\n ans //= f(7)\r\nwhile ans % 5 == 0:\r\n a.append(5)\r\n ans //= f(5)\r\nwhile ans % 3 == 0:\r\n a.append(3)\r\n ans //= f(3)\r\nwhile ans % 2 == 0:\r\n a.append(2)\r\n ans //= f(2)\r\nprint(str(a)[1:-1].replace(\", \", \"\"))\r\n", "x=int(input())\r\narr=[\"\",\"\",\"2\",\"3\",\"223\",\"5\",\"53\",\"7\",\"7222\",\"7332\"]\r\nnumbers=input()\r\nc=''\r\nfor i in numbers:\r\n m=int(i)\r\n c+=arr[m]\r\nreverList=sorted(c,reverse=True)\r\nprint(''.join(reverList))", "n = int(input())\r\ns = input()\r\n\r\nA = []\r\nA.append([2])\r\nA.append([3])\r\nA.append([3, 2, 2])\r\nA.append([5])\r\nA.append([5, 3])\r\nA.append([7])\r\nA.append([7, 2, 2, 2])\r\nA.append([7, 3, 3, 2])\r\n\r\nans = []\r\nfor c in s :\r\n\tif not c in \"10\" :\r\n\t\tindex = ord(c) - ord(\"0\") - 2\r\n\t\tans.extend(A[index])\r\n\t\t\r\nans.sort(reverse = True)\r\nfor c in ans :\r\n\tprint(c, end='')\r\nprint()", "import math\r\nint(input())\r\nn=list(input())\r\na={\"1\":\"\",\"2\":\"2\",\"3\":\"3\",\"4\":\"322\",\"5\":\"5\",\"6\":\"53\",\"7\":\"7\",\"8\":\"7222\",\"9\":\"7332\",\"0\":\"\"}\r\ntmp=\"\"\r\nfor i in n:\r\n tmp+=a[i]\r\ntmp=list(tmp)\r\ntmp.sort(reverse=True)\r\nprint(\"\".join(tmp))\r\n ", "n = int(input())\r\na = input().strip()\r\n\r\nres = []\r\nconvert = {\r\n 0: [],\r\n 1: [],\r\n 2: [2],\r\n 3: [3],\r\n 4: [3, 2, 2],\r\n 5: [5],\r\n 6: [5, 3],\r\n 7: [7],\r\n 8: [7, 2, 2, 2],\r\n 9: [7, 3, 3, 2]\r\n}\r\n\r\nfor letter in a:\r\n res+=convert[int(letter)]\r\n \r\nres = sorted(res)[::-1]\r\nfor num in res:\r\n print(num, end=\"\")", "n = int(input())\na = [int(i) for i in input()]\n\ndigit = [0 for i in range(10)]\n\nfor i in range(n):\n\tif a[i] > 1:\n\t\tif a[i] == 4:\n\t\t\tdigit[3] += 1\n\t\t\tdigit[2] += 2\n\t\telif a[i] == 6:\n\t\t\tdigit[5] += 1\n\t\t\tdigit[3] += 1\n\t\telif a[i] == 8:\n\t\t\tdigit[7] += 1\n\t\t\tdigit[2] += 3\n\t\telif a[i] == 9:\n\t\t\tdigit[7] += 1\n\t\t\tdigit[3] += 2\n\t\t\tdigit[2] += 1\n\n\t\telse:\n\t\t\tdigit[a[i]] += 1\n# print(digit)\nnum = ''\ni = 9\nwhile i > 1:\n\twhile i > 1 and digit[i] < 1:\n\t\ti -= 1\n\tif i > 1:\n\t\tnum += str(i)\n\t\tdigit[i] -= 1\n\nprint(num) ", "from math import factorial as f\n\nn = int(input())\na = input()\n\nval = 1\nfor c in a:\n val *= f(int(c))\n\nret = ''\nwhile val % 7 == 0:\n ret += '7'\n val //= f(7)\nwhile val % 5 == 0:\n ret += '5'\n val //= f(5)\n\nwhile val % 3 == 0:\n ret += '3'\n val //= f(3)\nwhile val % 2 == 0:\n ret += '2'\n val //= f(2)\n\nassert(val == 1)\nprint(ret)\n", "n=int(input())\r\nstring=list(input())\r\nans=[]\r\nfor i in string:\r\n if i==\"1\" or i ==\"0\":\r\n continue\r\n if i==\"4\":\r\n ans.append(3)\r\n ans.append(2)\r\n ans.append(2)\r\n continue\r\n if i==\"6\":\r\n ans.append(5)\r\n ans.append(3)\r\n continue\r\n if i==\"8\":\r\n ans.append(7)\r\n ans.append(2)\r\n ans.append(2)\r\n ans.append(2)\r\n continue\r\n if i==\"9\":\r\n ans.append(7)\r\n ans.append(3)\r\n ans.append(3)\r\n ans.append(2)\r\n continue\r\n else:\r\n ans.append(int(i))\r\nsol=\"\"\r\nans.sort(reverse=True)\r\nfor i in ans:\r\n sol+=str(i)\r\nprint(sol)", "from collections import defaultdict\r\n\r\nfact_max_digit = {\r\n '0': '',\r\n '1': '',\r\n '2': '2',\r\n '3': '3',\r\n '4': '322',\r\n '5': '5',\r\n '6': '53',\r\n '7': '7',\r\n '8': '7222',\r\n '9': '7332',\r\n}\r\n\r\nres = ''\r\nn = int(input())\r\ns = input()\r\nfor e in s:\r\n res += fact_max_digit[e]\r\nprint(''.join(sorted(list(res), reverse=True)))", "d = {\n 0: [],\n 1: [], \n 2: [2],\n 3: [3],\n 4: [2, 2, 3],\n 5: [5],\n 6: [3, 5],\n 7: [7],\n 8: [2, 2, 2, 7],\n 9: [2, 3, 3, 7]\n}\n\nt = int(input())\n\ns = input()\n\nnewlist = []\n\nfor i in range(t):\n newlist += d[int(s[i])]\n \nnewlist.sort(reverse = True)\n\nfor i in range(len(newlist)):\n print(newlist[i], end=\"\")\n \t \t \t \t \t\t\t\t \t\t \t\t\t \t \t", "n = int(input())\r\na = input()\r\na = a[::-1]\r\n\r\nans = ''\r\n\r\nfor i in a:\r\n if i == '9':\r\n ans += '7332'\r\n elif i == '8':\r\n ans += '7222'\r\n elif i == '7':\r\n ans += '7'\r\n elif i == '6':\r\n ans += '53'\r\n elif i == '5':\r\n ans += '5'\r\n elif i == '4':\r\n ans += '322'\r\n elif i == '3':\r\n ans += '3'\r\n elif i == '2':\r\n ans += '2'\r\n\r\nnum_list = sorted(list(map(int, ans)), reverse=True)\r\nnum_list = map(str, num_list)\r\n\r\nprint(''.join(num_list))\r\n", "I=lambda:list(map(int,input().split()))\r\nn=I()\r\nf=['','','2','3','223','5','53','7','7222','7332']\r\n\r\nv=''\r\nfor i in input():\r\n v+=f[int(i)]\r\nv=list(v)\r\nv.sort(reverse=True)\r\nprint(''.join(v))\r\n", "n = int(input())\r\na = input()\r\na = a.replace('9', '7332').replace('8', '7222').replace('6', '53').replace('4','322').replace('0', '').replace('1', '')\r\na = list(a)\r\na.sort(reverse=True)\r\nprint(''.join(a))", "input()\r\na_str = input()\r\n\r\ndef factorial(x):\r\n if x == 0:\r\n return 0\r\n f = 1\r\n for i in range(2, x + 1):\r\n f *= i\r\n return f\r\n\r\ndef populate_primes(n, primes):\r\n while n > 1:\r\n for k in primes.keys():\r\n while n % k == 0:\r\n primes[k] += 1\r\n n //= k\r\n\r\n\r\nprimes = {2: 0, 3: 0, 5: 0, 7: 0}\r\nretrieval = {\r\n 2: {2: 1},\r\n 3: {2: 1, 3: 1},\r\n 5: {2: 3, 3: 1, 5: 1},\r\n 7: {2: 4, 3: 2, 5: 1, 7: 1}\r\n}\r\n\r\n\r\nfor m in a_str:\r\n mfp = factorial(int(m))\r\n populate_primes(mfp, primes)\r\n\r\n\r\norder_primes = list(primes.keys())\r\norder_primes.sort(reverse=True)\r\n\r\n\r\nr_str = ''\r\nfor p in order_primes:\r\n while primes[p] > 0:\r\n for k in primes.keys():\r\n if k <= p:\r\n primes[k] -= retrieval[p][k]\r\n r_str += str(p)\r\n\r\nprint(r_str)\r\n", "def count(digit):\r\n global l\r\n for i in range(0,digit-1):\r\n for d in div[i]:\r\n l[d-2]+=1\r\n\r\n\r\ndiv = [[2],[3],[2,2],[5],[2,3],[7],[2,2,2],[3,3]] #descompunerea in factori primi a cifrelor\r\nn = int(input())\r\nnumber = input()\r\nl = [0]*8\r\nfor i in number:\r\n if int(i) > 1:\r\n count(int(i))\r\nres = \"\"\r\n\r\nfor i in range(7,-1,-1):\r\n for _ in range(0,l[i]):\r\n for k in range(0,i):\r\n #print(i+2,k+2)\r\n if len(div[k])>1:\r\n for j in div[k]:\r\n l[j-2] -=1\r\n #print(l)\r\n else:\r\n l[k]-=1\r\n\r\n#print(l)\r\nfor i in range(7,-1,-1):\r\n res += (str(i+2)*l[i])\r\nprint(res)\r\n\r\n", "n = int(input())\r\na = input()\r\nns = []\r\nprime = [2, 3, 5 ,7]\r\nfor i in a:\r\n m = int(i)\r\n if m in prime: ns.append(m)\r\n elif m == 4: ns += [3, 2, 2]\r\n elif m == 6: ns += [5, 3]\r\n elif m == 8: ns += [7, 2, 2, 2]\r\n elif m == 9: ns += [7, 2, 3, 3]\r\nns.sort()\r\nfor i in range(len(ns) - 1, -1, -1): print(ns[i], end = '')", "dic = {\r\n '4': '322',\r\n '6': '53',\r\n '8': '7222',\r\n '9': '7332'\r\n}\r\n\r\nn = int(input())\r\nstring = input()\r\n\r\nans = ''\r\n\r\nfor char in string:\r\n if char == '0' or char == '1':\r\n continue\r\n elif not char in dic:\r\n ans += char\r\n else:\r\n ans += dic[char]\r\n\r\nprint(''.join(sorted(ans)[::-1]))", "def find(n,k): # finding k prime factor in n!\r\n ans=0\r\n i=1\r\n while n//(k**i) > 0 :\r\n ans+=(n//(k**i))\r\n i+=1\r\n return(ans)\r\n\r\n\r\ndef chebishev(n): # finding all prime factors in n!\r\n ans={2:0 , 3:0 , 5:0 , 7:0}\r\n for i in ans:\r\n ans[i]+=find(n,i)\r\n return(ans)\r\n\r\n\r\nif __name__ == '__main__':\r\n\r\n n=int(input())\r\n s=input()\r\n\r\n q={2:0 , 3:0 , 5:0 , 7:0}\r\n\r\n for i in s:\r\n i=int(i)\r\n if i==0 or i==1 :\r\n continue\r\n y=chebishev(i)\r\n for i in y:\r\n q[i]+=y[i]\r\n\r\n t=sorted(q)\r\n t.reverse()\r\n\r\n answer=[]\r\n\r\n for i in t:\r\n while q[i]>0 :\r\n answer.append(str(i))\r\n o=chebishev(i)\r\n for j in o:\r\n q[j]-=o[j]\r\n \r\n answer.sort()\r\n answer.reverse()\r\n print(''.join(answer))\r\n\r\n\r\n\r\n", "#See the constraints; check if Brute force is useful\r\n#Figure out a realtion or general formula if possible\r\n#Find the corner cases\r\n#dp,prefix sum, greedy solution or logical \r\n#Ek baar aur kr bro\r\n#Be organised \r\n#Think hard you can do it\r\n\r\ndef singleinput():R = int(input());return R\r\ndef strinput():R = str(input());return R\r\ndef intarray():As = list(map(int,input().split()));return As\r\ndef matrixinput(arr): As = list(map(int,input().split())); arr.append(As)\r\n\r\nfact = ['','','2','3','223','5','53','7','7222','7332']\r\nn = singleinput()\r\na = strinput()\r\nans = ''\r\nfor i in range(0,len(a)):\r\n x = a[i]\r\n ans = ans + fact[int(x)]\r\n \r\nprint(\"\".join(sorted(ans,reverse =True)))", "n=int(input())\r\nx=input()\r\nst=''\r\nfor i in x:\r\n if i=='2':\r\n st+='2'\r\n elif i=='3':\r\n st+='3'\r\n elif i=='4':\r\n st+='322'\r\n elif i=='5':\r\n st+='5'\r\n elif i=='6':\r\n st+='53'\r\n elif i=='7':\r\n st+='7'\r\n elif i=='8':\r\n st+='7222'\r\n elif i=='9':\r\n st+='7332'\r\n else:\r\n pass\r\nlst=[]\r\nst2=''\r\nfor i in st:\r\n lst.append(int(i))\r\nlst.sort()\r\nlst.reverse()\r\nfor i in range(len(lst)):\r\n st2+=str(lst[i])\r\nprint(st2)", "freq = [0 for i in range(10)]\r\nfactor = [[], [1], [2], [3], [2, 2], [5], [2, 3], [7], [2, 2, 2], [3, 3]]\r\nn = int(input())\r\nval = list(input())\r\nfor i in val:\r\n v = int(i)\r\n for j in range(1, v+1):\r\n for k in factor[j]:\r\n freq[k] += 1\r\nfor i in range(9, 1, -1):\r\n for j in range(1, i):\r\n for k in factor[j]:\r\n freq[k] -= freq[i]\r\n print(str(i) * freq[i], end=\"\")\r\nprint()", "n=int(input())\r\ns=input()\r\nans=''\r\nfor i in s:\r\n if(i=='2' or i=='3' or i=='5' or i=='7'):\r\n ans+=i\r\n elif(i=='4'):\r\n ans+='322'\r\n elif(i=='6'):\r\n ans+='53'\r\n elif(i=='8'):\r\n ans+='7222'\r\n elif(i=='9'):\r\n ans+='7332'\r\nprint(''.join(sorted(ans,reverse=True)))", "from collections import defaultdict as dd\r\nd=dd(lambda:0)\r\nfrom sys import stdin\r\nstdin.readline\r\n\r\ndef mp():return map(int,input().split())\r\ndef it():return int(input())\r\n\r\nn=it()\r\ns=list(input())\r\nfor i in range(n):\r\n\tif s[i]=='1' or s[i]=='0':\r\n\t\tcontinue\r\n\telif (int(s[i])!=9 and int(s[i])%2!=0) or s[i]=='0' or s[i]=='2':\r\n\t\t# d.append(int(s[i]))\r\n\t\td[int(s[i])]+=1\r\n\telif s[i]=='9':\r\n\t\td[7]+=1\r\n\t\td[3]+=2\r\n\t\td[2]+=1\r\n\telif s[i]=='4':\r\n\t\td[2]+=2\r\n\t\td[3]+=1\r\n\telif s[i]=='6':\r\n\t\td[5]+=1\r\n\t\td[3]+=1\r\n\telif s[i]=='8':\r\n\t\td[2]+=3\r\n\t\td[7]+=1\r\nv=[]\r\nj=[]\r\n# print(dict(d))\r\nfor i in d:\r\n\tj.append([i,d[i]])\r\nj.sort()\r\nj.reverse()\r\nfor t in range(len(j)):\r\n\tv.append(str(j[t][0])*j[t][1])\r\nk=''.join(v)\r\nprint(k)\r\n", "#import math #math.factorial\r\n\r\ndef answer(n, a): #list of integer chars.\r\n ans_ary = []\r\n for i in range(n):\r\n if a[i] == '4':\r\n ans_ary.append(3)\r\n ans_ary.append(2)\r\n ans_ary.append(2)\r\n elif a[i] == '6':\r\n ans_ary.append(5)\r\n ans_ary.append(3)\r\n elif a[i] == '8':\r\n ans_ary.append(7)\r\n ans_ary.append(2)\r\n ans_ary.append(2)\r\n ans_ary.append(2)\r\n elif a[i] == '9':\r\n ans_ary.append(7)\r\n ans_ary.append(3)\r\n ans_ary.append(3)\r\n ans_ary.append(2)\r\n elif (a[i] == '0') or (a[i] == '1'):\r\n pass\r\n else:\r\n ans_ary.append(int(a[i]))\r\n ans_ary.sort(reverse = True)\r\n \r\n return ''.join(map(str, ans_ary))\r\n\r\ndef main():\r\n n = int(input())\r\n a = list(input())\r\n print(answer(n, a))\r\n\r\n\r\n return\r\nmain()", "import sys\r\ninput =sys.stdin.readline\r\nx = int(input())\r\ny =str(int(input()))\r\nli = ['', '', '2', '3', '322', '5', '53', '7', '7222', '7332']\r\n\r\nstr1 = ''\r\nfor i in y:\r\n\tstr1 += li[int(i)]\r\n#sorted(str1,reverse = True)\r\nprint(\"\".join(sorted(str1)[::-1]))\r\n", "import sys\r\n\r\n\r\ndef main():\r\n get_fr = {\"0\" : \"\",\r\n \"1\" : \"\",\r\n \"2\" : \"2\",\r\n \"3\" : \"3\",\r\n \"4\" : \"322\",\r\n \"5\" : \"5\",\r\n \"6\" : \"53\",\r\n \"7\" : \"7\",\r\n \"8\" : \"7222\",\r\n \"9\" : \"7332\"}\r\n\r\n n = input()\r\n st = input()\r\n answer = []\r\n for i in st:\r\n answer += list(get_fr[i])\r\n answer.sort(reverse = True)\r\n \r\n print(\"\".join(answer))\r\n\r\nmain()\r\n", "coll=[\"\",'',\"2\",\"3\",\"322\",\"5\",\"53\",'7','7222','7332']\r\nn=int(input())\r\nnum=input()\r\ns=\"\"\r\nfor i in range(n):\r\n a=ord(num[i])-48\r\n s+=coll[a]\r\nprint(''.join(reversed(sorted(list(s)))))", "four = [3, 2, 2]\nsix = [5, 3]\neight = [7, 2, 2, 2]\nnine = [7, 3, 3, 2]\nln = int(input())\nn = int(input())\nl = []\nwhile(n > 0):\n dig = n % 10\n n //= 10\n if dig == 4:\n l += four\n elif dig == 6:\n l += six\n elif dig == 8:\n l += eight\n elif dig == 9:\n l += nine\n elif dig != 1 and dig != 0:\n l.append(dig)\n\nl.sort(reverse = True)\nans = \"\"\nfor i in range(len(l)):\n ans += str(l[i])\nprint(ans)\n", "n = int(input())\r\na = input()\r\nv = [0] * 8\r\n\r\nfor digit in a:\r\n if int(digit) == 2:\r\n v[int(digit)] += 1\r\n elif int(digit) == 3:\r\n v[int(digit)] += 1\r\n elif int(digit) == 4:\r\n v[3] += 1\r\n v[2] += 2\r\n elif int(digit) == 5:\r\n v[int(digit)] += 1\r\n elif int(digit) == 6:\r\n v[5] += 1\r\n v[3] += 1\r\n elif int(digit) == 7:\r\n v[int(digit)] += 1\r\n elif int(digit) == 8:\r\n v[7] += 1\r\n v[2] += 3\r\n elif int(digit) == 9:\r\n v[7] += 1\r\n v[3] += 2\r\n v[2] += 1\r\n\r\nfor i in range (7, 0, -1):\r\n while v[i] != 0:\r\n print(i, end=\"\")\r\n v[i] -= 1\r\n", "ref = {2:'2', 3:'3', 4:'322', 5:'5', 6:'53', 7:'7', 8:'7222', 9:'7332'}\r\nn = int(input())\r\na = input()\r\nx = ''\r\nfor i in range(n):\r\n if a[i] == '0' or a[i] == '1':\r\n continue\r\n else:\r\n x += ref[int(a[i])]\r\nmax_x = sorted(x, reverse=True)\r\noutput = ''\r\nfor j in range(len(max_x)):\r\n output += max_x[j]\r\nprint(output) ", "\nimport sys, math\nfrom collections import Counter, deque\nfrom itertools import permutations\n\n#########################\n# Delete when submit\n# sys.stdin = open(\"input.txt\", \"r\")\n# sys.stdout = open(\"output.txt\", \"w\")\n#########################\n\n\nn = int(input())\ns = str(input())\n\nd = { \n 0: [], \n 1: [], \n 2: [2], \n 3: [3],\n 4: [2, 2, 3],\n 5: [5],\n 6: [5, 3],\n 7: [7],\n 8: [2, 2, 2, 7],\n 9: [3, 3, 2, 7]\n }\n\ndigits = []\n\nfor x in s:\n for i in d[int(x)]:\n digits.append(i)\n\ndigits.sort(reverse=True)\n\nfor _ in digits:\n print(_, end='')", "n = int(input())\r\n\r\nfacs = ['', '', '2', '3', '322', '5', '53', '7', '7222', '7332']\r\n\r\na = str(input())\r\na = [int(t) for t in a]\r\na = [facs[i] for i in a]\r\na = ''.join(a)\r\na = list(a)\r\na.sort(reverse=True)\r\n\r\nprint(''.join(a))\r\n", "n = int(input())\r\nmynum = input()\r\ndic = {9: 362880, 8: 40320, 7: 5040, 6: 720, 5: 120, 4: 24, 3: 6, 2: 2,1:1,0:1}\r\n\r\nans = 1\r\nudic = {7:0,5:0,3:0,2:0,\"ans\":1}\r\na = [7,5,3,2]\r\nfor i in mynum :\r\n ans*=dic[int(i)]\r\n udic[\"ans\"] *= dic[int(i)]\r\n\r\n\r\nfor num in a :\r\n \r\n while ans%dic[num]== 0 :\r\n udic[num] += 1\r\n #print(ans)\r\n ans = ans//dic[num]\r\nmyans = \"\"\r\n\r\nfor l in a :\r\n myans += str(l)*udic[l]\r\nprint(myans)", "n = int(input())\r\nnumber = str(input())\r\ndp = [\"\",\"\",\"2\",\"3\",\"223\",\"5\",\"53\",\"7\",\"7222\",\"7332\"]\r\nrev = \"\"\r\nfor i in range(n):\r\n\trev += dp[int(number[i])]\r\nprint(\"\".join(sorted(rev,reverse=True)))", "#junior sheet training\r\n'''n=int(input())\r\narr=[int(i) for i in input().split()]\r\n\r\npre=[1 for i in range(n)]\r\n\r\nfor i in range(1,n):\r\n if arr[i]>=arr[i-1]:\r\n pre[i]=pre[i-1]+1\r\n\r\nsuf=[1 for i in range(n)]\r\nfor k in range(n-2,-1,-1):\r\n if arr[k]>=arr[k+1]:\r\n suf[k]=suf[k+1]+1\r\n\r\nres=0\r\nfor i in range(n):\r\n res=max(res,pre[i]+suf[i]-1)\r\nprint(res)'''\r\n\r\n\r\n'''n,a=[int(i) for i in input().split()]\r\narr=[int(i) for i in input().split()]\r\na-=1\r\n\r\ndist=0\r\nres=0\r\nwhile True:\r\n left=a-dist\r\n right=a+dist\r\n if left>=0 and right<n:\r\n res+=(2 if arr[right]&arr[left] else 0)\r\n res-=1 if arr[right]&arr[left] and right==left else 0\r\n elif left>=0:\r\n res+=arr[left]\r\n elif right<n:\r\n res+=arr[right]\r\n else:\r\n break\r\n dist+=1\r\n\r\nprint(res)'''\r\n\r\n'''n,m=[int(i) for i in input().split()]\r\ncand=[]\r\nfor i in range(m):\r\n cand.append([int(i) for i in input().split()])\r\n\r\ncand.sort(key=lambda x:x[1],reverse=True)\r\nres=0\r\nfor i in range(m):\r\n temp=min(n,cand[i][0])\r\n res+=cand[i][1]*temp\r\n n-=temp\r\n if temp<=0:\r\n break\r\nprint(res)'''\r\n\r\n'''n=int(input())\r\narr=[int(i) for i in input().split()]\r\n\r\npre=[arr[0] for i in range(n)]\r\n\r\nfor i in range(1,n):\r\n pre[i]=arr[i-1]-arr[i]\r\n\r\nres=float(\"inf\")\r\ntot=0\r\nfor k in range(1,n):\r\n tot+=pre[k]\r\n res=min(res,tot)\r\nres=abs(min(res,0))\r\nprint(arr[0]+res)'''\r\n\r\n\r\nn=int(input())\r\na=input()\r\n\r\ndig=[0 for i in range(10)]\r\nuse={2:0,3:0,5:0,7:0}\r\nfor i in a:\r\n i=int(i)\r\n if i in [2,3,5,7]:\r\n use[i]+=1\r\n elif i==4:\r\n use[3]+=1\r\n use[2]+=2\r\n elif i==6:\r\n use[5]+=1\r\n use[3]+=1\r\n elif i==8:\r\n use[7]+=1\r\n use[2]+=3\r\n elif i==9:\r\n use[7]+=1\r\n use[3]+=2\r\n use[2]+=1\r\n\r\nans='7'*use[7]+\"5\"*use[5]+\"3\"*use[3]+\"2\"*use[2]\r\n\r\nprint(ans)\r\n\r\n\r\n", "'''\r\nWe will describe a few properties.\r\n\r\nNotice that the given number a, will be a composition of digits. For now,\r\nassume a is a single digit.\r\n\r\nGiven 2 <= k <= 9, the goal is to decompose k! into x_{1}! * ... * x_{i}!\r\nand maximize i because adding an additional digit would increase the value\r\nof x by an order of 10. Clearly, x_{j} <= k\r\n\r\nLet's assume k is a prime, then the only representation is k! because\r\nwe must have x_{i} <= k, but if x_{i} < k then it is not possible for\r\nk | x_{i}!.\r\n\r\nThen, it follows that we must decompose into prime factorials for any k\r\nin order to maximize i.\r\n\r\n\r\nHere would be the optimal decomposition of each digit:\r\n2 -> 2\r\n3 -> 3\r\n4 -> 3, 2, 2\r\n5 -> 5\r\n6 -> 5, 3\r\n7 -> 7\r\n8 -> 7, 2, 2, 2 \r\n9 -> 7, 3, 3, 2\r\n\r\nNow for a combination of digits we just combine these digits (possibly\r\nmultiple times), concatenate them, and reverse-sort them.\r\n'''\r\n\r\nNUMBER_DECOMPOSITION_LOOKUP = { \"0\": [], \"1\": [], \"2\": [2], \"3\": [3],\r\n \"4\": [3, 2, 2], \"5\": [5], \"6\": [5, 3],\r\n \"7\": [7], \"8\": [7, 2, 2, 2],\r\n \"9\": [7, 3, 3, 2]}\r\n\r\n\r\ndef findMaximalNumber(digits: str) -> str:\r\n \r\n decomposedDigits = []\r\n for digit in digits:\r\n decomposedDigits += NUMBER_DECOMPOSITION_LOOKUP[digit]\r\n decomposedDigits.sort(reverse=True)\r\n return ''.join([str(i) for i in decomposedDigits])\r\n\r\nlength = input()\r\ndigits = input()\r\nprint(findMaximalNumber(digits))", "n=int(input())\r\n# from math import comb\r\nfrom collections import Counter\r\n# import math\r\n# import sys\r\n# for i in range(int(input())):\r\n# n,m,k=map(int,input().split())\r\n# matrix=[list(map(int,input().split())) for i in range(m)]\r\n# arr=list(map(int,input().split()))\r\narr=list(input()) \r\nfour = \"322\"\r\nnine=\"7332\"\r\nsix=\"53\"\r\neight=\"7222\"\r\nans=\"\"\r\nfor i in arr:\r\n if i==\"4\":\r\n ans+=four\r\n elif i==\"6\":\r\n ans+=six\r\n elif i==\"8\":\r\n ans+=eight\r\n elif i==\"9\":\r\n ans+=nine\r\n elif i==\"0\" or i==\"1\":\r\n continue\r\n else:\r\n ans+=i\r\nres=sorted([int(i) for i in ans],reverse=True)\r\nval=\"\"\r\nfor i in res:\r\n val+=str(i)\r\nprint(val)", "MOD = 10**9 + 7\r\n\r\ndef main():\r\n n = int(input())\r\n ch = [\"\", \"\", \"2\", \"3\", \"223\", \"5\", \"53\", \"7\", \"7222\", \"7332\"]\r\n s = input()\r\n \r\n an = \"\"\r\n for digit in s:\r\n an += ch[int(digit)]\r\n \r\n an = ''.join(sorted(an, reverse=True))\r\n print(an)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "input()\r\nnm = input()\r\nfor i, ch in enumerate(nm[:]):\r\n if ch != '0':\r\n nm = nm[i:]\r\n break\r\n\r\nans = ''\r\nfor ch in nm:\r\n if ch == '4':\r\n ans += '223'\r\n elif ch == '6':\r\n ans += '35'\r\n elif ch == '8':\r\n ans += '2227'\r\n elif ch == '9':\r\n ans += '3327'\r\n elif ch not in '01':\r\n ans += ch\r\n\r\nprint(''.join(sorted(ans, reverse=True)))", "# __ __ __ _ __ ______ \r\n# / / / /___ ___________/ /_ (_) /_ / ____/___ __________ _\r\n# / /_/ / __ `/ ___/ ___/ __ \\/ / __/ / / __/ __ `/ ___/ __ `/\r\n# / __ / /_/ / / (__ ) / / / / /_ / /_/ / /_/ / / / /_/ / \r\n# /_/ /_/\\__,_/_/ /____/_/ /_/_/\\__/____\\____/\\__,_/_/ \\__, / \r\n# /_____/ /____/ \r\n\r\nfrom collections import Counter\r\nfrom sys import *\r\nfrom collections import defaultdict as dd\r\nfrom math import *\r\n\r\n# sys.stdin = open('input.txt', 'r') \r\n# sys.stdout = open('output.txt', 'w')\r\n\r\n#input functions\r\ndef inp():\r\n return int(stdin.readline().strip())\r\ndef vinp():\r\n return map(int,stdin.readline().strip().split())\r\ndef linp():\r\n return list(map(int,stdin.readline().strip().split()))\r\ndef sinp(n = 1):\r\n if n==1:\r\n return stdin.readline().strip()\r\n elif n==2:\r\n return list(stdin.readline().strip())\r\n else:\r\n return list(stdin.readline().split())\r\n\r\n#output function\r\ndef pr(*x, end = \"\\n\"):\r\n print(*x,end = end)\r\n\r\n#others\r\ndef mod(f, val = 1000000007):\r\n return f % val\r\ndef csort(c):\r\n sorted(c.items(), key=lambda pair: pair[1], reverse=True)\r\ndef indc(l,n):\r\n c={}\r\n for i in range(n):\r\n c[l[i]]=c.get(l[i],[])+[i+1]\r\n return c\r\n\r\nif __name__ ==\"__main__\":\r\n n = inp()\r\n S = sinp()\r\n l = []\r\n c = {\"1\":[],\"2\":[2],\"3\":[3],\"4\":[2,2,3],\"5\":[5],\"6\":[5,3],\"7\":[7],\"8\":[7,2,2,2],\"9\":[7,3,3,2],\"0\":[]}\r\n for i in S:\r\n l+=c[i]\r\n l.sort(reverse=True)\r\n for i in l:\r\n pr(i,end=\"\")\r\n pr()\r\n", "a = int(input())\r\nl = list(input())\r\ng = []\r\nans = []\r\ns = []\r\nc2 = 0\r\nc3 = 0\r\nc7 = 0\r\nc5 = 0\r\nfor i in l:\r\n if int(i) != 0 and int(i) != 1:\r\n s.append(int(i))\r\nfor i in s:\r\n for i in range(2, i + 1):\r\n if i == 4:\r\n g.append(2)\r\n g.append(2)\r\n c2 += 2\r\n elif i == 6:\r\n g.append(2)\r\n g.append(3)\r\n c2 += 1\r\n c3 += 1\r\n elif i == 8:\r\n g.append(2)\r\n g.append(2)\r\n g.append(2)\r\n c2 += 3\r\n elif i == 9:\r\n g.append(3)\r\n g.append(3)\r\n c3 += 2\r\n else:\r\n if i == 2:\r\n c2 += 1\r\n elif i == 3:\r\n c3 += 1\r\n elif i == 7:\r\n c7 += 1\r\n elif i == 5:\r\n c5 += 1\r\n g.append(i)\r\ndc5 = c7\r\ndc3 = c7 * 2 + c5 - dc5\r\ndc2 = 4 * c7 + 3 * (c5 - dc5) + c3 - dc3\r\nif dc5 <= c5 and dc3 <= c3 and dc2 <= c2:\r\n for i in range(c7):\r\n ans.append(7)\r\n for i in range(c5 - dc5):\r\n ans.append(5)\r\n for i in range(c3 - dc3):\r\n ans.append(3)\r\n for i in range(c2 - dc2):\r\n ans.append(2)\r\n ans.sort()\r\n ans.reverse()\r\n print(''.join([str(i) for i in ans]))\r\nelse:\r\n s.sort()\r\n s.reverse()\r\n print(''.join([str(i) for i in s]))", "#problem: https://codeforces.com/problemset/problem/515/C\r\n\r\nn = int(input())\r\ns = input()\r\nL = []\r\n\r\nfor i in range(n):\r\n x = ord(s[i]) - 48\r\n if x == 2 or x == 4 or x == 8 or x == 9:\r\n L.append(2)\r\n if x == 3 or x == 4 or x == 6 or x == 9:\r\n L.append(3)\r\n if x == 5 or x == 6:\r\n L.append(5)\r\n if x == 7 or x == 8 or x == 9:\r\n L.append(7)\r\n if x == 4 or x == 8:\r\n L.append(2)\r\n if x == 8:\r\n L.append(2)\r\n if x == 9:\r\n L.append(3)\r\nL.sort(reverse=True)\r\nfor j in range(len(L)):\r\n print(L[j], end='')", "l=[\"\",\"\",\"2\",\"3\",\"322\",\"5\",\"53\",\"7\",\"7222\",\"7332\"] \r\nn=int(input()); h=\"\"\r\ns=input()\r\nfor i in range(n):\r\n h+=l[int(s[i])]\r\nh=list(h)\r\nh.sort(reverse=True)\r\nprint(*h,sep=\"\")", "import sys\r\ninput = sys.stdin.readline\r\nfrom math import prod\r\nfrom collections import Counter\r\n\r\n #X,Y,Z = list(map(int,input().strip().split()))\r\ndef mergeDictionary(dict_1, dict_2):\r\n dict_3 = {**dict_1, **dict_2}\r\n for key, value in dict_3.items():\r\n if key in dict_1 and key in dict_2:\r\n dict_3[key] = value + dict_1[key]\r\n return dict_3\r\n \r\nmod = 998244353\r\nstop_reading_my_code = int(input()) \r\nfor _ in range(stop_reading_my_code):\r\n #x,y = list(map(int,input().strip().split()))\r\n #n = int(input().strip())\r\n arr = input()\r\n ans = []\r\n for i in arr:\r\n if i == \"2\" :\r\n ans.append(2)\r\n elif i == \"3\":\r\n ans.append(3)\r\n elif i == \"4\":\r\n ans.extend([2,2,3])\r\n elif i == \"5\":\r\n ans.append(5)\r\n elif i == \"6\":\r\n ans.extend([5,3])\r\n elif i == \"7\":\r\n ans.append(7)\r\n elif i == \"8\":\r\n ans.extend([7,2,2,2])\r\n elif i == '9':\r\n ans.extend([7,3,3,2])\r\n \r\n ans.sort()\r\n ans.reverse()\r\n pr = [str(k) for k in ans]\r\n print(\"\".join(pr))", "n, result = int(input()), ''\r\na = input()\r\nfor digit in a:\r\n if digit != '0' and digit != '1':\r\n if digit == '4':\r\n result += '322'\r\n elif digit == '6':\r\n result += '53'\r\n elif digit == '8':\r\n result += '7222'\r\n elif digit == '9':\r\n result += '7332'\r\n else:\r\n result += digit\r\n\r\nprint(\"\".join(sorted(str(result), reverse=True)))\r\n", "def solve():\r\n n = int(input())\r\n a = input()\r\n ans = ''\r\n f = {2:'2',3:'3',4:'322',5:'5',6:'53',7:'7',8:'7222',9:'7332'}\r\n for i in a:\r\n x = int(i)\r\n if x < 2:\r\n continue\r\n ans += f[x]\r\n return ''.join(sorted(ans)[::-1])\r\n#for i in range(int(input())):\r\nprint(solve())", "n= int(input())\r\na = input()\r\nnumber = []\r\nfor i in range(n) :\r\n if a[i] == '0':\r\n pass\r\n elif a[i] == '1':\r\n pass\r\n elif a[i] =='2':\r\n number.append(2)\r\n elif a[i] == '3': \r\n number.append(3)\r\n elif a[i] == '4':\r\n number.append(2)\r\n number.append(2)\r\n number.append(3)\r\n elif a[i] == '5':\r\n number.append(5)\r\n elif a[i] == '6':\r\n number.append(3)\r\n number.append(5)\r\n elif a[i] == '7':\r\n number.append(7)\r\n elif a[i] == '8': \r\n number.append(7)\r\n number.append(2)\r\n number.append(2)\r\n number.append(2)\r\n elif a[i] == '9':\r\n number.append(7)\r\n number.append(3)\r\n number.append(3)\r\n number.append(2)\r\n\r\nnumber.sort(reverse =True)\r\ns = ''\r\nfor num in number:\r\n s+= str(num)\r\nprint(s)\r\n ", "'''\n1234\n2 2 3 2 3 2 2\n33222\n\n'''\nn=int(input())\nx=int(input())\nl={2:0,3:0,5:0,7:0}\nwhile x :\n g=x%10\n if g in l.keys():\n l[g]+=1\n elif g == 4:\n l[2]+=2\n l[3]+=1\n elif g == 6:\n l[3]+=1\n l[5]+=1\n elif g == 8:\n l[7]+=1\n l[2]+=3\n elif g == 9:\n l[2]+=1\n l[3]+=2\n l[7]+=1\n x=x//10\ns=''\ns+='7'*l[7]\ns+='5'*l[5]\ns+='3'*l[3]\ns+='2'*l[2]\nprint(s)\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\nd={}\r\nd[\"2\"]=\"2\";d[\"3\"]=\"3\";d[\"4\"]=\"322\";d[\"5\"]=\"5\";d[\"6\"]=\"53\";d[\"7\"]=\"7\";d[\"8\"]=\"7222\";d[\"9\"]=\"7332\"\r\nans=\"\"\r\nfor i in s:\r\n if int(i)>1:ans+=d[i]\r\nans=[i for i in ans]\r\nans.sort(reverse=True)\r\nans=\"\".join(ans)\r\nprint(ans)", "def f(n):\r\n\tif n==0:\r\n\t\treturn 1\r\n\tif n==1:\r\n\t\treturn 1;\r\n\treturn n*f(n-1)\r\nn=int(input())\r\nn=int(input())\r\nm=1\r\nwhile n>0:\r\n\tm*=f(n%10)\r\n\tn//=10\r\ns=\"\"\r\nwhile m%7==0:\r\n\ts+=\"7\"\r\n\tm//=f(7)\r\nwhile m%5==0:\r\n\ts+=\"5\"\r\n\tm//=f(5)\r\nwhile m%3==0:\r\n\ts+=\"3\"\r\n\tm//=f(3)\r\nwhile m%2==0:\r\n\ts+=\"2\"\r\n\tm//=f(2)\r\nprint(s)", "# import sys\r\n\r\n# sys.stdin = open('input.txt', 'r')\r\n# sys.stdout = open('output.txt', 'w')\r\n\r\nn = int(input())\r\ndig = list(input())\r\n\r\nexp = {0:[], 1:[], 2:[2], 3:[3], 4:[3, 2, 2], 5:[5], 6:[5, 3],\r\n 7:[7], 8:[7, 2, 2, 2], 9:[7, 2, 3, 3]}\r\nans = []\r\nfor digit in dig:\r\n ans.extend(exp[int(digit)])\r\n\r\nans.sort(reverse=True)\r\nprint(*ans, sep='')\r\n\r\n", "from collections import Counter\r\nfrom sys import stdin\r\n\r\n\r\nm = {\r\n \"1\": \"1\",\r\n \"2\": \"2\",\r\n \"3\": \"3\",\r\n \"4\": \"322\",\r\n \"5\": \"5\",\r\n \"6\": \"53\",\r\n \"7\": \"7\",\r\n \"8\": \"7222\",\r\n \"9\": \"7332\",\r\n}\r\n\r\n\r\ndef solve():\r\n _ = int(stdin.readline())\r\n count = Counter(input())\r\n\r\n res = []\r\n for k in range(2, 10):\r\n k = str(k)\r\n res += m[k] * count[k]\r\n\r\n res.sort(reverse=True)\r\n print(\"\".join(res))\r\n\r\n\r\nsolve()\r\n", "perms = {0 : [] , 1 : [] , 2 : [2] , 3 : [3] , 4 : [2 , 2 , 3]\r\n ,5 : [5] , 6 : [3 , 5] , 7 : [7] , 8 : [2 , 2 , 2 , 7] ,\r\n 9 : [3 , 3 , 2 , 7]\r\n}\r\n\r\nn = int(input())\r\ns = [int(x) for x in input()]\r\nl = []\r\n\r\nfor e in s:\r\n l += perms[e]\r\n \r\nl.sort(reverse=True)\r\n[print(i , end = \"\") for i in l]\r\nprint()", "n = int(input()); a = input().strip()\r\nd = [0,0, [2], [3], [3,2,2], [5], [5,3], [7], [7,2,2,2], [7,3,3,2]]\r\nans = []\r\nfor i in a:\r\n\tif not i in \"01\":\r\n\t\tans.extend(d[int(i)])\r\nans.sort(reverse=True)\r\nprint((\"\").join(map(str, ans)))", "from bisect import *\r\nm=int(input())\r\nn=int(input())\r\nprime=[2,3,5,7]\r\na=[0 for i in range(10)]\r\ntmp=n\r\nwhile tmp>0:\r\n r=tmp%10\r\n a[r]+=1\r\n tmp//=10\r\na[1]=0\r\ndigits=[]\r\nver=True\r\nfactors=[[0],[1],[2],[3],[2,2],[5],[3,2],[7],[2,2,2],[3,3]]\r\nx={2:0,3:0}\r\nfor i in range(9,1,-1):\r\n if a[i]==0:\r\n continue\r\n if i==2 or i==3:\r\n for j in range(a[i]):\r\n if i==2:\r\n x[i]+=1\r\n else:\r\n x[i]+=1\r\n x[i-1]+=1\r\n elif i in prime:\r\n cnt=a[i]\r\n for j in range(cnt):\r\n digits.append(i)\r\n else:\r\n pos=bisect_left(prime,i)-1\r\n for j in range(a[i]):\r\n digits.append(prime[pos])\r\n for l in range(a[i]):\r\n for j in range(i,prime[pos],-1):\r\n for k in factors[j]:\r\n x[k]+=1\r\nfor i in range(x[3]):\r\n digits.append(3)\r\nx[2]-=x[3]\r\nfor i in range(x[2]):\r\n digits.append(2)\r\nif ver:\r\n digits.sort(reverse=True)\r\n for i in digits:\r\n print(i,end=\"\")\r\nelse:\r\n print(n)", "n=int(input())\na=input()\nl=[]\nd={'2':[2],'3':[3],'4':[3,2,2],'5':[5],'6':[5,3],'7':[7],'8':[7,2,2,2],'9':[7,3,3,2]}\nfor i in a:\n if i!='0' and i!='1':\n l.extend(d[i])\nl.sort(reverse=True)\nfor i in l:\n print(i,end='')\nprint()", "n = int(input())\r\ns = input()\r\nans = []\r\nf = ['', '', '2', '3', '322', '5', '53', '7', '7222', '7332']\r\nfor x in s:\r\n ans.extend(list(f[int(x)]))\r\nprint(''.join(sorted(ans, reverse=True)))", "n=int(input())\r\nr=input()\r\nsp=[]\r\nfor i in r:\r\n i=int(i)\r\n if i in [0, 1]:\r\n continue\r\n if i<4:\r\n sp.append(i)\r\n elif i==4:\r\n sp.append(2)\r\n sp.append(2)\r\n sp.append(3)\r\n elif i==5:\r\n sp.append(5)\r\n elif i==6:\r\n sp.append(5)\r\n sp.append(3)\r\n elif i==7:\r\n sp.append(7)\r\n elif i==8:\r\n sp.append(2)\r\n sp.append(2)\r\n sp.append(2)\r\n sp.append(7)\r\n else:\r\n sp.append(2)\r\n sp.append(7)\r\n sp.append(3)\r\n sp.append(3)\r\nsp.sort(reverse = True)\r\nfor i in sp:\r\n print(i, end='')\r\n", "n = int(input())\r\na = list(map(int,list(input())))\r\nbroken = []\r\n\r\nbreaktable = {\r\n 2: [2],\r\n 3: [3], \r\n 4: [2,2,3],\r\n 5: [5],\r\n 6: [3,5],\r\n 7: [7],\r\n 8: [2,2,2,7],\r\n 9: [3,3,2,7],\r\n}\r\nfor c in a:\r\n if c != 0 and c != 1:\r\n broken.extend(breaktable[c]) \r\n\r\n\r\n# print(broken)\r\nbroken.sort(reverse=True)\r\nprint(''.join(map(str, broken)))", "n = int(input())\r\nx = input()\r\n\r\nrez = []\r\n\r\nfor i in x:\r\n if i == '0':\r\n continue\r\n elif i == '1':\r\n continue\r\n elif i == '2':\r\n rez.append('2')\r\n elif i == '3':\r\n rez.append('3')\r\n elif i == '4':\r\n rez.extend(['2', '2', '3'])\r\n elif i == '5':\r\n rez.append('5')\r\n elif i == '6':\r\n rez.extend(['5', '3'])\r\n elif i == '7':\r\n rez.append('7')\r\n elif i == '8':\r\n rez.extend(['7', '2', '2', '2'])\r\n elif i == '9':\r\n rez.extend(['7', '3', '3', '2'])\r\n\r\nprint(\"\".join(sorted(rez, reverse=True)))\r\n", "_, n = input(), input()\r\na = []\r\n\r\nfor c in n:\r\n c = int(c)\r\n if c == 2: a += [2]\r\n if c == 3: a += [3]\r\n if c == 4: a += [3, 2, 2]\r\n if c == 5: a += [5]\r\n if c == 6: a += [5, 3]\r\n if c == 7: a += [7]\r\n if c == 8: a += [7, 2, 2, 2]\r\n if c == 9: a += [7, 3, 3, 2]\r\n\r\nprint(*reversed(sorted(a)), sep='')\r\n", "n=int(input())\r\n\r\na=input()\r\nb=10*[0]\r\n\r\nfor i in a:\r\n for j in range(int(i)):\r\n b[j]+=1\r\n\r\nb[1]+=2*b[3]+b[5]+3*b[7]\r\nb[2]+=b[5]+2*b[8]\r\n\r\nb[3]=b[5]=b[7]=b[8]=0\r\n\r\n#print(b)\r\nans=[]\r\nfor i in range(9,0,-1):\r\n if i==6 and b[i]!=0:\r\n for j in range(b[i]):\r\n ans.append(i+1)\r\n b[1]-=4*b[i]\r\n b[2]-=2*b[i]\r\n b[4]-=b[i]\r\n elif i==4 and b[i]!=0:\r\n for j in range(b[i]):\r\n ans.append(i+1)\r\n b[1]-=3*b[i]\r\n b[2]-=b[i]\r\n elif i==2 and b[i]!=0:\r\n for j in range(b[i]):\r\n ans.append(i+1)\r\n b[1]-=b[i]\r\n else:\r\n for j in range(b[i]):\r\n ans.append(i+1)\r\n\r\nprint(*ans,sep='')\r\n \r\n", "n = int(input())\r\n\r\ns = input()\r\n\r\na_n = [0]*10\r\n\r\nfor c in s:\r\n if c == '2':\r\n a_n[2] += 1\r\n elif c == '3':\r\n a_n[3] += 1\r\n elif c == '4':\r\n a_n[2] += 2\r\n a_n[3] += 1\r\n elif c == '5':\r\n a_n[5] += 1\r\n elif c == '6':\r\n a_n[5] += 1\r\n a_n[3] += 1\r\n elif c == '7':\r\n a_n[7] += 1\r\n elif c == '8':\r\n a_n[2] += 3\r\n a_n[7] += 1\r\n elif c == '9':\r\n a_n[3] += 2\r\n a_n[2] += 1\r\n a_n[7] += 1\r\n\r\nfor i in range(0, 9):\r\n while a_n[9 - i] > 0:\r\n print(9 - i, end = \"\")\r\n a_n[9 - i] -= 1", "from math import factorial\r\n \r\nn=int(input())\r\na=input()\r\nf=1\r\nfor i in a:\r\n f*=factorial(int(i))\r\n \r\n# print(f)\r\n \r\nfor d in (7,5,3,2):\r\n while(f>1):\r\n if(f%d==0):\r\n print(d,end='')\r\n # print(factorial(d))\r\n f=f//factorial(d)\r\n # print(f)\r\n else:\r\n break", "#*****************************************************************************\n#* __ ________ __________ __________ __ __ *\n#* | | | | ||_________| ||________| || || *\n#* | | | | || || || || *\n#* | | |________| || || || || *\n#* | | |________| || ______ || ______ || || *\n#* ___| | | | ||____| | | | ||_____| | | | ||______|| *\n#*|______| | | ||______| |_| ||_______| |_| ||______|| *\n#* *\n#******************************************************************************\n\n\nfrom collections import defaultdict as D\nfrom math import *\nfrom sys import stdin, stdout\n\nMOD = 10**9+7\nMAX = 10**18+1\nMIN = -MAX\n\ndef reshape(count, val=0): return [ val for i in range(count) ]\n\ndef vec_read(): return list(map(int,stdin.readline().split()))\n\ndef read(): return map(int,stdin.readline().split())\n\ndef get_string(): return stdin.readline().strip()\n\n\n##################################################\n\na=['','','2','3','223','5','35','7','2227','3327']\ndef solve():\n\n # Logic Starts Here\n n = int(input())\n s=[]\n for i in str(input()):\n s+=a[int(i)]\n # s = ''.join(s)\n print(''.join(sorted(s,reverse=True)))\n\n\ndef test_cases():\n t = int(input())\n while t:\n solve()\n t-=1\n\n## Driver Code\nif __name__ == '__main__':\n # test_cases()\n solve()", "LIST = ['', '', '2', '3', '322', '5', '53', '7', '7222', '7332']\r\nres = ''\r\nn = int(input())\r\nstr1 = input()\r\nfor x in range(n):\r\n res+=str(LIST[int(str1[x])])\r\nprint(''.join(sorted(res, reverse=True))) ", "#input template\r\nfrom sys import stdin, stdout\r\ncin = stdin.readline\r\ncout = stdout.write\r\nmp = lambda: list(map(int, cin().split()))\r\n\r\ndef chars(): #function for taking string input as character array since string in python is immutable\r\n s = cin()\r\n return(list(s[:len(s) - 1]))\r\n\r\n#print list\t\r\ndef pl(a):\t\r\n\tfor val in a:\r\n\t\tcout(val)\r\n\t\t\r\n#main\r\n\r\nn, = mp()\r\na = chars()\r\n\r\nl = ['', '', '2', '3', '322', '5', '35', '7', '7222', '7332']\r\ns = ''\r\nfor ch in a:\r\n\tif ch <= '1':\r\n\t\tcontinue\r\n\telse:# ch == '4':\r\n\t\ts += l[int(ch)]\r\n\t#elif\r\nans = sorted(s, reverse=True)\r\npl(ans)\t\r\n\t", "n=int(input())\r\n'''2=2 3=3 4=322 5=5 6=53 7=7 8=7222 9=7332'''\r\na=list(map(int,list(input())))\r\nnewint=[]\r\nfor i in range(len(a)):\r\n if(a[i]==2):\r\n newint.append(\"2\")\r\n elif(a[i]==3):\r\n newint.append(\"3\")\r\n elif(a[i]==4):\r\n newint.append(\"322\")\r\n elif(a[i]==5):\r\n newint.append(\"5\")\r\n elif(a[i]==6):\r\n newint.append(\"53\")\r\n elif(a[i]==7):\r\n newint.append(\"7\")\r\n elif(a[i]==8):\r\n newint.append(\"7222\")\r\n elif(a[i]==9):\r\n newint.append(\"7332\")\r\npog=''.join(map(str, newint))\r\npog=int(pog)\r\ndescending = \"\".join(sorted(str(pog), reverse=True))\r\nsuh=int(descending)\r\nprint(suh)\r\n", "a=[[],[],[2],[3],[2,2,3],[5],[3,5],[7],[7,2,2,2],[3,3,2,7]]\r\n\r\nans=[]\r\ninput()\r\nfor i in input():\r\n if i!='1' and i!='0':\r\n ans+=a[int(i)]\r\n \r\nans.sort(reverse=True)\r\n\r\nfor i in ans:\r\n print(i,end='')\r\n", "from math import factorial\r\n\r\n_ = input()\r\ndigits = [int(c) for c in input()]\r\n\r\np = 1\r\n\r\nfor d in digits:\r\n p *= factorial(d)\r\n\r\n\r\nt = []\r\n\r\nwhile p % 7 == 0:\r\n t.append('7')\r\n p //= factorial(7)\r\n\r\nwhile p % 5 == 0:\r\n t.append('5')\r\n p //= factorial(5)\r\n\r\nwhile p % 3 == 0:\r\n t.append('3')\r\n p //= factorial(3)\r\n\r\nwhile p % 2 == 0:\r\n t.append('2')\r\n p //= factorial(2)\r\n\r\nprint(''.join(t))\r\n", "from sys import stdin, gettrace\n\nif not gettrace():\n def input():\n return next(stdin)[:-1]\n\n\n# def input():\n# return stdin.buffer.readline()\n\ndef main():\n input()\n aa = input()\n digits = []\n for a in aa:\n if a == '2':\n digits.append('2')\n elif a == '3':\n digits.append('3')\n elif a == '4':\n digits += ('2','2','3')\n elif a == '5':\n digits.append('5')\n elif a == '6':\n digits += ('3', '5')\n elif a == '7':\n digits.append('7')\n elif a == '8':\n digits += ('2','2','2', '7')\n elif a == '9':\n digits += ('3', '3', '2', '7')\n digits.sort(reverse=True)\n print(''.join(digits))\n\nif __name__ == \"__main__\":\n main()", "d = {\r\n '2': [2],\r\n '3': [3],\r\n '4': [3, 2, 2],\r\n '5': [5],\r\n '6': [5, 3],\r\n '7': [7],\r\n '8': [7, 2, 2, 2],\r\n '9': [7, 3, 3, 2]\r\n\r\n}\r\nn = int(input())\r\nx = input()\r\na = []\r\nfor i in x:\r\n if i not in d:\r\n continue\r\n a += d[i]\r\nprint(''.join(map(str, sorted(a, reverse=True))))\r\n", "n=int(input())\r\na=str(input())\r\nd=[];answer=\"\"\r\n\r\nfor i in range(n):\r\n k=int(a[i])\r\n if k==1:\r\n continue\r\n else:\r\n for l in range(2,k+1):\r\n k=l\r\n while k!=1:\r\n for j in range(2,10):\r\n if k%j==0:\r\n k//=j\r\n d.append(j)\r\n break \r\nd.sort(reverse=True)\r\n#print(d)\r\n\r\nwhile len(d)!=0:\r\n answer+=str(d[0])\r\n \r\n for i in range(d[0],1,-1):\r\n k=i\r\n while k!=1:\r\n for j in range(2,10):\r\n if k%j==0:\r\n del(d[d.index(j)])\r\n k//=j\r\nprint(answer)\r\n \r\n \r\n ", "from collections import defaultdict\n\n\nmappings = {\n 4: [2,2],\n 6: [2,3],\n 8: [2,2,2],\n 9: [3,3]\n}\n\ndef main():\n N = int(input())\n s = [int(i) for i in input()]\n\n cnt = defaultdict(int)\n for i in s:\n if i <= 1: continue\n for k in range(i,1,-1):\n cnt[k] += 1\n \n prev = 0\n res = []\n\n for i in range(9,0,-1):\n if i not in cnt: continue\n cnt[i] -= prev\n if (cnt[i] > 0):\n if i in mappings:\n for num in mappings[i]: cnt[num] += cnt[i]\n else:\n res.extend([i] * cnt[i])\n prev += cnt[i]\n print(*res, sep=\"\")\n\nmain()\n \n \n\n", "dgts = ['', '', '2', '3', '223', '5', '53', '7', '7222', '7332']\nn = int(input())\ns = input()\nans = []\nfor i in range(len(s)):\n ans += dgts[int(s[i])]\nans.sort(reverse=True)\nprint(''.join(ans))", "import sys\ninput = sys.stdin.readline\n\n############ ---- Input Functions ---- ############\ndef inp(): # int\n return(int(input()))\ndef inlt(): # list\n return(list(map(int,input().split())))\ndef insr(): # string as char list\n s = input()\n return(list(s[:len(s) - 1]))\ndef instr(): # string\n return input()\ndef invr(): # spaced ints\n return(map(int,input().split()))\n\n\n# 2!: 2. Replace 2\n# 3!: 2, 3. Replace 3.\n# 4!: 2^3, 3. Replace 2, 2, 3\n# 5!: 2^3, 3, 5. Replace 5.\n# 6!: 2^4, 3^2, 5. Replace 3, 5\n# 7!: 2^4, 3^2, 5, 7. Replace 7\n# 8!: 2^7, 3^2, 5, 7. Replace 2, 2, 2, 7\n# 9!: 2^7, 3^4, 5, 7. Replace 2, 3, 3, 7\nn = inp()\na = inp()\nnum_digs = [0] * 10 # num_digs[i] is the number of copies of i to include in final\nfor i in range(n):\n curr_dig = a % 10\n a //= 10\n if curr_dig == 2:\n num_digs[2] += 1\n elif curr_dig == 3:\n num_digs[3] += 1\n elif curr_dig == 4:\n num_digs[2] += 2\n num_digs[3] += 1\n elif curr_dig == 5:\n num_digs[5] += 1\n elif curr_dig == 6:\n num_digs[3] += 1\n num_digs[5] += 1\n elif curr_dig == 7:\n num_digs[7] += 1\n elif curr_dig == 8:\n num_digs[2] += 3\n num_digs[7] += 1\n elif curr_dig == 9:\n num_digs[2] += 1\n num_digs[3] += 2\n num_digs[7] += 1\nans = []\nfor i in range(9, 1, -1):\n ans += [str(i)] * num_digs[i]\nprint(''.join(ans))\n", "input()\r\nar = {'1' : '' , '0' : '' , '2' : \"2\" , '3' : \"3\" , '4': \"223\" , '5' : \"5\" , '6' : \"35\" , '7' : \"7\" , '8' : '2227' , '9' : '2337'}\r\ns = ''\r\nfor i in list(input()):s+=ar[i]\r\nprint(*sorted(s , reverse=True) , sep=\"\")", "import sys\r\nimport math\r\nimport bisect\r\nfrom math import sqrt, factorial\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\nf = {\"0\": \"\", \"1\": \"\", \"2\": \"2\", \"3\": \"3\", \"4\": \"223\", \"5\": \"5\", \"6\": \"35\", \"7\": \"7\", \"8\": \"2227\", \"9\": \"2337\"}\r\n\r\nn = iinput()\r\ns = list(input())\r\n\r\nres = \"\"\r\n\r\nfor dig in s:\r\n\tres += f[dig]\r\n\r\nans = \"\".join(sorted(res, reverse = True))\r\nprint(ans)", "import sys\ninput = sys.stdin.readline\n\nD = [[], [], [2], [3], [2,2,3], [5], [3,5], [7], [2,2,2,7], [2,3,3,7]]\nN = int(input())\nA = list(map(int, input().rstrip()))\n\nr = []\nfor e in A :\n\tr.extend(D[e])\n\t\nr.sort(reverse=True)\nprint(\"\".join(map(str, r)))\n", "def solve(n):\r\n ans = [[2], [3], [2, 2, 3], [5], [5, 3], [7], [7, 2, 2, 2], [7, 2, 3, 3]]\r\n return ans[n - 2]\r\nfact = {1 : 1, 2: 2, 3 : 6, 4 : 24, 5 : 120, 6: 720, 7: 5040, 8 : 40320, 9 : 362880}\r\nn = int(input())\r\na = [int(i) for i in input()]\r\ntemp = []\r\nfor digit in a:\r\n if digit > 1:\r\n temp += solve(digit)\r\ntemp.sort(reverse = True)\r\nfor el in temp:\r\n print(el, end = '')", "# your code goes here\r\nn=int(input())\r\ns=input()\r\nfreq=[0]*(10)\r\nfor i in s:\r\n\tfreq[int(i)]+=1\r\nres=\"\"\r\nfor i in range(2,10):\r\n\tif(i==2 or i==3 or i==5 or i==7):\r\n\t\ta=str(i)*(freq[i])\r\n\t\tres+=a\r\n\tif(i==4):\r\n\t\ta='322'*freq[i]\r\n\t\tres+=a\r\n\tif(i==6):\r\n\t\ta='53'*freq[i]\r\n\t\tres+=a\r\n\tif(i==8):\r\n\t\ta='7222'*freq[i]\r\n\t\tres+=a\r\n\tif(i==9):\r\n\t\ta='7332'*freq[i]\r\n\t\tres+=a\r\nres=sorted(res,reverse=True)\r\nres = ''.join(res) \r\nprint(res)\t\t\r\n\t\t", "n=input()\nl=input()\na=\"\"\nt=[a,a,\"2\",\"3\",\"223\",\"5\",\"53\",\"7\",\"7222\",\"7332\"]\nfor i in l:\n a+=t[int(i)]\nprint(\"\".join(sorted(a)[::-1]))\n\n \t\t \t \t \t\t \t\t \t\t\t\t \t \t", "from bisect import bisect_right, bisect_left\r\nfrom math import inf, gcd\r\nfrom collections import defaultdict, Counter\r\nfrom functools import cache, lru_cache\r\nrvar = lambda: map(int, input().split())\r\nrarr = lambda: list(map(int, input().split()))\r\nrstr = lambda: input().split()\r\nrint = lambda: int(input())\r\n\r\n'''Speed up'''\r\n# import sys\r\n# input = sys.stdin.readline\r\n\r\n\r\nn = rint()\r\nnum = input()\r\n\r\nmp = {\r\n '2':'2',\r\n '3':'3',\r\n '4':'322',\r\n '5':'5',\r\n '6':'53',\r\n '7':'7',\r\n '8':'7222',\r\n '9':'7332'\r\n }\r\n\r\nres = [mp[v] for v in num if v not in ('0', '1')]\r\nres = \"\".join(res)\r\nres = sorted(res)\r\nres = \"\".join(res[::-1])\r\nprint(res)", "import functools\r\nimport heapq as hp\r\nimport collections\r\nimport bisect\r\nimport math\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 s_unpack(func=int, rev=False):\r\n \"\"\"sorted list unpack\"\"\"\r\n return sorted(map(func, input().split()), reverse=rev)\r\n\r\n\r\ndef ml_unpack(n): # multiple line unpack\r\n \"\"\"list of n integers passed on n line, one on each\"\"\"\r\n return [int(input()) for i in range(n)]\r\n\r\n\r\ndef range_n():\r\n return range(int(input()))\r\n\r\n\r\ndef getint():\r\n return int(input())\r\n\r\n\r\ndef counter(a):\r\n d = {}\r\n for x in a:\r\n if x in d:\r\n d[x] += 1\r\n else:\r\n d[x] = 1\r\n return d\r\n\r\n\r\ndef main():\r\n n = getint()\r\n a = input()\r\n ans = []\r\n for e in a:\r\n if e in {'0', '1'}:\r\n continue\r\n if e == '4':\r\n ans.append(2)\r\n ans.append(2)\r\n ans.append(3)\r\n elif e == '6':\r\n ans.append(3)\r\n ans.append(5)\r\n elif e == '8':\r\n ans.append(2)\r\n ans.append(2)\r\n ans.append(2)\r\n ans.append(7)\r\n elif e == '9':\r\n ans.append(3)\r\n ans.append(3)\r\n ans.append(2)\r\n ans.append(7)\r\n else:\r\n ans.append(int(e))\r\n ans.sort(reverse=True)\r\n print(*ans, sep='')\r\n\r\n\r\nmain()\r\n", "n=int(input())\r\na=input()\r\n\r\ntwo=(2*a.count(\"4\"))+(3*a.count(\"8\"))+(a.count(\"9\"))\r\nthree=(a.count(\"4\"))+(a.count(\"6\"))+(2*a.count(\"9\"))\r\nfive=a.count(\"6\")\r\nseven=a.count(\"8\")+(a.count(\"9\"))\r\n\r\nl=[\"0\",\"1\",\"4\",\"6\",\"8\",\"9\"]\r\nfor i in l:\r\n a=a.replace(i,\"\")\r\n\r\nfor i in range(two):\r\n a=a+\"2\"\r\nfor i in range(three):\r\n a=a+\"3\"\r\nfor i in range(five):\r\n a=a+\"5\" \r\nfor i in range(seven):\r\n a=a+\"7\" \r\n\r\ntemp=[]\r\nfor i in a:\r\n temp.append(i)\r\ntemp.sort(reverse=True)\r\nfor i in temp:\r\n print(i,end=\"\")", "n = int(input())\na = input()\nr = []\nfor i in a:\n\tif i == '2':\n\t\tr.append(2)\n\telif i == '3':\n\t\tr.append(3)\n\telif i == '4':\n\t\tr += [2, 2, 3]\n\telif i == '5':\n\t\tr.append(5)\n\telif i == '6':\n\t\tr += [5, 3]\n\telif i == '7':\n\t\tr.append(7)\n\telif i == '8':\n\t\tr += [7, 2, 2, 2]\n\telif i == '9':\n\t\tr += [7, 3, 3, 2]\nr.sort(reverse=True)\nfor i in r:\n\tprint(i,end='')\nprint()\n", "n = int(input())\r\na = input()\r\ndict = {}\r\nsplits = {8 : [(2, 3), (7, 1)], 9 : [(3, 2), (2, 1), (7, 1)], \r\n 6 : [(3, 1), (5, 1)], 4 : [(2, 2), (3, 1)]}\r\nproduct = 1\r\nfor i in a :\r\n digit = int(i)\r\n if digit <= 1 :\r\n continue\r\n if digit in splits :\r\n for l in splits[digit] :\r\n num = l[0]\r\n times = l[1]\r\n if num not in dict :\r\n dict[num] = 0\r\n dict[num] += times\r\n else :\r\n if digit not in dict :\r\n dict[digit] = 0\r\n dict[digit] += 1\r\nprint(\"\".join(str(i) * dict[i] for i in sorted(dict.keys(), reverse = True)))", "n = int(input())\r\narr = list(input())\r\narr = [int(i) for i in arr]\r\narr.sort()\r\nans = []\r\nfor i in arr:\r\n if i == 0 or i == 1:\r\n continue\r\n elif i == 2 or i == 3 or i == 5 or i == 7:\r\n ans.append(i)\r\n elif i == 4:\r\n ans += [2]*2 + [3]\r\n elif i == 6:\r\n ans += [3] + [5]\r\n elif i == 8:\r\n ans += [7] + [2]*3\r\n elif i == 9:\r\n ans += [7] + [3]*2 + [2]\r\nans.sort(reverse = True)\r\nfor i in ans:\r\n print(i,end = '')", "n = int(input())\nA = input()\nA= list(A)\nA.sort()\n\na4 = A.count('4')\na8 = A.count('8')\na6 = A.count('6')\na9 = A.count('9')\nss = '' \nfor i in range(n-1,-1,-1):\n if A[i] not in ['1','4','8','0','6','9']:\n ss += A[i]\n\nss += '223'*a4 + '2227'*a8 + '35'*a6 + '3327'*a9\n\nss = list(ss)\nss.sort()\ns = ''.join(ss)\nprint(s[::-1])\n\n \n \n \n \n \n ", "def get_factorization(num):\r\n factorization = dict()\r\n divider = 2\r\n while num != 1:\r\n power = 0\r\n while num % divider == 0:\r\n num = num // divider\r\n power += 1\r\n factorization[divider] = power\r\n divider += 1\r\n return factorization\r\n\r\n\r\ndef get_factorization_factorial(num):\r\n factorization = dict()\r\n for index in range(2, num + 1):\r\n factorization_index = get_factorization(index)\r\n for prime, power in factorization_index.items():\r\n if prime in factorization:\r\n factorization[prime] += power\r\n else:\r\n factorization[prime] = power\r\n return factorization\r\n\r\n\r\ndef get_factorization_F(x):\r\n factorization = dict()\r\n digits = [int(digit) for digit in x if digit != '0' and digit != '1']\r\n for digit in digits:\r\n digit_factorization = get_factorization_factorial(digit)\r\n for prime, power in digit_factorization.items():\r\n if prime in factorization:\r\n factorization[prime] += power\r\n else:\r\n factorization[prime] = power\r\n return factorization\r\n\r\n\r\ndef get_largest_similar_num(x):\r\n x_factorization = get_factorization_F(x)\r\n primes = list(x_factorization.keys())\r\n primes.sort(reverse=True)\r\n result = []\r\n for prime in primes:\r\n power = x_factorization[prime]\r\n result += [prime] * power\r\n prime_factorial_factorization = get_factorization_factorial(prime)\r\n for second_prime, second_power in prime_factorial_factorization.items():\r\n x_factorization[second_prime] -= second_power * power\r\n return ''.join([str(digit) for digit in result])\r\n\r\n\r\ndef solve():\r\n input()\r\n x = input()\r\n result = get_largest_similar_num(x)\r\n print(result)\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()", "first = int(input())\nnum = list(input())\nfor i in range(0, len(num)):\n num[i] = int(num[i])\n\nfacfacts = []\n\nfor i in num:\n if(i == 0 or i == 1):\n continue\n if(i == 4):\n facfacts.append(2)\n facfacts.append(2)\n facfacts.append(3)\n elif(i == 6):\n facfacts.append(3)\n num.append(5)\n elif(i == 8):\n facfacts.append(2)\n facfacts.append(2)\n facfacts.append(2)\n facfacts.append(7)\n elif(i == 9):\n facfacts.append(3)\n facfacts.append(3)\n facfacts.append(2)\n facfacts.append(7)\n else:\n facfacts.append(i)\n\nfacfacts.sort(reverse = True)\nans = 0\nfor i in facfacts:\n ans *= 10\n ans += i\nprint(ans)\n\n\t\t \t\t\t \t\t \t\t \t \t\t\t\t\t\t", "from math import*;f=factorial;input();A=1;B=[]\r\nfor c in input():A*=f(int(c))\r\nfor p in 7,5,3,2:\r\n while A%f(p)<1:A//=f(p);B+=p,\r\nprint(*B,sep='')", "import sys\ninput = sys.stdin.readline\n\n'''\n\n'''\n\ndef get_p_factors(num):\n res = []\n for d, p in [(factorial(7), 7), (factorial(5), 5), (factorial(3), 3), (factorial(2), 2)]:\n while num % d == 0:\n #print(num, res)\n num //= d\n res.append(p)\n return int(\"\".join(map(str, res)))\n\nfrom math import factorial\ndef F(str_num):\n res = 1\n for d in str_num:\n res *= factorial(int(d))\n return res\n\n\ninput()\na = input().rstrip()\nprint(get_p_factors(F(a)))\n", "n = int(input())\r\ns = input()\r\n\r\nd = {0: {}, 1: {}, 2: {2: 1}, 3: {3: 1}, 4: {2: 2}, 5: {5: 1}, 6: {2: 1, 3: 1}, 7: {7: 1}, 8: {2: 3}, 9: {3: 2}}\r\n\r\nt = [0] * 8\r\nfor i in s:\r\n i = int(i)\r\n if(i > 1):\r\n for j in range(2, i + 1):\r\n for k, v in d[j].items():\r\n t[k] += v\r\n\r\ns = \"\"\r\nfor i in range(7, -1, -1):\r\n if(t[i] > 0):\r\n n = t[i]\r\n s += str(i) * n\r\n for j in range(i, -1, -1):\r\n for k, v in d[j].items():\r\n t[k] -= n * v\r\n\r\nprint(s)\r\n\r\n ", "n = int(input())\r\ns = [int(i) for i in input() if i not in '10']\r\nans = list(); from math import log2\r\nfor i in s : \r\n if int(log2(i)) == log2(i): ans.extend('2'*(int(log2(i))) + str(i-1))\r\n elif i == 9 : ans.extend('3327')\r\n elif i == 6 : ans.extend('35')\r\n else: ans.append(str(i))\r\nprint(''.join(sorted(ans,reverse=1)).strip('1'))", "\"\"\"\r\nDrazil is playing a math game with Varda.\r\n\r\nLet's define for positive integer x as a product of factorials of its digits. For example, .\r\n\r\nFirst, they choose a decimal number a consisting of n digits that contains at least one digit larger than 1. This number may possibly start with leading zeroes. Then they should find maximum positive number x satisfying following two conditions:\r\n\r\n1. x doesn't contain neither digit 0 nor digit 1.\r\n\r\n2. = .\r\n\r\nHelp friends find such number.\r\n\r\nInput\r\nThe first line contains an integer n (1 ≤ n ≤ 15) — the number of digits in a.\r\n\r\nThe second line contains n digits of a. There is at least one digit in a that is larger than 1. Number a may possibly contain leading zeroes.\r\n\r\nOutput\r\nOutput a maximum possible integer satisfying the conditions above. There should be no zeroes and ones in this number decimal representation.\r\n\"\"\"\r\n\r\nn = int(input())\r\na = input()\r\ndigits = {\r\n 2: 0,\r\n 3: 0,\r\n 5: 0,\r\n 7: 0\r\n}\r\n\r\n\r\nfor char in a:\r\n if char == '2':\r\n digits[2] += 1\r\n elif char == '3':\r\n digits[3] += 1\r\n elif char == '4':\r\n digits[2] += 2\r\n digits[3] += 1\r\n elif char == '5':\r\n digits[5] += 1\r\n elif char == '6':\r\n digits[5] += 1\r\n digits[3] += 1\r\n elif char == '7':\r\n digits[7] += 1\r\n elif char == '8':\r\n digits[7] += 1\r\n digits[2] += 3\r\n elif char == '9':\r\n digits[7] += 1\r\n digits[3] += 2\r\n digits[2] += 1\r\n\r\nprint(f\"{'7' * digits[7]}{'5' * digits[5]}{'3' * digits[3]}{'2' * digits[2]}\")\r\n\r\n\r\n", "n = input()\r\nnum = list(input())\r\ndict = {'0':'','1':'','2':'2','3':'3','4':'322','5':'5','6':'53','7':'7','8':'7222','9':'7332'}\r\nnewnum = [dict[i] for i in num]\r\nnewnum = reversed(sorted(list(''.join(newnum))))\r\nprint(''.join(newnum))", "w = int(input())\ns = input()\nF = [1] * 18\nfor i in range(1, 18):\n F[i] = i * F[i - 1]\na = 0\nb = 0\nc = 0\nd = 0\nfor i in range(w):\n z = int(s[i])\n if z > 8:\n b += 2\n if z > 7:\n a += 3\n if z > 6:\n d += 1\n if z > 5:\n a += 1\n b += 1\n if z > 4:\n c += 1\n if z > 3:\n a += 2\n if z > 2:\n b += 1\n if z > 1:\n a += 1\nans = ''\na -= d * 4\nb -= d * 2\nc -= d\nans += '7' * d\nb -= c\na -= c * 3\nans += '5' * c\na -= b\nans += '3' * b\nans += '2' * a\nprint(ans)\n\n \n \n", "n = int(input())\r\na = input()\r\nans = ''\r\nfor i in range(n):\r\n if a[i] == '2':\r\n ans += '2'\r\n elif a[i] == '3':\r\n ans += '3'\r\n elif a[i] == '4':\r\n ans += '322'\r\n elif a[i] == '5':\r\n ans += '5'\r\n elif a[i] == '6':\r\n ans += '53'\r\n elif a[i] == '7':\r\n ans += '7'\r\n elif a[i] == '8':\r\n ans += '7222'\r\n elif a[i] == '9':\r\n ans += '7332'\r\n else:\r\n pass\r\n \r\nprint(''.join(sorted(ans,reverse = True)))", "n=int(input())\r\na=input()\r\nans=\"\"\r\nd={\"2\":\"2\",\"3\":\"3\",\"4\":\"322\",\"5\":\"5\",\"6\":\"53\",\"7\":\"7\",\"8\":\"7222\",\"9\":\"7332\"}\r\nfor x in a:\r\n if x in d:\r\n ans+=d[x]\r\nd=\"\"\r\nfor c in (sorted(ans)[::-1]):\r\n d+=c\r\nprint(d)\r\n ", "n = input()\ns = input()\ns = s.replace('9','7332')\ns = s.replace('8','7222')\ns = s.replace('6','53')\ns = s.replace('4','322')\ns = s.replace('1','')\ns = s.replace('0','')\ns = ''.join(sorted(s,reverse=True))\nprint(s)\n", "from collections import Counter\nn = int(input())\na = input()\nt = Counter()\nfor i in a:\n x = int(i)\n l = []\n if x == 2:\n l = [2]\n elif x == 3:\n l = [3]\n elif x == 4:\n l = [2, 2, 3]\n elif x == 5:\n l = [5]\n elif x == 6:\n l = [5, 3]\n elif x == 7:\n l = [7]\n elif x == 8:\n l = [7, 2, 2, 2]\n elif x == 9:\n l = [3, 3, 2, 7]\n t += Counter(l)\nans = []\nfor i in t:\n for j in range(t[i]):\n ans.append(i)\nans.sort(reverse=True)\nfor i in ans:\n print(i, end=\"\")", "import heapq\r\nfrom collections import *\r\nimport math\r\ndef fact(n):\r\n fact = 1\r\n for j in range(1, int(n) + 1):\r\n fact = fact * j\r\n return fact\r\n\r\ndef solve():\r\n\r\n n = int(input())\r\n s = input()\r\n a = [\"\", \"\", \"2\", \"3\", \"223\", \"5\", \"35\", \"7\", \"2227\", \"2337\"]\r\n t = \"\"\r\n for i in range(n):\r\n t+=a[int(s[i])]\r\n t = list(t)\r\n t.sort(reverse=True)\r\n s = \"\"\r\n for i in t:\r\n s+=i\r\n print(s)\r\n\r\n# t = int(input())\r\n# for _ in range(t):\r\n# solve()\r\nsolve()\r\n", "import os , sys,time, collections , math , pprint , itertools as it , operator as op , bisect as bs ,functools as fn\r\nmaxx , localsys , mod = 1<<60, 0 , int(1e9 + 7) \r\nnCr = lambda n, r: reduce(mul, range(n - r + 1, n + 1), 1) // factorial(r)\r\nceil = lambda n , x: (n+x -1 )//x \r\nosi, oso = '/home/priyanshu/Documents/cp/input.txt','/home/priyanshu/Documents/cp/output.txt'\r\nif os.path.exists(osi):\r\n\tsys.stdin = open(osi, 'r') ; sys.stdout = open(oso, 'w')\r\n\t\r\ninput = sys.stdin.readline\r\nfrom functools import reduce\r\ndef maps():return map(int , input().split())\r\n\r\n#THINK ABOUT THE EDGE CASES ..........\r\ndef Kth_beautiful_string():\r\n\tfor _ in range(int(input())):\r\n\t\tn , k = maps() ; arr = ['a']*n\r\n\t\tfor i in range(n-1 , -1 , -1):\r\n\t\t\tif n-i-1 >= k:\r\n\t\t\t\tarr[i]= arr[i + (n-i-1) - (k-1)] ='b'\r\n\t\t\t\tprint(''.join(arr)) ; break\r\n\t\t\tk-=n-i-1\r\n\t#constantly decrease the number of string whose left most position is at i,because at every ith position (n-i-1) strings exists whose left most position is at i\r\n\r\ndef div(n):\r\n\tse = collections.defaultdict(int)\r\n\twhile n % 2==0:\r\n\t\tn//=2 ; se[2]+=1\r\n\tfor i in range(3 , int(n**0.5)+1 , 2):\r\n\t\twhile n % i == 0:\r\n\t\t\tse[i]+=1 ; n//=i\r\n\tif n > 1:\r\n\t\tse[n]+=1\r\n\treturn se\r\nf = math.factorial\r\nn = int(input()) ; ans =[] ;s = [*map(int, input().rstrip('\\n'))] ; p = []\r\nfor i in s:\r\n\tx = div(f(i))\r\n\tfor j in x:\r\n\t\twhile x[j]:\r\n\t\t\tp.append(j)\r\n\t\t\tx[j]-=1\r\np = collections.Counter(p)\r\n# print(p)\r\n# print(div(9))\r\nd = {}\r\nOK = True\r\nwhile OK :\r\n\tfor i in range(9,-1,-1):\r\n\t\tif p[i]:\r\n\t\t\tok = True\r\n\t\t\tfor j in range(i-1 ,1 ,-1):\r\n\t\t\t\tif j == 4 and p[2] >=2 :\r\n\t\t\t\t\tcontinue\r\n\t\t\t\telif j == 6 and p[3] and p[2]:\r\n\t\t\t\t\tcontinue\r\n\t\t\t\telif j == 8 and (p[4]>=2 and p[2]>=3):\r\n\t\t\t\t\tcontinue\r\n\t\t\t\telif j == 9 and p[3]>=2:\r\n\t\t\t\t\tcontinue\r\n\t\t\t\telif not p[j] :\r\n\t\t\t\t\tok = False\r\n\t\t\tif ok:\r\n\t\t\t\tfor j in range(i-1 ,1 ,-1):\r\n\t\t\t\t\tif j == 4 and p[2] >=2 :\r\n\t\t\t\t\t\tp[2]-=2\r\n\t\t\t\t\telif j == 6 and p[3] and p[2]:\r\n\t\t\t\t\t\tp[3]-=1 ; p[2]-=1\r\n\t\t\t\t\telif j == 8 and p[2]>=3:\r\n\t\t\t\t\t\tp[2]-=3\t\t\t\t\t\t\t\r\n\t\t\t\t\telif j == 9 and p[3]>=2:\r\n\t\t\t\t\t\tp[3]-=2\r\n\t\t\t\t\telse:\r\n\t\t\t\t\t\tp[j]-=1\r\n\t\t\t\tans.append(i)\r\n\t\t\t\tp[i]-=1\r\n\t\t\t\tbreak\r\n\telse:\r\n\t\tbreak\r\nprint(*ans,sep='')\r\n", "d={0:-1,1:-1,2:2,3:3,4:322,5:5,6:53,7:7,8:7222,9:7332}\r\nn=int(input())\r\na=int(input())\r\ns=str(a)\r\nans=''\r\nfor i in s:\r\n v=d[int(i)]\r\n if v>0:\r\n ans+=str(v)\r\nans=list(ans)\r\nans.sort(reverse=True)\r\nout=''.join(ans)\r\nprint(int(out))\r\n", "\n# Online Python - IDE, Editor, Compiler, Interpreter\nimport os\nimport statistics\n\nif __name__ == \"__main__\":\n n = int(input())\n chuoi = input()\n \n A = []\n \n for i in range(0, 10):\n A.append(0)\n \n for i in range(0,n):\n A[int(chuoi[i])] += 1\n \n A[7] += A[8] + A[9]\n A[5] += A[6]\n A[3] += A[6] + A[4] + 2*A[9]\n A[2] += 2*A[4] + 3*A[8] + A[9]\n A[9] = 0\n A[8] = 0\n A[6] = 0\n A[4] = 0\n \n result = \"\"\n for i in range(9, 1, -1):\n while A[i] > 0:\n result += str(i)\n A[i] -= 1\n \n print(result)\n", "def fact(arr):\r\n arr2=[]\r\n arr3 = []\r\n arr4 = []\r\n for valor in arr:\r\n if valor==2:\r\n arr2.append(2)\r\n elif valor==3:\r\n arr2.append(3)\r\n elif valor==4:\r\n arr2.append(2)\r\n arr2.append(2)\r\n arr2.append(3)\r\n elif valor==5:\r\n arr2.append(5)\r\n elif valor==6:\r\n arr2.append(3)\r\n arr2.append(5)\r\n elif valor==7:\r\n arr2.append(7)\r\n elif valor==8:\r\n arr2.append(2)\r\n arr2.append(2)\r\n arr2.append(2)\r\n arr2.append(7)\r\n elif valor==9:\r\n arr2.append(3)\r\n arr2.append(3)\r\n arr2.append(2)\r\n arr2.append(7)\r\n else:\r\n continue\r\n arr2.sort(reverse=True)\r\n arr3=map(str, arr2)\r\n arr4=''.join(arr3)\r\n return arr4\r\n\r\nn = int(input())\r\nval = int(input())\r\narr=map(int,str(val))\r\nprint(fact(arr))", "from sys import *\r\ninput = lambda:stdin.readline()\r\n\r\nint_arr = lambda : list(map(int,stdin.readline().strip().split()))\r\nstr_arr = lambda :list(map(str,stdin.readline().split()))\r\nget_str = lambda : map(str,stdin.readline().strip().split())\r\nget_int = lambda: map(int,stdin.readline().strip().split())\r\nget_float = lambda : map(float,stdin.readline().strip().split())\r\n\r\n\r\nmod = 1000000007\r\nsetrecursionlimit(1000)\r\n\r\nn = int(input())\r\ns = str(input())[:-1]\r\n\r\nlst = [\"\",\"\",\"2\",\"3\",\"223\",\"5\",\"53\",\"7\",\"7222\",\"7332\"]\r\nst = \"\"\r\nfor i in range(n):\r\n st += lst[int(s[i])]\r\n\r\nst = sorted(st,reverse = True)\r\nprint(''.join(st))\r\n\r\n", "n=int(input())\r\ns=input()\r\nans=''\r\nfor x in s:\r\n if x=='2' or x=='3':\r\n ans+=x\r\n elif x=='5' or x=='7':\r\n ans+=x\r\n elif x=='4':\r\n ans+='223'\r\n elif x=='6':\r\n ans+='53'\r\n elif x=='8':\r\n ans+='7222'\r\n elif x=='9':\r\n ans+='7332'\r\nlist1=[int(x) for x in ans]\r\nlist1.sort(reverse=True)\r\nans=''.join(map(str,list1))\r\nprint(ans)", "t=int(input())\r\ns=input()\r\ns=s.replace(\"0\",\"\")\r\ns=s.replace(\"1\",\"\")\r\ns=s.replace(\"4\",\"322\")\r\ns=s.replace(\"6\",\"53\")\r\ns=s.replace(\"8\",\"7222\")\r\ns=s.replace(\"9\",\"7332\")\r\ns=''.join(sorted(s,reverse=True))\r\nprint(s)", "import sys\r\ninput =sys.stdin.readline\r\nx = int(input())\r\ny =str(int(input()))\r\nli = [0]*10\r\nli[2] = [2]\r\nli[3] = [3]\r\nli[4] = [3, 2, 2]\r\nli[5] = [5]\r\nli[6 ] = [5, 3]\r\nli[7] = [7]\r\nli[8] = [7, 2, 2, 2]\r\nli[9] = [7, 3, 3, 2]\r\nli1, str1 = [], ''\r\nfor i in y:\r\n\tif i!='0'and i != '1':\r\n\t\tli1 += li[int(i)]\r\nli1.sort(reverse = True)\r\nfor i in li1:\r\n\tstr1 += str(i)\r\nprint(str1)\r\n", "a=int(input())\r\nb=input()\r\nl=[0 for i in range(10)]\r\nfor i in b:\r\n if i=='2' or i=='3' or i=='5' or i=='7':\r\n l[int(i)]+=1\r\n elif i=='4':\r\n l[3]+=1\r\n l[2]+=2\r\n elif i=='6':\r\n l[5]+=1\r\n l[3]+=1\r\n elif i=='8':\r\n l[2]+=3\r\n l[7]+=1\r\n elif i=='9':\r\n l[2]+=1\r\n l[3]+=2\r\n l[7]+=1\r\nfor i in range(9,1,-1):\r\n while(l[i]):\r\n print(i,end=\"\")\r\n l[i]-=1\r\n \r\n ", "input()\r\nn = input()\r\n\r\narr = ['' , ''] + '2 3 322 5 53 7 7222 2337'.split()\r\nans = ''\r\nfor i in n:\r\n ans += arr[int(i)]\r\n\r\nans = sorted(ans ,reverse= True)\r\nprint(''.join(ans))\r\n", "import math\r\n\r\n\r\ndef fill_prime(x):\r\n\r\n is_prime = [True] * x\r\n is_prime[0] = is_prime[1] = False\r\n for i in range(2, x):\r\n if is_prime[i]:\r\n for j in range(i * i, x, i):\r\n is_prime[j] = False\r\n primes = set()\r\n for i in range(2, x):\r\n if is_prime[i]:\r\n primes.add(i)\r\n return primes\r\n\r\n\r\ndef fill_factorial(x):\r\n\r\n fac = [0 for _ in range(x)]\r\n fac[0] = fac[1] = 1\r\n for i in range(2, x):\r\n fac[i] = i * fac[i - 1]\r\n\r\n return fac\r\n\r\n\r\ndef factorize(x):\r\n factors = {}\r\n k = int(math.sqrt(x)) + 1\r\n for i in range(2, k):\r\n if x == 1 or x in primes:\r\n break\r\n if x % i == 0 and i not in factors:\r\n factors[i] = 0\r\n while x % i == 0:\r\n x //= i\r\n factors[i] += 1\r\n if x != 1:\r\n factors[x] = 1\r\n return factors\r\n\r\n\r\ndef ffactor(x, fac, primes):\r\n\r\n if x in primes:\r\n return [x]\r\n\r\n ret = []\r\n rem = fac[x]\r\n\r\n while x >= 2:\r\n\r\n x -= 1\r\n\r\n if x in primes:\r\n rem //= fac[x]\r\n ret.append(x)\r\n break\r\n\r\n factors = factorize(rem)\r\n\r\n for p in sorted(factors, reverse=True):\r\n for e in range(factors[p]):\r\n ret.append(p)\r\n if p != 2:\r\n factors[p - 1] -= factors[p]\r\n\r\n return ret\r\n\r\n\r\nMAX = 10\r\n\r\nfac = fill_factorial(MAX)\r\nprimes = fill_prime(MAX)\r\n\r\nsuper_fact = [ffactor(i, fac, primes) for i in range(MAX)]\r\n\r\nn = int(input())\r\na = input()\r\nret = ''\r\nfor num in a:\r\n for x in super_fact[int(num)]:\r\n ret += str(x)\r\nprint(''.join(sorted(ret, reverse=True)))\r\n", "n = int(input())\na = list(input())\ndic = {\"2\" : '2', \"3\":\"3\", \"4\": \"322\", \"5\":\"5\",\"6\":\"53\",\"7\":\"7\",\"8\":\"7222\",\"9\":\"7332\"}\nwhile(a.count('0') > 0):\n a.remove('0')\nwhile(a.count('1') > 0):\n a.remove('1')\nfor i in range(len(a)):\n if a[i] in dic:\n a[i] = dic[a[i]]\nans = \"\"\nfor i in range(len(a)):\n ans += a[i]\n# print(ans)\nans_list = list(ans)\nans_list.sort(reverse = True)\nfor x in ans_list:\n print(x, end=\"\")\n\t \t\t \t \t\t\t\t \t\t\t \t\t \t \t\t\t\t", "def main():\r\n n = int(input())\r\n num = int(input())\r\n f = [1] * 10\r\n ans = []\r\n lookup = {2: ['2'], 3: ['3'], 4: ['2', '2', '3'],\r\n 5: ['5'], 6: ['3', '5'],\r\n 7: ['7'], 8: ['2', '2', '2', '7'],\r\n 9: ['2', '3', '3', '7']}\r\n while num != 0:\r\n if num % 10 > 1:\r\n ans += lookup[num % 10]\r\n num = num // 10\r\n\r\n # ans.reverse()\r\n ans.sort(reverse=True)\r\n print(''.join(ans))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "\ndef add(x, i):\n if i == 1:\n pass\n if i == 2:\n x.append(2)\n if i == 3:\n x.append(3)\n if i == 4:\n x.append(2)\n x.append(2)\n x.append(3)\n if i == 5:\n x.append(5)\n if i == 6:\n x.append(5)\n x.append(3)\n if i == 7:\n x.append(7)\n if i == 8:\n x.append(7)\n x.append(2)\n x.append(2)\n x.append(2)\n if i == 9:\n x.append(7)\n x.append(2)\n x.append(3)\n x.append(3)\n\n\ndef work(a):\n x = []\n for i in a:\n add(x, int(i))\n x.sort(reverse=True)\n print(''.join([str(c) for c in x]))\n\n\n\ninput()\nwork(input())\n", "n=int(input())\r\ns=input()\r\narr=[0]*8\r\nfor i in range(n):\r\n if s[i]=='0' or s[i]=='1':\r\n continue\r\n if s[i]=='4':\r\n arr[2]+=2\r\n arr[3]+=1\r\n continue\r\n if s[i]=='6':\r\n arr[3]+=1\r\n arr[5]+=1\r\n continue\r\n if s[i]=='8':\r\n arr[7]+=1\r\n arr[2]+=3\r\n continue\r\n if s[i]=='9':\r\n arr[7]+=1\r\n arr[3]+=2\r\n arr[2]+=1\r\n continue\r\n arr[int(s[i])]+=1\r\ns=''\r\nfor i in range(7,1,-1):\r\n s+=str(i)*arr[i]\r\nprint(s)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nx = int(input())\r\nn = input()[:-1]\r\nd = []\r\nfor i in n:\r\n if i == '9':\r\n d.extend(('3', '3', '2', '7'))\r\n elif i == '8':\r\n d.extend(('2', '2', '2', '7'))\r\n elif i == '7':\r\n d.append('7')\r\n elif i == '6':\r\n d.extend(('3','5'))\r\n elif i == '5':\r\n d.append('5')\r\n elif i == '4':\r\n d.extend(('2', '2', '3'))\r\n elif i == '3':\r\n d.append('3')\r\n elif i == '2':\r\n d.append('2')\r\nd.sort(reverse=True)\r\nprint(''.join(d))", "n=int(input())\r\ns=input()\r\nl=['','','2','3','322','5','53','7','7222','7332']\r\nfor i in range(0,10):\r\n s=s.replace(str(i),l[i])\r\ns=sorted(s,reverse=True)\r\n\r\nprint(''.join(map(str,s)))", "#!/usr/bin/python3 -SOO\nimport math,string,itertools,fractions,re,array,bisect\nfrom heapq import *\nfrom collections import *\n\nn = int(input())\nfac = [1]\na = 1\nfor i in range(1,11):\n fac.append(i*fac[-1])\nl = []\nfor x in input().strip():\n if x=='0' or x=='1': continue\n if x=='4':\n l += ['3','2','2']\n elif x=='6':\n l += ['5','3']\n elif x=='8':\n l += ['7','2','2','2']\n elif x=='9':\n l += ['7','3','3','2']\n else:\n l += [x]\nprint(''.join(sorted(l,reverse=True)))\n", "n=int(input())\r\na=input()\r\nb=[[],[],[2],[3],[2,2,3],[5],[3,5],[7],[2,2,2,7],[2,3,3,7]]\r\nc=[]\r\nfor i in a:\r\n c.extend(b[int(i)])\r\nc.sort(reverse=True)\r\nprint(\"\".join(list(map(str,c))))", "n = input()\r\na = input()\r\na_s = str(a)\r\n\r\nls = []\r\n\r\nfor digit in a_s:\r\n if digit == '2':\r\n ls.append(2)\r\n if digit == '3':\r\n ls.append(3)\r\n if digit == '4':\r\n ls.append(2)\r\n ls.append(2)\r\n ls.append(3)\r\n if digit == '5':\r\n ls.append(5)\r\n if digit == '6':\r\n ls.append(5)\r\n ls.append(3)\r\n if digit == '7':\r\n ls.append(7)\r\n if digit == '8':\r\n ls.append(7)\r\n ls.append(2)\r\n ls.append(2)\r\n ls.append(2)\r\n if digit == '9':\r\n ls.append(7)\r\n ls.append(2)\r\n ls.append(3)\r\n ls.append(3)\r\n\r\nls.sort(reverse=True)\r\nline = ''\r\nfor num in ls:\r\n line += str(num)\r\nprint(int(line))\r\n", "from sys import stdin,stdout\r\ninput = stdin.readline\r\nfrom math import sqrt,gcd,ceil,inf,log2\r\n# from collections import Counter,deque\r\n# from heapq import heapify,heappop,heappush\r\n# from time import time\r\n# from bisect import bisect, bisect_left,insort\r\n\r\n\r\no = int(input())\r\nn = input().rstrip('\\n')\r\nA = {}\r\nfor i in n:\r\n for j in range(2,int(i) + 1):\r\n if j == 8:\r\n A[2] += 3\r\n elif j == 9:\r\n A[3] += 2\r\n elif j == 6:\r\n A[2] += 1\r\n A[3] += 1\r\n elif j == 4:\r\n A[2] += 2\r\n else:\r\n if j in A:\r\n A[j] += 1\r\n else:\r\n A[j] = 1\r\ncount = 0\r\nans = \"\" \r\n# print(A) \r\nfor j in range(9,1,-1):\r\n if (j in A):\r\n for i in range(A[j] - count):\r\n ans += str(j)\r\n if j ==7:\r\n A[3] -= 1\r\n A[2] -= 3\r\n if j == 5:\r\n A[2] -= 2 \r\n count = A[j] \r\nprint(ans) \r\n\r\n", "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\n# sys.stdin=open('input.txt','r')\r\n# sys.stdout=open('output.txt','w')\r\ndic={'1':'','0':'','2':'2','3':'3','4':'322','5':'5','6':'53','7':'7','8':'7222','9':'7332'}\r\nn=vary(1)\r\nnum=input()\r\nans=''\r\nfor i in num:\r\n ans+=dic[i]\r\nans=list(ans)\r\nans.sort(reverse=True)\r\nfor i in ans:\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", "L=[\"\",\"\",\"2\",\"3\",\"223\",\"5\",\"35\",\"7\",\"2227\",\"3327\"]\r\ninput()\r\nprint(\"\".join(sorted(\"\".join([L[int(k)] for k in input()]))[::-1]))\r\n\r\n", "n = int(input())\na = input()\n\nsubst = dict()\nsubst['0'] = ''\nsubst['1'] = ''\nsubst['2'] = '2'\nsubst['3'] = '3'\nsubst['4'] = '223'\nsubst['5'] = '5'\nsubst['6'] = '35'\nsubst['7'] = '7'\nsubst['8'] = '2227'\nsubst['9'] = '3327'\n\nans = ''\nfor x in a:\n ans+=subst[x]\n\nif x=='':\n print(\"-1\")\nelse:\n ans = ''.join(sorted(ans, reverse=True))\n print(ans)", "n=int(input())\r\ns=list(input())\r\nd={\"1\":\"\",\"2\":\"2\",\"3\":\"3\",\"4\":\"322\",\"5\":\"5\",\"6\":\"53\",\"7\":\"7\",\"8\":\"7222\",\"9\":\"7332\",\"0\":\"\"}\r\nans=\"\"\r\nfor i in s:\r\n ans+=d[i]\r\nans=list(ans)\r\nans.sort(reverse=True)\r\nprint(\"\".join(ans))\r\n ", "convert = [\"\", \"\", \"2\", \"3\", \"223\", \"5\", \"35\", \"7\", \"2227\", \"2337\"]\r\nn = int(input())\r\nprint(\"\".join(sorted(\"\".join(convert[int(i)] for i in input())))[::-1])\r\n ", "input()\r\nA=[[],[],['2'],['3'],['2','2','3'],['5'],['3','5'],['7'],['2','2','2','7'],['2','3','3','7']]\r\nB=[]\r\nfor i in input(): B+=A[int(i)]\r\nprint(''.join(sorted(B,reverse=True)))\r\n", "Factorials = [\"\", \"\", \"2\", \"3\", \"223\", \"5\", \"35\", \"7\", \"2227\", \"3327\"]\r\nn = int(input())\r\na = [Factorials[int(i)] for i in input()]\r\nans = sorted(''.join(a))\r\nprint(''.join(ans[::-1]))\r\n\r\n", "n = int(input())\nA = ['', '', '2', '3', '223', '5', '53', '7', '7222', '7332']\na = input()\nres = ''\n\nfor i in a:\n res = res + A[int(i)]\nprint(''.join(sorted(list(res), reverse = True)))\n", "ch = ['','','2', '3', '322', '5', '53', '7', '7222', '7332']\r\nd = int(input())\r\nn = input().strip()\r\nres = \"\"\r\nfor c in n:\r\n res += ch[int(c)]\r\nprint(''.join(sorted([*res], reverse=True)))", "n=int(input())\r\na=input()\r\nresult=[]\r\nfor i in a:\r\n if i=='1' or i=='0':\r\n continue \r\n elif(i=='4'):\r\n result.extend([3,2,2])\r\n elif(i=='6'):\r\n result.extend([5,3])\r\n elif(i=='8'):\r\n result.extend([7,2,2,2])\r\n elif(i=='9'):\r\n result.extend([7,3,3,2])\r\n else:\r\n result.append(int(i))\r\nresult.sort(reverse=True)\r\nprint(\"\".join([str(i) for i in result]))\r\n \r\n ", "import sys\nimport string\nimport math\nfrom collections import defaultdict\nfrom functools import lru_cache\nfrom collections import Counter\nfrom fractions import Fraction\n\ndef mi(s):\n return map(int, s.strip().split())\n\ndef lmi(s):\n return list(mi(s))\n\ndef tmi(s):\n return tuple(mi(s))\n\ndef mf(f, s):\n return map(f, s)\n\ndef lmf(f, s):\n return list(mf(f, s))\n\ndef js(lst):\n return \" \".join(str(d) for d in lst)\n\ndef jsns(lst):\n return \"\".join(str(d) for d in lst)\n\ndef line():\n return sys.stdin.readline().strip()\n\ndef linesp():\n return line().split()\n\ndef iline():\n return int(line())\n\ndef mat(n):\n matr = []\n for _ in range(n):\n matr.append(linesp())\n return matr\n\ndef matns(n):\n mat = []\n for _ in range(n):\n mat.append([c for c in line()])\n return mat\n\ndef mati(n):\n mat = []\n for _ in range(n):\n mat.append(lmi(line())) \n return mat\n\ndef pmat(mat):\n for row in mat:\n print(js(row))\n\ndef main():\n line()\n n=[c for c in line()]\n new=[]\n # Assume we can get a number d1d2d3\n # such that it can't be divided anymore.\n # Assume that we can still get a larger number.\n for d in n:\n if d=='0' or d=='1':\n continue\n elif d=='4':\n new.append(3)\n new.append(2)\n new.append(2)\n elif d=='6':\n new.append(5)\n new.append(3)\n elif d=='8':\n new.append(7)\n new.append(2)\n new.append(2)\n new.append(2)\n elif d=='9':\n new.append(7)\n new.append(3)\n new.append(3)\n new.append(2)\n else:\n new.append(int(d))\n new.sort(reverse=True)\n print(jsns(new))\nmain()\n", "input()\r\nd ={}\r\na = input()\r\nfor i in a:\r\n\tif i==\"1\" or i==\"0\":pass\r\n\telse:\r\n\t\tif int(i)%2!=0 or i == \"2\":\r\n\t\t\tif i==\"9\":\r\n\t\t\t\tif 2 in d:d[2]+=1\r\n\t\t\t\telse:d[2]=1\r\n\t\t\t\tif 3 in d:d[3]+=2\r\n\t\t\t\telse:d[3]=2\r\n\t\t\t\tif 7 in d:d[7]+=1\r\n\t\t\t\telse:d[7]=1\r\n\t\t\telse:\r\n\t\t\t\tif int(i) in d:d[int(i)]+=1\r\n\t\t\t\telse:d[int(i)]=1\r\n\t\telse:\r\n\t\t\tif i==\"4\":\r\n\t\t\t\tif 2 in d:d[2]+=2\r\n\t\t\t\telse:d[2]=2\r\n\t\t\t\tif 3 in d:d[3]+=1\r\n\t\t\t\telse:d[3]=1\r\n\t\t\telif i==\"6\":\r\n\t\t\t\tif 3 in d:d[3]+=1\r\n\t\t\t\telse:d[3]=1\r\n\t\t\t\tif 5 in d:d[5]+=1\r\n\t\t\t\telse:d[5]=1\r\n\t\t\telif i==\"8\":\r\n\t\t\t\tif 2 in d:d[2]+=3\r\n\t\t\t\telse:d[2]=3\r\n\t\t\t\tif 7 in d:d[7]+=1\r\n\t\t\t\telse:d[7]=1\r\nans =\"\"\r\nfor i in range(9,1,-1):\r\n\tif i in d:\r\n\t\tans+=str(i)*d[i]\r\nprint(ans)", "n=int(input())\r\nk=int(input())\r\na=[\"\",\"\",\"2\",\"3\",\"322\",\"5\",\"35\",\"7\",\"7222\",\"7233\"]\r\ns=\"\"\r\nfor i in range(n):\r\n s=s+a[int(k%10)]\r\n k/=10\r\ns=''.join(sorted(s))[::-1]\r\nprint(s)", "#rOkY\r\n#FuCk\r\n\r\n################################## kOpAl #####################################\r\n\r\nimport math\r\n\r\ndef fact(f):\r\n if(f==1):\r\n return f\r\n else:\r\n return f*fact(f-1)\r\n\r\n\r\nls=['','','2','3','223','5','53','7','7222','7332']\r\n\r\nt=int(input())\r\ns=str(input())\r\ns1=''\r\nfor i in range(0,len(s),1):\r\n d=int(s[i])\r\n s1+=str(ls[d])\r\nk=''.join(reversed(sorted(s1)))\r\nprint(k)\r\n", "num = int(input())\na = list(map(int,list(input())))\narray = []\nfor i in a:\n if i > 1:\n for k in range(1, i+1):\n if k > 1:\n if k == 4:\n array.append(2)\n array.append(2)\n elif k == 6:\n array.append(3)\n array.append(2)\n elif k == 8:\n array.append(2)\n array.append(2)\n array.append(2)\n elif k == 9:\n array.append(3)\n array.append(3)\n else:\n array.append(k)\nres = ''\nwhile array:\n maximum = max(array)\n res += str(maximum)\n for i in range(maximum, 1, -1):\n if i == 4:\n array.remove(2)\n array.remove(2)\n elif i == 6:\n array.remove(2)\n array.remove(3)\n elif i == 8:\n array.remove(2)\n array.remove(2)\n array.remove(2)\n elif i == 9:\n array.remove(3)\n array.remove(3)\n else:\n array.remove(i)\nprint(res)\n \n", "n = int(input())\r\na = int(input())\r\nd = [\"\", \"\", \"2\", \"3\", \"322\", \"5\", \"53\", \"7\", \"7222\", \"7332\"]\r\nc = \"\"\r\nwhile(a>0):\r\n t = a%10\r\n a = a//10\r\n c += d[t]\r\nprint(''.join(sorted(c, reverse = True)))\r\n", "def primefactors(x):\r\n d={2:0,3:0,5:0,7:0}\r\n l=[2,3,5,7]\r\n for y in l:\r\n while x%y==0:\r\n d[y]+=1\r\n x//=y\r\n return d\r\nimport sys\r\ninput=sys.stdin.readline\r\nfrom math import factorial\r\nn=int(input())\r\na=input().rstrip()\r\nnum=1\r\nfor x in a:\r\n num*=factorial(int(x))\r\n\r\nd=primefactors(num)\r\nans=''\r\ns7=s5=s3=s2=''\r\ns7=d[7]*'7'\r\nans+=s7\r\nd[2]-=d[7]*4\r\nd[3]-=d[7]*2\r\nd[5]-=d[7]\r\ns5=d[5]*'5'\r\nans+=s5\r\nd[2]-=d[5]*3\r\nd[3]-=d[5]\r\ns3=d[3]*'3'\r\nans+=s3\r\nd[2]-=d[3]\r\ns2=d[2]*'2'\r\nans+=s2\r\nprint(ans)", "n = int(input())\r\nt = input()\r\ns = ''\r\nb=[\"\",\"\",\"2\",\"3\",\"2.2.3\",\"5\",\"5.3\",\"7\",\"7.2.2.2\",\"7.3.3.2\"]\r\nfor i in t:\r\n s+=b[int(i)]+'.'\r\nans = sorted(s.split('.'),reverse=True)\r\nprint(int(''.join(ans)))\r\n\r\n\r\n", "n = int(input())\r\nstr = input()\r\na = [0] * 10\r\nfor c in str:\r\n\tif c == '2':\r\n\t\ta[2] += 1\r\n\tif c == '3':\r\n\t\ta[3] += 1\r\n\tif c == '4':\r\n\t\ta[2] += 2\r\n\t\ta[3] += 1\r\n\tif c == '5':\r\n\t\ta[5] += 1\r\n\tif c == '6':\r\n\t\ta[3] += 1\r\n\t\ta[5] += 1\r\n\tif c == '7':\r\n\t\ta[7] += 1\r\n\tif c == '8':\r\n\t\ta[2] += 3\r\n\t\ta[7] += 1\r\n\tif c == '9':\r\n\t\ta[2] += 1\r\n\t\ta[3] += 2\r\n\t\ta[7] += 1\r\nprint(a[7] * '7' + a[5] * '5' + a[3] * '3' + a[2] * '2')# 1698302765.6111655", "# link: https://codeforces.com/problemset/problem/515/C\r\n\r\nimport sys\r\n\r\nif __name__ == \"__main__\":\r\n vaibhav = sys.stdin.readline\r\n n = int(vaibhav())\r\n num = vaibhav() # input taken in string format\r\n memo = {'2':[2], '3':[3], '4':[3,2,2], '5':[5], '6':[5,3], '7':[7], '8':[7,2,2,2], '9':[7,3,3,2]}\r\n ans = []\r\n for i in range(n):\r\n if num[i] in ['1','0']:\r\n continue\r\n else:\r\n for value in memo[num[i]]:\r\n ans.append(str(value))\r\n ans.sort(reverse=True)\r\n print(\"\".join(ans)) \r\n", "n=int(input())\r\ns={0:'',1:'',2:'2',3:'3',4:'322',5:'5',6:'53',7:'7',8:'7222',9:'7332'}#8*9 72 6*6*2\r\n#greedy\r\nn=str(input())\r\nn=[int(t) for t in n]\r\nn=[s[r] for r in n]\r\nn=''.join(n)\r\nn=list(n)\r\nn.sort(reverse=True)\r\nprint(*n,sep='')", "dic = {'0':'',\r\n '1':'',\r\n '2':'2',\r\n '3':'3',\r\n '4':'223',\r\n '5':'5',\r\n '6':'35',\r\n '7':'7',\r\n '8':'2227',\r\n '9':'2337'}\r\n\r\nn = int(input())\r\na = input()\r\n\r\nanswer = ''\r\n\r\nfor c in a:\r\n answer += dic[c]\r\n\r\nanswer = sorted(answer,reverse=True)\r\nprint(''.join(answer))", "n=int(input())\r\na=input()\r\nans=[]\r\nfor i in range(n):\r\n\tif a[i]=='1' or a[i]=='0':\r\n\t\tcontinue\r\n\telif a[i]=='4':\r\n\t\tans.append('3')\r\n\t\tans.append('2')\r\n\t\tans.append('2')\r\n\telif a[i]=='6':\r\n\t\tans.append('5')\r\n\t\tans.append('3')\r\n\telif a[i]=='8':\r\n\t\tans.append('2')\r\n\t\tans.append('2')\r\n\t\tans.append('2')\r\n\t\tans.append('7')\r\n\telif a[i]=='9':\r\n\t\tans.append('7')\r\n\t\tans.append('3')\r\n\t\tans.append('3')\r\n\t\tans.append('2')\r\n\telse:\r\n\t\tans.append(a[i])\r\n\r\nans.sort(reverse=True)\r\nfin=''\r\nfor i in ans:\r\n\tfin+=i\r\n\r\nprint(fin)", "n = int(input())\r\nmas = list(input())\r\n\r\nd = dict()\r\nfor i in range(2,10):\r\n d[i] = 0\r\n \r\nfor i in range(n):\r\n j = int(mas[i])\r\n if j == 2:\r\n d[2] += 1\r\n if j == 3:\r\n d[3] += 1\r\n if j == 4:\r\n d[2] += 2\r\n d[3] += 1\r\n if j == 5:\r\n d[5] += 1\r\n if j == 6:\r\n d[5] += 1\r\n d[3] += 1\r\n if j == 7:\r\n d[7] += 1\r\n if j == 8:\r\n d[7] += 1\r\n d[2] += 3\r\n if j == 9:\r\n d[7] += 1\r\n d[3] += 2\r\n d[2] += 1\r\n\r\nans = ''\r\nwhile len(d) > 0:\r\n i = max(d)\r\n ans += str(i) * d.pop(i)\r\nprint(ans)\r\n", "(input())\r\ns=input()\r\nz=[]\r\nfor n in s:\r\n x=int(n)\r\n if x==2 or x==3 or x==5 or x==7:\r\n z.append(x)\r\n elif x==4:\r\n z.append(3)\r\n z.append(2)\r\n z.append(2)\r\n elif x==6:\r\n z.append(5)\r\n z.append(3)\r\n elif x==8:\r\n z.append(7)\r\n z.append(2)\r\n z.append(2)\r\n z.append(2)\r\n elif x==9:\r\n z.append(7)\r\n z.append(3)\r\n z.append(3)\r\n z.append(2)\r\nz.sort()\r\nz=z[::-1]\r\nfor n in z:\r\n print(n,end='')\r\n\r\n", "n = input()\r\ns = input()\r\nmp = {0 : \"\", 1 : \"\", 2 : \"2\", 3 : \"3\", 4 : \"322\", 5 : \"5\", 6 : \"35\", 7 : \"7\", 8 : \"2227\", 9 : \"3327\"}\r\nres = \"\"\r\n\r\nfor ch in s:\r\n\tres += mp[int(ch)]\r\n\r\nres = ''.join(sorted(res))\r\nres = res[::-1]\r\n\r\nprint(res)\r\n\r\n", "f = [\"2\",\"3\",\"322\",\"5\",\"53\",\"7\",\"7222\",\"7332\"];\r\nl = int(input());\r\nd = list(map(int, list(input())));\r\np = [];\r\nfor i in d:\r\n if i > 1:\r\n p.append(f[i-2]);\r\nprint(\"\".join(sorted(list(\"\".join(p)),reverse=True)));", "\r\n\r\nd = {'0':'', '1':'', '2':'2', '3':'3', '4':'223','5':'5','6':'53','7':'7','8':'7222','9':'7233' }\r\n\r\nn = int(input())\r\na = input()\r\nans = ''\r\nfor i in a:\r\n ans += d[i]\r\n\r\nprint(''.join(sorted(ans))[::-1])", "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\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\na = list(data())\r\nanswer = []\r\nfor i in a:\r\n temp = int(i)\r\n if 1 < temp <= 3 or temp == 5 or temp == 7:\r\n answer.append(temp)\r\n if temp == 4:\r\n answer.extend([3, 2, 2])\r\n if temp == 6:\r\n answer.extend([5, 3])\r\n if temp == 8:\r\n answer.extend([2, 2, 2, 7])\r\n if temp == 9:\r\n answer.extend([3, 3, 2, 7])\r\nanswer.sort(reverse=True)\r\nout(''.join(map(str, answer)))\r\n", "n = int(input())\r\ns = input()\r\nans = \"\"\r\nfor i in s:\r\n if(i==\"1\" or i==\"0\"):\r\n continue\r\n elif(i==\"4\"):\r\n ans+=\"322\"\r\n elif(i==\"6\"):\r\n ans+=\"53\"\r\n elif(i==\"8\"):\r\n ans+=\"7222\"\r\n elif(i==\"9\"):\r\n ans+=\"7332\"\r\n else:\r\n ans+=i\r\nans = list(ans)\r\nans.sort(reverse=True)\r\nfor i in ans:\r\n print(i,end=\"\")", "n = int(input())\r\nstr = input()\r\nans = ''\r\n\r\nfor char in str:\r\n if char <= '1':\r\n continue\r\n elif char == '2':\r\n ans += '2'\r\n elif char == '3':\r\n ans += '3'\r\n elif char == '4':\r\n ans += '322'\r\n elif char == '5':\r\n ans += '5'\r\n elif char == '6':\r\n ans += '53'\r\n elif char == '7':\r\n ans += '7'\r\n elif char == '8':\r\n ans += '7222'\r\n elif char == '9':\r\n ans += '7332'\r\n\r\nans = ''.join(sorted(ans, reverse=True))\r\nprint(ans)", "dct = {'0':\"\",'1':\"\",'2':\"2\",'3':\"3\",'4':\"223\",'5':\"5\",'6':\"35\",'7':\"7\",'8':\"2227\",'9':\"2337\"}\nnn = int(input())\nn=input()\nlf=\"\"\nfor i in range(len(n)):\n lf+=dct[n[i]]\nfor i in range(len(sorted(lf,reverse=True))-1):\n print(sorted(lf,reverse=True)[i],end='')\nprint((sorted(lf,reverse=True))[len(sorted(lf,reverse=True))-1])", "fact=[[1],[1],[2],[2,3],[2,2,2,3],[2,2,2,3,5],[2,2,2,2,3,3,5],[2,2,2,2,3,3,5,7],[2,2,2,2,2,2,2,3,3,5,7],[2,2,2,2,2,2,2,3,3,3,3,5,7]]\r\nn = int(input())\r\ns = list(map(int,list(input())))\r\ndiv = []\r\nfor i in s:\r\n div+=fact[i]\r\na = [0,0,div.count(2),div.count(3),0,div.count(5),0,div.count(7)]\r\nans = \"\"\r\nfor k in [7,5,3,2]:\r\n cur = a[k]\r\n for i in range(cur):\r\n for j in fact[k]:\r\n a[j]-=1\r\n ans+=str(k)\r\nprint(ans)\r\n \r\n", "n=int(input())\r\ns=input()\r\nl=[0]*4\r\nfor i in range(n):\r\n g=int(s[i])\r\n if(g>1):\r\n if(g==2):\r\n l[0]+=1\r\n if(g==3):\r\n l[1]+=1\r\n if(g==4):\r\n l[0]+=2\r\n l[1]+=1\r\n if(g==5):\r\n l[2]+=1\r\n if(g==6):\r\n l[1]+=1\r\n l[2]+=1\r\n if(g==7):\r\n l[3]+=1\r\n if(g==8):\r\n l[0]+=3\r\n l[3]+=1\r\n if(g==9):\r\n l[0]+=1\r\n l[1]+=2\r\n l[3]+=1\r\nprint(\"7\"*(l[3])+\"5\"*(l[2])+\"3\"*(l[1])+\"2\"*(l[0]))", "n=int(input());a=input();a=a.replace(\"1\",\"\");a=a.replace(\"0\",\"\");a=a.replace(\"6\",\"53\");a=a.replace(\"4\",\"223\");a=a.replace(\"8\",\"2227\");a=a.replace(\"9\",\"3327\");a=list(a);a.sort(reverse=True);print(\"\".join(a))", "from math import *\r\nfrom collections import *\r\nfrom bisect import *\r\nimport heapq\r\nimport math\r\n\r\ndef is_prime(n):\r\n\r\n for i in range(2,math.ceil(math.sqrt(n))):\r\n if(n%i==0):\r\n return False\r\n return True\r\n\r\ndef sieve(n):\r\n arr=[True for _ in range(n+1)]\r\n\r\n for i in range(2,math.ceil(math.sqrt(n))):\r\n if(arr[i]==True):\r\n for j in range(i*i,n+1,i):\r\n arr[j]=False\r\n\r\n return arr\r\n\r\n\r\ndef power(x, y, p):\r\n res = 1 # Initialize result\r\n\r\n # Update x if it is more\r\n # than or equal to p\r\n x = x % p\r\n\r\n if (x == 0):\r\n return 0\r\n\r\n while (y > 0):\r\n\r\n # If y is odd, multiply\r\n # x with result\r\n if ((y & 1) == 1):\r\n res = (res * x) % p\r\n\r\n # y must be even now\r\n y = y >> 1 # y = y/2\r\n x = (x * x) % p\r\n\r\n return res\r\n\r\ndef euclidean_distance(x1,y1,x2,y2):\r\n return sqrt(abs(x1-x2)**2+abs(y1-y2)**2)\r\n\r\n\r\ndef solve():\r\n # s=input()\r\n n=int(input())\r\n num=int(input())\r\n copy=num\r\n mul=1\r\n fact=[0,1,2]\r\n ans=[]\r\n for i in range(3,10):\r\n fact.append(i*fact[-1])\r\n while(copy>0):\r\n x=copy%10\r\n if(x in [4,6,8,9]):\r\n if(x==4):\r\n ans+=[3 ,2 ,2]\r\n if(x==6):\r\n ans+=[5,3]\r\n if(x==8):\r\n ans+=[7,2,2,2]\r\n if(x==9):\r\n ans+=[7,3,3,2]\r\n else:\r\n if(x>1):\r\n ans.append(x)\r\n copy//=10\r\n\r\n\r\n\r\n res=\"\"\r\n ans.sort(reverse=True)\r\n for ele in ans:\r\n res+=str(ele)\r\n print(res)\r\n\r\n\r\nif __name__ == '__main__':\r\n n=1\r\n # n=int(input())\r\n while(n):\r\n n-=1\r\n solve()\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\na = input()\r\narr = []\r\nt=0\r\nfor i in a:\r\n if int(i)!=1 and int(i)!=0:\r\n arr.append(int(i))\r\n t+=1\r\nfinal = []\r\nfor i in range(t):\r\n if arr[i]==2:\r\n final.append(2)\r\n elif arr[i]==3:\r\n final.append(3)\r\n elif arr[i]==4:\r\n final.append(3)\r\n final.append(2)\r\n final.append(2)\r\n elif arr[i]==5:\r\n final.append(5)\r\n elif arr[i]==6:\r\n final.append(5)\r\n final.append(3)\r\n elif arr[i]==7:\r\n final.append(7)\r\n elif arr[i]==8:\r\n final.append(7)\r\n final.append(2)\r\n final.append(2)\r\n final.append(2)\r\n elif arr[i]==9:\r\n final.append(7)\r\n final.append(3)\r\n final.append(3)\r\n final.append(2)\r\nfinal.sort()\r\nfinal1 = ''\r\nfor i in range(-1,-(len(final)+1),-1):\r\n final1+=str(final[i])\r\n\r\nprint(final1)\r\n \r\n \r\n ", "import math\r\n\r\nn = int(input())\r\nnum = [int(i) for i in list(input())]\r\n\r\nreplacements = {}\r\nreplacements[0] = []\r\nreplacements[1] = []\r\nreplacements[2] = [2]\r\nreplacements[3] = [3]\r\nreplacements[4] = [3, 2, 2]\r\nreplacements[5] = [5]\r\nreplacements[6] = [5, 3]\r\nreplacements[7] = [7]\r\nreplacements[8] = [7, 2, 2, 2]\r\nreplacements[9] = [7, 3, 3, 2]\r\n\r\nlst = []\r\nfor i in range(n):\r\n\r\n for j in (replacements[num[i]]):\r\n lst.append(j)\r\n\r\n\r\nlst.sort(reverse=True)\r\nlst1 = [str(j) for j in lst]\r\n\r\nprint(''.join(lst1))\r\n", "import sys\nimport re\nfrom math import gcd, factorial as fact, comb, hypot, atan2, pi,ceil,sqrt\nfrom heapq import *\nfrom random import *\nfrom itertools import *\nfrom functools import *\nfrom bisect import *\nfrom collections import *\nimport threading\n\nthreading.stack_size(2**23)\n\nsys.setrecursionlimit(5*10**4+10)\n\n# input = sys.stdin.readline\ndef read(fn=int):\n\treturn map(fn,input().split())\n\n# toks = (tok for tok in sys.stdin.read().split())\n# def rd(fn=int): return fn(next(toks))\n# def rdn(n,fn=int): return (rd(fn) for _ in range(n))\n\ndef mul(a,b):\n\tc = [[0 for j in range(len(b[0]))] for i in range(len(a))]\n\tfor i in range(len(a)):\n\t\tfor j in range(len(b[0])):\n\t\t\tfor k in range(len(b)):\n\t\t\t\tc[i][j] += a[i][k]*b[k][j]\n\treturn c\n\ndef power(x,y):\n\tn = len(x)\n\tres = [[1 if i==j else 0 for j in range(n)] for i in range(n)]\n\twhile y:\n\t\tif y % 2: res = mul(res,x)\n\t\tx = mul(x,x)\n\t\ty //= 2\n\treturn res\t\n\nmod=998244353\n\ndef sieve(n,primes):\n\tn = int(n)\n\tisp = [True] * (n+1)\n\tfor i in range(2,n+1):\n\t\tif isp[i]:\n\t\t\tprimes += [i]\n\t\t\tfor j in range(i*i,n+1,i):\n\t\t\t\tisp[j] = False\n\treturn isp\n\n# s,p,t = read()\n# P = [*read()]\n# sP = {*P}\n\n# adj = [set() for _ in range(2*n)]\n# for _ in range(t):\n# \ts1,c,s2 = input().split()\n# \ts1,s2 = map(int,(s1-1.s2-1))\n# \tadj[s1].add(s2)\n# \tif s2 \n\n# q = deque([(0,0)])\n# first = True\n# while q:\n# \td,v = q.popleft()\n# \tv = -v\n# \tif v == end:\n# \t\tif not first:\n# \t\t\tprint(d)\n# \t\t\tbreak\n# \t\tfirst = False\n\n# \tfor vv in adj[v]:\n# \t\tq.append((d+1,-vv))\n# else:\n# \tprint(-1)\n\n# for _ in range(int(input())):\nn,=read()\nv=input()\nf=[1]\nfor i in range(20):f+=[f[-1]*(i+1)]\nx = 1\nfor c in v:\n\tx *= f[int(c)]\n# print(x)\na = \"\"\nfor p in [7,5,3,2]:\n\twhile not x % p:\n\t\tprint(p,end='')\n\t\tx //= f[p]\nprint()\n", "n = int(input())\r\nz = input()\r\nl = []\r\nfor i in z:\r\n if i == \"2\" or i == \"3\" or i == \"5\" or i == \"7\":\r\n l.append(int(i))\r\n if i == \"4\":\r\n l += [3, 2, 2]\r\n if i == \"6\":\r\n l += [5, 3]\r\n if i == \"8\":\r\n l += [7, 2, 2, 2]\r\n if i == \"9\":\r\n l += [7, 3, 3, 2]\r\nl.sort(reverse=True)\r\nfor i in l:\r\n print(i, end=\"\")\r\n", "\r\nd={\r\n '1':'1',\r\n '2':'2',\r\n '3':'3',\r\n '4': '322',\r\n '5': '5',\r\n '6': '35',\r\n '7': '7',\r\n '8': '2227',\r\n '9':'3327'\r\n}\r\nn=int(input())\r\na=input()\r\nx=[]\r\nfor i in a:\r\n if i !='0' and i!='1':\r\n x.append(d[i])\r\nx=list(''.join(x))\r\nx.sort(reverse=True)\r\nprint(''.join(x))\r\n", "########################################\r\n\r\n# C. Exams #\r\n\r\n########################################\r\n\r\n# n = int(input())\r\n# a = []\r\n# for i in range(n):\r\n# a.append(list(map(int, input().split())))\r\n# a.sort()\r\n# ch = min(a[0])\r\n# for i in range(1, n):\r\n# if(ch > a[i][1]):\r\n# ch = a[i][0]\r\n# else:\r\n# ch = a[i][1]\r\n\r\n# print(ch)\r\n\r\n########################################\r\n\r\n# C. Drazil and Factorial #\r\n\r\n########################################\r\n\r\nar = [[0], [1], [2], [3], [3, 2, 2], [5],\r\n [5, 3], [7], [7, 2, 2, 2], [7, 3, 3, 2]]\r\nn = int(input())\r\nnum = input()\r\nans = []\r\nfor i in num:\r\n if(int(i) > 1):\r\n for j in ar[int(i)]:\r\n ans.append(j)\r\nans = sorted(ans, reverse=True)\r\nprint(''.join(str(x) for x in ans))\r\n", "import sys\nlines = sys.stdin.readlines()\nN = int(lines[0].strip())\nnum = lines[1].strip()\nfactor = {2:{2:1}, 3: {3:1}, 4:{2:2}, 5:{5:1}, 6:{2:1, 3:1}, 7:{7:1}, 8:{2:3}, 9:{3:2}}\n\nfactorial = [{}, {}]\n\ntmp = {}\nfor i in range(2, 10):\n for k in factor[i].keys():\n if k not in tmp: tmp[k] = 0\n tmp[k] += factor[i][k]\n factorial.append(tmp.copy())\ntarget = {}\nfor l in num:\n for k in factorial[int(l)].keys():\n if k not in target: target[k] = 0\n target[k] += factorial[int(l)][k]\nres = \"\"\nif 7 in target:\n val = target[7]\n res += \"7\" * val\n for k in factorial[7].keys():\n target[k] -= factorial[7][k] * val\n\nif 5 in target and target[5] > 0:\n val = target[5]\n res += \"5\" * val\n for k in factorial[5].keys():\n target[k] -= factorial[5][k] * val\n\nif 3 in target and target[3] > 0:\n val = target[3]\n res += \"3\" * val\n for k in factorial[3].keys():\n target[k] -= factorial[3][k] * val\nif 2 in target: res += \"2\" * target[2] \nprint(res)", "n = int(input())\r\n\r\nc = list(input())\r\nd = []\r\n\r\ne = {'4': [2, 2, 3], '6': [3, 5], '8': [2, 2, 2, 7], '9': [2, 3, 3, 7]}\r\n\r\nfor i in c:\r\n if i != '0' and i != '1':\r\n if i not in e: d.append(i)\r\n else:\r\n for j in e[i]: d.append(str(j))\r\n\r\nd.sort(reverse=True)\r\nprint(''.join(d)) ", "n=int(input())\ns=input()\np=[0]*10\nfor u in s:\n\to=int(u)\n\tif o==2:\n\t\tp[2]+=1\n\tif o==3:\n\t\tp[3]+=1\n\tif o==4:\n\t\tp[2]+=2\n\t\tp[3]+=1\n\tif o==5:\n\t\tp[5]+=1\n\tif o==6:\n\t\tp[3]+=1\n\t\tp[5]+=1\n\tif o==7:\n\t\tp[7]+=1\n\tif o==8:\n\t\tp[2]+=3\n\t\tp[7]+=1\n\tif o==9:\n\t\tp[2]+=1\n\t\tp[3]+=2\n\t\tp[7]+=1\nprint(p[7]*\"7\"+p[5]*\"5\"+p[3]*\"3\"+p[2]*\"2\" )\n\t \t\t\t\t\t \t \t \t \t \t \t\t \t\t\t \t\t", "input()\ns=input()\na=\"\"\nt=[a,a,\"2\",\"3\",\"223\",\"5\",\"53\",\"7\",\"7222\",\"7332\"]\nfor c in s:\n a+=t[int(c)]\nprint(''.join(sorted(a)[::-1]))\n", "trans = {\"0\": \"\", \"1\": \"\", \"2\": \"2\", \"3\": \"3\", \"4\": \"322\",\n \"5\": \"5\", \"6\": \"53\", \"7\": \"7\", \"8\": \"7222\", \"9\": \"7332\"}\n\nn = int(input())\ns = input()\nres = \"\"\nfor x in s:\n res += trans[x]\nli = list(res)\nli.sort(reverse=True)\nans = \"\"\nfor x in li:\n ans += x\nprint(ans)\n", "input()\r\nc = [0] * 8\r\nfor d in map(int, input()):\r\n if d == 4:\r\n c[3] += 1\r\n c[2] += 2\r\n elif d == 6:\r\n c[5] += 1\r\n c[3] += 1\r\n elif d == 8:\r\n c[7] += 1\r\n c[2] += 3\r\n elif d == 9:\r\n c[7] += 1\r\n c[3] += 2\r\n c[2] += 1\r\n else:\r\n c[d] += 1\r\nfor d in range(7, 1, -1):\r\n print(str(d) * c[d], end='')", "n=int(input())\r\ninp=input()\r\nout=\"\"\r\ntable=[\"\", \"\", \"2\", \"3\", \"322\", \"5\", \"53\", \"7\", \"7222\", \"7332\"]\r\nfor i in inp:\r\n out+=table[int(i)]\r\nout=list(out)\r\nout.sort(reverse=True)\r\nprint(\"\".join(out))\r\n", "n=int(input())\r\na=list(input())\r\nx=[]\r\nfor i in range(n):\r\n a[i]=int(a[i])\r\nfor i in range(n):\r\n if a[i]<=3:\r\n x.append(a[i])\r\n else:\r\n if a[i]%2!=0 and a[i]<9:\r\n x.append(a[i])\r\n else:\r\n if a[i]==4:\r\n x.append(2)\r\n x.append(2)\r\n x.append(3)\r\n if a[i]==6:\r\n x.append(3)\r\n x.append(5)\r\n if a[i]==8:\r\n x.append(2)\r\n x.append(2)\r\n x.append(2)\r\n x.append(7)\r\n if a[i]==9:\r\n x.append(3)\r\n x.append(3)\r\n x.append(2)\r\n x.append(7)\r\n \r\nx.sort()\r\nans=0\r\nif 1 in x:\r\n while 1 in x:\r\n x.remove(1)\r\nif 0 in x:\r\n while 0 in x:\r\n x.remove(0)\r\nfor i in range(len(x)):\r\n ans+=x[i]*(10**(i))\r\nprint(ans)\r\n \r\n \r\n", "from collections import defaultdict\r\nn=int(input())\r\ns=input()\r\ncount=defaultdict(lambda:0)\r\nprimefact=defaultdict(lambda:[])\r\nprimefact[2]=[2]\r\nprimefact[3]=[3]\r\nprimefact[4]=[2,2]\r\nprimefact[5]=[5]\r\nprimefact[6]=[2,3]\r\nprimefact[7]=[7]\r\nprimefact[8]=[2,2,2]\r\nprimefact[9]=[3,3]\r\nfor i in s:\r\n for j in range(2,int(i)+1):\r\n for k in primefact[j]:\r\n count[k]+=1\r\nk=list(count.keys())\r\nk.sort(reverse=True)\r\nans=\"\"\r\nfor i in k:\r\n ans+=str(i)*count[i]\r\n for j in range(2,i):\r\n for k in primefact[j]:\r\n count[k]-=count[i]\r\n\r\nprint(ans)\r\n", "\r\nn = int(input())\r\nnum = input()\r\n\r\nrecord = dict()\r\nrecord[2] = 0\r\nrecord[3] = 0\r\nrecord[5] = 0\r\nrecord[7] = 0\r\n\r\nuse = [ 2, 3, 5, 7]\r\n\r\nfor i in range(0,n):\r\n t = int( num[i] )\r\n\r\n while t > 1:\r\n dummy = t\r\n \r\n for j in use:\r\n while dummy%j == 0:\r\n dummy /= j\r\n record[j] += 1\r\n\r\n t -= 1\r\n\r\nwhile record[7] > 0:\r\n print( 7, end = '')\r\n record[7] -= 1\r\n record[5] -= 1\r\n record[3] -= 2\r\n record[2] -= 4\r\n\r\nwhile record[5] > 0:\r\n print( 5, end = '')\r\n record[5] -= 1\r\n record[3] -= 1\r\n record[2] -= 3\r\n\r\nwhile record[3] > 0:\r\n print(3, end = '')\r\n record[3] -= 1\r\n record[2] -= 1\r\n\r\nwhile record[2] > 0:\r\n print(2, end = '')\r\n record[2] -= 1\r\n\r\n", "x = int (input ())\nL = input ()\ns = ''\nfor i in L :\n if i == '4' :\n L = L.replace (i, '322')\n elif i == '6' :\n L = L.replace (i, '53')\n elif i == '8' :\n L = L.replace (i, '7222')\n elif i == '9':\n L = L.replace (i, '7332')\nfor i in L :\n if i == '1' or i == '0' :\n continue\n else :\n s += i\ns = sorted (s, reverse=True)\nfor i in s :\n print (i, end='')", "#from itertools import *\r\n#from math import *\r\n#from bisect import *\r\n#from collections import *\r\n#from random import *\r\n#from decimal import *\r\n#from heapq import *\r\n#from itertools import * # Things Change ....remember :)\r\nimport sys\r\ninput=sys.stdin.readline\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 res=[]\r\n n=inp()\r\n s=st()\r\n for i in s:\r\n z=int(i)\r\n if(z in [1,0]):\r\n continue\r\n if(z in [2,3,5,7]):\r\n res.append(z)\r\n if(z==4):\r\n res.extend([2,2,3])\r\n if(z==6):\r\n res.extend([3,5])\r\n if(z==8):\r\n res.extend([2,2,2,7])\r\n if(z==9):\r\n res.extend([2,3,3,7])\r\n res.sort(reverse=True)\r\n for i in res:\r\n print(i,end='')\r\n", "list1=[\"\",\"\",\"2\",\"3\",\"322\",\"5\",\"53\",\"7\",\"7222\",\"7332\"]\r\nn=int(input())\r\np=input()\r\nk=[]\r\nfor i in p:\r\n k.append(list1[int(i)])\r\nprint(\"\".join(sorted(\"\".join(k),reverse=True)))", "n=int(input())\r\ns=input()\r\nl=[]\r\nfor i in s:\r\n if i=='0' or i=='1':\r\n continue\r\n elif i=='2':\r\n l.append('2')\r\n elif i=='3':\r\n l.append('3')\r\n elif i=='4':\r\n l.append('3')\r\n l.append('2')\r\n l.append('2')\r\n elif i=='5':\r\n l.append('5')\r\n elif i=='6':\r\n l.append('5')\r\n l.append('3')\r\n elif i=='7':\r\n l.append('7')\r\n elif i=='8':\r\n l.append('2')\r\n l.append('2')\r\n l.append('2')\r\n l.append('7')\r\n elif i=='9':\r\n l.append('7')\r\n l.append('3')\r\n l.append('3')\r\n l.append('2')\r\nans=\"\"\r\nl.sort(reverse=True)\r\nfor i in l:\r\n ans=ans+i\r\nprint(ans)", "def f_app(arr, number):\r\n if number == '2':\r\n arr.append('2')\r\n if number == '3':\r\n arr.append('3')\r\n if number == '4':\r\n arr.extend(['3','2','2'])\r\n if number == '5':\r\n arr.append('5')\r\n if number == '6':\r\n arr.extend(['5','3'])\r\n if number == '7':\r\n arr.append('7')\r\n if number == '8':\r\n arr.extend(['7','2','2','2'])\r\n if number == '9':\r\n arr.extend(['7','3','3','2'])\r\n return arr\r\n\r\ndef solve(s):\r\n arr = []\r\n for letter in s:\r\n arr = f_app(arr, letter)\r\n return ''.join(sorted(arr, reverse=True))\r\n\r\nn = int(input())\r\ns = input()\r\n\r\nprint(solve(s))", "numF={\r\n 0:[], 1:[], 2:[2], 3:[2,3], 4:[2,3,2,2],\r\n 5:[5], 6:[5,2,3], 7:[7], 8:[7,2,2,2], 9:[7,2,2,2,3,3]\r\n}\r\n\r\nn=int(input())\r\nNumStr=input()\r\nnumbs=[]\r\nfor str_ in NumStr:\r\n numbs+=numF[int(str_)]\r\n\r\nn7=numbs.count(7)\r\nn5=numbs.count(5)\r\nn3=numbs.count(3)\r\nn2=numbs.count(2)-n3\r\nprint('7'*n7+'5'*n5+'3'*n3+'2'*n2)", "l=[\"\",\"\",\"2\",\"3\",\"322\",\"5\",\"53\",\"7\",\"7222\",\"7332\"]\r\nn=int(input())\r\ns,k=input(),\"\"\r\nfor i in range(n):\r\n k+=l[int(s[i])]\r\nk=list(k)\r\nk.sort(reverse=True)\r\nprint(*k, sep=\"\")", "l=[\"\",\" \",\"2\",\"3\",\"322\",\"5\",\"53\",\"7\",\"7222\",\"7332\"]\r\ns=\"\"\r\nn=int(input())\r\nk=input()\r\nfor i in range(n):\r\n s=s+l[int(k[i])]\r\ns=list(s)\r\ns.sort(reverse=True)\r\nprint(*s,sep=\"\")", "\r\nn = input()\r\na = input()\r\n\r\nl = []\r\n\r\nfor i in a:\r\n if i == '2':\r\n l.append(2)\r\n elif i == '3':\r\n l.append(3)\r\n elif i == '4':\r\n l.append(3)\r\n l.append(2)\r\n l.append(2)\r\n elif i == '5':\r\n l.append(5)\r\n elif i == '6':\r\n l.append(3)\r\n l.append(5)\r\n elif i == '7':\r\n l.append(7)\r\n elif i == '8':\r\n l.append(2)\r\n l.append(2)\r\n l.append(2)\r\n l.append(7)\r\n elif i == '9':\r\n l.append(2)\r\n l.append(3)\r\n l.append(3)\r\n l.append(7)\r\n \r\nl.sort(reverse = True)\r\n\r\nfor j in l:\r\n print(j , end = '')", "def change(i, p, dig, a):\r\n for j in range(4):\r\n p[j] += a * dig[i][j]\r\n\r\n\r\ndig = {\r\n '0':(0, 0, 0, 0),\r\n '1':(0, 0, 0, 0),\r\n '2':(1, 0, 0, 0),\r\n '3':(1, 1, 0, 0),\r\n '4':(3, 1, 0, 0),\r\n '5':(3, 1, 1, 0),\r\n '6':(4, 2, 1, 0),\r\n '7':(4, 2, 1, 1),\r\n '8':(7, 2, 1, 1),\r\n '9':(7, 4, 1, 1),\r\n}\r\n\r\np = [0] * 4\r\ninput()\r\nfor i in input():\r\n change(i, p, dig, 1)\r\n\r\nans = ''\r\nprimes= '2357'\r\nfor i in range(4)[::-1]:\r\n ans += primes[i] * p[i]\r\n change(primes[i], p, dig, -p[i])\r\n\r\nprint(ans)", "import math\r\n\r\nn = int(input())\r\ns = str(int(input()))\r\nvls = []\r\nnos =''\r\nfor i in range(len(s)):\r\n if(s[i]=='2'):\r\n nos+='2'\r\n if(s[i]=='3'):\r\n nos+='3'\r\n if(s[i]=='4'):\r\n nos+='322'\r\n if(s[i]=='5'):\r\n nos+='5'\r\n if(s[i]=='6'):\r\n nos+='53'\r\n if(s[i]=='7'):\r\n nos+='7'\r\n if(s[i]=='8'):\r\n nos+='7222'\r\n elif(s[i]=='9'):\r\n nos+='7332'\r\nans = []\r\nfor i in range(len(nos)):\r\n ans.append(int(nos[i]))\r\nans= sorted(ans, reverse= True)\r\nsans = ''\r\nfor i in range(len(nos)):\r\n sans+=str(ans[i])\r\nprint(sans)", "n = int(input())\r\nnums = input()\r\ndigits = [0 for i in range(8)]\r\nfor char in nums:\r\n a = int(char)\r\n if a ==9:\r\n digits[7]+=1\r\n digits[3]+=2\r\n digits[2]+=1\r\n elif a == 8:\r\n digits[7]+=1\r\n digits[2]+=3\r\n elif a == 7:\r\n digits[7]+=1\r\n elif a == 6:\r\n digits[5]+=1\r\n digits[3]+=1\r\n elif a == 5:\r\n digits[5]+=1\r\n elif a == 4:\r\n digits[3]+=1\r\n digits[2]+=2\r\n elif a == 3:\r\n digits[3]+=1\r\n elif a == 2:\r\n digits[2]+=1\r\n\r\nans = \"\"\r\nfor i in range(7,1,-1):\r\n ans += str(i)*digits[i]\r\nprint(ans)\r\n", "from sys import stdin\r\ninp = stdin.readline\r\n\r\nn = int(inp().strip())\r\n\r\nnumber = [int(x) for x in str(inp().strip())]\r\n\r\nnumber.sort()\r\nmaxNumber = []\r\nfor i in number:\r\n if i == 4:\r\n maxNumber.extend([3,2,2])\r\n elif i == 6:\r\n maxNumber.extend([5, 3])\r\n elif i == 8:\r\n maxNumber.extend([7, 2,2,2])\r\n elif i == 9:\r\n maxNumber.extend([7,3,3,2])\r\n elif i <= 1:\r\n continue\r\n else:\r\n maxNumber.append(i)\r\nmaxNumber.sort(reverse=True)\r\nprint(''.join(map(str,maxNumber)))", "import math as mt\r\nfrom collections import defaultdict,deque\r\nimport sys\r\nfrom bisect import bisect_right as b_r\r\nfrom bisect import bisect_left as b_l\r\n\r\n\r\n\r\nmod=1000000007\r\nINT_MAX = sys.maxsize-1\r\nINT_MIN = -sys.maxsize\r\n\r\nans=[]\r\n# for _ in range(int(input())):\r\n# s=input()\r\n# n=int(input())\r\n# x,y=map(int,input().split())\r\n# a=list(map(int,input().split()))\r\nmy_dict={'0':[],\"1\":[],\"2\":[2],\"3\":[3],\"4\":[3,2,2],\"5\":[5],\"6\":[5,3],\"7\":[7],\"8\":[7,2,2,2],\"9\":[7,3,3,2]}\r\n\r\nn=int(input())\r\ns=list(input())\r\n\r\nfor i in range(n):\r\n ans.extend(my_dict[s[i]])\r\n\r\nprint(\"\".join(map(str,sorted(ans,reverse=True))))", "\r\nn = int(input())\r\nlis = input()\r\ncount = [0]*11\r\nfor i in range(len(lis)):\r\n for j in range(1,int(lis[i])+1):\r\n count[j] += 1\r\ncount[2] += count[4]*2+count[8]*3 + count[6]\r\ncount[3] += count[9]*2 + count[6]\r\ncount[4] = count[8] = count[6] = 0\r\n\r\nif count[7] != 0:\r\n count[2] -= 4*count[7]\r\n count[3] -= 2*count[7]\r\n count[5] -= count[7]\r\nif count[5] != 0:\r\n count[2] -= 3*count[5]\r\n count[3] -= count[5]\r\nif count[3] != 0:\r\n count[2] -= count[3]\r\n\r\nfor i in range(7,1,-1):\r\n for _ in range(count[i]):\r\n print(i,end=\"\")\r\nprint()", "\"\"\"\r\nCodeforces Contest 292 Div 1 Problem A\r\n\r\nAuthor : chaotic_iak\r\nLanguage: Python 3.4.2\r\n\"\"\"\r\n\r\n################################################### SOLUTION\r\n\r\ndef main():\r\n n, = read()\r\n a = read(0)\r\n digits = []\r\n for i in a:\r\n if i == \"0\" or i == \"1\": continue\r\n if i == \"2\": digits.append(2)\r\n if i == \"3\": digits.append(3)\r\n if i == \"4\": digits.extend([3,2,2])\r\n if i == \"5\": digits.append(5)\r\n if i == \"6\": digits.extend([5,3])\r\n if i == \"7\": digits.append(7)\r\n if i == \"8\": digits.extend([7,2,2,2])\r\n if i == \"9\": digits.extend([7,3,3,2])\r\n digits.sort(reverse=True)\r\n print(\"\".join(str(i) for i in digits))\r\n\r\n\r\n\t\r\n#################################################### HELPERS\r\n\r\n\r\n\r\ndef read(mode=2):\r\n # 0: String\r\n # 1: List of strings\r\n # 2: List of integers\r\n inputs = input().strip()\r\n if mode == 0: return inputs\r\n if mode == 1: return inputs.split()\r\n if mode == 2: return list(map(int, inputs.split()))\r\n\r\ndef write(s=\"\\n\"):\r\n if s is None: s = \"\"\r\n if isinstance(s, list): s = \" \".join(map(str, s))\r\n s = str(s)\r\n print(s, end=\"\")\r\n\r\nwrite(main())", "def factorize(n):\r\n divs = []\r\n div = 2\r\n while n != 1:\r\n if n % div == 0:\r\n n //= div\r\n divs.append(div)\r\n else:\r\n div += 1\r\n return divs\r\n\r\n\r\nn = int(input())\r\nnum = input()\r\nend_num = ''\r\nf = []\r\n\r\nfor i in num:\r\n if i not in {'0', '1'}:\r\n for j in range(2, int(i) + 1):\r\n f += factorize(j)\r\n\r\nf = sorted(f)[::-1]\r\nwhile len(f) > 0:\r\n elem = f[0]\r\n for j in range(2, elem + 1):\r\n for k in factorize(j):\r\n f.pop(f.index(k))\r\n end_num += str(elem)\r\n\r\nprint(end_num)", "n = int(input())\r\na = input()\r\n\r\nc = [0 for i in range(10)]\r\nfor x in a:\r\n for f in range(2, int(x)+1):\r\n c[f] += 1\r\n\r\nsol = \"\"\r\nc[3] += 2*c[9]\r\n#c[2] += 3*c[9]\r\nc[2] += 3*c[8]\r\nsol += \"7\" * c[7]\r\nfor i in range(2, 8):\r\n c[i] -= c[7]\r\nc[2] += c[6]\r\nc[3] += c[6]\r\nsol += \"5\" * c[5]\r\nfor i in range(2, 6):\r\n c[i] -= c[5]\r\nc[2] += 2*c[4]\r\nsol += \"3\" * c[3]\r\nfor i in range(2, 4):\r\n c[i] -= c[3]\r\nsol += \"2\" * c[2]\r\n\r\nprint(sol)\r\n", "def f(n):\r\n if n<=1:\r\n return []\r\n elif n in [2,3,5,7]:\r\n return [n]\r\n elif n==4:\r\n return [2,2,3]\r\n elif n==6:\r\n return [3,5]\r\n elif n==8:\r\n return [2,2,2,7]\r\n else:\r\n return [2,3,3,7]\r\nn=int(input())\r\ns=input()\r\ninit=[]\r\nfor item in s:\r\n init+=f(int(item))\r\ninit.sort()\r\ninit.reverse()\r\nans=\"\"\r\nfor item in init:\r\n ans+=str(item)\r\nprint(int(ans))", "n=int(input())\r\ns=input()\r\ndata=[\"\",\"\",2,3,322,5,53,7,7222,7332]\r\noutput=\"\"\r\nfor i in range(n):\r\n output+=str(data[int(s[i])])\r\noutput=list(output)\r\noutput.sort(reverse=True)\r\nprint(\"\".join(output))", "def fact(x):\r\n ans = 1\r\n for i in range(2, x):\r\n ans *= i\r\n return ans\r\n\r\nn = int(input())\r\na = list(map(int, list(input())))\r\nans = []\r\nfor i in range(n):\r\n if a[i] == 4:\r\n ans += [3, 2, 2]\r\n elif a[i] == 6:\r\n ans += [5, 3]\r\n elif a[i] == 8:\r\n ans += [7, 2, 2, 2]\r\n elif a[i] == 9:\r\n ans += [7, 3, 3, 2]\r\n elif a[i] not in [0, 1]:\r\n ans += [a[i]]\r\nans.sort(reverse=True)\r\nprint(\"\".join(list(map(str, ans))))", "n = int(input())\r\nx = input()\r\nx = x.replace('0','')\r\nx = x.replace('1', '')\r\nx = x.replace('4', '322')\r\nx = x.replace('6', '35')\r\nx = x.replace('8', '2227')\r\nx = x.replace('9', '3327')\r\nprint(''.join(sorted(x)[::-1]))", "from math import log2\r\n# from queue import Queue\r\n# from math import inf\r\n# from collections import deque\r\n# from collections import Counter\r\n# n,k,m=map(int,input().split())\r\n# for _ in range(int(input())):\r\n # n,m=map(int,input().split())\r\nn=int(input())\r\ns=input()\r\nd={'0':[],'1':[],'2':['2'],'3':['3'],'4':['3','2','2'],'5':['5'],'6':['5','3'],'7':['7'],'8':['7','2','2','2'],'9':['7','2','3','3']}\r\nans=[]\r\nfor i in range(n):\r\n ans.extend(d[s[i]])\r\nans.sort()\r\nans.reverse()\r\nprint(''.join(ans))\r\n ", "from collections import defaultdict\nn = int(input())\na = int(input())\narr = []\nwhile a:\n d = a % 10\n if d in {2, 3, 5, 7}:\n arr.append(d)\n elif d == 4:\n arr.extend([2, 2, 3])\n elif d == 6:\n arr.extend([3, 5])\n elif d == 8:\n arr.extend([2, 2, 2, 7])\n elif d == 9:\n arr.extend([2, 3, 3, 7])\n a //= 10\nprint(''.join(str(x) for x in sorted(arr, reverse=True)))\n", "n=int(input())\r\na=list(map(int,list(input())))\r\n\r\nd={}\r\n\r\nfor i in range(1,10):\r\n d[i]=0\r\n\r\nfor i in range(len(a)):\r\n \r\n val=a[i]\r\n \r\n if(val==2):\r\n d[2]+=1\r\n elif(val==3):\r\n d[3]+=1\r\n \r\n elif(val==4):\r\n d[2]+=2\r\n d[3]+=1\r\n elif(val==5):\r\n d[5]+=1\r\n \r\n elif(val==6):\r\n d[5]+=1\r\n d[3]+=1\r\n elif(val==7):\r\n d[7]+=1\r\n elif(val==8):\r\n d[7]+=1\r\n d[2]+=3\r\n elif(val==9):\r\n d[2]+=1\r\n d[3]+=2\r\n d[7]+=1\r\nres=''\r\nfor i in range(9,1,-1):\r\n while(d[i]):\r\n res+=str(i)\r\n d[i]-=1\r\nprint(int(res))\r\n ", "import sys\r\ninput =sys.stdin.readline\r\nx = int(input())\r\ny =int(input())\r\ny = str(y)\r\nli = [0]*10\r\nli[2] = [2]\r\nli[3] = [3]\r\nli[4] = [3, 2, 2]\r\nli[5] = [5]\r\nli[6 ] = [5, 3]\r\nli[7] = [7]\r\nli[8] = [7, 2, 2, 2]\r\nli[9] = [7, 3, 3, 2]\r\nli1 = []\r\nfor i in y:\r\n\tif i=='0'or i== '1':\r\n\t\tpass\r\n\telse:\r\n\t\ti = int(i)\r\n\t\tfor j in li[i]:\r\n\t\t\tli1.append(j)\r\nli1.sort(reverse= True)\r\nstr1= ''\r\nfor i in li1:\r\n\tstr1 += str(i)\r\nprint(str1)\r\n", "n=int(input())\r\na=input();\r\nl=[]\r\ndict={'1':'','0':'','2':'2','3':'3','4':'322','5':'5','6':'53','7':'7','8':'7222','9':'7332'}\r\nfor i in range(len(a)):\r\n l.append(dict[a[i]]);\r\ns=''.join(l)\r\nk=[]\r\nfor i in s:\r\n k.append((i))\r\nk.sort(reverse=True)\r\nprint(''.join(k))", "def fact(n):\r\n if n==0:\r\n return 1\r\n return n*fact(n-1)\r\nx=int(input())\r\nn=input()\r\ns=1\r\nfor i in n:\r\n s*=fact(int(i))\r\nd={2:0,3:0,5:0,7:0}\r\nfor i in [2,3,5,7]:\r\n while s%i==0:\r\n d[i]+=1\r\n s=s//i\r\nv=\"\"\r\nv+=str(7)*d[7]\r\nd[5]-=d[7]\r\nd[3]-=2*d[7]\r\nd[2]-=4*d[7]\r\nv+=str(5)*d[5]\r\nd[3]-=d[5]\r\nd[2]-=3*d[5]\r\nv+=str(3)*d[3]\r\nd[2]-=d[3]\r\nv+=str(2)*d[2]\r\nprint(v)", "def f(n):\r\n p = []\r\n i = 2\r\n while i ** 2 <= n:\r\n while n % i == 0:\r\n p.append(i)\r\n n //= i\r\n i += 1\r\n if n > 1:\r\n p.append(n)\r\n return p\r\n\r\nn = int(input())\r\ns = input()\r\nx = [1, 1]\r\nfor i in range(2, 10):\r\n x.append(x[-1] * i)\r\nk = []\r\nfor i in s:\r\n k.extend(f(x[int(i)]))\r\nk.sort(reverse=True)\r\nfor i in range(k.count(7)):\r\n del k[k.index(5)]\r\n for j in range(2):\r\n del k[k.index(3)]\r\n for j in range(4):\r\n del k[k.index(2)]\r\nfor i in range(k.count(5)):\r\n del k[k.index(3)]\r\n for j in range(3):\r\n del k[k.index(2)]\r\nfor i in range(k.count(3)):\r\n del k[k.index(2)]\r\nfor i in k:\r\n print(i, end='')", "all_premiers_numbers = [2, 3, 5, 7]\r\n\r\n# function that returns the decomposition of a number with its factorial\r\ndef decompose_number(number):\r\n if(number in all_premiers_numbers):\r\n return [number]\r\n elif number == 4:\r\n return [3, 2, 2]\r\n elif number == 6:\r\n return [3, 5]\r\n elif number == 8:\r\n return [2, 2, 2, 7]\r\n else:\r\n return [3, 3, 2, 7]\r\n\r\ndef main():\r\n n = int(input())\r\n a = int(input())\r\n my_list = []\r\n for chiffre in str(a):\r\n if((int(chiffre) != 1) and (int(chiffre) != 0)):\r\n my_list += decompose_number(int(chiffre))\r\n\r\n my_list.sort()\r\n my_list.reverse()\r\n final_result = \"\"\r\n if(my_list == []):\r\n print(a)\r\n else:\r\n for number in my_list:\r\n final_result += str(number)\r\n print(final_result)\r\n\r\n\r\nmain()", "from os import path\r\nfrom sys import stdin, stdout\r\n\r\nfilename = \"../templates/input.txt\"\r\nif path.exists(filename):\r\n stdin = open(filename, 'r')\r\n\r\n\r\ndef input():\r\n return stdin.readline().rstrip()\r\n\r\n\r\ndef print(*args, sep=' ', end='\\n'):\r\n stdout.write(sep.join(map(str, args)))\r\n stdout.write(end)\r\n\r\n\r\ndef solution():\r\n d = {\r\n '0': '',\r\n '1': '',\r\n '2': '2',\r\n '3': '3',\r\n '4': '322',\r\n '5': '5',\r\n '6': '53',\r\n '7': '7',\r\n '8': '7222',\r\n '9': '7332'\r\n }\r\n n = int(input())\r\n s = input()\r\n ans = []\r\n for c in s:\r\n ans.extend(list(d[c]))\r\n print(''.join(sorted(ans, reverse=True)))\r\n\r\n\r\ndef main():\r\n t = 1\r\n while t:\r\n solution()\r\n t -= 1\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n = int(input())\na = input()\nq = [0] * 10\nfor d in map(int, a):\n\tfor f in range(2, d + 1):\n\t\tif f in (4, 6, 8, 9):\n\t\t\tif f == 4:\n\t\t\t\tq[2] += 2\n\t\t\telif f == 6:\n\t\t\t\tq[2] += 1\n\t\t\t\tq[3] += 1\n\t\t\telif f == 8:\n\t\t\t\tq[2] += 3\n\t\t\telif f == 9:\n\t\t\t\tq[3] += 2\n\t\telif f not in (0, 1):\n\t\t\tq[f] += 1\nans = []\nfor i in range(9, 1, -1):\n\tfor j in range(q[i]):\n\t\tans.append(i)\n\t\tfor k in range(i + 1):\n\t\t\tif k in (4, 6, 8, 9):\n\t\t\t\tif k == 4:\n\t\t\t\t\tq[2] -= 2\n\t\t\t\telif k == 6:\n\t\t\t\t\tq[2] -= 1\n\t\t\t\t\tq[3] -= 1\n\t\t\t\telif k == 8:\n\t\t\t\t\tq[2] -= 3\n\t\t\t\telif k == 9:\n\t\t\t\t\tq[3] -= 3\n\t\t\telse:\n\t\t\t\tq[k] -= 1\nans.sort(reverse=True)\nprint(''.join(map(str, ans)))\n\n", "t=int(input())\nn=list(input())\nn=[int(i) for i in n]\na=[]\nfor i in n:\n if i==2:a.append(2)\n elif i==3:a.append(3)\n elif i==4:\n a.append(3)\n a.append(2)\n a.append(2)\n elif i==5:a.append(5)\n elif i==6:\n a.append(5)\n a.append(3)\n elif i==7:a.append(7)\n elif i==8:\n a.append(7)\n a.append(2)\n a.append(2)\n a.append(2)\n elif i==9:\n a.append(7)\n a.append(3)\n a.append(3)\n a.append(2)\na.sort(key=lambda x:-x)\na=[str(i) for i in a]\nprint(\"\".join(a))\n", "l = [[],[],['2'],['3'],['2','2','3'],['5'],['3','5'],['7'],['2','2','2','7'],['7','3','3','2']]\r\n\r\na = list()\r\ninput()\r\ninp = input()\r\nfor x in inp:\r\n a += l[int(x)]\r\na.sort(reverse = True)\r\nprint(''.join(a))\r\n", "n = int(input())\r\nx = list(map(int, input()))\r\nans = ''\r\nk = {4: '223', 6: '35', 8: '7222', 9: '7332', 2: '2', 3: '3', 5: '5', 7: '7'}\r\nfor i in x:\r\n try:\r\n ans += k[i]\r\n except:\r\n continue\r\n\r\nans = sorted(ans, reverse=True)\r\nprint(''.join(ans))\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon May 4 22:51:50 2020\r\n\r\n@author: Bilel Kanoun\r\n\"\"\"\r\n\r\ndef Transfrom(s):\r\n if (s=='0' or s=='1'):\r\n out=\"\"\r\n elif (s=='4'):\r\n out=\"322\"\r\n elif (s=='6'):\r\n out=\"53\"\r\n elif (s=='8'):\r\n out=\"7222\"\r\n elif (s=='9'):\r\n out=\"7332\"\r\n else:\r\n out=s\r\n \r\n return out\r\n\r\nif __name__=='__main__':\r\n n = int(input())\r\n a=input()\r\n \r\n res=\"\"\r\n for i in range(n):\r\n res+=Transfrom(a[i])\r\n\r\nprint(\"\".join(sorted(res)[::-1]))", "factors = {\r\n 0: [],\r\n 1: [],\r\n 2: [2],\r\n 3: [3],\r\n 4: [2, 2, 3],\r\n 5: [5],\r\n 6: [5, 3],\r\n 7: [7],\r\n 8: [7, 2, 2, 2],\r\n 9: [7, 3, 3, 2],\r\n}\r\n\r\nn = int(input())\r\ns = input()\r\n\r\narr = []\r\n\r\nfor i in s:\r\n arr.extend(factors[int(i)])\r\n\r\nprint(\"\".join(map(str, sorted(arr, reverse=True))))\r\n", "dic = {\r\n \"0\": \"\",\r\n \"1\": \"\",\r\n \"4\": \"322\",\r\n \"6\": \"35\",\r\n \"8\": \"2227\",\r\n \"9\": \"3327\",\r\n}\r\n\r\ninput()\r\nx = input()\r\n\r\nfor a in dic:\r\n x = x.replace(a, dic[a])\r\n\r\nprint(''.join(sorted(x, reverse=True)))\r\n" ]

[ "a, b, c = [int(c) for c in input().split()]\n\n\nif ((b - c + a) % 2 == 1) or ((b - c + a) < 0) or ((b + c - a) < 0) or (((-b) + c + a) < 0):\n print(\"Impossible\")\nelse:\n x = (b - c + a) // 2\n y = (b + c - a) // 2\n z = ((-b) + c + a) // 2\n print(f\"{x} {y} {z}\")\n\n\t \t \t\t \t\t\t\t \t \t\t\t \t \t", "a, b, c = map(int, input().split())\r\nl = [[a, 1, 0], [b, 2, 0], [c, 3, 0]]\r\nl = sorted(l, key=lambda x:x[0])\r\nif l[2][0] > l[1][0] + l[0][0]:\r\n print(\"Impossible\")\r\nelif (l[0][0] + l[1][0] + l[2][0])%2 != 0:\r\n print(\"Impossible\")\r\nelif l[0][0] == l[2][0]:\r\n print(l[0][0] // 2, l[0][0] // 2, l[0][0] // 2)\r\nelse:\r\n for i in range(0, a + 1):\r\n x = b - i\r\n if x < 0:\r\n continue\r\n y = c - x\r\n if y < 0:\r\n continue\r\n z = a - i - y\r\n if z == 0:\r\n print(i, x, y)\r\n break\r\n else:\r\n print(\"Impossible\")", "def main():\r\n a, b, c = map(int, input().split())\r\n if (a + b + c) % 2 != 0:\r\n return print(\"Impossible\")\r\n x = (a + b - c) // 2\r\n y = (b + c - a) // 2\r\n z = (a - b + c) // 2\r\n if x < 0 or y < 0 or z < 0:\r\n return print(\"Impossible\")\r\n print(x, y, z)\r\n\r\n\r\nmain()\r\n", "a, b, c = [int(x) for x in input().split(' ')]\n\n\ndef main(a, b, c):\n x3_2 = a - b + c\n if x3_2 % 2 == 1:\n return \"Impossible\"\n x3 = x3_2 // 2\n x2 = c - x3\n x1 = b - x2\n if min(x1, x2, x3) < 0:\n return \"Impossible\"\n if len([x for x in [x1, x2, x3] if x == 0]) > 1:\n return \"Impossible\"\n return f\"{x1} {x2} {x3}\"\nprint(main(a,b,c))\n \n\t\t \t\t \t\t\t\t\t \t\t \t \t \t\t", "a, b, c = map(int, input().split())\r\n\r\nif (a-b+c)%2 != 0 or (a-b+c)<0:\r\n print(\"Impossible\")\r\nelif (a+b-c)%2 != 0 or (a+b-c)<0:\r\n print(\"Impossible\")\r\nelif (b+c-a)%2 != 0 or (b+c-a)<0:\r\n print(\"Impossible\")\r\nelse:\r\n print((a+b-c)//2,(b+c-a)//2,(a-b+c)//2)\r\n \r\n" ]

[ "from sys import stdin, stdout\r\nfrom collections import defaultdict\r\n\r\ntime = 0\r\nc = 2*10**5\r\nn = 4*10**5+2\r\ncol = 0\r\n\r\nfinished= [0]*n\r\nfor_node = [0]*n\r\n\r\nf_range=range\r\nf_len=len\r\n\r\ndef dfs_euler_tour(node: int, graph):\r\n\r\n stack = []\r\n global colour\r\n global col\r\n global time\r\n\r\n stack.append((node, -1))\r\n while stack:\r\n s, ind = stack.pop()\r\n if ind > -1:\r\n if ind < f_len(colour):\r\n colour[ind] = col\r\n col = col ^ 1\r\n\r\n index = for_node[s]\r\n while(index < f_len(graph[s])):\r\n v,i=graph[s][index]\r\n if not visited[i]:\r\n stack.append((v, i))\r\n visited[i] = True\r\n index += 1\r\n for_node[s] = index\r\n break\r\n index += 1\r\n finished[s]+1\r\n\r\nm = int(stdin.readline())\r\ngraph =defaultdict(list)\r\nedges=[]\r\ndebug=[]\r\nfor i in f_range(m):\r\n u, v = stdin.readline().split()\r\n u, v = (int(u)-1, int(v)-1 + c+1)\r\n edges.append((u, v))\r\n graph[u].append((v, i))\r\n graph[v].append((u, i))\r\n if u == 30630-1 and m == 199809:\r\n debug.append(i)\r\ncolour = [-1]*m\r\n\r\nodds= [i for i in graph.keys() if f_len(graph[i]) % 2]\r\n\r\nif odds:\r\n for i in f_range(f_len(odds)):\r\n u = odds[i]\r\n ind=f_len(edges)\r\n if u<c:\r\n v = n-1\r\n else:\r\n v = c\r\n edges.append((u, v))\r\n graph[u].append((v, ind))\r\n graph[v].append((u, ind))\r\n \r\n if f_len(graph[n-1]) % 2:\r\n u=n-1\r\n v=c\r\n ind = f_len(edges)\r\n edges.append((u, v))\r\n graph[u].append((v, ind))\r\n graph[v].append((u, ind))\r\n\r\nvisited = [False]*f_len(edges)\r\n\r\nfor i in graph.keys():\r\n if not finished[i]:\r\n dfs_euler_tour(i, graph)\r\n\r\nsol = ''.join(['b' if i == 1 else 'r' for i in colour])\r\nsol += '\\n'\r\nstdout.write(sol)" ]

[ "from sys import stdin\r\nfrom bisect import *\r\n\r\nrint = lambda: int(stdin.readline())\r\nrint_2d = lambda n: [rint() for _ in range(n)]\r\nn = int(input())\r\na, mem, out = rint_2d(n), [0] * (n + 1), []\r\n\r\nfor i in range(n):\r\n vals = [mem[i] + 20]\r\n ix1 = max(bisect_left(a, a[i] - 90 + 1), 0)\r\n vals.append(mem[ix1] + 50)\r\n ix2 = max(bisect_left(a, a[i] - 1440 + 1), 0)\r\n vals.append(mem[ix2] + 120)\r\n mem[i + 1] = min(vals)\r\n out.append(mem[i + 1] - mem[i])\r\n\r\nprint('\\n'.join(map(str, out)))\r\n", "n = int(input())\r\n\r\ntimes = []\r\nfirst_90 = 0\r\nfirst_1440 = 0\r\nsum_90 = 0\r\nsum_1440 = 0\r\nvalues = []\r\n\r\nfor i in range(n):\r\n\ttimes.append(int(input()))\r\n\r\n\twhile (times[first_90] <= times[-1] - 90):\r\n\t\tsum_90 -= values[first_90]\r\n\t\tfirst_90 += 1\r\n\twhile (times[first_1440] <= times[-1] - 1440):\r\n\t\tsum_1440 -= values[first_1440]\r\n\t\tfirst_1440 += 1\r\n\r\n\tvalues.append(min([20, 50 - sum_90, 120 - sum_1440]))\r\n\tsum_90 += values[-1]\r\n\tsum_1440 += values[-1]\r\n\r\nprint(*values, sep='\\n')\r\n", "n = int(input())\r\n\r\ntrip_1, trip_2 = 0, 0\r\n\r\ntime = []\r\nf = [0] * (n+1)\r\nfor i in range(n):\r\n time.append(int(input()))\r\n\r\n while time[i] - time[trip_1] >= 90:\r\n trip_1 +=1\r\n while time[i] - time[trip_2] >= 1440:\r\n trip_2 += 1\r\n f[i+1] = min(min(f[trip_1] + 50, f[trip_2] + 120), f[i] + 20)\r\n print(f[i+1] - f[i])", "def main():\n\tN = int(input())\n\tS = [0]\n\tT = [0]\n\tkh = 0\n\tkd = 0\n\tfor n in range(1, N+1):\n\t\tT.append(int(input()))\n\t\tfor i in range(kh + 1, n):\n\t\t\t#print(T[n], T[i])\n\t\t\tif T[n] - T[i] < 90:\n\t\t\t\tkh = i - 1\n\t\t\t\tbreak\n\t\t\telse:\n\t\t\t\tkh = i\n\t\tfor i in range(kd + 1, n):\n\t\t\tif T[n] - T[i] < 1440:\n\t\t\t\tkd = i - 1\n\t\t\t\tbreak\n\t\t\telse:\n\t\t\t\tkd = i\n\t\t#print(n, kh, kd)\n\t\t#print(20, S[n - 1], 50, S[kh], 120, S[kd])\n\t\tS.append(min(20 + S[n - 1], 50 + S[kh], 120 + S[kd]))\n\t\t#print(T)\n\t\t#print(S)\n\t\tprint(S[n] - S[n - 1])\n\nmain()\n\n# 1509134058412\n", "import math\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return (int(input()))\r\n\r\n\r\ndef inlt():\r\n return (list(map(int, input().split())))\r\n\r\n\r\ndef insr():\r\n s = input()\r\n return (list(s[:len(s) - 1]))\r\n\r\n\r\ndef invr():\r\n return (map(int, input().split()))\r\n\r\n\r\ndef find_previous_trip(cur, trips, time_range):\r\n res = -1\r\n l = 0\r\n r = cur - 1\r\n while r - l >= 0:\r\n mid = (r + l) // 2\r\n if trips[mid] + time_range - 1 >= trips[cur]:\r\n res = mid\r\n r = mid - 1\r\n else:\r\n l = mid + 1\r\n return res\r\n\r\n\r\nn = inp()\r\n\r\nl = []\r\nfor _ in range(n):\r\n l.append(inp())\r\n\r\ndp = [math.inf] * (n + 1)\r\ndp[0] = 0\r\nfor i in range(1, n + 1):\r\n dp[i] = min(dp[i], dp[i - 1] + 20)\r\n pre_90 = find_previous_trip(i - 1, l, 90)\r\n if pre_90 != -1:\r\n dp[i] = min(dp[i], dp[pre_90] + 50)\r\n\r\n pre_1440 = find_previous_trip(i - 1, l, 1440)\r\n if pre_1440 != -1:\r\n dp[i] = min(dp[i], dp[pre_1440] + 120)\r\nfor i in range(1, n + 1):\r\n print(dp[i] - dp[i - 1])\r\n\r\n", "# https://codeforces.com/contest/756/problem/B\r\n\r\nn = int(input()) # Number of trips by passenger\r\nt = []\r\nfor _ in range(n):\r\n t.append(int(input())) # Time of each trip, relative to starting the system\r\n\r\n\"\"\"\r\nRules\r\n\r\nA ticket of one trip costs 20 rubles\r\nA ticket for 90 minutes costs 50 rubles\r\nA ticket for one day (1440 minutes) costs 120 rubles\r\n\r\nThe system takes all trips and chooses the set of tickets with minimum total cost.\r\n\r\nSolution returns the minimum payment at each stage\r\n\"\"\"\r\n\r\nstart_90_min = 0\r\nstart_one_day = 0\r\ndp = [0] # Minimum payment at each stage\r\nfor i, trip in enumerate(t):\r\n # Increment up current range of 90 minutes and one day trip by comparing the current element to the earliest possible element this trip could encompass\r\n while trip - t[start_90_min] >= 90:\r\n start_90_min += 1\r\n while trip - t[start_one_day] >= 1440:\r\n start_one_day += 1\r\n\r\n # For current stage, add minimum payment of the three options\r\n dp.append(min(dp[i] + 20, dp[start_90_min] + 50, dp[start_one_day] + 120))\r\n print(dp[-1] - dp[-2])", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Apr 10 14:44:23 2021\r\n\r\nB. Travel Card\r\n\r\ntime limit per test: 2 seconds\r\nmemory limit per test: 256 megabytes\r\ninput = standard input\r\noutput = standard output\r\n\r\n@author: berti_m\r\n\"\"\"\r\nn=int(input())\r\ndp=[0]\r\nvrijeme=[0]\r\nx, y = 1, 1\r\nfor i in range (n):\r\n put=int(input())\r\n vrijeme.append(put)\r\n while put-vrijeme[x]>89:\r\n x+=1\r\n while put-vrijeme[y]>1439:\r\n y+=1\r\n sol = min(dp[-1]+20, dp[x-1]+50, dp[y-1]+120)\r\n dp.append(sol)\r\nfor w in range(1,n+1):\r\n print(dp[w]-dp[w-1])\r\n", "n=int(input())\r\nex1=0\r\nex2=0\r\nL=[]\r\nf=[0]*(n+1)\r\nfor i in range(n):\r\n L.append(int(input()))\r\n while (L[i] - L[ex1 ] >= 90):\r\n ex1+=1\r\n while (L[i] - L[ex2 ] >= 1440):\r\n ex2+=1\r\n f[i+1] = min(min(f[ex1] + 50, f[ex2] + 120), f[i] + 20)\r\n print(f[i+1] - f[i])\r\n", "\r\nn = int(input())\r\na = [0,]\r\nfor i in range(n):\r\n\tx = int(input())\r\n\ta.append(x)\r\n\r\ndp = [0] * (n + 1)\r\ndp[0] = 0\r\np90 = 1\r\np1440 = 1\r\nfor i in range(1, n + 1):\r\n\tdp[i] = dp[i - 1] + 20\r\n\twhile a[p90] + 90 <= a[i]:\r\n\t\tp90 = p90 + 1\r\n\tdp[i] = min(dp[i], dp[p90 - 1] + 50)\r\n\twhile a[p1440] + 1440 <= a[i]:\r\n\t\tp1440 = p1440 + 1\r\n\tdp[i] = min(dp[i], dp[p1440 - 1] + 120)\r\nfor i in range(1, n + 1):\r\n\tprint(dp[i] - dp[i - 1])", "n=int(input())\r\nb1,b2=0,0\r\nl=[]\r\nf=[0]*(n+1)\r\nfor i in range(n):\r\n t=int(input())\r\n l.append(t)\r\n while l[i]-l[b1]>=90:\r\n b1+=1\r\n while l[i]-l[b2]>=1440:\r\n b2+=1\r\n f[i+1]=min(f[b1]+50,f[b2]+120,f[i]+20)\r\n print(f[i+1]-f[i])", "def lower_bound(arr, left, right, target):\n if arr[right]<target:\n return right+1\n while left < right:\n mid = (left + right) >> 1\n if arr[mid] >= target:\n right = mid\n else:\n left = mid + 1\n return left\n\nT = int(input())\narr = [0] * T\ndp = [0] * (T + 1)\nfor i in range(T):\n arr[i] = int(input())\nfor i in range(T):\n dp[i + 1] = dp[i] + 20\n dp[i + 1] = min(dp[i + 1], dp[lower_bound(arr, 0, T-1, arr[i] - 89)] + 50)\n dp[i + 1] = min(dp[i + 1], dp[lower_bound(arr, 0, T-1, arr[i] - 1439)] + 120)\n print(dp[i + 1] - dp[i])", "n = int(input())\r\ntime = []\r\nfor i in range(n):\r\n time.append(int(input()))\r\nptr90 = 0\r\nptrs = 0\r\ndp = [0] * n\r\ndp[0] = 20\r\nprint(20)\r\nfor i in range(1, n):\r\n s1 = dp[i - 1] + 20\r\n if time[i] <= 89 + time[ptr90]:\r\n if ptr90 == 0:\r\n s2 = 50\r\n else:\r\n s2 = dp[ptr90 - 1] + 50\r\n else:\r\n while time[ptr90] + 89 < time[i]:\r\n ptr90 += 1\r\n s2 = dp[ptr90 - 1] + 50\r\n if time[i] <= 1439 + time[ptrs]:\r\n if ptrs == 0:\r\n s3 = 120\r\n else:\r\n s3 = dp[ptrs - 1] + 120\r\n else:\r\n while time[ptrs] + 1439 < time[i]:\r\n ptrs += 1\r\n s3 = dp[ptrs - 1] + 120\r\n dp[i] = min(s1, s2, s3)\r\n print(dp[i] - dp[i - 1])", "l,p=[],[]\r\np.append(0)\r\nx,y=0,0\r\nfor i in range(int(input())):\r\n\tl.append(int(input()))\r\n\twhile True:\r\n\t\tif l[i]-l[x]<90:\r\n\t\t\tbreak\r\n\t\tx+=1\r\n\twhile True:\r\n\t\tif l[i]-l[y]<1440:\r\n\t\t\tbreak\r\n\t\ty+=1\r\n\tp.append(min(p[-1]+20,p[x]+50,p[y]+120))\r\n\tprint(p[-1]-p[-2])", "import math\r\nimport sys\r\nfrom bisect import bisect_right, bisect_left, insort_right\r\nfrom collections import Counter, defaultdict\r\nfrom heapq import heappop, heappush\r\nfrom itertools import accumulate, permutations, combinations\r\nfrom sys import stdout\r\n\r\nR = lambda: map(int, input().split())\r\nn = int(input())\r\narr = []\r\nfor _ in range(n):\r\n arr.append(int(input()))\r\ncst = [math.inf] * n + [0]\r\nfor i in range(n):\r\n cst[i] = min(cst[i - 1] + 20, cst[bisect_left(arr, arr[i] - 89) - 1] + 50, cst[bisect_left(arr, arr[i] - 1439) - 1] + 120)\r\nfor i in range(n):\r\n print(cst[i] - cst[i - 1])", "import sys\r\ndef bs (l,r,val):\r\n l1= l\r\n r1= r\r\n while (l1<= r1):\r\n mid = (l1 + r1)//2\r\n if t[mid] >= val :\r\n res = mid\r\n r1 = mid -1\r\n elif t[mid] < val :\r\n l1 = mid +1\r\n return res\r\nt= []\r\nn = int (sys.stdin.readline())\r\n\r\nfor i in range (n):\r\n temp = int(sys.stdin.readline())\r\n t.append(temp)\r\n\r\nsum= [0 for i in range (n)]\r\n\r\nfor i in range (n):\r\n nine_ty = bs(0,i,t[i]-90+1)\r\n if nine_ty > 0 :\r\n temp = min (20 ,max(50- (sum[i-1]- sum[nine_ty-1]),0))\r\n else:\r\n temp = min (20, 50 - sum[max(i-1,0)])\r\n a_day =bs(0,i,t[i]-1440+1)\r\n if a_day > 0:\r\n temp = min(temp, max(120 - (sum[i - 1] - sum[a_day - 1]), 0))\r\n else: temp = min(temp, 120 - sum[max(i-1,0)])\r\n\r\n print (temp)\r\n sum [i] = sum[max(i-1,0)] + temp", "from bisect import *\r\na=[]\r\nn=int(input())\r\ndp=[0]*(n+1)\r\nfor i in range(1,n+1):\r\n x=int(input())\r\n a.append(x)\r\n val=x-90\r\n pos1=bisect_right(a,val)\r\n val=x-1440\r\n pos2=bisect_right(a,val)\r\n dp[i]=min(dp[pos1]+50,dp[i-1]+20,dp[pos2]+120)\r\n print(dp[i]-dp[i-1])", "import sys\nimport bisect\ninput = sys.stdin.readline\n\ntrips = int(input())\ndyn = [int(input()) for i in range(trips)]\n\ncmap = [0,20] + [0 for i in range(trips-1)]\n\nfor i in range(2,trips+1):\n cmap[i] = min(cmap[i-1] + 20,\n cmap[bisect.bisect_left(dyn,dyn[i-1]-89)] + 50,\n cmap[bisect.bisect_left(dyn,dyn[i-1]-1439)] + 120)\n\nfor i in range(1,trips+1):\n print(cmap[i]-cmap[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", "# Code by B3D\r\n# Love\r\n\r\nfrom math import *\r\nfrom collections import *\r\nimport io, os\r\nimport sys\r\nfrom bisect import *\r\nfrom heapq import *\r\nfrom itertools import permutations\r\nfrom functools import *\r\nimport re\r\nimport sys\r\nimport threading\r\nfrom typing import *\r\n\r\n# from sortedcontainers import *\r\n# from sortedcontainerstemp import *\r\n\r\n# from temps import *\r\n \r\nMOD = 10 ** 9 + 7\r\n# sys.setrecursionlimit(10**6)\r\n\r\ndef subinp():\r\n sys.stdin = open(\"input.txt\", \"r\")\r\n sys.stdout = open(\"output.txt\", \"w\")\r\n\r\ndef subinp_1():\r\n sys.stdin = open(\"input.txt\", \"r\")\r\n sys.stdout = open(\"op2.txt\", \"w\")\r\n\r\n\"\"\"\r\npow2 = [1]\r\n# print(log2(10 ** 9))\r\nfor i in range(29):\r\n pow2.append(pow2[-1] * 2)\r\n\"\"\"\r\n# input = sys.stdin.readline\r\n \r\n\r\nclass Point:\r\n def __init__(self, x, l1):\r\n self.x = x\r\n self.l1 = l1\r\n\r\n def __lt__(self, b):\r\n return self.l1[self.x] < self.l1[b.x]\r\n\r\n def getval(self):\r\n return self.x\r\n\r\n\r\ninp = lambda: int(input())\r\nstrin = lambda: input().strip()\r\nstrl = lambda: list(input().rstrip(\"\\r\\n\"))\r\nstrlst = lambda: list(map(str, input().split()))\r\nmult = lambda: map(int,input().strip().split())\r\nmuls = lambda: map(str,input().strip().split())\r\nmulf = lambda: map(float,input().strip().split())\r\nlstin = lambda: list(map(int,input().strip().split()))\r\n \r\nflush = lambda: stdout.flush()\r\nstdpr = lambda x: stdout.write(str(x))\r\n# @lru_cache(maxsize = 128)\r\n\r\n# print(pref)\r\n# ac = [chr(i) for i in range(ord('a'), ord('z') + 1)]\r\n\r\n\r\n# Power comes in response to a need, not a desire.\r\n\r\n# n = int(input())\r\n# n, k = map(int, input().split())\r\n# s = input()\r\n# l = list(map(int, input().split()))\r\n# dp = [[-1 for i in range(n + 1)] for j in range(2)]\r\n\r\ninput = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\n\r\n\r\n# spf = sakurajima(10 ** 6 + 7)\r\n\r\ndef binpow(a, b, m):\r\n a %= m\r\n x = 1\r\n while b > 0:\r\n if b & 1:\r\n x = x * a % m\r\n a = a * a % m\r\n b >>= 1\r\n return x\r\n\r\n\r\n# print(dp)\r\n\r\nt = 1\r\n# t = int(input())\r\n\r\nfor _ in range(t):\r\n n = inp()\r\n arr = []\r\n\r\n dp = [float(inf)] * (n + 1)\r\n dp[0] = 0\r\n\r\n for i in range(1, n + 1):\r\n arr.append(inp())\r\n dp[i] = min(dp[i], dp[i - 1] + 20)\r\n # print(i, arr[-1] - 90, dp[i], dp[bisect_right(arr, arr[-1] - 90)], dp)\r\n dp[i] = min(dp[i], dp[bisect_right(arr, arr[-1] - 90)] + 50, dp[bisect_right(arr, arr[i - 1] - 1440)] + 120)\r\n # print(dp) \r\n ans = []\r\n for i in range(n):\r\n print(dp[i + 1] - dp[i])\r\n \r\n\r\n # a1 = redpanda(n, l)\r\n # print(a)\r\n # print(a1)\r\n # sys.stdout.write(str(ans))\r\n # print(\"Case #\" + str(_ + 1) + \": \" + str(ans))", "#-*- coding:utf-8 -*-\n#!/usr/bin/python3\n\nn = int(input())\na = [0,]\nfor i in range(n):\n\tx = int(input())\n\ta.append(x)\n\ndp = [0] * (n + 1)\ndp[0] = 0\np90 = 1\np1440 = 1\nfor i in range(1, n + 1):\n\tdp[i] = dp[i - 1] + 20\n\twhile a[p90] + 90 <= a[i]:\n\t\tp90 = p90 + 1\n\tdp[i] = min(dp[i], dp[p90 - 1] + 50)\n\twhile a[p1440] + 1440 <= a[i]:\n\t\tp1440 = p1440 + 1\n\tdp[i] = min(dp[i], dp[p1440 - 1] + 120)\nfor i in range(1, n + 1):\n\tprint(dp[i] - dp[i - 1])\n\n", "from bisect import bisect_left,bisect_right\r\ndef check(cost,time):\r\n if total <cost:\r\n return 0\r\n t_i=bisect_right(arr,total-cost)\r\n if timer[i] - timer[t_i] <= time:\r\n return 1\r\n return 0\r\n\r\nn=int(input())\r\narr=[99999999]*(n+1)\r\ntotal=0\r\nans=[0]*(n)\r\ntimer=[0]*(n+1)\r\nfor i in range(n):\r\n t=int(input())\r\n timer[i]=t\r\n if check(50,90-1):\r\n total+=0\r\n elif check(120,1440-1):\r\n total+=0\r\n elif check(40,90-1):\r\n total+=10\r\n ans[i]=10\r\n elif check(110,1440-1):\r\n total+=10\r\n ans[i]=10\r\n else:\r\n total+=20\r\n ans[i]=20\r\n arr[i]=total\r\nfor i in ans:\r\n print(i)", "import sys\r\ninput = sys.stdin.readline\r\nfrom bisect import bisect\r\n\r\nM = 10**5+1\r\nn = int(input())\r\ng = [int(input()) for _ in range(n)]\r\nd = [0] + [-1]*n\r\nx = [0] + [-1]*n\r\nfor i in range(1, n+1):\r\n a = bisect(g, g[i-1]-90)\r\n b = bisect(g, g[i-1]-1440)\r\n d[i] = min(d[i-1]+20, d[a]+50, d[b]+120)\r\n x[i] = d[i]-d[i-1]\r\n print(x[i])\r\n", "if __name__ == '__main__':\r\n n = int(input())\r\n t = [0]\r\n\r\n for i in range(n):\r\n t.append(int(input()))\r\n dp = [0 for i in range(n + 1)]\r\n dp[1] = 20\r\n pre90 = 1\r\n pre1440 = 1\r\n for i in range(2, n + 1):\r\n while t[i] - t[pre90] >= 90 and pre90 < i:\r\n pre90 += 1\r\n while t[i] - t[pre1440] >= 1440 and pre1440 < i:\r\n pre1440 += 1\r\n dp[i] = dp[i - 1] + 20\r\n if pre90 < i:\r\n dp[i] = min(dp[i], dp[pre90 - 1] + 50)\r\n if pre1440 < i:\r\n dp[i] = min(dp[i], dp[pre1440 - 1] + 120)\r\n for i in range(1, n + 1):\r\n print(dp[i] - dp[i - 1])\r\n", "n=int(input())\ntrips=[]\nprix=[0]\nk=0\nj=0\nfor i in range (n):\n trips.append(int(input()))\n while trips[i]-trips[j]>=90 :\n j+=1\n while trips[i]-trips[k]>=1440:\n k+=1\n prix.append(min(min(prix[k]+120,prix[j]+50),prix[-1]+20))\n print(prix[-1]-prix[-2])", "def go(l, key, plus):\r\n while t[l + 1] + plus - 1 < key:\r\n l += 1\r\n return l\r\n\r\n\r\nINF = 10 ** 9\r\nn = int(input())\r\n\r\nt = [INF] * (n + 1)\r\nt[0] = -INF\r\n\r\nc = [0] * (n + 1)\r\nl1 = 0\r\nl2 = 0\r\nfor i in range(1, n + 1):\r\n t[i] = int(input())\r\n l1 = go(l1, t[i], 90)\r\n l2 = go(l2, t[i], 1440)\r\n \r\n c1 = c[i - 1] + 20\r\n c2 = c[l1] + 50\r\n c3 = c[l2] + 120\r\n c[i] = min(c1, c2, c3)\r\n print(c[i] - c[i - 1])", "from bisect import bisect_left as bl\nfrom bisect import bisect_right as br\nfrom heapq import heappush,heappop,heapify\nimport math\nfrom collections import *\nfrom functools import reduce,cmp_to_key\nimport sys\ninput = sys.stdin.readline\n\nfrom itertools import accumulate\nfrom functools import lru_cache\n\nM = mod = 998244353\ndef factors(n):return sorted(set(reduce(list.__add__, ([i, n//i] for i in range(1, int(n**0.5) + 1) if n % i == 0))))\ndef inv_mod(n):return pow(n, mod - 2, mod)\n \ndef li():return [int(i) for i in input().rstrip('\\n').split()]\ndef st():return input().rstrip('\\n')\ndef val():return int(input().rstrip('\\n'))\ndef li2():return [i for i in input().rstrip('\\n')]\ndef li3():return [int(i) for i in input().rstrip('\\n')]\n\n\n\nn = val()\nl = []\n\nfor i in range(n):l.append(val())\n\nl.sort()\n\nl1 = [0]\nl2 = [-float('inf')]\n\nfor i in l:\n ind2 = br(l2, i - 90) - 1\n ind1 = br(l2, i - 1) - 1\n ind3 = br(l2, i - 1440) - 1\n # print(ind1, ind2, ind3)\n l2.append(i)\n l1.append(min(l1[ind1] + 20, l1[ind2] + 50, l1[ind3] + 120))\n # print(l1, l2)\nl2[0] = 0\n# print(l2)\nfor i in range(1, n + 1):\n print(l1[i] - l1[i - 1])\nprint()\n", "n = int(input())\r\ndp = [0]\r\nt = [0]\r\ni,j = 1,1\r\nfor _ in range(n):\r\n x = int(input())\r\n t.append(x)\r\n while x-t[i]>89:\r\n i+=1\r\n while x-t[j]>1439:\r\n j+=1\r\n try:\r\n y = min(dp[-1]+20, dp[i-1]+50, dp[j-1]+120)\r\n dp.append(y)\r\n except:\r\n print(i,j)\r\n\r\nans = []\r\nfor i in range(n):\r\n ans.append(dp[i+1]-dp[i])\r\n\r\n\r\n\r\nprint(*ans)", "from bisect import bisect\r\na = []\r\nfor i in range(int(input())):\r\n a.append(int(input()))\r\ndp = [0] * (len(a) + 1)\r\nfor i in range(1, len(dp)):\r\n dp[i] = min(dp[i-1] + 20, dp[bisect(a, a[i-1] - 90)] + 50, dp[bisect(a, a[i-1] - 1440)] + 120)\r\nfor i in range(1, len(dp)):\r\n print(dp[i] - dp[i-1])", "trips = []\nN = int(input())\nfor n in range(N):\n trips.append(int(input()))\n\ntotal = [20] + [None] * (len(trips)-1)\noptimal = [20] + [None] * (len(trips)-1)\nhr, dy, paid = 0, 0, 20\nfor t in range(1, len(trips)):\n if trips[t] - 89 > trips[hr]:\n while(trips[t] - 89 > trips[hr]):\n hr += 1\n if trips[t] - 1439 > trips[dy]:\n while(trips[t] - 1439 > trips[dy]):\n dy += 1 \n single = total[t-1] + 20\n hourly = total[hr] - optimal[hr] + 50 if hr != t else total[t-1] + 50\n daily = total[dy] - optimal[dy] + 120 if dy != t else total[t-1] + 120\n optimal[t] = max(min(single, hourly, daily) - total[t-1], 0)\n total[t] = total[t-1] + optimal[t]\n\nfor p in optimal:\n print(p)\n\n", "\nfrom bisect import bisect_left as bl\nfrom bisect import bisect_right as br\nfrom heapq import heappush,heappop\nimport math\nfrom collections import *\nfrom functools import reduce,cmp_to_key,lru_cache\nimport io, os\ninput = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\n# import sys\n# input = sys.stdin.readline\n \nM = mod = 10**9 + 7 \ndef factors(n):return sorted(set(reduce(list.__add__, ([i, n//i] for i in range(1, int(n**0.5) + 1) if n % i == 0))))\ndef inv_mod(n):return pow(n, mod - 2, mod)\n \ndef li():return [int(i) for i in input().rstrip().split()]\ndef st():return str(input().rstrip())[2:-1]\ndef val():return int(input().rstrip())\ndef li2():return [str(i)[2:-1] for i in input().rstrip().split()]\ndef li3():return [int(i) for i in st()]\n \n \n\n\n\nn = val()\nl = []\n\nfor i in range(n):l.append(val())\n\nl.sort()\n\nl1 = [0]\nl2 = [-float('inf')]\n\nfor i in l:\n ind2 = br(l2, i - 90) - 1\n ind1 = br(l2, i - 1) - 1\n ind3 = br(l2, i - 1440) - 1\n # print(ind1, ind2, ind3)\n l2.append(i)\n l1.append(min(l1[ind1] + 20, l1[ind2] + 50, l1[ind3] + 120))\n # print(l1, l2)\nl2[0] = 0\n# print(l2)\nfor i in range(1, n + 1):\n print(l1[i] - l1[i - 1])\nprint()\n" ]

[ "n, m, cnt = int(input()), 148, 0\nans = [['N'] * m for i in range(m)]\n\ndef edge(i, j):\n ans[i][j] = ans[j][i] = 'Y'\n\ndef node(*adj):\n global cnt\n i = cnt\n cnt += 1\n for j in adj:\n edge(i, j)\n return i\n\nstart, end, choice = node(), node(), node()\nif n&1:\n edge(choice, end)\nfor i in range(1, 30):\n end, choice = node(node(end), node(end)), node(node(choice))\n if n&(1<<i):\n edge(choice, end)\nedge(start, choice)\n\nprint(m)\nfor line in ans:\n print(''.join(line))\n\n\n\n\n# Made By Mostafa_Khaled", "n, m, cnt = int(input()), 148, 0\nans = [['N'] * m for i in range(m)]\n\ndef edge(i, j):\n ans[i][j] = ans[j][i] = 'Y'\n\ndef node(adj):\n global cnt\n i = cnt\n cnt += 1\n for j in adj:\n edge(i, j)\n return i\n\nstart = node([])\nend = node([])\nchoice = node([end] if n&1 else [])\nfor i in range(1, 30):\n end = node([node([end]), node([end])])\n choice = node([node([choice])] + ([end] if (n>>i)&1 else []))\nedge(start, choice)\n\nprint(m)\nfor line in ans:\n print(''.join(line))\n", "k=str(input())\r\nl=len(k)\r\npaths=[]\r\nfor i in range(l):\r\n\tpaths.append([1]*i+[int(k[i])]+[10]*(l-i-1))\r\nlens = [sum(p) for p in paths]\r\nn = sum(lens)+2\r\nm = ['']*n\r\nm[0] = 'N'*2\r\nfor i in range(len(paths)):\r\n\tm[0] += 'Y'*paths[i][0]+'N'*(lens[i]-paths[i][0])\r\nm[1] = 'N'\r\nfor i in range(len(paths)):\r\n\tm[1] += 'N'*(lens[i]-paths[i][-1])+'Y'*paths[i][-1]\r\nind=2\r\nfor p in paths:\r\n\tfor i in range(len(p)-1):\r\n\t\tfor j in range(p[i]):\r\n\t\t\tm[ind] = 'N'*(p[i]-j)+'Y'*(p[i+1])+'N'*n\r\n\t\t\tind+=1\r\n\tfor j in range(p[-1]):\r\n\t\tm[ind] = 'N'*n\r\n\t\tind+=1\r\nm2=['']*n\r\nfor i in range(n):\r\n\tm2[i] = ''\r\n\tfor j in range(i):\r\n\t\tm2[i]+=m2[j][i]\r\n\tm2[i]+=m[i][:n-i]\r\nprint(len(m2))\r\nfor s in m2:\r\n\tprint(s)\r\n", "# Problem: B. Fox and Minimal path\r\n# Contest: Codeforces - Codeforces Round #228 (Div. 1)\r\n# URL: https://codeforces.com/problemset/problem/388/B\r\n# Memory Limit: 256 MB\r\n# Time Limit: 1000 ms\r\n\r\nimport sys\r\nimport bisect\r\nimport random\r\nimport io, os\r\nfrom bisect import *\r\nfrom collections import *\r\nfrom contextlib import redirect_stdout\r\nfrom itertools import *\r\nfrom array import *\r\nfrom functools import lru_cache\r\nfrom types import GeneratorType\r\nfrom heapq import *\r\nfrom math import sqrt, gcd, inf\r\n\r\nif sys.version >= '3.8': # ACW没有comb\r\n from math import comb\r\n\r\nRI = lambda: map(int, sys.stdin.buffer.readline().split())\r\nRS = lambda: map(bytes.decode, sys.stdin.buffer.readline().strip().split())\r\nRILST = lambda: list(RI())\r\nDEBUG = lambda *x: sys.stderr.write(f'{str(x)}\\n')\r\n\r\nMOD = 10 ** 9 + 7\r\nPROBLEM = \"\"\"\r\nhttps://codeforces.com/problemset/problem/388/B\r\n\r\n输入 k(1≤k≤1e9)。\r\n构造一个节点个数不超过 1000 的简单无向图（节点编号从 1 开始），使得从节点 1 到节点 2 的最短路径的数量恰好为 k。\r\n输出 n 以及一个 n*n 的邻接矩阵 g，如果 i 和 j 之间有边，则 g[i][j]='Y'，否则为 'N'。\r\n注意不能有自环，即 g[i][i] 必须为 'N'。\r\n\r\n进阶：请最小化 n。\r\n\r\n注：这个构造方案可以用来 hack 一些用方案数取模来做连通性判定的代码。\r\n输入\r\n2\r\n输出\r\n4\r\nNNYY\r\nNNYY\r\nYYNN\r\nYYNN\r\n\r\n输入\r\n9\r\n输出\r\n8\r\nNNYYYNNN\r\nNNNNNYYY\r\nYNNNNYYY\r\nYNNNNYYY\r\nYNNNNYYY\r\nNYYYYNNN\r\nNYYYYNNN\r\nNYYYYNNN\r\n\"\"\"\r\n\r\n\r\n# ms\r\ndef solve():\r\n k, = RI()\r\n s = left = 0\r\n a = []\r\n while k:\r\n if k <= 31:\r\n left, k = k, 0\r\n break\r\n x = int(k ** 0.2)\r\n k -= x ** 5\r\n a.append(x)\r\n s += x\r\n # 共5层，每层s个数，剩下的left，第一层left个数，其余4层1个数\r\n n = 2 + s * 5 + 4 + left # 01、每层s个数、剩下left\r\n start = 2 # 这5层节点从2开始\r\n ans = [['N'] * n for _ in range(n)]\r\n # 把5层连接\r\n for x in a:\r\n for i in range(4):\r\n for y in range(x):\r\n l = start + i * x + y\r\n for z in range(x):\r\n r = start + (i + 1) * x + z\r\n ans[l][r] = ans[r][l] = 'Y'\r\n for y in range(x):\r\n l = start + y # 第一排的数\r\n r = start + 4 * x + y # 最后一排的数\r\n ans[0][l] = ans[l][0] = 'Y'\r\n ans[1][r] = ans[r][1] = 'Y'\r\n start += 5 * x\r\n # 连接剩余left的数\r\n for i in range(start, start + left):\r\n ans[0][i] = ans[i][0] = 'Y' # 第一排连接到0\r\n ans[start + left][i] = ans[i][start + left] = 'Y' # 第一排连接到第二排的数\r\n start += left\r\n for _ in range(3):\r\n ans[start][start + 1] = ans[start + 1][start] = 'Y' # 连接后一排\r\n start += 1\r\n ans[start][1] = ans[1][start] = 'Y' # 最后一排连接1\r\n print(n)\r\n print('\\n'.join(map(lambda r: ''.join(r), ans)))\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "N = int(input())\nb = bin(N)[2:][::-1]\ncount = len(b)-1\n\ndef print_matrix(m):\n print(len(m))\n for i in range(len(m)):\n print(\"\".join(m[i]))\n\nm = [['N' for i in range(2*(len(b))+count)] for j in range(2*(len(b))+count)]\nfor i in range(count-1):\n val = len(m)-count+i\n m[val][val+1] = 'Y'\n m[val+1][val] = 'Y'\n\nif count>0:\n m[len(m)-1][1] = 'Y'\n m[1][len(m)-1] = 'Y'\n\n#print_matrix(m)\nc = 0\nc2 = len(m)-count\nfor i in range(0, len(m)-count, 2):\n if i >= len(m)-2-count and i != 0:\n m[i][1] = 'Y'\n m[i+1][1] = 'Y'\n m[1][i+1] = 'Y'\n m[1][i] = 'Y'\n elif i < len(m)-2-count:\n m[i][i+2] = 'Y'\n m[i][i+3] = 'Y'\n m[i+2][i] = 'Y'\n m[i+3][i] = 'Y'\n if i != 0:\n \t m[i+1][i+2] = 'Y'\n \t m[i+1][i+3] = 'Y'\n \t m[i+2][i+1] = 'Y'\n \t m[i+3][i+1] = 'Y'\n if b[c] =='1':\n if i == len(m)-count-2:\n c2 = 1\n #print_matrix(m)\n m[i][c2] = 'Y'\n m[c2][i] = 'Y'\n if i != 0:\n m[i+1][c2] = 'Y'\n m[c2][i+1] = 'Y'\n c2+=1\n #print_matrix(m)\n c+=1\n\nprint(len(m))\nfor i in range(len(m)):\n print(\"\".join(m[i]))\n\n \t\t \t \t \t \t \t" ]

[ "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\nstrings = []\r\nfor i in range(3):\r\n s = S()\r\n letter = \"\"\r\n for j in range(len(s)):\r\n if 97<=ord(s[j])<=122:\r\n letter += chr(ord(s[j])-32)\r\n \r\n elif 90<ord(s[j])<97 or ord(s[j])>122 or ord(s[j])<65:\r\n continue\r\n else:\r\n letter+= s[j]\r\n\r\n strings.append(letter)\r\n\r\npossible = []\r\nfor i in range(3):\r\n for j in range(3):\r\n for k in range(3):\r\n if i!=j and i!=k and j!=k:\r\n m = strings[i] + strings[j] + strings[k]\r\n possible.append(m)\r\n\r\n# print(strings)\r\nn = I()\r\nfor i in range(n):\r\n t = S()\r\n given = \"\"\r\n for j in range(len(t)):\r\n if 97<=ord(t[j])<=122:\r\n given += chr(ord(t[j])-32)\r\n \r\n elif 90<ord(t[j])<97 or ord(t[j])>122 or ord(t[j])<65:\r\n continue\r\n else:\r\n given+= t[j]\r\n \r\n \r\n if given in possible:\r\n print(\"ACC\")\r\n else:\r\n print(\"WA\")", "def normalize(s):\r\n return s.replace('-', '').replace(';', '').replace('_', '').lower()\r\n \r\nI = input\r\na, b, c = normalize(I()), normalize(I()), normalize(I())\r\nst = {a + b + c, a + c + b, b + a + c, b + c + a, c + a + b, c + b + a}\r\nn = int(I())\r\nfor _ in range(n):\r\n print('ACC' if normalize(I()) in st else 'WA')", "n=input().replace(\";\",\"\").replace(\"-\",\"\").replace(\"_\",\"\").lower()\r\np=input().replace(\";\",\"\").replace(\"-\",\"\").replace(\"_\",\"\").lower()\r\nc=input().replace(\";\",\"\").replace(\"-\",\"\").replace(\"_\",\"\").lower()\r\nz=[n+p+c,n+c+p,c+n+p,c+p+n,p+c+n,p+n+c]\r\nfor i in range(int(input())):\r\n q=input().replace(\";\",\"\").replace(\"-\",\"\").replace(\"_\",\"\").lower()\r\n if q in z:\r\n print(\"ACC\")\r\n else:\r\n print(\"WA\")", "def conv(a):\r\n return ''.join((a.replace('_', '-').replace('-', ';')).lower().split(';'))\r\n\r\na = conv(input())\r\nb = conv(input())\r\nc = conv(input())\r\n\r\nn = int(input())\r\n\r\nfor i in range(n):\r\n frase = conv(input())\r\n\r\n if frase == a+b+c or frase == a+c+b or frase == b+a+c or frase == b+c+a or frase == c+a+b or frase == c+b+a:\r\n print('ACC')\r\n else:\r\n print('WA')", "word1 = \"\".join([ i.lower() for i in input() if i.isalpha()])\r\nword2 = \"\".join([ i.lower() for i in input() if i.isalpha()])\r\nword3 = \"\".join([ i.lower() for i in input() if i.isalpha()])\r\nref1 = word1 + word2 + word3\r\nref2 = word2 + word1 + word3 \r\nref3 = word3 + word1 + word2 \r\nref4 = word3 + word2 + word1\r\nref5 = word1 + word3 + word2\r\nref6 = word2 + word3 + word1\r\nl = [ref1 , ref2 , ref3 , ref4 , ref5 , ref6]\r\nn = int(input())\r\nfor i in range(n) : \r\n data = \"\".join([ i.lower() for i in input() if i.isalpha()])\r\n res = \"WA\"\r\n for i in l : \r\n if i in data : \r\n res = \"ACC\"\r\n break\r\n print(res)\r\n\r\n\r\n", "def removeSign(s):\r\n ans = ''\r\n for ch in s:\r\n if (ch != ';' and ch != '_' and ch != '-'):\r\n ans += ch\r\n ans = ans.lower()\r\n return ans\r\n\r\na = input()\r\nb = input()\r\nc = input()\r\nn = int(input())\r\na = removeSign(a).lower()\r\nb = removeSign(b).lower()\r\nc = removeSign(c).lower()\r\nfor i in range(n):\r\n s = input()\r\n s = removeSign(s)\r\n cat = [a + b + c, a + c + b, b + c + a, b + a +c, c + a + b, c + b + a]\r\n if (s in cat):\r\n print('ACC')\r\n else:\r\n print('WA')", "string = [input(),input(),input()]\r\nfor i in range(len(string)):\r\n if ';' in string[i]: string[i] = string[i].replace(';', '')\r\n if '-' in string[i]: string[i] = string[i].replace('-', '')\r\n if '_' in string[i]: string[i] = string[i].replace('_', '')\r\nstring[0], string[1], string[2] = string[0].lower(), string[1].lower(), string[2].lower()\r\nconnections = [string[0] + string[1] + string[2], string[0] + string[2] + string[1], string[1] + string[0] + string[2], string[1] + string[2] + string[0], string[2] + string[0] + string[1], string[2] + string[1] + string[0]]\r\nfor i in range(int(input())):\r\n a = input()\r\n if ';' in a: a = a.replace(';', '')\r\n if '-' in a: a = a.replace('-', '')\r\n if '_' in a: a = a.replace('_', '')\r\n a = a.lower()\r\n if a in connections: print(\"ACC\")\r\n else: print(\"WA\")", "s1 = ''.join([i.lower() for i in input() if i.isalpha()])\r\ns2 = ''.join([i.lower() for i in input() if i.isalpha()])\r\ns3 = ''.join([i.lower() for i in input() if i.isalpha()])\r\ncombinations = [s1 + s2 + s3, s1 + s3 + s2, s2 + s1 + s3, s2 + s3 + s1, s3 + s1 + s2, s3 + s2 + s1]\r\n \r\nn = int(input())\r\nfor _ in range(n):\r\n s = ''.join([i.lower() for i in input() if i.isalpha()])\r\n if s in combinations:\r\n print('ACC')\r\n else:\r\n print('WA')", "# LUOGU_RID: 119988136\nimport itertools, re\r\n\r\ndef rea(s):\r\n return re.sub(\"([^a-z])\", \"\", s.lower())\r\n\r\nss = [rea(input()) for _ in range(3)]\r\nreal = []\r\nfor tup in list(itertools.permutations(ss)):\r\n real.append(\"\".join(tup))\r\nn = int(input())\r\nfor i in range(n):\r\n if rea(input()) in real:\r\n print(\"ACC\")\r\n else:\r\n print(\"WA\")", "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\ndef clean(s):\r\n return s.replace(\"-\", \"\").replace(\";\", \"\").replace(\"_\", \"\").lower()\r\n\r\npos = set()\r\ns = [clean(is1()), clean(is1()), clean(is1())]\r\nfor i in range(3):\r\n for j in range(3):\r\n if j!=i:\r\n for k in range(3):\r\n if k != j:\r\n pos.add(s[i] + s[j] + s[k])\r\n \r\nn = ii1()\r\nfor i in range(n):\r\n if clean(is1()) in pos:\r\n print(\"ACC\")\r\n else:\r\n print(\"WA\")\r\n\r\n", "s1=input()\r\ns2=input()\r\ns3=input()\r\ns1=s1.replace(\";\",\"\")\r\ns1=s1.replace(\"_\",\"\")\r\ns1=s1.replace(\"-\",\"\")\r\n\r\ns2=s2.replace(\";\",\"\")\r\ns2=s2.replace(\"_\",\"\")\r\ns2=s2.replace(\"-\",\"\")\r\n\r\ns3=s3.replace(\";\",\"\")\r\ns3=s3.replace(\"_\",\"\")\r\ns3=s3.replace(\"-\",\"\")\r\n\r\ns1=s1.lower()\r\ns2=s2.lower()\r\ns3=s3.lower()\r\n\r\nn=int(input())\r\nfor i in range(n):\r\n s=input()\r\n s=s.replace(\";\",\"\")\r\n s=s.replace(\"_\",\"\")\r\n s=s.replace(\"-\",\"\")\r\n s=s.lower()\r\n if(s==s1+s2+s3 or s==s1+s3+s2 or s==s2+s3+s1 or s==s2+s1+s3 or s==s3+s2+s1 or s==s3+s1+s2):\r\n print(\"ACC\")\r\n else:\r\n print(\"WA\")", "from itertools import permutations\r\nimport sys\r\nu=input\r\nl=[u(),u(),u()]\r\n#print(l)\r\nd={';':'' , '-':'', '_':''}\r\nfor _ in range(3):\r\n l[_]=''.join(d[s] if s in d else s for s in l[_])\r\n l[_]=l[_].lower();\r\n#print(l)\r\nn=int(u())\r\nfor i in range(n):\r\n s=u().lower()\r\n b=0\r\n s=''.join(d[p] if p in d else p for p in s)\r\n #print(s)\r\n for q in permutations(l):\r\n r=''.join(x for x in q)\r\n if(r==s):\r\n b=1\r\n break\r\n print([\"WA\",\"ACC\"][b])", "a=input()\r\nb=input()\r\nc=input()\r\na=a.replace(\";\",\"\").replace(\"_\",\"\").replace(\"-\",\"\").lower()\r\nb=b.replace(\";\",\"\").replace(\"_\",\"\").replace(\"-\",\"\").lower()\r\nc=c.replace(\";\",\"\").replace(\"_\",\"\").replace(\"-\",\"\").lower()\r\nd=[]\r\nd.append(a+b+c)\r\nd.append(a+c+b)\r\nd.append(b+a+c)\r\nd.append(b+c+a)\r\nd.append(c+a+b)\r\nd.append(c+b+a)\r\nfor x in range(int(input())):\r\n prin=False\r\n line=input().replace(\";\",\"\").replace(\"_\",\"\").replace(\"-\",\"\").lower()\r\n for y in d:\r\n if y==line:\r\n print(\"ACC\")\r\n prin=True\r\n break\r\n if not prin:\r\n print(\"WA\")", "\r\ndef hardwork(a,b):\r\n n = len(b)\r\n A = [None]*3\r\n\r\n index = 0\r\n for word in a:\r\n w = \"\"\r\n for x in word:\r\n if x not in [';','-','_']:\r\n w += x.lower()\r\n else:\r\n w += \"\"\r\n A[index] = w \r\n index += 1\r\n\r\n B = [None]*n\r\n index = 0\r\n for word in b:\r\n w = \"\"\r\n for x in word:\r\n if x not in [';','-','_']:\r\n w += x.lower()\r\n else:\r\n w += \"\"\r\n B[index] = w \r\n index += 1\r\n\r\n A1,A2,A3 = A \r\n A_concat = [None]*6\r\n A_concat[0] = A1+A2+A3 \r\n A_concat[1] = A1+A3+A2 \r\n A_concat[2] = A2+A1+A3\r\n A_concat[3] = A2+A3+A1 \r\n A_concat[4] = A3+A1+A2 \r\n A_concat[5] = A3+A2+A1 \r\n \r\n for b in B:\r\n if len(b) > 300 or b not in A_concat:\r\n print(\"WA\")\r\n else:\r\n print(\"ACC\")\r\n \r\n\r\na = []\r\nfor _ in range(3):\r\n a.append(input().strip())\r\n\r\nn = int(input().strip())\r\nb = []\r\nfor _ in range(n):\r\n b.append(input().strip())\r\n\r\nhardwork(a,b)", "import sys\r\nfrom array import array # noqa: F401\r\nfrom itertools import permutations\r\n\r\n\r\ndef input():\r\n return sys.stdin.buffer.readline().decode('utf-8')\r\n\r\n\r\ntable = str.maketrans({\r\n '-': '',\r\n ';': '',\r\n '_': ''\r\n})\r\n\r\nwords = [input().rstrip().translate(table).lower() for _ in range(3)]\r\ncorrect = {a[0] + a[1] + a[2] for a in permutations(words)}\r\nn = int(input())\r\nans = [''] * n\r\n\r\nfor i, word in enumerate(input().rstrip().translate(table).lower() for _ in range(n)):\r\n ans[i] = 'ACC' if word in correct else 'WA'\r\n\r\nprint(*ans, sep='\\n')\r\n", "import itertools\r\nimport sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nng = set([ord(i) for i in (\"-\", \";\", \"_\")])\r\nu = []\r\nfor _ in range(3):\r\n s = list(input().rstrip())\r\n t = []\r\n for i in s:\r\n if not i in ng:\r\n t.append(i)\r\n u.append(t)\r\nv = []\r\nfor p in itertools.permutations([0, 1, 2]):\r\n v0 = []\r\n for i in p:\r\n for j in u[i]:\r\n v0.append(j)\r\n v.append(v0)\r\nn = int(input())\r\nans = []\r\nfor _ in range(n):\r\n s = list(input().rstrip())\r\n t = []\r\n for i in s:\r\n if not i in ng:\r\n t.append(i)\r\n ok = 0\r\n for i in range(6):\r\n if len(v[i]) ^ len(t):\r\n break\r\n f = 1\r\n for j, k in zip(v[i], t):\r\n if j ^ k and abs(j - k) ^ 32:\r\n f = 0\r\n break\r\n if f:\r\n ok = 1\r\n break\r\n ans0 = \"ACC\" if ok else \"WA\"\r\n ans.append(ans0)\r\nsys.stdout.write(\"\\n\".join(ans))", "import re\r\nimport sys\r\nexit=sys.exit\r\nfrom bisect import bisect_left as bsl,bisect_right as bsr\r\nfrom collections import Counter,defaultdict as ddict,deque\r\nfrom functools import lru_cache\r\ncache=lru_cache(None)\r\nfrom heapq import *\r\nfrom itertools import *\r\nfrom math import inf\r\nfrom pprint import pprint as pp\r\nenum=enumerate\r\nri=lambda:int(rln())\r\nris=lambda:list(map(int,rfs()))\r\nrln=sys.stdin.readline\r\nrl=lambda:rln().rstrip('\\n')\r\nrfs=lambda:rln().split()\r\ncat=''.join\r\ncatn='\\n'.join\r\nmod=1000000007\r\nd4=[(0,-1),(1,0),(0,1),(-1,0)]\r\nd8=[(-1,-1),(0,-1),(1,-1),(-1,0),(1,0),(-1,1),(0,1),(1,1)]\r\n########################################################################\r\n\r\ndef norm(s):\r\n ignore={*'-;_'}\r\n ret=''\r\n for c in s:\r\n if c in ignore:\r\n continue\r\n ret+=c.upper()\r\n return ret\r\n\r\na=norm(rl())\r\nb=norm(rl())\r\nc=norm(rl())\r\n\r\ngood={\r\n a+b+c,a+c+b,\r\n b+a+c,b+c+a,\r\n c+a+b,c+b+a,\r\n}\r\n\r\nn=ri()\r\nfor _ in range(n): \r\n s=norm(rl())\r\n if s in good:\r\n print('ACC')\r\n else:\r\n print('WA')\r\n", "#! /usr/bin/env python3\nimport sys\nimport re\nimport itertools\n\ndef main():\n inpt = []\n str_list = []\n answers = []\n\n for line in sys.stdin:\n inpt.append(line.rstrip(\"\\n\"))\n\n str_list = [re.sub(\"[-_;]\", \"\", word).lower() for word in inpt[:3]]\n answers = [re.sub(\"[-_;]\", \"\", word).lower() for word in inpt[4:]]\n\n for answer in answers:\n print(check_answer(str_list, answer))\n\n return 0\n\ndef check_answer(str_list, answer):\n big_list = set([\"\".join(words) for words in itertools.permutations(str_list)])\n \n if answer in big_list:\n return \"ACC\"\n else:\n return \"WA\"\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", "S = [input() for i in range(3)]\r\nfor i in range(3):\r\n s = S[i]\r\n s = s.replace('-', '')\r\n s = s.replace(';', '')\r\n s = s.replace('_', '')\r\n s = s.lower()\r\n S[i] = s\r\n\r\nT = set()\r\nimport itertools\r\nfor p in itertools.permutations(range(3), 3):\r\n t = S[p[0]]+S[p[1]]+S[p[2]]\r\n T.add(t)\r\n\r\nn = int(input())\r\nfor i in range(n):\r\n s = str(input())\r\n s = s.replace('-', '')\r\n s = s.replace(';', '')\r\n s = s.replace('_', '')\r\n s = s.lower()\r\n if s in T:\r\n print('ACC')\r\n else:\r\n print('WA')\r\n", "init = []\nfor i in range(3):\n add = input().lower()\n for i in [\"-\", \";\", \"_\"]:\n add = add.replace(i, \"\")\n\n init.append(add)\nanswer = [init[0]+init[1]+init[2], init[0]+init[2]+init[1], \n init[1]+init[0]+init[2], init[1]+init[2]+init[0],\n init[2]+init[1]+init[0], init[2]+init[0]+init[1]]\n\nn = int(input())\nfor i in range(n):\n s = input().lower()\n for i in [\"-\", \";\", \"_\"]:\n s = s.replace(i, \"\")\n\n if(s in answer):\n print(\"ACC\")\n else:\n print(\"WA\")\n \t\t\t \t \t\t\t\t \t \t \t \t \t \t", "def clean(s):\r\n ans = \"\"\r\n for i in s:\r\n if i!= '_' and i!=';' and i != '-':\r\n ans += i\r\n return ans\r\n\r\na = input()\r\nb = input()\r\nc = input()\r\na = clean(a)\r\nb = clean(b)\r\nc = clean(c)\r\na = a.lower()\r\nb = b.lower()\r\nc = c.lower()\r\none = a + b + c\r\ntwo = a + c + b\r\nthree = c + b + a\r\nfour = b + c + a\r\nfive = c + a + b\r\nsix = b + a + c\r\n\r\nn = int(input())\r\nfor i in range(0,n):\r\n s = input()\r\n s = clean(s).lower()\r\n if s == one or s == two or s == three or s == four or s == five or s == six:\r\n print(\"ACC\")\r\n else:\r\n print(\"WA\")\r\n", "strs = []\r\nfor i in range(0, 3):\r\n strs.append(input())\r\nn = int(input())\r\nanswers = []\r\nfor i in range(0, n):\r\n answers.append(input())\r\n\r\nfor i in range(0, len(strs)):\r\n for j in range(0, strs[i].count(\";\")):\r\n strs[i] = strs[i][0:strs[i].find(\";\")] + strs[i][strs[i].find(\";\") + 1:]\r\n for j in range(0, strs[i].count(\"-\")):\r\n strs[i] = strs[i][0:strs[i].find(\"-\")] + strs[i][strs[i].find(\"-\") + 1:]\r\n for j in range(0, strs[i].count(\"_\")):\r\n strs[i] = strs[i][0:strs[i].find(\"_\")] + strs[i][strs[i].find(\"_\") + 1:]\r\n strs[i] = strs[i].lower()\r\n\r\nfor i in range(0, n):\r\n for j in range(0, answers[i].count(\";\")):\r\n answers[i] = answers[i][0:answers[i].find(\";\")] + answers[i][answers[i].find(\";\") + 1:]\r\n for j in range(0, answers[i].count(\"-\")):\r\n answers[i] = answers[i][0:answers[i].find(\"-\")] + answers[i][answers[i].find(\"-\") + 1:]\r\n for j in range(0, answers[i].count(\"_\")):\r\n answers[i] = answers[i][0:answers[i].find(\"_\")] + answers[i][answers[i].find(\"_\") + 1:]\r\n answers[i] = answers[i].lower()\r\n\r\nans1 = strs[0] + strs[1] + strs[2]\r\nans2 = strs[0] + strs[2] + strs[1]\r\nans3 = strs[1] + strs[2] + strs[0]\r\nans4 = strs[1] + strs[0] + strs[2]\r\nans5 = strs[2] + strs[1] + strs[0]\r\nans6 = strs[2] + strs[0] + strs[1]\r\n\r\n# print(strs)\r\n# print(f\"{ans1} {ans2} {ans3} {ans4} {ans5} {ans6}\")\r\n# print(answers)\r\nfor x in answers:\r\n if x == ans1 or x == ans2 or x == ans3 or x == ans4 or x == ans5 or x == ans6:\r\n print(\"ACC\")\r\n else:\r\n print(\"WA\")\r\n", "s1=input()\r\ns2=input()\r\ns3=input()\r\ns=[\"\",\"\",\"\"]\r\nb=[\"-\",\";\",\"_\"]\r\nfor i in range(len(s1)):\r\n if s1[i] not in b:\r\n s[0]+=s1[i]\r\n s[0]=s[0].lower()\r\nfor i in range(len(s2)):\r\n if s2[i] not in b:\r\n s[1]+=s2[i]\r\n s[1]=s[1].lower()\r\nfor i in range(len(s3)):\r\n if s3[i] not in b:\r\n s[2]+=s3[i]\r\n s[2]=s[2].lower()\r\nc=[\"\"]*6\r\nc[0]=s[0]+s[1]+s[2]; c[1]=s[0]+s[2]+s[1]\r\nc[2]=s[1]+s[0]+s[2]; c[3]=s[1]+s[2]+s[0]\r\nc[4]=s[2]+s[0]+s[1]; c[5]=s[2]+s[1]+s[0]\r\nn=int(input())\r\nv=[\"\"]*n\r\n#print(*c)\r\nfor i in range(n):\r\n x=input()\r\n x1=\"\"\r\n for j in range(len(x)):\r\n if x[j] not in b:\r\n x1+=x[j]\r\n x1=x1.lower()\r\n v[i]=[\"WA\",\"ACC\"][x1 in c]\r\nfor i in range(n):\r\n print(v[i])\r\n \r\n \r\n\r\n\r\n\r\n", "a=input()\r\nb=input()\r\nc=input()\r\nx=''\r\ny=''\r\nz=''\r\nans=[]\r\nfor i in a:\r\n if i!='-' and i!='_' and i!=';':\r\n x=x+i.lower()\r\nfor i in b:\r\n if i!='-' and i!='_' and i!=';':\r\n y=y+i.lower()\r\nfor i in c:\r\n if i!='-' and i!='_' and i!=';':\r\n z=z+i.lower()\r\nans.append(x+y+z)\r\nans.append(x+z+y)\r\nans.append(z+x+y)\r\nans.append(z+y+x)\r\nans.append(y+z+x)\r\nans.append(y+x+z)\r\nn=int(input())\r\nq=''\r\nwhile n>0:\r\n s=input()\r\n l=0\r\n for i in s:\r\n if i != '-' and i != '_' and i != ';':\r\n q=q+i.lower()\r\n for i in ans:\r\n if i==q:\r\n l=1\r\n break\r\n if l==1:\r\n print(\"ACC\")\r\n else:\r\n print(\"WA\")\r\n n=n-1\r\n q=''\r\n\r\n\r\n\r\n\r\n\r\n", "arr = \"\"\r\nnarr = \"\"\r\narr2 = []\r\narr3 =[]\r\nflag = False\r\nfor i in range(3):\r\n sting = input()\r\n for i in sting:\r\n if i == '_' or i == ';' or i == '-':\r\n continue\r\n else:\r\n arr +=(i.upper())\r\n\r\n arr2.append(arr)\r\n arr = \"\"\r\narr3.append(arr2[0] + arr2[1] + arr2[2])\r\narr3.append(arr2[1] + arr2[0] + arr2[2])\r\narr3.append(arr2[1] + arr2[2] + arr2[0])\r\narr3.append(arr2[0] + arr2[2] + arr2[1])\r\narr3.append(arr2[2] + arr2[1] + arr2[0])\r\narr3.append(arr2[2] + arr2[0] + arr2[1])\r\n\r\nn = int(input())\r\nfor i in range(n):\r\n flag = False\r\n nsting = input()\r\n for i in range(len(nsting)):\r\n if nsting[i] != '_' and nsting[i] != ';' and nsting[i] != '-':\r\n narr += nsting[i].upper()\r\n \r\n for i in range(len(arr3)):\r\n if narr == arr3[i]:\r\n flag = True\r\n\r\n if flag == True:\r\n print('ACC')\r\n else:\r\n print('WA')\r\n narr = ''", "from itertools import permutations\r\ndef f():\r\n a=str(input())\r\n l=\"\"\r\n for i in a:\r\n if i.isalpha():\r\n l+=i.lower()\r\n return l\r\nL=[]\r\nfor i in range(3):\r\n L.append(f())\r\nP=[]\r\nfor i in list(permutations(L)):\r\n s=\"\"\r\n for j in i:\r\n s+=j\r\n P.append(s)\r\nn=int(input())\r\nfor j in range(n):\r\n if f() in P:\r\n print(\"ACC\")\r\n else:\r\n print (\"WA\")\r\n", "def foo(s):\r\n s=''.join(s.split('-'))\r\n s=''.join(s.split(';'))\r\n s=''.join(s.split('_'))\r\n return s.lower()\r\ns1=foo(input())\r\ns2=foo(input())\r\ns3=foo(input())\r\nn=int(input())\r\narr=[s1+s2+s3,s1+s3+s2,s2+s1+s3,s2+s3+s1,s3+s1+s2,s3+s2+s1]\r\nfor _ in range(n):\r\n if foo(input()) in arr:\r\n print('ACC')\r\n else:\r\n print('WA')", "def clean(w): \r\n return w.replace(\"-\",'').replace(\";\",'').replace(\"_\",'').lower()\r\n\r\nlst = [clean(w.rstrip()) for w in open(0).readlines()]\r\na,b,c = lst[:3]\r\nok = [a+b+c, b+c+a, c+a+b, a+c+b, c+b+a, b+a+c]\r\nres = [[\"WA\",\"ACC\"][line in ok] for line in lst[4:]]\r\nprint(\"\\n\".join(res))", "import itertools\r\n\r\ndef remove_signs(s: str, signs: list) -> str:\r\n for i in range(len(signs)):\r\n s = s.replace(signs[i], '')\r\n return s\r\n\r\n\r\ndef get_permulation_of_strings(s1, s2, s3):\r\n return list(map(\"\".join, itertools.permutations([s1, s2, s3])))\r\n\r\ndef main():\r\n signs = [';', '_', '-']\r\n str1 = remove_signs(input(), signs).lower()\r\n str2 = remove_signs(input(), signs).lower()\r\n str3 = remove_signs(input(), signs).lower()\r\n n = int(input())\r\n\r\n str_permulation = get_permulation_of_strings(str1, str2, str3)\r\n for i in range(n):\r\n is_true = False\r\n str_concat = remove_signs(input(), signs).lower()\r\n\r\n for j in range(len(str_permulation)):\r\n if str_permulation[j] == str_concat:\r\n is_true = True\r\n break\r\n if is_true:\r\n print('ACC')\r\n else:\r\n print('WA')\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "s = []\r\ntot = set()\r\nfor i in range(3):\r\n line = input().lower()\r\n tmp = ''\r\n for c in line:\r\n if c.islower():\r\n tmp += c\r\n s.append(tmp)\r\nfor i in range(3):\r\n for j in range(3):\r\n for k in range(3):\r\n if i != j and j != k:\r\n tot.add(s[i] + s[j] + s[k])\r\nn = int(input())\r\nwhile n:\r\n line = input().lower()\r\n tmp = ''\r\n for c in line:\r\n if c.islower():\r\n tmp += c\r\n if tmp in tot:\r\n print('ACC')\r\n else:\r\n print('WA')\r\n n -= 1\r\n", "s=input()\r\ns=s.lower()\r\ns1=[]\r\nfor i in range(len(s)):\r\n if(s[i]>='a' and s[i]<='z'):\r\n s1.append(s[i])\r\ns1=''.join(s1)\r\ns=input()\r\ns=s.lower()\r\ns2=[]\r\nfor i in range(len(s)):\r\n if(s[i]>='a' and s[i]<='z'):\r\n s2.append(s[i])\r\ns2=''.join(s2)\r\ns=input()\r\ns=s.lower()\r\ns3=[]\r\nfor i in range(len(s)):\r\n if(s[i]>='a' and s[i]<='z'):\r\n s3.append(s[i])\r\ns3=''.join(s3)\r\nn=int(input())\r\nfor i in range(n):\r\n s=input()\r\n s=s.lower()\r\n s4=[]\r\n for j in range(len(s)):\r\n if(s[j]>='a' and s[j]<='z'):\r\n s4.append(s[j])\r\n s4=''.join(s4)\r\n if(s4==s1+s2+s3 or s4==s1+s3+s2 or s4==s2+s1+s3 or s4==s2+s3+s1 or s4==s3+s1+s2 or s4==s3+s2+s1):\r\n print(\"ACC\")\r\n else:\r\n print(\"WA\")", "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\ndef modified(s1):\r\n str1 = \"\"\r\n signs = [\"-\",\";\",\"_\"]\r\n for s in s1:\r\n if s not in signs:\r\n str1 += s\r\n return str1\r\n\r\ns1 = input().lower()\r\ns1 = modified(s1)\r\ns2 = input().lower()\r\ns2 = modified(s2)\r\ns3 = input().lower()\r\ns3 = modified(s3)\r\n\r\nvalid_ans = [s1+s2+s3,s1+s3+s2,s2+s1+s3,s2+s3+s1,s3+s1+s2,s3+s2+s1]\r\nn = iinput()\r\nfor _ in range(n):\r\n A = input().lower()\r\n A = modified(A)\r\n if A in valid_ans:\r\n print(\"ACC\")\r\n else:\r\n print(\"WA\") ", "from sys import stdin, stdout\r\nclass Solve:\r\n def string(self):\r\n tmp = ''\r\n s = stdin.readline().lower()\r\n for i in range(len(s)-1):\r\n if s[i] not in [';', '-', '_']:\r\n tmp += s[i]\r\n return tmp\r\n def __init__(self):\r\n R = stdin.readline\r\n W = stdout.write\r\n check = {}\r\n ans = []\r\n a = self.string()\r\n b = self.string()\r\n c = self.string()\r\n check[a+b+c] = check[a+c+b] = check[b+a+c] = check[b+c+a] = check[c+a+b] = check[c+b+a] = True\r\n n = int(input())\r\n for i in range(n):\r\n s = R().lower()\r\n tmp = ''\r\n flg = 0\r\n for j in range(len(s)-1):\r\n if s[j] not in [';', '-', '_']:\r\n tmp += s[j]\r\n if tmp in check:\r\n flg += 1\r\n tmp = ''\r\n ans.append('ACC' if (tmp == '' and flg == 1) else 'WA')\r\n W('\\n'.join(ans))\r\ndef main():\r\n s = Solve()\r\nmain()", "def Read(string):\r\n string = string.lower()\r\n s = \"\"\r\n for c in string:\r\n if (c != '-') and (c != ';') and (c != '_'):\r\n s += c\r\n return s\r\n\r\n\r\ndef IsOK(str, S):\r\n for string in S:\r\n if (str == string):\r\n return True\r\n return False\r\n\r\n\r\nstring = list([Read(input()) for i in range(3)])\r\nn = int(input())\r\nS = set()\r\nfor i in range(3):\r\n for j in range(3):\r\n for k in range(3):\r\n if (i != j) and (i != k) and (j != k):\r\n S.add(string[i] + string[j] + string[k])\r\nfor i in range(n):\r\n str = Read(input())\r\n if IsOK(str, S):\r\n print(\"ACC\")\r\n else:\r\n print(\"WA\")\r\n", "\n# coding: utf-8\n\n# In[ ]:\n\n\nstr1 = input()\nstr2 = input()\nstr3 = input()\nl = []\nres1 = str3 + str2 +str1\nres1= res1.replace(\";\", \"\")\nres1 = res1.replace(\"_\", \"\")\nres1 = res1.replace(\"-\", \"\")\nres1 = res1.upper()\nl.append(res1)\nres1 = str3 + str1 +str2\nres1= res1.replace(\";\", \"\")\nres1 = res1.replace(\"_\", \"\")\nres1 = res1.replace(\"-\", \"\")\nres1 = res1.upper()\nl.append(res1)\nres1 = str2 + str3 +str1\nres1= res1.replace(\";\", \"\")\nres1 = res1.replace(\"_\", \"\")\nres1 = res1.replace(\"-\", \"\")\nres1 = res1.upper()\nl.append(res1)\nres1 = str2 + str1 +str3\nres1= res1.replace(\";\", \"\")\nres1 = res1.replace(\"_\", \"\")\nres1 = res1.replace(\"-\", \"\")\nres1 = res1.upper()\nl.append(res1)\nres1 = str1 + str2 +str3\nres1= res1.replace(\";\", \"\")\nres1 = res1.replace(\"_\", \"\")\nres1 = res1.replace(\"-\", \"\")\nres1 = res1.upper()\nl.append(res1)\nres1 = str1 + str3 +str2\nres1= res1.replace(\";\", \"\")\nres1 = res1.replace(\"_\", \"\")\nres1 = res1.replace(\"-\", \"\")\nres1 = res1.upper()\nl.append(res1)\nn = int(input())\nfor i in range(n):\n ans = input()\n ans = ans.replace(\";\", \"\")\n ans = ans.replace(\"_\", \"\")\n ans = ans.replace(\"-\", \"\")\n ans = ans.upper()\n if ans in l:\n print('ACC')\n else:\n print(\"WA\")\n", "def convert(s):\r\n r = s.replace(';', '')\r\n r = r.replace('-', '')\r\n r = r.replace('_', '')\r\n r = r.lower()\r\n return r\r\n\r\ns1 = convert(input())\r\ns2 = convert(input())\r\ns3 = convert(input())\r\nn = int(input())\r\ncat = [s1+s2+s3, s1+s3+s2, s2+s1+s3, s2+s3+s1, s3+s1+s2, s3+s2+s1]\r\nfor i in range(n):\r\n s = convert(input())\r\n if s in cat:\r\n print('ACC')\r\n else:\r\n print('WA')\r\n\r\n\r\n", "def remove_and_lowcase(s):\r\n\tans = []\r\n\ts = s.lower()\r\n\t\r\n\tfor i in range(len(s)):\r\n\t\tif not s[i].isalpha():\r\n\t\t\tcontinue\r\n\t\telse:\r\n\t\t\tans.append(s[i])\r\n\r\n\treturn ''.join(ans)\r\n\r\ns1 = input().strip()\r\ns2 = input().strip()\r\ns3 = input().strip()\r\n\r\nn = int(input())\r\n\r\nl = []\r\n\r\nl.append(remove_and_lowcase(s1) + remove_and_lowcase(s2) + remove_and_lowcase(s3))\r\nl.append(remove_and_lowcase(s1) + remove_and_lowcase(s3) + remove_and_lowcase(s2))\r\nl.append(remove_and_lowcase(s2) + remove_and_lowcase(s1) + remove_and_lowcase(s3))\r\nl.append(remove_and_lowcase(s2) + remove_and_lowcase(s3) + remove_and_lowcase(s1))\r\nl.append(remove_and_lowcase(s3) + remove_and_lowcase(s1) + remove_and_lowcase(s2))\r\nl.append(remove_and_lowcase(s3) + remove_and_lowcase(s2) + remove_and_lowcase(s1))\r\n\r\n\r\nfor i in range(n):\r\n\tst = input().strip()\r\n\tif (remove_and_lowcase(st) in l):\r\n\t\tprint(\"ACC\")\r\n\telse:\r\n\t\tprint(\"WA\")\r\n\r\n", "def format_str(string):\r\n tmp = ''\r\n for i in string:\r\n if i == '_' or i == ';' or i == '-':\r\n continue\r\n tmp += i\r\n return tmp.lower()\r\n\r\nfirst = format_str(input())\r\nsecond = format_str(input())\r\nthird = format_str(input())\r\n\r\nwishes = [first+second+third, first+third+second, second+first+third, second+third+first, third+first+second, third+second+first]\r\n\r\nn = int(input())\r\n\r\nfor _ in range(n):\r\n tmp = format_str(input())\r\n if tmp in wishes:\r\n print('ACC')\r\n else:\r\n print('WA')\r\n", "# http://codeforces.com/problemset/problem/61/B\n# B. Hard Work\nSIGNS = ['_', ';', '-']\n\n\ndef read_input():\n inits = [input() for _ in range(3)]\n n = int(input())\n answers = [input() for _ in range(n)]\n return (inits, n, answers)\n\n\ndef do_concatenate(inits, answer):\n inits.sort(key=len, reverse=True)\n i = 0\n while i < len(inits):\n init_str = inits[i]\n # print('1: ', inits)\n # print('2: ', answer)\n # print('3: ', init_str)\n if init_str == answer[:len(init_str)]:\n answer = answer[len(init_str):]\n inits = inits[:i] + inits[i + 1:]\n i = 0\n else:\n i += 1\n # print(inits)\n return len(inits) == 0\n\n\ndef main():\n inits, n, answers = read_input()\n cleaned_inits = [[c.lower() for c in list(s) if c not in SIGNS] for s in inits]\n for answer in answers:\n answer = [c.lower() for c in list(answer) if c not in SIGNS]\n result = do_concatenate(cleaned_inits, answer)\n print(\"ACC\") if result else print(\"WA\")\n\n\nif __name__ == '__main__':\n main()\n # print(do_concatenate())\n", "s1=input()\r\ns2=input()\r\ns3=input()\r\ns11='';s22='';s33=''\r\nm=[';','_','-']\r\np=[]\r\nfor i in range(len(s1)):\r\n if s1[i] not in m:\r\n s11=s11+s1[i]\r\ns11=s11.lower()\r\nfor i in range(len(s2)):\r\n if s2[i] not in m:\r\n s22=s22+s2[i]\r\ns22=s22.lower()\r\nfor i in range(len(s3)):\r\n if s3[i] not in m:\r\n s33=s33+s3[i]\r\ns33=s33.lower()\r\nc1=s11+s22+s33\r\nc2=s11+s33+s22\r\nc3=s22+s11+s33\r\nc4=s22+s33+s11\r\nc5=s33+s22+s11\r\nc6=s33+s11+s22\r\nc=[c1,c2,c3,c4,c5,c6]\r\nn=int(input())\r\nfor i in range(n):\r\n x=input()\r\n x1=''\r\n for j in range(len(x)):\r\n if x[j] not in m:\r\n x1=x1+x[j]\r\n x11=x1.lower()\r\n if x11 in c:\r\n p.append('ACC')\r\n else:\r\n p.append('WA')\r\nfor i in range(len(p)):\r\n print(p[i])", "def removeSigns(s):\r\n news = \"\"\r\n for i in s:\r\n if i in \"_-;\":\r\n continue\r\n if i >= 'A' and i <= 'Z':\r\n news += chr(ord(i) + 32)\r\n else:\r\n news += i\r\n return news\r\n\r\na = removeSigns(input());aa = len(a)\r\nb = removeSigns(input());bb = len(b)\r\nc = removeSigns(input());cc = len(c)\r\nconcats = [ a+b+c, a+c+b, b+a+c, b+c+a, c+a+b, c+b+a]\r\nT = int(input())\r\nans = []\r\nfor _ in range(T):\r\n t = removeSigns(input())\r\n if t in concats:\r\n ans.append(\"ACC\")\r\n else:\r\n ans.append(\"WA\")\r\n\r\nfor i in ans:\r\n print(i)\r\n", "A = []\nfor i in range(3):\n a = str(input().upper())\n for i in ['_', '-', ';']:\n a = a.replace(i,'')\n \n A.append(a)\nB = []\nc = 0\nd = 0\nfor i in range(3):\n c = i-1\n d = i-2\n B.append(A[i] + A[c] + A[d])\n B.append(A[i] + A[d] + A[c])\n \nn = int(input())\n\nfor i in range(n):\n tx = str(input().upper())\n for i in ['_', '-', ';']:\n tx = tx.replace(i,'')\n if tx in B:\n print('ACC')\n else:\n print('WA')\n\n\t\t\t \t \t \t\t \t\t\t \t\t \t\t \t\t\t \t", "s1 = input().lower().replace(';', '').replace('_','').replace('-','')\r\ns2 = input().lower().replace(';', '').replace('_','').replace('-','')\r\ns3 = input().lower().replace(';', '').replace('_','').replace('-','')\r\n\r\nn = int(input())\r\n\r\nfor _ in range(n):\r\n s4 = input().lower().replace(';', '').replace('_','').replace('-','')\r\n if s1+s2+s3 ==s4 or s1+s3+s2== s4 or s2+s1+s3 == s4 or s2+s3+s1==s4 or s3+s1+s2 == s4 or s3+s2+s1==s4:\r\n print('ACC')\r\n else:\r\n print('WA')\r\n", "s1=input()\r\ns2=input()\r\ns3=input()\r\nns1,ns2,ns3='','',''\r\nfor i in range(len(s1)):\r\n if(s1[i]!='-' and s1[i]!='_' and s1[i]!=';'):\r\n ns1+=s1[i].lower()\r\nfor i in range(len(s2)):\r\n if(s2[i]!='-' and s2[i]!='_' and s2[i]!=';'):\r\n ns2+=s2[i].lower()\r\nfor i in range(len(s3)):\r\n if(s3[i]!='-' and s3[i]!='_' and s3[i]!=';'):\r\n ns3+=s3[i].lower()\r\n\r\nn=int(input())\r\nfor i in range(n):\r\n s=input()\r\n ns=''\r\n for i in range(len(s)):\r\n if(s[i]!='-' and s[i]!='_' and s[i]!=';'):\r\n ns+=s[i].lower()\r\n if(ns==ns1+ns2+ns3 or ns==ns1+ns3+ns2 or ns==ns2+ns1+ns3 or ns==ns2+ns3+ns1 or ns==ns3+ns1+ns2 or ns==ns3+ns2+ns1):\r\n print(\"ACC\")\r\n else:\r\n print(\"WA\")\r\n", "import sys\nimport re\nx = re.sub(\"[^a-zA-Z]\", \"\", sys.stdin.readline()[:-1]).lower()\ny = re.sub(\"[^a-zA-Z]\", \"\", sys.stdin.readline()[:-1]).lower()\nz = re.sub(\"[^a-zA-Z]\", \"\", sys.stdin.readline()[:-1]).lower()\n\nperms = [(x + y + z), (x + z + y), (y + x + z), (y + z + x), (z + x + y), (z + y + x)]\n\nn = int(sys.stdin.readline()[:-1])\nfor i in range(n):\n\tsw = re.sub(\"[^a-zA-Z]\", \"\", sys.stdin.readline()[:-1]).lower()\n\tif(sw in perms):\n\t\tprint(\"ACC\")\n\telse:\n\t\tprint(\"WA\")\n\t \t \t\t\t \t\t \t \t \t\t \t\t \t \t\t\t", "string=list();list_strings=[]\r\nfor _ in range(3):\r\n str1=input()\r\n string.append(str1.replace('-','').replace(';','').replace('_','').replace(' ','').upper())\r\nlist_strings.append(string[0]+string[1]+string[2])\r\nlist_strings.append(string[1]+string[0]+string[2])\r\nlist_strings.append(string[0]+string[2]+string[1])\r\nlist_strings.append(string[2]+string[0]+string[1])\r\nlist_strings.append(string[1]+string[2]+string[0])\r\nlist_strings.append(string[2]+string[1]+string[0])\r\nn=int(input())\r\nfor _ in range(n):\r\n query=input().replace('-','').replace(';','').replace('_','').replace(' ','').upper()\r\n if query in list_strings:print(\"ACC\")\r\n else:print(\"WA\")", "import sys\nimport re\nimport itertools\ndef fast_input():\n return sys.stdin.readline().rstrip('\\n')\ndef fast_print(thing, end='\\n'):\n sys.stdout.write(str(thing) + end)\n\ndef main():\n # C - Hard Work\n word1 = re.sub('[^A-Za-z0-9]+', '', fast_input()).lower()\n word2 = re.sub('[^A-Za-z0-9]+', '', fast_input()).lower()\n word3 = re.sub('[^A-Za-z0-9]+', '', fast_input()).lower()\n # make a set of all permutations\n perms = itertools.permutations([word1, word2, word3])\n sols = []\n for p in perms:\n sols.append(''.join(p))\n n = int(fast_input())\n for _ in range(n):\n case = re.sub('[^A-Za-z0-9]+', '', fast_input()).lower()\n if case in sols:\n fast_print(\"ACC\")\n else:\n fast_print(\"WA\")\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", "a=input()\nb=input()\nc=input()\nbad_chars=['-',';','_']\nfor i in bad_chars:\n a=a.replace(i, '')\n b=b.replace(i, '')\n c=c.replace(i, '')\na=a.lower()\nb=b.lower()\nc=c.lower()\nstr1=a+b+c\nstr2=a+c+b\nstr3=b+a+c\nstr4=b+c+a\nstr5=c+a+b\nstr6=c+b+a\nlst=[str1, str2, str3, str4, str5, str6]\nn=int(input())\nfor i in range(n):\n x=input()\n for i in bad_chars:\n x=x.replace(i, '')\n x=x.lower()\n if(x in lst):\n print(\"ACC\")\n else:\n print(\"WA\")\n \t\t \t \t\t\t\t \t\t \t \t \t\t\t\t\t\t\t\t\t\t", "a = input()\r\nb = input()\r\nc = input()\r\nn = int(input())\r\nz = [input().lower() for i in range(n)]\r\ng = []\r\n\r\n\r\ndef zxc(x):\r\n if ';' in x:\r\n x = x.split(';')\r\n x = ''.join(x)\r\n if '-' in x:\r\n x = x.split('-')\r\n x = ''.join(x)\r\n if '_' in x:\r\n x = x.split('_')\r\n x = ''.join(x)\r\n return x.lower()\r\n\r\n\r\na = zxc(a)\r\nb = zxc(b)\r\nc = zxc(c)\r\ng.append(a + b + c)\r\ng.append(a + c + b)\r\ng.append(b + a + c)\r\ng.append(b + c + a)\r\ng.append(c + a + b)\r\ng.append(c + b + a)\r\nfor i in z:\r\n if zxc(i) in g:\r\n print('ACC')\r\n else:\r\n print('WA')", "a = (input())\nb = input()\nc = input()\na1 = \"\"\nb1 = \"\"\nc1 = \"\"\nfor i in range(len(a)):\n if a[i] == '-' or a[i] == ';' or a[i] == '_':\n continue\n a1 += a[i]\n\nfor i in range(len(b)):\n if b[i] == '-' or b[i] == ';' or b[i] == '_':\n continue\n b1 += b[i]\n\nfor i in range(len(c)):\n if c[i] == '-' or c[i] == ';' or c[i] == '_':\n continue\n c1 += c[i]\na1 = a1.lower()\nb1 = b1.lower()\nc1 = c1.lower()\n\nn = int(input())\nfor i in range(n):\n a = input()\n a2 = \"\"\n for i in range(len(a)):\n if a[i] == '-' or a[i] == ';' or a[i] == '_':\n continue\n a2 += a[i]\n a2 = a2.lower()\n if a2 == (a1 + b1 + c1) or a2 == (a1 + c1 + b1) or a2 == (b1 + a1 + c1) or a2 == (b1 + c1 + a1) or a2 == (c1 + a1 + b1) or a2 == (c1 + b1 + a1):\n print(\"ACC\")\n else:\n print(\"WA\")\n \n\n \n\n \t \t \t\t\t\t \t \t\t \t \t \t", "from itertools import permutations\r\n\r\ndef normalizeString(s):\r\n s1 = \"\"; \r\n for ch in s:\r\n if ch.isalpha():\r\n s1 = s1 + ch.lower()\r\n return s1\r\n\r\ninitial_string = []\r\ntotal_len = 0\r\nperms = list(permutations([1,2,3]))\r\n\r\nfor i in range(3):\r\n initial_string.append(normalizeString(input()))\r\nconcatStrings = [] \r\nfor perm in perms:\r\n concatString = \"\"\r\n for i in perm:\r\n concatString += initial_string[i -1]\r\n concatStrings.append(concatString)\r\n\r\nn = int(input())\r\nfor i in range(n):\r\n s = normalizeString(input())\r\n if s in concatStrings:\r\n print(\"ACC\")\r\n else:\r\n print(\"WA\")\r\n\r\n", "a = input().lower()\r\na = a.replace('_','')\r\na = a.replace('-','')\r\na = a.replace(';','')\r\nb = input().lower()\r\nb = b.replace('_','')\r\nb = b.replace('-','')\r\nb = b.replace(';','')\r\nc = input().lower()\r\nc = c.replace('_','')\r\nc = c.replace('-','')\r\nc = c.replace(';','')\r\nn = int(input())\r\nfor i in range(n):\r\n s = input().lower()\r\n s = s.replace('_','')\r\n s = s.replace('-','')\r\n s = s.replace(';','')\r\n if a+b+c == s or a+c+b == s or b+a+c == s or b+c+a == s or c+a+b == s or c+b+a == s:\r\n print('ACC')\r\n else:\r\n print('WA')\r\n\r\n", "def r(s):\r\n return ''.join([i for i in s.lower() if i not in '_-;'])\r\na, b, c = r(input()), r(input()), r(input())\r\nimport itertools\r\nl = list(map(lambda x: ''.join(x), list(itertools.permutations([a, b, c]))))\r\nfor i in range(int(input())):\r\n print('ACC' if r(input()) in l else 'WA')\r\n ", "r=lambda :input().replace(\"_\",\"\").replace(\";\",\"\").replace(\"-\",\"\").lower()\r\na,b,c=r(),r(),r()\r\nfor _ in \" \"*int(input()):\r\n z=r()\r\n if a+b+c==z or a+c+b==z or b+a+c==z or b+c+a==z or c+a+b==z or c+b+a==z:print(\"ACC\")\r\n else:print(\"WA\")", "signs = [\"-\", \";\", \"_\"]\na = input().lower()\nb = input().lower()\nc = input().lower()\nfor i in signs:\n a = a.replace(i,'')\n b = b.replace(i,'')\n c = c.replace(i,'')\nansOK = [a+b+c,a+c+b,b+a+c,b+c+a,c+a+b,c+b+a]\nfor _ in range(int(input())):\n s = input().lower()\n for i in signs:\n s = s.replace(i,'')\n if s in ansOK:\n print('ACC')\n else:\n print('WA')\n\n", "a = []\r\nfor _ in range(3):\r\n\ts = input()\r\n\ts = ''.join(s.replace('_', ''))\r\n\ts = ''.join(s.replace(';', ''))\r\n\ts = ''.join(s.replace('-', ''))\r\n\ta.append(s)\r\na, b, c = a\r\na = a.lower(); b = b.lower(); c = c.lower()\r\nfor _ in range(int(input())):\r\n\tx = input().lower()\r\n\t\r\n\tif ('_' in x): x = ''.join(x.replace('_', ''))\r\n\tif (';' in x): x = ''.join(x.replace(';', ''))\r\n\tif ('-' in x): x = ''.join(x.replace('-', ''))\r\n\r\n\tif (a + b + c == x or a + c + b == x or b + c + a == x or b + a + c == x or c + b + a == x or c + a + b == x): print('ACC')\r\n\telse: print('WA')\r\n\r\n#norm govnocode", "def convert(s):\n res = s.replace(';','')\n res = res.replace('-','')\n res = res.replace('_','')\n res = res.lower()\n return res\n\nx = convert(input())\ny = convert(input())\nz = convert(input())\n\ncat = [x + y + z, x + z + y, y + x + z, y + z + x, z + x + y, z + y + x]\n\nn = int(input())\n\nfor _ in range(n):\n s = convert(input())\n print(\"ACC\" if s in cat else \"WA\")", "string1 = input().replace(\";\", \"\").replace(\"-\", \"\").replace(\"_\", \"\").lower()\r\nstring2 = input().replace(\";\", \"\").replace(\"-\", \"\").replace(\"_\", \"\").lower()\r\nstring3 = input().replace(\";\", \"\").replace(\"-\", \"\").replace(\"_\", \"\").lower()\r\n\r\n_ = int(input())\r\n\r\nfor i in range(_):\r\n student = input().replace(\";\", \"\").replace(\"-\", \"\").replace(\"_\", \"\").lower()\r\n if student == string1 + string2 + string3:\r\n print(\"ACC\")\r\n elif student == string1 + string3 + string2:\r\n print(\"ACC\")\r\n elif student == string2 + string1 + string3:\r\n print(\"ACC\")\r\n elif student == string2 + string3 + string1:\r\n print(\"ACC\")\r\n elif student == string3 + string1 + string2:\r\n print(\"ACC\")\r\n elif student == string3 + string2 + string1:\r\n print(\"ACC\")\r\n else:\r\n print(\"WA\")", "def convert(s):\r\n r = s.replace(';','')\r\n r = r.replace('-','')\r\n r = r.replace('_','')\r\n r = r.lower()\r\n return r\r\n \r\ns1 = convert(input())\r\ns2 = convert(input())\r\ns3 = convert(input())\r\nn = int(input())\r\ncat = [s1+s2+s3,s1+s3+s2,s2+s1+s3,s2+s3+s1,s3+s1+s2,s3+s2+s1]\r\n \r\nfor i in range(n):\r\n s = convert(input())\r\n if s in cat:\r\n print(\"ACC\")\r\n else:\r\n print(\"WA\")", "def clean(s):\r\n return ''.join([x for x in s.lower() if (x not in \";-_\")])\r\n \r\na = clean(input())\r\nb = clean(input())\r\nc = clean(input())\r\n \r\nopts = [a + b + c, a + c + b, b + a + c, b + c + a, c + a + b, c + b + a]\r\nT = int(input())\r\nfor _ in range(T):\r\n test = clean(input())\r\n print(\"ACC\" if test in opts else \"WA\")", "def bubu(n):\r\n return ''.join([i for i in n.lower() if i not in [';','-','_']])\r\na = bubu(input())\r\nb = bubu(input())\r\nc = bubu(input())\r\nl = [a+b+c,a+c+b,b+a+c,b+c+a,c+a+b,c+b+a]\r\nn = int(input())\r\nfor i in range(0,n):\r\n if bubu(input()) in l:\r\n print('ACC')\r\n else:\r\n print('WA')\r\n", "word1 = input().lower()\nword1 = word1.replace(\";\", \"\").replace(\"-\", \"\").replace(\"_\", \"\")\n\nword2 = input().lower()\nword2 = word2.replace(\";\", \"\").replace(\"-\", \"\").replace(\"_\", \"\")\n\nword3 = input().lower()\nword3 = word3.replace(\";\", \"\").replace(\"-\", \"\").replace(\"_\", \"\")\n\npossibilities = [word1+word2+word3, word3+word2+word1, word2+word1+word3, word3+word1+word2, word1+word3+word2, word2+word3+word1]\n\nn = int(input())\n\nfor i in range(n):\n current = input().lower()\n current = current.replace(\";\", \"\").replace(\"-\", \"\").replace(\"_\", \"\")\n if current in possibilities:\n print(\"ACC\")\n else:\n print(\"WA\")\n \t \t\t \t \t \t \t\t \t\t\t\t\t\t\t\t", "def no(a):\r\n return ''.join([x for x in a.lower() if (x not in \";-_\")])\r\n \r\na=no(input())\r\nb=no(input())\r\nc=no(input())\r\nn=int(input())\r\nopt=[a+b+c,a+c+b,b+c+a,b+a+c,c+b+a,c+a+b]\r\nfor i in range(0,n):\r\n k=no(input())\r\n print(\"ACC\" if k in opt else \"WA\")\r\n", "a=input()\r\nb=input()\r\nc=input()\r\na.lower()\r\nb.lower()\r\nc.lower()\r\nan=''\r\nbn=''\r\ncn=''\r\nfor i in range(len(a)):\r\n\tif((a[i]>='a' and a[i]<='z') or (a[i]>='A' and a[i]<='Z')):\r\n\t\tan+=a[i]\r\nfor i in range(len(b)):\r\n\tif((b[i]>='a' and b[i]<='z') or (b[i]>='A' and b[i]<='Z')):\r\n\t\tbn+=b[i]\r\nfor i in range(len(c)):\r\n\tif((c[i]>='a' and c[i]<='z' ) or (c[i]>='A' and c[i]<='Z')):\r\n\t\tcn+=c[i]\r\nans1=an.lower()+bn.lower()+cn.lower()\r\nans2=bn.lower()+cn.lower()+an.lower()\r\nans3=cn.lower()+an.lower()+bn.lower()\r\nans4=bn.lower()+an.lower()+cn.lower()\r\nans5=an.lower()+cn.lower()+bn.lower()\r\nans6=cn.lower()+bn.lower()+an.lower()\r\nn=int(input())\r\nfor i in range(n):\r\n\tst=input()\r\n\tstn=''\r\n\tfor i in range(len(st)):\r\n\t\tif((st[i]>='a' and st[i]<='z') or (st[i]>='A' and st[i]<='Z')):\r\n\t\t\tstn+=st[i]\r\n\tif(stn.lower()==ans1 or stn.lower()==ans2 or stn.lower()==ans3 or stn.lower()==ans4 or stn.lower()==ans5 or stn.lower()==ans6):\r\n\t\tprint('ACC')\r\n\telse:\r\n\t\tprint('WA')", "def deleteSign(s):\r\n res = \"\"\r\n for x in s:\r\n if x.isalpha():\r\n x = x.upper()\r\n res += x\r\n return res\r\n\r\na = input()\r\nb = input()\r\nc = input()\r\nn = int(input())\r\na = deleteSign(a)\r\nb = deleteSign(b)\r\nc = deleteSign(c)\r\nabc = a + b + c\r\nacb = a + c + b\r\nbac = b + a + c\r\nbca = b + c + a\r\ncab = c + a + b\r\ncba = c + b + a;\r\nfor i in range(n):\r\n s = input()\r\n s = deleteSign(s)\r\n if s == abc or s == acb or s == bac or s == bca or s == cab or s == cba:\r\n print(\"ACC\")\r\n else:\r\n print(\"WA\")\r\n", "def clean(s):\r\n return ''.join(ch.lower() if ch.isalpha() else '' for ch in s)\r\na, b, c = (clean(input()) for i in range(3))\r\nw = {a + b + c, a + c + b, b + a + c, b + c + a, c + a + b, c + b + a}\r\nfor i in range(int(input())):\r\n print('ACC' if clean(input()) in w else 'WA')", "def rmv(ch):\r\n a=\"\"\r\n for i in range (len(ch)):\r\n if ch[i]!=\"-\" and ch[i]!=\"_\" and ch[i]!=\";\":\r\n a=a+(ch[i].upper())\r\n return a\r\ncases=[]\r\nch1=input()\r\nch1=rmv(ch1)\r\nch2=input()\r\nch2=rmv(ch2)\r\nch3=input()\r\nch3=rmv(ch3)\r\ncases.append(ch1+ch2+ch3)\r\ncases.append(ch3+ch2+ch1)\r\ncases.append(ch2+ch1+ch3)\r\ncases.append(ch3+ch1+ch2)\r\ncases.append(ch2+ch3+ch1)\r\ncases.append(ch1+ch3+ch2)\r\nn=int(input())\r\nfor i in range (n):\r\n ch1=input()\r\n ch1=rmv(ch1)\r\n if ch1 in cases:\r\n print (\"ACC\")\r\n else :\r\n print (\"WA\")\r\n", "a=input()\r\nb=input()\r\nc=input()\r\na=a.replace(\"-\",\"\")\r\na=a.replace(\"_\",\"\")\r\na=a.replace(\";\",\"\")\r\n\r\nb=b.replace(\"-\",\"\")\r\nb=b.replace(\"_\",\"\")\r\nb=b.replace(\";\",\"\")\r\n\r\nc=c.replace(\"-\",\"\")\r\nc=c.replace(\"_\",\"\")\r\nc=c.replace(\";\",\"\")\r\n\r\na=a.lower()\r\nb=b.lower()\r\nc=c.lower()\r\nfor i in range(int(input())):\r\n\ts=input()\r\n\ts=s.replace(\"-\",\"\")\r\n\ts=s.replace(\"_\",\"\")\r\n\ts=s.replace(\";\",\"\")\r\n\ts=s.lower()\r\n\tif s==a+b+c or s==b+c+a or s==c+a+b or s==a+c+b or s==b+a+c or s==c+b+a:\r\n\t\tprint(\"ACC\")\r\n\telse:\r\n\t\tprint(\"WA\")\r\n", "def hard_work():\r\n s = []\r\n answ = []\r\n for _ in range(3):\r\n s.append([x.lower() for x in input() if x != '_' and x != ';' and x != '-'])\r\n n = int(input())\r\n for _ in range(n):\r\n answ.append([x.lower() for x in input() if x != '_' and x != ';' and x != '-'])\r\n a = s[0] + s[1] + s[2]\r\n b = s[0] + s[2] + s[1]\r\n c = s[1] + s[0] + s[2]\r\n d = s[1] + s[2] + s[0]\r\n e = s[2] + s[1] + s[0]\r\n f = s[2] + s[0] + s[1]\r\n for i in answ:\r\n if i == a or i == b or i == c or i == d or i == e or i == f:\r\n print('ACC')\r\n else:\r\n print('WA')\r\n\r\n\r\nif __name__ == '__main__':\r\n hard_work()\r\n", "import sys, re\r\n\r\ninput = sys.stdin.readline\r\n\r\ndef p(s):\r\n return re.sub(r\"([_;-])+\", \"\", s).lower()\r\n\r\na = [p(input().strip(\"\\n\")) for i in range(3)]\r\nfor _ in range(int(input())):\r\n st = input().strip('\\n')\r\n st = p(st)\r\n print(\"ACC\" if a[0] + a[1] + a[2] == st or a[0] + a[2] + a[1] == st or a[1] + a[0] + a[2] == st or a[1] + a[2] + a[0] == st or a[2] + a[0] + a[1] == st or a[2] + a[1] + a[0] == st else \"WA\")", "from collections import Counter\r\n \r\ndef cleanup(s):\r\n return \"\".join([item.lower() for item in s if item.isalpha()])\r\n \r\ns1 = cleanup(input())\r\ns2 = cleanup(input())\r\ns3 = cleanup(input())\r\n \r\n \r\nn = int(input())\r\nfor test in range(n):\r\n st = cleanup(input())\r\n \r\n c1 = Counter(st)\r\n c2 = Counter(s1 + s2 + s3)\r\n \r\n if c1 != c2:\r\n print(\"WA\")\r\n continue\r\n \r\n sorted_strings = sorted([s1, s2, s3], key = len)\r\n \r\n if sorted_strings[2] in st:\r\n st = st.split(sorted_strings[2])\r\n else:\r\n print(\"WA\")\r\n continue\r\n \r\n if sorted_strings[1] in st[0]:\r\n st += st[0].split(sorted_strings[1])\r\n st = st[1:]\r\n \r\n elif sorted_strings[1] in st[1]:\r\n last = st.pop()\r\n st += last.split(sorted_strings[1])\r\n \r\n else:\r\n print(\"WA\")\r\n continue\r\n \r\n if sorted_strings[0] in st:\r\n print(\"ACC\")\r\n else:\r\n print(\"WA\")", "import re\ndef sub(s): return re.sub('[-_;]', '', s).lower()\ns1, s2, s3, n, a = sub(input()), sub(input()), sub(input()), int(input()), []\npossible = [s1+s2+s3, s1+s3+s2, s2+s1+s3, s2+s3+s1, s3+s1+s2, s3+s2+s1]\nfor i in range(n):\n print('ACC' if sub(input()) in possible else 'WA')", "signs = [\";\",\"_\",\"-\"]\r\n\r\ndef fomalize_string(input_string):\r\n\tnew_string = \"\"\r\n\tfor character in input_string:\r\n\t\tif character not in signs:\r\n\t\t\tnew_string = new_string + character\r\n\t\r\n\tnew_string = new_string.lower()\r\n\treturn new_string\r\n\t\t\t\r\ninitial_inputs = []\t\r\nall_posible_combinations = []\r\n\t\r\nfor _ in range(3):\r\n\tnew_row = input()\r\n\tnew_row = fomalize_string(new_row)\r\n\tinitial_inputs.append(new_row)\r\n\r\nfor index in range(3):\r\n\tfirst_combination = initial_inputs[index%3] + initial_inputs[(index+1)%3] + initial_inputs[(index+2)%3]\r\n\tsecond_combination = initial_inputs[index%3] + initial_inputs[(index+2)%3] + initial_inputs[(index+1)%3]\r\n\tall_posible_combinations.extend([first_combination, second_combination])\r\n\r\nnumber_of_answers = int(input())\r\nfeed_backs = []\r\n\r\nfor _ in range(number_of_answers):\r\n\tnew_answer = input()\r\n\tnew_answer = fomalize_string(new_answer)\r\n\tif new_answer in all_posible_combinations:\r\n\t\tfeed_backs.append(\"ACC\")\r\n\telse:\r\n\t\tfeed_backs.append(\"WA\")\r\n\t\t\r\nprint(*feed_backs, sep=\"\\n\")", "def cl(s):\r\n a=\"\"\r\n for c in s.lower():\r\n if c>='a' and c<='z':\r\n a+=c\r\n return a\r\na,b,c=cl(input()),cl(input()),cl(input())\r\nfor _ in range(int(input())):\r\n x=cl(input())\r\n if a+b+c==x or b+a+c==x or b+c+a==x or a+c+b==x or c+b+a==x or c+a+b==x:\r\n print(\"ACC\")\r\n else:\r\n print(\"WA\")\r\n", "s1 = input().replace('_','').replace(';', '').replace('-','').lower()\r\ns2 = input().replace('_','').replace(';', '').replace('-', '').lower()\r\ns3 = input().replace('_','').replace(';', '').replace('-', '').lower()\r\n\r\narr= [s1+s2+s3, s2+s3+s1, s3+s1+s2, s2+s1+s3, s3+s2+s1, s1+s3+s2]\r\n \r\n \r\n \r\nfor i in range(int(input())):\r\n\ts = input().replace('_','').replace(';', '').replace('-','').lower()\r\n\tx = 0\r\n\tfor i in arr:\r\n\t\tif s == i:\r\n\t\t\tx = 1\r\n\t\t\tbreak\r\n\tif x:\r\n\t\tprint('ACC')\r\n\telse:\r\n\t\tprint('WA')\r\n\r\n\t", "a = input().strip().replace(\";\",\"\").replace(\"_\",\"\").replace(\"-\",\"\")\r\nb = input().strip().replace(\";\",\"\").replace(\"_\",\"\").replace(\"-\",\"\")\r\nc = input().strip().replace(\";\",\"\").replace(\"_\",\"\").replace(\"-\",\"\")\r\n\r\na = a.lower()\r\nb = b.lower()\r\nc = c.lower()\r\n\r\nfor i in range(int(input().strip())):\r\n s = input().strip().replace(\";\",\"\").replace(\"_\",\"\").replace(\"-\",\"\")\r\n s = s.lower()\r\n #print(len(a+b+c) , len(s),a+b+c,s)\r\n \r\n if len(a+b+c) == len(s):\r\n if s in [a+b+c, a+c+b, b+a+c ,b+c+a ,c+b+a ,c+a+b]:\r\n print(\"ACC\")\r\n else:\r\n print(\"WA\")\r\n else:\r\n print(\"WA\")\r\n ", "def convert(s):\n return ''.join(ch.lower() if ch.isalpha() else '' for ch in s)\n\nx = convert(input())\ny = convert(input())\nz = convert(input())\n\ncat = [x + y + z, x + z + y, y + x + z, y + z + x, z + x + y, z + y + x]\n\nn = int(input())\n\nfor _ in range(n):\n s = convert(input())\n print(\"ACC\" if s in cat else \"WA\")", "str = []\r\nfor _ in range(3):\r\n str.append(input().replace('_','').replace(';','').replace('-','').lower())\r\nright_answer=[]\r\nright_answer.append(str[0]+str[1]+str[2])\r\nright_answer.append(str[0]+str[2]+str[1])\r\nright_answer.append(str[1]+str[0]+str[2])\r\nright_answer.append(str[1]+str[2]+str[0])\r\nright_answer.append(str[2]+str[1]+str[0])\r\nright_answer.append(str[2]+str[0]+str[1])\r\n\r\nnum_students=int(input())\r\nanswers = []\r\nfor i in range (num_students):\r\n answers.append(input().replace('_','').replace(';','').replace('-','').lower()) \r\n\r\nfor ans in answers:\r\n acc = False\r\n for right_ans in right_answer:\r\n if ans == right_ans:\r\n acc = True\r\n break\r\n \r\n if acc:\r\n print('ACC')\r\n else:\r\n print('WA')\r\n \r\n \r\n \r\n\r\n\r\n", "import sys\r\n\r\nsys.setrecursionlimit(100000)\r\n\r\n# global constant\r\nINF = int(1e7 + 1)\r\nMAX = 105\r\n\r\n# For testing\r\n#sys.stdin = open(\"INP.txt\", 'r')\r\n\r\n\r\n# sys.stdout = open(\"OUT.txt\", 'w')\r\n\r\ndef preprocessing(s):\r\n res = ''\r\n for ch in s:\r\n if ch.isalpha():\r\n res+=ch.lower()\r\n return res\r\n\r\n\r\ndef main():\r\n a = preprocessing(input())\r\n b = preprocessing(input())\r\n c = preprocessing(input())\r\n l = [a+b+c, a+c+b, b+a+c, b+c+a, c+a+b, c+b+a]\r\n n = int(input())\r\n for _ in range(n):\r\n query = preprocessing(input())\r\n if query in l:\r\n print('ACC')\r\n else:\r\n print('WA')\r\n\r\nmain()\r\n", "A=str(input())\r\nB=str(input())\r\nC=str(input())\r\na=\"\"; b=\"\"; c=\"\";\r\nfor _ in range(len(A)):\r\n if(A[_]!=\"_\" and A[_]!=\";\" and A[_]!=\"-\"):\r\n a+=A[_]\r\nfor _ in range(len(B)):\r\n if(B[_]!=\"_\" and B[_]!=\";\" and B[_]!=\"-\"):\r\n b+=B[_]\r\nfor _ in range(len(C)):\r\n if(C[_]!=\"_\" and C[_]!=\";\" and C[_]!=\"-\"):\r\n c+=C[_]\r\na=a.lower(); b=b.lower(); c=c.lower();\r\nlis=[a+b+c,a+c+b,b+a+c,b+c+a,c+a+b,c+b+a]\r\n#print(lis)\r\nfor _ in range(int(input())):\r\n S=str(input())\r\n s=\"\"\r\n for _ in range(len(S)):\r\n if(S[_]!=\"_\" and S[_]!=\";\" and S[_]!=\"-\"):\r\n s+=S[_]\r\n s=s.lower()\r\n if s in lis:\r\n print(\"ACC\")\r\n else:\r\n print(\"WA\")", "from itertools import permutations\nteacher_string = []\nfor i in range(3):\n temp = \"\"\n teacher_string.append(input().strip())\n for i in teacher_string[-1]:\n if i.isalpha():\n temp = temp + i if i.islower() else temp + i.lower()\n teacher_string[-1] = temp\n\nn = int(input().strip())\nstudent_string = []\nfor i in range(n):\n temp = \"\"\n student_string.append(input().strip())\n for i in student_string[-1]:\n if i.isalpha():\n temp = temp + i if i.islower() else temp + i.lower()\n student_string[-1] = temp\nperm = permutations(teacher_string)\nl_perm = list(perm)\nfor string in student_string:\n yes = \"WA\"\n for ch in l_perm:\n ch = ''.join(ch)\n if string == ch:\n yes = \"ACC\"\n print(yes)", "import itertools\r\n\r\nstrings = []\r\n\r\nfor i in range(3):\r\n\ts = input().lower()\r\n\ts = s.replace(\"_\", \"\")\r\n\ts = s.replace(\";\", \"\")\r\n\ts = s.replace(\"-\", \"\")\r\n\tstrings.append(s)\r\n\r\nn = int(input())\r\n\r\nright = list(itertools.permutations(strings, 3))\r\nright = [''.join(text) for text in right]\r\n\r\nfor i in range(n):\r\n\ts = input().lower()\r\n\ts = s.replace(\"_\", \"\")\r\n\ts = s.replace(\";\", \"\")\r\n\ts = s.replace(\"-\", \"\")\r\n\tif s in right:\r\n\t\tprint(\"ACC\")\r\n\telse:\r\n\t\tprint(\"WA\")", "def main():\r\n\ts1 = str(input())\r\n\ts2 = str(input())\r\n\ts3 = str(input())\r\n\r\n\ts1, s2, s3 = s1.lower(), s2.lower(), s3.lower()\r\n\ts1, s2, s3 = s1.replace('-', ''), s2.replace('-', ''), s3.replace('-', '')\r\n\ts1, s2, s3 = s1.replace(';', ''), s2.replace(';', ''), s3.replace(';', '')\r\n\ts1, s2, s3 = s1.replace('_', ''), s2.replace('_', ''), s3.replace('_', '')\r\n\r\n\tn = int(input())\r\n\r\n\tans = [s1 + s2 + s3, s1 + s3 + s2, s2 + s1 + s3, s2 + s3 + s1, s3 + s1 + s2, s3 + s2 + s1]\r\n\tans = set(ans)\r\n\r\n\tfor _ in range(n):\r\n\t\tt = str(input())\r\n\t\tt = t.lower()\r\n\t\tt = t.replace('-', '')\r\n\t\tt = t.replace(';', '')\r\n\t\tt = t.replace('_', '')\r\n\r\n\t\tif t in ans:\r\n\t\t\tprint('ACC')\r\n\t\telse:\r\n\t\t\tprint('WA')\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "a=str(input())\r\nb=str(input())\r\nc=str(input())\r\n\r\na=a.replace(\"_\",\"\")\r\na=a.replace(\"-\",\"\")\r\na=a.replace(\";\",\"\")\r\nb=b.replace(\"_\",\"\")\r\nb=b.replace(\"-\",\"\")\r\nb=b.replace(\";\",\"\")\r\nc=c.replace(\"_\",\"\")\r\nc=c.replace(\"-\",\"\")\r\nc=c.replace(\";\",\"\")\r\n\r\na=a.lower()\r\nb=b.lower()\r\nc=c.lower()\r\n\r\n\r\nn=int(input())\r\nfor i in range(n):\r\n s=str(input())\r\n s=s.replace(\"_\",\"\")\r\n s=s.replace(\"-\",\"\")\r\n s=s.replace(\";\",\"\")\r\n s=s.lower()\r\n\r\n if s==a+b+c or s==a+c+b or s==b+a+c or s==b+c+a or s==c+a+b or s==c+b+a:\r\n print(\"ACC\")\r\n else:\r\n print(\"WA\")\r\n", "def xoa(s):\r\n return ''.join([x for x in s.lower() if x not in '-_;'])\r\na=xoa(input())\r\nb=xoa(input())\r\nc=xoa(input())\r\ntohop=[a+b+c, a+c+b, b+a+c, b+c+a, c+a+b, c+b+a]\r\nfor _ in range(int(input())):\r\n print('ACC' if xoa(input()) in tohop else 'WA')\r\n", "\r\nimport re\r\ndef trimkrde(s):\r\n s=re.sub(';','',s)\r\n s=re.sub('-','',s)\r\n s=re.sub('_','',s)\r\n return s\r\n \r\n\r\na=input().rstrip()\r\nb=input().rstrip()\r\nc=input().rstrip()\r\na=trimkrde(a)\r\nb=trimkrde(b)\r\nc=trimkrde(c)\r\na=a.lower()\r\nb=b.lower()\r\nc=c.lower()\r\ns1=[a+b+c,a+c+b,b+c+a,b+a+c,c+a+b,c+b+a]\r\nn=int(input())\r\nfor i in range(n):\r\n s=input().rstrip()\r\n \r\n s=trimkrde(s)\r\n s=s.lower()\r\n if s in s1:\r\n print('ACC')\r\n else:\r\n print('WA')\r\n", "def wc(a):\r\n a = [i for i in a.lower()]\r\n while '_' in a:\r\n a.remove('_')\r\n while ';' in a:\r\n a.remove(';')\r\n while '-' in a:\r\n a.remove('-')\r\n return ''.join(a)\r\n\r\naa = [wc(input()) for _ in range(3)]\r\n# print(aa)\r\nbb = [aa[0]+aa[1]+aa[2], aa[0]+aa[2]+aa[1], aa[1]+aa[0]+aa[2], aa[1]+aa[2]+aa[0], aa[2]+aa[0]+aa[1], aa[2]+aa[1]+aa[0]]\r\n# print(bb)\r\nn = int(input())\r\n\r\nfor i in range(n):\r\n b = wc(input())\r\n # print(b)\r\n if b in bb:\r\n print(\"ACC\") \r\n else:\r\n print('WA')\r\n \r\n", "a=str(input()).replace(\";\",\"\").replace(\"-\",\"\").replace(\"_\",\"\").lower()\r\nb=str(input()).replace(\";\",\"\").replace(\"-\",\"\").replace(\"_\",\"\").lower()\r\nc=str(input()).replace(\";\",\"\").replace(\"-\",\"\").replace(\"_\",\"\").lower()\r\nd=[]\r\nd.append(a+b+c)\r\nd.append(a+c+b)\r\nd.append(b+a+c)\r\nd.append(b+c+a)\r\nd.append(c+b+a)\r\nd.append(c+a+b)\r\nfor i in range(int(input())):\r\n x=str(input()).replace(\";\",\"\").replace(\"-\",\"\").replace(\"_\",\"\").lower()\r\n r=0\r\n for j in range(len(d)):\r\n\r\n if d[j]==x:\r\n break\r\n r+=1\r\n if(r==len(d)):\r\n print(\"WA\")\r\n else:\r\n print(\"ACC\")" ]

[ "import sys \r\nsolSaved = {} #diccionario donde se almacenan los divisores de un numero x, se toma como llave un string y se devuelve una lista\r\nsolSavedPropios = {} #diccionario donde se almacenan los divisores propios de un numero x, se toma como llave un string y se devuelve una lista\r\n\r\ndef DivisorsN(n): # n es un numero entero del cual se va obtener sus divisores\r\n key = solSaved.get(str(n)) # para saber si los divisore ya se han buscado con anterioridad y no tener que buscarlos nuevamente\r\n if key == None : \r\n divisors = [] # en esta lista se almacenan los divisores desde 1 hasta la raiz de n\r\n divisors2 = [] # en esta lista se almacenan los divisores desde raiz de n + 1 hasta n\r\n for i in range(1,int(n ** (1/2)) + 1): \r\n if n % i == 0 : \r\n if abs(i - (n/i)) < 10 ** (-7) : divisors.append(int(i)) # para saber si el divisor es la raiz y ponerlo una sola vez\r\n else : \r\n divisors = divisors + [int(i)]\r\n divisors2 = [int(n/i)] + divisors2\r\n divisors = divisors + divisors2 # concatenando todos los divisores\r\n solSaved[str(n)] = divisors.copy() # guardando los divisores ya obtenidos\r\n return divisors\r\n return key\r\n\r\ndef DivisorsPropios(n) : \r\n key = solSavedPropios.get(str(n)) # para saber si los divisore ya se han buscado con anterioridad y no tener que buscarlos nuevamente\r\n if key == None : \r\n divisors = [] # en esta lista se almacenan los divisores desde 1 hasta la raiz de n\r\n divisors2 = [] # en esta lista se almacenan los divisores desde raiz de n + 1 hasta n\r\n for i in range(2,int(n ** (1/2)) + 1): \r\n if n % i == 0 : \r\n if abs(i - (n/i)) < 10 ** (-7) : divisors.append(int(i)) # para saber si el divisor es la raiz y ponerlo una sola vez\r\n else : \r\n divisors = divisors + [int(i)]\r\n divisors2 = [int(n/i)] + divisors2\r\n divisors = divisors + divisors2 # concatenando todos los divisores\r\n solSavedPropios[str(n)] = divisors.copy() # guardando los divisores ya obtenidos\r\n return divisors\r\n return key\r\n\r\ndef DivisorsXk(x, k) : # x es el valor del cual se quieren obtener los divisores y k es el nivel de profundidad, es decir que tantos divisores de divisores de los divisores... de los divisores de x se quiere obtener\r\n if x == 1 : return 1 \r\n if k == 0 : return x\r\n if k == 1 : return DivisorsN(x) \r\n if k >= 10 ** 5 : # si el k > 10 a la 5, significa que al menos los primeros 10 a la 5 divisores van a ser el 1, y como solo se quiere saber los primeros 10 a la 5 elementos, entonces directamente se devuelve 10 a la 5 unos\r\n a = []\r\n for i in range(10 ** 5) : a.append(1)\r\n return a\r\n Unos = []\r\n sol = []\r\n sol.append(1) # como el 1 es divisor de todos los numeros, y 1 es el divisor natural mas pequeño que hay, luego todos los divisores van a empzar con 1 \r\n actualDivisors = DivisorsPropios(x).copy() \r\n for i in range(k - 1) : Unos.append(1) \r\n if len(actualDivisors) == 0 : return [1] + Unos + [x] # Si x no tiene divisores propios, eso significa q la solucion va a ser los k unos mas x \r\n actualDivisors.append(x) \r\n for t in range(len(actualDivisors)) : \r\n if len(sol) >= 10 ** 5 : return sol # Si ya tengo los primeros 10 a la 5 elementos no hay necesidad de seguir buscando, ya que solo hacen falta los 10 a la 5 elementos\r\n newDivisorsPropios = DivisorsPropios(actualDivisors[t]).copy() # esto es para saber si uno de los divisores a su vez tiene divisores, en caso de q no tenga la solucion se genera poniendo k-1 unos, y luego el divisor, luego k - 2 unos y luego el divisor y as sucesivamente hasta llegar a k = 0\r\n if len(newDivisorsPropios) == 0 : \r\n next = DivisorsXk(actualDivisors[t], k - 1) \r\n if type(next) == int : sol = sol + [next] \r\n else : sol = sol + next \r\n else : sol = sol + InsideDivisorsXk(actualDivisors[t], k - 1) \r\n return sol \r\n\r\ndef InsideDivisorsXk(x, k) : # este metodo es parecido al anterior, pero este mas especificamente, sirve como complemento con el anterior, para que entre los dos, si un divisor a su vez tiene divisores, formar adecuadamente la solucion, ya que por cada divisor que tenga un divisor, se tiene q buscar un orden menor de por cada divisor de divisor que un numero.. y asi hasta q el divisor de divisor de divisor... no tenga divisores o hasta q el k >= 0\r\n actualDivisors = DivisorsPropios(x) \r\n i = k - 1 \r\n sol = [] \r\n while i >= 1 : \r\n if len(sol) >= 10**5 : return sol \r\n sol = sol + [1] \r\n for t in range(len(actualDivisors)) : \r\n next = DivisorsXk(actualDivisors[t], i) \r\n if type(next) == int : sol = sol + [next] \r\n else : sol = sol + next \r\n i -= 1 \r\n return sol + DivisorsN(x) \r\n\r\ndef Ejercicio448E() : \r\n a, b = input().split()\r\n x = int(a)\r\n k = int(b)\r\n sol = DivisorsXk(x,k)\r\n if type(sol) == int : print(sol)\r\n else : \r\n if(len(sol) >= 10 ** 5):\r\n for i in range(10 ** 5 - 1) : \r\n sys.stdout.write(str(sol[i]) + ' ')\r\n sys.stdout.write(str(sol[10**5 - 1]))\r\n else : \r\n for i in range(len(sol) - 1) : \r\n sys.stdout.write(str(sol[i]) + ' ')\r\n sys.stdout.write(str(sol[len(sol) - 1]))\r\n\r\n# print(Ejercicio448E())\r\nEjercicio448E()\r\n\r\n#print(DivisorsXk(100000000000,1))\r\n#print(DivisorsXk(10,3))\r\n#print(DivisorsXk(1221231,0))\r\n#print(DivisorsXk(1111111111111,2))\r\n#print(DivisorsXk(4,3))\r\n#print(DivisorsXk(4,3))\r\n#print(DivisorsXk(4,3))\r\n#print(DivisorsXk(4,3))\r\n#print(DivisorsXk(4,3))\r\n\r\n" ]

[ "def editDistance(s, t):\r\n sl = len(s)\r\n tl = len(t)\r\n for i in range(tl + 1):\r\n dp[0][i] = i\r\n for i in range(sl + 1):\r\n dp[i][0] = i\r\n\r\n for i in range(1, sl + 1):\r\n for j in range(1, tl + 1):\r\n if s[i - 1] == t[j - 1]:\r\n dp[i][j] = dp[i - 1][j - 1]\r\n else:\r\n dp[i][j] = min(dp[i - 1][j], dp[i][j - 1], dp[i - 1][j - 1]) + 1\r\n \r\n return dp[-1][-1]\r\ndef trace(s, t):\r\n n = len(s)\r\n m = len(t)\r\n while n > 0 and m > 0:\r\n if s[n - 1] == t[m - 1]:\r\n n -= 1\r\n m -= 1\r\n else: \r\n if dp[n - 1][m - 1] == dp[n][m] - 1:\r\n print('REPLACE', n, t[m - 1])\r\n n -= 1\r\n m -= 1\r\n elif dp[n - 1][m] == dp[n][m] - 1:\r\n print('DELETE', n)\r\n n -= 1\r\n else:\r\n print('INSERT', n + 1, t[m - 1])\r\n m -= 1\r\n while m > 0:\r\n print('INSERT', 1, t[m - 1])\r\n m -= 1\r\n while n > 0:\r\n print('DELETE', n)\r\n n -= 1\r\ndef solve():\r\n s = input()\r\n t = input() \r\n global dp \r\n dp = [[0]*(len(t) + 1) for _ in range(len(s) + 1)]\r\n print(editDistance(s, t))\r\n trace(s, t)\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n\r\n" ]

[ "s=input()\r\ni=len(s)-1\r\n\r\nif(s.find(\"C\")==0 and s[i-8:]==(\"ODEFORCES\")):\r\n print(\"YES\")\r\nelif(s.find(\"CO\")==0 and s[i-7:]==(\"DEFORCES\")):\r\n print(\"YES\")\r\nelif(s.find(\"COD\")==0 and s[i-6:]==(\"EFORCES\")):\r\n print(\"YES\")\r\nelif(s.find(\"CODE\")==0 and s[i-5:]==(\"FORCES\")):\r\n print(\"YES\")\r\nelif(s.find(\"CODEF\")==0 and s[i-4:]==(\"ORCES\")):\r\n print(\"YES\")\r\nelif(s.find(\"CODEFO\")==0 and s[i-3:]==(\"RCES\")):\r\n print(\"YES\")\r\nelif(s.find(\"CODEFOR\")==0 and s[i-2:]==(\"CES\")):\r\n print(\"YES\")\r\nelif(s.find(\"CODEFORC\")==0 and s[i-1:]==(\"ES\")):\r\n print(\"YES\")\r\nelif(s.find(\"CODEFORCE\")==0 and s[i]==(\"S\")):\r\n print(\"YES\")\r\nelif(s.find(\"CODEFORCES\")==0 or s[i-9:]==\"CODEFORCES\"):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "\r\n# Problem: A. Cutting Banner\r\n# Contest: Codeforces - Codeforces Round #300\r\n# URL: https://codeforces.com/contest/538/problem/A\r\n# Memory Limit: 256 MB\r\n# Time Limit: 2000 ms\r\n# Powered by CP Editor (https://github.com/cpeditor/cpeditor)\r\n\r\nfrom sys import stdin\r\ndef get_ints(): return list(map(int, stdin.readline().strip().split()))\r\n\r\nt = \"CODEFORCES\"\r\ns = input()\r\nn = len(s)\r\nfor i in range(n):\r\n\tfor j in range(n+1):\r\n\t\tif s[:i]+s[j:] == t:\r\n\t\t\tprint(\"YES\")\r\n\t\t\texit()\r\n\t\t\t\r\nprint(\"NO\")\r\n\t\t", "l=input()\r\ns='CODEFORCES'\r\nfor i in range(11):\r\n if(l.startswith(s[:i]) and l.endswith(s[i:])):\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "word = input()\nneed,result = \"CODEFORCES\",\"NO\"\nfor i in range(len(need)+1):\n\tif word.startswith(need[:i]) and word.endswith(need[i:]):\n\t\tresult = \"YES\"\n\t\tbreak\nprint(result)\n\t \t \t\t \t\t\t \t \t\t\t \t\t\t \t\t", "a = input()\r\nn = len(a)\r\nb = \"CODEFORCES\"\r\nif n < 10:\r\n print(\"NO\")\r\n\r\nelse:\r\n xd = 0\r\n ch = 0\r\n for i in range(10):\r\n if b[i] == a[i]:\r\n xd+=1\r\n else:\r\n break\r\n for j in range(10):\r\n if b[10-j-1] == a[n-j-1]:\r\n ch+=1\r\n else:\r\n break\r\n\r\n print(\"YES\" if xd+ch>9 else \"NO\")\r\n\r\n\r\n", "str = input()\ntest_str = \"CODEFORCES\"\nif len(str) <= len(test_str):\n\tprint(\"NO\")\nelse:\n\tl = 0\n\tr = len(test_str) - 1\n\n\twhile l < len(test_str) and test_str[l] == str[l]:\n\t\tl += 1\n\t\n\twhile r >= 0 and test_str[r] == str[len(str) - len(test_str) + r]:\n\t\tr -= 1\n\n\tif r >= l :\n\t\tprint(\"NO\")\n\telse:\n\t\tprint(\"YES\")\n\n\t\t \t\t\t \t \t \t \t\t\t\t\t \t\t", "strInp = input()\r\nif len(strInp) < 10:\r\n print('NO')\r\n exit()\r\n\r\nval = 'CODEFORCES'\r\ncnt = 0\r\n\r\nif strInp.find(val) != -1:\r\n if strInp[:len(val)] == val or strInp[-len(val):] == val:\r\n print('YES')\r\n exit()\r\n\r\nfor letter in strInp:\r\n if val[cnt] == letter:\r\n cnt += 1\r\n else:\r\n print('YES') if strInp[-(len(val) - cnt):] == val[-(len(val) - cnt):] else print('NO')\r\n exit()", "def main():\r\n s = input()\r\n\r\n for i in range(len(s)):\r\n for j in range(i + 1, len(s) + 1):\r\n if s[:i] + s[j:] == \"CODEFORCES\":\r\n print(\"YES\")\r\n return\r\n else:\r\n print(\"NO\")\r\n\r\nmain()", "s = input()\r\nc = 'CODEFORCES'\r\nfor i in range(len(c) + 1):\r\n if s.startswith(c[:i]) and s.endswith(c[i:]):\r\n print('YES')\r\n quit()\r\nprint('NO')", "s = input()\r\nt = \"CODEFORCES\"\r\nif s[:10] == t or s[-10:] == t:\r\n\tprint(\"YES\")\r\n\texit(0)\r\nfor i in range(1, len(t)):\r\n\t#print(t[:i], t[i:])\r\n\t#print(t[:i], s[:len(t[:i])], t[i:], s[-len(t[i:]):])\r\n\t#print(s.index(t[:i]), s.index(t[i:]))\r\n\tif t[:i] == s[:len(t[:i])] and t[i:] == s[-len(t[i:]):]:\r\n\t\tprint(\"YES\")\r\n\t\texit(0)\r\nprint(\"NO\")", "def head(string, size):\r\n return string[:size]\r\n\r\ndef tail(string, size):\r\n return string[len(string) - size:]\r\n\r\ndef found_slice(template, string):\r\n\r\n template_len = len(template)\r\n string_len = len(string)\r\n\r\n if string_len < template_len:\r\n return False\r\n\r\n if head(string, template_len) == template:\r\n return True\r\n\r\n if tail(string, template_len) == template:\r\n return True\r\n\r\n for index in range(1, template_len):\r\n template_head = head(template, index)\r\n template_tail = tail(template, template_len - index)\r\n string_head = head(string, index)\r\n string_tail = tail(string, template_len - index)\r\n\r\n # # Debug\r\n # print('{:s} {:s}'.format(template_head, template_tail))\r\n # print('{:s} {:s}'.format(string_head, string_tail))\r\n # print()\r\n\r\n if string_head == template_head and string_tail == template_tail:\r\n return True\r\n\r\n return False\r\n\r\ntemplate = 'CODEFORCES'\r\nstring = input()\r\nif found_slice(template, string):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s=input()\r\nc='CODEFORCES'\r\nprint('NYOE S'[(any(s.startswith(c[:i]) and s.endswith(c[i:]) for i in range(11)))::2])", "\r\ns=input()\r\nt=\"CODEFORCES\"\r\nf=0\r\nfor i in range(len(s)):\r\n for j in range(i,len(s)+1):\r\n \tif s[:i]+s[j:]==t:\r\n \t\tf=1\r\n \t\tbreak\r\nif f:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "InputString = input()\r\nans = False\r\nif InputString.startswith('CODEFORCES') or InputString.startswith('CODEFORCES'):\r\n ans = True\r\nfor i in range(len(InputString)):\r\n for j in range(len(InputString)):\r\n if InputString[:i]+InputString[j:]=='CODEFORCES':\r\n ans = True\r\nif ans:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "def main(s):\r\n key = \"CODEFORCES\"\r\n for i in range(11):\r\n s1 = key[0:i]\r\n s2 = key[i:10]\r\n if s.startswith(s1) and s.endswith(s2):\r\n return 'YES'\r\n return 'NO'\r\n\r\nif __name__ == '__main__':\r\n s = input()\r\n print(main(s))\r\n", "s = input()\r\nans = False\r\nn = len(s)\r\nfor i in range(n):\r\n for j in range(i + 1, n):\r\n if s[:i] + s[j:] == 'CODEFORCES':\r\n ans = True\r\n break\r\n if ans:\r\n break\r\nif s[:10] == 'CODEFORCES':\r\n ans = True\r\n\r\nif ans:\r\n print('YES')\r\nelse:\r\n print('NO')", "import re\r\ntemplate = \"CODEFORCES\"\r\nllt = len(template)\r\nss = input()\r\nlls = len(ss)\r\nl = []\r\nr = []\r\nif ss==\"CODEFORCES\":\r\n\tprint(\"YES\")\r\nelif len(ss)>len(template):\r\n\tfor i in range(llt+1):\r\n\t\tl = ss[:i]\r\n\t\tr = ss[lls-llt+i:]\r\n\t\t#print(r)\r\n\t\tif l+r==template:\r\n\t\t\tprint(\"YES\")\r\n\t\t\texit(0)\r\nprint(\"NO\")", "t = 'CODEFORCES'\r\n\r\ns = input()\r\n\r\nfor i in range(len(s)):\r\n for j in range(i, len(s) + 1):\r\n if ''.join((s[:i], s[j:])) == t:\r\n print('YES')\r\n exit()\r\nprint('NO')\r\n", "def is_cut_possible(word: str) -> bool:\n # Check CODEFORCES is found in the end of the string\n if word[:10] == 'CODEFORCES':\n return True\n if word[-10: ] == 'CODEFORCES':\n return True\n \n # check two partiton of the word which is the first i characters and the last 10-i characters.\n code = 'CODEFORCES'\n for i in range(1, 10):\n if word[:i] == code[:i] and word[i-10:] == code[i-10:]:\n return True\n return False\ns = input()\nprint(\"YES\" if is_cut_possible(s) else \"NO\")\n", "import sys\r\ns=input()\r\nw=\"CODEFORCES\"\r\nn=len(s)\r\nfor i in range(n):\r\n for j in range(i,n):\r\n g=s[:i]+s[j+1:]\r\n if(g==w):\r\n print(\"YES\")\r\n sys.exit()\r\nprint(\"NO\")", "s = input()\n\nn = len(s)\ngood = False\nfor i in range(n):\n for j in range(i + 1, n + 1):\n if s[:i] + s[j:] == 'CODEFORCES':\n good = True\n\nprint('YES' if good else 'NO')\n", "s = input()\r\nn = len(s)\r\nans = False\r\nfor i in range(n):\r\n for j in range(i + 1, n + 1):\r\n if s[:i] + s[j:] == \"CODEFORCES\":\r\n ans = True\r\nif ans:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def Doable(p, s):\r\n if len(s) <= len(p):\r\n return False\r\n if s.startswith(p) or s.endswith(p):\r\n return True\r\n for i in range(1, len(p)):\r\n if s.startswith(p[: i]) and s.endswith(p[i: ]):\r\n return True\r\n return False\r\n\r\np = 'CODEFORCES'\r\ns = input()\r\nprint('YES' if Doable(p, s) else 'NO')\r\n", "s = input()\nprint (['NO','YES'][any([s[:i]+s[j+1:]=='CODEFORCES' for i in range(len(s)) for j in range(i, len(s))])])\n \t\t \t\t\t \t\t\t\t \t\t\t\t\t \t \t", "s = input()\r\nc = 'CODEFORCES'\r\nprint(\"YES\" if any(s.startswith(c[:i]) and s.endswith(c[i:]) for i in range(len(c) + 1)) else \"NO\")", "def main():\r\n s = input()\r\n n = len(s)\r\n for i in range(n):\r\n for j in range(i + 1, n + 1):\r\n t = s[:i] + s[j:]\r\n if t == \"CODEFORCES\":\r\n print(\"YES\")\r\n return\r\n print(\"NO\")\r\n return\r\n\r\nmain()\r\n\r\n\r\n \r\n \r\n", "from fnmatch import fnmatch, fnmatchcase\r\npat =[\"*CODEFORCES\", \"C*ODEFORCES\", \"CO*DEFORCES\"\r\n,\"COD*EFORCES\"\r\n,\"CODE*FORCES\"\r\n,\"CODEF*ORCES\"\r\n,\"CODEFO*RCES\"\r\n,\"CODEFOR*CES\"\r\n,\"CODEFORC*ES\"\r\n,\"CODEFORCE*S\"\r\n,\"CODEFORCES*\"]\r\nname = input()\r\nok = 0\r\nfor s in pat:\r\n if fnmatch(name,s):\r\n print(\"YES\")\r\n ok = 1\r\n break\r\nif ok == 0:\r\n print(\"NO\")\r\n", "s = input()\n\nres = False\nfor l in range(len(s)):\n for r in range(l + 1, len(s) + 1):\n if s[:l] + s[r:] == 'CODEFORCES':\n res = True\n\nif res:\n print(\"YES\")\nelse:\n print(\"NO\")\n \n", "s = input()\r\nstrn = 'CODEFORCES'\r\nn = 0\r\nl = len(s)\r\nif l>=10:\r\n for i in range(10):\r\n if s[i]!=strn[i]:\r\n break\r\n n += 1\r\n if s[l-(10-n):]==strn[n:]:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')\r\n\r\n\r\n# CODEWAITFORITFORCES", "s = input()\nn = len(s)\nans = \"NO\"\nfor i in range(n):\n for j in range(i, n + 1):\n if s[:i] + s[j:] == \"CODEFORCES\":\n ans = \"YES\"\n\nprint(ans)\n \n", "s = input()\r\ns1 = \"CODEFORCES\"\r\nfor i in range(len(s1)):\r\n num1 = s.find(s1[:i+1])\r\n num2 = s.find(s1[i+1:])\r\n #print()\r\n #print(s1[:i+1]+' '+s1[i+1:])\r\n #print(num1)\r\n if num1 < num2:\r\n #print(str(num1)+' '+s1[-(len(s1)-i)+1:]+' '+s[-(len(s1)-i)+1:]+' '+str(i))\r\n if (num1 == 0) and (s1[-(len(s1)-i)+1:] == s[-(len(s1)-i)+1:]):\r\n #print(1)\r\n print(\"YES\")\r\n exit() \r\n #else:\r\nif s1 == s[:len(s1)] :\r\n #print(2)\r\n print(\"YES\")\r\n exit()\r\nelif s1 == s[-len(s1):]:\r\n #print(3)\r\n print(\"YES\") \r\n exit() \r\nprint(\"NO\")", "s, t = 'CODEFORCES', input().strip()\nprint('YES' if any(s[:i] == t[:i] and s[i:] == t[len(t) - len(s) + i:] for i in range(len(s) + 1)) else 'NO')\n", "def solve(word):\r\n banner = \"CODEFORCES\"\r\n\r\n for c in word:\r\n if c == banner[0]:\r\n banner = banner[1:]\r\n if len(banner) == 0:\r\n return True\r\n else:\r\n break\r\n\r\n for c in word[::-1]:\r\n if c == banner[-1]:\r\n banner = banner[:-1]\r\n if len(banner) == 0:\r\n return True\r\n else:\r\n break\r\n return False\r\n\r\nimport sys\r\nword = sys.stdin.read().strip()\r\nif solve(word) == True:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "string = input()\r\nn = len(string)\r\nanswer = \"NO\"\r\nfor i in range(n):\r\n for j in range(i + 1, n + 1):\r\n s = string[:i] + string[j:]\r\n if s == \"CODEFORCES\":\r\n answer = \"YES\"\r\nprint(answer)", "s=input()\r\nans = 'NO'\r\nfor i in range(len(s)):\r\n\tfor j in range(len(s)-i+1):\r\n\t\tif s[:j]+s[j+i:] == 'CODEFORCES':\r\n\t\t\tans = 'YES'\r\n\t\t\tbreak\r\nprint(ans)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = input()[:-1]\r\nn = len(s)\r\nx = 'CODEFORCES'\r\ns1 = s[::-1]\r\nx1 = x[::-1]\r\n\r\na = ''\r\nb = ''\r\nfor i in range(min(10, n)):\r\n if x[i] == s[i]:\r\n a += s[i]\r\n else:\r\n break\r\nfor i in range(min(10, n)):\r\n if x1[i] == s1[i]:\r\n b += s1[i]\r\n else:\r\n break\r\n\r\nb = b[::-1]\r\nif a == x or b == x:\r\n print('YES')\r\nelse:\r\n a1 = len(a)\r\n b1 = len(b)\r\n if a1 <= b1:\r\n if a + b[max(0, b1-(10-a1)):] == x:\r\n print('YES')\r\n else:\r\n print('NO')\r\n else:\r\n if a[:(10-b1)] + b == x:\r\n print('YES')\r\n else:\r\n print('NO')", "def main():\n s, x = input(), 0\n for a, b in zip(\"CODEFORCES*\", s):\n if a == b:\n x += 1\n else:\n break\n for a, b in zip(\"SECROFEDOC*\", reversed(s)):\n if a == b:\n x += 1\n else:\n break\n print((\"NO\", \"YES\")[x > 9])\n\n\nif __name__ == '__main__':\n main()", "x = input()\r\nif len(x) < 10:\r\n print(\"NO\")\r\nelse:\r\n if ((x[0:1] == \"C\") and (x[len(x) - 9:len(x)] == \"ODEFORCES\")) or ((x[0:2] == \"CO\") and (x[len(x) - 8:len(x)] == \"DEFORCES\")) or ((x[0:3] == \"COD\") and (x[len(x) - 7:len(x)] == \"EFORCES\")) or ((x[0:4] == \"CODE\") and (x[len(x) - 6:len(x)] == \"FORCES\")) or ((x[0:5] == \"CODEF\") and (x[len(x) - 5:len(x)] == \"ORCES\")) or ((x[0:6] == \"CODEFO\") and (x[len(x) - 4:len(x)] == \"RCES\")) or ((x[0:7] == \"CODEFOR\") and (x[len(x) - 3:len(x)] == \"CES\")) or ((x[0:8] == \"CODEFORC\") and (x[len(x) - 2:len(x)] == \"ES\")) or ((x[0:9] == \"CODEFORCE\") and (x[len(x) - 1:len(x)] == \"S\")) or ((x[0:10] == \"CODEFORCES\") or (x[len(x) - 10:len(x)] == \"CODEFORCES\")):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "s = input()\r\nc = 'CODEFORCES'\r\nif len(s)<10:\r\n from sys import exit\r\n print('NO');exit()\r\nif s[:10]==c:print('YES')\r\nelif s[-10:]==c:print('YES')\r\nelse:\r\n k=0\r\n for i in range(1,10):\r\n if s[:i]+s[-10+i:]==c:\r\n print('YES');k=1;break\r\n if k==0:print('NO')", "import re\r\n \r\nt, s, ignore = \"CODEFORCES\", input(), \".*\"\r\nfor _ in range(len(t) + 1):\r\n pat = ''.join(['^', t[:_], '.*', t[_:], '$'])\r\n if re.match(pat, s):\r\n print(\"YES\")\r\n exit(0)\r\nprint(\"NO\")", "a = \"CODEFORCES\"\nok = False\ns = input()\nfor i in range(len(a)+1):\n if s.startswith(a[:i]) and s.endswith(a[i:]):\n ok = True\n break\nif ok == 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", "s = input()\n\nif s == \"CODEFORCES\":\n print('YES')\n exit()\n\nl = len(s)\nfor i in range(l):\n for j in range(l):\n if l - (j-i+1) == 10:\n tmp = \"\"\n for k in range(l):\n if k < i or k > j:\n tmp = tmp + s[k]\n if tmp == \"CODEFORCES\":\n print('YES')\n exit()\nprint('NO')\n\n", "s = input()\r\nok = \"CODEFORCES\"\r\nfor i in range(0,len(s)):\r\n for j in range(i+1,len(s)+1):\r\n if s[:i]+s[j:] == ok:\r\n print(\"YES\")\r\n exit(0)\r\nprint(\"NO\")\r\n", "S = 'CODEFORCES'\r\n\r\ns = input()\r\nfor i in range(len(S) + 1):\r\n if s.startswith(S[:i]) and s.endswith(S[i:]):\r\n print('YES')\r\n exit()\r\nprint('NO')\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\ntarget = \"CODEFORCES\"\r\ns = input().strip()\r\n\r\nif s == target:\r\n print(\"YES\")\r\nelse:\r\n n = len(s)\r\n m = len(target)\r\n lcp = 0\r\n while lcp < n and lcp < m and s[lcp] == target[lcp]:\r\n lcp += 1\r\n lcs = 0\r\n while lcs < n and lcs < m and s[n-lcs-1] == target[m-lcs-1]:\r\n lcs += 1\r\n if lcp + lcs >= m:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "def cf(s):\n for i in range(len(s)):\n x=s\n for j in range(i,len(s)):\n if x[0:i]+x[j+1:len(s)]=='CODEFORCES':return \"YES\"\n return \"NO\"\nprint(cf(input()))", "s = input()\r\nn = len(s)\r\nans = \"NO\"\r\nfor i in range(n):\r\n for j in range(i, n):\r\n if s[:i] + s[j + 1:] == \"CODEFORCES\":\r\n ans = \"YES\"\r\nprint(ans)", "S=input()\r\na='CODEFORCES'\r\nc=1\r\nfor i in range(len(S)) :\r\n for j in range(i,len(S)+1) :\r\n if S[:i]+S[j:]==a :\r\n c=0\r\n \r\n break\r\n if c==0 :\r\n break\r\nif c==0 :\r\n print('YES')\r\nelse :\r\n print('NO')\r\n", "a = input()\nb = \"CODEFORCES\"\nif a[:len(b)] == b or a[-len(b):] == b:\n\tprint(\"YES\")\nelse:\n\tfor x in range(len(b)):\n\t\tif a[x-len(b):] == b[x:] and a[:x] == b[:x]:\n\t\t\tprint(\"YES\")\n\t\t\tbreak\n\telse:\n\t\tprint(\"NO\")\n\n\n\t\t\t\t\t\t \t \t \t \t\t \t\t\t\t \t \t\t \t", "s=input()\r\ns1=len(s)\r\nl=['C','O','D','E','F','O','R','C','E','S']\r\nl1=len(l)\r\ni=0\r\nj=0\r\nm=0\r\nk=1\r\nif(s[0]!=l[0]):\r\n while(k<=l1):\r\n if(s[-k]==l[-k]):\r\n m+=1\r\n else:\r\n print(\"NO\")\r\n break\r\n k+=1\r\n if(m==l1):\r\n print(\"YES\")\r\nelse:\r\n while(i<s1):\r\n if(s[i]==l[j] and s1>=l1):\r\n m+=1\r\n j+=1\r\n if(m==l1):\r\n print(\"YES\")\r\n break\r\n else:\r\n while(1):\r\n if(s[-k]==l[-k]):\r\n k+=1\r\n m+=1\r\n else:\r\n print(\"NO\")\r\n break\r\n if(m==l1):\r\n print(\"YES\")\r\n break\r\n break\r\n i+=1\r\n", "# generate all substrings.\n\ndata = input()\npattern = 'CODEFORCES'\nstop = False\n\nfor i in range(len(data)):\n for j in range(i, len(data)):\n prefix, suffix = data[:i], data[j + 1:]\n if prefix + suffix == pattern:\n stop = True\n break\n\n if stop:\n break\n\nif stop:\n print('YES')\nelse:\n print('NO')", "import sys\r\nfin = sys.stdin\r\ns = fin.readline()\r\ns = s[:(len(s) - 1)]\r\nf = 'CODEFORCES'\r\ni = 0\r\nwhile i < len(s) and i < len(f) and f[i] == s[i]:\r\n i += 1\r\nj = 0\r\nwhile j < len(s) and j < len(f) and f[len(f) - j - 1] == s[len(s) - j - 1]:\r\n j += 1\r\nif i + j >= len(f):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s = input()\r\nres = 'NO'\r\nfor i in range(len(s)):\r\n for j in range(i, len(s)):\r\n w = s[0:i] + s[j+1:]\r\n if w == 'CODEFORCES':\r\n res = 'YES'\r\nprint(res)\r\n", "s = input()\na = 'CODEFORCES'\n\nleft = max([i+1 if a[:i+1] == s[:i+1] else 0 for i in range(len(a))])\nright = max([i+1 if a[-i-1:] == s[-i-1:] else 0 for i in range(len(a))])\n\nprint('YES' if left + right >= len(a) else 'NO')", "s=input()\r\nif len(s)<10:\r\n print(\"NO\")\r\nelse:\r\n t='CODEFORCES'\r\n k=-1\r\n for i in range(10):\r\n if s[i]==t[i]:\r\n k+=1\r\n else:\r\n break \r\n if k==9:\r\n print(\"YES\")\r\n else:\r\n j=len(s)-1\r\n m=9\r\n flag=True\r\n k+=1\r\n while(k<10):\r\n if s[j]==t[m]:\r\n j-=1 \r\n m-=1\r\n k+=1 \r\n else:\r\n flag=False\r\n break\r\n if flag:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n ", "full = input()\r\nanswer = 0\r\nfor l in range(0,len(full)):\r\n for r in range(l,len(full)+1):\r\n temp=\"\"\r\n for j in range(0,len(full)):\r\n if (j<l or j>=r):\r\n temp+=full[j]\r\n #print(l,r,temp)\r\n if (temp==\"CODEFORCES\"):\r\n answer = 1\r\n break\r\nprint(\"YES\" if answer == 1 else \"NO\")\r\n\r\n \r\n \r\n \r\n", "s = \"CODEFORCES\"\r\nt = input()\r\n\r\nis_possible = False\r\nfor i in range(len(s) + 1):\r\n start = s[:i]\r\n end = s[i:]\r\n is_possible |= t.startswith(start) and t.endswith(end)\r\n\r\nif is_possible:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "## 2 - version\r\ns = input()\r\nw = \"CODEFORCES\"\r\nfor i in range(len(w)+1):\r\n if s.startswith(w[:i]) and s.endswith(w[i:]):\r\n print(\"YES\")\r\n break\r\nelse:print('NO')", "# /**\r\n# * author: brownfox2k6\r\n# * created: 15/05/2023 23:04:19 Hanoi, Vietnam\r\n# **/\r\n\r\ns = input()\r\nt = \"CODEFORCES\"\r\n\r\nfor l in range(min(10, len(s))):\r\n if s[l] == t[l]:\r\n l += 1\r\n else:\r\n break\r\n\r\nfor r in range(min(10, len(s))):\r\n if s[-1-r] == t[-1-r]:\r\n r += 1\r\n else:\r\n break\r\n\r\nprint(\"YNEOS\"[l+r<10::2])", "import sys\r\n\r\ns = input()\r\nfor l in range(len(s)+1) :\r\n for r in range(l+1,len(s)+1) :\r\n if s[:l]+s[r:]=='CODEFORCES' :\r\n print('YES')\r\n sys.exit(0)\r\nprint('NO')\r\n", "src = input()\ndst = 'CODEFORCES'\n\nans = False\ndelta = len(src) - len(dst)\nif delta > 0:\n for i in range(0, len(src) - delta + 1):\n t = src[0:i] + src[i+delta:len(src)]\n if t == dst:\n ans = True\n break\n\nif ans:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "Z = input(); S = \"CODEFORCES\"; f = len(Z);\r\nfor i in range(f+1):\r\n for j in range(i, f+1):\r\n if S == Z[0:i]+Z[j:f]:\r\n f = 0\r\nprint(\"NO\")if f else print(\"YES\")\r\n", "import math\ns=input()\nc=0\nfor i in range(len(s)):\n\tfor j in range(i,len(s)+1):\n\t\tp=s[:i]+s[j:]\n\t\tif(p==\"CODEFORCES\"):\n\t\t\tc=1\n\t\t# print(p)\nif c==1:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "s = input()\r\nn = len(s)\r\nfor i in range(n): \r\n for j in range(i, n): \r\n if s[:i] + s[j+1:] == 'CODEFORCES': \r\n print('YES'), exit()\r\nprint('NO')\r\n", "#!/usr/bin/python3\n\ns = \"CODEFORCES\"\n\ninp = input()\n\nans = False\n\nfor i in range(len(inp)):\n for j in range(i, len(inp) + 1):\n new_s = inp[:i] + inp[j:]\n if new_s == s:\n ans = True\n\nif ans:\n print (\"YES\")\nelse:\n print (\"NO\")\n", "n = input()\ne = \"CODEFORCES\"\n\ni,flag = 0,-1\nif n[0] == \"C\" and len(n) >= len(e):\n\twhile True:\n\t\tif i == len(e):\n\t\t\tflag = 1\n\t\t\tbreak\n\t\telif n[i] == e[i]:\n\t\t\ti += 1\n\t\telse:\n\t\t\tbreak\n\tj = (len(n) - (len(e[i:])))\n\tif n[j:] == e[i:] or flag ==1:\n\t\t\n\t\tprint(\"YES\")\n\telse:\n\t\t\n\t\tprint(\"NO\")\n\nelif len(n) < len(e):\n\tprint(\"NO\")\nelse:\n\tif n[len(n)-10:] == e:\n\t\tprint(\"YES\")\n\telse:\n\t\tprint(\"NO\")\n\n", "#!/usr/bin/env python3\n\ns = input()\nx = 'CODEFORCES'\n\nfound = False\nfor i in range(len(s)):\n for j in range(i, len(s)+1):\n if s[:i] + s[j:] == x:\n print('YES')\n found = True\n break\n if found:\n break\nelse:\n print('NO')\n", "s = input()\r\n\r\nfor i in range(11):\r\n if s.startswith(\"CODEFORCES\"[:i]) and s.endswith(\"CODEFORCES\"[i:]):\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "from sys import stdin, stdout, setrecursionlimit\r\n\r\n\r\ndef solve():\r\n s = stdin.readline().rstrip('\\r\\n')\r\n codeforces = 'CODEFORCES'\r\n ok = False\r\n for i in range(len(codeforces)+1):\r\n left_part = codeforces[:i]\r\n right_part = codeforces[i:]\r\n\r\n ok |= s.startswith(left_part) and s.endswith(right_part)\r\n\r\n print('YES' if ok else 'NO')\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "m=1000000007\r\n#------------------------------------#\r\nstring=input()\r\nmainstr=\"CODEFORCES\"\r\nif (len(string)<10):\r\n print(\"NO\")\r\nelif (string[:10]==\"CODEFORCES\"):\r\n print(\"YES\")\r\nelif (string[len(string)-10:]==\"CODEFORCES\"):\r\n print(\"YES\")\r\nelse:\r\n for i in range(1,11):\r\n if (string[:i]+string[len(string)-(10-i):]==\"CODEFORCES\"):\r\n print(\"YES\")\r\n break\r\n else:\r\n print(\"NO\")\r\n", "#!/usr/bin/python3\ns=input()\nc=\"CODEFORCES\"\nls=len(s)\nisok=False\nfor i in range(0,ls):\n for j in range((i+1),(ls+1)):\n if s[:i]+s[j:] == c:\n isok=True\nif isok:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "a = input()\nb = len(a)\nfor i in range(b): \n for j in range(i, b): \n if a[:i] + a[j+1:] == 'CODEFORCES': \n print('YES')\n exit()\nprint('NO')\n \t \t \t \t \t \t\t \t \t\t\t\t" ]

[ "#sry...\r\n\r\nv1, v2 = map(int, input().split())\r\nt, d = map(int, input().split())\r\nL1 = [0]*t\r\nL2 = [0]*t\r\nL1[0] = v1\r\nfor i in range(1, t):\r\n L1[i] = L1[i-1]+d\r\nj = t-2\r\nL2[j+1] = v2\r\nwhile j >= 0:\r\n L2[j] = L2[j+1]+d\r\n j -= 1\r\nans = 0\r\nfor i in range(0, t):\r\n ans += min(L1[i], L2[i])\r\nprint (ans)\r\n", "'''\r\nintially you have a starting speed let it be 5 and ending time let it be 6\r\nthen\r\n\r\n5 _ _ _ _ _ _ 6\r\nand between them there are moments of time in which stuff happens\r\nthere is a value d given which changes the speed by +d or -d in 1 second.\r\n5 (5+d) or (5-d) _ _ _ _ _ 6 at t==2\r\nnow we want o figure out the maximum possible sum of numbers that is the path.\r\n\r\nTrying to figure out a state that fully represents the problem.\r\n\r\nsay that we are at a index i which means we have solveed for i-1 ammd\r\nat the same time the speed e can have here (i) is solely dpenedent\r\non the speed at i-1 index.\r\n\r\nso in we basically care about the poisition and previous speed.\r\n\r\n# push dp\r\n(dp(i,prev) ----> dp[i+1,prev-d] or dp[i+1,prev+d])\r\n\r\nor dp(i,prev) ---> dp(i-1,prev-d) or dp[i-1,prev+d]\r\n\r\nthe prev can vary between these two values prev-d to prev+d\r\n\r\nmaximum possible sum is to found.\r\nbase case the first element with maximum sum.\r\n\r\nas we want to maximize the sum there is no point in going below 0\r\nv1,v2>1\r\nassume that all values >=0\r\nand t=100\r\nand d<=10\r\nand prev or our speed would be around <=1000\r\n\r\ndp(i,prev) --> i value is atmost a 100 and prev value is atmost a 1000;\r\n\r\nand the transitions are 21 as +d and -d can happen for a value atmost 10 times\r\nso 2*10 -> 20 times.\r\n'''\r\nstart,end=map(int,input().split(\" \"))\r\nn,d=map(int,input().split(\" \"))\r\ninf=1e17\r\n\r\ndp=[[-inf for i in range(1000)] for j in range(n)]\r\n\r\ndp[0][start]=0\r\n\r\nfor i in range(n-1):\r\n for j in range(0,1000):\r\n for k in range(-d,d+1):\r\n if(j+k>=0 and j+k<1000):\r\n dp[i+1][j+k]=max(dp[i+1][j+k],dp[i][j]+j)\r\nprint(dp[n-1][end]+end)\r\n", "v1, v2 = map(int, input().split())\r\nt, d = map(int, input().split())\r\nans = 0\r\nv2 += d * (t - 1)\r\nfor i in range(0, t):\r\n if v1 < v2:\r\n ans += v1\r\n else:\r\n ans += v2\r\n v1 += d\r\n v2 -= d\r\nprint(ans)", "[v1, v2] = [int(x) for x in input().split()]\n\n[t, d] = [int(x) for x in input().split()]\n\nleft = [v1] * t\nfor i in range(1, t):\n left[i] = left[i-1] + d\n\nright = [v2] * t\nfor i in range(t-2, -1, -1):\n right[i] = right[i+1] + d\n\nans = 0\n\nfor i in range(t):\n ans += min(left[i], right[i])\n\nprint(ans)\n\n\n\n\n\n\n\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\na, b = r()\r\nt, d = r()\r\nt -= 2\r\nrem = t\r\n\r\ndiff = b - a\r\nneed = 0\r\nif diff and d:\r\n need = (diff + d - 1) // d\r\n\r\nans = a + b\r\nwhile rem:\r\n x = b + (rem*d)\r\n a = min(a + d , x)\r\n ans += a\r\n rem -= 1\r\n \r\nprint(ans)\r\n\r\n", "first_line_input = input().split()\nsecond_line_input = input().split()\nv1 = int(first_line_input[0])\nv2 = int(first_line_input[1])\nt = int(second_line_input[0])\nd = int(second_line_input[1])\n\nmax = v1\nstep = 2\nnum = v1\n\nwhile(step < t):\n if(v2+(t-step)*d) > (num+d):\n num += d\n else:\n num += (v2+(t-step)*d) - num\n max += num\n step += 1\n\nmax += v2\n\nprint(max)\n \t \t \t \t \t \t \t\t \t \t \t \t \t\t \t", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef main():\r\n s, t = map(int, input().split())\r\n n, d = map(int, input().split())\r\n A = [0] * n\r\n A[0] = s\r\n A[n-1] = t\r\n for i in range(n - 1):\r\n A[i] = min(A[0] + d * i, A[n-1] + (n - 1 - i) * d)\r\n print(sum(A))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "v1,v2 = map(int,input().split())\nt,d = map(int,input().split())\na = [0]*t\na[0]=v1\na[-1]=v2\nleft = 0\nright = t-1\nwhile left!=right-1:\n\tif a[left]<=a[right]:\n\t\tleft+=1\n\t\ta[left]=a[left-1]+d\n\telse:\n\t\tright-=1\n\t\ta[right]=a[right+1]+d\nprint(sum(a))\n \t\t\t\t \t \t\t\t\t\t\t\t\t\t\t \t \t \t", "v1,v2=map(int,input().split())\r\nt,d=map(int,input().split())\r\nt-=1\r\nu=[0]*(t+1)\r\nu[0]=v1\r\nfor i in range(1,t+1):\r\n u[i]=min(u[i-1]+d,v2+(t-i)*d)\r\nans=0\r\nfor i in range(0,t+1):\r\n ans+=u[i]\r\nprint(ans)", "v1, v2 = map(int, input().split())\r\nt, d = map(int, input().split())\r\ndist = v1\r\nv = v1\r\nfor i in range(1, t):\r\n v += d\r\n if v <= v2 + d*(t-i-1):\r\n dist += v\r\n else:\r\n v = v2 + d*(t-i-1)\r\n dist += ((v + v2) * (t - i)) / 2\r\n break\r\nprint(int(dist))\r\n", "v1,v2 = map(int, input().split())\nt,d = map(int, input().split())\na = [0] * t\nb = [0] * t\na[0],b[t - 1] = v1, v2\nfor i in range(1,t):\n\ta[i] = a[i - 1] + d\nfor i in range(t - 2, -1, -1):\n\tb[i] = b[i + 1] + d\nans = sum([min(a[i], b[i]) for i in range(t)])\nprint(ans)", "'''\r\n Codeforces: (dynamic programming) B. Covered Path (1400)\r\n link: https://codeforces.com/problemset/problem/534/B\r\n Tags: dynamic programming, greedy, math, *1400\r\n\r\n===========================================================\r\n\r\n submission:\r\n runtime: 62 ms, memory: 0 KB\r\n'''\r\n\r\n'''\r\n5 6\r\n4 2\r\n5 + 7 + 8 + 6 = \r\n'''\r\n[start, end] = input().split(' ')\r\nstart, end = int(start), int(end)\r\n[n, d] = input().split(' ') \r\nn, d = int(n), int(d)\r\n\r\ninf = 1e17\r\ndp = [[-inf] * 1000 for i in range(n)]\r\n\r\ndp[0][start] = 0\r\n\r\nfor i in range(n-1):\r\n for j in range(1000):\r\n for k in range(-d, (d+1)):\r\n if j + k >= 0 and j + k < 1000:\r\n dp[i + 1][j + k] = max( dp[i + 1][j + k], dp[i][j] +j)\r\n\r\nprint(dp[n - 1][end] + end)", "def ii(): return int(input())\r\ndef si(): return input()\r\ndef mi(): return map(int,input().split())\r\ndef msi(): return map(str,input().split())\r\ndef li(): return list(mi())\r\n\r\nv1,v2=mi()\r\nt,d=mi()\r\nr1=[v1]+[0]*(t-1);r2=[0]*(t-1)+[v2];ans=v1+v2\r\n\r\nfor i in range(1,t-1):\r\n r1[i]=r1[i-1]+d\r\n \r\nfor i in range(t-2,0,-1):\r\n r2[i]=r2[i+1]+d\r\n \r\nfor i in range(1,t-1):\r\n ans+=min(r1[i],r2[i])\r\n \r\nprint(ans)\r\n \r\n", "import math\r\nv=list(map(int,input().split()))\r\ntotal=0\r\nb=list(map(int,input().split()))\r\nt=b[0]\r\nd=b[1]\r\nif v[0]<=v[1]:\r\n total=v[0]*t\r\n a=v[1]-v[0]\r\nelse:\r\n total=v[1]*t\r\n a=v[0]-v[1]\r\ndel(b)\r\ndel(v)\r\nif d!=0:\r\n t-=1\r\n b=math.floor((t+(a/d))/2)\r\n total+=(b*(b+1)*d)/2+(t-b)*(t-b-1)/2*d+a*(t-b)\r\nprint(int(total))\r\n\r\n\r\n", "v1,v2=[int(x) for x in input().split()]\r\nt,d=[int(x) for x in input().split()]\r\npre1=[v1]\r\npre2=[v2]\r\nfor i in range(1,t):\r\n pre1.append(pre1[i-1]+d)\r\nfor i in range(1,t):\r\n pre2.append(pre2[i-1]+d)\r\npre2=pre2[::-1]\r\nans=0\r\nfor i in range(t):\r\n ans+=min(pre1[i],pre2[i])\r\nprint(ans)\r\n#print(*pre1)\r\n#print(*pre2)", "v1, v2 = map(int, input().split())\r\nt, d = map(int, input().split())\r\na = [0]*t\r\na[0] = v1\r\na[t-1] = v2\r\nfor i in range(1, t-1):\r\n a[i] = a[i-1]+d\r\n \r\nk = t-1\r\nwhile abs(a[k]-a[k-1]) > d:\r\n if a[k]-a[k-1] > 0:\r\n a[k-1] = a[k]-d\r\n else:\r\n a[k-1] = a[k]+d\r\n k -= 1\r\n\r\nprint(sum(a))", "v1, v2 = map(int, input().split())\nt, d = map(int, input().split())\nans = 0\nfor i in range(t):\n ans += min(v1 + i * d, v2 + (t - i - 1) * d)\nprint(ans)\n\t \t \t\t\t\t \t \t\t \t\t\t \t \t \t\t\t", "v1, v2 = map(int, input().split(' '))\nt, d = map(int, input().split(' '))\n\nl1, l2 = [], []\nfor l, v in zip((l1, l2), (v1, v2)):\n for i in range(t):\n l.append(v + d*i)\n\nl2 = list(reversed(l2))\n#print(l1, l2)\n\nsplit = 0\nfor i in range(t):\n if l2[i] <= l1[i]:\n split = i\n break\n\nl = l1[:split] + l2[split:]\n#print(l)\nprint(sum(l))\n\n", "start,end = map(int,input().split())\r\nt,d = map(int,input().split())\r\nans = 0\r\nfor i in range(t):\r\n if start>end:\r\n start,end = end,start\r\n ans+=start\r\n start+=d\r\nprint(ans)\r\n", "def check(k, v, v2, t, d):\r\n if (t - k - 1) * d >= abs(v2 - v):\r\n return 1\r\n else:\r\n return 0\r\nv1, v2 = map(int, input().split())\r\nt, d = map(int, input().split())\r\nv1, v2 = min(v1, v2), max(v1, v2)\r\nk, v, s = 0, v1, v1\r\nif d == 0:\r\n print (v1 * t)\r\nelse:\r\n while check(k, v, v2, t, d) == 1:\r\n k += 1\r\n v += d\r\n s += v\r\n s -= v\r\n k -= 1\r\n v = (t - k - 2) * d + v2\r\n while v > v2:\r\n s += v\r\n v -= d\r\n if v == v2:\r\n s += v\r\n if v != v2:\r\n v += d\r\n s -= v\r\n s += v2\r\n print (s)", "import math\nv1,v2=map(int,input().split())\nt,d=map(int,input().split())\na=[0]*(10000)\na[0]=v1\na[t-1]=v2\nl=0\nr=t-1\nwhile((r-l)>1):\n if a[l]<a[r]:\n a[l+1]=a[l]+d\n l+=1\n else:\n a[r-1]=a[r]+d\n r-=1\n #print(l,r)\nprint(sum(a))\n\n\t \t \t \t\t \t\t \t \t\t\t \t \t", "from math import floor\r\nu, v = map(int, input().split())\r\nt, d = map(int, input().split())\r\n\r\nlst = [9999] * t\r\nlst[0], lst[-1] = min(u, v), max(u, v)\r\n\r\ni = 0\r\nwhile abs(lst[i] - lst[i+1]) > d:\r\n if lst[i] < lst[i+1]:\r\n lst[i+1] = lst[i] + d\r\n i += 1\r\n else:\r\n lst[i] = lst[i+1] + d\r\n i -= 1\r\n\r\nprint(sum(lst))", "#!/usr/bin/env python\n\nv1, v2 = map(int, input().split(' '))\nt, d = map(int, input().split(' '))\nt -= 1\n\ntotal = v1\n\nwhile (v1 + d) - ((t-1) * d) <= v2 and t:\n v1 += d\n total += v1\n t -= 1\n\ndiff = v2 + (t-1) * d - v1\nif t:\n v1 += diff\n t -= 1\n total += v1\n\nwhile t:\n t -= 1\n v1 -= d\n total += v1\n\nprint(total)\n\nassert(v1 == v2)\n", "import sys\nimport math\nfrom collections import defaultdict\nimport itertools\n\nMAXNUM = math.inf\nMINNUM = -1 * math.inf\n\n\ndef getInts():\n return map(int, sys.stdin.readline().rstrip().split(\" \"))\n\n\ndef getString():\n return sys.stdin.readline().rstrip()\n\n\ndef printOutput(ans):\n sys.stdout.write(str(ans) + \"\\n\")\n\n\ndef solve(v1, v2, t, d):\n curTime = 1\n totalDistance = 0\n curSpeed = v1\n while curTime <= t:\n totalDistance += curSpeed\n for acc in range(d, -d - 1, -1):\n if curSpeed + acc - (d * (t - (curTime + 1))) <= v2:\n curSpeed += acc\n break\n curTime += 1\n\n return totalDistance\n\n\ndef readinput():\n v1, v2 = getInts()\n t, d = getInts()\n printOutput(solve(v1, v2, t, d))\n\n\nreadinput()\n", "v1, v2 = map(int, input().split())\r\nt, d = map(int, input().split())\r\nres = 0\r\nfor i in range(1, t+1):\r\n r1 = v1 + (i-1) * d\r\n r2 = v2 + (t-i) * d\r\n res += min(r1, r2)\r\nprint(res)\r\n", "'''\r\n Codeforces: (dynamic programming) B. Covered Path (1400)\r\n link: https://codeforces.com/problemset/problem/534/B\r\n Tags: dynamic programming, greedy, math, *1400\r\n\r\n===========================================================\r\n\r\n submission:\r\n runtime: 202 ms, memory: 37100 KB\r\n'''\r\n\r\n'''\r\n5 6\r\n4 2\r\n5 + 7 + 8 + 6 = \r\n'''\r\n[v1, v2] = input().split(' ')\r\nv1, v2 = int(v1), int(v2)\r\n[t, d] = input().split(' ') \r\nt, d = int(t), int(d)\r\n\r\nresult = 0 \r\nbonus = 0 # speed bonus\r\ndp = [0] * (t - 1)\r\nfor i in range(t-1): \r\n result += v1 + bonus \r\n dp[i] = v1 + bonus\r\n bonus += d\r\nresult += v2\r\n# print('result', result)\r\n# print('dp', dp)\r\nlastSpeed = v2 \r\nfor i in range(len(dp) - 1, -1, -1): \r\n diff = abs(lastSpeed - dp[i]) - d \r\n # print('diff', diff)\r\n if diff > 0: \r\n result -= diff\r\n dp[i] -= diff\r\n lastSpeed = dp[i]\r\n# print('result', result)\r\n# print('dp', dp)\r\nprint(result)\r\n# def solution(v1, v2, t, d): \r\n# result = 0 \r\n# bonus = 0 # speed bonus\r\n# dp = [0] * (t - 1)\r\n# for i in range(t-1): \r\n# result += v1 + bonus \r\n# dp[i] = v1 + bonus\r\n# bonus += d\r\n# result += v2\r\n# print('result', result)\r\n# print('dp', dp)\r\n# lastSpeed = v2 \r\n# for i in range(len(dp) - 1, -1, -1): \r\n# diff = abs(lastSpeed - dp[i]) - d \r\n# print('diff', diff)\r\n# if diff > 0: \r\n# result -= diff\r\n# dp[i] -= diff\r\n# lastSpeed = dp[i]\r\n# print('result', result)\r\n# print('dp', dp)\r\n\r\n# solution(7, 3, 5, 4)", "def inum2(num):\r\n if num > int(num):\r\n return int(num) + 1\r\n else:\r\n return int(num)\r\nv1, v2 = map(int,input().split())\r\nt, d = map(int,input().split())\r\nnowv = v1\r\ns = 0\r\ni = 1\r\nif d > 0:\r\n while t + 1 > i: \r\n s += nowv\r\n nowv = min(nowv + d,v2+(t-i-1)*d)\r\n i += 1\r\n print(s)\r\nelse:\r\n print(v1 * t)\r\n", "v1 , v2 = map(int , input().split(' '))\r\nt , d = map(int , input().split(' '))\r\na = [0] * (t + 1)\r\na[0] = v1\r\na[t - 1] = v2\r\ncvb = 0\r\nfor i in range(1 , t - 1):\r\n a[i] = min(a[i - 1] + d , v2 + (t - i - 1) * d)\r\n cvb += a[i]\r\nprint(cvb + v1 + v2)\r\n", "s,e,t,d=[int(x) for x in input().split()+input().split()]\r\nr=0\r\nfor i in range(t):\r\n r+=min(s+i*d,e+(t-i-1)*d)\r\nprint(r)", "startSpeed, endSpeed = [int(x) for x in input().split()]\nseconds, maxChange = [int(x) for x in input().split()]\n\nspeedUp = [startSpeed + (maxChange * x) for x in range(seconds)]\nslowDown = list(reversed([endSpeed + (maxChange * x) for x in range(seconds)]))\n\nspeed = [min(speedUp[x], slowDown[x]) for x in range(seconds)]\n\nprint(sum(speed))\n\n \t\t\t\t \t \t \t\t\t \t \t \t", "v1,v2 = map(int,input().split())\r\nt, d = map(int,input().split())\r\nr = 0\r\nfor i in range(1,t+1):\r\n r += min(v1+(i-1)*d,v2+(t-i)*d);\r\nprint(r)\r\n", "s=[int(n) for n in input().split()]\r\nz=[int(n) for n in input().split()]\r\na=[s[0]+n*z[1] for n in range(z[0])]\r\nb=[s[1]+n*z[1] for n in range(z[0])]\r\nb=b[::-1]\r\nk=0\r\nfor n in range(z[0]):\r\n\tif abs(a[n]-b[n+1])<=z[1]:\r\n\t\tk=n\r\n\t\tbreak\r\nm=(sum(a[:k+1])+sum(b[k+1:]))\r\n\r\nprint(m)", "# print (\"Enter v1 and v2\")\nvs = input().split()\nv1 = int(vs[0])\nv2 = int(vs[1])\n\n# print (\"Enter t and d\")\nvals = input().split()\nt = int(vals[0])\nd = int(vals[1])\n\n# Fill array of maximal speeds at each point of time\na = [0 for i in range(t+1)]\nindex = t\nmaxspeed = v2\nwhile (index > 0):\n a[index] = maxspeed\n index = index - 1\n maxspeed += d\n\n# Now compute the maximum speeds\nanswer = v1\ncurrent = v1\nindex = 2\ndone = False\nwhile (index <= t and not done):\n if current + d <= a[index]:\n current = current + d\n # print (\"The next speed is \" + str(current))\n answer = answer + current\n index = index + 1\n else:\n current = a[index]\n # print (\"The next speed is \" + str(current))\n answer = answer + current\n index = index + 1\n done = True\n \nwhile (index <= t): # Subtract down until we get to v2\n current = current - d\n # print (\"The next speed is \" + str(current))\n answer = answer + current\n index = index + 1\n\nprint (answer)\n\n\n \n \n \n", "a,b,c,d=map(int,input().split()+input().split())\r\ne=0\r\nfor i in range(c):\r\n if a>b:a,b=b,a\r\n e+=a\r\n a+=d\r\nprint(e)", "from collections import Counter,defaultdict,deque\r\nimport heapq as hq\r\nfrom itertools import count, islice\r\n\r\n#alph = 'abcdefghijklmnopqrstuvwxyz'\r\n#from math import factorial as fact\r\nimport math\r\nimport sys\r\ninput=sys.stdin.readline\r\n#print=sys.stdout.write\r\n#tt = int(input())\r\n#total=0\r\n#n = int(input())\r\n#n,m,k = [int(x) for x in input().split()]\r\n#n = int(input())\r\n#l,r = [int(x) for x in input().split()]\r\nv1,v2 = [int(x) for x in input().split()]\r\nt,d = [int(x) for x in input().split()]\r\nf = [v1]\r\nb = [v2]\r\nfor i in range(t-1):\r\n f.append(f[-1]+d)\r\n b.append(b[-1]+d)\r\nb.reverse()\r\nans = 0\r\nfor i in range(t):\r\n ans+=min(b[i],f[i])\r\nprint(ans)\r\n", "i_speed, f_speed = input().split(\" \")\ntime, transition = input().split(\" \")\ni_speed = int(i_speed)\nf_speed = int(f_speed)\ntime = int(time)\ntransition = int(transition)\n\npath = [ i_speed ] * time\n\n\nfor i in range( 1, len(path) ):\n path[i] += transition*i\n while path[i] > f_speed + transition*(len(path)-i-1):\n path[i] -= 1\n\nprint(sum(path))\n\t \t\t\t\t\t\t\t \t \t \t \t \t\t\t \t \t\t\t", "v1, v2 = map(int, input().split())\nt, d = map(int, input().split())\nprint(sum([min(v1 + i*d, v2 + (t-1-i)*d) for i in range(t)]))\n", "v1,v2 = map(int,input().split())\r\nt,d = map(int,input().split())\r\nres=v1+v2\r\nfor i in range(1,t-1):\r\n res+=min(v1+d*i,v2+d*(t-i-1))\r\nprint(res)", "i,f=map(int,input().split())\r\nt,d=map(int,input().split())\r\n\r\na=[]\r\nb=[]\r\n\r\na=[i+j*d for j in range(t)]\r\nb=[f+j*d for j in range(t)]\r\nb.reverse()\r\nfor j in range(t):\r\n\tif a[j]>=b[j]:\r\n\t\tprint(sum(a[:j])+sum(b[j:]))\r\n\t\tquit()", "# https://codeforces.com/problemset/problem/1251/C\r\n# check for all the parties before this number\r\n\r\nv1, v2 = map(int, input().split(\" \"))\r\na, b = map(int, input().split(\" \"))\r\n\r\nans = 0\r\nz = [v1]\r\nx = [v2]\r\nfor i in range(a-2):\r\n z.append(z[-1]+b)\r\n x.append(x[-1]+b)\r\nx.append(v1)\r\nz.append(v2)\r\nx.reverse()\r\nfor i in range(a):\r\n ans+= min(x[i],z[i])\r\nprint(ans)", "v1, v2 = [int(c) for c in input().split()]\r\nt, d = [int(c) for c in input().split()]\r\n\r\n\r\ndist = v1 # distance after the first interval [0, 1)\r\ni = 1 # interval\r\n\r\n# check the intervals [i, i+1)\r\nwhile(i <= t-2):\r\n dist += min(v1 + i*d, (v2 + (t-1)*d) - i*d)\r\n i += 1\r\n\r\ndist += v2 # last interval [t-1, t)\r\nprint(dist)", "v1,v2=map(int,input().split())\r\nt,d=map(int,input().split())\r\narr=[]\r\narr1=[]\r\nans=0\r\nfor i in range(t):\r\n\tarr.append(v1+i*d)\r\n\tarr1.append(v2+(t-i-1)*d)\r\nfor i in range(t):\r\n\tif(arr[i]<=arr1[i]):\r\n\t\tans+=arr[i]\r\n\telse:\r\n\t\tans+=arr1[i]\r\nprint(ans)", "v1,v2 =map(int,input().split())\r\nt,d =map(int,input().split())\r\nans = 0\r\nfor i in range(t):\r\n ans += min(v1 + i * d, v2 + (t - i - 1) * d)\r\nprint(ans)", "v = [int(x) for x in input().split(' ')]\r\nt, d = [int(x) for x in input().split(' ')]\r\n\r\ns = 0\r\nv.sort()\r\n\r\ns += v[0]\r\nfor i in range(1, t):\r\n if v[0] - v[-1] > (t - i - 2) * d:\r\n v[0] = (t - i - 1) * d + v[-1]\r\n else:\r\n v[0] += d\r\n s += v[0]\r\n\r\nprint(s)\r\n", "import sys\n\nv1, v2 = map(int, sys.stdin.readline().strip().split(' ') )\nt, d = map(int, sys.stdin.readline().strip().split(' ') )\n\nans = 0\n\nv = v1\nfor i in range(0, t):\n\tans += v\n\tmax_v = v2 + d * (t - i - 2)\n\t#print(v, max_v)\n\tif v > max_v:\n\t\tv = max_v\n\telif v + d > max_v:\n\t\tv = max_v\n\telse:\n\t\tv = v + d\n\nprint(ans)", "v1, v2 = [int(c) for c in input().split()]\r\nt, d = [int(c) for c in input().split()]\r\ndist = v1\r\ni = 1\r\nwhile(i < t-1):\r\n dist += min(v1 + i*d, (v2 + (t-1)*d) - i*d)\r\n i += 1\r\n \r\ndist += v2\r\nprint(dist)", "import math\n\n\n\nv1, v2 = [int(k) for k in input().split()]\nt, d = [int(k) for k in input().split()]\n\n\nans = 0\nfor i in range(t):\n first = d * i + v1\n second = d*(t-1-i) + v2\n ans += min(first, second)\n\nprint(ans)\n", "v1, v2 = map(int, input().split())\nt, d = map(int, input().split())\nvm = [0] * t\n\nv = v1\nfor i in range(t):\n vm[i] = v\n v += d\n\nv = v2\nfor i in range(t - 1, -1, -1):\n vm[i] = min(v, vm[i])\n v += d\n\nprint(sum(vm))\n", "r = lambda: map(int, input().split())\r\na, b = r(); t, d = r()\r\nprint(sum(min(a + d * i, b + d * (t - i - 1)) for i in range(t)))", "from math import floor\nu, v = map(int, input().split())\nt, d = map(int, input().split())\n\nlst = [9999] * t\nlst[0], lst[-1] = min(u, v), max(u, v)\n\ni = 0\nwhile abs(lst[i] - lst[i+1]) > d:\n if lst[i] < lst[i+1]:\n lst[i+1] = lst[i] + d\n i += 1\n else:\n lst[i] = lst[i+1] + d\n i -= 1\n\nprint(sum(lst))\n \t \t \t \t\t \t\t \t \t \t \t\t\t \t\t\t \t", "u, v = (int(x) for x in input().split())\nt, d = (int(x) for x in input().split())\nans = 0\nwhile t > 1:\n\tif u < v:\n\t\tans += u\n\t\tu += d\n\telse:\n\t\tans += v\n\t\tv += d\n\tt -= 1\nprint(ans + min(u, v))\n", "v1,v2 = map(int,input().split())\r\nt ,d = map(int,input().split())\r\nif v1 >v2:\r\n v1,v2 = v2,v1\r\nans = v1+v2\r\nleft = 0\r\nneed = v2+d\r\nremove = 0\r\nfor i in range(t-2):\r\n dif = need -v1\r\n if dif>0:\r\n if dif<=d:\r\n if ((t-2)-i-1)>0:\r\n v1 +=d\r\n remove = v1 - need\r\n else:\r\n v1 +=dif\r\n else:\r\n v1+=d\r\n ans+=v1\r\n else:\r\n left = (t-2)-i\r\n break\r\nif left:\r\n updown = left //2\r\n stable = left%2\r\n if not stable:\r\n for i in range(updown-1):\r\n v1+=d\r\n ans+=v1\r\n v1 +=d-remove\r\n ans+=v1\r\n else:\r\n for i in range(updown):\r\n v1+=d\r\n ans+=v1\r\n v1 -= remove\r\n ans +=v1\r\n for i in range(updown):\r\n v1-=d\r\n ans+=v1\r\nprint(ans)\r\n\r\n\r\n\r\n", "v1, v2 = map(int, input().split())\nn, d = map(int, input().split())\n\nans = 0\nfor i in range(n-1):\n li = v1 + i*d\n ri = v2 + ((n-1)-(i+1)) * d\n ls = (v1 + li) * (i+1)//2\n rs = (v2 + ri) * (n-1-i)//2\n\n if abs(li-ri) <= d:\n ans = max(ans, ls+rs)\nprint(ans)", "v1,v2 = map(int,input().split())\nt,d=map(int,input().split())\nans=0\nfor i in range(1,t+1):\n ans+=min(v1+(i-1)*d,v2+(t-i)*d)\nprint( ans)\n\n \t\t \t \t\t \t\t\t\t \t\t\t", "v1, v2 = sorted(map(int, input().split()))\r\nt, d = map(int, input().split())\r\n\r\nf = [v1 + i * d for i in range(t)]\r\ns = [v2 + i * d for i in range(t)]\r\n\r\ns.reverse()\r\n\r\nans = 0\r\n\r\nfor i in range(t):\r\n ans += min(f[i], s[i])\r\n\r\nprint(ans)\r\n", "from sys import stdin\r\ninput = stdin.readline\r\nv1,v2 = list(map(int,input().split()))\r\nt,d = list(map(int,input().split()))\r\ndp = [0]*t\r\nfor i in range(t):\r\n dp[i] = min(v1+d*i,v2+d*(t-1-i))\r\nprint(sum(dp))\r\n", "from math import inf\n\nmemo = {}\ndef foo(s, e, d, n):\n if n == 0:\n if abs(s - e) <= d:\n return s + e\n return -inf\n\n if (s, e, d, n) in memo:\n return memo[(s, e, d, n)]\n\n c = -inf\n for i in range(s - d, s + d + 1):\n if i <= 0:\n continue\n c = max(c, foo(i, e, d, n - 1))\n\n memo[(s, e, d, n)] = c + s\n return c + s\n\ns, e = map(int, input().split())\nt, d = map(int, input().split())\nprint(foo(s, e, d, t - 2))\n", "import sys\n\ncurr_speed, v2 = [int(s) for s in sys.stdin.readline().split()]\nt, d = [int(s) for s in sys.stdin.readline().split()]\n\npath = [curr_speed]\nsec_left = t - 2\n\nwhile sec_left:\n max_allowed = v2 + d * sec_left\n max_possible = curr_speed + d\n curr_speed = min(max_allowed, max_possible)\n path.append(curr_speed)\n sec_left -= 1\n\npath.append(v2)\nprint(sum(path))\n", "#v first, v fast\r\n#t: thời gian đi hết, d: tốc độ chênh lệch tối đa giữa 2s\r\n\r\n\r\n#? -----------------------------------------------------------------------------------------------------\r\n#?　　　　　　　　　　　 ∧＿∧\r\n#?　　　　　 ∧＿∧ 　 （´<_｀ ）　 \r\n#?　　　　 （ ´_ゝ`）　/　 ⌒i \r\n#?　　　　／　　　＼　 　 |　| \r\n#?　　　 /　　 /￣￣￣￣/　|　 |\r\n#?　 ＿_(__ﾆつ/　 ＿/ .| .|＿＿＿＿\r\n#?　 　　　＼/＿＿＿＿/　（u　⊃\r\n#?\r\n#?\t\t /\\_/\\\r\n#?\t\t(= ._.)\r\n#?\t\t/ >WA \\>AC\r\n#?\r\n# WELCOME TO MY CODING SPACE\r\n#! Filename: G_Covered_Path.py\r\n#* Folder: D:\\Code\\Python\\Codeforces\\ProblemSet\\Topic Stream Mashup Dynamic Programming\r\n#? Author: TranDucTri2003\r\n#TODO CreatedAt: 08/08/2022 23:16:12\r\n#? -----------------------------------------------------------------------------------------------------\r\n\r\nv1,v2=list(map(int,input().split()))\r\nt,d=list(map(int,input().split()))\r\n\r\nleft=[v1]\r\nright=[v2]\r\n\r\nfor i in range(t-1):\r\n left.append(left[-1]+d)\r\nfor i in range(t-1):\r\n right.insert(0,right[0]+d)\r\n\r\nres=[]\r\nfor i in range(t):\r\n res.append(min(left[i],right[i]))\r\nprint(sum(res))\r\n ", "#!/usr/bin/env python3\r\n\r\nfrom sys import stdin, stdout\r\nfrom math import *\r\nfrom itertools import *\r\n\r\nlmap = lambda x, y: list(map(x, y))\r\nlfilter = lambda x, y: list(filter(x, y))\r\n\r\ndef max_acceleration(v, v2, tl, d):\r\n\tmax_next_v = v2 + d * (tl - 2)\r\n\treturn min(d, max_next_v - v)\r\n\r\ndef solve(test):\r\n v1, v2, t, d = lmap(int, test.strip().split())\r\n v = v1\r\n s = 0\r\n for i in range(t):\r\n \ts += v\r\n \tv += max_acceleration(v, v2, t - i, d)\r\n return s\r\n \r\nstdout.write(str(solve(stdin.read())))\r\n", "r=lambda:map(int,input().split())\r\na,b=r();t,d=r()\r\nprint(sum(min(a+d*i,b+d*(t-i-1)) for i in range(t)))", "import sys\r\ninput = sys.stdin.readline\r\n\r\na, b = map(int, input().split())\r\nt, d = map(int, input().split())\r\ne, e1 = [0], [0]\r\nfor i in range(1, t-1):\r\n x = i*d+a\r\n e.append(x)\r\n if x > (b+d*(t-2-i)):\r\n c = 1\r\n for j in range(t-1, i, -1):\r\n e1.append(b+d*c)\r\n c += 1\r\n break\r\n\r\nif e1[-1] == 0:\r\n print(a + b + sum(e))\r\nelif e[-1] == 0:\r\n print(a + b + sum(e1))\r\nelif e[-1] > e1[-1]:\r\n print(a+b+sum(e[:-1]) + sum(e1))\r\nelse:\r\n print(a+b+sum(e)+sum(e1[:-1]))", "if __name__ == '__main__':\n v1, v2 = map(int, input().split())\n t, d = map(int, input().split())\n\n total = 0\n for i in range(t):\n total += v1\n\n v = min(d, v2 + (t - i - 2) * d - v1)\n\n if v > 0:\n v1 += v\n else:\n if v1 > v2 and i + 1 != t:\n dd = max(0, (v1 - v2) - (t - i - 2) * d)\n v1 -= dd\n\n print(total)\n\n", "v1, v2 = map(int, input().split())\nt, d = map(int, input().split())\n\nsum = 0\n\nfor i in range(t):\n sum += min(v1 + d * i, v2 + d * (t - i - 1))\n\nprint(sum)\n\n \t \t \t \t \t\t\t \t \t \t", "def solve():\r\n v1,v2 = map(int,input().split())\r\n t,d = map(int,input().split())\r\n \r\n dp = [0]*t\r\n for i in range (t):\r\n dp[i] = dp[i-1]+min(v1+d*i,v2+d*(t-1-i))\r\n print(dp[-1]) \r\n#for i in range(int(input())):\r\nsolve()", "v1, v2 = map(int, input().split())\r\nt, d = map(int, input().split())\r\nif v1 > v2:\r\n v1, v2 = v2, v1\r\n\r\ndis = 0\r\nt -= 1\r\n\r\nwhile t:\r\n a = (t-1) * d + v2 - v1\r\n dis += v1\r\n v1 += min(a, d)\r\n t -= 1\r\n \r\nprint(dis + v2)", "__author__ = 'clumpytuna'\r\nv1, v2 = map(int, input().split(\" \"))\r\nt, d = map(int, input().split(\" \"))\r\nsum = v1\r\nz = d\r\nfor i in range(2, t):\r\n if ((v1+d) - (t-i)*d) <= v2:\r\n v1 += d\r\n sum += v1\r\n #print(v1)\r\n else:\r\n while ((v1+z) - (t-i)*d) > v2:\r\n z -= 1\r\n v1 = v1 + z\r\n sum += v1\r\n #//print(v1, 'df')\r\n z = d\r\nprint(sum+v2)", "import sys,math\r\nv1, v2= map(int, sys.stdin.readline().split())\r\ns,d=map(int,sys.stdin.readline().split())\r\nans= 0\r\nfor i in range(s):\r\n if v1 > v2:\r\n v1, v2 = v2, v1\r\n ans += v1\r\n v1 += d\r\nprint(ans)\r\n\r\n", "#input data\r\nv1, v2 = map(int, input().split())\r\nt, d = map(int, input().split())\r\n\r\n#preprocess\r\nINF, C = 99999, 1200\r\nS = [ [-INF]*C for i in range(t+1) ]\r\nS[1][v1] = v1\r\n\r\n#solve task via dp\r\nfor i in range(2, t+1):\r\n for j in range(1, C-2*d):\r\n for k in range(-d, d + 1):\r\n if j + k > 0 and S[i-1][j+k] != -INF:\r\n S[i][j] = max(S[i][j], S[i-1][j+k] + j)\r\n\r\n#output answer\r\nprint(S[t][v2])\r\n\r\n", "a,b=map(int,input().split())\r\nt,d=map(int,input().split())\r\nfirst=[0]*t\r\nfirst[0]=a\r\nfor i in range(1,t):\r\n first[i]=first[i-1]+d\r\nsecond=[0]*t\r\nsecond[0]=b\r\nfor i in range(1,t):\r\n second[i]=second[i-1]+d\r\nsecond=second[::-1]\r\nfinal=[0]*t\r\nfor i in range(t):\r\n final[i]=min(first[i],second[i])\r\nprint(sum(final))\r\n", "v1, v2 = input().split()\r\nt, d = input().split()\r\nv1 = int(v1)\r\nv2 = int(v2)\r\nt = int(t)\r\nd = int(d)\r\na = 1\r\nv = v1\r\ndistance = 0\r\nfor i in range(t):\r\n if v-v2 > (t-i-1)*d:\r\n a *= -1\r\n v = (t-i-1)*d + v2\r\n distance += v\r\n v += a*d\r\nprint(distance)\r\n", "v1, v2 = map(int, input().strip().split())\r\nt, d = map(int, input().strip().split())\r\n\r\nres = 0\r\nl = v1\r\nr = v2 + (t-1)*d\r\n\r\nfor i in range(t):\r\n res += min(l, r)\r\n l += d\r\n r -= d\r\n\r\nprint(res)\r\n", "from collections import defaultdict as dc\r\nmemo=dc(lambda:-1)\r\ndef rec(pos,T):\r\n if T==t and pos==v2:return v2\r\n if T==t:return -1e20\r\n if memo[(pos,T)]!=-1:return memo[(pos,T)]\r\n ans=-1e20\r\n for i in range(d+1):\r\n ans1=rec(pos+i,T+1)+pos\r\n ans2=rec(pos-i,T+1)+pos\r\n ans=max(ans,ans1,ans2)\r\n #print(ans1,ans2)\r\n memo[(pos,T)]=ans\r\n return ans\r\n\r\nv1,v2=[int(x) for x in input().split()]\r\nt,d=[int(x) for x in input().split()]\r\nans=rec(v1,1)\r\nprint(ans)", "#\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/534/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 v1, v2 = get_ints()\r\n t, d = get_ints()\r\n dp = [0]*(t+1)\r\n dp[1] = v1\r\n dp[-1] = v2\r\n for i in range(2, t):\r\n dp[i] = min(d+dp[i-1], dp[-1]+d*(t-i))\r\n print(sum(dp))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "v1,v2 = map(int, input().split())\r\nt, d = map(int, input().split())\r\nans=0\r\na=v1\r\nb=v2+d*(t-1)\r\nfor i in range(t):\r\n ans+=min(a,b)\r\n a+=d\r\n b-=d\r\nprint(ans)", "a,b=map(int,input().split())\r\nt,d=map(int,input().split())\r\nans=0\r\nstart=a\r\nfor time in range(t-1):\r\n l=d\r\n while start+l>(t-time-2)*d+b:\r\n l-=1\r\n start+=l\r\n ans+=start\r\nprint(ans+a)\r\n \r\n \r\n ", "v1,v2=map(int,input().split())\r\nt,d=map(int,input().split())\r\nif(t==2):\r\n print(v1+v2)\r\n exit()\r\nans=[]\r\ngan=[]\r\nfor i in range(t-2):\r\n if(i==0):\r\n ans.append([max(v1-d,0),v1+d])\r\n gan.append([max(v2-d,0),v2+d])\r\n else:\r\n ans.append([max(ans[i-1][0]-d,0),ans[i-1][1]+d])\r\n gan.append([max(gan[i-1][0]-d,0),gan[i-1][1]+d])\r\n\r\ntotal=0\r\ngan=gan[::-1]\r\nfor i in range(len(ans)):\r\n total+=min(ans[i][1],gan[i][1])\r\nprint(total+v1+v2)\r\n \r\n \r\n \r\n", "v1,v2=map(int,input().split())\r\nt,d=map(int,input().split())\r\ns=0\r\nc1 = v1; \r\nc2 = v2 + d * (t - 1);\r\nfor i in range(t):\r\n s+=min(c1,c2)\r\n c1+=d \r\n c2-=d\r\nprint(s) \r\n \r\n\r\n", "v1, v2 = map(int, input().split())\nt, d = map(int, input().split())\n\ndst = v1\n\nfor i in range(2, t + 1):\n for x in range(d):\n if abs(v1 + 1 - v2) <= d * (t - i):\n v1 += 1\n elif abs(v1 - v2) > d * (t - i):\n if v1 > v2:\n v1 -= 1\n else:\n v1 += 1\n dst += v1\n\nprint(dst)\n", "v1,v2=map(int,input().split())\r\nt,d=map(int,input().split())\r\n\r\nans=0\r\nfor i in range(1,t+1):\r\n ans+=min(v1+d*(i-1),v2+d*(t-i))\r\n\r\nprint(ans)", "v1, v2 = map(int, input().split())\r\nt, d = map(int, input().split())\r\nans = 0\r\n#循环交替增长\r\nfor i in range(t):\r\n if v1>v2:\r\n v1, v2 = v2, v1\r\n ans += v1\r\n v1+=d\r\nprint(ans)", "import math\r\nimport sys\r\nfrom bisect import bisect_right, bisect_left, insort_right\r\nfrom collections import Counter, defaultdict\r\nfrom heapq import heappop, heappush\r\nfrom itertools import accumulate\r\nfrom sys import stdout\r\n\r\nR = lambda: map(int, input().split())\r\nv1, v2 = R()\r\nt, d = R()\r\nmaxv = max(v1, v2) + t * d + 1\r\ndp = [[-math.inf for j in range(maxv)] for i in range(t)]\r\ndp[0][v1] = v1\r\nfor i in range(1, t):\r\n for v in range(maxv):\r\n dp[i][v] = max(dp[i - 1][v + dx] if 1 <= v + dx < maxv else -math.inf for dx in range(-d, d + 1)) + v\r\nprint(dp[-1][v2])\r\n", "v1,v2= map(int, input().split())\r\nt,d= map(int, input().split())\r\ncnt=0\r\nfor i in range(t):\r\n cnt+=min(v1+i*d,v2+(t-i-1)*d)\r\nprint(cnt)", "from math import ceil\r\nv1,v2 = map(int,input().split())\r\nt,d = map(int,input().split())\r\ndis = v1 + v2\r\nfor i in range(t-2,0,-1):\r\n\tfor j in range(d,-d-1,-1):\r\n\r\n\t\ta = ceil((v2+j-v1)/(i))\r\n\r\n\t\tif a > d:\r\n\t\t\tcontinue\r\n\t\telse:\r\n\t\t\tv2 = v2 + j\r\n\t\t\tdis = dis + v2\r\n\t\t\tbreak\r\n\r\n\r\nprint(dis)", "#534B\r\nstart,end = map(int, input().split())\r\ntime,maxDelta = map(int,input().split())\r\ndistance = 0\r\nfor x in range(time):\r\n distance += min(start + maxDelta*x, end + maxDelta*(time-1-x))\r\nprint(distance)\r\n", "I = lambda : map(int, input().split())\r\n\r\ns, e = I()\r\nt, d = I()\r\n\r\na = [0]*t\r\na[0], a[-1] = s, e\r\n\r\nfor i in range(1,t-1):\r\n a[i] += a[i-1] + d\r\n\r\nfor j in range(t-2, 0, -1):\r\n if abs(a[j] - a[j+1]) > d:\r\n a[j] = a[j+1] + d\r\n else:\r\n break\r\n\r\nprint(sum(a))", "ninf = -500000\r\n\r\nu, v = map(int, input().split(' '))\r\nt, d = map(int, input().split(' '))\r\n\r\nl = [[ninf] * 1201 for _ in range(2)]\r\n\r\nl[0][u] = u\r\n\r\nfor i in range(1, t):\r\n for j in range(1201):\r\n l[i & 1][j] = max(l[~i & 1][max(0, j - d) : min(1200, j + d) + 1]) + j\r\n\r\nprint(l[(t - 1) & 1][v])\r\n", "\n\nfrom typing import Dict\n\n\ndef find_length(speed, time):\n if (time == 1):\n if (speed == v_1):\n return v_1\n else:\n return -1\n if ((speed, time) in dp):\n return dp[(speed, time)]\n\n result = -1\n for i in range(max(0, speed - d), speed + d + 1):\n candidate_result = find_length(i, time-1)\n if (candidate_result != -1):\n result = max(result, candidate_result)\n \n if (result != -1):\n result += speed\n dp[(speed, time)] = result\n return result\n\nv_1, v_2 = list(map(int, input().split()))\nt, d = list(map(int, input().split()))\ndp = dict()\n\nprint(find_length(v_2, t))\n\n\n\n", "m=lambda: map(int,input().split());u,v=m();t,d=m();ans,a,b=0,u,v+d*(t-1);\r\nfor _ in range(t):ans+=min(a,b);a+=d;b-=d;\r\nprint(ans)\r\n", "v1, v2 = map(int, input().split())\r\nt, d = map(int, input().split())\r\nans = 0\r\nl = [0] * t\r\nl[0] = v1; l[-1] = v2\r\ni = 1; j = t-2;\r\nwhile 1:\r\n if i < j:\r\n l[i] = l[i-1] + d\r\n l[j] = l[j+1] + d\r\n elif i == j:\r\n l[i] = l[i-1] + d\r\n elif i > j:\r\n break\r\n i += 1\r\n j -= 1\r\nfor i in range(1, t):\r\n if l[i] - l[i-1] > d:\r\n l[i] = l[i-1] + d\r\nfor i in range(t-2, -1, -1):\r\n if l[i] - l[i+1] > d:\r\n l[i] = l[i+1] + d\r\n \r\nprint(sum(l))\r\n", "inp = input()\r\ninp = inp.split()\r\nv1 = int(inp[0])\r\nv2 = int(inp[1])\r\ninp = input()\r\ninp = inp.split()\r\nt = int(inp[0])\r\nd = int(inp[1])\r\nans = v1\r\nt -= 1\r\nwhile(t > 0):\r\n for i in range(-d,d+1):\r\n v = v1 - i\r\n if d * (t - 1) >= abs(v2 - v):\r\n ans += v\r\n v1 = v\r\n t -= 1\r\n #print(v)\r\n break\r\nprint(ans)\r\n", "v1, v2 = map(int, input().split())\r\nt, d = map(int, input().split())\r\np = v1 + v2\r\nfor i in range(2, t):\r\n v1 = min(v1 + d, v2 + (t - i) * d)\r\n p += v1\r\nprint(p)", "import sys\r\n\r\ndef get_int():\r\n return int(sys.stdin.readline().strip())\r\n\r\ndef get_ints():\r\n return map(int,sys.stdin.readline().strip().split())\r\n\r\ndef get_list():\r\n return list(map(int,sys.stdin.readline().strip().split()))\r\n\r\ndef get_string():\r\n return sys.stdin.readline().strip()\r\n\r\n\r\nv1,v2 = get_ints()\r\nt,d = get_ints()\r\n\r\n\r\n# def rec(i,p): # returns max length\r\n# if i==t:\r\n# if abs(v2-p)>d:\r\n# return float('-inf')\r\n# else:\r\n# return v2\r\n \r\n# # don't change\r\n# ans = p + rec(i+1,p)\r\n# #change\r\n# for j in range(-d,d+1):\r\n# ans = max(ans, p+j + rec(i+1,p+j))\r\n \r\n# return ans\r\n# print(v1 + rec(2,v1))\r\n\r\ndp = [[float('-inf')]*(1001) for _ in range(t+1)]\r\n\r\nfor j in range(1000,0,-1):\r\n if abs(v2-j)<=d:\r\n dp[t][j] = v2\r\n\r\nfor i in range(t-1,0,-1):\r\n for j in range(1000,0,-1):\r\n for k in range(-d,d+1):\r\n if j+k>=0 and j+k<=1000:\r\n dp[i][j] = max(dp[i][j], j+k + dp[i+1][j+k])\r\n\r\n\r\nprint(v1 + dp[2][v1])\r\n", "\r\n#for _ in range(int(input())):\r\nimport math\r\nv1,v2= map(int, input().split())\r\nt,d= map(int, input().split())\r\nans=v1+v2\r\nspeed=v1\r\nrem=t-2+1\r\nfor i in range(t-2):\r\n if speed+d-(rem-1)*d<=v2:\r\n speed+=d\r\n ans+=speed\r\n rem-=1\r\n else:\r\n x=v2+(rem-1)*d-speed\r\n if x==0:\r\n ans+=speed\r\n rem-=1\r\n elif x>0:\r\n speed+=x\r\n ans+=speed\r\n rem-=1\r\n else:\r\n speed-=min(d,abs(v2+(rem-1)*d-speed))\r\n ans+=speed\r\n rem-=1\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n", "v1,v2,t,d= (int(x) for x in input().split()+input().split())\r\nans = 0\r\nfor i in range(t):\r\n ans += min(v1+i*d,v2+(t-i-1)*d)\r\nprint(ans)\r\n\r\n", "v1, v2 = map(int, input().split())\r\nt, d = map(int, input().split())\r\n\r\nv = v1\r\nans = v1\r\nfor i in range(1, t):\r\n delta = v2 - v + (t - i - 1) * d\r\n v += min(d, delta)\r\n ans += v\r\n\r\nprint(ans)", "import sys,os,io\r\nimport math,bisect,operator\r\ninf,mod = float('inf'),10**9+7\r\n# sys.setrecursionlimit(10 ** 6)\r\nfrom itertools import groupby,accumulate\r\nfrom heapq import heapify,heappop,heappush\r\nfrom collections import deque,Counter,defaultdict\r\ninput = iter(sys.stdin.buffer.read().decode().splitlines()).__next__\r\nNeo = lambda : list(map(int,input().split()))\r\n# test, = Neo()\r\nu,v = Neo()\r\nt,d = Neo()\r\nAns = 0\r\nif d == 0:\r\n Ans += t*u\r\n print(Ans)\r\n exit()\r\nfor i in range(t):\r\n p = i\r\n q = i+1\r\n s = u\r\n e = v\r\n k = 0\r\n for a in range(i+1):\r\n k += s\r\n s += d\r\n for b in range(q,t):\r\n k += e\r\n e += d\r\n if abs(e-s) <= d:\r\n Ans = max(Ans,k)\r\n elif e > s:\r\n c = 0\r\n k -= e\r\n while c <= d:\r\n z = e-c\r\n if abs(z-s) <= d:\r\n k += z\r\n Ans = max(Ans,k) \r\n break\r\n c += 1\r\n else:\r\n c = 0\r\n k -= s\r\n while c <= d:\r\n z = s-c\r\n if abs(z-e) <= d:\r\n k += z\r\n Ans = max(Ans,k) \r\n break\r\n c += 1\r\nprint(Ans) \r\n \r\n \r\n \r\n ", "R = lambda : map(int, input().split())\r\nF = lambda : [int(x) for x in input().split()]\r\nv1, v2 = R()\r\nt, d = R()\r\nans = v1 + v2\r\na1 = []\r\na2 = []\r\nt1 = v1\r\nt2 = v2\r\nfor i in range(t-2):\r\n t1 += d\r\n t2 += d\r\n a1.append(t1)\r\n a2.append(t2)\r\na2.reverse()\r\nfor i in range(t-2):\r\n ans += min(a1[i], a2[i])\r\nprint(ans)\r\n", "def main():\r\n v1, v2 = (int(i) for i in input().split())\r\n t, d = (int(i) for i in input().split())\r\n\r\n res = 0\r\n for i in range(t):\r\n res += min(v1 + d*i, v2 + d*(t - i - 1))\r\n print(res)\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "u,v=(int(i) for i in input().split())\r\nt,d=(int(i) for i in input().split())\r\ndist=0\r\nfor i in range(t):\r\n dist+=min(u+(d*i),v+(d*(t-i-1)))\r\nprint(dist)", "import sys \r\ninput = sys.stdin.readline \r\n\r\na, b = map(int, input().split())\r\nt, d = map(int, input().split())\r\n\r\nd1, d2 = [0] * t, [0] * t \r\nd1[0], d2[-1] = a, b \r\nfor i in range(1, t):\r\n d1[i] = d1[i - 1] + d \r\nfor i in range(t - 2, -1, -1):\r\n d2[i] = d2[i + 1] + d \r\nc = 0 \r\ns2 = sum(d2)\r\ns1 = 0\r\nfor i in range(t - 1):\r\n s1 += d1[i]\r\n s2 -= d2[i]\r\n if(abs(d2[i + 1] - d1[i]) <= d):\r\n c = max(c, s1 + s2)\r\nprint(c)", "v1, v2 = [int(x) for x in input().split()]\nt, d = [int(x) for x in input().split()]\n\ntotal = 0\n\nfor i in range(t):\n total += v1\n \n if v1 + d - (t - i - 2) * d <= v2:\n v1 += d\n else:\n v1 = v2 + (t - i - 2) * d \n\nprint(total)\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", "v1,v2 = map(int,input().split())\nt,d = map(int,input().split())\nif v1>v2:\n z = v1\n v1 = v2\n v2 = z\nans = v1\ncur = v1\nfor i in range(2,t+1):\n temp = (t-i)*d\n f = 0\n for j in range(d,-1,-1):\n if abs((cur+j)-v2)<=temp:\n f=1\n cur += j\n ans+=cur\n break\n #print(cur,ans,i)\n if f==0:\n req = cur-v2\n z = i\n if (req%d)!=0:\n cur-=(req%d)\n z = i+1\n ans+=cur\n for j in range(z,t+1):\n cur-=d\n if cur>=v2:\n ans+=cur\n else:\n ans+=v2\n break\n#print(j)\nprint(ans)", "def f(start,end,time,dif):\r\n\tdp=[[-float(\"inf\") for j in range(1000) ]for i in range(time+1)]\r\n\tdp[0][start]=start\r\n\tfor i in range(time):\r\n\t\tfor val in range(1000):\r\n\t\t\tfor d in range(-dif,dif+1):\r\n\t\t\t\tif val+d>=0 and val+d<1000:\r\n\t\t\t\t\tdp[i+1][val+d]=max(dp[i][val]+val+d,dp[i+1][val+d])\r\n\r\n\treturn dp[time-1][end]\r\n\r\n\r\n\r\n\r\nstart,end=map(int,input().strip().split())\r\ntime,dif=map(int,input().strip().split())\r\nprint(f(start,end,time,dif))\r\n'''\r\n\r\n ▄████████ ▄█ █▄ ▄█ ▄█ █▄ ▄████████ ▄████████ ▄█\r\n ███ ███ ███ ███ ███ ███ ███ ███ ███ ███ ███ ███\r\n ███ █▀ ███ ███ ███▌ ███ ███ ███ ███ ███ ███ ███\r\n ███ ▄███▄▄▄▄███▄▄ ███▌ ███ ███ ▄███▄▄▄▄██▀ ███ ███ ███\r\n▀███████████ ▀▀███▀▀▀▀███▀ ███▌ ███ ███ ▀▀███▀▀▀▀▀ ▀███████████ ███\r\n\t\t ███ ███ ███ ███ ███ ███ ▀███████████ ███ ███ ███\r\n ▄█ ███ ███ ███ ███ ███ ███ ███ ███ ███ ███ ███▌ ▄\r\n ▄████████▀ ███ █▀ █▀ ▀██████▀ ███ ███ ███ █▀ █████▄▄██\r\n\t\t\t\t\t\t\t\t\t\t\t ███ ███ ▀\r\n\r\n'''\r\n", "# maa chudaaye duniya\r\nv1, v2 = sorted(list(map(int, input().split())))\r\nt, d = map(int, input().split())\r\ns = v1 + v2\r\nfor i in range(1, t-1):\r\n s += min(v1 + d*i, v2 + d*(t-i-1))\r\nprint(s)", "v1, v2 = list(map(int, input().rstrip().split()))\nt, d = list(map(int, input().rstrip().split()))\nl = 0\nfor i in range(t):\n l += min(v1 + d * i, v2 + d * (t - i - 1))\nprint(l)", "v1, v2 = map(int, input().split())\r\nt, d = map(int, input().split())\r\nans = v1 + v2\r\nv = v1\r\nfor i in range(2, t):\r\n v = min(v + d, v2 + d * (t - i))\r\n ans += v\r\nprint(ans)# 1690823324.6812541", "#input data\r\nv1, v2 = map(int, input().split())\r\nt, d = map(int, input().split())\r\n\r\n#solve via math\r\nans = sum( (min(v1 + d*i, v2 + d*(t - i - 1)) for i in range(t)) )\r\nprint(ans)\r\n", "import sys\r\ninput= lambda:sys.stdin.readline()\r\nMOD = 1000000007\r\nii = lambda: int(input())\r\nsi = lambda: input()\r\ndgl = lambda: list(map(int, input()))\r\nf = lambda: list(map(int, input().split()))\r\nil = lambda: list(map(int, input().split()))\r\nls = lambda: list(input())\r\nv1, v2 = f()\r\nt, d = f()\r\nlf, lb = [0]*t, [0]*t\r\nlf[0]=v1\r\nlb[-1]=v2\r\nsff,sfb=[0]*t,[0]*t\r\nsff[0],sfb[-1]=v1,v2\r\nfor i in range(1,t):\r\n lf[i]=lf[i-1]+d\r\n lb[t-i-1]=lb[t-i]+d\r\n sff[i]=sff[i-1]+lf[i]\r\n sfb[t-i-1]=sfb[t-i]+lb[t-i-1]\r\nmx=0\r\nfor i in range(t-1):\r\n if abs(lf[i]-lb[i+1])<=d:\r\n mx=max(mx,sff[i]+sfb[i+1])\r\nprint(mx)\r\n", "a,l=map(int,input().split())\r\nn,d=map(int,input().split())\r\nx=[]\r\ny=[0]*n\r\nfor i in range(n):\r\n x+=[a+i*d]\r\nfor i in range(n):\r\n y[n-1-i]=l+i*d\r\n\r\n\r\nz=[min(x[i],y[i])for i in range(n)]\r\nprint(sum(z))", "v1, v2 = list(map(int, input().split()))\r\nt, d = list(map(int, input().split()))\r\n\r\nif v1 > v2:\r\n v1, v2 = v2, v1\r\n\r\nif d == 0:\r\n print(t * v1)\r\nelse:\r\n a = [i for i in range(v1, v1 + t * d, d)]\r\n b = [i for i in range(v2, v2 + t * d, d)]\r\n b.reverse()\r\n i = 0\r\n answer = 0\r\n while i < t - 1:\r\n if abs(a[i] - b[i + 1]) <= d:\r\n if sum(a[:i + 1]) + sum(b[i + 1:]) > answer:\r\n answer = sum(a[:i + 1]) + sum(b[i + 1:])\r\n i += 1\r\n print(answer)\r\n", "v1,v2=map(int,input().split())\r\nt,d=map(int,input().split())\r\nans=0\r\nfor i in range(t):\r\n ans+=min(v1+d*i,v2+d*(t-i-1))\r\nprint(ans)", "'''input\r\n10 10\r\n10 0\r\n11\r\n5 4 5 5 6 7 8 8 8 7 6\r\n'''\r\n#534b\r\nr=lambda:map(int,input().split())\r\na,b=r();t,d=r()\r\nprint(sum(min(a+d*i,b+d*(t-i-1)) for i in range(t)))\r\nquit()\r\n#602/b\r\nn = int(input())\r\narr = tuple(map(int,input().split()))\r\nl = 0\r\nlastedgelocation = 0\r\nlastedge = 0\r\nmaxx = -1\r\nfor i in range(1,n):\r\n\ttemp = arr[i]-arr[i-1]\r\n\tif temp:\r\n\t\tif temp==lastedge:\r\n\t\t\tl = lastedgelocation\r\n\t\tlastedge = temp\r\n\t\tlastedgelocation = i\r\n\tmaxx = max(maxx,i-l+1)\r\nprint(maxx)\r\n#1189/c\r\nn = int(input())\r\na = tuple(map(int,input().split()))\r\nblock_size = int(pow(n,0.5))\r\nb = [0 for i in range(n//block_size+2)]\r\nfor i in range(0,n,block_size):\r\n\tb[i//block_size] = sum(a[i:i+block_size])\r\nq = int(input())\r\nfor _ in range(q):\r\n\tl,r = map(lambda x:int(x)-1,input().split())\r\n\tl1,l2 = l//block_size ,r//block_size\r\n\ts = sum(b[l1:l2]) - sum(a[l1*block_size:l]) + sum(a[l2*block_size:r+1])\r\n\tprint(s//10)", "#! /usr/bin/python3\nv1, v2 = map(int, input().strip().split())\nt, d = map(int, input().strip().split())\n\nspeeds = [0] * t\nspeeds[0] = v1\nspeeds[t-1] = v2\n\nfor i in range(1, t - 1):\n\tspeeds[i] = min(v1 + d * i, v2 + d * (t - i - 1))\n\n\nprint(sum(speeds))", "import itertools\n\n\nv1, v2 = map(int, str.split(input()))\nt, d = map(int, str.split(input()))\n\ncv = v1\ns = v1 + v2\nsteps = list(itertools.accumulate((v1,) + tuple(range(2, t)), lambda x, _: x + d)) + [v2]\nfor i in range(t - 1, -1, -1):\n\n if steps[i - 1] - steps[i] > d:\n\n steps[i - 1] = steps[i] + d\n\n else:\n\n break\n\nprint(sum(steps))\n", "v1,v2 = map(int,input().split())\r\nt,d = map(int,input().split())\r\nif d==0:\r\n print(v1*t)\r\n exit()\r\n\r\nprint(sum(min(v1+d*i, v2+d*(t-i-1)) for i in range(t)))\r\n", "v1, v2 = map(int, input().split())\nt, d = map(int, input().split())\n\npath = v1 + v2\n\nfor i in range(1, t - 1):\n\tpath += min(v1 + d * i, v2 + d * (t - 1 - i))\n\nprint(path)\n" ]

[ "n, m = map(int, input().split())\n\npackages = list(map(int, input().split()))\n\ncounts = dict()\n\nfor p in packages:\n\tif p in counts:\n\t\tcounts[p] += 1\n\telse:\n\t\tcounts[p] = 1\n\narrayCounts = []\nfor package, count in counts.items():\n\tarrayCounts.append(count)\n\narrayCounts.sort()\narrayCounts.reverse()\n\nfor i in range(m//n+1):\n\tdays = i+1\n\tpeople = 0\n\tfor type in arrayCounts:\n\t\tpeople += type//days\n\tif people < n:\n\t\tbreak\n\nprint(i)", "people_quantity, food_package_quantity = map(int, input().split())\r\nfood_type_sequence = list(map(int, input().split()))\r\n\r\nfood_type_quantity_sequence = [0]*101\r\n\r\nfor i in food_type_sequence:\r\n food_type_quantity_sequence[i] += 1\r\n\r\n# For d days, maximum how many people can go?\r\n\r\nfor day in range(food_package_quantity, -1, -1):\r\n max_people_possible = 0\r\n if day == 0:\r\n print(0)\r\n break\r\n for food_type_quantity in food_type_quantity_sequence:\r\n max_people_possible += food_type_quantity // day\r\n if max_people_possible >= people_quantity:\r\n print(day)\r\n break", "from collections import Counter\r\n\r\nnpar, npack = map(int, input().split())\r\npack_arr = list(map(int, input().split()))\r\n\r\nif npar > npack:\r\n print(0)\r\nelif npack//npar == 1:\r\n print(1)\r\nelse:\r\n occurences = Counter(pack_arr)\r\n longest_days = 1\r\n for days in range(2, npack//npar + 1):\r\n current_ful = 0\r\n for k in occurences:\r\n current_ful += occurences[k]//days\r\n if current_ful >= npar:\r\n longest_days = days\r\n break\r\n else:\r\n break\r\n print(longest_days)\r\n ", "n,m=map(int,input().split())\r\na=input().split()\r\nls=[0 for i in range(100)]\r\nfor i in range(m):\r\n ls[int(a[i])-1]+=1\r\na.sort(reverse=True)\r\nans=m//n\r\nwhile ans:\r\n count=0\r\n for i in range(100):\r\n count+=ls[i]//ans\r\n if(count>=n):\r\n break\r\n ans-=1\r\nprint(max(ans,0)) ", "n, m = map(int, input().split())\nx = list(map(int, input().split()))\ndata = 101 * [0]\nfor item in x:\n data[item] += 1\nmax_ans = m // n\nwhile max_ans > 0:\n diff = m - max_ans * n\n remnants = 0\n for item in data:\n remnants += item % max_ans\n if remnants > diff:\n max_ans -= 1\n else:\n break\nprint(max_ans)\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\n\r\nm, n = ints()\r\na = ints()\r\n\r\ndef check(x):\r\n cnt = 0\r\n f = collections.defaultdict(int)\r\n for i in range(n):\r\n f[str(a[i])] += 1\r\n for key, val in f.items():\r\n cnt += val//x\r\n return cnt >= m\r\n\r\nl = 1\r\nr = 10 ** 9\r\nwhile l <=r:\r\n mid = (l + r) // 2\r\n if check(mid):\r\n l = mid + 1\r\n else:\r\n r = mid - 1\r\nprint(l - 1)", "n, m = map(int, input().split())\r\n\r\nc = [0 for i in range(110)]\r\n\r\nfor el in input().split():\r\n c[int(el)] += 1\r\nans = 100\r\n\r\nfor i in range(100, 0, -1):\r\n t = n\r\n for j in range(1, 102):\r\n t -= c[j] // i\r\n if t <= 0:\r\n print(i)\r\n exit(0)\r\nprint(0)", "def solve(particpant,package,seq) :\r\n maximumDays = package//particpant\r\n seq.sort()\r\n while maximumDays > 0 :\r\n participantFed = 0\r\n type = seq[0]\r\n temp = 0\r\n for x in seq :\r\n if temp == maximumDays :\r\n participantFed += 1\r\n temp = 1\r\n type = x\r\n else :\r\n if type == x :\r\n temp += 1\r\n else :\r\n type = x\r\n temp = 1\r\n \r\n if temp == maximumDays :\r\n participantFed += 1\r\n \r\n if participantFed >= particpant :\r\n return maximumDays\r\n \r\n maximumDays -= 1\r\n \r\n return maximumDays\r\n \r\n\r\np,pa = list(map(int,input().split()))\r\nseq = list(map(int,input().split()))\r\n\r\nprint (solve(p,pa,seq))\r\n \r\n ", "from collections import*\nR=lambda:map(int,input().split())\nn,m=R()\na=Counter(R()).values()\ni=1\nwhile sum(x//i for x in a)>=n:i+=1\nprint(i-1)", "from collections import*\r\nn, m = map(int, input().split())\r\na = Counter(map(int, input().split())).values()\r\ni = 1\r\nwhile sum(x // i for x in a) >= n:\r\n i += 1\r\nprint(i - 1)", "from collections import defaultdict\r\n\r\ndef planning_the_expedition():\r\n limit = 100\r\n \r\n n, m = map(int, input().split())\r\n \r\n food_types = [int(k) for k in input().split()]\r\n \r\n if m < n:\r\n return 0\r\n\r\n food_count = defaultdict(int)\r\n \r\n for f in food_types:\r\n food_count[f] += 1\r\n\r\n for day in range(limit,0,-1):\r\n fc = food_count.copy()\r\n k = 0\r\n\r\n for f_type in fc.keys():\r\n while fc[f_type] >= day:\r\n fc[f_type] -= day\r\n k += 1\r\n\r\n if k >= n:\r\n return day\r\n \r\n return 0\r\n \r\nprint(planning_the_expedition())\r\n\r\n", "from collections import Counter\r\nimport copy\r\n\r\n\r\ndef main():\r\n n, m = get_list_int()\r\n food_types = Counter(get_list_int())\r\n foods = sorted(food_types.values(), reverse=True)\r\n\r\n for day in range(max(foods) + 1):\r\n food_copy = copy.copy(foods)\r\n idx = 0\r\n people_fed = 0\r\n\r\n while people_fed < n:\r\n if idx >= len(foods):\r\n print(day - 1)\r\n return\r\n\r\n if food_copy[idx] >= day:\r\n food_copy[idx] -= day\r\n people_fed += 1\r\n else:\r\n idx += 1\r\n\r\n print(max(foods))\r\n\r\n\r\ndef get_int() -> int:\r\n return int(input())\r\n\r\n\r\ndef get_list_int() -> list[int]:\r\n return [int(x) for x in input().split(\" \")]\r\n\r\n\r\ndef get_list_str() -> list[str]:\r\n return input().split(\" \")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "from collections import Counter\n\npessoas, pacotes = map(int,input().split())\ncomidas = map(int, input().split())\nvetor = list(Counter(comidas).values())\ndias = pacotes//pessoas\nwhile dias > 0:\n if sum([comida//dias for comida in vetor]) >= pessoas:\n break\n dias-=1\nprint(dias)", "a=input().split()\r\nn=int(a[0])\r\nm=int(a[1])\r\na=input().split()\r\ndic = {}\r\nfor i in a:\r\n dic[i] = 0\r\nfor i in a:\r\n dic[i] += 1\r\nmaxv = int(max(dic.values()))\r\nflag = False\r\nfor i in range(maxv,0,-1):\r\n c=0\r\n for j in dic:\r\n c += dic[j]//i\r\n if c>=n:\r\n flag=True\r\n break\r\nif flag:\r\n print(i)\r\nelse:\r\n print(0)\r\n", "def proverka(k, n):\r\n kol = 0\r\n i = 0\r\n while i < len(count) and kol < n:\r\n kol += count[i] // k\r\n i += 1\r\n return kol >= n\r\n\r\n\r\nn, m = map(int, input().split())\r\nmyList = list(map(int, input().split()))\r\ncount = [0] * 101\r\nfor elem in myList:\r\n count[elem] += 1\r\ns = sum(count)\r\nif s < n:\r\n print(0)\r\nelse:\r\n k = 1\r\n new_k = 2\r\n count.sort(reverse=True)\r\n while True:\r\n if proverka(new_k, n):\r\n k = new_k\r\n new_k = k + 1\r\n else:\r\n break\r\n print(k)\r\n", "def f(n, order, i):\r\n num = 0\r\n for c in order:\r\n num += int(c / i)\r\n if num >= n:\r\n return True\r\n return False\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n, m = map(int, input().split(\" \"))\r\n inputs = list(map(int, input().split(\" \")))\r\n l = [0] * 100\r\n for i in inputs:\r\n l[i - 1] += 1\r\n order = []\r\n for i in range(100):\r\n if l[i] != 0:\r\n order.append(l[i])\r\n # print(order)\r\n best = 0\r\n minn = 1\r\n maxx = sum(order)+1\r\n while minn != maxx:\r\n middle = int((minn + maxx) / 2)\r\n if f(n, order, middle):\r\n best = middle\r\n minn = middle + 1\r\n else:\r\n maxx = middle\r\n print(int(best))\r\n", "if __name__ == \"__main__\":\r\n n, m = map(int, input().split(\" \"))\r\n inputs = list(map(int, input().split(\" \")))\r\n l = [0] * 100\r\n for i in inputs:\r\n l[i - 1] += 1\r\n order = []\r\n for i in range(100):\r\n if l[i] != 0:\r\n order.append(l[i])\r\n # print(order)\r\n best = 0\r\n for i in range(100, 0, -1):\r\n num = 0\r\n for c in order:\r\n num += int(c / i)\r\n if num >= n:\r\n best = i\r\n break\r\n print(int(best))\r\n", "[n, m] = map(int, input().split())\r\ndata = list(map(int, input().split()))\r\ncnt = [0] * 120\r\nfor i in data:\r\n cnt[i] += 1\r\n\r\nans = 0\r\ni = 1\r\nwhile True:\r\n ans = 0\r\n for j in cnt:\r\n ans += j//i\r\n if ans < n:\r\n print(i-1)\r\n break;\r\n i += 1\r\n", "#print('hare krishna')\r\nn,m=map(int,input().split())\r\nl=[int(i) for i in input().split()]\r\nlo=1 \r\nhi=10**5 \r\nans=0 \r\nfrom collections import Counter \r\nc=Counter(l)\r\n#print(c)\r\ndef pzbl(mi):\r\n sm=0 \r\n for i in c:\r\n sm+=c[i]//mi \r\n return sm>=n\r\nwhile lo<=hi:\r\n mi=(lo+hi)//2\r\n if pzbl(mi):\r\n ans=mi \r\n lo=mi+1 \r\n else:\r\n hi=mi-1 \r\nprint(ans)", "from collections import Counter,defaultdict,deque\r\n\r\nread = lambda : list(map(int,input().split()))\r\ngetinfo = lambda grid: print(list(map(print,grid)))\r\np = lambda x: print(x,end=\" \")\r\n\r\nmod = 10**9 + 7\r\ninf = float('inf')\r\n\r\ndef lastDay(n, day):\r\n\tif day == 0: return True\r\n\tnum = 0\r\n\tfor val in d.values():\r\n\t\tnum += val // day\r\n\t\tif num >= n: return True\r\n\treturn False\r\n\r\nwhile True:\r\n\ttry:\r\n\t\tn, m = read()\r\n\t\ta = read()\r\n\t\td = Counter(a)\r\n\t\tl, r = 0, max(d.values())\r\n\t\twhile l < r - 1:\r\n\t\t\tmid = (l + r) // 2\r\n\t\t\tif lastDay(n, mid):\r\n\t\t\t\tl = mid\r\n\t\t\telse:\r\n\t\t\t\tr = mid\r\n\r\n\t\tif lastDay(n, r):\r\n\t\t\tprint(r)\r\n\t\telse:\r\n\t\t\tprint(l)\r\n\texcept:\r\n\t\tbreak\r\n\r\n", "n , m = map(int,input().split())\r\n\r\ndata = list(map(int,input().split()))\r\n\r\nl = -1\r\n\r\nr = m + 1\r\n\r\nd = {}\r\n\r\nfor el in data:\r\n if d.get(el) is None:\r\n d[el] = 0\r\n d[el] += 1\r\n\r\ndef check(value):\r\n if value == 0:\r\n return True\r\n \r\n boys = 0\r\n for el in d.values():\r\n boys += el // value\r\n\r\n return boys >= n\r\n\r\nans = 0\r\nwhile check(ans):\r\n ans+=1\r\n\r\nprint(ans - 1)\r\n \r\n", "nk=input().split(\" \")\r\nn=int(nk[0])\r\nraw_food=input().split(\" \")\r\nfood=[0]*101\r\nfor i in range(len(raw_food)):\r\n food[int(raw_food[i])]=food[int(raw_food[i])]+1\r\nmaxans=0 \r\ni=1\r\npeople=0\r\nwhile i<101:\r\n j=0\r\n gfood=food.copy()\r\n people=0\r\n while (j<101)and(people<n):\r\n if gfood[j]>=i:\r\n gfood[j]=gfood[j]-i\r\n people=people+1\r\n elif (gfood[j]<i):\r\n j=j+1\r\n if people==n:\r\n maxans=i\r\n i=i+1\r\nprint(maxans) \r\n", "def check(t,dict):\r\n count=0\r\n for i in dict:\r\n count+=dict[i]//t\r\n return count\r\nnm=input().split()\r\nn,m=int(nm[0]),int(nm[1])\r\na=list(map(int,input().split()))\r\ndict={}\r\nfor i in a:\r\n if i in dict:\r\n dict[i]+=1\r\n else:\r\n dict[i]=1\r\nmaxx=-1\r\nfor i in dict:\r\n if dict[i]>maxx:\r\n maxx=dict[i]\r\nans=-1\r\nlow,high=1,maxx\r\nwhile(low<=high):\r\n mid=(low+high)//2\r\n if check(mid,dict)>=n:\r\n ans=mid\r\n low=mid+1\r\n else:\r\n high=mid-1\r\nif ans==-1:\r\n print(0)\r\nelse:\r\n print(ans)\r\n", "n, m = map(int, input().split())\r\na = {}\r\nfor i in map(int, input().split()):\r\n if not i in a:\r\n a[i] = 0\r\n a[i] += 1\r\nl, r = 0, m\r\nwhile l != r:\r\n k = (l + r + 1) // 2\r\n if k == 0:\r\n p = n\r\n else:\r\n p = sum([y // k for x, y in a.items()])\r\n if p >= n:\r\n l = k\r\n else:\r\n r = k - 1\r\nprint(l)\r\n", "from collections import Counter\r\nn, m = map(int, input().split())\r\nf = Counter(map(int, input().split())).values()\r\nlo, hi = 0, 101\r\nwhile lo + 1 < hi:\r\n mi = lo + hi >> 1\r\n if sum(fi // mi for fi in f) >= n:\r\n lo = mi\r\n else:\r\n hi = mi\r\nprint(lo)\r\n", "from collections import Counter\r\n \r\nn,m=list(map(int,input().split()))\r\npackets=list(map(int,input().split()))\r\npackets=dict(Counter(packets))\r\nval=packets.values()\r\n\r\n#print(list(val))\r\ni=1\r\nwhile(True):\r\n sum=0\r\n for j in val:\r\n sum+=int(j/i)\r\n if(sum<n):\r\n break\r\n i+=1\r\nprint(i-1)", "R=lambda:list(map(int,input().split()))\r\nn,m=R()\r\na=R()\r\nd={}\r\nfor i in a:d[i]=0\r\nfor i in a:d[i]+=1\r\nb=1\r\nwhile sum(d[i]//b for i in d)>=n: b+=1\r\nprint(b-1)", "n,m=map(int,input().split())\r\nd={}\r\nans=cnt=0\r\nfor i in map(int,input().split()):\r\n d[i]=d.get(i,0)+1\r\nfor i in range(1,m+1):\r\n cnt=0\r\n for v in d.items():\r\n cnt+=v[1]//i\r\n if cnt>=n: ans=i\r\nprint(ans)", "[n,m] = [int(i) for i in input().split()]\r\nfoods = [0]*101\r\n\r\nflag = 0\r\nfor i in input().split():\r\n foods[int(i)] += 1\r\n\r\nfor d in range(m,0,-1):\r\n copy = list(foods)\r\n k = 0\r\n for i in range(101):\r\n while copy[i] >= d:\r\n k += 1\r\n copy[i] -= d\r\n\r\n if k >= n:\r\n print(d)\r\n flag = 1\r\n break\r\n\r\nif not flag:\r\n print(0)\r\n\r\n", "n, m = map(int, input().split())\r\na = map(int, input().split())\r\n\r\ncounts = { }\r\n\r\nfor i in a:\r\n counts[i] = counts.setdefault(i, 0) + 1\r\n\r\nl = 0\r\nr = m // n\r\n\r\nwhile l < r:\r\n m = (l + r + 1) // 2\r\n \r\n s = 0\r\n for v in counts.values():\r\n s += v // m\r\n\r\n if s >= n:\r\n l = m\r\n else: \r\n r = m - 1\r\n\r\nprint(l)", "n,m=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\na.sort()\r\nl=[]\r\ny=[0]\r\nfor i in range(m):\r\n if i==0:\r\n l.append(1)\r\n continue\r\n if a[i]==a[i-1]:\r\n l[-1]+=1\r\n else:\r\n l.append(1)\r\nfor i in range(1,101):\r\n z=0\r\n lcopy = l.copy()\r\n for k in range(len(lcopy)):\r\n while lcopy[k]-i>=0:\r\n lcopy[k]-=i\r\n z+=1\r\n if z>=n:\r\n y.append(i)\r\n else:\r\n break\r\nprint(y[-1])\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\ncnt = [0] * 105\r\nfor i in a:\r\n cnt[i] += 1\r\nans = 0\r\nwhile True:\r\n x = ans + 1\r\n c = 0\r\n for i in cnt:\r\n c += i // x\r\n if n > c:\r\n break\r\n ans += 1\r\nprint(ans)", "import collections\r\n\r\n\r\nn, m = map(int, input().split())\r\nt = collections.Counter(input().split())\r\nleft = 0\r\nright = 1000\r\nwhile left + 1 < right:\r\n mid = left + (right - left) // 2\r\n if sum([k // mid for k in t.values()]) < n:\r\n right = mid\r\n else:\r\n left = mid\r\n\r\nprint(left)", "n, m = map(int, input().split())\r\ndiv = m//n\r\na = [int(x) for x in input().split()]\r\nb = {}\r\nc = []\r\nd = 0\r\nfor x in a:\r\n if x not in b:\r\n b[x] = 1\r\n else: b[x] += 1\r\nfor key, value in b.items():\r\n c.append(value)\r\nc.sort(reverse=True)\r\ntemp = 0\r\nif len(c) > n:\r\n print(c[n-1])\r\nelse:\r\n while div > 0:\r\n temp = 0\r\n for x in c:\r\n temp += x//div\r\n if temp >= n:\r\n break\r\n else: div -=1\r\n print(div)", "n, m = map(int, input().split())\na = list(map(int, input().split()))\nmp = {}\nfor i in a:\n if i in mp:\n mp[i] += 1\n else:\n mp[i] = 1\nfor ans in range(10000, -1, -1):\n tmp = 0\n if ans == 0:\n print(ans)\n break\n for i in mp.values():\n tmp += i // ans\n if tmp >= n:\n print(ans)\n break\n\n\t\t \t\t\t \t\t \t\t\t\t\t \t\t\t\t\t", "'''\n# 07.08.2021\n#\n# CF 499 B\n'''\n\nn, m = map (int, input ().split ())\n\np = [0]*100\ns = input ().split ()\nfor i in range (m) :\n d = int (s [i]) - 1\n p [d] += 1\n\nk = 0\nfor i in range (1, 101) :\n sum = 0\n for j in range (100) :\n sum += p [j] // i\n if sum >= n :\n k = i\n\nprint (k)\n", "#k = int(input())\r\nimport sys\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\n#a = input()\r\na.sort()\r\nb = [1]\r\nfor i in range(1, len(a)):\r\n if( a[i] == a[i-1] ):\r\n b[-1] += 1\r\n else:\r\n b.append( 1 )\r\nb.sort(reverse=True)\r\nkol = 0\r\nflag = True\r\nfor i in range(100, 0, -1):\r\n for j in range(len(b)):\r\n kol += b[j] // i\r\n if( kol >= n ):\r\n print(i)\r\n flag = False\r\n break\r\n kol = 0\r\nif flag:\r\n print(0)", "n,m = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nif n > m:\r\n print(0)\r\n exit()\r\n\r\nans = 0\r\nd = {}\r\nfor i in l:\r\n if i in d:\r\n d[i] += 1\r\n\r\n else:\r\n d[i] = 1\r\n\r\nfor days in range(1,m+1):\r\n flag = 0\r\n c = {}\r\n for g in d:\r\n c[g] = d[g]\r\n\r\n for i in range(n):\r\n f = 0\r\n for j in d:\r\n if d[j] >= days:\r\n d[j] -= days\r\n f = 1\r\n break\r\n\r\n\r\n if f == 0:\r\n flag = 1\r\n break\r\n\r\n d = c\r\n if flag == 0:\r\n ans = max(ans,days)\r\n\r\nprint(ans)", "from collections import Counter\n\nparam = input().split()\nfood_types = list(Counter(input().split()).values())\n\ndays = 1\npeople = int(param[0])\npeople_fed = sum(food_types)\nwhile people_fed >= people:\n days += 1\n people_fed = 0\n for food in food_types:\n people_fed += food // days\nprint(days - 1)\n\n\t\t \t \t\t\t \t \t\t\t\t\t \t \t\t\t", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nvis = [0 for i in range(105)]\r\nfor i in range(m):\r\n vis[a[i]] += 1\r\nans = 0\r\nfor i in range(1, m + 1):\r\n cnt = 0\r\n for j in range(1, 101):\r\n cnt += vis[j] // i\r\n if cnt >= n:\r\n ans = max(ans, i)\r\nprint(ans)", "'''input\r\n3 9\r\n42 42 42 42 42 42 42 42 42\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\nfrom array import array\r\nINF = 9999999999999999\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,m = getints()\r\narr = getints()\r\narr = Counter(arr)\r\narr = list(map(lambda v: v[1], arr.items()))\r\n\r\n\r\ndef check(d):\r\n\tcnt = 0\r\n\tfor e in arr:\r\n\t\tcnt += e//d\r\n\treturn cnt>=n\r\n\r\nans = 0\r\nfor d in range(1,100000):\r\n\tif check(d):\r\n\t\tans = d\r\n\telse:break\r\nprint(ans)", "#a = list(map(int, input().strip().split()))\r\n\r\nn, m = list(map(int, input().strip().split()))\r\na = list(map(int, input().strip().split()))\r\n\r\nd = dict()\r\n\r\nfor i in a:\r\n try: d[i] += 1\r\n except: d[i] = 1\r\n \r\nres = []\r\n\r\nfor k in d.keys():\r\n res.append(d[k])\r\n \r\nres.sort()\r\n\r\nres = res[::-1]\r\n\r\nmaxt = m // n\r\nj = maxt\r\n\r\nwhile j > 0:\r\n tot = j * n\r\n for r in res:\r\n tot -= (r // j) * j\r\n if tot <= 0:\r\n maxt = j\r\n j = 0\r\n else:\r\n j -= 1\r\nprint(maxt)", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import defaultdict, deque\r\nfrom itertools import permutations\r\np = print\r\nr = range\r\ndef I(): return int(input())\r\ndef II(): return list(map(int, input().split()))\r\ndef S(): return input()[:-1]\r\ndef M(n): return [list(map(int, input().split())) for ___ in r(n)]\r\ndef pb(b): print('Yes' if b else 'No')\r\ndef INF(): return float('inf')\r\n# -----------------------------------------------------------------------------------------------------\r\n#\r\n# 　　　　　　　　　　　 ∧＿∧\r\n# 　　　　　 ∧＿∧ 　 （´<_｀ ）　 Welcome to My Coding Space !\r\n# 　　　　 （ ´_ゝ`）　/　 ⌒i Free Hong Kong !\r\n# 　　　　／　　　＼　 　 |　| Free Tibet !\r\n# 　　　 /　　 /￣￣￣￣/　|　 |\r\n# 　 ＿_(__ﾆつ/　 ＿/ .| .|＿＿＿＿\r\n# 　 　　　＼/＿＿＿＿/　（u　⊃\r\n#\r\n# 再帰関数ですか？　SYS!!!!\r\n# BINARY SEARCH ?\r\n# -----------------------------------------------------------------------------------------------------\r\nn, m = II()\r\na = II()\r\nd = defaultdict(int)\r\nfor i in a:\r\n d[i] += 1\r\nfor j in reversed(range(1,101)):\r\n pe = 0\r\n for i in d:\r\n pe += d[i] // j\r\n if pe >= n:\r\n p(j)\r\n exit(0)\r\np(0)", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=[]\r\nfor i in set(a):\r\n b.append(a.count(i))\r\nb.sort(reverse=True);r=0\r\nfor i in range(1,101):\r\n x=0\r\n for j in b:\r\n x+=j//i\r\n if x>=n:\r\n break\r\n if x>=n:\r\n r=max(r,i)\r\n else:break\r\nprint(r)", "from collections import Counter\r\nn, m = map(int, input().split())\r\nc = Counter(input().split()).values()\r\nd = 1\r\nwhile sum(ci//d for ci in c) >= n:\r\n d += 1\r\nprint(d - 1)\r\n\r\n", "from collections import defaultdict\r\n\r\ndef works(k,n,qty):\r\n\t\r\n\tif k==0 :\r\n\t\treturn True\r\n\t\r\n\tmaxppl=0\r\n\tfor key in qty.keys() :\r\n\t\tmaxppl += qty[key]//k\r\n\t\t\r\n\treturn maxppl>=n\t\r\n\t\r\ndef solve(n,m,arr):\r\n\t# print the max num of days the exped can last.\r\n\t\r\n\tqty = defaultdict(int)\r\n\t\r\n\tmaxdays = -float('inf')\r\n\tfor x in arr :\r\n\t\tqty[x]+=1\r\n\t\tmaxdays = max(maxdays,qty[x])\r\n\t\t\r\n\t# n ppl are there.\r\n\t\r\n\t# I think we can do bin search on k\r\n\t# k can at max be max freq, min will be 0. \r\n\t# True True True True True False False False.\r\n\t# Find the last True.\r\n\t\t\r\n\tl,r = 0,maxdays\r\n\t\t\r\n\twhile(l<r):\r\n\t\t\r\n\t\tk = (l+r+1)//2\r\n\t\t\r\n\t\t# True\t\r\n\t\tif works(k,n,qty) :\t\r\n\t\t\tl=k\r\n\t\telse :\r\n\t\t\tr=k-1\t\r\n\t\t\r\n\tprint(l)\t\r\n\t\r\nn,m = map(int,input().split())\r\narr= list(map(int,list(input().split())))\r\nsolve(n,m,arr)", "vis=[0]*105\nn,m=map(int,input().split())\na=list(map(int,input().split()))\nfor i in a:\n vis[i]+=1\nans=0\nfor i in range(1,m+1):\n cnt=0\n for j in range(1,101):\n cnt+=vis[j]//i\n if cnt>=n:\n ans=max(ans,i)\nprint(ans)\n \t \t \t\t \t\t\t \t\t\t\t\t \t \t\t\t\t\t", "from collections import*\r\nR=lambda:map(int,input().split())\r\nn,m=R()\r\na=Counter(R()).values()\r\ni=1\r\nwhile sum(x//i for x in a)>=n:i+=1\r\nprint(i-1)\r\n ", "n, m = map(int, input().split())\na = list(map(int, input().split()))\ndict = {i:0 for i in set(a)}\nfor i in range(m):\n dict[a[i]] += 1\nk = 1\nwhile sum(dict[i]//k for i in dict) >= n:\n k += 1\nprint(k - 1)\n", "n,m=map(int,input().split())\r\nc={}\r\nfor x in map(int,input().split()):c[x]=c.get(x,0)+1\r\nans=1\r\nwhile sum(c[i]//ans for i in c)>=n: ans+=1\r\nprint(ans-1)\r\n \r\n", "pf = [int(item) for item in input().split()] #[number of people, food packages]\nft = [int(item) for item in input().split()]\nif pf[0] > pf[1]: print(0)\nelse:\n ftd = {}\n for x in ft:\n if x in ftd:\n ftd[x] = ftd[x]+1\n else:\n ftd[x] = 1\n pot = int(pf[1]/pf[0])\n def food(x, d):\n lst = [int(i/x) for i in d.values()]\n if sum(lst) >= pf[0]:\n print(x)\n else:\n food(x-1, d)\n food(pot, ftd)\n\t \t \t \t\t \t\t \t \t\t\t \t\t\t\t \t\t", "#mashup2 \n'''\ns = input()\nd=s[1:]\nif (s.upper() == s):\n print(s.lower())\n\nelif (d.upper() == d):\n print(s[0:1].upper(), end = \"\")\n print(s[1:].lower())\nelse:\n print(s)\n\n\nn = int(input())\nl = list(map(int,input().split()))\nm = int(input())\nv=list(map(int,input().split()))\na,b=0,0\nd = [0]*(n+1)\nfor i in range(n) :\n\td[l[i]] = i\n\nfor q in v:\n\ta += d[q]+1\n\tb += n-d[q]\nprint(a,b)\n\n\nn=int(input())\ns=input()\nss=''\na=set()\nif len(set(s))<n:\n print('NO')\nelse:\n print('YES')\n for i in s:\n if n==0 or i in a:\n ss+=i\n else:\n ss+='\\n'+i\n a.add(i)\n n-=1\nprint(ss)\n\nn=int(input())\nr={}\nfor i in range(n):\n b=input()\n c=0\n o=0\n for i in range(len(b)):\n if(b[i]==\"(\"):o+=1\n else:\n if(o>0): o-=1\n else: c+=1\n if(c==0):\n if(o in r):r[o]+=1\n else: r[o]=1\n elif(o==0):\n if(-c in r): r[-c]+=1\n else:r[-c]=1\nt=0\nfor i in r:\n if(i>=0):\n if(-i in r): t+=r[-i]*r[i]\n \nprint (t)\n'''\n\nfrom collections import Counter\nn, m = list(map(int, input().split()))\nf = list(map(int, input().split()))\nc = dict(Counter(f))\nd = 1\nans = 0\nwhile d:\n t = 0\n for i in c.values():\n t += i//d\n if t >= n:\n ans = d\n else:\n break\n d += 1\nprint(ans)\n\n\n \t\t\t\t \t\t\t\t\t\t \t \t\t \t\t\t \t", "from collections import Counter\n\nn, m = map(int,input().split())\nc = Counter(input().split())\nc = tuple(c.values())\nfor d in range(1,102):\n\tif sum(map(lambda x:x//d, c)) < n:\n\t\tprint(d-1)\n\t\tbreak\n", "n, m = map(int, input().split())\r\nu = list(map(int, input().split()))\r\nu.sort()\r\ncp = []\r\ncnt = 1\r\nfor i in range(1, m):\r\n if u[i] == u[i - 1]:\r\n cnt += 1\r\n else:\r\n cp.append(cnt)\r\n cnt = 1\r\ncp.append(cnt)\r\ncp.sort(reverse = 1)\r\np = len(cp)\r\ndef chek(k):\r\n ind = 0\r\n cp1 = cp[:]\r\n for i in range(n):\r\n while ind < p and cp1[ind] < k:\r\n ind += 1\r\n if ind >= p:\r\n return False\r\n cp1[ind] -= k\r\n return True\r\nL = 0\r\nR = cp[0]\r\nwhile R - L > 1:\r\n m = (L + R) // 2\r\n if chek(m):\r\n L = m\r\n else:\r\n R = m\r\nif chek(R):\r\n print(R)\r\nelse:\r\n print(L)\r\n\r\n\r\n\r\n\r\n \r\n \r\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nd = dict()\r\nfor i in a:\r\n\tif i not in d:\r\n\t\td[i] = 1\r\n\telse:\r\n\t\td[i] += 1\r\nx = []\r\nfor j in d:\r\n\tx.append(d[j])\r\nx.sort(reverse = True)\r\ndef f(t):\r\n\tans = 0\r\n\tfor i in x:\r\n\t\tans += i // t\r\n\tif ans >= n:\r\n\t\treturn True\r\n\treturn False\r\nleft = 0\r\nright = 10 ** 9\r\nwhile (left + 1 != right):\r\n\tmid = (left + right) // 2\r\n\tif f(mid):\r\n\t\tleft = mid\r\n\telse:\r\n\t\tright = mid\r\nprint(left)\r\n#print(f(2))\r\n\r\n\t\r\n\r\n\t\t\t\r\n\r\n", "import math\r\n\r\n\r\ndef sum():\r\n y = 0\r\n ych = 0\r\n for i in range(len(lc) - 1, -1, -1):\r\n ych += 1\r\n if ych > n:\r\n return y\r\n y += lc[i] // day\r\n return y\r\n\r\n\r\nn, k = map(int, input().split())\r\nl = list(map(int, input().split()))\r\n\r\nif n > k:\r\n print(0)\r\nelse:\r\n l.sort()\r\n lc = []\r\n x = 1\r\n for i in range(0, k - 1):\r\n if l[i] == l[i + 1]:\r\n x += 1\r\n else:\r\n lc.append(x)\r\n x = 1\r\n if x != 1:\r\n lc.append(x)\r\n day = 2\r\n lc.sort()\r\n while sum() >= n:\r\n day += 1\r\n print(day - 1)\r\n", "import sys\r\nn, m = list(map(int, input().split()))\r\nq = []\r\nc = []\r\nfor i in range(101):\r\n q.append(0)\r\na = list(map(int, input().split()))\r\nfor i in range(m):\r\n q[a[i]]+=1\r\nfor i in range(100):\r\n d = 100 - i\r\n k = 0\r\n for j in range(100):\r\n if q[j+1] >= d:\r\n k += q[j+1]//d\r\n if k >= n:\r\n print(d)\r\n exit()\r\nprint(0)", "n, k=map(int, input().split()); s={}\r\na=list(map(int, input().split())); d=102*[0]; b=0;\r\nfor t in range(k):\r\n d[a[t]]+=1\r\n s[a[t]]=d[a[t]]\r\ns=list(s.values())\r\ns.sort()\r\ns.reverse()\r\nm=max(s)\r\nfor t in range(m):\r\n x=m-t\r\n l=m//x\r\n p=l\r\n for i in s[1:]:\r\n p+=i//x\r\n if p>=n:\r\n b=1\r\n print (x)\r\n break\r\nif b==0:\r\n print(0)\r\n \r\n", "from collections import Counter\r\n\r\nn, m = map(int,input().split())\r\nc = Counter(input().split())\r\nc = tuple(c.values())\r\nfor d in range(1,102):\r\n\tif sum(map(lambda x:x//d, c)) < n:\r\n\t\tprint(d-1)\r\n\t\tbreak\r\n", "n, m = map(int, input().split(' '))\r\narr = list(map(int, input().split(' ')))\r\n\r\nd = dict()\r\nfor i in range(m):\r\n if d.get(arr[i]) is not None:\r\n d[arr[i]]+=1\r\n else:\r\n d[arr[i]] = 1\r\n\r\nans = 0\r\nprev = -1\r\nfor i in range(1, 10000):\r\n val = 0\r\n prev = ans\r\n for k in d.keys():\r\n val = val+d[k]//i\r\n if val>=n:\r\n ans = i\r\n break\r\n if ans==prev:\r\n break\r\nprint(ans)\r\n\r\n\r\n\r\n", "from collections import Counter\r\nnop, nopkt = [int(x) for x in input().split()]\r\npackets = Counter([int(x) for x in input().split()]).values()\r\ndays = 1\r\nwhile sum(x//days for x in packets) >= nop:\r\n days += 1\r\nprint(days - 1)", "n,m = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nif n > m:\r\n print(0)\r\nelse:\r\n ans = [0 for i in range(101)]\r\n max_val = 0\r\n for i in l:\r\n ans[i] += 1\r\n if i > max_val:\r\n max_val = i\r\n l = 1\r\n r = m\r\n new = -1\r\n while l <= r:\r\n mid = l + (r-l)//2\r\n check = 0\r\n for i in range(1,max_val+1):\r\n check += ans[i]//mid\r\n if check >= n:\r\n new = mid\r\n l = mid+1\r\n else:\r\n r = mid-1\r\n print(new)", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nfrom collections import defaultdict\r\n\r\ncount = defaultdict(int)\r\n\r\nfor i in a:\r\n count[i] += 1\r\n\r\nfor d in range(100, 0, -1):\r\n p = 0\r\n c = count.copy()\r\n\r\n for i in range(1, 101):\r\n p += c[i] // d\r\n\r\n if p >= n:\r\n print(d)\r\n exit()\r\n\r\nprint(0)\r\n", "a, b = map(int, input().split())\r\nc = list(map(int, input().split()))\r\nma = 0\r\nkn = dict()\r\nfor x in c:\r\n if x in kn:\r\n kn[x] += 1\r\n else:\r\n kn[x] = 1\r\nfor s in range(102):\r\n z = 0\r\n for x in kn:\r\n z += kn[x] // (s + 1)\r\n if z >= a:\r\n ma = s + 1\r\nprint(ma)\r\n", "n,m=map(int, input().split())\r\nd_max = m//n\r\na=[0]*100\r\nfor x in input().split():\r\n a[int(x)-1]+=1\r\nb=sorted(range(100), key=lambda x:a[x], reverse=True)\r\nans = 0\r\nfor d in range(1, d_max+1):\r\n used=0\r\n for i in range(100):\r\n used += a[b[i]]//d\r\n if used >= n:\r\n ans = d\r\n break\r\nprint(ans)", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import Counter\r\n\r\nn, m = map(int, input().split())\r\nc = Counter()\r\nfor i in map(int, input().split()):\r\n c[i] += 1\r\n\r\nd = 0\r\nwhile 1:\r\n x = n\r\n for i in c:\r\n x -= c[i]//(d+1)\r\n if x <= 0:\r\n break\r\n if x <= 0:\r\n d += 1\r\n else:\r\n break\r\n\r\nprint(d)\r\n", "n,m=[int(n) for n in input().split()]\r\nnums=[int(nums) for nums in input().split()]\r\numap={}\r\ncheckmap={}\r\nfor i in nums:\r\n if i in umap:\r\n umap[i]+=1\r\n checkmap[i]+=1\r\n else:\r\n umap[i]=1\r\n checkmap[i]=1\r\ncheckpossible=1\r\ncheckloop=1\r\nmaxperson=1\r\nwhile(checkloop==1):\r\n for i in umap:\r\n checkmap[i]=umap[i]\r\n for i in range(n):\r\n checkpossible=0\r\n for j in checkmap:\r\n if checkmap[j]>=maxperson:\r\n checkmap[j]-=maxperson\r\n checkpossible=1\r\n break\r\n if checkpossible==0:\r\n print(maxperson-1)\r\n checkloop=0\r\n break\r\n maxperson+=1\r\n", "\r\n# Main\r\ndef main():\r\n n, m = map(int, input().split())\r\n food = list(map(int, input().split()))\r\n\r\n arr = dict()\r\n for i in food:\r\n if i not in arr:\r\n arr[i] = 1\r\n else:\r\n arr[i] += 1\r\n \r\n maxD = 0\r\n for d in range(1, 101, 1):\r\n temp = arr\r\n k = 0\r\n flag = 0\r\n for key, val in temp.items():\r\n while val >= d:\r\n flag += 1\r\n k += 1\r\n val -= d\r\n if k >= n and d > maxD:\r\n maxD = d\r\n if flag == 0:\r\n break\r\n \r\n print(maxD)\r\n\r\n# End main\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n\r\n", "from collections import *\nrd = lambda: map(int, input().split())\nn, m = rd()\na = Counter(rd())\nr = 1\nwhile sum(a[x] // r for x in a) >= n:\n r += 1\nprint(r - 1)\n", "from collections import Counter\nn, m = [int(x) for x in input().split()]\nl = input().split()\nw = dict(Counter(l)).values()\nw = sorted(w)[::-1]\n\nmaxDays = w[0]\nwhile True:\n #maxDays = w[0]\n people = 0\n for i in w:\n #people = 0\n if maxDays <= i:\n #print('ok')\n people+=(i//maxDays)\n else:\n #print(maxDays)\n #print('ok')\n break\n #print(people)\n if people >= n:\n print(maxDays)\n break\n maxDays-=1\n if maxDays == 0:\n print(0)\n break\n", "from collections import Counter\r\n\r\ndef _cal(arr, x):\r\n ans = 0\r\n for i in arr:\r\n ans += int(i/x)\r\n return ans\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 if (n > m):\r\n print(0)\r\n return\r\n n_of_each_type = list(Counter(a).values())\r\n max_val = max(n_of_each_type)\r\n x = None\r\n for i in range(1, max_val + 1, 1):\r\n val = _cal(n_of_each_type, i)\r\n if (val >= n):\r\n x = i\r\n if (x): print(x)\r\n else: print(0)\r\n\r\nmain()", "n,k=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nd={}\r\nfor i in arr:\r\n\tif i in d:\r\n\t\td[i]+=1\r\n\telse:\r\n\t\td[i]=1\r\nflag=True\r\nfor i in range(100,0,-1):\r\n\tt2=0\r\n\tfor j in d.values():\r\n\t\tt2+=j//i\r\n\tif(t2>=n):\r\n\t\tprint(i)\r\n\t\tflag=False\r\n\t\tbreak\r\nif(flag):\r\n\tprint(0)", "\r\nmod=10**9+7\r\nimport math\r\nfor _ in range(1):\r\n n,m=map(int,input().split())\r\n pk=list(map(int,input().split()))\r\n li=[0 for i in range(101)]\r\n for i in pk:\r\n li[i]+=1\r\n ans=0\r\n for i in range(1,501):\r\n k=li.copy()\r\n p=0\r\n ind=0\r\n while(ind<101 and p<n):\r\n p+=k[ind]//i\r\n ind+=1\r\n if(p>=n):\r\n ans=i\r\n print(ans)\r\n #print(li[42])\r\n\r\n\r\n\r\n \r\n \r\n\r\n\r\n", "from collections import Counter\r\n\r\nn, m = map(int,input().split())\r\n\r\nl = list(map(int,input().split()))\r\n\r\nc = Counter(l)\r\n\r\nl = [*c.values()]\r\nl.sort()\r\nk=1\r\n\r\nwhile sum(i//k for i in l) >=n:\r\n k+=1\r\n\r\nprint(k-1)", "from collections import Counter\r\n\r\n\r\nn, m = map(int, input().split())\r\nd = list(Counter(map(int, input().split())).values())\r\n\r\nfor ans in range(1, 1000):\r\n if sum([x // ans for x in d]) < n:\r\n print(ans - 1)\r\n break", "from collections import defaultdict\r\n\r\n\r\ndef fun(mid):\r\n cnt = 0\r\n for x in arr_set:\r\n cnt += (freq[x]) // mid\r\n return cnt >= n\r\n\r\n\r\nn, m = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nfreq = defaultdict(int)\r\nfor x in arr:\r\n freq[x] += 1\r\narr_set = set(arr)\r\nstart = 1\r\nend = m\r\nans = -1\r\nwhile(start <= end):\r\n mid = (start + end) // 2\r\n if(fun(mid)):\r\n ans = mid\r\n start = mid + 1\r\n else:\r\n end = mid - 1\r\nif(ans == -1):\r\n print(0)\r\nelse:\r\n print(ans)\r\n", "from sys import stdin\r\n###############################################################\r\ndef iinput(): return int(stdin.readline())\r\ndef minput(): return map(int, stdin.readline().split())\r\ndef linput(): return list(map(int, stdin.readline().split()))\r\n###############################################################\r\nfrom collections import Counter\r\nn, m = minput()\r\na = linput()\r\nc = Counter(a)\r\nfor d in range(101, 0, -1):\r\n temp = 0\r\n for e in c:\r\n temp += c[e]//d\r\n if temp >= n:\r\n print(d)\r\n break\r\nelse: print(0)", "#codeforces_1011B\r\ngi = lambda: list(map(int,input().split()))\r\nn,m = gi()\r\nl = [0]*101\r\nfor e in gi():\r\n l[e] += 1\r\nk = 1\r\nwhile sum([e//k for e in l]) >= n:\r\n k += 1\r\nprint(k-1)", "import math\r\nimport copy\r\nn, m = (int(x) for x in input().split())\r\na = [int(x) for x in input().split()]\r\nmas = [0] * 101\r\nans = 0\r\nflag = True\r\nfor i in range(m):\r\n mas[a[i]] += 1\r\nfor d in range(m, 0, -1):\r\n k = 0\r\n for i in range(101):\r\n k += math.floor(mas[i]/d)\r\n if k >= n and k >= ans:\r\n print(d)\r\n flag = False\r\n break\r\nif flag:\r\n print(0)\r\n", "n,m = map(int, input().strip().split(' '))\r\nlst = list(map(int, input().strip().split(' ')))\r\nres = list(dict.fromkeys(lst))\r\nc=[]\r\nfor i in range(len(res)):\r\n c.append(lst.count(res[i]))\r\n#print(c)\r\nif m<n:\r\n print(0)\r\nelif m==n:\r\n print(1)\r\nelse:\r\n m1=1\r\n c1=0\r\n j=2\r\n f=0\r\n while(True):\r\n c1=0\r\n for i in range(len(c)):\r\n c1+=c[i]//j\r\n if c1>=n:\r\n m1=j\r\n j+=1\r\n else:\r\n f=1\r\n if f==1:\r\n print(m1)\r\n break\r\n \r\n ", "n, m = map(int, input().split())\r\na, a_sorted, d = sorted(list(map(int, input().split()))), [], int(m/n)\r\nfor i in range(len(set(a))):\r\n\tfor j in range(a.count(list(set(a))[i])):\r\n\t\ta_sorted.append(list(set(a))[i])\r\n\r\n\r\nwhile True:\r\n i, x = 0, 0\r\n while x < n and i < len(a_sorted):\r\n if i+d <= len(a_sorted) and len(set(a_sorted[i:i+d])) == 1:\r\n i += d\r\n x += 1\r\n else:\r\n i += 1\r\n if x < n and d != 0:\r\n d -= 1\r\n else:\r\n break\r\n\r\nprint(d)\r\n", "n , m = map(int,input().split())\r\na = list(map(int,input().split()))\r\n#a.sort()\r\nd = {}\r\n\r\nfor i in range(m):\r\n if a[i] not in d :\r\n d[a[i]] = 1\r\n else:\r\n d[a[i]] +=1\r\n\r\n#print(d)\r\n\r\nans = 0\r\nfor i in range(1 , 101):\r\n p = 0\r\n for j in d.values():\r\n p += j // i\r\n\r\n if p >= n :\r\n ans = i\r\n\r\nprint(ans)", "def bs(l, h):\r\n while l < h:\r\n m = (l + h + 1) // 2\r\n if gf(m):\r\n l = m\r\n else:\r\n h = m - 1\r\n return l\r\n\r\ndef gf(x):\r\n y = 0\r\n for i in b:\r\n y += i // x\r\n return y >= n\r\n\r\nn, m = map(int, input().split())\r\na = map(int, input().split())\r\nb = [0] * 101\r\nfor i in a:\r\n b[i] += 1\r\nprint(bs(0, sum(b) // n))", "n,m=map(int,input().split())\r\nfood=list(map(int,input().split()))\r\ncount={}\r\nfor i in food:\r\n if(i in count.keys()):\r\n count[i]+=1\r\n else:\r\n count[i]=1\r\nmax_days=m//n\r\nif(n>m):\r\n print(0);\r\nelse:\r\n flag=0\r\n for i in range(1,max_days+1):\r\n s=0\r\n for j in count:\r\n s+=count[j]//i\r\n if(s<n):\r\n flag=1\r\n break\r\n if(flag==1):\r\n print(i-1)\r\n else:\r\n print(i)\r\n \r\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nd={}\r\nfor chr in a:\r\n if chr not in d:\r\n d[chr]=1\r\n else:\r\n d[chr]+=1\r\np=list(d.values())\r\nz=k//n\r\nif z==0 :\r\n print(0)\r\nelse:\r\n o=[]\r\n if len(a)>=n:\r\n o.append(1)\r\n for i in range(2,z+1):\r\n c=0\r\n for j in range(len(p)):\r\n c+=p[j]//i\r\n if c>=n:\r\n o.append(i)\r\n print(max(o))", "p,w=input().split()\r\np=int(p)\r\nw=int(w)\r\nf=input().split()\r\nf=[int(i) for i in f]\r\nn={}\r\nfor i in f:\r\n n[i]=0\r\nfor i in f:\r\n n[i]+=1\r\nd=1\r\nwhile True:\r\n z=0\r\n for j,i in n.items():\r\n z+=(i//d)\r\n if z<p:\r\n d=d-1\r\n break\r\n d+=1\r\nprint(d)\r\n", "# \r\nimport collections, atexit, math, sys\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\nsys.setrecursionlimit(1000000)\r\ndef getIntList():\r\n return list(map(int, input().split())) \r\n\r\nimport bisect \r\ntry :\r\n #raise ModuleNotFoundError\r\n import numpy\r\n def dprint(*args, **kwargs):\r\n print(*args, **kwargs, file=sys.stderr)\r\n dprint('debug mode')\r\nexcept ModuleNotFoundError:\r\n def dprint(*args, **kwargs):\r\n pass\r\n\r\n\r\ndef memo(func): \r\n cache={} \r\n def wrap(*args): \r\n if args not in cache: \r\n cache[args]=func(*args) \r\n return cache[args] \r\n return wrap\r\n\r\n@memo\r\ndef comb (n,k):\r\n if k==0: return 1\r\n if n==k: return 1\r\n return comb(n-1,k-1) + comb(n-1,k)\r\n\r\ninId = 0\r\noutId = 0\r\nif inId>0:\r\n dprint('use input', inId)\r\n sys.stdin = open('input'+ str(inId) + '.txt', 'r') #标准输出重定向至文件\r\nif outId>0:\r\n dprint('use output', outId)\r\n sys.stdout = open('stdout'+ str(outId) + '.txt', 'w') #标准输出重定向至文件\r\n atexit.register(lambda :sys.stdout.close()) #idle 中不会执行 atexit\r\n \r\nN, M = getIntList()\r\nza = getIntList()\r\n\r\nzc = [0 for i in range(101)]\r\nfor x in za:\r\n zc[x] +=1\r\n\r\n#dprint('zc',zc)\r\n\r\nmin_ok = 0\r\nmax_not = 101\r\n\r\ndef work(day):\r\n c = 0\r\n for i in range(101):\r\n c += zc[i] // day\r\n return (c>=N)\r\n\r\nwhile min_ok + 1 < max_not:\r\n mid = (min_ok + max_not ) //2\r\n if work(mid) :\r\n min_ok = mid\r\n else:\r\n max_not = mid\r\n\r\nprint(min_ok)\r\n\r\n\r\n", "import math\r\nn, m = map(int, input().split())\r\na = [int(_) for _ in input().split()]\r\na = sorted(a)\r\na.append(0)\r\ng = 1\r\nd = []\r\nfor i in range(m):\r\n if a[i]==a[i+1]:\r\n g+=1\r\n else:\r\n d.append(g)\r\n g = 1\r\ndef mod(x):\r\n h = 0\r\n for elem in d:\r\n h+=elem//x\r\n return h>=n\r\ndef bl(a):\r\n L = 0\r\n R = max(a)+1\r\n while R-L>1:\r\n M = (R+L)//2\r\n if mod(M):\r\n L = M\r\n else:\r\n R = M\r\n return L\r\np = []\r\nprint(bl(d))", "din = {}\r\ndef fn(tot, L, ind):\r\n if (tot, ind) in din:\r\n return din[(tot, ind)]\r\n l = len(L)\r\n if tot == 0:\r\n return -1\r\n elif ind == l - 1:\r\n return L[ind] // tot\r\n else:\r\n ans = 0\r\n for i in range(1, tot + 1):\r\n if i > L[ind]:\r\n break\r\n z = fn(tot - i, L, ind + 1)\r\n a1 = L[ind] // i if z == -1 else min(L[ind] // i, z)\r\n if a1 > ans:\r\n ans = a1\r\n din[(tot, ind)] = ans\r\n return ans\r\n \r\n[n, m] = [int(x) for x in input().split()]\r\nA = [int(x) for x in input().split()]\r\nif n > m:\r\n print(\"0\")\r\nelse:\r\n di = {}\r\n for i in A:\r\n if i in di:\r\n di[i] += 1\r\n else:\r\n di[i] = 1\r\n L = []\r\n for i in di:\r\n L.append(di[i])\r\n L.sort(reverse = True)\r\n print(fn(n, L, 0))", "from collections import Counter\r\n\r\nI = lambda: map(int, input().split())\r\n\r\nn, _ = I()\r\nV = Counter(I()).values()\r\nd = 1\r\n\r\nwhile sum(v//d for v in V) >= n:\r\n d += 1\r\n\r\nprint(d-1)", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\ndic={}\r\nfor i in range(m):\r\n if a[i] in dic:\r\n dic[a[i]]+=1\r\n else:\r\n dic[a[i]]=1\r\nfor i in range(1,102):\r\n r=0\r\n for j in dic:\r\n r+=dic[j]//i\r\n if r<n:\r\n print(i-1)\r\n break", "from collections import Counter\nn,m = map(int,input().split())\na = map(int,input().split())\na = Counter(a).values()\nret = 0\nfor i in range(1,max(a)+1) :\n cnt = sum([x//i for x in a])\n if cnt >= n : ret = i\nprint(ret)\n\n \t\t \t \t\t \t \t\t\t \t \t \t \t\t", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nlistik=[]\r\nnumbers=[]\r\nfor i in l:\r\n if i in numbers:\r\n pass\r\n else:\r\n listik.append(l.count(i))\r\n numbers.append(i)\r\nlistik.sort()\r\nmaximum=0\r\nx=False\r\nfor i in range(1,max(listik)+1):\r\n counter=0\r\n for j in listik[::-1]:\r\n if j//i>0:\r\n counter+=j//i\r\n else:\r\n if counter>=n:\r\n x=True\r\n break\r\n if counter>=n:\r\n if maximum<i:\r\n maximum=i\r\nprint(maximum)", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\narr=[0]*(101)\r\nfor i in range(m):\r\n arr[a[i]]+=1 \r\nif(m<n):print(0)\r\nelse:\r\n ans=0\r\n while(True):\r\n k=ans+1\r\n c=0\r\n for i in range(1,101):\r\n c+=(arr[i]//k)\r\n if(c>=n):ans+=1 \r\n else:\r\n break\r\n print(ans) \r\n \r\n ", "n,m=map(int,input().split())\r\nfrom collections import *\r\na=[*Counter(input().split()).values()]\r\nd=m//n\r\nwhile d>0:\r\n if sum(c//d for c in a)>=n:break\r\n d-=1\r\nprint(d)", "n,m = map(int,input().split())\r\n\r\na = list(map(int,input().split()))\r\ndic = dict()\r\nfor i in range(m):\r\n\tif(a[i] not in dic):\r\n\t\tdic[a[i]] = 1\r\n\telse:\r\n\t\tdic[a[i]] +=1\r\n\r\nb = 1\r\nwhile sum(dic[i]//b for i in dic) >= n:\r\n\tb +=1\r\nprint(b-1)", "n,m=map(int,input().split())\nbook1=[int(x) for x in input().split()]\nbook2=set(book1)\nbook3=list(book2)\nnum=[]\nfor i in range(len(book3)):\n num.append(book1.count(book3[i]))\n\nif m < n :\n print(0)\nelif m==n :\n print(1)\n\nelse :\n day=m//n\n while day :\n people=0\n for i in range(len(num)):\n people +=num[i]//day\n\n if people >= n :\n break\n else :\n day=day-1\n\n print(day)\n \n\n \t \t \t\t\t \t\t \t \t\t\t \t \t\t\t", "import math,sys,collections,bisect,heapq\n\n\ndef natural(n):\n\treturn n*(n+1)//2\n\ndef possible(freq,mid,n):\n\tc = 0\n\tfor i in freq:\n\t\tc+=freq[i]//mid\n\tif c>=n:\n\t\treturn True\n\treturn False\n\ndef binarysearch(l,r,freq,n):\n\tif l<=r:\n\t\tmid = (l+r)//2\n\t\tif possible(freq,mid,n):\n\t\t\treturn binarysearch(mid+1,r,freq,n)\n\t\telse:\n\t\t\treturn binarysearch(l,mid-1,freq,n)\n\treturn r\ndef binarysearch2(l,r,k,st):\n\tif l<=r:\n\t\tmid = (l+r)//2\n\t\tif mid-st+1==k:\n\t\t\treturn mid\n\t\telif mid-st+1<k:\n\t\t\treturn binarysearch2(mid+1,r,k,st)\n\t\treturn binarysearch2(l,mid-1,k,st)\n\treturn -1\ndef ispossible(n):\n\n\th = 1\n\tnum = 2\n\tpre = 2\n\twhile num<=n:\n\t\tpre = num\n\t\th+=1\n\t\tnum+=(h*2)+h-1\n\treturn n-pre\n\ndef cal(n):\n\ttmp = 0\n\twhile n:\n\t\ttmp+=n%10\n\t\tn//=10\n\treturn tmp\ndef solve():\n\tn,m = list(map(int,input().split()))\n\tarr = list(map(int,input().split()))\n\tfreq = {}\n\tfor i in arr:\n\t\tif i not in freq:\n\t\t\tfreq[i] = 0\n\t\tfreq[i]+=1\n\tres = binarysearch(1,m//n,freq,n)\n\tprint(res)\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n# number of test cases\n\n\n#t = int(input())\nt = 1\nfor i in range(t):\n\tsolve()\n\n\n\n\n\n\n\n\n\n", "n, m = map(int, input().split())\nA = list(map(int, input().split()))\nfrom collections import Counter\nC = Counter(A)\n\ndef is_ok(x):\n cnt = 0\n for v in C.values():\n cnt += v//x\n if cnt >= n:\n return True\n else:\n return False\n\n\nok = 0\nng = 1000\nwhile ok+1 < ng:\n c = (ok+ng)//2\n if is_ok(c):\n ok = c\n else:\n ng = c\nprint(ok)\n", "from copy import copy\r\n\r\nMAX_N = 100\r\nn, m = map(int, input().strip().split())\r\na = [int(x) for x in input().strip().split()]\r\nd = [0 for x in range(MAX_N + 1)]\r\n\r\ntot = 0\r\nfor x in a:\r\n d[x] += 1\r\n tot = max(d[x], tot)\r\n\r\nm = 0\r\nsolved = False\r\nfor x in range(tot, 0, -1):\r\n dd = copy(d)\r\n cnt = 0\r\n for i in range(1, MAX_N+1):\r\n while dd[i] >= x:\r\n dd[i] -= x\r\n cnt += 1\r\n if cnt >= n:\r\n print(x)\r\n solved = True\r\n break\r\n if solved:\r\n break\r\n \r\nif not solved:\r\n print(0)", "import collections\r\nn,l=map(int, input().split())\r\narray = list(map(int, input().split()))\r\nc=collections.Counter(array).values()\r\ncur=1\r\nwhile sum(x//cur for x in c)>=n:cur+=1\r\nprint(cur-1)\r\n", "n, m = map(int,input().split())\r\nv = list(map(int,input().split()))\r\n\r\nd = {}\r\nfor i in range(1,101):\r\n\td[i] = 0\r\nfor i in v:\r\n\td[i] += 1\r\n# print(d)\r\n\r\nif n > m:\r\n\tprint(0)\r\nelse:\r\n\tpossible = m // n\r\n\tflag = False\r\n\tret = 0\r\n\twhile possible > 0:\r\n\t\tcount = 0\r\n\t\tfor value in d.values():\r\n\t\t\tcount += value//possible\r\n\t\t\tif count >= n:\r\n\t\t\t\tflag = True\r\n\t\t\t\tret = possible\r\n\t\t\tif flag:\r\n\t\t\t\tbreak\r\n\t\tif flag:\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\tpossible -= 1\r\n\tif flag:\r\n\t\tprint(ret)\r\n\telse:\r\n\t\tprint(0)", "import functools\r\nimport time\r\nfrom collections import Counter\r\n\r\ndef timer(func):\r\n @functools.wraps(func)\r\n def wrapper(*args, **kwargs):\r\n stime = time.perf_counter()\r\n res = func(*args, **kwargs)\r\n elapsed = time.perf_counter() - stime\r\n print(f\"{func.__name__} in {elapsed:.4f} secs\")\r\n return res\r\n return wrapper\r\n\r\nclass solver:\r\n # @timer\r\n def __init__(self):\r\n pass\r\n\r\n def __call__(self):\r\n n, m = map(int, input().strip().split())\r\n a = list(map(int, input().strip().split()))\r\n h = Counter()\r\n for ai in a:\r\n h[ai] = h[ai] + 1 if ai in h else 1\r\n days = 0\r\n while True:\r\n tot = 0\r\n for key, cnt in h.items():\r\n tot += cnt // (days + 1)\r\n if tot < n:\r\n print(days)\r\n return\r\n days += 1\r\n\r\nsolver()()", "from collections import Counter\r\n\r\nn,k=list(map(int,input().split()))\r\nx=list(map(int,input().split()))\r\n\r\ndd=Counter()\r\nfor i in range(k):\r\n \r\n dd[x[i]]=dd[x[i]]+1\r\n\r\n \r\nfinal=0 \r\nfor i in range(1,k+1):\r\n ans=0\r\n d=dd.copy()\r\n for j in range(n):\r\n for jj in d:\r\n if d[jj]>=i:\r\n d[jj]-=i\r\n ans=ans+1\r\n break\r\n if ans>=n:\r\n final=i\r\n else:\r\n break\r\nprint(final)", "n,m = map(int,input().split())\r\na = map(int,input().split())\r\ndic = [0] * 101\r\nfor x in a:\r\n dic[x] += 1\r\ndef ok(x):\r\n cnt = 0\r\n for i in dic:\r\n cnt += i//x\r\n return cnt >= n\r\nfor x in range(100,0,-1):\r\n if ok(x):\r\n print(x)\r\n exit(0)\r\nprint(0)", "n,m=list(map(int,input().split()))\r\na={}\r\nfor i in list(map(int,input().split())):\r\n if i in a:\r\n a[i]+=1\r\n else:\r\n a[i]=1\r\nb=[]\r\nfor i in a:\r\n b.append([a[i],1])\r\nb.sort()\r\nfor i in range(n):\r\n if b[-1][0]//b[-1][1]==0:\r\n print(0)\r\n break\r\n b[-1][1]+=1\r\n b.sort(key=lambda x:x[0]//x[1])\r\nelse:\r\n ans = min(b,key = lambda x:x[0]//(x[1]-1) if x[1]>1 else 10**5)\r\n print(ans[0]//(ans[1]-1))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n,m=[*map(int,input().split())]\r\nli=[*map(int,input().split())]\r\nfrom collections import Counter\r\nc=Counter(li)\r\nif n>m:\r\n\tprint(0)\r\n\tquit()\r\nday=1\r\nadd=0\r\nfor i in c:\r\n\tadd+=c[i]//day\t\r\nwhile add>=n:\r\n\tadd=0\r\n\tday+=1\r\n\tfor i in c:\r\n\t\tadd+=c[i]//day\t\r\nprint(day-1)\t\t\r\n\t\t", "\"\"\"\r\n499 div2 b\r\nhttps://codeforces.com/contest/1011/problem/B\r\n\"\"\"\r\n\r\nfrom collections import Counter\r\n\r\nn, m = map(int,input().split())\r\n\r\nfoods = list(map(int,input().split()))\r\nc = Counter(foods)\r\nfoods = [*c.values()]\r\n\r\nres = 1\r\nd = sum(foods)\r\nwhile d >= n:\r\n d = 0\r\n res +=1\r\n for i in range(len(foods)):\r\n d += foods[i]//res\r\nprint(res-1)", "def is_enough(cnt, days_proposed, people_count):\n count = 0\n i = len(cnt) - 1\n while i >= 0 and cnt[i] > 0:\n count += cnt[i] // days_proposed\n i -= 1\n\n return count >= people_count\n\n\ndef get_days(a, n, m):\n cnt = [0] * 101\n for elem in a:\n cnt[elem] += 1\n\n cnt.sort()\n left, right = 0, m + 1\n while left + 1 < right:\n days = (left + right) // 2\n if is_enough(cnt, days, n):\n left = days\n else:\n right = days\n\n return left\n\n\n\nn, m = map(int, input().split())\na = list(map(int, input().split()))\n\nprint(get_days(a, n, m))", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nhsh=[0]*max(a)\r\nfor i in a:\r\n hsh[i-1]+=1\r\nans=0\r\nfor i in range(1,k+1):\r\n cnt=0\r\n for j in hsh:\r\n cnt+=(j//i)\r\n if(cnt>=n):\r\n ans=i\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n", "def main():\n n, m = [int(x) for x in input().split()]\n types = [int(x) for x in input().split()]\n\n if n > m:\n print(0)\n return\n\n dt = {}\n for t in types:\n if t not in dt:\n dt[t] = 0\n\n dt[t] += 1\n\n sorted_items = sorted(dt.items(), key=lambda i: i[1], reverse=True)\n\n for i in range(sorted_items[0][1], 0, -1):\n n_count = 0\n for k, v in sorted_items:\n n_count += v // i\n if n_count >= n:\n print(i)\n return\n\n print(0)\n\n\nif __name__ == '__main__':\n main()\n", "def bs(mid,a,z):\r\n if sum(i//mid for i in z)>=a:\r\n return 1\r\n return 0\r\na,b=map(int,input().split())\r\nz1=dict()\r\nfor i in map(int,input().split()):\r\n z1[i]=z1.get(i,0)+1\r\nz=list(z1.values())\r\nlo=1;hi=100;ans=0\r\nwhile(lo<=hi):\r\n mid=lo+(hi-lo)//2\r\n if (bs(mid,a,z)):\r\n ans=mid\r\n lo=mid+1\r\n else:\r\n hi=mid-1\r\nprint(ans)", "n, m = [int(i) for i in input().split()]\na = [int(i) for i in input().split()]\n\nfood = [0] * 100\nfor i in a:\n food[i - 1] += 1\n\n\nmax_amount = 0\nfor i in range(1, m+1):\n sub_food = food.copy()\n sub_n = n\n\n for j in range(100):\n while sub_food[j] >= i and sub_n > 0:\n sub_food[j] -= i\n sub_n -= 1\n if sub_n == 0:\n break\n\n if sub_n == 0:\n max_amount = i\n\nprint(max_amount)", "import collections\r\ninp = list(map(int, input().split(' ')))\r\ntyp = input().split(' ')\r\ncount=[]\r\nday = 1\r\nwhile True:\r\n for i in collections.Counter(typ).values():\r\n if int(i/day):\r\n count.append(int(i/day))\r\n if sum(count)>=inp[0]:\r\n count=[]\r\n day+=1\r\n else:\r\n day-=1\r\n break\r\nprint(day)", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nif(m<n):\r\n\tprint(0)\r\nelif(m==n):\r\n\tprint(1)\r\nelse:\r\n\ts=list(set(a))\r\n\to=[]\r\n\tif(len(s)==len(a)):\r\n\t\tprint(1)\r\n\telif(len(s)==1):\r\n\t\tprint(m//n)\r\n\telse:\r\n\t\tfor i in range(len(s)):\r\n\t\t\to.append(a.count(s[i]))\r\n\t\tfor i in range(1,102):\r\n\t\t\ts=0\r\n\t\t\tfor j in range(len(o)):\r\n\t\t\t\ts=s+(o[j]//i)\r\n\t\t\tif(s<n):\r\n\t\t\t\tprint(i-1)\r\n\t\t\t\tbreak", "from collections import Counter\r\n\r\nn, _ = map(int,input().split())\r\n\r\nc = Counter(list(map(int,input().split())))\r\n\r\nresult = 0\r\nres = 1\r\n\r\nwhile True:\r\n result = 0\r\n for i in c.values():\r\n result += (i//res)\r\n if result < n:\r\n res-=1\r\n break\r\n res +=1\r\n\r\nprint(res)", "''' CODED WITH LOVE BY SATYAM KUMAR '''\r\n\r\n\r\nfrom sys import stdin, stdout\r\nimport cProfile, math\r\nfrom collections import Counter\r\nfrom bisect import bisect_left,bisect,bisect_right\r\nimport itertools\r\nfrom copy import deepcopy\r\nfrom fractions import Fraction\r\nimport sys, threading\r\nimport operator as op\r\nfrom functools import reduce\r\nsys.setrecursionlimit(10**6) # max depth of recursion\r\nthreading.stack_size(2**27) # new thread will get stack of such size\r\nfac_warmup = False\r\nprintHeap = str()\r\nmemory_constrained = False\r\nP = 10**9+7\r\nimport sys\r\n\r\nclass Operation:\r\n def __init__(self, name, function, function_on_equal, neutral_value=0):\r\n self.name = name\r\n self.f = function\r\n self.f_on_equal = function_on_equal\r\ndef add_multiple(x, count):\r\n return x * count\r\ndef min_multiple(x, count):\r\n return x\r\ndef max_multiple(x, count):\r\n return x\r\nsum_operation = Operation(\"sum\", sum, add_multiple, 0)\r\nmin_operation = Operation(\"min\", min, min_multiple, 1e9)\r\nmax_operation = Operation(\"max\", max, max_multiple, -1e9)\r\nclass SegmentTree:\r\n def __init__(self,\r\n array,\r\n operations=[sum_operation, min_operation, max_operation]):\r\n self.array = array\r\n if type(operations) != list:\r\n raise TypeError(\"operations must be a list\")\r\n self.operations = {}\r\n for op in operations:\r\n self.operations[op.name] = op\r\n self.root = SegmentTreeNode(0, len(array) - 1, self)\r\n def query(self, start, end, operation_name):\r\n if self.operations.get(operation_name) == None:\r\n raise Exception(\"This operation is not available\")\r\n return self.root._query(start, end, self.operations[operation_name])\r\n def summary(self):\r\n return self.root.values\r\n def update(self, position, value):\r\n self.root._update(position, value)\r\n def update_range(self, start, end, value):\r\n self.root._update_range(start, end, value)\r\n def __repr__(self):\r\n return self.root.__repr__()\r\nclass SegmentTreeNode:\r\n def __init__(self, start, end, segment_tree):\r\n self.range = (start, end)\r\n self.parent_tree = segment_tree\r\n self.range_value = None\r\n self.values = {}\r\n self.left = None\r\n self.right = None\r\n if start == end:\r\n self._sync()\r\n return\r\n self.left = SegmentTreeNode(start, start + (end - start) // 2,\r\n segment_tree)\r\n self.right = SegmentTreeNode(start + (end - start) // 2 + 1, end,\r\n segment_tree)\r\n self._sync()\r\n def _query(self, start, end, operation):\r\n if end < self.range[0] or start > self.range[1]:\r\n return None\r\n if start <= self.range[0] and self.range[1] <= end:\r\n return self.values[operation.name]\r\n self._push()\r\n left_res = self.left._query(start, end,\r\n operation) if self.left else None\r\n right_res = self.right._query(start, end,\r\n operation) if self.right else None\r\n if left_res is None:\r\n return right_res\r\n if right_res is None:\r\n return left_res\r\n return operation.f([left_res, right_res])\r\n def _update(self, position, value):\r\n if position < self.range[0] or position > self.range[1]:\r\n return\r\n if position == self.range[0] and self.range[1] == position:\r\n self.parent_tree.array[position] = value\r\n self._sync()\r\n return\r\n self._push()\r\n self.left._update(position, value)\r\n self.right._update(position, value)\r\n self._sync()\r\n def _update_range(self, start, end, value):\r\n if end < self.range[0] or start > self.range[1]:\r\n return\r\n if start <= self.range[0] and self.range[1] <= end:\r\n self.range_value = value\r\n self._sync()\r\n return\r\n self._push()\r\n self.left._update_range(start, end, value)\r\n self.right._update_range(start, end, value)\r\n self._sync()\r\n def _sync(self):\r\n if self.range[0] == self.range[1]:\r\n for op in self.parent_tree.operations.values():\r\n current_value = self.parent_tree.array[self.range[0]]\r\n if self.range_value is not None:\r\n current_value = self.range_value\r\n self.values[op.name] = op.f([current_value])\r\n else:\r\n for op in self.parent_tree.operations.values():\r\n result = op.f(\r\n [self.left.values[op.name], self.right.values[op.name]])\r\n if self.range_value is not None:\r\n bound_length = self.range[1] - self.range[0] + 1\r\n result = op.f_on_equal(self.range_value, bound_length)\r\n self.values[op.name] = result\r\n def _push(self):\r\n if self.range_value is None:\r\n return\r\n if self.left:\r\n self.left.range_value = self.range_value\r\n self.right.range_value = self.range_value\r\n self.left._sync()\r\n self.right._sync()\r\n self.range_value = None\r\n def __repr__(self):\r\n ans = \"({}, {}): {}\\n\".format(self.range[0], self.range[1],\r\n self.values)\r\n if self.left:\r\n ans += self.left.__repr__()\r\n if self.right:\r\n ans += self.right.__repr__()\r\n return ans\r\n\r\ndef display(string_to_print):\r\n stdout.write(str(string_to_print) + \"\\n\")\r\n\r\ndef primeFactors(n): #n**0.5 complex \r\n factors = dict()\r\n for i in range(2,math.ceil(math.sqrt(n))+1): \r\n while n % i== 0: \r\n if i in factors:\r\n factors[i]+=1\r\n else: factors[i]=1\r\n n = n // i \r\n if n>2:\r\n factors[n]=1\r\n return (factors)\r\n\r\ndef binary(n,digits = 20):\r\n b = bin(n)[2:]\r\n b = '0'*(20-len(b))+b\r\n return b\r\n\r\ndef isprime(n):\r\n \"\"\"Returns True if n is prime.\"\"\"\r\n if n < 4:\r\n return True\r\n if n % 2 == 0:\r\n return False\r\n if n % 3 == 0:\r\n return False\r\n i = 5\r\n w = 2\r\n while i * i <= n:\r\n if n % i == 0:\r\n return False\r\n i += w\r\n w = 6 - w\r\n return True\r\nfactorial_modP = []\r\ndef warm_up_fac(MOD):\r\n global factorial_modP,fac_warmup\r\n if fac_warmup: return\r\n factorial_modP= [1 for _ in range(fac_warmup_size+1)]\r\n for i in range(2,fac_warmup_size):\r\n factorial_modP[i]= (factorial_modP[i-1]*i) % MOD\r\n fac_warmup = True\r\n\r\ndef InverseEuler(n,MOD):\r\n return pow(n,MOD-2,MOD)\r\n\r\ndef nCr(n, r, MOD):\r\n global fac_warmup,factorial_modP\r\n if not fac_warmup:\r\n warm_up_fac(MOD)\r\n fac_warmup = True\r\n return (factorial_modP[n]*((pow(factorial_modP[r], MOD-2, MOD) * pow(factorial_modP[n-r], MOD-2, MOD)) % MOD)) % MOD\r\n\r\ndef test_print(*args):\r\n if testingMode:\r\n print(args)\r\n\r\ndef display_list(list1, sep=\" \"):\r\n stdout.write(sep.join(map(str, list1)) + \"\\n\")\r\n\r\ndef get_int():\r\n return int(stdin.readline().strip())\r\n\r\ndef get_tuple():\r\n return map(int, stdin.readline().split())\r\n\r\ndef get_list():\r\n return list(map(int, stdin.readline().split()))\r\nimport heapq,itertools\r\npq = [] # list of entries arranged in a heap\r\nentry_finder = {} # mapping of tasks to entries\r\nREMOVED = '<removed-task>' \r\ndef add_task(task, priority=0):\r\n 'Add a new task or update the priority of an existing task'\r\n if task in entry_finder:\r\n remove_task(task)\r\n count = next(counter)\r\n entry = [priority, count, task]\r\n entry_finder[task] = entry\r\n heapq.heappush(pq, entry)\r\n\r\ndef remove_task(task):\r\n 'Mark an existing task as REMOVED. Raise KeyError if not found.'\r\n entry = entry_finder.pop(task)\r\n entry[-1] = REMOVED\r\n\r\ndef pop_task():\r\n 'Remove and return the lowest priority task. Raise KeyError if empty.'\r\n while pq:\r\n priority, count, task = heapq.heappop(pq)\r\n if task is not REMOVED:\r\n del entry_finder[task]\r\n return task\r\n raise KeyError('pop from an empty priority queue')\r\nmemory = dict()\r\ndef clear_cache():\r\n global memory\r\n memory = dict()\r\ndef cached_fn(fn, *args):\r\n global memory\r\n if args in memory:\r\n return memory[args]\r\n else:\r\n result = fn(*args)\r\n memory[args] = result\r\n return result\r\n\r\n\r\n# -------------------------------------------------------------- MAIN PROGRAM\r\nTestCases = False\r\ntestingMode = False\r\nfac_warmup_size = 10**5+100\r\noptimiseForReccursion = True #Can not be used clubbed with TestCases\r\n\r\ndef binary_serach(i,li):\r\n #print(\"Search for \",i)\r\n fn = lambda x: li[x]-x//i\r\n x = -1\r\n b = len(li)\r\n while b>=1:\r\n #print(b,x)\r\n while b+x<len(li) and fn(b+x)>0:\r\n x+=b\r\n b=b//2\r\n return x\r\n\r\n\r\ndef main():\r\n n,m = get_tuple()\r\n li = get_list()\r\n count = Counter(li)\r\n li = []\r\n for i in count.keys():\r\n li.append([count[i],i])\r\n li.sort(reverse=True)\r\n res = 0\r\n for i in range(1,101):\r\n k = n\r\n for j in li:\r\n k-=j[0]//i\r\n if k<=0:\r\n res = i\r\n print(res)\r\n #print(count)\r\n\r\n \r\n\r\n\r\n# --------------------------------------------------------------------- END=\r\n\r\n\r\nif TestCases: \r\n for _ in range(get_int()): \r\n cProfile.run('main()') if testingMode else main() \r\nelse: (cProfile.run('main()') if testingMode else main()) if not optimiseForReccursion else threading.Thread(target=main).start()", "n,m=map(int,input().split())\r\nl=[int(j) for j in input().split()]\r\nd=dict()\r\nfor i in l:\r\n if i in d:\r\n d[i]+=1\r\n else:\r\n d[i]=1\r\nc=[]\r\nfor i in d:\r\n c.append(d[i])\r\nle=0\r\nri=10**10\r\n\r\nwhile le+1<ri:\r\n mi=(le+ri)//2\r\n k=0\r\n for i in c:\r\n k=k+i//mi\r\n \r\n if k<n:\r\n ri=mi\r\n else:\r\n le=mi\r\nprint(le)\r\n", "from collections import *\nn,m = [int(x) for x in input().split()]\na = [int(x) for x in input().split()]\ncnt = Counter(a)\n# print(cnt)\n#binary search the number of days\nlo,hi = 0,m #obviously at most m days, as we have m food in total and at least 1 person\nwhile lo < hi:\n mid = (lo+hi+1)//2 #+1 is necessary due to -1 in line 17\n total = 0\n for val,supply in cnt.items():\n total += supply//mid #each person needs exactly m units of the same type of food\n #total is the total number of people we managed to support with m units\n if total >= n: #managed to support all the people\n lo = mid\n else:\n hi = mid-1\nprint(lo)\n\n", "n_m = input()\r\nn_m = n_m.split(' ')\r\nn_m = list(map(int, n_m))\r\n\r\nn = n_m[0] #passanger\r\nm = n_m[1] #foods stock\r\n#print(n_m)\r\n\r\nfoods = input()\r\nfoods = foods.split(' ')\r\nfoods = list(map(int, foods))\r\nfoods = sorted(foods, reverse=True)\r\n#print(foods)\r\n\r\nfoods_count = []\r\ntemp = 1\r\n\r\n#print(len(foods_count))\r\n\r\n#counting for each\r\nfor i in range(0,len(foods)-1):\r\n if foods[i] == foods[i+1]:\r\n temp = temp + 1\r\n else:\r\n #print(temp)\r\n foods_count.append(temp)\r\n temp = 1\r\n#print(temp)\r\nfoods_count.append(temp)\r\nfoods_count = sorted(foods_count, reverse=True)\r\n#print(foods_count)\r\n\r\ndivisor = 1\r\nresult = 0\r\nstatus = 0\r\n\r\nwhile status == 0:\r\n result = 0\r\n\r\n for j in range(0,len(foods_count)):\r\n result = result + (foods_count[j] // divisor)\r\n\r\n if result < n:\r\n status = status + 1\r\n else:\r\n divisor = divisor + 1\r\n\r\nprint(divisor - 1)\r\n", "\r\n# Problem: B. Planning The Expedition\r\n# Contest: Codeforces - Codeforces Round #499 (Div. 2)\r\n# URL: https://codeforces.com/contest/1011/problem/B\r\n# Memory Limit: 256 MB\r\n# Time Limit: 1000 ms\r\n# Powered by CP Editor (https://github.com/cpeditor/cpeditor)\r\n\r\nfrom sys import stdin\r\ndef get_ints(): return list(map(int, stdin.readline().strip().split()))\r\n\r\nn,m = get_ints()\r\nar = get_ints()\r\ncounts =[0]*105\r\nfor num in ar:\r\n\tcounts[num]+=1\r\n\t\r\nans = 0\r\nfor i in range(1,m+1):\r\n\tcnt = 0\r\n\tfor j in range(1,101):\r\n\t\tcnt+=counts[j]//i;\r\n\tif cnt>=n:\r\n\t\tans = max(ans,i) \r\nprint(ans)", "n, m = map(int,input().split())\r\ncnt = [0]*101\r\nfor el in input().split():\r\n el = int(el)\r\n cnt[el] += 1\r\nl = 0\r\nr = int(1e9)\r\ncnt.sort()\r\nwhile r - l > 1:\r\n med = l + (r - l) // 2\r\n cc = 0\r\n for i in range(0, 101):\r\n cc += cnt[i] // med\r\n if cc >= n:\r\n l = med\r\n else:\r\n r = med\r\ncc = 0\r\nfor i in range(0, 101):\r\n cc += cnt[i] // r\r\nif cc >= n:\r\n print(r)\r\nelse:\r\n print(l)", "n,days = list(map(int,input().split()))\r\narr = list(map(int,input().split()))\r\nd = {}\r\nfor i in arr:\r\n if i in d:\r\n d[i]+=1\r\n else:\r\n d[i] = 1\r\nlow,high = 1,days//n\r\nwhile low<high:\r\n mid = (low+high)//2\r\n cnt = 0\r\n for i in d:\r\n if d[i]>=mid:\r\n cnt+=d[i]//mid\r\n if cnt>=n:\r\n low=mid\r\n elif cnt<mid:\r\n high = mid\r\n if abs(low-high)==1:\r\n break\r\nif days<n:\r\n print(0)\r\nelse:\r\n cnt = 0\r\n for i in d:\r\n if d[i]>=high:\r\n cnt+=d[i]//high\r\n if cnt>=n:\r\n print(high)\r\n else:\r\n print(low)\r\n", "def getWeight(a):\r\n return(ord(a) - ord('a')+1)\r\n\r\nn,m = input().strip().split(\" \")\r\nn = int(n)\r\nm = int(m)\r\nif (m < n):\r\n print(\"0\")\r\n exit(0)\r\nif (n <= 0):\r\n print(\"0\")\r\n exit(0)\r\nif (m <= 0):\r\n print(\"0\")\r\n exit(0)\r\nd = {}\r\narr = list(map(int, input().strip().split(\" \")))\r\nfor x in arr:\r\n try:\r\n d[x] += 1\r\n except KeyError:\r\n d[x] = 1\r\narr =sorted(d.values(), reverse=True)\r\n\r\nret = 0\r\nfor i in range(1, arr[0]+1):\r\n count = 0\r\n for x in arr:\r\n count += int(int(x)/int(i))\r\n if count >= n:\r\n ret = i\r\n break\r\nprint(ret)\r\n", "from collections import defaultdict\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nrec = defaultdict(int)\r\nfor i in range(m):\r\n rec[a[i]] += 1\r\n\r\n\r\ndef ok(k):\r\n if k == 0:\r\n return False\r\n tmp = 0\r\n for i in rec.values():\r\n tmp += i // k\r\n\r\n return tmp >= n\r\n\r\n\r\nleft, right = 0, 10000\r\np = 0\r\nwhile p < 1000:\r\n mid = (left + right) // 2\r\n q = ok(mid)\r\n\r\n if q:\r\n left = mid\r\n else:\r\n right = mid\r\n\r\n p += 1\r\n\r\nprint(mid)", "n,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nd = {}\r\nfor i in a:\r\n\ttry:\r\n\t\td[i]\r\n\texcept:\r\n\t\td[i]=1\r\n\telse:\r\n\t\td[i]+=1\r\nl = list(d.values())\r\nl.sort()\r\nmd=0\r\nfor i in range(m,0,-1):\r\n\ta = l[:]\r\n\tfor j in range(len(a)):\r\n\t\ta[j] = a[j]//i\r\n\tif sum(a)>=n:\r\n\t\tmd=i\r\n\t\tbreak\r\nprint(md)", "def check(mid, mp, n):\n pip = 0\n for cnt in mp.values():\n pip += cnt // mid\n if pip >= n:\n return True\n return False\n\ndef count_duplicates(arr):\n num_counts = {}\n for num in arr:\n if num in num_counts:\n num_counts[num] += 1\n else:\n num_counts[num] = 1\n return num_counts\n\n\nn, m = map(int, input().split())\nnum_str = input()\na = [int(num) for num in num_str.split()]\nmp = count_duplicates(a)\nans = 0\nl, r = 1, 100\nwhile l <= r:\n mid = (l + r) // 2\n if check(mid, mp, n):\n ans = mid\n l = mid + 1\n else:\n r = mid - 1\nprint(ans)\n \t \t \t \t\t\t\t\t\t\t\t\t\t\t \t \t\t", "n,k=[int(x) for x in input().split()]\r\na=[int(x) for x in input().split()]\r\nm=[0]*101\r\nfor i in a:\r\n m[i]+=1\r\nfin=[]\r\nfor i in m:\r\n if i!=0:\r\n fin.append(i)\r\nfin.sort()\r\nans=0\r\n\r\nd=1\r\nflag=0\r\nwhile(flag!=1):\r\n p=0\r\n for i in fin:\r\n p+=i//d\r\n \r\n if p<n:\r\n break\r\n ans=d\r\n d+=1\r\nprint(ans)\r\n", "import sys\ndef fastio():\n from io import StringIO\n from atexit import register\n global input\n sys.stdin = StringIO(sys.stdin.read())\n input = lambda : sys.stdin.readline().rstrip('\\r\\n')\n sys.stdout = StringIO()\n register(lambda : sys.__stdout__.write(sys.stdout.getvalue()))\nfastio()\n\nINF = 10**20\nMOD = 10**9 + 7\nI = lambda:list(map(int,input().split()))\nfrom math import gcd\nfrom math import ceil\nfrom collections import defaultdict as dd, Counter\nfrom bisect import bisect_left as bl, bisect_right as br\n\nn, m = I()\na = I()\nd = dd(int)\nfor i in a:\n d[i] += 1\nans = 0\nfor i in range(1000, 0, -1):\n p = 0\n for j in d:\n p += d[j] // i\n if p >= n:\n ans = i\n break\nprint(ans)\n \t \t \t \t\t \t\t\t\t \t \t \t", "def rec(l, r):\r\n global b\r\n global m\r\n if l + 1 >= r:\r\n return l if l != -1 else 0\r\n m2 = (l + r) // 2\r\n i = 0\r\n c = 0\r\n while i != len(b) and c < n and b[i] >= m2 and m2 != 0:\r\n c += b[i] // m2\r\n i += 1\r\n if c < n and m2 != 0:\r\n return rec(l, m2)\r\n return rec(m2, r)\r\n\r\n\r\nn, m = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\nb = []\r\nfor item in set(a):\r\n b.append(a.count(item))\r\nb.sort(reverse=True)\r\nprint(rec(-1, b[0] + 1))", "from collections import Counter\r\nx, n = map(int, input().split())\r\nfrq = Counter(list(map(int, input().split())))\r\nlo = 1\r\nhi = n\r\nans = 0\r\nwhile lo<=hi:\r\n mid = lo + (hi-lo)//2\r\n rem = x\r\n for i in frq:\r\n rem -= frq[i]//mid\r\n if rem <= 0:\r\n ans = mid\r\n lo = mid+1\r\n else:\r\n hi = mid-1\r\n\r\nprint(ans)\r\n", "from collections import Counter\r\nn, m = map(int, input().split())\r\ntab = list(map(int, input().split()))\r\ntab = Counter(tab).values()\r\n#print(tab)\r\nwynik = 1\r\nwhile sum(paczka // wynik for paczka in tab) >= n:\r\n wynik += 1\r\nprint(wynik - 1)", "\n\nmen, food = map(lambda x: int(x), input().split())\n\ntypes = map(lambda x: int(x), input().split())\n\nfood_dic = {}\n\nfor t in types:\n\tif t in food_dic:\n\t\tfood_dic[t] += 1\n\telse:\n\t\tfood_dic.update({t: 1})\n\n\nfood = list(food_dic.values())\nfood.sort(reverse=True)\n\nif len(food) < men:\n\tfood += [0]*(men - len(food))\nelse:\n\tfood = food[:men]\n\ntype_list = [i+1 if food[i] > 0 else 0 for i in range(len(food))]\n\n\ndef get_same(type_list, max_i):\n\tres = []\n\ttyp = type_list[max_i]\n\tfor i in range(len(type_list)):\n\t\tif type_list[i] == typ:\n\t\t\tres.append(i)\n\treturn res\n\n\nwhile True:\n\tmax_i = food.index(max(food))\n\tmin_i = food.index(min(food))\n\n\tsame_i = get_same(type_list, max_i)\n\tall_f = 0\n\tfor i in same_i:\n\t\tall_f += food[i]\n\n\t# print(same_i)\n\tif all_f // (len(same_i) + 1) <= food[min_i]:\n\t\tbreak\n\t# print(all_f)\n\ttype_list[min_i] = type_list[max_i]\n\ttru = all_f // (len(same_i) + 1)\n\tfood[min_i] = tru\n\tfor i in same_i:\n\t\tfood[i] = tru\n\tfor i in range(all_f % (len(same_i) + 1)):\n\t\tfood[same_i[i]] += 1\n\t# print(food)\n\n# print(food)\nprint(min(food))", "def bs(mid,a,z1):\r\n #print(mid,z)\r\n i=0;k=0;z=z1.copy();f=0\r\n while(i<len(z)):\r\n if z[i]>=mid:\r\n while z[i]>=mid:\r\n f+=1\r\n z[i]-=mid\r\n else:\r\n i+=1\r\n if f>=a:\r\n return 1\r\n return 0\r\na,b=map(int,input().split())\r\nz1=dict()\r\nfor i in map(int,input().split()):\r\n z1[i]=z1.get(i,0)+1\r\nz=sorted(z1.values(),reverse=True)\r\nlo=1;hi=100;ans=0\r\nwhile(lo<=hi):\r\n mid=lo+(hi-lo)//2\r\n if (bs(mid,a,z)):\r\n ans=mid\r\n lo=mid+1\r\n else:\r\n hi=mid-1\r\nprint(ans)", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nfreq=[0]*101\r\nfor i in range(m):\r\n\tfreq[a[i]]+=1\r\n\r\nmaxx = max(freq)\r\nmaximi = 0\r\n# print(maxx)\r\nfor i in range(maxx,0,-1):\r\n\tcou = 0\r\n\tfor x in range(101):\r\n\t\tif(freq[x] >= i):\r\n\t\t\tpp = freq[x]\r\n\t\t\tcou += pp//i\r\n\tif(cou >= n):\r\n\t\tmaximi = max(maximi,i)\r\n\r\nprint(maximi)", "n,m = list(map(int, input().split()))\r\na = list(map(int,input().split()))\r\nl = []\r\nfor i in range(101):\r\n l.append(0)\r\nfor i in range(m):\r\n l[a[i]] = l[a[i]] + 1\r\n#l.sort(key = lambda x: x[1])\r\n#print(l)\r\nmx = 0\r\nfor j in range(1, 101):\r\n cp = list(l)\r\n poss = True\r\n for i in range(n):\r\n done = False\r\n for k in range(1, 101):\r\n if cp[k] >= j:\r\n cp[k] = cp[k] - j\r\n done = True\r\n break\r\n if not done:\r\n poss = False\r\n break\r\n if poss:\r\n mx = j\r\n else:\r\n break\r\nprint(mx)\r\n", "'''\nB. Planning The Expedition\n\nNatasha is planning an expedition to Mars for n people. One of the important tasks is to provide food for each participant.\n\nThe warehouse has m daily food packages. Each package has some food type a_i.\n\nEach participant must eat exactly one food package each day. Due to extreme loads, each participant must eat the same food type throughout the expedition. Different participants may eat different (or the same) types of food.\n\nFormally, for each participant j Natasha should select his food type b_j and each day j-th participant will eat one food package of type b_j. The values b_j for different participants may be different.\n\nWhat is the maximum possible number of days the expedition can last, following the requirements above?\n\nInput\nThe first line contains two integers n and m (1 < n < 100, 1 < m < 100) — the number of the expedition participants and the number of the daily food packages available.\nThe second line contains sequence of integers a_1, a_2, \\dots, a_m (1 < a_i < 100), where a_i is the type of i-th food package.\n\nOutput\nPrint the single integer — the number of days the expedition can last. If it is not possible to plan the expedition for even one day, print 0.\n\nTests\n(In this directory), 'cf test 1011 B solution.py'\n'''\nimport heapq\nnumPeople, numPackages = input().split(\" \")\npackages = input().split(\" \")\n\npacks = {}\nfor p in packages:\n\tif p not in packs:\n\t\tpacks[p] = 1\n\telse:\n\t\tpacks[p] += 1\n\nps = [(-v, 0, v) for (k, v) in packs.items()]\nheapq.heapify(ps)\n\nfor i in range(0, int(numPeople)):\n\ttop = heapq.heappop(ps)\n\t#print(\"calcing\", top[2], \"//\", top[1] + 2)\n\tnext_elem = (-(top[2] // (top[1] + 2)), top[1] + 1, top[2])\n\theapq.heappush(ps, next_elem)\n\t#print(ps)\t\n\n#print(ps)\nprint(min([p[2] // p[1] for p in filter(lambda x: x[1] > 0, ps)]))\n\n\n\n\n\n", "#Have copied from eugalt\r\nfrom collections import Counter\r\nn, m = list(map(int, input().split()))\r\na = [int(i) for i in input().split()]\r\nd = dict(Counter(a)).values() # {1: 4, 2: 3, 5: 2, 7: 1}\r\nk = 1\r\nwhile sum(i // k for i in d) >= n:\r\n k += 1\r\nprint(k - 1)", "# LUOGU_RID: 126684742\na,b=map(int,input().split());b=input().split();c={}\r\nfor i in b:\r\n if i in c:c[i]+=1\r\n else:c[i]=1\r\nb=1\r\nwhile 1:\r\n if sum(c[j]//b for j in c)<a:print(b-1);break\r\n b+=1", "n,m=map(int,input().split())\r\nll=list(map(str,input().split()))\r\nr=0\r\nk=m//n\r\nt=1\r\nwhile t<=k:\r\n dict2 = dict()\r\n for i in ll:\r\n if i in dict2:\r\n dict2[i] += 1\r\n else:\r\n dict2[i] = 1\r\n x=0\r\n while x<n and max((dict2.values()))>=t:\r\n for i in dict2:\r\n if dict2[i]>=t:\r\n dict2[i]-=t\r\n x+=1\r\n if x==n:\r\n break\r\n if x==n:\r\n t+=1\r\n else:\r\n break\r\nprint(t-1)", "# maa chudaaye duniya\r\nfrom copy import copy\r\nn, m = map(int, input().split())\r\narr = [0]*(101)\r\na = list(map(int, input().split()))\r\nfor i in a:\r\n arr[i] += 1\r\nd = 100\r\nf = False\r\nwhile d >= 1:\r\n cc = copy(arr)\r\n k = 0\r\n for i in range(1, 101) :\r\n while cc[i] >= d:\r\n k += 1\r\n cc[i] -= d\r\n if k>=n:\r\n print(d)\r\n f = True\r\n break\r\n d -= 1\r\nif not f:\r\n print(0)\r\n", "def f() :\n\tn,m = list(map(int,input().split()))\n\tl = list(map(int,input().split()))\n\tfreq = {}\n\tfor i in l :\n\t\ttry : freq[i]+=1\n\t\texcept : freq[i]=1\n\tfreq = list(freq.items())\n\tfreq.sort(key=lambda i : i[1],reverse=True)\n\tfor i in range(100,0,-1) :\n\t\tcap = 0\n\t\tfor j in freq :\n\t\t\tcap += j[1]//i\n\t\tif cap >= n :\n\t\t\tprint(i)\n\t\t\tbreak\n\telse :\n\t\tprint(0)\nf()\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\nprovision = []\r\nfreq_dict = {}\r\nfor suit in map(int, input().split()):\r\n freq_dict[suit] = freq_dict.get(suit, 0) + 1\r\nfor suit in freq_dict:\r\n provision.append(freq_dict[suit])\r\nprovision.sort(reverse=True)\r\nmax_term = m // n\r\nfull_people = n\r\ni = max_term\r\nwhile i > 0 and full_people > 0:\r\n full_people = n\r\n for food in provision:\r\n full_people -= (food // i)\r\n i -= 1\r\nif full_people <= 0:\r\n print(i + 1)\r\nelse:\r\n print(0)\r\n", "'''input\n3 9\n42 42 42 42 42 42 42 42 42\n\n'''\nfrom collections import Counter\n\nn, m = map(int, input().split())\nif n > m:\n\tprint(0)\n\tquit()\na = list(map(int, input().split()))\nd = 1\nc = Counter(a).values()\nwhile True:\n\ts = sum([i//d for i in c])\n\tif s >= n:\n\t\td += 1\n\telse:\n\t\tbreak\nprint(d - 1)", "import collections as cc\nn,m=map(int,input().split())\nl=list(map(int,input().split()))\nff=cc.Counter(l)\nff=dict(ff)\ni=1\nans=0\nwhile i:\n temp=0\n for j in ff.values():\n temp+=j//i\n if temp>=n:\n ans=i\n else:\n break\n i+=1\nprint(ans)\n \n \n \t\t\t\t \t \t\t\t\t\t\t \t \t\t \t \t\t", "n,m=map(int,input().split())\r\nb=list(map(int,input().split()))\r\nd=dict()\r\nfor j in range(m):\r\n if b[j] in d.keys():\r\n d[b[j]]+=1\r\n else:\r\n d[b[j]]=1\r\nc=[]\r\nk=list(set(b))\r\nr=len(k)\r\nj=0\r\nwhile(j<r):\r\n p=d[k[j]]\r\n i=1\r\n while((p//i)>=1):\r\n c.append(p//i)\r\n i+=1\r\n j+=1\r\nc.sort(reverse=True)\r\nif len(c)<n:\r\n print(0)\r\nelse:\r\n print(c[n-1])\r\n\r\n\r\n\r\n\r\n\r\n", "from collections import Counter\n\n\ndef solve(participants_count, packages):\n day = 1\n while sum(value//day for value in packages.values()) >= participants_count:\n day += 1\n\n return day-1\n\n\nif __name__ == '__main__':\n participants, _ = map(int, input().split())\n packages = Counter(input().split())\n print(solve(participants, packages))\n", "n,m=map(int,input().split())\r\na=[int(x) for x in input().split()]\r\nna=[0]*101\r\na.sort()\r\nf=0\r\nfor i in range(m):\r\n na[a[i]]+=1\r\nfor i in range(100,0,-1):\r\n k=0\r\n nna=[]\r\n for x in range(len(na)):\r\n nna.append(na[x])\r\n #print(nna,na)\r\n for j in range(1,101):\r\n while(nna[j]>=i):\r\n k+=1\r\n nna[j]-=i\r\n if(k>=n):\r\n print(i)\r\n f=1\r\n break\r\nif(f==0):\r\n print(0)\r\n\r\n", "n, m = list(input().split())\r\nn, m = [int(n), int(m)]\r\nls = list(map(int, list(input().split())))\r\ndic = {i:0 for i in range(1, 101)}\r\nfor i in ls:\r\n dic[i] += 1\r\ndays = 0\r\nfor i in range(1, 1000):\r\n temp_m = n\r\n for j in dic.values():\r\n if temp_m <= 0:\r\n break\r\n if j >= i:\r\n temp_m = temp_m - j//i\r\n if temp_m <= 0:\r\n days = i\r\n else:\r\n break\r\nprint(days)\r\n", "from collections import Counter\nn, m = [int(x) for x in input().split()]\nlab = [int(x) for x in input().split()]\ncnt = sorted(Counter(lab).most_common(), key=lambda x:x[1])\nres = 0\nfor amt_ in range(1, cnt[-1][1]+1):\n if sum([int(y/amt_) for x, y in cnt if y >= amt_]) >= n:\n res = amt_\n else:\n break\nprint(res)\n\t \t \t\t\t \t\t \t\t \t\t\t \t\t\t\t\t \t", "vis = [0 for _ in range(105)]\nn, m = map(int, input().split())\nfor i in map(int, input().split()):\n vis[i] += 1\nans = 0\nfor i in range(1, m + 1):\n cnt = 0\n for j in range(1, 101):\n cnt += vis[j] // i\n if cnt >= n:\n ans = max(ans, i)\nprint(ans)\n\n \t\t \t\t\t \t\t \t\t \t \t \t", "import operator\r\n\r\np,f=map(int,input().split())\r\nfoods = list(map(int,input().split()))\r\n\r\nfc = {}\r\nfor i in foods:\r\n if i not in fc:\r\n fc[i]=foods.count(i)\r\nfoods=set(foods)\r\ncounts = {}\r\nfor i in foods:\r\n counts[i]=0\r\nmaxDays={}\r\n\r\nfor i in foods:\r\n maxDays[i]=fc[i]\r\n\r\nfor i in range(p):\r\n key = max(maxDays.items(), key=operator.itemgetter(1))[0]\r\n counts[key]+=1\r\n maxDays[key]=int(fc[key]/(counts[key]+1))\r\n \r\nfor i in list(foods):\r\n if counts[i]==0:\r\n foods.remove(i)\r\n\r\nprint(min([int(fc[i]/counts[i]) for i in foods]))\r\n", "import sys, copy\r\n\r\n\r\nn, m = map(int, sys.stdin.readline().split())\r\narr = list(map(int, sys.stdin.readline().split()))\r\nres = [0] * (max(arr) + 1)\r\nfor i in arr:\r\n res[i] += 1\r\nans = 0\r\nfor d in range(1, m + 1):\r\n temp = copy.deepcopy(res)\r\n cnt = 0\r\n for i in range(len(temp)):\r\n while temp[i] >= d:\r\n temp[i] -= d\r\n cnt += 1\r\n if cnt >= n:\r\n ans = max(ans, d)\r\nprint(ans)\r\n\r\n", "from collections import defaultdict as dd\r\n\r\nd = dd(int)\r\nn, k = [int(i) for i in input().split(\" \")]\r\nl = [int(i) for i in input().split(\" \")]\r\n\r\nfor i in l:\r\n d[i] += 1\r\nm = sorted(d.values())\r\n\r\nif sum(l) < n:\r\n print(0)\r\nelse:\r\n ans = 0\r\n for x in range(1, 10000):\r\n p = 0\r\n for i in m:\r\n p += i // x\r\n if p >= n:\r\n ans = x\r\n \r\n print(ans) \r\n", "from collections import Counter\nm,n = map(int, input().split())\nr = Counter(list(map(int, input().split()))).values()\n#print(r)\ni = 1\nwhile sum(x//i for x in r)>=m:\n i+=1\nprint(i-1)", "def produs_cifre(numar):\r\n \r\n produs=1\r\n for i in numar:\r\n produs=produs*int(i)\r\n return (produs)\r\n \r\n#def prime_generator(nr_elemente_prime):\r\n \r\n #vector_prime=[-1]*nr_elemente_prime\r\n #vector_rasp=[0]*nr_elemente_prime\r\n \r\n #vector_prime[1]=1\r\n \r\n #vector_rasp[1]=1\r\n#primes sieve \r\n #contor=2\r\n \r\n #for i in range(2,nr_elemente_prime):\r\n # if vector_prime[i]==-1:\r\n # vector_prime[i]=1\r\n # vector_rasp[contor]=i\r\n # contor=contor+1\r\n # for j in range(i+i,nr_elemente_prime,i):\r\n # if vector_prime[j]==-1:\r\n # vector_prime[j]=i\r\n #print(i,j) \r\n \r\n# my_set=set(vector_rasp)\r\n #my_set.remove(0)\r\n #my_set.remove(1)\r\n \r\n #lista_prime=list(my_set)\r\n #lista_prime.sort()\r\n #return my_set\r\n\r\n\r\ndef functie(nodul,vectorul,cate,culori,vizitat):\r\n #print(noi_culori)\r\n if vizitat[nodul]==0:\r\n vizitat[nodul]=1\r\n \r\n \r\n if culori[nodul-1]!=noi_culori[nodul-1]:\r\n #print(nodul)\r\n cate[0]=1+cate[0]\r\n noi_culori[nodul-1]=culori[nodul-1]\r\n \r\n \r\n for j in vectorul[nodul]:\r\n if vizitat[j]==0:\r\n noi_culori[j-1]=culori[nodul-1]\r\n functie(j,vectorul,cate,culori,vizitat)\r\n \r\n return(sum(cate))\r\n\r\n\r\n\r\n#z=int(input())\r\nfor contor in range(0,1):\r\n #n,k\r\n n,m=list(map(int,input().split()))\r\n #n=int(input())\r\n \r\n lista=list(map(int,input().split()))\r\n vector=[0]*101\r\n\r\n \r\n for i in lista:\r\n vector[i]+=1\r\n \r\n answ=0\r\n \r\n \r\n for posibil in range(100,-1,-1):\r\n cati=0\r\n for j in range(100,-1,-1):\r\n if posibil>0:\r\n cati+=vector[j]//posibil\r\n \r\n if cati>=n :\r\n answ=max(answ,posibil)\r\n \r\n print(answ) \r\n \r\n\r\n \r\n ", "from collections import defaultdict\r\n\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nd = defaultdict(lambda: 0)\r\nfor i in a: d[i] += 1\r\nmx = m//n\r\nfor i in range(mx, -1, -1):\r\n curr = 0\r\n try:\r\n for j in d: curr += d[j]//i\r\n except: print(0)\r\n if curr >= n:\r\n print(i)\r\n break", "def f(p, k):\n if k == 0:\n return 0\n s = 0\n for i in p:\n s = s + i // k\n return s\nn, m = [int(x) for x in input().split()]\npackages = [int(x) for x in input().split()]\nq = 101*[0]\nfor i in packages:\n q[i] = q[i] + 1\nq = sorted(q, reverse=True)\npackages = []\nfor i in q:\n if i > 0:\n packages.append(i)\nl = 1\nr = m // n + 1\nmid = 0\nwhile l < r - 1:\n mid = (l + r) // 2\n if f(packages, mid) >= n:\n l = mid\n else:\n r = mid\nif f(packages, r) >= n:\n print(r)\nelif f(packages, mid) >= n:\n print(mid)\nelif f(packages, l) >= n:\n print(l)\nelse:\n print('0')", "from collections import *\r\nfrom math import *\r\nn,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\na = Counter(a)\r\nct = [0 for i in range(101)]\r\n#print(a)\r\nfor i in a.keys():\r\n #print(a[i])\r\n for j in range(a[i],0,-1):\r\n ct[j] += a[i]//j\r\nans = 0\r\nfor i in range(100,-1,-1):\r\n if(ct[i] >= n):\r\n ans = i\r\n break\r\nprint(ans)", "from collections import Counter\r\n\r\nn,m=map(int,input().split())\r\narr=list(map(int,input().split()))\r\np=Counter(arr)\r\ne=list(p.values())\r\ndef check(x):\r\n ans=0\r\n for el in e:\r\n ans+=el//x\r\n return ans>=n\r\nl=1\r\nans=0\r\nhigh=max(e)\r\nwhile l<=high:\r\n mid=(l+high)//2\r\n if check(mid):\r\n l=mid+1\r\n ans=mid\r\n else :\r\n high=mid-1\r\nprint(ans)", "from collections import Counter\r\nn, m = list(map(int, input().split()))\r\nfoodtype = list(map(int, input().split()))\r\ncount = dict(Counter(foodtype))\r\nd = 1\r\nans = 0\r\nwhile d:\r\n temp = 0\r\n for i in count.values():\r\n temp += i//d\r\n if temp >= n:\r\n ans = d\r\n else:\r\n break\r\n d += 1\r\nprint(ans)", "people,n=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\nd={}\r\ntmp=[]\r\nfor i in range(n):\r\n if a[i] in d:\r\n d[a[i]]+=1\r\n else:\r\n d[a[i]]=1\r\nd1={}\r\nfor i in d:\r\n if d[i] in d1:\r\n d1[d[i]]+=1\r\n else:\r\n d1[d[i]]=1\r\n tmp.append(d[i])\r\ntmp.sort()\r\nans=0\r\nfor i in range(1,10001):\r\n x=people\r\n try:\r\n x-=d1[i]\r\n except:\r\n pass\r\n for j in d1:\r\n if j>i:\r\n x-=(j//i)*d1[j]\r\n if x<=0:\r\n ans=max(ans,i)\r\nprint(ans)" ]

[ "from collections import defaultdict\r\nimport 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(map(int, input().split()))\r\nsa = sum(a)\r\nif sa <= k:\r\n ans = -1 if sa ^ k else \"\"\r\n print(ans)\r\n exit()\r\ncnt = defaultdict(lambda : 0)\r\nfor i in a:\r\n cnt[i] += 1\r\ns = list(set(a))\r\ns.sort()\r\nu, v = 0, n\r\nla = 0\r\nfor i in s:\r\n c = (i - la) * v\r\n if u <= k < u + c:\r\n z = i\r\n break\r\n la = i\r\n u += c\r\n v -= cnt[i]\r\ny = []\r\nfor i in range(n):\r\n if a[i] >= z:\r\n y.append(i + 1)\r\nl = len(y)\r\nc -= l\r\nfor i in range(l):\r\n if a[y[i] - 1] == z and u + c < k:\r\n y[i] = 0\r\n c += 1\r\nd = (k - u) % l\r\nx = [y[(i + d) % l] for i in range(l)]\r\nans = []\r\nfor i in x:\r\n if i:\r\n ans.append(i)\r\nsys.stdout.write(\" \".join(map(str, ans)))", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nc = len(a)\r\nwhile c and k // c:\r\n t = k // c\r\n v = 0\r\n for i in range(len(a)):\r\n if a[i] == 0:\r\n continue\r\n v += a[i] - max(0, a[i] - t)\r\n a[i] = max(0, a[i] - t)\r\n if a[i] == 0:\r\n c -= 1\r\n k -= v\r\nfor i in range(len(a)):\r\n if k == 0:\r\n break\r\n if a[i] != 0:\r\n k -= 1\r\n a[i] -= 1\r\nres = []\r\nfor j in range(len(a)):\r\n if a[(j + i) % len(a)] != 0:\r\n res.append(str((j + i) % len(a) + 1))\r\nif k > 0:\r\n print(-1)\r\nelse:\r\n print(' '.join(res))\r\n", "import sys\r\nfrom array import array # noqa: F401\r\nfrom collections import deque\r\n\r\n\r\ndef input():\r\n return sys.stdin.buffer.readline().decode('utf-8')\r\n\r\n\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nif sum(a) < k:\r\n print(-1)\r\n exit()\r\n\r\nok, ng = 0, 10**9 + 10\r\nwhile abs(ok - ng) > 1:\r\n mid = (ok + ng) >> 1\r\n if sum(mid if mid < x else x for x in a) <= k:\r\n ok = mid\r\n else:\r\n ng = mid\r\n\r\nindex = deque([i + 1 for i in range(n) if a[i] > ok])\r\ndq = deque([x - ok for x in a if x > ok])\r\nk -= sum(ok if ok < x else x for x in a)\r\n\r\nfor _ in range(k):\r\n dq[0] -= 1\r\n if dq[0]:\r\n dq.rotate(-1)\r\n index.rotate(-1)\r\n else:\r\n dq.popleft()\r\n index.popleft()\r\n\r\nprint(*index)\r\n", "n , k = map(int,input().split())\r\nans = [*map(int,input().split())]\r\na = sum(ans)\r\nif a<k:\r\n print('-1')\r\nelif a>k:\r\n lef=0\r\n rig = k+1\r\n while lef+1<rig:\r\n mid = (lef+rig)//2\r\n c=0\r\n for i in range(n):\r\n c += min(ans[i],mid)\r\n if c > k:\r\n rig=mid\r\n else:\r\n lef=mid\r\n for i in range(n):\r\n k-=min(ans[i],lef)\r\n ans[i]-=min(ans[i],lef)\r\n i=0\r\n while k>0:\r\n if ans[i]:\r\n ans[i]-=1\r\n k-=1\r\n i = (i+1)%n\r\n for j in range(i,i+n):\r\n if ans[j%n]:\r\n print(j%n +1 , end=' ') \r\n\r\n\r\n\r\n\r\n", "from bisect import bisect_right\r\nfrom itertools import accumulate\r\n\r\n\r\ndef rest(k, a, q):\r\n return q[k:] + list(filter(lambda x: a[x - 1] > 1, q[:k]))\r\n\r\n\r\ndef cycle(a, k):\r\n n = len(a)\r\n s = sorted(a)\r\n sm = list(accumulate(s))\r\n b = [(sm[i - 1] if i > 0 else 0) + s[i] * (n - i) for i in range(n)]\r\n r = bisect_right(b, k)\r\n if r == 0:\r\n return k // n\r\n else:\r\n return s[r - 1] + (k - b[r - 1]) // (n - r)\r\n\r\n\r\ndef answer(k, a, q):\r\n d = sum(a)\r\n if k > d:\r\n return [-1]\r\n if k == d:\r\n return []\r\n if k < len(q):\r\n return rest(k, a, q)\r\n r = cycle(a, k)\r\n s = sorted(a)\r\n w = bisect_right(s, r)\r\n p = sum(s[:w]) + r * (len(a) - w)\r\n a = [max(i - r, 0) for i in a]\r\n q = list(filter(lambda x: a[x - 1] > 0, q))\r\n return rest(k - p, a, q)\r\n\r\n\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nq = list(range(1, n + 1))\r\nprint(*answer(k, a, q))\r\n" ]

[ "import sys\r\nn,m=map(int,sys.stdin.readline().split())\r\nP={}\r\nfor i in range(m):\r\n a,b=map(int,sys.stdin.readline().split())\r\n P[(a-1,b-1)]=1\r\n\r\nA=[-1]*n\r\nA[0]=0\r\nfor i in range(1,n):\r\n j=1\r\n A[i]=i\r\n x=i\r\n while(x>0 and (A[x-1],A[x]) in P):\r\n A[x-1],A[x]=A[x],A[x-1]\r\n x-=1\r\nAnss=\"\"\r\nfor i in range(n):\r\n Anss+=str(A[i]+1)+\" \"\r\nsys.stdout.write(Anss)\r\n", "n,m=map(int,input().split())\r\ng=[set()for i in range(n)]\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n g[a-1].add(b-1)\r\nc=[0]*n\r\nfor i in range(n): c[i]=i\r\nfor i in range(n):\r\n j=i\r\n while j>0 and c[j] in g[c[j-1]]:\r\n c[j],c[j-1]=c[j-1],c[j]\r\n j-=1\r\nfor i in c: print(i+1,end=' ')", "n,m = map(int,input().split())\ng = [set() for i in range(n)]\nfor i in range(m):\n a,b = map(int,input().split())\n g[a-1].add(b-1)\nc = [0]*n\nfor i in range(n):\n c[i]=i\nfor i in range(n):\n j=i\n while j>0 and c[j] in g[c[j-1]]:\n c[j],c[j-1]=c[j-1],c[j]\n j-=1\nfor i in c:\n print(i+1,end=' ')\n \t\t \t \t \t\t\t\t\t \t\t\t \t\t\t", "n, m = map(int,input().split())\r\ng = [set() for i in range(n)]\r\nfor i in range(m):\r\n a, b = map(int,input().split())\r\n g[a-1].add(b-1)\r\n\r\nc = [0] * n\r\nfor i in range(n):\r\n c[i] = i\r\nfor i in range(n):\r\n j = i\r\n while (j > 0)and(c[j] in g[c[j - 1]]):\r\n c[j], c[j-1] = c[j-1], c[j]\r\n j -= 1\r\nfor i in c:\r\n print(i + 1, end = ' ')" ]

[ "n, m = map(int, input().split())\r\nf, b = [int(e) for e in input().split()], [int(e) for e in input().split()]\r\nF, l = {}, []\r\nfor e, u in enumerate(f):\r\n if u in F:\r\n F[u] = 0\r\n else:\r\n F[u] = e+1\r\nfor e in b:\r\n if e in F:\r\n if F[e] > 0:\r\n l += [F[e]]\r\n else:\r\n print('Impossible')\r\n break\r\nelse:\r\n if len(l) == m:\r\n print('Possible')\r\n print(*l)\r\n else:\r\n print('Ambiguity')\r\n", "import sys\r\nimport math\r\ninput = sys.stdin.readline\r\nn,m = map(int,input().split())\r\nf = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nd = {}\r\nc = 0\r\nfor i in range(n):\r\n x = f[i]\r\n if x in d:\r\n d[x].append(i)\r\n\r\n else:\r\n d[x] = [i]\r\n\r\nans = []\r\nfor i in range(m):\r\n x = b[i]\r\n if x in d:\r\n if len(d[x]) == 1 and c == 0:\r\n ans.append(d[x][0]+1)\r\n\r\n else:\r\n c = 1\r\n\r\n else:\r\n c = 2\r\n break\r\n\r\nif c == 2:\r\n print(\"Impossible\")\r\n exit()\r\n\r\nif c == 1:\r\n print(\"Ambiguity\")\r\n exit()\r\n\r\nprint(\"Possible\")\r\nprint(*ans)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\nf = list(map(int, input().split()))\r\nw = list(map(int, input().split()))\r\nd = dict()\r\ne = []\r\nc = 0\r\nfor j, i in enumerate(f):\r\n if d.get(i, -1) == -1:\r\n d[i] = j\r\n else:\r\n d[i] = -2\r\nfor j, i in enumerate(w):\r\n if i not in d:\r\n print('Impossible')\r\n exit()\r\n else:\r\n if d[i] == -2:\r\n c = 1\r\n else:\r\n e.append(d[i]+1)\r\nif c == 1:\r\n print('Ambiguity')\r\nelse:\r\n print('Possible')\r\n print(' '.join(map(str, e)))", "from collections import defaultdict as dc\r\nn,m=[int(x) for x in input().split()]\r\nf=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nmp=dc(lambda:list())\r\nfor i in range(n):mp[f[i]].append(i+1)\r\nflag=0\r\nans=list()\r\nfor i in b:\r\n if i not in mp:flag=1; break\r\n elif i in mp and len(mp[i])>1:flag=2\r\nif flag==1:print(\"Impossible\")\r\nelif flag==2:print(\"Ambiguity\")\r\nelse:\r\n for i in range(m):ans.append(*mp[b[i]])\r\n print(\"Possible\")\r\n print(*ans)", "n,m=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nbrr=list(map(int,input().split()))\r\nd={}\r\nfor i,el in enumerate(arr):\r\n if el not in d:\r\n d[el]=[]\r\n d[el].append(i)\r\nans=[]\r\nf=True\r\np=True\r\nfor el in brr:\r\n if el not in d:\r\n p=False\r\n elif len(d[el])>1:\r\n f=False\r\n else :\r\n ans.append(d[el][0]+1)\r\n \r\nif not p:\r\n print(\"Impossible\")\r\nelif not f:\r\n print(\"Ambiguity\")\r\nelse:\r\n print(\"Possible\")\r\n print(*ans) \r\n ", "n,m=map(int,input().split())\r\nf=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nd={}\r\nfor i in range(n):\r\n if f[i] in d:d[f[i]]=-1\r\n else: d[f[i]]=i+1\r\nt=[]\r\nans=0\r\nfor x in b:\r\n if x in d:\r\n if d[x]==-1:\r\n ans=2\r\n else:\r\n t.append(d[x])\r\n else:ans=-1;break\r\nif ans==-1:print('Impossible')\r\nelif ans==2:print('Ambiguity')\r\nelse: print('Possible');print(*t)", "from collections import Counter\n\nif __name__ == \"__main__\":\n\n n, m = map(int, input().split())\n f = list(map(int, input().split()))\n b = list(map(int, input().split()))\n\n fs = set(f)\n bs = set(b)\n\n if (fs & bs) != bs:\n print(\"Impossible\")\n exit(0)\n\n ct = set(k for k, v in filter(lambda k: k[1] > 1, Counter(f).items()))\n if len(bs.intersection(ct)) > 0:\n print(\"Ambiguity\")\n exit(0)\n\n h = {}\n for i, x in enumerate(f):\n h[x] = str(i + 1)\n\n print(\"Possible\")\n print(\" \".join(list(map(lambda xx: h[xx], b))))\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 \t", "import collections\r\n \r\nn, m = map(int, input().split())\r\nfs = list(map(int, input().split()))\r\nbs = list(map(int, input().split()))\r\n \r\ndef solve(n, m, fs, bs):\r\n if not is_possible(n, m, fs, bs):\r\n print('Impossible')\r\n return\r\n ans = solve2(n, m, fs, bs)\r\n if not ans:\r\n print('Ambiguity')\r\n else:\r\n print('Possible')\r\n print(*ans)\r\n \r\ndef is_possible(n, m, fs, bs):\r\n setf = set(fs)\r\n setb = set(bs)\r\n return setb <= setf\r\n \r\n \r\ndef solve2(n, m, fs, bs):\r\n finv = collections.defaultdict(set)\r\n for i, f in enumerate(fs):\r\n finv[f].add(i)\r\n As = []\r\n for b in bs:\r\n fb = finv[b]\r\n if len(fb) > 1:\r\n return False\r\n for a in fb:\r\n As.append(a + 1)\r\n return As\r\n \r\n \r\n \r\nsolve(n, m, fs, bs)" ]

[ "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,M = map(int,input().split())\nP = [[] for _ in range(N+1)]\nfor _ in range(M):\n a,b,c = map(int,input().split())\n P[a].append([b,c])\n P[b].append([a,c])\n\nl = [[]]\nfor _ in range(N):\n l.append(list(map(int,input().split()))[1:])\n\ndist = [float('inf')]*(N+1)\ndist[1]=0\nk = [(0,1)]\n\nwhile k:\n d,x = heappop(k)\n if d!=dist[x]:continue\n cur = dist[x]\n for i in l[x]:\n if i==cur:cur+=1\n\n for j,c in P[x]:\n if dist[j]>dist[x]+c:\n dist[j] = min(dist[j],cur+c)\n heappush(k,(dist[j],j))\n\nif dist[N]!=float('inf'):\n print(dist[N])\nelse:\n print(-1)\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom collections import defaultdict\r\nfrom heapq import *\r\nfrom bisect import *\r\n\r\nINF = float('inf')\r\nN,M = map(int, input().split())\r\nP = [[] for _ in range(N)]\r\nfor _ in range(M):\r\n a,b,c = map(int, input().split())\r\n a-=1;b-=1\r\n P[a].append((b,c))\r\n P[b].append((a,c))\r\n\r\nA = []\r\nfor i in range(N):\r\n A.append(list(map(int, input().split()))[1:])\r\n A[-1].sort()\r\ndist = [INF]*N\r\n\r\nv = [(0,0)]\r\nwhile v:\r\n d,i = heappop(v)\r\n if d>=dist[i]:continue\r\n \r\n dist[i] = d\r\n idx = bisect_left(A[i], d)\r\n if idx<len(A[i]) and A[i][idx]==d:\r\n for j in range(idx,len(A[i])):\r\n if A[i][j]==d:\r\n d+=1\r\n else:break\r\n for j,c in P[i]:\r\n if dist[j]>d+c:\r\n heappush(v,(d+c,j))\r\nif dist[-1]==INF:\r\n print(-1)\r\nelse:\r\n print(dist[-1])\r\n ", "import heapq\r\nimport random\r\nimport sys\r\nfrom collections import defaultdict\r\nfrom math import inf\r\nfrom types import GeneratorType\r\n\r\nRANDOM = random.randint(1, 10 ** 9)\r\n\r\n\r\nclass FastIO:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def read_str():\r\n return sys.stdin.readline().rstrip()\r\n\r\n @staticmethod\r\n def read_int():\r\n return int(sys.stdin.readline().rstrip())\r\n\r\n @staticmethod\r\n def read_float():\r\n return float(sys.stdin.readline().rstrip())\r\n\r\n @staticmethod\r\n def read_ints():\r\n return map(int, sys.stdin.readline().rstrip().split())\r\n\r\n @staticmethod\r\n def read_floats():\r\n return map(float, sys.stdin.readline().rstrip().split())\r\n\r\n @staticmethod\r\n def read_ints_minus_one():\r\n return map(lambda x: int(x) - 1, sys.stdin.readline().rstrip().split())\r\n\r\n @staticmethod\r\n def read_list_ints():\r\n return list(map(int, sys.stdin.readline().rstrip().split()))\r\n\r\n @staticmethod\r\n def read_list_floats():\r\n return list(map(float, sys.stdin.readline().rstrip().split()))\r\n\r\n @staticmethod\r\n def read_list_ints_minus_one():\r\n return list(map(lambda x: int(x) - 1,\r\n sys.stdin.readline().rstrip().split()))\r\n\r\n @staticmethod\r\n def read_list_strs():\r\n return sys.stdin.readline().rstrip().split()\r\n\r\n @staticmethod\r\n def read_list_str():\r\n return list(sys.stdin.readline().rstrip())\r\n\r\n @staticmethod\r\n def st(x):\r\n return print(x)\r\n\r\n @staticmethod\r\n def lst(x):\r\n return print(*x)\r\n\r\n @staticmethod\r\n def round_5(f):\r\n res = int(f)\r\n if f - res >= 0.5:\r\n res += 1\r\n return res\r\n\r\n @staticmethod\r\n def max(a, b):\r\n return a if a > b else b\r\n\r\n @staticmethod\r\n def min(a, b):\r\n return a if a < b else b\r\n\r\n @staticmethod\r\n def bootstrap(f, queue=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n if queue:\r\n return f(*args, **kwargs)\r\n else:\r\n to = f(*args, **kwargs)\r\n while True:\r\n if isinstance(to, GeneratorType):\r\n queue.append(to)\r\n to = next(to)\r\n else:\r\n queue.pop()\r\n if not queue:\r\n break\r\n to = queue[-1].send(to)\r\n return to\r\n\r\n return wrappedfunc\r\n\r\n def ask(self, lst):\r\n self.lst(lst)\r\n sys.stdout.flush()\r\n res = self.read_int()\r\n return res\r\n\r\n @staticmethod\r\n def accumulate(nums):\r\n n = len(nums)\r\n pre = [0] * (n + 1)\r\n for i in range(n):\r\n pre[i + 1] = pre[i] + nums[i]\r\n return pre\r\n\r\n\r\nclass Wrapper(int):\r\n # 用来规避 py 哈希碰撞的问题和进行加速\r\n def __init__(self, x):\r\n int.__init__(x)\r\n # 原理是异或一个随机种子\r\n\r\n def __hash__(self):\r\n # 也可以将数组排序后进行哈希计数\r\n return super(Wrapper, self).__hash__() ^ RANDOM\r\n\r\n\r\nclass Solution:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def main(ac=FastIO()):\r\n n, m = ac.read_ints()\r\n dct = [[] for _ in range(n)]\r\n for _ in range(m):\r\n a, b, c = ac.read_ints_minus_one()\r\n dct[a].append([b, c + 1])\r\n dct[b].append([a, c + 1])\r\n\r\n post = [ac.read_list_ints()[1:] for _ in range(n)]\r\n\r\n dis = [inf] * n\r\n stack = [[0, 0]]\r\n dis[0] = 0\r\n\r\n while stack:\r\n d, i = heapq.heappop(stack)\r\n if dis[i] < d:\r\n continue\r\n if i == n - 1:\r\n break\r\n post[i].sort()\r\n for x in post[i]:\r\n if x == d:\r\n d += 1\r\n for j, w in dct[i]:\r\n dj = w + d\r\n if dj < dis[j]:\r\n dis[j] = dj\r\n heapq.heappush(stack, [dj, j])\r\n ac.st(dis[-1] if dis[-1] < inf else -1)\r\n return\r\n\r\n\r\nSolution().main()\r\n", "import heapq\r\nimport random\r\nimport sys\r\nfrom collections import defaultdict\r\nfrom math import inf\r\nfrom types import GeneratorType\r\n\r\nRANDOM = random.randint(1, 10 ** 9)\r\n\r\n\r\nclass FastIO:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def read_str():\r\n return sys.stdin.readline().rstrip()\r\n\r\n @staticmethod\r\n def read_int():\r\n return int(sys.stdin.readline().rstrip())\r\n\r\n @staticmethod\r\n def read_float():\r\n return float(sys.stdin.readline().rstrip())\r\n\r\n @staticmethod\r\n def read_ints():\r\n return map(int, sys.stdin.readline().rstrip().split())\r\n\r\n @staticmethod\r\n def read_floats():\r\n return map(float, sys.stdin.readline().rstrip().split())\r\n\r\n @staticmethod\r\n def read_ints_minus_one():\r\n return map(lambda x: int(x) - 1, sys.stdin.readline().rstrip().split())\r\n\r\n @staticmethod\r\n def read_list_ints():\r\n return list(map(int, sys.stdin.readline().rstrip().split()))\r\n\r\n @staticmethod\r\n def read_list_floats():\r\n return list(map(float, sys.stdin.readline().rstrip().split()))\r\n\r\n @staticmethod\r\n def read_list_ints_minus_one():\r\n return list(map(lambda x: int(x) - 1,\r\n sys.stdin.readline().rstrip().split()))\r\n\r\n @staticmethod\r\n def read_list_strs():\r\n return sys.stdin.readline().rstrip().split()\r\n\r\n @staticmethod\r\n def read_list_str():\r\n return list(sys.stdin.readline().rstrip())\r\n\r\n @staticmethod\r\n def st(x):\r\n return print(x)\r\n\r\n @staticmethod\r\n def lst(x):\r\n return print(*x)\r\n\r\n @staticmethod\r\n def round_5(f):\r\n res = int(f)\r\n if f - res >= 0.5:\r\n res += 1\r\n return res\r\n\r\n @staticmethod\r\n def max(a, b):\r\n return a if a > b else b\r\n\r\n @staticmethod\r\n def min(a, b):\r\n return a if a < b else b\r\n\r\n @staticmethod\r\n def bootstrap(f, queue=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n if queue:\r\n return f(*args, **kwargs)\r\n else:\r\n to = f(*args, **kwargs)\r\n while True:\r\n if isinstance(to, GeneratorType):\r\n queue.append(to)\r\n to = next(to)\r\n else:\r\n queue.pop()\r\n if not queue:\r\n break\r\n to = queue[-1].send(to)\r\n return to\r\n\r\n return wrappedfunc\r\n\r\n def ask(self, lst):\r\n self.lst(lst)\r\n sys.stdout.flush()\r\n res = self.read_int()\r\n return res\r\n\r\n @staticmethod\r\n def accumulate(nums):\r\n n = len(nums)\r\n pre = [0] * (n + 1)\r\n for i in range(n):\r\n pre[i + 1] = pre[i] + nums[i]\r\n return pre\r\n\r\n\r\nclass Wrapper(int):\r\n # 用来规避 py 哈希碰撞的问题和进行加速\r\n def __init__(self, x):\r\n int.__init__(x)\r\n # 原理是异或一个随机种子\r\n\r\n def __hash__(self):\r\n # 也可以将数组排序后进行哈希计数\r\n return super(Wrapper, self).__hash__() ^ RANDOM\r\n\r\n\r\nclass UnionFind:\r\n def __init__(self, n: int) -> None:\r\n self.root = [i for i in range(n)]\r\n self.size = [1] * n\r\n self.part = n\r\n return\r\n\r\n def find(self, x):\r\n lst = []\r\n while x != self.root[x]:\r\n lst.append(x)\r\n # 在查询的时候合并到顺带直接根节点\r\n x = self.root[x]\r\n for w in lst:\r\n self.root[w] = x\r\n return x\r\n\r\n def union(self, x, y):\r\n root_x = self.find(x)\r\n root_y = self.find(y)\r\n if root_x == root_y:\r\n return False\r\n if self.size[root_x] >= self.size[root_y]:\r\n root_x, root_y = root_y, root_x\r\n self.root[root_x] = root_y\r\n self.size[root_y] += self.size[root_x]\r\n # 将非根节点的秩赋0\r\n self.size[root_x] = 0\r\n self.part -= 1\r\n return True\r\n\r\n def is_connected(self, x, y):\r\n return self.find(x) == self.find(y)\r\n\r\n def get_root_part(self):\r\n # 获取每个根节点对应的组\r\n part = defaultdict(list)\r\n n = len(self.root)\r\n for i in range(n):\r\n part[self.find(i)].append(i)\r\n return part\r\n\r\n def get_root_size(self):\r\n # 获取每个根节点对应的组大小\r\n size = defaultdict(int)\r\n n = len(self.root)\r\n for i in range(n):\r\n size[self.find(i)] = self.size[self.find(i)]\r\n return size\r\n\r\n\r\nclass Solution:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def main(ac=FastIO()):\r\n n, m = ac.read_ints()\r\n dct = [[] for _ in range(n)]\r\n for _ in range(m):\r\n a, b, c = ac.read_ints_minus_one()\r\n dct[a].append([b, c + 1])\r\n dct[b].append([a, c + 1])\r\n\r\n post = []\r\n for _ in range(n):\r\n cur = ac.read_list_ints()[1:]\r\n tmp = dict()\r\n for num in sorted(cur, reverse=True):\r\n tmp[num] = tmp.get(num + 1, num + 1)\r\n post.append(tmp)\r\n\r\n dis = [inf] * n\r\n stack = [[0, 0]]\r\n dis[0] = 0\r\n\r\n while stack:\r\n d, i = heapq.heappop(stack)\r\n if dis[i] < d:\r\n continue\r\n dd = post[i].get(d, d)\r\n for j, w in dct[i]:\r\n dj = w + dd\r\n if dj < dis[j]:\r\n dis[j] = dj\r\n heapq.heappush(stack, [dj, j])\r\n ac.st(dis[-1] if dis[-1] < inf else -1)\r\n return\r\n\r\n\r\nSolution().main()\r\n", "import sys\r\nfrom math import sqrt, gcd, inf\r\nRI = lambda: map(int, sys.stdin.buffer.readline().split())\r\nfrom bisect import bisect_left\r\nfrom heapq import *\r\n\r\n\r\nn, m = RI()\r\ng = [[] for _ in range(n + 1)]\r\nfor _ in range(m):\r\n x, y, c = RI()\r\n g[x].append((y, c))\r\n g[y].append((x, c))\r\n\r\nts = [set()] # 提前放一个无用的进去，避免下标转换\r\nfor _ in range(n):\r\n _, *ban = RI()\r\n ts.append(set(ban))\r\n\r\nq = [(0, 1)]\r\ndist = [inf] * (n + 1)\r\ndist[1] = 0\r\n\r\nwhile q:\r\n t, x = heappop(q)\r\n if dist[x] < t: continue\r\n if x == n:\r\n print(t)\r\n exit()\r\n\r\n while t in ts[x]:\r\n t += 1\r\n\r\n for y, c in g[x]:\r\n if dist[y] > c + t:\r\n dist[y] = c + t\r\n heappush(q, (t + c, y))\r\n\r\nprint(-1)", "import sys\r\nfrom heapq import *\r\nr=sys.stdin.readline\r\n\r\nn,m = map(int,r().split())\r\ng=[[] for _ in range(n+1)]\r\nfor _ in range(m):\r\n a,b,c=map(int,r().split())\r\n g[a].append((b,c))\r\n g[b].append((a,c))\r\ntimes=[[]]\r\nfor _ in range(n):\r\n times.append(list(map(int,r().split()))[1:])\r\n\r\nINF = sys.maxsize\r\ndist = [INF]*(n+1)\r\ndist[1]=0\r\nq=[(0,1)]\r\n\r\nwhile q:\r\n d,idx = heappop(q)\r\n if d !=dist[idx]:\r\n continue\r\n cur = dist[idx]\r\n for i in times[idx]:\r\n if i==cur:\r\n cur+=1\r\n for e,cost in g[idx]:\r\n if dist[e] > dist[idx]+cost:\r\n dist[e] = min(dist[e], cur+cost)\r\n heappush(q,(dist[e],e))\r\nprint(dist[n] if dist[n]!=INF else -1)\r\n\r\n", "import heapq\r\nimport collections\r\nfrom sys import stdin, stdout\r\ninput = stdin.readline\r\ndef dijkstra(adjacency_list, src, v, halt):\r\n dist = {i:-1 for i in range(v+1)}\r\n minHeap = []\r\n dist[src] = 0\r\n heapq.heappush(minHeap, [dist[src], src])\r\n while(minHeap):\r\n first = heapq.heappop(minHeap)\r\n first_dist = first[0]\r\n first_vertex = first[1]\r\n if first_dist == dist[first_vertex]:\r\n while first_dist in halt[first_vertex]:\r\n first_dist+=1\r\n for i in adjacency_list[first_vertex]:\r\n i_vertex = i[0]\r\n i_weight = i[1]\r\n if dist[i_vertex] == -1:\r\n dist[i_vertex] = first_dist + i_weight\r\n heapq.heappush(minHeap, [dist[i_vertex], i_vertex])\r\n elif first_dist + i_weight < dist[i_vertex]:\r\n dist[i_vertex] = first_dist + i_weight\r\n heapq.heappush(minHeap, [dist[i_vertex], i_vertex])\r\n return dist[n]\r\nn, m = map(int, input().split())\r\nd = collections.defaultdict(list)\r\nhalt = [0]\r\nfor _ in range(m):\r\n a, b, w = map(int, input().split())\r\n d[a].append([b, w])\r\n d[b].append([a, w])\r\nfor _ in range(n):\r\n z = set(list(map(int, input().split()))[1:])\r\n halt.append(z)\r\nprint(dijkstra(d, 1, n, halt))", "# Problem: B. Planets\r\n# Contest: Codeforces - Codeforces Round 142 (Div. 1)\r\n# URL: https://codeforces.com/contest/229/problem/B\r\n# Memory Limit: 256 MB\r\n# Time Limit: 2000 ms\r\n\r\nimport sys\r\nimport bisect\r\nimport random\r\nimport io, os\r\nfrom bisect import *\r\nfrom collections import *\r\nfrom contextlib import redirect_stdout\r\nfrom itertools import *\r\nfrom array import *\r\nfrom functools import lru_cache, reduce\r\nfrom types import GeneratorType\r\nfrom heapq import *\r\nfrom math import sqrt, gcd, inf\r\n\r\nif sys.version >= '3.8': # ACW没有comb\r\n from math import comb\r\n\r\nRI = lambda: map(int, sys.stdin.buffer.readline().split())\r\nRS = lambda: map(bytes.decode, sys.stdin.buffer.readline().strip().split())\r\nRILST = lambda: list(RI())\r\nDEBUG = lambda *x: sys.stderr.write(f'{str(x)}\\n')\r\n# print = lambda d: sys.stdout.write(str(d) + \"\\n\") # 打开可以快写，但是无法使用print(*ans,sep=' ')这种语法,需要print(' '.join(map(str, p)))，确实会快。\r\n\r\nDIRS = [(0, 1), (1, 0), (0, -1), (-1, 0)] # 右下左上\r\nDIRS8 = [(0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1), (-1, 0),\r\n (-1, 1)] # →↘↓↙←↖↑↗\r\n\r\nMOD = 10 ** 9 + 7\r\nPROBLEM = \"\"\"https://codeforces.com/contest/229/problem/B\r\n\r\n输入 n(2≤n≤1e5) m(0≤m≤1e5) 表示一个 n 点 m 边的无向图（节点编号从 1 开始）。\r\n然后输入 m 条边，每条边包含 3 个数 a b c(1≤c≤1e4)，表示有一条边权为 c 的无向边连接 a 和 b，表示从 a 到 b 需要 c 秒。\r\n保证无自环、无重边。\r\n然后输入 n 行，每行第一个数 k 表示数组 t[i] 的长度，然后输入数组 t[i]。\r\n数组 t[i] 是一个严格递增序列，0≤t[i][j]<1e9。\r\n所有 k 之和 ≤1e5。\r\n\r\n初始时间为 0。你从 1 出发，要去 n。\r\n如果你在点 i，但是当前时间在数组 t[i] 中，那么你必须等待 1 秒。如果下一秒仍然在 t[i] 中，那么继续等待 1 秒。依此类推。\r\n输出到达 n 的最早时间。\r\n如果无法到达 n，输出 -1。\r\n\r\n【易错题】\r\n输入\r\n4 6\r\n1 2 2\r\n1 3 3\r\n1 4 8\r\n2 3 4\r\n2 4 5\r\n3 4 3\r\n0\r\n1 3\r\n2 3 4\r\n0\r\n输出 7\r\n\r\n输入\r\n3 1\r\n1 2 3\r\n0\r\n1 3\r\n0\r\n输出 -1\r\n\"\"\"\r\n\r\n\r\n# ms\r\ndef solve():\r\n n, m = RI()\r\n g = [[] for _ in range(n)]\r\n for _ in range(m):\r\n u, v, w = RI()\r\n u -= 1\r\n v -= 1\r\n g[u].append((v, w))\r\n g[v].append((u, w))\r\n t = []\r\n for _ in range(n):\r\n _, *ban = RI()\r\n t.append(set(ban))\r\n h = [(0, 0)]\r\n dist = [inf] * n\r\n dist[0] = 0\r\n while h:\r\n d, u = heappop(h)\r\n if d > dist[u]:\r\n continue\r\n if u == n - 1:\r\n return print(d)\r\n while d in t[u]:\r\n d += 1\r\n for v, w in g[u]:\r\n if d + w < dist[v]:\r\n dist[v] = d + w\r\n heappush(h, (d + w, v))\r\n print(-1)\r\n\r\n\r\nif __name__ == '__main__':\r\n t = 0\r\n if t:\r\n t, = RI()\r\n for _ in range(t):\r\n solve()\r\n else:\r\n solve()\r\n", "# '''\r\n# https://codeforces.com/contest/229/problem/B\r\n\r\n# 输入 n(2≤n≤1e5) m(0≤m≤1e5) 表示一个 n 点 m 边的无向图（节点编号从 1 开始）。\r\n# 然后输入 m 条边，每条边包含 3 个数 a b c(1≤c≤1e4)，表示有一条边权为 c 的无向边连接 a 和 b。\r\n# 保证无自环、无重边。\r\n# 然后输入 n 行，每行第一个数 k 表示数组 t[i] 的长度，然后输入数组 t[i]。\r\n# 数组 t[i] 是一个严格递增序列，0≤t[i][j]<1e9。\r\n# 所有 k 之和 ≤1e5。\r\n\r\n# 初始时间为 0。你从 1 出发，要去 n。\r\n# 如果你在点 i，但是当前时间在数组 t[i] 中，那么你必须等待 1 秒。如果下一秒仍然在 t[i] 中，那么继续等待 1 秒。依此类推。\r\n# 输出到达 n 的最早时间。\r\n# 如果无法到达 n，输出 -1。\r\n\r\n# 【易错题】\r\n# 输入\r\n# 4 6\r\n# 1 2 2\r\n# 1 3 3\r\n# 1 4 8\r\n# 2 3 4\r\n# 2 4 5\r\n# 3 4 3\r\n# 0\r\n# 1 3\r\n# 2 3 4\r\n# 0\r\n# 输出 7\r\n\r\n# 输入\r\n# 3 1\r\n# 1 2 3\r\n# 0\r\n# 1 3\r\n# 0\r\n# 输出 -1\r\n# '''\r\n# from cmath import inf\r\n# from collections import defaultdict\r\n# from heapq import heappop, heappush\r\n\r\n\r\n# def _n():\r\n# return int(input())\r\n\r\n\r\n# def _nA():\r\n# return list(map(int, input().split()))\r\n\r\n\r\n# def _nS():\r\n# return input().split()\r\n\r\n\r\n# def solve():\r\n# n, m = _nA()\r\n# graph = [[]for _ in range(n)]\r\n# for i in range(m):\r\n# a, b, c = _nA()\r\n# a -= 1\r\n# b -= 1\r\n# graph[a].append((b, c))\r\n# graph[b].append((a, c))\r\n# t = [None]*n\r\n# for i in range(n):\r\n# t[i] = _nA()[1:]\r\n# dist = [inf]*n\r\n# dist[0] = 0\r\n# q = [(0, 0)]\r\n# while q:\r\n# d, x = heappop(q)\r\n# if d!=dist[x]:\r\n# continue\r\n# for i in t[x]:\r\n# if d == i:\r\n# d += 1\r\n# for y, c in graph[x]:\r\n# if dist[x]+c < dist[y]:\r\n# dist[y] = min(dist[y], d+c)\r\n# heappush(q, (dist[y], y))\r\n# return dist[-1] if dist[-1] != inf else -1\r\n\r\n\r\n# print(solve())\r\n\r\nimport sys\r\nfrom heapq import *\r\nr=sys.stdin.readline\r\n\r\nn,m = map(int,r().split())\r\ng=[[] for _ in range(n+1)]\r\nfor _ in range(m):\r\n a,b,c=map(int,r().split())\r\n g[a].append((b,c))\r\n g[b].append((a,c))\r\ntimes=[[]]\r\nfor _ in range(n):\r\n times.append(list(map(int,r().split()))[1:])\r\n\r\nINF = sys.maxsize\r\ndist = [INF]*(n+1)\r\ndist[1]=0\r\nq=[(0,1)]\r\n\r\nwhile q:\r\n d,idx = heappop(q)\r\n if d !=dist[idx]:\r\n continue\r\n cur = dist[idx]\r\n for i in times[idx]:\r\n if i==cur:\r\n cur+=1\r\n for e,cost in g[idx]:\r\n if dist[e] > dist[idx]+cost:\r\n dist[e] = min(dist[e], cur+cost)\r\n heappush(q,(dist[e],e))\r\nprint(dist[n] if dist[n]!=INF else -1)\r\n", "import random\r\nimport sys\r\nfrom math import gcd, lcm, sqrt, isqrt, perm, pow\r\nfrom collections import Counter, defaultdict, deque\r\nfrom functools import lru_cache, reduce, cmp_to_key\r\nfrom itertools import accumulate, combinations, permutations\r\nfrom heapq import nsmallest, nlargest, heappushpop, heapify, heappop, heappush\r\nfrom copy import deepcopy\r\nfrom bisect import bisect_left, bisect_right\r\nfrom string import ascii_lowercase, ascii_uppercase\r\ninf = float('inf')\r\ninput = lambda: sys.stdin.readline().strip()\r\nI = lambda: input()\r\nII = lambda: int(input())\r\nMII = lambda: map(int, input().split())\r\nLI = lambda: list(input().split())\r\nLII = lambda: list(map(int, input().split()))\r\nGMI = lambda: map(lambda x: int(x) - 1, input().split())\r\nLGMI = lambda: list(map(lambda x: int(x) - 1, input().split()))\r\n\r\ndef solve():\r\n n, m = MII()\r\n g = [[] for _ in range(n)]\r\n for _ in range(m):\r\n u, v, c = MII()\r\n u -= 1\r\n v -= 1\r\n g[u].append((v, c))\r\n g[v].append((u, c))\r\n times = []\r\n for _ in range(n):\r\n times.append(LII()[1:])\r\n dis = [inf]*n\r\n dis[0] = 0\r\n h = [(0, 0)]\r\n while h:\r\n d, i = heappop(h)\r\n if dis[i] < d:\r\n continue\r\n if i == n-1:\r\n break\r\n idx = bisect_left(times[i], d)\r\n while idx < len(times[i]) and times[i][idx] == d:\r\n d += 1\r\n idx += 1\r\n for j, c in g[i]:\r\n nd = d+c\r\n if nd < dis[j]:\r\n dis[j] = nd\r\n heappush(h, (nd, j))\r\n print(dis[n-1] if dis[n-1] < inf else -1)\r\n return\r\n\r\nsolve()\r\n", "# 其实每次dij只查一次点，暴力查即可，拿并查集合并属于是负优化了。\r\nimport sys\r\ninput = sys.stdin.readline\r\nn,m = map(int, input().split())\r\nfrom collections import defaultdict\r\ng = defaultdict(list)\r\nfor _ in range(m):\r\n u,v,c = map(int, input().split())\r\n u -= 1\r\n v -= 1\r\n g[u].append((v,c))\r\n g[v].append((u,c))\r\nbanned = []\r\nfor i in range(n):\r\n banned.append(set(list(map(int, input().split()))[1:]))\r\nimport heapq\r\nq = [(0,0)]\r\nvis = [False]*n\r\nwhile q:\r\n t,u = heapq.heappop(q)\r\n if vis[u]:\r\n continue\r\n vis[u] = True\r\n if u == n-1:\r\n print(t)\r\n exit()\r\n while t in banned[u]:\r\n t += 1\r\n for v,c in g[u]:\r\n if not vis[v]:\r\n heapq.heappush(q,(t + c,v))\r\nprint(-1)", "from heapq import *\r\nINF = 1e16\r\nviajantes = []\r\n\r\nN,M = map(int,input().split())\r\n\r\ngalaxia = [[] for i in range(100002)]\r\ntempo = [INF] * (N+1)\r\n\r\n\r\nfor i in range(M):\r\n a,b,c = map(int,input().split())\r\n galaxia[a] += [(c,b)]\r\n galaxia[b] += [(c,a)]\r\n\r\nfor j in range(N):\r\n vi = list(map(int,input().split()))\r\n viajantes.append(vi[1::])\r\n\r\ndef visitante_chegando(w,a):\r\n for x in viajantes[a-1]:\r\n if x == w:\r\n w += 1\r\n return w\r\n\r\ndef dijsktra(u,v,galaxia):\r\n tempo[u] = 0\r\n q = [(0,u)]\r\n\r\n while q:\r\n z,a = heappop(q)\r\n #a[0] = distância\r\n #a[1] = vertice\r\n #tempo[a[1]] melhor tempo que cheguei em a[1]\r\n #if a[0] == tempo[a[1]]:\r\n if z <= tempo[a]:\r\n w2 = tempo[a]\r\n w2 = visitante_chegando(w2,a)\r\n for adj in galaxia[a]:\r\n w,b = w2 + adj[0],adj[1]\r\n #print(w)\r\n if w < tempo[b]:\r\n tempo[b] = w\r\n heappush(q,(tempo[b],b))\r\n return tempo\r\n\r\n\r\nd = dijsktra(1,N,galaxia)\r\nif d[-1] == INF:\r\n print(-1)\r\nelse:\r\n print(d[N])\r\n\r\n\t \t \t\t \t\t \t\t \t\t\t\t \t\t \t" ]

[ "def Min(m, s):\r\n if s == 0:\r\n return 0 if m == 1 else -1\r\n a = [0] * m\r\n a[-1] = s - 1\r\n i = len(a) - 1\r\n while a[i] > 9:\r\n if i <= 0:\r\n return -1\r\n a[i - 1], a[i] = a[i] - 9, 9\r\n i -= 1\r\n a[0] += 1\r\n if a[0] > 9:\r\n return -1\r\n return \"\".join(str(d) for d in a)\r\n\r\n\r\ndef Max(m, s):\r\n if s == 0:\r\n return 0 if m == 1 else -1\r\n a = [0] * m\r\n a[0] = s\r\n i = 0\r\n while a[i] > 9:\r\n if i >= len(a) - 1:\r\n return -1\r\n a[i], a[i + 1] = 9, a[i] - 9\r\n i += 1\r\n return \"\".join(str(d) for d in a)\r\n\r\n\r\nm, s = map(int, input().split())\r\nprint(Min(m, s), Max(m, s))\r\n\r\n", "n,m = tuple(map(int,input().split()))\r\ns = [1] + [0]*(n-1)\r\nl = [9]*(n)\r\nss = 1\r\nls = 9*n\r\nif(n == 1 and m <= 9):\r\n print(m,m)\r\nelif(ss > m or ls < m):\r\n print(-1,-1)\r\nelse:\r\n for i in range(n-1):\r\n if(m - ss >= 9):\r\n s[n-1-i] = 9\r\n ss += 9\r\n else:\r\n s[n-1-i] = m - ss\r\n ss = m\r\n if(ss != m and m - ss <= 8):\r\n s[0] += m - ss\r\n for i in range(n-1):\r\n if(ls -m >= 9):\r\n l[n-1-i] = 0\r\n ls -=9\r\n else:\r\n l[n-1-i] =9 - (ls - m)\r\n ls = m\r\n if(ls != m and ls - m <= 8):\r\n l[0] -= ls - m\r\n for i in range(n):\r\n print(s[i],end = '')\r\n print('',end = ' ')\r\n for i in range(n):\r\n print(l[i],end = '')\r\n print()", "m,s=map(int,input().split())\r\nif s>9*m or (s<1and m!=1):print(-1,-1)\r\nelse:print(int(10**(m-1)+((s-1)%9+1)*10**((s-1)//9)-1),10**m-10**(m-(s-1)//9-1)*(9-(s-1)%9))", "m, s = map(int, input().split())\r\nmax = []\r\nmin = []\r\nif s == 0:\r\n if m == 1:\r\n print(\"0 0\")\r\n else:\r\n print(\"-1 -1\")\r\nelse:\r\n for i in range(m):\r\n \r\n if s > 9:\r\n k = 9\r\n else:\r\n k = s\r\n max += [str(k)]\r\n s -= k\r\n # print(max)\r\n if s > 0:\r\n print(\"-1 -1\")\r\n else:\r\n for i in range(m):\r\n min += [max[m - i - 1]]\r\n j = 0\r\n if min[0] == '0':\r\n while True :\r\n j+=1\r\n if min[j] != '0':\r\n break\r\n min[j] = str(int(min[j]) - 1)\r\n min[0] = '1'\r\n a, b = \"\", \"\"\r\n \r\n for i in min:\r\n a+=i\r\n for i in max:\r\n b+=i\r\n print(f'{a} {b}')", "def clc(): \r\n m,s = map(int,input().split())\r\n if s == 0:\r\n if m == 1:\r\n print(\"0\",\"0\")\r\n else:\r\n print(\"-1\",\"-1\") \r\n else:\r\n maxi,mini = [None]*m,[None]*m\r\n tep = s\r\n for i in range(0,m):\r\n k = min(9,s)\r\n maxi[i] = str(k)\r\n s-=k\r\n if s>0:\r\n print(\"-1\",\"-1\")\r\n return \r\n s = tep\r\n \r\n for i in range(m-1,0,-1):\r\n k = min(9,s-1)\r\n mini[i] = str(k)\r\n s-=k\r\n mini[0] = str(s)\r\n print(\"\".join(mini),\"\".join(maxi))\r\n\r\n\r\nclc()", "def check(m, s):\r\n if s >= 0 and s <= 9 *m:\r\n return True\r\n else:\r\n return False\r\n\r\nalp = '9876543210'\r\nx = ''\r\ny = ''\r\n\r\nm, s = map(int, input().split())\r\n\r\nif m == 1 and s == 0:\r\n print(0, 0)\r\n exit(0)\r\n\r\nsm = s\r\nfor i in range(m):\r\n for c in alp:\r\n if s >= int(c):\r\n x += c\r\n s -= int(c)\r\n break\r\ns = sm\r\nif s == 0 and m > 1:\r\n print(-1, -1)\r\nelif s > 9 * m or (s == 0 and m == 1):\r\n print(-1,-1)\r\nelse:\r\n for i in range(m):\r\n for d in range(10):\r\n if (i > 0 or d > 0 or (m == 1 and d == 0)) and check(m-i-1, s-d):\r\n y += str(d)\r\n s -= d\r\n break\r\n\r\n print(y, x)", "from io import StringIO\r\n\r\n\r\ndef main():\r\n m, s = [int(i) for i in input().split()]\r\n if s > 9 * m or (s == 0 and m > 1):\r\n print(-1, -1)\r\n return\r\n\r\n if s == 0 and m == 1:\r\n print(0, 0)\r\n return\r\n\r\n mx = StringIO()\r\n\r\n for i in range(m):\r\n nxt = 9 if s - 9 > 0 else s\r\n s -= nxt\r\n mx.write(str(nxt))\r\n\r\n mn = mx.getvalue()[::-1]\r\n\r\n if mn[0] == \"0\":\r\n i = 0\r\n while mn[i] == \"0\":\r\n i += 1\r\n mn = \"1\" + mn[1:i] + str(int(mn[i])-1) + mn[i+1:]\r\n\r\n print(mn, mx.getvalue())\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def main():\r\n\tm, s = map(int, input().split())\r\n\tif s == 0:\r\n\t\tif m == 1:\r\n\t\t\tprint(0, 0)\r\n\t\telse:\r\n\t\t\tprint(-1, -1)\r\n\t\texit()\r\n\tfor i in range(1,10):\r\n\t\tif 0 <= s - i <= (m-1)*9:\r\n\t\t\tk = s - i\r\n\t\t\ta = []\r\n\t\t\tfor j in range(m - 1):\r\n\t\t\t\ta.append(min(9, k))\r\n\t\t\t\tk -= min(9, k)\r\n\t\t\tprint (''.join(map(str, [i] + a[::-1])), )\r\n\t\t\tbreak\r\n\telse:\r\n\t\tprint(-1, )\r\n\tk = s\r\n\ta = []\r\n\tfor j in range(m):\r\n\t\ta.append(min(9, k))\r\n\t\tk -= min(9, k)\r\n\tif k:\r\n\t\tprint(-1)\r\n\telse:\r\n\t\tprint(''.join(map(str, a)))\r\n\r\n\t\r\n\r\n\r\nif __name__ == '__main__':\r\n\tmain()\r\n", "n,k = map(int,input().split())\r\nif (k==0 and n!=1) or k>9*n:\r\n print(-1,-1)\r\nelif k==0:\r\n print(0,0)\r\nelse:\r\n lar, sm = [], []\r\n for i in range(n):\r\n if k>=9:\r\n lar.append(9)\r\n k-=9\r\n else:\r\n lar.append(k)\r\n k=0\r\n \r\n sm = lar.copy()[::-1]\r\n if sm[0]==0:\r\n t=0\r\n while sm[t]==0: t+=1\r\n sm[0]=1; sm[t]-=1\r\n \r\n t1 = ''.join(map(str,sm))\r\n t2 = ''.join(map(str,lar))\r\n print(t1,t2)", "\r\ndef isInvalid(m, s):\r\n if s > m * 9: return True\r\n if s < 1 and m > 1: return True\r\n return False\r\n\r\nm, s = map(int, input().split())\r\n\r\nif isInvalid(m, s): \r\n print(\"-1 -1\")\r\nelse:\r\n if m == 1: print(s, s)\r\n else:\r\n mins = []\r\n cur = 0\r\n for i in range(m):\r\n for v in range(10):\r\n if i == 0 and v == 0: continue \r\n if cur + v + (m-i-1) * 9 >= s:\r\n cur += v \r\n mins.append(str(v))\r\n break \r\n \r\n maxs = []\r\n cur = 0\r\n for i in range(m):\r\n for v in range(9, -1, -1):\r\n if i == 0 and v == 0: continue \r\n if cur + v <= s:\r\n cur += v \r\n maxs.append(str(v))\r\n break\r\n \r\n mins = ''.join(mins)\r\n maxs = ''.join(maxs)\r\n\r\n print(mins, maxs)\r\n", "# -----Arkp-----#\r\nimport sys\r\nfrom math import *\r\nfrom collections import defaultdict\r\nimport sys\r\nI_map=lambda: map(int,input().split())\r\nS_map=lambda: map(str,input().split())\r\nF_map=lambda: map(float,input().split())\r\nN=lambda: int(input())\r\nS=lambda: input()\r\ndef INT_MAX():\r\n return sys.maxsize\r\ndef INT_MIN():\r\n return -sys.maxsize\r\n\r\ndef solve(m,s):\r\n res=[]\r\n if s==0:\r\n if m>1:\r\n return [-1,-1]\r\n else:\r\n return [0,0]\r\n for i in range(m):\r\n if s<=0:\r\n res.append('0')\r\n continue\r\n if (s>=9):\r\n res.append('9')\r\n s-=9\r\n else:\r\n res.append(str(s))\r\n s=0\r\n if (s>0):\r\n return [-1,-1]\r\n rev=res[::-1]\r\n \r\n if rev[0]=='0':\r\n for i in range(m):\r\n if (rev[i]!='0'):\r\n x=int(rev[i])\r\n x-=1\r\n rev[0]='1'\r\n rev[i]=str(x)\r\n break\r\n # print(res,rev)\r\n return [''.join(rev),''.join(res)]\r\n\r\n\r\n\r\nm,s=I_map()\r\nprint(*solve(m,s))\r\n\r\n\r\n\r\n\r\n\r\n \r\n ", "m, s = map(int,input().split())\r\n\r\nst = [0] * m\r\nst[0] = 1\r\ns -= 1\r\nif s < 0:\r\n if m == 1 and s < 9:\r\n print(s+1, s+1)\r\n\r\n else:\r\n print(-1, -1)\r\n\r\nelse:\r\n temp1 = s\r\n temp2 = st[:]\r\n\r\n for i in range(m-1, -1, -1):\r\n\r\n if st[i] + s <= 9:\r\n st[i] += s\r\n s = 0\r\n break\r\n else:\r\n temp = 9 - st[i]\r\n\r\n st[i] += temp\r\n\r\n s -= temp\r\n\r\n if s > 0:\r\n print (-1, -1)\r\n\r\n else:\r\n minn = int(\"\".join((map(str, st))))\r\n\r\n # print(minn)\r\n\r\n st = temp2\r\n s = temp1\r\n\r\n \r\n for i in range(m):\r\n\r\n if st[i] + s <= 9:\r\n st[i] += s\r\n s = 0\r\n break\r\n else:\r\n temp = 9 - st[i]\r\n\r\n st[i] += temp\r\n\r\n s -= temp\r\n\r\n if s > 0:\r\n print (-1, -1)\r\n\r\n else:\r\n maxx = int(\"\".join((map(str, st))))\r\n\r\n print(minn, maxx)", "m, s = map(int,input().split())\r\nif s == 0 :\r\n print(0,0) if m == 1 else print(-1,-1)\r\nelif m*9 < s :\r\n print(-1,-1)\r\nelse :\r\n s_val, mnst, mxst = s, \"\", \"\"\r\n while len(mnst) != m-1 :\r\n if s > 9 :\r\n mnst += '9'\r\n s -= 9\r\n elif s > 1 :\r\n mnst += str(s-1)\r\n s = 1\r\n else :\r\n mnst += '0'\r\n mnst += str(s)\r\n while len(mxst) != m :\r\n if s_val > 9 :\r\n mxst += '9'\r\n s_val -= 9\r\n elif s_val > 0 :\r\n mxst += str(s_val)\r\n s_val = 0\r\n else :\r\n mxst += '0'\r\n print(mnst[::-1],mxst)", "import math\r\na = input().split(\" \")\r\nn = int(a[0])\r\ns = int(a[1])\r\nif(n == 1 and s == 0):\r\n print('0 0')\r\nelif(9*n < s or s == 0):\r\n print('-1 -1')\r\nelse:\r\n a = 10**(n-1)\r\n for i in range(s-1):\r\n a += 10**(i // 9)\r\n b = 0\r\n for i in range(s):\r\n b += 10**(n - 1 - i // 9)\r\n print(int(a), int(b))", "def find_min_max(m, s):\r\n if s == 0:\r\n if m == 1:\r\n return (0, 0)\r\n else:\r\n return (-1, -1)\r\n if s > 9 * m:\r\n return (-1, -1)\r\n\r\n min_num = [0] * m\r\n min_num[0] = 1\r\n s_min = s - 1\r\n for i in range(m - 1, -1, -1):\r\n if s_min >= 9:\r\n min_num[i] = 9\r\n s_min -= 9\r\n else:\r\n min_num[i] += s_min\r\n s_min = 0\r\n\r\n max_num = [0] * m\r\n s_max = s\r\n for i in range(m):\r\n if s_max >= 9:\r\n max_num[i] = 9\r\n s_max -= 9\r\n else:\r\n max_num[i] = s_max\r\n s_max = 0\r\n\r\n return (int(''.join(map(str, min_num))), int(''.join(map(str, max_num))))\r\n\r\nm, s = map(int, input().split())\r\nmin_num, max_num = find_min_max(m, s)\r\nprint(f\"{min_num} {max_num}\")\r\n", "def find_largest(m: int, s: int) -> str:\n if (m * 9 < s):\n return \"-1\"\n \n if (s == 0):\n return \"-1\" if m > 1 else \"0\"\n \n count_9 = s // 9\n residual = s % 9 if s % 9 else 0\n count_0 = m - count_9 - int(bool(residual))\n return \"9\" * count_9 + str(residual) * int(bool(residual)) + \"0\" * count_0\n\ndef find_smallest(m: int, s: int) -> str:\n if (m * 9 < s):\n return \"-1\"\n \n if (s == 0):\n return \"-1\" if m > 1 else \"0\"\n \n count_9 = s // 9\n count_9_if_1 = (s - 1) // 9\n residual = s % 9 if s % 9 else 0\n residual_if_1 = (s - 1) % 9 if (s - 1) % 9 else 0\n count_1 = 1 * (count_9 + int(bool(residual)) != m)\n count_1_if_1 = 1 * (count_9_if_1 + int(bool(residual_if_1)) != m)\n count_0 = m - count_9 - count_1 - int(bool(residual))\n count_0_if_1 = m - count_9_if_1 - count_1_if_1 - int(bool(residual_if_1))\n\n if count_1:\n return \"1\" * count_1_if_1 + \"0\" * count_0_if_1 + str(residual_if_1) * int(bool(residual_if_1)) + \"9\" * count_9_if_1\n else:\n return \"1\" * count_1 + \"0\" * count_0 + str(residual) * int(bool(residual)) + \"9\" * count_9\n\n\ndef solve(m: int, s: int) -> None: \n print(find_smallest(m, s), find_largest(m, s))\n\nif __name__ == \"__main__\":\n m, s = list(map(int, input().split(\" \")))\n solve(m, s)\n\n\n", "m, s = map(int, input().split())\r\nif s > m * 9 or (s == 0 and m > 1):\r\n print(-1, -1)\r\nelse:\r\n biggest = []\r\n t = s\r\n for i in range(m):\r\n if t > 9:\r\n biggest.append(\"9\")\r\n t -= 9\r\n else:\r\n biggest.append(str(t))\r\n t = 0\r\n smallest = [\"1\"] + ([\"0\"] * (m-1))\r\n s -= 1\r\n for i in range(m-1, -1, -1):\r\n if s > 8:\r\n smallest[i] = \"9\"\r\n s -= 9\r\n else:\r\n smallest[i] = str(int(smallest[i]) + s)\r\n s = 0\r\n print(\"\".join(smallest), \"\".join(biggest))", "def aff(t, x, a):\r\n for i in range(1, x+1):\r\n print(t[i], end='')\r\n print(' ', end='')\r\n for i in range(1, x+1):\r\n print(a[i], end='')\r\n print('')\r\n\r\ndef main():\r\n x, y = map(int, input().split())\r\n\r\n if (x == 0 or x == 1) and y == 0:\r\n print(0, ' ', 0)\r\n return\r\n if x * 9 < y or y == 0 or x == 0:\r\n print(-1, ' ', -1)\r\n return\r\n if x > 1 and y == 1:\r\n t = [0] * (x + 1)\r\n t[1] = 1\r\n aff(t, x, t)\r\n return\r\n\r\n t = [0] * (x + 1)\r\n a = [0] * (x + 1)\r\n i = 1\r\n while y != 0:\r\n while t[i] != 9 and y != 0:\r\n t[i] += 1\r\n y -= 1\r\n if t[i] == 9:\r\n i += 1\r\n for i in range(1, x+1):\r\n a[i] = t[i]\r\n i = 1\r\n j = x\r\n k = 1\r\n while i != j:\r\n while t[i] != k and t[j] != 9:\r\n t[j] += 1\r\n t[i] -= 1\r\n if t[i] == k:\r\n i += 1\r\n k = 0\r\n else:\r\n j -= 1\r\n aff(t, x, a)\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "l,s=map(int,input().split())\r\nif l>1 and s==0:\r\n print(-1,-1)\r\nelif s>9*l:\r\n print(-1,-1)\r\nelse:\r\n min_no=\"\"\r\n max_no=\"\"\r\n temp=s\r\n for i in range(l-1):\r\n x=min(9,temp-1)\r\n min_no+=str(x)\r\n temp-=x\r\n min_no+=str(temp)\r\n temp=s\r\n for i in range(l-1):\r\n x=min(9,temp)\r\n max_no+=str(x)\r\n temp-=x\r\n max_no+=str(temp)\r\n print(min_no[::-1],max_no)", "# Define a function to find the maximum number with the given sum and number of digits\r\ndef solmx(s, m):\r\n result = [0] * m\r\n for i in range(m):\r\n if s >= 9:\r\n result[i] = 9\r\n s -= 9\r\n else:\r\n result[i] = s\r\n break\r\n return result\r\n\r\n# Define a function to find the minimum number with the given sum and number of digits\r\ndef solmn(s, m):\r\n ans = [0] * m\r\n ans[0] = 1\r\n s -= 1\r\n for i in range(m - 1, -1, -1):\r\n if s >= 9:\r\n ans[i] += 9\r\n s -= 9\r\n else:\r\n ans[i] += s\r\n break\r\n return ans\r\n\r\n# Define a function to solve the problem\r\ndef solve():\r\n m, s = map(int, input().split())\r\n \r\n # If it's impossible to create a number with the given sum and digits, print -1 -1\r\n if m * 9 < s:\r\n print(\"-1 -1\")\r\n # If the sum is 0, check if it's a valid case for a single-digit or multi-digit number\r\n elif s == 0:\r\n if m == 1:\r\n print(\"0 0\")\r\n else:\r\n print(\"-1 -1\")\r\n else:\r\n # Find the minimum and maximum numbers with the given sum and digits\r\n min_num = solmn(s, m)\r\n max_num = solmx(s, m)\r\n \r\n # Print the results as strings\r\n print(\"\".join(map(str, min_num)), \"\".join(map(str, max_num)))\r\n#uhbfiuhewrbuhsfbshfdvbushbvsdhfbvsihvbsfhvbuhsdf\r\n# Define the main function\r\ndef main():\r\n _ = 1 # Number of test cases\r\n while _ > 0:\r\n solve()\r\n _ -= 1\r\n\r\n# Check if this script is the main program\r\nif __name__ == \"__main__\":\r\n main()\r\n", "\r\nII = lambda: int(input())\r\nMII = lambda: map(int, input().split())\r\nLMII = lambda: list(MII())\r\nSLMII = lambda: sorted(LMII())\r\n\r\nm, s = MII()\r\n\r\n# m - длина числа\r\n# s - cумма цифр\r\n\r\ndp = [[0 for j in range(0,901)] for i in range(0,101)] #max\r\n\r\nfor j in range(10):\r\n dp[1][j] = str(j)\r\nfor i in range(2,101):\r\n dp[i][0] = -1\r\n for j in range(1,10):\r\n dp[i][j] = dp[i-1][j] + '0'\r\n\r\nfor i in range(1,101):\r\n for j in range(10, 901):\r\n if 9*i < j:\r\n dp[i][j] = -1\r\n else:\r\n suf = dp[i-1][j-9]\r\n if suf != -1:\r\n dp[i][j] = '9' + suf\r\n\r\nres_max = dp[m][s] \r\n\r\ndp2 = [[0 for j in range(0,901)] for i in range(0,101)] #min with zero at beg\r\n\r\nfor j in range(10):\r\n dp2[1][j] = str(j)\r\nfor i in range(2,101):\r\n dp2[i][0] = -1\r\n for j in range(1,10):\r\n dp2[i][j] = '0' + dp2[i-1][j]\r\n\r\nfor i in range(1,101):\r\n for j in range(10, 901):\r\n if 9*i < j:\r\n dp2[i][j] = -1\r\n else:\r\n for k in range(0,10):\r\n suf = dp2[i-1][j-k]\r\n if suf != -1:\r\n dp2[i][j] = str(k) + suf\r\n break\r\n else:\r\n dp2[i][j] == -1\r\n \r\nres_min = dp2[m][s]\r\n\r\n\r\nif res_min != -1 and res_min[0] == '0':\r\n res_min = list(res_min)\r\n for i in range(len(res_min)):\r\n if res_min[i] != '0':\r\n res_min[i] = str(int(res_min[i])-1)\r\n res_min[0] = '1'\r\n break\r\n res_min = ''.join(res_min)\r\n\r\n\r\nprint(res_min, res_max)\r\n \r\n \r\n \r\n", "m, s = map(int, input().split())\r\nmaxx = \"\"\r\nsx = s\r\nminn = \"\"\r\nsn = s\r\nif s == 0 and m > 1:\r\n print(-1, -1)\r\nelse:\r\n for i in range(m):\r\n maxx += str(min(sx, 9))\r\n sx -= min(sx, 9)\r\n if sx > 0:\r\n print(-1, -1)\r\n else:\r\n sn -= 1\r\n for i in range(m):\r\n if i == m - 1:\r\n if sn < 9:\r\n minn += str(1 + sn)\r\n sn = 0\r\n else:\r\n minn += str(min(sn, 9))\r\n sn -= min(sn, 9)\r\n if sn > 0:\r\n print(-1, maxx)\r\n else:\r\n print(minn[len(minn)::-1], maxx)", "m, s = map(int, input().split())\r\n\r\nif s == 0:\r\n if m == 1:\r\n print(\"0 0\")\r\n else:\r\n print(\"-1 -1\")\r\nelse:\r\n min_num = [0] * m\r\n max_num = [0] * m\r\n\r\n remaining_sum = s\r\n for i in range(m):\r\n if remaining_sum >= 9:\r\n max_num[i] = 9\r\n remaining_sum -= 9\r\n else:\r\n max_num[i] = remaining_sum\r\n remaining_sum = 0\r\n\r\n if remaining_sum > 0:\r\n print(\"-1 -1\")\r\n else:\r\n remaining_sum = s - 1\r\n min_num[0] = 1\r\n for i in range(m - 1, -1, -1):\r\n if remaining_sum >= 9:\r\n min_num[i] = 9\r\n remaining_sum -= 9\r\n else:\r\n min_num[i] += remaining_sum\r\n remaining_sum = 0\r\n\r\n print(''.join(map(str, min_num)), ''.join(map(str, max_num)))\r\n", "def minimum(n: int, s: int):\r\n if s > n * 9 or (s == 0 and n > 1):\r\n return -1\r\n if s == 0:\r\n return '0'\r\n if s - 1 < (n - 1) * 9:\r\n res = '1'\r\n i = 2\r\n while (n - i) * 9 >= (s - 1):\r\n res += '0'\r\n i += 1\r\n S = s - 1\r\n tmp = ''\r\n while S > 9:\r\n tmp += str(9)\r\n S -= 9\r\n if S != 0:\r\n tmp += str(S)\r\n return res + tmp[::-1]\r\n res = ''\r\n while s > 9:\r\n res += '9'\r\n s -= 9\r\n if s != 0:\r\n res += str(s)\r\n return res[::-1]\r\n\r\ndef maximum(n: int, s: int):\r\n if s > n * 9 or (s == 0 and n > 1):\r\n return -1\r\n if s == 0:\r\n return '0'\r\n l = ['0' for _ in range(n)]\r\n i = 0\r\n while s > 9:\r\n l[i] = '9'\r\n i += 1\r\n s -= 9\r\n l[i] = s\r\n res = ''\r\n for i in l:\r\n res += str(i)\r\n return res\r\nn = [int(i) for i in input().split()]\r\nmi = minimum(n[0], n[1])\r\nma = maximum(n[0], n[1])\r\nprint(mi, ma)", "def sol():\r\n a,b=map(int,input().split())\r\n b1=b\r\n b2=b\r\n l=[]\r\n r=[]\r\n\r\n if b>a*9:\r\n print(-1,-1)\r\n\r\n elif a==1 :\r\n print(b,b)\r\n elif b==0 and a>1:\r\n print(-1,-1)\r\n\r\n else:\r\n for i in range(a):\r\n if i!=a-1:\r\n if b1>9:\r\n l.append(9)\r\n b1-=9\r\n elif b1>1:\r\n l.append(b1-1)\r\n b1=1\r\n elif b1==1:\r\n l.append(0)\r\n\r\n if i==a-1:\r\n l.append(b1)\r\n l=l[::-1]\r\n for i in range(a):\r\n if b2>9:\r\n r.append(9)\r\n b2-=9\r\n else:\r\n r.append(b2)\r\n b2=0\r\n sl=\"\"\r\n sr=\"\"\r\n for i in range(a):\r\n sl+=str(l[i])\r\n sr+=str(r[i])\r\n print(int(sl),int(sr))\r\n \r\n\r\n \r\n\r\n\r\n \r\nsol()\r\n", "y,u=map(int,input().split())\r\nif u>y*9:\r\n print(-1,-1)\r\n exit()\r\nelif y>1 and u==0:\r\n print(-1,-1)\r\n exit()\r\nif y>1:\r\n g=[0 for a in range(y-1)]+[1]\r\n c=u\r\n u-=1\r\n for i in range(y+1):\r\n if u>9:\r\n g[i]=9\r\n else:\r\n g[i]+=u\r\n break\r\n u-=9\r\n f=[0 for aa in range(y)]\r\n for i in range(y):\r\n if c>9:\r\n f[i]=9\r\n else:\r\n f[i]=c\r\n break\r\n c-=9\r\n print(''.join(([str(d) for d in g[::-1]])),''.join(([str(d) for d in f])))\r\n\r\nelse:\r\n print(u,u)", "inpu = input().split()\n\nnbrLenght = int(inpu[0])\nsumOfpairs = int(inpu[1])\n\n\n\n# we are calculating the max sum of the pair and the min and the sumOfparis that was taken as parameter should be in this interval\nif nbrLenght == 1:\n if not (sumOfpairs >= 0 and sumOfpairs <= 9):\n print(\"-1 -1\")\n exit(0)\nelif (not (sumOfpairs >= 1 and sumOfpairs <= 9 * nbrLenght)):\n print(\"-1 -1\")\n exit(0)\n\n# stor it in tmp to use it whene calculating the min\ntmp = sumOfpairs\n\ni = 0\nwhile nbrLenght > i:\n minDegit = 0\n if i == 0 and nbrLenght != 1:\n minDegit = 1\n while 1:\n if (sumOfpairs - minDegit) <= 9 * (nbrLenght - i - 1) and (sumOfpairs - minDegit) >= 0:\n print(minDegit, end=\"\")\n sumOfpairs -= minDegit\n break\n minDegit += 1\n i += 1\n\nprint(\" \", end=\"\")\ni = 0\nwhile nbrLenght > i:\n maxDegit = min(9, tmp)\n while 1:\n if tmp - maxDegit >= 0:\n print(maxDegit, end=\"\")\n tmp -= maxDegit\n break\n maxDegit -= 1\n i += 1\n", "n, s = map(int, input().split())\r\n\r\nif (n*9 < s or s==0):\r\n if (n == 1 and s==0):\r\n print(0, 0)\r\n else:\r\n print(\"-1 -1\")\r\nelse:\r\n small = [0]*n\r\n allowed = s-1\r\n i = n-1\r\n while allowed > 0 and i > 0:\r\n small[i] = min(allowed, 9)\r\n allowed -= min(9, allowed)\r\n i -= 1\r\n small[0] = allowed + 1\r\n\r\n print(*small, sep=\"\", end=\" \")\r\n\r\n large = [0]*n\r\n allowed = s\r\n i = 0\r\n while allowed > 0:\r\n large[i] = min(allowed, 9)\r\n allowed -= min(9, allowed)\r\n i += 1\r\n\r\n print(*large, sep=\"\")\r\n", "ints = lambda: map(int, input().split())\r\nre_s = lambda x, y, z: x[:y] + z + x[y + 1:]\r\n\r\na, b = ints()\r\n\r\nif (a == 0 and b == 0) or (a == 1 and b == 0):\r\n print(\"0 0\")\r\nelif a == 0 or b == 0:\r\n print(\"-1 -1\")\r\nelif b == 1:\r\n print('1' + '0' * (a - 1) + ' ' + '1' + '0' * (a - 1))\r\nelif 1 <= b <= int('9' * a) and 9 * a >= b:\r\n d = '1' + '0' * (a - 1)\r\n c = b\r\n for i in range(len(d)):\r\n if b > 8:\r\n d = re_s(d, i, '9')\r\n b -= 9\r\n elif b > 0:\r\n d = re_s(d, i, str(b))\r\n b = 0\r\n\r\n e = ''.join(sorted(d))\r\n if e[0] == '0':\r\n for i in range(len(d)):\r\n if e[i] != '0':\r\n e = re_s(e, 0, '1')\r\n e = re_s(e, i, str(int(e[i]) - 1))\r\n break\r\n print(e + ' ' + d)\r\nelse:\r\n print(\"-1 -1\")\r\n", "m,s=map(int,input().split())\r\nresult1,result2=\"\",\"\"\r\nif s>m*9:\r\n print(-1,-1)\r\nelif m==1 and s==0:\r\n print(0,0)\r\nelif s==0 and m!=1:\r\n print(-1,-1)\r\nelse:\r\n for i in range(m):\r\n k=min(s,9)\r\n result1+=str(k)\r\n s-=k\r\n for i in range(m-1,-1,-1):\r\n result2+=result1[i]\r\n i=0\r\n while result2[i]==\"0\":\r\n i+=1\r\n result2=result2[:i]+str(int(result2[i])-1)+result2[i+1:]\r\n result2=result2[:0]+str(int(result2[0])+1)+result2[1:]\r\n print(result2,result1)\r\n \r\n \r\n \r\n\r\n", "m,s=map(int,str(input()).split(\" \"))\r\nif (s==0 and m>1)or(s>m*9):print(\"-1 -1\")\r\nelif m==1:print(s, s)\r\nelse:\r\n if s>(m-1)*9:\r\n mi=str(s-(m-1)*9)+\"9\"*(m-1)\r\n else:\r\n nines=(s-1)//9 #ex:18 -> 1\r\n mi=\"1\"+\"0\"*(m-nines-2)+str(s-9*nines-1)+\"9\"*nines\r\n nines=s//9\r\n mx=nines*\"9\"+(\"\" if nines==m else str(s-9*nines))+\"0\"*(m-nines-1)\r\n print(mi, mx)", "l,s=map(int,input().split())\r\nif l>1 and s==0:\r\n print(-1,-1)\r\n exit()\r\nelif s>9*l:\r\n print(-1,-1)\r\n exit()\r\n\r\nmin_no=\"\"\r\nmax_no=\"\"\r\ntemp=s\r\nfor i in range(l-1):\r\n x=min(9,temp-1)\r\n min_no+=str(x)\r\n temp-=x\r\nmin_no+=str(temp)\r\ntemp=s\r\nfor i in range(l-1):\r\n x=min(9,temp)\r\n max_no+=str(x)\r\n temp-=x\r\nmax_no+=str(temp)\r\nprint(min_no[::-1],max_no)", "s = input()\narray = s.split(' ')\n\nlength,value = int(array[0]),int(array[1])\n\nif value == 0 and length == 0:\n print('0 0')\nelse:\n avg = value/length\n\n if (avg == 0 and length>1) or avg>9:\n print('-1 -1')\n else:\n res_min_array = [0]*length\n res_max_array = [0]*length\n\n leftValue = value-1\n\n res_min_array[0] = 1\n\n for i in range(length-1,-1,-1):\n d = min(leftValue,9)\n res_min_array[i] += d\n leftValue -= d\n if leftValue==0:\n break\n\n leftValue = value\n for i in range(length):\n d = min(leftValue,9)\n res_max_array[i] += d\n leftValue -= d\n if leftValue==0:\n break\n res_min = ''\n res_max = ''\n for i in range(length):\n res_min += str(res_min_array[i])\n res_max += str(res_max_array[i])\n \n print(res_min,res_max)\n \n\n\n", "def f():\n m, s = map(int , [_ for _ in input().split()])\n if m == 1 and s == 0:\n return [0, 0]\n elif s > m*9 or s == 0:\n return [-1, -1]\n else:\n return [10**(m-1) + sum([10**(i//9) for i in range(s-1)]), sum([10**(m-1-i//9) for i in range(s)])]\n\nif __name__ == \"__main__\":\n print(*f())", "from sys import stdin\r\n\r\n\r\ndef can(m, s):\r\n return s >= 0 and s <= m * 9\r\n\r\n\r\ndef solve(m, s0):\r\n if s0 == 0 and m > 1 or s0 > m * 9:\r\n print(-1, -1)\r\n return\r\n\r\n mn = []\r\n s = s0\r\n\r\n for i in range(m):\r\n for d in range(10):\r\n if (i > 0 or d > 0 or m == 1 and d == 0) and can(m - i - 1, s - d):\r\n mn.append(str(d))\r\n s -= d\r\n break\r\n\r\n mx = []\r\n s = s0\r\n\r\n for i in range(m):\r\n for d in range(9, -1, -1):\r\n if (i > 0 or d > 0 or m == 1 and d == 0) and can(m - i - 1, s - d):\r\n mx.append(str(d))\r\n s -= d\r\n break\r\n\r\n print(\"\".join(mn), \"\".join(mx))\r\n\r\n\r\nm, s = map(int, stdin.readline().split())\r\nsolve(m, s)\r\n", "m, s = tuple(map(int, input().split()))\r\n\r\nif s == 0 and m == 1:\r\n print(\"0 0\")\r\nelif s != 0 and (9 * m) >= s:\r\n s_max = s\r\n maximum = 0\r\n for i in range(m):\r\n greatest = min(9, s_max)\r\n s_max = s_max - greatest\r\n maximum = maximum*10 + greatest\r\n \r\n minimum = 0\r\n position = 1\r\n for i in range(m):\r\n greatest = min(9, s)\r\n if greatest == s and i != m - 1:\r\n greatest -= 1\r\n s = s - greatest\r\n minimum += greatest * position\r\n position *= 10\r\n print(minimum, maximum)\r\nelse:\r\n print(\"-1 -1\")", "'''\r\nMrLantern21\r\n07.02.2023\r\nThis is problem 489C.\r\n\r\n'''\r\n\r\n#n=input().split()\r\n#m,s=int(n[0]),int(n[1])\r\n#k=0\r\n#o=0\r\n#if (s<1 and m!=1) or s>10**m-1:\r\n# print(\"-1 -1\")\r\n#else:\r\n# for i in range(1,m+1):\r\n# if s>=9:\r\n# k+=9*(10**(m-i))\r\n# s-=9\r\n# else:\r\n# k+=s*(10**(m-i))\r\n# s=0\r\n# s=int(n[1])\r\n# for i in range(m):\r\n# if s>=9:\r\n# o+=9*(10**i)\r\n# s-=9\r\n# else:\r\n# o+=10**(m-1)+(s-1)*(10**i)\r\n# break\r\n# print(o,k)\r\n\r\n\r\n\r\nm,s = map(int,input().split())\r\nss = s\r\nans = 0\r\nf = 0\r\nif m==1 and s==0:\r\n print(0,0)\r\nelse:\r\n for i in range(1,m+1):\r\n if i==1:\r\n if (s-1)>=0 and (s-1)<=9*(m-1):\r\n ans*=10\r\n ans+=1\r\n s-=1\r\n else:\r\n f = 1\r\n break\r\n else:\r\n if (9*(m-i))>=s:\r\n ans*=10\r\n else:\r\n f = 1\r\n break\r\n if f==1:\r\n r = m+1-i\r\n ans*=10\r\n if s%9==0:\r\n ans+=9\r\n s-=9\r\n else:\r\n ans+=(s%9)\r\n s-=(s%9)\r\n r-=1\r\n for i in range(r):\r\n ans*=10\r\n ans+=9\r\n s-=9\r\n \r\n if s!=0:\r\n print(-1,-1)\r\n else:\r\n print(ans,end=\" \")\r\n #print(\"hello\")\r\n temp = 0\r\n t = ss//9\r\n #print(t)\r\n for i in range(t):\r\n temp*=10\r\n temp+=9\r\n if ss%9==0:\r\n temp*=(10**(m-t))\r\n else:\r\n temp*=10\r\n temp+=(ss%9)\r\n temp*=(10**(m-t-1))\r\n print(temp)\r\n else:\r\n print(ans,end=\" \")\r\n if ans%10==0:\r\n print(ans)\r\n else:\r\n temp = 0\r\n t = ss//9\r\n for i in range(t):\r\n temp*=10\r\n temp+=9\r\n if ss%9==0:\r\n temp*=(10**(m-t))\r\n else:\r\n temp*=10\r\n temp+=(ss%9)\r\n temp*=(10**(m-t-1))\r\n print(temp)", "M,N = map(int,input().split())\r\nif M==1 and N==0:\r\n print(\"0 0\")\r\nelif 9*M<N or N==0:\r\n print(\"-1 -1\")\r\nelse:\r\n A = 10**(M-1)\r\n for j in range(N-1):\r\n A+=10**(j//9)\r\n B = 0\r\n print()\r\n for u in range(N):\r\n B+= 10**(M-1-u//9)\r\n print(A,B)", "m, s = map(int, input().split())\r\nif s > 9*m or (s < 1 and m != 1):\r\n print(-1, -1)\r\nelse:\r\n print(int(10**(m-1)+((s-1) % 9+1)*10**((s-1)//9)-1),\r\n 10**m-10**(m-(s-1)//9-1)*(9-(s-1) % 9))\r\n", "m,s=map(int,input().split())\r\nif s>9*m or(s<1 and m!=1):\r\n print(-1,-1)\r\nelse:\r\n Min=int(10**(m-1)+((s-1)%9+1)*10**((s-1)//9)-1)\r\n Max=10**m-10**(m-(s-1)//9-1)*(9-(s-1)%9)\r\n print(Min,Max)\r\n", "def smallest(length , sums) :\r\n ans = [0] * length\r\n ans[0] = 1\r\n sums -= 1\r\n \r\n index = length - 1\r\n while index > 0 and sums > 0 :\r\n if sums > 9 : \r\n ans[index] = 9\r\n sums -= 9\r\n else :\r\n ans[index] = sums\r\n sums = 0\r\n index -= 1\r\n ans[0] += sums\r\n return ans\r\n\r\ndef largest(lenght , sums) :\r\n ans = [0] * length\r\n index = 0\r\n while index < lenght and sums > 0 :\r\n if sums > 9 : \r\n ans[index] = 9\r\n sums -= 9\r\n else :\r\n ans[index] = sums\r\n sums = 0\r\n index += 1\r\n \r\n return ans\r\n\r\nlength , sums = map(int,input().split())\r\n\r\nif length == 1 :\r\n if sums >= 10 : print(-1 , -1)\r\n else : print(sums , sums)\r\nelif length * 9 < sums or (length > 1 and sums == 0) : print(-1 , -1)\r\n\r\nelse :\r\n small = smallest(length , sums)\r\n large = largest(length , sums)\r\n print(\"\".join(map(str,small)) , \"\".join(map(str,large)))", "# author: birsnot - Nardos Wehabe\r\n\r\nfrom sys import stdin\r\ninput=stdin.readline\r\ndef I(): return int(input())\r\ndef II(): return map(int, input().split())\r\ndef IL(): return list(map(int, input().split()))\r\ndef SIL(): return sorted(map(int, input().split()))\r\n\r\n\r\ndef solve():\r\n L, N = II()\r\n if N == 0 and L == 1:\r\n print(0, 0)\r\n return\r\n min_ = [0]*L\r\n min_[0] = 1\r\n n = N - 1\r\n if n < 0:\r\n print(-1, -1)\r\n return\r\n i = L - 1\r\n while i > 0 and n > 0:\r\n min_[i] = min(n, 9)\r\n i -= 1\r\n n -= 9\r\n if n > 8:\r\n print(-1, -1)\r\n return\r\n min_[0] += max(0, n)\r\n n = N\r\n max_ = [0]*L\r\n i = 0\r\n while i < L and n > 0:\r\n max_[i] = min(9, n)\r\n i += 1\r\n n -= 9\r\n print(*min_, sep=\"\", end=\" \")\r\n print(*max_, sep=\"\")\r\n\r\n\r\nT = 1\r\nfor ___ in range(T):\r\n solve()\r\n", "m,s=[int(i) for i in input().split()]\r\nif (s==0 and m!=1) or s>9*m:\r\n print(-1,-1)\r\nelse:\r\n a=(10**((s-1)//9)*((s-1)%9+1))-1+10**(m-1)\r\n b=(10**m)-(10**(m-(s-1)//9-1))*(10-(s-(s-1)//9*9))\r\n print(int(a),b)\r\n", "def minimal_digit(a):\r\n rest = 0\r\n if a%9 > 0:\r\n rest = 1\r\n return a//9 + rest\r\n\r\ndef find_number(digit, num_sum):\r\n if digit == 0:\r\n if num_sum == 0:\r\n return \"0 0\"\r\n else:\r\n return \"-1 -1\"\r\n if digit == 1:\r\n if num_sum < 10:\r\n return str(num_sum) + \" \" + str(num_sum)\r\n else:\r\n return \"-1 -1\"\r\n if digit * 9 < num_sum or num_sum == 0:\r\n return \"-1 -1\"\r\n # find max\r\n max_number =[]\r\n ver_sum = num_sum\r\n max_sum = 0\r\n for i in range(digit):\r\n if ver_sum >= 9:\r\n max_number.append(9)\r\n max_sum += 9\r\n ver_sum -= 9\r\n else:\r\n max_number.append(ver_sum)\r\n max_sum += ver_sum\r\n ver_sum = 0\r\n min_number = []\r\n min_digit = minimal_digit(num_sum)\r\n first = True\r\n while digit > min_digit:\r\n if first == True:\r\n min_number.append(1)\r\n first = False\r\n num_sum -= 1\r\n else:\r\n min_number.append(0)\r\n digit -=1\r\n min_digit = minimal_digit(num_sum)\r\n if num_sum%9 == 0:\r\n for i in range(num_sum//9):\r\n min_number.append(9)\r\n else:\r\n min_number.append(num_sum%9)\r\n for i in range(num_sum//9):\r\n min_number.append(9) \r\n max_number_str = \"\"\r\n min_number_str = \"\"\r\n for i in max_number:\r\n max_number_str = max_number_str + str(i)\r\n for i in min_number:\r\n min_number_str = min_number_str + str(i)\r\n erg = min_number_str + \" \" + max_number_str\r\n return erg\r\n\r\neingabe = list(map(int,input().split(\" \")))\r\n\r\nprint(find_number(eingabe[0],eingabe[1])) ", "m, s = map(int, input().split())\r\nif s == 0:\r\n print(\"0 0\" if m == 1 else \"-1 -1\")\r\n exit()\r\nif s > 9 * m:\r\n print(\"-1 -1\")\r\n exit()\r\nmax_num = [min(9, s)] + [0] * (m - 1)\r\ns -= max_num[0]\r\nfor i in range(1, m):\r\n max_num[i] = min(9, s)\r\n s -= max_num[i]\r\nmin_num = max_num[::-1]\r\nif min_num[0] == 0:\r\n for i in range(1, m):\r\n if min_num[i] != 0:\r\n min_num[i] -= 1\r\n min_num[0] = 1\r\n break\r\nprint(''.join(map(str, min_num)), ''.join(map(str, max_num)))", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef main() -> None :\r\n M, S = list(map(int, input().split()))\r\n\r\n minNum, maxNum = -1, -1\r\n if (M==1 and S==0) : minNum, maxNum = 0, 0\r\n elif not ((M>=2 and S==0) or (9*M<S)) :\r\n possibleDigits:list[int] = []\r\n currentS:int = S\r\n while currentS>0 :\r\n POSSIBLE_DIGIT:int = min(currentS, 9)\r\n currentS -= POSSIBLE_DIGIT\r\n possibleDigits.append(POSSIBLE_DIGIT)\r\n while len(possibleDigits) != M :\r\n possibleDigits.append(0)\r\n\r\n maxNum = num(possibleDigits)\r\n if possibleDigits[-1] == 0 :\r\n for index in range(len(possibleDigits)-1, 0-1, -1) :\r\n if possibleDigits[index] != 0 :\r\n possibleDigits[index] -= 1\r\n break\r\n possibleDigits[-1] += 1\r\n minNum = num(possibleDigits[::-1])\r\n\r\n print(minNum, maxNum)\r\n\r\ndef num(digits:list[int]) -> int :\r\n return int(\"\".join(map(str, digits)))\r\n\r\nmain()", "import sys\r\nn,s=map(int,input().split(' '))\r\nif(n==1 and s==0):\r\n print(0,0)\r\n sys.exit()\r\na = [0]*n\r\na[0]=1\r\nss=1\r\nfor i in range(n-1,-1,-1):\r\n while(a[i]<9 and ss<s):\r\n ss+=1\r\n a[i]+=1\r\nif(ss!=s):\r\n print(-1, -1)\r\n sys.exit()\r\n\r\nb = [0]*n\r\nss=0\r\nfor i in range(n):\r\n while(b[i]<9 and ss<s):\r\n ss+=1\r\n b[i]+=1\r\n\r\nprint(''.join(list(map(str, a))), ''.join(list(map(str, b))))", "m, s = map(int, input().split())\r\n \r\nif s == 0:\r\n if m == 1:\r\n print(0, 0)\r\n else:\r\n print(-1, -1)\r\nelse:\r\n num = 9\r\n ans = []\r\n while len(ans) < m and num < s:\r\n ans.append(str(9))\r\n num += 9\r\n # print(num)\r\n ans.append(str(s - (num - 9)))\r\n while len(ans) < m:\r\n ans.append('0')\r\n \r\n sum_ = 0\r\n for digit in ans:\r\n sum_ += int(digit)\r\n \r\n if sum_ < s:\r\n print(-1, -1)\r\n \r\n \r\n minnum = ans[::-1]\r\n \r\n if len(str(int(''.join(minnum)))) == len(ans):\r\n if len(minnum) > m:\r\n print(-1, end=' ')\r\n else:\r\n print( int(''.join(minnum)) , end=' ')\r\n \r\n else:\r\n # search for the first non zero\r\n i = 0\r\n while i < len(minnum) and minnum[i] == '0':\r\n i += 1\r\n # print(\"index\", i)\r\n minnum[0] = \"1\"\r\n if i < len(minnum):\r\n minnum[i] = str(int(minnum[i]) - 1)\r\n if len(minnum) > m:\r\n print(-1, end= ' ')\r\n else:\r\n print(int(''.join(minnum)), end=' ')\r\n \r\n maxnum = (int(''.join(ans)))\r\n if len(str(maxnum)) > m:\r\n print(-1)\r\n else:\r\n print(maxnum)\r\n \r\n ", "# https://codeforces.com/contest/489/problem/C\r\n\r\nm, s = map(int, input().split())\r\n\r\nif s == 0:\r\n if m == 1:\r\n print(0, 0)\r\n else:\r\n print(-1, -1)\r\nelif s > 9 * m:\r\n print(-1, -1)\r\nelse:\r\n n1 = [0] * m\r\n n1[0] = 1\r\n restant = s - 1\r\n for i in range(m - 1, -1, -1):\r\n nouveau = min(9, n1[i] + restant)\r\n restant -= nouveau - n1[i]\r\n n1[i] = nouveau\r\n n1 = int(''.join(map(str, n1)))\r\n\r\n n2 = [0] * m\r\n n2[0] = 1\r\n restant = s - 1\r\n for i in range(m):\r\n nouveau = min(9, n2[i] + restant)\r\n restant -= nouveau - n2[i]\r\n n2[i] = nouveau\r\n n2 = int(''.join(map(str, n2)))\r\n\r\n print(n1, n2)\r\n", "m, s = map(int, input().split())\r\n\r\nif s > 9 * m or (s == 0 and m > 1):\r\n print(-1, -1)\r\n exit()\r\n\r\nlargest = '9' * (s//9)\r\nif len(largest) < m:\r\n largest += str(s - 9 * (s // 9))\r\n largest += '0' * (m - len(largest))\r\n\r\nsmallest = \"\"\r\n\r\nif m == 1:\r\n smallest = s\r\nelif m > 1:\r\n nine = (s - 1) // 9\r\n if m - nine == 1:\r\n smallest = str(s - nine * 9) + '9' * nine\r\n else:\r\n k = len('1' + str(s - 1 - nine * 9) + '9' * nine)\r\n smallest = '1' + '0' * (m - k) + str(s - 1 - nine * 9) + '9' * nine\r\n\r\nlargest = int(largest)\r\nsmallest = int(smallest)\r\n\r\nprint(smallest, largest)", "def solve(n,k):\r\n res=[]\r\n t=k\r\n if(k==0):\r\n if(n==1):return [0,0]\r\n else:return [-1,-1]\r\n else:\r\n if(9*n<k):return [-1,-1]\r\n elif(9*n==k):return [\"9\"*n,\"9\"*n]\r\n #For Smallest\r\n list1=[0 for i in range(n)]\r\n list1[-1]=1\r\n t-=1\r\n for i in range(n):\r\n if(i==n-1):\r\n list1[i]+=t\r\n elif(t>=9):\r\n list1[i]=9\r\n t-=9\r\n else:\r\n list1[i]=t\r\n break\r\n res.append(\"\".join(list(map(str,list1[::-1]))))\r\n #For Greatest\r\n list1=[0 for i in range(n)]\r\n list1[0]=(9 if(k>=9) else k)\r\n k-=list1[0]\r\n for i in range(1,n):\r\n if(k>=9):\r\n list1[i]=9\r\n k-=9\r\n else:\r\n list1[i]=k\r\n break\r\n res.append(\"\".join(list(map(str,list1))))\r\n return res\r\nn,k=map(int,input().split())\r\nprint(*solve(n,k))\r\n ", "import sys, io, os\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport string\r\nfrom collections import defaultdict,Counter,deque\r\ninput = sys.stdin.readline\r\n \r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n\r\ndef WSNOPRINT(out):\r\n return ''.join(map(str, out))\r\n\r\n'''\r\n'''\r\ndef solve():\r\n d, s = MII()\r\n if d > 1 and s == 0:\r\n print(-1, -1)\r\n return\r\n if s > d*9:\r\n print(-1, -1)\r\n return\r\n\r\n mx = []\r\n mn = []\r\n\r\n t = s\r\n while t:\r\n if t >= 9:\r\n mx.append(9)\r\n t -= 9\r\n else:\r\n mx.append(t)\r\n t = 0\r\n \r\n while len(mx) < d:\r\n mx.append(0)\r\n\r\n mn = mx[::-1]\r\n # Leading Zero?\r\n if mn[0] == 0 and len(mn) > 1:\r\n for i in range(1, len(mn)):\r\n if mn[i] != 0:\r\n mn[i] -= 1\r\n break\r\n mn[0] = 1\r\n\r\n print(''.join(map(str, mn)), ''.join(map(str, mx)))\r\n\r\nsolve()", "import sys\r\ninput = lambda: sys.stdin.readline().strip()\r\ndef solve():\r\n m, s = map(int, input().split())\r\n if m > 1 and s == 0 or s > 9 * m :\r\n return print('-1 -1')\r\n mn, mx = [0]*m, [0]*m\r\n cur = s\r\n for i in range(m-1, -1, -1):\r\n if i == 0:\r\n mn[i] = cur\r\n break\r\n if cur > 9:\r\n mn[i] = 9\r\n cur -= 9\r\n elif cur > 1:\r\n mn[i] = cur-1\r\n cur = 1\r\n\r\n cur = s\r\n for i in range(m):\r\n if cur > 9:\r\n mx[i] = 9\r\n cur -= 9\r\n else:\r\n mx[i] = cur\r\n break\r\n print(*mn, sep='', end=' ')\r\n print(*mx, sep='')\r\nsolve()", "def length_and_sum():\r\n # Read the length and the sum of digits\r\n m, s = map(int, input().split())\r\n\r\n # If the sum of digits is 0, there can only be one number, 0. \r\n # But if the length of the number is more than 1, it is not possible to create such a number.\r\n if s == 0:\r\n print(-1 if m > 1 else 0, -1 if m > 1 else 0)\r\n return\r\n\r\n # If the sum of digits is more than the maximum possible sum for the given length, it is not possible to create such a number.\r\n if s > 9 * m:\r\n print(-1, -1)\r\n return\r\n\r\n # Array to store digits of the smallest and the largest number\r\n min_number = [0] * m\r\n max_number = [0] * m\r\n\r\n # Distribute the sum over the digits, from right to left\r\n for i in range(m):\r\n # Allocate as much as possible to the current digit, but not more than 9\r\n v = min(s, 9)\r\n min_number[m - i - 1] = v\r\n max_number[i] = v\r\n s -= v\r\n\r\n # If the smallest number has a leading zero, adjust it\r\n if min_number[0] == 0:\r\n min_number[0] = 1\r\n for i in range(1, m):\r\n if min_number[i] != 0:\r\n min_number[i] -= 1\r\n break\r\n\r\n # Print the smallest and the largest number\r\n print(''.join(map(str, min_number)), ''.join(map(str, max_number)))\r\n\r\nlength_and_sum()\r\n", "m,s = list(map(int,input().split()))\r\nsum=s\r\nif m==1 and s==0:\r\n print(0,0)\r\n exit(0)\r\nif m*9<s or s==0:\r\n print(-1,-1)\r\n exit(0)\r\ncnt1=s\r\ncnt2=s\r\nans1=\"\"\r\nans2=\"\"\r\nfor i in range(m):\r\n if cnt2>=9:\r\n ans2+=\"9\"\r\n cnt2-=9\r\n else:\r\n ans2+=str(cnt2)\r\n cnt2=0\r\nfor i in range(m-1,0,-1):\r\n if cnt1>9:\r\n ans1+=\"9\"\r\n cnt1-=9\r\n else:\r\n ans1+=str(cnt1-1)\r\n cnt1=1\r\nans1+=str(max(1,cnt1))\r\nprint(ans1[::-1],ans2)", "# https://codeforces.com/problemset/problem/489/C\r\nm, s = list(map(int, input().split()))\r\nif (m == 1 and not (0 <= s <= 9)) or m > 1 and not (1 <= s <= 9 * m):\r\n print(-1, - 1)\r\nelse:\r\n count = s\r\n digit = m - 1\r\n biggest = 0\r\n while digit >= 0:\r\n biggest = biggest + 9 * 10 ** digit if count >= 9 else biggest + count * 10 ** digit\r\n count = max(0, count - 9)\r\n digit -= 1\r\n count = s - 1\r\n digit = 0\r\n smallest = 1 * 10 ** (m - 1)\r\n while digit < m:\r\n smallest = smallest + 9 * 10 ** digit if count >= 9 else smallest + count * 10 ** digit\r\n count = max(0, count - 9)\r\n digit += 1\r\n print(smallest, biggest)\r\n", "def main():\r\n m, s = map(int, input().split())\r\n a, b = \"\", \"\"\r\n\r\n if s == 0:\r\n print(\"0 0\" if m == 1 else \"-1 -1\")\r\n return\r\n\r\n for i in range(m):\r\n t = min(s, 9)\r\n b += str(t)\r\n s -= t\r\n\r\n if s > 0:\r\n print(\"-1 -1\")\r\n return\r\n\r\n for i in range(m - 1, -1, -1):\r\n a += b[i]\r\n\r\n i = 0\r\n while a[i] == '0':\r\n i += 1\r\n\r\n a = a[:i] + str(int(a[i]) - 1) + a[i + 1:]\r\n a = a[:0] + str(int(a[0]) + 1) + a[1:]\r\n print(a, b)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "\r\ndef solve():\r\n if s == 0:\r\n if m == 1:\r\n print(0, 0)\r\n else:\r\n print(-1, -1)\r\n return\r\n if s > 9 * m:\r\n print(-1, -1)\r\n return\r\n s1 = s2 = s\r\n # 最大值\r\n mx = [0] * m\r\n for i in range(m):\r\n for j in range(9, -1, -1):\r\n if s2 >= j:\r\n mx[i] = j\r\n s2 -= j\r\n break\r\n mx = ''.join(map(str, mx))\r\n # 最小值\r\n mn = [0] * m\r\n if (m - 1) * 9 < s1:\r\n mn[0] = s1 - (m - 1) * 9\r\n mn = str(s1 - (m - 1) * 9) + '9' * (m - 1)\r\n else:\r\n mn[0] = 1\r\n s1 -= 1\r\n for i in range(m - 1, 0, -1):\r\n for j in range(9, -1, -1):\r\n if s1 >= j:\r\n mn[i] = j\r\n s1 -= j\r\n break\r\n mn = ''.join(map(str, mn))\r\n print(mn, mx)\r\n\r\nm, s = map(int, input().split())\r\nsolve()", "def getmin(m,s):\r\n mi=[1]+[0]*(m-1)\r\n s-=1\r\n for i in range(m):\r\n d=min(9,s)\r\n mi[-1-i]+=d\r\n s-=d\r\n return int(\"\".join(map(str,mi)))\r\n\r\ndef getmax(m,s):\r\n mx=[]\r\n for i in range(m):\r\n d=min(s,9)\r\n mx.append(d)\r\n s-=d\r\n return \"\".join(map(str,mx))\r\nm,s=map(int,input().split())\r\nif m==1 and s==0:\r\n print(0, 0)\r\nelif s>m*9 or s==0:\r\n print(-1, -1)\r\nelse:\r\n print(getmin(m,s), getmax(m,s))", "n, s = map(int, input().split())\r\nif(n==1 and s==0):\r\n print('0 0')\r\nelif(9*n < s or s == 0):\r\n print('-1 -1')\r\nelse:\r\n x1 = 10**(n-1)\r\n for i in range(s-1):\r\n x1 += 10**(i//9)\r\n x2 = 0\r\n for i in range(s):\r\n x2 += 10**(n-1-i//9)\r\n print(x1, x2)" ]

[ "from sys import stdin\r\nfrom collections import *\r\n\r\n\r\ndef arr_inp(n):\r\n if n == 1:\r\n return [int(x) for x in stdin.readline().split()]\r\n elif n == 2:\r\n return [float(x) for x in stdin.readline().split()]\r\n else:\r\n return list(stdin.readline()[:-1])\r\n\r\n\r\nn, m, k = arr_inp(1)\r\na, b, ans = arr_inp(1), arr_inp(1), 0\r\ndic = defaultdict(int, {a[i]: i for i in range(n)})\r\n\r\nfor i in range(m):\r\n ans += (dic[b[i]] // k) + 1\r\n if dic[b[i]]:\r\n a[dic[b[i]]], a[dic[b[i]] - 1] = a[dic[b[i]] - 1], a[dic[b[i]]]\r\n dic[a[dic[b[i]]]] += 1\r\n dic[b[i]] -= 1\r\n\r\n # print(ans)\r\nprint(ans)\r\n", "import sys\r\nr=sys.stdin.readline\r\nn,m,k=map(int,r().split())\r\nscreen=list(map(int,r().split()))\r\ngesture=0\r\narr=[-1]*n\r\nfor i in range(n):\r\n screen[i]-=1\r\n arr[screen[i]]=i\r\nfor i in list(map(int,r().split())):\r\n i-=1\r\n pos = arr[i]\r\n gesture+=pos//k+1\r\n if pos !=0:\r\n tmp=screen[pos-1]\r\n screen[pos-1],screen[pos]=screen[pos],screen[pos-1]\r\n arr[i],arr[tmp]=arr[tmp],arr[i]\r\nprint(gesture)\r\n", "n,m,k=map(int,input().split())\r\nids=list(map(int,input().split()))\r\nopn=list(map(int,input().split()))\r\npos=[-1]*(n+1)\r\nfor i in range(n):\r\n\tpos[ids[i]]=i+1\r\nans=0\r\nfor i in range(m):\r\n\topened=opn[i]\r\n\tif pos[opened]==1:\r\n\t\tans+=1\r\n\t\tcontinue\r\n\tj=pos[opened]\r\n\t# print(j,end=\" \")\r\n\tx=j//k\r\n\t# print(x,end=\" \")\r\n\tif j%k==0:\r\n\t\tx-=1\r\n\tx+=1\r\n\tans+=x\r\n\t# print(ans)\r\n\ty=ids[j-2]\r\n\t# print(y)\r\n\tids[j-2]=ids[j-1]\r\n\tids[j-1]=y\r\n\tpos[opened]-=1;\r\n\tpos[y]+=1\r\n\t# print(ids,pos)\r\nprint(ans)", "def main():\r\n n, m, k = map(int, input().split())\r\n app = list(map(int, input().split()))\r\n pos = [0] * n\r\n for i in range(n):\r\n app[i] -= 1\r\n pos[app[i]] = i\r\n res = 0\r\n for cur in map(int, input().split()):\r\n cur -= 1\r\n res += pos[cur] // k + 1\r\n if pos[cur]:\r\n pos[cur] -= 1\r\n pos[app[pos[cur]]] += 1\r\n app[pos[cur]], app[pos[cur] + 1] = app[pos[cur] + 1], app[pos[cur]]\r\n print(res)\r\n\r\nmain()\r\n", "def calcNSwipes(order):\r\n return (order-1)//k\r\ndef calcNMoves(order):\r\n return calcNSwipes(order)+1 #1 more to launch app\r\n\r\nn,m,k=[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\ngetOrderFromId=[-1 for _ in range(n+1)]\r\ngetIdFromOrder=[-1 for _ in range(n+1)]\r\n\r\nfor i,appId in enumerate(a):\r\n order=i+1\r\n getOrderFromId[appId]=order\r\n getIdFromOrder[order]=appId\r\n\r\nans=0\r\nfor appId in b:\r\n order=getOrderFromId[appId]\r\n ans+=calcNMoves(order)\r\n \r\n if order>1: #swap\r\n prevOrder=order-1\r\n prevId=getIdFromOrder[prevOrder]\r\n #prevOrder to match appId\r\n #order to match prevId\r\n getOrderFromId[prevId]=order\r\n getIdFromOrder[order]=prevId\r\n getOrderFromId[appId]=prevOrder\r\n getIdFromOrder[prevOrder]=appId\r\n\r\nprint(ans)", "import sys\r\n\r\nif __name__ == '__main__':\r\n n, m, k = map(int, input().split())\r\n a = list(map(int, sys.stdin.readline().rstrip().split()))\r\n pos = [0] * (n + 1)\r\n for idx, i in enumerate(a):\r\n pos[i] = idx # 记录每个数的位置\r\n ans = 0\r\n for i in map(int, sys.stdin.readline().rstrip().split()):\r\n idx = pos[i]\r\n ans += idx // k + 1 # 当前数字在idx//k+1块屏幕上\r\n if idx:\r\n # 交换与前一个数字的位置\r\n a[idx], a[idx - 1] = a[idx - 1], a[idx]\r\n pos[i], pos[a[idx]] = pos[a[idx]], pos[i]\r\n print(ans)", "n, m , k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nidx, res = [-1] * (n+1), 0\r\nfor i in range(n):\r\n idx[arr[i]] = i\r\nb = list(map(int, input().split()))\r\nfor x in b:\r\n res += idx[x] // k + 1\r\n if idx[x] > 0:\r\n c = idx[x]\r\n arr[c], arr[c - 1] = arr[c - 1], arr[c]\r\n idx[x], idx[arr[c]] = idx[arr[c]], idx[x]\r\nprint(res)\r\n", "def read():\r\n return [int(c) for c in input().split()]\r\n\r\ndef main():\r\n INF = float('infinity')\r\n\r\n n, m, k = read()\r\n init = read()\r\n actions = read()\r\n\r\n assoc = {}\r\n for i, e in enumerate(init):\r\n assoc[e] = i\r\n\r\n page = [i // k for i in range(n)]\r\n prv = [-INF] + init[:-1]\r\n nxt = init[1:] + [INF] \r\n\r\n ans = 0\r\n for a in actions:\r\n ans += page[assoc[a]] + 1\r\n if assoc[a] == 0:\r\n continue\r\n\r\n x, y = assoc[a], assoc[a] - 1\r\n prv[x], prv[y] = prv[y], a\r\n nxt[x], nxt[y] = init[y], nxt[x]\r\n\r\n assoc[a] -= 1\r\n assoc[init[y]] += 1\r\n\r\n init[x], init[y] = init[y], init[x]\r\n\r\n\r\n print(ans)\r\n\r\n\r\nmain()", "def get_screen(x, k):\r\n\tif x % k == 0:\r\n\t\treturn x // k\r\n\telse:\r\n\t\treturn x // k + 1\r\nn, m, k = map(int, input().split())\r\nindexs = {}\r\nind = 1\r\na = []\r\nfor i in input().split():\r\n\ti = int(i)\r\n\tindexs[i] = ind\r\n\tind += 1\r\n\ta.append(i)\r\nans = 0\r\nfor x in input().split():\r\n\tx = int(x)\r\n\tind = indexs[x]\r\n\tans += get_screen(ind, k) - 1\r\n\tans += 1\r\n\tif ind > 1:\r\n\t\tprev = a[ind - 2]\r\n\t\tindexs[prev] += 1\r\n\t\tindexs[x] -= 1\r\n\t\ta[ind - 2], a[ind - 1] = a[ind - 1], a[ind - 2]\r\nprint(ans)", "from heapq import heapify, heappop, heappush, nlargest\r\nfrom collections import Counter, defaultdict\r\nfrom sys import stdin, stdout\r\nfrom math import ceil, floor, sqrt\r\nfrom functools import reduce,lru_cache\r\n# n,m = map(int,stdin.readline().split())\r\n# stdout.write(str(arr[x-y]-arr[x])+'\\n')\r\n# reps = int(stdin.readline())\r\n# for _ in range(reps):\r\n # s1,s2 = stdin.readline().strip().split()\r\n # s = stdin.readline().strip()\r\n # n = int(stdin.readline())\r\n # n,m,k = map(int,stdin.readline().split())\r\n # arr = list(map(int,stdin.readline().split()))\r\nn,m,k = map(int,stdin.readline().split())\r\narr = list(map(int,stdin.readline().split()))\r\nqueries = list(map(int,stdin.readline().split()))\r\nidx = [-1 for _ in range(n+1)]\r\nfor i,a in enumerate(arr):\r\n idx[a] = i\r\n \r\nans = 0\r\nfor q in queries:\r\n idxq = idx[q]\r\n ans += idxq//k + 1\r\n if idxq!=0:\r\n prev = arr[idxq-1]\r\n idx[prev], idx[q] = idx[q], idx[prev]\r\n arr[idxq-1], arr[idxq] = arr[idxq], arr[idxq-1]\r\n \r\nprint(ans) \r\n ", "n, m, v=[int(i) for i in input().split()]\r\n\r\na=[int(i) for i in input().split()]\r\n\r\nb=[int(i) for i in input().split()]\r\n\r\nind=[0 for i in range(n)]\r\nfor i in range(n):\r\n ind[a[i]-1]= i\r\n\r\nmvt=0\r\n\r\nfor i in b:\r\n k= ind[i-1]\r\n if k>0:\r\n a[k],a[k-1]= a[k-1], a[k]\r\n ind[a[k]-1], ind[a[k-1]-1]= ind[a[k-1]-1], ind[a[k]-1]\r\n mvt+=k//v+1\r\n\r\nprint(mvt)\r\n", "n, m, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\np = {}\r\nfor i, ai in enumerate(a):\r\n p[ai] = i\r\n\r\nsol = 0\r\nfor bi in b:\r\n pi = p[bi]\r\n sol += pi//k + 1\r\n\r\n if pi > 0:\r\n bj = a[pi-1]\r\n p[bi], p[bj] = p[bj], p[bi]\r\n a[pi], a[pi-1] = a[pi-1], a[pi]\r\n\r\nprint(sol)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, c, k = map(int, input().split())\r\nw = list(map(int, input().split()))\r\nd = [0]*(n+1)\r\nfor i, j in enumerate(w):\r\n d[j] = i\r\nfor i in map(int, input().split()):\r\n a = d[i]\r\n c += d[i]//k\r\n if d[i] > 0:\r\n b = a - 1\r\n j = w[b]\r\n w[a], w[b], d[i], d[j] = w[b], w[a], d[j], d[i]\r\nprint(c)", "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,k = ilele()\r\nA = alele()\r\nB= alele()\r\nG1 = {}\r\nG2 = {}\r\nkk = 0\r\nfor i in range(0,n,k):\r\n kk+=1\r\n l = 1\r\n for j in range(i,min(i+k,n)):\r\n G1[A[j]] = (kk,l)\r\n G2[(kk,l)] = A[j]\r\n l+=1\r\n#print(G1,G2)\r\nAns = 0\r\nfor i in B:\r\n x,y= G1[i]\r\n Ans += x\r\n #print(x)\r\n if y != 1:\r\n z = G2[(x,y-1)]\r\n G1[i],G1[z] = G1[z],G1[i]\r\n G2[(x,y)],G2[(x,y-1)] = G2[(x,y-1)],G2[(x,y)]\r\n elif x!=1 :\r\n z = G2[(x-1,k)]\r\n G1[i],G1[z] = G1[z],G1[i]\r\n G2[(x,y)],G2[(x-1,k)] = G2[(x-1,k)],G2[(x,y)]\r\n #print(G1,G2)\r\nprint(Ans)\r\n \r\n ", "nums = [int(x) for x in input().split()]\r\nappsCount = nums[0]\r\nlaunchedAppsCount = nums[1]\r\nappsPerPage = nums[2]\r\nappIDs = [int(x) for x in input().split()]\r\nlaunchedAppIDs = [int(x) for x in input().split()]\r\nappIDsPosition = {}\r\nfor (idx, id) in enumerate(appIDs):\r\n appIDsPosition[id] = idx \r\ntotalMoves = 0\r\nfor launchedID in launchedAppIDs:\r\n position = appIDsPosition[launchedID]\r\n totalMoves += position // appsPerPage + 1\r\n if position > 0:\r\n appIDsPosition[launchedID] = position - 1\r\n neighborApp = appIDs[appIDsPosition[launchedID]]\r\n appIDsPosition[neighborApp] = position\r\n temp = appIDs[position]\r\n appIDs[position] = neighborApp\r\n appIDs[position - 1] = temp\r\nprint(totalMoves)", "import sys\r\n\r\nn, m, k = map(int, sys.stdin.readline().split())\r\nicon_ids = list(map(int, sys.stdin.readline().split()))\r\nlaunch_order = list(map(int, sys.stdin.readline().split()))\r\napp_to_slot = dict()\r\nresult = 0\r\nfor i, icon in enumerate(icon_ids):\r\n app_to_slot[icon] = i\r\n\r\nfor app in launch_order:\r\n result += (app_to_slot[app] // k) + 1\r\n old_slot = app_to_slot[app]\r\n if not old_slot:\r\n continue\r\n app_to_demote = icon_ids[old_slot-1]\r\n icon_ids[old_slot], icon_ids[old_slot-1] = icon_ids[old_slot-1], icon_ids[old_slot]\r\n app_to_slot[icon_ids[old_slot]] = old_slot\r\n app_to_slot[icon_ids[old_slot-1]] = old_slot - 1\r\n\r\nprint(result)\r\n", "n, m, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nrev = dict(zip(a, range(0, n)))\r\nsum = 0\r\nfor x in map(int, input().split()):\r\n\tloc = rev[x]\r\n\tsum += loc // k + 1\r\n\tif loc > 0:\r\n\t\ty = a[loc - 1]\r\n\t\ta[loc-1:loc+1] = [x, y]\r\n\t\trev[x], rev[y] = loc-1, loc\r\nprint(sum)\r\n", "'''input\n5 4 2\n3 1 5 2 4\n4 4 4 4\n'''\nimport math\nfrom sys import stdin, stdout\n\n\ndef get_order(pemut):\n\torder = dict()\n\tfor i in range(1, n + 1):\n\t\torder[permut[i - 1]] = i \n\n\tr_order = dict()\n\tfor i in order:\n\t\tr_order[order[i]] = i\n\n\treturn order, r_order\n\n\n# main starts\nn, m, k = list(map(int, stdin.readline().split()))\npermut = list(map(int, stdin.readline().split()))\norder, r_order = get_order(permut)\n# print(order, r_order)\nbarr = list(map(int, stdin.readline().split()))\nans = 0\nfor num in barr:\n\t# print(math.ceil(order[num] / k))\n\t# print(order, r_order)\n\tans += math.ceil(order[num] / k)\n\tif order[num] != 1:\n\t\ttemp = r_order[order[num] - 1]\n\t\ttemp2 = order[num]\n\t\torder[num] = order[num] - 1\n\t\tr_order[temp2] = temp\n\t\tr_order[temp2 - 1] = num\n\t\torder[temp] = temp2\nprint(ans)\n", "from sys import stdin\r\ninput=stdin.readline\r\nn,m,k=map(int,input().split())\r\na=[0]+list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nidx=[0]*(n+1)\r\nfor i in range(1,n+1):\r\n idx[a[i]]=i # 1-indexed\r\nans=0\r\nfor i in range(m):\r\n bb=b[i]\r\n ans+=(idx[bb]-1)//k+1\r\n if idx[bb]>1:\r\n i1=idx[bb]\r\n i2=idx[bb]-1\r\n num1=a[i1]\r\n num2=a[i2]\r\n a[i1],a[i2]=a[i2],a[i1]\r\n idx[num1],idx[num2]=idx[num2],idx[num1]\r\nprint(ans)", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import defaultdict\r\n\r\nn, m, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\na = list(map(lambda x: x-1, a))\r\nb = list(map(int, input().split()))\r\nb = list(map(lambda x: x-1, b))\r\npage = [-1]*n\r\npos = [-1]*n\r\nd = defaultdict(int)\r\n\r\nfor i in range(n):\r\n page[a[i]] = i//k\r\n pos[a[i]] = i%k\r\n d[i//k*10**6+i%k] = a[i]\r\n\r\nans = 0\r\n\r\nfor bi in b:\r\n ans += page[bi]+1\r\n \r\n if page[bi]==0 and pos[bi]==0:\r\n continue\r\n \r\n page1 = page[bi]\r\n pos1 = pos[bi]\r\n \r\n if pos1==0:\r\n page2 = page1-1\r\n pos2 = k-1\r\n else:\r\n page2 = page1\r\n pos2 = pos1-1\r\n\r\n ci = d[page2*10**6+pos2]\r\n page[bi] = page2\r\n pos[bi] = pos2\r\n page[ci] = page1\r\n pos[ci] = pos1\r\n d[page1*10**6+pos1] = ci\r\n d[page2*10**6+pos2] = bi\r\n \r\nprint(ans)", "n,m,k = map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nd,di,res={},{},0\r\nfor i,x in enumerate(a):\r\n d[x]=i\r\n di[i]=x\r\nfor i,y in enumerate(b):\r\n x=d[y]\r\n res+=x//k+1\r\n if x>0:\r\n d[di[x-1]]+=1\r\n d[y]-=1\r\n di[x],di[x-1]=di[x-1],di[x]\r\nprint(res)", "n,m,k=map(int,input().split())\r\nl1=[int(a) for a in input().split()]\r\nl2=[int(a) for a in input().split()]\r\ndt1,dt2=dict(),dict()\r\nans=0\r\nfor i in range(n):\r\n dt1[l1[i]]=i+1\r\nfor i in dt1:\r\n dt2[dt1[i]]=i\r\nfor i in range(m):\r\n a1=dt1[l2[i]]\r\n #print(a1)\r\n ans+=(a1-1)//k+1\r\n if dt1[l2[i]]>1:\r\n dt2[dt1[l2[i]]-1],dt2[dt1[l2[i]]]=dt2[dt1[l2[i]]],dt2[dt1[l2[i]]-1]\r\n dt1[l2[i]]-=1\r\n dt1[dt2[dt1[l2[i]]+1]]+=1\r\nprint(ans)\r\n \r\n ", "\r\n\r\nn,m,k=list(map(int,input().split()))\r\nnums=list(map(int,input().split()))\r\ntargets=list(map(int,input().split()))\r\npre_calculate=[0]*(10**5+2)\r\nstoring_index=[0]*(10**5+2)\r\nfor i in range(len(nums)):\r\n save=i//k\r\n pre_calculate[nums[i]]=1+save\r\n storing_index[nums[i]]=i\r\n# print(pre_calculate[:n+1])\r\nans=0\r\n\r\nfor i in range(len(targets)):\r\n \r\n ans=ans+pre_calculate[targets[i]]\r\n if nums[0]!=targets[i]:\r\n val=nums[storing_index[targets[i]]-1]\r\n nums[storing_index[targets[i]]],nums[storing_index[val]]=nums[storing_index[val]],nums[storing_index[targets[i]]]\r\n storing_index[targets[i]]=storing_index[targets[i]]-1\r\n storing_index[val]=storing_index[val]+1\r\n pre_calculate[targets[i]],pre_calculate[val]=pre_calculate[val],pre_calculate[targets[i]]\r\n # print(ans)\r\nprint(ans)\r\n# ans=0\r\n# for target in targets:\r\n# answer=1\r\n# i=-1\r\n# while i<n:\r\n# for j in range(k):\r\n# i=i+1\r\n# if i==n:\r\n# break\r\n# if nums[i]==target:\r\n# ans=ans+answer\r\n# if i!=0:\r\n# nums[i-1],nums[i]=nums[i],nums[i-1]\r\n# answer=answer+1\r\n# print(ans)", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nN,M,K = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nB = list(map(int, input().split()))\r\n\r\nlib = {}\r\nfor i,a in enumerate(A):\r\n lib[a] = i\r\n\r\nans = 0\r\nfor b in B:\r\n j = lib[b]\r\n ans += max(0,j)//K+1\r\n #print(ans,j)\r\n if j>0:\r\n a = A[j-1]\r\n lib[a],lib[b] = j,j-1\r\n A[j],A[j-1] = A[j-1],A[j]\r\nprint(ans)\r\n\r\n", "def main():\r\n n, m, k = [int(i) for i in input().split()]\r\n a = [int(i)-1 for i in input().split()]\r\n b = [int(i)-1 for i in input().split()]\r\n v2i = [0]*n\r\n for index, i in enumerate(a):\r\n v2i[i] = index\r\n res = 0\r\n for i in b:\r\n index = v2i[i]\r\n res += index//k + 1\r\n if index != 0:\r\n v2 = a[index-1]\r\n v2i[v2] = index\r\n v2i[i] = index - 1\r\n a[index] = v2\r\n a[index-1] = i\r\n print(res)\r\n\r\n\r\n\r\n\r\nmain()\r\n", "n,m,k=[int(i) for i in input().split()]\n\ns=[int(i) for i in input().split()]\n\ndo=[int(i) for i in input().split()]\n\nD={}\n\nj=0\n\nfor i in s:\n\n D[i]=j\n\n j+=1\n\nN=0\n\nfor i in do:\n\n x=D[i]\n\n N+=(x//k+1)\n\n if D[i]!=0:\n\n p=s[x-1]\n\n D[p],D[i]=D[i],D[p]\n\n s[x],s[x-1]=s[x-1],s[x]\n\nprint(N)\n\n\n\n# Made By Mostafa_Khaled" ]

[ "from bisect import bisect_left as b\r\nf = lambda: map(int, input().split())\r\nn, x, k = f()\r\ns, t = 0, sorted(f())\r\np = [(q, ((q - 1) // x + k) * x) for q in t]\r\nfor q, d in p: s += b(t, d + x) - b(t, max(q, d))\r\nprint(s)", "from bisect import bisect_left as b\r\nr=lambda:map(int,input().split())\r\nn,x,k=r()\r\na=sorted(r())\r\nprint(sum(b(a,l+x)-b(a,max(u,l))for u,l in((u,((u-1)//x+k)*x)for u in a)))", "from bisect import bisect_left, bisect_right\r\n\r\nn, x, k = [int(i) for i in input().split(' ')]\r\nar = sorted([int(i) for i in input().split(' ')])\r\n\r\nlk, nk = -1, 0\r\n\r\nn_tup = 0\r\n\r\nif x != 1 or k != 0:\r\n for i in range(len(ar)):\r\n nk = ar[i]\r\n if lk != nk:\r\n xf = (k + (ar[i] - 1) // x)\r\n lo = bisect_left(ar, ar[i])\r\n # Find rightmost value less than xf*x\r\n lt = bisect_left(ar, (xf+1)*x, lo)\r\n # Find leftmost value greater than (xf+1)*x\r\n gt = bisect_right(ar, xf*x-1, lo)\r\n n_tup += lt - gt\r\n lk = nk\r\n\r\nprint(n_tup)", "n, x, k = map(int, input().split())\r\narray = list(map(int, input().split()))\r\n\r\ndef next_x(n):\r\n return ((n+x-1)//x)*x\r\n\r\nvalcount = {}\r\nfor a in array:\r\n valcount[a] = valcount.get(a, 0) + 1\r\n\r\nbegs = {}\r\npairs = 0\r\nfor val, count in sorted(valcount.items()):\r\n if k > 0 or val % x != 0:\r\n beg = next_x(val)\r\n begs[beg] = begs.get(beg, 0) + count\r\n from_ = next_x(val - k*x + 1)\r\n pairs += count*begs.get(from_, 0)\r\nprint(pairs)\r\n", "import sys\ntake = input\ninput = sys.stdin.readline\nshow = sys.stdout.write\n\nfrom bisect import bisect_left as bl\n \nR=lambda:map(int,input().split())\n \nn,x,k=R()\n \na=sorted(R())\n \nres = sum(bl(a,l+x)-bl(a,max(u,l)) for u,l in ((u,((u-1)//x+k)*x) for u in a))\n\nshow(str(res)+'\\n')\n \t\t\t \t\t \t\t\t \t\t\t \t \t\t \t\t \t\t", "import math\nimport bisect\n\n\nn, x, k = map(int, input().split())\na = sorted(list(map(int, input().split())))\nans = 0\n\nfor num in a:\n l = math.ceil(num/x)*x + (k-1)*x\n r = l + x - 1\n l = num if l < num else l\n # print(l, r, bisect.bisect_left(a, l), bisect.bisect_right(a, r), bisect.bisect_right(a, r) - bisect.bisect_left(a, l))\n ans += bisect.bisect_right(a, r) - bisect.bisect_left(a, l)\n\nprint(ans)\n\n\n'''\n7 3 2\n1 3 5 9 11 16 25\n'''\n\n'''\n4 2 0\n5 3 1 7\n'''\n", "from bisect import bisect_left\r\nR=lambda:map(int,input().split())\r\nn,x,k=R()\r\na=sorted(R())\r\nprint(sum(bisect_left(a,l+x)-bisect_left(a,max(u,l))\r\n for u,l in ((u,((u-1)//x+k)*x) for u in a)))\r\n", "# -*- coding: utf-8 -*-\r\n\r\nimport math\r\nimport collections\r\nimport bisect\r\nimport heapq\r\nimport time\r\nimport random\r\nimport itertools\r\nimport sys\r\n\r\n\"\"\"\r\ncreated by shhuan at 2017/11/27 01:27\r\n\r\n\"\"\"\r\n\r\n\r\nN, X, K = map(int, input().split())\r\n\r\nA = [int(x) for x in input().split()]\r\n\r\n# consider special case firstly\r\nif X == 1 and K == 0:\r\n print(0)\r\n exit(0)\r\n\r\nA.sort()\r\n\r\ndef right(start):\r\n # find the end for [start, end] has K elements divisible by X\r\n x = start//X if start%X != 0 else start//X-1\r\n endmin = max((x+K) * X, start)\r\n endmax = (x+K+1) * X - 1\r\n\r\n return endmin, endmax\r\n\r\nans = 0\r\nfor i, v in enumerate(A):\r\n rmin, rmax = right(v)\r\n rl = bisect.bisect_left(A, rmin)\r\n rr = bisect.bisect_right(A, rmax)\r\n ans += rr - rl\r\n\r\nprint(ans)", "import bisect\r\nimport math\r\n\r\nn, x, k = map(int, input().split())\r\na = sorted(list(map(int, input().split())))\r\nans = 0\r\nfor i in a:\r\n l = math.ceil(i/x)*x + (k-1)*x\r\n r = l + x - 1\r\n if (l < i): l = i \r\n else: l = l\r\n ans += bisect.bisect_right(a, r) - bisect.bisect_left(a, l)\r\nprint(ans)", "f = lambda: map(int, input().split())\r\nn, x, k = f()\r\nt = sorted(f())\r\ns = i = j = 0\r\nfor y in t:\r\n d = (y // x - k) * x\r\n while i < n and t[i] <= min(d, y): i += 1\r\n while j < n and t[j] <= min(d + x, y): j += 1\r\n s += j - i\r\nprint(s)", "import random, math\nfrom copy import deepcopy as dc\nfrom bisect import bisect_left, bisect_right\n\n# Function to call the actual solution\ndef solution(li, x, k):\n\tli.sort()\n\t# print(li)\n\n\ts = 0\n\n\ttot = 0\n\tfor i in range(len(li)):\n\t\tl = math.ceil(li[i]/x)*x + (k-1) * x\n\t\tr = l + x - 1\n\t\tl = max(l, li[i])\n\t\tmid = bisect_left(li, l)\n\t\tup = bisect_right(li, r)\n\t\ttot += up - mid\n\t\t# print(l, r)\n\treturn tot\n\n# Function to take input\ndef input_test():\n\tn, x, k = map(int, input().strip().split(\" \"))\n\tli = list(map(int, input().strip().split(\" \")))\n\tout = solution(li, x, k)\n\tprint(out)\n\n\ninput_test()\n# test()", "import sys\r\ninput=sys.stdin.readline\r\nfrom collections import defaultdict\r\nfrom bisect import bisect_right as bi\r\n\r\nn,x,k=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\na.sort()\r\nb={}\r\nc={}\r\nfor i in range(n):\r\n if a[i]//x not in b:\r\n b[a[i]//x]=[]\r\n if (a[i]-1)//x not in c:\r\n c[(a[i]-1)//x]=[]\r\n b[a[i]//x].append(a[i])\r\n c[(a[i]-1)//x].append(a[i])\r\ns=0\r\nfor i in b:\r\n if i-k in c:\r\n for j in range(len(b[i])):\r\n s+=bi(c[i-k],b[i][j])\r\nprint(s)", "from bisect import bisect_left as b\r\nR=lambda:map(int,input().split())\r\nn,x,k=R()\r\na=sorted(R())\r\nprint(sum(b(a,l+x)-b(a,max(u,l)) for u,l in ((u,((u-1)//x+k)*x) for u in a)))\r\n", "from bisect import bisect_left\r\nR=lambda:map(int,input().split())\r\nn,x,k=R()\r\na=sorted(R())\r\nb=(((u-1)//x+k)*x for u in a)\r\nprint(sum(bisect_left(a,l+x)-bisect_left(a,max(u,l)) for u,l in zip(a,b)))\r\n", "n,x,k = map(int,input().split())\r\narr = sorted(list(map(int,input().split())))\r\nans = 0\r\nfrom bisect import bisect_left as b\r\nfor i in range(n):\r\n if arr[i] % x == 0:\r\n l = arr[i] + (k-1)*x\r\n else:\r\n l = (arr[i] // x + k)*x\r\n r = l + x\r\n\r\n if k == 0:\r\n if arr[i] % x == 0:\r\n continue\r\n else:\r\n l = arr[i]\r\n r = (arr[i] // x + 1)*x\r\n ans += b(arr,r) - b(arr,l)\r\n\r\nprint(ans)\r\n \r\n\r\n", "import bisect\ndef lower_bound(A, x):\n low = 0\n high = len(A)\n while(low < high):\n mid = (low + high) // 2\n if(int(A[mid]) < x):\n low = mid + 1\n else:\n high = mid\n return low\n\ndef upper_bound(A, x):\n low = 0\n high = len(A)\n while(low < high):\n mid = (low + high) // 2\n if(int(A[mid]) <= x):\n low = mid + 1\n else:\n high = mid\n return low\nline = input().split()\nn = int(line[0])\nx = int(line[1])\nk = int(line[2])\na = [int(x) for x in input().split()]\na.sort()\n\nans = 0\nfor i in a:\n left = (i + x - 1) // x * x\n right = left + x * k - 1\n left = left + (k - 1) * x\n left = max(left, i)\n ans = ans + bisect.bisect_right(a, right) - bisect.bisect_left(a, left)\n # print(left, right, ans)\nprint(ans)\n\n\t \t\t\t \t \t \t \t \t\t\t \t \t\t\t \t \t \t", "from collections import defaultdict\r\nimport sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, x, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nd = defaultdict(lambda : 0)\r\nfor i in a:\r\n d[i] += 1\r\na = list(d.keys())\r\na.sort()\r\ncnt = defaultdict(lambda : 0)\r\nfor i in a:\r\n cnt[i // x] += d[i]\r\nans = 0\r\nfor i in a:\r\n u = i // x + min(i % x, 1)\r\n if u + k - 1 in cnt:\r\n ans += cnt[u + k - 1] * d[i]\r\n cnt[i // x] -= d[i]\r\nprint(ans)", "from bisect import bisect_left\r\nR=lambda:map(int,input().split())\r\nn,x,k=R()\r\na=sorted(R())\r\ncnt=0\r\nfor u in a:\r\n l=((u+x-1)//x+k-1)*x\r\n cnt+=bisect_left(a,l+x)-bisect_left(a,max(u,l))\r\nprint(cnt)\r\n", "def lowerBound(a, val1, i, n, k, x):\r\n low = 0\r\n high = n-1\r\n while(low <= high):\r\n mid = (low + high)//2\r\n val2 = a[mid]\r\n if(val2 >= val1):\r\n noOfEle = (val2)//x - (val1 - 1)//x\r\n if(noOfEle == k):\r\n if(mid == 0):\r\n return mid\r\n else:\r\n val3 = a[mid - 1]\r\n if(val3 >= val1):\r\n noOfEle1 = (val3)//x - (val1 - 1)//x\r\n if(noOfEle1 == k):\r\n high = mid - 1\r\n else:\r\n return mid\r\n else:\r\n return mid\r\n elif(noOfEle < k):\r\n low = mid + 1\r\n else:\r\n high = mid -1\r\n else:\r\n low = mid + 1\r\n return -1\r\n\r\ndef upperBound(a, val1, i, n, k, x):\r\n low = 0\r\n high = n-1\r\n while(low <= high):\r\n mid = (low + high)//2\r\n val2 = a[mid]\r\n if(val2 >= val1):\r\n noOfEle = (val2)//x - (val1 - 1)//x\r\n if(noOfEle == k):\r\n if(mid == n-1):\r\n return mid\r\n else:\r\n val3 = a[mid + 1]\r\n if(val3 >= val1):\r\n noOfEle1 = (val3)//x - (val1 - 1)//x\r\n if(noOfEle1 == k):\r\n low = mid + 1\r\n else:\r\n return mid\r\n else:\r\n return mid\r\n elif(noOfEle < k):\r\n low = mid + 1\r\n else:\r\n high = mid - 1\r\n else:\r\n low = mid + 1\r\n return -1\r\n\r\n\r\n\r\nn, x, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\nans = 0\r\nfor i in range(n):\r\n lower = lowerBound(a, a[i], i, n, k, x)\r\n upper = upperBound(a, a[i], i, n, k, x)\r\n if(upper != -1 and lower != -1):\r\n ans += (upper-lower) + 1\r\n\r\nprint(ans)", "from bisect import bisect_left\r\nR=lambda:map(int,input().split())\r\nn,x,k=R()\r\na=sorted(R())\r\nz=((u,((u-1)//x+k)*x) for u in a)\r\nprint(sum(bisect_left(a,l+x)-bisect_left(a,max(u,l)) for u,l in z))\r\n", "from bisect import bisect_left\r\nR=lambda:map(int,input().split())\r\nn,x,k=R()\r\na=sorted(R())\r\ns=0\r\nfor u in a:\r\n l=((u-1)//x+k)*x\r\n s+=bisect_left(a,l+x)-bisect_left(a,max(u,l))\r\nprint(s)\r\n", "n, x, k =list(map(int, input().split()))\r\nsorted_array = sorted(list(map(int, input().split())))\r\nsumm = i = j = 0\r\nfor val in sorted_array:\r\n dis = (val // x - k) * x\r\n if i < n or j <n:\r\n while i < n and sorted_array[i] <= min(dis, val):\r\n i += 1\r\n while j < n and sorted_array[j] <= min(dis + x, val):\r\n j += 1\r\n summ += j - i\r\nprint(summ)\r\n", "n, x, k = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\na.sort()\r\nans = 0\r\nl = 0\r\nr = 0\r\nfor j in range(n):\r\n\tcur = ((a[j] // x) - k) * x\r\n\twhile l < n and a[l] <= min(cur, a[j]):\r\n\t\tl += 1\r\n\t\t\r\n\twhile r < n and a[r] <= min(cur + x, a[j]):\r\n\t\tr += 1\r\n\tans += r - l\r\nprint(ans)# 1690589032.1900272" ]

[ "from sys import *\r\n\r\nn = int(input())\r\nm = int(5000)\r\n\r\nvls = sorted([int(t) for t in stdin.readline().split()])\r\nr1 = [0 for t in range(m)]\r\nfor i in range(n-1):\r\n for k in range(i+1, n):\r\n r1[vls[k] - vls[i]] += 1\r\n\r\nr2 = [0 for t in range(m*2)]\r\nfor i in range(m):\r\n for k in range(m):\r\n r2[i+k] += r1[i]*r1[k]\r\n\r\nans = int(0)\r\nfor t1 in range(m):\r\n for t2 in range(m*2):\r\n if t1 > t2:\r\n ans += r1[t1]*r2[t2]\r\n\r\nd = (n-1)*n/2\r\nprint(\"{0:08f}\".format(float(ans)/(d**3)))\r\n", "B = 5000 #number of bins\r\ndef solv(l):\r\n n = len(l)\r\n l.sort()\r\n d1 = [0]*B\r\n for i in range(n):\r\n for j in range(i+1,n):\r\n d1[l[j]-l[i]] += 1\r\n d2 = [0]*B\r\n for i in range(B):\r\n for j in range(B-i):\r\n d2[i+j] += d1[i]*d1[j]\r\n dl = [0]*B\r\n for i in range(1,B):\r\n dl[i] = d2[i]+dl[i-1]\r\n ans = 0\r\n for i in range(2,B):\r\n ans += d1[i]*dl[i-1]\r\n m = n*(n-1)//2\r\n return ans/pow(m,3)\r\n\r\n_ = input()\r\nl = list(map(int,input().split()))\r\nprint(solv(l))\r\n", "n = int(input())\r\nt = list(map(int, input().split()))\r\n\r\ns, k = 0, 5001\r\nd = [0, 0] * k\r\n\r\nfor a in t:\r\n for b in t: d[b - a] += 1\r\nfor i in range(k, 2 * k): d[i] += d[i - 1]\r\n\r\nfor i in range(1, k):\r\n s += d[i] * sum(d[j] * d[-1 - i - j] for j in range(1, k - i))\r\n\r\nprint(8 * s / (n * n - n) ** 3)", "n = int(input())\r\na = [int(x) for x in input().split()]\r\n\r\ndiff = [0] * 5000\r\n\r\nfor i in range(n):\r\n for j in range(i + 1, n):\r\n (A, B) = (a[i], a[j]) if a[i] < a[j] else (a[j], a[i])\r\n diff[B - A] += 1\r\n\r\nsuff = [0] * 5000\r\nsuff[-1] = diff[-1]\r\nfor i in range(len(suff) - 2, -1, -1):\r\n suff[i] = diff[i] + suff[i+1]\r\n \r\nans = 0\r\nfor i in range(5000):\r\n for j in range(5000):\r\n if i + j + 1 >= 5000: continue\r\n ans += diff[i] * diff[j] * suff[i + j + 1]\r\n\r\ntotal = (n*(n-1)//2)**3\r\nprint(\"{:.10f}\".format(ans/total))\r\n", "from bisect import *\r\nfrom collections import *\r\nimport sys\r\nimport io, os\r\nimport math\r\nimport random\r\nfrom heapq import *\r\ngcd = math.gcd\r\nsqrt = math.sqrt\r\nmaxint=10**21\r\ndef ceil(a, b):\r\n if(b==0):\r\n return maxint\r\n a = -a\r\n k = a // b\r\n k = -k\r\n return k\r\n# arr=list(map(int, input().split()))\r\n# n,m=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\ndef main():\r\n n=int(input())\r\n arr=list(map(int, input().split()))\r\n arr.sort()\r\n diffs=[0]*(arr[-1]-arr[0]+1)\r\n for i in range(n):\r\n for j in range(i+1,n):\r\n diffs[arr[j]-arr[i]]+=1\r\n ans=0\r\n fin=0\r\n l=len(diffs)\r\n for i in range(3,l):\r\n for j in range(1,i-1):\r\n ans+=(diffs[j]*diffs[i-1-j])\r\n fin+=(diffs[i]*ans)\r\n tot=n*(n-1)//2\r\n print(fin/(tot**3))\r\nmain()", "ways = [0] * 5001\r\ns_ways = [0] * 5001\r\nn = int(input())\r\na = set(map(int, input().split()))\r\n\r\nfor diff in range(4999, 0, -1):\r\n\tfor i in a:\r\n\t\tif i >= diff and (i - diff in a):\r\n\t\t\tways[diff] += 1\r\n\tways[diff] /= (n * (n - 1) / 2)\r\n\ts_ways[diff] = s_ways[diff + 1] + ways[diff]\r\n\r\nans = 0\r\nfor diff1 in range(1, 5000):\r\n\tfor diff2 in range(1, 5000 - diff1):\r\n\t\ttargetdiff = diff1 + diff2 + 1\r\n\t\tans += ways[diff1] * ways[diff2] * s_ways[targetdiff]\r\n\r\nprint(ans)", "from itertools import accumulate\r\n\r\nR = lambda: map(int, input().split())\r\nn = int(input())\r\narr = sorted(R())\r\nones = [0] * 5005\r\nfor i in range(n):\r\n for j in range(i):\r\n ones[abs(arr[i] - arr[j])] += 1\r\ntwos = [0] * 10005\r\nfor i in range(1, 5001):\r\n for j in range(1, 5001):\r\n if ones[i] and ones[j]:\r\n twos[i + j] += ones[i] * ones[j]\r\nstwos = list(accumulate(twos))\r\nsat, sm = 0, 0\r\nfor i in range(1, 5001):\r\n if ones[i]:\r\n sat += ones[i] * stwos[i - 1]\r\n sm += ones[i] * stwos[-1]\r\nprint(sat / max(1, sm))", "cnt = [0] * 5001\r\nways = [0] * 5001\r\ns_ways = [0] * 5001\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\nfor i in a:\r\n\tcnt[i] += 1\r\n\r\nfor diff in range(4999, 0, -1):\r\n\tfor i in a:\r\n\t\tif i >= diff and cnt[i - diff] > 0:\r\n\t\t\tways[diff] += 1\r\n\tways[diff] /= (n * (n - 1) / 2)\r\n\ts_ways[diff] = s_ways[diff + 1] + ways[diff]\r\n\t\r\nans = 0\r\nfor diff1 in range(1, 5000):\r\n\tfor diff2 in range(1, 5000 - diff1):\r\n\t\ttargetdiff = diff1 + diff2 + 1\r\n\t\tans += ways[diff1] * ways[diff2] * s_ways[targetdiff]\r\n\r\nprint(ans)", "from itertools import accumulate\n\nn = int(input())\nA = [int(x) for x in input().split()]\nm = max(A)\ndifference = [0 for i in range(m)]\nfor i in range(n):\n for j in range(i+1, n):\n difference[abs(A[i]-A[j])] += 1\ndiffsum = [0 for i in range(2*m)]\nfor i in range(m):\n for j in range(m):\n diffsum[i+j] += difference[i]*difference[j]\nD = list(accumulate(diffsum))\nans = sum(difference[k] * D[k-1] for k in range(m))\nprint(8*ans/((n*(n-1)) ** 3))\n" ]

[ "n = int(input())\r\nA = list(map(int,input().split(\" \")))\r\n\r\nmatrix = []\r\nfor i in range(n):\r\n matrix.append([0]*n)\r\n\r\nfor i in range(n):\r\n matrix[i][i] = A[i]\r\n\r\nfor i in reversed(range(0,n)):\r\n for j in range(i+1,n):\r\n matrix[i][j] = matrix[i][j-1]^matrix[i+1][j]\r\n\r\nfor i in reversed(range(0,n)):\r\n for j in range(i+1,n):\r\n matrix[i][j] = max(matrix[i][j],matrix[i][j-1],matrix[i+1][j])\r\n\r\nq = int(input())\r\nfor i in range(q):\r\n parameters = list(map(int,input().split(\" \")))\r\n l,r = parameters[0]-1,parameters[1]-1\r\n print(matrix[l][r])\r\n", "from sys import stdin, stdout\r\nrepetition=int(input())\r\ns=list(map(int,stdin.readline().strip().split()))\r\nnumber_common = 1\r\nvector=[[-number_common for index in range(repetition+number_common)]for index_2 in range(repetition+number_common)]\r\n\r\nfor index in range(repetition):\r\n vector[0][index]=s[index]\r\n\r\nfor index in range(number_common,repetition):\r\n for index_2 in range(repetition-index):\r\n vector[index][index_2]=vector[index-number_common][index_2]^vector[index-number_common][index_2+number_common]\r\n \r\nfor index in range(number_common,repetition):\r\n for index_2 in range(repetition-index):\r\n vector[index][index_2]=max(vector[index-number_common][index_2],vector[index-number_common][index_2+number_common],vector[index][index_2])\r\n\r\nfor index in range(int(input())):\r\n l,r=map(int,stdin.readline().strip().split())\r\n print(vector[r-l][l-number_common])", "n = int(input())\r\nlista = list(map(int, input().split()))\r\n \r\nst = [[0]*n for _ in range(n)]\r\nfor i in range(n):\r\n st[0][i] = lista[i]\r\nfor i in range(1, n):\r\n for j in range(n-i):\r\n st[i][j] = st[i-1][j]^st[i-1][j+1]\r\n \r\nfor i in range(1, n):\r\n for j in range(n-i):\r\n st[i][j] = max(st[i][j], st[i-1][j], st[i-1][j+1])\r\n \r\nq = int(input())\r\nfor i in range(q):\r\n l, r = map(int, input().split())\r\n l, r = l-1, r-1\r\n print(st[r-l][l])", "import sys\r\ninput = lambda : sys.stdin.readline().rstrip()\r\n\r\nsys.setrecursionlimit(2*10**5+10)\r\nwrite = lambda x: sys.stdout.write(x+\"\\n\")\r\ndebug = lambda x: sys.stderr.write(x+\"\\n\")\r\nwritef = lambda x: print(\"{:.12f}\".format(x))\r\n\r\n### セグメント木(はやい)\r\nclass SG:\r\n def __init__(self, n, v=None):\r\n self._n = n\r\n self.geta = 0\r\n x = 0\r\n while (1 << x) < n:\r\n x += 1\r\n self._log = x\r\n self._size = 1 << self._log\r\n self._d = [ninf] * (2 * self._size)\r\n if v is not None:\r\n for i in range(self._n):\r\n self._d[self._size + i] = v[i]\r\n for i in range(self._size - 1, 0, -1):\r\n self._update(i)\r\n def _update(self, k):\r\n self._d[k] = op(self._d[2 * k], self._d[2 * k + 1])\r\n def update(self, p, x):\r\n assert 0 <= p < self._n\r\n# x -= self.geta\r\n p += self._size\r\n self._d[p] = x\r\n for i in range(1, self._log + 1):\r\n# self._update(p >> i)\r\n k = p>>i\r\n self._d[k] = op(self._d[2 * k], self._d[2 * k + 1])\r\n def get(self, p):\r\n assert 0 <= p < self._n\r\n return self._d[p + self._size] # + self.geta\r\n def check(self):\r\n return [self.get(p) for p in range(self._n)]\r\n def query(self, left, right):\r\n # [l,r)の総和\r\n assert 0 <= left <= right <= self._n\r\n sml = ninf\r\n smr = ninf\r\n left += self._size\r\n right += self._size\r\n # 外側から計算していく(lは小さい側から, rは大きい側から)\r\n while left < right:\r\n if left & 1:\r\n sml = op(sml, self._d[left])\r\n left += 1\r\n if right & 1:\r\n right -= 1\r\n smr = op(self._d[right], smr)\r\n left >>= 1\r\n right >>= 1\r\n return op(sml, smr) # + self.geta\r\n# def update_all(self, v):\r\n# # 全体加算\r\n# self.geta += v\r\n def query_all(self):\r\n return self._d[1] # + self.geta\r\n def max_right(self, left, f):\r\n \"\"\"f(op(a[l], a[l + 1], ..., a[r - 1])) = true となる最大の r\r\n -> rはf(op(a[l:r+1]))がFalseになる最小のr\r\n \"\"\"\r\n# assert 0 <= left <= self._n\r\n# assert f(ninf)\r\n if left == self._n:\r\n return self._n\r\n left += self._size\r\n sm = ninf\r\n first = True\r\n while first or (left & -left) != left:\r\n first = False\r\n while left % 2 == 0:\r\n left >>= 1\r\n if not f(op(sm, self._d[left])):\r\n while left < self._size:\r\n left *= 2\r\n if f(op(sm, self._d[left])):\r\n sm = op(sm, self._d[left])\r\n left += 1\r\n return left - self._size\r\n sm = op(sm, self._d[left])\r\n left += 1\r\n return self._n\r\n def min_left(self, right, f):\r\n \"\"\"f(op(a[l], a[l + 1], ..., a[r - 1])) = true となる最小の l\r\n \"\"\"\r\n# assert 0 <= right <= self._n\r\n# assert f(ninf)\r\n if right == 0:\r\n return 0\r\n right += self._size\r\n sm = ninf\r\n first = True\r\n while first or (right & -right) != right:\r\n first = False\r\n right -= 1\r\n while right > 1 and right % 2:\r\n right >>= 1\r\n if not f(op(self._d[right], sm)):\r\n while right < self._size:\r\n right = 2 * right + 1\r\n if f(op(self._d[right], sm)):\r\n sm = op(self._d[right], sm)\r\n right -= 1\r\n return right + 1 - self._size\r\n sm = op(self._d[right], sm)\r\n return 0\r\nop = max\r\nninf = 0\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nvs = [[0]*(n-i) for i in range(n)]\r\nvs[0] = a\r\nfor i in range(1,n):\r\n for j in range(n-i):\r\n vs[i][j] = vs[i-1][j]^vs[i-1][j+1]\r\ndef f(l,r):\r\n return vs[r-l][l]\r\nms = [[0]*n for _ in range(n)]\r\nfor l in range(n):\r\n ms[l][l] = f(l,l)\r\n for r in range(l+1,n):\r\n ms[l][r] = max(ms[l][r-1], f(l,r))\r\nsgs = []\r\nfor r in range(n):\r\n l = [ms[l][r] for l in range(r+1)]\r\n sg = SG(len(l), l)\r\n sgs.append(sg)\r\nq = int(input())\r\nans = []\r\nfor _ in range(q):\r\n l,r = map(int, input().split())\r\n l -= 1\r\n r -= 1\r\n val = sgs[r].query(l,r+1)\r\n ans.append(val)\r\n# break\r\nwrite(\"\\n\".join(map(str, ans)))", "import sys\r\ninput = sys.stdin.buffer.readline \r\n\r\n\r\n \r\ndef process(A, Queries):\r\n n = len(A)\r\n M = [A]\r\n for i in range(n-1):\r\n row = M[-1]\r\n new_row = []\r\n for j in range(len(row)-1):\r\n new_row.append(row[j]^row[j+1])\r\n M.append(new_row)\r\n M2 = [A]\r\n for i in range(1, n):\r\n new_row = []\r\n for j in range(len(M[i-1])-1):\r\n new_row.append(max(M2[i-1][j], M2[i-1][j+1], M[i][j]))\r\n M2.append(new_row)\r\n for l, r in Queries:\r\n print(M2[r-l][l-1])\r\n return\r\n\r\nn = int(input())\r\nA = [int(x) for x in input().split()]\r\nq = int(input())\r\nQueries = []\r\nfor i in range(q):\r\n l, r = [int(x) for x in input().split()]\r\n Queries.append([l, r])\r\nprocess(A, Queries)\r\n ", "import sys\r\ninput=sys.stdin.readline\r\nn=int(input())\r\nar=list(map(int,input().split()))\r\ndic={}\r\nli=[]\r\nfor i in range(n):\r\n xx=[]\r\n for j in range(n-i):\r\n xx.append(0)\r\n li.append(xx.copy())\r\nfor i in range(n):\r\n for j in range(n-i):\r\n if(i==0):\r\n li[i][j]=ar[j]\r\n else:\r\n li[i][j]=li[i-1][j]^li[i-1][j+1]\r\nfor i in range(1,n):\r\n for j in range(n-i):\r\n li[i][j]=max(li[i][j],li[i-1][j],li[i-1][j+1])\r\nfor _ in range(int(input())):\r\n l,r=map(int,input().split())\r\n print(li[r-l][l-1])", "import sys\r\nimport io, os\r\ninput = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\nA = list(map(int, input().split()))\r\n\r\ndp = [[0]*n for i in range(n)]\r\nfor i in range(n):\r\n dp[0][i] = A[i]\r\nfor i in range(1, n):\r\n for j in range(n-i):\r\n dp[i][j] = dp[i-1][j]^dp[i-1][j+1]\r\n#print(dp)\r\n\r\nfor i in range(1, n):\r\n for j in range(n-i):\r\n dp[i][j] = max(dp[i][j], dp[i-1][j], dp[i-1][j+1])\r\n\r\nq = int(input())\r\nfor i in range(q):\r\n l, r = map(int, input().split())\r\n l, r = l-1, r-1\r\n print(dp[r-l][l])\r\n", "def main():\n n = int(input())\n a = list(map(int, input().split(' ')))\n array = []\n array.append(a)\n \n for i in range(n - 1):\n aux = []\n for j in range(1, len(array[-1])):\n xor = array[-1][j-1] ^ array[-1][j]\n aux.append(xor)\n array.append(aux)\n \n for j in range(1, len(array)):\n for k in range(len(array[j])):\n maximo = max(array[j][k], array[j-1][k], array[j - 1][k + 1])\n array[j][k] = maximo\n \n q = int(input())\n for i in range(q):\n l, r = map(int, input().split(' '))\n print(str(array[r - l][l - 1]))\n\nmain()\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\n\r\naux = [[0] * n for i in range(n)]\r\n\r\nfor i in range(n):\r\n aux[0][i] = arr[i]\r\n\r\nfor i in range(1, n):\r\n for j in range(n-i):\r\n aux[i][j] = aux[i-1][j] ^ aux[i-1][j+1]\r\n \r\nfor i in range(1, n):\r\n for j in range(n-i):\r\n aux[i][j] = max(aux[i][j], aux[i-1][j], aux[i-1][j+1])\r\n \r\nq = int(input())\r\nfor i in range(q):\r\n buscaEsquerda, buscaDireita = map(int, input().split())\r\n buscaEsquerda, buscaDireita = buscaEsquerda-1, buscaDireita-1\r\n print(aux[buscaDireita-buscaEsquerda][buscaEsquerda])", "def pyramid(arr, n):\r\n\r\n mtx = [[0] * n for _ in range(n)]\r\n \r\n for i in range(n):\r\n mtx[0][i] = arr[i]\r\n \r\n for i in range(1, n):\r\n for j in range(n - i):\r\n mtx[i][j] = mtx[i-1][j] ^ mtx[i-1][j+1]\r\n \r\n for i in range(1, n):\r\n for j in range(n - i):\r\n mtx[i][j] = max(mtx[i][j], mtx[i-1][j], mtx[i-1][j+1])\r\n\r\n q = int(input())\r\n\r\n for _ in range(q):\r\n l, r = list(map(int, input().split()))\r\n l -= 1\r\n r -= 1\r\n print(mtx[r - l][l])\r\n\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\n \r\npyramid(arr, n)\r\n ", "#t=int(input())\r\nt=1\r\nfor _ in range(t):\r\n n=int(input())\r\n l=list(map(int,input().split()))\r\n dp=[[0 for j in range(n)] for i in range(n)]\r\n for i in range(n):\r\n dp[0][i]=l[i]\r\n for i in range(1,n):\r\n for j in range(n-i):\r\n dp[i][j]=dp[i-1][j]^dp[i-1][j+1]\r\n \r\n for i in range(1,n):\r\n for j in range(n-i):\r\n dp[i][j]=max(dp[i][j],dp[i-1][j],dp[i-1][j+1])\r\n \r\n q=int(input())\r\n for __ in range(q):\r\n x,y=map(int,input().split())\r\n x-=1\r\n y-=1\r\n print(dp[y-x][x])", "tamanho = int(input())\nelementos = list(map(int, input().split()))\n \nmatrix = [[0] * tamanho for i in range(tamanho)]\n \nfor i in range(tamanho):\n matrix[0][i] = elementos[i]\n \nfor i in range(1, tamanho):\n for j in range(tamanho-i):\n matrix[i][j] = matrix[i-1][j] ^ matrix[i-1][j+1]\n \nfor i in range(1, tamanho):\n for j in range(tamanho-i):\n matrix[i][j] = max(matrix[i][j], matrix[i-1][j], matrix[i-1][j+1])\n \nnum_buscas = int(input())\nfor i in range(num_buscas):\n busca_l, busca_r = map(int, input().split())\n busca_l, busca_r = busca_l-1, busca_r-1\n print(matrix[busca_r-busca_l][busca_l])", "from typing import List\r\nfrom collections import Counter, OrderedDict, deque, defaultdict\r\nfrom itertools import combinations, permutations\r\nfrom functools import cmp_to_key, reduce\r\nimport heapq\r\nimport random\r\nimport math\r\nimport copy\r\nimport traceback\r\nimport 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\nsys.stdin = IOWrapper(sys.stdin)\r\ninput = lambda: sys.stdin.readline().rstrip('\\r\\n').rstrip('\\n')\r\n\r\n###################################################################################\r\n\r\n\r\nclass Node:\r\n def __init__(self, val, left, right) -> None:\r\n self.val = val\r\n self.max = val\r\n self.left = left\r\n self.right = right\r\n\r\nlookup = None\r\ndef prepare_lookup(arr, n):\r\n global lookup\r\n lookup = [[0] * n for _ in range(n)]\r\n t = [None] * n\r\n for i, x in enumerate(arr):\r\n t[i] = Node(x, i, i)\r\n lookup[i][i] = x\r\n while len(t) > 1:\r\n nt = []\r\n for i in range(len(t) - 1):\r\n l = t[i].left\r\n r = t[i + 1].right\r\n x = Node(t[i].val ^ t[i + 1].val, l, r)\r\n x.max = max(x.max, t[i].max, t[i + 1].max)\r\n lookup[l][r] = x.max\r\n nt.append(x)\r\n t = nt\r\n\r\ndef solve(q_list):\r\n for q in q_list:\r\n l, r = q\r\n print(lookup[l - 1][r - 1])\r\n\r\nn = int(input())\r\narr = list(map(int, input().split(' ')))\r\nprepare_lookup(arr, n)\r\nql = int(input())\r\nq = []\r\nfor _ in range(ql):\r\n q.append(list(map(int, input().split(' '))))\r\nsolve(q)\r\n", "from sys import stdin\n\n\ndef main():\n n = int(input())\n aa = list(map(int, input().split()))\n dp = [aa]\n for i in range(n - 1, 0, -1):\n aa = aa[:]\n for j in range(i):\n aa[j] ^= aa[j + 1]\n del aa[-1]\n dp.append(aa)\n aa = dp[0]\n for i, bb in enumerate(dp[1:], 1):\n a = aa[0]\n for j, b in enumerate(bb):\n c = aa[j + 1]\n bb[j] = max(a, b, c)\n a = c\n aa = bb\n input()\n res = stdin.read().splitlines()\n for i, s in enumerate(res):\n lo, hi = map(int, s.split())\n res[i] = str(dp[hi - lo][lo - 1])\n print('\\n'.join(res))\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\nvalues = list(map(int, input().split()))\nqueries = int(input())\n\ndp = [[0] * 5009 for i in range(5009)]\n\nfor i in range(n):\n dp[0][i] = values[i]\n\nfor i in range(1, n): # 0 is already populated\n for j in range(n-i+1):\n top = dp[i-1][j]\n right = dp[i-1][j+1]\n dp[i][j] = top ^ right\n\nfor i in range(1, n):\n for j in range(n-i+1):\n top = dp[i-1][j]\n right = dp[i-1][j+1]\n dp[i][j] = max(right, max(dp[i][j], top))\n\nfor i in range(queries):\n left, right = map(int, input().split())\n last_row = (right - 1) - (left - 1)\n last_column = (left - 1)\n print(dp[last_row][last_column])\n \n\n\n", "# coding: utf-8\n\nn = int(input())\narr = list(map(int, input().split()))\n\nmatrix = [[0] * n for _ in range(n)]\n\nfor i in range(n):\n matrix[0][i] = arr[i]\n\nfor i in range(1, n):\n for j in range(n - i):\n matrix[i][j] = matrix[i-1][j] ^ matrix[i-1][j+1]\n\nfor i in range(1, n):\n for j in range(n - i):\n matrix[i][j] = max(matrix[i][j], matrix[i-1][j], matrix[i-1][j+1])\n\nqueries = int(input())\nresponses = []\nwhile queries > 0:\n l, r = list(map(int, input().split()))\n l -= 1\n r -= 1\n responses.append(matrix[r - l][l])\n queries -= 1\n\nfor response in responses:\n print(response)", "def xorPiramid(n, arrayAs, q, query):\r\n arrayAsPopulada = [[0 for j in range(0, n - i)] for i in range(0, n)]\r\n\r\n for i in range(0, n):\r\n arrayAsPopulada[0][i] = arrayAs[i]\r\n \r\n for i in range(1, n):\r\n for j in range(0, n - i):\r\n arrayAsPopulada[i][j] = arrayAsPopulada[i - 1][j] ^ arrayAsPopulada[i - 1][j + 1]\r\n \r\n for i in range(1, n):\r\n for j in range(0, n - i):\r\n arrayAsPopulada[i][j] = max(max(arrayAsPopulada[i][j],arrayAsPopulada[i - 1][j]),arrayAsPopulada[i - 1][j + 1])\r\n\r\n for i in range(0, q):\r\n print (arrayAsPopulada[query[i][1] - query[i][0]][query[i][0] - 1])\r\n\r\nn = int(input())\r\narrayAs = [int(a) for a in input().split()]\r\nq = int(input())\r\nquery = [[int(a) for a in input().split()] for i in range(0, q)]\r\nxorPiramid(n, arrayAs, q, query)\r\n", "n=int(input()); lista=[[-1 for i in range(n+1)]for j in range(n+1)]; lista[0] = list(map(int,input().split()));q=int(input())\r\nfor i in range(1,n): \r\n for j in range(n-i): \r\n lista[i][j] = lista[i-1][j]^lista[i-1][j+1]\r\nfor i in range(1,n):\r\n for j in range(n-i):\r\n lista[i][j] = max(lista[i-1][j],lista[i-1][j+1], lista[i][j])\r\nfor i in range(q):\r\n val= input().split()\r\n print(lista[int(val[1])-int(val[0])][int(val[0])-1])", "n = int(input())\r\n*a, = map(int, input().split())\r\ndp = [[0 for i in range(n + 1)] for j in range(n + 1)]\r\nfor i in range(n):\r\n dp[0][i] = a[i]\r\nfor i in range(1, n):\r\n for j in range(n - i + 1):\r\n dp[i][j] = dp[i - 1][j] ^ dp[i - 1][j + 1]\r\nfor i in range(1, n):\r\n for j in range(n - i):\r\n dp[i][j] = max(dp[i][j], dp[i - 1][j], dp[i - 1][j + 1])\r\nfor i in range(int(input())):\r\n l, r = map(int, input().split())\r\n print(dp[r - l][l - 1])", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nq = int(input())\r\nvec = [[int(x) for x in input().split()] for i in range(0, q)]\r\nax = [[0 for j in range(0, n - i)] for i in range(0, n)]\r\n \r\nfor i in range(0, n):\r\n ax[0][i] = a[i]\r\n \r\nfor i in range(1, n):\r\n for j in range(0, n - i):\r\n ax[i][j] = ax[i - 1][j] ^ ax[i - 1][j + 1]\r\n \r\nfor i in range(1, n):\r\n for j in range(0, n - i):\r\n ax[i][j] = max(max(ax[i][j], ax[i - 1][j]), ax[i - 1][j + 1])\r\n \r\nfor i in range(0, q):\r\n print (ax[vec[i][1] - vec[i][0]][vec[i][0] - 1])", "n=int(input())\r\n \r\ndp=[[-1 for i in range(n+1)]for j in range(n+1)]\r\n \r\ndp[0] = list(map(int,input().split()))\r\nfor i in range(1,n):\r\n for j in range(n-i):\r\n dp[i][j] = dp[i-1][j]^dp[i-1][j+1]\r\n \r\nfor i in range(1,n):\r\n for j in range(n-i):\r\n dp[i][j] = max(dp[i-1][j],dp[i-1][j+1], dp[i][j])\r\n \r\nq=int(input())\r\nfor i in range(q):\r\n l, r = map(int, input().split())\r\n print(dp[r-l][l-1])", "from collections import *\r\nfrom itertools import *\r\nfrom functools import *\r\nfrom heapq import *\r\nimport sys,math\r\ninput = sys.stdin.readline\r\n\r\n\r\n \r\nn = int(input())\r\na = list(map(int,input().split()))\r\nb = [[0]*(n+1) for _ in range(n)]\r\nfor i in range(n):\r\n b[i][i+1] = a[i]\r\n\r\nfor i in range(2,n+1):\r\n for j in range(n+1-i):\r\n b[j][j+i] = b[j][j+i-1]^b[j+1][j+i]\r\n\r\nclass ss_max():\r\n \r\n def __init__(self,b):\r\n \r\n self.n = len(b)\r\n n = self.n\r\n self.B = [[-1]*(n+1) for _ in range(n)]\r\n for i in range(n):\r\n self.B[i][i+1] = b[i][i+1]\r\n \r\n for d in range(2,n+1):\r\n \r\n for i in range(n+1-d):\r\n \r\n self.B[i][i+d] = max(self.B[i][i+d-1],self.B[i+1][i+d],b[i][i+d])\r\n \r\n def query(self,l,r):\r\n return self.B[l][r]\r\n \r\n\r\nss = ss_max(b)\r\n\r\nq = int(input())\r\nfor _ in range(q):\r\n l,r = map(int,input().split())\r\n l -= 1\r\n r -= 1\r\n print(ss.query(l,r+1))\r\n\r\n ", "def solution(n, As, q, query):\r\n ap = [[0 for j in range(0, n - i)] for i in range(0, n)] \r\n for i in range(0, n):\r\n ap[0][i] = As[i] \r\n for i in range(1, n):\r\n for j in range(0, n - i):\r\n ap[i][j] = ap[i - 1][j] ^ ap[i - 1][j + 1] \r\n for i in range(1, n):\r\n for j in range(0, n - i):\r\n ap[i][j] = max(max(ap[i][j],ap[i - 1][j]),ap[i - 1][j + 1]) \r\n for i in range(0, q):\r\n print (ap[query[i][1] - query[i][0]][query[i][0] - 1])\r\n \r\nn = int(input())\r\nAs = [int(a) for a in input().split()]\r\nq = int(input())\r\nquery = [[int(a) for a in input().split()] for i in range(0, q)]\r\nsolution(n, As, q, query)", "size = int(input())\r\na = list(map(int, input().split()))\r\ns = int(input())\r\naux = [[0 for x in range(size+1)] for y in range(size+1)] \r\n \r\nfor i in range(size):\r\n aux[0][i] = a[i]\r\n \r\nfor i in range(1, size):\r\n for j in range(0, size - i + 1):\r\n aux[i][j] = aux[i - 1][j + 1] ^ aux[i - 1][j]\r\n \r\nfor i in range(1, size):\r\n for j in range(0, size - i):\r\n aux[i][j] = max(aux[i][j], aux[i - 1][j], aux[i - 1][j + 1])\r\n \r\n \r\nfor i in range(s):\r\n l, r = list(map(int, input().split()))\r\n l -= 1\r\n print(aux[r - l - 1][l])\r\n", "import sys\r\nimport copy\r\nfrom collections import deque\r\nimport heapq\r\nimport math\r\nimport bisect\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\nprintf = lambda d: sys.stdout.write(str(d) + \"\\n\")\r\n\r\nINF = 9999999999999999999\r\n\r\n\r\n# sys.setrecursionlimit(100000)\r\n\r\n\r\ndef read():\r\n line = sys.stdin.readline().strip()\r\n while not line:\r\n line = sys.stdin.readline().strip()\r\n return map(int, line.split())\r\n\r\n\r\nclass Edge:\r\n v = 0\r\n w = 0\r\n ne = 0\r\n\r\n\r\ndef add(a, b, c):\r\n global idx\r\n e[idx].v = b\r\n e[idx].w = c\r\n e[idx].ne = h[a]\r\n h[a] = idx\r\n idx += 1\r\n\r\n\r\ndef do(l, r):\r\n tmp = copy.deepcopy(a[l:r + 1])\r\n while len(tmp) != 1:\r\n for i in range(len(tmp) - 1):\r\n tmp[i] ^= tmp[i + 1]\r\n tmp.pop(-1)\r\n return tmp[0]\r\n\r\n\r\nn = int(input())\r\na = list(read())\r\na = [0] + a\r\nq = int(input())\r\ndp = [[0] * (n + 1) for _ in range(n + 1)]\r\nf = [[0] * (n + 1) for _ in range(n + 1)]\r\nfor i in range(1, n + 1):\r\n f[i][i] = dp[i][i] = a[i]\r\n\r\nfor len in range(2, n + 1):\r\n for l in range(1, n + 1 - len + 1):\r\n r = len + l - 1\r\n dp[l][r] = dp[l][r-1] ^ dp[l+1][r]\r\n f[l][r] = max(f[l][r-1], f[l+1][r])\r\n f[l][r] = max(f[l][r], dp[l][r])\r\n\r\n\r\nfor _ in range(q):\r\n l, r = read()\r\n print(f[l][r])\r\n\r\n\r\n", "n = int(input())\r\nmatrix = [[0] * n for i in range(n)]\r\ng = [[0] * n for i in range(n)]\r\n\r\ninpt = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n matrix[i][i] = inpt[i]\r\n\r\nfor i in range(n - 1, -1, -1):\r\n for j in range(i + 1, n):\r\n a = matrix[i][j - 1]\r\n b = matrix[i + 1][j]\r\n xor = a ^ b\r\n matrix[i][j] = xor\r\n\r\nfor i in range(n - 1, -1, -1):\r\n for j in range(i + 1, n):\r\n a = matrix[i][j - 1]\r\n b = matrix[i + 1][j]\r\n matrix[i][j] = max(matrix[i][j], a, b)\r\n\r\nm = int(input())\r\nfor i in range(m):\r\n query = list(map(int, input().split()))\r\n print(matrix[query[0] - 1][query[1] - 1])\r\n" ]

[ "import sys\nfrom collections import defaultdict\n\nreadline = sys.stdin.readline\n\ndef score_word(word: str, subs: dict, graph:defaultdict):\n tmp = {}\n for i in range(len(word)):\n v, m = 0, 0\n for j in range(i, len(word)):\n val = ord(word[j]) - ord('a') + 1\n v += val\n m = max(val, m)\n sub = word[i:j + 1]\n graph[sub[:-1]].add(sub)\n graph[sub[1:]].add(sub)\n tmp[sub] = v * m\n for sub in tmp:\n if sub in subs:\n subs[sub][0] += 1\n else:\n subs[sub] = [1, tmp[sub]]\n\nsubs = {} \ngraph = defaultdict(set)\ndef score(word:str) -> int:\n if word in subs:\n return sum(subs[word])\n return 0\n\nN = int(readline())\ninputs = []\nfor _ in range(N):\n word = readline().strip()\n inputs.append(word)\n score_word(word, subs, graph)\n\ncache = {}\ndef dfs(word:str) ->tuple:\n if word in cache:\n return cache[word]\n result = (0, 0, 0)\n for nword in graph[word]:\n w, score1, score2 = dfs(nword)\n result = max(result, (1 - w, - score2 + score(nword), - score1))\n cache[word] = result\n return result\n\ndfs('')\nif cache[''][0] == 1:\n print('First')\nelse:\n print('Second')\nprint(cache[''][1], - cache[''][2])\n" ]

[ "import heapq\r\nimport sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef dijkstra(s, n):\r\n dist = [inf] * n\r\n dist[s] = 0\r\n visit = [0] * n\r\n p = []\r\n heapq.heappush(p, (dist[s], s))\r\n while p:\r\n d, u = heapq.heappop(p)\r\n if dist[u] < d:\r\n continue\r\n visit[u] = 1\r\n for v, c in G[u]:\r\n nd = dist[u] + c\r\n if not visit[v] and nd < dist[v]:\r\n dist[v] = nd\r\n heapq.heappush(p, (dist[v], v))\r\n return dist\r\n\r\nn, m, k = map(int, input().split())\r\nd = dict()\r\ne = []\r\nfor i in range(k):\r\n a, b = map(int, input().split())\r\n d[(a, b)] = i\r\n e.append((a, b))\r\nl = n + m + k + 1\r\nG = [[] for _ in range(l)]\r\nv = [(1, 0), (-1, 0), (0, 1), (0, -1)]\r\nfor i in range(k):\r\n x, y = e[i]\r\n for dx, dy in v:\r\n nx, ny = x + dx, y + dy\r\n if (nx, ny) in d:\r\n G[i].append((d[(nx, ny)], 0))\r\n G[i].append((k + x, 1))\r\n G[i].append((k + n + y, 1))\r\n for j in range(max(x - 2, 1), min(x + 2, n) + 1):\r\n G[j + k].append((i, 0))\r\n for j in range(max(y - 2, 1), min(y + 2, m) + 1):\r\n G[j + k + n].append((i, 0))\r\ninf = pow(10, 9) + 1\r\ndist = dijkstra(d[(1, 1)], l)\r\nif (n, m) in d:\r\n ans = dist[d[(n, m)]]\r\nelse:\r\n ans = inf\r\n for a, b in e:\r\n if n - 1 <= a or m - 1 <= b:\r\n ans = min(ans, dist[d[(a, b)]] + 1)\r\nans = (ans + 1) % (inf + 1) - 1\r\nprint(ans)" ]

[ "n, m = map(int, input().split())\na = list(map(int, input().split()))\nd = {i:0 for i in range(1, m+1)}\n\nfor num in a:\n d[num] += 1\n\nn_sum = 0\nfor i in range(1, m+1):\n n_sum += d[i]*(d[i]-1)//2\n\nprint(int(n*(n-1)/2 - n_sum))", "import math\r\n\r\nn, m = map(int, input().split(' '))\r\na = list(map(int, input().split(' ')))\r\ncnt = {}\r\nfor i in a:\r\n if i not in cnt:\r\n cnt[i] = 0\r\n cnt[i] += 1\r\n\r\ntotalComb = math.comb(len(a), 2)\r\nfor i in cnt:\r\n if cnt[i] >= 2:\r\n totalComb -= math.comb(cnt[i], 2)\r\nprint(totalComb)\r\n", "n, m = map(int, input().split())\r\nbooks_per_genre = [0]*m\r\nbooks = list(map(int, input().split()))\r\nfor book in books:\r\n books_per_genre[book-1] += 1\r\nresult = 0\r\nused = 0\r\nfor genre in books_per_genre:\r\n result += (genre*(n-genre-used))\r\n used += genre\r\nprint(result)\r\n", "\r\nn,m=map(int,input().split())\r\nans=0\r\nl=list(map(int,input().split()))\r\n\r\nd=[0 for i in range(m)]\r\nfor i in l:\r\n d[i-1]+=1\r\n\r\nval=[i for i in d]\r\n\r\nfor i in range(len(val)-2,-1,-1):\r\n val[i]+=val[i+1]\r\n\r\nfor i in range(m-1):\r\n ans+=d[i]*(val[i+1])\r\n\r\nprint(ans)\r\n", "import sys\nfrom collections import Counter\n\ndef solve(nb_books, nb_genres, books):\n counter = Counter(books)\n nb_possibilities = 0\n nb_seen = 0\n for genre, count in counter.items():\n nb_remaining_books = max(0, nb_books - nb_seen - count)\n nb_possibilities += (count * nb_remaining_books)\n nb_seen += count\n return nb_possibilities\n\nassert solve(4, 3, [2, 1, 3, 1]) == 5\nassert solve(7, 4, [4, 2, 3, 1, 2, 4, 3]) == 18\n\nnb_books, nb_genres = map(int, input().strip().split(' '))\nbooks = input().strip().split(' ')\nprint(solve(nb_books, nb_genres, books))\n", "#609 B Best Gift\r\n#1. Create a list of genre and count how many book of each genre\r\n#2. with each genre, number of way to choose gift: number_of_books_in_this_genre * (number_of_books_of_other_genres)\r\n\r\nnumber_of_books, number_of_genres = map(int, input().split())\r\n\r\ncount_genres = number_of_genres*[0]\r\n\r\ntype_of_each_book = list(map(int, input().split()))\r\n\r\nfor book in type_of_each_book:\r\n\tcount_genres[book-1] += 1\r\n\t\r\ntotal_ways = 0\r\n\r\nfor index, count in enumerate(count_genres):\r\n\ttotal_ways += count * sum(count_genres[index+1:])\r\n\t\r\nprint(total_ways)", "if __name__ == '__main__':\r\n n, m = list(map(int,input().split()))\r\n a = list(map(int, input().split()))\r\n\r\n res = 0\r\n\r\n count = [0] * m\r\n for x in a:\r\n count[x-1]+=1\r\n\r\n for i in range(0,m-1):\r\n for j in range(i+1,m):\r\n res += count[i]*count[j]\r\n\r\n print(res)\r\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nd = {}\r\nfor i in a:\r\n if i not in d:\r\n d[i] = 0\r\n d[i] += 1\r\ns = 0\r\nss = 0\r\nfor i in d:\r\n s += d[i]\r\n ss += d[i] * d[i]\r\nprint((s * s - ss) // 2)", "n,m = list(map(int,input().split()))\r\narr = list(map(int,input().split()))\r\nmapper = {}\r\nfor i in arr:\r\n if i in mapper:\r\n mapper[i]+=1\r\n else:\r\n mapper[i] = 1\r\nfreq = []\r\nfor i in mapper:\r\n freq.append(mapper[i])\r\nans = 0\r\nfor i in range(len(freq)):\r\n for j in range(i+1,len(freq)):\r\n ans+=(freq[i]*freq[j])\r\nprint(ans)", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\ncnt = [0] * (m + 1)\r\nfor x in a:\r\n cnt[x] += 1 \r\n\r\nres = 0\r\nfor i in range(1, m):\r\n for j in range(i + 1, m + 1):\r\n res += cnt[i] * cnt[j]\r\n\r\nprint(res)\r\n\r\n\r\n", "n,m = map(int,input().split())\na = list(map(int,input().split()))\nimport collections\nc = collections.Counter(a)\ncount = 0\nB = []\nfor i in c:\n B.append(c[i])\nfor i in range(len(B)):\n for j in range(i + 1,len(B)):\n count += B[i]*B[j]\nprint(count)", "nurray = input().split()\r\nA = list(input().split())\r\nA = [int(x) for x in A]\r\ndem = 0\r\nfor i in range(1,int(nurray[1])+1):\r\n dt = A.count(i)\r\n dem += 0.5*dt*(dt-1)\r\nct = 0.5*(int(nurray[0])*(int(nurray[0])-1)) - dem;\r\nprint(int(ct))", "n,k = map(int,input().split())\r\nt=[0]*(k+1)\r\nfor i in map(int,input().split()):\r\n t[i]+=1\r\np=sum(t)\r\ns=0\r\nfor i in range(1,k):\r\n s+=t[i]*(p-t[i])\r\n p-=t[i]\r\nprint(s)", "n, m = [ int(x) for x in input().split() ]\r\nans = 0\r\nt = n\r\nd = {}\r\nx = list(map(int, input().split()))\r\nfor e in x:\r\n if e in d:\r\n d[e] += 1\r\n else:\r\n d[e] = 1\r\nfor i in d:\r\n t -= d[i]\r\n ans += t * d[i]\r\nprint(ans)\r\n", "\r\nn,m = map(int,input().split())\r\n\r\ngenres = list(map(int,input().split()))\r\n\r\ncount = [0]*m\r\nfor i in range(n):\r\n count[genres[i]-1]+=1\r\n\r\npre = [0]\r\nfor i in range(m):\r\n pre.append(pre[-1]+count[i])\r\n \r\n#print(pre)\r\n\r\nans = 0\r\nfor i in range(m):\r\n ans += count[i]* (pre[-1] - pre[i+1])\r\n\r\n\r\nprint(ans)\r\n", "n, m = map(int, input().split())\ngenres = [0] * (m + 1)\n\nfor book in input().split():\n genres[int(book)] += 1\n\ntotal = n * (n-1) // 2\nfor genre in genres:\n total -= genre * (genre - 1) // 2\n\nprint(total)", "def flower(c, lst):\r\n bk=[0]*(c+1)\r\n for i in lst:\r\n if i<1 or i>c:\r\n return -1\r\n bk[i]+=1\r\n ans=0\r\n for i in range(1,c):\r\n for j in range(i+1,c+1):\r\n ans+=bk[i]*bk[j]\r\n return ans\r\n\r\n\r\nn,c=map(int,input().split())\r\nlst=list(map(int,input().split()))\r\nprint(flower(c,lst))\r\n\r\n", "n,m=[int(x) for x in input().split()]\r\ns=[int(x) for x in input().split()]\r\n#print (choose_book(s))\r\n\r\ndef fast_choose_book(list_of_books,m):\r\n counts={}\r\n num_options=0\r\n for book in list_of_books:\r\n if book in counts:\r\n counts[book]+=1\r\n else:\r\n counts[book]=1\r\n for i in range(1, m+1):\r\n for j in range(i+1,m+1):\r\n num_options+=counts[i]*counts[j] \r\n return num_options\r\nprint (fast_choose_book(s,m))", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\ngenres = [0] * m\r\n\r\ncnt = 0\r\nfor x in a:\r\n genres[x - 1] += 1\r\n\r\nfor x in genres:\r\n cnt = cnt + x * (n - x)\r\nprint(cnt // 2)\r\n", "from collections import *\r\nn,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nd=defaultdict(int)\r\nfor i in l:\r\n d[i]+=1\r\nx=list(d.values())\r\ns=sum(x)\r\nk=len(x)\r\nc=0\r\nfor i in range(k-1):\r\n s=s-x[i]\r\n c=c+s*x[i]\r\nprint(c)\r\n", "def main():\r\n n, m = map(int, input().split())\r\n books = list(map(int, input().split()))\r\n genre = [0] * m\r\n for x in books:\r\n genre[x - 1] += 1\r\n\r\n options = 0\r\n for i in range(m - 1):\r\n for j in range(i + 1, m):\r\n options += genre[i] * genre[j]\r\n\r\n print(options)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, m=map(int, input().split())\r\nl=[int(x) for x in input().split()]\r\nd={}\r\nfor x in l:\r\n\tif x not in d:\r\n\t\td[x]=1\r\n\telse:\r\n\t\td[x]+=1\r\nans=(n*(n-1))//2\r\nfor x in d:\r\n\tans-=(d[x]*(d[x]-1))//2\r\nprint(ans)", "# 609B\r\n\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\ntmp1 = int((n-1)*(n)/2)\r\n\r\nb = {}\r\nfor item in a:\r\n b[item] = b.get(item, 0) + 1\r\n\r\ntmp2 = 0\r\nfor item in b.values():\r\n if item > 1:\r\n tmp2 += int(item*(item-1)/2)\r\nprint(tmp1 - tmp2)\r\n\r\n\r\n# 7 4\r\n# 4 2 3 1 2 4 3", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nd=[0]*(m+1)\r\nfor i in range(n):\r\n d[a[i]]+=1\r\n\r\npref=[0]*(m+1)\r\npref[0]=d[0]\r\nfor i in range(m+1):\r\n pref[i]=d[i]+pref[i-1]\r\nres=0\r\nfor i in range(1,m):\r\n res+=d[i]*(pref[m]-pref[i])\r\nprint(res)", "ch = input()\r\nch = ch.split()\r\nch = [int(x) for x in ch]\r\nn, m = ch\r\n#a = ch.copy()\r\n\r\nch = input()\r\nch = ch.split()\r\nch = [int(x) for x in ch]\r\nsm = 0\r\na = [0 for x in range(m)]\r\nfor i in range(n):\r\n a[ch[i]-1] +=1\r\n #sm += ch[i] * (n - ch[i])\r\nfor i in range(m):\r\n sm += a[i] * (n - a[i])\r\n n -= a[i]\r\n\r\nprint( sm)", "import sys\r\n\r\nfrom collections import Counter\r\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\r\ndef get_ints(): return map(int, sys.stdin.readline().split())\r\ndef input(): return sys.stdin.readline().strip('\\n')\r\n\r\nn,m = get_ints()\r\nl = get_array()\r\n\r\nd = Counter(l)\r\ncal = 0\r\nfor i in d:\r\n if d[i] > 1:\r\n cal += (d[i]*(d[i]-1))//2\r\n\r\nprint( n*(n-1)//2 - cal)\r\n", "# Source: https://usaco.guide/general/io\n\n\nn, m = [int(x) for x in input().split()]\n\nbooks = [int(x) for x in input().split()]\n\ngenres = [0] * 10\n\nfor book in books:\n genres[book-1] += 1\n\nways = 0\nfor i in range(10):\n for j in range(i+1,10):\n ways += genres[j] * genres[i]\n\nprint(ways)\n \t\t \t \t \t\t\t\t \t\t\t\t\t \t \t \t \t", "[n,m] = list(map(int, input().rstrip().split()))\r\na = list(map(int, input().rstrip().split()))\r\ncount = [0 for i in range(m)]\r\nfor i in range(n):\r\n count[a[i]-1] += 1\r\nquad = [count[i]**2 for i in range(m)]\r\nsomma2 = sum(count)**2\r\nsquad = sum(quad)\r\nans = (somma2 - squad)//2\r\nprint(ans)", "num_books, num_genres = [int(s) for s in input().split()]\r\ncounts = [0] * num_genres # genre -> number of books of that genre\r\nfor s in input().split():\r\n genre = int(s)\r\n counts[genre-1] += 1\r\n\r\nans = 0\r\nfor genre1 in range(num_genres):\r\n for genre2 in range(genre1 + 1, num_genres):\r\n ans += counts[genre1] * counts[genre2]\r\nprint(ans)\r\n", "from itertools import groupby\r\n\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nans = n * (n - 1) // 2\r\na.sort()\r\n\r\nli = []\r\nfor k, v in groupby(a):\r\n\tli.append(len(list(v)))\r\nfor el in li:\r\n\tans -= el * (el - 1) // 2\r\n\r\nprint(ans)", "def _input(): return map(int, input().split())\r\n\r\nn, m = _input()\r\nlst = list(_input())\r\nl = {}\r\nfor i in range(n):\r\n if lst[i] not in l: \r\n l[lst[i]] = 1\r\n else: l[lst[i]]+=1\r\nres = 0\r\nfor i in range(n):\r\n if l[lst[i]] > 1:\r\n res+=n-i-l[lst[i]]\r\n l[lst[i]]-=1\r\n else:\r\n res+=n-i-1\r\nprint(res)", "n, m = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\nb = [0] * m\r\nfor i in a:\r\n b[i - 1] += 1\r\nsum = b[0]\r\nans = 0\r\nfor i in range(1, len(b)):\r\n ans += sum * b[i]\r\n sum += b[i]\r\nprint(ans)", "n, m = map(int, input().split())\na = map(int, input().split())\ngenres = [0 for _ in range(11)]\nfor k in a:\n genres[k] += 1\n\nall_comb = n * (n - 1) // 2\neach_comb = sum(t * (t - 1) // 2 for t in genres)\nprint(all_comb - each_comb)\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(set(a))\r\nans = 0\r\nfor i in range(m - 1):\r\n for j in range(i + 1, m):\r\n ans += a.count(b[i]) * a.count(b[j])\r\nprint(ans)\r\n", "n , m = list(map(int,input().split()))\r\n\r\na = list(map(int,input().split()))\r\n\r\nmp = [0] * (m)\r\ncnt = 0 \r\n\r\nfor x in a:\r\n\tmp[x-1] += 1\r\nfor x in range(m+1):\r\n\tfor t in range(x+1,m,1):\r\n\t\tcnt += (mp[x] * mp[t])\r\n\t\t\r\nprint(cnt)\r\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\ns = [0] * m\r\nfor i in a:\r\n\ts[i - 1] += 1\r\n\r\nk = 0\r\nfor i in s:\r\n\tk += (n - i) * i\r\nprint(k // 2)", "\r\nfrom collections import Counter\r\nn, m = map(int, input().split())\r\nl = list(map(int, input().split()))\r\n\r\ncc = Counter(l)\r\nvals = list(cc.values())\r\n\r\nans = 0\r\nfor i in range(m):\r\n\tfor j in range(i + 1, m):\r\n\t\r\n\t\tans += vals[i] * vals[j]\r\n\t\r\n\r\nprint(ans)\r\n\r\n", "from collections import Counter\r\n\r\nn, m = [int(x) for x in input().split(' ')]\r\ncounter = Counter([int(x) for x in input().split(' ')])\r\nres = 0\r\nfor i in range(m):\r\n for j in range(i + 1, m + 1):\r\n res += counter[i + 1] * counter[j + 1]\r\nprint(res)\r\n", "booksNumAndGenreNum = input().split()\r\nbooksNum = int(booksNumAndGenreNum[0])\r\ngenreNum = int(booksNumAndGenreNum[0])\r\nbooks = list(map(int, input().split()))\r\nbooksPerGenre = []\r\nfor book in books:\r\n exist = False\r\n for books in booksPerGenre:\r\n if(books[0]==book):\r\n books[1] = books[1] + 1\r\n exist = True\r\n if(exist== False):\r\n booksPerGenre.append([book, 1])\r\n\r\nchoice = 0\r\nfor i in range(len(booksPerGenre) -1):\r\n for j in range(len(booksPerGenre)-1 - i):\r\n choice = choice + booksPerGenre[i][1]*booksPerGenre[j + i + 1][1]\r\n\r\nprint(choice)", "n,m = map(int, input().split())\r\nl = list(map(int, input().split()))\r\na = list(l.count(x) for x in range(1,m+1))\r\nc=0\r\nfor i in range(m-1):\r\n\tc += (a[i]*sum(a[i+1:]))\r\nprint(c)", "n, m = map(int, input().split())\r\nl = [0]*10\r\na = list(map(int, input().split()))\r\nfor i in a:\r\n l[i-1] += 1\r\n\r\nans = 0\r\n\r\nfor i in range(10):\r\n for j in range(i+1, 10):\r\n ans += l[i]*l[j]\r\nprint(ans)\r\n", "n, m = map(int, input().split())\r\na = [0 for i in range(m)]\r\nfor el in input().split(' '):\r\n a[int(el) - 1] += 1\r\nans = 0\r\nfor i in range(m):\r\n for j in range(i + 1, m):\r\n ans += a[i] * a[j]\r\nprint(ans)", "n, m = map(int, input().split())\r\narray = [i for i in map(int, input().split())]\r\n#print(array)\r\n\r\nlistofzeros = [0] * m\r\n#print(listofzeros)\r\n\r\ncount = 0\r\nmy_dict = dict()\r\nfor num in array: \r\n if num in my_dict:\r\n my_dict[num] += 1\r\n else: \r\n my_dict[num] = 1\r\n\r\nfor key, value in my_dict.items():\r\n if value > 1:\r\n count += int(value * (value - 1) / 2)\r\n#print(count)\r\nprint(int(n * (n-1) / 2 - count))", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\ncount = [0]*(15)\r\nfor book in a:\r\n count[book] += 1\r\n\r\nsum = 0\r\nfor i in range(1, m):\r\n for j in range(i + 1, m + 1):\r\n sum += count[i]*count[j]\r\nprint(sum)", "n, m = map(int, input().split())\r\njanri = list(map(int, input().split()))\r\n\r\njanri_col = {}\r\n\r\nfor i in janri:\r\n if i in janri_col.keys():\r\n janri_col[i] += 1\r\n else:\r\n janri_col[i] = 1\r\n\r\nans = 0\r\n\r\nfor i in janri_col:\r\n ans += (n - janri_col[i]) * janri_col[i]\r\n\r\nprint(ans//2)\r\n", "n, m = map(int, input().split())\r\nl = list(map(int, input().split()))\r\n\r\n\r\ncount = [0]*m\r\n\r\nfor i in l:\r\n\tcount[i - 1] += 1\r\n\r\nsum = 0\r\nfor i in range(0, m):\r\n\tfor j in range(i+1, m):\r\n\t\tsum += count[i] * count[j]\r\n\r\nprint(sum)\r\n\r\n", "n,m = [int(x) for x in input().split()]\r\n\r\nimport math\r\nfrom collections import Counter\r\nfrom itertools import combinations\r\n\r\ncnt = Counter(input().split())\r\n\r\nres = 0\r\nfor c in combinations(cnt.keys(), 2):\r\n\tres += cnt[c[0]] * cnt[c[1]]\r\nprint(res)\r\n", "n, m = [int(x) for x in input().split(\" \")]\na = [int(x) for x in input().split(\" \")]\nl = [0] * m\n\nfor i in range(n):\n l[a[i]-1] += 1\n\ncombinations = 0\nfor i in range(m-1):\n for j in l[i+1:m]:\n combinations += l[i] * j\nprint(combinations)\n\n# from math import comb\n# from itertools import combinations\n\n# n, m = [int(x) for x in input().split(\" \")]\n# a = [int(x) for x in input().split(\" \")]\n# print(comb(n,2) - len([x for x in list(combinations(a, 2)) if x[0] == x[1]]))", "n, m = map(int, input().split())\na = [0] + list(map(int, input().split()))\ncount = [0] * (m + 1)\n\nfor x in a: \n count[x] += 1\n\nans = 0\n\nfor i in range(1, m):\n for j in range(i + 1, m + 1):\n ans += count[i] * count[j]\n \nprint(ans)", "n,m = map(int, input().rstrip().split())\r\narray = list(map(int, input().rstrip().split()))\r\ns = set(array)\r\nsum1 = sum(range(n))\r\nsum2 = 0\r\nfor i in s:\r\n cnt = array.count(i)\r\n if cnt >1:\r\n sum2 += sum(range(cnt))\r\nprint(sum1-sum2)\r\n\r\n", "# http://codeforces.com/problemset/problem/609/B\r\n\"\"\"\r\nWith n of genders, m of books => (m-n) books had duplicated\r\nTinh chinh hop cua 2 trong m books - Chinh hop 2 trong (m-n)books\r\n\r\nformula : (m)! /\r\n\"\"\"\r\n\r\nduplicated_keys = {}\r\n\r\n\r\ndef calculate_chinh_hop_of_2(number_books):\r\n return int(number_books * (number_books - 1) / 2)\r\n\r\n\r\nnumber_books, number_genders = list(map(int, input().split()))\r\nnumber_data = list(map(int, input().split()))\r\nnumber_of_choosing_books = calculate_chinh_hop_of_2(number_books)\r\n\r\n# get books for per gender\r\nfor book in number_data:\r\n if book not in duplicated_keys:\r\n duplicated_keys[book] = 1\r\n else:\r\n duplicated_keys[book] += 1\r\nfor value in duplicated_keys.values():\r\n number_of_choosing_books -= calculate_chinh_hop_of_2(value)\r\nprint(number_of_choosing_books)\r\n", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Fri Jun 19 12:21:39 2020\n\n@author: shailesh\n\"\"\"\n\nn,m = [int(i) for i in input().split()]\n\nA = [int(i) for i in input().split()]\n\nm_arr = [0 for i in range(m+1)]\n\nfor i in A:\n m_arr[i] +=1\n\nA = m_arr[1:]\n\nprefix_arr = []\n\ncurr_sum = 0\nfor i in A:\n curr_sum +=i\n prefix_arr.append(curr_sum)\n\ntotal_val = 0\n\nfor i in range(len(prefix_arr)-1):\n \n total_val += A[i] *(prefix_arr[-1] - prefix_arr[i])\n# print(total_val)\nprint(total_val)", "import sys\nfrom os import path\nfrom collections import Counter\ndef get_int():\n return int(sys.stdin.readline())\ndef get_ints():\n return map(int,sys.stdin.readline().strip().split())\ndef get_string():\n return sys.stdin.readline().strip()\n\n \nt = 1\n \nfor _ in range(t):\n\tn,m = get_ints()\n\tans = n*(n-1)//2\n\ta = list(get_ints())\n\tc = Counter(a)\n\tfor i in c:\n\t\tans -= (c[i])*(c[i]-1)//2\n\tprint(ans)\n\t\t \t \t\t \t\t \t \t\t \t \t\t\t", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\ndct = dict()\r\nfor j in a:\r\n if j not in dct:\r\n dct[j] = 0\r\n dct[j] += 1\r\n# print(dct)\r\ns = 0\r\nfor j in dct.keys():\r\n s += dct[j]*(n-dct[j])\r\n\r\nprint(s//2)", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nd={}\r\nfor i in set(l):\r\n d[i]=0\r\nc=0\r\nd[l[-1]]=1\r\n#print(d)\r\nfor i in range(n-2,-1,-1):\r\n f=d[l[i]]\r\n if f==0:\r\n d[l[i]]=1\r\n else:\r\n d[l[i]]=d[l[i]]+1\r\n c=c+n-(i+1)-f\r\nprint(c)\r\n \r\n ", "n,m = [int(x) for x in input().split()]\r\ncnt = [0 for x in range(100)]\r\nfor x in [int(x) for x in input().split()]:\r\n cnt[x] += 1\r\nans = 0\r\nfor i in range(1,11):\r\n ans += (sum(cnt)-cnt[i])*cnt[i]\r\nprint(ans//2)", "n,m = map(int, input().split(' '))\r\na = list(map(int, input().split(' ')))\r\n\r\nd = {}\r\nfor i in range(m):\r\n d[i+1] = 0\r\n\r\nfor i in a:\r\n d[i] += 1\r\n\r\nr = 0\r\nfor i in range(1, m+1):\r\n r += d[i]*(n-d[i])\r\n\r\nprint(int(r/2))\r\n", "import sys\nfrom collections import Counter\n\ndef number_of_ways(books):\n n = len(books)\n c = Counter(books)\n return sum(v * (n - v) for _, v in c.items()) // 2\n \nn, m = [int(x) for x in sys.stdin.readline().strip().split()]\nbooks = [int(x) for x in sys.stdin.readline().strip().split()] \nsys.stdout.write(\"{}\\n\".format(number_of_ways(books)))\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nfrom collections import defaultdict\r\ncnt = defaultdict(int)\r\nfor x in a:\r\n\tcnt[x]+=1\r\nprint(sum(cnt[x] * cnt[y] for x in cnt for y in cnt if x < y))\r\n\t", "n,m = map(int, input().split())\r\na = list(map(int, input().split()))\r\ns = set(a)\r\ntong = sum(range(n))\r\ntong1 = 0\r\nfor i in s:\r\n\tz = a.count(i)\r\n\tif z > 1:\r\n\t\tg = sum(range(z))\r\n\t\ttong1 += g\r\nprint(tong-tong1)\t\t", "n,m=list(map(int,input().split()))\r\nA=list(map(int,input().split()))\r\ncount = 1\r\nD={}\r\nfor val in A:\r\n if val not in D:\r\n D[val]=1\r\n else:\r\n D[val]+=1\r\n count += 1\r\nAns=(n*(n-1))//2\r\nfor val in D:\r\n x=D[val]\r\n x=(x*(x-1))//2\r\n Ans -= x\r\nprint(Ans)\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\nn, m = mints()\r\nc = [0]*11\r\nfor i in mints():\r\n\tc[i] += 1\r\nr = 0\r\nfor i in range(11):\r\n\tfor j in range(i+1,11):\r\n\t\tr += c[i]*c[j]\r\nprint(r)", "n, m = map(int, input().strip().split())\r\nd = {}\r\nfor i in map(int, input().strip().split()):\r\n d[i] = d.get(i, 0) + 1\r\nans = 0\r\nfor i, v1 in enumerate(list(d.values())):\r\n for v2 in list(d.values())[i+1:]:\r\n ans += v1 * v2\r\nprint(ans)\r\n", "n, m = [int(x) for x in input().split(\" \")]\na = [int(x) for x in input().split(\" \")]\narr = [0] * m\n\nfor i in range(n):\n arr[a[i]-1] += 1\n\ncombinations = 0\nfor i in range(m-1):\n for j in arr[i+1:m]:\n combinations += arr[i] * j\nprint(combinations)\n", "a = input()\r\nn = int (a.split()[0])\r\nm = int (a.split()[1])\r\nk = (n*(n-1))/2\r\n\r\nb = list(map(int,input().split()))\r\nl = [b.count(x) for x in set(b)]\r\nfor i in l:\r\n if i>1:\r\n p = (i*(i-1))/2\r\n k = k-p\r\nprint (int(k))", "n,m=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\nl=m*[0]\r\nfor i in range(m):\r\n l[i]=a.count(i+1)\r\no=0\r\nfor i in range(m):\r\n for j in range(m):\r\n if i!=j:\r\n o+=l[i]*l[j]\r\nprint(o//2)\r\n", "n,m = map(int, input().split())\r\n\r\nbooks = list(map(int, input().split()))\r\n\r\ncBooks = [0]*m\r\n\r\nfor book in books:\r\n cBooks[book-1] += 1\r\n \r\nanswer = 0\r\n \r\nfor i in range(m):\r\n for j in range(i+1, m, 1):\r\n answer += cBooks[i]*cBooks[j]\r\n\r\n \r\nprint(answer)", "from collections import Counter\r\n\r\nI = lambda: map(int, input().split())\r\n\r\nn, _ = I()\r\n\r\nprint(sum(v*(n-v) for v in Counter(I()).values()) // 2)", "first = input()\r\nfirst = list(map(int, first.split()))\r\n\r\nn = first[0] # n books\r\nm = first[1] # m genres\r\n\r\nsecond = input()\r\nbooks = list(map(int, second.split()))\r\nbooks.sort()\r\noptions = 0\r\n\r\nfor genre in range(1, m+1):\r\n freq = books.count(genre)\r\n books = list(filter((genre).__ne__, books))\r\n count = freq*len(books)\r\n options += count\r\n\r\nprint(options)\r\n", "import sys\r\nfrom collections import Counter\r\n\r\nn, m = map(int, input().split())\r\ncnt = Counter(map(int, input().split()))\r\nans = 0\r\n\r\nfor k, v in cnt.items():\r\n n -= v\r\n ans += v * n\r\n\r\nprint(ans)\r\n", "n,m = map(int, input().split())\nA = list(map(int, input().split()))\nfrom collections import defaultdict\nd = defaultdict(lambda:0)\nfor a in A:\n d[a] += 1\nimport itertools\nans = 0\nfor c in itertools.combinations(range(1, m+1), 2):\n i, j = c\n ans += d[i]*d[j]\nprint(ans)\n", "n,m = list(map(int, input().strip().split()))\r\na = list(map(int, input().strip().split()))\r\n\r\nd = dict()\r\n\r\nfor i in a:\r\n if i in d.keys():\r\n d[i] +=1\r\n else:\r\n d[i] = 1\r\n\r\nv = d.values()\r\n\r\ns = 0\r\nsq = 0\r\n\r\nfor i in v:\r\n s += i\r\n sq += i**2\r\n\r\nprint((s**2-sq) // 2)", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\ns=0\r\nfor i in range(1,m+1):\r\n s+=(a.count(i)*(a.count(i)-1))//2\r\nprint((n*(n-1))//2-s)\r\n", "def main():\r\n n,m = map(int,input().split())\r\n books = list(map(int,input().split()))\r\n dist_books = {}\r\n for i in books:\r\n if i not in dist_books.keys():\r\n dist_books[i] = 0\r\n\r\n dist_books[i] += 1\r\n\r\n ways = 0\r\n for i in dist_books.keys():\r\n ways += dist_books[i]*(n-dist_books[i])\r\n\r\n print(ways//2)\r\n\r\n\r\nmain()\r\n", "from collections import Counter\r\nn,m=[int(j) for j in input().split()]\r\na=[int(j) for j in input().split()]\r\nb=Counter(a)\r\nc=[]\r\nfor i in range(1,m+1):\r\n if b[i]>0:\r\n c.append(b[i])\r\nd=0\r\nfor i in range(0,len(c)-1):\r\n for j in range(i+1,len(c)):\r\n d=d+(c[i]*c[j])\r\nprint(d)", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nnumcnt = [0] * m\r\nfor i in a:\r\n numcnt[i - 1] += 1\r\nans = 0\r\nfor i in range(m):\r\n for j in range(i + 1, m):\r\n ans += numcnt[i] * numcnt[j]\r\nprint(ans)", "from collections import Counter\r\nN,M = map(int,input().split())\r\nA = list(map(int,input().split()))\r\n\r\ncnt = list(Counter(A).values())\r\nl = len(cnt)\r\nruiseki = [0]*(l+1)\r\nfor i in range(l):\r\n ruiseki[i+1] = ruiseki[i] + cnt[i]\r\n\r\nans = 0\r\nfor i in range(l):\r\n ans += cnt[i]*(ruiseki[l]-ruiseki[i+1])\r\nprint(ans)", "n,m=map(int,input().split())\r\ndic={}\r\nfor i in input().split():\r\n if i not in dic:\r\n dic[i]=1\r\n else:\r\n dic[i]+=1\r\nl=list(dic.values())\r\nc=0\r\nfor i in range(len(l)):\r\n for j in range(i+1,len(l)):\r\n c+=l[i]*l[j]\r\nprint(c)\r\n", "#coding:utf-8\r\n\r\nn,m = map(int,input().split())\r\na = [0] * (m + 1)\r\nfor i in map(int, input().split()):\r\n a[i - 1] += 1\r\nans = 0\r\nfor i in range(m):\r\n for j in range(i + 1,m):\r\n ans += a[i] * a[j]\r\nprint(ans)", "import itertools\r\n# n, m = map(int, input().split())\r\n# l = list(map(int, input().split()))\r\n# l.sort()\r\n# listfinal=[]\r\n# k=[]\r\n# for i in range(len(l)+1):\r\n# i = 0\r\n# while i < len(l):\r\n# if l[i]==l[i+1]:\r\n# k.append(l[i])\r\n# l.pop(l[i])\r\n# print(k)\r\n# print(l)\r\n# for i in range(len(l)):\r\n# if l[i-1]!=l[i]:\r\n# listfinal.append(l[i])\r\n# print(listfinal)\r\n# a=m*[0]\r\n# for i in range(n):\r\n# a[l[i]-1]+=1\r\n# s=0\r\n# for i in range(m-1):\r\n# for j in a[i+1:m]:\r\n# s+=a[i]*j\r\n# list(itertools.combinations(range(len(l)), 2))\r\n# list = [(l[i],l[j]) for i in range(len(l)) for j in range(i+1, len(l))]\r\n# count = 0\r\n# # for i in range(len(list)):\r\n# # if list[i+1]!=list[i]:\r\n# # count+=1\r\n# # # list.pop(i)\r\n# # listfinal.append(list[i])\r\n# # print((list))\r\n# print(listfinal)\r\n# print(count)\r\n\r\n\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(set(a))\r\n\r\nans = 0\r\n\r\nfor i in range(m - 1):\r\n for j in range(i + 1, m):\r\n ans += a.count(b[i]) * a.count(b[j])\r\n\r\nprint(ans)\r\n\r\n", "n, m = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\nocc = [0] * m\r\n\r\nfor v in arr:\r\n occ[v - 1] += 1\r\n\r\nans = 0\r\nfor i in range(m):\r\n for j in range(i + 1, m):\r\n ans += occ[i] * occ[j]\r\n\r\nprint(ans)\r\n", "n, m = map(int, input().split())\ngenres = list(map(int, input().split()))\n\ncounter = [0] * 11\nfor genre in genres:\n counter[genre] += 1\n\nanswer = 0\nfor i in range(11):\n for j in range(i + 1, 11):\n answer += counter[i] * counter[j]\n\nprint(answer)\n", "ints = lambda: list(map(int, input().split()))\r\ng = {10:0,9:0,8:0,7:0,6:0,5:0,4:0,3:0,2:0,1:0}\r\nn, k=ints(); a = ints(); s = 0\r\nfor i in a: g[i]+=1\r\nfor i in a: s += n - g[i]; g[i] -= 1; n -= 1\r\nprint(s)", "n, m = map(int, input().split())\r\nres = [0] * m \r\ncount = 0\r\n\r\ndata = list(map(int, input().split()))\r\nfor i in data:\r\n\r\n res[i-1] += 1\r\nSum = n\r\n\r\nfor i in range (len(res)):\r\n Sum -= res[i] \r\n count += res[i] * Sum\r\n\r\n\r\nprint(count)\r\n\r\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nd=[0 for i in range(m)]\r\nfor i in range(n):\r\n\td[a[i]-1]+=1\r\nx=0\r\nfor i in range(m):\r\n\tif d[i]>1:\r\n\t\tp=d[i]*(d[i]-1)\r\n\t\tx+=p//2\r\ny=(n*(n-1))//2\r\nprint(y-x)", "n, m = map(int, input().split())\r\na = [0 for i in range(10)]\r\n\r\nfor i in map(int, input().split()):\r\n a[i - 1] += 1\r\n\r\nans = 0\r\nfor i in range(9):\r\n for j in range(i + 1, 10):\r\n ans += a[i] * a[j]\r\n\r\nprint(ans)\r\n", "a = input()\r\na = a.split()\r\nb = input()\r\nb = b.split()\r\na = list(map(lambda x: int(x), a))\r\nb = list(map(lambda x: int(x), b))\r\ntotal_case = (a[0] * (a[0] - 1)) / 2\r\ngenre_list = {}\r\nwrong_cases = 0\r\nfor i in b:\r\n if i not in genre_list:\r\n genre_list[i] = 1\r\n else:\r\n genre_list[i] += 1\r\nfor i in genre_list:\r\n wrong_cases += (genre_list[i] * (genre_list[i] - 1)) / 2\r\nprint(int(total_case - wrong_cases))", "n, m = map(int, input().split())\nl = list(map(int, input().split()))\na=m*[0]\nfor i in range(n):\n a[l[i]-1]+=1\ns=0\nfor i in range(m-1):\n for j in a[i+1:m]:\n s+=a[i]*j\nprint(s)\n \t \t\t \t \t\t \t\t \t \t \t \t", "# cook your dish here\r\nfrom collections import defaultdict\r\nn,m=map(int,input().split())\r\nl=[int(_) for _ in input().split()]\r\nd=defaultdict();c=0\r\nfor i in range(len(l)):\r\n if d.get(l[i]):\r\n d[l[i]]+=1\r\n else:\r\n d[l[i]]=1\r\nfor i in range(len(l)):\r\n d[l[i]]-=1\r\n c+=n-(i+1)-d[l[i]]\r\nprint(c) ", "first = input().split()\nsecond = input().split()\nnum, gen = int(first[0]), int(first[1])\nlst = []\nfor j in range(gen):\n a = second.count(str(j))\n lst.append(a)\nb = 0\ncount = 0\nfor i in lst:\n count += (num - b - i)*i\n b += i\nprint(count)", "nBooks, mGenres = map(int,input().split())\r\n\r\naList = list(map(int,input().split()))\r\nbookList = [0] * nBooks\r\ncount = [0] * (mGenres+1)\r\nans = 0\r\nfor x in aList:\r\n count[x] += 1\r\n\r\nfor x in count:\r\n ans += (nBooks - x) * x\r\n\r\n \r\nprint(ans//2)", "n , m = map(int , input().split())\r\na = list(map(int , input().split()))\r\nmp = {10:0,9:0,8:0,7:0,6:0,5:0,4:0,3:0,2:0,1:0}\r\nfor i in a:\r\n mp[i] += 1\r\nsum = 0\r\nfor i in a:\r\n sum += n - mp[i]\r\n mp[i] -= 1\r\n n -= 1\r\nprint(sum)\r\n", "import collections\r\nnm = list(map(int, input().split()))\r\nm = nm[1]\r\nA = list(map(int, input().split()))\r\ncounter = collections.Counter(A)\r\nB = list(counter.values())\r\nres = 0\r\nfor i in range(m):\r\n for j in range(i + 1, m, 1):\r\n res += B[i] * B[j]\r\nprint(res)\r\n", "def count_gift_ways(n: int, m: int, genres: list) -> int:\r\n\r\n if n < 2 or n > 2 * 10**5:\r\n raise ValueError(\"Invalid number of books. Must be between 2 and 200,000.\")\r\n if m < 2 or m > 10:\r\n raise ValueError(\"Invalid number of genres. Must be between 2 and 10.\")\r\n if len(genres) != n:\r\n raise ValueError(\"Number of books does not match the length of the genres list.\")\r\n \r\n genre_count = [0] * m\r\n for genre in genres:\r\n genre_count[genre - 1] += 1\r\n \r\n gift_ways = 0\r\n for count in genre_count:\r\n gift_ways += count * (n - count)\r\n\r\n return gift_ways//2\r\n\r\nn, m = map(int, input().split())\r\ngenres = list(map(int, input().split()))\r\n\r\ngift_ways = count_gift_ways(n, m, genres)\r\nprint(gift_ways)# 1698358642.258607", "from operator import *\r\nfrom functools import *\r\n\r\nB, G = map(int, input().split())\r\n\r\nA = list(map(int, input().split()))\r\n\r\nGenres = [0] * G\r\n\r\nfor a in A:\r\n Genres[a-1] += 1\r\n\r\ndef nCr(n, r):\r\n r = min(r, n-r)\r\n num = reduce(mul, range(n, n - r, - 1), 1)\r\n den = reduce(mul, range(1, r + 1), 1)\r\n return num // den\r\n\r\ntotal = nCr(B, 2)\r\n\r\nfor i in Genres:\r\n if i > 1:\r\n total -= nCr(i, 2)\r\n\r\nprint(total) \r\n \r\n ", "i, v = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nm = {}\r\nfor x in set(l):\r\n m[x] = l.count(x)\r\nt = 0\r\nfor x in range(i):\r\n m[l[x]] -= 1\r\n t += sum(m.values())-m[l[x]]\r\nprint(t)", "from collections import Counter\n\nn, m = map(int, input().split())\narr = list(map(int, input().split()))\ncount = 0\nresult = 0\n\nsort_arr = sorted(arr)\ncount_arr = list(Counter(sort_arr).values())\n\n\nfor i in range(len(count_arr)):\n result += count_arr[i] * count\n count = count_arr[i] + count\n\n\nprint(result)\n\n\n\n\n\n\n\n", "# n,m = map(lambda x: int(x), input().split())\r\n# n = int(input())\r\nimport collections\r\nimport math\r\n\r\nn,_ = map(lambda x: int(x), input().split())\r\nd = collections.defaultdict(int)\r\n\r\na = list(map(lambda x: int(x), input().split()))\r\nfor i in a: d[i] = d[i]+1\r\n\r\nans=n*(n-1)//2\r\n\r\nfor v in d.values():\r\n if v==1: continue\r\n ans-=v*(v-1)//2\r\n\r\nprint(ans)\r\n\r\n\r\n\r\n", "n,k=list(map(int,input().split()))\r\n\r\nt=list(map(int,input().split()))\r\n\r\np=0\r\n\r\n\r\nv=[0]*k\r\n\r\n\r\nfor i in range(1,k+1):\r\n v[i-1]= t.count(i)\r\n\r\n\r\nfor b in range(k-1):\r\n for j in range(b+1,k):\r\n p+= v[b]*v[j]\r\n \r\n\r\n\r\nprint(p)\r\n", "n,m = map(int,input().split())\r\nl = list(map(int,input().split()))\r\ns = 0\r\nd = {}\r\n\r\nfor i in range(n):\r\n\tif l[i] in d:\r\n\t\td[l[i]] = d[l[i]] + 1\r\n\telse: \r\n\t\td[l[i]] = 1\r\nfor i in d:\r\n\ts = s + d[i]*(d[i]-1)/2\r\nprint(int(n*(n-1)/2-s))", "n, m = list(map(int, input().split()))\na = list(map(int, input().split()))\n\nc = {}\n\nfor i in a:\n\tif i in c:\n\t\tc[i] += 1\n\telse:\n\t\tc[i] = 1\n\n#print(c)\n\nt = 0\nfor i in range(1,m+1):\n\tt += c[i]*(n-c[i])\n\nprint(t//2)", "# https://codeforces.com/contest/609/problem/B\r\n\r\nn, m = map(int, input().split())\r\nnbs = [0] * m\r\nfor ai in map(int, input().split()):\r\n nbs[ai - 1] += 1\r\n\r\nrep = 0\r\nfor i in range(m):\r\n for j in range(i + 1, m):\r\n rep += nbs[i] * nbs[j]\r\n\r\nprint(rep)\r\n", "number_of_books, number_of_genres = map(int, input().split())\r\n\r\ncount_genres = number_of_genres*[0]\r\n\r\ntype_of_each_book = list(map(int, input().split()))\r\n\r\nfor book in type_of_each_book:\r\n\tcount_genres[book-1] += 1\r\n\t\r\ntotal_ways = 0\r\n\r\nfor index, count in enumerate(count_genres):\r\n\ttotal_ways += count * sum(count_genres[index+1:])\r\n\t\r\nprint(total_ways)", "x=[]\r\nx = input().split()\r\nn = int(x[0])\r\nm = int (x[1])\r\na=[]\r\na=input().split()\r\ns={}\r\nfor i in range (n):\r\n try:\r\n s[a[i]] += 1\r\n except KeyError:\r\n s[a[i]] = 1\r\n\r\nans = n*(n-1)/2\r\nfor i in s.values():\r\n if (i != 1):\r\n ans -= i*(i-1)/2\r\nprint(int(ans))", "n, m = map(int, input().split())\r\n\r\nbooks = list(map(int, input().split()))\r\n\r\ngenres = [0] * m\r\nfor book in books:\r\n genres[book - 1] += 1\r\n\r\ntotal = 0\r\nfor i in range(m):\r\n n -= genres[i]\r\n total += genres[i] * n\r\n\r\nprint(total)", "m, n = map(int, input().split())\nl = list(map(int, input().split()))\ncnt = []\nfor i in range(1, 11):\n temp = l.count(i)\n cnt.append(temp)\n\nans = 0\nfor i in range(2, n + 1):\n for j in range(i - 1, 0, -1):\n ans += cnt[j - 1] * cnt[i - 1]\n\n\n# print(cnt)\nprint(ans)\n\n \t\t\t \t\t\t \t\t \t \t\t\t\t \t", "import sys\r\nfrom collections import Counter\r\nreadline=sys.stdin.readline\r\n\r\nN,M=map(int,readline().split())\r\nans=N*(N-1)//2\r\nfor a,c in Counter(map(int,readline().split())).items():\r\n ans-=c*(c-1)//2\r\nprint(ans)", "def total_sum(n):\n ans = 0\n for i in range(1, n):\n ans += i\n return ans\n\n\nn, m = map(int, input().split())\nx = list(map(int, input().split()))\ntotal_genres = 11 * [0]\nfor i in range(n):\n total_genres[x[i]] += 1\nans = total_sum(n)\nfor j in range(m + 1):\n if total_genres[j] > 1:\n ans -= total_sum(total_genres[j])\nprint(ans)\n", "n,m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nfrom collections import Counter\r\nc = Counter(a)\r\ns = n*n\r\nfor i in c:\r\n s-=c[i]**2\r\nprint (s//2)", "n, m = list(map(int, input().split()))\r\nls = list(map(int, input().split()))\r\nsls = set(ls)\r\ncounts = [ls.count(i) for i in sls]\r\nout = 0\r\nfor c in counts:\r\n out += c * (n - c)\r\nprint(out//2)", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nres=0\r\nfor i in range(m):\r\n c=a.count(i+1)\r\n res+=c*(n-c)\r\nprint(res//2)", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\ntotal = 0\r\ntype_list = [0] * m\r\nfor i in range(n):\r\n type_list[a[i] - 1] += 1\r\nfor j in range(m - 1):\r\n for k in range(j + 1, m):\r\n total += type_list[j] * type_list[k]\r\nprint(total)", "import sys\r\nfrom collections import Counter\r\n\r\n#sys.stdin=open('a.txt','r')\r\n\r\ndef get_string():\r\n return sys.stdin.readline().strip()\r\ndef get_input():\r\n return int(sys.stdin.readline())\r\n## get standard input\r\ndef int_input():\r\n return int(input())\r\ndef l_int_input():\r\n return list(map(int,input().split()))\r\ndef map_int():\r\n return map(int,input().split())\r\n########################################\r\nt=1\r\nn,m = map_int()\r\na = Counter(map_int())\r\nans = n*(n-1)//2\r\nfor i in range(1,m+1):\r\n ans -= a[i]*(a[i]-1)//2\r\n \r\nprint(ans)\r\n", "n,m = list(map(int,input().split()))\r\nres = 0\r\narr = list(map(int,input().split()))\r\nanswer = [0] * m\r\nfor i in range(n):\r\n answer[arr[i]-1] += 1\r\nfor i in range(m):\r\n res += (n-answer[i])*answer[i]\r\nprint(res//2)", "n, m = map(int, input().split())\r\ngenre = [0] * 11\r\nar = list(map(int, input().split()))\r\n\r\nfor x in ar:\r\n genre[x] += 1\r\n\r\ntotal = (n * (n - 1)) // 2\r\n\r\nfor y in genre:\r\n total = total - (y * (y - 1)) // 2\r\n\r\nprint(total)\r\n", "import math\r\n\r\ndef main_function():\r\n n, m = [int(i) for i in input().split(\" \")]\r\n hash_m = [0 for i in range(m + 1)]\r\n a = [int(i) for i in input().split(\" \")]\r\n for i in a:\r\n hash_m[i] += 1\r\n counter = 0\r\n sums = sum(hash_m)\r\n for i in hash_m:\r\n sums -= i\r\n counter += sums * i\r\n print(counter)\r\n\r\n\r\n\r\nmain_function()", "# Wadea #\r\n\r\nn,k = map(int,input().split())\r\narr = list(map(int,input().split()))\r\nd = dict()\r\nfor i in arr:\r\n if i in d:\r\n d[i] += 1\r\n else:\r\n d[i] = 1\r\nsum = 0\r\nans = n-1\r\nfor j in range(n-1):\r\n d[arr[j]] -= 1\r\n sum += (ans - d[arr[j]])\r\n ans -= 1\r\nprint(sum)\r\n", "n, m = map(int, input().split())\narr = list(map(int, input().split()))\nans = 0\ncount = [0] * m\n\nfor i in range(n):\n\tcount[arr[i]-1] += 1\n# print(count)\nfor i in range(m):\n\tans += count[i] * (n - count[i])\n\nprint (ans // 2)", "from collections import Counter\nn,m = map(int,input().split())\nnums = [int(x) for x in input().split()]\nb = Counter(nums)\nfreq = [[i,b[i]] for i in b]\nfreq.sort()\ncurr = 0\nans = 0\nfor i in freq:\n val = i[1]\n curr += i[1]\n ans += (n-curr)*val\nprint(ans)\n \t\t\t\t \t \t\t \t\t \t\t \t \t \t\t\t\t\t", "duplicated_keys = {}\r\n\r\n\r\ndef calculate_chinh_hop_of_2(number_books):\r\n return int(number_books * (number_books - 1) / 2)\r\n\r\n\r\nnumber_books, number_genders = list(map(int, input().split()))\r\nnumber_data = list(map(int, input().split()))\r\nnumber_of_choosing_books = calculate_chinh_hop_of_2(number_books)\r\n\r\n# get books for per gender\r\nfor book in number_data:\r\n if book not in duplicated_keys:\r\n duplicated_keys[book] = 1\r\n else:\r\n duplicated_keys[book] += 1\r\nfor value in duplicated_keys.values():\r\n number_of_choosing_books -= calculate_chinh_hop_of_2(value)\r\nprint(number_of_choosing_books)\r\n", "from collections import Counter\r\nn, m = map(int,input().split())\r\na = list(map(int,input().split()))\r\ncount = Counter(a)\r\noptions = [count[i]*(n-count[i]) for i in range(1,m+1)]\r\nprint(sum(options)//2)", "n, m = map(int, input().split())\na = [0]*(m+1)\n\nfor i in map(int, input().split()):\n a[i] += 1\n\nres = 0\nfor i in range(1, m+1):\n for j in range(i+1, m+1):\n res += a[i]*a[j]\n\nprint(res)\n", "n,m = map(int, input().split())\na = list(map(int, input().split()))\nans = 0\nfor i in range(m+1):\n for j in range(i+1, m+1):\n ans += a.count(i) * a.count(j)\nprint(ans)\n\n", "import sys\r\nimport os.path\r\nfrom collections import *\r\nimport math\r\nimport bisect\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\nelse:\r\n input = sys.stdin.readline\r\n\r\n\r\n############## Code starts here ##########################\r\n\r\nn,m = [int(x) for x in input().split()]\r\narr = [int(x) for x in input().split()]\r\n\r\nh = Counter(arr)\r\narr = []\r\nfor i in h:\r\n arr.append(h[i])\r\nres = 0\r\nfor i in range(m-1):\r\n for j in range(i+1,m):\r\n res += arr[i]*arr[j]\r\nprint(res)\r\n############## Code ends here ############################\r\n", "n, m = map(int, input().split(' '))\r\na = list(map(int, input().split(' ')))\r\n\r\ncnt = [0] * (m + 1)\r\n\r\nfor x in a:\r\n cnt[x] += 1\r\n\r\nres = n * (n - 1) // 2\r\n\r\nfor x in cnt:\r\n res -= x * (x - 1) // 2\r\n\r\nprint(res)", "from collections import Counter\r\n\r\nI = lambda: [int(x) for x in input().split()]\r\nn, m = I()\r\narr = I()\r\ncnt = Counter(arr)\r\nans = n*(n-1)//2\r\nfor x in cnt:\r\n ans -= cnt[x]*(cnt[x] - 1)//2\r\n\r\nprint(ans)", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = []\r\nfor i in range(m):\r\n b.append(a.count(i+1))\r\ncount = 0\r\nfor i in range(0,m-1,1):\r\n for j in range(i+1,m,1):\r\n count += b[i]*b[j]\r\nprint(count)", "n, m = map(int, input().split())\r\narr = []\r\nfor i in range(m+1):\r\n arr.append(0)\r\nfor x in input().split():\r\n x = int(x)\r\n arr[x] += 1\r\nl = len(arr)\r\ncnt = 0\r\nfor i in range(1, l):\r\n for j in range(i+1, l):\r\n cnt += arr[i] * arr[j]\r\nprint(cnt)\r\n\r\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\ncount = [0] * m\r\nfor x in a:\r\n count[x-1] = count[x-1] + 1\r\nans = 0\r\nfor x in count:\r\n ans += (n-x)*x\r\nans //= 2\r\nprint(ans)\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import defaultdict, deque, Counter\r\nfrom heapq import heappop, heappush\r\nfrom bisect import bisect_left, bisect_right\r\nfrom math import gcd\r\n\r\n\r\nn,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nd = defaultdict(int)\r\nfor i in range(n):\r\n d[a[i]] += 1\r\n\r\nk = list(d.keys())\r\ndp = [[0]*(m+1) for i in range(len(k) + 1)]\r\ndp[0][0] = 1\r\nfor i in range(1, len(k) + 1):\r\n ki = k[i-1]\r\n vi = d[ki]\r\n for j in range(m+1):\r\n dp[i][j] += dp[i-1][j]\r\n if j >= 1:\r\n dp[i][j] += dp[i-1][j-1] * vi\r\n \r\nprint(dp[-1][2])\r\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\ncnt = [0] * (m + 1)\r\nfor i in a:\r\n cnt[i] += 1\r\n\r\nres = 0\r\nfor i in a:\r\n res += (n - cnt[i])\r\n\r\nprint(res//2)", "n,m=map(int,input().split()) \na=list(map(int,input().split()))\nresult=0\nfor i in range(m):\n\tcount=a.count(i+1)\n\tresult+=count*(n-count)\nprint(result//2)", "from collections import Counter\r\nt=1\r\nn,m = map(int,input().split())\r\na = Counter(map(int,input().split()))\r\nans = n*(n-1)//2\r\nfor i in range(1,m+1):\r\n ans -= a[i]*(a[i]-1)//2\r\n \r\nprint(ans)\r\n", "n, m = map(int, input().split())\r\narr = list(map(int, input().split()))\r\ndict = {}\r\nfor i in range(n):\r\n genre = arr[i]\r\n if genre in dict:\r\n dict[genre] += 1\r\n else:\r\n dict[genre] = 1\r\n\r\ncount = 0\r\nfor i in range(1, m):\r\n for j in range(i + 1, m + 1):\r\n count += dict[i] * dict[j]\r\n\r\nprint(count)", "n, m = map(int, input().split())\r\nb = list(map(int, input().split()))\r\nans = 0\r\nfrq = dict()\r\nfor i in range(1, m+1):\r\n frq[i] = b.count(i)\r\nb.sort(reverse=True)\r\nx = -1\r\npast = 0\r\nfor j, i in enumerate(b):\r\n if i != x:\r\n past = len(b[j:]) - frq[i]\r\n x = i\r\n ans += past\r\n #print(n - frq[i])\r\n elif i == x:\r\n ans += past\r\n # print(past)\r\nprint(ans)\r\n", "split = lambda: list(map(int, input().split()))\r\na, b = split()\r\nbooks = split()\r\ntypes = []\r\nfor x in range(1, b + 1):\r\n types.append(books.count(x))\r\nn = 0\r\nfor x in range(b - 1):\r\n for y in range(x + 1, b):\r\n n += types[x] * types[y]\r\nprint(n)\r\n", "\n\n(n, m) = map(int, input().split())\n\na = list(map(int, input().split()))\n\ncnt = [0] * (m + 1)\n\nfor x in a:\n cnt[x] += 1\n\nans = 0\n\nfor x in range(1, m):\n y = x + 1\n while y <= m:\n ans += cnt[x] * cnt[y]\n y += 1\n\nprint(ans)\n", "def dumdumjake(n,m,a):\r\n w=0\r\n v=[0]*max(a)\r\n if n-m!=0:\r\n for i in a:\r\n v[i-1]+=1\r\n for i in v:\r\n w+=(i*(i-1))//2\r\n return((n*(n-1))//2-w)\r\nn,m = input().strip().split()\r\na = input().strip().split()\r\na = list(map(int, a))\r\nprint(dumdumjake(int(n),int(m),a))", "def combinations(num):\r\n return (num*(num-1))//2\r\ndic = {1:0,2:0,3:0,4:0,5:0,6:0,7:0,8:0,9:0,10:0}\r\nn,m = map(int,input().split())\r\narr = list(map(int,input().split()))\r\nfor i in arr:\r\n dic[i] += 1\r\nsumm = 0\r\nfor i in dic:\r\n if dic[i]>=2:\r\n summ += combinations(dic[i])\r\n elif dic[i]==0:\r\n break\r\nprint(combinations(n)-summ)", "from collections import defaultdict\r\n\r\nX = list(map(int, input().split()))\r\nMyDict = defaultdict(int)\r\nfor i in list(map(int, input().split())):\r\n MyDict[i] += 1\r\nSUM, Keys = 0, list(MyDict.keys())\r\nfor i in range(X[1]):\r\n for j in range(i+1, X[1]):\r\n SUM += MyDict[Keys[i]] * MyDict[Keys[j]]\r\nprint(SUM)\r\n\r\n# UB_CodeForces\r\n# Advice: Falling down is an accident, staying down is a choice\r\n# Location: Here in Bojnurd\r\n# Caption: Preparing for UBCOMP4 and new starting\r\n# CodeNumber: 604\r\n", "n,m = map(int,input().split())\r\n\r\narr = list(map(int,input().split()))\r\n\r\nbrr = [0] * m\r\n\r\nfor i in range(n):\r\n brr[arr[i]-1] = brr[arr[i]-1] + 1\r\n\r\nresult = 0\r\n\r\nfor i in range(m-1):\r\n result = result + brr[i]*sum(brr[i+1:])\r\n\r\nprint(result)\r\n", "from collections import Counter\nn,m=map(int,input().split())\na=dict(Counter(input().split()))\nb=[]\nketqua=0\nfor x in range(1,m+1):\n b.append(a[str(x)])\nfor i in range(0,m):\n for j in range(i+1,m):\n ketqua+=b[i]*b[j]\nprint(ketqua)", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import Counter\r\n\r\nn, m = map(int, input().split())\r\nw = list(Counter(map(int, input().split())).values())\r\ns = 0\r\nfor i in range(m):\r\n for j in range(i+1, m):\r\n s += w[i]*w[j]\r\nprint(s)", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = [0] * m\r\nfor i in range(n):\r\n b[a[i] - 1] += 1\r\ns = 0\r\nfor i in range(m - 1):\r\n for j in range(i + 1, m):\r\n s += b[i] * b[j]\r\nprint(s)\r\n", "\nfrom collections import Counter\nn,m = map(int,input().split())\na = list(map(int,input().split()))\nc = Counter(a)\nl = c.values()\ns = sum(l)\nans = 0\nfor i in l:\n s-=i\n ans+=s*i\nprint(ans)", "# loop qua mang books neu mang booksPerGenre chua co genre cuon tren thi them gia tri moi chua genre va so luong cua genre do (1)\r\n# neu mang booksPerGenre da chua genre cua cuon tren thi tang gia tri cua genre do len 1\r\n# loop qua tung genre so lua chon cong them bang tich cua so sach trong genre hien tai voi so sach trong cac genre khac con lai\r\n\r\nbooksNumAndGenreNum = input().split()\r\nbooksNum = int(booksNumAndGenreNum[0])\r\ngenreNum = int(booksNumAndGenreNum[0])\r\nbooks = list(map(int, input().split()))\r\nbooksPerGenre = []\r\nfor book in books:\r\n exist = False\r\n for books in booksPerGenre:\r\n if(books[0]==book):\r\n books[1] = books[1] + 1\r\n exist = True\r\n if(exist== False):\r\n booksPerGenre.append([book, 1])\r\n\r\nchoice = 0\r\nfor i in range(len(booksPerGenre) -1):\r\n for j in range(len(booksPerGenre)-1 - i):\r\n choice = choice + booksPerGenre[i][1]*booksPerGenre[j + i + 1][1]\r\n\r\nprint(choice)", "from collections import Counter\r\n\r\nn, m = map(int, input().split())\r\narr = input().split()\r\n\r\n\r\nc = Counter(arr)\r\n\r\ns = n * (n - 1) // 2\r\nfor i in c:\r\n s -= (c[i] * (c[i] - 1)) // 2\r\n\r\nprint(s)\r\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nt = [0 for i in range(m+1)]\r\nfor i in a:\r\n t[i] += 1\r\nres = 0\r\nfor i in range(1, m+1):\r\n for j in range(i+1, m+1):\r\n res += t[i] * t[j]\r\nprint(res)\r\n", "from collections import Counter;\r\nn,m=map(int,input().split())\r\nli=(list(map(int,input().split())))\r\ncount=dict(Counter(li))\r\nsum=(n*(n-1))/2\r\nfor k,v in count.items():\r\n if v>1:\r\n sum-=(v*(v-1))/2\r\nprint(int(sum))\r\n\r\n\r\n\r\n\r\n\r\n\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 = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\noccs = [0] * (m + 1)\r\nfor i in range(n):\r\n occs[a[i]] += 1\r\n\r\nans = 0\r\nfor i in range(m + 1):\r\n ans += occs[i] * (n - occs[i])\r\n\r\nans = ans // 2\r\nprint(ans)\r\n", "n, m = map(int, input().split())\r\nx = 0\r\na = [int(x) for x in input().split()]\r\ncount = 0\r\nsumma = 0\r\nfor i in range(1,m+1):\r\n summa += ((a.count(i))*(a.count(i)-1))//2\r\nsumma1 = (n*(n-1)//2)\r\nprint(summa1 - summa)", "from collections import Counter\r\nimport functools\r\n\r\n\r\ndef main():\r\n n, m = map(int, input().split(' '))\r\n arr = [int(i) for i in input().split(' ')]\r\n mp = Counter()\r\n for i in arr:\r\n mp[i] += 1\r\n res = 0\r\n for count in mp.values():\r\n res += count * (n - count)\r\n n -= count\r\n print(res)\r\n\r\n\r\nmain()\r\n", "from collections import defaultdict\nnum_books,num_genres=list(map(int,input().split()))\ngenres=list(map(int,input().split()))\ngenres.sort()\nnext=defaultdict(int)\ncount=0\nfor idx in range(len(genres)-1):\n if genres[idx] not in next:\n marked=False\n for rp in range(idx+1,len(genres)):\n if genres[rp]!=genres[idx]:\n next[genres[idx]]=rp\n marked=True\n break\n if not marked:\n break\n count+=(num_books-next[genres[idx]])\nprint(count)\n\t\t\t \t\t \t \t \t \t\t\t \t\t", "\nimport math\n\ndef e(x, y):\n\tif x > y: return 0\n\treturn math.factorial(y) / (math.factorial(y-x) * math.factorial(x))\n\na = input()\nb = input()\na = a.split(\" \")\nn = int(a[0])\nm = int(a[1])\nb = b.split(\" \")\nt = 0\nk = [0 for p in range(m)]\nz = 0\nfor f in b:\n\tf = int(f)\n\tk[f-1] += 1\n\tz += 1\n\tt += z - k[f-1]\n\nprint(int(t))", "n,m=map(int,input().split()) \r\na=list(map(int,input().split()))\r\nresult=0\r\nfor i in range(m):\r\n\tcount=a.count(i+1)\r\n\tresult+=count*(n-count)\r\nprint(result//2)", "n,m=map(int,input().split())\r\narr=list(map(int,input().split()))\r\ndic={}\r\nfor i in range(n):\r\n if arr[i] not in dic:\r\n dic[arr[i]]=1\r\n else:\r\n dic[arr[i]]+=1\r\nl=list(dic.values())\r\nc=0\r\nfor i in range(len(l)):\r\n for j in range(i+1,len(l)):\r\n c+=l[i]*l[j]\r\nprint(c)" ]

[ "#in the name of god\r\n#Mr_Rubick\r\na,b,c,l=map(int, input().split())\r\ncnt=(l+3)*(l+2)*(l+1)//3\r\nfor i in (a,b,c):\r\n s=2*i-a-b-c\r\n for x in range(max(0,-s),l+1):\r\n m = min(s+x,l-x)\r\n cnt-=(m+1)*(m+2)\r\nprint(cnt//2)\r\n", "def solve(a, b, c, sz):\r\n ret = 0\r\n for inc in range(sz + 1):\r\n x = min(a - b - c + inc, sz - inc)\r\n if x >= 0:\r\n ret += (x + 1) * (x + 2) // 2\r\n return ret\r\n\r\n\r\na, b, c, sz = map(int, input().split())\r\n\r\nanswer = (sz + 1) * (sz + 2) * (sz + 3) // 6\r\nanswer -= solve(a, b, c, sz)\r\nanswer -= solve(b, a, c, sz)\r\nanswer -= solve(c, a, b, sz)\r\n\r\nprint(answer)", "a, b, c, l = map(int, input().split())\r\ncnt = (l + 3) * (l + 2) * (l + 1) // 3\r\nfor i in (a, b, c):\r\n s = 2 * i - a - b - c\r\n for x in range(max(0, -s), l + 1):\r\n m = min(s + x, l - x)\r\n cnt -= (m + 1) * (m + 2)\r\nprint(cnt // 2)\r\n\r\n", "calc=lambda a,b,c:sum((min(c+i-a-b,l-i)+1)*(min(c+i-a-b,l-i)+2)//2 for i in range(max(0,a+b-c),l+1))\na,b,c,l=map(int,input().split())\nprint(sum((i+1)*(i+2)//2 for i in range(l+1))-calc(a,b,c)-calc(a,c,b)-calc(b,c,a))", "p = list(map(int, input().split()))\r\nl = p.pop()\r\nn = (l + 1) * (l + 2) * (l + 3) // 6\r\ns = sum(p)\r\nfor q in p:\r\n t = 2 * q - s\r\n for d in range(l + 1):\r\n k = min(t + d, l - d) + 1\r\n if k > 0: n -= k * k + k >> 1\r\nprint(n)", "a, b, c, d = map(int, input().split(' '))\r\n\r\nans = -(d+1) * (d+2) * (d+3) // 6\r\nfor l1 in range(0, d+1):\r\n minx = min(d-l1, a-b-c+l1)\r\n if minx < 0:\r\n continue;\r\n else:\r\n ans += (minx + 1) * (minx + 2) // 2\r\n\r\na, b, c = b, c, a\r\nfor l1 in range(0, d+1):\r\n minx = min(d-l1, a-b-c+l1)\r\n if minx < 0:\r\n continue;\r\n else:\r\n ans += (minx + 1) * (minx + 2) // 2\r\n\r\na, b, c = b, c, a\r\nfor l1 in range(0, d+1):\r\n minx = min(d-l1, a-b-c+l1)\r\n if minx < 0:\r\n continue;\r\n else:\r\n ans += (minx + 1) * (minx + 2) // 2\r\n\r\nprint(-ans)\r\n", "'''\nimport sys\nsys.stdin = open(\"input.txt\", \"r\")\nsys.stdout = open(\"output.txt\", \"w\")\n'''\ndef Solve(a, b, c, l):\n\tdelta = a - b - c\n\tif delta < 0:\n\t\treturn 0\n\tk = min(l, delta) + 1\n\treturn k * (k + 1) // 2\n\na, b, c, l = map(int, input().split())\n\nans = (l + 3) * (l + 2) * (l + 1) // 6\n\nfor d in range(l + 1):\n\tans -= Solve(a + d, b, c, l - d) + Solve(b + d, a, c, l - d) + Solve(c + d, a, b, l - d)\nprint(ans)\n", "def solve(a, b, c):\n ans = 0\n for da in range(max(0, b + c - a), l + 1):\n x = min(a - b - c + da, l - da)\n ans += (x + 1) * (x + 2) // 2\n return ans\n\n\na, b, c, l = map(int, input().split())\nprint((l + 1) * (l + 2) * (l + 3) // 6 - solve(a, b, c) - solve(b, a, c) - solve(c, a, b))\n", "def f(a, b, c, l):\r\n k = min(l, a - b - c)\r\n return 0 if a < b + c else (k + 1) * (k + 2) // 2\r\n\r\nsolve = lambda i: f(a + i, b, c, l - i) + f(b + i, c, a, l - i) + f(c + i, a, b, l - i)\r\na, b, c, l = map(int, input().split())\r\nans = (l + 1) * (l + 2) * (l + 3) // 6 - sum(solve(i) for i in range(l + 1))\r\nprint(ans)" ]

[ "from sys import stdin\r\ninput=lambda :stdin.readline()[:-1]\r\n\r\nfrom collections import defaultdict\r\n\r\nclass UnionFind():\r\n def __init__(self,n):\r\n self.n=n\r\n self.parents=[-1]*n\r\n\r\n def find(self,x):\r\n if self.parents[x]<0:\r\n return x\r\n else:\r\n self.parents[x]=self.find(self.parents[x])\r\n return self.parents[x]\r\n\r\n def union(self,x,y):\r\n x=self.find(x)\r\n y=self.find(y)\r\n\r\n if x==y:\r\n return\r\n\r\n if self.parents[x]>self.parents[y]:\r\n x,y=y,x\r\n\r\n self.parents[x]+=self.parents[y]\r\n self.parents[y]=x\r\n\r\n def size(self,x):\r\n return -self.parents[self.find(x)]\r\n\r\n def same(self,x,y):\r\n return self.find(x)==self.find(y)\r\n\r\n def members(self,x):\r\n root=self.find(x)\r\n return [i for i in range(self.n) if self.find(i)==root]\r\n\r\n def roots(self):\r\n return [i for i, x in enumerate(self.parents) if x< 0]\r\n\r\n def group_count(self):\r\n return len(self.roots())\r\n\r\n def all_group_members(self):\r\n group_members=defaultdict(list)\r\n for member in range(self.n):\r\n group_members[self.find(member)].append(member)\r\n return group_members\r\n\r\nn,m=map(int,input().split())\r\ntree_edge=[[] for i in range(n)]\r\nnon_tree_edge=[]\r\nuf=UnionFind(n)\r\nfor _ in range(m):\r\n a,b,c=map(int,input().split())\r\n a,b=a-1,b-1\r\n if uf.same(a,b):\r\n non_tree_edge.append((a,b,c))\r\n else:\r\n uf.union(a,b) \r\n tree_edge[a].append((b,c))\r\n tree_edge[b].append((a,c))\r\n\r\ndist=[0]*n\r\ntodo=[(0,-1)]\r\nwhile todo:\r\n v,p=todo.pop()\r\n for u,w in tree_edge[v]:\r\n if u!=p:\r\n todo.append((u,v))\r\n dist[u]=dist[v]^w\r\n\r\nS=[]\r\n\r\ndef add(v):\r\n for i in S:\r\n v=min(v,v^i)\r\n if v!=0:\r\n S.append(v)\r\n\r\nfor a,b,c in non_tree_edge:\r\n add(dist[a]^dist[b]^c)\r\n\r\nres=dist[n-1]\r\nfor i in sorted(S,reverse=True):\r\n res=min(res,res^i)\r\nprint(res)" ]

[ "n = int(input())\r\na = []\r\nchecker = True\r\nfor i in range(n):\r\n a.append(input().split('|'))\r\n if a[i][0] == 'OO' and checker:\r\n checker = False\r\n a[i][0] = \"++\"\r\n elif a[i][1] == \"OO\" and checker:\r\n checker = False\r\n a[i][1] = \"++\"\r\nif checker:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in range(n):\r\n print(f\"{a[i][0]}|{a[i][1]}\")\r\n\r\n", "s=\"\"\r\nfor _ in range(int(input())):s+=input()+\";\"\r\nprint(\"YES\\n\"+s.replace(\"OO\",\"++\",1).replace(\";\",\"\\n\") if s.find(\"OO\")!=-1 else \"NO\")\r\n", "import sys\r\ninput()\r\ns = sys.stdin.read()\r\nx = s.find('OO')\r\nprint('NO' if x < 0 else 'YES\\n'+s[:x]+'++'+s[x+2:])", "n=int(input())\r\ns=0\r\nl=[]\r\nfor i in range(n):\r\n w=input()\r\n if \"OO\" in w and s<1:\r\n w=w.replace(\"OO\",'++',1)\r\n s+=1\r\n l.append(w)\r\nif s==1:\r\n print(\"YES\")\r\n print(*l,sep='\\n')\r\nelse:\r\n print('NO')", "n=int(input())\r\nM=[input()for _ in range(n)]\r\nfor i in range(n):\r\n\tif'OO'in M[i]:\r\n\t\tM[i]=M[i].replace('OO','++',1)\r\n\t\tprint('YES',*M,sep='\\n')\r\n\t\tbreak\r\nelse:\r\n print('NO')\r\n ", "ans = []\r\nyes = 0\r\nfor _ in range(int(input())):\r\n a = list(input())\r\n if a[0] == a[1] == 'O':\r\n if yes == 0:\r\n a[0] = '+'\r\n a[1] = '+'\r\n yes = 1\r\n elif a[3] == a[4] == 'O':\r\n if yes == 0:\r\n a[3] = '+'\r\n a[4] = '+'\r\n yes = 1\r\n s = ''.join(ele for ele in a)\r\n ans.append(s)\r\nif yes == 1:\r\n print('YES')\r\n print(*ans,sep='\\n')\r\nelse:\r\n print('NO')\r\n", "n = int(input())\r\na = []\r\n\r\nflag = 1\r\n\r\nfor i in range(n):\r\n row = list(input())\r\n a.append(row)\r\n\r\n if row[0] == 'O' and row[1] == 'O' and flag:\r\n flag = 0\r\n row[0] = row[1] = '+'\r\n elif row[3] == 'O' and row[4] == 'O' and flag:\r\n flag = 0\r\n row[3] = row[4] = '+'\r\n\r\nif flag:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in range(n):\r\n print(\"\".join(a[i]))\r\n\r\n", "n=int(input())\r\ns=\"\"\r\nc=0\r\nfor i in range(n):\r\n x,y=map(str,input().split(\"|\"))\r\n if x==\"OO\" and c==0:\r\n s+=\"++|\"+y+\"\\n\"\r\n c+=1\r\n elif y==\"OO\" and c==0:\r\n s+=x+\"|++\"+\"\\n\"\r\n c+=1\r\n else:\r\n s+=x+\"|\"+y+\"\\n\"\r\nif c>=1:\r\n print(\"YES\")\r\n print(s)\r\nelse:\r\n print(\"No\")", "# LUOGU_RID: 117570787\nn=int(input())\r\na=[]\r\nf=True\r\nfor i in range(n):\r\n a.append(input())\r\n if f and 'OO' in a[i]:\r\n c=a[i].split('|')\r\n if c[0]=='OO':\r\n c[0]='++'\r\n else:\r\n c[1]='++'\r\n a[i]=c[0]+'|'+c[1]\r\n f=False\r\nif not f:\r\n print('YES\\n'+'\\n'.join(a))\r\nelse:\r\n print('NO')", "n=int(input())\r\na=[]\r\nt=True\r\nfor i in range(0,n):\r\n\ts=input()\r\n\tif t:\r\n\t\tif \"OO\" in s:\r\n\t\t\tif s[1]==\"O\" and s[0]==\"O\":\r\n\t\t\t\tj=\"++|\"+s[3]+s[4]\r\n\t\t\telse:\r\n\t\t\t\tj=s[0]+s[1]+\"|++\"\r\n\t\t\ts=j\r\n\t\t\tt=False\r\n\ta.append(s)\r\nif t:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\r\n\tfor i in range(0,n):\r\n\t\tprint(a[i])", "n = int(input())\r\nm = 0\r\nl = []\r\nfor i in range(n):\r\n r = input()\r\n if \"OO\" in r and m == 0:\r\n r = r.replace(\"OO\", \"++\", 1)\r\n m = 1\r\n l.append(r)\r\nif m == 1:\r\n print(\"YES\")\r\n print(*l, sep=\"\\n\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "n = int(input())\r\nseats = []\r\npossible = False\r\nfor i in range(n):\r\n s = input()\r\n if not possible:\r\n if (s[3] == s[4] and s[3] == 'O'):\r\n possible = True\r\n s=list(s)\r\n s[3] = '+'\r\n s[4] = '+'\r\n seats.append(''.join(s))\r\n elif (s[0]==s[1] and s[0]=='O'):\r\n possible = True\r\n s=list(s)\r\n s[0] = '+'\r\n s[1] = '+'\r\n seats.append(''.join(s))\r\n else:\r\n seats.append(s)\r\n else:\r\n seats.append(s)\r\nif possible:\r\n print(\"YES\")\r\n for i in seats:\r\n print(i)\r\nelse:\r\n print(\"NO\")\r\n \r\n\r\n", "def to_list(s):\r\n out = []\r\n for i in s:\r\n out.append(i)\r\n return out\r\n\r\nn = int(input())\r\n\r\nflag = 0\r\nseat = []\r\n\r\nfor _ in range(n):\r\n s = input()\r\n seat.append(s)\r\n \r\nfor i, s in enumerate(seat):\r\n if s[0] == 'O' and s[1] == 'O':\r\n out = to_list(s)\r\n out[0] = '+'\r\n out[1] = '+'\r\n out = ''.join(out)\r\n seat[i] = out\r\n flag = 1\r\n break\r\n elif s[3] == 'O' and s[4] == 'O':\r\n out = to_list(s)\r\n out[3] = '+'\r\n out[4] = '+'\r\n out = ''.join(out)\r\n seat[i] = out\r\n flag = 1\r\n break\r\n \r\nif flag == 0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for s in seat:\r\n print(s)\r\n ", "s1='\\n'.join(input() for i in range(int(input())))\ns2=s1.replace('OO','++',1)\nif s1!=s2:\n print(\"YES\\n\"+s2)\nelse:\n print(\"NO\")\n", "found_seat = False\r\npattern = \"\"\r\nfor _ in range(int(input())):\r\n a, b = input().split('|')\r\n if not found_seat:\r\n if a == \"OO\":\r\n found_seat = True\r\n pattern += f\"++|{b}\\n\"\r\n elif b == \"OO\":\r\n found_seat = True\r\n pattern += f\"{a}|++\\n\"\r\n else:\r\n pattern += f\"{a}|{b}\\n\"\r\n else:\r\n pattern += f\"{a}|{b}\\n\"\r\nprint(\"YES\\n\" + pattern if found_seat else \"NO\")", "a = int(input())\r\nd = []\r\nk = False\r\nfor i in range(0, a):\r\n b = input()\r\n if k == False and b[:2] == \"OO\":\r\n k = True\r\n b = \"++\" + b[2:]\r\n if k == False and b[3:] == \"OO\":\r\n k = True\r\n b = b[:3] + \"++\"\r\n d.append(b)\r\nif k == True:\r\n print(\"YES\")\r\n print(*d, sep = \"\\n\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nt = ''\r\nfor i in range(n):\r\n s = input()\r\n if 'OO' in s and '++' not in t:\r\n s = s.replace('OO', '++', 1)\r\n t += s + '\\n'\r\nif '++' in t:\r\n print('YES')\r\n print(t)\r\nelse:\r\n print('NO')", "seats_found = False\nn = int(input())\nbus = []\nfor i in range(n):\n\trow = input().strip()\n\tif seats_found:\n\t\tbus.append(row)\t\t\n\telif row[:2] == 'OO':\n\t\tbus.append('++' + row[2:])\n\t\tseats_found = True\n\telif row[-2:] == 'OO':\n\t\tbus.append(row[:-2] + '++')\n\t\tseats_found = True\n\telse:\n\t\tbus.append(row)\nif not seats_found:\n\tprint('NO')\nelse:\n\tprint('YES')\n\tfor row in bus:\n\t\tprint(row)\n\t\t\n\t\n", "# URL: https://codeforces.com/problemset/problem/711/A\n\nimport io\nimport os\nimport sys\n\ninput_buffer = io.BytesIO(os.read(0, os.fstat(0).st_size))\ninp = lambda: input_buffer.readline().rstrip(b\"\\n\").rstrip(b\"\\r\")\nout = sys.stdout.write\n\nn = int(inp())\na = []\nreplaced = False\nfor _ in range(n):\n s = inp().decode()\n if not replaced:\n t = s.replace('OO', '++', 1)\n replaced = s != t\n s = t\n a.append(s)\nif replaced:\n out(\"YES\\n\")\n out(\"\\n\".join(a))\nelse:\n out(\"NO\")\n", "l = []\r\nanswer = \"NO\"\r\nfor i in range(int(input())):\r\n a,b=input().split(\"|\")\r\n if a == 'OO' or b == 'OO':\r\n answer = \"YES\"\r\n l.append([a, b])\r\n\r\nif answer == \"NO\":\r\n print(answer)\r\nelse:\r\n print(answer)\r\n for i in l:\r\n if i[0] == 'OO':\r\n i[0] = \"++\"\r\n break\r\n elif i[1] == \"OO\":\r\n i[1] = \"++\"\r\n break\r\n for i in l:\r\n print('|'.join(i)) ", "def main():\r\n n = int(input())\r\n lst = []\r\n flag = False\r\n for i in range(n):\r\n s = input()\r\n a = s[:2]\r\n b = s[3:]\r\n if not flag:\r\n if a == 'OO':\r\n a = '++'\r\n flag = True\r\n\r\n elif b == 'OO':\r\n b = '++'\r\n flag = True\r\n\r\n lst.append(a + '|' + b)\r\n if flag:\r\n print('YES')\r\n for i in lst:\r\n print(i)\r\n else:\r\n print('NO')\r\n\r\n\r\nmain()\r\n", "n=int(input())\r\np=0\r\nli=list()\r\nfor i in range(0,n):\r\n s=input()\r\n if p==1:\r\n li.append(s)\r\n continue\r\n if s[0:2]==\"OO\":\r\n p=1\r\n s=\"++\"+s[2:]\r\n elif s[3:]==\"OO\":\r\n p=1\r\n s=s[0:3]+\"++\"\r\n li.append(s)\r\nif p==0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in range(0,n):\r\n print(li[i])\r\n", "# ZS the Coder and Chris the Baboon are travelling to Udayland! To get there, \r\n# they have to get on the special IOI bus. The IOI bus has n rows of seats. \r\n# There are 4 seats in each row, and the seats are separated into pairs by a \r\n# walkway. When ZS and Chris came, some places in the bus was already occupied.\r\n\r\n# ZS and Chris are good friends. They insist to get a pair of neighbouring empty \r\n# seats. Two seats are considered neighbouring if they are in the same row and in \r\n# the same pair. Given the configuration of the bus, can you help ZS and Chris determine \r\n# where they should sit?\r\n\r\n# Input\r\n# The first line of the input contains a single integer n (1 ≤ n ≤ 1000) — the number \r\n# of rows of seats in the bus.\r\n\r\n# Then, n lines follow. Each line contains exactly 5 characters, the first two of them \r\n# denote the first pair of seats in the row, the third character denotes the walkway \r\n# (it always equals '|') and the last two of them denote the second pair of seats in the row.\r\n\r\n# Each character, except the walkway, equals to 'O' or to 'X'. 'O' denotes an empty seat, \r\n# 'X' denotes an occupied seat. See the sample cases for more details.\r\n\r\n# Output\r\n# If it is possible for Chris and ZS to sit at neighbouring empty seats, print \"YES\" \r\n# (without quotes) in the first line. In the next n lines print the bus configuration, \r\n# where the characters in the pair of seats for Chris and ZS is changed with characters \r\n# '+'. Thus the configuration should differ from the input one by exactly two charaters \r\n# (they should be equal to 'O' in the input and to '+' in the output).\r\n\r\n# If there is no pair of seats for Chris and ZS, print \"NO\" (without quotes) in a single line.\r\n\r\n# If there are multiple solutions, you may print any of them.\r\n\r\n\r\ntotalRows = int(input())\r\nmainList = []\r\ntempVar = 0\r\n\r\nfor a in range(totalRows):\r\n rowArrangement = input()\r\n mainList.append(rowArrangement)\r\n\r\nfor a in range(totalRows):\r\n if(mainList[a][0]=='O' and mainList[a][1] == 'O'):\r\n print(\"YES\")\r\n mainList[a] = '++'+mainList[a][2:]\r\n tempVar = 1\r\n break\r\n elif(mainList[a][3]=='O' and mainList[a][4]=='O'):\r\n print(\"YES\")\r\n mainList[a] = mainList[a][:3] + '++'\r\n tempVar = 1\r\n break\r\n\r\nif (tempVar==0):\r\n print(\"NO\")\r\nelse:\r\n for a in mainList:\r\n print(a)", "n=int(input())\r\nl=[]\r\ns=0\r\nfor i in range(n):\r\n l.append(input())\r\nfor i in range(n):\r\n if(l[i][0]=='O' and l[i][1]=='O'):\r\n l[i]='++'+l[i][2:]\r\n s=1\r\n break\r\n if(l[i][3]=='O' and l[i][4]=='O'):\r\n l[i]=l[i][:3]+'++'\r\n s=1\r\n break\r\nif(s==1):\r\n print('YES')\r\n for i in range(n):\r\n print(l[i])\r\nelse:\r\n print('NO')\r\n \r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\ns = [list(input().rstrip().decode()) for _ in range(n)]\r\nans = \"NO\"\r\nfor i in range(n):\r\n si = s[i]\r\n for j in range(0, 5, 3):\r\n if si[j] == si[j + 1] == \"O\":\r\n si[j], si[j + 1] = \"+\", \"+\"\r\n ans = \"YES\"\r\n break\r\n if ans == \"YES\":\r\n break\r\nprint(ans)\r\nif ans == \"YES\":\r\n ans = []\r\n for ans0 in s:\r\n ans.append(\"\".join(ans0))\r\n sys.stdout.write(\"\\n\".join(ans))", "n = int(input())\r\nf = 0\r\nc = \"|\"\r\nans = []\r\nfor i in range(n):\r\n a,b = input().split('|')\r\n # for j in range(len(a)):\r\n # if (a[j] == 'O'):\r\n # a.replace('O', 'r')\r\n # print(a)\r\n\r\n if ((f == 0) and (a[0]== 'O' and a[1] == 'O')):\r\n x = a.replace('O', '+')\r\n f = 1\r\n p = x+c+b\r\n\r\n\r\n elif((f == 0) and (b[0]== 'O' and b[1] == 'O')):\r\n x = b.replace('O','+')\r\n f = 1\r\n p = a+c+x\r\n\r\n\r\n else:\r\n p = a+c+b\r\n ans.append(p)\r\n\r\nif f == 0:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n print(*ans, sep=\"\\n\")", "n = int(input())\r\ns = []\r\ncount = 0\r\nfor i in range(n):\r\n h = input()\r\n if 'OO' in h and count < 1:\r\n h = h.replace('OO', '++', 1)\r\n count += 1\r\n s.append(h)\r\n continue\r\n s.append(h)\r\nif count > 0:\r\n print('YES')\r\n for i in s:\r\n print(i)\r\nif count == 0:\r\n print('NO')", "l=[]\r\nfor _ in range(int(input())):\r\n l.append(input())\r\ncount=0\r\nfor i in l:\r\n if (count > 0):\r\n break\r\n if (i[0] == i[1] == \"O\"):\r\n pos=l.index(i)\r\n l[pos] = \"++\" + i[2::]\r\n count += 1\r\n elif (i[3] == i[4] == \"O\"):\r\n pos=l.index(i)\r\n l[pos] = i[0:3] + \"++\"\r\n count += 1\r\nif (count == 0):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for j in l:\r\n print(j)", "t = int(input())\r\n\r\nplaces = \"\"\r\n\r\nfor _ in range(t):\r\n places += str(input()) + \"\\n\"\r\n\r\n\r\nprint(\"YES\\n\" + places.replace(\"OO\", \"++\", 1) if \"OO\" in places else \"NO\")\r\n", "t = int(input())\nreturnNo = True\na = []\nfor x in range(t):\n a.append(str(input()))\nfor x in range(len(a)):\n if(a[x][0] == a[x][1] and a[x][0] == \"O\"):\n print(\"YES\")\n for i in range(len(a)):\n if(i != x):\n print(a[i])\n else:\n b = \"++|\"\n b += a[i][3] + a[i][4]\n print(b)\n returnNo = False\n break\n elif(a[x][3] == a[x][4] and a[x][3] == \"O\"):\n print(\"YES\")\n for i in range(len(a)):\n if(i != x):\n print(a[i])\n else:\n b = a[i][0] + a[i][1]\n b += \"|++\"\n print(b)\n returnNo = False\n break\nif(returnNo):\n print(\"NO\")\n", "n = int(input())\r\nk = []\r\nflag = True\r\nfor _ in range(n):\r\n s = input()\r\n if ((s[0]=='O' and s[1]=='O') or (s[3]=='O' and s[4]=='O')) and flag:\r\n if s[0]=='O' and s[1]=='O':\r\n s = '++'+s[2:5]\r\n k.append(s)\r\n flag=False\r\n else:\r\n s=s[0:3]+'++'\r\n k.append(s)\r\n flag=False\r\n else:\r\n k.append(s)\r\nif flag:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n print(*k, sep='\\n')", "n = int(input())\r\nl = []\r\nflag=1\r\nfor i in range(n):\r\n s = input()\r\n if \"OO\" in s and flag:\r\n print(\"YES\")\r\n c = 0\r\n snew = \"\"\r\n if s[:2]==\"OO\":\r\n snew=\"++\"+s[2:]\r\n elif s[3:]==\"OO\":\r\n snew=s[:3]+\"++\"\r\n l.append(snew)\r\n flag=0\r\n else:\r\n l.append(s)\r\nif flag==1:\r\n print(\"NO\")\r\nelse:\r\n for i in l:\r\n print(i)\r\n\r\n", "n=int(input())\r\nl=list()\r\nk=False\r\nfor i in range(n):\r\n l.append(input())\r\nfor i in range(len(l)):\r\n if 'OO' in l[i]:\r\n l[i]=l[i].replace('OO','++',1)\r\n k=True\r\n break\r\nif(k):\r\n print('YES')\r\n for i in l:\r\n print(i)\r\nelse:\r\n print('NO')\r\n", "import sys\r\nbus=[]\r\nfor _ in range(int(sys.stdin.readline())):\r\n bus.append([i for i in input()])\r\nistrue=False\r\nfor i in bus:\r\n if i[3]=='O' and i[4]=='O':\r\n istrue=True\r\n i[3]='+'\r\n i[4]='+'\r\n break\r\n elif i[0]=='O' and i[1]=='O':\r\n istrue=True\r\n i[0]='+'\r\n i[1]='+'\r\n break\r\n else:\r\n pass\r\nif istrue==True :\r\n print('YES')\r\n for i in bus:\r\n print(''.join(i))\r\nelse:print('NO')", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n\tl.append(input())\r\n\r\ndef f(l):\r\n\tfor i in range(len(l)):\r\n\t\tif \"OO\" in l[i]:\r\n\t\t\tl[i]=l[i].replace(\"OO\",\"++\",1)\r\n\t\t\treturn True\r\n\treturn False\r\nif f(l):\r\n\tprint(\"YES\")\r\n\tprint(*l,sep=\"\\n\")\r\nelse:\r\n\tprint(\"NO\")", "n = int(input())\r\nflag = 0\r\nl = []\r\nfor i in range(n):\r\n s = input().split(\"|\")\r\n if flag == 0 and s[0]==\"OO\":\r\n flag = 1\r\n l.append(\"++|\"+s[1])\r\n elif flag==0 and s[1]==\"OO\":\r\n flag = 1\r\n l.append(s[0]+\"|++\")\r\n else:\r\n l.append(\"|\".join(s))\r\nif flag==1:\r\n print(\"YES\")\r\n for val in l:\r\n print(val)\r\nelse:\r\n print(\"NO\")", "\r\nn = int(input())\r\n \r\nseat_found = False\r\n \r\nrows = []\r\n \r\nfor i in range(n):\r\n row = input()\r\n if not seat_found:\r\n if \"OO\" in row:\r\n seat_found = True\r\n if row[:2] == \"OO\":\r\n rows.append(\"++\" + row[2:])\r\n else:\r\n rows.append(row[:3] + \"++\")\r\n else:\r\n rows.append(row)\r\n \r\n else:\r\n rows.append(row)\r\n \r\nif seat_found:\r\n print(\"YES\")\r\n print(\"\\n\".join(rows))\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nreplace=False\r\nres=[]\r\nfor i in range(n):\r\n i = input()\r\n if 'OO' in i and not replace:\r\n i=i.replace('OO', '++', 1)\r\n replace=True\r\n res.append(i)\r\nif replace:\r\n print('YES')\r\n for i in range(n):\r\n print(res[i])\r\n\r\nelse:\r\n print('NO')", "n = int(input())\nres = list()\nfound = False\nfor i in range(n):\n row = input()\n rows = row.split(\"|\");\n refactored = \"\"\n #print(rows)\n if not found:\n if rows[0][0] == rows[0][1] and rows[0][1] == \"O\":\n refactored += \"++\"\n found = True\n else:\n refactored += rows[0]\n refactored += \"|\"\n if not found:\n if rows[1][0] == rows[1][1] and rows[1][1] == \"O\":\n refactored += \"++\"\n found = True\n else:\n refactored += rows[1]\n else:\n refactored += rows[1]\n else:\n refactored += rows[0] + \"|\" + rows[1]\n res.append(refactored)\n\nif found:\n print(\"YES\")\n for cad in res:\n print(cad)\nelse:\n print(\"NO\")\n\n\t\t\t \t\t\t \t \t\t\t\t \t \t \t \t\t\t\t \t\t \t", "l = []; cnt = 0\r\nfor i in range(int(input())):\r\n a = input()\r\n if(a[:2]==\"OO\" and cnt!=1): l.append((\"++\"+a[2:]));cnt = 1\r\n elif(a[3:]==\"OO\" and cnt!=1):l.append((a[:3]+\"++\")); cnt = 1\r\n else:l.append(a)\r\n\r\nif(cnt):print(\"YES\",*l,sep=\"\\n\")\r\nelse:print(\"NO\")\r\n", "#!/usr/bin/env/python\r\n# -*- coding: utf-8 -*-\r\nm = int(input())\r\nres = []\r\nflag = False\r\nfor _ in range(m):\r\n s = input()\r\n if not flag and (x := s.find('OO')) > -1:\r\n s = s[:x] + '++' + s[x+2:]\r\n flag = True\r\n res.append(s)\r\nif flag:\r\n print('YES')\r\n for line in res:\r\n print(line)\r\nelse:\r\n print('NO')", "found = False\r\nl = []\r\n\r\nfor _ in range(int(input())):\r\n row = input()\r\n if not found:\r\n l.append([])\r\n for i in range(len(row.split('|'))):\r\n seat = row.split('|')[i]\r\n if not found and seat == 'OO':\r\n found = True\r\n seat = '++'\r\n l[len(l)-1].append(seat)\r\n else:\r\n l.append(row.split('|'))\r\nif found:\r\n print('YES')\r\n for i in l:\r\n print(i[0],i[1],sep='|')\r\nelse: print('NO')\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\nlst = []\r\ncheck = False\r\n\r\nfor i in range(n):\r\n lst.append(input())\r\n\r\nfor i in range(n):\r\n if \"OO\" in lst[i]:\r\n pos = lst[i].find(\"OO\")\r\n lst[i] = str(lst[i][:pos]) + \"++\" + str(lst[i][pos + 2:])\r\n check = True\r\n break\r\n\r\nif check:\r\n print(\"YES\")\r\n for i in range(n):\r\n print(lst[i])\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\nf = False\r\nb = []\r\nfor i in range(n):\r\n b.append(input())\r\n s = list(b[i])\r\n for j in range(1, len(s), 3):\r\n if s[j] == \"O\" and s[j - 1] == s[j] and not(f):\r\n s[j], s[j - 1] = \"+\",\"+\"\r\n b[i] = \"\".join(s)\r\n f = True\r\n\r\n\r\nif f:\r\n print(\"YES\")\r\n for r in b:\r\n print(r)\r\nelse:\r\n print(\"NO\")\r\n \r\n", "n=int(input())\r\na=[input() for i in range(n)]\r\nc=0\r\nfor i in a:\r\n if 'OO' in i:\r\n i=i.replace('OO','++',1)\r\n a[c]=i\r\n print('YES',*a, sep='\\n')\r\n break\r\n c+=1\r\nif c==n: print('NO')", "n = int(input())\r\ncheck = 0\r\nbus = []\r\ndone = 0\r\nfor i in range(0, n):\r\n row = input()\r\n rowSlice = row.split(\"|\")\r\n if(done == 1):\r\n bus.append(row)\r\n else:\r\n if rowSlice[0] == \"OO\" or rowSlice[1] == \"OO\":\r\n rowM = row.replace(\"OO\",\"++\",1)\r\n bus.append(rowM)\r\n check = 1\r\n done = 1\r\n else:\r\n bus.append(row)\r\nif(check == 1):\r\n print(\"YES\")\r\n for line in bus:\r\n print(line)\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\narr=[]\r\ngame=True\r\nfor i in range(n):\r\n\tarr.append((input()))\r\nfor j in range(n):\r\n\tif \"OO\" in arr[j]:\r\n\t\tprint(\"YES\")\r\n\t\tind=arr[j].index(\"OO\")\r\n\t\tif ind==0 and arr[j][ind+1]==\"O\":\r\n\t\t\tarr[j]=\"++|\"+arr[j][3]+arr[j][4]\r\n\t\tif ind==3 and arr[j][ind+1]==\"O\":\r\n\t\t\tarr[j]=arr[j][0]+arr[j][1]+\"|\"+\"++\"\r\n\t\tgame=False\r\n\t\tbreak\r\nif game==True:\r\n\tprint('NO')\r\nelse:\r\n\tfor k in range(n):\r\n\t\tprint(arr[k])", "n = int(input())\r\n\r\narr = []\r\n\r\nok = False\r\nfor i in range(n):\r\n s = input()\r\n if s[0] == \"O\" and s[1] == \"O\" and ok == False:\r\n s = \"++|\"+s[3]+s[4]\r\n ok = True\r\n elif s[3] == \"O\" and s[4] == \"O\" and ok == False:\r\n s = s[0]+s[1]+\"|++\"\r\n ok = True\r\n arr.append(s)\r\n\r\nif ok:\r\n print(\"YES\")\r\n for i in range(n):\r\n print(arr[i])\r\nelse:\r\n print(\"NO\")", "found = False\r\nl = []\r\nfor _ in range(int(input())):\r\n row = input()\r\n r = row.split('|')\r\n if not found:\r\n for i in range(len(r)):\r\n if not found and r[i] == 'OO':\r\n found = True\r\n r[i] = '++'\r\n row = r[0]+'|'+r[1]\r\n\r\n l.append(row)\r\nif found:\r\n print('YES')\r\n for i in l: print(i)\r\nelse: print('NO')", "n=int(input())\nflage=0\nL=[]\nfor i in range(n):\n word=list(input())\n for i in range(1,len(word)):\n if word[i-1]=='O' and word[i]=='O' and flage==0:\n word[i]=word[i-1]='+'\n flage=1\n L.append(''.join(word))\nif flage==1:\n print('YES')\n for i in range(n):\n print(L[i])\nelse:\n print('NO')\n \t\t \t \t \t\t\t\t\t \t\t \t\t \t \t", "n=int(input())\r\nseats=[]\r\ni=1\r\nwhile i<=n:\r\n s=input()\r\n seats.append(s)\r\n i+=1\r\nes_list_row=[]\r\nes_list_col=[]\r\nfor j in range(n):\r\n es=seats[j]\r\n if es[:2]==\"OO\":\r\n es_list_row.append(j)\r\n es_list_col.append(1)\r\n elif es[3:5]==\"OO\":\r\n es_list_row.append(j)\r\n es_list_col.append(2)\r\nif len(es_list_row)>0:\r\n row_to_change=es_list_row[0]\r\n col_to_change=es_list_col[0]\r\n old_seats=seats[row_to_change]\r\n if col_to_change==1:\r\n new_seats=\"++\"+old_seats[2:5]\r\n seats[row_to_change]=new_seats\r\n else :\r\n new_seats=old_seats[:3]+\"++\"\r\n seats[row_to_change]=new_seats\r\n print(\"YES\")\r\n print(*seats,sep=\"\\n\")\r\nelse :\r\n print(\"NO\")", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n x=list(input())\r\n l.append(x)\r\nk=0\r\nfor i in l:\r\n if(i[0]=='O' and i[1]=='O'):\r\n i[0]=i[1]='+'\r\n print(\"YES\")\r\n k=1\r\n break\r\n elif(i[3]=='O' and i[4]=='O'):\r\n i[3]=i[4]='+'\r\n print(\"YES\")\r\n k=1\r\n break\r\nif(k==0):\r\n print(\"NO\")\r\nelse:\r\n for i in l:\r\n x=\"\"\r\n for j in range(5):\r\n x+=i[j]\r\n print(x)", "n = int(input())\r\ns = ''\r\nfor i in range(n):\r\n s = s + input()+'\\n'\r\n x = s.find('OO')\r\nif \"OO\" in s:\r\n print(\"YES\")\r\n print(s[:x] + '++' + s[x+2:])\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\n\r\nresult = []\r\nis_found = False\r\nfor _ in range(n):\r\n lvl = input()\r\n \r\n if lvl.startswith(\"OO\") and not is_found:\r\n result.append(\"++\" + lvl[2:])\r\n is_found = True\r\n elif lvl.endswith(\"OO\") and not is_found:\r\n result.append(lvl[:3] + \"++\")\r\n is_found = True\r\n else:\r\n result.append(lvl)\r\n \r\nif is_found:\r\n print(\"YES\")\r\n for i in range(n):\r\n print(result[i])\r\nelse:\r\n print(\"NO\")", "def solve():\r\n l = []\r\n n = int(input())\r\n for _ in range(n):\r\n l.append(input())\r\n gotPlace = False\r\n for i in range(n):\r\n temp = l[i].find(\"OO\")\r\n if temp != -1:\r\n gotPlace=True\r\n x = list(l[i])\r\n x[temp],x[temp+1] = \"+\",\"+\"\r\n l[i] = \"\".join(x)\r\n break\r\n if gotPlace:\r\n print(\"YES\")\r\n for i in l:\r\n print(i)\r\n else:\r\n print(\"NO\")\r\n# n,c = map(int,input().split())\r\n# a = 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\n# print(solve(n,c,l))\r\nsolve()\r\n\r\n\r\n\r\n", "rows = int(input())\r\nbus = [input() for row in range(rows)]\r\nfound = False\r\nfor i in range(len(bus)):\r\n if 'OO' in bus[i]:\r\n found = True\r\n index = bus[i].index('OO')\r\n bus[i] = bus[i].replace('OO','++',1)\r\n break\r\nif found:\r\n print('YES')\r\n for row in bus:\r\n print(row)\r\nelse:\r\n print('NO')", "#711A - Bus to Udayland\r\nk,y=True,[]\r\nfor i in range(int(input())):\r\n [a,b]=list(map(str,input().split(\"|\")))\r\n if k==True:\r\n if a==\"OO\":\r\n k=False\r\n a=\"++\"\r\n elif b==\"OO\":\r\n k=False\r\n b=\"++\"\r\n y.append(a)\r\n y.append(b)\r\nif k==False:\r\n print(\"YES\")\r\n for i in range(0,len(y),2):\r\n print(y[i]+\"|\"+y[i+1])\r\nelse:\r\n print(\"NO\")", "import sys\r\nn = int(input())\r\ns=sys.stdin.read()\r\np = s.find(\"OO\")\r\nprint(\"NO\" if p<0 else \"YES\\n\" + s[:p] + \"++\" + s[p+2:])", "n = int(input())\r\narr = []\r\ncount = 0\r\nfor i in range(n) :\r\n s = input()\r\n if \"OO\" in s :\r\n count+=1\r\n arr.append(s)\r\nif count == 0 :\r\n print(\"NO\")\r\nelse :\r\n print(\"YES\")\r\n flag = False\r\n for s in arr :\r\n if s[0]+s[1] == \"OO\" and flag == False :\r\n s = \"++|\"+s[3]+s[4]\r\n flag = True\r\n else :\r\n if s[3]+s[4]==\"OO\" and flag == False :\r\n s = s[0]+s[1]+\"|++\"\r\n flag = True\r\n print(s)", "n=int(input())\r\nf=0\r\nbus=[]\r\nbus2=[]\r\nfor i in range(n):\r\n bus.append(input())\r\nfor i in range(n):\r\n s=bus[i]\r\n x=\"\"\r\n if s[:2]==\"OO\" and f==0:\r\n x+=\"++\"\r\n f=1\r\n else:\r\n x+=s[:2]\r\n x+=\"|\"\r\n if s[3:]==\"OO\" and f==0:\r\n x+=\"++\"\r\n f=1\r\n else:\r\n x+=s[3:]\r\n bus2.append(x)\r\nif f==0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for row in bus2:\r\n print(f'{row[0]}{row[1]}{row[2]}{row[3]}{row[4]}')", "l = []\r\nfor i in range(int(input())):\r\n s = input()\r\n l.append(s)\r\nflag = 0\r\nfor i in range(len(l)):\r\n if l[i][0] == \"O\" and l[i][1] == \"O\":\r\n flag = 1\r\n l[i] = \"++\" + l[i][2:]\r\n break\r\n elif l[i][3] == \"O\" and l[i][4] == \"O\":\r\n flag = 1\r\n l[i] = l[i][:3] + \"++\"\r\n break\r\nif flag == 0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in l:\r\n print(i)\r\n\r\n\r\n\r\n", "\r\n\r\n\r\ninput_value = []\r\nfor i in range(int(input())):\r\n n =input()\r\n input_value.append(n)\r\nvalue = []\r\ncount = 0\r\nfor string in input_value:\r\n \r\n if count<=0 and ((string[0]+string[1]) ==\"OO\" or(string[3]+string[4]) ==\"OO\"):\r\n if ((string[0]+string[1])+(string[3] + string[4])) ==\"OOOO\":\r\n st = list(string)\r\n st[0] = \"+\"\r\n st[1] = \"+\"\r\n string =\"\".join(st)\r\n value.append(string)\r\n\r\n else:\r\n string = string.replace(\"OO\", \"++\")\r\n count += 1\r\n value.append(string)\r\n \r\n else:\r\n value.append(string)\r\nif input_value == value:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for ans in value:\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 ", "n = int(input())\r\na = []\r\nexist = False\r\nfor i in range(n):\r\n temp = list(map(str, input().split('|')))\r\n if temp[0] == 'OO' and not exist:\r\n temp[0] = '++'\r\n exist = True\r\n elif temp[-1] == 'OO' and not exist:\r\n temp[-1] = '++'\r\n exist = True\r\n a.append(temp)\r\nif exist:\r\n print('YES')\r\n for i in range(n):\r\n print('|'.join(a[i]))\r\nelse:\r\n print('NO')\r\n", "\r\na=[]\r\nfor i in range(int(input())):\r\n b=input()\r\n a.append(b)\r\n\r\nfor i in range(len(a)):\r\n sample=a[i]\r\n if(sample[:2]==\"OO\"):\r\n a[i]= \"++\"+sample[2:]\r\n count=1\r\n break\r\n\r\n elif(sample[3:]==\"OO\"):\r\n a[i]=sample[:3]+\"++\"\r\n count=1\r\n break\r\n else:\r\n count=0\r\nif(count==1):\r\n print(\"YES\")\r\n for i in range(len(a)):\r\n print(a[i])\r\nelse:\r\n print(\"NO\")", "a = int(input())\n\nseatpair = ['OO|XO','OO|OX','OO|OO','OO|XX','XO|OO','OX|OO','XX|OO']\n\nans = \"NO\"\n\nlines = []\n\nfor i in range(a):\n rows = input()\n if ans == \"NO\":\n if rows in seatpair:\n rows = rows.replace(\"OO\", \"++\", 1)\n ans = \"YES\"\n \n lines.append(rows)\nprint(ans)\nif ans == \"YES\": \n for line in lines:\n print(line)\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n", "def solve():\r\n n = int(input())\r\n s = '\\n'.join(input() for i in range(n)) \r\n if 'OO' in s:\r\n print(\"YES\")\r\n print(s.replace('OO', '++', 1))\r\n else:\r\n print(\"NO\")\r\n return\r\n\r\n\r\ndef main():\r\n for _ in range(1):\r\n solve()\r\n\r\n\r\nmain()", "import math\ndef solve(arr):\n for i,v in enumerate(arr):\n if v == 'OO':\n arr[i] = '++'\n print('YES', end='\\n')\n for j in range(0,len(arr),2):\n print(f'{arr[j]}|{arr[j+1]}',end='\\n')\n return\n print('NO')\n return\n\n \ndef main():\n #arr1 =list(map(int,input().split(' ')))\n #arr1 =input().split(' ')\n arr2 = []\n n = int(input())\n for j in range(n):\n i = input().split('|')\n # i = input().split(' ')\n #i = int(''.join(input().split(' ')))\n arr2 = arr2 + i\n solve(arr2)\n\nmain()", "n = int(input())\n\nbus = []\n\nfor i in range(n) :\n\tline = input().split('|')\n\tbus.append(line)\n\nsolved = False\n\nfor i in range(n) :\n\tfor j in range(2) :\n\t\tif(bus[i][j] == 'OO') :\n\t\t\tbus[i][j] = \"++\"\n\t\t\tsolved = True\n\t\t\tbreak\n\tif solved : break\n\t\nif solved :\n\tprint(\"YES\")\n\tfor i in range(n) : \n\t\tline = '|'.join(bus[i])\n\t\tprint(line)\n\nelse : 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/1512/A\r\ndef solution(data):\r\n if ('OO' in data): \r\n print('YES')\r\n print(data.replace('OO','++',1))\r\n else: \r\n print('NO')\r\n \r\n \r\nif __name__=='__main__':\r\n inp = str()\r\n for i in range(int(input())):\r\n inp+=input()\r\n inp+='\\n'\r\n solution(inp.strip())\r\n", "n = int(input())\r\nf = []\r\nwhile n:\r\n s = input()\r\n f.append(s)\r\n n-=1\r\n\r\n# print(f)\r\nx = 'OO'\r\ni = 0\r\nfinal = ''\r\nans = ''\r\nfor i in range(len(f)):\r\n if x in f[i]:\r\n ans = 'YES'\r\n j = f[i].index(x)\r\n f[i] = f[i][:j] + '++' + f[i][j+2:]\r\n break\r\n else:\r\n ans = 'NO'\r\n\r\nif ans == 'YES':\r\n print(ans)\r\n for i in f:\r\n print(i)\r\nelse:\r\n print(ans)\r\n", "s = '\\n'.join(input() for i in range(int(input())))\r\nif 'OO' in s:\r\n print('YES')\r\n print(s.replace('OO', '++', 1))\r\nelse:print('NO')", "n=int(input())\r\nbus=[]\r\nfor i in range(n):\r\n seats=input().split('|')\r\n bus.append(seats)\r\nflag=False\r\nfor seat in range(n):\r\n if bus[seat][0]=='OO':\r\n flag=True\r\n bus[seat][0]='++'\r\n break\r\n elif bus[seat][1]=='OO':\r\n flag=True\r\n bus[seat][1]='++'\r\n break\r\nif not flag:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n for i in range(n):\r\n print(bus[i][0]+'|'+bus[i][1])", "i = int(input())\nseats = []\nk = 0\nfoundSeat = False\nfor j in range(i):\n seat = input()\n seats.append(seat.split(\"|\"))\nfor seat in seats:\n if seat[0][0] == 'O' and seat[0][0] == seat[0][1]:\n foundSeat = True\n seat[0] = '++'\n break\n if seat[1][0] == 'O' and seat[1][0] == seat[1][1]:\n foundSeat = True\n seat[1] = '++'\n break\n\nif not foundSeat:\n print(\"NO\")\nelse:\n print('YES')\n for seat in seats:\n print(seat[0]+'|'+seat[1])\n\n\t\t\t\t\t \t\t \t\t\t\t\t \t \t\t\t\t \t", "n = int(input())\nseats = []\nseatThere = True\nfor i in range(n):\n seat = input()\n if \"OO\" in seat and seatThere:\n seatL = list(seat)\n if seatL[0] == 'O' and seatL[1] == 'O':\n seatL[0] = '+'\n seatL[1] = '+'\n elif seatL[3] == 'O' and seatL[4] == 'O':\n seatL[3] = '+'\n seatL[4] = '+'\n seatThere = False\n seat = ''.join(seatL)\n seats.append(seat)\nif seatThere:\n print(\"NO\")\nelse:\n print(\"YES\")\n for seat in seats:\n print(seat)\n", "import math\nimport sys\nfrom collections import defaultdict\nimport heapq\nfrom collections import deque\n#input = sys.stdin.readline\nUSE_FILE = False \n\ndef search(k, v):\n p = 0\n a, n = len(v), len(v)\n while a >= 1:\n while p + a < n and k > v[p+a]:\n p += a\n a //= 2\n if k > v[p+a]:\n p += 1\n return p+1\n\nglobal maxi\nmaxi = -999999999999999 \n\ndef prnt(numbers):\n print(\"\\n\".join(map(str, numbers)))\n\ndef check(numbers):\n return sum(numbers) / 4 == (numbers[1] + numbers[2]) / 2 == numbers[-1] - numbers[0]\n\n\ndef main():\n n = int(input().strip())\n m = []\n found = False\n for i in range(n):\n s = input().strip()\n seats = s.split(\"|\")\n m.append([i for i in s])\n if found is False and (seats[0] == \"OO\" or seats[1] == \"OO\"):\n print(\"YES\")\n found = True\n if seats[0] == \"OO\":\n m[i][0], m[i][1] = '+', '+'\n elif seats[1] == \"OO\":\n m[i][3], m[i][4] = '+', '+'\n if found == False:\n print(\"NO\")\n return\n for r in m:\n print(\"\".join(r))\n\n\n\n\n\n\n\nif __name__==\"__main__\":\n if USE_FILE:\n sys.stdin = open('/home/stefan/input.txt', 'r')\n main()\n", "n = int (input ())\r\nresult = 'NO'\r\nconfiguration = []\r\nfor i in range (n):\r\n row = input ()\r\n if result == 'NO':\r\n if row [ : 2] == 'OO':\r\n result = 'YES'\r\n row = '++' + row [2 : ]\r\n elif row [3 : ] == 'OO':\r\n result = 'YES'\r\n row = row [ : 3] + '++'\r\n configuration.append (row)\r\nprint (result)\r\nif result == 'YES':\r\n for row in configuration:\r\n print (row)\r\n", "#By Anan instagram: anan.ssw\r\nn=int(input())\r\narr=[]\r\nf=False\r\nfor x in range(n):\r\n s=input()\r\n if s[:2]=='OO':\r\n s=\"++\"+s[2:]\r\n arr.append(s)\r\n f=True\r\n break\r\n elif s[3:]=='OO':\r\n s=s[:3]+\"++\"\r\n arr.append(s)\r\n f=True\r\n break\r\n \r\n else:\r\n arr.append(s)\r\nif x!=n-1:\r\n x+=1\r\n while x<n:\r\n arr.append(input())\r\n x+=1\r\nif f: \r\n print(\"YES\")\r\n for x in arr:\r\n print(x)\r\nelse:\r\n print(\"NO\")\r\n \r\n ", "n=int(input())\r\nisk='OO'\r\nb=0\r\nc=[]\r\nfor i in range(n):\r\n a=str(input())\r\n if isk in a and b==0:\r\n a=a.replace(isk,'++',1)\r\n b=1\r\n c.append(a)\r\nif b==0:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n for i in c:\r\n print(i)", "a = int(input())\r\nb = []\r\nfor i in range(a):\r\n b.append(list(map(str,input())))\r\npossible = False\r\nfor j in range(a):\r\n for k in range(2):\r\n if b[j][k*3] == 'O' and b[j][k*3+1] == 'O':\r\n b[j][k*3] = '+'\r\n b[j][k*3+1] = '+'\r\n possible = True\r\n break\r\n if possible:\r\n break\r\nif possible:\r\n print('YES')\r\n for i in range(a):\r\n for j in range(5):\r\n print(b[i][j],end = '')\r\n print()\r\nelse:\r\n print('NO')", "n = int(input())\r\ntickets = []\r\nfor i in range(n):\r\n seat = input()\r\n tickets.append(seat)\r\ntickets = '\\n'.join(tickets)\r\na = tickets.find('OO')\r\nif a < 0:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n print(tickets[:a] + '++' + tickets[a + 2:])", "g=[]\r\np=0\r\nfor i in range(int(input())):\r\n x=str(input())\r\n if p==0 and \"OO\" in x:\r\n x=x.replace(\"OO\",\"++\",1)\r\n p=1\r\n g.append(x)\r\nif p==1:\r\n print(\"YES\")\r\n for i in g:\r\n print(i)\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nk='NO'\r\nsp=''\r\nfor i in range(n):\r\n s1=input()\r\n sp = sp + ' ' + s1\r\n\r\nspisok = sp.split()\r\n\r\nfor i in range(n):\r\n s1=spisok[i]\r\n if k!='YES':\r\n s2=''\r\n if ('OO' in s1):\r\n pos = s1.find('OO')\r\n if pos!=0:\r\n s1=s1[:pos]+'++'\r\n else:\r\n s1='++'+s1[pos+2:]\r\n k='YES'\r\n spisok[i]=s1\r\n\r\nprint(k)\r\nif k=='YES':\r\n for i in range(n):\r\n print(spisok[i])\r\n \r\n \r\n", "def main():\n rows = []\n count_rows = int(input())\n flag = False\n\n for _ in range(count_rows):\n s = input()\n rows.append(s)\n \n for row in rows:\n if \"OO\" in row:\n flag = True\n break\n \n if not flag: print(\"NO\")\n else:\n showed = False\n print(\"YES\")\n for row in rows:\n if showed: print(row)\n else:\n if \"OO\" in row:\n showed = True\n new_row = row.replace(\"OO\", \"++\", 1)\n print(new_row)\n else:\n print(row)\n\nif __name__ == '__main__':\n main()\n\t\t\t\t\t\t \t \t \t\t \t\t \t\t\t", "a=[]\r\nl=0\r\np=''\r\nfor _ in range(int(input())):\r\n s=input()\r\n if s[0:2]=='OO' and l==0:\r\n p=p+'++|'+s[3]+s[4]\r\n a.append(p)\r\n l=1\r\n elif s[3:]=='OO' and l==0:\r\n p=p+s[0]+s[1]+'|'+'++'\r\n a.append(p)\r\n l=1\r\n else:\r\n a.append(s)\r\nif l==1:\r\n print(\"YES\")\r\n for i in a:\r\n print(i)\r\nelse:\r\n print('NO')", "n=int(input())\r\na=[]\r\nfor i in range(0,n,1):\r\n s=input()\r\n b=[]\r\n b[:0]=s\r\n a.append(b)\r\nz=0\r\nfor i in range(0,n,1):\r\n if a[i][0]=='O' and a[i][1]=='O':\r\n z=1\r\n a[i][0]='+'\r\n a[i][1]='+'\r\n break\r\n elif a[i][3]=='O' and a[i][4]=='O':\r\n z=1\r\n a[i][3]='+'\r\n a[i][4]='+'\r\n break\r\nif z==0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in range(0,n,1):\r\n a[i]=\"\".join(a[i])\r\n print(a[i])", "n = int(input())\r\n\r\ns = \"\"\r\nwhile n:\r\n seat = input()\r\n s += seat\r\n s += \",\"\r\n n -= 1\r\nif \"OO\" not in s:\r\n print(\"NO\")\r\nelse:\r\n s = (s.replace(\"OO\", \"++\", 1))\r\n s = s[:-1]\r\n s = s.split(\",\")\r\n print(\"YES\")\r\n for i in s:\r\n print(i)", "n=int(input())\r\nflag=0\r\nl=[]\r\nfor i in range(n):\r\n s=str(input())\r\n s=list(s)\r\n e=''\r\n for j in range(0,len(s)-1):\r\n if(s[j]==s[j+1]=='O' and flag==0):\r\n flag=1\r\n s[j]='+'\r\n s[j+1]='+'\r\n e=e.join(s)\r\n l.append(e)\r\nif(flag==0):\r\n print('NO')\r\nelse:\r\n print('YES')\r\n for j in range(0,len(l)):\r\n print(l[j])", "n=int(input())\na=[]\nfor i in range(n):\n a.append([str(x) for x in input()])\n\nt=0\nfor i in range(n):\n if a[i][0]=='O' and a[i][1]=='O':\n a[i][0]='+'\n a[i][1]='+'\n t=1\n break\n else:\n if a[i][3]=='O' and a[i][4]=='O':\n a[i][3]='+'\n a[i][4]='+'\n t=1\n break\nif t==0:\n print('NO')\nif t==1:\n print('YES')\n for i in range(n):\n ans=''\n for j in range(5):\n ans=ans+a[i][j]\n print(ans)\n", "'''\r\n# Submitted By M7moud Ala3rj\r\nDon't Copy This Code, CopyRight . [email protected] © 2022-2023 :)\r\n'''\r\n# Problem Name = \"Bus to Udayland\"\r\n# Class: A\r\n\r\nimport sys\r\n#sys.setrecursionlimit(2147483647)\r\ninput = sys.stdin.readline\r\ndef print(*args, end='\\n', sep=' ') -> None:\r\n sys.stdout.write(sep.join(map(str, args)) + end)\r\n\r\ndef Solve():\r\n bus = []\r\n e=False\r\n for n in range(int(input())):\r\n row = input().strip()\r\n if \"OO\" in row and not e:\r\n row = row.replace(\"OO\", \"++\", 1)\r\n e = True\r\n bus.append(row)\r\n \r\n if e:\r\n print(\"YES\")\r\n print(*bus, sep=\"\\n\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n Solve()", "\r\n\r\n\r\nn = int(input())\r\n\r\nbus = []\r\nfor i in range(n):\r\n bus.append(input())\r\n\r\nestado = False\r\nfor i in range(len(bus)):\r\n if(bus[i][0] == 'O' and bus[i][1] == 'O'):\r\n bus[i] = \"++|\" + bus[i][3::]\r\n estado = 1\r\n break\r\n\r\n if(bus[i][3] == 'O' and bus[i][4] == 'O'):\r\n bus[i] = bus[i][:2] + \"|++\"\r\n estado = 1\r\n break\r\n\r\nif(estado):\r\n print(\"YES\")\r\n for i in bus:\r\n print(i)\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nbus = []\r\nfor i in range(n):\r\n x = input()\r\n row = [x[0],x[1],x[3],x[4]]\r\n bus.append(row)\r\n\r\nans = \"NO\"\r\n\r\nfor i in bus:\r\n if i[0] == \"O\" and i[1] == \"O\":\r\n ans = \"YES\"\r\n i[0] = \"+\" \r\n i[1] = \"+\"\r\n break\r\n elif i[2] == \"O\" and i[3] == \"O\":\r\n ans = \"YES\"\r\n i[2] = \"+\"\r\n i[3] = \"+\"\r\n break\r\n \r\nif ans == \"NO\":\r\n print(ans)\r\n\r\nelse:\r\n print(ans)\r\n for i in bus:\r\n print(\"%s%s|%s%s\" % (i[0],i[1],i[2], i[3]))", "import sys\n\ninput()\ns = sys.stdin.read()\nx = s.find(\"OO\")\nprint(\"NO\" if x < 0 else \"YES\\n\" + s[:x] + \"++\" + s[x + 2 :])\n", "\r\nt = int(input())\r\nc = 1\r\na = []\r\n\r\ncheck = False\r\nfor i in range(t):\r\n s = input()\r\n if s.__contains__(\"OO\"):\r\n check = True\r\n\r\n a.append(s)\r\n\r\nif check:\r\n print(\"YES\")\r\n for i in range(len(a)):\r\n\r\n if a[i].__contains__(\"OO\"):\r\n if c == 1:\r\n print(a[i].replace('OO', '++', 1))\r\n c -= 1\r\n else:\r\n print(a[i])\r\n\r\n else:\r\n print(a[i])\r\n\r\n\r\n\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n\r\n", "rows=int(input())\r\nlist1=[]\r\n\r\np=0\r\nfor i in range(rows):\r\n a=input()\r\n list1.append(a)\r\n \r\nfor i in range(rows):\r\n if list1[i][0]==\"O\" and list1[i][1]==\"O\":\r\n print(\"YES\")\r\n for j in range(rows):\r\n if j==i:\r\n print(\"+\",end=\"\")\r\n print(\"+\",end=\"\")\r\n print(list1[j][2],end=\"\")\r\n print(list1[j][3],end=\"\")\r\n print(list1[j][4])\r\n \r\n else:\r\n \r\n print(list1[j])\r\n \r\n \r\n break\r\n elif list1[i][3]==\"O\" and list1[i][4]==\"O\":\r\n print(\"YES\")\r\n for j in range(rows):\r\n if j==i:\r\n print(list1[j][0],end=\"\")\r\n print(list1[j][1],end=\"\")\r\n print(list1[j][2],end=\"\")\r\n print(\"+\",end=\"\")\r\n print(\"+\")\r\n else:\r\n print(list1[j])\r\n \r\n \r\n \r\n \r\n break\r\n else:\r\n p=p+1\r\n if p==rows:\r\n print(\"NO\")\r\n break\r\n\r\n\r\n", "n = int(input())\r\na = [str(input()) for i in range(n)]\r\nflag = False\r\nfor i in range(n):\r\n\tif a[i][:2]=='OO':\r\n\t\tflag = True\r\n\t\ta[i] = '++'+a[i][2:]\r\n\t\tbreak\r\n\telse:\r\n\t\tif a[i][3:]=='OO':\r\n\t\t\tflag= True\r\n\t\t\ta[i] = a[i][:3]+'++'\r\n\t\t\tbreak\r\nif flag:\r\n\tprint(\"YES\")\r\n\tfor i in a:\r\n\t\tprint(i)\r\nelse:\r\n\tprint(\"NO\")\r\n", "a = int(input())\r\ns = []\r\nq = 'NO'\r\n\r\nfor i in range(a):\r\n s.append(list(input().split('|')))\r\nfor i in range(len(s)):\r\n for j in range(len(s[i])):\r\n if s[i][j] == 'OO':\r\n s[i][j] = '++'\r\n q = \"YES\"\r\n break\r\n if q == 'YES':\r\n break\r\n\r\nprint(q)\r\nif q == \"YES\":\r\n for i in s:\r\n print(f'{i[0]}|{i[1]}')\r\n", "t=int(input())\r\nls=[]\r\nfor i in range (t):\r\n ls.append(input().split('|'))\r\nfor j in range (t):\r\n if ls[j][0]==\"OO\":\r\n ls[j][0]=\"++\"\r\n print(\"YES\")\r\n for k in range (t):\r\n print('|'.join(ls[k]))\r\n break\r\n elif ls[j][1]==\"OO\":\r\n ls[j][1]=\"++\"\r\n print(\"YES\")\r\n for k in range (t):\r\n print('|'.join(ls[k]))\r\n break\r\n elif j==t-1:\r\n print(\"NO\")\r\n ls=[]\r\n", "n=int(input())\r\nli=[]\r\nfl=0\r\nfor i in range(n):\r\n x=input()\r\n if 'OO' in x and fl==0:\r\n s1=x[:2]\r\n s2=x[3:]\r\n if 'OO' in s1:\r\n rep1=s1.replace('OO','++')\r\n x=rep1+'|'+s2\r\n elif 'OO' in s2:\r\n rep2=s2.replace('OO','++')\r\n x=s1+'|'+rep2\r\n fl=1\r\n li.append(x)\r\nif fl==0:\r\n print('NO')\r\nelse:\r\n print(\"YES\")\r\n for i in range(n):\r\n print(li[i])\r\n\r\n ", "n = int(input())\na = ''\ntmp = 0\nfor i in range(n):\n b = input()\n if tmp==0:\n if b.find('OO')==0:\n b = '++'+b[2:]\n tmp = 1\n elif b.find('OO')==3:\n b = b[:3]+'++'\n tmp = 1\n a += b\n if i!=n-1:\n a+='\\n'\nif tmp==1:\n print(\"YES\")\n print(a)\nelse:\n print(\"NO\")", "anr = 'NO'\r\nanswer = ''\r\nfor i in range(int(input())):\r\n a, b = input().split(\"|\")\r\n if anr != \"YES\" and a == \"OO\":\r\n answer += \"++\" + \"|\" + b + '\\n'\r\n anr = \"YES\"\r\n elif anr != \"YES\" and b == \"OO\":\r\n answer += a + \"|\" + \"++\" + '\\n'\r\n anr = \"YES\"\r\n else:\r\n answer += a + \"|\" + b + '\\n'\r\nif anr == \"YES\":\r\n print(anr)\r\n print(answer)\r\nelse:\r\n print(anr)\r\n", "rows = int(input())\r\nseats = \"\"\r\nok = False\r\nfor i in range(rows):\r\n row = input()\r\n if \"OO\" in row and not ok:\r\n ok = True\r\n if row.index(\"OO\") == 0:\r\n row = row[2:]\r\n row = \"++\" + row\r\n else:\r\n row = row[:3]\r\n row += \"++\"\r\n seats += row + \"\\n\"\r\nif ok:\r\n print(\"YES\")\r\n print(seats)\r\nelse:\r\n print(\"NO\")", "s1='\\n'.join(input() for each in range(int(input())))\r\ns2=s1.replace('OO','++',1)\r\nif s1!=s2:\r\n print(\"YES\\n\"+s2)\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\narr=[]\r\nfor i in range(n):\r\n arr.append(input()) \r\nfor row in arr:\r\n if \"OO\" in row:\r\n x=row.replace(\"OO\",\"++\")\r\n if x==\"++|++\":\r\n x=\"++|OO\"\r\n arr[arr.index(row)]=x\r\n print(\"YES\")\r\n for i in arr:\r\n print(i)\r\n break\r\nelse:\r\n print(\"NO\")\r\n\r\n \r\n\r\n \r\n ", "n = int(input())\n\ns = []\nans = \"NO\"\nfor i in range(n):\n s.append(list(input()))\n if ans == \"NO\" and s[i][0] == 'O' and s[i][1] == 'O':\n ans = \"YES\"\n s[i][0 : 2] = '++'\n if ans == \"NO\" and s[i][3] == 'O' and s[i][4] == 'O':\n ans = \"YES\"\n s[i][3 :] = '++'\nprint(ans)\nif ans == \"YES\":\n for i in range(n):\n print(''.join(s[i]))\n", "n= int(input())\r\nli=\"\"\r\nf=0\r\nfor x in range(n):\r\n s=input()\r\n if (s[0]=='O' and s[1]=='O') and f==0:\r\n a='++'+s[2:]\r\n f=1\r\n elif(s[3]=='O' and s[4]=='O' ) and f==0:\r\n a = s[:3]+ '++'\r\n f=1\r\n else:\r\n a=s\r\n #print(a)\r\n li+=a\r\nif f==0:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n for i in range(n*5):\r\n print(li[i],end='')\r\n if (i+1)%5==0 and i>=4:print()\r\n\r\n", "arr=[]\r\nflag=True\r\nfor i in range(int(input())):\r\n sub=input()\r\n if(sub[:2]=='OO' and flag):\r\n sub='++'+sub[2:]\r\n arr.append(sub)\r\n flag=False\r\n elif(sub[3:]=='OO' and flag):\r\n sub=sub[:3]+'++'\r\n arr.append(sub)\r\n flag=False\r\n else:\r\n arr.append(sub)\r\nif(flag==True):\r\n print(\"NO\")\r\nelse:\r\n print('YES')\r\n for i in arr:\r\n print(i)", "import sys\n\nn = int(input())\ns = sys.stdin.read().strip()\nif \"OO\" in s:\n print(\"YES\")\n print(s.replace(\"OO\", \"++\", 1))\nelse:\n print(\"NO\")\n", "n=int(input())\r\nl=[]\r\nk=0\r\nfor i in range(0,n):\r\n x=str(input())\r\n l.append(x)\r\nfor j in range(0,n):\r\n if(\"OO\" in l[j][0:2]):\r\n k+=1\r\n l[j]=l[j][0:2].replace(\"OO\",\"++\")+l[j][2:]\r\n break\r\n elif(\"OO\" in l[j][3:]):\r\n k+=1\r\n l[j]=l[j][0:3]+l[j][3:].replace(\"OO\",\"++\")\r\n break\r\nif(k==0):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for x in range(0,n):\r\n print(l[x])", "#\n# Joseph Matsushita\n# Problem A\n#\n\nn = int(input())\na = list()\n\nfor _ in range(n):\n a.append(input())\n\nfound = False\nfor i in range(n):\n if a[i][0:2] == 'OO':\n a[i] = '++' + a[i][2:5]\n found = True\n break\n elif a[i][3:5] == 'OO':\n a[i] = a[i][0:3] + '++'\n found = True\n break\n\nif(found):\n print(\"YES\")\n for i in a:\n print(i)\nelse:\n print(\"NO\")\n \t\t \t \t \t \t\t\t \t \t\t\t \t", "n=int(input())\r\nseat_found=0 \r\n\r\nmy_arr=[] \r\n\r\nfor i in range(n):\r\n #seat not found yet \r\n if seat_found==0:\r\n p1,p2=input().split(\"|\")\r\n if p1==\"OO\":\r\n my_arr.append(\"++|\"+p2)\r\n seat_found=1\r\n elif p2==\"OO\":\r\n my_arr.append(p1+\"|++\")\r\n seat_found=1 \r\n else:\r\n my_arr.append(p1+\"|\"+p2)\r\n\r\n\r\n\r\n #seat has been found \r\n else:\r\n my_arr.append(input())\r\n\r\nif seat_found==1:\r\n print(\"YES\")\r\n for p in range(n):\r\n print(my_arr[p])\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n \r\n ", "l = []\r\nflag = False\r\nfor _ in range(int(input())):\r\n a, b = input().split(\"|\")\r\n if a == 'OO' and not flag:\r\n flag = True\r\n a = '++'\r\n elif b == 'OO' and not flag:\r\n flag = True\r\n b = '++'\r\n\r\n l.append([a, b])\r\nif flag:\r\n print(\"YES\")\r\n for i in l:\r\n print('|'.join(i))\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\nl = []\r\nfor x in range(n):\r\n [a,b] = input().split('|')\r\n l.append([a,b])\r\nfound = 'NO'\r\nfor i in l:\r\n for j in range(2):\r\n if i[j] == 'OO':\r\n i[j] = '++'\r\n found = 'YES'\r\n break\r\n if found == 'YES':\r\n break\r\nprint(found)\r\nc = 0\r\nif found == 'YES':\r\n for i in range(len(l)):\r\n for j in l[i]:\r\n print(j,end='')\r\n if c%2 == 0:\r\n print('|',end='')\r\n else:\r\n print()\r\n c+=1\r\n ", "a = int(input())\r\nc = []\r\nt = 0\r\nfor _ in range(a):\r\n d = input() + '\\n'\r\n if 'OO' in d and t == 0:\r\n t = 1\r\n d = d.replace('OO','++',1)\r\n c.append(d)\r\nif t == 0:\r\n print('No')\r\nelse:\r\n print('Yes')\r\n print(*c,sep='')", "n = int (input ())\r\ncounter = 0\r\ncounter1 = 0\r\ns = ''\r\nfor i in range (n):\r\n a = input()\r\n if a[0] == a[1] == 'O' and counter1 == 0:\r\n counter = 1\r\n counter1 = 1\r\n s += '++' + a[2:5] + '\\n'\r\n elif a[3] == a[4] == 'O' and counter1 == 0:\r\n counter = 1\r\n counter1 = 1\r\n s += a[:3] + '++' + '\\n'\r\n else:\r\n s += a + '\\n'\r\nif counter == 0:\r\n print (\"NO\")\r\nelse:\r\n print (\"YES\")\r\n print (s)", "n = int(input())\r\nseats = []\r\n\r\nfor i in range(n):\r\n row = input()\r\n if row.endswith('\\n'):\r\n row = row[:-1]\r\n seats.append(row)\r\n\r\nfound = False\r\nfor i in range(n):\r\n if 'OO' in seats[i]:\r\n found = True\r\n seats[i] = seats[i].replace('OO', '++', 1)\r\n break\r\n\r\nif found:\r\n print('YES')\r\n for i in range(n):\r\n print(seats[i], end='\\n')\r\nelse:\r\n print('NO')\r\n", "n = int(input())\r\nl =[]\r\nc = 0\r\nfor _ in range(n):\r\n s = list(map(str,input().strip()))\r\n l.append(s)\r\n\r\nfor x in range(n):\r\n if l[x][0] == \"O\" and l[x][1]==\"O\" and c==0:\r\n c += 1 \r\n l[x][0] = \"+\"\r\n l[x][1] = \"+\"\r\n break\r\n elif l[x][3] == \"O\" and l[x][4]==\"O\" and c==0:\r\n c += 1\r\n l[x][3] = \"+\"\r\n l[x][4] = \"+\"\r\n break\r\nif c==0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in l:\r\n print(\"\".join(i))\r\n ", "n:int = int(input())\r\nanswer:list = ['NO']\r\nc = 0\r\nfor i in range(n):\r\n row = input()\r\n if 'OO' in row and c < 1:\r\n answer[0] = 'YES'\r\n answer.append(row.replace('OO', '++', 1))\r\n c += 1\r\n else:\r\n answer.append(row)\r\nif c == 1:\r\n print('\\n'.join(answer))\r\nelse:\r\n print('NO')", "n=int(input())\r\ncar=[]\r\nbus=[]\r\nfor i in range(n):\r\n a,b=input().split(\"|\")\r\n car.extend([a,b])\r\n bus.append([a,b])\r\nif \"OO\" in car :\r\n print(\"YES\")\r\n q=car.index(\"OO\")\r\n r=q//2\r\n c=q%2\r\n bus[r][c]=\"++\"\r\n for j in range(n):\r\n print(\"|\".join(x for x in bus [j]))\r\nelse:\r\n print(\"NO\")", "t = int(input())\r\nli = []\r\nfor i in range(t):\r\n li.append(input().split('|'))\r\n\r\n\r\nflag = False\r\nfor i in range(t):\r\n for j in range(2):\r\n if li[i][j] == 'OO':\r\n li[i][j] = '++'\r\n flag = True\r\n break\r\n if flag:\r\n break\r\n\r\n\r\nif flag:\r\n print(\"YES\")\r\n for i in range(t):\r\n for j in range(1):\r\n print(li[i][j] + '|' + li[i][j + 1])\r\nelse:\r\n print(\"NO\")", "lst,count,res=[],0,\"\"\r\nfor i in range(int(input())):\r\n lst.append(input())\r\nfor j in range(len(lst)):\r\n if lst[j][0]==\"O\" and lst[j][1]==\"O\":\r\n temp=list(lst[j])\r\n temp[0],temp[1]=\"+\",\"+\"\r\n lst[j]=\"\".join(temp)\r\n count=1\r\n break\r\n elif lst[j][3]==\"O\" and lst[j][4]==\"O\":\r\n temp=list(lst[j])\r\n temp[3],temp[4]=\"+\",\"+\"\r\n lst[j]=\"\".join(temp)\r\n count=1\r\n break\r\nif count==1:\r\n print(\"YES\")\r\n for i in lst:\r\n res+=\"\".join(i)+\"\\n\"\r\n print(res)\r\nelse:\r\n print(\"NO\")\r\n \r\n ", "n = int(input())\r\na = []\r\nk = 0\r\nfor i in range(n):\r\n\ts = input()\r\n\tif (s[0] == s[1] and s[0] == 'O') and k == 0:\r\n\t\tk = 1\r\n\t\ts = '++' + s[2:]\r\n\telif s[3] == s[4] and s[3] == 'O' and k == 0:\r\n\t\tk = 1\r\n\t\ts = s[:3] + '++'\r\n\ta.append(s)\r\nif k:\r\n\tprint('YES')\r\n\tprint(*a, sep = '\\n')\r\nelse:\r\n\tprint('NO')", "n = int(input())\r\narranged = []\r\nfor i in range(n):\r\n seat = input()\r\n arranged.append(seat)\r\n\r\nfor i in range(n):\r\n if \"OO\" in arranged[i]:\r\n arranged[i] = arranged[i].replace(\"OO\", \"++\",1)\r\n print(\"YES\")\r\n for j in arranged:\r\n print(j)\r\n break\r\n elif \"OO\" not in arranged[n - 1] and i == (n - 1):\r\n print(\"NO\")\r\n ", "li=[]\r\nflag=False\r\nfor _ in range(int(input())):\r\n s=input()\r\n li.append(s)\r\nfor i in range(len(li)):\r\n if \"OO\" in li[i]:\r\n li[i]=li[i].replace(\"OO\",\"++\",1)\r\n flag=True\r\n break\r\nif flag:\r\n print(\"YES\")\r\n print(*li,sep=\"\\n\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "a = int(input())\r\nb = \"\"\r\ni = 0\r\n\r\nfor i in range(a):\r\n b += input() + \"\\n\"\r\n i+=1\r\n\r\nc = list(b)\r\ni = 0\r\n \r\nwhile i < len(b):\r\n if b[i] == \"O\" and b[i+1] == \"O\":\r\n print(\"YES\")\r\n c[i] = \"+\"\r\n c[i+1] = \"+\"\r\n print(\"\".join(c))\r\n break\r\n else:\r\n i+=1\r\n if i == len(b):\r\n print(\"NO\")\r\n \r\n", "c = \"\"\r\n\r\ne = \"NO\"\r\nfor _ in range(int(input(\"\"))):\r\n a = input(\"\").split(\"|\")\r\n if a[0] == \"OO\" and \"++\" not in c:\r\n c += f\"++|{a[1]}\"\r\n e = \"YES\"\r\n elif a[1] == \"OO\" and \"++\" not in c:\r\n e = \"YES\"\r\n c += f'{a[0]}|++'\r\n else:\r\n c += f\"{a[0]}|{a[1]}\"\r\n c += \"\\n\"\r\nif e != \"NO\":\r\n print(e)\r\n print(c)\r\nelse:\r\n print(e)\r\n", "n = int(input())\r\nall_seats = []\r\ncount = 0\r\nfor i in range(n):\r\n s1, s2, w, s3, s4 = input()\r\n all_seats.append([s1, s2, w, s3, s4])\r\n\r\nfor x in all_seats:\r\n if x[0] == x[1] == 'O':\r\n x[0] = '+'\r\n x[1] = '+'\r\n count += 1\r\n break\r\n elif x[3] == x[4] == 'O':\r\n x[3], x[4] = '+', '+'\r\n count += 1\r\n break\r\n\r\nif count > 0:\r\n print('YES')\r\n for x in all_seats:\r\n print(\"\".join(x))\r\nelse:\r\n print('NO')\r\n", "free = \"OO\"\r\nbook = \"++\"\r\naisle = \"|\"\r\nbus = []\r\n\r\ndef solve(n):\r\n\r\n ans = \"NO\"\r\n for i in range(0,n):\r\n sides = bus[i].split(aisle)\r\n\r\n #left side of aisle\r\n if sides[0] == free:\r\n bus[i] = book + aisle + sides[1]\r\n ans = \"YES\"\r\n break\r\n #right side of aisle\r\n elif sides[1] == free:\r\n bus[i] = sides[0] + aisle + book\r\n ans = \"YES\"\r\n break\r\n\r\n return ans\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n for i in range(0,n):\r\n bus.append(input())\r\n\r\n ans = solve(n)\r\n\r\n print(ans)\r\n\r\n if ans == \"YES\":\r\n for i in range(0,n):\r\n print(bus[i])", "r = int(input())\r\n\r\nrows = []\r\nseated = False\r\nfor _ in range(r):\r\n c = input()\r\n if not seated:\r\n if c[0] == \"O\" and c[1] == \"O\":\r\n seated = True\r\n rows.append(\"++|\"+c[3:5])\r\n continue\r\n elif c[3] == \"O\" and c[4] == \"O\":\r\n seated = True\r\n rows.append(c[0:2] + \"|++\")\r\n continue\r\n rows.append(c)\r\n\r\nif not seated:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for r in rows:\r\n print(r)", "if __name__ == \"__main__\":\r\n n = int(input())\r\n count = 0\r\n arr = []\r\n\r\n for i in range(n):\r\n s = input()\r\n st = list(s)\r\n\r\n if(count == 0):\r\n for i in range(len(st)-1):\r\n if(st[i] == 'O' and st[i+1] == 'O'):\r\n count += 1\r\n (st[i],st[i+1]) = ('+','+')\r\n break \r\n else:\r\n continue\r\n arr.append(\"\".join(str(e) for e in st))\r\n\r\n if(count == 1):\r\n print(\"YES\")\r\n for i in range(len(arr)):\r\n print(arr[i])\r\n else:\r\n print(\"NO\")\r\n", "t=int(input())\r\ntemp=[]\r\ncount=0\r\nfor i in range(t):\r\n l=input().split(\"|\")\r\n for i in range(2):\r\n if l[i]==\"OO\" and count==0:\r\n l[i]=\"++\"\r\n count=1\r\n break\r\n temp.append(l)\r\nif count==1:\r\n print(\"YES\")\r\n for i in temp:\r\n print(i[0]+\"|\"+i[1])\r\n \r\nelse:\r\n print(\"NO\")\r\n \r\n ", "a = int(input())\r\nb = []\r\nfor i in range (a):\r\n b.append(input())\r\ndef BU(a):\r\n for i in range (a):\r\n if b[i][0] == b[i][1] == \"O\":\r\n b[i] = \"++\" + b[i][2:]\r\n return True\r\n elif b[i][-2] == b[i][-1] == \"O\":\r\n b[i] = b[i][:-2] + \"++\"\r\n return True\r\n return False\r\nif BU(a):\r\n print(\"YES\")\r\n for i in range (a):\r\n print(b[i])\r\nelse:\r\n print(\"NO\")", "import string\r\nimport math\r\ndef gcd(a, b):\r\n if b == 0:\r\n return a\r\n return gcd(b, a % b)\r\n\r\ndef lcm(x, y):\r\n return (x*y)//gcd(x,y)\r\n\r\narr = []\r\ngotSeat = False\r\nfor _ in range(int(input())):\r\n arr.append(input().split(\"|\"))\r\n\r\nfor i in range(len(arr)):\r\n if arr[i][0] == \"OO\":\r\n arr[i][0] = \"++\"\r\n gotSeat = True\r\n break\r\n elif arr[i][1] == \"OO\":\r\n arr[i][1] = \"++\"\r\n gotSeat = True\r\n break\r\n\r\nif gotSeat:\r\n print(\"YES\")\r\n for i in arr:\r\n print(i[0] + \"|\" + i[1])\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\n\r\nbus = []\r\n\r\nfor x in range(n):\r\n s = input()\r\n row = [s[0], s[1], s[3], s[4]]\r\n bus.append(row)\r\n\r\nresult = 'NO'\r\n\r\nfor x in bus:\r\n if x[0] == 'O' and x[1] == 'O':\r\n result = 'YES'\r\n x[0] = '+'\r\n x[1] = '+'\r\n break\r\n if x[2] == 'O' and x[3] == 'O':\r\n result = 'YES'\r\n x[2] = '+'\r\n x[3] = '+'\r\n break\r\n\r\nif result == 'NO':\r\n print('NO')\r\nelse:\r\n print('YES')\r\n\r\n for x in bus:\r\n print('%s%s|%s%s' % (x[0], x[1], x[2], x[3]))\r\n", "n = int(input())\r\nbus = []\r\nfound = False\r\n\r\nfor i in range(n):\r\n row = input().strip()\r\n if not found:\r\n if \"OO\" in row:\r\n row = row.replace(\"OO\", \"++\", 1)\r\n found = True\r\n bus.append(row)\r\n\r\nif found:\r\n print(\"YES\")\r\n for row in bus:\r\n print(row)\r\nelse:\r\n print(\"NO\")", "import math\r\nfrom collections import OrderedDict\r\nfrom collections import Counter\r\nfrom itertools import combinations\r\nfrom itertools import accumulate\r\nimport operator\r\nimport bisect\r\nimport copy\r\n#a= list(map(int, input(\"\").strip().split()))[:n]\r\n\r\n'''\r\ndef solve(a,x):\r\n \r\nt=int(input(\"\"))\r\nfor _ in range(t):\r\n n,x= list(map(int, input(\"\").strip().split()))[:2]\r\n a= list(map(int, input(\"\").strip().split()))[:n]\r\n solve(a,x)\r\n\r\n'''\r\ndef solve(b):\r\n a=0\r\n for i in range(len(b)):\r\n if \"\".join(b[i][:2])=='OO':\r\n b[i][0]=\"+\"\r\n b[i][1]=\"+\"\r\n a=1\r\n break\r\n elif \"\".join(b[i][3:])==\"OO\":\r\n b[i][3]=\"+\"\r\n b[i][4]=\"+\"\r\n a=1\r\n break\r\n if a==0:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n for i in b:\r\n print(''.join(i))\r\nn=int(input(\"\"))\r\nd=[]\r\nfor i in range(n):\r\n d.append(list(input(\"\")))\r\nsolve(d)", "a = int(input())\r\nb = []\r\nfor i in range(a):\r\n b.append(input())\r\ncount = 0\r\nfor i in range(len(b)):\r\n if 'OO|OO' in b[i]:\r\n b[i] = 'OO|++'\r\n break\r\n elif 'OO' in b[i]:\r\n b[i] = b[i].replace('OO','++')\r\n break\r\n else:\r\n count += 1\r\nif count == a:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in b:\r\n print(''.join(i))\r\n \r\n", "test = 1 #int(input())\r\nfor _ in range(test):\r\n n = int(input())\r\n a = []\r\n flag = 0\r\n for _ in range(n):\r\n s=list(input())\r\n if s[0]=='O' and s[1]=='O' and flag==0:\r\n flag = 1\r\n s[0] = '+'\r\n s[1] = '+'\r\n a.append(s)\r\n elif s[3]=='O' and s[4]=='O' and flag==0:\r\n s[4]='+'; s[3]= '+'\r\n flag = 1\r\n a.append(s)\r\n else:\r\n a.append(s)\r\n if flag==1:\r\n print(\"YES\")\r\n for x in a:\r\n for y in x:\r\n print(y, end=\"\")\r\n print()\r\n else:\r\n print(\"NO\")", "n=int(input())\r\nt=0\r\ns=[]\r\nfor i in range(n):\r\n s.append([j for j in input().split('|')])\r\nfor i in range(n):\r\n if s[i][0]=='OO':\r\n s[i][0]='++'\r\n t=1\r\n break\r\n if s[i][1]=='OO':\r\n s[i][1]='++'\r\n t=1\r\n break\r\nif t==0:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n for i in s:\r\n print('|'.join(i))\r\n\r\n", "def check(c):\r\n\tfor i in range(len(c)):\r\n\t\tif c[i][0]=='OO':\r\n\t\t\tc[i][0]='++'\r\n\t\t\treturn c\r\n\t\tif c[i][1]=='OO':\r\n\t\t\tc[i][1]='++'\r\n\t\t\treturn c\r\n\treturn 0\r\nn=int(input())\r\nc=[]\r\nfor i in range(n):\r\n\tc.append(input().split('|'))\r\nl=check(c)\r\nif l==0:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\r\n\tfor i in range(len(l)):\r\n\t\tl[i]='|'.join(l[i])\r\n\tfor i in range(len(l)):\r\n\t\tprint(l[i])\r\n\t\r\n", "number=int(input())\r\nsits=[input() for s in range(number)]\r\ncn=0\r\nfor i in range(number):\r\n if sits[i].find('OO')!=-1:\r\n sits[i]=sits[i].replace('OO','++',1)\r\n print('YES',*[a for a in sits],sep='\\n')\r\n cn=1\r\n break\r\nif cn!=1:print('NO')", "a = int(input())\r\nseats = []\r\nfor i in range(a):\r\n seats.append(input())\r\nseats = \"\\n\".join(seats)\r\nif seats.count(\"OO\"):\r\n print(\"YES\")\r\n print(seats.replace(\"OO\",\"++\",1))\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\nl=[]\r\nc=0\r\nfor _ in range(n):\r\n s=input()\r\n l.append(s)\r\nfor i in range(n):\r\n if l[i][0]=='O' and l[i][1]=='O':\r\n l[i]=\"+\"+\"+\"+l[i][2:]\r\n \r\n c=1\r\n break\r\n \r\n \r\n elif l[i][3]=='O' and l[i][4]=='O':\r\n l[i]=l[i][:3]+\"+\"+\"+\"\r\n \r\n \r\n \r\n c=1\r\n break\r\n \r\nif c==0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in l:\r\n print(i)\r\n \r\n", "l=[]\r\nfor _ in range(int(input())):\r\n s=input()\r\n l.append(s)\r\nflag=0\r\nfor i in range(len(l)):\r\n if 'OO' in l[i]:\r\n flag=1\r\n if l[i].count(\"OO\")>1:\r\n l[i]=l[i].replace(\"OO\",\"++\")\r\n l[i]=\"++|OO\"\r\n break\r\n else:\r\n l[i]=l[i].replace(\"OO\",\"++\")\r\n break\r\nif flag==1:\r\n print(\"YES\")\r\n for i in l:\r\n print(i,end='\\n')\r\nelse:\r\n print(\"NO\")", "q=int(input())\r\nw=[]\r\nl=0\r\nfor e in range(q):\r\n r=input().split('|')\r\n w.append(r)\r\nw=[i for o in w for i in o]\r\nif 'OO' in w:\r\n print('YES')\r\n for m in range(len(w)):\r\n if w[m]=='OO':\r\n z=m\r\n break\r\n for g in range(len(w)):\r\n if g==z:\r\n k='++'\r\n else:\r\n k=w[g]\r\n if l%2==0:\r\n f='|'\r\n else:\r\n f='\\n'\r\n print(k,end=f)\r\n l+=1\r\nelse:\r\n print('NO')", "n=int(input())\r\nalist=[]\r\n\r\nfor i in range(n):\r\n clist=[]\r\n word=str(input())\r\n for i in range(len(word)):\r\n clist.append(word[i])\r\n alist.append(clist)\r\n\r\nldr=3\r\nfor j in range(n):\r\n a=alist[j]\r\n if a[0]==\"O\" and a[1]==\"O\":\r\n a[0]=\"+\"\r\n a[1]=\"+\"\r\n ldr=0\r\n break\r\n elif a[3]==\"O\" and a[4]==\"O\":\r\n a[3]=\"+\"\r\n a[4]=\"+\"\r\n ldr=0\r\n break\r\nif ldr==3:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in alist:\r\n print(\"\".join(i))\r\n ", "n=int(input())\r\nd=0\r\na=[]\r\nfor i in range(n):\r\n h=input()\r\n if(d==0):\r\n if(h[0]=='O' and h[1]=='O'):\r\n h=h.replace('O','+',2)\r\n d=1\r\n elif(h[3]=='O' and h[4]=='O'):\r\n h=h[::-1]\r\n h=h.replace('O','+',2)\r\n h=h[::-1]\r\n d=1\r\n a.append(h)\r\nif(d==1):\r\n print(\"YES\")\r\n for j in a:\r\n print(j)\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\nb=[]\r\nflag=0\r\nfor i in range(n):\r\n s=input()\r\n b.append([s[:2],s[-2:]])\r\nfor i in range(n):\r\n for j in range(2):\r\n if(b[i][j]==\"OO\"):\r\n b[i][j]=\"++\"\r\n flag=1\r\n break\r\n if(flag==1):\r\n break\r\nif(flag==0):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in range(n):\r\n print(b[i][0]+\"|\"+b[i][1])", "rows = int(input())\r\nseats = [input() for i in range(rows)]\r\nfor i in range(rows):\r\n if \"OO\" in seats[i]:\r\n seats[i] = seats[i].replace(\"OO\", '++', 1)\r\n print(\"YES\")\r\n for j in range(rows):\r\n print(seats[j])\r\n break\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\nrws=[]\r\nfor a in range(0,n):\r\n line=input()\r\n rws.append(line)\r\nu=0\r\nfor k in range(0,n):\r\n if rws[k][0]==\"O\" and rws[k][1]==\"O\":\r\n print(\"YES\")\r\n u=1\r\n for vb in range(0,n):\r\n if vb==k:\r\n print(\"++\"+\"|\"+rws[k][3]+rws[k][4])\r\n else:\r\n print(rws[vb])\r\n break\r\n if rws[k][3]==\"O\" and rws[k][4]==\"O\":\r\n print(\"YES\")\r\n u=1\r\n for vb in range(0,n):\r\n if vb==k:\r\n print(rws[k][0]+rws[k][1]+\"|\"+\"++\")\r\n else:\r\n print(rws[vb])\r\n break\r\nif u==0:\r\n print(\"NO\")", "n=int(input())\r\narr=[]\r\nfor i in range(n):\r\n arr.append(input())\r\nflag=0\r\nfor i in range(n):\r\n if flag==0:\r\n for j in range(1,5):\r\n if arr[i][j]==arr[i][j-1] and arr[i][j]=='O':\r\n arr[i]=arr[i][:j-1]+'++'+arr[i][j+1:]\r\n # print(i)\r\n # i[j]='+'\r\n # i[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 for i in arr:\r\n print(i)\r\n", "n = int(input())\r\nl=[]\r\nfor _ in range(n):\r\n l.append(input())\r\n\r\nrep=[]\r\ndone=False\r\n\r\nfor s in l:\r\n last=False\r\n stemp=s\r\n if not done:\r\n if s[0]==\"O\" and s[1]==\"O\":\r\n stemp=\"++|\"+s[3]+s[4]\r\n done=True\r\n elif s[3]==\"O\" and s[4]==\"O\":\r\n stemp=s[0]+s[1]+\"|++\"\r\n done=True\r\n rep.append(stemp)\r\n\r\nif done:\r\n print(\"YES\")\r\n for s in rep:\r\n print(s)\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nL = []\r\nc = 0\r\nfor i in range(n): L.append(input())\r\nfor i in range(n):\r\n if 'OO' in L[i]:\r\n L[i] = L[i].replace('OO', '++', 1)\r\n c += 1\r\n break\r\nif c > 0:\r\n print('YES')\r\n for i in L: print(i)\r\nelse: print('NO')", "n_rows = int(input())\r\ndata = [input() for i in range(n_rows)]\r\nflag = 1\r\nfor i, row in enumerate(data):\r\n if \"OO|\" in row:\r\n data[i] = data[i].replace(\"OO|\", \"++|\")\r\n break\r\n elif \"|OO\" in row:\r\n data[i] = data[i].replace(\"|OO\", \"|++\")\r\n break\r\nelse:\r\n flag = 0\r\n print(\"NO\")\r\nif flag:\r\n print(\"YES\")\r\n print(\"\\n\".join(data))", "def find_empty_seats(bus_config):\r\n for i in range(len(bus_config)):\r\n if \"OO\" in bus_config[i]:\r\n return i, bus_config[i].index(\"OO\")\r\n return -1, -1\r\n\r\ndef modify_bus_config(bus_config, row, col):\r\n new_config = bus_config[:]\r\n new_config[row] = new_config[row][:col] + \"++\" + new_config[row][col + 2:]\r\n return new_config\r\n\r\ndef main():\r\n n = int(input())\r\n bus_config = [input() for _ in range(n)]\r\n\r\n row, col = find_empty_seats(bus_config)\r\n \r\n if row != -1 and col != -1:\r\n print(\"YES\")\r\n new_bus_config = modify_bus_config(bus_config, row, col)\r\n for line in new_bus_config:\r\n print(line)\r\n else:\r\n print(\"NO\")\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "am = int(input())\r\nd = 0\r\nan = []\r\nfor i in range(am):\r\n row = input()\r\n if \"OO\" in row:\r\n if d != 1:\r\n d = d+1\r\n row = row.replace(\"OO\",\"++\",1)\r\n an.append(row)\r\nif d == 1:\r\n print(\"YES\")\r\n print(*an, sep=\"\\n\")\r\nelse:\r\n print(\"NO\")", "a=int(input())\r\nw=''\r\nfor i in range(a):\r\n b=input()\r\n w=w+b+'\\n'\r\nif w.count('OO')>0:\r\n print('YES\\n'+w.replace('OO','++',1)[:len(w)-1])\r\nelse:\r\n print(('NO'))\r\n", "\nans = []\nfound = False\nfor i in range(int(input())):\n r = list(input())\n if not found and r[0]==r[1]=='O':\n r[0] = r[1] = '+'\n found = True\n if not found and r[3]==r[4]=='O':\n r[3] = r[4] = '+'\n found = True\n ans.append(''.join(r))\n\nif not found:\n print('NO')\nelse:\n print('YES', *ans, sep='\\n')\n\n\n\n", "flag = False\r\nseat = []\r\nn = int(input())\r\n\r\nfor _ in range(n):\r\n s1, s2 = input().split('|')\r\n if not flag:\r\n if s1 == 'OO':\r\n s1 = '++'\r\n flag = True\r\n elif s2 == 'OO':\r\n s2 = '++'\r\n flag = True\r\n\r\n seat.append([s1, s2])\r\n\r\nif flag:\r\n print('YES')\r\n for i in range(n):\r\n print(seat[i][0]+'|'+seat[i][1])\r\nelse:\r\n print('NO')\r\n", "n = int(input())\nrows = [input() for _ in range(n)]\nfor i in range(n):\n row = rows[i]\n if row[:2] == \"OO\":\n row = \"++\"+row[2:]\n elif row[3:]==\"OO\":\n row = row[:3]+\"++\"\n else:\n continue\n rows[i] = row\n break\nelse:\n print(\"NO\")\n exit()\nprint(\"YES\")\nprint(\"\\n\".join(rows))\n\t\t\t \t\t \t\t \t \t \t \t", "import sys\r\ns1 = '\\n'.join(sys.stdin.read().strip().split('\\n')[1:])\r\ns2 = s1.replace('OO', '++', 1)\r\nprint('YES\\n' + s2 if s1 != s2 else 'NO')\r\n", "def print_bus(bus : list, config : dict):\n for i in range(len(bus)):\n if(i==config['row']):\n row = bus[i]\n if(config['pair']==0):\n print(f'++|{row[3:]}')\n else:\n print(f'{row[0:2]}|++')\n else:\n print(bus[i])\n\ndef find_seat(bus : list, config : dict):\n for i in range(len(bus)):\n row = bus[i]\n if(row[0]=='O' and row[1]=='O'):\n config['row'] = i\n config['pair'] = 0\n return True\n if(row[3]=='O' and row[4]=='O'):\n config['row'] = i\n config['pair'] = 1\n return True\n return False\n\nbus = []\nconfig = {\n 'row': None,\n 'pair': None\n}\nrows = int(input())\nfor i in range(rows):\n bus.append(input())\nif(find_seat(bus,config)):\n print('YES')\n print_bus(bus,config)\nelse:\n print('NO')", "result=\"\"\r\nflag=False\r\nfor i in range(0,int(input())):\r\n\tcase=input()\r\n\tcaseLst=case.split(\"|\")\r\n\ttemp=case\r\n\tif flag==False:\r\n\t\tif caseLst[0]==\"OO\":\r\n\t\t\ttemp=\"++|\"+caseLst[1]\r\n\t\t\tflag=True\r\n\t\telif caseLst[1]==\"OO\":\r\n\t\t\ttemp=caseLst[0]+\"|\"+\"++\"\r\n\t\t\tflag=True\r\n\tresult+=temp+\"\\n\"\r\nif flag==True:\r\n\tprint(\"YES\\n\"+result.rstrip(\"\\n\"))\r\nelse:\r\n\tprint(\"NO\")", "n=int(input())\na=[]\n\nda=False\n\nfor i in range(n):\n inp1=input()\n inp=[]\n for j in inp1:\n inp.append(j)\n \n if inp[0:2].count('O')==2 and da==False:\n for k in range(2):\n inp[k]='+'\n da=True\n elif inp[3:].count('O')==2 and da==False:\n for k in range(3,5):\n inp[k]='+'\n da=True\n a.append(inp)\n\nif da:\n print('YES')\n for i in range(n):\n print(''.join(a[i]))\n\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\n\r\nseats = []\r\njudge = False\r\nfor i in range(n):\r\n seats.append(input())\r\n if 'OO' in seats[i] and not judge:\r\n judge = True\r\n seats[i] = seats[i].replace('OO', '++', 1)\r\nif not judge:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n print('\\n'.join(seats))", "def seats():\r\n lst = []\r\n status = False\r\n \r\n t = int(input())\r\n \r\n for i in range(t):\r\n temp = input()\r\n \r\n if not status:\r\n \r\n if temp[:2] == \"OO\":\r\n status = True\r\n temp = \"++\" + temp[2:]\r\n \r\n elif temp[3:] == \"OO\":\r\n status = True\r\n temp = temp[:3] + \"++\"\r\n \r\n lst.append(temp)\r\n \r\n if status:\r\n print(\"YES\")\r\n print(*lst, sep=(\"\\n\"))\r\n \r\n else:\r\n print(\"NO\")\r\n \r\n \r\nseats()", "list1 = []\r\njudge = False\r\nfor i in range(int(input())):\r\n list1.append(input())\r\n if 'OO' in list1[-1] and judge == False:\r\n judge = True\r\n if list1[-1][:2] == 'OO':\r\n list1[-1] = '++'+list1[-1][2:]\r\n else:\r\n list1[-1] = list1[-1][:3]+'++'\r\nif judge:\r\n print('YES')\r\n for i in range(len(list1)):\r\n print(list1[i])\r\nelse:\r\n print('NO')\r\n", "h = []\r\nz = 0 \r\nl = int(input())\r\nfor _ in range(l):\r\n a, b = input().split(\"|\")\r\n\r\n if(a[0]==\"O\" and a[1]==\"O\" and z!=1):\r\n z = 1\r\n a = \"++|\"+b\r\n h.append(a)\r\n \r\n elif(b[0]==\"O\" and b[1]==\"O\" and z!=1):\r\n z = 1\r\n b = a+\"|++\"\r\n h.append(b)\r\n else:\r\n a = a+\"|\"+b\r\n h.append(a)\r\n\r\nif z:\r\n print(\"YES\")\r\n for j in range(l):\r\n print(h[j])\r\nelse:\r\n print(\"NO\")", "a=int(input())\r\nc=[]\r\nf=1\r\nfor x in range(a):\r\n b=input()\r\n if 'OO' in b and f==1:\r\n f=2\r\n if b[0]+b[1]=='OO':\r\n c.append('++'+b[2]+b[3]+b[4])\r\n else:\r\n c.append(b[0]+b[1]+b[2]+'++')\r\n else:\r\n c.append(b)\r\nif f==1:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n for x in range(a):\r\n print(c[x])\r\n \r\n ", "class Solution:\r\n\tdef __init__(self):\r\n\t\tpass\r\n \r\n\tdef solve(self):\r\n\t\tt = int(input())\r\n\t\tresult = []\r\n\t\tfound = False\r\n\r\n\t\tfor i in range(t):\r\n\t\t\trow = input()\r\n\t\t\tresult.append(row)\r\n\r\n\t\tfor i in range(t):\r\n\t\t\tif result[i][0] == 'O' and result[i][1] == 'O':\r\n\t\t\t\tresult[i] = \"++|{}{}\".format(result[i][3], result[i][4])\r\n\t\t\t\tfound = True\r\n\t\t\t\tbreak\r\n\t\t\telif result[i][3] == 'O' and result[i][4] == 'O':\r\n\t\t\t\tresult[i] = \"{}{}|++\".format(result[i][0], result[i][1])\r\n\t\t\t\tfound = True\r\n\t\t\t\tbreak\r\n\r\n\t\tif found:\r\n\t\t\tprint(\"YES\")\r\n\t\t\tfor row in result:\r\n\t\t\t\tprint(row)\r\n\t\telse:\r\n\t\t\tprint(\"NO\")\r\n\t\t\r\n \r\nif __name__ == \"__main__\":\r\n\tsol = Solution()\r\n\tsol.solve()\r\n", "n=int(input())\r\na=[]\r\nfl=0\r\nfor i in range(n):\r\n a.append(input())\r\n if a[i][:2]=='OO' and fl==0:\r\n a[i]='++'+a[i][2:]\r\n fl=1\r\n elif a[i][3:]=='OO' and fl==0:\r\n a[i]=a[i][:3]+'++'\r\n fl=1\r\nif fl==1:\r\n print('YES')\r\n for i in range(len(a)):\r\n print(a[i])\r\nelse:\r\n print('NO')\r\n", "import sys\r\n\r\n\r\ndef main(fin):\r\n m = int(fin.readline())\r\n l = []\r\n for i in range(m):\r\n l.append(fin.readline().rstrip(\"\\n\"))\r\n lnew = solve(l, m)\r\n for i in range(len(lnew)):\r\n print(lnew[i])\r\n\r\n\r\n\r\n\r\ndef solve(l, m):\r\n a = 'OO'\r\n b = '++'\r\n d = []\r\n for i in range(m):\r\n y = l[i]\r\n c = y.find(a)\r\n if c == 0:\r\n l[i] = b + y[2:]\r\n d.append('YES')\r\n d.extend(l)\r\n return d\r\n elif c == 3:\r\n l[i] = y[:3] + b\r\n d.append('YES')\r\n d.extend(l)\r\n return d\r\n d.append('NO')\r\n return d\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n fin = sys.stdin\r\n # fin = open(\"input.txt\")\r\n main(fin)\r\n", "n = int(input())\r\nss = \"\"\r\nflag = 0\r\nfor i in range(n):\r\n s = input().split(\"|\")\r\n if flag == 0 and s[0] == \"OO\":\r\n ss += \"++\"\r\n flag = 1\r\n else:\r\n ss += s[0]\r\n ss += \"|\"\r\n if flag == 0 and s[1] == \"OO\":\r\n ss += \"++\"\r\n flag = 1\r\n else:\r\n ss += s[1]\r\n ss += \"\\n\"\r\nif flag == 0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(ss)\r\n", "\r\nn=int(input())\r\narr=[]\r\nfor i in range(n):\r\n\tarr.append(input())\r\nfor i in range (len(arr)):\r\n\ts=\"\"\r\n\tif arr[i][0]==\"O\" and arr[i][1]==\"O\":\r\n\t\tprint(\"YES\")\r\n\t\ts=\"+\"+\"+\"+\"|\"+arr[i][3]+arr[i][4]\r\n\t\tarr[i]=s\r\n\t\tfor i in arr:\r\n\t\t\tprint(i)\r\n\t\tbreak\r\n\telif arr[i][3]==\"O\" and arr[i][4]==\"O\":\r\n\t\tprint(\"YES\")\r\n\t\ts=arr[i][0]+arr[i][1]+\"|\"+\"+\"+\"+\"\r\n\t\tarr[i]=s\r\n\t\t\r\n\t\tfor i in arr:\r\n\t\t\tprint(i)\r\n\t\tbreak\r\nelse:print(\"NO\")\r\n", "a = int(input())\nb = ''\nfor i in range(a):\n b += str(input())+'''\n'''\nif b.count(\"OO\") > 0:\n b = b.replace(\"OO\", \"++\", 1)\n print(\"YES\")\n print(b)\nelse:\n print(\"NO\")", "n = int(input())\r\nb = False\r\ns = []\r\nfor i in range(n):\r\n a = input()\r\n if not b:\r\n if \"OO\" in a:\r\n b = True\r\n a = a.replace(\"OO\", \"++\", 1)\r\n s.append(a)\r\nif not b:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in s:\r\n print(i)", "rows = int(input())\ns = '\\n'.join([input() for i in range(rows)])\nif 'OO' in s:\n s = s.replace('OO', '++', 1)\n print('YES')\n print(s)\nelse:\n print('NO')", "a = []\r\ncheck = 0\r\nn = int(input())\r\nfor _ in range(n):\r\n b = list(input())\r\n if(b[0] == 'O' and b[1] == 'O' and check == 0):\r\n b[0] = '+'\r\n b[1] = '+'\r\n check = 1\r\n if(b[3] == 'O' and b[4] == 'O' and check == 0):\r\n b[3] = '+'\r\n b[4] = '+'\r\n check = 1\r\n a += b\r\n\r\nif(check == 1):\r\n print('YES')\r\n c = 0\r\n d = 5\r\n for i in range(n):\r\n print(''.join(a[c:d]))\r\n c += 5\r\n d += 5\r\n \r\n \r\nelse:\r\n print('NO')\r\n\r\n\r\n", "n=int(input())\r\na=[]\r\nok=False\r\nfor i in range(n):\r\n a.append(list(input()))\r\nfor i in range(n):\r\n if a[i][0] == a[i][1] and a[i][0]=='O':\r\n a[i][0]=a[i][1]='+'\r\n ok=True\r\n break\r\n elif a[i][3]== a[i][4] and a[i][3]=='O':\r\n a[i][3]=a[i][4]='+'\r\n ok=True\r\n break\r\nif not ok:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in a:\r\n for j in i:\r\n print(j,end=\"\")\r\n print()\r\n", "\r\nn = int(input())\r\narr = []\r\nfor i in range(n) :\r\n arr.append(input())\r\n\r\n\r\n\r\ndef solve(n , arr) :\r\n for i in range(n) :\r\n if (arr[i][0] == arr[i][1] and arr[i][0] == 'O') :\r\n print(\"YES\")\r\n arr[i] = '++|' + arr[i][3] + arr[i][4]\r\n for i in range(n) :\r\n print(arr[i])\r\n return\r\n if (arr[i][3] == arr[i][4] and arr[i][3] == 'O') :\r\n print(\"YES\")\r\n arr[i] = arr[i][0] + arr[i][1] + '|++'\r\n for i in range(n) :\r\n print(arr[i])\r\n return\r\n\r\n print(\"NO\")\r\n\r\n\r\nsolve(n , arr)", "n, res = int(input()), \"NO\"\r\nlst = []\r\nfor x in range(n): lst.append(input())\r\nfor x in range(n): \r\n if lst[x][0] == lst[x][1] == \"O\":\r\n lst[x] = \"++|\" + lst[x][3:5]\r\n res = \"YES\"\r\n break\r\n elif lst[x][3] == lst[x][4] == \"O\":\r\n lst[x] = lst[x][0:3] + \"++\"\r\n res = \"YES\"\r\n break\r\nif res == \"YES\": \r\n print(res)\r\n for x in lst: print(x)\r\nelse: print(res)", "n=int(input())\r\nl1,f=[],False\r\nfor _ in range(n):\r\n l1.append(input())\r\nfor i in range(n):\r\n if 'OO' in l1[i]:\r\n l1[i]=l1[i].replace('OO','++')\r\n if l1[i]=='++|++':l1[i]='++|OO'\r\n f=True\r\n break \r\nif f :\r\n print(\"YES\")\r\n for i in l1:print(i)\r\nelse : print(\"NO\")", "n = int(input())\r\nlst = []\r\nfor yu in range(n):\r\n s = input()\r\n for j in s:\r\n lst.append(j)\r\nerr = 0\r\nfor i in range(len(lst)-1):\r\n if i%5 == 0 or i%5 == 3:\r\n if lst[i] == \"O\" and lst[i+1] == \"O\":\r\n lst[i] = \"+\"\r\n lst[i+1] = \"+\"\r\n err += 1\r\n break\r\nif err == 0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\", end='')\r\n for i in range(len(lst)):\r\n if i%5 == 0:\r\n print()\r\n print(lst[i], end='')\r\n ", "n = int(input())\narr = []\nfor i in range(n):\n arr.append(input().split('|'))\nfound = True\n\nfor k, v in enumerate(arr):\n if v[0] == 'OO':\n print('YES')\n found = False\n arr[k][0] = '++'\n break\n elif v[1] == 'OO':\n print('YES')\n found = False\n arr[k][1] = '++'\n break\nif found:\n print('NO')\nelse:\n for i in arr:\n print(i[0] + '|' + i[1])", "def solve(test):\r\n n = int(input())\r\n ok = False\r\n s = []\r\n for i in range(n):\r\n t = list(input())\r\n for i in range(len(t) - 1):\r\n if not ok and t[i] == 'O' and t[i + 1] == 'O':\r\n ok = True\r\n t[i] = '+'\r\n t[i + 1] = '+'\r\n break\r\n s.append('' . join(t))\r\n if ok :\r\n print('YES')\r\n for i in s:\r\n print(i)\r\n else:\r\n print('NO')\r\nt = 1\r\nfor _ in range(t):\r\n solve(_ + 1)", "res, ok = '', False\r\nn = int(input())\r\nfor i in range(n):\r\n s = input()\r\n if not ok:\r\n idx = s.find(\"OO\")\r\n if idx != -1:\r\n s = s[ : idx] + \"++\" + s[idx + 2 : ]\r\n ok = True\r\n res += s + '\\n'\r\nif (ok):\r\n print(f\"YES\\n{res}\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nm = []\r\na = 'NO'\r\nfor i in range(n):\r\n m.append(input())\r\n if 'OO' in m[i] and a == 'NO':\r\n a = 'YES'\r\n m[i] = m[i].replace('OO', '++', 1)\r\nprint(a)\r\nif a == 'YES':\r\n for i in m:\r\n print(i)\r\n", "def empty_pair_of_seats(n, seats):\r\n empty = False\r\n for i in range(n):\r\n for j in range(2):\r\n if seats[i][j] == 'OO':\r\n seats[i][j] = '++'\r\n empty = True\r\n break\r\n if empty:\r\n break\r\n return empty, seats\r\n\r\nn = int(input())\r\nseats = []\r\nfor i in range(n):\r\n seats.append([item for item in input().split('|')])\r\nempty, seats = empty_pair_of_seats(n, seats)\r\nif empty:\r\n print('YES')\r\n for i in range(n):\r\n print(seats[i][0] + '|' + seats[i][1])\r\nelse:\r\n print('NO')", "x = int(input())\r\n\r\na = []\r\nfor i in range(x):\r\n a.append(str(input()))\r\nn = 0\r\nfor v in range(x):\r\n place = a[v]\r\n place = place.split(\"|\")\r\n if place[0] == \"OO\":\r\n n = 1\r\n a[v] = \"++|\" + place[1]\r\n break\r\n elif place[1] == \"OO\":\r\n n = 1\r\n a[v] = place[0] + \"|++\"\r\n break\r\n else:\r\n pass\r\nif n == 0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in range(x):\r\n print(a[i])\r\n\r\n\r\n", "n = int(input())\r\nl = []\r\nfor i in range(n):\r\n a = input()\r\n l.append(a.split(\"|\"))\r\nfor i in range(n):\r\n if \"OO\" in l[i]:\r\n oo_index = l[i].index(\"OO\")\r\n l[i][oo_index] = \"++\"\r\n print(\"YES\")\r\n break\r\n\r\nif all(\"++\" not in l[i] for i in range(n)):\r\n print(\"NO\")\r\n exit()\r\n\r\nfor i in range(n):\r\n print(\"|\".join(l[i]))", "n = int(input())\nyesorno = 0\nrows = \"\"\nfor i in range(n):\n row = input()\n rows += row\n rows += \"\\n\"\nif rows.find(\"OO\") != -1:\n print(\"YES\")\n print(rows.replace(\"OO\", \"++\", 1))\nelse:\n print(\"NO\")", "a = []\r\nf = 0\r\nhola= []\r\nfor i in range(int(input())):\r\n b = input()\r\n a.append(b)\r\n#print(a)\r\nfor t in a:\r\n if \"OO\" in t and f ==0:\r\n f = 1\r\n k = t.replace('OO','++',1)\r\n hola.append(k)\r\n\r\n else:\r\n #print(t)\r\n hola.append(t)\r\nif f==1:\r\n print('YES')\r\n for it in hola:\r\n print(it)\r\nelse:\r\n print('NO')", "t = int(input())\r\nq = 1;l = []\r\nfor _ in range(t):\r\n a = input().split('|') \r\n if a[0] == 'OO' and q:\r\n a[0] = '++'\r\n q = 0\r\n elif a[1] == 'OO' and q:\r\n a[1] = '++'\r\n q = 0\r\n l.append(a)\r\n \r\nif q:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n for i in l:\r\n print(i[0] + '|' + i[1])\r\n", "n=int(input())\r\nf=[]\r\ng=[]\r\ns=[]\r\nj=0\r\ncount=0\r\nfor i in range(n):\r\n a=input()\r\n s=s+[a]\r\n if 'OO' in a and count==0:\r\n count+=1\r\n k=i\r\n j=1\r\n for i in a:\r\n g=g+[i]\r\nif j==1:\r\n if g[0]=='O' and g[1]=='O':\r\n f='++'+g[2]+g[3]+g[4]\r\n elif g[3]=='O' and g[4]=='O':\r\n f=g[0]+g[1]+g[2]+'++' \r\n hh=s[0:k]+[f]+s[k+1:] \r\nif len(f)>0:\r\n print('YES')\r\n for i in hh:\r\n print(i)\r\nelse:\r\n print('NO')\r\n\r\n\r\n", "n = int(input())\r\nflag = 0\r\nnew_s = []\r\nfor i in range(n):\r\n s = input().split('|')\r\n if s[0] == 'OO' and flag != 1:\r\n new_s.append(f'++|{s[1]}')\r\n flag = 1\r\n elif s[1] == 'OO' and flag != 1:\r\n new_s.append(f'{s[0]}|++')\r\n flag = 1\r\n else:\r\n new_s.append('|'.join(s))\r\n\r\nif flag:\r\n print('YES')\r\n for n in new_s:\r\n print(n)\r\nelse:\r\n print('NO')\r\n \r\n\r\n\r\n\r\n", "n = int(input())\r\na = []\r\nc = 0\r\nfor i in range(n):\r\n x = input()\r\n a.append(x)\r\nfor i in range(n):\r\n if a[i][0:2] == \"OO\":\r\n z = a[i][3:]\r\n a[i] = \"++|\"+z\r\n print(\"YES\")\r\n for i in range(n):\r\n print(a[i])\r\n break\r\n elif a[i][3:] == \"OO\":\r\n z = a[i][0:2]\r\n a[i] = z+\"|++\"\r\n print(\"YES\")\r\n for i in range(n):\r\n print(a[i])\r\n break\r\n else:\r\n c+=1\r\n if c==n:\r\n print(\"NO\")\r\n", "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(arr):\r\n ans = []\r\n ok = False\r\n for i in arr:\r\n s = i.split(\"|\")\r\n if not ok:\r\n if s[0] == \"OO\":\r\n ok = True\r\n s[0] = \"++\"\r\n elif s[1] == \"OO\":\r\n ok = True\r\n s[1] = \"++\"\r\n ans.append(s[0]+\"|\"+s[1])\r\n\r\n if ok:\r\n print(\"YES\")\r\n for i in ans:\r\n print(i)\r\n else:\r\n print(\"NO\")\r\n\r\n\r\narr = []\r\nfor _ in range(int(input())):\r\n s = str(input())[:-1]\r\n arr.append(s)\r\nsolve(arr)", "#711A (52no. Problem A)\r\n\r\nn = int(input())\r\nsp = []\r\nfor i in range(n):\r\n r = input()\r\n sp.append(r)\r\n# print(sp)\r\n\r\nfor i in range(n):\r\n if 'OO' in sp[i]:\r\n sp[i] = sp[i].replace('OO','++',1)\r\n print(\"YES\")\r\n print(*sp,sep='\\n') \r\n break\r\n else:\r\n if (i == n-1):\r\n print(\"NO\") ", "empty = \"OO\"\r\nwalkway = \"|\"\r\nbus = []\r\nseats = \"++\"\r\ndef solve(n):\r\n\tans = \"NO\"\r\n\tfor i in range(n):\r\n\t\tsides = bus[i].split(walkway)\r\n\t\tif sides[0]==empty:\r\n\t\t\tbus[i] = seats + walkway + sides[1]\r\n\t\t\tans = \"YES\"\r\n\t\t\tbreak\r\n\t\telif sides[1]==empty:\r\n\t\t\tbus[i] = sides[0] + walkway + seats\r\n\t\t\tans = \"YES\"\r\n\t\t\tbreak\r\n\treturn ans\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n for i in range(n):\r\n bus.append(input())\r\n\r\n ans = solve(n)\r\n\r\n print(ans)\r\n\r\n if ans == \"YES\":\r\n for i in range(n):\r\n print(bus[i])\t", "n=int(input())\nleftList=[]\nrightList=[]\nflag=False\nFinalString=\"\"\nfor i in range(n):\n string=input()\n left,right=string.split(\"|\")\n leftList.append(left)\n rightList.append(right)\n\nfor i in range(len(leftList)):\n if leftList[i]==\"OO\":\n leftList[i]=\"++\"\n flag=True\n break\n\nfor i in range(len(rightList)):\n if flag:\n break\n if rightList[i]==\"OO\":\n rightList[i]=\"++\"\n flag=True\n break\n\nfor i in range(len(leftList)):\n FinalString+=leftList[i]+\"|\"+rightList[i]+\"\\n\"\n\nif flag:\n print(\"YES\")\n print(FinalString)\n\nelse:\n print(\"NO\")\n\n \t \t \t \t\t\t \t \t \t\t \t \t \t\t\t \t", "rows = int(input())\r\nstring = str()\r\n\r\nfor i in range(rows):\r\n places = str(input())\r\n string += places + '\\n'\r\n\r\nif string.find('OO') >= 0:\r\n print('YES')\r\n print(string.replace('OO', '++', 1))\r\nelse:\r\n print('NO')", "s,c='',''\r\nfor i in range(int(input())):\r\n s+=input()\r\ns=s.replace('|','')\r\ni,t=0,0\r\nwhile i<len(s)-1:\r\n if s[i:i+2]=='OO':\r\n t=1\r\n c+=s[:i]+'++'+s[i+2:]\r\n break\r\n i+=2\r\nif t:\r\n print('YES')\r\n i=0\r\n while i<=len(c)-1:\r\n print(c[i:i+2]+'|'+c[i+2:i+4])\r\n i=i+4\r\nelse:\r\n print('NO')", "c=0\r\na=[]\r\nt=int(input())\r\nfor j in range(t):\r\n l=list(input())\r\n if (l[0]=='O' and l[1]=='O') and c==0 :\r\n l[0]='+'\r\n l[1]='+'\r\n c=1\r\n a.append(l)\r\n elif (l[3]=='O' and l[4]=='O') and c==0:\r\n l[3]='+'\r\n l[4]='+'\r\n c=1\r\n a.append(l)\r\n else:\r\n a.append(l)\r\nif c==1:\r\n print(\"YES\")\r\n for i in range(t):\r\n print(\"\".join(a[i]))\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nlst = ['']*n\r\nplcFinded = False\r\nfor i in range(n):\r\n lst[i] = input()\r\n if not plcFinded and 'OO' in lst[i]:\r\n plcFinded = True\r\n lst[i] = lst[i].replace('OO', '++', 1)\r\nif plcFinded:\r\n print('YES')\r\n for s in lst:\r\n print(s)\r\nelse:\r\n print('NO')", "# import sys\r\n# sys.stdout = open('DSA/Stacks/output.txt', 'w')\r\n# sys.stdin = open('DSA/Stacks/input.txt', 'r')\r\n\r\nn = int(input())\r\nflag = True\r\nll = []\r\nfor i in range(n):\r\n zz = input()\r\n kk = zz.split(\"|\")\r\n for j in range(len(kk)):\r\n if kk[j] == \"OO\" and flag==True:\r\n kk[j] = \"++\"\r\n flag = False\r\n ll.append(kk)\r\nif flag:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in range(len(ll)):\r\n print(f\"{ll[i][0]}|{ll[i][1]}\")", "count = 0\r\nseats = []\r\nfor _ in range(int(input())):\r\n row = input()\r\n if count == 0 and row.count('OO') >= 1:\r\n row = row.replace('OO', '++', 1)\r\n count += 1\r\n seats.append(row)\r\nif count != 0:\r\n print('YES')\r\n print(*seats, sep='\\n')\r\nelse:\r\n print('NO')", "def find(li):\r\n for i in li:\r\n for j in range(0,len(i)-1):\r\n if i[j] == i[j+1] == \"O\":\r\n i[j] = \"+\"\r\n i[j+1] = \"+\"\r\n return 1\r\n return 0\r\n\r\nn = int(input())\r\nli = []\r\nfor i in range(0,n):\r\n s = str(input())\r\n li.append(list(s))\r\nif find(li):\r\n print(\"YES\")\r\n for i in li:\r\n print(\"\".join(i))\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nseats = []\r\nindexes = []\r\nattitude = 0\r\nfor i in range(n):\r\n seats.append(input())\r\n if 'OO' in seats[i]:\r\n attitude = 1\r\n indexes.append(i)\r\nif attitude==0:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n for j in range(n):\r\n if j==indexes[0]:\r\n newSeat=seats[j].replace('OO','++',1)\r\n print(newSeat)\r\n else:\r\n print(seats[j])\r\n\r\n", "length = int(input())\r\nseats = []\r\ns = []\r\nstat = False\r\nfor i in range(length):\r\n seats.append(input().split('|'))\r\n\r\nfor i in seats:\r\n for j in i:\r\n s.append(j)\r\n\r\nfor i in s:\r\n if i == 'OO':\r\n stat = True\r\n index = s.index(i)\r\n s[index] = '++'\r\n break\r\nif stat == True:\r\n print('YES')\r\n for i in range(0, len(s), 2):\r\n print(s[i], s[i+1], sep = '|')\r\nelse:\r\n print('NO')\r\n\r\n \r\n", "a = int(input())\r\nl1 = []\r\nf = False \r\nfor i in range(a):\r\n s = input()\r\n l1.append(s)\r\n\r\nfor i in range(a):\r\n if \"OO\" in l1[i]:\r\n l1[i] = l1[i].replace(\"OO\", \"++\", 1)\r\n f = True\r\n break\r\n\r\nif f:\r\n print(\"YES\")\r\n for y in l1:\r\n print(y)\r\nelse:\r\n print(\"NO\")\r\n", "t = int(input())\ns = [input() for _ in range(t)]\n\nfor i in range(len(s)):\n f = 0\n if s[i][0] == 'O' and s[i][1] == 'O':\n s[i] = '++' + s[i][2:]\n f = 1\n break\n elif s[i][3] == 'O' and s[i][4] == 'O':\n f = 1\n s[i] = s[i][:3] + '++'\n break\n\nif f:\n print('YES')\n print(*s, sep='\\n')\nelse:\n print('NO')", "n = int(input())\r\n\r\nbus = []\r\nfound_seats = False\r\n\r\nfor _ in range(n):\r\n row = input()\r\n if not found_seats:\r\n if \"OO\" in row:\r\n row = row.replace(\"OO\", \"++\", 1)\r\n found_seats = True\r\n bus.append(row)\r\n\r\nif found_seats:\r\n print(\"YES\")\r\n for row in bus:\r\n print(row)\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\nal=0\r\nd=[]\r\nfor i in range(n):\r\n k=input()\r\n if al==0:\r\n if 'OO' in k:\r\n al=1\r\n k=k.replace('OO','++',1)\r\n d.append(k)\r\nif al==1:\r\n print('YES')\r\n for e in range(n):\r\n print(d[e])\r\nelse:\r\n print('NO')\r\n \r\n \r\n", "n = int(input())\nb = [input() for _ in range(n)]\nres = \"NO\"\nfor i in range(n):\n if b[i].startswith(\"OO\"):\n b[i] = \"++\" + b[i][2:]\n res = \"YES\"\n break\n elif b[i].endswith(\"OO\"):\n b[i] = b[i][:3] + \"++\"\n res = \"YES\"\n break\nprint(res)\nif res == \"YES\":\n print(\"\\n\".join(b))\n", "import sys\r\ninput()\r\ns=sys.stdin.read()\r\nx=s.find('OO')\r\nprint('NO' if x<0 else 'YES\\n'+s[:x]+'++'+s[x+2:])", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append(list(input()))\r\nbull = False\r\nfor i in a:\r\n if i[0] == \"O\" and i[1] == \"O\":\r\n bull = True\r\n i[0] = \"+\"\r\n i[1] = \"+\"\r\n break\r\n elif i[3] == \"O\" and i[4] == \"O\":\r\n bull = True\r\n i[3] = \"+\"\r\n i[4] = \"+\"\r\n break\r\n\r\nif not(bull):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in a:\r\n for j in i:\r\n print(j, end='')\r\n print()", "n=int(input())\r\nbusSeats=list()\r\nfor i in range(n):\r\n rows=list(map(str, input().split('|')))\r\n busSeats.append(rows)\r\ncnt=0\r\nfor k in range(n):\r\n if(busSeats[k][0]=='OO' ):\r\n busSeats[k][0]='++'\r\n cnt+=1\r\n break\r\n elif(busSeats[k][1] == 'OO'):\r\n busSeats[k][1] = '++'\r\n cnt+=1\r\n break\r\nif(cnt>=1):\r\n print('YES')\r\n for _ in range(n):\r\n print('|'.join(busSeats[_]))\r\nelse:\r\n print('NO')\r\n", "flag = True\r\nlis = []\r\nfor word in range(int(input())):\r\n i = input().split('|')\r\n if 'OO' in i and flag:\r\n i[i.index('OO')] = '++'\r\n flag = False\r\n lis.append('|'.join(i))\r\nif flag:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\", '\\n'.join(lis), sep='\\n')", "n = int(input())\nA = [input() for _ in range(n)]\n\ndef solve(n,A):\n O, X = 'O', 'X'\n ans = 'NO'\n for i in range(n):\n s = A[i]\n if s[0] == O and s[1] == O:\n s = '+' + s[1:]\n s = s[0] + '+' + s[2:]\n A[i] = s\n ans = 'YES'\n break\n if s[3] == O and s[4] == O:\n s = s[:3] + '+' + s[4:]\n s = s[:4] + '+' \n A[i] = s\n ans = 'YES'\n break\n print(ans)\n if ans == 'YES':\n for s in A:\n print(s)\n\nsolve(n,A)", "a=int(input());x=\"\".join(input()+\"\\n\"for i in\" \"*a);y=x.replace(\"OO\",\"++\",1);print(\"NO\"*(x==y)or\"YES\\n\"+y)\r\n", "n = int(input())\r\nsolved = False\r\nr = []\r\nfor i in range(0, n):\r\n s = input()\r\n s = list(s)\r\n if s[0] == \"O\" and s[1] == \"O\" and not solved:\r\n solved = True\r\n s[0] = \"+\"\r\n s[1] = \"+\"\r\n elif s[3] == \"O\" and s[4] == \"O\" and not solved:\r\n solved = True\r\n s[3] = \"+\"\r\n s[4] = \"+\"\r\n r.append(\"\".join(s))\r\nif not solved:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for x in r:\r\n print(x)\r\n", "l=[]\r\nn=int(input())\r\nfor _ in range(n):\r\n l.append(input())\r\nc=0\r\nfor j in range(n):\r\n i=l[j]\r\n if i[0:2]=='OO' or i[3:]=='OO':\r\n if i[0:2]=='OO':\r\n l[j]='++'+i[2:]\r\n else:\r\n l[j]=i[:3]+'++'\r\n c=1\r\n break\r\nif(c==1):\r\n print(\"YES\")\r\n for i in l:\r\n print(i)\r\nelse:\r\n print('NO')\r\n", "rows=int(input())\r\nflag=0\r\nl=[]\r\nfor x in range(rows):\r\n\tl.append(input())\r\nfor y in range(rows):\r\n\tif \"OO\"in l[y]:\r\n\t\tl[y]=l[y].replace(\"OO\",\"++\",1)\r\n\t\tflag=1\r\n\t\tbreak\r\nif flag==1:\r\n\tprint(\"Yes\")\r\n\tprint(\"\\r\".join(l))\r\nelse:\r\n\tprint(\"No\")", "n = int(input())\nres = []\nfound = False\nfor _ in range(n):\n row = input()\n s = row.split('|')\n if not found:\n if s[0] != 'OO' and s[1] != 'OO':\n res.append(row)\n else:\n if s[0] == 'OO':\n res.append('++|' + s[1])\n else:\n res.append(s[0] + '|++')\n found = True\n else:\n res.append(row)\nif found:\n print('YES')\n print('\\n'.join(res))\nelse:\n print('NO')\n\n ", "n=int(input())\r\nans='NO'\r\nfind=True\r\nl_main=[]\r\nfor i in range(n):\r\n a=input()\r\n if 'OO' in a and find==True:\r\n ans='YES'\r\n find=False\r\n a=list(a)\r\n if a[0]=='O' and a[1]=='O':\r\n a.pop(0)\r\n a.pop(0)\r\n a.insert(0,'+')\r\n a.insert(0,'+')\r\n else:\r\n a.pop(4)\r\n a.pop(3)\r\n a.append('+')\r\n a.append('+')\r\n ans_main=''\r\n for i in a:\r\n ans_main+=i\r\n a=ans_main\r\n l_main.append(a)\r\nif ans=='YES':\r\n print(ans)\r\n for i in l_main:\r\n print(i)\r\nelse:\r\n print(ans)", "n = int(input())\r\nmoo = []\r\nblu = \"NO\"\r\ntig = []\r\nfor _ in range(n):\r\n moo.append(input())\r\nfor r in moo:\r\n if blu == \"NO\":\r\n if r[:2] == \"OO\":\r\n tig.append(\"++\" + r[2:])\r\n blu = \"YES\"\r\n elif r[3:] == \"OO\":\r\n tig.append(r[:3] + \"++\")\r\n blu = \"YES\"\r\n else:\r\n tig.append(r)\r\n else:\r\n tig.append(r)\r\nprint(blu)\r\nif blu == \"YES\":\r\n for a in tig:\r\n print(a)", "n = int(input())\r\ns = 0\r\nq = 0\r\nc = []\r\nfor i in range(1, n + 1):\r\n a = input()\r\n s += 1\r\n if 'OO|OO' in a:\r\n b = a[0:2].replace('OO', '++') + a[2:]\r\n c.append(b)\r\n q += 1\r\n break\r\n else:\r\n if 'OO' in a:\r\n b = a.replace('OO', '++')\r\n c.append(b)\r\n q += 1\r\n break\r\n else:\r\n c.append(a)\r\nfor i in range(s + 1, n + 1):\r\n a = input()\r\n c.append(a)\r\n\r\nif q == 1:\r\n print('YES')\r\n print('\\n'.join(c))\r\nelse:\r\n print('NO')", "t = int(input())\r\nflg = 0\r\narr = []\r\nfor i in range(t):\r\n temp = input()\r\n if 'OO' in temp and flg == 0:\r\n flg = 1\r\n if temp.index('OO') == 0:\r\n arr.append('++'+temp[2:5])\r\n else:\r\n arr.append(temp[:3]+'++')\r\n else:\r\n arr.append(temp)\r\nif flg == 0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in range(t):\r\n print(arr[i])", "n = int(input())\r\ni = 0\r\nf = n\r\nside = 2\r\nseats = []\r\nwhile i < n:\r\n s = input()\r\n s1 = str(s[0]) + str(s[1])\r\n s2 = str(s[3]) + str(s[4])\r\n if s1 == 'OO':\r\n f = i\r\n side = 0\r\n elif s2 == 'OO':\r\n f = i\r\n side = 1\r\n seats.append(s)\r\n i = i + 1\r\nif f == n and side == 2:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n i = 0\r\n while i < n:\r\n if i == f:\r\n if side == 0:\r\n print(\"++|\" + str(seats[i][3]) + str(seats[i][4]))\r\n else:\r\n print(str(seats[i][0]) + str(seats[i][1]) + \"|++\")\r\n else:\r\n print(seats[i])\r\n i = i + 1", "\n\ndef sit(s):\n\n my_list = list(s)\n global cou \n cou = 0\n if my_list[0] == my_list[1] == 'O':\n my_list[0] = my_list[1] = '+'\n cou+=1\n \n elif my_list[3] == my_list[4] == 'O':\n my_list[3] = my_list[4] = '+'\n cou+=1\n\n\n s = ''.join(my_list)\n return s\n\n\nseat = []\n\nrow = int(input())\n\nfor i in range(row):\n s = input()\n seat.append(s)\n \n\n\n\nseat[0] = sit(seat[0])\n\nfor i in range(1,len(seat)):\n if cou < 1:\n seat[i] = sit(seat[i])\n\nif cou < 1:\n print(\"NO\")\nelse:\n print(\"YES\")\n for i in seat:\n \n print(i,end=\"\\n\")\n\n\n", "n = int(input())\n\nm = 0\nc = 0\nl = []\n\nfor i in range(n):\n\n arr = [*input()]\n\n if arr[0] == arr[1] == 'O' and m == 0:\n c += 1\n\n elif arr[3] == arr[4] == 'O' and m == 0:\n c += 1\n\n l.append(arr)\n\nif c >= 1:\n print('YES')\n\n for arr in l:\n\n if arr[0] == arr[1] == 'O' and m == 0:\n arr[0], arr[1] = '+', '+'\n print(''.join(arr))\n m += 1\n\n elif arr[3] == arr[4] == 'O' and m == 0:\n arr[3], arr[4] = '+', '+'\n print(''.join(arr))\n m += 1\n\n else:\n print(''.join(arr))\n\nelse:\n print('NO')\n\n\n\n\n\n\n\n\n\n", "n=int(input())\r\na=[]\r\nc=0\r\nfor i in range(n):\r\n b=list(map(str,input()))\r\n if c == 0:\r\n if b[0]==b[1]==\"O\":\r\n c=1\r\n b[0]=\"+\"\r\n b[1]=\"+\"\r\n elif b[3]==b[4]==\"O\":\r\n c=1\r\n b[3]=\"+\"\r\n b[4]=\"+\"\r\n a.append(b)\r\nif c == 0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in range(n):\r\n print(*a[i],sep=\"\")\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Apr 17 11:27:37 2022\r\n\r\n@author: dehong\r\n\"\"\"\r\n\r\n\r\ns=\"\"\r\nfor i in range(int(input())):\r\n s=s+input()\r\n s=s+\"\\n\"\r\nif(s.count('OO')):\r\n print(\"YES\")\r\n print(s.replace('OO','++',1))\r\nelse:\r\n print(\"NO\")", "b=[]\r\nfor _ in range(int(input())):\r\n b.append(input())\r\nfor i in range(len(b)):\r\n if 'OO' in b[i]:\r\n b[i]=b[i].replace('OO','++',1)\r\n break\r\ns=0\r\nfor i in b:\r\n if '++' in i:\r\n s=s+1\r\n else:\r\n s=s+0\r\nif s>0:\r\n print('YES')\r\n for i in b:\r\n print(''.join(i))\r\nelse:\r\n print('NO')", "n=int(input())\r\nseats=[]\r\nfor i in range(n):\r\n seat=input()\r\n s=list(seat)\r\n seats.append(s)\r\n\r\nocc=0\r\nfor j in seats:\r\n if j[0]==\"O\" and j[1]==\"O\":\r\n j[0]=\"+\"\r\n j[1]=\"+\"\r\n occ=1\r\n break\r\n if j[3]==\"O\" and j[4]==\"O\":\r\n j[3]=\"+\"\r\n j[4]=\"+\"\r\n occ=1\r\n break\r\n\r\n \r\nif occ==1:\r\n print(\"YES\")\r\n for k in seats:\r\n st=''.join(map(str,k))\r\n print(st)\r\nelse:\r\n print(\"NO\")", "rows=int(input())\r\nseats=[]\r\nfound=False\r\nfor _ in range(rows):\r\n seats.append(input())\r\nfor i in range(rows):\r\n if 'OO' in seats[i]:\r\n if seats[i][0:2]=='OO':\r\n occ='++'+seats[i][2:]\r\n else:\r\n occ=seats[i][:3]+'++'\r\n seats[i]=occ\r\n found=True\r\n break\r\nif not found:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n for i in seats:\r\n print(i)", "n = int(input())\r\np = []\r\nb = False\r\nfor i in range (n):\r\n a = input()\r\n if a.find ('OO') > -1 and not b:\r\n b = True\r\n a = a.replace('OO', '++', 1)\r\n p.append(a)\r\n else:\r\n p.append(a)\r\nif b:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n exit()\r\nfor i in p:\r\n print(i)", "a = int(input())\r\nl = False\r\ns = []\r\nfor i in range(a):\r\n b = list(input())\r\n if l == False:\r\n if b[0] == \"O\" and b[1] == \"O\":\r\n l = True\r\n b[0] = \"+\"\r\n b[1] = \"+\"\r\n elif b[3] == \"O\" and b[4] == \"O\":\r\n l = True\r\n b[3] = \"+\"\r\n b[4] = \"+\"\r\n s.append(b)\r\nif l:\r\n print(\"Yes\")\r\n for i in range(a):\r\n print(*s[i],sep='')\r\n\r\nelse:\r\n print(\"NO\")", "from typing import Iterator, List\n\n\ndef get_num_input() -> Iterator[int]:\n return map(int, input().split())\n\n\ndef main() -> None:\n is_found: bool = False\n rows: List[str] = []\n\n for _ in range(int(input())):\n row: str = input()\n if \"OO\" in row and not is_found:\n row = row.replace(\"OO\", \"++\", 1)\n is_found = True\n\n rows.append(row)\n\n if is_found:\n print(\"YES\", *rows)\n\n else:\n print(\"NO\")\n\n\nif __name__ == \"__main__\":\n ONLY_ONCE: bool = True\n for _ in range(1 if ONLY_ONCE else int(input())):\n main()\n", "flag=0\r\nn=int(input())\r\na=\"\"\r\nfor i in range(n):\r\n s=input().split(\"|\")\r\n if s[0]==\"OO\" and flag==0:\r\n a+=\"++|\"\r\n a+=s[1]\r\n flag=1\r\n else:\r\n a+=s[0]+\"|\"\r\n if s[1]==\"OO\" and flag==0:\r\n a+=\"++\"\r\n flag=1\r\n else:\r\n a+=s[1]\r\nif flag==1:\r\n print(\"YES\")\r\n for j in range(0,5*n,5):\r\n print(a[j:j+5])\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\nd=0\r\ne=''\r\nf=[]\r\nfor i in range(n):\r\n s=input()\r\n if(s[0]=='O' and s[1]=='O'):\r\n e+='++'+s[2:]\r\n d+=1\r\n elif(s[3]=='O' and s[4]=='O'):\r\n e+=s[:3]+'++'\r\n d+=1\r\n if(d==1):\r\n d+=1\r\n f.append(e)\r\n else:\r\n f.append(s)\r\nif(d==0):\r\n print('NO')\r\nelse:\r\n print('YES')\r\n for i in f:\r\n print(i)", "n = int(input())\r\n\r\nseats = []\r\nfill = False\r\nfor i in range(n):\r\n seats.append(input().split('|'))\r\n if not fill:\r\n if seats[-1][0] == \"OO\":\r\n seats[-1][0] = \"++\"\r\n print(\"YES\")\r\n fill = True\r\n elif seats[-1][1] == \"OO\":\r\n seats[-1][1] = \"++\"\r\n print(\"YES\")\r\n fill = True\r\n\r\nif fill:\r\n for i in range(n):\r\n print(\"|\".join(seats[i]))\r\nelse:\r\n print(\"NO\")", "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\nn=int(input())\r\na=[]\r\nfor i in range(n):\r\n a.append(list(input()))\r\nflag=False\r\nfor i in range(n):\r\n if a[i][0]==a[i][1]=='O':\r\n a[i][0]=a[i][1]='+'\r\n flag=True\r\n break\r\n if a[i][3]==a[i][4]=='O':\r\n a[i][3]=a[i][4]='+'\r\n flag=True\r\n break\r\nif flag:\r\n print('YES')\r\n for i in range(n):\r\n print(''.join(a[i]))\r\nelse:\r\n print('NO')", "n=int(input())\r\nc=[]\r\nf=False\r\nfor i in range(n):\r\n s=input()\r\n if 'OO|' in s and f==False:\r\n s=s.replace('OO|','++|')\r\n f=True\r\n else:\r\n if '|OO' in s and f==False:\r\n s=s.replace('|OO','|++')\r\n f=True\r\n c.append(s)\r\nif f:\r\n print('YES')\r\n for i in c:\r\n print(i)\r\nelse:\r\n print('NO')", "# https://codeforces.com/problemset/problem/711/A\r\n\r\nn = int(input())\r\nseats = []\r\navailable = False\r\n\r\nfor i in range(n):\r\n seat = input()\r\n seats.append(seat)\r\n\r\n\r\nfor x in range(len(seats)): \r\n \r\n sit = seats[x].split('|')\r\n \r\n if sit[0] == 'OO':\r\n seats[x] = '++|' + sit[1]\r\n available = True\r\n break\r\n \r\n elif sit[1] == 'OO':\r\n seats[x] = sit[0] + '|++'\r\n available = True\r\n break\r\n \r\nif available == True:\r\n print(\"YES\")\r\n for i in seats:\r\n print(i)\r\nelse:\r\n print(\"NO\")", "x = int(input())\r\nc = 0\r\nl = []\r\nfor i in range(x):\r\n a = input()\r\n if \"OO\" in a and c == 0:\r\n a = a.replace(\"OO\", \"++\", 1)\r\n c = 1\r\n l.append(a)\r\nif c == 1:\r\n print(\"YES\")\r\n print(*l, sep=\"\\n\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\n\r\navailable, rows = False, \"\"\r\n\r\nfor _ in range(n):\r\n row = input().split(\"|\")\r\n \r\n if 'OO' in row and not available:\r\n available = True\r\n idx = row.index(\"OO\")\r\n row[idx] = \"++\"\r\n \r\n rows += \"|\".join(row)\r\n rows += \"\\n\"\r\n \r\nif available:\r\n print('YES')\r\n print(rows)\r\nelse:\r\n print('NO')", "n = int(input())\narr = []\nfor a in range(n):\n arr.append(input().split(\"|\"))\nanswer = False\nfor j in range(len(arr)):\n if(arr[j][0] == \"OO\"):\n arr[j][0] = \"++\"\n answer = True\n break\n elif(arr[j][1] == \"OO\"):\n arr[j][1] = \"++\"\n answer = True\n break\nif(answer):\n print(\"YES\")\n fin = \"\"\n for j in arr:\n fin += j[0] + \"|\" + j[1] + \"\\n\"\n print(fin)\nelse:\n print(\"NO\")\n", "def print2dlist(l):\r\n for i in range(len(l)):\r\n for o in range(len(l[i])):\r\n if o == 0:\r\n print(l[i][o], end = \"|\")\r\n else:\r\n print(l[i][o])\r\n \r\nrows = int(input())\r\nseats = []\r\nspot = False\r\nfor i in range(rows):\r\n seats.append(input().split(\"|\"))\r\n for o in range(len(seats[i])):\r\n if seats[i][o] == \"OO\" and not spot:\r\n seats[i][o] = \"++\"\r\n spot= True\r\nif spot:\r\n print(\"YES\")\r\n print2dlist(seats)\r\nelse:\r\n print(\"NO\")", "from math import ceil\r\n\r\nt = int(input())\r\n\r\nvals = []\r\nfound = False\r\nfor _ in range(t):\r\n s = input()\r\n sep_s = s.split('|')\r\n vals.append(sep_s)\r\n if not found:\r\n for i in range(2):\r\n if sep_s[i] == 'OO':\r\n sep_s[i] = '++'\r\n found = True\r\n break\r\n \r\nif found:\r\n print(\"YES\")\r\n for i in range(t):\r\n print('|'.join(vals[i]))\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\nm=True\r\nk=[]\r\nfor i in range(n):\r\n s=input()\r\n if m and \"OO\" in s:\r\n m=False\r\n print('YES')\r\n if (s[0]==\"O\" and s[1]==\"O\"):\r\n k.append('++'+s[2:])\r\n else:\r\n k.append(s[:3]+\"++\")\r\n else:\r\n k.append(s)\r\nif m:\r\n print(\"NO\")\r\nelse:\r\n for i in range(n):\r\n print(k[i])\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n", "# https://codeforces.com/problemset/problem/711/A\r\n\r\nfl = False\r\nres = []\r\nfor _ in range(int(input())):\r\n line = input()\r\n if fl:\r\n res.append(line)\r\n else:\r\n if line[0:2] == 'OO':\r\n res.append(f\"++{line[2:]}\")\r\n fl = True\r\n elif line[3:] == 'OO':\r\n res.append(f\"{line[:3]}++\")\r\n fl = True\r\n else:\r\n res.append(line)\r\n\r\nif fl:\r\n print(\"YES\")\r\n for item in res:\r\n print(item)\r\nelse:\r\n print(\"NO\")\r\n\r\n", "import math\ndef yes():\n print(\"YES\")\ndef no():\n print(\"NO\")\ns = []\ntmp=1\nfor i in range(int(input())):\n ls=list(str(input()))\n if tmp and ls[0]=='O' and ls[1]=='O':\n ls[0]='+'\n ls[1]='+'\n tmp=0\n elif tmp and ls[3]=='O' and ls[4]=='O':\n ls[3]='+'\n ls[4]='+'\n tmp=0\n s.append(\"\".join(ls))\nif tmp:\n no()\nelse:\n yes()\n for i in s:\n print(i)", "n = int(input())\r\nbus = []\r\nfor i in range(n):\r\n row = input().strip()\r\n bus.append(row)\r\nfor i in range(n):\r\n if \"OO\" in bus[i]:\r\n j = bus[i].index(\"OO\")\r\n bus[i] = bus[i][:j] + \"++\" + bus[i][j+2:]\r\n print(\"YES\")\r\n for k in range(n):\r\n print(bus[k])\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "x=int(input())\r\nbus=[]\r\ncount=0\r\nfor i in range(x):\r\n y=input()\r\n bus.append(y.split('|'))\r\n\r\nfor i in range(len(bus)):\r\n if bus[i][0]=='OO' or bus [i][1]=='OO':\r\n count+=1\r\n if bus[i][0]=='OO': bus[i][0]='++'\r\n elif bus[i][1]=='OO': bus[i][1]='++'\r\n break\r\n\r\nif count>=1:\r\n print('YES')\r\n for i in range(len(bus)):\r\n print(bus[i][0] + '|' + bus[i][1])\r\n\r\nelse:\r\n print('NO')\r\n", "def solve(l):\n ada=False\n for i in range(len(l)):\n if l[i].count('OO') > 0:\n l[i] = l[i].replace('OO',\"++\",1)\n ada=True\n break\n return (l,ada)\n\nt=int(input())\nl = []\nfor i in range(t):\n l.append(input())\nres,ada=solve(l)\nif ada:\n print (\"YES\")\n print ('\\n'.join(res))\nelse:\n print (\"NO\")\n\n ", "found, l = False, []\r\nfor _ in range(int(input())):\r\n a = input()\r\n if not (found or a.find('OO') < 0):\r\n a=a.replace('OO', '++', 1)\r\n found = True\r\n l.append(a)\r\nprint(\"YES\\n\" +'\\n'.join(l) if found else 'NO')", "a = int(input())\r\nlist_ = []\r\n\r\nfor i in range(a):\r\n x = input().split(\"|\") \r\n list_.append(x)\r\n\r\nfound = False\r\n\r\nfor i in range(a):\r\n for j in range(2):\r\n if \"OO\" in list_[i][j]: \r\n list_[i][j] = list_[i][j].replace('OO', '++')\r\n found = True\r\n break\r\n if found:\r\n break\r\n\r\nif found:\r\n print(\"YES\")\r\n for i in range(a):\r\n print(\"|\".join(list_[i])) \r\nelse:\r\n print('NO')", "n=int(input())\r\nz=[]\r\nf=False\r\nfor i in range(n):\r\n t=input()\r\n t=t.split('|')\r\n z.append(t[0])\r\n z.append(t[1])\r\nfor i in range(2*n):\r\n # print(i)\r\n if z[i]=='OO':\r\n z[i]='++'\r\n f=True\r\n break\r\nif (f):\r\n print(\"YES\")\r\n for i in range(0,2*n,2):\r\n print(z[i]+'|'+z[i+1])\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n", "# n = int(input())\r\n# seat = 1\r\n# arr = []\r\n# full = []\r\n# for i in range(n):\r\n# arr = []\r\n# a,b = list(map(str, input().split(\"|\")))\r\n# if a == \"OO\":\r\n# a = \"++\"\r\n# seat+=1 \r\n# elif b == \"OO\":\r\n# b = \"++\"\r\n# seat += 1\r\n# arr.append(a)\r\n# arr.append(\"|\")\r\n# arr.append(b)\r\n# full += str(\"\".join(map(str, arr)))\r\n# print(i,full)\r\n# if seat > 0:\r\n# print(\"YES\")\r\n# # print(full)\r\n# else:\r\n# print(\"NO\")\r\n\r\n# n = int(input())\r\n# arr = []\r\n# for i in range(n):\r\n# val = []\r\n# a,b,c,d,e = list(map(str, input()))\r\n# if a == \"O\" and b ==\"O\":\r\n# a = \"+\"\r\n# b = \"+\"\r\n# elif c == \"O\" and d == \"O\":\r\n# c = \"+\"\r\n# d = \"+\"\r\n# for i in a,b,c,d,e:\r\n# val.append(i)\r\n# res = str(\"\".join(val))\r\n# arr.append(res)\r\n# for i in arr:\r\n# print(\"\\n\",i)\r\n\r\nn = int(input())\r\narr = []\r\nfor i in range(n):\r\n x = input()\r\n arr.append(x)\r\nfor i in range(len(arr)):\r\n p = list(map(str, arr[i]))\r\n for j in range(len(p)-1):\r\n if p[j+1] == 'O' and p[j] == 'O':\r\n p[j+1] = '+'\r\n p[j] = '+'\r\n arr[i] = str(\"\".join(p))\r\n print(\"YES\")\r\n for k in arr:\r\n print(k)\r\n quit()\r\n# quit()\r\n# print(\" \")\r\nprint(\"NO\")\r\n# for i in arr:\r\n# print(\"NO\")\r\n# print(i)\r\n# for i in range(len(arr)):\r\n# p = list(map(str, arr[i]))\r\n# if (p[0] == 'O' and p[1] == 'O') :\r\n# p[0] = '+'\r\n# p[1] = '+'\r\n# # print(str(\"\".join(p)))\r\n# print(\"\\n\",p)", "s=\"\"\r\nfor i in range(int(input())):\r\n s=s+input()\r\n s=s+\"\\n\"\r\nif(s.count('OO')):\r\n print(\"YES\")\r\n print(s.replace('OO','++',1))\r\nelse:\r\n print(\"NO\")", "r=int(input())\r\ns=str()\r\nfor i in range(r):\r\n p=str(input())\r\n s+=p+'\\n'\r\nif 'OO' in s:\r\n print('YES')\r\n print(s.replace('OO','++',1))\r\nelse:\r\n print('NO')", "n = int(input())\r\nll = []\r\ns = []\r\n\r\nfound = False\r\nfor i in range(n):\r\n ll.append(input())\r\n if not found and ll[i].count(\"OO\"):\r\n available = i\r\n found = True\r\n if ll[i][0] == 'O' and ll[i][1] == 'O':\r\n s.append(\"+\")\r\n s.append(\"+\")\r\n s.append(\"|\")\r\n s.append(ll[i][3])\r\n s.append(ll[i][4])\r\n\r\n else:\r\n s.append(ll[i][0])\r\n s.append(ll[i][1])\r\n s.append(\"|\")\r\n s.append(\"+\")\r\n s.append(\"+\")\r\n\r\n\r\nif found:\r\n print(\"YES\")\r\n for i in range(n):\r\n if i == available:\r\n print(\"\".join(s))\r\n else:\r\n print(ll[i])\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n", "n = int(input())\r\ni = 0\r\nk = []\r\nwhile i < n:\r\n s = list(input())\r\n k.append(s)\r\n i += 1\r\nv = 0\r\nh = k.copy()\r\ni = 0\r\nfor v in range(n):\r\n if i>=1:\r\n break\r\n elif k[v][0] == k[v][1] and k[v][0] == \"O\":\r\n k[v][0] = \"+\"\r\n k[v][1] = \"+\"\r\n i += 1\r\n elif k[v][3] == k[v][4] and k[v][3] == \"O\":\r\n k[v][3] = \"+\"\r\n k[v][4] = \"+\"\r\n i += 1\r\n\r\nfor j in range(1):\r\n if i == 0:\r\n print(\"NO\")\r\n break\r\n elif i == 1:\r\n print(\"YES\")\r\n for o in k:\r\n print(\"\".join(o))\r\n", "n = int(input())\r\nfound = False\r\nfinal = \"\"\r\nfor i in range(n):\r\n s = input()\r\n if not found:\r\n if 'OO' in s:\r\n final+=s.replace('OO','++',1)\r\n found = True\r\n else:\r\n final+=s\r\n else:\r\n final+=s\r\n \r\n if i!=n-1:\r\n final+=\"\\n\"\r\n\r\nif found:\r\n print(\"YES\\n\"+final)\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\narr = [str(input()) for _ in range(n)]\r\ncon = True\r\nfor i in range(n):\r\n if arr[i][:2] == 'OO':\r\n m = '++|'+arr[i][3:]\r\n arr[i] = m\r\n con = False\r\n break\r\n elif arr[i][3:] == 'OO':\r\n m = arr[i][:2]+'|++'\r\n arr[i] = m\r\n con = False\r\n break\r\nif con:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n for j in arr:\r\n print(j)", "n = int(input())\r\na = '\\n'.join(input() for _ in range(n))\r\nprint('YES\\n' + a.replace('OO', '++', 1) if a.find('OO') != -1 else 'NO')", "n = int(input())\n\nmy_list = []\n\nflg = 0\n\nwhile n:\n\n x = input()\n\n my_list.append(x)\n\n if 'OO' in x:\n\n flg = 1\n\n n-=1\n\nif not flg:\n\n print('NO')\n\nelse:\n\n print('YES')\n\n cnt = 0\n\n for i in my_list:\n\n if 'OO' in i and cnt == 0:\n\n x = i.index('OO')\n\n if x==0:\n print(f'++{i[x+2:]}')\n\n else:\n\n print(f'{i[:x]}++')\n\n cnt+=1\n\n else:\n\n print(i)\n\n\n\n\n\n\t\t \t \t \t\t \t \t\t\t \t \t\t \t \t", "n = int(input())\r\n\r\nanswers = []\r\ncount = 0\r\nadded = False\r\narr = [\r\n\r\n]\r\n\r\nfor i in range(n):\r\n seats = list(input())\r\n\r\n if ''.join(seats[0:2]) == 'OO':\r\n if added == True:\r\n arr.append(seats)\r\n \r\n else:\r\n seats[0:2] = [\"+\", \"+\"]\r\n arr.append(seats)\r\n added = True\r\n\r\n count +=1\r\n \r\n \r\n elif ''.join(seats[3:]) == 'OO':\r\n if added == True:\r\n arr.append(seats)\r\n \r\n else:\r\n seats[3:] = [\"+\", \"+\"]\r\n arr.append(seats)\r\n added = True\r\n\r\n count +=1\r\n \r\n else:\r\n arr.append(seats)\r\n\r\nif count == 0:\r\n print(\"NO\")\r\n\r\nelse:\r\n print(\"YES\")\r\n for i in arr:\r\n print(''.join(i))\r\n ", "def solve(l):\r\n x = 0\r\n replaced = \"\"\r\n index = \"-1\"\r\n for i in range(0, len(l)):\r\n z = list(l[i])\r\n for j in range(0, len(z) - 1):\r\n if z[j] == 'O' and z[j + 1] == 'O' and not replaced:\r\n z[j] = '+'\r\n z[j + 1] = '+'\r\n replaced = \"\".join(z)\r\n index = i\r\n break\r\n return replaced, index\r\n\r\n\r\ndef main():\r\n l = list()\r\n for i in range(int(input())):\r\n l.append(input())\r\n replaced, index = solve(l)\r\n if len(replaced) == 0 or index == -1:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n for i in range(0, len(l)):\r\n if i == index:\r\n print(replaced)\r\n else:\r\n print(l[i])\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\nl = ''\r\nfor i in range(n):\r\n\ts = input()\r\n\tl = l+s+'-'\r\nif l.find(\"OO\")!= -1:\r\n\tl = l.replace(\"OO\",\"++\",1)\r\n\tl = l.split('-')[:-1]\r\n\tprint(\"YES\")\r\n\tfor j in range(n):\r\n\t\tprint(l[j])\r\nelse:\r\n\tprint(\"NO\")\r\n", "n = int(input())\r\n\r\nseating = False\r\nfree_space_index = -1\r\nseats = []\r\nfor i in range(n):\r\n row = input()\r\n seats.append(row)\r\n\r\n if 'OO' in row and not seating:\r\n free_space_index = i\r\n seating = True\r\n\r\n\r\nif seating:\r\n print('YES')\r\n for i, row in enumerate(seats):\r\n if i == free_space_index:\r\n print(row.replace('OO', '++', 1))\r\n else:\r\n print(row)\r\nelse:\r\n print('NO')", "li = []\r\nfor _ in range(int(input())):\r\n s = input()\r\n li.append(s)\r\nans = 'NO'\r\nfor i in range(len(li)):\r\n if li[i][:2] == 'OO':\r\n ans = 'YES'\r\n li[i] = '++'+li[i][2:]\r\n break\r\n elif li[i][3:] == 'OO':\r\n ans = 'YES'\r\n li[i] = li[i][:3]+'++'\r\n break\r\nif ans == 'YES':\r\n print(ans)\r\n for i in li:\r\n print(i)\r\nelse:\r\n print(ans)", "z,zz=input,lambda:list(map(int,z().split()))\r\nfast=lambda:stdin.readline().strip()\r\nzzz=lambda:[int(i) for i in fast().split()]\r\nszz,graph,mod,szzz=lambda:sorted(zz()),{},10**9+7,lambda:sorted(zzz())\r\nfrom string import *\r\nfrom re import *\r\nfrom collections import *\r\nfrom queue import *\r\nfrom sys import *\r\nfrom collections import *\r\nfrom math import *\r\nfrom heapq import *\r\nfrom itertools import *\r\nfrom bisect import *\r\nfrom collections import Counter as cc\r\nfrom math import factorial as f\r\nfrom bisect import bisect as bs\r\nfrom bisect import bisect_left as bsl\r\nfrom itertools import accumulate as ac\r\ndef lcd(xnum1,xnum2):return (xnum1*xnum2//gcd(xnum1,xnum2))\r\ndef prime(x):\r\n p=ceil(x**.5)+1\r\n for i in range(2,p):\r\n if (x%i==0 and x!=2) or x==0:return 0\r\n return 1\r\ndef dfs(u,visit,graph):\r\n visit[u]=1\r\n for i in graph[u]:\r\n if not visit[i]:\r\n dfs(i,visit,graph)\r\ndef output(answer):\r\n stdout.write(str(answer))\r\n###########################---Test-Case---#################################\r\n\"\"\"\r\n\r\n If you Know me , Then you probably don't know me !\r\n\r\n\r\n\"\"\"\r\n###########################---START-CODING---##############################\r\n\r\nnum=int(z())\r\nc=0\r\nans=[]\r\nfor i in range(num):\r\n a,b=fast().split('|')\r\n if a.count('X')==0 and c==0:\r\n s='++'+'|'+b\r\n c=1\r\n elif b.count('X')==0 and c==0:\r\n s=a+'|'+'++'\r\n c=1\r\n else:s=a+'|'+b\r\n ans.append(s)\r\n \r\n \r\n \r\n\r\nprint('YES' if c else 'NO')\r\n \r\nif c:\r\n for i in ans:print(i)\r\n\r\n\r\n \r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n", "t=int(input())\r\nk=False\r\nkek=[]\r\nfor i in range(t):\r\n s=str(input())\r\n if k==False:\r\n for j in range(1,len(s)):\r\n if s[j]==\"O\" and s[j-1]==\"O\":\r\n k=True\r\n s=s[:(j-1)]+\"+\"+\"+\"+s[(j-1+2):]\r\n break\r\n kek.append(s)\r\nif k==False:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for t in kek:\r\n print(t)", "n = int(input())\r\nbus = []\r\ncount = 0\r\nfor i in range(0,n):\r\n x = input()\r\n bus.append(x)\r\nfor j in range(0, n):\r\n if 'OO|OX' == bus[j]:\r\n bus[j] = '++|OX'\r\n count += 1\r\n break\r\n elif 'OO|XO' == bus[j]:\r\n bus[j] = '++|XO'\r\n count += 1\r\n break\r\n elif 'OO|XX' == bus[j]:\r\n bus[j] = '++|XX'\r\n count += 1\r\n break\r\n elif 'OO|OO' == bus[j]:\r\n bus[j] = '++|OO'\r\n count += 1\r\n break\r\n elif 'XO|OO' == bus[j]:\r\n bus[j] = 'XO|++'\r\n count += 1\r\n break\r\n elif 'OX|OO' == bus[j]:\r\n bus[j] = 'OX|++'\r\n count += 1\r\n break\r\n elif 'XX|OO' == bus[j]:\r\n bus[j] = 'XX|++'\r\n count += 1\r\n break\r\n\r\nif count == 0:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n for i in bus:\r\n print(i)", "n=input()\r\nimport sys\r\na=sys.stdin.read()\r\nif \"OO\" in a:\r\n print(\"YES\")\r\n print(a.replace(\"OO\", \"++\",1))\r\nelse:\r\n print (\"NO\")", "import sys\n\ninput()\nseats = sys.stdin.read()\nx = seats.find('OO')\nprint('NO' if x < 0 else 'YES\\n' + seats[:x] + '++' + seats[x + 2:])\n\n\t \t\t\t\t \t \t\t\t \t \t \t\t\t\t\t", "n =int(input())\r\nk = list()\r\nok = False\r\nfor i in range(n):\r\n s=str(input())\r\n if(s[0]==s[1] and s[0] =='O' and ok == False):\r\n ok = True\r\n j = '++'\r\n j += s[2]\r\n j += s[3]\r\n j += s[4]\r\n k.append(j)\r\n elif(s[3]==s[4] and s[3] =='O' and ok == False):\r\n ok = True\r\n j =''.join(s[:3])\r\n j += '+'*2\r\n k.append(j)\r\n else: k.append(s)\r\nif(ok == True): \r\n print(\"YES\")\r\n print(*k, sep='\\n')\r\nelse: print(\"NO\")", "num = int(input())\r\nmain_lst = []\r\nflag = False\r\nfor i in range(num):\r\n x = input().split(\"|\")\r\n if \"OO\" in x and not flag:\r\n x[x.index(\"OO\")]=\"++\"\r\n flag = True\r\n main_lst.append(x)\r\nprint(\"YES\" if flag else \"NO\")\r\nif flag:\r\n for i in main_lst:\r\n print(\"|\".join(i))\r\n\r\n ", "n = int(input())\r\nind = (-1, -1)\r\na = [input() for _ in range(n)]\r\nfor i in range(n):\r\n if 'OO' == a[i].split('|')[0]:\r\n ind = (i, 0)\r\n elif 'OO' == a[i].split('|')[1]:\r\n ind = (i, 1)\r\nif ind == (-1, -1):\r\n print('NO')\r\nelse:\r\n print('YES')\r\n for i in range(n):\r\n if i != ind[0]:\r\n print(a[i])\r\n elif ind[1] == 1:\r\n print(a[i][:3], '++', sep='')\r\n else:\r\n print('++', a[i][2:], sep='')\r\n", "dict_string_to_num = {\r\n \"OO\" : 1,\r\n \"OX\" : 2,\r\n \"XO\" : 3,\r\n \"XX\" : 4\r\n}\r\n\r\ndict_num_to_string = {\r\n 0 : \"++\",\r\n 1 : \"OO\",\r\n 2 : \"OX\",\r\n 3 : \"XO\",\r\n 4 : \"XX\"\r\n}\r\n\r\ndef check_for_1(list):\r\n for item in list:\r\n if item == 1:\r\n return True\r\n return False\r\n\r\ndef convert(list):\r\n for i in range(len(list)):\r\n if list[i] == 1:\r\n list[i] = 0\r\n break\r\n\r\ndef print_bus(list):\r\n n = len(list) // 2\r\n for i in range(n):\r\n print(f\"{dict_num_to_string[converted_list[2 * i]]}|{dict_num_to_string[converted_list[2 * i + 1]]}\")\r\n \r\n\r\nconverted_list = []\r\nn = int(input())\r\nfor i in range(n):\r\n s = input()\r\n\r\n converted_list.append(dict_string_to_num[s[:2]])\r\n converted_list.append(dict_string_to_num[s[3:]])\r\n\r\nif check_for_1(converted_list):\r\n convert(converted_list)\r\n print(\"YES\")\r\n print_bus(converted_list)\r\nelse:\r\n print(\"NO\")\r\n ", "w = int(input())\r\nq = []\r\nfor roma in range(w):\r\n q.append(input().split('|'))\r\nq = str(q)\r\nq = q.replace('[', '')\r\nq = q.replace(']', '')\r\nq = q.replace(',', '')\r\nq = q.replace(\"'\", '')\r\nq = list(q.split())\r\nif 'OO' in q:\r\n q[q.index('OO')] = '++'\r\n print('YES')\r\n for i in range(0, len(q), 2):\r\n print(f'{q[i]}|{q[i+1]}')\r\nelse:\r\n print('NO')", "kolvomest = int(input())\r\nk = 0\r\nspisok = []\r\nfor stroka in range(kolvomest):\r\n\tryad = input()\r\n\tif 'OO' in ryad and k == 0:\r\n\t\tk = 1\r\n\t\tryad = ryad.replace('OO', '++', 1)\r\n\tspisok.append(ryad)\t\r\nif k == 1:\r\n\tprint('YES')\r\n\tfor stroka in range(kolvomest):\r\n\t\tprint(spisok[stroka])\r\nelse:\r\n\tprint('NO')\r\n\r\n", "n = int(input())\r\nfl = True\r\nlst = list()\r\nfor i in range(n):\r\n s = input()\r\n if (fl and s[0] == 'O' and s[1] == 'O'):\r\n tmp = \"++\" + s[2:]\r\n lst.append(tmp)\r\n fl = False\r\n elif (fl and s[3] == 'O' and s[4] == 'O'):\r\n tmp = s[:3] + \"++\"\r\n lst.append(tmp)\r\n fl = False\r\n else:\r\n lst.append(s)\r\nif (fl):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in lst:\r\n print(i)\r\n", "t = int(input())\r\nbus = []\r\nseat_found = False\r\n\r\nfor i in range(t):\r\n row = input()\r\n\r\n if not seat_found:\r\n row = list(row.partition('|'))\r\n for idx, value in enumerate(row):\r\n if value == \"OO\":\r\n row[idx] = \"++\"\r\n seat_found = True\r\n break\r\n\r\n row = \"\".join(row)\r\n bus.append(row)\r\n\r\nif seat_found:\r\n print(\"YES\")\r\n for row in bus:\r\n print(row)\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nseats = []\r\nans = \"NO\"\r\nfor i in range(n):\r\n s = input()\r\n seats.append(s)\r\nfor i in range(n):\r\n char = \"\"\r\n if seats[i][0]==seats[i][1] and seats[i][0] == 'O':\r\n ans = \"YES\"\r\n char = char + \"++\" + seats[i][2:5]\r\n seats.pop(i)\r\n seats.insert(i,char)\r\n break\r\n elif seats[i][3]==seats[i][4] and seats[i][3] == 'O':\r\n ans = \"YES\"\r\n char = char + seats[i][0:3] + \"++\"\r\n seats.pop(i)\r\n seats.insert(i,char)\r\n break\r\nprint(ans)\r\nif ans==\"YES\":\r\n for i in seats:\r\n print(i)\r\n", "# import sys\r\n# sys.stdin = open('input.txt','r')\r\n# sys.stdout = open('output.txt','w')\r\n\r\narr = []\r\nflag = False\r\nfor _ in range(int(input())):\r\n arr.append(input())\r\nc=0\r\nfor i in arr:\r\n if i[:2]==\"OO\":\r\n arr[c]=\"++\"+i[2:]\r\n flag = True\r\n break\r\n elif i[-2:]==\"OO\":\r\n arr[c]=i[:-2]+\"++\"\r\n flag = True\r\n break\r\n c+=1\r\nif (flag):\r\n print(\"YES\")\r\n for j in arr:\r\n print(j)\r\nelse:\r\n print('NO')", "ll = []\r\nn = int(input())\r\nfor i in range(n):\r\n\ts = input() # xx|ox\r\n\tif i != n - 1:\r\n\t\ts = s + \"|\"\r\n\tll.append(s)\r\nll = \"\".join(ll)\r\nll = ll.split(\"|\")\r\nstatus = False\r\nif \"OO\" in ll:\r\n\tstatus = True\r\n\tindexx = ll.index(\"OO\")\r\n\tll.pop(indexx)\r\n\tll.insert(indexx, \"++\")\r\nif status == True:\r\n\tprint(\"YES\")\r\n\tone1 = 0\r\n\tfor i in ll:\r\n\t\tif one1 == 1:\r\n\t\t\tprint(i)\r\n\t\t\tone1 = 0\r\n\r\n\t\telse:\r\n\t\t\tprint(i,\"|\", end=\"\", sep=\"\")\r\n\t\t\tone1 += 1\r\nelse:\r\n\tprint(\"NO\")", "n = int(input())\n\nlines = [input().split('|') for _ in range(n)]\n\nflag = False\nfor line in lines:\n if flag == True:\n break\n for seats in range(2):\n if line[seats] == 'OO':\n line[seats] = '++'\n flag = True\n break\nif flag == True:\n print('YES')\n [print('|'.join(line)) for line in lines]\nelse:\n print('NO')\n", "def print_bus(bus):\r\n for row in bus:\r\n print(''.join(row))\r\n\r\n\r\ndef solve():\r\n n = int(input())\r\n bus = [list(input()) for _ in range(n)]\r\n possible = False\r\n\r\n for i in range(n):\r\n for j in range(2):\r\n if bus[i][j*3] == 'O' and bus[i][j*3+1] == 'O':\r\n bus[i][j*3] = '+'\r\n bus[i][j*3+1] = '+'\r\n possible = True\r\n break\r\n if possible:\r\n break\r\n\r\n if not possible:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n print_bus(bus)\r\n\r\n\r\nsolve()\r\n", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n s=input().split('|')\r\n l.extend(s)\r\nfor i in range(0,n*2):\r\n if l[i][0]==l[i][1]=='O':\r\n l[i]='++'\r\n print('YES')\r\n for i in range(0,n*2,2):\r\n print(l[i],end='|')\r\n print(l[i+1])\r\n break\r\nelse:\r\n print('NO')", "a = int(input())\r\nflag = 0\r\nt = [input() for _ in range(a)]\r\nfor i in range(a):\r\n q, w = t[i].split(\"|\")\r\n if q == \"OO\":\r\n t[i] = \"++|\" + w\r\n flag = 1\r\n break\r\n if w == \"OO\":\r\n t[i] = q + \"|++\"\r\n flag = 1\r\n break\r\nif not flag:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(\"\\n\".join(t))", "n = int(input())\r\nfound = False; lst = []\r\nfor i in range(n):\r\n s = input()\r\n if found: lst += [s]\r\n elif s[0] == 'O' and s[1] == 'O':\r\n found = True; lst += [''.join(['+','+', s[2], s[3], s[4]])]\r\n elif s[3] == 'O' and s[4] == 'O':\r\n found = True; lst += [''.join([s[0],s[1],s[2],'+','+'])]\r\n else:\r\n lst += [s]\r\nif found: print('YES' + '\\n' + '\\n'.join(lst))\r\nelse: print('NO')", "n=int(input())\r\ns=[]\r\ns2=0\r\nfor i in range(n):\r\n f=input()\r\n if (f[0]=='O' and f[1]=='O' or f[3]=='O' and f[4]=='O') and s2==0:\r\n s2=1\r\n f=f.replace('OO','++', 1)\r\n s.append(f)\r\nif s2==0:\r\n print('No')\r\nelse:\r\n print('YES',*s, sep='\\n')", "class solution:\r\n def __init__(self,s):\r\n self.s = s\r\n self.answer = ''\r\n def calculation(self):\r\n if self.s[0] == self.s[1] and self.s[0] !='X':\r\n self.answer = '++'+self.s[2:]\r\n elif self.s[3] == self.s[4] and self.s[3] !='X':\r\n self.answer = self.s[:3]+'++'\r\n else:\r\n self.answer = s\r\nt = int(input())\r\nThereIsNo = False\r\nl=[]\r\nfor _ in range(t):\r\n s = input()\r\n if not ThereIsNo:\r\n root = solution(s)\r\n root.calculation()\r\n if root.answer !=s:\r\n ThereIsNo = True\r\n l.append(root.answer)\r\n else:\r\n l.append(s)\r\n \r\nif ThereIsNo:\r\n print('YES')\r\n for i in l:\r\n print(i)\r\nelse:\r\n print('NO')\r\n", "#!/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\tB = '\\n'.join(wtf[1:])\r\n\tA = B.replace('OO', '++', 1)\r\n\tprint('NO' if A == B else 'YES\\n' + A)", "a = int(input())\r\nflag = 0\r\narr = []\r\nfor i in range(a):\r\n b = str(input())\r\n\r\n if \"OO\" in b and flag != 1:\r\n flag = 1\r\n arr.append(b.replace(\"OO\",\"++\",1))\r\n \r\n else:\r\n arr.append(b)\r\n\r\n\r\nif flag:\r\n print(\"YES\")\r\n for j in arr:\r\n print(j)\r\nelse:\r\n print(\"NO\")\r\n\r\n", "s = input()\r\nt = []\r\nfor i in range(int(s)):\r\n t += [list(input())]\r\nb = False\r\nfor i in range(len(t)):\r\n for j in range(1, len(t[i])):\r\n if t[i][j] == t[i][j-1] and t[i][j] == \"O\":\r\n t[i][j] = \"+\"\r\n t[i][j-1] = \"+\"\r\n b = True\r\n break\r\n if b:\r\n break\r\nl = \"\"\r\nfor i in t:\r\n l += \"\".join(map(str, i)) + \"\\n\"\r\nif b:\r\n print(\"YES\")\r\n print(l)\r\nelse:\r\n print(\"NO\")", "n = int(input())\nA= []\nx = 0\nfor i in range(n):\n a = str(input())\n A.append(a)\n\nfor i in range(n): \n if 'OO' in A[i]:\n x+=1\n A[i] = A[i].replace('OO','++',1)\n break\nif x == 0: \n print('NO')\nelse:\n print('YES')\n## print(' '.join(A))\n for i in range(n):\n print(A[i])\n \n \n \n \n\n\n \n\n", "t = int(input())\n\na = []\nflag = 0\n\nfor i in range(t):\n\tline = str(input())\n\t# line = line.replace('OO', '++')\n\t# print(line)\n\tif((line[:2] == 'OO' or line[3:] == 'OO') and flag == 0):\n\t\tline = line.replace('OO', '++', 1)\n\t\tflag = 1\n\n\ta.append(line)\n\nif flag == 1:\n\tprint(\"YES\")\n\tfor line in a:\n\t\tprint(line)\n\nelse:\n\tprint(\"NO\")\n\n\n\n\t\n\n\n", "n = int(input())\r\nseats = []\r\nans = 'NO'\r\nfor i in range(n):\r\n\tel = input().split('|')\r\n\tif 'OO' in el and ans == 'NO':\r\n\t\tans = 'YES'\r\n\t\tel[el.index('OO')] = '++'\r\n\tseats.append(el)\r\nprint(ans)\r\nif ans =='YES':\r\n\tfor i in range(n):\r\n\t\tprint(f'{seats[i][0]}|{seats[i][1]}')", "l = []\r\nn = int(input())\r\nfor TC in range(n):\r\n l.append(input())\r\n\r\nf=0\r\nfor i in range(n):\r\n if l[i].count('OO')!=0:\r\n l[i] = l[i].replace('OO','++',1)\r\n f=1\r\n break\r\n \r\nif f:\r\n print('YES')\r\n for i in l:\r\n print(i)\r\nelse:\r\n print('NO')", "n = int(input())\r\na1 = []\r\nt = False\r\nfor i in range(n):\r\n a = input()\r\n b = []\r\n if (a[0:2] == \"OO\" or a[3:5] == \"OO\") and t == False:\r\n t = True\r\n if a[0:2] == 'OO':\r\n b.append(\"++\")\r\n b.append(a[2:5])\r\n else:\r\n b.append(a[0:3])\r\n b.append('++')\r\n else:\r\n b.append(a[0:5])\r\n a1.append(''.join(b))\r\nif t:\r\n print(\"YES\")\r\n for i in a1:\r\n print(i)\r\nelse:\r\n print('NO')", "n=int(input())\r\na=list(range(n))\r\nflag=False\r\nfor i in range(n):\r\n a[i]=input()\r\n if not flag:\r\n if a[i][:2]=='OO':\r\n a[i]='++'+a[i][2:]\r\n flag=True\r\n elif a[i][3:]=='OO':\r\n a[i]=a[i][:3]+'++'\r\n flag=True\r\nif flag:\r\n print('YES')\r\n for i in range(n):\r\n print(a[i])\r\nelse:\r\n print('NO')\r\n \r\n \r\n \r\n", "a=int(input())\r\nl=[]\r\nfor i in range(a):\r\n inpu=input()\r\n l.append(inpu)\r\nf=\"t\"\r\nfor i in range (len(l)):\r\n \r\n a=l[i][0:2]\r\n b=l[i][3:]\r\n if a=='OO':\r\n l[i]=\"++|\"+b\r\n print(\"YES\")\r\n f='f'\r\n break\r\n else:\r\n if b==\"OO\":\r\n l[i]=a+\"|++\"\r\n print(\"YES\")\r\n f='f'\r\n break\r\nelse:\r\n print(\"No\")\r\nif f==\"f\": \r\n for i in l:\r\n print(i) \r\n \r\n\r\n", "'''\r\n\r\n|| ||\r\n|| ||\r\n|| ||\r\n|| ||\r\n\r\n'''\r\nsit = False\r\nn = int(input())\r\na = []\r\nfor i in range(n):\r\n r=list(input().split('|'))\r\n a.append(r)\r\n\r\nfor i in range(len(a)):\r\n for j in range(len(a[i])):\r\n if a[i][j] == \"OO\":\r\n sit = True\r\n a[i][j]=\"++\"\r\n break\r\n if sit:\r\n break\r\n\r\nif sit:\r\n print(\"YES\")\r\n for i in a:\r\n print(\"|\".join(i))\r\nelse:\r\n print(\"NO\")\r\n\r\n", "nk = int(input())\r\nbb = []\r\n\r\nfor _ in range(nk):\r\n r = input()\r\n bb.append(r)\r\n\r\nfound = False\r\n\r\nfor i in range(nk):\r\n if not found and \"OO\" in bb[i]:\r\n bb[i] = bb[i].replace(\"OO\", \"++\", 1)\r\n found = True\r\n\r\nif found:\r\n print(\"YES\")\r\n for r in bb:\r\n print(r)\r\nelse:\r\n print(\"NO\")\r\n", "# your code goes here\r\nn=int(input())\r\nl=[]\r\nfor i in range(n):\r\n\ts=input()\r\n\ta=s[:2]\r\n\tb=s[3:]\r\n\tl.append(a)\r\n\tl.append(b)\r\nans=0\r\nfor i in range(len(l)):\r\n\tif l[i]=='OO':\r\n\t\tl[i]='++'\r\n\t\tans=1\r\n\t\tbreak\r\nif ans==1:\r\n\ti=0\r\n\tprint('YES')\r\n\twhile i<len(l)-1:\r\n\t\ts=''\r\n\t\ts=l[i]+'|'+l[i+1]\r\n\t\tprint(s)\r\n\t\ti+=2\r\nelse:\r\n\tprint('NO')\r\n", "\r\nn=int(input())\r\nf=False\r\nl=[]\r\nfor i in range(n):\r\n x,y=input().split('|')\r\n if x =='OO' and f==False:x='++';f=True\r\n if y=='OO'and f==False:y='++';f=True\r\n l.append(x+'|'+y)\r\n\r\nif f:print('Yes');print(*l,sep='\\n')\r\nelse:print('NO')", "n = int(input())\r\narr = []\r\nis_place_found = False\r\nfor i in range(0, n):\r\n row = input()\r\n left_pair, right_pair = row.split(\"|\")\r\n if left_pair == \"OO\" and not is_place_found:\r\n left_pair = \"++\"\r\n is_place_found = True\r\n print('YES')\r\n elif right_pair == \"OO\" and not is_place_found:\r\n right_pair = \"++\"\r\n is_place_found = True\r\n print('YES')\r\n arr.append(left_pair + \"|\" + right_pair)\r\nif not is_place_found:\r\n print(\"NO\")\r\nelse:\r\n for i in arr:\r\n print(i)\r\n", "main_lst= []\r\nsm=0\r\nn= int(input())\r\nfor i in range(n):\r\n lst= list(input())\r\n if lst[0]+lst[1]=='OO' and sm==0:\r\n lst[0], lst[1]= '+', '+'\r\n sm+=1\r\n main_lst.append(lst)\r\n elif lst[3]+lst[4]=='OO' and sm==0:\r\n lst[3], lst[4]= '+', '+'\r\n sm+=1\r\n main_lst.append(lst)\r\n else:\r\n main_lst.append(lst)\r\n\r\nif sm>=1:\r\n print('YES')\r\n for a in main_lst:\r\n print(''.join(map(str, a)))\r\nelse:\r\n print('NO')", "n, f, s = int(input()), False, ''\nfor i in range(n):\n a = input()\n if not f and 'OO' in a:\n s += a.replace('OO', '++', 1) + '\\n'\n f = True\n else:\n s += a + '\\n'\nif f:\n print('YES')\n print(s)\nelse:\n print('NO')", "n = int(input())\nbus = []\nseated = False\nfor i in range(n) :\n l,r = input().split('|')\n if seated :\n bus.append((l,r))\n continue\n if l == 'OO' :\n l ='++'\n seated = True\n elif r == 'OO' :\n r = '++'\n seated = True\n bus.append((l,r))\n# print(seated)\nif seated :\n print('YES')\n [print(l,'|',r,sep='') for l,r in bus]\nelse :\n print('NO')\n ", "n = int(input())\n\nbus = []\nfor rows in range(n):\n r = input()\n bus.append(r.split(\"|\"))\n\nflag = 0\nfor row in range(len(bus)):\n for seat in range(2):\n if bus[row][seat] == 'OO':\n bus[row][seat] = '++'\n flag = 1\n break\n if flag == 1:\n break\nif flag == 0:\n print(\"NO\")\nelse:\n print(\"YES\")\n for i in bus:\n print(\"|\".join(i))\n", "row = \"\"\r\nfor i in range(int(input())):\r\n s = input()\r\n row+= s + \"\\n\"\r\nallr = row.replace(\"OO\",\"++\",1)\r\nif(allr == row):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(allr)", "n = int(input())\r\nlst1=[]\r\nlst2=[]\r\nk=0\r\nfor i in range(n):\r\n p = input().split('|')\r\n s1 = p[0]\r\n s2 = p[1]\r\n if s1=='OO':\r\n k=1\r\n lst1.append('++')\r\n lst2.append(s2)\r\n break\r\n elif s2=='OO':\r\n k=1\r\n lst1.append(s1)\r\n lst2.append('++')\r\n break\r\n else:\r\n lst1.append(s1)\r\n lst2.append(s2)\r\nif k==1:\r\n print('YES')\r\n i += 1\r\n for j in range(n-i):\r\n p = input().split('|')\r\n lst1.append(p[0])\r\n lst2.append(p[1])\r\n\r\n for i in range(len(lst1)):\r\n print(lst1[i]+'|'+lst2[i])\r\n\r\nelse:\r\n print('NO')\r\n", "out = []\r\nflag = True\r\nfor _ in range(int(input())):\r\n s = input()\r\n if s.count('OO') and flag:\r\n s = s.replace('OO', '++', 1)\r\n flag = False\r\n out.append(s)\r\nif not flag:\r\n print('YES')\r\n print(*out, sep='\\n')\r\nelse:\r\n print('NO')", "m = []\r\nkol = 0\r\nfor i in range(int(input())):\r\n s = input()\r\n m.append(s)\r\n kol += s.count('OO')\r\nif kol == 0:\r\n print('NO')\r\n exit()\r\nelse:\r\n print('YES')\r\n t = 0\r\n for i in range(len(m)):\r\n if m[i].count('OO') != 0 and t != 1:\r\n print(m[i].replace('OO', '++', 1))\r\n t = 1\r\n else:\r\n print(m[i])\r\n \r\n", "n=int(input())\r\nc=0\r\nL=[]\r\nfor i in range(n):\r\n s=input()\r\n L.append(s)\r\n if c==0 and 'OO' in s:\r\n c=c+1\r\n L[i]=s.replace('OO', '++', 1)\r\nif c==0:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n for i in L:\r\n print(i)", "# LUOGU_RID: 101646101\ns = ' '.join([input() for _ in range(int(input()))])\r\nif s.find('OO') != -1:\r\n p = s.find('OO')\r\n s = s[:p] + '++' + s[p+2:]\r\n print('YES')\r\n print('\\n'.join(s.split()))\r\nelse:\r\n print('NO')", "n=int(input())\r\nsetup=\"\"\r\nseat=False\r\nfor i in range(n):\r\n x=input()\r\n if seat==False and \"OO\" in x:\r\n if x[:2]==\"OO\": x=\"++\"+x[2:]\r\n elif x[3:]==\"OO\": x=x[:3]+\"++\"\r\n seat=True\r\n setup=setup+x+\" \"\r\nif seat==True:\r\n print(\"YES\")\r\n for j in range(n):\r\n print(setup.split()[j])\r\nelse:\r\n print(\"NO\")\r\n\r\n \r\n", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n x=input()\r\n l.append(x)\r\nf=0\r\nfor i in range(len(l)):\r\n y=l[i].split('|')\r\n if(y[0].count('O')==2):\r\n f=1\r\n l[i]=l[i].replace(\"OO\",\"++\",1)\r\n break\r\n if(y[1].count('O')==2):\r\n f=1\r\n l[i]=l[i].replace(\"OO\",\"++\",1)\r\n break\r\n else:\r\n f=0\r\n# print(l) \r\nif(f==0):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in l:\r\n print(i)", "k=int(input())\r\njuz=False\r\nb=[]\r\nfor _ in range(k):\r\n a=list(input())\r\n if not juz:\r\n if a[0]==\"O\" and a[1]==\"O\":\r\n a[0]=a[1]=\"+\"\r\n juz=True\r\n elif a[3]==\"O\" and a[4]==\"O\":\r\n a[3]=a[4]=\"+\"\r\n juz=True\r\n b.append(a[0])\r\n b.append(a[1])\r\n b.append(a[2])\r\n b.append(a[3])\r\n b.append(a[4])\r\nif juz:\r\n print(\"YES\")\r\n p=0\r\n for i in range(len(b)):\r\n print(b[i], end=\"\")\r\n p+=1\r\n if p==5:\r\n print(\"\")\r\n p=0\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\nm=[[]for i in range(n)]\r\nk=0\r\nfor i in range(n):\r\n A=list(input())\r\n if (A[0]=='O' and A[1]=='O')and k==0:\r\n A[0]='+'\r\n A[1]='+'\r\n k=1\r\n elif(A[3]=='O'and A[4]=='O')and k==0:\r\n A[3]='+'\r\n A[4]='+'\r\n k=1\r\n m[i]=A\r\n\r\nif k==1:\r\n print('YES')\r\n for i in range(n):\r\n for a in m[i]:\r\n print(a,end='')\r\n print()\r\nelse:\r\n print('NO')\r\n", "n=int(input())\r\nf=0\r\nb=''\r\nfor i in range(n):\r\n a=input().split('|')\r\n if not f and'OO' in a:\r\n f=1\r\n a[a.index('OO')]='++'\r\n b+=a[0]+'|'+a[1]+'\\n'\r\nif f:\r\n print(\"YES\")\r\n print(b)\r\nelse:\r\n print(\"NO\")\r\n", "if __name__==\"__main__\":\r\n n=int(input())\r\n flag=0\r\n li=[]\r\n for i in range(n):\r\n s=input()\r\n if s[0]=='O'and s[1]=='O'and flag==0:\r\n t=\"++\"+s[2:]\r\n li.append(t)\r\n flag=1\r\n elif s[3]=='O'and s[4]=='O'and flag==0:\r\n t=s[0:3]+'++'\r\n li.append(t)\r\n flag=1\r\n else:\r\n li.append(s)\r\n if flag==1:\r\n print(\"YES\")\r\n for i in li:\r\n print(i)\r\n else:\r\n print(\"NO\")\r\n", "flag = 1\r\narr = []\r\nfor i in range(int(input())) :\r\n arr.append(input().strip())\r\n\r\nfor i in range(len(arr)):\r\n if arr[i] == \"OO|OO\" :\r\n flag = 0\r\n arr[i] = \"++|OO\"\r\n break\r\n elif \"OO\" in arr[i]:\r\n flag = 0\r\n arr[i] = arr[i].replace(\"OO\", \"++\")\r\n break\r\nif flag == 0 :\r\n print(\"YES\")\r\n for i in arr:\r\n print(i)\r\nelse :\r\n print(\"NO\")", "n=int(input())\r\nans=False\r\nseats=[]\r\nseats2=[]\r\nfor i in range(n):\r\n\tseats.append(input())\r\n\tif seats[-1][:2]==\"OO\" and ans==False:\r\n\t\tseats2.append(\"++\"+seats[-1][2:])\r\n\t\tans=True\r\n\telif seats[-1][3:]==\"OO\" and ans==False:\r\n\t\tseats2.append(seats[-1][:3]+\"++\")\r\n\t\tans=True\r\n\telse:\r\n\t\tseats2.append(seats[-1])\r\nif ans==True:\r\n\tprint(\"YES\")\r\n\tfor i in seats2:\r\n\t\tprint(i)\r\nelse:\r\n\tprint(\"NO\")", "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\nn = readint()\r\n\r\n\r\ngrid = []\r\n\r\nseated = False\r\n\r\nfor _ in range(n):\r\n\r\n row = input().split(\"|\")\r\n\r\n if not seated and row[0] == 'OO':\r\n row[0] = '++'\r\n seated = True\r\n elif not seated and row[1] == 'OO':\r\n row[1] = '++'\r\n seated = True\r\n \r\n grid.append(\"|\".join(row))\r\n\r\nif seated:\r\n print(\"YES\")\r\n for row in grid:\r\n print(row)\r\nelse:\r\n print(\"NO\")\r\n\r\n", "n=int(input(''))\r\nl=[]\r\nk=[]\r\nm=[]\r\nfor _ in range(n):\r\n l.append(input(''))\r\nfor j in l:\r\n i=list(j)\r\n if i[0]=='O' and i[1]=='O':\r\n m.append(l.index(j))\r\n i[0]='+'\r\n i[1]='+'\r\n k.append(''.join(i))\r\n elif i[3]=='O' and i[4]=='O':\r\n m.append(l.index(j))\r\n i[3]='+'\r\n i[4]='+'\r\n k.append(''.join(i))\r\n#print(l)\r\nif len(m)>0:\r\n l[m[0]]=k[0]\r\nif len(m)>0:\r\n print('YES')\r\n print('\\n'.join(l))\r\nelse:\r\n print('NO')", "l=[]\r\nfor i in range(int(input())):\r\n\ta=input()\r\n\tl.append(a)\r\nc=0\r\nfor i in range(len(l)):\r\n\tif l[i][0:2]=='OO' :\r\n\t\tc=1\r\n\t\tl[i]='++'+l[i][2:]\r\n\t\tbreak\r\n\telif l[i][3:]=='OO':\r\n\t\tc=1\r\n\t\tl[i]=l[i][0:3]+'++'\r\n\t\tbreak\r\nif c!=0:\r\n\tprint(\"YES\")\r\n\tfor i in l:\r\n\t\tprint(i)\r\nelse:\r\n\tprint(\"NO\")", "def bus_to_udayland():\r\n c=[]\r\n ans=0\r\n for _ in range(int(input())):\r\n a=input()\r\n if ans==0:\r\n if 'OO' in a:\r\n a=a.replace('OO','++',1)\r\n ans=1\r\n c.append(a)\r\n if ans==1:\r\n print('YES')\r\n for i in range(len(c)):\r\n print(c[i])\r\n else:\r\n print('NO')\r\nbus_to_udayland()\r\n", "n = int(input())\r\nl = list()\r\nfound_ans = False\r\n\r\nfor _ in range(n):\r\n r = input()\r\n \r\n if not found_ans:\r\n if r[0] == r[1] == 'O':\r\n r = \"++\" + r[2:]\r\n found_ans = True\r\n \r\n elif r[3] == r[4] == 'O': \r\n r = r[:3] + \"++\"\r\n found_ans = True\r\n \r\n l.append(r)\r\n\r\nprint(\"NO\" if not found_ans else (\"YES\\n\" + \"\\n\".join(l)))", "f=0\r\na=[]\r\nfor i in range(int(input())):\r\n s=input()\r\n s1=s[0:2]\r\n s2=s[3:5]\r\n s=''\r\n if(f==0):\r\n if(s1=='OO'):\r\n f=1\r\n s+=\"++\"\r\n else:\r\n s+=s1\r\n else:\r\n s+=s1\r\n s+='|'\r\n if(f==1):\r\n s+=s2\r\n else:\r\n if(s2=='OO'):\r\n f=1\r\n s+=\"++\"\r\n else:\r\n s+=s2\r\n a.append(s)\r\nif(f==1): \r\n print(\"YES\")\r\n for i in a:\r\n print(i)\r\nelse:\r\n print(\"NO\")\r\n", "n = int (input ())\r\ns = ''\r\ncount = 0\r\ndef show (s, s_inp):\r\n tmp = s .split (' ')\r\n try:\r\n for i in tmp:\r\n print (i)\r\n except:\r\n pass\r\n print (s_inp)\r\n try:\r\n for j in range (n-count):\r\n print (input ().strip ())\r\n except:\r\n pass\r\n\r\nfor i in range (n):\r\n s_inp = input ().strip ()\r\n count+=1\r\n goal = 'OO'\r\n sub = '++'\r\n if goal in s_inp:\r\n print ('YES')\r\n s_inp = s_inp.replace ('OO', '++', 1)\r\n show (s, s_inp)\r\n break\r\n s += (' ' + s_inp)\r\n if i == n - 1:\r\n print ('NO')\r\n\r\n", "seats = []\r\nfor _ in range(int(input())):\r\n seat = input().split('|')\r\n seats.extend(seat)\r\n\r\ni = 0\r\nflag = 0\r\nwhile i < len(seats) - 1:\r\n if seats[i] == 'OO':\r\n seats[i] = '++'\r\n flag = 1\r\n break\r\n elif seats[i + 1] == 'OO':\r\n seats[i + 1] = '++'\r\n flag = 1\r\n break\r\n i += 2\r\n\r\nif flag == 1:\r\n print(\"YES\")\r\n for i in range(0,len(seats)-1, 2):\r\n print('{}|{}'.format(seats[i], seats[i + 1]))\r\nelse:\r\n print(\"NO\")\r\n", "a=[]\r\nf=0\r\nfor i in range(int(input())):\r\n b=input()\r\n if 'OO' in b and f==0:\r\n f=1\r\n if 0==b.index('OO'):\r\n a.append('++'+b[2:])\r\n else:\r\n a.append(b[:3]+'++')\r\n else:\r\n a.append(b)\r\nif f:\r\n print('YES')\r\n print('\\n'.join(a))\r\nelse:\r\n print(\"NO\")", "x=int(input())\r\nfl=True\r\nans=''\r\nfor i in range(0,x):\r\n s=list(input())\r\n if s[0]== 'O' and s[1]=='O' and fl:\r\n fl=False\r\n s[0]=s[1]='+'\r\n if s[3]== 'O' and s[4]=='O' and fl:\r\n fl=False\r\n s[3]=s[4]='+'\r\n for i in s:\r\n ans+=i\r\n ans+='\\n'\r\nif fl:\r\n print('NO')\r\nelse:\r\n print(\"YES\")\r\n print(ans)\r\n \r\n \r\n", "columns = int(input())\n\nOs = False\n\nrows = []\n\nfor i in range(columns):\n row = input()\n if row.find('OO') > -1 and Os == False:\n Os = True\n row = row.replace('OO', '++', 1)\n rows.append(row)\n\nif Os:\n print('YES')\n print(*rows, sep = '\\n')\nelse:\n print('NO')", "inp = int(input())\r\n\r\ndef checker(a):\r\n lsnew = []\r\n if 'OO' in a:\r\n s = ''\r\n pos = a.index('OO')\r\n ls = list(a)\r\n ls[pos] = '+'\r\n ls[pos+1] = '+'\r\n b = s.join(ls)\r\n return b\r\n else:\r\n return a\r\n\r\nflag = 0\r\nls = []\r\nfor t in range(0, inp):\r\n word = str(input())\r\n if(flag == 0):\r\n strb= checker(word)\r\n if('++' in strb):\r\n flag = 1\r\n ls.append(strb)\r\n else:\r\n ls.append(word)\r\nif(flag != 0):\r\n print('YES')\r\n for items in ls:\r\n print(items)\r\nelse:\r\n print('NO')\r\n\r\n\r\n\r\n\r\n \r\n", "n=int(input())\r\ncheck=0\r\nlst=[]\r\nres=-1\r\nfor i in range(n):\r\n s=input()\r\n lst.append(s)\r\nfor i in range(len(lst)):\r\n if lst[i][0]==lst[i][1] and lst[i][0]=='O':\r\n check=1 \r\n res,pos=i,0 \r\n break\r\n if lst[i][3]==lst[i][4] and lst[i][3]=='O':\r\n check=1 \r\n res,pos=i,3\r\n break\r\nif check==0:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n for i in range(len(lst)):\r\n if i!=res:\r\n print(lst[i])\r\n else:\r\n if pos==0:\r\n print('++',end='')\r\n print(lst[i][2:])\r\n else:\r\n print(lst[i][:3],end='')\r\n print('++')", "n = int(input())\r\nL = []\r\nfor i in range(n):\r\n s=input()\r\n L.append([x for x in s])\r\nc=0\r\nfor i in range(len(L)):\r\n if L[i][0]==\"O\" and L[i][1]==\"O\":\r\n L[i][0],L[i][1]='+','+'\r\n c=c+1\r\n break\r\n elif L[i][3]==\"O\" and L[i][4]==\"O\":\r\n L[i][3],L[i][4]='+','+'\r\n c=c+1\r\n break\r\nif c==1:\r\n print(\"YES\")\r\n for i in range(len(L)):\r\n print(''.join(map(str,L[i])))\r\nelse:\r\n print(\"NO\")\r\n \r\n\r\n", "seq = [input() for _ in range(int(input()))]\r\nfor i in range(len(seq)):\r\n if \"OO\" in seq[i]:\r\n seq[i] = seq[i].replace(\"OO\", \"++\", 1)\r\n print(\"YES\")\r\n for i in seq:\r\n print(i)\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "numRows = int(input())\r\nlst = [\"\"]*numRows\r\npossible = False\r\nfor row in range(numRows):\r\n l, r = input().split(\"|\")\r\n if l == \"OO\" and possible == False:\r\n lst[row] = \"++|\" + r\r\n possible = True\r\n elif r == \"OO\" and possible == False:\r\n lst[row] = l + \"|++\"\r\n possible = True\r\n else:\r\n lst[row] = l + \"|\" + r\r\n\r\nif possible:\r\n print(\"YES\")\r\n for item in lst:\r\n print(item)\r\nelse:\r\n print(\"NO\")", "def solve(arr, n):\r\n for i in range(n):\r\n if arr[i][0] == 'O' and arr[i][1] == 'O':\r\n arr[i][0] = '+'\r\n arr[i][1] = '+'\r\n return [True, arr]\r\n for i in range(n):\r\n if arr[i][3] == 'O' and arr[i][4] == 'O':\r\n arr[i][3] = '+'\r\n arr[i][4] = '+'\r\n return [True, arr]\r\n return [False, arr]\r\n\r\nn = int(input())\r\narr = []\r\nfor i in range(n):\r\n string = input()\r\n arr.append(list(string))\r\n[found, res] = solve(arr, n)\r\nif not found:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in range(n):\r\n for j in range(5):\r\n print(res[i][j], end=\"\")\r\n print()\r\n\r\n ", "n = int(input())\r\n\r\ns = ''\r\nfor _ in range(n):\r\n s += '\\n' + input()\r\n\r\ns = s.replace('OO', '++', 1)\r\nprint(f'YES{s}' if '++' in s else 'NO')", "m = int(input())\r\nl = []\r\nfor i in range(m):\r\n l.append(input())\r\nflag = False\r\nfor i in range(len(l)):\r\n if \"OO\" in l[i]:\r\n if l[i].count(\"OO\") == 1:\r\n l[i] = l[i].replace(\"OO\",\"++\")\r\n else:\r\n l[i] = \"++\"+l[i][2:]\r\n flag = True\r\n break\r\nif flag:\r\n print(\"YES\")\r\n for i in l:print(i)\r\nelse:print(\"NO\")", "\r\ns='\\n'.join([input() for i in range(int (input()))])\r\nns=s.replace('OO','++',1)\r\nprint('YES\\n'+ns if ns!=s else 'NO')", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n\tx=input()\r\n\ta.append(x)\r\ny=0\r\nfor i in range(n):\r\n\tif a[i][0:2] ==\"OO\":\r\n\t\ta[i]=\"++|\"+a[i][3:5]\r\n\t\ty=1\r\n\t\tbreak\r\n\telif a[i][3:5] ==\"OO\":\r\n\t\ta[i]=a[i][0:2]+\"|++\"\r\n\t\ty=1\r\n\t\tbreak\r\nif y==0:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\r\n\tfor j in a:\r\n\t\tprint(j)\r\n", "n = int(input())\r\nlis = list()\r\nflag = False\r\nfor i in range(n):\r\n s = input()\r\n if not flag:\r\n pos = s.find(\"OO\")\r\n if pos != -1:\r\n s = s[:pos] + \"++\" + s[pos + 2:]\r\n flag = True\r\n lis.append(s)\r\n\r\nif flag:\r\n print(\"YES\")\r\n for i in range(n):\r\n print(lis[i])\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\nseats = []\r\nflag = True\r\nfor i in range(n):\r\n seats.append(list(input().split('|')))\r\n if 'OO' in seats[i][0] and flag:\r\n seats[i][0] = seats[i][0].replace('OO', '++')\r\n flag = False\r\n if 'OO' in seats[i][1] and flag:\r\n seats[i][1] = seats[i][1].replace('OO', '++')\r\n flag = False\r\nif flag:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n for i in range(n):\r\n print('|'.join(seats[i]), end='\\n')", "t = int(input())\r\ncheck = 1\r\nl = []\r\nfor _ in range(t):\r\n a = input()\r\n if check:\r\n for i in range(4):\r\n if a[i] == a[i+1] == \"O\":\r\n b = i == 3\r\n if b:\r\n b = \"\"\r\n else:\r\n b = a[i+2:]\r\n a = a[:i] + \"++\" + b\r\n check = 0\r\n break\r\n l.append(a)\r\nif not check:\r\n print(\"YES\")\r\n print(\"\\n\".join(l))\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nfound=False\r\nbus=[]\r\nfor i in range(n):\r\n row = list(input())\r\n for seat in range(len(row)-1):\r\n if(row[seat]==row[seat+1] and row[seat]=='O' and not found):\r\n found = True\r\n row[seat] = '+'\r\n row[seat+1] = '+'\r\n bus.append(row)\r\n\r\nif found:\r\n print(\"YES\")\r\n for i in range(n):\r\n print(\"\".join(map(str,bus[i])))\r\nelse:\r\n print(\"NO\")", "import sys\nn = int(sys.stdin.readline())\nseats = []\nbool = False\nfor i in range(n):\n inp = sys.stdin.readline().replace('\\n','')\n pairs = inp.split('|')\n if bool is False:\n if pairs[0] == 'OO':\n bool = True\n seats.append('++|'+pairs[1])\n elif pairs[1] == 'OO':\n bool = True\n seats.append(pairs[0]+'|++')\n else:\n seats.append(inp)\n else:\n seats.append(inp)\nif bool is True:\n print('YES')\n for seat in seats:\n print(seat)\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\nseatList = []\r\nflag = 0\r\n\r\nfor i in range(n):\r\n for x in input().split(\"|\"):\r\n seatList.append(x)\r\n\r\nif \"OO\" in seatList:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n exit()\r\n\r\n\r\ni = 0\r\nfor seat in seatList:\r\n if seat == \"OO\" and flag == 0:\r\n flag =1\r\n seat = \"++\"\r\n if i%2 == 0:\r\n print(seat, end=\"|\")\r\n else:\r\n print(seat, end='\\n')\r\n i+=1\r\n", "n=int(input())\np=0\nrows=[]\nwhile p<n:\n rows.append(input())\n p+=1\nflag=0\nindex=0\n\nwhile index<n:\n if rows[index][0]=='O' and rows[index][1]=='O':\n rows[index] = rows[index][0:2].replace(\"O\",\"+\")+rows[index][2:]\n flag=True\n break\n elif rows[index][3]==\"O\" and rows[index][4]==\"O\":\n rows[index] = rows[index][:3]+rows[index][3:5].replace(\"O\",\"+\")\n flag=True\n break\n index+=1\n\nif flag!=True:\n print(\"No\")\nelse:\n print(\"Yes\")\n for row in rows:\n print(row)\n \n\n\n \n \n \n \n ", "n=int(input())\r\nz=0\r\nx=''\r\nfor i in range(n):\r\n v=input()\r\n if z==0:\r\n if v.find('OO')>-1:\r\n v=v.replace('OO','++',1)\r\n z=1\r\n x+=v\r\n x+='\\n'\r\nif z==0:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n print(x)", "n = int(input())\r\na = []\r\nflag = False\r\nfor _ in range(n):\r\n s = input().split('|')\r\n if not flag:\r\n if s[0] == 'OO':\r\n a.append('++')\r\n a.append(s[1])\r\n flag = True\r\n elif s[1] == 'OO':\r\n a.append(s[0])\r\n a.append('++')\r\n flag = True\r\n else:\r\n a.append(s[0])\r\n a.append(s[1])\r\n else:\r\n a.append(s[0])\r\n a.append(s[1])\r\nif flag:\r\n print('YES')\r\n for i in range(1, n+1):\r\n print(a[i*2-2]+'|'+a[i*2-1])\r\nelse:\r\n print('NO')", "n = int(input())\r\nimport sys\r\nx = sys.stdin.read()\r\nif \"OO\" in x:\r\n print(\"YES\")\r\n print(x.replace(\"OO\", \"++\", 1))\r\nelse:\r\n print(\"NO\")", "rows = int(input().lstrip().rstrip())\r\nrowsList = []\r\nfound = False\r\nfor _ in range(rows):\r\n rowStr = input().lstrip().rstrip()\r\n seats = rowStr.split(\"|\")\r\n if not found:\r\n if seats[0] == \"OO\":\r\n rowStr = \"++\"+\"|\"+seats[1]\r\n found = True\r\n elif seats[1] == \"OO\":\r\n rowStr = seats[0]+\"|\"+\"++\"\r\n found = True\r\n rowsList.append(rowStr)\r\n\r\nif found:\r\n print(\"YES\")\r\n print(\"\\n\". join(rowsList))\r\nelse:\r\n print(\"NO\")\r\n", "def solve():\r\n n = int(input())\r\n a = []\r\n flag = \"NO\"\r\n for i in range(n):\r\n s = str(input())\r\n if flag==\"NO\":\r\n if s[0]=='O' and s[1]=='O':\r\n s = '++' + s[2::]\r\n flag = \"YES\"\r\n elif s[-1]=='O' and s[-2]=='O':\r\n s = s[:3] + '++'\r\n flag = \"YES\"\r\n a.append(s)\r\n if flag==\"YES\":\r\n print(flag)\r\n for i in range(n):\r\n print(a[i])\r\n else:\r\n print(flag)\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()", "n=int(input())\r\na=[]\r\nk=0\r\nfor i in range(n):\r\n\ts=input()\r\n\tif s[0]=='O' and s[1]=='O' and k == 0:\r\n\t\ta.append('++'+s[2:len(s)])\r\n\t\tk=1\r\n\telif s[3]=='O' and s[4]=='O' and k == 0:\r\n\t\ta.append(s[0:len(s)-2]+'++')\r\n\t\tk=1\r\n\telse:\r\n\t\ta.append(s)\r\nif k>0:\r\n\tprint('YES')\r\n\tfor i in range(n):\r\n\t\t\tprint(a[i])\r\nelse:\r\n\tprint('NO')", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n l.append(input())\r\nc=0\r\nfor i in range(n):\r\n if \"OO\" in l[i]:\r\n c=1\r\n if l[i][0]=='O' and l[i][1]=='O':\r\n l[i]=\"++\"+l[i][2:]\r\n else:\r\n l[i]=l[i][:3]+\"++\"\r\n break\r\nif c:\r\n print(\"YES\")\r\n for i in l:\r\n print(i)\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\n\r\nmy_list = []\r\n\r\ncnt = 0\r\n\r\nwhile n:\r\n\tx = input()\r\n\tif 'OO' in x and cnt == 0:\r\n\t\tx = x.replace('OO','++',1)\r\n\t\tcnt+=1\r\n\t\t\r\n\tmy_list.append(x)\r\n\t\r\n\tn-=1\r\n\r\nif cnt:\r\n\tprint('YES')\r\n\t\r\n\tfor i in my_list:\r\n\t\r\n\t\tprint(i)\r\nelse:\r\n\tprint('NO')", "t = int(input())\r\nres = \"\"\r\nfor i in range(t):\r\n s = input()\r\n res+=s+\"\\n\"\r\nnres = res.replace(\"OO\",\"++\",1)\r\nif(nres == res):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(nres)\r\n", "a = int(input())\r\ns = []\r\nfor i in range(a):\r\n b = input().split('|')\r\n s.extend(b)\r\nfor j in range(len(s)):\r\n if s[j] == 'OO':\r\n s[j] = '++'\r\n break\r\nif '++' in s:\r\n print('YES')\r\n for k in range(0,2*(a-1)+1,2):\r\n print('{}|{}'.format(s[k],s[k+1]))\r\nelse:\r\n print('NO')", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n# File : 711A.py\n# Author : cppygod\n# Date : 11.02.2022\n# Last Modified Date: 05.03.2022\n# Last Modified By : cppygod\n\nimport os, sys, math, cmath, time, collections\nfrom collections import deque, Counter, OrderedDict, defaultdict\nfrom heapq import nsmallest, nlargest, heapify, heappop, heappush, heapreplace\nfrom math import ceil, floor, log, log2, sqrt, gcd, factorial, pow, pi\nfrom bisect import bisect_left, bisect_right\n\n# SOME GENERAL HELPER\ndef input_as_array(): return list(map(int, input().split()))\n\nstart_time = time.time()\n\n\ndef main():\n n = int(input())\n A = []\n for _ in range(n):\n s = input()\n A.append(s)\n\n found = False\n for i, val in enumerate(A):\n _ss = val.split('|')\n if _ss[0] == \"OO\":\n _ss[0] = '++'\n tmp = '|'.join(c for c in _ss)\n A[i] = tmp \n print(\"YES\")\n found = True\n break\n\n if _ss[1] == \"OO\":\n _ss[1] = '++'\n tmp = '|'.join(c for c in _ss)\n A[i] = tmp \n print(\"YES\")\n found = True\n break\n\n if found:\n for c in A:\n print(c)\n else:\n print(\"NO\")\n\nif __name__ == \"__main__\":\n if os.path.exists('data.in'):\n sys.stdin = open(\"data.in\", \"r\")\n sys.stdout = open(\"data.out\", \"w\")\n\n testcases = 1\n for i in range(testcases):\n main()\n\n # If it's local - Print this O/P\n if os.path.exists('data.in'):\n print(f\"Time Elapsed: {time.time() - start_time} seconds\")\n sys.stdout.close()\n", "from sys import stdin\r\n_input = stdin.readline\r\n_str, _int, _range = str, int, range\r\ndef solution():\r\n n = _int(_input())\r\n ans = []\r\n f = False\r\n for i in _range(n):\r\n ans.append(_input().rstrip('\\n'))\r\n l, r = ans[-1].split('|')\r\n if l == 'OO' and f == False:\r\n ans[-1] = '++|{}'.format(ans[-1][-2:])\r\n f = True\r\n if r == 'OO' and f == False:\r\n ans[-1] = '{}|++'.format(ans[-1][:2])\r\n f = True\r\n if not f:\r\n print(\"NO\")\r\n return\r\n print(\"YES\")\r\n for i in ans:\r\n print(i)\r\n\r\nsolution()", "k=''\nfor i in range(int(input())):\n k+=(input()+'\\n')\nr=k.replace('OO','++',1)\nprint(['YES\\n'+r, 'NO'][r is k])\n", "s = ''\r\ncond = False\r\nfor i in range(int(input())):\r\n new = input().split(\"|\")\r\n if \"OO\" in new and not cond:\r\n cond = True\r\n if new[0]==\"OO\":\r\n new[0]=\"++\"\r\n else:\r\n new[1]=\"++\"\r\n s += new[0] + \"|\" +new[1] + \"\\n\"\r\nif cond:\r\n print(\"YES\")\r\n print(s.strip(\"\\n\"))\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\ncheck=False\r\nres=[]\r\nfor j in range(n):\r\n x=input().split(\"|\")\r\n if check: \r\n res.append(x[0]+\"|\"+x[1])\r\n else:\r\n if x[0]==\"OO\":\r\n res.append(\"++|\"+x[1])\r\n check=True\r\n elif x[1]==\"OO\":\r\n res.append(x[0]+\"|++\")\r\n check=True\r\n else:\r\n res.append(x[0]+\"|\"+x[1])\r\nif check:\r\n print(\"YES\")\r\n print(\"\\n\".join(res))\r\nelse:\r\n print(\"NO\")", "lst = [w.rstrip() for w in open(0).readlines()][1:]\r\ns = '-'.join(lst)\r\nt = s.replace(\"OO\",\"++\", 1)\r\nif s == t:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(t.replace(\"-\",\"\\n\"))", "import sys\r\n# sys.stdout = open('CP/output.txt','w')\r\n# sys.stdin = open('CP/input.txt','r')\r\nn= int(input())\r\nseat = '\\n'.join(input() for _ in range(n))\r\nprint(\"NO\" if seat.find(\"OO\")==-1 else \"YES\\n\" +seat.replace(\"OO\", \"++\", 1))", "inp = int(input())\r\nls, flag = [],0\r\nwhile inp>0:\r\n p1,p2 = input().split('|')\r\n if p1=='OO' and flag==0:\r\n p1='++'\r\n flag=1\r\n elif p2=='OO' and flag==0:\r\n p2='++'\r\n flag=1\r\n else:\r\n pass\r\n ls.append(f'{p1}|{p2}')\r\n inp-=1\r\nelse:\r\n if flag!=1:\r\n print('NO')\r\n else:\r\n print('YES')\r\n print(*ls,sep='\\n')\r\n", "n = input()\nl = []\nfor _ in range(int(n)):\n l.append(input().split(\"|\"))\nms = -1\nfor i in range(int(n)):\n if \"OO\" in l[i]:\n l[i][l[i].index(\"OO\")] = \"++\"\n ms = i\n break\n\nif ms == -1:\n print(\"NO\")\nelse:\n print(\"YES\")\n for elem in l:\n print(elem[0] + \"|\" + elem[1])", "n=int(input())\r\nl=[]\r\nflag=0\r\nfor i in range(n):\r\n s=input()\r\n if flag==0 and s[0]=='O' and s[1]=='O':\r\n p='++'+s[2]+s[3]+s[4]\r\n l.append(p)\r\n flag=1\r\n elif flag==0 and s[3]=='O' and s[4]=='O':\r\n p=s[0]+s[1]+s[2]+'++'\r\n l.append(p)\r\n flag=1\r\n else:\r\n l.append(s)\r\nif flag==0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in l:\r\n print(i)", "ans = \"NO\"\r\nl = []\r\nx = True\r\nfor i in range(int(input())):\r\n a,b = input().split('|')\r\n if a == \"OO\" and x:\r\n a = \"++\"\r\n x = False\r\n elif b == \"OO\" and x:\r\n b = \"++\"\r\n x = False\r\n l.append(a+'|'+b)\r\nif x:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in l:\r\n print(i)", "ans=[]\nflag=False\nfor _ in range(int(input())):\n a=input().split('|')\n if(not flag):\n if(a[0]=='OO' or a[1]=='OO'):\n if(a[0]=='OO'):\n a[0]='++'\n else:\n a[1]=\"++\"\n flag=True\n ans.append(a)\nif(flag):\n print(\"YES\")\n for i in ans:\n print(i[0]+\"|\"+i[1])\nelse:\n print(\"NO\")", "n = input()\r\nrows = []\r\nflag = False\r\nfor i in range(int(n)):\r\n row = input()\r\n if not flag and 'OO' in row:\r\n row = row.replace('OO', '++', 1)\r\n flag = True\r\n rows.append(row)\r\nif flag:\r\n print(\"YES\")\r\n for i in range(int(n)):\r\n print(rows[i])\r\nelse:\r\n print(\"NO\")\r\n ", "t=int(input())\r\n\r\nrows=[]\r\nflag=0\r\nfor temp in range(t):\r\n rows.append(input())\r\nfor i in range(len(rows)):\r\n if 'OO' in rows[i]:\r\n print(\"YES\")\r\n idx=rows[i].index('OO')\r\n temp=rows[i][:idx]+'++'+rows[i][idx+2:]\r\n rows[i]=temp\r\n flag=1\r\n break\r\nif flag==1:\r\n for i in rows:\r\n print(i)\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nresult = []\r\nz = 0\r\nfor i in range(n):\r\n place = input()\r\n if place.count('OO') > 0:\r\n if z == 0:\r\n result.append(place.replace('OO', '++', 1))\r\n z += 1\r\n else:\r\n result.append(place)\r\n else:\r\n result.append(place)\r\nif z == 1:\r\n print('YES')\r\n for elem in result:\r\n print(elem, end=\"\\n\")\r\nelse:\r\n print('NO')\r\n", "f = 1\r\nans = []\r\nfor i in range(int(input())):\r\n a = input()\r\n if 'OO' in a and f:\r\n ans.append(a.replace('OO','++',1))\r\n f = 0\r\n else:\r\n ans.append(a)\r\nif f:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n print(*ans,sep='\\n')", "n = int(input())\r\ns = []\r\nflag = False\r\nfor i in range(n):\r\n a = input().split('|')\r\n if (not flag and a[0] == 'OO'):\r\n flag = True\r\n a[0] = '++'\r\n if (not flag and a[1] == 'OO'):\r\n flag = True\r\n a[1] = '++'\r\n s.append(a)\r\n\r\nif (flag):\r\n print(\"YES\")\r\n for a in s:\r\n print(a[0], a[1], sep=\"|\")\r\nelse:\r\n print(\"NO\")\r\n ", "import math\r\ndef solve():\r\n times = int(input())\r\n check = False\r\n rows = []\r\n for i in range(0,times):\r\n rows.append(input().split(\"|\"))\r\n for i in rows:\r\n if i[0]==\"OO\":\r\n check = True\r\n i[0] =\"++\"\r\n break\r\n elif i[1] ==\"OO\":\r\n check = True\r\n i[1] =\"++\"\r\n break\r\n if check:\r\n print(\"YES\")\r\n for i in rows:\r\n print(\"|\".join(i))\r\n else:\r\n print(\"NO\")\r\n \r\n \r\n\r\n \r\n\r\n \r\n\r\n# for _ in range(int(input())):\r\nsolve()", "c=0\r\nb=[]\r\nfor x in range(int(input())):\r\n a=input()\r\n if a[0:2]=='OO' and c<1:\r\n b.append('++'+a[2:5])\r\n c=1\r\n elif a[3:5]=='OO' and c<1:\r\n b.append(a[0:3]+'++')\r\n c=1\r\n else:\r\n b.append(a)\r\nif c<1:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n for x in b:\r\n print(x)", "t=int(input())\r\nb=[]\r\nk=0\r\nfor z in range(t):\r\n a=input()\r\n if(a[0]==\"O\" and a[1]==\"O\" and k!=1):\r\n k=1\r\n b.append(\"++\"+a[2:])\r\n elif(a[3]==\"O\" and a[4]==\"O\" and k!=1):\r\n k=1\r\n b.append(a[:3]+\"++\")\r\n else:\r\n b.append(a)\r\nif(k==0):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in range(len(b)):\r\n print(b[i])\r\n", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n s=input()\r\n l.append(s)\r\nflag=0\r\nfor i in range(n):\r\n s1,s2 = l[i].split(\"|\")\r\n if(s1.count(\"O\")==2 and flag==0):\r\n flag=1\r\n l[i] = \"++\"+\"|\"+s2\r\n continue\r\n elif(s2.count(\"O\")==2 and flag==0):\r\n flag=1\r\n l[i] = s1+\"|\"+\"++\"\r\n\r\nif(flag==1):\r\n print(\"YES\")\r\n for i in l:\r\n print(i)\r\nelse:\r\n print(\"NO\")\r\n ", "n = int(input())\r\nb= '\\n'.join(input() for i in range(n))\r\nif 'OO' in b:\r\n print('YES')\r\n i = b.index('OO')\r\n b = b[:i] + '++' + b[i+2:]\r\n print(b)\r\nelse:\r\n print('NO')\r\n", "n = int(input())\r\nans = []\r\ncan = False\r\nfor i in range(n):\r\n s = input()\r\n s = s.partition('|')\r\n for i in s:\r\n if ('OO' in i) and (not can):\r\n can = True\r\n i = '++'\r\n ans.append(i)\r\nif can:\r\n print('YES')\r\n for i in range(n):\r\n print(''.join(ans[3*i:3*i+3]))\r\nelse:\r\n print('NO')\r\n", "n=int(input())\r\nans=\"NO\"\r\nd=[]\r\ns=0\r\nwhile n>0:\r\n s1=input()\r\n if s1[0]+s1[1]==\"OO\" and s==0:\r\n ans=\"YES\"\r\n s=1\r\n s1=\"+\"+\"+\"+s1[2]+s1[3]+s1[4]\r\n elif s1[3]+s1[4]==\"OO\" and s==0:\r\n ans=\"YES\"\r\n s=1\r\n s1=s1[0]+s1[1]+s1[2]+\"+\"+\"+\"\r\n d+=[s1]\r\n n-=1\r\nif ans==\"YES\":\r\n print(ans)\r\n for i in d:\r\n print(i)\r\nelse:\r\n print(\"NO\")", "n = int(input())\nk = 0\nl = list()\nfor i in range(n):\n s = input()\n if (s[0] == s[1] == \"O\" or s[3] == s[4] == \"O\") and k == 0:\n s = s.replace(\"OO\", \"++\", 1)\n k = 1\n l.append(s)\nif k == 1:\n print(\"YES\")\n print(*l, sep = \"\\n\")\nelse:\n print(\"NO\")", "\"\"\"Bus to Udayland\"\"\"\r\ndef print_seats(seats):\r\n for i in range(len(seats)):\r\n for j in range(5):\r\n print(seats[i][j],end=\"\")\r\n print()\r\n\r\nn = int(input())\r\nseats = []\r\nfree = 'O'\r\noccupied = 'X'\r\nfor i in range(n):\r\n seats.append(list(map(str, input())))\r\nfor i in seats:\r\n if (i[0] == free and i[1] == free):\r\n print(\"YES\")\r\n i[0] = \"+\"\r\n i[1] = \"+\"\r\n print_seats(seats)\r\n break\r\n elif (i[3] == free and i[4] == free):\r\n print(\"YES\")\r\n i[3] = \"+\"\r\n i[4] = \"+\"\r\n print_seats(seats)\r\n break\r\nelse:\r\n print(\"NO\")\r\n\r\n", "n=int(input())\r\narr={}\r\nfor i in range(n):\r\n arr[i]=list(input())\r\ni=0\r\nc=0\r\nwhile(i<n):\r\n if(arr[i][0]==\"O\" and arr[i][1]==\"O\"):\r\n arr[i][0]=\"+\"\r\n arr[i][1]=\"+\"\r\n c=1\r\n break\r\n if(arr[i][3]==\"O\" and arr[i][4]==\"O\"):\r\n arr[i][3]=\"+\"\r\n arr[i][4]=\"+\"\r\n c=1\r\n break\r\n i+=1\r\nif(c==1):\r\n print(\"YES\")\r\n for j in range(n):\r\n for k in range(5):\r\n print(arr[j][k],sep=\"\",end=\"\")\r\n print()\r\nelse:\r\n print(\"NO\")", "amount_rows = int(input())\r\nrows = []\r\nanswer = \"NO\"\r\nfor i in range(amount_rows):\r\n rows.append(input())\r\n\r\nfor i in range(amount_rows):\r\n rows[i] = list(rows[i])\r\n if rows[i][0] == rows[i][1] and rows[i][0] == \"O\":\r\n rows[i][0] = \"+\"\r\n rows[i][1] = \"+\"\r\n answer = \"YES\"\r\n break\r\n if rows[i][3] == rows[i][4] and rows[i][3] == \"O\":\r\n rows[i][3] = \"+\"\r\n rows[i][4] = \"+\"\r\n answer = \"YES\"\r\n break\r\n\r\nprint(answer)\r\nif answer == \"YES\":\r\n for i in range(amount_rows):\r\n temp = \"\"\r\n for j in range(5):\r\n temp += rows[i][j]\r\n print(temp)", "n = int(input())\r\nlst = []\r\nflag = 0\r\nfor i in range(n):\r\n lst.append(input())\r\nfor j in range(n):\r\n for k in range(4):\r\n if lst[j][k] == lst[j][k+1] == \"O\":\r\n if k > 2:\r\n lst[j] = lst[j][0:3]+\"++\"\r\n else:\r\n lst[j] = \"++\"+lst[j][2:5]\r\n flag = 1\r\n break\r\n if flag != 0:\r\n break\r\n\r\nif flag != 0:\r\n print(\"YES\")\r\n for l in range(n):\r\n print(lst[l])\r\nelse:\r\n print(\"NO\")\r\n\r\n", "s = []\nfor i in range(int(input())):\n s.append(input())\nx = \",\".join(s)\nans = 0\nout = \"\"\nfor i in range(len(x)-1):\n if (x[i] == \"O\" and x[i+1] == \"O\"):\n out += \"+\"\n out += \"+\"\n break\n else:\n out += x[i]\n ans += 1\nout += x[ans+2:]\nif (\"+\" in out):\n print(\"YES\")\n print(*out.split(\",\"), sep=\"\\n\")\nelse:\n print(\"NO\")\n", "t=int(input())\r\nr=[]\r\nfor i in range(t):\r\n r.append(input())\r\nn=1\r\nfor i in r:\r\n if i[0:2]==\"OO\":\r\n n=5\r\n e=\"++\"+i[2:]\r\n c=r.index(i)\r\n r.remove(i)\r\n r.insert(c,e)\r\n break\r\n elif i[3:]==\"OO\":\r\n n=5\r\n e=i[:3]+\"++\"\r\n c=r.index(i)\r\n r.remove(i)\r\n r.insert(c,e)\r\n break\r\n else:\r\n None\r\nif n==5:\r\n print(\"YES\")\r\n for i in r:\r\n print(i)\r\nelse:\r\n print(\"NO\")", "n = int(input())\n\ns = []\nans = \"NO\"\nfor i in range(n):\n s.append(list(input()))\n for j in range(2):\n if ans == \"NO\" and s[i][3 * j] == 'O' and s[i][3 * j + 1] == 'O':\n ans = \"YES\"\n s[i][3 * j : 3 * j + 2] = '++'\nprint(ans)\nif ans == \"YES\":\n for i in range(n):\n print(''.join(s[i]))\n", "import sys\ninput = sys.stdin.readline\n\nS = \"\\n\".join([input().rstrip() for _ in range(int(input()))])\nif S.find(\"OO\") >= 0 : print(\"YES\"); print(S.replace(\"OO\", \"++\", 1))\nelse : print(\"NO\")\n", "ans = 'NO'\r\nL = []\r\nfor i in range(int(input())):\r\n s = input()\r\n if ans == 'YES':\r\n L.append(s)\r\n elif s[0] == 'O' and s[1] == 'O':\r\n ans = 'YES'\r\n L.append('++' + s[2:])\r\n elif s[3] == 'O' and s[4] == 'O':\r\n ans = 'YES'\r\n L.append(s[:3] + '++')\r\n else:\r\n L.append(s)\r\nif ans == 'YES':\r\n print(ans)\r\n for x in L:\r\n print(x)\r\nelse:\r\n print('NO')\r\n ", "n=int(input())\r\nl=[]\r\nc=0\r\nfor i in range(n):\r\n\tl2=list(input())\r\n\tl.append(l2)\r\nfor i in range(n):\r\n\tfor j in range(4):\r\n\t\tif l[i][j]=='O' and l[i][j+1]==\"O\" and c!=1:\r\n\t\t\tl[i][j]=\"+\"\r\n\t\t\tl[i][j+1]=\"+\"\r\n\t\t\tc+=1\r\n\t\t\tbreak\r\nif c==1:\r\n\tprint(\"YES\")\r\n\tfor x in l: \r\n\t\tfor i in x: \r\n\t\t\tprint(i,end =\"\")\r\n\t\tprint()\t\t\r\nelse:\r\n\tprint(\"NO\")", "n = int(input())\r\n\r\nbus = []\r\nfor _ in range(n):\r\n bus.append(input().split('|'))\r\n \r\nflag = False\r\nfor row in bus:\r\n if row[0] == 'OO':\r\n row[0] = '++'\r\n flag = True\r\n break\r\n elif row[1] == 'OO':\r\n row[1] = '++'\r\n flag = True\r\n break\r\n \r\nif flag:\r\n print('YES')\r\n for row in bus:\r\n print(row[0]+'|'+row[1])\r\nelse:\r\n print('NO')", "n=int(input())\r\n\r\nidx=0\r\n\r\nseats=[]\r\nf=False\r\nf2=True\r\nwhile idx<n:\r\n\ttmp=input().split('|')\r\n\tseats.append(tmp)\r\n\r\n\tfor i in range(len(tmp)):\r\n\t\tif 'X' not in tmp[i]:\r\n\t\t\tf=True\r\n\t\t\tif f2==True:\r\n\t\t\t\ttmp[i]='++'\r\n\t\t\t\tf2=False\r\n\r\n\r\n\tidx+=1\r\n\r\nif f==False:\r\n\tprint('NO')\r\n\r\nelif f==True:\r\n\tprint('YES')\r\n\t\r\n\tfor i in seats:\r\n\t\tprint('|'.join(i))\r\n", "import sys\r\ninput()\r\ns=sys.stdin.read()\r\nprint('NO' if s.find('OO')<0 else 'YES\\n'+s[:s.find('OO')]+'++'+s[s.find('OO')+2:])\r\n", "n = int(input())\r\nx = \"\"\r\nfor i in range(n):\r\n x+=input()+\"\\n\"\r\nif x.count('OO')<=0:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\r\n\tprint(x.replace('OO','++',1))\t ", "import sys\r\nfrom collections import deque\r\n\r\ninput = sys.stdin.readline\r\noutput = sys.stdout.write\r\n\r\n\r\ndef checker(n):\r\n global state\r\n summ = 0\r\n for i in n:\r\n summ += ord(i)\r\n if summ == 158:\r\n return 158\r\n else:\r\n return 10\r\n\r\n\r\ndef main():\r\n rows = int(input())\r\n state = False\r\n bus = deque()\r\n for i in range(rows):\r\n bus.append(input().rstrip())\r\n for indx, item in enumerate(bus):\r\n if state is False:\r\n a, b = item.split('|')\r\n l = checker(a)\r\n r = checker(b)\r\n if l == 158:\r\n bus[indx] = '++|' + b\r\n state = True\r\n break\r\n elif r == 158:\r\n bus[indx] = a + '|++'\r\n state = True\r\n break\r\n if state:\r\n output('YES')\r\n output('\\n')\r\n for u in bus:\r\n output(u)\r\n output('\\n')\r\n else:\r\n output('NO')\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "# Time Complexity: O(n)\n# Space Complexity: O(n)\n# The program iterates through every line of seats to find \"OO\"\na = []\nfound = False\nfor _ in range(int(input())):\n line = input()\n if not found:\n seats = line.split(\"|\")\n if \"OO\" in seats:\n i = seats.index(\"OO\")\n seats[i] = \"++\"\n found = True\n line = \"|\".join(seats)\n a.append(line)\nif found:\n print(\"YES\")\n for s in a:\n print(s)\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\ny=0\r\nans=[]\r\nfor i in range(n):\r\n a=input()\r\n if \"OO\" in a:\r\n if y==0:\r\n ans.append(a.replace(\"OO\", \"++\", 1))\r\n y=1\r\n else:\r\n ans.append(a)\r\n else:\r\n ans.append(a)\r\nfor j in ans:\r\n if \"++\" in j:\r\n Z=\"YES\"\r\n break\r\nelse:\r\n Z=\"NO\"\r\nprint(Z)\r\nfor j in ans:\r\n if Z==\"YES\":\r\n print(j)", "n=int(input())\r\nflag = 0\r\narr=[]\r\nfor _ in range(n):\r\n arr=arr+list(input().split(\"|\"))\r\n# print(*arr)\r\nfor i in range(2*n):\r\n if flag ==0:\r\n if arr[i]==\"OO\":\r\n flag = 1\r\n arr[i]=\"++\"\r\n break\r\nif flag==1:\r\n print(\"YES\")\r\n for i in range(0,2*n,2):\r\n print(arr[i]+'|'+arr[i+1])\r\nelse:\r\n print(\"NO\") ", "\r\nn = int(input())\r\nindex = 0\r\ninput_l = list()\r\nall_l = list()\r\nflag = False\r\nfor i in range(n):\r\n input_l = list(input().split('|'))\r\n\r\n for j, l in enumerate(input_l):\r\n if l[0] == l[1] and l[0] == 'O':\r\n flag = True\r\n input_l[j] = '++'\r\n \r\n if flag:\r\n break\r\n all_l.append(input_l)\r\n index = i\r\n if flag:\r\n break\r\n \r\nfor i in range(index + 1, n):\r\n all_l.append(input().split('|') )\r\n\r\nif flag:\r\n print('YES')\r\n for l in all_l:\r\n \r\n print( '|'.join(l))\r\nelse:\r\n print('NO')\r\n", "c=0\r\nl=[]\r\nfor _ in range(int(input())):\r\n\tx=input()\r\n\tif c==0:\r\n\t\tif 'OO' in x:\r\n\t\t\tc=1\r\n\t\t\tif x[:2]=='OO':\r\n\t\t\t\tx='++|'+x[3:]\r\n\t\t\telse:\r\n\t\t\t\tx=x[:3]+'++'\r\n\tl.append(x)\r\nif c==0: print('NO')\r\nelse:\r\n\tprint('YES')\r\n\tfor i in l:\r\n\t\tprint(i)", "n = int(input())\r\nli = []\r\nfor _ in range(n):\r\n a = input()\r\n li.append(a)\r\nfor i in range(len(li)):\r\n if \"OO\" in li[i]:\r\n print(\"YES\")\r\n b = li[i].index(\"OO\")\r\n li[i] = li[i][:b] + \"++\" + li[i][b+2:]\r\n print(*li, sep=\"\\n\")\r\n break\r\nelse:\r\n print(\"NO\")", "ans=False\r\nmass=[]\r\nfor _ in range(int(input())):\r\n c=input()\r\n if 'OO' in c and ans==False:\r\n c=c.replace('OO','++',1)\r\n ans=True\r\n mass.append(c)\r\nif ans:\r\n print('YES')\r\n for __ in mass:\r\n print(__)\r\nelse:\r\n print('NO')\r\n", "bus=[]\r\nseat = False\r\nfor _ in range(int(input())):\r\n row = input()\r\n if not seat and 'OO' in row:\r\n seat = True\r\n row = row.replace('OO', '++', 1)\r\n bus.append(row)\r\nif seat:\r\n print('\\n'.join(['YES', *bus]))\r\nelse:\r\n print('NO')", "s = int(input())\r\nx = []\r\nyes = 0\r\nfor _ in range(s):\r\n temp, temp2 = input().split('|')\r\n if yes == 0:\r\n if temp == 'OO':\r\n yes = 1\r\n temp = '++'\r\n elif temp2 == 'OO':\r\n yes = 1\r\n temp2 = '++'\r\n else:\r\n pass\r\n x.append(temp)\r\n x.append(temp2)\r\nif yes:\r\n print('YES')\r\n for i in range(0,(s * 2),2):\r\n print(f'{x[i]}|{x[i + 1]}')\r\nelse:\r\n print('NO')", "n = int(input())\r\na = []\r\nr = False\r\nfor i in range(n):\r\n v = input().split('|')\r\n if r==False and v[0] == 'OO':\r\n r = True\r\n v[0] = '++'\r\n if r==False and v[1] == 'OO':\r\n r = True\r\n v[1] = '++'\r\n a.append('|'.join(v))\r\nif r:\r\n print('YES')\r\n for x in a:\r\n print(x)\r\nelse:\r\n print('NO')\r\n", "import math\r\nx = int(input());\r\na=[];\r\nfor v in range (0,x):\r\n c=list(map(str,input()));\r\n a.append(c);\r\n\r\ndef seat(a,x):\r\n for i in range (0,x):\r\n for j in range (0,5):\r\n if (a[i][0]=='O' and a[i][1]=='O'):\r\n a[i][0]=\"+\";\r\n a[i][1]=\"+\";\r\n print(\"YES\");\r\n for k in range (0,x):\r\n for l in range(0,5):\r\n print(a[k][l],end=\"\");\r\n print()\r\n return\r\n elif (a[i][3]=='O' and a[i][4]=='O'):\r\n a[i][3]=\"+\";\r\n a[i][4]=\"+\";\r\n print(\"YES\");\r\n for k in range(0, x):\r\n for l in range(0, 5):\r\n print(a[k][l],end=\"\");\r\n print();\r\n return\r\n else:\r\n if (i == x - 1 and j == 4):\r\n print(\"NO\");\r\n\r\nseat(a,x);\r\n\r\n\r\n\r\n", "def main():\r\n n = int(input())\r\n bus = []\r\n\r\n done = False\r\n for _ in range(n):\r\n row = list(input().strip())\r\n if not done:\r\n if row[0] == 'O' and row[1] == 'O':\r\n row[0] = '+'\r\n row[1] = '+'\r\n done = True\r\n elif row[3] == 'O' and row[4] == 'O':\r\n row[3] = '+'\r\n row[4] = '+'\r\n done = True\r\n bus.append(\"\".join(row))\r\n\r\n if done:\r\n print(\"YES\")\r\n for r in bus:\r\n print(r)\r\n else:\r\n print(\"NO\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "# LUOGU_RID: 111354650\nn = int(input())\r\nrow = []\r\nflag = False\r\nflag2 = False\r\nfor i in range(n):\r\n pair = input().split('|')\r\n row.append(pair)\r\nfor i in range(n):\r\n for j in range(2):\r\n if row[i][j] == 'OO':\r\n row[i][j] = '++'\r\n flag = True\r\n break\r\n if flag == True:\r\n break\r\nif flag == False:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in range(n):\r\n for j in range(2):\r\n if flag2 == False:\r\n print(row[i][j]+'|',end=\"\")\r\n flag2 = True\r\n else:\r\n print(row[i][j])\r\n flag2 = False", "n=int(input())\r\nsample1=[]\r\nfound=0\r\nfor i in range(0,n):\r\n\tarray1=input()\r\n\tsample=\"\"\r\n\t\r\n\tsample1.append(array1)\r\nfor j in range(0,len(sample1)):\r\n\tif(sample1[j][0]+sample1[j][1]==\"OO\" or sample1[j][3]+sample1[j][4]==\"OO\"):\r\n\t\tpair=j\r\n\t\tfound=1\r\n\t\tbreak\r\nif(found==1):\r\n\tprint(\"YES\")\r\n\t# print(\"Found Empty Seat In Row\",pair)\r\n\t# print(sample1)\r\n\tfor k in range(0,len(sample1)):\r\n\t\tif(k==pair):\r\n\t\t\tvalid=\"\"\r\n\t\t\tif(sample1[k][0]+sample1[k][1]==\"OO\"):\r\n\t\t\t\tvalid+=\"++\"+sample1[k][2:]\r\n\t\t\telif(sample1[k][3]+sample1[k][4]==\"OO\"):\r\n\t\t\t\tvalid+=sample1[k][:3]+\"++\"\r\n\t\t\tprint(valid)\r\n\t\t\r\n\t\telse:\r\n\t\t\tprint(sample1[k])\r\nelse:\r\n\tprint(\"NO\")", "num_rows = int(input())\r\nplace = False\r\nrows = []\r\n\r\nfor i in range(num_rows):\r\n row = input()\r\n if 'OO' in row and place == False:\r\n row = row.replace('OO', '++', 1)\r\n place = True\r\n rows.append(row)\r\n\r\nif place == True:\r\n print('YES')\r\n for row in rows:\r\n print(*row, sep='')\r\nelse:\r\n print('NO')\r\n", "ioi = ''\r\nfor i in range(int(input())):\r\n ioi += input() + '\\n'\r\nioi_01 = ioi.replace('OO', '++', 1)\r\nif ioi != ioi_01:\r\n print('YES\\n' + ioi_01)\r\nelse:\r\n print('NO')", "def main():\r\n a = []\r\n for i in range(int(input())):\r\n a += input().split('|')\r\n if 'OO' in a:\r\n print(\"YES\")\r\n a[a.index('OO')] = '++'\r\n for i in range(0, len(a)-1, 2):\r\n print(*a[i:i+2], sep='|')\r\n else:\r\n print(\"NO\")\r\nmain()\r\n", "n = int(input())\r\ns = []\r\nf = True\r\nfor i in range(n):\r\n r = input()\r\n if f:\r\n w = r.replace('OO', '++', 1)\r\n else:\r\n w = r\r\n if w != r:\r\n f = False\r\n s.append(w)\r\nif not f:\r\n print('YES')\r\n for i in s:\r\n print(i)\r\nelse:\r\n print('NO')", "n=int(input())\r\ncomplete=[]\r\nf=0\r\nfor i in range(n):\r\n word=input()\r\n complete.append(word)\r\n if f!=1:\r\n if word[0:2]=='OO' or word[3:]=='OO':\r\n if word[0:2]=='OO':\r\n word=list(word)\r\n word=['+','+']+word[2:]\r\n else:\r\n word=list(word)\r\n word=word[:3]+['+','+']\r\n word=''.join(word)\r\n complete[i]=word\r\n f=1\r\nif f==1:\r\n print(\"YES\")\r\n for i in complete:\r\n print(i)\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nseats = []\r\nanswer = \"NO\"\r\nfor i in range(n):\r\n row = input()\r\n if answer == \"NO\" and(\"OO\" in row):\r\n answer = \"YES\"\r\n seats.append(row.replace(\"OO\", \"++\", 1))\r\n else:\r\n seats.append(row)\r\nprint(answer)\r\nif answer == \"YES\":\r\n for row in seats:\r\n print(row)\r\n\r\n \r\n", "ans = [input().split('|') for _ in range(int(input()))]\r\nok = False\r\nfor i in ans:\r\n if 'OO' in i:\r\n ok = True\r\n idx1 = ans.index(i)\r\n idx2 = i.index('OO')\r\n break\r\nif ok:\r\n ans[idx1][idx2] = '++'\r\n print('YES')\r\n for i in ans:print('|'.join(i))\r\nelse:print('NO')", "n = int(input())\r\nseats = []\r\n\r\ni = 0\r\nwhile i < n:\r\n\r\n seats.append(input().split(\"|\"))\r\n i += 1\r\n\r\nfound = False\r\n\r\nfor row in seats:\r\n if not found:\r\n if row[0] == \"OO\":\r\n row[0] = \"++\"\r\n found = True\r\n elif row[1] == \"OO\":\r\n row[1] = \"++\"\r\n found = True\r\n\r\nif found:\r\n print(\"YES\")\r\n for row in seats:\r\n print('|'.join(row))\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nk = 0\r\nl = []\r\nfor i in range(n):\r\n s = list(input())\r\n for j in range(len(s) - 1):\r\n if s[j] == \"O\" and s[j] == s[j + 1] and k == 0:\r\n s[j] = \"+\"\r\n s[j + 1] = \"+\"\r\n k = 1\r\n l.append(s)\r\nif k == 1:\r\n print(\"YES\")\r\n for i in range(n):\r\n for j in range(5):\r\n print(l[i][j],end=\"\")\r\n print()\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\ns=[]\r\nfor i in range(n):\r\n temp=list(input())\r\n s.append(temp)\r\nflag=True\r\nfor i in range(n):\r\n if s[i][0]=='O' and s[i][1]=='O':\r\n flag=False\r\n s[i][0]='+'\r\n s[i][1]='+'\r\n break\r\n if s[i][3]=='O' and s[i][4]=='O':\r\n flag=False\r\n s[i][3]='+'\r\n s[i][4]='+'\r\n break\r\nif flag:\r\n print(\"NO\")\r\n exit(0)\r\nprint(\"YES\")\r\nfor i in range(n):\r\n print(''.join(s[i]))", "n = int(input())\n\nzuowei = []\nif_find = \"NO\"\nfor i in range(n):\n temp = input().split(\"|\")\n if(if_find == \"NO\" and \"OO\" in temp):\n if_find = \"YES\"\n temp[temp.index(\"OO\")] = \"++\"\n\n zuowei.append(temp)\n\nprint(if_find)\nif(if_find == \"YES\"):\n for i in zuowei:\n print(f\"{i[0]}|{i[1]}\")\n \t\t \t\t \t \t \t \t\t\t \t \t\t \t\t\t\t\t\t", "n = int(input())\r\ncheck = 0\r\nans = []\r\nfor i in range(n):\r\n s = list(input())\r\n if check == 0 and s[0] == 'O' and s[1] == 'O':\r\n s[0], s[1] = '+', '+'\r\n check = 1\r\n if check == 0 and s[3] == s[4] == 'O':\r\n s[3], s[4] = '+', '+'\r\n check = 1\r\n ans.append(s)\r\nif check:\r\n print('YES')\r\n for i in ans: print(*i, sep = '')\r\nelse: print('NO')", "n = int(input()) # number of rows of seats on bus\n\nbus_status = []\nfor row_number in range(n):\n bus_status.append(input())\n\nsolution = \"\"\n\nhave_seat = False\nfor row_of_seats in bus_status:\n if not have_seat and row_of_seats[0] == row_of_seats[1] == \"O\":\n solution += \"++\" + row_of_seats[2:] + \"\\n\"\n have_seat = True\n elif not have_seat and row_of_seats[3] == row_of_seats[4] == \"O\":\n solution += row_of_seats[:3] + \"++\\n\"\n have_seat = True\n else:\n solution += row_of_seats + \"\\n\"\n\nif (have_seat):\n print(\"YES\\n\" + solution)\nelse:\n print(\"NO\")\n" ]

[ "import sys\r\nimport math\r\nfrom decimal import *\r\n \r\nline = lambda: list(int(x) for x in input().split())\r\n \r\ndef pow(a, k, p):\r\n r = 1\r\n t = a\r\n while k > 0:\r\n if k % 2 == 1:\r\n r = r * t % p\r\n t = t * t % p\r\n k >>= 1\r\n return r\r\n \r\ntest = int(input())\r\nfor i in range(0, test):\r\n x = int(input())\r\n x = x * 10 ** 6\r\n x += (2 ** 17 - x % 2 ** 17) % 2 ** 17\r\n if x % 5 == 0:\r\n x += 2 ** 17;\r\n res = 0\r\n for i in range(1, 17 + 1):\r\n while pow(2, res, 5 ** i) != x % 5 ** i:\r\n if i == 1:\r\n res += 1\r\n else:\r\n res += 4 * 5 ** (i - 2)\r\n res += 4 * 5 ** 16\r\n print(res)", "L = 11; L_ = 32\r\nP2 = 2**L_\r\nP5 = 5**(L_//2)\r\nP2P5 = P2 * P5\r\nP5_ = 5**L_\r\nP10 = 10**L_\r\nP10_ = 10**(L_-L)\r\nT = P5 // 5 * 4\r\nT_ = P5_ // 5 * 4\r\n\r\ndef gcd_(a, b):\r\n if b == 0:\r\n return (1, 0)\r\n else:\r\n (x_, y_) = gcd_(b, a % b)\r\n return (y_, x_ - a // b * y_)\r\n\r\ndef inv(a, md):\r\n (x_, y_) = gcd_(a, md)\r\n if x_ < 0:\r\n x_ += md\r\n return x_\r\n\r\ndef init():\r\n a = 2; p = 1; k = T\r\n while k:\r\n if (k & 1):\r\n p = p * a % P5_\r\n a = a * a % P5_\r\n k >>= 1\r\n return (inv(P2, P5) * P2, inv(p // P5, P5))\r\n\r\n(X, Y) = init()\r\n\r\nt = int(input())\r\n\r\nwhile t > 0:\r\n t -= 1\r\n n = int(input())\r\n n *= P10_\r\n n = ((n - X + P2P5 - 1) // P2P5 * P2P5 + X) % P5_\r\n print((n // P5 * Y % P5 * T) % T_ + T_)" ]

[ "n = int(input())\r\narr = list(map(int, input().split()))\r\ndef solve(n, a):\r\n s = sum(a)\r\n if n == 1 or s & 1:\r\n print('NO')\r\n return\r\n half = s // 2\r\n def judge(a):\r\n pre, st = 0, {0}\r\n for num in a:\r\n st.add(num)\r\n pre += num\r\n if pre - half in st: return True\r\n return False\r\n print('YES' if judge(a) or judge(a[::-1]) else 'NO')\r\n\r\nsolve(n, arr)", "n = int(input())\r\nA = list(map(int, input().split()))\r\n\r\nfrom itertools import accumulate\r\ndef check(A):\r\n s = sum(A)\r\n if s%2 != 0:\r\n return False\r\n C = [0]+A\r\n C = list(accumulate(C))\r\n for i in range(n):\r\n if C[i+1] == s//2:\r\n return True\r\n S = set()\r\n for i in range(n):\r\n t = C[i+1]-C[0]\r\n if i != 0:\r\n if (-s+2*t)%2 == 0:\r\n p = (-s+2*t)//2\r\n if p in S:\r\n return True\r\n S.add(A[i])\r\n\r\nif check(A):\r\n print('YES')\r\n exit()\r\nA.reverse()\r\nif check(A):\r\n print('YES')\r\n exit()\r\nprint('NO')\r\n", "def divPos(arr):\r\n sumArr = sum(arr)\r\n targetSum = sumArr / 2\r\n if sumArr % 2 != 0:\r\n return False\r\n lArr = set()\r\n sumlArr = 0\r\n for i in range(len(arr)):\r\n lArr.add(arr[i])\r\n sumlArr += arr[i]\r\n if sumlArr == targetSum or (sumlArr > targetSum and sumlArr - targetSum in lArr):\r\n return True\r\n return False\r\n \r\nif __name__ == '__main__':\r\n n = input()\r\n arr = [int(x) for x in input().split()]\r\n # arr = [2,2,3,4,5]\r\n if divPos(arr) or divPos(arr[::-1]):\r\n print('YES')\r\n else:\r\n print('NO')\r\n \r\n \r\n\r\n \r\n\r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n\r\n\r\n \r\n\r\n \r\n \r\n \r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\ndic = dict()\r\nsum = 0\r\nfor i,j in enumerate(l):\r\n sum += j\r\n dic[sum] = i\r\nif sum % 2 == 1:\r\n print(\"NO\")\r\n exit()\r\n\r\nfor i,j in enumerate(l):\r\n v = sum // 2 - j\r\n if v in dic and dic[v] < i:\r\n print(\"YES\")\r\n exit()\r\n v = sum / 2 + j\r\n if v in dic and dic[v] >= i:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")# 1692310808.353773", "def find(ar: list) -> bool:\r\n p = [0]\r\n s = sum(ar)\r\n if s % 2 != 0:\r\n return False\r\n for elm in ar:\r\n p.append(p[-1] + elm)\r\n if p[-1] == (s >> 1):\r\n return True\r\n lk = set()\r\n n = len(ar)\r\n for i in range(1, n):\r\n lk.add(ar[i - 1])\r\n elm = -(s >> 1) + (p[i] + ar[i])\r\n if elm in lk:\r\n return True\r\n \r\n return False\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n ar = list(map(int, input().split()))\r\n rar = ar[::-1]\r\n if find(ar) or find(rar):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "n = int(input())\na = [int(x) for x in input().split()]\n\nl = [0]\nfor x in a:\n l.append(l[-1] + x)\n\nr = [0]\nfor x in reversed(a):\n r.append(r[-1] + x)\nr = r[::-1]\n\nls, rs = {}, {}\n\nfor x in a:\n rs.setdefault(x, 0)\n rs[x] += 1\n\nfor i in range(n):\n if i > 0:\n x = a[i - 1]\n ls.setdefault(x, 0)\n ls[x] += 1\n rs[x] -= 1\n\n d = l[i] - r[i]\n \n if d == 0:\n print(\"YES\")\n break\n \n if d % 2 == 1:\n continue\n\n if d > 0 and ls.get(d // 2, 0) > 0:\n print(\"YES\")\n break\n\n if d < 0 and rs.get(-d // 2, 0) > 0:\n print(\"YES\")\n break\nelse:\n print(\"NO\")\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\nl=[int(i) for i in input().split()]\r\npref=[l[0]]\r\nsuff=[0 for i in range(n)]\r\nsuff[n-1]=l[n-1]\r\nfor i in range(1,n):\r\n pref.append(pref[i-1]+l[i])\r\nfor i in range(n-2,-1,-1):\r\n suff[i]=suff[i+1]+l[i]\r\nd1={}\r\nc=0\r\nfor i in range(n-1):\r\n d1[l[i]]=1\r\n if(pref[i]==suff[i+1]):\r\n c=1\r\n break\r\n elif(pref[i]>suff[i+1]):\r\n if(i!=0):\r\n d=(pref[i]-suff[i+1])//2\r\n if(d in d1 and (pref[i]-suff[i+1])%2==0):\r\n c=1\r\n break\r\nif(c==1):\r\n print(\"YES\")\r\nelse:\r\n d2={}\r\n for i in range(n-1,0,-1):\r\n d2[l[i]]=1\r\n if(pref[i-1]==suff[i]):\r\n c=1\r\n break\r\n elif(suff[i]>pref[i-1]):\r\n if(i!=n-1):\r\n d=(suff[i]-pref[i-1])//2\r\n if(d in d2 and (suff[i]-pref[i-1])%2==0):\r\n c=1\r\n break\r\n if(c==1):\r\n print(\"YES\")\r\n else:\r\n s=sum(l)\r\n if(s%2==0 and s//2 in d1):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "import sys\r\ndef ainput():\r\n return sys.stdin.readline()\r\nn=int(ainput())\r\nls=[0]+list(map(int,ainput().split()))\r\ns=sum(ls)/2\r\nif sum(ls)%2!=0:\r\n print('No')\r\n exit()\r\nres=0\r\nz={}\r\nz[0]=1\r\nfor i in range(1,n+1):\r\n res+=ls[i]\r\n z[ls[i]]=1\r\n if (res-s) in z:\r\n print('Yes')\r\n break\r\nelse:\r\n z.clear()\r\n z[0]=1\r\n res=0\r\n for i in range(n,0,-1):\r\n res+=ls[i]\r\n z[ls[i]] = 1\r\n if (res-s) in z:\r\n print('Yes')\r\n break\r\n else:\r\n print('No')", "#!/usr/bin/env python3\r\n\r\nimport sys\r\nfrom collections import Counter\r\n\r\nn = int(input())\r\na = [int(x) for x in input().split()]\r\n\r\ns = sum(a)\r\nc1 = Counter(a)\r\nc2 = Counter()\r\n\r\ncur = 0\r\nfor x in a:\r\n c1[x] -= 1\r\n c2[x] += 1\r\n cur += x\r\n\r\n s1 = cur\r\n s2 = s - s1\r\n if s1 == s2:\r\n print('YES')\r\n sys.exit()\r\n if (s2 - s1) % 2 == 1:\r\n continue\r\n if s2 > s1:\r\n if c1[(s2 - s1) // 2] > 0:\r\n print('YES')\r\n sys.exit()\r\n else:\r\n if c2[(s1 - s2) // 2] > 0:\r\n print('YES')\r\n sys.exit()\r\n\r\nprint('NO')\r\n", "from typing import List, Set, Dict, Tuple, Text, Optional, Callable, Any\nfrom collections import deque\nimport collections\nfrom types import GeneratorType\nimport itertools\nimport operator\nimport functools\nimport random\nimport copy\nimport heapq\nimport math\nimport sys\nimport os\nfrom atexit import register\nfrom io import BytesIO, IOBase\nimport __pypy__ # type: ignore\n\nEPS = 10**-12\n\n################\n# INPUT OUTPUT #\n################\n\n# From: https://github.com/cheran-senthil/PyRival/blob/master/templates/template_py3.py\n\nBUFSIZE = 8192\n\n\nclass FastIO(IOBase):\n newlines = 0\n\n def __init__(self, file):\n self._fd = file.fileno()\n self.buffer = BytesIO()\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\n self.write = self.buffer.write if self.writable else None\n\n def read(self):\n while True:\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\n if not b:\n break\n ptr = self.buffer.tell()\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\n self.newlines = 0\n return self.buffer.read()\n\n def readline(self):\n while self.newlines == 0:\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\n self.newlines = b.count(b\"\\n\") + (not b)\n ptr = self.buffer.tell()\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\n self.newlines -= 1\n return self.buffer.readline()\n\n def flush(self):\n if self.writable:\n os.write(self._fd, self.buffer.getvalue())\n self.buffer.truncate(0), self.buffer.seek(0)\n\n\nclass IOWrapper(IOBase):\n def __init__(self, file):\n self.buffer = FastIO(file)\n self.flush = self.buffer.flush\n self.writable = self.buffer.writable\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\n self.read = lambda: self.buffer.read().decode(\"ascii\")\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\n\n\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\n\n\nclass Input(object):\n def rawInput(self):\n return sys.stdin.readline().rstrip(\"\\r\\n\")\n\n def readInt(self):\n return int(self.rawInput())\n\n\nclass Output(object):\n def __init__(self):\n self.out = __pypy__.builders.StringBuilder()\n\n def write(self, text):\n # type: (str) -> None\n self.out.append(str(text))\n\n def writeLine(self, text):\n # type: (str) -> None\n self.write(str(text) + '\\n')\n\n def finalize(self):\n sys.stdout.write(self.out.build())\n sys.stdout.flush()\n\n\n###########\n# LIBRARY #\n###########\n\n\ndef bootstrap(f, stack=[]):\n # Deep Recursion helper.\n # From: https://github.com/cheran-senthil/PyRival/blob/c1972da95d102d95b9fea7c5c8e0474d61a54378/docs/bootstrap.rst\n # Usage:\n\n # @bootstrap\n # def recur(n):\n # if n == 0:\n # yield 1\n # yield (yield recur(n-1)) * n\n def wrappedfunc(*args, **kwargs):\n if stack:\n return f(*args, **kwargs)\n else:\n to = f(*args, **kwargs)\n while True:\n if type(to) is GeneratorType:\n stack.append(to)\n to = next(to)\n else:\n stack.pop()\n if not stack:\n break\n to = stack[-1].send(to)\n return to\n\n return wrappedfunc\n\n\nint_add = __pypy__.intop.int_add\nint_sub = __pypy__.intop.int_sub\nint_mul = __pypy__.intop.int_mul\n\n\ndef make_mod_mul(mod):\n fmod_inv = 1.0 / mod\n\n def mod_mul(a, b, c=0):\n res = int_sub(int_add(int_mul(a, b), c), int_mul(\n mod, int(fmod_inv * a * b + fmod_inv * c)))\n if res >= mod:\n return res - mod\n elif res < 0:\n return res + mod\n else:\n return res\n\n return mod_mul\n\n\nclass RangeSum:\n '''\n >>> x = RangeSum([1, 2, 3, 2, 1])\n >>> x.sum(1, 3)\n 7\n >>> x.sum(0, 4)\n 9\n >>> x.sum(2, 2)\n 3\n '''\n\n def __init__(self, data):\n # type: (List[Any]) -> None\n self._n = len(data)\n self._prefixsum = [0] * (self._n + 1)\n for i in range(self._n):\n self._prefixsum[i+1] = self._prefixsum[i] + data[i]\n\n def __len__(self):\n # type: () -> int\n return self._n\n\n def sum(self, start, stop):\n # type: (int, int) -> Any\n \"\"\"func of data[start, stop]\"\"\"\n if start > stop:\n return 0\n assert 0 <= start <= stop < self._n\n return self._prefixsum[stop+1] - self._prefixsum[start]\n\n def __repr__(self):\n return \"RangeSum({0})\".format(self._data)\n\n\n#########\n# LOGIC #\n#########\n\n\ndef solve(items):\n rr = RangeSum(items)\n has = set()\n n = len(items)\n for i in range(n+1):\n # insert here, can?\n sum_beg = rr.sum(0, i-1)\n sum_end = rr.sum(i, n-1)\n if sum_beg == sum_end:\n return 1\n delt = sum_beg - sum_end\n if delt % 2 == 0 and (delt // 2) in has:\n return 1\n if i < n:\n has.add(items[i])\n\n return 0\n\n\ndef main(inp: Input, out: Output) -> Any:\n inp.readInt()\n vals = list(map(int, inp.rawInput().split()))\n if solve(vals) or solve(list(reversed(vals))):\n out.writeLine('YES')\n else:\n out.writeLine('NO')\n\n\n###############\n# BOILERPLATE #\n###############\n\noutput_obj = Output()\nmain(Input(), output_obj)\noutput_obj.finalize()\n", "from collections import Counter\n\nn = int(input())\na = list(map(int, input().split(' ')))\ntotal = sum(a)\nif total % 2 == 1:\n print('NO')\nelse:\n target = total // 2\n left = 0\n to_add = Counter(a)\n to_del = Counter([])\n found = False\n for i in range(n):\n if left < target:\n need = target - left\n if need in to_add:\n found = True\n break\n if left == target:\n found = True\n break\n if left > target:\n extra = left - target\n if extra in to_del:\n found = True\n break\n to_add[a[i]] -= 1\n if to_add[a[i]] == 0:\n del to_add[a[i]]\n if not a[i] in to_del:\n to_del[a[i]] = 1\n else:\n to_del[a[i]] += 1\n left += a[i]\n print('YES' if found else 'NO')\n", "def read_ints():\n return list(map(int, input().split()))\n\n\nn = int(input())\n\na = [0] + read_ints()\n\ns = a.copy()\n\nfor i in range(1, n + 1):\n s[i] += s[i - 1]\n\ntotal = s[n]\n\nfound = False\nfor x in s:\n if x << 1 == total:\n found = True\n break\nelse:\n for i, x in enumerate(s[1:], 1):\n def search(lo, hi, target):\n while lo <= hi:\n m = lo + hi >> 1\n cur = s[m] << 1\n if cur == target:\n return True\n elif cur < target:\n lo = m + 1\n else:\n hi = m - 1\n return False\n\n\n if search(i, n, total + 2 * a[i]) or search(1, i - 1, total - 2 * a[i]):\n found = True\n\nprint(\"YES\" if found else 'NO')\n", "n = int(input())\r\nls = [0] + list(map(int, input().split()))\r\nres = 0\r\nfor i in range(1, n + 1):\r\n res += ls[i]\r\nif res % 2 == 1:\r\n print(\"NO\")\r\n exit()\r\na = [0]\r\nz = {}\r\nz[0] = 1\r\nans = 0\r\nfor i in range(1, n + 1):\r\n ans += ls[i]\r\n z[ls[i]] = 1\r\n if ans - res / 2 in z:\r\n print(\"YES\")\r\n exit()\r\nz.clear()\r\nz[0] = 1\r\nans = 0\r\nfor i in range(n, 0, -1):\r\n ans += ls[i]\r\n z[ls[i]] = 1\r\n if ans - res / 2 in z:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")", "import sys\r\nimport os\r\nfrom io import BytesIO, IOBase\r\n\r\n#########################\r\n# imgur.com/Pkt7iIf.png #\r\n#########################\r\n\r\n\r\n\r\ndef cel(a,b): return (a+b-1)//b # find ceil(a/b) exp=> ceil(2/3)=1\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) // gcd(a, b)\r\ndef prr(a, sep=' '): print(sep.join(map(str, a)))\r\ndef ddi(): return defaultdict(int)\r\ndef ddl(): return defaultdict(list)\r\ndef ddd(): return defaultdict(defaultdict(int))\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\nfrom collections import defaultdict \r\n# from collections import deque\r\n#from collections import OrderedDict\r\nfrom math import gcd,pi,inf\r\n#import time\r\n#import itertools\r\n#import timeit\r\n# import random\r\nfrom bisect import bisect_left as bl\r\n# from bisect import bisect_right as br\r\n#from bisect import insort_left as il\r\n#from bisect import insort_right as ir\r\nfrom heapq import *\r\n# from queue import PriorityQueue\r\n#mod=998244353\r\n#mod=10**9+7\r\n\r\n\r\ndef is_present(a,v):\r\n idx=bl(a,v)\r\n return idx<len(a) and a[idx]==v\r\n\r\ndef solve():\r\n n=ii()\r\n a=li()\r\n d=ddl()\r\n sorted_list=list(set(a))\r\n sorted_list.sort()\r\n a=[0]+a+[0]\r\n n=len(a)\r\n pref=[0 for i in range(n)]\r\n suff=[0 for i in range(n)]\r\n for i in range(n):\r\n pref[i]=(pref[i-1] if i else 0)+a[i]\r\n if a[i] not in d:\r\n d[a[i]].extend([i,-1])\r\n for i in range(n-1,-1,-1):\r\n suff[i]=(suff[i+1] if i<n-1 else 0)+a[i]\r\n if d[a[i]][1]==-1:\r\n d[a[i]][1]=i\r\n\r\n # print(d)\r\n for i in range(1,n):\r\n p_sum,s_sum=pref[i-1],suff[i]\r\n if p_sum==s_sum:\r\n print('YES')\r\n return\r\n to_find=[]\r\n if p_sum>s_sum:\r\n tmp=(p_sum-s_sum)\r\n if not tmp&1:\r\n to_find=[tmp//2]\r\n for v in to_find:\r\n if is_present(sorted_list,v):\r\n l,r=d[v]\r\n if l<=i-1:\r\n print('YES')\r\n return\r\n\r\n else:\r\n tmp=(s_sum-p_sum)\r\n if not tmp&1:\r\n to_find=[tmp//2]\r\n for v in to_find:\r\n if is_present(sorted_list,v):\r\n l,r=d[v]\r\n if r>=i:\r\n print('YES')\r\n return\r\n\r\n print('NO')\r\n return\r\n\r\n\r\n\r\nsolve()\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "import sys\r\ninput=sys.stdin.readline\r\nn=int(input())\r\na=list(map(int,input().split()))\r\ns=sum(a)\r\nif s%2:\r\n print(\"NO\")\r\n exit()\r\npre=0\r\nused=set()\r\nflag=False\r\nfor rep in range(2):\r\n for i in range(n):\r\n pre+=a[i]\r\n used.add(a[i])\r\n if pre-s//2 in used:\r\n flag=True\r\n a.reverse()\r\n used=set()\r\n pre=0\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import io,os\r\ninput=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\ndict1 = {}\r\ndict2 = {}\r\ns = sum(arr)\r\nfor i in range(n):\r\n if arr[i] not in dict2.keys():\r\n dict2[arr[i]] = 1\r\n else:\r\n dict2[arr[i]] += 1\r\nx = 0\r\nif s % 2 != 0:\r\n print(\"NO\")\r\nelse:\r\n ans = False\r\n for i in range(n):\r\n if arr[i] not in dict1.keys():\r\n dict1[arr[i]] = 1\r\n else:\r\n dict1[arr[i]] += 1\r\n x += arr[i]\r\n dict2[arr[i]] -= 1\r\n if x == s//2:\r\n ans = True\r\n break\r\n elif x < s//2:\r\n y = (s//2)-x\r\n if y in dict2.keys() and dict2[y] > 0:\r\n dict2[y] -= 1\r\n ans = True\r\n break\r\n else:\r\n y = x-(s//2)\r\n if y in dict1.keys() and dict1[y] > 0:\r\n dict1[y] -= 1\r\n ans = True\r\n break\r\n if ans:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "\ndef verifica(l, r, p):\n global vetor_aux\n while l <= r:\n meio = (l + r) >> 1\n if vetor_aux[meio] == p:\n return True\n if vetor_aux[meio] < p:\n l = meio + 1\n else:\n r = meio - 1\n return False\n\nif __name__ == '__main__':\n n = int(input())\n vetor = list(map(int, input().split()))\n vetor = [0] + vetor\n vetor_aux = [0] * len(vetor)\n\n for i in range(1, n+1):\n vetor_aux[i] = vetor_aux[i-1] + vetor[i]\n\n if vetor_aux[n] & 1:\n print(\"NO\")\n exit()\n\n\n for i in range(1, n+1):\n if verifica(i+1, n, vetor_aux[n]/2 + vetor[i]):\n print(\"YES\")\n exit()\n\n for i in reversed(range(n+1)):\n if verifica(1, i-1, vetor_aux[n]/2 - vetor[i]):\n print(\"YES\")\n exit()\n\n print(\"NO\")\n\t \t\t \t \t\t\t \t \t \t \t\t\t\t \t\t", "n = int(input())\nA = list(map(int,input().split()))\n\nd = dict()\nacc = 0\nfor i,j in enumerate(A):\n acc += j\n d[acc] = i\n\nif acc % 2 == 1:\n print(\"NO\")\n exit()\n\nfor i,j in enumerate(A):\n v = acc // 2 - j\n if v in d and d[v] < i:\n print(\"YES\")\n exit()\n v = acc / 2 + j\n if v in d and d[v] >= i:\n print(\"YES\")\n exit()\n\nprint(\"NO\")\n", "n=int(input())\r\nz=list(map(int,input().split()))\r\ns=sum(z);c=s\r\nif c%2 !=0:\r\n f=1\r\nelif z[0]==s/2 or z[-1] == s/2:\r\n f=0 \r\nelse:\r\n f=1\r\n for k in range(2):\r\n d=set()\r\n c=0\r\n for i in range(n):\r\n d.add(z[i])\r\n c+=z[i]\r\n if c-(s/2) in d :\r\n f=0\r\n break\r\n if f==0 :\r\n break \r\n \r\n z.reverse()\r\n\r\nprint(['YES',\"NO\"][f])\r\n", "def isPossible(v):\r\n if sum(v)%2 == 1:\r\n return False\r\n ls = 0\r\n ts = sum(v) // 2\r\n mp = {}\r\n for x in v:\r\n if not x in mp:\r\n mp[x] = 0\r\n mp[x] += 1\r\n\r\n for x in v:\r\n if (ts - ls) in mp and mp[ts - ls] > 0:\r\n return True\r\n ls += x\r\n mp[x] -= 1\r\n\r\n return False\r\n\r\nn = int(input())\r\nv = [int(x) for x in input().split()]\r\n\r\np = isPossible(v)\r\nv.reverse()\r\np2 = isPossible(v)\r\nif p or p2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\ndef f(a):\r\n st = set()\r\n s = sum(a)\r\n if s % 2 == 0:\r\n hs = s // 2\r\n sm = 0\r\n b = False\r\n for x in a:\r\n st.add(x)\r\n sm += x\r\n if sm >= hs:\r\n if sm - hs in st:\r\n print(\"YES\")\r\n exit(0)\r\n \r\nf(a)\r\nf(a[::-1])\r\n \r\nprint(\"NO\")", "'''\r\nhttps://codeforces.com/problemset/problem/808/D\r\n\r\n输入 n(≤1e5) 和长为 n 的数组 a(1≤a[i]≤1e9)。\r\n你可以选择一个 a[i]，将其移除并插入到 a 的任意位置。\r\n你能否在执行至多一次上述操作的限制下，将 a 划分成左右两部分，且这两部分的元素和相等？\r\n能则输出 YES，不能则输出 NO。\r\n输入\r\n3\r\n1 3 2\r\n输出 YES\r\n解释 把 3 移到末尾，得到 [1,2,3]，sum([1,2]) = sum([3]) = 3\r\n\r\n输入\r\n5\r\n1 2 3 4 5\r\n输出 NO\r\n\r\n输入\r\n5\r\n2 2 3 4 5\r\n输出 YES\r\n解释 把 4 往左移一位，得到 [2,2,4,3,5]，sum([2,2,4]) = sum([3,5]) = 8\r\n'''\r\n\r\n\r\ndef solve(a):\r\n pre = 0\r\n dic = set()\r\n for v in a:\r\n pre += v\r\n if pre == s - pre: return True\r\n if (2 * pre - s) & 1 == 0 and (2 * pre - s) // 2 in dic: return True\r\n dic.add(v)\r\n return False\r\n\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\ns = sum(a)\r\nif s & 1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\" if solve(a) or solve(a[::-1]) else \"NO\")\r\n", "n = int(input())\na = map(int, input().split(' '))\na = list(a)\n\nmp = {}\ndis = -sum(a)\na = list(map(lambda x: x * 2, a))\n\nfor x in a:\n if -x not in mp:\n mp[-x] = 0\n mp[-x] += 1\n \ntag = False\nif dis in mp:\n tag = True\n\nfor x in a:\n dis += x\n if x not in mp:\n mp[x] = 0\n mp[x] += 1\n mp[-x] -= 1\n if mp[-x] == 0:\n mp.pop(-x)\n if dis in mp:\n tag = True\n\nif tag:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n \t \t \t \t \t\t\t \t \t\t \t", "length = int(input())\nnumbers = list(map(int, input().split()))\n\ndef resolve(numbers, length):\n\ttotal = sum(numbers)\n\tif total % 2:\n\t\treturn False\n\t\n\thalf = total // 2\n\tnumber_current = 0\n\tdistinct = set()\n\tfor i in range(length):\n\t\tnumber_current += numbers[i]\n\t\tdistinct.add(numbers[i])\n\t\tif number_current == half:\n\t\t\treturn True\n\t\tif (number_current - half) in distinct:\n\t\t\treturn True\n\treturn False\n\nresult = resolve(numbers, length) or resolve(numbers[::-1], length)\n\t\nprint(\"YES\" if result else \"NO\")\n\t \t \t \t \t\t\t\t \t\t\t \t \t\t\t", "import collections\r\nimport os\r\nimport sys\r\nfrom collections import Counter\r\n# print(sys.hexversion)\r\n# if os.getenv('LOCALCFTEST'):\r\n# sys.stdin = open('cfinput.txt')\r\n# else:\r\n# input = sys.stdin.readline\r\nif sys.hexversion == 50924784:\r\n sys.stdin = open('cfinput.txt')\r\nelse:\r\n input = sys.stdin.readline\r\nMOD = 10 ** 9 + 7\r\n\r\n\r\ndef solve(n, a):\r\n s = sum(a)\r\n if s & 1 or n == 1:\r\n return print('NO')\r\n half = s // 2\r\n\r\n def judge(a):\r\n pre = set()\r\n p = 0\r\n for i in a:\r\n pre.add(i)\r\n p += i\r\n if p == half:\r\n return True\r\n elif p > half:\r\n if (p - half) in pre:\r\n return True\r\n return False\r\n\r\n print('YES' if judge(a) or judge(a[::-1]) else 'NO')\r\n\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n\r\n solve(n, a)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\ns1 = [0] * n\r\ns1[0] = a[0]\r\nfor i in range(1, n):\r\n s1[i] = s1[i - 1] + a[i]\r\n\r\ns2 = [0] * n\r\ns2[n - 1] = a[n - 1]\r\nfor i in range(n - 2, -1, -1):\r\n s2[i] = s2[i + 1] + a[i]\r\ns1 = [0] + s1\r\ns2 = s2 + [0]\r\n\r\nd = {}\r\nfor i in range(n):\r\n if a[i] not in d:\r\n d[a[i]] = 1\r\n else:\r\n d[a[i]] += 1\r\n\r\nt = {}\r\nfor i in range(n + 1):\r\n diff = s1[i] - s2[i]\r\n if diff == 0:\r\n print('YES')\r\n exit()\r\n elif diff < 0 and diff % 2 == 0:\r\n if abs(diff) // 2 in d:\r\n print('YES')\r\n exit()\r\n elif diff > 0 and diff % 2 == 0:\r\n if abs(diff) // 2 in t:\r\n print('YES')\r\n exit()\r\n\r\n if i < n:\r\n d[a[i]] -= 1\r\n if d[a[i]] == 0:\r\n del d[a[i]]\r\n if a[i] not in t:\r\n t[a[i]] = 1\r\n else:\r\n t[a[i]] += 1\r\nprint('NO')", "import sys\r\ninput = lambda: sys.stdin.buffer.readline().decode().strip()\r\nfrom math import inf, gcd, lcm, log, log2, floor, ceil, sqrt, isqrt\r\nfrom collections import defaultdict, deque, Counter\r\nfrom heapq import heappush, heappop, heapify\r\nfrom functools import lru_cache\r\nfrom itertools import permutations, accumulate, groupby\r\nfrom bisect import insort, bisect_left, bisect_right\r\nimport random\r\n\r\n#template taken from https://codeforces.com/contest/1703/submission/164030692 - Author mkawa2\r\nclass DefaultDict:\r\n def __init__(self, default=None):\r\n self.default = default\r\n self.x = random.randrange(1, 1 << 31)\r\n self.dd = defaultdict(default)\r\n def __repr__(self):\r\n return \"{\"+\", \".join(f\"{k ^ self.x}: {v}\" for k, v in self.dd.items())+\"}\"\r\n def __eq__(self, other):\r\n for k in set(self) | set(other):\r\n if self[k] != other[k]: return False\r\n return True\r\n def __or__(self, other):\r\n res = DefaultDict(self.default)\r\n for k, v in self.dd: res[k] = v\r\n for k, v in other.dd: res[k] = v\r\n return res\r\n def __len__(self):\r\n return len(self.dd)\r\n def __getitem__(self, item):\r\n return self.dd[item ^ self.x]\r\n def __setitem__(self, key, value):\r\n self.dd[key ^ self.x] = value\r\n def __delitem__(self, key):\r\n del self.dd[key ^ self.x]\r\n def __contains__(self, item):\r\n return item ^ self.x in self.dd\r\n def items(self):\r\n for k, v in self.dd.items(): yield (k ^ self.x, v)\r\n def keys(self):\r\n for k in self.dd: yield k ^ self.x\r\n def values(self):\r\n for v in self.dd.values(): yield v\r\n def __iter__(self):\r\n for k in self.dd: yield k ^ self.x\r\nclass CounterInt(DefaultDict):\r\n def __init__(self, aa=[]):\r\n super().__init__(int)\r\n for a in aa: self.dd[a ^ self.x] += 1\r\n def __add__(self, other):\r\n res = CounterInt()\r\n for k in set(self) | set(other):\r\n v = self[k]+other[k]\r\n if v > 0: res[k] = v\r\n return res\r\n def __sub__(self, other):\r\n res = CounterInt()\r\n for k in set(self) | set(other):\r\n v = self[k]-other[k]\r\n if v > 0: res[k] = v\r\n return res\r\n def __and__(self, other):\r\n res = CounterInt()\r\n for k in self:\r\n v = min(self[k], other[k])\r\n if v > 0: res[k] = v\r\n return res\r\n def __or__(self, other):\r\n res = CounterInt()\r\n for k in set(self) | set(other):\r\n v = max(self[k], other[k])\r\n if v > 0: res[k] = v\r\n return res\r\nclass Set:\r\n def __init__(self, aa=[]):\r\n self.x = random.randrange(1, 1 << 31)\r\n self.st = set()\r\n for a in aa: self.st.add(a ^ self.x)\r\n def __repr__(self):\r\n return \"{\"+\", \".join(str(k ^ self.x) for k in self.st)+\"}\"\r\n def __len__(self):\r\n return len(self.st)\r\n def add(self, item):\r\n self.st.add(item ^ self.x)\r\n def discard(self, item):\r\n self.st.discard(item ^ self.x)\r\n def __contains__(self, item):\r\n return item ^ self.x in self.st\r\n def __iter__(self):\r\n for k in self.st: yield k ^ self.x\r\n def pop(self):\r\n return self.st.pop() ^ self.x\r\n def __or__(self, other):\r\n res = Set(self)\r\n for a in other: res.add(a)\r\n return res\r\n def __and__(self, other):\r\n res = Set()\r\n for a in self:\r\n if a in other: res.add(a)\r\n for a in other:\r\n if a in self: res.add(a)\r\n return res\r\n\r\n \r\n#https://leetcode.com/problems/create-sorted-array-through-instructions/discuss/1245397/C%2B%2BJavaPython-Binary-Indexed-Tree-Feel-free-to-reuse \r\nclass BIT:\r\n def __init__(self, size):\r\n self.bit = [0] * (size + 1)\r\n\r\n def getSum(self, idx): # Get sum in range [0..idx], 1-based indexing\r\n s = 0\r\n while idx > 0:\r\n s += self.bit[idx]\r\n idx -= idx & (-idx)\r\n return s\r\n\r\n def getSumRange(self, left, right): # left, right inclusive, 1-based indexing\r\n return self.getSum(right) - self.getSum(left - 1)\r\n\r\n def addValue(self, idx, val): # 1-based indexing\r\n while idx < len(self.bit):\r\n self.bit[idx] += val\r\n idx += idx & (-idx)\r\n \r\nclass TrieNode:\r\n def __init__(self):\r\n self.children = defaultdict(TrieNode)\r\n self.word = None\r\n\r\n def addWord(self, word):\r\n cur = self\r\n for c in word:\r\n cur = cur.children[c]\r\n cur.word = \"*\"\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 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\nclass LazySegmentTree:\r\n def __init__(self, data, default=0, func=max):\r\n \"\"\"initialize the lazy segment tree with data\"\"\"\r\n self._default = default\r\n self._func = func\r\n\r\n self._len = len(data)\r\n self._size = _size = 1 << (self._len - 1).bit_length()\r\n self._lazy = [0] * (4 * _size)\r\n\r\n self.data = [default] * (4 * _size)\r\n self.data[_size:_size + self._len] = data\r\n for i in reversed(range(_size)):\r\n self.data[i] = func(self.data[i + i], self.data[i + i + 1])\r\n\r\n def __len__(self):\r\n return self._len\r\n\r\n def _push(self, idx):\r\n \"\"\"push query on idx to its children\"\"\"\r\n # Let the children know of the queries\r\n q, self._lazy[idx] = self._lazy[idx], 0\r\n\r\n self._lazy[2 * idx] += q\r\n self._lazy[2 * idx + 1] += q\r\n self.data[2 * idx] += q\r\n self.data[2 * idx + 1] += q\r\n\r\n def _update(self, idx):\r\n \"\"\"updates the node idx to know of all queries applied to it via its ancestors\"\"\"\r\n for i in reversed(range(1, idx.bit_length())):\r\n self._push(idx >> i)\r\n\r\n def _build(self, idx):\r\n \"\"\"make the changes to idx be known to its ancestors\"\"\"\r\n idx >>= 1\r\n while idx:\r\n self.data[idx] = self._func(self.data[2 * idx], self.data[2 * idx + 1]) + self._lazy[idx]\r\n idx >>= 1\r\n\r\n def add(self, start, stop, value):\r\n \"\"\"lazily add value to [start, stop)\"\"\"\r\n start = start_copy = start + self._size\r\n stop = stop_copy = stop + self._size\r\n while start < stop:\r\n if start & 1:\r\n self._lazy[start] += value\r\n self.data[start] += value\r\n start += 1\r\n if stop & 1:\r\n stop -= 1\r\n self._lazy[stop] += value\r\n self.data[stop] += value\r\n start >>= 1\r\n stop >>= 1\r\n\r\n # Tell all nodes above of the updated area of the updates\r\n self._build(start_copy)\r\n self._build(stop_copy - 1)\r\n\r\n def query(self, start, stop, default=0):\r\n \"\"\"func of data[start, stop)\"\"\"\r\n start += self._size\r\n stop += self._size\r\n\r\n # Apply all the lazily stored queries\r\n self._update(start)\r\n self._update(stop - 1)\r\n\r\n res = default\r\n while start < stop:\r\n if start & 1:\r\n res = self._func(res, self.data[start])\r\n start += 1\r\n if stop & 1:\r\n stop -= 1\r\n res = self._func(res, self.data[stop])\r\n start >>= 1\r\n stop >>= 1\r\n return res\r\n\r\n def __repr__(self):\r\n return \"LazySegmentTree({0})\".format(self.data)\r\n \r\n#Author: beethoven97\r\ndef sieve(n):\r\n prim = [False] * (n + 1)\r\n ret = []\r\n for i in range(2, n + 1):\r\n if not prim[i]:\r\n ret.append(i)\r\n for j in range(i, n + 1, i):\r\n prim[j] = 1\r\n \r\n return ret\r\n\r\n# find smallest prime factor for all numbers <= n\r\nclass Prime:\r\n \r\n def __init__(self,n):\r\n self.n = n\r\n self.smallest_prime = [0]*(self.n+5)\r\n\r\n for i in range(2, self.n + 1):\r\n if not self.smallest_prime[i]:\r\n for j in range(i, self.n + 1, i):\r\n self.smallest_prime[j] = i\r\n \r\n def factorise(self,num):\r\n \r\n ans = []\r\n while self.smallest_prime[num] != 0:\r\n k = self.smallest_prime[num]\r\n ans.append(k)\r\n while num % k == 0:\r\n num //= k\r\n \r\n return ans\r\n \r\n\r\n# Function to find the value of\r\n# P * Q^-1 mod 998244353 (G4G)\r\ndef mod_inverse(p, q, mod):\r\n \r\n expo = 0\r\n expo = mod - 2\r\n \r\n # Loop to find the value\r\n # until the expo is not zero\r\n while (expo):\r\n \r\n # Multiply p with q\r\n # if expo is odd\r\n if (expo & 1):\r\n p = (p * q) % mod\r\n q = (q * q) % mod\r\n \r\n # Reduce the value of\r\n # expo by 2\r\n expo >>= 1\r\n \r\n return p\r\n\r\n#PyRival\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 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#Author: huikang\r\ndef remove_consecutive_duplicates(lst):\r\n res = []\r\n for x in lst:\r\n if res and x == res[-1]:\r\n continue\r\n res.append(x)\r\n return res\r\n\r\n#nmax = 2000000\r\n#fact = [1] * (nmax+1)\r\n#for i in range(2, nmax+1):\r\n# fact[i] = fact[i-1] * i % MOD\r\n# \r\n#inv = [1] * (nmax+1)\r\n#inv[-1] = pow(fact[-1], MOD-2, MOD)\r\n#for i in range(nmax-1, 0, -1):\r\n# inv[i] = inv[i+1] * (i+1) % MOD\r\n \r\n \r\n#def C(n, m):\r\n# return fact[n] * inv[m] % MOD * inv[n-m] % MOD if 0 <= m <= n else 0\r\n\r\ndef sumtoN(n):\r\n return ((n)*(n+1)) // 2\r\n\r\ndef powerOf2(n):\r\n return n > 0 and n & (n-1) == 0\r\n\r\ndef ceiling(x, y):\r\n return (x+y-1) // y\r\n\r\ndef query(a,b):\r\n print(\"? {} {}\".format(a,b), flush=True)\r\n response = int(input())\r\n return response\r\n \r\ndef alert(num):\r\n print(\"! {}\".format(num), flush=True)\r\n\r\n# d4 = [(0, 1), (-1, 0), (0, -1), (1, 0)]\r\n# d8 = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]\r\n\r\n'''\r\nKey formulas:\r\n1 XOR n = n-1 when n is odd\r\n1 XOR n = n+1 when n is even\r\na|b = a + b - a & b\r\nXOR and AND is commutative\r\nWhen gcd appears also consider lcm\r\nlowest_ind = graph.index(min(graph, key = len)) #doesnt give the index with minimum length\r\nceiling more feasible to take (val+1)//2 instead of ceil(val/2)\r\n'''\r\n\r\ndef read_int(): return(int(input()))\r\ndef read_ints(): return(map(int,input().split()))\r\ndef read_list(): return(list(map(int,input().split())))\r\ndef read_matrix(m,n):\r\n ans = []\r\n for _ in range(m):\r\n ans.append(read_list())\r\n return ans\r\n\r\ndef read_graph(nodes, edges):\r\n graph = [[] for _ in range(n+1)]\r\n for _ in range(edges):\r\n u,v = read_ints()\r\n graph[u].append(v)\r\n graph[v].append(u)\r\n return graph\r\n\r\n#for Counter on integers use CounterInt, else use Counter\r\ndef solve(n,arr):\r\n \r\n SUM = sum(arr)\r\n \r\n if SUM % 2 == 1:\r\n return False\r\n \r\n correct = SUM // 2\r\n #print(correct)\r\n \r\n #1 distinct segment that sum to correct\r\n seen1 = Set()\r\n seen1.add(0)\r\n pre = 0\r\n for x in arr:\r\n pre += x\r\n if pre == correct or pre - arr[0] == correct:\r\n return True\r\n \r\n suf = 0\r\n for x in arr[::-1]:\r\n suf += x\r\n if suf == correct or suf - arr[-1] == correct:\r\n return True\r\n \r\n #2 distinct segment that sum to correct\r\n \r\n #gap 1\r\n suffix_sums = ([0] + list(accumulate(arr[::-1])))[::-1]\r\n prefix_sums = [0] + list(accumulate(arr))\r\n suffix_sums_set = Set(suffix_sums)\r\n prefix_sums_set = Set(prefix_sums)\r\n #print(prefix_sums)\r\n #print(suffix_sums)\r\n \r\n suffix_sums_set.discard(SUM)\r\n prefix_sums_set.discard(SUM)\r\n #suffix\r\n\r\n for i in range(n-1):\r\n suffix_sums_set.discard(suffix_sums[i+1])\r\n #can it use this element\r\n if correct-arr[i+1] in suffix_sums_set:\r\n return True\r\n \r\n #prefix\r\n \r\n for i in range(n-1,0,-1):\r\n prefix_sums_set.discard(prefix_sums[i])\r\n #can it use this element\r\n if correct-arr[i-1] in prefix_sums_set:\r\n return True\r\n \r\n\r\n \r\nn = read_int()\r\n#n,k = read_ints()\r\n#arr = input()\r\narr = read_list()\r\n#print(ans)\r\nif solve(n,arr):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "from collections import Counter\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nacc = 0\r\ntotal = sum(a)\r\nif total % 2 == 1:\r\n print('NO')\r\n exit()\r\nhalf = total // 2\r\n\r\ncnt_left = Counter({0: 1})\r\ncnt_right = Counter({0: 1})\r\n\r\nacc_r = 0\r\nfor i in range(n-1, -1, -1):\r\n acc_r += a[i]\r\n cnt_right[acc_r] += 1\r\n\r\nacc_l = 0\r\nfor i in range(n):\r\n cnt_right[acc_r] -= 1\r\n acc_r -= a[i]\r\n\r\n if cnt_right[half-a[i]] or cnt_left[half-a[i]]:\r\n print('YES')\r\n exit()\r\n\r\n acc_l += a[i]\r\n cnt_left[acc_l] += 1\r\n\r\nprint('NO')\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\ne = set([0])\r\np = 0\r\ns = sum(a)\r\nif s % 2:\r\n st = False\r\nelse:\r\n st = True\r\nif st:\r\n st = False\r\n for j in range(2):\r\n for i in a:\r\n p += i\r\n e.add(i)\r\n if p - s // 2 in e:\r\n st = True\r\n break\r\n e = set([0])\r\n p = 0\r\n a.reverse()\r\nprint('YES' if st else 'NO')\r\n", "import collections as cc\nn=int(input())\nl=list(map(int,input().split()))\n\ndef ss(l,d):\n f=cc.defaultdict(int)\n\n d=sum(l)//2 \n t=0\n for i in range(n):\n t+=l[i]\n f[l[i]]+=1\n if t==d:\n return 1\n elif t>d and t-d in f:\n return 1\n return 0\n \n \n\nif sum(l)%2 or n==1:\n print(\"NO\")\nelif ss(l,sum(l)//2) or ss(l[::-1],sum(l)//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", "import sys,math\r\nTests=1\r\nfor _ in range(Tests):\r\n n=int(input())\r\n a=list(map(int,sys.stdin.readline().split()))\r\n if(sum(a)%2==0):\r\n req=sum(a)//2 \r\n half1=set()\r\n flag=True\r\n sum1=0\r\n for i in range(n):\r\n sum1+=a[i]\r\n half1.add(a[i])\r\n if sum1==req or (sum1-req in half1):\r\n print(\"YES\")\r\n flag=False\r\n break \r\n if flag:\r\n #reversing the array\r\n a=a[::-1]\r\n req=sum(a)//2 \r\n half1=set()\r\n flag=True\r\n sum1=0\r\n for i in range(n):\r\n sum1+=a[i]\r\n half1.add(a[i])\r\n if sum1==req or (sum1-req in half1):\r\n print(\"YES\")\r\n flag=False\r\n break \r\n if flag:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\n ", "from collections import Counter\r\n\r\n\r\ndef good(a):\r\n total = sum(a)\r\n if total % 2 == 1:\r\n return False\r\n pref = Counter()\r\n suff = Counter(a)\r\n s = 0\r\n for e in a:\r\n s += e\r\n pref[e] += 1\r\n suff[e] -= 1\r\n if 2 * s == total:\r\n return True\r\n elif 2 * s > total:\r\n if pref[(2 * s - total) // 2] > 0:\r\n return True\r\n else:\r\n if suff[(total - 2 * s) // 2] > 0:\r\n return True\r\n return False\r\n\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nprint(\"YES\" if good(a) else \"NO\")\r\n", "# LUOGU_RID: 120801191\nn = int(input())\na = list(map(int, input().split()))\nb = [0] * (n + 1)\nc = {}\nd = {}\nsum_total = 0\n\nfor i in range(1, n + 1):\n sum_total += a[i - 1]\n b[i] = b[i - 1] + a[i - 1]\n d[a[i - 1]] = d.get(a[i - 1], 0) + 1\n\nif sum_total % 2 != 0:\n print(\"NO\")\n exit()\n\nsum_total //= 2\nc[0] = 1\n\nfor i in range(1, n + 1):\n c[a[i - 1]] = c.get(a[i - 1], 0) + 1\n d[a[i - 1]] -= 1\n\n if d[a[i - 1]] == 0:\n del d[a[i - 1]]\n\n if b[i] >= sum_total:\n if c.get(b[i] - sum_total, 0) > 0:\n print(\"YES\")\n exit()\n else:\n if d.get(sum_total - b[i], 0) > 0:\n print(\"YES\")\n exit()\n\nprint(\"NO\")\n", "from bisect import bisect\r\nfrom sys import stdin, stdout\r\ninput = stdin.readline\r\nprint = stdout.write\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nsu = sum(a)\r\nif su % 2 == 0:\r\n\tsu //= 2\r\n\tch = False\r\n\tfor _ in range(2):\r\n\t\tif ch: break\r\n\t\tfind = set()\r\n\t\tt = 0\r\n\t\tfor i in a:\r\n\t\t\tt += i\r\n\t\t\tfind.add(i)\r\n\t\t\tif t - su in find:\r\n\t\t\t\tch = True\r\n\t\t\t\tprint('YES')\r\n\t\t\t\tbreak\r\n\t\ta.reverse()\r\n\tif not ch: print('NO')\r\nelse:\r\n\tprint('NO')", "from sys import stdin\r\nfrom collections import defaultdict as dd\r\n\r\nn = int(stdin.readline())\r\na = list(map(int, stdin.readline().split()))\r\ntot = sum(a)\r\ncurs = 0\r\nencntrd = dd(lambda: 0)\r\nflg = False\r\nif tot%2 == 0:\r\n tot //= 2\r\n for i in range(n):\r\n curs += a[i]\r\n encntrd[a[i]] = 1\r\n if encntrd[curs-tot] or curs == tot: flg = True\r\n curs = 0\r\n encntrd = dd(lambda: 0)\r\n for i in range(n-1, -1, -1):\r\n curs += a[i]\r\n encntrd[a[i]] = 1\r\n if encntrd[curs - tot] or curs == tot: flg = True\r\nif flg: print(\"YES\")\r\nelse: print(\"NO\")", "def process(A):\r\n S = sum(A)\r\n d1 = {}\r\n for x in A:\r\n if x not in d1:\r\n d1[x] = 0\r\n d1[x]+=1\r\n if S % 2==1:\r\n return 'NO'\r\n S1 = 0\r\n d2 = set([])\r\n for x in A:\r\n S1+=x\r\n d1[x]-=1\r\n d2.add(x)\r\n y = S1-S//2\r\n if y==0:\r\n return 'YES'\r\n if y in d2:\r\n return 'YES'\r\n y2 = S//2-S1\r\n if y2 in d1 and d1[y2] > 0:\r\n return 'YES'\r\n return 'NO'\r\n \r\nn = int(input())\r\nA = [int(x) for x in input().split()]\r\nprint(process(A))", "from sys import stdin\r\ninput=lambda :stdin.readline()[:-1]\r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nsm=sum(a)\r\nif sm%2==1:\r\n print('NO')\r\n exit()\r\ns=sm//2\r\nfrom collections import defaultdict\r\nd1=defaultdict(int)\r\nd2=defaultdict(int)\r\nfor i in a:\r\n d1[i]+=1\r\n\r\nans='NO'\r\ntmp=0\r\nfor i in a:\r\n d1[i]-=1\r\n d2[i]+=1\r\n tmp+=i\r\n if tmp==s:\r\n ans='YES'\r\n if s-tmp>0 and d1[s-tmp]>0:\r\n ans='YES'\r\n if tmp-s>0 and d2[tmp-s]>0:\r\n ans='YES'\r\n\r\nprint(ans)", "n = int(input())\narr = list(map(int, input().split(' ')))\n\nhalf_sum = sum(arr) / 2\n\nprev_els = set()\nprev_els.add(0)\npref = 0\nfor ind in range(n):\n pref += arr[ind]\n prev_els.add(arr[ind])\n\n if pref > half_sum:\n if pref - half_sum in prev_els:\n print(\"YES\")\n exit()\n\nprev_els = set()\nprev_els.add(0)\npref = 0\nfor ind in range(n - 1, -1, -1):\n pref += arr[ind]\n prev_els.add(arr[ind])\n\n if pref > half_sum:\n if pref - half_sum in prev_els:\n print(\"YES\")\n exit()\n\nprint(\"NO\")\n\t \t \t\t \t \t\t\t \t \t\t \t\t \t\t\t\t", "from itertools import accumulate\r\nif __name__=='__main__':\r\n n=int(input())\r\n nums=list(map(int,input().split()))\r\n total=sum(nums)\r\n if total & 1:\r\n print('NO')\r\n quit()\r\n s=0\r\n presum={v:i for i,v in enumerate(accumulate(nums))}\r\n for i,n in enumerate(nums):\r\n \r\n l=total//2-n\r\n r=total//2+n\r\n if (l in presum and presum[l]<i) or (r in presum and presum[r]>=i):\r\n print('YES')\r\n quit()\r\n \r\n print('NO')", "def possible(a):\r\n\tif len(a)==1:\r\n\t\treturn False\r\n\tif len(a)==2:\r\n\t\treturn a[0]==a[1]\r\n\r\n\ttotal = sum(a)\r\n\r\n\tvals = set([a[0]])\r\n\trunning = a[0]\r\n\tfor el in a[1:]:\r\n\t\trunning += el\r\n\t\tvals.add(el)\r\n\t\tif running == total-running:\r\n\t\t\treturn True\r\n\t\tif (running - (total-running))%2==0 and (running - (total-running))//2 in vals:\r\n\t\t\treturn True\r\n\treturn False\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\n\r\nif possible(a) or possible(a[::-1]):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "from collections import defaultdict\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\ns = sum(a)\r\nif s & 1:\r\n print('NO')\r\n exit(0)\r\nelse:\r\n s >>= 1\r\nnow = 0\r\nL, R = defaultdict(int), defaultdict(int)\r\nfor i in a:\r\n L[i] += 1\r\nL[0] = 1\r\nR[0] = 1\r\nfor i in a:\r\n if L[s - now] or R[now - s]:\r\n print('YES')\r\n exit(0)\r\n L[i] -= 1\r\n R[i] += 1\r\n now += i\r\nprint('NO')", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\ntot=sum(l)\r\nif tot&1:\r\n print('NO')\r\n exit()\r\n#dont remove \r\nsm=0 \r\nmid=tot//2 \r\nfor i in l:\r\n sm+=i \r\n if sm==tot-sm:\r\n print(\"YES\")\r\n exit()\r\n#simulaate pref \r\nfrom collections import defaultdict \r\ndef check(l):\r\n d=defaultdict(int)\r\n sm=0 \r\n for i in range(n-1):\r\n d[l[i]]+=1 \r\n sm+=l[i]\r\n add=l[i+1]\r\n curr=sm+add \r\n rem=tot-curr\r\n #print(curr,rem)\r\n if d[mid-rem]:\r\n print('YES')\r\n exit()\r\n #d[l[i]]+=1 \r\nif check(l):\r\n pass \r\nl=l[::-1]\r\nif check(l):\r\n pass \r\nprint(\"NO\")\r\n ", "def divider(a):\r\n t = sum(a)\r\n d = []\r\n d.append(-t)\r\n for i in range(len(a)):\r\n t -= 2 * a[i]\r\n d.append(-t)\r\n if t == 0:\r\n return (\"YES\")\r\n for i in range(len(a)):\r\n s = 2 * a[i]\r\n j = binary(d, s)\r\n if j > i and j != -1:\r\n return (\"YES\")\r\n j = binary(d, -s)\r\n if i >= j and j != -1:\r\n return (\"YES\")\r\n return (\"NO\")\r\n\r\n\r\ndef binary(a, value):\r\n hi = len(a)\r\n lo = -1\r\n while (lo + 1 < hi):\r\n mi = (lo + hi) // 2\r\n if a[mi] == value:\r\n return mi\r\n if a[mi] < value:\r\n lo = mi\r\n else:\r\n hi = mi\r\n return -1\r\n\r\n\r\nif __name__ == '__main__':\r\n n = input()\r\n a = [int(i) for i in input().split()]\r\n print(divider(a))\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\ntotal = sum(arr)\r\nif (total&1) == 1 :\r\n print(\"NO\")\r\n exit(0)\r\n\r\ndef solve(arr) :\r\n st = set()\r\n s = 0\r\n for i in arr :\r\n st.add(i)\r\n s += i\r\n if (s >= total//2) :\r\n if (s-total//2) in st :\r\n print(\"YES\")\r\n exit(0)\r\n\r\nsolve(arr)\r\nsolve(arr[::-1])\r\nprint(\"NO\")", "def check(w):\r\n n = len(w)\r\n ps = [0] * (n + 1)\r\n for i, c in enumerate(w):\r\n ps[i + 1] = ps[i] + c \r\n \r\n if ps[n] % 2 == 1:\r\n return False \r\n tar = ps[n] // 2 \r\n seen = set()\r\n seen.add(0)\r\n for i in range(1, n + 1):\r\n seen.add(w[i - 1])\r\n if ps[i] - tar in seen:\r\n return True \r\n return False \r\n\r\ndef main():\r\n test = 1\r\n \r\n for _ in range(test):\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n \r\n if check(a) or check(a[::-1]):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n return \r\n\r\nmain()\r\n \r\n \r\n \r\n " ]

[ "n=int(input())\r\nal=[[] for j in range(n)]\r\nfor i in range(n-1):\r\n a,b,c=map(int,input().split())\r\n al[a].append([b,c])\r\n al[b].append([a,c])\r\n\r\nmc=0\r\nva=[0]*(n)\r\nca=[0]*(n)\r\ndef dfs(n,c):\r\n va[n]=1\r\n #print(c)\r\n ca[n]=ca[n]+c\r\n\r\n for e in al[n]:\r\n #print(e)\r\n p=e[0]\r\n q=e[1]+ca[n]\r\n if(va[p]==0):\r\n dfs(p,q)\r\n \r\n \r\ndfs(0,0)\r\nprint(max(ca))\r\n\r\n'''\r\nmc = 0\r\ncost = 0\r\nvisited = [False] * n\r\ndef DFS(num,visited,cost):\r\n global mc\r\n if cost > mc:\r\n mc = cost\r\n visited[num] = True\r\n for i in range(len(li[num])):\r\n if not visited[li[num][i][0]]:\r\n DFS(li[num][i][0],visited,cost+li[num][i][1])\r\nDFS(0,visited,0)\r\nprint(mc)'''\r\n", "from sys import stdin, stdout\r\n\r\n\r\ndef dfs(node):\r\n notVisited[node] = False\r\n cur = 0\r\n for i, j in enumerate(adj[node]):\r\n if notVisited[j[0]]:\r\n cur = max(cur, j[1]+ dfs(j[0]))\r\n return cur\r\n\r\nN = int(stdin.readline().strip())\r\nadj = [[] for __ in range(N)]\r\nnotVisited = [True]*N\r\n\r\nfor __ in range(N-1):\r\n u, v, c = map(int, stdin.readline().strip().split())\r\n adj[u].append((v, c))\r\n adj[v].append((u, c))\r\nstdout.write(f'{dfs(0)}')\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "def bfs(G, s):\r\n from queue import Queue\r\n n = len(G)\r\n Q = Queue()\r\n visited = [False] * n\r\n d = [0] * n\r\n\r\n d[s] = 0\r\n visited[s] = True\r\n\r\n Q.put(s)\r\n while not Q.empty():\r\n u = Q.get()\r\n for v, weight in G[u]:\r\n if not visited[v]:\r\n visited[v] = True\r\n d[v] = d[u] + weight\r\n Q.put(v)\r\n print(max(d))\r\n\r\n\r\nn = int(input())\r\nG = [[] for _ in range(n + 1)]\r\nfor _ in range(n - 1):\r\n u, v, c = map(int, input().split())\r\n G[u].append((v, c))\r\n G[v].append((u, c))\r\nbfs(G, 0)\r\n", "N = int(input())\ndat = [[] for _ in range(N)]\n\nfor _ in range(N-1):\n\ta,b,c = map(int,input().split())\n\tdat[a].append([b,c])\n\tdat[b].append([a,c])\n\ndef dfs(i,num=0):\n\tglobal ans\n\tans = max(ans,num)\n\tvisited[i] = 1\n\tfor x,y in dat[i]:\n\t\tif visited[x]==1:continue\n\t\tdfs(x,num+y)\nvisited = [0]*N\nans = 0\ndfs(0)\nprint(ans)\n", "import sys,os,io\r\nimport math,bisect,operator\r\ninf,mod = float('inf'),10**9+7\r\n# sys.setrecursionlimit(10 ** 6)\r\nfrom itertools import groupby,accumulate\r\nfrom heapq import heapify,heappop,heappush\r\nfrom collections import deque,Counter,defaultdict\r\nI = lambda : int(sys.stdin.buffer.readline())\r\nNeo = lambda : list(map(int, sys.stdin.buffer.readline().split()))\r\nn = I()\r\nAns = 0\r\nG = defaultdict(list)\r\nC = defaultdict(int)\r\nfor i in range(n-1):\r\n a,b,c = Neo()\r\n G[a].append(b)\r\n G[b].append(a)\r\n C[(a,b)] = c\r\n C[(b,a)] = c\r\ndef hello(node,cost,vis):\r\n vis[node] = 1\r\n global Ans\r\n # print(vis,node)\r\n for i in G[node]:\r\n if not vis[i]:\r\n hello(i,cost+C[(node,i)],vis[:])\r\n else:\r\n Ans = max(Ans,cost)\r\nvis = [0]*(n)\r\nhello(0,0,vis)\r\nprint(Ans)\r\n\r\n\r\n", "import sys\r\nsys.setrecursionlimit(10 ** 5)\r\nn = int(input())\r\ngraph = [[] for i in range(n)]\r\nedge = {}\r\nfor i in range(n-1):\r\n\tu , v , p = list(map(int,input().split()))\r\n\tgraph[u].append(v)\r\n\tgraph[v].append(u)\r\n\tedge[(u , v)] = p\r\n\tedge[(v , u)] = p\r\nvis = [0 for i in range(n)]\r\nval = [0 for i in range(n)]\r\ndef dfs(u):\r\n\tvis[u] = 1\r\n\tfor i in graph[u]:\r\n\t\tif vis[i] == 0:\r\n\t\t\tval[i] = val[u] + edge[(u , i)]\r\n\t\t\tdfs(i)\r\ndfs(0)\r\nprint(max(val))", "def getmaxpath(g,v,par):\r\n maxp=0\r\n for u, c in g[v]:\r\n if u==par:\r\n continue\r\n maxp = max(maxp,c+getmaxpath(g,u,v))\r\n return maxp\r\nn = int(input())\r\ng = [[] for _ in range(n)]\r\nfor _ in range(n-1):\r\n u,v,c = (int(x) for x in input().split())\r\n g[u].append((v,c,))\r\n g[v].append((u,c,))\r\nprint(getmaxpath(g,0,-1))\r\n \r\n", "# from sortedcontainers import SortedSet\r\nfrom collections import OrderedDict\r\nfrom io import BytesIO, IOBase\r\nimport os\r\nimport threading\r\nimport collections\r\nfrom tkinter import E\r\nfrom types import GeneratorType\r\nfrom itertools import combinations, permutations\r\nfrom functools import lru_cache\r\nimport bisect\r\nimport sys\r\nfrom array import array\r\nimport heapq\r\nfrom collections import Counter\r\nimport math\r\nfrom collections import defaultdict\r\nfrom collections import deque\r\nfrom copy import deepcopy\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\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\n\r\n\r\n\r\nneighbourNodes = [[] for i in range(n)]\r\nfor i in range(n - 1):\r\n path, toPath, cost = map(int, input().split())\r\n neighbourNodes[path].append((toPath, cost))\r\n neighbourNodes[toPath].append((path, cost))\r\n\r\n\r\n\r\n@bootstrap\r\ndef dfs(currentNode, parentNode):\r\n \r\n currentMax = 0\r\n for node, cost in neighbourNodes[currentNode]:\r\n if node != parentNode:\r\n currentMax = max(currentMax, cost + (yield dfs(node, currentNode)))\r\n \r\n yield currentMax;\r\n\r\n\r\n\r\nprint(dfs(0, None)) ", "import sys\nimport string\nfrom heapq import *\nfrom bisect import *\n\nfrom collections import Counter, defaultdict\nfrom math import cos, fsum, sqrt, gcd, ceil, factorial\nfrom operator import *\nfrom itertools import accumulate\n\ninf = float(\"inf\")\n# input = sys.stdin.readline\nflush = lambda: sys.stdout.flush\ncomb = lambda x, y: (factorial(x) // factorial(y)) // factorial(x - y)\nen = lambda x: list(enumerate(x))\n\n\n# inputs\n# ip = lambda : input().rstrip()\nip = lambda: input()\nii = lambda: int(input())\nr = lambda: map(int, input().split())\nrr = lambda: list(r())\n\n\nans = 0\ntree = defaultdict(list)\ncost = defaultdict(lambda: 0)\nn = ii()\nfor _ in range(n - 1):\n a, b, c = r()\n tree[a] += (b,)\n tree[b] += (a,)\n cost[(a, b)] = c\n cost[(b, a)] = c\n\n\ndef dfs(i, par, val):\n global ans\n ans = max(ans, val)\n\n for j in tree[i]:\n if j != par:\n dfs(j, i, val + cost[(i, j)])\n\n\ndfs(0, -1, 0)\nprint(ans)", "def solve(u, graph, visited):\n visited[u] = True\n current = 0\n for v in graph[u]:\n if not visited[v]:\n current = max(current, solve(v, graph, visited) + graph[u][v])\n return current\n\nif __name__ == '__main__':\n N = int(input().strip())\n graph = {x: {} for x in range(N)}\n visited = [False for _ in range(N + 1)]\n for i in range(N - 1):\n u,v,c = map(int, input().strip().split(\" \"))\n graph[u][v] = c\n graph[v][u] = c\n ans = solve(0, graph, visited)\n print(ans)\n\n", "from collections import defaultdict\r\n\r\nn = int(input())\r\nvisited = [0 for i in range(n+1)]\r\ndef DFS(visited,graph,x):\r\n\r\n\tstack = [(x,0)]\r\n\tcount = 0\r\n\tmax1 = float(\"-inf\")\r\n\twhile len(stack):\r\n\r\n\t\tflag = 0\r\n\t\ttemp,count = stack.pop()\r\n\t\tvisited[temp] = 1\r\n\t\t# if temp not in graph:\r\n\t\t\t\r\n\t\tfor i in graph[temp]:\r\n\r\n\t\t\tif visited[i[0]] == 0:\r\n\t\t\t\tflag = 1\r\n\t\t\t\tstack.append((i[0],count+i[1]))\r\n\t\t\t\tvisited[i[0]] = 1\r\n\t\tif flag == 0:\r\n\t\t\tmax1 = max(max1,count)\r\n\treturn max1\r\ngraph = defaultdict(list)\r\nfor i in range(n-1):\r\n\r\n\tu,v,c = map(int,input().split())\r\n\tgraph[u].append((v,c))\r\n\tgraph[v].append((u,c))\r\nx = 0\r\n\r\nprint( DFS(visited,graph,x) )", "import sys\r\nimport io, os\r\ninput = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\n#arr=list(map(int, input().split()))\r\ndef main():\r\n n=int(input())\r\n graph = [[] for _ in range(n)]\r\n for i in range(n - 1):\r\n inf = list(map(int, input().split()))\r\n v1 = inf[0]\r\n v2 = inf[1]\r\n c=inf[2]\r\n graph[v1].append([v2,c])\r\n graph[v2].append([v1,c])\r\n curr = [0,0]\r\n stk = []\r\n nvis = [True] * n\r\n ans = 0\r\n lea=[False]*n\r\n for i in range(1,n):\r\n if len(graph[i])==1:\r\n lea[i]=True\r\n while(True):\r\n nxt = -1\r\n temp=len(graph[curr[0]])\r\n for i in range(temp-1,-1,-1):\r\n if (nvis[graph[curr[0]][i][0]]):\r\n nxt = graph[curr[0]][i]\r\n break\r\n else:\r\n graph[curr[0]].pop()\r\n if(nxt!= -1):\r\n stk.append([curr[0],curr[1]])\r\n nvis[curr[0]] = False\r\n curr = [nxt[0],curr[1]+nxt[1]]\r\n else:\r\n if(curr[0]==0):\r\n break\r\n if(lea[curr[0]]):\r\n lea[curr[0]]=curr[1]\r\n nvis[curr[0]] = False\r\n curr = stk[-1]\r\n stk.pop(-1)\r\n print(max(lea))\r\nif __name__ == '__main__':\r\n main()", "import sys\r\ninput = sys.stdin.readline\r\nR = lambda: map(int, input().split())\r\nn = int(input())\r\ntree = [list() for i in range(n)]\r\nfor i in range(n - 1):\r\n u, v, c = R()\r\n tree[u].append((v, c))\r\n tree[v].append((u, c))\r\nq = [(0, 0, 0)]\r\nres = 0\r\nwhile q:\r\n curr, prev, acc = q.pop()\r\n res = max(res, acc)\r\n for nb, edge in tree[curr]:\r\n if nb != prev:\r\n q.append((nb, curr, edge + acc))\r\nprint(res)", "n = int(input())\r\ndicts = {}\r\nfor i in range(n - 1):\r\n temparr = input()\r\n temparr = temparr.split()\r\n u = int(temparr[0])\r\n v = int(temparr[1])\r\n weight = int(temparr[2])\r\n\r\n if u not in dicts:\r\n dicts[u] = []\r\n dicts[u].append((v, weight))\r\n\r\n if v not in dicts:\r\n dicts[v] = []\r\n dicts[v].append((u, weight))\r\nmaxans = 0 \r\n\r\ndef dfs(cur, par = -1, sums = 0):\r\n global dicts\r\n global maxans\r\n for element in dicts[cur]:\r\n nextelement = element[0]\r\n nextweight = element[1]\r\n if par != nextelement:\r\n sums+=nextweight\r\n if maxans <= sums:\r\n maxans = sums \r\n dfs(nextelement , cur, sums)\r\n sums-=nextweight\r\ndfs(0,-1, 0)\r\nprint(maxans)\r\nprint()\r\n\r\n# void dfs(int cur , int par = -1)\r\n# {\r\n# // do what u want\r\n# for(auto x : g[cur])\r\n# {\r\n# if(x!=par)\r\n# {\r\n# dfs(x,cur);\r\n# }\r\n# }\r\n# }\r\n\r\n#print(dicts)\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\ng = [[] for _ in range(n)]\r\nfor _ in range(n - 1):\r\n x, y, z = map(int, input().split())\r\n g[x] += (y, z),\r\n g[y] += (x, z),\r\n \r\n \r\ndef go(x, f):\r\n ret = 0\r\n for y, z in g[x]:\r\n if y != f:\r\n ret = max(ret, z + go(y, x))\r\n return ret\r\n \r\n \r\nprint(go(0, -1))\r\n", "n=int(input())\n\na=[[] for i in range(n)]\n\nfor i in range(n-1):\n u,v,c=map(int,input().split())\n a[u].append([v,c])\n a[v].append([u,c])\n\n##print(a)\n \ndef dfs(i,br=0):\n global rj\n rj=max(br,rj)\n posjeceni[i]=1\n\n## print(posjeceni)\n for x,y in a[i]:\n## print(x,y)\n if posjeceni[x]!=1:\n dfs(x,br+y)\n return rj\nposjeceni=[0]*n\nrj=0\n\nprint(dfs(0))\n\n \t \t\t \t \t \t \t \t \t \t \t \t\t \t", "count=[]\r\n\r\ndef DFs(d,node,visited,c):\r\n visited.add(node)\r\n for i in d[node]:\r\n if i[0] not in visited:\r\n #c=c+i[1]\r\n DFs(d,i[0],visited,c+i[1])\r\n count.append(c)\r\n \r\n \r\ndef dfs(d,n):\r\n visited=set()\r\n \r\n for i in d.keys():\r\n if i not in visited:\r\n c=0\r\n DFs(d,i,visited,c)\r\n #count.append(a)\r\n\r\n\r\nn=int(input())\r\nd={}\r\nfor i in range(n):\r\n d[i]=[]\r\nfor i in range(n-1):\r\n u,v,c=map(int,input().split(' '))\r\n d[u].append([v,c])\r\n d[v].append([u,c])\r\n\r\ndfs(d,n)\r\nprint(max(count))", "import sys\r\nsys.setrecursionlimit(10**9)\r\nn=int(input())\r\nq={}\r\nl={}\r\nfor i in range(n):\r\n q[i]={}\r\n l[i]=0\r\nz={}\r\n\r\nfor i in range(n-1):\r\n a,b,c=map(int,input().split())\r\n q[a][b]=c\r\n q[b][a]=c\r\ndef f(i):\r\n z[i]=0\r\n for j in q[i]:\r\n if j not in z:\r\n l[j]=l[i]+q[i][j]\r\n f(j)\r\nf(0)\r\nprint(max(l.values()))", "import sys;readline = sys.stdin.readline\r\ndef i1(): return int(readline())\r\ndef nl(): return [int(s) for s in readline().split()]\r\ndef nn(n): return [int(readline()) for i in range(n)]\r\ndef nnp(n,x): return [int(readline())+x for i in range(n)]\r\ndef nmp(n,x): return (int(readline())+x for i in range(n))\r\ndef nlp(x): return [int(s)+x for s in readline().split()]\r\ndef nll(n): return [[int(s) for s in readline().split()] for i in range(n)]\r\ndef mll(n): return ([int(s) for s in readline().split()] for i in range(n))\r\ndef s1(): return readline().rstrip()\r\ndef sl(): return [s for s in readline().split()]\r\ndef sn(n): return [readline().rstrip() for i in range(n)]\r\ndef sm(n): return (readline().rstrip() for i in range(n))\r\ndef redir(s): global readline;import os;fn=sys.argv[0] + f'/../in-{s}.txt';readline = open(fn).readline if os.path.exists(fn) else readline\r\n\r\nredir('j')\r\nn = i1()\r\nnodes = [[] for i in range(n+1)]\r\ncosts = [[] for i in range(n+1)]\r\nseen = [False] * n\r\nfor i in range(n-1):\r\n u,v,c = [int(i) for i in readline().split()]\r\n nodes[u].append(v)\r\n nodes[v].append(u)\r\n costs[u].append(c)\r\n costs[v].append(c)\r\n# print(n, nodes, costs)\r\nstk = [[0,len(nodes[0])]]\r\nseen[0] = True\r\nccc = [0]*n\r\n# _ = 0\r\nwhile stk:\r\n top = stk[-1]\r\n r = top[0]\r\n idx = top[1] - 1\r\n ch = nodes[r]\r\n # _ += 1\r\n # print('-'*_, top, idx, ch)\r\n while idx >= 0 and seen[ch[idx]]:\r\n idx -= 1\r\n if idx < 0:\r\n stk.pop()\r\n continue\r\n top[-1] = idx\r\n # print(i, ch, ch[idx])\r\n c = ch[idx]\r\n stk.append([c, len(nodes[c])])\r\n seen[c] = True\r\n ccc[c] = ccc[r] + costs[r][idx]\r\nprint(max(ccc))\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nd = [[] for i in range(n)]\r\nfor i in range(n-1):\r\n a, b, c = map(int, input().split())\r\n d[a].append((b, c))\r\n d[b].append((a, c))\r\n\r\nx = 0\r\nq = [(0, -1, 0)]\r\n\r\nwhile q:\r\n a, b, c = q.pop()\r\n x = max(x, c)\r\n\r\n for i, j in d[a]:\r\n if i != b:\r\n q.append((i, a, c+j))\r\n\r\nprint(x)\r\n", "def run(relationships_map, path, sum_):\r\n new_sum = []\r\n for i in relationships_map[path[-1]]:\r\n if i not in path:\r\n new_sum.append(run(relationships_map, path + [i], relationships_map[path[-1]][i]) or 0)\r\n\r\n return sum_ + max(new_sum or [0])\r\n\r\n\r\nn = int(input())\r\n\r\nrelationships_map = {}\r\n\r\nfor _ in range(n - 1):\r\n u, v, c = map(int, input().split())\r\n\r\n data_dict = relationships_map.get(u, {})\r\n data_dict[v] = c\r\n relationships_map[u] = data_dict\r\n\r\n data_dict = relationships_map.get(v, {})\r\n data_dict[u] = c\r\n relationships_map[v] = data_dict\r\n\r\nprint(run(relationships_map, [0], 0))\r\n", "n=int(input())\r\nl1=[]\r\nfor i in range(n-1):\r\n l2=[int(a) for a in input().split()]\r\n l1.append(l2)\r\n l1.append([l2[1],l2[0],l2[2]])\r\nl1.sort()\r\nl2=[0]*(n+1)\r\nls=[[0]]\r\nctr=1\r\ncur=[]\r\nwhile ctr<n:\r\n for i in ls[-1]:\r\n for j in range(2*(n-1)):\r\n if l1[j][0]==i and l2[l1[j][1]]==0:\r\n l2[l1[j][1]]=l1[j][2]+l2[i]\r\n cur.append(l1[j][1])\r\n ls.append(cur)\r\n ctr+=len(cur)\r\n cur=[]\r\n if l2[0]==0:\r\n l2[0]=1\r\nprint(max(l2))", "def solve():\r\n n = int(input())\r\n a = [0] * n\r\n for i in range(n - 1):\r\n a[i] = list(map(int, input().split()))\r\n\r\n p = [-2] * n\r\n ct = [0] * n\r\n p[0] = -1\r\n for j in range(n - 1):\r\n for i in range(n - 1):\r\n u, v, c = a[i]\r\n if p[u] != -2 and p[v] == -2:\r\n p[v] = u\r\n ct[v] = c\r\n elif p[v] != -2 and p[u] == -2:\r\n p[u] = v\r\n ct[u] = c\r\n cnt = [0] * n\r\n lst = []\r\n for i in range(n):\r\n if p[i] != -1:\r\n cnt[p[i]] += 1\r\n for i in range(n):\r\n if cnt[i] == 0:\r\n lst.append(i)\r\n ans = 0\r\n for l in lst:\r\n cost = 0\r\n t = l\r\n while t != -1:\r\n cost += ct[t]\r\n t = p[t]\r\n if cost > ans:\r\n ans = cost\r\n print(ans)\r\n return\r\n\r\nsolve()", "# maa chudaaye duniya\r\nfrom collections import defaultdict\r\ngraph = defaultdict(list)\r\nn = int(input())\r\nweights = {}\r\nfor _ in range(n-1):\r\n\ta, b, w = map(int, input().split())\r\n\tedge1 = '{} : {}'.format(a, b)\r\n\tedge2 = '{} : {}'.format(b, a)\r\n\tgraph[a].append(b)\r\n\tgraph[b].append(a)\r\n\tweights[edge1] = w\r\n\tweights[edge2] = w\r\n\r\nmaxsf = [-10**9]\r\nvisited = [False for i in range(n+1)]\r\n\r\ndef dfs(node, parent, dist):\r\n\tvisited[node] = True\r\n\t# print(maxsf)\r\n\t# print('checking ', node, parent)\r\n\t# print(visited)\r\n\tif parent != -1:\r\n\t\te ='{} : {}'.format(parent, node)\r\n\t\te1 = '{} : {}'.format(node, parent)\r\n\t\tif e in weights:\r\n\t\t\tdist += weights[e]\r\n\t\t\t# print(e, dist)\r\n\t\telse:\r\n\t\t\tdist += weights[e1]\r\n\t\t\t# print(e1, dist)\r\n\t\tif dist > maxsf[0]:\r\n\t\t\tmaxsf[0] = dist\r\n\tfor children in graph[node]:\r\n\t\tif not visited[children]:\r\n\t\t\tdfs(children, node, dist)\r\n\t\r\ndfs(0, -1, 0)\r\nprint(*maxsf)", "n=int(input())\r\ng=[[] for i in range(n)]\r\nfor i in range(n-1):\r\n x,y,c=map(int,input().split())\r\n g[x].append((y,c))\r\n g[y].append((x,c))\r\n\r\nans=[]\r\nc=0\r\nboo=[0]*n\r\ndef dfs(u,c):\r\n ans.append(c)\r\n boo[u]=1\r\n for x,y in g[u]:\r\n if boo[x]==0:\r\n dfs(x,c+y)\r\ndfs(0,0)\r\nprint (max(ans))", "def helper(curr,g,visited):\r\n ans=0\r\n for i in g[curr]:\r\n if i[0] not in visited:\r\n visited.add(i[0])\r\n ans=max(ans,i[1]+helper(i[0],g,visited))\r\n visited.remove(i[0])\r\n return ans\r\nn=int(input())\r\ng=[[] for i in range(n)]\r\nfor i in range(n-1):\r\n a,b,c=[int(x) for x in input().split()]\r\n g[a].append([b,c])\r\n g[b].append([a,c])\r\nvisited=set()\r\nvisited.add(0)\r\nprint(helper(0,g,visited))", "\r\n#?\t\t /\\_/\\\r\n#?\t\t(= ._.)\r\n#?\t\t/ >WA \\>AC\r\n#// WELCOME TO MY CODING SPACE\r\n#! Filename: nhap.py\r\n#? Author: TranDucTri2003\r\n#* CreatedAt: 2022-05-02 23:33:34\r\n\r\nfrom collections import defaultdict\r\nfrom heapq import heappop, heappush\r\n\r\nclass Graph:\r\n INF=10**9\r\n #Searching Algorithms: DFS, BFS\r\n def __init__(self):\r\n self.graph = defaultdict(list)\r\n self.edges=defaultdict(lambda:defaultdict(lambda:0))\r\n self.distance=defaultdict(lambda:0)\r\n\r\n \r\n #DFS,BFS\r\n def addEdge(self,u,v,w):\r\n self.graph[u].append(v)\r\n self.graph[v].append(u)\r\n self.edges[u][v]=w\r\n self.edges[v][u]=w\r\n\r\n \r\n # 2. BFS from a vertex\r\n def BFS(self,vertex):\r\n visited = defaultdict(lambda:0)\r\n queue=[vertex]\r\n visited[vertex]=1\r\n while queue:\r\n u=queue.pop(0)\r\n for v in self.graph[u]:\r\n if visited[v]==0:\r\n self.distance[v]=self.distance[u]+self.edges[u][v]\r\n queue.append(v)\r\n visited[v]=1\r\n self.distance[0]=0\r\n return self.distance\r\n \r\nn=int(input())\r\ng=Graph()\r\n\r\nfor i in range(n-1):\r\n u,v,w=list(map(int,input().split()))\r\n g.addEdge(u,v,w)\r\n \r\npath=g.BFS(0)\r\nprint(max(path.values()))", "s = int(input())\nadj = [dict() for i in range(s)]\ndiscovered = [False] * s\n\nfor i in range(s - 1):\n u, v, c = map(int, input().strip().split())\n adj[u][v] = c\n adj[v][u] = c\n\ndef dfs(u, cur):\n c = cur\n for k in adj[u].keys():\n if discovered[k]:\n continue\n discovered[k] = True\n c = max(dfs(k, cur + adj[u][k]), c)\n discovered[k] = False\n return c\n\ndiscovered[0] = True\nc = dfs(0, 0)\nprint(c)\n \t \t\t\t\t \t\t \t\t\t\t\t \t\t \t\t", "\ndef solve():\n\tn = int(input())\n\tadj = [[]for i in range(n)]\n\tfor i in range(n-1):\n\t\ta,b,c = map(int,input().split())\n\t\tadj[a].append((b,c))\n\t\tadj[b].append((a,c))\n\tdef dfs(s,adj,visited):\n\t\tvisited[s] = True\n\t\tans = 0\n\t\tfor i,j in adj[s]:\n\t\t\tif not visited[i]:\n\t\t\t\tans = max(ans,dfs(i,adj,visited)+j)\n\t\treturn ans\n\tvisited = [False]*n\n\tans = dfs(0,adj,visited)\n\tprint(ans)\n\n\n\n\n\n\n\n\t\n\n\n\n\n# number of test cases\n#t = int(input())\nt = 1\nfor i in range(t):\n\tsolve()\n\n\n\n\n\n\n\n\n\n", "import sys\r\nimport string\r\nfrom heapq import *\r\nfrom bisect import *\r\n\r\nfrom collections import Counter, defaultdict\r\nfrom math import cos, fsum, sqrt, gcd, ceil, factorial\r\nfrom operator import *\r\nfrom itertools import accumulate\r\n\r\ninf = float(\"inf\")\r\n# input = sys.stdin.readline\r\nflush = lambda: sys.stdout.flush\r\ncomb = lambda x, y: (factorial(x) // factorial(y)) // factorial(x - y)\r\nen = lambda x: list(enumerate(x))\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\nans = 0\r\ntree = defaultdict(list)\r\ncost = defaultdict(lambda: 0)\r\nn = ii()\r\nfor _ in range(n - 1):\r\n a, b, c = r()\r\n tree[a] += (b,)\r\n tree[b] += (a,)\r\n cost[(a, b)] = c\r\n cost[(b, a)] = c\r\n\r\n\r\ndef dfs(i, par, val):\r\n global ans\r\n ans = max(ans, val)\r\n\r\n for j in tree[i]:\r\n if j != par:\r\n dfs(j, i, val + cost[(i, j)])\r\n\r\n\r\ndfs(0, -1, 0)\r\nprint(ans)", "n=int(input())\r\nd={}\r\ncost=[]\r\nfor i in range(n):\r\n cost.append(n*[0])\r\nfor i in range(n-1):\r\n u,v,c=map(int,input().split())\r\n if u not in d:\r\n d[u]=[]\r\n if v not in d:\r\n d[v]=[]\r\n d[u].append(v)\r\n d[v].append(u)\r\n cost[u][v]=c\r\n cost[v][u]=c\r\nkhoroch=n*[0]\r\nvisit=n*[0]\r\ndef dfs(d,s,parent):\r\n global ans\r\n visit[s]=1\r\n khoroch[s]=cost[parent][s]+khoroch[parent]\r\n #print(s,visit[s])\r\n ans=max(khoroch[s],ans)\r\n for x in d[s]:\r\n if(visit[x]==0):\r\n dfs(d,x,s)\r\nans=0\r\ndfs(d,0,0)\r\nprint(ans)\r\n \r\n\r\n", "n=int(input())\r\nl={}\r\nk={0}\r\nr={}\r\no=[]\r\ncc=set()\r\nfor i in range(n):\r\n cc.add(i)\r\nfor i in range(n-1):\r\n q,w,z=map(int,input().split())\r\n if q in k:\r\n r[w]=q\r\n k.add(w)\r\n cc.discard(q)\r\n l[(w,q)]=z\r\n elif w in k:\r\n r[q]=w\r\n k.add(q)\r\n cc.discard(w)\r\n l[(q,w)]=z\r\n else:\r\n o+=[[q,w,z]]\r\nfor i in o:\r\n q,w,z=i[0],i[1],i[2]\r\n if q in k:\r\n r[w]=q\r\n k.add(w)\r\n cc.discard(q)\r\n l[(w,q)]=z\r\n elif w in k:\r\n r[q]=w\r\n k.add(q)\r\n cc.discard(w)\r\n l[(q,w)]=z\r\ns=0\r\nfor i in cc:\r\n aa=0\r\n pp=-1\r\n while pp!=0:\r\n pp=r[i]\r\n aa+=l[(i,pp)]\r\n i=pp\r\n s=max(s,aa)\r\nprint(s)", "from collections import deque\nfrom collections import defaultdict\nimport sys\ninp = sys.stdin.readlines()\ng = defaultdict(list)\ndef add_edge(a, b, c):\n g[a].append([b, c])\n g[b].append([a, c])\n\nnum_lines = int(inp.pop(0).replace('\\n',''))\nfor line in inp:\n line = line.replace('\\n','')\n a = int(line.split()[0])\n b = int(line.split()[1])\n c = int(line.split()[2])\n add_edge(a, b, c)\n\ndistances = []\nvisited = []\n\ndef bfs(node):\n visited = []\n distances = [0 for i in range(num_lines+1)]\n queue = deque()\n queue.append(node)\n visited.append(node)\n\n while queue:\n current = queue.popleft()\n\n for pair in g[current]:\n i = pair[0]\n w = pair[1]\n if i not in visited:\n visited.append(i)\n distances[i] = distances[current] + w\n queue.append(i)\n print(max(distances))\n\n\n\nbfs(0)\n \t \t\t\t \t \t \t \t \t \t \t\t \t", "n = int(input())\r\ntree = [[] for _ in range(n+1)]\r\nfor _ in range(n-1):\r\n u, v, c = map(int, input().split())\r\n tree[u].append([v, c])\r\n tree[v].append([u, c])\r\n\r\n\r\ndef dfs(cur, fa):\r\n ans = 0\r\n for nc, val in tree[cur]:\r\n if nc == fa:\r\n continue\r\n ans = max(ans, val+dfs(nc, cur))\r\n return ans\r\n\r\n\r\nprint(dfs(0, -1))\r\n", "def find_heights(edges, node, par):\r\n ans = 0\r\n for ch, cost in edges.get(node, []):\r\n if ch!=par:\r\n ans = max(ans, cost + find_heights(edges, ch, node))\r\n return ans\r\n \r\ndef main():\r\n from collections import defaultdict\r\n # n, flower, bee = list(map(int, input().split()))\r\n n = list(map(int, input().split()))\r\n n = n[0]\r\n edges = defaultdict(list)\r\n for _ in range(n-1):\r\n x, y, cost = list(map(int, input().split()))\r\n edges[x].append((y, cost))\r\n edges[y].append((x, cost))\r\n # heights = []\r\n ans = find_heights(edges, node=0, par=-1)\r\n print(ans)\r\n # heights.sort()\r\n # print(sum(heights[:k]))\r\n\r\nif __name__==\"__main__\":\r\n import sys\r\n import threading\r\n sys.setrecursionlimit(10**6)\r\n threading.stack_size(10**8)\r\n t = threading.Thread(target=main)\r\n t.start()\r\n t.join() ", "# Time complexity: O(n)\n# Space complexity: O(n)\n# It iterates through every vertex and edge once O(n + n - 1)\nn = int(input())\nadj = [dict() for i in range(n)]\ndiscovered = [False] * n\n\nfor i in range(n - 1):\n u, v, c = map(int, input().strip().split())\n adj[u][v] = c\n adj[v][u] = c\n\ndef dfs(u, cur):\n c = cur\n for k in adj[u].keys():\n if discovered[k]:\n continue\n discovered[k] = True\n c = max(dfs(k, cur + adj[u][k]), c)\n discovered[k] = False\n return c\n\ndiscovered[0] = True\nc = dfs(0, 0)\nprint(c)\n\t\t \t\t\t \t \t \t \t \t \t \t\t", "n = int(input())\r\ndummy = [0] * n\r\nfriends = [dummy[:] for _ in range(n)]\r\nfor _ in range(n - 1):\r\n u, v, c = map(int, input().split())\r\n friends[u][v] = friends[v][u] = c\r\n\r\n\r\ndiscovered = set()\r\ndef discover(index: int) -> int:\r\n discovered.add(index)\r\n paths = [0] * n\r\n for friend, cost in enumerate(friends[index]):\r\n if friend not in discovered and cost > 0:\r\n paths[friend] = cost + discover(friend)\r\n\r\n return max(paths)\r\n\r\n\r\nprint(discover(0))\r\n", "# Author: S Mahesh Raju\r\n# Username: maheshraju2020\r\n# Created on: 25/09/2020 01:47:42\r\n\r\nfrom sys import stdin, stdout, setrecursionlimit\r\nimport heapq\r\nfrom math import gcd, ceil, sqrt\r\nfrom collections import Counter, deque\r\nfrom bisect import bisect_left, bisect_right\r\nfrom itertools import combinations, permutations\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\nsetrecursionlimit(100000)\r\nmod = 1000000007\r\n\r\ndef getAns(d):\r\n queue = [[0, 0]]\r\n seen = set()\r\n res = float(\"-inf\")\r\n while len(queue):\r\n cur, cost = queue.pop()\r\n if cur not in seen:\r\n seen.add(cur)\r\n res = max(res, cost)\r\n for a, b in d.get(cur, []):\r\n queue.append([a, b + cost])\r\n return res\r\n\r\n\r\nn = ii1()\r\nd = {}\r\nfor i in range(n - 1):\r\n a, b, cost = iia()\r\n d.setdefault(a, []).append([b, cost])\r\n d.setdefault(b, []).append([a, cost])\r\nprint(getAns(d))\r\n ", "n = int(input())\r\nli = [[] for i in range(0,n)]\r\nfor i in range(n-1):\r\n u, v, c = map(int,input().split())\r\n li[u].append((v,c))\r\n li[v].append((u,c))\r\n\r\nmc = 0\r\ncost = 0\r\nvisited = [False] * n\r\ndef DFS(num,visited,cost):\r\n global mc\r\n if cost > mc:\r\n mc = cost\r\n visited[num] = True\r\n for i in range(len(li[num])):\r\n if not visited[li[num][i][0]]:\r\n DFS(li[num][i][0],visited,cost+li[num][i][1])\r\nDFS(0,visited,0)\r\nprint(mc)", "n=int(input())\r\nd={}\r\nvisited=[0]*n\r\ndist={}\r\nfor _ in range(n-1):\r\n u,v,c=map(int,input().split())\r\n d.setdefault(u,[]).append(v)\r\n d.setdefault(v,[]).append(u)\r\n dist[(min(u,v),max(u,v))]=c\r\nstack=[[0,0]]\r\nans=-1\r\nwhile(stack!=[]):\r\n temp=stack.pop()\r\n node=temp[0]\r\n distance=temp[1]\r\n visited[node]=1\r\n for child in d[node]:\r\n if(visited[child]==0):\r\n stack.append([child,distance+dist[min(node,child),max(node,child)]])\r\n ans=max(ans,distance)\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", "\"\"\"\nSummary of My Code:\n- Block 1\n - It gets all the necessary input for this problem.\n - all the variable names are same as the one stated\n in the problem\n - I am using hashtable<hashtable> for graph, to reduce\n the time accessing the element, and reduce space\n complexity\n- Block 2\n - I am using the maximum_cost variable to track\n the maximum possible cost of all the dfs search\n - First part of dfs is updating maximum_cost to\n make sure it contains maximum possible cost\n so far\n - Second part is going through every connection of the\n current node. I am using previous_node to track where\n we came from. So that we won't get into a loop when\n searching. I can use previous_node to track because\n there are only n-1 connections\n\nRuntime Complexity:\n- Block 1\n - The time complexity would be O(2*(n-1)) => O(N)\n- Block 2\n - It is hard to say, but I would say in total it is\n O(No of Node + No of Edges) => O(N + N-1) => O(N)\n for dfs\n - It is just O(1) for starting and printing\n- In total\n - O(N) + O(N) + O(1) => O(N)\n\nSpace Complexity:\n- Block 1\n - O(No of edges + No of Nodes) for graph\n- Block 2\n - O(1) for any constants\n - O(Maximum height of tree) for dfs\n - O(1) for printing\n- In total\n - O(No of edges + No of Nodes) + O(1) + O(Maximum height)\n + O(1) => O(No of edges + No of Nodes + Maximum height)\n ~> O(N + N-1 + H) => O(N + H)\n\nWhy the Chosen algorithm are good:\n- It is good in this constraints as the time limit is 1 second\n and in usual computer, it can run up to 10^7 ~ 10^8 calculations\n per second.\n- The runtime complexity is O(N) and maximum of N is 100\n- 100 < 10^7 thus it is fine in this constraints\n\"\"\"\n\n# Block 1\nn = int(input())\ngraph = {i:{} for i in range(n)}\nfor _ in range(n-1):\n u,v,c = [int(i) for i in input().split()]\n graph[u][v] = c\n graph[v][u] = c\n\n# Block 2\nmaximum_cost = 0\ndef dfs(previous_node, current_node, total_cost_so_far):\n global maximum_cost\n if total_cost_so_far > maximum_cost:\n maximum_cost = total_cost_so_far\n\n for next_node in graph[current_node]:\n if next_node != previous_node:\n dfs(current_node, next_node, total_cost_so_far + graph[current_node][next_node])\n\ndfs(-1, 0, 0)\nprint(maximum_cost)\n\t \t\t \t\t\t\t\t\t \t \t\t \t \t", "import threading\r\nimport sys\r\nfrom sys import stdin\r\ninput=stdin.readline\r\nsys.setrecursionlimit(10**8)\r\nfrom collections import defaultdict\r\ndef main():\r\n n=int(input())\r\n graph=[[] for _ in range(n)]\r\n for _ in range(n-1):\r\n a,b,c=map(int,input().split())\r\n graph[a].append((b,c))\r\n graph[b].append((a,c))\r\n ans=[0]\r\n def solve(node,par,am):\r\n ans[0]=max(ans[0],am)\r\n for nie,c in graph[node]:\r\n if nie!=par:\r\n solve(nie,node,am+c)\r\n solve(0,-1,0)\r\n print(ans[0])\r\n \r\n\r\n \r\nthreading.stack_size(10 ** 8)\r\nt = threading.Thread(target=main)\r\nt.start()\r\nt.join()\r\n", "cost = 0\ndef solve(u, graph, visited):\n global cost\n visited[u] = True\n visited[u] = True\n cost = 0\n explore = -1\n subcost = 0\n current = 0\n for v in graph[u]:\n if not visited[v] and graph[u][v] > subcost:\n current = max(current, solve(v, graph, visited) + graph[u][v])\n return max(current, cost)\n\nif __name__ == '__main__':\n N = int(input().strip())\n graph = {x: {} for x in range(N)}\n visited = [False for _ in range(N + 1)]\n for i in range(N - 1):\n u,v,c = map(int, input().strip().split(\" \"))\n graph[u][v] = c\n graph[v][u] = c\n ans = solve(0, graph, visited)\n print(ans)\n\n", "from collections import defaultdict\r\n\r\n\r\ndef dfs(node, p):\r\n ans = 0\r\n for i in num_list[node]:\r\n if i[0] != p:\r\n ans = max(ans, dfs(i[0], node) + i[1])\r\n return ans\r\n\r\n\r\nn = int(input())\r\n\r\nnum_list = defaultdict(list)\r\n\r\nfor i in range(n - 1):\r\n a, b, c = map(int, input().split())\r\n\r\n num_list[a].append((b, c))\r\n num_list[b].append((a, c))\r\n\r\nprint(dfs(0, 0))\r\n# print(num_list)\r\n\r\n\r\n\r\n\r\n", "def dfs(x,p):\r\n cost=0\r\n for i,c in graph[x]:\r\n if i!=p:\r\n cost=max(cost,dfs(i,x)+c)\r\n return cost\r\nn=int(input())\r\ngraph=[[] for i in range(n)]\r\nfor i in range(n-1):\r\n u,v,c=map(int,input().split())\r\n graph[u]+=[(v,c)]\r\n graph[v]+=[(u,c)]\r\nprint(dfs(0,0))", "import sys\r\nimport threading\r\nfrom collections import defaultdict\r\n\r\n\r\n\r\nadj=defaultdict(list)\r\nn=int(input())\r\nfor _ in range(n-1):\r\n x,y,b=list(map(int,input().split()))\r\n adj[x].append((y,b))\r\n adj[y].append((x,b))\r\ndef fun(node,par,x):\r\n y=x\r\n for ch,b in adj[node]:\r\n if ch!=par:\r\n y=max(fun(ch,node,x+b),y)\r\n return y\r\n\r\n\r\ndef main():\r\n print(fun(0,-1,0))\r\n \r\nif __name__==\"__main__\":\r\n sys.setrecursionlimit(10**6)\r\n threading.stack_size(10**8)\r\n t = threading.Thread(target=main)\r\n t.start()\r\n t.join() " ]

[ "n = int(input())\r\n\r\ntotal = 0\r\nh = int(input())\r\ntotal += h + 1\r\ncur = h\r\nfor i in range(n-1):\r\n hi = int(input())\r\n if h > hi:\r\n total += h-hi #d own\r\n total += 1 # jump\r\n total += 1 # eat\r\n else:\r\n total += 1 # jump\r\n diff = hi-h\r\n total += diff # up\r\n total += 1 # eat\r\n \r\n h = hi\r\n \r\nprint(total)", "n = int(input())\nx = int(input())\nans = x+1\nl=[x]\nfor i in range(1,n):\n\tl.append(int(input()))\n\tans+=(abs(l[i]-l[i-1])+2)\nprint(ans)\n", "size = int(input())\r\nheight = []\r\nfor i in range(size):\r\n temp = int(input())\r\n height.append(temp)\r\nsteps = 0\r\nfor i in range(size):\r\n if i == 0:\r\n steps+=height[i]+1\r\n else :\r\n if height[i]<height[i-1]:\r\n steps+=height[i-1]-height[i]+1+1\r\n else:\r\n steps+=1+(height[i]-height[i-1])+1\r\nprint(steps)\r\n\r\n", "\r\nn = int(input())\r\n# l = [int(x) for x in input().split()]\r\n# print(l)\r\nl = []\r\nfor i in range(n):\r\n b = int(input())\r\n l.append(b)\r\nx = 2*n-1+l[0]\r\n\r\nfor i in range(1,n):\r\n x = x + abs(l[i]-l[i-1])\r\nprint(x)", "n = int(input())\r\nl = []\r\na = 0\r\nsu = 0\r\nfor ofa in range(0,n):\r\n b = int(input())\r\n su += abs(a-b)\r\n a = b\r\n\r\nprint(su+2*n-1)", "n = int(input())\narr = []\nfor i in range(n):\n arr.append(int(input()))\ntime = arr[0] + 1\nfor i in range(n-1):\n diff = abs(arr[i] - arr[i+1])\n time+=diff+2\nprint(time)\n", "n = int(input())\r\nmylist = []\r\nfor i in range(n):\r\n mylist.append(int(input()))\r\ncount = n+n-1+mylist[0]\r\nfor j in range(n-1):\r\n count += abs(mylist[j+1]-mylist[j])\r\nprint(count)", "n = int(input())\ntrees = []\n\nfor i in range(n):\n trees.append(int(input()))\n\ncount = n - 1\nnow = 0\n\nfor i in range(n):\n if now < trees[i]:\n count += trees[i] - now + 1\n else:\n count += now - trees[i] + 1\n now = trees[i]\nprint(count)", "import sys\nimport collections\n\ninfile = sys.stdin.buffer\ndef gs() : return infile.readline().rstrip()\ndef gi() : return int(gs())\ndef gss() : return gs().split()\ndef gis() : return [int(x) for x in gss()]\n\nMOD = 10 ** 9 + 7\nINF = 10 ** 12\n\n#RRRBGBRBBB\n#BBBRR\n\ndef main(infn=\"\") :\n global infile\n infile = open(infn,\"r\") if infn else open(sys.argv[1],\"r\") if len(sys.argv) > 1 else sys.stdin\n ######################################################################\n h = [gi() for _ in range(gi())]\n s = (2*sum(h) + len(h) -1)\n ans = 0\n cur = 0\n for i in range(len(h)):\n ans += h[i] - cur\n cur = h[i]\n if i < len(h)-1 and cur > h[i+1]:\n ans += abs(cur - h[i+1])\n cur = h[i+1]\n ans += len(h) -1\n ans += len(h)\n print (ans)\n ######################################################################\nif __name__ == '__main__' :\n main()", "n=int(input())\r\nl=[]\r\n\r\nfor i in range(n):\r\n k=int(input())\r\n l.append(k)\r\n\r\n#print(l)\r\nstep=l[0]\r\n\r\nfor i in range(len(l)-1):\r\n if l[i]>l[i+1]:\r\n step=step+(l[i]-l[i+1]+1)\r\n elif l[i+1]>l[i]:\r\n step=step+(l[i+1]-l[i]+1)\r\n else:\r\n step=step+1\r\n\r\nprint(step+n)\r\n", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n ele=int(input())\r\n a.append(ele)\r\n#print(a)\r\ntotal=0\r\njump=1\r\neat=1\r\ntotal=total+a[0]+eat\r\nfor i in range(1,n):\r\n total=total+abs(a[i]-a[i-1])+jump+eat\r\n #print(f\"This is the value of total now: {total}\")\r\nprint(total)\r\n", "n=int(input())\nxx=int(input())\nans=0+xx+1\nfor i in range(n-1):\n x=int(input())\n ans+=2\n ans+=abs(xx-x)\n xx=x\n # print(i,ans)\nprint(ans)", "n=int(input())\r\nh=0\r\nans=2*n-1\r\nfor i in range(n):\r\n temp=int(input())\r\n ans+=abs(temp-h)\r\n h=temp\r\nprint(ans)", "n=int(input())\r\nr=0\r\na=1\r\nfor i in range(n):\r\n b=int(input())\r\n r+=abs(a-b)+2\r\n a=b\r\nprint(r)\r\n", "import math\r\nfrom collections import defaultdict\r\nfrom bisect import *\r\n\r\ndef is_prime(n):\r\n\r\n for i in range(2,math.ceil(math.sqrt(n))):\r\n if(n%i==0):\r\n return False\r\n return True\r\n\r\ndef sieve(n):\r\n arr=[True for _ in range(n+1)]\r\n\r\n for i in range(2,math.ceil(math.sqrt(n))):\r\n if(arr[i]==True):\r\n for j in range(i*i,n+1,i):\r\n arr[j]=False\r\n\r\n return arr\r\n\r\ndef euclidean_distance(x1,y1,x2,y2):\r\n return math.sqrt(abs(x1-x2)**2+abs(y1-y2)**2)\r\n\r\n# s=input()\r\nn=int(input())\r\n# n,m=list(map(int,input().split()))\r\n# k=int(input())-1\r\n# lis=list(map(int,input().split()))\r\nlis=[]\r\nfor i in range(n):\r\n lis.append(int(input()))\r\n\r\ncurr=0\r\nans=0\r\nfor i in range(n):\r\n x=abs(curr-lis[i])\r\n curr=lis[i]\r\n ans+=x\r\nprint(ans+n+n-1)", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n s=int(input())\r\n l.append(s)\r\n\r\nt=l[0]+2\r\nfor i in range(len(l)-1):\r\n t+=abs(l[i+1]-l[i])+2\r\n\r\n\r\nprint(t-1)\r\n ", "n = int(input())\r\nh, t = [0]*n, 0\r\nfor i in range(n):\r\n h[i] = int(input())\r\n if i == 0:\r\n t += (h[i]+1)\r\n else:\r\n if h[i] >= h[i-1]:\r\n t += (1+h[i]-h[i-1]+1)\r\n else:\r\n t += (h[i-1]-h[i] + 1 + 1)\r\nprint(t)", "\r\n\r\nimport 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\r\n\r\nn=inp()\r\n\r\narr=[]\r\n\r\nfor i in range(0,n) :\r\n x=inp()\r\n arr.append(x)\r\n\r\n\r\n\r\nans=0;\r\nans+= arr[0]+1\r\n\r\nfor i in range (0,n-1):\r\n ans+= 2 + abs(arr[i]-arr[i+1])\r\n\r\nprint(ans)", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n k=int(input())\r\n l.append(k)\r\ns=0\r\nfor i in range(n):\r\n if i==0:\r\n s=s+l[i]+1\r\n else:\r\n if l[i]>l[i-1]:\r\n s=s+l[i]-l[i-1]+2\r\n elif l[i]<l[i-1]:\r\n s=s+l[i-1]-l[i]+2\r\n else:\r\n s=s+2\r\nprint(s)", "import sys\ninputlist=sys.stdin.readlines()\nnumber_of_numbers=int(inputlist[0])\ntotal_value=0\nvalue_before=0\nfor i in range(1,number_of_numbers+1):\n\tvalue_now=int(inputlist[i])\n\tdiff=abs(value_now-value_before)\n\ttotal_value=total_value+diff\n\tvalue_before=value_now\nprint(total_value+2*number_of_numbers-1)", "n = int(input())\r\n\r\nheight = []\r\ntemp = n\r\n\r\nwhile temp > 0:\r\n height.append(int(input()))\r\n temp -= 1\r\n \r\neat = n\r\njump = n-1\r\n\r\nud = height[0]\r\n\r\nfor i in range(n-1):\r\n ud += abs(height[i] - height[i+1])\r\n \r\nprint(ud + eat + jump)", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n a.append(int(input()))\r\nt=a[0]+1\r\nfor i in range(1,n):\r\n t+=(abs(a[i]-a[i-1])+2)\r\nprint(t)\r\n \r\n \r\n\r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n ", "n = int(input())\r\narr = list()\r\nfor i in range(n):\r\n arr.append(int(input()))\r\nans = n + (n-1) + arr[0]\r\nfor i in range(1, n):\r\n if arr[i-1]<=arr[i]:\r\n ans += (arr[i]-arr[i-1])\r\n else:\r\n ans += (arr[i-1]-arr[i])\r\n \r\nprint(ans)", "n = int(input())\r\ndata = [int(input()) for i in range(n)]\r\ncnt = data[0] + 1\r\nfor i in range(1, n):\r\n if data[i - 1] <= data[i]:\r\n cnt += data[i] - data[i - 1] + 2\r\n else:\r\n cnt += data[i - 1] - data[i] + 2\r\n\r\nprint(cnt)", "from sys import stdin,stdout\nnmbr = lambda: int(stdin.readline())\nlst = lambda: list(map(int, stdin.readline().split()))\nfor _ in range(1):#nmbr()):\n n=nmbr()\n a=[];h=ans=0\n for i in range(n):\n v=nmbr()\n ans+=abs(h-v)+1\n h=v\n ans+=1\n print(ans-1)\n \t \t\t\t\t\t\t\t \t \t\t \t\t\t \t\t\t \t\t\t", "n = int(input())\r\nh = []\r\nfor i in range(n):\r\n h.append(int(input()))\r\n\r\nstart = 2 * n\r\nlast = 1\r\nfor i in range(n):\r\n start += abs(h[i] - last)\r\n last = h[i]\r\nprint(start)", "n=int(input())\r\nb=n+(n-1)\r\nc=[]\r\nfor i in range(n):\r\n\ta=int(input())\r\n\tc.append(a)\r\nfor i in range(1,n):\r\n\tb+=abs(c[i]-c[i-1])\t\r\n\r\nprint(b+c[0])\t", "\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\ns=0;c=0\r\nfor _ in \" \"*int(input()):a=int(input());s+=abs(c-a)+2;c=a\r\nprint(s-1)\r\n", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n x = int(input())\r\n a.append(x)\r\n\r\ns = a[0] + 1\r\nfor i in range(1, n):\r\n s += (abs(a[i] - a[i - 1]))\r\n s += 2\r\n\r\nprint(s)", "n = int(input())\r\n\r\ncurr = int(input())\r\nt = n+curr\r\nfor i in range(1, n):\r\n h = int(input())\r\n t += 1+abs(h-curr)\r\n curr = h\r\nprint(t)\r\n", "pre,c=0,-1\r\nfor i in range(int(input())):\r\n n=int(input())\r\n c+=abs(n-pre)\r\n c+=2\r\n pre=n\r\nprint(c)", "n=int(input());h=[];c=0\r\nfor i in range(n): h.append(int(input()))\r\nc+=h[0]+1\r\nfor i in range(1,len(h)):\r\n if h[i]>=h[i-1]: c+=h[i]-h[i-1]+2\r\n else: c+=h[i-1]-h[i]+2\r\nprint(c)\r\n\r\n\r\n", "n = int(input())\r\ntable=[]\r\nans=0\r\nfor i in range(n):\r\n table.append(int(input()))\r\nfor i in range(n):\r\n if i==0:\r\n ans+=table[0]\r\n place = table[0]\r\n else:\r\n if place>table[i]:\r\n ans+= abs(table[i]-place)\r\n place = table[i]\r\n else:\r\n ans+=abs(table[i]-place)\r\n place = table[i]\r\nprint(ans+2*n-1)", "n = int(input())\r\nls = []\r\nfor i in range(n):\r\n ls.append(int(input()))\r\n\r\ncount = n + ls[0]\r\nfor i in range(1, n ):\r\n if(ls[i-1] == ls[i]):\r\n count+=1\r\n elif(ls[i-1] > ls[i]):\r\n count+= ls[i-1]-ls[i]+1\r\n else:\r\n count+= ls[i]-ls[i-1]+1\r\nprint(count)\r\n", "n = int(input())\n\ntrees = []\nfor i in range(n):\n trees.append(int(input()))\n\nsec = trees[0] + 1\nfor i in range(1,len(trees)):\n sec += (abs(trees[i] - trees[i-1]) + 2) \nprint(sec)\n \n \n\n\n", "n = int(input())\r\nl = []\r\nfor i in range(n):\r\n x = int(input())\r\n l.append(x)\r\nh = 0\r\nl.append(l[-1])\r\nres = 0\r\nj = 0\r\nfor i in range(len(l) - 1):\r\n if l[j] > l[j + 1] and h > 0:\r\n res += (l[j] - l[j + 1] + 2)\r\n h = l[j + 1]\r\n elif l[j] <= l[j + 1] and h > 0:\r\n res += (l[j + 1] - l[j] + 2)\r\n h = l[j + 1]\r\n else:\r\n res += l[j] - h + 1\r\n h = l[j]\r\n j -= 1\r\n j += 1\r\nprint(res)", "n = int(input())\r\nans = 0\r\nprev = 0\r\nfor _ in range(n):\r\n h = int(input())\r\n if prev == 0:\r\n ans += h + 1\r\n else:\r\n ans += 2 + abs(h - prev)\r\n prev = h\r\nprint(ans)", "def main():\n n = int(input())\n a = []\n for i in range(n):\n a.append(int(input()))\n cost = 0\n curr_high = 0\n for i in range(n):\n\n cost += abs(curr_high-a[i]) + 1\n if i+1 < n:\n if a[i] <= a[i+1]:\n cost += 1\n curr_high = a[i]\n else:\n cost += a[i] - a[i+1]+1\n curr_high = a[i+1]\n print(cost)\nif __name__ == '__main__':\n main()\n", "n = int(input())\r\nha = []\r\nk = 0\r\nfor i in range(n):\r\n h = int(input())\r\n ha.append(h)\r\n if len(ha) > 1:\r\n k += abs(ha[-2] - h) + 2\r\n else: k += h + 1\r\nprint(k)", "n = int(input())\r\ntrees = []\r\nfor i in range(n):\r\n t = int(input())\r\n trees.append(t)\r\ntime = 0\r\ninit = 0 \r\nfor i in range(n):\r\n if init == 0:\r\n time += (trees[i] + 1)\r\n elif trees[i] >= init:\r\n time += (trees[i] - init + 2)\r\n elif trees[i] < init:\r\n time += (init - trees[i] + 2)\r\n init = trees[i]\r\nprint(time)", "from os import pipe\r\n\r\n\r\nn = int(input())\r\nresult = 0\r\nnums = []\r\nfor i in range(n):\r\n num = int(input())\r\n nums.append(num)\r\n value =abs(nums[i-1] - num) + 2 if i > 0 else num + 1\r\n result += value\r\n\r\nprint(result)\r\n", "n = int(input())\r\nlis = []\r\nfor i in range(n):\r\n temp = int(input())\r\n lis.append(temp)\r\nans = len(lis)\r\nans+=lis[0]\r\nfor i in range(n-1):\r\n ans+=abs(lis[i]-lis[i+1])+1\r\nprint(ans)", "# cook your dish here\r\nn=int(input())\r\nh=[]\r\nfor _ in range(n):\r\n h.append(int(input()))\r\nc=h[0]\r\nd=h[0]\r\nfor i in range(1,n):\r\n d=d+abs(h[i]-c)\r\n c=h[i]\r\nprint(d+2*n-1)", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n l.append(int(input()))\r\ns=l[0]+1\r\nfor i in range(1,n):\r\n s=s+abs(l[i]-l[i-1])+2\r\nprint(s)\r\n", "cases=int(input())\r\ntot=0\r\nc=[]\r\nfor i in range(cases):\r\n\tc.append(int(input()))\r\n\r\nfor i in range(len(c)):\r\n\tif i==0:\r\n\t\ttot+=c[i]+1\r\n\telse:\r\n\t\ttot+=abs(c[i]-c[i-1])+2\r\n\t\t\r\n\t\t\r\n\t\r\n\t\t\r\nprint(tot)\r\n\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\nfrom math import ceil\r\n\r\nn = ip()\r\ns = n\r\nli = []\r\nfor i in range(n):\r\n\tli.append(ip())\r\nfor i in range(n):\r\n\tif i == 0:\r\n\t\ts += li[i]\r\n\telif li[i] < li[i-1]:\r\n\t\ts += (li[i-1]-li[i])+1\r\n\telif li[i] > li[i-1]:\r\n\t\ts += (1+li[i]-li[i-1])\r\n\telse:\r\n\t\ts += 1\r\nop(s)", "n = int(input())\n\no = 0\nt = 0\n\nfor i in range(n):\n\tx = int(input())\n\tif x < o:\n\t\tt += o - x + 1\n\t\to = x\n\telse:\n\t\tt += x - o + 1\n\t\to = x\n\tt += 1\n\nprint(t - 1)\n", "num = int(input())\r\narr = []\r\n\r\nfor i in range(0,num):\r\n ele = int(input())\r\n arr.append(ele)\r\n\r\ntotal = 0\r\ntotal += (arr[0] + 1)\r\nprev = arr[0]\r\nfor i in range(1,num):\r\n if prev < arr[i]:\r\n total += 2\r\n total += abs(arr[i] - prev)\r\n prev = arr[i]\r\n elif prev == arr[i]:\r\n total += 2\r\n prev = arr[i]\r\n else:\r\n total += abs(arr[i] - prev)\r\n total += 2\r\n prev = arr[i]\r\n\r\nprint(total)\r\n\r\n", "def main():\r\n\tn=int(input())\r\n\tans=0\r\n\tfor i in range(n):\r\n\t\tif i==0: \r\n\t\t\ta=int(input())\r\n\t\t\tans+=a+1\r\n\t\t\tcontinue\r\n\t\tb=a\r\n\t\ta=int(input())\r\n\t\tans+=abs(a-b)+2\r\n\r\n\tprint(ans)\r\nmain()", "t=-1\r\nz=0\r\nfor i in range(int(input())):\r\n\ta=int(input())\r\n\tif z!=a:\r\n\t\tt+=1\r\n\t\tt+=abs(a-z)\r\n\t\tt+=1\r\n\telse:\r\n\t\tt+=2\r\n\tz=a\r\nprint(t)", "n=int(input())\r\nt=[]\r\nfor i in range(n):\r\n x=int(input())\r\n t.append(x)\r\n\r\ncount=0\r\nh=0\r\nfor i in range(n):\r\n count+=abs(h-t[i])+2\r\n h=t[i]\r\nprint(count-1)", "def ros(n,l):\r\n res=l[0]+1\r\n for i in range(n-1):\r\n if l[i]<=l[i+1]:\r\n res+=l[i+1]-l[i]+2\r\n else:\r\n res+=l[i]-l[i+1]+2\r\n\r\n return res\r\n\r\nn=int(input())\r\nl=[]\r\nfor i in range(n):\r\n temp=int(input())\r\n l.append(temp)\r\n\r\nres=ros(n,l)\r\nprint(res)\r\n", "x,t=0,0\r\nfor i in range(int(input())):\r\n n=int(input())\r\n if(x<=n):\r\n t=t+n-x+1\r\n if(x>0):\r\n t=t+1\r\n else:\r\n t=t+x-n+2\r\n x=n\r\nprint(t)", "n = int(input())\r\nh = []\r\nfor i in range(n):\r\n h.append(int(input()))\r\ntime = h[0] + 1\r\nfor i in range(n-1):\r\n if h[i] <= h[i+1]:\r\n time += 1\r\n else:\r\n time += (h[i] - h[i+1] + 1)\r\n time += h[i+1] - min(h[i], h[i+1])\r\n time += 1\r\nprint(time) ", "def solve():\r\n n = int(input())\r\n #l1 = []\r\n h1 = 0\r\n ans = 0\r\n for i in range(n):\r\n h2 = int(input())\r\n ans += abs(h2 - h1)+1\r\n h1 = h2\r\n #print(ans)\r\n ans += n\r\n print(ans-1)\r\n\r\nfor _ in range(1):\r\n solve()\r\n", "#!/usr/bin/env pypy3\r\n\r\n# from __future__ import annotations # CodeForces PyPy version is 7.3.0, which doesn't support Python 3.7\r\n\r\nimport platform\r\nfrom array import * # type: ignore\r\nfrom bisect import * # type: ignore\r\nfrom collections import * # type: ignore\r\nfrom functools import * # type: ignore\r\nfrom itertools import * # type: ignore\r\nfrom math import * # type: ignore\r\nfrom pprint import pprint as pp\r\nfrom typing import * # type: ignore\r\n\r\n\r\n# from more_itertools import * # type: ignore\r\n\r\nif platform.python_implementation() != \"PyPy\":\r\n raise RuntimeError(\r\n \"Should use PyPy interpreter. \"\r\n \"This script is tailor made for PyPy environment.\"\r\n )\r\n\r\nT = TypeVar(\"T\")\r\n\r\nrd = lambda: map(int, input().split())\r\nrl = lambda: [int(s) for s in input().split()]\r\nre = lambda: int(input())\r\n\r\n\r\ndef is_local_environment() -> bool:\r\n # A rough heuristics\r\n return platform.node() == \"Inspiron-5000\"\r\n\r\n\r\ndef localize(fn):\r\n @wraps(fn)\r\n def wrapper(*args, **kwargs):\r\n if not is_local_environment():\r\n return\r\n return fn(*args, **kwargs)\r\n\r\n return wrapper\r\n\r\n\r\npp = localize(pp)\r\np = localize(print)\r\nprint = 0\r\n\r\nenu = enumerate\r\nenumerate = 0\r\n\r\n\r\ndef pdbt() -> None:\r\n import pdb\r\n\r\n pdb.set_trace()\r\n\r\n\r\ndef mod(n: int) -> int:\r\n return n % (10 ** 9 + 7) # 1e9 + 7\r\n\r\n\r\nclass ps:\r\n _cache = []\r\n\r\n def __init__(self, *args, **kwargs) -> None:\r\n self.__class__._cache.append((args, kwargs))\r\n # TODO use reflection to exit from solve() function\r\n\r\n @classmethod\r\n def flush(cls: Type) -> None:\r\n import builtins\r\n\r\n p(\"\\033[92m\", end=\"\")\r\n\r\n for args, kwargs in cls._cache:\r\n builtins.print(*args, **kwargs)\r\n\r\n p(\"\\033[0m\", end=\"\")\r\n\r\n\r\ndef psb(boolean: bool) -> None:\r\n if boolean:\r\n ps(\"yes\")\r\n else:\r\n ps(\"no\")\r\n\r\n\r\ndef log_recursion_error(fn):\r\n @wraps(fn)\r\n def wrapper(*args, **kwargs):\r\n try:\r\n return fn(*args, **kwargs)\r\n except RecursionError as e:\r\n import builtins\r\n import sys\r\n\r\n builtins.print(\"Encounter RecursionError\", file=sys.stderr)\r\n sys.exit(200)\r\n\r\n return wrapper\r\n\r\n\r\ndef print_test_case(target_t: int, num: int, lines: int) -> None:\r\n num -= 1\r\n\r\n t = int(input())\r\n\r\n if t != target_t:\r\n for _ in range(t):\r\n solve()\r\n ps.flush()\r\n return\r\n\r\n assert num < t\r\n\r\n for i in range(t):\r\n test_case = \"\\n\".join(input() for _ in range(lines))\r\n if i == num:\r\n import builtins\r\n\r\n builtins.print(test_case)\r\n sys.exit(201)\r\n\r\n\r\nclass Singleton:\r\n _singleton = None\r\n\r\n def __new__(cls: Type[\"Singleton\"]) -> \"Singleton\":\r\n if cls._singleton is None:\r\n cls._singleton = object.__new__(cls)\r\n return cls._singleton\r\n\r\n\r\n_sentinel = object()\r\nNO_DEFAULT = object()\r\n\r\n\r\n# Self implementation of more-itertools library's peekable()\r\nclass peekable(Iterator[T]):\r\n def __init__(self, iterable: Iterable[T]) -> None:\r\n self._iterable = iter(iterable)\r\n try:\r\n self._head = next(self._iterable)\r\n except StopIteration:\r\n self._head = _sentinel\r\n\r\n def peek(self, default=NO_DEFAULT) -> T:\r\n if self._head is _sentinel:\r\n if default is NO_DEFAULT:\r\n raise StopIteration\r\n else:\r\n return default\r\n else:\r\n return self._head\r\n\r\n def __bool__(self) -> bool:\r\n return self._head is not _sentinel\r\n\r\n def __getitem__(self) -> T:\r\n raise NotImplementedError\r\n\r\n def prepend(self) -> None:\r\n raise NotImplementedError\r\n\r\n def __next__(self) -> T:\r\n if self._head is _sentinel:\r\n raise StopIteration\r\n res = self._head\r\n try:\r\n self._head = next(self._iterable)\r\n except StopIteration:\r\n self._head = _sentinel\r\n return res\r\n\r\n def __iter__(self) -> Iterator[T]:\r\n return self\r\n\r\n\r\n# Node = TypeVar(\"Node\")\r\nNode = Any\r\nGraph = DefaultDict[Node, Set[Node]]\r\n\r\n\r\ndef bfs(graph: Graph, src: Node) -> Iterator[Set[Node]]:\r\n queue: Set[Node] = {src}\r\n seen: Set[Node] = set()\r\n while queue:\r\n new_queue = set()\r\n for node in queue:\r\n seen.add(node)\r\n for child in graph[node]:\r\n if child not in seen:\r\n new_queue.add(child)\r\n yield queue\r\n queue = new_queue\r\n\r\n\r\ndef dfs(graph: Graph, src: Node) -> Iterator[Node]:\r\n stack: List[Node] = [src]\r\n seen: Set[Node] = set()\r\n while stack:\r\n node = stack.pop()\r\n if node in seen:\r\n continue\r\n yield node\r\n seen.add(node)\r\n for child in graph[node]:\r\n if child not in seen:\r\n stack.append(child)\r\n\r\n\r\n# TODO segment tree library\r\n\r\n# TODO primality test (fastest algorithm, plus a lot of optimization tricks)\r\n\r\n\r\n@log_recursion_error\r\ndef solve() -> None:\r\n n = re()\r\n time = -1\r\n last = 0\r\n for _ in range(n):\r\n h = re()\r\n time += 2 + abs(h - last)\r\n last = h\r\n ps(time)\r\n\r\n\r\ndef main() -> None:\r\n t = 1\r\n for _ in range(t):\r\n solve()\r\n ps.flush()\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n # print_test_case()\r\n", "n= int(input())\r\nh= 0\r\nsum = 0\r\nfor k in range(n):\r\n i = int(input())\r\n sum += (abs(i-h) + 1)\r\n h = i\r\nprint(sum + n-1)\r\n \r\n", "n=int(input())\r\na=[]\r\nb=0\r\nfor j in range (n):\r\n\ta.append(int(input()))\r\nb=b+(a[0]+1)\r\nfor i in range (1,n):\r\n\tif a[i-1] <a[i]:\r\n\t\tb=b+(a[i]-a[i-1]+2)\r\n\telif a[i-1] > a[i]:\r\n\t\tb=b+(a[i-1]-a[i]+2)\r\n\telse:\r\n\t\tb=b+2\r\nprint(b)\t", "import sys\r\ndef input():\r\n return sys.stdin.readline().strip()\r\n \r\n \r\ndef iinput():\r\n return int(input())\r\n \r\n \r\ndef tinput():\r\n return input().split()\r\n \r\n \r\ndef rinput():\r\n return map(int, tinput())\r\n \r\n \r\ndef rlinput():\r\n return list(rinput())\r\n\r\nn = iinput()\r\nA = [-1]*(n)\r\nfor i in range(n):\r\n A[i] = iinput()\r\ncost = A[0]+1\r\nfor i in range(1,n):\r\n cost += 1 #jump \r\n if A[i] >= A[i-1]:\r\n cost += (A[i]-A[i-1] + 1)\r\n else:\r\n cost += (A[i-1]-A[i]+1)\r\nprint(cost)", "n=int(input())\r\nh=[]\r\nfor _ in range(n):\r\n h.append(int(input()))\r\n# print(h)\r\nans=h[0]+1\r\nfor i in range(1,n):\r\n if h[i]>=h[i-1]:\r\n ans+=h[i]-h[i-1]+1\r\n else:\r\n ans+=h[i-1]-h[i]+1\r\nprint(ans+n-1)", "import math\r\nn=int(input())\r\narr=[]\r\nfor ii in range(n):\r\n\ta=int(input())\r\n\tarr.append(a)\r\nh=0\r\nans=0\r\nfor i in range(n):\r\n\tans+=abs(h-arr[i])+1 #+1 to eat\r\n\tans+=1 #to jump\r\n\th=arr[i]\r\nans-=1 #delte jump of last tree\r\nprint(ans)", "n = int(input())\r\nh = []\r\nfor _ in ' '*n: h.append(int(input()))\r\ns = 0\r\ns += h[0] + 1\r\nfor i in range(1, n):\r\n s += abs(h[i] - h[i-1]) + 2\r\nprint(s)", "#author : dokueki\r\n\r\nimport sys\r\nINT_MAX = sys.maxsize\r\nINT_MIN = -(sys.maxsize)-1\r\nsys.setrecursionlimit(10**7)\r\nmod = 1000000007\r\n\r\n\r\ndef IOE():\r\n sys.stdin = open(\"input.txt\", \"r\")\r\n sys.stdout = open(\"output.txt\", \"w\")\r\n\r\n\r\ndef main():\r\n inp = []\r\n n = int(sys.stdin.readline())\r\n for _ in range(n):\r\n inp.append(int(sys.stdin.readline()))\r\n ans = 0\r\n inp.insert(0, 1)\r\n for i in range(len(inp)-1):\r\n ans = ans + abs(inp[i + 1] - inp[i]) + 1\r\n print(ans+n)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n try:\r\n IOE()\r\n except:\r\n pass\r\n main()\r\n", "from sys import stdin,stdout\r\nn=int(stdin.readline())\r\nw=[]\r\nfor i in range(n):\r\n w.append(int(stdin.readline()))\r\ncost=(2*n-1)+w[0]\r\nfor k in range(1,n):\r\n cost+=abs(w[k]-w[k-1])\r\nstdout.write(str(cost)) \r\n\r\n\r\n#498 530", "from sys import *\r\nfrom math import *\r\nfrom sys import stdin,stdout\r\nfrom collections import *\r\n\r\nint_arr = lambda : list(map(int,stdin.readline().strip().split()))\r\nstr_arr = lambda :list(map(str,stdin.readline().split()))\r\nget_str = lambda : map(str,stdin.readline().strip().split())\r\nget_int = lambda: map(int,stdin.readline().strip().split())\r\nget_float = lambda : map(float,stdin.readline().strip().split())\r\n\r\n\r\nmod = 1000000007\r\nsetrecursionlimit(1000)\r\n\r\ntime = 0\r\nprev = 0\r\nfor _ in range(int(input())):\r\n h = int(input())\r\n if prev <= h:\r\n if prev:\r\n time += 1 \r\n time += (h - prev) + 1\r\n prev = h\r\n else:\r\n if prev:\r\n time += 1\r\n time += (prev - h) + 1\r\n prev = h\r\nprint(time)\r\n", "n = int(input())\r\nprev_ht = int(input())\r\nseconds = 2*n - 1 + prev_ht\r\nfor i in range(n-1):\r\n num = int(input())\r\n if num>=prev_ht:\r\n seconds += num-prev_ht\r\n prev_ht = num\r\n else:\r\n seconds += prev_ht - num\r\n prev_ht = num\r\nprint(seconds)", "n = int(input())\r\ntime = n\r\nprev_height = 0\r\nfor i in range(n):\r\n height = int(input())\r\n if height > prev_height:\r\n time += height - prev_height + 1\r\n if not prev_height:\r\n time -= 1\r\n else:\r\n time += prev_height - height + 1\r\n\r\n # print(f\"height = {height}, previous_height = {prev_height}, time = {time}\")\r\n prev_height = height\r\n\r\nprint(time)", "import sys\r\n\r\ninput = lambda: sys.stdin.buffer.readline().decode().strip()\r\ninl = lambda: list(map(int, input().split()))\r\n\r\nn = int(input())\r\na = [int(input()) for _ in range(n)]\r\n\r\n# 1. intial value\r\nans = n + a[0]\r\n\r\n# 2. diff between each two tress\r\nfor i in range(len(a) - 1):\r\n ans += abs(a[i] - a[i + 1]) + 1\r\n\r\n# 3. print ans\r\nprint(ans)\r\n", "n=int(input())\r\narr=[]\r\nfor i in range(n):\r\n arr.append(int(input()))\r\nans=0\r\ncurr=0\r\nfor ele in arr:\r\n if(ele>curr):\r\n ans+=(ele-curr)\r\n ans+=1\r\n curr=ele\r\n elif(ele<curr):\r\n ans+=(curr-ele)\r\n ans+=1\r\n curr=ele\r\n else:\r\n ans+=1\r\nprint(ans+n-1) ", "n=int(input())\r\na=list()\r\ncount_=0\r\nfor i in range(n):\r\n b=int(input())\r\n if len(a)!=0:\r\n if b>=a[-1]:\r\n count_+=b-a[-1]+2\r\n else:\r\n count_+=a[-1]-b+2\r\n else:\r\n count_+=b+1\r\n a.append(b)\r\nprint(count_)\r\n", "n = int(input())\r\nl = []\r\nfor i in range(n):\r\n l.append(int(input()))\r\n\r\nans = n-1\r\nlast = 0\r\nfor i in l:\r\n ans += abs(last-i)+1\r\n last = i\r\nprint(ans)", "n=int(input())\r\nx=[0 for i in range(n)]\r\ny=0\r\nfor i in range(n):\r\n x[i]=int(input())\r\nc=(x[0])+n+(n-1)\r\nfor i in range(n-1):\r\n c=c+abs(x[i]-x[i+1])\r\nprint(c)", "n=int(input())\r\nans=int(input())+1\r\npre=ans-1\r\nfor i in range(n-1):\r\n k=int(input())\r\n if(pre<=k):\r\n ans+=k-pre+2\r\n else:\r\n ans+=pre-k+2\r\n pre=k\r\nprint(ans)", "from math import *\r\na = int(input())\r\nb = 0\r\nc = []\r\nfor i in range(a):\r\n b = int(input())\r\n c.append(b)\r\n\r\nd = c[0]\r\ne = a - 1\r\nf = a\r\n\r\ng = 0\r\nfor j in range(len(c)-1):\r\n g = g + abs(c[j+1] - c[j])\r\n\r\nprint(d+e+f+g)", "n=int(input())\r\nt=[]\r\nfor i in range(0,n):\r\n t.append(int(input()))\r\ntime=n+n-1\r\nfor i in range(0,n):\r\n if(i==0):\r\n time+=t[0]\r\n else:\r\n time+=abs(t[i]-t[i-1])\r\nprint(time) \r\n", "n=int(input())\r\nh=0\r\nt=0\r\nfor j in range(n):\r\n hi = int(input())\r\n if(j==0):\r\n h=hi\r\n t+=(hi+1)\r\n else:\r\n t+=(abs(hi-h)+2)\r\n h=hi \r\n # print(t)\r\nprint(t)", "n = int(input())\r\n\r\nc_h = 0\r\nt = 0\r\nfor i in range(n):\r\n h = int(input())\r\n if h >= c_h:\r\n t += h - c_h\r\n c_h = h\r\n else:\r\n t += c_h - h\r\n c_h = h\r\n t += 2\r\n\r\n# minus one as we don't just on last tree\r\nt -= 1\r\nprint(t)", "# -----Arkp-----#\r\nfrom math import *\r\nfrom collections import defaultdict\r\ndef solve(n,l):\r\n res=l[0]+1\r\n for i in range(1,n):\r\n if l[i]>=l[i-1]:\r\n res+=(l[i]-l[i-1]+1)\r\n # print('if: ',l[i]-l[i-1]+1)\r\n else:\r\n res+=l[i-1]-l[i]+1\r\n # print('else: ',l[i-1]+l[i]+1)\r\n res+=1\r\n # print('res: ',res)\r\n return res\r\n\r\n\r\n\r\n\r\nn=int(input())\r\nl=[]\r\nfor i in range(n):\r\n l.append(int(input()))\r\nprint(solve(n,l)) ", "n=int(input())\r\nh=[]\r\nfor i in range(n):\r\n h.append(int(input()))\r\n\r\nt=0\r\nt += h[0]+1\r\nfor i in range(0,n-1):\r\n\r\n \r\n if(h[i+1]<h[i]):\r\n t += h[i]-h[i+1]+1+1\r\n if(h[i+1]>h[i]):\r\n t += 1+h[i+1]-h[i]+1\r\n if(h[i+1]==h[i]):\r\n t += 1+1\r\nprint(t)", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n\ta.append(int(input()))\r\nt = 0\r\nfor i in range(len(a)):\r\n\tif i == 0:\r\n\t\tt += a[i]\r\n\telse:\r\n\t\tif a[i-1]<=a[i]:\r\n\t\t\tt+=1\r\n\t\t\tt+=a[i]-a[i-1]\r\n\t\telse:\r\n\t\t\tt+=a[i-1]-a[i]\r\n\t\t\tt+=1\r\n\tt+=1\r\nprint(t)", "n=int(input())\r\nr=n*2-1\r\nh=0\r\nfor i in range(n):\r\n t=int(input())\r\n r+=abs(h-t)\r\n h=t\r\nprint(r)", "n,arr,ini,ans= int(input()),[],0,0\r\nfor i in range(n): arr.append(int(input()))\r\nfor i in range(n): ans,ini= ans+abs(arr[i]-ini) +1,arr[i]\r\nprint(ans+n-1)\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n=int(input())\r\nt=0\r\nx=0\r\nfor i in range(n):\r\n a=int(input())\r\n if i==0:\r\n t+=a\r\n else:\r\n t+=abs(a-x)+1\r\n x=a\r\nprint(t+n) \r\n", "n= int(input())\r\nl=[]\r\nfor i in range(n):\r\n l.append(int(input()))\r\nl.insert(0,0)\r\nsu=0\r\nfor i in range(1,len(l)):\r\n su+=abs(l[i]-l[i-1])\r\nsu+=n+n-1\r\nprint(su)", "n=int(input())\r\narr=[]\r\nfor i in range(n):\r\n arr.append(int(input()))\r\nt1=arr[0]+1\r\ni=0\r\nwhile(i<n-1):\r\n if arr[i]<=arr[i+1]:\r\n t1=t1+(arr[i+1]-arr[i])+2\r\n else:\r\n t1=t1+(arr[i]-arr[i+1])+2\r\n i=i+1\r\nprint(t1)\r\n", "a=int(input())\r\nL=[]\r\nfor i in range(a):\r\n\tL.append(int(input()))\r\nsum=L[0]+1\r\nfor i in range(len(L)-1):\r\n\t\tsum+=2+abs(L[i+1]-L[i])\r\nprint(sum)", "t=int(input())\r\nl=[]\r\nfor i in range(t):\r\n s=int(input())\r\n l.append(s)\r\nans=t+l[0]\r\nfor j in range(1,t):\r\n a,b=l[j-1],l[j]\r\n if(a==b):\r\n ans+=1\r\n elif(a>b):\r\n ans += 1+ a-b\r\n else:\r\n ans += 1+ b-a\r\nprint(ans)", "\r\ndef calculateTime(Height, totalTrees):\r\n\t#squirrel going to spend 1 unit of time at each tree eating fruit\r\n\t#Squirrel going to spend 1 unit of time at each tree for jumping to next Tree [except at last Tree, no jump is required]\r\n\t#For reach tree, squirral is either moving up/down to reach top of tree..\r\n\t#if previous tree is bigger than next..then squirrel have to move down.. else moveUpFromThatHeight\r\n\t#totalTime= eatingTimeAtEachTree*totalTrees + jumpingTONextTree*(totalTrees-1) + SumOfupDownTimeAtIndividualTrees\r\n\tprev=0\r\n\ttotalTime=0\r\n\tfor i in range(totalTrees):\r\n\t\ttotalTime+=abs(Height[i]-prev)\r\n\t\tprev=Height[i]\r\n\ttotalTime= (totalTrees) + (totalTrees-1) + totalTime\r\n\treturn totalTime\r\n\t\r\nn=int(input())\r\narr=[]\r\nwhile n:\r\n\ttemp=int(input())\r\n\tarr.append(temp)\r\n\tn-=1\r\nprint(calculateTime(arr,len(arr)))", "from sys import stdin\r\ninp = lambda : stdin.readline().strip()\r\n\r\nn = int(inp())\r\na = []\r\n\r\nfor i in range(n):\r\n a.append(int(inp()))\r\n\r\nans = a[0] + 1\r\nfor i in range(1,n):\r\n ans += abs(a[i]-a[i-1]) + 2\r\n\r\nprint(ans)", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n l.append(int(input()))\r\nk=n+n-1+l[0]\r\nfor i in range(1,n):\r\n k+=max(l[i-1],l[i])-min(l[i-1],l[i])\r\nprint(k)\r\n ", "def main():\r\n n=int(input())\r\n curr = int(input())\r\n sta =curr+1\r\n for i in range(n-1):\r\n nxt = int(input())\r\n if(curr ==nxt):\r\n sta = sta+2\r\n elif(nxt>curr):\r\n sta=sta+1\r\n sta = sta +(nxt-curr) +1\r\n else:\r\n sta = sta+(curr-nxt)\r\n sta = sta +1\r\n sta =sta+1\r\n# print(curr,\" -> \", nxt,sta)\r\n curr=nxt\r\n print(sta)\r\nmain()\r\n ", "n=int(input())\r\nli=[]\r\nfor i in range(n):\r\n li.append(int(input()))\r\nt=li[0]+1\r\n\r\nfor i in range(1,n):\r\n if li[i]==li[i-1]:\r\n t=t+2\r\n elif li[i]<li[i-1]:\r\n t=t+(li[i-1]-li[i])+2\r\n else:\r\n t=t+(li[i]-li[i-1])+2\r\nprint(t)\r\n", "n = int(input())\r\nk = 0\r\nfor i in range(n):\r\n h = int(input())\r\n if k > 0:\r\n k += abs(l - h) + 2\r\n else: k += h + 1\r\n l = h\r\nprint(k)", "time = cur = 0\r\nfor i in range(int(input())):\r\n h = int(input())\r\n time += abs(cur-h)+2\r\n cur = h\r\nprint(time-1)\r\n", "def solve(n,arr):\n\tt=0\n\tpos=0\n\tfor i in range(n-1) :\n\t\tt+= arr[i]-pos\n\t\tt+=1\n\t\tif arr[i]<=arr[i+1] :\n\t\t\tt+=1\n\t\t\tpos = arr[i]\n\t\t\tcontinue\n\t\telse:\n\t\t\tt+= arr[i]-arr[i+1]\n\t\t\tpos = arr[i+1]\n\t\t\tt+=1\n\n\treturn t+arr[-1]-pos+1\n\n\n\n\n\n \n\t\n \n\t\n\t\n \n \n \n \nfrom sys import stdin\ninput = stdin.readline\n \n\nl=[]\nn=int(input())\nfor i in range(n):\n\tl.append(int(input()))\n\n \nprint(solve(n,l))", "height=[]\r\nfor _ in range(int(input())):\r\n height.append(int(input()))\r\nans=1+height[0]\r\nfor i in range(1,len(height)):\r\n if height[i]>=height[i-1]:\r\n ans+=1+height[i]-height[i-1]+1\r\n else:\r\n ans+=2+height[i-1]-height[i]\r\n\r\nprint(ans)\r\n", "def tree_hopping (a,n):\r\n time = a[0] + 1\r\n for x in range(1,n):\r\n time += abs(a[x]-a[x-1]) + 2\r\n\r\n return time\r\n\r\n\r\nn = int(input())\r\na = []\r\nfor x in range(n):\r\n a.append(int(input()))\r\n\r\nprint (tree_hopping(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", "import sys\r\ninput = sys.stdin.readline\r\nn = int (input())\r\nprev = 0\r\nans = n + (n-1)\r\nwhile n > 0: \r\n x = int (input())\r\n ans += abs(prev-x)\r\n prev = x \r\n n-=1\r\n \r\nprint (ans)\r\n", "n = int(input())\r\npos = 0\r\nc = 0\r\nfor el in range(n):\r\n if(el == 0):\r\n t = int(input())\r\n c += t + 1 \r\n pos = t\r\n else:\r\n t = int(input())\r\n if(t == pos):\r\n c += 2\r\n else:\r\n c += abs(pos-t) + 2\r\n pos = t\r\n\r\nprint(c)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Jan 19 00:03:35 2021\r\n\r\n@author: harshvardhan\r\n\"\"\"\r\n\r\nn = int(input())\r\narr = []\r\nfor i in range(n):\r\n arr.append(int(input()))\r\n\r\nans = n+n-1+arr[0]\r\nfor i in range(n-1):\r\n ans+=abs(arr[i]-arr[i+1])\r\n\r\nprint(ans)", "cases = int(input())\r\nans = cases*2-1\r\ncur = 0\r\nfor _ in range(cases):\r\n num = int(input())\r\n ans += abs(cur-num)\r\n cur = num\r\n\r\nprint(ans)\r\n", "n=input()\r\nl=[]\r\nfor _ in range(int(n)):\r\n l.append(int(input()))\r\ntt=l[0]+len(l)\r\nfor i in range(len(l)-1):\r\n if l[i+1]>l[i]:\r\n tt+=1+l[i+1]-l[i]\r\n elif l[i+1]<l[i]:\r\n tt+=1+l[i]-l[i+1]\r\n else:tt+=1\r\nprint(tt)", "for _ in range(1):\r\n n = int(input())\r\n currH = 0\r\n total = 0\r\n for i in range(n):\r\n h = int(input())\r\n \r\n if currH <= h:\r\n total += h - currH + 2\r\n currH = h\r\n\r\n else:\r\n total += currH - h + 2\r\n currH = h\r\n\r\n print(total - 1)", "n = int(input())\r\narr = [int(input()) for _ in range(n)]\r\nans = n * 2 - 1 + arr[0]\r\nfor i in range(n-1):\r\n ans+=abs(arr[i] - arr[i+1])\r\nprint(ans)", "from sys import stdin\r\n\r\n\r\ndef inp():\r\n return stdin.readline().strip()\r\n\r\n\r\nn = int(inp())\r\nar = []\r\nfor i in range(n):\r\n ar.append(int(inp()))\r\nans=1+ar[0]\r\nfor i in range(n-1):\r\n ans += 2\r\n ans+=abs(ar[i]-ar[i+1])\r\nprint(ans)", "n=int(input())\r\nl=[]\r\na=0\r\nfor _ in range(n):\r\n h=int(input())\r\n if h>=a:\r\n l.append(1+(h-a)+1)\r\n else:\r\n l.append((a-h)+1+1)\r\n a=h\r\nprint(sum(l)-1)\r\n ", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n a.append(int(input()))\r\nres=a[0]+1 \r\nfor i in range(1,n):\r\n if a[i]>a[i-1]:\r\n res+=(a[i]-a[i-1]+2)\r\n else:\r\n res+=(a[i-1]-a[i]+2)\r\nprint(res)", "n = int(input())\narr = []\nfor _ in range(n):\n arr.append(int(input()))\n\ntime = 0\ncurr_height = 0\nfor i in arr:\n time += abs(i - curr_height) + 2\n curr_height = i\nprint(time - 1)\n", "pre,ans=0,-1\r\nfor i in range(int(input())):\r\n n=int(input())\r\n ans+=abs(n-pre)\r\n ans+=2\r\n pre=n\r\nprint(ans)", "import sys\r\ninput = sys.stdin.buffer.readline\r\n\r\n\r\nn = int(input())\r\nh = []\r\nfor i in range(n):\r\n h.append(int(input()))\r\ntime = 1+h[0]\r\nfor i in range(1,n):\r\n time+=2\r\n if h[i]>=h[i-1]:\r\n time+=h[i]-h[i-1]\r\n else:\r\n time+=h[i-1]-h[i]\r\nprint(time)", "#B. Roadside Trees (Simplified Edition)\r\nn = int(input())\r\ntrees = []\r\nfor i in range(n): trees.append(int(input()))\r\npos,steps = [0,0]\r\nfor i in range(n):\r\n steps += trees[i] - pos\r\n pos += trees[i] - pos\r\n steps += 1\r\n if i + 1 == n: break\r\n steps += abs(pos-min(trees[i],trees[i+1]))\r\n pos = min(trees[i],trees[i+1])\r\n steps += 1\r\n\r\nprint(steps)", "n = int(input())\nh = []\nfor a in range(n):\n k = int(input())\n h.append(k)\nd = 0\nt = 0\nfor i in range(n):\n if d == 0: #go up and eat only\n t = t + (h[i] - d) + 1\n d = h[i]\n\n elif d <= h[i]: #jump, go up and eat\n t = t + 1 + (h[i] - d) + 1\n d = h[i]\n\n elif d > h[i]: # go down, jump and eat\n t = t + (d - h[i]) + 1 + 1\n d = h[i]\nprint(t)\n\n\t\t\t\t \t\t\t \t \t\t \t \t\t\t \t \t \t", "n = int(input())\r\ntot = 0\r\nc = 0\r\nfor i in range (n):\r\n prev = c\r\n c = int(input())\r\n if (c== prev):\r\n tot+= 1\r\n elif (c>prev):\r\n tot+= (c-prev)+1\r\n else:\r\n tot+= (prev-c)+1\r\n if(i!=n-1):\r\n tot+=1\r\n \r\nprint(tot)", "from sys import stdin\r\nt = int(stdin.readline())\r\nans = 0\r\na = 1\r\nfor k in range(t):\r\n b = int(stdin.readline())\r\n ans += abs(a-b) + 2\r\n a = b\r\nprint(ans)", "n=int(input())\r\narr=[]\r\nfor i in range(n):\r\n\tarr.append(int(input()))\r\nt=arr[0]+1\r\nfor i in range(1,n):\r\n\tif arr[i]==arr[i-1]:\r\n\t\tt=t+2\r\n\telse:\r\n\t\tt=t+2+abs(arr[i]-arr[i-1])\r\nprint(t)\r\n\t\r\n\t\t", "n = int(input())\r\nh = int(input())\r\nans = h + n\r\nprev = h\r\nfor i in range(n-1):\r\n\th = int(input())\r\n\tif h >= prev:\r\n\t\tans += h-prev + 1\r\n\telse:\r\n\t\tans += prev-h + 1\r\n\tprev = h\r\nprint(ans)", "n = int(input())\r\nh = []\r\nfor i in range(n):\r\n h.append(int(input()))\r\ncount = h[0]+1\r\nprev = h[0]\r\nfor i in range(1, len(h)):\r\n if h[i] > prev:\r\n count += h[i]-prev+2\r\n prev = h[i]\r\n elif h[i] < prev:\r\n count += prev - h[i] + 2\r\n prev = h[i]\r\n elif h[i] == prev:\r\n count += 2\r\nprint(count)", "a=int(input())\r\nl=[]\r\nans=0\r\nfor i in range(a):\r\n l.append(int(input()))\r\nans+=l[0]+1\r\nfor i in range(len(l)-1):\r\n ans+=(l[i]-min(l[i],l[i+1]))+(l[i+1]-min(l[i],l[i+1]))+2\r\nprint(ans)", "n=int(input())\r\nh=[]\r\nfor i in range(n):\r\n h.append(int(input()))\r\nc=0\r\ni=0\r\nt=0\r\nwhile(i<n-1):\r\n t+=h[i]-c\r\n c=h[i]\r\n t+=1\r\n if(h[i+1]<h[i]):\r\n t+=h[i]-h[i+1]\r\n c=h[i+1]\r\n t+=1\r\n i+=1\r\nt+=h[i]-c+1\r\nprint(t)", "n = int(input())\r\narr = []\r\nfor i in range(n):\r\n arr.append(int(input()))\r\ncurrheight = arr[0]\r\nseconds = arr[0]+1\r\nfor i in range(1,n):\r\n seconds += 1\r\n if arr[i] < currheight:\r\n seconds += currheight - arr[i] + 1\r\n else:\r\n seconds += arr[i] - currheight + 1\r\n currheight = arr[i]\r\nprint(seconds)\r\n \r\n", "n=int(input())\r\na=b=0\r\nfor i in [0]*n:\r\n h=int(input())\r\n a+=abs(h-b)+2\r\n b=h\r\nprint(a-1)", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n h=int(input())\r\n l.append(h)\r\ns=0\r\nfor i in range(n):\r\n if(i==0):\r\n s+=l[i]+1\r\n else:\r\n if(l[i]==l[i-1]):\r\n s+=2\r\n elif(l[i]<l[i-1]):\r\n s+= 1+ (l[i-1]- l[i]) +1\r\n elif(l[i]>l[i-1]):\r\n s+= 1+ (l[i]- l[i-1]) +1\r\n\r\nprint(s)\r\n \r\n \r\n", "l,c=[],-1\r\nfor i in range(int(input())):\r\n\tl.append(int(input()))\r\n\tif len(l)==1:c+=l[i]\r\n\telse:c+=abs(l[i]-l[i-1])\r\nprint(c+(len(l)*2))", "try:\r\n n = int(input())\r\n h = []\r\n for i in range(n):\r\n z = int(input())\r\n h.append(z)\r\n j=t=0\r\n for i in range(n):\r\n if i == 0:\r\n t = t + h[0]+1\r\n elif i>=1 and i<=(n-2):\r\n if h[i] < h[i-1]:\r\n t = t + 2 + (h[i-1]-h[i])\r\n else:\r\n t = t + 2 + (h[i] - h[i-1])\r\n else:\r\n if h[n-2] > h[n-1]:\r\n t = t + (h[n-2] - h[n-1]) + 2\r\n else:\r\n t = t + (h[n-1]-h[n-2]) + 1+1\r\n print(t)\r\nexcept:\r\n pass", "n=int(input())\r\nx=[]\r\nfor i in range(n):\r\n x.append(int(input()))\r\ny=[x[0]] \r\nfor i in range(1,n):\r\n if(x[i-1]>x[i]):\r\n y.append(x[i-1]-x[i]+1)\r\n else:\r\n y.append(x[i]-x[i-1]+1)\r\nans=0\r\nfor i in y:\r\n ans+=i\r\nprint(ans+n) ", "n=int(input())\r\nm=2*n-1\r\nh=0\r\nfor i in range(n):\r\n\tx=int(input())\r\n\tm+=abs(x-h)\r\n\th=x\r\nprint(m)", "n = int(input())\r\nl = []\r\ns = 0\r\ncurh = 0\r\nfor i in range(n):\r\n a = int(input())\r\n l.append(a)\r\n\r\nfor i in l :\r\n s += abs(i - curh) + 2\r\n curh = i\r\n\r\nprint(s - 1)", "n = int(input())\r\nres = 0\r\na = []\r\nfor i in range(n):\r\n\ts = int(input())\r\n\ta.append(s)\r\n#a.sort()\r\na.append(0)\r\nfor i in range(n):\r\n\tres += (abs(a[i-1]-a[i])+1) \t\t\r\n#s = int(input())\r\nres += n-1\r\nprint(res)", "n = int(input())\r\nheights = []\r\nfor _ in range(n):\r\n heights.append(int(input()))\r\n\r\nsec = heights[0]\r\nheight = heights[0]\r\nfor i in range(n):\r\n sec += abs(height - heights[i])\r\n height += heights[i] - height\r\n sec += 1 # nut\r\n sec += 1 # jump\r\nprint(sec - 1)\r\n", "# map(int, input().split())\r\n# list(map(int, input().split()))\r\n\r\nn = int(input())\r\nh = [int(input()) for _ in range(n)]\r\ntimes = h[0] + 1\r\nfor i in range(1,n):\r\n if h[i] == h[i-1]:\r\n times += 2\r\n else:\r\n times += (abs(h[i] - h[i-1]) + 2)\r\nprint(times)", "# cook your dish here\r\n\r\nn = int(input())\r\nlst = []\r\n\r\nfor i in range(0,n):\r\n ele = int(input())\r\n \r\n lst.append(ele)\r\n \r\nc = 0 \r\nj = 0\r\ni = 0\r\nwhile i in range(0,n):\r\n \r\n if i == 0 :\r\n c = c + lst[i]\r\n c = c+ 1\r\n \r\n elif i > 0 :\r\n \r\n \r\n if lst[i]>lst[i-1]:\r\n j = j + 1\r\n c = (lst[i]-lst[i-1]) + c\r\n c = c + 1\r\n \r\n elif lst[i]<lst[i-1]:\r\n j = j+1\r\n c = (lst[i-1]-lst[i]) + c\r\n c = c + 1\r\n \r\n elif lst[i]==lst[i-1]:\r\n j = j+1\r\n c = c + 1\r\n \r\n \r\n i = i+ 1\r\n \r\nprint(c+j)\r\n \r\n \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\ntime =n+n-1\r\nprev =0\r\nfor i in range(n):\r\n curr = int(input()) \r\n time = time + abs(curr-prev)\r\n prev = curr\r\n \r\n \r\nprint(time)", "from math import ceil\r\nn=int(input())\r\na=[]\r\nfor i in range(n):\r\n x=input()\r\n a.append(int(x))\r\nc=a[0]+1\r\n\r\nfor i in range(1,n):\r\n if(a[i]>=a[i-1]):\r\n diff=a[i]-a[i-1]\r\n c=c+2+(diff)\r\n \r\n else:\r\n \r\n diff=a[i-1]-a[i]\r\n c=c+diff+2\r\n \r\nprint(c) ", "def tree_jump(tree,t):\r\n time=-1\r\n current=0\r\n for i in range(t):\r\n if current <= tree[i]:\r\n time += abs(tree[i]-current)+ 2\r\n current = tree[i]\r\n else:\r\n time += abs(current - tree[i]) +2\r\n current = tree[i]\r\n\r\n return time\r\n\r\n\r\n\r\n\r\n\r\n\r\nt= int(input())\r\ntree=[]\r\nfor i in range(t):\r\n tree.append(int(input()))\r\nprint(tree_jump(tree,t))\r\n", "n = int(input())\r\nl = []\r\nfor i in range(n):\r\n l.append(int(input()))\r\n \r\nstart = l[0]\r\nans = l[0]\r\n#print(ans)\r\nfor i in range(1,n):\r\n x = l[i]\r\n if x == start:\r\n ans+=0\r\n else:\r\n ans += abs(x-start)\r\n start = x\r\n #print(ans)\r\nprint(ans+2*n-1)", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n val = int(input())\r\n a.append(val)\r\n\r\ncurr = 0\r\nactions = 2*n - 1\r\nt = 0\r\nfor i in range(n):\r\n actions += abs(a[i] - curr)\r\n curr = a[i]\r\n\r\n\r\nprint(actions)\r\n", "n=int(input())\r\nl=[0]*n\r\nfor i in range(n):l[i]=int(input())\r\nq=2*n-1+l[0]\r\nfor i in range(1,n):q+=abs(l[i]-l[i-1])\r\nprint(q)", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n num=int(input())\r\n l.append(num)\r\nr=0\r\nr=r+l[0]+1\r\nfor i in range(1,n):\r\n if(l[i]>=l[i-1]):\r\n r=r+1\r\n r=r+(l[i]-l[i-1])+1\r\n else:\r\n r=r+(l[i-1]-l[i])+1+1\r\nprint(r)", "\r\nn = int(input())\r\n\r\narr=[]\r\nfor j in range(n):\r\n elem = int(input())\r\n arr.append(elem)\r\n\r\n\r\n \r\nt = arr[0] + 1\r\n \r\nfor i in range(1,len(arr)):\r\n if arr[i] > arr[i-1]:\r\n t += arr[i] - arr[i-1] + 2\r\n else:\r\n t += arr[i-1] - arr[i] + 2\r\n \r\nprint(t) ", "n=int(input())\r\nh=[]\r\nfor i in range(n):\r\n h.append(int(input()))\r\nt=h[0]+1\r\nfor i in range(1,n):\r\n t+=abs(h[i-1]-h[i])+2\r\nprint(t)", "# Rules are confusingly written: can Liss move *back* to previously visited trees? By the letter of the rules, I think not. Which makes the problem easier, and less interesting.\n\nn = int(input())\nh = [int(input()) for i in range(n)]\n\nmoves = h[0] + 1 # Liss moves to the top of the first tree and eats the nut\nprev = h[0]\n\nfor i in range(1, n):\n moves += 2 + abs(h[i] - h[i-1]) # Liss moves to the next tree and climbs to the top level of it (or vice versa); also eats the nut there.\n prev = h[i]\n\nprint(moves)\n\n\n\n\n", "x = int(input())\nl = []\nfor i in range(x):\n\tm = int(input())\n\tl.append(m)\nf =x +l[0]# first tree climbing sec\nc = 0\nfor i in range(1,len(l)):\n\tif l[i-1]<=l[i]:\n\t\tc += 1+(l[i]-l[i-1])\n\telse:\n\t\tc+= (l[i-1]-l[i])+1\nprint(c+f)\n\n", "from os import path\r\nimport sys\r\nif (path.exists('input.txt')):\r\n sys.stdin = open(\"input.txt\", \"r\")\r\n sys.stdout = open(\"output.txt\", \"w\")\r\n\r\n\r\nn = int(input())\r\nch = 0\r\nt = -1\r\nfor i in range(n):\r\n hi = int(input())\r\n if hi >= ch:\r\n t += 1\r\n t += (hi-ch+1)\r\n ch = hi\r\n\r\n else:\r\n t += abs(ch-hi)\r\n t += 2\r\n ch = hi\r\n\r\nprint(t)\r\n", "n = int(input()) # the number of trees\r\nt = 0\r\ncurrent_hight = 0\r\n\r\nfor i in range(n):\r\n h = int(input())\r\n t += abs(current_hight - h) + 2\r\n current_hight = h \r\n\r\nprint(t - 1)", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n\tl.append(int(input()))\r\nz=n+n-1\r\ns=l[0]\r\nfor i in range(1,n):\r\n\ts+=abs(l[i]-l[i-1])\r\nz+=s\r\nprint(z)", "t = int(input())\r\nl = [0]\r\nfor i in range(t):\r\n n = int(input())\r\n l.append(n)\r\ncount = 2*t-1\r\n# print(l)\r\nfor j in range(t):\r\n count+=(abs(l[j+1]-l[j]))\r\nprint(count)\r\n\r\n", "\r\n\r\nn=int(input())\r\n\r\narr=[]\r\n\r\nfor i in range (0,n):\r\n x=int(input())\r\n arr.append(x)\r\n\r\nans=0;\r\nans+= arr[0]+1\r\n\r\nfor i in range (0,n-1):\r\n ans+= 2 + abs(arr[i]-arr[i+1])\r\n\r\nprint(ans)", "n=int(input())\r\na=list(int(input())for i in range(n))\r\ns=a[0]\r\nfor i in range(1,n):\r\n s+=abs(a[i-1]-a[i])+1\r\nprint(s+n)\r\n \r\n", "n = int(input())\r\ncur = ans = int(input())\r\nfor i in range(n - 1):\r\n _cur = int(input())\r\n ans += abs(cur - _cur) + 2\r\n cur = _cur\r\nprint(ans + 1)\r\n", "# -*- coding: utf-8 -*-\n\"\"\"Untitled56.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1K9zIFsLtcOLH7zehDUTwmMg_CXFRqu9H\n\"\"\"\n\nn=int(input())\nl1=[]\nfor i in range(0,n):\n x=int(input())\n l1.append(x)\nc=l1[0]+2\nfor i in range(1,len(l1)):\n if l1[i]<l1[i-1]:\n c=c+l1[i-1]-l1[i]+2\n else:\n c=c+l1[i]-l1[i-1]+2\nprint(c-1)\n\n", "from math import *\r\n#from bisect import *\r\n#from collections import *\r\n#from random import *\r\n#from decimal import *\"\"\"\r\n#from heapq import *\r\n#from random import *\r\nimport sys\r\ninput=sys.stdin.readline\r\n#sys.setrecursionlimit(3*(10**5))\r\nglobal flag\r\ndef inp():\r\n return int(input())\r\ndef st():\r\n return input().rstrip('\\n')\r\ndef lis():\r\n return list(map(int,input().split()))\r\ndef ma():\r\n return map(int,input().split())\r\nt=1\r\nwhile(t):\r\n t-=1\r\n n=inp()\r\n r=[]\r\n for i in range(n):\r\n r.append(inp())\r\n s=0\r\n pos=0\r\n for i in range(n):\r\n if(1):\r\n s+=abs(r[i]-pos) + 1\r\n pos=r[i]\r\n print(s+n-1)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n", "x=0\r\ncur=0\r\nfor i in range(int(input())):\r\n j=int(input())\r\n if x==0:\r\n x+=j+1\r\n cur=j\r\n else:\r\n if cur<=j:\r\n x+=1+(j-cur)+1\r\n cur=j\r\n else:\r\n x+=cur-j+2\r\n cur=j\r\nprint(x)", "n=int(input())\r\nlis=[]\r\nfor i in range(n):\r\n lis.append(int(input()))\r\nans=lis[0]+1\r\nfor i in range(1,n):\r\n if lis[i]>lis[i-1]:\r\n ans+=1+lis[i]-lis[i-1]+1\r\n else:\r\n ans+=2+lis[i-1]-lis[i]\r\nprint(ans)", "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\nn = int(input())\r\nl = []\r\nfor _ in range(n):\r\n l.append(int(input()))\r\n \r\nans = l[0]+1\r\n\r\nfor i in range(1,n):\r\n if l[i] <= l[i-1]:\r\n ans += l[i-1]-l[i]+2\r\n else:\r\n ans += l[i]-l[i-1]+2\r\nprint(ans)", "n = int(input())\r\nh = []\r\nfor i in range(n):\r\n h.append(int(input()))\r\nstart = 0\r\nans = 0\r\nfor i in range(n):\r\n ans += (abs(h[i]-start) + 1)\r\n start = h[i]\r\n if i > 0:\r\n ans += 1\r\nprint(ans)", "\r\nfrom sys import stdin\r\nstdin.readline\r\ndef mp(): return list(map(int, stdin.readline().strip().split()))\r\ndef it():return int(stdin.readline().strip())\r\n\r\nv=[]\r\nn=it()\r\n\r\nfor _ in range(n):\r\n\tv+=[it()]\r\n# print(v)\r\nans=v[0]+1\r\nfor i in range(1,n):\r\n\tif v[i]>=v[i-1]:\r\n\t\tans+=(v[i]-v[i-1]+2)\r\n\telse:\r\n\t\tans+=(v[i-1]-v[i]+2)\r\nprint(ans)\r\n", "n = int(input())\r\nh = 0\r\nres = 0\r\nfor i in range(n):\r\n s = int(input())\r\n res+= abs(s-h) + 1\r\n if i!= 0:\r\n res+=1\r\n h=s\r\nprint(res)\r\n", "# Uses python3\r\nimport sys\r\nimport math\r\ndef fn(n,h):\r\n t=0\r\n h.insert(0,0)\r\n for i in range(1,n+1):\r\n t = t + abs(h[i]-h[i-1])+1\r\n if i >1:\r\n t=t+1\r\n return t\r\nif __name__ == '__main__': \r\n input = sys.stdin.read()\r\n data = list(map(int, input.split()))\r\n n = data[0]\r\n h = data[1:]\r\n print(fn(n,h))", "trees = int(input())\r\ntime = trees + (trees-1)\r\nh_i = 0\r\nfor i in range(trees):\r\n a = int(input())\r\n time += abs(a-h_i)\r\n h_i = a\r\n\r\nprint(time)", "I=lambda:int(input())\r\nc=0\r\ntotal=-1\r\nfor i in [1]*I():\r\n b=I()\r\n total+=abs(c-b)+2\r\n c=b\r\nprint(total)", "n=int(input())\r\na=1\r\ns=0\r\nfor _ in range(n):\r\n h=int(input())\r\n s=s+abs(a-h)+2\r\n a=h\r\nprint(s)", "#Codeforces265B\r\n\r\nt = int(input())\r\n\r\nh = 0\r\ntime = 2 * t - 1\r\n\r\nn = [int(input()) for i in range(t)]\r\n\r\nfor j in range(t):\r\n \r\n time += 2 * n[j]\r\n\r\n if j > 0:\r\n time -= n[j] + n[j - 1] - abs(n[j] - n[j - 1])\r\n\r\nprint(time - n[t - 1])\r\n", "ans = 0\r\nprev_pos = 0\r\nfor i in range(int(input())):\r\n curr_pos = int(input())\r\n ans = ans + abs(curr_pos-prev_pos)+ 2\r\n prev_pos= curr_pos\r\nans = ans -1\r\nprint(ans)\r\n", "s=0\r\nh=0\r\nfor _ in range(int(input())):\r\n\tn=int(input())\r\n\ts+=abs(h-n)\r\n\th=n\r\n\ts+=2\r\nprint(s-1)", "n = int(input())\r\nb = []\r\ntotal_sum=0\r\nfor i in range(n):\r\n ele = int(input())\r\n b.append(ele)\r\nfor i in range(n-1):\r\n total_sum += abs(b[i]-b[i+1]) +1\r\nprint(b[0]+total_sum+n)", "n = int(input())\r\nt = -1\r\nh = 0\r\n\r\nfor _ in range(n):\r\n x = int(input())\r\n t += abs(x-h) + 1\r\n h = x\r\n\r\nprint(t + n)\r\n", "import sys\r\nfrom math import *\r\nfrom collections import Counter, defaultdict, deque\r\ninput = sys.stdin.readline\r\nmod = 10**9+7\r\ntree = []\r\nfor _ in range(int(input())):\r\n tree.append(int(input()))\r\n# climb tree 1\r\nans = tree[0]\r\n# jump plus climb up or down to make it\r\nfor i in range(1, len(tree)):\r\n ans += 1+abs(tree[i]-tree[i-1])\r\nans += len(tree)\r\nprint(ans)\r\n", "#!/usr/bin/env pypy3\r\n\r\nfrom sys import stdin, stdout\r\n\r\ndef input(): return stdin.readline().strip()\r\ndef read_int_list(): return list(map(int, input().split()))\r\ndef read_int_tuple(): return tuple(map(int, input().split()))\r\ndef read_int(): return int(input())\r\n\r\n### CODE HERE\r\n\r\narr = [read_int() for _ in range(read_int())]\r\n\r\ny = 0\r\nret = 0\r\n\r\nfor i,a in enumerate(arr):\r\n if y > a:\r\n # print(f\"move to jump height in {a-y} moves\")\r\n ret += y - a\r\n y = a\r\n else:\r\n pass\r\n # print(\"move to jump height in 0 moves\")\r\n\r\n if i > 0:\r\n # print(\"jump\")\r\n ret += 1\r\n\r\n # print(f\"move to top in {a-y} moves\")\r\n ret += a-y\r\n y = a\r\n\r\n # print(f\"eat in 1 moves\")\r\n ret += 1\r\n\r\nprint(ret)", "n = int(input())\n\n# Assume squirrel has had nut on the prev tree and is at it's top. \n# In this, compute time to jump to next tree, go to top and have nut\n\nh_prev = int(input())\ntime = h_prev + 1\n\nfor i in range(n-1):\n\th_cur = int(input())\n\ttime += abs((h_prev-h_cur)) + 2\n\th_prev = h_cur\n\nprint(time)", "n=int(input())\r\nz=[]\r\nfor i in range(n):\r\n z.append(int(input()))\r\ns=z[0]+1\r\nfor i in range(1,len(z)):\r\n if z[i]>z[i-1]:\r\n s=s+z[i]-z[i-1]+2\r\n else:\r\n s+=z[i-1]-z[i]+2\r\nprint(s)", "h=r=0\r\nfor _ in range(int(input())):\r\n x=int(input())\r\n r+=abs(x-h)+2\r\n h=x\r\nprint(r-1)", "t=int(input())\r\np=0\r\nl=[]\r\nfor i in range(t):\r\n h=int(input())\r\n if i==0:\r\n p+=h+1\r\n l.append(h)\r\n continue\r\n try:\r\n if h<l[i-1] and i!=0:\r\n p+=(l[i-1]-h)+2\r\n if h>l[i-1] and i!=0:\r\n p+=2+(h-l[i-1])\r\n if h==l[i-1]:\r\n p+=2\r\n l.append(h)\r\n except:\r\n pass\r\n \r\nprint(p)\r\n \r\n \r\n", "n = int(input())\nh = [int(input()) for _ in range(n)]\nres = cur = 0\nfor i in range(n):\n res += h[i] - cur + 1 # 1 to eat\n if i < n - 1:\n res += max(0, h[i] - h[i + 1]) + 1 # 1 to jump\n cur = min(h[i], h[i + 1])\nprint(res)\n", "n=int(input())\r\nheights=[]\r\nfor _ in range(n):\r\n heights.append(int(input()))\r\ntime=heights[0]+1\r\nfor i in range(1,n):\r\n time=time+abs(heights[i-1]-heights[i])+2\r\nprint(time)\r\n\r\n", "n= int(input())\r\ntrees=[]\r\n\r\nfor x in range(n):\r\n trees.append(int(input()))\r\n\r\ntime=trees[0]+1\r\n\r\nfor x in range(n-1):\r\n if(trees[x]>=trees[x+1]):\r\n time=time+(trees[x]-trees[x+1])+1+1\r\n elif(trees[x]<=trees[x+1]):\r\n time=time+1+(trees[x+1]-trees[x])+1\r\n \r\nprint(time)\r\n", "def inpNum(): return int(input())\ndef inpNums(): return map(int,input().split())\ndef inpList(): return list(map(int,input().split()))\n\nn = inpNum()\ntotal = n\nprev = inpNum()\ntotal+=prev\nfor _ in range(n-1):\n num = inpNum()\n total += abs(prev-num)\n prev = num\n total+=1\nprint(total)", "n = int(input())\r\na = 0\r\nb=0\r\nwhile n>0:\r\n s = int(input())\r\n a=a+abs(s-b)\r\n a=a+1\r\n b=s\r\n if n!=1:\r\n a=a+1\r\n n=n-1\r\nprint(a)\r\n", "from collections import Counter, defaultdict\r\n\r\nBS=\"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\ndef to_base(s, b):\r\n res = \"\"\r\n while s:\r\n res+=BS[s%b]\r\n s//= b\r\n return res[::-1] or \"0\"\r\nalpha = \"abcdefghijklmnopqrstuvwxyz\"\r\nfrom math import floor, ceil,pi\r\n\r\n\r\n\r\nn = int(input())\r\nnums = [int(input()) for i in range(n)]\r\n\r\ntot = 0\r\n\r\npos = 0\r\nheight = 0\r\nwhile pos < len(nums):\r\n\r\n cur = nums[pos]\r\n tot += (cur-height)+1\r\n height = cur\r\n #print(pos, tot, height)\r\n if pos == len(nums)-1:\r\n break\r\n else:\r\n ne = nums[pos+1]\r\n if ne < height:\r\n tot += height-ne\r\n height = ne\r\n tot += 1\r\n pos += 1\r\n #print(pos, tot)\r\nprint(tot)\r\n", "i=0\r\nans=0\r\npast=0\r\nfor x in range(int(input())):\r\n n=int(input())\r\n if i==0:\r\n ans=n+1\r\n past=n\r\n ##print(ans)\r\n else:\r\n ans+=abs(past-n)+2\r\n ##print(ans)\r\n i+=1\r\n past=n\r\nprint(ans)", "n = int(input())\r\na = [0] * n\r\nfor i in range(n):\r\n a[i] = int(input())\r\nans = 0\r\nprev = 0\r\nfor i in range(n):\r\n if prev >= a[i]:\r\n ans += 2 + prev - a[i]\r\n else:\r\n ans += 2 + a[i] - prev\r\n prev = a[i]\r\nprint(ans - 1)", "temp = 0\r\nc,jump,eat = 0,1,1\r\nfor i in range(int(input())):\r\n n = int(input())\r\n if i == 0:\r\n c += n + eat\r\n temp = n \r\n else:\r\n if temp > n:\r\n c += (temp-n)\r\n c += jump\r\n c += eat\r\n else:\r\n c += jump\r\n c += (n-temp) + eat\r\n temp = n\r\nprint(c)\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "k=[]\r\nfor i in range(int(input())):\r\n k.append(int(input()))\r\nc=k[0]+len(k)\r\nfor i in range(1,len(k)):\r\n c+=abs(k[i]-k[i-1])+1\r\nprint(c)\r\n", "n = int(input())\r\ncur = 0 \r\nans = 0 \r\nfor tests in range(n):\r\n val = int(input())\r\n ans += abs(cur - val) + 1 \r\n cur = val \r\nprint(ans + (n - 1))\r\n\r\n ", "n = int(input())\r\na = [int(input()) for i in range(n)]\r\nans = a[0] + 1\r\n \r\nfor i in range(1, n):\r\n ans += abs(a[i] - a[i - 1]) + 2\r\n \r\nprint(ans)", "t= int(input())\r\ntime= t + t -1\r\nh0= 0\r\nfor i in range(t):\r\n h=int(input())\r\n time+= abs(h-h0)\r\n h0= h\r\nprint(time) \r\n ", "a=int(input())\r\nz=0\r\nc=0\r\nfor i in range(a):\r\n b=int(input())\r\n c=c+abs(b-z)+1\r\n z=b\r\nc=c+a-1\r\nprint(c)\r\n \r\n", "n=int(input())\r\nmat=[]\r\nfor i in range(n):\r\n mat.append(int(input()))\r\nans=0\r\nfor i in range(n):\r\n if i==0:\r\n ans=ans+mat[i]+1\r\n else:\r\n ans=ans+abs(mat[i]-mat[i-1])+2\r\nprint(ans)", "t = []\r\nx = int(input())\r\nfor _ in range(x):\r\n t.append(int(input()))\r\nsum = t[0]\r\nn = 0\r\nwhile n < x:\r\n if n+1 < x:\r\n sum += abs(t[n] - t[n+1])+1\r\n n += 1\r\nsum += x\r\nprint(sum)", "n=int(input())\r\ntime=2*n-1\r\nh0=0\r\nwhile(n>0):\r\n h=int(input())\r\n time+=abs(h-h0)\r\n h0=h\r\n n-=1\r\nprint(time)", "n=int(input())\r\nheight=[]\r\nfor _ in range(n):\r\n height.append(int(input()))\r\ntime=height[0]+1\r\nlasth=height[0]\r\nfor i in range(1,n):\r\n\r\n time+=2+abs(height[i]-lasth)\r\n lasth=height[i]\r\nprint(time)", "t=int(input())\nh=[]\nfor _ in range(t):\n x=int(input())\n h.append(x)\nc=h[0]\nfor i in range(len(h)-1):\n d=abs(h[i]-h[i+1])\n c+=(d+1)\nc+=t \nprint(c)\n \n ", "import sys\r\ninputlist=sys.stdin.readlines()\r\nnumber_of_numbers=int(inputlist[0])\r\ntotal_value=0\r\nvalue_before=0\r\nfor i in range(1,number_of_numbers+1):\r\n\tvalue_now=int(inputlist[i])\r\n\tdiff=abs(value_now-value_before)\r\n\ttotal_value=total_value+diff\r\n\tvalue_before=value_now\r\nprint(total_value+2*number_of_numbers-1)", "n = int(input())\r\nl = []\r\nfor _ in range(n):\r\n l.append(int(input()))\r\ns = 0\r\ns += l[0]+1\r\nfor i in range(1,n):\r\n if l[i] > l[i-1]:\r\n s = s + l[i]-l[i-1] + 2\r\n else:\r\n s = s + l[i-1] - l[i] + 2\r\nprint(s)\r\n ", "s=0;c=0\r\nfor _ in \" \"*int(input()):a=int(input());s+=abs(c-a)+2;c=a\r\nprint(s-1)\r\n", "n=int(input())\r\nt=[]\r\nfor j in range (n):\r\n l=int(input())\r\n t.append(l)\r\n \r\ncount=0\r\nfor i in range (n-1):\r\n m=abs(t[i]-t[i+1])\r\n count=count+m\r\n \r\nprint(count+n+t[0]+n-1) ", "from sys import stdin\r\n\r\nres = 0\r\ncur = 0\r\nfor i in range(int(stdin.readline())):\r\n n = int(stdin.readline())\r\n res += abs(n-cur) + 1 + (i > 0)\r\n cur = n\r\nprint(res)\r\n\r\n\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nc, h = 0, 0\r\nk = int(input())\r\nfor _ in range(k):\r\n n = int(input())\r\n c += abs(n - h) + 1\r\n h += n - h\r\n\r\nprint(c+k-1)\r\n", "n=int(input())\r\nans=2*n-1\r\npre=0\r\nfor i in range(n):\r\n\tcur=int(input())\r\n\tans+=abs(cur-pre)\r\n\tpre=cur\r\nprint(ans)", "n=int(input())\r\nl=[]\r\nfor __ in range(n):\r\n\ta=int(input())\r\n\tl.append(a)\r\n\r\nans=2*n-1\r\nans+=l[0]\r\n\r\nfor i in range(n-1):\r\n\tans+=abs(l[i+1]-l[i])\r\n\r\nprint(ans)", "n=int(input())\r\nm=int(input())\r\n\r\ns=0\r\ns+=m+1\r\nfor i in range(n-1):\r\n a=int(input())\r\n if(a>=m):\r\n s+=a-m+2\r\n else:\r\n s+=m-a+2\r\n m=a\r\nprint(s)\r\n", "N = int(input())\nhts = [0]\nfor i in range(N):\n hts.append(int(input()))\n\njmp_time = N-1\neat_time = N\nmove_time = 0 \nfor i in range(N):\n move_time+=abs(hts[i]-hts[i+1])\n\ntot_time = jmp_time + eat_time + move_time\nprint(tot_time)\n", "def get_ints():\r\n return map(int, input().strip().split())\r\n\r\ndef get_list():\r\n return list(map(int, input().strip().split()))\r\n\r\ndef get_string():\r\n return input().strip()\r\n\r\n# n = int(input())\r\n# arr = [int(x) for x in input().split()]\r\nn = int(input().strip())\r\narr = []\r\n\r\nfor i in range(n):\r\n arr.append(int(input().strip()))\r\n\r\ntime = arr[0] + 1\r\nfor i in range(1,n):\r\n time += (abs(arr[i] - arr[i-1]) + 2)\r\n \r\nprint(time)\r\n ", "n=int(input())\r\nl=[]\r\ncount=0\r\nfor i in range (n):\r\n l.append(int(input()))\r\n if i==0:\r\n count=l[0]+1\r\n elif l[i]>l[i-1]:\r\n count=count+1+(l[i]-l[i-1])+1\r\n elif l[i]<l[i-1]:\r\n count=count+(l[i-1]-l[i])+1+1\r\n else:\r\n count=count+2\r\nprint(count)", "import sys\r\ninput = sys.stdin.readline\r\nn = int(input())\r\nx = int(input())\r\ncount = x+1\r\nwhile n-1:\r\n n-=1\r\n y = int(input())\r\n count+=abs(x-y)+2\r\n x = y\r\nprint(count)" ]

[ "from sys import stdin, stdout\r\n\r\ndef main():\r\n R = stdin.readline\r\n #f = open('input.txt');R = f.readline\r\n W = stdout.write\r\n\r\n ans = []\r\n \r\n offline_k = {}\r\n for i in range(1, 10**6+1):\r\n if i > 9: \r\n n, product = i, 1\r\n while n:\r\n rem = n%10\r\n n //= 10\r\n if rem != 0:\r\n product *= rem\r\n\r\n offline_k[i] = offline_k[product]\r\n\r\n else:\r\n offline_k[i] = i\r\n\r\n cumsum = {}\r\n for i in range(1, 10):\r\n cumsum[i] = [0]\r\n\r\n for i in range(1, 10**6+1):\r\n for j in range(1, 10):\r\n cumsum[j].append(cumsum[j][i-1])\r\n\r\n if offline_k[i] == j:\r\n cumsum[j][i] += 1 \r\n\r\n for i in range(int(R())):\r\n l, r, k = [int(x) for x in R().split()]\r\n ans.append(str(cumsum[k][r] - cumsum[k][l-1]))\r\n\r\n W('\\n'.join(ans))\r\n return 0\r\n \r\nmain()", "from sys import stdin\r\nfrom bisect import *\r\n\r\ndef f(n):\r\n p = 1\r\n while n:\r\n r = n % 10\r\n if r:\r\n p *= r\r\n n //= 10\r\n return p\r\ngcache = [0] * 1000001\r\na = [[] for i in range(10)]\r\nfor i in range(1, 10):\r\n gcache[i] = i\r\n a[i].append(i)\r\nfor i in range(10, 1000001):\r\n z = f(i)\r\n gcache[i] = gcache[z]\r\n a[gcache[z]].append(i)\r\n\r\n\r\ninput()\r\nanswer = []\r\nfor line in stdin:\r\n l, r, k = map(int, line.split())\r\n z = bisect_right(a[k], r) - bisect_left(a[k], l)\r\n answer.append(str(z))\r\nprint('\\n'.join(answer))", "from sys import stdin\r\nfrom bisect import *\r\n\r\ndef g(n):\r\n while n >= 10:\r\n p = 1\r\n while n:\r\n if r := n % 10:\r\n p *= r\r\n n //= 10\r\n n = p\r\n return n\r\n# gcache = [0] * 1000001\r\na = [[] for i in range(10)]\r\nfor i in range(1, 1000001):\r\n a[g(i)].append(i)\r\n\r\n\r\ninput()\r\nanswer = []\r\nfor line in stdin:\r\n l, r, k = map(int, line.split())\r\n z = bisect_right(a[k], r) - bisect_left(a[k], l)\r\n answer.append(str(z))\r\nprint('\\n'.join(answer))", "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\nMAX_N = 10 ** 6 + 1\r\n\r\ndef f(x):\r\n ans = 1\r\n for c in str(x):\r\n if c != \"0\":\r\n ans *= int(c)\r\n return ans\r\n\r\ng = [i for i in range(10)]\r\nprefixes = [[0] for _ in range(10)]\r\nfor i in range(10, MAX_N):\r\n g.append(g[f(i)])\r\n\r\nfor i in range(1, MAX_N):\r\n for j in range(1, 10):\r\n prefixes[j].append(prefixes[j][-1])\r\n prefixes[g[i]][-1] += 1 \r\n\r\nq = int(input())\r\nfor _ in range(q):\r\n l, r, k = ints()\r\n print(prefixes[k][r] - prefixes[k][l - 1])\r\n\r\n", "z,zz=input,lambda:list(map(int,z().split()))\r\nfast=lambda:stdin.readline().strip()\r\nzzz=lambda:[int(i) for i in fast().split()]\r\nszz,graph,mod,szzz=lambda:sorted(zz()),{},10**9+7,lambda:sorted(zzz())\r\nfrom string import *\r\nfrom re import *\r\nfrom collections import *\r\nfrom queue import *\r\nfrom sys import *\r\nfrom collections import *\r\nfrom math import *\r\nfrom heapq import *\r\nfrom itertools import *\r\nfrom bisect import *\r\nfrom collections import Counter as cc\r\nfrom math import factorial as f\r\nfrom bisect import bisect as bs\r\nfrom bisect import bisect_left as bsl\r\nfrom itertools import accumulate as ac\r\ndef lcd(xnum1,xnum2):return (xnum1*xnum2//gcd(xnum1,xnum2))\r\ndef prime(x):\r\n p=ceil(x**.5)+1\r\n for i in range(2,p):\r\n if (x%i==0 and x!=2) or x==0:return 0\r\n return 1\r\ndef dfs(u,visit,graph):\r\n visit[u]=1\r\n for i in graph[u]:\r\n if not visit[i]:\r\n dfs(i,visit,graph)\r\n\r\n###########################---Test-Case---#################################\r\n\"\"\"\r\n\r\n If you Know me , Then you probably don't know me !\r\n\r\n\r\n\"\"\"\r\n###########################---START-CODING---##############################\r\n\r\n\r\n\r\n\r\nans='';z1=[[]]\r\ndef gh(x):\r\n if x<10: return x\r\n p=1\r\n while x:\r\n if x%10:p*=(x%10)\r\n x//=10\r\n return gh(p)\r\nfor i in range(9):z1+=[[0]*(1000001)]\r\nfor i in range(1,1000001):z1[gh(i)][i]+=1\r\nfor i in range(1,10):\r\n for j in range(1,1000001):z1[i][j]+=z1[i][j-1]\r\nfor _ in \" \"*int(stdin.readline()):\r\n a,b,c=map(int,stdin.readline().split());print(z1[c][b]-z1[c][a-1])\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n", "from sys import stdin\nfrom itertools import accumulate\n\n\ndef main():\n n, N = int(input()), 1000001\n cache = [0] * N\n for i in range(10):\n cache[i] = i\n for i in range(10, N):\n x, d = i // 10, i % 10 or 1\n while x:\n d *= x % 10 or 1\n x //= 10\n cache[i] = cache[d]\n l, iii = stdin.read().splitlines(), [[] for _ in range(9)]\n tmp = [ii.append for ii in iii]\n for i, s in enumerate(l):\n tmp[ord(s[-1]) - 49](i)\n for d, ii in enumerate(iii, 1):\n if ii:\n dp = list(accumulate(e == d for e in cache))\n for i in ii:\n s, t = l[i][:-2].split()\n l[i] = str(dp[int(t)] - dp[int(s) - 1])\n print('\\n'.join(l))\n\n\nif __name__ == '__main__':\n main()\n", "import sys\r\ninput = sys.stdin.buffer.readline \r\n\r\n\r\nd = [i for i in range(10)]\r\nfor i in range(10, 10**6+1):\r\n entry = 1\r\n for x in str(i):\r\n if x != '0':\r\n entry*=int(x)\r\n d.append(d[entry])\r\n \r\nS = [[0] for i in range(10)]\r\nfor i in range(1, 10**6+1):\r\n for j in range(10):\r\n S[j].append(S[j][-1])\r\n x = d[i]\r\n S[x][-1]+=1\r\n\r\nQ = int(input())\r\nfor i in range(Q):\r\n l, r, k = [int(x) for x in input().split()]\r\n print(S[k][r]-S[k][l-1]) ", "import sys\r\ninput=sys.stdin.readline\r\ndef getproduct(n):\r\n if n==0:\r\n return 1\r\n elif n%10==0:\r\n return getproduct(n//10)\r\n else:\r\n return n%10*getproduct(n//10)\r\nprefix=[1 for i in range(10**6+1)]\r\nfor i in range(10):\r\n prefix[i]=i\r\nfor i in range(10,10**6+1):\r\n prefix[i]=prefix[getproduct(i)]\r\none=[0 for i in range(10**6+1)]\r\ntwo=[0 for i in range(10**6+1)]\r\nthree=[0 for i in range(10**6+1)]\r\nfour=[0 for i in range(10**6+1)]\r\nfive=[0 for i in range(10**6+1)]\r\nsix=[0 for i in range(10**6+1)]\r\nseven=[0 for i in range(10**6+1)]\r\neight=[0 for i in range(10**6+1)]\r\nnine=[0 for i in range(10**6+1)]\r\nd={1:one,2:two,3:three,4:four,5:five,6:six,7:seven,8:eight,9:nine}\r\nfor i in range(1,10**6+1):\r\n d[prefix[i]][i]=1\r\nfor i in range(1,10**6+1):\r\n one[i]+=one[i-1]\r\n two[i]+=two[i-1]\r\n three[i]+=three[i-1]\r\n four[i]+=four[i-1]\r\n five[i]+=five[i-1]\r\n six[i]+=six[i-1]\r\n seven[i]+=seven[i-1]\r\n eight[i]+=eight[i-1]\r\n nine[i]+=nine[i-1]\r\nq=int(input())\r\nfor _ in range(q):\r\n l,r,k=map(int,input().split())\r\n if l==0:\r\n print(d[k][r])\r\n else:\r\n print(d[k][r]-d[k][l-1])\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nq = int(input())\r\nm = pow(10, 6) + 5\r\ndp = [0] * m\r\nfor i in range(1, 10):\r\n dp[i] = i\r\nfor i in range(10, m):\r\n k = 1\r\n for j in str(i):\r\n k *= max(1, int(j))\r\n dp[i] = dp[k]\r\ncnt = [[0] * m for _ in range(10)]\r\nfor i in range(1, m):\r\n cnt[dp[i]][i] = 1\r\nfor i in range(1, 10):\r\n c = cnt[i]\r\n for j in range(1, m):\r\n c[j] += c[j - 1]\r\nans = []\r\nfor _ in range(q):\r\n l, r, k = map(int, input().split())\r\n ans0 = cnt[k][r] - cnt[k][l - 1]\r\n ans.append(ans0)\r\nsys.stdout.write(\"\\n\".join(map(str, ans)))", "import sys\ninput = sys.stdin.readline\n\ndef f(n):\n if n < 10: return n\n s = 1\n while n:\n r = n % 10\n if r:\n s *= r\n n //= 10\n return f(s)\n\nd = [[0] * (10**6+1) for _ in range(10)]\nfor i in range(1, 10**6+1):\n d[f(i)][i] += 1\n\nfor i in range(1, 10):\n for j in range(1, 10**6+1):\n d[i][j] += d[i][j-1]\n\nfor _ in range(int(input())):\n l, r, k = map(int, input().split())\n print(d[k][r] - d[k][l-1])" ]

[ "from collections import deque\r\n\r\n\r\n# Find all the vertices inside a connected component.\r\ndef DFS(v):\r\n index = len(cc) - 1 # Obtain the index of this connected component.\r\n cc[index].append(v) # Add this vertex to the list of this connected component.\r\n visited[v] = True # Mark this vertex as visited.\r\n\r\n # For each adjacent of this vertex, if it has not been visited, we call recursive\r\n # on it to visit its subtree.\r\n for w in G[v]:\r\n if not visited[w] and visitable[w]:\r\n DFS(w)\r\n\r\n\r\n# Computes the dp matrix values.\r\ndef DFS_DP(v, father, dp):\r\n size = 1 # Size of the tree rooted at v (until the child visited at this time).\r\n\r\n # DP base cases.\r\n dp[v][0] = 1\r\n dp[v][1] = 0\r\n\r\n # For each w child of v.\r\n for w in G[v]:\r\n # If w is not the father of v.\r\n if w != father and visitable[w]:\r\n # Then, make a recursive call on w, to compute the dp tensor values\r\n # corresponding to w, and the size of the subtree rooted at w.\r\n w_size = DFS_DP(w, v, dp)\r\n\r\n # Clean this dp section for incoming calculations.\r\n # TODO: explain this.\r\n for i in range(w_size + 1):\r\n dp[v][i + size] = 0\r\n\r\n # As a new child has visited, update the size of the subtree rooted at v.\r\n size += w_size\r\n\r\n # For every possible number of vertices that can be removed between the first k children.\r\n for i in range(size, 0, -1):\r\n # Of these, for every possible number of vertices that can be removed in the k-th child.\r\n for j in range(1, min(i, w_size) + 1):\r\n # The number of ways to remove i vertices from the tree rooted at v\r\n # removing them from its first k children at most, is the number of\r\n # ways to remove j of them from the subtree rooted at the k-th child,\r\n # in any way, multiplied by the number of ways to remove the remaining\r\n # i-j in the first k-1 children, for every possible j.\r\n # TODO: comment why C[i][j] is necessary to count the ways of merging\r\n # TODO: the order of deleting the j first vertices with the order of\r\n # TODO: deleting the remaining i-j.\r\n dp[v][i] = (dp[v][i] + (C[i][j] * (dp[v][i - j] * dp[w][j] % mod) % mod)) % mod\r\n\r\n # The number of ways to remove all vertices from the tree rooted at v\r\n # removing them from any of the children, is the number of ways to remove\r\n # al vertices except this one from any of the children, and then remove this one.\r\n dp[v][size] = dp[v][size - 1]\r\n\r\n # Return the size of the tree rooted at v.\r\n return size\r\n\r\n\r\n# Calculate the solutions for one connected component, starting at a given root.\r\ndef root_calculate(root, dp, accum):\r\n # Calculate the dp solution for this component starting from the root.\r\n size = DFS_DP(root, -1, dp)\r\n\r\n # For each of the possible sizes i, increase accum[i] with the number of ways\r\n # to remove i vertices from the graph, starting from the root.\r\n for i in range(size + 1):\r\n accum[i] = (accum[i] + dp[root][i]) % mod\r\n\r\n\r\n# Calculate the solutions for one connected component.\r\ndef calculate(index):\r\n size = len(cc[index]) # Amount of vertices in this connected component.\r\n root = cc[index][0] # Root of this connected component.\r\n accum = [0] * (n + 1) # Array of dp accumulated solutions.\r\n\r\n # DP three-dimensional tensor.\r\n # DP[v][i][k] is the number of ways to remove i vertices from the tree rooted at v,\r\n # removing them at most in the first k children of v.\r\n dp = [[0] * (n + 1) for _ in range(n + 1)]\r\n\r\n # If the root vertex is special (adjoins a cycle), it is obligatory root.\r\n if special[root]:\r\n root_calculate(root, dp, accum)\r\n\r\n # If the vertex x is not special, and therefore is not obligatory root,\r\n # calculate the solution for all possible roots.\r\n else:\r\n for v in cc[index]:\r\n root_calculate(v, dp, accum)\r\n\r\n # Divide f[i] by max(1, size - i) to eliminate repetitions in the count.\r\n for i in range(size):\r\n accum[i] = accum[i] * inv[size - i] % mod\r\n\r\n return accum\r\n\r\n\r\n# Auxiliary method of preparation for subsequent calculations.\r\ndef prepare():\r\n # Calculate all combinations for al pairs (i, j), 0 <= i <= j <= n.\r\n # C(i 0) is 1, for all i.\r\n for i in range(n + 1):\r\n C[i][0] = 1\r\n # C(i j) = C(i-1 j-1) + C(i-1 j)\r\n for i in range(1, n + 1):\r\n for j in range(1, n + 1):\r\n C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % mod\r\n\r\n # Calculate all modular inverses from 1 to n.\r\n inv[1] = 1\r\n for i in range(2, n + 1):\r\n inv[i] = (mod - mod // i) * inv[mod % i] % mod\r\n\r\n # Use the topological sort algorithm, to identify the vertices v that do not belong to any cycle\r\n # (visitable[v] = true), those that belong (visitable[v] = false) and, of the latter, those that\r\n # are adjacent to vertices that belong to a cycle (degree[v] == 1).\r\n q = deque() # Topological sort queue.\r\n degree = [0] * n # Degrees of the vertices.\r\n\r\n # For each vertex of the graph.\r\n for v in range(n):\r\n degree[v] = len(G[v]) # Calculate the degree of this vertex.\r\n if degree[v] < 2:\r\n q.append(v) # If the degree is one or lower, add this vertex to the order.\r\n\r\n # As long as there are vertices in the topological order.\r\n while len(q) > 0:\r\n v = q.popleft() # Take the first vertex and remove it from graph.\r\n visitable[v] = True # Mark this vertex as one that does not belong to cycle.\r\n\r\n # To simulate the removal of this vertex from the graph, decrease by one the degree\r\n # of all its adjacent.\r\n for w in G[v]:\r\n degree[w] -= 1\r\n # If the degree becomes one or lower, add this vertex to the order.\r\n if degree[w] < 2 and not visitable[w]:\r\n q.append(w)\r\n\r\n # All vertices that maintain degree one, after all the removable vertices in topological order\r\n # were eliminated, are vertices adjacent to vertices belonging to cycle.\r\n for i in range(n):\r\n special[i] = (degree[i] == 1)\r\n\r\n # Now, calculate the connected components of the graph, resulting from removing from the graph\r\n # all vertices belonging to cycle.\r\n\r\n # For convenience, iterate first over the special vertices, because these are the ideal roots\r\n # for the subsequent algorithm.\r\n for v in range(n):\r\n if special[v]:\r\n cc.append([])\r\n DFS(v)\r\n\r\n # Once all the connected components of the vertices adjacent to cycles have been found,\r\n # proceed to find all the components to which the rest of the vertices belong.\r\n for v in range(n):\r\n if not visited[v] and visitable[v]:\r\n cc.append([])\r\n DFS(v)\r\n\r\n\r\n# Calculate the solutions for all i, 0 <= i <= n.\r\ndef solve():\r\n c = len(cc) # Amount of connected components.\r\n size = 0 # Amount of visited vertices.\r\n\r\n # Array of solutions for all i, 0 <= i <= n.\r\n # sol[i][k] is the number of ways to remove i vertices from the graph,\r\n # removing them at most in the first k connected components.\r\n sol = [0] * (n + 1) # List of solutions for all i, 0 <= i <= n;\r\n sol[0] = 1 # DP base case.\r\n\r\n # For each component, calculate the solution.\r\n for k in range(1, c + 1):\r\n if len(cc[k - 1]) > 0:\r\n accum = calculate(k - 1) # Array of dp accumulated solutions.\r\n\r\n # Increase the number of visited vertices by the number of vertices of this connected component.\r\n c_size = len(cc[k - 1])\r\n size += c_size\r\n\r\n # The calculation of the dp2 applies the same logic as the dp.\r\n # TODO: comment why C[i][j] is necessary to count the ways of merging\r\n # TODO: the order of deleting the j first vertices with the order of\r\n # TODO: deleting the remaining i-j.\r\n for i in range(size, 0, -1):\r\n for j in range(1, min(i, c_size) + 1):\r\n sol[i] = (sol[i] + (C[i][j] * (sol[i - j] * accum[j] % mod) % mod)) % mod\r\n\r\n # Return the solution.\r\n return sol\r\n\r\n\r\n# Read the amount of vertices and edges of the graph from input.\r\nn, m = [int(data) for data in input().split()[0: 2]]\r\n\r\n# Graph.\r\nG = [[] for _ in range(n)]\r\n\r\n# List of connected components.\r\ncc = []\r\n\r\nC = [[0] * (n + 1) for _ in range(n + 1)] # Matrix of combinations: C[i][j] = C(i j).\r\ninv = [0] * (n + 1) # Modular inverses from 1 to n.\r\nvisited = [0] * n # Array of DFS visited vertices.\r\nvisitable = [0] * n # Determine whether a vertex belongs to a cycle.\r\nspecial = [0] * n # Determine if a vertex that doesn't belong to a cycle is adjacent to another that if it is.\r\n\r\nmod = 1000000009 # Modulo of the solution.\r\n\r\n# Read the graph from input.\r\nfor _ in range(m):\r\n x, y = [int(data) - 1 for data in input().split()[0: 2]] # Read an edge.\r\n G[x].append(y), G[y].append(x) # Add the edge to the graph.\r\n\r\nprepare() # Prepare the conditions for subsequent calculations.\r\nans = solve() # Calculate the solutions for all i, 0 <= i <= n.\r\n\r\n# Print all solutions.\r\nprint(\"\\n\".join([str(data) for data in ans]))\r\n", "md = 1000000009\r\ndef add(a, b):\r\n a += b\r\n if a >= md:\r\n a -= md\r\n return a\r\ndef mul(a, b):\r\n return (a * b) % md\r\ndef pw(a, b):\r\n res = 1\r\n while b > 0:\r\n if b & 1:\r\n res = mul(res, a)\r\n b >>= 1\r\n a = mul(a, a)\r\n return res\r\nN = 444\r\nsz = [0] * N\r\nf = [[0] * N for _ in range(N)]\r\nnf = [0] * N\r\npv = [0] * N\r\nc = [[0] * N for _ in range(N)]\r\nn = 0\r\nng = [[] for _ in range(N)]\r\ncan = [False] * N\r\ndef solve(v, pr):\r\n sz[v] = 0\r\n f[v][0] = 1\r\n cc = len(ng[v])\r\n for jj in range(cc):\r\n j = ng[v][jj]\r\n if j == pr or not can[j]:\r\n continue\r\n solve(j, v)\r\n for q in range(sz[v] + sz[j] + 1):\r\n nf[q] = 0\r\n for q in range(sz[v] + 1):\r\n for r in range(sz[j] + 1):\r\n nf[q + r] = add(nf[q + r], mul(mul(f[v][q], f[j][r]), c[q + r][r]))\r\n for q in range(sz[v] + sz[j] + 1):\r\n f[v][q] = nf[q]\r\n sz[v] += sz[j]\r\n sz[v] += 1\r\n f[v][sz[v]] = f[v][sz[v] - 1]\r\ng = [[] for _ in range(N)]\r\nx = [0] * N\r\nans = [0] * N\r\nnans = [0] * N\r\ncount_list = [0] * (N + 2)\r\nwas = [False] * N\r\nfor i in range(N):\r\n for j in range(N):\r\n if j == 0:\r\n c[i][j] = 1\r\n elif i == 0:\r\n c[i][j] = 0\r\n else:\r\n c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % md\r\nn, m = map(int, input().split())\r\nfor i in range(n):\r\n g[i].clear()\r\n ng[i].clear()\r\nfor i in range(m):\r\n foo, bar = map(int, input().split())\r\n foo -= 1\r\n bar -= 1\r\n g[foo].append(bar)\r\n g[bar].append(foo)\r\nfor i in range(n):\r\n can[i] = False\r\n pv[i] = -1\r\nwhile True:\r\n found = False\r\n for i in range(n):\r\n if not can[i]:\r\n count = 0\r\n who = -1\r\n for j in range(len(g[i])):\r\n u = g[i][j]\r\n if can[u]:\r\n continue\r\n count += 1\r\n who = u\r\n if count <= 1:\r\n can[i] = True\r\n found = True\r\n if who != -1:\r\n ng[i].append(who)\r\n ng[who].append(i)\r\n break\r\n if not found:\r\n break\r\nfor i in range(n):\r\n was[i] = not can[i]\r\nfor i in range(n + 1):\r\n ans[i] = 0\r\nans[0] = 1\r\nfor i in range(n):\r\n if was[i]:\r\n continue\r\n b = 0\r\n e = 0\r\n x[0] = i\r\n was[i] = True\r\n root = -1\r\n while b <= e:\r\n for j in range(len(ng[x[b]])):\r\n u = ng[x[b]][j]\r\n if not can[u]:\r\n root = x[b]\r\n if was[u]:\r\n continue\r\n e += 1\r\n x[e] = u\r\n was[u] = True\r\n b += 1\r\n if root == -1:\r\n for k in range(e + 2):\r\n count_list[k] = 0\r\n for j in range(e + 1):\r\n solve(x[j], -1)\r\n for k in range(e + 2):\r\n count_list[k] = add(count_list[k], f[x[j]][k])\r\n for k in range(e + 2):\r\n coeff = e + 1 - k\r\n if coeff == 0:\r\n coeff = 1\r\n count_list[k] = mul(count_list[k], pw(coeff, md - 2))\r\n else:\r\n solve(root, -1)\r\n for k in range(e + 2):\r\n count_list[k] = f[root][k]\r\n for k in range(n + 1):\r\n nans[k] = 0\r\n for k in range(e + 2):\r\n for q in range(n - k + 1):\r\n nans[k + q] = add(nans[k + q], mul(c[k + q][k], mul(count_list[k], ans[q])))\r\n for k in range(n + 1):\r\n ans[k] = nans[k]\r\nfor k in range(n + 1):\r\n print(ans[k])# 1694815267.5073566" ]

[ "def solve(s):\r\n TYPES = ['A', 'C', 'G', 'T']\r\n\r\n letterToCount = {}\r\n for ch in s:\r\n if ch != '?':\r\n letterToCount[ch] = letterToCount.get(ch, 0) + 1\r\n\r\n if len(s) % 4 != 0 or any(count * 4 > len(s) for count in letterToCount.values()):\r\n return \"===\"\r\n\r\n result = []\r\n for ch in s:\r\n if ch == '?':\r\n for typ in TYPES:\r\n if letterToCount.get(typ, 0) * 4 != len(s):\r\n result.append(typ)\r\n letterToCount[typ] = letterToCount.get(typ, 0) + 1\r\n break\r\n else:\r\n result.append(ch)\r\n\r\n return ''.join(result)\r\n\r\n_ = int(input())\r\ns = input()\r\nprint(solve(s))", "l=int(input())\r\na=input()\r\nif l%4!=0:\r\n print('===')\r\nelse:\r\n z=a.count('A')\r\n x=a.count('C')\r\n c=a.count('G')\r\n v=a.count('T')\r\n t=l//4\r\n if max(z,x,c,v)>t:\r\n print('===')\r\n else:\r\n while z<t:\r\n a=a[:a.index('?')]+'A'+a[a.index('?')+1:]\r\n z+=1\r\n while x<t:\r\n a=a[:a.index('?')]+'C'+a[a.index('?')+1:]\r\n x+=1\r\n while c<t:\r\n a=a[:a.index('?')]+'G'+a[a.index('?')+1:]\r\n c+=1\r\n while v<t:\r\n a=a[:a.index('?')]+'T'+a[a.index('?')+1:]\r\n v+=1\r\n print(a)\r\n", "def Count(string, number):\n number //=4\n lists = list(string)\n a = number - lists.count('A')\n c = number - lists.count('C')\n g = number - lists.count('G')\n t = number - lists.count('T')\n return [a, c, g, t]\n\ndef Check(string, number):\n if not (number % 4 == 0):\n return False\n \n lists = Count(string, number)\n\n for i in lists:\n if i<0:\n return False\n\n return True\n\ndef Lacks(string, number):\n num = Count(string, number)\n lists = [['A'], ['C'], ['G'], ['T']]\n lacklist = []\n for m, n in zip(num, lists):\n lacklist += m*n\n\n return lacklist\n\ndef Answer(string, number):\n string = list(string)\n lack = Lacks(string, number)\n \n length = -1\n for i in string:\n length += 1\n if i == '?':\n string[length] = lack.pop()\n\n return ''.join(string)\n \n\nwhile True:\n try:\n number = int(input())\n string = input()\n\n if not Check(string, number):\n print('===')\n else:\n print(Answer(string, number))\n except EOFError:\n break\n\n \t \t\t\t\t\t \t\t\t\t\t\t\t \t \t\t\t", "from sys import exit\r\n\r\nvalidChars = ['A', 'G', 'C', 'T']\r\nfreq = {}\r\n\r\nlength = int(input())\r\ngenome = list(input())\r\n\r\nif length % 4 != 0:\r\n print('===')\r\n exit()\r\n\r\nfor c in validChars:\r\n freq[c] = 0\r\n\r\nfor c in genome:\r\n if c in validChars:\r\n freq[c] = freq[c] + 1\r\n\r\nfor c in validChars:\r\n if freq[c] > (length // 4):\r\n print('===')\r\n exit()\r\n\r\nfor i in range(0, length):\r\n if genome[i] == '?':\r\n filled = False\r\n for c in validChars:\r\n if (not filled) and (freq[c] < (length // 4)):\r\n filled = True\r\n genome[i] = c\r\n freq[c] = freq[c] + 1\r\n \r\n\r\nprint(\"\".join(genome))\r\n", "def main():\r\n n = int(input().strip())\r\n st = input().strip()\r\n if n%4:\r\n print('===')\r\n return\r\n li = [0] * 5\r\n t = n//4\r\n for i in st:\r\n if i=='?':\r\n li[0] += 1\r\n elif i=='A':\r\n li[1] += 1\r\n elif i=='C':\r\n li[2] += 1\r\n elif i=='G':\r\n li[3] += 1\r\n else:\r\n li[4] += 1\r\n\r\n for i in li[1:]:\r\n if i > t:\r\n print('===')\r\n return\r\n string = ''\r\n for i in st:\r\n d = i\r\n if d=='?':\r\n for p in range(1, 5):\r\n if li[p] < t:\r\n li[p] += 1\r\n if p==1:\r\n d = 'A'\r\n elif p==2:\r\n d = 'C'\r\n elif p==3:\r\n d = 'G'\r\n else:\r\n d = 'T'\r\n break\r\n string += d\r\n print(string)\r\n\r\nmain()\r\n", "from array import array\r\n\r\nn = int(input())\r\ng = input()\r\nif n % 4 == 0:\r\n gnome = array('u', list(g))\r\n\r\n thr = n/4\r\n indx_q = []\r\n chk = {'A': 0, 'C': 0, 'G': 0, 'T': 0}\r\n for i in range(len(gnome)):\r\n if gnome[i] == '?':\r\n indx_q.append(i)\r\n else:\r\n chk[gnome[i]] += 1\r\n\r\n if chk['A'] > thr or chk['C'] > thr or chk['G'] > thr or chk['T'] > thr:\r\n print('===')\r\n else:\r\n for key, value in chk.items():\r\n for _ in range(int(thr-value)):\r\n gnome[indx_q.pop()] = key\r\n print(''.join(list(gnome)))\r\n\r\nelse:\r\n print('===')\r\n", "n = int(input())\r\na = input()\r\nA= n//4\r\nG=A\r\nC=A\r\nT=A\r\nif n%4 != 0:\r\n print(\"===\")\r\nelse:\r\n for i in range(n):\r\n if a[i] == 'A':\r\n A-=1\r\n elif a[i]== 'G':\r\n G-=1\r\n elif a[i]=='C':\r\n C-=1\r\n elif a[i]=='T':\r\n T-=1\r\n if A<0 or G<0 or C<0 or T<0:\r\n print(\"===\")\r\n else:\r\n a=list(a)\r\n for i in range(n):\r\n if a[i]=='?' :\r\n if A>0:\r\n a[i]='A'\r\n A-=1\r\n elif G>0:\r\n a[i]='G'\r\n G-=1\r\n elif C>0:\r\n a[i]='C'\r\n C-=1\r\n elif T>0:\r\n a[i]='T'\r\n T-=1\r\n res=\"\"\r\n res = res.join(a)\r\n print(res)", "n=int(input())\ns=str(input())\nc1=s.count('A')\nc2=s.count('C')\nc3=s.count('G')\nc4=s.count('T')\nl=len(s)\nt=len(s)//4\nl1=[]\n \nfor i in s:\n l1.append(i)\nif len(s)%4!=0:\n print(\"===\")\nelse:\n for i in range(l):\n if l1[i]=='?':\n if c1<t:\n l1[i]='A'\n c1+=1\n elif c2<t:\n l1[i]='C'\n c2+=1\n elif c3<t:\n l1[i]='G'\n c3+=1\n else:\n if c4<t:\n l1[i]='T'\n c4+=1\n if c1==c2 and c1==c3 and c1==c4:\n for i in range(l):\n print(l1[i],end=\"\")\n else:\n print(\"===\")\n\n\t \t\t \t\t\t \t \t\t \t\t \t \t\t \t\t", "n = int(input())\r\ns = input()\r\n\r\na = s.count('A')\r\ng = s.count('G')\r\nc = s.count('C')\r\nt = s.count('T')\r\nqm = s.count('?')\r\n\r\nif n % 4 != 0:\r\n print(\"===\")\r\nelse:\r\n if max(a,g,c,t) > n // 4:\r\n print(\"===\")\r\n else:\r\n q = []\r\n q.extend(['A']*(n // 4 - a))\r\n q.extend(['G']*(n // 4 - g))\r\n q.extend(['C']*(n // 4 - c))\r\n q.extend(['T']*(n // 4 - t))\r\n for i in range(n):\r\n if s[i] == \"?\":\r\n print(q.pop(),end = \"\")\r\n else:\r\n print(s[i], end = \"\")", "n=int(input())\ns=list(input())\nu=n//4\n#print(u)\nca=s.count('A')\ncc=s.count('C')\ncg=s.count('G')\nct=s.count('T')\ncq=t=s.count('?')\nf=1\nif n%4!=0:\n f=0\nelse:\n #ca,cc,cg,ct=a,c,g,t\n for i in range(n):\n if s[i]=='?':\n if ca<u:\n s[i]='A'\n ca+=1\n elif cc<u:\n s[i]='C'\n cc+=1\n elif cg<u:\n s[i]='G'\n cg+=1\n elif ct<u:\n s[i]='T'\n ct+=1\n else:\n f=0\n break\nif f==0:\n print(\"===\")\nelse:\n if ca==cc==cg==ct:\n print(*s,sep=\"\")\n else:\n print(\"===\")\n \n \n\n\n'''\n'A', 'C', 'G' or 'T'\nUnrecognized = '?'\n'''\n \t \t\t \t \t \t\t \t \t \t\t", "z=int(input())\ns = input()[:z]\na = s.count('A')\nc = s.count('C')\ng = s.count('G')\nt = s.count('T')\nif(z%4!=0):\n print('===')\n exit()\nn=int(z/4)\nif a > n or c > n or g > n or t > n:\n print('===')\n exit()\ns = s.replace('?','A',n - a)\ns = s.replace('?', 'C',n - c)\ns = s.replace('?', 'G',n - g)\ns = s.replace('?', 'T',n - t)\nprint(s)\n\n \t\t \t \t\t \t\t \t \t \t\t \t \t", "n = int(input())\r\ns = input()\r\n\r\nl = { i : n//4 - s.count(i) for i in 'ACGT'}\r\nif n % 4:\r\n\tprint('===')\r\n\texit(0)\r\nfor i in l.values():\r\n\tif i < 0:\r\n\t\tprint('===')\r\n\t\texit(0)\r\ns = s.replace('?','A',l['A']).replace('?','C',l['C']).replace('?','G',l['G']).replace('?','T',l['T'])\r\nprint(''.join(s))\r\n", "n = int(input())\r\ns = input()\r\na = s.count('A')\r\nc = s.count('C')\r\ng = s.count('G')\r\nt = s.count('T')\r\nif n % 4 != 0:\r\n print(\"===\")\r\nelse:\r\n num_needed = n // 4\r\n if a > num_needed or c > num_needed or g > num_needed or t > num_needed:\r\n print(\"===\")\r\n else:\r\n for i in s:\r\n if i != \"?\":\r\n print(i, end='')\r\n else:\r\n if a < num_needed:\r\n print('A', end='')\r\n a += 1\r\n elif c < num_needed:\r\n print('C', end='')\r\n c += 1\r\n elif g < num_needed:\r\n print('G', end='')\r\n g += 1\r\n elif t < num_needed:\r\n print('T', end='')\r\n t += 1\r\n print()", "n=int(input())\r\nl=list(input())\r\na=l.count('A')\r\nc=l.count('C')\r\ng=l.count('G')\r\nt=l.count('T')\r\nma=max(a,g,c,t)\r\nfor i in range(n):\r\n if l[i]=='?':\r\n if a<ma:\r\n l[i]='A'\r\n a+=1\r\n elif c<ma:\r\n l[i]='C'\r\n c+=1\r\n elif g<ma:\r\n l[i]='G'\r\n g+=1\r\n elif t<ma: \r\n l[i]='T'\r\n t+=1\r\n else:\r\n l[i]='T'\r\n t+=1\r\n ma+=1\r\nif a<ma or c<ma or g<ma or t<ma: print('===')\r\nelse: print(''.join(l))", "n = int(input())\ns = input()\n\ndef problem4(n,s):\n\n dicti = {}\n\n if len(s)<4:\n print(\"===\")\n return\n else:\n cont = 0\n pos = []\n\n dicti[\"A\"],dicti[\"G\"],dicti[\"C\"],dicti[\"T\"] = 0,0,0,0\n\n\n for i in s:\n\n if i in dicti:\n dicti[i] += 1\n if i==\"?\":\n pos.append(cont)\n cont += 1\n\n\n for i in pos:\n letra = min(dicti, key=dicti.get)\n\n s = s[:i] + letra + s[i+1:]\n\n dicti[letra] += 1\n\n if dicti[\"A\"]==dicti[\"G\"]==dicti[\"C\"]==dicti[\"T\"]:\n print(s)\n\n else:\n print(\"===\")\n\nproblem4(n,s)\n", "N=int(input())\ns=str(input())\nct1=s.count('A')\nct2=s.count('C')\nct3=s.count('G')\nct4=s.count('T')\nl=len(s)\nt=len(s)//4\nl1=[]\n \nfor i in s:\n l1.append(i)\nif len(s)%4!=0:\n print(\"===\")\nelse:\n for i in range(l):\n if l1[i]=='?':\n if ct1<t:\n l1[i]='A'\n ct1+=1\n elif ct2<t:\n l1[i]='C'\n ct2+=1\n elif ct3<t:\n l1[i]='G'\n ct3+=1\n else:\n if ct4<t:\n l1[i]='T'\n ct4+=1\n if ct1==ct2 and ct1==ct3 and ct1==ct4:\n for i in range(l):\n print(l1[i],end=\"\")\n else:\n print(\"===\")\n \t\t \t \t\t \t\t\t \t\t \t\t \t\t", "n=int(input())\ns=str(input())\nk1=s.count('A')\nk2=s.count('C')\nk3=s.count('G')\nk4=s.count('T')\nl=len(s)\nt=len(s)//4\nl1=[]\n \nfor i in s:\n l1.append(i)\nif len(s)%4!=0:\n print(\"===\")\nelse:\n for i in range(l):\n if l1[i]=='?':\n if k1<t:\n l1[i]='A'\n k1+=1\n elif k2<t:\n l1[i]='C'\n k2+=1\n elif k3<t:\n l1[i]='G'\n k3+=1\n else:\n if k4<t:\n l1[i]='T'\n k4+=1\n if k1==k2 and k1==k3 and k1==k4:\n for i in range(l):\n print(l1[i],end=\"\")\n else:\n print(\"===\")\n \t \t \t \t\t \t \t \t \t \t", "n = int(input())\ns = input()\nt=n//4\na=s.count('A')\nc=s.count('C')\ng=s.count('G')\nt1=s.count('T')\nif a>t or c>t or g>t or t1>t or n%4!=0:\n print(\"===\")\nelse:\n s=s.replace(\"?\",\"A\",t-a)\n s=s.replace(\"?\",\"C\",t-c)\n s=s.replace(\"?\",\"G\",t-g)\n s=s.replace(\"?\",\"T\",t-t1)\n print(s)\n\t\t\t \t\t \t \t \t\t \t \t \t\t \t", "n=int(input())\r\na=input()\r\nac=a.count(\"A\")\r\ngc=a.count(\"G\")\r\ncc=a.count(\"C\")\r\ntc=a.count(\"T\")\r\nvc=a.count(\"?\")\r\nq =''\r\nif vc==0 and ac==gc and gc==cc and cc==tc:\r\n print(a)\r\n \r\nelse:\r\n if n%4==0:\r\n ma=max(ac,max(gc,max(cc,tc)))\r\n \r\n if ma<=n//4:\r\n for i in range(n):\r\n if a[i]!=\"?\": q+=a[i]\r\n \r\n else:\r\n if q.count(\"A\")<n//4 and a[i+1::].count(\"A\")+1+q.count(\"A\")<=n//4:\r\n q+=\"A\"\r\n elif q.count(\"G\")<n//4 and a[i+1::].count(\"G\")+1+q.count(\"G\")<=n//4:\r\n q+=\"G\"\r\n elif q.count(\"C\")<n//4 and a[i+1::].count(\"C\")+1+q.count(\"C\")<=n//4:\r\n q+=\"C\"\r\n elif q.count(\"T\")<n//4 and a[i+1::].count(\"T\")+1+q.count(\"T\")<=n//4:\r\n q+=\"T\"\r\n \r\n print(q)\r\n else:\r\n print(\"===\")\r\n else:\r\n print(\"===\")", "def main():\r\n n = int(input())\r\n genome = input()\r\n\r\n if n % 4 != 0:\r\n # impossible\r\n print('===')\r\n return\r\n\r\n a = 0\r\n c = 0\r\n g = 0\r\n t = 0\r\n un = 0\r\n pos = []\r\n for i in range(n):\r\n if genome[i] == 'A':\r\n a += 1\r\n if genome[i] == 'C':\r\n c += 1\r\n if genome[i] == 'G':\r\n g += 1\r\n if genome[i] == 'T':\r\n t += 1\r\n if genome[i] == '?':\r\n un += 1\r\n pos.append(i)\r\n\r\n if a > n//4 or c > n//4 or g > n//4 or t > n//4:\r\n # impossible\r\n print('===')\r\n return\r\n\r\n genome = list(genome)\r\n index = 0\r\n while un != 0:\r\n if a < n//4:\r\n genome[pos[index]] = 'A'\r\n a += 1\r\n index += 1\r\n un -= 1\r\n continue\r\n if c < n//4:\r\n genome[pos[index]] = 'C'\r\n c += 1\r\n index += 1\r\n un -= 1\r\n continue\r\n if g < n//4:\r\n genome[pos[index]] = 'G'\r\n g += 1\r\n index += 1\r\n un -= 1\r\n continue\r\n if t < n//4:\r\n genome[pos[index]] = 'T'\r\n t += 1\r\n index += 1\r\n un -= 1\r\n continue\r\n print(''.join(genome))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "n=int(input())\r\ns=input()\r\nif n%4!=0:\r\n print('===')\r\nelse:\r\n lst=[0]*4\r\n for i in s:\r\n if i=='A':\r\n lst[0]+=1\r\n elif i=='G':\r\n lst[2]+=1\r\n elif i=='T':\r\n lst[3]+=1\r\n elif i=='C':\r\n lst[1]+=1\r\n if lst[0]*4>n or lst[1]*4>n or lst[2]*4>n or lst[3]*4>n:\r\n print('===')\r\n else:\r\n res,lst[0],lst[1],lst[2],lst[3]=[],n//4-lst[0],n//4-lst[1],n//4-lst[2],n//4-lst[3]\r\n for i in range(len(s)):\r\n res.append(s[i])\r\n for i in range(len(res)):\r\n if res[i]=='?':\r\n if lst[0]>0:\r\n res[i]='A'\r\n lst[0]-=1\r\n elif lst[1]>0:\r\n res[i]='C'\r\n lst[1]-=1\r\n elif lst[2]>0:\r\n res[i]='G'\r\n lst[2]-=1\r\n else:\r\n res[i]='T'\r\n lst[3]-=1\r\n print(''.join(res))", "def Main(n):\r\n s = input()\r\n A = s.count('A')\r\n C = s.count('C')\r\n G = s.count('G')\r\n T = s.count('T')\r\n q = s.count('?')\r\n mx = 4*max(A,C,G,T)\r\n have = A+C+G+T\r\n\r\n if (mx - have > q) or (q - (mx - have)) %4 != 0:\r\n print('===')\r\n return 0\r\n ans = \"\"\r\n\r\n for i in range(len(s)):\r\n if s[i] == '?':\r\n if A == min(A,C,G,T):\r\n ans += 'A'\r\n A += 1\r\n elif C == min(A,C,G,T):\r\n ans += 'C'\r\n C += 1\r\n elif G == min(A,C,G,T):\r\n ans += 'G'\r\n G += 1\r\n elif T == min(A,C,G,T):\r\n ans += 'T'\r\n T += 1\r\n\r\n else:\r\n ans += s[i]\r\n\r\n print(ans)\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n Main(n)\r\n", "n=int(input())\ns=list(input())\na=s.count('A')\nc=s.count('C')\ng=s.count('G')\nt=s.count('T')\nq=s.count('?')\nif int(n/4)!=n/4:\n\tprint('===')\nelse:\n\tif max(a,c,g,t)>n/4:\n\t\tprint('===')\n\telse:\n\t\tfor i in range(n):\n\t\t\tif s[i]=='?':\n\t\t\t\tif a<n/4:\n\t\t\t\t\ts[i]='A'\n\t\t\t\t\ta+=1\n\t\t\tif s[i]=='?':\n\t\t\t\tif c<n/4:\n\t\t\t\t\ts[i]='C'\n\t\t\t\t\tc+=1\n\t\t\tif s[i]=='?':\n\t\t\t\tif g<n/4:\n\t\t\t\t\ts[i]='G'\n\t\t\t\t\tg+=1\n\t\t\tif s[i]=='?':\n\t\t\t\tif t<n/4:\n\t\t\t\t\ts[i]='T'\n\t\t\t\t\tt+=1\n\t\tif '?' in s:\n\t\t\tprint('===')\n\t\telse:\n\t\t\tprint(*s,sep='')\n\t\t\t\n\t\t\t\n\t \t\t \t\t\t \t\t \t \t\t\t \t\t\t \t \t", "n, s = int(input()), input()\r\nn, m = divmod(n, 4)\r\n\r\nif m:\r\n print('===')\r\nelse:\r\n for ch in 'ACGT':\r\n k = s.count(ch)\r\n if k > n:\r\n print('===')\r\n break\r\n s = s.replace('?', ch, n - k)\r\n else:\r\n print(s)", "n = int(input())\r\ninput_string = input()\r\n\r\nif n%4 != 0:\r\n print(\"===\")\r\nelse:\r\n map = {}\r\n\r\n map['A'] = []\r\n map['G'] = []\r\n map['C'] = []\r\n map['T'] = []\r\n map['?'] = []\r\n\r\n for i in range(0, len(input_string)):\r\n map[input_string[i]].append(i)\r\n \r\n fault = False\r\n\r\n for key in map.keys():\r\n value = map[key]\r\n\r\n if key != \"?\" and len(value) > int(n / 4):\r\n fault = True\r\n break\r\n \r\n if fault == True:\r\n print(\"===\")\r\n else:\r\n for key in map.keys():\r\n if key != \"?\":\r\n value = map[key]\r\n \r\n if len(value) < int(n/4):\r\n for i in range(0, int(n/4) - len(value)):\r\n index = map[\"?\"].pop()\r\n input_string = input_string[:index] + key + input_string[index+1:]\r\n print(input_string)", "T=int(input())\nn=input()\na=0\ng=0\nc=0\nt=0\nif(T%4!=0):\n\tprint(\"===\")\nelse:\n\tres=T//4\n\tfor i in n:\n\t\tif(i==\"A\"):\n\t\t\ta=a+1\n\t\telif(i==\"C\"):\n\t\t\tc=c+1\n\t\telif(i==\"G\"):\n\t\t\tg=g+1\n\t\telif(i==\"T\"):\n\t\t\tt=t+1\n\tif((a<=res)and(c<=res)and(g<=res)and(t<=res)):\n\t\ta=abs(a-res)\n\t\tc=abs(c-res)\n\t\tg=abs(g-res)\n\t\tt=abs(t-res)\n\t\tfor i in range(len(n)):\n\t\t\tif(n[i]==\"?\"):\n\t\t\t\tif(a):\n\t\t\t\t\tprint(\"A\",end=\"\")\n\t\t\t\t\ta=a-1\n\t\t\t\telif(c):\n\t\t\t\t\tprint(\"C\",end=\"\")\n\t\t\t\t\tc=c-1\n\t\t\t\telif(g):\n\t\t\t\t\tprint(\"G\",end=\"\")\n\t\t\t\t\tg=g-1\n\t\t\t\telif(t):\n\t\t\t\t\tprint(\"T\",end=\"\")\n\t\t\t\t\tt=t-1\n\t\t\telse:\n\t\t\t\tprint(n[i],end=\"\")\n\t\tprint()\n\telse:\n\t\tprint(\"===\")\n\t\t \t\t \t \t \t\t\t\t\t \t\t \t \t\t \t", "n = int(input())\nword = input()\nquestionMarks = 0\nindex = 0\ndictionary = {'A': 0, 'C': 0, 'G': 0, 'T': 0}\noriginalDictionary = {'A': 0, 'C': 0, 'G': 0, 'T': 0}\nmaximum = 0\nwhile index < len(word):\n c = word[index]\n if c != '?':\n dictionary[c] = dictionary[c] + 1\n originalDictionary[c] = originalDictionary[c]+1\n if dictionary[c] > maximum:\n maximum = dictionary[c]\n else:\n questionMarks += 1\n index += 1\n\nletters = (sorted(dictionary, key=dictionary.__getitem__))\n##make the letters equal\n\nmaxIndex = 3\nwhile maxIndex >= 0 and dictionary[letters[maxIndex]] == maximum:\n maxIndex -= 1\n\nmaxIndex += 1\nindex = 0\n\nwhile questionMarks != 0 and index < maxIndex:\n diff = maximum - dictionary[letters[index]]\n if diff <= questionMarks:\n dictionary[letters[index]] = maximum\n questionMarks -= diff\n index += 1\n else:\n break\n\nif index != maxIndex:\n print(\"===\")\nelif questionMarks % 4 != 0:\n print(\"===\")\nelse:\n##add remaining question marks\n \n surplus = int(questionMarks / 4)\n for c in letters:\n dictionary[c] = maximum + surplus\n originalDictionary[c] = dictionary[c]-originalDictionary[c]\n wordArr = list(word)\n wordIndex = 0\n letterIndex = 0\n for c in wordArr:\n if c == '?':\n letter = letters[letterIndex]\n while originalDictionary[letter] == 0:\n letterIndex += 1\n letter = letters[letterIndex]\n wordArr[wordIndex] = letter\n originalDictionary[letter] -= 1\n\n wordIndex += 1\n\n print(''.join(wordArr))\n \n", "from collections import Counter, defaultdict\r\n\r\nif __name__ == '__main__':\r\n input()\r\n s = input()\r\n counts = Counter(s)\r\n counts_ = defaultdict(int)\r\n for x, y in counts.items():\r\n counts_[x] = y\r\n counts = counts_\r\n free_symbols = counts['?']\r\n del counts['?']\r\n for x in ('C', 'A', 'G', 'T'):\r\n if x not in counts:\r\n counts[x] = 0\r\n\r\n maximum_count = max(counts.values())\r\n needed_to_reach_max = sum(maximum_count - x for x in counts.values())\r\n if needed_to_reach_max != 0 and needed_to_reach_max > free_symbols:\r\n print('===')\r\n exit(0)\r\n \r\n if (free_symbols - needed_to_reach_max) % 4 != 0:\r\n print('===')\r\n exit(0)\r\n for x in counts:\r\n counts[x] = (maximum_count - counts[x])\r\n if free_symbols - needed_to_reach_max > 0:\r\n counts[x] += (free_symbols - needed_to_reach_max) // 4\r\n\r\n def impute(symbol):\r\n if symbol != '?':\r\n return symbol\r\n for x in ('C', 'A', 'G', 'T'):\r\n if counts[x] != 0:\r\n counts[x] -= 1\r\n return x\r\n \r\n print(''.join(map(impute, s)))", "\nlength = int(input())\ns = str(input())\nn = int(length / 4)\nn_each = {}\nncltds = [('A',0), ('C',0), ('G',0), ('T',0)]\n\nif length % 4 == 0:\n neuclotides = ncltds[:]\n for t in ncltds:\n if t[0] in s:\n new_t = (t[0], s.count(t[0]))\n neuclotides.remove(t)\n neuclotides.append(new_t)\n neuclotides = dict(neuclotides)\n if any(neuclotides[nctl] > n for nctl in neuclotides):\n print(\"===\")\n else: \n for nctl in neuclotides:\n while neuclotides[nctl] < n:\n s = s.replace(\"?\", nctl, 1)\n neuclotides[nctl] = s.count(nctl)\n print(s)\nelse:\n print(\"===\")\n", "def MG(n,s) :\r\n if n%4 !=0 :\r\n return \"===\"\r\n else :\r\n v= n/4\r\n l=[v]*4\r\n r=\"\"\r\n for i in range(n) :\r\n if s[i]==\"A\" : l[0]-=1 \r\n elif s[i]==\"G\" : l[1]-=1\r\n elif s[i]==\"C\" : l[2]-=1\r\n elif s[i]==\"T\" : l[3]-=1\r\n if l[0]<0 or l[1]<0 or l[2]<0 or l[3]<0 : \r\n return \"===\" \r\n g=[\"A\",\"G\",\"C\",\"T\"]\r\n for i in range(n) :\r\n if s[i]!=\"?\" :\r\n r+=s[i]\r\n else : \r\n for j in range(4) :\r\n if l[j]!=0 :\r\n r+=g[j]\r\n l[j]-=1\r\n break\r\n return r \r\nn,s=int(input()),input()\r\nprint(MG(n,s))", "i = int(input())\r\ns = list(map(str, input()))\r\na = s.count('A')\r\nc = s.count('C')\r\ng = s.count('G')\r\nt = s.count('T')\r\n\r\nif i %4 != 0:\r\n print('===')\r\n exit()\r\nif a > i/4 or c > i/4 or g > i/4 or t > i/4:\r\n print('===')\r\n exit()\r\n\r\nfor x in range(0, i):\r\n if s[x] == '?':\r\n if a < i/4:\r\n a += 1\r\n s[x] = 'A'\r\n elif c < i/4:\r\n c += 1\r\n s[x] = 'C'\r\n elif g < i/4:\r\n g += 1\r\n s[x] = 'G'\r\n elif t < i/4:\r\n t += 1\r\n s[x] = 'T'\r\n\r\n\r\nprint(''.join([str(elem) for elem in s]))", "n = int(input())\nx = list(input())\na = [n // 4 - x.count('A'), n // 4 - x.count('C'), n // 4 - x.count('G'), n // 4 - x.count('T')]\nd = {0: 'A', 1: 'C', 2: 'G', 3: 'T'}\nans = 0\nif n % 4 != 0 or min(a) < 0:\n print('===')\nelse:\n for i in range(n):\n if x[i] == '?':\n for j in range(4):\n if a[j] != 0:\n x[i] = d[j]\n a[j] -= 1\n break\n print(*x, sep='')\n", "n=int(input())\r\nl=list(input())\r\ntemp=['A','C','G','T']\r\n\r\nif n%4==0:\r\n\td={}\r\n\td['A'],d['C'],d['G'],d['T'],c=0,0,0,0,0\r\n\tfor i in l:\r\n\t\tif i=='?':\r\n\t\t\tc+=1\r\n\t\telse:\r\n\t\t\td[i]+=1\r\n\tif c==n:\r\n\t\tk=0\r\n\t\tfor i in range(len(l)):\r\n\t\t\tl[i]=temp[k]\r\n\t\t\tk=(k+1)%4\r\n\t\tprint(\"\".join(l))\r\n\telse:\r\n\t\tk=n//4\r\n\t\tfor i in range(0,len(l)):\r\n\t\t\tif l[i]=='?':\r\n\t\t\t\tif d['A']<k:\r\n\t\t\t\t\tl[i]='A'\r\n\t\t\t\t\td['A']+=1\r\n\t\t\t\telif d['C']<k:\r\n\t\t\t\t\tl[i]='C'\r\n\t\t\t\t\td['C']+=1\r\n\t\t\t\telif d['G']<k:\r\n\t\t\t\t\tl[i]='G'\r\n\t\t\t\t\td['G']+=1\r\n\t\t\t\telif d['T']<k:\r\n\t\t\t\t\tl[i]='T'\r\n\t\t\t\t\td['T']+=1\r\n\t\tqu=0\r\n\t\tfor i in l:\r\n\t\t\tif i=='?':\r\n\t\t\t\tqu+=1\r\n\t\tif d['A']==d['C']==d['G']==d['T']==k and qu==0:\r\n\t\t\tprint(\"\".join(l))\r\n\t\telse:\r\n\t\t\tprint('===')\r\nelse:\r\n\tprint('===')", "\nInput=lambda:map(int,input().split())\nc = lambda i,x: i.count(x)\n\nn = int(input())\ns = input()\nif n % 4 != 0:\n print(\"===\")\n exit()\n\nans = [c(s,'A'),c(s,'C'),c(s,'G'),c(s,'T')]\nm = n//4\nif max(ans) > m:\n print(\"===\")\n exit()\n\ns = s.replace(\"?\",'A',m-ans[0])\ns = s.replace(\"?\",'C',m-ans[1])\ns = s.replace(\"?\",'G',m-ans[2])\ns = s.replace(\"?\",'T',m-ans[3])\nprint(s)\n\n \n \n\n\n\n", "import math\n\nn=int(input())\ns=list(input())\n\n\nar=[0]*1000\n\nfor ch in s:\n if ch!='?':\n ar[ord(ch)]+=1\n\nif n%4==0:\n val=n//4\n\n for i in range(n):\n \n if s[i]=='?' and val>ar[ord('A')]:\n s[i]='A'\n ar[ord('A')]+=1\n\n for i in range(n):\n if s[i]=='?' and val>ar[ord('G')]:\n s[i]='G'\n ar[ord('G')]+=1\n \n for i in range(n):\n if s[i]=='?' and val>ar[ord('C')]:\n s[i]='C'\n ar[ord('C')]+=1\n \n for i in range(n):\n if s[i]=='?' and val>ar[ord('T')]:\n s[i]='T'\n ar[ord('T')]+=1\n \n\nif n%4==0 and ar[ord('A')]==ar[ord('G')] and ar[ord('G')]==ar[ord('C')] and ar[ord('C')]==ar[ord('T')]:\n for ch in s:\n print(ch,end=\"\")\nelse:\n print(\"===\")\n", "n=int(input())\r\nif n%4>0:\r\n print('===')\r\n exit()\r\ns=input()\r\na=['']*n\r\nfor i in range(n):\r\n a[i]=s[i]\r\nA=n//4-a.count('A')\r\nC=n//4-a.count('C')\r\nG=n//4-a.count('G')\r\nT=n//4-a.count('T')\r\nfor i in range(n):\r\n if a[i]=='?':\r\n if A>0:\r\n a[i]='A'\r\n A-=1\r\n elif C>0:\r\n a[i]='C'\r\n C-=1\r\n elif G>0:\r\n a[i]='G'\r\n G-=1\r\n elif T>0:\r\n a[i]='T'\r\n T-=1\r\nif A==C==G==T==0 and a.count('?')==0:\r\n for i in a:\r\n print(i,end='')\r\nelse:\r\n print('===')", "n=int(input())\ns=list(input())\nca=s.count('A')\ncc=s.count('C')\ncg=s.count('G')\nct=s.count('T')\na=[]\nmx=max(ca,cc,cg,ct)\nif n%4!=0:\n print(\"===\")\nelse: \n n=n//4\n if ca<=n and cc<=n and cg<=n and ct<=n:\n ca=abs(ca-n)\n cc=abs(cc-n)\n cg=abs(cg-n)\n ct=abs(ct-n)\n for i in range(len(s)):\n if s[i]==\"?\":\n if ca:\n print(\"A\",end=\"\")\n ca-=1\n elif cc:\n print(\"C\",end=\"\")\n cc-=1 \n elif cg:\n print(\"G\",end=\"\")\n cg-=1\n elif ct:\n print(\"T\",end=\"\")\n ct-=1\n else:\n print(s[i],end=\"\")\n else:\n print(\"===\")\n\n\t\t \t\t \t \t \t \t\t \t \t\t \t \t\t", "n=int(input())\ns=input()\nl=list(s)\na=0\nc=0\ng=0\nt=0\nx=0\nfor i in s:\n if i=='A':\n a=a+1\n elif i=='C':\n c=c+1\n elif i=='G':\n g=g+1 \n elif i=='T':\n t=t+1 \n elif i=='?':\n x=x+1\nm=n//4\nif a+g+c+t==0:\n if x%4==0:\n print('ACGT'*(x//4))\n else:\n print(\"===\")\nelse:\n for i in range(n):\n if l[i]=='?':\n if a<m:\n l[i]='A'\n a+=1\n x-=1\n elif c<m:\n l[i]='C'\n c+=1\n x-=1\n elif g<m:\n l[i]='G'\n g+=1\n x-=1\n elif t<m:\n l[i]='T'\n t+=1\n x-=1\n if x==0 and (a==m and c==m and g==m and t==m ):\n print(*l,sep='')\n else:\n print('===')\n \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\nimport sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\ns = list(input().rstrip().decode())\r\ncnt = defaultdict(lambda : 0)\r\nfor i in s:\r\n cnt[i] += 1\r\nx = list(\"ACGT\")\r\nma = 0\r\nfor i in x:\r\n ma = max(ma, cnt[i])\r\nn4 = n // 4\r\nif n % 4 or ma > n4:\r\n ans = \"===\"\r\n print(ans)\r\n exit()\r\nans = []\r\nj = 0\r\nfor i in s:\r\n if not i == \"?\":\r\n ans.append(i)\r\n else:\r\n while cnt[x[j]] == n4:\r\n j += 1\r\n ans.append(x[j])\r\n cnt[x[j]] += 1\r\nsys.stdout.write(\"\".join(ans))", "n=int(input())\r\ns=input()\r\nif n%4!=0:\r\n print(\"===\")\r\nelse:\r\n m=int(n/4)\r\n a=[0]*4\r\n flag=0\r\n for i in range(0,n):\r\n if s[i]=='A':\r\n a[0]=a[0]+1\r\n if s[i]=='C':\r\n a[1]=a[1]+1\r\n if s[i]=='G':\r\n a[2]=a[2]+1\r\n if s[i]=='T':\r\n a[3]=a[3]+1\r\n if a[0]>m or a[1]>m or a[2]>m or a[3]>m:\r\n flag=1\r\n break\r\n if flag==1:\r\n print(\"===\")\r\n if flag==0:\r\n a[0]=m-a[0]\r\n s=s.replace('?','A',a[0])\r\n a[1]=m-a[1]\r\n s=s.replace('?','C',a[1])\r\n a[2]=m-a[2]\r\n s=s.replace('?','G',a[2])\r\n a[3]=m-a[3]\r\n s=s.replace('?','T',a[3])\r\n print(s)\r\n\r\n\r\n", "n = int(input())\r\ns = input()\r\n\r\na = c = g = t = 0\r\n\r\nif n % 4 != 0 :\r\n print('===')\r\n exit()\r\nelse:\r\n m = n // 4\r\n a = s.count('A')\r\n c = s.count('C')\r\n g = s.count('G')\r\n t = s.count('T')\r\n\r\n s = s.replace('?','A' , m - a )\r\n s = s.replace('?' , 'C' , m - c)\r\n s = s.replace('?' , 'G' , m - g)\r\n s = s.replace('?' , 'T' , m - t)\r\n\r\n if s.count('A') == s.count('G') == s.count('C') == s.count('T'):\r\n print(s)\r\n else:\r\n print('===')", "import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy\n\nsys.setrecursionlimit(10**7)\ninf=10**20\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 [int(x) for x in sys.stdin.readline().split()]\n# def LF(): return [float(x) for x in sys.stdin.readline().split()]\ndef I(): return int(sys.stdin.readline())\ndef F(): return float(sys.stdin.readline())\ndef LS(): return sys.stdin.readline().split()\ndef S(): return input()\n\ndef main():\n n=I()\n s=S()\n\n if n%4!=0:\n return '==='\n\n a=g=c=t=n//4\n for x in s:\n if x=='A':\n a-=1\n elif x=='G':\n g-=1\n elif x=='C':\n c-=1\n elif x=='T':\n t-=1\n\n if a<0 or g<0 or c<0 or t<0:\n return '==='\n\n s=list(s)\n for i in range(n):\n if s[i]=='?':\n if a>0:\n a-=1\n s[i]='A'\n elif g>0:\n g-=1\n s[i]='G'\n elif c>0:\n c-=1\n s[i]='C'\n elif t>0:\n t-=1\n s[i]='T'\n\n return ''.join(s)\n\n# main()\nprint(main())\n", "def L2():\n\n n = int(input())\n s = input()\n\n if n % 4 != 0:\n print(\"===\")\n else:\n num = n // 4\n a = s.count('A')\n c = s.count('C')\n g = s.count('G')\n t = s.count('T')\n if (a > num or c > num or g > num or t > num):\n print(\"===\")\n return \n s=s.replace('?','A',num-a)\n s=s.replace('?', 'C', num-c)\n s=s.replace('?', 'G', num-g)\n s=s.replace('?', 'T', num-t)\n\n print(s)\nif __name__==\"__main__\":\n L2()\n\t\t\t \t\t \t \t\t\t\t \t \t \t \t", "n = int(input())\ns = str(input())\nc1 = s.count('A')\nc2 = s.count('C')\nc3 = s.count('G')\nc4 = s.count('T')\nl = len(s)\ntt = len(s) // 4\nl1 = []\nfor i in s:\n l1.append(i)\nif len(s) % 4 != 0:\n print(\"===\")\nelse:\n for i in range(l):\n if l1[i] == '?':\n if c1 < tt:\n l1[i] = 'A'\n c1 += 1\n elif c2 < tt:\n l1[i] = 'C'\n c2 += 1\n elif c3 < tt:\n l1[i] = 'G'\n c3 += 1\n else:\n if c4 < tt:\n l1[i] = 'T'\n c4 += 1\n if c1 == c3 and c1 == c2 and c1 == c4:\n for i in range(l):\n print(l1[i], end=\"\")\n else:\n print(\"===\")\n \t\t\t \t \t \t\t \t \t\t\t\t\t\t\t \t", "n = int(input())\r\ns = input()\r\ns = list(s)\r\na, c, g, t = 0, 0, 0, 0\r\ncociente = n / 4\r\n\r\nfor i in range(0,n,1):\r\n if s[i] == 'A':\r\n a += 1\r\n elif s[i] == 'C':\r\n c += 1\r\n elif s[i] == 'G':\r\n g += 1\r\n elif s[i] == 'T':\r\n t += 1\r\n\r\nif n % 4 == 0 and a <= cociente and c <= cociente and g <= cociente and t <= cociente:\r\n for j in range(0, len(s), 1):\r\n if s[j] != '?':\r\n continue\r\n if a < cociente:\r\n s[j] = 'A'\r\n a += 1\r\n continue\r\n if c < cociente:\r\n s[j] = 'C'\r\n c += 1\r\n continue\r\n if g < cociente:\r\n s[j] = 'G'\r\n g += 1\r\n continue\r\n if t < cociente:\r\n s[j] = 'T'\r\n t += 1\r\n continue\r\n\r\nif a == cociente and c == cociente and g == cociente and t == cociente:\r\n print(''.join(s))\r\nelse:\r\n print('===')\r\n", "n = int(input())\nif n % 4 != 0:\n print('===')\n exit()\nc = n // 4\n\nls = ['A', 'C', 'G', 'T']\ns = list(input())\nneeds = [(c - s.count(letter)) for letter in ls]\nif any([v < 0 for v in needs]):\n print('===')\n exit()\n\nbuf = ls[0]*needs[0] + ls[1]* needs[1] + ls[2]*needs[2] + ls[3]*needs[3]\nbufI = 0\n\nfor i in range(len(s)):\n if s[i] in ls:\n print(s[i], end='')\n else:\n print(buf[bufI], end='')\n bufI += 1\n", "n = int(input())\r\ns = list(input())\r\nif n % 4 != 0:\r\n print('===')\r\n exit(0)\r\n\r\na = 0\r\nc = 0\r\ng = 0\r\nt = 0\r\n\r\nfor i in range(n):\r\n if s[i] == 'A':\r\n a += 1\r\n if s[i] == 'C':\r\n c += 1\r\n if s[i] == 'G':\r\n g += 1\r\n if s[i] == 'T':\r\n t += 1 \r\n \r\nif a > n // 4 or c > n // 4 or g > n // 4 or t > n // 4:\r\n print('===')\r\n exit(0)\r\n\r\n\r\n\r\nfor i in range(n):\r\n if s[i] == '?':\r\n if a < n // 4:\r\n s[i] = 'A'\r\n a += 1\r\n elif c < n // 4:\r\n s[i] = 'C'\r\n c += 1\r\n elif g < n // 4:\r\n s[i] = 'G'\r\n g += 1\r\n elif t < n // 4:\r\n s[i] = 'T'\r\n t += 1\r\nprint(''.join(s))", "n,s = int(input()),list(input())\r\na = [s.count(x) for x in 'ACGT']\r\nindex = 0\r\nif n%4 or max(a) > n//4:\r\n\tprint('===')\r\nelse:\r\n\tfor x in range(n):\r\n\t\tif s[x] == '?':\r\n\t\t\twhile a[index] == n//4:\r\n\t\t\t\tindex +=1\r\n\t\t\ts[x] = 'ACGT'[index]\r\n\t\t\ta[index] +=1\r\n\tprint(\"\".join(s))\r\n", "n = int(input())\ns = input()\nm = 'ACGT'\na = []\nfor i in range(4):\n a.append(s.count(m[i]))\nb = max(a)\nif (b*4<=n and n%4==0):\n res=''\n for i in range(4):\n res+=m[i]*((n>>2)-a[i])\n j=0\n for i in s:\n if i == '?':\n print(res[j], end = '')\n j+=1\n else: \n print(i, end = '')\nelse:\n print('===')\n \t\t \t\t\t \t \t \t \t\t", "import math\n\ndef solve(n, s):\n X = [s.count(c) for c in 'ACGT']\n Q = s.count('?')\n if 4*max(X) > n or n%4:\n return None\n\n for i in range(4):\n X[i] -= n//4\n\n res = list(s)\n s1, k = 'ACGT', 0\n for i, c in enumerate(s):\n if c == '?':\n while X[k] == 0:\n k += 1\n res[i] = s1[k]\n X[k] += 1\n\n return ''.join(res)\n \nn = int(input())\ns = input().rstrip()\nres = solve(n, s)\nprint('===' if res is None else res)\n \n", "import collections\r\nlength = int(input())\r\nsentence = input()\r\ncounts = collections.Counter(sentence)\r\n\r\nif (length%4 != 0):\r\n print('===')\r\nelif (max(counts['A'],counts['G'],counts['C'],counts['T'])> int(length/4)):\r\n print('===')\r\nelse:\r\n s = list(sentence)\r\n A = int(length/4 - counts['A'])\r\n G = int(length/4 - counts['G'])\r\n C = int(length/4 - counts['C'])\r\n T = int(length/4 - counts['T'])\r\n for i in range(0,length):\r\n if(s[i] =='?'):\r\n if(A):\r\n s[i] = 'A'\r\n A -=1\r\n elif(G):\r\n s[i] = 'G'\r\n G -=1\r\n elif(C):\r\n s[i] = 'C'\r\n C -=1\r\n elif(T):\r\n s[i] = 'T'\r\n T -=1\r\n print(\"\".join(s))\r\n", "n=int(input())\r\ns=input()\r\na=s.count('A')\r\nc=s.count('C')\r\ng=s.count('G')\r\nt=s.count('T')\r\nm=max(a,c,g,t)\r\nif n%4==0:\r\n if a>(n//4) or c>(n//4) or g>(n//4) or t>(n//4):\r\n print(\"===\")\r\n else:\r\n s1=''\r\n for i in s:\r\n if i!='?':\r\n s1+=i \r\n else:\r\n if a<n//4:\r\n s1+='A'\r\n a=a+1\r\n continue\r\n if c<n//4:\r\n s1+='C'\r\n c=c+1\r\n continue\r\n if g<n//4:\r\n s1+='G'\r\n g=g+1\r\n continue\r\n if t<n//4:\r\n s1+='T'\r\n t=t+1\r\n continue\r\n print(s1)\r\nelse:\r\n print(\"===\")", "import os\r\nfrom math import*\r\nfrom bisect import*\r\n\r\n\r\nn=int(input())\r\ns=input()\r\nif n%4==0:\r\n\ta,t,c,g=[0]*4\r\n\tns=s\r\n\tns=sorted(ns)\r\n\ta=bisect_right(ns,\"A\")-bisect_left(ns,\"A\")\r\n\tt=bisect_right(ns,\"T\")-bisect_left(ns,\"T\")\r\n\tc=bisect_right(ns,\"C\")-bisect_left(ns,\"C\")\r\n\tg=bisect_right(ns,\"G\")-bisect_left(ns,\"G\")\r\n\ty=[a,t,c,g]\r\n\t#print(y)\r\n\tcheck=0\r\n\tfor i in range(4):\r\n\t\ty[i]=(n//4)-y[i]\r\n\t\tif y[i]<0:\r\n\t\t\tcheck=1\r\n\t\t\tbreak\r\n\tif check==1:\r\n\t\tprint(\"===\")\r\n\telse:\r\n\t\tz=[\"A\",\"T\",\"C\",\"G\"]\r\n\t\t#print(y)\r\n\t\tfor x in s:\r\n\t\t\tif x==\"?\":\r\n\t\t\t\tfor i in range(4):\r\n\t\t\t\t\tif y[i]>0:\r\n\t\t\t\t\t\tprint(z[i],end='')\r\n\t\t\t\t\t\ty[i]-=1\r\n\t\t\t\t\t\tbreak\r\n\t\t\telse:\r\n\t\t\t\tprint(x,end='')\r\nelse:\r\n\tprint(\"===\")\t", "N = int(input())\r\nif N % 4 != 0:\r\n print(\"===\")\r\n exit()\r\nX, Genomes = input(), {'A': 0, 'C': 0, 'G': 0, 'T': 0}\r\nfor i in X:\r\n if i != '?':\r\n Genomes[i] += 1\r\nfor i in Genomes.values():\r\n if i > N // 4:\r\n print(\"===\")\r\n exit()\r\nfor i in X:\r\n if i == '?':\r\n for j in Genomes.keys():\r\n if Genomes[j] != (N // 4):\r\n Genomes[j] += 1\r\n print(j, end=\"\")\r\n break\r\n else:\r\n print(i, end=\"\")\r\n", "n=int(input());s=input()\nif(n%4):print(\"===\")\nelse:\n m=n//4;q,a,g,c,t = [s.count(x) for x in '?AGCT']\n for x,y in zip(\"AGCT\", [a,g,c,t]):s=s.replace(\"?\",x,m-y)\n print(s if s.count(\"A\")==s.count(\"G\")==s.count(\"C\")==s.count(\"T\") else \"===\")", "n = int(input())\r\ns = input()\r\nif n % 4 !=0:\r\n print('===')\r\nelse:\r\n bkv = []\r\n bkv.append(s.count('A'))\r\n bkv.append(s.count('C'))\r\n bkv.append(s.count('G'))\r\n bkv.append(s.count('T'))\r\n mx = (max(bkv))\r\n if mx > n /4:\r\n print('===')\r\n else:\r\n ma = n//4\r\n A = bkv[0]\r\n C = bkv[1]\r\n G = bkv[2]\r\n T = bkv[3]\r\n nom = 0\r\n st = ''\r\n for i in s:\r\n if i =='?':\r\n if A < ma:\r\n A+=1\r\n st+='A'\r\n elif C < ma:\r\n C+=1\r\n st+='C'\r\n elif G < ma:\r\n G+=1\r\n st+='G'\r\n elif T < ma:\r\n T+=1\r\n st+='T'\r\n else:\r\n st+=i\r\n print(st)", "n = int(input())\r\ns = input()\r\nif n % 4 != 0:\r\n print('===')\r\nelse:\r\n A = 0\r\n G = 0\r\n C = 0\r\n T = 0\r\n for i in s:\r\n if i == 'A':\r\n A += 1\r\n if i == 'G':\r\n G += 1\r\n if i == 'C':\r\n C += 1\r\n if i == 'T':\r\n T += 1\r\n if max(max(A, G), max(C, T)) > n // 4:\r\n print('===')\r\n else:\r\n for i in s:\r\n if i != '?':\r\n print(i, end='')\r\n else:\r\n if A < n // 4:\r\n print('A', end='')\r\n A += 1\r\n elif G < n // 4:\r\n print('G', end='')\r\n G += 1\r\n elif C < n // 4:\r\n print('C', end='')\r\n C += 1\r\n else:\r\n print('T', end='')", "n=int(input())\r\ns=input()\r\na=s.count('A')\r\ng=s.count('G')\r\nc=s.count('C')\r\nt=s.count('T')\r\nv=s.count('?')\r\nif n%4!=0 or max(a,g,c,t)*4>n:\r\n print('===')\r\nelse:\r\n i=0\r\n while a*4!=n:\r\n if s[i]=='?':\r\n s=s[:i]+'A'+s[i+1:]\r\n a+=1\r\n i+=1\r\n while g * 4 != n:\r\n if s[i] == '?':\r\n s=s[:i]+'G'+s[i+1:]\r\n g+=1\r\n i += 1\r\n while c * 4 != n:\r\n if s[i] == '?':\r\n s=s[:i]+'C'+s[i+1:]\r\n c+=1\r\n i += 1\r\n while t * 4 != n:\r\n if s[i] == '?':\r\n s=s[:i]+'T'+s[i+1:]\r\n t+=1\r\n i += 1\r\n print(s)", "n = int(input())\r\ns = input()\r\n\r\na = s.count(\"A\")\r\nc = s.count(\"C\")\r\nt = s.count(\"T\")\r\ng = s.count(\"G\")\r\n\r\nif n % 4 != 0 or max(a, c, t, g) > n//4:\r\n print(\"===\")\r\nelse:\r\n needed = n//4\r\n\r\n ans = s.replace(\"?\", \"A\", needed-a).replace(\"?\", \"T\", needed-t).replace(\"?\", \"C\", needed-c).replace(\"?\", \"G\", needed-g)\r\n print(ans)", "n = int(input())\r\ns = input()\r\ndef F(n, s):\r\n\tif n % 4 > 0:\r\n\t\treturn '==='\r\n\tfor c in \"ACGT\":\r\n\t\tif 4*s.count(c) > n:\r\n\t\t\treturn '==='\r\n\tr = ''\r\n\tfor c in \"ACGT\":\r\n\t\tr += c * (n // 4 - s.count(c))\r\n\tj=0\r\n\tres = ''\r\n\tfor c in s:\r\n\t\tif c == '?':\r\n\t\t\tres += r[j]\r\n\t\t\tj += 1\r\n\t\telse:\r\n\t\t\tres += c\r\n\treturn res\r\nprint(F(n, s))", "n=int(input())\r\ns=input()\r\na=b=c=d=0\r\nif len(s)%4!=0:\r\n print('===')\r\nelse:\r\n m=n//4\r\n for i in range(len(s)):\r\n if s[i]=='A':\r\n a+=1\r\n elif s[i]=='C':\r\n b+=1\r\n elif s[i]=='G':\r\n c+=1\r\n elif s[i]=='T':\r\n d+=1 \r\n \r\n s=s.replace('?','A',m-a) \r\n s=s.replace('?','C',m-b) \r\n s=s.replace('?','G',m-c) \r\n s=s.replace('?','T',m-d) \r\n if s.count(\"A\") == s.count(\"C\") == s.count(\"G\") == s.count(\"T\"):\r\n print(s)\r\n else:\r\n print(\"===\")\r\n \r\n", "l=int(input())\r\ndna=input()\r\n\r\na,t,c,g,q=0,0,0,0,0\r\nfor i in dna:\r\n if i=='A':a+=1\r\n elif i=='T':t+=1\r\n elif i=='C':c+=1\r\n elif i=='G':g+=1\r\n else:q+=1\r\naa,at,ac,ag=0,0,0,0\r\nm=max(a,t,c,g)\r\nx=m-a+m-t+m-c+m-g\r\nif x>q or (q-x)%4!=0:print('===')\r\nelse:\r\n aa=m-a+(q-x)//4\r\n at=m-t+(q-x)//4\r\n ac=m-c+(q-x)//4\r\n ag=m-c+(q-x)//4\r\n\r\n for i in dna:\r\n if i!='?':\r\n print(i,end='')\r\n else:\r\n if aa:\r\n print('A',end='')\r\n aa-=1\r\n elif at:\r\n print('T',end='')\r\n at-=1\r\n elif ac:\r\n print('C',end='')\r\n ac-=1\r\n else:\r\n print('G',end='')\r\n ag-=1\r\n \r\n", "\r\nn = int(input())\r\nl = list(input())\r\n\r\nif n % 4 != 0:\r\n\tprint('===')\r\n\texit()\r\n\r\nco = n // 4\r\n\r\nst = ['A', 'C', 'T', 'G']\r\nfor i in st:\r\n\tif l.count(i) > co:\r\n\t\tprint('===')\r\n\t\texit()\r\ntarget = 0\r\ni = 0\r\nwhile i < n:\r\n\tif l[i] == '?':\r\n\t\tif l.count(st[target]) < co:\r\n\t\t\tl[i] = st[target]\r\n\t\t\ti += 1\r\n\t\telse:\r\n\t\t\ttarget += 1\r\n\r\n\telse:\r\n\t\ti += 1\r\n\r\nprint(*l, sep = '')", "# LUOGU_RID: 111794070\nn = int(input())\r\ns, t = input().rstrip(), \"===\"\r\n\r\nif n % 4 != 0: print(t); exit()\r\n\r\nd = {'A': 0, 'G': 0, 'C': 0, 'T': 0}\r\nfor x in s:\r\n if x in d: d[x] += 1\r\nl = n >> 2\r\nif max(d.values()) > l: print(t); exit()\r\n\r\nq = []\r\nfor x in d: q += [x] * (l - d[x])\r\nfor x in s:\r\n if x == '?': x = q.pop() \r\n print(x, end = '')", "# collaborated with no one\n\nlettersString = \"ACGT\"\n\nlettersIndex = 0\n\nnumberOfLetters = int(input())\n\nletters = list(input())\n\ndictOfLetters = dict()\n\ni = 0\n\nj = numberOfLetters - 1\n\ndictOfLetters = {'A': 0, 'C': 0, 'G': 0, 'T': 0}\n\nwhile i <= j:\n if letters[i] != '?':\n dictOfLetters[letters[i]] += 1\n if letters[j] != '?':\n dictOfLetters[letters[j]] += 1\n\n i += 1\n j -= 1\n\nmaxNumberOfLetters = max(list(dictOfLetters.values()))\n\nif numberOfLetters % 4 != 0 or maxNumberOfLetters > numberOfLetters // 4:\n print(\"===\")\nelif maxNumberOfLetters == 0:\n print(lettersString * (len(letters) // 4))\nelse:\n for index, letter in enumerate(letters):\n if letter == '?':\n while dictOfLetters[lettersString[lettersIndex]] >= numberOfLetters // 4:\n if lettersIndex == 3:\n lettersIndex = 0\n lettersIndex += 1\n\n letters[index] = lettersString[lettersIndex]\n dictOfLetters[lettersString[lettersIndex]] += 1\n\n print(\"\".join(letters))\n\n\n\n\n\n\n\t \t\t\t \t \t \t\t\t\t \t \t", "n=int(input())\ns=input()\nif n%4==0:\n req=n//4\n a=s.count('A')\n c=s.count('C')\n g=s.count('G')\n t=s.count('T')\n z=s.count('?')\n if a>req or c>req or g>req or t>req:\n print('===')\n exit()\n res='' \n for i in range(n):\n if s[i]=='?':\n if a<req:\n res+='A'\n a+=1\n elif c<req:\n res+='C'\n c+=1\n elif g<req:\n res+='G'\n g+=1\n elif t<req:\n res+='T'\n t+=1\n else:\n res+=s[i]\n print(res)\nelse:\n print('===')\n\t\t \t\t \t \t \t\t \t \t\t\t\t\t", "n = int(input())\r\ncode = list(input())\r\nA = code.count(\"A\")\r\nC = code.count(\"C\")\r\nG = code.count(\"G\")\r\nT = code.count(\"T\")\r\nif n % 4 == 0:\r\n m = n/4\r\n if A<=m and C<=m and G<=m and T<=m:\r\n for i in range(n):\r\n if code[i] == \"?\":\r\n if A<m:\r\n code[i] = \"A\"\r\n A = A +1\r\n elif C<m:\r\n code[i] = \"C\"\r\n C=C+1\r\n elif G<m:\r\n code[i] = \"G\"\r\n G=G+1\r\n elif T<m:\r\n code[i] = \"T\"\r\n T=T+1\r\n print(''.join(map(str, code)))\r\n else:\r\n print(\"===\")\r\n\r\nelse:\r\n print(\"===\")\r\n", "def main():\r\n n = int(input())\r\n d = str(input())\r\n k = 'ACGT'\r\n ct = 0\r\n #count = max(d.count('A'),d.count('C'),d.count('G'),d.count('T'))\r\n count = n//4\r\n if n % 4 != 0:\r\n print(\"===\")\r\n else:\r\n for i in k:\r\n while(d.count(i) != count and d.count('?') != 0):\r\n d=d.replace('?',i,1)\r\n ct +=1\r\n l = list(d)\r\n if(l.count('A') == l.count('C') == l.count('G') == l.count('T')) and l.count('?') == 0:\r\n print(''.join(l))\r\n else:\r\n print('===')\r\nmain()", "n=int(input())\ns=str(input())\nb1=s.count('A')\nb2=s.count('C')\nb3=s.count('G')\nb4=s.count('T')\nl=len(s)\nt=len(s)//4\nl1=[]\n \nfor i in s:\n l1.append(i)\nif len(s)%4!=0:\n print(\"===\")\nelse:\n for i in range(l):\n if l1[i]=='?':\n if b1<t:\n l1[i]='A'\n b1+=1\n elif b2<t:\n l1[i]='C'\n b2+=1\n elif b3<t:\n l1[i]='G'\n b3+=1\n else:\n if b4<t:\n l1[i]='T'\n b4+=1\n if b1==b2 and b1==b3 and b1==b4:\n for i in range(l):\n print(l1[i],end=\"\")\n else:\n print(\"===\")\n\t \t\t\t \t\t \t \t \t\t \t\t\t\t \t\t \t\t", "input()\r\na = input()\r\nb, c = \"ACGT?\", [0] * 5\r\nfor i in a:\r\n c[b.index(i)] += 1\r\nfor i in range(c.pop()):\r\n a = a.replace(\"?\", b[c.index(min(c))], 1)\r\n c [c.index(min(c))] += 1\r\nprint([a, \"===\"][len(set(c)) != 1])\r\n", "n = int(input())\r\ns = input()\r\ncadADNMamut = list(s)\r\na, c, g, t = 0, 0, 0, 0\r\ndivision = n / 4\r\n\r\nfor i in range(0,n,1):\r\n if cadADNMamut[i] == 'A':\r\n a += 1\r\n elif cadADNMamut[i] == 'C':\r\n c += 1\r\n elif cadADNMamut[i] == 'G':\r\n g += 1\r\n elif cadADNMamut[i] == 'T':\r\n t += 1\r\n\r\nif n % 4 == 0 and a <= division and c <= division and g <= division and t <= division:\r\n for j in range(0, len(cadADNMamut), 1):\r\n if cadADNMamut[j] != '?':\r\n continue\r\n if a < division:\r\n cadADNMamut[j] = 'A'\r\n a += 1\r\n continue\r\n if c < division:\r\n cadADNMamut[j] = 'C'\r\n c += 1\r\n continue\r\n if g < division:\r\n cadADNMamut[j] = 'G'\r\n g += 1\r\n continue\r\n if t < division:\r\n cadADNMamut[j] = 'T'\r\n t += 1\r\n continue\r\n\r\nif a == division and c == division and g == division and t == division:\r\n print(''.join(cadADNMamut))\r\nelse:\r\n print('===')", "n = int(input())\ns = list(input())\nif (n%4) > 0:\n print('===')\nelse:\n\ta, c, g, t = s.count('A'), s.count('C'), s.count('G'), s.count('T')\n\tif (a > n/4) or (c > n/4) or (g > n/4) or (t > n/4): \n\t\tprint('===')\n\telse:\n\t\tind = [i for i, x in enumerate(s) if x == '?']\n\t\tfor i in ind:\n\t\t\tif a < n/4: s[i], a = 'A', a+1\n\t\t\telif c < n/4: s[i], c = 'C', c+1\n\t\t\telif g < n/4: s[i], g = 'G', g+1\n\t\t\telif t < n/4: s[i], t = 'T', t+1\n\t\tprint(''.join(s))\n\t \t\t \t\t \t\t \t\t\t \t\t \t \t \t \t\t", "l=int(input())\r\nstr=input()\r\na=c=g=q=t=0\r\nn=l/4\r\nfor i in range(l):\r\n if str[i]=='A':\r\n a+=1\r\n elif str[i]=='C':\r\n c+=1\r\n elif str[i]=='G':\r\n g+=1\r\n elif str[i]=='T':\r\n t+=1\r\n else:\r\n q+=1\r\nflag=0\r\nif max(max(a,g),max(c,t))>n or l%4!=0:\r\n flag=1\r\n\r\nfor i in range(l):\r\n if str[i]=='?':\r\n if a<n:\r\n str=str[:i]+'A'+str[i+1:]\r\n a+=1\r\n elif c<n:\r\n str=str[:i]+'C'+str[i+1:]\r\n c+=1\r\n elif g<n:\r\n str=str[:i]+'G'+str[i+1:]\r\n g+=1\r\n elif t<n:\r\n str=str[:i]+'T'+str[i+1:]\r\n t+=1\r\nif flag:\r\n print(\"===\")\r\nelse:\r\n print(str)\r\n \r\n", "n = int(input(\"\"))\nA = input(\"\")\nspots = list()\nneed = int(n/4)\nC = {\n 'A' : 0, 'G' : 0, 'C' : 0, 'T' : 0\n}\n\nfor i in range(len(A)):\n if A[i] == '?':\n spots.append(i)\n else:\n C[A[i]] += 1\n\nif n % 4 == 0:\n pattern = list()\n for c in C:\n x = C[c]\n while x < int(n/4):\n pattern.append(c)\n x += 1\n\n if len(pattern) > len(spots):\n print(\"===\")\n else:\n j = 0\n k = 0\n answer = \"\"\n for i in range(len(A)):\n if j < len(spots) and k < len(pattern):\n if i == spots[j] :\n answer += pattern[k]\n C[pattern[k]] += 1\n j += 1\n k += 1\n else : answer += A[i]\n else : answer += A[i]\n print(answer)\nelse: print(\"===\")\n\t \t \t \t\t\t\t\t\t \t \t \t\t\t \t\t\t \t", "n = int(input())\r\ns = list(input())\r\na = s.count('A')\r\ng = s.count('G')\r\nc = s.count('C')\r\nt = s.count('T')\r\nd = s.count('?')\r\nm = 4 * max(a, g, t, c) - a - g - c - t\r\nif (d<m) or ((d - m) % 4 != 0):\r\n print('===')\r\nelse:\r\n q = len(s)//4\r\n for i in range(0,len(s)):\r\n if s[i]=='?':\r\n if a<q:\r\n s[i]='A'\r\n a += 1\r\n elif g<q:\r\n s[i]='G'\r\n g += 1\r\n elif c<q:\r\n s[i]='C'\r\n c += 1\r\n else:\r\n s[i]='T'\r\n t += 1\r\n print(*s,sep = '') ", "from collections import Counter\r\n\r\nn = int(input())\r\nstring = input()\r\n\r\ncnt = Counter()\r\n\r\nfor c in string:\r\n cnt[c] += 1\r\n\r\nmx = max(cnt['A'], cnt['T'], cnt['G'], cnt['C'])\r\ntosub = 4 * mx - cnt['A'] - cnt['T'] - cnt['G'] - cnt['C']\r\nunk = string.count('?')\r\n\r\nif unk < tosub or (unk - tosub) % 4 != 0:\r\n print(\"===\")\r\nelse:\r\n replacement = list()\r\n replacement.extend((mx - cnt['A'] + (unk - tosub) // 4) * 'A')\r\n replacement.extend((mx - cnt['T'] + (unk - tosub) // 4) * 'T')\r\n replacement.extend((mx - cnt['G'] + (unk - tosub) // 4) * 'G')\r\n replacement.extend((mx - cnt['C'] + (unk - tosub) // 4) * 'C')\r\n\r\n ans = list()\r\n idx = 0\r\n\r\n for c in string:\r\n if c == '?':\r\n ans.append(replacement[idx])\r\n idx += 1\r\n else:\r\n ans.append(c)\r\n print(''.join(ans))\r\n", "n=int(input())\ns=input()\ns=s.strip()\na=s.count(\"A\")\nc=s.count(\"C\")\ng=s.count(\"G\")\nt=s.count(\"T\")\nx=n//4\nif (len(s)%4!=0 or a>x or c>x or g>x or t>x):\n print(\"===\")\nelse:\n s=s.replace(\"?\",\"A\",x-a)\n s=s.replace(\"?\",\"C\",x-c)\n s=s.replace(\"?\",\"G\",x-g)\n s=s.replace(\"?\",\"T\",x-t)\n print(s)\n ", "n=int(input())\ns=str(input())\narr=[]\nleft_A=0\nleft_G=0\nleft_C=0\nleft_T=0\nVAL=True\nfor i in range(n):\n arr.append(s[i])\nif n%4==0:\n count_max=n//4\n count_A=s.count('A')\n count_G=s.count('G')\n count_C=s.count('C')\n count_T=s.count('T')\n maxi=max(count_A,count_T,count_C,count_G)\n if maxi>count_max:\n print(\"===\")\n val=False\n else:\n left_A=abs(count_A-count_max)\n left_G=abs(count_G-count_max)\n left_C=abs(count_C-count_max)\n left_T=abs(count_T-count_max)\n for i in range(n):\n if left_A!=0 and arr[i]=='?':\n arr[i]='A'\n left_A-=1\n elif left_G!=0 and arr[i]=='?':\n arr[i]='G'\n left_G-=1\n elif left_C!=0 and arr[i]=='?':\n arr[i]='C'\n left_C-=1\n elif left_T!=0 and arr[i]=='?':\n arr[i]='T'\n left_T-=1\n new_A=arr.count('A')\n new_G=arr.count('G')\n new_C=arr.count('C')\n new_T=arr.count('T')\n if new_T==count_max and new_C==count_max and new_G==count_max and new_A==count_max:\n for i in range(len(arr)):\n print(arr[i],end=\"\")\n print(\"\")\n else:\n if VAL:\n print(\"===\")\nelse:\n print(\"===\")\n \t \t \t \t \t \t\t\t\t\t \t\t\t\t \t\t\t", "from collections import Counter\r\n\r\ndef f():\r\n n = int(input())\r\n s = input()\r\n if n % 4 != 0:\r\n print('===')\r\n return\r\n cnt = [n // 4 - s.count(x) for x in 'ACGT']\r\n for c in cnt:\r\n if c < 0:\r\n print('===')\r\n return\r\n j = 0\r\n for i in range(len(s)):\r\n while j < 4 and cnt[j] == 0:\r\n j += 1\r\n if s[i] == '?':\r\n s = s[:i] + 'ACGT'[j] + s[i+1:]\r\n cnt[j] -= 1\r\n print(s)\r\n\r\nf()", "# https://codeforces.com/problemset/problem/747/B\n# 900\nimport sys\n\nl = int(input())\ns = input()\n\nif l % 4 != 0:\n print(\"===\") \n sys.exit()\n\n\nd = {}\nqm = 0\nmx = int(l / 4)\nmx_n = -float(\"inf\")\nqmi = []\nsa = []\nfor i, n in enumerate(s):\n d.setdefault(n, 0)\n d[n] += 1\n sa.append(n)\n \n if n == \"?\":\n qm += 1\n qmi.append(i)\n else:\n mx_n = max(d[n], mx_n)\n if mx_n > mx:\n print(\"===\")\n sys.exit()\n\nif qm == 0:\n print(s)\nelse:\n for n in \"AGCT\":\n if d.get(n) is None:\n d[n] = 0\n\n m = mx - d[n]\n for i in qmi[:m]:\n sa[i] = n\n \n qmi = qmi[m:]\n\n print(\"\".join(sa))\n\n", "n = int(input())\ns = list(input())\nd = {'A': 0, 'C': 0, 'G': 0, 'T': 0}\nif(n % 4):\n print('===')\nelse:\n x = n//4\n for i in s:\n if(i != '?'):\n d[i] += 1\n if(d[i] > x):\n print('===')\n exit()\n stack = []\n for i in d:\n if(d[i] < x):\n stack.append(i)\n for i in range(n):\n if(s[i] == '?'):\n s[i] = stack[-1]\n d[stack[-1]] += 1\n if(d[stack[-1]] == x):\n stack.pop()\n for i in s:\n print(i, end='')\n print()\n\n \t \t \t\t \t \t\t \t\t\t\t \t \t \t", "n=int(input())\r\nt='ACGT'\r\na=[*input()]\r\nb=[n//4-a.count(x)for x in t]\r\ni=j=0\r\nfor j in range(4):\r\n while b[j]:\r\n if '?' not in a:break\r\n a[a.index('?')]=t[j]\r\n b[j]-=1\r\n else:continue\r\n break\r\nprint([''.join(a),'===']['?'in a or b!=[0]*4])", "n=int(input())\r\ns=input()\r\nif (n%4!=0):\r\n print(\"===\")\r\nelse:\r\n f=n//4\r\n a=f-s.count(\"A\")\r\n c=f-s.count(\"C\")\r\n g=f-s.count(\"G\")\r\n t=f-s.count(\"T\")\r\n if (a>=0 and c>=0 and g>=0 and t>=0):\r\n x=\"A\"*a+\"C\"*c+\"G\"*g+\"T\"*t\r\n i=0\r\n y=\"\"\r\n for p in s:\r\n if(p=='?'):\r\n y=y+x[i]\r\n i=i+1\r\n else:\r\n y=y+p\r\n print(y)\r\n else:\r\n print(\"===\")", "n = int(input())\nif n % 4 != 0:\n print('===')\nelse:\n letters = ['A','C','G','T']\n s = input()\n cnt = [s.count('A'), s.count('C'), s.count('G'), s.count('T')]\n if max(cnt) > n//4:\n print('===')\n else:\n counts = [n//4-i for i in cnt]\n if s.count('?') == 0:\n print(s)\n else:\n for i in range(n):\n if s[i] == '?':\n for j in range(4):\n if counts[j] > 0:\n news = s[:i] + letters[j] + s[i+1:]\n s = news\n counts[j] -= 1\n break\n print(s)\n\t \t\t\t\t \t \t \t \t \t \t \t\t \t \t", "l=int(input())\ns=input()\nif l%4==0:\n sum=0\n freq={'A':0,'C':0,'G':0,'T':0}\n for i in s:\n if i in freq:\n freq[i]+=1\n else:\n sum+=1\n x=max(freq.values())\n a=freq['A']\n c=freq['C']\n g=freq['G']\n t=freq['T']\n z=l//4\n if z-a<0 or z-c<0 or z-g<0 or z-t<0:\n print(\"===\")\n else:\n l=('A'*(z-a))+('C'*(z-c))+('G'*(z-g))+('T'*(z-t))\n for i in l:\n\t s=s.replace('?',i,1)\n print(s)\nelse:\n print(\"===\")\n\t \t \t\t \t \t \t\t \t \t \t\t\t\t", "\r\nimport sys\r\n#sys.stdin=open(\"data.txt\")\r\ninput=sys.stdin.readline\r\n\r\nn=int(input())\r\nif n%4: print(\"===\")\r\nelse:\r\n t=input().strip()\r\n a=[n//4]*4\r\n for i in t:\r\n if i=='A': a[0]-=1\r\n elif i=='C': a[1]-=1\r\n elif i=='G': a[2]-=1\r\n elif i=='T': a[3]-=1\r\n if min(a)<0: print(\"===\")\r\n else:\r\n out=[]\r\n for i in t:\r\n if i=='?':\r\n if a[0]:\r\n out.append('A')\r\n a[0]-=1\r\n elif a[1]:\r\n out.append('C')\r\n a[1]-=1\r\n elif a[2]:\r\n out.append('G')\r\n a[2]-=1\r\n elif a[3]:\r\n out.append('T')\r\n a[3]-=1\r\n else: out.append(i)\r\n print(\"\".join(out))\r\n", "n = int(input())\ns = input()\n \na = s.count(\"A\")\nc = s.count(\"C\")\nt = s.count(\"T\")\ng = s.count(\"G\")\n \nif n % 4 != 0 or max(a, c, t, g) > n//4:\n\tprint(\"===\")\nelse:\n\tneeded = n//4\n \n\tans = s.replace(\"?\", \"A\", needed-a).replace(\"?\", \"T\", needed-t).replace(\"?\", \"C\", needed-c).replace(\"?\", \"G\", needed-g)\n\tprint(ans)\n\t\t\t\t\t \t\t \t\t\t\t \t\t \t\t \t\t\t\t \t\t\t", "#Problem Set L: Collabrated with Rudransh Singh and Prasoon\n\ndef seq_Function(n,code):\n genome_pair = {\"A\": 0, \"C\": 0, \"G\": 0, \"T\":0, \"?\":0}\n temp_arr = []\n\n if n % 4 != 0:\n print(\"===\")\n return 0\n else:\n for i in code:\n genome_pair[i] += 1\n\n for k in genome_pair:\n if k != \"?\":\n if genome_pair[k] > n/4:\n print(\"===\")\n return 0\n \n for i in range(int(n//4) - genome_pair[k]):\n temp_arr.append(k)\n\n if len(temp_arr) != genome_pair[\"?\"]:\n print(len(temp_arr), genome_pair[\"?\"],n)\n print(\"===\")\n return 0\n else:\n counter = 0\n for i in range(len(code)):\n if counter >= len(temp_arr):\n break\n if code[i] == \"?\":\n code[i] = temp_arr[counter]\n counter += 1\n\n print(\"\".join(code))\n return 0\n \ngenome_len = int(input())\n\ngenome_code = list(input())\n\nseq_Function(genome_len, genome_code)\n\t \t\t \t \t\t\t \t \t \t \t\t", "n = int(input())\r\ns = input()\r\ns = list(s)\r\na, c, g, t = 0, 0, 0, 0\r\ndiv = n / 4\r\n\r\nfor i in range(0, n, 1):\r\n if s[i] == 'A':\r\n a += 1\r\n elif s[i] == 'C':\r\n c += 1\r\n elif s[i] == 'G':\r\n g += 1\r\n elif s[i] == 'T':\r\n t += 1\r\n\r\nif n % 4 == 0 and a <= div and c <= div and g <= div and t <= div:\r\n for j in range(0, len(s), 1):\r\n if s[j] != '?':\r\n continue\r\n if a < div:\r\n s[j] = 'A'\r\n a += 1\r\n continue\r\n if c < div:\r\n s[j] = 'C'\r\n c += 1\r\n continue\r\n if g < div:\r\n s[j] = 'G'\r\n g += 1\r\n continue\r\n if t < div:\r\n s[j] = 'T'\r\n t += 1\r\n continue\r\n\r\nif a == div and c == div and g == div and t == div:\r\n print(''.join(s))\r\nelse:\r\n print('===')", "glength = int(input())\nstring = list(input())\nif glength % 4 != 0:\n print(\"===\")\n exit()\nelse:\n aux = glength / 4\n marks = string.count(\"?\")\n if (string.count(\"A\") > aux or string.count(\"C\") > aux or string.count(\"G\") > aux or string.count(\"T\") > aux):\n print(\"===\")\n else:\n while marks > 0:\n if (string.count(\"A\") < aux):\n string[string.index(\"?\")] = \"A\"\n marks = marks - 1\n if (string.count(\"C\") < aux):\n string[string.index(\"?\")] = \"C\"\n marks = marks - 1\n if (string.count(\"G\") < aux):\n string[string.index(\"?\")] = \"G\"\n marks = marks - 1\n if (string.count(\"T\") < aux):\n string[string.index(\"?\")] = \"T\"\n marks = marks - 1\n result = ''.join(string)\n print(result)\n", "# Aaditya Upadhyay\r\n# ..............\r\n# ╭━┳━╭━╭━╮╮\r\n# ┃┈┈┈┣▅╋▅┫┃\r\n# ┃┈┃┈╰━╰━━━━━━╮\r\n# ╰┳╯┈┈┈┈┈┈┈┈┈◢▉◣\r\n# ╲┃┈┈┈┈┈┈┈┈┈┈▉▉▉\r\n# ╲┃┈┈┈┈┈┈┈┈┈┈◥▉◤\r\n# ╲┃┈┈┈┈╭━┳━━━━╯\r\n# ╲┣━━━━━━┫\r\n# ……….\r\n# .……. /´¯/)………….(\\¯`\\\r\n# …………/….//……….. …\\….\\\r\n# ………/….//……………....\\….\\\r\n# …./´¯/…./´¯\\……/¯ `\\…..\\¯`\\\r\n# ././…/…/…./|_…|.\\….\\….\\…\\.\\\r\n# (.(….(….(…./.)..)...(.\\.).).)\r\n# .\\…………….\\/../…....\\….\\/…………/\r\n# ..\\…………….. /……...\\………………../\r\n# …..\\…………… (………....)……………./\r\nfrom sys import stdin, stdout\r\nfrom collections import *\r\nfrom math import gcd, floor, ceil\r\ndef st(): return list(stdin.readline().strip())\r\n\r\n\r\ndef li(): return list(map(int, stdin.readline().split()))\r\ndef mp(): return map(int, stdin.readline().split())\r\ndef inp(): return int(stdin.readline())\r\ndef pr(n): return stdout.write(str(n)+\"\\n\")\r\n\r\n\r\nmod = 1000000007\r\nINF = float('inf')\r\n\r\n\r\ndef solve():\r\n n = inp()\r\n s = st()\r\n if n % 4:\r\n pr('===')\r\n return\r\n d = Counter(s)\r\n a = n//4\r\n for i in d:\r\n if i != '?':\r\n if d[i] > a:\r\n pr('===')\r\n return\r\n A = a-d['A']\r\n C = a-d['C']\r\n G = a-d['G']\r\n T = a-d['T']\r\n for i in range(n):\r\n if s[i] == '?':\r\n if A:\r\n s[i] = 'A'\r\n A -= 1\r\n elif T:\r\n s[i] = 'T'\r\n T -= 1\r\n elif G:\r\n s[i] = 'G'\r\n G -= 1\r\n elif C:\r\n s[i] = 'C'\r\n C -= 1\r\n print(''.join(s))\r\n\r\n\r\nfor _ in range(1):\r\n solve()\r\n", "fail = '==='\r\n\r\n\r\ndef add(c, count):\r\n if count < 0:\r\n return fail\r\n return c * count\r\n\r\n\r\ndef ans(n, s):\r\n if n % 4 != 0:\r\n return fail\r\n new = ''\r\n new += add('A', n // 4 - s.count('A'))\r\n new += add('C', n // 4 - s.count('C'))\r\n new += add('G', n // 4 - s.count('G'))\r\n new += add('T', n // 4 - s.count('T'))\r\n if new.find(fail) != -1:\r\n return fail\r\n pos = 0\r\n res = ''\r\n for i in range(len(s)):\r\n if s[i] == '?':\r\n res += new[pos]\r\n pos += 1\r\n else:\r\n res += s[i]\r\n return res\r\n\r\n\r\nprint(ans(int(input()), input()))\r\n", "n=int(input())\r\ns=input()\r\na=s.count('A')\r\nc=s.count('C')\r\ng=s.count('G')\r\nt=s.count('T')\r\nif n%4!=0:\r\n print('===')\r\nelse:\r\n kol=n//4\r\n if max(a,c,g,t)>kol:\r\n print('===')\r\n exit()\r\n sw=''\r\n sw+='A'*(kol-a)\r\n sw += 'C' * (kol - c)\r\n sw += 'G' * (kol - g)\r\n sw += 'T' * (kol - t)\r\n j=0\r\n for i in range(n):\r\n if s[i]=='?':\r\n s=s[:i]+sw[j]+s[i+1:]\r\n j+=1\r\n print(s)\r\n", "n = int(input())\r\ngenomes = list(input())\r\nif n % 4 != 0 or any([genomes.count(x) > n // 4 for x in 'ACGT']):\r\n print('===')\r\nelse:\r\n cnt = {}\r\n for x in 'ACGT':\r\n cnt[x] = n // 4 - genomes.count(x)\r\n for i in range(n):\r\n if genomes[i] == '?':\r\n for x in 'ACGT':\r\n if cnt[x] > 0:\r\n genomes[i] = x\r\n cnt[x] -= 1\r\n break\r\n print(''.join(genomes))", "alph = \"ACGT?\"\r\nk = [0, 0, 0, 0, 0]\r\n\r\nn = int(input())\r\ns = input()\r\n\r\nans = []\r\n\r\nif n % 4 != 0 :\r\n\tprint(\"===\")\r\n\texit()\r\n\r\nfor i in range(0, n) :\r\n\tk[alph.find(s[i])] += 1\r\n\r\n\r\nj = 0\r\n\r\nfor i in range(0, n) :\r\n\tif s[i] == '?' :\r\n\t\tif 4 * k[j] > n :\r\n\t\t\tprint(\"===\")\r\n\t\t\texit()\r\n\t\twhile 4 * k[j] == n :\r\n\t\t\tj += 1\r\n\t\tk[j] += 1\r\n\t\tans.append(alph[j])\r\n\telse :\r\n\t\tans.append(s[i])\r\n\r\nfor i in range(4) :\r\n\tif 4 * k[i] < n :\r\n\t\tprint(\"===\")\r\n\t\texit()\r\n\r\n\r\n\r\nfor i in ans :\r\n\tprint(i, end = \"\")", "n=int(input())\r\ns=[el for el in input()]\r\na=0\r\ng=0\r\nc=0\r\nt=0\r\nfor el in s:\r\n if el==\"A\":\r\n a+=1\r\n elif el==\"G\":\r\n g+=1\r\n elif el==\"C\":\r\n c+=1\r\n elif el==\"T\":\r\n t+=1\r\nif n%4:\r\n print(\"===\")\r\nelse:\r\n e=n//4\r\n f=True\r\n for i in range(n):\r\n\r\n if s[i]==\"?\":\r\n if a<e:\r\n a+=1\r\n s[i]=\"A\"\r\n elif g<e:\r\n g+=1\r\n s[i]=\"G\"\r\n elif c<e:\r\n c+=1\r\n s[i]=\"C\"\r\n elif t<e:\r\n t+=1\r\n s[i]=\"T\"\r\n else:\r\n f=False\r\n if f and (e==a==c==t==g):\r\n print(\"\".join(s))\r\n else:\r\n print(\"===\")\r\n ", "n=int(input())\r\ns=input()\r\nans=''\r\nchk=[0]*4\r\nfor i in s:\r\n if i=='A':\r\n chk[0]+=1\r\n elif i=='C':\r\n chk[1]+=1\r\n elif i=='G':\r\n chk[2]+=1\r\n elif i=='T':\r\n chk[3]+=1\r\nfor i in s:\r\n if i!='?':\r\n ans+=i\r\n else:\r\n if min(chk)==chk[0]:\r\n ans+='A'\r\n chk[0]+=1\r\n elif min(chk)==chk[1]:\r\n ans+='C'\r\n chk[1]+=1\r\n elif min(chk)==chk[2]:\r\n ans+='G'\r\n chk[2]+=1\r\n else:\r\n ans+='T'\r\n chk[3]+=1\r\nprint(ans if len(set(chk))==1 else '===')", "from collections import Counter\r\nfrom collections import deque\r\n\r\ndef uncypher(genom):\r\n exact_each_letter_nr = len(genom) // 4\r\n counter = Counter(genom)\r\n as_needed_nr = exact_each_letter_nr - counter['A']\r\n cs_needed_nr = exact_each_letter_nr - counter['C']\r\n gs_needed_nr = exact_each_letter_nr - counter['G']\r\n ts_needed_nr = exact_each_letter_nr - counter['T']\r\n if min([as_needed_nr, cs_needed_nr, gs_needed_nr, ts_needed_nr]) < 0:\r\n return('===')\r\n else:\r\n ans = ''\r\n line_to_add = deque('A' * as_needed_nr + 'C' * cs_needed_nr + 'G' * gs_needed_nr + 'T' * ts_needed_nr)\r\n for char in genom:\r\n to_add = char\r\n if char == '?':\r\n to_add = line_to_add.pop()\r\n ans += to_add\r\n return ans\r\n \r\nn = int(input())\r\nif n % 4 != 0:\r\n print('===')\r\n exit()\r\ngenom = list(input())\r\nprint(uncypher(genom))\r\n", "n=int(input())\r\ns=input()\r\na=n//4-s.count(\"A\")\r\nc=n//4-s.count(\"C\")\r\ng=n//4-s.count(\"G\")\r\nt=n//4-s.count(\"T\")\r\nq=s.count(\"?\")\r\n# print(a,c,g,t)\r\nif n%4!=0 or q!=a+c+g+t or any([i<0 for i in [a,c,g,t]]):\r\n\tprint(\"===\")\r\nelse:\r\n\ts=s.replace(\"?\",\"A\",a)\r\n\ts=s.replace(\"?\",\"C\",c)\r\n\ts=s.replace(\"?\",\"G\",g)\r\n\ts=s.replace(\"?\",\"T\",t)\r\n\tprint(s)\r\n\t", "from collections import Counter\r\n\r\nn = int(input())\r\nword = input()\r\nif n % 4 != 0:\r\n print(\"===\")\r\nelse:\r\n lst = list(word)\r\n c = Counter(lst)\r\n for ch in 'ACGT':\r\n if not ch in c: \r\n c[ch] = 0\r\n if max(v for k, v in c.items() if k != '?') > n // 4:\r\n print(\"===\")\r\n elif word.count(\"?\") == 0:\r\n print(word)\r\n else:\r\n toAdd = ''\r\n for ki, va in c.items():\r\n if ki != '?' and va < n // 4:\r\n toAdd += ki * (n // 4 - va) \r\n ndx = [i for i, x in enumerate(word) if x == '?']\r\n for j, nd in enumerate(ndx):\r\n lst[nd] = toAdd[j]\r\n print(\"\".join(lst))", "n=int(input())\ns=input()\nif n%4==0:\n a,g,c,t=s.count('A'),s.count('G'),s.count('C'),s.count('T')\n q=n//4\n if a<=q and g<=q and c<=q and t<=q:\n for i in range(n):\n if s[i]=='?':\n if a<q:\n s=s.replace('?','A',1)\n a+=1\n elif g<q:\n s=s.replace('?','G',1)\n g+=1\n elif c<q:\n s=s.replace('?','C',1)\n c+=1\n else:\n s=s.replace('?','T',1)\n t+=1\n print(s)\n else:\n print('===')\nelse:\n print('===')\n \t\t\t \t \t \t\t \t \t\t\t \t", "n=int(input())\na=input()\na1=a.count(\"A\")\na2=a.count(\"C\")\na3=a.count(\"G\")\na4=a.count(\"T\")\nb=n//4\nif n%4!=0:\n print(\"===\")\n exit()\nc=[]\nfor i in range(n):\n if a[i]==\"?\":\n if a1<b:\n c.append('A')\n a1+=1\n elif a2<b:\n c.append('C')\n a2+=1\n elif a3<b:\n c.append('G')\n a3+=1\n elif a4<b:\n c.append('T')\n a4+=1\n else:\n c.append(a[i])\nif a1!=b or a2!=b or a3!=b or a4!=b:\n print(\"===\")\nelse:\n for ele in c:\n print(ele, end=\"\")\n\t\t\t \t\t\t \t\t \t \t\t\t\t\t\t\t\t\t", "def fillHole():\r\n if TestMe[0] != (Looper // 4):\r\n TestMe[0] += 1\r\n return 'A'\r\n if TestMe[1] != (Looper // 4):\r\n TestMe[1] += 1\r\n return 'G'\r\n if TestMe[2] != (Looper // 4):\r\n TestMe[2] += 1\r\n return 'C'\r\n return 'T'\r\nLooper = int(input())\r\nif Looper % 4 != 0:\r\n print(\"===\")\r\nelse:\r\n Genome = list(input())\r\n TestMe = [0,0,0,0,0]\r\n SingleGene = Looper // 4\r\n Missing = []\r\n switcher = {\r\n 'A': 0,\r\n 'G': 1,\r\n 'C': 2,\r\n 'T': 3,\r\n '?': 4\r\n }\r\n for i in range(Looper):\r\n TempIndex = switcher[Genome[i]]\r\n TestMe[TempIndex] += 1\r\n if TempIndex == 4:\r\n Missing.append(i)\r\n elif TestMe[TempIndex] > SingleGene:\r\n Genome = \"===\"\r\n Missing = []\r\n break\r\n for i in Missing:\r\n Genome[i] = fillHole()\r\n \r\n print(\"\".join(Genome))", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nif n % 4 != 0:\r\n print(\"===\")\r\nelse:\r\n s = input()[:-1]\r\n a = s.count('A')\r\n g = s.count('G')\r\n c = s.count('C')\r\n t = s.count('T')\r\n if max(a,g,c,t) > n//4:\r\n print(\"===\")\r\n else:\r\n print(s.replace('?','A',n//4-a).replace('?','G',n//4-g).replace('?','C',n//4-c).replace('?','T',n//4-t))\r\n", "n=int(input())\r\ns=list(input().strip()[:n])\r\nif n%4!=0:print('===')\r\nelse:\r\n\tqs=0\r\n\ta,c,g,t=0,0,0,0\r\n\tnum=n//4\r\n\tfor x in s:\r\n\t\tif x=='?':qs+=1\r\n\t\telif x=='A':a+=1\r\n\t\telif x==\"C\":c+=1\r\n\t\telif x=='G':g+=1\r\n\t\telse:t+=1\r\n\tif (num-a)<0 or (num-c)<0 or num-g<0 or num-t<0:print('===')\r\n\telse:\r\n\t\tl=['A']*(num-a)+[\"C\"]*(num-c)+['G']*(num-g)+['T']*(num-t)\r\n\t\tz=0\r\n\t\tfor x in range(n):\r\n\t\t\tif s[x]=='?':\r\n\t\t\t\ts[x]=l[z]\r\n\t\t\t\tz+=1\r\n\t\tprint(''.join(s))", "n=int(input())\r\ns=input()\r\nsp=s\r\nds={'A':0, 'C':0, 'G':0, 'T':0}\r\nk=n//4\r\nif n%4 != 0:\r\n sp='==='\r\nelse:\r\n for i in s:\r\n if i!='?':\r\n ds.update({i:ds.get(i)+1})\r\n for j in ds:\r\n if ds.get(j)>k:\r\n sp='==='\r\n if sp!='===':\r\n for i in s:\r\n if i=='?':\r\n for j in ds:\r\n if ds.get(j)<k:\r\n ds.update({j:ds.get(j)+1})\r\n sp = sp.replace('?',j,1)\r\n break\r\nprint(sp)", "n=int(input())\ns=str(input())\nx1=s.count('A')\nx2=s.count('C')\nx3=s.count('G')\nx4=s.count('T')\nl=len(s)\nt=len(s)//4\nl1=[]\n \nfor x in s:\n l1.append(x)\nif len(s)%4!=0:\n print(\"===\")\nelse:\n for x in range(l):\n if l1[x]=='?':\n if x1<t:\n l1[x]='A'\n x1+=1\n elif x2<t:\n l1[x]='C'\n x2+=1\n elif x3<t:\n l1[x]='G'\n x3+=1\n else:\n if x4<t:\n l1[x]='T'\n x4+=1\n if x1==x2 and x1==x3 and x1==x4:\n for x in range(l):\n print(l1[x],end=\"\")\n else:\n print(\"===\")\n \t\t \t \t \t \t \t\t\t", "n = int(input())\r\nz = n//4\r\ns = input()\r\na = s.count(\"A\")\r\nc = s.count(\"C\")\r\ng = s.count(\"G\")\r\nt = s.count(\"T\")\r\nq = s.count(\"?\")\r\n\r\nif a>z or c>z or g>z or t>z:\r\n\tprint(\"===\")\r\nelif n%4!=0:\r\n\tprint(\"===\")\r\nelse:\r\n\ts = list(s)\r\n\tfor i in range(n):\r\n\t\tif s[i] == \"?\":\r\n\t\t\tif a<z:\r\n\t\t\t\ts[i]=\"A\"\r\n\t\t\t\ta+=1\r\n\t\t\telif c<z:\r\n\t\t\t\ts[i]=\"C\"\r\n\t\t\t\tc+=1\r\n\t\t\telif g<z:\r\n\t\t\t\ts[i]=\"G\"\r\n\t\t\t\tg+=1\r\n\t\t\telse:\r\n\t\t\t\ts[i]=\"T\"\r\n\t\t\t\tt+=1\r\n\tprint(*s, sep='')", "#import sys\r\n#sys.stdin = open('in', 'r')\r\nn = int(input())\r\n#a = [int(x) for x in input().split()]\r\n#n,m = map(int, input().split())\r\ns = input()\r\ncnt = len(s)\r\narr = 'ACGT'\r\n\r\n\r\nif n % 4 == 0:\r\n r = n // 4\r\n res = ''\r\n d = {'A': 0, 'C':0,'G':0,'T':0,'?':0}\r\n for c in s:\r\n d[c] = d[c] + 1\r\n\r\n need = 0\r\n for c in arr:\r\n if d[c] <= r:\r\n need += r - d[c]\r\n else:\r\n res = \"===\"\r\n if res != \"===\" and need == d['?']:\r\n for i in range(n):\r\n if s[i] == '?':\r\n for sub in arr:\r\n if d[sub] < r:\r\n d[sub] += 1\r\n res += sub\r\n break\r\n else:\r\n res += s[i]\r\n res = str.join('', res)\r\n print(res)\r\nelse:\r\n print(\"===\")\r\n", "from sys import *\n\nn=int(input())\ns=input()\nd=dict()\nd[\"A\"]=0\nd[\"C\"]=0\nd[\"G\"]=0\nd[\"T\"]=0\nd[\"?\"]=0\nfor i in s:\n d[i]+=1\nif n%4:\n print(\"===\")\nelse:\n n//=4\n ans=\"\"\n j=0\n for i in [\"A\",\"C\",\"G\",\"T\"]:\n if d[i]>n:\n print(\"===\")\n exit(0)\n while d[i]<n:\n if j==len(s):\n print(\"===\")\n exit (0)\n if s[j]==\"?\":\n ans+=i\n d[i]+=1\n else:\n ans+=s[j]\n j+=1\n while j <len (s):\n ans+=s[j]\n j+=1\n print(ans)", "genome_size = int(input())\n\ngenome = list(input())\n\nnucleotides = \"ACGT\"\n# counts = [i for i in nucleotides (genome_size / 4) - genome.count(i)]\n\nreplaced = (\"A\" *((genome_size // 4) - genome.count('A'))) + (\"C\" *((genome_size // 4) - genome.count('C'))) + (\"G\" *((genome_size // 4) - genome.count('G'))) + (\"T\" *((genome_size // 4) - genome.count('T')))\n\nif (genome_size % 4 != 0) or len([i for i in nucleotides if genome.count(i) > (genome_size / 4)]) >= 1:\n print(\"===\")\n \nelse :\n ind = 0\n for i in range(genome_size) :\n if genome[i] == '?' :\n genome[i] = replaced[ind]\n ind += 1\n\n print(''.join(genome))\n\n\n\n", "import math\r\nfrom math import sqrt \r\nimport re\r\n#import cv2\r\n#import numpy as np\r\n#from google.colab.patches import cv2_imshow\r\n#from matplotlib import pyplot as plt\r\ndef visokosniy(n):\r\n if n % 4 == 0 and n % 100 != 0 or n % 400 == 0:\r\n return True\r\n else:\r\n return False\r\n#def hough_line(img, angle_step=1, lines_are_white=True, value_threshold=5):\r\n# thetas = np.deg2rad(np.arange(-90.0, 90.0, angle_step))\r\n# width, height = img.shape\r\n# diag_len = int(round(math.sqrt(width * width + height * height)))\r\n# rhos = np.linspace(-diag_len, diag_len, diag_len * 2)\r\n#\r\n# cos_t = np.cos(thetas)\r\n# sin_t = np.sin(thetas)\r\n# num_thetas = len(thetas)\r\n#\r\n# accumulator = np.zeros((2 * diag_len, num_thetas), dtype=np.uint8)\r\n# are_edges = img > value_threshold if lines_are_white else img < value_threshold\r\n# y_idxs, x_idxs = np.nonzero(are_edges)\r\n\r\n# for i in range(len(x_idxs)):\r\n# x = x_idxs[i]\r\n# y = y_idxs[i]\r\n#\r\n# for t_idx in range(num_thetas):\r\n# rho = diag_len + int(round(x * cos_t[t_idx] + y * sin_t[t_idx]))\r\n# accumulator[rho, t_idx] += 1\r\n#\r\n# return accumulator, thetas, rhos \r\n\r\nn = int(input())\r\nsts = list(input())\r\na = sts.count('A')\r\ng = sts.count('G')\r\nc = sts.count('C')\r\nt = sts.count('T')\r\nmaximum1 = max(a,g,c,t)\r\na = maximum1 - a\r\ng = maximum1 - g\r\nc = maximum1 - c\r\nt = maximum1 - t\r\np = a + g + c + t\r\nv = sts.count('?')\r\nif (v - p) % 4 != 0:\r\n print('===')\r\nelse:\r\n for i in range(len(sts)):\r\n if a == 0 and g == 0 and c == 0 and t == 0:\r\n a = (v - p) // 4\r\n g = (v - p) // 4\r\n c = (v - p) // 4\r\n t = (v - p) // 4\r\n if sts[i] == '?':\r\n if a > 0:\r\n sts[i] = 'A'\r\n a -= 1\r\n elif g > 0:\r\n sts[i] = 'G'\r\n g -= 1\r\n elif c > 0:\r\n sts[i] = 'C'\r\n c -= 1\r\n elif t > 0:\r\n sts[i] = 'T'\r\n t -= 1\r\n if sts.count('A') == sts.count('G') == sts.count('C') == sts.count('T'):\r\n for i in sts:\r\n print(i,end='')\r\n else:\r\n print('===')\r\n\r\n\r\n\r\n#img = cv2.imread(\"TEST IMAGES/withBears/2016-05-13 11-33-21_0855_2R.JPG\")\r\n\r\n\r\n#img_RGB=cv2.cvtColor(img, cv2.COLOR_BGR2RGB)\r\n#plt.imshow(img_RGB)\r\n#plt.show()\r\n#img_hsv = cv2.cvtColor(img, cv2.COLOR_RGB2HSV)\r\n#light_orange = (44, 10, 20)\r\n#dark_orange = (60, 20, 80)\r\n#mask = cv2.inRange(img_hsv, light_orange, dark_orange)\r\n#position = np.unravel_index(np.argmax(mask), mask.shape)\r\n#position\r\n#y=position[0]-100\r\n#x=position[1]-100\r\n#h = 200\r\n#w = 200\r\n#crop = img_RGB[y:y+h, x:x+w]\r\n#plt.imshow(crop)\r\n#plt.show()\r\n#cv2.rectangle(img_RGB, (x,y), (x+w,y+h), (0, 255, 255), 20)\r\n#plt.imshow(img_RGB)\r\n#plt.show()", "import sys\ninput = sys.stdin.readline\n\nn = int(input())\n\ns = list(input().strip())\n\nA = s.count('A')\nG = s.count('G')\nC = s.count('C')\nT = s.count('T')\nQ = s.count('?')\n\nra = n//4-A\nrg = n//4-G\nrc = n//4-C\nrt = n//4-T\nrlist = [ra,rg,rc,rt]\nif n%4!=0:\n print('===')\n sys.exit()\nfor i in range(len(rlist)):\n if rlist[i] < 0:\n print('===')\n sys.exit()\n\nif sum(rlist) == Q:\n pass\nelif Q-sum(rlist) < 0:\n print('===')\n sys.exit()\nelif Q-sum(rlist) > 0:\n if (Q-sum(rlist)) % 4 != 0:\n print('===')\n sys.exit()\n\nfor i in range(ra):\n s[s.index('?')] = 'A'\nfor i in range(rg):\n s[s.index('?')] = 'G'\nfor i in range(rc):\n s[s.index('?')] = 'C'\nfor i in range(rt):\n s[s.index('?')] = 'T'\nprint(''.join(s))\n \t \t \t\t\t \t \t\t\t\t \t \t \t", "d={'A':0,'G':0,'C':0,'T':0}\nn=int(input())\na=input()\nc1=0\na=list(a)\nif n%4==0:\n for i in a:\n if i=='?':\n c1+=1\n else: \n d[i]+=1\n k=n//4\n ra=k-d['A']\n rg=k-d['G']\n rc=k-d['C']\n rt=k-d['T']\n for i in range(n):\n if a[i]=='?':\n if ra!=0:\n a[i]='A'\n ra-=1\n elif rg!=0:\n a[i]='G'\n rg-=1\n elif rc!=0:\n a[i]='C'\n rc-=1\n elif rt!='T':\n a[i]='T'\n rt-=1\n if a.count('A')==k and a.count('G')==k and a.count('C')==k and a.count('T')==k:\n print(*a,sep=\"\")\n else:\n print(\"===\")\nelse:\n print(\"===\")\n\n \t \t \t \t \t\t \t\t \t \t\t \t \t\t", "n = int(input())\r\ns = input()\r\nif n % 4 != 0:\r\n ans = '==='\r\nelse:\r\n a = s.count('A')\r\n c = s.count('C')\r\n g = s.count('G')\r\n t = s.count('T')\r\n v = n // 4\r\n if a > v or c > v or g > v or t > v:\r\n ans = '==='\r\n else:\r\n for i in range(len(s)):\r\n if s[i] == '?':\r\n if a < v:\r\n s = s.replace('?', 'A', 1)\r\n a += 1\r\n elif c < v:\r\n s = s.replace('?', 'C', 1)\r\n c += 1\r\n elif g < v:\r\n s = s.replace('?', 'G', 1)\r\n g += 1\r\n elif t < v:\r\n s = s.replace('?', 'T', 1)\r\n t += 1\r\n ans = s\r\nprint(ans)\r\n", "n = int(input())\r\ngenomes = list(input())\r\nif n % 4 != 0 or any([genomes.count(x) > n // 4 for x in 'ACGT']):\r\n print('===')\r\nelse:\r\n to_replace = []\r\n for x in 'ACGT':\r\n cnt = n // 4 - genomes.count(x)\r\n for _ in range(cnt):\r\n to_replace.append(x)\r\n i, j = 0, 0\r\n while i < len(to_replace):\r\n if genomes[j] == '?':\r\n genomes[j] = to_replace[i]\r\n i += 1\r\n j += 1\r\n print(''.join(genomes))\r\n", "n=int(input())\ns=list(input())\nif(n%4!=0):\n print('===')\nelse:\n p=n//4\n a=s.count('A')\n g=s.count('G')\n c=s.count('C')\n t=s.count('T')\n q=s.count('?')\n ra,rg,rc,rt=p-a,p-g,p-c,p-t\n for i in range(n):\n if s[i]=='?':\n if(ra):\n s[i]='A'\n ra-=1\n elif(rg):\n s[i]='G'\n rg-=1\n elif(rc):\n s[i]='C'\n rc-=1\n else:\n s[i]='T'\n rt-=1\n \n a=s.count('A')\n g=s.count('G')\n c=s.count('C')\n t=s.count('T')\n if(a!=p or g!=p or c!=p or t!=p):\n print(\"===\")\n else:\n print(*s,sep='')\n \t \t\t \t\t \t \t\t\t \t\t \t\t", "CANT = \"===\"\r\n\r\n\r\ndef solve(n, s):\r\n counts = [0, 0, 0, 0]\r\n wild = 0\r\n for c in s:\r\n i = \"ACTG?\".index(c)\r\n if i < 4:\r\n counts[i] += 1\r\n else:\r\n wild += 1\r\n\r\n if n % 4:\r\n return\r\n target = n // 4\r\n for c in counts:\r\n if c > target:\r\n return\r\n wild -= target - c\r\n if wild < 0:\r\n return\r\n\r\n s = list(s)\r\n todo = [target - c for c in counts]\r\n for i, c in enumerate(s):\r\n ix = \"ACTG?\".index(c)\r\n if ix == 4:\r\n for j, x in enumerate(todo):\r\n if x:\r\n todo[j] -= 1\r\n s[i] = \"ACTG\"[j]\r\n break\r\n return \"\".join(s)\r\n\r\n\r\nn = int(input())\r\ns = input()\r\nans = solve(n, s)\r\nif ans is None:\r\n print(CANT)\r\nelse:\r\n print(ans)\r\n", "def solve(n,s):\r\n a= {\"A\":0,\"G\":0,\"C\":0,\"T\":0,\"?\":0}\r\n if (n%4):\r\n return 0;\r\n ave= n/4 \r\n for i in range(len(s)):\r\n a[s[i]]+= 1 \r\n t= \"ACGT\"\r\n for i in t:\r\n if (a[i]>ave):\r\n return 0;\r\n for i in range(len(s)):\r\n if (s[i]=='?'):\r\n for j in t:\r\n if (a[j]<ave):\r\n a[j]+= 1\r\n print(j,end=\"\")\r\n break\r\n else:\r\n print(s[i],end=\"\")\r\n return 1\r\n\r\nn= int(input())\r\ns= input()\r\nif (solve(n,s)):\r\n pass\r\nelse:\r\n print(\"=\"*3) \r\n", "size = int(input())\r\ngenome = input()\r\n\r\ndef check(string):\r\n listA = []\r\n listG = []\r\n listC = []\r\n listT = []\r\n\r\n for i in string:\r\n if(i == 'A'): listA.append('A')\r\n elif(i == 'G'): listG.append('G')\r\n elif(i == 'C'): listC.append('C')\r\n elif(i == 'T'): listT.append('T')\r\n pass\r\n n = size/4\r\n if(len(listA) > n):\r\n print(\"===\")\r\n elif(len(listG) > n):\r\n print(\"===\")\r\n elif(len(listC) > n):\r\n print( \"===\")\r\n elif(len(listT) > n):\r\n print(\"===\")\r\n else:\r\n listPut = []\r\n new = \"\"\r\n listPut.append((n) - len(listA))\r\n listPut.append((n) - len(listG))\r\n listPut.append((n) - len(listC))\r\n listPut.append((n) - len(listT))\r\n for i in string:\r\n if(i == '?'):\r\n if(listPut[0] > 0):\r\n new += 'A'\r\n listPut[0] -= 1\r\n elif(listPut[1] > 0):\r\n new += 'G'\r\n listPut[1] -= 1\r\n elif(listPut[2] > 0):\r\n new += 'C'\r\n listPut[2] -= 1\r\n elif(listPut[3] > 0):\r\n new += 'T'\r\n listPut[3] -= 1\r\n else:\r\n new += i\r\n pass\r\n print(new)\r\n\r\nif(len(genome) % 4 == 0 ): check(genome) \r\nelse: print(\"===\")\r\n", "n=int(input())\r\ns=str(input())\r\nif(n%4!=0):\r\n\tprint(\"===\")\r\nelse:\r\n\tacount=0\r\n\tgcount=0\r\n\ttcount=0\r\n\tccount=0\r\n\ttemp=0\r\n\tz=n//4\r\n\tfor i in range(0,n):\r\n\t\tif(s[i]=='A'):\r\n\t\t\tacount+=1\r\n\t\telif(s[i]=='G'):\r\n\t\t\tgcount+=1\r\n\t\telif(s[i]=='T'):\r\n\t\t\ttcount+=1\r\n\t\telif(s[i]=='C'):\r\n\t\t\tccount+=1\r\n\t\telse:\r\n\t\t\ttemp+=1\r\n\tif(max(acount,gcount,tcount,ccount)>z):\r\n\t\tprint(\"===\")\r\n\telse:\r\n\t\tnewstring=''\r\n\t\tacount=z-acount\r\n\t\tgcount=z-gcount\r\n\t\ttcount=z-tcount\r\n\t\tccount=z-ccount\r\n\t\tfor i in range(0,n):\t\t\t\r\n\t\t\tif(s[i]=='?'):\r\n\t\t\t\tif(acount>0):\r\n\t\t\t\t\tnewstring+='A'\r\n\t\t\t\t\tacount-=1\r\n\t\t\t\telse:\r\n\t\t\t\t\tif(gcount>0):\r\n\t\t\t\t\t\tnewstring+='G'\r\n\t\t\t\t\t\tgcount-=1\r\n\t\t\t\t\telse:\r\n\t\t\t\t\t\tif(tcount>0):\r\n\t\t\t\t\t\t\tnewstring+='T'\r\n\t\t\t\t\t\t\ttcount-=1\r\n\t\t\t\t\t\telse:\r\n\t\t\t\t\t\t\tnewstring+='C'\r\n\t\t\telse:\r\n\t\t\t\tnewstring+=s[i]\r\n\t\tprint(newstring)\r\n\r\n\r\n\r\n\r\n\r\n", "def main():\n n, l = int(input()), list(input())\n if n % 4:\n print('===')\n return\n cnt = dict.fromkeys('ACGT?', n // 4)\n for c in l:\n cnt[c] -= 1\n del cnt['?']\n if min(cnt.values()) < 0:\n print('===')\n return\n v, cnt = 0, list(cnt.items())\n for i, a in enumerate(l):\n if a == '?':\n while not v:\n c, v = cnt.pop()\n l[i] = c\n v -= 1\n print(''.join(l))\n\n\nif __name__ == '__main__':\n main()\n", "c=lambda s,i:s.count(i)\r\nz=lambda:int(input())\r\nx=lambda:input()\r\nf=lambda:map(int,input().split())\r\nn=z()\r\ns=x()\r\nl=[c(s,'A'),c(s,'C'),c(s,'G'),c(s,'T')]\r\nif any(i>n//4 for i in l) or n%4!=0:\r\n exit(print('==='))\r\ns=s.replace('?','A',n//4-l[0])\r\ns=s.replace('?','C',n//4-l[1])\r\ns=s.replace('?','G',n//4-l[2])\r\ns=s.replace('?','T',n//4-l[3])\r\nprint(s)\r\n", "n = int(input())\r\ns = input()\r\ng = ['A', 'C', 'G', 'T']\r\ng_count = {gene: s.count(gene) for gene in g}\r\n\r\nans = ''\r\n\r\nif n % 4 != 0:\r\n ans = '==='\r\nelse:\r\n for g in g_count:\r\n if g_count[g] > n // 4:\r\n ans = '==='\r\n break\r\n else:\r\n s = s.replace('?', g, n // 4 - g_count[g])\r\n\r\nif ans == '':\r\n print(s)\r\nelse:\r\n print(ans)\r\n", "from sys import stdin\n\nn=int(stdin.readline())\ns=list(stdin.readline().strip())\nif n%4==0:\n a,g,t,c,q=0,0,0,0,0\n for i in s:\n if i=='A':a+=1\n elif i=='G':g+=1\n elif i=='T':t+=1\n elif i=='C':c+=1\n elif i=='?':q+=1\n if n//4<a or n//4<g or n//4<t or n//4<c or n-(a+g+c+t)!=q:\n print(\"===\")\n else:\n p=\"A\"*((n//4)-a)+\"G\"*((n//4)-g)+\"T\"*((n//4)-t)+\"C\"*((n//4)-c)\n j=0\n for i in range(n):\n if s[i]=='?':\n s[i]=p[j]\n j+=1\n print(\"\".join(x for x in s))\n \nelse: print(\"===\")\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\nif N % 4 != 0:\r\n print('===')\r\n exit()\r\nS = list(input())\r\na, c, g, t = 0, 0, 0, 0\r\nq = 0\r\nfor i in range(N):\r\n if S[i] == 'A':\r\n a += 1\r\n elif S[i] == 'C':\r\n c += 1\r\n elif S[i] == 'G':\r\n g += 1\r\n elif S[i] == 'T':\r\n t += 1\r\n else:\r\n q += 1\r\n\r\nM = N // 4\r\nif max([a, c, g, t]) > M:\r\n print('===')\r\n exit()\r\n\r\nfor i in range(N):\r\n if S[i] == '?':\r\n if a < M:\r\n S[i] = 'A'\r\n a += 1\r\n elif c < M:\r\n S[i] = 'C'\r\n c += 1\r\n elif g < M:\r\n S[i] = 'G'\r\n g += 1\r\n else:\r\n S[i] = 'T'\r\n t += 1\r\n\r\nprint(''.join(S))\r\n", "n=int(input())\r\ns=input()\r\nk=0\r\nmydict={\"A\":0,\"C\":0,\"G\":0,\"T\":0}\r\nsum=0\r\nif n%4!=0:\r\n print(\"===\")\r\n exit()\r\nfor i in s:\r\n if i!=\"?\":\r\n mydict[i]+=1\r\nfor i in mydict.values():\r\n if i>n//4:\r\n print(\"===\")\r\n exit()\r\nfor i in range(n):\r\n if s[i]==\"?\":\r\n for j in mydict.keys():\r\n if mydict[j]!=n//4:\r\n mydict[j]+=1\r\n print(j,end=\"\")\r\n break\r\n else:print(s[i],end=\"\")", "import sys\r\nimport math\r\nimport itertools\r\nimport collections\r\n\r\n\r\ndef divs(n, start=1):\r\n r = []\r\n for i in range(start, int(math.sqrt(n) + 1)):\r\n if (n % i == 0):\r\n if (n / i == i):\r\n r.append(i)\r\n else:\r\n r.extend([i, n // i])\r\n return r\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 revn(n): return int(str(n)[::-1])\r\ndef prime(n):\r\n if n == 2: return True\r\n if n % 2 == 0 or n <= 1: return False\r\n sqr = int(math.sqrt(n)) + 1\r\n for d in range(3, sqr, 2):\r\n if n % d == 0: return False\r\n return True\r\ndef convn(number, base=3):\r\n newnumber = ''\r\n while number > 0:\r\n newnumber = str(number % base) + newnumber\r\n number //= base\r\n return newnumber\r\n\r\n\r\nn = ii()\r\ng = list(input())\r\nt = n // 4\r\nd = collections.Counter(g)\r\nif n % 4 != 0 or d['A'] > t or d['C'] > t or d['G'] > t or d['T'] > t:\r\n print('===')\r\nelse:\r\n add = 'A' * (t - d['A']) + 'C' * (t - d['C']) + 'G' * (t - d['G']) + 'T' * (t - d['T'])\r\n j = 0\r\n for i in range(n):\r\n if g[i] == '?':\r\n g[i] = add[j]\r\n j += 1\r\n print(wr(g))\r\n", "import math\r\nfrom collections import defaultdict\r\nml=lambda:map(int,input().split())\r\nll=lambda:list(map(int,input().split()))\r\nii=lambda:int(input())\r\nip=lambda:list(input())\r\n\r\n\"\"\"========main code===============\"\"\"\r\n\r\nn=ii()\r\ns=ip()\r\nd=defaultdict(int)\r\nfor i in s:\r\n d[i]+=1\r\nmx=0 \r\nst=''\r\nfor i in d.keys():\r\n if(i!='?'):\r\n if(d[i]>mx):\r\n mx=max(mx,d[i])\r\n st=i\r\nk=0 \r\n\r\nfor i in ['A','C','T','G']:\r\n k+=mx-d[i]\r\nf=0\r\nif(d['?']<k):\r\n f=1\r\nelse:\r\n d['?']-=k\r\n if(d['?']%4!=0):\r\n f=1\r\n else:\r\n mx+=d['?']//4\r\nif(f):\r\n print(\"===\")\r\nelse:\r\n for i in range(n):\r\n if(s[i]=='?'):\r\n if(d['A']<mx):\r\n d['A']+=1\r\n s[i]='A'\r\n elif(d['C']<mx):\r\n d['C']+=1\r\n s[i]='C'\r\n elif(d['G']<mx):\r\n d['G']+=1\r\n s[i]='G'\r\n else:\r\n d['T']+=1\r\n s[i]='T'\r\n print(\"\".join(s)) \r\n ", "n=int(input())\r\ns=input()\r\nif n%4!=0:\r\n print(\"===\")\r\nelse:\r\n l=\"\"\r\n a=c=g=t=0\r\n for i in s:\r\n if i=='A':\r\n a+=1\r\n elif i=='C':\r\n c+=1\r\n elif i=='G':\r\n g+=1\r\n elif i=='T':\r\n t+=1\r\n h=max(a,c,g,t)\r\n if h>n//4:\r\n print(\"===\")\r\n else:\r\n c=n//4-c\r\n a=n//4-a\r\n g=n//4-g\r\n t=n//4-t\r\n for i in s:\r\n if i!='?':\r\n l+=i\r\n elif c!=0:\r\n c=c-1\r\n l+=\"C\"\r\n elif g!=0:\r\n g=g-1\r\n l+=\"G\"\r\n elif t!=0:\r\n t=t-1\r\n l+=\"T\"\r\n elif a!=0:\r\n a=a-1\r\n l+=\"A\"\r\n print(l)", "n = int(input())\r\ngenome = input()\r\nnucleo_a = genome.count('A')\r\nnucleo_t = genome.count('T')\r\nnucleo_g = genome.count('G')\r\nnucleo_c = genome.count('C')\r\nunknown_nuclei = n - nucleo_a - nucleo_t - nucleo_g - nucleo_c\r\nif unknown_nuclei == 0:\r\n if nucleo_a == nucleo_t and nucleo_t == nucleo_g and nucleo_g == nucleo_c:\r\n print(genome)\r\n else:\r\n print('===')\r\nelif n%4 == 0 and nucleo_c <= n//4 and nucleo_g <= n//4 and nucleo_a <= n//4 and nucleo_t <= n//4:\r\n genome = genome.replace('?', 'A', n//4 - nucleo_a)\r\n genome = genome.replace('?', 'T', n//4 - nucleo_t)\r\n genome = genome.replace('?', 'C', n//4 - nucleo_c)\r\n genome = genome.replace('?', 'G', n//4 - nucleo_g)\r\n print(genome)\r\nelse:\r\n print('===')", "\r\nz=int(input())\r\ns = input()[:z]\r\na = s.count('A')\r\nc = s.count('C')\r\ng = s.count('G')\r\nt = s.count('T')\r\nif z%4!=0:\r\n print('===')\r\n exit()\r\nn=int(z/4)\r\nif a > n or c > n or g > n or t > n:\r\n print('===')\r\n exit()\r\ns = s.replace('?','A',n - a)\r\ns = s.replace('?', 'C',n - c)\r\ns = s.replace('?', 'G',n - g)\r\ns = s.replace('?', 'T',n - t)\r\nprint(s)", "from collections import defaultdict\ndef main():\n\n n = int(input())\n s = list(input())\n d = defaultdict(int)\n chars = [\"A\",\"C\",\"G\",\"T\"]\n ques_index=[]\n max_val = -1\n m = 0\n for i in range(n):\n d[s[i]] += 1\n if s[i]=='?':\n ques_index.append(i)\n m += 1\n else:\n max_val = max(max_val, d[s[i]])\n i = 0\n flag = True\n for char in chars :\n if d[char] < max_val and char != \"?\":\n if max_val-d[char] <= d[\"?\"]:\n for _ in range(max_val-d[char]):\n s[ques_index[i]] = char\n i += 1\n d[\"?\"] -= (max_val-d[char])\n else:\n flag = False\n break\n if flag:\n j = 0\n if d[\"?\"]%4 == 0:\n while i < m:\n s[ques_index[i]] = chars[j%4]\n j += 1\n i += 1\n else:\n flag = False\n\n if flag:\n print(\"\".join(s))\n else:\n print(\"===\")\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\ns = input()\nif n%4!=0:\n print('===')\nelse:\n val = n//4\n ans = str()\n left = s.count('?')\n a = val - s.count('A')\n g = val - s.count('G')\n c = val - s.count('C')\n t = val - s.count('T')\n if a<0 or g<0 or c<0 or t<0:\n ans = '==='\n else:\n for i in s:\n if i=='?':\n if a>0:\n ans+='A'\n a-=1\n elif g>0:\n ans+='G'\n g-=1\n elif c>0:\n ans+='C'\n c-=1\n elif t>0:\n ans+='T'\n t-=1\n else:\n ans += i\n print(ans)\n \t\t \t\t \t \t \t \t \t\t\t\t \t\t", "n, s = int(input()), list(input())\nc, ci = [s.count(b) for b in 'ACGT'], 0\nif n % 4 or max(c) > n // 4:\n\tprint('===')\n\texit()\nfor i in range(n):\n\tif s[i] == '?':\n\t\twhile c[ci] == n // 4:\n\t\t\tci += 1\n\t\ts[i] = 'ACGT'[ci]\n\t\tc[ci] += 1\nprint(''.join(s))\n\t \t\t\t\t\t\t\t \t \t\t\t\t\t\t\t\t \t\t\t \t \t", "\r\nn = int(input())\r\n\r\nw = input()\r\n\r\nlists = list(w)\r\n\r\na = 0\r\nc = 0\r\ng = 0\r\nt = 0\r\n\r\nfor x in lists:\r\n if x == 'A':\r\n a += 1\r\n elif x == 'C':\r\n c += 1\r\n elif x == 'G':\r\n g += 1\r\n elif x == 'T':\r\n t += 1\r\n\r\n\r\n\r\nfor i in range(n):\r\n if lists[i] == '?':\r\n temp = min(a,c,g,t)\r\n if temp == a:\r\n lists[i] = 'A'\r\n a += 1\r\n elif temp == c:\r\n lists[i] = 'C'\r\n c += 1\r\n elif temp == g:\r\n lists[i] = 'G'\r\n g += 1\r\n elif temp == t:\r\n lists[i] = 'T'\r\n t += 1\r\n\r\nif(a == c == g == t):\r\n for x in lists:\r\n print(x, end=\"\")\r\nelse:\r\n print(\"===\")", "def f(string, index, ch):\r\n s = [i for i in string]\r\n s[index] = ch\r\n return ''.join(s)\r\n\r\na=int(input())\r\n\r\nb=input();c=\"\"\r\np=len(b) // 4\r\nfor i in [\"A\", \"G\", \"C\", \"T\"]:\r\n while b.count(i) != p:\r\n j = b.find(\"?\")\r\n if j == -1:\r\n break\r\n b = f(b, j, i)\r\nprint(b if b.count(\"A\") == b.count(\"G\") == b.count(\"C\") == b.count(\"T\") == p and b.find(\"?\") == -1 else \"===\")", "N = int(input())\r\nS = input()\r\n\r\nif N % 4 != 0:\r\n print(\"===\")\r\n\r\nelse:\r\n A = S.count(\"A\")\r\n C = S.count(\"C\")\r\n G = S.count(\"G\")\r\n T = S.count(\"T\")\r\n mean = N // 4\r\n if A > mean or C > mean or G > mean or T > mean:\r\n print(\"===\")\r\n else:\r\n S = list(S)\r\n for i, c in enumerate(S):\r\n if c == '?':\r\n if A < mean:\r\n A += 1\r\n S[i] = 'A'\r\n elif C < mean:\r\n C += 1\r\n S[i] = 'C'\r\n elif G < mean:\r\n G += 1\r\n S[i] = 'G'\r\n else:\r\n T += 1\r\n S[i] = 'T'\r\n print(\"\".join(S))\r\n \r\n ", "import sys\r\nn=int(input())\r\nstr= input()\r\ncnt = n/4\r\na = str.count('A')\r\nc = str.count('C')\r\ng = str.count('G')\r\nt = str.count('T')\r\nques = str.count('?')\r\n\r\nif(n % 4 == 0):\r\n if(a > cnt or c > cnt or g > cnt or t > cnt ):\r\n print(\"===\")\r\n else:\r\n for i in range(len(str)):\r\n if (str[i] == '?' and a < cnt):\r\n str = str[:i] + 'A' + str[i + 1:]\r\n a += 1\r\n ques -= 1\r\n elif (str[i] == '?' and c < cnt):\r\n str = str[:i] + 'C' + str[i + 1:]\r\n c += 1\r\n ques -= 1\r\n elif (str[i] == '?' and g < cnt):\r\n str = str[:i] + 'G' + str[i + 1:]\r\n g += 1\r\n ques -= 1\r\n elif (str[i] == '?' and t < cnt):\r\n str = str[:i] + 'T' + str[i + 1:]\r\n t += 1\r\n ques -= 1\r\n print (str)\r\nelse:\r\n print (\"===\")", "n=int(input())\ns=str(input())\np1=s.count('A')\np2=s.count('C')\np3=s.count('G')\np4=s.count('T')\nl=len(s)\nt=len(s)//4\nl1=[]\n \nfor i in s:\n l1.append(i)\nif len(s)%4!=0:\n print(\"===\")\nelse:\n for i in range(l):\n if l1[i]=='?':\n if p1<t:\n l1[i]='A'\n p1+=1\n elif p2<t:\n l1[i]='C'\n p2+=1\n elif p3<t:\n l1[i]='G'\n p3+=1\n else:\n if p4<t:\n l1[i]='T'\n p4+=1\n if p1==p2 and p1==p3 and p1==p4:\n for i in range(l):\n print(l1[i],end=\"\")\n else:\n print(\"===\")\n\t \t \t\t\t\t\t \t\t \t\t\t \t\t\t \t \t\t", "if __name__ == '__main__':\r\n\tnuckleo = 'ACGT'\r\n\tn = int(input())\r\n\ts_orig = input()\r\n\tdct = {c : 0 for c in nuckleo+'?'}\r\n\tfor c in s_orig:\r\n\t\tdct[c] += 1\r\n\ts = list(s_orig)\r\n\tm = max(dct[c] for c in nuckleo)\r\n\tk = sum(m-dct[c] for c in nuckleo)\r\n\tif k > dct['?'] or n % 4 != 0:\r\n\t\tprint(\"===\")\r\n\telse:\r\n\t\ti = 0\r\n\t\tnuck = 0\r\n\t\t#print(k, dct, s)\r\n\t\twhile k > 0:\r\n\t\t\twhile dct[nuckleo[nuck]] == m:\r\n\t\t\t\tnuck += 1\r\n\t\t\tc = nuckleo[nuck]\r\n\t\t\tif s[i] == '?':\r\n\t\t\t\ts[i] = c\r\n\t\t\t\tk -= 1\r\n\t\t\t\tdct[c] += 1\r\n\t\t\ti += 1\r\n\t\t#print(s)\r\n\t\tnuck = 0\r\n\t\tfor j in range(i, n):\r\n\t\t\tif s[j] == '?':\r\n\t\t\t\ts[j] = nuckleo[nuck]\r\n\t\t\t\tnuck = (nuck+1) % 4\r\n\t\tprint(''.join(s))", "from collections import Counter\n\nlength, gene = int(input()), input()\n\nc = Counter(gene)\nnucls_left = {\"A\": c[\"A\"], \"C\": c[\"C\"], \"G\": c[\"G\"], \"T\": c[\"T\"]}\n\nif length % 4 != 0 or any(value > length / 4 for value in nucls_left.values()):\n print(\"===\")\nelse:\n for letter in gene:\n if letter == \"?\":\n for nucl in nucls_left:\n if nucls_left[nucl] < length / 4:\n print(nucl, end='')\n nucls_left[nucl] += 1\n break\n else:\n print(letter, end='')\n", "n = int(input())\r\nstring = [x for x in input()]\r\ncount = list(map(lambda a: string.count(a),\"ACGT\"))\r\nif n%4 != 0:\r\n exit(print(\"===\"))\r\nelif max(count) > n/4:\r\n exit(print(\"===\"))\r\nremaining = []\r\nfor i in range(4):\r\n if count[i] < n/4:\r\n x = (n/4) - count[i]\r\n \r\n while x != 0:\r\n string[string.index('?')] = \"ACGT\"[i]\r\n x -= 1\r\n\r\nprint(\"\".join(string))\r\n", "n = int(input())\r\ns = input()\r\n\r\nd = dict()\r\nd['A'] = 0\r\nd['C'] = 0\r\nd['G'] = 0\r\nd['T'] = 0\r\nd['?'] = 0\r\nfor i in range(n):\r\n d[s[i]] += 1\r\n \r\nmx = max(d['A'], d['C'], d['G'], d['T'])\r\nr = mx * 4 - (d['A'] + d['C'] + d['G'] + d['T'])\r\n\r\nif r > d['?'] or ((d['?'] - r) % 4):\r\n print('===')\r\nelse:\r\n ans = [0] * n\r\n ans = list(s)\r\n \r\n i = 0\r\n while mx - d['A']:\r\n if s[i] == '?':\r\n ans[i] = 'A'\r\n d['A'] += 1\r\n i += 1\r\n \r\n while mx - d['C']:\r\n if s[i] == '?':\r\n ans[i] = 'C'\r\n d['C'] += 1\r\n i += 1 \r\n \r\n while mx - d['G']:\r\n if s[i] == '?':\r\n ans[i] = 'G'\r\n d['G'] += 1\r\n i += 1 \r\n \r\n while mx - d['T']:\r\n if s[i] == '?':\r\n ans[i] = 'T'\r\n d['T'] += 1\r\n i += 1 \r\n \r\n s1 = 'ACGT'\r\n j = 0\r\n while i < n:\r\n if s[i] == '?':\r\n ans[i] = s1[j]\r\n j = (j + 1) % 4\r\n i += 1 \r\n \r\n print(''.join(map(str, ans)))", "n=int(input())\r\nch=input()\r\nif n % 4 !=0:\r\n print('===')\r\nelse:\r\n a=g=c=t=0\r\n for x in ch:\r\n if x=='A':\r\n a=a+1\r\n if x=='C':\r\n c=c+1\r\n if x=='G':\r\n g=g+1\r\n if x=='T':\r\n t=t+1\r\n if (a>(n // 4))or(g>(n // 4))or(c>(n // 4))or(t>(n // 4)):\r\n print('===')\r\n else:\r\n for i in range(n):\r\n if ch[i]!='?':\r\n print(ch[i],end=\"\")\r\n else:\r\n if a<(n // 4):\r\n print('A',end=\"\")\r\n a=a+1\r\n elif c<(n // 4):\r\n print('C',end=\"\")\r\n c=c+1\r\n elif g<(n // 4):\r\n print('G',end=\"\")\r\n g=g+1\r\n else:\r\n print('T',end=\"\")\r\n", "n=int(input())\r\ns=input()\r\n\r\ndef gen(s,n):\r\n\ta=s.count(\"A\")\r\n\tg=s.count(\"G\")\r\n\tc=s.count(\"C\")\r\n\tt=s.count(\"T\")\r\n\ti=s.count(\"?\")\r\n\tif(n%4!=0):\r\n\t\treturn(\"===\")\r\n\tif(a>n/4):\r\n\t\treturn(\"===\")\r\n\tif(c>n/4):\r\n\t\treturn(\"===\")\r\n\tif(g>n/4):\r\n\t\treturn(\"===\")\r\n\tif(t>n/4):\r\n\t\treturn(\"===\")\r\n\ts=list(s)\r\n\tfor x in range(n):\r\n\t\tif(i==0):\r\n\t\t\treturn ''.join(s)\r\n\t\tif(s[x]==\"?\"):\r\n\t\t\tif(a<n/4):\r\n\t\t\t\ts[x]=\"A\"\r\n\t\t\t\ta+=1\r\n\t\t\t\ti-=1\r\n\t\t\t\tcontinue\r\n\t\t\tif(g<n/4):\r\n\t\t\t\ts[x]=\"G\"\r\n\t\t\t\tg+=1\r\n\t\t\t\ti-=1\r\n\t\t\t\tcontinue\r\n\t\t\tif(c<n/4):\r\n\t\t\t\ts[x]=\"C\"\r\n\t\t\t\tc+=1\r\n\t\t\t\ti-=1\r\n\t\t\t\tcontinue\r\n\t\t\tif(t<n/4):\r\n\t\t\t\ts[x]=\"T\"\r\n\t\t\t\tt+=1\r\n\t\t\t\ti-=1\r\n\t\t\t\tcontinue\r\n\treturn ''.join(s)\r\n\r\nprint(gen(s,n))", "f=int(input())\r\n\r\n\r\nt=list(input())\r\n\r\n\r\nif f%4!=0:\r\n print('===')\r\nelse:\r\n a=t.count('A')\r\n y= t.count('T')\r\n c= t.count('C')\r\n g=t.count('G')\r\n\r\n b=t.count('?')\r\n\r\n\r\n v=f//4\r\n\r\n\r\n if max(a,y,c,g)<=v:\r\n\r\n for j in range(v-a):\r\n t[t.index('?')]='A'\r\n\r\n for j in range(v-y):\r\n t[t.index('?')]='T'\r\n\r\n for j in range(v-c):\r\n t[t.index('?')]='C'\r\n\r\n for j in range(v-g):\r\n t[t.index('?')]='G'\r\n\r\n print(''.join(t))\r\n else:\r\n print('===')\r\n", "n = int(input())\r\ns = input()\r\nls = len(s)\r\n\r\nif (ls % 4):\r\n print(\"===\")\r\n exit()\r\n\r\nupper_bound = ls // 4\r\n\r\nd = {\r\n 'A': 0,\r\n 'C': 0,\r\n 'G': 0,\r\n 'T': 0\r\n}\r\n\r\nfor c in s:\r\n if c != '?':\r\n d[c] += 1\r\n\r\nfor c in d:\r\n if upper_bound - d[c] < 0:\r\n print(\"===\")\r\n exit()\r\n s = s.replace('?', c, upper_bound - d[c])\r\n\r\nprint(s)\r\n", "import re\ndef main():\n n=int(input())\n if n%4!=0:\n print('===')\n return\n t=re.findall('.',input())\n A=B=C=D=E=0\n for i in t:\n if i=='A':A+=1\n elif i=='G':B+=1\n elif i=='C':C+=1\n elif i=='T':D+=1\n else:E+=1\n j=n//4\n if A>j or B>j or C>j or D>j:\n print('===')\n return\n else:\n for i in range(len(t)):\n if t[i]=='?':\n if A!=j:\n t[i]='A'\n A+=1\n elif B!=j:\n t[i]='G'\n B+=1\n elif C!=j:\n t[i]='C'\n C+=1\n elif D!=j:\n t[i]='T'\n D+=1\n print(''.join(t))\n\nmain()\n", "\r\nn=int(input())\r\ns=input()\r\nl=[]\r\nif len(s)%4==0:\r\n l.append(s.count('A'))\r\n l.append(s.count('G'))\r\n l.append(s.count('C'))\r\n l.append(s.count('T'))\r\n if l[0]<=(n/4) and l[1]<=(n/4) and l[2]<=(n/4) and l[3]<=(n/4):\r\n A=(n/4)-l[0]\r\n G=(n/4)-l[1]\r\n C=(n/4)-l[2]\r\n T=(n/4)-l[3]\r\n s=list(s)\r\n for i in range(len(s)):\r\n if s[i]=='?':\r\n if A:\r\n s[i]='A'\r\n A-=1\r\n \r\n elif G:\r\n s[i]='G'\r\n G-=1\r\n \r\n elif C:\r\n s[i]='C'\r\n C-=1\r\n \r\n elif T:\r\n s[i]='T'\r\n T-=1\r\n print(''.join(s))\r\n \r\n \r\n else:\r\n print('===')\r\n \r\n\r\nelse:\r\n print('===')\r\n\r\n", "\r\n\"\"\"\r\n\r\n\"\"\"\r\n\r\nimport sys\r\nfrom sys import stdin\r\n\r\nn = int(stdin.readline())\r\n\r\nS = list(stdin.readline()[:-1])\r\n\r\nif n % 4 != 0:\r\n print (\"===\")\r\n sys.exit()\r\n\r\nlis = [n//4] * 4\r\n\r\ntoi = {}\r\ntoi[\"A\"] = 0\r\ntoi[\"G\"] = 1\r\ntoi[\"C\"] = 2\r\ntoi[\"T\"] = 3\r\ntos = \"AGCT\"\r\n\r\nfor i in S:\r\n\r\n if i in toi:\r\n lis[toi[i]] -= 1\r\n\r\nif min(lis) < 0:\r\n print (\"===\")\r\n sys.exit()\r\n\r\nfor i in range(n):\r\n if S[i] == \"?\":\r\n\r\n for j in range(4):\r\n if lis[j] > 0:\r\n lis[j] -= 1\r\n S[i] = tos[j]\r\n break\r\n\r\nprint (\"\".join(S))\r\n", "n = int(input())\ns = input()\na = c = g = t = 0\n\nif n % 4 != 0:\n print(\"===\")\nelse:\n m = n//4\n for i in range(len(s)):\n if(s[i] == \"A\"):\n a += 1\n elif(s[i] == \"C\"):\n c +=1\n elif(s[i] == \"G\"):\n g +=1\n elif(s[i] == \"T\"):\n t +=1\n s = s.replace(\"?\", \"A\", m-a)\n s = s.replace(\"?\", \"C\", m-c)\n s = s.replace(\"?\", \"G\", m-g)\n s = s.replace(\"?\", \"T\", m-t)\n if s.count(\"A\") == s.count(\"C\") == s.count(\"G\") == s.count(\"T\"):\n print(s)\n else:\n print(\"===\")\n", "n = int(input())\ns = input()\na = 0; c = 0; g = 0; t = 0;\nfor i in s:\t\n\tif i=='A':\n\t\ta += 1\n\telif i=='C':\n\t\tc += 1\n\telif i=='G':\n\t\tg += 1\n\telif i=='T':\n\t\tt += 1\nq = n - (a+c+g+t)\nm = max(a,c,g,t)\nz = n - 4*m\nif z>=0 and z%4==0:\n\tz //= 4\n\ta = m + z - a\n\tc = m + z - c\n\tg = m + z - g\n\tt = m + z - t\n\tfor i in s:\n\t\tif i=='?':\n\t\t\tif a>0:\n\t\t\t\tprint(\"A\",end='')\n\t\t\t\ta -= 1\n\t\t\telif c>0:\n\t\t\t\tprint(\"C\",end='')\n\t\t\t\tc -= 1\n\t\t\telif g>0:\n\t\t\t\tprint(\"G\",end='')\n\t\t\t\tg -= 1\n\t\t\telse:\n\t\t\t\tprint(\"T\",end='')\n\t\t\t\tt -= 1\n\t\telse:\n\t\t\tprint(i,end='')\n\tprint()\nelse:\n\tprint(\"===\")\n", "def solve(n, s):\r\n\tif n % 4 > 0:\r\n\t\treturn '==='\r\n\tfor i in \"ACGT\":\r\n\t\tif 4 * s.count(i) > n:\r\n\t\t\treturn '==='\r\n\tr = ''\r\n\tfor i in \"ACGT\":\r\n\t\tr += i * (n // 4 - s.count(i))\r\n\tj = 0\r\n\tres = ''\r\n\tfor i in s:\r\n\t\tif i == '?':\r\n\t\t\tres += r[j]\r\n\t\t\tj += 1\r\n\t\telse:\r\n\t\t\tres += i\r\n\treturn res\r\n\r\nn = int(input())\r\ns = input()\r\nprint(solve(n, s))\r\n", "n=int(input())\r\ns=input()\r\nif (n%4!=0):\r\n print(\"===\")\r\n \r\nelse:\r\n t=n//4\r\n a=t-s.count(\"A\")\r\n b=t-s.count(\"C\")\r\n c=t-s.count(\"G\")\r\n d=t-s.count(\"T\")\r\n if (a>=0 and b>=0 and c>=0 and d>=0):\r\n e=\"A\"*a+\"C\"*b+\"G\"*c+\"T\"*d\r\n i=0\r\n f=\"\"\r\n for c in s:\r\n if(c=='?'):\r\n f=f+e[i]\r\n i=i+1\r\n else:\r\n f=f+c\r\n print(f)\r\n else:\r\n print(\"===\")\r\n \r\n", "N=int(input())\ns=input()\ncA=s.count('A')\ncG=s.count('G')\ncC=s.count('C')\ncT=s.count('T')\nif(N%4!=0):\n print(\"===\")\nelse:\n #m=max(cA,cG,cC,cT)\n q=N//4\n if(cA<=q and cG<=q and cC<=q and cT<=q):\n nca=abs(cA-q)\n ncg=abs(cG-q)\n ncc=abs(cC-q)\n nct=abs(cT-q)\n for i in range(N):\n if(s[i]=='?'):\n if(nca):\n print(\"A\",end=\"\")\n nca-=1\n elif(ncg):\n print(\"G\",end=\"\")\n ncg-=1\n elif(ncc):\n print(\"C\",end=\"\")\n ncc-=1\n elif(nct):\n print(\"T\",end=\"\")\n nct-=1\n else:\n print(s[i],end=\"\")\n else:\n print(\"===\")\n \n \n \n \n \n \n \t\t\t \t\t\t \t\t\t\t\t\t \t \t\t\t\t \t\t\t", "n = int(input())\nfrom collections import Counter\navg = n // 4\nlet = ['A', 'C', 'G', 'T']\n\ns = input()\ncnt = Counter(s)\n\nif n % 4 > 0 or any(cnt.get(l, 0) > avg for l in let):\n print(\"===\")\n exit()\n\nrep = \"\"\n\nfor l in let:\n rep += (avg - cnt.get(l, 0)) * l\n\nans = list(s)\ncur = 0\n\nfor i in range(n):\n if ans[i] == '?':\n ans[i] = rep[cur]\n cur += 1\n\nprint(\"\".join(ans))", "n=int(input())\na=input()\nv1=a.count(\"A\")\nv2=a.count(\"C\")\nv3=a.count(\"G\")\nv4=a.count(\"T\")\nv5=a.count(\"?\")\nb=n//4\nif n%4!=0:\n print(\"===\")\n exit()\nc=[]\nfor i in range(n):\n if a[i]==\"?\":\n if v1<b:\n c.append('A')\n v1+=1\n elif v2<b:\n c.append('C')\n v2+=1\n elif v3<b:\n c.append('G')\n v3+=1\n elif v4<b:\n c.append('T')\n v4+=1\n else:\n c.append(a[i])\nif v1!=b or v2!=b or v3!=b or v4!=b:\n print(\"===\")\nelse:\n for ele in c:\n print(ele, end=\"\")\n \t \t \t\t\t \t \t\t \t\t \t \t", "n = int(input())\na = input()\nd = {x:0 for x in 'ACGT?'}\nfor i in a:\n\td[i] += 1\nk = 0\nfor i in d:\n\tif i!='?':\n\t\tk = max(k,d[i])\nb = 4*k - n +d['?']\nif b <= d['?'] and (b-d['?'])%4 == 0:\n\tl = b\n\tb = []\n\tfor i in d:\n\t\tif i!='?':\n\t\t\tfor j in range(k-d[i]):\n\t\t\t\tb.append(i)\n\tl = ['A','G','T','C']*((-l + d['?'])//4)\n\tb.extend(l)\n\tfor i in a:\n\t\tif i=='?':\n\t\t\tprint(b.pop(),end='')\n\t\telse:\n\t\t\tprint(i,end='')\nelse:\n\tprint('===')\n\t \t \t\t \t \t\t \t\t \t\t \t\t", "n = int(input())\r\ns = input()\r\na = n // 4 - s.count(\"A\")\r\nc = n // 4 - s.count(\"C\")\r\ng = n // 4 - s.count(\"G\")\r\nt = n // 4 - s.count(\"T\")\r\nq = s.count(\"?\")\r\n\r\nif n % 4 != 0 or q != a + c + g + t or any([i < 0 for i in [a, c, g, t]]):\r\n\tprint(\"===\")\r\nelse:\r\n\ts = s.replace(\"?\", \"A\", a)\r\n\ts = s.replace(\"?\", \"C\", c)\r\n\ts = s.replace(\"?\", \"G\", g)\r\n\ts = s.replace(\"?\", \"T\", t)\r\n\tprint(s)", "n=int(input())\r\ns=input()\r\nd=n%4\r\nif(d):\r\n print(\"===\")\r\nelse:\r\n m=n//4\r\n q=s.count(\"?\")\r\n a=s.count(\"A\")\r\n g=s.count(\"G\")\r\n c=s.count(\"C\")\r\n t=s.count(\"T\")\r\n s=s.replace(\"?\",\"A\",m-a)\r\n s=s.replace(\"?\",\"G\",m-g)\r\n s=s.replace(\"?\",\"C\",m-c)\r\n s=s.replace(\"?\",\"T\",m-t)\r\n q=s.count(\"?\")\r\n a=s.count(\"A\")\r\n g=s.count(\"G\")\r\n c=s.count(\"C\")\r\n t=s.count(\"T\")\r\n print(s if a==g==c==t else \"===\")", "# Расшифровка генома мамонта. Вход - длина строки,строка. Выход - полная строка или ===\nn = int(input())\ns = str(input())\n\ndef genom(n,s):\n s_new,n4 = '', n / 4\n if (n % 4 != 0) or (s.count('A') > n4) or (s.count('T') > n4) or (s.count('G') > n4) or (s.count('C') > n4):\n return '==='\n else: \n As,Ts,Gs,Cs = s.count('A'),s.count('T'),s.count('G'),s.count('C')\n for i in range(len(s)):\n if s[i] in ['A','T','G','C']:\n s_new += s[i]\n else:\n if As < n4: \n s_new += 'A'\n As += 1\n elif Ts < n4: \n s_new += 'T'\n Ts += 1\n elif Gs < n4: \n s_new += 'G'\n Gs += 1\n elif Cs < n4: \n s_new += 'C'\n Cs += 1\n return s_new\n\nprint(genom(n,s))\n", "n = int(input())\r\ns = input()\r\n\r\na = s.count(\"A\")\r\nc = s.count(\"C\")\r\ng = s.count(\"G\")\r\nt = s.count(\"T\")\r\n\r\ntemp = n//4\r\n\r\nif n%4 or a > temp or c > temp or g > temp or t > temp:\r\n print(\"===\")\r\nelse:\r\n s = s.replace(\"?\", \"A\", temp-a)\r\n s = s.replace(\"?\", \"C\", temp-c)\r\n s = s.replace(\"?\", \"G\", temp-g)\r\n s = s.replace(\"?\", \"T\", temp-t)\r\n print(s)\r\n" ]

[ "from collections import defaultdict\r\nimport random\r\nimport sys\r\nreadline=sys.stdin.readline\r\n\r\nclass Graph:\r\n def __init__(self,V,edges=False,graph=False,directed=False,weighted=False,inf=float(\"inf\")):\r\n self.V=V\r\n self.directed=directed\r\n self.weighted=weighted\r\n self.inf=inf\r\n if not graph:\r\n self.edges=edges\r\n self.graph=[[] for i in range(self.V)]\r\n if weighted:\r\n for i,j,d in self.edges:\r\n self.graph[i].append((j,d))\r\n if not self.directed:\r\n self.graph[j].append((i,d))\r\n else:\r\n for i,j in self.edges:\r\n self.graph[i].append(j)\r\n if not self.directed:\r\n self.graph[j].append(i)\r\n else:\r\n self.graph=graph\r\n self.edges=[]\r\n for i in range(self.V):\r\n if self.weighted:\r\n for j,d in self.graph[i]:\r\n if self.directed or not self.directed and i<=j:\r\n self.edges.append((i,j,d))\r\n else:\r\n for j in self.graph[i]:\r\n if self.directed or not self.directed and i<=j:\r\n self.edges.append((i,j))\r\n\r\n def Euler_Path(self,s=None,t=None):\r\n if self.directed:\r\n indegree=[0]*self.V\r\n outdegree=[0]*self.V\r\n graph=[[] for x in range(self.V)]\r\n for tpl in self.edges:\r\n if self.weighted:\r\n u,v,d=tpl\r\n else:\r\n u,v=tpl\r\n indegree[v]+=1\r\n outdegree[u]+=1\r\n graph[v].append(u)\r\n for x in range(self.V):\r\n if indegree[x]+1==outdegree[x]:\r\n if s==None:\r\n s=x\r\n elif s!=x:\r\n return False\r\n elif indegree[x]==outdegree[x]+1:\r\n if t==None:\r\n t=x\r\n elif t!=x:\r\n return False\r\n elif indegree[x]!=outdegree[x]:\r\n return False\r\n if (s,t)==(None,None):\r\n for x in range(self.V):\r\n if graph[x]:\r\n s=x\r\n t=x\r\n break\r\n elif s==None:\r\n s=t\r\n elif t==None:\r\n t=s\r\n elif s==t:\r\n for x in range(self.V):\r\n if indegree[x]!=outdegree[x]:\r\n return False\r\n queue=[t]\r\n euler_path=[]\r\n while queue:\r\n while graph[queue[-1]]:\r\n queue.append(graph[queue[-1]].pop())\r\n x=queue.pop()\r\n euler_path.append(x)\r\n for x in range(self.V):\r\n if graph[x]:\r\n return False\r\n else:\r\n degree=[0]*self.V\r\n graph=[[] for x in range(self.V)]\r\n use_count=[defaultdict(int) for x in range(self.V)]\r\n for tpl in self.edges:\r\n if self.weighted:\r\n u,v,d=tpl\r\n else:\r\n u,v=tpl\r\n degree[v]+=1\r\n degree[u]+=1\r\n graph[u].append(v)\r\n graph[v].append(u)\r\n for x in range(self.V):\r\n if degree[x]%2:\r\n if s==None and t!=x:\r\n s=x\r\n elif t==None and s!=x:\r\n t=x\r\n elif not x in (s,t):\r\n return False\r\n if s==None and t==None:\r\n for x in range(self.V):\r\n if graph[x]:\r\n s=x\r\n t=x\r\n break\r\n else:\r\n s,t=0,0\r\n elif s==None:\r\n s=t\r\n elif t==None:\r\n t=s\r\n elif s!=t:\r\n if degree[s]%2==0 or degree[t]%2==0:\r\n return False\r\n queue=[t]\r\n euler_path=[]\r\n while queue:\r\n while graph[queue[-1]]:\r\n if use_count[queue[-1]][graph[queue[-1]][-1]]:\r\n use_count[queue[-1]][graph[queue[-1]][-1]]-=1\r\n graph[queue[-1]].pop()\r\n else: \r\n queue.append(graph[queue[-1]].pop())\r\n use_count[queue[-1]][queue[-2]]+=1\r\n x=queue.pop()\r\n euler_path.append(x)\r\n for x in range(self.V):\r\n if graph[x]:\r\n return False\r\n if euler_path[0]!=s:\r\n return False\r\n return euler_path\r\n\r\n def LCD(self):\r\n points_lst=self.MIV_DFS(linked_components=True)\r\n edges_lst=[[] for i in range(len(points_lst))]\r\n idx=[None]*self.V\r\n for i in range(len(points_lst)):\r\n for j in range(len(points_lst[i])):\r\n idx[points_lst[i][j]]=(i,j)\r\n for tpl in self.edges:\r\n if self.weighted:\r\n x,y,d=tpl\r\n else:\r\n x,y=tpl\r\n i,j0=idx[x]\r\n i,j1=idx[y]\r\n if self.weighted:\r\n edges_lst[i].append((j0,j1,d))\r\n else:\r\n edges_lst[i].append((j0,j1))\r\n return points_lst,edges_lst\r\n\r\n def MIV_DFS(self,initial_vertices=False,bipartite_graph=False,cycle_detection=False,directed_acyclic=False,euler_tour=False,linked_components=False,lowlink=False,parents=False,postorder=False,preorder=False,subtree_size=False,topological_sort=False,unweighted_dist=False,weighted_dist=False):\r\n if not initial_vertices:\r\n initial_vertices=[s for s in range(self.V)]\r\n seen=[False]*self.V\r\n finished=[False]*self.V\r\n if bipartite_graph:\r\n bg=[None]*self.V\r\n cnt=-1\r\n if directed_acyclic or cycle_detection or topological_sort:\r\n dag=True\r\n if euler_tour:\r\n et=[]\r\n if linked_components:\r\n lc=[]\r\n if lowlink:\r\n order=[None]*self.V\r\n ll=[None]*self.V\r\n idx=0\r\n if parents or cycle_detection or lowlink or subtree_size:\r\n ps=[None]*self.V\r\n if postorder or topological_sort:\r\n post=[]\r\n if preorder:\r\n pre=[]\r\n if subtree_size:\r\n ss=[1]*self.V\r\n if unweighted_dist:\r\n uwd=[self.inf]*self.V\r\n if weighted_dist:\r\n wd=[self.inf]*self.V\r\n for s in initial_vertices:\r\n if seen[s]:\r\n continue\r\n if bipartite_graph:\r\n cnt+=1\r\n bg[s]=(cnt,0)\r\n if linked_components:\r\n lc.append([])\r\n if unweighted_dist:\r\n uwd[s]=0\r\n if weighted_dist:\r\n wd[s]=0\r\n stack=[(s,0)] if self.weighted else [s]\r\n while stack:\r\n if self.weighted:\r\n x,d=stack.pop()\r\n else:\r\n x=stack.pop()\r\n if not seen[x]:\r\n seen[x]=True\r\n stack.append((x,d) if self.weighted else x)\r\n if euler_tour:\r\n et.append(x)\r\n if linked_components:\r\n lc[-1].append(x)\r\n if lowlink:\r\n order[x]=idx\r\n ll[x]=idx\r\n idx+=1\r\n if preorder:\r\n pre.append(x)\r\n for y in self.graph[x]:\r\n if self.weighted:\r\n y,d=y\r\n if not seen[y]:\r\n stack.append((y,d) if self.weighted else y)\r\n if bipartite_graph:\r\n bg[y]=(cnt,bg[x][1]^1)\r\n if parents or cycle_detection or lowlink or subtree_size:\r\n ps[y]=x\r\n if unweighted_dist or bipartite_graph:\r\n uwd[y]=uwd[x]+1\r\n if weighted_dist:\r\n wd[y]=wd[x]+d\r\n elif not finished[y]:\r\n if directed_acyclic and dag:\r\n dag=False\r\n if cycle_detection:\r\n cd=(y,x)\r\n elif not finished[x]:\r\n finished[x]=True\r\n if euler_tour:\r\n et.append(~x)\r\n if lowlink:\r\n for y in self.graph[x]:\r\n if self.weighted:\r\n y,d=y\r\n if ps[x]==y:\r\n continue\r\n ll[x]=min(ll[x],order[y])\r\n if x!=s:\r\n ll[ps[x]]=min(ll[ps[x]],ll[x])\r\n if postorder or topological_sort:\r\n post.append(x)\r\n if subtree_size:\r\n for y in self.graph[x]:\r\n if self.weighted:\r\n y,d=y\r\n if y==ps[x]:\r\n continue\r\n ss[x]+=ss[y]\r\n if bipartite_graph:\r\n bg_=bg\r\n bg=[[[],[]] for i in range(cnt+1)]\r\n for tpl in self.edges:\r\n i,j=tpl[:2] if self.weighted else tpl\r\n if not bg_[i][1]^bg_[j][1]:\r\n bg[bg_[i][0]]=False\r\n for x in range(self.V):\r\n if bg[bg_[x][0]]:\r\n bg[bg_[x][0]][bg_[x][1]].append(x)\r\n retu=()\r\n if bipartite_graph:\r\n retu+=(bg,)\r\n if cycle_detection:\r\n if dag:\r\n cd=[]\r\n else:\r\n y,x=cd\r\n cd=self.Route_Restoration(y,x,ps)\r\n retu+=(cd,)\r\n if directed_acyclic:\r\n retu+=(dag,)\r\n if euler_tour:\r\n retu+=(et,)\r\n if linked_components:\r\n retu+=(lc,)\r\n if lowlink:\r\n retu=(ll,)\r\n if parents:\r\n retu+=(ps,)\r\n if postorder:\r\n retu+=(post,)\r\n if preorder:\r\n retu+=(pre,)\r\n if subtree_size:\r\n retu+=(ss,)\r\n if topological_sort:\r\n if dag:\r\n tp_sort=post[::-1]\r\n else:\r\n tp_sort=[]\r\n retu+=(tp_sort,)\r\n if unweighted_dist:\r\n retu+=(uwd,)\r\n if weighted_dist:\r\n retu+=(wd,)\r\n if len(retu)==1:\r\n retu=retu[0]\r\n return retu\r\n\r\nN,M=map(int,readline().split())\r\nedges=[]\r\ndegree=[0]*N\r\nfor _ in range(M):\r\n a,b=map(int,readline().split())\r\n a-=1;b-=1\r\n edges.append((a,b))\r\n degree[a]+=1;degree[b]+=1\r\nG=Graph(N,edges=edges)\r\nP_lst,E_lst=G.LCD()\r\nodd_points=[]\r\nidx=[None]*N\r\nl=len(P_lst)\r\nfor i in range(l):\r\n P,E=P_lst[i],E_lst[i]\r\n for p in P:\r\n idx[p]=i\r\n if degree[p]%2:\r\n odd_points.append(p)\r\nl=len(odd_points)\r\nfor i in range(l//2):\r\n if idx[odd_points[i]]!=idx[odd_points[l-1-i]]:\r\n edges.append((odd_points[i],odd_points[l-1-i]))\r\n degree[odd_points[i]]+=1;degree[odd_points[l-1-i]]+=1\r\nG=Graph(N,edges=E)\r\n\r\nP_lst,E_lst=G.LCD()\r\nl=len(P_lst)\r\nidx=[None]*N\r\nodd_points=[]\r\nfor i in range(l):\r\n for p in P_lst[i]:\r\n idx[p]=i\r\n if degree[p]%2:\r\n odd_points.append(p)\r\nif odd_points:\r\n j=idx[odd_points[0]]\r\nelse:\r\n j=None\r\nfor i in range(l):\r\n if i==j:\r\n continue\r\n if odd_points:\r\n x=odd_points.pop();y=odd_points.pop()\r\n edges.append((P[i],x))\r\n edges.append((P[i],y))\r\n degree[P[i]]+=2\r\n degree[x]+=1\r\n degree[y]+=1\r\nif odd_points:\r\n l=len(odd_points)\r\n for i in range(l//2):\r\n edges.append((odd_points[i],odd_points[l-1-i]))\r\n degree[odd_points[i]]+=1;degree[odd_points[l-1-i]]+=1\r\nG=Graph(N,edges=edges)\r\nP_lst,E_lst=G.LCD()\r\nl=len(P_lst)\r\nfor i in range(1,l):\r\n edges.append((P_lst[0][0],P_lst[i][0]))\r\n edges.append((P_lst[0][0],P_lst[i][0]))\r\n degree[P_lst[0][0]]+=1;degree[P_lst[i][0]]+=1\r\n degree[P_lst[0][0]]+=1;degree[P_lst[i][0]]+=1\r\nif len(edges)%2:\r\n edges.append((0,0))\r\nG=Graph(N,edges=edges)\r\ntour=G.Euler_Path()\r\nl=len(edges)\r\nprint(l)\r\nfor i in range(l):\r\n a=tour[i]+1\r\n b=tour[i+1]+1\r\n if i%2:\r\n a,b=b,a\r\n print(a,b)" ]

[ "from bisect import bisect_right\r\nn = int(input())\r\nt = list(map(int, input().split()))\r\nt.sort()\r\nfor i in range(1, n):\r\n t[i] += t[i - 1]\r\ni = bisect_right(t, 350)\r\nj = bisect_right(t, 710)\r\nprint(j, sum(t[k] for k in range(i, j)) - 350 * (j - i))", "n = input()\r\na = sorted(map(int, input().split()))\r\nans = 0; t = 10; pen = 0\r\nfor i in a:\r\n t += i\r\n if t > 720:\r\n break\r\n ans += 1\r\n pen += max(0, t - 360)\r\nprint(ans, pen)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\ns,ts,p = 0,10,0\r\nfor i in range(0,n):\r\n\tif(ts+a[i]<=720):\r\n\t\tts=ts+a[i]\r\n\telse:\r\n\t\tbreak;\r\n\ts=s+max(0,ts-360)\r\n\tp=p+1\r\nprint(p,s)\r\n", "import sys\nfrom itertools import *\nfrom math import *\ndef solve():\n n = int(input())\n a = list(map(int, input().split()))\n a.sort()\n time = -6*60 + 10\n maxtime = 6 * 60\n completed = 0\n penalty = 0\n for i, val in enumerate(a):\n timefinish = time + val\n if timefinish <= maxtime:\n penalty += max(0, timefinish)\n completed+=1\n time = timefinish\n print(completed, penalty)\n\n\n\n\nif sys.hexversion == 50594544 : sys.stdin = open(\"test.txt\")\nsolve()", "__author__ = 'Alex'\r\nn = int(input())\r\na = [int(i) for i in input().split()]\r\na.sort()\r\ns = 10\r\ni = 0\r\nwhile i < n and a[i] + s <= 360:\r\n s += a[i]\r\n i += 1\r\nans = 0\r\nwhile i < n and a[i] + s <= 720:\r\n s += a[i]\r\n ans += s - 360\r\n i += 1\r\nprint(i, ans)", "N = int(input())\nnums = list(map(int, input().split()))\nnums.sort()\n\nfulltime = 720\nstart = 10\npenalty = 0\nprobs = 0 \n\nfor t in nums:\n if t+start <= fulltime:\n start += t\n probs += 1\n if start > 360:\n penalty += (start - 360)\n\nprint(probs, penalty)" ]

[ "f=200001;v=[0]*f;g=[[]for _ in[0]*f];s=[1];n,m,k=map(int,input().split())\r\nfor _ in range(m):a,b=map(int,input().split());g[b]+=a,;g[a]+=b,\r\nwhile 1:\r\n v[s[-1]]=1\r\n for i in g[s[-1]]:\r\n if v[i]<1:s+=i,;break\r\n else:\r\n t=set(g[s[-1]])\r\n for i in range(len(s)):\r\n if s[i]in t:exit(print(len(s)-i,*s[i:]))" ]

[ "n = int(input())\ns = input()\n\nans = 0\nFind = \"\"\n\nfor i in range(n - 1):\n c = 0\n for j in range(n - 1):\n if s[i] == s[j] and s[i + 1] == s[j + 1]:\n c += 1\n if ans < c:\n ans = max(ans, c)\n Find = s[i:i+2]\n\nprint(Find)\n\n \t\t\t\t\t \t\t \t \t\t\t \t \t \t \t\t", "n = int(input())\r\ns = input()\r\nd = {}\r\nfor i in range(len(s)-1):\r\n ss = s[i]+s[i+1]\r\n if ss not in d.keys():\r\n d[ss] = 0\r\n d[ss] += 1\r\nmx = 0\r\nmx_ss = \"\"\r\nfor k in d.keys():\r\n if mx < d[k]:\r\n mx = d[k]\r\n mx_ss = k\r\nprint(mx_ss)\r\n", "number = int(input())\r\nletters = input()\r\ndict = {}\r\nfor i in range(0, number - 1):\r\n if letters[i:i+2] not in dict:\r\n dict[letters[i:i+2]] = 1\r\n else:\r\n dict[letters[i:i + 2]] += 1\r\nans = 0\r\nans_str = ''\r\nfor value in dict.items():\r\n if value[1] > ans:\r\n ans = value[1]\r\n ans_str = value[0]\r\nprint(ans_str)", "def find_most_frequent_two_gram(s):\n two_grams = {}\n\n for i in range(len(s) - 1):\n two_gram = s[i:i+2]\n if two_gram in two_grams:\n two_grams[two_gram] += 1\n else:\n two_grams[two_gram] = 1\n\n most_frequent_two_gram = max(two_grams, key=two_grams.get)\n\n return most_frequent_two_gram\n\nn = int(input())\ns = input()\n\nmost_frequent_two_gram = find_most_frequent_two_gram(s)\n\nprint(most_frequent_two_gram)\n\n \t \t \t \t\t\t \t\t\t\t \t \t\t\t\t \t", "a = int(input())\nb = list(input())\n\nc = list()\n\nd = {}\n\n\nfor i in range(1, a):\n c.append(b[i-1]+\"\"+b[i])\n \ne = \"\"\n\nfor i in c:\n if i in d:\n d[i] +=1\n \n if(d[e] < d[i]):\n e = i\n \n else:\n d[i] = 1 \n if (e == \"\"):\n e = i \n \n\n\nprint(e)\n \t \t \t \t\t\t \t \t \t \t\t\t\t\t", "n = int(input())\ns = input()\n\ndos_gramos = {}\nmax_frecuencia = 0\nresultado = \"\"\n\nfor i in range(n - 1):\n dos_gramo = s[i:i+2]\n if dos_gramo in dos_gramos:\n dos_gramos[dos_gramo] += 1\n else:\n dos_gramos[dos_gramo] = 1\n\n if dos_gramos[dos_gramo] > max_frecuencia:\n max_frecuencia = dos_gramos[dos_gramo]\n resultado = dos_gramo\n\nprint(resultado)\n\n\t \t\t \t\t\t\t\t \t\t\t\t\t\t \t \t \t \t \t", "\r\nn = int(input())\r\ns = input()\r\nd = dict()\r\nfor i in range(1,len(s)):\r\n sub=s[i-1:i+1]\r\n cur = d.get(sub,0)\r\n d[sub]=cur+1\r\nmx= 0\r\nans =\"\"\r\nfor x in d.keys():\r\n if(d[x]>mx):\r\n mx =d[x]\r\n ans= x\r\nprint(ans)", "n = input()\r\na = input()\r\nt = {}\r\nl, r = 0, 1\r\n\r\nwhile r < len(a):\r\n if a[l:r+1] in t:\r\n t[a[l:r+1]] += 1\r\n else:\r\n t[a[l:r+1]] = 1\r\n l+=1\r\n r+= 1\r\n\r\n\r\nsorted_t = dict(sorted(t.items(), key=lambda x: x[1] ,reverse=True))\r\nprint(list(sorted_t)[0])\r\n", "n = int(input())\r\ns = input()\r\ntwo_gram = ''\r\ntwo_gram_count = 0\r\ngram_idx = 0\r\nwhile gram_idx < n-1:\r\n test = s[gram_idx:gram_idx+2]\r\n count = 0\r\n for idx, i in enumerate(s[:-1]):\r\n if i + s[idx+1] == test:\r\n count += 1\r\n \r\n if count >= two_gram_count:\r\n two_gram = test\r\n two_gram_count = count\r\n\r\n gram_idx += 1\r\n\r\nprint(two_gram)\r\n", "def sub_cnt(s, c):\r\n cnt = 0\r\n for i in range(len(s)-1):\r\n if s[i] == c[0] and s[i+1] == c[1]:\r\n cnt+=1\r\n return cnt\r\nn = int(input())\r\ns = input()\r\nbest = 0\r\nalt_str = \"\"\r\nfor i in range(26):\r\n for j in range(26):\r\n k = chr(i+65)+chr(j+65)\r\n if sub_cnt(s, k) > best:\r\n best = sub_cnt(s, k)\r\n alt_str = k\r\nprint(alt_str)", "n = int(input())\r\ns = input()\r\n\r\ndugramm = \"\"\r\nmax_gramm = \"\"\r\nmax_k = 0\r\nfor i in range(n - 1):\r\n k = 0\r\n dugramm += (s[i] + s[i + 1])\r\n\r\n for j in range(n - 1):\r\n if s[j] + s[j + 1] == dugramm:\r\n k += 1\r\n\r\n if k > max_k:\r\n max_k = k\r\n max_gramm = dugramm\r\n\r\n dugramm = \"\"\r\n\r\nprint(max_gramm)\r\n", "def most_frequent(List):\r\n return max(set(List), key = List.count)\r\n \r\nn=int(input())\r\ns=input()\r\na=[]\r\nfor i in range(n-1):\r\n word= s[i]+s[i+1]\r\n a.append(word)\r\nprint(most_frequent(a))", "n = int(input())\r\ns = input()\r\nd = {}\r\nfor i in range(n - 1):\r\n if s[i : i + 2] in d:\r\n d[s[i : i + 2]] += 1\r\n else:\r\n d[s[i : i + 2]] = 1\r\nans = \"\"\r\nmaxi = 0\r\nfor i in d:\r\n if d[i] > maxi:\r\n maxi = d[i]\r\n ans = i\r\nprint(ans)\r\n", "n=int(input())\ncadena=input()\ndict={}\n\nfor i in range(n-1):\n x=cadena[i]+cadena[i+1]\n if x in dict:\n dict[x] +=1\n else:\n dict[x] =1\n\nmaxc=''\nmaxn=0\nfor i,j in dict.items():\n if j>maxn:\n maxc=i\n maxn=j\n\nprint(maxc)\n\t \t\t\t\t\t \t\t\t\t\t \t \t \t \t\t \t", "n = int(input())\r\ncadena = input()\r\n\r\ndef similitudes(sub):\r\n contador = 0\r\n\r\n for i in range(len(cadena) - 1):\r\n if cadena[i] == sub[0] and cadena[i + 1] == sub[1]:\r\n contador += 1\r\n\r\n return contador\r\n\r\ntotalSimilitudes = 0\r\nresultado = \"\"\r\n\r\nfor i in range(len(cadena) - 1):\r\n sub = cadena[i:i + 2]\r\n\r\n x = similitudes(sub)\r\n\r\n if x > totalSimilitudes:\r\n totalSimilitudes = x\r\n resultado = sub\r\n\r\nprint(resultado)", "n = int(input())\r\ns = input()\r\nd = dict()\r\ns1 = ''\r\npos = []\r\nm = -1\r\nans = ''\r\nfor i in range(n - 1):\r\n s1 = s[i] + s[i + 1]\r\n if s1 not in d:\r\n d[s1] = 0\r\n pos.append(s1)\r\n d[s1] += 1\r\n if d[s1] > m:\r\n m = d[s1]\r\n \r\nfor i in pos:\r\n if d[i] == m:\r\n print(i)\r\n break", "from collections import defaultdict\r\n\r\n\r\ndef solve():\r\n x = int(input())\r\n s = input()\r\n dct = defaultdict(int)\r\n for i in range(x-1):\r\n dct[s[i]+s[i+1]] += 1\r\n ans = sorted(dct.items(), key=lambda item: item[1])\r\n print(ans[-1][0])\r\n\r\n\r\n# t = int(input())\r\nt = 1\r\nwhile t:\r\n solve()\r\n t -= 1\r\n", "def get_key(d, value):\r\n for k, v in d.items():\r\n if v == value:\r\n return k\r\n\r\n\r\n\r\nn = int(input())\r\ns = input()\r\nd = dict()\r\ns1 = ''\r\nm = -1\r\nfor i in range(n - 1):\r\n s1 = s[i] + s[i + 1]\r\n if s1 not in d:\r\n d[s1] = 0\r\n d[s1] += 1\r\n if d[s1] > m:\r\n m = d[s1]\r\nprint(get_key(d, m))\r\n \r\n", "def maxxer(lst):\n return max(set(lst), key=lst.count)\nn = int(input())\ngrams = []\nstring = input()\nfor i in range(n-1):\n grams.append(str(string[i]+string[i+1]))\n\nprint(maxxer(grams))\n", "n = int(input())\r\ns = input()\r\n\r\nfreq = {}\r\ntemp = s[0]\r\nmaxi = 0\r\n\r\nfor i in range(1,n):\r\n temp += s[i]\r\n if temp not in freq:\r\n freq[temp] = 0\r\n freq[temp] += 1\r\n maxi = max(maxi,freq[temp])\r\n temp = s[i]\r\n\r\nfor k in freq.keys():\r\n if freq[k] == maxi:\r\n print(k)\r\n break", "n = int(input())\ns = input()\nz = {}\nfor i in range(n - 1):\n x = s[i:i + 2]\n if x in z:\n z[x] += 1\n else:\n z[x] = 1\ny = max(z, key=z.get)\nprint(y)\n\n\t\t\t\t\t\t \t \t\t\t \t \t\t \t\t\t\t\t", "import math \r\ndef rng(n,s):\r\n alist=[f for f in s]\r\n blist=[]\r\n for j in range(len(alist)-1):\r\n blist.append([alist[j],alist[j+1]])\r\n clist=[]\r\n for j in blist:\r\n if j not in clist:\r\n clist.append(j)\r\n dlist=[]\r\n for t in clist:\r\n dlist.append(blist.count(t))\r\n f=clist[dlist.index(max(dlist))]\r\n return f\r\nn=int(input())\r\ns=input()\r\nm=rng(n,s)\r\nfor f in m:\r\n print(f,end=\"\")", "\r\n\r\n\r\nclass Solution:\r\n\r\n\r\n def __init__(self):\r\n\r\n ABC = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\n self.table = {}\r\n\r\n def submit(self, twogram):\r\n\r\n if twogram not in self.table:\r\n self.table[twogram] = 0\r\n self.table[twogram] += 1\r\n\r\n def getMostCommon(self):\r\n\r\n count = -1\r\n ans = \"AA\"\r\n for k in self.table:\r\n if self.table[k] > count:\r\n count = self.table[k]\r\n ans = k\r\n\r\n return ans\r\n\r\n def solve(self, s):\r\n\r\n n = len(s)\r\n\r\n for i in range(n-1):\r\n section = s[i:i+2]\r\n self.submit(section)\r\n\r\n return self.getMostCommon()\r\n \r\n\r\nn = input()\r\ns = input()\r\n\r\nsolver = Solution()\r\n\r\nans = solver.solve(s)\r\nprint(ans)", "nv = int(input()) \r\nsb = input() \r\ncs = {}\r\nfor i in range(nv-1):\r\n tg = sb[i:i+2] \r\n if tg in cs: \r\n cs[tg] += 1\r\n else: \r\n cs[tg] = 1\r\nmax = 0\r\nrr = \"\" \r\nfor tg, c in cs.items(): \r\n if c > max: \r\n max = c\r\n rr = tg\r\n\r\nprint(rr)", "n = int(input())\r\ns = input()\r\ntwo_gram_dict = {}\r\nfor i in range(n):\r\n if s[i: i + 2] not in two_gram_dict.keys():\r\n two_gram_dict[s[i: i + 2]] = 1\r\n else:\r\n two_gram_dict[s[i: i + 2]] += 1\r\nprint(list({k: v for k, v in sorted(two_gram_dict.items(), key=lambda item: item[1], reverse=True)})[0])\r\n", "count_time=False\r\nif count_time:\r\n import time\r\n start_time = time.time()\r\n#------------------------------------------\r\nfrom collections import Counter\r\nn=int(input())\r\na=input()\r\nb=dict()\r\npre=a[0]\r\nmaxo=0\r\nmaxs=''\r\nfor i in range(1,n):\r\n x=pre+a[i]\r\n b[x]=b.get(x,0)+1\r\n if b[x]>maxo:\r\n maxo=b[x]\r\n maxs=x\r\n pre=a[i]\r\nprint(maxs)\r\n#------------------------------------------\r\nif count_time:\r\n end_time = time.time()\r\n print('----------------\\nRunning time: {} s'\r\n .format(end_time - start_time))\r\n", "from collections import defaultdict\nn=int(input())\ns=input()\nmp=defaultdict(int)\nst=s[:2]\nfor i in range(1,n):\n mp[s[i-1:i+1]]+=1\n if mp[s[i-1:i+1]]>mp[st]:\n st=s[i-1:i+1]\nprint(st)", "n = int(input())\r\na = input()\r\nc,ne = None,None\r\nd = {}\r\nfor i in range(n):\r\n if c == None:\r\n c = a[i] \r\n elif ne == None:\r\n ne = a[i] \r\n else:\r\n s = c+ne \r\n if s not in d:\r\n d[s] = 0 \r\n d[s] += 1 \r\n c = ne \r\n ne = a[i]\r\nif c != None and ne != None:\r\n s= c+ne \r\n if s not in d:\r\n d[s] = 0 \r\n d[s] += 1\r\nmx = -1\r\nm = None \r\nfor i in d:\r\n if d[i] > mx:\r\n mx = d[i] \r\n m = i \r\nprint(m)", "n = int(input())\r\ns = input().strip()\r\n\r\ntwo_grams_count = {}\r\nfor i in range(n - 1):\r\n two_gram = s[i:i+2]\r\n if two_gram in two_grams_count:\r\n two_grams_count[two_gram] += 1\r\n else:\r\n two_grams_count[two_gram] = 1\r\nmax_two_gram = max(two_grams_count, key=two_grams_count.get)\r\n\r\nprint(max_two_gram)\r\n", "# Two-gram\r\nn = input()\r\ns = input()\r\nd = {}\r\nfor i in range(len(s)-1):\r\n d[f\"{s[i]}{s[i+1]}\"] = d.get(f\"{s[i]}{s[i+1]}\",0)+1\r\nm = max(d.values())\r\nfor x,y in d.items():\r\n if y == m:\r\n print(x)\r\n break ", "# Input\nn = int(input())\ns = input()\n\n# Initialize a dictionary to store the frequency of each two-gram\ntwo_gram_frequency = {}\n\n# Iterate through the string and count the frequency of each two-gram\nfor i in range(n - 1):\n two_gram = s[i:i + 2]\n if two_gram in two_gram_frequency:\n two_gram_frequency[two_gram] += 1\n else:\n two_gram_frequency[two_gram] = 1\n\n# Find the two-gram with the maximum frequency\nmost_frequent_two_gram = max(two_gram_frequency, key=two_gram_frequency.get)\n\n# Output the most frequent two-gram\nprint(most_frequent_two_gram)\n\n \t \t \t\t \t \t \t\t\t\t\t \t\t \t\t\t\t", "n = int(input())\r\ns = input()\r\n\r\ndugram = dict()\r\nfor i in range(n - 1):\r\n dug = s[i] + s[i + 1]\r\n if dug not in dugram:\r\n dugram[dug] = 1\r\n else:\r\n dugram[dug] += 1\r\n\r\nprint(max(dugram.keys(), key=lambda x: dugram[x]))\r\n", "def check(s,t):\r\n c=0\r\n n=len(s)\r\n for i in range(n-1):\r\n if(s[i]+s[i+1]==t):c+=1\r\n return c\r\n \r\ndef check2(s):\r\n n=len(s)\r\n d={}\r\n m=-1000\r\n for i in range(n-1):\r\n t=s[i]+s[i+1]\r\n d[t]=check(s,t)\r\n if(check(s,t)>m):m=check(s,t)\r\n for i in d:\r\n if(d[i]==m):\r\n return i\r\n break\r\nn=int(input())\r\ns=input()\r\nprint(check2(s))", "n = int(input())\ns = input()\ncontador = {}\nfor i in range(n - 1):\n duos = s[i:i+2]\n if duos in contador:\n contador[duos] += 1\n else:\n contador[duos] = 1\n\nmayorRep = max(contador, key=contador.get)\nprint(mayorRep)\n \t \t \t \t\t \t\t\t\t\t\t", "line = input()\nn = int(line)\n\nline = input()\n\ncount = {}\n\nfor i in range(n - 1):\n two_gram = line[i: i + 2]\n if two_gram in count:\n count[two_gram] += 1\n else:\n count[two_gram] = 1\n\nprint(max(count, key=count.get))\n\n\t \t \t \t\t \t \t \t\t \t\t\t\t\t", "n = int(input())\r\ns = input()\r\na = []\r\nfor i in range(n):\r\n a.append(s[i:i + 2])\r\nmx = 0\r\nfor i in range(len(a)):\r\n mx = max(mx, a.count(a[i]))\r\nfor i in range(len(a)):\r\n if a.count(a[i]) == mx:\r\n print(a[i])\r\n break", "n = int(input())\r\nstring = input()\r\nl, r = 0, 1\r\nmaximum = 0\r\npair_count = {}\r\nwhile r < len(string):\r\n pair_count[string[l:r+1]] = 1 + pair_count.get(string[l:r+1], 0)\r\n maximum = max(pair_count[string[l:r+1]], maximum)\r\n r += 1\r\n l += 1\r\n \r\nfor i in pair_count:\r\n if (maximum == pair_count[i]):\r\n print(i)\r\n break", "n = int(input())\ns = input()\n\ntwo_gram_count = {}\n\nfor i in range(n - 1):\n two_gram = s[i:i+2]\n if two_gram in two_gram_count:\n two_gram_count[two_gram] += 1\n else:\n two_gram_count[two_gram] = 1\n\nmost_frequent_two_gram = max(two_gram_count, key=two_gram_count.get)\n\nprint(most_frequent_two_gram)\n \t\t\t\t\t \t \t\t\t \t\t \t\t \t\t\t \t\t", "n = int(input())\ns= input()\nList = []\n\nfor x in range(n-1):\n List.append(s[x]+s[x+1])\nmaxindex = 0\nmaxcount = 0\nfor x in range(len(List)):\n count = 0\n for y in range(len(List)):\n if y==x:\n continue\n\n if List[y] == List[x]:\n count += 1\n\n if count > maxcount:\n maxcount = count\n maxindex=x\n\n\nprint(List[maxindex])\n\t\t\t \t\t\t\t \t\t \t \t \t\t\t\t\t\t\t \t \t", "n = input()\r\ns = input()\r\nd = {}\r\nfor i in range(len(s) - 1):\r\n a = s[i] + s[i + 1]\r\n if a not in d:\r\n d[a] = 1\r\n else:\r\n d[a] += 1\r\nprint(max(d.items(),key=lambda tup: tup[1])[0])\r\n", "n = int(input())\r\ns = input()\r\n\r\ntwo_gram_counts = {}\r\n\r\nfor i in range(n - 1):\r\n two_gram = s[i:i + 2]\r\n if two_gram in two_gram_counts:\r\n two_gram_counts[two_gram] += 1\r\n else:\r\n two_gram_counts[two_gram] = 1\r\n\r\nmost_frequent_two_gram = max(two_gram_counts, key=two_gram_counts.get)\r\nprint(most_frequent_two_gram)\r\n", "n=int(input())\r\ns=input()\r\na=[s[i:i+2] for i in range(len(s))]\r\nprint(max(a,key=a.count))", "# https://codeforces.com/problemset/problem/977/B\r\nfrom collections import defaultdict\r\n\r\ndef solve(word):\r\n two_grams = defaultdict(lambda: 0)\r\n prev_two_gram = 'A'+word[0]\r\n max_two_gram = ''\r\n for i in range(1, len(word)):\r\n current_two_gram = prev_two_gram[1] + word[i]\r\n two_grams[current_two_gram] += 1\r\n if two_grams[current_two_gram] > two_grams[max_two_gram]:\r\n max_two_gram = current_two_gram\r\n prev_two_gram = current_two_gram\r\n return max_two_gram\r\n\r\ninput()\r\nword = input()\r\nprint(solve(word))\r\n", "t = int(input())\r\nmx = 0\r\nans = {}\r\nl = input()\r\n\r\nif t % 2 != 0:\r\n for i in range(len(l) - 1):\r\n\r\n if l[i:i+2] in ans:\r\n ans[l[i:i+2]] = ans[l[i:i+2]] + 1\r\n else:\r\n ans[l[i:i+2]] = 1\r\n\r\n\r\nelse:\r\n for i in range(len(l)):\r\n\r\n if l[i:i+2] in ans:\r\n ans[l[i:i+2]] = ans[l[i:i+2]] + 1\r\n else:\r\n ans[l[i:i+2]] = 1\r\n\r\nprint(max(ans, key=(lambda k: ans[k])))\r\n\r\n", "q = int(input())\r\nw = input()\r\na = {}\r\nfor i in range(q-1):\r\n if w[i] + w[i+1] in a:\r\n a[w[i] + w[i+1]] += 1\r\n else:\r\n a[w[i] + w[i+1]] = 1\r\nmaax = -1\r\not = 0\r\nfor i in a:\r\n if a[i] > maax:\r\n maax = a[i]\r\n ot = i\r\nprint(ot)", "a=int(input())\r\ns=str(input())\r\ntemp=[]\r\ncount=0\r\nfor i in range(a-1):\r\n count=0\r\n ss=s[i:i+2]\r\n for m in range(a-1):\r\n d=s[m:m+2]\r\n if d==ss:\r\n count+=1\r\n temp.append(count)\r\nd=max(temp)\r\nind=temp.index(d)\r\nprint(s[ind:ind+2])", "def most_frequent_two_gram(n, s):\r\n max_count = 0\r\n most_frequent_gram = \"\"\r\n\r\n for i in range(n - 1):\r\n current_gram = s[i:i+2]\r\n count = 0\r\n\r\n for j in range(n - 1):\r\n if s[j:j+2] == current_gram:\r\n count += 1\r\n\r\n if count > max_count:\r\n max_count = count\r\n most_frequent_gram = current_gram\r\n\r\n return most_frequent_gram\r\n\r\n# Read input\r\nn = int(input())\r\ns = input()\r\n\r\nresult = most_frequent_two_gram(n, s)\r\nprint(result)\r\n\r\n\r\n\r\n\"\"\"\r\n\r\ndef most_frequent_two_gram(n, s):\r\n\r\n max_count = 0\r\n count = 0\r\n most_frequent_gram = \"\"\r\n\r\n for i in range(n - 1):\r\n\r\n current_gram = s[i: i + 2]\r\n # count = s.count(current_gram) returns only direct matches\r\n\r\n \r\n\r\n if count > max_count:\r\n \r\n max_count = count\r\n most_frequent_gram = current_gram\r\n\r\n return most_frequent_gram\r\n\r\n\r\n\r\nn = int(input())\r\ns = input()\r\n\r\nprint(most_frequent_two_gram(n, s))\r\n\r\n\"\"\"", "# Nivel de Complejidad O(n)\nn = int(input())\ns = input()\n\npair_count = {}\n\nfor i in range(n - 1):\n pair = s[i:i+2]\n if pair in pair_count:\n pair_count[pair] += 1\n else:\n pair_count[pair] = 1\n\nmax_pair = max(pair_count, key=pair_count.get)\n\nprint(max_pair)\n\t\t\t\t\t \t\t\t \t \t \t \t \t \t \t\t\t", "n=int(input())\r\nn1=input()\r\nlist1=[]\r\nlist2=[]\r\ncount1=0\r\ncount2=2\r\nfor x in range(n):\r\n list1.append(n1[count1:count2])\r\n count1 += 1\r\n count2+=1\r\nlist1.pop()\r\nmax=0\r\nstr=\"\"\r\nfor x in list1:\r\n a=list1.count(x)\r\n if max<a:\r\n max=a\r\n str=x\r\nprint(str)\r\n", "n = int(input())\r\nstring = input()\r\nd ={}\r\nfor i in range(1, len(string)):\r\n bi = string[i-1: i+1]\r\n if bi not in d.keys():\r\n d[bi] = 1\r\n else:\r\n d[bi]+=1\r\n\r\nmax= 0\r\nresult = \"\"\r\nfor key in d.keys():\r\n if d[key] > max:\r\n result = key\r\n max = d[key]\r\nprint(result)", "IN = lambda type = int:list(map(type, input().split()))\r\n\r\n# for _ in range(int(input())):\r\nn = input()\r\ns = input()\r\ntemp = {}\r\nfor x in range(len(s)-1):\r\n t = s[x:x+2]\r\n if t in temp: temp[t] += 1\r\n else: temp[t] = 1\r\nprint(max(zip(temp.values(), temp.keys()))[1])", "n = int(input())\r\ns = input()\r\na = {}\r\nfor i in range(n-1):\r\n a[s[i]+s[i+1]] = a.get(s[i]+s[i+1], 0)+1\r\nc = max(a.values())\r\nfor k,v in a.items():\r\n if c==v:\r\n print(k)\r\n break", "n = int(input())\r\n\r\ns = input()\r\ndic = {} \r\n\r\nfor i in range(1, n):\r\n if s[i-1]+s[i] not in dic:\r\n dic[s[i-1]+s[i]] = 1 \r\n else:\r\n dic[s[i-1]+s[i]] += 1 \r\n\r\nmx = -1 \r\nans = \"\"\r\nfor i in dic:\r\n if dic[i] > mx:\r\n mx = dic[i]\r\n ans = i\r\nprint(ans)", "# Read input\r\nn = int(input())\r\ns = input()\r\n\r\n# Initialize a dictionary to count two-grams\r\ntwo_gram_count = {}\r\n\r\n# Iterate through the string and count two-grams\r\nfor i in range(n - 1):\r\n two_gram = s[i:i+2]\r\n if two_gram in two_gram_count:\r\n two_gram_count[two_gram] += 1\r\n else:\r\n two_gram_count[two_gram] = 1\r\n\r\n# Find the most frequent two-gram\r\nmost_frequent_two_gram = max(two_gram_count, key=two_gram_count.get)\r\n\r\n# Print the most frequent two-gram\r\nprint(most_frequent_two_gram)\r\n", "a=input()\r\nb=input()\r\nd={}\r\nfor i in range(len(b)-1):\r\n z=b[i]+b[i+1]\r\n if z not in d:\r\n d[z]=1\r\n else:\r\n d[z]+=1\r\n\r\nKeymax = max(d, key= lambda x: d[x])\r\nprint(Keymax)", "n = int(input())\r\nt = input()\r\n\r\nrepetitions = {}\r\n\r\nfor i in range(n - 1):\r\n two_gram = t[i: i + 2]\r\n counter = 0\r\n for j in range(n - 1):\r\n if t[j: j + 2] == two_gram:\r\n counter += 1\r\n repetitions[counter] = two_gram\r\n\r\nprint(repetitions[max(repetitions.keys())])\r\n", "n=int(input())\r\ns=input()\r\ncnt=dict()\r\nmx=-1\r\nans=''\r\nfor i in range(1,n):\r\n tmp=s[i-1:i+1]\r\n cnt[tmp]=cnt.get(tmp,0)+1\r\n if cnt[tmp]>mx:\r\n mx=cnt[tmp]\r\n ans=tmp\r\nprint(ans)", "#https://codeforces.com/problemset/problem/977/B\r\n\r\nn = int(input())\r\ns = input()\r\nsubst_dict = {}\r\nfor x in range(1, n):\r\n subst_string = s[x-1:x+1]\r\n if(subst_string not in subst_dict):\r\n subst_dict[subst_string] = 1\r\n else:\r\n subst_dict[subst_string] += 1\r\nprint(max(subst_dict, key=subst_dict.get))", "n=int(input())\r\ns=input()\r\nd={}\r\nfor i in range(len(s)-1):\r\n temp=\"\"\r\n temp+=(s[i]+s[i+1])\r\n if temp not in d:\r\n d[temp]=1\r\n else:\r\n d[temp]+=1\r\nmaxi=0\r\nans=\"\"\r\nfor i in d:\r\n if d[i]>maxi:\r\n maxi=d[i]\r\n ans=i\r\nprint(ans)", "n = int(input())\r\ns = input()\r\nmax_s = \"\"\r\nm = 0\r\ni = 1\r\ncount = 0\r\n\r\nwhile i < len(s):\r\n temp = \"\".join(list(s)[i-1:i+1:])\r\n res = sum(1 for i in range(len(s))\r\n if s.startswith(temp, i))\r\n if res > m:\r\n max_s = temp\r\n m = res\r\n i += 1\r\nprint(max_s)\r\n \r\n\r\n", "i=input;i();a=i();b=[*zip(a,a[1:])];print(''.join(max(b,key=b.count)))", "n = int(input())\r\nline = input()\r\n\r\ncount = {}\r\n\r\nfor i in range(n-1):\r\n if line[i:i+2] in count:\r\n count[line[i:i+2]] += 1\r\n else:\r\n count[line[i:i+2]] = 1\r\n\r\nmost = 0\r\ngram = \"\"\r\n\r\nfor key, val in count.items():\r\n if val > most:\r\n gram = key\r\n most = val\r\n \r\nprint(gram)", "ln = int(input())\r\ns = input()\r\nmx = 0\r\ndc = {}\r\nstupidqeustion = []\r\nfor i in range(1,ln):\r\n if s[i-1]+s[i] in dc:\r\n dc[s[i-1]+s[i]]+=1\r\n else:\r\n dc[s[i-1]+s[i]]=1\r\n if dc[s[i-1]+s[i]]>=mx:\r\n if dc[s[i-1]+s[i]]==mx:\r\n stupidqeustion.append(s[i-1]+s[i])\r\n else:\r\n stupidqeustion = [s[i-1]+s[i]]\r\n mx = dc[s[i-1]+s[i]]\r\nstupidqeustion.sort()\r\nprint(stupidqeustion[0])", "n = int(input())\r\n\r\ns = input()\r\nsubstrings = []\r\n\r\nfor i in range(len(s) - 1):\r\n\tsubstrings.append(s[i] + s[i + 1])\r\n\r\ncounts = {}\r\n\r\nfor j in set(substrings):\r\n\tif substrings.count(j) not in counts:\r\n\t\tcounts[substrings.count(j)] = [j]\r\n\telse:\r\n\t\tcounts[substrings.count(j)].append(j)\r\nprint(counts[max(counts.keys())][0])", "n = int(input())\npalabra = input()\n\nsilabas = {}\nmax_frecuencia = 0\nresultado = \"\"\n\nfor i in range(n - 1):\n silaba = palabra[i:i + 2]\n if silaba in silabas:\n silabas[silaba] += 1\n else:\n silabas[silaba] = 1\n\n if silabas[silaba] > max_frecuencia:\n max_frecuencia = silabas[silaba]\n resultado = silaba\n\nprint(resultado)\n\t\t\t \t \t \t\t\t \t\t \t \t\t\t \t\t\t\t", "n=int(input())\r\n\r\ns=input()\r\n\r\ndi={}\r\nfor i in range(n):\r\n if s[i:i+2] in di:\r\n di[s[i:i+2]]+=1\r\n else:\r\n di[s[i:i+2]]=1\r\nvalues = list(di.values())\r\nvalues.sort(reverse=True)\r\nv=(values[0])\r\nfor i in di:\r\n if di[i]==v:\r\n ans=i\r\n break\r\nprint(ans)\r\n\r\n\r\n", "n = int(input())\r\nd = []\r\nsq = input()\r\nfor i in range(n):\r\n d.append(sq[i]+sq[i+1])\r\n if len(d) == n -1:\r\n break\r\nf = []\r\nfor i in d:\r\n s = 0\r\n for j in d:\r\n if i == j:\r\n s += 1\r\n f.append(s)\r\nprint(d[f.index(max(f))])" ]

[ "# import sys\r\ni=lambda:map(int,input().split())\r\nn,c1,c2=i()\r\ns=input()\r\nco=0\r\nfor j in range(0 , n):\r\n\tif(s[j]=='1'):\r\n\t\tco=co+1\r\n# ans=sys.maxsize\r\nans = c1*1\r\nans += c2*(n-1)*(n-1)*1\r\nfor j in range(2,co+1):\r\n\ta=int(c1*j)\r\n\tb=int((n-j)/j)\r\n\tc=int((n-j)%j)\r\n\ta=int(a+(c2*(b*b)*(j-c))+(c2*(b+1)*(b+1)*c))\r\n\tans=min(a,ans)\r\n \r\nprint(ans) ", "n, c1, c2 = [int(x) for x in input().split(' ')]\r\ns = input()\r\n\r\ncnt = s.count('1')\r\n\r\ndef price(x):\r\n return c1 + c2 * (x - 1) ** 2\r\n\r\nprices = []\r\n\r\nfor i in range(1, cnt + 1):\r\n bigGroupsPeople = n // i + 1\r\n numBigGroups = n % i\r\n smallGroupsPeople = n // i\r\n numSmallGroups = i - n % i\r\n totalPrice = numBigGroups * price(bigGroupsPeople) + numSmallGroups * price(smallGroupsPeople)\r\n prices.append(totalPrice)\r\n\r\nprint(min(prices))", "t = input()\r\nt = t.split()\r\nn = int(t[0])\r\nc1 = int(t[1])\r\nc2 = int(t[2])\r\nt = input()\r\nd = 0\r\nfor i in t:\r\n if(i==\"1\"):\r\n d = d+1\r\n\r\nmin = 10**1488\r\nfor i in range(1, d+1):\r\n t = c1*i + i*c2*(((n//i)-1)**2) + c2*(n%i)*(2*(n//i)-1)\r\n if t<min:\r\n min = t\r\n\r\nprint(min)", "n, m , k = map(int, input().split())\r\na=input()\r\n\r\ncnt1=0\r\n\r\nfor i in range (0,n):\r\n if a[i]=='1':\r\n cnt1+=1\r\n\r\n\r\nans=2000000000000000000000000000000000000\r\n\r\nfor cnt in range(1,cnt1+1):\r\n x=int(n/cnt)\r\n y=n%cnt\r\n \r\n res=(m+k*(x*x))*y\r\n res+=(m+k*(x-1)*(x-1))*(cnt-y)\r\n if ans>res:\r\n ans=res\r\n \r\nprint(ans)", "num_people, cost1, cost2 = map(int, input().split())\r\nadults_count = input().count('1')\r\n\r\ncost_list = []\r\n\r\n\r\nfor i in range(1, adults_count + 1):\r\n cost = cost1 * i\r\n cost += i * cost2 * (((num_people // i) - 1) ** 2) \r\n cost += cost2 * (num_people % i) * (2 * (num_people // i) - 1)\r\n \r\n cost_list.append(cost)\r\n\r\n\r\nprint(min(cost_list))\r\n ", "n0, c10, c20 = input().split()\r\nn, c1, c2 = eval(n0), eval(c10), eval(c20)\r\ns = str(input())\r\nL = len(s)\r\none = 0\r\n\r\nfor i in range(L):\r\n if s[i] == '1':\r\n one += 1\r\n#print(one)\r\nans = -1\r\nfor i in range(1, one + 1):\r\n tmp = i * c1 + i * c2 - 2 * n * c2\r\n base = n // i\r\n left = n % i\r\n# print(\"tmp =\", tmp, end=\" \")\r\n tmp += c2 * (left * (base + 1) * (base + 1) + (i - left) * base * base)\r\n# print(\"tmp +=\", tmp)\r\n if ans == -1:\r\n ans = tmp\r\n else :\r\n ans = min(ans, tmp)\r\n # print(i, ans)\r\nprint(ans)" ]

[ "# Problem G\n\nnum = input()\nnum_list = []\nfor i in range(len(num)):\n num_list.append(int(num[i]))\nmyMod = (10 ** 9) + 7\nlength = len(num_list)\nf = [0] * (length + 1)\nt = [1] * (length + 1)\nfor i in range(length):\n f[i+1] = (f[i] * 10 + 1) % myMod\n t[i+1] = (t[i] * 10) % myMod\nans = 0\nfor i in range(1, 10):\n dp = [0] * (length + 1)\n for j in range(length):\n dp[j+1] = (dp[j] * i + (10 - i) * (dp[j] * 10 + t[j])) % myMod\n c = 0\n ctr = 0\n for k in num_list:\n z = min(i, k)\n o = k - z\n ans += o * (dp[length-1-ctr] * t[c+1] + f[c+1] * t[length-1-ctr]) % myMod\n ans += z * (dp[length-1-ctr] * t[c] + f[c] * t[length-1-ctr]) % myMod\n ans %= myMod\n c += k >= i\n ctr += 1\n ans += f[c]\n if ans >= myMod:\n ans -= myMod\nprint(ans)\n \t \t \t\t\t\t \t \t \t\t \t \t\t" ]

[ "Mod=1000000007\r\nn,k=map(int,input().split(' '))\r\ns=' '+input()\r\nf,fs,g,gs,w=[0]*1000005,[0]*1000005,[0]*1000005,[0]*1000005,[0]*1000005\r\nqx,qw,qb=[0]*1000005,[0]*1000005,[0]*1000005\r\nq=0\r\nf[0]=fs[0]=1\r\nfor i in range(1,n+1):\r\n\tlg=(i-k if i-k>=q else q)\r\n\tif s[i]!='B':\r\n\t\tf[i]=fs[i-1]-fs[lg-1]+Mod\r\n\t\tf[i]-=(Mod if f[i]>=Mod else 0)\r\n\telse:\r\n\t\tf[i]=0\r\n\tfs[i]=fs[i-1]+f[i]\r\n\tfs[i]-=(Mod if fs[i]>=Mod else 0)\r\n\tif s[i]=='W':\r\n\t\tq=i;\r\ng[n+1]=gs[n+1]=1\r\nq=n+1\r\nfor i in range(n,0,-1):\r\n\trg=(i+k if i+k<=q else q)\r\n\tif s[i]!='W':\r\n\t\tg[i]=gs[i+1]-gs[rg+1]+Mod\r\n\t\tg[i]-=(Mod if g[i]>=Mod else 0)\r\n\telse:\r\n\t\tg[i]=0\r\n\tgs[i]=gs[i+1]+g[i]\r\n\tgs[i]-=(Mod if gs[i]>=Mod else 0)\r\n\tif s[i]=='B':\r\n\t\tq=i;\r\nfor i in range(1,n+1):\r\n\tqx[i],qb[i],qw[i]=qx[i-1]+(s[i]=='X'),qb[i-1]+(s[i]=='B'),qw[i-1]+(s[i]=='W')\r\nfor i in range(n,0,-1):\r\n\tw[i]=w[i+1]\r\n\tif s[i]=='X':\r\n\t\tw[i]*=2\r\n\t\tw[i]-=(Mod if w[i]>=Mod else 0)\r\n\tif i+k-1<=n:\r\n\t\tif qb[i+k-1]-qb[i-1]==0:\r\n\t\t\tw[i]+=g[i+k]\r\n\t\t\tw[i]-=(Mod if w[i]>=Mod else 0)\r\nans=0\r\nfor i in range(k,n+1):\r\n\tif qw[i]-qw[i-k]==0:\r\n\t\tans=(ans+f[i-k]*w[i+1])%Mod\r\nprint(ans)" ]

[ "n, m = map(int,input().split())\r\nl = list(map(int,input().split()))\r\n\r\n\r\ndef g(f):\r\n\tA = l[:]; s = 0\r\n\tfor _ in range(n):\r\n\t\ti = A.index(f(A)); s += A[i]\r\n\r\n\t\tif A[i] > 1: A[i] -= 1;\r\n\t\telse:\r\n\t\t\tA.pop(i)\r\n\treturn s\r\nprint (g(max), g(min))", "n,m=map(int,input().split())\r\nlist1=list(map(int,input().split()))\r\nd=[]\r\nfor i in range(len(list1)):\r\n\td.append(0)\r\n\r\n\r\n#for minumum, the people in the ques chooses the best possible thing(greedy)\r\nmoneymin=0\r\nminlist=list1.copy()\r\nf=0\r\nminlist.sort()\r\nans1=True\r\nwhile(ans1):\r\n\tif(minlist[0]!=0):\r\n\t\tmoneymin=moneymin+minlist[0]\r\n\t\tminlist[0]=minlist[0]-1\r\n\t\tf=f+1\r\n\telse:\r\n\t\tminlist.remove(0)\r\n\tif(f==n):\r\n\t\tans1=False\r\n\r\ne=0\r\nmoneymax=0\r\nans2=True\r\nmaxlist=list1.copy()\r\nmaxlist.sort(reverse=True)\r\nwhile(ans2):\r\n\tmaxlist.sort(reverse=True)\r\n\tmoneymax=moneymax+maxlist[0]\r\n\tmaxlist[0]=maxlist[0]-1\r\n\te=e+1\r\n\tif(e==n):\r\n\t\tans2=False\r\nprint(moneymax,moneymin)", "n,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = [i for i in a]\r\nmx,mn = 0,0\r\nfor i in range(n):\r\n mx = mx + max(a)\r\n d = a.index(max(a))\r\n if(a[d]>0):\r\n a[d]-=1\r\nfor i in range(n):\r\n mn = mn + min(b)\r\n d = b.index(min(b))\r\n if(b[d]==1):\r\n b[d]=1000000000\r\n elif(b[d]>1):\r\n b[d]-=1\r\nprint(mx,mn)\r\n", "import heapq\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = a.copy()\r\nheapq.heapify(a)\r\nmin_ans = 0\r\nfor i in range(n):\r\n x = heapq.heappop(a)\r\n if x==1:\r\n heapq.heappush(a, 1001)\r\n else:\r\n heapq.heappush(a, x-1)\r\n min_ans+=x\r\n#print(min_ans)\r\ny = [-i for i in b]\r\n#print(y)\r\nheapq.heapify(y)\r\nmax_ans = 0\r\n\r\nfor i in range(n):\r\n x = -heapq.heappop(y)\r\n if x==1:\r\n heapq.heappush(y, 10001)\r\n else:\r\n heapq.heappush(y, -(x-1))\r\n max_ans+=x\r\nprint(max_ans, min_ans)\r\n \r\n \r\n", "# n - passengers\nn, m = map(int, input().split())\nargs = list(map(int, input().split()))\nargs.sort()\n\ndef calc(min=True):\n result = []\n start = 0\n\n if min:\n while start < len(args):\n result += list(range(1, args[start] + 1))[::-1]\n start += 1\n\n return result\n\nargs = calc()\nmin = sum(args[:n])\nargs.sort(reverse=True)\nmax = sum(args[:n])\n\nprint(max, min)", "n,m = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nb = sorted(a)\r\nk = n\r\nmincount = 0\r\nmaxcount = 0\r\nwhile k > 0:\r\n t = b.index(min(b))\r\n mincount += b[t]\r\n k -=1\r\n if b[t]-1 == 0:\r\n b.remove(b[t])\r\n else:\r\n b[t] = b[t]-1\r\nk = n\r\nwhile k > 0:\r\n t = a.index(max(a))\r\n maxcount += a[t]\r\n k -=1\r\n if a[t]-1 == 0:\r\n a.remove(a[t])\r\n else:\r\n a[t] = a[t]-1\r\nprint(maxcount,mincount)", "n,m = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nmin =0\r\nmax =0\r\ntemp = sorted(l)\r\nfor i in range(n):\r\n if len(l) >0:\r\n l.sort(reverse = True)\r\n max += l[0]\r\n l[0] -= 1\r\n if 0 in l:\r\n l.remove(0)\r\n min += temp[0]\r\n temp[0] -= 1\r\n if 0 in temp:\r\n temp.remove(0)\r\n temp.sort()\r\n \r\nprint(max,min)\r\n\r\n ", "import sys\r\nimport os\r\nfrom collections import Counter, defaultdict, deque\r\nfrom heapq import heapify, heappush, heappop\r\nfrom functools import lru_cache\r\nfrom math import floor, ceil, sqrt, gcd\r\nfrom string import ascii_lowercase\r\nfrom math import gcd\r\nfrom bisect import bisect_left, bisect, bisect_right\r\n\r\n\r\ndef __perform_setup__():\r\n INPUT_FILE_PATH = \"/Users/osama/Desktop/Competitive Programming/input.txt\"\r\n OUTPUT_FILE_PATH = \"/Users/osama/Desktop/Competitive Programming/output.txt\"\r\n\r\n sys.stdin = open(INPUT_FILE_PATH, 'r')\r\n sys.stdout = open(OUTPUT_FILE_PATH, 'w')\r\n\r\n\r\nif \"MY_COMPETITIVE_PROGRAMMING_VARIABLE\" in os.environ:\r\n __perform_setup__()\r\n\r\n\r\ndef read():\r\n return input().strip()\r\n\r\n\r\ndef read_int():\r\n return int(read())\r\n\r\n\r\ndef read_str_list():\r\n return read().split()\r\n\r\n\r\ndef read_numeric_list():\r\n return list(map(int, read_str_list()))\r\n\r\n\r\ndef solve(N, M, arr):\r\n min_queue = [v for v in arr]\r\n max_queue = [-v for v in arr]\r\n\r\n heapify(min_queue)\r\n heapify(max_queue)\r\n\r\n mi = mx = 0\r\n for _ in range(N):\r\n curr = heappop(min_queue)\r\n mi += curr\r\n\r\n if curr - 1:\r\n heappush(min_queue, curr-1)\r\n\r\n for _ in range(N):\r\n curr = -heappop(max_queue)\r\n mx += curr\r\n\r\n if curr - 1:\r\n heappush(max_queue, -(curr-1))\r\n\r\n return \" \".join(map(str, [mx, mi]))\r\n\r\n\r\nN, M = read_numeric_list()\r\narr = read_numeric_list()\r\n\r\nprint(solve(N, M, arr))\r\n", "n,m = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nl1 = l[:]\r\nl2 = l[:]\r\ns = 0\r\ns1 = 0\r\nfor i in range(n):\r\n z = max(l1)\r\n s+=z\r\n index = l1.index(z)\r\n l1[index] -= 1\r\nfor i in range(n):\r\n z = min(l2)\r\n if z == 0:\r\n index = l2.index(z)\r\n l2[index] = 1000000000000\r\n z = min(l2)\r\n s1+=z\r\n index = l2.index(z)\r\n l2[index] -= 1\r\n else:\r\n s1+=z\r\n index = l2.index(z)\r\n l2[index] -= 1\r\nprint(s,s1)\r\n# print(l1,l2)\r\n", "from math import *\r\nclass MaxHeap: \r\n #Constructor\r\n def __init__ (self, initialCapacity = 10):\r\n self.Size = 0\r\n self.heap = [] ##array for complete binary tree\r\n for i in range (0, initialCapacity+1):\r\n self.heap.append(None)\r\n \r\n #Class methods\r\n ##return true if skip list is empty\r\n def isEmpty(self):\r\n return self.Size == 0\r\n\r\n ##return the number of elements\r\n def size():\r\n return self.Size\r\n ##return maximum element\r\n def getMax(self):\r\n if(self.isEmpty()):\r\n return None\r\n else:\r\n return self.heap[1]\r\n \r\n #Put an element into the heap\r\n def put(self, theElement):\r\n #increase array size if necessary\r\n if self.Size == len(self.heap) - 1:\r\n for i in range(0, len(self.heap)):\r\n self.heap.append(None)\r\n self.Size = self.Size + 1 \r\n currentNode = self.Size \r\n #currentNode starts at new leaf and moves up tree\r\n while currentNode != 1 and self.heap[floor(currentNode / 2)] - theElement < 0:\r\n self.heap[currentNode] = self.heap[floor(currentNode / 2)]\r\n currentNode = floor (currentNode / 2)\r\n self.heap[currentNode] = theElement\r\n\r\n #Remove max element and return it\r\n def removeMax(self):\r\n if self.Size == 0:\r\n return None\r\n maxElement = self.heap[1]\r\n lastElement = self.heap[self.Size]\r\n self.Size = self.Size - 1\r\n currentNode = 1\r\n child = 2 #child of currentNode\r\n while (child <= self.Size):\r\n if child < self.Size and self.heap[child] - self.heap[child + 1] < 0:\r\n child = child + 1\r\n if child < self.Size and lastElement - self.heap[child] >= 0:\r\n break\r\n self.heap[currentNode] = self.heap[child]\r\n currentNode = child\r\n child = child * 2\r\n self.heap[currentNode] = lastElement\r\n return maxElement\r\n \r\nclass MinHeap: \r\n #Constructor\r\n def __init__ (self, initialCapacity = 10):\r\n self.Size = 0\r\n self.heap = [] ##array for complete binary tree\r\n for i in range (0, initialCapacity+1):\r\n self.heap.append(None)\r\n \r\n #Class methods\r\n ##return true if skip list is empty\r\n def isEmpty(self):\r\n return self.Size == 0\r\n\r\n ##return the number of elements\r\n def size():\r\n return self.Size\r\n ##return maximum element\r\n def getMin(self):\r\n if(self.isEmpty()):\r\n return None\r\n else:\r\n return self.heap[1]\r\n \r\n #Put an element into the heap\r\n def put(self, theElement):\r\n #increase array size if necessary\r\n if self.Size == len(self.heap) - 1:\r\n for i in range(0, len(self.heap)):\r\n self.heap.append(None)\r\n self.Size = self.Size + 1 \r\n currentNode = self.Size \r\n #currentNode starts at new leaf and moves up tree\r\n while currentNode != 1 and self.heap[floor(currentNode / 2)] - theElement > 0:\r\n self.heap[currentNode] = self.heap[floor(currentNode / 2)]\r\n currentNode = floor (currentNode / 2)\r\n self.heap[currentNode] = theElement\r\n\r\n #Remove max element and return it\r\n def removeMin(self):\r\n if self.Size == 0:\r\n return None\r\n minElement = self.heap[1]\r\n lastElement = self.heap[self.Size]\r\n self.Size = self.Size - 1\r\n currentNode = 1\r\n child = 2 #child of currentNode\r\n while (child <= self.Size):\r\n if child < self.Size and self.heap[child] - self.heap[child + 1] > 0:\r\n child = child + 1\r\n if child < self.Size and lastElement - self.heap[child] <= 0:\r\n break\r\n self.heap[currentNode] = self.heap[child]\r\n currentNode = child\r\n child = child * 2\r\n self.heap[currentNode] = lastElement\r\n return minElement\r\n \r\n \r\n \r\n #TESTING\r\ndef main():\r\n n,m = input().split()\r\n b = input().split() \r\n minheap, maxheap = MinHeap(), MaxHeap()\r\n Max, Min = 0, 0\r\n for i in range(0,int(m)):\r\n minheap.put(int(b[i]))\r\n maxheap.put(int(b[i]))\r\n while int(n) > 0:\r\n localMin = minheap.removeMin()\r\n localMax = maxheap.removeMax()\r\n if localMax > 1:\r\n maxheap.put(localMax - 1)\r\n if localMin > 1:\r\n minheap.put(localMin - 1)\r\n Max, Min = Max + localMax, Min + localMin \r\n n = int(n) - 1\r\n print(Max,Min) \r\n \r\nif __name__ == \"__main__\":\r\n main()\r\n", "from copy import copy\r\n\r\n\r\ndef solve_max(n, m, data):\r\n result = 0\r\n data.sort(reverse=True)\r\n for i in range(n):\r\n if data[0] == 0:\r\n break\r\n result += data[0]\r\n data[0] -= 1\r\n data.sort(reverse=True)\r\n return result\r\n\r\n\r\ndef solve_min(n, m, data):\r\n result = 0\r\n data.sort(reverse=True)\r\n for i in range(n):\r\n if data[-1] == 0:\r\n break\r\n result += data[-1]\r\n data[-1] -= 1\r\n if data[-1] == 0:\r\n data.pop(-1)\r\n data.sort(reverse=True)\r\n return result\r\n\r\n\r\ndef main():\r\n n, m = map(int, input().split())\r\n data = list(map(int, input().split()))\r\n\r\n r_max = solve_max(n, m, copy(data))\r\n r_min = solve_min(n, m, copy(data))\r\n\r\n print(r_max, r_min)\r\n\r\n\r\nmain()\r\n", "n, m = [int(i) for i in input().split()]\na = [int(i) for i in input().split()]\nmax_ans = 0\nmin_ans = 0\nmaxli = list(a)\nminli = list(a)\nwhile n > 0:\n n -= 1\n max_index = max(maxli)\n min_index = min(minli)\n max_ans += max_index\n min_ans += min_index\n max_index = maxli.index(max_index)\n min_index = minli.index(min_index)\n if maxli[max_index] == 1:\n del(maxli[max_index])\n else:\n maxli[max_index] -= 1\n if minli[min_index] == 1:\n del(minli[min_index])\n else:\n minli[min_index] -= 1\nprint(max_ans, min_ans)\n", "n,m=list(map(int,input().split()))\r\nL=list(map(int,input().split()))\r\nP=list(map(int,L))\r\n\r\nmi=0\r\nma=0\r\n\r\nfor i in range(n):\r\n x=max(L)\r\n ma+=x\r\n L[L.index(x)]-=1\r\n \r\n#print(P) \r\nfor i in range(n):\r\n x=min(P)\r\n if x==0:\r\n P.remove(x)\r\n x=min(P)\r\n mi+=x\r\n P[P.index(x)]-=1\r\n\r\nprint(ma,mi)", "m,n=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nx=[i for i in l]\r\ny=[i for i in l]\r\nx.sort()\r\ny.sort()\r\nmaxi=0\r\nmini=0\r\nfor i in range(m):\r\n maxi+=x[-1]\r\n x[-1]-=1 \r\n x.sort()\r\n mini+=y[0]\r\n y[0]-=1 \r\n y.sort()\r\n if 0 in y:\r\n y.remove(0)\r\nprint(maxi,mini)\r\n ", "n,m=(int(i) for i in input().split())\r\na=[int(i) for i in input().split()]\r\na1=a[:]\r\na1.sort(reverse=True)\r\nmax1=0\r\nmin1=0\r\nfor i in range(n):\r\n max1=max1+a1[0]\r\n a1[0]=a1[0]-1\r\n a1.sort(reverse=True)\r\na.sort()\r\nfor i in range(n):\r\n min1=min1+a[0]\r\n if (a[0]==1):\r\n a.remove(a[0])\r\n else:\r\n a[0]=a[0]-1\r\nprint(str(max1)+' '+str(min1))\r\n", "n,m=map(int,input().split())\r\nA=list(map(int,input().split()))\r\na=A.copy()\r\nmaxcount=0\r\nmincount=0\r\nfor _ in range(n):\r\n maxcount+=max(a)\r\n a[a.index(max(a))]-=1\r\na=A.copy()\r\nfor _ in range(n):\r\n if min(a)==0:\r\n a.remove(min(a))\r\n mincount+=min(a)\r\n a[a.index(min(a))]-=1\r\nprint(maxcount,mincount)\r\n\r\n\r\n", "import sys\r\nfrom os import path\r\nif(path.exists('input.txt')):\r\n sys.stdin = open(\"input.txt\",\"r\")\r\n sys.stdout = open(\"output.txt\",\"w\")\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = a.copy()\r\nz = 0\r\nx = 0\r\nfor i in range(n):\r\n a.sort()\r\n b.sort()\r\n z =z + a[0]\r\n if a[0] == 1:\r\n a[0] = 1000\r\n else:\r\n a[0] =a[0]-1\r\n x =x + b[m - 1]\r\n b[m - 1] -= 1\r\nprint(x, z)\r\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = a.copy()\r\ny = n\r\nmaxm = 0\r\nminm = 0\r\ni = 0\r\nwhile y > 0:\r\n ind = a.index(max(a))\r\n maxm += a[ind]\r\n a[ind] -= 1\r\n y -= 1\r\n \r\nz = n\r\ni = 0\r\nwhile z > 0:\r\n min_c = max(b)\r\n for j in range(m):\r\n if b[j] < min_c and b[j]>0:\r\n min_c = b[j]\r\n ind = b.index(min_c)\r\n minm += b[ind]\r\n if b[ind] > 0:\r\n b[ind] -= 1\r\n z -= 1\r\n\r\nprint(maxm, minm)\r\n", "numplane = [int(i) for i in input().split()]\r\nempty = [int(i) for i in input().split()]\r\ncopy_empty = empty[:]\r\nmax_zlotys = []\r\nmin_zlotys = []\r\nanswer = []\r\nfor i in range(numplane[0]):\r\n max_zlotys.append(max(empty))\r\n empty[empty.index(max(empty))] -=1\r\nfor i in range(numplane[0]):\r\n try:\r\n copy_empty.remove(0)\r\n except:\r\n pass\r\n min_zlotys.append(min(copy_empty))\r\n copy_empty[copy_empty.index(min(copy_empty))] -=1\r\nanswer.append(sum(max_zlotys))\r\nanswer.append(sum(min_zlotys))\r\nprint(answer[0] , answer[1])", "def airport(n, m, a):\r\n g = list(a)\r\n maxi = 0\r\n for i in range(n):\r\n amx = max(g)\r\n maxi += amx\r\n t = g.index(amx)\r\n g[t]-=1\r\n a.sort()\r\n j = 0\r\n i = 0\r\n mini = 0\r\n while(j<n and i<n):\r\n if(a[j]!=0):\r\n mini += a[j]\r\n a[j]-=1\r\n i+=1\r\n else:\r\n j+=1\r\n return str(maxi)+\" \"+str(mini)\r\n\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nprint(airport(n, m, a))", "n,m=map(int,input().split())\r\nlst1=[int(x) for x in input().split()]\r\nlst2=lst1.copy()\r\nlst1.sort()\r\nmini,maxi=0,0\r\nfor i in range(n):\r\n mini+=lst1[0]\r\n lst1[0]-=1\r\n if lst1[0]==0:del lst1[0]\r\nfor i in range(n):\r\n maxi+=max(lst2)\r\n lst2[lst2.index(max(lst2))]-=1\r\nprint(maxi,mini)\r\n", "n,m=map(int, input().split())\r\na = list(map(int, input().split()))\r\n#arr.sort()\r\n#print(a)\r\ndef findMax(arr):\r\n #print(arr)\r\n mxres=0\r\n for i in range(n):\r\n mx = max(arr)\r\n ind = arr.index(mx)\r\n arr[ind]-=1\r\n mxres += mx\r\n return mxres\r\n \r\n \r\ndef findMin(arr):\r\n \r\n mnres = 0\r\n #print(arr)\r\n for i in range(n):\r\n mn = min(arr)\r\n ind = arr.index(mn)\r\n arr[ind]-=1\r\n #print(mn,ind,arr[ind])\r\n \r\n if arr[ind]<=0:\r\n arr[ind] = 1002\r\n mnres+=mn\r\n return mnres\r\ns = a[:]\r\nprint(findMax(a),findMin(s))", "\r\nn,m=map(int,input().split())\r\nli=[int(x) for x in input().split()]\r\nli2=li.copy()\r\nli2.sort()\r\nli3=li.copy()\r\nli3.sort(reverse=True)\r\nmaxi=0\r\nmini=0\r\ni=0\r\nnn=n\r\nwhile(nn>0):\r\n nn-=1\r\n maxi+=li3[0]\r\n li3[0]-=1\r\n li3.sort(reverse=True)\r\n if(li3[0]==0):\r\n break\r\n #print(maxi)\r\ni=0\r\nwhile(n>0):\r\n if(li2[i]==0):\r\n i+=1\r\n continue\r\n n-=1\r\n mini+=li2[i]\r\n li2[i]-=1\r\n li2.sort()\r\n if(li2[m-1]==0):\r\n break\r\n #print(mini)\r\n#print(nn,n)\r\nprint(maxi,mini)", "n, m = (map(int, input().split()))\r\na = list(map(int, input().split()))\r\n\r\na1 = a.copy()\r\nmax_v = min_v = 0\r\nfor _ in range(n):\r\n v, i = max((v, i) for i, v in enumerate(a1))\r\n max_v += v\r\n a1[i] -= 1\r\n\r\na2 = a.copy()\r\nfor _ in range(n):\r\n v, i = min((v, i) for i, v in enumerate(a2))\r\n while v <= 0:\r\n a2.pop(i)\r\n v, i = min((v, i) for i, v in enumerate(a2))\r\n min_v += v\r\n a2[i] -= 1\r\nprint(max_v, min_v)\r\n", "# SOLUTION CAN BE OPTIMIZED. THIS IS NAIVE APPROACH\r\n# I can't think of optimization coz i didnt learn dsa, so I jus used naive dsa\r\n\r\n\r\n\r\n#sum2n() is implementation of n*(n+1)/2, i.e, as the name indicates, sum of all nums from 1 to n\r\n# this func will only be used when no.of seats=no.of ppl, we need the entire sum of seats and sum==tot price here\r\n# Eg: \r\n# 4 3\r\n# 2 1 1\r\n# OUTPUT: 5\r\n# since 4ppl = sum(2,1,1) = max price = min price \r\ndef sum2n(seats):\r\n sum=0\r\n for n in seats:\r\n sum+=n*(n+1)/2\r\n return str(int(sum))\r\n\r\n\r\n# Max price:\r\n# let price=0 Max price obtained by adding HIGHEST SEATS AVAILABLE of a plane as price\r\n# iterate for n[total ppl] times and add highest seat num in list\r\n# Min price:\r\n# logic Similar to max price but add lowest seat number as price\r\n# Eg:\r\n# 4 3\r\n# 2 2 2\r\n# OUTPUT: Max:7 and Min:6\r\n# MAX explanation...\r\n# price=0 incremented by deducting seats from plane with max seats\r\n# 2 2 2 => price+=2 and 1 2 2 seats left => price+=2 and 1 1 2 and so on until 4 seats, add max vals from list \r\n# MIN explanation...\r\n# price=0 incremented by deducting seats BUT from plane with min seats\r\n# 2 2 2 => price+=2 and 1 2 2 seats left => price+=1 and 0 2 2 => price+=2 and 0 1 2 => price+=1 and 0 0 2\r\n# and so on until n seats, add min vals from list and update list \r\n\r\ndef maxi(seats,n,m):\r\n sum=0\r\n while(n):\r\n tmp=max(seats)\r\n sum+=tmp\r\n for i in range(m):\r\n if(seats[i]==tmp):\r\n seats[i]-=1\r\n break\r\n n-=1\r\n return int(sum)\r\n\r\ndef mini(seats,n,m):\r\n sum=0\r\n while(n):\r\n if(min(seats)==0):\r\n seats.remove(0)\r\n tmp=min(seats)\r\n sum+=tmp\r\n for i in range(m):\r\n if(seats[i]==tmp):\r\n seats[i]-=1\r\n break\r\n n-=1\r\n return int(sum)\r\n \r\n\r\n# :::::::DRIVER CODE::::::::\r\nn,m=map(int,input().split()) # n->ppl; m->planes\r\nseats=list(map(int,input().split()))\r\n\r\n# if(): to avoid extra time and resource for specifice inputs, refer comment above sum2n() for info\r\nif (sum(seats)==n):\r\n ans=sum2n(seats)\r\n print(ans,ans)\r\n\r\n# else: works in all other cases\r\nelse:\r\n seats2=seats.copy()\r\n print(maxi(seats,n,m),mini(seats2,n,m))", "# python3\r\nimport sys, threading, os.path\r\nimport string\r\nimport collections, heapq, math, bisect\r\n\r\nsys.setrecursionlimit(10 ** 6)\r\nthreading.stack_size(2 ** 27)\r\n\r\n\r\ndef main():\r\n if os.path.exists('in.txt'):\r\n input = open('in.txt', 'r')\r\n else:\r\n input = sys.stdin\r\n # --------------------------------INPUT---------------------------------\r\n n, m = list(map(int, input.readline().split()))\r\n lismax = list(map(int, input.readline().split()))\r\n lismin = list(lismax)\r\n\r\n for i in range(len(lismax)):\r\n lismax[i] = -lismax[i]\r\n\r\n maxone, minone = 0, 0\r\n\r\n heapq.heapify(lismin)\r\n for i in range(n):\r\n x = heapq.heappop(lismin)\r\n minone += x\r\n x -= 1\r\n if x > 0:\r\n heapq.heappush(lismin, x)\r\n\r\n heapq.heapify(lismax)\r\n for i in range(n):\r\n x = heapq.heappop(lismax)\r\n maxone += (-x)\r\n x += 1\r\n if x < 0:\r\n heapq.heappush(lismax, x)\r\n\r\n output = str(maxone) + \" \"+ str(minone)\r\n # -------------------------------OUTPUT----------------------------------\r\n if os.path.exists('out.txt'):\r\n open('out.txt', 'w').writelines(str(output))\r\n else:\r\n sys.stdout.write(str(output))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n# threading.Thread(target=main).start()\r\n", "passa , plan = map(int , input().split()) \r\nseasts = list(map(int , input().split()))\r\nseasts1 = seasts[::]\r\nmn , mx = 0 , 0 \r\nfor i in range(passa) : \r\n seasts =sorted(seasts, reverse=True)\r\n mx += seasts[0] \r\n seasts[0] -= 1 \r\n if seasts[0] == 0:\r\n seasts.remove(seasts[0])\r\nfor i in range(passa) : \r\n seasts1 =sorted(seasts1)\r\n mn += seasts1[0] \r\n seasts1[0] -= 1 \r\n if seasts1[0] == 0:\r\n seasts1.remove(seasts1[0])\r\nprint(mx , mn) ", "from heapq import heapify, heappush, heappop\r\nN,m = [int(x) for x in input().split()]\r\narr = [int(x) for x in input().split()]\r\n# print(arr)\r\n\r\nmin_arr = []\r\nfor x in arr:\r\n heappush(min_arr, (x,x)) \r\n\r\nn = N\r\nlo = 0\r\nwhile n:\r\n k, x = heappop(min_arr)\r\n # print(x)\r\n new = x-1\r\n if new > 0:\r\n heappush(min_arr, (new,new))\r\n n -= 1\r\n lo += x\r\n\r\n\r\nmax_arr = []\r\nfor y in arr:\r\n heappush(max_arr, (-y,y))\r\n\r\nhi = 0\r\nwhile N:\r\n k,x = heappop(max_arr)\r\n # print(\"hi item\",x)\r\n new = x-1\r\n if new > 0:\r\n heappush(max_arr, (-new, new))\r\n N -= 1\r\n hi += x\r\n\r\nprint(f\"{hi} {lo}\")", "def sol():\n n, m = [int(x) for x in input().split(' ')]\n seats = [int(x) for x in input().split(' ')]\n seats_copy = seats.copy()\n mini = 0\n maxi = 0\n\n for i in range(n):\n seats.sort()\n seats_copy.sort()\n mini += seats[0]\n maxi += seats_copy[-1]\n seats_copy[-1] -= 1\n if seats[0] > 1:\n seats[0] -= 1\n else:\n seats.pop(0)\n\n print(\"{} {}\".format(maxi, mini))\n\nsol()\n\n", "n,m=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\na1=sorted(a)\r\nmaxpr,minpr=0,0\r\npas=n\r\nfor i in range(m):\r\n while(a1[i]>0 and pas>0):\r\n minpr+=a1[i]\r\n a1[i]-=1\r\n pas-=1\r\nfor j in range(n):\r\n x=max(a)\r\n maxpr+=x\r\n a[a.index(x)]=a[a.index(x)]-1\r\nprint(str(maxpr)+\" \"+str(minpr))", "n,m=map(int,input().split())\nl=sorted(list(map(int,input().split())))\nnew=[]\nfor ele in l:\n for j in range(ele,0,-1):\n new.append(j)\na=sum(new[:n])\nnew.sort()\nprint(sum(new[-n:]),a)\n\t\t\t\t\t\t \t \t \t\t\t\t \t \t \t \t \t\t \t\t", "import math\r\n\r\ndef _input(): return map(int, input().split())\r\n\r\ndef f(n): return (n*(n+1))//2\r\n\r\nn, m = _input()\r\nlst = sorted(list(_input()))\r\nn1 = n\r\nr1= 0; r2=0\r\nfor i in range(m):\r\n if n>=lst[i]:r1+=f(lst[i])\r\n else: \r\n for j in range(lst[i], lst[i]-n, -1): r1+=j\r\n n-=lst[i]\r\n if n<=0: break\r\n\r\nl = sorted(list(set(lst)))[::-1]\r\n\r\nll = len(l)\r\na = {}\r\nfor i in lst:\r\n if i not in a: a[i] = 1\r\n else: a[i]+=1\r\n\r\ni = 0; value = 0\r\n\r\nwhile n1>0:\r\n if i==ll: i=0\r\n if i <ll-1: value = l[i+1]\r\n \r\n while n1 > 0 and a[l[i]] > 0 and l[i] > value:\r\n \r\n r2+=min(n1, a[l[i]])*l[i]\r\n n1-=min(n1, a[l[i]])\r\n l[i]-=1\r\n if l[i] in a: a[l[i]]+=a[l[i]+1]\r\n else: a[l[i]] = a[l[i]+1]\r\n \r\n if l[i] <= value: value=0; break\r\n \r\n \r\n i+=1\r\n \r\nprint(r2, r1)\r\n\r\n\r\n", "n,m=map(int,input().split())\nc=list(map(int,input().split()))\ninc=sorted(c)\ndec=inc[::-1]\ntot_max=0\nw=[]\nfor i in range(len(inc)):\n\tfor j in range(inc[i],0,-1):\n\t\tw.append(j)\n \nw1=sorted(w)[::-1]\n \n \nprint(sum(w1[:n]), sum(w[:n]))", "nk=input().split()\r\nn=int(nk[0])\r\nk=int(nk[1])\r\ns=list(map(int,input().rstrip().split()))\r\nm_1=0\r\nm_2=0\r\nm=n\r\na=s.copy()\r\ni=0\r\nwhile(n>0):\r\n s.sort(reverse=True)\r\n\r\n m_1+=s[0]\r\n s[0]=s[0]-1\r\n n=n-1\r\nwhile (m>0):\r\n a.sort()\r\n if a[i] > 0:\r\n m_2 += a[i]\r\n a[i] = a[i] - 1\r\n m=m-1\r\n else:\r\n i=i+1\r\n\r\nprint(m_1,m_2)\r\n\r\n\r\n", "n, m = [int(i) for i in input().split()]\n\na = [int(i) for i in input().split()]\n\na.sort()\n\n# print(a)\n\ntmpN = n\ntmpA = a.copy()\ni = 0\nmn = 0\n\nwhile tmpN > 0:\n\n if tmpN >= tmpA[i]:\n mn += (tmpA[i] * (tmpA[i] + 1)) / 2\n tmpN -= tmpA[i]\n tmpA[i] = 0\n i += 1\n continue\n\n if tmpA[i] > 0:\n\n mn += tmpA[i]\n tmpA[i] -= 1\n tmpN -= 1\n\n else:\n i += 1\n\nmx=0\ni = m - 1\n#print(a)\nif m > 1:\n tmp = min(n, a[m-1] - a[m - 2])\n mx += (a[m-1]*(a[m-1]+1))/2 - ((a[m-1]-tmp)*(a[m-1]-tmp+1))/2\n n -= tmp\n a[m-1] -= tmp\n #print(mx)\n #print(a[m-1])\n #i = m - 1\n\nelse:\n tmp = min(n, a[0])\n mx += (a[0] * (a[0] + 1)) / 2 - ((a[0] - tmp) * (a[0] - tmp + 1)) / 2\n n -= tmp\n a[0] -= tmp\n print(int(mx),int(mn))\n exit()\n\ni = m -2\n\n#print(mx)\n#mxP = a[m-1]\n\nwhile n > 0:\n\n if i >= 0 and a[i + 1] == a[i]:\n\n i -= 1\n # mx += mxP\n # n -= 1\n # a[i] -= 1\n # if i > 0:\n # i -= 1\n # else:\n # mxP -= 1\n # i = m - 1\n\n else:\n\n eq = m - i - 1\n seats=0\n if i >= 0:\n seats = eq * (a[i+1] - a[i])\n else:\n seats = eq * a[i+1]\n\n if n >= seats:\n\n if i >= 0:\n mx += eq * ((a[i+1] * (a[i+1]+1)) - (a[i] * (a[i]+1)))/2\n else:\n mx += eq * a[i + 1] * (a[i + 1] + 1) / 2\n n -= seats\n\n else:\n\n tmp = n // eq\n mx += eq * ((a[i + 1] * (a[i + 1] + 1)) - ((a[i+1]-tmp) * ((a[i+1]-tmp) + 1))) / 2\n tmp1 = n % eq\n mx += tmp1 * (a[i+1]-tmp)\n n=0\n\n i = i - 1\n #print(a[i]+1,mx)\n\nprint(int(mx),int(mn))", "n,a=list(map(int,input().split()))\r\ns=list(map(int,input().split()))\r\ns1=list(s)\r\nmac=0\r\nmic=0\r\nfor i in range(0,n):\r\n mac=mac+max(s)\r\n j=s.index(max(s))\r\n s[j]=s[j]-1\r\nc=0\r\nwhile(True):\r\n if min(s1)!=0:\r\n mic=mic+min(s1)\r\n j=s1.index(min(s1))\r\n s1[j]=s1[j]-1\r\n c=c+1\r\n else:\r\n s1.remove(0)\r\n if c==n:\r\n break\r\nprint(mac,mic) \r\n", "import copy\r\nn, m = [int(x) for x in input().split()]\r\nm = int(n)\r\nseats = [int(x) for x in input().split()]\r\nmin_seats = copy.deepcopy(seats)\r\ndef sum_element(element, stop=0):\r\n res = 0\r\n if stop != 0:\r\n marker = element - stop\r\n else:\r\n marker = 0\r\n while element > marker:\r\n res += element\r\n element -= 1\r\n return res\r\nmax_money = 0\r\nmin_money = 0\r\nwhile n > 0:\r\n max_money += (max(seats))\r\n n -= 1\r\n seats[seats.index(max(seats))] = max(seats) - 1\r\nwhile m > 0:\r\n cur = min(min_seats)\r\n if m >= cur:\r\n min_money += sum_element(cur)\r\n m -= cur\r\n min_seats.pop(min_seats.index(cur))\r\n else:\r\n min_money += sum_element(cur, m)\r\n m = 0\r\nprint(max_money, min_money)", "# Road\r\ndef airport():\r\n s1=[int(x) for x in input().split()]\r\n (n,m)=(s1[0],s1[1])\r\n a=sorted([int(x) for x in input().split()],reverse=True)\r\n b=[]\r\n b=b+a\r\n b.sort()\r\n maxprofit=minprofit=0\r\n for i in range(n):\r\n maxprofit=maxprofit+a[0]\r\n a[0]=a[0]-1\r\n a.sort(reverse=True)\r\n while True:\r\n if b[0]==0:\r\n b.remove(b[0])\r\n else:\r\n minprofit=minprofit+b[0]\r\n b[0]=b[0]-1\r\n n=n-1\r\n b.sort()\r\n if n==0:\r\n break\r\n\r\n print(maxprofit,minprofit)\r\n\r\nairport()\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "if __name__ == '__main__':\r\n # from heap import deque\r\n\r\n n, m = map(int, input().split())\r\n arr = list(map(int, input().split()))\r\n temp_arr = arr[:]\r\n # pq = deque()\r\n \r\n max_sum = 0\r\n min_sum = 0\r\n for i in range(n):\r\n index_max_elem = arr.index(max(arr))\r\n max_sum += arr[index_max_elem]\r\n arr[index_max_elem] -= 1\r\n j = 0\r\n while j < n:\r\n index_min_elem = temp_arr.index(min(temp_arr))\r\n if temp_arr[index_min_elem] > 0:\r\n min_sum += temp_arr[index_min_elem]\r\n temp_arr[index_min_elem] -= 1\r\n j += 1\r\n else:\r\n temp_arr.remove(temp_arr[index_min_elem])\r\n\r\n print(max_sum, min_sum)\r\n", "from heapq import *\r\n\r\nn, m = map(int, input().split())\r\na = [] # Increasing order (least expensive to more expensive)\r\nb = [] # 'False' decreasing order (most expensive to least expensive)\r\nfor ai in input().split():\r\n heappush(a, int(ai))\r\n heappush(b, n - int(ai))\r\n\r\npmin = 0\r\npmax = 0\r\n\r\nfor ni in range(n):\r\n ai = heappop(a)\r\n bi = heappop(b)\r\n #print('>', ai, (n - bi))\r\n pmin += ai\r\n pmax += (n - bi)\r\n if ai >= 2:\r\n heappush(a, ai - 1)\r\n if bi < n - 1:\r\n heappush(b, bi + 1)\r\n\r\nprint(pmax, pmin)\r\n", "import copy\r\n\r\na,b=list(map(int,input().split()))\r\nl=list(map(int,input().split()))\r\nL=copy.copy(l)\r\nd={}\r\nfor i in range(b):\r\n d[i]=l[i]\r\nMax=0\r\nMin=0\r\nfor i in range(a):\r\n m=max(l)\r\n Max+=m\r\n index1=l.index(m)\r\n l[index1]-=1\r\nfor i in range(a):\r\n n=min(L)\r\n Min+=n\r\n index1=L.index(n)\r\n L[index1]-=1\r\n if L[index1]==0:\r\n L.remove(L[index1])\r\nprint(Max,abs(Min))\r\n", "n,m=map(int,input().split())\r\nx=list(map(int,input().split()))\r\nxx=x.copy()\r\nminn=0\r\nmaxx=0\r\nfor i in range(n):\r\n maxx+=max(x)\r\n x[x.index(max(x))]-=1\r\n minn+=min(xx)\r\n if min(xx)==1:\r\n xx.remove(1)\r\n else:\r\n xx[xx.index(min(xx))]-=1\r\nprint(maxx,minn)\r\n", "n, m = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nb = a.copy()\r\nmx = 0\r\nfor i in range(0, n):\r\n a.sort(reverse = True)\r\n if a[0] > 0:\r\n mx += a[0]\r\n a[0] -= 1\r\n else:\r\n break\r\nmn = 0\r\nfor i in range(0, n):\r\n b.sort()\r\n if b[0] > 0:\r\n mn += b[0]\r\n b[0] -= 1\r\n else:\r\n x = b.pop(0)\r\n mn += b[0]\r\n b[0] -= 1\r\nprint(mx, end = \" \") \r\nprint(mn)", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nm1=0\r\nm=0\r\nx=n\r\nb=[]\r\nfor i in a:\r\n b.append(i)\r\nfor i in range(n):\r\n if min(b)==0:\r\n b.remove(0)\r\n if min(b)!=0: \r\n m1=min(b)+m1\r\n b[b.index(min(b))]-=1\r\nfor i in range(n):\r\n m=max(a)+m\r\n a[a.index(max(a))]-=1\r\nprint(m,m1)\r\n \r\n \r\n \r\n ", "n, m = map(int, input().split())\r\nnn = n\r\nl = list(map(int, input().split()))\r\nll = l.copy()\r\nmx, mn = 0, 0\r\n\r\nwhile n:\r\n mn += min(l)\r\n ind = l.index(min(l))\r\n l[ind] -= 1\r\n if l[ind] == 0:\r\n l[ind] = 1000000\r\n n -= 1\r\n\r\nwhile nn:\r\n mx += max(ll)\r\n ind = ll.index(max(ll))\r\n ll[ind] -= 1\r\n nn -= 1\r\n\r\nprint(mx, mn)\r\n", "v1,v2 = map(int, input().split())\r\nc = list(map(int, input().split()))\r\np= sorted(c)\r\ndec =p[::-1]\r\nmax = 0\r\nw = []\r\nfor i in range(len(p)):\r\n for j in range(p[i], 0, -1):\r\n w.append(j)\r\n\r\nw1 = sorted(w)[::-1]\r\nprint(sum(w1[:v1]), sum(w[:v1]))", "n,m=map(int,input().split())\r\na=[int(x) for x in input().split()]\r\nb=[e for e in a]\r\nmaxii=0\r\nminii=0\r\nfor i in range(n):\r\n a.sort()\r\n b.sort()\r\n maxii+=b[-1]\r\n b[-1]-=1\r\n minii+=a[0]\r\n a[0]-=1\r\n if a[0]==0:\r\n a=a[1:]\r\nprint(maxii,minii)\r\n", "import heapq\n\ndef main():\n n, m = list(map(int, input().split(' ')))\n elems = list(map(int, input().split(' ')))\n\n minh, maxh = [], []\n\n for e in elems:\n heapq.heappush(minh, e)\n heapq.heappush(maxh, -e)\n\n def calc(h, mult=1):\n total = 0\n q = n\n while q > 0:\n c = mult * heapq.heappop(h)\n total += c\n c -= 1\n q -= 1\n if c > 0:\n heapq.heappush(h, mult * c)\n return str(total)\n\n print(' '.join([calc(maxh, -1), calc(minh)]))\n\n\nif __name__ == \"__main__\":\n main()\n", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nmi=0\r\nma=0\r\nl2=[]\r\nfor j in sorted(l):\r\n l2.append(j)\r\nl2.reverse()\r\nfor i in range(n):\r\n if l[0]==0:\r\n l.pop(0)\r\n mi+=l[0]\r\n l[0]-=1\r\n ma+=l2[0]\r\n l2[0]-=1\r\n l2.sort()\r\n l2.reverse()\r\nprint(ma,mi)\r\n ", "import sys, io, os\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport string\r\nfrom collections import defaultdict,Counter,deque\r\ninput = sys.stdin.readline\r\n \r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n\r\n'''\r\nppp\r\nn0p\r\n000\r\n\r\ncriteria=at least one 0, at least one negative\r\nif no positives, there must be at least two negatives\r\n'''\r\nsys.setrecursionlimit(1500)\r\n\r\ndef f(n, a):\r\n if n == 1:\r\n return\r\n else:\r\n a[n-2], a[n-1] = a[n-1], a[n-2]\r\n f(n-1, a)\r\n\r\ndef solve():\r\n n, _ = MII()\r\n a = LII()\r\n mn = 0\r\n mx = 0\r\n\r\n mx_heap = [-num for num in a]\r\n heapq.heapify(mx_heap)\r\n x = n\r\n while x:\r\n val = -heapq.heappop(mx_heap)\r\n mx += val\r\n if val-1 > 0:\r\n heapq.heappush(mx_heap, -(val-1))\r\n x -= 1\r\n \r\n mn_heap = a\r\n heapq.heapify(mn_heap)\r\n x = n\r\n while x:\r\n val = heapq.heappop(mn_heap)\r\n mn += val\r\n if val-1 > 0:\r\n heapq.heappush(mn_heap, val-1)\r\n x -= 1\r\n \r\n print(mx, mn)\r\n\r\n\r\nsolve()", "n, m = [int(i) for i in input().split()]\r\na = sorted([int(i) for i in input().split()])\r\n\r\ndef maxi(a, n):\r\n a = a[::-1]\r\n cost = 0\r\n for _ in range(n):\r\n max_ = a[0]\r\n max_i = 0\r\n for i, ai in enumerate(a):\r\n if ai>max_:\r\n max_ = ai\r\n max_i = i\r\n cost += max_\r\n a[max_i] -= 1\r\n return cost\r\n \r\ndef mini(a, n):\r\n taken = 0\r\n take = 0\r\n cost = 0\r\n for ai in a:\r\n take = min(ai, n-taken)\r\n if n-taken>=ai:\r\n costi = (ai*(ai+1))//2\r\n take = ai\r\n #print('yes')\r\n else:\r\n take = n-taken\r\n costi = (ai*(ai+1))//2 -((ai-take)*(ai-take+1))//2\r\n \r\n taken += take\r\n cost += costi\r\n if taken == n:\r\n return cost\r\n\r\nprint(maxi(a,n), mini(a,n))\r\n", "def maxprice(arr,n):\r\n s=0\r\n while n!=0:\r\n arr.sort(reverse=True)\r\n s=s+arr[0]\r\n arr[0]=arr[0]-1\r\n n-=1\r\n return(s)\r\n \r\ndef minprice(arr,n):\r\n s=0\r\n x=0\r\n while n!=0:\r\n arr.sort()\r\n if arr[x]==0:\r\n x+=1\r\n continue\r\n else:\r\n s=s+arr[x]\r\n arr[x]=arr[x]-1\r\n n-=1\r\n return(s)\r\n \r\n \r\n\r\nn,m=map(int,input().split())\r\narr=[int(x) for x in input().split()]\r\narr1=arr.copy() #copy of initial array\r\n#print(arr1)\r\nmaxans=maxprice(arr,n)\r\n#print(maxans)\r\nminans=minprice(arr1,n)\r\n#print(minans)\r\nprint(maxans,minans)", "nm=input().split()\r\nn,m=int(nm[0]),int(nm[1])\r\narr=list(map(int,(input().split())))\r\na,b=0,0\r\nn1,arr1=n,arr\r\nwhile(n1):\r\n arr1=sorted(arr1)\r\n a+=arr1[-1]\r\n arr1[-1]-=1\r\n n1-=1\r\nwhile(n):\r\n arr=sorted(arr)\r\n if arr[0]==0:\r\n arr.remove(0)\r\n b+=arr[0]\r\n arr[0]-=1\r\n n-=1\r\nprint(a,b)", "n, m = [int(a) for a in input().split()]\r\na = [int(a) for a in input().split()]\r\nacopy = a.copy()\r\na.sort()\r\nmaxsumm = 0\r\nminsumm = 0\r\nfor i in range(n):\r\n maxsumm += max(a)\r\n a[a.index(max(a))] -= 1\r\na = acopy\r\nfor j in range(n):\r\n if min(a) != 0:\r\n minsumm += min(a)\r\n a[a.index(min(a))] -= 1\r\n\r\n else:\r\n a[a.index(min(a))] = float('+inf')\r\n minsumm += min(a)\r\n a[a.index(min(a))] -= 1\r\nprint(maxsumm, minsumm)\r\n", "from heapq import *\r\n\r\nP, A = map(int, input().split())\r\n\r\nseats = list(map(int, input().split()))\r\n\r\nmaxh = []\r\nminh = []\r\n\r\nfor s in seats:\r\n maxh += [-s]\r\n minh += [s]\r\n \r\nheapify(maxh)\r\nheapify(minh)\r\n\r\nmi, ma = 0, 0\r\n\r\nfor i in range(P):\r\n x = heappop(minh)\r\n mi += x\r\n if x > 1:\r\n heappush(minh, x - 1)\r\n y = -heappop(maxh)\r\n ma += y\r\n if y > 1:\r\n heappush(maxh, -y + 1)\r\nprint(str(ma) + ' ' + str(mi))", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = a[:]\r\nc = 0\r\nd = 0\r\n\r\nfor i in range(n):\r\n\tx = max(a)\r\n\ty = min(j for j in b if j > 0)\r\n\tc += x\r\n\ta[a.index(x)] -= 1\r\n\td += y\r\n\tb[b.index(y)] -= 1\r\nprint(c, d)\r\n\t\r\n\r\n", "import heapq\r\n\r\n\r\ndef main():\r\n n, m = map(int, input().split())\r\n amn = list(map(int, input().split()))\r\n amx = [-e for e in amn]\r\n heapq.heapify(amn)\r\n heapq.heapify(amx)\r\n\r\n mn = 0\r\n for _ in range(n):\r\n cur = heapq.heappop(amn)\r\n mn += cur\r\n if cur > 1:\r\n heapq.heappush(amn, cur - 1)\r\n\r\n mx = 0\r\n for _ in range(n):\r\n cur = heapq.heappop(amx)\r\n mx -= cur\r\n if cur < -1:\r\n heapq.heappush(amx, cur + 1)\r\n\r\n print(mx, mn)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n,m = map(int, input().split())\r\nx = list(map(int, input().split()))\r\nxx = x[:]\r\nx.sort()\r\ns = 0\r\nfor i in range(n):\r\n \r\n if x[0] == 0 :\r\n x.pop(0)\r\n \r\n s = s + x[0]\r\n x[0] = x[0] - 1\r\n \r\n \r\n\r\n#print(xx) \r\n#print(x)\r\n\r\n\r\n\r\nc = 0\r\nfor k in range(n):\r\n xx.sort()\r\n xx.reverse()\r\n \r\n if xx[0] == 0 :\r\n xx.pop(0)\r\n \r\n c = c + xx[0]\r\n xx[0] = xx[0] - 1\r\n \r\nprint(c,end=\" \")\r\nprint(s)\r\n \r\n \r\n\r\n \r\n\r\n ", "import queue\r\n \r\n(n, m) = (int(x) for x in input().split())\r\nempty = (int(x) for x in input().split())\r\n \r\nmaxQ = queue.PriorityQueue()\r\nmaxPrice = 0\r\nminQ = queue.PriorityQueue()\r\nminPrice = 0\r\nfor x in empty:\r\n maxQ.put(-x)\r\n minQ.put(x)\r\n \r\nfor x in range(n):\r\n p = minQ.get()\r\n q = maxQ.get()\r\n minPrice += p\r\n maxPrice -= q\r\n \r\n if p > 1:\r\n minQ.put(p - 1)\r\n if q < -1:\r\n maxQ.put(q + 1)\r\n \r\nprint(\"{} {}\".format(maxPrice, minPrice))", "from heapq import heappop , heappush\r\nn,m=map(int,input().split()) ; arr=list(map(int,input().split())) ; maxi=mini=0 ; arr2=[] ; arr.sort()\r\nfor i in arr:\r\n arr2.append(-i)\r\narr2.sort()\r\nfor i in range(n):\r\n x=-heappop(arr2) ; z=heappop(arr) ; maxi+=x ; mini+=z\r\n if x!=1:\r\n heappush(arr2,-(x-1))\r\n if z!=1:\r\n heappush(arr,z-1)\r\n \r\nprint(maxi,mini)\r\n \r\n \r\n ", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\nans = []\r\nfor i in a:\r\n for j in range(i, 0, -1):\r\n ans.append(j)\r\nminimum = sum(ans[:n])\r\nmaximum = sum(sorted(ans, reverse=True)[:n])\r\nprint(maximum, minimum)\r\n", "import copy\r\n\r\nn, m = map(int, input().split())\r\nL = list(map(int, input ().split()))\r\n\r\nL2 = copy.copy(L); n2 = n\r\nmaxy = 0; mini = 0\r\n\r\nwhile (n > 0) :\r\n x = max(L)\r\n maxy += x\r\n L[L.index(x)] -= 1\r\n n -= 1\r\nwhile (n2 > 0) :\r\n if L2[L2.index(min(L2))] <= 0 :\r\n L2.remove(L2[L2.index(min(L2))])\r\n x = min(L2)\r\n mini += x\r\n L2[L2.index(x)] -= 1\r\n n2 -= 1\r\n\r\nprint (maxy, mini)\r\n", "n,m=list(map(int,input().split()))\r\nl=list(map(int,input().split()))\r\np=l[:]\r\np=p[::-1]\r\nz=0\r\nfor i in range(0,n):\r\n p.sort()\r\n p=p[::-1]\r\n z=z+p[0]\r\n p[0]=p[0]-1\r\n if(p[0]==0):\r\n p=p[1:]\r\nu=0\r\nfor i in range(0,n):\r\n l.sort()\r\n u=u+l[0]\r\n l[0]=l[0]-1\r\n if(l[0]==0):\r\n l=l[1:]\r\nprint(z,u)", "n,m=list(map(int,input().split()))\r\nk=list(map(int,input().split()))\r\ncounter=0\r\ncounter1=0\r\nk1=k.copy()\r\nfor x in range(n):\r\n a=max(k)\r\n counter+=a\r\n k[k.index(a)]-=1\r\nc=0\r\nwhile c<n:\r\n t=min(k1)\r\n if t<=0:\r\n k1.remove(t)\r\n else:\r\n counter1+=t\r\n k1[k1.index(t)]-=1\r\n c+=1\r\n\r\n\r\nprint(counter,counter1)", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = a.copy()\r\nM, m = 0, 0\r\nfor i in range(n):\r\n a.sort()\r\n b.sort(reverse=True)\r\n M += a[-1]\r\n a[-1] -= 1\r\n m += b[-1]\r\n b[-1] -= 1\r\n if len(b) > 0 and b[-1] ==0: del b[-1]\r\nprint(M, m)\r\n \r\n \r\n \r\n\r\n", "from sys import stdin\r\ninput=stdin.readline\r\npas,pla=map(int,input().split()) ; planes=list(map(int,input().split()))\r\nplanes2=planes[:] ; mini=0 ; maxi=0\r\nfor i in range(pas):\r\n a=max(planes)\r\n maxi+=a\r\n ind=planes.index(a)\r\n planes[ind]-=1\r\n\r\nfor i in range(pas): \r\n a=min(planes2)\r\n mini+=a\r\n ind=planes2.index(a)\r\n planes2[ind]-=1\r\n if a==1:\r\n planes2.remove(0)\r\nprint(maxi,mini)", "n,m=list(map(int,input().split()))\r\na=sorted(list(map(int,input().split())))\r\nc=[]\r\nfor i in a:\r\n for j in range((i),0,-1):\r\n c.append(j)\r\nif n<len(c):\r\n print(sum(sorted(c)[:(len(c)-n-1):-1]),sum(c[:n]))\r\nelse:\r\n print(sum(sorted(c)[::-1]),sum(c[:n]))", "n,m=map(int,input().split())\r\nl=sorted(list(map(int,input().split())))\r\nnew=[]\r\nfor ele in l:\r\n for j in range(ele,0,-1):\r\n new.append(j)\r\na=sum(new[:n])\r\nnew.sort()\r\nprint(sum(new[-n:]),a)", "\r\n\r\n\r\n\r\n\r\n\r\ndef main_function():\r\n n, m = [int(i) for i in input().split(\" \")]\r\n a = sorted([int(i) for i in input().split(\" \")])\r\n hash_a = [0 for i in range(1003)]\r\n for i in a:\r\n hash_a[i] += 1\r\n for i in range(1, len(hash_a) - 1):\r\n j = len(hash_a) - i - 1\r\n hash_a[j] += hash_a[j + 1]\r\n #print(hash_a)\r\n max_profit = 0\r\n min_profit = 0\r\n min_count = 0\r\n max_count = 0\r\n inside_broken = False\r\n for i in range(len(hash_a)):\r\n j = len(hash_a) - i - 1\r\n if n - max_count >= hash_a[j]:\r\n max_profit += hash_a[j] * j\r\n max_count += hash_a[j]\r\n elif n - max_count < hash_a[j]:\r\n max_profit += (n - max_count) * j\r\n break\r\n for i in range(len(a)):\r\n if n - min_count >= a[i]:\r\n min_profit += (a[i] * (a[i] + 1)) // 2\r\n min_count += a[i]\r\n elif n - min_count < a[i]:\r\n z = n - min_count\r\n y = a[i]\r\n for u in range(z):\r\n min_profit += y\r\n y -= 1\r\n inside_broken = True\r\n break\r\n if inside_broken:\r\n break\r\n print(max_profit, end=\" \")\r\n print(min_profit)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()\r\n\r\n", "n , m = input().split(' ')\r\nseats = input().split(' ')\r\nseats_1 = []\r\nmaxi = []\r\nmini = []\r\ncount = 0\r\ncount_1 = 0\r\nfor i in seats :\r\n seats_1.append(int(i))\r\n maxi.append(int(i))\r\n mini.append(int(i))\r\nfor i in range(int(n)):\r\n tmp = max(maxi)\r\n l = maxi.index(tmp)\r\n count += tmp\r\n maxi[l]-=1\r\nfor i in range(int(n)):\r\n tmp = min(mini)\r\n l = mini.index(tmp)\r\n mini[l]-=1\r\n if tmp == 1:\r\n mini.remove(0)\r\n count_1 += tmp\r\nprint(count,count_1)", "a,b=(map(int,input().split()))\nc = list(map(int,input().split()))\nd = c[:]\nmaxa = 0\nmina = 0\nfor i in range(a):\n if 0 in c:\n c.remove(0)\n if 0 in d:\n d.remove(0)\n c1=c.index(max(c))\n d1=d.index(min(d))\n maxa+=c[c1]\n mina+=d[d1]\n c[c1]=c[c1]-1\n d[d1]=d[d1]-1\nprint(str(maxa)+' '+str(mina))", "# Airport.py\r\npassengers, aeroplanes = [int(x) for x in input().split()]\r\nseats = [int(x) for x in input().split()]\r\nseatsmin = [x for x in seats]\r\nmax_cost =0\r\nmin_cost = 0\r\ni =0\r\n\r\nwhile i < passengers:\r\n max_cost += max(seats)\r\n j = seats.index(max(seats))\r\n seats[j] -= 1\r\n \r\n min_cost += min(seatsmin)\r\n k = seatsmin.index(min(seatsmin))\r\n if seatsmin[k] == 1:\r\n seatsmin[k] = 1002\r\n seatsmin[k] -= 1\r\n\r\n i += 1\r\n\r\nprint(max_cost, min_cost)", "def indmin(X,n):\n minn=X[0]\n ind=0\n for i in range(n):\n if(X[i]<minn):\n minn=X[i]\n ind=i\n return ind\n\ndef indmax(X,n):\n maxx=X[0]\n ind=0\n for i in range(n):\n if(X[i]>maxx):\n maxx=X[i]\n ind=i\n return ind\n\nn,m=map(int,input().split())\nmm=m\nA=list(map(int,input().split()))\nAA=list(A)\nminn=0\nmaxx=0\n\nfor i in range(n):\n ind=indmin(A,m)\n minn+=A[ind]\n A[ind]-=1\n if(A[ind]==0):\n A.remove(0)\n m-=1\n\nfor i in range(n):\n ind=indmax(AA,mm)\n maxx+=AA[ind]\n AA[ind]-=1\n\nprint(maxx,minn)\n\n\n", "def addi(lst):\r\n tion = 0\r\n for i in lst:\r\n while i > 0:\r\n tion += i\r\n i -= 1\r\n return tion\r\n\r\n\r\ndef mxm(aero, n):\r\n lst = aero[:]\r\n mx = 0\r\n for i in range(n):\r\n mx += max(lst)\r\n lst[lst.index(max(lst))] -= 1\r\n return mx\r\n\r\n\r\ndef mnm(aero, n):\r\n lst = aero[:]\r\n mn = 0\r\n for i in range(n):\r\n if min(lst) == 0:\r\n del lst[lst.index(min(lst))]\r\n mn += min(lst)\r\n lst[lst.index(min(lst))] -= 1\r\n return mn\r\n\r\n\r\nn, m = map(int, input().split())\r\nlst = list(map(int, input().split()))\r\nif sum(lst) == n:\r\n print(addi(lst), addi(lst))\r\nelse:\r\n print(mxm(lst, n), mnm(lst, n))\r\n", "n,m = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nl1 = list(l)\r\nsum1 = 0\r\nn1 = n\r\nwhile n1:\r\n\tr = l.index(max(l))\r\n\tsum1 = sum1 + l[r]\r\n\tl[r] = l[r]-1\r\n\tn1 = n1 - 1\r\nprint(sum1,end=\" \")\r\nsum2 = 0\r\nn1 = n\r\nwhile n1:\r\n\tr = l1.index(min(l1))\r\n\tsum2 = sum2 + l1[r]\r\n\tl1[r] = l1[r] - 1\r\n\tif l1[r] == 0:\r\n\t\tl1.pop(r)\r\n\tn1 = n1 - 1\r\nprint(sum2)", "passageiros, tamAvioes = map(int,input().split())\r\navioes = list(map(int,input().split()))\r\nlistaMenor = sorted(avioes)\r\nmaior = 0\r\nmenor = 0\r\nindex = 0\r\nfor i in range(passageiros):\r\n avioes.sort()\r\n maior += avioes[-1]\r\n avioes[-1] -= 1\r\nfor j in range(passageiros):\r\n if listaMenor[index] == 0:\r\n index += 1\r\n menor += listaMenor[index]\r\n listaMenor[index] -= 1\r\nprint(maior,menor)", "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, m = iia()\r\narr = sorted(iia())\r\ntemp = arr[:]\r\nlow = high = 0\r\nfor i in range(n):\r\n low += arr[0]\r\n arr[0] -= 1\r\n if arr[0] == 0:\r\n arr.pop(0)\r\narr = temp\r\nfor i in range(n):\r\n high += arr[-1]\r\n arr[-1] -= 1\r\n arr.sort() \r\nprint(high,low)\r\n \r\n", "n, m = map(int,input().split())\r\nc = list(map(int,input().split()))\r\n\r\nc.sort()\r\n\r\nw = []\r\n\r\nfor i in range(len(c)):\r\n for j in range(c[i],0,-1):\r\n w.append(j)\r\n \r\nw1=sorted(w, reverse=True)\r\n\r\nprint(sum(w1[:n]), sum(w[:n]))", "n = int(input().split()[0])\r\nl = input().split()\r\n\r\nfor i in range(len(l)):\r\n l[i] = int(l[i])\r\n\r\nmi = 0\r\nma = 0\r\n\r\np = list(sorted(l))\r\nq = list(reversed(sorted(l)))\r\nfor i in range(n):\r\n mi += p[0]\r\n p[0] -= 1\r\n if p[0] == 0:\r\n p.pop(0)\r\n\r\nfor i in range(n):\r\n ma += q[0]\r\n q[0] -= 1\r\n q = list(reversed(sorted(q)))\r\n if q[0] == 0:\r\n q.pop(0)\r\n\r\nprint(ma,mi)\r\n", "n,m = input().split()\nm = int(m)\nn = int(n)\na = [int(i) for i in input().split()]\na=sorted(a)\ni=0\n\nmin_ans = 0\nmax_ans = 0\na_1 = a.copy()\na_2 = a.copy()\n\n\nwhile(i<n):\n temp = min(a_1)\n min_ans += temp\n ind = a_1.index(temp)\n a_1[ind] -= 1\n if a_1[ind] == 0:\n a_1.remove(0)\n i+=1\n\ni=0\n\nwhile(i<n):\n temp = max(a_2)\n max_ans += temp\n ind = a_2.index(temp)\n a_2[ind] -= 1\n if a_2[ind] == 0:\n a_2.remove(0)\n i+=1\n \nprint('{0} {1}'.format(int(max_ans),int(min_ans)))\n \n \n\t \t \t\t\t \t \t \t\t \t\t \t\t", "n,m = [int (x) for x in input().split()]\r\nlst2 = [int (x) for x in input().split()]\r\nlst = lst2.copy()\r\nmx = 0\r\nmn = 0\r\nc = n\r\nwhile(c>0):\r\n m1 = max(lst)\r\n index = lst.index(m1)\r\n mx = mx+m1\r\n lst[index] = lst[index]-1\r\n c-=1 \r\nc=n\r\nlst = lst2.copy()\r\nwhile(c>0):\r\n m2 = min(lst)\r\n if(m2==1):\r\n lst.remove(m2)\r\n else:\r\n index = lst.index(m2)\r\n lst[index] = lst[index]-1\r\n mn=mn+m2\r\n c-=1 \r\nprint(mx,mn)", "n,m = input().split()\r\nn = int(n)\r\nm = int(m)\r\nL = list(map(int,input().split()))\r\n\r\ndef sumUpTo(n):\r\n return ( n*(n+1) )//2\r\n\r\n# print(n,m,L)\r\n\r\nif n >= sum(L):\r\n ans = 0\r\n for i in range(m):\r\n ans += sumUpTo(L[i])\r\n print(ans,ans)\r\nelse:\r\n maxEarned = 0\r\n temp = n\r\n M = L.copy()\r\n while n != 0:\r\n book = max(L)\r\n L[L.index(book)] -= 1\r\n maxEarned += book\r\n n -= 1\r\n # print(maxEarned)\r\n\r\n minEarned = 0\r\n M.sort()\r\n # print(M)\r\n i = 0\r\n while temp != 0:\r\n if temp >= M[i]:\r\n minEarned += sumUpTo(M[i])\r\n temp -= M[i]\r\n i += 1\r\n else:\r\n minEarned += M[i]\r\n M[i] -= 1\r\n temp -= 1\r\n # print(temp)\r\n \r\n print(maxEarned,minEarned)", "n, m = map(int, input().split())\r\n\r\nplanes = [int(i) for i in input().split()]\r\n\r\ntemp_1 = planes[:]\r\n\r\nmaximum = 0\r\nminimum = 0\r\n \r\nfor i in range(n):\r\n temp_1.sort()\r\n maximum += temp_1[m-1]\r\n temp_1[m-1] -= 1\r\n\r\n planes.sort()\r\n if planes[0] == 0:\r\n planes.remove(0)\r\n minimum += planes[0]\r\n planes[0] -= 1\r\n\r\nprint(maximum, minimum)\r\n", "n,mm=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nd=l[::-1]\r\ns,ka=0,0\r\nfor i in range(n):\r\n m=0\r\n x=0\r\n for i in range(mm):\r\n if(d[i]>m):\r\n m=d[i]\r\n x=i\r\n s=s+m\r\n d[x]-=1\r\nfor i in range(n):\r\n m=10000\r\n x=0\r\n for i in range(mm):\r\n if(l[i]<m and l[i]>0):\r\n m=l[i]\r\n x=i\r\n ka=ka+m\r\n l[x]-=1\r\nprint(s,ka)\r\n", "n, m = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nb = arr.copy()\r\nr1, r2 = 0, 0\r\nfor i in range(n):\r\n arr.sort()\r\n b.sort()\r\n r2 += arr[0]\r\n if arr[0] == 1:\r\n arr[0] = 1000\r\n else:\r\n arr[0] -= 1\r\n r1 += b[m - 1]\r\n b[m - 1] -= 1\r\nprint(r1, r2)\r\n", "# your code goes here\r\n#Number of people, number of airports \r\nn,m = list(map(int,input().split()))\r\n\r\n#Seatmap\r\nseats = list(map(int,input().split()))\r\nseats_copy = seats[:]\r\n\r\nanswer_max = answer_min = 0\r\n\r\nfor i in range(n):\r\n\t# Sort the set of empty seats\r\n\tseats.sort()\r\n\t\r\n\t# If the plane with the largest number of empty seats\r\n\t# has no seats, then game over.\r\n\tif(seats[-1] == 0):\r\n\t\tbreak\r\n\r\n\t# Keep adding the most expensive seat available\r\n\tanswer_max += seats[-1]\r\n\t\r\n\t# Adjust the seat availability\r\n\tseats[-1]-=1\r\n\r\nfor i in range(n):\r\n\t# Sort the set of empty seats\r\n\tseats_copy.sort()\r\n\r\n\t\r\n\t# If none of the planes have any seats left, then game over.\r\n\tif(len(seats_copy) == 0):\r\n\t\tbreak\r\n\t\r\n\t# Keep adding the most expensive seat available\r\n\tanswer_min += seats_copy[0]\r\n\r\n\t# Adjust the seat availability\r\n\tseats_copy[0] -= 1\r\n\t\r\n\t# If a plane runs out of seats, remove it from the list.\r\n\tif seats_copy[0]==0:\r\n\t\tseats_copy.pop(0)\r\n\r\nprint(answer_max,answer_min,end=\" \")", "people, plane= map(int, input().split())\r\nx= input().split()\r\nx= [int(i) for i in x]\r\ny=[int(i) for i in x]\r\nx.sort()\r\ny.sort()\r\nmax=0\r\nmin=0\r\nfor i in range(people):\r\n max+=x[-1]\r\n x[-1]-=1\r\n x.sort()\r\n min+=y[0]\r\n y[0]-=1\r\n y.sort()\r\n if 0 in y:\r\n y.remove(0)\r\nprint(max, min)", "n,m = map(int,input().split())\na = list(map(int,input().split()))\nb = a.copy()\nM,m = 0,0\nfor i in range(n) :\n a.sort()\n b.sort(reverse=True)\n M += a[-1]\n a[-1] -= 1\n m += b[-1]\n b[-1] -= 1\n if len(b) > 0 and b[-1] == 0 : del b[-1]\nprint(M,m)\n \t \t \t\t\t\t\t \t\t\t \t \t \t \t", "s = input()\nm = int(s.split()[0])\nn = int(s.split()[1])\ns2 = input()\nt1 = []\nt2 = []\nmaxs = 0\nmins = 0\nfor i in range(0, n):\n t1.append(int(s2.split()[i]))\n t2.append(int(s2.split()[i]))\nfor i in range(0, m):\n maxs += max(t1)\n p = t1.index(max(t1))\n t1[p] = t1[p] - 1\n\n mins += min(t2)\n p = t2.index(min(t2))\n t2[p] = t2[p] - 1\n if t2[p] == 0:\n t2[p] = float(\"inf\")\nprint(maxs, mins)\n", "import sys\nn, m = map(int, input().split())\nprices = list(map(int, input().split()))\ntotal = sum(prices) \npricecopy = prices[:]\npricecopy.sort(reverse=True)\nprices.sort()\n\nif total >= n:\n temp = n \nelse:\n temp = total \n\ntempi = temp \nmini,maxi = 0, 0 \n\nwhile temp:\n maxi = maxi + pricecopy[0] \n temp = temp - 1 \n pricecopy[0] = pricecopy[0] - 1 \n pricecopy.sort(reverse=True)\n\ntemp = tempi \nwhile temp:\n i = 0 \n while prices[i] == 0: \n i = i + 1 \n mini = mini + prices[i]\n temp = temp - 1 \n prices[i] = prices[i] - 1 \n\nprint(maxi, int(mini))\n\n\n\n", "n, m = [int(x) for x in input().split()]\npla = [int(x) for x in input().split()]\nmax_ = 0\npla_ = pla[:]\npla_.sort()\nfor i in range(n):\n max_ += pla_[-1]\n pla_[-1] -= 1\n pla_.sort()\n\nmin_ = 0\npla_ = pla[:]\npla_.sort()\nfor i in range(n):\n min_ += pla_[0]\n pla_[0] -= 1\n pla_.sort()\n pla_ = [x for x in pla_ if x > 0]\nprint(max_, min_)\n\t\t\t\t\t\t \t\t\t \t \t\t\t\t \t \t\t\t\t", "n,m=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nk1=arr.copy()\r\nc=0\r\nmax1=0\r\nmin1=0\r\nwhile(c<n):\r\n k=max(arr)\r\n max1=max1+k \r\n arr[arr.index(k)]-=1\r\n c+=1\r\nc=0 \r\nwhile(c<n):\r\n k=min(k1)\r\n if k==0:\r\n k1.remove(0)\r\n else:\r\n min1=min1+k\r\n k1[k1.index(k)]-=1\r\n c+=1 \r\nprint(max1,min1) ", "n,m=map(int,input().split(\" \"))\r\nl=[int(num) for num in input().split(\" \")]\r\nt=l\r\ndic={i:l[i] for i in range(m)}\r\nif sum(l)==n:\r\n a=0\r\n for i in l:\r\n a+=i*(i+1)//2\r\n print(a,a)\r\nelse:\r\n maxi=0\r\n mini=0\r\n for u in range(n):\r\n maxi+=max(l)\r\n l=l+[max(l)-1]\r\n l.remove(max(l))\r\n mini+=min(t)\r\n if min(t)>1:\r\n r=min(t)\r\n t.remove(min(t))\r\n t=t+[r-1]\r\n else:\r\n t.remove(min(t))\r\n print(maxi,mini)", "n,m = map(int,input().split())\r\n\r\n\r\n\r\n\r\nt = list(map(int,input().split()))\r\n\r\n\r\n\r\nf=[]\r\n\r\n\r\nfor k in t:\r\n f.append(k)\r\n\r\np=0\r\nfor i in range(n):\r\n p+=max(t)\r\n t[t.index(max(t))]-=1\r\n\r\nu=0\r\nq=0\r\nf.sort()\r\n\r\n\r\n\r\nfor j in range(m):\r\n if u<n:\r\n if u+f[j]<=n:\r\n q+=f[j]*(f[j]+1)//2\r\n u+=f[j]\r\n elif u+f[j]>n:\r\n for k in range(n-u):\r\n q+=f[j]\r\n f[j]-=1\r\n break\r\n\r\n else:\r\n break\r\n\r\nprint(p,q)\r\n \r\n \r\n \r\n \r\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = a.copy()\r\nz = x = 0\r\nfor i in range(n):\r\n a.sort()\r\n b.sort()\r\n z += a[0]\r\n if a[0] == 1:\r\n a[0] = 1000\r\n else:\r\n a[0] -= 1\r\n x += b[m - 1]\r\n b[m - 1] -= 1\r\nprint(x, z)", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=[]\r\nfor i in a:\r\n b.append(i)\r\nk=0\r\nma=0\r\nwhile k<n:\r\n ma+=max(a)\r\n a[a.index(max(a))]-=1\r\n k+=1\r\nk=0\r\nmi=0\r\nwhile k<n:\r\n m=b.index(min(b))\r\n mi+=min(b)\r\n k+=1\r\n b[m]-=1\r\n if b[m]==0:\r\n del b[m]\r\n if len(b)==0:\r\n break\r\nprint(ma,mi)", "\r\nn,m = list(map(int, input().split()))\r\nplanes = list(map(int, input().split()))\r\n\r\nmax_ = min_ = 0\r\np = planes.copy()\r\nq = planes.copy()\r\nfor i in range(n):\r\n\tp.sort()\r\n\tmax_ += max(1, p[len(p)-1])\r\n\tp[len(p)-1] -= 1\r\n\r\nm = 100000000\r\nfor ind in range(n):\r\n\tq.sort()\r\n\tindex = 0\r\n\tfor i in q:\r\n\t\tif(i <= 0):\r\n\t\t\tindex += 1\r\n\t\telse:\r\n\t\t\tbreak\r\n\tmin_ += max(1, q[index])\r\n\tq[index] -= 1\r\n\r\nprint(max_, min_)", "\r\n#ismail_moussi\r\nn,m=map(int,input().split())\r\na=list(map(int, input().split()))\r\nb=[e for e in a]\r\nmax=0\r\nmin=0\r\nfor i in range(n):\r\n a.sort()\r\n b.sort()\r\n max+=a[-1]\r\n a[-1]-=1\r\n min+=b[0]\r\n b[0]-=1\r\n if b[0]==0:\r\n b=b[1:] \r\nprint(max,min)\r\n\r\n", "n, m = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nl.sort()\r\nk = list(l)\r\nk.reverse()\r\n\r\nmaxi, mini = 0, 0\r\n\r\np = 0\r\nfor i in range(n):\r\n if p != m - 1 and k[p] < k[p+1]:\r\n p += 1\r\n elif p == m - 1 and k[p] > k[p-1]:\r\n pass\r\n else:\r\n p = 0\r\n buf = k[p]\r\n maxi += buf\r\n k[p] -= 1\r\n\r\np = 0\r\nfor i in range(n):\r\n if l[p] == 0:\r\n p += 1\r\n buf = l[p]\r\n mini += buf\r\n l[p] -= 1\r\n\r\nprint(maxi, mini)\r\n", "def get_cost(command,zlotys,passengers,cost = 0):\r\n while passengers:\r\n\r\n cost += command(zlotys)\r\n\r\n zlotys[zlotys.index(command(zlotys))] -= 1\r\n\r\n if not zlotys[zlotys.index(command(zlotys))]:\r\n zlotys.pop(zlotys.index(command(zlotys)))\r\n \r\n passengers -= 1\r\n \r\n return cost\r\n\r\npassengers,planes = map(int,input().split())\r\nzlotys = [int(x) for x in input().split()]\r\n\r\nexpensive = get_cost(max,zlotys[:],passengers)\r\ncheap = get_cost(min,zlotys,passengers)\r\n\r\nprint (expensive,cheap)\r\n", "import heapq\r\nn,m =[int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nb = [-x for x in a]\r\nheapq.heapify(a)\r\nheapq.heapify(b)\r\nq =a\r\nq2=b\r\nminprofit = 0\r\nmaxprofit = 0\r\nfor i in range(n):\r\n minprofit+=q[0]\r\n maxprofit+=q2[0]\r\n x = heapq.heappop(q)\r\n x-=1\r\n if x!=0:\r\n heapq.heappush(q,x)\r\n y=heapq.heappop(q2)\r\n y+=1\r\n if y!=0:\r\n heapq.heappush(q2,y)\r\n\r\nprint(-maxprofit,minprofit)\r\n", "n, m = map(int,input().split())\na = [int(x) for x in input().split()]\nb = sorted(a)\nansmax = 0\ni = 0\nwhile i < n:\n ansmax += b[-1]\n b[-1]-=1\n b.sort()\n i+=1\n\nansmin = 0\nc = sorted(a)\ni = 0\nwhile i < n: \n if c[0]>0:\n ansmin += c[0]\n c[0]-=1\n c.sort()\n i +=1\n else:\n c = c[1:]\n continue\nprint(ansmax,ansmin)\n", "import copy\r\n\r\nn , m = map(int , input().split())\r\ns = n\r\nseats = list(map(int , input().split()))\r\nmin_seats = copy.copy(seats)\r\nmax_earning = 0\r\nmin_earning = 0\r\n\r\n\r\nif len(seats) > 0 or len(set(seats)) != 1 and list(set(seats))[0] != 0:\r\n def find_max():\r\n global n\r\n global max_earning\r\n global seats\r\n while n > 0:\r\n seats = sorted(seats , reverse = True)\r\n max_earning += seats[0]\r\n seats[0] -= 1\r\n n -= 1\r\n no_zero = []\r\n for itm in seats:\r\n if itm != 0:\r\n no_zero.append(itm)\r\n seats = no_zero\r\n n = s\r\n return max_earning\r\n\r\n def find_min():\r\n global min_earning\r\n global min_seats\r\n global n\r\n while n > 0:\r\n min_seats.sort()\r\n min_earning += min_seats[0]\r\n min_seats[0] -= 1\r\n n -= 1\r\n no_zero = []\r\n for itm in min_seats:\r\n if itm != 0:\r\n no_zero.append(itm)\r\n min_seats = no_zero\r\n return min_earning\r\n\r\n maxxxx = find_max()\r\n minnnn = find_min()\r\n print(maxxxx , minnnn)\r\nelse:\r\n print('0 0')", "a,b= map(int, input().split())\r\narr = list(map(int, input().split()))\r\nx=list(arr)\r\nsum=0\r\nfor i in range(0,a):\r\n x.sort(reverse=True)\r\n sum=sum+x[0]\r\n x[0]=x[0]-1\r\nprint(sum,end=\" \")\r\n\r\n\r\nsum=0\r\ni=0\r\nj=0\r\narr.sort()\r\nwhile i<a:\r\n if arr[j]<=0:\r\n j=j+1\r\n sum=sum+arr[j]\r\n arr[j]=arr[j]-1\r\n i=i+1\r\nprint(sum)\r\n", "# https://codeforces.com/problemset/problem/218/B\n\npassengers, planes = [int(num) for num in input().split()]\nseats = [int(seat) for seat in input().split()]\nminSeats = sorted(seats)\nmaxSeats = minSeats[::-1]\n\nminCost = 0\nminPos = 0\nminPas = passengers\nwhile(minPas>0):\n if(minSeats[minPos] == 0):\n minPos += 1\n minCost += minSeats[minPos]\n minSeats[minPos] -= 1\n minPas -= 1\n\nmaxCost = 0\nmaxPos = 0\nmaxPas = passengers\nwhile(maxPas>0):\n maxPos = maxSeats.index(max(maxSeats))\n maxCost += maxSeats[maxPos]\n maxSeats[maxPos] -= 1\n maxPas -= 1\n\nprint(maxCost, minCost)", "from heapq import heapify, heappop, heappush\r\nn, m = map(int, input().split())\r\nif m==1:\r\n flights1 = [int(input())]\r\nelse:\r\n flights1 = list(map(int, input().split()))\r\nflights2 = [-i for i in flights1]\r\n\r\nheapify(flights1)\r\nheapify(flights2)\r\n\r\nn_ = n\r\nminCost = 0\r\nwhile n_>0:\r\n x = heappop(flights1)\r\n minCost += x\r\n x -= 1\r\n if x:\r\n heappush(flights1, x)\r\n n_ -= 1\r\nmaxCost = 0\r\nwhile n>0:\r\n x = heappop(flights2)\r\n maxCost += -x\r\n x += 1\r\n if x:\r\n heappush(flights2, x)\r\n n -= 1\r\nprint(maxCost, minCost)\r\n", "n , m = map(int,input().split())\r\nl = list(map(int,input().split()))\r\n\r\nl_Max_copy = l.copy()\r\nl_Min_copy = l.copy()\r\nearn_Max = 0\r\nearn_Min = 0\r\n\r\ni = 0\r\nwhile i < n:\r\n l_Max_copy.sort(reverse=True)\r\n earn_Max += l_Max_copy[0]\r\n l_Max_copy[0]-=1\r\n if l_Max_copy[0] == 0:\r\n l_Max_copy.pop(0)\r\n i+=1\r\n\r\ni = 0\r\nwhile i < n:\r\n l_Min_copy.sort()\r\n earn_Min += l_Min_copy[0]\r\n l_Min_copy[0]-=1\r\n if l_Min_copy[0] == 0:\r\n l_Min_copy.pop(0)\r\n i+=1\r\n\r\nprint(earn_Max,earn_Min)", "n, m = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\ni = 0\r\nmin = 0\r\na.sort()\r\nfor p in a:\r\n while p != 0 and i != n:\r\n min += p\r\n p -= 1\r\n i += 1\r\n\r\nmaximum = 0\r\nx = 0\r\nwhile x != n:\r\n l = a.index(max(a))\r\n maximum += a[l]\r\n a[l] -= 1\r\n x += 1\r\nprint(maximum, min)", "passageiros, tam = map(int,input().split())\r\navioes = list(map(int, input().split()))\r\navioes.sort()\r\navioesP = avioes[:]\r\nmenor = 0\r\nmaior = 0\r\np = 0\r\nm = tam-1\r\nfor i in range(passageiros):\r\n menor += avioesP[p]\r\n avioesP[p] -= 1\r\n if avioesP[p] == 0:\r\n p += 1\r\n maior += avioes[tam-1]\r\n avioes[tam-1] -= 1\r\n while avioes[m] < avioes[m-1] and m > 0:\r\n avioes[m], avioes[m-1] = avioes[m-1], avioes[m]\r\n m -= 1\r\n m = tam-1\r\nprint(maior,menor)", "n, m = map(int, input().split(\" \"))\r\nseats = [int(i) for i in input().split(\" \")]\r\nseats_ = seats.copy()\r\n\r\nmax_ = 0\r\nmin_ = 0\r\n\r\nfor x in range(n):\r\n m = max(seats)\r\n ind = seats.index(m)\r\n\r\n max_ += m\r\n if m >= 2:\r\n seats[ind] -= 1\r\n else:\r\n seats.pop(ind)\r\n\r\n\r\nfor x in range(n):\r\n m = min(seats_)\r\n ind = seats_.index(m)\r\n\r\n min_ += m\r\n if m >= 2:\r\n seats_[ind] -= 1\r\n else:\r\n seats_.pop(ind)\r\n\r\nprint(max_, min_)", "import sys\n#from collections import Counter as C\n#from heapq import *\n# sys.stdin = open('in.txt', 'r') \n# sys.stdout = open('out.txt', 'w')\nn,m=map(int,input().split())\na=list(map(int,input().split()))\nb=sorted(list(a))\nmx,mi=0,0\nfor i in range(n):\n\tif b[0]==0:\n\t\tb=b[1:]\n\t\tmi+=b[0]\n\t\tb[0]-=1\n\telse:\n\t\tmi+=b[0]\n\t\tb[0]-=1\nfor i in range(n):\n\tmx+=max(a)\n\ta[a.index(max(a))]-=1\nprint(mx,mi)\n\n", "yolcu_sayisi = input('').split()[0]\r\nbos_koltuk = input('').split()\r\nfor i in bos_koltuk:\r\n bos_koltuk[bos_koltuk.index(i)] = int(i)\r\nmax1 = 0\r\nmin1 = 0\r\nyedek = []\r\nfor x in bos_koltuk:\r\n yedek.append(int(x))\r\n\r\nfor i in range(int(yolcu_sayisi)):\r\n price = max(bos_koltuk)\r\n max1 += price\r\n bos_koltuk[bos_koltuk.index(price)] = price - 1\r\n\r\nfor i in range(int(yolcu_sayisi)):\r\n price = min(yedek)\r\n min1 += price\r\n if price==1:\r\n yedek.remove(price)\r\n else:\r\n yedek[yedek.index(price)] = price -1 \r\n\r\nprint(max1, min1)", "def findmaxidx(a):\r\n maxidx = 0\r\n for i in range(len(a)):\r\n if a[i] > a[maxidx]: maxidx = i\r\n return maxidx\r\n \r\ndef addlen(a, lenth):\r\n sum = 0\r\n for i in range(lenth):\r\n sum += (a-i)\r\n return sum\r\n \r\nn, m = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\na.sort()\r\nn1 = n\r\n# find smallest cost\r\nmincost = 0\r\nfor i in range(m): \r\n if n > a[i]: \r\n mincost += addlen(a[i], a[i])\r\n n -= a[i]\r\n else: \r\n mincost += addlen(a[i], n)\r\n n -= n\r\n break\r\n\r\n#find max cost\r\nmaxcost = 0\r\nfor i in range(n1):\r\n maxidx = findmaxidx(a)\r\n maxcost += a[maxidx]\r\n a[maxidx] -= 1\r\n n1 -= 1\r\n if n1 == 0: break\r\n \r\nprint( '%d %d' % (maxcost, mincost))\r\n ", "l1=[int(x) for x in input().split()]\r\nn=l1[0]\r\nm=l1[1]\r\nl2=[int(x) for x in input().split()]\r\n\r\nmi=0\r\nma=0\r\nl2.sort()\r\ns=len(l2)\r\nb=l2[::]\r\nfor i in range(n):\r\n x=l2[0]\r\n y=b[s-1]\r\n mi+=x\r\n ma+=y\r\n \r\n l2[0]-=1\r\n if l2[0]==0:\r\n l2.pop(0)\r\n b[s-1]-=1\r\n b.sort()\r\nprint(ma,mi)", "#!/usr/bin/python3\n\ndef readln(): return tuple(map(int, input().split()))\n\nn, m = readln()\na = list(readln())\nl = r = 0\nb = list(a)\nfor _ in range(n):\n i = b.index(min(b))\n l += b[i]\n b[i] -= 1\n if b[i] == 0:\n b[i] = 1 << 30\nfor _ in range(n):\n i = a.index(max(a))\n r += a[i]\n a[i] -= 1\nprint(r, l)\n", "n,m = [int(x) for x in input().split()]\r\nl = [int(x) for x in input().split()]\r\na = sorted(l)\r\nctr = int(0)\r\ni = int(0)\r\nmaxprice = int(0)\r\nminprice = int(0)\r\n\r\n\r\nwhile ctr!=n:\r\n\tmaxprice+=max(l)\r\n\tl[l.index(max(l))]-=1\r\n\tctr+=1\r\n\r\nctr = 0\r\n\r\nwhile ctr!=n:\r\n\tminprice += a[i]\r\n\ta[i]-=1\r\n\tctr+=1\r\n\tif a[i]==0:\r\n\t\ti+=1\r\n\r\n\t\t\r\nprint(maxprice,minprice)\t\t\r\n\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 ", "from sys import stdin, stdout\r\n\r\ninput = lambda : map(int, stdin.readline().split())\r\n\r\nn, m = input()\r\n\r\narr = list(input())\r\narr.sort()\r\n\r\n\r\nnf = nb = n\r\n\r\nfront = 0\r\nback = 0\r\n\r\nfor i in range(m):\r\n if nf > 0:\r\n temp = arr[i]\r\n while temp > 0 and nf > 0:\r\n front += temp\r\n temp -= 1\r\n nf -= 1\r\n \r\nwhile nb > 0:\r\n ind = arr.index(max(arr))\r\n temp = arr[ind]\r\n back += temp\r\n arr[ind] -= 1\r\n nb -= 1\r\n \r\nprint(back, front)\r\n", "n,m=(int(i) for i in input().split())\nline=list(map(int,input().split()))\nline1=line.copy()\nline2=line.copy()\nmaximum,minimum=0,0\nfor i in range(n):\n if line1 is not None:\n t=max(line1)\n maximum+=t\n line1[line1.index(t)]=t-1\nfor j in range(n):\n if line2 is not None:\n t=min(line2) \n minimum+=t\n if t-1>=0:\n line2[line2.index(t)]=t-1\n if 0 in line2:\n line2.remove(0)\nprint(maximum,minimum)\n\t \t \t\t \t\t \t\t \t \t \t \t\t \t\t \t\t", "n, m = map(int, input().split())\r\n\r\nseats = sorted([int(x) for x in input().split()])\r\nseatsc = [s for s in seats]\r\nif n >= sum(seats):\r\n sm = sum([(x * (x + 1)) // 2 for x in seats])\r\n print(sm, sm)\r\nelse:\r\n pc = 0\r\n mncost = 0\r\n mxcost = 0\r\n while pc < n:\r\n ind = seats.index(max(seats))\r\n mxcost += seats[ind]\r\n seats[ind] -= 1\r\n pc += 1\r\n pc = 0\r\n while pc < n:\r\n ind = seatsc.index(min(seatsc))\r\n mncost += seatsc[ind]\r\n seatsc[ind] -= 1\r\n if seatsc[ind] == 0:\r\n seatsc.pop(ind)\r\n pc += 1\r\n print(mxcost,mncost)", "class Code:\r\n def __init__(self):\r\n self.n, self.m = list(map(int, input().split()))\r\n self.arr = list(map(int, input().split()))\r\n\r\n def process(self):\r\n mx, mn = 0, 0\r\n a = self.arr.copy()\r\n for i in range(self.n):\r\n ind = a.index(max(a))\r\n mx += a[ind]\r\n a[ind] -= 1\r\n for i in range(self.n):\r\n ind = self.arr.index(min(self.arr))\r\n mn += self.arr[ind]\r\n self.arr[ind] -= 1\r\n if self.arr[ind] == 0:\r\n self.arr.remove(0)\r\n self.m -= 1\r\n print(mx, mn)\r\n\r\n\r\nif __name__ == '__main__':\r\n code = Code()\r\n code.process()\r\n", "# benzene_ <>\r\n\r\nn,m=map(int,input().split())\r\nlst=list(map(int,input().split()))\r\nlst.sort()\r\nls=[]\r\nls.extend(lst)\r\ni=0 ; j=0\r\na=0\r\nwhile i <n:\r\n if lst[j]==0:\r\n j+=1\r\n z=lst[j]\r\n a+=z\r\n lst[j]=z-1\r\n i+=1\r\ni=0; b=0\r\nwhile i <n:\r\n x=max(ls)\r\n y=ls.index(x)\r\n ls[y]=x-1\r\n b+=x\r\n i+=1\r\nprint(b,a)\r\n ", "n,m=[int(x) for x in input().split()]\r\nf=[int(x) for x in input().split()]\r\nmin=0\r\nmax=0\r\na=sorted(f)\r\nb=sorted(f,reverse=True)\r\nfor i in range(n):\r\n a=sorted(a)\r\n a=[x for x in a if x!=0]\r\n b=sorted(b,reverse=True)\r\n b=[x for x in b if x!=0]\r\n max+=b[0]\r\n min+=a[0]\r\n a[0]-=1\r\n b[0]-=1\r\nprint(max,min)\r\n", "if __name__ == \"__main__\" :\n n,m = [int(x) for x in input().split()]\n a = list(map(int,input().split()))\n maxlist = list(a) \n minlist = list(a)\n maxlist.sort(reverse=True)\n minlist.sort(reverse=False)\n ''' print(maxlist)\n print(minlist) '''\n minz = 0\n maxz = 0\n i = 0\n cntzero = 0\n pas = 0\n while pas < n :\n if pas == n :\n break\n\n maxz += max(maxlist) \n minz += min(val for val in minlist if val > 0)\n indmax = maxlist.index(max(maxlist))\n indmin = minlist.index(min(val for val in minlist if val > 0))\n maxlist[indmax] -= 1\n minlist[indmin] -= 1\n pas += 1\n ''' print(\"minz:{} min(minlist):{} pas:{} ind:{}\".format(maxz,max(maxlist),pas,ind)) '''\n \n print(\"{} {}\".format(maxz,minz))\n", "import heapq\ndef calc(n, a):\n\n # heap with smallest\n smallest = a.copy()\n heapq.heapify(smallest)\n\n sn = 0\n scost = 0\n while sn < n:\n\n plane = heapq.heappop(smallest)\n sn+=1\n scost += plane\n plane -= 1\n if plane > 0:\n heapq.heappush(smallest, plane)\n\n # heap with negatives so largest\n largest = a.copy()\n largest = [-x for x in largest]\n heapq.heapify(largest)\n ln = 0\n lcost = 0\n while ln < n:\n plane = heapq.heappop(largest)\n ln+=1\n lcost += -plane\n plane += 1\n if plane < 0:\n heapq.heappush(largest, plane)\n\n return str(lcost) + \" \" + str(scost)\n# get inputs\nn,m = map(int, input().split())\na = list(map(int, input().split()))\nprint(calc(n, a))\n\n\n", "\r\nn , m = [int(x) for x in input().split()]\r\narr = [int(x) for x in input().split()]\r\narr2 = list(arr)\r\n\r\nminumium = 0\r\ncount = 0\r\n\r\nimport math\r\n\r\ndef key(e):\r\n if e < 1:\r\n return math.inf\r\n return e\r\n\r\nwhile count < n:\r\n mn = min(arr , key = key)\r\n minumium += mn\r\n arr[arr.index(mn)] -= 1\r\n count += 1\r\n\r\narr = list(arr2) \r\nmaximum = 0\r\ncount = 0\r\n\r\nwhile count < n:\r\n mx = max(arr)\r\n maximum += mx\r\n arr[arr.index(mx)] -= 1\r\n count += 1\r\n\r\nprint(maximum , minumium)\r\n\r\n", "n,m=map(int,input().split())\r\nseats=list(map(int,input().split()))\r\nmax_cost,min_cost=0,0\r\npassengers=n\r\nSEATS=seats.copy()\r\nseats.sort()\r\nSEATS.sort()\r\ni=0\r\nwhile(n>0):\r\n min_cost+=seats[i]\r\n seats[i]-=1\r\n if seats[i]==0:\r\n i+=1\r\n n-=1\r\nwhile(passengers>0):\r\n max_cost+=SEATS[-1]\r\n SEATS[-1]-=1\r\n SEATS.sort()\r\n passengers-=1\r\n\r\nprint(max_cost,min_cost) \r\n\r\n", "R=input\r\nI=lambda x:list(map(int,x.split()))\r\nn,m=I(R())\r\nt=R()\r\na=I(t)\r\nb=I(t)\r\np=o=0\r\nn='0'*n\r\nfor _ in n:t=max(a);p+=t;a[a.index(t)]-=1\r\nfor _ in n:t=min(b);o+=t;t=b.index(t);b[t]-=1;b[t]+=10**9*(not b[t])\r\nprint(p,o)", "n,m=map(int,input().split())\r\na = list(map(int, input().split()))\r\nsum=0\r\na.sort()\r\nb=a.copy()\r\nmaxsum=0\r\nfor i in range(n):\r\n maxsum=maxsum+max(a)\r\n a[a.index(max(a))]=a[a.index(max(a))]-1\r\nminsum=0\r\nfor i in range(n):\r\n if(min(b)==0):\r\n b.remove(min(b))\r\n minsum=minsum+min(b)\r\n b[b.index(min(b))]=b[b.index(min(b))]-1\r\nprint(maxsum,minsum)\r\n\r\n\r\n\r\n\r\n", "split = lambda: list(map(int, input().split()))\r\na, b = split()\r\nseats = split()\r\ndef count(t):\r\n temp = seats.copy()\r\n p = 0\r\n for x in range(a):\r\n s = temp.index(t(temp))\r\n p += temp[s]\r\n temp[s] -= 1\r\n if temp[s] == 0:\r\n temp.remove(temp[s])\r\n return p\r\nprint(count(max), count(min))", "n, m = list(map(int, input().split()))\r\nmax_list = list(map(int, input().split()))\r\n\r\nmax_list.sort(reverse = True)\r\nmin_list = max_list[:]\r\nmax_cost, min_cost = 0, 0\r\n\r\nfor i in range(n):\r\n\tmax_cost += max_list[0]\r\n\tmax_list[0] -= 1\r\n\tj = 0\r\n\twhile(j < len(max_list) - 1 and max_list[j] < max_list[j+1]):\r\n\t\tmax_list[j] , max_list[j+1] = max_list[j+1], max_list[j]\r\n\t\tj += 1\r\n\r\nfor i in range(n):\r\n\tmin_cost += min_list[-1]\r\n\tmin_list[-1] -= 1\r\n\tif min_list[-1] == 0:\r\n\t\tmin_list.pop(-1)\r\n\r\nprint(max_cost, min_cost)\r\n\r\n", "m, n = map(int, input().split(\" \"))\r\np = list(map(int, input().split(\" \")))\r\np.sort()\r\n\r\nmm = m\r\n\r\n# numMaxP = 0\r\n# curMaxNum = 0\r\nmaxA = 0\r\nminA = 0\r\n\r\nfor i in range(n):\r\n if(m <= p[i]):\r\n minA += (m*(p[i] + p[i] - m+1))//2\r\n break\r\n else:\r\n minA += (p[i]*(p[i]+1)//2)\r\n m -= p[i]\r\n\r\n\r\n# a = list(set(p))\r\n# a.reverse()\r\n# print(a)\r\n# a.append(0)\r\n#\r\n# for i in range(len(a)-1):\r\n# numMaxP += p.count(a[i])\r\n# if(mm//numMaxP <= a[i] and False):\r\n# # break\r\n# max += numMaxP * ((a[i]-mm//numMaxP)*(a[i] + a[i]-mm))//2\r\n# # max -= numMaxP * a[i]\r\n# break\r\n# else:\r\n# print()\r\n# print(numMaxP)\r\n# print(mm)\r\n# print(a[i])\r\n# print(\"Hats\")\r\n# print(mm-a[i])\r\n# print(a[i]+a[i+1]-1)\r\n# print(numMaxP * ((a[i])*(a[i]+a[i+1]-1))//2)\r\n# max += numMaxP * ((a[i])*(a[i]+a[i+1]-1))//2\r\n# mm -= numMaxP * (a[i] - a[i+1])\r\n# print(mm)\r\n# print()\r\n\r\np.reverse()\r\nfor i in range(mm):\r\n curMax = max(p)\r\n maxA += curMax\r\n p[p.index(curMax)] -= 1\r\n\r\n\r\n\r\n\r\nprint(maxA, minA)", "import heapq\r\npassengers, _ = map(int, input().split())\r\ncapacities = [int(i) for i in input().split()]\r\n\r\navailable_heap_min = capacities.copy()\r\nheapq.heapify(available_heap_min)\r\n\r\navailable_heap_max = [-c for c in capacities]\r\nheapq.heapify(available_heap_max)\r\n\r\nmincost = 0\r\nmaxcost = 0\r\nfor _ in range(passengers):\r\n least_available = heapq.heappop(available_heap_min)\r\n mincost += least_available\r\n if least_available != 1:\r\n heapq.heappush(available_heap_min, least_available - 1)\r\n\r\n most_available = -heapq.heappop(available_heap_max)\r\n maxcost += most_available\r\n if most_available != 1:\r\n heapq.heappush(available_heap_max, -(most_available - 1))\r\n\r\nprint(f\"{maxcost} {mincost}\")\r\n", "import sys,os,io,time,copy\r\nif os.path.exists('input.txt'):\r\n sys.stdin = open('input.txt', 'r')\r\n sys.stdout = open('output.txt', 'w')\r\n\r\nimport math\r\n\r\ndef main():\r\n # start=time.time()\r\n n,m=map(int,input().split())\r\n arr=list(map(int,input().split()))\r\n brr=copy.deepcopy(arr)\r\n req=0\r\n for i in range(n):\r\n x=max(arr)\r\n y=arr.index(x)\r\n req+=x\r\n arr[y]-=1\r\n if arr[y]==0:\r\n arr.pop(y)\r\n print(req,end=\" \")\r\n req=0\r\n for i in range(n):\r\n x=min(brr)\r\n y=brr.index(x)\r\n req+=x\r\n brr[y]-=1\r\n if brr[y]==0:\r\n brr.pop(y)\r\n print(req)\r\n\r\n\r\n # end=time.time()\r\nmain()", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\nd = n\r\nmin_s = 0\r\nfor i in range(m):\r\n if a[i] <= d:\r\n min_s += a[i] * (1 + a[i]) // 2\r\n d -= a[i]\r\n else:\r\n min_s += d * (a[i] - d + 1 + a[i]) // 2\r\n d = 0\r\nmax_s = 0\r\nfor i in range(n):\r\n p = max(a)\r\n max_s += p\r\n a[a.index(p)] -= 1\r\nprint(max_s, min_s)\r\n", "from collections import deque\r\nimport math\r\nfrom random import randint as rand\r\nfrom functools import lru_cache\r\nimport string\r\nalph_l = string.ascii_lowercase\r\nalph_u = string.ascii_uppercase\r\n\r\n\r\n\r\n\r\ndef main():\r\n n, m = list(map(int, input().split()))\r\n a = list(map(int, input().split()))\r\n n_start = n\r\n a_start = a.copy()\r\n ans = 0\r\n cnt = 0\r\n while n > 0:\r\n ans += max(a)\r\n a[a.index(max(a))] -= 1\r\n n -= 1\r\n n = n_start\r\n a = a_start.copy()\r\n while n > 0:\r\n cnt += min(a)\r\n a[a.index(min(a))] -= 1\r\n n -= 1\r\n if min(a) <= 0:\r\n del a[a.index(min(a))]\r\n\r\n\r\n print(ans, cnt)\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "def getinput(): \n \"\"\" get input from prompt\n :Returns \n list \n :Usage \n >>> numbers = getinput()\n 5 6 7\n >>> print(numbers)\n [5, 6, 7]\n \"\"\"\n \n return [int(i) for i in input().split()]\n\nn, m = getinput()\na = getinput()\n\ndef getmax(b, n):\n maxz = 0\n a = sorted(b)\n\n for i in range(n):\n maxz += a[-1]\n a[-1] -= 1\n if a[-1] == 0:\n del a[-1]\n # elif a[-1] < a[-2]:\n # a[-1], a[-2] = a[-2], a[-1]\n a.sort()\n\n return maxz\n\ndef getmin(a, n):\n a.sort()\n minz = 0\n\n for i in range(n):\n pass\n minz += a[0]\n a[0] -= 1\n if a[0] == 0:\n del a[0]\n\n return minz\n\nprint(getmax(a, n), getmin(a, n))", "import sys\n\n\ndef maxT(n, tickets):\n total = 0\n for i in range(len(tickets) - 1, -1, -1):\n if n == 0:\n break\n ele = tickets[i]\n sold = min(n, ele)\n n -= sold\n total += i * sold\n\n return total\n\n\ndef binFormula(k):\n \"\"\"calculates from 1 to k\"\"\"\n return ((k) * (k + 1)) / 2\n\n\ndef minT(n, tickets):\n total = 0\n for i in range(0, len(tickets), 1):\n if n == 0:\n break\n ele = tickets[i]\n total += binFormula(ele)\n n -= ele\n if n < 0:\n total -= binFormula(abs(n))\n break\n\n return int(total)\n\n\ndef readinput():\n\n n, m = map(int, sys.stdin.readline().rstrip().split(\" \"))\n planeTickets = list(map(int, sys.stdin.readline().rstrip().split(\" \")))\n planeTickets.sort()\n counter = [0 for _ in range(planeTickets[-1] + 1)]\n c = 0\n for i in range(0, len(planeTickets)):\n nextEle = planeTickets[i]\n while nextEle >= c:\n counter[c] += len(planeTickets) - i\n c += 1\n\n return [(maxT(n, counter), minT(n, planeTickets))]\n\n\nfor x, y in readinput():\n print(x, y)\n", "# It's all about what U BELIEVE\ndef gint(): return int(input())\ndef gint_arr(): return list(map(int, input().split()))\ndef gfloat(): return float(input())\ndef gfloat_arr(): return list(map(float, input().split()))\ndef pair_int(): return map(int, input().split())\n###############################################################################\nINF = (1 << 31)\ndx = [-1, 0, 1, 0]\ndy = [ 0, 1, 0, -1]\n###############################################################################\n###############################################################################\nn, m = gint_arr()\na = gint_arr()\nmn, mx = 0, 0\ntmp = a[:]\n\nx = n\nwhile x:\n min_index = tmp.index(min(tmp))\n mn += tmp[min_index]\n tmp[min_index] -= 1\n\n if not tmp[min_index]:\n tmp[min_index] = INF\n\n x -= 1\n\nx = n\nwhile x:\n min_index = a.index(max(a))\n mx += a[min_index]\n a[min_index] -= 1\n x -= 1\n\n\nprint(mx, mn)\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\ncount=[]\r\nfor item in a:\r\n for i in range(item,0,-1):\r\n count.append(i)\r\nans=sorted(count)[::-1]\r\nprint(sum(ans[:n]), sum(count[:n]))", "n, m = list(map(int, input().split(' ')))\r\nplanes = list(map(int, input().split(' ')))\r\noriginalPlanes = planes.copy()\r\nhighestX = max(planes)\r\nlowestX = min(planes)\r\nhighestCount = 0\r\nminCount = 0\r\n\r\nfor i in range(0, n):\r\n highestCount += highestX\r\n planes[planes.index(highestX)] -= 1\r\n highestX = max(planes)\r\n\r\nplanes = originalPlanes.copy()\r\n\r\nfor i in range(0, n):\r\n minCount += lowestX\r\n planes[planes.index(lowestX)] -= 1\r\n if min(planes) > 0:\r\n lowestX = min(planes)\r\n else:\r\n lowest = max(planes)\r\n for j in range(0, m):\r\n if lowest > planes[j] and planes[j] != 0:\r\n lowest = planes[j]\r\n lowestX = lowest\r\n\r\nprint(highestCount, minCount)\r\n", "import copy\n\nnum_passengers, num_planes = [int(x) for x in input().split()]\nempty_seats = [int(x) for x in input().split()]\n\n\n\n# Use hash to store current seat of plane\n\nmax_list = copy.deepcopy(empty_seats)\n\nmin_cost = 0\nfor i in range(num_passengers):\n\tsmallest_value = min(empty_seats)\n\tidx = empty_seats.index(smallest_value)\n\tmin_cost += smallest_value\n\tempty_seats[idx] = empty_seats[idx] - 1\n\tif 0 in empty_seats:\n\t\tempty_seats.remove(0)\n\nmax_cost = 0\nfor i in range(num_passengers):\n\tlargest_value = max(max_list)\n\tidx = max_list.index(largest_value)\n\tmax_cost += largest_value\n\tmax_list[idx] = max_list[idx] - 1\n\nprint(max_cost, min_cost)\n\t\t\t \t \t\t\t \t\t \t \t \t \t \t\t\t\t \t", "def maxe(maxx,m):\r\n index=0\r\n val=maxx[0]\r\n for i in range(m):\r\n if(maxx[i]>val):\r\n val=maxx[i]\r\n index=i\r\n maxx[index]-=1\r\n return val\r\n\r\ndef mine(minn,m):\r\n index=0\r\n val=1000\r\n for i in range(m):\r\n if(minn[i]<val and minn[i]>0):\r\n val=minn[i]\r\n index=i\r\n minn[index]-=1\r\n return val\r\n\r\nn,m=map(int,input().split())\r\nmaxx=list(map(int,input().split()))\r\nminn=maxx[:]\r\nmincost=0\r\nmaxcost=0\r\nfor i in range(n):\r\n maxcost+=maxe(maxx,m)\r\n mincost+=mine(minn,m)\r\nprint(maxcost,mincost)", "p=input()\r\nn,m=map(int,p.split())\r\nq=input()\r\nq=list(map(int,q.split()))\r\na=[]\r\nfor i in q:\r\n a.append(i)\r\nc=0\r\nq.sort()\r\nd=n\r\ni=0\r\nwhile d>0:\r\n if q[i]>0:\r\n c+=q[i]\r\n q[i]-=1\r\n d-=1\r\n else:\r\n i+=1\r\nw=0\r\nwhile n>0:\r\n a.sort(reverse=True)\r\n w+=a[0]\r\n a[0]-=1\r\n n-=1\r\nprint(w,c)", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=a.copy()\r\nx,m=0,0\r\nfor i in range(n):\r\n a.sort()\r\n b.sort(reverse=True)\r\n x+=a[-1]\r\n a[-1]-=1\r\n m+=b[-1]\r\n b[-1]-=1\r\n if len(b)>0 and b[-1]==0: del b[-1]\r\nprint(x,m)", "n, m = list(map(int, input().split()))\r\nl = list(map(int, input().split()))\r\n# max\r\nms = l.copy()\r\nmx = 0\r\nfor i in range(n):\r\n x = max(ms)\r\n mx += x\r\n ms[ms.index(max(ms))] -= 1\r\nprint(mx, end=\" \")\r\n\r\n# min\r\nmq = l.copy()\r\nmn = 0\r\nfor k in range(n):\r\n if min(mq) == 0:\r\n mq.remove(min(mq))\r\n if min(mq) > 0:\r\n y = min(mq)\r\n mn += y\r\n mq[mq.index(min(mq))] -= 1\r\n\r\nprint(mn, end=\" \")", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=[]\r\nfor i in a:\r\n b.append(i)\r\nm1=0\r\nfor i in range(n):\r\n m=max(a)\r\n ind=a.index(m)\r\n m1+=m\r\n a[ind]-=1\r\nm2=0\r\nfor i in range(n):\r\n \r\n m=min(b)\r\n ind=b.index(m)\r\n \r\n m2+=m\r\n b[ind]-=1 \r\n if(b[ind]==0):\r\n b.remove(b[ind])\r\nprint(m1,m2)", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort(reverse=True)\r\na=0\r\nb=0\r\nt=l[:]\r\nfor i in range(n):\r\n m=max(l)\r\n l[l.index(m)]-=1\r\n a+=m\r\nfor i in range(n):\r\n m=min(t)\r\n t[t.index(m)]-=1\r\n if(0 in t):\r\n t.remove(0)\r\n b+=m\r\nprint(a,b)\r\n \r\n\r\n ", "x=list(map(int,input().split()))\r\nn=x[0]\r\nm=x[1]\r\na=list(map(int,input().split()))\r\nb=a.copy()\r\nma=0\r\nfor i in range(n):\r\n k=max(a)\r\n ma=ma+k\r\n if(k>0):\r\n ki=a.index(k)\r\n a[ki]=a[ki]-1\r\nmi=0\r\n\r\nfor i in range(n):\r\n if(0 in b):\r\n b.pop(b.index(0))\r\n k=min(b)\r\n mi=mi+k\r\n ki=b.index(k)\r\n b[ki]=b[ki]-1\r\n\r\nprint(str(ma)+\" \"+str(mi))\r\n\r\n", "n , m = map(int,input().split())\narr = list(map(int,input().split()))\narrcopy = []\narr.sort()\nfor i in arr:\n arrcopy.append(i)\ncount =0\nc= n\ni = 0\nwhile(c>0):\n val = arr[i]\n if(val==0):\n i+=1\n continue\n else:\n count+=val\n arr[i]-=1\n c-=1\nminanswer = count\nc= n\ncount =0 \nwhile(c>0):\n val = arrcopy[-1]\n count+=val\n arrcopy[-1]-=1\n arrcopy.sort()\n c-=1\nprint(str(count)+\" \"+str(minanswer))\n", "import heapq\r\nimport 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\nma, mi = 0, 0\r\nh = []\r\nfor i in a:\r\n heapq.heappush(h, -i)\r\nfor _ in range(n):\r\n i = heapq.heappop(h)\r\n ma -= i\r\n if i + 1:\r\n heapq.heappush(h, i + 1)\r\nh = []\r\nfor i in a:\r\n heapq.heappush(h, i)\r\nfor _ in range(n):\r\n i = heapq.heappop(h)\r\n mi += i\r\n if i - 1:\r\n heapq.heappush(h, i - 1)\r\nprint(ma, mi)", "n, m = map(int, input().split())\nA = list(map(int, input().split()))\n\nA.sort()\n\nB = list(A)\n\nmin_, max_ = 0, 0\n\npos = 0\nn1 = n\nwhile n1 > 0 and pos < len(A):\n assert A[pos] > 0\n min_ += A[pos]\n A[pos] -= 1\n if A[pos] == 0:\n pos += 1\n n1 -= 1\n\nA = B\npos = len(A) - 1\nn2 = n\nwhile n2 > 0 and pos >= 0:\n max_ += A[pos]\n A[pos] -= 1\n if A[pos] == 0:\n pos -= 1\n else:\n j = pos\n while j > 0 and A[j - 1] > A[j]:\n A[j - 1], A[j] = A[j], A[j - 1]\n j -= 1\n n2 -= 1\n\nprint(max_, min_)\n", "n,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = a.copy()\r\nM,m = 0,0\r\nfor i in range(n) :\r\n a.sort()\r\n b.sort(reverse=True)\r\n M += a[-1]\r\n a[-1] -= 1\r\n m += b[-1]\r\n b[-1] -= 1\r\n while len(b) > 0 and b[-1] == 0 : del b[-1]\r\nprint(M,m)\r\n", "def maxZ(lst,n):\r\n sp = list(lst)\r\n n1 = int(n)\r\n sommeMax = 0\r\n while(n1>0):\r\n index = sp.index(max(sp))\r\n sommeMax += max(sp)\r\n sp[index] -= 1\r\n if(sp[index]==0):\r\n sp.pop(index)\r\n n1-=1\r\n return sommeMax\r\n\r\ndef minZ(lst,n):\r\n sk = list(lst)\r\n n1 = int(n)\r\n sommeMax = 0\r\n while(n1>0):\r\n index = sk.index(min(sk))\r\n sommeMax += min(sk)\r\n sk[index] -= 1\r\n if(sk[index]==0):\r\n sk.pop(index)\r\n n1-=1\r\n \r\n return sommeMax\r\n\r\n\r\nn,m =[int(x) for x in input().split()]\r\nlst = [int(x) for x in input().split()]\r\n\r\nprint(str(maxZ(lst,n))+\" \"+str(minZ(lst,n)))", "n , m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nx = 0\r\nmex = 0\r\nmen = 0\r\nn1= n\r\n\r\na = sorted(a)\r\nfor i in range(m):\r\n x=a[i]\r\n while(x>0 and n>0):\r\n men+=x\r\n x-=1\r\n n-=1\r\n \r\nn = n1\r\nfor i in range(n):\r\n a=sorted(a)\r\n mex+=a[m-1]\r\n a[m-1]-=1\r\n \r\n\r\nprint(mex, men)\r\n", "n,m=map(int,input().split())\r\nmaxa=[]\r\nmini=[]\r\nma=0\r\nmi=0\r\na=list(map(int,input().split()))\r\nfor i in a:\r\n maxa.append(i)\r\n mini.append(i)\r\n\r\nfor x in range(n):\r\n ind=maxa.index(max(maxa))\r\n ma+=maxa[ind]\r\n maxa[ind]-=1\r\n\r\nfor y in range(n):\r\n imd=mini.index(min(mini))\r\n if mini[imd]==0:\r\n mini.pop(imd)\r\n imd=mini.index(min(mini)) \r\n if mini[imd]>0:\r\n mi+=mini[imd]\r\n mini[imd]-=1\r\nprint(ma,mi)\r\n\r\n ", "n, m = map(int, input().split())\r\nseats = list(map(int, input().split()))\r\nseats.sort()\r\n\r\ntmp_p = n\r\ntmp_seats = seats[::]\r\nidx = 0\r\nmin_cost = 0\r\nwhile idx < m and tmp_p > 0:\r\n if tmp_seats[idx]:\r\n min_cost += tmp_seats[idx]\r\n tmp_seats[idx] -= 1\r\n tmp_p -= 1\r\n else:\r\n idx += 1\r\n\r\ntmp_p = n\r\ntmp_seats = seats[::]\r\nmax_cost = 0\r\nwhile tmp_p:\r\n last_val = tmp_seats.pop()\r\n max_cost += last_val\r\n tmp_p -= 1 \r\n idx = len(tmp_seats)-1\r\n while idx >= 0:\r\n if tmp_seats[idx] <= last_val-1:\r\n break\r\n idx -= 1\r\n tmp_seats.insert(idx+1, last_val-1)\r\nprint(max_cost, min_cost)", "a,b=map(int,input().split())\r\na1=a\r\nd={}\r\nl=sorted(list(map(int,input().split())))\r\np=0\r\nfor i in range(1,1001):\r\n\td[i]=0\r\n\twhile(l[p]<i):\r\n\t\tp+=1\r\n\t\tif p==b:\r\n\t\t\tbreak\r\n\tif p==b:\r\n\t\tbreak\r\n\telse:\r\n\t\td[i]=b-p\r\nma=0\r\nfor i in sorted(d.keys(),reverse=1):\r\n\tif d[i]>=a:\r\n\t\tma+=i*a\r\n\t\tbreak\r\n\telse:\r\n\t\tma+=i*d[i]\r\n\t\ta-=d[i]\r\nmi=0\r\nfor i in l:\r\n\tif i<a1:\r\n\t\tmi+=(i*(i+1))//2\r\n\t\ta1-=i\r\n\telse:\r\n\t\tz=i\r\n\t\tfor j in range(a1):\r\n\t\t\tmi+=z\r\n\t\t\tz-=1\r\n\t\tbreak\r\nprint(ma,mi)", "def main() :\r\n n,m = map(int,input().split())\r\n array = list(map(int,input().strip().split()))\r\n array1 = array[:]\r\n n1 = n\r\n max_,min_ = 0,0\r\n lastIndex = -1\r\n while n != 0 :\r\n ma = 0\r\n for i in range(len(array)) :\r\n if array[i] > ma :\r\n ma = array[i]\r\n lastIndex = i\r\n max_ += ma\r\n array[lastIndex] -= 1\r\n n-=1\r\n \r\n while n1 != 0 :\r\n mi = array1[0] \r\n lastIndex = 0\r\n for i in range(1,len(array1)) :\r\n if array1[i] < mi and array1[i] :\r\n mi = array1[i]\r\n lastIndex = i \r\n min_ += mi\r\n array1[lastIndex] -= 1\r\n if array1[lastIndex] == 0 :\r\n del array1[lastIndex]\r\n\r\n n1-=1\r\n print(max_,min_) \r\nmain()", "\r\nimport heapq,math\r\nfrom collections import defaultdict,deque\r\n\r\nimport sys, os.path\r\n#sys.setrecursionlimit(10000000)\r\nif(os.path.exists('C:/Users/Dhanush/Desktop/cp/input.txt')):\r\n sys.stdout = open('C:/Users/Dhanush/Desktop/cp/output.txt', 'w')\r\n sys.stdin = open('C:/Users/Dhanush/Desktop/cp/input.txt', 'r')\r\n\r\ninput=sys.stdin.readline\r\n\r\n \r\n\r\nn,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nnl=[]\r\nans=[]\r\nfor i in l:\r\n heapq.heappush(nl,i)\r\ncur=0\r\nfor i in range(n):\r\n maxi=heapq.heappop(nl)\r\n cur+=maxi\r\n if(maxi>1):\r\n heapq.heappush(nl,maxi-1)\r\nans.append(cur)\r\nnl=[]\r\nfor i in l:\r\n heapq.heappush(nl,-i)\r\ncur=0\r\nfor i in range(n):\r\n maxi=-heapq.heappop(nl)\r\n cur+=maxi\r\n if(maxi>1):\r\n heapq.heappush(nl,-(maxi-1))\r\nans.append(cur)\r\nprint(max(ans),min(ans))\r\n", "n,m=map(int,input().split());t=n\r\na=sorted(list(map(int,input().split())),reverse=True)\r\nb=a.copy();b.reverse()\r\nx=mx=mn=0\r\nwhile n!=0:\r\n mx+=max(a)\r\n a[a.index(max(a))]=a[a.index(max(a))]-1\r\n if b[x] == 0: x += 1\r\n mn += b[x];b[x] -= 1\r\n n-=1\r\nprint(mx,mn)", "from math import inf\nn, m = map(int, input().split())\nlugares_qtd = list(map(int, input().split()))\n\ncopia1 = lugares_qtd.copy()\ncopia2 = lugares_qtd.copy()\n\nmin_value = 0\nmax_value = 0\n\nfor i in range(n):\n x = min(copia1)\n min_value += x\n index = copia1.index(x)\n copia1[index] -= 1\n if copia1[index] == 0:\n copia1[index] = inf\n\n\nfor i in range(n):\n x = max(copia2)\n max_value += x\n index = copia2.index(x)\n copia2[index] -= 1\n\nprint(max_value, min_value)\n \n\n\n", "# import sys\r\n# sys.setrecursionlimit(10**7)\r\n# def input(): return sys.stdin.readline()[:-1]\r\n\r\n#####################################################\r\n###### COMMENT FIRST THREE LINS FOR CODEFORCES ######\r\n#####################################################\r\n\r\nmod = 10**9 + 7\r\ndef readInt():return int(input())\r\ndef readIntList():return list(map(int,input().split()))\r\ndef readStringList():return list(input())\r\ndef readStringListWithSpace():return list(input().split())\r\ndef readString():return input()\r\nfrom heapq import heappop,heappush,heapify\r\n\r\ndef execute():\r\n n,m = readIntList()\r\n minHeap = readIntList()\r\n maxHeap = [-i for i in minHeap]\r\n heapify(maxHeap)\r\n heapify(minHeap)\r\n minCount,maxCount = 0,0\r\n for _ in range(n):\r\n _min = heappop(minHeap)\r\n _max = -heappop(maxHeap)\r\n minCount += _min\r\n maxCount += _max\r\n if _max-1 > 0:\r\n heappush(maxHeap,-(_max-1))\r\n if _min-1 > 0:\r\n heappush(minHeap,(_min-1))\r\n print(*[maxCount,minCount])\r\n\r\nif __name__ == \"__main__\":\r\n execute()", "# Problem Link:\r\n# Problem Status:\r\n# ----------------------- Separator -----------------------\r\ndef TheAmazingFunction(Arr: list, K: int):\r\n Arr.sort()\r\n ArrCopy = Arr.copy()\r\n KCopy = K\r\n Min = 0\r\n Max = 0\r\n while K > 0:\r\n K -= 1\r\n Min += Arr[0]\r\n Arr[0] -= 1\r\n if Arr[0] == 0:\r\n Arr.remove(Arr[0])\r\n Arr.sort()\r\n while KCopy > 0:\r\n KCopy -= 1\r\n Max += ArrCopy[-1]\r\n ArrCopy[-1] -= 1\r\n if ArrCopy[-1] == 0:\r\n ArrCopy.remove(ArrCopy[-1])\r\n ArrCopy.sort()\r\n return str(Max) + \" \" + str(Min)\r\n\r\n\r\n# ----------------------- Separator -----------------------\r\nN, M = list(map(int, input().split()))\r\nA = list(map(int, input().split()))\r\nprint(TheAmazingFunction(A, N))\r\n# ----------------------- Separator -----------------------\r\n", "# Wadea #\r\n\r\na,b = map(int ,input().split())\r\nc = a\r\ns = input().split()\r\nl = []\r\nl1 = []\r\nfor j in s:\r\n j = int(j)\r\n l.append(j)\r\nfor ll in s:\r\n ll = int(ll)\r\n l1.append(ll)\r\nl.sort()\r\nminimum = 0\r\nmaximum = 0\r\nr = 0\r\nq = 0\r\n\r\nfor k in range(1000000):\r\n if a > 0:\r\n if l[r] > 0:\r\n minimum += l[r]\r\n l[r] -= 1\r\n a -= 1\r\n else:\r\n r += 1\r\n else:\r\n break\r\n\r\nfor d in range(1000000):\r\n l1.sort()\r\n l1.reverse()\r\n if c > 0:\r\n if l1[q] > 0:\r\n maximum += l1[q]\r\n l1[q] -= 1\r\n c -= 1\r\n else:\r\n q -= 1\r\n else:\r\n break\r\nprint(maximum,minimum)", "a = input()\r\na = [int(i) for i in a.split()]\r\nnum_passengers = a[0]\r\nnum_planes = a[1]\r\n\r\nplanes = input()\r\nplanes = [int(i) for i in planes.split()]\r\n\r\nplanes.sort()\r\n\r\nremaining = num_passengers\r\nmax_cost = min_cost = 0 \r\nplanes_copy = planes.copy()\r\n\r\nwhile remaining > 0:\r\n\tfor i in range(num_planes-1, -1, -1): \r\n\t\tif remaining < 1:\r\n\t\t\tbreak \r\n\t\tif planes_copy[i] != planes_copy[i-1]:\r\n\t\t\tmax_cost += planes_copy[i]\r\n\t\t\tplanes_copy[i] -= 1\r\n\t\t\tremaining -= 1\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\tmax_cost += planes_copy[i]\r\n\t\t\tplanes_copy[i] -= 1\r\n\t\t\tremaining -= 1\r\n\r\nremaining = num_passengers\r\nplanes_copy = planes.copy()\r\n\r\nfor i in range(num_planes):\r\n\tfor j in range(planes[i]): \r\n\t\tif remaining < 1:\r\n\t\t\tbreak \r\n\t\tmin_cost += planes_copy[i]\r\n\t\tplanes_copy[i] -= 1\r\n\t\tremaining -= 1\r\n\t\t\t\r\nprint(max_cost, min_cost)", "n, m = list(map(int, input().split()))\na = list(map(int, input().split()))\na.sort()\n\nminc = 0\n\ndef reduce(i):\n\tglobal n, p\n\trv = 0\n\twhile i > 0 and p < n:\n\t\tp += 1\n\t\trv += i\n\t\ti -= 1\n\n\treturn rv\n\np = 0\nfor i in a:\n\tminc += reduce(i)\n\nmaxc = 0\np = 0\nt = a[::-1]\n\nwhile p < n:\n\ttm = max(t)\n\tmaxc += tm\n\tp += 1\n\tt[t.index(tm)] -= 1\n\nprint(maxc, minc)\n\n\n\n", "import sys\r\nfrom queue import PriorityQueue\r\n\r\ndef airport(passengers, seats):\r\n \r\n min_q = PriorityQueue()\r\n max_q = PriorityQueue()\r\n \r\n max_cost = 0\r\n min_cost = 0\r\n \r\n for s in seats:\r\n min_q.put(s)\r\n max_q.put(-1*s)\r\n \r\n for p in range(passengers):\r\n min_value = min_q.get()\r\n min_cost += min_value\r\n if min_value != 1:\r\n min_q.put(min_value - 1)\r\n \r\n for p in range(passengers):\r\n max_value = -1 * max_q.get()\r\n max_cost += max_value\r\n if max_value != 1:\r\n max_q.put((max_value - 1)*-1)\r\n \r\n return (max_cost, min_cost)\r\n \r\n \r\n \r\npassengers, plans = map(int, sys.stdin.readline().split())\r\nseats = list(map(int, sys.stdin.readline().split()))\r\nans = airport(passengers, seats)\r\nprint(ans[0], ans[1])", "n,m=map(int,input().split())\r\narr=[int(i) for i in input().split()]\r\nbrr=[int(i) for i in arr]\r\nn1=n\r\nn2=n\r\na,b=0,0\r\nwhile(n1!=0):\r\n a=a+max(arr)\r\n arr[arr.index(max(arr))]= max(arr)-1\r\n n1=n1-1\r\nwhile(n2!=0):\r\n b=b+min(brr)\r\n brr[brr.index(min(brr))]= min(brr)-1\r\n if brr[brr.index(min(brr))]==0:\r\n brr.remove(brr[brr.index(min(brr))])\r\n n2=n2-1\r\nprint(a,b)\r\n", "number_of_passengers, number_of_planes = map(int, input().split())\r\nseat = list(map(int, input().split()))\r\nseat_min = list()\r\nfor each_seat in seat:\r\n seat_min.append(each_seat)\r\n\r\ncounter = 0\r\nmaximum = 0\r\nwhile counter != number_of_passengers:\r\n for i in range(number_of_planes):\r\n if counter != number_of_passengers:\r\n maximum += max(seat)\r\n seat[seat.index(max(seat))] -= 1\r\n counter += 1\r\n else:\r\n break\r\n\r\nminimum = 0\r\ncounter_min = 0\r\nwhile counter_min != number_of_passengers:\r\n for i in range(number_of_planes):\r\n if counter_min != number_of_passengers:\r\n if 0 in seat_min:\r\n seat_min.remove(0)\r\n continue\r\n if min(seat_min) != 0:\r\n minimum += min(seat_min)\r\n seat_min[seat_min.index(min(seat_min))] -= 1\r\n counter_min += 1\r\n\r\nprint(maximum, minimum)\r\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nmin_profit = 0\r\nmax_profit = 0\r\n\r\n\r\nfree_places = a.copy()\r\nfor _ in range(n):\r\n mins = 1001\r\n for i in free_places:\r\n if i < mins and i != 0:\r\n mins = i\r\n min_id = free_places.index(mins)\r\n min_profit += mins\r\n free_places[min_id] -= 1\r\n\r\n\r\nfree_places = a.copy()\r\nfor _ in range(n):\r\n maxs = max(free_places)\r\n max_id = free_places.index(maxs)\r\n max_profit += maxs\r\n free_places[max_id] -= 1\r\n\r\nprint(max_profit, min_profit)", "n,m = map(int, input().split())\r\n\r\na = list(map(int, input().split()))\r\na.sort()\r\nb = [x for x in a]\r\nmaxy = 0\r\nmini = 0\r\nfor i in range(n):\r\n x = max(a)\r\n maxy += x\r\n a[a.index(x)]-=1\r\n\r\nfor i in range(n):\r\n x = min(b)\r\n mini += x\r\n b[b.index(x)]-=1\r\n if 0 in b:\r\n del b[b.index(0)]\r\nprint(maxy,mini)\r\n \r\n ", "t,m=map(int,input().split(\" \"))\r\na=list(map(int,input().split(\" \")))\r\nb=sorted(a)\r\nc=0\r\ne=0\r\nminsum=0\r\nmaxsum=0\r\nwhile c!=t:\r\n d=max(a)\r\n maxsum+=d\r\n c+=1\r\n a[a.index(d)]-=1\r\nwhile e!=t:\r\n f=min(b)\r\n minsum+=f\r\n e+=1 \r\n b[b.index(f)]-=1\r\n f-=1\r\n if b[b.index(f)]==0:\r\n b.remove(b[b.index(f)])\r\nprint(f'{maxsum} {minsum}')", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=[]\r\nx=y=0\r\nb.extend(a)\r\nfor i in range(n):\r\n ma=max(a)\r\n x=x+ma\r\n for j in range(m):\r\n if ma==a[j]:\r\n a[j]-=1\r\n break\r\n c=min(b)\r\n y= y+c\r\n for k in range(m):\r\n if c==b[k]:\r\n b[k]-=1\r\n if b[k]==0:\r\n b[k]=1002\r\n break\r\nprint(x,y)\r\n", "n,m = map(int,input().split())\ns = list(map(int,input().split()))\na = s.copy()\nminCost = 0\nmaxCost = 0\n\nfor i in range(n):\n minCost += min(s)\n indexMin = s.index(int(min(s)))\n s[indexMin] -= 1\n if s[indexMin] == 0:\n s[indexMin] = 1001\n\nfor i in range(n):\n maxCost += max(a)\n indexMax = a.index(int(max(a)))\n a[indexMax] -= 1\nprint(maxCost,minCost)", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nimport copy\r\na.sort()\r\np=copy.deepcopy(a)\r\na.reverse()\r\nl=copy.deepcopy(a)\r\no=[]\r\nfor i in l :\r\n for j in range(1,i+1):\r\n o.append(j)\r\no.sort()\r\no.reverse()\r\nmax=0\r\nfor i in o[0:n] :\r\n max+=i\r\n\r\ni=0\r\nmin=0\r\nj=0\r\nwhile j < n :\r\n min+=p[i]\r\n p[i]-=1\r\n if p[i]==0:\r\n i=(i+1)%m\r\n j+=1\r\nprint(max,min)\r\n", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\na=list(l)\r\n\r\nmc,mic=0,0\r\nfor i in range(n):\r\n a.sort(reverse=True)\r\n mc+=a[0]\r\n if a[0]==1:\r\n a.pop(0)\r\n else:\r\n a[0]-=1\r\n \r\nfor i in range(n):\r\n l.sort()\r\n mic+=l[0]\r\n if l[0]==1:\r\n l.pop(0)\r\n else:\r\n l[0]-=1\r\n \r\n\r\nprint(mc,mic)", "n, m = map(int, input().split())\r\n\r\na = [int(x) for x in input().split()]\r\n\r\nans_mx = 0\r\nans_mn = 0\r\n\r\nb = a.copy()\r\nc = a.copy()\t\r\ni = 0\r\nwhile(i<n):\r\n\tx = max(b)\r\n\tfor j in range(m):\r\n\t\tif b[j] == x:\r\n\t\t\tans_mx += b[j]\r\n\t\t\tb[j] -= 1\r\n\t\t\tbreak\r\n\t\r\n#\tprint(c)\r\n\ty = min(c)\r\n\tans_mn += y\r\n\tk = 0\r\n\twhile(k<len(c)):\r\n\t\tif c[k] == y:\r\n\t\t\tc[k] -= 1\r\n\t\t\tif c[k] == 0:\r\n\t\t\t\tc.pop(k)\r\n\t\t\tbreak\t\r\n\t\tk += 1\r\n\t\t\r\n\ti += 1\r\nprint(ans_mx, int(ans_mn), sep = \" \")", "num_passenger, num_plane = [int(i) for i in input().split(' ')]\nempty_seats_orig = [int(i) for i in input().split(' ')]\nprice_max = price_min = 0\nempty_seats = empty_seats_orig.copy()\nfor passenger in range(num_passenger):\n\tmax_ = max(empty_seats)\n\tprice_max += max_\n\tmax_idx = empty_seats.index(max_)\n\tempty_seats[max_idx] = empty_seats[max_idx] - 1\n \nempty_seats = empty_seats_orig.copy()\nfor passenger in range(num_passenger):\n\tmin_ = min(empty_seats)\n\tprice_min += min_\n\tmin_idx = empty_seats.index(min_)\n\tempty_seats[min_idx] = empty_seats[min_idx] - 1\n\tempty_seats = [i for i in empty_seats if i > 0] \n\nprint(price_max, price_min)\n\n\n\t\t \t\t \t \t \t \t\t \t \t \t", "n,m=map(int, input().split())\r\narr = list(map(int, input().split()))\r\n#arr.sort()\r\nmxres=0\r\nss=arr[:]\r\nfor i in range(n):\r\n mx = max(ss)\r\n ind = ss.index(mx)\r\n ss[ind]-=1\r\n mxres += mx\r\n\r\nmnres = 0\r\n#print(arr)\r\nfor i in range(n):\r\n mn = min(arr)\r\n ind = arr.index(mn)\r\n arr[ind]-=1\r\n # print(mn,ind,arr[ind])\r\n\r\n if arr[ind]<=0:\r\n arr[ind] = 1002\r\n mnres+=mn\r\nprint(mxres,mnres)\r\n ", "n, m = map(int, input().split())\r\nlst = list(map(int, input().split()))\r\nlst2 = lst.copy()\r\n# max\r\ncntmax = 0\r\n# min\r\ncntmin = 0\r\nj = 0\r\nwhile j < n:\r\n maxx = max(lst)\r\n cntmax += maxx\r\n idx = lst.index(maxx)\r\n lst[idx] -= 1\r\n j += 1\r\n\r\nj = 0\r\nwhile j < n:\r\n minn = min(lst2)\r\n cntmin += minn\r\n idx = lst2.index(minn)\r\n lst2[idx] -= 1\r\n if lst2[idx] == 0:\r\n lst2.pop(idx)\r\n j +=1\r\n\r\nprint(cntmax, cntmin)\r\n", "import heapq\nn,m = map(int,input().split())\na = map(int,input().split())\n\nminh = []\nmaxh = []\n\nfor i in a:\n heapq.heappush(minh,i)\n heapq.heappush(maxh,-i)\n\nmincost = 0\nmaxcost = 0\n\nl=0\nwhile len(minh)>0 and l<n:\n pr = heapq.heappop(minh)\n mincost +=pr\n if pr-1>0:\n heapq.heappush(minh,pr-1)\n l+=1\n\nl=0\nwhile len(maxh)>0 and l<n:\n pr = -heapq.heappop(maxh)\n maxcost +=pr\n if pr-1>0:\n heapq.heappush(maxh,-(pr-1))\n l+=1\n\nprint(maxcost,end=\" \")\nprint(mincost)", "n,m=tuple(map(int,input().split()))\r\nl=list(map(int,input().split()))\r\nl1=l.copy()\r\ndef maxProfit(l,n):\r\n profit=0\r\n for i in range(n):\r\n profit+=max(l)\r\n l[l.index(max(l))]-=1\r\n return profit\r\n\r\ndef minProfit(l,n):\r\n profit=0\r\n for i in range(n):\r\n profit+=min(l)\r\n if l[l.index(min(l))]==1:\r\n l.remove(l[l.index(min(l))])\r\n else:\r\n l[l.index(min(l))]-=1\r\n return profit\r\n\r\nprint(maxProfit(l,n),minProfit(l1,n))\r\n", "def min_zero(a):\n m = 1001\n for i in a:\n if i < m and i>0:\n m = i\n return m\nn,m = [int(i) for i in input().split()]\nm_i,m_a= 0,0\nm1,m2 =0,0\np = input().split()\np1 = [int(i) for i in p]\np2 = [int(i) for i in p]\nfor _ in range(n):\n m1 = max(p1)\n m_a += m1\n p1[p1.index(m1)]= p1[p1.index(m1)] - 1\nfor _ in range(n):\n m2 = min_zero(p2)\n m_i += m2\n p2[p2.index(m2)] =p2[p2.index(m2)] - 1\nprint(f\"{m_a} {m_i}\")\n# print(p1)\n", "n,m=map(int,input().split())\r\n\r\na=list(map(int,input().split()))\r\na.sort()\r\nk=-1\r\nb=[e for e in a]\r\nl=0\r\nmini,maxi=0,0\r\nfor i in range(n):\r\n maxi+=b[k]\r\n b[k]-=1\r\n mini+=a[l]\r\n a[l]-=1\r\n if a[l]==0:\r\n l+=1\r\n \r\n a.sort()\r\n b.sort()\r\nprint(maxi,mini)\r\n \r\n ", "a,b=map(int, input().split())\r\nl=list(map(int, input().split()))\r\nl1=l.copy()\r\nmaxi=0\r\nmini=0\r\n\r\nfor i in range(a):\r\n e=max(l1)\r\n maxi+=e\r\n l1[l1.index(e)]-=1\r\n\r\nfor i in range(a):\r\n e=min(l)\r\n mini+=e\r\n ind=l.index(e)\r\n l[ind]-=1\r\n if l[ind]==0:\r\n l.pop(ind)\r\n\r\nprint(maxi, mini)", "n, m = map(int, input().split())\r\narr = sorted(map(int, input().split()))\r\ns = []\r\nfor i in range(m):\r\n for j in range(arr[i], 0, -1):\r\n s.append(j)\r\ns2 = sorted(s, reverse=True)\r\nprint(sum(s2[:n]), sum(s[:n]))\r\n", "import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools\r\nimport random\r\n\r\nsys.setrecursionlimit(10**7)\r\ninf = 10**20\r\neps = 1.0 / 10**10\r\nmod = 10**9+7\r\ndd = [(-1,0),(0,1),(1,0),(0,-1)]\r\nddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]\r\n\r\ndef LI(): return list(map(int, sys.stdin.readline().split()))\r\ndef LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]\r\ndef LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]\r\ndef LF(): return [float(x) for x in sys.stdin.readline().split()]\r\ndef LS(): return sys.stdin.readline().split()\r\ndef I(): return int(sys.stdin.readline())\r\ndef F(): return float(sys.stdin.readline())\r\ndef S(): return input()\r\ndef pf(s): return print(s, flush=True)\r\ndef pe(s): return print(str(s), file=sys.stderr)\r\n\r\nn,m = LI()\r\na = LI()\r\nb= a.copy()\r\nmaxsum = 0\r\nminsum = 0\r\nfor i in range(0,n):\r\n maxsum += max(a)\r\n a[a.index(max(a))] -= 1\r\nfor i in range(0,n):\r\n if(min(b) == 0):\r\n del b[b.index(min(b))]\r\n minsum += min(b)\r\n b[b.index(min(b))] -= 1\r\nprint(maxsum, minsum)", "import collections\r\nfrom math import log2, log10, ceil\r\n\r\ndef pow2(n):\r\n t = 0\r\n while not(n&1):\r\n n = n//2\r\n t += 1\r\n return t\r\n\r\ndef solve():\r\n n, m = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n\r\n asc = sorted(a)\r\n desc = sorted(a, reverse=True)\r\n\r\n max = 0\r\n min = 0\r\n #asc, min zlotys\r\n cmin = 0\r\n cmax = 0\r\n for i in range(0, m):\r\n seats = asc[i]\r\n while cmin<n and seats>0:\r\n min += seats #number of seats = cost of ticket\r\n seats -= 1\r\n cmin += 1\r\n \r\n while(desc[0]!=0 and cmax<n):\r\n seats = desc[0]\r\n max += seats #number of seats = cost of ticket\r\n desc[0] -= 1\r\n cmax += 1\r\n desc.sort(reverse=True)\r\n \r\n print(max, min)\r\n\r\ndef main():\r\n t = 1\r\n while t:\r\n t -= 1\r\n solve()\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "a,b=map(int,input().split())\r\nl=[int(i) for i in input().split()]\r\nm=l[::]\r\ndef maxa(l,c):\r\n l.sort(reverse=True)\r\n c+=l[0]\r\n l[0]-=1\r\n return c\r\ndef mina(l,d):\r\n l.sort()\r\n d+=l[0]\r\n l[0]-=1\r\n if(l[0]==0):\r\n del l[0]\r\n return d\r\nc,d=0,0\r\nfor i in range(a):\r\n c=maxa(l,c)\r\nprint(c,end=\" \")\r\nfor i in range(a):\r\n d=mina(m,d)\r\nprint(d)\r\n\r\n", "import heapq\r\n# from typing import Counter \r\n# for _ in range(1,int(input())+1):\r\n # n=int(input())\r\nn,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=a.copy()\r\nmx=[]\r\nheapq.heapify(a)\r\nheapq.heapify(mx)\r\nfor i in b:\r\n heapq.heappush(mx,-i)\r\n# for max calc\r\nmx_cal=0\r\nfor i in range(n):\r\n val=heapq.heappop(mx)\r\n mx_cal-=val\r\n if (val+1)!=0:\r\n heapq.heappush(mx,val+1)\r\n# for min cal\r\nmn_cal=0\r\n# print(a)\r\nfor i in range(n):\r\n p=heapq.heappop(a)\r\n mn_cal+=p\r\n if p>1:\r\n heapq.heappush(a,p-1)\r\n # print(a)\r\nprint(mx_cal,mn_cal)", "def minimum(arr):\r\n min_ = float('inf')\r\n\r\n for i in arr:\r\n if i > 0:\r\n min_ = min(min_, i)\r\n return min_\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 g = list(a)\r\n k = n + 0\r\n max_ = min_ = 0\r\n\r\n while n > 0:\r\n j = max(a)\r\n idx = a.index(j)\r\n max_ += j\r\n a[idx] -= 1\r\n n -= 1\r\n\r\n while k > 0:\r\n j = minimum(g)\r\n idx = g.index(j)\r\n min_ += j\r\n g[idx] -= 1\r\n k -= 1\r\n\r\n print(max_, min_)\r\n\r\n\r\nsolve()\r\n\r\n\r\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\n\r\na.sort()\r\nk=n\r\ncost=0\r\nmin=float('inf')\r\n\r\nl=a\r\n\r\nfor x in l:\r\n while x>0:\r\n if k==0:\r\n break\r\n cost+=x\r\n x-=1\r\n k-=1\r\n if k==0:\r\n break\r\n\r\n\r\ncost_max=0\r\nwhile n>0:\r\n a=sorted(a,reverse=True)\r\n cost_max+=a[0]\r\n a[0]-=1\r\n n-=1\r\n\r\nprint(cost_max,cost)\r\n\r\n \r\n\r\n\r\n\r\n", "n,m=map(int,input().split())\r\nc=list(map(int,input().split()))\r\ninc=sorted(c)\r\nw=[]\r\nfor i in range(len(inc)):\r\n for j in range(inc[i],0,-1):\r\n w.append(j)\r\nw1=sorted(w)[::-1]\r\nprint(sum(w1[:n]), sum(w[:n]))", "n,m=map(int,input().split())\na=list(map(int, input().split()))\nb=[j for j in a]\nmaxi=0\nmini=0\nfor i in range(n):\n a.sort(reverse=True)\n b.sort()\n if a[-1]==0:\n a=a[:-1]\n if b[0]==0:\n b=b[1:]\n maxi+=a[0]\n a[0]-=1 \n mini+=b[0]\n b[0]-=1 \nprint(maxi,mini)\n ", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nmaximum=0\r\nminimum=0\r\nl1=list(l)\r\nfor i in range(n):\r\n maximum=maximum+max(l)\r\n l[l.index(max(l))]=l[l.index(max(l))]-1\r\nfor i in range(n):\r\n minimum=minimum+min(l1)\r\n l1[l1.index(min(l1))]=l1[l1.index(min(l1))]-1\r\n if(0 in l1):\r\n l1.remove(0)\r\n \r\nprint(maximum,minimum) ", "from re import split\r\nx = split(\" \" , input())\r\nn = int(x[0])\r\nm = int(x[1])\r\na = split(\" \" , input())\r\nfor i in range(m):\r\n a[i] = int(a[i])\r\n# a.sort(reverse=True)\r\n# Max = 0\r\n# num = 1\r\n# i = 0\r\n# while i != m-1:\r\n# if a[i] == a[i+1]:\r\n# num += 1\r\n# i += 1\r\n# else:\r\n# break\r\n# temp = n\r\n# while temp:\r\n# for k in range(num):\r\n# Max += a[k]\r\n# a[k] -= 1\r\n# temp -= 1\r\n# print(f\"{Max} {temp}\")\r\n# if (k != m-1 and a[k] <= a[k+1]) or temp == 0:\r\n# while k != m-1:\r\n# if a[k] == a[k+1]:\r\n# k += 1\r\n# num += 1\r\n# else:\r\n# break\r\n# break\r\n# print(Max)\r\nList = []\r\nfor i in a:\r\n List.extend(range(1,i+1))\r\nList.sort(reverse=True)\r\nMax = 0\r\nfor i in range(n):\r\n Max += List[i]\r\nprint(Max , end = \" \")\r\na.sort()\r\nMin = 0\r\nfor i in a:\r\n if i < n:\r\n n -= i\r\n Min += i * (i+1) // 2\r\n else:\r\n Min += n * (2 * i - n + 1) // 2\r\n break\r\nprint(Min)", "n, m = map(int, input().split())\r\nlst = list(map(int, input().split()))\r\n\r\nmaxi = 0\r\nmini = 0\r\n\r\nt = lst.copy()\r\n\r\nfor i in range(n):\r\n lst.sort(reverse = True)\r\n\r\n while lst[-1] == 0:\r\n lst.pop()\r\n\r\n mini += lst[-1]\r\n lst[-1] -= 1\r\n\r\nlst = t\r\n\r\nfor j in range(n):\r\n lst.sort(reverse = True)\r\n\r\n while lst[-1] == 0:\r\n lst.pop()\r\n\r\n maxi += lst[0]\r\n lst[0] -= 1\r\n\r\nprint(maxi, mini)", "m, n = input().split()\r\nm = int(m)\r\nn = int(n)\r\n\r\nlst = input()\r\nlst = list(map(int, lst.split()))\r\nlst2 = lst[:]\r\n\r\nmini = 0\r\nmaxi = 0\r\n\r\nfor i in range(m):\r\n mi = min([x for x in lst if x != 0])\r\n ma = lst2.index(max(lst2))\r\n mini += mi\r\n maxi += lst2[ma]\r\n lst[lst.index(mi)] -= 1\r\n lst2[ma] -= 1\r\nprint(maxi, mini)", "def max_tic(l,n):\r\n r=l[:]\r\n r.sort()\r\n max_count=0\r\n for i in range(n):\r\n if r!=[]:\r\n max_count+=r[len(r)-1] \r\n r[len(r)-1]-=1\r\n r.sort()\r\n return max_count\r\ndef min_tic(l,n):\r\n r=l[:]\r\n r.sort(reverse=True)\r\n min_count=0\r\n while 0 in r:\r\n r.remove(0)\r\n for i in range(n):\r\n #print(r)\r\n if r!=[]:\r\n min_count+=r[len(r)-1]\r\n r[len(r)-1]-=1\r\n while 0 in r:\r\n r.remove(0)\r\n if r!=[]:\r\n r.sort(reverse=True)\r\n return min_count\r\n \r\n\r\n\r\nn,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nprint(max_tic(l,n),min_tic(l,n))", "import collections\nimport os\nimport sys\n\n\nif os.environ.get('NOT_JUDGE'):\n sys.stdin = open('input.txt', 'r')\n sys.stdout = open('output.txt', 'w')\n\n\ndef solve():\n passenger_count, planes_count = list(map(int, input().split()))\n seat_counts = list(map(int, input().split()))\n seat_counts.sort()\n ans = []\n for seat_left in seat_counts:\n for j in range(seat_left, 0, -1):\n ans.append(j)\n max_ans = sorted(ans)[::-1]\n print(sum(max_ans[:passenger_count]), sum(ans[:passenger_count]))\n\n\ndef main():\n solve()\n \n\n\n\nif __name__ == \"__main__\":\n main()", "def solve():\r\n n,k=list(map(int,input().split()))\r\n lst=list(map(int,input().split()))\r\n lst.sort();\r\n mi=0\r\n\r\n\r\n def sum(n):\r\n return n*(n+1)//2\r\n\r\n l2=lst[::]\r\n m=n;\r\n i=0\r\n\r\n while(m>0):\r\n mi+=min(l2)\r\n if min(l2)==1:\r\n l2.remove(1)\r\n else:\r\n l2[l2.index(min(l2))]-=1\r\n m-=1\r\n \r\n ma=0\r\n while(n>0):\r\n ma+=max(lst)\r\n if max(lst)==1:\r\n lst.remove(1)\r\n else:\r\n lst[lst.index(max(lst))]-=1\r\n n-=1\r\n\r\n print(ma,mi)\r\n \r\n \r\n\r\n# for _ in range(int(input())):\r\nsolve()", "n, m = map(int, input().split())\nseats = list(map(int, input().split()))\n\n#n = 4\n#m = 3\n#seats = [2, 2, 2]\nseats_max = seats.copy()\nseats_min = seats.copy()\nmax_val = 0\nmin_val = 0\nfor i in range(n):\n seats_max = [s for s in seats_max if s > 0]\n #max amount\n max_val += max(seats_max)\n #update list\n max_i = seats_max.index(max(seats_max))\n seats_max[max_i] = seats_max[max_i] - 1\n \n \nfor i in range(n): \n seats_min = [s for s in seats_min if s > 0]\n #min amount\n min_val += min([s for s in seats_min if s > 0])\n #update list\n min_i = seats_min.index(min(seats_min))\n seats_min[min_i] = seats_min[min_i] - 1\n \nprint(max_val, min_val)\n \t \t\t\t \t\t \t \t\t\t", "n, m = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\na.sort()\r\nv = []\r\nfor x in a:\r\n for b in range(x, 0, -1):\r\n v.append(b)\r\nsmall = sum(v[:n])\r\nv.sort()\r\nv.reverse()\r\nlarge = sum(v[:n])\r\nprint(large, small)", "n,m=map(int,input().split())\r\np=list(map(int,input().split()))\r\nc=p.copy()\r\nma=0\r\nmi=0\r\nfor i in range(n):\r\n p.sort()\r\n p.reverse()\r\n ma+=p[0]\r\n p[0]-=1\r\nfor j in range(n):\r\n c.sort()\r\n if c[0]==0:\r\n c.pop(0)\r\n mi+=c[0]\r\n c[0]-=1\r\nprint(ma,mi) ", "n,m=map(int,input().split())\r\narr=list(map(int,input().split()))\r\narr2=arr.copy()\r\nmax1=0\r\nmin1=0\r\ncount=0\r\nwhile count<n:\r\n max1=max1+max(arr)\r\n arr[arr.index(max(arr))]-=1\r\n count=count+1\r\nprint(max1) \r\n#print(arr2)\r\ncount=0 \r\nwhile count<n:\r\n if min(arr2)==0:\r\n arr2.remove(0)\r\n count=count-1\r\n else:\r\n min1=min1+min(arr2)\r\n #print(min(arr2))\r\n\r\n arr2[arr2.index(min(arr2))]-=1\r\n count=count+1 \r\nprint(min1) ", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\np=l+[]\r\nc=0\r\nmaxx=0\r\nminn=0\r\nwhile(c<n):\r\n c+=1\r\n x=max(l)\r\n maxx+=x\r\n x=l.index(x)\r\n l[x]-=1\r\n y=min(p)\r\n while(y<1):\r\n y=p.index(y)\r\n p.remove(p[y])\r\n y=min(p)\r\n minn+=y\r\n y=p.index(y)\r\n p[y]-=1\r\nprint(maxx,minn)\r\n ", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\np=list(map(int,l))\r\nmi=ma=0\r\nfor i in range(n):\r\n k=max(l)\r\n ma+=k\r\n l[l.index(k)]-=1\r\nfor i in range(n):\r\n k=min(p)\r\n if(k==0):\r\n p.remove(0)\r\n k=min(p)\r\n mi+=k\r\n p[p.index(k)]-=1\r\nprint (ma,mi)\r\n", "#from collections import Counter\r\nimport heapq\r\n#n = int(input())\r\nn,m = map(int,input().split())\r\nl = list(map(int,input().split()))\r\n#k = int(input())\r\nt = [-i for i in l]\r\nmin1 = 0\r\nmax1 = 0\r\nheapq.heapify(l)\r\nheapq.heapify(t)\r\nfor i in range(n):\r\n x = heapq.heappop(l)\r\n y = heapq.heappop(t)\r\n min1 += x\r\n max1 += abs(y)\r\n if x != 1:\r\n heapq.heappush(l,x-1)\r\n if y != -1:\r\n heapq.heappush(t,y+1)\r\n\r\nprint(max1,min1)\r\n", "(n,m) = map(int, input().split())\r\nseats = list(map(int, input().split()))\r\n\r\nseats.sort(reverse=True)\r\nmax_count = 0\r\nmin_count = 0\r\n\r\nseats_max = seats[::1]\r\nseats_min = seats[::1]\r\n\r\nfor i in range(n):\r\n if len(seats_max) >= 2 and seats_max[0] < seats_max[1]:\r\n seats_max.sort(reverse=True)\r\n\r\n max_count += seats_max[0]\r\n seats_max[0] -= 1\r\n\r\nfor i in range(n):\r\n min_count += seats_min[-1]\r\n seats_min[-1] -= 1\r\n\r\n if seats_min[-1] <= 0:\r\n seats_min.pop()\r\n\r\nprint(max_count, min_count)", "def main():\n take = input().split()\n num_passengers = int(take[0])\n planes = int(take[1])\n tickets = input().split()\n for i in range(len(tickets)):\n tickets[i] = int(tickets[i])\n tickets.sort()\n maximum = []\n for i in range(len(tickets)):\n for j in range(1, tickets[i] + 1):\n maximum.append(j)\n maximum.sort()\n total = 0\n curr_idx = len(maximum) - 1\n while num_passengers != 0:\n total += maximum[curr_idx]\n curr_idx -= 1\n num_passengers -= 1\n curr_idx = 0\n other_total = 0\n num_passengers = 1\n while num_passengers != int(take[0]) + 1:\n if tickets[curr_idx] == 0:\n curr_idx += 1\n other_total += tickets[curr_idx]\n tickets[curr_idx] -= 1\n num_passengers += 1\n print(total, other_total)\nmain()\n", "i = lambda: map(int,input().split())\r\npasseng,planes = i()\r\nlst = list(i())\r\nlstma = list(lst)\r\nlstmi = list(lst)\r\nmaxcst = 0;mincst=0\r\nfor _ in range(passeng):\r\n ma = max(lstma)\r\n mi = min(lstmi)\r\n if mi == 0:\r\n lstmi.remove(0)\r\n mi = min(lstmi)\r\n if ma == 0:\r\n lstma.remove(0)\r\n ma = max(lstma)\r\n lstma[lstma.index(ma)] = ma -1\r\n lstmi[lstmi.index(mi)] = mi -1\r\n maxcst += ma\r\n mincst += mi\r\nprint(f\"{maxcst} {mincst}\")\r\n", "n,m=map(int,input().split())\r\na= list(map(int, input().split()))\r\nmax_p,min_p=list(a),list(a)\r\nans_max,ans_min=0,0\r\nfor i in range(n):\r\n ans_max+=max(max_p)\r\n max_p[max_p.index(max(max_p))]-=1\r\n ans_min+=min(min_p)\r\n min_p[min_p.index(min(min_p))]-=1\r\n if 0 in min_p:del[min_p[min_p.index(0)]]\r\nprint(ans_max,ans_min)\r\n", "from queue import PriorityQueue\r\n\r\nmin = PriorityQueue()\r\nmax = PriorityQueue()\r\nN, P = map(int, input().split())\r\nS = [int(s) for s in input().split()][0:P]\r\nfor i in range(P):\r\n max.put(-1 * S[i])\r\n min.put(S[i])\r\n\r\nans = 0\r\nfor i in range(N):\r\n f = -1 * max.get()\r\n ans += f\r\n if f != 1:\r\n max.put(-1 * (f - 1))\r\n\r\nans1 = 0\r\nfor i in range(N):\r\n f = min.get()\r\n ans1 += f\r\n if f != 1:\r\n min.put(f - 1)\r\nprint(str(ans) + \" \" + str(ans1))", "def sum2n(seats):\r\n sum=0\r\n for n in seats:\r\n sum+=n*(n+1)/2\r\n return str(int(sum))\r\n\r\ndef maxi(seats,n,m):\r\n sum=0\r\n while(n):\r\n tmp=max(seats)\r\n sum+=tmp\r\n for i in range(m):\r\n if(seats[i]==tmp):\r\n seats[i]-=1\r\n break\r\n n-=1\r\n return int(sum)\r\n \r\ndef mini(seats,n,m):\r\n sum=0\r\n # print(seats)\r\n while(n):\r\n if(min(seats)==0):\r\n seats.remove(0)\r\n tmp=min(seats)\r\n # print(tmp,seats)\r\n sum+=tmp\r\n for i in range(m):\r\n if(seats[i]==tmp):\r\n seats[i]-=1\r\n break\r\n n-=1\r\n return int(sum)\r\n \r\nn,m=map(int,input().split()) # n->ppl; m->planes\r\nseats=list(map(int,input().split()))\r\nif (sum(seats)==n):\r\n ans=sum2n(seats)\r\n print(ans,ans)\r\nelse:\r\n seats2=seats.copy()\r\n print(maxi(seats,n,m),mini(seats2,n,m))", "n,m = map(int,input().split(\" \"))\r\na = list(map(int, input().split(\" \")))\r\na.sort()\r\ninc = a.copy()\r\ninc.reverse()\r\ndec = inc.copy()\r\ninc.reverse()\r\nmaxm, minm, i, j, l = 0,0,0,0,0\r\nwhile i != n:\r\n inc.sort()\r\n if inc[l]==0:\r\n l += 1\r\n minm += inc[l]\r\n inc[l] -= 1\r\n i += 1\r\nl = 0\r\nwhile j != n:\r\n dec.sort()\r\n dec.reverse()\r\n if dec[l]==0:\r\n l += 1\r\n maxm += dec[l]\r\n dec[l] -= 1\r\n j += 1\r\nprint(maxm,minm)", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = a.copy()\r\nmax_cost, min_cost = 0, 0\r\nfor i in range(n):\r\n a.sort()\r\n b.sort(reverse=True)\r\n max_cost += a[-1]\r\n a[-1] -= 1\r\n min_cost += b[-1]\r\n b[-1] -= 1\r\n if len(b) > 0 and b[-1] == 0:\r\n del b[-1]\r\n\r\nprint(max_cost, min_cost)\r\n", "passenger,planes = map(int,input().split(\" \"))\r\nlst = list(map(int,input().split(\" \")))\r\nmin_lst = lst.copy()\r\nmax_lst = lst.copy()\r\nmax_out =0\r\nmin_out = 0\r\nmin_lst = sorted(min_lst)\r\nmax_lst= sorted(max_lst)\r\nn = passenger\r\nfor ele in min_lst:\r\n x = ele \r\n while x and n:\r\n min_out += x \r\n x -= 1 \r\n n -=1 \r\nfor i in range(passenger):\r\n max_lst.sort(reverse= True)\r\n max_out += max_lst[0]\r\n max_lst[0]-= 1\r\nprint(max_out,min_out)", "n, m = map(int, input().split())\na = [int(i) for i in input().split()]\n\nansmn = 0\nb = list(a)\nfor i in range(n):\n mn = min(b)\n ansmn += mn\n mni = b.index(mn)\n b[mni] -= 1\n if b[mni] == 0:\n b[mni] = 1e9\n\nansmx = 0\nb = list(a)\nfor i in range(n):\n mx = max(b)\n ansmx += mx\n mxi = b.index(mx)\n b[mxi] -= 1\n #print(i, \"=\", mx, \"@\", mxi)\n\nprint(ansmx, ansmn)\n", "n,m=map(int,input().split())\r\narr=[int(x) for x in input().split()]\r\nmn=arr.copy()\r\nmx=arr.copy()\r\nmn.sort()\r\nmx.sort()\r\nLeastcost=0\r\nMostcost=0\r\nn1=n\r\ni=0\r\nwhile(n>0):\r\n Leastcost+=mn[i]\r\n mn[i]-=1\r\n if mn[i]==0:\r\n i+=1\r\n n-=1\r\nwhile(n1>0):\r\n Mostcost+=mx[-1]\r\n mx[-1]-=1\r\n mx.sort()\r\n n1-=1\r\nprint(Mostcost,Leastcost)", "n,a=list(map(int,input().split()))\r\np=list(map(int,input().split()))\r\nk=list(p)\r\nma=0\r\nmi=0\r\nfor i in range(0,n):\r\n ma=ma+max(p)\r\n j=p.index(max(p))\r\n p[j]=p[j]-1\r\nc=0\r\nwhile(True):\r\n if min(k)!=0:\r\n mi=mi+min(k)\r\n j=k.index(min(k))\r\n k[j]=k[j]-1\r\n c=c+1\r\n else:\r\n k.remove(0)\r\n if c==n:\r\n break\r\nprint(ma,mi) \r\n", "minP,maxP=0,0\r\nn,m = [int(i) for i in input().split()]\r\nprices = [int(i) for i in input().split()]\r\n\r\npl = sorted(prices)\r\nfor i in range(n):\r\n pl = sorted(pl)\r\n if pl[0]==0:\r\n pl.remove(pl[0])\r\n minP+=pl[0]\r\n pl[0]-=1\r\n\r\npl = sorted(prices,reverse= True)\r\nfor i in range(n):\r\n pl = sorted(pl,reverse= True)\r\n maxP+=pl[0]\r\n pl[0]-=1\r\nprint(maxP,minP)", "n,m=map(int,input().split())\r\nnum=list(map(int,input().split()))\r\nnum.sort(reverse=True)\r\nback=num[::-1]\r\nsum=0\r\nfor i in range(n):\r\n\tsum+=max(num)\r\n\tc=num.index(max(num))\r\n\tnum[c]-=1\r\n\t#print(sum)\r\nmsum,c=0,0\r\nfor i in range(len(back)):\r\n\twhile(back[i]!=0):\r\n\t\tif c==n:\r\n\t\t\tbreak\r\n\t\tmsum+=back[i]\r\n\t\tback[i]-=1\r\n\t\tc+=1\r\nprint(sum,msum)", "import heapq\r\n\r\n#sys.stdin=file('input.txt')\r\n#sys.stdout=file('output.txt','w')\r\n#10**9+7\r\nmod=1000000007\r\n#mod=1777777777\r\npi=3.141592653589\r\nIS=float('inf')\r\nxy=[(1,0),(-1,0),(0,1),(0,-1)]\r\nbs=[(-1,-1),(-1,1),(1,1),(1,-1)]\r\ndef niten(a,b): return abs(a-b) if a>=0 and b>=0 else a+abs(b) if a>=0 else abs(a)+b if b>=0 else abs(abs(a)-abs(b))\r\ndef fib(n): return [(seq.append(seq[i-2] + seq[i-1]), seq[i-2])[1] for seq in [[0, 1]] for i in range(2, n)]\r\ndef gcd(a,b): return a if b==0 else gcd(b,a%b)\r\ndef lcm(a,b): return a*b/gcd(a,b)\r\ndef eucl(x1,y1,x2,y2): return ((x1-x2)**2+(y1-y2)**2)**0.5\r\ndef choco(xa,ya,xb,yb,xc,yc,xd,yd): return 1 if abs((yb-ya)*(yd-yc)+(xb-xa)*(xd-xc))<1.e-10 else 0\r\ndef pscl(num,l=[1]):\r\n for i in range(num):\r\n l = map(lambda x,y:x+y,[0]+l,l+[0])\r\n return l\r\n\r\n#n=int(input())\r\ndef syo(tmp,x):\r\n s=0\r\n while tmp:\r\n tmp-=1\r\n t=heapq.heappop(x)\r\n s+=t\r\n t-=1\r\n if t: heapq.heappush(x,t)\r\n return s\r\n\r\ndef dai(tmp,y):\r\n s=0\r\n y.sort()\r\n while tmp:\r\n tmp-=1\r\n t=y.pop()\r\n s+=t\r\n t-=1\r\n y.append(t)\r\n y.sort()\r\n return s\r\n\r\nn,m=map(int,input().split())\r\na=[]\r\n#l=[int(i) for i in input().split()]\r\nl=[heapq.heappush(a,int(i)) for i in input().split()]\r\nb=a[:]\r\nprint(dai(n,a),syo(n,b))", "n,m = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nc = l[:]\r\na = b = 0\r\nfor x in range(n):\r\n g = max(l)\r\n a += g\r\n l[l.index(g)] -= 1\r\nfor x in range(n):\r\n g = min(c)\r\n b += g\r\n c[c.index(g)] -= 1\r\n if 0 in c:\r\n c.remove(0)\r\nprint(a,b)", "passengers, planes = [int(i) for i in input().split()]\r\nempty_seats_max = [int(i) for i in input().split()]\r\nempty_seats_min = empty_seats_max.copy()\r\n\r\nmax_zlotys = 0\r\nfor i in range(passengers):\r\n idx = empty_seats_max.index(max(empty_seats_max))\r\n max_zlotys += empty_seats_max[idx]\r\n empty_seats_max[idx] -= 1\r\n if empty_seats_min[idx] == 0:\r\n del empty_seats_max[idx]\r\n\r\nmin_zlotys = 0\r\nfor i in range(passengers):\r\n idx = empty_seats_min.index(min(empty_seats_min))\r\n min_zlotys += empty_seats_min[idx]\r\n empty_seats_min[idx] -= 1\r\n if empty_seats_min[idx] == 0:\r\n del empty_seats_min[idx]\r\n \r\nprint(max_zlotys, min_zlotys)", "n, m = map(int, input().split())\r\nl = sorted(list(map(int, input().split())))\r\nnew = []\r\nfor ele in l:\r\n for j in range(ele, 0, -1):\r\n new.append(j)\r\na = sum(new[:n])\r\nnew.sort()\r\nprint(sum(new[-n:]), a)", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = a.copy()\r\nd = a.copy()\r\nminz = maxz = 0\r\nc = n\r\nwhile c > 0:\r\n minz += min(b)\r\n b[b.index(min(b))] -= 1\r\n if 0 in b:\r\n b.remove(0)\r\n maxz += max(d)\r\n d[d.index(max(d))] -= 1\r\n if 0 in d:\r\n d.remove(0)\r\n c -= 1\r\nprint(maxz, minz)\r\n", "n, m = map(int, input().split())\nmin_planes = list(map(int, input().split()))\nmax_planes = min_planes[:]\nmin_cost, max_cost = 0, 0\nfor i in range(n):\n\tmin_planes.sort()\n\tfor j in range(m):\n\t\tif min_planes[j] != 0:\n\t\t\tmin_cost += min_planes[j]\n\t\t\tmin_planes[j] -= 1\n\t\t\tbreak\n\tmax_planes.sort()\n\tmax_cost += max_planes[-1]\n\tmax_planes[-1] -= 1\nprint(max_cost, min_cost)\n", "\r\n\r\n\r\n\r\n\r\nn , m = map(int,input().split())\r\n\r\nl = list(map(int,input().split()))\r\n\r\nbig = sorted(l , reverse= True)\r\nsmall = sorted(l)\r\n\r\nans_min = 0\r\nans_max= 0\r\n\r\np1 = n\r\np2 = n\r\n\r\nfor i in range(m):\r\n x = small[i]\r\n while x > 0 and p1 > 0 :\r\n p1 -=1\r\n ans_min += x\r\n x -= 1\r\n\r\n#print(ans_min)\r\nl2 = l \r\n\r\nans_max2 = 0\r\np3 = n\r\n\r\nwhile p3 > 0 :\r\n\r\n x = l2.index(max(l2))\r\n\r\n if l2[x] >= 0 :\r\n ans_max2 += l2[x]\r\n l2[x] -=1\r\n p3 -=1\r\n\r\n\r\n#print(ans_max2)\r\n\r\ni = 0\r\nwhile p2 > 0 :\r\n\r\n if big[i] > 0 :\r\n ans_max += big[i]\r\n big[i] -=1\r\n p2 -=1\r\n\r\n i +=1\r\n if i > m - 1 :\r\n i = i % m\r\n\r\n\r\nprint(max(ans_max , ans_max2), ans_min)\r\n#print(ans_max2 , ans_min)\r\n\r\n\r\n\r\n\r\n", "\"\"\"\r\nn - number of passengers\r\nm - number of planes\r\n\"\"\"\r\nn, m = list(map(int, input().rstrip().split()))\r\nplanes = list(map(int, input().rstrip().split()))\r\nplanes_copy = list(planes)\r\nmin_cost = 0\r\nmax_cost = 0\r\nfor i in range(n):\r\n temp_max = planes.index(max(planes))\r\n max_cost += planes[temp_max]\r\n if planes[temp_max] > 1:\r\n planes[temp_max] -= 1\r\n else:\r\n planes.pop(temp_max)\r\n\r\nfor i in range(n):\r\n temp_min = planes_copy.index(min(planes_copy))\r\n min_cost += planes_copy[temp_min]\r\n if planes_copy[temp_min] > 1:\r\n planes_copy[temp_min] -= 1\r\n else:\r\n planes_copy.pop(temp_min)\r\n\r\nprint(max_cost, min_cost)\r\n", "n,m=map(int,input().split())\r\nlst=list(map(int,input().split()))\r\nval=lst.copy()\r\nma=0\r\nfor i in range(n):\r\n ind=lst.index(max(lst))\r\n ma+=lst[ind]\r\n lst[ind]=lst[ind]-1\r\nmi=0\r\nfor i in range(n):\r\n ind=val.index(min(val))\r\n mi+=val[ind]\r\n val[ind]=val[ind]-1\r\n if(val[ind]==0):\r\n del val[ind]\r\nprint(ma,mi)", "import heapq\r\n\r\np, n = map(int, input().split())\r\nA = list(map(int, input().split()))\r\n\r\nhq = []\r\nfor i in A:\r\n hq.append(-i)\r\n\r\n\r\nheapq.heapify(hq)\r\nheapq.heapify(A)\r\nmx, mn = 0, 0\r\n\r\nwhile p > 0:\r\n max_hq = -heapq.heappop(hq)\r\n min_A = heapq.heappop(A)\r\n\r\n mx += max_hq\r\n mn += min_A\r\n\r\n if max_hq > 1:\r\n heapq.heappush(hq, -(max_hq-1))\r\n if min_A > 1:\r\n heapq.heappush(A, min_A-1)\r\n\r\n p -= 1\r\n\r\nprint(mx, mn)\r\n", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl2=[]\r\nfor i in l:\r\n l2.append(i)\r\nmax=0\r\nmin=0\r\ni=n\r\nl.sort()\r\nl.reverse()\r\nwhile(i>0):\r\n max+=l[0]\r\n l[0]-=1\r\n l.sort()\r\n l.reverse()\r\n i-=1\r\nl2.sort()\r\nwhile(n>0):\r\n min+=l2[0]\r\n l2[0]-=1\r\n if l2[0]<=0:\r\n l2.pop(0)\r\n l2.sort()\r\n n-=1\r\nprint(max,min)", "n, m = map(int, input().split())\r\narr0 = list(map(int, input().split()))\r\narr = arr0[:]\r\nmi_r = 0\r\nma_r = 0\r\nfor i in range(n):\r\n mi = 10000000000000\r\n mi_idx = -10\r\n for j in range(m):\r\n if(arr[j]<mi and arr[j]>0):\r\n mi_idx = j\r\n mi = arr[j]\r\n arr[mi_idx]-=1\r\n mi_r += mi\r\n\r\narr = arr0[:]\r\nfor i in range(n):\r\n ma = -1\r\n ma_idx = -1\r\n for j in range(m):\r\n if(arr[j]>ma and arr[j]>0):\r\n ma_idx = j\r\n ma = arr[j]\r\n arr[ma_idx]-=1\r\n ma_r += ma\r\nprint(ma_r, mi_r)", "import heapq\n\nn, m = map(int,input().split(' '))\na = list(map(int,input().split(' ')))\n\npq = []\nfor x in a:\n heapq.heappush(pq, -x)\n\nmx = 0\nfor i in range(n):\n x = -heapq.heappop(pq)\n mx += x\n heapq.heappush(pq, -(x - 1))\n\npq = []\nfor x in a:\n heapq.heappush(pq, x)\n\nmn = 0\nfor i in range(n):\n x = heapq.heappop(pq)\n mn += x\n if x > 1:\n heapq.heappush(pq, x - 1)\n\nprint(mx, mn)\n\n", "passengers, airplanes = map(int, input().split())\r\nemptyseats = list(map(int, input().split()))\r\n\r\n\r\ndef minMax(passengers, airplanes, emptyseats):\r\n minCount = 0\r\n maxCount = 0\r\n minAns = emptyseats.copy()\r\n for x in range(passengers):\r\n maxCount = maxCount + max(emptyseats)\r\n i = emptyseats.index(max(emptyseats))\r\n emptyseats[i] = emptyseats[i] - 1\r\n minAns.sort()\r\n for x in range(passengers):\r\n \r\n for y in range(len(minAns)):\r\n if minAns[y] != 0 and minAns[y] > 0:\r\n minCount = minCount + minAns[y]\r\n minAns[y] = minAns[y] - 1\r\n break\r\n\r\n return str(maxCount) + \" \" + str(minCount)\r\n\r\n\r\nprint(minMax(passengers, airplanes, emptyseats))\r\n", "n,m = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nl1 = l.copy()\r\nk = n\r\nmx = 0\r\nmn = 0\r\n\r\nwhile n > 0:\r\n l.sort(reverse = True)\r\n mx = mx + l[0]\r\n l[0] = l[0] - 1\r\n n = n - 1\r\nx = 0\r\nwhile k > 0:\r\n l1.sort()\r\n if l1[x] > 0:\r\n mn = mn + l1[x]\r\n l1[x] =l1[x] - 1\r\n k = k - 1\r\n else:\r\n x = x + 1\r\n\r\nprint(mx,mn)", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ng=[i for i in l]\r\ncount=0\r\ncostmin=0\r\ncostmax=0\r\nwhile count!=n:\r\n if min(l)==0:\r\n l.remove(min(l))\r\n costmin+=min(l)\r\n l[l.index(min(l))]-=1\r\n count+=1\r\ncount=0\r\nwhile count!=n:\r\n costmax+=max(g)\r\n g[g.index(max(g))]-=1\r\n count+=1\r\nprint(costmax,costmin)\r\n", "n,m= map(int,input().split())\r\na=sorted(map(int,input().split()))\r\nmin_s=0\r\nmin_c=0\r\nfor i in a:\r\n if n-min_c>=i:\r\n min_s+=i*(i+1)//2\r\n min_c+=i\r\n else :\r\n min_s+=sum(reversed(range(i-(n-min_c)+1,i+1)))\r\n break\r\nmax_s=0\r\nmax_c=0\r\nb = sorted(a,reverse=True)\r\nwhile max_c<n:\r\n max_s+=b[0]\r\n max_c+=1\r\n b[0]-=1\r\n # print('max_c',max_c , 'max_s',max_s)\r\n b=sorted(b,reverse=True)\r\nprint(max_s,min_s)\r\n\r\n\r\n\r\n", "n,m=map(int,input().split())\r\nFList=list(map(int,input().split()))\r\nSList=FList.copy()\r\n\r\n# get MaxValue\r\n\r\np,index=0,0\r\nMaxResult,maxItem,index=0,0,0\r\nMinResult=0\r\nwhile p<n:\r\n maxItem=max(FList)\r\n MaxResult+=maxItem\r\n FList.remove(maxItem)\r\n maxItem-=1\r\n FList.append(maxItem)\r\n p+=1\r\n\r\n# get MinResult\r\nSList.sort()\r\np=0\r\nwhile p<n:\r\n while SList[index]>0 and p<n :\r\n MinResult+=SList[index]\r\n SList[index]-=1\r\n p+=1\r\n if index==m-1:\r\n index=-1\r\n \r\n index+=1\r\n\r\nprint(str(MaxResult)+\" \"+str(MinResult)) \r\n \r\n\r\n", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\np=sorted(l)\r\nl.sort(reverse=True)\r\nx=n;y=0\r\nwhile(x):\r\n x-=1\r\n y+=l[0]\r\n l[0]-=1\r\n if l[0]==0:\r\n l.pop(0)\r\n l.sort(reverse=True)\r\nx=n;u=0\r\nwhile(x):\r\n x-=1\r\n u+=p[0]\r\n p[0]-=1\r\n if p[0]==0:\r\n p.pop(0)\r\n p.sort()\r\nprint(y,u)\r\n", "import sys\nfrom itertools import accumulate\n\npeople, planes = [int(i) for i in input().split()]\n\nmasterlst = [int(i) for i in input().split()]\nminlst = masterlst.copy()\nmaxlst = masterlst.copy()\n\nmaxans = 0\nfor i in range(people):\n\tif max(maxlst) == 0:\n\t\tbreak\n\t# plane, how many empty seats\n\tmaxscore = [-1, -1]\n\tfor plane in range(planes):\n\t\tif maxlst[plane] > maxscore[1]:\n\t\t\tmaxscore = [plane, maxlst[plane]]\n\tif maxscore == [-1, -1]:\n\t\tbreak\n\telse:\n\t\tmaxans += maxscore[1]\n\t\tmaxlst[maxscore[0]] -= 1\n#print(maxans)\n\nminans = 0\nfor i in range(people):\n\tif max(minlst) == 0:\n\t\tbreak\n\t# plane, how many empty seats\n\tminscore = [-1, 1001]\n\tfor plane in range(planes):\n\t\tif minlst[plane] < minscore[1] and minlst[plane] > 0:\n\t\t\tminscore = [plane, minlst[plane]]\n\tif minscore == [-1, 1001]:\n\t\tbreak\n\telse:\n\t\tminans += minscore[1]\n\t\tminlst[minscore[0]] -= 1\n\nprint(maxans, minans)\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\nw = sorted(map(int, input().split()), reverse=True)\r\nd = w[::]\r\nk = n\r\n\r\ns = 0\r\na = w[0]\r\nwhile d[-1]:\r\n for i in range(m):\r\n if d[i] == a:\r\n s += a\r\n k -= 1\r\n d[i] = a-1\r\n if k == 0:\r\n break\r\n if k == 0:\r\n break\r\n a -= 1\r\n\r\nc = 0\r\nwhile w[0]:\r\n for i in range(m-1, -1, -1):\r\n while w[i]:\r\n c += w[i]\r\n w[i] = w[i] - 1\r\n n -= 1\r\n if n == 0:\r\n break\r\n if n == 0:\r\n break\r\n if n == 0:\r\n break\r\nprint(s, c)", "import queue\r\ndef get_ans():\r\n qlo = queue.PriorityQueue()\r\n qhi = queue.PriorityQueue()\r\n n,m = map(int,input().split())\r\n l = list(map(int,input().split()))\r\n for i in l:\r\n qlo.put(i)\r\n qhi.put(-i)\r\n\r\n # MAX\r\n hi = 0\r\n nhi = 0\r\n while nhi < n and not qhi.empty():\r\n nhi+=1\r\n x = qhi.get()\r\n hi-=x\r\n x = x + 1\r\n if x != 0:\r\n qhi.put(x)\r\n\r\n\r\n # MIN\r\n lo = 0\r\n nlo = 0\r\n while nlo < n and not qlo.empty():\r\n nlo+=1\r\n x = qlo.get()\r\n lo+=x\r\n x = x - 1\r\n if x != 0:\r\n qlo.put(x)\r\n\r\n return hi,lo\r\n\r\nhi,lo = get_ans()\r\nprint(hi, lo)", "\r\ndef main():\r\n n, m = map(int, input().split())\r\n arr = list(map(int, input().split()))\r\n arr.sort()\r\n\r\n mxarr = arr[:]\r\n mxarr.sort(reverse=True)\r\n mxn = n\r\n\r\n start = 0\r\n ans = 0\r\n while n > 0:\r\n if arr[start] > 0:\r\n ans += arr[start]\r\n arr[start] -= 1\r\n n -= 1\r\n else:\r\n start += 1\r\n\r\n ans1 = 0\r\n while mxn > 0:\r\n mxnum = max(mxarr)\r\n mxind = mxarr.index(mxnum)\r\n ans1 += mxnum\r\n mxarr[mxind] -= 1\r\n mxn -= 1\r\n\r\n print(ans1, ans)\r\n\r\n\r\nmain()", "n,m =map(int,input().split())\r\norg_lst=list(map(int,input().split()))\r\nlst=org_lst.copy()\r\nmax_ans=0\r\npassenger=n\r\nwhile(passenger!=0):\r\n lst.sort()\r\n max_ans+=lst[-1]\r\n lst[-1]-=1\r\n passenger-=1\r\n\r\nlst=org_lst.copy()\r\nmin_ans=0\r\npassenger=n\r\nwhile(passenger!=0):\r\n if lst[0]==0:\r\n lst.pop(0)\r\n continue\r\n lst.sort()\r\n min_ans+=lst[0]\r\n lst[0]-=1\r\n passenger-=1\r\n\r\nprint(max_ans,min_ans)\r\n \r\n", "n,m = map(int,input().split())\narr = list(map(int,input().split()))\nma , mi = 0,0\nbrr = arr.copy()\nfor i in range(n):\n arr.sort()\n brr.sort()\n mi += arr[0]\n if arr[0]==1:\n arr[0]=1000000\n else:\n arr[0]-=1\n ma += brr[-1]\n brr[-1] -= 1\nprint(ma,mi)\n\n \n\n", "passengers, planes = tuple(map(int, input().split()))\r\npassengers1 = passengers\r\nempty_seats = list(map(int, input().split()))\r\nempty_seats1 = empty_seats[:]\r\nempty_seats.sort()\r\n\r\ntotal_revenue = 0\r\n\r\n\r\nj=0\r\nfor i in range(passengers):\r\n if empty_seats[j]<1:\r\n j+=1\r\n total_revenue+=empty_seats[j]\r\n empty_seats[j]-=1\r\n \r\n \r\nmax_profit = 0\r\nfor i in range(passengers1):\r\n empty_seats1.sort()\r\n max_profit += empty_seats1[-1]\r\n empty_seats1[-1]-=1\r\nprint (max_profit, total_revenue)\r\n", "n,m= list(map(int,input().split()))\r\n\r\nseat1= list(map(int,input().split()))\r\nseat2= [-x for x in seat1]\r\n\r\nimport heapq\r\n\r\nmi=0\r\nheapq.heapify(seat1)\r\nx=n\r\nwhile x>0:\r\n t=heapq.heappop(seat1)\r\n \r\n while t>0 and x>0:\r\n mi+=t\r\n t-=1\r\n x-=1\r\n\r\nmx=0\r\nheapq.heapify(seat2)\r\n\r\nwhile n>0:\r\n t=heapq.heappop(seat2)\r\n mx-= t\r\n \r\n n-=1\r\n heapq.heappush(seat2,t+1)\r\n\r\nprint(*[mx,mi])\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n", "from heapq import *\r\ndef miis():\r\n return map(int, input().split())\r\n\r\nn, m = miis()\r\nans1 = 0\r\nans2 = 0\r\nmn = []\r\nmx = []\r\na = list(miis())\r\nfor i in a:\r\n heappush(mn, -i)\r\nfor i in a:\r\n heappush(mx, i)\r\nfor i in range(n):\r\n new = -heappop(mn)\r\n ans1 += new\r\n if new!=1:\r\n heappush(mn, -new+1)\r\nfor i in range(n):\r\n new = heappop(mx)\r\n ans2 += new\r\n if new!=1:\r\n heappush(mx, new-1)\r\nprint(ans1, ans2)\r\n", "import heapq\nn,m = [int(i) for i in input().split()]\na = [int(i) for i in input().split()]\nb = a[:]\n\n# find min\nheapq.heapify(b)\nc = 0\np_min = 0\nwhile b and c<n:\n v = heapq.heappop(b)\n p_min+=v\n if v>1:\n heapq.heappush(b,v-1)\n c+=1\n\n# find max\nheapq._heapify_max(a)\nc = 0\np_max = 0\nwhile a and c<n:\n v = heapq.heappop(a)\n p_max+=v\n if v>1:\n heapq.heappush(a,v-1)\n heapq._heapify_max(a)\n c+=1\n\n\nprint(p_max,p_min)", "n,a= map(int,input().strip().split(\" \"))\r\nm=[int(x) for x in input().split()]\r\nm1=[]\r\nfor i in range(a):\r\n m1.append(m[i])\r\ntx=0\r\ntn=0\r\nfor i in range(n):\r\n tx+=max(m)\r\n m[m.index(max(m))]-=1\r\nm=m1\r\nfor i in range(n):\r\n if (m1[m1.index(min(m1))]==0):\r\n m1[m1.index(min(m1))]=m1[m1.index(max(m1))]+1\r\n tn+=min(m1)\r\n m1[m1.index(min(m1))]-=1\r\nprint(tx,tn)", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\np1=sorted(l)\r\np2=sorted(l)\r\nc1,c2=0,0\r\nfor i in range(n): \r\n c1=c1+p1[-1] \r\n p1[-1]=p1[-1]-1 \r\n p1.sort()\r\ni=0\r\nx=0\r\nwhile i!=n: \r\n if p2[x]!=0: \r\n c2+=p2[x] \r\n p2[x]-=1\r\n i+=1\r\n else: \r\n x+=1 \r\nprint(c1,end=\" \")\r\nprint(c2)", "import heapq\r\nn,m=map(int,input().split())\r\nlist1=list(map(int,input().split()))\r\nlist2=list1[:]\r\nlist1=[-x for x in list1]\r\nheapq.heapify(list1)\r\ncountmaxx=n\r\ncountminn=n\r\nmaxx=0\r\nminn=0\r\nwhile countmaxx:\r\n val=heapq.heappop(list1)\r\n maxx+=abs(val)\r\n heapq.heappush(list1,val+1)\r\n countmaxx-=1\r\n\r\nheapq.heapify(list2)\r\n\r\nwhile countminn:\r\n val=heapq.heappop(list2)\r\n minn+=val\r\n if val>1:\r\n heapq.heappush(list2,val-1)\r\n countminn-=1\r\n\r\nprint(maxx,minn)\r\n", "nm = input().split()\nn, m = int(nm[0]), int(nm[1])\nf = 0\nl = m-1\nmx = 0\nmn = 0\narr = list(map(int, input().split()))\narr.sort()\ngg = [i for i in arr]\nnn = n\nwhile n:\n mx += arr[l]\n arr[l] -= 1\n arr.sort()\n n -= 1\n\nwhile nn:\n mn += gg[f]\n gg[f] -= 1\n gg.sort()\n if 0 in gg:gg.remove(0)\n nn -= 1\nprint(mx, mn)", "l=list(map(int, input().split()))\r\na=list(map(int, input().split()))\r\na.sort()\r\nn=l[0]\r\nc=[]\r\nr=[]\r\nfor i in range(len(a)):\r\n b=list(range(1,a[i]+1))\r\n b.sort()\r\n b.reverse()\r\n c=c+b\r\nd=c[:n]\r\nc.sort()\r\nc.reverse()\r\ne=c[:n]\r\nr.append(sum(e))\r\nr.append(sum(d))\r\nprint(' '.join(map(str, r)))", "persons, planes = map(int, input().split(\" \"))\r\nseats = list(map(int, input().split(\" \")))\r\n\r\ncopy = seats.copy()\r\n\r\n_min_, ini, _max_, valor = 0, 0, 0, 0\r\n\r\nseats.sort()\r\ncopy.sort(reverse=True)\r\n\r\nfor i in range(persons):\r\n _min_ += seats[ini]\r\n seats[ini]-=1\r\n if seats[ini] == 0:\r\n ini += 1\r\n\r\nwhile persons > 0:\r\n valor = copy[0]\r\n for i in range(planes):\r\n if copy[i] == valor:\r\n _max_ += copy[i]\r\n persons-=1\r\n copy[i]-=1\r\n else:\r\n i = -1\r\n valor = copy[0]\r\n if persons == 0:\r\n break\r\n \r\nprint('{} {}'.format(_max_, _min_))", "n,m = list(map(int,input().split(\" \")))\r\narr = list(map(int,input().split(\" \")))\r\n\r\ndef get_min(arr):\r\n mini = arr[0]\r\n ind = 0\r\n for i in range(m):\r\n if mini > arr[i] and arr[i] > 0:\r\n mini = arr[i]\r\n ind = i\r\n return mini,ind\r\n\r\nfinal_max = 0\r\narr1 = arr.copy()\r\nfor i in range(n):\r\n maxi = arr1[0]\r\n maximum_index = 0\r\n\r\n for j in range(m):\r\n if maxi < arr1[j]:\r\n maximum_index = j\r\n maxi = arr1[j]\r\n\r\n final_max += maxi\r\n arr1[maximum_index] -= 1\r\n # print(i,maxi,maximum_index,final_max,arr1)\r\n\r\n# print('---------------------------------------')\r\n\r\nfinal_min = 0\r\nfor i in range(n):\r\n mini = 10**5\r\n minimum_index = 0\r\n\r\n for j in range(m):\r\n if arr[j] > 0 and mini > arr[j] :\r\n mini = arr[j]\r\n minimum_index = j\r\n\r\n final_min += mini\r\n arr[minimum_index] -= 1\r\n # print(i,mini,minimum_index,final_min,arr)\r\n\r\nprint(final_max,final_min)", "import heapq\r\n\r\nn,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = [-i for i in a]\r\nheapq.heapify(a)\r\nheapq.heapify(b)\r\nM,m = 0,0\r\nfor i in range(n) :\r\n x,X = heapq.heappop(a),-heapq.heappop(b)\r\n m += x\r\n M += X\r\n if x > 1 : heapq.heappush(a,x-1)\r\n if X > 1 : heapq.heappush(b,-(X-1))\r\nprint(M,m)\r\n", "N,m=map(int,input().split())\r\ntm=m\r\nA=list(map(int,input().split()))\r\nminA=A.copy()\r\nminA.sort()\r\nans1=ans2=0\r\nfor i in range(N):\r\n minA.sort()\r\n ans1+=minA[0]\r\n minA[0]-=1\r\n if minA[0]==0:\r\n minA.remove(0)\r\nfor i in range(N):\r\n A.sort(reverse=True)\r\n ans2+=A[0]\r\n A[0]-=1\r\nprint(ans2,ans1)\r\n \r\n \r\n \r\n \r\n \r\n", "n,m=map(int,input().split())\r\nl1=list(map(int,input().split()))\r\ns=0\r\na=0\r\ns1=0\r\nb=0\r\nl2=[]\r\nfor i in range(len(l1)):\r\n\tif l1[i]!=0:\r\n\t\tl2.append(l1[i])\r\nfor i in range(n):\r\n\ts+=max(l1)\r\n\ta=l1.index(max(l1))\r\n\tl1[a]-=1\r\nfor i in range(n):\r\n\ts1+=min(l2)\r\n\tb=l2.index(min(l2))\r\n\tl2[b]-=1\r\n\tif 0 in l2:\r\n\t\tdel l2[l2.index(0)]\r\nprint(s,s1)", "import copy\r\nn,k=map(int,input().split())\r\nar=list(map(int,input().split()))\r\nar=sorted(ar)\r\nar1=ar.copy()\r\nmaximum=0;minimum=0;n1=n\r\nwhile(n>0):\r\n minimum+=ar[0]\r\n #print(minimum)\r\n ar[0]-=1\r\n n-=1\r\n if ar[0]==0:\r\n ar.pop(0)\r\nwhile(n1>0):\r\n maximum+=ar1[-1]\r\n ar1[-1]-=1\r\n n1-=1\r\n ar1=sorted(ar1)\r\nprint(maximum,minimum)\r\n", "def main():\n n, m = map(int, input().split())\n n0 = n\n aa = sorted(map(int, input().split()))\n mi = ma = 0\n for a in aa:\n mi += a * (a + 1)\n n -= a\n if n < 0:\n break\n mi -= n * (n - 1)\n aa.reverse()\n mx = max(aa)\n while n0:\n li = min(n0, aa.count(mx))\n n0 -= li\n ma += mx * li\n mx -= 1\n for i in range(li):\n aa[i] = mx\n print(ma, mi // 2)\n\n\nif __name__ == '__main__':\n main()", "x,y=input().split()\r\nn=int(x) \r\nm=int(y)\r\nch=str(input())\r\na=ch.split()\r\nl=[]\r\nmx=0\r\nmn=0\r\nfor i in range(m) :\r\n l.append(int(a[i]))\r\nl2=l[:]\r\nfor i in range (n) :\r\n y=max(l)\r\n im=l.index(y) \r\n mx+=max(l)\r\n f=y-1\r\n l=l[:im]+[f]+l[im+1:]\r\nfor i in range (n) :\r\n if min(l2)==0 :\r\n im=l2.index(0)\r\n l2=l2[:im]+l2[im+1:]\r\n imp=l2.index(min(l2))\r\n mn+=min(l2)\r\n f=min(l2)-1\r\n l2=l2[:imp]+[f]+l2[imp+1:]\r\n \r\nprint(mx,mn)", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\nans = []\r\nfor i in a:\r\n for j in range(i, 0, -1):\r\n ans.append(j)\r\nfinal = sorted(ans)[::-1]\r\nprint(sum(final[:n]), sum(ans[:n]))", "n,m = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nlc = l.copy()\r\nmini = 0\r\nmaxi = 0\r\nfor _ in range(n):\r\n least = min([e for e in l if e > 0])\r\n l[l.index(least)] -= 1\r\n mini += least\r\n \r\n large = max(lc)\r\n lc[lc.index(large)] -= 1\r\n maxi += large\r\n\r\nprint(maxi)\r\nprint(mini)\r\n", "def max_tic(l,n):\r\n r=l[:]\r\n max_count=0\r\n for i in range(n):\r\n if r!=[]:\r\n m=max(r)\r\n if m>=0:\r\n max_count+=m\r\n r[r.index(m)]-=1\r\n return max_count\r\ndef min_tic(l,n):\r\n r=l[:]\r\n min_count=0\r\n while 0 in r:\r\n r.remove(0)\r\n for i in range(n):\r\n #print(r)\r\n if r!=[]:\r\n m=min(r)\r\n if m>=0:\r\n min_count+=m\r\n r[r.index(m)]-=1\r\n while 0 in r:\r\n r.remove(0)\r\n return min_count\r\n \r\n\r\n\r\nn,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nprint(max_tic(l,n),min_tic(l,n))", "l=list(map(int,input().split()))\r\nn,m=l[0],l[1]\r\nl=list(map(int,input().split()))\r\nl.sort()\r\njap=[i for i in l]\r\ns=0\r\nk1=[]\r\nk2=[]\r\nfor i in range(m):\r\n while l[i]:\r\n k1.append(l[i])\r\n l[i]-=1\r\njap.reverse()\r\nfor i in range(n):\r\n k2.append(jap[0])\r\n jap[0]-=1\r\n jap.sort(reverse=True)\r\nprint(sum(k2[:(n)]),sum(k1[:(n)]))", "I=lambda:map(int,input().split())\nn,m=I()\na=list(I())\ndef g(f):\n global a,n\n t=a[:]\n i,s=0,0\n while i<n:\n i+=1\n j=t.index(f(t))\n s+=t[j]\n if t[j]>1:\n t[j]-=1\n else:\n t.pop(j)\n return s\nprint(g(max),g(min))\n", "n,m = map(int, input().split())\r\nplanes1 = list(map(int, input().split()))\r\nplanes2 = planes1.copy()\r\n\r\nplanes1.sort()\r\nmini = 0\r\n\r\nfor i in range(n):\r\n mini += planes1[0]\r\n if planes1[0] == 1:\r\n planes1.pop(0)\r\n else:\r\n planes1[0] -= 1\r\n planes1.sort()\r\n\r\nplanes2.sort(reverse=True)\r\nmaxi = 0\r\n\r\nfor i in range(n):\r\n maxi += planes2[0]\r\n if planes2[0] == 1:\r\n planes2.pop(0)\r\n else:\r\n planes2[0] -= 1\r\n planes2.sort(reverse=True)\r\n\r\nprint(maxi, mini)", "n,m=map(int,input().split())\r\na=sorted(list(map(int,input().split())))\r\nb=a[::]\r\nans1,ans2=0,0\r\nfor i in range(n):\r\n ans1+=b[0]\r\n ans2+=a[-1]\r\n a[-1]-=1\r\n b[0]-=1\r\n a.sort()\r\n if b[0]==0: b.pop(0)\r\nprint(ans2,ans1)\r\n", "line1 = input().split(' ')\nq_len = int(line1[0])\nnum_planes = int(line1[1])\nline2 = input().split(' ')\nempty_seats = [int(i) for i in line2]\nempty_asc = sorted(empty_seats.copy())\nempty_desc = sorted(empty_seats.copy(), reverse=True)\n\ndef get_earned(seats, n_pas, n_planes, max_zlotys=True):\n earned = 0\n for i in range(n_pas):\n earned += seats[-1]\n seats[-1] -= 1\n if seats[-1] == 0:\n popped = seats.pop()\n if max_zlotys==True:\n seats = sorted(seats)\n else:\n seats = sorted(seats, reverse=True)\n return earned\n \n \n \n# max:\nmax_zlotys = get_earned(empty_asc, q_len, num_planes, max_zlotys=True)\n \n#min:\nmin_zlotys = get_earned(empty_desc, q_len, num_planes, max_zlotys=False)\n\nprint(str(max_zlotys)+' '+str(min_zlotys))\n\t\t\t\t\t \t \t\t\t\t\t \t \t \t \t", "n, m = [int(i) for i in input().split()]\r\nseats = [int(i) for i in input().split()]\r\ns = seats.copy()\r\n\r\nmn = 0\r\nmx = 0\r\n\r\nfor i in range(n):\r\n mx += max(s) if max(s) > 0 else 0\r\n s[s.index(max(s))] -= 1\r\n\r\nfor i in range(n):\r\n mn += min(seats) if min(seats) > 0 else 0\r\n x = seats.index(min(seats))\r\n seats[x] = seats[x] - 1 if seats[x] > 1 else 1001\r\n\r\nprint(mx, mn)\r\n", "import sys\r\nimport math\r\nimport bisect as bs\r\nimport string as strn\r\nimport heapq as hq\r\nimport collections as clc\r\nimport itertools as it\r\nimport operator as op\r\nimport copy as cp\r\n\r\nto_debug = True\r\ndef solve():\r\n n, m = inp_list(int)\r\n a = inp_list(int)\r\n\r\n s = sum(a)\r\n if n == s:\r\n same_val = 0\r\n for v in a:\r\n same_val += (v*(v + 1) // 2)\r\n print(f\"{same_val} {same_val}\")\r\n else:\r\n t = cp.deepcopy(a)\r\n max_val = 0\r\n for _ in range(n):\r\n mx = max(t)\r\n max_val += mx\r\n t[t.index(mx)] -= 1\r\n\r\n print(max_val, end=\" \")\r\n\r\n min_val = 0\r\n for _ in range(n):\r\n mx = min(a)\r\n min_val += mx\r\n mx_index = a.index(mx)\r\n a[mx_index] -= 1\r\n if a[mx_index] <= 0:\r\n a[mx_index] = math.inf\r\n\r\n print(min_val)\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\ndef main():\r\n t = 1\r\n for _ in range(t):\r\n solve()\r\n\r\ndef input():\r\n return sys.stdin.readline().strip('\\r\\n')\r\n\r\ndef inp_int():\r\n return int(input())\r\n\r\ndef inp_list(f=None):\r\n return list(map(f, input().split())) if f else list(input())\r\n\r\ndef print(x='', end='\\n'):\r\n sys.stdout.write(str(x))\r\n sys.stdout.write(end)\r\n\r\ndef debug(*x, end='\\n', sep=' '):\r\n if not to_debug:\r\n return\r\n for _x in x:\r\n sys.stderr.write(str(_x))\r\n sys.stderr.write(str(sep))\r\n sys.stderr.write(end)\r\n\r\nmain()", "def f(x): return x * (x + 1)\r\n \r\nn, m = map(int, input().split())\r\nans, t = [0, 0], list(map(int, input().split()))\r\n\r\nt.sort()\r\np, k, i = 0, 0, 0\r\n\r\nwhile n > k:\r\n k += t[i]\r\n p += f(t[i])\r\n i += 1\r\n \r\nans[1] = (p - f(k - n)) // 2\r\nt.reverse()\r\np, k, i, j = 0, 0, 1, t[0] + 1\r\n\r\nwhile n > k:\r\n j -= 1\r\n while i < m and t[i] == j: i += 1\r\n \r\n k += i\r\n p += i * j\r\n \r\nans[0] = p - (k - n) * j\r\nprint(ans[0], ans[1])", "number_input=list(map(int,input().split()))\r\nn=number_input[0]\r\nm=number_input[1]\r\ntmax=0\r\ntmin=0\r\nplane_input=list(map(int,input().split()))\r\nplane_input2=plane_input.copy()\r\nfor i in range (0,n):\r\n plane_input.sort()\r\n tmax=tmax+plane_input[-1]\r\n plane_input[-1]=plane_input[-1] -1\r\n\r\nfor i in range (0,n):\r\n plane_input2.sort()\r\n if plane_input2[0]==0:\r\n plane_input2.remove(0)\r\n plane_input2.sort()\r\n tmin = tmin +plane_input2[0]\r\n plane_input2[0]=plane_input2[0] -1\r\nprint((tmax),end=\" \")\r\nprint(tmin) \r\n", "import heapq\nn,m=map(int,input().split())\na = list(map(int, input().split()))\n\nq = list(a)\nheapq.heapify(q)\ntot = 0\npeopel = n\nwhile peopel:\n v = heapq.heappop(q)\n tot += v\n peopel-=1\n if (v > 1):\n heapq.heappush(q,v-1)\n\npp = tot\n\nq = [-aa for aa in a]\nheapq.heapify(q)\ntot = 0\npeopel = n\nwhile peopel:\n v = -heapq.heappop(q)\n tot += v\n peopel-=1\n if (v > 1):\n heapq.heappush(q,-(v-1))\n\nprint(tot, pp)\n\n", "n,m=map(int,input().split())\r\nst=list(map(int,input().split(' ')))\r\nmxP,mnP=0,0\r\nr=st.copy()\r\nl=st.copy()\r\nwhile(n):\r\n r.sort(reverse=True)\r\n mxP+=r[0]\r\n r[0]-=1\r\n \r\n l.sort()\r\n mnP+=l[0]\r\n l[0]-=1\r\n if 0 in l:\r\n l.remove(0)\r\n \r\n\r\n\r\n n-=1\r\nprint(mxP,mnP)", "n,m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = a.copy()\r\nz = 0\r\nx = 0\r\nfor i in range(n):\r\n a.sort()\r\n b.sort()\r\n z += a[0]\r\n if a[0] == 1:\r\n a[0] = 1000\r\n else:\r\n a[0] -= 1\r\n x += b[m-1]\r\n b[m-1] -= 1\r\nprint(x,z)", "from math import *\r\n\r\n\r\ndef main():\r\n n, m = map(int, input().split())\r\n A = list(map(int, input().split()))\r\n A1 = A.copy()\r\n #MiN\r\n s = 0\r\n for i in range(n):\r\n index = A.index(min(A))\r\n s += min(A)\r\n A[index] -= 1\r\n if A[index] == 0:\r\n A.pop(index)\r\n # MAX\r\n s1 = 0\r\n for i in range(n):\r\n index = A1.index(max(A1))\r\n s1 += max(A1)\r\n A1[index] -= 1\r\n if A1[index] == 0:\r\n A1.pop(index)\r\n print(s1, s)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort(reverse=True)\r\ncount_max = 0\r\ncount_min = 0\r\nn_temp = n\r\n\r\na_copy = a.copy()\r\na_copy.sort()\r\nwhile n_temp > 0:\r\n count_min += a_copy[0]\r\n n_temp -= 1\r\n a_copy[0] -= 1\r\n if a_copy[0] == 0:\r\n if len(a_copy) == 1:\r\n break\r\n a_copy = a_copy[1:]\r\n a_copy.sort()\r\n\r\nn_temp = n\r\nwhile n_temp > 0:\r\n count_max += a[0]\r\n n_temp -= 1\r\n a[0] -= 1\r\n a.sort(reverse=True)\r\nprint(count_max, count_min)", "n,m = map(int, input().split())\r\nseats = [int(s) for s in input().split(\" \", m-1)]\r\nseats.sort()\r\na = n\r\nb = 0\r\nfor s in seats:\r\n if a==0:\r\n break\r\n if s<=a:\r\n b += s*(s+1)/2\r\n a -= s\r\n else:\r\n b += s*(s+1)/2 - (s-a)*(s-a+1)/2\r\n break\r\ni = n\r\nj = 0\r\nwhile True:\r\n seats.sort()\r\n seats.reverse()\r\n if i==0:\r\n break\r\n j += seats[0]\r\n i -= 1\r\n seats[0] = seats[0]-1\r\nprint(int(j), int(b))", "n,m=[int(x) for x in input().split()]\r\na=[int(x) for x in input().split()]\r\nb=a.copy()\r\nlow, high = 0, 0\r\n \r\nfor i in range(n):\r\n a.sort()\r\n b.sort()\r\n low += a[0]\r\n high += b[-1]\r\n a[0]=a[0]-1\r\n b[-1]=b[-1]-1\r\n if a[0]==0:\r\n a[0]=1001\r\nprint(high, low)\r\n ", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\na = sorted(a)\r\nmini = []\r\nfor x in a:\r\n for i in range(x, 0, -1):\r\n mini.append(i)\r\nmaxi = sorted(mini)[::-1]\r\nprint(sum(maxi[:n]), sum(mini[:n]))\r\n ", "n, m = input().split()\r\nn, m = int(n), int(m)\r\n\r\nlst = input().split()\r\nlst = [int(i) for i in lst]\r\n\r\nlst.sort()\r\n\r\nmin_lst = []\r\nfor i in lst:\r\n for j in range(i, 0, -1):\r\n min_lst.append(j)\r\n\r\nmax_lst = []\r\nfor i in lst:\r\n for j in range(i, 0, -1):\r\n max_lst.append(j)\r\nmax_lst.sort()\r\nmax_lst.reverse()\r\n\r\nmax_profit = 0\r\nmin_profit = 0\r\n\r\nfor i in range(n):\r\n min_profit += min_lst[i]\r\n max_profit += max_lst[i]\r\n\r\nprint (max_profit, min_profit)", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\ntemp = a.copy()\r\ntotal = sum(a)\r\nif total==n:\r\n\ts = 0\r\n\tfor item in a:\r\n\t\tfor i in range(item,0,-1):\r\n\t\t\ts+=i\r\n\tprint(s,s)\r\nelse:\r\n\ts = 0; i = 0\r\n\twhile (i<n):\r\n\t\tm = max(a)\r\n\t\ts+=m\r\n\t\ta[a.index(m)]-=1\r\n\t\ti+=1\r\n\ttemp.sort()\r\n\tcount = i = s2 = 0\r\n\twhile (count<n):\r\n\t\t# print(temp)\r\n\t\tif temp[i]!=0:\r\n\t\t\ts2+=temp[i]\r\n\t\t\ttemp[i]-=1\r\n\t\telse:\r\n\t\t\ti+=1\r\n\t\t\ts2+=temp[i]\r\n\t\t\ttemp[i]-=1\r\n\t\tcount+=1\t\r\n\tprint(s, s2)\t", "from collections import Counter\r\nn, m = map(int, input().strip().split())\r\narr = list(map(int, input().strip().split()))\r\ntable = [0] * 1001\r\ns = set(arr)\r\nfor i in arr:\r\n table[i] += 1\r\nmaxzylots, minzylots = 0, 0\r\npeople = n\r\nidx = 1\r\nwhile people > 0 and idx < 1001:\r\n p = table[idx]\r\n while p and people:\r\n if people > idx:\r\n minzylots += (idx * (idx + 1)) // 2\r\n people -= idx\r\n # print(minzylots, idx, people, p)\r\n else:\r\n x = idx - people\r\n minzylots += (idx * (idx + 1)) // 2 - (x * (x + 1)) // 2\r\n people = 0\r\n # print(minzylots, idx, p)\r\n p -= 1\r\n else:\r\n idx += 1\r\n\r\nidx = 1000\r\npeople = n\r\nwhile idx > 0 and people > 0:\r\n if table[idx]:\r\n if people < table[idx]:\r\n maxzylots += idx * people\r\n people = 0\r\n else:\r\n maxzylots += idx * table[idx]\r\n table[idx - 1] += table[idx]\r\n people -= table[idx]\r\n idx -= 1\r\nprint(maxzylots, minzylots)\r\n", "n,m=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\na.sort()\r\nt=n\r\ni=0\r\nma=mi=0\r\nwhile i<m and n>0:\r\n if a[i]>n:\r\n mi+=(n*(2*a[i]-n+1)/2)\r\n else:\r\n mi+=(a[i]*(a[i]+1)/2)\r\n n-=min(a[i],n)\r\n i+=1\r\nn=t\r\ni=0\r\nwhile n>0:\r\n ma+=max(a)\r\n a[a.index(max(a))]-=1\r\n n-=1\r\nprint(int(ma),int(mi)) \r\n \r\n\r\n\r\n\r\n", "n, m = map(int, input().split())\narr = list(map(int, input().split()))\narr2 = arr.copy()\nresult = 0\nfor i in range(n):\n max_num = max(arr)\n max_index = arr.index(max_num)\n arr[max_index] = max_num-1\n result += max_num\n\nprint(result, end=' ')\n\nresult2 = 0\nfor i in range(n):\n min_num = min(arr2)\n min_index = arr2.index(min_num)\n if min_num-1 == 0:\n del arr2[min_index]\n else:\n arr2[min_index] = min_num-1\n result2 += min_num\n\nprint(result2)\n\n", "import heapq\nn, m = map(int, input().split())\n\nls = list(map(int, input().split()))\npq = ls.copy()\n# print(ls, pq)\nheapq.heapify(pq)\nmini = 0\nctr = 0\nwhile ctr < n:\n temp = heapq.heappop(pq)\n mini += temp\n ctr += 1\n if temp > 1:\n heapq.heappush(pq, temp-1)\nctr = 0\nls = list(map(lambda x:-x, ls))\nheapq.heapify(ls)\nmaxi = 0\nwhile ctr < n:\n temp = heapq.heappop(ls)\n maxi += -1*temp\n temp += 1\n ctr += 1\n if temp != 0 :\n heapq.heappush(ls, temp)\nprint(maxi, mini)\n", "n, m = input().split()\r\nn, m = int(n), int(m)\r\n\r\na = list(map(int, input().split()))\r\n\r\na.sort()\r\n\r\nmax_income = 0\r\nn_to_min = n\r\nmin_price = 0\r\nfor plane in a:\r\n if plane >= n_to_min:\r\n\r\n min_price += (plane * (plane + 1)) // 2 - (((plane - n_to_min) * (plane - n_to_min + 1)) // 2)\r\n break\r\n else:\r\n min_price += (plane * (plane + 1)) // 2\r\n n_to_min -= plane\r\n\r\n\r\ndef find_max_idx(arr):\r\n maxidx = 0\r\n for i in range(len(arr)):\r\n if arr[i] >= arr[maxidx]:\r\n maxidx = i\r\n return maxidx\r\n\r\nfor i in range(n):\r\n maxidx = find_max_idx(a)\r\n max_income += a[maxidx]\r\n a[maxidx] -= 1\r\nprint(max_income, min_price)", "# cook your dish here\r\nfrom sys import stdin, stdout\r\nimport math\r\nfrom itertools import permutations, combinations\r\nfrom collections import defaultdict\r\nfrom bisect import bisect_left \r\nfrom bisect import bisect_right\r\nfrom collections import deque\r\n \r\ndef L():\r\n return list(map(int, stdin.readline().split()))\r\n \r\ndef In():\r\n return map(int, stdin.readline().split())\r\n \r\ndef I():\r\n return int(stdin.readline())\r\n \r\nP = 1000000007\r\nn, m = In()\r\narr = L()\r\narr.sort()\r\nmx = 0\r\nmn = 0\r\ntmp = n\r\nfor i in range(m):\r\n if tmp - arr[i] >= 0:\r\n tmp -= arr[i] \r\n for j in range(arr[i]):\r\n mn += (j+1)\r\n else:\r\n for j in range(tmp):\r\n mn += arr[i] - j\r\n break\r\n \r\nfor i in range(n):\r\n v = max(arr)\r\n if v == 0:\r\n break\r\n else:\r\n mx += v\r\n x = arr.index(v)\r\n arr[x] -= 1 \r\n\r\nprint(mx, mn)", "z,x=map(int,input().split())\r\nlst=list(map(int,input().split()))\r\nlst.sort()\r\nlst1=lst.copy()\r\ni_mm=ans_mm=0;c_mm=z\r\nwhile i_mm < x and c_mm>0:\r\n if lst[i_mm] > c_mm :\r\n r=lst[i_mm]-c_mm\r\n ans_mm+=(lst[i_mm]*(lst[i_mm]+1)//2) - ( (r)*(r+1)//2)\r\n break\r\n else:\r\n ans_mm+=lst[i_mm]*(lst[i_mm]+1)//2\r\n c_mm-=lst[i_mm]\r\n i_mm+=1\r\n\r\nv=[0]*1000 ; q=[] \r\nfor i in lst1:\r\n if v[i-1]==0:\r\n v[i-1]=list(range(1,i+1))\r\n \r\n q+=v[i-1]\r\nq.sort(reverse=1)\r\n\r\nprint(sum(q[:z]) ,ans_mm)\r\n\r\n", "import copy\r\n\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\naC = copy.deepcopy(a)[::-1]\r\n\r\n_min = 0\r\nnC = n\r\nfor i in range(m):\r\n if nC == 0:\r\n break\r\n while nC > 0 and a[i] > 0:\r\n _min += a[i]\r\n nC -= 1\r\n a[i] -= 1\r\n_max = 0\r\ni = 0\r\nwhile n > 0 and aC[i] > 0:\r\n _max += aC[i]\r\n aC[i] -= 1\r\n n -= 1\r\n aC = sorted(aC, reverse=True)\r\nprint(_max, _min)", "n , m = list(map(int,input().split()))\r\na = list(map(int , input().split()))\r\nn1 = n\r\ns1 = 0\r\ns2 = 0\r\na = sorted(a)\r\nb = a[::-1]\r\nwhile n > 0:\r\n if(a[0] > 0):\r\n n-=1\r\n s1 += a[0]\r\n a[0]-=1\r\n else:\r\n del a[0]\r\n n -= 1\r\n s1 += a[0]\r\n a[0]-=1\r\n\r\nwhile n1 > 0:\r\n if(b[0] > 0):\r\n n1-=1\r\n s2 += b[0]\r\n b[0] -= 1\r\n else:\r\n del b[0]\r\n n1 -= 1\r\n s2 += b[0]\r\n b[0]-=1 \r\n b = sorted(b)\r\n b = b[::-1]\r\nprint(str(s2) + ' ' + str(s1))", "n,m = map(int, input().split())\r\nplane = list(map(int, input().split()))\r\nmin_plane, max_plane = [], []\r\nmin_plane[:], max_plane[:] = plane, plane\r\nmax_plane = [-1*i for i in max_plane]\r\nfrom heapq import heapify, heappop, heappush\r\nheapify(min_plane)\r\nheapify(max_plane)\r\nans_min = 0\r\nans_max = 0\r\nfor i in range(n):\r\n\ttemp = heappop(min_plane)\r\n\tans_min += temp\r\n\tif temp-1 != 0:\r\n\t\theappush(min_plane, temp-1)\r\n\r\n\ttemp = abs(heappop(max_plane))\r\n\tans_max += temp\r\n\tif temp-1 != 0:\r\n\t\theappush(max_plane, -1*(temp-1))\r\nprint(ans_max, ans_min)\r\n", "n, m = map(int, input().split(' '))\r\n\r\na = list(map(int, input().split(' ')))\r\n\r\na_ = sorted(a)\r\n\r\nmax_, min_ = 0, 0\r\ni, j = 0, 0\r\nfor i in range(n):\r\n\r\n if a_[j] > 0:\r\n min_ += a_[j]\r\n a_[j] -= 1\r\n else:\r\n j += 1\r\n min_ += a_[j]\r\n a_[j] -= 1\r\n\r\n\r\n\r\n\r\n\r\nfor i in range(n):\r\n max_a = max(a)\r\n argmax = a.index(max_a)\r\n max_ += max_a\r\n a[argmax] -= 1\r\n\r\nprint(max_, min_)", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl1=l.copy()\r\nmx=0\r\nj=n\r\nwhile sum(l) and n:\r\n p=max(l)\r\n mx+=p\r\n i=l.index(p)\r\n l[i]=l[i]-1\r\n n-=1\r\nmn=0\r\nl1.sort()\r\nu=0\r\nwhile j:\r\n while l1[u] and j:\r\n mn+=l1[u]\r\n l1[u]-=1\r\n j-=1\r\n u+=1\r\n\r\nprint(mx,mn)", "import heapq\r\n\r\ndef sol(tmp,x,y):\r\n s=[0,0]\r\n while tmp:\r\n tmp-=1\r\n t=heapq.heappop(x)\r\n u=y.pop()\r\n s[0]+=t\r\n s[1]+=u\r\n t-=1\r\n u-=1\r\n y.append(u)\r\n y.sort()\r\n if t: heapq.heappush(x,t)\r\n return s\r\n\r\n\r\nn,m=map(int,input().split())\r\na=[]\r\nl=[heapq.heappush(a,int(i)) for i in input().split()]\r\nb=a[:]\r\nb.sort()\r\nans=sol(n,a,b)\r\nprint(ans[1],ans[0])", "#https://codeforces.com/problemset/problem/218/B\r\n#min heap for minimim \r\n#max heap for maximum\r\nimport heapq\r\nn , m =map(int,input().split()) \r\nl =list(map(int,input().split()))\r\nh1=[]\r\nh2=[]\r\nheapq.heapify(h1)\r\nfor i in l:\r\n heapq.heappush(h1,i)\r\n heapq.heappush(h2,-i)\r\ns1=0 \r\ns2 =0 \r\n\r\nc1=0\r\nc2=0 \r\nwhile(c1<n and c2<n):\r\n z=heapq.heappop(h1)\r\n z2=-heapq.heappop(h2)\r\n s1+=z \r\n s2+=z2\r\n if z>1:\r\n heapq.heappush(h1,z-1)\r\n if z2>1:\r\n heapq.heappush(h2,-(z2-1))\r\n c1+=1 \r\n c2+=1\r\nprint(s2,s1)\r\n", "n, m = [int(i) for i in input().split()]\na = [int(i) for i in input().split()]\nmin_ans = 0\ntmp = list(a)\nnn = n\nwhile nn > 0:\n k = min(tmp)\n if k <= nn:\n min_ans += (1+k)*k//2\n tmp.remove(k)\n nn -= k\n else:\n min_ans += (k+k-nn+1)*nn//2\n nn = 0\nmax_ans = 0\ntmp = list(a)\nnn = n\nwhile nn > 0:\n nn -= 1\n index = max(tmp)\n max_ans += index\n index = tmp.index(index)\n if tmp[index] == 1:\n del(tmp[index])\n else:\n tmp[index] -= 1\nprint(max_ans, min_ans)\n", "import re\r\nimport sys\r\nfrom bisect import bisect, bisect_left, insort, insort_left\r\nfrom collections import Counter, defaultdict, deque\r\nfrom copy import deepcopy\r\nfrom decimal import Decimal\r\nfrom itertools import (\r\n accumulate, combinations, combinations_with_replacement, groupby,\r\n permutations, product)\r\nfrom math import (acos, asin, atan, ceil, cos, degrees, factorial, gcd, hypot,\r\n log2, pi, radians, sin, sqrt, tan)\r\nfrom operator import itemgetter, mul\r\nfrom string import ascii_lowercase, ascii_uppercase, digits\r\n\r\n\r\ndef inp():\r\n return(int(input()))\r\n\r\n\r\ndef inlist():\r\n return(list(map(int, input().split())))\r\n\r\n\r\ndef instr():\r\n s = input()\r\n return(list(s[:len(s)]))\r\n\r\n\r\ndef invr():\r\n return(map(int, input().split()))\r\n\r\n\r\nn, m = invr()\r\na = inlist()\r\nb = a[:]\r\n\r\npassenger = n\r\nr1 = 0\r\nwhile passenger > 0:\r\n\r\n temp = max(a)\r\n r1 += temp\r\n passenger -= 1\r\n ind = a.index(temp)\r\n a[ind] -= 1\r\nr2 = 0\r\n\r\nwhile n > 0:\r\n\r\n temp = min(b)\r\n r2 += temp\r\n n -= 1\r\n ind = b.index(temp)\r\n if temp < 2:\r\n b[ind] = 1000000000\r\n else:\r\n b[ind] -= 1\r\nprint(r1, r2)\r\n", "#B. Airport\r\nm,n = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = [i for i in a]\r\nm1 = m\r\nmx = 0\r\nmn = 0\r\nwhile True:\r\n if m==0 or max(a)==0:\r\n break\r\n else:\r\n t = max(a)\r\n i = a.index(t)\r\n mx += a[i]\r\n a[i] -= 1\r\n m -= 1\r\nb.sort()\r\nfor i in range(n):\r\n if m1==0:\r\n break\r\n while m1>0 and b[i]>0:\r\n mn += b[i]\r\n b[i] -= 1\r\n m1 -= 1\r\nprint(mx,mn)", "def Airport():\r\n numPassengers , numPlanes = map(int, input().split())\r\n emptySeats = list(map(int, input().split()))\r\n\r\n sortedSeats = sorted(emptySeats)\r\n\r\n minimum_revenue = 0\r\n maximum_revenue = 0\r\n\r\n placed_min = 0\r\n while placed_min < numPassengers:\r\n #print(minimum_revenue)\r\n minimum_revenue += sortedSeats[0]\r\n sortedSeats[0] -= 1\r\n if sortedSeats[0] == 0:\r\n sortedSeats.pop(0)\r\n placed_min += 1\r\n\r\n placed_max = 0\r\n\r\n sortedSeats = sorted(emptySeats, reverse=True)\r\n while placed_max < numPassengers:\r\n maximum_revenue += sortedSeats[0]\r\n sortedSeats[0] -= 1\r\n sortedSeats = sorted(sortedSeats, reverse=True)\r\n placed_max += 1\r\n\r\n print(\"{} {}\".format(maximum_revenue, minimum_revenue))\r\n\r\n\r\nAirport()", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nempty = a.copy()\r\n\r\n_min = 0\r\nfor i in range(n):\r\n pos = 0\r\n while empty[pos] == 0:\r\n pos += 1\r\n for j in range(pos+1, m):\r\n if empty[j] != 0 and empty[j] < empty[pos]:\r\n pos = j\r\n _min += empty[pos]\r\n empty[pos] = max(0, empty[pos] - 1)\r\n\r\n_max = 0\r\nempty = a.copy()\r\nfor i in range(n):\r\n pos = 0\r\n while empty[pos] == 0:\r\n pos += 1\r\n for j in range(pos+1, m):\r\n if empty[j] > empty[pos]:\r\n pos = j\r\n _max += empty[pos]\r\n empty[pos] = max(0, empty[pos] - 1)\r\n\r\nprint(_max, _min)", "from heapq import heapify, heappop as hpop, heappush as hpush\r\n\r\nn, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\nminheap = arr.copy()\r\nmaxheap = [-1*i for i in arr]\r\n\r\nheapify(minheap)\r\nheapify(maxheap)\r\n\r\nminsum, maxsum = 0,0\r\nfor i in range(n):\r\n minel = hpop(minheap)\r\n maxel = -1*hpop(maxheap)\r\n minsum += minel\r\n maxsum += maxel\r\n if minel > 1:\r\n hpush(minheap, minel-1)\r\n if maxel > 1:\r\n hpush(maxheap, -1*(maxel - 1))\r\nprint(maxsum, minsum)\r\n", "n, m = map(int, input().split())\r\nseats = list(map(int, input().split()))\r\nnseats = seats.copy()\r\nmaxi = 0\r\nmini = 0\r\n\r\nfor i in range(n):\r\n a = max(seats)\r\n maxi += a\r\n seats[seats.index(a)] = a-1\r\n\r\nfor j in range(n):\r\n b = min(nseats)\r\n mini += b\r\n nseats[nseats.index(b)] = b-1 \r\n if (0 in nseats) == True:\r\n nseats.remove(0)\r\n\r\nprint(maxi, mini)", "n,m = map(int,input().split())\r\nplanes = sorted(map(int,input().split()))\r\nplanes2 = []; planes2.extend(planes)\r\nhead,tail,mi,mx,st = 0,m-1,0,0,n\r\nwhile st:\r\n if planes[head]:\r\n mi+=planes[head]; planes[head] -= 1;\r\n else:\r\n head+=1; mi+=planes[head]; planes[head]-= 1\r\n st-=1\r\nwhile n:\r\n if planes2[tail] == planes2[(tail+m-1)%m]:\r\n mx += planes2[tail]; planes2[tail]-=1\r\n tail = (tail+m-1)%m\r\n elif planes2[tail] > planes2[(tail+m-1)%m]:\r\n mx += planes2[tail]; planes2[tail]-=1\r\n tail = m-1\r\n n-=1\r\nprint(mx,mi)", "n, m = map(int, input().split())\nx = list(map(int, input().split()))\na = x.copy()\nx.sort()\nmin_ans, max_ans = 0, 0\nk = 0\nabacaba = 1001 * [0]\nfor _ in range(m):\n abacaba[x[_]] += 1\nfor j in range(n):\n if x[k] != 0:\n min_ans += x[k]\n x[k] -= 1\n else:\n k += 1\n min_ans += x[k]\n x[k] -= 1\nfor i in range(1, 1002):\n if abacaba[-i] != 0 and i != 1001:\n while n > 0 and abacaba[-i] > 0:\n max_ans += 1001 - i\n abacaba[-i] -= 1\n abacaba[-i - 1] += 1\n n -= 1\nprint(max_ans, min_ans)\n", "n,m = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nl = sorted(l)\r\nk=[]\r\ni=0\r\nwhile m:\r\n for j in range(l[i],0,-1):\r\n k.append(j)\r\n i+=1\r\n m-=1\r\nprint(sum(sorted(k,reverse=True)[:n]),sum(k[:n]))", "from heapq import heappop, heappush, heapify\r\n\r\n\r\n\r\n\r\nn,m = map(int,input().split())\r\n\r\nseatsInPlane = list(map(int,input().split()))\r\n\r\nminHeap = seatsInPlane[:]\r\n\r\nmaxHeap = seatsInPlane[:]\r\n\r\nfor i in range(len(maxHeap)):\r\n maxHeap[i] = -1* maxHeap[i]\r\n\r\nheapify(minHeap)\r\nheapify(maxHeap)\r\n\r\n\r\n'''\r\nprint(n)\r\nprint(m)\r\nprint(seatsInPlane)\r\nprint(minHeap)\r\nprint(maxHeap)\r\n'''\r\n\r\n\r\nminPrice = 0\r\nfor i in range(n):\r\n element = heappop(minHeap)\r\n minPrice+=element\r\n\r\n if element-1>0:\r\n heappush(minHeap,element-1)\r\n\r\n\r\nmaxPrice = 0\r\nfor i in range(n):\r\n element = -1* heappop(maxHeap)\r\n maxPrice+=element\r\n\r\n if element-1>0:\r\n heappush(maxHeap,-1*(element-1))\r\n\r\n\r\nprint(\"{} {}\".format(maxPrice,minPrice))\r\n\r\n\r\n\r\n \r\n\r\n\r\n", "import queue;\n\nq = queue.PriorityQueue();\n\n\n\nk, n = map(int, input().split())\na = sorted(list(map(int, input().split())))\n\nq = queue.PriorityQueue();\nfor x in a:\n q.put(-x)\n\nmx = 0;\nmn = 0;\nfor i in range(0, k):\n x = -q.get();\n #print(q.qsize())\n mx += x;\n q.put(-(x - 1));\n\ncur = 0;\nfor i in range(0, k):\n if a[cur] == 0:\n cur += 1;\n mn += a[cur];\n a[cur] -= 1;\n\n \n\nprint(mx, mn);\n\n\n\n\n\n\n\n", "n, m = map(int, input().split())\r\n\r\nAMAX = list(map(int, input().split()))\r\n\r\nAMIN = []\r\nfor i in range(len(AMAX)):\r\n AMIN.append(AMAX[i])\r\n\r\n\r\nMAX = 0\r\nMIN = 0\r\n\r\n# MAX\r\nfor i in range(n):\r\n max_index = 0\r\n amax = AMAX[0]\r\n for j in range(m):\r\n if AMAX[j] > amax:\r\n max_index = j\r\n amax = AMAX[j]\r\n AMAX[max_index] -= 1\r\n MAX += amax \r\n\r\n# MIN\r\nfor i in range(n):\r\n amin = 999999999999\r\n min_index = -1\r\n for j in range(m):\r\n if AMIN[j] < amin and AMIN[j] != 0:\r\n min_index = j\r\n amin = AMIN[j]\r\n AMIN[min_index] -= 1\r\n MIN += amin\r\n\r\nprint(MAX, MIN)", "I=lambda:list(map(int,input().split()))\r\nn,m=I();a=sorted(I());b=[]\r\nfor i in a:b+=list(range(1,i+1))\r\nb=sorted(b)\r\ni=mini=p=0\r\nwhile((i<m)and(p+a[i]<=n)):\r\n p+=a[i]\r\n mini+=(1+a[i])*a[i]//2\r\n i+=1\r\nif p<n: mini+=(2*a[i]-n+p+1)*(n-p)//2\r\nprint(sum(b[-n:]),mini)", "def result(n,m,lis):\n\tk=lis\n\tp=tuple(k)\n\tmaxx=0\n\tfor i in range(n):\n\t\ta=max(k) \n\t\tb=k.index(a)\n\t\tmaxx+=a \n\t\tk[b]=a-1\n\tp=list(p)\n\tminn=0\n\ti=0\n\tc=0\n\twhile i<n:\n\t\tif len(p)==0 or c==n:\n\t\t\tbreak\n\t\ta=min(p)\n\t\tb=p.index(a)\n\t\tif a==0:\n\t\t\tp.pop(b)\n\t\t\ti+=1\n\t\t\tcontinue\t\n\t\tminn+=a\n\t\tc+=1\n\t\tp[b]=a-1\n\ti+=1\t\n\tprint(maxx,minn)\t\t\n\t\n\t\t\n\n\n\n\n\nn,m=map(int,input().split())\nlis=list(map(int,input().split())) \ng=lis\nresult(n,m,lis)\n", "def maximum(lst,n):\r\n amount = 0\r\n for _ in range(n):\r\n maxempty = max(lst)\r\n amount += maxempty\r\n lst[lst.index(maxempty)] -= 1\r\n return amount\r\n\r\ndef minimum(anotherlst,n):\r\n amount = 0\r\n count = n\r\n while count:\r\n minempty = min(anotherlst)\r\n if minempty<=0:\r\n anotherlst.remove(minempty)\r\n continue\r\n amount += minempty\r\n anotherlst[anotherlst.index(minempty)] -= 1\r\n count -= 1\r\n return amount\r\n\r\nn,m = tuple([int(item) for item in input().split()])\r\nlst = [int(item) for item in input().split()]\r\nanotherlst = lst.copy()\r\nprint(maximum(lst,n),end=' ')\r\nprint(minimum(anotherlst,n))", "n, m = map(int, input().split())\r\nN = n\r\na = [int(x) for x in input().split()]\r\na.sort()\r\nA = a.copy()\r\n\r\nminimum = 0\r\ni = 0\r\n\r\nfor i in range(m):\r\n while n > 0 and a[i] > 0:\r\n n -= 1\r\n minimum += a[i]\r\n a[i] -= 1\r\n if n == 0:\r\n break\r\n\r\n\r\nn = N\r\na = A\r\nmaximum = 0\r\n\r\nwhile len(a) > 0:\r\n if a[-1] > 0:\r\n maximum += a[i]\r\n a[-1] -= 1\r\n n -= 1\r\n if n == 0:\r\n break\r\n a.sort()\r\n else:\r\n break\r\n\r\nprint(maximum, minimum)\r\n", "#!/usr/bin/env python3\n\nif __name__ == \"__main__\":\n\tn, m = map(int, input().split())\n\tais = list(map(int, input().split()))\n\tris = sorted(ais, reverse=True)\n\tais.sort()\n\tmaxx = 0\n\tminn = 0\n\tfor _ in range(n):\n\t\tmaxx += ris[0]\n\t\tris[0] -= 1\n\t\ti = 0\n\t\twhile i < m - 1 and ris[i] < ris[i + 1]:\n\t\t\tris[i], ris[i+1] = ris[i+1], ris[i]\n\t\t\ti += 1\n\ti = 0\n\twhile n > 0:\n\t\tminn += ais[i]\n\t\tais[i] -= 1\n\t\tn -= 1\n\t\tif ais[i] <= 0:\n\t\t\ti += 1\n\t\t\t\n\tprint(maxx, minn)\t\t\n\t\n\t\n", "#!/usr/bin/env python\n# -*- coding: utf-8 -*-\n#\n# airport.py\n# \n# Copyright 2018 alfroot <alf@alf>\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\n\ndef main():\n\t\n\tlin1 = input().split()\n\t\n\tcli = int(lin1[0])\n\tpla = int(lin1[1])\n\tvac = list()\n\t\n\tvac = list(map(int,input().split()))\n\t\n\thi = 0\n\tlo = 0\n\tvac_hi = list(vac)\n\tvac_lo = list(vac)\n\t\n\tfor i in range(cli):\n\t\tvac_hi.sort(reverse=True)\n\t\thi = hi+vac_hi[0]\n\t\tvac_hi[0] = vac_hi[0]-1\n\t\n\tfor i in range(cli):\n\t\tvac_lo.sort()\n\t\twhile(vac_lo[0]==0):\n\t\t\tvac_lo.remove(0)\n\t\tlo = lo+vac_lo[0]\n\t\tvac_lo[0] = vac_lo[0]-1\n\t\n\tprint(hi)\n\t\n\tprint(lo)\n\t\n\treturn 0\n\nif __name__ == '__main__':\n\tmain()\n\n", "\r\n\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nmaxi=0\r\nmini=0\r\nb=list(sorted(b))\r\nc=list(b)\r\n#print(b)\r\nfor i in range(a[0]):\r\n if b[0]==0:\r\n b.pop(0)\r\n mini=mini+b[0]\r\n b[0]=b[0]-1\r\n b=list(sorted(b))\r\n #print(b,' !!!')\r\nfor i in range(a[0]):\r\n if c[0]==0:\r\n c.pop(0)\r\n maxi=maxi+c[-1]\r\n c[-1]=c[-1]-1\r\n c=list(sorted(c))\r\n #print(c,maxi)\r\nprint(maxi,mini)", "n,m=map(int , input().split())\r\nls=list(map(int , input().split()))\r\nls_min=sorted(ls)\r\nls_max=sorted(ls,reverse=True)\r\nsm_max=0\r\nsm_min=0\r\n\r\nindx=0\r\nix=0\r\nfor i in range(n):\r\n ls_min = sorted(ls_min)\r\n ls_max = sorted(ls_max, reverse=True)\r\n\r\n sm_max+=ls_max[0]\r\n ls_max[0]-=1\r\n\r\n sm_min+=ls_min[0]\r\n ls_min[0]-=1\r\n\r\n if ls_min[0]==0:\r\n ls_min=ls_min[1:]\r\nprint(sm_max,sm_min)\r\n\r\n", "f=[]\r\nn,m=[int(x) for x in input().split()]\r\nf=[int(x) for x in input().split()]\r\nz=[i for i in f]\r\ncostumax=0\r\nfor i in range(n):\r\n #for i in f:\r\n # if i<=0:f.remove(i)\r\n x=sorted(f,reverse=True)\r\n #print(x)\r\n costumax=costumax+x[0]\r\n f[f.index(max(f))]=max(f)-1\r\ncostumin=0\r\nfor i in range(n):\r\n for i in z:\r\n if i<=0:z.remove(i)\r\n x=sorted(z)\r\n #print(x)\r\n costumin=costumin+x[0]\r\n z[z.index(min(z))]=min(z)-1 \r\n \r\nprint(costumax,costumin)", "n, m = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\nmmin = 0\r\nmmax = 0\r\na_min = a.copy()\r\na_max = a.copy()\r\nfor i in range(n):\r\n #print(a_min, a_max, mmin, mmax)\r\n new_amin = []\r\n for el in a_min:\r\n if el > 0:\r\n new_amin.append(el)\r\n #print(new_amin)\r\n a_min = new_amin\r\n #print(a_min, a_max, mmin, mmax)\r\n a_mmax = max(a_max)\r\n a_mmin = min(a_min)\r\n if a_mmax > 0:\r\n mmax += a_mmax\r\n ind = a_max.index(a_mmax)\r\n a_max[ind] -= 1\r\n if a_mmin > 0:\r\n mmin += a_mmin\r\n ind = a_min.index(a_mmin)\r\n a_min[ind] -= 1\r\nprint(mmax, mmin)", "n,m = map(int,input().split())\r\n\r\nl = list(map(int, input().split()))\r\np = l\r\nq = l\r\n\r\nmin,max = [0,0]\r\n\r\nfor i in range(n):\r\n p = sorted(p)\r\n q = sorted(q,reverse=True)\r\n\r\n max+=q[0]\r\n q[0]-=1\r\n\r\n min+=p[0]\r\n p[0]-=1\r\n\r\n while 0 in p: p.remove(0)\r\n while 0 in q: q.remove(0)\r\n\r\nprint(max,min)", "n,m=map(int,input().split())\r\nT=list(map(int,input().split()))\r\nM=T[::]\r\nN=T[::]\r\nN.sort()\r\nMax=0\r\nMin=0\r\na=n\r\nwhile a>0:\r\n if N[0]==0:\r\n N.pop(0)\r\n Min+=N[0]\r\n N[0]-=1\r\n a-=1\r\nwhile n>0:\r\n M.sort(reverse=True)\r\n Max+=M[0]\r\n M[0]-=1\r\n n-=1\r\nprint(Max,Min)", "import sys\r\n\r\ndef find_max_and_min(n, m, empty_seats_planes):\r\n maximum, minimum = 0, 0\r\n temp = empty_seats_planes[0]\r\n k = 0\r\n for i in range(n):\r\n minimum += temp\r\n temp -= 1\r\n if temp == 0:\r\n k += 1\r\n if k < m:\r\n temp = empty_seats_planes[k]\r\n empty_seats_planes.sort(reverse = True)\r\n while n > 0:\r\n maximum += empty_seats_planes[0]\r\n empty_seats_planes[0] -= 1\r\n for i in range(1, m):\r\n if empty_seats_planes[i] <= empty_seats_planes[i - 1]:\r\n break\r\n empty_seats_planes[i], empty_seats_planes[i - 1] = empty_seats_planes[i - 1], empty_seats_planes[i]\r\n n -= 1\r\n return maximum, minimum\r\n\r\ndef main():\r\n n, m = map(int, sys.stdin.readline().split())\r\n empty_seats_planes = [int(a) for a in sys.stdin.readline().split()]\r\n empty_seats_planes.sort()\r\n maximum, minimum = find_max_and_min(n, m, empty_seats_planes)\r\n print(maximum, minimum)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "pp = [int(item) for item in input().split()]\ns = [int(item) for item in input().split()]\ns1 = s.copy()\nmax1 = 0\nmin1 = 0\ni = 0\nj=0\nwhile i < pp[0]:\n s.sort(reverse=True)\n max1 += s[0]\n s[0] = s[0]- 1\n i+=1\nwhile j < pp[0]:\n s1.sort()\n if s1[0] == 0:\n s1.remove(0)\n else:\n min1 += s1[0]\n s1[0] = s1[0]-1\n j+=1\nprint(max1, min1)\n\t\t\t\t \t \t\t \t\t\t \t \t\t \t\t", "n, m= map(int, input().split())\r\nl= list(map(int, input().split()))\r\nl1= sorted(l, reverse= True)\r\nl2= sorted(l)\r\nsum1, sum2= 0, 0\r\n\r\nfor i in range(n):\r\n sum1+= l1[0]\r\n l1[0]= l1[0]-1\r\n l1= sorted(l1, reverse= True)\r\n\r\nfor i in range(n):\r\n sum2+= l2[0]\r\n l2[0]= l2[0]-1\r\n if l2[0]== 0:\r\n l2.pop(0)\r\n l2= sorted(l2)\r\n\r\nprint(sum1, sum2)\r\n", "from queue import PriorityQueue as PQ\nn, m = [int(x) for x in input().split()]\na = sorted([int(x) for x in input().split()])\nansmin = 0\nansmax = 0\ntmp = n\nfor x in a:\n\twhile tmp and x:\n\t\tansmin += x\n\t\tx -= 1\n\t\ttmp -= 1\ntmp = n\nq = PQ()\nfor x in a:\n\tq.put(-x)\nfor i in range(n):\n\tx = q.get()\n\tansmax += -x\n\tq.put(x + 1)\nprint(ansmax, ansmin)\n", "n, m = [int(x) for x in input().split()]\r\nli = list(map(int, input().split()))\r\nl = []\r\nfor i in range(m):\r\n l.append(li[i])\r\nnum1 = 0\r\nfor i in range(n):\r\n a = max(li)\r\n j = li.index(a)\r\n num1 += a\r\n li[j] -= 1\r\nl.sort()\r\np = 0\r\nnum2 = 0\r\nwhile p < n:\r\n if n - p <= l[0]:\r\n num2 += (n - p) * l[0] - (n - p) * (n - p - 1)/2\r\n p += n - p\r\n l = l[1:]\r\n else:\r\n num2 += l[0] * (l[0] + 1)/2\r\n p += l[0]\r\n l = l[1: ]\r\nlst = [str(int(num1)), str(int(num2))]\r\nprint(' '.join(lst))\r\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=[]\r\nfor i in range(m):\r\n b.append(a[i])\r\nans1=0\r\nans2=0\r\nwhile n>0:\r\n a.sort();a.reverse()\r\n n-=1\r\n ans1+=a[0]\r\n a.insert(1,a[0]-1)\r\n a.remove(a[0])\r\n\r\n b.sort()\r\n ans2+=b[0]\r\n if b[0]-1==0:\r\n b.remove(b[0])\r\n else:\r\n b.insert(1,b[0]-1)\r\n b.remove(b[0]) \r\nprint(ans1,ans2)\r\n \r\n", "II = lambda: list(map(int, input().split()))\r\nn, m = II()\r\nA = sorted(II())\r\nB = A[:]\r\npass_left = n\r\nm, M = 0, 0\r\nwhile pass_left > 0:\r\n least = min(A)\r\n low_ind = A.index(least)\r\n m += least\r\n A[low_ind] -= 1\r\n pass_left -= 1\r\n if A[low_ind] == 0:\r\n del A[low_ind]\r\npass_left = n\r\nwhile pass_left > 0:\r\n most = max(B)\r\n high_ind = B.index(most)\r\n M += most\r\n B[high_ind] -= 1\r\n pass_left -= 1\r\n if B[high_ind] == 0:\r\n del B[high_ind]\r\nprint(M, m)\r\n", "if __name__ == '__main__':\r\n Y = lambda: list(map(int, input().split()))\r\n P = lambda: map(int, input().split())\r\n N = lambda: int(input())\r\n\r\n n, m = P()\r\n a = Y()\r\n b = a.copy()\r\n x, y = 0, 0\r\n\r\n for i in range(n):\r\n a.sort()\r\n x += a[m - 1]\r\n if b[0] == 0:\r\n b[0] = 1001\r\n b.sort()\r\n y += b[0]\r\n a[m - 1] -= 1\r\n b[0] -= 1\r\n print(x, y)", "def res(x):\r\n temp1 = [k for k in range(1, x + 1)]\r\n return sum(temp1)\r\n\r\n\r\nn, m = map(int, input().split())\r\nn1 = n\r\nplanes = list(map(int, input().split()))\r\nif m == 1:\r\n res = 0\r\n for i in range(n):\r\n res += planes[0]\r\n planes[0] -= 1\r\n print(res, res)\r\nelse:\r\n planes1 = planes\r\n planes.sort(reverse=True)\r\n cost_max = []\r\n if sum(planes) == n:\r\n li = list(map(res, planes))\r\n print(sum(li), sum(li))\r\n else:\r\n temp_range = []\r\n for i in range(m):\r\n for j in range(planes[i], -1, -1):\r\n temp_range.append(j)\r\n temp_range.sort(reverse=True)\r\n cost_max = 0\r\n for i in range(n):\r\n cost_max += temp_range[i]\r\n planes1.sort()\r\n temp_min = []\r\n for i in range(m):\r\n if sum(temp_min) >= n:\r\n break\r\n if planes1[i] < n1:\r\n temp_min.append(planes1[i])\r\n n1 -= planes[i]\r\n elif planes[i] >= n1:\r\n temp_min.append(n1)\r\n cost_min = []\r\n # print(temp_min)\r\n for i in range(len(temp_min)):\r\n if len(cost_min) == n:\r\n break\r\n if temp_min[i] == planes1[i]:\r\n temp = list(range(1, temp_min[i] + 1))\r\n for j in range(len(temp)):\r\n cost_min.append(temp[j])\r\n elif temp_min[i] < planes1[i]:\r\n temp = list(range(planes1[i], planes1[i] - temp_min[i], -1))\r\n for j in range(len(temp)):\r\n cost_min.append(temp[j])\r\n # print(cost_max, cost_min)\r\n print(cost_max, sum(cost_min))\r\n", "import heapq\r\nn, p = tuple(map(lambda x: int(x), input().split()))\r\n\r\narr = list(map(lambda x: -1*int(x), input().split()))\r\nMin, Max = 0, 0\r\n\r\narr2 = list(map(lambda x: -x, arr))\r\nheapq.heapify(arr2)\r\n\r\nfor i in range(n):\r\n\tt = heapq.heappop(arr2)\r\n\tMin += t\r\n\t# print(\"t: \", t)\r\n\tif(t - 1 > 0):\r\n\t\theapq.heappush(arr2, t-1)\r\n\r\nheapq.heapify(arr)\r\n\r\nfor i in range(n):\r\n\tt = heapq.heappop(arr)\r\n\tMax += -t\r\n\tif(t + 1 < 0):\r\n\t\theapq.heappush(arr, t+1)\r\n\r\nprint(Max, Min)", "a = list(map(int, input().strip().split()))\r\nl = list(map(int, input().strip().split()))\r\nj = l.copy()\r\nsmin = 0\r\nsmax = 0\r\ni = 1\r\nwhile i <= a[0]:\r\n p = l.index(min(l))\r\n if l[p]<1:\r\n l.pop(p)\r\n \r\n \r\n smin += min(l)\r\n l[l.index(min(l))] -= 1\r\n i+=1\r\ni = 1\r\nwhile i <= a[0]:\r\n \r\n \r\n smax += max(j)\r\n j[j.index(max(j))] -= 1\r\n i+=1\r\n\r\nprint(smax,smin)\r\n ", "n,m = tuple(map(int,input().split()))\r\nlst = list(map(int,input().split()))\r\nlst2 = lst.copy()\r\ncount_max = 0\r\ncount_min = 0\r\nwhile(n):\r\n count_max += max(lst)\r\n lst[lst.index(max(lst))] -= 1\r\n if(min(lst2) !=0 ):\r\n count_min += min(lst2)\r\n lst2[lst2.index(min(lst2))] -= 1\r\n \r\n else:\r\n lst2.remove(min(lst2))\r\n count_min += min(lst2)\r\n lst2[lst2.index(min(lst2))] -= 1\r\n\r\n n -= 1;\r\nprint(count_max,count_min)", "n,t=map(int,input().split())\na = [int(a) for a in input().split()]\na1=sorted(a)\nk=0\nans1=0\nfor i in a1:\n if(k+i<n):\n k+=i\n ans1+=int((i*(i+1))/2)\n # print(\"ans->\",ans1,k)\n else:\n a=n-k\n ans1+=a*i-int(a*(a-1)/2)\n break\n\nans2=0\nfrom heapq import heappop,heapify,heappush\nmx=[]\nheapify(mx)\nfor i in a1:\n heappush(mx,-i)\nfor i in range(n):\n a=-1*heappop(mx)\n ans2+=a\n if(a-1):\n heappush(mx,-(a-1))\n \nprint(ans2,ans1)\n# print(ans1)\n \n \n", "import heapq\nn,m=list(map(int,input().split()))\narray=list(map(int,input().split()))\n\nminHeap=array\nheapq.heapify(minHeap)\n\nmaxHeap=[-1*i for i in array]\nheapq.heapify(maxHeap)\n\nminProfit=0\nmaxProfit=0\n#print(minHeap,maxHeap)\nfor i in range(n):\n\tminTicket=heapq.heappop(minHeap)\n\tminProfit+=minTicket\n\tminTicket-=1\n\tif minTicket!=0:\n\t\theapq.heappush(minHeap,minTicket)\n\n\tmaxTicket=-1*heapq.heappop(maxHeap)\n\tmaxProfit+=maxTicket\n\tmaxTicket-=1\n\tif maxTicket!=0:\n\t\theapq.heappush(maxHeap,-1*maxTicket)\n\t#print(\"min->\",minHeap,minTicket,minProfit)\n\t#print(\"max->\",maxHeap,maxTicket,maxProfit)\nprint(maxProfit,minProfit)", "import heapq\n\nn, m = map(int, input().strip().split())\nseats = list(map(int, input().strip().split()))\ns2 = seats[:]\nseats = [-x for x in seats]\n\nmax_profit = 0\nheapq.heapify(seats)\nctr = n\nwhile ctr > 0 and len(seats):\n pr = heapq.heappop(seats)\n max_profit += (-pr)\n pr += 1\n if pr < 0:\n heapq.heappush(seats, pr)\n ctr -= 1\n\nctr = n\nmin_profit = 0\nheapq.heapify(s2)\nwhile ctr > 0 and len(s2):\n pr = heapq.heappop(s2)\n min_profit += pr\n pr -= 1\n if pr > 0:\n heapq.heappush(s2, pr)\n ctr -= 1\n\nprint(max_profit, min_profit)\n", "var = input().split(' ')\nnPassengers, nPlanes = int(var[0]), int(var[1])\n\narr = []\nvar = input().split(' ')\n\nfor i in range(len(var)):\n\tarr.append(int(var[i]))\n\ndesc = arr.copy()\ndesc.sort(reverse=True)\nasc = arr.copy()\nasc.sort()\n\nmax = 0\n\nfor i in range(nPassengers):\n\tmax = max + desc[0]\n\tdesc[0] = desc[0] - 1\n\tif desc[0] == 0:\n\t\tdesc.pop(0)\n\tdesc.sort(reverse=True)\n\nmin = 0\n\nfor i in range(nPassengers):\n\tmin = min + asc[0]\n\tasc[0] = asc[0] - 1\n\tif asc[0] == 0:\n\t\tasc.pop(0)\n\tasc.sort()\n\nprint(str(max) + \" \" + str(min))\n\n \t \t\t\t\t\t\t\t\t \t\t\t\t \t\t\t\t \t \t\t", "import heapq\r\n\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nmin_heap, min_cost = [], 0\r\nmax_heap, max_cost = [], 0\r\nfor cost in a:\r\n heapq.heappush(min_heap, cost)\r\n heapq.heappush(max_heap, -cost) \r\n\r\nfor _ in range(n):\r\n x = heapq.heappop(min_heap)\r\n min_cost += x\r\n if x - 1 > 0:\r\n heapq.heappush(min_heap, x - 1)\r\n\r\n y = -heapq.heappop(max_heap)\r\n max_cost += y\r\n if y - 1 > 0:\r\n heapq.heappush(max_heap, -(y - 1))\r\nprint(\"{} {}\".format(max_cost, min_cost))", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\na.sort()\r\na2 = list(reversed(a))\r\nminimum = 0\r\nmaximum = 0\r\nn2 = n\r\n\r\ni = 0\r\nwhile n > 0 and i < len(a):\r\n if a[i] == 0:\r\n i += 1\r\n minimum += a[i]\r\n a[i] -= 1\r\n n -= 1\r\n\r\nwhile n2 > 0:\r\n value_underconsideration = a2[0]\r\n for i in range(len(a2)):\r\n if a2[i] >= value_underconsideration:\r\n if n2 <= 0: break\r\n maximum += a2[i]\r\n a2[i] -= 1\r\n n2 -= 1\r\n \r\nprint(maximum, minimum)\r\n \r\n ", "def max(h,s):\r\n m=0\r\n k=0\r\n for i in range(s-1,-1,-1):\r\n if m<=h[i]:\r\n m=h[i]\r\n k=i\r\n return k\r\ndef min(l,s):\r\n m=932199321937907213970709321321909730211230\r\n k=0\r\n i=0\r\n while(i<s):\r\n if l[i]<1:\r\n pass\r\n elif m>=l[i]:\r\n m=l[i]\r\n k=i\r\n i+=1\r\n return k\r\nm,s=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nh=sorted(l)\r\nl=h.copy()\r\nmaxx=0\r\nfor i in range(m):\r\n x=max(h,s)\r\n maxx+=h[x]\r\n h[x]-=1\r\nminnn=0\r\nfor i in range(m):\r\n x=min(l,s)\r\n minnn+=l[x]\r\n l[x]-=1\r\nprint(maxx,minnn)", "m,n = map(int,input().split())\r\nmp = m\r\narr = list(map(int,input().split()))\r\narr = sorted(arr)[::-1]\r\ncopy = [ele for ele in arr]\r\n# pref = [0]*len(arr)\r\n# pref[0] = arr[0]\r\n# for i in range(1,len(arr)):\r\n# pref[i]+=pref[i-1]+arr[i]\r\nmaxi = 0\r\nimport heapq\r\nheap = [-ele for ele in arr ]\r\nheapq.heapify(heap)\r\nwhile m:\r\n valeu = -heapq.heappop(heap)\r\n maxi +=valeu \r\n valeu-=1\r\n \r\n heapq.heappush(heap,-valeu)\r\n m-=1\r\nmini = 0\r\nimport heapq\r\nheap = [ele for ele in copy ]\r\nheapq.heapify(heap)\r\n#print(heap)\r\nm = mp\r\nwhile m:\r\n valeu = heapq.heappop(heap)\r\n mini+=valeu \r\n #print(mini,valeu)\r\n valeu-=1\r\n\r\n if valeu :heapq.heappush(heap,valeu)\r\n m-=1\r\nprint(maxi,mini)", "'''\r\n# Submitted By M7moud Ala3rj\r\nDon't Copy This Code, CopyRight . [email protected] © 2022-2023 :)\r\n'''\r\n# Problem Name = \"Airport\"\r\n# Class: B\r\n\r\nimport sys\r\n#sys.setrecursionlimit(2147483647)\r\ninput = sys.stdin.readline\r\ndef print(*args, end='\\n', sep=' ') -> None:\r\n sys.stdout.write(sep.join(map(str, args)) + end)\r\n\r\nclass PQueue:\r\n def __init__(self, elements : list = [], reverse : bool = False, key = None):\r\n elements = elements[:]\r\n if key:\r\n elements.sort(reverse=reverse, key = key)\r\n else:\r\n elements.sort(reverse=reverse)\r\n self.__key = key\r\n self.__reverse = reverse\r\n self.container = elements\r\n def enqueue(self, element):\r\n self.container.append(element)\r\n if self.__key:\r\n self.container.sort(reverse=self.__reverse, key = self.__key)\r\n else:\r\n self.container.sort(reverse=self.__reverse)\r\n def dequeue(self):\r\n return self.container.pop(0)\r\n def front(self):\r\n return self.container[0]\r\n def rear(self):\r\n return self.container[-1]\r\n def empty(self):\r\n return len(self.container)==0\r\n def __len__(self):\r\n return len(self.container)\r\n def __str__(self):\r\n return \"{0}\".format(self.container)\r\n\r\ndef Solve():\r\n n, m = list(map(int, input().split()))\r\n a = list(map(int, input().split()))\r\n maxi = PQueue(a, reverse=True)\r\n mini = PQueue(a)\r\n n2 = n\r\n max_, min_ = 0, 0\r\n while n > 0:\r\n x = maxi.dequeue()\r\n max_+=x\r\n x-=1\r\n if x:\r\n maxi.enqueue(x)\r\n \r\n n-=1\r\n \r\n while n2 > 0:\r\n x = mini.dequeue()\r\n min_+=x\r\n x-=1\r\n if x:\r\n mini.enqueue(x)\r\n \r\n n2-=1\r\n \r\n print(max_, min_)\r\n\r\nif __name__ == \"__main__\":\r\n Solve()", "x, y = map(int, input().split());\r\na = list(map(int, input().split()))\r\nb = a.copy()\r\n\r\nmxv = mmv = 0 \r\nfor i in range(x):\r\n a.sort()\r\n b.sort()\r\n # maximum\r\n mxv += a[-1]\r\n a[-1] = a[-1] -1 \r\n #minimum\r\n mmv += b[0]\r\n if(b[0] > 1 ):\r\n b[0] = b[0] -1\r\n else:\r\n b = b[1:]\r\n\r\nprint(mxv, mmv)", "n,m = input().split()\r\nn = int(n)\r\nm = int(m)\r\nlst = list(map(int, input().split()))\r\nlstcpy = lst.copy()\r\nmx = mn = 0\r\nfor i in range(n):\r\n lst.sort()\r\n lstcpy.sort()\r\n mn += lst[0]\r\n if lst[0] == 1:\r\n lst[0] = 100\r\n else:\r\n lst[0] -= 1\r\n mx += lstcpy[m-1]\r\n lstcpy[m-1] -= 1\r\n\r\nprint(mx,mn)\r\n", "n, m = map(int, input().split())\r\nlst = list(map(int, input().split()))\r\nlst2 = lst.copy()\r\n\r\nsum_min = 0\r\nsum_max = 0\r\n\r\nindex = 0\r\n\r\nfor i in range(n):\r\n max_value = max(lst)\r\n sum_max += max_value\r\n lst[lst.index(max_value)] -= 1 \r\n\r\nfor i in range(n):\r\n min_value = min(lst2)\r\n sum_min += min_value\r\n lst2[lst2.index(min_value)] -= 1 \r\n\r\n if 0 in lst2:\r\n lst2.remove(0)\r\n\r\nprint(sum_max, sum_min)", "n, m = input().split()\r\nqueue = input().split(' ')\r\n\r\nn = int(n)\r\nqueue1 = []\r\nqueue2 = []\r\nans1 = 0\r\nans2 = 0\r\n\r\nfor i in range(int(m)):\r\n queue1.append(int(queue[i]))\r\n queue2.append(int(queue[i]))\r\n \r\nqueue1.sort()\r\nqueue2.sort(reverse=True)\r\n\r\nwhile n > 0:\r\n ans1 += queue1[0]\r\n ans2 += queue2[0]\r\n queue1[0] -= 1\r\n queue2[0] -= 1\r\n if queue1[0] == 0:\r\n queue1.pop(0)\r\n if queue2[0] == 0:\r\n queue2.pop(0)\r\n queue2.sort(reverse=True)\r\n n -= 1\r\n\r\nprint(ans2, ans1)\r\n", "n,m=map(int,input().split())\r\nar=list(map(int,input().split()))\r\nd=ar.copy()\r\nk=n \r\ns=0\r\nwhile k>0:\r\n a=ar.index(max(ar))\r\n s+=ar[a]\r\n ar[a]-=1 \r\n k-=1\r\nprint(s,end=\" \")\r\nb=n \r\nv=0\r\nwhile b>0:\r\n a=d.index(min(d))\r\n v+=d[a]\r\n if d[a]>1:\r\n d[a]-=1 \r\n else:\r\n d[a]=10000\r\n b-=1 \r\nprint(v)" ]

[ "n=int(input())\r\nl=input().split(\" \")\r\nl=[int(x) for x in l]\r\nsquare_dict = {n: 1 for n in l}\r\ns={}\r\nminNum=min(l)\r\nfor i in l:\r\n # for j in range(len(l[i])):\r\n if i in s:\r\n key=i\r\n s[key]=s.setdefault(key, 0) + 1\r\n else:\r\n key=i\r\n s[key]=s.setdefault(key, 1)\r\nk=minNum\r\nif(s.get(k)>1):\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(l.index(minNum)+1)", "n = int(input())\r\ncities = list(map(int, input().split()))\r\n\r\nans_time = 10**10\r\nans = 0\r\n\r\nfor i in range(n):\r\n if cities[i] < ans_time:\r\n ans_time = cities[i]\r\n ans = i+1\r\n elif cities[i] == ans_time:\r\n ans = 'Still Rozdil'\r\n\r\nprint(ans)", "def main():\n num_towns = int(input())\n time_per_town = input().split()\n minimum = int(time_per_town[0])\n for i in range(len(time_per_town)):\n time_per_town[i] = int(time_per_town[i])\n if time_per_town[i] < minimum:\n minimum = time_per_town[i]\n count = 0\n index = 0\n for i in range(len(time_per_town)):\n if time_per_town[i] == minimum:\n count += 1\n index = i\n if count == 1:\n print(index + 1)\n else:\n print(\"Still Rozdil\")\nmain()\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\n\r\nk = min(l)\r\nif l.count(k) > 1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(l.index(k)+1)\r\n", "n = int(input())\narr = list(map(int,input().split()))\nmini = arr[0]\nindex = 0\nfor i in range(1, n):\n if(arr[i]<mini):\n mini = arr[i]\n index= i\nif(arr.count(mini)>1):\n print(\"Still Rozdil\")\nelse:\n print(index+1)\n", "import math\r\nfrom collections import Counter\r\n\r\nimport io, os\r\n\r\n\r\n# input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\n\r\n# for _ in range(int(input())):\r\nn = input()\r\nn = int(n)\r\narr = list(map(int, input().split()))\r\nm = arr.index(min(arr))\r\narr.sort()\r\nif n == 1:\r\n arr.append(10000000)\r\nif arr[0] == arr[1]:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(m+1)\r\n\r\n# for _ in range(int(input())):\r\n# grid = [list(map(int, input().split())) for _ in range(3)]\r\n# grid = [list(input()) for _ in range(n)]\r\n# result = [[1] * 3 for _ in range(3)]\r\n# n, s, r = map(int, input().split())\r\n# arr = list(map(int, input().split()))\r\n# n = input()\r\n# n = int(n)\r\n", "t = int(input())\r\ns = list(map(int,input().split()))\r\nm = min(s)\r\nif s.count(m)==1:\r\n\tprint(s.index(m)+1)\r\nelse:\r\n\tprint(\"Still Rozdil\")", "#For fast I/O\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nl = [int(i) for i in input().split()]\r\n\r\nsmol = min(l)\r\nif l.count(smol) == 1:\r\n\tprint(l.index(smol)+1)\r\nelse:\r\n\tprint(\"Still Rozdil\")\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nm = min(l)\r\nif l.count(m) > 1:\r\n print(\"Still Rozdil\" )\r\nelse:\r\n print((l.index(m) + 1))", "input()\r\nA = list(map(int, input().split()))\r\nx = min(A)\r\n\r\nprint(A.index(x)+1 if A.count(x) < 2 else 'Still Rozdil')", "def process():\r\n n = int(input())\r\n arr = list(map(int, input().split()))\r\n \r\n min_index = -1\r\n min_value = float('inf')\r\n count = 0\r\n \r\n for i in range(len(arr)):\r\n if arr[i] < min_value:\r\n min_value = arr[i]\r\n min_index = i\r\n count = 1\r\n elif arr[i] == min_value:\r\n count += 1\r\n \r\n if count == 1:\r\n print(min_index + 1)\r\n else:\r\n print('Still Rozdil')\r\n \r\nprocess()", "n = int(input())\r\na = list(map(int, input().split()))\r\ntarget = min(a)\r\ncnt = a.count(target)\r\nif cnt > 1:\r\n print('Still Rozdil')\r\nelse:\r\n print(a.index(target) + 1)", "n = int(input())\r\nl = list(map(int,input().split()))\r\nmi = min(l)\r\nif l.count(mi)==1:\r\n print(l.index(mi)+1)\r\nelse:\r\n print(\"Still Rozdil\")", "n = int(input())\r\ndistances = list(map(int, input().split()))\r\nmin = 1000000001\r\ncount = 0\r\nplace = 0\r\nfplace = 0\r\n\r\nfor distance in distances:\r\n place += 1\r\n if distance < min:\r\n min = distance\r\n fplace = place\r\n\r\nfor distance in distances:\r\n if distance == min:\r\n count += 1\r\n \r\nif count > 1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(fplace)\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nmin_el = min(a)\r\nans = a.count(min_el)\r\nif(ans>1):\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(a.index(min_el)+1)\r\n", "from collections import Counter\r\nn=int(input())\r\nk = list(map(int,input().split()))\r\nb = sorted(k)\r\n\r\ne = Counter(k)\r\n\r\nfirst = b[0]\r\n\r\nif e[b[0]]>1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(k.index(b[0])+1)\r\n\r\n", "n=int(input())\r\ntemp=list(map(int,input().split()))\r\nmin=min(temp)\r\nidx=0\r\nfor i,v in enumerate(temp):\r\n\tif v==min:\r\n\t\tidx=i\r\ntemp.remove(min)\r\nif min in temp:\r\n\tprint(\"Still Rozdil\")\r\nelse:\r\n\tprint(idx+1)\r\n\t", "n = int(input())\r\ntime = list(map(int, input().split()))\r\n\r\n\r\n\r\n\r\nt1 = min(time)\r\nif time.count(t1) == 1:\r\n print(time.index(t1)+1)\r\nelse:\r\n print(\"Still Rozdil\")", "n = int(input())\r\nL =list(map(int, input().split()))\r\nC = L.count(min(L))\r\nif C == 1:\r\n ind = L.index(min(L))\r\n print(ind + 1)\r\nelse:\r\n print(\"Still Rozdil\") ", "n = int(input())\r\nL = map(int , input().split())\r\nL = list(L)\r\nM = L.copy()\r\n# print(L,M,n)\r\nL.sort()\r\n# print(L,M,n)\r\ncount_min = 0\r\nflag = True\r\n# for i in L:\r\n# if L[0] == i:\r\n# count_min += 1\r\n# if count_min >= 2:\r\n# flag = False\r\n# break\r\ncount_min = L.count(min(L))\r\nif count_min > 1:\r\n flag = False\r\n\r\nif flag == False:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(M.index(min(M)) + 1 )", "n = int(input())\r\ns1 = input()\r\ns = s1.split()\r\ne = 0\r\nm = pow(10,9)+1\r\nfor i in range(0, n):\r\n if int(s[i]) <= m:\r\n m = int(s[i])\r\n t = i+1\r\n\r\nfor i in range(0, n):\r\n if int(s[i]) == m and i != t-1:\r\n e = 1\r\n break\r\nif e == 0:\r\n print(t)\r\nelse:\r\n print('Still Rozdil')", "input()\r\na = [int(ele) for ele in input().split()]\r\nl = min(a)\r\nif(a.count(l) > 1):\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(a.index(l)+1)", "number_of_cities= int(input())\nhours=list(map(int,(input().split())))\nhours2=min(hours)\nnumber=hours.count(hours2)\nif number==1:\n print(hours.index(hours2)+1)\nelse:\n print('Still Rozdil')\n\n \t \t\t\t \t\t \t \t \t \t\t \t", "n = int(input())\r\n\r\nf_line = input()\r\nf_arr = [int(y) for y in f_line.split()]\r\n\r\nmin_ele = min(f_arr)\r\n\r\nif f_arr.count(min_ele) > 1:\r\n print('Still Rozdil')\r\nelse:\r\n print(f_arr.index(min_ele) +1)", "'''\r\n >>>>>>>>>>>>>>>>>>>>>>>>>>> বিসমিল্লাহির রাহমানির রাহিম\r\n\r\n بِسْمِ ٱللَّٰهِ ٱلرَّحْمَٰنِ ٱلرَّحِيمِ <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<\r\n\r\n >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Bismillahir Rahmanir Rahim\r\n'''\r\n\r\n'''::::::::::_^_;;;;;;;;;;;;;;;;;;;;_^_%%%%%%%%%%%%%%%%_^_@@@@@@@@@@@@@@\r\n''::::::::::_^_;;;;;;;;;;;;;;;;;;;;_^_%%%%%%%%%%%%%%%%_^_@@@@@@@@@@@@@@@\r\n\r\n PROBLEM :A. Little Elephant and Rozdil\r\n SOLUTATOIN:........\r\n\r\n ========================================================================\r\n ========================================================================\r\n '''\t\t\t\r\ninput()\r\nn=list(map(int,input().split()))\r\nx=set(n)\r\ny=min(n)\r\nif n.count(y)>1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(n.index(y)+1)", "a=int(input())\r\nb=list(map(int,input().split()))\r\nc=min(b)\r\nif b.count(c)>1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(b.index(c)+1)", "z=input()\r\nx=*map(int,input().split()),\r\nc=min(x)\r\nprint([x.index(c)+1,'Still Rozdil'][x.count(c)>1])", "n = int(input())\r\nd = list(map(int, input().split()))\r\nif(d.count(min(d)) == 1):\r\n print(d.index(min(d)) + 1)\r\nelse:\r\n print(\"Still Rozdil\")", "input();*r,=map(int,input().split())\r\nprint(['Still Rozdil',r.index(min(r))+1][r.count(min(r))==1])", "x= int(input())\r\ny= input().split(\" \")\r\ncity_num = 0\r\nmini=0\r\nfor i in y:\r\n if int(i)<mini or mini==0:\r\n mini=int(i)\r\nfor j in y:\r\n if int(mini)==int(j):\r\n city_num+=1\r\n \r\n\r\nif city_num>1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(y.index(f\"{mini}\")+1)", "import collections\r\nfrom math import log2, log10, ceil\r\n\r\ndef pow2(n):\r\n t = 0\r\n while not(n&1):\r\n n = n//2\r\n t += 1\r\n return t\r\n\r\ndef solve():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n \r\n town = 1\r\n count = 1\r\n min = a[0]\r\n for i in range(1, n):\r\n if a[i] < min:\r\n min = a[i]\r\n town = i+1\r\n count = 1\r\n elif a[i] == min:\r\n count += 1\r\n\r\n if count>1:\r\n print(\"Still Rozdil\")\r\n else:\r\n print(town)\r\n \r\ndef main():\r\n t = 1\r\n while t:\r\n t -= 1\r\n solve()\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=10**10\r\nx=0\r\nfor i in range(n):\r\n if(l[i]<m):\r\n m=l[i]\r\n x=i+1\r\nif(l.count(m)>1):\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(x)\r\n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nd=min(a)\r\nif(a.count(d)>1):\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(a.index(min(a))+1)\r\n", "n = int(input())\r\nm = [*map(int,input().split())]\r\na = min(m)\r\ncount = 0\r\nfor i in m:\r\n if i==a:\r\n count+=1\r\nif count == 1:\r\n print(m.index(a)+1)\r\nelse:\r\n print('Still Rozdil')", "n=int(input())\r\n\r\ns=[int(x) for x in input().split()]\r\n# print(s)\r\n\r\nmi=1000000001\r\ncnt=1\r\nk=0\r\nfor i in range(len(s)):\r\n\tif s[i]==mi:\r\n\t\tcnt+=1\r\n\tif s[i]<mi:\r\n\t\tk=i\r\n\t\tmi=s[i]\r\n\t\tcnt=1\r\n\r\nif cnt>1:\r\n\tprint(\"Still Rozdil\")\r\nelse:\r\n\tprint(k+1)\r\n", "x=int(input())\r\nA=list(map(int,input().split()))\r\ntemp=min(A)\r\ni=0\r\na=0\r\nb=0\r\nwhile (i<x):\r\n if (A[i]==temp):\r\n b=i\r\n a+=1\r\n i+=1\r\nif (a>1):\r\n print(\"Still Rozdil\")\r\nelse :\r\n print(b+1)", "n = int(input())\r\na = list(map(int, input().strip().split()))[:n]\r\n\r\nx = min(a)\r\ncount = 0\r\n\r\nfor i in range(len(a)):\r\n if a[i] == x:\r\n count += 1\r\n location = i\r\n\r\nif count == 1:\r\n print(location + 1)\r\n \r\nelse:\r\n print(\"Still Rozdil\")\r\n\r\n", "import copy\r\nn=int(input())\r\nlst1=list(map(int,input().rstrip().split()))\r\nl=copy.deepcopy(lst1)\r\nl.sort()\r\n#print(lst1,l)\r\nif lst1.count(l[0])==1:\r\n print(lst1.index(l[0])+1)\r\nelse:\r\n print(\"Still Rozdil\")\r\n", "n=int(input())\r\n#a,b,c=map(int,input().split())\r\na=list(map(int,input().split()))\r\nc=min(a)\r\nm=a.count(c)\r\nif(m>1):\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(a.index(c)+1)\r\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nif n == 1:\r\n print(1)\r\nelse:\r\n minn1 = a[0]\r\n ind1 = 0\r\n minn2 = max(a)\r\n ind2 = 0\r\n for i in range(0, n):\r\n if a[i] < minn1:\r\n minn1 = a[i]\r\n ind1 = i\r\n a.pop(ind1)\r\n for i in range(n - 1):\r\n if a[i] < minn2:\r\n minn2 = a[i]\r\n if minn2 != minn1:\r\n print(ind1 + 1)\r\n else:\r\n print(\"Still Rozdil\")", "n = int(input())\na = list(map(int, input().split()))\nmn = min(a)\nif a.count(mn)>1:\n print(\"Still Rozdil\")\nelse:\n print(a.index(mn)+1)\n\n\n\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nans=min(l)\r\nv=[]\r\nindex=1\r\nfor i in range(n):\r\n\tif l[i]==ans:\r\n\t\tv.append(l[i])\r\n\t\tindex+=i\r\n# print(v)\r\nif len(v)>1:\r\n\tprint('Still Rozdil')\r\nelse:\r\n\tprint(index)", "n = int(input())\r\nt = [int(i) for i in input().split(' ')]\r\n\r\nm = min(t)\r\nidx = t.index(m)\r\n\r\nj = 0\r\nfor i in range(n):\r\n if t[i] == m and i != idx:\r\n j = 1\r\n break\r\n\r\nif j:\r\n print('Still Rozdil')\r\nelse:\r\n print(idx+1)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nt=[]\r\nfor i in l:\r\n t +=[i]\r\nt.sort()\r\ns=t[0]\r\nif l.count(s)==1:\r\n print(l.index(s)+1)\r\nelse:\r\n print(\"Still Rozdil\")\r\n \r\n", "n = int(input())\r\nx = list(map(int, input() .split()))\r\nt = min(x)\r\nif x.count(t) > 1:\r\n print('Still Rozdil')\r\n exit()\r\nelse: \r\n for i in range(n):\r\n if t==x[i]:\r\n print(i+1)\r\n break ", "n = int(input())\r\n\r\narr = list(map(int,input().split()))\r\n\r\nmn = min(arr)\r\n\r\nif arr.count(mn) > 1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(arr.index(mn)+1)", "n=int(input())\r\na=list(map(int,input().split()))\r\nx=min(a)\r\np=a.count(x)\r\nif p>1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(a.index(x)+1)", "n=int(input())\r\nm=list(map(int,input().split()))\r\nk=min(m)\r\nv=m.count(k)\r\nif(v>1):\r\n print('Still Rozdil')\r\nelse:\r\n for i in range(len(m)):\r\n if(m[i]==k):\r\n print(i+1)", "i=int(input())\r\nnums=list(map(int,input().split()))\r\nk=min(nums)\r\nif nums.count(k)>1:\r\n print('Still Rozdil')\r\nelse:\r\n for x in range(len(nums)):\r\n if nums[x]==k:\r\n print(x+1)\r\n break\r\n\r\n", "m = int(input())\r\nls = list(map(int,input().split(\" \")))\r\nmn = min(ls)\r\nc = 0\r\nfor i in range(len(ls)):\r\n if ls[i] == mn:\r\n c += 1\r\nif c==1:\r\n ind = ls.index(mn)\r\n print(ind+1)\r\nelse:\r\n print(\"Still Rozdil\")\r\n", "n = int(input())\r\nls = list(map(int,input().strip().split()))\r\nmn = ls[0]\r\nct = 1\r\nind = 1\r\nfor i in range(1,n):\r\n\tif ls[i]<mn:\r\n\t\tmn = ls[i]\r\n\t\tct = 1\r\n\t\tind = i+1\r\n\telif ls[i] == mn:\r\n\t\tct+=1\r\nif ct == 1:\r\n\tprint(ind)\r\nelse:\r\n\tprint(\"Still Rozdil\")\r\n", "def main():\n n = int(input())\n arr = list(map(int, input().split(\" \")))\n\n min_val = arr[0]\n min_pos = 0\n counter = {}\n for i in range(n):\n if arr[i] < min_val:\n min_val = arr[i]\n min_pos = i\n if arr[i] not in counter:\n counter[arr[i]] = 0\n counter[arr[i]] += 1\n\n print( (min_pos + 1) if counter[min_val] == 1 else \"Still Rozdil\")\n\n\nif __name__ == \"__main__\":\n main()\n", "n = int(input()) # no. of cities\r\nl = list(map(int, input().split())) # time taken for those respective cities\r\nt = min(l)\r\nf = l.count(t)\r\nif f > 1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(l.index(t)+1)", "def main():\n n = int(input())\n arr = [int(x) for x in input().split()]\n count = 1\n min = arr[0]\n idx = 0\n for i in range(1,n):\n if arr[i] == min:\n count+=1\n else:\n if arr[i]<min:\n count=1\n min = arr[i]\n idx = i\n\n if count!=1:\n print(\"Still Rozdil\")\n return\n\n print(idx+1)\n\n return\n\n\nmain()\n", "n = int(input())\r\nc = [int(x) for x in input().split()]\r\nif c.count(min(c)) > 1:\r\n print('Still Rozdil')\r\nelse:\r\n print(c.index(min(c))+1)\r\n", "n=int(input())\r\nlst=list(map(int,input().split()))\r\nsmlst=[[lst[0],0]]\r\nfor i in range(1,n):\r\n if lst[i]<smlst[0][0]:\r\n smlst.clear()\r\n smlst.append([lst[i],i])\r\n elif lst[i]==smlst[0][0]:\r\n smlst.append([lst[i],i])\r\nif len(smlst)==1 and smlst[0][0]==lst[0]:\r\n print(1)\r\nelif len(smlst)==1:\r\n print(smlst[0][1]+1)\r\nelse:\r\n print('Still Rozdil')\r\n", "ct = int(input())\r\narr = list(map(int, input().split(\" \")))\r\nmin_val = arr[0]\r\nflag_pos = 0\r\nocc = 0\r\n\r\nfor i in range(1, len(arr)):\r\n if(arr[i]<=min_val):\r\n if(min_val==arr[i]):\r\n occ+=1\r\n else:\r\n occ = 0\r\n min_val = arr[i]\r\n flag_pos = i\r\n\r\nif(occ>0):\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(flag_pos+1)\r\n ", "n = int(input())\r\nlst = [*map(int, input().split())]\r\nif lst.count(min(lst)) > 1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(lst.index(min(lst)) + 1)\r\n", "n=int(input())\r\nlst=list(map(int,input().split()))\r\nminn=min(lst)\r\ncount=lst.count(minn)\r\nif count>1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(lst.index(minn)+1)", "n = int(input())\r\n\r\nl = [int(x) for x in input().split()]\r\na = min(l)\r\nif l.count(a) == 1: print(l.index(a)+1)\r\nelse: print(\"Still Rozdil\")", "n=int(input())\r\narr=list(map(int, input().split()))\r\nd=dict()\r\n\r\nfor i in range(0, len(arr)):\r\n d[arr[i]]=i+1\r\n\r\narr.sort();\r\nif arr.count(arr[0])>1:\r\n print('Still Rozdil')\r\nelse:\r\n print(d[arr[0]])", "p=int(input());l=list(map(int,input().split()));m=min(l);c=l.count(m)\r\nif c>1:print('Still Rozdil')\r\nelse:print(l.index(m)+1)", "n=int(input())\r\nl=list(map(int,input().rstrip().split()))\r\na=l[0]\r\nb=0\r\nc=0\r\nfor i in range(1,n):\r\n if l[i]<a:\r\n a=l[i]\r\nfor i in range(0,n):\r\n if l[i]==a:\r\n b=b+1\r\n c=i+1\r\nif b==1:\r\n print(c)\r\nelse:\r\n print(\"Still Rozdil\")", "cities = int(input())\r\ndist = {k:v for k, v in enumerate (map(int, input().split()))}\r\n\r\nlst = [v for k, v in dist.items()]\r\n\r\nfound = min(lst)\r\n\r\nop = lst.index(found)\r\n\r\n\r\n\r\nlst.remove(found)\r\n\r\nif found not in lst:\r\n print(op + 1)\r\n\r\nelse:\r\n print('Still Rozdil')\r\n", "no_of_cities = int(input())\r\ncity_list = list(map(int, input().split()))\r\n\r\nx = min(city_list)\r\n\r\nif city_list.count(x) == 1:\r\n print(city_list.index(x) + 1)\r\nelif city_list.count(x) > 1:\r\n print(\"Still Rozdil\")", "n = int(input())\r\narr = [int(x) for x in input().split()]\r\n\r\nlo = min(arr)\r\n\r\ncount = 0\r\npos = 0\r\nfor i in range(n):\r\n if arr[i] == lo:\r\n count += 1\r\n pos = i\r\n\r\nif count > 1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(pos+1)", "\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\n\r\nm = min(l)\r\nm_co = l.count(m)\r\nif m_co > 1:\r\n\tprint('Still Rozdil')\r\nelse:\r\n\tprint(l.index(m)+ 1)\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nx = min(a)\r\nans = []\r\nfor i in range(n):\r\n if a[i] == x:\r\n ans.append(i)\r\nif len(ans) > 1:\r\n print('Still Rozdil')\r\nelse:\r\n print(ans[0] + 1)\r\n", "n = int(input())\r\nA = list(map(int, input().split()))\r\nB = A.copy()\r\nB.sort()\r\nif(B.count(B[0]) > 1):\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(A.index(B[0])+1)", "\r\nn = int(input())\r\nl = list(map(int,input().split()))\r\nmn = min(l)\r\nc = 0\r\n\r\nfor i in l :\r\n if i == mn :\r\n c +=1\r\n\r\nif c != 1 :\r\n print('Still Rozdil')\r\n exit()\r\nelse:\r\n print(l.index(mn)+1)\r\n\r\n", "townnum = int(input())\r\ntowns = input().split()\r\n\r\nfor i in range(townnum):\r\n towns[i] = int(towns[i])\r\n\r\ndef smallestnum(list):\r\n basenum = list[0]\r\n for i in range(len(list)):\r\n if list[i] <= basenum:\r\n basenum = list[i]\r\n else:\r\n continue\r\n return basenum\r\n\r\nsmallnum = smallestnum(towns)\r\n\r\nif towns.count(smallnum) > 1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(towns.index(smallnum) + 1)\r\n", "n, arr = int(input()), list(map(int, input().split()))\r\nif arr.count(min(arr)) > 1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(arr.index(min(arr)) + 1)", "input()\r\nx = [int(i) for i in input().split()]\r\nm = min(x)\r\nc = x.count(m)\r\n\r\nif c>1 :\r\n print('Still Rozdil')\r\nelse : \r\n print(x.index(m)+1)", "n=int(input())\r\na=list(map(int,input().split()))\r\nx=min(a)\r\nb=a.count(x)\r\nif b==1:\r\n\tprint(a.index(x)+1)\r\nelse:\r\n\tprint(\"Still Rozdil\")", "n=int(input())\r\nx=list(map(int,input().split()))\r\ny=min(x)\r\nif(x.count(y)>=2):\r\n\tprint(\"Still Rozdil\")\r\nelse:\r\n print(x.index(y)+1)\t", "T = int(input())\r\ncities_time = list(map(int, input().split()))\r\nleast_time = min(cities_time)\r\ncount = cities_time.count(least_time)\r\nif count == 1:\r\n print(cities_time.index(least_time)+1)\r\nelse:\r\n print('Still Rozdil')", "def solve(arr,n):\n min_val_index = 0\n for i in range(len(arr)):\n if arr[i] < arr[min_val_index]:\n min_val_index = i\n \n for i in range(len(arr)):\n if i == min_val_index:\n continue\n if arr[i] == arr[min_val_index]:\n return 'Still Rozdil'\n return min_val_index+1\n \n\n \n\ndef main() :\n n = int(input())\n arr = list(map(int, input().split(' ')))\n print(solve(arr,n))\nmain()\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nmin=a[0]\r\nb=0\r\nfor i in range(1,n):\r\n if(min>=a[i]):\r\n min=a[i]\r\n \r\nfor i in range(0,n):\r\n if(min==a[i]):\r\n b=b+1\r\nif(b>1):\r\n print(\"Still Rozdil\")\r\nelse:\r\n for i in range(0,n):\r\n if(min==a[i]):\r\n print(i+1)", "n = int(input())\r\n\r\nl = [int(i) for i in input().split()]\r\n\r\n\r\nif n ==1:\r\n print('1')\r\nelse: \r\n\r\n m= min(l)\r\n ind = l.index(m)\r\n l.remove(m)\r\n mm = min(l)\r\n if m == mm:\r\n print('Still Rozdil')\r\n else:\r\n print(ind+1)", "n = int(input())\r\na = list(map(int, input().split()))\r\ncounter = 1\r\nres = 1\r\nmin_a = a[0]\r\nfor i in range(1, n):\r\n if a[i] == min_a:\r\n counter += 1\r\n elif a[i] < min_a:\r\n min_a = a[i]\r\n counter = 1\r\n res = i+1\r\nprint(res if counter == 1 else \"Still Rozdil\")\r\n", "N = int(input())\r\nArr = list(map(int,input().split()))\r\nVal = min(Arr)\r\nCount,Pos = 0,0\r\nfor i in range(N):\r\n if Arr[i] == Val:\r\n Pos = i + 1\r\n Count = Count + 1\r\n if Count >= 2:\r\n print(\"Still Rozdil\")\r\n break\r\nelse:\r\n print(Pos)", "n=int(input())\r\nli=[int(i)for i in input().split()]\r\na=min(li)\r\nb=li.index(a)\r\nli.remove(a) \r\nif(a in li):\r\n print('Still Rozdil')\r\nelse:\r\n li.insert(b,a) \r\n print(li.index(a)+1) ", "# Little Elephant and Rozdil\r\n# https://codeforces.com/problemset/problem/205/A\r\n\r\nn=int(input())\r\ndistances=list(map(int,input().split()))\r\n\r\nminv = min(distances)\r\nif distances.count(minv) > 1:\r\n ans=\"Still Rozdil\"\r\nelse:\r\n for i in range(n):\r\n if distances[i] == minv:\r\n ans=i+1\r\n break\r\nprint(ans)", "n = int(input())\r\nnums = list(map(int,input().split()))\r\nimport collections\r\nc = collections.Counter(nums)\r\nif c[min(nums)] != 1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(nums.index(min(nums))+1)", "n=int(input())\r\narr=list(map(int,input().split()))\r\nm1=min(arr)\r\nc1=arr.count(m1)\r\nif(c1>1):\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(arr.index(m1)+1)", "number = int(input())\r\nlist2 = [int(i) for i in input().split()]\r\nif(list2.count(min(list2))>1):\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(list2.index(min(list2))+1)", "# 2\r\n# 7 4\r\n# 2\r\n\r\n# 7\r\n# 7 4 47 100 4 9 12\r\n# Still Rozdil\r\nx=int(input())\r\narr=list(map(int,input().split()))\r\nmin=min(arr)\r\nind=arr.index(min)\r\nif arr.count(min)==1:\r\n print(ind+1)\r\nelse:\r\n print(\"Still Rozdil\")\r\n# print(arr)\r\n\r\n\r\n# x,y,\r\n# m=map(int,input().split())\r\n# if x>=m or y>=m :\r\n# print(0) \r\n# elif (x+y)<0 :\r\n# print(-1)\r\n# else:\r\n# sum = x+y\r\n# max=max(x,y)\r\n# count = 1 \r\n# while sum<m:\r\n# count+=1\r\n# sum = sum + max\r\n # print(count)\r\n\r\n# s=input()\r\n# sub1='heavy'\r\n# sub2='metal'\r\n# heavymetalisheavymetal\r\n# heavymetalismetal\r\n# trueheavymetalissotruewellitisalsosoheavythatyoucanalmostfeeltheweightofmetalonyou\r\n\r\n# s = input()\r\n# l = s.split('heavy')\r\n# print(l)\r\n# ans = 0\r\n# for i in range(len(l)):\r\n# \tans += i * l[i].count('metal')\r\n# print(ans)\r\n\r\n# ans=0\r\n# i=0\r\n# while i<=len(s)-5:\r\n# # print(s[i:i+5])\r\n# if s[i:i+5]==sub1:\r\n# ans+=s[i:].count(sub2)\r\n# i+=4\r\n# i+=1\r\n# print(ans)\r\n\r\n\r\n# ans=0\r\n# for i in range(len(s)) :\r\n# if s[i:i+5]==sub1:\r\n# ans+=s[i:].count(sub2)\r\n# print(ans)", "n = input()\n\nm = list(map(int,input().split()))\n\nmn = min(m)\nif(m.count(mn)==1):print(m.index(mn)+1)\nelse : print(\"Still Rozdil\")", "n = int(input())\n\nnums = list(map(int, input().split()))\n\nm = min(nums)\n\nprint(\"Still Rozdil\" if nums.count(m) > 1 else nums.index(m) + 1)\n", "a=int(input())\r\nb=list(map(int,input().split()))\r\nif(b.count(min(b))>1):\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(b.index(min(b))+1)\r\n", "num = int(input())\r\narr = list(map(int, input().split()))\r\nmn = min(arr)\r\nans = [x for x in arr if x == mn]\r\nif len(ans) == 1:\r\n print(arr.index(mn) + 1)\r\nelse:\r\n print('Still Rozdil')", "n = int(input())\r\n\r\na = [int(x) for x in input().split()]\r\n\r\nmn = min(a)\r\ncnt = 0\r\nans = 0\r\nfor i in range(n):\r\n\tif mn == a[i]:\r\n\t\tcnt += 1\r\n\t\tans = i+1\r\n\r\nif cnt > 1:\r\n\tprint(\"Still Rozdil\")\r\nelse:\r\n\tprint(ans)\r\n\t\r\n", "t = int(input())\r\nb = list(map(int,input().split()))\r\nc = min(b)\r\ns = b.count(c)\r\nif s > 1:\r\n print('Still Rozdil')\r\nelse:\r\n print(b.index(c) + 1)\r\n\r\n \r\n", "n = int(input())\r\ndist = [int(d) for d in input().split(\" \", n-1)]\r\nk = min(dist)\r\nj = dist.index(k)\r\ndist.remove(k)\r\nif k in dist:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(j+1)", "# problem solving base file\r\n# the following lines are reserved for imports\r\n#\r\n#\r\n\r\n# main declaration\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n cd = [int(x) for x in input().split(' ')]\r\n m = 1000000000\r\n c = 0\r\n for i in cd:\r\n if i < m:\r\n m = i\r\n c = 1\r\n elif i == m:\r\n c += 1\r\n\r\n if c == 1:\r\n print(cd.index(m) + 1)\r\n else:\r\n print(\"Still Rozdil\")\r\n", "n = int(input())\r\ntown = []\r\nm = input().split()\r\nfor i in range(len(m)):\r\n town.append(int(m[i]))\r\nmin_ = min(town)\r\nif town.count(min_) > 1:\r\n print('Still Rozdil')\r\nelse:\r\n print(town.index(min_)+1)", "from collections import Counter\n\nn = int(input())\narr = [int(i) for i in input().split()]\n\nmn = min(arr)\nc = Counter(arr)\n\nif c[mn] > 1:\n print(\"Still Rozdil\")\nelse:\n print(arr.index(mn) + 1)\n", "n=int(input())\r\na=list(map(int, input().split()))\r\nx=min(a)\r\nif a.count(x) == 1:\r\n print(a.index(x)+1)\r\nelse:\r\n print(\"Still Rozdil\")", "t=int(input())\r\n\r\nls=list(map(int,input().split()))\r\nif ls.count(min(ls))<2:\r\n print(ls.index(min(ls))+1)\r\nelse:\r\n print(\"Still Rozdil\")", "n = int(input())\r\na = list(map(int, input().split()))\r\ntown = 0\r\nfor i in range(n):\r\n if a[i] <= a[town]:\r\n town = i\r\nfor i in range(n):\r\n if i != town and a[i] == a[town]:\r\n print('Still Rozdil')\r\n exit(0)\r\nprint(town + 1)\r\n", "n=int(input())\r\nlist1=list(map(int,input().split()))\r\nminn=min(list1)\r\ncount=list1.count(minn)\r\nif count>1:\r\n print('Still Rozdil')\r\nelse:\r\n print(list1.index(minn)+1)\r\n\r\n", "n = int(input())\r\ntimes = list(map(int, input().split()))\r\nmin_time = min(times)\r\nif times.count(min_time) == 1:\r\n print(times.index(min_time) + 1)\r\nelse:\r\n print(\"Still Rozdil\")", "n = int(input())\r\nt = list(map(int,input().split()))\r\n\r\nif t.count(min(t))>=2:\r\n\tprint('Still Rozdil')\r\nelse:\r\n\tprint(t.index(min(t))+1)", "n = int(input())\narr = tuple(map(int,input().split()))\nm = 100000000000000000000000\nr = 0\nfor i in range(n):\n if arr[i]< m:\n m = arr[i]\n r=0\n pos = i\n elif arr[i]==m:\n r = 1\n #print('i,r',i,r)\nif r==1:\n print(\"Still Rozdil\")\nelse:\n print(pos+1)", "# cook your dish here\r\nn=int(input())\r\na=[int(i) for i in input().split()]\r\nk=a.count(min(a))\r\nif(k==1):\r\n print((a.index(min(a)))+1)\r\nelse:\r\n print(\"Still Rozdil\")", "n = int(input())\r\ntimes = [int(i) for i in input().split()]\r\nmin_time = min(times)\r\n\r\ncounter = pos = 0\r\nfor i in range(n):\r\n if times[i] == min_time:\r\n counter += 1\r\n pos = i + 1\r\n if counter == 2:\r\n break\r\n\r\nif counter == 2:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(pos)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=min(l)\r\nif(l.count(m)>1):\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(l.index(m)+1)", "from sys import stdin\r\nfrom bisect import bisect_right as br\r\n\r\ninput = stdin.readline\r\n\r\nn = int(input())\r\nlst = list(map(int, input().strip().split()))\r\narr = sorted(lst)\r\nind = br(arr, arr[0]) - 1\r\nif ind == 0:\r\n print(lst.index(arr[0]) + 1)\r\nelse:\r\n print('Still Rozdil')\r\n", "n = int(input())\r\nlst = list(map(int, input().split()))\r\n\r\nmn = min(lst)\r\nindx = lst.index(mn)\r\nfor i in range(len(lst)):\r\n if lst[i] == mn and i != indx:\r\n print(\"Still Rozdil\")\r\n break\r\n \r\n elif i == len(lst) - 1:\r\n print(indx + 1)\r\n", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nres = \"Still Rozdil\"\r\ncurrMin = float(\"inf\")\r\nflag = 0\r\n\r\nfor i in range(len(lst)):\r\n if lst[i] == currMin:\r\n flag = 1\r\n elif lst[i] < currMin:\r\n res = i+1\r\n currMin = lst[i]\r\n flag = 0\r\n\r\nprint(res if flag == 0 else \"Still Rozdil\")", "n =int(input())\r\nl = list(map(int, input().split()))\r\nmin1 = min(l)\r\ncnt = l.count(min1)\r\nif cnt == 1:\r\n print(l.index(min1) + 1)\r\nelse:\r\n print(\"Still Rozdil\")", "n=int(input())\r\narr=list(map(int,input().split()))\r\nmi=min(arr)\r\nif arr.count(mi)>1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(arr.index(mi)+1)", "n=int(input())\r\ntowns=(list(map(int,input().split())))\r\nl=min(towns)\r\nk=towns.count(l)\r\nm=towns.index(l)\r\nif k>1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(m+1)", "towns=int(input())\r\ntime_taken=list(map(int,input().split()))\r\n#find time with min time\r\nm=min(time_taken)\r\nif time_taken.count(m)>1:\r\n print('Still Rozdil')\r\nelse:\r\n #index of minimum\r\n print(time_taken.index(m)+1)", "n = int(input())\r\na = list(map(int,input().split()))\r\nb = sorted(a)\r\nif n == 1 : \r\n print(1)\r\n exit()\r\nif b[0] == b[1] : print(\"Still Rozdil\")\r\nelse : print(a.index(b[0]) + 1) ", "n=int(input())\r\nli=list(map(int,input().split()))\r\nki=li\r\nasa=min(li)\r\nif li.count(asa) >1:\r\n print(\"Still Rozdil\")\r\n exit(0)\r\nelse:\r\n print(li.index(asa)+1)", "def main():\r\n\tn = int(input())\r\n\ttowns = input().split(); towns = list(map(int, towns))\r\n\t\r\n\tif (towns.count(min(towns)) > 1): print(\"Still Rozdil\")\r\n\telse: print(towns.index(min(towns)) + 1)\r\n\r\nmain()", "\r\n\r\ndef v():\r\n n = int(input())\r\n distance = [int(x) for x in input().split()]\r\n\r\n mini = min(distance)\r\n c = 0\r\n index = 0\r\n for i in range(n):\r\n if distance[i] == mini:\r\n c += 1\r\n index = i\r\n if c == 1:\r\n print(index+1)\r\n else:\r\n print(\"Still Rozdil\")\r\n\r\n\r\nv()", "n = int(input())\r\nl = [int(i) for i in input().split()]\r\nminii = min(l)\r\nmini = l.count(minii)\r\nif(mini > 1):\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(l.index(minii)+1)\r\n", "def list_duplicates(seq):\r\n seen = set()\r\n seen_add = seen.add\r\n seen_twice = set( x for x in seq if x in seen or seen_add(x) )\r\n return list( seen_twice )\r\nx = int(input())\r\nq = [int(x) for x in input().split(' ')]\r\nq1 = list_duplicates(q)\r\nt = 0\r\nif len(q1) == 0:\r\n\r\n print(q.index(min(q))+1)\r\nelif min(q1)> min(q):\r\n print(q.index(min(q))+1)\r\nelse:\r\n print(\"Still Rozdil\")", "amount = int(input())\r\nres = [int(x) for x in input().split()]\r\nprint((res.index(min(res)) + 1) if res.count(min(res)) == 1 else 'Still Rozdil')\r\n\r\n", "n=int(input())\r\nz=list(map(int,input().split()))\r\nk=min(z)\r\nif(z.count(k)>=2):\r\n\tprint(\"Still Rozdil\")\r\nelse:\r\n print(z.index(k)+1)\t", "n=int(input())\r\nl1=list(map(int,input().split()))\r\nm=min(l1)\r\nif(l1.count(m)>1):\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(l1.index(m)+1)\r\n\r\n", "from ast import Index\r\n\r\n\r\nmod=(10**9)+7\r\n\r\ndef exp(a,b):\r\n\tres=1\r\n\twhile(b):\r\n\t\tif(b & 1):\r\n\t\t\tres*=a\r\n\t\ta*=a\r\n\t\tb//=2\r\n\treturn res\r\n\r\ndef expm(a,b,m=mod):\r\n\tres=1\r\n\twhile(b):\r\n\t\tif(b & 1):\r\n\t\t\tres=(res * a % mod) % mod\r\n\t\ta=(a % mod * a % mod) % mod\r\n\t\tb//=2\r\n\treturn res\r\n\r\ndef getarr():\r\n\tl=[int(i) for i in input(\"\").split()]\r\n\treturn l\r\n\r\nif __name__==\"__main__\":\r\n\tn = int(input(''))\r\n\tarr = getarr()\r\n\tmn = min(arr)\r\n\tif(arr.count(mn) > 1): print(\"Still Rozdil\")\r\n\telse: print(arr.index(mn)+1)", "n=int(input())\r\nm=list(map(int,input().split()))\r\nmin_city=min(m)\r\n\r\nif m.count(min_city)>1:\r\n print('Still Rozdil')\r\nelse:\r\n print(str(m.index(min_city)+1))", "t=int(input())\r\nl =[ e for e in map(int, input().split()) ]\r\nm=min(l)\r\ncnt=0\r\nfor i in range(len(l)):\r\n if l[i]==m:\r\n ind=i\r\n cnt=cnt+1\r\nif cnt>1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(ind+1)\r\n \r\n", "n = int(input())\nt = [int(i) for i in input().split()]\no = sorted(range(n), key=t.__getitem__)\nres = 1 if n == 1 else o[0] + 1 if t[o[0]] != t[o[1]] else \"Still Rozdil\"\nprint(res)\n", "n = int(input())\r\nseq = list(map(int, input().split()))\r\n\r\nmin_num = min(seq)\r\nif seq.count(min_num) == 1:\r\n print(seq.index(min_num) + 1)\r\nelse:\r\n print(\"Still Rozdil\")", "int(input())\r\nl=list(map(int,input().split()))\r\nprint(l.index(min(l))+1 if l.count(min(l))==1 else \"Still Rozdil\")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Dec 26 17:59:46 2022\r\n\r\n@author: Lenovo\r\n\"\"\"\r\n\r\nn = int(input())\r\n\r\ns = input()\r\ns = s.split()\r\ns = list(map(lambda x: int(x),s))\r\nminimo = min(s)\r\ncidade = s.index(minimo)+1\r\ns.remove(minimo)\r\nif minimo in s:\r\n print('Still Rozdil')\r\nelse:\r\n print(cidade)", "n = int(input())\r\ntowns = [int(i) for i in input().split()]\r\n\r\nif towns.count(min(towns)) == 1:\r\n print(towns.index(min(towns)) + 1)\r\nelse:\r\n print('Still Rozdil')\r\n", "n = int(input())\r\ndists = list(map(int, input().split()))\r\nif dists.count(min(dists)) > 1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(dists.index(min(dists)) + 1)", "import sys,os,io,time,copy\r\nif os.path.exists('input.txt'):\r\n sys.stdin = open('input.txt', 'r')\r\n sys.stdout = open('output.txt', 'w')\r\n\r\nimport math\r\n\r\ndef is_int(n):\r\n if n//1==n/1:\r\n return True\r\n else:\r\n return False\r\n\r\ndef main():\r\n # start=time.time()\r\n n=int(input())\r\n arr=list(map(int,input().split()))\r\n dic={}\r\n for a in arr:\r\n if a not in dic:\r\n dic[a]=1\r\n else:\r\n dic[a]+=1\r\n x=min(dic.keys())\r\n if dic[x]==1:\r\n print(arr.index(x)+1)\r\n else:\r\n print('Still Rozdil')\r\n\r\n # end=time.time()\r\nmain()", "n = int(input())\r\ntowns = list(map(int, input().strip().split()))\r\n\r\nif towns.count(min(towns)) == 1:\r\n print(towns.index(min(towns)) + 1)\r\nelse:\r\n print(\"Still Rozdil\")", "n = int(input())\r\nmi = 10**9+1\r\nc = 0\r\nidx = -1\r\nvals = list(map(int, input().split()))\r\nfor i in range(n):\r\n if(vals[i]<mi):\r\n c = 1\r\n mi = vals[i]\r\n idx = i\r\n elif(vals[i]==mi):\r\n c += 1\r\nif(c>1):\r\n print('Still Rozdil')\r\nelse:\r\n print(idx+1)", "n = int(input())\r\nl = list(map(int, input().split()))\r\nmin = 10**9 + 5\r\nfor i in l:\r\n if i < min:\r\n min = i\r\nif l.count(min) != 1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(l.index(min) + 1)# 1698067489.4287324", "n = int(input())\r\narr = list(map(int, input().split()))\r\nres = min(arr)\r\nc = arr.count(res)\r\n\r\nif c > 1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(arr.index(res)+1)\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\ndef fun(arr):\r\n Min, check, index = arr[0], 1, 1\r\n for i in range(1,n):\r\n if arr[i] < Min:\r\n Min,check,index = arr[i], 1, i+1\r\n elif arr[i] == Min:\r\n check += 1\r\n if check == 1:\r\n return index\r\n else:\r\n return 'Still Rozdil'\r\nprint(fun(arr))", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nd={}\r\nfor z in a:\r\n if z not in d.keys():\r\n d[z]=1\r\n else :\r\n d[z]+=1\r\ny=min(a)\r\nif d[y]==1:\r\n print(a.index(y)+1)\r\nelse :\r\n print(\"Still Rozdil\")", "n = int(input())\nl = list(map(int, input().split()))\nif (l.count(min(l)) > 1):\n print(\"Still Rozdil\")\nelse:\n print(l.index(min(l)) + 1)\n", "city_num=int(input())\r\ncities=[int(x) for x in input().split()]\r\n\r\nmini=min(cities)\r\ncount=0\r\nindex=0\r\nfor i in range(len(cities)):\r\n if cities[i] == mini:\r\n count+=1\r\n index=i\r\n\r\nif count == 1:\r\n print(index+1)\r\nelse:\r\n print('Still Rozdil')", "n=int(input())\ndistances=list(map(int,input() .split()))\nshortest=min(distances)\nif distances.count(shortest)>1: \n print(\"Still Rozdil\")\nelse:\n print(((distances.index(shortest)+1)))\n ", "n=int(input())\r\nl=list(map(int,input().split()))\r\nmin=l[0]\r\ncount=int(1)\r\nindex=int(0)\r\nfor i in range(1,n):\r\n if min>l[i]:\r\n min=l[i]\r\n count=1\r\n index=i\r\n elif min==l[i]:\r\n count+=1\r\nif count>1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(index+1)", "N = int(input())\r\nA = list(map(int,input().split()))\r\nM = min(A)\r\nif A.count(M)>1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(A.index(M)+1)", "a = input()\r\nb = list(map(int, input().split()))\r\nmin_ = min(b)\r\nindex_ = b.index(min_)\r\n\r\nif b.count(min_)>1:\r\n print(\"Still Rozdil\")\r\n \r\nelse:\r\n print(index_+1)", "n = int(input())\r\nlst = input().split()\r\nlst = [int(i) for i in lst]\r\n\r\nmin_value = min(lst)\r\n\r\ncount = 0\r\nindex = 0\r\n\r\nfor i in range(n):\r\n if lst[i] == min_value:\r\n count += 1\r\n index = i\r\n\r\nif count == 1:\r\n print (index + 1)\r\nelse:\r\n print (\"Still Rozdil\")\r\n", "def solve():\r\n n = int(input())\r\n cities = list(map(int, input().split()))\r\n minind = 0\r\n minc = cities[minind]\r\n\r\n for i in range(n):\r\n if cities[i] < minc:\r\n minc = cities[i]\r\n minind = i\r\n ct = 0\r\n for i in range(n):\r\n if cities[i] == minc:\r\n ct+=1\r\n if ct > 1:\r\n print(\"Still Rozdil\")\r\n return\r\n print(minind+1)\r\nsolve()", "n = int(input())\r\n\r\na = [int(x) for x in input().split()]\r\nm = float('inf')\r\nfor i in range(n):\r\n if a[i]<m:\r\n c = 1\r\n m = a[i]\r\n ans = i \r\n elif a[i] == m:\r\n c+=1 \r\n\r\nif c==1:\r\n print(ans+1) \r\nelse:\r\n print(\"Still Rozdil\")", "n = input()\ntowns = [int(c) for c in input().split()]\nminimum = min(towns)\noccurences = towns.count(minimum)\n\nif occurences > 1:\n print(\"Still Rozdil\")\nelse:\n print(towns.index(minimum) + 1)", "n = int(input())\na = list(map(int, input().split()))\nx = min(a)\nif a.count(x) == 1:\n print(a.index(x) + 1)\nelif a.count(x) > 1:\n print('Still Rozdil')\n#s = [1, 2, 3]\n#print(s[0])", "import sys\r\n\r\ndef input(): return sys.stdin.readline().strip()\r\ndef iinput(): return int(input())\r\ndef rinput(): return map(int, sys.stdin.readline().strip().split()) \r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split())) \r\n\r\nn=iinput()\r\na=list(map(int,input().split()))\r\ns=min(a)\r\ncount=0\r\nfor i in range(n):\r\n if(a[i]==s):\r\n count+=1\r\n#print(count)\r\nif(count==1):\r\n print(a.index(s)+1)\r\nelse:\r\n print(\"Still Rozdil\")\r\n", "n = int(input())\r\na = input().split(' ')\r\nb = [int(i) for i in a]\r\ne = min(b)\r\nif b.count(e) == 1:\r\n print(b.index(e)+1)\r\nelse:\r\n print('Still Rozdil')", "a=int(input())\r\ns=list(map(int,input().split()))\r\nd=min(s)\r\nx=s.count(d)\r\nif(x>1):\r\n print(\"Still Rozdil\")\r\nelse:\r\n for i in range(len(s)):\r\n if(s[i]==d):\r\n print(i+1)", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nb=[]\r\nc=min(a)\r\nfor i in a:\r\n if i==c:\r\n b.append(i)\r\nif len(b)==1:\r\n print(a.index(b[0])+1)\r\nelse:\r\n print('Still Rozdil')", "t=int(input())\r\nn=list(map(int,input().split()))\r\n\r\n\r\nm=min(n)\r\n\r\nif n.count(m)==1:\r\n print(n.index(m)+1)\r\n\r\nelse:\r\n print(\"Still Rozdil\")", "j = int(input())\r\nk = list(map(int,input().split()))\r\nif k.count(min(k)) == 1:\r\n\tprint(k.index(min(k))+1)\r\nelse:\r\n\tprint('Still Rozdil')", "N = int(input())\r\nL = list(map(int,input().split()))\r\nprint(L.index(min(L))+1 if L.count(min(L))==1 else \"Still Rozdil\")", "n,c=int(input()),list(map(int,input().split()))\r\nminvalue=min(c)\r\nif c.count(minvalue)>1:\r\n print('Still Rozdil')\r\nelse:\r\n print(c.index(min(c))+1)", "import math as m\r\nfrom collections import defaultdict,deque\r\nfrom bisect import bisect_left as b_l\r\nfrom bisect import bisect_right as b_r\r\n\r\n# for _ in range(int(input())):\r\n # n=int(input())\r\n # a=[int(x) for x in input().split()]\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nif(a.count(min(a))>1):\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(a.index(min(a))+1)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nx=a.count(min(a))\r\nif x>1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(a.index(min(a))+1)", "\r\n\"\"\"\r\nCreated on Mon Jul 6 21:28:12 2020\r\n\r\n@author: rishi\r\n\"\"\"\r\nimport math\r\n\r\ndef sumofno(n):\r\n summ=0\r\n while(n>0):\r\n summ+=n%10\r\n n//=10\r\n return summ\r\n\r\ndef get_key(val,lis): \r\n for key, value in lis.items(): \r\n if value == val : \r\n return key \r\n\r\ndef isprime(val):\r\n c=0\r\n for j in range(2,val):\r\n if(val%j)==0:\r\n return False\r\n return True\r\n\r\ndef toh(n,b,a,e):\r\n if(n>=1):\r\n toh(n-1,b,e,a)\r\n print(str(b)+\" to \"+str(e))\r\n toh(n-1,a,b,e)\r\n \r\ndef gcd(a,b):\r\n if(a==b):\r\n return(a)\r\n if(a%b==0 or b%a==0):\r\n return(min(a,b))\r\n if(a>b):\r\n return(gcd(a%b,b))\r\n else:\r\n return(gcd(a,b%a))\r\n \r\n \r\n#print(isprime(15))\r\ntry:\r\n #t=int(input())\r\n ans=[]\r\n \r\n for i in range(1):\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n mini=min(a)\r\n if(a.count(mini)>1):\r\n ans.append(\"Still Rozdil\")\r\n else:\r\n ans.append(a.index(mini)+1)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n #print (ans)\r\n for an in ans:\r\n #print(\"hi\")\r\n print(an)\r\n\r\nexcept:\r\n pass\r\n ", "n = int(input())\r\na = list(map(int,input().split()))\r\nm = min(a)\r\ncount = 0\r\nfor i in range (len(a)):\r\n p = a[i]\r\n if p==m:\r\n count = count+1\r\nif count == 1:\r\n print(a.index(min(a))+1)\r\nelse:\r\n print(\"Still Rozdil\")\r\n \r\n \r\n \r\n", "n=int(input())\r\nP=list(map(int,input().split()))\r\n\r\nmin = min(P)\r\ncnt = 0\r\n\r\nfor i in range(n):\r\n if P[i] == min:\r\n cnt += 1\r\n position = [i]\r\n else:\r\n pass \r\n \r\nif cnt == 1:\r\n print(position[0]+1)\r\nelse:\r\n print(\"Still Rozdil\")", "n = int(input())\r\n\r\ng=list(map(int,input().split()))\r\nw =[]\r\nfor i in range(len(g)):\r\n w.append(g[i])\r\nc=0\r\nmn=min(g)\r\ng.remove(mn)\r\nfor i in range(len(g)):\r\n if mn==g[i]:\r\n print('Still Rozdil')\r\n c+=1\r\n break\r\nif c!=1:\r\n\r\n print(w.index(mn)+1)", "import sys\r\nn=int(input())\r\nA=list(map(int,input().split()))\r\nminn=sys.maxsize\r\nindex=0\r\ncount=0\r\nfor i in range(n):\r\n if A[i]<minn:\r\n minn=A[i]\r\n index=i\r\n count=1\r\n elif A[i]==minn:\r\n count+=1\r\nif count==1:\r\n print(index+1)\r\nelse:\r\n print(\"Still Rozdil\")", "from collections import Counter\nn = int(input())\na = [int(i) for i in input().split()]\n\nc = Counter(a)\n\nm = min(a)\nif c[m] > 1:\n print('Still Rozdil')\nelse:\n print(a.index(m) + 1)\n", "n = int(input())\r\ncities = list(map(int, input().split()))\r\nif n == 1:\r\n print(1)\r\nelse:\r\n sorted_cities = sorted(cities)\r\n\r\n if sorted_cities[0] != sorted_cities[1]:\r\n print(cities.index(sorted_cities[0]) + 1)\r\n \r\n else:\r\n print(\"Still Rozdil\")", "'''input\n1\n47\n\n\n'''\n\nn = int(input())\nnl = list(map(int, input().split()))\n\nif n<2:\n\tprint(1)\nelse:\n\tt = sorted(nl)\n\tif t[0] == t[1]:\n\t\tprint('Still Rozdil')\n\telse:\n\t\tprint(nl.index(min(nl))+1)", "x = int(input())\r\narr = list(map(int,input().split()))\r\n\r\nz = min(arr)\r\nif arr.count(z)==1:\r\n print(arr.index(z)+1)\r\nelse:\r\n print(\"Still Rozdil\")", "n = int(input())\r\nt = list(map(int,input().split()))\r\nm = min(t)\r\nc = t.count(m)\r\nif c == 1:\r\n print(t.index(m)+1)\r\nelse:\r\n print(\"Still Rozdil\")", "test = int(input())\r\n\r\ncities = input().split()\r\ncities = [int(x) for x in cities]\r\n\r\nmin_cities = min(cities)\r\n\r\nprint (cities.index(min_cities)+1) if(cities.count(min_cities) == 1) else print('Still Rozdil')", "num = int(input())\ndistances = list(map(int,input().split()))\nclosest = min(distances)\nif distances.count(closest) > 1:\n print('Still Rozdil')\nelse:\n print(distances.index(closest) + 1)\n", "n=input()\r\nlst = list(map(int,input().split()))\r\nx = min(lst)\r\nif lst.count(x)>1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(lst.index(x)+1)", "n = int(input())\narr = list(map(int, input().split()))\nm = min(arr)\nif arr.count(m) == 1:\n print(arr.index(m) + 1)\nelse:\n print('Still Rozdil')\n\n\n\n\n\n\n", "n=int(input())\r\nd=list(map(int,list(input().split())))\r\nif n>1:\r\n c=d[:]\r\n d.sort()\r\n if d[0]!=d[1]:\r\n print(c.index(d[0])+1)\r\n else:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(1)\r\n\r\n", "\r\nn = int(input())\r\na=list(map(int,input().split()))\r\n\r\nb = min(a)\r\n\r\nif(a.count(b)>1):\r\n print('Still Rozdil')\r\nelse:\r\n print(a.index(b)+1)", "input()\r\nl = [int(i)for i in input().split()]\r\nm = min(l)\r\nif l.count(m)==1:\r\n\tprint(l.index(m)+1)\r\nelse:\r\n\tprint(\"Still Rozdil\")", "n = int(input())\r\ntimes =[int(i) for i in input().split()]\r\nmini = min(times)\r\nif times.count(mini)>1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(times.index(mini)+1) ", "n = int(input())\r\nc = list(map(int, input().split()))\r\nMin = min(c)\r\ns = 0\r\nfor i in range(len(c)):\r\n if Min == c[i]:\r\n s = s+1\r\nif s >= 2:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(1 + c.index(Min))\r\n", "num_cities = int(input())\nlist = list(map(int, input().split()))\n\nmin = min(list)\ncount = list.count(min)\n\nif(count > 1):\n print(\"Still Rozdil\")\nelif(count == 1):\n print(list.index(min)+1)\n\n", "input()\r\ntowns = list(map(int, input().split()))\r\nmin = min(towns)\r\n\r\nif towns.count(min) > 1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(towns.index(min) + 1)", "n=int(input())\r\nlist=list(map(int,input().split()))\r\nmin=list[0]\r\ncount=0\r\nindex=0\r\nfor i in range(n):\r\n if list[i]<min:\r\n min=list[i]\r\n index=i\r\n \r\nfor i in range(n):\r\n if min==list[i]:\r\n count+=1\r\nif count==1:\r\n print(index+1)\r\nelse:\r\n print(\"Still Rozdil\")", "n=int(input())\r\nl=list(map(int,input().split()))\r\ng=list(l)\r\ng.sort()\r\nif(n==1):\r\n print(1)\r\nelse:\r\n if(g[0]!=g[1]):\r\n print(l.index(g[0])+1)\r\n else:\r\n print(\"Still Rozdil\")", "n = map(int, input())\na=list(map(int, input().split()))\nm=min(a)\nif a.count(m) > 1:\n print('Still Rozdil')\nelse:\n print(a.index(m)+1) \n", "a,l=int(input()),list(map(int,input().split()))\r\nif a==1:print(1)\r\nelse:\r\n\tk=sorted(l)\r\n\tprint([l.index(k[0])+1,\"Still Rozdil\"][k[0]==k[1]])", "n = int(input())\r\nx = list(map(int,input().split()))\r\nm = min(x)\r\nif x.count(m) == 1:\r\n print(x.index(m) + 1)\r\nelse:\r\n print('Still Rozdil')\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat May 16 01:09:04 2020\r\n\r\n@author: Kashem Pagla\r\n\"\"\"\r\n\r\n\r\nn=int(input())\r\ntown=list(map(int, input().split()))[:n]\r\nk=min(town)\r\n\r\nprint(town.index(k)+1 if town.count(k)==1 else \"Still Rozdil\")", "n = int(input())\r\narr = list(map(int, input().split()))\r\ntrack_arr = []\r\nfor i in range(n):\r\n track_arr.append([arr[i], i])\r\ntrack_arr.sort()\r\nif(len(arr) == 1):\r\n print(1)\r\nelif(track_arr[0][0] == track_arr[1][0]):\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(track_arr[0][1] + 1)\r\n", "n=int(input())\r\na=[int(a) for a in input().split()]\r\nb=sorted(a)\r\nif (len(a)==1):\r\n print (1)\r\nelif b[1]==min(b):\r\n print ('Still Rozdil')\r\nelse:\r\n print (a.index(b[0])+1)", "n = int(input())\r\nl = [int(x) for x in input().split()]\r\ng = sorted(list(set(l)))\r\n\r\nfor i in g:\r\n if i == min(l) and l.count(i) == 1:\r\n print(l.index(i)+1)\r\n break\r\nelse:\r\n print(\"Still Rozdil\") \r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\na = min(arr)\r\ncount = arr.count(a)\r\nif count > 1:\r\n print('Still Rozdil')\r\nelse:\r\n print(arr.index(a) + 1)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nmin1=min(l)\r\ncount1=l.count(min1)\r\nif(count1==1):\r\n print(l.index(min1)+1)\r\nelse:\r\n print(\"Still Rozdil\")", "input()\nc=list(map(int,input().split()))\nm=min(c)\nprint(\"Still Rozdil\"if c.count(m)>1else c.index(m)+1)\n", "n = int(input())\r\nt = list(map(int , input().split()))\r\n\r\nmn = 10e40\r\ndone = 0\r\nmin_cnt = 0\r\nidx = -1\r\nd = {}\r\n\r\nfor i in range(n):\r\n if(t[i] not in d.keys()):\r\n d[t[i]] = [i+1]\r\n else:\r\n d[t[i]].append(i+1)\r\n\r\nkey = min(list(d.keys()))\r\n\r\nif(len(d[key]) == 1):\r\n print(d[key][0])\r\nelse:\r\n print(\"Still Rozdil\")\r\n\r\n ", "numCities = int(input())\r\ndistances = [int(x) for x in input().split(' ')]\r\nif distances.count(min(distances)) > 1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(distances.index(min(distances)) + 1)", "n = int(input())\r\nlst = list(map(int,input().split()))\r\nans = lst.count(min(lst))\r\nif (ans > 1):\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(lst.index(min(lst))+1)", "input()\r\nr = lambda : list(map(int, input().split()))\r\narr = r()\r\nans = min(arr)\r\n\r\nif arr.count(ans) > 1: print(\"Still Rozdil\")\r\nelse: print(arr.index(ans) + 1)", "n = int(input())\r\ninput_list = list(map(int, input().split()))\r\nd = min(input_list)\r\nif input_list.count(d)>1:\r\n print('Still Rozdil')\r\nelse:\r\n print(input_list.index(d)+1)", "n = int(input())\r\ntime = list(map(int, input().split()))\r\n\r\nminTime = time[0]\r\nflag = False\r\nindex = 0\r\n\r\nfor i in range(1,n):\r\n if time[i] == minTime:\r\n flag = True\r\n if time[i] < minTime:\r\n minTime = time[i]\r\n index = i\r\n flag = False\r\n\r\n \r\nif flag: print(\"Still Rozdil\")\r\nelse: print(index+1)", "import math\r\n\r\ndef solve(n, cities_distances):\r\n min1 = math.inf\r\n min2 = math.inf\r\n min_index = 0\r\n for i in range(n):\r\n if cities_distances[i] < min1:\r\n min1 = cities_distances[i]\r\n min_index = i\r\n elif cities_distances[i] == min1:\r\n min2 = cities_distances[i]\r\n if min1 == min2:\r\n return \"Still Rozdil\"\r\n else:\r\n return min_index + 1\r\n\r\ndef main():\r\n n = int(input())\r\n cities_distances = [int(a) for a in input().strip().split()]\r\n print(solve(n, cities_distances))\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\na = [int(i) for i in input().split()]\n\nmn = min(a)\ncnt = a.count(mn)\n\nprint(a.index(mn) + 1 if cnt == 1 else \"Still Rozdil\")\n", "n = int(input())\ns = [int(a) for a in input().split()]\nmin = s[0]\nmini = 0\nz = 0\nfor i in range(1,len(s)):\n if s[i] < min:\n min = s[i]\n mini = i\n z = 0\n else:\n if s[i] == min:\n z = 1\nif z == 1:\n print('Still Rozdil')\nelse:\n print(mini + 1)\n", "N = int(input())\r\ntime = list(map(int,input().split()))\r\n\r\nminn = min(time)\r\ncount = 0\r\nfor i in time:\r\n if minn == i:\r\n count+=1\r\n\r\nif count>1:\r\n print('Still Rozdil')\r\nif count==1:\r\n print(time.index(minn)+1)", "n=int(input())\r\nif(n==1):\r\n print(1)\r\nelse:\r\n l=[int(i) for i in input().split()]\r\n t=sorted(l)\r\n if(t[0]==t[1]):\r\n print(\"Still Rozdil\")\r\n else:\r\n print(l.index(min(l))+1)", "# cook your dish here\r\nn = int(input())\r\ns = list(map(int,input().split(' ')))\r\n\r\nmin_ = min(s)\r\nidx_min = s.index(min_)\r\nflag = 0 \r\nfor i in s:\r\n if i==min_:\r\n flag+=1\r\nif flag!=1:\r\n print('Still Rozdil')\r\nelse:\r\n print(idx_min+1)\r\n\r\n# 1 3 5 7 2 4 6", "n = int(input())\nm1 = [-1,0]\nm2 = [-1,0]\nindex = 0\nfor i in [int(n) for n in input().split()]:\n index +=1\n if i<m1[0] or m1[0] == -1:\n m1 = [i,index]\n else:\n if i<m2[0] or m2[0] == -1:\n m2 = [i,index]\n\nif m1[0] != m2[0]:\n print(m1[1])\nelse:\n print(\"Still Rozdil\")\n\n \t \t \t \t\t \t\t\t\t \t", "\r\n\"\"\"\r\n Aug 31, 2021\r\n Written by Zach Leach - at 03:21 AM CST\r\n\r\n\"\"\"\r\n\r\nimport sys\r\ngetline = sys.stdin.readline\r\n\r\ndef read_int():\r\n return int(getline())\r\n\r\ndef read_ints():\r\n return list(map(int, getline().split()))\r\n\r\n\"\"\"\r\n Little Elephant and Rozdil\r\n\r\n\"\"\"\r\n\r\nn = read_int()\r\ntowns = read_ints()\r\n\r\nrozdil = False\r\nmt = 10e10\r\nindex = 1\r\n\r\ni = 0\r\nfor i in range(n):\r\n if towns[i] < mt:\r\n mt = towns[i]\r\n rozdil = False\r\n index = i + 1\r\n\r\n elif towns[i] == mt:\r\n rozdil = True\r\n\r\nif rozdil:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(index)\r\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\nk=min(arr)\r\nd=arr.index(k)\r\nif(arr.count(k)>1):\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(d+1)", "n = int(input())\r\ncities = list(map(int, input().split()))\r\n\r\n\r\nmini = float(\"inf\")\r\nkey = -1\r\nflag = False\r\nfor i,v in enumerate(cities):\r\n if v < mini:\r\n flag = True\r\n mini = v\r\n key = i+1\r\n elif v == mini:\r\n flag = False\r\n\r\nprint(key) if flag else print(\"Still Rozdil\")\r\n ", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nk=min(a)\r\nc=a.count(k)\r\nif (c==1):\r\n print(a.index(k)+1)\r\nelse:\r\n print(\"Still Rozdil\")\r\n \r\n", "input()\r\nX = list(map(int, input().split()))\r\nMIN = min(X)\r\nprint(\"Still Rozdil\" if X.count(MIN) != 1 else X.index(MIN) + 1)\r\n", "n=int(input())\r\narr=[int(i) for i in input().split()]\r\nm=min(arr)\r\n\r\nif arr.count(m)>1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n i=arr.index(m)\r\n print(i+1)", "n = int(input())\na = list(map(int, input().split(' ')))\n\nm = min(a)\n\ni = -1\nc = 0\nfor j,x in enumerate(a):\n if m == x:\n c += 1\n i = j\n\nif c > 1:\n print(\"Still Rozdil\")\nelse:\n print(i + 1)\n\n\n", "n = int(input())\ns = list(map(int, input().split()))\nt = min(s)\nif s.count(t) > 1:\n print(\"Still Rozdil\")\nelse:\n print(s.index(t) + 1)\n", "n = int(input())\r\nar = list(map(int,input().split()))\r\n\r\nar_sort = ar.copy()\r\nar_sort.sort()\r\n\r\nif n == 1 :\r\n\tprint(1)\r\nelif ar_sort[0] == ar_sort[1] :\r\n\tprint(\"Still Rozdil\")\r\nelse :\r\n\tprint(ar.index(ar_sort[0]) + 1 )", "n = int(input())\r\n\r\narr = list(map(int, input().split()))\r\n\r\nminValue,c,ans = min(arr),0,-1\r\n\r\nfor i,item in enumerate(arr):\r\n \r\n if item == minValue:\r\n \r\n c += 1\r\n \r\n ans = i\r\n \r\n if c == 2:\r\n \r\n print(\"Still Rozdil\")\r\n \r\n break\r\n \r\nif c == 1:\r\n \r\n print(ans+1)", "n = int(input())\r\nli = list(map(int, input().split(\" \")))\r\nmini = min(li)\r\nc = li.count(mini)\r\nif(c==1):\r\n print(int(li.index(mini)) + 1)\r\nelse:\r\n print(\"Still Rozdil\")", "n = int(input())\r\nL = list(map(int,input().split()))\r\nmin = L[0]\r\nindex = []\r\nif len(L)==1:\r\n print(1)\r\nelse:\r\n for i in L:\r\n if i<=min:\r\n min = i\r\n for i in range(len(L)):\r\n if L[i]==min:\r\n index.append(i+1)\r\n if len(index)>1:\r\n print(\"Still Rozdil\")\r\n else:\r\n print(index[0])\r\n \r\n\r\n\r\n", "a = int(input())\r\nb = list(map(int,input().split()))\r\nc = min(b)\r\nif (b.count(c)>1):\r\n\tprint('Still Rozdil')\r\nelse:\r\n\tprint(b.index(c)+1)", "class Code:\r\n def __init__(self):\r\n self.n = int(input())\r\n self.arr = list(map(int, input().split()))\r\n\r\n def process(self):\r\n print(self.arr.index(min(self.arr)) + 1 if self.arr.count(min(self.arr)) == 1 else 'Still Rozdil')\r\n\r\n\r\nif __name__ == '__main__':\r\n code = Code()\r\n code.process()\r\n", "_ = input()\ndistances = [int(x) for x in input().split()]\n\n\nville = min(distances)\ncompte = distances.count(ville)\n\nif compte < 2:\n print(distances.index(ville) + 1)\nelse:\n print(\"Still Rozdil\")\n", "a=int(input())\r\nb=list(map(int,input().split()))\r\ng={}\r\nval=float(\"inf\")\r\nans=0\r\nfor i in range(len(b)):\r\n #print(i,' !!!!',b[i])\r\n if val>b[i]:\r\n val=b[i]\r\n ans=i\r\n #print(\";\")\r\n if b[i] not in g:\r\n #print(\"kokokook\")\r\n g[b[i]]=1\r\n elif b[i] in g:\r\n #print(\"pllpplplpl\")\r\n g[b[i]]=g[b[i]]+1\r\n#print(g,' !!!!!',val,ans)\r\nif g[val]>1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(ans+1)", "n = int(input())\nv = sorted(zip(map(int, input().split()), range(1, n + 1)))\nif len(v) > 1 and v[0][0] == v[1][0]:\n print(\"Still Rozdil\")\nelse:\n print(v[0][1])\n", "n=int(input())\r\ncity=list(map(int,input().split()))\r\nm=min(city)\r\nif city.count(m)==1:\r\n print(city.index(m)+1)\r\nelse:\r\n print('Still Rozdil')", "n = int(input())\r\narray = list(map(int,input().split()))\r\nm = min(array)\r\ntemp = count = 0\r\nfor i in range(len(array)):\r\n if array[i] == m:\r\n count += 1\r\n temp = i\r\nif count > 1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(temp+1)", "\r\n# -*- coding: utf-8 -*-\r\n# @Date : 2019-03-21 13:42:01\r\n# @Author : raj lath ([email protected])\r\n# @Link : link\r\n# @Version : 1.0.0\r\n\r\nimport sys\r\nsys.setrecursionlimit(10**5+1)\r\n\r\ninf = int(10 ** 20)\r\nmax_val = inf\r\nmin_val = -inf\r\n\r\nRW = lambda : sys.stdin.readline().strip()\r\nRI = lambda : int(RW())\r\nRMI = lambda : [int(x) for x in sys.stdin.readline().strip().split()]\r\nRWI = lambda : [x for x in sys.stdin.readline().strip().split()]\r\n\r\n\r\nlens = RI()\r\ndist = RMI()\r\nans = min(dist)\r\nif dist.count(ans)> 1:\r\n ans = \"Still Rozdil\"\r\nelse:ans = dist.index(ans) + 1\r\nprint(ans)\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\nk = l.count(min(l))\r\nif k==1:print(l.index(min(l))+1)\r\nelse:print(\"Still Rozdil\")", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = sorted(a)\r\nif b.count(b[0]) > 1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(a.index(b[0]) + 1)\r\n", "#link : https://codeforces.com/problemset/problem/205/A\r\n#author : Mohamed Ibrahim\r\nn = int(input())\r\nlst = list(map(int,input().split()))\r\nm = min(lst)\r\nif lst.count(m) > 1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(lst.index(m)+1)", "number_of_cities = int(input())\r\ndistances = list(map(int, input().split()))\r\n\r\nminimum = min(distances)\r\n\r\ncounter = 0\r\nfor distance in distances:\r\n if distance == minimum:\r\n counter += 1\r\n\r\nif counter == 1:\r\n idx = distances.index(minimum)\r\n print(idx + 1)\r\nelse:\r\n print(\"Still Rozdil\")", "import math\r\nn = int(input())\r\nls = list(map(int,input().strip().split()))[:n]\r\n\r\nmin_val = ls[0]+1000\r\nmin_val_idx = 0\r\nflag = 0\r\n\r\nfor i in range(len(ls)):\r\n if ls[i] == min_val:\r\n flag = 1 \r\n elif ls[i] < min_val:\r\n min_val = ls[i]\r\n flag = 0\r\n min_val_idx = i+1\r\n \r\nif flag: \r\n print(\"Still Rozdil\") \r\nelse:\r\n print(min_val_idx)\r\n", "n=int(input())\r\ncities=list(map(int,input().split()))\r\nsmallest=cities[0]\r\nisStill=False\r\nfor i in range(1,len(cities)):\r\n if smallest == cities[i]:\r\n isStill=True\r\n if smallest > cities[i]:\r\n isStill=False\r\n smallest = cities[i]\r\nif isStill:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(cities.index(smallest)+1)\r\n", "n=int(input())\r\nlst=list(map(int,input().split()))\r\nmin=min(lst)\r\n#print(min)\r\ncount=0\r\nfor i in lst:\r\n if i==min:\r\n count+=1\r\nif count>=2:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(lst.index(min)+1)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nx=min(l)\r\nif l.count(x)>1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(l.index(x)+1) ", "# A. Little Elephant and Rozdil\r\nn = int(input())\r\narr = list(map(int, input().rstrip().split()))\r\nx = min(arr)\r\nif arr.count(x) > 1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(arr.index(x)+1)", "n = int(input())\r\ntowns = [int(x) for x in input().split()]\r\nm = min(towns)\r\nif towns.count(m)>1:\r\n print('Still Rozdil')\r\nelse:\r\n print(towns.index(m)+1)\r\n", "m=int(input())\r\nl=map(int,input().split())\r\ncity=[]\r\nsayac=0\r\nliste=list(l)\r\nif liste.count(min(liste))>1:\r\n print(\"Still Rozdil\")\r\nif liste.count(min(liste))==1:\r\n print(liste.index(min(liste))+1)", "n = int(input())\r\narr = list(map(int, input().split()))\r\nminValue = arr[0]\r\nfor i in range(1, n):\r\n minValue = min(minValue, arr[i])\r\nif arr.count(minValue) > 1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(arr.index(minValue) + 1)", "n=int(input())\r\ns=list(map(int,input().split(\" \")))\r\nl=s.copy()\r\ns.sort()\r\nif len(l)==1:\r\n print(1)\r\nelse:\r\n if s[0]==s[1]:\r\n print(\"Still Rozdil\")\r\n else:\r\n k=l.index(s[0])\r\n print(k+1)\r\n\r\n\r\n\r\n\r\n ", "n=int(input())\r\narr=list(map(int,input().split()))\r\nm=min(arr)\r\nc=0\r\nfor i in range(n):\r\n\tif(arr[i]==m):\r\n\t\tj=i+1\r\n\t\tc+=1\r\n\r\nif(c>1):\r\n\tprint(\"Still Rozdil\")\r\nelse:\r\n\tprint(j)", "t = int(input())\r\na = list(map(int,input().split()))\r\nb = min(a)\r\nc = a.count(b)\r\nif(c>1):\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(a.index(b)+1) ", "n = int(input())\nvalues = [int(i) for i in input().split()]\n\ncurrent_min_index = 0\ncurrent_min_count = 1\n\nfor i in range(1, len(values)):\n if values[current_min_index] == values[i]:\n current_min_count += 1\n continue\n \n if values[current_min_index] > values[i]:\n current_min_index = i\n current_min_count = 1\n\nif current_min_count == 1:\n print(current_min_index+1)\nelse:\n print('Still Rozdil')\n", "n=int(input())\r\nli=list(map(int,input().split()))\r\na=min(li)\r\nif(li.count(a)>=2):\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(li.index(a)+1)\r\n ", "\r\nn=int(input())\r\nlst = list(map(int,input().split()))\r\nbest = min(lst)\r\nif lst.count(best) == 1:\r\n print(lst.index(best)+1)\r\nelse:\r\n print(\"Still Rozdil\")", "t = int(input())\r\nlists = list(map(int,input().split()))\r\nmini = min(lists)\r\nif lists.count(mini)>1:\r\n print(\"Still Rozdil\")\r\n\r\nelse:\r\n print(lists.index(mini)+1)", "from collections import Counter\r\n\r\nn = int(input())\r\nnums = input().split()\r\nnums = list(map(int, nums))\r\n\r\nres = Counter(nums)\r\n\r\nif res[min(nums)] > 1:\r\n print('Still Rozdil')\r\nelse:\r\n print(nums.index(min(nums)) + 1)\r\n", "t = int(input()); L = [int(x) for x in input().split()]\r\nm = L.index(min(L))\r\nc = 1\r\nfor i in range(len(L)):\r\n if i != m and L[i] == L[m]:\r\n c = 0\r\nprint(m + 1 if c else \"Still Rozdil\")", "n = int(input())\r\nl = list(map(int,input().split()))\r\nm = l[0]\r\nfor i in l:\r\n if i < m:\r\n m = i\r\nl2 = []\r\nfor i in range(len(l)):\r\n if l[i] == m:\r\n l2.append(i)\r\nif len(l2) > 1:\r\n print('Still Rozdil')\r\nelse:\r\n print(l2[0] + 1)", "n = int(input())\r\narr = list(map(int,input().split()))\r\nget = min(arr)\r\nc = arr.count(get)\r\nif c == 1:\r\n print(arr.index(get)+1)\r\nelse:\r\n print(\"Still Rozdil\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n ", "# https://codeforces.com/problemset/problem/205/A\r\n\r\nn = int(input())\r\ntowns = list(map(int, input().split()))\r\nmini = 1000000001\r\nfound_at = 0\r\ncnt = 0\r\nfor i, town in enumerate(towns):\r\n if town < mini:\r\n cnt = 1\r\n mini = town\r\n found_at = i\r\n elif town == mini:\r\n cnt += 1\r\nif cnt > 1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(found_at+1)\r\n", "_ = input()\r\nli = [int(x) for x in input().split()]\r\nmini = min(li)\r\nif li.count(mini)>1:\r\n print('Still Rozdil');\r\nelse:\r\n print(li.index(mini)+1)", "n=int(input())\r\nCities=list(map(int,input().split()))\r\n\r\nHmap={}\r\ncount=0\r\n\r\nfor item in Cities:\r\n Hmap[item]=1+Hmap.get(item,0)\r\nif Hmap[min(Cities)]>1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(Cities.index(min(Cities))+1) \r\n \r\n\r\n\r\n", "# cook your dish here\r\nfrom sys import stdin, stdout\r\nimport math\r\nfrom itertools import permutations, combinations\r\nfrom collections import defaultdict\r\nfrom bisect import bisect_left \r\n\r\ndef L():\r\n return list(map(int, stdin.readline().split()))\r\n\r\ndef In():\r\n return map(int, stdin.readline().split())\r\n\r\ndef I():\r\n return int(stdin.readline())\r\n\r\nP = 1000000007\r\nn = I()\r\nlis = L()\r\nmi = min(lis)\r\nif lis.count(mi) == 1:\r\n print(lis.index(mi)+1)\r\nelse:\r\n print(\"Still Rozdil\")\r\n \r\n \r\n \r\n ", "n = int(input())\r\narr = list(map(int,input().split(\" \")))\r\nmin_ele = min(arr)\r\ncount_min_ele = arr.count(min_ele)\r\nif(count_min_ele > 1):\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(arr.index(min_ele) + 1)", "n=int(input())\r\nlst=list(map(int,input().split()))\r\n\r\nmin_city=min(lst)\r\ntown_no=0\r\nflag=False\r\nfor i in range(len(lst)):\r\n if lst[i]==min_city and flag==False:\r\n town_no=i+1\r\n flag=True\r\n elif lst[i]==min_city and flag==True:\r\n print(\"Still Rozdil\")\r\n break\r\nelse:\r\n print(town_no)", "n = int(input())\r\na = list(map(int, input().split()))\r\ntemp = [x for x in a]\r\na.sort()\r\nif a.count(a[0]) > 1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n ans = temp.index(a[0])\r\n print(ans+1)", "t=int(input())\r\na=list(map(int,input().split(\" \")))\r\nb=min(a)\r\nif a.count(b)==1:\r\n print(a.index(b)+1)\r\nelse:\r\n print(\"Still Rozdil\")\r\n", "M = lambda : map(int,input().split())\r\nr = M()\r\ns = list(M())\r\nif s.count(min(s)) == 1:\r\n print(s.index(min(s)) + 1 )\r\nelse:\r\n print(\"Still Rozdil\")\r\n", "n = int(input())\r\nlist1 = [int(num) for num in input().split()]\r\nmin1 = list1[0]\r\nreps=1\r\nmin_ind=1\r\nfor i in range(1,len(list1)):\r\n if(list1[i]<min1):\r\n min1=list1[i]\r\n reps=1\r\n min_ind=i+1\r\n elif(list1[i]==min1):\r\n reps+=1\r\nif(reps==1):\r\n print(min_ind)\r\nelse:\r\n print(\"Still Rozdil\")", "n = int(input())\r\nt = list(map(int,input().split()))\r\nm = min(t)\r\nd = 0\r\nans = 0\r\nfor i in range(n):\r\n if ans == 0 and t[i] == m:\r\n d = i + 1\r\n ans = 1\r\n elif ans == 1 and t[i] == m:\r\n ans += 1\r\n\r\n\r\nprint(d if ans==1 else 'Still Rozdil')\r\n", "n=int(input())\r\nlst=list(map(int,input().split(\" \")))\r\na=min(lst)\r\n\r\nif lst.count(a)>1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(lst.index(a)+1)", "n=int(input())\r\ns=list(map(int,input().split()))\r\nprint(s.index(min(s))+1) if s.count(min(s))==1 else print(\"Still Rozdil\")", "n=int(input())\nD=list(map(int,input().split()))\nind=0\ncnt=1\nfor i in range(1,n):\n if D[i]< D[ind]:\n ind=i\n cnt=1\n elif D[i]==D[ind]:\n cnt += 1\n #otherwise D[i]>D[ind] do nothing\n \nif cnt>1:\n print(\"Still Rozdil\")\nelse:\n print (ind+1)\n ", "n=int(input())\r\nl=list(map(int, input().split()))\r\nm=min(l)\r\nstate=0\r\nfor i in range(n):\r\n if l[i]==m and state==0:\r\n state=1\r\n mark=i+1\r\n continue\r\n if l[i]==m and state==1:\r\n print(\"Still Rozdil\")\r\n exit(0)\r\n\r\nprint(mark)", "from sys import stdin, stdout\r\nimport math,sys\r\nfrom itertools import permutations, combinations\r\nfrom collections import defaultdict,deque,OrderedDict\r\nfrom os import path\r\nimport bisect as bi\r\nimport heapq \r\ndef yes():print('YES')\r\ndef no():print('NO')\r\nif (path.exists('input.txt')): \r\n #------------------Sublime--------------------------------------#\r\n sys.stdin=open('input.txt','r');sys.stdout=open('output.txt','w');\r\n def I():return (int(input()))\r\n def In():return(map(int,input().split()))\r\nelse:\r\n #------------------PYPY FAst I/o--------------------------------#\r\n def I():return (int(stdin.readline()))\r\n def In():return(map(int,stdin.readline().split()))\r\n\r\ndef main():\r\n try:\r\n n=I()\r\n l=list(In())\r\n d={}\r\n for x in l:\r\n if d.get(x,0)!=0:\r\n d[x]+=1\r\n else:\r\n d[x]=1\r\n t=min(d.keys())\r\n if d[t]!=1:\r\n print('Still Rozdil')\r\n else:\r\n for i in range(n):\r\n if t==l[i]:\r\n break\r\n print(i+1)\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()", "n = int(input())\r\nnumlis=[int(x) for x in input().split()]\r\nif(numlis.count(min(numlis))>1):\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(numlis.index(min(numlis))+1)", "a=int(input())\r\nm=input().split()\r\nfor i in range(a):\r\n m[i]=int(m[i])\r\nmin=10000000000000\r\nmini=0\r\nfor i in range(a):\r\n if m[i]<min:\r\n min=m[i]\r\n mini=i\r\nfor i in range(a):\r\n if i==mini:\r\n continue\r\n if m[i]==min:\r\n print('Still Rozdil')\r\n exit()\r\nprint(mini+1) ", "n = int(input())\ncities = list(map(int, input().split()))\nmini = 0\noccurance = 1\nfor i in range(1, n):\n if cities[i] < cities[mini]:\n mini = i\n occurance = 1\n elif cities[i] == cities[mini]:\n occurance += 1\nif occurance == 1:\n print(mini + 1)\nelse:\n print(\"Still Rozdil\")\n", "input()\r\nl= list(map(int, input().split()))\r\nyo= min(l)\r\nif l.count(yo)== 1:\r\n print(l.index(yo)+1)\r\nelse:\r\n print(\"Still Rozdil\")", "n = int(input())\r\ns = list(map(int, input().split()))\r\nx = min(s)\r\nx2 = s.count(x)\r\n\r\nif x2>1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(s.index(x) + 1)\r\n", "n = int(input())\nar = list(map(int,input().split()))\nprint(ar.index(min(ar))+1 if ar.count(min(ar)) == 1 else \"Still Rozdil\")", "n = int(input())\r\na = [int(x) for x in input().split()]\r\n\r\nmn = 2 * 10 ** 9\r\nc = 0\r\nidx = 10 ** 6\r\n\r\nfor i in range(n):\r\n x = a[i]\r\n if x < mn:\r\n c = 1\r\n mn = x\r\n idx = i\r\n elif x == mn:\r\n c += 1\r\n\r\nif c == 1:\r\n print(idx + 1)\r\nelse:\r\n print(\"Still Rozdil\")\r\n\r\n", "n = int(input())\r\nnums = list(map(int, input().split()))\r\nhop = min(nums)\r\nif sum([1 if x == hop else 0 for x in nums]) == 1:\r\n print(nums.index(hop) + 1)\r\nelse:\r\n print(\"Still Rozdil\")", "n = int(input())\r\nli = list(map(int,input().split()))\r\nif li.count(min(li)) > 1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(li.index(min(li))+1)\r\n\r\n", "n = int(input())\r\n\r\ncity = list(map(int, input().strip().split()))[:n]\r\n\r\nm = min(city)\r\n\r\nif (city.count(m)>1):\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(city.index(m)+1)\r\n ", "n = int(input())\r\nl = list(map(int,input().split())) \r\nmin =l[0]\r\nfor i in range(len(l)):\r\n if l[i] < min:\r\n min = l[i]\r\n\r\nc =0\r\nfor i in l:\r\n if i == min:\r\n c += 1\r\n\r\nif c>1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(l.index(min)+1)", "n = int(input())\r\nD = list(map(int,input().split()))\r\ns = 0\r\napp = 1\r\nfor x in range (1,n):\r\n if D[x] < D[s]:\r\n s = x \r\n app = 1\r\n elif D[x] == D[s]:\r\n app += 1 \r\nif app > 1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(s + 1)", "n = int(input())\r\nl = list(map(int,input().split()))\r\nmn = min(l)\r\nif l.count(mn) > 1:\r\n print('Still Rozdil')\r\nelse:\r\n print(l.index(mn) + 1)\r\n \r\n\r\n\r\n \r\n \r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n ", "n=int(input())\r\nl=list(map(int,input().split()))\r\nprint([l.index((min(l)))+1,'Still Rozdil'][l.count((min(l)))>=2])", "num = int(input())\r\nseq = input()\r\nseq = list(map(int, seq.split()))\r\n\r\na = min(seq)\r\ncount = 0\r\nelem = 0\r\nwhile elem < len(seq):\r\n if seq[elem] == a:\r\n count += 1\r\n point = elem\r\n elem += 1\r\n \r\nif count == 1:\r\n print(point+1)\r\nelse:\r\n print('Still Rozdil')", "n = int(input())\r\ncities = list(map(int, input().split()))\r\na = min(cities)\r\nif cities.count(a) == 1:\r\n print(cities.index(a)+1)\r\nelse:\r\n print(\"Still Rozdil\")\r\n ", "n = int(input())\r\ntowns = list(map(int, input().split(\" \")))\r\ncount = 0\r\nminimum = 1000000001\r\nfor i in range(0, n):\r\n if towns[i] < minimum:\r\n count = 1\r\n minimum = towns[i]\r\n min_index = i\r\n elif towns[i] == minimum:\r\n count += 1\r\nif count > 1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(min_index + 1)", "import sys\r\nimport math\r\nimport copy\r\nfrom collections import deque\r\nfrom collections import *\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n\r\ndef ll(): return list(map(int, input().split()))\r\n\r\n\r\ndef lf(): return list(map(float, input().split()))\r\n\r\n\r\ndef ls(): return list(map(str, input().split()))\r\n\r\n\r\ndef mn(): return map(int, input().split())\r\n\r\n\r\ndef nt(): return int(input())\r\n\r\n\r\ndef ns(): return input()\r\nn=nt()\r\nk=ll()\r\nl=min(k)\r\nct=0\r\nans=0\r\nfor x in range(n):\r\n if l==k[x]:\r\n ct+=1\r\n ans=x\r\n if ct==2:\r\n print(\"Still Rozdil\")\r\n exit(0)\r\nprint(ans+1)", "n = input(); *c, = map(int, input().split())\r\nif(c.count(min(c)) > 1): print(\"Still Rozdil\")\r\nelse: print(c.index(min(c))+1)", "n=int(input())\r\nl= {a:b for a,b in enumerate(map(int, input().split()),1)}\r\nmi=min(l,key=l.get)\r\n\r\nfor i in l:\r\n if i==mi:\r\n continue\r\n if l[i]==l[mi]:\r\n print('Still Rozdil')\r\n min=0\r\n break\r\nif min:\r\n print(mi)", "\ndef main():\n n = int(input())\n cities = [int(x) for x in input().split()]\n mini = min(cities)\n if cities.count(mini) > 1:\n print('Still Rozdil')\n else:\n print(cities.index(mini)+1)\n\nmain()\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\ndup = list(l)\r\nl.sort()\r\nif l.count(l[0])==1:\r\n print(dup.index(l[0]) + 1)\r\nelse: print('Still Rozdil')", "n = int(input())\r\nar = [int(i) for i in input().split()]\r\nif ar.count(min(ar))>1:\r\n print('Still Rozdil')\r\nelse:\r\n print(ar.index(min(ar))+1)", "a=int(input())\r\nl=list(map(int,input().split()))\r\nv=l[::-1]\r\nif 1+l.index(min(l)) == a-v.index(min(v)):\r\n print(l.index(min(l))+1)\r\nelse:\r\n print(\"Still Rozdil\")", "x=int(input())\r\narr=list(map(int,input().split()))\r\nnew=sorted(arr)\r\nif x>1 and new[0]==new[1]:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(arr.index(new[0])+1)\r\n\r\n ", "from sys import stdin, setrecursionlimit, stdout\n#\tsetrecursionlimit(100000) #use \"python\" instead of \"pypy\" to avoid MLE\nfrom io import BytesIO\nimport os\nfrom collections import deque, Counter, defaultdict\nfrom math import sqrt, floor, ceil, log, log2, log10, pi, gcd, sin, cos, asin\nfrom heapq import heapify, heappop, heappush, heapreplace, heappushpop\n#\tto use maxheap, invert all the number.. that means, multyply with -1\nfrom bisect import bisect_right, bisect_left\n#\tnumber of elements in a range is bisect_right(a, el)-bisect_left(a, el)\nfrom string import ascii_letters, ascii_lowercase, ascii_uppercase, digits, hexdigits, whitespace, punctuation\n\n\ndef ii(): return int(input().decode()) if not DEBUG else int(input())\n\n\ndef fi(): return float(input().decode()) if not DEBUG else float(input())\n\n\ndef mi(): return map(int, input().decode().split()) if not DEBUG else map(int, input().split())\n\n\ndef fmi(): return map(float, input().decode().split()) if not DEBUG else map(float, input().split())\n\n\ndef li(): return list(mi())\n\n\ndef si(): return input().decode().rstrip() if not DEBUG else input().rstrip()\n\n\ndef msi(): return map(str, input().decode().split()) if not DEBUG else map(str, input().split())\n\n\ndef lsi(): return list(si())\n\n\n#######################################################################################\n########################### M Y F U N C T I O N S ###########################\n#######################################################################################\n\n\n#######################################################################################\n########################### M A I N P R O G R A M ###########################\n#######################################################################################\n\ndef main():\n\tn=ii()\n\ta=li()\n\tmn=min(a)\n\tans=-1\n\tfor i, el in enumerate(a):\n\t\tif el==mn:\n\t\t\tif ans!=-1:\n\t\t\t\tprint(\"Still Rozdil\")\n\t\t\t\treturn\n\t\t\tans=i\n\tprint(ans+1)\n\n\n\n\n\n\n#######################################################################################\n########################### S T A R T E R P A C K ###########################\n#######################################################################################\n\nif __name__ == \"__main__\":\n\tDEBUG = os.environ.get(\"__DEBUG__\")\n\n\tif DEBUG:\n\t\tif os.stat(\"input.txt\").st_size == 0:\n\t\t\tinput = stdin.readline\n\t\telse:\n\t\t\tinput = open('input.txt', 'r').readline\n\telse:\n\t\tinput = BytesIO(os.read(0, os.fstat(0).st_size)).readline\n\n\tvow = {'A', 'E', 'I', 'O', 'U'}\n\tmod = 1000000007\n\tres = ['NO', 'YES']\n\tadj4 = [[-1, 0], [0, -1], [0, 1], [1, 0]]\n\tadj8 = [[-1, -1], [-1, 0], [-1, 1], [0, -1], [0, 1], [1, -1], [1, 0], [1, 1]]\n\n\ttest, test_case = 0, 1\n\t#test_case = int(input())\n\n\twhile test < test_case:\n\t\ttest += 1\n\t\tif DEBUG:\n\t\t\tprint('>>>>>>>>>>>>> Case #{} >>>>>>>>>>>>>'.format(test))\n\t\t\tpass\n\t\t# print('Case ', test, ': ', sep='', end='')\n\t\tmain()\n \t\t \t\t\t\t\t \t \t\t\t\t \t \t\t \t \t", "n=int(input())\r\narr=[int(x) for x in input().split()]\r\nnum=min(arr)\r\nif arr.count(num)>1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(arr.index(num)+1)", "r=int(input(\"\"))\r\nc=list(map(int,input().split(\" \")))\r\nf=min(c)\r\nd=0\r\nfor i in range(r):\r\n if c[i]==f:\r\n d+=1\r\nif d==1:\r\n print(c.index(min(c))+1)\r\nelse:\r\n print(\"Still Rozdil\")", "import sys\r\nn = int(input())\r\narr = list(map(lambda x: int(x), input().split()))\r\n\r\ncount, m, res = 0, sys.maxsize, 0\r\nfor i in range(n):\r\n\tif arr[i] == m:\r\n\t\tcount += 1\r\n\telif arr[i] < m:\r\n\t\tm = arr[i]\r\n\t\tcount = 1\r\n\t\tres = i+1\r\n\r\n\r\nif count == 1:\r\n\tprint(res)\r\nelse:\r\n\tprint(\"Still Rozdil\")", "n=int(input())\r\narr=[int(x) for x in input().split()]\r\n\r\n\r\nminimum=min(arr)\r\n\r\nif arr.count(minimum)<2:\r\n print(arr.index(minimum)+1)\r\nelse:\r\n print(\"Still Rozdil\")", "n = int(input())\r\n\r\nl = [int(a) for a in input().split()]\r\n\r\nif l.count(min(l)) > 1:\r\n print('Still Rozdil')\r\nelse:\r\n print(l.index(min(l))+1)", "n = int(input())\r\ndata = list(map(int, input().split()))\r\n\r\ntmp = min(data)\r\nif data.count(tmp)>=2:\r\n print('Still Rozdil')\r\nelse:\r\n print(data.index(tmp)+1)", "def Little_Elephant_and_Rozdil():\r\n number_of_cities = int(input())\r\n time_taken_for_each_city = input().split(' ')\r\n time_taken_for_each_city = [eval(i) for i in time_taken_for_each_city]\r\n\r\n minimum_time = min(time_taken_for_each_city)\r\n minimum_indexes = [i for i,x in enumerate(time_taken_for_each_city) if x == minimum_time]\r\n\r\n if len(minimum_indexes) > 1:\r\n print(\"Still Rozdil\")\r\n else:\r\n print(minimum_indexes[0]+1)\r\n\r\nLittle_Elephant_and_Rozdil()", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nm = min(lst)\r\nif lst.count(m) == 1:\r\n print(lst.index(m)+1)\r\nelse:\r\n print(\"Still Rozdil\")", "n = int(input())\r\nl = list(map(int,input().split()))\r\nmn = min(l)\r\ncnt = 0\r\nflag = 1\r\nfor i in l:\r\n if(i == mn):\r\n cnt += 1\r\n if(cnt>1):\r\n print(\"Still Rozdil\")\r\n flag = 0\r\n break\r\nif(flag):\r\n print(l.index(mn)+1)\r\n", "n = int(input().strip())\r\na = [int(i) for i in input().strip().split()]\r\nmini = 9999999999999\r\nminii = 99999999999\r\nfor i in range(len(a)):\r\n if a[i] < mini:\r\n mini = a[i]\r\n minii = i+1 \r\nc = a.count(mini) \r\nif c == 1:\r\n print(minii)\r\nelse:\r\n print('Still Rozdil')\r\n", "n=int(input())\r\nlst=list(map(int,input().split()))\r\nif((lst.count(min(lst)))>1):\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(lst.index(min(lst))+1)", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=a.count(min(a))\r\nif b>1:\r\n print('Still Rozdil')\r\nelse:\r\n print(a.index(min(a))+1)\r\n", "n=int(input())\r\nlis=list(map(int,input().split()))\r\nmi=min(lis)\r\nif lis.count(mi)>1:print('Still Rozdil')\r\nelse:print(lis.index(mi)+1)", "n = int(input())\r\ncities = list(map(int, input().split()))\r\nm = min(cities)\r\nif cities.count(min(cities)) > 1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(cities.index(m)+1)", "n=int(input())\r\nc=list(map(int,input().split()))\r\na=min(c)\r\nb=c.count(a)\r\nif b==1:\r\n print((c.index(a))+1)\r\nelse:\r\n print(\"Still Rozdil\")\r\n", "n = int(input())\r\narr =list(map(int, input().split()))\r\nminimum_index = 0\r\ncounter = 0\r\nfor i in range(1, n):\r\n if arr[i] == arr[minimum_index]:\r\n counter += 1\r\n if arr[i] < arr[minimum_index]:\r\n counter = 0\r\n minimum_index = i\r\n\r\nif counter > 0:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(minimum_index+1)", "n = int(input())\r\nl1 = [int(x) for x in input().split()]\r\nif l1.count(min(l1))>1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(l1.index(min(l1))+1)\r\n", "n=int(input())\r\ntime=[int(i) for i in input().split()]\r\nans=min(time)\r\nd={}\r\nfor i in range(n):\r\n d[time[i]]=i+1\r\nif time.count(ans)==1:\r\n print(d[ans])\r\nelse:\r\n print(\"Still Rozdil\")", "n=int(input())\r\npath=[int(i) for i in input().split()]\r\nfor i in range(0,n):\r\n path[i]=(path[i],i)\r\npath.sort()\r\nans=\"Still Rozdil\"\r\nif(n==1):\r\n ans=\"1\"\r\nelse:\r\n if(path[0][0]!=path[1][0]):\r\n ans=path[0][1]+1\r\nprint(ans)", "n = int(input())\r\narr = list(map(int ,input().split()))\r\nlow = min(arr)\r\n\r\nindices = [i for i, x in enumerate(arr) if x == low]\r\n\r\nif len(indices) > 1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(arr.index(low) + 1)", "from math import ceil\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\nm=min(arr)\r\nc=arr.count(m)\r\nif(c!=1):\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(arr.index(m)+1)\r\n\r\n\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\na=min(l)\r\nif l.count(a)>1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(l.index(a)+1)", "# Little Elephant and Rozdil\ndef rozdil(arr):\n smol = min(arr)\n if arr.count(smol) > 1:\n return \"Still Rozdil\"\n return arr.index(smol) + 1\n\n\nn = int(input())\narr = list(map(int, input().split()))\nprint(rozdil(arr))\n", "n=int(input())\r\nt=list(map(int,input().split()))\r\nm=min(t)\r\nif(t.count(m)>1):\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(t.index(m)+1)", "\r\nn = int(input())\r\n\r\nx = [int(x) for x in input().split()]\r\n\r\nmn = x[0]\r\nd = 1\r\nr = 0\r\n\r\nfor i in range(1 , n):\r\n if x[i] < mn:\r\n mn = x[i]\r\n d = i + 1\r\n r = 0\r\n elif x[i] == mn:\r\n r = 1\r\n \r\nprint(d if r == 0 else 'Still Rozdil')", "n=int(input())\r\nlis=list(map(int,input().split()))\r\nmin=min(lis)\r\nif lis.count(min)>1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(lis.index(min)+1)", "n=int(input())\r\nm=list(map(int,input().split()))\r\na=min(m)\r\nb=0\r\nfor i in range(n):\r\n if(m[i]==a):\r\n b+=1\r\n if(b==1):\r\n y=i+1\r\n else:\r\n break\r\nif(b==2):\r\n print('Still Rozdil')\r\nelse:\r\n print(y)\r\n", "def Sol(arr):\r\n\t\r\n\tm = min(arr)\r\n\tif arr.count(m) > 1:\r\n\t\tprint(\"Still Rozdil\")\r\n\telse:\r\n\t\tfor i in range(len(arr)):\r\n\t\t\tif m == arr[i]:\r\n\t\t\t\tprint(i+1)\r\n\t\t\t\tbreak\r\n\treturn\r\n#n = int(input())\r\n#for i in range(int(input())):\r\nn = int(input())\r\narr = list(map(int,input().split()))\r\nSol(arr)", "n=int(input())\r\na=list(map(int,input().split()))\r\nz=a.count(min(a))\r\nif z>1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(a.index(min(a))+1)", "n=int(input())\r\n\r\n\r\nt=list(map(int,input().split()))\r\n\r\n\r\np=t.count(min(t))\r\n\r\n\r\nif p==1:\r\n print(t.index(min(t))+1)\r\nelse:\r\n print('Still Rozdil')\r\n", "min_val = 10**10\r\nmin_ind = -1\r\nfirst = True\r\n\r\ninput()\r\nfor i, v in enumerate(map(int, input().split())):\r\n if v < min_val:\r\n first = True\r\n min_ind = i + 1\r\n min_val = v\r\n elif v == min_val:\r\n first = False\r\n\r\nprint('Still Rozdil' if not first else min_ind)\r\n", "import itertools\r\nimport sys\r\nfrom collections import defaultdict\r\nfrom math import sqrt\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return (int(input()))\r\n\r\n\r\ndef inlt():\r\n return (list(map(int, input().split())))\r\n\r\n\r\ndef insr():\r\n s = input()\r\n return (list(s[:len(s) - 1]))\r\n\r\n\r\ndef invr():\r\n return (map(int, input().split()))\r\n\r\n\r\ndef s(d):\r\n dis = 1 + 4 * 2 * 3 * d\r\n ds = sqrt(dis)\r\n return (-1 + ds) / 6\r\n\r\n\r\ndef main():\r\n d = inp()\r\n v = inlt()\r\n mn = min(v)\r\n if len([vv for vv in v if vv==mn]) >1:\r\n print('Still Rozdil')\r\n else:\r\n print(v.index(mn)+1)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n # sys.setrecursionlimit(10 ** 6)\r\n # threading.stack_size(10 ** 8)\r\n # t = threading.Thread(target=main)\r\n # t.start()\r\n # t.join()\r\n main()\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nind = 0\r\ncount = 1\r\nfor j in range(1,n):\r\n if a[ind] > a[j]:\r\n ind = j\r\n count = 1\r\n elif a[ind] == a[j]:\r\n count += 1\r\nif count>1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(ind + 1)", "n = int(input())\r\nlis = [int(x) for x in input().split()] \r\nm = min(lis)\r\n\r\n\r\nif(lis.count(m)==1):\r\n print(lis.index(m)+1)\r\nelse:\r\n print(\"Still Rozdil\")", "def solve():\r\n _min = min(array)\r\n _min_count = 0\r\n for i in array:\r\n if i == _min: _min_count += 1\r\n \r\n if _min_count > 1: return \"Still Rozdil\"\r\n else: return array.index(_min) + 1\r\n\r\nn = int(input())\r\narray = [int(i) for i in input().split(' ')]\r\nprint(solve())", "a=int(input())\r\nb=list(map(int,input().split()))\r\n\r\nc=b.count(min(b))\r\nif c==1:\r\n print(b.index(min(b))+1)\r\nelse:\r\n print('Still Rozdil')\r\n", "n = int(input())\r\nv = list()\r\nentered_list = input().split()\r\n#print(entered_list)\r\nv = list(map(int, entered_list))\r\n#print(v)\r\ni = 0\r\nm = v[0]\r\nind = 0\r\nwhile i < n:\r\n if m > v[i]:\r\n m = v[i]\r\n ind = i\r\n i += 1\r\nif v.count(m) == 1:\r\n print(ind + 1)\r\nelse:\r\n print(\"Still Rozdil\")", "#!/usr/bin/env python3\n\nif __name__ == \"__main__\":\n\tn = int(input())\n\tais = list(map(int, input().split()))\n\tminn = 0\n\tflag = 1\n\tfor i in range(1,n):\n\t\tif ais[i] < ais[minn]:\n\t\t\tminn = i\n\t\t\tflag = 1\n\t\telif ais[i] == ais[minn]:\n\t\t\tflag = 0\n\tif flag == 1:\n\t\tprint(minn+1)\n\telse:\n\t\tprint(\"Still Rozdil\")\n", "#rOkY\r\n#FuCk\r\n\r\n################################## kOpAl #####################################\r\n\r\nt=int(input())\r\nl=list(map(int,input().split()))\r\nmi=min(l)\r\ncount=0\r\np=0\r\nfor i in range(0,len(l),1):\r\n if(l[i]==mi):\r\n p=i\r\n count+=1\r\nif(count==1):\r\n print(p+1)\r\nelse:\r\n print(\"Still Rozdil\")\r\n", "from collections import Counter\r\nn=int(input())\r\nl=[int(i) for i in input().split()]\r\nd=dict(Counter(l))\r\nminimum=min(l)\r\nif d[minimum]==1:\r\n print(l.index(minimum)+1)\r\nelse:\r\n print('Still Rozdil')", "n=int(input())\r\nlst = [int(i) for i in input().split()][:n]\r\nm=min(lst)\r\ncount=0\r\nfor i in lst:\r\n if(m==i):\r\n count=count+1\r\n if(count>1):\r\n print(\"Still Rozdil\")\r\n exit()\r\nprint(lst.index(m)+1)\r\n", "n, a = int(input()), list(map(int, input().split()))\r\nprint('Still Rozdil' if a.count(min(a)) != 1 else a.index(min(a)) + 1)\r\n", "n=int(input())\r\nx=list(map(int, input().split()))\r\ny=min(x)\r\nc=0\r\nfor i in range(len(x)):\r\n if y==x[i]:\r\n c+=1\r\nif c>=2:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(1+x.index(y))\r\n \r\n \r\n \r\n", "a = int(input())\r\nk = list(map(int,input().split()))\r\nt = sorted(k)\r\nif t[0] in t[1:]:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(k.index(t[0])+1)\r\n", "n = int(input())\r\na = list(map(int, input().split(\" \")))\r\nminimum = min(a)\r\nprint(a.index(minimum)+1 if a.count(minimum) == 1 else \"Still Rozdil\")", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nmini = min(a)\r\ncount = check = 0\r\nfor i in range(n):\r\n if a[i]==mini:\r\n index = i+1\r\n count += 1\r\n if count==2:\r\n print('Still Rozdil')\r\n check = 1\r\n break\r\nif not check:\r\n print(index)", "n=int(input())\r\nlst=list(map(int,input().split(\" \")))\r\nm=min(lst)\r\ncount=lst.count(m)\r\nif count!=1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(lst.index(m)+1)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\n\r\nel = min(l)\r\ncnt = l.count(el)\r\nind = l.index(el)\r\n\r\nif cnt==1:\r\n print(ind+1)\r\n \r\nelse:\r\n print('Still Rozdil')\r\n ", "city_count = int(input())\r\ncity_time = input().split()\r\nminimum = int(city_time[0])\r\ncity_output = 0\r\ncount = 1\r\n\r\nfor j in range(1, city_count):\r\n\ti = int(j)\r\n\r\n\tif int(city_time[i])<minimum:\r\n\t\tminimum = int(city_time[i])\r\n\t\tcount = 1\r\n\t\tcity_output = i\r\n\telif minimum == int(city_time[i]):\r\n\t\tcount += 1\r\n\r\nif count >= 2:\r\n\tprint(\"Still Rozdil\")\r\n\r\nelse: \r\n\tprint(city_output + 1)", "inp = int(input())\r\n\r\na = [int(inp) for inp in input().split()]\r\n\r\n\r\noper = min(a)\r\n\r\nind = a.index(min(a))\r\nif len(a) > 1:\r\n\ta.remove(min(a))\r\n\r\n\toper_1 = min(a)\r\n\r\n\tif oper == oper_1:\r\n\t\tprint (\"Still Rozdil\")\r\n\r\n\telse:\r\n\t\tprint (ind + 1)\r\n\r\nelse:\r\n\tprint (ind + 1) \r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=l.count(min(l))\r\nif m==1: print(l.index(min(l))+1)\r\nelse: print('Still Rozdil')", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=min(l)\r\nc=0\r\nflag=True\r\nfor i in range(n):\r\n if l[i]==m and c==0:\r\n pos=i\r\n c=c+1\r\n elif l[i]==m and c>=1:\r\n c=c+1\r\n flag=False\r\n break\r\nif flag==True:\r\n print(pos+1)\r\nelse:\r\n print(\"Still Rozdil\")", "n=int(input())\narr=[int(x) for x in input().split(' ')]\nans=min(arr)\nif arr.count(ans)>1:\n\tprint(\"Still Rozdil\")\nelse:\n\tprint(arr.index(ans)+1)", "n = int(input())\r\ntime = list(map(int, input().strip().split()))\r\nif time.count(min(time)) >= 2:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(time.index(min(time))+1)", "n = int(input())\ndistance = list(map(int, input().split()))\nX = min(distance)\nt = distance.count(X)\nif t > 1:\n print (\"Still Rozdil\")\nelse: #If there is only one X \n ans = distance.index(X)\n ans += 1 \n print (ans)", "def main():\n #leitura dos dados: lista de tuplas(distancia, posição) ordenadas pela distancia\n n = int(input())\n cidades = [int(x) for x in input().split()]\n print(solve(cidades, n))\n\ndef solve(cidades, n):\n menor_distancia = cidades[0]\n numero_cidade = 0\n for i in range(n):\n if cidades[i] < menor_distancia:\n menor_distancia = cidades[i]\n numero_cidade = i\n qnt = 0\n for j in range(n):\n if cidades[j] == menor_distancia:\n qnt += 1\n if qnt == 2: return 'Still Rozdil'\n return numero_cidade + 1\n\nmain()\n\t \t\t \t\t \t \t \t\t\t\t\t \t\t\t", "n = int(input())\r\nb = list(map(int, input().split()))\r\na=sorted(b)\r\nif(n==1):\r\n print(1)\r\nelif(a[0]==a[1]):\r\n print(\"Still Rozdil\")\r\nelse:\r\n for ind,o in enumerate(b):\r\n if(o==a[0]):\r\n print(ind+1)", "cities = int(input())\r\ndistance = list(map(int, input().split()))\r\nclosest = min(distance)\r\n\r\nif distance.count(closest) == 1:\r\n print(distance.index(closest)+ 1)\r\nelse:\r\n print('Still Rozdil')", "n = int(input())\r\nl = list(map(int, input().split()))\r\nk = l[:]\r\nif n == 1:\r\n print(1)\r\n\r\nelse:\r\n\r\n l.sort()\r\n\r\n if l[0] == l[1]:\r\n print(\"Still Rozdil\")\r\n else:\r\n print(k.index(l[0]) + 1)", "n=int(input())\r\na=[]\r\na=[e for e in map(int,input().split())]\r\ns=1\r\ne=0\r\nfor i in range(n):\r\n if i==0:\r\n d=a[0]\r\n else :\r\n if d>a[i]:\r\n d=a[i]\r\n s=i+1\r\nfor k in range(n):\r\n if d==a[k]:\r\n e=e+1\r\nif e>1:\r\n print(\"Still Rozdil\")\r\nelse :\r\n print(s)\r\n \r\n \r\n", "n=int(input())\r\ntown,*towns=map(int,input().split())\r\nd={}\r\nd[town]=1\r\nm=town\r\nj=0\r\nfor i,town in enumerate(towns):\r\n if town in d:\r\n d[town]+=1\r\n else:\r\n d[town]=1\r\n if town<m:\r\n m=town\r\n j=i+1\r\nif d[m]>1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(j+1)\r\n", "from math import sqrt\r\ndef calc(arr):\r\n mini, idx = float('inf'), -1\r\n not_valid = False\r\n for i in range(len(arr)):\r\n if arr[i] < mini:\r\n idx = i\r\n mini = arr[i]\r\n not_valid = False\r\n elif arr[i] == mini:\r\n not_valid= True\r\n\r\n if not_valid:\r\n return \"Still Rozdil\"\r\n return idx+1\r\n\r\n# get inputs\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\nprint(calc(arr))\r\n\r\n\r\n", "a = int(input()) \r\ntmp = str(input())\r\nl = list(tmp.split())\r\nanswer = int(l[0])\r\n#if 1 < answer:\r\n# print(answer)\r\nidx = 1 \r\nflag = 0 \r\nfor i in range(1,a):\r\n if int(l[i]) < answer:\r\n answer = int(l[i])\r\n idx = i + 1\r\n flag = 0\r\n# print(idx)\r\n elif int(l[i]) == answer:\r\n flag = 1\r\n# print(idx)\r\n \r\nif flag == 0:\r\n print(idx)\r\nelse:\r\n print(\"Still Rozdil\")\r\n\r\n# l = list(map(int,input().split())) \r\n", "n = int(input())\r\nt = [int(i) for i in input().split()]\r\n\r\nm = min(t)\r\nif t.count(m)>1:\r\n\tprint(\"Still Rozdil\")\r\nelse:\r\n\tprint(t.index(m)+1)", "n=int(input())\r\na=list(map(int,input().split()))\r\nk=min(a)\r\nif(a.count(k)>1):\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(a.index(k)+1)", "from collections import deque\r\nimport math\r\nfrom random import randint as rand\r\nfrom functools import lru_cache\r\nimport string\r\nalph_l = string.ascii_lowercase\r\nalph_u = string.ascii_uppercase\r\n\r\n\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n if a.count(min(a)) > 1:\r\n print('Still Rozdil')\r\n else:\r\n print(a.index(min(a)) + 1)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n=int(input())\r\narr=list(map(int,input().split()))\r\nm=arr[0]\r\nfor i in range(n):\r\n m=min(m,arr[i])\r\nc=0\r\nfor i in range(n):\r\n if arr[i]==m:\r\n c+=1\r\n ans=i+1\r\nif c>1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(ans)", "\r\na=int(input())\r\nb=list(map(int,input().split()))\r\nc=min(b)\r\nd=b.count(c)\r\nif d>1:\r\n print('Still Rozdil')\r\n quit()\r\ne=b.index(c)\r\nprint(e+1)", "n = int(input())\r\na = list(map(int,input().split()))\r\n\r\nmin_value = min(a)\r\nmin_index = a.index(min_value)\r\ncount =0\r\nfor i in range(len(a)):\r\n if a[i]== min_value:\r\n count+=1\r\n\r\nif (count>1):\r\n print('Still Rozdil')\r\nelse:\r\n print(min_index+1)", "from collections import deque\r\nfrom math import log,sqrt,ceil\r\ndef ii(): return int(input())\r\ndef si(): return input()\r\ndef mi(): return map(int,input().strip().split(\" \"))\r\ndef li(): return list(mi())\r\nn=ii()\r\na=li()\r\nif(a.count(min(a))>1):\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(a.index(min(a))+1)", "i=int(input())\nl=[int(x) for x in input().split()]\nk=min(l)\nif l.count(k) >1:\n print('Still Rozdil')\nelse:\n print(l.index(k)+1)\n\n", "# import inbuilt standard input output\nfrom sys import stdin, stdout\nimport math\ndef main():\n n = int(stdin.readline())\n list_ = [int(z) for z in stdin.readline().split(\" \")]\n # diffs = [abs(list_[(i+1)%n] - list_[i]) for i in range(len(list_))]\n min_ = math.inf\n multiple = False\n final_ind = 0\n for ind, item in enumerate(list_):\n if item < min_:\n multiple = False\n min_ = item\n final_ind = ind\n elif item == min_:\n multiple = True\n \n if multiple:\n output = \"Still Rozdil\"\n else:\n output = str(final_ind + 1) \n stdout.write(output)\n\nif __name__ == \"__main__\":\n main()", "n = int(input())\n\ncities = list(map(int, input().split()))\n\nminim = min(cities)\n\nif cities.count(minim) > 1:\n print(\"Still Rozdil\")\nelse:\n print(cities.index(minim) + 1)", "n = int(input())\r\nt = list(map(int, input().split()))\r\n\r\nmin_time = min(t)\r\n\r\nif t.count(min_time) > 1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(t.index(min_time) + 1)\r\n", "n = int(input())\r\nnums = list(map(int, input().split()[:n]))\r\n\r\nif nums.count(min(nums)) == 1:\r\n print(nums.index(min(nums))+1)\r\nelse:\r\n print(\"Still Rozdil\")", "def find_destination(n, times):\r\n min_time = min(times)\r\n if times.count(min_time) == 1:\r\n return times.index(min_time) + 1\r\n else:\r\n return \"Still Rozdil\"\r\n\r\n\r\nn = int(input())\r\ntimes = list(map(int, input().split()))\r\nresult = find_destination(n, times)\r\nprint(result)", "n = int(input())\r\nl = list(map(int,input().split()))\r\nmini = min(l)\r\nif(l.count(mini)<2):\r\n print(l.index(mini)+1)\r\nelse:\r\n print(\"Still Rozdil\")", "import math\r\nx= int(input())\r\ny= input().split()\r\ny= [int(i) for i in y]\r\nz=[]\r\nfor i in y:\r\n z.append(i)\r\ny.sort()\r\n\r\nif y.count(y[0])==1:\r\n print(z.index(y[0])+1)\r\nelse:\r\n print(\"Still Rozdil\")", "n=int(input())\r\n\r\narr=list(map(int,input().split()))\r\n\r\nmn=0\r\n\r\n\r\nmn=min(arr)\r\nind=0\r\ncnt=0\r\nfor i in range(n):\r\n if(arr[i]==mn):\r\n cnt+=1\r\n ind=i\r\n if(cnt>1):\r\n print(\"Still Rozdil\")\r\n break\r\n \r\nif(cnt<=1):\r\n print(ind+1)\r\n\r\n ", "def rozdil(a):\r\n mini = min(a)\r\n if(a.count(mini)>1):\r\n return \"Still Rozdil\"\r\n else:\r\n return a.index(mini)+1\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nprint(rozdil(a))", "input()\r\na=*map(int,input().split()),\r\nc=min(a)\r\nprint([a.index(c)+1,'Still Rozdil'][a.count(c)>1])", "a = int(input())\r\nb = list(map(int,input().split()))\r\n\r\nmin = b[0]\r\nfor i in b:\r\n if(i<min):\r\n min = i\r\n\r\nif(b.count(min)==1):\r\n print(b.index(min)+1)\r\nelse:\r\n print('Still Rozdil')", "n = int(input())\r\nli = list(map(int, input().split()))\r\nm = min(li)\r\nif li.count(m) > 1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(li.index(m) + 1)\r\n", "#!/usr/bin/env python\r\n\r\nimport math\r\nimport sys\r\nimport itertools\r\nimport fractions\r\n\r\nif __name__ == '__main__':\r\n wtf = sys.stdin.read()\r\n wtf = wtf.strip().split('\\n')\r\n n = int(wtf[0])\r\n A = list(map(int, wtf[1].split()))\r\n Ak = sorted(range(n), key=lambda k:A[k])\r\n if n == 1:\r\n print(Ak[0]+1)\r\n else:\r\n if A[Ak[0]] == A[Ak[1]]:\r\n print('Still Rozdil')\r\n else:\r\n print(Ak[0]+1)\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\nminpos = l.index(min(l))\r\na = min(l)\r\ncount = 0\r\nfor i in range(len((l))):\r\n if a == l[i] :\r\n count += 1\r\nif count == 1 :\r\n print(minpos+1)\r\nelse:\r\n print('Still Rozdil')\r\n\r\n\r\n\r\n", "num_cities = int(input())\n\nlist = list(map(int, input().split()))\n\nindex = 0\nmin = list[0]\ncount = 0\nfor i in range(len(list)):\n if list[i] < min:\n min = list[i]\n index = i\n count = 1\n elif list[i] == min:\n count+= 1\n\nif count > 1:\n print(\"Still Rozdil\")\nelse:\n print(index+1)\n", "n = int(input())\r\nlis = list(map(int,input().split()))\r\np = lis.count(min(lis))\r\nif p>1:\r\n print('Still Rozdil')\r\nelse:\r\n print(lis.index(min(lis))+1)", "n=int(input())\r\nlst=[int(x) for x in input().split()]\r\nif lst.count(min(lst))==1:print(lst.index(min(lst))+1)\r\nelse:print('Still Rozdil')\r\n", "# LUOGU_RID: 92352114\nn = int(input())\r\ntimes = list(map(int, input().split()))\r\n\r\nminimum = 10000000000\r\ncnt = 1\r\nfor x in times:\r\n if x < minimum:\r\n minimum = x\r\n cnt = 1\r\n elif x == minimum:\r\n cnt += 1\r\n elif x > minimum:\r\n continue\r\n\r\nif cnt == 1:\r\n print(times.index(minimum) + 1)\r\nelif cnt > 1:\r\n print('Still Rozdil')\r\n", "n = int(input())\r\n\r\narr = list(map(int,input().split()))\r\n\r\nminVal = min(arr)\r\n\r\ncount = 0\r\nindex = -100\r\nfor i,num in enumerate(arr):\r\n if minVal ==num:\r\n index=i\r\n count+=1\r\n\r\n\r\nif count==1:\r\n print(index+1)\r\n\r\nelse:\r\n print(\"Still Rozdil\")\r\n", "n = int(input())\r\ntime = list(map(int,input().split(' ')))\r\n\r\nmin_time = 1e9+1\r\nfor i in range(n):\r\n if time[i] < min_time:\r\n min_time = time[i]\r\n num_city = i+1\r\n elif time[i] == min_time:\r\n num_city = \"Still Rozdil\"\r\n \r\nprint(num_city)", "n=int(input())\ntimes=list(map(int,input().split()))\nc=min(times)\nif times.count(c)>1:\n print(\"Still Rozdil\")\nelse:\n print(times.index(c)+1)\n ", "n = int(input())\ncd = [int(x) for x in input().split(\" \")]\nmin_count = 1\nmin = 0\nfor i in range(1, n):\n if cd[i] < cd[min]:\n min = i\n min_count = 1\n elif cd[i] == cd[min]:\n min_count += 1\nif(min_count > 1):\n print(\"Still Rozdil\")\nelse:\n print(min + 1)\n", "def main():\n input()\n times = [int(_) for _ in input().split()]\n min_city = min(times)\n\n print(times.index(min_city) + 1 if times.count(min_city) == 1 else 'Still Rozdil')\n\n\nif __name__ == '__main__':\n main()\n", "# LUOGU_RID: 101471364\nn, *a = map(int, open(0).read().split())\r\nif a.count(min(a)) > 1:\r\n print('Still Rozdil')\r\nelse:\r\n print(a.index(min(a)) + 1)", "input(); vals = [* map(int, input().split())]\n\nres = min(vals)\nif vals.count(res) > 1:\n print(\"Still Rozdil\")\nelse:\n print(vals.index(res)+1)\n", "n = int(input())\r\nc = [int(x) for x in input().split(' ')]\r\n\r\n\r\nif c.count(min(c)) == 1:\r\n ans = c.index(min(c)) + 1\r\nelse:\r\n ans = 'Still Rozdil'\r\nprint(ans)\r\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\nminn = min(arr)\r\nif arr.count(minn)>1:\r\n print('Still Rozdil')\r\nelse:\r\n print(arr.index(minn)+1)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nif(n==1):\r\n print(1)\r\nelse:\r\n minimum=min(l)\r\n index=l.index(min(l))\r\n l.remove(min(l))\r\n if(min(l)==minimum):\r\n print(\"Still Rozdil\")\r\n else:\r\n print(index+1)", "# https://codeforces.com/problemset/problem/205/A\r\n# brute force, implementation\r\n# Gde Anantha Priharsena\r\n# 13 Juli 2020\r\n# Approach : mencari nilai minimum dari array jarak ke kota selain rozdil, menghitung jumlah elemen dari array yang bernilai minimum,\r\n# menentukan apakah gajak tsb berpindah kota dengan conditional\r\n# difficulty : 900\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\nshortest = min(arr)\r\ncount_shortest = 0\r\nshortest_city = 0\r\nfor i in range(n) :\r\n if arr[i] == shortest :\r\n count_shortest += 1\r\n shortest_city = i+1\r\nif count_shortest == 1 :\r\n print(shortest_city)\r\nelse :\r\n print( \"Still Rozdil\" )", "cases = int(input())\r\ncities=*map(int, input().split()),\r\nc = min(cities)\r\nprint(cities.index(c) + 1 if cities.count(c) == 1 else 'Still Rozdil')", "k=int(input())\r\nl=list(map(int,input().split()))\r\ns=min(l)\r\nif l.count(s)!=1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(l.index(s)+1)", "input()\r\nS = list(map(int,input().split()))\r\nS1 = S.copy()\r\nS1.remove(min(S1))\r\nif min(S) in S1: print('Still Rozdil')\r\nelse: print(S.index(min(S)) + 1)\r\n", "n=int(input())\r\ncnt=0\r\na =[ e for e in map(int, input().split()) ]\r\nm=min(a)\r\n\r\nfor j in range (len(a)):\r\n if a[j]==m:\r\n cnt+=1\r\n pos=j\r\nif cnt>1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(pos+1)\r\n", "def rozdol(lst):\r\n minimum = min(lst)\r\n min_ind = lst.index(minimum)\r\n if lst.pop(min_ind) in lst:\r\n return \"Still Rozdil\"\r\n return min_ind + 1\r\n\r\n\r\nn = int(input())\r\na = [int(i) for i in input().split()]\r\nprint(rozdol(a))\r\n", "n = int(input())\r\nlist1 = list(map(int, input().split(\" \")))\r\nt = min(list1)\r\nif list1.count(t) == 1:\r\n print(list1.index(t)+1)\r\nelse:\r\n print(\"Still Rozdil\")\r\n", "from collections import Counter\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\nma=min(arr)\r\nm=arr.index(ma)\r\nd=Counter(arr)\r\nc=0\r\nfor i,j in d.items():\r\n if i==ma and j>1:\r\n c+=1\r\n\r\nif c==0:\r\n print(m+1)\r\nelse:\r\n print(\"Still Rozdil\")", "n = int(input());l=list(map(int,input().split()));print(['Still Rozdil',l.index(min(l))+1][l.count(min(l)) == 1])", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nb = min(a)\r\nd = a.index(b)\r\n\r\ne = a.count(b)\r\n\r\nif e > 1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(d + 1)", "n=int(input())\r\nl=list(map(int,input().strip().split()[:n]))\r\nk=min(l)\r\nz=[]\r\nfor x in range(len(l)):\r\n\tif l[x]==k:\r\n\t\tz.append(x+1)\r\nif len(z)!=1:\r\n\tprint('Still Rozdil')\r\nelse:\r\n\tprint(z[0])\r\n", "n=int(input())\r\nn1=list(map(int,input().split()))\r\nif(n1.count(min(n1))>1):\r\n print('Still Rozdil')\r\nelse:\r\n print(n1.index(min(n1))+1)\r\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\nar=sorted(arr)\r\nif(arr.count(ar[0])==1):\r\n print(arr.index(ar[0])+1)\r\nelse:\r\n print('Still Rozdil')\r\n ", "n = int(input())\r\nx = list(map(int, input().split()))\r\nind,c=0,0\r\nm=min(x)\r\nfor i in range(n):\r\n if x[i]==m:\r\n c+=1\r\n if c==2:break\r\nif c==2:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(x.index(m)+1)", "input()\r\nelements = list(map(int,input().split()))\r\nmv = min(elements)\r\nmc = elements.count(mv)\r\nif mc >= 2:\r\n print('Still Rozdil')\r\nelse:\r\n print(elements.index(mv)+1)\r\n", "from heapq import heapify, heappop\n\ninput()\na = [int(e) for e in input().split()]\nb = a.copy()\nheapify(a)\ne = heappop(a)\nif a and e == heappop(a):\n\tprint('Still Rozdil')\nelse:\n\tprint(b.index(e)+1)\n", "n= int(input())\r\narr = [int(i) for i in input().split()]\r\n\r\nmin_ = 1e9+5\r\nmin_a = 0\r\ncount = 0\r\n\r\nfor i, a in enumerate(arr):\r\n if a < min_:\r\n min_ = a\r\n min_a = i\r\n count = 0\r\n elif a == min_:\r\n count += 1\r\n\r\nif count > 0:\r\n print('Still Rozdil')\r\nelse:\r\n print(min_a+1)", "countCities = input()\r\ntimeBeforeCities = input()\r\nlistTime = timeBeforeCities.split()\r\nlistTime = [int(time) for time in listTime]\r\nminTime = min(listTime)\r\ncountMin = listTime.count(minTime)\r\nif countMin > 1:\r\n print('Still Rozdil')\r\nelse:\r\n indexMinTime = listTime.index(minTime)\r\n print(indexMinTime+1)\r\n\r\n'''\r\n#listTime = [int(time) for time in listTime]\r\ncountMin = 0\r\nfor index, time in enumerate(listTime):\r\n if time == min(listTime):\r\n minIndex = index+1\r\n countMin += 1\r\n if countMin > 1:\r\n break\r\n \r\nif countMin > 1:\r\n print('Still Rozdil')\r\nelse:\r\n print(minIndex)\r\n''' \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\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 functools\r\n\r\nn = int(input())\r\ncities = [int(x) for x in input().split(\" \")]\r\n\r\nmin_n = 10000000000000\r\ncount_min = 0\r\nmin_i = -1\r\n\r\nfor i, city in enumerate(cities):\r\n if city < min_n:\r\n min_n = city\r\n count_min = 1\r\n min_i = i\r\n elif city == min_n:\r\n count_min += 1\r\n\r\nif count_min == 1:\r\n print(min_i + 1)\r\nelse:\r\n print(\"Still Rozdil\")", "n=int(input())\r\nt=list(map(int,input().split()))\r\nif t.count(min(t))>1:\r\n print('Still Rozdil')\r\nelse:\r\n print(t.index(min(t))+1)\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nlist = sorted(l)\r\nif(list.count(list[0]) <= 1):\r\n print(l.index(list[0])+1)\r\nelse:\r\n print('Still Rozdil')\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nmn,mi = a[0],0\r\nmore=False\r\nfor i in range(1,n):\r\n if mn>a[i]:\r\n mn=a[i]\r\n mi=i\r\n more=False\r\n elif mn==a[i]:\r\n more=True\r\nprint('Still Rozdil' if more else mi+1)", "## solution for a2oj_38 \r\n## little elephant and rozdil\r\nn=int(input())\r\na=[int(e) for e in input().split()]\r\nb={}\r\nmin=a[0]\r\ncounter=0\r\nfor i in range(n):\r\n new=a[i]\r\n if new<min :\r\n min=new\r\n counter=i\r\n else :\r\n pass\r\n if new in b : \r\n b[new]+=1 \r\n else :\r\n b.update({new:1})\r\n \r\nif b[min]>1 :\r\n print (\"Still Rozdil\")\r\nelse :\r\n print(counter+1)", "n = int(input())\r\n\r\ntime = list(map(int, (input().split())))\r\n\r\nmin_time = min(time)\r\n\r\ncounter = time.count(min_time)\r\nif counter>1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(time.index(min_time)+1)", "n=int(input())\r\nl=list(map(int, input().split()))\r\nmin=l[0]\r\ni_min=0\r\ni=1\r\nwhile(i<n):\r\n if(min>l[i]):\r\n min=l[i]\r\n i_min=i\r\n i=i+1\r\nif(l.count(min)==1):\r\n print(i_min+1)\r\nelse:\r\n print(\"Still Rozdil\")", "n = int(input())\r\na = list(map(int, input().split(\" \")))\r\n\r\nx = min(a)\r\nz = a.index(x)\r\ny = a.count(x)\r\n\r\nif y>1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(z+1)", "n=int(input())\r\np=input()\r\np=list(map(int,p.split()))\r\nc=min(p)\r\nd=0\r\nfor i in p:\r\n if i==c:\r\n d+=1\r\nif d>1:\r\n print('Still Rozdil')\r\nelse:\r\n print(p.index(c)+1)", "n = int(input())\r\nA = list(map(int, input().split()))\r\nm = min(A)\r\nif(A.count(m) > 1):\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(A.index(m)+1)", "n=int(input())\r\na=list(map(int,input().split()))\r\nq=min(a)\r\nif(a.count(q)>1):\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(((a.index(q))+1))", "# Little Elephant and Rozdil\r\n# https://codeforces.com/problemset/problem/205/A\r\n\r\ndef my_sum(a): # computing (sum(a))\r\n s = 0\r\n for i in range(n): # i goes through 0, 1 2, 3, ..., n-1\r\n s = s + a[i]\r\n return s\r\n\r\ndef my_max(a):\r\n current_max = -999999999999999 # stores the max value seen so far\r\n for i in range(n):\r\n if a[i] > current_max:\r\n current_max = a[i]\r\n return current_max\r\n\r\ndef my_min(a):\r\n current_min = 999999999999999\r\n for i in range(n):\r\n if a[i] < current_min:\r\n current_min = a[i]\r\n return current_min\r\n\r\n# 1 2 3 4 5 6 7\r\n# 7 41 4 100 4 9 4\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\nindex_to_current_min = 0 # index to min element among the things I have seen so far\r\nnumber_of_times = 1 # number of times min element appears\r\nfor i in range(1, n):\r\n if a[i] < a[index_to_current_min]:\r\n index_to_current_min = i\r\n number_of_times = 1\r\n elif a[i] == a[index_to_current_min]:\r\n number_of_times += 1\r\n\r\nif number_of_times > 1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(index_to_current_min+1)\r\n \r\n# print(\"the minimal element is \", a[index_to_current_min])\r\n# print(\"index to the minimal element is \", index_to_current_min+1)\r\n# print(\"number of times is \", number_of_times)\r\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\nm=min(arr)\r\nc=0\r\ncity=0\r\nfor x,y in enumerate(arr):\r\n if y==m:\r\n city=x+1\r\n c+=1\r\nif c==1:\r\n print(city)\r\nelse:\r\n print('Still Rozdil')\r\n", "cities_count = int(input())\r\nways_to_cities = [int(x) for x in input().split()]\r\nif ways_to_cities.count(min(ways_to_cities)) == 1:\r\n\tprint(ways_to_cities.index(min(ways_to_cities))+1)\r\nelse:\r\n\tprint('Still Rozdil')", "\r\nn = int(input())\r\n\r\narr = list(map(int, input().split()))\r\n\r\nmin_items = 0\r\nmin_dist = 99999999999999999\r\nmin_id = -1\r\n\r\nfor i, v in enumerate(arr):\r\n\r\n if v < min_dist:\r\n min_dist = v\r\n min_items = 1\r\n min_id = i\r\n elif v == min_dist:\r\n min_items += 1\r\n\r\nif min_items > 1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(min_id + 1)\r\n", "n = int(input())\r\nx = list(map(int, input().split()))\r\ny = min(x)\r\nc = 0\r\nfor i in range(len(x)):\r\n if y == x[i]:\r\n c = c+1\r\nif c >= 2:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(1 + x.index(y))\r\n", "c=int(input())\r\nm=[int(c) for c in input().split(' ')]\r\nk=min(m)\r\nj=m.index(k)\r\ns=m.count(k)\r\nif s>1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(j+1)\r\n", "input()\r\nX = list(map(int, input().split()))\r\nprint(\"Still Rozdil\" if X.count(min(X)) != 1 else X.index(min(X)) + 1)\r\n", "import sys\r\nimport math\r\nimport bisect\r\nimport itertools\r\nimport random\r\nimport re\r\n\r\ndef main():\r\n n = int(input())\r\n A = list(map(int, input().split()))\r\n min_val = min(A)\r\n sol = []\r\n for i in range(n):\r\n if A[i] == min_val:\r\n sol.append(i)\r\n if len(sol) == 1:\r\n print(sol[0] + 1)\r\n else:\r\n print('Still Rozdil')\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\ndist = [int(d) for d in input().split(\" \", n-1)]\r\nk = min(dist)\r\ni = 0\r\nfor d in dist:\r\n if d==k:\r\n i += 1\r\nj = dist.index(k)\r\nif i==1:\r\n print(j+1)\r\nelse:\r\n print(\"Still Rozdil\")", "n = int(input())\r\nnumbers = list(map(int , input().split()))\r\nif numbers.count(min(numbers)) > 1:\r\n\tprint(\"Still Rozdil\")\r\nelse:\r\n\tprint(numbers.index(min(numbers)) + 1)", "n=int(input())\r\nx = list(map(int, input().split(\" \")))\r\nprint(x.index(min(x))+1 if x.count(min(x))==1 else \"Still Rozdil\")", "N = int(input())\r\nA = list(map(int,input().split()))\r\nif A.count(min(A))==1:\r\n print(A.index(min(A))+1)\r\nelse:\r\n print(\"Still Rozdil\")", "import math\ninp=lambda:map(int,input().split())\n\nn = int(input())\nl = list(inp())\n\nsr = sorted(l)\n# print(sr)\n\nif len(sr)==1:\n print(1)\n exit()\nif sr[0]==sr[1]:\n print(\"Still Rozdil\")\n exit()\n\nminm = l[0]\ncity = 0\n\nfor i in range(n):\n if l[i] < minm:\n minm = l[i]\n city = i\n\nprint(city+1)\n \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\nmini=min(arr)\r\ncoun=arr.count(mini)\r\nif coun>1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(arr.index(mini)+1)", "n=int(input())\r\nx=[int(x) for x in input().split()]\r\nb=min(x)\r\na=x.count(b)\r\nif a>1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(x.index(b)+1)", "n=int(input())\r\na=list(map(int,input().split()))\r\nmiinimum=min(a)\r\ncount,flag=0,0\r\nfor i in range(n):\r\n if(miinimum==a[i]):\r\n count+=1\r\nfor i in range(n):\r\n if(miinimum==a[i]):\r\n ans=(i+1)\r\nif(count==1):\r\n print(ans)\r\nelse:\r\n print('Still Rozdil')\r\n ", "a=input()\r\nb=input()\r\nc=(b.split(\" \"))\r\nc=list(map(int,c))\r\nd=c.copy()\r\nc.sort()\r\nk=c.count(c[0])\r\nif k == 1:\r\n print((d.index(c[0])+1))\r\nelse:\r\n print(\"Still Rozdil\")", "k = int(input())\n\nnum = list(map(int,input().split()))\n\nif num.count(min(num)) >= 2:\n print(\"Still Rozdil\")\nelse:\n print(num.index(min(num))+1)\n\n \t\t \t \t \t\t \t\t\t \t \t \t \t", "n = int(input())\r\ncitylist = list(map(int,input().split()))\r\n\r\n\r\ndef mindifferent(liste):\r\n if liste.count(min(liste)) > 1:\r\n return False\r\n else:\r\n return True\r\n\r\n\r\nif mindifferent(citylist):\r\n print(citylist.index(min(citylist))+1)\r\nelse:\r\n print(\"Still Rozdil\")", "n = int(input())\r\nlst = list(map(int, input().split(' ')))\r\n \r\nif n > 1:\r\n if sorted(lst)[0] == sorted(lst)[1]:\r\n print('Still Rozdil')\r\n else:\r\n print(lst.index(min(lst)) + 1)\r\nelif n == 1:\r\n print(1)", "n = int(input())\r\ncities = list(map(int, input().split()))\r\nif n==1:\r\n print(1)\r\nelse:\r\n min1=min(cities)\r\n for i in range (n):\r\n if min1==cities[i]:\r\n position = i\r\n cities.remove(min1)\r\n min2=min(cities)\r\n if min1==min2:\r\n print ('Still Rozdil')\r\n else:\r\n print (position+1) ", "n=int(input())\r\nl=list(map(int,input().split(\" \")))\r\nmin1=min(l)\r\nc=0\r\nfor i in l:\r\n if i==min1:\r\n c+=1\r\nif c>1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(l.index(min1)+1)\r\n", "from collections import Counter\nimport math\n\n\ndef T(): return int(input())\ndef S(): return str(input())\ndef A(): return list(map(int, input().split(\" \")))\ndef M(): return map(int, input().split(\" \"))\n\n\ndef gcd(a, b):\n if (a == 0):\n return b\n\n if (b == 0):\n return a\n k = 0\n\n while(((a | b) & 1) == 0):\n a = a >> 1\n b = b >> 1\n k = k + 1\n\n while ((a & 1) == 0):\n a = a >> 1\n while(b != 0):\n while ((b & 1) == 0):\n b = b >> 1\n if (a > b):\n temp = a\n a = b\n b = temp\n\n b = (b - a)\n return (a << k)\n\n\ndef binarySearch(n, a):\n l = 0\n h = len(a)-1\n ans = 0\n while l <= h:\n mid = (l+h)//2\n if a[mid] == n:\n return 1\n elif a[mid] > n:\n h = mid - 1\n else:\n l = mid + 1\n return ans\n\n\ndef sumOfDigits(n):\n n = str(n)\n su = 0\n for i in n:\n su += int(i)\n return su\n\n\ndef lofint(n): return math.floor(math.log10(n))+1\n\n\ndef isPal(s): return s[::-1] == s\n\n\ndef sumNat(n): return (n*(n+1))//2\n\n\ndef lcm(a, b): return int((a * b)/gcd(a, b))\n\n\nn = T()\na = A()\nc = Counter(a)\nflag = 0\nmn = min(a)\nif c[mn] > 1:\n print(\"Still Rozdil\")\nelse:\n print(a.index(mn)+1)", "n = int(input())\r\na = list(map(int, input().split()))\r\nx = min(a)\r\nif a.count(x)>1:\r\n\tprint(\"Still Rozdil\")\r\nelse:\r\n\tprint(a.index(x)+1)\r\n", "n=int(input())\r\nlis=list(map(int,input().split()))\r\nmi=min(lis)\r\nif lis.count(mi)>1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(lis.index(mi)+1)", "n=list(map(int,input().split()))\narray=list(map(int,input().split()))\nif array.count(min(array))!=1:\n\tprint(\"Still Rozdil\")\nelse:\n\tprint(array.index(min(array))+1)", "no_of_cities = int(input())\n\ndistances = list(map(int, input().split()))\n\ngo_to_city = min(distances)\n\nif distances.count(go_to_city) == 1 :\n print(distances.index(go_to_city) + 1)\nelse :\n print(\"Still Rozdil\")\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\nsorted_arr = sorted(arr)\r\nif len(arr)>1:\r\n\tif sorted_arr[0] == sorted_arr[1]:\r\n\t\tprint(\"Still Rozdil\")\r\n\telse:\r\n\t\tprint(arr.index(sorted_arr[0]) + 1)\r\nelse:\r\n\tprint(arr.index(sorted_arr[0]) + 1)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=min(l)\r\nprint(\"Still Rozdil\" if l.count(m)>1 else (l.index(m)+1))", "n = int(input())\r\n\r\narr = list(map(int,input().split()))\r\nmini = arr[0]\r\nind = [mini,0]\r\nfor i in range(1,n):\r\n if arr[i]<mini:\r\n mini = arr[i]\r\n ind[0]=mini\r\n ind[1]=i\r\ncount =0\r\nfor i in range(n):\r\n if arr[i]==mini: count+=1\r\nif count>1: print(\"Still Rozdil\")\r\nelse: print(ind[1]+1)", "\r\n\r\nn = int(input())\r\na = sorted([(int(x), ind+1) for ind, x in enumerate(input().split())])\r\nif n == 1:\r\n print(1)\r\nelse:\r\n if a[0][0] == a[1][0]:\r\n print('Still Rozdil')\r\n else:\r\n print(a[0][1])", "from typing import Counter\r\n\r\n\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nc=Counter(l)\r\nll=list(c.keys())\r\nll.sort()\r\nif c[ll[0]]==1:\r\n print(l.index(ll[0])+1)\r\nelse:\r\n print(\"Still Rozdil\")", "n=int(input())\r\nA=list(map(int,input().split()))\r\nmn=min(A)\r\nflag=False \r\nfor i in range(n):\r\n if flag==False and (A[i]==mn):\r\n c=i \r\n flag=True\r\n elif flag==True and (A[i]==mn):\r\n flag=False \r\n break\r\nif flag==False:\r\n print('Still Rozdil')\r\nelif flag==True:\r\n print(c+1)", "from collections import Counter\r\n\r\n_ = input()\r\nvls = list(map(int, input().split()))\r\nvls_dict = dict(Counter(vls))\r\nx = min(vls)\r\nif vls_dict[x] > 1:\r\n print('Still Rozdil')\r\nelse:\r\n print(vls.index(x) + 1)", "n = int(input())\r\nl_n = list(map(int, input().split()))\r\nm = min(l_n)\r\nprint(\"Still Rozdil\" if l_n.count(m) > 1 else (l_n.index(m) + 1))", "n = int(input())\nm = list(map(int, input().split(' ')))\nprint(\"Still Rozdil\" if m.count(min(m)) > 1 else m.index(min(m)) + 1)\n \t \t\t \t\t \t\t \t\t \t\t \t \t\t\t \t", "def file():\r\n import sys\r\n sys.stdin = open('input.txt','r')\r\n sys.stdout = open('output.txt','w')\r\n\r\ndef solve():\r\n mn = min(a)\r\n cnt = 0\r\n for i in range(n):\r\n if mn==a[i]:\r\n idx=i\r\n cnt+=1\r\n if cnt>1:print('Still Rozdil');break\r\n else:print(idx+1)\r\n\r\nif __name__=='__main__':\r\n\r\n # file()\r\n n=int(input())\r\n a=[int(x) for x in input().split()]\r\n solve()\r\n\r\n\r\n\r\n", "n = int(input())\nl = [int(i) for i in input().split()]\nm = min(l)\nc = -1\nfor i in range(n):\n if m == l[i]:\n if c!=-1:\n print('Still Rozdil')\n break\n c = i+1\nelse:\n print(c)", "n = int(input())\r\nnums = list(map(int, input().split()))\r\nif nums.count(min(nums)) == 1:\r\n print(nums.index(min(nums)) + 1) ## .index() retrieves the index of the minimum in the list.\r\nelse:\r\n print(\"Still Rozdil\")\r\n\r\n ", "import math\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\noutput = sys.stdout.write\r\n\r\ndef inList():\r\n return(list(map(int,input().split())))\r\ndef inVar():\r\n return map(int,input().split()) \r\n\r\ndef main():\r\n n = int(input())\r\n ar = inList()\r\n if n == 1:\r\n print(\"1\")\r\n else:\r\n lst = []\r\n for i in range(n):\r\n lst.append([ar[i], i])\r\n lst.sort()\r\n #print(lst)\r\n if lst[0][0] == lst[1][0]:\r\n print(\"Still Rozdil\")\r\n else:\r\n print(lst[0][1] + 1)\r\nmain()", "n=int(input())\r\ncity= list(map(int,input().split()))\r\nx=list()\r\nmini=min(city)\r\nfor i in range(0,len(city)):\r\n if city[i]==mini:\r\n x.append(i)\r\nif len(x)>=2:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(x[0]+1)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=min(l)\r\nc=0\r\nfor x in l:\r\n if m==x:\r\n c+=1\r\n if c>1:\r\n break\r\nif c==2:\r\n print('Still Rozdil')\r\nelse:\r\n print(l.index(min(l))+1)\r\n", "input()\r\ntowns = [int(c) for c in input().split()]\r\n\r\n_min = min((e, i) for i, e in enumerate(towns, 1))\r\n\r\nif sum(1 for e in towns if e == _min[0]) > 1:\r\n print('Still Rozdil')\r\nelse:\r\n print(_min[1])\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nif n==1:\r\n print(n)\r\n exit(0)\r\nm=l\r\nl=sorted(l)\r\nif l[0]==l[1]:\r\n print('Still Rozdil')\r\nelse:print(m.index(l[0])+1)", "def result(n,lis):\n\ta=min(lis)\n\tb=lis.count(a)\n\tif b==1:\n\t\tprint(lis.index(a)+1)\n\telse:\n\t\tprint(\"Still Rozdil\")\t\n\n\n\n\n\n\nn=int(input())\nlis=list(map(int,input().split()))\nresult(n,lis)\n", "# Date 20-04-2021\r\n\r\n# Little Elephant and Rozdil\r\n# Status: \r\n\r\nn = int(input())\r\nlst = list(map(int, input().split()))\r\n\r\n# min_time = 10**9\r\n# city_index = 0\r\n\r\n# for i in range(len(lst)):\r\n# if lst[i] < min_time:\r\n# min_time = lst[i]\r\n# if lst[i] == min_time:\r\n# print(\"Still Rozdil\") \r\n# flag = flase\r\n# this approach will not work, consider the case 2 2 1 1 3 \r\n\r\nmin_time = min(lst)\r\nif lst.count(min_time) > 1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(lst.index(min_time)+1)\r\n \r\n\r\n\r\n\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=sorted(a)\r\nc=enumerate(a,1)\r\nif n==1:\r\n print(1)\r\nelse:\r\n if b[0]==b[1]:\r\n print(\"Still Rozdil\")\r\n else:\r\n m=min(a)\r\n for (x,y) in c:\r\n if y==m:\r\n print(x)\r\n break\r\n \r\n ", "cities = int(input())\r\ntime = list(map(int,input().split()))\r\nmini = 1000000001\r\nif time.count(min(time)) < 2:\r\n print(time.index(min(time))+1)\r\nelse:\r\n print(\"Still Rozdil\")", "input()\r\ns=(list(map(int,input().split())))\r\nif len(s)>1:\r\n if s.count(min(s))>1:\r\n print('Still Rozdil')\r\n else:\r\n print(1+s.index(min(s)))\r\nelse:\r\n print(len(s))", "n=input()\r\nm=list(map(int,input().split()))\r\nif m.count(min(m))==1:\r\n\tprint(m.index(min(m))+1)\r\nelse:\r\n\tprint(\"Still Rozdil\")\t", "l=int(input())\r\na=[int(x) for x in input().split()]\r\nif l<2:\r\n print(1)\r\nelif sorted(a)[0]==sorted(a)[1]:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(a.index(min(a))+1)", "n = int(input())\na = list(map(int, input().split()))\nmini = min(a)\nprint(\"Still Rozdil\" if a.count(mini) >= 2 else a.index(mini) + 1)\n", "n = int(input())\nnums = [int(i) for i in input().split()]\nm = min(nums)\nc = nums.count(m)\nif c > 1:\n print('Still Rozdil')\nelse:\n print(nums.index(m) + 1)\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\nimport sys\r\nimport math\r\n# sys.setrecursionlimit(10**6)\r\n\r\ndef get_ints(): return map(int, input().strip().split())\r\ndef get_list(): return list(get_ints())\r\n\r\ndef printspx(*args): return print(*args, end=\"\")\r\ndef printsp(*args): return print(*args, end=\" \")\r\ndef printchk(*args): return print(*args, end=\" \\ \")\r\n\r\nMODPRIME = int(1e9+7); BABYMODPR = 998244353;\r\n\r\n\r\n# sys.stdin = open(\"input.txt\",\"r\") # <<< Comment this line >>> #\r\n# for _testcases_ in range(int(input())):\r\nfrom collections import defaultdict\r\nn = int(input())\r\nli = get_list()\r\nd = defaultdict(lambda: [])\r\nfor i, v in enumerate(li):\r\n d[v].append(i)\r\n# print(d)\r\nfor k, v in sorted(d.items()):\r\n if len(v) > 1:\r\n print(\"Still Rozdil\")\r\n else:\r\n print(v[0] + 1)\r\n break\r\n\r\n'''\r\nTHE LOGIC AND APPROACH IS BY ME @luctivud ( UDIT GUPTA )\r\nSOME PARTS OF THE CODE HAS BEEN TAKEN FROM WEBSITES LIKE::\r\n(I Own the code if no link is provided here or I may have missed mentioning it)\r\n>>> DO NOT PLAGIARISE.\r\nTESTCASES:\r\n>>> COMMENT THE STDIN !!\r\n'''", "def solve():\r\n n = int(input())\r\n tempList = []\r\n tempList += map(int, input().split(' '))\r\n if tempList.count(min(tempList)) == 1:\r\n print(tempList.index(min(tempList)) + 1)\r\n else:\r\n print('Still Rozdil')\r\nsolve()", "n = int(input())\r\nd = list(map(int,input().split()))\r\nm = [d[0],0]\r\ntf = 0\r\nfor i in range(1,n):\r\n if d[i] < m[0]:\r\n m = [d[i],i]\r\n tf = 0\r\n elif d[i] == m[0]:\r\n tf = 1\r\nif tf == 0:\r\n print(m[1]+1)\r\nelse:\r\n print(\"Still Rozdil\") ", "n=int(input())\r\na=list(map(int,input().split()))\r\nx=min(a)\r\nc=a.count(x)\r\nif c>1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(a.index(x)+1)", "n = int(input())\r\ncities = list(map(int, input().split()))\r\n\r\nminimum = min(cities)\r\nif cities.count(minimum) > 1:\r\n print('Still Rozdil')\r\nelse:\r\n print(cities.index(minimum)+1)", "a = int(input())\r\ny = list(map(int ,input().split()))\r\n\r\nif y.count(min(y)) > 1 :\r\n print(\"Still Rozdil\")\r\n\r\nelse:\r\n print(y.index(min(y))+1)", "z=int(input())\r\nx=list(map(int,input().split()))\r\nprint(['Still Rozdil','%d'%(x.index(min(x))+1)][x.count(min(x))==1])\r\n", "n= int(input())\r\n\r\ncity = list(map(int,input().split()))\r\n\r\nif n==1:\r\n print(1)\r\nelse:\r\n m=float('inf')\r\n c=1\r\n ind=None\r\n \r\n i=0\r\n while i<n:\r\n \r\n if city[i]<m:\r\n m=city[i]\r\n c=1\r\n ind=i\r\n \r\n elif city[i]==m:\r\n c+=1\r\n i+=1\r\n if c==1:\r\n print(ind+1)\r\n else:\r\n print('Still Rozdil')\r\n \r\n \r\n \r\n \r\n ", "n=int(input())\r\nl=list(map(int,input().split()))[:n]\r\nk=min(l)\r\nif l.count(k)==1:\r\n print(l.index(k)+1)\r\nelse:\r\n print('Still Rozdil')", "cities = int(input())\ntravel_time = list(map(int, input().split(' ')))\n\nnearest = min(travel_time)\n\nif travel_time.count(nearest) == 1:\n print(travel_time.index(nearest) + 1)\nelse:\n print('Still Rozdil')", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=min(a)\r\nprint(\"Still Rozdil\" if a.count(m)>1 else a.index(m)+1)", "import sys\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\nmi = sys.maxsize\r\nc = 0\r\nj = 0\r\nfor i in range(n):\r\n if mi > a[i]:\r\n mi = a[i]\r\n c = 1\r\n j = i\r\n elif mi == a[i]:\r\n c += 1\r\n\r\nif c > 1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(j + 1)", "n,ct=int(input()),list(map(int,input().split()))\r\nprint('Still Rozdil' if ct.count(min(ct))>1 else ct.index(min(ct))+1)", "input()\r\ntowns = list(map(int, input().split()))\r\nmin_ = min(towns)\r\nif towns.count(min_) > 1:\r\n print('Still Rozdil')\r\nelse:\r\n print(towns.index(min_) + 1)\r\n\r\n\r\n", "a=int(input())\r\ntowns=list(map(int,input().split()))\r\nif towns.count(min(towns))!=1:print('Still Rozdil')\r\nelse:print(towns.index(min(towns))+1)", "input()\r\nw = list(map(int, input().split()))\r\nif w.count(min(w)) > 1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(w.index(min(w))+1)", "n=input()\r\nm=list(map(int,input().split()))\r\na=min(m)\r\nif(m.count(a)==1):\r\n print(m.index(a)+1)\r\nelse:\r\n print(\"Still Rozdil\")", "\r\n\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n l = list(map(int,input().split()))\r\n mn = min(l)\r\n if(l.count(mn)==1):\r\n print(l.index(mn)+1)\r\n else:\r\n print('Still Rozdil')\r\n\r\nif __name__==\"__main__\":\r\n main()", "def solve(arr):\n path = min(arr)\n if arr.count(path) > 1:\n print('Still Rozdil')\n else:\n print(arr.index(path)+1)\n\nif __name__ == \"__main__\":\n n = int(input())\n arr = list(map(int, input().split()))\n solve(arr)", "n = int(input())\r\ndistances = list(map(int, input().split()))\r\n\r\nmin = distances[0]\r\nCount = 1\r\nposition = 0\r\n\r\nfor i in range(1,n):\r\n if distances[i] == min:\r\n Count += 1\r\n elif distances[i] < min:\r\n min = distances[i]\r\n position = i\r\n Count = 1\r\n else:\r\n pass\r\n\r\nif Count == 1:\r\n print(position+1)\r\nelse:\r\n print(\"Still Rozdil\")", "import math\r\nimport collections\r\nnum=int(input())\r\nl=list(map(int,input().split()))\r\nx=min(l)\r\ny=collections.Counter(l)\r\nif y[x]>1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n for index,item in enumerate(l):\r\n if item==x:\r\n print(index+1)", "\r\ninput()\r\na=list(map(int,input().split()))\r\nd=min(a)\r\nprint('Still Rozdil'if a.count(d)>1else a.index(d)+1)", "n = int(input())\nl = list(map(int,input().strip().split()))\n\n\nif l.count(min(l)) > 1:\n\tprint('Still Rozdil')\nelse:\n\tprint(l.index(min(l))+ 1 )", "n = int(input())\r\nsmallest = 0\r\nsmallest_count = 0\r\n\r\nnums = [int(x) for x in input().split()]\r\n\r\nfor i in range(n):\r\n if nums[i] < nums[smallest]:\r\n smallest = i\r\n smallest_count = 1\r\n elif nums[i] == nums[smallest]:\r\n smallest_count += 1\r\n\r\nif smallest_count > 1:\r\n print('Still Rozdil')\r\nelse:\r\n print(smallest + 1)\r\n", "#\t205A - Little Elephant and Rozdil\r\nif __name__ == '__main__' :\r\n n = int(input())\r\n lst = list(map(int,input().split()))\r\n min = min(lst)\r\n if lst.count(min) == 1 :\r\n print(lst.index(min) + 1)\r\n else :\r\n print('Still Rozdil')", "n = int(input())\r\nval = list(map(int, input().split()))\r\nlow = min(val)\r\ncount=0\r\nfor i in range(n):\r\n if val[i]==low:\r\n count+=1\r\nif count >1:\r\n print('Still Rozdil')\r\nelse:\r\n print(val.index(low) +1)", "n = int(input())\r\na = list(map(int,input().split()))\r\nk = a[0]; p = 0\r\nfor i in range(1,len(a)):\r\n if a[i] < k:\r\n p = i\r\n k = a[i]\r\nif a.count(k) == 1: print(p+1)\r\nelse: print(\"Still Rozdil\")\r\n", "n = int(input())\r\ndist = list(map(int, input().split()))\r\nmin_dist = min(dist)\r\nif dist.count(min_dist) == 1:\r\n print(dist.index(min_dist) + 1)\r\nelse:\r\n print(\"Still Rozdil\")\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=min(a)\r\nq=0\r\nfor i in range(n):\r\n\tif a[i]==b:\r\n\t\tq+=1\r\nif q>1:\r\n\tprint(\"Still Rozdil\")\r\nelse:\r\n\tprint(a.index(b)+1)", "a = int(input())\r\nb = input().split()\r\nb = list(map(int, b))\r\nx = min(b)\r\nc = b.count(x)\r\nif c == 1:\r\n print(b.index(x)+1)\r\nelse:\r\n print('Still Rozdil')\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nminele=min(a)\r\np=a.count(minele)\r\nif p>1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n ind=a.index(minele)\r\n print(ind+1)", "import sys\r\n\r\nINF = float('inf')\r\n\r\n# input functions\r\ndef read_int():\r\n return int(sys.stdin.readline())\r\n\r\ndef read_ints():\r\n return list(map(int, sys.stdin.readline().split()))\r\n\r\n# output functions\r\ndef print_yes_no(condition):\r\n print('YES' if condition else 'NO')\r\n\r\ndef print_array(arr, sep=' '):\r\n print(sep.join(map(str, arr)))\r\n\r\n\r\ndef solve():\r\n n = read_int()\r\n towns = read_ints()\r\n\r\n min_distance = INF\r\n for i in range(n):\r\n if towns[i] < min_distance:\r\n min_distance = towns[i]\r\n indx = i+1\r\n \r\n if towns.count(min_distance) > 1:\r\n print(\"Still Rozdil\")\r\n else:\r\n print(indx)\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()", "n = int(input())\r\n\r\nlist_ = list(map(int,input().split()))\r\n\r\nif(list_.count(min(list_))!=1):\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(list_.index(min(list_))+1)", "a=int(input())\r\nb=list(map(int,input().split()))\r\nd={}\r\np={}\r\nr=b[0]\r\nfor i in range(a):\r\n\tif b[i] in d:\r\n\t\td[b[i]]+=1\r\n\telse:\r\n\t\td[b[i]]=1\r\n\t\tp[b[i]]=i+1\r\n\tif b[i]<r:\r\n\t\tr=b[i]\r\nif d[r]>1:\r\n\tprint('Still Rozdil')\r\nelse:\r\n\tprint(p[r])", "import math as m\r\nfrom re import X\r\nimport copy\r\n\r\nn = int(input())\r\nv = input()\r\nv = v.split()\r\np=[]\r\nfor e in v:\r\n p.append(int(e))\r\nmn = min(p)\r\ncnt=0\r\nfor i in range (len(p)):\r\n if(p[i]==mn):\r\n ans = i+1\r\n cnt+=1\r\nif(cnt==1):\r\n print(ans)\r\nelse:\r\n print(\"Still Rozdil\")\r\n", "input()\r\ns = list(map(int, input().split()))\r\nt = s[:]\r\nt.sort()\r\nif len(t) > 1:\r\n if t[0] == t[1]:\r\n print(\"Still Rozdil\")\r\n else:\r\n print(s.index(min(s)) + 1)\r\nelse:\r\n print(1)", "n = input()\r\narr = list(map(int, input().split()))\r\ncnt, res, mn = 0, 0, min(arr)\r\nfor i in range(len(arr)):\r\n if mn == arr[i]:\r\n res = i\r\n cnt += 1\r\nprint(res+1 if cnt < 2 else 'Still Rozdil')\r\n", "t=int(input())\r\nl=list(map(int,input().split()))\r\nk=min(l)\r\nif l.count(k)==1:\r\n for i in range(t):\r\n if l[i]==k:\r\n print(i+1)\r\nelse:\r\n print(\"Still Rozdil\")\r\n \r\n ", "n=int(input())\nnums = list(map(int, input().split()))\n\nsmallest = nums[0] \nfor x in nums:\n if x<=smallest: \n smallest=x\n\ncounter=0\nfor x in nums:\n if x==smallest:\n counter=counter+1\nif counter>1:\n print(\"Still Rozdil\")\nelse:\n \n index=0\n for x in nums:\n if x==smallest:\n print(index+1)\n else:\n index=index+1\n\t\t \t\t \t \t \t \t\t \t\t", "n=int(input())\r\ncities=[int(x) for x in input().split()]\r\nmintime=min(cities)\r\ncity=cities.index(mintime)\r\ncities.remove(mintime)\r\nif(mintime in cities):\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(city+1)", "n = int(input())\r\n\r\nl = list(map(int,input().split()))\r\n\r\nx = min(l)\r\n\r\nif l.count(x) > 1:\r\n print('Still Rozdil')\r\nelse:\r\n print(l.index(x)+1)", "n=int(input())\r\ntowns=list(map(int,input().split()))\r\nclosest=min(towns)\r\nif towns.count(closest)>1:\r\n print('Still Rozdil')\r\nelse:\r\n for i in range(n):\r\n if towns[i]==closest:\r\n print(i+1)\r\n break", "# benzene_ <>\r\n\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\nx=min(arr)\r\nc=arr.count(x)\r\nif c==1:\r\n print(arr.index(x)+1)\r\nelse:\r\n print('Still Rozdil')", "num_cities = int(input())\r\ndistances = [int(n) for n in input().split()]\r\nclosest_city = min(distances)\r\nif distances.count(closest_city) > 1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(distances.index(closest_city) + 1)", "n = int(input())\r\na = list(map(int, input().split(\" \")))\r\nb = min(a)\r\nc = a.count(min(a))\r\nif c==1:\r\n print(a.index(min(a))+1)\r\nelse:\r\n print('Still Rozdil')", "n = int(input())\r\nl = list(map(int, input().split()))\r\nmi = min(l)\r\nif l.count(mi) > 1:\r\n print('Still Rozdil')\r\nelse:\r\n print(l.index(mi) + 1)", "n = int(input())\r\na = list(map(int, input().split()))\r\nx = a.count(min(a))\r\nif (x > 1):\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(a.index(min(a))+1)", "i = int(input())\r\nn = [int(x) for x in input().split()]\r\nmin_time = min(n)\r\ncount = n.count(min_time)\r\nif count == 1:\r\n pos = n.index(min_time)\r\n print(pos+1)\r\nelse:\r\n print(\"Still Rozdil\")", "n=int(input())\r\n\r\na=list(map(int,input().split()))\r\ndic=0\r\nmini=min(a)\r\nfor i in range(n):\r\n if mini==a[i] and dic==0:\r\n dic+=1\r\n p=i\r\n elif mini==a[i] and dic!=0:\r\n p=-1\r\nif p==-1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(p+1) \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n", "n=int(input())\r\nx=list(map(int,input().split()))\r\nif x.count(min(x))>1: print('Still Rozdil')\r\nelse: print(x.index(min(x))+1)", "n=int(input())\nl=input()\nl=l.split()\nm=9876543210\nflag=False\nc=0\nfor x in l:\n c=c+1\n x=int(x)\n if x <= m:\n if x == m:\n flag=True\n else:\n flag=False\n m=x\n city=c\nif flag:\n print('Still Rozdil')\nelse:\n print(city)", "#Har har mahadev\r\n#author : @harsh kanani\r\n\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\nm = min(l)\r\nif l.count(m)==1:\r\n print(l.index(m)+1)\r\nelse:\r\n print(\"Still Rozdil\")", "q = int(input())\r\np = [int(i) for i in input().split()]\r\n\r\nif p.count(min(p)) > 1:\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(p.index(min(p))+1)\r\n", "# *\r\n# * *\r\n# * *\r\n# * * * Author:Aditya Joshi\r\n# * *\r\n# * *\r\n# for _ in range(int(input())):\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\nm = min(l)\r\nif (l.count(m) > 1):\r\n print(\"Still Rozdil\")\r\nelse:\r\n print(l.index(m)+1)", "def littleElephant():\r\n n=int(input())\r\n s=[int(x)for x in input().split()]\r\n smalli=0\r\n i=1\r\n while i<n:\r\n c=0\r\n if s[i]<s[smalli]:\r\n smalli=i\r\n elif s[i]==s[smalli]:\r\n for j in range(i+1,n):\r\n if s[j]<s[smalli]:\r\n smalli=j\r\n c=1\r\n i=j+1\r\n if c==0:\r\n print(\"Still Rozdil\")\r\n return\r\n if c==0:\r\n i=i+1\r\n print(smalli+1)\r\n\r\nlittleElephant()\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\ntimes = list(map(int, input().split()))\r\nmin_ = min(times)\r\nif times.count(min_) > 1:\r\n print('Still Rozdil')\r\nelse:\r\n print(times.index(min_) + 1)\r\n", "n = int(input(\"\"))\r\nmin_time = 1000000001\r\nlst = list(map(int,input('').split(\" \")))\r\nmin_lst = min(lst)\r\nmin_cnt = lst.count(min_lst)\r\n\r\nif min_cnt > 1 :\r\n print(\"Still Rozdil\")\r\nelse:\r\n for i in range(len(lst)):\r\n if lst[i] < min_time :\r\n min_time = lst[i]\r\n min_index = i\r\n print(min_index+1)\r\n\r\n\r\n", "n = int(input())\r\nt = list(map(int, input().split()))\r\nminimum = min(t)\r\nif t.count(minimum) > 1:\r\n print('Still Rozdil')\r\nelse:\r\n print(t.index(minimum)+1)", "import sys\r\n\r\nn = int(input())\r\ntime = list(map(int,input().split(\" \")))\r\nmin_time = sys.maxsize\r\nmin_index =-1 \r\nmin_count =0\r\n\r\nfor i in range(n):\r\n if time[i] == min_time:\r\n min_count +=1 \r\n if time[i] < min_time:\r\n min_time = time[i]\r\n min_count =1 \r\n min_index = i+1 \r\n\r\n\r\n\r\nif min_count ==1:\r\n print(min_index)\r\nelse:\r\n print(\"Still Rozdil\")", "n = int(input())\r\nA = list(map(int,input().strip().split()))\r\nB = [(A[i],i+1) for i in range(n)]\r\nif n == 1: \r\n print(1)\r\n exit(0)\r\nB.sort()\r\nprint(\"Still Rozdil\" if B[0][0] == B[1][0] else B[0][1])\r\n", "n = int(input())\r\nlst = [int (x) for x in input().split()]\r\nclose = min(lst)\r\ncount = lst.count(close)\r\nif(count>1):\r\n print('Still Rozdil')\r\nelif(count==1):\r\n print(lst.index(close)+1)", "num=int(input())\r\ndum=list(map(int,input().split()))\r\nn=min(dum)\r\nprint([dum.index(n)+1, \"Still Rozdil\"][dum.count(n)>1])", "n=int(input())\r\nl=list(map(int,input().split()))\r\ng=1000000001\r\nd=-1\r\nfor i in range(len(l)):\r\n if(g>l[i]):\r\n g=l[i]\r\n d=i\r\nc=0\r\nfor i in l:\r\n if(g==i):\r\n c=c+1\r\nif(c==1):\r\n print(d+1)\r\nelse:\r\n print(\"Still Rozdil\")", "n =int(input())\r\nl = list(map(int,input().split()))\r\nx = min(l)\r\nif l.count(x) < 2 :\r\n print(l.index(x)+1)\r\nelse:\r\n print(\"Still Rozdil\") \r\n\r\n" ]

[ "x,y=map(int,input().split())\r\nif y==0:\r\n\tprint('No')\r\nelif y==1:\r\n\tif x==0:\r\n\t\tprint('Yes')\r\n\telse:\r\n\t\tprint('No')\r\nelif x<y-1:\r\n\tprint(\"No\")\r\nelse:\r\n\tp=x-(y-1)\r\n\tif p%2==0:\r\n\t\tprint('Yes')\r\n\telse:\r\n\t\tprint('No')\r\n", "k = input().split()\r\nx = int(k[0])\r\ny = int(k[1])\r\n\r\nif((((y-1)-x)%2 == 0) and (y <= x+1) and (y != 0) and (y != 1)):\r\n print('Yes')\r\nelif (y == 1 and x == 0):\r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "from sys import stdin\r\nfrom math import ceil, log\r\n\r\nrd = stdin.readline\r\n\r\nx, y = map(int, rd().split())\r\n\r\ncopy_type1 = y - 1\r\nif x < copy_type1 or copy_type1 < 0: print(\"No\")\r\n\r\nelse:\r\n if (x % 2 != y % 2 and y != 1) or (x == 0 and y ==1): print(\"Yes\")\r\n else: print(\"No\")\r\n\r\n \r\n", "# import sys\r\n# input = sys.stdin.readline\r\n# for _ in range(int(input())):\r\nx,y = map(int,input().split(\" \"))\r\nif y == 0:\r\n print(\"No\")\r\nelif y == 1:\r\n if x == 0:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\nelse:\r\n if y <= x+1:\r\n if (x-y+1)%2 == 0:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n else:\r\n print(\"No\")", "x,y = map(int, input().split())\r\nif (y == 0) or (y == 1 and x > 0) or (x < y - 1):\r\n print(\"No\")\r\nelse:\r\n no_of_original_toys = y\r\n no_of_copies = y-1\r\n if no_of_copies % 2 == x % 2:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")", "import sys\r\nc, o = map(int, sys.stdin.readline().split())\r\nif o > 0 and (o - c == 1 or (1 < o < c and (c - o) % 2)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, m = map(int, input().split())\r\nif (m - 1) > n or m== 0:\r\n print(\"No\")\r\nelif (m-1)==0 and n!=0:\r\n print(\"No\")\r\nelse:\r\n t1 = m-1\r\n if t1 % 2 == 0 and n % 2 == 0:\r\n print(\"Yes\")\r\n elif t1 % 2 != 0 and n % 2 != 0:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")", "x,y = map(int, input().split())\n\nif (x==0 and y==1) or (y > 1 and (y-1) <= x and x - (y-1)&1 == 0):\n print('Yes')\nelse:\n print('No')\n\n", "x,y=map(int,input().split())\r\nif y==0:\r\n print('No')\r\nelif y==1:\r\n if x==0:\r\n print('Yes')\r\n else:\r\n print('No')\r\nelse:\r\n if(x-y+1)<0:\r\n print('No')\r\n elif (x-y+1)%2==1:\r\n print('No')\r\n else:\r\n print('Yes')", "x,y=map(int,input().split())\r\nif y==0:\r\n print(\"No\")\r\nelif y==1:\r\n if x==0:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\nelse:\r\n if x>=y-1 and (x-y+1)%2==0:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")", "x,y=map(int,input().split())\r\nxx=y-1\r\nif y==0 or (y==1 and x>0) or xx>x or (x-xx)%2:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "x,y = [int(x) for x in input().split()]\r\nif y>1 and x>=y-1:\r\n if y%2==0:\r\n if x%2!=0:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n if y%2!=0:\r\n if x%2==0:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\nelif x==0 and y==1:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n ", "x, y = map(int, input().split())\r\n\r\nif y == x + 1:\r\n print(\"Yes\")\r\nelif y >= x or y == 0 or (y == 1 and x > 0):\r\n print(\"No\")\r\nelse:\r\n c = y-1\r\n if (x-c)%2 == 0:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")", "n, m = map(int,input().split())\r\nif m == 0:\r\n print('No')\r\nelif m == 1 and n > 0:\r\n print('No')\r\nelif ((n-m)+1) % 2 == 0 and ((n-m)+1) >= 0:\r\n print('Yes')\r\nelse:\r\n print('No')", "x,y=map(int, input().split())\r\nif(abs(x-y)%2)==0 or (y==1 and x!=0) or y-x>1 or y==0:\r\n\tprint('No')\r\nelse:\r\n\tprint('Yes')", "x, y = map(int, input().split())\r\nif y == 0 or y == 1 and x or x < (y - 1) or (x - y) % 2 == 0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n,m = map(int,input().split())#inputing value of number of copies and number of toys ramesh has\r\nif (n==0 and m==1):\r\n print(\"Yes\")\r\nelif(m==0 or n==0 or m==1 or m-1>n):\r\n print(\"No\")\r\nelif((n-(m-1))%2==0):\r\n print(\"Yes\\n\")\r\nelse:\r\n print(\"No\\n\")", "x,y=input().split()\r\nx=int(x)\r\ny=int(y)\r\nif y==0:\r\n print('No')\r\nelif y==1:\r\n if x==0:\r\n print('Yes')\r\n else:\r\n print('No')\r\nelif x>=y-1 and (x-y+1)%2==0:\r\n print('Yes')\r\n\r\nelse:\r\n print('No')", "def main():\r\n copies, originals = map(int, input().split())\r\n\r\n c1 = originals - 1\r\n if c1 == 0:\r\n if copies > 0:\r\n print(\"No\")\r\n else:\r\n c2 = (copies - originals + 1) / 2\r\n if c2 >= 0 and c2.is_integer():\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n elif c1 < 0:\r\n print(\"No\")\r\n else:\r\n c2 = (copies - originals + 1) / 2\r\n if c2 >= 0 and c2.is_integer():\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "if __name__ == '__main__':\r\n x, y = map(int, input().split())\r\n y -= 1\r\n print(\"YNEOS\"[y < 0 or y > x or (y == 0 and x != 0) or (x - y) % 2::2])", "# LUOGU_RID: 101738252\nx, y = map(int, input().split())\r\nif y == 1 and x > 0:\r\n exit(print('No'))\r\nif y < 1 or (x - y + 1) % 2 or (x - y + 1) // 2 < 0:\r\n print('No')\r\nelse:\r\n print('Yes')", "#https://codeforces.com/problemset/problem/922/A\nc,o=map(int,input().split())\n\nif o==0 or( o==1 and c!=0):\n\tprint('No')\nelse:\n\to-=1\n\tif c>=o and c-o&1==0:\n\t\tprint('Yes')\n\telse:\n\t\tprint('No')\n", "x, y = list(map(int, input().split(\" \")))\r\n\r\nif(x < y - 1 or y == 0 or (y == 1 and x != 0)):\r\n print(\"No\")\r\nelse:\r\n if(x % 2 != y % 2):\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")", "rc,ro=map(int,input().split())\r\no=1\r\nc=0\r\nif ro==0 or (ro==1 and rc>0):\r\n print(\"No\")\r\n exit()\r\nelse:\r\n o=o+o*(ro-1)\r\n c=c+ro-1\r\n rc=rc-c\r\n print(\"Yes\") if rc%2==0 and rc>=0 else print(\"No\")\r\n", "x,y=map(int,input().split())\r\nif ( ((x%2)==(y%2)) or (y<2 and x>0) or (x+1<y)):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "x, y = map(int, input().split())\nprint('Yes' if (x > y and (((x-y+1) % 2 == 0) and (x != 0 and y != 1) and y > 0) or (x == 0 and y == 1))\n or (x < y and y-x == 1) else 'No')\n\t\t \t \t \t\t\t \t \t \t\t\t\t\t\t", "x,y=map(int,input().split())\r\n\r\n\r\n\r\nif y<1 or(y==1 and x>0) or x+1<y or(x-y-1)%2:\r\n\tprint(\"No\")\r\nelse:\r\n\tprint(\"Yes\")", "#Ramesh and his toys\r\n\r\nrc,ro = map(int,input().split()) #required orginal, required copy\r\no = 1 #initial orginal\r\nc = 0 #initial copy\r\nif ro==0 or (ro==1 and rc>0): #If the number of orginals is 0 or if he needs only one org. and more than 1 copy, he cannot achieve his needs\r\n print(\"No\")\r\n exit()\r\nelse: \r\n o=o+o*(ro-1) #This is what you get\r\n c=c+ro-1 #After cloning the original for the required times\r\n\r\n rc=rc-c #If the remaining copies required is even, he can achieve his needs\r\n print(\"Yes\") if rc%2==0 and rc>=0 else print(\"No\")\r\n", "x, y = map(int, input().split())\r\n\r\nif (y == 0) or (x < y - 1) or ((y == 1) and (x != 0)):\r\n print('No')\r\n exit()\r\n\r\nprint('No' if (x - y + 1) % 2 else 'Yes')\r\n", "# -*- coding:utf-8 -*-\n\nif __name__ == '__main__':\n x, y = map(int, input().split())\n \n def get_res(x, y):\n if y <= 0 or y == 1 and x > 0:\n return \"No\"\n r = x - y + 1\n if r < 0:\n return \"No\"\n return \"Yes\" if r % 2 == 0 else \"No\"\n\n print(get_res(x, y))\n\n\t \t \t \t \t\t\t \t\t \t \t\t\t \t\t\t \t", "c,o=map(int,input().split())\r\n \r\nif ((c-o)%2!=0 and o>1 and c>=o-1) or o==1 and c==0:\r\n print('Yes')\r\nelse:\r\n print('No')", "x,y=[int(num) for num in input().split()]\r\nc=x-(y-1)\r\nif y==0:\r\n print('No')\r\nelif y==1:\r\n if x!=0:\r\n print('No')\r\n else:\r\n print('Yes') \r\nelse:\r\n if c%2==0 and c>=0:\r\n print('Yes')\r\n else:\r\n print('No')\r\n", "x,y=map(int,input().split())\r\nif((y==0 and x>=0) or (x==y) or (y==1 and x>0)or (x<y-1)):\r\n print(\"No\")\r\nelif x==y-1:\r\n print(\"Yes\")\r\nelse:\r\n copy =(y-1)\r\n if (x-copy)%2==0:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")", "n,k=map(int,input().split())\r\nif k==0 or k==1 and n>0:\r\n print(\"NO\")\r\nelif k==1 and n==0:\r\n print(\"YES\")\r\nelif(n-k+1)<0:\r\n print(\"NO\")\r\nelif (n-k+1)%2==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "x, y = map(int, input().split())\r\nif y == 0 and x != 0:\r\n print('No')\r\nelif y == 1 and x != 0:\r\n print('No')\r\nelse:\r\n if (x - y + 1) % 2 == 0 and x - y + 1 >= 0:\r\n print('Yes')\r\n else:\r\n print('No')", "x, y = map(int, input().split())\n\nif y == 1 and x == 0:\n print(\"YES\")\nelif x >= y-1 and (x-(y-1))%2 == 0 and y-1 >= 1:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "x,y=map(int, input().split())\nprint(['No','Yes'][(x,y)==(0,1)or x+2>y>1and(x-y)%2])\n\t \t\t \t\t \t \t\t\t\t\t \t\t \t\t\t\t\t \t", "import math\r\nc,o = map(int, input().strip().split(' '))\r\n#n=int(input())\r\n#lst = list(map(int, input().strip().split(' ')))\r\nc-=(o-1)\r\nif o==1 and c==0:\r\n print('yes')\r\nelif c%2==0 and c>=0 and o>1:\r\n print('yes')\r\nelse:\r\n print('no')", "x,y=map(int,input().split())\r\nif x==0 and y==1:\r\n print(\"yes\")\r\nelif y==1:\r\n print(\"no\")\r\nelse:\r\n if x+2>y and (x-y+1)%2==0 and y>0 and x>=y-1:\r\n print(\"yes\")\r\n else:\r\n print(\"no\")\r\n", "x, y = map(int, input().split())\r\nk = x+y\r\nif k%2 == 0:\r\n print('No')\r\nelse:\r\n k //= 2\r\n if k > x:\r\n print('No')\r\n else:\r\n x1 = x-k\r\n y1 = k-x1\r\n if y1 < 0:\r\n print('No')\r\n else:\r\n if y1 == 0 and x > 0:\r\n print('No')\r\n else:\r\n print('Yes')", "n,m = [int(i) for i in input().split()]\r\nm -= 1\r\nn -= m\r\n\r\nif n<0 or n%2!=0 or m<0 or (m==0 and n!=0):\r\n\tprint('No')\r\nelse:\r\n\tprint('Yes')", "x,y=map(int,input().split())\r\nif ((y>1 or not x and y!=1) and x>=y-1 and (x-y)%2)or not x and y==1:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "def get_ints():\r\n return map(int, input().strip().split())\r\n\r\ndef get_list():\r\n return list(map(int, input().strip().split()))\r\n\r\ndef get_string():\r\n return input().strip()\r\n\r\nx, y = get_ints()\r\n\r\ncopiesFromOriginals = (y-1)\r\nremainingCopies = x - copiesFromOriginals\r\n\r\nif y == 0:\r\n print(\"No\")\r\nelif y == 1:\r\n if x == 0:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\nelif remainingCopies < 0 or remainingCopies%2 != 0:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")\r\n", "copies, original = map(int, input().strip().split())\nif original == 0:\n print(\"NO\")\nelif original == 1:\n # we cannot apply duplicate\n print(\"YES\" if copies == 0 else \"NO\")\nelse:\n # we already have a single copy at the beginning so would need original -1 at the end\n # thus we have to apply original -1 duplication and get that many copies as well\n extraCopiesRequired = copies - original + 1\n print(\"NO\" if extraCopiesRequired < 0 or extraCopiesRequired&1 else \"YES\")\n", "def solve(x,y) -> str: \r\n if y == 0:\r\n return 'No'\r\n if y == 1:\r\n if x == 0:\r\n return 'Yes'\r\n else:\r\n return 'No'\r\n \r\n x -= (y-1)\r\n if x < 0:\r\n return 'No'\r\n \r\n if x % 2 == 0:\r\n return 'Yes'\r\n else:\r\n return 'No'\r\n\r\n\r\nx, y= map(int, input().split()) \r\nprint(solve(x,y))\r\n", "y,x = map(int,input().split())\r\nif x==0:\r\n print(\"No\")\r\nelif y==0:\r\n if x==1:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\nelif x==1:\r\n if y==0:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\") \r\nelif y<x-1:\r\n print(\"No\")\r\nelif (y-x+1)%2!=0:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\") ", "x,y=map(int,input().split())\r\nx1=x-y+1\r\nif(y==0 or (x1==x and x!=0) or x1<0 or x1%2!=0):\r\n print('No')\r\nelse:\r\n print('Yes')\r\n", "x,y=map(int,input().split())\r\nprint(['No','Yes'][(x,y)==(0,1)or x+2>y>1 and(x-y)%2])", "x, y=map(int, input().split())\r\nif y==0:\r\n\tprint(\"No\")\r\nelif y==1:\r\n\tif x==0:\r\n\t\tprint(\"Yes\")\r\n\telse:\r\n\t\tprint(\"No\")\r\nelse:\r\n\tprint(\"Yes\" if x>=y-1 and (x-y+1)%2==0 else \"No\")", "x , y = map(int , input('').split())\r\no = 1\r\n\r\nif y > 1:\r\n y -= 1\r\n if x >= y:\r\n print('YES' if (x-y) % 2 == 0 else 'NO')\r\n else:\r\n print('NO')\r\nelif y == 1:\r\n if x < y:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')\r\n", "from sys import stdin,stdout\r\n\r\nx,y=map(int, stdin.readline().split())\r\nx=x-y+1\r\nif y==0 or (y==1 and x!=0) or x<0 or x%2:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")\r\n", "x, y = map(int,input().split())\r\n\r\ny = y-1\r\nx = x-y\r\nif y == 0 and x > 0:\r\n print(\"NO\")\r\n \r\nelif x%2==0 and x >= 0 and y >= 0: \r\n print(\"YES\")\r\nelse:print(\"NO\")", "x,y = list(map(int,input().split()))\r\nl = y-1\r\nif y==0:\r\n print(\"NO\")\r\nelif y==1:\r\n if x==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n if x<l:\r\n print(\"NO\")\r\n else:\r\n if (x-l)%2==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "n, k= map(int, input().split())\nprint(\"No\" if abs(n-k)%2==0 or k-n>1 or k==0 or (k==1 and n>0) else \"Yes\")", "n,m=map(int,input().split())\r\nif (n-m-1)%2==0 and n>=m-1 and m>1:\r\n\tprint(\"YES\")\r\nelif m==1 and n==0:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "x,y=map(int,input().split())\r\nif ( (x+1<y) or ((x%2)==(y%2)) or (y<2 and x>0)):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "\r\nclass Solution(object):\r\n def __init__(self):\r\n return \r\n \r\n def solve(self):\r\n copies, original = [int(i) for i in input().split(\" \")]\r\n if copies < original-1:\r\n return \"NO\"\r\n\r\n if original == 0:\r\n return \"NO\"\r\n\r\n if original == 1 and copies > 0:\r\n return \"NO\"\r\n\r\n if (copies - (original-1)) % 2 != 0:\r\n return \"NO\"\r\n\r\n return \"YES\" \r\n\r\ns = Solution()\r\nprint(s.solve())\r\n \r\n \r\n\r\n\r\n\r\n", "import math\r\na,b=[int(i) for i in input().split()]\r\nc=abs((b-1)-a)\r\nif(a<(b-1)):\r\n print(\"No\") \r\nelif(b==0 and a>0):\r\n print(\"No\")\r\nelif(b==1 and a>0):\r\n print(\"No\")\r\n \r\nelse: \r\n if(c%2==0 and (b-1)<=a):\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n", "# t = int(input())\r\n# for _ in range(t):\r\n# n, k = map(int, input().split())\r\n# s = list(map(int, input().split()))\r\n# s.sort()\r\n# res = s[0]\r\n# for i in range(1, len(s)):\r\n# res = max(res, (s[i] - s[i-1])//2 + 1)\r\n# res = max(res, n - s[-1] + 1)\r\n# print(res)\r\n\r\nx, y = map(int, input().strip().split())\r\nk1 = y-1\r\nif (x-k1) % 2 == 0:\r\n k2 = (x-k1)/2\r\n if (k2 > 0 and k1 > 0) or k2 == 0:\r\n print('Yes')\r\n exit(0)\r\nprint('No')", "x, y = map(int, input().split())\r\nprint('Yes' if (x - y) % 2 == 1 and y - x <= 1 and y > 0 and (x == 0 or y > 1) else 'No')", "n, m = map(int, input().split())\r\n\r\nif m < 1:\r\n print('No')\r\nelif m == 1:\r\n if n == 0: print('YES')\r\n else: print('No')\r\nelse:\r\n n -= m-1\r\n #print(n)\r\n if n >= 0 and n%2 == 0:\r\n print('Yes')\r\n else:\r\n print('No')", "c,a=map(int,input().split())\r\na=a-1\r\nif c-a>=0 and (c-a)%2==0 and (a>0 or c==0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\r\n\r\n\r\n\r\n\r\nn,k = map(int,input().split())\r\n\r\na=(k-1)\r\nif k==0:\r\n print('No')\r\nelif k-1==0 and n>0:\r\n print('No')\r\nelse:\r\n if n==a:\r\n print('Yes')\r\n elif n>a:\r\n if (n-a)%2==0:\r\n print('Yes')\r\n else:\r\n print('No')\r\n else:\r\n print('No')\r\n", "p,s=(map(int,input().split()))\np=(p-s+1)\nif s==0 or(s==1 and p!=0) or p<0 or p%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", "x,y=map(int,input().split())\r\nif 0<=x and y<=10**9:\r\n if (y==0)or(y==1 and x>0)or(x%2==y%2)or(x<y-1):\r\n print('No')\r\n else:\r\n print('Yes')", "x,y=map(int,input().split())\r\n#x= no. of copy\r\n#y= no.of original\r\nif(y==0):\r\n print('No')\r\nelif(y==1) and (x>1):\r\n print('No')\r\nelif (x<y) and (y-x>2):\r\n print('No')\r\nelif(abs(x-(y-1))%2==0):\r\n print('Yes')\r\nelse:\r\n print('no')\r\n", "x, y = map(int, input().split())\r\n\r\nif y == 0 or y == 1 and x != 0 or y > x + 1 or (x - y) % 2 != 1:\r\n print('No')\r\nelse:\r\n print(\"Yes\")", "import sys\r\n\r\ndef get_ints(): return map(int, input().split())\r\ndef get_list(): return list(map(int, input().split()))\r\ndef get_string(): return input().strip()\r\ndef get_strings(n): return [get_string() for _ in range(n)]\r\ndef get_ints_with_index(): return [(int(x), i) for i, x in enumerate(input().split())]\r\n\r\ndef solve(a, b):\r\n if b == 0:\r\n return \"No\"\r\n if b == 1:\r\n if a == 0:\r\n return \"Yes\"\r\n else:\r\n return \"No\"\r\n x = b - 1\r\n a -= x\r\n if a == 0:\r\n return \"Yes\"\r\n if a < 0:\r\n return \"No\"\r\n a += 1\r\n y = a - 1\r\n if y % 2 == 0:\r\n return \"Yes\"\r\n else:\r\n return \"No\"\r\n\r\nif __name__ == '__main__':\r\n a, b = get_ints()\r\n print(solve(a, b))\r\n", "copies,original = map(int,input().split())\r\n\r\nif original==0:\r\n print(\"No\")\r\nelse:\r\n original_gen = original - 1\r\n copies_gen = original_gen\r\n if (copies ==0 and copies_gen!=0) or (copies_gen==0 and copies!=0):\r\n print(\"No\")\r\n elif copies_gen<=copies and (copies-copies_gen)%2==0:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n", "y, x = map(int, input().split())\r\no = 1\r\nc = 0\r\nflag = False\r\nif x >= o:\r\n o = x\r\n c = x - 1\r\n if c > y:\r\n flag = False\r\n elif c == y:\r\n flag = True\r\n else:\r\n if c > 0:\r\n d = y - c\r\n if d % 2 == 0:\r\n flag = True\r\n else:\r\n flag = False\r\n else:\r\n flag = False\r\nprint(\"Yes\" if flag else \"NO\")" ]

[ "# ========= /\\ /| |====/|\r\n# | / \\ | | / |\r\n# | /____\\ | | / |\r\n# | / \\ | | / |\r\n# ========= / \\ ===== |/====| \r\n# code\r\n\r\ndef main():\r\n a,b,m = map(int , input().split())\r\n v = [int(i) for i in input().split()]\r\n\r\n pos = [a/2,m,0]\r\n\r\n while pos[1] != 0:\r\n # print(pos)\r\n k = 1e9\r\n j = -1\r\n for i in range(3):\r\n if v[i] == 0:\r\n continue\r\n if v[i] < 0:\r\n t = pos[i]/(-1 * v[i])\r\n if t < k:\r\n k = t\r\n j = i\r\n else:\r\n l = a if i == 0 else b\r\n t = (l - pos[i])/v[i]\r\n if t < k:\r\n k = t\r\n j = i\r\n \r\n if v[j] < 0:\r\n pos[j] = 0\r\n for i in range(3):\r\n if i != j:\r\n pos[i] += v[i]*k\r\n v[j] = -1 * v[j]\r\n else:\r\n pos[j] = a if j == 0 else b\r\n for i in range(3):\r\n if i != j:\r\n pos[i] += v[i]*k\r\n v[j] = -1 * v[j]\r\n\r\n print(pos[0] , pos[2])\r\n return\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import math\r\nimport queue\r\n\r\n\r\n# -------- info --------\r\n\r\n# https://codeforces.com/profile/Wolxy\r\n\r\n# -------- solve --------\r\n\r\ndef solve() -> None:\r\n a, b, m = map(int, input().split(' '))\r\n vx, vy, vz = map(int, input().split(' '))\r\n vy = -vy\r\n x, z = a / 2 + vx * m / vy, vz * m / vy\r\n # print(x, z)\r\n c, f = math.ceil(x / a), math.floor(x / a)\r\n if c == f:\r\n if f % 2 == 0:\r\n x = 0\r\n else:\r\n x = a\r\n elif f % 2 == 0:\r\n x = x - f * a\r\n else:\r\n x = c * a - x\r\n c, f = math.ceil(z / b), math.floor(z / b)\r\n if c == f:\r\n if f % 2 == 0:\r\n z = 0\r\n else:\r\n z = b\r\n elif f % 2 == 0:\r\n z = z - f * b\r\n else:\r\n z = c * b - z\r\n print(x, z, sep=' ')\r\n\r\n# -------- main --------\r\n\r\n\r\nT = 1\r\n# T = int(input())\r\nfor _ in range(T):\r\n solve()\r\n", "R=lambda:map(int,input().split())\r\na,b,m=R()\r\nx,y,z=R()\r\nt=-m/y\r\nx0=(a/2+t*x)%(2*a)\r\nif x0>a:\r\n x0=2*a-x0\r\nz0=(t*z)%(2*b)\r\nif z0>b:\r\n z0=2*b-z0\r\nprint(x0,z0)\r\n", "# https://codeforces.com/contest/203/problem/D\n\nEPS = 0.000001\n\ndef equals(f1, f2):\n return abs(f1 - f2) < EPS\n\na, b, m = map(int, input().split())\nvx, vy, vz = map(int, input().split())\nx, y, z = a / 2, m, 0\n\nwhile not equals(y, 0):\n # t = d / v\n left_wall = float('inf') if vx >= 0 else x / -vx\n right_wall = float('inf') if vx <= 0 else (a - x) / vx\n floor = float('inf') if vz >= 0 else z / -vz\n ceiling = float('inf') if vz <= 0 else (b - z) / vz\n door = y / -vy\n\n t, plane = min([(left_wall, 'left_wall'), (right_wall, 'right_wall'), (floor, 'floor'), (ceiling, 'ceiling'), (door, 'door')])\n x, y, z = (x + vx * t, y + vy * t, z + vz * t)\n\n if plane in {'left_wall', 'right_wall'}:\n vx = -vx\n elif plane in {'floor', 'ceiling'}:\n vz = -vz\n\nprint(x, z)", "import sys\n\na, b, m = map(float, sys.stdin.readline().split(' '))\nvx, vy, vz = map(float, sys.stdin.readline().split(' '))\ntime = m / abs(vy)\n\nif vx < 0:\n distx = a * 3 / 2 + time * abs(vx)\nelse:\n distx = a * 1 / 2 + time * vx\ndistz = time * vz\n\nk = int(distx / (2 * a))\ndistx -= k * 2 * a\nk = int(distz / (2 * b))\ndistz -= k * 2 * b\n\nif distx > a:\n realx = 2 * a - distx\nelse:\n realx = distx\nif distz > b:\n realz = 2 * b - distz\nelse:\n realz = distz\n\nprint(realx, realz)\n", "def f(mx, tot):\r\n while tot < 0 or tot > mx:\r\n if tot > mx:\r\n tot = 2 * mx - tot\r\n else:\r\n tot *= -1\r\n return tot\r\na, b, m = map(int, input().split())\r\nvx, vy, vz = map(int, input().split())\r\ntm = m / -vy\r\nprint(f(a, a / 2 + vx * tm), f(b, vz * tm))", "a,b,m=list(map(int,input().split(\" \")))\r\nvitesse=list(map(int,input().split(\" \")))\r\n\r\nnecessary=m/abs(vitesse[1])\r\nposition=(a/2,m,0)\r\n\r\nwhile position[1]>0:\r\n if vitesse[2]>0:\r\n time=(b-position[2])/vitesse[2]\r\n elif vitesse[2]<0:\r\n time=(position[2])/(-vitesse[2])\r\n else:\r\n time=m+1\r\n\r\n if vitesse[0]>0:\r\n tempo=(a-position[0])/vitesse[0]\r\n elif vitesse[0]<0:\r\n tempo=(-position[0])/vitesse[0]\r\n else:\r\n tempo=m+1\r\n\r\n if tempo<time:\r\n time=tempo\r\n position=[position[i]+vitesse[i]*min(time,necessary) for i in range(3)]\r\n if time<necessary:\r\n vitesse[0]=-vitesse[0]\r\n else:\r\n break\r\n elif tempo>time:\r\n position=[position[i]+vitesse[i]*min(time,necessary) for i in range(3)]\r\n if time<necessary:\r\n vitesse[2]=-vitesse[2]\r\n else:\r\n break\r\n else:\r\n position=[position[i]+vitesse[i]*min(time,necessary) for i in range(3)]\r\n if time<necessary:\r\n vitesse[0],vitesse[2]=-vitesse[0],-vitesse[2]\r\n else:\r\n break\r\n necessary-=time\r\n\r\nprint(position[0],position[2])", "# https://codeforces.com/contest/203/problem/D\n\nfrom enum import Enum\n\nclass Planes(Enum):\n L = 'left_wall'\n R = 'right_wall'\n B = 'floor'\n T = 'ceiling'\n D = 'door'\n\n def __lt__(self, other):\n return str(self) < str(other)\n\na, b, m = map(int, input().split())\nvx, vy, vz = map(int, input().split())\nx, y, z = a / 2, m, 0\n\nwhile True:\n # t = d / v\n left_wall = float('inf') if vx >= 0 else x / -vx\n right_wall = float('inf') if vx <= 0 else (a - x) / vx\n floor = float('inf') if vz >= 0 else z / -vz\n ceiling = float('inf') if vz <= 0 else (b - z) / vz\n door = y / -vy\n\n t, plane = min([(left_wall, Planes.L), (right_wall, Planes.R), (floor, Planes.B), (ceiling, Planes.T), (door, Planes.D)])\n x, y, z = (x + vx * t, y + vy * t, z + vz * t)\n\n if plane in {Planes.L, Planes.R}:\n vx = -vx\n elif plane in {Planes.B, Planes.T}:\n vz = -vz\n else: # we're at the door\n break\n\nprint(x, z)", "a, b, m = [int(i) for i in input().split()]\nvx, vy, vz = [int(i) for i in input().split()]\nm = float(m)\nt = m/abs(vy) # convert to time\nx = (vx*t+a*.5)%(2*a)\nz = vz*t % (2*b)\nx = min(x, 2*a-x)\nz = min(z, 2*b-z)\nprint(x,z)\n \t \t \t\t\t\t \t \t \t\t \t\t\t\t \t\t" ]

[ "import sys\r\nfrom array import array\r\n\r\n\r\nclass Matrix:\r\n def __init__(self, r, c, mat=None, id=None):\r\n self.r, self.c = r, c\r\n\r\n if mat != None:\r\n self.mat = [[mat[i][j] for j in range(c)] for i in range(r)]\r\n else:\r\n self.mat = [[0 for i in range(c)] for j in range(r)]\r\n\r\n if id != None:\r\n for i in range(r):\r\n self.mat[i][i] = 1\r\n\r\n def __add__(self, other):\r\n mat0 = Matrix(self.r, self.c)\r\n\r\n for i in range(self.r):\r\n for j in range(self.c):\r\n mat0[i][j] = self[i][j] + other[i][j]\r\n\r\n return mat0\r\n\r\n def __mul__(self, other):\r\n mat0 = Matrix(self.r, other.c)\r\n\r\n for i in range(self.r):\r\n for j in range(other.c):\r\n for k in range(self.c):\r\n mat0[i][j] += self[i][k] * other[k][j]\r\n mat0[i][j] %= 10 ** 9 + 7\r\n\r\n return mat0\r\n\r\n def dot_mul(self, other):\r\n res = 0\r\n for i in range(self.r):\r\n for j in range(self.c):\r\n res += self.mat[i][j] * other.mat[j][i]\r\n\r\n return res\r\n\r\n def trace(self):\r\n res = 0\r\n for i in range(self.r):\r\n res += self.mat[i][i]\r\n\r\n return res\r\n\r\n def __pow__(self, p, modulo=None):\r\n sq, mat = Matrix(self.r, self.r, id=1), self\r\n\r\n while p:\r\n if p & 1:\r\n p -= 1\r\n sq = sq * mat\r\n\r\n p //= 2\r\n mat *= mat\r\n\r\n return sq\r\n\r\n def __getitem__(self, item):\r\n return self.mat[item]\r\n\r\n\r\ninput = lambda: sys.stdin.buffer.readline().decode().strip()\r\ncity, layer, m = map(int, input().split())\r\nbe, mid, en = [array('i', [int(x) for x in input().split()]) for _ in range(3)]\r\nmem, coff, dp_ = [0] * m, [], [[0] for _ in range(m)]\r\n\r\nfor i in range(city):\r\n mem[mid[i] % m] += 1\r\n\r\nfor i in range(m):\r\n coff.append([])\r\n for j in range(m):\r\n coff[-1].append(mem[(i - j) % m])\r\n\r\nfor i in range(city):\r\n dp_[be[i] % m][0] += 1\r\n\r\ndp = (Matrix(m, m, coff) ** (layer - 2)) * Matrix(m, 1, dp_)\r\nres = 0\r\n\r\nfor i in range(city):\r\n res += dp[(-mid[i] - en[i]) % m][0]\r\nprint(res % (10 ** 9 + 7))\r\n", "# import sys\r\n# # sys.setrecursionlimit(100000)\r\n# input=lambda:sys.stdin.readline().strip()\r\n# write=lambda x:sys.stdout.write(str(x)+'\\n')\r\n\r\n# # from decimal import Decimal\r\n# # from random import randint\r\n# # from copy import deepcopy\r\n# from collections import deque,Counter\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,pow,ceil,floor,log,log2,log10,pi,sin,cos,tan,asin,acos,atan\r\n# # from functools import cmp_to_key\r\n# # from itertools import permutations,combinations\r\n\r\nimport os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\n \r\n_str = str\r\nstr = lambda x=b\"\": x if type(x) is bytes else _str(x).encode()\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\ndef mul1(a,b):\r\n res=[0]*m\r\n for i in range(m):\r\n for j in range(m):\r\n res[i]=(res[i]+a[j]*b[j][i])%mod\r\n return res\r\n\r\ndef mul2(a,b):\r\n res=[[0]*m for i in range(m)]\r\n for i in range(m):\r\n for j in range(m):\r\n for k in range(m):\r\n res[i][j]=(res[i][j]+a[i][k]*b[k][j])%mod\r\n return res\r\n\r\ndef change(t):\r\n res=[[0]*m for i in range(m)]\r\n for i in range(m):\r\n for j in range(n):\r\n res[i][(i+t[j])%m]+=1\r\n return res\r\n\r\ndef solve(n,l,m,mod):\r\n a=list(map(int,input().split()))\r\n b=list(map(int,input().split()))\r\n c=list(map(int,input().split()))\r\n sequence=[0]*m\r\n for i in range(n):\r\n sequence[a[i]%m]+=1\r\n matrix=change(b)\r\n l-=2\r\n while l:\r\n if l&1:\r\n sequence=mul1(sequence,matrix)\r\n matrix=mul2(matrix,matrix)\r\n l>>=1\r\n ans=0\r\n for i in range(n):\r\n ans=(ans+sequence[(-c[i]-b[i])%m])%mod\r\n return ans\r\n\r\n\r\nn,l,m=map(int,input().split())\r\nmod=1000000007\r\nprint(solve(n,l,m,mod))" ]

[ "from collections import Counter\r\nn,k = map(int,input().split())\r\narr = list(map(int,input().split()))\r\ndit = Counter(arr)\r\nans = 0\r\nwhile len(dit) != 1 or k not in dit:\r\n ans+=1\r\n new = {}\r\n for e in dit:\r\n if e != k:\r\n if e+1 in new:\r\n new[e+1] +=1\r\n else:\r\n new[e+1] = 1\r\n if dit[e]>1:\r\n if e in new:\r\n new[e]+=dit[e]-1\r\n else:\r\n new[e] = dit[e]-1\r\n dit = new\r\n # print(dit)\r\nprint(ans) ", "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\narr = [0]*(k+1)\r\nfor i in iia():\r\n arr[i] += 1\r\nres = 0\r\nwhile arr[-1] != n:\r\n temp = arr[:]\r\n for i in range(k):\r\n if arr[i] > 0:\r\n temp[i] -= 1\r\n temp[i + 1] += 1\r\n arr = temp[:]\r\n res += 1\r\nprint(res)\r\n", "from collections import defaultdict as df\r\nn,k=list(map(int,input().split()))\r\na=list(map(int,input().rstrip().split()))\r\nans=0\r\nmaxi=a.count(k)\r\nwhile(a.count(k)!=n):\r\n d=df(list)\r\n for i in range(n):\r\n if a[i]!=k:\r\n d[a[i]].append(i)\r\n for i in d:\r\n a[d[i][0]]+=1\r\n ans+=1\r\nprint(ans)\r\n \r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\ni = 0\r\nwhile a[0] != k:\r\n i += 1\r\n for j in range(n):\r\n if j == (n-1):\r\n if a[j] < k:\r\n a[j] += 1\r\n elif a[j] != a[j+1] and a[j] < k:\r\n a[j] += 1\r\n\r\nprint(i)", "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\n\r\nn,k = M()\r\narr = L()\r\nlst = [1]\r\nans = -1\r\nwhile lst:\r\n lst = list(filter(lambda x: x!=k, set(arr)))\r\n ans+=1\r\n for i in lst:\r\n arr[arr.index(i)]+=1\r\n\r\nprint(ans)\r\n", "import sys\r\n\r\ndef main():\r\n\r\n x = input.readline()\r\n n = int(x.split(' ')[0])\r\n k = int(x.split(' ')[1])\r\n ss = input.readline()\r\n\r\n levels = {}\r\n for i in range(1, k+1):\r\n levels[i] = 0\r\n\r\n not_max = False\r\n for s in ss.split(' '):\r\n s = int(s)\r\n if s < k:\r\n not_max = True\r\n levels[s] += 1\r\n\r\n coins = 0\r\n while not_max:\r\n not_max = False\r\n use_coin = False\r\n for i in reversed(range(1, k)):\r\n\r\n if levels[i] > 0:\r\n levels[i] -= 1\r\n levels[i+1] += 1\r\n use_coin = True\r\n\r\n if levels[i] > 0 or (levels[i+1] > 0 and i+1 < k):\r\n not_max = True\r\n\r\n if use_coin:\r\n coins += 1\r\n\r\n output.write(str(coins))\r\n\r\ndef run():\r\n\r\n global input, output\r\n input = sys.stdin\r\n output = sys.stdout\r\n\r\n main()\r\n\r\n\r\nif __name__ == '__main__':\r\n run()\r\n", "while True:\r\n\ttry:\r\n\t\tdef soln(n, k, a):\r\n\t\t\teql = False\r\n\t\t\tans = -1\r\n\t\t\t\r\n\t\t\twhile not eql :\r\n\t\t\t\teql = True\r\n\t\t\t\tfor i in range(n):\r\n\t\t\t\t\tif i+1 == n and a[i]!= k:\r\n\t\t\t\t\t\ta[i]+= 1\r\n\t\t\t\t\t\teql = False\r\n\t\t\t\t\t\t\r\n\t\t\t\t\telif a[i] != k and a[i+1] != a[i]:\r\n\t\t\t\t\t\ta[i]+= 1\r\n\t\t\t\t\t\teql = False\r\n\t\t\t\tans += 1\r\n\t\t\tprint(ans)\r\n\t\t\t\t\r\n\t\t\t\t\r\n\t\tdef read():\r\n\t\t\tn, k = map(int, input().split())\r\n\t\t\ta = list(map(int, input().split()))\r\n\t\t\tsoln(n, k, a)\r\n\t\tif __name__ == \"__main__\":\r\n\t\t\tread()\r\n\texcept EOFError:\r\n\t\tbreak", "mod = 1000000007\r\nii = lambda : int(input())\r\nsi = lambda : input()\r\ndgl = lambda : list(map(int, input()))\r\nf = lambda : map(int, input().split())\r\nil = lambda : list(map(int, input().split()))\r\nls = lambda : list(input())\r\nn,k=f()\r\nl=il()+[k]\r\nc=0\r\nwhile(set(l)!={k}):\r\n c+=1\r\n for i in range(n):\r\n if l[i]!=k and l[i]!=l[i+1]:\r\n l[i]+=1\r\nprint(c)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\nranks = list(map(int, input().split()))\r\ncount = [0 for _ in range(k + 1)]\r\nfor rank in ranks:\r\n count[rank] += 1\r\ntotal = 0\r\nres = 0\r\nfor i in range(1, k):\r\n total += count[i]\r\n if total > 0:\r\n res = max(k - i + total - 1, res)\r\nprint(res)", "coins = 0\nn , k = map(int, input().split())\nsoldier = list(map(int, input().split()))\nsoldier.sort()\nwhile soldier[0] < k:\n for i in range(n-1):\n if soldier[i] != soldier[i+1]:\n soldier[i] += 1\n soldier[n-1] += 1\n coins += 1\n\n\nprint(coins)", "def solve(x, a):\r\n a.sort()\r\n c = 0\r\n while a[0] != x:\r\n for i in range(len(a)):\r\n if i != len(a) - 1:\r\n if a[i] != a[i + 1]:\r\n a[i] = a[i] + 1\r\n else:\r\n a[i] = a[i] + 1\r\n # print(a)\r\n c = c + 1\r\n return c\r\n\r\n\r\nfor _ in range(1):\r\n x = [int(x) for x in input().split()]\r\n x = x[1]\r\n a = [int(x) for x in input().split()]\r\n print(solve(x, a))\r\n", "n,m=map(int,input().split())\nans=0\nl=list(map(int,input().split()))\nfrom collections import Counter\nd=Counter(l)\n\nwhile(d[m]<n):\n ans+=1\n for i in range(m-1,-1,-1):\n if d[i]:\n d[i]-=1\n d[i+1]+=1\nprint(ans)\n", "n,k=map(int,input().split())\nz=list(map(int,input().split()))\nlst=[1];ans=-1\nwhile lst:\n lst=list(filter( lambda x: x != k ,set(z)))\n ans+=1\n for i in lst:\n z[z.index(i)]+=1\nprint(ans)\n \t \t \t \t\t\t \t\t \t\t \t \t\t\t\t \t", "n,k = map(int, input().strip().split(' '))\r\nlst = list(map(int, input().strip().split(' ')))\r\nlst.sort()\r\ni=0\r\nwhile(lst[0]!=k):\r\n i+=1\r\n for j in range(n):\r\n if j==n-1:\r\n if lst[j]<k:\r\n lst[j]+=1\r\n elif lst[j]!=lst[j+1] and lst[j]<k:\r\n lst[j]+=1\r\nprint(i)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n ", "n, k = [int(x) for x in input().split(' ')]\r\na = [int(x) for x in input().split(' ')]\r\n\r\na_dict = {i: 0 for i in range(k + 1)}\r\n\r\nfor x in a:\r\n if x in a_dict:\r\n a_dict[x] += 1\r\n else:\r\n a_dict[x] = 1\r\n\r\nsteps = 0\r\n\r\nwhile a_dict[k] < n:\r\n a_dict = {i: a_dict[i] - int(a_dict[i] > 0 and i < k) + int(i > 0 and a_dict[i - 1] > 0) for i in range(1, k + 1)}\r\n a_dict[0] = 0\r\n steps += 1\r\nprint(steps)", "n,k=list(map(int,input().split(' ')))\r\nnums=list(map(int,input().split(' ')))\r\nans=0\r\nwhile nums[0]<k:\r\n ans+=1\r\n prev=-1\r\n for i in range(n-1,-1,-1):\r\n if nums[i]==k:\r\n continue\r\n elif prev==-1:\r\n prev=nums[i]\r\n nums[i]+=1\r\n elif prev!=-1 and nums[i]!=prev:\r\n prev=nums[i]\r\n nums[i]+=1\r\nprint(ans)\r\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, k = inp()\r\na = arr_inp()\r\na2 = a.copy()\r\nmi, ma, ans = min(a2), max(a2), 0\r\n\r\nwhile (mi != k or ma != k):\r\n a = a2.copy()\r\n for i in range(n - 1, -1, -1):\r\n if i == n - 1:\r\n if a[i] < k:\r\n a2[i] += 1\r\n elif a[i] < a[i + 1]:\r\n a2[i] += 1\r\n\r\n ans += 1\r\n mi, ma = min(a2), max(a2)\r\nprint(ans)\r\n", "u=input\r\nn,k=map(int,u().split())\r\nM=[0 for i in range(101)]\r\na=u().split()\r\nfor j in range(n):\r\n M[int(a[j])-1]+=1\r\nc=0\r\nfor l in range(10005):\r\n f=0\r\n s=[]\r\n for m in range(k-1):\r\n if(M[m]):\r\n M[m]-=1\r\n s+=[m+1]\r\n f=1\r\n for _ in s:\r\n M[_]+=1\r\n if(0==f):break\r\n c+=1\r\nprint(c)", "import sys\r\nfrom array import array # noqa: F401\r\nfrom collections import Counter\r\n\r\n\r\ndef input():\r\n return sys.stdin.buffer.readline().decode('utf-8')\r\n\r\n\r\nn, k = map(int, input().split())\r\ncounter = Counter(map(int, input().split()))\r\nans = 0\r\n\r\nwhile counter[k] < n:\r\n for i in range(k - 1, 0, -1):\r\n if counter[i]:\r\n counter[i + 1] += 1\r\n counter[i] -= 1\r\n ans += 1\r\n\r\nprint(ans)\r\n", "from collections import Counter\r\n\r\nI = lambda: map(int, input().split())\r\n\r\n_, k = I()\r\nC = Counter(I())\r\nx = 0\r\n\r\nwhile min(a for a in C if C[a]) < k:\r\n for a in list(C):\r\n C[a] -= 1\r\n if not C[a]:\r\n del C[a]\r\n C[a+1] += 1\r\n x += 1\r\n\r\nprint(x)", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nc = 0\r\nwhile True:\r\n temp = min(arr)\r\n if temp == k:\r\n break\r\n i = 0\r\n f = 1\r\n bruh = []\r\n while i < n:\r\n if arr[i] not in bruh:\r\n bruh.append(arr[i])\r\n arr[i] += 1\r\n i += 1\r\n c += 1\r\nprint(c)\r\n", "n,k=list(map(int,input().split()))\r\nl=list(map(int,input().split()))\r\nc=0\r\nwhile set(l)!={k}:\r\n t=100000000000\r\n for i in range(n-1,-1,-1):\r\n if l[i]<k and t!=l[i]:\r\n t=l[i]\r\n l[i]=l[i]+1\r\n c=c+1\r\nprint(c)", "import math\r\n\r\n\r\ndef main_function():\r\n n, k = [int(i) for i in input().split(\" \")]\r\n a = [int(i) for i in input().split(\" \")]\r\n hash_ = [0 for i in range(k + 1)]\r\n for i in a:\r\n hash_[i] += 1\r\n sum_of_h = sum(hash_)\r\n current_minus = 0\r\n total_counter = 0\r\n current_gives = False\r\n previos_gave = False\r\n while (hash_[k] < sum_of_h):\r\n total_counter += 1\r\n for i in range(1, len(hash_)):\r\n #print(hash_)\r\n current_gives = False\r\n if i == 1:\r\n if hash_[i] > 0:\r\n previos_gave = True\r\n hash_[i] -= 1\r\n else:\r\n previos_gave = False\r\n else:\r\n if i < k and hash_[i] > 0:\r\n hash_[i] -= 1\r\n current_gives = True\r\n if previos_gave:\r\n hash_[i] += 1\r\n previos_gave = current_gives\r\n print(total_counter)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main_function()", "n, k = [int(x) for x in input().split()]\r\n\r\n\r\n\r\na = list(map(int,input().strip().split()))[:n] \r\n\r\ndic1 = {}\r\n\r\nfor j in range(1,k+1):\r\n dic1[j] = 0\r\n\r\n\r\n\r\nfor i in a:\r\n dic1[i] = dic1.get(i,0) + 1\r\n\r\ncount = 0\r\n\r\nwhile dic1[k] !=n :\r\n count+=1\r\n for i in range(k-1,0,-1):\r\n if dic1[i] > 0:\r\n dic1[i] = dic1.get(i) -1\r\n dic1[i+1] = dic1.get(i+1) +1\r\n\r\n \r\n\r\n\r\nprint(count)", "n,k=map(int,input().split())\r\nL=list(map(int,input().split()))\r\nL.reverse()\r\ncoins=0\r\nvar=-1\r\nchange=0\r\nwhile(True):\r\n for i in range(n):\r\n if(L[i]<k and L[i]!=var):\r\n change+=1\r\n var=L[i]\r\n L[i]+=1\r\n if(change>0):\r\n coins+=1\r\n var=-1\r\n change=0\r\n else:\r\n break\r\nprint(coins)", "n, k = map(int, input().split())\r\ncnt = [0] * k\r\nfor i in input().split():\r\n\ti = int(i)\r\n\tcnt[i - 1] += 1\r\nans = 0\r\nwhile cnt[k - 1] != n:\r\n\t#print(cnt)\r\n\tfor i in range(k - 2, -1, -1):\r\n\t\tif cnt[i] > 0:\r\n\t\t\tcnt[i] -= 1\r\n\t\t\tcnt[i + 1] += 1\r\n\tans += 1\r\nprint(ans)", "s = input().split()\r\n(n,k) = (int(i) for i in s)\r\ns = input().split()\r\ns = [int(i) for i in s]\r\n\r\na = [0 for i in range(0,k+1)]\r\nb = a.copy()\r\nfor i in range(n):\r\n\ta[s[i]] += 1\r\n\r\n#print(a,b)\r\nc = 0\r\n\r\nwhile(a[k] < n):\r\n\tb = a.copy()\r\n\t#print(a,b)\r\n\tfor i in range(1,k):\r\n\t\tif((a[i]) > 0):\r\n\t\t\tb[i] -= 1\r\n\t\t\tb[i+1] += 1\r\n\ta = b.copy()\r\n\tc += 1\r\n\r\nprint(c)\r\n\r\n \r\n\r\n\r\n\r\n", "# link: https://codeforces.com/problemset/problem/63/B\r\n\r\nimport sys\r\n\r\nif __name__ == \"__main__\":\r\n input = sys.stdin.readline\r\n n,k = map(int, input().split())\r\n ranks = tuple(map(int, input().split()))\r\n memo = {}\r\n golden_coin = 0\r\n if len(set(ranks)) == 1 and ranks[0] == k:\r\n print(0)\r\n exit(0)\r\n # else:\r\n for i in range(n):\r\n if ranks[i] not in memo:\r\n memo[ranks[i]] = 1\r\n else:\r\n memo[ranks[i]] += 1\r\n operation_done = 1\r\n while operation_done:\r\n temp = {}\r\n operation_done = 0\r\n golden_coin += 1\r\n for key, value in memo.items():\r\n new_key = key + 1\r\n remaining = value - 1\r\n if new_key < k:\r\n operation_done = 1\r\n if new_key not in temp:\r\n temp[new_key] = 1\r\n else: \r\n temp[new_key] += 1\r\n if remaining:\r\n operation_done = 1\r\n if key not in temp:\r\n temp[key] = remaining\r\n else:\r\n temp[key] += remaining\r\n memo = temp\r\n print( golden_coin )", "numSoldiers, maxRank = map(int, input().split())\nranks = list(map(int, input().split()))\ncount = 0\n\nwhile True:\n usedRank = set()\n for i, rank in enumerate(ranks):\n if rank == maxRank or rank in usedRank:\n continue\n ranks[i] += 1\n usedRank.add(rank)\n if len(usedRank) == 0:\n break\n count += 1\n\nprint(count)\n\n", "n , k = map(int ,input().split())\r\nm = list(map(int ,input().split()))\r\ncounter = 0 \r\nwhile sum(m) < k*n:\r\n visted = [0] * (k + 1)\r\n for i in range(n) : \r\n if visted[m[i]] == 0 and m[i] < k:\r\n visted[m[i]] = 1\r\n m[i] += 1\r\n counter += 1\r\nprint(counter) \r\n \r\n", "n,k=[int(i) for i in input().split()]\r\na=list(map(int,input().split()))[:n]\r\nbh=0\r\nwhile a.count(k) != len(a):\r\n for obj in set(a):\r\n if obj != k:\r\n x = a.index(obj)\r\n a[x] += 1\r\n bh += 1\r\nprint(bh)\r\n", "\"\"\"\nOh, Grantors of Dark Disgrace, \nDo Not Wake Me Again.\n\"\"\"\n\nfrom collections import Counter\n\nn, k = map(int, input().split())\ncc = Counter(map(int, input().split()))\ncoins = 0\n\nwhile cc[k] != n:\n t = 0\n for i in range(1, k):\n if t+1 <= cc[i]:\n cc[i] -= 1\n cc[i+1] += 1\n t = 1\n else: \n t = 0\n coins += 1\n\nprint(coins)\n\n\n", "n,k=map(int,input().split())\r\narr=list(map(int,input().split()));cou=0;\r\nwhile(arr.count(k)!=len(arr)):\r\n for i in set(arr):\r\n if(i!=k):\r\n ind=arr.index(i)\r\n arr[ind]+=1\r\n cou+=1\r\nprint(cou)", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nr=0\r\nwhile(l[0]!=k):\r\n for i in range(n-1):\r\n if(l[i]!=l[i+1] and l[i]<k):\r\n l[i]=l[i]+1\r\n if(l[n-1]<k):\r\n l[n-1]=l[n-1]+1\r\n r=r+1\r\nprint(r)", "nb_sol, maximal = map(int, input().split())\r\nsoldiers = list(map(int, input().split()))\r\nreplaced = list()\r\nsteps = 0\r\nwhile 1:\r\n if soldiers == [maximal] * nb_sol:\r\n break\r\n replaced.clear()\r\n steps += 1\r\n for i, soldier in enumerate(soldiers):\r\n if soldier not in replaced and soldier < maximal:\r\n replaced.append(soldier)\r\n soldiers[i] = soldier + 1\r\nprint(steps)", "n,k=map(int,input().split())\r\na=[0]*(k+1)\r\nfor x in list(map(int,input().split())):\r\n a[x]+=1\r\nans=0\r\nwhile True:\r\n z=0\r\n for i in range(k-1,0,-1):\r\n if a[i]==0:\r\n z+=1\r\n continue\r\n else:\r\n a[i+1]+=1\r\n a[i]-=1\r\n if z==k-1:break\r\n ans+=1 \r\nprint(ans)\r\n\r\n", "n, k = map(int, input().split())\r\np = [0] * (k + 1)\r\nfor i in map(int, input().split()): p[i] += 1\r\ni = s = 0\r\nwhile p[i] == 0: i += 1\r\nwhile i != k:\r\n s += 1\r\n for j in range(i, k):\r\n if p[j]:\r\n p[j] -= 1\r\n p[j + 1] += 1\r\n if p[i] == 0: i += 1\r\nprint(s)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\nranks = list(map(int, input().split()))\r\ni = res = 0\r\nwhile i < n and ranks[i] != k:\r\n res = max(k - ranks[i] + i, res)\r\n i += 1\r\nprint(res)", "import sys\r\nimport math\r\nfrom sys import stdin, stdout\r\n\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 arr = get_ints_in_list()\r\n res = 0\r\n\r\n def all(arr,n,k):\r\n for i in range(0, n):\r\n if arr[i] != k:\r\n return True\r\n return False\r\n\r\n while all(arr,n,k):\r\n # print(\"LOOp\")\r\n i = 0\r\n arr.sort()\r\n # print(arr)\r\n\r\n while i < n:\r\n if i != n-1:\r\n if arr[i] == arr[i+1]:\r\n # print(\"YEs\",i)\r\n tmp = arr[i]\r\n if arr[i] < k:\r\n # print(arr, i)\r\n arr[i] += 1\r\n j = i+1\r\n while j < n:\r\n if arr[j] == tmp:\r\n j += 1\r\n else:\r\n i = j\r\n break\r\n if j == n:\r\n i = j\r\n else:\r\n i += 1\r\n elif arr[i] < k:\r\n arr[i] += 1\r\n i += 1\r\n else:\r\n i += 1\r\n elif arr[i] < k:\r\n arr[i] += 1\r\n i += 1\r\n else:\r\n i += 1\r\n # print(arr)\r\n res += 1\r\n print(res)\r\n\r\n \r\n\r\n# calling main Function\r\nif __name__ == \"__main__\":\r\n main()", "def main():\r\n\tn, k = map(int, input().split())\r\n\ta = list(map(int, input().split()))\r\n\r\n\tdic = {}\r\n\tfor i in range(1000):\r\n\t\tdic[i] = 0\r\n\tfor i in range(n):\r\n\t\tdic[a[i]] += 1\r\n\r\n\tcnt = 0\r\n\twhile True:\r\n\t\tcheck = 0\r\n\t\tfor key in dic:\r\n\t\t\tif key < k:\r\n\t\t\t\tcheck += dic[key]\r\n\r\n\t\tif check == 0:\r\n\t\t\tbreak\r\n\r\n\t\tchange = []\r\n\t\tfor key in dic:\r\n\t\t\tif key < k and dic[key] > 0:\r\n\t\t\t\tchange.append(key)\r\n\r\n\t\tfor key in change:\r\n\t\t\tdic[key] -= 1\r\n\t\t\tdic[key + 1] += 1\r\n\t\tcnt += 1\r\n\r\n\tprint(cnt)\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "from collections import Counter\r\nn,k=map(int,input().split()) ; arr=[int(i) for i in input().split()] ; dic=Counter(arr); ans=0\r\nfor i in dic.keys():\r\n if i>k:\r\n dic.pop(i)\r\nfor i in range(1,k+1):\r\n dic.setdefault(i,0)\r\nsumm=sum(dic.values())\r\nif k in dic.keys():\r\n summ-=dic[k]\r\nwhile summ>0:\r\n cont=[]\r\n for i in range(1,k):\r\n if i==k-1 and i not in cont:\r\n if dic[i]>0:\r\n dic[i]-=1\r\n dic[i+1]+=1\r\n summ-=1\r\n \r\n else:\r\n if dic[i]>0 and i not in cont:\r\n dic[i]-=1\r\n dic[i+1]+=1\r\n if dic[i+1]==1:\r\n cont.append(i+1)\r\n ans+=1\r\nprint(ans)\r\n", "from collections import Counter\r\nn, k = map(int, input().split())\r\nc, v = Counter(map(int, input().split())), 0\r\nwhile c[k] < n:\r\n for i in range(k - 1, 0, -1):\r\n if c[i]:\r\n c[i] -= 1\r\n c[i + 1] += 1\r\n v += 1\r\nprint(v)\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\ncnt = 0\r\nwhile a != [k]*n:\r\n i = 0\r\n cur = None\r\n while i < n:\r\n if not cur: cur = a[i]\r\n else:\r\n if a[i] != cur:\r\n a[i-1] += 1\r\n cur = a[i]\r\n i += 1\r\n if a[n-1] < k:\r\n a[n-1] += 1\r\n cnt += 1\r\nprint(cnt)", "n, k = map(int, input().split())\r\n\r\nL = list(map(int, input().split()))\r\nK = [0] * (k + 1)\r\nfor l in L:\r\n K[l] += 1\r\nans = 0\r\n\r\nwhile K[-1] != n:\r\n ans += 1\r\n for i in range(len(K) - 1, 0, -1):\r\n if K[i-1] != 0:\r\n K[i-1] -= 1\r\n K[i] += 1\r\n\r\nprint(ans)", "n,k=map(int,input().split())\nr=list(map(int,input().split()))\nc=0\nwhile r.count(k)!=n:\n s=set(r)\n for i in s:\n if i<k:\n x=r.index(i)\n r[x]+=1 \n c+=1 \nprint(c)", "soldiers,generals = map(int,input().split())\r\ngroups = list(map(int,input().split()))\r\ncoins = 0\r\n# Since an ascending order is maintained,\r\n# a coin will always be needed if the first\r\n# soilder hasn't reached the general rank\r\nwhile groups[0] < generals:\r\n coins += 1\r\n for i in range(soldiers-1):\r\n # incrementing the rank of the last\r\n # soilder in any given group\r\n # ensures an ascending order\r\n if groups[i]!=groups[i+1]:\r\n groups[i] +=1\r\n # dealing with the last soilder in the array\r\n if groups[-1] != generals:\r\n groups[-1] += 1\r\n# print the coins \r\nprint(coins)", "#t = int(input())\r\nt = 1\r\n\r\nfor tc in range(1,t+1):\r\n #n = int(input())\r\n n,k = map(int,input().split())\r\n lvls = list(map(int,input().split()))\r\n\r\n a = [0]*(k+1)\r\n for i in range(len(lvls)):\r\n a[lvls[i]]+=1\r\n\r\n ans = 0\r\n while a[k]!=n:\r\n\r\n ans+=1\r\n cur = 0\r\n for i in range(k+1):\r\n if cur==0:\r\n if a[i]==0:\r\n continue\r\n else:\r\n if i!=k:\r\n a[i]-=1\r\n cur=1\r\n else:\r\n if a[i]==0:\r\n cur=0\r\n else:\r\n if i!=k:\r\n a[i]-=1\r\n a[i]+=1\r\n\r\n print(ans)", "\r\n\r\n#B. Settlers' Training\r\n\r\nn , k = map(int,input().split())\r\narr = list(map(int,input().split()))\r\n\r\narr2 = []\r\nfor i in range(n):\r\n arr2.append(k)\r\n\r\n#print(arr2)\r\nres = 0\r\nwhile arr != arr2 :\r\n l = []\r\n for i in range(len(arr)):\r\n if (arr[i] < k and arr[i] not in l ):\r\n l.append(arr[i])\r\n arr[i] += 1\r\n\r\n res += 1\r\n l.clear()\r\n\r\nprint(res)\r\n#print(arr)\r\n\r\n\r\n\r\n", "n,k=[int(x) for x in input().split()]\r\na=[int(x) for x in input().split()]\r\nc=[0 for i in range(k)]\r\n\r\nfor i in range(n):\r\n c[a[i]-1]+=1\r\n# print(c)\r\nans=0\r\nwhile True:\r\n f=0\r\n for i in range(k-1,0,-1):\r\n if c[i-1]>0:\r\n f=1\r\n c[i]+=1\r\n c[i-1]-=1\r\n\r\n if f==0:\r\n break\r\n ans+=1\r\n # print(c)\r\nprint(ans)\r\n", "n,k = map(int,input().split())\r\nl = list(map(int,input().split()))\r\ncheck = [k]*n\r\nans = 0\r\nwhile l!=check:\r\n new = []\r\n for i in range(n):\r\n if (l[i] < k) and (l[i] not in new):\r\n new.append(l[i])\r\n l[i] += 1\r\n ans += 1\r\n new=[]\r\nprint(ans)", "n,k=map(int,input().split())\r\nvisited=[False]*(k+1)\r\nlist1=list(map(int,input().split()))\r\nc=0\r\nf=1\r\nwhile(f!=0):\r\n f=0\r\n c+=1\r\n visited=[False]*(k+1) \r\n for i in range(n):\r\n x=list1[i]\r\n if(x<k):\r\n f=1\r\n if(visited[x]==False):\r\n list1[i]+=1\r\n visited[x]=True\r\n\r\n \r\nprint(c-1)", "s = input().split()\r\nn = int(s[0])\r\nk = int(s[1])\r\ns1 = input().split()\r\na = []\r\nfor i in range(1, n + 5) :\r\n a.append(0)\r\nfor i in range(1, n + 1) :\r\n a[i] = int(s1[i - 1])\r\nsum = 0\r\nwhile (True) :\r\n if (a[1] == k) : break\r\n else :\r\n for i in range(1, n + 1) :\r\n if ((a[i] < k) and (a[i] != a[i + 1])) :\r\n a[i] += 1\r\n sum += 1\r\nprint(sum)", "n,k=[int(i) for i in input().split()]\r\na=list(map(int,input().split()))[:n]\r\nb=0\r\nwhile a.count(k)!=len(a):\r\n for i in set(a):\r\n if i!=k:\r\n x=a.index(i)\r\n a[x]=a[x]+1\r\n b=b+1\r\nprint(b)", "numSol, level = map(int, input().split())\r\nsoldiers = list(map(int, input().split()))\r\nsoldiers.sort()\r\nseen = None\r\ncounter = 0\r\nwhile sum(soldiers) < level*len(soldiers):\r\n\tfor x in range(len(soldiers)):\r\n\t\tif (soldiers[x] != seen and soldiers[x] < level) or seen is None:\r\n\t\t\tseen = soldiers[x]\r\n\t\t\tsoldiers[x] = soldiers[x] + 1\r\n\tseen = None\r\n\tcounter += 1\r\n\tsoldiers.sort()\r\n\r\nprint(counter)\r\n\r\n", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nctr=0\r\n\r\nwhile set(l)!={m}:\r\n s=set(l)\r\n for i in s:\r\n if i!=m:\r\n z=l.index(i)\r\n l[z]=l[z]+1\r\n ctr=ctr+1\r\n\r\nprint(ctr)\r\n \r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\nw = sorted(map(int, input().split()))\r\n\r\nc = 0\r\nwhile w[0] != k:\r\n for i in range(n-1):\r\n if w[i] != w[i+1]:\r\n w[i] += 1\r\n w[-1] += 1\r\n c += 1\r\nprint(c)\r\n", "\"\"\"\nOh, Grantors of Dark Disgrace, \nDo Not Wake Me Again.\n\"\"\"\n\nii = lambda: int(input())\nmi = lambda: map(int, input().split())\nli = lambda: list(mi())\nsi = lambda: input()\n\nn, k = mi()\nl = li()\n\nfrom collections import Counter\ncc = Counter(l)\ncoins = 0\n\nwhile cc[k] != n:\n t = 0\n for i in range(1, k):\n if t+1 <= cc[i]:\n cc[i] -= 1\n cc[i+1] += 1\n t = 1\n else: t = 0\n coins += 1\n\nprint(coins)\n\n\n", "\r\nfrom collections import Counter\r\n\r\n\r\n\r\ndef coincalc(nsoldiers, nranks, ranking):\r\n '''This is my reference implementation, which aims to be clear rather than fast'''\r\n # group ranks\r\n rank_count = Counter(ranking)\r\n rank_groups = tuple(rank_count[r] for r in range(1, nranks + 1))\r\n\r\n steps = [] #store all steps for ease of debugging\r\n current_state = rank_groups\r\n while current_state[-1] < nsoldiers:\r\n new_state = list(current_state)\r\n for rank in range(nranks-1):\r\n if current_state[rank] > 0:\r\n new_state[rank] = new_state[rank] - 1\r\n new_state[rank+1] += 1\r\n steps.append(new_state)\r\n current_state = new_state\r\n return steps\r\n\r\n\r\ndef main():\r\n nsoldiers, nranks = (int(x) for x in input().split())\r\n ranking = (int(x) for x in input().split())\r\n print(len(coincalc(nsoldiers, nranks, ranking)))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "n, k = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nC = [0]*(k+1)\r\nfor a in A:\r\n C[a] += 1\r\nans = 0\r\nwhile C[k] != n:\r\n for i in reversed(range(1, k)):\r\n if C[i]:\r\n C[i] -= 1\r\n C[i+1] += 1\r\n ans += 1\r\nprint(ans)\r\n", "from collections import Counter\r\nn,k=map(int,input().split())\r\nt,v,c=0,0,Counter(map(int,input().split()))\r\nwhile n!=c[k]:\r\n t=0\r\n for i in range(1,k):\r\n if c[i]>=1+t:\r\n c[i]-=1\r\n c[i+1]+=1\r\n t=1\r\n else:\r\n t=0\r\n v+=1\r\nprint(v)", "from collections import Counter\r\n\r\nif __name__ == '__main__':\r\n cin = input\r\n n, k = map(int, cin().split())\r\n d, cnt = Counter([int(i) for i in cin().split()]), 0\r\n while d[k] < n:\r\n for i in range(k - 1, 0, - 1):\r\n if d[i]:\r\n d[i + 1] += 1\r\n d[i] -= 1\r\n cnt += 1\r\n print(cnt)\r\n", "from sys import stdin,stdout\r\nimport math \r\nfrom collections import Counter,deque\r\nL=lambda:list(map(int, stdin.readline().strip().split()))\r\nM=lambda:map(int, stdin.readline().strip().split())\r\nI=lambda:int(stdin.readline().strip())\r\nIN=lambda:stdin.readline().strip()\r\nC=lambda:stdin.readline().strip().split()\r\nmod=1000000007\r\n#Keymax = max(Tv, key=Tv.get)\r\ndef s(a):print(\" \".join(list(map(str,a))))\r\n#______________________-------------------------------_____________________#\r\n#I_am_pavan\r\n'''def solve():\r\n n,k=M();a=L()\r\n count=0\r\n while a.count(k)<n:\r\n for i in set(a):\r\n if i!=k:\r\n ind=a.index(i)\r\n a[ind]=a[ind]+1\r\n count+=1\r\n print(count)'''\r\ndef solve():\r\n n,k=M();a=L()\r\n count=0\r\n b=[0]*(k+1)\r\n for i in a:b[i]+=1\r\n while b[k]<n:\r\n for i in range(k-1,0,-1):\r\n if b[i]>0:\r\n b[i]-=1\r\n b[i+1]+=1\r\n count+=1\r\n print(count)\r\nt=1\r\nfor i in range(t):\r\n solve()\r\n\r\n\r\n\r\n", "n,k=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nc=0\r\nwhile a!=[k]*n:\r\n a.sort()\r\n for i in range(1,n):\r\n if a[i]!=a[i-1]:\r\n a[i-1]+=1\r\n if a[n-1]<k:\r\n a[n-1]+=1\r\n c+=1\r\nprint(c)", "import sys\r\ndef input():\r\n return sys.stdin.readline().strip()\r\n \r\n \r\ndef iinput():\r\n return int(input())\r\n \r\n \r\ndef tinput():\r\n return input().split()\r\n \r\n \r\ndef rinput():\r\n return map(int, tinput())\r\n \r\n \r\ndef rlinput():\r\n return list(rinput())\r\n\r\nn,k = rinput()\r\nA = rlinput()\r\ncount = 0\r\nwhile A[0] != k:\r\n count += 1\r\n for i in range(n-1):\r\n if A[i] == k:\r\n break\r\n if A[i] != A[i+1]:\r\n A[i] += 1\r\n else:\r\n A[n-1] += 1\r\nprint(count)\r\n", "n,k=map(int,input().split())\r\nl=list(map(int,list(input().split())))\r\nl=sorted(l)\r\nx=-1\r\ni=0\r\ncount=0\r\nwhile(l.count(k)!=n):\r\n for i in range(n):\r\n if x!=l[i]:\r\n x=l[i]\r\n if l[i]<k:\r\n l[i]=l[i]+1\r\n l=sorted(l)\r\n x=-1\r\n count=count+1\r\nprint(count)", "n, k = list(map(int, input().split()))\r\ninitial_ranks = list(map(int, input().split()))\r\nif n == 1:\r\n print(k - initial_ranks[0])\r\nelse:\r\n coins = 0\r\n while True:\r\n if len(set(initial_ranks)) == 1 and list(set(initial_ranks))[0] == k:\r\n break\r\n coins += 1\r\n for i in range(1, n):\r\n if initial_ranks[i-1] != initial_ranks[i] and initial_ranks[i-1] < k:\r\n initial_ranks[i-1] += 1\r\n\r\n if initial_ranks[-1] < k:\r\n initial_ranks[-1] += 1\r\n\r\n print(coins)\r\n\r\n", "n, k = list(map(int,input().split())) \r\nranks = list(map(int,input().split())) \r\ncoin = 0\r\nwhile sum(ranks) != k*len(ranks):\r\n temp = []\r\n for i in range(0,len(ranks)):\r\n if ranks[i] not in temp and ranks[i] <k:\r\n temp.append(ranks[i])\r\n ranks[i]+=1 \r\n coin+=1\r\nprint(coin)\r\n", "n, k = map(int, input().split())\r\nif n==1:\r\n soldiers = [int(input())]\r\nelse:\r\n soldiers = list(map(int, input().split()))\r\n\r\nranks = [0]*(k+1)\r\nfor s in soldiers:\r\n ranks[s] += 1\r\ncoins = 0\r\nwhile ranks[k]<n:\r\n i = k-1\r\n while i>0:\r\n if ranks[i]:\r\n ranks[i] -= 1\r\n ranks[i+1] += 1\r\n i -= 1\r\n coins += 1\r\nprint(coins)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\ncnt = [0] * (k + 1)\r\nfor i in a:\r\n cnt[i] += 1\r\nans = 0\r\nwhile cnt[k] ^ n:\r\n ans += 1\r\n for i in range(k - 1, 0, -1):\r\n if not cnt[i]:\r\n continue\r\n cnt[i + 1] += 1\r\n cnt[i] -= 1\r\nprint(ans)" ]